octave-1.1.0/ 40777 415 17 0 5705522412 11044 5ustar jweusersoctave-1.1.0/BUGS100666 415 17 35653 5705321201 11651 0ustar jweusersThis file documents known bugs in Octave and describes where and how to report any bugs that you may find. Copyright (C) 1993, 1994, 1995 John W. Eaton. You may copy, distribute, and modify it freely as long as you preserve this copyright notice and permission notice. Known Causes of Trouble with Octave *********************************** This section describes known problems that affect users of Octave. Most of these are not Octave bugs per se--if they were, we would fix them. But the result for a user may be like the result of a bug. Some of these problems are due to bugs in other software, some are missing features that are too much work to add, and some are places where people's opinions differ as to what is best. Actual Bugs We Haven't Fixed Yet ================================ * Output that comes directly from Fortran functions is not sent through the pager and may appear out of sequence with other output that is sent through the pager. One way to avoid this is to force pending output to be flushed before calling a function that will produce output from within Fortran functions. To do this, use the command fflush (stdout) Another possible workaround is to use the command page_screen_output = "false" to turn the pager off. * Control-C doesn't work properly in the pager on DEC Alpha systems running OSF/1 3.0. This appears to be a bug in the OSF/1 3.0 Bourne shell. The problem doesn't appear on systems running OSF/1 1.3. * If you get messages like Input line too long when trying to plot many lines on one graph, you have probably generated a plot command that is too larger for `gnuplot''s fixed-length buffer for commands. Splitting up the plot command doesn't help because replot is implemented in gnuplot by simply appending the new plotting commands to the old command line and then evaluating it again. You can demonstrate this `feature' by running gnuplot and doing something like plot sin (x), sin (x), sin (x), ... lots more ..., sin (x) and then replot sin (x), sin (x), sin (x), ... lots more ..., sin (x) after repeating the replot command a few times, gnuplot will give you an error. Also, it doesn't help to use backslashes to enter a plot command over several lines, because the limit is on the overall command line length, once the backslashed lines are all pasted together. Because of this, Octave tries to use as little of the command-line length as possible by using the shortest possible abbreviations for all the plot commands and options. Unfortunately, the length of the temporary file names is probably what is taking up the most space on the command line. You can buy a little bit of command line space by setting the environment variable `TMPDIR' to be "." before starting Octave, or you can increase the maximum command line length in gnuplot by changing the following limits in the file plot.h in the gnuplot distribution and recompiling gnuplot. #define MAX_LINE_LEN 32768 /* originally 1024 */ #define MAX_TOKENS 8192 /* originally 400 */ Of course, this doesn't really fix the problem, but it does make it much less likely that you will run into trouble unless you are putting a very large number of lines on a given plot. * String handling could use some work. A list of ideas for future enhancements is distributed with Octave. See the file `PROJECTS' in the top level directory in the source distribution. Reporting Bugs ============== Your bug reports play an essential role in making Octave reliable. When you encounter a problem, the first thing to do is to see if it is already known. *Note Trouble::. If it isn't known, then you should report the problem. Reporting a bug may help you by bringing a solution to your problem, or it may not. In any case, the principal function of a bug report is to help the entire community by making the next version of Octave work better. Bug reports are your contribution to the maintenance of Octave. In order for a bug report to serve its purpose, you must include the information that makes it possible to fix the bug. If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function `bug_report'. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. Have You Found a Bug? ===================== If you are not sure whether you have found a bug, here are some guidelines: * If Octave gets a fatal signal, for any input whatever, that is a bug. Reliable interpreters never crash. * If Octave produces incorrect results, for any input whatever, that is a bug. * Some output may appear to be incorrect when it is in fact due to a program whose behavior is undefined, which happened by chance to give the desired results on another system. For example, the range operator may produce different results because of differences in the way floating point arithmetic is handled on various systems. * If Octave produces an error message for valid input, that is a bug. * If Octave does not produce an error message for invalid input, that is a bug. However, you should note that your idea of "invalid input" might be my idea of "an extension" or "support for traditional practice". * If you are an experienced user of programs like Octave, your suggestions for improvement are welcome in any case. Where to Report Bugs ==================== If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function `bug_report'. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. If for some reason you cannot use Octave's `bug_report' function, send bug reports for Octave to: bug-octave@che.utexas.edu *Do not send bug reports to `help-octave'*. Most users of Octave do not want to receive bug reports. Those that do have asked to be on `bug-octave'. As a last resort, send bug reports on paper to: Octave Bugs c/o John W. Eaton Department of Chemical Engineering The University of Texas at Austin Austin, Texas 78712 How to Report Bugs ================== The fundamental principle of reporting bugs usefully is this: *report all the facts*. If you are not sure whether to state a fact or leave it out, state it! Often people omit facts because they think they know what causes the problem and they conclude that some details don't matter. Thus, you might assume that the name of the variable you use in an example does not matter. Well, probably it doesn't, but one cannot be sure. Perhaps the bug is a stray memory reference which happens to fetch from the location where that name is stored in memory; perhaps, if the name were different, the contents of that location would fool the interpreter into doing the right thing despite the bug. Play it safe and give a specific, complete example. Keep in mind that the purpose of a bug report is to enable someone to fix the bug if it is not known. Always write your bug reports on the assumption that the bug is not known. Sometimes people give a few sketchy facts and ask, "Does this ring a bell?" This cannot help us fix a bug. It is better to send a complete bug report to begin with. Try to make your bug report self-contained. If we have to ask you for more information, it is best if you include all the previous information in your response, as well as the information that was missing. To enable someone to investigate the bug, you should include all these things: * The version of Octave. You can get this by noting the version number that is printed when Octave starts, or running it with the `-v' option. * A complete input file that will reproduce the bug. A single statement may not be enough of an example--the bug might depend on other details that are missing from the single statement where the error finally occurs. * The command arguments you gave Octave to execute that example and observe the bug. To guarantee you won't omit something important, list all the options. If we were to try to guess the arguments, we would probably guess wrong and then we would not encounter the bug. * The type of machine you are using, and the operating system name and version number. * The command-line arguments you gave to the `configure' command when you installed the interpreter. * A complete list of any modifications you have made to the interpreter source. Be precise about these changes--show a context diff for them. * Details of any other deviations from the standard procedure for installing Octave. * A description of what behavior you observe that you believe is incorrect. For example, "The interpreter gets a fatal signal," or, "The output produced at line 208 is incorrect." Of course, if the bug is that the interpreter gets a fatal signal, then one can't miss it. But if the bug is incorrect output, we might not notice unless it is glaringly wrong. Even if the problem you experience is a fatal signal, you should still say so explicitly. Suppose something strange is going on, such as, your copy of the interpreter is out of synch, or you have encountered a bug in the C library on your system. Your copy might crash and the copy here would not. If you said to expect a crash, then when the interpreter here fails to crash, we would know that the bug was not happening. If you don't say to expect a crash, then we would not know whether the bug was happening. We would not be able to draw any conclusion from our observations. Often the observed symptom is incorrect output when your program is run. Unfortunately, this is not enough information unless the program is short and simple. It is very helpful if you can include an explanation of the expected output, and why the actual output is incorrect. * If you wish to suggest changes to the Octave source, send them as context diffs. If you even discuss something in the Octave source, refer to it by context, not by line number, because the line numbers in the development sources probalby won't match those in your sources. Here are some things that are not necessary: * A description of the envelope of the bug. Often people who encounter a bug spend a lot of time investigating which changes to the input file will make the bug go away and which changes will not affect it. Such information is usually not necessary to enable us to fix bugs in Octave, but if you can find a simpler example to report *instead* of the original one, that is a convenience. Errors in the output will be easier to spot, running under the debugger will take less time, etc. Most Octave bugs involve just one function, so the most straightforward way to simplify an example is to delete all the function definitions except the one in which the bug occurs. However, simplification is not vital; if you don't want to do this, report the bug anyway and send the entire test case you used. * A patch for the bug. Patches can be helpful, but if you find a bug, you should report it, even if you cannot send a fix for the problem. Sending Patches for Octave ========================== If you would like to write bug fixes or improvements for Octave, that is very helpful. When you send your changes, please follow these guidelines to avoid causing extra work for us in studying the patches. If you don't follow these guidelines, your information might still be useful, but using it will take extra work. Maintaining Octave is a lot of work in the best of circumstances, and we can't keep up unless you do your best to help. * Send an explanation with your changes of what problem they fix or what improvement they bring about. For a bug fix, just include a copy of the bug report, and explain why the change fixes the bug. * Always include a proper bug report for the problem you think you have fixed. We need to convince ourselves that the change is right before installing it. Even if it is right, we might have trouble judging it if we don't have a way to reproduce the problem. * Include all the comments that are appropriate to help people reading the source in the future understand why this change was needed. * Don't mix together changes made for different reasons. Send them *individually*. If you make two changes for separate reasons, then we might not want to install them both. We might want to install just one. * Use `diff -c' to make your diffs. Diffs without context are hard for us to install reliably. More than that, they make it hard for us to study the diffs to decide whether we want to install them. Unidiff format is better than contextless diffs, but not as easy to read as `-c' format. If you have GNU diff, use `diff -cp', which shows the name of the function that each change occurs in. * Write the change log entries for your changes. Read the `ChangeLog' file to see what sorts of information to put in, and to learn the style that we use. The purpose of the change log is to show people where to find what was changed. So you need to be specific about what functions you changed; in large functions, it's often helpful to indicate where within the function the change was made. On the other hand, once you have shown people where to find the change, you need not explain its purpose. Thus, if you add a new function, all you need to say about it is that it is new. If you feel that the purpose needs explaining, it probably does--but the explanation will be much more useful if you put it in comments in the code. If you would like your name to appear in the header line for who made the change, send us the header line. How To Get Help with Octave =========================== If you need help installing, using or changing Octave, the mailing list help-octave@che.utexas.edu exists for the discussion of Octave matters related to using, installing, and porting Octave. If you would like to join the discussion, please send a short note to help-octave-request@che.utexas.edu ^^^^^^^ *Please do not* send requests to be added or removed from the the mailing list, or other administrative trivia to the list itself. octave-1.1.0/COPYING100666 415 17 43076 5150445606 12231 0ustar jweusers GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, 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. 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 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. 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 Appendix: 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. Copyright (C) 19yy 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., 675 Mass Ave, Cambridge, MA 02139, 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. , 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. octave-1.1.0/INSTALL100666 415 17 12567 5651512446 12233 0ustar jweusersThis file documents the use of Octave's configuration script and the command line options it recognizes. See the file INSTALL.OCTAVE for information specific to installing Octave. To compile this package: 1. Configure the package for your system. In the directory that this file is in, type `./configure'. 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. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation, and creates the Makefile(s) (one in each subdirectory of the source directory). In some packages it creates a C header file containing system-dependent definitions. It also creates a file `config.status' that you can run in the future to recreate the current configuration. Running `configure' takes a minute or two. While it is running, it prints some messages that tell what it is doing. If you don't want to see the messages, run `configure' with its standard output redirected to `/dev/null'; for example, `./configure >/dev/null'. To compile the package in a different directory from the one containing the source code, 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 `configure'. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. If for some reason `configure' is not in the source code directory that you are configuring, then it will report that it can't find the source code. In that case, run `configure' with the option `--srcdir=DIR', where DIR is the directory that contains the source code. By default, `make install' will install the package's files in /usr/local/bin, /usr/local/lib, /usr/local/man, etc. You can specify an installation prefix other than /usr/local by giving `configure' the option `--prefix=PATH'. Alternately, you can do so by giving a value for the `prefix' variable when you run `make', e.g., make prefix=/usr/gnu You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you give `configure' the option `--exec_prefix=PATH' or set the `make' variable `exec_prefix' to PATH, the package will use PATH as the prefix for installing programs and libraries. Data files and documentation will still use the regular prefix. Normally, all files are installed using the regular prefix. You can tell `configure' to figure out the configuration for your system, and record it in `config.status', without actually configuring the package (creating `Makefile's and perhaps a configuration header file). To do this, give `configure' the `--no-create' option. Later, you can run `./config.status' to actually configure the package. This option is useful mainly in `Makefile' rules for updating `config.status' and `Makefile'. You can also give `config.status' the `--recheck' option, which makes it re-run `configure' with the same arguments you used before. This is useful if you change `configure'. `configure' ignores any other arguments that you give it. If your system requires unusual options for compilation or linking that `configure' doesn't know about, you can give `configure' initial values for some variables by setting them in the environment. In Bourne-compatible shells, you can do that on the command line like this: CC='gcc -traditional' DEFS=-D_POSIX_SOURCE ./configure The `make' variables that you might want to override with environment variables when running `configure' are: (For these variables, any value given in the environment overrides the value that `configure' would choose:) CC C compiler program. Default is `cc', or `gcc' if `gcc' is in your PATH. INSTALL Program to use to install files. Default is `install' if you have it, `cp' otherwise. (For these variables, any value given in the environment is added to the value that `configure' chooses:) DEFS Configuration options, in the form `-Dfoo -Dbar ...' LIBS Libraries to link with, in the form `-lfoo -lbar ...' If you need to do unusual things to compile the package, we encourage you to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the README so we can include them in the next release. 2. Type `make' to compile the package. If you want, you can override the `make' variables CXXFLAGS, CFLAGS, FFLAGS, and LDFLAGS like this: make CXXFLAGS=-O2 CFLAGS=-O2 FFLAGS=-O LDFLAGS=-s 3. If the package comes with self-tests and you want to run them, type `make check'. If you're not sure whether there are any, try it; if `make' responds with something like make: *** No way to make target `check'. Stop. then the package does not come with self-tests. 4. Type `make install' to install programs, data files, and documentation. 5. You can remove the program binaries and object files from the source directory by typing `make clean'. To also remove the Makefile(s), the header file containing system-dependent definitions (if the package uses one), and `config.status' (all the files that `configure' created), type `make distclean'. The file `configure.in' is used as a template to create `configure' by a program called `autoconf'. You will only need it if you want to regenerate `configure' using a newer version of `autoconf'. octave-1.1.0/INSTALL.OCTAVE100666 415 17 32702 5705321200 13166 0ustar jweusersThis file documents the installation of Octave. Octave 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. Installing Octave ***************** Here is the procedure for installing Octave from scratch on a Unix system. For instructions on how to install the binary distributions of Octave, see *Note Binary Distributions::. * Run the shell script `configure'. This will determine the features your system has (or doesn't have) and create a file named Makefile from each of the files named Makefile.in. Here is a summary of the configure options that are most frequently used when building Octave: `--prefix=PREFIX' Install Octave in subdirectories below PREFIX. The default value of PREFIX is `/usr/local'. `--srcdir=DIR' Look for Octave sources in the directory DIR. `--with-f2c' Use f2c even if Fortran compiler is available. `--enable-dld' Use DLD to make Octave capable of dynamically linking externally compiled functions. This only works on systems that have a working port of DLD. `--enable-lite-kernel' Compile smaller kernel. This currently requires DLD so that Octave can load functions at run time that are not loaded at compile time. `--help' Print a summary of the options recognized by the configure script. See the file INSTALL for more information about the command line options used by configure. That file also contains instructions for compiling in a directory other than where the source is located. * Run make. You will need a recent version of GNU make. Modifying Octave's Makefiles to work with other make programs is probably not worth your time. We recommend you get and compile GNU make instead. For plotting, you will need to have gnuplot installed on your system. Gnuplot is a command-driven interactive function plotting program. Gnuplot is copyrighted, but freely distributable. The `gnu' in gnuplot is a coincidence--it is not related to the GNU project or the FSF in any but the most peripheral sense. For version 1.1.0, you must have the GNU C++ compiler (gcc) version 2.6.3 or later to compile Octave. You will also need version 2.6.1 of the GNU C++ class library (libg++). If you plan to modify the parser you will also need GNU bison and fles. If you modify the documentation, you will need GNU Texinfo, along with the patch for the makeinfo program that is distributed with Octave. GNU make, gcc, and libg++, gnuplot, bison, flex, and Texinfo are all available from many anonymous ftp archives, including ftp.che.utexas.edu, ftp.uu.net, prep.ai.mit.edu, and wuarchive.wustl.edu. If you don't have a Fortran compiler, or if your Fortran compiler doesn't work like the traditional Unix f77, you will need to have the Fortran to C translator f2c. You can get f2c from any number of anonymous ftp archives. The most recent version of f2c is always available from research.att.com. On an otherwise idle SPARCstation II, it will take somewhere between 60 and 90 minutes to compile everything, depending on whether you are compiling the Fortran libraries with f2c or using the Fortran compiler directly. You will need about 50 megabytes of disk storage to work with (considerably less if you don't compile with debugging symbols). To do that, use the command make CFLAGS=-O CXXFLAGS=-O LDFLAGS= instead of just `make'. * If you encounter errors while compiling Octave, first check the list of known problems below to see if there is a workaround or solution for your problem. If not, see the file BUGS for information about how to report bugs. * Once you have successfully compiled Octave, run `make install'. This will install a copy of octave, its libraries, and its documentation in the destination directory. As distributed, Octave is installed in the following directories: `PREFIX/bin' Octave and other binaries that people will want to run directly. `PREFIX/lib' Libraries like libcruft.a and liboctave.a. `PREFIX/include/octave' Include files distributed with Octave. `PREFIX/man/man1' Unix-style man pages describing Octave. `PREFIX/info' Info files describing Octave. `PREFIX/lib/octave/VERSION/m' Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. `PREFIX/lib/octave/VERSION/exec/HOST_TYPE' Executables to be run by Octave rather than the user. `PREFIX/lib/octave/VERSION/oct/HOST_TYPE' Object files that will be dynamically loaded. `PREFIX/lib/octave/VERSION/imagelib' Image files that are distributed with Octave. where PREFIX defaults to `/usr/local', VERSION stands for the current version number of the interpreter, and HOST_TYPE is the type of computer on which Octave is installed (for example, `i486-unknown-gnu'). Installation Problems ===================== This section contains a list of problems (and some apparent problems that don't really mean anything is wrong) that may show up during installation of Octave. * On AIX (and possibly other) systems, GCC 2.6.2 generates invalid assembly code when compiling some parts of Octave. On AIX systems, it is possible to get a working binary by not using the compiler flag `-fno-implicit-templates'. You can specify this as an option to make by using a command like make NO_IMPLICIT_TEMPLATES= * You may need to edit some files in the gcc include subdirectory to add prototypes for functions there. For example, Ultrix 4.2 needs proper declarations for the `signal()' and the `SIG_IGN' macro in the file `signal.h'. On some systems the `SIG_IGN' macro is defined to be something like this: #define SIG_IGN (void (*)())1 when it should really be something like: #define SIG_IGN (void (*)(int))1 to match the prototype declaration for `signal()'. The gcc fixincludes/fixproto script should probably fix this when gcc installs its modified set of header files, but I don't think that's been done yet. * There is a bug with the makeinfo program that is distributed with texinfo-3.1 that causes the indices in Octave's on-line manual to be generated incorrectly. If you need to recreate the on-line documentation, you should get the makeinfo program that is distributed with texinfo-3.1 and apply the patch for makeinfo that is distributed with Octave. See the file MAKEINFO.PATCH for more details. * If you don't have NPSOL but you still want to be able to solve NLPs, or if you don't have QPSOL but you still want to solve QPs, you'll need to find replacements or order them from Stanford. If you know of a freely redistributable replacement, please let us know--we might be interested in distributing it with Octave. You can get more information about NPSOL and QPSOL from Stanford University Office of Technology Licensing 857 Serra Street Stanford CA 94305-6225 Tel: (415) 723-0651 Fax: (415) 725-7295 Octave may soon support FSQP, an NLP solver from Andre Tits (andre@src.umd.edu) of the University of Maryland. FSQP is available free of charge to academic sites, but can not be redistributed to third parties. * Some of the Fortran subroutines may fail to compile with older versions of the Sun Fortran compiler. If you get errors like zgemm.f: zgemm: warning: unexpected parent of complex expression subtree zgemm.f, line 245: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 304: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 327: warning: unexpected parent of complex expression subtree pcc_binval: missing IR_CONV in complex op make[2]: *** [zgemm.o] Error 1 when compiling the Fortran subroutines in the `libcruft' subdirectory, you should either upgrade your compiler or try compiling with optimization turned off. * On NeXT systems with gcc 2.5.8, if you get errors like this: /usr/tmp/cc007458.s:unknown:Undefined local symbol LBB7656 /usr/tmp/cc007458.s:unknown:Undefined local symbol LBE7656 when compiling `Array.cc' and `Matrix.cc', try recompiling these files without `-g'. * Some people have reported that calls to shell_cmd and the pager do not work on SunOS systems. This is apparently due to having `G_HAVE_SYS_WAIT' defined to be 0 instead of 1 when compiling libg++. * On NeXT systems with gcc 2.5.8, linking to `libsys_s.a' may fail to resolve the following functions _tcgetattr _tcsetattr _tcflow which are part of `libposix.a'. Unfortunately, linking Octave with `-posix' results in the following undefined symbols. .destructors_used .constructors_used _objc_msgSend _NXGetDefaultValue _NXRegisterDefaults .objc_class_name_NXStringTable .objc_class_name_NXBundle One kludge around this problem is to extract `termios.o' from `libposix.a', put it in Octave's `src' directory, and add it to the list of files to link together in the Makefile. Suggestions for better ways to solve this problem are welcome! * With g++ 2.6.3 (and possibly other 2.6.x versions) on some Intel x86 systems, compiling `Array-d.cc' fails with the messages like as: /tmp/cc005254.s:4057: Local symbol LBB103 never defined. as: /tmp/cc005254.s:4057: Local symbol LBE103 never defined. A possible workaround for this is to compile without `-g'. * If Octave crashes immediately with a floating point exception, it is likely that it is failing to initialize the IEEE floating point values for infinity and NaN. If your system actually does support IEEE arithmetic, you should be able to fix this problem by modifying the function `octave_ieee_init' in the file `sysdep.cc' to correctly initialize Octave's internal infinity and NaN variables. If your system does not support IEEE arithmetic but Octave's configure script incorrectly determined that it does, you can work around the problem by editing the file `config.h' to not define `HAVE_ISINF', `HAVE_FINITE', and `HAVE_ISNAN'. In any case, please report this as a bug since it might be possible to modify Octave's configuration script to automatically determine the proper thing to do. Binary Distributions ==================== This section contains instructions for creating and installing a binary distribution. Installing Octave from a Binary Distribution -------------------------------------------- * To install Octave from a binary distribution, execute the command sh ./doinstall.sh in the top level directory of the distribution. Binary distributions are normally compiled assuming that Octave will be installed in the following subdirectories of `/usr/local'. `bin' Octave and other binaries that people will want to run directly. `man/man1' Unix-style man pages describing Octave. `info' Info files describing Octave. `lib/octave/VERSION/m' Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. `lib/octave/VERSION/exec/HOST_TYPE' Executables to be run by Octave rather than the user. `lib/octave/VERSION/imagelib' Image files that are distributed with Octave. where VERSION stands for the current version number of the interpreter, and HOST_TYPE is the type of computer on which Octave is installed (for example, `i486-unknown-gnu'). If these directories don't exist, the script `doinstall.sh' will create them for you. If this is possible for you to install Octave in `/usr/local', or if you would prefer to install it in a different directory, you can specify the name of the top level directory as an argument to the doinstall.sh script. For example: sh ./doinstall.sh /some/other/directory Octave will then be installed in subdirectories of the directory `/some/other/directory' Creating a Binary Distribution ------------------------------ Here is how to build a binary distribution for others. * Build Octave in the same directory as the source. This is required since the `binary-dist' targets in the Makefiles will not work if you compile outside the source tree. * Use `CFLAGS=-O CXXFLAGS=-O LDFLAGS=' as arguments for Make because most people who get the binary distributions are probably not going to be interested in debugging Octave. * Type `make binary-dist'. This will build everything and then pack it up for distribution. octave-1.1.0/Makefile.in100666 415 17 6551 5670435636 13231 0ustar jweusers# # Makefile for octave's src directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin # Maybe this message will prevent people from asking why the # Makefiles don't work for them. Maybe not. all: FORCE @echo "" @echo "**********************************************************" @echo "* *" @echo "* To compile Octave, you will need a recent version of *" @echo "* GNU Make. *" @echo "* *" @echo "* You will also need g++ version 2.6.3 or later, and *" @echo "* libg++ version 2.6.1 or later. *" @echo "* *" @echo "* Now would be a good time to read INSTALL.OCTAVE if *" @echo "* you have not done so already. *" @echo "* *" @echo "**********************************************************" @echo "" $(MAKE) -f octMakefile all octave-bug: FORCE $(MAKE) -f octMakefile octave-bug libcruft: FORCE $(MAKE) -f octMakefile libcruft liboctave: FORCE $(MAKE) -f octMakefile liboctave kpathsea: FORCE $(MAKE) -f octMakefile kpathsea dld: FORCE $(MAKE) -f octMakefile dld info: FORCE $(MAKE) -f octMakefile info readline: FORCE $(MAKE) -f octMakefile readline src: FORCE $(MAKE) -f octMakefile src scripts: FORCE $(MAKE) -f octMakefile scripts doc: FORCE $(MAKE) -f octMakefile doc check: FORCE $(MAKE) -f octMakefile check octave.info: FORCE $(MAKE) -f octMakefile octave.info INSTALL.info: FORCE $(MAKE) -f octMakefile INSTALL.info BUGS.info: FORCE $(MAKE) -f octMakefile BUGS.info install: FORCE $(MAKE) -f octMakefile install uninstall: FORCE $(MAKE) -f octMakefile uninstall tags: FORCE $(MAKE) -f octMakefile tags TAGS: FORCE $(MAKE) -f octMakefile TAGS clean: FORCE $(MAKE) -f octMakefile clean mostlyclean: FORCE $(MAKE) -f octMakefile mostlyclean distclean: FORCE $(MAKE) -f octMakefile distclean realclean: FORCE $(MAKE) -f octMakefile realclean clean-tar: FORCE $(MAKE) -f octMakefile clean-tar dist-z: FORCE $(MAKE) -f octMakefile dist-z links-for-dist: FORCE $(MAKE) -f octMakefile links-for-dist dist-tar: FORCE $(MAKE) -f octMakefile dist-tar clean-dist-tar: FORCE $(MAKE) -f octMakefile clean-dist-tar dist: FORCE $(MAKE) -f octMakefile dist links-for-bin-dist: FORCE $(MAKE) -f octMakefile links-for-bin-dist bin-dist-tar: FORCE $(MAKE) -f octMakefile bin-dist-tar clean-bin-dist-tar: FORCE $(MAKE) -f octMakefile clean-bin-dist-tar binary-dist: FORCE $(MAKE) -f octMakefile binary-dist doc-dist-tar: FORCE $(MAKE) -f octMakefile doc-dist-tar clean-doc-dist-tar: FORCE $(MAKE) -f octMakefile clean-doc-dist-tar doc-dist: FORCE $(MAKE) -f octMakefile doc-dist local-dist-tar: FORCE $(MAKE) -f octMakefile local-dist-tar clean-local-dist-tar: FORCE $(MAKE) -f octMakefile clean-local-dist-tar local-dist: FORCE $(MAKE) -f octMakefile local-dist split-dist: FORCE $(MAKE) -f octMakefile split-dist split-local-dist: FORCE $(MAKE) -f octMakefile split-local-dist snapshot-z: FORCE $(MAKE) -f octMakefile snapshot-z snapshot: FORCE $(MAKE) -f octMakefile snapshot snapshot-version: FORCE $(MAKE) -f octMakefile snapshot-version FORCE: octave-1.1.0/octMakefile.in100666 415 17 16671 5705370320 13746 0ustar jweusers# # Makefile for octave # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = . srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ DISTFILES = BUGS COPYING INSTALL INSTALL.OCTAVE Makefile.in \ octMakefile.in Makeconf.in NEWS PROJECTS README README.NLP \ SENDING-PATCHES THANKS f2c-compat.sh flibs.sh cxxlibs.sh \ configure configure.in config.guess config.sub float-type.c \ move-if-change octave.sh octave-bug.in octave-mode.el \ install-sh doinstall.sh mkinstalldirs config.h.in acconfig.h \ MAKEINFO.PATCH ChangeLog ChangeLog.[0-9] # Complete directory trees to distribute. DISTDIRS = bsd-math kpathsea # Subdirectories to run make in for the primary targets. SUBDIRS = libcruft liboctave @DLD_DIR@ info readline kpathsea src \ scripts doc # Subdirectories to run `make dist' in DISTSUBDIRS = libcruft liboctave info readline src scripts dld test doc BINDISTFILES = COPYING ChangeLog NEWS README THANKS INSTALL.OCTAVE \ BUGS PROJECTS octave-bug octave.sh octave-mode.el doinstall.sh \ mkinstalldirs # Subdirectories to run `make dist' in BINDISTSUBDIRS = scripts doc DIRS_TO_MAKE = $(bindir) $(fcnfiledir) $(octfiledir) $(archlibdir) \ `echo $(localfcnfilepath) | awk -F: '{for (i=1; i<=NF; i++) print $i}'` \ `echo $(localoctfilepath) | awk -F: '{for (i=1; i<=NF; i++) print $i}'` all: octave-bug for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: all octave-bug: octave-bug.in @(sed < $< > $@.tmp \ -e "s;%VERSION%;${version};" \ -e "s;%TARGET_HOST_TYPE%;${target_host_type};" \ -e "s;%F77%;${F77};" \ -e "s;%FFLAGS%;${FFLAGS};" \ -e "s;%CC%;${CC};" \ -e "s;%CFLAGS%;${BUG_CFLAGS};" \ -e "s;%CXX%;${CXX};" \ -e "s;%CXXFLAGS%;${BUG_CXXFLAGS};" \ -e "s;%DEFS%;${UGLY_DEFS};") @mv $@.tmp $@ libcruft: cd libcruft ; $(MAKE) all .PHONY: libcruft liboctave: cd liboctave ; $(MAKE) all .PHONY: liboctave kpathsea: cd kpathsea ; $(MAKE) all .PHONY: kpathsea dld: cd dld ; $(MAKE) all .PHONY: dld info: cd info ; $(MAKE) all .PHONY: info readline: cd readline ; $(MAKE) all .PHONY: readline src: cd src ; $(MAKE) all .PHONY: src scripts: cd scripts ; $(MAKE) all .PHONY: scripts doc: cd doc ; $(MAKE) all .PHONY: doc check: cd test; $(MAKE) check .PHONY: check octave.info: cd doc ; $(MAKE) octave.info .PHONY: octave.info INSTALL.info: cd doc ; $(MAKE) ../INSTALL.OCTAVE .PHONY: INSTALL.info BUGS.info: cd doc ; $(MAKE) ../BUGS .PHONY: BUGS.info install: $(top_srcdir)/mkinstalldirs $(DIRS_TO_MAKE) $(INSTALL) octave-bug $(bindir)/octave-bug for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: install uninstall: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: uninstall tags: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: tags TAGS: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: TAGS clean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: clean mostlyclean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: mostlyclean distclean: clean for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done rm -f Makefile config.cache config.log config.status .PHONY: distclean realclean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done rm -f Makefile config.status .PHONY: realclean # Now that things are under RCS control, we need to do the recursive # chmod so that the distributed files end up with reasonable modes. # Shared rules for making clean tar files. clean-tar: echo octave-$(version) > .fname tar xf `cat .fname`.tar find `cat .fname` \( \( -name RCS -a -type d \) \ -o -name '*~' -o -name '#*#' \) -print | xargs rm -rf rm -f `cat .fname`/test/octave.test/*.m rm -rf `cat .fname`/test/octave.test/npsol rm -rf `cat .fname`/test/octave.test/qpsol chmod -R a+rwX `cat .fname` tar cf `cat .fname`.tar `cat .fname` rm -rf `cat .fname` .fname .PHONY: clean-tar dist-z: echo octave-$(version) > .fname gzip --best `cat .fname`.tar rm -f .fname .PHONY: dist-z # Rules for making a source distribution. links-for-dist: octave.info INSTALL.info BUGS.info echo octave-$(version) > .fname rm -rf `cat .fname` mkdir `cat .fname` ln $(DISTFILES) `cat .fname` for dir in $(DISTDIRS); do ln -s ../$$dir `cat .fname`; done for dir in $(DISTSUBDIRS); do mkdir `cat .fname`/$$dir; cd $$dir; $(MAKE) dist; cd ..; done .PHONY: links-for-dist dist-tar: links-for-dist tar chf `cat .fname`.tar `cat .fname` rm -rf `cat .fname` .PHONY: dist-tar clean-dist-tar: dist-tar $(MAKE) clean-tar .PHONY: clean-dist-tar dist: clean-dist-tar .PHONY: dist # Rules for making a binary distribution. links-for-bin-dist: octave.info INSTALL.info BUGS.info echo octave-$(version) > .fname rm -rf `cat .fname` mkdir `cat .fname` ln $(BINDISTFILES) `cat .fname` for dir in $(BINDISTSUBDIRS); do mkdir `cat .fname`/$$dir; cd $$dir; $(MAKE) dist; cd ..; done .PHONY: links-for-dist bin-dist-tar: links-for-bin-dist -strip src/octave echo octave-$(version) > .fname ln src/octave `cat .fname`/octave -strip scripts/image/octtopnm ln scripts/image/octtopnm `cat .fname`/octtopnm tar chf `cat .fname`.tar `cat .fname` rm -rf `cat .fname` .PHONY: bin-dist-tar clean-bin-dist-tar: bin-dist-tar $(MAKE) clean-tar .PHONY: clean-bin-dist-tar binary-dist: clean-bin-dist-tar .PHONY: binary-dist # Rules for making a distribution of the docs. doc-dist-tar: echo octave-$(version) > .fname echo octave-doc-$(version).tar > .tarfname rm -rf `cat .fname` mkdir `cat .fname` ln README.doc COPYING `cat .fname` mkdir `cat .fname`/doc; cd doc; $(MAKE) doc-dist tar chf `cat .tarfname` `cat .fname` rm -rf `cat .fname` .PHONY: doc-dist-tar doc-dist: doc-dist-tar .PHONY: doc-dist # Rules for making a distribution for local use. local-dist-tar: octave.info INSTALL.info BUGS.info echo octave-local-$(version) > .fname rm -rf `cat .fname` mkdir `cat .fname` ln $(DISTFILES) `cat .fname` for dir in $(DISTDIRS); do ln -s ../$$dir `cat .fname`; done for dir in $(DISTSUBDIRS); do mkdir `cat .fname`/$$dir; cd $$dir; $(MAKE) $@; cd ..; done tar chf `cat .fname`.tar `cat .fname` rm -rf `cat .fname` .PHONY: local-dist-tar clean-local-dist-tar: local-dist-tar $(MAKE) clean-tar .PHONY: clean-local-dist-tar local-dist: clean-local-dist-tar .PHONY: local-dist # Rules for splitting a distribution. split-dist: echo octave-$(version) > .fname split -b 1350k `cat .fname`.tar.gz `cat .fname`.tar.gz- rm -f .fname .PHONY: split-dist split-local-dist: echo octave-local-$(version) > .fname split -b 1350k `cat .fname`.tar.gz `cat .fname`.tar.gz- rm -f .fname .PHONY: split-local-dist # Rules for making a snapshot. snapshot-z: snapshot-version $(MAKE) dist $(MAKE) dist-z .PHONY: snapshot-z snapshot: snapshot-z .PHONY: snapshot snapshot-version: @echo "creating src/version.h" @gawk '/static[ \t]+char[ \t]+version_string\[\] [ \t]*=/ { \ datestring = strftime("%y%m%d", systime()); \ printf("static char version_string[] = \"ss-%s\";\n", \ datestring); \ next; \ } { print $$0 }' src/version.h > src/version.h.new @$(top_srcdir)/move-if-change src/version.h.new src/version.h .PHONY: snapshot-version octave-1.1.0/Makeconf.in100666 415 17 16143 5703565064 13251 0ustar jweusers# @configure_input@ # # Common configuration rules for all of octave's Makefiles. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin SHELL = /bin/sh #### Start of system configuration section. #### LEX = @LEX@ LFLAGS = @LFLAGS@ LEXLIB = @LEXLIB@ YACC = @YACC@ YFLAGS = -dv RANLIB = @RANLIB@ RUNTEST = @RUNTEST@ DEFAULT_PAGER = @DEFAULT_PAGER@ WITH_DLD = @use_dld@ OCTAVE_LITE = @lite_kernel@ # Fortran to C translator and associated flags. F2C = @F2C@ F2CFLAGS = @F2CFLAGS@ # Fortran compiler flags. F77 = @F77@ FFLAGS = @FFLAGS@ # cc and associated flags. # Clean up INCFLAGS a bit if we are not compiling in a separate # directory. ifeq ($(srcdir),.) TMP_IF_1 = -I. -I../src else TMP_IF_1 = -I. -I$(srcdir) -I../src endif ifeq ($(TOPDIR),$(top_srcdir)) TMP_IF_2 = -I$(TOPDIR) -I$(TOPDIR)/liboctave -I$(TOPDIR)/src else TMP_IF_2 = -I$(TOPDIR) -I$(TOPDIR)/liboctave -I$(TOPDIR)/src \ -I$(top_srcdir) -I$(top_srcdir)/liboctave -I$(top_srcdir)/src endif INCFLAGS = $(TMP_IF_1) $(TMP_IF_2) LIBFLAGS = -L$(TOPDIR) DEFS = @DEFS@ UGLY_DEFS = @UGLY_DEFS@ CC = @CC@ CFLAGS = @CFLAGS@ GCC_IEEE_FP_FLAG = @GCC_IEEE_FP_FLAG@ ALL_CFLAGS = $(INCFLAGS) $(DEFS) $(GCC_IEEE_FP_FLAG) $(CFLAGS) UGLY_ALL_CFLAGS = $(INCFLAGS) $(UGLY_DEFS) $(GCC_IEEE_FP_FLAG) $(CFLAGS) BUG_CFLAGS = $(DEFS) $(GCC_IEEE_FP_FLAG) $(CFLAGS) CXX = @CXX@ CXXCPP = @CXXCPP@ CXXFLAGS = @CXXFLAGS@ NO_IMPLICIT_TEMPLATES = @NO_IMPLICIT_TEMPLATES@ HOST_CXXFLAGS = @HOST_CXXFLAGS@ ALL_CXXFLAGS = $(INCFLAGS) $(DEFS) $(HOST_CXXFLAGS) \ $(NO_IMPLICIT_TEMPLATES) $(GCC_IEEE_FP_FLAG) $(CXXFLAGS) UGLY_ALL_CXXFLAGS = $(INCFLAGS) $(UGLY_DEFS) $(HOST_CXXFLAGS) \ $(NO_IMPLICIT_TEMPLATES) $(GCC_IEEE_FP_FLAG) $(CXXFLAGS) BUG_CXXFLAGS = $(DEFS) $(HOST_CXXFLAGS) $(NO_IMPLICIT_TEMPLATES) \ $(GCC_IEEE_FP_FLAG) $(CXXFLAGS) CPPFLAGS = @CPPFLAGS@ LDFLAGS = @LDFLAGS@ LD_STATIC_FLAG = @LD_STATIC_FLAG@ ALL_LDFLAGS = $(LIBFLAGS) $(GCC_IEEE_FP_FLAG) $(LD_STATIC_FLAG) $(LDFLAGS) FLIBS = @FLIBS@ FLIB_LIST = @FLIB_LIST@ FLIB_PATH = @FLIB_PATH@ CXXLIBS = @CXXLIBS@ CXXLIB_LIST = @CXXLIB_LIST@ CXXLIB_PATH = @CXXLIB_PATH@ # A shell command to extract the version number from version.h. getversion = sed -e '/version_string/!d' -e 's/.*"\(.*\)".*/\1/' -e q # The version number. TOPDIR is something like `.' or `..' or `../..' # and gets us back up to the top level of the source tree. version := $(shell $(getversion) $(srcdir)/$(TOPDIR)/src/version.h) # ==================== Where To Install Things ==================== # The default location for installation. Everything is placed in # subdirectories of this directory. The default values for many of # the variables below are expressed in terms of this one, so you may # not need to change them. This defaults to /usr/local. prefix = @prefix@ # Like `prefix', but used for architecture-specific files. exec_prefix = @exec_prefix@ # Where to install Octave and other binaries that people will want to # run directly. bindir = @bindir@ # Where to install architecture-independent data files. ${fcnfiledir} # and ${localfcnfiledir} are subdirectories of this. datadir = @datadir@ # Where to install and expect libraries like libcruft.a, liboctave.a, # and libreadline.a, executable files to be run by Octave rather than # directly by users, and other architecture-dependent data. # ${archlibdir} is a subdirectory of this. libdir = @libdir@ # Where to install Octave's include files. The default is # ${prefix}/include/octave includedir = @includedir@ # Where to install Octave's man pages, and what extension they should # have. The default is ${prefix}/man/man1 mandir = @mandir@ manext = 1 # Where to install and expect the info files describing Octave.. infodir = @infodir@ # ==================== Octave-specific directories ==================== # These variables hold the values Octave will actually use. They are # based on the values of the standard Make variables above. # Where to install the function file distributed with # Octave. This includes the Octave version, so that the # function files for different versions of Octave will install # themselves in separate directories. fcnfiledir = @fcnfiledir@ # Directories Octave should search for function files specific # to this site (i.e. customizations), before consulting # ${fcnfiledir}. This should be a colon-separated list of # directories. localfcnfiledir = @localfcnfiledir@ localfcnfilepath = @localfcnfilepath@ # Where to put executables to be run by Octave rather than # the user. This path usually includes the Octave version # and configuration name, so that multiple configurations # for multiple versions of Octave may be installed at once. archlibdir = @archlibdir@ # Where to put object files that will by dynamically loaded. # This path usually includes the Octave version and configuration # name, so that multiple configurations for multiple versions of # Octave may be installed at once. octfiledir = @octfiledir@ # Directories Octave should search for object files that will be # dynamically loaded and that are specific to this site # (i.e. customizations), before consulting ${octfiledir}. This should # be a colon-separated list of directories. localoctfiledir = @localoctfiledir@ localoctfilepath = @localoctfilepath@ # Where Octave will search to find its function files. Before # changing this, check to see if your purpose wouldn't # better be served by changing localfcnfilepath. This # should be a colon-separated list of directories. fcnfilepath = @fcnfilepath@ # Where Octave will search to find image files.es. imagedir = @imagedir@ imagepath = @imagepath@ # The type of computer we are running on. target_host_type = @target_host_type@ # The following pattern rules and the substitution functions require # GNU make. If you don't have it, get it! # Rules for making C source from Fortran source (if necessary). # # If we are using f2c there will be a command for the `%.c : %.f' # pattern and no command for the `%.o : %.f' pattern, so that make # will not invoke the fortran compiler by mistake. # # If we are not using f2c, it should be ok to have an empty rule for # the pattern `%.c : %.f', but we don't want to replace make's default # rule for making object from Fortran source files, so there should be # no pattern or command for that. %.c : %.f @DOT_C_FROM_DOT_F_CMD@ @DOT_O_FROM_DOT_F_PAT@ # How to make .o files from .c files: .c.o: $(CC) -c $(CPPFLAGS) $(ALL_CFLAGS) $< .cc.o: $(CXX) -c $(CPPFLAGS) $(ALL_CXXFLAGS) $< # Here is a rule for generating dependencies for .cc files: %.d: %.cc @echo making $@ from $< @rm -f $@ @-if test "$(srcdir)" = "." ; then \ $(CXX) -MM $(CPPFLAGS) $(ALL_CXXFLAGS) $< | \ sed -e 's/$*\.o/& $@/g' > $@.tmp ; \ else \ $(CXX) -MM $(CPPFLAGS) $(ALL_CXXFLAGS) $< | \ sed -e 's/$*\.o/& $@/g' -e 's,$(srcdir)/,,g' > $@.tmp ; \ fi @mv $@.tmp $@ # And one for .c files.too: %.d: %.c @echo making $@ from $< @rm -f $@ @-if test "$(srcdir)" = "." ; then \ $(CC) -MM $(CPPFLAGS) $(ALL_CFLAGS) $< | \ sed -e 's/$*\.o/& $@/g' > $@.tmp ; \ else \ $(CC) -MM $(CPPFLAGS) $(ALL_CFLAGS) $< | \ sed -e 's/$*\.o/& $@/g' -e 's,$(srcdir)/,,g' > $@.tmp ; \ fi @mv $@.tmp $@ octave-1.1.0/NEWS100666 415 17 152415 5705517653 11723 0ustar jweusersSummary of changes for version 1.1.0: ------------------------------------ * Octave now requires g++ 2.6.0 or later. This change is necessary to make template instantiations cleaner, and to avoid having to have special cases in the code for earlier versions of gcc. There are still some problems even with gcc 2.6.2 though, so I hope a version including fixes for new C++-specific problems will be released soon. * A new data structure type has been added. The implementation uses an associative array with indices limited to strings, but the syntax is more like C-style structures. here are some examples of using it. Elements of structures can be of any type, including structures: octave:1> x.a = 1; octave:2> x.b = [1, 2; 3, 4]; octave:3> x.c = "string"; octave:4> x x = octave:5> x.a x.a = 1 octave:6> x.b x.b = 1 2 3 4 octave:7> x.c x.c = string octave:8> x.b.d = 3 x.b.d = 3 octave:9> x.b x.b = octave:10> x.b.d x.b.d = 3 Functions can return structures: octave:1> a = rand (3) + rand (3) * I; octave:2> function y = f (x) > y.re = real (x); > y.im = imag (x); > endfunction octave:3> f (a) ans = octave:4> ans.im ans.im = 0.093411 0.229690 0.627585 0.415128 0.221706 0.850341 0.894990 0.343265 0.384018 octave:5> ans.re ans.re = 0.56234 0.14797 0.26416 0.72120 0.62691 0.20910 0.89211 0.25175 0.21081 Return lists can include structure elements: octave:1> [x.u, x.s, x.v] = svd ([1, 2; 3, 4]) x.u = -0.40455 -0.91451 -0.91451 0.40455 x.s = 5.46499 0.00000 0.00000 0.36597 x.v = -0.57605 0.81742 -0.81742 -0.57605 octave:8> x x = This feature should be considered experimental, but it seems to work ok. Suggestions for ways to improve it are welcome. * Octave now supports a limited form of exception handling modelled after the unwind-protect form of Lisp: unwind_protect BODY unwind_protect_cleanup CLEANUP end_unwind_protect Where BODY and CLEANUP are both optional and may contain any Octave expressions or commands. The statements in CLEANUP are guaranteed to be executed regardless of how control exits BODY. This is useful to protect temporary changes to global variables from possible errors. For example, the following code will always restore the original value of the built-in variable do_fortran_indexing even if an error occurs while performing the indexing operation. save_do_fortran_indexing = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; elt = a (idx) unwind_protect_cleanup do_fortran_indexing = save_do_fortran_indexing; end_unwind_protect Without unwind_protect, the value of do_fortran_indexing would not be restored if an error occurs while performing the indexing operation because evaluation would stop at the point of the error and the statement to restore the value would not be executed. * Recursive directory searching has been implemented using Karl Berry's kpathsea library. Directories below path elements that end in // are searched recursively for .m files. * Octave now waits for additional input when a pair of parentheses is `open' instead of giving an error. This allows one to write statements like this if (big_long_variable_name == other_long_variable_name || not_so_short_variable_name > 4 && y > x) some (code, here); without having to clutter up the if statement with continuation characters. * Continuation lines are now allowed in string constants and are handled correctly inside matrix constants. * Both `...{whitespace}\n' and `\{whitespace}\n' can be used to introduce continuation lines, where {whitespace} may include spaces, tabs and comemnts. * The script directory has been split up by topic. * Dynamic linking mostly works with dld. The following limitations are known problems: -- Clearing dynamically linked functions doesn't work. -- Dynamic linking only works with dld, which has not been ported to very many systems yet. -- Configuring with --enable-lite-kernel seems to mostly work to make nonessential built-in functions dynamically loaded, but there also seem to be some problems. For example, fsolve seems to always return info == 3. This is difficult to debug since gdb won't seem to allow breakpoints to be set inside dynamically loaded functions. -- Octave uses a lot of memory if the dynamically linked functions are compiled with -g. This appears to be a limitation with dld, and can be avoided by not using -g to compile functions that will be linked dynamically. * fft2 and ifft2 are now built-in functions. * The `&&' and `||' logical operators are now evaluated in a short-circuit fashion and work differently than the element by element operators `&' and `|'. See the Octave manual for more details. * Expressions like 1./m are now parsed as 1 ./ m, not 1. / m. * The replot command now takes the same arguments as gplot or gsplot (except ranges, which cannot be respecified with replot (yet)) so you can add additional lines to existing plots. * The hold command has been implemented. * New function `clearplot' clears the plot window. The name `clg' is aliased to `clearplot' for compatibility with Matlab. * The commands `gplot clear' and `gsplot clear' are equivalent to `clearplot'. (Previously, `gplot clear' would evaluate `clear' as an ordinary expression and clear all the visible variables.) * The Matlab-style plotting commands have been improved. They now accept line-style arguments, multiple x-y pairs, and other plot option flags. For example, plot (x, y, "@12", x, y2, x, y3, "4", x, y4, "+") results in a plot with y plotted with points of type 2 ("+") and color 1 (red). y2 plotted with lines. y3 plotted with lines of color 4. y4 plotted with points which are "+"s. the help message for `plot' and `plot_opt' provide full descriptions of the options. * NaN is now dropped from plot data, and Inf is converted to a very large value before calling gnuplot. * Improved load and save commands: -- The save and load commands can now read and write a new binary file format. Conversion to and from IEEE big and little endian formats is handled automatically. Conversion for other formats has not yet been implemented. -- The load command can now read Matlab .mat files, though it is not yet able to read sparse matrices or handle conversion for all data formats. -- The save command can write Matlab .mat files. -- The load command automatically determines the save format (binary, ascii, or Matlab binary). -- The default format for the save command is taken from the builtin variable `default_save_format'. -- The save and load commands now both accept a list of globbing patterns so you can easily load a list of variables from a file. -- The load command now accepts the option -list, for listing the variable names without actually loading the data. With -verbose, it prints a long listing. -- The load command now accepts the option -float-binary, for saving floating point data in binary files in single precision. * who and whos now accept a list of globbing patterns so you can limit the lists of variables and functions to those that match a given set of patterns. * New functions for manipulating polynomials compan -- companion matrix corresponding to polynomial coefficients conv -- convolve two vectors deconv -- deconvolve two vectors roots -- find the roots of a polynomial poly -- characteristic polynomial of a matrix polyderiv -- differentiate a polynomial polyinteg -- integrate a polynomial polyreduce -- reduce a polynomial to minimum number of terms polyval -- evaluate a polynomial at a point polyvalm -- evaluate a polynomial in the matrix sense residue -- partial fraction expansion corresponding to the ratio of two polynomials * New functions for manipulating sets create_set -- create a set of unique values complement -- find the complement of two sets intersection -- find the intersection of two sets union -- find the union of two sets * New elementary functions: acot acoth acsc acsch asec asech cot coth csc csch log2 sec sech * New special functions: beta -- beta function betai -- incomplete beta function gammai -- incomplete gamma function * New image processing functions: colormap -- set and return current colormap gray -- set a gray colormap gray2ind -- image format conversion image -- display an image imagesc -- scale and display an image imshow -- display images ind2gray -- image format conversion ind2rgb -- image format conversion loadimage -- load an image from a file ntsc2rgb -- image format conversion ocean -- set a color colormap rgb2ind -- image format conversion rgb2ntsc -- image format conversion saveimage -- save an image to a file * New time and date funcitons: tic -- set wall-clock timer toc -- get elapsed wall-clock time, since timer last set etime -- another way to get elapsed wall-clock time cputime -- get CPU time used since Octave started is_leap_year -- is the given year a leap year? * Other new functions: bug_report -- submit a bug report to the bug-octave mailing list toascii -- convert a string to a matrix of ASCII character codes octave_tmp_file -- generate a unique temporary file name undo_string_escapes -- replace special characters in a string by their backslash forms is_struct -- determine whether something is a structure data type feof -- check EOF condition for a specified file ferror -- check error state for a specified file fread -- read binary data from a file fwrite -- write binary data to a file file_in_path -- check to see if named file exists in given path kbhit -- get a single character from the terminal axis -- change plot ranges hist -- plot histograms diary -- save commands and output to a file type -- show the definition of a function which -- print the type of an identifier or the location of a function file isieee -- Returns 1 if host uses IEEE floating point realmax -- Returns largest floating point number realmin -- Returns smallest floating point number gcd -- greatest common divisor lcm -- least common multiple null -- orthonormal basis of the null space of a matrix orth -- orthonormal basis of the range space of a matrix fft2 -- two-dimensional fast fourier transform ifft2 -- two-dimensional inverse fast fourier transform filter -- digital filter fftfilt -- filter using fft fftconv -- convolve to vectors using fft sinc -- returns sin(pi*x)/(pi*x) freqz -- compute the frequency response of a filter * The meaning of nargin (== args.length ()) in built-in functions has been changed to match the meaning of nargin in user-defined functions. * Variable return lists. Octave now has a real mechanism for handling functions that return an unspecified number of values, so it is no longer necessary to place an upper bound on the number of outputs that a function can produce. Here is an example of a function that uses the new syntax to produce n values: function [...] = foo (n) for i = 1:n vr_val (i * x); endfor endfunction * New keyword, all_va_args, that allows the entire list of va_args to be passed to another function. For example, given the functions function f (...) while (nargin--) disp (va_arg ()) endwhile endfunction function g (...) f ("begin", all_va_args, "end") endfunction the statement g (1, 2, 3) prints begin 1 2 3 end all_va_args may be used more than once, but can only be used within functions that take a variable number of arguments. * If given a second argument, svd now returns an economy-sized decomposition, eliminating the unecessary rows or columns of U or V. * The max and min functions correctly handle complex matrices in which some columns contain real values only. * The find function now handles 2 and 3 output arguments. * The qr function now allows computation of QR with pivoting. * hilb() is much faster for large matrices. * computer() is now a built-in function. * pinv() is now a built-in function. * The output from the history command now goes through the pager. * If a function is called without assigning the result, nargout is now correctly set to 0. * It is now possible to write functions that only set some return values. For example, calling the function function [x, y, z] = f () x = 1; z = 2; endfunction as [a, b, c] = f () produces: a = 1 b = [](0x0) c = 2 * The shell_cmd function has been renamed to system (the name shell_cmd remains for compatibility). It now returns [output, status]. * New builtin variable `OCTAVE_VERSION'. Also a new function, version, for compatibility with Matlab. * New builtin variable `automatic_replot'. If it is "true", Octave will automatically send a replot command to gnuplot each time the plot changes. Since this is fairly inefficient, the default value is "false". * New builtin variable `whitespace_in_literal_matrix' allows some control over how Octave decides to convert spaces to commas in matrix expressions like `[m (1)]'. If the value of `whitespace_in_literal_matrix' is "ignore", Octave will never insert a comma or a semicolon in a literal matrix list. For example, the expression `[1 2]' will result in an error instead of being treated the same as `[1, 2]', and the expression [ 1, 2, 3, 4 ] will result in the vector [1 2 3 4] instead of a matrix. If the value of `whitespace_in_literal_matrix' is "traditional", Octave will convert spaces to a comma between identifiers and `('. For example, given the matrix m = [3 2] the expression [m (1)] will be parsed as [m, (1)] and will result in [3 2 1] and the expression [ 1, 2, 3, 4 ] will result in a matrix because the newline character is converted to a semicolon (row separator) even though there is a comma at the end of the first line (trailing commas or semicolons are ignored). This is apparently how Matlab behaves. Any other value for `whitespace_in_literal_matrix' results in behavior that is the same as traditional, except that Octave does not convert spaces to a comma between identifiers and `('. For example, the expression [m (1)] will produce 3. This is the way Octave has always behaved. * Line numbers in error messages for functions defined in files and for script files now correspond to the file line number, not the number of lines after the function keyword appeared. * Octave now extracts help from script files. The comments must come before any other statements in the file. * In function files, the first block of comments in the file will now be interpreted as the help text if it doesn't look like the Octave copyright notice. Otherwise, Octave extracts the first set of comments after the function keyword. * The function clock is more accurate on systems that have the gettimeofday() function. * The standard output stream is now automatically flushed before reading from stdin with any of the *scanf() functions. * Expanded reference card. * The Octave distribution now includes a frequently asked questions file, with answers. Better answers and more questions (with answers!) are welcome. * New option --verbose. If Octave is invoked with --verbose and not --silent, a message is printed if an octaverc file is read while Octave is starting. * An improved configure script generated by Autoconf 2.0. * Lots of bug fixes. Summary of changes for version 1.0: ---------------------------------- * C-style I/O functions now handle files referenced by name or by number more consistently. Summary of changes for version 0.83: ----------------------------------- * Loading global symbols should work now. * Clearing the screen doesn't reprint the prompt unnecessarily. * The operations OP for OP == +, -, *, or ./ no longer crash Octave. * More portability and configuration fixes. Summary of changes for version 0.82: ----------------------------------- * Octave now comes with a reference card. * The manual has been improved, but more work remains to be done. * The atanh function now works for complex arguments. * The asin, acos, acosh, and atanh functions now work properly when given real-valued arguments that produce complex results. * SEEK_SET, SEEK_CUR, and SEEK_END are now constants. * The `using' qualifier now works with gplot and gsplot when the data to plot is coming directly from a file. * The strcmp function now works correctly for empty strings. * Eliminated bogus parse error for M-files that don't end with `end' or `endfunction'. * For empty matrices with one nonzero dimension, the +, -, .*, and ./ operators now correctly preserve the dimension. * Octave no longer crashes if you type ^D at the beginning of a line in the middle of defining a loop or if statement. * On AIX systems, Back off on indexing DiagArray via Proxy class to avoid gcc (or possibly AIX assembler?) bug. * Various other bug and portability fixes. Summary of changes for version 0.81: ----------------------------------- * Octave no longer dumps core if you try to define a function in your .octaverc file. * Fixed bug in Array class that resulted in bogus off-diagonal elements when computing eigenvalue and singular value decompositions. * Fixed bug that prevented lsode from working on the SPARCstation, at least with some versions of Sun's f77. This bug was introduced in 0.80, when I changed LSODE to allow the user to abort the integration from within the RHS function. * Fixed bug that prevented global attribute of variables from being saved with save(), and another that prevented load() from working at all. Summary of changes for version 0.80: ----------------------------------- * I have started working on a manual for the C++ classes. At this point, it is little more than a list of function names. If you would like to volunteer to help work on this, please contact bug-octave@che.utexas.edu. * The patterns accepted by the save and clear commands now work like file name globbing patterns instead of regular expressions. I apologize for any inconvenience this change may cause, but file name globbing seems like a more reasonable style of pattern matching for this purpose. * It is now possible to specify tolerances and other optional inputs for dassl, fsolve, lsode, npsol, qpsol, and quad. For each of these functions, there is a corresponding function X_options, which takes a keyword and value arguments. If invoked without any arguments, the X_options functions print a list of possible keywords and current values. For example, npsol_options () prints a list of possible options with values, and npsol_options ("major print level", 10) sets the major print level to 10. The keyword match is not case sensitive, and the keywords may be abbreviated to the shortest unique match. For example, npsol_options ("ma p", 10) is equivalent to the statement shown above. * The new builtin variable save_precision can be used to set the number of digits preserved by the ASCII save command. * Assignment of [] now works in most cases to allow you to delete rows or columns of matrices and vectors. For example, given a 4x5 matrix A, the assignment A (3, :) = [] deletes the third row of A, and the assignment A (:, 1:2:5) = [] deletes the first, third, and fifth columns. * Variable argument lists. Octave now has a real mechanism for handling functions that take an unspecified number of arguments, so it is no longer necessary to place an upper bound on the number of optional arguments that a function can accept. Here is an example of a function that uses the new syntax to print a header followed by an unspecified number of values: function foo (heading, ...) disp (heading); va_start (); while (--nargin) disp (va_arg ()); endwhile endfunction Note that the argument list must contain at least one named argument (this restriction may eventually be removed), and the ellipsis must appear as the last element of the argument list. Calling va_start() positions an internal pointer to the first unnamed argument and allows you to cycle through the arguments more than once. It is not necessary to call va_start() if you do not plan to cycle through the arguments more than once. * Recursive functions should work now. * The environment variable OCTAVE_PATH is now handled in the same way as TeX handles TEXINPUTS. If the path starts with `:', the standard path is prepended to the value obtained from the environment. If it ends with `:' the standard path is appended to the value obtained from the environment. * New functions, from Kurt Hornik (hornik@neuro.tuwien.ac.at) and the Department of Probability Theory and Statistics TU Wien, Austria: corrcoef -- corrcoef (X, Y) is the correlation between the i-th variable in X and the j-th variable in Y corrcoef (X) is corrcoef (X, X) cov -- cov (X, Y) is the covariance between the i-th variable in X and the j-th variable in Y cov (X) is cov (X, X) gls -- generalized least squares estimation kurtosis -- kurtosis(x) = N^(-1) std(x)^(-4) SUM_i (x(i)-mean(x))^4 - 3 If x is a matrix, return the row vector containing the kurtosis of each column mahalanobis -- returns Mahalanobis' D-square distance between the multivariate samples X and Y, which must have the same number of components (columns), but may have a different number of observations (rows) ols -- ordinary least squares estimation pinv -- returns the pseudoinverse of X; singular values less than tol are ignored skewness -- skewness (x) = N^(-1) std(x)^(-3) SUM_i (x(i)-mean(x))^3 if x is a matrix, return the row vector containing the skewness of each column * Errors in user-supplied functions called from dassl, fsolve, lsode, npsol, and quad are handled more gracefully. * Programming errors in the use of the C++ classes within Octave should no longer cause Octave to abort. Instead, Octave's error handler function is called and execution continues as best as is possible. This should result in eventually returning control to the top-level Octave prompt. (It would be nice to have a real exception handling mechanism...) * A number of memory leaks have been eliminated. Thanks to Fong Kin Fui for reporting them. * The C++ matrix classes are now derived from a generic template-based array class. * The readline function operate-and-get-next (from bash) is now available and bound to C-O by default. * Octave now uses the version of readline currently distributed with bash-1.13. On some systems, interactive invocations of Octave will now blink the cursor to show matching parens. * By default, include files are now installed in $prefix/include/octave instead of $prefix/include. * Octave now uses a config.h file instead of putting all defines on the compiler command line. Summary of changes for version 0.79: ----------------------------------- * New control systems functions: dgram -- Returns the discrete controllability and observability gramian. dlqr -- Discrete linear quadratic regulator design. dlqe -- Discrete linear quadratic estimator (Kalman Filter) design. c2d -- Convert continuous system description to discrete time description assuming zero-order hold and given sample time. * The max (min) functions can now return the index of the max (min) value as a second return value. Summary of changes for version 0.78: ----------------------------------- * Octave's handling of global variables has been completely rewritten. To access global variables inside a function, you must now declare them to be global within the function body. Likewise, if you do not declare a variable as global at the command line, you will not have access to it within a function, even if it is declared global there. For example, given the function function f () global x = 1; y = 2; endfunction the global variable `x' is not visible at the top level until the command octave:13> global x has been evaluated, and the variable `y' remains local to the function f() even if it is declared global at the top level. Clearing a global variable at the top level will remove its global scope and leave it undefined. For example, octave:1> function f () # Define a function that accesses > global x; # the global variable `x'. > x > endfunction octave:2> global x = 1 # Give the variable `x' a value. octave:3> f () # Evaluating the function accesses the x = 1 # global `x'. octave:4> clear x # Remove `x' from global scope, clear value. octave:5> x = 2 # Define new local `x' at the top level x = 2 octave:6> f # The global `x' is no longer defined. error: `x' undefined near line 1 column 25 error: evaluating expression near line 1, column 25 error: called from `f' octave:7> x # But the local one is. x = 2 * The new function, `is_global (string)' returns 1 if the variable named by string is globally visible. Otherwise, returns 0. * The implementation of `who' has changed. It now accepts the following options: -b -builtins -- display info for builtin variables and functions -f -functions -- display info for currently compiled functions -v -variables -- display info for user variables -l -long -- display long info The long output looks like this: octave:5> who -l *** currently compiled functions: prot type rows cols name ==== ==== ==== ==== ==== wd user function - - f *** local user variables: prot type rows cols name ==== ==== ==== ==== ==== wd real scalar 1 1 y *** globally visible user variables: prot type rows cols name ==== ==== ==== ==== ==== wd complex matrix 13 13 x where the first character of the `protection' field is `w' if the symbol can be redefined, and `-' if it has read-only access. The second character may be `d' if the symbol can be deleted, or `-' if the symbol cannot be cleared. * The new built-in variable ignore_function_time_stamp can be used to prevent Octave from calling stat() each time it looks up functions defined in M-files. If set to "system", Octave will not automatically recompile M-files in subdirectories of $OCTAVE_HOME/lib/VERSION if they have changed since they were last compiled, but will recompile other M-files in the LOADPATH if they change. If set to "all", Octave will not recompile any M-files unless their definitions are removed with clear. For any other value of ignore_function_time_stamp, Octave will always check to see if functions defined in M-files need to recompiled. The default value of ignore_function_time_stamp is "system". * The new built-in variable EDITOR can be used to specify the editor for the edit_history command. It is set to the value of the environment variable EDITOR, or `vi' if EDITOR is not set, or is empty. * There is a new built-in variable, INFO_FILE, which is used as the location of the info file. Its initial value is $OCTAVE_HOME/info/octave.info, so `help -i' should now work provided that OCTAVE_HOME is set correctly, even if Octave is installed in a directory different from that specified at compile time. * There is a new command line option, --info-file FILE, that may be used to set Octave's idea of the location of the info file. It will override any value of OCTAVE_INFO_FILE found in the environment, but not any INFO_FILE="filename" commands found in the system or user startup files. * Octave's Info reader will now recognize gzipped files that have names ending in `.gz'. * The save command now accepts regular expressions as arguments. Note that these patterns are regular expressions, and do not work like filename globbing. For example, given the variables `a', `aa', and `a1', the command `save a*' saves `a' and `aa' but not `a1'. To match all variables beginning with `a', you must use an expression like `a.*' (match all sequences beginning with `a' followed by zero or more characters). * Line and column information is included in more error messages. Summary of changes for version 0.77: ----------------------------------- * Improved help. The command `help -i topic' now uses the GNU Info browser to display help for the given topic directly from the Texinfo documenation. * New function: chol -- Cholesky factorization. Summary of changes for version 0.76: ----------------------------------- * Better run-time error messages. Many now include line and column information indicating where the error occurred. Octave will also print a traceback for errors occurring inside functions. If you find error messages that could use improvement, or errors that Octave fails to catch, please send a bug report to bug-octave@che.utexas.edu. * If gplot (or gsplot) is given a string to plot, and the string does not name a file, Octave will pass the string along to gnuplot directly. This allows commands like gplot "sin (x)" w l, data w p to work (assuming that data is a variable containing a matrix of values). * Long options (--help, --version, etc.) are supported. Summary of changes for version 0.75: ----------------------------------- * The documentation is much more complete, but still could use a lot of work. * The history function now prints line numbers by default. The command `history -q' will omit them. * The clear function now accepts regular expressions. * If gplot (or gsplot) is given a string to plot, and the string names a file, Octave attempts to plot the contents of the file. * New functions: history: run_history -- run commands from the history list. edit_history -- edit commands from the history list with your favorite editor. linear algebra: balance -- Balancing for algebraic and generalized eigenvalue problems. givens -- Givens rotation. is_square -- Check to see if a matrix is square. qzhess -- QZ decomposition of the matrix pencil (a - lambda b). qzval -- Generalized eigenvalues for real matrices. syl -- Sylvester equation solver. control systems: is_symmetric -- Check to see if a matrix is symmetric. abcddim -- Check dimensions of linear dynamic system [A,B,C,D]. is_controllable -- Check to see if [A,B,C,D] is controllable. is_observable -- Check to see if [A,B,C,D] is observable. are -- Solve algebraic Ricatti equation. dare -- Solve discrete-time algebraic Ricatti equation. lqe -- Kalman filter design for continuous linear system. lqr -- Linear Quadratic Regulator design. lyap -- Solve Lyapunov equation. dlyap -- Solve discrete Lyapunov equation. tzero -- Compute the transmission zeros of [A,B,C,D]. Summary of changes for version 0.74: ----------------------------------- * Formal parameters to functions are now always considered to be local variables, so things like global x = 0 global y = 0 function y = f (x) x = 1; y = x; end f (x) result in the function returning 1, with the global values of x and y unchanged. * Multiple assignment expressions are now allowed to take indices, so things like octave:13> [a([1,2],[3,4]), b([5,6],[7,8])] = lu ([1,2;3,4]) will work correctly. Summary of changes for version 0.73: ----------------------------------- * Saving and loading global variables works correctly now. * The save command no longer saves builtin variables. * Global variables are more reliable. * Matrices may now have one or both dimensions zero, so that operations on empty matrices are now handled more consistently. By default, dimensions of the empty matrix are now printed along with the empty matrix symbol, `[]'. For example: octave:13> zeros (3, 0) ans = [](3x0) The new variable `print_empty_dimensions' controls this behavior. See also Carl de Boor, An Empty Exercise, SIGNUM, Volume 25, pages 2--6, 1990, or C. N. Nett and W. M. Haddad, A System-Theoretic Appropriate Realization of the Empty Matrix Concept, IEEE Transactions on Automatic Control, Volume 38, Number 5, May 1993. * The right and left division operators `/' and `\' will now find a minimum norm solution if the system is not square, or if the coefficient matrix is singular. * New functions: hess -- Hessenberg decomposition schur -- Ordered Schur factorization perror -- print error messages corresponding to error codes returned from the functions fsolve, npsol, and qpsol (with others to possibly be added later). * Octave now prints a warning if it finds anything other than whitespace or comments after the final `end' or `endfunction' statement. * The bodies of functions, and the for, while, and if commands are now allowed to be empty. * Support for Gill and Murray's QPSOL has been added. Like NPSOL, QPSOL is not freely redistributable either, so you must obtain your own copy to be able to use this feature. More information about where to find QPSOL and NPSOL are in the file README.NLP. Summary of changes for version 0.72: ----------------------------------- * For numeric output, columns are now lined up on the decimal point. (This requires libg++-2.3.1 or later to work correctly). * If octave is running interactively and the output intended for the screen is longer than one page and a pager is available, it is sent to the pager through a pipe. You may specify the program to use as the pager by setting the variable PAGER. PAGER may also specify a command pipeline. * Spaces are not always significant inside square brackets now, so commands like [ linspace (1, 2) ] will work. However, some possible sources of confusion remain because Octave tries (possibly too hard) to determine exactly what operation is intended from the context surrounding an operator. For example: -- In the command [ 1 - 1 ] the `-' is treated as a binary operator and the result is the scalar 0, but in the command [ 1 -1 ] the `-' is treated as a unary operator and the result is the vector [ 1 -1 ]. -- In the command a = 1; [ 1 a' ] the single quote character `'' is treated as a transpose operator and the result is the vector [ 1 1 ], but in the command a = 1; [ 1 a ' ] an error message indicating an unterminated string constant is printed. * Assignments are just expressions now, so they are valid anywhere other expressions are. This means that things like if (a = n < m) ... endif are valid. This is parsed as: compare `n < m', assign the result to the variable `a', and use it as the test expression in the if statement. To help avoid errors where `=' has been used but `==' was intended, Octave issues a warning suggesting parenthesis around assignments used as truth values. You can suppress this warning by adding parenthesis, or by setting the value of the new builtin variable `warn_assign_as_truth_value' to 'false' (the default value is 'true'). This is also true for multiple assignments, so expressions like [a, b, c] = [u, s, v] = expression are now possible. If the expression is a function, nargout is set to the number of arguments for the right-most assignment. The other assignments need not contain the same number of elements. Extra left hand side variables in an assignment become undefined. * The default line style for plots is now `lines' instead of `points'. To change it, use the `set data style STYLE' command. * New file handling and I/O functions: fopen -- open a file for reading or writing fclose -- close a file fflush -- flush output to a file fgets -- read characters from a file frewind -- set file position to the beginning of a file fseek -- set file position ftell -- tell file position freport -- print a report for all open files fscanf -- read from a file sscanf -- read from a string scanf -- read from the standard input * New builtin variables for file and I/O functions: stdin -- file number corresponding to the standard input stream. stdout -- file number corresponding to the standard output stream. stderr -- file number corresponding to the standard error stream. The following may be used as the final (optional) argument for fseek: SEEK_SET -- set position relative to the beginning of the file. SEEK_CUR -- set position relative to the current position. SEEK_END -- set position relative to the end of the file. * New function: setstr -- convert vectors or scalars to strings (doesn't work for matrices yet). * If possible, computer now prints the system type instead of always printing `Hi Dave, I'm a HAL-9000'. * Octave now properly saves and restores its internal state correctly in more places. Interrupting Octave while it is executing a script file no longer causes it to exit. * Octave now does tilde expansion on each element of the LOADPATH. * A number of memory leaks have been plugged. * Dependencies for C++ source files are now generated automatically by g++. * There is a new command line option, -p PATH, that may be used to set Octave's loadpath from the command line. It will override any value of OCTAVE_PATH found in the environment, but not any LOADPATH="path" commands found in the system or user startup files. * It is now possible to override Octave's default idea of the location of the system-wide startup file (usually stored in $(prefix)/lib/octave/octaverc) using the environment variable OCTAVE_HOME. If OCTAVE_HOME has a value, Octave will look for octaverc and its M-files in the directory $OCTAVE_HOME/lib/octave. This allows people who are using binary distributions (as is common with systems like Linux) to install the real octave binary in any directory (using a name like octave.bin) and then install a simple script like this #!/bin/sh OCTAVE_HOME=/foo/bar/baz export OCTAVE_HOME exec octave.bin to be invoked as octave. Summary of changes for version 0.71: ----------------------------------- * Much improved plotting facility. With this release, Octave does not require a specially modified version of gnuplot, so gnuplot sources are no longer distributed with Octave. For a more detailed description of the new plotting features, see the file PLOTTING. * New plotting commands: plot -- 2D plots semilogx -- 2D semilog plot with logscale on the x axis semilogy -- 2D semilog plot with logscale on the y axis loglog -- 2D log-log plot mesh -- 3D mesh plot meshdom -- create matrices for 3D plotting from two vectors contour -- contour plots of 3D data bar -- create bar graphs stairs -- create stairstep plots polar -- 2D plots from theta-R data grid -- turn plot grid lines on or off xlabel, ylabel -- place labels on the x and y axes of 2D plots sombrero -- demonstrate 3D plotting gplot -- 2D plot command with gnuplot-like syntax gsplot -- 3D plot command with gnuplot-like syntax set -- set plot options with gnuplot syntax show -- show plot options with gnuplot syntax closeplot -- close stream to gnuplot process purge_tmp_files -- delete temporary files created by plot command * Other new commands: ls, dir -- print a directory listing shell_cmd -- execute shell commands keyboard -- get input from keyboard, useful for debugging menu -- display a menu of options and ask for input fft -- fast fourier transform ifft -- inverse fast fourier transform * Strings may be enclosed in either single or double quote characters. Double quote characters are not special within single quote strings, and single quotes are not special within double quote strings. * Command name completion now works for M-file names too. * Better help and usage messages for many functions. * Help is now available for functions defined in M-files. The first block of comments is taken as the text of the help message. * Numerous changes in preparation to support dynamic loading of object files with dld. * Bug fixes to make solving DAEs with dassl actually work. * The command `save file' now saves all variables in the named file. * If do_fortran_indexing is 'true', indexing a scalar with [1,1,1,...] (n times) replicates its value n times. The orientation of the resulting vector depends on the value of prefer_column_vectors. * Things like [[1,2][3,4]] no longer cause core dumps, and invalid input like [1,2;3,4,[5,6]] now produces a diagnositic message. * The cd, save, and load commands now do tilde expansion. * It's now possible to clear global variables and functions by name. * Use of clear inside functions is now a parse error. Summary of changes for version 0.70: ----------------------------------- * Better parse error diagnostics. For interactive input, you get messages like octave:1> a = 3 + * 4; parse error: a = 3 + * 4; ^ and for script files, the message includes the file name and input line number: octave:1> foo parse error near line 4 of file foo.m: a = 3 + * 4; ^ * New builtin variable PS2 which is used as the secondary prompt. The default value is '> '. * New file, octave-mode.el, for editing Octave code with GNU Emacs. This is a modified version of Matthew R. Wette's matlab-mode.el. * Better support for missing math functions. * User preferences are now cached in a global struct so we don't have to do a symbol table lookup each time we need to know what they are. This should mean slightly improved performance for evaluating expressions. Summary of changes for version 0.69: ----------------------------------- * Multiple assignments are now possible, so statements like a = b = c = 3; a = b = c = [1,2;3,4]; or c = (a = (b = 2) * 3 + 4) * 5 are legal, as are things that have even more bizarre effects, like a(4:6,4:6) = b(2:3,2:3) = [1,2;3,4]; (try it). * Improved parsing of strings (but they still don't work as matrix elements). * An M-file may now either define a function or be a list of commands to execute. * Better detection and conditional compilation of IEEE functions isinf, finite, and isnan. * Replacements for acosh, asinh, atanh, and gamma from the BSD math library for those systems that don't have them. Summary of changes for version 0.68: ----------------------------------- * New functions: eval -- evaluate a string as a sequence of Octave commands. input -- print a prompt and get user input. Summary of changes for version 0.67: ----------------------------------- * New functions: find -- return the indices of nonzero elements. * Zero-one style indexing now works. For example, a = [1,2,3,4]; b = a([1,0,0,1]) sets b to the first and fourth elememnts of a. Zero-one style indexing also works for indexing the left hand side of an assignment. For example, a = rand (1,2;3,4); a([0,1],:) = [-1,-2] sets the second row of a to [-1 -2] The behavior for the ambiguous case a = [1,2,3,4]; b = a([1,1,1,1]); is controlled by the new global variable `prefer_zero_one_indexing'. If this variable is equal to 'true', b will be set to [1 2 3 4]. If it is false, b will be set to [1 1 1 1]. The default value is 'false'. * Using the new global variable `propagate_empty_matrices', it is possible to have unary andy binary operations on empty matrices return an empty matrix. The default value of this variable is 'warn', so that empty matrices are propagated but you get a warning. Some functions, like eig and svd have also been changed to handle this. * Empty matrices can be used in conditionals, but they always evaluate to `false'. With propagate_empty_matrices = 'true', both of the following expressions print 0: if [], 1, else 0, end if ~[], 1, else 0, end * Octave no longer converts input like `3.2 i' or `3 I' to complex constants directly because that causes problems inside square brackets, where spaces are important. This abbreviated notation *does* work if there isn't a space between the number and the i, I, j, or J. Summary of changes for version 0.66: ----------------------------------- * Logical unary not operator (~ or !) now works for complex. * Left division works. * Right and left element by element division should work correctly now. * Numbers like .3e+2 are no longer errors. * Indexing a matrix with a complex value doesn't cause a core dump. * The min and max functions should work correctly for two arguments. * Improved (I hope!) configuration checks. * Octave is now installed as octave-M.N, where M and N are version numbers, and octave is a link to that file. This makes it possible to have more than one version of the interpreter installed. Summary of changes for version 0.63: ----------------------------------- * The reshape function works again. * Octave now converts input like `3.2i' or `3 I' or `2.3e5 j' to be complex constants directly, rather than requiring an expression like `3.3 * i' to be evaluated. Summary of changes for version 0.61: ----------------------------------- * Octave has been successfully compiled using gcc 2.3.3 and libg++ 2.3. on a 486 system running Linux. * The win_texas_lotto function is now called texas_lotto (it's a script file, and win_texas_lotto.m is too long for some Linux and System V systems). Summary of changes for version 0.57: ------------------------------------ * The C-like formatted print functions printf, fprintf, and sprintf finally work. Summary of changes for version 0.56: ------------------------------------ * By default, octave prints a short disclaimer when it starts. (You can suppress it by invoking octave with -q). * You can keep octave from reading your ~/.octaverc and .octaverc files by invoking it with -f. * When returning two values, eig now returns [v, d] instead of [lambda, v], where d is a diagonal matrix made from lambda. * The win_texas_lotto function now produces a sorted list. * New functions: expm -- matrix exponential. logm -- matrix logarithm. Summary of changes for version 0.55: ------------------------------------ * The following (C-style) backslash escape sequences work in quoted strings (useful(?) with printf()): \a bell \r carriage return \b backspace \t horizontal tab \f formfeed \v vertical tab \n newline \\ backslash * Use of `...' at the end of a line will allow a statement to continue over more than one line. * The names `inf' and `nan' are now aliases for `Inf' and `NaN', respectively. * New functions: casesen -- print a warning if the luser tries to turn off case sensitivity. median -- find median value. norm -- compute the norm of a matrix. sort -- sort columns. * New variable, `silent_functions'. If silent_functions == 'true', the results of expressions are not printed even if they are not followed by a semicolon. The disp() and printf() functions still result in output. The default value for this variable is 'false'. * New variable `return_last_value_computed'. If it is 'true', functions defined in script files return the last value computed if a return value has not been explicitly declared. The default value for this variable is 'false'. Summary of changes for version 0.52: ------------------------------------ * Name completion works for function and variable names currently in the symbol tables. Coming soon: completion for names of functions defined in script files but not yet compiled. * The initial value of do_fortran_indexing is now false, and the initial value of prefer_column_vectors is now true. Swap the values of these variables if you want behavior that is more like Matlab. * All script files check the number of input arguments before doing much real work. * The identifiers `i' and `j' are now also names for sqrt(-1). These symbols may be used for other purposes, but their original definition will reappear if they are cleared. * The symbol tables are now implemented with hash tables for faster searching. * A small amount of help is now available for most builtin operators, keywords and functions. Coming soon: help for script files. * Without any arguments, the help command now lists all known builtin operators, keywords and functions. * Generic parse errors are now signalled by `Eh, what's up doc?', which is closer to what Bugs actually says. * The who command now only prints variable names by default. Use the -fcn (or -fcns, or -functions) switch to print the names of builtin or currently compiled functions. Summary of changes for version 0.51: ------------------------------------ * Major overhaul of array indexing. * The colloc function actually works now. Summary of changes for version 0.50: ------------------------------------ * The lsode and dassl functions now return the states only, instead of the time and the states, so you must keep track of the corresponding times (this is easy though, because you have to specify a vector of desired output times anyway). * Solution of NLPs with NPSOL now works on the SPARC. * New keywords `endif', `endfor', `endfunction', `endif', and `endwhile', which allow for better diagnostics. The `end' keyword is still recognized. All script files have been changed to use these new keywords in place of `end'. * It is now possible to uninstall Octave by doing a `make uninstall' in the top level directory. * The Makefiles are much closer to conforming with GNU coding standards. * New functions: win_texas_lotto -- produce six unique random numbers between 1 and 50. quad -- numerical integration. lu -- LU factorization qr -- QR factorization dassl -- Solution of DAEs using DASSL. * New files: THANKS -- A list of people and organazations who have supported the development of Octave. NEWS -- This file, listing recent changes. * Help is now available at the gnuplot prompt. octave-1.1.0/PROJECTS100666 415 17 21453 5702625030 12337 0ustar jweusersOctave PROJECTS -*- text -*- =============== Check with bug-octave@che.utexas.edu for a possibly more current copy. Also, if you start working steadily on a project, please let bug-octave@che.utexas.edu know. We might have information that could help you; we'd also like to send you the GNU coding standards. This list is not exclusive -- there are many other things that might be good projects, but it might instead be something we already have, so check with bug-octave@che.utexas.edu before you start. * Improve the Texinfo Documentation for the interpreter. It would be useful to have lots more examples, to not have so many forward references, and to not have very many simple lists of functions. * Texinfo documentation for the C++ classes. * Make `help -i' try to find a whole word match first. * Improve help messages for operators and keywords in help.cc. * Make index entries more consistent to improve behavior of `help -i'. * Improve logm, and sqrtm. * Improve complex mapper functions. * Implement the echo command. * Make the cutoff point for changing to packed storage a user-preference variable with default value 8192. * Share more code among the various *_options functions. * Make it possible to clear dynamically loaded functions. * Improved string handling. * Add a run-time alias mechanism that would allow things like alias fun function_with_a_very_long_name so that `function_with_a_very_long_name' could be invoked as `fun'. * Fix all function files to check for bogus inputs (wrong number or types of input arguments, wrong number of output arguments). * Support for lp_solve for linear programming problems. * Free QP solver. * Free NLP solver. * Support for sparse matrices. * Fix CollocWt to handle Laguerre polynomials. Make it easy to extend it to other polynomial types. * Add optional arguments to colloc so that it's not restricted to Legendre polynomials. * Handle arguments for text-style functions in a consistent manner. * More C++/Fortran cleanups. * Translate Fortran routines to C/C++, or replace them entirely. * It is likely that there are still some memory leaks. Hunt then down and plug them. * Too much time is spent allocating and freeing memory. What can be done to improve performance? * Error output from Fortran code is ugly. Something should be done to make it look better. * It would be nice if output from the Fortran routines could be passed through the pager. * In an X11 or other windowing environment, allow the user to pop up windows for menus and other purposes. A good place to start might be Tk, as long as Tcl is avoided. * Add a way to handle events, like alarms, mouse clicks, etc. * Implement some form of constant folding in the parser. This shouldn't be too difficult for simple binary and unary operations. * Remove the buffer size limit in octave_read() in input.cc. * Either do something reasonable or remove all support for Inf and NaN for machines without IEEE math. * Make ascii load and save work for Inf and NaN. * Make load work to read files that contain numbers only, and put the values in a matrix named after the file. * Make load and save look for .mat if only given . * Make rand and randn work like they do in Matlab 4.x. * Fix eig to also be able to solve the generalized eigenvalue problem, and to solve for eigenvalues and eigenvectors without performing a balancing step first. * Improve assignment of [] so that Octave will handle cases like a = rand(4); a(2,[1,2,3,4]); a(2,[3,1,4,2]); not just a(2,:). They are all equivalent, so we should allow all of them. It would also be nice to handle special cases in the fortran_style_matrix_assignment function, but that is harder. * Handle arrays with more than two dimensions. * Eliminate mx-kludge.{h,cc} in favor of MArray.{h,cc}. (As of g++ 2.5.7, this appears to require bug fixes for g++.) * Move rand, linspace, eye, etc., functions to the matrix classes. * Only include config.h in files that actually need it, instead of including it in every .cc file. Unfortunately, this might not be so easy to figure out. * Fix configure to cache values determined using non-standard tests. * Adapt the newer matlab-mode.el file to work with Octave. * Consider making assignment statements like M (i_idx, j_idx) = RHS produce the value of RHS instead of the value of M. * Consider making it possible to specify an empty matrix with a syntax like [](e1, e2). Of course at least one of the expressions must be zero... * Make it possible to tie arbitrary input and output streams together, similar to the way iostreams can be tied together. * Functions: - fgetl * Eliminate force_numeric and make_numeric functions. * Is Matrix::fortran_vec() really necessary? * print_usage() should set error_state in most cases? * Move DEFVARs to be in the files that define functions that are related to the variables. * Make statements like this foo bar baz turn into function calls like this: foo ("bar", "baz") This is pretty ugly and introduces some conflicts. * Make it possible to use text-style function names as variables. * Add a command that works like bash's `builtin' command. * Use SLList for the tree_matrix class. * Use newer readline version. * Make it possible for readline to complete based on text already typed. For example, pl matches to the previous command that began with `pl'. * Handle comments in parse trees for use with the type command. * Improved sort function. * Improved set of tests: -- Tests for various functions. Would be nice to have a test file corresponding to every function. -- Tests for element by element operators: + - .* ./ .\ .^ | & < <= == >= > != ! -- Tests for boolean operators: && || -- Tests for other operators: * / \ ' .' -- Tests from bug reports. -- Tests for indexed assignment. Need to consider the following: o fortran-style indexing o zero-one indexing o assignment of empty matrix as well as values o resizing * Demo files. * Clean up eye, eval, feval, keyboard, input, ones, zeros. * Some sort of blurb (2-3 pages) describing Octave in a reasonably coherent way, where to get it etc., perhaps formatted pretty, i.e. not just text. Maybe start with the latest Announce file. * GNU coding standards: -- Add a `Makefile' target to the Makefiles. -- Comments on #else and #endif preprocessor commands. -- Change error message format to match standards everywhere. * Support for FSQP. * Convert FSQP style NLP statement to NPSOL style. * Convert NPSOL style NLP statement to FSQP style. - Look for linear equality constraints, extract corresponding rows of C. The rest are inequality constraints. - Look for Nonlinear equality constraints and set up a vector of pointers for shuffling. - Transform lb <= C*x <= ub, lb != ub, to C*x - ub <= 0 and lb - C*x <= 0. Likewise for lb <= g(x) <= ub. - Call FSQP. * Optional inputs for fsqp. * If possible, make economy QR factorization actually take advantage of the form of the result instead of just dropping columns. Lapack doesn't appear to do this yet. * The ability to transparently handle very large files: Juhana K Kouhia wrote: If I have a one-dimensional signal data with the size 400 Mbytes, then what are my choises to operate with it: * I have to split the data * Octave has a virtual memory on its own and I don't have to worry about the splitting. If I split the data, then my easily programmed processing programs will become hard to program. If possible, I would like to have the virtual memory system in Octave i.e. the all big files, the user see as one big array or such. There could be several user selectable models to do the virtual memory depending on what kind of data the user have (1d, 2d) and in what order they are processed (stream or random access). Perhaps this can be done entirely with a library of M-files. * Fix interface with gnuplot to wait for gnuplot to output any text before octave returns a prompt. Possible by implementing two way communication between gnuplot and Octave. * Make it possible for the GNU info reader to be called as a separate sub-process instead of linking it directly in the Octave binary. * Make the arrow keys work in the info reader. * Make the interpreter run faster. * Squash bugs. --30-- octave-1.1.0/README100666 415 17 7235 5705317531 12034 0ustar jweusersOctave -- a high-level language for numerical computations. Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton Last updated: Thu Jan 12 15:29:51 1995 Overview -------- Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems numerically. Octave 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, or (at your option) any later version. Octave 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 file COPYING for more details. Availability ------------ The latest released version of Octave is always available via anonymous ftp from ftp.che.utexas.edu in the directory /pub/octave. Complete source and binaries for several popular systems are available. Installation and Bugs --------------------- Octave requires approximately 50MB of disk storage to unpack and install (significantly less if you don't compile with debugging symbols). In order to build Octave, you will need a current version of g++, libg++, and GNU make. YOU MUST HAVE GNU MAKE TO COMPILE OCTAVE. Octave's Makefiles use features of GNU Make that are not present in other versions of Make. GNU Make is very portable and easy to install. As of version 1.1.x, you must have G++ 2.6.2 or later to compile Octave. In some cases, you may also need to install a patch for g++ that is distributed with Octave in order to successfully compile Octave. See the notes in the files INSTALL and INSTALL.OCTAVE for more specific installation instructions, including directions for installing Octave from a binary distribution. The file BUGS contains a recommended procedure for reporting bugs, as well as a list of known problems and possible fixes. Binary Distributions -------------------- Binary copies of Octave are now distributed for several popular Unix systems. To save disk space, the complete source code for Octave is not included in the binary distributions, but should be available in the same place as the binaries. If not, please contact bug-octave@che.utexas.edu. The file INSTALL.OCTAVE contains specific installation instructions, for installing Octave from a binary distribution. Implemenation ------------- Octave is being developed with the Free Software Foundation's make, bison (a replacement for YACC), flex (a replacement for lex), gcc/g++, and libg++ on a SPARCstation II and a DECstation 5000/240. It should be possible to install it on any machine that runs GCC/G++. It may also be possible to install it using other implementations of these tools, but it will most certainly require much more work. Do yourself a favor and get the GNU development tools, either via anonymous ftp from prep.ai.mit.edu or by writing the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. The underlying numerical solvers are currently standard Fortran ones like Lapack, Linpack, Odepack, the Blas, etc., packaged in a library of C++ classes (see the files in the libcruft and liboctave subdirectories). If possible, the Fortran subroutines are compiled with the system's Fortran compiler, and called directly from the C++ functions. If that's not possible, they are translated with f2c and compiled with a C compiler. Better performance is usually achieved if the intermediate translation to C is avoided. The library of C++ classes may also be useful by itself. -- John W. Eaton jwe@che.utexas.edu Department of Chemical Engineering The University of Texas at Austin octave-1.1.0/README.NLP100666 415 17 1357 5431447277 12472 0ustar jweusersIf you don't have NPSOL but you still want to be able to solve NLPs, or if you don't have QPSOL but you still want to solve QPs, you'll need to find replacements or order them from Stanford. If you know of a freely redistributable replacement, please let us know--we might be interested in distributing it with Octave. You can get more information about NPSOL and QPSOL from Stanford University Office of Technology Licensing 857 Serra Street Stanford CA 94305-6225 Tel: (415) 723-0651 Fax: (415) 725-7295 Octave may soon support FSQP, an NLP solver from Andre Tits (andre@src.umd.edu) of the University of Maryland. FSQP is available free of charge to academic sites, but can not be redistributed to third parties. octave-1.1.0/SENDING-PATCHES100666 415 17 2351 5504232320 13232 0ustar jweusers[This was originally from Richard Stallman who was writing about Emacs. --jwe] A reminder for those sending patches for Octave: * Always make the diffs with context. Preferably use diff -c. It is unreliable to install a diff without context, and therefore we probably will not take the risk of trying; instead we will probably ask you to send a context diff. You might as well send that in your first message. * Always send change log entries with your patches. Itemize the entries so that they list each of the functions and variables changed. Look at the ChangeLog files and follow our conventions regarding what information to include and what style to use. * If the patch is to fix a bug, send a detailed bug report for the bug. Make this just as detailed as if you did not have any fix for it. This information is vital for convincing the maintainer that your fix is necessary and should be installed. Also, if your fix would cause some other sort of problem, the bug report may enable the maintainer to find some other correct fix. Everyone, please read the Bugs chapter in the Octave manual to see other guidelines on how to write a bug report that makes it possible to fix a bug. octave-1.1.0/THANKS100666 415 17 1537 5705317232 12064 0ustar jweusersSpecial thanks to the following people and organizations for supporting the development of Octave: * Digital Equipment Corporation, for a one year grant as part of their External Research Program. * Sun Microsystems, Inc., for an Academic Equipment grant. * The University of Texas College of Engineering, for providing a Challenge for Excellence Research Supplement, and for providing an Academic Development Funds grant. * The State of Texas, for providing funding through the Texas Advanced Technology Program under Grant No. 003658-078. * Texaco Chemical Company, for providing funding to continue the development of this software. * Noel Bell, Senior Engineer, Texaco Chemical Company, Austin Texas. * James B. Rawlings, Associate Professor, Department of Chemical Engineering, The University of Texas at Austin. octave-1.1.0/f2c-compat.sh100777 415 17 4066 5512576526 13454 0ustar jweusers#!/bin/sh # # f2c-compat -- try to see if calling a Fortran compiled routine from # a C compiled main program will work as if the Fortran routine has # been translated to C via f2c. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin # trap 'rm -f ftest* ctest* core; exit 1' 1 3 15 status=1 if test $# -eq 0; then FLIBS_SH="./flibs.sh" elif test $# -eq 1; then FLIBS_SH="$1" else echo "usage: f2c-compat.sh [flibs_script]" exit 1 fi # Write a minimal program, compile it, and see if it works as # expected. cat << EOF > ftest.f INTEGER FUNCTION FORSUB (C, D) CHARACTER *(*) C INTEGER L DOUBLE PRECISION D L = LEN (C) WRITE (*, '(A,1X,I2)') C(1:L), INT (D) FORSUB = 1 RETURN END EOF ${F77-f77} -c ftest.f > /dev/null 2>&1 cat << EOF > ctest.c extern int strlen (); extern int strcpy (); extern int forsub_ (); static char s[14]; int main (argc, argv) int argc; char **argv; { double d = 10.0; int len; strcpy (s, "FOO-I-HITHERE"); len = strlen (s); return (! forsub_ (s, &d, len)); } /* For Sun f77 */ int MAIN_ () { return 0; } EOF ${CC-cc} -c ctest.c > /dev/null 2>&1 FLIBS=`F77="${F77-f77}" $FLIBS_SH` ${CC-cc} -o ctest ctest.o ftest.o $FLIBS -lm > /dev/null 2>&1 ctest_output=`./ctest 2>&1` status=$? if test $status -eq 0 && test "$ctest_output" = "FOO-I-HITHERE 10" then echo '-DF77_APPEND_UNDERSCORE=1' status=0 else cat << EOF > ctest.c extern int strlen (); extern int strcpy (); extern int forsub (); static char s[14]; int main (argc, argv) int argc; char **argv; { double d = 10.0; int len; strcpy (s, "FOO-I-HITHERE"); len = strlen (s); return (! forsub (s, &d, len)); } /* For Sun f77 */ int MAIN_ () { return 0; } EOF ${CC-cc} -c ctest.c > /dev/null 2>&1 ${CC-cc} -o ctest ctest.o ftest.o $FLIBS -lm > /dev/null 2>&1 ctest_output=`./ctest 2>&1` status=$? if test $status -eq 0 && test "$ctest_output" = "FOO-I-HITHERE 10" then status=0 fi fi rm -f ftest* ctest* core # Bye-bye. exit $status octave-1.1.0/flibs.sh100777 415 17 5112 5651045246 12603 0ustar jweusers#!/bin/sh # # flibs -- try to get the Fortran compiler to tell us what libraries # it expects to link to, and echo the result to the standard output. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin trap 'rm -f conftest* core; exit 1' 1 3 15 # Write a minimal program and compile it with -v. I don't know what # to do if your compiler doesn't have -v... echo " END" > conftest.f if test $# -eq 1 then foutput=`cat $1` else foutput=`${F77-f77} -v -o conftest conftest.f 2>&1` fi # The easiest thing to do for xlf output is to replace all the commas # with spaces. Try to only do that if the output is really from xlf, # since doing that causes problems on other systems. xlf_p=`echo $foutput | grep xlfentry` if test -n "$xlf_p" then foutput=`echo $foutput | sed 's/,/ /g'` fi ld_run_path=`echo $foutput | \ sed -n -e 's/.*\(LD_RUN_PATH *= *[^ ]*\).*/\1/p' | \ sed -e 's/LD_RUN_PATH *= *//'` # We are only supposed to find this on Solaris systems, and this # substitution is probably only going to work with gcc on those # systems... if test -n "$ld_run_path" then ld_run_path="-Xlinker -R -Xlinker $ld_run_path" fi flibs= lflags= # If want arg is set, we know we want the arg to be added to the list, # so we don't have to examine it. want_arg= for arg in $foutput do if test -z "$want_arg" then case $arg in /*.a) exists=false for f in $lflags do if test x$arg = x$f then exists=true fi done if $exists then arg= else lflags="$lflags $arg" fi ;; -[lL]*) exists=false for f in $lflags do if test x$arg = x$f then exists=true fi done if $exists || test x$arg = x-lm -o x$arg = x-lc then arg= else lflags="$lflags $arg" fi ;; -u) want_arg=$arg ;; -Y) want_arg=$arg arg= ;; *) arg= ;; esac else if test x$want_arg = x-Y then # Should probably try to ensure unique directory options here too. # This probably only applies to Solaris systems, and then will only # work with gcc... arg=`echo $arg | sed -e 's%^P,%%'` SAVE_IFS=$IFS IFS=: list= for elt in $arg do list="$list -L $elt" done IFS=$SAVE_IFS arg="$list" fi want_arg= fi if test -n "$arg" then flibs="$flibs $arg" fi done echo "$ld_run_path $flibs" rm -f conftest* core # Bye-bye. exit 0 octave-1.1.0/cxxlibs.sh100777 415 17 2701 5636066552 13167 0ustar jweusers#!/bin/sh # # clibs -- try to get the C++ compiler to tell us what libraries # it expects to link to, and echo the result to the standard output. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin trap 'rm -f conftest* core; exit 1' 1 3 15 # Write a minimal program and compile it with -v. I don't know what # to do if your compiler doesn't have -v... echo "int main (void) { return 0; }" > conftest.c # I don't think that stripping commas out of this will ever hurt. coutput=`${CXX-c++} -v -o conftest conftest.c 2>&1 | sed 's/,/ /g'` clibs= lflags= want_arg= for arg in $coutput do if test x$want_arg = x then want_arg= case $arg in /*.a) exists=false for f in $lflags do if test x$arg = x$f then exists=true fi done if $exists then arg= else lflags="$lflags $arg" fi ;; -L*) exists=false for f in $lflags do if test x$arg = x$f then exists=true fi done ;; -l*) if test x$arg = x-lang-c++ then arg= else lflags="$lflags $arg" fi ;; -u) want_arg=$arg ;; *) arg= ;; esac else want_arg= fi if test x$arg != x then clibs="$clibs $arg" fi done echo "$clibs" rm -f conftest* core # Bye-bye. exit 0 octave-1.1.0/configure100777 415 17 327066 5705370665 13141 0ustar jweusers#!/bin/sh # From configure.in Revision: 1.85 # Guess values for system-dependent variables and create Makefiles. # Generated automatically using autoconf version 2.1 # Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc. # # This configure script is free software; the Free Software Foundation # gives unlimited permission to copy, distribute and modify it. # Defaults: ac_help= ac_default_prefix=/usr/local # Any additions from configure.in: ac_help="$ac_help --with-f2c use f2c even if Fortran compiler is available" ac_help="$ac_help --enable-dld use DLD for dynamic linking (not all systems)" ac_help="$ac_help --enable-lite-kernel compile smaller kernel (requires DLD)" ac_default_prefix=/usr/local # Initialize some variables set by options. # The variables have the same names as the options, with # dashes changed to underlines. build=NONE cache_file=./config.cache exec_prefix=NONE host=NONE no_create= nonopt=NONE no_recursion= prefix=NONE program_prefix=NONE program_suffix=NONE program_transform_name=s,x,x, silent= site= srcdir= target=NONE verbose= x_includes=NONE x_libraries=NONE # Initialize some other variables. subdirs= ac_prev= 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=`echo "$ac_option" | sed 's/[-_a-zA-Z0-9]*=//'` ;; *) ac_optarg= ;; esac # Accept the important Cygnus configure options, so we can diagnose typos. case "$ac_option" in -build | --build | --buil | --bui | --bu | --b) ac_prev=build ;; -build=* | --build=* | --buil=* | --bui=* | --bu=* | --b=*) build="$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" ;; -disable-* | --disable-*) ac_feature=`echo $ac_option|sed -e 's/-*disable-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` eval "enable_${ac_feature}=no" ;; -enable-* | --enable-*) ac_feature=`echo $ac_option|sed -e 's/-*enable-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_feature| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_feature: invalid feature name" 1>&2; exit 1; } fi ac_feature=`echo $ac_feature| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "enable_${ac_feature}='$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) # 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 << EOF Usage: configure [options] [host] Options: [defaults in brackets after descriptions] Configuration: --cache-file=FILE cache test results in FILE --help print this message --no-create do not create output files --quiet, --silent do not print \`checking...' messages --version print the version of autoconf that created configure Directory and file names: --prefix=PREFIX install architecture-independent files in PREFIX [$ac_default_prefix] --exec-prefix=PREFIX install architecture-dependent files in PREFIX [same as prefix] --srcdir=DIR find the sources in DIR [configure dir or ..] --program-prefix=PREFIX prepend PREFIX to installed program names --program-suffix=SUFFIX append SUFFIX to installed program names --program-transform-name=PROGRAM run sed PROGRAM on installed program names Host type: --build=BUILD configure for building on BUILD [BUILD=HOST] --host=HOST configure for HOST [guessed] --target=TARGET configure for TARGET [TARGET=HOST] Features and packages: --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) --enable-FEATURE[=ARG] include FEATURE [ARG=yes] --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) --x-includes=DIR X include files are in DIR --x-libraries=DIR X library files are in DIR --enable and --with options recognized:$ac_help EOF exit 0 ;; -host | --host | --hos | --ho) ac_prev=host ;; -host=* | --host=* | --hos=* | --ho=*) host="$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) 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 ;; -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" ;; -q | -quiet | --quiet | --quie | --qui | --qu | --q \ | -silent | --silent | --silen | --sile | --sil) silent=yes ;; -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" ;; -target | --target | --targe | --targ | --tar | --ta | --t) ac_prev=target ;; -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) target="$ac_optarg" ;; -v | -verbose | --verbose | --verbos | --verbo | --verb) verbose=yes ;; -version | --version | --versio | --versi | --vers) echo "configure generated by autoconf version 2.1" exit 0 ;; -with-* | --with-*) ac_package=`echo $ac_option|sed -e 's/-*with-//' -e 's/=.*//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-_a-zA-Z0-9]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` case "$ac_option" in *=*) ;; *) ac_optarg=yes ;; esac eval "with_${ac_package}='$ac_optarg'" ;; -without-* | --without-*) ac_package=`echo $ac_option|sed -e 's/-*without-//'` # Reject names that are not valid shell variable names. if test -n "`echo $ac_package| sed 's/[-a-zA-Z0-9_]//g'`"; then { echo "configure: error: $ac_package: invalid package name" 1>&2; exit 1; } fi ac_package=`echo $ac_package| sed 's/-/_/g'` eval "with_${ac_package}=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" ;; -*) { echo "configure: error: $ac_option: invalid option; use --help to show usage" 1>&2; exit 1; } ;; *) if test -n "`echo $ac_option| sed 's/[-a-z0-9.]//g'`"; then echo "configure: warning: $ac_option: invalid host type" 1>&2 fi if test "x$nonopt" != xNONE; then { echo "configure: error: can only configure for one host and one target at a time" 1>&2; exit 1; } fi nonopt="$ac_option" ;; esac done if test -n "$ac_prev"; then { echo "configure: error: missing argument to --`echo $ac_prev | sed 's/_/-/g'`" 1>&2; exit 1; } fi trap 'rm -fr conftest* confdefs* core $ac_clean_files; exit 1' 1 2 15 # File descriptor usage: # 0 unused; standard input # 1 file creation # 2 errors and warnings # 3 unused; some systems may open it to /dev/tty # 4 checking for... messages and results # 5 compiler messages saved in config.log if test "$silent" = yes; then exec 4>/dev/null else exec 4>&1 fi exec 5>./config.log echo "\ This file contains any messages produced by compilers while running configure, to aid debugging if configure makes a mistake. " 1>&5 # Strip out --no-create and --no-recursion so they do not pile up. # Also quote any args containing shell metacharacters. ac_configure_args= for ac_arg do case "$ac_arg" in -no-create | --no-create | --no-creat | --no-crea | --no-cre \ | --no-cr | --no-c) ;; -no-recursion | --no-recursion | --no-recursio | --no-recursi \ | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) ;; *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?]*) ac_configure_args="$ac_configure_args '$ac_arg'" ;; *) ac_configure_args="$ac_configure_args $ac_arg" ;; esac done # NLS nuisances. # Only set LANG and LC_ALL to C if already set. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). if test "${LC_ALL+set}" = set; then LC_ALL=C; export LC_ALL; fi if test "${LANG+set}" = set; then LANG=C; export LANG; fi # confdefs.h avoids OS command line length limits that DEFS can exceed. rm -rf conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo > confdefs.h # A filename unique to this package, relative to the directory that # configure is in, which we can look for to find out if srcdir is correct. ac_unique_file=src/octave.cc # 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 its parent. ac_prog=$0 ac_confdir=`echo $ac_prog|sed 's%/[^/][^/]*$%%'` test "x$ac_confdir" = "x$ac_prog" && ac_confdir=. 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 if test "$ac_srcdir_defaulted" = yes; then { echo "configure: error: can not find sources in $ac_confdir or .." 1>&2; exit 1; } else { echo "configure: error: can not find sources in $srcdir" 1>&2; exit 1; } fi fi srcdir=`echo "${srcdir}" | sed 's%\([^/]\)/*$%\1%'` # Prefer explicitly selected file to automatically selected ones. if test -z "$CONFIG_SITE"; then if test "x$prefix" != xNONE; then CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" else CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" fi fi for ac_site_file in $CONFIG_SITE; do if test -r "$ac_site_file"; then echo "loading site script $ac_site_file" . "$ac_site_file" fi done if test -r "$cache_file"; then echo "loading cache $cache_file" . $cache_file else echo "creating cache $cache_file" > $cache_file fi ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CPP $CPPFLAGS' ac_compile='${CC-cc} $CFLAGS $CPPFLAGS conftest.$ac_ext -c 1>&5 2>&5' ac_link='${CC-cc} $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext -o conftest $LIBS 1>&5 2>&5' if (echo "testing\c"; echo 1,2,3) | grep c >/dev/null; then # Stardent Vistra SVR4 grep lacks -e, says ghazi@caip.rutgers.edu. if (echo -n testing; echo 1,2,3) | sed s/-n/xn/ | grep xn >/dev/null; then ac_n= ac_c=' ' ac_t=' ' else ac_n=-n ac_c= ac_t= fi else ac_n= ac_c='\c' ac_t= fi cat >> confdefs.h <<\EOF #define OCTAVE_SOURCE 1 EOF ac_aux_dir= for ac_dir in $srcdir $srcdir/.. $srcdir/../..; 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 fi done if test -z "$ac_aux_dir"; then { echo "configure: error: can not find install-sh or install.sh in $srcdir $srcdir/.. $srcdir/../.." 1>&2; exit 1; } fi ac_config_guess=$ac_aux_dir/config.guess ac_config_sub=$ac_aux_dir/config.sub ac_configure=$ac_aux_dir/configure # This should be Cygnus configure. # Make sure we can run config.sub. if $ac_config_sub sun4 >/dev/null 2>&1; then : else { echo "configure: error: can not run $ac_config_sub" 1>&2; exit 1; } fi echo $ac_n "checking host system type""... $ac_c" 1>&4 host_alias=$host case "$host_alias" in NONE) case $nonopt in NONE) if host_alias=`$ac_config_guess`; then : else { echo "configure: error: can not guess host type; you must specify one" 1>&2; exit 1; } fi ;; *) host_alias=$nonopt ;; esac ;; esac host=`$ac_config_sub $host_alias` host_cpu=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\1/'` host_vendor=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\2/'` host_os=`echo $host | sed 's/^\(.*\)-\(.*\)-\(.*\)$/\3/'` echo "$ac_t""$host" 1>&4 if test -z "$host"; then host=unknown fi target_host_type=$host canonical_host_type=$host if test "$host" = unknown; then echo "configure: warning: configuring Octave for unknown system type " 1>&2 fi ### Allow the user to force us to use f2c. # Check whether --with-f2c or --without-f2c was given. withval="$with_f2c" if test -n "$withval"; then use_f2c=true else use_f2c=false fi ### Allow the user to experiment with dynamic linking using GNU dld. # Check whether --enable-dld or --disable-dld was given. enableval="$enable_dld" if test -n "$enableval"; then use_dld=true else use_dld=false fi ### Allow compilation of smaller kernel. This only works if some form ### of dynamic linking is also supported and used. # Check whether --enable-lite-kernel or --disable-lite-kernel was given. enableval="$enable_lite_kernel" if test -n "$enableval"; then lite_kernel=true else lite_kernel=false fi if $lite_kernel; then cat >> confdefs.h <<\EOF #define OCTAVE_LITE 1 EOF fi ### some defaults exec_prefix='$(prefix)' bindir='$(exec_prefix)/bin' datadir='$(prefix)/lib' libdir='$(exec_prefix)/lib' includedir='$(prefix)/include/octave' mandir='$(prefix)/man/man1' infodir='$(prefix)/info' fcnfiledir='$(datadir)/octave/$(version)/m' localfcnfiledir='$(datadir)/octave/site/m' localfcnfilepath='$(localfcnfiledir)//' archlibdir='$(libdir)/octave/$(version)/exec/$(target_host_type)' octfiledir='$(libdir)/octave/$(version)/oct/$(target_host_type)' localoctfiledir='$(datadir)/octave/site/oct/$(target_host_type)' localoctfilepath='$(localoctfiledir)//' fcnfilepath='.:$(localoctfilepath):$(localfcnfilepath):$(octfiledir)//:$(fcnfiledir)//' imagedir='$(datadir)/octave/$(version)/imagelib' imagepath='.:$(imagedir)//' echo "$ac_t""defining prefix to be $prefix" 1>&4 echo "$ac_t""defining exec_prefix to be $exec_prefix" 1>&4 echo "$ac_t""defining bindir to be $bindir" 1>&4 echo "$ac_t""defining datadir to be $datadir" 1>&4 echo "$ac_t""defining libdir to be $libdir" 1>&4 echo "$ac_t""defining includedir to be $includedir" 1>&4 echo "$ac_t""defining mandir to be $mandir" 1>&4 echo "$ac_t""defining infodir to be $infodir" 1>&4 echo "$ac_t""defining fcnfiledir to be $fcnfiledir" 1>&4 echo "$ac_t""defining localfcnfiledir to be $localfcnfiledir" 1>&4 echo "$ac_t""defining localfcnfilepath to be $localfcnfilepath" 1>&4 echo "$ac_t""defining archlibdir to be $archlibdir" 1>&4 echo "$ac_t""defining octfiledir to be $octfiledir" 1>&4 echo "$ac_t""defining localoctfiledir to be $localoctfiledir" 1>&4 echo "$ac_t""defining localoctfilepath to be $localoctfilepath" 1>&4 echo "$ac_t""defining fcnfilepath to be $fcnfilepath" 1>&4 echo "$ac_t""defining imagedir to be $imagedir" 1>&4 echo "$ac_t""defining imagepath to be $imagepath" 1>&4 ### Do special stuff if using dld. DLD_DIR= LIBDLD= LIBOCTDLD='liboctdld.a' LD_STATIC_FLAG= if $use_dld; then DLD_DIR=dld LIBDLD='../dld/libdld.a' # don't link them in only if doing dynamic linking and small kernel # requested. if $lite_kernel; then LIBOCTDLD= fi LD_STATIC_FLAG=-static cat >> confdefs.h <<\EOF #define WITH_DLD 1 EOF fi ### Also use -static if compiling on Alpha OSF/1 1.3 systems. case "$canonical_host_type" in alpha-dec-osf1.3) LD_STATIC_FLAG=-static ;; esac if test -n "$DLD_DIR"; then echo "$ac_t""defining DLD_DIR to be $DLD_DIR" 1>&4 fi if test -n "$LIBDLD"; then echo "$ac_t""defining LIBDLD to be $LIBDLD" 1>&4 fi if test -n "$LIBOCTDLD"; then echo "$ac_t""defining LIBOCTDLD to be $LIBOCTDLD" 1>&4 fi if test -n "$LD_STATIC_FLAG"; then echo "$ac_t""defining LD_STATIC_FLAG to be $LD_STATIC_FLAG" 1>&4 fi ### See if the optional nonlinear programming code is present. echo $ac_n "checking for npsol""... $ac_c" 1>&4 if test -f $srcdir/libcruft/npsol/npsol.f; then echo "$ac_t""yes" 1>&4 else echo "$ac_t""no" 1>&4 cat >> confdefs.h <<\EOF #define NPSOL_MISSING 1 EOF fi echo $ac_n "checking for qpsol""... $ac_c" 1>&4 if test -f $srcdir/libcruft/qpsol/qpsol.f; then echo "$ac_t""yes" 1>&4 else echo "$ac_t""no" 1>&4 cat >> confdefs.h <<\EOF #define QPSOL_MISSING 1 EOF fi echo $ac_n "checking for fsqp""... $ac_c" 1>&4 if test -f $srcdir/libcruft/fsqp/fsqpd.f; then echo "$ac_t""yes" 1>&4 else echo "$ac_t""no" 1>&4 cat >> confdefs.h <<\EOF #define FSQP_MISSING 1 EOF fi ### See which C++ compiler to use (we expect to find g++). for ac_prog in $CCC c++ g++ gcc CC cxx do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_CXX'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$CXX"; then ac_cv_prog_CXX="$CXX" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_CXX="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi CXX="$ac_cv_prog_CXX" if test -n "$CXX"; then echo "$ac_t""$CXX" 1>&4 else echo "$ac_t""no" 1>&4 fi test -n "$CXX" && break done test -n "$CXX" || CXX="gcc" echo $ac_n "checking whether we are using GNU C++""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_gxx'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.C <&5 | egrep yes >/dev/null 2>&1; then ac_cv_prog_gxx=yes else ac_cv_prog_gxx=no fi fi echo "$ac_t""$ac_cv_prog_gxx" 1>&4 if test $ac_cv_prog_gxx = yes; then GXX=yes if test "${CXXFLAGS+set}" != set; then echo $ac_n "checking whether ${CXX-g++} accepts -g""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_gxx_g'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else echo 'void f(){}' > conftest.cc if test -z "`${CXX-g++} -g -c conftest.cc 2>&1`"; then ac_cv_prog_gxx_g=yes else ac_cv_prog_gxx_g=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_prog_gxx_g" 1>&4 if test $ac_cv_prog_gxx_g = yes; then CXXFLAGS="-g -O" else CXXFLAGS="-O" fi fi else GXX= test "${CXXFLAGS+set}" = set || CXXFLAGS="-g" fi echo $ac_n "checking how to run the C++ preprocessor""... $ac_c" 1>&4 if test -z "$CXXCPP"; then if eval "test \"`echo '${'ac_cv_prog_CXXCPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_ext=C # CXXFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CXXCPP $CPPFLAGS' ac_compile='${CXX-g++} $CXXFLAGS $CPPFLAGS conftest.$ac_ext -c 1>&5 2>&5' ac_link='${CXX-g++} $CXXFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext -o conftest $LIBS 1>&5 2>&5' CXXCPP="${CXX-g++} -E" cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 rm -rf conftest* CXXCPP=/lib/cpp fi rm -f conftest* ac_cv_prog_CXXCPP="$CXXCPP" ac_ext=c # CFLAGS is not in ac_cpp because -g, -O, etc. are not valid cpp options. ac_cpp='$CPP $CPPFLAGS' ac_compile='${CC-cc} $CFLAGS $CPPFLAGS conftest.$ac_ext -c 1>&5 2>&5' ac_link='${CC-cc} $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext -o conftest $LIBS 1>&5 2>&5' fi fi CXXCPP="$ac_cv_prog_CXXCPP" echo "$ac_t""$CXXCPP" 1>&4 ### Do special things for g++. ADD_CXX_WALL=false NO_IMPLICIT_TEMPLATES= gxx_version=`$CXX -v 2>&1 | grep "^g.. version" | sed 's/^g.. version *//'` case "$gxx_version" in 2.[6789].*|2.[123456789][0123456789].*) CXXFLAGS="-g -O" echo "$ac_t""defining CXXFLAGS to be $CXXFLAGS" 1>&4 NO_IMPLICIT_TEMPLATES="-fno-implicit-templates" echo "$ac_t""defining NO_IMPLICIT_TEMPLATES to be $NO_IMPLICIT_TEMPLATES" 1>&4 ADD_CXX_WALL=true ;; 1.*|2.[012345].*) echo "configure: warning: g++ version $gxx_version will not work to compile Octave" 1>&2 ;; *) echo "configure: warning: Octave has only been tested with g++, and I can't find it" 1>&2 ;; esac HOST_CXXFLAGS= case "$gxx_version" in 2.6.*) case "$canonical_host_type" in rs6000-ibm-aix*) HOST_CXXFLAGS="-Wa,-u" echo "$ac_t""defining HOST_CXXFLAGS to be $HOST_CXXFLAGS" 1>&4 ;; esac ;; esac ### See what libraries are used by the C++ compiler. Need this for ### dynamic linking. CXXLIBS=`sh $srcdir/cxxlibs.sh` echo "$ac_t""defining CXXLIBS to be $CXXLIBS" 1>&4 ### See which C compiler to use (we expect to find gcc). # Extract the first word of "gcc", so it can be a program name with args. set dummy gcc; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_CC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$CC"; then ac_cv_prog_CC="$CC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_CC="gcc" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_CC" && ac_cv_prog_CC="cc" fi fi CC="$ac_cv_prog_CC" if test -n "$CC"; then echo "$ac_t""$CC" 1>&4 else echo "$ac_t""no" 1>&4 fi echo $ac_n "checking whether we are using GNU C""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_gcc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.c <&5 | egrep yes >/dev/null 2>&1; then ac_cv_prog_gcc=yes else ac_cv_prog_gcc=no fi fi echo "$ac_t""$ac_cv_prog_gcc" 1>&4 if test $ac_cv_prog_gcc = yes; then GCC=yes if test "${CFLAGS+set}" != set; then echo $ac_n "checking whether ${CC-cc} accepts -g""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_gcc_g'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else echo 'void f(){}' > conftest.c if test -z "`${CC-cc} -g -c conftest.c 2>&1`"; then ac_cv_prog_gcc_g=yes else ac_cv_prog_gcc_g=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_prog_gcc_g" 1>&4 if test $ac_cv_prog_gcc_g = yes; then CFLAGS="-g -O" else CFLAGS="-O" fi fi else GCC= test "${CFLAGS+set}" = set || CFLAGS="-g" fi echo $ac_n "checking how to run the C preprocessor""... $ac_c" 1>&4 # On Suns, sometimes $CPP names a directory. if test -n "$CPP" && test -d "$CPP"; then CPP= fi if test -z "$CPP"; then if eval "test \"`echo '${'ac_cv_prog_CPP'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else # This must be in double quotes, not single quotes, because CPP may get # substituted into the Makefile and "${CC-cc}" will confuse make. CPP="${CC-cc} -E" # On the NeXT, cc -E runs the code through the compiler's parser, # not just through cpp. cat > conftest.$ac_ext < Syntax Error EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 rm -rf conftest* CPP="${CC-cc} -E -traditional-cpp" cat > conftest.$ac_ext < Syntax Error EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then : else echo "$ac_err" >&5 rm -rf conftest* CPP=/lib/cpp fi rm -f conftest* fi rm -f conftest* ac_cv_prog_CPP="$CPP" fi fi CPP="$ac_cv_prog_CPP" echo "$ac_t""$CPP" 1>&4 if test $ac_cv_prog_gcc = yes; then echo $ac_n "checking whether ${CC-cc} needs -traditional""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_gcc_traditional'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_pattern="Autoconf.*'x'" cat > conftest.$ac_ext < Autoconf TIOCGETP EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes else rm -rf conftest* ac_cv_prog_gcc_traditional=no fi rm -f conftest* if test $ac_cv_prog_gcc_traditional = no; then cat > conftest.$ac_ext < Autoconf TCGETA EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "$ac_pattern" >/dev/null 2>&1; then rm -rf conftest* ac_cv_prog_gcc_traditional=yes fi rm -f conftest* fi fi echo "$ac_t""$ac_cv_prog_gcc_traditional" 1>&4 if test $ac_cv_prog_gcc_traditional = yes; then CC="$CC -traditional" fi fi ### Do special things for gcc. ADD_CC_WALL=false gcc_version=`$CC -v 2>&1 | grep "^gcc version" | sed 's/^gcc version *//'` case "$gcc_version" in 2.*) CFLAGS="-g -O" echo "$ac_t""defining CFLAGS to be $CFLAGS" 1>&4 LDFLAGS="-g" echo "$ac_t""defining LDFLAGS to be $LDFLAGS" 1>&4 ADD_CC_WALL=true ;; 1.*) echo "configure: warning: gcc version $gcc_version is likely to cause problems" 1>&2 ;; *) echo "configure: warning: Octave has only been tested with gcc, and I can't find it" 1>&2 ;; esac ### On Linux systems we need to compile with -mieee-fp to get full ### support for IEEE floating point. case "$canonical_host_type" in i386-*-linux | i486-*-linux | i586-*-linux) GCC_IEEE_FP_FLAG="-mieee-fp" echo "$ac_t""defining GCC_IEEE_FP_FLAG to be $GCC_IEEE_FP_FLAG" 1>&4 ;; esac ### Special checks for odd OS specific things. echo $ac_n "checking for POSIXized ISC""... $ac_c" 1>&4 if test -d /etc/conf/kconfig.d && grep _POSIX_VERSION /usr/include/sys/unistd.h >/dev/null 2>&1 then echo "$ac_t""yes" 1>&4 ISC=yes # If later tests want to check for ISC. cat >> confdefs.h <<\EOF #define _POSIX_SOURCE 1 EOF if test "$GCC" = yes; then CC="$CC -posix" else CC="$CC -Xp" fi else echo "$ac_t""no" 1>&4 ISC= fi ac_safe=`echo "minix/config.h" | tr './\055' '___'` echo $ac_n "checking for minix/config.h""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 MINIX=yes else echo "$ac_t""no" 1>&4 MINIX= fi if test "$MINIX" = yes; then cat >> confdefs.h <<\EOF #define _POSIX_SOURCE 1 EOF cat >> confdefs.h <<\EOF #define _POSIX_1_SOURCE 2 EOF cat >> confdefs.h <<\EOF #define _MINIX 1 EOF fi echo $ac_n "checking for AIX""... $ac_c" 1>&4 cat > conftest.$ac_ext <&5 | egrep "yes" >/dev/null 2>&1; then rm -rf conftest* echo "$ac_t""yes" 1>&4; cat >> confdefs.h <<\EOF #define _ALL_SOURCE 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&4 fi rm -f conftest* # strftime is in -lintl on SCO UNIX. echo $ac_n "checking for -lintl""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_intl'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lintl " cat > conftest.$ac_ext <&4 LIBS="$LIBS -lintl" else echo "$ac_t""no" 1>&4 fi echo $ac_n "checking for strftime""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_strftime'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char strftime(); int main() { return 0; } int t() { /* 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_strftime) || defined (__stub___strftime) choke me #else strftime(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_strftime=yes" else rm -rf conftest* eval "ac_cv_func_strftime=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'strftime`\" = yes"; then echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define HAVE_STRFTIME 1 EOF else echo "$ac_t""no" 1>&4 fi echo $ac_n "checking for -lsun""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_sun'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lsun " cat > conftest.$ac_ext <&4 ac_tr_lib=HAVE_LIB`echo sun | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi ### How big are ints and how are they oriented? These could probably ### be eliminated in favor of run-time checks. # If we cannot run a trivial program, we must be cross compiling. echo $ac_n "checking whether cross-compiling""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_c_cross'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then ac_cv_cross=yes else cat > conftest.$ac_ext </dev/null; then ac_cv_c_cross=no else ac_cv_c_cross=yes fi fi rm -fr conftest* fi cross_compiling=$ac_cv_c_cross echo "$ac_t""$ac_cv_c_cross" 1>&4 echo $ac_n "checking size of short""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_sizeof_short'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(short)); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_sizeof_short=`cat conftestval` fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_sizeof_short" 1>&4 cat >> confdefs.h <&4 if eval "test \"`echo '${'ac_cv_sizeof_int'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(int)); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_sizeof_int=`cat conftestval` fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_sizeof_int" 1>&4 cat >> confdefs.h <&4 if eval "test \"`echo '${'ac_cv_sizeof_long'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < main() { FILE *f=fopen("conftestval", "w"); if (!f) exit(1); fprintf(f, "%d\n", sizeof(long)); exit(0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_sizeof_long=`cat conftestval` fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_sizeof_long" 1>&4 cat >> confdefs.h <&4 if eval "test \"`echo '${'ac_cv_c_bigendian'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext </dev/null; then ac_cv_c_bigendian=no else ac_cv_c_bigendian=yes fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_c_bigendian" 1>&4 if test $ac_cv_c_bigendian = yes; then cat >> confdefs.h <<\EOF #define WORDS_BIGENDIAN 1 EOF fi ### Try to determine the floating point format. This could probably ### be eliminated in favor of run-time checks. echo $ac_n "checking floating point format""... $ac_c" 1>&4 XCFLAGS=`echo $CFLAGS | sed 's/-O[^ \t]*//'` ${CC-cc} -DDP $XCFLAGS $LDFLAGS $srcdir/float-type.c -o conftest >/dev/null 2>&1 FLOAT_FORMAT=`./conftest` case "$FLOAT_FORMAT" in IEEE_BIG_ENDIAN) echo "$ac_t""IEEE big endian" 1>&4 cat >> confdefs.h <<\EOF #define IEEE_BIG_ENDIAN 1 EOF ;; IEEE_LITTLE_ENDIAN) echo "$ac_t""IEEE little endian" 1>&4 cat >> confdefs.h <<\EOF #define IEEE_LITTLE_ENDIAN 1 EOF ;; VAX_D_FLOAT) echo "$ac_t""VAX D floating" 1>&4 cat >> confdefs.h <<\EOF #define VAX_D_FLOAT 1 EOF ;; VAX_G_FLOAT) echo "$ac_t""VAX G floating" 1>&4 cat >> confdefs.h <<\EOF #define VAX_G_FLOAT 1 EOF ;; *) echo "$ac_t""" 1>&4 echo "configure: warning: "unrecognized floating point format!"" 1>&2 ;; esac ### Does the C compiler handle alloca() and const correctly? # The Ultrix 4.2 mips builtin alloca declared by alloca.h only works # for constant arguments. Useless! echo $ac_n "checking for working alloca.h""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_alloca_h'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < int main() { return 0; } int t() { char *p = alloca(2 * sizeof(int)); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_header_alloca_h=yes else rm -rf conftest* ac_cv_header_alloca_h=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_alloca_h" 1>&4 if test $ac_cv_header_alloca_h = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA_H 1 EOF fi echo $ac_n "checking for alloca""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_alloca'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < # else # ifdef _AIX #pragma alloca # else # ifndef alloca /* predefined by HP cc +Olibcalls */ char *alloca (); # endif # endif # endif #endif int main() { return 0; } int t() { char *p = (char *) alloca(1); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* ac_cv_func_alloca=yes else rm -rf conftest* ac_cv_func_alloca=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_func_alloca" 1>&4 if test $ac_cv_func_alloca = yes; then cat >> confdefs.h <<\EOF #define HAVE_ALLOCA 1 EOF fi if test $ac_cv_func_alloca = no; then # The SVR3 libPW and SVR4 libucb both contain incompatible functions # that cause trouble. Some versions do not even contain alloca or # contain a buggy version. If you still want to use their alloca, # use ar to extract alloca.o from them instead of compiling alloca.c. ALLOCA=alloca.o cat >> confdefs.h <<\EOF #define C_ALLOCA 1 EOF echo $ac_n "checking whether alloca needs Cray hooks""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_os_cray'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext <&5 | egrep "webecray" >/dev/null 2>&1; then rm -rf conftest* ac_cv_os_cray=yes else rm -rf conftest* ac_cv_os_cray=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_os_cray" 1>&4 if test $ac_cv_os_cray = yes; then echo $ac_n "checking for _getb67""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func__getb67'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char _getb67(); int main() { return 0; } int t() { /* 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__getb67) || defined (__stub____getb67) choke me #else _getb67(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func__getb67=yes" else rm -rf conftest* eval "ac_cv_func__getb67=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'_getb67`\" = yes"; then echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define CRAY_STACKSEG_END _getb67 EOF else echo "$ac_t""no" 1>&4 echo $ac_n "checking for GETB67""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_GETB67'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char GETB67(); int main() { return 0; } int t() { /* 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_GETB67) || defined (__stub___GETB67) choke me #else GETB67(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_GETB67=yes" else rm -rf conftest* eval "ac_cv_func_GETB67=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'GETB67`\" = yes"; then echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define CRAY_STACKSEG_END GETB67 EOF else echo "$ac_t""no" 1>&4 echo $ac_n "checking for getb67""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_getb67'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char getb67(); int main() { return 0; } int t() { /* 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_getb67) || defined (__stub___getb67) choke me #else getb67(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_getb67=yes" else rm -rf conftest* eval "ac_cv_func_getb67=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'getb67`\" = yes"; then echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define CRAY_STACKSEG_END getb67 EOF else echo "$ac_t""no" 1>&4 fi fi fi fi echo $ac_n "checking stack direction for C alloca""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_c_stack_direction'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then ac_cv_c_stack_direction=0 else cat > conftest.$ac_ext < addr) ? 1 : -1; } main () { exit (find_stack_direction() < 0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_c_stack_direction=1 else ac_cv_c_stack_direction=-1 fi fi rm -fr conftest* fi echo "$ac_t""$ac_cv_c_stack_direction" 1>&4 cat >> confdefs.h </dev/null`" = NetBSD \ || test "`(uname) 2>/dev/null`" = FreeBSD; then cat >> confdefs.h <<\EOF #define SMART_PUTENV 1 EOF fi echo $ac_n "checking for working const""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_c_const'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext <j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; } ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_c_const=yes else rm -rf conftest* ac_cv_c_const=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_c_const" 1>&4 if test $ac_cv_c_const = no; then cat >> confdefs.h <<\EOF #define const EOF fi ### If we haven't been forced to use f2c, try to find a Fortran compiler ### under any one of several common Un*x Fortran compiler names. ### Put fc last to avoid confusion with some vendor's /bin/sh fc ### builtin. ### ### xlf : IBM / AIX ### cf77 : Cray / Unicos ### g77 : GNU Fortran (someday...) ### fc : Convex ### ### I don't think the Cray compiler will ever work like f2c... if $use_f2c; then true else F77= for ac_prog in xlf cf77 f77 g77 fc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_F77'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$F77"; then ac_cv_prog_F77="$F77" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_F77="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi F77="$ac_cv_prog_F77" if test -n "$F77"; then echo "$ac_t""$F77" 1>&4 else echo "$ac_t""no" 1>&4 fi test -n "$F77" && break done # If it looks like we have a Fortran compiler, try to determine # whether it might be compatible with f2c. if test -n "$F77"; then echo $ac_n "checking $F77/f2c compatibility""... $ac_c" 1>&4 export F77 export CC tmpdef=`sh $srcdir/f2c-compat.sh $srcdir/flibs.sh` status=$? if test $status -eq 0; then echo "$ac_t""yes" 1>&4 if test "$tmpdef" = '-DF77_APPEND_UNDERSCORE=1'; then cat >> confdefs.h <<\EOF #define F77_APPEND_UNDERSCORE 1 EOF fi else echo "$ac_t""no" 1>&4 F77= fi fi fi ### If we can't find a Fortran compiler, or if it looks like it isn't ### compatible with f2c, try to find f2c. if test -z "$F77"; then # Extract the first word of "f2c", so it can be a program name with args. set dummy f2c; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_F2C'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$F2C"; then ac_cv_prog_F2C="$F2C" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_F2C="f2c" break fi done IFS="$ac_save_ifs" fi fi F2C="$ac_cv_prog_F2C" if test -n "$F2C"; then echo "$ac_t""$F2C" 1>&4 else echo "$ac_t""no" 1>&4 fi fi F2CFLAGS= FFLAGS="-O" echo "$ac_t""defining FFLAGS to be $FFLAGS" 1>&4 if test -n "$F77"; then export F77 FLIBS=`sh $srcdir/flibs.sh` echo "$ac_t""defining FLIBS to be $FLIBS" 1>&4 DOT_C_FROM_DOT_F_CMD= DOT_O_FROM_DOT_F_PAT= elif test -n "$F2C" || $use_f2c; then echo $ac_n "checking for -lf2c""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_f2c'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lf2c " cat > conftest.$ac_ext <&4 FLIBS=-lf2c else echo "$ac_t""no" 1>&4 fi if test -z "$FLIBS" ; then echo $ac_n "checking for -lF77""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_F77'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lF77 " cat > conftest.$ac_ext <&4 FLIBS=-lF77 else echo "$ac_t""no" 1>&4 fi if test -n "$FLIBS" ; then echo $ac_n "checking for -lI77""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_I77'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lI77 " cat > conftest.$ac_ext <&4 FLIBS="$FLIBS -lI77" else echo "$ac_t""no" 1>&4 fi fi fi if test -z "$FLIBS" ; then echo "configure: warning: I found f2c but not libf2c.a, or libF77.a and libI77.a" 1>&2 fi DOT_C_FROM_DOT_F_CMD=' cat $< | $(F2C) $(F2CFLAGS) > $(@F)' echo "$ac_t""defining DOT_C_FROM_DOT_F_CMD to be $DOT_C_FROM_DOT_F_CMD" 1>&4 DOT_O_FROM_DOT_F_PAT='%.o : %.f' echo "$ac_t""defining DOT_O_FROM_DOT_F_PAT to be $DOT_O_FROM_DOT_F_PAT" 1>&4 cat >> confdefs.h <<\EOF #define F77_APPEND_UNDERSCORE 1 EOF else echo "configure: warning: in order to build octave, you must have a compatible" 1>&2 echo "configure: warning: Fortran compiler or f2c installed and in your path." 1>&2 echo "configure: warning: See the file INSTALL for more information." 1>&2 echo "configure: warning: Continuing anyway..." 1>&2 fi ### Extract libraries and directories from FLIBS and CXXLIBS. ### ### Leave only libraries, with -lfoo converted to libfoo.a: FLIB_LIST=`echo " $FLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *[^ ]*/ /g' \ -e 's/ -l *\([^ ]*\)/ lib\1.a/g' -e 's/ -u *[^ ]*/ /g' \ -e 's/^ *//' -e 's/ *$//' -e 's/ */:/g'` CXXLIB_LIST=`echo " $CXXLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *[^ ]*/ /g' \ -e 's/ -l *\([^ ]*\)/ lib\1.a/g' -e 's/ -u *[^ ]*/ /g' \ -e 's/^ *//' -e 's/ *$//' -e 's/ */:/g'` ### Leave only directories where libraries might be found: FLIB_PATH=`echo " $FLIBS " | sed \ -e 's/ / /g' -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *\([^ ]*\)/ \1/g' -e 's, /[^ ]*\.a , ,g' \ -e 's/ -l *[^ ]*/ /g' -e 's/ -u *[^ ]*/ /g' -e 's/^ *//' \ -e 's/ *$//' -e 's/ */:/g'` CXXLIB_PATH=`echo " $CXXLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *\([^ ]*\)/ \1/g' -e 's, /[^ ]*\.a , ,g' \ -e 's/ / /g' -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -l *[^ ]*/ /g' -e 's/ -u *[^ ]*/ /g' -e 's/^ *//' \ -e 's/ *$//' -e 's/ */:/g'` echo "$ac_t""defining FLIB_LIST to be $FLIB_LIST" 1>&4 echo "$ac_t""defining FLIB_PATH to be $FLIB_PATH" 1>&4 echo "$ac_t""defining CXXLIB_LIST to be $CXXLIB_LIST" 1>&4 echo "$ac_t""defining CXXLIB_PATH to be $CXXLIB_PATH" 1>&4 ### Checks for header files. echo $ac_n "checking for ANSI C header files""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_stdc'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include #include #include EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* ac_cv_header_stdc=yes else echo "$ac_err" >&5 rm -rf conftest* ac_cv_header_stdc=no fi rm -f conftest* if test $ac_cv_header_stdc = yes; then # SunOS 4.x string.h does not declare mem*, contrary to ANSI. cat > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "memchr" >/dev/null 2>&1; then : else rm -rf conftest* 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 > conftest.$ac_ext < EOF if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | egrep "free" >/dev/null 2>&1; then : else rm -rf conftest* 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 ac_cv_header_stdc=no else cat > conftest.$ac_ext < #define ISLOWER(c) ('a' <= (c) && (c) <= 'z') #define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #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)) exit(2); exit (0); } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then : else ac_cv_header_stdc=no fi fi rm -fr conftest* fi fi echo "$ac_t""$ac_cv_header_stdc" 1>&4 if test $ac_cv_header_stdc = yes; then cat >> confdefs.h <<\EOF #define STDC_HEADERS 1 EOF fi for ac_hdr in assert.h float.h limits.h memory.h pwd.h stdlib.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done for ac_hdr in string.h varargs.h unistd.h floatingpoint.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done for ac_hdr in sys/utsname.h sys/time.h sys/fcntl.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done for ac_hdr in sys/ttold.h sys/ptem.h sys/select.h sys/resource.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done ac_header_dirent=no for ac_hdr in dirent.h sys/ndir.h sys/dir.h ndir.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr that defines DIR""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_dirent_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include <$ac_hdr> int main() { return 0; } int t() { DIR *dirp = 0; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=yes" else rm -rf conftest* eval "ac_cv_header_dirent_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_dirent_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done # Two versions of opendir et al. are in -ldir and -lx on SCO Xenix. if test $ac_header_dirent = dirent.h; then echo $ac_n "checking for -ldir""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_dir'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -ldir " cat > conftest.$ac_ext <&4 LIBS="$LIBS -ldir" else echo "$ac_t""no" 1>&4 fi else echo $ac_n "checking for -lx""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_x'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lx " cat > conftest.$ac_ext <&4 LIBS="$LIBS -lx" else echo "$ac_t""no" 1>&4 fi fi echo $ac_n "checking whether time.h and sys/time.h may both be included""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_time'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include #include int main() { return 0; } int t() { struct tm *tp; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_header_time=yes else rm -rf conftest* ac_cv_header_time=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_header_time" 1>&4 if test $ac_cv_header_time = yes; then cat >> confdefs.h <<\EOF #define TIME_WITH_SYS_TIME 1 EOF fi ### Use sgtty on Ultrix so that using DEC Migrate to convert a Mips ### binary to an Alpha binary will work. Also on Alpha/OSF to avoid ### a readline bug. case "$canonical_host_type" in mips-dec-ultrix* | alpha-dec-osf*) ac_safe=`echo "sgtty.h" | tr './\055' '___'` echo $ac_n "checking for sgtty.h""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define HAVE_SGTTY_H 1 EOF else echo "$ac_t""no" 1>&4 fi if test "$ac_cv_header_sgtty_h" = no; then for ac_hdr in termios.h termio.h sgtty.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done fi ;; *) for ac_hdr in termios.h termio.h sgtty.h do ac_safe=`echo "$ac_hdr" | tr './\055' '___'` echo $ac_n "checking for $ac_hdr""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_header_$ac_safe'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < EOF eval "$ac_cpp conftest.$ac_ext >/dev/null 2>conftest.out" ac_err=`grep -v '^ *+' conftest.out` if test -z "$ac_err"; then rm -rf conftest* eval "ac_cv_header_$ac_safe=yes" else echo "$ac_err" >&5 rm -rf conftest* eval "ac_cv_header_$ac_safe=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_header_'$ac_safe`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_hdr=HAVE_`echo $ac_hdr | tr '[a-z]./\055' '[A-Z]___'` cat >> confdefs.h <&4 fi done ;; esac if test "$ac_cv_header_termios_h" = yes \ || test "$ac_cv_header_termio_h" = yes \ || test "$ac_cv_header_sgtty_h" = yes; then true else { echo "configure: error: I couldn't find termios.h, termio.h, or sgtty.h!" 1>&2; exit 1; } fi ### Checks for functions. for ac_func in setvbuf getcwd gethostname bzero bcopy rindex vfprintf vsprintf do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi done for ac_func in stricmp strnicmp strcasecmp strncasecmp strerror atexit do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi done for ac_func in on_exit tempnam memmove putenv gettimeofday getrusage do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi done ### Check to see if we have IEEE math functions, and if so, which ones. ### ### For Linux: add -mieee-fp flag to CFLAGS when checking for IEEE FP ### functions, otherwise we may not find them. ### ### Also check for some additional trig functions that aren't ANSI but ### are often available. If they are missing, we try to replace them ### with functions from the BSD/NET2 math library. echo $ac_n "checking for -lsunmath""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_sunmath'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lsunmath " cat > conftest.$ac_ext <&4 ac_tr_lib=HAVE_LIB`echo sunmath | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi echo $ac_n "checking for -lm""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_m'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -lm " cat > conftest.$ac_ext <&4 ac_tr_lib=HAVE_LIB`echo m | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi XCFLAGS="$CFLAGS" CFLAGS="$CFLAGS $GCC_IEEE_FP_FLAG" ### Inf and NaN don't work with gcc on the Alpha yet. case "$canonical_host_type" in alpha-dec-osf*) ;; *) for ac_func in finite isnan isinf infinity quiet_nan do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi done ;; esac for ac_func in erf erfc lgamma do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 ac_tr_func=HAVE_`echo $ac_func | tr '[a-z]' '[A-Z]'` cat >> confdefs.h <&4 fi done echo $ac_n "checking for signgam declaration in math.h""... $ac_c" 1>&4 cat > conftest.$ac_ext < int main() { return 0; } int t() { int foo = signgam + 1; ; return 0; } EOF if eval $ac_link; then rm -rf conftest* echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define SIGNGAM_DECLARED 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&4 fi rm -f conftest* CFLAGS="$XCFLAGS" ### Check for nonstandard but common trig functions that we need. ### If they are missing, we replace them using functions from the BSD ### math library, and we may need to replace some other functions too. for ac_func in acosh asinh atanh do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done if test -n "$LIBOBJS"; then for func in $LIBOBJS do case "$func" in *acosh.o*) cat >> confdefs.h <<\EOF #define ACOSH_MISSING 1 EOF ;; *asinh.o*) cat >> confdefs.h <<\EOF #define ASINH_MISSING 1 EOF ;; *atanh.o*) cat >> confdefs.h <<\EOF #define ATANH_MISSING 1 EOF ;; esac done case $LIBOBJS in *acosh.o* | *asinh.o*) for ac_func in copysign do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done ;; esac case $LIBOBJS in *acosh.o* | *asinh.o* | *atanh.o*) for ac_func in log1p do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done ;; esac case $LIBOBJS in *log1p*) for ac_func in log__L do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done ;; esac case $LIBOBJS in *log1p*) for ac_func in finite do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done ;; esac case $LIBOBJS in *copysign* | *finite* | *log1p*) for ac_func in logb scalb do echo $ac_n "checking for $ac_func""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_$ac_func'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < /* Arbitrary system header to define __stub macros. */ /* Override any gcc2 internal prototype to avoid an error. */ char $ac_func(); int main() { return 0; } int t() { /* 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_$ac_func) || defined (__stub___$ac_func) choke me #else $ac_func(); #endif ; return 0; } EOF if eval $ac_link; then rm -rf conftest* eval "ac_cv_func_$ac_func=yes" else rm -rf conftest* eval "ac_cv_func_$ac_func=no" fi rm -f conftest* fi if eval "test \"`echo '$ac_cv_func_'$ac_func`\" = yes"; then echo "$ac_t""yes" 1>&4 : else echo "$ac_t""no" 1>&4 LIBOBJS="$LIBOBJS ${ac_func}.o" fi done ;; esac fi ### Checks for OS specific cruft. echo $ac_n "checking whether struct tm is in sys/time.h or time.h""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_struct_tm'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include int main() { return 0; } int t() { struct tm *tp; tp->tm_sec; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_struct_tm=time.h else rm -rf conftest* ac_cv_struct_tm=sys/time.h fi rm -f conftest* fi echo "$ac_t""$ac_cv_struct_tm" 1>&4 if test $ac_cv_struct_tm = sys/time.h; then cat >> confdefs.h <<\EOF #define TM_IN_SYS_TIME 1 EOF fi echo $ac_n "checking whether setvbuf arguments are reversed""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_func_setvbuf_reversed'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test "$cross_compiling" = yes; then { echo "configure: error: can not run test program while cross compiling" 1>&2; exit 1; } else cat > conftest.$ac_ext < /* If setvbuf has the reversed format, exit 0. */ main () { /* This call has the arguments reversed. A reversed system may check and see that the address of main is not _IOLBF, _IONBF, or _IOFBF, and return nonzero. */ if (setvbuf(stdout, _IOLBF, (char *) main, BUFSIZ) != 0) exit(1); putc('\r', stdout); exit(0); /* Non-reversed systems segv here. */ } EOF eval $ac_link if test -s conftest && (./conftest; exit) 2>/dev/null; then ac_cv_func_setvbuf_reversed=yes else ac_cv_func_setvbuf_reversed=no fi fi rm -fr conftest* rm -f core fi echo "$ac_t""$ac_cv_func_setvbuf_reversed" 1>&4 if test $ac_cv_func_setvbuf_reversed = yes; then cat >> confdefs.h <<\EOF #define SETVBUF_REVERSED 1 EOF fi TERMLIBS="" for termlib in termcap terminfo curses termlib ; do echo $ac_n "checking for -l${termlib}""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_${termlib}'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -l${termlib} " cat > conftest.$ac_ext <&4 TERMLIBS="${TERMLIBS} -l${termlib}" else echo "$ac_t""no" 1>&4 fi case "${TERMLIBS}" in *-l${termlib}*) echo "$ac_t""defining TERMLIBS to be $TERMLIBS" 1>&4 break ;; esac done echo $ac_n "checking for struct exception in math.h""... $ac_c" 1>&4 cat > conftest.$ac_ext < int main() { return 0; } int t() { struct exception *x; x->type; x->name; ; return 0; } EOF if eval $ac_link; then rm -rf conftest* echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define EXCEPTION_IN_MATH 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&4 fi rm -f conftest* ### Signal stuff. echo $ac_n "checking return type of signal handlers""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_type_signal'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include #ifdef signal #undef signal #endif extern void (*signal ()) (); int main() { return 0; } int t() { int i; ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_type_signal=void else rm -rf conftest* ac_cv_type_signal=int fi rm -f conftest* fi echo "$ac_t""$ac_cv_type_signal" 1>&4 cat >> confdefs.h <&4 if eval "test \"`echo '${'ac_cv_decl_sys_siglist'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else cat > conftest.$ac_ext < #include /* NetBSD declares sys_siglist in unistd.h. */ #ifdef HAVE_UNISTD_H #include #endif int main() { return 0; } int t() { char *msg = *(sys_siglist + 1); ; return 0; } EOF if eval $ac_compile; then rm -rf conftest* ac_cv_decl_sys_siglist=yes else rm -rf conftest* ac_cv_decl_sys_siglist=no fi rm -f conftest* fi echo "$ac_t""$ac_cv_decl_sys_siglist" 1>&4 if test $ac_cv_decl_sys_siglist = yes; then cat >> confdefs.h <<\EOF #define SYS_SIGLIST_DECLARED 1 EOF fi echo $ac_n "checking for sys_siglist variable""... $ac_c" 1>&4 cat > conftest.$ac_ext < int main() { return 0; } int t() { extern char *sys_siglist[]; printf ("%s\n", sys_siglist[1]); ; return 0; } EOF if eval $ac_link; then rm -rf conftest* echo "$ac_t""yes" 1>&4 cat >> confdefs.h <<\EOF #define HAVE_SYS_SIGLIST 1 EOF else rm -rf conftest* echo "$ac_t""no" 1>&4 fi rm -f conftest* ### Define VOID_SIGHANDLER for readline. case "$RETSIGTYPE" in int) ;; *) VOID_SIGHANDLER="-DVOID_SIGHANDLER=1" echo "$ac_t""defining VOID_SIGHANDLER to be 1" 1>&4 ;; esac ### Checks for other programs used for building, testing, installing, ### and running Octave. ### ### For now, don't define LEXLIB to be -lfl -- we don't use anything in ### it, and it might not be installed. ### ### Also make sure that we generate an interactive scanner if we are ### using flex. # Extract the first word of "flex", so it can be a program name with args. set dummy flex; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_LEX'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$LEX"; then ac_cv_prog_LEX="$LEX" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_LEX="flex" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_LEX" && ac_cv_prog_LEX="lex" fi fi LEX="$ac_cv_prog_LEX" if test -n "$LEX"; then echo "$ac_t""$LEX" 1>&4 else echo "$ac_t""no" 1>&4 fi if test -z "$LEXLIB" then case "$LEX" in flex*) ac_lib=fl ;; *) ac_lib=l ;; esac echo $ac_n "checking for -l$ac_lib""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_lib_$ac_lib'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else ac_save_LIBS="$LIBS" LIBS="$LIBS -l$ac_lib " cat > conftest.$ac_ext <&4 LEXLIB="-l$ac_lib" else echo "$ac_t""no" 1>&4 fi fi case "$LEX" in flex*) LFLAGS="-t -I" echo "$ac_t""defining LFLAGS to be $LFLAGS" 1>&4 LEXLIB= ;; *) LFLAGS="-t" echo "$ac_t""defining LFLAGS to be $LFLAGS" 1>&4 echo "configure: warning: I didn't find flex, but that's only a problem" 1>&2 echo "configure: warning: if you need to reconstruct lex.cc" 1>&2 ;; esac for ac_prog in 'bison -y' byacc do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_YACC'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$YACC"; then ac_cv_prog_YACC="$YACC" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_YACC="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi YACC="$ac_cv_prog_YACC" if test -n "$YACC"; then echo "$ac_t""$YACC" 1>&4 else echo "$ac_t""no" 1>&4 fi test -n "$YACC" && break done test -n "$YACC" || YACC="yacc" case "$YACC" in bison*) ;; *) echo "configure: warning: I didn't find bison, but that's only a problem" 1>&2 echo "configure: warning: if you need to reconstruct parse.cc" 1>&2 ;; esac # Extract the first word of "ranlib", so it can be a program name with args. set dummy ranlib; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_RANLIB'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$RANLIB"; then ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_RANLIB="ranlib" break fi done IFS="$ac_save_ifs" test -z "$ac_cv_prog_RANLIB" && ac_cv_prog_RANLIB=":" fi fi RANLIB="$ac_cv_prog_RANLIB" if test -n "$RANLIB"; then echo "$ac_t""$RANLIB" 1>&4 else echo "$ac_t""no" 1>&4 fi # Extract the first word of "runtest", so it can be a program name with args. set dummy runtest; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_RUNTEST'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$RUNTEST"; then ac_cv_prog_RUNTEST="$RUNTEST" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_RUNTEST="runtest" break fi done IFS="$ac_save_ifs" fi fi RUNTEST="$ac_cv_prog_RUNTEST" if test -n "$RUNTEST"; then echo "$ac_t""$RUNTEST" 1>&4 else echo "$ac_t""no" 1>&4 fi # Extract the first word of "expect", so it can be a program name with args. set dummy expect; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_EXPECT'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$EXPECT"; then ac_cv_prog_EXPECT="$EXPECT" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_EXPECT="expect" break fi done IFS="$ac_save_ifs" fi fi EXPECT="$ac_cv_prog_EXPECT" if test -n "$EXPECT"; then echo "$ac_t""$EXPECT" 1>&4 else echo "$ac_t""no" 1>&4 fi if test -z "$EXPECT" ; then RUNTEST= 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 # AFS /usr/afsws/bin/install, which mishandles nonexistent args # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" # ./install, which can be erroneously created by make from ./install.sh. echo $ac_n "checking for a BSD compatible install""... $ac_c" 1>&4 if test -z "$INSTALL"; then if eval "test \"`echo '${'ac_cv_path_install'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do case "$ac_dir" in ''|.|/etc|/usr/sbin|/usr/etc|/sbin|/usr/afsws/bin|/usr/ucb) ;; *) # OSF1 and SCO ODT 3.0 have their own names for install. for ac_prog in ginstall installbsd scoinst install; do if test -f $ac_dir/$ac_prog; then if test $ac_prog = install && grep dspmsg $ac_dir/$ac_prog >/dev/null 2>&1; then # AIX install. It has an incompatible calling convention. # OSF/1 installbsd also uses dspmsg, but is usable. : else ac_cv_path_install="$ac_dir/$ac_prog -c" break 2 fi fi done ;; esac done IFS="$ac_save_ifs" # As a last resort, use the slow shell script. test -z "$ac_cv_path_install" && ac_cv_path_install="$ac_install_sh" fi INSTALL="$ac_cv_path_install" fi echo "$ac_t""$INSTALL" 1>&4 # 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_DATA" && INSTALL_DATA='${INSTALL} -m 644' # Extract the first word of "gnuplot", so it can be a program name with args. set dummy gnuplot; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_GNUPLOT_BINARY'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$GNUPLOT_BINARY"; then ac_cv_prog_GNUPLOT_BINARY="$GNUPLOT_BINARY" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_GNUPLOT_BINARY="gnuplot" break fi done IFS="$ac_save_ifs" fi fi GNUPLOT_BINARY="$ac_cv_prog_GNUPLOT_BINARY" if test -n "$GNUPLOT_BINARY"; then echo "$ac_t""$GNUPLOT_BINARY" 1>&4 else echo "$ac_t""no" 1>&4 fi if test -z "$GNUPLOT_BINARY"; then echo "configure: warning: I didn't find gnuplot. It isn't necessary to have gnuplot" 1>&2 echo "configure: warning: installed, but you won't be able to use any of Octave's" 1>&2 echo "configure: warning: plotting commands without it." 1>&2 echo "configure: warning: " 1>&2 echo "configure: warning: If gnuplot is installed but it isn't in your path, you can" 1>&2 echo "configure: warning: tell Octave where to find it by typing the command" 1>&2 echo "configure: warning: " 1>&2 echo "configure: warning: gnuplot_binary = "/full/path/to/gnuplot/binary"" 1>&2 echo "configure: warning: " 1>&2 echo "configure: warning: at the Octave prompt." 1>&2 fi for ac_prog in less more page pg do # Extract the first word of "$ac_prog", so it can be a program name with args. set dummy $ac_prog; ac_word=$2 echo $ac_n "checking for $ac_word""... $ac_c" 1>&4 if eval "test \"`echo '${'ac_cv_prog_DEFAULT_PAGER'+set}'`\" = set"; then echo $ac_n "(cached) $ac_c" 1>&4 else if test -n "$DEFAULT_PAGER"; then ac_cv_prog_DEFAULT_PAGER="$DEFAULT_PAGER" # Let the user override the test. else IFS="${IFS= }"; ac_save_ifs="$IFS"; IFS="${IFS}:" for ac_dir in $PATH; do test -z "$ac_dir" && ac_dir=. if test -f $ac_dir/$ac_word; then ac_cv_prog_DEFAULT_PAGER="$ac_prog" break fi done IFS="$ac_save_ifs" fi fi DEFAULT_PAGER="$ac_cv_prog_DEFAULT_PAGER" if test -n "$DEFAULT_PAGER"; then echo "$ac_t""$DEFAULT_PAGER" 1>&4 else echo "$ac_t""no" 1>&4 fi test -n "$DEFAULT_PAGER" && break done if test -z "$DEFAULT_PAGER"; then echo "configure: warning: I couldn't find `less', `more', `page', or `pg'" 1>&2 elif test "$DEFAULT_PAGER" = less; then DEFAULT_PAGER="less -e" echo "$ac_t""defining DEFAULT_PAGER to be $DEFAULT_PAGER" 1>&4 fi ### Even though we include config.h in most files, some need to be ### compiled with the -D options on the compiler command line. Use ### UGLY_DEFS for that. # Transform confdefs.h into DEFS. # Protect against shell expansion while executing Makefile rules. # Protect against Makefile macro expansion. cat > conftest.defs <<\EOF s%#define \([A-Za-z_][A-Za-z0-9_]*\) \(.*\)%-D\1=\2%g s%[ `~#$^&*(){}\\|;'"<>?]%\\&%g s%\[%\\&%g s%\]%\\&%g s%\$%$$%g EOF DEFS=`sed -f conftest.defs confdefs.h | tr '\012' ' '` rm -f conftest.defs UGLY_DEFS="$DEFS" echo "$ac_t""defining UGLY_DEFS to be $UGLY_DEFS" 1>&4 ### Maybe add -Wall to compiler flags now that we're done feature ### testing. ### ### To get gcc and g++ to be really picky, try these adding these ### options to CFLAGS and CXXFLAGS along with -Wall: ### ### -ansi ### -pedantic ### -Wwrite-strings ### -Wid-clash-31 ### -Wpointer-arith ### -Wcast-qual ### -Wenum-clash ### -Wcast-align ### -Wtraditional ### -Wstrict-prototypes ### -Wmissing-prototypes ### -Wnested-externs ### -Woverloaded-virtual ### -Winline ### -felide-constructors ### -fnonnull-objects if $ADD_CXX_WALL; then CXXFLAGS="$CXXFLAGS -Wall" echo "$ac_t""adding -Wall to CXXFLAGS" 1>&4 fi if $ADD_CC_WALL; then CFLAGS="$CFLAGS -Wall" echo "$ac_t""adding -Wall to CFLAGS" 1>&4 fi ### Do the substitutions in all the Makefiles. trap '' 1 2 15 if test -w $cache_file; then echo "updating cache $cache_file" cat > $cache_file <<\EOF # 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. It is not useful on other systems. # If it contains results you don't want to keep, you may remove or edit it. # # By default, configure uses ./config.cache as the cache file, # creating it if it does not exist already. You can give configure # the --cache-file=FILE option to use a different cache file; that is # what configure does when it calls configure scripts in # subdirectories, so they share the cache. # Giving --cache-file=/dev/null disables caching, for debugging configure. # config.status only pays attention to the cache file if you give it the # --recheck option to rerun configure. # EOF # Ultrix sh set writes to stderr and can't be redirected directly. (set) 2>&1 | sed -n "s/^\([a-zA-Z0-9_]*_cv_[a-zA-Z0-9_]*\)=\(.*\)/: \${\1='\2'}/p" \ >> $cache_file else echo "not updating unwritable cache $cache_file" fi trap 'rm -fr conftest* confdefs* core $ac_clean_files; exit 1' 1 2 15 test "x$prefix" = xNONE && prefix=$ac_default_prefix # Let make expand exec_prefix. test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' # Any assignment to VPATH causes Sun make to only execute # the first set of double-colon rules, so remove it if not needed. # If there is a colon in the path, we need to keep it. if test "x$srcdir" = x.; then ac_vpsub='/^[ ]*VPATH[ ]*=[^:]*$/d' fi trap 'rm -f $CONFIG_STATUS conftest*; exit 1' 1 2 15 DEFS=-DHAVE_CONFIG_H # Without the "./", some shells look in PATH for config.status. : ${CONFIG_STATUS=./config.status} echo creating $CONFIG_STATUS rm -f $CONFIG_STATUS cat > $CONFIG_STATUS </dev/null | sed 1q`: # # $0 $ac_configure_args # # Compiler output produced by configure, useful for debugging # configure, is in ./config.log if it exists. ac_cs_usage="Usage: $CONFIG_STATUS [--recheck] [--version] [--help]" for ac_option do case "\$ac_option" in -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) echo "running \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion" exec \${CONFIG_SHELL-/bin/sh} $0 $ac_configure_args --no-create --no-recursion ;; -version | --version | --versio | --versi | --vers | --ver | --ve | --v) echo "$CONFIG_STATUS generated by autoconf version 2.1" exit 0 ;; -help | --help | --hel | --he | --h) echo "\$ac_cs_usage"; exit 0 ;; *) echo "\$ac_cs_usage"; exit 1 ;; esac done ac_given_srcdir=$srcdir ac_given_INSTALL="$INSTALL" trap 'rm -fr Makefile octMakefile Makeconf libcruft/Makefile libcruft/Makerules liboctave/Makefile src/Makefile dld/Makefile info/Makefile readline/Makefile readline/doc/Makefile readline/examples/Makefile doc/Makefile test/Makefile kpathsea/Makefile libcruft/blas/Makefile libcruft/balgen/Makefile libcruft/dassl/Makefile libcruft/eispack/Makefile libcruft/fftpack/Makefile libcruft/fsqp/Makefile libcruft/lapack/Makefile libcruft/linpack/Makefile libcruft/minpack/Makefile libcruft/misc/Makefile libcruft/npsol/Makefile libcruft/odepack/Makefile libcruft/qpsol/Makefile libcruft/quadpack/Makefile libcruft/ranlib/Makefile libcruft/villad/Makefile scripts/Makefile scripts/control/Makefile scripts/general/Makefile scripts/image/Makefile scripts/linear-algebra/Makefile scripts/miscellaneous/Makefile scripts/plot/Makefile scripts/polynomial/Makefile scripts/set/Makefile scripts/signal/Makefile scripts/special-matrix/Makefile scripts/startup/Makefile scripts/statistics/Makefile scripts/elfun/Makefile scripts/specfun/Makefile scripts/strings/Makefile config.h kpathsea/c-auto.h conftest*; exit 1' 1 2 15 # Protect against being on the right side of a sed subst in config.status. sed 's/%@/@@/; s/@%/@@/; s/%g$/@g/; /@g$/s/[\\\\&%]/\\\\&/g; s/@@/%@/; s/@@/@%/; s/@g$/%g/' > conftest.subs <<\CEOF $ac_vpsub $extrasub s%@CFLAGS@%$CFLAGS%g s%@CPPFLAGS@%$CPPFLAGS%g s%@CXXFLAGS@%$CXXFLAGS%g s%@DEFS@%$DEFS%g s%@LDFLAGS@%$LDFLAGS%g s%@LIBS@%$LIBS%g s%@exec_prefix@%$exec_prefix%g s%@prefix@%$prefix%g s%@program_transform_name@%$program_transform_name%g s%@host@%$host%g s%@host_alias@%$host_alias%g s%@host_cpu@%$host_cpu%g s%@host_vendor@%$host_vendor%g s%@host_os@%$host_os%g s%@target_host_type@%$target_host_type%g s%@use_dld@%$use_dld%g s%@lite_kernel@%$lite_kernel%g s%@bindir@%$bindir%g s%@datadir@%$datadir%g s%@libdir@%$libdir%g s%@includedir@%$includedir%g s%@mandir@%$mandir%g s%@infodir@%$infodir%g s%@fcnfiledir@%$fcnfiledir%g s%@localfcnfiledir@%$localfcnfiledir%g s%@localfcnfilepath@%$localfcnfilepath%g s%@archlibdir@%$archlibdir%g s%@octfiledir@%$octfiledir%g s%@localoctfiledir@%$localoctfiledir%g s%@localoctfilepath@%$localoctfilepath%g s%@fcnfilepath@%$fcnfilepath%g s%@imagedir@%$imagedir%g s%@imagepath@%$imagepath%g s%@DLD_DIR@%$DLD_DIR%g s%@LIBDLD@%$LIBDLD%g s%@LIBOCTDLD@%$LIBOCTDLD%g s%@LD_STATIC_FLAG@%$LD_STATIC_FLAG%g s%@CXX@%$CXX%g s%@CXXCPP@%$CXXCPP%g s%@HOST_CXXFLAGS@%$HOST_CXXFLAGS%g s%@NO_IMPLICIT_TEMPLATES@%$NO_IMPLICIT_TEMPLATES%g s%@CXXLIBS@%$CXXLIBS%g s%@CC@%$CC%g s%@CPP@%$CPP%g s%@GCC_IEEE_FP_FLAG@%$GCC_IEEE_FP_FLAG%g s%@ALLOCA@%$ALLOCA%g s%@F77@%$F77%g s%@F2C@%$F2C%g s%@FFLAGS@%$FFLAGS%g s%@FLIBS@%$FLIBS%g s%@F2CFLAGS@%$F2CFLAGS%g s%@DOT_C_FROM_DOT_F_CMD@%$DOT_C_FROM_DOT_F_CMD%g s%@DOT_O_FROM_DOT_F_PAT@%$DOT_O_FROM_DOT_F_PAT%g s%@FLIB_LIST@%$FLIB_LIST%g s%@FLIB_PATH@%$FLIB_PATH%g s%@CXXLIB_LIST@%$CXXLIB_LIST%g s%@CXXLIB_PATH@%$CXXLIB_PATH%g s%@LIBOBJS@%$LIBOBJS%g s%@TERMLIBS@%$TERMLIBS%g s%@VOID_SIGHANDLER@%$VOID_SIGHANDLER%g s%@LEX@%$LEX%g s%@LEXLIB@%$LEXLIB%g s%@LFLAGS@%$LFLAGS%g s%@YACC@%$YACC%g s%@RANLIB@%$RANLIB%g s%@RUNTEST@%$RUNTEST%g s%@EXPECT@%$EXPECT%g s%@INSTALL_PROGRAM@%$INSTALL_PROGRAM%g s%@INSTALL_DATA@%$INSTALL_DATA%g s%@GNUPLOT_BINARY@%$GNUPLOT_BINARY%g s%@DEFAULT_PAGER@%$DEFAULT_PAGER%g s%@UGLY_DEFS@%$UGLY_DEFS%g CEOF EOF cat >> $CONFIG_STATUS <> $CONFIG_STATUS <<\EOF for ac_file in .. $CONFIG_FILES; do if test "x$ac_file" != x..; then # Support "outfile[:infile]", defaulting infile="outfile.in". case "$ac_file" in *:*) ac_file_in=`echo "$ac_file"|sed 's%.*:%%'` ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;; *) ac_file_in="${ac_file}.in" ;; esac # Adjust relative srcdir, etc. for subdirectories. # Remove last slash and all that follows it. Not all systems have dirname. ac_dir=`echo $ac_file|sed 's%/[^/][^/]*$%%'` if test "$ac_dir" != "$ac_file" && test "$ac_dir" != .; then # The file is in a subdirectory. test ! -d "$ac_dir" && mkdir "$ac_dir" ac_dir_suffix="/$ac_dir" # A "../" for each directory in $ac_dir_suffix. ac_dots=`echo $ac_dir_suffix|sed 's%/[^/]*%../%g'` else ac_dir_suffix= ac_dots= fi case "$ac_given_srcdir" in .) srcdir=. if test -z "$ac_dots"; then top_srcdir=. else top_srcdir=`echo $ac_dots|sed 's%/$%%'`; fi ;; /*) srcdir="$ac_given_srcdir$ac_dir_suffix"; top_srcdir="$ac_given_srcdir" ;; *) # Relative path. srcdir="$ac_dots$ac_given_srcdir$ac_dir_suffix" top_srcdir="$ac_dots$ac_given_srcdir" ;; esac case "$ac_given_INSTALL" in [/$]*) INSTALL="$ac_given_INSTALL" ;; *) INSTALL="$ac_dots$ac_given_INSTALL" ;; esac echo creating "$ac_file" rm -f "$ac_file" configure_input="Generated automatically from `echo $ac_file_in|sed 's%.*/%%'` by configure." case "$ac_file" in *Makefile*) ac_comsub="1i\\ # $configure_input" ;; *) ac_comsub= ;; esac sed -e "$ac_comsub s%@configure_input@%$configure_input%g s%@srcdir@%$srcdir%g s%@top_srcdir@%$top_srcdir%g s%@INSTALL@%$INSTALL%g " -f conftest.subs $ac_given_srcdir/$ac_file_in > $ac_file fi; done rm -f conftest.subs # These sed commands are passed to sed as "A NAME B NAME C VALUE D", where # NAME is the cpp macro being defined and VALUE is the value it is being given. # # ac_d sets the value in "#define NAME VALUE" lines. ac_dA='s%^\([ ]*\)#\([ ]*define[ ][ ]*\)' ac_dB='\([ ][ ]*\)[^ ]*%\1#\2' ac_dC='\3' ac_dD='%g' # ac_u turns "#undef NAME" with trailing blanks into "#define NAME VALUE". ac_uA='s%^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_uB='\([ ]\)%\1#\2define\3' ac_uC=' ' ac_uD='\4%g' # ac_e turns "#undef NAME" without trailing blanks into "#define NAME VALUE". ac_eA='s%^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' ac_eB='$%\1#\2define\3' ac_eC=' ' ac_eD='%g' CONFIG_HEADERS=${CONFIG_HEADERS-"config.h kpathsea/c-auto.h"} for ac_file in .. $CONFIG_HEADERS; do if test "x$ac_file" != x..; then # Support "outfile[:infile]", defaulting infile="outfile.in". case "$ac_file" in *:*) ac_file_in=`echo "$ac_file"|sed 's%.*:%%'` ac_file=`echo "$ac_file"|sed 's%:.*%%'` ;; *) ac_file_in="${ac_file}.in" ;; esac echo creating $ac_file rm -f conftest.frag conftest.in conftest.out cp $ac_given_srcdir/$ac_file_in conftest.in EOF # Transform confdefs.h into a sed script conftest.vals that substitutes # the proper values into config.h.in to produce config.h. And first: # Protect against being on the right side of a sed subst in config.status. # Protect against being in an unquoted here document in config.status. rm -f conftest.vals cat > conftest.hdr <<\EOF s/[\\&%]/\\&/g s%[\\$`]%\\&%g s%#define \([A-Za-z_][A-Za-z0-9_]*\) \(.*\)%${ac_dA}\1${ac_dB}\1${ac_dC}\2${ac_dD}%gp s%ac_d%ac_u%gp s%ac_u%ac_e%gp EOF sed -n -f conftest.hdr confdefs.h > conftest.vals rm -f conftest.hdr # This sed command replaces #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. cat >> conftest.vals <<\EOF s%^[ ]*#[ ]*undef[ ][ ]*[a-zA-Z_][a-zA-Z_0-9]*%/* & */% EOF # Break up conftest.vals because some shells have a limit on # the size of here documents, and old seds have small limits too. # Maximum number of lines to put in a single here document. ac_max_here_lines=12 rm -f conftest.tail while : do ac_lines=`grep -c . conftest.vals` # grep -c gives empty output for an empty file on some AIX systems. if test -z "$ac_lines" || test "$ac_lines" -eq 0; then break; fi # Write a limited-size here document to conftest.frag. echo ' cat > conftest.frag <> $CONFIG_STATUS sed ${ac_max_here_lines}q conftest.vals >> $CONFIG_STATUS echo 'CEOF sed -f conftest.frag conftest.in > conftest.out rm -f conftest.in mv conftest.out conftest.in ' >> $CONFIG_STATUS sed 1,${ac_max_here_lines}d conftest.vals > conftest.tail rm -f conftest.vals mv conftest.tail conftest.vals done rm -f conftest.vals cat >> $CONFIG_STATUS <<\EOF rm -f conftest.frag conftest.h echo "/* $ac_file. Generated automatically by configure. */" > conftest.h cat conftest.in >> conftest.h rm -f conftest.in if cmp -s $ac_file conftest.h 2>/dev/null; then echo "$ac_file is unchanged" rm -f conftest.h else rm -f $ac_file mv conftest.h $ac_file fi fi; done exit 0 EOF chmod +x $CONFIG_STATUS rm -fr confdefs* $ac_clean_files test "$no_create" = yes || ${CONFIG_SHELL-/bin/sh} $CONFIG_STATUS octave-1.1.0/configure.in100666 415 17 54051 5703565647 13516 0ustar jweusersdnl configure.in dnl dnl Process this file with autoconf to produce a configure script. dnl Requires GNU autoconf 1.8 or later. dnl dnl Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton ### ### This file is part of Octave. ### ### Octave 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, or (at your option) any ### later version. ### ### Octave 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 Octave; see the file COPYING. If not, write to the Free ### Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. AC_REVISION($Revision: 1.85 $) AC_PREREQ(2.0) AC_INIT(src/octave.cc) AC_CONFIG_HEADER(config.h kpathsea/c-auto.h) AC_DEFINE(OCTAVE_SOURCE, 1) AC_CANONICAL_HOST if test -z "$host"; then host=unknown fi target_host_type=$host canonical_host_type=$host if test "$host" = unknown; then AC_MSG_WARN([configuring Octave for unknown system type ]) fi AC_SUBST(target_host_type) ### Allow the user to force us to use f2c. AC_ARG_WITH(f2c, [ --with-f2c use f2c even if Fortran compiler is available], use_f2c=true, use_f2c=false) ### Allow the user to experiment with dynamic linking using GNU dld. AC_ARG_ENABLE(dld, [ --enable-dld use DLD for dynamic linking (not all systems)], use_dld=true, use_dld=false) AC_SUBST(use_dld) ### Allow compilation of smaller kernel. This only works if some form ### of dynamic linking is also supported and used. AC_ARG_ENABLE(lite-kernel, [ --enable-lite-kernel compile smaller kernel (requires DLD)], lite_kernel=true, lite_kernel=false) if $lite_kernel; then AC_DEFINE(OCTAVE_LITE, 1) fi AC_SUBST(lite_kernel) ### some defaults AC_PREFIX_DEFAULT(/usr/local) exec_prefix='$(prefix)' bindir='$(exec_prefix)/bin' datadir='$(prefix)/lib' libdir='$(exec_prefix)/lib' includedir='$(prefix)/include/octave' mandir='$(prefix)/man/man1' infodir='$(prefix)/info' fcnfiledir='$(datadir)/octave/$(version)/m' localfcnfiledir='$(datadir)/octave/site/m' localfcnfilepath='$(localfcnfiledir)//' archlibdir='$(libdir)/octave/$(version)/exec/$(target_host_type)' octfiledir='$(libdir)/octave/$(version)/oct/$(target_host_type)' localoctfiledir='$(datadir)/octave/site/oct/$(target_host_type)' localoctfilepath='$(localoctfiledir)//' fcnfilepath='.:$(localoctfilepath):$(localfcnfilepath):$(octfiledir)//:$(fcnfiledir)//' imagedir='$(datadir)/octave/$(version)/imagelib' imagepath='.:$(imagedir)//' AC_MSG_RESULT([defining prefix to be $prefix]) AC_MSG_RESULT([defining exec_prefix to be $exec_prefix]) AC_MSG_RESULT([defining bindir to be $bindir]) AC_MSG_RESULT([defining datadir to be $datadir]) AC_MSG_RESULT([defining libdir to be $libdir]) AC_MSG_RESULT([defining includedir to be $includedir]) AC_MSG_RESULT([defining mandir to be $mandir]) AC_MSG_RESULT([defining infodir to be $infodir]) AC_MSG_RESULT([defining fcnfiledir to be $fcnfiledir]) AC_MSG_RESULT([defining localfcnfiledir to be $localfcnfiledir]) AC_MSG_RESULT([defining localfcnfilepath to be $localfcnfilepath]) AC_MSG_RESULT([defining archlibdir to be $archlibdir]) AC_MSG_RESULT([defining octfiledir to be $octfiledir]) AC_MSG_RESULT([defining localoctfiledir to be $localoctfiledir]) AC_MSG_RESULT([defining localoctfilepath to be $localoctfilepath]) AC_MSG_RESULT([defining fcnfilepath to be $fcnfilepath]) AC_MSG_RESULT([defining imagedir to be $imagedir]) AC_MSG_RESULT([defining imagepath to be $imagepath]) AC_SUBST(exec_prefix) AC_SUBST(bindir) AC_SUBST(datadir) AC_SUBST(libdir) AC_SUBST(includedir) AC_SUBST(mandir) AC_SUBST(infodir) AC_SUBST(fcnfiledir) AC_SUBST(localfcnfiledir) AC_SUBST(localfcnfilepath) AC_SUBST(archlibdir) AC_SUBST(octfiledir) AC_SUBST(localoctfiledir) AC_SUBST(localoctfilepath) AC_SUBST(fcnfilepath) AC_SUBST(imagedir) AC_SUBST(imagepath) ### Do special stuff if using dld. DLD_DIR= LIBDLD= LIBOCTDLD='liboctdld.a' LD_STATIC_FLAG= if $use_dld; then DLD_DIR=dld LIBDLD='../dld/libdld.a' # don't link them in only if doing dynamic linking and small kernel # requested. if $lite_kernel; then LIBOCTDLD= fi LD_STATIC_FLAG=-static AC_DEFINE(WITH_DLD, 1) fi ### Also use -static if compiling on Alpha OSF/1 1.3 systems. case "$canonical_host_type" in alpha-dec-osf1.3) LD_STATIC_FLAG=-static ;; esac if test -n "$DLD_DIR"; then AC_MSG_RESULT([defining DLD_DIR to be $DLD_DIR]) fi if test -n "$LIBDLD"; then AC_MSG_RESULT([defining LIBDLD to be $LIBDLD]) fi if test -n "$LIBOCTDLD"; then AC_MSG_RESULT([defining LIBOCTDLD to be $LIBOCTDLD]) fi if test -n "$LD_STATIC_FLAG"; then AC_MSG_RESULT([defining LD_STATIC_FLAG to be $LD_STATIC_FLAG]) fi AC_SUBST(DLD_DIR) AC_SUBST(LIBDLD) AC_SUBST(LIBOCTDLD) AC_SUBST(LD_STATIC_FLAG) ### See if the optional nonlinear programming code is present. AC_MSG_CHECKING([for npsol]) if test -f $srcdir/libcruft/npsol/npsol.f; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) AC_DEFINE(NPSOL_MISSING, 1) fi AC_MSG_CHECKING([for qpsol]) if test -f $srcdir/libcruft/qpsol/qpsol.f; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) AC_DEFINE(QPSOL_MISSING, 1) fi AC_MSG_CHECKING([for fsqp]) if test -f $srcdir/libcruft/fsqp/fsqpd.f; then AC_MSG_RESULT([yes]) else AC_MSG_RESULT([no]) AC_DEFINE(FSQP_MISSING, 1) fi ### See which C++ compiler to use (we expect to find g++). AC_PROG_CXX AC_PROG_CXXCPP ### Do special things for g++. ADD_CXX_WALL=false NO_IMPLICIT_TEMPLATES= gxx_version=`$CXX -v 2>&1 | grep "^g.. version" | sed 's/^g.. version *//'` case "$gxx_version" in changequote(,)dnl 2.[6789].*|2.[123456789][0123456789].*) changequote([,])dnl CXXFLAGS="-g -O" AC_MSG_RESULT([defining CXXFLAGS to be $CXXFLAGS]) NO_IMPLICIT_TEMPLATES="-fno-implicit-templates" AC_MSG_RESULT([defining NO_IMPLICIT_TEMPLATES to be $NO_IMPLICIT_TEMPLATES]) ADD_CXX_WALL=true ;; changequote(,)dnl 1.*|2.[012345].*) changequote([,])dnl AC_MSG_WARN([g++ version $gxx_version will not work to compile Octave]) ;; *) AC_MSG_WARN([Octave has only been tested with g++, and I can't find it]) ;; esac HOST_CXXFLAGS= case "$gxx_version" in 2.6.*) case "$canonical_host_type" in rs6000-ibm-aix*) HOST_CXXFLAGS="-Wa,-u" AC_MSG_RESULT([defining HOST_CXXFLAGS to be $HOST_CXXFLAGS]) ;; esac ;; esac AC_SUBST(HOST_CXXFLAGS) ### See what libraries are used by the C++ compiler. Need this for ### dynamic linking. CXXLIBS=`sh $srcdir/cxxlibs.sh` AC_MSG_RESULT([defining CXXLIBS to be $CXXLIBS]) AC_SUBST(CXXFLAGS) AC_SUBST(NO_IMPLICIT_TEMPLATES) AC_SUBST(CXXLIBS) ### See which C compiler to use (we expect to find gcc). AC_PROG_CC AC_PROG_CPP AC_PROG_GCC_TRADITIONAL ### Do special things for gcc. ADD_CC_WALL=false gcc_version=`$CC -v 2>&1 | grep "^gcc version" | sed 's/^gcc version *//'` case "$gcc_version" in 2.*) CFLAGS="-g -O" AC_MSG_RESULT([defining CFLAGS to be $CFLAGS]) LDFLAGS="-g" AC_MSG_RESULT([defining LDFLAGS to be $LDFLAGS]) ADD_CC_WALL=true ;; 1.*) AC_MSG_WARN([gcc version $gcc_version is likely to cause problems]) ;; *) AC_MSG_WARN([Octave has only been tested with gcc, and I can't find it]) ;; esac AC_SUBST(CFLAGS) AC_SUBST(LDFLAGS) ### On Linux systems we need to compile with -mieee-fp to get full ### support for IEEE floating point. case "$canonical_host_type" in i386-*-linux | i486-*-linux | i586-*-linux) GCC_IEEE_FP_FLAG="-mieee-fp" AC_MSG_RESULT([defining GCC_IEEE_FP_FLAG to be $GCC_IEEE_FP_FLAG]) ;; esac AC_SUBST(GCC_IEEE_FP_FLAG) ### Special checks for odd OS specific things. AC_ISC_POSIX AC_MINIX AC_AIX AC_FUNC_STRFTIME AC_CHECK_LIB(sun, getpwnam) ### How big are ints and how are they oriented? These could probably ### be eliminated in favor of run-time checks. AC_CHECK_SIZEOF(short) AC_CHECK_SIZEOF(int) AC_CHECK_SIZEOF(long) AC_C_BIGENDIAN ### Try to determine the floating point format. This could probably ### be eliminated in favor of run-time checks. AC_MSG_CHECKING([floating point format]) changequote(,)dnl XCFLAGS=`echo $CFLAGS | sed 's/-O[^ \t]*//'` changequote([,])dnl ${CC-cc} -DDP $XCFLAGS $LDFLAGS $srcdir/float-type.c -o conftest >/dev/null 2>&1 FLOAT_FORMAT=`./conftest` case "$FLOAT_FORMAT" in IEEE_BIG_ENDIAN) AC_MSG_RESULT([IEEE big endian]) AC_DEFINE(IEEE_BIG_ENDIAN, 1) ;; IEEE_LITTLE_ENDIAN) AC_MSG_RESULT([IEEE little endian]) AC_DEFINE(IEEE_LITTLE_ENDIAN, 1) ;; VAX_D_FLOAT) AC_MSG_RESULT([VAX D floating]) AC_DEFINE(VAX_D_FLOAT, 1) ;; VAX_G_FLOAT) AC_MSG_RESULT([VAX G floating]) AC_DEFINE(VAX_G_FLOAT, 1) ;; *) AC_MSG_RESULT() AC_MSG_WARN("unrecognized floating point format!") ;; esac ### Does the C compiler handle alloca() and const correctly? AC_ALLOCA ### This one is for kpathsea. ### ### It would be nicer to test for the requisite putenv features directly, ### but can't figure out how to do that. if test "`(uname) 2>/dev/null`" = NetBSD \ || test "`(uname) 2>/dev/null`" = FreeBSD; then AC_DEFINE(SMART_PUTENV) fi AC_C_CONST ### If we haven't been forced to use f2c, try to find a Fortran compiler ### under any one of several common Un*x Fortran compiler names. ### Put fc last to avoid confusion with some vendor's /bin/sh fc ### builtin. ### ### xlf : IBM / AIX ### cf77 : Cray / Unicos ### g77 : GNU Fortran (someday...) ### fc : Convex ### ### I don't think the Cray compiler will ever work like f2c... if $use_f2c; then true else F77= AC_CHECK_PROGS(F77, xlf cf77 f77 g77 fc) # If it looks like we have a Fortran compiler, try to determine # whether it might be compatible with f2c. if test -n "$F77"; then AC_MSG_CHECKING([$F77/f2c compatibility]) export F77 export CC tmpdef=`sh $srcdir/f2c-compat.sh $srcdir/flibs.sh` status=$? if test $status -eq 0; then AC_MSG_RESULT([yes]) if test "$tmpdef" = '-DF77_APPEND_UNDERSCORE=1'; then AC_DEFINE(F77_APPEND_UNDERSCORE, 1) fi else AC_MSG_RESULT([no]) F77= fi fi fi ### If we can't find a Fortran compiler, or if it looks like it isn't ### compatible with f2c, try to find f2c. if test -z "$F77"; then AC_CHECK_PROG(F2C, f2c, f2c, []) fi F2CFLAGS= FFLAGS="-O" AC_MSG_RESULT([defining FFLAGS to be $FFLAGS]) if test -n "$F77"; then export F77 FLIBS=`sh $srcdir/flibs.sh` AC_MSG_RESULT([defining FLIBS to be $FLIBS]) DOT_C_FROM_DOT_F_CMD= DOT_O_FROM_DOT_F_PAT= elif test -n "$F2C" || $use_f2c; then AC_CHECK_LIB(f2c, main, FLIBS=-lf2c, []) if test -z "$FLIBS" ; then AC_CHECK_LIB(F77, main, FLIBS=-lF77, []) if test -n "$FLIBS" ; then AC_CHECK_LIB(I77, main, FLIBS="$FLIBS -lI77", []) fi fi if test -z "$FLIBS" ; then AC_MSG_WARN([I found f2c but not libf2c.a, or libF77.a and libI77.a]) fi DOT_C_FROM_DOT_F_CMD=' cat $< | $(F2C) $(F2CFLAGS) > $(@F)' AC_MSG_RESULT([defining DOT_C_FROM_DOT_F_CMD to be $DOT_C_FROM_DOT_F_CMD]) DOT_O_FROM_DOT_F_PAT='%.o : %.f' AC_MSG_RESULT([defining DOT_O_FROM_DOT_F_PAT to be $DOT_O_FROM_DOT_F_PAT]) AC_DEFINE(F77_APPEND_UNDERSCORE, 1) else AC_MSG_WARN([in order to build octave, you must have a compatible]) AC_MSG_WARN([Fortran compiler or f2c installed and in your path.]) AC_MSG_WARN([See the file INSTALL for more information.]) AC_MSG_WARN([Continuing anyway...]) fi AC_SUBST(F77) AC_SUBST(FFLAGS) AC_SUBST(FLIBS) AC_SUBST(F2C) AC_SUBST(F2CFLAGS) AC_SUBST(DOT_C_FROM_DOT_F_CMD) AC_SUBST(DOT_O_FROM_DOT_F_PAT) ### Extract libraries and directories from FLIBS and CXXLIBS. ### ### Leave only libraries, with -lfoo converted to libfoo.a: changequote(,)dnl FLIB_LIST=`echo " $FLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *[^ ]*/ /g' \ -e 's/ -l *\([^ ]*\)/ lib\1.a/g' -e 's/ -u *[^ ]*/ /g' \ -e 's/^ *//' -e 's/ *$//' -e 's/ */:/g'` CXXLIB_LIST=`echo " $CXXLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *[^ ]*/ /g' \ -e 's/ -l *\([^ ]*\)/ lib\1.a/g' -e 's/ -u *[^ ]*/ /g' \ -e 's/^ *//' -e 's/ *$//' -e 's/ */:/g'` ### Leave only directories where libraries might be found: FLIB_PATH=`echo " $FLIBS " | sed \ -e 's/ / /g' -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *\([^ ]*\)/ \1/g' -e 's, /[^ ]*\.a , ,g' \ -e 's/ -l *[^ ]*/ /g' -e 's/ -u *[^ ]*/ /g' -e 's/^ *//' \ -e 's/ *$//' -e 's/ */:/g'` CXXLIB_PATH=`echo " $CXXLIBS " | sed -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -L *\([^ ]*\)/ \1/g' -e 's, /[^ ]*\.a , ,g' \ -e 's/ / /g' -e 's/ -Xlinker *[^ ]*/ /g' \ -e 's/ -l *[^ ]*/ /g' -e 's/ -u *[^ ]*/ /g' -e 's/^ *//' \ -e 's/ *$//' -e 's/ */:/g'` changequote([,])dnl AC_MSG_RESULT([defining FLIB_LIST to be $FLIB_LIST]) AC_MSG_RESULT([defining FLIB_PATH to be $FLIB_PATH]) AC_MSG_RESULT([defining CXXLIB_LIST to be $CXXLIB_LIST]) AC_MSG_RESULT([defining CXXLIB_PATH to be $CXXLIB_PATH]) AC_SUBST(FLIB_LIST) AC_SUBST(FLIB_PATH) AC_SUBST(CXXLIB_LIST) AC_SUBST(CXXLIB_PATH) ### Checks for header files. AC_HEADER_STDC AC_CHECK_HEADERS(assert.h float.h limits.h memory.h pwd.h stdlib.h) AC_CHECK_HEADERS(string.h varargs.h unistd.h floatingpoint.h) AC_CHECK_HEADERS(sys/utsname.h sys/time.h sys/fcntl.h) AC_CHECK_HEADERS(sys/ttold.h sys/ptem.h sys/select.h sys/resource.h) AC_HEADER_DIRENT AC_TIME_WITH_SYS_TIME ### Use sgtty on Ultrix so that using DEC Migrate to convert a Mips ### binary to an Alpha binary will work. Also on Alpha/OSF to avoid ### a readline bug. case "$canonical_host_type" in mips-dec-ultrix* | alpha-dec-osf*) AC_CHECK_HEADER(sgtty.h, [AC_DEFINE(HAVE_SGTTY_H, 1)], []) if test "$ac_cv_header_sgtty_h" = no; then AC_CHECK_HEADERS(termios.h termio.h sgtty.h, [break], []) fi ;; *) AC_CHECK_HEADERS(termios.h termio.h sgtty.h, [break], []) ;; esac if test "$ac_cv_header_termios_h" = yes \ || test "$ac_cv_header_termio_h" = yes \ || test "$ac_cv_header_sgtty_h" = yes; then true else AC_MSG_ERROR([I couldn't find termios.h, termio.h, or sgtty.h!]) fi ### Checks for functions. AC_CHECK_FUNCS(setvbuf getcwd gethostname bzero bcopy rindex vfprintf vsprintf) AC_CHECK_FUNCS(stricmp strnicmp strcasecmp strncasecmp strerror atexit) AC_CHECK_FUNCS(on_exit tempnam memmove putenv gettimeofday getrusage) dnl Would like to get rid of this cruft, and just have dnl dnl AC_CHECK_FUNCS(finite isnan isinf) dnl dnl instead, but that used to fail on some systems... dnl dnl Also just using AC_CHECK_FUNCS doesn't seem to work to find isinf dnl and isnan on Linux systems, so we use AC_CHECK_FUNC, and if that dnl fails, we try again by including math.h and invoking the function dnl with an argument. ### Check to see if we have IEEE math functions, and if so, which ones. ### ### For Linux: add -mieee-fp flag to CFLAGS when checking for IEEE FP ### functions, otherwise we may not find them. ### ### Also check for some additional trig functions that aren't ANSI but ### are often available. If they are missing, we try to replace them ### with functions from the BSD/NET2 math library. AC_CHECK_LIB(sunmath, main) AC_CHECK_LIB(m, main) XCFLAGS="$CFLAGS" CFLAGS="$CFLAGS $GCC_IEEE_FP_FLAG" ### Inf and NaN don't work with gcc on the Alpha yet. case "$canonical_host_type" in alpha-dec-osf*) ;; *) AC_CHECK_FUNCS(finite isnan isinf infinity quiet_nan) ;; esac AC_CHECK_FUNCS(erf erfc lgamma) AC_MSG_CHECKING([for signgam declaration in math.h]) AC_TRY_LINK([#include ], [int foo = signgam + 1;], AC_MSG_RESULT(yes) AC_DEFINE(SIGNGAM_DECLARED, 1), AC_MSG_RESULT(no)) CFLAGS="$XCFLAGS" ### Check for nonstandard but common trig functions that we need. ### If they are missing, we replace them using functions from the BSD ### math library, and we may need to replace some other functions too. AC_REPLACE_FUNCS(acosh asinh atanh) if test -n "$LIBOBJS"; then for func in $LIBOBJS do case "$func" in *acosh.o*) AC_DEFINE(ACOSH_MISSING, 1) ;; *asinh.o*) AC_DEFINE(ASINH_MISSING, 1) ;; *atanh.o*) AC_DEFINE(ATANH_MISSING, 1) ;; esac done case $LIBOBJS in *acosh.o* | *asinh.o*) AC_REPLACE_FUNCS(copysign) ;; esac case $LIBOBJS in *acosh.o* | *asinh.o* | *atanh.o*) AC_REPLACE_FUNCS(log1p) ;; esac case $LIBOBJS in *log1p*) AC_REPLACE_FUNCS(log__L) ;; esac case $LIBOBJS in *log1p*) AC_REPLACE_FUNCS(finite) ;; esac case $LIBOBJS in *copysign* | *finite* | *log1p*) AC_REPLACE_FUNCS(logb scalb) ;; esac fi ### Checks for OS specific cruft. AC_STRUCT_TM AC_FUNC_SETVBUF_REVERSED TERMLIBS="" for termlib in termcap terminfo curses termlib ; do AC_CHECK_LIB(${termlib}, main, [TERMLIBS="${TERMLIBS} -l${termlib}"]) case "${TERMLIBS}" in *-l${termlib}*) AC_MSG_RESULT([defining TERMLIBS to be $TERMLIBS]) break ;; esac done AC_MSG_CHECKING([for struct exception in math.h]) AC_TRY_LINK([#include ], [struct exception *x; x->type; x->name;], AC_MSG_RESULT(yes) AC_DEFINE(EXCEPTION_IN_MATH, 1), AC_MSG_RESULT(no)) AC_SUBST(TERMLIBS) ### Signal stuff. AC_TYPE_SIGNAL AC_DECL_SYS_SIGLIST AC_MSG_CHECKING([for sys_siglist variable]) AC_TRY_LINK([#include ], [extern char *sys_siglist[]; printf ("%s\n", sys_siglist[1]);], AC_MSG_RESULT(yes) AC_DEFINE(HAVE_SYS_SIGLIST, 1), AC_MSG_RESULT(no)) ### Define VOID_SIGHANDLER for readline. case "$RETSIGTYPE" in int) ;; *) VOID_SIGHANDLER="-DVOID_SIGHANDLER=1" AC_MSG_RESULT([defining VOID_SIGHANDLER to be 1]) ;; esac AC_SUBST(VOID_SIGHANDLER) ### Checks for other programs used for building, testing, installing, ### and running Octave. ### ### For now, don't define LEXLIB to be -lfl -- we don't use anything in ### it, and it might not be installed. ### ### Also make sure that we generate an interactive scanner if we are ### using flex. AC_PROG_LEX case "$LEX" in flex*) LFLAGS="-t -I" AC_MSG_RESULT([defining LFLAGS to be $LFLAGS]) LEXLIB= ;; *) LFLAGS="-t" AC_MSG_RESULT([defining LFLAGS to be $LFLAGS]) AC_MSG_WARN([I didn't find flex, but that's only a problem]) AC_MSG_WARN([if you need to reconstruct lex.cc]) ;; esac AC_SUBST(LFLAGS) AC_PROG_YACC case "$YACC" in bison*) ;; *) AC_MSG_WARN([I didn't find bison, but that's only a problem]) AC_MSG_WARN([if you need to reconstruct parse.cc]) ;; esac AC_PROG_RANLIB AC_CHECK_PROG(RUNTEST, runtest, runtest, []) AC_CHECK_PROG(EXPECT, expect, expect, []) if test -z "$EXPECT" ; then RUNTEST= fi AC_SUBST(RUNTEST) AC_PROG_INSTALL AC_CHECK_PROG(GNUPLOT_BINARY, gnuplot, gnuplot, []) if test -z "$GNUPLOT_BINARY"; then AC_MSG_WARN([I didn't find gnuplot. It isn't necessary to have gnuplot]) AC_MSG_WARN([installed, but you won't be able to use any of Octave's]) AC_MSG_WARN([plotting commands without it.]) AC_MSG_WARN([]) AC_MSG_WARN([If gnuplot is installed but it isn't in your path, you can]) AC_MSG_WARN([tell Octave where to find it by typing the command]) AC_MSG_WARN([]) AC_MSG_WARN([gnuplot_binary = "/full/path/to/gnuplot/binary"]) AC_MSG_WARN([]) AC_MSG_WARN([at the Octave prompt.]) fi AC_CHECK_PROGS(DEFAULT_PAGER, less more page pg, []) if test -z "$DEFAULT_PAGER"; then AC_MSG_WARN([I couldn't find `less', `more', `page', or `pg']) elif test "$DEFAULT_PAGER" = less; then DEFAULT_PAGER="less -e" AC_MSG_RESULT([defining DEFAULT_PAGER to be $DEFAULT_PAGER]) fi ### Even though we include config.h in most files, some need to be ### compiled with the -D options on the compiler command line. Use ### UGLY_DEFS for that. AC_OUTPUT_MAKE_DEFS UGLY_DEFS="$DEFS" AC_MSG_RESULT([defining UGLY_DEFS to be $UGLY_DEFS]) AC_SUBST(UGLY_DEFS) ### Maybe add -Wall to compiler flags now that we're done feature ### testing. ### ### To get gcc and g++ to be really picky, try these adding these ### options to CFLAGS and CXXFLAGS along with -Wall: ### ### -ansi ### -pedantic ### -Wwrite-strings ### -Wid-clash-31 ### -Wpointer-arith ### -Wcast-qual ### -Wenum-clash ### -Wcast-align ### -Wtraditional ### -Wstrict-prototypes ### -Wmissing-prototypes ### -Wnested-externs ### -Woverloaded-virtual ### -Winline ### -felide-constructors ### -fnonnull-objects if $ADD_CXX_WALL; then CXXFLAGS="$CXXFLAGS -Wall" AC_MSG_RESULT([adding -Wall to CXXFLAGS]) fi if $ADD_CC_WALL; then CFLAGS="$CFLAGS -Wall" AC_MSG_RESULT([adding -Wall to CFLAGS]) fi ### Do the substitutions in all the Makefiles. define([tmpA], [Makefile octMakefile Makeconf])dnl define([tmpB], [libcruft/Makefile libcruft/Makerules])dnl define([tmpC], [liboctave/Makefile src/Makefile dld/Makefile])dnl define([tmpD], [info/Makefile readline/Makefile readline/doc/Makefile])dnl define([tmpE], [readline/examples/Makefile doc/Makefile])dnl define([tmpF], [test/Makefile kpathsea/Makefile])dnl define([srcdirs], [tmpA tmpB tmpC tmpD tmpE tmpF])dnl define([tmpa], [libcruft/blas/Makefile libcruft/balgen/Makefile])dnl define([tmpb], [libcruft/dassl/Makefile libcruft/eispack/Makefile])dnl define([tmpc], [libcruft/fftpack/Makefile libcruft/fsqp/Makefile])dnl define([tmpd], [libcruft/lapack/Makefile libcruft/linpack/Makefile])dnl define([tmpe], [libcruft/minpack/Makefile libcruft/misc/Makefile])dnl define([tmpf], [libcruft/npsol/Makefile libcruft/odepack/Makefile])dnl define([tmpg], [libcruft/qpsol/Makefile libcruft/quadpack/Makefile])dnl define([tmph], [libcruft/ranlib/Makefile libcruft/villad/Makefile])dnl define([cruftdirs], [tmpa tmpb tmpc tmpd tmpe tmpf tmpg tmph])dnl define([tmpSA], [scripts/Makefile scripts/control/Makefile])dnl define([tmpSB], [scripts/general/Makefile scripts/image/Makefile]) define([tmpSC], [scripts/linear-algebra/Makefile])dnl define([tmpSD], [scripts/miscellaneous/Makefile scripts/plot/Makefile])dnl define([tmpSE], [scripts/polynomial/Makefile scripts/set/Makefile])dnl define([tmpSF], [scripts/signal/Makefile scripts/special-matrix/Makefile])dnl define([tmpSG], [scripts/startup/Makefile scripts/statistics/Makefile])dnl define([tmpSH], [scripts/elfun/Makefile scripts/specfun/Makefile])dnl define([tmpSI], [scripts/strings/Makefile])dnl define([mdirs], [tmpSA tmpSB tmpSC tmpSD tmpSE tmpSF tmpSG tmpSH tmpSI])dnl AC_OUTPUT([srcdirs cruftdirs mdirs]) octave-1.1.0/config.guess100777 415 17 30437 5651235444 13516 0ustar jweusers#!/bin/sh # This script attempts to guess a canonical system name. # Copyright (C) 1992, 1993, 1994 Free Software Foundation, Inc. # # 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 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ # Written by Per Bothner . # The master version of this file is at the FSF in /home/gd/gnu/lib. # # This script attempts to guess a canonical system name similar to # config.sub. If it succeeds, it prints the system name on stdout, and # exits with 0. Otherwise, it exits with 1. # # The plan is that this can be called by configure scripts if you # don't specify an explicit system type (host/target name). # # Only a few systems have been added to this list; please add others # (but try to keep the structure clean). # # This is needed to find uname on a Pyramid OSx when run in the BSD universe. # (ghazi@noc.rutgers.edu 8/24/94.) 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 trap 'rm -f dummy.c dummy.o dummy; exit 1' 1 2 15 # Note: order is significant - the case branches are not exclusive. case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in alpha:OSF1:V*:*) # After 1.2, OSF1 uses "V1.3" for uname -r. echo alpha-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^V//'` exit 0 ;; alpha:OSF1:*:*) # 1.2 uses "1.2" for uname -r. echo alpha-dec-osf${UNAME_RELEASE} exit 0 ;; arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) echo arm-acorn-riscix${UNAME_RELEASE} exit 0;; Pyramid*:OSx*:*:*) if test "`(/bin/universe) 2>/dev/null`" = att ; then echo pyramid-pyramid-sysv3 else echo pyramid-pyramid-bsd fi exit 0 ;; sun4*:SunOS:5.*:*) echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` exit 0 ;; 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 0 ;; sun4*:SunOS:*:*) # Japanese Language versions have a version number like `4.1.3-JL'. echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` exit 0 ;; sun3*:SunOS:*:*) echo m68k-sun-sunos${UNAME_RELEASE} exit 0 ;; RISC*:ULTRIX:*:*) echo mips-dec-ultrix${UNAME_RELEASE} exit 0 ;; VAX*:ULTRIX*:*:*) echo vax-dec-ultrix${UNAME_RELEASE} exit 0 ;; mips:*:5*:RISCos) echo mips-mips-riscos${UNAME_RELEASE} exit 0 ;; m88k:CX/UX:7*:*) echo m88k-harris-cxux7 exit 0 ;; m88k:*:4*:R4*) echo m88k-motorola-sysv4 exit 0 ;; m88k:*:3*:R3*) echo m88k-motorola-sysv3 exit 0 ;; AViiON:dgux:*:*) if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx \ -o ${TARGET_BINARY_INTERFACE}x = x ] ; then echo m88k-dg-dgux${UNAME_RELEASE} else echo m88k-dg-dguxbcs${UNAME_RELEASE} fi exit 0 ;; M88*:DolphinOS:*:*) # DolphinOS (SVR3) echo m88k-dolphin-sysv3 exit 0 ;; M88*:*:R3*:*) # Delta 88k system running SVR3 echo m88k-motorola-sysv3 exit 0 ;; XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) echo m88k-tektronix-sysv3 exit 0 ;; Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) echo m68k-tektronix-bsd exit 0 ;; *:IRIX:*:*) echo mips-sgi-irix${UNAME_RELEASE} exit 0 ;; i[34]86:AIX:*:*) echo i386-ibm-aix exit 0 ;; *:AIX:2:3) if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then sed 's/^ //' << EOF >dummy.c #include main() { if (!__power_pc()) exit(1); puts("powerpc-ibm-aix3.2.5"); exit(0); } EOF ${CC-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo rs6000-ibm-aix3.2.5 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 0 ;; *:AIX:1:4) if /usr/sbin/lsattr -EHl proc0 | grep POWER >/dev/null 2>&1; then echo rs6000-ibm-aix4.1 else echo powerpc-ibm-aix4.1 fi exit 0 ;; *:AIX:*:*) echo rs6000-ibm-aix exit 0 ;; *:BOSX:*:*) echo rs6000-bull-bosx exit 0 ;; DPX/2?00:B.O.S.:*:*) echo m68k-bull-sysv3 exit 0 ;; 9000/[34]??:4.3bsd:1.*:*) echo m68k-hp-bsd exit 0 ;; hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) echo m68k-hp-bsd4.4 exit 0 ;; 9000/[3478]??:HP-UX:*:*) case "${UNAME_MACHINE}" in 9000/31? ) HP_ARCH=m68000 ;; 9000/[34]?? ) HP_ARCH=m68k ;; 9000/7?? | 9000/8?7 ) HP_ARCH=hppa1.1 ;; 9000/8?? ) HP_ARCH=hppa1.0 ;; esac HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` echo ${HP_ARCH}-hp-hpux${HPUX_REV} exit 0 ;; 3050*:HI-UX:*:*) sed 's/^ //' << EOF >dummy.c #include 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-cc} dummy.c -o dummy && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy echo unknown-hitachi-hiuxwe2 exit 0 ;; 9000/7??:4.3bsd:*:* | 9000/8?7:4.3bsd:*:* ) echo hppa1.1-hp-bsd exit 0 ;; 9000/8??:4.3bsd:*:*) echo hppa1.0-hp-bsd exit 0 ;; hp7??:OSF1:*:* | hp8?7:OSF1:*:* ) echo hppa1.1-hp-osf exit 0 ;; hp8??:OSF1:*:*) echo hppa1.0-hp-osf exit 0 ;; C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) echo c1-convex-bsd exit 0 ;; C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) echo c34-convex-bsd exit 0 ;; C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) echo c38-convex-bsd exit 0 ;; C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) echo c4-convex-bsd exit 0 ;; CRAY*X-MP:UNICOS:*:*) echo xmp-cray-unicos exit 0 ;; CRAY*Y-MP:UNICOS:*:*) echo ymp-cray-unicos exit 0 ;; CRAY-2:UNICOS:*:*) echo cray2-cray-unicos exit 0 ;; hp3[0-9][05]:NetBSD:*:*) echo m68k-hp-netbsd${UNAME_RELEASE} exit 0 ;; i[34]86:BSD/386:*:*) echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} exit 0 ;; *:FreeBSD:*:*) echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/(.*//'` exit 0 ;; *:NetBSD:*:*) echo ${UNAME_MACHINE}-unknown-netbsd`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` exit 0 ;; *:GNU:*:*) echo `echo ${UNAME_MACHINE}|sed -e 's,/.*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` exit 0 ;; *:Linux:*:*) echo ${UNAME_MACHINE}-unknown-linux exit 0 ;; # 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. i[34]86:DYNIX/ptx:4*:*) echo i386-sequent-sysv4 exit 0 ;; i[34]86:*:4.*:* | i[34]86:SYSTEM_V:4.*:*) if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then echo ${UNAME_MACHINE}-univel-sysv${UNAME_RELEASE} else echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE} fi exit 0 ;; i[34]86:*:3.2:*) if /bin/uname -X 2>/dev/null >/dev/null ; then UNAME_REL=`(/bin/uname -X|egrep Release|sed -e 's/.*= //')` (/bin/uname -X|egrep i80486 >/dev/null) && UNAME_MACHINE=i486 echo ${UNAME_MACHINE}-unknown-sco$UNAME_REL elif test -f /usr/options/cb.name; then UNAME_REL=`sed -n 's/.*Version //p' /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 0 ;; mini*:CTIX:SYS*5:*) # "miniframe" echo m68010-convergent-sysv exit 0 ;; M680[234]0:*:R3V[567]*:*) test -r /sysV68 && echo 'm68k-motorola-sysv' && exit 0 ;; 3[34]??:*:4.0:*) uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4 && exit 0 ;; 33[56]0,3???:*:4.0:*) uname -p 2>/dev/null | grep 86 >/dev/null \ && echo i486-ncr-sysv4.3 && exit 0 ;; m680[234]0:LynxOS:2.2*:*) echo m68k-lynx-lynxos${UNAME_RELEASE} exit 0 ;; mc68030:UNIX_System_V:4.*:*) echo m68k-atari-sysv4 exit 0 ;; i[34]86:LynxOS:2.2*:*) echo i386-lynx-lynxos${UNAME_RELEASE} exit 0 ;; TSUNAMI:LynxOS:2.2*:*) echo sparc-lynx-lynxos${UNAME_RELEASE} exit 0 ;; rs6000:LynxOS:2.2*:*) echo rs6000-lynx-lynxos${UNAME_RELEASE} exit 0 ;; RM*:SINIX-*:*:*) echo mips-sni-sysv4 exit 0 ;; *: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 0 ;; esac #echo '(No uname command or uname output not recognized.)' 1>&2 #echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 cat >dummy.c </dev/null`; printf ("%s-next-nextstep%s\n", __ARCHITECTURE__, version==2 ? "2" : "3"); exit (0); #endif #if defined (MULTIMAX) || defined (n16) #if defined (UMAXV) printf ("ns32k-encore-sysv\n"); exit (0); #else #if defined (CMU) printf ("ns32k-encore-mach\n"); exit (0); #else printf ("ns32k-encore-bsd\n"); exit (0); #endif #endif #endif #if defined (__386BSD__) printf ("i386-unknown-bsd\n"); exit (0); #endif #if defined (sequent) #if defined (i386) printf ("i386-sequent-dynix\n"); exit (0); #endif #if defined (ns32000) printf ("ns32k-sequent-dynix\n"); exit (0); #endif #endif #if defined (_SEQUENT_) printf ("i386-sequent-ptx\n"); exit (0); #endif #if defined (vax) #if !defined (ultrix) printf ("vax-dec-bsd\n"); exit (0); #else printf ("vax-dec-ultrix\n"); exit (0); #endif #endif #if defined (alliant) && defined (i860) printf ("i860-alliant-bsd\n"); exit (0); #endif exit (1); } EOF ${CC-cc} dummy.c -o dummy 2>/dev/null && ./dummy && rm dummy.c dummy && exit 0 rm -f dummy.c dummy # Apollos put the system type in the environment. test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit 0; } # Convex versions that predate uname can use getsysinfo(1) if [ -x /usr/convex/getsysinfo ] then case `getsysinfo -f cpu_type` in c1*) echo c1-convex-bsd exit 0 ;; c2*) if getsysinfo -f scalar_acc then echo c32-convex-bsd else echo c2-convex-bsd fi exit 0 ;; c34*) echo c34-convex-bsd exit 0 ;; c38*) echo c38-convex-bsd exit 0 ;; c4*) echo c4-convex-bsd exit 0 ;; esac fi #echo '(Unable to guess system type)' 1>&2 exit 1 octave-1.1.0/config.sub100777 415 17 44765 5516107001 13155 0ustar jweusers#!/bin/sh # Configuration validation subroutine script, version 1.1. # Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. # This file is (in principle) common to ALL GNU software. # The presence of a machine in this file suggests that SOME GNU software # can handle that machine. It does not imply ALL GNU software can. #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 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., 675 Mass Ave, Cambridge, MA 02139, USA. # Configuration subroutine to validate and canonicalize a configuration type. # Supply the specified configuration type as an argument. # If it is invalid, we print an error message on stderr and exit with code 1. # Otherwise, we print the canonical config type on stdout and succeed. # This file is supposed to be the same for all GNU packages # and recognize all the CPU types, system types and aliases # that are meaningful with *any* GNU software. # Each package is responsible for reporting which valid configurations # it does not support. The user should be able to distinguish # a failure to support a valid configuration from a meaningless # configuration. # The goal of this file is to map all the various variations of a given # machine specification into a single specification in the form: # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM # It is wrong to echo any other type of specification. if [ x$1 = x ] then echo Configuration name missing. 1>&2 echo "Usage: $0 CPU-MFR-OPSYS" 1>&2 echo "or $0 ALIAS" 1>&2 echo where ALIAS is a recognized configuration type. 1>&2 exit 1 fi # First pass through any local machine types. case $1 in *local*) echo $1 exit 0 ;; *) ;; esac # Separate what the user gave into CPU-COMPANY and OS (if any). basic_machine=`echo $1 | sed 's/-[^-]*$//'` if [ $basic_machine != $1 ] then os=`echo $1 | sed 's/.*-/-/'` else os=; fi ### Let's recognize common machines as not being operating systems so ### that things like config.sub decstation-3100 work. We also ### recognize some manufacturers as not being operating systems, so we ### can provide default operating systems below. case $os in -sun*os*) # Prevent following clause from handling this invalid input. ;; -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ -unicom* | -ibm* | -next* | -hp | -isi* | -apollo | -altos* | \ -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ -sim) # CYGNUS LOCAL os= basic_machine=$1 ;; -scout) # CYGNUS LOCAL ;; -wrs) # CYGNUS LOCAL os=vxworks basic_machine=$1 ;; -unixware) # CYGNUS LOCAL os=-sysv4 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -hiux*) os==-hiuxwe2 ;; -sco4) os=-sco3.2v4 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco3.2.[4-9]*) os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco3.2v[4-9]*) # Don't forget version if it is 3.2v4 or newer. basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -sco*) os=-sco3.2v2 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -isc) os=-isc2.2 basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -clix*) basic_machine=clipper-intergraph ;; -isc*) basic_machine=`echo $1 | sed -e 's/86-.*/86-unknown/'` ;; -lynx) os=-lynxos ;; esac # Decode aliases for certain CPU-COMPANY combinations. case $basic_machine in # Recognize the basic CPU types without company name. # Some are omitted here because they have special meanings below. tahoe | i[34]86 | i860 | m68k | m68000 | m88k | ns32k | arm | pyramid \ | tron | a29k | 580 | i960 | hppa1.0 | hppa1.1 \ | alpha | we32k | ns16k | clipper | sparclite | i370 \ | powerpc \ | h8300 | h8300h | sh \ | m88110 | sparc | m680[01234]0 | m683?2 | z8k | v70 \ | h8500 | mips64 | mipsel | mips64el) # CYGNUS LOCAL basic_machine=$basic_machine-unknown ;; # Object if more than one company name word. *-*-*) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; # Recognize the basic CPU types with company name. vax-* | tahoe-* | i[34]86-* | i860-* | m68k-* | m68000-* | m88k-* \ | sparc-* | ns32k-* | fx80-* | arm-* | c[123]* \ | mips-* | pyramid-* | tron-* | a29k-* | romp-* | rs6000-* \ | none-* | 580-* | cray2-* | i960-* | xmp-* | ymp-* \ | hppa1.0-* | hppa1.1-* | alpha-* | we32k-* | cydra-* | ns16k-* \ | pn-* | np1-* | xps100-* | clipper-* | orion-* | sparclite-* \ | powerpc \ | h8300-* | h8300h-* | sh-* \ | m88110-* | m680[01234]0-* | m683?2-* | z8k-* | h8500-* \ | mips64-* | mipsel-* | mips64el-*) # CYGNUS LOCAL ;; # Recognize the various machine names and aliases which stand # for a CPU type and a company and sometimes even an OS. mips3-*) # CYGNUS LOCAL basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` ;; mips3) # CYGNUS LOCAL basic_machine=mips64-unknown ;; dpx20 | dpx20-*) # CYGNUS LOCAL basic_machine=rs6000-bull os=-bosx ;; unixware) # CYGNUS LOCAL os=-sysv4 basic_machine=i386-unknown ;; vaxv) basic_machine=vax-dec os=-sysv ;; vms) basic_machine=vax-dec os=-vms ;; i370-ibm* | ibm*) basic_machine=i370-ibm os=-mvs ;; i386mach) # CYGNUS LOCAL basic_machine=i386-mach os=-mach ;; i[34]86v32) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv32 ;; i[34]86v4*) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv4 ;; i[34]86v) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-sysv ;; i[34]86sol2) basic_machine=`echo $1 | sed -e 's/86.*/86-unknown/'` os=-solaris2 ;; go32 | i386-go32) # CYGNUS LOCAL basic_machine=i386-unknown os=-go32 ;; i386-linux* | linux) # CYGNUS LOCAL basic_machine=i386-unknown os=-linux ;; i386-linux*coff | linuxcoff) # CYGNUS LOCAL basic_machine=i386-unknown os=-linuxcoff ;; i386-linux*elf | linuxelf) # CYGNUS LOCAL basic_machine=i386-unknown os=-linuxelf ;; 386bsd) # CYGNUS LOCAL basic_machine=i386-unknown os=-bsd ;; netbsd386) basic_machine=i386-unknown # CYGNUS LOCAL os=-netbsd ;; spur) basic_machine=spur-unknown ;; paragon) basic_machine=i860-intel os=-osf ;; alliant | fx80) basic_machine=fx80-alliant ;; convex-c1) basic_machine=c1-convex os=-bsd ;; convex-c2) basic_machine=c2-convex os=-bsd ;; convex-c32) basic_machine=c32-convex os=-bsd ;; convex-c34) basic_machine=c34-convex os=-bsd ;; convex-c38) basic_machine=c38-convex os=-bsd ;; m88k-omron*) basic_machine=m88k-omron ;; merlin) basic_machine=ns32k-utek os=-sysv ;; crds | unos) basic_machine=m68k-crds ;; elxsi) basic_machine=elxsi-elxsi os=-bsd ;; encore | umax | mmax) basic_machine=ns32k-encore ;; genix) basic_machine=ns32k-ns ;; iris | iris4d | \ iris3 | iris4) # CYGNUS LOCAL basic_machine=mips-sgi case $os in -irix*) ;; *) os=-irix4 ;; esac ;; news | news700 | news800 | news900) basic_machine=m68k-sony os=-newsos ;; 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) basic_machine=m68000-att ;; 3b*) basic_machine=we32k-att ;; delta | 3300 | motorola-3300 | motorola-delta \ | 3300-motorola | delta-motorola) basic_machine=m68k-motorola ;; balance) basic_machine=ns32k-sequent os=-dynix ;; pc532) basic_machine=ns32k-pc532 ;; symmetry) basic_machine=i386-sequent os=-dynix ;; sun2) basic_machine=m68000-sun ;; sun2os3) basic_machine=m68000-sun os=-sunos3 ;; sun2os4) basic_machine=m68000-sun os=-sunos4 ;; sun3os3) basic_machine=m68k-sun os=-sunos3 ;; sun3os4) basic_machine=m68k-sun os=-sunos4 ;; sun4os3) basic_machine=sparc-sun os=-sunos3 ;; sun4os4) basic_machine=sparc-sun os=-sunos4 ;; sun4sol2) # CYGNUS LOCAL basic_machine=sparc-sun os=-solaris2 ;; z8ksim) # CYGNUS LOCAL basic_machine=z8k-zilog os=-sim ;; z8k) # CYGNUS LOCAL basic_machine=z8k-zilog ;; sun3) basic_machine=m68k-sun ;; sun4) basic_machine=sparc-sun ;; msdos) # CYGNUS LOCAL basic_machine=i386-unknown os=-msdos ;; pbd) basic_machine=sparc-tti ;; pbb) basic_machine=m68k-tti ;; sun386 | sun386i | roadrunner) basic_machine=i386-sun ;; ps2) basic_machine=i386-ibm ;; fx2800) basic_machine=i860-alliant ;; next) basic_machine=m68k-next os=-bsd ;; amiga) basic_machine=m68k-cbm ;; amigados) basic_machine=m68k-cbm os=-amigados ;; amigaunix | amix) basic_machine=m68k-cbm os=-sysv4 ;; hp9k3[2-9][0-9]) basic_machine=m68k-hp ;; hp9k31[0-9] | hp9k2[0-9][0-9]) basic_machine=m68000-hp ;; hp9k7[0-9][0-9] | hp7[0-9][0-9] | hp9k8[0-9]7 | hp8[0-9]7) basic_machine=hppa1.1-hp ;; hp9k8[0-9][0-9] | hp8[0-9][0-9]) basic_machine=hppa1.0-hp ;; h3050r* | hppahitachi) basic_machine=hppa1.1-hitachi ;; isi68 | isi) basic_machine=m68k-isi os=-sysv ;; apollo68) basic_machine=m68k-apollo os=-sysv ;; apollo68bsd) # CYGNUS LOCAL basic_machine=m68k-apollo os=-bsd ;; altos | altos3068) basic_machine=m68k-altos ;; miniframe) basic_machine=m68010-convergent ;; tower | tower-32) basic_machine=m68k-ncr ;; news-3600 | risc-news) basic_machine=mips-sony os=-newsos ;; st2000) # CYGNUS LOCAL basic_machine=m68k-tandem ;; m6*bug) # CYGNUS LOCAL basic_machine=m68k-bug os=-coff ;; rom68k) # CYGNUS LOCAL basic_machine=m68k-rom68k os=-coff ;; monitor) # CYGNUS LOCAL basic_machine=m68k-rom68k os=-coff ;; decstation | decstation-3100 | pmax | pmin | dec3100 | decstatn) basic_machine=mips-dec ;; magnum | m3230) basic_machine=mips-mips os=-sysv ;; gmicro) basic_machine=tron-gmicro os=-sysv ;; rtpc | rtpc-*) basic_machine=romp-ibm ;; am29k) basic_machine=a29k-none os=-bsd ;; amdahl) basic_machine=580-amdahl os=-sysv ;; stratus) # CYGNUS LOCAL basic_machine=i860-stratus os=-sysv4 ;; cray | ymp) basic_machine=ymp-cray os=-unicos ;; cray2) basic_machine=cray2-cray os=-unicos ;; xmp) basic_machine=xmp-cray os=-unicos ;; delta88) basic_machine=m88k-motorola os=-sysv3 ;; dpx2* | dpx2*-bull) basic_machine=m68k-bull os=-sysv3 ;; ebmon29k) basic_machine=a29k-amd os=-ebmon ;; h8300hms) # CYGNUS LOCAL basic_machine=h8300-hitachi os=-hms ;; sh) # CYGNUS LOCAL basic_machine=sh-hitachi os=-hms ;; h8500hms) # CYGNUS LOCAL basic_machine=h8500-hitachi os=-hms ;; h8300xray) # CYGNUS LOCAL basic_machine=h8300-hitachi os=-xray ;; h8300hds) basic_machine=h8300-hitachi os=-hds ;; udi29k) # CYGNUS LOCAL basic_machine=a29k-amd os=-udi ;; a29khif) # CYGNUS LOCAL basic_machine=a29k-amd os=-udi ;; sa29200) # CYGNUS LOCAL basic_machine=a29k-amd os=-udi ;; harris) basic_machine=m88k-harris os=-sysv3 ;; hp300bsd) basic_machine=m68k-hp os=-bsd ;; hp300hpux) basic_machine=m68k-hp os=-hpux ;; hppaosf) basic_machine=hppa1.1-hp os=-osf ;; ncr3000) basic_machine=i486-ncr os=-sysv4 ;; necv70) # CYGNUS LOCAL basic_machine=v70-nec os=-sysv ;; news1000) basic_machine=m68030-sony os=-newsos ;; nindy960) basic_machine=i960-intel os=-nindy ;; pn) basic_machine=pn-gould ;; np1) basic_machine=np1-gould ;; ultra3) basic_machine=a29k-nyu os=-sym1 ;; vxworks960) basic_machine=i960-wrs os=-vxworks ;; vxworks68) basic_machine=m68k-wrs os=-vxworks ;; es1800 | OSE68k | ose68k | ose | OSE) # CYGNUS LOCAL basic_machine=m68k-ericsson os=-ose ;; OSE68000 | ose68000) # CYGNUS LOCAL basic_machine=m68000-ericsson os=-ose ;; os68k) # CYGNUS LOCAL basic_machine=m68k-none os=-os68k ;; sparclite-wrs) # CYGNUS LOCAL basic_machine=sparclite-wrs os=-vxworks ;; sparcfrw) # CYGNUS LOCAL basic_machine=sparcfrw-sun os=-sunos4 ;; sparcfrwcompat) # CYGNUS LOCAL basic_machine=sparcfrwcompat-sun os=-sunos4 ;; sparclitefrw) # CYGNUS LOCAL basic_machine=sparclitefrw-fujitsu os=-none ;; sparclitefrwcompat) # CYGNUS LOCAL basic_machine=sparclitefrwcompat-fujitsu os=-none ;; adobe68k) # CYGNUS LOCAL basic_machine=m68010-adobe os=-scout ;; xps | xps100) basic_machine=xps100-honeywell ;; none) basic_machine=none-none os=-none ;; # Here we handle the default manufacturer of certain CPU types. It is in # some cases the only manufacturer, in others, it is the most popular. mips) basic_machine=mips-mips ;; romp) basic_machine=romp-ibm ;; rs6000) basic_machine=rs6000-ibm ;; vax) basic_machine=vax-dec ;; we32k) basic_machine=we32k-att ;; sparc) basic_machine=sparc-sun ;; cydra) basic_machine=cydra-cydrome ;; orion) basic_machine=orion-highlevel ;; orion105) basic_machine=clipper-highlevel ;; *) echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 exit 1 ;; esac # Here we canonicalize certain aliases for manufacturers. case $basic_machine in *-digital*) basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` ;; *-commodore*) basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` ;; *) ;; esac # Decode manufacturer-specific aliases for certain operating systems. if [ x"$os" != x"" ] then case $os in # -solaris* is a basic system type, with this one exception. -solaris1 | -solaris1.*) os=`echo $os | sed -e 's|solaris1|sunos4|'` ;; -solaris) os=-solaris2 ;; # First accept the basic system types. # The portable systems comes first. # Each alternative must end in a *, to match a version number. # -sysv* is not here because it comes later, after sysvr4. -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ | -vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]* | -hpux* \ | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ | -amigados* | -msdos* | -newsos* | -unicos* | -aos* \ | -nindy* | -vxworks* | -ebmon* | -hms* | -mvs* | -clix* \ | -riscos* | -linux* | -uniplus* | -iris* | -rtu* | -xenix* \ | -hiux* | -386bsd* | -netbsd* | -riscix* | -lynxos* \ | -go32 | -sim | -es1800* | -udi | -hms* | -xray | -hds* \ | -os68k* | -none* | -v88r* | -aout* | -coff | -elf* | -bosx* \ | -abug | -ecoff* | -netware* ) # The last three lines above are CYGNUS LOCAL ;; -sunos5*) os=`echo $os | sed -e 's|sunos5|solaris2|'` ;; -sunos6*) os=`echo $os | sed -e 's|sunos6|solaris3|'` ;; -osfrose*) os=-osfrose ;; -osf*) os=-osf ;; -utek*) os=-bsd ;; -dynix*) os=-bsd ;; -acis*) os=-aos ;; -386bsd) # CYGNUS LOCAL os=-bsd ;; -ctix* | -uts*) os=-sysv ;; -triton*) os=-sysv3 ;; -oss*) os=-sysv3 ;; -svr4) os=-sysv4 ;; -unixware) os=-sysv4 ;; -svr3) os=-sysv3 ;; -sysvr4) os=-sysv4 ;; # This must come after -sysvr4. -sysv*) ;; -ose*) # CYGNUS LOCAL os=-ose ;; -es1800*) # CYGNUS LOCAL os=-ose ;; -xenix) os=-xenix ;; -none) ;; *) # Get rid of the `-' at the beginning of $os. os=`echo $1 | sed 's/[^-]*-//'` echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 exit 1 ;; esac else # Here we handle the default operating systems that come with various machines. # The value should be what the vendor currently ships out the door with their # machine or put another way, the most popular os provided with the machine. # Note that if you're going to try to match "-MANUFACTURER" here (say, # "-sun"), then you have to tell the case statement up towards the top # that MANUFACTURER isn't an operating system. Otherwise, code above # will signal an error saying that MANUFACTURER isn't an operating # system, and we'll never get to this point. case $basic_machine in *-acorn) os=-riscix1.2 ;; *-dec | vax-*) os=-ultrix4.2 ;; i386-sun) os=-sunos4.0.2 ;; m68000-sun) os=-sunos3 # This also exists in the configure program, but was not the # default. # os=-sunos4 ;; *-tti) # must be before sparc entry or we get the wrong os. os=-sysv3 ;; sparc-* | *-sun) os=-sunos4.1.1 ;; *-ibm) os=-aix ;; *-hp) os=-hpux ;; *-hitachi) os=-hiux ;; i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) os=-sysv ;; *-cbm) os=-amigados ;; *-dg) os=-dgux ;; *-dolphin) os=-sysv3 ;; m88k-omron*) os=-luna ;; *-sequent) os=-bsd ;; *-crds) os=-unos ;; *-ns) os=-genix ;; i370-*) os=-mvs ;; *-next) os=-bsd ;; i[34]86-*) os=-sco3.2v2 ;; *-gould) os=-sysv ;; *-highlevel) os=-bsd ;; *-encore) os=-bsd ;; *-sgi) os=-irix ;; *-masscomp) os=-rtu ;; *-rom68k) # CYGNUS LOCAL os=-coff ;; *-*bug) # CYGNUS LOCAL os=-coff ;; *) os=-none ;; esac fi # Here we handle the case where we know the os, and the CPU type, but not the # manufacturer. We pick the logical manufacturer. vendor=unknown case $basic_machine in *-unknown) case $os in -riscix*) vendor=acorn ;; -sunos*) vendor=sun ;; -bosx*) # CYGNUS LOCAL vendor=bull ;; -lynxos*) vendor=lynx ;; -aix*) vendor=ibm ;; -hpux*) vendor=hp ;; -hiux*) vendor=hitachi ;; -unos*) vendor=crds ;; -dgux*) vendor=dg ;; -luna*) vendor=omron ;; -genix*) vendor=ns ;; -mvs*) vendor=ibm ;; -vxworks*) vendor=wrs # CYGNUS LOCAL ;; -hms*) # CYGNUS LOCAL vendor=hitachi ;; esac basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` ;; esac echo $basic_machine$os octave-1.1.0/float-type.c100666 415 17 26433 5621252514 13421 0ustar jweusers/* This file combines the single and double precision versions of machar, selected by cc -DSP or cc -DDP. This feature provided by D. G. Hough, August 3, 1988. */ #ifdef SP #define REAL float #define ZERO 0.0 #define ONE 1.0 #define PREC "Single " #define REALSIZE 1 #endif #ifdef DP #define REAL double #define ZERO 0.0e0 #define ONE 1.0e0 #define PREC "Double " #define REALSIZE 2 #endif #include #include #define ABS(xxx) ((xxx>ZERO)?(xxx):(-xxx)) void rmachar(ibeta,it,irnd,ngrd,machep,negep,iexp,minexp, maxexp,eps,epsneg,xmin,xmax) int *ibeta,*iexp,*irnd,*it,*machep,*maxexp,*minexp,*negep,*ngrd; REAL *eps,*epsneg,*xmax,*xmin; /* This subroutine is intended to determine the parameters of the floating-point arithmetic system specified below. The determination of the first three uses an extension of an algorithm due to M. Malcolm, CACM 15 (1972), pp. 949-951, incorporating some, but not all, of the improvements suggested by M. Gentleman and S. Marovich, CACM 17 (1974), pp. 276-277. An earlier version of this program was published in the book Software Manual for the Elementary Functions by W. J. Cody and W. Waite, Prentice-Hall, Englewood Cliffs, NJ, 1980. The present program is a translation of the Fortran 77 program in W. J. Cody, "MACHAR: A subroutine to dynamically determine machine parameters". TOMS (14), 1988. Parameter values reported are as follows: ibeta - the radix for the floating-point representation it - the number of base ibeta digits in the floating-point significand irnd - 0 if floating-point addition chops 1 if floating-point addition rounds, but not in the IEEE style 2 if floating-point addition rounds in the IEEE style 3 if floating-point addition chops, and there is partial underflow 4 if floating-point addition rounds, but not in the IEEE style, and there is partial underflow 5 if floating-point addition rounds in the IEEE style, and there is partial underflow ngrd - the number of guard digits for multiplication with truncating arithmetic. It is 0 if floating-point arithmetic rounds, or if it truncates and only it base ibeta digits participate in the post-normalization shift of the floating-point significand in multiplication; 1 if floating-point arithmetic truncates and more than it base ibeta digits participate in the post-normalization shift of the floating-point significand in multiplication. machep - the largest negative integer such that 1.0+FLOAT(ibeta)**machep .NE. 1.0, except that machep is bounded below by -(it+3) negeps - the largest negative integer such that 1.0-FLOAT(ibeta)**negeps .NE. 1.0, except that negeps is bounded below by -(it+3) iexp - the number of bits (decimal places if ibeta = 10) reserved for the representation of the exponent (including the bias or sign) of a floating-point number minexp - the largest in magnitude negative integer such that FLOAT(ibeta)**minexp is positive and normalized maxexp - the smallest positive power of BETA that overflows eps - the smallest positive floating-point number such that 1.0+eps .NE. 1.0. In particular, if either ibeta = 2 or IRND = 0, eps = FLOAT(ibeta)**machep. Otherwise, eps = (FLOAT(ibeta)**machep)/2 epsneg - A small positive floating-point number such that 1.0-epsneg .NE. 1.0. In particular, if ibeta = 2 or IRND = 0, epsneg = FLOAT(ibeta)**negeps. Otherwise, epsneg = (ibeta**negeps)/2. Because negeps is bounded below by -(it+3), epsneg may not be the smallest number that can alter 1.0 by subtraction. xmin - the smallest non-vanishing normalized floating-point power of the radix, i.e., xmin = FLOAT(ibeta)**minexp xmax - the largest finite floating-point number. In particular xmax = (1.0-epsneg)*FLOAT(ibeta)**maxexp Note - on some machines xmax will be only the second, or perhaps third, largest number, being too small by 1 or 2 units in the last digit of the significand. Latest revision - August 4, 1988 Author - W. J. Cody Argonne National Laboratory */ { int i,iz,j,k; int mx,itmp,nxres; REAL a,b,beta,betain,one,y,z,zero; REAL betah,t,tmp,tmpa,tmp1,two; (*irnd) = 1; one = (REAL)(*irnd); two = one + one; a = two; b = a; zero = 0.0e0; /* determine ibeta,beta ala malcolm */ tmp = ((a+one)-a)-one; while (tmp == zero) { a = a+a; tmp = a+one; tmp1 = tmp-a; tmp = tmp1-one; } tmp = a+b; itmp = (int)(tmp-a); while (itmp == 0) { b = b+b; tmp = a+b; itmp = (int)(tmp-a); } *ibeta = itmp; beta = (REAL)(*ibeta); /* determine irnd, it */ (*it) = 0; b = one; tmp = ((b+one)-b)-one; while (tmp == zero) { *it = *it+1; b = b*beta; tmp = b+one; tmp1 = tmp-b; tmp = tmp1-one; } *irnd = 0; betah = beta/two; tmp = a+betah; tmp1 = tmp-a; if (tmp1 != zero) *irnd = 1; tmpa = a+beta; tmp = tmpa+betah; if ((*irnd == 0) && (tmp-tmpa != zero)) *irnd = 2; /* determine negep, epsneg */ (*negep) = (*it) + 3; betain = one / beta; a = one; for (i = 1; i<=(*negep); i++) { a = a * betain; } b = a; tmp = (one-a); tmp = tmp-one; while (tmp == zero) { a = a*beta; *negep = *negep-1; tmp1 = one-a; tmp = tmp1-one; } (*negep) = -(*negep); (*epsneg) = a; /* determine machep, eps */ (*machep) = -(*it) - 3; a = b; tmp = one+a; while (tmp-one == zero) { a = a*beta; *machep = *machep+1; tmp = one+a; } *eps = a; /* determine ngrd */ (*ngrd) = 0; tmp = one+*eps; tmp = tmp*one; if (((*irnd) == 0) && (tmp-one) != zero) (*ngrd) = 1; /* determine iexp, minexp, xmin loop to determine largest i such that (1/beta) ** (2**(i)) does not underflow. exit from loop is signaled by an underflow. */ i = 0; k = 1; z = betain; t = one+*eps; nxres = 0; for (;;) { y = z; z = y * y; /* check for underflow */ a = z * one; tmp = z*t; if ((a+a == zero) || (ABS(z) > y)) break; tmp1 = tmp*betain; if (tmp1*beta == z) break; i = i + 1; k = k+k; } /* determine k such that (1/beta)**k does not underflow first set k = 2 ** i */ (*iexp) = i + 1; mx = k + k; if (*ibeta == 10) { /* for decimal machines only */ (*iexp) = 2; iz = *ibeta; while (k >= iz) { iz = iz * (*ibeta); (*iexp) = (*iexp) + 1; } mx = iz + iz - 1; } /* loop to determine minexp, xmin. exit from loop is signaled by an underflow. */ for (;;) { (*xmin) = y; y = y * betain; a = y * one; tmp = y*t; tmp1 = a+a; if ((tmp1 == zero) || (ABS(y) >= (*xmin))) break; k = k + 1; tmp1 = tmp*betain; tmp1 = tmp1*beta; if ((tmp1 == y) && (tmp != y)) { nxres = 3; *xmin = y; break; } } (*minexp) = -k; /* determine maxexp, xmax */ if ((mx <= k+k-3) && ((*ibeta) != 10)) { mx = mx + mx; (*iexp) = (*iexp) + 1; } (*maxexp) = mx + (*minexp); /* Adjust *irnd to reflect partial underflow. */ (*irnd) = (*irnd)+nxres; /* Adjust for IEEE style machines. */ if ((*irnd) >= 2) (*maxexp) = (*maxexp)-2; /* adjust for machines with implicit leading bit in binary significand and machines with radix point at extreme right of significand. */ i = (*maxexp) + (*minexp); if (((*ibeta) == 2) && (i == 0)) (*maxexp) = (*maxexp) - 1; if (i > 20) (*maxexp) = (*maxexp) - 1; if (a != y) (*maxexp) = (*maxexp) - 2; (*xmax) = one - (*epsneg); tmp = (*xmax)*one; if (tmp != (*xmax)) (*xmax) = one - beta * (*epsneg); (*xmax) = (*xmax) / (beta * beta * beta * (*xmin)); i = (*maxexp) + (*minexp) + 3; if (i > 0) { for (j = 1; j<=i; j++ ) { if ((*ibeta) == 2) (*xmax) = (*xmax) + (*xmax); if ((*ibeta) != 2) (*xmax) = (*xmax) * beta; } } return; } typedef union { double d; int i[2]; } equiv; #ifdef DP int equiv_compare (equiv *std, equiv *v, int len) { int i; for (i = 0; i < len; i++) if (v[i].i[0] != std[i].i[0] || v[i].i[1] != std[i].i[1]) return 0; return 1; } #endif int main (void) { /* Works for 32 bit machines with 32 bit ints and 64 bit doubles */ int ibeta, iexp, irnd, it, machep, maxexp, minexp, negep, ngrd; REAL eps, epsneg, xmax, xmin; int i; equiv flt_params[4]; rmachar (&ibeta, &it, &irnd, &ngrd, &machep, &negep, &iexp, &minexp, &maxexp, &eps, &epsneg, &xmin, &xmax); flt_params[0].d = xmin; flt_params[1].d = xmax; flt_params[2].d = epsneg; flt_params[3].d = eps; #ifdef DP #define IS_MACH(v,nm,sm_1,sm_2,lrg_1,lrg_2,rt_1,rt_2,dv_1,dv_2) \ do \ { \ equiv v[4]; \ v[0].i[0] = (sm_1); v[0].i[1] = (sm_2); \ v[1].i[0] = (lrg_1); v[1].i[1] = (lrg_2); \ v[2].i[0] = (rt_1); v[2].i[1] = (rt_2); \ v[3].i[0] = (dv_1); v[3].i[1] = (dv_2); \ \ if (equiv_compare (v, flt_params, 4)) \ { \ printf ("%s\n", nm); \ return 0; \ } \ } \ while (0) IS_MACH (ieee_big_endian, "IEEE_BIG_ENDIAN", 1048576, 0, 2146435071, -1, 1017118720, 0, 1018167296, 0); /* 1070810131, 1352628735); */ IS_MACH (ieee_little_endian, "IEEE_LITTLE_ENDIAN", 0, 1048576, -1, 2146435071, 0, 1017118720, 0, 1018167296); /* 1352628735, 1070810131); */ IS_MACH (vax_d_float, "VAX_D_FLOAT", 128, 0, -32769, -1, 9344, 0, 9344, 0); /* 546979738, -805796613); */ IS_MACH (vax_g_float, "VAX_G_FLOAT", 16, 0, -32769, -1, 15552, 0, 15552, 0); /* 1142112243, 2046775455); */ #else LOSE! LOSE! #endif printf ("UNRECOGNIZED_FLOATING_POINT_FORMAT\n"); return 1; } octave-1.1.0/move-if-change100777 415 17 407 5431315456 13641 0ustar jweusers#!/bin/sh # # Like mv $1 $2, but if the files are the same, just delete $1. # Status is 0 if $2 is changed, 1 otherwise. if test -r $2; then if cmp $1 $2 > /dev/null; then echo $2 is unchanged rm -f $1 else mv -f $1 $2 fi else mv -f $1 $2 fi octave-1.1.0/octave.sh100777 415 17 473 5543660747 12763 0ustar jweusers#!/bin/sh # # Wrapper for octave for binary installations that can't install # octave in /usr/local/bin. # # The real binary should be installed in as octave.bin, and this file # should be installed in the same directory as octave. OCTAVE_HOME=@OCTAVE_HOME@ export OCTAVE_HOME exec $OCTAVE_HOME/bin/octave.bin $* octave-1.1.0/install-sh100777 415 17 4212 5615463510 13147 0ustar jweusers#!/bin/sh # # install - install a program, script, or datafile # This comes from X11R5; it is not part of GNU. # # $XConsortium: install.sh,v 1.2 89/12/18 14:47:22 jim Exp $ # # This script is compatible with the BSD install script, but was written # from scratch. # # 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}" instcmd="$mvprog" chmodcmd="" chowncmd="" chgrpcmd="" stripcmd="" rmcmd="$rmprog -f" mvcmd="$mvprog" src="" dst="" while [ x"$1" != x ]; do case $1 in -c) instcmd="$cpprog" 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;; *) if [ x"$src" = x ] then src=$1 else dst=$1 fi shift continue;; esac done if [ x"$src" = x ] then echo "install: no input file specified" exit 1 fi if [ x"$dst" = x ] then echo "install: no destination specified" exit 1 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` fi # Make a temp file name in the proper directory. dstdir=`dirname $dst` dsttmp=$dstdir/#inst.$$# # Move or copy the file name to the temp name $doit $instcmd $src $dsttmp # and set any options; do chmod last to preserve setuid bits if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; fi if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; fi if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; fi if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; fi # Now rename the file to the real destination. $doit $rmcmd $dst $doit $mvcmd $dsttmp $dst exit 0 octave-1.1.0/octave-bug.in100666 415 17 10031 5672130200 13531 0ustar jweusers#! /bin/sh - # # octave-bug - create a bug report and mail it to the bug-octave # mailing list. # # Patterned after the bashbug script from bash 1.14. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin # Configuration: these variables are filled in at configuration time. VERSION="%VERSION%" MACHINE="%TARGET_HOST_TYPE%" F77="%F77%" FFLAGS="%FFLAGS%" CC="%CC%" CFLAGS="%CFLAGS%" CXX="%CXX%" CXXFLAGS="%CXXFLAGS%" DEFS="%DEFS%" PATH=/bin:/usr/bin:/usr/ucb:/usr/local/bin:$PATH export PATH TEMP=/tmp/octave-bug.$$ : ${EDITOR=emacs} trap 'rm -f $TEMP $TEMP.x; exit 1' 1 2 3 13 15 trap 'rm -f $TEMP $TEMP.x' 0 UN= if (uname) > /dev/null 2>&1 then UN=`uname -a` fi HAVE_FMT=false if (fmt < /dev/null) > /dev/null 2>&1 then HAVE_FMT=true fi ss_p=`echo $VERSION | grep "^ss-"` if test -n "$ss_p" then BUGADDR="octave-maintainers@che.utexas.edu" else BUGADDR="bug-octave@che.utexas.edu" fi SUBJECT="[50 character or so descriptive subject here (for reference)]" if test $# -gt 0 then case "$1" in -s) shift if test $# -gt 0 then SUBJECT="$1" shift else echo "usage: octave-bug [-s subject]" exit 1 fi ;; esac fi cat > $TEMP << EOF To: $BUGADDR Subject: $SUBJECT -------- Bug report for Octave $VERSION configured for $MACHINE Description: ----------- * Please replace this item with a detailed description of the problem. Suggestions or general comments are also welcome. Repeat-By: --------- * Please replace this item with a description of the sequence of events that causes the problem to occur. Fix: --- * If possible, replace this item with a description of how to fix the problem (if you don't have a fix for the problem, don't include this section, but please do submit your report anyway). Configuration (please do not edit this section): ----------------------------------------------- uname output: $UN Fortran compiler: $F77 FFLAGS: $FFLAGS C compiler: $CC CFLAGS: $CFLAGS C++ compiler: $CXX CXXFLAGS: $CXXFLAGS DEFS: EOF if $HAVE_FMT then echo $DEFS | fmt | sed 's/^/ /' >> $TEMP else echo $DEFS >> $TEMP fi if test $# -gt 0 then if test -f "$1" then cat >> $TEMP << EOF User-preferences (please do not edit this section): -------------------------------------------------- EOF cat $1 >> $TEMP fi fi chmod u+w $TEMP cp $TEMP $TEMP.x status=0 if $EDITOR $TEMP then if cmp -s $TEMP $TEMP.x then echo "file not changed -- no bug report submitted" status=1 else # Try to extract the recipient address, in case the To: line in the # message template has been changed. Also get cc: lines. TO_ADDR=`sed -e '/^--------[ \t]*$/q' $TEMP | sed -n -e 's/^[Tt][Oo]://p'` CC_ADDR=`sed -e '/^--------[ \t]*$/q' $TEMP | sed -n -e 's/^[Cc][Cc]://p'` if test -z "$TO_ADDR" then echo "no valid \`To:' field found in header -- using $BUGADDR instead" else BUGADDR="$TO_ADDR" fi BUGADDR="$BUGADDR $CC_ADDR" # Delete the `--------' separator in the message. awk 'BEGIN{ in_header = 1; } \ /^--------[ \t]*$/ { if (in_header) { in_header = 0; print ""; next; } } { print $0; }' $TEMP > $TEMP.x # Now try to mail it. ( rmail $BUGADDR < $TEMP.x ) > /dev/null 2>&1 || \ ( mailx -s "$SUBJECT" $BUGADDR < $TEMP.x ) > /dev/null 2>&1 || \ ( Mail -s "$SUBJECT" $BUGADDR < $TEMP.x ) > /dev/null 2>&1 || \ ( /usr/ucb/mail -s "$SUBJECT" $BUGADDR < $TEMP.x ) > /dev/null 2>&1 || \ ( /bin/mail $BUGADDR < $TEMP.x ) > /dev/null 2>&1 || \ ( echo "unable to send mail -- saving message in \$HOME/dead.octave-bug"; \ cat $TEMP >> $HOME/dead.octave-bug; exit 1 ) status=$? if test $status -eq 0 then echo "bug report sent to: $TO_ADDR" echo " cc to: $CC_ADDR" fi fi else echo "problems with edit -- no bug report submitted" status=1 fi exit $status octave-1.1.0/octave-mode.el100666 415 17 43113 5633410146 13710 0ustar jweusers;; octave-mode.el - major mode for Octave function files ;; ;; Copyright (C) 1994 John W. Eaton ;; ;; This file is part of Octave. ;; ;; Octave 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, or (at your option) any ;; later version. ;; ;; Octave 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 Octave; see the file COPYING. If not, write to the Free ;; Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. ;; ;; This major mode for GNU emacs provides support for editing Octave ;; function files. It requires matlab-mode.el, which was written by ;; Matthew R. Wette . ;; ;; It automatically indents block structures, line continuations ;; (e.g., ...), and comments. The usual paren matching support is ;; included. Filling and auto-fill works for comment lines. For ;; convenient use, put this file and matlab.el in your Emacs ;; load-path and add something like the following to your .emacs ;; start-up file: ;; ;; (autoload 'octave-mode "octave-mode" "Enter Octave mode." t) ;; (setq auto-mode-alist (cons '("\\.m$" . octave-mode) auto-mode-alist)) ;; (defun my-octave-mode-hook () ;; (setq fill-column 76) ;; (turn-on-auto-fill)) ;; (setq octave-mode-hook 'my-octave-mode-hook) ;; ;; For Lucid Emacs, add ``(font-lock-mode 1)'' to your octave-bmode-hook. ;; Customize Matlab mode for Octave users. (setq matlab-comment-column 0) (setq matlab-comment-line-s "# ") (setq matlab-comment-on-line-s "# ") (setq matlab-comment-region-s "#$$$ ") (defconst matlab-show-vers t "*If non-nil, shows the version number on load.") ;; octave-mode (defun matlab-mode () "Major mode for editing Octave function files. Version 1.0. Will run octave-mode-hook if it is non-nil. Filling works (comments justify). Special Key Bindings: \\{matlab-mode-map} Variables: matlab-indent-level Level to indent blocks. matlab-comment-column Goal column for on-line comments. fill-column Column used in auto-fill. matlab-comment-line-s String to start comment line. matlab-comment-region-s String to put comment lines in region. matlab-indent-before-return If t, matlab-indent-line before RET. matlab-indent-end-before-return If t, indent-line before RET on end. matlab-show-vers If t, show version on start-up. Commands: matlab-mode Enter MATLAB major mode. matlab-return RET with post indenting. matlab-linefeed RET with pre and post indent. matlab-comment-return RET for next-line comment. matlab-indent-line Indent line for structure. matlab-comment Add comment to current line. matlab-comment-indent Compute indent for comment. matlab-comment-region Comment (with arg, uncomment) region. matlab-fill-region Fill region (usually comments). matlab-justify-line Delete space on end and justify. To add automatic support put something like the following in your .emacs file: \(autoload 'matlab-mode \"matlab-mode\" \"Enter Matlab mode.\" t\) \(setq auto-mode-alist \(cons '\(\"\\\\.m$\" . matlab-mode\) \ auto-mode-alist\)\) \(defun my-matlab-mode-hook \(\) \(setq fill-column 76\) \(turn-on-auto-fill\)\) \(setq matlab-mode-hook 'my-matlab-mode-hook\)" (interactive) (kill-all-local-variables) (use-local-map matlab-mode-map) (setq major-mode 'matlab-mode) (setq mode-name "Matlab") (setq local-abbrev-table matlab-mode-abbrev-table) (set-syntax-table matlab-mode-syntax-table) (make-local-variable 'paragraph-start) (setq paragraph-start (concat "^$\\|" page-delimiter)) (make-local-variable 'paragraph-separate) (setq paragraph-separate paragraph-start) (make-local-variable 'paragraph-ignore-fill-prefix) (setq paragraph-ignore-fill-prefix t) (make-local-variable 'indent-line-function) (setq indent-line-function 'matlab-indent-line) (make-local-variable 'comment-start-skip) (setq comment-start-skip "%[ \t]*") (make-local-variable 'comment-column) (setq comment-column 'matlab-comment-column) (make-local-variable 'auto-fill-hook) (setq auto-fill-hook 'matlab-auto-fill) (make-local-variable 'comment-indent-hook) (setq comment-indent-hook 'matlab-comment-indent) (make-local-variable 'fill-column) (setq fill-column default-fill-column) (make-local-variable 'fill-prefix) (setq fill-prefix matlab-comment-line-s) ;;(setq font-lock-keywords matlab-font-lock-keywords) ;; Lucid emacs ;;(setq (make-local-variable 'font-lock-keywords) matlab-font-lock-keywords) (run-hooks 'matlab-mode-hook) (if matlab-show-vers (message "matlab-mode, Version 1.06.0 Dated 23Nov93"))) (defconst mtlb-cline-start-skip "[ \t]*%[ \t]*" "*The regular expression for skipping comment start.") ;; (defun matlab-auto-fill () "Do filling." (interactive) (cond ((mtlb-ltype-comment) do-auto-fill) ((mtlb-lattr-comment) do-auto-fill) (t ()))) (defun matlab-return () "Handle carriage return in matlab-mode." (interactive) (if matlab-indent-before-return (matlab-indent-line) (if matlab-indent-end-before-return (if (mtlb-ltype-block-end) (matlab-indent-line)))) (newline) (matlab-indent-line)) (defun matlab-linefeed () "Handle linefeed in matlab-mode. Has effect of matlab-return with (not matlab-indent-before-return)." (interactive) (if (not matlab-indent-before-return) (matlab-indent-line)) (newline) (matlab-indent-line)) (defun matlab-comment-return () "Handle carriage return for matlab comment line." (interactive) (cond ((mtlb-ltype-comment) (mtlb-set-comment-fill-prefix) (newline) (insert fill-prefix) (matlab-indent-line)) ((mtlb-lattr-comment) (newline) (indent-to matlab-comment-column) (insert matlab-comment-on-line-s)) (t (newline) (matlab-comment) (matlab-indent-line)))) (defun matlab-indent-line () "Indent a line in matlab-mode." (interactive) (save-excursion (beginning-of-line) (delete-horizontal-space) (indent-to (mtlb-calc-indent)) ;; -- If line contains a comment, format it. -- (if (or (mtlb-ltype-comment) (mtlb-lattr-comment)) (matlab-comment))) (skip-chars-forward " \t%")) (defun matlab-comment () "Add a comment to the current line. If one already exists, format it." (interactive) (cond ((mtlb-ltype-empty) (matlab-indent-line) (insert matlab-comment-line-s)) ((mtlb-ltype-comment) (save-excursion (if (and (= 0 (forward-line -1)) (mtlb-ltype-comment)) (progn (mtlb-set-comment-fill-prefix) (forward-line 1) (beginning-of-line) (delete-horizontal-space) (delete-char 1) (delete-horizontal-space) (insert fill-prefix))))) ((mtlb-lattr-comment) (beginning-of-line) (search-forward "%") (forward-char -1) (delete-horizontal-space) (insert " ") (if (< (current-column) matlab-comment-column) (indent-to matlab-comment-column)) (skip-chars-forward "% ")) (t (end-of-line) (re-search-backward "[^ \t\n^]" 0 t) (forward-char) (delete-horizontal-space) (if (< (current-column) matlab-comment-column) (indent-to matlab-comment-column) (insert " ")) (insert matlab-comment-on-line-s)))) (defun matlab-comment-indent () "Indent a comment line in matlab-mode." (mtlb-calc-indent)) (defun mtlb-calc-indent () "Return the appropriate indentation for this line as an int." (let ((indent 0)) (save-excursion (if (not (mtlb-prev-line)) 0 (setq indent (current-indentation)) (setq indent (+ indent (cond ((mtlb-ltype-comment) (mtlb-set-comment-fill-prefix) 0) ((mtlb-ltype-block-beg) matlab-indent-level) ((mtlb-ltype-block-end) 0) (t (mtlb-calc-blok-indent))))) (if (mtlb-lattr-unbal-mexp) (setq indent (+ indent (mtlb-calc-mexp-indent)))) (if (mtlb-lattr-cont) (setq indent (+ indent (* 2 matlab-indent-level))))) (if (mtlb-prev-line) (if (mtlb-lattr-cont) (setq indent (- indent (* 2 matlab-indent-level)))))) (if (mtlb-ltype-block-end) (setq indent (- indent matlab-indent-level))) (if (< indent 0) (setq indent 0)) indent)) (defun mtlb-prev-line () "Find the previous line. Return 0 if not found." (interactive) (if (/= 0 (forward-line -1)) () (if (mtlb-ltype-empty) (mtlb-prev-line) t))) (defun matlab-comment-region (beg-region end-region arg) "Comments every line in the region. Puts matlab-comment-region-s at the beginning of every line in the region. BEG-REGION and END-REGION are args which specify the region boundaries. With non-nil ARG, uncomments the region." (interactive "*r\nP") (let ((end-region-mark (make-marker)) (save-point (point-marker))) (set-marker end-region-mark end-region) (goto-char beg-region) (beginning-of-line) (if (not arg) ;comment the region (progn (insert matlab-comment-region-s) (while (and (= (forward-line 1) 0) (< (point) end-region-mark)) (insert matlab-comment-region-s))) (let ((com (regexp-quote matlab-comment-region-s))) ;uncomment the region (if (looking-at com) (delete-region (point) (match-end 0))) (while (and (= (forward-line 1) 0) (< (point) end-region-mark)) (if (looking-at com) (delete-region (point) (match-end 0)))))) (goto-char save-point) (set-marker end-region-mark nil) (set-marker save-point nil))) (defun matlab-fill-region (beg-region end-region &optional justify-flag) "Fill the region. Non-nil arg means justify commment lines as well." (interactive "*r\nP") (let ((end-reg-mk (make-marker))) (set-marker end-reg-mk end-region) (goto-char beg-region) (beginning-of-line) (while (< (save-excursion (forward-line 1) (point)) end-reg-mk) (if (save-excursion (= (forward-line 1) 0)) (progn (cond ((mtlb-ltype-comment) (while (matlab-fill-comment-line)) (if justify-flag (justify-comment-line)))) (forward-line 1)))))) (defun matlab-fill-comment-line () "Fill the current comment line." (interactive) (let ((prev-indent-col 0)) (beginning-of-line) (re-search-forward mtlb-cline-start-skip) (setq prev-indent-col (current-column)) (mtlb-set-comment-fill-prefix) (if (/= (forward-line 1) 0) () (beginning-of-line) (re-search-forward mtlb-cline-start-skip) (if (/= prev-indent-col (current-column)) (progn (forward-line -1) ()) (mtlb-join-comment-lines) (if (mtlb-wrap-line) (save-excursion (forward-line 1) (beginning-of-line) (insert fill-prefix) t)))))) (defun mtlb-join-comment-lines () "Join current comment line to previous, deleting space and comment mark." (interactive) (beginning-of-line) (forward-char -1) (delete-char 1) ; delete newline (delete-horizontal-space) (delete-char 1) ; delete "%" (delete-horizontal-space) (insert " ")) (defun mtlb-wrap-line () "Wrap line so last token on line does not exceed fill-column." (interactive) (save-excursion (end-of-line) (delete-horizontal-space) (if (< (current-column) fill-column) () (while (> (current-column) fill-column) (forward-char -1)) (while (not (looking-at "[ \t]")) (forward-char -1)) (delete-horizontal-space) (insert "\n") t))) (defun mtlb-set-comment-fill-prefix () "Set the fill-prefix for the current comment line." (setq fill-prefix (save-excursion (beginning-of-line) (buffer-substring (point) (progn (re-search-forward mtlb-cline-start-skip) (point))))) (if (equal fill-prefix "") (setq fill-prefix nil))) (defun matlab-justify-line () "Delete space on end of line and justify." (interactive) (save-excursion (end-of-line) (delete-horizontal-space) (justify-current-line))) ;;; ;;; line attributes ... (defun mtlb-lattr-comment () "Returns t if current line contains a comment." (save-excursion (beginning-of-line) (looking-at ".*%"))) (defun mtlb-lattr-cont () "Returns t if current line ends in .. and optional comment." (save-excursion (beginning-of-line) (re-search-forward "[^; \t.][ \t]*\\.\\.\\.+[ \t]*\\(%.*\\)?$" (save-excursion (end-of-line) (point)) t))) (defun mtlb-lattr-unbal-mexp () (/= (mtlb-calc-mexp-indent) 0)) ;;; ;;; line types ... (defun mtlb-ltype-empty () "Returns t if current line is empty." (save-excursion (beginning-of-line) (looking-at "^[ \t]*$"))) (defun mtlb-ltype-comment () "Returns t if current line is a MATLAB comment line." (save-excursion (beginning-of-line) (looking-at "[ \t]*%"))) (defun mtlb-ltype-block-beg () "Returns t if line contains beginning of MATLAB block." (save-excursion (beginning-of-line) (and (looking-at (concat "[^%\n]*" mtlb-block-beg-kw)) (not (mtlb-ltype-blk-beg-end))))) (defun mtlb-ltype-block-end () "Returns t if line contains end of MATLAB block." (save-excursion (beginning-of-line) (and (looking-at (concat "\\([^%\n]*[ \t]\\)?" mtlb-block-end-kw)) (not (mtlb-ltype-blk-beg-end))))) (defun mtlb-ltype-blk-beg-end () "Returns t if line contains matching block begin-end in matlab-mode." (save-excursion (beginning-of-line) (looking-at (concat "[^%\n]*" mtlb-block-beg-kw "[^%\n]+" mtlb-block-end-kw)))) ;;; ;;; utility functions ... (defconst mtlb-block-beg-kw "\\b\\(for\\|while\\|if\\|else\\|elseif\\)\\b" "Regular expression for keywords which begin blocks in matlab-mode.") (defconst mtlb-block-end-kw "\\b\\(end\\|else\\|elseif\\)\\b" "Regular expression for keywords which end blocks.") (defun mtlb-calc-blok-indent () (let ((indent 0)) (save-excursion (beginning-of-line) (while (< (point) (save-excursion (end-of-line) (point))) (cond ((looking-at mtlb-block-beg-kw) (setq indent (+ indent matlab-indent-level))) ((looking-at mtlb-block-end-kw) (setq indent (- indent matlab-indent-level)))) (forward-char))) indent)) (defun mtlb-calc-mexp-indent () (let ((indent 0)) (save-excursion (beginning-of-line) (while (< (point) (save-excursion (end-of-line) (point))) (cond ((looking-at "\\[") (setq indent (+ indent matlab-indent-level))) ((looking-at "\\]") (setq indent (- indent matlab-indent-level)))) (forward-char))) (* 2 indent))) ;;; ;;; -- debugging -- (defun matlab-show-line-attr () "Display type and attributes of current line. Used in debugging." (interactive) (let ((msg "matlab-show-line-attr:")) (cond ((mtlb-ltype-empty) (setq msg (concat msg " empty"))) ((mtlb-ltype-comment) (setq msg (concat msg " comment"))) ((mtlb-ltype-block-beg) (setq msg (concat msg " block-begin"))) ((mtlb-ltype-block-end) (setq msg (concat msg " block-end"))) (t (setq msg (concat msg " other")))) (if (mtlb-lattr-cont) (setq msg (concat msg " w/cont"))) (if (mtlb-lattr-comment) (setq msg (concat msg " w/comm"))) (if (mtlb-lattr-unbal-mexp) (setq msg (concat msg " w/unbal-mexp"))) (message msg))) (defun matlab-show-blok-indent () "Display indentation for matrix expression. Used in debugging." (interactive) (let ((msg "matlab-show-blok-indent: ")) (setq msg (concat msg (mtlb-calc-blok-indent))) (message msg))) (defun matlab-show-mexp-indent () "Display indentation for matrix expression. Used in debugging." (interactive) (let ((msg "matlab-show-mexp-indent: ")) (setq msg (concat msg (mtlb-calc-mexp-indent))) (message msg))) ;;; --- version 19 stuff ... (defvar matlab-font-lock-keywords (list '("\\b\\(break\\|else\\|elseif\\|end\\|for\\|if\\|return\\|while\\)\\b" . font-lock-keyword-face) '("\\bfunction[^=]+=[^)]+)" . font-lock-function-name-face) ) "Expressions to hightlight in Matlab mode.") (if (featurep 'lhilit) (hilit-set-mode-patterns 'matlab-mode '(("%.*$" nil comment) ;;("'.*'" nil string) ("\\bfunction[^=]+=[^)]+)" nil defun) ;; key words ("\\<\\(load\\|save\\|clear\\)\\>" nil include) ("\\<\\(break\\|else\\|elseif\\|end\\|for\\|if\\|return\\)\\>" nil keyword) ))) ;;; -- stuff which belongs elsewhere -- (defun justify-comment-line () "Add spaces to comment line point is in, so it ends at fill-column." (interactive) (save-excursion (save-restriction (let (ncols beg) (beginning-of-line) (forward-char (length fill-prefix)) (skip-chars-forward " \t") (setq beg (point)) (end-of-line) (narrow-to-region beg (point)) (goto-char beg) (while (re-search-forward " *" nil t) (delete-region (+ (match-beginning 0) (if (save-excursion (skip-chars-backward " ])\"'") (memq (preceding-char) '(?. ?? ?!))) 2 1)) (match-end 0))) (goto-char beg) (while (re-search-forward "[.?!][])""']*\n" nil t) (forward-char -1) (insert " ")) (goto-char (point-max)) (setq ncols (- fill-column (current-column))) (if (search-backward " " nil t) (while (> ncols 0) (let ((nmove (+ 3 (% (random) 3)))) (while (> nmove 0) (or (search-backward " " nil t) (progn (goto-char (point-max)) (search-backward " "))) (skip-chars-backward " ") (setq nmove (1- nmove)))) (insert " ") (skip-chars-backward " ") (setq ncols (1- ncols)))))))) (provide 'matlab-mode) ;; --- last line of matlab-mode.el --- octave-1.1.0/doinstall.sh100777 415 17 13457 5647655304 13537 0ustar jweusers#!/bin/sh # # doinstall.sh -- install script for binary distributions. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin # ask octave to tell us the version number version=`./octave -v 2>/dev/null | awk '/version/ { print $NF }'` if test -z "$version" then echo "doinstall.sh: unable to extract version number from Octave!" exit 1 fi # ask octave to tell us the target host type target_host_type=`echo computer | ./octave -q` if test -z "$target_host_type" then echo "doinstall.sh: unable to extract host type from Octave!" exit 1 fi # ==================== Where To Install Things ==================== # The default location for installation. Everything is placed in # subdirectories of this directory. The default values for many of # the variables below are expressed in terms of this one, so you may # not need to change them. This defaults to /usr/local. prefix=/usr/local prefix="/usr/local" if test $# -eq 1 then prefix=$1 else if test $# -gt 1 then echo "usage: doinstall.sh [prefix-directory]" exit 1 fi fi # Like `prefix', but used for architecture-specific files. exec_prefix="$prefix" # Where to install Octave and other binaries that people will want to # run directly. bindir="$exec_prefix/bin" # Where to install architecture-independent data files. ${fcnfiledir} # and ${localfcnfiledir} are subdirectories of this. datadir="$prefix/lib" # Where to install and expect libraries like libcruft.a, liboctave.a, # and libreadline.a, executable files to be run by Octave rather than # directly by users, and other architecture-dependent data. # ${archlibdir} is a subdirectory of this. libdir="$exec_prefix/lib" # Where to install Octave's include files. The default is # ${prefix}/include/octave includedir="$prefix/include/octave" # Where to install Octave's man pages, and what extension they should # have. The default is ${prefix}/man/man1 mandir="$prefix/man/man1" manext="1" # Where to install and expect the info files describing Octave.. infodir="$prefix/info" # ==================== Octave-specific directories ==================== # These variables hold the values Octave will actually use. They are # based on the values of the standard Make variables above. # Where to install the function file distributed with # Octave. This includes the Octave version, so that the # function files for different versions of Octave will install # themselves in separate directories. fcnfiledir="$datadir/octave/$version/m" # Directories Octave should search for function files specific # to this site (i.e. customizations), before consulting # ${fcnfiledir}. This should be a colon-separated list of # directories. localfcnfiledir="$datadir/octave/site/m" localfcnfilepath="$localfcnfiledir//" # Where to put executables to be run by Octave rather than # the user. This path usually includes the Octave version # and configuration name, so that multiple configurations # for multiple versions of Octave may be installed at once. archlibdir="$libdir/octave/$version/exec/$target_host_type" # Where to put object files that will by dynamically loaded. # This path usually includes the Octave version and configuration # name, so that multiple configurations for multiple versions of # Octave may be installed at once. octfiledir="$libdir/octave/$version/oct/$target_host_type" # Directories Octave should search for object files that will be # dynamically loaded and that are specific to this site # (i.e. customizations), before consulting ${octfiledir}. This should # be a colon-separated list of directories. localoctfiledir="$datadir/octave/site/oct/$target_host_type" localoctfilepath="$localoctfiledir//" # Where Octave will search to find its function files. Before # changing this, check to see if your purpose wouldn't # better be served by changing localfcnfilepath. This # should be a colon-separated list of directories. fcnfilepath=".:$localoctfilepath:$localfcnfilepath:$octfiledir//:$fcnfiledir//" # Where Octave will search to find image files. imagedir="$datadir/octave/$version/imagelib" imagepath=".:$imagedir//" cat << EOF Installing octave in subdirectories of $prefix. Binaries: $bindir Function files: $fcnfiledir Demo images: $imagedir Info files: $infodir Man page: $mandir EOF DIRS_TO_MAKE="$bindir $datadir $libdir $includedir $mandir $infodir \ $fcnfiledir $archlibdir $octfiledir $imagedir \ $localfcnfiledir $localoctfiledir" ./mkinstalldirs $DIRS_TO_MAKE chmod 755 $DIRS_TO_MAKE if test "$prefix" = /usr/local then echo "installing ./octave as $bindir/octave" cp octave $bindir/octave chmod 755 $bindir/octave else echo "installing octave.sh as $bindir/octave" sed "s|@OCTAVE_HOME@|$prefix|" octave.sh > octave.tmp cp octave.tmp $bindir/octave chmod 755 $bindir/octave echo "installing ./octave as $bindir/octave.bin" cp octave $bindir/octave.bin chmod 755 $bindir/octave.bin fi echo "installing octtopnm as $archlibdir/octtopnm" cp octtopnm $archlibdir/octtopnm chmod 755 $archlibdir/octtopnm echo "installing octave-bug as $bindir/octave-bug" cp octave-bug $bindir/octave-bug chmod 755 $bindir/octave-bug echo "installing function files in $fcnfiledir" ( cd scripts ../mkinstalldirs `find . -type d | sed -e 's,^\./,,' -e "s,^,$fcnfiledir/,"` for f in `find . -name '*.m' -o -name octaverc` do cp $f $fcnfiledir/$f chmod 644 $fcnfiledir/$f done ) echo "installing image files in $imagedir" ( cd scripts for f in `find . -name '*.img'` do file=`basename $f` cp $f $imagedir/$file chmod 644 $imagedir/$file done ) echo "installing info files in $infodir" for f in doc/octave.info* do file=`basename $f` cp $f $infodir/$file chmod 644 $infodir/$file done echo "installing man page in $mandir" cp doc/octave.1 $mandir/octave.$manext chmod 644 $mandir/octave.$manext exit 0 octave-1.1.0/mkinstalldirs100777 415 17 1211 5647324350 13750 0ustar jweusers#!/bin/sh # mkinstalldirs --- make directory hierarchy # Author: Noah Friedman # Created: 1993-05-16 # Last modified: 1994-03-25 # Public domain errstatus=0 for file in ${1+"$@"} ; do set fnord `echo ":$file" | sed -ne 's/^:\//#/;s/^://;s/\// /g;s/^#/\//;p'` shift pathcomp= for d in ${1+"$@"} ; do pathcomp="$pathcomp$d" case "$pathcomp" in -* ) pathcomp=./$pathcomp ;; esac if test ! -d "$pathcomp"; then echo "mkdir $pathcomp" 1>&2 mkdir "$pathcomp" || errstatus=$? fi pathcomp="$pathcomp/" done done exit $errstatus # mkinstalldirs ends here octave-1.1.0/config.h.in100666 415 17 17322 5674227643 13226 0ustar jweusers/* config.h.in. Generated automatically from configure.in by autoheader. */ /* Define if on AIX 3. System headers sometimes define this. We just want to avoid a redefinition error message. */ #ifndef _ALL_SOURCE #undef _ALL_SOURCE #endif /* Define if using alloca.c. */ #undef C_ALLOCA /* Define to empty if the keyword does not work. */ #undef const /* Define to one of _getb67, GETB67, getb67 for Cray-2 and Cray-YMP systems. This function is required for alloca.c support on those systems. */ #undef CRAY_STACKSEG_END /* Define if you have alloca, as a function or macro. */ #undef HAVE_ALLOCA /* Define if you have and it should be used (not on Ultrix). */ #undef HAVE_ALLOCA_H /* Define if you have the strftime function. */ #undef HAVE_STRFTIME /* Define if on MINIX. */ #undef _MINIX /* Define if the system does not provide POSIX.1 features except with this defined. */ #undef _POSIX_1_SOURCE /* Define if you need to in order for stat and other things to work. */ #undef _POSIX_SOURCE /* Define as the return type of signal handlers (int or void). */ #undef RETSIGTYPE /* Define if the setvbuf function takes the buffering type as its second argument and the buffer pointer as the third, as on System V before release 3. */ #undef SETVBUF_REVERSED /* If using the C implementation of alloca, define if you know the direction of stack growth for your system; otherwise it will be automatically deduced at run-time. STACK_DIRECTION > 0 => grows toward higher addresses STACK_DIRECTION < 0 => grows toward lower addresses STACK_DIRECTION = 0 => direction of growth unknown */ #undef STACK_DIRECTION /* Define if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define if `sys_siglist' is declared by . */ #undef SYS_SIGLIST_DECLARED /* Define if you can safely include both and . */ #undef TIME_WITH_SYS_TIME /* Define if your declares struct tm. */ #undef TM_IN_SYS_TIME /* Define if your processor stores words with the most significant byte first (like Motorola and SPARC, unlike Intel and VAX). */ #undef WORDS_BIGENDIAN /* Define if you don't have acosh(). */ #undef ACOSH_MISSING /* Define if you don't have asinh(). */ #undef ASINH_MISSING /* Define if you don't have atanh(). */ #undef ATANH_MISSING /* Define if your math.h declares struct exception for matherr() */ #undef EXCEPTION_IN_MATH /* Define if your Fortran compiler appends an underscore to external names. */ #undef F77_APPEND_UNDERSCORE /* Define if you don't have FSQP. */ #undef FSQP_MISSING /* Define if you have sgtty.h. */ #undef HAVE_SGTTY_H /* Define if your system has a sys_siglist variable. */ #undef HAVE_SYS_SIGLIST /* Define if your system stores doubles in IEEE format with the most significant byte first. */ #undef IEEE_BIG_ENDIAN /* Define if your system stores doubles in IEEE format with the least significant byte first. */ #undef IEEE_LITTLE_ENDIAN /* Define if you don't have NPSOL. */ #undef NPSOL_MISSING /* Define to compile smaller kernel. Only works if some form of dynamic linking is also supported and used. */ #undef OCTAVE_LITE /* Define if this is Octave. */ #undef OCTAVE_SOURCE /* Define if you don't have QPSOL. */ #undef QPSOL_MISSING /* Define if math.h declares signgam. */ #undef SIGNGAM_DECLARED /* To quiet autoheader. */ #undef SMART_PUTENV /* Define if using dld for dynamic linking of object files. */ #undef WITH_DLD /* Define if your system stores doubles in the VAX D format. */ #undef VAX_D_FLOAT /* Define if your system stores doubles in the VAX G format. */ #undef VAX_G_FLOAT /* The number of bytes in a int. */ #undef SIZEOF_INT /* The number of bytes in a long. */ #undef SIZEOF_LONG /* The number of bytes in a short. */ #undef SIZEOF_SHORT /* Define if you have the atexit function. */ #undef HAVE_ATEXIT /* Define if you have the bcopy function. */ #undef HAVE_BCOPY /* Define if you have the bzero function. */ #undef HAVE_BZERO /* Define if you have the erf function. */ #undef HAVE_ERF /* Define if you have the erfc function. */ #undef HAVE_ERFC /* Define if you have the finite function. */ #undef HAVE_FINITE /* Define if you have the getcwd function. */ #undef HAVE_GETCWD /* Define if you have the gethostname function. */ #undef HAVE_GETHOSTNAME /* Define if you have the getrusage function. */ #undef HAVE_GETRUSAGE /* Define if you have the gettimeofday function. */ #undef HAVE_GETTIMEOFDAY /* Define if you have the infinity function. */ #undef HAVE_INFINITY /* Define if you have the isinf function. */ #undef HAVE_ISINF /* Define if you have the isnan function. */ #undef HAVE_ISNAN /* Define if you have the lgamma function. */ #undef HAVE_LGAMMA /* Define if you have the memmove function. */ #undef HAVE_MEMMOVE /* Define if you have the on_exit function. */ #undef HAVE_ON_EXIT /* Define if you have the putenv function. */ #undef HAVE_PUTENV /* Define if you have the quiet_nan function. */ #undef HAVE_QUIET_NAN /* Define if you have the rindex function. */ #undef HAVE_RINDEX /* Define if you have the setvbuf function. */ #undef HAVE_SETVBUF /* Define if you have the strcasecmp function. */ #undef HAVE_STRCASECMP /* Define if you have the strerror function. */ #undef HAVE_STRERROR /* Define if you have the stricmp function. */ #undef HAVE_STRICMP /* Define if you have the strncasecmp function. */ #undef HAVE_STRNCASECMP /* Define if you have the strnicmp function. */ #undef HAVE_STRNICMP /* Define if you have the tempnam function. */ #undef HAVE_TEMPNAM /* Define if you have the vfprintf function. */ #undef HAVE_VFPRINTF /* Define if you have the vsprintf function. */ #undef HAVE_VSPRINTF /* Define if you have the header file. */ #undef HAVE_ASSERT_H /* Define if you have the header file. */ #undef HAVE_DIRENT_H /* Define if you have the header file. */ #undef HAVE_FLOAT_H /* Define if you have the header file. */ #undef HAVE_FLOATINGPOINT_H /* Define if you have the header file. */ #undef HAVE_LIMITS_H /* Define if you have the header file. */ #undef HAVE_MEMORY_H /* Define if you have the header file. */ #undef HAVE_NDIR_H /* Define if you have the header file. */ #undef HAVE_PWD_H /* Define if you have the header file. */ #undef HAVE_SGTTY_H /* Define if you have the header file. */ #undef HAVE_STDLIB_H /* Define if you have the header file. */ #undef HAVE_STRING_H /* Define if you have the header file. */ #undef HAVE_SYS_DIR_H /* Define if you have the header file. */ #undef HAVE_SYS_FCNTL_H /* Define if you have the header file. */ #undef HAVE_SYS_NDIR_H /* Define if you have the header file. */ #undef HAVE_SYS_PTEM_H /* Define if you have the header file. */ #undef HAVE_SYS_RESOURCE_H /* Define if you have the header file. */ #undef HAVE_SYS_SELECT_H /* Define if you have the header file. */ #undef HAVE_SYS_TIME_H /* Define if you have the header file. */ #undef HAVE_SYS_TTOLD_H /* Define if you have the header file. */ #undef HAVE_SYS_UTSNAME_H /* Define if you have the header file. */ #undef HAVE_TERMIO_H /* Define if you have the header file. */ #undef HAVE_TERMIOS_H /* Define if you have the header file. */ #undef HAVE_UNISTD_H /* Define if you have the header file. */ #undef HAVE_VARARGS_H /* Define if you have the m library (-lm). */ #undef HAVE_LIBM /* Define if you have the sun library (-lsun). */ #undef HAVE_LIBSUN /* Define if you have the sunmath library (-lsunmath). */ #undef HAVE_LIBSUNMATH octave-1.1.0/acconfig.h100666 415 17 4400 5657027533 13073 0ustar jweusers/* acconfig.h Descriptive text for the C preprocessor macros that are needed by Octave. Leave the following blank line there!! Autoheader needs it. */ /* Define if you don't have acosh(). */ #undef ACOSH_MISSING /* Define if you don't have asinh(). */ #undef ASINH_MISSING /* Define if you don't have atanh(). */ #undef ATANH_MISSING /* Define if your math.h declares struct exception for matherr() */ #undef EXCEPTION_IN_MATH /* Define if your Fortran compiler appends an underscore to external names. */ #undef F77_APPEND_UNDERSCORE /* Define if you don't have FSQP. */ #undef FSQP_MISSING /* Define if you have finite. */ #undef HAVE_FINITE /* Define if you have isinf. */ #undef HAVE_ISINF /* Define if you have isnan. */ #undef HAVE_ISNAN /* Define if you have sgtty.h. */ #undef HAVE_SGTTY_H /* Define if your system has a sys_siglist variable. */ #undef HAVE_SYS_SIGLIST /* Define if you have termios.h. */ #undef HAVE_TERMIOS_H /* Define if you have termio.h. */ #undef HAVE_TERMIO_H /* Define if your system stores doubles in IEEE format with the most significant byte first. */ #undef IEEE_BIG_ENDIAN /* Define if your system stores doubles in IEEE format with the least significant byte first. */ #undef IEEE_LITTLE_ENDIAN /* Define if you don't have NPSOL. */ #undef NPSOL_MISSING /* Define to compile smaller kernel. Only works if some form of dynamic linking is also supported and used. */ #undef OCTAVE_LITE /* Define if this is Octave. */ #undef OCTAVE_SOURCE /* Define if you don't have QPSOL. */ #undef QPSOL_MISSING /* Define to make Octave look for info files and function files in the directory tree as the sources. */ #undef RUN_IN_PLACE /* Define if math.h declares signgam. */ #undef SIGNGAM_DECLARED /* To quiet autoheader. */ #undef SMART_PUTENV /* Define if using dld for dynamic linking of object files. */ #undef WITH_DLD /* Define if your system stores doubles in the VAX D format. */ #undef VAX_D_FLOAT /* Define if your system stores doubles in the VAX G format. */ #undef VAX_G_FLOAT /* Leave that blank line there!! Autoheader needs it. If you're adding to this file, keep in mind: The entries are in sort -df order: alphabetical, case insensitive, ignoring punctuation (such as underscores). */ octave-1.1.0/MAKEINFO.PATCH100777 415 17 17477 5647765337 13202 0ustar jweusersFor the following Texinfo file, \input texinfo @setfilename foo.info @ifinfo @node Top, concept index, (dir), (dir) @top Some text here. @cindex foo-concept @findex foo-function @defindex xx @synindex cp xx @synindex fn xx Some more text here. @cindex bar-concept @findex bar-function @menu * concept index:: * function index:: * xx index:: @end menu @node concept index, function index, Top, Top @chapter concept index @printindex cp @node function index, xx index, concept index, Top @chapter function index @printindex fn @node xx index, , function index, Top @chapter xx index @printindex xx @bye TeX creates three indices with the contents concept index foo-concept function index foo-function xx index bar-concept bar-function but makeinfo version 1.55 creates three indices all with the same contents: concept index bar-concept bar-function function index bar-concept bar-function xx index bar-concept bar-function Here is a patch that will cause makeinfo to behave more like TeX/texinfo.tex. Fri Feb 11 18:53:49 1994 John Eaton (jwe@schoch.che.utexas.edu) * makeinfo.c (INDEX_ALIST): Use two indices, read_index and write_index, instead of just one. (find_index_offset): If a match is found, return index to the current INDEX_ALIST struct, not the index pointing to the list of index entries. (translate_index): Return read_index from the matching INDEX_ALIST. (undefindex): Delete the list of index elements pointed to by read_index from the INDEX_ALIST that matches name. (defindex): Initialize read_index and write_index. (index_add_arg): Add entries to the list pointed to by write_index from the INDEX_ALIST matching name. (index_append): Delete unused function. (cm_synindex): Don't merge indcies, just make the write_index for redirectee the same as the write_index for redirector. *** makeinfo.c.orig Sat May 22 18:29:46 1993 --- makeinfo.c Fri Feb 11 19:02:48 1994 *************** typedef struct index_elt *** 6452,6465 **** int defining_line; /* Line number where this entry was written. */ } INDEX_ELT; ! /* A list of short-names for each index, and the index to that index in our ! index array, the_indices. In addition, for each index, it is remembered ! whether that index is a code index or not. Code indices have @code{} ! inserted around the first word when they are printed with printindex. */ typedef struct { char *name; ! int index; int code; } INDEX_ALIST; --- 6452,6491 ---- int defining_line; /* Line number where this entry was written. */ } INDEX_ELT; ! /* A list of short-names for each index. ! ! There are two indices into the the_indices array. ! ! * read_index is the index that points to the list of index ! entries that we will find if we ask for the list of entries for ! this name. ! ! * write_index is the index that points to the list of index entries ! that we will add new entries to. ! ! Initially, read_index and write index are the same, but the ! @syncodeindex and @synindex commands can change the list we add ! entries to. ! ! For example, after the commands ! ! @cindex foo ! @defindex xx ! @synindex cp xx ! @cindex bar ! ! the cp index will contain the entry `foo', and the new xx ! index will contain the entry `bar'. This is consistent with the ! way texinfo.tex handles the same situation. ! ! In addition, for each index, it is remembered whether that index is ! a code index or not. Code indices have @code{} inserted around the ! first word when they are printed with printindex. */ typedef struct { char *name; ! int read_index; /* index entries for `name' */ ! int write_index; /* store index entries here, @synindex can change it */ int code; } INDEX_ALIST; *************** find_index_offset (name) *** 6523,6529 **** for (i = 0; i < defined_indices; i++) if (name_index_alist[i] && strcmp (name, name_index_alist[i]->name) == 0) ! return (name_index_alist[i]->index); return (-1); } --- 6549,6556 ---- for (i = 0; i < defined_indices; i++) if (name_index_alist[i] && strcmp (name, name_index_alist[i]->name) == 0) ! return i; ! return (-1); } *************** translate_index (name) *** 6548,6554 **** INDEX_ALIST *which = find_index (name); if (which) ! return (which->index); else return (-1); } --- 6575,6581 ---- INDEX_ALIST *which = find_index (name); if (which) ! return (which->read_index); else return (-1); } *************** free_index (index) *** 6580,6586 **** } } ! /* Flush an index by name. */ undefindex (name) char *name; { --- 6607,6614 ---- } } ! /* Flush an index by name. This will delete the list of entries that ! would be written by a @printindex command for this index. */ undefindex (name) char *name; { *************** undefindex (name) *** 6590,6596 **** if (which < 0) return (which); ! i = name_index_alist[which]->index; free_index (the_indices[i]); --- 6618,6624 ---- if (which < 0) return (which); ! i = name_index_alist[which]->read_index; free_index (the_indices[i]); *************** defindex (name, code) *** 6638,6644 **** /* We have a slot. Start assigning. */ name_index_alist[slot] = (INDEX_ALIST *) xmalloc (sizeof (INDEX_ALIST)); name_index_alist[slot]->name = savestring (name); ! name_index_alist[slot]->index = slot; name_index_alist[slot]->code = code; the_indices[slot] = (INDEX_ELT *) NULL; --- 6666,6673 ---- /* We have a slot. Start assigning. */ name_index_alist[slot] = (INDEX_ALIST *) xmalloc (sizeof (INDEX_ALIST)); name_index_alist[slot]->name = savestring (name); ! name_index_alist[slot]->read_index = slot; ! name_index_alist[slot]->write_index = slot; name_index_alist[slot]->code = code; the_indices[slot] = (INDEX_ELT *) NULL; *************** index_add_arg (name) *** 6654,6660 **** tem = find_index (name); ! which = tem ? tem->index : -1; get_rest_of_line (&index_entry); ignore_blank_line (); --- 6683,6689 ---- tem = find_index (name); ! which = tem ? tem->write_index : -1; get_rest_of_line (&index_entry); ignore_blank_line (); *************** gen_defindex (code) *** 6721,6742 **** } } - /* Append LIST2 to LIST1. Return the head of the list. */ - INDEX_ELT * - index_append (head, tail) - INDEX_ELT *head, *tail; - { - register INDEX_ELT *t_head = head; - - if (!t_head) - return (tail); - - while (t_head->next) - t_head = t_head->next; - t_head->next = tail; - return (head); - } - /* Expects 2 args, on the same line. Both are index abbreviations. Make the first one be a synonym for the second one, i.e. make the first one have the same index as the second one. */ --- 6750,6755 ---- *************** cm_synindex () *** 6759,6780 **** } else { ! /* I think that we should let the user make indices synonymous to ! each other without any lossage of info. This means that one can ! say @synindex cp dt anywhere in the file, and things that used to ! be in cp will go into dt. */ ! INDEX_ELT *i1 = the_indices[redirectee], *i2 = the_indices[redirector]; ! ! if (i1 || i2) ! { ! if (i1) ! the_indices[redirectee] = index_append (i1, i2); ! else ! the_indices[redirectee] = index_append (i2, i1); ! } ! ! name_index_alist[redirectee]->index = ! name_index_alist[redirector]->index; } } --- 6772,6779 ---- } else { ! name_index_alist[redirectee]->write_index = ! name_index_alist[redirector]->write_index; } } octave-1.1.0/ChangeLog100666 415 17 352217 5705370332 12767 0ustar jweusersThu Jan 12 15:25:34 1995 John Eaton * Version 1.1.0 released. * octMakefile.in (bin-dist-tar): Ignore errors on strip commands. * src/tree-expr.cc (tree_builtin::eval (int)): Set nargout to 0 when calling function. * doc/Makefile.in (FORMATTED): Add refcard.dvi and refcard.ps so that they are distributed along with the other docs. * octMakefile.in (clean-doc-dist-tar): Delete target. (doc-dist): Depend on doc-dist-tar, not clean-doc-dist-tar. Tue Jan 10 14:29:43 1995 John Eaton * src/help.cc (print_usage): Print warning if symbol isn't found. * src/utils.cc (Fundo_string_escapes): Fix typo in call to print_usage(). * src/octave.cc (Fsystem): Correctly compute exit code. * scripts/miscellaneous/etime.m: Complain if args are not the right length, not if they are. Reverse sense of test for years. Duh. * src/f-find.cc (find_to_fortran_idx): For the case of one output argument, return a row vector if the original argument to find was a row vector. Mon Jan 9 12:57:27 1995 John Eaton * src/lex.l (grab_help_text): Always overwrite help_buf. ({CCHAR}): Don't call grab_help_text() if there is already something in help_buf. Sat Jan 7 12:28:35 1995 John Eaton * configure.in (HOST_CXXFLAGS): New variable to substitute. * Makeconf.in (ALL_CXXFLAGS, UGLY_ALL_CXXFLAGS, BUG_CXXFLAGS): Add $(HOST_CXXFLAGS). Fri Jan 6 13:07:09 1995 John Eaton * scripts/special-matrix/toeplitz.m: Use .' instead of '. Tue Jan 3 18:14:33 1995 John Eaton * test: Rewrite many tests to not run Octave interactively. This makes the log files much more readable. * octMakefile.in (clean-tar): Delete octave-test/npsol directory, not just test/octave.test/npsol.exp. Likewise, add a command for deleting qpsol tests. Mon Jan 2 20:02:10 1995 John Eaton * src/octave.cc (main): Return 0 if error_state is not set. * src/error.cc (error_1): New function. (error): Use it. (parse_error): New function. * src/parse.y: Never call error and yyerror; just use yyerror. (yyerror): Improve logic. Use new parse_error() function so that error_state is always set for a parse error. Don't use ostream::form(). (ABORT_PARSE): Don't call reset parser here. (colon_expr): Don't call yyerror here. An error message is printed by tree_colon_expression::chain() if it fails. Mon Dec 26 20:11:01 1994 John Eaton * src/tree-expr.cc (eval): Only call multi-arg form of eval for object_to_eval if necessary. Fri Dec 23 00:08:08 1994 John Eaton * src/lex.l: Don't increment promptflag anywhere. (eat_continuation): New function. (eat_whitespace): Handle embedded continuations. Return nonzero if whitespace consumed. (handle_close_brace): Don't pass yytext. Do pass flag indicating whether whitespace follows brace. (handle_identifier): Check for next token being `=' here. Pass flag indicating whether whitespace follows identifier. ({SNLCMT}*;{SNLCMT}*): Call eat_whitespace() here. ({IDENT}{S}*): Call eat_continuation() here. (do_comma_insert_check): And here, but put a space back if whitespace is gobbled. (have_continuation, have_ellipsis_continuation): Decrement promptflag here. Wed Dec 21 09:56:49 1994 John Eaton * src/tree-plot.cc (Fclearplot): Send "set nolabel" too. Mon Dec 19 17:50:15 1994 John Eaton * src/tree-plot.h, src/tree-plot.cc (subplot): Rename using to using_clause to avoid new C++ keyword. Rename title and style to match. Fri Dec 16 00:09:01 1994 John Eaton * configure.in: Don't check for fpsetmask. * src/sysdep.cc (sysdep_init): Don't check HAVE_FPSETMASK Thu Dec 15 00:28:52 1994 John Eaton * src/variables.cc (install_builtin_variables) [default_save_format]: Fix doc string. * configure.in: Rework DEFAULT_DOT_O_FROM_DOT_F and DEFAULT_DOT_C_FROM_DOT_F to avoid embedded newlines. * Makeconf.in: Likewise. * src/pager.cc (flush_output_to_pager): Close stream before resetting signal handler. * src/help.cc (Fhelp): Call fcn_file_in_path here. Delete it too. Print file name before help message. * src/variables.cc (get_help_from_file): Don't call fcn_file_in_path here. (gobble_leading_white_space): Correctly grab only first set of comments. Wed Dec 14 11:42:13 1994 John Eaton * src/parse.y (pager_buf): Don't make it a fixed-size array. * src/variables.cc (get_help_from_file): New function. (gobble_leading_white_space): Return first block of comments for later use as help string. (looks_like_octave_copyright): New function. (parse_fcn_file): Stash help from gobble_leading_white_space in global help_buf. * src/lex.l (grab_help_text): Don't overwrite help found by gobble_leading_white_space. (reset_parser): Delete help_buf. * src/help.cc (Fhelp): Only try to get help from symbol records that are defined. If all else fails, try get_help_from_file. * src/pager.cc (flush_output_to_pager): Re-initialize pager_buf immediately after extracting message. Delete message immediately after sending it to the output stream. Ignore interrupts while running pager. * octMakefile.in (clean-tar): Delete npsol.exp and any .m files that are in the test/octave.test directory. (install): Use $(INSTALL), not just install. * src/lex.l (reset_parser): Don't reset input column or line number if reading from a script file or a function file. (is_keyword): Don't set line number to 1 if reading function file or script file. * src/variables.cc (gobble_leading_whitespace): Count lines. * src/octave.cc (main): If reading file, set reading_script_file and curr_fcn_file_name before calling get_input_from_file(). * src/tc-rep.cc (TC_REP::matrix_value): If implicit_str_to_num_ok, convert empty string to empty matrix. Tue Dec 13 20:25:34 1994 Frederick (Rick) A Niles * liboctave/dbleQR.cc, liboctave/dbleQRP.cc, liboctave/CmplxQR.cc, liboctave/CmplxQRP.cc: Get economy-sized dimensions correct. * libcruft/misc/i1mach.f, libcruft/misc/gen-d1mach.c, libcruft/ranlib/ignuin.f: Prevent warnings about variable may be used before defined. Tue Dec 13 11:07:34 1994 John Eaton * src/variables.cc: Change commas_in_literal_matrix to whitespace_in_literal_matrix. * src/user-prefs.h (user_preferences): Likewise. * src/user-prefs.cc (init_user_prefs): Likewise. (whitespace_in_literal_matrix): Likewise, rename function. * src/lex.l: Likewise. (nesting_level): Rename from in_brace_or_paren. ({SNLCMT}*\n{SNLCMT}*): Make separate case from {SNLCMT}*;{SNLCMT}. Check nesting level to decide whether to convert newline to semicolon. ({NL}, {CCHAR}): Check nesting level to decide whether to eat or return newline. ("("): Decrement promptflag. (")"): Increment promptflag. Mon Dec 12 00:02:51 1994 John Eaton * scripts/Makefile.in, scripts/*/Makefile.in (install): Don't depend on all. * octMakefile.in: Put doc dir last. * doc/Makefile.in (dir): New file. (DISTFILES): Distribute dir. (install): Install dir if it does not already exist in $(infodir). Otherwise, print message. * src/lex.l: Handle {IDENT}{S}*/= with yyinput() instead of trailing context. (handle_close_brace): New function. (handle_number): New function. (have_continuation, handle_ellipsis_continuation, handle_string): New functions for handling strings and continuation lines in string constants. (eat_whitespace): New function eliminates need for NEW_MATRIX start state. Sun Dec 11 15:53:03 1994 John Eaton * src/lex.l: Eliminate special case for eating whitespace when start state is . Merge three cases for handling `]' for start state. Fri Dec 9 12:21:35 1994 John Eaton * src/lex.l: Handle `\' as a continuation character too. Allow comments and blanks to follow continuation characters. Improve handling of comments in matrices. Create a few more definitions for patterns. Restructure source. * configure.in: Check for bcopy too. * configure.in (gxx_version): Don't use -fno-implicit-templates on AIX systems with g++ 2.6.x. * octave-bug.in: Check for CC: lines too. Use case-insensitive match for To: and Cc: lines. Actually send file that has header separator stripped. Print list of CC: addresses too. * src/input.cc (get_user_input): If user enters empty string, return empty matrix or empty string. * src/help.cc (Fhelp, Ftype, Fwhich): Don't allow lookup_by_name to execute script files. Thu Dec 8 23:20:02 1994 John Eaton * src/tc-rep.cc (print): Don't check `print', which is not a variable in this context. Wed Dec 7 10:52:59 1994 John Eaton * src/configure.in: Check for fpsetmask. * src/sysdep.cc (sysdep_init): Check HAVE_FPSETMASK. Only call it if either __386BSD__ or __FreeBSD__ is defined. Don't check __386BSD__ as a condition for including floatingpoint.h. Mon Dec 5 12:29:07 1994 John Eaton * src/utils.cc: Update directory header macro names for autoconf 2. * src/dirfns.cc: Likewise. Sun Dec 4 22:00:40 1994 John Eaton * octMakefile.in (DISTFILES): Don't distribute GCC.PATCH, since it is not needed with gcc 2.6.3. * configure.in: Really do disable IEEE floating point functions on the Alpha. Wed Nov 30 11:42:44 1994 John Eaton * doc/FAQ.texi: New file. * doc/Makefile.in: Create info, dvi, and ps files and distribute them. * Makefile.in (all): Expand initial message. Sat Nov 26 21:47:05 1994 John Eaton * src/octave.cc (Fcomputer): Always append ios::ends to ostrstream before returning. Mon Nov 21 09:41:34 1994 John Eaton * src/lex.l: When start state is TEXT_FCN, gobble blanks with pattern that matches only blanks before other patterns that can also match just blanks. Always check whether in_brace_or_paren stack is empty before trying to use it. * src/parse.y (make_multi_val_ret): Call constructor for tree_simple_assignment_expression with correct number of args. * scripts/plot/shg.m: New function. * src/f-qpsol.cc (Fqpsol): Correct for changes in meaning of nargin and the way args is loaded. * src/f-npsol.cc (Fnpsol): Likewise. * scripts/polynomial/roots.m: Return empty matrix for scalar or empty matrix args. * src/tree-plot.cc (gnuplot_terminal_type): New static variable. (Fset): If this is a set term command, set gnuplot_terminal_type. (open_plot_stream): Use gnuplot_terminal_type if it is set. * src/idx-vector.cc (idx_vector::init): Don't check max value of index vector against dimension here. We may need to resize. * src/tc-rep-idx.cc (do_scalar_index): Do check idx-vector max value here. * src/lex.l (is_plot_keyword): Don't set past_plot_range here. Don't accept abbreviations for clear. (handle_identifier): Don't call is_plot_keyword unless plotting. Set past_plot_range here, before checking for plot option keywords. Fri Nov 18 17:25:59 1994 John Eaton * src/data.cc (Fis_struct): New function. Thu Nov 17 18:13:56 1994 John Eaton * octMakefile.in (DISTFILES): Distribute GCC.PATCH. Don't distribute LIBG++.PATCH. * src/tree-plot.cc (Fclearplot): Turn off grid and reset plot_line_count to zero. * configure.in: Check for sys/resource.h. Create scripts/strings/Makefile too. * src/timefns.cc: Surround inclusion of sys/resource.h in extern "C". Only include sys/resource.h if both HAVE_SYS_RESOURCE_H and HAVE_GETRUSAGE are defined. Wed Nov 16 09:26:10 1994 John Eaton * scripts/plot/plot_opt.m: New function. * scripts/plot/semilogx.m, scripts/plot/semilogx.m, scripts/plot/loglog.m, scripts/plot/plot.m: Handle additional args and format strings. * scripts/plot/polar.m: Handle format arg. * scripts/plot/polar_int_1.m, scripts/plot/polar_int_2.m: Extract from polar_int.m. * scripts/plot/plot_int_1.m, scripts/plot/plot_int_2.m: Extract from plot_int.m. * scripts/plot/plot_2_s_s.m, scripts/plot/plot_2_v_v.m, scripts/plot/plot_2_m_m.m, scripts/plot/plot_2_v_m.m, scripts/plot/plot_2_m_v.m: Handle format arg. * scripts/strings/strcmp.m: Move here. * scripts/general/strcmp.m: From here. * src/xdiv.cc (result_ok): Issue warning instead of error if warn is nonzero. Tue Nov 15 15:54:19 1994 John Eaton * src/tree-plot.cc (Fcloseplot): Clear title and labels too. * src/help.cc (keywords): Add entries for all_va_args, unwind_protect, unwind_protect_cleanup, and end_unwind_protect. * liboctave/Makefile.in: Use -include for dependency files. * src/Makefile.in: Likewise. Mon Nov 14 10:28:23 1994 John Eaton * src/tree-misc.cc (convert_to_const_vector): Resize vector before returning. * src/lex.l (plot_style_token): Also allow "steps", "boxes", and "boxerrorbars". * src/parse.y (UNWIND): Rename from UNWIND_PROTECT. (CLEANUP): Rename from UNWIND_PROTECT_CLEANUP. (command): Allow optsep after UNWIND and CLEANUP tokens. * src/lex.l (is_keyword): Use new token names * src/tree-const.h (tree_constant::all_va_args): New enum. (tree_constant (tree_constant::all_va_args t)): New constructor. (is_all_va_args): New function. (is_empty, is_zero_by_zero, make_numeric_or_magic, make_numeric_or_range_or_magic): Handle all_va_args type. * src/tc-rep.h (constant_type::all_va_args): New enum element. (is_all_va_args): New function. * src/tc-rep.cc (TC_REP::tree_constant_rep (TC_REP::constant_type), TC_REP::print_code): Handle all_va_args. * src/tree-misc.cc (tree_argument_list::convert_to_const_vector): Handle all_va_args. * src/tree-expr.cc (tree_index_expression::eval): After call to tree_argument_list::convert_to_const_vector (), check error_state. (tree_simple_assignment_expression::eval): Likewise. (tree_function::octave_all_va_args): New function. * src/parse.y (ALL_VA_ARGS): New token. (arg_list): Handle ALL_VA_ARGS. * src/lex.l (is_keyword): Handle all_va_args. * src/tree-expr.cc (tree_identifier::bump_value): Check read-only status of sym before altering value. (tree_prefix_expression::eval): Check error_state after call to tree_identifier::bump_value (). * src/variables.cc (bind_nargin_and_nargout): Don't make nargin and nargout read only. * scripts/strings: New subdirectory for string functions. * scripts/Makefile.in (SUBDIRS): Add strings. * scripts/strings/strcat.m: New function. Fri Nov 11 14:17:31 1994 John Eaton * src/load-save.cc (extract_keyword): Allow trailing blanks on the input line. Thu Nov 10 09:53:35 1994 John Eaton * scripts/general/reshape.m, scripts/image/ind2gray.m, scripts/image/ind2gray.m, scripts/image/ind2rgb.m, scripts/image/rgb2ind.m: unwind_protect do_fortran_indexing. * scripts/general/strcmp.m: unwind_protect implicit_str_to_num_ok. * scripts/miscellaneous/menu.m: unwind_protect page_screen_output. * src/parse.y (UNWIND_PROTECT, UNWIND_PROTECT_CLEANUP): New tokens. (command): Handle unwind-protect. * src/lex.l (is_keyword): Handle unwind_protect, unwind_protect_cleanup, and end_unwind_protect. * src/tree-cmd.cc (tree_unwind_protect_command): New class, to handle unwind-protect. * src/token.h (end_tok_type): New field, end_unwind_protect. * src/error.cc (verror): Flush pending output to pager here. (error): Not here. * src/tc-rep.cc (force_numeric): Don't jump to top level on error. * src/tc-rep.cc, src/tc-rep-ass.cc, src/tc-rep-idx.cc: Check error_state after calls to make_numeric* functions. * src/f-lpsolve.cc: Define Flp_solve and Flp_solve_options, not Flpsolve or Flpsolve_options. * src/utils.cc (Ffile_in_path): Define Ffile_in_path, not Ffile_in_pat. * src/f-inv.cc: Add DEFUN for inverse. Wed Nov 9 09:30:15 1994 John Eaton * src/load-save.cc (read_mat_file_header): Check for mopt < 0 too. Don't fail if reading mopt fails. (save_mat_binary_data): Handle range data as a special case. (get_default_save_format): Also accept `mat-binary' and `mat_binary'. (Fsave): Add ios::trunc to flags for opening output file. * src/parse.y (func_def2): Stash function name before stashing file name. * src/utils.cc (fcn_file_in_path): Don't append `.m' if the name already ends in `.m'. (oct_file_in_path): Likewise, for `.oct'. * src/error.cc (usage): Set error state to -1, so we get traceback information after a call to usage. * src/tree-expr.cc (stash_fcn_file_name): Store full name of the file. * scripts/*/*.m: Change messages to say `invalid' instead of `illegal', since no laws are being broken by using these functions incorrectly. * src/timefns.cc (Fcputime): New function. * configure.in: Check for getrusage. * src/scripts/miscellaneous/tic.m: New function. * src/scripts/miscellaneous/toc.m: New function. * src/scripts/miscellaneous/etime.m: New function. * src/scripts/miscellaneous/is_leap_year.m: New function. * src/error.cc (Fwarning, Fusage): New functions. * scripts/*/*.m: Use them instead of printing warning and usage messages directly with disp, printf, or fprintf. * src/file-io.cc (close_files): Check Pix before using. (file_count): Delete unnecessary variable. Instead, use DLList::length to get the number of files in the list. * src/sighandlers.cc (install_signal_handlers): Explicitly ignore SIGPOLL and SIGIO. Tue Nov 8 15:26:50 1994 John Eaton * scripts/general/logspace.m: Lose fractional part of third arg. Don't round, for compatibility with Matlab. * scripts/general/linspace.m: Likewise. * liboctave/CMatrix.cc (row_min, row_max, row_min_loc, row_max_loc): Handle case of row containing only real elements. (column_min, column_max, column_min_loc, column_max_loc): Likewise, for columnwise operations. * src/f-minmax.cc (two-complex-arg min, max): Handle case of both columns containing only real elements. * src/variables.cc (Fclear): Pass 0 to symbol_table::list() for pats and npats. Mon Nov 7 20:22:36 1994 John Eaton * liboctave/dColVector.cc (operator +=): Don't return reference to temporary. (operator -=): Likewise. * liboctave/CMatrix.cc (operator +=, operator -=): Likewise. Sun Nov 6 23:15:24 1994 John Eaton * octMakefile.in (DISTSUBDIRS): Don't use $(SUBDIRS) here. * src/load-save.cc (Fsave): Open output file with mode == ios::out, not ios::in. Sat Nov 5 18:18:11 1994 John Eaton * configure.in (HAVE_SYS_SIGLIST): Check for sys_siglist variable, even if it isn't declared in a system header. * acconfig.h (HAVE_SYS_SIGLIST): Add #undef. * src/sighandlers.cc (sys_siglist): Define our own if HAVE_SYS_SIGLIST is not defined, not if SYS_SIGLIST_DECLARED is not defined. * src/tree-plot.cc (Fclearplot): New function. (clg): Alias for clearplot. * src/parse.y (CLEAR): New token. (statement): Handle PLOT CLEAR as a special case. * src/lex.l (is_plot_keyword): Handle CLEAR here too. Fri Nov 4 08:44:57 1994 John Eaton * All: Remove remaining #pragma interface/implementation statements. * src/tree-plot.cc (subplot): Move actual code here from .h file. * src/tree-expr.cc (tree_expression): Declare destructor virtual. Delete unnecessary destructors. * src/SLStack.h, src/SLStack.cc (operator =): Return reference to SLStack, not void. * src/f-qzval.cc (Fqzval): Rename from Fqzvalue. Change Help and usage messages too. * scripts/plot/plot_int.m: Really figure out if there are any imaginary parts. * scripts/control/are.m: Fix typo. Thu Nov 3 18:44:11 1994 John Eaton * src/load-save.cc (save_ascii_data): Handle new arg, strip_nan_and_inf. Change callers. (strip_infnan): New functions. (save_three_d): Strip inf and nan values here too. * src/tree-plot.h (subplot_using): New data have_values and val. * src/tree-plot.cc (subplot_using::eval, subplot_using::values): New functions. (subplot_style::errorbars): New function. (subplot::extract_plot_data, subplot::handle_plot_data): New functions. (subplot::print): Improve handling of data. Wed Nov 2 08:11:08 1994 John Eaton * src/file-io.cc (do_scanf): If reading from stdin, flush stdout first. * configure.in: Leave some comments in the configure file. Improve checking for termios.h, termio.h, and sgtty.h. * src/variables.cc (install_builtin_variables): DEFVAR realmax and realmin here. * src/sysdep.cc: Instead of DEFUNing them here. * src/variables.cc (do_who): Accept globbing patterns as args. (maybe_list): Handle them here. * src/symtab.cc (matches_patterns): New function. (symbol_table::list, symbol_table::long_list): Accept list of patterns, and use matches_patterns to see if the given string is a match. Change all callers. * src/load-save.cc (read_binary_data): Don't fail if reading name_len fails. (do_load): Quit quietly if nothing is left to read. Clean up doc and name in all cases. Tue Nov 1 16:34:20 1994 John Eaton * src/lex.l (")"): Set cant_be_identifier to 1 here too. * src/tree-plot.cc: Use abbreviations for gnpulot plot, splot, replot, with, using, and title commands. Mon Oct 31 14:26:12 1994 John Eaton * src/variables.cc (Fclear): Look in global symbol table for user-defined function names. * src/load-save.cc (do_load): New function. (Fload): Use it to avoid assigning streams. (write_binary_header): New function. (save_vars): New function. (Fsave): Use it to avoid assigning streams. * libcruft/linpack/zgesl.f (zgesl): Comment out unused varialbes and statement functions. * src/sysdep.cc (Fisieee): New function. (Frealmax, Frealmin): Ditto. * scripts/miscellaneous/version.m: New file. Fri Oct 28 14:52:08 1994 John Eaton * octMakefile.in (distclean): Also delete config.cache and config.log. * Makeconf.in (CPPFLAGS): Allow substitution. * configure.in: Use AC_PREFIX_DEFAULT. * configure.in: Use AC_CANONICAL_HOST instead of doing this ourselves. * install-sh: Rename from install.sh. * octMakefile.in (DISTFILES): Distribute install-sh, not install.sh. Mon Oct 24 10:04:27 1994 John Eaton * octave-bug.in: Print message if bug report appears to have been mailed successfully. Otherwise, exit with error status. Fri Oct 21 14:05:10 1994 John Eaton * src/tc-rep-ass.cc (TC_REP::do_vector_assign (rhs, idx-vector)): Handle all four cases of row/colum mixing. Report an error if the RHS is a matrix. * src/tc-rep-idx.cc (TC_REP::do_index): Don't barf on indexing an empty matrix with colon(s). (TC_REP::do_scalar_index): Create index vector with z_len = 1. (TC_REP::do_matrix_index (Range, tree_constant)): Correctly handle case of colon as second arg. * octave-bug.in: Put mail commands in subshells so error message really do go away. Thu Oct 20 11:05:36 1994 John Eaton * octave-bug.in: If passing $SUBJECT on the command line to a mailer, quote it. Don't assume /bin/mail takes any args other than a recipient address. Do the right thing if the To: line changes. * src/tc-rep.cc (TC_REP::rows, TC_REP::columns): Return -1 for anything that doesn't really have rows or columns. * src/tc-rep-idx.cc (fortran_style_matrix_index): Check max and min index values. * Makefile.in (FORCE): New phony target. Used instead of .PHONY to be portable. * octave-bug.in: Try harder to mail the message. * src/dynamic-ld.cc: Undefine true, false, and boolean after including kpathse/pathsearch.h. * src/sysdep.cc: Include . Wed Oct 19 10:28:49 1994 John Eaton * configure.in (CXXLIB_LIST, FLIB_LIST, CXXLIB_PATH, FLIB_PATH): Be careful not to match -l or -L in the middle of a word. * src/f-minmax.cc: Correctly handle mixed scalar/matrix args. * octMakefile.in: Rename from Makefile.in. * Makefile.in: New file. For `all' target, print message and execute make again using octMakefile. For other targets, just execute make again using octMakefile. * configure.in: Check for sys_siglist. * src/sighandlers.h [! HAVE_SYS_SIGLIST]: Provide an external declaration. * src/sighandlers.cc (generic_sig_handler): New function, replaces most individual signal handler functions. (sigint_handler, sigpipe_handler): Restore signal handler before doing anything else. [! HAVE_SYS_SIGLIST] (sys_siglist): Provide our own definition. * config.guess: Update from FSF sources. Tue Oct 18 23:36:24 1994 John Eaton * flibs.sh: Don't pass -Y P,path. Instead, turn it into a series of -L dir args. * configure.in: Update for autoconf 2.0. Delete support for --enable-run-in-place (it is too hard to make this work reliably...). Mon Oct 17 11:40:49 1994 John Eaton * src/user-prefs.cc (init_user_prefs): Declare to return void, not int. * configure.in: Change quote characters around tr command. Some systems actually do need the []'s for ranges... Sun Oct 16 12:22:14 1994 John Eaton * src/tempname.c, src/tmpnam.c: New files. * src/Makefile.in (SOURCES): Add them. * src/dirfns.cc: Delete functions extracted from glibc. * configure.in (localfcnfiledir, localoctfiledir, imagedir): New variables. Use them to define localfcnfilepath, localoctfilepath, and imagepath. * Makeconf.in: Substitute them here. * src/utils.cc (get_fcn_file_names) [WITH_DLD]: Also match .oct files. * dld/find_exec.c (dld_find_executable): Don't be fooled by directories or other special files in PATH. (ABSOLUTE_FILENAME_P): Also return true if the name includes a `/'. This isn't necessarily an absolute path, but we will turn it into one later. * src/dynamic-ld.cc (octave_dld_init): Call make_absolute() on value returned from dld_find_executable(). Sat Oct 15 08:35:13 1994 John Eaton * flibs.sh: Undo previous change. Only substitute spaces for commas if it looks like we have output from xlf. Handle -Y and LD_RUN_PATH using gcc's -Xlinker option. * Makefile.in (snapshot-version): Use move-if-change for version.h. Fri Oct 14 09:18:08 1994 John Eaton * scripts/image/Makefile.in (SOURCES): Don't forget octtopnm.c. * Makefile.in (BINDISTFILES): Distribute octave-bug too. * configure.in (imagepath): Install at same level as fcnfiledir, not below it. * doinstall.sh: Correctly extract version numbers that are not all digits. Also install images too. Also install octaverc. Ask octave for the target host type. Also create site/m and site/oct directories. Also install octave-bug. * scripts/image/Makefile.in (DISTFILES): Distribute demo image files too. * doinstall.sh: Update for new directory organization. * src/variables.cc (subst_octave_home): Make it work for multiple substitutions. * flibs.sh: Handle -Y P,path:of:lib:dirs output from f77 on Solaris. * src/strfns.cc (Ftoascii): New file, new function. (Fisstr, Fsetstr): Move here, fromd ata.cc. * src/Makefile.in (SOURCES): Include it. Thu Oct 13 11:58:03 1994 John Eaton * scripts/signal/filter.m: Postpad `b' before reshaping. * mkinstalldirs: New file. * Makefile.in: Distribute it, don't make mkpath. * All Makefile.in files: Use it instead of mkpath. * src/utils.cc (Foctave_tmp_file): New function. * src/utils.cc (undo_string_escape): Move here from tc-rep.cc, rename from undo_string_escapes, and make extern. (undo_string_escapes): New function, for undoing a whole string. (Fundo_string_escapes): New function. * scripts/miscellaneous/dump_prefs.m, scripts/miscellaneous/dump_1_pref.m: New functions. * scripts/miscellaneous/bug_report.m: Record user preferences in a file and pass the name of the file to octave-bug. Use octave_tmp_file to generate tmp file name. * octave-bug.in: Accept a final file-name arg as a file that contains a list of user-preferences. Wed Oct 12 09:09:37 1994 John Eaton * configure.in: Redefine archlibdir and octfiledir so that oct and exec directories are at the same level as the m directory. Redefine localoctfilepath so that site/oct is a the same level as site/m. * Makeconf.in (F77): Substitute it. (BUG_CFLAGS, BUG_CXXFLAGS): New vars. * configure.in: * scripts/bug_report.m: New file. * octave-bug.in: New file. * Makefile.in (DISTFILES): Distribute octave-bug.in. (dirs_to_make): Add $bindir. (all): Add octave-bug. (octave-bug): New target. (install): Install it. * src/defaults.h.in: Add defines for bindir. * src/Makefile.in (defaults.h): Substitute it. * src/variables.cc (octave_bin_dir): New function. * src/octave.cc (initialize_globals): Also add $bindir to path. * configure.in: Check for gettimeofday. Add AC_TIME_WITH_SYS_TIME. * src/systime.h: New file. * src/timefns.h: Use gettimeofday if available. * src/Makefile.in (INCLUDES): Add systime.h. Mon Oct 10 14:34:56 1994 John Eaton * src/octave.cc (verbose_flag): New global variable. (long_opts): Add "verbose". (usage_string): Update. (main): Set verbose_flag if given --verbose. (execute_startup_files): Don't print messages about reading startup files if verbose_flag is not set. * src/tree-expr.cc (apply_mapper_fcn): Handle scalars as a special case, but then just try to convert other arg types to a matrix. * src/f-det.cc (Fdet): Check if arg is complex type, but not necessarily a complex matrix. * src/f-schur.cc (Fschur): Likewise, and also for real types. * src/f-lu.cc (Flu): Likewise. * src/f-minmax.cc (Fmin, Fmax): Likewise. Sun Oct 9 21:04:17 1994 John Eaton * src/tc-rep-ass.cc (TC_REP::assign): If LHS is undefined, don't try to force it to be a numeric type. Fri Oct 7 09:05:10 1994 John Eaton * configure.in: Define LD_STATIC_FLAG for Alpha OSF/1 1.3 systems. * src/tc-rep-idx.cc (TC_REP::do_index): Only work for numeric types, but don't panic if conversion doesn't work. * src/tc-rep-ass.cc (TC_REP::assign): Likewise. * src/tc-rep.cc (TC_REP::gripe_wrong_type_arg): New function. * src/gripes.cc (gripe_wrong_type_arg): Define here. * src/tree-const.cc: Not here. Wed Oct 5 16:24:38 1994 John Eaton * src/file-io.cc (do_scanf): Don't panic if string is NULL. * src/gripes.cc (gripe_unrecognized_float_fmt): New function. (gripe_2_or_3_dim_plot): Ditto. (gripe_unrecognized_data_fmt): Ditto. (gripe_data_conversion): Ditto. Use it in load-save.cc data conversion routines that aren't implemented yet. * src/load-save.cc (do_double_format_conversion): Don't panic on unrecognized floating point formats. (do_float_format_conversion): Likewise. (write_doubles): Don't panic if data format is unrecognized. (do_save): Likewise (install_loaded_variable): Don't panic for unknown symbol types. (read_binary_data): Also check error_state after calls to read_doubles. * src/symtab.cc (symbol_table::rename): Don't panic if symbol can't be renamed. * src/parse.y (return_list): Abort parse if renaming results in an error. * src/tree-misc.cc (tree_if_command::eval): Don't panic if all (all (cond)) is not a scalar. * src/tree-expr.cc (tree_unary_expression::print_code): Don't panic if expression type is unknown. * src/tree-plot.cc (tree_plot_command::eval): Don't panic if plot is not 2 or 3 dimensional. (tree_plot_command::print_code, subplot::print, save_in_tmp_file): Likewise. * src/variables.cc (alias_builtin): Panic with better message. (subst_octave_home): Don't panic if OCTAVE_HOME doesn't contain OCTAVE_PREFIX. * src/tc-inlines.h (REP_RHS_MATRIX): Use panic_impossible() instead of abort(). (REP_ELEM_ASSIGN, CRMATRIX): Likewise. * src/data.cc (Fdiag, make_diag): Do work here. * src/tc-rep.cc (TC_REP::diag, make_diag): Not here. * src/tc-rep.h (TC_REP::diag): Delete. * src/tree-const.h (tree_constant::diag): Delete. Tue Oct 4 08:35:37 1994 John Eaton * src/f-fft.cc (Ffft): Correctly set n_points for row vectors if nargin == 1. * src/f-ifft.cc (Fifft): Likewise. * src/load-save.cc (Fsave): Declare file and stream static. Mon Oct 3 10:40:50 1994 John Eaton * src/tree-expr.cc (octave_va_arg): Correct arg count and index to match recent change to arg passing/nargin. (define_param_list): Always set num_named_args = param_list->length (). * readline/Makefile.in (install): Don't install libreadline.a by default. (uninstall): Now no need to delete it. * configure.in (localfcnfilepath, localoctfilepath): Change to match organization of system fcn and oct files, and enable recursive searching in both. Enable recursive searching in $(octfiledir). (includedir): Change to $(prefix)/include/octave. Sun Oct 2 10:14:18 1994 John Eaton * configure.in: For now, disable IEEE floating point functions on the Alpha. This is braindead, but at least prevents divide by zero crashes... * src/file-io.cc (fseek_internal): Use values for origin that match what we use to define SEEK_SET, SEEK_CUR, and SEEK_END in variables.cc. * dld: Merge various changes for Linux from dld 3.2.4 that is being distributed with jacal. * src/file-io.cc (fwrite_internal): Correct indexing of args. * src/tree-expr.cc (apply_mapper_fcn): New function. (tree_builtin::eval): Use it instead of tree_constant::mapper(). * src/tree-const.h (tree_constant::mapper): Delete. * src/tc-rep.cc, src/tc-rep.h (TC_REP::mapper): Delete. * src/data.cc (Fcumprod, Fcumsum, Fprod, Fsum, Fsumsq): Do work here. * src/tc-rep.cc (TC_REP::cumprod, TC_REP::cumsum, TC_REP::prod, TC_REP::sum, TC_REP::sumsq): Not here. Delete. * src/tc-rep.h (TC_REP::cumprod, TC_REP::cumsum, TC_REP::prod, TC_REP::sum, TC_REP::sumsq): Delete * src/tree-const.h (tree_constant::cumprod, tree_constant::cumsum, tree_constant::prod, tree_constant::sum, tree_constant::sumsq): Delete. * tree-const.h: Don't check gcc minor version number. * tc-rep.h: Likewise. * src/file-io.h (class file_info): Declare here. * src/file-io.cc: Not here. * configure.in (LIBOCTDLD, LIBDLD): Remove ../ prefix. * Makefile.in (distclean, realclean): Don't remove *.a. * src/Makefile.in (OCTAVE_LIBS): Correct directory spec for libs. Build, install, and clean liboctdld.a, not ../liboctdld.a. * dld/Makefile.in: Build, install, and clean libdld.a, not ../libdld.a. * info/Makefile.in: Likewise, for libinfo.a. * kpathsea/Makefile.in: Likewise, for libkpathsea.a. * libcruft/Makefile.in: Likewise, for libcruft.a. * liboctave/Makefile.in: Likewise, for liboctave.a. * readline/Makefile.in: Likewise, for libreadline.a. * configure.in (gxx_version): Require 2.6.x or later. Don't define EXTERNAL_TEMPLATES. Do define NO_IMPLICIT_TEMPLATES. * liboctave/Array-C.cc, liboctave/Array-d.cc, src/Array-tc.cc, src/DLList-fi.cc src/SLStack-tok.cc, src/SLStack-ue.cc, src/SLStack-tm.cc, src/SLStack-pc.cc, src/SLStack-i.cc, src/SLList-tc.cc, src/SLStack-sym.cc, src/SLStack-ui.cc, src/SLList-misc.cc, src/SLList-expr.cc, src/SLList-plot.cc, src/Map-tc.cc: New files. Instantiate templates here. * libocave/Array.cc, src/Map.cc, src/Stack.cc, src/SLStack.cc: Not here. Remove #pragma implementation hack. * liboctave/Array.h, src/Stack.h, src/Map.h, src/SLStack.h: Remove #pragma interface hack. * Makeconf.in: Substitute NO_IMPLICIT_TEMPLATES, not EXTERNAL_TEMPLATES. (ALL_CXX_FLAGS, UGLY_ALL_CXX_FLAGS): Use $(NO_IMPLICIT_TEMPLATES), not $(EXTERNAL_TEMPLATES). * acconfig.h: Remove USE_EXTERNAL_TEMPLATES #undef. * src/Makefile.in (XALL_CXX_FLAGS): Delete -fno-implicit-templates. (TI_SRC, TI_OBJ): New variables. (libtinst.a): New target. * liboctave/Makefile.in (TI_SRC): New variable. (SOURCES): Add it to list. Fri Sep 30 09:52:15 1994 John Eaton * src/Makefile.in: Automatically generate more lists. Use := in more places. * src/Array-C.cc src/Array-d.cc src/Array-tc.cc src/Map-tc.cc src/Stack-i.cc src/SLStack-pc.cc src/SLStack-sym.cc src/SLStack-tok.cc src/SLStack-tm.cc src/SLStack-ue.cc: New template instantiation files. * configure.in: If using gcc 2.6.x or later, use -fno-implicit-templates instead of -fexternal-templates. * src/tc-inlines.h: Rename from tc-inlines.cc. * src/parse.y (looking_at_indirect_ref): New global flag, for parser feedback. (tree_indirect_ref_type): New token type. (TEXT_ID): New token. (indirect_ref): New non-terminal. (make_index_expression): New function. (variable): Use it to build variable from indirect_ref, not just identifier. * src/lex.l (handle_identifier): Handle identifiers differently if looking at an indirect reference. Add `.' to list of other ops. * src/tree-expr.cc (tree_identifier::do_lookup): Handle new exec_script arg. (tree_identifier::assign): New functions for assignment to a strucutre element. (print_constant): New function. (tree_identifier::eval, tree_indirect_ref::eval): Use it. ( * src/tree-expr.h (tree_indirect_ref): New class for handling structure references. (tree_expression::is_indirect_ref): New virtual function. (tree_fvc::lookup_map_element): New virtual function. (tree_index_expression, tree_simple_assignment_expression): Add new constructors for handling indirect references. * src/oct-map.h: New file, for class managing Octave's structure/map type. * src/tree-misc.cc (tree_global::eval): Don't allow individual structure elements to be tagged global. * src/tc-rep.h (tree_constant_rep): Add new field, a_map, and a new type_tag, map_constant. * src/tree-const.cc (tree_constant::is_map): New function. * src/tree-const.cc (tree_constant::map_value, tree_constant::assign_map_element, tree_constant::make_unique, tree_constant::lookup_map_element, tree_constant::make_unique_map_element): New functions. * src/Map.h (CHNode::CHNode): Copy key. (CHNode::~CHNode): Delete it. (CHMap::contents): Don't declare return value const. * src/tc-inlines.cc: Move some macros here from tc-rep.cc so they can appear in one place and be shared by tc-rep-idx.cc, tc-rep-ass.cc, and tc-pre.cc. * src/tc-rep-idx.cc, src/tc-rep-ass.cc: New files, extracted from tc-rep.cc to make compilation of tc-rep stuff faster and require less memory. * src/variables.cc (Fwhos): Correctly insert "-long" into arg list for Fwho. Mon Sep 26 12:59:55 1994 John Eaton * test/Makefile.in (OCTAVE_SCRIPT_PATH): Append `//' for recursive searching. Fri Sep 23 07:53:13 1994 John Eaton * scripts/plot/bar.m: Don't return values if nargout == 0. * scripts/plot/hist.m: Likewise. * scripts/plot/stairs.m: Likewise. * src/tree-plot.cc (Fishold): New function. (plot_line_count, parametric_plot, clear_before_plotting): Declare static. * src/f-fft.cc (Ffft): Handle row vector as a special case. * src/f-ifft.cc (Fifft): Ditto. Thu Sep 22 13:20:53 1994 John Eaton * src/help.cc (print_symbol_type): New function, extracted from Fwhich. (Fwhich): Use it. (Fhelp): Use it to print type info before help message. * src/dynamic-ld.cc: Hide all DLD-specific functions behind #ifdef WITH_DLD. * scripts/startup: New directory. * scripts/startup/Makefile.in: New file. * scripts/startup/octaverc: New file. Don't overwrite existing file when nstalling. * configure.in: Generate Makefile in scripts/startup. * scripts/Makefile.in (SUBDIRS): Add startup. * src/defaults.h.in (OCTAVE_STARTUPFILEDIR): New macro. * src/variables.cc (get_site_defaults): Look for octaverc in OCTAVE_STARTUPFILEDIR. * configure.in (fcnfiledir): Make it end in `//'. * src/error.cc (Ferror): Correct indexing error. * src/Map.h, src/Map.cc: New files implementing associative arrays. * src/Makefile.in: Include them in the list of files to distribute and compile. Wed Sep 21 09:50:19 1994 John Eaton * Makefile.in (DISTSUBDIRS): Add dld to the list. * scripts/plot/hist.m: New function file. * src/tc-rep.cc (TC_REP::do_matrix_index (tree_constant, tree_constant): For case of scalar as first arg, move call to index check to the TC_REP::do_matrix_index (int, tree_constant) function. (TC_REP::do_matrix_index (int, tree_constant): Be compatible with Matlab for indexing of the form row_vector (0, :). (TC_REP::do_matrix_index (tree_constant, int): Likewise, for indexing of the form col_vector (:, 0). (TC_REP::do_matrix_assignment): Similar changes for assignment. Tue Sep 20 17:48:39 1994 John Eaton * src/parse.y (return_list, return_list1): New nonterminals. Rename from func_def1a. Handle variable number of return values. * src/tree-expr.h (tree_function::vr_list): New field. * src/tree-expr.cc (delete_vr_list): New function. (tree_function::octave_vr_val, tree_function::takes_var_return): New functions, for variable return lists. (tree_function::define_ret_list, tree_function::eval): Handle vr_list. (Fvr_val): New function. * src/tree-misc.h (tree_va_return_list): New list class. * src/tree-misc.cc (tree_parameter_list::convert_to_const_vector): Take pointer to tree_va_return_list as arg, and append the values found there. * src/arith-ops.cc (mx_stupid_bool_op): Correctly handle empty matrices for == and != ops. * src/variables.cc (Fis_global): Check args(0), not args(1). (Fexist): Likewise. (install_builtin_mapper): Set nargin_max to 1, not 2. * src/dynamic-ld.cc (octave_dld_init): Make raw program name absolute before calling dld_find_executable. * src/octave.cc (initialize_error_handlers): New function. (main): Call init_user_prefs and initialize_error_handlers. Rearrange order of calls to initialization functions. * src/user-prefs.cc (init_user_prefs): New function. * src/data.cc (map): Correct condition for assert (). Correct handling of empty args. * src/f-lsode.cc src/f-dassl.cc src/f-quad.cc src/f-npsol.cc src/f-fsolve.cc: Pass correct number of args to takes_correct_nargs (). * src/variables.cc (takes_correct_nargs): Use %s, not %c in format string. * src/f-ifft2.cc src/f-expm.cc src/f-det.cc src/f-svd.cc src/f-syl.cc src/f-schur.cc src/f-qzval.cc src/f-qr.cc src/f-pinv.cc src/f-lu.cc src/f-log.cc src/f-inv.cc src/f-hess.cc src/f-eig.cc src/f-chol.cc src/f-balance.cc src/f-lsode.cc src/f-dassl.cc src/f-quad.cc src/f-npsol.cc src/f-fsolve.cc: Correctly handle return value from empty_arg (). * src/utils.cc (empty_arg): Clarify usage, correct return value if arg is empty but no message is printed. * src/Makefile.in (dist): Delete builtins.cc too. * configure.in (DYNAMIC_LD_OBJ): Delete. * src/Makefile.in (OBJECTS): Don't substitute DYNAMIC_LD_OBJ. Always include dynamic-ld.o. * configure.in: Generate Makefile in scripts/elfun and scripts/specfun. * Makeconf.in (version): Use `:=' and `$(shell )', not just `=' and backticks, so we only extract the version number once. Mon Sep 19 09:04:30 1994 John Eaton * src/tc-rep.h (represent_strings_with_doubles): New field in tree_constant_rep class. * tree-misc.cc (tree_argument_list::convert_to_const_vector): Don't allocate extra arg for function name. * sysdep.cc, pr-output.cc, input.cc, file-io.cc, error.cc, tc-rep.cc, tree-expr.cc, f-svd.cc, f-sort.cc, f-schur.cc, f-rand.cc, f-qzval.cc, f-quad.cc, f-qr.cc, f-qpsol.cc, f-pinv.cc, f-npsol.cc, f-minmax.cc, f-lu.cc, f-lsode.cc, f-log.cc, f-inv.cc, f-ifft2.cc, f-ifft.cc, f-hess.cc, f-givens.cc, f-fsolve.cc, f-fft2.cc, f-fft.cc, f-expm.cc, f-eig.cc, f-det.cc, f-dassl.cc, f-colloc.cc, f-chol.cc, f-balance.cc, f-syl.cc, variables.cc, tree-misc.cc, data.cc, octave.cc, utils.cc, defun-int.h: Change meaning and usage of nargin and args.length() to cope with above change. This makes nargin mean the same thing in built-in functions as it does in M-files. Sat Sep 17 09:29:08 1994 John Eaton * scripts/general/nargchk.m: New function. Fri Sep 16 08:48:13 1994 John Eaton * Makeconf.in (FLIB_LIST, FLIB_PATH, CXXLIBS, CXXLIB_LIST, CXXLIB_PATH): Set these. * cxxlibs.sh: New file. * configure.in: Use it to determine extra C++ libraries to link to. Use sed magic to extract list of libraries and directories from FLIBS and CXXLIBS. * Makefile.in: (DISTFILES): Include cxxlibs.sh. * configure.in: Change AC_VERBOSE messages to match autoconf-generated messages. * src/dynamic-ld.cc (dld_octave_resolve_reference): Search library path for list of files to link. * src/utils.cc (pathstring_to_vector): Un-#if 0 it. * Makefile.in: Install liboctdld.a if not linking to it. (defaults.h): Substitute FLIB_LIST, FLIB_PATH, CXXLIB_LIST, CXXLIB_PATH. Thu Sep 15 09:31:29 1994 John Eaton * Makeconf.in (LD_STATIC_FLAG): Actually substitute LD_STATIC_FLAG. (ALL_LDFLAGS): Include it here. * configure.in: Check for signgam declaration in math.h * acconfig.h: Add #undef for SIGNGAM_DECLARED. * src/mappers.h: Provide our own declaration of signgam if HAVE_LGAMMA but not SIGNGAM_DECLARED. Wed Sep 14 11:28:09 1994 John Eaton * src/dynamic-ld.cc (mangled_octave_builtin_name, mangle_octave_oct_file_name, load_octave_builtin, load_octave_oct_file, init_dynamic_linker): New functions. [WITH_DLD] (octave_dld_init, dld_octave_resolve_reference, dld_octave_builtin, dld_octave_oct_file): New functions to handle details of dynamic linking using dld. * src/variables.cc (load_fcn_from_file) [WITH_DLD]: Handle looking for .oct file to link at run time. * src/tree-expr.cc (tree_builtin::tree_builtin): Always init my_name. (tree_builtin::eval): If no definition, try to load one using load_octave_builtin(). * src/octave.cc (main): Initialize dynamic linking here. * src/defun-int.h (DEFINE_FUN_STRUCT, DEFINE_FUN_STRUCT_FUN): New macros. * src/defun-dld.h (DEFUN_DLD_BUILTIN): Rename from DEFUN_DLD and handle case of WITH_DLD && OCTAVE_LITE && MAKE_BUITLINS. (DEFUN_DLD): Use this for external user-supplied functions that are intended to be dynamically linked. * configure.in: Handle --enable-lite-kernel. Call AC_SUBST for use_dld and lite_kernel. Define LIBOCTDLD unless doing dynamic linking and small kernel requested. * acconfig.h: Add #undefs for OCTAVE_LITE and SMART_PUTENV. * Makeconf.in: Define WITH_DLD from @use_dld@ and OCTAVE_LITE from @lite_kernel@. * src/octave.cc (Fsystem): Rename from shell_cmd. (Fshell_cmd): Define as alias to Fsystem. Mon Sep 12 20:19:20 1994 John Eaton * src/mappers.cc: Include error.h and math.h. Sat Sep 10 11:49:11 1994 John Eaton (jwe@schoch.che.utexas.edu) * Makefile.in: Clean up rules for making distributions. (DISTDIRS): Distribute kpathsea Fri Sep 9 08:46:03 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/dMatrix.cc (pseudo_inverse): New function. * liboctave/CMatrix.cc (pseudo_inverse): New function. * src/f-pinv.cc: New file, for pinv(). * src/Makefile.in (DLD_SRC): Add f-pinv.cc. (DLD_OBJ): Add f-pinv.o. * scripts/linear-algebra/pinv.m: Delete. * configure.in: Define and substitute $imagepath. * src/Makefile.in: Substitute OCTAVE_IMAGEPATH. * src/defaults.h.in: Add OCTAVE_IMAGEPATH. * src/variables.cc (install_builtin_variables): Define IMAGEPATH. * src/user-prefs.cc (image_path): New function. * Makeconf.in (imagepath): substitute it. * src/octave.cc (initialize_globals): Ensure that $archlibdir is in the user's PATH. * utils.cc (search_path_for_file, Ffile_in_path): New functions. * configure.in: Append `//' to $fcnfiledir, for recursive searching. (AC_OUTPUT): Edit makefiles in script subdirectories too. * scripts: Regroup function files in the following directories, each with its own Makefile.in: image plot signal control linear-algebra polynomial special-matrix general miscellaneous set statistics * src/help.cc (simple_help): Use kpathsea functions to find files in path. * src/utils.cc (get_fcn_file_names): Likewise. (pathstring_to_vector): #if 0 out. Thu Sep 8 16:59:42 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/Makefile.in (OCTAVE_LIBS): Include ../libkpathsea.a. * configure.in: Include configure stuff for kpathsea here too. * Makefile.in (kpathsea): New target. * src/utils.cc (file_in_path): Use kpathsea function instead of doing our own searching. * kpathsea/Makefile.in (lib): Define as ../libkpathsea.a, not just kpathsea.a. Wed Sep 7 09:39:20 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/user-prefs.cc (check_str_pref): Fix comment. * src/utils.cc (empty_arg): Check flag == 0, not is_empty > 0. * src/f-fft2.cc (Ffft2): New file and function. * src/f-ifft2.cc (Fifft2): Likewise. * src/fft2.m, src/ifft2.m: Delete. * src/f-fft.cc (Ffft): Handle second arg. Depending on value of propagate_empty_matrices, return empty matrix for empty arg. * src/f-ifft.cc (Fifft): Likewise. * liboctave/CMatrix.cc (fourier2d, ifourier2d): New functions. * liboctave/dMatrix.cc (fourier2d, ifourier2d): New functions. * src/tree-misc.cc (eval (int, int)): New function. * src/octave.cc (eval_string, Feval): Handle multiple output args. * src/error.cc (suppress_octave_error_messages): New global. (error): Check it to see if messages should be printed. * src/octave/cc (Feval): Set it if `catch' arg is supplied. * src/octave.cc (Feval): Handle second `catch' arg. * src/load-save.cc (read_mat_file_header): Init swap to zero. * doc/octave.1: New simple man page. * doc/Makefile.in: Distribute and install it. * src/variables.cc (Fclear): Handle -x option for exclusive clear. Tue Sep 6 16:00:34 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/load-save.cc (save_mat_binary_data): New function. (do_save): Handle LS_MAT_BINARY. (Fsave): Handle -mat-binary. (Changes from G. Beyerle .) * src/variables.cc (subs_octave_home, octave_arch_lib_dir): New functions. (octave_home, octave_info_dir, octave_lib_dir, default_path): Fix for new directory organization. * src/tree-expr.h (tree_multi_val_ret): New class to serve as a base for objects that can produce more than one value when evaluated. (tree_fvc, tree_index_expression, tree_multi_assignment_expression): Use it as a base. * src/parse.y (make_multi_val_re): New function. (expression): Use it to construct multiple value assignments. * configure.in, Makefile.in, Makeconf.in, src/defaults.h.in: Revamp directory structure used for installed versions of Octave. * src/f-schur.cc (Fschur): Correct argument count in error message. * src/octave.cc (Fcomputer): New function. * scripts/computer.in: Delete. * scripts/Makefile.in: Don't edit or distribute computer.in. Thu Sep 1 09:02:06 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/variables.cc (install_builtin_variables): New builtin variable, OCTAVE_VERSION. Tue Aug 30 17:18:14 1994 John Eaton (jwe@schoch.che.utexas.edu) * tree-expr.cc: Include string.h (tree_matrix::eval): Fix handling of strings to work as in 1.0. Mon Aug 29 14:55:14 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/lex.l: Handle ".+" and ".-" too. * src/dirfns.cc (dir_acess, exists, gen_tempname, tempnam): New functions from glibc. * src/utils.cc (octave_tmp_file_name): Use tempnam. (choose_temp_base_try): Delete. * configure.in: Check for tempnam. * src/load-save.cc (Fsave): Only write floating point format if doing binary save. * liboctave/Array.cc (operator =): Check to see if assignment is to same object. Sun Aug 28 23:32:59 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/CollocWt.cc (CollocWt::init): Call delete [] on vectors. * liboctave/NPSOL.cc (NPSOL::minimize): Eliminate some memory leaks. * liboctave/QPSOL.cc (QPSOL::minimize): Likewise. * liboctave/NLEqn.cc (NLEqn::solve): Likewise. Thu Aug 25 09:27:04 1994 John Eaton (jwe@schoch.che.utexas.edu) * info/session.c (info_get_input_char): Don't exit immediately if we see EOF on the input stream. * scripts/kurtosis.m, scripts/skewness.m: Update from KH. Wed Aug 24 00:19:49 1994 John Eaton (jwe@schoch.che.utexas.edu) * dld/Makefile.in, scripts/Makefile.in, doc/Makefile.in, readline/Makefile.in, info/Makefile.in, libcruft/Makefile.in, liboctave/Makefile.in, src/Makefile.in (INSTALL, INSTALL_PROGRAM, INSTALL_DATA): Define here. * Makeconf.in: Not here. * src/tree-plot.cc (send_to_plot_stream): Handle user_pref.automatic_replot. * src/variables.cc (install_builtin_variables): Add DEFVAR for automatic_replot. * src/user-prefs.cc (automatic_replot): New function. * src/user-prefs.h (user_preferences): Add automatic_replot to the list. * src/data.cc (Fatan2): Make work for mixed scalar and Matrix args. (map): New functions for two arg mappers (like atan2). * src/f-fsqp.cc: Don't surround everything in FSQP_MISSING, so that trying to use fsqp will result in a message about fsqp not being freely redistributable. * src/f-npsol.cc: Likewise, for NPSOL_MISSING. * src/f-qpsol.cc: Likewise, for QPSOL_MISSING. Tue Aug 23 12:56:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-expr.cc (tree_identifier::eval): Don't call delete for ans_id. The destructor for tree_simple_assignment_expression does this now. * src/Makefile.in (%.def : %.cc): Use sed, not awk. (realclean, distclean, local-dist, dist): Delete .d and .def files. * liboctave/Array.h (DiagArray::Proxy): Make compilation conditional on gcc version, not just _AIX. * src/utils.cc (octave_tmp_file_name, choose_temp_base_try): New functions, stolen from GCC. If HAVE_MKTEMP is not defined, just call tmpnam; otherwise, try harder to please. * src/tree-plot.cc (save_in_tmp_file): Use it, instead of calling tmpnam() directly. * src/file-io.cc (do_scanf): Likewise. * src/octave-hist.cc (mk_tmp_hist_file): Likewise. * configure.in: Check for mktemp. * src/tree-const.h (is_matrix_type, is_scalar_type): Make private. * src/tc-rep.h (is_matrix_type, is_scalar_type): Likewise. * src/tc-rep.h (force_numeric, make_numeric, make_numeric_or_magic, make_numeric_or_range_or_magic): Make private. (make_numeric_or_range): #if 0 out. * src/utils.cc (empty_arg): Correctly set return value. * src/arith-ops.cc: Don't include setjmp.h. * src/utils.cc: Surround setjmp.h with extern "C". * src/octave.cc: Likewise. * src/sighandlers.cc (octave_new_handler): New function. (install_signal_handlers): Call it. * src/f-qzval.cc (Fqzvalue): Don't call make_numeric for args. Check error state after attempting to extract values. Simplify where possible. * src/f-colloc.cc (Fcolloc): Likewise. * src/f-rand.cc (Frand): Likewise. * src/f-sort.cc (Fsort): Likewise. * src/f-find.cc (Ffind): Likewise. * src/f-minmax.cc (Fmin, Fmax): Likewise. * src/f-fft.cc (Ffft): Likewise. * src/f-ifft.cc (Fifft): Likewise. * src/f-svd.cc (Fsvd): Likewise. * src/f-inv.cc (Finv): Likewise. * src/f-det.cc (Fdet): Likewise. * src/f-eig.cc (Feig): Likewise. * src/f-lu.cc (Flu): Likewise. * src/f-hess.cc (Fhess): Likewise. * src/f-qr.cc (Fqr): Likewise. * src/f-givens.cc (Fgivens): Likewise. * src/f-syl.cc (Fsyl): Likewise. * src/f-log.cc (Flog): Likewise. * src/f-expm.cc (Fexpm): Likewise. * src/f-balance.cc (Fbalance): Likewise. * src/f-schur.cc (Fschur): Likewise. * src/f-chol.cc (Fchol): Likewise. * src/f-npsol.cc (Fnpsol, npsol_options): Likewise. * src/f-fsolve.cc (Ffsolve, fsolve_options): Likewise. * src/f-dassl.cc (Fdassl, dassl_options): Likewise. * src/f-lsode.cc (Flsode, lsode_options): Likewise. * src/f-quad.cc (Fquad, quad_options): Likewise. * src/tree-expr.cc (tree_matrix::eval): Likewise, while building matrix. (tree_colon_expression::eval): Likewise, for elements of range. * src/variables.cc (is_valid_function, Fis_global, Fexist): Likewise. * src/sysdep.cc (Fgetenv, Fpause): Likewise. * src/octave.cc (eval_string, Fshell_cmd): Likewise. * src/input.cc (get_user_input): Likewise. * src/file-io.cc (return_valid_file, fopen_file_for_user, fgets_internal, fseek_internal, process_printf_format, do_printf, do_scanf, fread_internal, fwrite_internal, feof_internal): Likewise. * src/tc-rep.cc (TC_REP::string_value): Call error() and return 0 instead of crashing if not string_constant. * src/file-io.cc (fopen_file_for_user): Take string as first arg, not tree_constant. Change callers. (fgets_internal, fseek_internal): Correct check for int arg. (process_scanf_format): Use isspace instead of checking directly (and incorrectly) for white space characters. * src/tree-expr.cc (tree_matrix::eval, tree_unary_expression::eval, tree_binary_expression::eval, tree_colon_expression::eval, tree_simple_assignment_expression::eval ): Eliminate uneccesary conversions to and from Octave_object/tree_constant. Mon Aug 22 18:35:05 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/data.cc (Fatan2): New function. * src/data.cc (get_dimensions): Don't call make_numeric for args. Check error state after attempting to extract values. Fri Aug 19 08:28:24 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-misc.h (tree_parameter_list::tree_parameter_list)): Initialize marked_for_varargs to zero. * src/load-save.cc: Add float variants of the conversion routines. (LS_DO_READ): Add swap parameter and only swap bytes if it is true. (read_doubles): Pass swap to LS_DO_READ. Handle float data. (LS_DO_WRITE): Copy data to tmp buffer to avoid destroying data. (do_double_format_conversion): Rename from do_float_format_conversion. (do_float_format_conversion): New function to handle conversion for float data. (read_mat_binary_data): Use read_doules for all cases. Handle float data. (too_large_for_float): New function. (save_binary_data): Save data format for scalars and ranges too. (read_binary_data): Read data format for scalars and ranges too. (do_save, save_vars): New arg, save_as_floats. (Fsave): New option, -float-binary. * src/utils.cc (empty_arg): New function. * src/f-balance.cc (Fbalance): Use it to simplify handling of empty arguments. * src/f-chol.cc (Fchol): Likewise. * src/f-det.cc (Fdet): Likewise. * src/f-eig.cc (Feig): Likewise. * src/f-expm.cc (Fexpm): Likewise. * src/f-fft.cc (Ffft): Likewise. * src/f-hess.cc (Fhess): Likewise. * src/f-ifft.cc (Fifft): Likewise. * src/f-inv.cc (Finv): Likewise. * src/f-log.cc (Flogm, Fsqrtm): Likewise. * src/f-lu.cc (Flu): Likewise. * src/f-qr.cc (Fqr): Likewise. * src/f-schur.cc (Fschur): Likewise. * src/f-svd.cc (Fsvd): Likewise. * src/tc-rep.cc (tupe_as_string): Move here. * src/tree-const.cc: From here. * src/gripes.cc (gripe_invalid_conversion): New function. Thu Aug 18 21:02:19 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/(print_empty_matrix): New function. * src/pr-output.cc (octave_print_internal): Use it to print empty matrices. * src/tc-rep.cc (TC_REP::print_code, TC_REP::print): Rely on octave_print_internal() to handle printing empty matrices. * src/pr-output.cc (octave_print_internal (all variants)): New arg, pr_as_read_syntax. If nonzero, print the value in a form that Octave can parse. Declare os as ostream&, not ostrstream&. * src/tc-rep.cc (TC_REP::print_code): Handle all types, not just real and imaginary constants. * src/help.cc (Ftype): Also print values of variables. Wed Aug 17 08:46:44 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/octave.cc (Fshell_cmd): Return output if nargout > 0 or nargin > 2, otherwise, just send output to the pager. * src/mappers.cc (xerf, xerfc, xgamma, xlgamma): New functions. Put preprocessor conditionals here. (install_mapper_functions): Not here. Tue Aug 16 09:55:25 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check for erf, erfc, and lgamma. * src/mappers.cc (erf, erfc, lgamma): New mappers. * src/mappers.h (Mapper_fcn): Add new field `name'. * src/variables.cc (install_builtin_mapper): Save the name. * src/tc-rep.cc (TC_REP::mapper): Don't crash if a mapper function is missing. * src/tc-rep-1.cc (warn_invalid_conversion): New function. * src/gripes.cc (gripe_invalid_conversion): New function. * src/parse.y (list1, parse_error): New non-terminals. (list): Use them. * src/lex.l: Return LEXICAL_ERROR instead of calling jump_to_top_level. * liboctave/Range.cc (matrix_value): New function. * src/tc-rep.cc (TC_REP::matrix_value): Use it. * src/tree-const.h (to_matrix, to_vector, to_scalar): Delete unecessary functions. * src/tc-rep.cc (TC_REP::to_matrix, TC_REP::to_vector, TC_REP::to_scalar): Likewise. Change all callers to use matrix_value, vector_value, and scalar_value instead. * src/tree-const.cc (TC_REP::matrix_value): If at all possible, produce a matrix from the current constant. Otherwise, print an error message. Don't abort or jump to the top level. (TC_REP::scalar_value, TC_REP::complex_scalar_value, TC_REP::vector_value, TC_REP::complex_vector_value, TC_REP::complex_matrix_value): Likewise, for appropriate types. * src/utils.cc (empty_arg): New function. * src/f-svd.cc (Fsvd): Use it. Don't call make_numeric; rely on value functions to do conversion. * src/load-save.cc (Fload): Handle -list and -verbose. Mon Aug 15 09:32:57 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-rep.cc (TC_REP): New define, so we don't have to write tree_constant::tree_constant_rep:: everywhere. * src/tree-const.h (class tree_constant): Nest tree_constant_rep class inside tree_constant class by including tc-rep.h here. * src/tc-rep.h: Don't include any other files, delete forward class declarations. * src/tc-rep.h (constant_type): Make private. * src/parse.y (arg_list): Use tree_constant::magic_colon in constructor call, not tree_constant_rep::magic_colon. * src/tree-const.h (tree_constant::tree_constant (tree_constant::magic_colon)): Convert arg from tree_constant_rep::constant_type. * src/f-svd.cc (Fsvd): Simplify. * src/tree-expr.cc (any_arg_is_magic_colon): Don't use values from tree_constant_rep::constant_type enum. (tree_matrix::eval): Likewise. * src/tree-misc.cc (tree_parameter_list::define_from_arg_vector, tree_if_clause::eval): Likewise. * src/tree-cmd.cc (tree_while_command::eval, tree_for_command::eval): Likewise. * src/symtab.cc (symbol_record_info::symbol_record_info): Likewise. * src/f-colloc.cc (Fcolloc): Likewise. * src/f-npsol.cc (npsol_objective_function): Likewise. * src/f-chol.cc (Fchol): Likewise. * src/f-det.cc (Fdet): Likewise. * src/f-eig.cc (Feig): Likewise. * src/f-expm.cc (Fexpm): Likewise. * src/f-fft.cc (Ffft): Likewise. * src/f-find.cc (Ffind): Likewise. * src/f-hess.cc (Fhess): Likewise. * src/f-ifft.cc (Fifft): Likewise. * src/f-inv.cc (Finv): Likewise. * src/f-log.cc (Flog): Likewise. * src/f-lu.cc (Flu): Likewise. * src/f-minmax.cc (Fmin, Fmax): Likewise. * src/f-qr.cc (Fqr): Likewise. * src/f-rand.cc (rand): Likewise. * src/f-schur.cc (schur): Likewise. * src/f-sort.cc (Fsort): Likewise. * src/f-svd.cc (Fsvd): Likewise. * src/f-lu.cc (Flu): Handle case of nargout == 0 the same as nargout == 1. * src/tree-const.h (force_numeric): Don't return type info. * src/tc-rep.cc (tree_matrix::eval): Ditto. * src/tree-expr.cc (tree_matrix::eval): Don't use return value from tree_constant::force_numeric(). * src/tree-const.h (is_magic_colon): New function. * src/tc-rep.h (is_magic_colon): New function. * src/load-save.cc (ascii_save_type): New function. (save_binary_data, save_ascii_data, save_three_d): Don't use values from tree_constant_rep::constant_type enum. Fail if write is unsuccessful. Fail but don't panic if type is unrecognized. (save_vars): Check error state after call to do_save(). * src/tc-rep.cc (isstr): Delete, since we have is_string. * src/tree-const.h (isstr): Ditto. * src/data.cc (Fisstr): Use is_string(), not isstr(). Sun Aug 14 16:12:10 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/load-save.cc (save_type): Add LS_U_INT, LS_CHAR and LS_FLOAT. (get_save_type): Handle them. (read_doubles, write_doubles): Likewise. * src/load-save.cc (get_floating_point_format): New function. (read_mat_binary_data, read_binary_file_header): Use it. * src/lex.l: Combine {D}+\.{D}*{EXPON}?{Im} and {D}+{EXPON}?{Im} patterns into the single pattern {D}+\.?{D}*{EXPON}?{Im} Likewise, combine {D}+\.{D}*{EXPON}? and {D}+{EXPON}? into the single pattern {D}+\.?{D}*{EXPON}? ({D}+/\.[\*/\\^']): New pattern to force expressions like `1./m' to be parsed the same as `1 ./ m'. * src/tree-expr.cc (do_lookup): Correctly set script_file_executed. * src/octave.cc (long_opts): Add --silent as an alias for --quiet, and --ignore-init-file as an alias for --norc. * src/octave.cc (verbose_usage): Exit successfully to conform to the GNU coding standards. Sat Aug 13 11:06:23 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/dirfns.cc (chdir): New alias for cd. * src/lex.l (")"): Set convert_spaces_to_comma. * src/*.cc: Use tree_constant::is_string(), not tree_constant::is_string_type(). * src/f-balance.cc (Fbalance): Use is_string() rather than checking const_type() against tree_constant_rep::string_constant. * src/tc-rep.h (tree_constant_rep::is_string_type): Delete. * src/tree-const.h (tree_constant::is_string_type): Delete. * src/Makefile.in (%.def : %.cc): Complain if generated file is empty. * configure.in (gcc_version): Set LDFLAGS to -g, not "-g -O". * src/lex.l (looks_like_bin_op): Also return true for things like [ 1+ 2 ]. * src/data.cc (Feye, Fones): With no args, return 1.0. (Fzeros): With no args, return 0.0. * src/Makefile.in (XALL_CXXFLAGS): ALL_CXXFLAGS without -fextternal-templates. (%.def : %.cc): Use it instead of ALL_CXXFLAGS. * configure.in: Don't use -O for compiling float-type.c. * libcruft/misc/Makefile.in (XCC): Use patsubst to delete any -O# flags, not just -O. Fri Aug 12 18:20:35 1994 John Eaton (jwe@schoch.che.utexas.edu) Changes for binary load/save, and reading .mat files: * src/variables.cc (is_globally_visible): Declare extern, not static. * src/user-prefs.cc (sv_default_save_format): New function. * src/user-prefs.h (default_save_format): New field in user_preferences struct. src/variables.cc (install_builtin_variables): Add DEFVAR for default_save_format. * src/tc-rep.h (tree_constant_rep::is_unknown, tree_constant_rep::is_scalar, tree_constant_rep::is_matrix, tree_constant_rep::is_complex_scalar, tree_constant_rep::is_complex_matrix, tree_constant_rep::is_string, tree_constant_rep::is_range): New functions. * src/tree-const.h (tree_constant::is_unknown, tree_constant::is_scalar, tree_constant::is_matrix, tree_constant::is_complex_scalar, tree_constant::is_complex_matrix, tree_constant::is_string, tree_constant::is_range): New functions. * src/tc-rep.cc (tree_constant_rep::save, tree_constant_rep::save_three_d): Move to load-save.cc and convert to nonmember functions. * src/tree-const.h (tree_constant::save, tree_constant::save_three_d): Delete functions. * src/tree-plot.cc (save_in_tmp_file): Call nonmember functions save_ascii_file and save_three_d instead of tree_constant class member functions. * src/symtab.cc (symbol_table::glob): New function. (symbol_table::save, symbol_record::save, symbol_def::save): Delete unneeded functions. * src/load-save.cc: New file, for load/save related functions extracted from src/variables.cc and src/tc-rep.cc. * src/error.cc (verror): Don't print name if it is null. Tue Aug 9 14:31:43 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/file-io.cc (process_printf_format): Use tree_constant::is_scalar_type() and is_string_type() functions instead of comparing directly with elements of the tree_constant_rep::constant_type enum. * src/variables.cc (builtin_real_scalar_variable): Likewise. (install_loaded_variable): Likewise. * src/tree-plot.cc (open_plot_stream): New function. (send_to_plot_stream): Use it. Do our own check for replot with nothing to plot. (tree_plot_command::eval): Open plot stream before doing anything. * src/data.cc (check_dimensions): When changing negative dimensions to zero, handle nr and nc separately. Mon Aug 8 20:18:17 1994 John Eaton (jwe@schoch.che.utexas.edu) * variables.cc (is_valid_fcn): Use lookup_by_name() instead of looking in the global symbol table directly. * variables.cc (load_variable): Move code here. * src/tc-rep.cc (tree_constant_rep::load): From here. * src/tree-const.h (tree_constant::load): Delete. * src/tree-plot.cc: Derive classes from tree_print_code and implement print_code() member functions. * src/tree-plot.cc (subplot_list::print): New function. (tree_plot_command::print): Use it, and don't crash if plot_list is null. * scripts/axis.m: New function file. Sun Aug 7 17:06:16 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check for size of short, int, and long. * float-type.c: New file. * configure.in: Use it to determine the native floating point format. * Makefile.in: Add it to the list of files to distribute. * acconfig.h (IEEE_BIG_ENDIAN, IEEE_LITTLE_ENDIAN, VAX_D_FLOAT, VAX_G_FLOAT): Add #undefs. Sat Aug 6 18:23:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * config.guess: Update with new copy from gcc 2.6.0. * src/*.cc, src/*.h, src/*.l, src/*.y: Eliminate need for tree.h. * src/Makefile.in (INCLUDES): Delete it from the list. * src/token.cc (token::token (double)): Handle saving original text of constants for later use by print_code() functions. (token::~token): Delete original text. (token::text_rep): New function. * src/lex.l: Save original text for NUM and IMAG_NUM tokens. * src/parse.y: Likewise. * src/parse.y (yyerror): Use the pager. * src/tree-base.h (tree_print_code): New base class for trees and lists of trees. (tree): Derive from tree_print_code. * src/tree-base.cc: New file, for tree_print_code functions, and for initializing tree_print_code static members. * src/tree-const.cc, src/tc-rep.cc, src/tree-plot.cc, src/tree-expr.cc, src/tree-cmd.cc (all tree classes): Provide print_code() member function. * src/tree-misc.cc: Also derive list classes from tree-base.h and provide print_code() member functions. * src/help.cc (Ftype, Fwhich): New functions. * src/octave-hist (do_history): Send history output through the pager. * src/variables.cc (do_who, Fwhos): New functions. * src/tree-expr.h (tree_expression::in_parens): Declare here. (tree_simple_assignment_expression::in_parens): Not here. * src/parse.y (maybe_warn_assign_as_truth_value): Eliminate cast. * src/variables.cc (load_fcn_from_file, lookup, lookup_by_name): New functions, extracted from tree_identifier class. (gobble_leading_whitespace, is_function_file, parse_fcn_file): Move here from tree-expr.cc. * src/help.cc (Fhelp): Use lookup_by_name so that looking up symbols is handled in a consistent way. * tree-expr.cc (tree_unary_expression::oper, tree_binary_expression::oper, tree_prefix_expression::oper, tree_postfix_expression::oper): New functions. * tc-rep.cc (valid_scalar_indices): Define here. * tc-inlines.cc: Not here. * src/tree-const.h (tree_constant::stash_original_text): New function. * src/tc-rep.cc (tree_constant_rep::stash_original_text): Ditto. (undo_string_escapes): Ditto. * src/tc-rep (tree_constant_rep::do_matrix_index): Don't just return *this. * src/tree-const.h (tree_constant::tree_constant (tree_constant_re&)): Delete. * src/pager.cc (open_diary_file, close_diary_file, maybe_write_to_diary_file, Fdiary): New functions. (flush_output_to_pager): Call maybe_write_to_diary_file before sending output to the screen. * src/input.cc (octave_gets): Call maybe_write_to_diary file to save the prompt and the user input. * src/error.cc (verror): Use C++ streams, not C I/O functions. Call maybe_write_to_diary file to save error messges too. * src/octave.cc (clean_up_and_exit): Close diary file here. * src/octave.cc (main): Initialize pager first. * src/input.cc (get_user_input): Return empty matrix for no input. * src/tree-plot.cc: Include readline/tilde.h instead of declaring tilde_expand() directly. * src/utils.cc: Likewise. * src/tree-plot.cc (tree_plot_command::print_code): New function. * src/tree-const.h (tree_constant::print_code): Likewise. * src/tree-expr.h (tree_simple_assignment_expression::ans_ass): New data member to flag assignments to ans. * src/tree-expr.cc (tree_identifier::eval): Set it when constructing assignments to ans. * src/parse.y (maybe_convert_to_ans_assign): Likewise. * src/tree-expr.h (tree_simple_assignment_expression::preserve): New data member to allow preserving left hand side args that shouldn't be deleted in some cases (ugh). * src/tree-expr.cc (tree_multi_assignment_expression::eval): Create assignment with preserve flag set. Wed Aug 3 14:27:25 1994 John Eaton (jwe@schoch.che.utexas.edu) Yet another massive reorganization of sources, once again hopefully for the better. A fair amount of work is not detailed here, but these are the major points. The grammar file and the derivation of the tree classes are somewhat cleaner now. * src/parse.y: Cope with changes to derivation scheme. * src/tree-misc.cc: New file. (tree_statement, tree_global): New classes. (tree_global_init_list): New class, derived from SLList for the list of expressions in a global command. * src/tree-cmd.cc (tree_global_command): Use tree_global_init_list. * src/tree-misc.cc (tree_argument_list): Move here from tree-expr.cc, and derive from SLList instead of tree. (tree_parameter_list): Likewise. (tree_return_list): Likewise. * src/tree-cmd.cc (tree_command_list): Delete class. * src/tree-misc.cc (tree_statement_list): New class for keeping a list of commands or expressions to evaluate. Derive from SLList, not tree. * src/tree-plot.cc (subplot_list, plot_limits, plot_range, subplot_using, subplot_style): Rename from tree_*, and don't derive from tree class. * src/tree-plot.cc: Eliminate eval member function for classes not derived from tree class. * src/tree-plot.cc, src/tree-cmd.cc: For classes derived from tree-command, the eval() member function is now void eval (void). * src/tree-base.h (tree::tree): New constructor, to initialize the line and column info. For all classes that are derived from the tree class, use it instead of manipulating the data directly. (line_num, column_num): Make private. * src/tree-expr.cc (tree_simple_assignment_expression::preserve): New data member, set in constructors and used by the destructor when the left-hand side of the expression should not be deleted (as for some temporary assignments not constructed in the parser). * src/tree-expr.h (tree_expression::type) Rename and move here from tree-base.h. Change all uses. (tree_matrix::dir): Likewise. Change all uses. * src/utils.cc (make_argv): Stash function name in argv[0]. * src/octave.cc (global_command): Declare as tree_statement_list, not tree. * src/parse.y (make_binary_op, make_unary_op, make_prefix_op, make_postfix_op): New functions. * src/parse.y (GLOBAL): Make it a tok_val type. * src/lex.l (is_keyword): Give GLOBAL a value. Mon Aug 1 22:37:22 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/lex.l (grab_help_text): Unput the last character read. Sun Jul 31 21:17:07 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/pr-output.cc (set_format (double, int&)): Avoid calling log10 for Inf and NaN. Fri Jul 29 16:08:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/octave.cc (reading_startup_message_printed): New flag. (parse_and_execute): New arg, verbose. If true, print name of file as it is read. (execute_startup_files): Don't print message if inhibit_startup_message is true. (main): Move startup message before reading init files. Thu Jul 28 00:25:42 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Makefile.in (MATRIX_INC): Delete CmplxColVec.h from list. * src/symtab.cc (symbol_table::rename): New function. * src/parse.y (func_def2): Use it instead of tree_identifier::rename. * src/tree-expr.cc (tree_identifier::rename): Delete unused function. * src/tree-expr.cc (tree_identifier::load_fcn_from_file): New function. (tree_identifier::do_lookup): Use it instead of parse_fcn_file. * src/variables.cc (is_valid_function): Ditto. * src/help.cc (Fhelp): Ditto. * src/utils.cc (oct_file_in_path): New function. Wed Jul 27 08:59:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-expr.cc (tree_identifier::parse_fcn_file): Combine three functions into one. * src/utils.cc: Delete uneeded declaration of ioctl(). * src/sysdep.cc: Likewise. * install.sh: New file, from autoconf distribution. * Makefile.in (DISTFILES): Distribute it. Tue Jul 26 16:08:58 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/Makefile.in (DISTDIRS): New variable, for directories below scripts to distribute. (dist): Handle distributing whole directories named by $(DISTDIRS). (local-dist): Ditto. Mon Jul 25 12:57:09 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/CmplxQRP.cc: Provide declaration for zungqr. * liboctave/dbleQRP.cc: Provide declaration for dorgqr. * src/Makefile.in (dist): Also remove y.output and defaults.h. (local-dist): Ditto. (realclean): Ditto. * src/oct-obj.h (Octave_object::Octave_object (int)): Make private, to avoid problems with different meanings of Octave_object (int) and Octave_object (double) constructors. * scripts/amr-image: New files for image processing from Tony Richardson. These are not in the default octave LOADPATH yet. See the README file in the amr-image directory for more info on how to use them. * src/octave.cc (Fshell_cmd): Restore accidentally deleted function. * scripts/conv-amr.m, scripts/deconv-amr.m, scripts/roots-amr.m, scripts/poly-amr.m, scripts/roots-tuwien.m, scripts/conv-tuwien.m, scripts/deconv-tuwien.m, scripts/poly-tuwien.m: New files. XXX FIXME XXX -- For each of these functions, either one of the versions will need to be selected, or they will need to be merged before the next release. * scripts/null.m, scripts/orth.m, scripts/fft2.m, scripts/ifft2.m, scripts/filter.m, scripts/compan.m, scripts/polyderiv.m, scripts/polyinteg.m, scripts/polyreduce.m, scripts/polyval.m, scripts/polyvalm.m, scripts/postpad.m, scripts/prepad.m, scripts/residue.m, scripts/sinc.m, scripts/freqz.m, scripts/complement.m, scripts/intersection.m, scripts/create_set.m, scripts/union.m: New files. * scripts/hilb.m: Eliminate inner loop, for speed. From romolo@URSAMAJOR.ENG.UNIPR.IT (Romolo Manfredini). Sun Jul 24 22:08:48 1994 Castor Fu (castor@drizzle.stanford.edu) * libcruft/ranlib/genf.f (genf): Use 1.2E-38 instead of 1.0E-38 when checking to see if generated numbers will cause overflow. This helps DEC's f77 compiler on the Alpha, which refuses to generate denormalized constants. * libcruft/ranlib/gennf.f (gennf): Likewise. Fri Jul 22 10:27:00 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/Makefile.in (DEF_FILES): Depend on defun header files too. Thu Jul 21 14:40:30 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/NLFunc.h (nonlinear_fcn): Declare as pointer to function taking const ColumnVector arg. (jacobian_fcn): Ditto. * src/defun-int.h (DEFINE_ARGV): Declare and define save_argc and save_argv for functions that mess with argc and argv directly. (DELETE_ARGV): Use save_argc and save_argv instead of argc and argv. * src/f-lsode.cc (ODE_OPTIONS): Add const qualifier for string elts. (print_lsode_option_list): Declare keyword as const char *. * src/f-npsol.cc, src/f-qpsol.cc, src/f-dassl.cc, src/f-quad.cc: Likewise, for corresponding structs and functions. * liboctave/dbleSVD.h (SVD::type): New enum, for choosing type of factorization. * liboctave/CmplxSVD.cc (SVD::SVD): Add new optional arg for type. (init): Handle case of type == SVD::economy. * liboctave/dbleSVD.cc: Likewise. QR changes from R. Bruce Tenison (btenison@eng.auburn.edu) adapted for new way of defining builtin functions: * doc/linalg.texi: Changed QR description to include QRP factorization * src/f-qr.cc (Fqr): Handle permuted and economy QR factorizations. Handle case of 1 output arg. * liboctave/Makefile.in (MATRIX_INC, MATRIX_SRC): Add new QRP files. * liboctave/dbleQRP.h, liboctave/dbleQRP.cc, liboctave/CmplxQRP.h, liboctave/CmplxQRP.h: New files, for QR with pivoting. * liboctave/dbleQR.h (QR::type): New enum, for choosing type of factorization. * liboctave/CmplxQR.cc (QR): Add new optional arg for type. Handle case of type == SVD::economy and SVD::raw. * liboctave/dbleQR.cc (QR): Likewise. * libcruft/lapack/dgeqpf.f: New file. * libcruft/lapack/zgeqpf.f: Ditto. Wed Jul 20 13:12:55 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/*.cc, liboctave/*.h: Various cleanups to remove use of NULL. Only mention default argument values in function declarations, not in their definitions (required for gcc 2.6.x). * configure.in: If configuring for alpha-dec-osf, check for sgtty first. If not found, go ahead and check for Posix terminal driver. Tue Jul 19 09:25:45 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/mx-defs.h (FILE): Don't declare as struct FILE just to avoid including stdio.h. * liboctave/dMatrix.cc: Do include stdio.h here. * liboctave matrix classes: Declare operator>> correctly, and return istream object. Get friend stuff right. * liboctave/DAE.cc (DAE::integrate): To see if the user provided a Jacobian function, call DAEFunc::jacobian_function (). * liboctave/DAE.cc (user_fun, user_jac): Qualify with class name. * liboctave/ODE.cc (user_fun, user_jac): Ditto. * liboctave/DAFunc.h (DAEJac): Declare inside class. (DAERHSFunc, DAEJacFunc): Define types inside class. * liboctave/ODEFunc.h (ODERHSFunc, ODEJacFunc) Likewise. Massive reorganization of sources, hopefully for the better. A fair amount of work is not detailed here, but these are the major points... * src/symtab.h (symbol_def::TYPE) Add new elements for recording whether a symbol is a text function or mapper function. * src/symtab.cc (symbol_def::is_text_function, symbol_record::is_text_function, symbol_def::is_mapper_function, symbol_record::is_mapper_function): New functions. Modify existing is_* functions to cope with these changes. (symbol_def::symbol_def (tree_builtin*, unsigned)): New 2nd arg. (symbol_def::symbol_def (tree_function*, unsigned)): Ditto (symbol_def::define (tree_builtin*, unsigned)): Ditto. (symbol_def::define (tree_function*, unsigned)): Ditto. * src/variables.cc (is_text_function_name): Use the new symbol table functions, since we can no longer tell by looking in a simple list. * tree-expr.cc (class tree_builtin): Text functions are no longer handled as a special case here. * src/sysdep.cc (octave_ieee_init): Special case Alpha for initializing Inf and NaN. * src/tc-rep.cc: Use const in more places. * src/data.cc src/timefns.cc, src/dirfns.cc, src/dirfns.h: New files. * src/*.cc, src/*.y, src/*.l, src/*.h: Various cleanups to remove use of NULL. Only mention default argument values in function declarations, not in their definitions (required for gcc 2.6.x). * src/g-builtins.cc, src/g-builtins.h, src/t-builtins.cc src/t-builtins.h: Removed. Functions moved to various other files, where they more logically belong. * src/utils.cc: Likewise, various functions moved to other files, where they more logically belong. * src/mappers.cc (install_mapper_functions): Declare all mapper functions here with the new DEFUN_MAPPER() macro. * src/variables.cc (install_builtin_variables): Declare all builtin variables here, with the new DEFVAR() macro. * src/f-*.h: Deleted. * src/f-*.cc: Delete #ifdef WITH_DLD code and use DEFUN_DLD() instead to declare builtin functions that will be dynamically loaded. Give all functions a uniform return type and argument list. * src/mkdefs, src/mkbuiltins: New scripts. * src/Makefile.in: Use them to generate builtins.cc automatically from source files that use DEFUN. * src/defun.h, src/defun-dld.h, src/defun-int.h: New files, to define DEFUN() and DEFVAR() macros to make it possible to define functions together with their help strings in one place. The code to install functions in the symbol table is now generated by mkbuiltins. * configure.in (LIBOCTDLD): New variable to define. Only call AC_VERBOSE() for DYNAMIC_LD_OBJ, DLD_DIR, LIBDLD, LIBOCTDLD, and LD_STATIC_FLAG if they are set. * move-if-change: Move here, from src/move-if-change. * Makeconf.in (%.d: %.cc): Echo simple message instead of the commands actually executed. (%.d: %.c): Likewise. * src/unwind-prot.h: Include stddef.h, for size_t. Tue Jul 12 12:51:25 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/f-eval.cc, src/f-fill.cc, src/f-find.cc, src/f-input.cc, src/f-minmax.cc, src/f-log.cc, src/f-sort.cc, src/f-eval.h, src/f-fill.h, src/f-find.h, src/f-input.h, src/f-log.h, src/f-minmax.h, src/f-sort.h: New files, for functions extracted from tree-const.cc. * src/Makefile.in: Add them to the list of INCLUDES, SOURCES, and OBJECTS. * src/f-*.cc: Clean up things a bit by letting the compiler generate the tree_constant constructor calls. * src/unwind-prot.h: Include stddef.h, for size_t. * src/oct-obj.h (Octave_object (int, const tree_constant&)): New constructor form. * src/tree-const.cc (find_nonzero_elem_idx): Rewrite to handle 2 and 3 return values. * src/g-builtins.cc (builtin_find): Check nargout too. * src/builtins.cc (general_functions): Fix help message for find. Mon Jul 11 13:36:15 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-rep.cc (tree_constant_rep::convert_to_row_or_column_vector): If already have a row or column vector, return without doing anything. Sat Jul 9 01:02:51 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/oct-obj.h (Octave_object): Make it a class, not just a typedef. * src/tree-expr.h (tree_function::curr_va_arg_number): Rename from curr_arg_number. (tree_function::varargs_ok): Delete unused member variable. * src/tree-expr.cc (tree_function::octave_va_arg): Increment cur_va_arg_number before indexing args_passed. (tree_function::octave_va_start): Set curr_va_arg_number to num_args_passed, not num_args_passed + 1. (tree_function::takes_varargs): Call param_list::takes_varargs, don't just return varargs_ok. (tree_function::define_param_list): If param_list is not NULL, set num_named_args and curr_va_arg_number even if function doesn't take varargs. * src/tree-expr.cc (tree_identifier::eval (int)): Only pass empty arg list if evaluating a constant. (tree_function::eval (int)): Always pass least one arg. * Makeconf.in (TMP_IF_1): Add `-I../src'. (TMP_IF_2): Add `-I$(TOPDIR)/src' and `-I$(top_srcdir)/src'. * src/t-builtins.h, src/variables.h, src/file-io.h, src/f-syl.h, src/f-svd.h, src/f-schur.h, src/f-rand.h, src/f-qzval.h, src/f-quad.h, src/f-qpsol.h, src/f-npsol.h, src/f-lsode.h, src/f-lpsolve.h, src/f-hess.h, src/f-givens.h, src/f-fsqp.h, src/f-fsolve.h, src/f-eig.h, src/f-dassl.h, src/f-colloc.h, src/f-balance.h, src/dynamic-ld.h, src/builtins.cc, src/tree-const.cc, src/file-io.cc, src/f-syl.cc, src/f-svd.cc, src/f-schur.cc, src/f-rand.cc, src/f-qzval.cc, src/f-qr.cc, src/f-qpsol.cc, src/f-lu.cc, src/f-lpsolve.cc, src/f-inv.cc, src/f-ifft.cc, src/f-hess.cc, src/f-givens.cc, src/f-fsqp.cc, src/f-fft.cc, src/f-expm.cc, src/f-eig.cc, src/f-det.cc, src/f-colloc.cc, src/f-chol.cc, src/f-balance.cc, src/dynamic-ld.cc, src/f-dassl.cc, src/f-fsolve.cc, src/f-lsode.cc, src/f-npsol.cc, src/f-quad.cc, src/tree-expr.h, src/tc-rep.cc, src/tc-inlines.cc, src/tc-rep.h, src/tree-const.h, src/g-builtins.cc, src/g-builtins.h, src/tree-expr.cc, src/variables.cc: Delete nargin in favor of using args.length(). * configure.in: Check for struct exception in math.h. * src/sysdep.cc (matherr): New function. Fri Jul 8 15:31:53 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-rep.cc: Include arith-ops.h. (tree_constant_rep::do_scalar_index): Use `invalid', not `illegal' in messages. * src/oct-obj.h: Protect contents from multiple inclusion. * src/tree-const.h, src/tree-expr.h: Don't include Array.h. * src/parse.y (param_list): Allow ELLIPSIS by itself. * src/tree-expr.cc (tree_identifier::mark_varargs_only, tree_identifier::vararg_only): New functions. (tree_function::eval): Only call define_from_arg_vector if param_list is non-null and not marked as varargs_only. * src/f-balance.h, src/f-chol.h, src/f-colloc.h, src/f-dassl.h, src/f-eig.h, src/f-fsolve.h, src/f-fsqp.h, src/f-givens.h, src/f-hess.h, src/f-lpsolve.h, src/f-lsode.h, src/f-lu.h, src/f-npsol.h, src/f-qpsol.h, src/f-qr.h, src/f-quad.h, src/f-qzval.h, src/f-rand.h, src/f-schur.h, src/f-svd.h, src/f-syl.h: Include oct-obj.h, not tree-const.h to get declaration of Octave_object. * src/f-givens.cc (givens): Handle case of nargout == 0. Use `invalid', not `illegal' in messages. * src/f-balance.cc (balance): Likewise. * src/f-balance.cc (balance): Print warning about two output arguments for complex-valued case too. * src/tc-rep.cc: Include arith-ops.h. Thu Jul 7 20:54:12 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/parse.y (identifier): Add missing semicolon. (param_list): Ditto. * src/f-svd.cc (svd): Handle nargout == 0 the same as nargout == 1. * src/f-schur.cc (schur): Likewise. * src/f-hess.cc (hess): Likewise. * src/f-eig.cc (eig): Likewise. * src/f-syl.cc (syl): Likewise. * src/f-qzval.cc (qzvalue): Likewise. * src/f-npsol.cc (npsol): Likewise. * src/f-qpsol.cc (qpsol): Likewise. * src/f-givens.cc (givens): Likewise. * src/f-fsolve.cc (fsolve): Likewise. * src/f-balance.cc (balance): Likewise. * src/file-io.cc (process_scanf_format): Likewise. * src/g-builtins.cc (builtin_balance, builtin_chol, builtin_dassl, builtin_eig, builtin_fsolve, builtin_fsqp, builtin_lsode, builtin_max, builtin_min, builtin_npsol, builtin_qpsol, builtin_quad, builtin_rand, builtin_size, builtin_sort, builtin_svd, builtin_schur, builtin_syl, builtin_givens, builtin_hess): Likewise. * src/tree-const.cc (vector_of_empties, column_max, column_min): Likewise. * src/variables.h, src/symtab.h: Include builtins.h for typedefs. * src/tree-expr.cc(tree_multi_assignment_expression::eval): Rework handling of undefined values returned from functions. * src/tree-expr.cc (tree_identifier::is_defined): New function. (tree_parameter_list::is_defined): New function. (tree_parameter_list::convert_to_const_vector): Use it to avoid evaluating undefined objects. * src/f-balance.cc, src/f-eig.h, src/f-hess.cc, src/f-lu.h, src/f-rand.cc, src/f-balance.h, src/f-expm.cc, src/f-hess.h, src/f-npsol.cc, src/f-rand.h, src/f-chol.cc, src/f-expm.h, src/f-ifft.cc, src/f-npsol.h, src/f-schur.cc, src/f-chol.h, src/f-fft.cc, src/f-ifft.h, src/f-qpsol.cc, src/f-schur.h, src/f-colloc.cc, src/f-fft.h, src/f-inv.cc, src/f-qpsol.h, src/f-svd.cc, src/f-colloc.h, src/f-fsolve.cc, src/f-inv.h, src/f-qr.cc, src/f-svd.h, src/f-dassl.cc, src/f-fsolve.h, src/f-lpsolve.cc, src/f-qr.h, src/f-syl.cc, src/f-dassl.h, src/f-fsqp.cc, src/f-lpsolve.h, src/f-quad.cc, src/f-syl.h, src/f-det.cc, src/f-fsqp.h, src/f-lsode.cc, src/f-quad.h, src/f-det.h, src/f-givens.cc, src/f-lsode.h, src/f-qzval.cc, src/f-eig.cc, src/f-givens.h, src/f-lu.cc, src/f-qzval.h, src/dynamic-ld.cc, src/dynamic-ld.h, src/file-io.cc, src/file-io.h, src/t-biultins.cc, src/t-builtins.h, src/tree-expr.cc, src/tree-expr.h, src/tree-const.cc, src/tree-const.h, src/tc-inlines.cc, src/tc-rep.cc, src/tc-rep.h, src/g-builtins.cc, src/g-builtins.h: Cope with inital round of Octave_object changes. * src/oct-obj.h: New file for Octave_object typedef. * src/dynamic-ld.h, src/file-io.h, src/tree-const.h, src/tree-expr.h: Include it. * src/Makefile.in (INCLUDES): Add it to the list. Wed Jul 6 09:28:28 1994 John Eaton (jwe@schoch.che.utexas.edu) * libocsrc/tree-const.h: * src/parse.y (maybe_convert_to_ans_assign, maybe_warn_assign_as_truth_value): Pass tree_expression*, not tree*. (ans_expression, expression, simple_expr, simple_expr1, title): Declare as tree_expression_type, not tree_type. (opt_list): Add missing semicolon. * src/tc-rep.h, src/tc-rep.cc: New files, extracted from tree-const.h and tree-const.cc, for the tree_constant_rep class. Leave most friend functions behind, in tree-const.h. Don't declare do_binary_op or do_unary_op as friends. * src/lex.l: Include tree-plot.h and tree-const.h. * src/variables.cc (takes_correct_nargs): Pass tree_fvc* not tree*. * src/variables.cc (is_valid_function): Return tree_fvc* not tree*. Change all callers. * src/symtab.h, symtab.cc: Change declaration of symbol definition to be tree_fvc* instead of tree*. Change all callers. * src/f-dassl.cc (dassl_fcn): Declare as tree_fvc*, not tree*. * src/f-quad.cc (quad_fcn): Likewise. * src/f-lsode.cc (lsode_fcn): Likewise. * src/f-fsolve.cc (fsolve_fcn): Likewise. * src/f-npsol.cc (npsol_fcn, npsol_constraints): Likewise. * src/tree-plot.cc: All operations are now on tree_expression types, not tree types. * src/tree-expr.h (tree_matrix): Derive from tree_expression, not tree. * src/tree-expr.h (tree_builtin, tree_function, tree_identifier): Derive from tree_fvc, not tree. * src/tree-const.h (class tree_constant): Likewise. * src/tree-expr.h (is_identifier, is_index_expression, is_assignment_expression, is_prefix_expression, mark_for_possible_ans_assign, eval (with args)): Declare in tree_expression class, not tree class. * src/tree-expr.h (tree_fvc): New class, derived from tree_expression, to provide a connection between functions, variables, and constants. (is_constant, assign, name, bump_value, max_expected_args, fcn_file_name, time_parsed, is_system_fcn_file, save): Declare in tree_fvc class, not in tree class. * src/tree.h: Simply include tree-expr.h and tree-cmd.h. * src/tree-expr.h, tree-expr.cc: New files, extracted from tree.h and tree.cc for classes derived from tree_expression, plus some helper classes. * src/tree-cmd.h, tree-cmd.cc: Likewise, for classes derived from tree_command. * src/tree.cc (eval (int, int)): Merge with eval (int, tree_constant*, int, int) by rearranging order of args and using default arg values. Change all callers. Tue Jul 5 14:33:33 1994 John Eaton (jwe@schoch.che.utexas.edu) * doc/Makefile.in (refcard.dvi): Run TeX on $(srcdir)/refcard.tex, not just refcard.tex. (refcard-local.tex): Likewise, for the local version. * src/tree-const.cc (tree_constant_rep::do_index): Check for empty matrix here. (tree_constant_rep::do_vector_index) Not here. Thu Jun 30 09:41:03 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc (builtin_shell_command): Only take one argument and return [status, output]. * src/procstream.cc (procstreambase::close): Return process exit status. * src/tree.cc (tree_builtin::eval (int)): Handle new style of calling text functions. (tree_builtin::eval (int, int): Likewise. (tree_builtin::eval (tree_constant*, int, int, int): Likewise. (tree_identifier::eval (tree_constant*, int, int, int)): Don't count the output arguments that we create automatically (ans) when figuring nargout. (tree_identifier::eval (int)): Likewise. * src/tree-const.cc: Delete text-style eval() functions. * src/tree.cc: Ditto. * src/tree-const.h: Change typedef of Text_fcn to return a pointer to a tree_constant, and to include the number of output arguments in the parameter list. * src/t-builtins.h: Change declarations of all builtin text-style functions to match. * src/t-builtins.cc: Change definitions too. * src/parse.y (word_list): Build an argument_list, not a word_list. (word_list_command): Create an index_expression, not a word_list_command. * src/tree.cc (tree_word_list): Delete unneeded class. (tree_word_list_command): Likewise. * src/tc-extras.cc (get_dimensions): For one-arg version, expect 2-element vector or scalar specifying dimensions. Don't simply use the dimensions of a matrix arg. Wed Jun 29 09:52:15 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/f-det.cc (determinant): Return 0 if matrix is singular to machine precision. * liboctave/dMatrix.cc (Matrix::inverse): Declare rcond as volatile to prevent optimization of the expression `rcond + 1.0 == 1.0'. (Matrix::determinant): Ditto. (Matrix::solve): Ditto. * liboctave/CMatrix.cc (ComplexMatrix::inverse): Ditto. (ComplexMatrix::determinant): Ditto. (ComplexMatrix::solve): Ditto. Tue Jun 28 10:53:31 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc (default_info_file): Add directory separator when appending "octave.info". * src/tree-plot.cc (plot_line_count): Make global. * src/utils.cc (send_to_plot_stream): If the plot stream is not open, set plot_line_count to zero. (close_plot_stream): Likewise, set it to zero when closing the stream. * src/parse.y (plot_command): Allow replot without args. * src/tree-plot.cc (clear_before_plotting): New global variable. (tree_plot_command::eval): Use it to handle hold on/off. * src/t-builtins.cc (builtin_hold): New function. * src/builtins.cc (text_functions): Add it to the list. Fri Jun 24 11:08:36 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/token.h (plot_tok_type): Add new field, replot. * src/lex.l (is_keyword): Handle replot here. * src/parse.y (plot_command): And here. * src/g-builtins.cc (builtin_replot): Not here. * src/builtins.cc (general_functions): Or here. Tue Jun 21 10:47:08 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc (builtin_kbhit): New function. * src/builtins.cc (general_functions): Add it to the list. * src/tree-const.cc (tree_constant_rep::rows (void)): For strings and ranges, only return 1 if the string or range is not empty. Thu Jun 9 20:42:06 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_builtin::eval (int)): Delete ancient code that eval()'d the return value. (tree_builtin::eval (int, int)): Likewise. (tree_builtin::eval (int, char**, int)): Likewise. (tree_builtin::eval (tree_constant*, int, int, int)): Likewise. (tree_function::eval (tree_constant*, int, int, int)): Likewise. (tree_colon_expression::eval (int)): Likewise. (tree_unary_expression::eval (int)): Likewise. (tree_binary_expression::eval (int)): Likewise. Mon Jun 6 03:48:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/file-io.cc (fread_internal): Make it work. (fwrite_internal): Likewise. (num_items_remaining): Renamed from get_whats_left(). Don't pass nr/nc as last arg, simply return the number of items of size that are left to read. (get_size_conv): Delete unnecessary function. * liboctave/dMatrix.cc (Matrix::read): Make it work. (Matrix::write): Likewise. * liboctave/dMatrix.h (conversion): Delete unecessary enum. * src/sysdep.cc: Include . (octave_ieee_init): Cast return value of infinity() and quiet_nan() to double. Sun Jun 5 14:35:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * Makeconf.in (getversion): Get everything between the double quotes, not just numbers and periods. * src/tree-const.cc (tree_constant_rep::do_scalar_assignment): Correct typo in last change. * src/parse.y: Include tree-plot.h and tree-const.h. * src/Makefile.in (SOURCES): Delete tc-assign.cc and tc-index.cc (INCLUDES): Add tree-plot.h. * src/tree-plot.h: New file. Declare plotting classes here. * src/tree.h: Not here. * src/tc-index.cc, tc-assign.cc: Delete unnecessary files. * src/tc-extras.cc: Include EIG.h * src/tree-const.cc (tree_constant_rep::tree_constant_rep (RowVector&, int)): Provide default value for int arg. (tree_constant_rep::tree_constant_rep (ColumnwVector&, int)): Ditto (tree_constant_rep::tree_constant_rep (ComplexRowVector&, int)): Ditto (tree_constant_rep::tree_constant_rep (ComplexColumnwVector&, int)): Ditto. (tree_constant_rep::tree_constant_rep (RowVector&)): Delete, now handled by corresponding two arg constructor. (tree_constant_rep::tree_constant_rep (ColumnwVector&)): Likewise. (tree_constant_rep::tree_constant_rep (ComplexRowVector&)): Likewise. (tree_constant_rep::tree_constant_rep (ComplexColumnwVector&)): Likewise. * src/tree-const.cc: Add pragma implementation. Merge in contents of tc-index.cc and tc-assign.cc so that the pragma interface/pragma implementation hack will do some good. * src/tree-const.h: Include mx-base.h, not Matrix.h. Add pragma interface. Delete unnecessary constructor declarations. * src/unwind-prot.h, src/unwind-prot.cc (unwind_elem_tag): Rename from _tag. (unwind_elem_fptr): Rename from _fptr. (unwind_elem_ptr): Rename from _ptr. * NLConst.cc (NLConst::NLConst): Pass vector args by reference. * src/procstream.h, src/procstream.cc, src/idx-vector.h, src/idx-vector.cc, src/token.h, src/token.cc, src/unwind-prot.h, src/unwind-prot.cc, src/symtab.h, src/symtab.cc, src/tree.h, src/tree.cc, liboctave/Range.h, liboctave/Range.cc, liboctave/QLD.h, liboctave/QLD.cc, liboctave/ODE.h, liboctave/ODE.cc, liboctave/Quad.h, liboctave/Quad.cc, liboctave/Objective.h, liboctave/Objective.cc, liboctave/NPSOL.h, liboctave/NPSOl.cc, liboctave/NLFunc.h, liboctave/NLFunc.cc, liboctave/Bounds.h, liboctave/Bounds.cc, liboctave/QP.h, liboctave/QP.cc, liboctave/NLConst.cc, liboctave/LinConst.cc, liboctave/LPsolve.cc, liboctave/LP.cc, liboctave/FSQP.cc, liboctave/FEGrid.cc, liboctave/QPSOL.cc, liboctave/CollocWt.cc, liboctave/DAEFunc.cc, liboctave/DAEFunc.h, liboctave/DAE.cc, liboctave/NLEqn.cc, liboctave/ODEFunc.cc, liboctave/QPSOL.h, liboctave/ODEFunc.h, liboctave/NLP.h, liboctave/NLEqn.h, liboctave/NLConst.h, liboctave/LinConst.h, liboctave/LPsolve.h, liboctave/LP.h, liboctave/FSQP.h, liboctave/FEGrid.h, liboctave/DAE.h, liboctave/CollocWt.h: Add pragma interface/implementation. * src/f-svd.cc, src/f-schur.cc, src/f-qr.cc, src/f-lu.cc, src/f-hess.cc, src/f-det.cc, src/f-chol.cc, src/f-qzval.cc, src/f-inv.cc, src/f-ifft.cc, src/f-givens.cc, src/f-fft.cc, src/f-balance.cc, src/f-expm.cc, src/f-fsqp.cc, src/f-syl.cc, src/xdiv.cc, src/xpow.cc, src/idx-vector.cc, src/pr-output.cc, src/unwind-prot.cc, src/file-io.cc, liboctave/Bounds.h, liboctave/CollocWt.h, liboctave/DAE.h, liboctave/EIG.h, liboctave/FEGrid.h, liboctave/LP.h, liboctave/LPsolve.cc, liboctave/LinConst.h, liboctave/NLEqn.cc, liboctave/NLEqn.h, liboctave/NLP.h, liboctave/NPSOL.cc, liboctave/NPSOL.h, liboctave/ODE.h, liboctave/Objective.h, liboctave/QLD.cc, liboctave/QP.h, liboctave/QPSOL.h, liboctave/Quad.h: Instead of including Matrix.h, only include the individual matrix/vector/etc. header files that are needed. * liboctave/QLD.cc, liboctave/ODE.cc, liboctave/NLFunc.cc, liboctave/DAEFunc.cc, liboctave/DAE.cc, liboctave/NLEqn.cc, liboctave/ODEFunc.cc: Use 0, not NULL. * liboctave/mx-inlines.cc: Include Complex.h. * liboctave/mx-kludge.h: Don't enclose contents in extern "C++". * liboctave/Matrix.h: Simply include mx-base.h and mx-ext.h. * liboctave/mx-base.h: New file, includes all basic matrix/vector header files. * liboctave/mx-ext.h: New file, includes all extra matrix/vector related header files. * liboctave/mx-defs.h: New file, for matrix/vector related defines. Also provides forward declarations for all matrix/vector classes. * liboctave/Makefile.in: Cope with new files. * liboctave/CmplxAEPBAL.cc, liboctave/CmplxDET.h, liboctave/CmplxQR.cc, liboctave/CmplxSVD.h, liboctave/dbleDET.cc, liboctave/dbleHESS.h, liboctave/dbleSCHUR.cc, liboctave/CmplxAEPBAL.h, liboctave/CmplxHESS.cc, liboctave/CmplxQR.h, liboctave/dbleAEPBAL.cc, liboctave/dbleDET.h, liboctave/dbleLU.cc, liboctave/dbleSCHUR.h, liboctave/CmplxCHOL.cc, liboctave/CmplxHESS.h, liboctave/CmplxSCHUR.cc, liboctave/dbleAEPBAL.h, liboctave/dbleGEPBAL.cc, liboctave/dbleLU.h, liboctave/dbleSVD.cc, liboctave/CmplxCHOL.h, liboctave/CmplxLU.cc, liboctave/CmplxSCHUR.h, liboctave/dbleCHOL.cc liboctave/dbleGEPBAL.h, liboctave/dbleQR.cc, liboctave/dbleSVD.h, liboctave/CmplxDET.cc, liboctave/CmplxLU.h, liboctave/CmplxSVD.cc, liboctave/dbleCHOL.h, liboctave/dbleHESS.cc, liboctave/dbleQR.h, liboctave/EIG.h, liboctave/EIG.cc: New files, extracted from Matrix-ext.cc, in an attempt to allow effective use of pragma interface/implementation and make generated code somewhat smaller. * liboctave/dColVector.cc liboctave/CColVector.cc: Likewise, from ColVector.{cc,h}. * liboctave/dRowVector.cc liboctave/CRowVector.cc: Likewise, from RowVector.{cc,h}. * liboctave/dMatrix.cc liboctave/CMatrix.cc: Likewise, from Matrix.{cc,h}. * liboctave/dDiagMatrix.cc liboctave/CDiagMatrix.cc: Likewise, from DiagMatrix.{cc,h}. Fri Jun 3 15:32:53 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Array.h: Include assert.h. (DiagArray::operator T ()): [! _AIX] Only call get() if i is also equal to j. * scripts/rem.m: Allow mixing of scalar/matrix args, but complain if both args are matrices and the dimensions don't agree. * src/lex.l (grab_help_text): Correct previous change. Thu Jun 2 12:08:18 1994 John Eaton (jwe@schoch.che.utexas.edu) * Matrix.h (conversion): New enum, for binary read/write functions. * Matrix.cc (read, write) New functions. * file-io.cc (feof_internal, ferror_internal, fread_internal, fwrite_internal, get_size_conv, get_whats_left): New functions. * g-builtins.cc (builtin_feof, builtin_ferror, builtin_fread, builtin_fwrite): New functions. * builtins.cc (general_functions): Add them to the list. * configure.in: Check for infinity() and quiet_nan(). * sysdep.h (octave_Inf, octave_NaN): New global variables. * sysdep.cc (octave_ieee_init): New function. Initialize octave_Inf and octave_NaN. (sysdep_init): Call it. * builtins.cc (initialize_builtins): Don't compute Inf and NaN values here. Tue May 31 20:06:27 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/variables.cc (identifier_exists): Only return 1 for variables if they are also defined. Sun May 29 20:40:55 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/lex.l: Don't declare beginning_of_function as static. (COMMENT): Delete unnecessary exclusive start state. (\#, \%): Handle comments directly. Try to be smart about not returning a newline character when reading a matrix list. (grab_help_text): Don't put a newline back on the input stream. * src/parse.y (list1): Set beginning_of_function to zero here. Wed May 25 03:34:17 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/error.cc (error): If error_state is -2, don't do anything. If the format string ends in a new line character, strip it, print the error message, and set the error state to -2. * src/tree.cc (tree_function::traceback_error): Don't set the error_state if it is already negative. * src/tree-const.cc (convert_to_row_or_column_vector): New function. * src/idx-vector.cc (idx_vector::shorten): New function. * src/tc-assign.cc (fortran_style_matrix_assignment (tree_constant&, tree_constant&)): Handle deleting elements by assignment of `[]'. Use convert_to_row_or_column_vector to handle conversion to a vector in the case of deleting some elements from a matrix. Use idx_vector::shorten() to remove unnecessary index vector elements. (do_scalar_assignment (tree_constant&, tree_constant*, int)): Handle assignment of empty matrix. If converting complex to real, delete old complex value. (delete_rows (idx_vector&)): If deleting all rows of a column vector, convert to empty matrix. (delete_rows (Range&)): Ditto. (delete_columns (idx_vector&)): If deleting all columns of a row vector, convert to empty matrix. (delete_columns (Range&)): Ditto. * src/tc-extras.cc (column_max (tree_constant*, int, int)): Use MAX, not MIN when trying to find the biggest scalar. Likewise, find the complex scalar with the largest, not the smallest absolute value. * src/tc-assign.cc (do_matrix_assignment (tree_constant&, tree_constant_rep::constant_type, tree_constant&): For case of j_arg == matrix constant, don't negate return value of indexed_assign_conforms(). * src/user-prefs.cc (commas_in_literal_matrix): New function. Put functions in alphabetical order. * src/user-prefs.h (commas_in_literal_matrix): New structure element. Alphabetize structure elements and lists of functions. * src/builtins.cc (string_variables): Add commas_in_literal_matrix to the list. * src/lex.l ({SN}*\]{S}*): Pay attention to the value of usre_pref.commas_in_literal_matrix when deciding whether to insert a comma after seeing a ']' character. (handle_identifier): Likewise. ({S}+): If commas are required, just eat the spaces. Tue May 24 19:49:51 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-assign.cc (tree_constant_rep::do_matrix_assignment (tree_constant&, tree_constant*, int)): Handle empty arguments for two index values. (tree_constant_rep::do_matrix_assignment (tree_constant&, tree_constant&)): Likewise, for single index values. Mon May 23 01:43:23 1994 John Eaton (jwe@schoch.che.utexas.edu) * Makefile.in (snapshot, snapshot-version): New targets. * configure.in: Handle --enable-run-in-place (was easier than doing the work to parse --run-in-place like Emacs uses). * acconfig.h: Add #undef for RUN_IN_PLACE. * Makeconf.in (OCTAVE_HOME): New macro. * src/Makefile.in (defaults.h): Use it instead of ${prefix}. * Makeconf.in (OCTAVE_INFO_DIR, OCTAVE_LIB_DIR): New macros. * src/Makefile.in (defaults.h): Substitute them too. * src/defaults.h.in (OCTAVE_INFO_DIR): New macro, used if RUN_IN_PLACE is defined. (OCTAVE_LIB_DIR): Likewise. * src/utils.cc (octave_home): Handle RUN_IN_PLACE (octave_info_dir): Ditto. (octave_lib_dir): Ditto. * src/tree-const.cc (tree_constant_rep::diag (void)): For empty matrix, return empty matrix. (tree_constant_rep::diag (tree_constant &)): Likewise, regardless of value of arg. * scripts/int2str.m: Format as integer, not float. Don't add trailing new line character. Sun May 22 22:13:01 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/plot_int.m: When looking for imaginary arguments, check if any element has an imaginary component, not if all elements have imaginary components. Thu May 19 19:46:23 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/parse.y (EXPR_AND_AND, EXPR_OR_OR): New tokens, for short-circuit logical AND and OR operators. (simple_expression): Handle new tokens. * src/lex.l (&&) [SHORT_CIRCUIT_LOGICALS]: Return EXPR_AND_AND. (||) [SHORT_CIRCUIT_LOGICALS]: Return EXPR_OR_OR. * src/tree.cc (tree_binary_expression::eval): Handle short-circuit boolean operators. (tree_binary_expression::eval_error): Print different messages for or_or/or and and_and/and. * src/tree-base.h (tree_expression_type): Add new structure elements and_and and or_or. * src/tree-const.cc (tree_constant_rep::is_true): New function. Tue May 17 17:04:00 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/idx-vector.cc (idx_vector::sort_uniq ()): New function. * src/tc-assign.cc (tree_constant_rep::delete_rows ()): Use it. (tree_constant_rep::delete_columns ()): Likewise. Mon May 16 13:31:33 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/linspace.m: Replace for loop with range operation. * scripts/logspace.m: Replace for loop with element by element exponentiation. Sun May 8 00:49:38 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/lqe.m: Correct comment. Transpose k before returning. Fri May 6 00:47:24 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (quit_loop_now): New function. (tree_while_command::eval): Use it. (tree_for_command::eval): Ditto. * src/tree.cc (tree_for_command::do_for_loop_once): New function. (tree_for_command::eval): Use it. Mon May 2 19:45:39 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_for_command::eval): Handle returning, breaking, and continuing for case of scalar expression in loop control statement. Wed Apr 20 00:38:26 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/lex.l (\[{S}*): Don't return ',' for this match when convert_spaces_to_comma is true, since that can never be the right thing to do. * All Makefile.in files: Set top_srcdir here. * Makeconf.in: Not here. * Makeconf.in: Use top_srcdir instead of root_srcdir * configure.in: Update for autoconf-1.8. Use AC_VERBOSE for verbose messages. Use AC_WARN and AC_ERROR instead of echo for warning and error messages. Organize feature tests a bit better. Use new autoconf macros to check for C++ compiler. Add copyright notice. Recognize --enable-dld instead of --with-dld since that seems to be more in line with the intent of the --enable/--with options for configure scripts. Use new autoconf macros AC_REVISION and AC_PREREQ. Don't add -Wall to CFLAGS and CXXFLAGS until after all feature tests are done. Etc. Fri Apr 15 01:56:20 1994 John Eaton (jwe@schoch.che.utexas.edu) * acconfig.h: Add #undefs for HAVE_FINITE, HAVE_ISINF, and HAVE_ISNAN. * configure.in: Check for floatingpoint.h. * src/sysdep.cc (sysdep_init): Disable trapping on common exceptions for 386BSD systems that have floatingpoint.h. * src/utils.cc: Don't declare ioctl() with prototype. Sat Apr 9 17:48:07 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-assign.cc (tree_constant_rep::fortran_style_matrix_assignment (tree_constant&, tree_constant&)): Handle case of M (X) = scalar, where X is a zero-one vector with only one nonzero element. * src/tc-assign.cc (tree_constant_rep::do_vector_assign (tree_constant&, Range&): Handle case of right hand side being a scalar. (tree_constant_rep::do_vector_assign (tree_constant&, idx_vector&): Ditto. * src/tc-assign.cc (tree_constant_rep::do_matrix_assignment (int,tree_constant_rep::constant_type)): Allow assignment of complex scalar too. (tree_constant_rep::do_matrix_assignment (tree_constant_rep::constant_type, int)): Ditto. * src/tree-const.h (REP_RHS_MATRIX): Initialize nr and nc. Abort if rhs is not a real or complex matrix. Wed Apr 6 13:59:37 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Range.cc (Range::nelem_internal): Use an integer, not a double, for the number of intervals. Avoid possible problems with extended precision registers on some systems (e.g. x86/Linux). Mon Mar 28 17:23:18 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc (raw_mode): For OCRNL, ONOCR, and ONLRET, check to see if they are defined before using them instead of checking to see if NeXT is defined. * info/terminal.c (terminal_prep_terminal): Check to see if OCRNL is defined before using it instead of checking to see if NeXT is defined. Thu Mar 24 03:21:01 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_parameter_list::define_from_arg_vector): New function. (tree_parameter_list::convert_to_const_vector): Ditto. (tree_function::eval): Use them instead of trying to do this in-line. * src/symtab.h (symbol_record::global_link_context): New stack for saving linked_to_global flag. * src/symtab.cc (symbol_record::push_context): Save linked_to_global too. (symbol_record::pop_context): And restore it. Wed Mar 23 16:18:19 1994 John Eaton (jwe@schoch.che.utexas.edu) * doc/refcard.tex.in: New file. * doc/Makefile.in: Create refcard.* and refcard-local.* from refcard.tex.in. Tue Mar 22 15:23:55 1994 John Eaton (jwe@schoch.che.utexas.edu) * octave.sh: exec $OCTAVE_HOME/bin/octave.bin, not just octave.bin. Thu Mar 17 01:06:10 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/arith-ops.cc (do_binary_op (ComplexMatrix&, Matrix& b)): Correctly handle element by element left division. * src/g-builtins.cc (builtin_error): Return without calling error (and setting error_state) if the message is empty. * src/help.cc (operators): Correct help message for `.^'. * src/tc-index.cc (tree_contant_rep::fortran_style_matrix_index): Preserve vector orientation when indexing with a zero-one vector. * src/tc-index.cc (tree_constant_rep::do_scalar_index): Handle indexing a scalar with `0'. * src/tc-index.cc (tree_constant_rep::do_scalar_index): Handle the index `:' the same as the index `1'. Tue Mar 15 17:22:00 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Array.cc: Fix typo in comments about compiler flags. Wed Mar 9 15:08:21 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 1.0.1. * src/*.h: Use the macro octave_FOO_h instead of _FOO_h to protect against multiple inclusion. * liboctave/*.h: Likewise. * liboctave/*.h: Surround contents of files in extern "C++" { }. Tue Mar 8 18:06:54 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-index.cc (tree_constant_rep::do_vector_index (const tree_constant&) const): Don't crash if matrix is empty. * scripts/norm.m: Return empty matrix for empty argument. Mon Mar 7 23:34:44 1994 John Eaton (jwe@schoch.che.utexas.edu) * doinstall.sh: chmod new directories to 755. Sat Mar 5 13:15:10 1994 John Eaton (jwe@schoch.che.utexas.edu) * bsd-math/log1p.c: Declare finite as returning int, not double. * bsd-math/finite.c (finite): Add return type. Thu Mar 3 14:42:00 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/DiagMatrix.cc (operator *): Provide definitions for DiagMatrix * DiagMatrix, ComplexDiagMatrix * ComplexDiagMatrix, ComplexDiagMatrix * DiagMatrix, and DiagMatrix * ComplexDiagMatrix. * liboctave/ColVector.cc (operator >>): Provide definitions for real and complex column vectors. * liboctave/RowVector.cc (operator >>): Provide definitions for real and complex row vectors. Wed Mar 2 18:00:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Array.h (DiagArray::Proxy::operator & ()): Provide function body. Tue Mar 1 13:18:35 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-const.cc (tree_constant::load (istream&)): Don't skip past first type keyword if not global. (tree_constant::load (istream&, tree_constant_rep::constant_type)): Allocate storage for reading complex scalar. Sun Feb 20 14:17:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/menu.m: Don't fail on input that is empty or not a scalar. * Makefile.in (DISTFILES): Distribute ChangeLog.[0-9]. * src/lex.l (reset_parser): Don't resynch line number to command history number if reading a script file. See ChangeLog.1 for earlier changes. octave-1.1.0/ChangeLog.1100666 415 17 741331 5531742740 13130 0ustar jweusersThu Feb 17 01:36:19 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 1.0 released. * src/file-io.cc (fopen_file_for_user): Improve error message. (fopen_internal): Likewise. Wed Feb 16 02:21:05 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Try harder to find finite, isnan, and isinf. Use m4 `dnl' comments, not shell `#' comments. * src/file-io.cc (file_io_get_file): New function. (fgets_internal): Use it instead of trying to do this in line. (frewind_internal, fseek_internal, ftell_internal, do_printf, do_scanf): Likewise. * (do_scanf): Allow file name as string for fscanf. * (procss_scanf_format): Delete unused argument `args'. Delete unused local variable `arg_type'. Don't complain if we can't store the result of a requested conversion. Only return successfully if a conversion actually occurs, even if we are not storing the value. Sun Feb 13 13:32:03 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.83 released. * Array.h (DiagArray): Move inline definitions of get() and set() before use by other inline functions. Sat Feb 12 14:15:45 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check for g77 last. Even if it is ever actually released, it probably won't be stable for quite a while. * MAKEINFO.PATCH: New file. * Makefile.in (DISTFILES): Distribute it. * liboctave/Matrix.cc (operator + (Complex, const Matrix&)): Make it work. (operator - (Complex, const Matrix&)): Ditto. (operator * (Complex, const Matrix&)): Ditto. (operator / (Complex, const Matrix&)): Ditto. Fri Feb 11 00:03:39 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check for strerror too. * configure.in: When saving CFLAGS as XCFLAGS and then restoring the value, quote the RHS. * src/g-builtins.cc (builtin_clc): Do the dirty work to clear the screen here instead of using rl_clear_screen to avoid printing prompt unnecessarily. Thu Feb 10 00:26:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc: Add all the cruft that the autoconf manual suggests for including dirent.h. * info/terminal.c (terminal_prep_terminal): [HAVE_TERMIOS_H && NeXT]: Don't use OCRNL, as someone says NeXT's termios.h doesn't have it. * configure.in (GCC_IEEE_FP_FLAG): Correct check for ix86 Linux. Don't try to check for CC == gcc. Add GCC_IEEE_FP_FLAG to CFLAGS while checking for IEEE FP functions finite, isnan, and isinf. * readline/rldefs.h: Make definition of HAVE_POSIX_SIGNALS conditional on definition of _POSIX_VERSION, not HAVE_TERMIOS_H. Wed Feb 9 02:41:32 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_function::octave_va_start): Rename from va_start to avoid conflict with va_start macro. (tree_function::octave_var_arg): Likewise, rename from va_arg. * src/g-builtins.cc (builtin_va_arg): Call octave_va_arg for the current function instead of va_arg. (builtin_va_start): Likewise, for octave_va_start. * Version 0.82.1. * doc/Makefile.in (clean): Also remove octave.in, octave.rd, octave.ins, and octave.rds. * src/t-builtins.cc (load_variable): Make it work for all combinations of loading global or local variables when the variable to be loaded is already a global variable, local variable, a function, or even undefined. Tue Feb 8 00:33:09 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.82 released. * liboctave/mx-kludge.cc (operator + (KL_MAT_TYPE, KL_MAT_TYPE)): For an empty matrix with one nonzero dimension, be sure to return a result of the same size. (operator - (KL_MAT_TYPE, KL_MAT_TYPE)): Ditto. (product (KL_MAT_TYPE, KL_MAT_TYPE)): Ditto. (quotient (KL_MAT_TYPE, KL_MAT_TYPE)): Ditto. Mon Feb 7 01:30:19 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Array.h, liboctave/array.cc (DiagArray): Back off on indexing via Proxy class changes for AIX systems to avoid gcc (or possibly AIX assembler?) bug. * src/tree-const.cc (tree_constant_rep::maybe_resize (int, force_orient)): Don't abort for a max index of zero. * liboctave/Matrix.h (class RowVector, friend double operator * (const RowVector&, const ColumnVector&)): Add missing const in declaration. * liboctave/Matrix.cc (Matrix::fill (val, r1, c1, r2, c2)): Set nc to cols(), not rows(). (ComplexMatrix::fill (double val, r1, c1, r2, c2)): Likewise. (ComplexMatrix::fill (Complex val, r1, c1, r2, c2)): Likewise. * All source files: To match the documenation, refer to function files, not M-files. Rename functions and variables that refer to _m_file_, mfile, or mf to refer to _fcn_file, ffile, or ff. Sun Feb 6 19:08:26 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/parse.y (yyerror): Don't crash if a parse error happens and the current input line is NULL. Sat Feb 5 18:53:04 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/file-io.cc (initialize_file_io): Don't use variable names that start with `_'. * src/file-io.cc (class file_info): Likewise. Fri Feb 4 01:15:59 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/builtins.cc (general_functions): In usage message for fopen, use `Valid' instead of `Legal'. * src/file-io.cc (do_printf): Use `invalid' instead of `illegal' in error message. (do_scanf): Likewise. * src/mappers.cc (atanh): Use correct formula. Thu Feb 3 22:08:40 1994 John Eaton (jwe@schoch.che.utexas.edu) * doc/refcard.tex: New file. * doc/Makefile.in (all): Make refcard.ps. (DISTFILES): Distribute refcard.tex, refcard.dvi, and refcard.ps. * src/tree-const.cc (any_element_is_negative): Delete function. (any_element_less_than): New function. (any_element_greater_than): Ditto. (tree_constant_rep::mapper): Use struct elements lower_limit, upper_limit, and can_return_complex_for_real_arg to properly handle functions like acos, asin, atanh, and acosh. * src/builins.h (struct Mapper_fcn): Rename neg_arg_complex to can_return_complex_for_real_arg. New elements, lower_limit and upper_limit. (struct builtin mappers functions): Rename neg_arg_complex to can_return_complex_for_real_arg. New elements, lower_limit and upper_limit. Delete elements nargin_max and nargout_max. * src/variables.cc (install_builtin_mapper_function): Handle new struct elements can_return_complex_for_real_arg, lower_limit, and upper_limit. Don't use nargin_max and nargout_max -- they are the same for all mapper functions. Wed Feb 2 05:06:56 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Matrix.h: Don't include values.h. * liboctave/Matrix-ext.cc: Include float.h (DET::value_will_overflow): Use DBL_MAX, not MAXDOUBLE. (ComplexDET::value_will_overflow): Likewise. (DET::value_will_underflow): Use DBL_MIN, not MINDOUBLE. (ComplexDET::value_will_underflow): Likewise. * src/tree.cc: Include limits.h, not values.h. (tree_builtin::max_expected_args): Use INT_MAX, not MAXINT. * configure.in: If compiling on an ix86, set GCC_IEEE_FP_FLAG to -mieee-fp. We should no longer require the modified crt0 code on Linux systems in order to get IEEE functions. * Makeconf.in (GCC_IEEE_FP_FLAG): Substitute value. (ALL_CFLAGS, UGLY_ALL_CFLAGS, ALL_CXX_FLAGS, UGLY_ALL_CXX_FLAGS, ALL_LDFLAGS): Use it. Tue Feb 1 22:30:46 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/builtins.cc (install_builtins): Make SEEK_SET, SEEK_CUR, and SEEK_END constants. * src/tree-plot.cc (tree_subplot_using::print): Only check column number against max if max is greater than 0. Mon Jan 31 15:59:31 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/strcmp.m: Correctly handle empty strings. * src/parse.y (input): Recognize lone simple_list and simple_list followed by error and '\n'. Fri Jan 28 00:20:30 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.81 released. * src/octave.cc (clean_up_and_exit): Call cleanup_tmp_files() here too. * configure.in: Check for atexit and on_exit. * src/octave.cc: Use HAVE_ATEXIT and HAVE_ON_EXIT (instead of just checking to see if sun is defined) to decide whether to define atexit as on_exit. (main): Don't try to call atexit if it's missing and we don't have on_exit either. Thu Jan 27 22:16:48 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check for gethostname and sys/utsname.h. * utils.cc (gethostname): Steal replacement from bash. Provide definition if it looks like it's missing and we have sys/utsname.h. * liboctave/Array.h (DiagArray): Define non-const indexing functions here. * liboctave/Array.cc (DiagArray): Not here. * liboctave/Array.h (DiagArray::Proxy): New class to handle non-const reference indexing. Allows different action if indexing on left side of assignment operator. * src/octave.cc (main): Call initialize_pager(), initialize_readline(), and install_signal_handlers() before trying to read startup files. * src/octave.cc (input_from_startup_file): New global flag. (execute_startup_files): Set it to 1 before reading startup files. * src/parse.y (func_def_2): If input_from_startup_file, don't try to compare file name and function name. Wed Jan 26 14:39:27 1994 John Eaton (jwe@schoch.che.utexas.edu) * readline/rldefs.h: Make better use of autoconf defines. Tue Jan 25 17:19:19 1994 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/Matrix.cc (ComplexMatrix (DiagMatrix)): Make sure off diagonal elements are zero. (ComplexMatrix (ComplexDiagMatrix): Likewise. (Matrix (DiagMatrix): Likewise. Fri Jan 21 17:43:11 1994 John Eaton (jwe@schoch.che.utexas.edu) * flibs.sh: Recognize libraries that match `/*.a'. Thu Jan 20 18:12:01 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.80.1. Wed Jan 19 14:48:27 1994 John Eaton (jwe@schoch.che.utexas.edu) * libcruft/odepack/stode.f: Don't try to `RETURN 0'. This causes lsode to fail, at least with Sun's f77. * src/tree-const.cc (tree_constant_rep::load): Delete string returned from extract_keyword. * src/t-builtins.cc (builtin_load): Likewise. * src/variables.cc (extract_keyword): Return new storage, not static buffer. * src/t-builtins.cc (builtin_save): If saving a named list of variables, use is_globally_visible to decide whether to mark variables in the current symbol table as global. Tue Jan 18 11:57:03 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.80 released. * doc/Makefile.in (install): Delete commands for installing liboctave.info instead of trying to comment them out. * liboctave/Array.cc: Allow users to compile with -fexternal-stemplates and USE_EXTERNAL_TEMPLATES defined to generate their own .o files with new types. * Makeconf.in (includedir): Install include files in $prefix/include/octave by default. * liboctave/Makefile.in (TEMPLATE_SRC): New macro. (install): Install files listed in $(TEMPLATE_SRC) too. * info/search.h: Conditionally declare stricmp and strnicmp. * info/search.c: Conditionally define stricmp and strnicmp. * config.h.in: Add undefs for HAVE_STRICMP and HAVE_STRNICMP. * configure.in: Check for stricmp and strnicmp too. * doc/Makefile.in: For now, don't format or try to install the liboctave manual. Don't distribute formatted copies of liboctave manual. Mon Jan 17 01:10:54 1994 John Eaton (jwe@schoch.che.utexas.edu) * doc/Makefile.in (clean): Remove all index files. * src/Makefile.in (defaults.h): Depend on Makefile too. * doc/Makefile.in (conf.texi): New rule for making conf.texi from conf.texi.in. * doc/conf.texi.in: New file. * doc/octave.texi: Include conf.texi to get VERSION, OCTAVE_HOME, and other variables that need to be set depending on the configuration. * Makefile.in (DISTFILES): Don't distribute PLOTTING. Current plotting info is in the Texinfo docs. Sat Jan 15 15:43:34 1994 John Eaton (jwe@schoch.che.utexas.edu) * config.sub: New file, from libg++-2.5.2. * Makefile.in: Distribute config.sub. * configure.in: Use config.sub to validate system types. If it fails, continue with target_host_type and canonical_host_type set to unknown. Leave target_host_type set to any alias given as the TARGET argument to configure. * readline/rldefs.h: If ultrix and HAVE_SGTTY_H, avoid Posix terminal driver. * configure.in: If configuring for ultrix, check for sgtty first. If not found, go ahead and check for Posix terminal driver. * configure.in: Don't try to do anything special for readline on NeXT systems. * Makeconf.in: Define rules for making .d files here. liboctave/Makefile.in: Not here. src/Makefile.in: Or here. * liboctave/Matrix.h (all Matrix/Vector operator = functions): Simply call the base class operator =, then return *this. (class ColumnVector): Declare RowVector a friend class, so it can access the private constructor for the transpose operator. (class RowVector): Likewise, for ColumnVector. (class ComplexColumnVector): Likewise, for CommplexRowVector. (class ComplexRowVector): Likewise, for ComplexColumnVector. Numerous formatting cleanups. Thu Jan 13 13:17:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.79.90. * builtins.cc: Include missing-math.h. * src/missing-math.h: Provide declarations for acosh, asinh, atanh, and gamma whether they are actually missing or not, because they are not part of the standard math.h, and the g++/libg++ installation no longer provides declarations for them. * src/sighandlers.h (RETSIGTYPE): Define here. (BADSIG): Likewise. (sig_handler): Likewise. * src/g-builtins.cc: Include sighandlers.h Don't define RETSIGTYPE, BADSIG, or sig_handler here. * src/octave.cc: Or here. Wed Jan 12 16:12:27 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc: Don't check nargin/nargout in *_options functions. * src/f-qpsol.cc, src/f-quad.cc, src/f-lsode.cc, src/f-fsolve.cc, src/f-dassl.cc, liboctave/QPSOL.cc, liboctave/Quad.cc, liboctave/ODE.cc, liboctave/NLEqn.cc, liboctave/DAE.cc: Similar changes for these classes/functions as the following changes for src/f-npsol.cc and liboctave/NPSOL.cc: * src/f-npsol.cc (npsol_opts): New static variable to hold Octave's current idea of npsol options. (npsol): Call nlp.copy (npsol_opts) after creating NPSOL object. (npsol_option_table): New static list of options for npsol. (print_npsol_option_list): New function. (do_npsol_option): New function. (npsol_options): Make it work. * liboctave/NPSOL.cc (NPSOL_options): New class. * (NPSOL): Also derive from NPSOL_options. * (minimize): Call pass_options_to_npsol before calling npsol. * (NPSOL::option): No longer works. Print error message instead. * (NPSOL::set_default_options): Now a member of NPSOL_options class. * src/utils.cc: If missing, declare strcasecmp, strncasecmp. * (almost_match): Add new argument to do case-insensitive matches. * (keyword_almost_match): New function to match a string against a list of keywords. * liboctave/NLP.h (NLP): Add destructor and copy constructor. * configure.in: Check for strcasecmp and strncasecmp. * config.h.in: Add #undefs for HAVE_STRCASECMP and STRNCASECMP. * src/strcasecmp.c, src/strncase.c: New files, from glibc. * src/Makefile.in (SOURCES, OBJECTS): List them. * src/builtins.cc (general_functions): Improve usage message for the *_options functions. (print_usage): New arg, just_usage with default value of 0. If nonzero, don't print info about where to find additional help. * src/Makefile.in (INCLUDES): Add error.h. (SOURCES): Add error.h. * src/tree.cc (tree_identifier::parse_m_file): call reset_parser before calling yyparse (). * src/tc-extras.cc (eval_string): Likewise. Don't save previous symbol table. That is handled by the unwind protect. * src/lex.l (reset_parser): Don't unconditionally call yyreset. Add a couple of comments. (yywrap): Always return 1, not 0. (yy_flex_alloc, yy_flex_realloc, yy_flex_free): #if 0 out. * src/utils.cc (raw_mode): Only complain about stdin not being a tty if we are really interactive. * src/octave.cc (main): End startup message with endl to ensure flushing before other output. * Turn of readline's blink_matching_paren feature if not interactive, or if reading from a file specified on the command line. * src/octave.cc (main): Set the symbol table context just before calling reset_parser in the main loop. * src/lex.l (reset_parser): Not here. * src/input.cc (octave_gets): Declare static. (octave_read): Also handle echoing input if not using readline. * Makefile.in (DISTFILES): Add SENDING-PATCHES to the list. Mon Jan 10 14:30:13 1994 John Eaton (jwe@schoch.che.utexas.edu) * scripts/corrcoef.m, scripts/fortran_vec.m, scripts/kurtosis.m, scripts/ols.m, scripts/skewness.m, scripts/cov.m, scripts/gls.m, scripts/mahalanobis.m, scripts/pinv.m: New script files from Kurt Hornik (hornik@neuro.tuwien.ac.at) and the Department of Probability Theory and Statistics TU Wien, Austria. Sun Jan 9 01:11:05 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc (builtin_fsqp_options): If FSQP_MISSING is defined, don't call fsqp_options; just print usage message. (builtin_npsol_options): Likewise, for npsol_options. (builtin_qpsol_options): Likewise, for qpsol_options. * src/builtins.cc (general_functions): Provide different usage message for fsqp_options depending on whether FSQP_MISSING is defined. Likewise for npsol_options and qpsol_options. Sat Jan 8 16:45:57 1994 John Eaton (jwe@schoch.che.utexas.edu) * libcruft/misc/dostop.c: Include config.h. * src/variables.cc (extract_keyword): Use ostrstream instead of fixed length buffer. For keywords with string values, return value in static buffer. * src/t-builtins.cc (builtin_load): Handle new argument list for extract_keyword. Handle possiblity of load_variable setting error_state. * src/tree-const.cc (tree_constant_rep::load): Handle new argument list for extract_keyword. Fri Jan 7 13:20:47 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/f-eig.cc (builtin_eig_2): Rename from builtin_eig. * src/f-fsolve.cc (builtin_fsolve_2): Rename from builtin_fsolve. * src/f-inv.cc (builtin_inv_2): Rename from builtin_inv. Thu Jan 6 12:29:41 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-base.h (tree::save): Add optional argument `precision'. * src/tree-const.cc (tree_constant::save): Ditto. (tree_constant_rep::save): Ditto. * src/symtab.cc (symbol_def::save): Ditto. (symbol_record::save): Ditto. (symbol_table::save): Ditto. * src/t-builtins.cc (builtin_save): Pass user_pref.save_precision to symbol table save functions. * src/builtns.cc (string_variables): Add save precision to thelist. (install_builtins): Initialize it. * src/user-prefs.cc (set_save_precision): New function. * src/user-prefs.h (user_pref.save_precision): New data element. * liboctave/Matrix-ext.cc: Provide correct prototypes for dgeesx and zgeesx. * (SCHUR::init): Don't declare a dummy_select function pointer, just pass `(void *) 0' instead, since the dummy argument is never supposed to be used anyway. * src/input.cc (initialize_readline): Cast command_completer to CPPFunction, not Function, now that readline has more than one function typedef. * Add extern declaration for free_undo_list (). * Replace readline source from GDB with readline source from bash. This allows paren matching. Wed Jan 5 01:20:26 1994 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: Also check for sys/select.h. * liboctave/RowVector.cc (ComplexRowVector::operator *): Complete function body. Put code in-line rather than making a call to the BLAS routine zdotu to avoid having to cope with the various ways that Fortran compilers might translate this. * src/input.cc (operate_and_get_next): New function, from bash. (initialize_readline): Bind operate_and_get_next to C-O here. * src/input.cc (command_completer, command_generator): Declare static here. * srs/input.h (command_completer, command_generator): Not extern here. * g-builtins.cc (builtin_warranty): Change copyright info. * octave.cc (verbose_usage): Likewise. (main): Likewise. Mon Jan 3 15:49:41 1994 John Eaton (jwe@schoch.che.utexas.edu) * src/fnmatch.c, src/fnmatch.h: New files for pattern matching from the GNU C library. * src/Makefile.in: Add them to the appropriate lists. * src/t-builtins.cc (builtin_save): Use fnmatch to do pattern matching instead of using regular expressions. (builtin_clear): Likewise. (glob_pattern_p): New function. (builtin_save): Print error message and return if only given one argument that contains globbing characters. * src/symtab.cc (symbol_record::save): Don't attempt to save undefined variables. Wed Dec 29 02:55:08 1993 John Eaton (jwe@schoch.che.utexas.edu) * scripts/rank.m: Also need to compute SVD when nargin == 2. Correct usage message. Wed Dec 15 01:44:18 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/f-lpsolve.cc, src/f-fsqp.cc, src/f-npsol.cc, src/f-qpsol.cc, src/f-lsode.cc, src/f-dassl.cc, src/f-fsolve.cc, src/f-quad.cc: New stub options functions, XXX_options, and XXX_options_2 (for future dld use), where XXX is lpsolve, fsqp, npsol, etc. * src/f-lpsolve.h, src/f-fsqp.h, src/f-npsol.h, src/f-qpsol.h, src/f-lsode.h, src/f-dassl.h, src/f-fsolve.h, src/f-quad.h: Declare XXX_options functions. * src/builtins.cc (builtin_general_functions): Add new XXX_options functions to the list of builtin functions. * src/g-builtins.cc: Define builtin_XXX_options functions. * src/g-builtins.h: Declare them. * scripts/tzero.m: Add missing comma in fprintf call. Tue Dec 14 00:24:35 1993 John Eaton (jwe@schoch.che.utexas.edu) * libcruft/quadpack/*.f: Modify to handle user-requested termination from inside the user-supplied function. * src/f-quad.cc (quad_user_function): Set quad_integration_error if an error is encountered in the user-supplied function. * liboctave/Quad.h (quad_integration_error): New global variable. * liboctave/Quad.cc (user_function): Handle quad_integration_error, and error flag for modified Quadpack functions. * src/tree.cc (tree_simple_assignment_expression::eval): Check error status after calling convert_to_const_vector () on the argument list. (tree_index_expression::eval): Ditto. * src/tree.cc (tree_argument_list::convert_to_const_vector): If an error is encountered while evaluating an element of the list, print an error message including the element number. * liboctave/ODE.cc (integration_error): New private data member. (ODE constructors): Initialize it to zero. (ODE::integrate (double)): Reset it to zero before each integration step. (lsode_f): Treat empty vector returned from user-supplied function as an error. * src/f-lsode.cc (lsode_user_function): Return empty vector if error is encountered in user-supplied function. Don't jump to top level on error. * libcruft/odepack/lsode.f (lsode): Return with istate = -13 on error from user supplied subroutine. * libcruft/odepack/lsode.f (lsode): Handle extra argument returned from user-supplied function. * libcruft/odepack/stode.f (stode): Likewise. * libcruft/odepack/prepj.f (prepj): Likewise. Wed Dec 8 01:30:57 1993 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/DAE.cc (integration_error): New private data member. (DAE constructors): Initialize it to zero. (DAE::integrate (double)): Reset it to zero before each integration step. (dassl_f): Treat empty vector returned from user-supplied function as an error. * src/f-dassl.cc (dassl_user_function): Return empty vector if error is encountered in user-supplied function. Don't jump to top level on error. * liboctave/NPSOL.cc (npsol_objective_error): New global variable. (npsol_objfun): Set to zero before calling user-supplied function. Check after calling user-supplied function. Set mode to -1 on error. (npsol_confun): Set mode to -1 on error. (npsol declaration): Declare args for user-supplied functions. * src/f-npsol.cc (npsol_objective_function): If an error is encountered in the calculation of the objective function, set npsol_objective_error to 1. (npsol_constraint_function): Treat empty vector returned from user-supplied function as an error. * liboctave/Array.cc (*::checkelem): Correct bounds checking. On error, return uninitialized value of type T. This avoids placing an extra requirement on the class that can be used as an array element. (*::operator ()): Likewise. Mon Dec 6 07:24:49 1993 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/NLEqn.cc (hybrd1 declaration): Declare args for user-supplied fuction. (hybrj1): Likewise. (hybrd1_fcn): Treat return of empty vector from user supplied function as an error by setting iflag to -1. (hybrj1_fcn): Likewise. (solve): Handle case of info < 0 returned from hybrd1. * src/f-fsolve.cc (fsolve_user_function): Don't jump to top level on error in user-supplied function. Treat empty vector returned from user-supplied function as error. (hybrd_info_to_fsolve_info): Translate -1 (failure in evaluation of user-supplied function) to -2. * scripts/perror.m (fsolve case): Handle -2. * info/error.c (program_name): Initialize to info, not NULL. * info/session.c (initialize_info_session): Don't exit if term is too dumb or too small to use info. Return int status instead. * info/info.h (TERM_TOO_SMALL): New macro. * src/t-buitlins.cc (try_info): Check return value from initialize_info_session (). * liboctave/Array.cc (DiagArray::DiagArray (int n, const T& val)): Set number of rows and columns to n, not 0. Sat Dec 4 14:01:41 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/lex.h (YY_INPUT): Undefine if defined, then always define the way we want. (YY_FATAL_ERROR): Likewise. * src/lex.l (yywrap): Declare static. (yy_flex_alloc): New function, so we don't have to link with libfl.a when using flex 2.4.x. (yy_flex_realloc): Ditto. (yy_flex_free): Ditto. Thu Dec 2 19:23:43 1993 John Eaton (jwe@schoch.che.utexas.edu) * scripts/*.m: Add copying notice to script files. * src/input.cc (command_generator): Return copy of matching string. * src/input.cc (command_generator): Correctly delete array of character strings. * src/symtab.cc (symbol_table::save): Likewise. * src/utils.cc (pathstring_to_vector): Likewise. * src/utils.cc (get_m_file_names): When reallocating vector of strings, delete original vector of pointers, but not the strings they point to. Tue Nov 30 12:36:41 1993 John Eaton (jwe@schoch.che.utexas.edu) * liboctave/RowVector.cc, liboctave/ColVector.cc, liboctave/DiagMatrix.cc, liboctave/Matrix.cc, liboctave/Matrix-ext.cc: Massive rewrite to cope with new derivation scheme. * liboctave/Matrix.h: Include Array.h, and derive Matrix, ComplexMatrix, etc. from Array. Derive Complex versions from Array. Delete declarations of functions now inherited from the Array classes. * Include mx-kludge.h with appropriate #defines in each class that needs it. * liboctave/Matrix.cc: Include mx-kludge.cc with appropriate #defines in each class that needs it. * liboctave/Makefile.in (INCLUDES): Add Array.h, MArray.h, and mx-kludge.h. (SOURCES): Add Array.cc. (EXTRAS): Add MArray.cc and mx-kludge.cc. * liboctave/mx-kludge.h, liboctave/mx-kludge.cc: New files to implement the MArray functionality with macros until g++ can handle the MArray stuff. * liboctave/MArray.h, liboctave/MArray.cc: New files for generic arrays with simple math functions for like-types. This won't quite work with g++ yet, so it's not used anywhere. * liboctave/Array.h, liboctave/Array.cc: New files for generic arrays. * liboctave/mx-inlines.cc: Add const for const arguments. * src/file-io.cc (file_info): Rename class from File_info. (file_info::operator =): Fix memory leak by deleting old name and mode before saving new. Don't do copy if source and destination are the same. * src/tree.cc (tree_matrix::eval): Plug memory leak. * src/tree.cc (tree_builtin::tree_builtin): Check to see that nm, not my_name, is non-NULL before saving it. * src/tree.cc (tree_identifier::eval, tree_gobal_command::eval): After performing the assignment, delete the identifier created for temporary asssignment since the destrucotr for tree_simple_assignment_expression doesn't do it for us. * src/tree.cc (tree_function::stash_m_file_name): Delete file_name before saving it. (tree_function::stash_function_name): Likewise, for fcn_name. * src/lex.l, src/lex.h: Make quote_is_transpose globally visible. * src/parse.y (param_list): Use it, and recognize empty parameter lists here. * src/parse.y (simple_expr1): Recognize empty matrices here. (matrix): Not here. * src/arith-ops.cc (do_binary_op): The matrix product and quotient functions aren't class member functions now. * src/tc-index.cc, src/tc-assign.cc, src/symtab.cc, src/tree-plot.cc, src/idx-vector.cc, src/tree-const.cc: Call ::error, not just error, since g++ now complains about not being able to find a non-hidden member function by that name. * src/tree-const.cc: Call ::real and ::imag, not just real and imag, since g++ now complains about not being able to find non-hidden member functions by those names. * src/tree-const.cc (tree_constant_rep::force_numeric): Handle case of zero-length strings. * src/tree-const.cc (tree_constant_rep::convert_to_str): Null terminate strings created from scalars. * src/tc-index.cc (tree_constant_rep::fortran_style_matrix_index): Use data(), not fortran_vec(). * src/idx-vector.cc (idx_vector::idx_vector): Likewise. * src/SLStack.cc: Move function definitions here. * src/SLStack.h: From here. Include SLStack.cc if not using external templates. * src/unwind-prot.h: Move class declaration here. * src/unwind-prot.cc: From here. * src/xdiv.h, src/xpow.h, src/variables.h, src/utils.h, src/user-prefs.h, src/t-builtins.h, src/sighandlers.h, src/pr-output.h, src/pager.h, src/octave-hist.h, src/mappers.h, src/input.h, src/help.h, src/gripes.h, src/g-builtins.h, src/f-syl.h, src/f-svd.h, src/f-schur.h, src/f-rand.h, src/f-qzval.h, src/f-quad.h, src/f-qr.h, src/f-qpsol.h, src/f-npsol.h, src/f-lu.h, src/f-lsode.h, src/f-lpsolve.h, src/f-inv.h, src/f-ifft.h, src/f-hess.h, src/f-givens.h, src/f-fsqp.h, src/f-fsolve.h, src/f-fft.h, src/f-expm.h, src/f-eig.h, src/f-det.h, src/f-dassl.h, src/f-colloc.h, src/f-chol.h, src/f-balance.h, src/error.h, src/dynamic-ld.h, src/builtins.h, src/arith-ops.h, src/tree-const.h, src/tree.h, src/token.h, src/symtab.h, src/procstream.h, src/idx-vector.h, src/file-io.h, src/tree-base.h, src/unwind-prot.h, src/Stack.h, liboctave/LinConst.h, liboctave/FEGrid.h, liboctave/NLEqn.h, liboctave/NLConst.h, liboctave/LPsolve.h, liboctave/LP.h, liboctave/FSQP.h, liboctave/DAEFunc.h, liboctave/DAE.h, liboctave/CollocWt.h, liboctave/Bounds.h, liboctave/Objective.h, liboctave/ODEFunc.h, liboctave/NLFunc.h, liboctave/Range.h, liboctave/Quad.h, liboctave/QP.h, liboctave/QPSOL.h, liboctave/QLD.h, liboctave/NPSOL.h, liboctave/NLP.h, liboctave/f77-uscore.h, liboctave/lo-error.h, liboctave/Matrix.h: Don't use #pragma interface. * src/tc-index.cc, src/tc-assign.cc, src/symtab.cc, src/procstream.cc, src/gripes.cc, src/f-syl.cc, src/f-svd.cc, src/f-schur.cc, src/f-rand.cc, src/f-quad.cc, src/f-qr.cc, src/f-qpsol.cc, src/f-npsol.cc, src/f-lu.cc, src/f-lsode.cc, src/f-lpsolve.cc, src/f-inv.cc, src/f-ifft.cc, src/f-hess.cc, src/f-givens.cc, src/f-fsqp.cc, src/f-fsolve.cc, src/f-fft.cc, src/f-eig.cc, src/f-det.cc, src/f-dassl.cc, src/f-colloc.cc, src/f-chol.cc, src/f-balance.cc, src/t-builtins.cc, src/octave-hist.cc, src/input.cc, src/g-builtins.cc, src/xdiv.cc, src/xpow.cc, src/user-prefs.cc, src/unwind-prot.cc, src/tree-plot.cc, src/token.cc, src/tc-extras.cc, src/sysdep.cc, src/sighandlers.cc, src/pr-output.cc, src/pager.cc, src/mappers.cc, src/idx-vector.cc, src/help.cc, src/f-qzval.cc, src/f-expm.cc, src/error.cc, src/dynamic-ld.cc, src/builtins.cc, src/arith-ops.cc, src/variables.cc, src/utils.cc, src/tree-const.cc, src/file-io.cc, src/tree.cc, liboctave/sun-utils.cc, liboctave/mx-inlines.cc, liboctave/RowVector.cc, liboctave/ColVector.cc, liboctave/DiagMatrix.cc, liboctave/Matrix.cc, liboctave/Matrix-ext.cc, liboctave/Quad.cc, liboctave/ODE.cc, liboctave/LPsolve.cc, liboctave/FSQP.cc, liboctave/DAE.cc, liboctave/DAEFunc.cc, liboctave/QP.cc, liboctave/Objective.cc, liboctave/ODEFunc.cc, liboctave/NLFunc.cc, liboctave/NLConst.cc, liboctave/LP.cc, liboctave/lo-error.cc, liboctave/Range.cc, liboctave/QPSOL.cc, liboctave/NPSOL.cc, liboctave/NLEqn.cc, liboctave/Matrix.cc, liboctave/Matrix-ext.cc, liboctave/LinConst.cc, liboctave/FEGrid.cc, liboctave/DiagMatrix.cc, liboctave/CollocWt.cc, liboctave/ColVector.cc, liboctave/Bounds.cc: Don't use #pragma implementation. * src/lex.l, src/parse.y, src/procstream.cc, src/gripes.cc, src/f-syl.cc, src/f-svd.cc, src/f-schur.cc, src/f-rand.cc, src/f-quad.cc, src/f-qr.cc, src/f-qpsol.cc, src/f-npsol.cc, src/f-lu.cc, src/f-lsode.cc, src/f-lpsolve.cc, src/f-inv.cc, src/f-ifft.cc, src/f-hess.cc, src/f-givens.cc, src/f-fsqp.cc, src/f-fsolve.cc, src/f-fft.cc, src/f-eig.cc, src/f-det.cc, src/f-dassl.cc, src/f-colloc.cc, src/f-chol.cc, src/f-balance.cc, src/t-builtins.cc, src/octave-hist.cc, src/input.cc, src/g-builtins.cc, src/xdiv.cc, src/xpow.cc, src/user-prefs.cc, src/unwind-prot.cc, src/tree-plot.cc, src/token.cc, src/tc-extras.cc, src/sysdep.cc, src/sighandlers.cc, src/pr-output.cc, src/pager.cc, src/mappers.cc, src/idx-vector.cc, src/help.cc, src/f-qzval.cc, src/f-expm.cc, src/error.cc, src/dynamic-ld.cc, src/builtins.cc, src/arith-ops.cc, src/variables.cc, src/utils.cc, src/tree-const.cc, src/file-io.cc, src/tree.cc: If HAVE_CONFIG_H is defined, include config.h. * config.h.in, acconfig.h: New files * Makefile.in (DISTFILES): Add them to the list. * Makeconf.in (root_srcdir): Define. (INCFLAGS): Clean up. (UGLY_ALL_CFLAGS): New macro. (UGLY_ALL_CXXFLAGS): Likewise. (UGLY_ALL_LDFLAGS): Likewise. * configure.in: Convert to generate config.h. Substitute root_srcdir in Makefiles. Use AC_DEFINE(foo, 1) instead of DEFS="$DEFS -Dfoo=1". If using g++ 2.5 or later, define USE_EXTERNAL_TEMPLATES. Use UGLY_DEFS for what would have been substited in DEFS, for those cases when we need DEFS instead of config.h. Tue Nov 16 04:59:19 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/f-expm.cc, src/f-givens.cc, src/f-qzval.cc, src/f-syl.cc: Include f77-uscore.h here. * liboctave/ColVector.cc, liboctave/Matrix.cc, liboctave/Matrix-ext.cc, liboctave/RowVector.cc: Move declarations for Fortran functions here. * liboctave/Matrix.h: From here. Don't include f77-uscore.h here. Mon Nov 15 04:03:34 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-extras.cc (min): For two-arg versions, use error(), not FAIL. (max): Likewise. * src/idx-vector.cc (checkelem): Likewise. * liboctave/Matrix.h, liboctave/Matrix.cc, liboctave/RowVector.cc, liboctave/ColVector.cc, liboctave/DiagMatrix.cc, liboctave/Matrix-ext.cc, liboctave/Bounds.cc, liboctave/DAE.cc, liboctave/CollocWt.cc, liboctave/FEGrid.cc, liboctave/LinConst.cc, liboctave/ODE.cc, liboctave/NLEqn.cc: Don't abort or exit on errors. Instead print some message by calling the function pointed to by current_liboctave_error_handler and then return. * liboctave/lo-error.cc: New file, for liboctave error handling stuff. Sun Nov 14 23:28:12 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc (default_path): Handle OCTAVE_PATH from the environment like TeX handles TEXINPUTS. If the path starts with `:', prepend the standard path. If it ends with `:' append the standard path. If it begins and ends with `:', do both (which is useless, but the luser asked for it...). (octave_lib_dir): Plug memory leak. Sat Nov 13 02:41:24 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/symtab.h (symbol_record::context): New data member, to allow recursive functions to work. * src/symtab.cc (symbol_record::push_context): New function (symbol_record::pop_context): Ditto. (symbol_table::pop_context): Ditto. (symbol_table::push_context): Ditto. * src/tree.cc (tree_function::eval): If call_depth is > 1, push symbol table context and add unwind protect to pop it on exit or error. (pop_symbol_table_context): New function for unwind protect. * configure.in: Use AC_HAVE_HEADERS(unistd.h) instead of AC_UNISTD_H. * src/lex.l, src/f-quad.cc, src/f-rand.cc, src/f-lpsolve.cc, src/f-fsqp.cc, src/f-fsolve.cc, src/f-det.cc, src/f-dassl.cc, src/f-colloc.cc, src/utils.cc, src/variables.cc, src/tree.cc, src/tree-const.cc, src/tc-extras.cc, src/sysdep.cc, src/symtab.cc, src/octave-hist.cc, src/pr-output.cc, src/input.cc, src/g-builtins.cc, src/f-det.cc, src/f-inv.cc, src/file-io.cc: Convert most calls to message() to calls to warning() or error() instead. * src/f-npsol.cc (npsol): Don't try to create the linear constraint object before checking array sizes. Fri Nov 12 04:36:12 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/tc-inlines.cc (is_one_zero): New function. * src/tc-assign.cc: Everywhere we check for is_zero_one, also check for is_one_zero. Some people write ranges that go in decreasing order... * src/tc-index.cc: Likewise. * src/tc-inlines (index_check (Range&, int&, char*)): Eliminate second arg -- there is no need to return the max value of the range. Correctly compute and check the minimum value. * src/tc-index.cc: Change all callers, and check the max value there. * src/tc-assign.cc: Likewise. * src/tc-assign.cc (do_vector_assign): Handle assignment of empty matrix for int, idx_vector, and Range cases. (do_matrix_assign): Likewise, for cases when one of the indices is a colon and the other is an int, idx_vector, or Range. * liboctave/Range.h (Range): Rename private data members rng_foo instead of just _foo. * liboctave/Range.cc: Change names where used. * liboctave/Range.cc (max): Return correct value even when the elements in the range don't line up exactly with the limit. (min): Likewise. (sort): New function. * src/tc-assign.cc (delete_row (int)): New function. (delete_rows (idx_vector&)): Ditto. (delete_rows (Range&)): Ditto. (delete_column (int)): New function. (delete_columns (idx_vector&)): Ditto. (delete_columns (Range&)): Ditto. * src/tree-const.h (is_empty): Don't try checking rows and columns if type is magic_colon or unknown. Return false instead. (is_zero_by_zero): New function. * src/idx-vector.cc (sort): New function. (intcmp): New static function, for sorting. Thu Nov 11 02:31:13 1993 John Eaton (jwe@schoch.che.utexas.edu) * scripts/menu.m: Update to use new va_start() and va_arg() functions. * src/g-builtins.cc (builtin_va_arg): Rename from builtin_get_next_arg. (builtin_va_start): New function. * src/builtins.cc (builtin_general_functions): Fix up list. * src/tree.cc (tree_function::va_arg): Rename from get_next_arg. (tree_function::va_start): New function. * src/tree.h (tree_function::num_named_args): New data member. * src/tree.cc (tree_function::define_param_list): Set it. (tree_function::eval): Unwind-protect it. Wed Nov 10 03:37:44 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_identifier::assign): Also check to make sure that the symbol record is defined since symbol_record::is_variable may return true even if the record is undefined. * src/variables.cc (link_to_global_variable): Don't try to copy a NULL_TREE_CONST. * src/tree-const.cc (tree_constant_rep::matrix_value): If the current value is a scalar, return 1x1 matrix. * src/tc-assign.cc (tree_constant_rep::check_vector_assign): Handle case of zero size LHS. Clean up formatting of some error messages. * src/lex.l ({EL}): Recognize ... when not at end of line. * src/octave.cc (curr_function): New global variable. * src/g-buitlins.cc (builtin_get_next_arg): New function. * src/builtins.cc (builtin_general_functions): Add it to the list. * src/parse.y (param_list1): Handle ... at end of parameter list. Abort parse on error. (ELLIPSIS): New token, for variable argument lists. * src/tree.h (tree_function): Add varargs_ok, args_passed, num_args_passed, and curr_arg_number data members to handle variable argument lists. (tree_parameter_list::marked_for_varargs): New data member. * src/tree.cc (tree_function::takes_varargs): New function. (tree_function::get_next_arg): New function. (tree_parameter_list::mark_varargs): New function. (tree_parameter_list::takes_varargs): New function. (tree_function::eval): Set curr_function, args_passed, and num_args_passed for use by get_next_arg. Mon Nov 8 14:22:34 1993 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.79 released. * src/builtins.cc (builtin_text_functions): Correct usage message for who. * scripts/dgram.m: New function, from R. Bruce Tenison (btenison@eng.auburn.edu). * scripts/dlqe.m: Ditto. * scripts/dlqr.m: Ditto. * scripts/c2d.m: Ditto. * src/tree.cc (tree_identifier::name): Make it const. (tree_builtin::name): Ditto. (tree_parameter_list::name): Ditto. (tree_word_list::name): Ditto. * src/symtab.cc (symbol_table::save): Delete list of names after saving. * src/symtab.h (symbol_table): Move #defines outside of class declaration. Sun Nov 7 07:03:12 1993 John Eaton (jwe@schoch.che.utexas.edu) * Makeconf.in (CXX): Don't set from C++. Do set from @CXX@, which is determined by configure. Don't set C++FLAGS. * src/tree.cc: (tree_function::eval (int, int)): Simply call eval (tree_constant *, int, int, int) with nargin = 1 and args = NULL_TREE_CONST instead of duplicating most of that function in place. * src/parse.y (func_def2): Reset id_name after renaming identifier. Clear id_name from top level symbol table before defining identifier. Sat Nov 6 04:38:57 1993 John Eaton (jwe@schoch.che.utexas.edu) * configure.in: When checking for g++, set CXX, not GXX. Merge min changes from Bruce Tenison (btenison@eng.auburn.edu) and make the corresponding changes for max. * src/tc-extras.cc (min (ComplexMatrix&, ComplexMatrix&)): New function. (max (ComplexMatrix&, ComplexMatrix&)): Ditto. (column_min): Handle complex args and two return values. (column_max): Likewise. * liboctave/Matrix.cc (row_min_loc): New function. (row_max_loc): New function. (column_min_loc): Ditto. (column_max_loc): Ditto. Fri Nov 5 03:12:55 1993 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.78. * src/octave.h (clean_up_and_exit): Change form of declaration for GCC 2.5.x and beyond. * src/tree.cc (tree_identifier::eval): Correctly handle printing of identifier tags and conversion to assignment to `ans'. * src/parse.y (maybe_convert_to_ans_assign): Simplify. For identifiers, defer decision about making an ans assignment until evaluation time since identifiers can be undefined at parse time, and we can't tell what to do until we know what the def is. * src/tree.cc (tree_identifier::mark_for_possible_ans_assgin): New function. * src/tree.cc (tree_index_expression::mark_for_possible_ans_assign): New function. * src/tree.h (tree_identifier): Add new private data, maybe_do_ans_assign. * src/t-builtins.cc (builtin_who): Major overhaul. Support long listings. (print_symbol_info_line): New function. (print_long_listing): Ditto. (maybe_list): Ditto. * src/user-prefs.cc (sv_editor): New function for builtin variable EDITOR. * src/octave-hist.cc (do_edit_history): Use user_pref.editor, not just the EDITOR environment variable. * src/user-prefs.cc (ignore_function_time_stamp): New function for new builtin variable ignore_function_time_stamp. * src/variables.cc (symbol_out_of_date): Use value of new user_pref.ignore_function_time_stamp to decide whether to check to see if a file has changed. * src/tree.h (tree_function): Add new private data, system_m_file. * src/builtins.cc (string_variables): Add EDITOR and ignore_function_time_stamp EDITOR to the list. (bultin_general_functions): Add is_global to the list. * src/t-builtins.cc (builtin_clear): Make it work with new variable scoping rules. (builtin_document): Likewise, using new document_symbol() function. (builtin_save): Likewise. Allow regular expression arguments. Don't save builtin variables that are read-only. * src/utils.cc (octave_home): Don't declare static. (octave_lib_dir): Likewise. (octave_info_dir): Likewise. (default_editor): New function. * src/tree.cc (tree_builtin::def): Delete function. (tree_identifier::def): Likewise. (tree_identifier::symrec): Likewise. * src/tree.h (tree_builtin): Store name of function, not pointer to symbol record. * src/user-prefs.cc (warn_assign_as_truth_value): Lookup "warn_assign_as_truth_value", not "user_pref.warn...". * src/tree-base.h (def): Delete unused virtual function. (is_prefix_expression): New virtual function. (mark_for_possible_ans_assign): Likewise. (is_system_m_file): Likewise. (stash_m_file_name): No longer needs to be virtual. (stash_m_file_time): Likewise. * src/octave.cc (octave_Complex_error_handler): Define, to keep errors in the Complex class from aborting Octave. This is only a temporary fix, I hope. (main): Install it. (initialize_globals): Get default editor. (main): Call initialize_symbol_tables to do that instead of creating them directly in main. * src/variables.cc (document_symbol): New function. (initialize_symbol_tables): Likewise. (install_builtin_mapper_function): Likewise. (install_builtin_text_function): Likewise. (install_builtin_general_function): Likewise. (install_builtin_variable): Likewise. (install_builtin_variable_as_function): Likewise. (bind_nargin_and_nargout): Likewise. (bind_builtin_variable): Likewise. (link_to_global_variable): Likewise. (link_to_builtin_variable): Likewise. (link_to_builtin_or_function): Likewise. (force_link_to_function): Likewise. (is_globally_visible): Likewise. (is_builtin_variable): Likewise. * src/tree.cc (print_as_scalar): Avoid trying to print row vectors on one line. * src/builtins.cc (install_buitlins): Simplify installation of builtin functions using new install_builtin_*_function functions. Ditto for using bind_builtin_variable for installing variables. * src/tree.h (tree_global_command): New class. * src/tree.cc (tree_global_command::*): Implement new class to make global command executable. * src/parse.y (global_decl): Make global an executable statement. * src/parse.y (func_def2): Rework to match new way of handling global variables and function names in the symbol table. Mark functions as `system' or not. Don't use id_to_define. If m-file and function names disagree, rename function to match m-file name. * src/tree.cc (tree_identifier::rename): New function. * src/parse.cc, src/parse.h (id_to_define): Delete unused global variable. * src/varables.cc (builtin_string_variable): Fix to match new rules for global and builtin variables. (builtin_real_scalar_variable): Likewise. * src/tree.cc (tree_identifier::assign): Make it work with new rules for global variables. (tree_identifier::parse_m_file): Likewise. (tree_identifier::do_lookup): Likewise. * src/tree.cc (mark_as_system_m_file): New function. (is_system_m_file): Ditto. * src/tree.cc (clear_symbol_table): New function, to be used in an unwined_protect element for clearing function symbol tables on exit or error. * src/tree.cc (tree_function::eval): Simplify using bind_nargin_and_nargout. Clear symbol table on exit or error with unwind_protect. * src/tree.cc (tree_prefix_expression::is_prefix_expression): New function. * src/g-builtins.cc (builtin_is_global): New function. * src/lex.l (lookup_identifier): Now that global variable binding has been fixed, only look for symbols in the current symbol table. Really. I mean it this time. * src/symtab.cc: Complete overhaul, to make global variables work a bit more reasonably. Mon Nov 1 15:03:39 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/Matrix.h (DiagMatrix::rows): Return nr, not len. (ComplexDiagMatrix::rows): Ditto. * src/Matrix.h (DiagMatrix::cols): Return nc, not len. (ComplexDiagMatrix::cols): Ditto. (DiagMatrix::columns): Ditto. (ComplexDiagMatrix::columns): Ditto. * liboctave/DiagMatrix.cc (DiagMatrix::row): Make it work for square case. (DiagMatrix::column): Likewise. (ComplexDiagMatrix::row): Likewise. (ComplexDiagMatrix::column): Likewise. * liboctave/DiagMatrix.cc (DiagMatrix::operator <<): Print spaces between elements. (ComplexDiagMatrix::operator <<): Likewise. Fri Oct 29 15:32:12 1993 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.77.1. * src/symtab.cc (symbol_record::alias): Don't copy formal_param or forced_global attribute. * src/symtabl.cc (symbol_table::bind_globals): Don't bind to global symbol unless it has forced_global attribute set. * src/tree.cc (print_as_scalar): New function. (tree_identifier::eval): Use it. (tree_simple_assignment_expression::eval): Likewise. (tree_multi_assignment_expression::eval): Likewise. * src/lex.l (is_keyword): Give better error message for attempts to define nested functions. * src/parse.y (global_decl): Return a command_list to execute (this makes assignments in global declarations executable). * src/tree.cc (tree_for_command): Handle line and column info in constructors and for error messages. (tree_while_command): Ditto. (tree_if_command): Ditto. (tree_break_command): Ditto. (tree_continue_command): Ditto. (tree_return_command): Ditto. (*::eval_error): Only print messages if error_state > 0. (various): Only need to check that error_state is non-zero before calling eval_error(). * src/parse.y: Handle line and column information for FOR WHILE IF ELSEIF ELSE BREAK CONTINUE and FUNC_RET tokens. * src/lex.l: Likewise. * src/octave.cc (parse_and_execute): Reset parser before starting new parse. * src/tree-plot.cc (various): Check error_state in many more places, and issue more meaningful error messages. * src/tree-const.cc (maybe_resize): Don't call jump_to_top_level() on errors. (tree_constant_rep (Range)): Likewise. * src/g-builtins.cc (builtin_error): Use error(), not print_if_string() to print error messages. * src/tree-const.cc (print_if_string): Delete unused function. * src/tc-assign.cc (various): Check error_state after calls to maybe_resize(). * src/tc-index.cc (various): Always check the state of idx_vectors after trying to create them. * src/tc-assign.cc (various): Likewise. * src/idx-vector.cc: Use 0, not NULL. Don't include stdlib.h. (initialized): New data member, set nonzero if the idx_vector has been properly initialized. Never call jump_to_top_level () if initialization fails. Add operator void *(), so we can test the state of an idx_vector with `if (vector)'. * src/pager.cc: Explicitly initialize pager_buf to NULL. * src/tree-base.h: Move includes ahead of other definitions. * liboctave/NLEqn.cc (NLEqn::NLEqn (const Vector&, const NLFunc)): Initialize n from xvec, not x. Mon Oct 25 18:01:12 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/user-prefs.cc (sv_info_file): New function. * src/user-prefs.h (user_pref): Add info_file to the list. * src/t-builtins.cc (try_info): Use it instead of DEFAULT_INFO_FILE. * src/utils.cc (default_info_file): New function. (octave_info_dir): Likewise. * src/defaults.h.in (DEFAULT_INFO_FILE): Delete unnecessary definition since we figure out what it should be in utils.cc now. * src/Makefile.in (defaults.h): Don't substitute DEFAULT_INFO_FILE. * src/Makeconf.in (DEFAULT_INFO_FILE): Delete definition. * src/octave.cc (info_file): New global variable. (initialize_globals): Call default_info_file () to initialize it. (--info-file): New command line option. * src/builtins.cc (string_variables): Add INFO_FILE to the list. (install_builtins): Define it. * info/filesys.c (compress_suffixes): Choose gunzip for .gz files. Sat Oct 23 17:46:09 1993 John Eaton (jwe@schoch.che.utexas.edu) * Version 0.77 released. * src/Makefile.in (INCFLAGS): Don't include info or dld directories. * dynamic-ld.cc: Include dld/dld.h, not just dld.h. * t-buitlins.cc: Include info/info.h, info/dribble.h, and info/terminal.h, not just info.h, dribble.h, and terminal.h. * src/t-builtins.cc (builtin_help): New option, -i, for invoking info browser. If -i is not given, just do what we used to do, but point to help -i as a way to get additional information. * builtins.cc (print_usage): New function. * g-builtins.cc (all builtins): Call print_usage to get usage message. * t-builtins.cc (all builtins): Likewise. Fri Oct 22 15:56:16 1993 John Eaton (jwe@schoch.che.utexas.edu) * Cholesky changes from R. Bruce Tenison (btenison@eng.auburn.edu): * src/f-chol.cc, src/f-chol.h: New files for the Cholesky Factorization. * src/Makefile.in (SOURCES, OBJECTS, DLD_OBJECTS): Add to lists. * src/g-builtins.cc (builtin_chol): New function. * src/g-builtins.h: Declare it. * liboctave/Matrix-ext.cc (CHOL, ComplexCHOL): New classes. * libcruft/lapack: dpotrf.f, zpotrf.f, dpotf2.f, zpotf2.f: New files. * libcruft/blas: dsyrk.f, zherk.f: New files. Fri Oct 22 14:04:16 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc (builtin_schur): Fourth arg for DLD_BUILTIN is schur, not hess. * scripts/dare.m: Correct usage of fprintf. * src/utils.cc (raw_mode): Only complain about stdin not a tty if interactive or forced interactive. Thu Oct 21 17:00:57 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/builtins.cc (install_builtins): Try harder to make initialization of NaN work. Make note about possible fixes if it still doesn't work. * src/utils.cc (raw_mode): [HAVE_TERMIOS_H] and [HAVE_TERMIO_H] Don't set TAB3 since it doesn't seem necessary and some systems don't have it by this name. [HAVE_SGTTY_H] To be consistent, don't set XTABS here either. * src/error.c (error): Call flush_output_to_pager before printing error message. (panic): Likewise, before aborting. * src/symtab.cc (symbol_record::undefine): Delete unused function. (symbol_table::undefine): Likewise. * src/symtab.cc (clear): Never delete symbol records from the table. Only delete the definitions. This makes clear and undefine equivalent, so we don't need them * src/tree.cc (tree_function::eval): Call symbol_table::clear, not symbol_table::undefine. * src/t-builtins.cc (builtin_clear): Only clear global symbols if we are at the top level. * src/parse.y (CLEAR): Delete token. (word_list_command): Remove code to handle CLEAR as special case. (expect): Only 19 now. * src/lex.l (handle_identifier): Remove special code for clear. It's ok to use it in a function body now. * src/t-builtins.cc: Include extern "C" declarations for Info stuff. (builtin_help): If given an argument, try to get help directly from info file first. If that fails, do as before. (help_syms_list): New function: (simple_help): New function. (try_info): New function. (help_from_list): New function. * src/defaults.h.in (DEFAULT_INFO_FILE): Define new macro. * Makeconf.in: Set value of DEFAULT_INFO_FILE. * Makeconf.in (INSTALL_PROGRAM): Add definition. * Makefile.in (SUBDIRS): Add info directory. (info): New target. * configure.in: Add autoconf macros to handle info configuration. * info/Makefile.in: Major changes to make it work with Octave's Makeconf file, etc. The default action is now to build a libinfo.a file. * info/error.c: New file. Move error functions here from info.c. * info/signals.c (clear_info_signal_handler): New function, useful if info is used directly in another program. * info/termdep.h: Handle termios too. * info/terminal.c (terminal_prep_terminal): Handle termios. * (terminal_unprep_terminal): Likewise * info/session.c (initialize_info_session): Add arg to make clearing the screen conditional. Useful if we want to call index_entry_exists() first before displaying anything. Change all callers. * info/session.c (finish_info_session): New function. * info/session.c (dispatch_error): Change message to include info about how to get help and how to quit. * info/info.c (index_search_p): New flag. (--index-search): New option, like apropos, but search the indices and display the first node found. * info/indices.c (do_info_index_search): New function, modified from info_index_search to allow searching the index for a string without prompting for it. (info_index_search): Just call do_info_index_search. (index_entry_exists): New function, to allow us to find out if there is an index entry for a given string without actually displaying anything. * info: New directory, containing source for GNU info browser. Tue Oct 19 00:14:33 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/octave-hist.cc (input_from_tmp_history_file): New global flag. (do_edit_history): Protect and set it. (do_run_history): Likewise. * src/parse.y (func_def2): Use it to see that input is coming from a temporary file. This means that we shouldn't exit when we're done reading it, and we should treat it just as if the input were coming from the keyboard. * variables.cc (force_global): Force aliasing so it will happen even if the symbol record is undefined. * src/lex.l (lookup_identifier): Simplify * src/lex.l (reset_parser): Reset error_state here. * src/octave.cc (main): Not here. Mon Oct 18 14:27:02 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-const.cc: Delete constructor for tree_constant from String. * In src: tree.h, mappers.h, unwind-prot.h, parse.h, file-io.h, arith-ops.h, tree-base.h, tree-const.h, g-builtins.h, idx-vector.h, builtins.h, dynamic-ld.h, xdiv.h, xpow.h, pr-output.h, input.h, symtab.h, utils.h: Avoid including files unnecessarily. * In src: tc-inlines.cc, mappers.cc, variables.cc, arith-ops.cc, tree.cc, tree-const.cc, g-builtins.cc, file-io.cc, idx-vector.cc, tc-assign.cc, tc-index.cc, builtins.cc, dynamic-ld.cc, xdiv.cc, xpow.cc, pr-output.cc, tc-extras.cc, input.cc, symtab.cc, utils.cc: Sprinkle liberally with const. * In src: f-syl.cc, f-svd.cc, f-schur.cc, f-rand.cc, f-qzval.cc, f-quad.cc, f-qr.cc, f-qpsol.cc, f-npsol.cc, f-lu.cc, f-lsode.cc, f-lpsolve.cc, f-inv.cc, f-ifft.cc, f-hess.cc, f-givens.cc, f-fsqp.cc, f-fsolve.cc, f-fft.cc, f-expm.cc, f-eig.cc, f-det.cc, f-dassl.cc, f-colloc.cc, f-balance.cc: Add const qualifier to tree-constant arg. Sat Oct 16 12:22:24 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/tree-const.h, src/tree-const.cc: Add const qualifier to constructor arguments passed by reference. Pass Complex arguments by const reference instead of by value. * liboctave/Matrix.h, liboctave/Matrix.cc, liboctave/ColVector.cc, liboctave/RowVector.cc liboctave/DiagMatrix.cc: Pass Complex arguments by const reference instead of by value. Wed Oct 13 14:13:29 1993 John Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc (decode_prompt_string): ctime returns time_t, which might not be a long. * src/variables.cc (identifier_exists): Only return non-zero if the name has a definition. * src/f-npsol.cc (npsol): Call error(), not message(), to print error messages. (linear_constraints_ok): Likewise. (nonlinear_constraints_ok): Likewise. * src/f-qpsol.cc (qpsol): Don't try to create the linear constraint object before checking array sizes. Wouldn't exception handling be nice? Call error(), not message(), to print error messages. Check to ensure that the bounds on linear constraints are vectors. * src/lex.l (lookup_identifier): Don't bind global variables immediately in loops or conditionals, even at the top level. Sun Oct 10 8:48:00 1993 John Eaton (jwe@schoch.che.utexas.edu) * README.doc: New file. * Makefile.in (doc-dist): New target. * doc/Makefile.in (FORMATTED): New macro. (doc-dist): New target. * src/tree.cc (tree_identifier::eval): Don't print anything if an error is encountered. (tree_simple_assignment_expression::eval): Likewise. * src/tc-assign.cc (do_matrix_assignment): Handle resizing correctly when indices are (:,range), (:,matrix), (range,:), or (matrix,:) and the lhs is empty or undefined. Tue Oct 5 04:02:37 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.76 released. * src/octave.cc (main): Print usage message if we are given more than one extra argument on the command line. Delay printing startup message until just before setting the toplevel jump context. * src/lex.h (DO_COMMA_INSERT_CHECK): Delete unused macro. * src/lex.l (handle_identifier): New function. ({IDENT}/{S}*=, {IDENT}{S}*): Use it instead of duplicating code. (do_comma_insert_check): Use yyunput instad of returning original character count. Call directly instead of using DO_COMMA_INSERT_CHECK macro. Mon Oct 4 08:06:10 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.75.4. * src/tree-const.cc (tree_constant_rep::eval ()): Avoid calling rows() and columns() for things like magic_colon. Sun Oct 3 19:39:33 1993 John W. Eaton (jwe@schoch.che.utexas.edu) Changes to add line and column info to run-time error messages: * src/tree.cc (tree_identifier, tree_prefix_expression, tree_postfix_expression, tree_simple_assignment_expression, tree_multi_assignment_expression, tree_colon_expression, tree_index_expression): Modify constructors to allow line and column information to be stored. (abort_on_undefined): Delete (now) unnecessary static variable. (all eval() functions): If error_state, return immediately. (tree_matrix::eval ()): Call error and return tree_constant() instead of jumping to top level on error. (tree_identifier::parse_m_file ()): When starting to read an M-file, initialize current_input_column to 1, not 0. (tree_identifier::eval_undefined_error ()): Improve error message with line and column info if it is available. Don't abort to top level on errors. (tree_function::traceback_error ()): New function. (tree_function::eval ()): Don't jump to top level on errors. Call traceback_error if there is an error evaluating the command list. * src/tree.cc (tree_prefix_expression::eval_error ()): New function. (tree_postfix_expression::eval_error ()): Ditto. (tree_unary_expression::eval_error ()): Ditto. (tree_binary_expression::eval_error ()): Ditto. (tree_simple_assignment_expression::eval_error ()): Ditto. (tree_multi_assignment_expression::eval_error ()): Ditto. (tree_colon_expression::eval_error ()): Ditto. (tree_index_expression::eval_error ()): Ditto. * src/tree.cc (tree_function::stash_function_name ()): New function. * src/parse.y (FCN): Use it. * src/lex.l: Return line and column info for many (but not all) tokens. * src/parse.y: Handle token values with the token class defined in token.cc. (check_end ()): New function. (end_error ()): Improve error messages by including line and column info. * src/arith-ops.cc (lots of functions): Don't jump to top level on errors. * src/tree.cc (tree_unary_expression::eval ()), tree_binary_expression::eval ()): Handle error condition here. * src/gripes.cc (gripe_nonconformant): Add additional form of this function to allow message to include dimensions. Change most callers to use new form * src/octave.cc: Initialize column counter to 1, not 0. (main): Reset error_state before evaluating each top level command. * src/tree-plot.cc (tree_plot_command::eval ()): If error_state, return immediately. * src/tree-const.cc (do_binary_op ()): Return tree_constant() instead of jumping to top level on errors. (do_unary_op): Likewise. (tree_constant_rep::eval ()): If error_state, return immediately. Convert 1x1 matrices to scalars. * src/tc-assign.cc (tree_constant_rep::do_scalar_assignment ()): Don't jump to top level on error. If there is an error while attempting to convert an undefined variable to a matrix, don't suddenly create an empty matrix. (tree_constant_rep::fortran_style_matrix_assignment ()): Check return value of range_max_check() and don't jumpt to top level on errors. (tree_constant_rep::vector_assignment ()): Check return value of index_check and don't jump to top level on errors. (tree_constant_rep::check_vector_assign ()): Don't jump to top level on errors. (tree_constant_rep::do_matrix_assignment ()): Check return value of index_check and don't jump to top level on errors. * src/tc-extras.cc (get_dimensions ()): Call error (sets error state) but don't jump to top level on errors. (fill_matrix): Return tree_constant() on error. (identity_matrix): Likewise. * src/error.cc (error_state): New global variable, initialize to zero. (error): Set it to one. * src/tc-index.cc (tree_constant_rep::valid_as_scalar_index ()): Don't declare unused variable retval. (tree_constant_rep::do_scalar_index ()): Return tree_constant() instead of jumping to top level on error. (tree_constant_rep::fortran_style_matrix_index): Don't jump to top level on indexing or range errors. (tree_constant_rep::do_vector_index ()): Likewise. (tree_constant_rep::do_matrix_index ()): Likewise. * src/tc-inlines (range_max_check): Return -1 instead of jumping to top level on error. (index_check): Likewise. * src/utils.cc (check_dimensions): Call error, not warning, and don't jump to top level. * src/tree-base.h (line_num, column_num): New data members for all tree classes. (line (), column ()): New virtual functions to access line and column info. * src/lex.l (enum end_tok_type, enum plot_tok_type): Delete declarations (now in token.h). * src/lex.h (YY_INPUT, YY_FATAL_ERROR, DO_COMMA_INSERT_CHECK, TOK_RETURN, BIN_OP_RETURN): Move macro definition here, from lex.l. Rename RETURN TOK_RETURN. * src/token.cc, token.h: New files that define a class for tokens that includes line and column information. Wed Sep 29 11:15:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/octave.cc: Use GNU getopt to handle option parsing. * src/getopt.h src/getopt.c src/getopt1.c: New files for GNU getopt. * src/Makefile.in: Add them to the appropriate lists. * src/utils.cc (raw_mode): Use the termios.h terminal driver interface if it is available. * configure.in: Check for termios.h * src/tree-plot.cc (tree_subplot_list::print (int, ostrstream&)): If the data to be plotted is a string but it doesn't name a file, try sending it to gnuplot directly. Tue Sep 28 16:06:42 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * liboctave/QPSOL.cc (QPSOL::minimize (double&, int&, Vector&)): Correct dimensions of work arrays, based on QPSOL source. Pass ncon, which is max (1, nclin), not n, as the row dimension of clin. * src/f-npsol.cc (linear_constraints_ok): Improve warning for the case of constraints with zero dimensions. (nonlinear_constraints_ok): Likewise. Mon Sep 27 01:20:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.75.3. * Makefile.in (dist): Make file permissions for distribution rw. (binary-dist): Ditto. (local-dist): Ditto. Sat Sep 25 15:29:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/pr-output.cc: Include stdio.h, for sprintf. * src/input.cc (octave_gets): Set octave_gets_line to NULL after freeing it. * Version 0.75.2. * liboctave/Matrix.cc (Matrix::operator * (const ColumnVector&): Correct dimension of return value. (ComplexMatrix::operator * (const ComplexColumnVector&)): Ditto. Tue Sep 21 20:42:10 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/tree.cc (tree_identifier::assign (tree_constant&)): Correctly handle case of hiding a function with a variable when the variable has not been flagged as global. tree_identifier::assign (tree_constant&, tree_constant*, int)): Likewise. * src/variables.cc (force_global): When a variable is moved to the global symbol table, mark it as global. * src/symtab.cc (symbol_record::symbol_record ()): Initialize forced_global. (symbol_record::clear_visible ()): Reset forced_global to zero. (symbol_record::clear_all ()): Ditto. (symbol_record::mark_as_forced_global ()): New function. (symbol_record::is_forced_global ()): New function. (symbol_record::alias ()): Also copy forced_global attribute. * src/symtab.h (symbol_record::forced_global): New private data member, used to record when a variable has been explicitly declared global. * src/lex.l (lookup_identifier): Look in current scope first. Mon Sep 20 03:15:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/parse.y, src/tree.cc, src/tree.h: Allow `for' command to assign to an index expression, not just an identifier. * src/t-builtins.cc (builtin_clear (int, char **)): Don't delete g_names twice. * src/symtab.cc (symbol_table::list (int&)): Make sure count is initialized to zero. (symbol_table::var_list (int&)): Ditto. (symbol_table::fcn_list (int&)): Ditto. Sat Sep 18 04:06:42 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/lex.l, src/parse.y, src/parse.h: Use new global variable past_plot_range to make gplot and gsplot smarter about distinguishing plot ranges and literal matrices. Fri Sep 17 01:06:30 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.75.1 released. * src/f-qzval.cc: Include for DBL_EPSILON. * src/symtab.cc (symbol_record::save (ostream&, int)): Don't print a warning for ans being undefined. Call warning to print the message, and change the text to make it clearer. (symbol_table::save (ostream&, int)): Don't crash if there aren't any symbols to save. Thu Sep 16 00:21:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/t-builtins.cc (builtin_help): When trying harder to find help for M-files, only insert the symbol into the global symbol table if there really is an M-file of the given name in the path. Wed Sep 15 02:08:27 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.75. * src/Makefile.in (INCLUDES): Distribute defaults.h (%.d: %.cc): Don't fail if we can't determine dependencies. (DISTFILES): Include move-if-change. Tue Sep 14 21:23:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * scripts/perror.m: Use err, not info for fsolve section. Mon Sep 13 19:29:26 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/utils.cc (get_m_file_names): Call closedir(), not free(), to dispose of directory structure. Sun Sep 12 19:07:36 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/tree-const.cc (tree_constant_rep::double_value): Rearrange to avoid warning about reaching end of non-void function. (tree_constant_rep::matrix_value): Ditto. * src/error.cc (panic): Declare volatile. * src/utils.cc (jump_to_top_level): Declare as `void volatile', not `volatile void'. * src/tree-const.cc (tree_constant_rep::complex_matrix_value): Make it work even if the internal representation is really a real or complex scalar or a real matrix. (tree_constant_rep::complex_scalar_value): Make it work even if the internal representation is really a real scalar. * src/f-syl.cc (syl): Delete ComplexMatrixLoad(). Use complex_matrix_value(), not ComplexMatrixLoad(). * src/tree-const.cc (vector_of_empties): Renamed from empty_tree, moved from f-syl.cc. * src/f-syl.cc (syl): Call vector_of_empties() instead of empty_tree(). * src/f-qzval.cc (qzvalue): Ditto. * src/tree-const.h (tree_constant::is_empty): New inline function. * src/f-syl.cc (syl): Call is_empty instead of empty_arg. * src/f-qzval.cc (qzvalue): Ditto. * src/f-expm.cc (matrix_exp): Ditto. Thu Sep 9 22:40:16 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * liboctave/Matrix.cc (Matrix::transpose): Make it work for empty matrices. (ComplexMatrix::transpose): Ditto. Mon Sep 6 04:56:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/tree-plot.cc (tree_subplot_list::print): If the plot data is a string and it names a file, plot the data in the file. * src/octave.cc (execute_startup_files): Try harder to avoid executing $HOME/.octaverc twice. * liboctave/DAE.cc (DAE::integrate (Vector&, Matrix&, Vector&)): Add missing parameter in call to integrate() if no critical points are specified. Sat Sep 4 16:18:49 1993 John W. Eaton (jwe@ward.che.utexas.edu) * src/octave.cc (execute_startup_files): Don't execute $HOME/.octaverc twice. Mon Aug 30 11:25:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/t-builtins.cc (builtin_clear): Handle regular expressions. Fri Aug 27 07:25:32 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * liboctave/RowVector.cc: (RowVector::operator * (const ColumnVector& a) const): Fix brain-o. Wed Aug 18 00:29:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * list_primes.m: New M-file. * src/tc-index.cc (do_scalar_index): Handle two vector args of all ones. Tue Aug 17 06:26:04 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/file-io.cc (process_printf_format): Use NINT for * modifier argument. Mon Aug 16 19:30:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/mappers.cc: (arg (double)): Return pi for negative real values. Sun Aug 15 05:08:48 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/octave-hist.cc (mk_tmp_hist_file): New function, extracted from do_edit_history. (do_edit_history): Simplify using mk_tmp_hist_file. (do_run_history): New function. (edit_history_repl_hist): New function. * src/t-builtins.cc (builtin_run_history): New function. * src/builtins.cc (text_functions): Add run_history to the list. Fri Aug 13 16:04:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tzero.m: New M-file. * abcdchk.m: New M-file. * is_symmetric.m: Use tol and norm (A) to decide if A' is close enough to A to be considered the same. Wed Aug 11 15:50:59 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.74.1. Merge in expm changes from A. S. Hodel : * f-expm.{h,cc}: New files. * src/Makefile.in: Include them in the usual places. * src/g-builtins.cc (builtin_expm): The new matrix_exp returns a tree_constant by value. Include f-expm.h * src/tc-extras.cc (matrix_exp): Delete function. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) Merge in qzval changes from A. S. Hodel : * f-qzval.{h,cc}: New files. * src/Makefile.in: Include them in the usual places. * src/g-builtins.cc (builtin_qzval): New function. Include f-qzval.h * src/g-builtins.h: Declare builtin_qzval. * src/builtins.cc (general_functions): Add qzval to the list. * libcruft/eispack: New directory. * libcruft/Makefile.in (SUBDIRS): Include it. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Add libcruft/balgen/Makefile and libcruft/eispack/Makefile to the list of files to frob. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) Merge in syl changes from A. S. Hodel : * lyap.m: New M-file. * f-syl.{h,cc}: New files. * src/Makefile.in: Include them in the usual places. * src/g-builtins.cc (builtin_syl): New function. Include f-syl.h * src/g-builtins.h: Declare builtin_syl. * src/builtins.cc (general_functions): Add syl to the list. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/g-builtins.cc (builtin_balance): Fix typo in doc string. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) Merge in givens changes from A. S. Hodel : * f-givens.{h,cc}: New files. * src/Makefile.in: Include them in the usual places. * src/g-builtins.cc (builtin_givens): New function. Include f-givens.h * src/g-builtins.h: Declare builtin_givens. * src/builtins.cc (general_functions): Add givens to the list. * src/Makefile.in: (defaults.h) Quote substitutions. Use %foo%, not @foo@ to mark substitution. * src/defaults.h.in: Use %foo%, no @foo@ to do mark things to substitute. * qzhess.m: New M-file. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) Merge in balance changes from A. S. Hodel : * are, is_controllable.m, is_observable.m, is_square.m, is_symmetric.m: New M-files. * Matrix.h (AEPBALANCE): New class. (ComplexAEPBALANCE): New class. (GEPBALANCE): New class. * Matrix-ext.cc: Add init functions for balancing classes. * src/f-balance.{h,cc}: New files. * src/Makefile.in: Include them in the usual places. * src/g-builtins.cc (builtin_balance): New function. Include f-givens.h * src/g-builtins.h: Declare builtin_balance. * src/builtins.cc (general_functions): Add balance to the list. * libcruft/balgen: New directory. * libcruft/Makefile.in (SUBDIRS): Include it. Tue Aug 10 20:06:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Use AC_HAVE_LIBRARY to check for -lm. * src/Makefile.in (defaults.h): Quote substitutions. Mon Aug 9 13:30:07 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * README.NLP: New file. * Makefile.in (DISTFILES): Distribute it. Sun Aug 8 19:05:48 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/move-if-change: New file. * src/Makefile.in (DISTFILES): Distribute it. (defaults.h): New rule. (utils.o): Delete rule, since extra defines are no longer needed. (INCLUDES): Distribute defaults.h.in. * src/utils.cc: Include defaults.h to get DEFAULT_PAGER and OCTAVE_HOME instead of depending on having them defined by the compile command. * configure.in (DEFAULT_PAGER): Use AC_PROGRAMS_CHECK. If we find less, add `-e' flag, so users won't have to type q to quit paging. Sat Aug 7 13:34:06 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * f-*.cc: Renamed from tc-*.cc. (Use f- as the file prefix because most of these functions are ultimately implemented in Fortran, and, most importantly, it keeps them grouped together.) * f-*.h: New files, for external declarations of visible functions defined in f-*.cc. * g-builtins.cc: Include them all. * tree-const.h: Don't declare these functions as friends. * Makefile.in: Cope with new names. * octave.cc (parse_and_execute (char *, int)): Don't declare static. * octave.h: Declare it extern here. * octave-hist.cc (do_edit_history): Use it here. * octave-hist.cc (do_edit_history): New function. * t-builtins.cc (builtin_edit_history): Use it. * t-builtins.cc, t-builtins.h, builtins.cc: Rename edit to edit_history. * octave-hist.cc (do_history): Print line numbers by default. Allow quieter output with -q option. * g-builtins.cc (builtin_hess): Use DLD_BUILTIN macro to call hess. * g-builtins.cc (builtin_schur): Likewise * tc-hess.cc (builtin_hess_2): Call hess with corrrect args. * tc-schur.cc (builtin_schur_2): Likewise, for schur dude :-). * tc-fsqp.cc (builtin_fsqp_2): Fix typo. Thu Aug 5 23:14:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * input.cc (octave_read): Ensure that the last character in the buffer is a new line. Wed Aug 4 19:25:54 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y (func_def2): Also warn if we encounter a function definition with the same name as the script file we are reading. * tree.cc (tree_identifier::do_lookup): Always return NULL_TREE if a script file was executed. Tue Aug 3 23:25:45 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * file-io.cc: Delete useless static keyword from File_info class declaration. * unwind-prot.cc: Likewise, for unwind_elem and saved_variable classes. * tc-rand.cc: Likewise, for enum rand_dist declaration. * arith-ops.cc: Likewise, for enum Matrix_bool_op declaration. * tree.cc: Likewise, for struct const_matrix_list declaration. Fri Jul 23 01:40:38 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * sysdep.cc (malloc_handler): Add missing arg to call to message(). Tue Jul 20 04:09:32 1993 John W. Eaton (jwe@june.che.utexas.edu) * Version 0.74 released. * doinstall.sh (version): Run `./octave -v' to get the version number instead of grabbing it from version.h. * Fail if we can't get a version number. * Install ./octave, not src/octave. * Makefile.in (binary-dist): Don't depend on all. * Link src/octave to ./octave. (Now that there's no source in binary distributions, why have a src directory?) * file-io.cc (process_scanf_format): Rename local variable `i' to `chars_from_fmt_str'. * (process_printf_format): Likewise. * sighandlers.cc (can_interrupt): New global variable. * (sigint_handler): Use it to decide whether to jump to top level. * octave.cc (main): Set it after calling setjmp. * octave.cc (main): Declare saved_sigint_handler to be volatile. * tree.cc, tree-plot.cc, t-builtins.cc, pager.cc, g-builtins.cc, file-io.cc: Terminate strstream strings with ends instead of just using '\0'. * file-io.cc (process_scanf_format): Skip leading white space for %s conversions. * (fopen_file_for_user): Pass tree_constant arg by reference. * (do_scanf): If doing fprintf, don't fail if first arg is a string. Mon Jul 19 16:00:22 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (pstrcmp): Declare to take char** args, not char*. Sun Jul 18 13:02:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * file-io.cc (return_valid_file): Pass arg by reference. * file-io.cc (fclose_internal, fgets_internal, fseek_internal): Eliminate unnecessary casts to double. * file-io.cc (return_valid_file, fgets_internal, fopen_internal, do_printf, do_scanf): Use is_string_type instead of doing the comparison ourselves. * g-builtins.cc (builtin_exist, builtin_getenv, builtin_shell_command): Ditto. * tc-colloc.cc (collocation_weights): Ditto. * tc-extras.cc (eval_string, get_user_input): Ditto. * tc-rand.cc (rand_internal): Ditto. * tree-plot.cc (tree_subplot_list::print): Ditto. * variables.cc (is_valid_function, octave_string_variable): Ditto. Thu Jul 15 02:29:03 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * doc/Makefile.in (TEXINFO): Distribute texinfo.tex too. * t-builtins.cc (load_variable): Warn if replacing local symbol with global from file. * Warn if variable is not marked as global in a file, but already exists as a global symbol, then go ahead and load it as a global. Tue Jul 13 01:47:48 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (lookup_identifier): Never alias to global here. * tree.cc (do_lookup): Don't alias formal parameters to global. * variables.cc (force_global): Likewise. * symtab.cc (symbol_table::bind_globals): Likewise. * symtab.h (symbol_record::formal_param): New field. * symtab.cc (symbol_record::mark_as_global_parameter): New function. * (symbol_record::is_formal_parameter): Ditto. * tree.cc (tree_identifier::mark_as_formal_parameter): Ditto. * (tree_parameter_list::mark_as_formal_parameters): Ditto. * parse.y (param_list): Use it to tag formal parameters. * (func_def1): Ditto. * arith-ops.cc (DIVIDE_BY_ZERO_ERROR): On IEEE machines, allow divide by zero errors to be suppressed. * user-prefs.h (warn_divide_by_zero): New user preference. * user-prefs.cc (warn_divide_by_zero): New function. * builtins.cc (builtin_string_variables): Install it with default value of true. * tree.cc (tree_multi_assignemnt_expression): Use tree_return_list instead of tree_param_list. * (tree_multi_assignment_expression:eval): Make it work. * tree.cc (tree_return_list): New class. Allow index expressions and identifiers in return lists. * (tree_matrix::to_return_list): Rename from to_param_list. * parse.y (expression): Use it. * parse.y: Increment and decrement maybe_screwed_again instead of just setting it to zero or one. Mon Jul 12 03:23:40 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-assign.cc (tree_constant_rep::do_matrix_assignment): Handle case of lhs being of unknown type. * lex.l (check_for_garbage_after_fcn_def): Also ignore trailing commas and semicolons. Sun Jul 11 00:08:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.73.1 released. * symtab.cc (symbol_record::alias): Also copy pointer to sv_fcn. Sat Jul 10 14:34:00 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_function::eval (int, char **, int): New function. * symtab.cc (symbol_table::bind_globals): New function. * tree.cc (tree_function::eval): Use it to associate local symbols with global data. * symtab.cc (alias): Add optional parameter `force'. * Version 0.73 released. * pr-output.cc: Use D_NINT instead of NINT in some cases to avoid overflow problems on systems that don't have IEEE Inf. * mappers.cc (round): Likewise. Also avoids conversion of Inf to INT_MAX on systems that do have IEEE Inf. * builtins.h: Remove definition of NINT. * tree.h: Likewise. * tree-const.h: Likewise. * utils.cc (NINT): Move function here and improve handling of extreme values. * (D_NINT): New function. * scripts/isempty.m: Don't require the number of rows and columns to both be zero. Thu Jul 8 16:25:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.72.2. * configure.in: Do a better job of grabbing the last argument as the target_host_type and avoiding setting it to things like --prefix=/foo/bar * tree-const.cc (tree_constant_rep::save): Add default case for mark_as_global switch to avoid warnings from gcc. * variables.cc (force_global): Cope with symbol table changes. * tree.cc: (tree_identifier::do_lookup): Likewise. * lex.l (lookup_identifier): Likewise. * builtins.cc (install_builtins): Likewise. * symtab.cc, symtab.h: Massive internal rewrite. Wed Jul 7 02:18:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-assign.cc (tree_constant_rep::do_scalar_assignment): If rhs is a scalar type, also handle case of lhs being of unknown type. * Be sure to set the new type of the lhs. * tree-base.h: Don't include symtab.h. * tree-const.h: Ditto. Tue Jul 6 22:47:28 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y (func_def2): Remove the function name from the top-level symbol table if defining on command line (an M-file would never be parsed if there was already an entry with the same name in the top level symbol table). * parse.y (word_list_command): Allow clear without any arguments. * tree.cc (word_list_command::eval): Handle word list commands with no arguments. Mon Jul 5 14:43:30 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.72.1. * help.cc (operators): Document the double quote character. * lex.l (getting_help): Delete unused variable. * (HELP_FCN): New exclusive start state. * ({IDENT}{S}*): Set start state to HELP_FCN instead of setting getting_help. * ({IDENT}/{S}*=): Likewise. * symtab.cc (symbol_table::load): Delete unused function. * tree-const.cc (tree_constant::load): Return flag telling whether the constant is global. * t-builtins.cc (builtin_load): Handle global variables. * (builtin_save): Likewise. * symtab.cc (symbol_record::save): Don't save builtin variables (variables marked as eternal are assumed to be builtin). * symtab.cc (symbol_record::mark_from_global): New function. * (symbol_def::undefine): Add optional argument to prevent deleting symbol's definition. * (symbol_table::undefine): If this variable has been marked as defined from a global, call symbol_def::undefine with arg = 1. * tree.cc (tree_identifier::do_lookup): If a local symbol is defined from a global, mark it as such. * symtab.cc (symbol_record::define (symbol_record*)): Delete unused function. * tree.cc (tree_identifier::do_lookup (int&)): Use operator= instead of symbol_record::define(). * variables.cc (force_global (char*)): Likewise. Sun Jul 4 01:27:44 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (symbol_record): Define copy constructor and operator=. * builtins.cc (install_builtins): Make `i' and `j' read-only functions. * symtab.cc (symbol_record::define): Respect read-only status of variables and functions. Sat Jul 3 19:11:31 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * user-prefs.h (print_empty_dimensions): New user preference variable. * user-prefs.cc (print_empty_dimensions): New function. * builtins.cc (print_empty_dimesions): Make default value true. * tree-const.cc (tree_constant_rep::eval): Use value here. * cond.m: Handle empty matrices. * tc-det.m (determinant): Likewise. * tc-inv.m (inverse): Likewise. * tc-hess.cc (hess): Use gripe_square_matrix_required instead of calling error. * tc-schur.cc (schur): Likewise. * builtins.cc (propagate_empty_matrices): Change default value to true. * tree-const.cc (tree_constant_rep::eval): If a matrix has zero rows or columns, also print the dimension along with the `[]' symbol. * tree-const.cc (do_binary_op): If ok to propagate empty matrices, go ahead and do the binary operation so that the result will have consistent dimensions. * (do_unary_op): Likewyse. * tc-extras.cc (get_dimensions): Don't force both nr and nc to zero if one is. * Matrix.cc, DiagMatrix.cc, ColVector.cc, RowVector.cc: Handle matrices with zero dimensions in a more consistent fashion. Thu Jul 1 00:27:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * perror.m: New M-file. * LP.h, LP.cc: New interface for linear programmming. * LPsolve.h LPsolve.cc: New files to implement linear programming using lp_solve. * NPSOL.cc (minimize): Also return the vector of Lagrange multipliers. * tc-npsol.cc (npsol): Optionally return them. * QPSOL.cc (minimize): Also return the vector of Lagrange multipliers. * tc-qpsol.cc (qpsol): Optionally return them. * tc-qpsol.cc (qpsol): Make it work. Wed Jun 30 02:19:00 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_lpsolve): New function. * (builtin_qpsol): Ditto. * builtins.cc (general_functions): Add them to the list. * tc-lpsolve.cc: New file. * tc-qpsol.cc: Ditto. * src/Makefile.in: Add them to the list of SOURCES and DLD_OBJECTS. Tue Jun 29 15:02:07 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * liboctave/DAE.cc (integrate): If stop_time_set is false, reset default value for info[3]. * liboctave/ODE.cc (integrate): Likewise, reset default values of iopt and itask. From Thorsten Ohl : * config.guess: Add check for NeXT. * configure.in: Add check for NeXT so that readline is configured properly (really need to improve readline's configuration scheme). * sysdep.cc (malloc_handler): New function for handling malloc errors on NeXT systems. * octave.cc (main): Call sysdep_init before anything else. * sysdep.cc: New file for system dependent things. * octave.cc (initialize_globals): Only pass argv[0] since that's the only thing that's used. Sat Jun 26 13:00:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_builtin::eval (int, char**, int)): Don't panic if called for something other than a text_fcn. * t-builtins.cc (builtin_cd): Rewrite to fix bogus memory problems. Fri Jun 25 15:23:03 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.cc (builtin_cd): Don't delete value returned by get_working_directory. * g-builtins.cc (builtin_pwd): Likewise, and simplify. * utils.cc (make_absolute): Always create a new copy to return. * utils.cc (change_to_directory): Don't delete pointer returned from get_working_directory(). * (file_in_path): Likewise. Thu Jun 24 16:48:38 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l ({IDENT}{S}*): Always insert a comma if the next token doesn't look like some sort of operator, not just if convert_spaces_to_comma is also true (it may have been turned off by BIN_OP_RETURN). * tree-const.h (matrix_ptr): Delete function. * tc-extras.cc (frobit): Delete function. * (get_dimensions): New function. * (identity_matrix): Completely rewrite. * (fill_matrix): Likewise. Wed Jun 23 13:50:16 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix-ext.cc (SCHUR::init): Also allow ord flag to be lowercase. * (ComplexSCHUR::init): Ditto. * tc-schur.cc (schur): Likewise. * Matrix-ext.cc (SCHUR::init): Declare sort as char, not char*, and pass its address to Lapack. * (ComplexSCHUR::init): Ditto. * Matrix-ext.cc (SCHUR::select_dig): Make static, and move ahead of first reference in file. * (SCHUR::select_ana): Likewise. * (ComplexSCHUR::select_complex_dig): Likewise. * (ComplexSCHUR::select_complex_ana): Likewise. * builtins.cc (install_builtins): Add `J' as an alias for `I'. * builtins.cc (install_builtins): Always create a new tree_constant for each variable, since the symbol table doesn't know how to share them. * tc-schur.cc (schur): Use warning and error functions instead of writing directly to cerr. * tc-hess.cc (hess): Ditto. * src/Makefile.in (DLD_OBJECTS): Include tc-schur.o and tc-hess.o. * (SOURCES): Add tc-schur.cc tc-hess.cc. * Merge Schur and Hessenberg changes: Fri Mar 19 11:01:19 1993 R. Bruce Tenison (btenison@eng.auburn.edu) * src/builtins.cc: Changed schur definition to include one more input. Also changed the help line description * src/g-builtins.cc: Changed builtin_schur to accept two inputs Also changed the information to explain ordered schur operation. * src/tc-schur.cc Added extensions to the SCHUR and ComplexSCHUR calls to pass extra paramater. Also added check for proper param. * liboctave/Matrix.h: Modified declarations dgeesx and zgeesx to accept address of select function. Modified class structures for SCHUR and ComplexSCHUR to accept extra ordered schur param. * liboctave/Matrix-ext.cc: Added extensions for the extra ordered schur paramater. Wed Mar 17 15:23:14 1993 R. Bruce Tenison (btenison@eng.auburn.edu) * liboctave/Matrix-ext.cc (HESS and ComplexHESS): Added the Hessenburg decomposition routines. * liboctave/Matrix.h Added fortran lapack functions definitions used in the Hessenburg procedure. * src/g-builtins.cc (builtin_hess): Hessenburg Decomposition routine added * src/g-builtins.h (builtin_hess): Added extern definition. * liboctave/Matrix.h Added classed HESS and ComplexHESS * src/tree_const.h added defs for hess. * src/tc-hess.cc (hess): New file for hess function. Tue Mar 16 10:46:32 1993 R. Bruce Tenison (btenison@eng.auburn.edu) * src/g-builtins.cc (builtin_schur): Schur Decomposition routine added. * src/g-builtins.h (builtin_schur): Added extern definition. * liboctave/Matrix.h Added Classes SCHUR and Complex SCHUR, and added defs for zgeesx and dgeesx (lapack schur decomp) * liboctave/Matrix-ext.cc (SCHUR and Complex SCHUR): Ditto. * src/tree-const.h added defs for schur. * src/tc-schur.cc (schur): New file for schur function. Tue Jun 22 20:18:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (check_for_garbage_after_fcn_def): New function * parse.y (fcn_end_or_eof): If reading from an M-file, use it to print warning about trailing garbage after the end of a function has been found. Mon Jun 21 20:21:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-assign.cc (tree_constant_rep::assign): Handle case of assignment to unknown constant too. * (tree_constant_rep::do_scalar_assignment): Don't fail for unknown_constant type. * (tree_constant_rep::do_matrix_assignment): Likewise. * tree-const.cc (rows): Return 0 for unknown_constant type. * (columns): Likewise. * tree.cc (tree_identifier::assign): Defer defining symbol until assignment is successful. * When creating a new dummy tree_constant to assign a value to, leave it an unknown_constant type. * tc-assign.cc (do_scalar_assignment): If the right hand side isn't a scalar, maybe try to resize instead. * (do_matrix_assignment): For A(:,int) and A(int,:) cases, also resize if left hand side is a scalar. * norm.m: Allow "fro" to work for scalars and vectors too. Sun Jun 20 01:17:03 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * NLConst.cc: New file. Move inline function definitions here from NLConst.h. * Objective.cc: New file. Move inline function definitions here from Objective.h * tree.cc (tree_word_list_command::eval): Call strsave for argv[0] too, and delete argv before returning. * (tree_builtin::eval): Likewise, for text functions with no arguments. Sat Jun 19 01:37:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (parse_and_execute): Delete calls to delete_buffer and switch_to_buffer, since that is taken care of by unwinding the frame. Fri Jun 18 00:08:36 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_matrix::eval): Delete useless direct = ptr->direct and ptr = ptr->next statements from size-determining loop. * parse.y (opt_list): New rule. Replace all occurrences of list with opt_list. * tree.cc: (tree_index_expression::eval (int, int)): Don't complain if the index expression has an empty argument list. * octave.cc (initialize_globals): Check return value of getenv ("HOME") against NULL, not the global variable home_directory that we are trying to initialize. * tree.cc (tree_function::eval): Quick return if command list is empty. * parse.y (func_def3): Allow empty function bodies. Thu Jun 17 02:08:02 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_while_command): Add constructor for case of expression only. * parse.y (statement): Allow empty command list for while commands. * parse.y (list): Allow empty commands in more places. This ups the shift/reduce error count by 6, to 19. * octave.cc (execute_startup_files): Don't delete sd. * octave.cc (initialize_globals): Make copies of all strings. * Store more humorous messages if things fail. Tue Jun 15 11:03:39 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-extras.cc (get_user_input): Finish incomplete change to get input using readline. * tc-extras.cc (match_sans_spaces): New function. * (get_user_input): Use it when checking to see if the user entered a `quit' command. * liboctave/Makefile.in: Don't distribute Makedeps.in or include Makedeps since we generate dependencies automatically now. * configure.in: Don't create liboctave/Makedeps. Sun Jun 13 18:31:17 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/xdiv.cc (xdiv): Solve least-squares problem if system of equations is not square, or if it is singular. * (xleftdiv): Likewise. * liboctave/Matrix.h (Matrix::lssolve): New functions for least-squares solutions of linear systems. * (ComplexMatrix::lssove): Ditto. Sat Jun 12 19:07:07 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * libcruft/misc/xstopx.f (xstopx): Call dostop, not do_stop. * libcruft/misc/dostop.c: Rename from do_stop.c * (dostop): Likewise. * src/mappers.cc (xisnan (double)): Define even for systems that don't have xisnan by always returning false. * (xisnan (const Complex&)): Likewise. Fri Jun 11 19:54:58 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * doc/Makefile.in (install): Try harder to install info files. * libcruft/Makefile.in (install): Run ranlib on installed library. * liboctave/Makefile.in (install): Ditto. * readline/Makefile.in (install): Ditto. Thu Jun 10 00:15:41 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.72 released. * libcruft/*/*.f: Don't call xstopx with '' since some Fortran compilers object to zero-length strings. * libcruft/misc/xstopx.f (xstopx): Don't print empty strings or single blanks. * libcruft/misc/gen-d1mach.c (main): Likewise, for generated code. * test/Makefile.in (check): Set the Tcl variable OCTAVE_PATH. * test/config/unix-octave.exp: Pass OCTAVE_PATH to OCTAVE using the new -p flag. * builtins.cc (install_builtins): Use load_path instead of calling default_path(). * octave.cc (load_path): New global variable. * (initialize_globals): Initialize it here by calling default_path(). * (main): Call initialize_globals() before getting command line arguments. * Accept new argument, -p PATH. * octave.cc (clean_up_and_exit): Don't print a message when Octave exits. * doinstall.sh: Install M-files in $(libsubdir), not $(libdir). * Use mkpath to create directories. * Extract version from version.h. * Makeconf.in (version): Compute version just once. * (libsubdir): New directory that includes version number, for installing M-files in (old versions of Octave may not be able to understand new M-files). * src/Makefile.in, libcruft/Makefile.in, liboctave/Makefile.in, doc/Makefile.in, readline/Makefile.in, scripts/Makefile.in (install): Use mkpath to create directories. * scripts/Makefile.in (install): Install M-files in $(libsubdir), not $(libdir). * mkpath.c: New file, from Emacs-19. * Makefile.in (mkpath): New rule. * (all): Depend on mkpath * (binary-dist): Distribute it. * config.guess: Update from bothner@cygnus.com. * lex.l ({QSTR}*[\n\']): Set start state to 0 or MATRIX, depending on value of braceflag. * ({DQSTR}*[\n\"]): Ditto. * tree.cc (tree_matrix::eval): Make sure that strings are nul terminated. Tue Jun 8 16:08:10 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (clean_up_and_exit): Print `bye-bye' here. * g-builtins.cc (builtin_quit): Not here. * pager.cc (terminal_columns): If screenwidth <= 0, return a default value of 80 columns. * (terminal_rows): Likewise for screenheight and a default of 24 rows. * octave.cc (parse_and_execute): Don't fiddle with interactive states since that screws paging output. * tree.cc (parse_m_file): Likewise. * parse.y (input): For `simple_list error END_OF_INPUT' and `error END_OF_INPUT' use ABORT_PARSE. * Always accept `simple_list END_OF_INPUT'. * Always abort for `END_OF_INPUT'. Mon Jun 8 13:55:41 1993 John C. Campbell (jcc@schoch.che.utexas.edu) * file-io.h (fopen_file_for_user): New function declaration. * file-io.cc (fopen_file_for_user): New function. * (fgets_internal): If file doesn't exist open it for user, also return (double) -1 on EOF * (fseek_internal), (ftell_internal), (frewind_internal), (do_printf): Ditto. * (fopen_internal): Remove warn_on_not_open flag, limit warns. Mon Jun 7 00:28:13 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * file-io.cc (do_scanf): Use `type' wherever possible instead of hardcoding name in messages. * (do_printf): Ditto. * file-io.cc (fflush_internal): If flushing stdout, flush output to the pager instead of calling fflush on a stream. * (do_printf): Make fprintf (stdout, ...) exactly the same as printf (...). * (do_scanf): Make fscanf (stdin, ...) exactly the same as scanf (...). * tc-extras.cc (get_user_input): Flush output to pager before prompting for input. * libcruft/Makefile.in (DISTFILES): Distribute STOP.patch to show the changes made to the Fortran sources. * libcruft/*/*.f: Replace STOP statements with calls to xstopx, so that Fortran programs won't just quit on us. * libcruft/misc/xstopx.f: New file. * libcruft/misc/do_stop.c: New file. * libcruft/misc/Makefile.in (SPECIAL): Add do_stop.c to the list. * (SPECIAL_DEPEND): Likewise, for do_stop.o. * libcruft/Makefile.in (CRUFT_OBJ): Ditto. * lex.l (")"): Don't pop the top of the in_brace_or_paren stack if it's empty. Sun Jun 6 00:41:28 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * liboctave/CollocWt.cc (init): Always compute Gaussian quadrature weights instead of trying to compute Radau or Lobatto weights if the endpoints are included. * Really do compute roots and derivative weights corresponding to Legendre polynomials if alpha and beta are zero, even if the endpoints are included. Sat Jun 5 22:19:55 1993 John C. Campbell (jcc@schoch.che.utexas.edu) * builtins.cc (builtin_general_functions): Correct max arg counts for fscanf, scanf, and sscanf. * g-builtins.cc (builtin_fscanf): Correct argument checks. * (builtin_sscanf): Likewise. * file-io.cc (fopen_internal): Don't warn for opening new file. * file-io.cc (process_printf_format): Handle * for field width and precision. * Pass array of arguments and nargin instead of just one arg. * (do_printf): Call process_printf_format() with new args. * file-io.cc (process_scanf_format): New function to handle scanf dirty work. * (do_scanf): New function. Sat Jun 5 14:09:41 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (YY_FATAL_ERROR): Redefine here to keep from exiting on fatal scanner errors. Fri Jun 4 16:35:25 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_multi_assignment_expression::eval (int)): Check to see if result is NULL before trying to use it. * tc-extras.cc (get_user_input): Call gnu_readline() to get input. Thu Jun 3 00:30:28 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * scripts/*.m: Convert single-quoted strings to use double quotes since the manual says they are better. * Version 0.71.10. * doc/Makefile.in (DISTFILES): Distribute octave.info*. * Makefile.in (.fname): Delete target and move actions back to the individual dist targets because this always needs to be done. * (binary-dist): Strip src/octave. * doinstall.sh: New file, for binary distributions. Wed Jun 2 15:11:54 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Makefile.in (binary-dist): New target, just like dist, except also distribute libcruft.a, liboctave.a, libreadline.a and src/octave. * Makefile.in (.fname): New target. * (links-for-dist): New target. * (local-dist): Depend on .fname. * (dist): Depend on .fname and use links-for-dist. * octave.cc: Move code to print startup message to just after option processing so that any messages from startup files will appear after the normal startup message. * utils.cc (get_site_defaults): New function. * (OCTAVE_HOME): Provide default definition. * (SITE_DEFAULTS): Delete definition. * octave.cc (execute_startup_files): Use get_site_defaults instead. * src/Makefile.in (utils.o): Define OCTAVE_HOME to be $(prefix) here. * Makeconf.in: Don't define SITE_DEFAULTS or OCTAVE_M_FILE_DIR. * lex.l (do_string_escapes): Recognize `\"'. Tue Jun 1 01:28:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.71.9. * parse.y (maybe_convert_to_ans_assign): Greatly simplify. * file-io.cc (File_info): Convert from struct to proper class. * (valid_mode): New function. * parse.y, parse.h, lex.l, tree-extras.cc (convert_to_ans_assign): Delete unused variable. * builtins.cc (SEEK_CUR): Set to 1 to match (normal) system values. * (SEEK_END): Likewise, set to 2. * statdefs.h: New file. * Makefile.in (INCLUDES): Add it to the list. * octave-hist.cc: Include it. * variables.cc (identifier_exists): Likewise. * utils.cc (is_newer): Likewise. * builtins.cc (SEEK_SET): New builtin varible. * (SEEK_CUR): Ditto. * (SEEK_END): Ditto. * (stdin): Ditto. * (stdout): Ditto. * (stderr): Ditto. * lex.l (strip_trailing_whitespace): New function. * ({IDENT}{S}*): Use it. * ([^ \t\n\;\,]*): Fix to grab trailing spaces. Use strip_trailing_whitespce() to delete it before returning. Mon May 31 21:00:00 1993 John C. Campbell (jcc@june.che.utexas.edu) * file-io.cc, file-io.h: New files to implement C-style file handling and I/O functions. * (do_printf): Move here from tc-extras.cc. * (process_printf_format): Likewise. Also renamed from process_format. Mon May 31 00:52:55 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * (tree_function::eval): Now that we can restore values, enable code to give error for attempts to call functions recursively. * octave.cc (parse_and_execute): Use unwind-protect functions to save and restore state. * tree.cc (parse_m_file): Likewise. * (tree_function::eval): Likewise. * tc-extras (eval_string): Likewise. * unwind-prot.cc (saved_variable): New class to hold values of and pointers to variables we want to restore. * (restore_saved_variable): New function. * unwind-prot.cc (unwind_protect_int_internal): New function. * (unwind_protect_ptr_internal): Ditto. * (unwind_protect_var_internal): Ditto. * unwind-prot.h (unwind_prot_int): New macro. * unwind-prot.h (unwind_prot_ptr): Ditto. * unwind-prot.h (unwind_prot_var): Ditto. * variables.cc (symbol_out_of_date ()): Move here from tree.cc. * (is_valid_function): Fix logic for finding a function definition, including checking to see if the current symbol definition is out of date. * tree-const.h (is_numeric_or_range_type): New function. * tree-const.h (is_string_type): New function. * tree.cc (tree_matrix::eval): Use !is_string_type() instead of is_numeric_type() to decide that we've seen something other than a string. * parse.y (maybe_warn_assign_as_truth_value ()): New function. * user-prefs.h (warn_assign_as_truth_value): New preference. * user-prefs.cc (warn_assign_as_truth_value ()): New function. * builtins.cc (string_variables): Add it to the list. * tree.h (tree_simple_assignment_expression): Rename class from tree_assignment_expression. * (tree_assignment_expression): New class, derived from tree_expression. * (tree_simple_assignment_expression): Derive from new tree_assignment_expression class, not tree_expression class. * (tree_multi_assignment_expression): Ditto. Sun May 30 22:40:58 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/Makefile.in (%.d: %.cc): First remove target file, then redirect into tmp file, and finally move tmp file to target file only if creating tmp file was successful. * liboctave/Makefile.in (%.d: %.cc): Ditto. Sat May 29 18:18:16 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_constant *tree_multi_assignment_expression ::eval (int print, int nargout)): New function. * (tree_constant tree_multi_assignment_expression::eval (int print)): Use it to do the real work. * tree.cc (tree_matrix::to_param_list ()): Also allow index expressions as long as the argument list is missing. * parse.y (ans_expression): Now that assignments are just expressions, don't convert expressions to assignemnts to `ans' if they already are assignments. * maybe_convert_to_ans_assign (tree *expr): New function to do the real work. * tree.cc (tree_multi_assignment_expression:: is_assignement_expression ()): Return 1. * tree-base.h (tree::is_index_expression ()): New virtual function, returns 0. * tree.cc (tree_index_expression::is_index_expression ()): Return 1. * tree.cc (tree_assignment): Construct from tree_index_expression and a tree. * (tree_index_expression::ident ()): New function. * (tree_index_expression::arg_list ()): New function. * parse.y (variable): New rule, returns tree_index_expression. * parse.y: Rewrite assignment rules so that they are simply expressions, not special cases. * Rearrange fact and expression rules into expression (assignement or simple expression), simple_expr (binary and postfix expressions or secondary simple expression), and simple_expr1 (constants and prefix expressions) rules. * Delete fact rules. * parse.y: Make EXPR_EQ and EXPR_NE have the same precedence as the other relational operators. Fri May 28 10:14:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * unix-octave.exp: Delete use of OCTAVEFLAGS. * test/config: New directory. * test/config/Makefile.in: New file. * test/config/unix-octave.exp: Rename from test/octave-init.exp. * test/Makefile.in (SOURCES): Delete octave-init.exp from list. * configure.in: Add test/config/Makefile to the list of Makefiles to build. * utils.cc (send_to_plot_stream): Plot lines by default. Thu May 27 08:03:31 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (\]): Don't pop the top of the in_brace_or_paren stack if it's empty. * tree.cc (tree_matrix::eval): Make it work for single element strings as well. * Version 0.71.8. * lex.l (next_token_is_postfix_unary_op): New function. * ({SN}*\]{S}*): Use it as well, to decide whether to insert a comma. * ({S}+): Likewise. * ({IDENT}{S}*): Likewise. Wed May 26 15:37:27 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * pr-otput.cc (pr_any_float): Use form() now that iostream formatting bug has been fixed (libg++-2.3.1). Mon May 24 15:36:22 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (any_arg_is_magic_colon): New function. * (tree_builtin::eval) Use it to avoid calling builtin functions with `:' arguments. Sun May 23 14:07:19 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_fprintf): Correct usage message. Fri May 21 10:35:40 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.71.7. * octave.cc (main): Always reset_parser() before every call to yyparse(), not just on a longjmp return. * doc/Makefile.in (install): For now, don't try to install anything. * lex.l ({S}+): Call next_token_is_bin_op() instead of making the check in line. * ({SN}*\]{S}*): Likewise. * ({S}+): Likewise. * lex.l (looks_like_bin_op): New function. * (next_char_is_space): Ditto. * (next_token_is_bin_op): Ditto. * lex.l ({IDENT}{S}*): If we're in a brace context and the next character is an open paren, set convert_spaces_to_comma to 0. * tree-const.cc (convert_to_str): New function. * g-builtins.cc (builtin_setstr): New function. * builtins.cc (builtin_general_functions): Add it to the list. Thu May 20 17:56:15 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * doc/Makefile.in (SOURCES): Define to be all .texi files. * (octave.info): Depend on $(SOURCES). * (octave.dvi): New target. * Don't distribute the man page. * lex.l ({S}+): If the next character is a plus or minus followed by a space or tab, don't insert a comma. This makes input like [1 + 1] == 2 and input like [1 +1] == [1 1]. * ({SN}*\]{S}*): Likewise. * lex.l ({S}+): Use in_brace_or_paren and convert_spaces_to_comma to decide whether to convert spaces to a comma. * lex.l ({IDENT}{S}*): If we're in a brace context and the next character is an open paren, set convert_spaces_to_comma to 0. * lex.l ({SN}*\]{S}*): Even if we're still inside some braces, don't always push a comma onto the input. * lex.l ({SN}*\]): Also grab trailing spaces. * ({IDENT}): Ditto. * lex.l (in_brace_or_paren): New stack to keep track of whether the closest enclosing scope is a pair of braces or parens. When we see a `[' or a `(', push a flag on the stack. When we see a `]' or a `)', pop the top of the stack. * lex.l (convert_spaces_to_comma): New flag to control lexer behavior. * (RETURN): Reset it to 1. * (most other returns): Reset it to 1. * lex.l (BIN_OP_RETURN): New macro. Set convert_spaces_to_comma to 0. * (most binary operators): Use it instead of RETURN. * lex.l (match_any): New function. Wed May 19 12:51:54 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Range.cc (nelem_internal): Don't allow ranges with more than INT_MAX elements. Return -1 to indicate failure. * tree-const.cc (tree_constant_rep::tree_constant_rep (double, double, double)): Check nelem() to see if the range is valid. * pr-output.cc (all_elements_are_ints (Range&)): We only need to check the base and the increment, not the limit too. * Range.cc (nelem_internal): Move function definition here from Range.h and do a better job of determining the number of elements in the range. Tue May 18 09:06:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.71.6. * tc-extras.cc (find_nonzero_elem_idx): Declare inner loop iteration variables that are used inside later nested loops in the outer enclosing scope to make this work for old and new language definitions (see the ARM, chapter 19: "ANSI/ISO Resolutions", 6.4/6.5: "The statement or statements immediately controlled by the condition in a selection-statement, or an iteration-statement introduce an implicit local scope". * xpow.cc (elem_xpow (Matrix&, Matrix&)): Likewise. * tree.cc (tree_identifier::parse_m_file (char*, int)): Set reading_script_file before calling parse_m_file and restore it afterward. Mon May 17 20:04:54 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.h (prog_name): Declare extern. * (raw_prog_name): Ditto. * f2c-compat.sh (ctest.c): Also write a dummy MAIN_ since gcc 2.4 doesn't seem to create an executable now if there are unresolved externals, and the linker wants to see it on Suns. Thu May 13 01:06:18 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Makefile.in (DISTFILES): Include Makeconf.in. * configure.in: Set defaults for CFLAGS, CXXFLAGS, LDFLAGS, and FFLAGS. * Don't substitute CDEBUG, COPTIMIZE, FOPTIMIZE, or CXXOPTIMIZE. * Use AC_PROGRAMS_CHECK instead of our own code for checking for a Fortran compiler. * Add Makeconf to the list of files to create. * src/Makefile.in (octave): Use ALL_LDFLAGS instead of LDFLAGS. * Makeconf.in (ALL_CFLAGS, ALL_CXXFLAGS, ALL_LDFLAGS): New macros. * Allow the user to set CFLAGS, CXXFLAGS, and FFLAGS without screwing things up. * (CDEBUG, COPTIMIZE, FOPTIMIZE, CXXOPTIMIZE): Delete. * Provide rules for making .o from .cc or .c files that use ALL_CXXFLAGS and ALL_CFLAGS. * src/Makefile.in: Generate dependencies automatically using the method described in the GNU make manual. * liboctave/Makefile.in: Likewise. * All Makefile.in files: Set TOPDIR and include $(TOPDIR)/Makeconf. * Makeconf.in: New file, for most configuration options. * tc-rand.cc (rand_internal): Return an empty matrix for rand (0). Wed May 12 01:32:36 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (clean_up_and_exit): Call close_plot_stream before quitting. * Version 0.71.4. * pr-output.cc (octave_print_internal (ostrstream&, Matrix&)): Handle wrapping columns neatly, respecting value of split_long_rows. * (octave_print_internal (ostrstream&, ComplexMatrix&)): Ditto. * (octave_print_internal (ostrstream&, Range&)): Ditto. * user-prefs.cc (split_long_rows): New preference variable and function. * builtins.cc (builtin_string_variables): Add to list with default value == true. Tue May 11 02:20:43 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * pr-output.cc (pr_max_internal): Don't count Inf or NaN when looking for max value. * (pr_min_internal): Likewise, for min values. * pr-output.cc (pr_any_float): Merge pr_float and pr_imag_float. * pr-output.cc (any_element_is_inf_or_nan (Matrix&)): New function. * (any_element_is_inf_or_nan (ComplexMatrix&)): New function. * (all set_format functions (except Range)): Consider Inf and NaN when computing field width (we'll either print "Inf" (possibly with a sign) or "NaN"). * pr-output.cc (pr_float): Handle Inf and NaN. * (pr_imag_float): Ditto. * pr-output.cc (set_format_style): Make format short set precision to 3 and max field width to 8. * pr-output.cc (pr_float): Don't print a sign for -0.0. * (pr_imag_float): Ditto. * pr-output.cc (all set_format functions): Return the actual field width computed or 0 if free format. For complex, return both real and imaginary field widths. * Include pager.h for terminal_rows() and terminal_columns(). * pr-output.cc (pr_complex): If imaginary part is -0.0, print a minus sign but convert the value to 0.0 before printing. * octave.cc (parse_and_execute (FILE *, int)): Don't use readline to read commands from files. * (parse_and_execute (char *, int)): Set reading_script_file before calling get_input_from_file. * Version 0.71.3. * src/Makefile.in (deps): New target. * Update dependencies using the output from running `make deps'. * pr-output.cc (set_output_prec_and_fw): New function. * (set_format_style): Use it. * (set_format functions): Use user_pref variables for precision and field width. * variables.cc (octave_real_scalar_variable): New function. * buitlins.cc (builtin_string_varaibles): Add output_precision and max_field_width to the list (really need a separate list for numeric values...). * user-prefs.cc (set_output_max_field_width): New function to be called when output_max_field_width changes. * (output_precision): Likewise, for output_precision. * sighandlers.cc (pipe_handler_error_count): New global variable. * (sigpipe_handler): Use it to keep from printing more than one broken pipe message between prompts. * (input.cc): Reset pipe_handler_error_count before printing the prompt. Mon May 10 13:06:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * sighandlers.cc (sigpipe_handler): Issue warning and return instead of aborting. * user-prefs.cc (all sv_* functions): Don't delete previous value of a preference string if the new value is bogus. * user-prefs.cc (all sv_* functions and all functions that handle user preferences): Return 0 for success, -1 for failure. * symbtab.cc (symbol_record::define): Check return value of sv_fcn and restore previous value on failure. * symtab.h (sv_Function typedef): Change to return int, not void. * builtins.h (sv_Function typedef): Ditto. Sun May 9 18:25:00 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * user-prefs.cc (all sv_* functions): Issue a warning if the user gives us something that's not a string. Sat May 8 23:40:59 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * ColVector.cc (ColumnVector::min): Upper loop limit is len, not 0. * (ComplexColumnVector::min): Ditto. * RowVector.cc (RowVector::min): Ditto. * (ComplexRowVector::min): Ditto. Fri May 7 18:41:29 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * pr-output.cc (set_format_style): New function, extracted from builtin_format(). * t-builtins.cc (builtin_format): Call set_format_style to do real work. * pr-output.cc: New file for special formatted printing funcions. * tree-const.cc (tree_constant_rep::eval): Use new functions. * user-prefs.cc (sv_pager_binary): New function. * user-prefs.h (user_preferences) Add new field, pager_binary. * builtins.cc (builtin_string_variables): Add PAGER to the list. * utils.cc (default_pager): New function. * Makefile.in: Define DEFAULT_PAGER for utils.cc, not pager.cc. * pager.cc (get_pager): Delete function. * Use user_pref.pager_binary instead of calling get_pager(). Thu May 6 11:05:06 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * pager.cc (pager_buf): Declare as static pointer to ostrstream. * (initialze_pager): Delete old pager_buf and create new one for each batch of output. This is needed because once str() is called for pager buf, it will no longer grow. * pager.cc (maybe_page_output): Take care of deleting buffer after str() is called. * (flush_output_to_pager): Likewise. * t-builtins.cc (builtin_ls): Likewise. * (builtin_set): Likewise. * (builtin_show): Likewise. * tc-extras.cc (process_format): Likewise. * (process_format): Likewise. * tree-plot.cc (tree_plot_command::eval): Likewise. Wed May 5 10:45:39 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_shell_command): Buffer characters with an ostrstream and call maybe_page_output instead of writing directly to cout. * (builtin_warranty): Likewise. * tc-extras (do_printf): Likewise. * tree.cc (tree_identifier::eval): Likewise. * (tree_assignment_expression::eval): Likewise. * (tree_multi_assignment_expression::eval): Likewise. * tree-const.cc (tree_constant_rep::eval): Likewise. * t-builtins.cc (builtin_help): Likewise. * (builtin_ls): Likewise. * (builtin_who): Likewise. * user-prefs.h user-prefs.cc (page_screen_output): New preference. * builtins.cc (string_variables): Add to list with default value of true. * input.cc (octave_gets): If interactive, call flush_to_pager() before prompting. * utils.cc (terminal_rows): Move to pager.cc * (terminal_columns): Likewise. * (get_pager): Likewise. * pager.h, pager.cc: New file to handle pager stuff. * src/Makefile.in: Fix things to distribute and compile them. * libcruft/Makefile.in (CRUFT_OBJ): Strip $(srcdir)/ and convert from .f to .o in two steps since some versions of GNU make strip the leading ./ from the output of $(wildcard), causing my pattern match to fail if compiling in the source tree. Tue May 4 09:13:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (symbol_record::define (symbol_record *)): Delete old name before saving new name. * (symbol_record::document): Likewise, for var.help and fcn.help. * parse.y (ABORT_PARSE): Renamed from DO_ABORT. Mon May 3 01:00:04 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc: Define destructors for every class in tree.h. It appears that it should always be ok to delete everything in a command tree once we're done executing it. Function definitions are still ok because the parser doesn't set global_command to the tree_function we've built (that's saved somewhere in the symbol table and shouldn't be deleted until we clear or redefine the function). * utils.cc (pathstring_to_vector): Do memory management here so callers don't have to. * (default_path): Likewise. * utils.cc (make_absolute): Return current_path (not a copy) since it is static. * (get_working_directory): Return the_current_working_directory (not a copy) since it is global. * utils.cc (cleanup_tmp_files): Delete filename when done. * parse.y: Replace output to cerr with calls to error() or warning(). * DO_ABORT: New macro. Use it instead of YYERROR for errors that we detect, and call yyerror since bison doesn't. * (param_list1): Detect invalid parameter lists. * (yyerror): Don't print pointer if it is past the end of the line. Sun May 2 13:03:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-extras.cc (process_format): Use ostrstream instead of a fixed-size character string to buffer the format. * utils.cc (terminal_rows): Get info from readline variable instead of hardcoded constants. * (terminal_columns): Likewise. * utils.cc (maybe_page_output): New function. * t-builtins.cc (builtin_help): Use it. * (builtin_who): Ditto. * Don't include procstream.h anymore since we no longer need it. * utils.cc (jump_to_top_level): Call run_all_unwind_protects () before jumping back to the top level. Sat May 1 20:59:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * unwind-prot.cc unwind-prot.h: New files to implement memory cleanup stuff. * src/Makefile.in: Distribute them. * Version 0.71.2. * computer.m: Delete file. * scripts/Makefile.in (computer.m): Add $(srcdir)/ prefix to computer.in. Fri Apr 30 17:03:04 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.h (::row (int i)): New function for extracting a row of a matrix where CLASS is one of Matrix, DiagMatrix, ComplexMatrix, or ComplexDiagMatrix. * (:: column (int i)): Likewise for columns. * (::row (char *s)): Likewise, but selection is done with a character string. Currently we accept anything beginning with `F' or `f' to mean the first row and anything beginning with `l' or `L' to mean the last row. Wed Apr 28 14:23:49 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * scripts/computer.in: New template file for computer.m. * scripts/Makefile.in (computer.m): Generate a custom computer.m file using $target_host_type. * (clean): Delete computer.m. * configure.in: If last argument is not empty, use its value as the TARGET. * If we aren't given a TARGET, use config.guess to find one. * Substitute target_host_type. * config.guess: New file, taken from gdb distribution. * Makefile.in: Distribute it. * tree-const.cc (force_numeric): New parameter, force_str_conv to allow us to ignore user preference on string to numeric conversion. * (make_numeric): Likewise. * tree.cc (tree_matrix::eval): Allow range constants in matrix lists by simply converting them to matrices. * Ditto for string constants. Tue Apr 27 17:21:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * utils.cc (smells_like_X11): Delete unneeded function. * builtins.cc (install_builtins): Don't initialize graphics_terminal since it's no longer needed. * utils.cc (pathstring_to_vector): Call tilde_expand on each element of the path. * mappers.cc: Include float.h for DBL_MAX. Wed Apr 21 19:31:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * mappers.cc (xisnan (Complex&)): Rename from isnan. * builtins.cc (mapper_functions): Use xisnan instead of isnan. * (install_builtins): Special case for linux for geenerating infinity and NaN. Mon Apr 19 14:10:55 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.71.1 released. * symtab.cc (char **sorted_list (int& count)) New function. * (char **sorted_var_list (int& count)): Ditto. * (char **sorted_fcn_list (int& count)): Ditto. * t-builtins.cc (builtin_who): Check symbol count too. * utils.cc (send_to_plot_stream): Check is_open(), not just the state of the stream. * (close_plot_stream): Likewise. * procstream.cc, procstream.h: Rewrite, taking a hint from the GNU fstream class. Sun Apr 18 17:40:54 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.cc (builtin_help): Don't call list_in_columns if there isn't anything to list. Fri Apr 16 20:57:15 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Makefile.in (DISTDIRS): List dld here. * (DISTSUBDIRS): Not here. Thu Apr 15 12:17:08 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.71 released. * scripts/*.m: Improve help messages for most files. * libcruft/Makefile.in: Make libcruft.a here. * libcruft/Makerules.in: Not here. * PLOTTING: New file. * Makefile.in: Add it to the list of files we distribute. * g-builtins.cc (builtin_shell_command): New function. * builtins.cc (general_functions): Add it to the list. * procstream.h, procstream.cc (iprocstream): New class. * lex.l ({SN}*\]): Maybe insert a comma after reading a `]'. * t-builtins.cc (builtin_load): Do tilde expansion for the file name. * (builtin_save): Ditto. Wed Apr 14 10:40:44 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_function::eval): Until we have a proper call frame unwinding scheme, comment out previous change. * tree.cc (tree_matrix::eval): Brain Transplant. * (tree_matrix::length): New function. * tree-base.h (matrix_dir): Delete md_none, md_left, and md_up. The only valid values are md_unknown, md_right, and md_down. Tue Apr 13 20:07:25 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.h (tree_function::call_depth): New member variable. * tree.cc (tree_function::eval): Check it to make recursive function calls fail (waiting for proper symbol table handling). * utils.cc (pathstring_to_vector): Don't prepend `.' here. We do that already in default_path() if the user hasn't given us a loadpath. * t-builtins.cc (builtin_help): Get help for M-files even if they haven't been compiled yet. * List M-files we find in the loadpath. * utils.cc (get_m_file_names): Split into two functions, add parameter to specify whether .m suffix is deleted. * lex.l (grab_help_text): New function. * (beginning_of_function): New global variable. * (%|#): Call grab_help_text() if at beginning of a function. * tree.cc (tree_identifier::document): New function. * parse.y (func_def2): Use it. * (help_buf): New global buffer for help text. Mon Apr 12 00:31:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * utils.cc (get_m_file_names): New function. * variables.cc (make_name_list): Use it. * t-builtins.cc (list_in_columns): Put output on an strstream instead of in a String. * (builtin_help): Use an strstream instead of a String for buffering. * (builtin_who): Likewise. * g-builtins.cc (builtin_keyboard): New function. * builtins.cc (general_functions): Add to list. * tc-extras.cc (get_user_input): If the user enters `exit', `quit', or `return', return instead of eval'ing the string. * Don't abort on empty input. * Add additional argument to handle debugging via new `keyboard' function. If doing debugging, keep reading until we see `exit', `quit', or `return'. * menu.m: New M-file. * New top level plotting functions: plot.m semilogx.m semilogy.m loglog.m polar.m title.m xlabel.m ylabel.m grid.m bar.m stairs.m mesh.m meshdom.m contour.m * New internal plotting functions: plot_int.m plot_2_s_s.m plot_2_v_v.m plot_2_v_m.m plot_2_m_v.m plot_2_m_m.m polar_int.m * New utility functions: is_scalar.m is_vector.m is_matrix.m Sun Apr 11 11:10:29 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * t-buitlins.cc (builtin_ls): New function. * builtins.cc (text_functions): Add it to the list under the names `ls' and `dir'. Sat Apr 10 15:13:05 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * procstream.cc (oprocstream::close): Set badbit for stream after it is closed. * utils.cc (close_plot_stream): New function. * g-buitlins.cc (closeplot): New builtin function. * builtins.cc (general_functions): Add to list. * lex.l (cant_be_identifier): New cruft to properly handle the plot command's `using', `title', and `with' keywords. Fri Apr 9 09:38:25 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Warn if it looks like gnuplot isn't installed. * utils.cc (send_to_plot_stream): Check the user's preference for the gnuplot binary. * user-prefs.cc (sv_graphics_terminal): Delete function. * user-prefs.h (graphics_terminal): Delete variable. * tree-plot.cc (tree_subplot_using::print): Add argument to allow checking of columns given in using command and use it. * (tree_plot_command::eval): Change caller. * parse.y (title): Allow plot title to be any expression. * tree-plot.cc (subplot_list): Likewise. * tree-plot.cc (tree_plot_command::eval): Don't let lusers try to make 2D parametric plots, since that seems to crash gnuplot. * tree.cc (tree_identifier::parse_m_file): Don't try to stash m-file name or time parsed if we were actually executing a script file. * sombrero.m: New M-file to demonstrate 3D plotting. * parse.y (plot_options): Allow them to be specified in any order. * g-builtins.cc (builtin_purge_tmp_files): New function. * builtins.cc (general_functions): Add to list. * g-builtins.cc, g-builtins.h (builtin_plot): Delete. * builtins.cc (general_functions): Delete entry for builtin_plot. * t-builtins.cc (builtin_set): Check to see if the user is setting up parametric plotting. * tree-plot.cc (parametric_plot): New global variable. * tree_const.cc (save_three_d): New function. * tree-plot.cc (tree_subplot_list::print): Handle 3D plots. * Makefile.in: Delete everything having to do with distributing or making gnuplot. * configure.in: Likewise. Thu Apr 8 10:02:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * utils.cc (send_to_plot_stream): New function. Move declaration of plot_stream to utils.cc and make static. * t-builtins.cc (builtin_set): New function. * (builtin_show): Ditto. * lex.l: Handle set command. * (doing_set): Yet another global variable to control behavior of the lexer. * tree-plot.cc (tree_subplot_using::print): Print warning if scanf format string is given. * parse.y (ranges1): Allow lower and upper bounds to be optional. * tree-plot.cc (tree_plot_range::print): Make it work. * tree-plot.cc: New file, extracted from tree.cc. * sighandlers.cc (install_signals): New function. * (*_handler): New set of functions to handle signals that would otherwise cause us to abort. * (my_friendly_exit): Call exit from most signal_handlers to clean up tmp files, etc. * lex.l (do_string_escapes): Correctly handle '' quotes. * Warn about unrecognized escape sequences but convert them to the escaped character anyway. * (EXPON): New definition. Use it and ? qualifier to shorten the expressions for matching numbers. * (ECHAR): New definition. Use it to correctly match backslash-escaped characters in strings. * Definitions: Surround multi-character definitions in ()'s to avoid potential problems with things like {DEF}*. * (QQ): Rename from DQ. * (DQSTR): New definition for strings in double quotes. * (DQSTRING): New start state. Recognizing a naked " puts us here. * ("\n"): Turn off quote_is_transpose at the beginning of each line. * Use error functions instead of writing messages directly. * Don't include iostream.h -- we don't need it now. * Do include error.h. Wed Apr 7 13:12:17 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * sighandlers.h, sighandlers.cc: New files for signal handling functions. * Makefile.in: Include them in the usual places. * octave.cc (interrupt_handler): Move to sighandlers.cc and rename to sigint_handler. * utils.cc (mark_for_deletion): New function. * octave.cc (cleanup_tmp_files): New function. * octave.cc (main): Register cleanup_tmp_files with atexit (on_exit for sun). * Stack.h: Template based stack class converted from libg++ genclass files. * SLStack.h: Likewise. * (SLStack::pop): Avoid apparent bug in SLList::remove_front. Tue Apr 6 10:01:52 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (almost_match): New function. * (plot_style_token): New function. * t-buitlins.cc: Include procstream.h instead of procbuf.h. * (builtin_help): Simplyfy opening of process output stream. * (builtin_who): Likewise. Mon Apr 5 13:48:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-extras.cc (tree_constant_to_scalar): Move to tree-const.cc and make it a member function called to_scalar. * (tree_constant_to_vector): Likewise. * (tree_constant_to_matrix): Likewise. * procstream.h, procstream.cc: New files/classes that implement an ostream to a process. Built on top of procbuf from libg++. * src/Makefile.in: Add them to the lists of files/objects. Sat Apr 3 23:11:56 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Lots of clean-up changes to parse.y, tree.cc, tree.h, and tree-base.h. Use more specific types than just for nonterminals. This allows us to have fewer virtual functions in the base class. Safer. Cleaner. Should have always been this way... Fri Apr 2 10:04:32 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y, lex.l: Fix grammar to accept plot command very similar to the gnuplot plot command. Wed Mar 31 13:11:56 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (eval_undefined_error): Until we can figure out how to clear names without causing problems later on, just remove the symbol name. * tree.h (tree_plot_command): New class. * (tree_plot_limits): Ditto. * (tree_plot_range): Ditto. * (tree_subplot_list): Ditto. * (tree_subplot_using): Ditto. * (tree_subplot_style): Ditto. * tree-base.h (command_type): Add plot_command to list. Mon Mar 29 09:53:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * find_exec.c (ABSOLUTE_FILENAME_P): Also return true if the given filename begins with `.'. * DAE.cc, DAE.h, DAEFunc.h, tc-dassl.cc: Make sure all calls to dassl and the user-supplied functions have consistent argument lists. * octave.cc (raw_program_name): New global variable to hold the unprocessed argv[0]. This is to help dld find the absolute path to the executing program. * (initialize_globals): Pass in argc and argv from main. Initialize raw_prog_name. * builtins.cc (general_functions): Correct help message for dassl. * g-builtins.cc (dassl_usage): Likewise. * src/Makefile.in: Lots of changes to make things work with or without dld. * Makefile.in: Likewise. * configure.in: Likewise. * dld: New directory, containing our copy of the dld sources. * dynamic-ld.cc, dynamic-ld.h: New files to implement dynamic loading functions. * src/Makefile.in: Add them to the distribution, compile them if doing dynamic loading. Sun Mar 28 11:03:15 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: When looking for Fortran compilers, check for fc last to avoid confusion with some vendor's /bin/sh fc builtin. * Handle new argument --with-dld. * g-builtins.cc (builtin_warranty): Add 1993 to list of copyright dates. Sat Mar 27 17:58:23 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-extras.cc: Rename from tree-extras.cc. * tc-colloc.cc, tc-dassl.cc, tc-det.cc tc-eig.cc, tc-fft.cc, tc-fsolve.cc, tc-fsqp.cc, tc-ifft.cc, tc-inv.cc, tc-lsode.cc, tc-lu.cc, tc-npsol.cc, tc-qr.cc, tc-quad.cc, tc-rand.cc, tc-svd.cc: Split individual functions from tree-extras.cc. * g-builtins.cc (npsol_usage): Improve message. * (dassl_usage): Likewise. * (builtin_lsode): Likewise. * (builtin_fsolve): Likewise. * (builtin_quad): Likewise. * builtins.cc (general_functions): Improve corresponding messages. * libcruft/fftpack: New directory for fftpack functions. * libcrutf/fftpack/*.f: Add implicit double precision (a-h,o-z) at the top of every subroutine. * tree-extras.cc (fft): Allow propagation of empty matrices. * (ifft): Ditto. * Matrix.cc (Matrix::fourier): New function. * (Matrix::ifourier): Ditto. * mx-inlines (make_complex): New function. * tree-extras.cc (fft): Use Matrix::fourier instead of doing real to complex conversion here and calling ComplexMatrix::fourier. * (ifft): Likewise, for ifourier. Sat Mar 27 17:56:59 1993 Fook Fah Yap (ffy@eng.cam.ac.uk) * Matrix.cc (ComplexMatrix::fourier): New function for fft. * (ComplexMatrix::ifourier): New function for inverse fft. * builtins.cc (general_functions): Add fft and ifft to the list of builtin functions. * g-builtins.cc (fft): New function. * (ifft): Ditto. * tree-extras.cc (fft): New function. * (ifft): Ditto. Sat Mar 27 13:53:39 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (usage_string): New file scope constant. * (getopt_option_string): Ditto. * error.cc: Declare all arguments const since we don't change them. * utils.cc (print_str_or_null): Delete unused function. * utils.h: Delete declaration. * tc-assign.cc, tc-index.cc, tc-inlines.cc, tree.cc, tree-const.cc: More error message cleanups. * tree-const.cc (print_if_string): Don't write to cerr unconditionally. Fri Mar 26 22:00:18 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (min): Avoid function calls as arguments for MIN. * (column_min): Ditto. * (max): Likewise, for MAX. * (column_max): Ditto. * tree-const.h (NINT): Make it an inline function instead of a macro. * tree-extras.cc (fill_matrix (tree_constant&, double, char*)): Convert to scalar type for complex values too. * error.h (panic_impossible): New macro to be used in place of assert (0) calls. * All .cc files: Replace calls to assert (0) and abort () with panic_impossible (). * Many .cc files:: Replace many instances of `cerr << ...' with calls to gripe() functions. * gripes.h, gripes.cc: New functions for reporting common errors. * Makefile.in: Include them in the usual places. Thu Mar 25 18:42:49 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Many .cc files:: Replace many instances of `cerr << ...' with calls to error() functions. * error.h, error.cc: New functions for reporting errors in a consistent way. * Makefile.in: Include them in the usual places. Wed Mar 17 17:29:44 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (symbol_table::save): New functions. * t-buitlins.cc (builtin_save): Use new functions for saving symbols. Handle case of saving all variables. * g-builtins.cc (builtin_pause): If one argument is given, pause for that many seconds before continuing. Otherwise, wait for user input. * symtab.cc (clear): Actually delete undefined symbol_records and remove their names from the list. * lex.l (lookup_identifier): New function. Avoid putting global names in the local symbol table. * ({IDENT}): Use it * ({IDENT}/{S}*=): Ditto. * tc-index.cc (do_scalar_index (tree_constant*, int)): Make indexing like a([1,1,1,1]) work for scalars. GAG. Tue Mar 16 20:08:23 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * t-buitlins.cc (builtin_cd): Call tilde_expand (from readline) on the argument. * lex.l (discard_until): Delete unused function. * When reading numbers, abort if scanf fails to read a number that we think it should. * (IDENT): New macro to match identifiers. * ([_a-zA-Z][_a-zA-Z0-9]*): Use the / operator for trailing context and split into two cases instead of trying to do the lookahead ourselves. * lex.l (do_comma_insert_check): Return the value yyleng had before yyinput() is called. * (DO_COMMA_INSERT_CHECK): New macro. This avoids the use of unput() in do_comma_insert_check() since there seems to be a bug in flex when calling unput() for '\n'. Note that this change is necessary if we want to use yyless() since we cant call yyless() from outside of yylex(), because Flex's yyless() is a macro that uses some variables local to yylex(). Mon Mar 15 11:03:43 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_matrix::eval): Undo part of previous change to make a = [1,2;3,4]; [a,a;a,a] work again. * parse.y (input): Don't abort for simple_list followed by EOF. Sun Mar 14 14:38:56 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * RowVector.cc (RowVector::operator << ()): Insert a space between each element. * (ComplexRowVector::operator << ()): Ditto. * g-buitlins.cc (plot): Don't declare plot_prog or plot_term as static, and don't delete them. * Matrix.h (all checkelem functions): Don't check for range errors if NO_RANGE_CHECK is defined. Sat Mar 13 10:18:51 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.cc (ComplexMatrix::prod): Make it work. Thu Mar 11 00:08:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.h (ellum): Delete function. * Declare and define new const elem, checkelem, and operator() functions. * ColVector.cc, DiagMatrix.cc, RowVector.cc, Matrix.cc, ODE.cc, LinConst.cc, FEGrid.cc, DAE.cc, Bounds.cc, FEGrid.h: Change all callers. * tree-const.cc, tree-extras.cc, xdiv.cc, xpow.cc: Ditto. * tree.cc (tree_matrix::eval): Improve row and column mismatch checking -- [[1,2];[3,4]] works now, and [1,2;3,4,[5,6]] is rejected. * Reformat error messages to include `error:' prefix. Wed Mar 10 14:02:09 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (do_comma_insert): New global variable. * (reset_parser): Reset it. * lex.l (do_comma_insert_check): New function. Call it wherever a token can be directly followed by '['. * (\[{S}*): Check the value of do_comma_insert. * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Only look for names in the current symbol table. * parse.y (word_list_cmd): Special case to disallow use of clear inside a fuction body. * parse.y (CLEAR): New %token. * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Return it if token is "clear". * t-builtins.cc (builtin_clear): Allow global symbols to be cleared. * symtab.cc (symbol_table::undefine): Clarify comment. * (symbol_table::clear): Don't actually remove names from the table, just force them to be undefined. * tree.h (tree_function): Delete unused data member `id'. * tree.cc (tree_function constructors): Don't initialize id. Mon Mar 8 15:50:28 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.70 released. * src/Makefile.in: Update dependencies. * tree.h: Include stdio.h, for FILE. * gnuplot-build: For now, always define -DNOGAMMA. * configure.in: Don't check for gamma(). * libcruft/Makerules.in: Don't use lib.a(obj.o) style dependencies because it's too slow for large archives. * liboctave/Makefile.in: Ditto. Sun Mar 7 16:33:39 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (parse_and_execute): Save and restore current column number. Set input line and column number to zero. * tree.cc (parse_m_file): Likewise. * tree.cc (tree_identifier::parse_m_file (FILE*, int*)): New function. If a parse error occurs, ensure that the symbol is cleared from the global symbol table. * (tree_identifier::parse_m_file (char*, int): Use it. * tree.cc (tree_identifier::do_lookup): New function. * (tree_identifier::eval): Use it. * utils.cc (decode_prompt_string): Really do use value of PWD. * user_prefs.cc (sv_loadpath, sv_ps1, sv_ps2, sv_pwd, sv_gnuplot_binary, sv_graphics_terminal): New functions. * (sv_graphics_terminal): Warn if terminal isn't valid, but set it anyway (it's too late to do anything by the time the function is called). * In functions that use these variables: Use the value from the user_pref structure instead of doing a symbol table lookup. * builtins.cc (builtin_string_variables): Add functions to call for LOADPATH, PS1, PS2, PWD, gnuplot_binary, and graphics_terminal. * builtins.cc (PS2): New builtin_string_variables. Set default value to "> ". * input.cc (octave_gets): Use it instead of no prompt for continued input. * parse.y (yyerror): Use line, column, file name, and text of current input line to print better parse error messages. * lex.l (NEW_MATRIX): New exclusive start state. Need this to be able to match \[{SN}* _and_ get secondary prompting right. * input.cc (octave_read): Keep track of current input line. * tree.cc (parse_m_file): Save and restore current line number. * lex.l (all patterns): Keep track of current input column. * (fixup_column_count): New function to deal with patterns that match more than one line. * input.h, input.cc (current_input_line): Global pointer to the text of the current input line. * parse.y, parse.h (input_line_number, current_input_column): New global variables. * Almost all source files: Finish (for now, at least) the reorganization we started for global variables. Wed Mar 3 14:49:59 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tc-assign.cc, tc-index.cc, tc-inlines.cc: New files, split out from tree-const.cc. * Almost all source files: reorganize so that all global data is declared in some include file or another. It probably wouldn't hurt to do some more reorganizing to try to eliminate the amount of global information... Tue Mar 2 20:49:35 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * variables.h, variables.cc: New files for handling things that need symbol table information. Lots of files changed to include variables.h, which now includes the extern declarations for the symbol tables. The declarations of the symbol tables are now in variables.cc, but they are still initialized in octave.cc. Mon Mar 1 11:35:03 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * builtins.h (builtin_string_variables): New field, sv_function, holds a pointer to the function to call when a variable changes. * builtins.cc (string_variables): Initialize sv_function field. * (install_builtins): While installing builtin string variables, stash sv_function and, if it isn't NULL, call it to initialize global variable user_pref. * symtab.h (symbol_record): New field, sv_fcn, holds a pointer to the function to call when a variable changes. * symtab.cc (symbol_record::define): Call sv_fcn if it isn't NULL. * symtab.cc (symbol_record::set_sv_function): New function. * utils.cc, parse.y, tree.cc, tree-extras.cc, tree-const.cc, idx-vector.cc, builtins.cc, symtab.cc: Instead of calling functions like do_fortran_indexing(), get the user's preference from the global struct user_pref. * utils.h, utils.cc: Delete all functions like do_fortran_indexing() that lookup user variables to find integer values. * user-prefs.h, user-prefs.cc: Move them here, but instead of returning values, set elements of the new global struct user_pref. * user-prefs.h, user-prefs.cc: New files for handling global variables for user preferences. * Makefile.in: Add them to the SOURCES and INCLUDES macros. * bsd-math/{acosh,asinh,atanh,log1p}.c: Declare all external functions used in each file since they might not be in math.h. * bsd-math/{scalb,copysign,logb,finite,drem,sqrt}.c: New files from BSD's support.c. Only using scalb, copysign, logb, and finite for now. * configure.in: Move tests for f77 closer to the top. * Allow configuration to proceed even if we can't find a Fortran compiler or f2c. * Use `here' documents instead of multiple echos for multi-line messages. * Imrpoved checking for missing math functions. Sun Feb 28 17:45:53 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * test/Makefile.in (check): Try to avoid errors from cp. * mappers.cc (xfinite): Put test for HAVE_FINITE first. * libcruft/Makerules.in (LIBCRUFT_DEPEND): Use `=' in assignment instead of `:='. * liboctave/Makefile.in: Make an explicit list of sources instead of using $(wildcard). Thu Feb 25 20:18:12 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * bsd-math/copysign.c: New file. HP's don't have this? * configure.in (LIBOBJS): Also check for copysign, log1p, and log__L. For each missing user-level function, add -DFOO_MISSING=1 to DEFS. * src/missing-math.h: For each function we declare, check the corresponding XXX_MISSING macro. Add declarations for copysign and log1p. Wed Feb 24 20:39:32 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l ({SN}*\]/{S}*==): Change scanning pattern to {SN}*\]{S}*/== in order to keep flex from generating any backtracking code. * ({SN}*\]/{S}*=): Likewise. Tue Feb 23 02:45:00 1993 John W. Eaton (jwe@ward.che.utexas.edu) * Version 0.69 released. * mappers.cc [_AIX && __GNUG__] : Provide a definition for finite(), since whatever version we get from the system when using g++ doesn't work (note that it does seem to work with gcc, xlc, and xlC). * bugs.texi: Note that the math.h file from libg++ declares finite() incorrectly for some systems. Mon Feb 22 02:04:16 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Look for runtest, but only believe that it exists if we can also find expect. * test/Makefile.in (check): Run tests in build directory, not source directory. * tree.cc (reading_script_file): New global variable. * (parse_m_file): Use it, and properly save and restore state so that nested script files will work. * octave.cc (parse_and_execute): Properly save and restore state so that nested script files will work. * Don't close input file here. * input.cc (get_input_from (FILE*)): Don't declare mf_instream static. Set mf_instream if reading and M-file or a script file. * parse.y: Minor changes to accomodate new lexer. * lex.l: Major overhaul in an attempt to do better string handling. Looks much simpler and even seems to work. * (do_string_escapes): New function. Sat Feb 20 00:40:32 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_npsol): If npsol is missing, return empty matrices for x and phi, and -1 for inform. * num2str.m: Use %g, not %f. * tree.cc (parse_m_file): Save and restor curr_sym_tab, because yyparse may mess with it if it encounters a function definition. * tree-extras.cc (eval_string): Ditto * octave.cc (parse_and_execute): Ditto * Makefile.in (DISTDIRS): Add bsd-math to list. * src/Makefile.in (LIBOBJS): New macro, value set by configure. (vpath): Add @srcdir@/../bsd-math for LIBOBJS. (octave): Add $(LIBOBJS) to deps. * gnuplot-build/Makefile.in: Likewise, for notgnuplot. * configure.in: Use AC_REPLACE_FUNCS to Check for acosh, asinh, atanh, and gamma. * bsd-math: New directory for functions from the BSD math library to use as replacements for missing functions. * parse.y (semi_comma, comma_semi): New rules. (simple_list, simple_list1): Use them to allow empty statements. (list, list1): Likewise. This allows empty commands as long as the empty command doesn't contain any newlines. * parse.y (simple_assign): New rule, allows things like a = b = c. (multi_assign): Extracted from assignment. (assignment): Split into simple_assign and multi_assign. (expression): Allow '(' simple_assign ')' to be an expression. * tree-extras.cc (eval_string): Return result of last expression evaluated, to make things like `eval ('1+1;')*2' work. Fri Feb 19 19:45:21 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_pwd): Use getcwd, which is defined in unistd.h, instead of getwd, which seems to be a BSDISM. * utils.cc (decode_prompt_string): Ditto. * (get_working_directory): Ditto. * arith_ops.cc (DIVIDE_BY_ZERO_ERROR): Don't rely on HAVE_IEEE_MATH, use HAVE_ISINF, HAVE_FINITE, and HAVE_ISNAN instead. * configure.in: Don't define HAVE_IEEE_MATH. * tree-extras.cc: Include stdio.h for FILE. Thu Feb 18 10:17:38 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (gobble_leading_white_space): New function. * (is_function_file): New function. * (parse_m_file): Handle case of .m file being just a file of commands to execute. * Add optional argument to specify whether to execute a script file. * Return whether a script file was executed. * (tree.cc, tree-extras.cc): Change callers. * octave.cc (parse_and_execute): new functions. * (execute_startup_files): Use them. * lex.l (\n): Don't gobble new line. * num2str.m: Don't print '\n'. Wed Feb 17 21:59:55 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * mappers.cc: Simplify and correct finite, isinf, isnan functions. * test/octave/t7.oct: New test for finite, isinf, and isnan functions. * configure.in: Define HAVE_IEEE_MATH if isnan and either finite or isinf is available. * builtins.cc (mapper_functions): Check HAVE_ISNAN instead of HAVE_IEEE_MATH to determine whether or not to define isnan(). * mappers.cc: Don't check for HAVE_IEEE_MATH. Just check for individual functions directly. * g-builtins.cc (npsol_usage): Correct usage message. * g-builtins.cc: Don't include unistd.h unless HAVE_UNISTD_H is defined. * t-builtins.cc: Ditto. * utils.cc: Ditto. Tue Feb 16 00:35:44 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.68 released. * tree.cc (parse_m_file): Set reading_m_file before calling get_input_from_file. * Don't mess with current_infile. * input.cc (get_input_from_file): Set mf_instream if we are reading an M-file. Otherwise, set rl_instream, (even if we aren't really using readline -- this is just the `normal' input stream). * Don't use current_infile. * (octave_read): If not interactive, check reading_m_file to determine where to look for input. * octave.cc (main): Don't use readline if we aren't interactive. * libcruft/misc/Makefile.in (local-dist): Make sure we don't distribute a bogus d1mach.f. (dist): Ditto. * tree-extras.cc (convert_to_ans_assign): New global variable. (eval_string): Conditionally turn off assignment to `ans', for get_user_input (). * parse.y (ans_expression): Use it. * lex.l (reset_parser): Reset it. * g-builtins.cc (builtin_input): New function. * builtins.cc (general_fucntions): Add it to the list. * tree-extras.cc (get_user_input): Do most of the real work. Mon Feb 15 01:14:40 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.cc (load_variable): New function. (builtin_load): Use it. * Makefile.in (SUBDIRS): Add the test directory. (check): Don't depend on all. Sat Feb 13 05:17:53 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (determinant, lu, matrix_exp, matrix_log, matrix_sqrt): Handle empty matrix argument. * Matrix.h: Add constructors of the form Matrix (double a) and ColumnVector (double a) to make it even easier to form single element vectors. Fri Feb 12 03:27:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (main): Add -v option that will print the version string and quit with a successful exit status. Thu Feb 11 00:46:34 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (eig): If given an empty argument, return enough empty matrices to fill all possible LHS variables. (qr): Likewise. (svd): Likewise. * tree-const.cc (fortran_style_matrix_assignment): Do the right thing if LHS is an empty matrix. * tree-extras.cc (qr): Handle empty matrix argument. * Matrix-ext.cc (QR): Make it work (really!). (ComplexQR): Ditto. Wed Feb 10 00:56:31 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * xdiv.cc (xdiv (ComplexMatrix& a, ComplexMatrix& b)): Do btmp.solve (atmp), like the other three xdiv's. Argh! * tree-extras.cc (eval_string): New function. Mostly works but could be very fragile. We desperately need some sort of `unwind-protect' scheme to avoid disaster when octave is interrupted. * g-builtins.cc (builtin_eval): Instead of just aborting, call eval_string if given one argument. * input.cc (octave_read): If get_input_from_eval_string is nonzero, stuff current_eval_string into buf for flex to read. * tree-extras.cc (char *current_eval_string): New global variable for eval(). * (int get_input_from_eval_string): Ditto. * Update copyright notices to include 1993 (now that it's February...). Tue Feb 9 14:35:08 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.67 released. * tree-extras.cc, tree-const.cc: Check the value of the variable `propagate_empty_matrices' to decide what to do about empty matrices in binary and unary operations and some function calls. * builtins.cc (builtin_string_variables): New global variable `propagate_empty_matrices' with initial value `warn'. * utils.cc (propagate_empty_matrices): New function. Mon Feb 8 19:46:51 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-const.cc: Finish changes required to make zero-one indexing work for indexing and assignment. Sat Feb 6 15:54:10 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * builtins.cc (builtin_string_variables): New global variable `prefer_zero_one_indexing' with initial value `false'. * utils.c (prefer_zero_one_indexing): New function. Fri Feb 5 13:03:14 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * idx-vector.h, idx-vector.cc: Major overhaul to help with zero-one style indexing. * tree-const.cc (matrix_to_index_vector): Delete functions. * (functions that use idx_vectors): Update for new idx-vector stuff. * arith-ops.cc: Don't declare matrix_to_fortran_indices. * tree-const.cc (matrix_to_index_vector): Add new argument, allow_neg_one, with default value of false. * (matrix_to_fortran_indices): Add new argument, allow_zero, with default value of false. * g-builtins.cc (builtin_find): New function. * builtins.cc (general_fucntions): Add it to the list. * tree-extras.cc (find_nonzero_elem_idx (tree_constant)): Do most of the real work. * tree-extras.cc (find_nonzero_elem_idx (const Matrix&): Do the rest. * (find_nonzero_elem_idx (const ComplexMatrix&): Ditto, for complex. Wed Feb 3 00:54:01 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in (DEFAULT_DOT_O_FROM_DOT_F): If using f2c, quote with single quotes instead of double quotes to avoid problems on systems (like the NeXT) that strip \'s from double quoted strings. * utils.c (empty_list_elements_ok): New function. * tree.cc (matrix_list::eval): Use it. * builtins.cc (builtin_string_variables): New global variable `empty_list_elements_ok' with initial value `warn'. * utils.cc (check_str_pref): New function. * (resize_on_range_error, prefer_column_vectors, warn_comma_in_global_decl, do_fortran_indexing, implicit_str_to_num_ok, treat_neg_dim_as_zero, ok_to_lose_imaginary_part, return_last_computed_value, silent_functions, print_answer_id_name): Use it instead of needlessly duplicating code. Tue Feb 2 16:58:02 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l ("'"): If it looks like we're defining a matrix, don't set the start condition to be MAYBE_QSTRING. GAK. There has to be a better way... * lex.l: Increment and decrement promptflag instead of just setting its value. This should help get prompting right for things like if [1,2;3,4] NL ... * input.cc (octave_gets): In order to issue a prompt, Require propmtflag to be greater than zero, not just nonzero. * tree.cc (tree_if_command): Allow matrices as the expression to test. Unlike Matlab, a complex value is false only if both the real and imaginary parts are 0. * tree.cc (tree_while_command): Ditto. * tree.cc (tree_for_command): Allow matrices and complex values in the expression. For matrices, assign each column in turn to the dummy variable. * Matrix-ext.cc (qr): Make it work. The LAPACK book gags me again! * xdiv.cc: When computing right division with complex matrices, use hermitian() instead of transpose(). * lex.l: Return IMAG_NUM for a numeric constant followed by [iIjJ], but don't allow spaces between the numeric constant and the letter (it causes problems inside `[]' where spaces matter... Mon Feb 1 17:15:19 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree_extras.cc (rand_internal): Make the random number generator give us a different sequence every time we start octave unless we specifically set the seed. Thu Jan 28 00:10:24 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.66 released. * configure.in: Define PLOTLIB in addition to adding -DUNIXPLOT to DEFS if we find -lplot, and call AC_SUBST for PLOTLIB. * QP.cc: Define constructors here. * QP.h: Not here. * QP.cc (All constructors that are given H): Force H to be symmetric. * (make_h_symmetric): New function. Wed Jan 27 01:35:53 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * arith-ops.cc (do_unary_op): Do the right thing for complex logical not operator. * Matrix.cc (ComplexMatrix::operator ! (void)): Return Matrix instead of ComplexMatrix. * mx-inlines.cc (not (Complex *d, int len)): For each element of d, return (d[i] == 0.0), not (d[i] != 0.0), and return it as a pointer to double, not Complex. * configure.in: Check for libcruft/qpsol/qpsol.f. * Create Makefile in libcruft/qpsol. * libcruft/qpsol: New directory. Copy QPSOL sources here. * libcruft/qpsol/Makefile.in: New file. * libcruft/qpsol/README.MISSING: New file. * libcuft/Makefile.in: Include qpsol in list of directories to make. * QPSOL.h, QPSOL.cc: New file for solving QPs with Gill and Murray's QPSOL. * QLD.h, QLD.cc: Delete all minimize functions except Vector minimize (double&, int&). * QP.h: Declare minimize functions virtual. * (Vector minimize (double&, int&): Declare as a pure virtual function. * QP.cc: New file to implement generic minimize functions. Tue Jan 26 00:27:13 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l: Recognize numbers of the form .{digits}E{digits} and .{digits}E[+-]{digits} * lex.l: Recognize .\ as ELEFTDIV. * parse.y: Handle ELEFTDIV. * tree.cc (tree_binary_expression::eval): Handle el_leftdiv. * arith-ops.cc (do_binary_op): Handle element by element left division. Fix some errors in element by element right division. * tree-base.h (enum expression_type): Add el_leftdiv. * Version 0.65 released. * tree-const.cc (tree_constant_rep::eval (tree_constant *args, int nargin, int nargout, int print)): Fix another brain-o in making recursive call.s * src/Makefile.in: Complete changes for CXX instead of C++ make variables. * tree-const.cc: For assignment and indexing functions, treat complex scalars and matrices in the same branch of the switch as real scalars and matrices -- the double_value() and matrix_value() functions take care of checking to see if it's ok to lose the imaginary part. * tree-const.h (tree_constant_rep::is_numeric_type): New function. * tree-const.h (tree_constant::make_numeric functions): Use it. * tree-const.h (tree_constant::make_numeric functions): Return *this for complex constants too. Mon Jan 25 18:31:06 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (Matrix min (Matrix&, Matrix&)): Loop over nc and nr, not nr and nr. * (Matrix max (Matrix&, Matrix&)): Ditto. * tree-const.cc (tree_constant_rep::mapper): Fix brain-o in making recursive call. Sun Jan 24 20:05:39 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: If using f2c, explicitly check for -lf2c. If it's not found, look for -lF77 and -lI77. If a suitable combination isn't found, print a warning. * src/Makefile.in liboctave/Makefile.in: GNU Make 3.63 uses CXX and CXXFLAGS instead of C++ and C++FLAGS. Fix things so that 3.63 will work without sacrificing compatibility with earlier versions. * tree-const.cc (tree_constant_rep::diag (tree_constant&)): Fix brain-o in forcing argument to be numeric. Fri Jan 22 15:03:42 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (interrupt_handler): Declare to take int argument. * NPSOL.cc (npsol_objfun): Delete leftover debugging message. Thu Jan 21 14:28:24 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Check version of gcc and issue a warning if it looks like 1.something. * Check for g++. Issue a warning if it is missing or if it is there but it looks like verion 1.something. * flibs.sh, f2c-compat.sh: Change file permission to 755 to avoid problems if the uid of the installer is different from the uid of the owner of the files. Wed Jan 20 04:18:49 1993 John W. Eaton (jwe@june.che.utexas.edu) * libcruft/Makerules.in (@DOT_O_DOT_F_C[1234]@): Patterns deleted. * configure.in: Do multiple line sed substitutions the right way. Tue Jan 19 14:50:50 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Use new AC_WITH to accept --with-f2c instead of --use-f2c. * Use new AC_HAVE_LIBRARY to find -lplot. * flibs.sh: Actually avoid including duplicate -lflags. * Use test, not `['. Sun Jan 17 16:57:02 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.h: Declare operator+ and operator- functions for vectors. * RowVector.cc: Define half of them. * ColVector.cc: Define the other half. Fri Jan 15 03:00:46 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * src/Makefile.in (install): Include version number in name of installed binary and make a link to $(bindir)/octave. * Version 0.64 released. * t-builtins.cc (builtin_clear): Don't allow the user to clear global symbols by name. If he tries, issue a warning. * tree.cc (tree_identifier::eval_undefined_error): Don't clear undefined symbols from the global or local (function) symbol tables. Thu Jan 14 02:10:20 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_function::eval): Save old and set current symbol table context, so eval_undefined_error() doesn't wipe out top level symbols. * Version 0.63 released. Wed Jan 13 13:16:56 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Nearly every .h and .cc file: Add interface and implementation #pragmas for G++ in hopes of making smaller objects with -g. * tree-const: Properly handle assignments like A(:) = RHS when do_fortran_indexing is true. * g-builtins.cc (builtin_eig): Correct usage message. * tree-const.cc (tree_constant_rep (ComplexDiagMatrix&)): Create and initialize a new complex_scalar. Don't just try to copy the value... * Matrix.h: Declare new fill functions for diagonal matrices. * DiagMatrix.cc: Define them. * Matrix.h: Declare map functions for row and column vectors. * RowVector.cc: Define them. * ColumnVector.cc: Likewise. * CollocWt.h: Declare data protected instead of private. * CollocWt.cc (CollocWt::CollocWt (const CollocWt&)): Fix brain-o. * lex.l: Return IMAG_NUM for a numeric constant followed by [ \t]*[iIjJ]. * parse.y (IMAG_NUM): New token. * (fact): Recogize IMAG_NUM and convert its value to a complex constant. * Version 0.62 released. * Makefile.in (local-dist): Include -local in tar.Z filename. * (split-local-dist): New target. * (dist): Don't depend on newversion. * (local-dist): Ditto. * tree-extras.cc (npsol): If the first argument isn't a vector, print an error message and return. * tree.cc (tree_matrix::eval): Always set prev_row_total and prev_column_total when starting out. * octave.cc (main): Don't try to detect signal handler failures, but do call signal() to set up the interrupt handler. Tue Jan 12 19:59:33 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (npsol): Fix brain-o in checking length of bounds vectors. Mon Jan 11 20:32:24 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (set_rand_seed): New function. (force_to_fit_range): New function. (current_seed): Really return current seed. (rand_internal): Allow the user to actually set the seed for the random number generator. Sun Jan 10 16:46:06 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.61 released. * builtins.h, builtins.cc: Rename from builtin-fcns.h, builtin-fcns.cc (too long for Linux/SysV). * mappers.cc (xisinf): For non-IEEE machines, consider DBL_MAX to be infinite. Fri Jan 8 09:15:57 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * gnuplot-build/Makefile.in (x11targets): Don't worry about checking HAVE_X11_X_H. * configure.in: Check for gamma and lgamma for gnuplot. * gnuplot-build/Makefile.in (Makefile.X11): Only move Makefile to ../Makefile.X11 if xmkmf succeeds. * gnuplot-build/Makefile.in (x11targets): Check to see that XMKMF is set *and* that Makefile.X11 exists. * If making notgnuplot_x11 with Makefile.X11 fails, try again with Makefile. * gnuplot-build/Makefile.in: Use @PLOTLIB@ in definintion of LIBS. * Don't define UNIXPLOT in TERMFLAGS. * Don't define LN_S; it isn't used anywhere, and configure doesn't give it a value. * configure.in: Check for closepl(). If found, define UNIXPLOT, and substitute -lplot for @PLOTLIB@. * arith-ops.cc (DIVIDE_BY_ZERO_ERROR): New macro. On systems that have IEEE math, give a warning but also go ahead and divide by zero. On systems that don't have IEEE math, just give an error message and return an undefined tree_constant (it would probably be possible to handle this so that it works the same everywhere, but I'm not sure it's worth the effort...). * builtin-fcns.cc (install_builtins): On systems that don't have IEEE_MATH, define Inf to be MAX_DBL, but don't define NaN at all. * configure.in: Check for finite, isnan, and isinf. * Set HAVE_IEEE_MATH if we find finite and isnan. * builtin-fcns.cc (install_builtins): Use HAVE_IEEE_MATH instead of IEEE_MATH. * mappers.cc: Check HAVE_IEEE_MATH and HAVE_ISINF macros rather than checking system type. * graph3d.c (hidden_line_plot): Declare dy and y as double, not float, since VERYLARGE can be DBL_MAX. * lsoda.f, lsodar.f, lsodes.f, lsodi.f, lsoibt.f, stoda.f, stodi.f, zrotg.f, sdot.f: Remove unused files. * texas_lotto.m: Renamed from win_texas_lotto.m to keep the filename less than 14 characters. Thu Jan 7 15:45:29 1993 John W. Eaton (jwe@june.che.utexas.edu) * utils.cc: Declare ioctl extern "C". * tree.cc: Include stdio.h to be sure FILE is defined (apparently not required by older versions of GNU iostream library). * t-builtins.cc: Likewise. * g-builtins.cc: Likewise, but for tmpnam. * tree-const.h (rand_internal): Rename from rand to avoid conflict with standard library rand (a macro in Linux). * tree-extras.cc (rand_internal): Fix function definition. * g-builtins.cc (builtin_rand): Call rand_internal instead of rand. * octave.cc (main): Don't try to detect signal handler failures. What's the proper way to do this if RETSIGTYPE is void? Tue Jan 5 08:14:29 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_matrix::eval): When adding a matrix down or to the right, column or row dimension mismatches are always errors. Mon Jan 4 04:58:55 1993 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.60 released. * xdiv.h, xdiv.cc: New files for Octave-specific matrix division stuff. * src/Makefile.in (INCLUDES, SOURCES, OBJECTS): Add xdiv stuff. * arith-ops.cc: Include xdiv.h. Sun Jan 3 12:24:04 1993 John W. Eaton (jwe@ward.che.utexas.edu) * gnuplot-build/Imakefile.in (notgnuplot_x11): In the compile command, put source file before libraries. * libcruft/misc/Makefile.in: Don't use -O to compile gen-dimach.c. Thu Dec 31 00:45:50 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (matrix_sqrt): Don't create D until it is really needed. * (matrix_log): Ditto. * (matrix_exp): Ditto. [this should really be just one function instead of three...] * g-builtins.cc (builtin_sqrtm): New function. * builtin-fcns.cc (general_fucntions): Add it to the list. * tree-extras.cc (matrix_sqrt): Do the real work. * Makefile.in: Distribute INSTALL.OCTAVE and configure.in. * (INSTALL.info): Make ../INSTALL.OCTAVE, not ../INSTALL. * doc/Makefile.in: Make ../INSTALL.OCTAVE, not ../INSTALL. * INSTALL.OCTAVE: Rename from INSTALL. Refer to INSTALL for more info. * INSTALL: Copy from autoconf distribution. Refer to INSTALL.OCTAVE for more info. * octave.cc (main): Remove leading blank line from startup message. * Don't print it everytime the user types C-c... * xpow.cc: Finish off remaining cases. * tree-extras.cc (process_format): New function. (do_printf): Use it. Wed Dec 30 00:43:14 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.56. * g-builtins.cc (builtin_logm): New function. * builtin-fcns.cc (general_fucntions): Add it to the list. * tree-extras.cc (matrix_log): Do the real work. * g-builtins.cc (builtin_expm): New function. * builtin-fcns.cc (general_fucntions): Add it to the list. * tree-extras.cc (matrix_exp): Do the real work. * Matrix-ext.cc (LU): Construct LU decomp. here, not in Matrix class. (ComplexLU): Likewise. * Matrix.cc (lu): Deleted. Use LU constructor instead. Change all uses in octave sources. * Matrix-ext.cc (EIG): Construct EIG object here, not in Matrix class. * Matrix.cc (eig): Deleted. Use EIG constructor instead. Change all uses in octave sources. * Matrix-ext.cc (SVD): Construct SVD here, not in Matrix class. (ComplexSVD): Likewise. * Matrix.cc (svd): Deleted. Use SVD constructor instead. Change all uses in octave sources. * Makefile.in: Update for new Matrix file organization. Don't compile mx-inlines separately -- it's included where needed. * Matrix.h: Declare Fortran routines we call here, not in Matrix.cc. Don't declare every class to be a friend of every other class. * mx-inlines.cc: New file, included by all Matrix-related .cc files. * Matrix.cc: Split into several files. * ColVector.cc: New file, from Matrix.cc * RowVector.cc: Ditto. * DiagMatrix.cc: Ditto. * Matrix-ext.cc: Ditto. * tree-extras.cc (svd): Take advantage of new constructors and diag functions. * Matrix.cc (DiagMatrix::diag) New function. (ComplexDiagMatrix::diag) Ditto. * tree-extras.cc (eig): Take advantage of new constructors. * tree-const.cc (tree_constant (DiagMatrix)): New constructor. (tree_constant (ComplexDiagMatrix)): Ditto. * Matrix.cc (Matrix (const DiagMatrix)): New constructor. (ComplexMatrix (const DiagMatrix)): Ditto. (ComplexMatrix (const ComplexDiagMatrix)): Ditto. Tue Dec 29 01:14:49 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (main): Print message at startup by default. Don't print it until just before main loop. * New -q option (inhibit_startup_message) turns it off. * New -f option (read_init_files) inhibits reading of startup files. * Delete -v option. * (verbose_usage): Reflect changes in arguments, document -d. * win_texas_lotto.m: Sort picks before returning. * tree-extras.cc (eig): Return [v,d], not [l,v], where d is a diagonal matrix made from l. * builtin-fcns.cc (mapper_functions): Fix last element of initialization list to have correct number of elements. * Version 0.55. * Quad.h: Move all inline functions to Quad.cc to avoid apparent g++ bug on the RS/6000. * configure.in: If we find flex, don't define LEXLIB. * COPYING.LIB: Deleted -- we're not actually distributing anything under these terms. * Makefile.in: Don't distribute COPYING.LIB. Mon Dec 28 00:46:21 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * xpow.h, xpow.cc: New files for safer pow() interface for octave. * src/Makefile.in (INCLUDES, SOURCES, OBJECTS): Add xpow stuff. * arith-ops.cc: Include xpow.h. * Don't declare toplevel jmp_buf. * t-builtins.cc (builtin_save): Make file and stream static to avoid dumping core on return (is this a bug in libg++ or g++?). * (builtin_load): Ditto. * symtab.cc (load): Make it work again. Yikes! This hasn't worked since the big symbol table overhaul... * tree-const.cc (tree_constant_rep::save): Handle complex scalars and matrices. * (symbol_def::undefine): Delete previous symbol definition before defining. This should be ok now, after the parse_m_file fix of 27 Dec. * getting_help: New global flag. * ([_a-zA-Z][_a-zA-Z0-9]*): Set it if looking at "help". * (reset_parser): Clear it. * lex.l (STRING): Use it to determine what to do with ' ; and , . * lex.l (QSTRING): Handle the following (C-style) backslash escape sequences correctly(?). \a bell \r carriage return \b backspace \t horizontal tab \f formfeed \v vertical tab \n newline \\ backslash * median.m: New M-file. * g-builtins.cc (builtin_sort): New function. * builtin-fcns.cc (general_fucntions): Add it to the list. * tree-extras.cc (sort): Do most of the real work. * tree-extras.cc (mx_sort): Do the rest. Sun Dec 27 17:40:24 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.cc (builtin_casesen): New function. * builtin-fcns.cc (text_functions): Add it to the list. * strcmp.m: Temporarily allow string to numeric conversions. Maybe strcmp() should be built in to the interpreter? * norm.m: New M-file. * builtin-fcns.cc (install_builtins): Treat i and j as functions, not variables. * Install inf as an alias for Inf. * Install nan as an alias for NaN. * tree.cc (tree_identifier::parse_m_file (char*)): Force new global symbol to be a function, not a variable. Tue Dec 22 14:15:57 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_function::eval): Check with silent_functions() and return_last_value_computed() to determine proper behavoir. * builtin-fcns.cc (silent_functions): New builtin variable. * (return_last_value_computed) Ditto. * utils.cc (silent_functions): New function. * (return_last_value_computed) Ditto. [This scheme for determining preferences needs to be reworked...] * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Only force yytext[len] to be the end of the identifier if we gobbled some whitespace. * Always unput the last character read. * tree.cc (tree_function::eval) Always turn on printing for commands inside functions. Sat Dec 19 14:03:49 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.54. Fri Dec 18 16:02:59 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * (symbol_def::undefine): Undo previous change. Someone is calling this function when they shouldn't be... * tree.cc (parse_m_file): If the script file is successfully parsed, Ensure that the new symbol is defined in the global symbol table. * lex.l: Handle continuation lines with the pattern {EL}{S}*\n { promptflag = 0; } // Line continuation. Thu Dec 17 01:47:14 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (symbol_def::define): Delete previous symbol definition before defining. (symbol_def::undefine): Ditto, but new definition is always NULL. * readline/Makefile.in: Don't compile emacs_keymap.c and vi_keymap.c since they are included by keymaps.c. * configure.in: If RETSIGTYPE isn't int, then define VOID_SIGHANDLER="-DVOID_SIGHANDLER=1". Substitute VOID_SIGHANDLER. * readline/Makefile.in (CFLAGS): Add -DVOID_SIGHANDLER if appropriate. * tilde.c: Declare xmalloc, not malloc. * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Only call unput if we've actually read something. * Version 0.53. Wed Dec 16 01:35:48 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Look in the global symbol table for names, but ignore functions. * tree.cc (tree_identifier::eval): Use symbol_out_of_date() to simplify logic for re-parsing M-files. Always look in global symbol table for functions in case the definition has changed (shouldn't the local symbols be undefined anyway??). * tree.cc (symbol_out_of_date): New function. * symtab.cc (symbol_table::undefine): Actually do something. * (symbol_table::remove_name): Ditto. * (symbol_table::clear): And so on. * Matrix.cc (ComplexMatrix::svd): Use complex conjugate transpose, not simple transpose, for V. * Version 0.52. * gnuplot-build/Imakefile (notgnuplot_x11): In the compile command, put source file before libraries. * parse.y (assignment): If trying to warn against assignment to a function, check is_function() instead of !is_variable(). * src/Makefile.in: Distribute input.h. Tue Dec 15 10:48:22 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (main): Call initialize_readline to set up completion functions. * input.cc (make_name_list, command_generator, command_completer, initialize_readline): New functions. * input.h: New file. * lex.l: Include it instead of input.cc. * src/Makefile.in: Create input.o rather than including it directly in lex.l. * builtin-fcns.cc: do_fortran_indexing is now initially false. prefer_column_vectors is now initially true. * builtin-fcns.cc (install_builtins): Install i and j (== sqrt(-1)) as permanent global variables. * g-builtins.cc (MAXPATHLEN) Provide default definition here. * t-builtins.cc: Not here. * g-builtins.cc (quitting_gracefully, interactive, clean_up_and_exit, verbatim_pwd, getwd) Declare here. * t-builtins.cc: Not here. * g-builtins.cc: Also include readline.h and history.h. * g-builtins.cc: Include version.h and sys/param.h here. * t-builtins.cc: Not here. * g-builtins.cc: Move builtin_clc, builtin_clock, builtin_date, builtin_pause, builtin_quit, builtin_warranty here from t-builtins.cc. * builtin-fcns.cc (general_functions): Move builtin_clc, builtin_clock, builtin_date, builtin_pause, builtin_quit, builtin_warranty here from text_functions to limit the number of reserved words. * scripts/*.m: Check for correct number of input arguments before proceeding. * configure.in (DEFAULT_PAGER): Look for less, more, page, and pg. * t-buitlins.cc (builtin_help): If no arguments are given, list all the known operators, keywords, functions, and variables. * t-builtins.cc (builtin_help) Pass the output through PAGER using a libg++ procbuf. (builtin_who): Ditto. * utils.cc (get_pager): New function. * help.h, help.cc: New files to manage lists of help info for keywords and operators. * symtab.cc (symbol_record): Implement the Matlab-style semantics of functions using two symbol_def objects. * (symbol_table): Store identifier names in a hash table instead of a linear list. * symtab.cc (symbol_def): New class. Sat Dec 12 00:00:00 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y (yyerror): Change error text to be more accurate. * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Only look in the current symbol table for names. Function names and other global symbols are now resolved at execution time. * symtab.cc (sorted_var_list): New function. * (sorted_fcn_list): Ditto. * (var_list): Ditto. * (fcn_list): Ditto. These should probably not all be separate functions... * t-functions.cc (builtin_who): Call sorted_var_list for each symbol table to print variable names only. * Accept -fcn, -fcns, or -functions to also list function names. * Make -all list function names, but under a separate heading from other symbols. * builtin-fcns.cc (is_text_function_name): New function. * lex.l ([_a-zA-Z][_a-zA-Z0-9]*): Use is_text_function_name to find if a name is a text function name instead of relying on the symbol tables. * lex.l (is_keyword): New function. ([_a-zA-Z][_a-zA-Z0-9]*): Use is_keyword instead of having a special lex pattern for each keyword. Thu Dec 10 12:25:12 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.cc: Declare top_level_sym_tab extern. * Version 0.51. Wed Dec 9 02:00:38 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (all user_functions): If the return value from a user's function is bogus, print an error message and abort to the top level. * tree-const.cc (all do_matrix_index functions): Major overhaul to simplify and apply range checking before doing the indexing. * tree-const.cc (fortran_row, fortran_column, valid_scalar_indices, matrix_to_fortran_indices): Move here from arith-ops.cc and declare as `static inline'. Delete declarations from arith-ops.h. * arith-ops.cc (gripe_nonconformant_assignment): Delete function. * tree-const.h (TREE_TO_MAT_IDX): Delete macro. * tree-const.cc (tree_to_mat_idx): Make it an inline function. * tree-const.cc (all do_matrix_assignment functions): Major overhaul to simplify resizing and range checking. * tree-const.cc (): Move here from arith-ops.cc. Jump to top level on errors. Return max value. (indexed_assign_conforms) New function. (index_check (int)): New function. (index_check (Range)): New function. Tue Dec 8 21:07:23 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-const.cc (tree_constant_rep::tree_constant_rep (Range): Don't create range constants that have less than 2 elements. * utils.cc (jump_to_top_level): New function. * All: Replace calls to longjmp with calls to jump_to_top_level(). Don't include , except in octave.cc, and utils.cc. Mon Dec 7 01:57:30 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in: Create Imakefile in gnuplot-build directory. Look for xmkmf, then X11/X.h. * gnuplot-build/Makefile.in: Try harder to get notgnuplot_x11 to build correctly. * gnuplot-build/Imakefile.in: New file, for building notgnuplot_x11 if xmkmf is available. * Version 0.50. * gnuplot-build/Makefile.in (SUBDIRS): Add docs. * tree-const.h (make_numeric_or_range_or_magic): New function. * tree-const.cc (do_matrix_index): Use it instead of make_numeric so that we actually take advantage of all the special cases we have for range types as matrix indices. * tree-const.cc (tree_constant_rep::do_matrix_index (int, Matrix)): Fix typo. * DAE.cc (integrate): If returning a matrix of values, don't mix time with the states. * ODE.cc (integrate): Likewise. Sun Dec 6 16:58:41 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (dassl): New function. * g-builtins.cc (builtin_dassl): Make it work. * doc/octave.1: Document it. * DAEFunc.h, DAEFunc.cc, DAE.h, DAE.cc: New files. * tree-extras.cc (lsode): Clean up. Use available functions instead of doing everything in line. * tree.cc (tree_multi_assignment_expression::eval): Don't define constants that are of unknown type. Try to be smarter about padding after last value. * tree-extras.cc (lu): Don't bother trying to return the LU factorization in a single matrix since this isn't really useful and isn't compatible with Matlab anyway (they use Linpack, we use Lapack). * tree.cc (tree_identifier::assign (rhs, args, nargs)): Only try to do assignment if rhs is defined. Sat Dec 5 18:23:55 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (qr): New function. * g-builtins.cc (builtin_qr): New function. * builtins.cc: Add builtin_qr to list of builtin functions. * doc/octave.1: Document it. * Matrix.cc (Matrix::lu): Use dgesv from Lapack instead of dgefa since it returns L and U, not some factors that need decoding. (ComplexMatrix:lu): Likewise. Fri Dec 4 01:51:05 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * configure.in (INCDIRS): Don't include /usr/local/include. (LIBDIRS): Don't include /usr/local/lib. * tree-extras.cc (lu): New function. * g-builtins.cc (builtin_lu): New function. * builtins.cc: Add builtin_lu to list of builtin functions. * doc/octave.1: Document it. * Matrix.cc (Matrix:lu, ComplexMatrix:lu): New functions. * Matrix.h, Matrix.cc (LU, ComplexLU): New classes. * tree-extras.cc (do_quad): New function. * g-builtins.cc (builtin_quad): New function. * builtins.cc: Add builtin_quad to list of builtin functions. * doc/octave.1: Document it. * doc/Makefile.in (install): Edit the manpage to substitute correct values in the FILES section. (dist) Depend on octave.info. (local-dist): Ditto. * Quad.h, Quad.cc: New files to implement quadrature. * NPSOL.cc (npsol_objfun): If compiling with GCC on a Sun, assign to objf via assign_double(). * sun-utils.h, sun-utils.cc: New files. * sun-utils.cc: Move declaration and definition of MAIN_ here from utils.cc. (access_double): New function, from GCC manual. (assign_double): New function, after access_double. Thu Dec 3 03:16:03 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * NEWS: New file. * Makefile.in: Distribute it. * scripts/*.m: Change to use new end feature. * lex.l: Recognize `endif', `endfor', `endfunction', `endif', and `endwhile', in addtion to `end'. * parse.y: Check for command/end mismatches. (end_error): New function. * doc/octave.1: Document it. Wed Dec 2 11:57:18 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * libcruft/villad: New directory. Move and split villad.f here from libcruft/misc. * configure.in: Create Makefile in libcruft/villad. * libcruft/Makefile.in: Add libcruft/villad to list of dirs to make. * All Makefile.in (uninstall): New target. (distclean): Likewise. (check): Ditto. * Try to make clean targets conform with GNU coding standards. * utils.cc (smells_like_X11): New function. * builtin-fcns.cc (install_builtins): Don't set graphics terminal to x11 unless it looks like we're running X11. * win_texas_lotto.m: New M-file. * octave.1: Document it. * arith-ops.h: New file. * src/Makefile.in: Build arith-ops.o, distribute arith-ops.cc, arith-ops.h. Maybe this will at least speed up recompiles. * THANKS: New file * Makefile.in: Distribute it. * configure.in: Create Makefile in gnuplot-build/docs. * gnuplot-build/docs/Makefile.in: New file. * Create and install notgnuplot.gih. Tue Dec 1 00:15:48 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_identifier::eval (int)): Only pad after if printing. (tree_multi_assignment_expression::eval (int)): Ditto. (tree_assignment_expression::eval (int)): Ditto. * hankel.m: Use disp to print message. * toeplitz.m: Ditto. * lex.l ({SN}*\]/{S}*=): Check maybe_screwed_again to decide whether to return SCREW_TWO or ']'. * doc/Makefile.in (install): Really install the manpage. * Version 0.49. * Matrix.cc (ComplexMatrix::operator !): New function. * arith-ops.cc (do_unar_op): Use it. * tree-extras.cc (inverse, svd, eig): Don't try to operate on empty matrices. * Matrix.h, Matrix.cc: (EIG): New class. (Matrix::eig): New functions. (ComplexMatrix::eig): Ditto. * tree-extras (eig): Use them. * g-builtins.cc (builtin_eig): New function. * builtin-fcns.cc (general_functions): Add eig to list. * dococtave.1: Document it. * Matrix.h, Matrix.cc: (ComplexDET): New class. * tree-extras (determinant): Use it. Mon Nov 30 04:02:29 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.h, Matrix.cc (ComplexSVD): New class. * tree-extras (svd): Use it. * Matrix.cc (svd): Use lapack instead of linpack to compute SVD. * libcruft/Makefile.in: Replace eispack with lapack in subdirectory list. * libcruft/eispack: Delete directory. * libcruft/lapack/Makefile.in: New file. * configure.in: Create Makefile in libcruft/lapack, not libcruft/eispack. * libcruft/lapack: New directory. * Copy files for SVD and Eigenvalue computation here. * lex.l ({SN}*\]/{S}*=): Only return SCREW_TWO if not defining a function. * arith-ops.cc (do_binary_op (double, double)): For pow operator, don't create complex value if exponent is really an int. * configure.in: Check for f77 last. * Print warnings if bison or lex is not found. * Reformat fatal no f2c/f77 error message. * flib.sh: Make it work even if xlf is called f77. Sun Nov 29 01:55:41 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc: Include f77-uscore.h. * Use F77_FCN macro when declaring or calling Fortran functions. * configure.in: After checking to see that it's not garbage, add the output of f2c-compat.sh to DEFS. * f2c-compat.sh: Figure out whether or not we need to append an underscore to Fortran function names. * flibs.sh: Handle xlf -v output as special case. * octave.cc: Only define BADSIG if it isn't already defined. * g-builtins.cc: Ditto. * configure.in: Don't create man/Makefile. * man: Directory deleted. * doc/Makefile.in: Distribute and install octave.1. * doc/octave.1: Renamed from man/octave.1. Sat Nov 28 15:54:39 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * man/Makefile.in (install): Install manpage. * octave.1: rename from octave.man * octave.1: Document builtin variables and command line editing (stolen from bash man page). * tree-const.cc (eval (int print)): Convert complex values to real if imaginary part is zero. * octave.cc (log_usage): Deleted. (main): Don't call log_usage. * g-builtins.cc (builtin_sqrt): Delete. (builtin_log): Ditto. (builtin_log10): Ditto. * tree-const.h, tree-const.cc (sqrt_internal): Delete. (log_internal): Ditto. (log10_internal): Ditto. * tree-const.cc (mapper): Handle neg_arg_complex. * builtin-fcns.h (Mapper_fcn): New field neg_arg_complex. * builtin-fcns.cc: (mapper_functions[]): Initialize it for list of mapper functions. * builtin-fcns.cc: (mapper_functions[]): Move log, log10, and sqrt back here from general_functions[]. Fri Nov 27 17:05:21 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (tree_constant_to_vector): Handle complex scalars and matrices. Wed Nov 25 17:32:42 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * man/octave.man: New file, very incomplete. * man/Makefile.in: Include octave.man in list of files to distribute. * g-buitlins.cc (builtin_rand): Handle nargin == 1. * tree-extras.cc (rand): Likewise. * rem.m: New M-file. Implemented as M-file because it's much simpler! * configure.in (DEFAULT_DOT_C_FROM_DOT_F): Escape % characters in rule to avoid problems with autoconf, which uses % for sed command delimeters. (DEFAULT_DOT_O_FROM_DOT_F): Ditto. Tue Nov 24 00:21:34 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (fill_matrix): Don't try to create matrices with negative dimensions. (frobit): Likewise. * utils.cc (check_dimensions): New function. * utils.cc (treat_neg_dim_as_zero): New function. * builtin-fcns.cc (treat_neg_dim_as_zero): New builtin variable, default value is false. * tree-const.h (tree_constant::bump_value): Like, assign, check reference count and possibly make a new copy before changing anything. * tree-base.h (is_builtin): New virtual function. * tree.cc (tree_builtin::is_builtin): New function. * parse.y (ans_expression): Also check to see if the lone expression is a builtin text-style function invoked without any arguments. * octave.cc, t-builtins.cc: Print copyright and other normal (non-error) message on cout instead of cerr. * t-builtins.cc (builtin_warranty): Don't return message in retval. (builtin_history): Likewise. (builtin_help): Also. (builtin_who): Ditto. * Version 0.48. * tree-extras.cc: Fix most functions to handle complex arguments. Still need to finish SVD and DET (waiting for these functions in the Matrix class). * tree.cc (tree_multi_assignment::eval): Optionally print names for result variables. * tree-const.h (tree_constant::eval (int print, int nargout)): New function. Simply ignore nargout. * tree.cc (tree_matrix::eval (int print, int nargout)): Ditto. * tree.cc (tree_parameter_list::name): New function. * lex.l (): Delete rules, start condition because they are unecessary. * lex.l ({SN}*\]): Split into three rules. Use trailing context instead of home-brew lookahead. Mon Nov 23 00:51:51 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * utils.cc (ok_to_lose_imaginary_part): New function. * builtin-fcns.cc (ok_to_lose_imaginary_part): New builtin variable, default value is warn. * tree-const.h (double_value): Maybe return real part if invoked for complex tree_constant. * tree-const.h (matrix_value): Ditto. * Version 0.47. This one wasn't tested, but there have been a lot of significant changes and I wanted a backup. * tree-const.cc (sqrt_internal): New function. Sqrt isn't implemented as a mapper function since negative real arguments give complex results. (log_internal): Ditto. (log10_internal): Ditto. * builtin-fcns.cc: Move sqrt, log, and log10 from mapper struct initializer to general function struct initializer. * rot90.m: New M-file. Still needs rem() to be complete. * tree-const.cc (mapper): Handle mapper functions for complex variables. * mappers.h, mappers.cc: New file for mapper functions. * builtin-fcns.h, builtin-fcns.cc: Rename from builtins.h builtins.cc. * flipud.m: Don't do indexing on lhs. * fliplr.m: Likewise. Sun Nov 22 17:09:36 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * arith-ops.cc (do_binary_op (double, double)): Handle a^b for a < 0. * builtins.cc: Make sqrt a general builtin function instead of a mapper function. * g-builtins.cc (builtin_sqrt): New function. * tree-const.cc (sqrt_internal): New function. Sat Nov 21 16:41:02 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-const.h, tree-const.cc: Complete most changes required to handle complex types. There are lots of details, most will be omitted here. * tree-const.h (is_real_type) New function. (is_complex_type): Ditto. (is_scalar_type): Ditto. (is_matrix_type): Ditto. * tree-const.h (REP_RHS_MATRIX, REP_ELEM_ASSIGN, CRMATRIX, ASSIGN_CRMATRIX_TO, CRMATRIX_ASSIGN_REP_ELEM, CRMATRIX_ASSIGN_ELEM): New macro for dealing with real and complex matrices in the same tree_constant_rep function. * tree-const.cc: Include arith-ops.cc. * arith-op.cc: New file for functions that implement unary and binary operations for the tree_constat classes. * Mark all operations that aren't implemented yet with a XXX FIXME XXX comment. There are about 35-40 things left to fix in this file. Thu Nov 19 00:25:16 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.46. [ This one wasn't tested, but there have been a lot of significant changes and I wanted a backup. ] * tree-const.cc (tree_constant_rep::do_unary_op): Handle Complex. (do_unary_op (Complex&, tree::expression_type)): New function. (do_unary_op (ComplexMatrix&, tree_expression_type): Ditto. * tree-const.cc (tree_constant_rep::assign): Handle Complex (still needs updated support functions in order to work). * tree.cc (tree_matrix::eval): Handle Complex. (tree_identifier::eval): Ditto. (tree_for_command::eval): Ditto. Wed Nov 18 23:33:13 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree_const.cc (tree_constant_rep::rows): Handle Complex. (tree_constant_rep::columns): Ditto. (tree_constant_rep::all): Ditto. (tree_constant_rep::any): Ditto. (tree_constant_rep::cumprod): Ditto. (tree_constant_rep::cumsum): Ditto. (tree_constant_rep::prod): Ditto. (tree_constant_rep::sum): Ditto. (tree_constant_rep::sumsq): Ditto. * tree_const.h, tree_const.cc (tree_constant::complex_value): New function. (tree_constant_rep::complex_value): Ditto (tree_constant::complex_matrix_value): New (tree_constant_rep::complex_matrix_value): New * tree_const.cc (tree_constant_rep::~tree_constant_rep): Handle complex scalars and matrices. (tree_constant_rep::force_numeric): Ditto. (tree_constant_rep::make_numeric): Ditto. (tree_constant_rep::eval): Ditto. (tree_constant_rep::bump_value): Ditto. C++, for C == a complex value is C = C + 1. Should I even do this? Hmmm. * tree-const.h, tree-const.cc: Begin adding support for Compelex. * Add complex_scalar and complex_matrix to value union. * Add complex_scalar_constant and complex_matrix_constant to type tag enum. * New constructors. * Matrix.h, Matrix.cc: Major changes to add Complex support. Tue Nov 17 14:40:45 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Matrix.cc (RowVector::operator (const Matrix&)): New function. * Matrix.cc (ColumnVector::transpose): New function. Eliminate friend function that served the same purpose. (RowVector::transpose): Ditto. Mon Nov 16 09:57:33 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (QSTRING): Fix to allow '' inside a string to represent a single quote. Makes computer.m a little funnier. Fri Nov 13 18:46:39 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.45. * computer.m: New M-file. * tril.m: Ditto. * triu.m: Ditto. * doc (*.texi): Can now produce BUGS, INSTALL, and octave.info files without generating errors, though the organization is probably till very wrong. * Makefile.in (newversion): Add magic to handle major versions other than 0, and major/minor versions of any length. Thu Nov 12 01:37:45 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.h, tree-const.h, builtins.cc, g-builtins.cc, tree-extras.cc: Conditionally compile code for NPSOL and FSQP based on FSQP_MISSING and NPSOL_MISSING. * g-builtins.cc (builtin_npsol): If NPSOL is missing, always call npsol_usage() to print out message indicating why NPSOL doesn't work. * g-builtins.cc (builtin_fsqp): Likewise for FSQP. * configure.in: Check for srcdir/libcruft/npsol/npsol.f and srcdir/libcruft/fsqp/fsqp.f. If missing, define NPSOL_MISSING or FSQP_MISSING and add them to DEFS. * libcruft/npsol/README.MISSING: New file. * libcruft/fsqp/README.MISSING: Ditto. * libcruft/npsol/Makefile.in (dist): Don't distribute sources because of license restriction. Do distribute Makefile.in and README.MISSING. * libcruft/fsqp/Makefile.in (dist): Ditto. * All Makefile.in files (local-dist): New target, usually the same as dist. * parse.y (ans_expression): Check to see that the RHS isn't just an identifier. * tree.cc (tree_identifier::eval (int)): Maybe print id name. * tree.cc (tree_assignment::eval (int)): Ditto. * buitlins.cc (print_answer_id_name): New builtin variable. * utils.cc (print_answer_id_name): New function. Tue Nov 10 10:58:36 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (log_usage): Surround with #if 0/#endif. Mon Nov 9 13:42:54 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * symtab.cc (load): Only issue error mesasge if attempt to find _first_ name keyword fails. * tree-const.cc (make_numeric_or_magic): New function. Like make_numeric except also pass magic_colons. * tree-const.cc (all do_matrix_index functions): Matrix ndices can be naked colons, so use make_numeric_or_magic on index arguments instead of make_numeric. * liboctave/Makefie.in (install): Install .h files in $(includedir). (includedir): New macro, default value $(prefix)/include. * tree.cc (tree_function::eval (int print)): Force arguments to be undefined. * tree-const.h (tree_constant::assign (rhs, args, nargs)): Check reference count before assigning. * tree.cc (tree_identifier::assign (rhs, args, nargs)): Don't eval lhs before doing assignment. * tree.cc (parse_m_file): Gobble leading white space, including comments. Fri Nov 6 16:52:59 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.44. * g-builtins.cc (builtin_getenv): New function. * isempty.m: New M-file. * g-builtins.cc (builtin_exist): New function. * utils.cc (identifier_exists): Handle the dirty details. * utils.cc (warn_comma_in_global_decl): New function. * builtins.cc (warn_comma_in_global_decl): New builtin variable. Initial value is true. * parse.y (global_decl): Handle global declarations here, including optional initialization. * t-builtins.cc (builtin_global): Deleted. Thu Nov 5 23:59:39 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_feval): New function. * tree-extras.cc (feval): Handle the dirty details. * g-builtins.cc (builtin_rand): New function. * tree-extras.cc (rand): Handle the dirty details. Wed Nov 4 14:54:17 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * num2str.m: New M-file. * int2str.m: Ditto. * g-builtins.cc (builtin_disp): New function. * g-builtins.cc (builtin_fprintf, builtin_printf, builtin_sprintf): New functions. * tree-extras.cc (do_printf): New function to handle the gory details. * g-builtins.cc (builtin_flops): Implement here because we may actually want to count operations at some point. Tue Nov 3 17:06:40 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-const.cc (do_binary_op): Detect and give error message for optations on empty matrices. (do_unary_op): Likewise. * parse.y (matrix): Convert `[]' and `[;]' to empty matrices instead of (tree_matrix *) NULL. Mon Nov 2 11:23:40 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * src/Makefile.in: Update dependencies. * liboctave/Makefile.in: Ditto. * tree-const.cc (force_numeric): Consult matlab_strings() before doing string to number conversion. * builtins.cc (matlab_strings): New builtin variable. * utils.cc (matlab_strings): New function. * tree-extras.cc (linear_constraints_ok): New function. (linear_constraints_ok): Ditto. (npsol): Use them to avoid creating inconsistent sets of constraints and crashing. It would really be nice to have exception handling. * symtab.cc (load): Issue error mesasges if attempt to find name keyword fails. * Version 0.43. * tree-extras.cc (npsol): Use new minimize (phi, inform). Handle nargout == 3. * g-builtins.cc (builtin_npsol): Allow nargout == 3. * NPSOL.cc (set_default_options): New function. (all constructors): Use it. (operator =): Use it and print warning message (setting default options doesn't represent a true copy and it would be somewhat difficult to fix this...). * npchkd.f (npchkd): Only write message if msglvl > 0. Sun Nov 1 00:58:16 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * gnuplot-build/Makefile.in (LIBDIRS): Set correctly. (notgnuplot): Use it. * libcruft/misc/gen-d1mach.c: Generate d1mach.f at build time instead of depending on the installer to get it right. * libcruft/Makefile.in (gen-d1mach): New target. * libcruft/Makerules.in (SPECIAL): New macro. (DISTFILES): Include it. * libcruft/Makerules.in (SPECIAL_DEPEND): Ditto. (../../libcruft.a): Use it. Mon Oct 26 02:25:11 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (is_valid_function): Try harder to find M-files that may not have been parsed yet. * symtab.cc (define (symbol_record*)): New function. Make it simple to copy all fields of a symbol_record if we already have one. * utils.cc (force_global): Use it. * utils.cc (valid_identifier): Allow underscores in names. * tree-extras.cc (npsol): Force column vector to be returned. (fsolve): Ditto. * Version 0.42. * tree-extras.cc (fsolve): New function for solving nonlinear algebraic equations. This needs much more work if it is to provide all the functionality of Matlab's fsolve. * tree-extras.cc (fsolve_user_function): New function. * libcruft/minpack: Import needed functions. * tree-extras.cc: (npsol (tree_constant*, int, int): Completely rewrite to handle all of the follwing: 1. npsol (x, phi) 2. npsol (x, phi, lb, ub) 3. npsol (x, phi, lb, ub, llb, c, lub) 4. npsol (x, phi, lb, ub, llb, c, lub, nllb, g, nlub) 5. npsol (x, phi, lb, ub, nllb, g, nlub) 6. npsol (x, phi, llb, c, lub, nllb, g, nlub) 7. npsol (x, phi, llb, c, lub) 8. npsol (x, phi, nllb, g, nlub) * tree-extras.cc (npsol_constraint_function): New function. * tree-extras.cc (tree_constant_to_vector): New function. (tree_constant_to_matrix): Ditto. (takes_correct_nargs): Ditto. Fri Oct 23 10:19:51 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (is_valid_function): New function. (npsol): Use it. * utils.cc (s_plural): New function. (es_plural): Ditto. * tree-extras.cc (npsol): Improve checks for valid objective function. * tree.cc (tree_function::max_expected_args): New function. Thu Oct 22 18:42:07 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_lsode): Quick check of arguments, then call lsode (tree_constant *, int, int). * Move rest of code for implementing builtin_lsode to tree-extras.cc. * g-builtins.cc (builtin_npsol: Quick check of arguments, then call npsol (tree_constant *, int, int). * Move rest of code for implementing builtin_npsol to tree-extras.cc. * tree-const.cc: Simplify functions that require numeric arguments by always calling make_numeric for them instead of doing it conditionally. * tree.cc: Ditto. * tree-extras.cc: Ditto. * tree-const.h (tree_constant::make_numeric): Return *this if already a numeric type. * NLP.cc: In constructors, don't try to assign NULL to bounds objects. * tree-const.cc (tree_constant_rep::valid_as_scalar_index (void)): New function. * tree-const.cc (valid_scalar_indices (tree_constant*, int): New function. * tree-const.cc (tree_constant_rep::do_scalar_index): Simplify by using functions to determine if arguments are valid as indices. (tree_constant_rep::do_scalar_assignment): Likewise. Wed Oct 21 14:11:58 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-extras.cc (determinant): Make it work again. * tree.cc (tree_identifier::eval (tree_constant*, int, int, int): Simplify logic. Only have one ans->eval() call. * tree-const.cc (tree_constant_rep::eval (tree_constant*, int, int, int): Properly handle indexing of range constants. * tree-const.cc (stupid_fortran_style_matrix_index): Preserve row or column orientation for vectors. * toeplitz.m: New M-file. * invhilb.m: Ditto. * hankel.m: Ditto. * tree-extras.cc (max): Handle two arg case. tree-extras.cc (max): Likewise. (min (Matrix&, Matrix&): New function. (max (Matrix&, Matrix&): Ditto. Tue Oct 20 15:13:57 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.41. Mon Oct 19 16:46:35 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * rows.m: New M-file. * g-builtins.cc (builtin_rows): Delete function. * g-builtins.h (builtin_rows): Delete declaration. * builtins.cc (general_functions): Delete from initialization list. * columns.m: New M-file. * g-builtins.cc (builtin_columns): Delete function. * g-builtins.h (builtin_columns): Delete declaration. * builtins.cc (general_functions): Delete from initialization list. * length.m: New M-file. * g-builtins.cc (builtin_length): Delete function. * g-builtins.h (builtin_length): Delete declaration. * builtins.cc (general_functions): Delete from initialization list. * g-builtins.cc (builtin_size): If two values are expected to be returned, put nr and nc in separate registers. Sun Oct 18 13:37:17 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree-base.h: Extract base tree class declarations from tree.h. * tree-const.cc, tree-const.h: Extract tree_constant class from from tree.cc, tree.h. Change all uses of tree.h to use either or both of tree-base.h and tree-const.h. * Matrix.cc (solve): Replaces LinEqn class. tree.cc (do_binary_op) Use it. * g-builtins.cc (builtin_max): New function. tree.cc (tree_constant::max): New friend. * g-builtins.cc (builtin_min): New function. tree.cc (tree_constant::min): New friend. * cond.m: New M-file. * rank.m: New M-file. * g-builtins.cc (builtin_svd): New function. tree.cc (tree_constant::svd): New friend function. * g-builtins.cc (builtin_svd): New function. tree.cc (tree_constant::svd): New friend function. * t-builtins.cc (builtin_format): New function. Implement some of the Matlab options (sort of). * Major changes to liboctave source. A new Matrix.cc/Matrix.h completely replaces the old Matrix/Vec/AVec code. All other classes that use Matrix/Vector objects have been updated (or deleted, if they are no longer needed). All callers changed in octave sources. Sun Oct 11 21:22:16 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_function::eval): Don't define more function parameters than are expected. If fewer arguments than expected are actually supplied, force them to be undefined. * parse.y (fact): Give warning and abort for identifiers followed by '['. This should catch most improper uses of [] instead of () for indexing operators. * tree.cc (do_binary_op (Matrix&, Matrix&, tree::expression_type): Handle element by element exponentiation. Tue Sep 22 10:09:06 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.40. Mon Sep 21 13:09:06 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l: Accept ** and .** as well as ^ and .^ as exponentiation operators. Fri Sep 18 15:19:51 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.h tree.cc utils.cc g-builtins.cc: Elimitate need for overloaded operator-> in the tree_constant class. Also eliminate uses of ->string, ->scalar, etc. Instead, always call .string_value(), .double_value(), etc. * builtins.cc (install_builtins): Reserve `ans' as an uninitialized global variable (should it really be global?). * parse.y (ans_expression): Handle default assignemnt to builtin variable ans. (command): Use it. Tue Sep 15 14:06:12 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.39. * tree.cc (tree_identifier::bump_value): Don't try to increment undefined symbols or values. (tree_prefix_expression::eval): Don't call bump_value if id is a NULL_TREE. (tree_prefix_expression::eval): Likewise. * g-builtins.cc (lsode_builtin): Handle extra arguments. liboctave/ODE.cc (integ): Add template for handling bad returns from lsode. * tree.cc (class tree_return_command): Implementation is just like break and continue. Something seems wrong about this... lex.l (return): Recognize return statement. parse.y (statement): Handle function returns. tree.cc (various eval functions): Check to see if we are returning from a function. * tree.cc (tree_for_command::eval): Set abort_on_undefined when evaluating the loop body. (tree_while_command::eval): Ditto. * tree.cc (class tree_idenfier): Improve searching/parsing M-files when handling undefined names. tree.cc (tree_identifier::parse_m_file (char*)): New function. (tree_identifier::parse_m_file (void)): Use it. * utils.cc (force_global): New function. * symtab.cc (symbol_table::remove_name(char *)): New function. * tree.h, tree.cc (class tree_constant): Split into two classes, tree_constant (handle) and tree_constant_rep (body) to enable use of `smart pointers' and reference counted memory management. (Lots of things are different with this change.) Sat Aug 22 11:58:27 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.38. * lex.l (COMMA_KLUDGE): Delete production, all uses. This doesn't seem to be necessary anymore, and the mystery output lines disappear without it. * builtins.cc (make_eternal (char *)): New function. (install_builtins): Make LOADPATH, eps, pi, Inf, and NaN eternal. * New M-files: mean.m, std.m, hadamard.m, vander.m, hilb.m, linspace.m, logspace.m. * tree.cc (tree_function::eval): Don't check number of arguments supplied against total number possible (previously thought to be `expected') so that user-defined functions can have variable numbers of arguments. * tree.cc (tree_identifier::eval_undefined_error): New function. (tree_identifier::eval): Use it. * octave.cc (abort_on_undefined): New global symbol to control whether we should jump to top level after an undefined symbol has been encountered. tree.cc (tree_function::eval) Set it before evaluating function body, restore to previous value after successful completion. tree.cc (tree_identifier::eval_undefined_error): Use it Fri Aug 20 09:31:14 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc: New mapper functions: isnan: Uses xisnan, which calls IEEE function isnan. isinf: Uses xisinf which calls IEEE functions finite and isnan, or isinf if available. finite: Uses xfinite, which calls IEEE function finite. abs: Uses fabs. * g-builtins.cc (sumsq): New function. (diag): New function. * tree.cc (tree_constant::sumsq): New function (tree_constant::diag): New function * Matrix.cc (sumsq): New function. (diag): Ditto. Thu Aug 20 00:36:44 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_error): New function. * gnuplot-build/Makefile.in (dist): Actually create `term' subdirectory. * Lots of changes to tree.cc tree_assignment_expression::eval and tree_index_expression::eval to make matrix indexing work like Matlab. (do_fortran_indexing): New user-level variable to control this behavior. If this variable is false, things like a([1,2;3,4], [1,2;3,4]) = b become syntax errors. Otherwise, Matlab braindamage prevails. Tue Aug 18 13:15:46 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.37. * tree.cc (do_matrix_assignment): Conditionally allow single indices for Matrix assignments. (do_matrix_index): Ditto. * utils.cc (do_fortran_indexing): New function. utils.h: Declare it. builtins.cc (install_builtins): Default value for new do_fortran_indexing variable. * builtins.cc (install_builtins): Bind eps to the value DBL_EPSILON from float.h. Make it read only (will this cause trouble)? * Bind Inf to 1/0 (will only work for IEEE machines. * Bind NaN to 0/0 (will only work for IEEE machines. * Add round, fix, floor, ceil, and sign to builtin mapper functions. (round): New function. (fix): Ditto. (signum): Ditto. * Add clc (clear screen function). * Add home (clear screen function). To be just like Matlab, this wouldn't clear the screen. * New M-files: fliplr.m, flipud.m, trace.m, reshape.m. * utils.cc (bind_variable): Revise bind_string_variable so that it takes a tree_constant as an argument. (bind_protected_variable): Likewise for the function bind_protected_string_variable. (bind_string_variable): Delete. (bind_protected_string_variable): Ditto. utils.h: Fix declarations. builtins.cc t-builtins.cc: Fix callers. * builtins.cc (install_builtins): Bind LOADPATH here. octave.cc (initialize_globals): Not here. * Makefile.in (SOURCES): Add new scripts directory. (scripts): New target. libcruft/Makefile.in (install): Don't depend on all. * utils.cc (m_file_in_path): Get path from LOADPATH variable. tree.cc (tree_identifier::parse_m_file): Modify caller. * src/Makefile.in (OCTAVE_M_FILE_DIR): New variable. (utils.o): Use it. utils.cc (default_path): Use it. * utils.cc (pathstring_to_vector): New function. (default_path): Return colon separated path instead of vector of paths. * octave.cc (initialize_globals): Use pathstring_to_vector here. Bind output of default_path to LOADPATH variable. Eliminate octave_path global variable. * tree.cc (isstr): New function. (all): Ditto. (any): Ditto. (cumprod): Ditto. (cumsum): Ditto. (prod): Ditto. (sum): Ditto. * g-builtins.cc (builtin_isstr): New function. (builtin_all): Ditto. (builtin_any): Ditto. (builtin_cumprod): Ditto. (builtin_cumsum): Ditto. (builtin_prod): Ditto. (builtin_sum): Ditto. * Matrix.cc (all): New function. (any): Ditto. (cumprod): Ditto. (cumsum): Ditto. (prod): Ditto. (sum): Ditto. * scripts: New directory. scripts/strcmp.m: New file (first M-file function in distribution!). scripts/Makefile.in: New file. configure.in: Include scripts/Makefile in list of files to create. Sat Aug 15 18:32:24 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.36. Fri Aug 14 08:44:10 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (id_to_define): New global variable. (curr_m_file_name): Ditto. (current_infile): Ditto. * tree.h tree.cc (tree_identifier::parse_m_file): New function. (tree_identifier::eval): Handle M-files. * tree.h (stash_m_file_name): New virtual function. (stash_m_file_time): Ditto. (time_parsed): Ditto. (m_file_name): Ditto. * tree.h tree.cc (tree_function::stash_m_file_name) New function. (tree_function::stash_m_file_time): Ditto. (tree_function::time_parsed): Ditto. (tree_function::m_file_name): Ditto. * lex.l (reading_m_file): New global variable. (delete_buffer): New function. (yywrap): New function. Always return 0 (is this a smart thing to do?). * parse.y (func_def2): Handle input from m-files (sort of). * octave.cc (octave_path): New global variable. (using_readline): Ditto. (no_line_editing): Ditto. * octave.cc (main): Initialize current_command_number before calling setjmp. * Increment it in main command loop, not in parse.y. * utils.h utils.cc (default_path): New function. (m_file_in_path): Ditto. (is_newer): Ditto. * octave.cc (main): Execute commands here. * parse.y (input): Not here. * octave.cc (tree *global_command): New global variable that points to the current command to be executed. Thu Aug 13 07:08:11 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y: Make word_list_cmd a fact, not a command, so that things like `y = who -all' can work. You can't do that in Matlab. * t-builtins.cc (builtin_who): Print symbols in columns, sorted. (list_in_columns) New function, mostly stolen from GNU ls. * symtab.h symtab.cc (char **list (void)) New function. (char **sorted_list (void) New function. * tree.cc (various eval functions): Handle printing results of text and general functions here. Straighten out other printing stuff, maybe... * t-builtins.h t-builtins.cc: Make text functions return tree_constant* instead of int, delete print flag argument. * g-builtins.h g-builtins.cc: Delete print flag argument. * Version 0.35. Wed Aug 12 15:12:23 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_builtin::eval): Call mapper function with print = 0 to avoid getting two answers. (specific do_matrix_assignment functions): Handle resizing correctly for `:' indices. (tree_colon_expression::eval): Don't crash if the evaluation of an operand yields a NULL_TREE_CONST. Mon Aug 10 07:31:37 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_identifier::define): Return NULL_TREE_CONST if symbol_record::define fails. (tree_identifier::assign): Likewise. * symtab.h (symbol_lifetime): New attribute for symbol_records. Can be either temporary or eternal. (symbol_class): Delete eternal attribute. * builtins.cc (install_builtins): Mark all builtins as eternal. * Version 0.34. * tree.h: Delete ttype, enum list of tree types. * g-builtins.h g-builtins.cc (builtin_colloc): New function. * liboctave (various): Add missing return values, etc. so that liboctave compiles cleanly. * tree.h tree.cc (tree_multi_assignment): New class to implement assignments to more than one variable. Does it work? Maybe... * tree.h (tree_constant **eval (int, int)): New virtual function. (is_identifier): Another one. * symtab.h (eternal): New class for symbol_records. * symtab.h symtab.cc (make_eternal): New function. * builtins.cc (install_builtins): Make builtin variables eternal. * tree.cc (list_to_vector): Surround by `#if 0/#endif' to avoid compilation warning. Sun Aug 9 03:18:38 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * t-builtins.h t-builtins.cc (builtin_cd): New function adapted from bash for changing the current working directory. (builtin_pwd): New function adapted from bash for printing the current working directory. * utils.h utils.cc: New functions from bash for changing and printing the current working directory: pathname_backup make_absolute get_working_directory change_to_directory * utils.h utils.cc (bind_string_variable): New function. (bind_protected_string_variable): Likewise. * octave.cc (initialze_globals): New function. * utils.h utils.cc: New functions from bash, mostly for fancy prompting: polite_directory_format absolute_pathname absolute_program base_pathname read_octal sub_append_string decode_prompt_string Thu Aug 6 02:39:31 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * octave.cc (initialize_history): Fix up to (octave_hist_file) New global variable. (octave_hist_size) Ditto. (history_lines_this_session) Ditto. (history_lines_in_file) Ditto. * input.cc (octave_gets): Keep track of number of lines read during the current session. * utils.cc (default_history_file): New function. Look for OCTAVE_HISTFILE environment variable and use its value if possible. (default_history_size): New function. Look for OCTAVE_HISTSIZE environment variable and use its value if possible. * t-builtins.cc (builtin_history): Steal from bash and modify to work with octave. * g-builtins.cc (builtin_det): New function. * tree.h tree.cc (determinant): New function * g-builtins.cc: Rewrite functions that use fill_matrix, inverse, and identity_matrix to use new versions implemented as friends of tree_constant. This is being done in an attempt to get rid of all calls to tree_constant::const_type() outside of tree.cc. * tree.cc (tree_constant): Implement new functions for filling and inverting tree constants as matrices, and for creating an identity matrix from a tree_constant. * g-builtins.cc (builtin_inv): New function. builtins.cc: Allow builtin_inv to be called as either inv(A) or inverse(A). * tree.cc (do_binary_op (Matrix, Matrix)): Better handling of solution of linear equations for square coefficient matrices. * LinEqn.cc (solve): Don't exit on singular matrices. Implement new variations of these functions that will allow status checking. * src/Makefile.in: Define GNUPLOT_BINARY and SITE_DEFAULTS. Specific rules for octave.o and builtins.o to avoid defining GNUPLOT_BINARY and SITE_DEFAULTS for all .cc targets. * builtins.cc: Use macro GNUPLOT_BINARY. * octave.cc (execute_startup_files): Use macro SITE_DEFAULTS. Execute commands from SITE_DEFAULTS file. * t-buitlins.cc (builtin_pause): Make it work. * configure.in: Check for termio.h and/or sgtty.h. * octave.cc (clean_up): Reset terminal state to cooked mode. (main) Likewise, after return from SIGINT signal handler. * utils.h utils.cc (raw_mode): New function (mostly stolen from less(1)) toggle input processing for stdin to raw/cooked modes. (kbhit): New function to read one character from cin in raw mode without echoing it. * builtins.cc: Fix expected number of arguments in lists of builtins. * tree.h tree.cc (max_args_expected (void)): New virtual function. (tree_builtins::) Provide a definition of it. * lex.l (identifier): Before gobbling up text function arguments, check to see that we expect some. * symtab.h symtab.cc (max_args_expected): Return max args expected by a symbol (currently only valid for tree_builtins). Wed Aug 5 05:03:59 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * utils.h utils.cc (resize_on_range_error): Decide what to return based on value of global variable of same name. (prefer_column_vectors): Likewise. * Version 0.33. * parse.y (func_def2): Call define (tree *, symbol_type), not define (tree *), so that the symbol type is set for user-defined functions. (assignment): Catch assignments to functions here. * tree.h tree.cc (tree_identifier::define (tree *, symbol_type): New function (be careful out there...). * symtab.h (symbol_type): Add new `user_function' enum value. * tree.cc (do_matrix_assignment): Call prefer_column_vectors(). * tree.h tree.cc (do_matrix_assignment (...)): New functions to implement assignment to indexed matrices. (do_scalar_assignment (...)): New function to implement assignment to an indexed scalar. * utils.h utils.cc (resize_on_range_error): New function. Should eventually decide what to return based on value of global variable of same name. (prefer_column_vectors): New function. Tue Aug 4 05:37:47 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_constant::save): New function. (tree_constant::load): New function. * symtab.cc (symbol_record::save): New function. (symbol_table::load): New function. * t-builtins.cc (builtin_load): Start implementation. Yikes, this is probably going to need a lot of work to be very robust... * t-builtins.cc (builtin_save): Implement by asking the symbol_record to save itself. Maybe this should really be done by asking the symbol table to save a symbol... * utils.cc (extract_keyword): New function. (valid_identifier): New function. Fri Jul 31 04:16:24 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * parse.y (func_def3): Extra error cases for empty function bodies. (func_def1, func_def1a, func_def1b): Slighly straighten out some truly twisted logic, eliminate func_def1a, rename func_def1b to func_def1a, and make statementss like function [x,y] = foo() end work properly (I think). (func_def*): Put function name in global symbol table, not top level symbold table. This makes them accessible from other functions, eh? * t-builtins.cc (builtin_who): Accept -all, -local, -global, and -top flags. Thu Jul 30 00:39:40 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * lex.l (current_buffer): New function to return current flex input buffer. Will need this to be able to switch file contexts. * Version 0.32. * lex.l (create_buffer, switch_to_buffer): New functions to handle input from various streams. This should be enough to allow us to implement Matlab-like M-files. octave.cc (main, execute_startup_files): Use them. * octave.cc (execute_startup_files): Execute commands from $HOME/.octaverc and ./.octaverc. * g-builtins.cc (builtin_plot): Delete temporary files. Ignore SIGINT while gnuplot is executing. Wed Jul 29 20:16:25 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (all_args_defined): New function to check a tree_constant** vector to see if all elements are non-null. (tree_index_expression::eval (int)): Use it, and abort the evaluation if test fails. * terminals.h, terminals.cc: New files for doing things with gnuplot graphics terminal names. src/Makefile.in: Handle new files. Tue Jul 28 00:25:24 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * g-builtins.cc (builtin_plot): Make it work, at least halfway. * g-builtins.cc (builtin_save): New function. * gnuplot-build/Makefile.in: Add -DREADLINE and remove readline.o from list of objects to actually enable the GNU command line editing. * configure.in: Use AC_PROG_CHECK macro to search for f2c and f77. Check for several common Un*x Fortran compilers. Add extra messages. * g-builtins.cc g-builtins.h: New files for builtin general functions extracted from builtins.cc. * t-builtins.cc t-builtins.h: New files for builtin text functions extracted from builtins.cc. * Makefile.in (split-dist): New target. * Version 0.31. Mon Jul 27 22:01:58 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_constant::do_matrix_index (tree_constant **, int): Allow single argument to work for matrices that are really row or column vectors. * lex.l: Accept `<>' in addition to `!=' and `~=' as `not equal' comparison operators. * libcruft/Makerules: Allow for compiling the Fortran routines with the native Fortran compiler instead of translating to C. * f2c-compat.sh, flibs.sh: New scripts which try to determine whether it will be possible for us to use the system's Fortran compiler directly, and if so, what libraries to add to the loader command. These scripts are known to work on SPARCstations running SunOS and DECstations running Ultrix. Not tested elsewhere... * configure.in: Use them. * Makefile.in: Distribute them. Wed Jul 22 00:04:48 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * builtins.cc: Begin implementation of NLP solver using NPSOL. Tue Jul 21 13:44:13 1992 John W. Eaton (jwe@june.che.utexas.edu) * octave.cc: If printing version information, also print pointer to warranty info. * builtins.cc: Implement the Matlab functions ones, zeros, eye, clock, date, size, length, and global. Implement warranty builtin. (builtin_clear): Fix to work with global variables. * symtab.cc (clear): Fix to work properly with global variables. Mon Jul 20 11:58:23 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc (tree_constant::do_matrix_index (tree_constant**, int)): Make string indices work. (tree_constant::force_numeric): Don't special case single-character strings (this uncovers a flaw in the design of the constructor for the magic colon operator...). Fri Jul 17 16:33:00 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.30. * tree.cc: Delete undefined identifiers when trying to eval them. * builtins.cc: Add beginnings of builtin who and clear functions. * symtab.cc symtab.h (clear): New function. * tree.cc, tree.h, parse.y: Implement matrix indexing with colon expressions, implement the magic colon operator for column and row selection. * tree.cc tree.h: Completely rework colon expressions. Thu Jul 16 09:27:48 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * gnuplot-dist: Rename from gnuplot-3.2 so we're not tied to a version number. Tue Jul 14 11:22:35 1992 John W. Eaton (jwe@ward.che.utexas.edu) * tree.cc builtins.cc: Make argc/nargs/nargin work like C: the argument count is the number of command line arguments plus the function name. This goes for `argument lists' for matrices as well as functions. It seems a bit awkward but at it's consistent, and it's like C. Hmm. Maybe this is a bad choice... * utils.cc utils.h: New files for utility functions. Mon Jul 13 00:29:50 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.29. * tree.cc tree_constant::tree_constant (matrix): Automatically convert 1x1 matrices to scalars. * parse.y lex.l: Fix up a bunch of stupid stuff and reduce the number of shift/reduce conflicts to 16 (all but one because of the optional separator garbage). * parse.y lex.l: Allow for assignments to lists of identifiers to be partially parsed. This will still require some error checking in tree.cc to ensure that the list is made up of identifiers only, since that's not enforced by the grammar (I don't see a way to do it, do you?) Sun Jul 12 11:24:33 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * tree.cc tree.h parse.y lex.l: Implement logical AND (symbol &), OR (symbol |), and not (symbol ~). Also provide the C-style operators &&, ||, and !). * Matrix.cc Matrix.h: Provide stupid element-wise logical operators for matrices. * Version 0.28. * parse.y lex.l tree.cc tree.h: Implement C-style prefix and postfix increment and decrement operators (symbols ++ and -- respectively). * parse.y lex.l tree.cc tree.h: Implement break and continue. * tree.cc tree.h: Assignment to matrix elements roughed out. * gnuplot/tree.cc: Solution of linear equations via the lift division operator partially implemented. Singular coefficient matrices aren't handled very well yet... * gnuplot-build/Makefile.in: Make this work to build gnuplot for generic X11/unix environments. * Remove -Wall from CFLAGS to avoid loads of warnings. * Use GNU readline instead of the one that comes with gnuplot. * gnuplot-build/*.diff: Various patches for various things. Sat Jul 11 10:14:12 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.26 * src/Makefile.in: Distribute lex.cc, parse.cc, y.tab.h. * src/Makefile.in (dist): Depend on lex.cc and parse.cc. * gnuplot-build: New directory for patching and building gnuplot. This is apparenty required because the gnuplot license won't allow distrubution of modified versions, but will allow patches to be distributed. * gnuplot-build/Makefile.in: New file. * gnuplot-3.2: New directory. * readline: New directory from the bash-1.12 distribution, plus tilde.c from bash's lib/glob directory and xmalloc.c from bash's lib/malloc directory. * readline/Makefile.in, readline/doc/Makefile.in, readline/examples/Makefile.in: New files. * All Makefie.in files: Allow make to work from any directory, not just the top level one. Fri Jul 10 22:20:56 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * SERVICE: Remove, since it seems too specific to GNU products. Thu Jul 9 07:48:33 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.20. * Solution of ODEs with LSODE partially implemented. It's possible to solve some simple equations. * tree.cc tree.h (tree_constant): Add string constants and make them work more or less like string constants in Matlab (implicit conversion to ASCII numbers -- gag. This isn't complete, and it it assumes that ASCII is the character set for the host machine/compiler...). Tue Jul 7 07:28:35 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.19. * User defined function definitions and calls to them mostly work. Still need to implement multiple return values correctly. Mon Jul 6 04:23:37 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.18. * lex.l parse.y tree.cc tree.h: Begin implementation of user-defined functions. Sun Jul 5 19:27:08 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.17. * lex.l: Replace SAVE_STRING macro with a function. * builtins.cc (builtin_document): New builtin function. (builtin_help): Make it work. * lex.l: More rules for gathering text. These are still not quite as they should be, but they will work in most cases. I think the flex generated scanner is either going to have to be reworked or replaced with a handemade version at some point (probably soon)... * tree.cc tree.h: Add tree_word_list and tree_word_list_command classes for text functions. Fri Jul 3 05:13:15 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.16. * builtins.h builtins.cc: New files for builtin functions. Implement a few simple builtin functions. * tree.cc tree.h: Add tree_builtin type for builtin functions. * tree.cc tree.h: eval (args...) New virtual function. Thu Jul 2 01:27:38 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.15. * symtab.h, symtab.cc: Allow variables and functions to be tagged as read-only or read-write. Wed Jul 1 15:54:36 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * input.cc and octave.cc: allow input to come from a file. * lex.l: to accept `#' as a comment character (allows one to use the `#!/bin/octave' style script hack). * doc: New directory containing skeleton stuff * SERVICE: New file from GCC. * BUGS: New file, now produced from doc/bugs.texi. * INSTALL: New file, now produced from doc/install.texi. Sat Jun 27 15:52:37 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.14. * Fixed parser to eliminate reduce/reduce conflicts. * Fixed parser to recognize assignment to multiple identifiers (e.g., [E,V] = eig (A); ). * Quickie implementation of indexed array evaluation. Works for scalar indices, but not range/array indices. Fri Jun 26 04:23:12 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.12. * Hooks added for indexed array evaluation and assignment. * Colon expression implementation improved. * Implementation of for command eval() improved. Thu Jun 25 00:28:12 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.11. * Colon expressions added. * For command added, but the implementation needs work. Wed Jun 24 15:09:36 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.10. * Cheesy signal handler added to catch interrupts. * Matrix input works, even for nested matrices. Some error checking is done while the matrix is evaluated to ensure that the number of rows and columns match up. Mon Jun 22 00:21:49 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.9. * Command line matrix input partially implemented. It's not yet possible to enter nested matrices, but it is possible to enter simple matrices (e.g. [1,2;a,b+c], where a, b, and c are scalars. * Version 0.8. * If commands added. * Version 0.7. * Command chains added. * Boolean operations added, tested for scalars. * While loop added, tested for simple commands. Fri Jun 19 05:50:44 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.6. At this early stage, while a lot of changes are being made very quickly, ChangeLog entries will probably just list features added. * Variable assignment works for scalars. * Simple scalar expressions work. Thu Jun 18 06:44:24 1992 John W. Eaton (jwe@schoch.che.utexas.edu) * Version 0.5. * src/version.h: For all the pre-alpha distributions, count versions as 0.1, etc. instead of 0.01. * Makefile: (dist) Automatically update version_string in src/version.h. * symtab.h, symbtab.cc: New files for symbol tables. * tree.h, tree.cc: New files for parse trees. * Lots of work unrecorded here. Octave is now self-contained, the tree routines are being redesigned, etc. Fri Mar 20 17:03:16 1992 John W. Eaton (jwe@andy.che.utexas.edu) * Version 0.02. Octave understands some simple matrix expressions, but it is not yet possible for matrix elements to be constructed from expressions. Thu Mar 19 06:13:39 1992 John W. Eaton (jwe@andy.che.utexas.edu) * Version 0.01. Octave understands simple scalar expressions. Hey, Hey! It is not yet self contained -- I'm still linking to the old libraries in /usr/local/c++-classes, and this isn't likely to change for a while. (Other things are much more important than making the distribution work on other machines. Sorry...) Fri Feb 21 05:06:38 1992 John W. Eaton (jwe@andy.che.utexas.edu) * Version 0.00. This includes the basic directory structure, makefiles, and a lot of the old Fortran source, including a way to make a libcruft.a. Octave compiles and accepts input (with history and editing) but doesn't do much else. Wed Feb 19 06:20:44 1992 John W. Eaton (jwe@andy.che.utexas.edu) * ChangeLog: New file. octave-1.1.0/bsd-math/ 40777 415 17 0 5646372613 12555 5ustar jweusersoctave-1.1.0/bsd-math/cdefs.h100666 415 17 6002 5341367706 14104 0ustar jweusers/* * Copyright (c) 1991 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)cdefs.h 7.6 (Berkeley) 5/4/91 */ #ifndef _CDEFS_H_ #define _CDEFS_H_ #if defined(__cplusplus) #define __BEGIN_DECLS extern "C" { #define __END_DECLS }; #else #define __BEGIN_DECLS #define __END_DECLS #endif /* * The __CONCAT macro is used to concatenate parts of symbol names, e.g. * with "#define OLD(foo) __CONCAT(old,foo)", OLD(foo) produces oldfoo. * The __CONCAT macro is a bit tricky -- make sure you don't put spaces * in between its arguments. __CONCAT can also concatenate double-quoted * strings produced by the __STRING macro, but this only works with ANSI C. */ #if defined(__STDC__) || defined(__cplusplus) #define __P(protos) protos /* full-blown ANSI C */ #define __CONCAT(x,y) x ## y #define __STRING(x) #x #else /* !(__STDC__ || __cplusplus) */ #define __P(protos) () /* traditional C preprocessor */ #define __CONCAT(x,y) x/**/y #define __STRING(x) "x" #ifdef __GNUC__ #define const __const /* GCC: ANSI C with -traditional */ #define inline __inline #define signed __signed #define volatile __volatile #else /* !__GNUC__ */ #define const /* delete ANSI C keywords */ #define inline #define signed #define volatile #endif /* !__GNUC__ */ #endif /* !(__STDC__ || __cplusplus) */ #endif /* !_CDEFS_H_ */ octave-1.1.0/bsd-math/asinh.c100666 415 17 7537 5344460243 14124 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)asinh.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* ASINH(X) * RETURN THE INVERSE HYPERBOLIC SINE OF X * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 2/16/85; * REVISED BY K.C. NG on 3/7/85, 3/24/85, 4/16/85. * * Required system supported functions : * copysign(x,y) * sqrt(x) * * Required kernel function: * log1p(x) ...return log(1+x) * * Method : * Based on * asinh(x) = sign(x) * log [ |x| + sqrt(x*x+1) ] * we have * asinh(x) := x if 1+x*x=1, * := sign(x)*(log1p(x)+ln2)) if sqrt(1+x*x)=x, else * := sign(x)*log1p(|x| + |x|/(1/|x| + sqrt(1+(1/|x|)^2)) ) * * Accuracy: * asinh(x) returns the exact inverse hyperbolic sine of x nearly rounded. * In a test run with 52,000 random arguments on a VAX, the maximum * observed error was 1.58 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10, -33, 1.A39EF35793C76) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #endif extern double log1p(), copysign(); double asinh(x) double x; { double t,s; static const double small=1.0E-10, /* fl(1+small*small) == 1 */ big =1.0E20, /* fl(1+big) == big */ one =1.0 ; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if((t=copysign(x,one))>small) if(t big */ {s=log1p(t)+ln2lo; return(copysign(s+ln2hi,x));} else /* if |x| < small */ return(x); } octave-1.1.0/bsd-math/acosh.c100666 415 17 7432 5344456543 14121 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)acosh.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* ACOSH(X) * RETURN THE INVERSE HYPERBOLIC COSINE OF X * DOUBLE PRECISION (VAX D FORMAT 56 BITS, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 2/16/85; * REVISED BY K.C. NG on 3/6/85, 3/24/85, 4/16/85, 8/17/85. * * Required system supported functions : * sqrt(x) * * Required kernel function: * log1p(x) ...return log(1+x) * * Method : * Based on * acosh(x) = log [ x + sqrt(x*x-1) ] * we have * acosh(x) := log1p(x)+ln2, if (x > 1.0E20); else * acosh(x) := log1p( sqrt(x-1) * (sqrt(x-1) + sqrt(x+1)) ) . * These formulae avoid the over/underflow complication. * * Special cases: * acosh(x) is NaN with signal if x<1. * acosh(NaN) is NaN without signal. * * Accuracy: * acosh(x) returns the exact inverse hyperbolic cosine of x nearly * rounded. In a test run with 512,000 random arguments on a VAX, the * maximum observed error was 3.30 ulps (units of the last place) at * x=1.0070493753568216 . * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10,-33, 1.A39EF35793C76) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #endif extern double log1p(); double acosh(x) double x; { double t,big=1.E20; /* big+1==big */ #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ /* return log1p(x) + log(2) if x is large */ if(x>big) {t=log1p(x)+ln2lo; return(t+ln2hi);} t=sqrt(x-1.0); return(log1p(t*(t+sqrt(x+1.0)))); } octave-1.1.0/bsd-math/atanh.c100666 415 17 6277 5344460257 14122 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)atanh.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* ATANH(X) * RETURN THE HYPERBOLIC ARC TANGENT OF X * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/8/85; * REVISED BY K.C. NG on 2/7/85, 3/7/85, 8/18/85. * * Required kernel function: * log1p(x) ...return log(1+x) * * Method : * Return * 1 2x x * atanh(x) = --- * log(1 + -------) = 0.5 * log1p(2 * --------) * 2 1 - x 1 - x * * Special cases: * atanh(x) is NaN if |x| > 1 with signal; * atanh(NaN) is that NaN with no signal; * atanh(+-1) is +-INF with signal. * * Accuracy: * atanh(x) returns the exact hyperbolic arc tangent of x nearly rounded. * In a test run with 512,000 random arguments on a VAX, the maximum * observed error was 1.87 ulps (units in the last place) at * x= -3.8962076028810414000e-03. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) #include #endif /* defined(vax)||defined(tahoe) */ extern double log1p(), copysign(); double atanh(x) double x; { double z; z = copysign(0.5,x); x = copysign(x,1.0); #if defined(vax)||defined(tahoe) if (x == 1.0) { return(copysign(1.0,z)*infnan(ERANGE)); /* sign(x)*INF */ } #endif /* defined(vax)||defined(tahoe) */ x = x/(1.0-x); return( z*log1p(x+x) ); } octave-1.1.0/bsd-math/asincos.c100666 415 17 13270 5341366322 14470 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)asincos.c 5.5 (Berkeley) 10/9/90"; #endif /* not lint */ /* ASIN(X) * RETURNS ARC SINE OF X * DOUBLE PRECISION (IEEE DOUBLE 53 bits, VAX D FORMAT 56 bits) * CODED IN C BY K.C. NG, 4/16/85, REVISED ON 6/10/85. * * Required system supported functions: * copysign(x,y) * sqrt(x) * * Required kernel function: * atan2(y,x) * * Method : * asin(x) = atan2(x,sqrt(1-x*x)); for better accuracy, 1-x*x is * computed as follows * 1-x*x if x < 0.5, * 2*(1-|x|)-(1-|x|)*(1-|x|) if x >= 0.5. * * Special cases: * if x is NaN, return x itself; * if |x|>1, return NaN. * * Accuracy: * 1) If atan2() uses machine PI, then * * asin(x) returns (PI/pi) * (the exact arc sine of x) nearly rounded; * and PI is the exact pi rounded to machine precision (see atan2 for * details): * * in decimal: * pi = 3.141592653589793 23846264338327 ..... * 53 bits PI = 3.141592653589793 115997963 ..... , * 56 bits PI = 3.141592653589793 227020265 ..... , * * in hexadecimal: * pi = 3.243F6A8885A308D313198A2E.... * 53 bits PI = 3.243F6A8885A30 = 2 * 1.921FB54442D18 error=.276ulps * 56 bits PI = 3.243F6A8885A308 = 4 * .C90FDAA22168C2 error=.206ulps * * In a test run with more than 200,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 2.06 ulps. (comparing against (PI/pi)*(exact asin(x))); * * 2) If atan2() uses true pi, then * * asin(x) returns the exact asin(x) with error below about 2 ulps. * * In a test run with more than 1,024,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 1.99 ulps. */ double asin(x) double x; { double s,t,copysign(),atan2(),sqrt(),one=1.0; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ s=copysign(x,one); if(s <= 0.5) return(atan2(x,sqrt(one-x*x))); else { t=one-s; s=t+t; return(atan2(x,sqrt(s-t*t))); } } /* ACOS(X) * RETURNS ARC COS OF X * DOUBLE PRECISION (IEEE DOUBLE 53 bits, VAX D FORMAT 56 bits) * CODED IN C BY K.C. NG, 4/16/85, REVISED ON 6/10/85. * * Required system supported functions: * copysign(x,y) * sqrt(x) * * Required kernel function: * atan2(y,x) * * Method : * ________ * / 1 - x * acos(x) = 2*atan2( / -------- , 1 ) . * \/ 1 + x * * Special cases: * if x is NaN, return x itself; * if |x|>1, return NaN. * * Accuracy: * 1) If atan2() uses machine PI, then * * acos(x) returns (PI/pi) * (the exact arc cosine of x) nearly rounded; * and PI is the exact pi rounded to machine precision (see atan2 for * details): * * in decimal: * pi = 3.141592653589793 23846264338327 ..... * 53 bits PI = 3.141592653589793 115997963 ..... , * 56 bits PI = 3.141592653589793 227020265 ..... , * * in hexadecimal: * pi = 3.243F6A8885A308D313198A2E.... * 53 bits PI = 3.243F6A8885A30 = 2 * 1.921FB54442D18 error=.276ulps * 56 bits PI = 3.243F6A8885A308 = 4 * .C90FDAA22168C2 error=.206ulps * * In a test run with more than 200,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 2.07 ulps. (comparing against (PI/pi)*(exact acos(x))); * * 2) If atan2() uses true pi, then * * acos(x) returns the exact acos(x) with error below about 2 ulps. * * In a test run with more than 1,024,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 2.15 ulps. */ double acos(x) double x; { double t,copysign(),atan2(),sqrt(),one=1.0; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); #endif /* !defined(vax)&&!defined(tahoe) */ if( x != -1.0) t=atan2(sqrt((one-x)/(one+x)),one); else t=atan2(one,0.0); /* t = PI/2 */ return(t+t); } octave-1.1.0/bsd-math/exp.c100666 415 17 15342 5341401136 13620 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)exp.c 5.7 (Berkeley) 12/2/92"; #endif /* not lint */ /* EXP(X) * RETURN THE EXPONENTIAL OF X * DOUBLE PRECISION (IEEE 53 bits, VAX D FORMAT 56 BITS) * CODED IN C BY K.C. NG, 1/19/85; * REVISED BY K.C. NG on 2/6/85, 2/15/85, 3/7/85, 3/24/85, 4/16/85, 6/14/86. * * Required system supported functions: * scalb(x,n) * copysign(x,y) * finite(x) * * Method: * 1. Argument Reduction: given the input x, find r and integer k such * that * x = k*ln2 + r, |r| <= 0.5*ln2 . * r will be represented as r := z+c for better accuracy. * * 2. Compute exp(r) by * * exp(r) = 1 + r + r*R1/(2-R1), * where * R1 = x - x^2*(p1+x^2*(p2+x^2*(p3+x^2*(p4+p5*x^2)))). * * 3. exp(x) = 2^k * exp(r) . * * Special cases: * exp(INF) is INF, exp(NaN) is NaN; * exp(-INF)= 0; * for finite argument, only exp(0)=1 is exact. * * Accuracy: * exp(x) returns the exponential of x nearly rounded. In a test run * with 1,156,000 random arguments on a VAX, the maximum observed * error was 0.869 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) vc(lnhuge, 9.4961163736712506989E1 ,ec1d,43bd,9010,a73e, 7, .BDEC1DA73E9010) vc(lntiny,-9.5654310917272452386E1 ,4f01,c3bf,33af,d72e, 7,-.BF4F01D72E33AF) vc(invln2, 1.4426950408889634148E0 ,aa3b,40b8,17f1,295c, 1, .B8AA3B295C17F1) vc(p1, 1.6666666666666602251E-1 ,aaaa,3f2a,a9f1,aaaa, -2, .AAAAAAAAAAA9F1) vc(p2, -2.7777777777015591216E-3 ,0b60,bc36,ec94,b5f5, -8,-.B60B60B5F5EC94) vc(p3, 6.6137563214379341918E-5 ,b355,398a,f15f,792e, -13, .8AB355792EF15F) vc(p4, -1.6533902205465250480E-6 ,ea0e,b6dd,5f84,2e93, -19,-.DDEA0E2E935F84) vc(p5, 4.1381367970572387085E-8 ,bb4b,3431,2683,95f5, -24, .B1BB4B95F52683) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #define lnhuge vccast(lnhuge) #define lntiny vccast(lntiny) #define invln2 vccast(invln2) #define p1 vccast(p1) #define p2 vccast(p2) #define p3 vccast(p3) #define p4 vccast(p4) #define p5 vccast(p5) #endif ic(p1, 1.6666666666666601904E-1, -3, 1.555555555553E) ic(p2, -2.7777777777015593384E-3, -9, -1.6C16C16BEBD93) ic(p3, 6.6137563214379343612E-5, -14, 1.1566AAF25DE2C) ic(p4, -1.6533902205465251539E-6, -20, -1.BBD41C5D26BF1) ic(p5, 4.1381367970572384604E-8, -25, 1.6376972BEA4D0) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10,-33, 1.A39EF35793C76) ic(lnhuge, 7.1602103751842355450E2, 9, 1.6602B15B7ECF2) ic(lntiny,-7.5137154372698068983E2, 9, -1.77AF8EBEAE354) ic(invln2, 1.4426950408889633870E0, 0, 1.71547652B82FE) #ifndef EXP__D_ONLY double exp(x) double x; { double z,hi,lo,c; int k; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if( x <= lnhuge ) { if( x >= lntiny ) { /* argument reduction : x --> x - k*ln2 */ k=invln2*x+copysign(0.5,x); /* k=NINT(x/ln2) */ /* express x-k*ln2 as hi-lo and let x=hi-lo rounded */ hi=x-k*ln2hi; x=hi-(lo=k*ln2lo); /* return 2^k*[1+x+x*c/(2+c)] */ z=x*x; c= x - z*(p1+z*(p2+z*(p3+z*(p4+z*p5)))); return scalb(1.0+(hi-(lo-(x*c)/(2.0-c))),k); } /* end of x > lntiny */ else /* exp(-big#) underflows to zero */ if(finite(x)) return(scalb(1.0,-5000)); /* exp(-INF) is zero */ else return(0.0); } /* end of x < lnhuge */ else /* exp(INF) is INF, exp(+big#) overflows to INF */ return( finite(x) ? scalb(1.0,5000) : x); } #endif /* returns exp(r = x + c) for |c| < |x| with no overlap. */ double exp__D(x, c) double x, c; { double z,hi,lo, t; int k; #if !defined(vax)&&!defined(tahoe) if (x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if ( x <= lnhuge ) { if ( x >= lntiny ) { /* argument reduction : x --> x - k*ln2 */ z = invln2*x; k = z + copysign(.5, x); /* express (x+c)-k*ln2 as hi-lo and let x=hi-lo rounded */ hi=(x-k*ln2hi); /* Exact. */ x= hi - (lo = k*ln2lo-c); /* return 2^k*[1+x+x*c/(2+c)] */ z=x*x; c= x - z*(p1+z*(p2+z*(p3+z*(p4+z*p5)))); c = (x*c)/(2.0-c); return scalb(1.+(hi-(lo - c)), k); } /* end of x > lntiny */ else /* exp(-big#) underflows to zero */ if(finite(x)) return(scalb(1.0,-5000)); /* exp(-INF) is zero */ else return(0.0); } /* end of x < lnhuge */ else /* exp(INF) is INF, exp(+big#) overflows to INF */ return( finite(x) ? scalb(1.0,5000) : x); } octave-1.1.0/bsd-math/log1p.c100666 415 17 13571 5536155040 14056 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)log1p.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* LOG1P(x) * RETURN THE LOGARITHM OF 1+x * DOUBLE PRECISION (VAX D FORMAT 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/19/85; * REVISED BY K.C. NG on 2/6/85, 3/7/85, 3/24/85, 4/16/85. * * Required system supported functions: * scalb(x,n) * copysign(x,y) * logb(x) * finite(x) * * Required kernel function: * log__L(z) * * Method : * 1. Argument Reduction: find k and f such that * 1+x = 2^k * (1+f), * where sqrt(2)/2 < 1+f < sqrt(2) . * * 2. Let s = f/(2+f) ; based on log(1+f) = log(1+s) - log(1-s) * = 2s + 2/3 s**3 + 2/5 s**5 + ....., * log(1+f) is computed by * * log(1+f) = 2s + s*log__L(s*s) * where * log__L(z) = z*(L1 + z*(L2 + z*(... (L6 + z*L7)...))) * * See log__L() for the values of the coefficients. * * 3. Finally, log(1+x) = k*ln2 + log(1+f). * * Remarks 1. In step 3 n*ln2 will be stored in two floating point numbers * n*ln2hi + n*ln2lo, where ln2hi is chosen such that the last * 20 bits (for VAX D format), or the last 21 bits ( for IEEE * double) is 0. This ensures n*ln2hi is exactly representable. * 2. In step 1, f may not be representable. A correction term c * for f is computed. It follows that the correction term for * f - t (the leading term of log(1+f) in step 2) is c-c*x. We * add this correction term to n*ln2lo to attenuate the error. * * * Special cases: * log1p(x) is NaN with signal if x < -1; log1p(NaN) is NaN with no signal; * log1p(INF) is +INF; log1p(-1) is -INF with signal; * only log1p(0)=0 is exact for finite argument. * * Accuracy: * log1p(x) returns the exact log(1+x) nearly rounded. In a test run * with 1,536,000 random arguments on a VAX, the maximum observed * error was .846 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) vc(sqrt2, 1.4142135623730950622E0 ,04f3,40b5,de65,33f9, 1, .B504F333F9DE65) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10, -33, 1.A39EF35793C76) ic(sqrt2, 1.4142135623730951455E0, 0, 1.6A09E667F3BCD) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #define sqrt2 vccast(sqrt2) #endif extern double scalb(), copysign(), logb(), log__L(); extern int finite(); double log1p(x) double x; { static const double zero=0.0, negone= -1.0, one=1.0, half=1.0/2.0, small=1.0E-20; /* 1+small == 1 */ double z,s,t,c; int k; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if(finite(x)) { if( x > negone ) { /* argument reduction */ if(copysign(x,one)= sqrt2 ) { k += 1 ; z *= half; t *= half; } t += negone; x = z + t; c = (t-x)+z ; /* correction term for x */ /* compute log(1+x) */ s = x/(2+x); t = x*x*half; c += (k*ln2lo-c*x); z = c+s*(t+log__L(s*s)); x += (z - t) ; return(k*ln2hi+x); } /* end of if (x > negone) */ else { #if defined(vax)||defined(tahoe) if ( x == negone ) return (infnan(-ERANGE)); /* -INF */ else return (infnan(EDOM)); /* NaN */ #else /* defined(vax)||defined(tahoe) */ /* x = -1, return -INF with signal */ if ( x == negone ) return( negone/zero ); /* negative argument for log, return NaN with signal */ else return ( zero / zero ); #endif /* defined(vax)||defined(tahoe) */ } } /* end of if (finite(x)) */ /* log(-INF) is NaN */ else if(x<0) return(zero/zero); /* log(+INF) is INF */ else return(x); } octave-1.1.0/bsd-math/log.c100666 415 17 34156 5341402401 13605 0ustar jweusers/* * Copyright (c) 1992 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)log.c 5.10 (Berkeley) 1/10/93"; #endif /* not lint */ #include #include #include "mathimpl.h" /* Table-driven natural logarithm. * * This code was derived, with minor modifications, from: * Peter Tang, "Table-Driven Implementation of the * Logarithm in IEEE Floating-Point arithmetic." ACM Trans. * Math Software, vol 16. no 4, pp 378-400, Dec 1990). * * Calculates log(2^m*F*(1+f/F)), |f/j| <= 1/256, * where F = j/128 for j an integer in [0, 128]. * * log(2^m) = log2_hi*m + log2_tail*m * since m is an integer, the dominant term is exact. * m has at most 10 digits (for subnormal numbers), * and log2_hi has 11 trailing zero bits. * * log(F) = logF_hi[j] + logF_lo[j] is in tabular form in log_table.h * logF_hi[] + 512 is exact. * * log(1+f/F) = 2*f/(2*F + f) + 1/12 * (2*f/(2*F + f))**3 + ... * the leading term is calculated to extra precision in two * parts, the larger of which adds exactly to the dominant * m and F terms. * There are two cases: * 1. when m, j are non-zero (m | j), use absolute * precision for the leading term. * 2. when m = j = 0, |1-x| < 1/256, and log(x) ~= (x-1). * In this case, use a relative precision of 24 bits. * (This is done differently in the original paper) * * Special cases: * 0 return signalling -Inf * neg return signalling NaN * +Inf return +Inf */ #if defined(vax) || defined(tahoe) #define _IEEE 0 #define TRUNC(x) x = (double) (float) (x) #else #define _IEEE 1 #define endian (((*(int *) &one)) ? 1 : 0) #define TRUNC(x) *(((int *) &x) + endian) &= 0xf8000000 #define infnan(x) 0.0 #endif #define N 128 /* Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128. * Used for generation of extend precision logarithms. * The constant 35184372088832 is 2^45, so the divide is exact. * It ensures correct reading of logF_head, even for inaccurate * decimal-to-binary conversion routines. (Everybody gets the * right answer for integers less than 2^53.) * Values for log(F) were generated using error < 10^-57 absolute * with the bc -l package. */ double A1 = .08333333333333178827; double A2 = .01250000000377174923; double A3 = .002232139987919447809; double A4 = .0004348877777076145742; double logF_head[N+1] = { 0., .007782140442060381246, .015504186535963526694, .023167059281547608406, .030771658666765233647, .038318864302141264488, .045809536031242714670, .053244514518837604555, .060624621816486978786, .067950661908525944454, .075223421237524235039, .082443669210988446138, .089612158689760690322, .096729626458454731618, .103796793681567578460, .110814366340264314203, .117783035656430001836, .124703478501032805070, .131576357788617315236, .138402322859292326029, .145182009844575077295, .151916042025732167530, .158605030176659056451, .165249572895390883786, .171850256926518341060, .178407657472689606947, .184922338493834104156, .191394852999565046047, .197825743329758552135, .204215541428766300668, .210564769107350002741, .216873938300523150246, .223143551314024080056, .229374101064877322642, .235566071312860003672, .241719936886966024758, .247836163904594286577, .253915209980732470285, .259957524436686071567, .265963548496984003577, .271933715484010463114, .277868451003087102435, .283768173130738432519, .289633292582948342896, .295464212893421063199, .301261330578199704177, .307025035294827830512, .312755710004239517729, .318453731118097493890, .324119468654316733591, .329753286372579168528, .335355541920762334484, .340926586970454081892, .346466767346100823488, .351976423156884266063, .357455888922231679316, .362905493689140712376, .368325561158599157352, .373716409793814818840, .379078352934811846353, .384411698910298582632, .389716751140440464951, .394993808240542421117, .400243164127459749579, .405465108107819105498, .410659924985338875558, .415827895143593195825, .420969294644237379543, .426084395310681429691, .431173464818130014464, .436236766774527495726, .441274560805140936281, .446287102628048160113, .451274644139630254358, .456237433481874177232, .461175715122408291790, .466089729924533457960, .470979715219073113985, .475845904869856894947, .480688529345570714212, .485507815781602403149, .490303988045525329653, .495077266798034543171, .499827869556611403822, .504556010751912253908, .509261901790523552335, .513945751101346104405, .518607764208354637958, .523248143765158602036, .527867089620485785417, .532464798869114019908, .537041465897345915436, .541597282432121573947, .546132437597407260909, .550647117952394182793, .555141507540611200965, .559615787935399566777, .564070138285387656651, .568504735352689749561, .572919753562018740922, .577315365035246941260, .581691739635061821900, .586049045003164792433, .590387446602107957005, .594707107746216934174, .599008189645246602594, .603290851438941899687, .607555250224322662688, .611801541106615331955, .616029877215623855590, .620240409751204424537, .624433288012369303032, .628608659422752680256, .632766669570628437213, .636907462236194987781, .641031179420679109171, .645137961373620782978, .649227946625615004450, .653301272011958644725, .657358072709030238911, .661398482245203922502, .665422632544505177065, .669430653942981734871, .673422675212350441142, .677398823590920073911, .681359224807238206267, .685304003098281100392, .689233281238557538017, .693147180560117703862 }; double logF_tail[N+1] = { 0., -.00000000000000543229938420049, .00000000000000172745674997061, -.00000000000001323017818229233, -.00000000000001154527628289872, -.00000000000000466529469958300, .00000000000005148849572685810, -.00000000000002532168943117445, -.00000000000005213620639136504, -.00000000000001819506003016881, .00000000000006329065958724544, .00000000000008614512936087814, -.00000000000007355770219435028, .00000000000009638067658552277, .00000000000007598636597194141, .00000000000002579999128306990, -.00000000000004654729747598444, -.00000000000007556920687451336, .00000000000010195735223708472, -.00000000000017319034406422306, -.00000000000007718001336828098, .00000000000010980754099855238, -.00000000000002047235780046195, -.00000000000008372091099235912, .00000000000014088127937111135, .00000000000012869017157588257, .00000000000017788850778198106, .00000000000006440856150696891, .00000000000016132822667240822, -.00000000000007540916511956188, -.00000000000000036507188831790, .00000000000009120937249914984, .00000000000018567570959796010, -.00000000000003149265065191483, -.00000000000009309459495196889, .00000000000017914338601329117, -.00000000000001302979717330866, .00000000000023097385217586939, .00000000000023999540484211737, .00000000000015393776174455408, -.00000000000036870428315837678, .00000000000036920375082080089, -.00000000000009383417223663699, .00000000000009433398189512690, .00000000000041481318704258568, -.00000000000003792316480209314, .00000000000008403156304792424, -.00000000000034262934348285429, .00000000000043712191957429145, -.00000000000010475750058776541, -.00000000000011118671389559323, .00000000000037549577257259853, .00000000000013912841212197565, .00000000000010775743037572640, .00000000000029391859187648000, -.00000000000042790509060060774, .00000000000022774076114039555, .00000000000010849569622967912, -.00000000000023073801945705758, .00000000000015761203773969435, .00000000000003345710269544082, -.00000000000041525158063436123, .00000000000032655698896907146, -.00000000000044704265010452446, .00000000000034527647952039772, -.00000000000007048962392109746, .00000000000011776978751369214, -.00000000000010774341461609578, .00000000000021863343293215910, .00000000000024132639491333131, .00000000000039057462209830700, -.00000000000026570679203560751, .00000000000037135141919592021, -.00000000000017166921336082431, -.00000000000028658285157914353, -.00000000000023812542263446809, .00000000000006576659768580062, -.00000000000028210143846181267, .00000000000010701931762114254, .00000000000018119346366441110, .00000000000009840465278232627, -.00000000000033149150282752542, -.00000000000018302857356041668, -.00000000000016207400156744949, .00000000000048303314949553201, -.00000000000071560553172382115, .00000000000088821239518571855, -.00000000000030900580513238244, -.00000000000061076551972851496, .00000000000035659969663347830, .00000000000035782396591276383, -.00000000000046226087001544578, .00000000000062279762917225156, .00000000000072838947272065741, .00000000000026809646615211673, -.00000000000010960825046059278, .00000000000002311949383800537, -.00000000000058469058005299247, -.00000000000002103748251144494, -.00000000000023323182945587408, -.00000000000042333694288141916, -.00000000000043933937969737844, .00000000000041341647073835565, .00000000000006841763641591466, .00000000000047585534004430641, .00000000000083679678674757695, -.00000000000085763734646658640, .00000000000021913281229340092, -.00000000000062242842536431148, -.00000000000010983594325438430, .00000000000065310431377633651, -.00000000000047580199021710769, -.00000000000037854251265457040, .00000000000040939233218678664, .00000000000087424383914858291, .00000000000025218188456842882, -.00000000000003608131360422557, -.00000000000050518555924280902, .00000000000078699403323355317, -.00000000000067020876961949060, .00000000000016108575753932458, .00000000000058527188436251509, -.00000000000035246757297904791, -.00000000000018372084495629058, .00000000000088606689813494916, .00000000000066486268071468700, .00000000000063831615170646519, .00000000000025144230728376072, -.00000000000017239444525614834 }; #ifndef LOG__D_ONLY double #ifdef _ANSI_SOURCE log(double x) #else log(x) double x; #endif { int m, j; double F, f, g, q, u, u2, v, zero = 0.0, one = 1.0; double logb(), ldexp(); volatile double u1; /* Catch special cases */ if (x <= 0) if (_IEEE && x == zero) /* log(0) = -Inf */ return (-one/zero); else if (_IEEE) /* log(neg) = NaN */ return (zero/zero); else if (x == zero) /* NOT REACHED IF _IEEE */ return (infnan(-ERANGE)); else return (infnan(EDOM)); else if (!finite(x)) if (_IEEE) /* x = NaN, Inf */ return (x+x); else return (infnan(ERANGE)); /* Argument reduction: 1 <= g < 2; x/2^m = g; */ /* y = F*(1 + f/F) for |f| <= 2^-8 */ m = logb(x); g = ldexp(x, -m); if (_IEEE && m == -1022) { j = logb(g), m += j; g = ldexp(g, -j); } j = N*(g-1) + .5; F = (1.0/N) * j + 1; /* F*128 is an integer in [128, 512] */ f = g - F; /* Approximate expansion for log(1+f/F) ~= u + q */ g = 1/(2*F+f); u = 2*f*g; v = u*u; q = u*v*(A1 + v*(A2 + v*(A3 + v*A4))); /* case 1: u1 = u rounded to 2^-43 absolute. Since u < 2^-8, * u1 has at most 35 bits, and F*u1 is exact, as F has < 8 bits. * It also adds exactly to |m*log2_hi + log_F_head[j] | < 750 */ if (m | j) u1 = u + 513, u1 -= 513; /* case 2: |1-x| < 1/256. The m- and j- dependent terms are zero; * u1 = u to 24 bits. */ else u1 = u, TRUNC(u1); u2 = (2.0*(f - F*u1) - u1*f) * g; /* u1 + u2 = 2f/(2F+f) to extra precision. */ /* log(x) = log(2^m*F*(1+f/F)) = */ /* (m*log2_hi+logF_head[j]+u1) + (m*log2_lo+logF_tail[j]+q); */ /* (exact) + (tiny) */ u1 += m*logF_head[N] + logF_head[j]; /* exact */ u2 = (u2 + logF_tail[j]) + q; /* tiny */ u2 += logF_tail[N]*m; return (u1 + u2); } #endif /* * Extra precision variant, returning struct {double a, b;}; * log(x) = a+b to 63 bits, with a is rounded to 26 bits. */ struct Double #ifdef _ANSI_SOURCE log__D(double x) #else log__D(x) double x; #endif { int m, j; double F, f, g, q, u, v, u2, one = 1.0; double logb(), ldexp(); volatile double u1; struct Double r; /* Argument reduction: 1 <= g < 2; x/2^m = g; */ /* y = F*(1 + f/F) for |f| <= 2^-8 */ m = logb(x); g = ldexp(x, -m); if (_IEEE && m == -1022) { j = logb(g), m += j; g = ldexp(g, -j); } j = N*(g-1) + .5; F = (1.0/N) * j + 1; f = g - F; g = 1/(2*F+f); u = 2*f*g; v = u*u; q = u*v*(A1 + v*(A2 + v*(A3 + v*A4))); if (m | j) u1 = u + 513, u1 -= 513; else u1 = u, TRUNC(u1); u2 = (2.0*(f - F*u1) - u1*f) * g; u1 += m*logF_head[N] + logF_head[j]; u2 += logF_tail[j]; u2 += q; u2 += logF_tail[N]*m; r.a = u1 + u2; /* Only difference is here */ TRUNC(r.a); r.b = (u1 - r.a) + u2; return (r); } octave-1.1.0/bsd-math/atan.c100666 415 17 6521 5341366324 13737 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)atan.c 5.5 (Berkeley) 10/9/90"; #endif /* not lint */ /* ATAN(X) * RETURNS ARC TANGENT OF X * DOUBLE PRECISION (IEEE DOUBLE 53 bits, VAX D FORMAT 56 bits) * CODED IN C BY K.C. NG, 4/16/85, REVISED ON 6/10/85. * * Required kernel function: * atan2(y,x) * * Method: * atan(x) = atan2(x,1.0). * * Special case: * if x is NaN, return x itself. * * Accuracy: * 1) If atan2() uses machine PI, then * * atan(x) returns (PI/pi) * (the exact arc tangent of x) nearly rounded; * and PI is the exact pi rounded to machine precision (see atan2 for * details): * * in decimal: * pi = 3.141592653589793 23846264338327 ..... * 53 bits PI = 3.141592653589793 115997963 ..... , * 56 bits PI = 3.141592653589793 227020265 ..... , * * in hexadecimal: * pi = 3.243F6A8885A308D313198A2E.... * 53 bits PI = 3.243F6A8885A30 = 2 * 1.921FB54442D18 error=.276ulps * 56 bits PI = 3.243F6A8885A308 = 4 * .C90FDAA22168C2 error=.206ulps * * In a test run with more than 200,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 0.86 ulps. (comparing against (PI/pi)*(exact atan(x))). * * 2) If atan2() uses true pi, then * * atan(x) returns the exact atan(x) with error below about 2 ulps. * * In a test run with more than 1,024,000 random arguments on a VAX, the * maximum observed error in ulps (units in the last place) was * 0.85 ulps. */ double atan(x) double x; { double atan2(),one=1.0; return(atan2(x,one)); } octave-1.1.0/bsd-math/mathimpl.h100666 415 17 7126 5341376056 14641 0ustar jweusers/* * Copyright (c) 1988 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)mathimpl.h 5.5 (Berkeley) 12/2/92 */ #include "cdefs.h" #include #if defined(vax)||defined(tahoe) /* Deal with different ways to concatenate in cpp */ # ifdef __STDC__ # define cat3(a,b,c) a ## b ## c # else # define cat3(a,b,c) a/**/b/**/c # endif /* Deal with vax/tahoe byte order issues */ # ifdef vax # define cat3t(a,b,c) cat3(a,b,c) # else # define cat3t(a,b,c) cat3(a,c,b) # endif # define vccast(name) (*(const double *)(cat3(name,,x))) /* * Define a constant to high precision on a Vax or Tahoe. * * Args are the name to define, the decimal floating point value, * four 16-bit chunks of the float value in hex * (because the vax and tahoe differ in float format!), the power * of 2 of the hex-float exponent, and the hex-float mantissa. * Most of these arguments are not used at compile time; they are * used in a post-check to make sure the constants were compiled * correctly. * * People who want to use the constant will have to do their own * #define foo vccast(foo) * since CPP cannot do this for them from inside another macro (sigh). * We define "vccast" if this needs doing. */ # define vc(name, value, x1,x2,x3,x4, bexp, xval) \ const static long cat3(name,,x)[] = {cat3t(0x,x1,x2), cat3t(0x,x3,x4)}; # define ic(name, value, bexp, xval) ; #else /* vax or tahoe */ /* Hooray, we have an IEEE machine */ # undef vccast # define vc(name, value, x1,x2,x3,x4, bexp, xval) ; # define ic(name, value, bexp, xval) \ static const double name = value; #endif /* defined(vax)||defined(tahoe) */ /* * Functions internal to the math package, yet not static. */ extern double exp__E(); extern double log__L(); struct Double {double a, b;}; double exp__D __P((double, double)); struct Double log__D __P((double)); octave-1.1.0/bsd-math/copysign.c100666 415 17 10651 5344461440 14664 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)support.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* * Some IEEE standard 754 recommended functions and remainder and sqrt for * supporting the C elementary functions. ****************************************************************************** * WARNING: * These codes are developed (in double) to support the C elementary * functions temporarily. They are not universal, and some of them are very * slow (in particular, drem and sqrt is extremely inefficient). Each * computer system should have its implementation of these functions using * its own assembler. ****************************************************************************** * * IEEE 754 required operations: * drem(x,p) * returns x REM y = x - [x/y]*y , where [x/y] is the integer * nearest x/y; in half way case, choose the even one. * sqrt(x) * returns the square root of x correctly rounded according to * the rounding mod. * * IEEE 754 recommended functions: * (a) copysign(x,y) * returns x with the sign of y. * (b) scalb(x,N) * returns x * (2**N), for integer values N. * (c) logb(x) * returns the unbiased exponent of x, a signed integer in * double precision, except that logb(0) is -INF, logb(INF) * is +INF, and logb(NAN) is that NAN. * (d) finite(x) * returns the value TRUE if -INF < x < +INF and returns * FALSE otherwise. * * * CODED IN C BY K.C. NG, 11/25/84; * REVISED BY K.C. NG on 1/22/85, 2/13/85, 3/24/85. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) /* VAX D format */ #include static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ double copysign(x,y) double x,y; { #ifdef national unsigned short *px=(unsigned short *) &x+3, *py=(unsigned short *) &y+3; #else /* national */ unsigned short *px=(unsigned short *) &x, *py=(unsigned short *) &y; #endif /* national */ #if defined(vax)||defined(tahoe) if ( (*px & mexp) == 0 ) return(x); #endif /* defined(vax)||defined(tahoe) */ *px = ( *px & msign ) | ( *py & ~msign ); return(x); } octave-1.1.0/bsd-math/cosh.c100666 415 17 11700 5341366327 13766 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)cosh.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* COSH(X) * RETURN THE HYPERBOLIC COSINE OF X * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/8/85; * REVISED BY K.C. NG on 2/8/85, 2/23/85, 3/7/85, 3/29/85, 4/16/85. * * Required system supported functions : * copysign(x,y) * scalb(x,N) * * Required kernel function: * exp(x) * exp__E(x,c) ...return exp(x+c)-1-x for |x|<0.3465 * * Method : * 1. Replace x by |x|. * 2. * [ exp(x) - 1 ]^2 * 0 <= x <= 0.3465 : cosh(x) := 1 + ------------------- * 2*exp(x) * * exp(x) + 1/exp(x) * 0.3465 <= x <= 22 : cosh(x) := ------------------- * 2 * 22 <= x <= lnovfl : cosh(x) := exp(x)/2 * lnovfl <= x <= lnovfl+log(2) * : cosh(x) := exp(x)/2 (avoid overflow) * log(2)+lnovfl < x < INF: overflow to INF * * Note: .3465 is a number near one half of ln2. * * Special cases: * cosh(x) is x if x is +INF, -INF, or NaN. * only cosh(0)=1 is exact for finite x. * * Accuracy: * cosh(x) returns the exact hyperbolic cosine of x nearly rounded. * In a test run with 768,000 random arguments on a VAX, the maximum * observed error was 1.23 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(mln2hi, 8.8029691931113054792E1 ,0f33,43b0,2bdb,c7e2, 7, .B00F33C7E22BDB) vc(mln2lo,-4.9650192275318476525E-16 ,1b60,a70f,582a,279e, -50,-.8F1B60279E582A) vc(lnovfl, 8.8029691931113053016E1 ,0f33,43b0,2bda,c7e2, 7, .B00F33C7E22BDA) ic(mln2hi, 7.0978271289338397310E2, 10, 1.62E42FEFA39EF) ic(mln2lo, 2.3747039373786107478E-14, -45, 1.ABC9E3B39803F) ic(lnovfl, 7.0978271289338397310E2, 9, 1.62E42FEFA39EF) #ifdef vccast #define mln2hi vccast(mln2hi) #define mln2lo vccast(mln2lo) #define lnovfl vccast(lnovfl) #endif #if defined(vax)||defined(tahoe) static max = 126 ; #else /* defined(vax)||defined(tahoe) */ static max = 1023 ; #endif /* defined(vax)||defined(tahoe) */ double cosh(x) double x; { static const double half=1.0/2.0, one=1.0, small=1.0E-18; /* fl(1+small)==1 */ double t; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if((x=copysign(x,one)) <= 22) if(x<0.3465) if(x static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ double scalb(x,N) double x; int N; { int k; #ifdef national unsigned short *px=(unsigned short *) &x + 3; #else /* national */ unsigned short *px=(unsigned short *) &x; #endif /* national */ if( x == zero ) return(x); #if defined(vax)||defined(tahoe) if( (k= *px & mexp ) != ~msign ) { if (N < -260) return(nunf*nunf); else if (N > 260) { return(copysign(infnan(ERANGE),x)); } #else /* defined(vax)||defined(tahoe) */ if( (k= *px & mexp ) != mexp ) { if( N<-2100) return(nunf*nunf); else if(N>2100) return(novf+novf); if( k == 0 ) { x *= scalb(1.0,(int)prep1); N -= prep1; return(scalb(x,N));} #endif /* defined(vax)||defined(tahoe) */ if((k = (k>>gap)+ N) > 0 ) if( k < (mexp>>gap) ) *px = (*px&~mexp) | (k< -prep1 ) /* gradual underflow */ {*px=(*px&~mexp)|(short)(1<= 1.25 (error 1.7ulp vs ~6ulp) * Replaced even+odd with direct calculation for x < .84375, * to avoid destructive cancellation. * * Performance of erfc(x): * In 300000 trials in the range [.83, .84375] the * maximum observed error was 3.6ulp. * * In [.84735,1.25] the maximum observed error was <2.5ulp in * 100000 runs in the range [1.2, 1.25]. * * In [1.25,26] (Not including subnormal results) * the error is < 1.7ulp. */ /* double erf(double x) * double erfc(double x) * x * 2 |\ * erf(x) = --------- | exp(-t*t)dt * sqrt(pi) \| * 0 * * erfc(x) = 1-erf(x) * * Method: * 1. Reduce x to |x| by erf(-x) = -erf(x) * 2. For x in [0, 0.84375] * erf(x) = x + x*P(x^2) * erfc(x) = 1 - erf(x) if x<=0.25 * = 0.5 + ((0.5-x)-x*P) if x in [0.25,0.84375] * where * 2 2 4 20 * P = P(x ) = (p0 + p1 * x + p2 * x + ... + p10 * x ) * is an approximation to (erf(x)-x)/x with precision * * -56.45 * | P - (erf(x)-x)/x | <= 2 * * * Remark. The formula is derived by noting * erf(x) = (2/sqrt(pi))*(x - x^3/3 + x^5/10 - x^7/42 + ....) * and that * 2/sqrt(pi) = 1.128379167095512573896158903121545171688 * is close to one. The interval is chosen because the fixed * point of erf(x) is near 0.6174 (i.e., erf(x)=x when x is * near 0.6174), and by some experiment, 0.84375 is chosen to * guarantee the error is less than one ulp for erf. * * 3. For x in [0.84375,1.25], let s = x - 1, and * c = 0.84506291151 rounded to single (24 bits) * erf(x) = c + P1(s)/Q1(s) * erfc(x) = (1-c) - P1(s)/Q1(s) * |P1/Q1 - (erf(x)-c)| <= 2**-59.06 * Remark: here we use the taylor series expansion at x=1. * erf(1+s) = erf(1) + s*Poly(s) * = 0.845.. + P1(s)/Q1(s) * That is, we use rational approximation to approximate * erf(1+s) - (c = (single)0.84506291151) * Note that |P1/Q1|< 0.078 for x in [0.84375,1.25] * where * P1(s) = degree 6 poly in s * Q1(s) = degree 6 poly in s * * 4. For x in [1.25, 2]; [2, 4] * erf(x) = 1.0 - tiny * erfc(x) = (1/x)exp(-x*x-(.5*log(pi) -.5z + R(z)/S(z)) * * Where z = 1/(x*x), R is degree 9, and S is degree 3; * * 5. For x in [4,28] * erf(x) = 1.0 - tiny * erfc(x) = (1/x)exp(-x*x-(.5*log(pi)+eps + zP(z)) * * Where P is degree 14 polynomial in 1/(x*x). * * Notes: * Here 4 and 5 make use of the asymptotic series * exp(-x*x) * erfc(x) ~ ---------- * ( 1 + Poly(1/x^2) ); * x*sqrt(pi) * * where for z = 1/(x*x) * P(z) ~ z/2*(-1 + z*3/2*(1 + z*5/2*(-1 + z*7/2*(1 +...)))) * * Thus we use rational approximation to approximate * erfc*x*exp(x*x) ~ 1/sqrt(pi); * * The error bound for the target function, G(z) for * the interval * [4, 28]: * |eps + 1/(z)P(z) - G(z)| < 2**(-56.61) * for [2, 4]: * |R(z)/S(z) - G(z)| < 2**(-58.24) * for [1.25, 2]: * |R(z)/S(z) - G(z)| < 2**(-58.12) * * 6. For inf > x >= 28 * erf(x) = 1 - tiny (raise inexact) * erfc(x) = tiny*tiny (raise underflow) * * 7. Special cases: * erf(0) = 0, erf(inf) = 1, erf(-inf) = -1, * erfc(0) = 1, erfc(inf) = 0, erfc(-inf) = 2, * erfc/erf(NaN) is NaN */ #if defined(vax) || defined(tahoe) #define _IEEE 0 #define TRUNC(x) (double) (float) (x) #else #define _IEEE 1 #define TRUNC(x) *(((int *) &x) + 1) &= 0xf8000000 #define infnan(x) 0.0 #endif #ifdef _IEEE_LIBM /* * redefining "___function" to "function" in _IEEE_LIBM mode */ #include "ieee_libm.h" #endif static double tiny = 1e-300, half = 0.5, one = 1.0, two = 2.0, c = 8.45062911510467529297e-01, /* (float)0.84506291151 */ /* * Coefficients for approximation to erf in [0,0.84375] */ p0t8 = 1.02703333676410051049867154944018394163280, p0 = 1.283791670955125638123339436800229927041e-0001, p1 = -3.761263890318340796574473028946097022260e-0001, p2 = 1.128379167093567004871858633779992337238e-0001, p3 = -2.686617064084433642889526516177508374437e-0002, p4 = 5.223977576966219409445780927846432273191e-0003, p5 = -8.548323822001639515038738961618255438422e-0004, p6 = 1.205520092530505090384383082516403772317e-0004, p7 = -1.492214100762529635365672665955239554276e-0005, p8 = 1.640186161764254363152286358441771740838e-0006, p9 = -1.571599331700515057841960987689515895479e-0007, p10= 1.073087585213621540635426191486561494058e-0008; /* * Coefficients for approximation to erf in [0.84375,1.25] */ static double pa0 = -2.362118560752659485957248365514511540287e-0003, pa1 = 4.148561186837483359654781492060070469522e-0001, pa2 = -3.722078760357013107593507594535478633044e-0001, pa3 = 3.183466199011617316853636418691420262160e-0001, pa4 = -1.108946942823966771253985510891237782544e-0001, pa5 = 3.547830432561823343969797140537411825179e-0002, pa6 = -2.166375594868790886906539848893221184820e-0003, qa1 = 1.064208804008442270765369280952419863524e-0001, qa2 = 5.403979177021710663441167681878575087235e-0001, qa3 = 7.182865441419627066207655332170665812023e-0002, qa4 = 1.261712198087616469108438860983447773726e-0001, qa5 = 1.363708391202905087876983523620537833157e-0002, qa6 = 1.198449984679910764099772682882189711364e-0002; /* * log(sqrt(pi)) for large x expansions. * The tail (lsqrtPI_lo) is included in the rational * approximations. */ static double lsqrtPI_hi = .5723649429247000819387380943226; /* * lsqrtPI_lo = .000000000000000005132975581353913; * * Coefficients for approximation to erfc in [2, 4] */ static double rb0 = -1.5306508387410807582e-010, /* includes lsqrtPI_lo */ rb1 = 2.15592846101742183841910806188e-008, rb2 = 6.24998557732436510470108714799e-001, rb3 = 8.24849222231141787631258921465e+000, rb4 = 2.63974967372233173534823436057e+001, rb5 = 9.86383092541570505318304640241e+000, rb6 = -7.28024154841991322228977878694e+000, rb7 = 5.96303287280680116566600190708e+000, rb8 = -4.40070358507372993983608466806e+000, rb9 = 2.39923700182518073731330332521e+000, rb10 = -6.89257464785841156285073338950e-001, sb1 = 1.56641558965626774835300238919e+001, sb2 = 7.20522741000949622502957936376e+001, sb3 = 9.60121069770492994166488642804e+001; /* * Coefficients for approximation to erfc in [1.25, 2] */ static double rc0 = -2.47925334685189288817e-007, /* includes lsqrtPI_lo */ rc1 = 1.28735722546372485255126993930e-005, rc2 = 6.24664954087883916855616917019e-001, rc3 = 4.69798884785807402408863708843e+000, rc4 = 7.61618295853929705430118701770e+000, rc5 = 9.15640208659364240872946538730e-001, rc6 = -3.59753040425048631334448145935e-001, rc7 = 1.42862267989304403403849619281e-001, rc8 = -4.74392758811439801958087514322e-002, rc9 = 1.09964787987580810135757047874e-002, rc10 = -1.28856240494889325194638463046e-003, sc1 = 9.97395106984001955652274773456e+000, sc2 = 2.80952153365721279953959310660e+001, sc3 = 2.19826478142545234106819407316e+001; /* * Coefficients for approximation to erfc in [4,28] */ static double rd0 = -2.1491361969012978677e-016, /* includes lsqrtPI_lo */ rd1 = -4.99999999999640086151350330820e-001, rd2 = 6.24999999772906433825880867516e-001, rd3 = -1.54166659428052432723177389562e+000, rd4 = 5.51561147405411844601985649206e+000, rd5 = -2.55046307982949826964613748714e+001, rd6 = 1.43631424382843846387913799845e+002, rd7 = -9.45789244999420134263345971704e+002, rd8 = 6.94834146607051206956384703517e+003, rd9 = -5.27176414235983393155038356781e+004, rd10 = 3.68530281128672766499221324921e+005, rd11 = -2.06466642800404317677021026611e+006, rd12 = 7.78293889471135381609201431274e+006, rd13 = -1.42821001129434127360582351685e+007; double erf(x) double x; { double R,S,P,Q,ax,s,y,z,r,fabs(),exp(); if(!finite(x)) { /* erf(nan)=nan */ if (isnan(x)) return(x); return (x > 0 ? one : -one); /* erf(+/-inf)= +/-1 */ } if ((ax = x) < 0) ax = - ax; if (ax < .84375) { if (ax < 3.7e-09) { if (ax < 1.0e-308) return 0.125*(8.0*x+p0t8*x); /*avoid underflow */ return x + p0*x; } y = x*x; r = y*(p1+y*(p2+y*(p3+y*(p4+y*(p5+ y*(p6+y*(p7+y*(p8+y*(p9+y*p10))))))))); return x + x*(p0+r); } if (ax < 1.25) { /* 0.84375 <= |x| < 1.25 */ s = fabs(x)-one; P = pa0+s*(pa1+s*(pa2+s*(pa3+s*(pa4+s*(pa5+s*pa6))))); Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6))))); if (x>=0) return (c + P/Q); else return (-c - P/Q); } if (ax >= 6.0) { /* inf>|x|>=6 */ if (x >= 0.0) return (one-tiny); else return (tiny-one); } /* 1.25 <= |x| < 6 */ z = -ax*ax; s = -one/z; if (ax < 2.0) { R = rc0+s*(rc1+s*(rc2+s*(rc3+s*(rc4+s*(rc5+ s*(rc6+s*(rc7+s*(rc8+s*(rc9+s*rc10))))))))); S = one+s*(sc1+s*(sc2+s*sc3)); } else { R = rb0+s*(rb1+s*(rb2+s*(rb3+s*(rb4+s*(rb5+ s*(rb6+s*(rb7+s*(rb8+s*(rb9+s*rb10))))))))); S = one+s*(sb1+s*(sb2+s*sb3)); } y = (R/S -.5*s) - lsqrtPI_hi; z += y; z = exp(z)/ax; if (x >= 0) return (one-z); else return (z-one); } double erfc(x) double x; { double R,S,P,Q,s,ax,y,z,r,fabs(),exp__D(); if (!finite(x)) { if (isnan(x)) /* erfc(NaN) = NaN */ return(x); else if (x > 0) /* erfc(+-inf)=0,2 */ return 0.0; else return 2.0; } if ((ax = x) < 0) ax = -ax; if (ax < .84375) { /* |x|<0.84375 */ if (ax < 1.38777878078144568e-17) /* |x|<2**-56 */ return one-x; y = x*x; r = y*(p1+y*(p2+y*(p3+y*(p4+y*(p5+ y*(p6+y*(p7+y*(p8+y*(p9+y*p10))))))))); if (ax < .0625) { /* |x|<2**-4 */ return (one-(x+x*(p0+r))); } else { r = x*(p0+r); r += (x-half); return (half - r); } } if (ax < 1.25) { /* 0.84375 <= |x| < 1.25 */ s = ax-one; P = pa0+s*(pa1+s*(pa2+s*(pa3+s*(pa4+s*(pa5+s*pa6))))); Q = one+s*(qa1+s*(qa2+s*(qa3+s*(qa4+s*(qa5+s*qa6))))); if (x>=0) { z = one-c; return z - P/Q; } else { z = c+P/Q; return one+z; } } if (ax >= 28) /* Out of range */ if (x>0) return (tiny*tiny); else return (two-tiny); z = ax; TRUNC(z); y = z - ax; y *= (ax+z); z *= -z; /* Here z + y = -x^2 */ s = one/(-z-y); /* 1/(x*x) */ if (ax >= 4) { /* 6 <= ax */ R = s*(rd1+s*(rd2+s*(rd3+s*(rd4+s*(rd5+ s*(rd6+s*(rd7+s*(rd8+s*(rd9+s*(rd10 +s*(rd11+s*(rd12+s*rd13)))))))))))); y += rd0; } else if (ax >= 2) { R = rb0+s*(rb1+s*(rb2+s*(rb3+s*(rb4+s*(rb5+ s*(rb6+s*(rb7+s*(rb8+s*(rb9+s*rb10))))))))); S = one+s*(sb1+s*(sb2+s*sb3)); y += R/S; R = -.5*s; } else { R = rc0+s*(rc1+s*(rc2+s*(rc3+s*(rc4+s*(rc5+ s*(rc6+s*(rc7+s*(rc8+s*(rc9+s*rc10))))))))); S = one+s*(sc1+s*(sc2+s*sc3)); y += R/S; R = -.5*s; } /* return exp(-x^2 - lsqrtPI_hi + R + y)/x; */ s = ((R + y) - lsqrtPI_hi) + z; y = (((z-s) - lsqrtPI_hi) + R) + y; r = exp__D(s, y)/x; if (x>0) return r; else return two-r; } octave-1.1.0/bsd-math/log__D.c100666 415 17 30641 5341402633 14211 0ustar jweusers/* * Copyright (c) 1992 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)log.c 5.10 (Berkeley) 1/10/93"; #endif /* not lint */ #include #include #include "mathimpl.h" /* Table-driven natural logarithm. * * This code was derived, with minor modifications, from: * Peter Tang, "Table-Driven Implementation of the * Logarithm in IEEE Floating-Point arithmetic." ACM Trans. * Math Software, vol 16. no 4, pp 378-400, Dec 1990). * * Calculates log(2^m*F*(1+f/F)), |f/j| <= 1/256, * where F = j/128 for j an integer in [0, 128]. * * log(2^m) = log2_hi*m + log2_tail*m * since m is an integer, the dominant term is exact. * m has at most 10 digits (for subnormal numbers), * and log2_hi has 11 trailing zero bits. * * log(F) = logF_hi[j] + logF_lo[j] is in tabular form in log_table.h * logF_hi[] + 512 is exact. * * log(1+f/F) = 2*f/(2*F + f) + 1/12 * (2*f/(2*F + f))**3 + ... * the leading term is calculated to extra precision in two * parts, the larger of which adds exactly to the dominant * m and F terms. * There are two cases: * 1. when m, j are non-zero (m | j), use absolute * precision for the leading term. * 2. when m = j = 0, |1-x| < 1/256, and log(x) ~= (x-1). * In this case, use a relative precision of 24 bits. * (This is done differently in the original paper) * * Special cases: * 0 return signalling -Inf * neg return signalling NaN * +Inf return +Inf */ #if defined(vax) || defined(tahoe) #define _IEEE 0 #define TRUNC(x) x = (double) (float) (x) #else #define _IEEE 1 #define endian (((*(int *) &one)) ? 1 : 0) #define TRUNC(x) *(((int *) &x) + endian) &= 0xf8000000 #define infnan(x) 0.0 #endif #define N 128 /* Table of log(Fj) = logF_head[j] + logF_tail[j], for Fj = 1+j/128. * Used for generation of extend precision logarithms. * The constant 35184372088832 is 2^45, so the divide is exact. * It ensures correct reading of logF_head, even for inaccurate * decimal-to-binary conversion routines. (Everybody gets the * right answer for integers less than 2^53.) * Values for log(F) were generated using error < 10^-57 absolute * with the bc -l package. */ static double A1 = .08333333333333178827; static double A2 = .01250000000377174923; static double A3 = .002232139987919447809; static double A4 = .0004348877777076145742; static double logF_head[N+1] = { 0., .007782140442060381246, .015504186535963526694, .023167059281547608406, .030771658666765233647, .038318864302141264488, .045809536031242714670, .053244514518837604555, .060624621816486978786, .067950661908525944454, .075223421237524235039, .082443669210988446138, .089612158689760690322, .096729626458454731618, .103796793681567578460, .110814366340264314203, .117783035656430001836, .124703478501032805070, .131576357788617315236, .138402322859292326029, .145182009844575077295, .151916042025732167530, .158605030176659056451, .165249572895390883786, .171850256926518341060, .178407657472689606947, .184922338493834104156, .191394852999565046047, .197825743329758552135, .204215541428766300668, .210564769107350002741, .216873938300523150246, .223143551314024080056, .229374101064877322642, .235566071312860003672, .241719936886966024758, .247836163904594286577, .253915209980732470285, .259957524436686071567, .265963548496984003577, .271933715484010463114, .277868451003087102435, .283768173130738432519, .289633292582948342896, .295464212893421063199, .301261330578199704177, .307025035294827830512, .312755710004239517729, .318453731118097493890, .324119468654316733591, .329753286372579168528, .335355541920762334484, .340926586970454081892, .346466767346100823488, .351976423156884266063, .357455888922231679316, .362905493689140712376, .368325561158599157352, .373716409793814818840, .379078352934811846353, .384411698910298582632, .389716751140440464951, .394993808240542421117, .400243164127459749579, .405465108107819105498, .410659924985338875558, .415827895143593195825, .420969294644237379543, .426084395310681429691, .431173464818130014464, .436236766774527495726, .441274560805140936281, .446287102628048160113, .451274644139630254358, .456237433481874177232, .461175715122408291790, .466089729924533457960, .470979715219073113985, .475845904869856894947, .480688529345570714212, .485507815781602403149, .490303988045525329653, .495077266798034543171, .499827869556611403822, .504556010751912253908, .509261901790523552335, .513945751101346104405, .518607764208354637958, .523248143765158602036, .527867089620485785417, .532464798869114019908, .537041465897345915436, .541597282432121573947, .546132437597407260909, .550647117952394182793, .555141507540611200965, .559615787935399566777, .564070138285387656651, .568504735352689749561, .572919753562018740922, .577315365035246941260, .581691739635061821900, .586049045003164792433, .590387446602107957005, .594707107746216934174, .599008189645246602594, .603290851438941899687, .607555250224322662688, .611801541106615331955, .616029877215623855590, .620240409751204424537, .624433288012369303032, .628608659422752680256, .632766669570628437213, .636907462236194987781, .641031179420679109171, .645137961373620782978, .649227946625615004450, .653301272011958644725, .657358072709030238911, .661398482245203922502, .665422632544505177065, .669430653942981734871, .673422675212350441142, .677398823590920073911, .681359224807238206267, .685304003098281100392, .689233281238557538017, .693147180560117703862 }; static double logF_tail[N+1] = { 0., -.00000000000000543229938420049, .00000000000000172745674997061, -.00000000000001323017818229233, -.00000000000001154527628289872, -.00000000000000466529469958300, .00000000000005148849572685810, -.00000000000002532168943117445, -.00000000000005213620639136504, -.00000000000001819506003016881, .00000000000006329065958724544, .00000000000008614512936087814, -.00000000000007355770219435028, .00000000000009638067658552277, .00000000000007598636597194141, .00000000000002579999128306990, -.00000000000004654729747598444, -.00000000000007556920687451336, .00000000000010195735223708472, -.00000000000017319034406422306, -.00000000000007718001336828098, .00000000000010980754099855238, -.00000000000002047235780046195, -.00000000000008372091099235912, .00000000000014088127937111135, .00000000000012869017157588257, .00000000000017788850778198106, .00000000000006440856150696891, .00000000000016132822667240822, -.00000000000007540916511956188, -.00000000000000036507188831790, .00000000000009120937249914984, .00000000000018567570959796010, -.00000000000003149265065191483, -.00000000000009309459495196889, .00000000000017914338601329117, -.00000000000001302979717330866, .00000000000023097385217586939, .00000000000023999540484211737, .00000000000015393776174455408, -.00000000000036870428315837678, .00000000000036920375082080089, -.00000000000009383417223663699, .00000000000009433398189512690, .00000000000041481318704258568, -.00000000000003792316480209314, .00000000000008403156304792424, -.00000000000034262934348285429, .00000000000043712191957429145, -.00000000000010475750058776541, -.00000000000011118671389559323, .00000000000037549577257259853, .00000000000013912841212197565, .00000000000010775743037572640, .00000000000029391859187648000, -.00000000000042790509060060774, .00000000000022774076114039555, .00000000000010849569622967912, -.00000000000023073801945705758, .00000000000015761203773969435, .00000000000003345710269544082, -.00000000000041525158063436123, .00000000000032655698896907146, -.00000000000044704265010452446, .00000000000034527647952039772, -.00000000000007048962392109746, .00000000000011776978751369214, -.00000000000010774341461609578, .00000000000021863343293215910, .00000000000024132639491333131, .00000000000039057462209830700, -.00000000000026570679203560751, .00000000000037135141919592021, -.00000000000017166921336082431, -.00000000000028658285157914353, -.00000000000023812542263446809, .00000000000006576659768580062, -.00000000000028210143846181267, .00000000000010701931762114254, .00000000000018119346366441110, .00000000000009840465278232627, -.00000000000033149150282752542, -.00000000000018302857356041668, -.00000000000016207400156744949, .00000000000048303314949553201, -.00000000000071560553172382115, .00000000000088821239518571855, -.00000000000030900580513238244, -.00000000000061076551972851496, .00000000000035659969663347830, .00000000000035782396591276383, -.00000000000046226087001544578, .00000000000062279762917225156, .00000000000072838947272065741, .00000000000026809646615211673, -.00000000000010960825046059278, .00000000000002311949383800537, -.00000000000058469058005299247, -.00000000000002103748251144494, -.00000000000023323182945587408, -.00000000000042333694288141916, -.00000000000043933937969737844, .00000000000041341647073835565, .00000000000006841763641591466, .00000000000047585534004430641, .00000000000083679678674757695, -.00000000000085763734646658640, .00000000000021913281229340092, -.00000000000062242842536431148, -.00000000000010983594325438430, .00000000000065310431377633651, -.00000000000047580199021710769, -.00000000000037854251265457040, .00000000000040939233218678664, .00000000000087424383914858291, .00000000000025218188456842882, -.00000000000003608131360422557, -.00000000000050518555924280902, .00000000000078699403323355317, -.00000000000067020876961949060, .00000000000016108575753932458, .00000000000058527188436251509, -.00000000000035246757297904791, -.00000000000018372084495629058, .00000000000088606689813494916, .00000000000066486268071468700, .00000000000063831615170646519, .00000000000025144230728376072, -.00000000000017239444525614834 }; /* * Extra precision variant, returning struct {double a, b;}; * log(x) = a+b to 63 bits, with a is rounded to 26 bits. */ struct Double #ifdef _ANSI_SOURCE log__D(double x) #else log__D(x) double x; #endif { int m, j; double F, f, g, q, u, v, u2, one = 1.0; double logb(), ldexp(); volatile double u1; struct Double r; /* Argument reduction: 1 <= g < 2; x/2^m = g; */ /* y = F*(1 + f/F) for |f| <= 2^-8 */ m = logb(x); g = ldexp(x, -m); if (_IEEE && m == -1022) { j = logb(g), m += j; g = ldexp(g, -j); } j = N*(g-1) + .5; F = (1.0/N) * j + 1; f = g - F; g = 1/(2*F+f); u = 2*f*g; v = u*u; q = u*v*(A1 + v*(A2 + v*(A3 + v*A4))); if (m | j) u1 = u + 513, u1 -= 513; else u1 = u, TRUNC(u1); u2 = (2.0*(f - F*u1) - u1*f) * g; u1 += m*logF_head[N] + logF_head[j]; u2 += logF_tail[j]; u2 += q; u2 += logF_tail[N]*m; r.a = u1 + u2; /* Only difference is here */ TRUNC(r.a); r.b = (u1 - r.a) + u2; return (r); } octave-1.1.0/bsd-math/exp__E.c100666 415 17 12150 5341366332 14225 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)exp__E.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* exp__E(x,c) * ASSUMPTION: c << x SO THAT fl(x+c)=x. * (c is the correction term for x) * exp__E RETURNS * * / exp(x+c) - 1 - x , 1E-19 < |x| < .3465736 * exp__E(x,c) = | * \ 0 , |x| < 1E-19. * * DOUBLE PRECISION (IEEE 53 bits, VAX D FORMAT 56 BITS) * KERNEL FUNCTION OF EXP, EXPM1, POW FUNCTIONS * CODED IN C BY K.C. NG, 1/31/85; * REVISED BY K.C. NG on 3/16/85, 4/16/85. * * Required system supported function: * copysign(x,y) * * Method: * 1. Rational approximation. Let r=x+c. * Based on * 2 * sinh(r/2) * exp(r) - 1 = ---------------------- , * cosh(r/2) - sinh(r/2) * exp__E(r) is computed using * x*x (x/2)*W - ( Q - ( 2*P + x*P ) ) * --- + (c + x*[---------------------------------- + c ]) * 2 1 - W * where P := p1*x^2 + p2*x^4, * Q := q1*x^2 + q2*x^4 (for 56 bits precision, add q3*x^6) * W := x/2-(Q-x*P), * * (See the listing below for the values of p1,p2,q1,q2,q3. The poly- * nomials P and Q may be regarded as the approximations to sinh * and cosh : * sinh(r/2) = r/2 + r * P , cosh(r/2) = 1 + Q . ) * * The coefficients were obtained by a special Remez algorithm. * * Approximation error: * * | exp(x) - 1 | 2**(-57), (IEEE double) * | ------------ - (exp__E(x,0)+x)/x | <= * | x | 2**(-69). (VAX D) * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(p1, 1.5150724356786683059E-2 ,3abe,3d78,066a,67e1, -6, .F83ABE67E1066A) vc(p2, 6.3112487873718332688E-5 ,5b42,3984,0173,48cd, -13, .845B4248CD0173) vc(q1, 1.1363478204690669916E-1 ,b95a,3ee8,ec45,44a2, -3, .E8B95A44A2EC45) vc(q2, 1.2624568129896839182E-3 ,7905,3ba5,f5e7,72e4, -9, .A5790572E4F5E7) vc(q3, 1.5021856115869022674E-6 ,9eb4,36c9,c395,604a, -19, .C99EB4604AC395) ic(p1, 1.3887401997267371720E-2, -7, 1.C70FF8B3CC2CF) ic(p2, 3.3044019718331897649E-5, -15, 1.15317DF4526C4) ic(q1, 1.1110813732786649355E-1, -4, 1.C719538248597) ic(q2, 9.9176615021572857300E-4, -10, 1.03FC4CB8C98E8) #ifdef vccast #define p1 vccast(p1) #define p2 vccast(p2) #define q1 vccast(q1) #define q2 vccast(q2) #define q3 vccast(q3) #endif double exp__E(x,c) double x,c; { const static double zero=0.0, one=1.0, half=1.0/2.0, small=1.0E-19; double z,p,q,xp,xh,w; if(copysign(x,one)>small) { z = x*x ; p = z*( p1 +z* p2 ); #if defined(vax)||defined(tahoe) q = z*( q1 +z*( q2 +z* q3 )); #else /* defined(vax)||defined(tahoe) */ q = z*( q1 +z* q2 ); #endif /* defined(vax)||defined(tahoe) */ xp= x*p ; xh= x*half ; w = xh-(q-xp) ; p = p+p; c += x*((xh*w-(q-(p+xp)))/(one-w)+c); return(z*half+c); } /* end of |x| > small */ else { if(x!=zero) one+small; /* raise the inexact flag */ return(copysign(zero,x)); } } octave-1.1.0/bsd-math/expm1.c100666 415 17 12701 5341366333 14063 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)expm1.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* EXPM1(X) * RETURN THE EXPONENTIAL OF X MINUS ONE * DOUBLE PRECISION (IEEE 53 BITS, VAX D FORMAT 56 BITS) * CODED IN C BY K.C. NG, 1/19/85; * REVISED BY K.C. NG on 2/6/85, 3/7/85, 3/21/85, 4/16/85. * * Required system supported functions: * scalb(x,n) * copysign(x,y) * finite(x) * * Kernel function: * exp__E(x,c) * * Method: * 1. Argument Reduction: given the input x, find r and integer k such * that * x = k*ln2 + r, |r| <= 0.5*ln2 . * r will be represented as r := z+c for better accuracy. * * 2. Compute EXPM1(r)=exp(r)-1 by * * EXPM1(r=z+c) := z + exp__E(z,c) * * 3. EXPM1(x) = 2^k * ( EXPM1(r) + 1-2^-k ). * * Remarks: * 1. When k=1 and z < -0.25, we use the following formula for * better accuracy: * EXPM1(x) = 2 * ( (z+0.5) + exp__E(z,c) ) * 2. To avoid rounding error in 1-2^-k where k is large, we use * EXPM1(x) = 2^k * { [z+(exp__E(z,c)-2^-k )] + 1 } * when k>56. * * Special cases: * EXPM1(INF) is INF, EXPM1(NaN) is NaN; * EXPM1(-INF)= -1; * for finite argument, only EXPM1(0)=0 is exact. * * Accuracy: * EXPM1(x) returns the exact (exp(x)-1) nearly rounded. In a test run with * 1,166,000 random arguments on a VAX, the maximum observed error was * .872 ulps (units of the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) vc(lnhuge, 9.4961163736712506989E1 ,ec1d,43bd,9010,a73e, 7, .BDEC1DA73E9010) vc(invln2, 1.4426950408889634148E0 ,aa3b,40b8,17f1,295c, 1, .B8AA3B295C17F1) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10, -33, 1.A39EF35793C76) ic(lnhuge, 7.1602103751842355450E2, 9, 1.6602B15B7ECF2) ic(invln2, 1.4426950408889633870E0, 0, 1.71547652B82FE) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #define lnhuge vccast(lnhuge) #define invln2 vccast(invln2) #endif double expm1(x) double x; { const static double one=1.0, half=1.0/2.0; double z,hi,lo,c; int k; #if defined(vax)||defined(tahoe) static prec=56; #else /* defined(vax)||defined(tahoe) */ static prec=53; #endif /* defined(vax)||defined(tahoe) */ #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if( x <= lnhuge ) { if( x >= -40.0 ) { /* argument reduction : x - k*ln2 */ k= invln2 *x+copysign(0.5,x); /* k=NINT(x/ln2) */ hi=x-k*ln2hi ; z=hi-(lo=k*ln2lo); c=(hi-z)-lo; if(k==0) return(z+exp__E(z,c)); if(k==1) if(z< -0.25) {x=z+half;x +=exp__E(z,c); return(x+x);} else {z+=exp__E(z,c); x=half+z; return(x+x);} /* end of k=1 */ else { if(k<=prec) { x=one-scalb(one,-k); z += exp__E(z,c);} else if(k<100) { x = exp__E(z,c)-scalb(one,-k); x+=z; z=one;} else { x = exp__E(z,c)+z; z=one;} return (scalb(x+z,k)); } } /* end of x > lnunfl */ else /* expm1(-big#) rounded to -1 (inexact) */ if(finite(x)) { ln2hi+ln2lo; return(-one);} /* expm1(-INF) is -1 */ else return(-one); } /* end of x < lnhuge */ else /* expm1(INF) is INF, expm1(+big#) overflows to INF */ return( finite(x) ? scalb(one,5000) : x); } octave-1.1.0/bsd-math/floor.c100666 415 17 10204 5341366334 14147 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)floor.c 5.8 (Berkeley) 10/1/92"; #endif /* not lint */ #include "mathimpl.h" vc(L, 4503599627370496.0E0 ,0000,5c00,0000,0000, 55, 1.0) /* 2**55 */ ic(L, 4503599627370496.0E0, 52, 1.0) /* 2**52 */ #ifdef vccast #define L vccast(L) #endif /* * floor(x) := the largest integer no larger than x; * ceil(x) := -floor(-x), for all real x. * * Note: Inexact will be signaled if x is not an integer, as is * customary for IEEE 754. No other signal can be emitted. */ double floor(x) double x; { volatile double y; if ( #if !defined(vax)&&!defined(tahoe) x != x || /* NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ x >= L) /* already an even integer */ return x; else if (x < (double)0) return -ceil(-x); else { /* now 0 <= x < L */ y = L+x; /* destructive store must be forced */ y -= L; /* an integer, and |x-y| < 1 */ return x < y ? y-(double)1 : y; } } double ceil(x) double x; { volatile double y; if ( #if !defined(vax)&&!defined(tahoe) x != x || /* NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ x >= L) /* already an even integer */ return x; else if (x < (double)0) return -floor(-x); else { /* now 0 <= x < L */ y = L+x; /* destructive store must be forced */ y -= L; /* an integer, and |x-y| < 1 */ return x > y ? y+(double)1 : y; } } #ifndef ns32000 /* rint() is in ./NATIONAL/support.s */ /* * algorithm for rint(x) in pseudo-pascal form ... * * real rint(x): real x; * ... delivers integer nearest x in direction of prevailing rounding * ... mode * const L = (last consecutive integer)/2 * = 2**55; for VAX D * = 2**52; for IEEE 754 Double * real s,t; * begin * if x != x then return x; ... NaN * if |x| >= L then return x; ... already an integer * s := copysign(L,x); * t := x + s; ... = (x+s) rounded to integer * return t - s * end; * * Note: Inexact will be signaled if x is not an integer, as is * customary for IEEE 754. No other signal can be emitted. */ double rint(x) double x; { double s; volatile double t; const double one = 1.0; #if !defined(vax)&&!defined(tahoe) if (x != x) /* NaN */ return (x); #endif /* !defined(vax)&&!defined(tahoe) */ if (copysign(x,one) >= L) /* already an integer */ return (x); s = copysign(L,x); t = x + s; /* x+s rounded to integer */ return (t - s); } #endif /* not national */ octave-1.1.0/bsd-math/logb.c100666 415 17 11126 5344461465 13761 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)support.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* * Some IEEE standard 754 recommended functions and remainder and sqrt for * supporting the C elementary functions. ****************************************************************************** * WARNING: * These codes are developed (in double) to support the C elementary * functions temporarily. They are not universal, and some of them are very * slow (in particular, drem and sqrt is extremely inefficient). Each * computer system should have its implementation of these functions using * its own assembler. ****************************************************************************** * * IEEE 754 required operations: * drem(x,p) * returns x REM y = x - [x/y]*y , where [x/y] is the integer * nearest x/y; in half way case, choose the even one. * sqrt(x) * returns the square root of x correctly rounded according to * the rounding mod. * * IEEE 754 recommended functions: * (a) copysign(x,y) * returns x with the sign of y. * (b) scalb(x,N) * returns x * (2**N), for integer values N. * (c) logb(x) * returns the unbiased exponent of x, a signed integer in * double precision, except that logb(0) is -INF, logb(INF) * is +INF, and logb(NAN) is that NAN. * (d) finite(x) * returns the value TRUE if -INF < x < +INF and returns * FALSE otherwise. * * * CODED IN C BY K.C. NG, 11/25/84; * REVISED BY K.C. NG on 1/22/85, 2/13/85, 3/24/85. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) /* VAX D format */ #include static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ double logb(x) double x; { #ifdef national short *px=(short *) &x+3, k; #else /* national */ short *px=(short *) &x, k; #endif /* national */ #if defined(vax)||defined(tahoe) return (int)(((*px&mexp)>>gap)-bias); #else /* defined(vax)||defined(tahoe) */ if( (k= *px & mexp ) != mexp ) if ( k != 0 ) return ( (k>>gap) - bias ); else if( x != zero) return ( -1022.0 ); else return(-(1.0/zero)); else if(x != x) return(x); else {*px &= msign; return(x);} #endif /* defined(vax)||defined(tahoe) */ } octave-1.1.0/bsd-math/fmod.c100666 415 17 10325 5341366335 13760 0ustar jweusers/* * Copyright (c) 1989 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)fmod.c 5.2 (Berkeley) 6/1/90"; #endif /* not lint */ /* fmod.c * * SYNOPSIS * * #include * double fmod(double x, double y) * * DESCRIPTION * * The fmod function computes the floating-point remainder of x/y. * * RETURNS * * The fmod function returns the value x-i*y, for some integer i * such that, if y is nonzero, the result has the same sign as x and * magnitude less than the magnitude of y. * * On a VAX or CCI, * * fmod(x,0) traps/faults on floating-point divided-by-zero. * * On IEEE-754 conforming machines with "isnan()" primitive, * * fmod(x,0), fmod(INF,y) are invalid operations and NaN is returned. * */ #if !defined(vax) && !defined(tahoe) extern int isnan(),finite(); #endif /* !defined(vax) && !defined(tahoe) */ extern double frexp(),ldexp(),fabs(); #ifdef TEST_FMOD static double _fmod(x,y) #else /* TEST_FMOD */ double fmod(x,y) #endif /* TEST_FMOD */ double x,y; { int ir,iy; double r,w; if (y == (double)0 #if !defined(vax) && !defined(tahoe) /* per "fmod" manual entry, SunOS 4.0 */ || isnan(y) || !finite(x) #endif /* !defined(vax) && !defined(tahoe) */ ) return (x*y)/(x*y); r = fabs(x); y = fabs(y); (void)frexp(y,&iy); while (r >= y) { (void)frexp(r,&ir); w = ldexp(y,ir-iy); r -= w <= r ? w : w*(double)0.5; } return x >= (double)0 ? r : -r; } #ifdef TEST_FMOD extern long random(); extern double fmod(); #define NTEST 10000 #define NCASES 3 static int nfail = 0; static void doit(x,y) double x,y; { double ro = fmod(x,y),rn = _fmod(x,y); if (ro != rn) { (void)printf(" x = 0x%08.8x %08.8x (%24.16e)\n",x,x); (void)printf(" y = 0x%08.8x %08.8x (%24.16e)\n",y,y); (void)printf(" fmod = 0x%08.8x %08.8x (%24.16e)\n",ro,ro); (void)printf("_fmod = 0x%08.8x %08.8x (%24.16e)\n",rn,rn); (void)printf("\n"); } } main() { register int i,cases; double x,y; srandom(12345); for (i = 0; i < NTEST; i++) { x = (double)random(); y = (double)random(); for (cases = 0; cases < NCASES; cases++) { switch (cases) { case 0: break; case 1: y = (double)1/y; break; case 2: x = (double)1/x; break; default: abort(); break; } doit(x,y); doit(x,-y); doit(-x,y); doit(-x,-y); } } if (nfail) (void)printf("Number of failures: %d (out of a total of %d)\n", nfail,NTEST*NCASES*4); else (void)printf("No discrepancies were found\n"); exit(0); } #endif /* TEST_FMOD */ octave-1.1.0/bsd-math/gamma.c100666 415 17 22125 5341366336 14117 0ustar jweusers/*- * Copyright (c) 1992 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)gamma.c 5.3 (Berkeley) 12/16/92"; #endif /* not lint */ /* * This code by P. McIlroy, Oct 1992; * * The financial support of UUNET Communications Services is greatfully * acknowledged. */ #include #include "mathimpl.h" #include /* METHOD: * x < 0: Use reflection formula, G(x) = pi/(sin(pi*x)*x*G(x)) * At negative integers, return +Inf, and set errno. * * x < 6.5: * Use argument reduction G(x+1) = xG(x) to reach the * range [1.066124,2.066124]. Use a rational * approximation centered at the minimum (x0+1) to * ensure monotonicity. * * x >= 6.5: Use the asymptotic approximation (Stirling's formula) * adjusted for equal-ripples: * * log(G(x)) ~= (x-.5)*(log(x)-1) + .5(log(2*pi)-1) + 1/x*P(1/(x*x)) * * Keep extra precision in multiplying (x-.5)(log(x)-1), to * avoid premature round-off. * * Special values: * non-positive integer: Set overflow trap; return +Inf; * x > 171.63: Set overflow trap; return +Inf; * NaN: Set invalid trap; return NaN * * Accuracy: Gamma(x) is accurate to within * x > 0: error provably < 0.9ulp. * Maximum observed in 1,000,000 trials was .87ulp. * x < 0: * Maximum observed error < 4ulp in 1,000,000 trials. */ static double neg_gam __P((double)); static double small_gam __P((double)); static double smaller_gam __P((double)); static struct Double large_gam __P((double)); static struct Double ratfun_gam __P((double, double)); /* * Rational approximation, A0 + x*x*P(x)/Q(x), on the interval * [1.066.., 2.066..] accurate to 4.25e-19. */ #define LEFT -.3955078125 /* left boundary for rat. approx */ #define x0 .461632144968362356785 /* xmin - 1 */ #define a0_hi 0.88560319441088874992 #define a0_lo -.00000000000000004996427036469019695 #define P0 6.21389571821820863029017800727e-01 #define P1 2.65757198651533466104979197553e-01 #define P2 5.53859446429917461063308081748e-03 #define P3 1.38456698304096573887145282811e-03 #define P4 2.40659950032711365819348969808e-03 #define Q0 1.45019531250000000000000000000e+00 #define Q1 1.06258521948016171343454061571e+00 #define Q2 -2.07474561943859936441469926649e-01 #define Q3 -1.46734131782005422506287573015e-01 #define Q4 3.07878176156175520361557573779e-02 #define Q5 5.12449347980666221336054633184e-03 #define Q6 -1.76012741431666995019222898833e-03 #define Q7 9.35021023573788935372153030556e-05 #define Q8 6.13275507472443958924745652239e-06 /* * Constants for large x approximation (x in [6, Inf]) * (Accurate to 2.8*10^-19 absolute) */ #define lns2pi_hi 0.418945312500000 #define lns2pi_lo -.000006779295327258219670263595 #define Pa0 8.33333333333333148296162562474e-02 #define Pa1 -2.77777777774548123579378966497e-03 #define Pa2 7.93650778754435631476282786423e-04 #define Pa3 -5.95235082566672847950717262222e-04 #define Pa4 8.41428560346653702135821806252e-04 #define Pa5 -1.89773526463879200348872089421e-03 #define Pa6 5.69394463439411649408050664078e-03 #define Pa7 -1.44705562421428915453880392761e-02 static const double zero = 0., one = 1.0, tiny = 1e-300; static int endian; /* * TRUNC sets trailing bits in a floating-point number to zero. * is a temporary variable. */ #if defined(vax) || defined(tahoe) #define _IEEE 0 #define TRUNC(x) x = (double) (float) (x) #else #define _IEEE 1 #define TRUNC(x) *(((int *) &x) + endian) &= 0xf8000000 #define infnan(x) 0.0 #endif double gamma(x) double x; { struct Double u; endian = (*(int *) &one) ? 1 : 0; if (x >= 6) { if(x > 171.63) return(one/zero); u = large_gam(x); return(exp__D(u.a, u.b)); } else if (x >= 1.0 + LEFT + x0) return (small_gam(x)); else if (x > 1.e-17) return (smaller_gam(x)); else if (x > -1.e-17) { if (x == 0.0) if (!_IEEE) return (infnan(ERANGE)); else return (one/x); one+1e-20; /* Raise inexact flag. */ return (one/x); } else if (!finite(x)) { if (_IEEE) /* x = NaN, -Inf */ return (x*x); else return (infnan(EDOM)); } else return (neg_gam(x)); } /* * Accurate to max(ulp(1/128) absolute, 2^-66 relative) error. */ static struct Double large_gam(x) double x; { double z, p; int i; struct Double t, u, v; z = one/(x*x); p = Pa0+z*(Pa1+z*(Pa2+z*(Pa3+z*(Pa4+z*(Pa5+z*(Pa6+z*Pa7)))))); p = p/x; u = log__D(x); u.a -= one; v.a = (x -= .5); TRUNC(v.a); v.b = x - v.a; t.a = v.a*u.a; /* t = (x-.5)*(log(x)-1) */ t.b = v.b*u.a + x*u.b; /* return t.a + t.b + lns2pi_hi + lns2pi_lo + p */ t.b += lns2pi_lo; t.b += p; u.a = lns2pi_hi + t.b; u.a += t.a; u.b = t.a - u.a; u.b += lns2pi_hi; u.b += t.b; return (u); } /* * Good to < 1 ulp. (provably .90 ulp; .87 ulp on 1,000,000 runs.) * It also has correct monotonicity. */ static double small_gam(x) double x; { double y, ym1, t, x1; struct Double yy, r; y = x - one; ym1 = y - one; if (y <= 1.0 + (LEFT + x0)) { yy = ratfun_gam(y - x0, 0); return (yy.a + yy.b); } r.a = y; TRUNC(r.a); yy.a = r.a - one; y = ym1; yy.b = r.b = y - yy.a; /* Argument reduction: G(x+1) = x*G(x) */ for (ym1 = y-one; ym1 > LEFT + x0; y = ym1--, yy.a--) { t = r.a*yy.a; r.b = r.a*yy.b + y*r.b; r.a = t; TRUNC(r.a); r.b += (t - r.a); } /* Return r*gamma(y). */ yy = ratfun_gam(y - x0, 0); y = r.b*(yy.a + yy.b) + r.a*yy.b; y += yy.a*r.a; return (y); } /* * Good on (0, 1+x0+LEFT]. Accurate to 1ulp. */ static double smaller_gam(x) double x; { double t, d; struct Double r, xx; if (x < x0 + LEFT) { t = x, TRUNC(t); d = (t+x)*(x-t); t *= t; xx.a = (t + x), TRUNC(xx.a); xx.b = x - xx.a; xx.b += t; xx.b += d; t = (one-x0); t += x; d = (one-x0); d -= t; d += x; x = xx.a + xx.b; } else { xx.a = x, TRUNC(xx.a); xx.b = x - xx.a; t = x - x0; d = (-x0 -t); d += x; } r = ratfun_gam(t, d); d = r.a/x, TRUNC(d); r.a -= d*xx.a; r.a -= d*xx.b; r.a += r.b; return (d + r.a/x); } /* * returns (z+c)^2 * P(z)/Q(z) + a0 */ static struct Double ratfun_gam(z, c) double z, c; { int i; double p, q; struct Double r, t; q = Q0 +z*(Q1+z*(Q2+z*(Q3+z*(Q4+z*(Q5+z*(Q6+z*(Q7+z*Q8))))))); p = P0 + z*(P1 + z*(P2 + z*(P3 + z*P4))); /* return r.a + r.b = a0 + (z+c)^2*p/q, with r.a truncated to 26 bits. */ p = p/q; t.a = z, TRUNC(t.a); /* t ~= z + c */ t.b = (z - t.a) + c; t.b *= (t.a + z); q = (t.a *= t.a); /* t = (z+c)^2 */ TRUNC(t.a); t.b += (q - t.a); r.a = p, TRUNC(r.a); /* r = P/Q */ r.b = p - r.a; t.b = t.b*p + t.a*r.b + a0_lo; t.a *= r.a; /* t = (z+c)^2*(P/Q) */ r.a = t.a + a0_hi, TRUNC(r.a); r.b = ((a0_hi-r.a) + t.a) + t.b; return (r); /* r = a0 + t */ } static double neg_gam(x) double x; { int sgn = 1; struct Double lg, lsine; double y, z; y = floor(x + .5); if (y == x) /* Negative integer. */ if(!_IEEE) return (infnan(ERANGE)); else return (one/zero); z = fabs(x - y); y = .5*ceil(x); if (y == ceil(y)) sgn = -1; if (z < .25) z = sin(M_PI*z); else z = cos(M_PI*(0.5-z)); /* Special case: G(1-x) = Inf; G(x) may be nonzero. */ if (x < -170) { if (x < -190) return ((double)sgn*tiny*tiny); y = one - x; /* exact: 128 < |x| < 255 */ lg = large_gam(y); lsine = log__D(M_PI/z); /* = TRUNC(log(u)) + small */ lg.a -= lsine.a; /* exact (opposite signs) */ lg.b -= lsine.b; y = -(lg.a + lg.b); z = (y + lg.a) + lg.b; y = exp__D(y, z); if (sgn < 0) y = -y; return (y); } y = one-x; if (one-y == x) y = gamma(y); else /* 1-x is inexact */ y = -x*gamma(-x); if (sgn < 0) y = -y; return (M_PI / (y*z)); } octave-1.1.0/bsd-math/exp__D.c100666 415 17 13516 5341403014 14220 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)exp.c 5.7 (Berkeley) 12/2/92"; #endif /* not lint */ /* EXP(X) * RETURN THE EXPONENTIAL OF X * DOUBLE PRECISION (IEEE 53 bits, VAX D FORMAT 56 BITS) * CODED IN C BY K.C. NG, 1/19/85; * REVISED BY K.C. NG on 2/6/85, 2/15/85, 3/7/85, 3/24/85, 4/16/85, 6/14/86. * * Required system supported functions: * scalb(x,n) * copysign(x,y) * finite(x) * * Method: * 1. Argument Reduction: given the input x, find r and integer k such * that * x = k*ln2 + r, |r| <= 0.5*ln2 . * r will be represented as r := z+c for better accuracy. * * 2. Compute exp(r) by * * exp(r) = 1 + r + r*R1/(2-R1), * where * R1 = x - x^2*(p1+x^2*(p2+x^2*(p3+x^2*(p4+p5*x^2)))). * * 3. exp(x) = 2^k * exp(r) . * * Special cases: * exp(INF) is INF, exp(NaN) is NaN; * exp(-INF)= 0; * for finite argument, only exp(0)=1 is exact. * * Accuracy: * exp(x) returns the exponential of x nearly rounded. In a test run * with 1,156,000 random arguments on a VAX, the maximum observed * error was 0.869 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln2hi, 6.9314718055829871446E-1 ,7217,4031,0000,f7d0, 0, .B17217F7D00000) vc(ln2lo, 1.6465949582897081279E-12 ,bcd5,2ce7,d9cc,e4f1, -39, .E7BCD5E4F1D9CC) vc(lnhuge, 9.4961163736712506989E1 ,ec1d,43bd,9010,a73e, 7, .BDEC1DA73E9010) vc(lntiny,-9.5654310917272452386E1 ,4f01,c3bf,33af,d72e, 7,-.BF4F01D72E33AF) vc(invln2, 1.4426950408889634148E0 ,aa3b,40b8,17f1,295c, 1, .B8AA3B295C17F1) vc(p1, 1.6666666666666602251E-1 ,aaaa,3f2a,a9f1,aaaa, -2, .AAAAAAAAAAA9F1) vc(p2, -2.7777777777015591216E-3 ,0b60,bc36,ec94,b5f5, -8,-.B60B60B5F5EC94) vc(p3, 6.6137563214379341918E-5 ,b355,398a,f15f,792e, -13, .8AB355792EF15F) vc(p4, -1.6533902205465250480E-6 ,ea0e,b6dd,5f84,2e93, -19,-.DDEA0E2E935F84) vc(p5, 4.1381367970572387085E-8 ,bb4b,3431,2683,95f5, -24, .B1BB4B95F52683) #ifdef vccast #define ln2hi vccast(ln2hi) #define ln2lo vccast(ln2lo) #define lnhuge vccast(lnhuge) #define lntiny vccast(lntiny) #define invln2 vccast(invln2) #define p1 vccast(p1) #define p2 vccast(p2) #define p3 vccast(p3) #define p4 vccast(p4) #define p5 vccast(p5) #endif ic(p1, 1.6666666666666601904E-1, -3, 1.555555555553E) ic(p2, -2.7777777777015593384E-3, -9, -1.6C16C16BEBD93) ic(p3, 6.6137563214379343612E-5, -14, 1.1566AAF25DE2C) ic(p4, -1.6533902205465251539E-6, -20, -1.BBD41C5D26BF1) ic(p5, 4.1381367970572384604E-8, -25, 1.6376972BEA4D0) ic(ln2hi, 6.9314718036912381649E-1, -1, 1.62E42FEE00000) ic(ln2lo, 1.9082149292705877000E-10,-33, 1.A39EF35793C76) ic(lnhuge, 7.1602103751842355450E2, 9, 1.6602B15B7ECF2) ic(lntiny,-7.5137154372698068983E2, 9, -1.77AF8EBEAE354) ic(invln2, 1.4426950408889633870E0, 0, 1.71547652B82FE) /* returns exp(r = x + c) for |c| < |x| with no overlap. */ double exp__D(x, c) double x, c; { double z,hi,lo, t; int k; #if !defined(vax)&&!defined(tahoe) if (x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ if ( x <= lnhuge ) { if ( x >= lntiny ) { /* argument reduction : x --> x - k*ln2 */ z = invln2*x; k = z + copysign(.5, x); /* express (x+c)-k*ln2 as hi-lo and let x=hi-lo rounded */ hi=(x-k*ln2hi); /* Exact. */ x= hi - (lo = k*ln2lo-c); /* return 2^k*[1+x+x*c/(2+c)] */ z=x*x; c= x - z*(p1+z*(p2+z*(p3+z*(p4+z*p5)))); c = (x*c)/(2.0-c); return scalb(1.+(hi-(lo - c)), k); } /* end of x > lntiny */ else /* exp(-big#) underflows to zero */ if(finite(x)) return(scalb(1.0,-5000)); /* exp(-INF) is zero */ else return(0.0); } /* end of x < lnhuge */ else /* exp(INF) is INF, exp(+big#) overflows to INF */ return( finite(x) ? scalb(1.0,5000) : x); } octave-1.1.0/bsd-math/j0.c100666 415 17 37237 5341366341 13354 0ustar jweusers/*- * Copyright (c) 1992 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)j0.c 5.5 (Berkeley) 12/16/92"; #endif /* not lint */ /* * 16 December 1992 * Minor modifications by Peter McIlroy to adapt non-IEEE architecture. */ /* * ==================================================== * Copyright (C) 1992 by Sun Microsystems, Inc. * * Developed at SunPro, a Sun Microsystems, Inc. business. * Permission to use, copy, modify, and distribute this * software is freely granted, provided that this notice * is preserved. * ==================================================== * * ******************* WARNING ******************** * This is an alpha version of SunPro's FDLIBM (Freely * Distributable Math Library) for IEEE double precision * arithmetic. FDLIBM is a basic math library written * in C that runs on machines that conform to IEEE * Standard 754/854. This alpha version is distributed * for testing purpose. Those who use this software * should report any bugs to * * fdlibm-comments@sunpro.eng.sun.com * * -- K.C. Ng, Oct 12, 1992 * ************************************************ */ /* double j0(double x), y0(double x) * Bessel function of the first and second kinds of order zero. * Method -- j0(x): * 1. For tiny x, we use j0(x) = 1 - x^2/4 + x^4/64 - ... * 2. Reduce x to |x| since j0(x)=j0(-x), and * for x in (0,2) * j0(x) = 1-z/4+ z^2*R0/S0, where z = x*x; * (precision: |j0-1+z/4-z^2R0/S0 |<2**-63.67 ) * for x in (2,inf) * j0(x) = sqrt(2/(pi*x))*(p0(x)*cos(x0)-q0(x)*sin(x0)) * where x0 = x-pi/4. It is better to compute sin(x0),cos(x0) * as follow: * cos(x0) = cos(x)cos(pi/4)+sin(x)sin(pi/4) * = 1/sqrt(2) * (cos(x) + sin(x)) * sin(x0) = sin(x)cos(pi/4)-cos(x)sin(pi/4) * = 1/sqrt(2) * (sin(x) - cos(x)) * (To avoid cancellation, use * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) * to compute the worse one.) * * 3 Special cases * j0(nan)= nan * j0(0) = 1 * j0(inf) = 0 * * Method -- y0(x): * 1. For x<2. * Since * y0(x) = 2/pi*(j0(x)*(ln(x/2)+Euler) + x^2/4 - ...) * therefore y0(x)-2/pi*j0(x)*ln(x) is an even function. * We use the following function to approximate y0, * y0(x) = U(z)/V(z) + (2/pi)*(j0(x)*ln(x)), z= x^2 * where * U(z) = u0 + u1*z + ... + u6*z^6 * V(z) = 1 + v1*z + ... + v4*z^4 * with absolute approximation error bounded by 2**-72. * Note: For tiny x, U/V = u0 and j0(x)~1, hence * y0(tiny) = u0 + (2/pi)*ln(tiny), (choose tiny<2**-27) * 2. For x>=2. * y0(x) = sqrt(2/(pi*x))*(p0(x)*cos(x0)+q0(x)*sin(x0)) * where x0 = x-pi/4. It is better to compute sin(x0),cos(x0) * by the method mentioned above. * 3. Special cases: y0(0)=-inf, y0(x<0)=NaN, y0(inf)=0. */ #include #include #if defined(vax) || defined(tahoe) #define _IEEE 0 #else #define _IEEE 1 #define infnan(x) (0.0) #endif static double pzero __P((double)), qzero __P((double)); static double huge = 1e300, zero = 0.0, one = 1.0, invsqrtpi= 5.641895835477562869480794515607725858441e-0001, tpi = 0.636619772367581343075535053490057448, /* R0/S0 on [0, 2.00] */ r02 = 1.562499999999999408594634421055018003102e-0002, r03 = -1.899792942388547334476601771991800712355e-0004, r04 = 1.829540495327006565964161150603950916854e-0006, r05 = -4.618326885321032060803075217804816988758e-0009, s01 = 1.561910294648900170180789369288114642057e-0002, s02 = 1.169267846633374484918570613449245536323e-0004, s03 = 5.135465502073181376284426245689510134134e-0007, s04 = 1.166140033337900097836930825478674320464e-0009; double j0(x) double x; { double z, s,c,ss,cc,r,u,v; if (!finite(x)) if (_IEEE) return one/(x*x); else return (0); x = fabs(x); if (x >= 2.0) { /* |x| >= 2.0 */ s = sin(x); c = cos(x); ss = s-c; cc = s+c; if (x < .5 * DBL_MAX) { /* make sure x+x not overflow */ z = -cos(x+x); if ((s*c) 6.80564733841876927e+38) /* 2^129 */ z = (invsqrtpi*cc)/sqrt(x); else { u = pzero(x); v = qzero(x); z = invsqrtpi*(u*cc-v*ss)/sqrt(x); } return z; } if (x < 1.220703125e-004) { /* |x| < 2**-13 */ if (huge+x > one) { /* raise inexact if x != 0 */ if (x < 7.450580596923828125e-009) /* |x|<2**-27 */ return one; else return (one - 0.25*x*x); } } z = x*x; r = z*(r02+z*(r03+z*(r04+z*r05))); s = one+z*(s01+z*(s02+z*(s03+z*s04))); if (x < one) { /* |x| < 1.00 */ return (one + z*(-0.25+(r/s))); } else { u = 0.5*x; return ((one+u)*(one-u)+z*(r/s)); } } static double u00 = -7.380429510868722527422411862872999615628e-0002, u01 = 1.766664525091811069896442906220827182707e-0001, u02 = -1.381856719455968955440002438182885835344e-0002, u03 = 3.474534320936836562092566861515617053954e-0004, u04 = -3.814070537243641752631729276103284491172e-0006, u05 = 1.955901370350229170025509706510038090009e-0008, u06 = -3.982051941321034108350630097330144576337e-0011, v01 = 1.273048348341237002944554656529224780561e-0002, v02 = 7.600686273503532807462101309675806839635e-0005, v03 = 2.591508518404578033173189144579208685163e-0007, v04 = 4.411103113326754838596529339004302243157e-0010; double y0(x) double x; { double z, s,c,ss,cc,u,v,j0(); /* Y0(NaN) is NaN, y0(-inf) is Nan, y0(inf) is 0 */ if (!finite(x)) if (_IEEE) return (one/(x+x*x)); else return (0); if (x == 0) if (_IEEE) return (-one/zero); else return(infnan(-ERANGE)); if (x<0) if (_IEEE) return (zero/zero); else return (infnan(EDOM)); if (x >= 2.00) { /* |x| >= 2.0 */ /* y0(x) = sqrt(2/(pi*x))*(p0(x)*sin(x0)+q0(x)*cos(x0)) * where x0 = x-pi/4 * Better formula: * cos(x0) = cos(x)cos(pi/4)+sin(x)sin(pi/4) * = 1/sqrt(2) * (sin(x) + cos(x)) * sin(x0) = sin(x)cos(3pi/4)-cos(x)sin(3pi/4) * = 1/sqrt(2) * (sin(x) - cos(x)) * To avoid cancellation, use * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) * to compute the worse one. */ s = sin(x); c = cos(x); ss = s-c; cc = s+c; /* * j0(x) = 1/sqrt(pi) * (P(0,x)*cc - Q(0,x)*ss) / sqrt(x) * y0(x) = 1/sqrt(pi) * (P(0,x)*ss + Q(0,x)*cc) / sqrt(x) */ if (x < .5 * DBL_MAX) { /* make sure x+x not overflow */ z = -cos(x+x); if ((s*c) 6.80564733841876927e+38) /* > 2^129 */ z = (invsqrtpi*ss)/sqrt(x); else { u = pzero(x); v = qzero(x); z = invsqrtpi*(u*ss+v*cc)/sqrt(x); } return z; } if (x <= 7.450580596923828125e-009) { /* x < 2**-27 */ return (u00 + tpi*log(x)); } z = x*x; u = u00+z*(u01+z*(u02+z*(u03+z*(u04+z*(u05+z*u06))))); v = one+z*(v01+z*(v02+z*(v03+z*v04))); return (u/v + tpi*(j0(x)*log(x))); } /* The asymptotic expansions of pzero is * 1 - 9/128 s^2 + 11025/98304 s^4 - ..., where s = 1/x. * For x >= 2, We approximate pzero by * pzero(x) = 1 + (R/S) * where R = pr0 + pr1*s^2 + pr2*s^4 + ... + pr5*s^10 * S = 1 + ps0*s^2 + ... + ps4*s^10 * and * | pzero(x)-1-R/S | <= 2 ** ( -60.26) */ static double pr8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 0.0, -7.031249999999003994151563066182798210142e-0002, -8.081670412753498508883963849859423939871e+0000, -2.570631056797048755890526455854482662510e+0002, -2.485216410094288379417154382189125598962e+0003, -5.253043804907295692946647153614119665649e+0003, }; static double ps8[5] = { 1.165343646196681758075176077627332052048e+0002, 3.833744753641218451213253490882686307027e+0003, 4.059785726484725470626341023967186966531e+0004, 1.167529725643759169416844015694440325519e+0005, 4.762772841467309430100106254805711722972e+0004, }; static double pr5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ -1.141254646918944974922813501362824060117e-0011, -7.031249408735992804117367183001996028304e-0002, -4.159610644705877925119684455252125760478e+0000, -6.767476522651671942610538094335912346253e+0001, -3.312312996491729755731871867397057689078e+0002, -3.464333883656048910814187305901796723256e+0002, }; static double ps5[5] = { 6.075393826923003305967637195319271932944e+0001, 1.051252305957045869801410979087427910437e+0003, 5.978970943338558182743915287887408780344e+0003, 9.625445143577745335793221135208591603029e+0003, 2.406058159229391070820491174867406875471e+0003, }; static double pr3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ -2.547046017719519317420607587742992297519e-0009, -7.031196163814817199050629727406231152464e-0002, -2.409032215495295917537157371488126555072e+0000, -2.196597747348830936268718293366935843223e+0001, -5.807917047017375458527187341817239891940e+0001, -3.144794705948885090518775074177485744176e+0001, }; static double ps3[5] = { 3.585603380552097167919946472266854507059e+0001, 3.615139830503038919981567245265266294189e+0002, 1.193607837921115243628631691509851364715e+0003, 1.127996798569074250675414186814529958010e+0003, 1.735809308133357510239737333055228118910e+0002, }; static double pr2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ -8.875343330325263874525704514800809730145e-0008, -7.030309954836247756556445443331044338352e-0002, -1.450738467809529910662233622603401167409e+0000, -7.635696138235277739186371273434739292491e+0000, -1.119316688603567398846655082201614524650e+0001, -3.233645793513353260006821113608134669030e+0000, }; static double ps2[5] = { 2.222029975320888079364901247548798910952e+0001, 1.362067942182152109590340823043813120940e+0002, 2.704702786580835044524562897256790293238e+0002, 1.538753942083203315263554770476850028583e+0002, 1.465761769482561965099880599279699314477e+0001, }; static double pzero(x) double x; { double *p,*q,z,r,s; if (x >= 8.00) {p = pr8; q= ps8;} else if (x >= 4.54545211791992188) {p = pr5; q= ps5;} else if (x >= 2.85714149475097656) {p = pr3; q= ps3;} else if (x >= 2.00) {p = pr2; q= ps2;} z = one/(x*x); r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*q[4])))); return one+ r/s; } /* For x >= 8, the asymptotic expansions of qzero is * -1/8 s + 75/1024 s^3 - ..., where s = 1/x. * We approximate pzero by * qzero(x) = s*(-1.25 + (R/S)) * where R = qr0 + qr1*s^2 + qr2*s^4 + ... + qr5*s^10 * S = 1 + qs0*s^2 + ... + qs5*s^12 * and * | qzero(x)/s +1.25-R/S | <= 2 ** ( -61.22) */ static double qr8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 0.0, 7.324218749999350414479738504551775297096e-0002, 1.176820646822526933903301695932765232456e+0001, 5.576733802564018422407734683549251364365e+0002, 8.859197207564685717547076568608235802317e+0003, 3.701462677768878501173055581933725704809e+0004, }; static double qs8[6] = { 1.637760268956898345680262381842235272369e+0002, 8.098344946564498460163123708054674227492e+0003, 1.425382914191204905277585267143216379136e+0005, 8.033092571195144136565231198526081387047e+0005, 8.405015798190605130722042369969184811488e+0005, -3.438992935378666373204500729736454421006e+0005, }; static double qr5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 1.840859635945155400568380711372759921179e-0011, 7.324217666126847411304688081129741939255e-0002, 5.835635089620569401157245917610984757296e+0000, 1.351115772864498375785526599119895942361e+0002, 1.027243765961641042977177679021711341529e+0003, 1.989977858646053872589042328678602481924e+0003, }; static double qs5[6] = { 8.277661022365377058749454444343415524509e+0001, 2.077814164213929827140178285401017305309e+0003, 1.884728877857180787101956800212453218179e+0004, 5.675111228949473657576693406600265778689e+0004, 3.597675384251145011342454247417399490174e+0004, -5.354342756019447546671440667961399442388e+0003, }; static double qr3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 4.377410140897386263955149197672576223054e-0009, 7.324111800429115152536250525131924283018e-0002, 3.344231375161707158666412987337679317358e+0000, 4.262184407454126175974453269277100206290e+0001, 1.708080913405656078640701512007621675724e+0002, 1.667339486966511691019925923456050558293e+0002, }; static double qs3[6] = { 4.875887297245871932865584382810260676713e+0001, 7.096892210566060535416958362640184894280e+0002, 3.704148226201113687434290319905207398682e+0003, 6.460425167525689088321109036469797462086e+0003, 2.516333689203689683999196167394889715078e+0003, -1.492474518361563818275130131510339371048e+0002, }; static double qr2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 1.504444448869832780257436041633206366087e-0007, 7.322342659630792930894554535717104926902e-0002, 1.998191740938159956838594407540292600331e+0000, 1.449560293478857407645853071687125850962e+0001, 3.166623175047815297062638132537957315395e+0001, 1.625270757109292688799540258329430963726e+0001, }; static double qs2[6] = { 3.036558483552191922522729838478169383969e+0001, 2.693481186080498724211751445725708524507e+0002, 8.447837575953201460013136756723746023736e+0002, 8.829358451124885811233995083187666981299e+0002, 2.126663885117988324180482985363624996652e+0002, -5.310954938826669402431816125780738924463e+0000, }; static double qzero(x) double x; { double *p,*q, s,r,z; if (x >= 8.00) {p = qr8; q= qs8;} else if (x >= 4.54545211791992188) {p = qr5; q= qs5;} else if (x >= 2.85714149475097656) {p = qr3; q= qs3;} else if (x >= 2.00) {p = qr2; q= qs2;} z = one/(x*x); r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*(q[4]+z*q[5]))))); return (-.125 + r/s)/x; } octave-1.1.0/bsd-math/j1.c100666 415 17 37261 5341366342 13353 0ustar jweusers/*- * Copyright (c) 1992 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)j1.c 5.5 (Berkeley) 12/16/92"; #endif /* not lint */ /* * 16 December 1992 * Minor modifications by Peter McIlroy to adapt non-IEEE architecture. */ /* * ==================================================== * Copyright (C) 1992 by Sun Microsystems, Inc. * * Developed at SunPro, a Sun Microsystems, Inc. business. * Permission to use, copy, modify, and distribute this * software is freely granted, provided that this notice * is preserved. * ==================================================== * * ******************* WARNING ******************** * This is an alpha version of SunPro's FDLIBM (Freely * Distributable Math Library) for IEEE double precision * arithmetic. FDLIBM is a basic math library written * in C that runs on machines that conform to IEEE * Standard 754/854. This alpha version is distributed * for testing purpose. Those who use this software * should report any bugs to * * fdlibm-comments@sunpro.eng.sun.com * * -- K.C. Ng, Oct 12, 1992 * ************************************************ */ /* double j1(double x), y1(double x) * Bessel function of the first and second kinds of order zero. * Method -- j1(x): * 1. For tiny x, we use j1(x) = x/2 - x^3/16 + x^5/384 - ... * 2. Reduce x to |x| since j1(x)=-j1(-x), and * for x in (0,2) * j1(x) = x/2 + x*z*R0/S0, where z = x*x; * (precision: |j1/x - 1/2 - R0/S0 |<2**-61.51 ) * for x in (2,inf) * j1(x) = sqrt(2/(pi*x))*(p1(x)*cos(x1)-q1(x)*sin(x1)) * y1(x) = sqrt(2/(pi*x))*(p1(x)*sin(x1)+q1(x)*cos(x1)) * where x1 = x-3*pi/4. It is better to compute sin(x1),cos(x1) * as follows: * cos(x1) = cos(x)cos(3pi/4)+sin(x)sin(3pi/4) * = 1/sqrt(2) * (sin(x) - cos(x)) * sin(x1) = sin(x)cos(3pi/4)-cos(x)sin(3pi/4) * = -1/sqrt(2) * (sin(x) + cos(x)) * (To avoid cancellation, use * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) * to compute the worse one.) * * 3 Special cases * j1(nan)= nan * j1(0) = 0 * j1(inf) = 0 * * Method -- y1(x): * 1. screen out x<=0 cases: y1(0)=-inf, y1(x<0)=NaN * 2. For x<2. * Since * y1(x) = 2/pi*(j1(x)*(ln(x/2)+Euler)-1/x-x/2+5/64*x^3-...) * therefore y1(x)-2/pi*j1(x)*ln(x)-1/x is an odd function. * We use the following function to approximate y1, * y1(x) = x*U(z)/V(z) + (2/pi)*(j1(x)*ln(x)-1/x), z= x^2 * where for x in [0,2] (abs err less than 2**-65.89) * U(z) = u0 + u1*z + ... + u4*z^4 * V(z) = 1 + v1*z + ... + v5*z^5 * Note: For tiny x, 1/x dominate y1 and hence * y1(tiny) = -2/pi/tiny, (choose tiny<2**-54) * 3. For x>=2. * y1(x) = sqrt(2/(pi*x))*(p1(x)*sin(x1)+q1(x)*cos(x1)) * where x1 = x-3*pi/4. It is better to compute sin(x1),cos(x1) * by method mentioned above. */ #include #include #if defined(vax) || defined(tahoe) #define _IEEE 0 #else #define _IEEE 1 #define infnan(x) (0.0) #endif static double pone(), qone(); static double huge = 1e300, zero = 0.0, one = 1.0, invsqrtpi= 5.641895835477562869480794515607725858441e-0001, tpi = 0.636619772367581343075535053490057448, /* R0/S0 on [0,2] */ r00 = -6.250000000000000020842322918309200910191e-0002, r01 = 1.407056669551897148204830386691427791200e-0003, r02 = -1.599556310840356073980727783817809847071e-0005, r03 = 4.967279996095844750387702652791615403527e-0008, s01 = 1.915375995383634614394860200531091839635e-0002, s02 = 1.859467855886309024045655476348872850396e-0004, s03 = 1.177184640426236767593432585906758230822e-0006, s04 = 5.046362570762170559046714468225101016915e-0009, s05 = 1.235422744261379203512624973117299248281e-0011; #define two_129 6.80564733841876926e+038 /* 2^129 */ #define two_m54 5.55111512312578270e-017 /* 2^-54 */ double j1(x) double x; { double z, s,c,ss,cc,r,u,v,y; y = fabs(x); if (!finite(x)) /* Inf or NaN */ if (_IEEE && x != x) return(x); else return (copysign(x, zero)); y = fabs(x); if (y >= 2) /* |x| >= 2.0 */ { s = sin(y); c = cos(y); ss = -s-c; cc = s-c; if (y < .5*DBL_MAX) { /* make sure y+y not overflow */ z = cos(y+y); if ((s*c) two_129) /* x > 2^129 */ z = (invsqrtpi*cc)/sqrt(y); else #endif /* defined(vax) || defined(tahoe) */ { u = pone(y); v = qone(y); z = invsqrtpi*(u*cc-v*ss)/sqrt(y); } if (x < 0) return -z; else return z; } if (y < 7.450580596923828125e-009) { /* |x|<2**-27 */ if(huge+x>one) return 0.5*x;/* inexact if x!=0 necessary */ } z = x*x; r = z*(r00+z*(r01+z*(r02+z*r03))); s = one+z*(s01+z*(s02+z*(s03+z*(s04+z*s05)))); r *= x; return (x*0.5+r/s); } static double u0[5] = { -1.960570906462389484206891092512047539632e-0001, 5.044387166398112572026169863174882070274e-0002, -1.912568958757635383926261729464141209569e-0003, 2.352526005616105109577368905595045204577e-0005, -9.190991580398788465315411784276789663849e-0008, }; static double v0[5] = { 1.991673182366499064031901734535479833387e-0002, 2.025525810251351806268483867032781294682e-0004, 1.356088010975162198085369545564475416398e-0006, 6.227414523646214811803898435084697863445e-0009, 1.665592462079920695971450872592458916421e-0011, }; double y1(x) double x; { double z, s,c,ss,cc,u,v,j1(); /* if Y1(NaN) is NaN, Y1(-inf) is NaN, Y1(inf) is 0 */ if (!finite(x)) if (!_IEEE) return (infnan(EDOM)); else if (x < 0) return(zero/zero); else if (x > 0) return (0); else return(x); if (x <= 0) { if (_IEEE && x == 0) return -one/zero; else if(x == 0) return(infnan(-ERANGE)); else if(_IEEE) return (zero/zero); else return(infnan(EDOM)); } if (x >= 2) /* |x| >= 2.0 */ { s = sin(x); c = cos(x); ss = -s-c; cc = s-c; if (x < .5 * DBL_MAX) /* make sure x+x not overflow */ { z = cos(x+x); if ((s*c)>zero) cc = z/ss; else ss = z/cc; } /* y1(x) = sqrt(2/(pi*x))*(p1(x)*sin(x0)+q1(x)*cos(x0)) * where x0 = x-3pi/4 * Better formula: * cos(x0) = cos(x)cos(3pi/4)+sin(x)sin(3pi/4) * = 1/sqrt(2) * (sin(x) - cos(x)) * sin(x0) = sin(x)cos(3pi/4)-cos(x)sin(3pi/4) * = -1/sqrt(2) * (cos(x) + sin(x)) * To avoid cancellation, use * sin(x) +- cos(x) = -cos(2x)/(sin(x) -+ cos(x)) * to compute the worse one. */ if (_IEEE && x>two_129) z = (invsqrtpi*ss)/sqrt(x); else { u = pone(x); v = qone(x); z = invsqrtpi*(u*ss+v*cc)/sqrt(x); } return z; } if (x <= two_m54) { /* x < 2**-54 */ return (-tpi/x); } z = x*x; u = u0[0]+z*(u0[1]+z*(u0[2]+z*(u0[3]+z*u0[4]))); v = one+z*(v0[0]+z*(v0[1]+z*(v0[2]+z*(v0[3]+z*v0[4])))); return (x*(u/v) + tpi*(j1(x)*log(x)-one/x)); } /* For x >= 8, the asymptotic expansions of pone is * 1 + 15/128 s^2 - 4725/2^15 s^4 - ..., where s = 1/x. * We approximate pone by * pone(x) = 1 + (R/S) * where R = pr0 + pr1*s^2 + pr2*s^4 + ... + pr5*s^10 * S = 1 + ps0*s^2 + ... + ps4*s^10 * and * | pone(x)-1-R/S | <= 2 ** ( -60.06) */ static double pr8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 0.0, 1.171874999999886486643746274751925399540e-0001, 1.323948065930735690925827997575471527252e+0001, 4.120518543073785433325860184116512799375e+0002, 3.874745389139605254931106878336700275601e+0003, 7.914479540318917214253998253147871806507e+0003, }; static double ps8[5] = { 1.142073703756784104235066368252692471887e+0002, 3.650930834208534511135396060708677099382e+0003, 3.695620602690334708579444954937638371808e+0004, 9.760279359349508334916300080109196824151e+0004, 3.080427206278887984185421142572315054499e+0004, }; static double pr5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ 1.319905195562435287967533851581013807103e-0011, 1.171874931906140985709584817065144884218e-0001, 6.802751278684328781830052995333841452280e+0000, 1.083081829901891089952869437126160568246e+0002, 5.176361395331997166796512844100442096318e+0002, 5.287152013633375676874794230748055786553e+0002, }; static double ps5[5] = { 5.928059872211313557747989128353699746120e+0001, 9.914014187336144114070148769222018425781e+0002, 5.353266952914879348427003712029704477451e+0003, 7.844690317495512717451367787640014588422e+0003, 1.504046888103610723953792002716816255382e+0003, }; static double pr3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ 3.025039161373736032825049903408701962756e-0009, 1.171868655672535980750284752227495879921e-0001, 3.932977500333156527232725812363183251138e+0000, 3.511940355916369600741054592597098912682e+0001, 9.105501107507812029367749771053045219094e+0001, 4.855906851973649494139275085628195457113e+0001, }; static double ps3[5] = { 3.479130950012515114598605916318694946754e+0001, 3.367624587478257581844639171605788622549e+0002, 1.046871399757751279180649307467612538415e+0003, 8.908113463982564638443204408234739237639e+0002, 1.037879324396392739952487012284401031859e+0002, }; static double pr2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ 1.077108301068737449490056513753865482831e-0007, 1.171762194626833490512746348050035171545e-0001, 2.368514966676087902251125130227221462134e+0000, 1.224261091482612280835153832574115951447e+0001, 1.769397112716877301904532320376586509782e+0001, 5.073523125888185399030700509321145995160e+0000, }; static double ps2[5] = { 2.143648593638214170243114358933327983793e+0001, 1.252902271684027493309211410842525120355e+0002, 2.322764690571628159027850677565128301361e+0002, 1.176793732871470939654351793502076106651e+0002, 8.364638933716182492500902115164881195742e+0000, }; static double pone(x) double x; { double *p,*q,z,r,s; if (x >= 8.0) {p = pr8; q= ps8;} else if (x >= 4.54545211791992188) {p = pr5; q= ps5;} else if (x >= 2.85714149475097656) {p = pr3; q= ps3;} else /* if (x >= 2.0) */ {p = pr2; q= ps2;} z = one/(x*x); r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*q[4])))); return (one + r/s); } /* For x >= 8, the asymptotic expansions of qone is * 3/8 s - 105/1024 s^3 - ..., where s = 1/x. * We approximate pone by * qone(x) = s*(0.375 + (R/S)) * where R = qr1*s^2 + qr2*s^4 + ... + qr5*s^10 * S = 1 + qs1*s^2 + ... + qs6*s^12 * and * | qone(x)/s -0.375-R/S | <= 2 ** ( -61.13) */ static double qr8[6] = { /* for x in [inf, 8]=1/[0,0.125] */ 0.0, -1.025390624999927207385863635575804210817e-0001, -1.627175345445899724355852152103771510209e+0001, -7.596017225139501519843072766973047217159e+0002, -1.184980667024295901645301570813228628541e+0004, -4.843851242857503225866761992518949647041e+0004, }; static double qs8[6] = { 1.613953697007229231029079421446916397904e+0002, 7.825385999233484705298782500926834217525e+0003, 1.338753362872495800748094112937868089032e+0005, 7.196577236832409151461363171617204036929e+0005, 6.666012326177764020898162762642290294625e+0005, -2.944902643038346618211973470809456636830e+0005, }; static double qr5[6] = { /* for x in [8,4.5454]=1/[0.125,0.22001] */ -2.089799311417640889742251585097264715678e-0011, -1.025390502413754195402736294609692303708e-0001, -8.056448281239359746193011295417408828404e+0000, -1.836696074748883785606784430098756513222e+0002, -1.373193760655081612991329358017247355921e+0003, -2.612444404532156676659706427295870995743e+0003, }; static double qs5[6] = { 8.127655013843357670881559763225310973118e+0001, 1.991798734604859732508048816860471197220e+0003, 1.746848519249089131627491835267411777366e+0004, 4.985142709103522808438758919150738000353e+0004, 2.794807516389181249227113445299675335543e+0004, -4.719183547951285076111596613593553911065e+0003, }; static double qr3[6] = {/* for x in [4.547,2.8571]=1/[0.2199,0.35001] */ -5.078312264617665927595954813341838734288e-0009, -1.025378298208370901410560259001035577681e-0001, -4.610115811394734131557983832055607679242e+0000, -5.784722165627836421815348508816936196402e+0001, -2.282445407376317023842545937526967035712e+0002, -2.192101284789093123936441805496580237676e+0002, }; static double qs3[6] = { 4.766515503237295155392317984171640809318e+0001, 6.738651126766996691330687210949984203167e+0002, 3.380152866795263466426219644231687474174e+0003, 5.547729097207227642358288160210745890345e+0003, 1.903119193388108072238947732674639066045e+0003, -1.352011914443073322978097159157678748982e+0002, }; static double qr2[6] = {/* for x in [2.8570,2]=1/[0.3499,0.5] */ -1.783817275109588656126772316921194887979e-0007, -1.025170426079855506812435356168903694433e-0001, -2.752205682781874520495702498875020485552e+0000, -1.966361626437037351076756351268110418862e+0001, -4.232531333728305108194363846333841480336e+0001, -2.137192117037040574661406572497288723430e+0001, }; static double qs2[6] = { 2.953336290605238495019307530224241335502e+0001, 2.529815499821905343698811319455305266409e+0002, 7.575028348686454070022561120722815892346e+0002, 7.393932053204672479746835719678434981599e+0002, 1.559490033366661142496448853793707126179e+0002, -4.959498988226281813825263003231704397158e+0000, }; static double qone(x) double x; { double *p,*q, s,r,z; if (x >= 8.0) {p = qr8; q= qs8;} else if (x >= 4.54545211791992188) {p = qr5; q= qs5;} else if (x >= 2.85714149475097656) {p = qr3; q= qs3;} else /* if (x >= 2.0) */ {p = qr2; q= qs2;} z = one/(x*x); r = p[0]+z*(p[1]+z*(p[2]+z*(p[3]+z*(p[4]+z*p[5])))); s = one+z*(q[0]+z*(q[1]+z*(q[2]+z*(q[3]+z*(q[4]+z*q[5]))))); return (.375 + r/s)/x; } octave-1.1.0/bsd-math/jn.c100666 415 17 22147 5341366342 13445 0ustar jweusers/*- * Copyright (c) 1992 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)jn.c 5.5 (Berkeley) 12/16/92"; #endif /* not lint */ /* * 16 December 1992 * Minor modifications by Peter McIlroy to adapt non-IEEE architecture. */ /* * ==================================================== * Copyright (C) 1992 by Sun Microsystems, Inc. * * Developed at SunPro, a Sun Microsystems, Inc. business. * Permission to use, copy, modify, and distribute this * software is freely granted, provided that this notice * is preserved. * ==================================================== * * ******************* WARNING ******************** * This is an alpha version of SunPro's FDLIBM (Freely * Distributable Math Library) for IEEE double precision * arithmetic. FDLIBM is a basic math library written * in C that runs on machines that conform to IEEE * Standard 754/854. This alpha version is distributed * for testing purpose. Those who use this software * should report any bugs to * * fdlibm-comments@sunpro.eng.sun.com * * -- K.C. Ng, Oct 12, 1992 * ************************************************ */ /* * jn(int n, double x), yn(int n, double x) * floating point Bessel's function of the 1st and 2nd kind * of order n * * Special cases: * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal; * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal. * Note 2. About jn(n,x), yn(n,x) * For n=0, j0(x) is called, * for n=1, j1(x) is called, * for nx, a continued fraction approximation to * j(n,x)/j(n-1,x) is evaluated and then backward * recursion is used starting from a supposed value * for j(n,x). The resulting value of j(0,x) is * compared with the actual value to correct the * supposed value of j(n,x). * * yn(n,x) is similar in all respects, except * that forward recursion is used for all * values of n>1. * */ #include #include #include #if defined(vax) || defined(tahoe) #define _IEEE 0 #else #define _IEEE 1 #define infnan(x) (0.0) #endif extern double j0(),j1(),log(),fabs(),sqrt(),cos(),sin(),y0(),y1(); static double invsqrtpi= 5.641895835477562869480794515607725858441e-0001, two = 2.0, zero = 0.0, one = 1.0; double jn(n,x) int n; double x; { int i, sgn; double a, b, temp; double z, w; /* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x) * Thus, J(-n,x) = J(n,-x) */ /* if J(n,NaN) is NaN */ if (_IEEE && isnan(x)) return x+x; if (n<0){ n = -n; x = -x; } if (n==0) return(j0(x)); if (n==1) return(j1(x)); sgn = (n&1)&(x < zero); /* even n -- 0, odd n -- sign(x) */ x = fabs(x); if (x == 0 || !finite (x)) /* if x is 0 or inf */ b = zero; else if ((double) n <= x) { /* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */ if (_IEEE && x >= 8.148143905337944345e+090) { /* x >= 2**302 */ /* (x >> n**2) * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi) * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi) * Let s=sin(x), c=cos(x), * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then * * n sin(xn)*sqt2 cos(xn)*sqt2 * ---------------------------------- * 0 s-c c+s * 1 -s-c -c+s * 2 -s+c -c-s * 3 s+c c-s */ switch(n&3) { case 0: temp = cos(x)+sin(x); break; case 1: temp = -cos(x)+sin(x); break; case 2: temp = -cos(x)-sin(x); break; case 3: temp = cos(x)-sin(x); break; } b = invsqrtpi*temp/sqrt(x); } else { a = j0(x); b = j1(x); for(i=1;i 33) /* underflow */ b = zero; else { temp = x*0.5; b = temp; for (a=one,i=2;i<=n;i++) { a *= (double)i; /* a = n! */ b *= temp; /* b = (x/2)^n */ } b = b/a; } } else { /* use backward recurrence */ /* x x^2 x^2 * J(n,x)/J(n-1,x) = ---- ------ ------ ..... * 2n - 2(n+1) - 2(n+2) * * 1 1 1 * (for large x) = ---- ------ ------ ..... * 2n 2(n+1) 2(n+2) * -- - ------ - ------ - * x x x * * Let w = 2n/x and h=2/x, then the above quotient * is equal to the continued fraction: * 1 * = ----------------------- * 1 * w - ----------------- * 1 * w+h - --------- * w+2h - ... * * To determine how many terms needed, let * Q(0) = w, Q(1) = w(w+h) - 1, * Q(k) = (w+k*h)*Q(k-1) - Q(k-2), * When Q(k) > 1e4 good for single * When Q(k) > 1e9 good for double * When Q(k) > 1e17 good for quadruple */ /* determine k */ double t,v; double q0,q1,h,tmp; int k,m; w = (n+n)/(double)x; h = 2.0/(double)x; q0 = w; z = w+h; q1 = w*z - 1.0; k=1; while (q1<1.0e9) { k += 1; z += h; tmp = z*q1 - q0; q0 = q1; q1 = tmp; } m = n+n; for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t); a = t; b = one; /* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n) * Hence, if n*(log(2n/x)) > ... * single 8.8722839355e+01 * double 7.09782712893383973096e+02 * long double 1.1356523406294143949491931077970765006170e+04 * then recurrent value may overflow and the result will * likely underflow to zero */ tmp = n; v = two/x; tmp = tmp*log(fabs(v*tmp)); for (i=n-1;i>0;i--){ temp = b; b = ((i+i)/x)*b - a; a = temp; /* scale b to avoid spurious overflow */ # if defined(vax) || defined(tahoe) # define BMAX 1e13 # else # define BMAX 1e100 # endif /* defined(vax) || defined(tahoe) */ if (b > BMAX) { a /= b; t /= b; b = one; } } b = (t*j0(x)/b); } } return ((sgn == 1) ? -b : b); } double yn(n,x) int n; double x; { int i, sign; double a, b, temp; /* Y(n,NaN), Y(n, x < 0) is NaN */ if (x <= 0 || (_IEEE && x != x)) if (_IEEE && x < 0) return zero/zero; else if (x < 0) return (infnan(EDOM)); else if (_IEEE) return -one/zero; else return(infnan(-ERANGE)); else if (!finite(x)) return(0); sign = 1; if (n<0){ n = -n; sign = 1 - ((n&1)<<2); } if (n == 0) return(y0(x)); if (n == 1) return(sign*y1(x)); if(_IEEE && x >= 8.148143905337944345e+090) { /* x > 2**302 */ /* (x >> n**2) * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi) * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi) * Let s=sin(x), c=cos(x), * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then * * n sin(xn)*sqt2 cos(xn)*sqt2 * ---------------------------------- * 0 s-c c+s * 1 -s-c -c+s * 2 -s+c -c-s * 3 s+c c-s */ switch (n&3) { case 0: temp = sin(x)-cos(x); break; case 1: temp = -sin(x)-cos(x); break; case 2: temp = -sin(x)+cos(x); break; case 3: temp = sin(x)+cos(x); break; } b = invsqrtpi*temp/sqrt(x); } else { a = y0(x); b = y1(x); /* quit if b is -inf */ for (i = 1; i < n && !finite(b); i++){ temp = b; b = ((double)(i+i)/x)*b - a; a = temp; } } if (!_IEEE && !finite(b)) return (infnan(-sign * ERANGE)); return ((sign > 0) ? b : -b); } octave-1.1.0/bsd-math/lgamma.c100666 415 17 20540 5341366343 14270 0ustar jweusers/*- * Copyright (c) 1992 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)lgamma.c 5.11 (Berkeley) 12/16/92"; #endif /* not lint */ /* * Coded by Peter McIlroy, Nov 1992; * * The financial support of UUNET Communications Services is greatfully * acknowledged. */ #include #include #include "mathimpl.h" /* Log gamma function. * Error: x > 0 error < 1.3ulp. * x > 4, error < 1ulp. * x > 9, error < .6ulp. * x < 0, all bets are off. (When G(x) ~ 1, log(G(x)) ~ 0) * Method: * x > 6: * Use the asymptotic expansion (Stirling's Formula) * 0 < x < 6: * Use gamma(x+1) = x*gamma(x) for argument reduction. * Use rational approximation in * the range 1.2, 2.5 * Two approximations are used, one centered at the * minimum to ensure monotonicity; one centered at 2 * to maintain small relative error. * x < 0: * Use the reflection formula, * G(1-x)G(x) = PI/sin(PI*x) * Special values: * non-positive integer returns +Inf. * NaN returns NaN */ static int endian; #if defined(vax) || defined(tahoe) #define _IEEE 0 /* double and float have same size exponent field */ #define TRUNC(x) x = (double) (float) (x) #else #define _IEEE 1 #define TRUNC(x) *(((int *) &x) + endian) &= 0xf8000000 #define infnan(x) 0.0 #endif extern double log1p(double); static double small_lgam(double); static double large_lgam(double); static double neg_lgam(double); static double zero = 0.0, one = 1.0; int signgam; #define UNDERFL (1e-1020 * 1e-1020) #define LEFT (1.0 - (x0 + .25)) #define RIGHT (x0 - .218) /* /* Constants for approximation in [1.244,1.712] */ #define x0 0.461632144968362356785 #define x0_lo -.000000000000000015522348162858676890521 #define a0_hi -0.12148629128932952880859 #define a0_lo .0000000007534799204229502 #define r0 -2.771227512955130520e-002 #define r1 -2.980729795228150847e-001 #define r2 -3.257411333183093394e-001 #define r3 -1.126814387531706041e-001 #define r4 -1.129130057170225562e-002 #define r5 -2.259650588213369095e-005 #define s0 1.714457160001714442e+000 #define s1 2.786469504618194648e+000 #define s2 1.564546365519179805e+000 #define s3 3.485846389981109850e-001 #define s4 2.467759345363656348e-002 /* * Constants for approximation in [1.71, 2.5] */ #define a1_hi 4.227843350984671344505727574870e-01 #define a1_lo 4.670126436531227189e-18 #define p0 3.224670334241133695662995251041e-01 #define p1 3.569659696950364669021382724168e-01 #define p2 1.342918716072560025853732668111e-01 #define p3 1.950702176409779831089963408886e-02 #define p4 8.546740251667538090796227834289e-04 #define q0 1.000000000000000444089209850062e+00 #define q1 1.315850076960161985084596381057e+00 #define q2 6.274644311862156431658377186977e-01 #define q3 1.304706631926259297049597307705e-01 #define q4 1.102815279606722369265536798366e-02 #define q5 2.512690594856678929537585620579e-04 #define q6 -1.003597548112371003358107325598e-06 /* * Stirling's Formula, adjusted for equal-ripple. x in [6,Inf]. */ #define lns2pi .418938533204672741780329736405 #define pb0 8.33333333333333148296162562474e-02 #define pb1 -2.77777777774548123579378966497e-03 #define pb2 7.93650778754435631476282786423e-04 #define pb3 -5.95235082566672847950717262222e-04 #define pb4 8.41428560346653702135821806252e-04 #define pb5 -1.89773526463879200348872089421e-03 #define pb6 5.69394463439411649408050664078e-03 #define pb7 -1.44705562421428915453880392761e-02 double lgamma(double x) { double r; signgam = 1; endian = ((*(int *) &one)) ? 1 : 0; if (!finite(x)) if (_IEEE) return (x+x); else return (infnan(EDOM)); if (x > 6 + RIGHT) { r = large_lgam(x); return (r); } else if (x > 1e-16) return (small_lgam(x)); else if (x > -1e-16) { if (x < 0) signgam = -1, x = -x; return (-log(x)); } else return (neg_lgam(x)); } static double large_lgam(double x) { double z, p, x1; int i; struct Double t, u, v; u = log__D(x); u.a -= 1.0; if (x > 1e15) { v.a = x - 0.5; TRUNC(v.a); v.b = (x - v.a) - 0.5; t.a = u.a*v.a; t.b = x*u.b + v.b*u.a; if (_IEEE == 0 && !finite(t.a)) return(infnan(ERANGE)); return(t.a + t.b); } x1 = 1./x; z = x1*x1; p = pb0+z*(pb1+z*(pb2+z*(pb3+z*(pb4+z*(pb5+z*(pb6+z*pb7)))))); /* error in approximation = 2.8e-19 */ p = p*x1; /* error < 2.3e-18 absolute */ /* 0 < p < 1/64 (at x = 5.5) */ v.a = x = x - 0.5; TRUNC(v.a); /* truncate v.a to 26 bits. */ v.b = x - v.a; t.a = v.a*u.a; /* t = (x-.5)*(log(x)-1) */ t.b = v.b*u.a + x*u.b; t.b += p; t.b += lns2pi; /* return t + lns2pi + p */ return (t.a + t.b); } static double small_lgam(double x) { int x_int; double y, z, t, r = 0, p, q, hi, lo; struct Double rr; x_int = (x + .5); y = x - x_int; if (x_int <= 2 && y > RIGHT) { t = y - x0; y--; x_int++; goto CONTINUE; } else if (y < -LEFT) { t = y +(1.0-x0); CONTINUE: z = t - x0_lo; p = r0+z*(r1+z*(r2+z*(r3+z*(r4+z*r5)))); q = s0+z*(s1+z*(s2+z*(s3+z*s4))); r = t*(z*(p/q) - x0_lo); t = .5*t*t; z = 1.0; switch (x_int) { case 6: z = (y + 5); case 5: z *= (y + 4); case 4: z *= (y + 3); case 3: z *= (y + 2); rr = log__D(z); rr.b += a0_lo; rr.a += a0_hi; return(((r+rr.b)+t+rr.a)); case 2: return(((r+a0_lo)+t)+a0_hi); case 0: r -= log1p(x); default: rr = log__D(x); rr.a -= a0_hi; rr.b -= a0_lo; return(((r - rr.b) + t) - rr.a); } } else { p = p0+y*(p1+y*(p2+y*(p3+y*p4))); q = q0+y*(q1+y*(q2+y*(q3+y*(q4+y*(q5+y*q6))))); p = p*(y/q); t = (double)(float) y; z = y-t; hi = (double)(float) (p+a1_hi); lo = a1_hi - hi; lo += p; lo += a1_lo; r = lo*y + z*hi; /* q + r = y*(a0+p/q) */ q = hi*t; z = 1.0; switch (x_int) { case 6: z = (y + 5); case 5: z *= (y + 4); case 4: z *= (y + 3); case 3: z *= (y + 2); rr = log__D(z); r += rr.b; r += q; return(rr.a + r); case 2: return (q+ r); case 0: rr = log__D(x); r -= rr.b; r -= log1p(x); r += q; r-= rr.a; return(r); default: rr = log__D(x); r -= rr.b; q -= rr.a; return (r+q); } } } static double neg_lgam(double x) { int xi; double y, z, one = 1.0, zero = 0.0; extern double gamma(); /* avoid destructive cancellation as much as possible */ if (x > -170) { xi = x; if (xi == x) if (_IEEE) return(one/zero); else return(infnan(ERANGE)); y = gamma(x); if (y < 0) y = -y, signgam = -1; return (log(y)); } z = floor(x + .5); if (z == x) { /* convention: G(-(integer)) -> +Inf */ if (_IEEE) return (one/zero); else return (infnan(ERANGE)); } y = .5*ceil(x); if (y == ceil(y)) signgam = -1; x = -x; z = fabs(x + z); /* 0 < z <= .5 */ if (z < .25) z = sin(M_PI*z); else z = cos(M_PI*(0.5-z)); z = log(M_PI/(z*x)); y = large_lgam(x); return (z - y); } octave-1.1.0/bsd-math/drem.c100666 415 17 14505 5344461606 13766 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)support.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* * Some IEEE standard 754 recommended functions and remainder and sqrt for * supporting the C elementary functions. ****************************************************************************** * WARNING: * These codes are developed (in double) to support the C elementary * functions temporarily. They are not universal, and some of them are very * slow (in particular, drem and sqrt is extremely inefficient). Each * computer system should have its implementation of these functions using * its own assembler. ****************************************************************************** * * IEEE 754 required operations: * drem(x,p) * returns x REM y = x - [x/y]*y , where [x/y] is the integer * nearest x/y; in half way case, choose the even one. * sqrt(x) * returns the square root of x correctly rounded according to * the rounding mod. * * IEEE 754 recommended functions: * (a) copysign(x,y) * returns x with the sign of y. * (b) scalb(x,N) * returns x * (2**N), for integer values N. * (c) logb(x) * returns the unbiased exponent of x, a signed integer in * double precision, except that logb(0) is -INF, logb(INF) * is +INF, and logb(NAN) is that NAN. * (d) finite(x) * returns the value TRUE if -INF < x < +INF and returns * FALSE otherwise. * * * CODED IN C BY K.C. NG, 11/25/84; * REVISED BY K.C. NG on 1/22/85, 2/13/85, 3/24/85. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) /* VAX D format */ #include static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ double drem(x,p) double x,p; { short sign; double hp,dp,tmp; unsigned short k; #ifdef national unsigned short *px=(unsigned short *) &x +3, *pp=(unsigned short *) &p +3, *pd=(unsigned short *) &dp +3, *pt=(unsigned short *) &tmp+3; #else /* national */ unsigned short *px=(unsigned short *) &x , *pp=(unsigned short *) &p , *pd=(unsigned short *) &dp , *pt=(unsigned short *) &tmp; #endif /* national */ *pp &= msign ; #if defined(vax)||defined(tahoe) if( ( *px & mexp ) == ~msign ) /* is x a reserved operand? */ #else /* defined(vax)||defined(tahoe) */ if( ( *px & mexp ) == mexp ) #endif /* defined(vax)||defined(tahoe) */ return (x-p)-(x-p); /* create nan if x is inf */ if (p == zero) { #if defined(vax)||defined(tahoe) return(infnan(EDOM)); #else /* defined(vax)||defined(tahoe) */ return zero/zero; #endif /* defined(vax)||defined(tahoe) */ } #if defined(vax)||defined(tahoe) if( ( *pp & mexp ) == ~msign ) /* is p a reserved operand? */ #else /* defined(vax)||defined(tahoe) */ if( ( *pp & mexp ) == mexp ) #endif /* defined(vax)||defined(tahoe) */ { if (p != p) return p; else return x;} else if ( ((*pp & mexp)>>gap) <= 1 ) /* subnormal p, or almost subnormal p */ { double b; b=scalb(1.0,(int)prep1); p *= b; x = drem(x,p); x *= b; return(drem(x,p)/b);} else if ( p >= novf/2) { p /= 2 ; x /= 2; return(drem(x,p)*2);} else { dp=p+p; hp=p/2; sign= *px & ~msign ; *px &= msign ; while ( x > dp ) { k=(*px & mexp) - (*pd & mexp) ; tmp = dp ; *pt += k ; #if defined(vax)||defined(tahoe) if( x < tmp ) *pt -= 128 ; #else /* defined(vax)||defined(tahoe) */ if( x < tmp ) *pt -= 16 ; #endif /* defined(vax)||defined(tahoe) */ x -= tmp ; } if ( x > hp ) { x -= p ; if ( x >= hp ) x -= p ; } #if defined(vax)||defined(tahoe) if (x) #endif /* defined(vax)||defined(tahoe) */ *px ^= sign; return( x); } } octave-1.1.0/bsd-math/log10.c100666 415 17 7013 5341366344 13735 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)log10.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* LOG10(X) * RETURN THE BASE 10 LOGARITHM OF x * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/20/85; * REVISED BY K.C. NG on 1/23/85, 3/7/85, 4/16/85. * * Required kernel function: * log(x) * * Method : * log(x) * log10(x) = --------- or [1/log(10)]*log(x) * log(10) * * Note: * [log(10)] rounded to 56 bits has error .0895 ulps, * [1/log(10)] rounded to 53 bits has error .198 ulps; * therefore, for better accuracy, in VAX D format, we divide * log(x) by log(10), but in IEEE Double format, we multiply * log(x) by [1/log(10)]. * * Special cases: * log10(x) is NaN with signal if x < 0; * log10(+INF) is +INF with no signal; log10(0) is -INF with signal; * log10(NaN) is that NaN with no signal. * * Accuracy: * log10(X) returns the exact log10(x) nearly rounded. In a test run * with 1,536,000 random arguments on a VAX, the maximum observed * error was 1.74 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(ln10hi, 2.3025850929940456790E0 ,5d8d,4113,a8ac,ddaa, 2, .935D8DDDAAA8AC) ic(ivln10, 4.3429448190325181667E-1, -2, 1.BCB7B1526E50E) #ifdef vccast #define ln10hi vccast(ln10hi) #endif double log10(x) double x; { #if defined(vax)||defined(tahoe) return(log(x)/ln10hi); #else /* defined(vax)||defined(tahoe) */ return(ivln10*log(x)); #endif /* defined(vax)||defined(tahoe) */ } octave-1.1.0/bsd-math/sqrt.c100666 415 17 13516 5344461643 14032 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)support.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* * Some IEEE standard 754 recommended functions and remainder and sqrt for * supporting the C elementary functions. ****************************************************************************** * WARNING: * These codes are developed (in double) to support the C elementary * functions temporarily. They are not universal, and some of them are very * slow (in particular, drem and sqrt is extremely inefficient). Each * computer system should have its implementation of these functions using * its own assembler. ****************************************************************************** * * IEEE 754 required operations: * drem(x,p) * returns x REM y = x - [x/y]*y , where [x/y] is the integer * nearest x/y; in half way case, choose the even one. * sqrt(x) * returns the square root of x correctly rounded according to * the rounding mod. * * IEEE 754 recommended functions: * (a) copysign(x,y) * returns x with the sign of y. * (b) scalb(x,N) * returns x * (2**N), for integer values N. * (c) logb(x) * returns the unbiased exponent of x, a signed integer in * double precision, except that logb(0) is -INF, logb(INF) * is +INF, and logb(NAN) is that NAN. * (d) finite(x) * returns the value TRUE if -INF < x < +INF and returns * FALSE otherwise. * * * CODED IN C BY K.C. NG, 11/25/84; * REVISED BY K.C. NG on 1/22/85, 2/13/85, 3/24/85. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) /* VAX D format */ #include static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ double sqrt(x) double x; { double q,s,b,r; double t; double const zero=0.0; int m,n,i; #if defined(vax)||defined(tahoe) int k=54; #else /* defined(vax)||defined(tahoe) */ int k=51; #endif /* defined(vax)||defined(tahoe) */ /* sqrt(NaN) is NaN, sqrt(+-0) = +-0 */ if(x!=x||x==zero) return(x); /* sqrt(negative) is invalid */ if(x1.0) t=1; /* b>1 : Round-to-(+INF) */ if(t>=0) q+=r; } /* else: Round-to-nearest */ else { s *= 2; x *= 4; t = (x-s)-1; b=1.0+3*r/4; if(b==1.0) goto end; b=1.0+r/4; if(b>1.0) t=1; if(t>=0) q+=r; } end: return(scalb(q,n)); } octave-1.1.0/bsd-math/log__L.c100666 415 17 10754 5341366345 14235 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)log__L.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* log__L(Z) * LOG(1+X) - 2S X * RETURN --------------- WHERE Z = S*S, S = ------- , 0 <= Z <= .0294... * S 2 + X * * DOUBLE PRECISION (VAX D FORMAT 56 bits or IEEE DOUBLE 53 BITS) * KERNEL FUNCTION FOR LOG; TO BE USED IN LOG1P, LOG, AND POW FUNCTIONS * CODED IN C BY K.C. NG, 1/19/85; * REVISED BY K.C. Ng, 2/3/85, 4/16/85. * * Method : * 1. Polynomial approximation: let s = x/(2+x). * Based on log(1+x) = log(1+s) - log(1-s) * = 2s + 2/3 s**3 + 2/5 s**5 + ....., * * (log(1+x) - 2s)/s is computed by * * z*(L1 + z*(L2 + z*(... (L7 + z*L8)...))) * * where z=s*s. (See the listing below for Lk's values.) The * coefficients are obtained by a special Remez algorithm. * * Accuracy: * Assuming no rounding error, the maximum magnitude of the approximation * error (absolute) is 2**(-58.49) for IEEE double, and 2**(-63.63) * for VAX D format. * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(L1, 6.6666666666666703212E-1 ,aaaa,402a,aac5,aaaa, 0, .AAAAAAAAAAAAC5) vc(L2, 3.9999999999970461961E-1 ,cccc,3fcc,2684,cccc, -1, .CCCCCCCCCC2684) vc(L3, 2.8571428579395698188E-1 ,4924,3f92,5782,92f8, -1, .92492492F85782) vc(L4, 2.2222221233634724402E-1 ,8e38,3f63,af2c,39b7, -2, .E38E3839B7AF2C) vc(L5, 1.8181879517064680057E-1 ,2eb4,3f3a,655e,cc39, -2, .BA2EB4CC39655E) vc(L6, 1.5382888777946145467E-1 ,8551,3f1d,781d,e8c5, -2, .9D8551E8C5781D) vc(L7, 1.3338356561139403517E-1 ,95b3,3f08,cd92,907f, -2, .8895B3907FCD92) vc(L8, 1.2500000000000000000E-1 ,0000,3f00,0000,0000, -2, .80000000000000) ic(L1, 6.6666666666667340202E-1, -1, 1.5555555555592) ic(L2, 3.9999999999416702146E-1, -2, 1.999999997FF24) ic(L3, 2.8571428742008753154E-1, -2, 1.24924941E07B4) ic(L4, 2.2222198607186277597E-1, -3, 1.C71C52150BEA6) ic(L5, 1.8183562745289935658E-1, -3, 1.74663CC94342F) ic(L6, 1.5314087275331442206E-1, -3, 1.39A1EC014045B) ic(L7, 1.4795612545334174692E-1, -3, 1.2F039F0085122) #ifdef vccast #define L1 vccast(L1) #define L2 vccast(L2) #define L3 vccast(L3) #define L4 vccast(L4) #define L5 vccast(L5) #define L6 vccast(L6) #define L7 vccast(L7) #define L8 vccast(L8) #endif double log__L(z) double z; { #if defined(vax)||defined(tahoe) return(z*(L1+z*(L2+z*(L3+z*(L4+z*(L5+z*(L6+z*(L7+z*L8)))))))); #else /* defined(vax)||defined(tahoe) */ return(z*(L1+z*(L2+z*(L3+z*(L4+z*(L5+z*(L6+z*L7))))))); #endif /* defined(vax)||defined(tahoe) */ } octave-1.1.0/bsd-math/finite.c100666 415 17 10413 5536155046 14310 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)support.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* * Some IEEE standard 754 recommended functions and remainder and sqrt for * supporting the C elementary functions. ****************************************************************************** * WARNING: * These codes are developed (in double) to support the C elementary * functions temporarily. They are not universal, and some of them are very * slow (in particular, drem and sqrt is extremely inefficient). Each * computer system should have its implementation of these functions using * its own assembler. ****************************************************************************** * * IEEE 754 required operations: * drem(x,p) * returns x REM y = x - [x/y]*y , where [x/y] is the integer * nearest x/y; in half way case, choose the even one. * sqrt(x) * returns the square root of x correctly rounded according to * the rounding mod. * * IEEE 754 recommended functions: * (a) copysign(x,y) * returns x with the sign of y. * (b) scalb(x,N) * returns x * (2**N), for integer values N. * (c) logb(x) * returns the unbiased exponent of x, a signed integer in * double precision, except that logb(0) is -INF, logb(INF) * is +INF, and logb(NAN) is that NAN. * (d) finite(x) * returns the value TRUE if -INF < x < +INF and returns * FALSE otherwise. * * * CODED IN C BY K.C. NG, 11/25/84; * REVISED BY K.C. NG on 1/22/85, 2/13/85, 3/24/85. */ #include "mathimpl.h" #if defined(vax)||defined(tahoe) /* VAX D format */ #include static const unsigned short msign=0x7fff , mexp =0x7f80 ; static const short prep1=57, gap=7, bias=129 ; static const double novf=1.7E38, nunf=3.0E-39, zero=0.0 ; #else /* defined(vax)||defined(tahoe) */ static const unsigned short msign=0x7fff, mexp =0x7ff0 ; static const short prep1=54, gap=4, bias=1023 ; static const double novf=1.7E308, nunf=3.0E-308,zero=0.0; #endif /* defined(vax)||defined(tahoe) */ int finite(x) double x; { #if defined(vax)||defined(tahoe) return(1); #else /* defined(vax)||defined(tahoe) */ #ifdef national return( (*((short *) &x+3 ) & mexp ) != mexp ); #else /* national */ return( (*((short *) &x ) & mexp ) != mexp ); #endif /* national */ #endif /* defined(vax)||defined(tahoe) */ } octave-1.1.0/bsd-math/pow.c100666 415 17 14551 5341366347 13650 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)pow.c 5.9 (Berkeley) 12/16/92"; #endif /* not lint */ /* POW(X,Y) * RETURN X**Y * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/8/85; * REVISED BY K.C. NG on 7/10/85. * KERNEL pow_P() REPLACED BY P. McILROY 7/22/92. * Required system supported functions: * scalb(x,n) * logb(x) * copysign(x,y) * finite(x) * drem(x,y) * * Required kernel functions: * exp__D(a,c) exp(a + c) for |a| << |c| * struct d_double dlog(x) r.a + r.b, |r.b| < |r.a| * * Method * 1. Compute and return log(x) in three pieces: * log(x) = n*ln2 + hi + lo, * where n is an integer. * 2. Perform y*log(x) by simulating muti-precision arithmetic and * return the answer in three pieces: * y*log(x) = m*ln2 + hi + lo, * where m is an integer. * 3. Return x**y = exp(y*log(x)) * = 2^m * ( exp(hi+lo) ). * * Special cases: * (anything) ** 0 is 1 ; * (anything) ** 1 is itself; * (anything) ** NaN is NaN; * NaN ** (anything except 0) is NaN; * +(anything > 1) ** +INF is +INF; * -(anything > 1) ** +INF is NaN; * +-(anything > 1) ** -INF is +0; * +-(anything < 1) ** +INF is +0; * +(anything < 1) ** -INF is +INF; * -(anything < 1) ** -INF is NaN; * +-1 ** +-INF is NaN and signal INVALID; * +0 ** +(anything except 0, NaN) is +0; * -0 ** +(anything except 0, NaN, odd integer) is +0; * +0 ** -(anything except 0, NaN) is +INF and signal DIV-BY-ZERO; * -0 ** -(anything except 0, NaN, odd integer) is +INF with signal; * -0 ** (odd integer) = -( +0 ** (odd integer) ); * +INF ** +(anything except 0,NaN) is +INF; * +INF ** -(anything except 0,NaN) is +0; * -INF ** (odd integer) = -( +INF ** (odd integer) ); * -INF ** (even integer) = ( +INF ** (even integer) ); * -INF ** -(anything except integer,NaN) is NaN with signal; * -(x=anything) ** (k=integer) is (-1)**k * (x ** k); * -(anything except 0) ** (non-integer) is NaN with signal; * * Accuracy: * pow(x,y) returns x**y nearly rounded. In particular, on a SUN, a VAX, * and a Zilog Z8000, * pow(integer,integer) * always returns the correct integer provided it is representable. * In a test run with 100,000 random arguments with 0 < x, y < 20.0 * on a VAX, the maximum observed error was 1.79 ulps (units in the * last place). * * Constants : * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include #include #include "mathimpl.h" #if (defined(vax) || defined(tahoe)) #define TRUNC(x) x = (double) (float) x #define _IEEE 0 #else #define _IEEE 1 #define endian (((*(int *) &one)) ? 1 : 0) #define TRUNC(x) *(((int *) &x)+endian) &= 0xf8000000 #define infnan(x) 0.0 #endif /* vax or tahoe */ const static double zero=0.0, one=1.0, two=2.0, negone= -1.0; static double pow_P __P((double, double)); double pow(x,y) double x,y; { double t; if (y==zero) return (one); else if (y==one || (_IEEE && x != x)) return (x); /* if x is NaN or y=1 */ else if (_IEEE && y!=y) /* if y is NaN */ return (y); else if (!finite(y)) /* if y is INF */ if ((t=fabs(x))==one) /* +-1 ** +-INF is NaN */ return (y - y); else if (t>one) return ((y<0)? zero : ((x0)? zero : ((x<0)? y-y : -y)); else if (y==two) return (x*x); else if (y==negone) return (one/x); /* x > 0, x == +0 */ else if (copysign(one, x) == one) return (pow_P(x, y)); /* sign(x)= -1 */ /* if y is an even integer */ else if ( (t=drem(y,two)) == zero) return (pow_P(-x, y)); /* if y is an odd integer */ else if (copysign(t,one) == one) return (-pow_P(-x, y)); /* Henceforth y is not an integer */ else if (x==zero) /* x is -0 */ return ((y>zero)? -x : one/(-x)); else if (_IEEE) return (zero/zero); else return (infnan(EDOM)); } /* kernel function for x >= 0 */ static double #ifdef _ANSI_SOURCE pow_P(double x, double y) #else pow_P(x, y) double x, y; #endif { struct Double s, t, log__D(); double exp__D(), huge = 1e300, tiny = 1e-300; if (x == 1) return (one); if (y >= 7e18) /* infinity */ if (x < 1) return(tiny*tiny); else if (_IEEE) return (huge*huge); else return (infnan(ERANGE)); /* Return exp(y*log(x)), using simulated extended */ /* precision for the log and the multiply. */ s = log__D(x); t.a = y; TRUNC(t.a); t.b = y - t.a; t.b = s.b*y + t.b*s.a; t.a *= s.a; s.a = t.a + t.b; s.b = (t.a - s.a) + t.b; return (exp__D(s.a, s.b)); } octave-1.1.0/bsd-math/sinh.c100666 415 17 11015 5341366351 13767 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)sinh.c 5.6 (Berkeley) 10/9/90"; #endif /* not lint */ /* SINH(X) * RETURN THE HYPERBOLIC SINE OF X * DOUBLE PRECISION (VAX D format 56 bits, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/8/85; * REVISED BY K.C. NG on 2/8/85, 3/7/85, 3/24/85, 4/16/85. * * Required system supported functions : * copysign(x,y) * scalb(x,N) * * Required kernel functions: * expm1(x) ...return exp(x)-1 * * Method : * 1. reduce x to non-negative by sinh(-x) = - sinh(x). * 2. * * expm1(x) + expm1(x)/(expm1(x)+1) * 0 <= x <= lnovfl : sinh(x) := -------------------------------- * 2 * lnovfl <= x <= lnovfl+ln2 : sinh(x) := expm1(x)/2 (avoid overflow) * lnovfl+ln2 < x < INF : overflow to INF * * * Special cases: * sinh(x) is x if x is +INF, -INF, or NaN. * only sinh(0)=0 is exact for finite argument. * * Accuracy: * sinh(x) returns the exact hyperbolic sine of x nearly rounded. In * a test run with 1,024,000 random arguments on a VAX, the maximum * observed error was 1.93 ulps (units in the last place). * * Constants: * The hexadecimal values are the intended ones for the following constants. * The decimal values may be used, provided that the compiler will convert * from decimal to binary accurately enough to produce the hexadecimal values * shown. */ #include "mathimpl.h" vc(mln2hi, 8.8029691931113054792E1 ,0f33,43b0,2bdb,c7e2, 7, .B00F33C7E22BDB) vc(mln2lo,-4.9650192275318476525E-16 ,1b60,a70f,582a,279e, -50,-.8F1B60279E582A) vc(lnovfl, 8.8029691931113053016E1 ,0f33,43b0,2bda,c7e2, 7, .B00F33C7E22BDA) ic(mln2hi, 7.0978271289338397310E2, 10, 1.62E42FEFA39EF) ic(mln2lo, 2.3747039373786107478E-14, -45, 1.ABC9E3B39803F) ic(lnovfl, 7.0978271289338397310E2, 9, 1.62E42FEFA39EF) #ifdef vccast #define mln2hi vccast(mln2hi) #define mln2lo vccast(mln2lo) #define lnovfl vccast(lnovfl) #endif #if defined(vax)||defined(tahoe) static max = 126 ; #else /* defined(vax)||defined(tahoe) */ static max = 1023 ; #endif /* defined(vax)||defined(tahoe) */ double sinh(x) double x; { static const double one=1.0, half=1.0/2.0 ; double t, sign; #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ sign=copysign(one,x); x=copysign(x,one); if(x .Ft double .Fn acos "double x" .Sh DESCRIPTION The .Fn acos function computes the principal value of the arc cosine of .Fa x . A domain error occurs for arguments not in the range [-1, +1]. For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn acos function returns the arc cosine in the range .Bq 0 , \*(Pi radians. On the .Tn VAX and .Tn Tahoe , if: .Bd -unfilled -offset indent .Pf \&| Ns Ar x Ns \&| > 1 , .Ed .Pp .Fn acos x sets the global variable .Va errno to .Dv EDOM and a reserved operand fault is generated. .Sh SEE ALSO .Xr sin 3 , .Xr cos 3 , .Xr tan 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr sinh 3 , .Xr cosh 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn acos function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/acosh.3100666 415 17 5062 5341366320 14662 0ustar jweusers.\" Copyright (c) 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)acosh.3 5.2 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt ACOSH 3 .Os BSD 4.3 .Sh NAME .Nm acosh .Nd inverse hyperbolic cosine function .Sh SYNOPSIS .Fd #include .Ft double .Fn acosh "double x" .Sh DESCRIPTION The .Fn acosh function computes the inverse hyperbolic cosine of the real argument .Ar x . For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn acosh function returns the inverse hyperbolic cosine of .Ar x . On the .Tn VAX and .Tn Tahoe , if the argument is less than one .Fn acosh sets the global variable .Va errno to .Er EDOM and causes a reserved operand fault. .Sh SEE ALSO .Xr asinh 3 , .Xr atanh 3 , .Xr exp 3 , .Xr infnan 3 .Xr math 3 , .Sh HISTORY The .Fn acosh function appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/asin.3100666 415 17 5310 5341366321 14514 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)asin.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt ASIN 3 .Os .Sh NAME .Nm asin .Nd arc sine function .Sh SYNOPSIS .Fd #include .Ft double .Fn asin "double x" .Sh DESCRIPTION The .Fn asin function computes the principal value of the arc sine of .Fa x . A domain error occurs for arguments not in the range [-1, +1]. For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn asin function returns the arc sine in the range .Bk -words .Bq -\*(Pi/2, +\*(Pi/2 .Ek radians. On the .Tn VAX , and Tahoe , if: .Bd -unfilled -offset indent .Pf \&| Ns Ar x Ns \&| > 1 .Ed .Pp the global variable .Va errno is set to .Er EDOM and a reserved operand fault generated. .Sh SEE ALSO .Xr acos 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn asin function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/asinh.3100666 415 17 4624 5341366322 14674 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)asinh.3 6.4 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt ASINH 3 .Os BSD 4.3 .Sh NAME .Nm asinh .Nd inverse hyperbolic sine function .Sh SYNOPSIS .Fd #include .Ft double .Fn asinh "double x" .Sh DESCRIPTION The .Fn asinh function computes the inverse hyperbolic sine of the real argument .Ar x . For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn asinh function returns the inverse hyperbolic sine of .Ar x . .Sh SEE ALSO .Xr acosh 3 , .Xr atanh 3 , .Xr exp 3 , .Xr infnan 3 .Xr math 3 , .Sh HISTORY The .Fn asinh function appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/atan.3100666 415 17 4750 5341366323 14516 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)atan.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt ATAN 3 .Os .Sh NAME .Nm atan .Nd arc tangent function of one variable .Sh SYNOPSIS .Fd #include .Ft double .Fn atan "double x" .Sh DESCRIPTION The .Fn atan function computes the principal value of the arc tangent of .Fa x . For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn atan function returns the arc tangent in the range .Bk -words .Bq -\*(Pi/2 , +\*(Pi/2 .Ek radians. .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn atan function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/atan2.3100666 415 17 11106 5341366324 14612 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)atan2.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt ATAN2 3 .Os .Sh NAME .Nm atan2 .Nd arc tangent function of two variables .Sh SYNOPSIS .Fd #include .Ft double .Fn atan2 "double y" "double x" .Sh DESCRIPTION The .Xr atan2 function computes the principal value of the arc tangent of .Ar y/ Ns Ar x , using the signs of both arguments to determine the quadrant of the return value. .Sh RETURN VALUES The .Xr atan2 function, if successful, returns the arc tangent of .Ar y/ Ns Ar x in the range .Bk -words .Bq \&- Ns \*(Pi , \&+ Ns \*(Pi .Ek radians. If both .Ar x and .Ar y are zero, the global variable .Va errno is set to .Er EDOM . On the .Tn VAX : .Bl -column atan_(y,x)_:=____ sign(y)_(Pi_atan2(Xy_xX))___ .It Fn atan2 y x No := Ta .Fn atan y/x Ta if .Ar x > 0, .It Ta sign( Ns Ar y Ns )*(\*(Pi - .Fn atan "\\*(Bay/x\\*(Ba" ) Ta if .Ar x < 0, .It Ta .No 0 Ta if x = y = 0, or .It Ta .Pf sign( Ar y Ns )*\\*(Pi/2 Ta if .Ar x = 0 \*(!= .Ar y . .El .Sh NOTES The function .Fn atan2 defines "if x > 0," .Fn atan2 0 0 = 0 on a .Tn VAX despite that previously .Fn atan2 0 0 may have generated an error message. The reasons for assigning a value to .Fn atan2 0 0 are these: .Bl -enum -offset indent .It Programs that test arguments to avoid computing .Fn atan2 0 0 must be indifferent to its value. Programs that require it to be invalid are vulnerable to diverse reactions to that invalidity on diverse computer systems. .It The .Fn atan2 function is used mostly to convert from rectangular (x,y) to polar .if n\ (r,theta) .if t\ (r,\(*h) coordinates that must satisfy x = .if n\ r\(**cos theta .if t\ r\(**cos\(*h and y = .if n\ r\(**sin theta. .if t\ r\(**sin\(*h. These equations are satisfied when (x=0,y=0) is mapped to .if n \ (r=0,theta=0) .if t \ (r=0,\(*h=0) on a VAX. In general, conversions to polar coordinates should be computed thus: .Bd -unfilled -offset indent .if n \{\ r := hypot(x,y); ... := sqrt(x\(**x+y\(**y) theta := atan2(y,x). .\} .if t \{\ r := hypot(x,y); ... := \(sr(x\u\s82\s10\d+y\u\s82\s10\d) \(*h := atan2(y,x). .\} .Ed .It The foregoing formulas need not be altered to cope in a reasonable way with signed zeros and infinities on a machine that conforms to .Tn IEEE 754 ; the versions of .Xr hypot 3 and .Fn atan2 provided for such a machine are designed to handle all cases. That is why .Fn atan2 \(+-0 \-0 = \(+-\*(Pi for instance. In general the formulas above are equivalent to these: .Bd -unfilled -offset indent .if n \ r := sqrt(x\(**x+y\(**y); if r = 0 then x := copysign(1,x); .if t \ r := \(sr(x\(**x+y\(**y);\0\0if r = 0 then x := copysign(1,x); .Ed .El .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn atan2 function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/atanh.3100666 415 17 5153 5341366325 14666 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)atanh.3 5.2 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt ATANH 3 .Os BSD 4.3 .Sh NAME .Nm atanh .Nd inverse hyperbolic tangent function .Sh SYNOPSIS .Fd #include .Ft double .Fn atanh "double x" .Sh DESCRIPTION The .Fn atanh function computes the inverse hyperbolic tangent of the real argument .Ar x . For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn atanh function returns the inverse hyperbolic tangent of .Ar x if successful. On the .Tn VAX and .Tn Tahoe , if the argument has absolute value bigger than or equal to 1, .Fn atanh sets the global variable .Va errno to .Er EDOM and a reserved operand fault is generated. .Sh SEE ALSO .Xr acosh 3 , .Xr asinh 3 , .Xr exp 3 , .Xr infnan 3 .Xr math 3 , .Sh HISTORY The .Fn atanh function appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/ceil.3100666 415 17 4544 5341366326 14513 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)ceil.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt CEIL 3 .Os .Sh NAME .Nm ceil .Nd smallest integral value not greater than x .Sh SYNOPSIS .Fd #include .Ft double .Fn ceil "double x" .Sh DESCRIPTION The .Fn ceil function computes the smallest integral value not less than .Fa x . .Sh RETURN VALUES The .Fn ceil function returns the smallest integral value expressed as a double. .Sh SEE ALSO .Xr abs 3 , .Xr fabs 3 , .Xr floor 3 , .Xr rint 3 , .Xr ieee 3 , .Xr math.3 .Sh STANDARDS The .Fn ceil function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/cos.3100666 415 17 4733 5341366326 14363 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)cos.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt COS 3 .Os .Sh NAME .Nm cos .Nd cosine function .Sh SYNOPSIS .Fd #include .Ft double .Fn cos "double x" .Sh DESCRIPTION The .Fn cos function computes the cosine of .Fa x (measured in radians). A large magnitude argument may yield a result with little or no significance. For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn cos function returns the cosine value. .Sh SEE ALSO .Xr sin 3 , .Xr tan 3 , .Xr asin 3 , .Xr acos 3 , .Xr atan 3 , .Xr atan2 3 , .Xr sinh 3 , .Xr cosh 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn acos function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/cosh.3100666 415 17 4721 5341366327 14531 0ustar jweusers.\" Copyright (c) 1989, 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)cosh.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt COSH 3 .Os .Sh NAME .Nm cosh .Nd hyperbolic cosine function .Sh SYNOPSIS .Fd #include .Ft double .Fn cosh "double x" .Sh DESCRIPTION The .Fn cosh function computes the hyperbolic cosine of .Fa x . .Sh RETURN VALUES The .Fn cosh function returns the hyperbolic cosine unless the magnitude of .Fa x is too large; in this event, the global variable .Va errno is set to .Er ERANGE . .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn cosh function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/erf.3100666 415 17 5265 5341366330 14347 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)erf.3 6.4 (Berkeley) 4/20/91 .\" .Dd April 20, 1991 .Dt ERF 3 .Os BSD 4.3 .Sh NAME .Nm erf , .Nm erfc .Nd error function operators .Sh SYNOPSIS .Fd #include .Ft double .Fn erf "double x" .Ft double .Fn erfc "double x" .Sh DESCRIPTION These functions calculate the error function of .Fa x . .Pp The .Fn erf calculates the error function of x; where .Bd -filled -offset indent .if n \{\ erf(x) = 2/sqrt(pi)\(**\|integral from 0 to x of exp(\-t\(**t) dt. \} .if t \{\ erf\|(x) := (2/\(sr\(*p)\|\(is\d\s8\z0\s10\u\u\s8x\s10\d\|exp(\-t\u\s82\s10\d)\|dt. \} .Ed .Pp The .Fn erfc function calculates the complementary error function of .Fa x ; that is .Fn erfc subtracts the result of the error function .Fn erf x from 1.0. This is useful, since for large .Fa x places disappear. .Sh SEE ALSO .Xr math 3 .Sh HISTORY The .Fn erf and .Fn erfc functions appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/exp.3100666 415 17 14670 5341366331 14410 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)exp.3 6.12 (Berkeley) 7/31/91 .\" .Dd July 31, 1991 .Dt EXP 3 .Os BSD 4 .Sh NAME .Nm exp , .Nm expm1 , .Nm log , .Nm log10 , .Nm log1p , .Nm pow .Nd exponential, logarithm, power functions .Sh SYNOPSIS .Fd #include .Ft double .Fn exp "double x" .Ft double .Fn expm1 "double x" .Ft double .Fn log "double x" .Ft double .Fn log10 "double x" .Ft double .Fn log1p "double x" .Ft double .Fn pow "double x" "double y" .Sh DESCRIPTION The .Fn exp function computes the exponential value of the given argument .Fa x . .Pp The .Fn expm1 function computes the value exp(x)\-1 accurately even for tiny argument .Fa x . .Pp The .Fn log function computes the value for the natural logarithm of the argument x. .Pp The .Fn log10 function computes the value for the logarithm of argument .Fa x to base 10. .Pp The .Fn log1p function computes the value of log(1+x) accurately even for tiny argument .Fa x . .Pp The .Fn pow computes the value of .Ar x to the exponent .Ar y . .Sh ERROR (due to Roundoff etc.) exp(x), log(x), expm1(x) and log1p(x) are accurate to within an .Em up , and log10(x) to within about 2 .Em ups ; an .Em up is one .Em Unit in the .Em Last .Em Place . The error in .Fn pow x y is below about 2 .Em ups when its magnitude is moderate, but increases as .Fn pow x y approaches the over/underflow thresholds until almost as many bits could be lost as are occupied by the floating\-point format's exponent field; that is 8 bits for .Tn "VAX D" and 11 bits for IEEE 754 Double. No such drastic loss has been exposed by testing; the worst errors observed have been below 20 .Em ups for .Tn "VAX D" , 300 .Em ups for .Tn IEEE 754 Double. Moderate values of .Fn pow are accurate enough that .Fn pow integer integer is exact until it is bigger than 2**56 on a .Tn VAX , 2**53 for .Tn IEEE 754. .Sh RETURN VALUES These functions will return the approprate computation unless an error occurs or an argument is out of range. The functions .Fn exp , .Fn expm1 and .Fn pow detect if the computed value will overflow, set the global variable .Va errno to .Er RANGE and cause a reserved operand fault on a .Tn VAX or .Tn Tahoe . The function .Fn pow x y checks to see if .Fa x < 0 and .Fa y is not an integer, in the event this is true, the global variable .Va errno is set to .Er EDOM and on the .Tn VAX and .Tn Tahoe generate a reserved operand fault. On a .Tn VAX and .Tn Tahoe , .Va errno is set to .Er EDOM and the reserved operand is returned by log unless .Fa x > 0, by .Fn log1p unless .Fa x > \-1. .Sh NOTES The functions exp(x)\-1 and log(1+x) are called expm1 and logp1 in .Tn BASIC on the Hewlett\-Packard .Tn HP Ns \-71B and .Tn APPLE Macintosh, .Tn EXP1 and .Tn LN1 in Pascal, exp1 and log1 in C on .Tn APPLE Macintoshes, where they have been provided to make sure financial calculations of ((1+x)**n\-1)/x, namely expm1(n\(**log1p(x))/x, will be accurate when x is tiny. They also provide accurate inverse hyperbolic functions. .Pp The function .Fn pow x 0 returns x**0 = 1 for all x including x = 0, .if n \ Infinity .if t \ \(if (not found on a .Tn VAX ) , and .Em NaN (the reserved operand on a .Tn VAX ) . Previous implementations of pow may have defined x**0 to be undefined in some or all of these cases. Here are reasons for returning x**0 = 1 always: .Bl -enum -width indent .It Any program that already tests whether x is zero (or infinite or \*(Na) before computing x**0 cannot care whether 0**0 = 1 or not. Any program that depends upon 0**0 to be invalid is dubious anyway since that expression's meaning and, if invalid, its consequences vary from one computer system to another. .It Some Algebra texts (e.g. Sigler's) define x**0 = 1 for all x, including x = 0. This is compatible with the convention that accepts a[0] as the value of polynomial .Bd -literal -offset indent p(x) = a[0]\(**x**0 + a[1]\(**x**1 + a[2]\(**x**2 +...+ a[n]\(**x**n .Ed .Pp at x = 0 rather than reject a[0]\(**0**0 as invalid. .It Analysts will accept 0**0 = 1 despite that x**y can approach anything or nothing as x and y approach 0 independently. The reason for setting 0**0 = 1 anyway is this: .Bd -filled -offset indent If x(z) and y(z) are .Em any functions analytic (expandable in power series) in z around z = 0, and if there x(0) = y(0) = 0, then x(z)**y(z) \(-> 1 as z \(-> 0. .Ed .It If 0**0 = 1, then .if n \ infinity**0 = 1/0**0 = 1 too; and .if t \ \(if**0 = 1/0**0 = 1 too; and then \*(Na**0 = 1 too because x**0 = 1 for all finite and infinite x, i.e., independently of x. .El .Sh SEE ALSO .Xr math 3 , .Xr infnan 3 .Sh HISTORY A .Fn exp , .Fn log and .Fn pow function appeared in .At v6 . A .Fn log10 function appeared in .At v7 . The .Fn log1p and .Fn expm1 functions appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/fabs.3100666 415 17 4564 5341366333 14512 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" @(#)fabs.3 5.1 (Berkeley) 5/2/91 .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)fabs.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt FABS 3 .Os .Sh NAME .Nm fabs .Nd floating-point absolute value function .Sh SYNOPSIS .Fd #include .Ft double .Fn fabs "double x" .Sh DESCRIPTION The .Fn fabs function computes the absolute value of a floating-point number .Fa x . .Sh RETURN VALUES The .Fn fabs function returns the absolute value of .Fa x . .Sh SEE ALSO .Xr abs 3 , .Xr ceil 3 , .Xr floor 3 , .Xr rint 3 , .Xr ieee 3 , .Xr math.3 .Sh STANDARDS The .Fn fabs function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/floor.3100666 415 17 4565 5341366334 14722 0ustar jweusers.\" Copyright (c) 1985, 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)floor.3 6.5 (Berkeley) 4/19/91 .\" .Dd April 19, 1991 .Dt FLOOR 3 .Os .Sh NAME .Nm floor .Nd largest integral value not greater than x .Sh SYNOPSIS .Fd #include .Ft double .Fn floor "double x" .Sh DESCRIPTION The .Fn floor function computes the largest integral value not greater than .Fa x . .Sh RETURN VALUES The .Fn floor function returns the largest integral value expressed as a double. .Sh SEE ALSO .Xr abs 3 , .Xr ieee 3 , .Xr fabs 3 , .Xr floor 3 , .Xr rint 3 , .Xr math 3 .Sh STANDARDS The .Fn floor function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/fmod.3100666 415 17 5041 5341366335 14515 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)fmod.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt FMOD 3 .Os .Sh NAME .Nm fmod .Nd floating-point remainder function .Sh SYNOPSIS .Fd #include .Ft double .Fn fmod "double x" "double y" .Sh DESCRIPTION The .Fn fmod function computes the floating-point remainder of .Fa x Ns / Fa y . .Sh RETURN VALUES The .Fn fmod function returns the value .Sm off .Fa x - Em i * Fa y , .Sm on for some integer .Em i such that, if .Fa y is non-zero, the result has the same sign as .Fa x and magnitude less than the magnitude of .Fa y . If .Fa y is zero, whether a domain error occurs or the .Fn fmod function returns zero is implementation-defined. .Sh SEE ALSO .Xr math 3 .Sh STANDARDS The .Fn fmod function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/hypot.3100666 415 17 7003 5341366336 14734 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)hypot.3 6.7 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt HYPOT 3 .Os BSD 4 .Sh NAME .Nm hypot , .Nm cabs .Nd euclidean distance and complex absolute value functions .Sh SYNOPSIS .Fd #include .Ft double .Fn hypot "double x" "double y" .Fd struct {double x, y;} z; .Ft double .Fn cabs z .Sh DESCRIPTION The .Fn hypot and .Fn cabs functions computes the sqrt(x*x+y*y) in such a way that underflow will not happen, and overflow occurs only if the final result deserves it. .Pp .Fn hypot "\*(If" "v" = .Fn hypot "v" "\*(If" = +\*(If for all .Ar v , including \*(Na. .Sh ERROR (due to Roundoff, etc.) Below 0.97 .Em ulps . Consequently .Fn hypot "5.0" "12.0" = 13.0 exactly; in general, hypot and cabs return an integer whenever an integer might be expected. .Pp The same cannot be said for the shorter and faster version of hypot and cabs that is provided in the comments in cabs.c; its error can exceed 1.2 .Em ulps . .Sh NOTES As might be expected, .Fn hypot "v" "\*(Na" and .Fn hypot "\*(Na" "v" are \*(Na for all .Em finite .Ar v ; with "reserved operand" in place of "\*(Na", the same is true on a .Tn VAX . But programmers on machines other than a .Tn VAX (if has no \*(If) might be surprised at first to discover that .Fn hypot "\(+-\*(If" "\*(Na" = +\*(If. This is intentional; it happens because .Fn hypot "\*(If" "v" = +\*(If for .Em all .Ar v , finite or infinite. Hence .Fn hypot "\*(If" "v" is independent of .Ar v . Unlike the reserved operand fault on a .Tn VAX , the .Tn IEEE \*(Na is designed to disappear when it turns out to be irrelevant, as it does in .Fn hypot "\*(If" "\*(Na" . .Sh SEE ALSO .Xr math 3 , .Xr sqrt 3 .Sh HISTORY Both a .Fn hypot function and a .Fn cabs function appeared in .At v7 . octave-1.1.0/bsd-math/man3/ieee.3100666 415 17 12650 5341366337 14525 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)ieee.3 6.4 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt IEEE 3 .Os BSD 4.3 .Sh NAME .Nm copysign , .Nm drem , .Nm finite , .Nm logb , .Nm scalb .Nm copysign , .Nm remainder, .Nd exponent manipulations .Sh SYNOPSIS .Fd #include .Ft double .Fn copysign "double x" "double y" .Ft double .Fn drem "double x" "double y" .Ft int .Fn finite "double x" .Ft double .Fn logb "double x" .Ft double .Fn scalb "double x" "int n" .Sh DESCRIPTION These functions are required for, or recommended by the .Tn IEEE standard 754 for floating\-point arithmetic. .Pp The .Fn copysign function returns .Fa x with its sign changed to .Fa y Ns 's. .Pp The .Fn drem function returns the remainder .Fa r := .Fa x \- .Fa n\(**y where .Fa n is the integer nearest the exact value of .Bk -words .Fa x Ns / Ns Fa y ; .Ek moreover if .Pf \\*(Ba Fa n \- .Sm off .Fa x No / Fa y No \\*(Ba .Sm on = 1/2 then .Fa n is even. Consequently the remainder is computed exactly and .Sm off .Pf \\*(Ba Fa r No \\*(Ba .Sm on \*(Le .Sm off .Pf \\*(Ba Fa y No \\*(Ba/2. .Sm on But .Fn drem x 0 is exceptional. (See below under .Sx DIAGNOSTICS . ) .Pp The .Fn finite function returns the value 1 just when \-\*(If \*(Lt .Fa x \*(Lt +\*(If; otherwise a zero is returned (when .Pf \\*(Ba Ns Fa x Ns \\*(Ba = \*(If or .Fa x is \*(Na or is the .Tn VAX Ns 's reserved operand). .Pp The .Fn logb function returns .Fa x Ns 's exponent .Fa n , a signed integer converted to double\-precision floating\-point and so chosen that 1 (<= .Pf \\*(Ba Ns Fa x Ns \\*(Ba2** Ns Fa n < 2 unless .Fa x = 0 or (only on machines that conform to .Tn IEEE 754) .Pf \\*(Ba Fa x Ns \\*(Ba = \*(If or .Fa x lies between 0 and the Underflow Threshold. (See below under .Sx BUGS . ) .Pp The Fn calb returns .Fa x Ns \(**(2** Ns Fa n ) computed, for integer n, without first computing .Pf 2\(** Fa n . .Sh RETURN VALUES The .Tn IEEE standard 754 defines .Fn drem x 0 and .Fn drem \\*(If y to be invalid operations that produce a \*(Na. On the .Tn VAX , .Fn drem x 0 generates a reserved operand fault. No \*(If exists on a .Tn VAX . .Pp .Tn IEEE 754 defines .if n \ .Fn logb \(+-\\*(If = \*(If and .Fn logb 0 = \-\*(If, and requires the latter to signal Division\-by\-Zero. But on a .Tn VAX , .Fn logb 0 = 1.0 \- 2.0**31 = \-2,147,483,647.0. And if the correct value of .Fn scalb would overflow on a .Tn VAX , it generates a reserved operand fault and sets the global variable .Va errno to .Dv ERANGE . .Sh SEE ALSO .Xr floor 3 , .Xr math 3 , .Xr infnan 3 .Sh HISTORY The .Nm ieee functions appeared in .Bx 4.3 . .Sh BUGS Should .Fn drem x 0 and .Fn logb 0 on a .Tn VAX signal invalidity by setting .Va errno No = Dv EDOM ? Should .Fn logb 0 return \-1.7e38? .Pp .Tn IEEE 754 currently specifies that .Fn logb "denormalized no." = .Fn logb "tiniest normalized no. > 0" but the consensus has changed to the specification in the new proposed .Tn IEEE standard p854, namely that .Fn logb x satisfy .Bd -filled -offset indent 1 \(<= .Fn scalb \\*(Bax\\*(Ba \-logb(x) < Radix\0 ... = 2 for .Tn IEEE 754 .Ed .Pp for every x except 0, \*(If and \*(Na. Almost every program that assumes 754's specification will work correctly if .Fn logb follows 854's specification instead. .Pp .Tn IEEE 754 requires .Fn copysign x \\*(Na) = .Pf \(+- Ns Fa x but says nothing else about the sign of a \*(Na. A \*(Na .Em N Ns ot .Em a .Em N Ns umber ) is similar in spirit to the .Tn VAX Ns 's reserved operand, but very different in important details. Since the sign bit of a reserved operand makes it look negative, .Bd -filled -offset indent .Fn copysign x "reserved operand" = .Pf \- Fa x ; .Ed .Pp should this return the reserved operand instead? octave-1.1.0/bsd-math/man3/infnan.3100666 415 17 11342 5341366340 15056 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)infnan.3 6.5 (Berkeley) 4/19/91 .\" .Dd April 19, 1991 .Dt INFNAN 3 .Os BSD 4.3 .Sh NAME .Nm infnan .Nd signals invalid floating\-point operations on a .Tn VAX (temporary) .Sh SYNOPSIS .Fd #include .Ft double .Fn infnan "int iarg" .Sh DESCRIPTION At some time in the future, some of the useful properties of the Infinities and \*(Nas in the .Tn IEEE standard 754 for Binary Floating\-Point Arithmetic will be simulated in .Tn UNIX on the .Tn DEC VAX by using its Reserved Operands. Meanwhile, the Invalid, Overflow and Divide\-by\-Zero exceptions of the .Tn IEEE standard are being approximated on a .Tn VAX by calls to a procedure .Fn infnan in appropriate places in .Xr libm 3 . When better exception\-handling is implemented in .Tn UNIX , only .Fn infnan among the codes in .Xr libm will have to be changed. And users of .Xr libm can design their own .Fn infnan now to insulate themselves from future changes. .Pp Whenever an elementary function code in .Xr libm has to simulate one of the aforementioned .Tn IEEE exceptions, it calls .Fn infnan iarg with an appropriate value of .Fa iarg . Then a reserved operand fault stops computation. But .Fn infnan could be replaced by a function with the same name that returns some plausible value, assigns an apt value to the global variable .Va errno , and allows computation to resume. Alternatively, the Reserved Operand Fault Handler could be changed to respond by returning that plausible value, etc. instead of aborting. .Pp In the table below, the first two columns show various exceptions signaled by the .Tn IEEE standard, and the default result it prescribes. The third column shows what value is given to .Fa iarg by functions in .Xr libm when they invoke .Fn infnan iarg under analogous circumstances on a .Tn VAX . Currently .Fn infnan stops computation under all those circumstances. The last two columns offer an alternative; they suggest a setting for .Va errno and a value for a revised .Fn infnan to return. And a C program to implement that suggestion follows. .sp 0.5 .Bd -filled -offset indent .Bl -column "IEEE Signal" "IEEE Default" XXERANGE ERANGEXXorXXEDOM .It IEEE Signal IEEE Default Ta .Fa iarg Ta .Va errno Ta .Fn infnan .It Invalid \*(Na Ta .Dv EDOM EDOM 0 .It Overflow \(+-\*(If Ta .Dv ERANGE ERANGE HUGE .It Div\-by\-0 \(+-Infinity Ta .Dv \(+-ERANGE ERANGE or EDOM \(+-HUGE .It ( Ns Dv HUGE No "= 1.7e38 ... nearly 2.0**127)" .El .Ed .Pp ALTERNATIVE .Fn infnan : .Bd -literal -offset indent #include #include extern int errno ; double infnan(iarg) int iarg ; { switch(iarg) { case \0ERANGE: errno = ERANGE; return(HUGE); case \-ERANGE: errno = EDOM; return(\-HUGE); default: errno = EDOM; return(0); } } .Ed .Sh SEE ALSO .Xr math 3 , .Xr intro 2 , .Xr signal 3 . .Pp .Dv ERANGE and .Dv EDOM are defined in .Aq Pa errno.h . (See .Xr intro 2 for explanation of .Dv EDOM and .Dv ERANGE . ) .Sh HISTORY The .Fn infnan function appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/j0.3100666 415 17 6376 5341366340 14111 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)j0.3 6.7 (Berkeley) 4/19/91 .\" .Dd April 19, 1991 .Dt J0 3 .Os BSD 4 .Sh NAME .Nm j0 , .Nm j1 , .Nm jn , .Nm y0 , .Nm y1 , .Nm yn .Nd bessel functions of first and second kind .Sh SYNOPSIS .Fd #include .Ft double .Fn j0 "double x" .Ft double .Fn j1 "double x" .Ft double .Fn jn "int n" "double x" .Ft double .Fn y0 "double x" .Ft double .Fn y1 "double x" .Ft double .Fn yn "int n" "double x" .Sh DESCRIPTION The functions .Fn j0 and .Fn j1 compute the .Em Bessel function of the first kind of the order 0 and the .Em order 1, respectively, for the real value .Fa x ; the function .Fn jn computes the .Em Bessel function of the first kind of the integer order .Fa n for the real value .Fa x . .Pp The functions .Fn y0 and .Fn y1 compute the linearly independent .Em Bessel function of the second kind of the order 0 and the .Em order 1, respectively, for the postive .Em integer value .Fa x (expressed as a double); the function .Fn yn computes the .Em Bessel function of the second kind for the integer order .Fa n for the postive .Em integer value .Fa x (expressed as a double). .Sh RETURN VALUES If these functions are successful, the computed value is returned. On the .Tn VAX and .Tn Tahoe architectures, a negative .Fa x value results in an error; the global variable .Va errno is set to .Er EDOM and a reserve operand fault is generated. .Sh SEE ALSO .Xr math 3 , .Xr infnan 3 .Sh HISTORY A set of these functions function appeared in .At v7 . octave-1.1.0/bsd-math/man3/lgamma.3100666 415 17 7076 5341366343 15037 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)lgamma.3 6.6 (Berkeley) 12/3/92 .\" .Dd December 3, 1992 .Dt LGAMMA 3 .Os BSD 4.3 .Sh NAME .Nm lgamma .Nm gamma .Nd log gamma function, gamma function .Sh SYNOPSIS .Fd #include .Ft extern int .Fa signgam ; .sp .Ft double .Fn lgamma "double x" .Ft double .Fn gamma "double x" .Sh DESCRIPTION .Fn Lgamma x .if t \{\ returns ln\||\(*G(x)| where .Bd -unfilled -offset indent \(*G(x) = \(is\d\s8\z0\s10\u\u\s8\(if\s10\d t\u\s8x\-1\s10\d e\u\s8\-t\s10\d dt for x > 0 and .br \(*G(x) = \(*p/(\(*G(1\-x)\|sin(\(*px)) for x < 1. .Ed .\} .if n \ returns ln\||\(*G(x)|. .Pp The external integer .Fa signgam returns the sign of \(*G(x). .Pp .Fn Gamma x returns \(*G(x), with no effect on .Fa signgam . .Sh IDIOSYNCRASIES Do not use the expression .Dq Li signgam\(**exp(lgamma(x)) to compute g := \(*G(x). Instead use a program like this (in C): .Bd -literal -offset indent lg = lgamma(x); g = signgam\(**exp(lg); .Ed .Pp Only after .Fn lgamma has returned can signgam be correct. .Pp For arguments in its range, .Fn gamma is preferred, as for positive arguments it is accurate to within one unit in the last place. Exponentiation of .Fn lgamma will lose up to 10 significant bits. .Sh RETURN VALUES .Fn Gamma and .Fn lgamma return appropriate values unless an arguent is out of range. Overflow will occur for sufficiently large positive values, and non-positive integers. On the .Tn VAX, the reserved operator is returned, and .Va errno is set to .Er ERANGE For large non-integer negative values, .Fn gamma will underflow. .Sh SEE ALSO .Xr math 3 , .Xr infnan 3 .Sh HISTORY The .Nm lgamma function appeared in .Bx 4.3 . The .Nm gamma function appeared in .Bx 4.4 . The name .Fn gamma was originally dedicated to the .Fn lgamma function, so some old code may no longer be compatible. octave-1.1.0/bsd-math/man3/math.3100666 415 17 53045 5341366346 14552 0ustar jweusers.\" Copyright (c) 1985 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)math.3 6.10 (Berkeley) 5/6/91 .\" .TH MATH 3M "May 6, 1991" .UC 4 .ds up \fIulp\fR .ds nn \fINaN\fR .de If .if n \\ \\$1Infinity\\$2 .if t \\ \\$1\\(if\\$2 .. .SH NAME math \- introduction to mathematical library functions .SH DESCRIPTION These functions constitute the C math library, .I libm. The link editor searches this library under the \*(lq\-lm\*(rq option. Declarations for these functions may be obtained from the include file .RI < math.h >. The Fortran math library is described in ``man 3f intro''. .SH "LIST OF FUNCTIONS" .sp 2 .nf .ta \w'copysign'u+2n +\w'infnan.3m'u+10n +\w'inverse trigonometric func'u \fIName\fP \fIAppears on Page\fP \fIDescription\fP \fIError Bound (ULPs)\fP .ta \w'copysign'u+4n +\w'infnan.3m'u+4n +\w'inverse trigonometric function'u+6nC .sp 5p acos sin.3m inverse trigonometric function 3 acosh asinh.3m inverse hyperbolic function 3 asin sin.3m inverse trigonometric function 3 asinh asinh.3m inverse hyperbolic function 3 atan sin.3m inverse trigonometric function 1 atanh asinh.3m inverse hyperbolic function 3 atan2 sin.3m inverse trigonometric function 2 cabs hypot.3m complex absolute value 1 cbrt sqrt.3m cube root 1 ceil floor.3m integer no less than 0 copysign ieee.3m copy sign bit 0 cos sin.3m trigonometric function 1 cosh sinh.3m hyperbolic function 3 drem ieee.3m remainder 0 erf erf.3m error function ??? erfc erf.3m complementary error function ??? exp exp.3m exponential 1 expm1 exp.3m exp(x)\-1 1 fabs floor.3m absolute value 0 floor floor.3m integer no greater than 0 hypot hypot.3m Euclidean distance 1 infnan infnan.3m signals exceptions j0 j0.3m bessel function ??? j1 j0.3m bessel function ??? jn j0.3m bessel function ??? lgamma lgamma.3m log gamma function; (formerly gamma.3m) log exp.3m natural logarithm 1 logb ieee.3m exponent extraction 0 log10 exp.3m logarithm to base 10 3 log1p exp.3m log(1+x) 1 pow exp.3m exponential x**y 60\-500 rint floor.3m round to nearest integer 0 scalb ieee.3m exponent adjustment 0 sin sin.3m trigonometric function 1 sinh sinh.3m hyperbolic function 3 sqrt sqrt.3m square root 1 tan sin.3m trigonometric function 3 tanh sinh.3m hyperbolic function 3 y0 j0.3m bessel function ??? y1 j0.3m bessel function ??? yn j0.3m bessel function ??? .ta .fi .SH NOTES In 4.3 BSD, distributed from the University of California in late 1985, most of the foregoing functions come in two versions, one for the double\-precision "D" format in the DEC VAX\-11 family of computers, another for double\-precision arithmetic conforming to the IEEE Standard 754 for Binary Floating\-Point Arithmetic. The two versions behave very similarly, as should be expected from programs more accurate and robust than was the norm when UNIX was born. For instance, the programs are accurate to within the numbers of \*(ups tabulated above; an \*(up is one \fIU\fRnit in the \fIL\fRast \fIP\fRlace. And the programs have been cured of anomalies that afflicted the older math library \fIlibm\fR in which incidents like the following had been reported: .RS sqrt(\-1.0) = 0.0 and log(\-1.0) = \-1.7e38. .br cos(1.0e\-11) > cos(0.0) > 1.0. .br pow(x,1.0) .if n \ != .if t \ \(!= x when x = 2.0, 3.0, 4.0, ..., 9.0. .br pow(\-1.0,1.0e10) trapped on Integer Overflow. .br sqrt(1.0e30) and sqrt(1.0e\-30) were very slow. .RE However the two versions do differ in ways that have to be explained, to which end the following notes are provided. .PP \fBDEC VAX\-11 D_floating\-point:\fR .PP This is the format for which the original math library \fIlibm\fR was developed, and to which this manual is still principally dedicated. It is \fIthe\fR double\-precision format for the PDP\-11 and the earlier VAX\-11 machines; VAX\-11s after 1983 were provided with an optional "G" format closer to the IEEE double\-precision format. The earlier DEC MicroVAXs have no D format, only G double\-precision. (Why? Why not?) .PP Properties of D_floating\-point: .RS Wordsize: 64 bits, 8 bytes. Radix: Binary. .br Precision: 56 .if n \ sig. .if t \ significant bits, roughly like 17 .if n \ sig. .if t \ significant decimals. .RS If x and x' are consecutive positive D_floating\-point numbers (they differ by 1 \*(up), then .br 1.3e\-17 < 0.5**56 < (x'\-x)/x \(<= 0.5**55 < 2.8e\-17. .RE .nf .ta \w'Range:'u+1n +\w'Underflow threshold'u+1n +\w'= 2.0**127'u+1n Range: Overflow threshold = 2.0**127 = 1.7e38. Underflow threshold = 0.5**128 = 2.9e\-39. NOTE: THIS RANGE IS COMPARATIVELY NARROW. .ta .fi .RS Overflow customarily stops computation. .br Underflow is customarily flushed quietly to zero. .br CAUTION: .RS It is possible to have x .if n \ != .if t \ \(!= y and yet x\-y = 0 because of underflow. Similarly x > y > 0 cannot prevent either x\(**y = 0 or y/x = 0 from happening without warning. .RE .RE Zero is represented ambiguously. .RS Although 2**55 different representations of zero are accepted by the hardware, only the obvious representation is ever produced. There is no \-0 on a VAX. .RE .If is not part of the VAX architecture. .br Reserved operands: .RS of the 2**55 that the hardware recognizes, only one of them is ever produced. Any floating\-point operation upon a reserved operand, even a MOVF or MOVD, customarily stops computation, so they are not much used. .RE Exceptions: .RS Divisions by zero and operations that overflow are invalid operations that customarily stop computation or, in earlier machines, produce reserved operands that will stop computation. .RE Rounding: .RS Every rational operation (+, \-, \(**, /) on a VAX (but not necessarily on a PDP\-11), if not an over/underflow nor division by zero, is rounded to within half an \*(up, and when the rounding error is exactly half an \*(up then rounding is away from 0. .RE .RE .PP Except for its narrow range, D_floating\-point is one of the better computer arithmetics designed in the 1960's. Its properties are reflected fairly faithfully in the elementary functions for a VAX distributed in 4.3 BSD. They over/underflow only if their results have to lie out of range or very nearly so, and then they behave much as any rational arithmetic operation that over/underflowed would behave. Similarly, expressions like log(0) and atanh(1) behave like 1/0; and sqrt(\-3) and acos(3) behave like 0/0; they all produce reserved operands and/or stop computation! The situation is described in more detail in manual pages. .RS .ll -0.5i \fIThis response seems excessively punitive, so it is destined to be replaced at some time in the foreseeable future by a more flexible but still uniform scheme being developed to handle all floating\-point arithmetic exceptions neatly. See infnan(3M) for the present state of affairs.\fR .ll +0.5i .RE .PP How do the functions in 4.3 BSD's new \fIlibm\fR for UNIX compare with their counterparts in DEC's VAX/VMS library? Some of the VMS functions are a little faster, some are a little more accurate, some are more puritanical about exceptions (like pow(0.0,0.0) and atan2(0.0,0.0)), and most occupy much more memory than their counterparts in \fIlibm\fR. The VMS codes interpolate in large table to achieve speed and accuracy; the \fIlibm\fR codes use tricky formulas compact enough that all of them may some day fit into a ROM. .PP More important, DEC regards the VMS codes as proprietary and guards them zealously against unauthorized use. But the \fIlibm\fR codes in 4.3 BSD are intended for the public domain; they may be copied freely provided their provenance is always acknowledged, and provided users assist the authors in their researches by reporting experience with the codes. Therefore no user of UNIX on a machine whose arithmetic resembles VAX D_floating\-point need use anything worse than the new \fIlibm\fR. .PP \fBIEEE STANDARD 754 Floating\-Point Arithmetic:\fR .PP This standard is on its way to becoming more widely adopted than any other design for computer arithmetic. VLSI chips that conform to some version of that standard have been produced by a host of manufacturers, among them ... .nf .ta 0.5i +\w'Intel i8070, i80287'u+6n Intel i8087, i80287 National Semiconductor 32081 Motorola 68881 Weitek WTL-1032, ... , -1165 Zilog Z8070 Western Electric (AT&T) WE32106. .ta .fi Other implementations range from software, done thoroughly in the Apple Macintosh, through VLSI in the Hewlett\-Packard 9000 series, to the ELXSI 6400 running ECL at 3 Megaflops. Several other companies have adopted the formats of IEEE 754 without, alas, adhering to the standard's way of handling rounding and exceptions like over/underflow. The DEC VAX G_floating\-point format is very similar to the IEEE 754 Double format, so similar that the C programs for the IEEE versions of most of the elementary functions listed above could easily be converted to run on a MicroVAX, though nobody has volunteered to do that yet. .PP The codes in 4.3 BSD's \fIlibm\fR for machines that conform to IEEE 754 are intended primarily for the National Semi. 32081 and WTL 1164/65. To use these codes with the Intel or Zilog chips, or with the Apple Macintosh or ELXSI 6400, is to forego the use of better codes provided (perhaps freely) by those companies and designed by some of the authors of the codes above. Except for \fIatan\fR, \fIcabs\fR, \fIcbrt\fR, \fIerf\fR, \fIerfc\fR, \fIhypot\fR, \fIj0\-jn\fR, \fIlgamma\fR, \fIpow\fR and \fIy0\-yn\fR, the Motorola 68881 has all the functions in \fIlibm\fR on chip, and faster and more accurate; it, Apple, the i8087, Z8070 and WE32106 all use 64 .if n \ sig. .if t \ significant bits. The main virtue of 4.3 BSD's \fIlibm\fR codes is that they are intended for the public domain; they may be copied freely provided their provenance is always acknowledged, and provided users assist the authors in their researches by reporting experience with the codes. Therefore no user of UNIX on a machine that conforms to IEEE 754 need use anything worse than the new \fIlibm\fR. .PP Properties of IEEE 754 Double\-Precision: .RS Wordsize: 64 bits, 8 bytes. Radix: Binary. .br Precision: 53 .if n \ sig. .if t \ significant bits, roughly like 16 .if n \ sig. .if t \ significant decimals. .RS If x and x' are consecutive positive Double\-Precision numbers (they differ by 1 \*(up), then .br 1.1e\-16 < 0.5**53 < (x'\-x)/x \(<= 0.5**52 < 2.3e\-16. .RE .nf .ta \w'Range:'u+1n +\w'Underflow threshold'u+1n +\w'= 2.0**1024'u+1n Range: Overflow threshold = 2.0**1024 = 1.8e308 Underflow threshold = 0.5**1022 = 2.2e\-308 .ta .fi .RS Overflow goes by default to a signed .If "" . .br Underflow is \fIGradual,\fR rounding to the nearest integer multiple of 0.5**1074 = 4.9e\-324. .RE Zero is represented ambiguously as +0 or \-0. .RS Its sign transforms correctly through multiplication or division, and is preserved by addition of zeros with like signs; but x\-x yields +0 for every finite x. The only operations that reveal zero's sign are division by zero and copysign(x,\(+-0). In particular, comparison (x > y, x \(>= y, etc.) cannot be affected by the sign of zero; but if finite x = y then .If \&= 1/(x\-y) .if n \ != .if t \ \(!= \-1/(y\-x) = .If \- . .RE .If is signed. .RS it persists when added to itself or to any finite number. Its sign transforms correctly through multiplication and division, and .If (finite)/\(+- \0=\0\(+-0 (nonzero)/0 = .If \(+- . But .if n \ Infinity\-Infinity, Infinity\(**0 and Infinity/Infinity .if t \ \(if\-\(if, \(if\(**0 and \(if/\(if are, like 0/0 and sqrt(\-3), invalid operations that produce \*(nn. ... .RE Reserved operands: .RS there are 2**53\-2 of them, all called \*(nn (\fIN\fRot \fIa N\fRumber). Some, called Signaling \*(nns, trap any floating\-point operation performed upon them; they are used to mark missing or uninitialized values, or nonexistent elements of arrays. The rest are Quiet \*(nns; they are the default results of Invalid Operations, and propagate through subsequent arithmetic operations. If x .if n \ != .if t \ \(!= x then x is \*(nn; every other predicate (x > y, x = y, x < y, ...) is FALSE if \*(nn is involved. .br NOTE: Trichotomy is violated by \*(nn. .RS Besides being FALSE, predicates that entail ordered comparison, rather than mere (in)equality, signal Invalid Operation when \*(nn is involved. .RE .RE Rounding: .RS Every algebraic operation (+, \-, \(**, /, .if n \ sqrt) .if t \ \(sr) is rounded by default to within half an \*(up, and when the rounding error is exactly half an \*(up then the rounded value's least significant bit is zero. This kind of rounding is usually the best kind, sometimes provably so; for instance, for every x = 1.0, 2.0, 3.0, 4.0, ..., 2.0**52, we find (x/3.0)\(**3.0 == x and (x/10.0)\(**10.0 == x and ... despite that both the quotients and the products have been rounded. Only rounding like IEEE 754 can do that. But no single kind of rounding can be proved best for every circumstance, so IEEE 754 provides rounding towards zero or towards .If + or towards .If \- at the programmer's option. And the same kinds of rounding are specified for Binary\-Decimal Conversions, at least for magnitudes between roughly 1.0e\-10 and 1.0e37. .RE Exceptions: .RS IEEE 754 recognizes five kinds of floating\-point exceptions, listed below in declining order of probable importance. .RS .nf .ta \w'Invalid Operation'u+6n +\w'Gradual Underflow'u+2n Exception Default Result .tc \(ru .tc Invalid Operation \*(nn, or FALSE .if n \{\ Overflow \(+-Infinity Divide by Zero \(+-Infinity \} .if t \{\ Overflow \(+-\(if Divide by Zero \(+-\(if \} Underflow Gradual Underflow Inexact Rounded value .ta .fi .RE NOTE: An Exception is not an Error unless handled badly. What makes a class of exceptions exceptional is that no single default response can be satisfactory in every instance. On the other hand, if a default response will serve most instances satisfactorily, the unsatisfactory instances cannot justify aborting computation every time the exception occurs. .RE .PP For each kind of floating\-point exception, IEEE 754 provides a Flag that is raised each time its exception is signaled, and stays raised until the program resets it. Programs may also test, save and restore a flag. Thus, IEEE 754 provides three ways by which programs may cope with exceptions for which the default result might be unsatisfactory: .IP 1) \w'\0\0\0\0'u Test for a condition that might cause an exception later, and branch to avoid the exception. .IP 2) \w'\0\0\0\0'u Test a flag to see whether an exception has occurred since the program last reset its flag. .IP 3) \w'\0\0\0\0'u Test a result to see whether it is a value that only an exception could have produced. .RS CAUTION: The only reliable ways to discover whether Underflow has occurred are to test whether products or quotients lie closer to zero than the underflow threshold, or to test the Underflow flag. (Sums and differences cannot underflow in IEEE 754; if x .if n \ != .if t \ \(!= y then x\-y is correct to full precision and certainly nonzero regardless of how tiny it may be.) Products and quotients that underflow gradually can lose accuracy gradually without vanishing, so comparing them with zero (as one might on a VAX) will not reveal the loss. Fortunately, if a gradually underflowed value is destined to be added to something bigger than the underflow threshold, as is almost always the case, digits lost to gradual underflow will not be missed because they would have been rounded off anyway. So gradual underflows are usually \fIprovably\fR ignorable. The same cannot be said of underflows flushed to 0. .RE .PP At the option of an implementor conforming to IEEE 754, other ways to cope with exceptions may be provided: .IP 4) \w'\0\0\0\0'u ABORT. This mechanism classifies an exception in advance as an incident to be handled by means traditionally associated with error\-handling statements like "ON ERROR GO TO ...". Different languages offer different forms of this statement, but most share the following characteristics: .IP \(em \w'\0\0\0\0'u No means is provided to substitute a value for the offending operation's result and resume computation from what may be the middle of an expression. An exceptional result is abandoned. .IP \(em \w'\0\0\0\0'u In a subprogram that lacks an error\-handling statement, an exception causes the subprogram to abort within whatever program called it, and so on back up the chain of calling subprograms until an error\-handling statement is encountered or the whole task is aborted and memory is dumped. .IP 5) \w'\0\0\0\0'u STOP. This mechanism, requiring an interactive debugging environment, is more for the programmer than the program. It classifies an exception in advance as a symptom of a programmer's error; the exception suspends execution as near as it can to the offending operation so that the programmer can look around to see how it happened. Quite often the first several exceptions turn out to be quite unexceptionable, so the programmer ought ideally to be able to resume execution after each one as if execution had not been stopped. .IP 6) \w'\0\0\0\0'u \&... Other ways lie beyond the scope of this document. .RE .PP The crucial problem for exception handling is the problem of Scope, and the problem's solution is understood, but not enough manpower was available to implement it fully in time to be distributed in 4.3 BSD's \fIlibm\fR. Ideally, each elementary function should act as if it were indivisible, or atomic, in the sense that ... .IP i) \w'iii)'u+2n No exception should be signaled that is not deserved by the data supplied to that function. .IP ii) \w'iii)'u+2n Any exception signaled should be identified with that function rather than with one of its subroutines. .IP iii) \w'iii)'u+2n The internal behavior of an atomic function should not be disrupted when a calling program changes from one to another of the five or so ways of handling exceptions listed above, although the definition of the function may be correlated intentionally with exception handling. .PP Ideally, every programmer should be able \fIconveniently\fR to turn a debugged subprogram into one that appears atomic to its users. But simulating all three characteristics of an atomic function is still a tedious affair, entailing hosts of tests and saves\-restores; work is under way to ameliorate the inconvenience. .PP Meanwhile, the functions in \fIlibm\fR are only approximately atomic. They signal no inappropriate exception except possibly ... .RS Over/Underflow .RS when a result, if properly computed, might have lain barely within range, and .RE Inexact in \fIcabs\fR, \fIcbrt\fR, \fIhypot\fR, \fIlog10\fR and \fIpow\fR .RS when it happens to be exact, thanks to fortuitous cancellation of errors. .RE .RE Otherwise, ... .RS Invalid Operation is signaled only when .RS any result but \*(nn would probably be misleading. .RE Overflow is signaled only when .RS the exact result would be finite but beyond the overflow threshold. .RE Divide\-by\-Zero is signaled only when .RS a function takes exactly infinite values at finite operands. .RE Underflow is signaled only when .RS the exact result would be nonzero but tinier than the underflow threshold. .RE Inexact is signaled only when .RS greater range or precision would be needed to represent the exact result. .RE .RE .SH BUGS When signals are appropriate, they are emitted by certain operations within the codes, so a subroutine\-trace may be needed to identify the function with its signal in case method 5) above is in use. And the codes all take the IEEE 754 defaults for granted; this means that a decision to trap all divisions by zero could disrupt a code that would otherwise get correct results despite division by zero. .SH SEE ALSO An explanation of IEEE 754 and its proposed extension p854 was published in the IEEE magazine MICRO in August 1984 under the title "A Proposed Radix\- and Word\-length\-independent Standard for Floating\-point Arithmetic" by W. J. Cody et al. The manuals for Pascal, C and BASIC on the Apple Macintosh document the features of IEEE 754 pretty well. Articles in the IEEE magazine COMPUTER vol. 14 no. 3 (Mar. 1981), and in the ACM SIGNUM Newsletter Special Issue of Oct. 1979, may be helpful although they pertain to superseded drafts of the standard. octave-1.1.0/bsd-math/man3/rint.3100666 415 17 6276 5341366350 14554 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)rint.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt RINT 3 .Os .Sh NAME .Nm rint .Nd and round-to-closest integer functions .Sh SYNOPSIS .Fd #include .Ft double .Fn rint "double x" .Sh DESCRIPTION The .Fn rint function finds the integer (represented as a double precision number) nearest to .Fa x in the direction of the prevailing rounding mode. .Sh NOTES On a .Tn VAX , .Fn rint x is equivalent to adding half to the magnitude and then rounding towards zero. .Pp In the default rounding mode, to nearest, on a machine that conforms to .Tn IEEE 754, .Fn rint x is the integer nearest .Fa x with the additional stipulation that if .Li |rint(x)\-x|=1/2 then .Fn rint x is even. Other rounding modes can make .Fn rint act like .Fn floor , or like .Fn ceil , or round towards zero. .Pp Another way to obtain an integer near .Fa x is to declare (in C) .Bd -literal -offset indent double x;\0\0\0\0 int k;\0\0\0\0k\0=\0x; .Ed .Pp Most C compilers round .Fa x towards 0 to get the integer .Fa k , but some do otherwise. If in doubt, use .Fn floor , .Fn ceil , or .Fn rint first, whichever you intend. Also note that, if x is larger than .Fa k can accommodate, the value of .Fa k and the presence or absence of an integer overflow are hard to predict. .Sh SEE ALSO .Xr abs 3 , .Xr fabs 3 , .Xr ceil 3 , .Xr floor 3 , .Xr ieee 3 , .Xr math 3 .Sh HISTORY A .Fn rint function appeared in .At v6 . octave-1.1.0/bsd-math/man3/sin.3100666 415 17 4700 5341366350 14357 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" @(#)sin.3 6.7 (Berkeley) 4/19/91 .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)sin.3 6.7 (Berkeley) 4/19/91 .\" .Dd April 19, 1991 .Dt SIN 3 .Os .Sh NAME .Nm sin .Nd sine function .Sh SYNOPSIS .Fd #include .Ft double .Fn sin "double x" .Sh DESCRIPTION The .Fn sin function computes the sine of .Fa x (measured in radians). A large magnitude argument may yield a result with little or no significance. .Sh RETURN VALUES The .Fn sin function returns the sine value. .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sinh 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn sin function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/sinh.3100666 415 17 4711 5341366351 14532 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)sinh.3 6.6 (Berkeley) 4/19/91 .Dd April 19, 1991 .Dt SINH 3 .Os .Sh NAME .Nm sinh .Nd hyperbolic sine function .Sh SYNOPSIS .Fd #include .Ft double .Fn sinh "double x" .Sh DESCRIPTION The .Fn sinh function computes the hyperbolic sine of .Fa x . .Sh RETURN VALUES The .Fn sinh function returns the hyperbolic sine value unless the magnitude of .Fa x is too large; in this event, the global variable .Va errno is set to .Er ERANGE . .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr tan 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn sinh function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/sqrt.3100666 415 17 6166 5341366351 14570 0ustar jweusers.\" Copyright (c) 1985, 1991 Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)sqrt.3 6.4 (Berkeley) 5/6/91 .\" .Dd May 6, 1991 .Dt SQRT 3 .Os .Sh NAME .Nm cbrt , .Nm sqrt .Nd cube root and square root functions .Sh SYNOPSIS .Fd #include .Ft double .Fn cbrt "double x" .Ft double .Fn sqrt "double x" .Sh DESCRIPTION The .Fn cbrt function computes the cube root of .Ar x . .Pp The .Fn sqrt computes the non-negative square root of x. .Sh RETURN VALUES The .Fn cbrt function returns the requested cube root. The .Fn sqrt function returns the requested square root unless an error occurs. On the .Tn VAX or .Tn Tahoe processor an attempt to take the .Fn sqrt of negative .Fa x causes an error; in this event, the global variable .Va errno is set to .Dv EDOM and a reserved operand fault is generated. .Sh ERROR (due to Roundoff etc.) The .Fn cbrt function is accurate to within 0.7 .Em ulps . .Pp The .Fn sqrt function on a .Tn VAX is accurate to within 0.501 .Em ulps . Sqrt on a machine that conforms to .Tn IEEE 754 is correctly rounded in accordance with the rounding mode in force; the error is less than half an .Em ulp in the default mode (round\-to\-nearest). An .Em ulp is one .Em U Ns nit in the .Em L Ns ast .Em P Ns lace carried. .Sh SEE ALSO .Xr math 3 , .Xr infnan 3 .Sh STANDARDS The .Nm sqrt function conforms to .St -ansiC . .Sh HISTORY The .Nm cbrt function appeared in .Bx 4.3 . octave-1.1.0/bsd-math/man3/tan.3100666 415 17 4734 5341366352 14361 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)tan.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt TAN 3 .Os .Sh NAME .Nm tan .Nd tangent function .Sh SYNOPSIS .Fd #include .Ft double .Fn tan "double x" .Sh DESCRIPTION The .Fn tan function computes the tangent of .Fa x (measured in radians). A large magnitude argument may yield a result with little or no significance. For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn tan function returns the tangent value. .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tanh 3 , .Xr math 3 , .Sh STANDARDS The .Fn tan function conforms to .St -ansiC . octave-1.1.0/bsd-math/man3/tanh.3100666 415 17 4640 5341366352 14525 0ustar jweusers.\" Copyright (c) 1991 The Regents of the University of California. .\" All rights reserved. .\" .\" Redistribution and use in source and binary forms, with or without .\" modification, are permitted provided that the following conditions .\" are met: .\" 1. Redistributions of source code must retain the above copyright .\" notice, this list of conditions and the following disclaimer. .\" 2. Redistributions in binary form must reproduce the above copyright .\" notice, this list of conditions and the following disclaimer in the .\" documentation and/or other materials provided with the distribution. .\" 3. All advertising materials mentioning features or use of this software .\" must display the following acknowledgement: .\" This product includes software developed by the University of .\" California, Berkeley and its contributors. .\" 4. Neither the name of the University nor the names of its contributors .\" may be used to endorse or promote products derived from this software .\" without specific prior written permission. .\" .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF .\" SUCH DAMAGE. .\" .\" @(#)tanh.3 5.1 (Berkeley) 5/2/91 .\" .Dd May 2, 1991 .Dt TANH 3 .Os .Sh NAME .Nm tanh .Nd hyperbolic tangent function .Sh SYNOPSIS .Fd #include .Ft double .Fn tanh "double x" .Sh DESCRIPTION The .Fn tanh function computes the hyperbolic tangent of .Fa x . For a discussion of error due to roundoff, see .Xr math 3 . .Sh RETURN VALUES The .Fn tanh function returns the hyperbolic tangent value. .Sh SEE ALSO .Xr acos 3 , .Xr asin 3 , .Xr atan 3 , .Xr atan2 3 , .Xr cos 3 , .Xr cosh 3 , .Xr sin 3 , .Xr sinh 3 , .Xr tan 3 , .Xr math 3 , .Sh STANDARDS The .Fn tanh function conforms to .St -ansiC . octave-1.1.0/bsd-math/tanh.c100666 415 17 7177 5341366353 13760 0ustar jweusers/* * Copyright (c) 1985 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint static char sccsid[] = "@(#)tanh.c 5.5 (Berkeley) 10/9/90"; #endif /* not lint */ /* TANH(X) * RETURN THE HYPERBOLIC TANGENT OF X * DOUBLE PRECISION (VAX D FORMAT 56 BITS, IEEE DOUBLE 53 BITS) * CODED IN C BY K.C. NG, 1/8/85; * REVISED BY K.C. NG on 2/8/85, 2/11/85, 3/7/85, 3/24/85. * * Required system supported functions : * copysign(x,y) * finite(x) * * Required kernel function: * expm1(x) ...exp(x)-1 * * Method : * 1. reduce x to non-negative by tanh(-x) = - tanh(x). * 2. * 0 < x <= 1.e-10 : tanh(x) := x * -expm1(-2x) * 1.e-10 < x <= 1 : tanh(x) := -------------- * expm1(-2x) + 2 * 2 * 1 <= x <= 22.0 : tanh(x) := 1 - --------------- * expm1(2x) + 2 * 22.0 < x <= INF : tanh(x) := 1. * * Note: 22 was chosen so that fl(1.0+2/(expm1(2*22)+2)) == 1. * * Special cases: * tanh(NaN) is NaN; * only tanh(0)=0 is exact for finite argument. * * Accuracy: * tanh(x) returns the exact hyperbolic tangent of x nealy rounded. * In a test run with 1,024,000 random arguments on a VAX, the maximum * observed error was 2.22 ulps (units in the last place). */ double tanh(x) double x; { static double one=1.0, two=2.0, small = 1.0e-10, big = 1.0e10; double expm1(), t, copysign(), sign; int finite(); #if !defined(vax)&&!defined(tahoe) if(x!=x) return(x); /* x is NaN */ #endif /* !defined(vax)&&!defined(tahoe) */ sign=copysign(one,x); x=copysign(x,one); if(x < 22.0) if( x > one ) return(copysign(one-two/(expm1(x+x)+two),sign)); else if ( x > small ) {t= -expm1(-(x+x)); return(copysign(t/(two-t),sign));} else /* raise the INEXACT flag for non-zero x */ {big+x; return(copysign(x,sign));} else if(finite(x)) return (sign+1.0E-37); /* raise the INEXACT flag */ else return(sign); /* x is +- INF */ } octave-1.1.0/kpathsea/ 40777 415 17 0 5705523112 12642 5ustar jweusersoctave-1.1.0/kpathsea/AUTHORS100666 415 17 301 5637135101 13762 0ustar jweusersKarl Berry and Kathryn Hargreaves wrote all files. The implementation of the link trick in pathsrch.c is taken from GNU find, implemented by David MacKenzie from Matthew Farwell's suggestion. octave-1.1.0/kpathsea/ChangeLog100666 415 17 56724 5637135101 14550 0ustar jweusersThu Mar 31 07:25:49 1994 Karl Berry (karl@cs.umb.edu) * Version 1.8. Thu Mar 24 10:01:20 1994 Karl Berry (karl@cs.umb.edu) * tex-glyph.c: Doc fix. * pathsearch.c (path_search): Don't search the disk if there is magic in the path spec. * db.c: Doc fix. Wed Mar 16 13:50:17 1994 Karl Berry (karl@cs.umb.edu) * readable.c (kpse_readable_file): Complain if errno == EPERM. Sun Mar 13 11:14:19 1994 Karl Berry (karl@cs.umb.edu) * pathsearch.h (kpse_path_search): Take an extra arg must_exist. * pathsearch.c (kpse_path_search, search, path_search): Likewise. * tex-file.c (kpse_find_file): Change call. * tex-file.h (kpse_find_*): Change these calls, too. * hash.c (hash_create): Don't use xcalloc to init pointers to null. * db.c (kpse_db_search): Don't free the pointer after incrementing it. From Frank Jensen. Sat Mar 12 17:55:36 1994 Karl Berry (karl@cs.umb.edu) * db.h (kpse_db_search): Returns a pointer. * db.c (kpse_db_search): If db can't be built, return NULL, else a pointer to the (possibly empty) list. (db_build): Return whether we found the file. * pathsearch.c (path_search): Change call. Thu Mar 10 07:45:13 1994 Karl Berry (karl@cs.umb.edu) * Makefile.in (install-info): New target. Fri Mar 4 08:06:16 1994 Karl Berry (karl@cs.umb.edu) * hash.c (hash): Change hash function to spread out the values a bit better. * debug.h (DEBUG_DB_BUILD): New debug bit. * db.c (db_build) [DEBUG]: If bit is set, print hash table. * hash.h (hash_print): Declare. Thu Mar 3 08:52:01 1994 Karl Berry (karl@cs.umb.edu) * Version 1.7. Sun Feb 27 15:57:30 1994 Karl Berry (karl@cs.umb.edu) * Makefile.in (objects): Add db.o, hash.o. * db.[ch]: New files. * hash.[ch]: Also new files. * pathsearch.c (path_search): Try db search. * tex-glyph.c, fontmap.c: Use general hash functions. Sat Feb 26 13:15:53 1994 Karl Berry (karl@cs.umb.edu) * fontmap.c: Doc fix. * pathsearch.c (INIT_ALLOC): Increase to 75, what the heck. Fri Feb 25 08:30:50 1994 Karl Berry (karl@cs.umb.edu) * tex-file.[ch]: Decare args const. Thu Feb 24 07:55:43 1994 Karl Berry (karl@cs.umb.edu) * tex-make.h: Include tex-file.h, not init-path.h. * init-path.h (KPSE_*_{ENVS,PATHS}, kpse_font_override_path): Move to tex-font.h. * tex-font.h (kpse_find_{file,tfm,vf}): Also declare these. * tex-font.c (kpse_find_file): Define these. (kpse_font_override_path): Move definition here. * tex-file.*: Rename from tex-font.*. * GNUmakefile: Corresponding changes. * elt-dirs.c (do_subdir): Only append the / once we know it's a directory. Wed Feb 23 16:41:31 1994 Karl Berry (karl@cs.umb.edu) * elt-dirs.c (do_subdir): Don't tack POST on if it is exactly the d_name, so we can find a/b with a path of a//b. * c-vararg.h (PVAR3[CH]): New defines. * init-path.h: Include KPSE_*_{ENVS,PATHS} here. (kpse_init_path): Take an additional arg font_p. * init-path.c (kpse_override_path): Rename kpse_font_override_path. (kpse_init_path): Only use kpse_font_override_font if font_p. Mon Feb 21 15:38:53 1994 Karl Berry (karl@cs.umb.edu) * common.ac (extrasub): Define to remove VPATH lines if srcdir = `.'. Thu Feb 3 06:19:49 1994 Karl Berry (karl@cs.umb.edu) * Version 1.6. * fn.c (fn_copy0): Remember to allocate space for the null. Thanks, simon. Wed Feb 2 09:57:47 1994 Karl Berry (karl@cs.umb.edu) * tex-make.h (KPSE_BITMAP_TOLERANCE): Move to here from tex-glyph.c (kpse_check_bitmap_tolerance): Declare. * tex-make.c (kpse_check_bitmap_tolerance): Define. Tue Feb 1 10:42:03 1994 Karl Berry (karl@cs.umb.edu) * c-std.h (*alloc) [! _MALLOC_INTERNAL]: Make decl conditional. * c-std.h [HAVE_STDLIB_H]: Change #if for including to this. * common.ac (AC_HAVE_HEADERS): Check for stdlib.h. * Makefile.in (paths.h): Do all substitutions globally. * absolute.c [DOS]: Include c-ctype.h. * tex-glyph.c (KPATHSEA_BITMAP_NAME) [DOS]: Double the backslash. * elt-dirs.c (do_subdir) [!UNIX_ST_LINK]: Avoid dangling else. From Wayne. * paths.h.in: Doc fix. * xputenv.c (xputenv): Check entire variable name for being saved, not just a prefix of it. Mon Jan 31 12:05:30 1994 Karl Berry (karl@cs.umb.edu) * fn.c (fn_copy0): Allocate LEN if that's bigger than CHUNK_SIZE. (CHUNK_SIZE): Increase to 75. Sat Jan 22 15:36:08 1994 Karl Berry (karl@cs.umb.edu) * Version 1.5. * common.ac (AC_HAVE_FUNCS): Check for memmove. * paths.h.in (DEFAULT_MF_PATH): Don't search just public/, cause we need ams/. Mon Jan 17 15:09:36 1994 Karl Berry (karl@cs.umb.edu) * paths.h.in (DEFAULT_{FMT,BASE}_PATH): Include `.'. Sun Jan 16 14:50:02 1994 Karl Berry (karl@cs.umb.edu) * paths.h.in (DEFAULT_PK_PATH): Search subdirs of pk. Mon Jan 10 16:40:35 1994 Karl Berry (karl@cs.umb.edu) * xputenv.c (xputenv): Don't try to be smart about saving/freeing stuff if SMART_PUTENV is defined. * c-std.h (assert) [!HAVE_ASSERT_H]: Define as nothing, to avoid undefined references to assert. Tue Dec 21 16:28:13 1993 Karl Berry (karl@cs.umb.edu) * c-std.h (SYSV) [STDC_HEADERS]: Define, to get around old X include files under hpux. Sun Dec 19 13:06:15 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (objects): Put tex-font.o first. Sat Dec 18 15:03:57 1993 Karl Berry (karl@cs.umb.edu) * config.h (GCC_WCHAR_T, _GCC_WCHAR_T): Remove these; I have another theory now for wchar_t, done in xdvi.h and x11.c. Sat Dec 18 14:41:15 1993 Karl Berry (karl@owl.hq.ileaf.com) * c-memstr.h ([r]index) [STDC_HEADERS]: Conditionalize #define. Tue Dec 14 17:43:30 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (paths.h): Change substitutions accordingly. * paths.h.in (DEFAULT_FMT_PATH): Variable is now fmtdir. (DEFAULT_{BIB,BST}_PATH): Variable is now texmf_prefix. Sat Dec 11 13:21:43 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c (ABS): New macro. (kpse_set_maketex_mag): Use it, instead of fabs. Fri Dec 10 15:31:16 1993 Karl Berry (karl@cs.umb.edu) * xmalloc.c, xrealloc.c: Use exit instead of abort, remove abort decls, and reword error messages to be less cryptic. From john@minster.york.ac.uk. * dir.h: use `defined' instead of just `DIRENT || _POSIX_VERSION'. How annoying. From kretschm@aitxu3.ait.physik.uni-tuebingen.de. * xputenv.c (putenv): Remove declaration, as different systems do it differently. From kayvan@satyr.sylvan.com. Thu Dec 9 09:12:33 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c (kpse_set_maketex_mag): Allow off-by-1 when deciding if a dpi is a magstep. Tue Dec 7 11:03:51 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c (kpse_set_maketex_mag): New routine from dvips, called by dvipsk and xdvik to ensure consistency. (magstep): Subroutine of above, also from dvips. * tex-make.h: Declare it. * tex-doc.texi: Correct menu item (from maechler@stat.math.ethz.ch). Fri Dec 3 12:53:38 1993 Karl Berry (karl@cs.umb.edu) * c-pathmx.h: Doc fix. Sat Nov 27 14:36:11 1993 Karl Berry (karl@cs.umb.edu) * default.h: Doc fix. * paths.h.in (texfontdir): This has been renamed to fontdir. Sun Nov 21 08:28:41 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (distdir): Include HIER in the distribution, until we merge it into the manual. Sun Nov 7 14:54:47 1993 Karl Berry (karl@cs.umb.edu) * c-namemx.h (NAME_MAX): Avoid use of pathconf. * c-pathmx.h: Doc fix. Thu Nov 4 14:50:45 1993 Karl Berry (karl@cs.umb.edu) * config.h (_GCC_WCHAR_T) [!GCC_WCHAR]: Conditionalize. * c-std.h (EXIT_SUCCESS) [!EXIT_SUCCESS]: Move these defines outside of !STDC_HEADERS, for the sake of SunOS 4.1.1. (From vonbrand@inf.utfsm.cl.) Wed Nov 3 14:43:05 1993 Karl Berry (karl@cs.umb.edu) * Version 1.4. Wed Nov 3 07:05:48 1993 Karl Berry (karl@cs.umb.edu) * paths.h.in (DEFAULT_{BASE,FMT}_PATH): Had these definitions reversed. Fri Oct 29 19:27:36 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (try_fallback_resolutions): Initialize ret in all cases. Thu Oct 28 14:32:34 1993 Karl Berry (karl@cs.umb.edu) * lib.h: Doc fix. * common.h (AC_UNISTD_H): Replace this with unistd.h in the list of HAVE_HEADERS. Tue Oct 26 13:59:33 1993 Karl Berry (karl@cs.umb.edu) * str-llist.[ch]: New files. * Makefile.in (objects): Add str_llist.o. * elt-dirs.[ch]: Use str_llist_type throughout. * pathsearch.c (dir_list_search): Take a str_llist_type, and float a successful dir towards the top. (path_search): Change call of kpse_element_dirs. Sun Oct 24 19:41:49 1993 Karl Berry (karl@cs.umb.edu) * elt-dirs.c (do_optional): Remove this stub. (expand_elt): Don't call it. Fri Oct 22 14:46:44 1993 Karl Berry (karl@cs.umb.edu) * xmalloc.c, xrealloc.c, line.c, pathsearch.c: Doc fix. Tue Oct 19 12:11:32 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (try_fallback_resolutions): New routine. (kpse_find_glyph_format): Call it, instead of repeating (the now pretty complicated) code. * tex-font.c (kpse_init_fallback_resolutions): Pass the value of any environment variable, not its name. From R.Kooijman@et.tudelft.nl. * c-memstr.h (str[r]chr) [!str[r]chr]: Conditionalize. From maarrrk@seidel.ece.ucsb.edu. Tue Oct 12 16:26:48 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c: Doc fix. Thu Oct 7 13:13:57 1993 Karl Berry (karl@cs.umb.edu) * xmalloc.c: Rewrite to not require . * xrealloc.c: Likewise. * make-suffix.c (make_suffix): Declare variables const. * remove-suffx.c (remove_suffix): Likewise. Also rename to rm-suffix.c. * xputenv.c (putenv): Declare with correct prototype. * fontmap.c (internal routines): Likewise. * line.c (xmalloc, xrealloc): Declare as void *. (From john@minster.york.ac.uk.) Wed Oct 6 06:49:53 1993 Karl Berry (karl@cs.umb.edu) * Version 1.3. * tilde.c (kpse_tilde_expand): Always return a malloc-ed value. (From ken@cs.toronto.edu.) Sun Oct 3 14:11:33 1993 Karl Berry (karl@cs.umb.edu) * config.h (_GCC_WCHAR_T): Define. Sat Oct 2 17:17:32 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (install-*): Don't reassign PATH, just invoke mkdirchain explicitly. * tex-glyph.c (KPATHSEA_BITMAP_NAME) [DOS]: Define what I think will work for this ... * paths.h.in: Doc fix. * Makefile.in: Doc fix. * tex-glyph.c (kpse_find_glyph_format): Unconditionally initialize glyph_paths[*], since we might use them both in try_size. From worsch@ira.uka.de. Fri Oct 1 12:02:11 1993 Karl Berry (karl@cs.umb.edu) * expand.c: Doc fix. Wed Sep 29 15:21:49 1993 (karl@terminus.cs.umb.edu) * Version 1.2. Sat Sep 25 14:12:00 1993 Karl Berry (karl@cs.umb.edu) * pathsearch.c (path_search, absolute_search): Don't initialize structs. Fri Sep 24 12:50:00 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (try_size): Skip the simultaneous stuff. (try_format): Set the envvar here. (bitmap_name): Not here. * pathsearch.c (kpse_*_multi_search): Delete. Change most other routines to take only a single name again, instead of a name list. * pathsearch.h: Delete decls. * tex-glyph.c (init-path.h): Don't need to include this. * tex-glyph.c (kpse_find_glyph_format): Try the fallback resolutions for the fallback font. * Makefile.in (warn_more, MAKEINFO_FLAGS) [hayley]: Define these for development and distribution. * Makefile.in (dvi): Make analogous to info (including use of new suffix rule). * tex-glyph.c (kpse_find_glyph_format): Set KPATHSEA_NAME to the fallback font if we get that far. Wed Sep 15 19:29:56 1993 Karl Berry (karl@cs.umb.edu) * filefmt.h (KPSE_*_PATH): Pass NULL as first arg. * xputenv.c (xputenv): Rewrite again to save the variable names, not the old items. Mon Sep 13 06:55:29 1993 Karl Berry (karl@cs.umb.edu) * concatn.h: Doc fix. Sun Sep 12 15:54:55 1993 Karl Berry (karl@cs.umb.edu) * lib.h (XTALLOC): Parenthesize the cast. * xputenv.c (xputenv): Rewrite to collect some of the garbage. Fri Sep 10 14:00:35 1993 Karl Berry (karl@cs.umb.edu) * lib.h (ENVVAR_SET_DEFAULT): No longer needed. * xputenv.c (xputenv_int): New routine. Thu Sep 9 14:58:00 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c (MAKE_TEX_PK_SPEC): Change MAKETEX_DPI to KPATHSEA_DPI. * tex-glyph.c (try_fontmap): Use KPSE_GLYPH_PATH. * filefmt.c (KPSE_GLYPH_{PATH,ENVS}): New macros. (KPSE_{GF,PK}_ENVS): Use GLYPH_ENVS. * tex-glyph.c (bitmap_name): Rewrite to use a variable spec, introducing KPATHSEA_{BITMAP_NAME,FORMAT,DPI,NAME}. (kpse_find_glyph_format): Set KPATHSEA_DPI instead of MAKETEX_DPI; also set KPATHSEA_NAME. (try_fontmap): Also set KPATHSEA_NAME here. (try_size): Set KPATHSEA_DPI here. * tex-glyph.c (try_name): Delete this routine. (kpse_find_glyph_format): Try fallback resolutions here, call try_resolution directly. (try_fontmap): Call try_resolution directly. * init-path.h: Need not include c-proto.h. Sun Aug 29 13:34:25 1993 Karl Berry (karl@cs.umb.edu) * tex-make.c: Doc fix. * filefmt.h: Don't need c-proto.h or types.h. Fri Aug 27 10:36:46 1993 Karl Berry (karl@cs.umb.edu) * c-vararg.h (PVAR2C): Take AP as an arg. * init-path.[ch] (kpse_init_path): Take the current value as an additional argument, separate from the default path, and always expand_default. * uppercasify.c (uppercasify): Don't discard upcased result! Thu Aug 26 10:36:28 1993 Karl Berry (karl@cs.umb.edu) * Version 1.1. Sun Aug 22 19:18:35 1993 Karl Berry (karl@cs.umb.edu) * install-data (install-data): Replace nonexistent $(kpath_includedir) with $(includedir), and define it. Also remove c-auto.h. Thu Aug 5 09:03:22 1993 Karl Berry (karl@cs.umb.edu) * Version 1.0. Wed Aug 4 13:51:24 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (kpse_find_glyph_format): Fill in the font_file struct in the maketex case. * Makefile.in (info): Just depend on kpathsea.info, and rely on new suffix rule to do the work. Tue Aug 3 17:50:40 1993 Karl Berry (karl@fishbowl.hq.ileaf.com) * tex-glyph.c (try_name): Don't free expanded_name if we're returning it. Tue Aug 3 10:13:43 1993 Karl Berry (karl@owl.hq.ileaf.com) * version.c (kpathsea_version_string): Do not declare const. * line.h (read_line): Protoize decl. Tue Aug 3 09:10:07 1993 Karl Berry (karl@blood.hq.ileaf.com) * c-memstr.h (bcmp, bcopy, bzero) [!HAVE_BCOPY]: Conditionalize. * putenv.c: Include , and use const when calling memcpy. Sun Aug 1 08:48:49 1993 Karl Berry (karl@cs.umb.edu) * Add new features to manual. * Makefile.in (objects): Include putenv.o. * putenv.c: New file from gdb. * common.ac: Test for putenv. Sat Jul 31 11:54:31 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (distclean): Remove paths.h. * Most files: changes for traditional C compatibility. * filefmt.h: Add new KPSE_..._PATH's for the other formats. * paths.h.in: Add defaults. * Makefile.in (paths.h): sed the values in. Fri Jul 30 17:23:10 1993 Karl Berry (karl@cs.umb.edu) * filefmt.h (KPSE_VF_PATH): Add empty parens. * tex-paths.h*: Rename to just paths.h*. Tue Jul 27 09:00:58 1993 Karl Berry (karl@cs.umb.edu) * filefmt.h: Include tex-paths.h, and use default paths in KPSE_..._PATH macros. * find-suffix.c: Correct logic. * filefmt.h: Include init-path.h. Sat Jul 24 10:44:21 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (kpse_find_glyph_format): Assign to it. * tex-font.h (kpse_font_file_type): New member `source'. (KPSE_FONT_FILE_SOURCE): Accessor macro. (kpse_source_type): New type. Wed Jul 21 19:45:45 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (configclean): New target. Sun Jul 18 13:53:38 1993 Karl Berry (karl@cs.umb.edu) * tilde.[ch] (kpse_expand_tilde): Rename to kpse_tilde_expand. * elt-dirs.c, pathsearch.c, tex-glyph.c: Replace calls to kpse_expand_tilde with kpse_expand. * expand.[ch]: New files. * Makefile.in (objects): Add it. * fn.[ch]: New files. * elt-dirs.c (fn*): Moved to fn.c. * tex-make.c, variable.c: Use the new routines. * *obstack*: No longer needed. * Makefile.in (objects): Appropriate changes. Sat Jul 17 13:25:25 1993 Karl Berry (karl@cs.umb.edu) * concat.c: Doc fix. * pathsearch.c (search, path_search): Expand variable references. * itoa.c: New file. * lib.h (itoa): Declare it. * Makefile.in (objects): Add it. * lib.h (ENVVAR_SET_DEFAULT): New macro. * tex-glyph.c (kpse_find_glyph_format): Call it to set the dpi. Fri Jul 16 09:10:52 1993 Karl Berry (karl@cs.umb.edu) * xputenv.c: New file. * Makefile.in (objects): Add it. * lib.h (xputenv): Declare it. * c-obstack.h: New file. * variable.[ch]: New files. * Makefile.in (objects): Add it. * uppercasify.c: New file. * Makefile.in (objects): add it. * lib.h (uppercasify): Declare it. Tue Jul 13 13:47:54 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (kpse_find_glyph_format): Simplify path initialization. * filefmt.h: New file; add abbrevs for GF and PK inits. * Makefile.in (objects): Add obstack.o and tex-make.o. * obstack.[ch]: New files from GNU. * concatn.[ch], tex-make.[ch]: New files. * init-path.c: Doc fix. * elt-dirs.c: Doc fix. * readable.[ch]: Doc fixes. Sun Jul 11 13:37:02 1993 Karl Berry (karl@cs.umb.edu) * tex-font.h (kpse_font_format_type): Rename to kpse_file_format_type, and include the other file formats. * tex-glyph.c: Change uses. Tue Jul 6 08:09:10 1993 Karl Berry (karl@cs.umb.edu) * tex-font.c (kpse_fallback_font): Initialize to NULL. Mon Jul 5 08:23:09 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (try_size): Don't fill in FONT_FILE if it's null. * tex-font.c (kpse_init_fallback_resolutions): Look for TEXSIZES after the program-specific *SIZES var. * tex-glyph.c (kpse_find_glyph_format): Use kpse_init_path. * Makefile.in (objects): Add init_path.o. * tex-font.[ch] (kpse_override_path): Move to init-path.[ch]. * init-path.[ch]: New files. * c-vararg.h: New file. Sun Jul 4 11:26:17 1993 Karl Berry (karl@cs.umb.edu) * tex-font.c (kpse_init_fallback_resolutions): New routine. * tex-font.h: Declare it, and companion return type. Fri Jul 2 10:43:11 1993 Karl Berry (karl@cs.umb.edu) * tex-glyph.c (kpse_find_glyph_format): Take first successful fontmap entry. * fontmap.c (map_file_parse): Take first % on line as starting the comment, not the last. * fontmap.c (map_insert): Always insert the new element. Thu Jul 1 19:21:35 1993 Karl Berry (karl@cs.umb.edu) * fontmap.c (map_lookup): Return a list, not a single string. (map_lookup_str): Likewise. * fontmap.h (map_lookup): Change decl. * tex-glyph.c (kpse_find_glyph_format): Change caller. Sat Jun 26 11:48:36 1993 Karl Berry (karl@cs.umb.edu) * tex-font.h: Doc fix. Thu Jun 24 11:16:41 1993 Karl Berry (karl@cs.umb.edu) * configure.in (MISSING_HEADERS): Toss in favor of HAVE_HEADERS. Sigh. Also, move all this to an include file. Change uses in several files. * stat.h: Rename to c-stat.h, and change includers. * Makefile.in (objects): Add tex-glyph.o. * pathsearch.[ch] (kpse_*_multi_search): New routines. Sat Jun 19 11:37:18 1993 Karl Berry (karl@cs.umb.edu) * str-list.c (str_list_free): New routine. Fri Jun 18 13:54:08 1993 Karl Berry (karl@cs.umb.edu) * fontmap.c (map_create): Rewrite to use kpse_all_path_search. Include const in various subroutines. Tue Jun 15 15:58:18 1993 Karl Berry (karl@cs.umb.edu) * Change to pathsearch. Rename the files themselves. * elt-dirs.c (cache): Copy the key into our own storage, since it comes from kpse_path_element and might get overwritten. Should we copy all the values, too? Sun Jun 13 16:49:09 1993 Karl Berry (karl@cs.umb.edu) * pathsearch.c (dir_list_search): Don't need to append the null here; in fact, it's wrong, since then the final list might have nulls in the middle. * elt-dirs.c (dir_list_add): Correct check for new directory already ending in /. Fri Jun 11 10:45:33 1993 Karl Berry (karl@cs.umb.edu) * str-list.[ch]: New files. * pathsrch.c: Use it for the dir_list routines. * Many changes and new files throughout for new implementation including TeX-font-lookup routines. Tue Jun 8 14:00:54 1993 Karl Berry (karl@cs.umb.edu) * Most files: Change `const string' (constant pointer) to `const char *' (pointer to constant data). What a crock. Mon Jun 7 09:43:21 1993 Karl Berry (karl@cs.umb.edu) * debug.[ch]: New files. * config.h: Include debug.h. * dir-p.c: Rename to dir.c. (dir_links): New routine. * c-std.h (assert.h) [!ASSERT_H_MISSING]: Include this. * configure.in: Check for it with new macro AC_MISSING_HEADERS. Thu Jun 3 10:12:12 1993 Karl Berry (karl@cs.umb.edu) * dirio.h (leaf_dir_p): No longer defined; rename to dir.h. * xopendir.c, dir-p.c, pathsrch.c: Change include. Mon May 31 07:49:16 1993 Karl Berry (karl@cs.umb.edu) * c-std.h (EXIT_{SUCCESS,FAILURE}): Define these if they're undefined. * config.h: Use instead "...". * kpathlib.h: Had #ifndef protection messed up. Rename to lib.h. * c-memstr.h (index, rindex) [!index, !rindex]: Make definitions conditional. Tue May 25 10:07:00 1993 Karl Berry (karl@cs.umb.edu) * c-{namemx,pathmx,pathch,...}.h: Doc fixes. * c-systypes.h: New file. * c-std.h: Include it. * stat.h: New file. * xstat.h: Include it. * configure.in (AC_HAVE_HEADERS): Test for `pwd.h'. Sun May 23 19:06:22 1993 Karl Berry (karl@cs.umb.edu) * pathsrch.[ch]: Doc fixes. Fri May 21 11:27:54 1993 Karl Berry (karl@cs.umb.edu) * line.c (free): Declare. * pathsrch.c, find-suffix.c: Change caller. * c-pathch.h ({IS_,}{DIR,ENV}_SEP): Rename existing confusing definitions to these. Suggested by rocky. Mon May 17 08:18:18 1993 Karl Berry (karl@cs.umb.edu) * Version 0.3. * pathsrch.c (expand_default): Handle doubled colon and nothing-but-colon cases. * Write documentation, change Makefile accordingly. Thu May 13 16:32:34 1993 Karl Berry (karl@cs.umb.edu) * c-std.h (popen) [VMS]: Make decl conditional, and include and . Mon May 10 07:12:50 1993 Karl Berry (karl@cs.umb.edu) * Version 0.2. * version.c: Put in placeholder. Sun May 9 10:42:34 1993 Karl Berry (karl@cs.umb.edu) * config.h (c-auto.h): Use <...> instead of "...". Tue May 4 14:54:41 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (info check dvi): New targets (that do nothing). Mon May 3 13:46:17 1993 Karl Berry (karl@claude.cs.umb.edu) * Version 0.1. * Use KPATHSEARCH_ prefix for various headers' cpp protections. Sun May 2 10:28:25 1993 Karl Berry (karl@cs.umb.edu) * Makefile.in (dist): Depend on TAGS, and put it in the dist. * Makefile.in (c-auto.h.in): Remove extra $(srcdir). Sun Apr 25 11:22:12 1993 Karl Berry (karl@cs.umb.edu) * pathsrch.h: Include c-proto.h. * make-suffix.c: New file. * Makefile.in (objects): Add the .o. * file-p.c: Use the SAME_FILE_P macro. * fontmap.h: Include c-proto.h and types.h. * lib.h: Rename to kpathlib.h. * config.h: Include changed. * c-proto.h, c-std.h: Doc fix. * c-limits.h [LIMITS_H_MISSING]: Conditionalize include of c-std.h. * xstat.h: Include c-std.h. * Makefile.in (c-auto.h.in): Add unused warning to top. * dirio.h: Include c-proto.h and types.h. Fri Apr 23 16:11:13 1993 Karl Berry (karl@cs.umb.edu) * line.c: Don't include config.h, just declare xmalloc and xrealloc explicitly. * pathsrch.c: paths.h need not be included. * Created. octave-1.1.0/kpathsea/INSTALL100666 415 17 24777 5637135102 14033 0ustar jweusersInstallation ************ Here are the basic steps for configuration and installation: 1. `configure'. This automatically determines most system dependencies. 2. If necessary, edit the definitions in `Makefile' or `c-auto.h'. *Note System dependencies::, below, for additional definitions you may need to make. 3. `make'. 4. `make install'. This installs the library, header files, and documentation. 5. `make distclean'. This removes all files created by the build. Since I only distribute Kpathsea as part of another package, you will probably be doing the above in a top-level directory that contains a `Makefile', `kpathsea', and the other package. But you can do the installation in `kpathsea' itself, if you only want to install the library, not the other package. System dependencies =================== Although `configure' can reliably determine most aspects of your system, there are a few things you must help it out with. Default paths ------------- The directories into which files are installed are defined in the top-level `Makefile'. The default paths which programs use to search for inputs are defined in `kpathsea/paths.h'. You will almost certainly want to change either or both of these to match your preferred local directory structure. In particular, if you need to support only one output device, the rather deep structure of the default paths is unnecessary. Both of these files are automatically created: the `Makefile' at `configure' time, `kpathsea/paths.h' at `make' time. Thus, to change the default paths, the simplest thing to do is edit the template files `Makefile.in' and `paths.h.in' before running `configure'. The Make definitions are all repeated in several `Makefile''s; but changing the top-level `Makefile' should suffice, as it passes down all the variable definitions, thus overriding the submakes. (The definitions are repeated so you can potentially run Make in the subdirectories.) If you want to include the mode in a particular path, perhaps to distinguish two different devices with the same resolution, use `$MAKETEX_MODE', as in `/usr/local/lib/texmf/fonts//pk/$MAKETEX_MODE'. *Note `MakeTeX'... script arguments: MakeTeX... script arguments. The file `kpathsea/HIER' has some explanation of the default setup. A caveat: If you put `$HOME' or `~' in any of the paths, do not search that component recursively: when you run as root, you might wind up searching (say) `/zoneinfo/Brazil/tex/macros'. And of course it will take quite some time to look at every directory on the system. *Note Filename database::, for a description of an external database that can help speed searches. `wchar_t' --------- The upshot of all the following is that if you get error messages regarding `wchar_t', try defining `NO_FOIL_X_WCHAR_T'. This is reported to be necessary on Linux. `wchar_t' has caused infinite trouble. None of my code ever uses `wchar_t'; all I want to do is include X header files and various system header files, compiling with GCC. This seems an impossible task. The X11R5 `' and GCC's `' have conflicting definitions for wchar_t. The particulars: `' from MIT X11R5 defines `wchar_t' if `X_WCHAR' is defined, which is defined if `X_NOT_STDC_ENV' is defined, and we define *that* if `STDC_HEADERS' is not defined (`configure' decides if STDC_HEADERS gets defined). But when compiling with gcc on SunOS 4.1.x, `STDC_HEADERS' is not defined (`string.h' doesn't declare the `mem'* functions), so we do get X's `wchar_t'--and we also get gcc's `wchar_t' from its `'. Result: conflicting definitions. On the other hand, SunOS 4.1.1 with some other X configurations actually needs GCC to define `wchar_t', and fails otherwise. My current theory is to define `wchar_t' to a nonsense symbol before the X include files are read; that way its definition (if any) will be ignored by other system include files. Going along with that, define `X_WCHAR' to tell X not to use `', that we've already included, but instead to make its own definition. But this is not the end of the story. The X11 include files distributed with DG/UX 5.4.2 for the Aviion have been modified to include `<_int_wchar_t.h>' if `X_WCHAR', so our `#define' will not have any typedef to change--but the uses of `wchar_t' in the X include files will be changed to reference this undefined symbol. So there's nothing to foil in this case; I don't know how to detect this automatically, so it's up to you to define `NO_FOIL_X_WCHAR_T' yourself. `putenv' -------- If you are on a Net2/BSD or other system which has a `putenv' that knows how to avoid garbage when the same environment variable is set many times, define `SMART_PUTENV'. (And if you can write a test for this that could be incorporated into the `configure' script, please send it to the address given in *Note Bugs::.) The `configure' script ====================== (This section is largely from the Autoconf manual, by David MacKenzie. *Note Running `configure' scripts: (autoconf)Running configure Scripts.) The `configure' script that comes with this distribution was generated by the Autoconf program. Thus, you can regenerate `configure' by rerunning Autoconf. You might want to do this if a new version of Autoconf is released, for example. The purpose of `configure' is to adapt the present source to the particulars of your system. For example, the name of the directory header file (`dirent.h' or `sys/dir.h'), whether the GNU C compiler `gcc' is available, and so on. Normally, you do not need to give any options to `configure'; just `cd' to the directory with the source code and type `configure'. Exceptions: if `.' is not in your `PATH', you must type `./configure'; if you are using a non-Bourne compatible shell on systems that do not support `#!', you must type `sh configure'. Running `configure' takes a minute or two. While it is running, it prints some messages that tell what it is doing. If you don't want to see the messages, run `configure' with its standard output redirected to `/dev/null'; e.g., `configure >/dev/null'. On the other hand, if you want to see even more messages, give `configure' the `-v' option. To compile the package in a different directory from the one containing the source code, you must use a variant 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 `configure' with the option `--srcdir=DIR', where DIR is the directory that contains the source code. Using this option is unnecessary if the source code is in the parent directory of the one in which you are compiling; `configure' automatically checks for the source code in `..' if it does not find it in `.'. `configure' (in the top-level directory) guesses the default installation prefix (we'll call it `$(prefix)', which is the corresponding Make variable) by looking for a directory which contains an executable named `tex', and using its parent. In the package subdirectories, such as `kpathsea', `configure' doesn't try to guess the prefix (to avoid a conflict with the guess made at the top level); the default `/usr/local' is left. You can override this default guess for the installation prefix by giving `configure' the option `--prefix=PATH'. You can also specify separate installation prefixes for architecture-specific files and architecture-independent files by giving `configure' the option `--exec-prefix=XPATH' (which substitutes for the Make variable `$(exec_prefix)'). Then XPATH will be the prefix for installing programs and libraries. Data files and documentation will still use `$(prefix)'. You can tell `configure' to figure out the configuration for your system, and record it in a file `config.status', without actually configuring the package. To do this, give `configure' the `--no-create' option. Later, you can run `./config.status' to actually configure the package. This option is useful mainly in `Makefile' rules for updating `config.status' and the `Makefile' itself. You can also give `config.status' the `--recheck' option, which makes it rerun `configure' with the same arguments you used before. This is useful if you change `configure'. `configure' ignores any other arguments that you give it. On systems that require unusual options for compilation or linking that the package's `configure' script does not know about, you can give `configure' initial values for variables by setting them in the environment. In Bourne-compatible shells, you can do that on the command line like this: CC='gcc -traditional' LIBS=-lposix sh configure The Make variables that you might want to override with environment variables when running `configure' are: (For these variables, any value given in the environment overrides the value that `configure' would choose.) `CC' The C compiler program. The default is `gcc' if that is in your `PATH', `cc' otherwise. `INSTALL' The program to use to install files. The default is `install' if you have it, `cp' otherwise. (For these variables, any value given in the environment is added to the value that `configure' chooses.) `DEFS' Configuration options, in the form `-Dfoo -Dbar...'. `LIBS' Libraries to link with, in the form `-lfoo -lbar...'. Of course, problems requiring manual intervention (e.g., setting these variables) should ideally be fixed by updating either the Autoconf macros or the `configure.in' file for that package. Reporting bugs ============== If you encounter problems, report them to `tex-k@cs.umb.edu'. Include the version number of the library, the system you are using, and enough information to reproduce the bug in your report. To get on this mailing list yourself, email `tex-k-request@cs.umb.edu' with a message whose body contains a line subscribe YOU@YOUR.PREFERRED.ADDRESS To avoid wasted effort and time (both mine and yours), I strongly advise applying the principles given in the GNU C manual (*note Reporting Bugs: (gcc)Bugs.) to your bug reports for any software. Please also report bugs in this documentation--not only factual errors, but unclear explanations, typos, wrong fonts, .... When compiling with old C compilers, you may get some warnings about "illegal pointer combinations". These are spurious; ignore them. I decline to clutter up the source with casts to get rid of them. In general, if you have trouble with a system C compiler, I advise trying the GNU C compiler. (And vice versa, unfortunately; but in that case I also recommend reporting a bug to the GCC bug list.) octave-1.1.0/kpathsea/MACHINES100666 415 17 6740 5637135103 14063 0ustar jweusersHere is the list of configurations that seem to work. Except as noted, compilation is without optimization and default DEFS. Send new entries to tex-k@cs.umb.edu. Here are email addresses for the `who': curtis = curtis@crl.com interran = interran@uluru.Stanford.EDU karl = karl@cs.umb.edu machine operating system compiler who %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% DEC Alpha OSF/1 T1.3-4 gcc 2.5.7 karl DEC MIPS Ultrix 4.3 gcc 2.5.7 karl -O2 works. DG Aviion DG/UX 5.4.2 gcc 2.5.7 karl -O2 works. HP 9000/370 HP-UX B.09.00.A gcc 2.4.5 charnier -O2 doesn't work on virmf -- lasy10 gets segmentation fault. HP 9000/700 HP-UX 9.01 gcc 2.5.7 karl XLDFLAGS="-Xlinker a -Xlinker default" if no static library for libXaw. -O2 fails (but not -O). IBM RS/6000 AIX 3.2 gcc 2.5.8 karl If no Xaw, set XDEFS=-DNOTOOL and tool_libs="". gcc 2.5.7 is broken on the RS/6000. Get 2.5.8. IBM RT AOS (BSD 4.3) gcc 2.5.7 karl Intel x86 Interactive Unix 2.2.1 gcc 2.5.8 karl -O2 works. Intel x86 Interactive Unix 2.2.1 cc karl Intel x86 NCR SVR4.0.2.x cc curtis SGI IRIX 4.0.5F gcc 2.5.7 karl Add -noasmopt to CFLAGS, unless gcc was configured as mips-sgi-irix4loser. Otherwise Metafont is miscompiled. Sun Sparc Solaris 2.1 aka SunOS 5.1 gcc 2.5.7 karl Sun Sparc SunOS 4.1.2 gcc 2.5.8 interran -O works. Sun Sparc SunOS 4.1.3 gcc 2.5.7 karl -O2 works. Sun Sparc SunOS 4.1.3 cc karl Dynamic linking with openwin libraries winds up with `_get_wmShellWidgetClass' and `_get_applicationShellWidgetClass' undefined. (Either cc or gcc.) See below. From the comp.sys.sun.admin FAQ, as quoted by pln@egret0.stanford.edu: 47) When I try to compile MITs X11R4 applications under Openwindows 3.0, I get the following "undefined" symbols(_get_wmShellWidgetClass, and _get_applicationShellWidgetClass). What is the Problem? There are problems with the Xmu shared library as shipped from Sun. There are two "fixes". One is to get the Openwindows patches that apply to this problem and the other is to "statically" link the Xmu library into the executable. The patches you will need are as follows: Patch i.d. Bug i.d.'s O/S Description ---------- ------------------------------------------------------- 100512-02 1086793 1086912 4.1.x OpenWindows 3.0 libXt 1074766 Jumbo patch 100573-03 1087332 4.1.x OpenWindows 3.0 undefined symbols when using shared libXmu. To "statically" link your executable with libXmu modify the compile line as follows (with cc): -Bstatic -lXmu -Bdynamic (end FAQ quote, begin kb's comments) 1) If you use the MIT X11R5 libraries, this problem does not arise. 2) If you're using gcc, use -static to link statically. 3) If you're using gcc, and you want to link -lXmu statically and everything else dynamically, you have to do it by hand: run gcc -v and grab the ld line, and add the -B's given above around -lXmu. The reason is that gcc moves all linker options (specified with, e.g., -Xlinker) to the front of the ld command line. So you can't specify different options for different libraries. When I reported this to bug-gcc, the reply was that if I wanted to work on it, I was welcome to, and they would happily merge the changes. octave-1.1.0/kpathsea/NEWS100666 415 17 4620 5637135104 13444 0ustar jweusersThis file records noteworthy changes. 1.8 (2 April 1994) * New target install-info, so the documentation can be installed without the headers. * Existing but unreadable files are complained about, instead of just ignored. * A leading %% in a path element forbids searching the disk for that element; only a db will be searched (if it exists). * The db is only used if it might be relevant to a given path element, not searched first regardless. 1.7 (1 March 1994) * Searches can use an externally-built ls-R ``database'', for speed. * `VPATH = .' lines removed from generated Makefile, for broken Sun make. * A path foo//tfm finds foo/tfm as well as foo/*/tfm. 1.6 (3 February 1994) * Memory fault in copying long paths fixed. * More variables passed down from the top-level Makefile. * Mention SMART_PUTENV in the INSTALL file, and fix bug in xputenv.c when one envvar is a proper prefix of another. * More attempts at eliminating magstephalf annoyances. * Directory name substitutions are done globally when creating paths.h. * Various changes for DOS. 1.5 (24 January 1994) * Default paths changed. * Defining GCC_WCHAR lets GCC define wchar_t. * EXIT_FAILURE and EXIT_SUCCESS defined in all cases (if they're not already). * str[r]chr never redefined (I hope). 1.4 (3 November 1993) * Check closest fallback font size. * All default paths (including dvips') in paths.h.in, not the Makefile. * Rearrange directory lists so that dirs in which a file is found migrate to the top. * Update for Autoconf 1.7. 1.3 (6 October 1993) * Fix free of non-malloced memory bug. * Fix uninitialized gf path bug. * mkdirchain invoked as an absolute filename. 1.2 (27 September 1993) * Running MakeTeXPK is tried before the fallback resolutions. * The final bitmap name uses a variable spec, so DOS & OS/2 can get dpi300/cmr10.pk. * Document TeX-specific features. * Dpi passed to MakeTeXPK via the envvar KPATHSEA_DPI instead of MAKETEX_DPI. 1.1 (26 August 1993) * Installation fixes. 1.0 (5 August 1993) * Routines to look up TeX font files, default path specifications, etc. * Sort-of pattern matching: /foo//bar matches subdirectories /foo/a/bar, /foo/b/bar, /foo/a1/a2/bar, etc. * $var and ${var} expansion. * Support for MakeTeX... scripts. * Support for fallback resolutions and font. * Lazy evaluation of path elements. * Some runtime debugging support. 0.2 (12 May 1993) First general release as a standalone library. octave-1.1.0/kpathsea/README100666 415 17 1561 5637135105 13627 0ustar jweusersThis directory contains the Kpathsea[rch] library. See `Makefile.in' for the version number. See `NEWS' for changes by release. See `INSTALL' for installation instructions. See `PROJECTS' for future improvements. The library provides for filename lookup through paths specified in environment variables. The main header file is pathsrch.h. To support that, there are lots of configuration headers and functions. Report bugs to tex-k@cs.umb.edu. (Email tex-k-request@cs.umb.edu to join this mailing list.) Suggestions for improvements (in either the library or the documentation), no matter how small, are welcome. Installing this package will create the library and header files in subdirectories of /usr/local. This is free software. See the files COPYING* for copying permissions. karl@cs.umb.edu Member of the League for Programming Freedom -- write lpf@uunet.uu.net. octave-1.1.0/kpathsea/TAGS100666 415 17 35505 5637135105 13455 0ustar jweusers absolute.c,29 kpse_absolute_p P1C(33,1035 concat.c,19 concat P2C(26,915 concat3.c,20 concat3 P3C(23,781 concatn.c,37 concatn PVAR1C(28,958 main 49,1231 db.c,69 db_build P1C(34,1138 match P2C(80,2667 kpse_db_search P3C(89,2901 debug.c,0 default.c,75 kpse_expand_default P2C(29,954 test_expand_default 85,2617 main 95,2824 dir.c,41 dir_p P1C(29,919 dir_links P1C(41,1212 elt-dirs.c,259 dir_list_add P2C(35,1272 checked_dir_list_add P2C(49,1556 } cache_entry;cache_entry63,1925 cache P2C(76,2374 cached P1C(88,2676 do_subdir P4C(113,3272 expand_elt P3C(212,6780 kpse_element_dirs P1C(248,7812 print_element_dirs 300,9019 main 325,9474 expand.c,24 kpse_expand P1C(30,935 extend-fname.c,28 extend_filename P2C(26,915 file-p.c,24 same_file_p P2C(28,952 find-suffix.c,24 find_suffix P1C(28,977 fn.c,204 #define CHUNK_SIZE 26,910 fn_init P1H(30,942 fn_copy0 P2C(42,1079 fn_free P1C(60,1507 grow P2C(75,1920 fn_1grow P2C(86,2131 fn_grow P3C(95,2252 fn_str_grow P2C(104,2423 fn_shrink_to P2C(114,2598 fontmap.c,104 map_lookup P2C(33,1070 map_file_parse P2C(75,2401 #define MAP_NAME 117,3589 map_create P1C(120,3638 gmalloc.c,899 #define _MALLOC_INTERNAL3,74 #define _MALLOC_H 31,1191 #define memset(43,1387 #define memcpy(46,1453 #define CHAR_BIT 53,1591 #define _MALLOC_INTERNAL288,8812 align 330,9767 initialize 355,10292 morecore 374,10836 malloc 414,11872 _malloc 599,17586 _free 606,17653 _realloc 613,17710 #define _MALLOC_INTERNAL644,18825 _free_internal 657,19142 free 810,23762 #define _MALLOC_INTERNAL850,24985 function_alias(861,25112 cfree 867,25204 #define _MALLOC_INTERNAL897,26295 safe_bcopy 910,26587 #define memmove(963,27965 #define min(968,28041 realloc 980,28545 #define _MALLOC_INTERNAL1108,32266 calloc 1115,32437 #define _MALLOC_INTERNAL1144,33467 #define __sbrk 1149,33544 #define NULL 1163,33871 __default_morecore 1170,34060 #define _MALLOC_INTERNAL1196,35041 memalign 1201,35102 #define __getpagesize(1266,37079 #define _MALLOC_INTERNAL1270,37151 valloc 1277,37237 hash.c,116 hash P2C(27,877 hash_create P1C(40,1148 hash_insert P3C(59,1661 hash_lookup P2C(75,2135 hash_print P1C(98,2774 init-path.c,44 kpse_init_path PVAR2C(28,860 main 50,1348 itoa.c,17 itoa P1C(23,760 line.c,47 #define BLOCK_SIZE 30,1094 read_line 33,1124 make-suffix.c,24 make_suffix P2C(26,931 path-elt.c,75 kpse_path_element P1C(42,1502 print_path_elements 96,2587 main 111,2870 pathsearch.c,292 #define INIT_ALLOC 38,1484 dir_list_search P3C(41,1577 absolute_search P1C(96,3190 elt_in_db P1C(124,4057 path_search P4C(146,4638 search P4C(221,7137 kpse_path_search P3C(249,8048 kpse_all_path_search P2C(261,8383 test_path_search 270,8536 #define TEXFONTS 290,8992 main 293,9041 putenv.c,62 #define NULL 33,1002 #define PSIZE 34,1017 putenv(71,2160 readable.c,57 #define READABLE(29,979 kpse_readable_file P1C(40,1360 rm-suffix.c,26 remove_suffix P1C(25,835 str-list.c,107 str_list_init P1H(28,848 str_list_add P2C(40,978 str_list_concat P2C(52,1281 str_list_free P1C(68,1720 str-llist.c,55 str_llist_add P2C(27,869 str_llist_float P2C(53,1613 tex-file.c,108 #define DEFAULT_FONT_SIZES 35,1165 kpse_init_fallback_resolutions P1C(39,1208 kpse_find_file P4C(70,2116 tex-glyph.c,321 #define KPATHSEA_BITMAP_NAME 38,1282 #define KPATHSEA_BITMAP_NAME 42,1391 bitmap_name P3C(47,1541 try_format P4C(68,2116 try_size P4C(92,2883 try_resolution P4C(133,4011 try_fontmap P4C(161,4937 try_fallback_resolutions P4C(199,6164 kpse_find_glyph_format P4C(264,8050 test_find_glyph 348,10987 main 370,11513 tex-make.c,221 #define MAKE_TEX_PK_SPEC 35,1164 kpse_make_tex P2C(60,2266 magstep P2C(145,5016 #define ABS(197,6509 kpse_set_maketex_mag P2C(200,6565 kpse_check_bitmap_tolerance P2C(272,8043 test_make_tex 284,8356 main 296,8595 tilde.c,73 kpse_tilde_expand P1C(34,1045 test_expand_tilde 92,2489 main 102,2691 truncate.c,36 kpse_truncate_filename P1C(31,1050 uppercasify.c,24 uppercasify P1C(25,813 variable.c,219 expand P3C(30,993 #define IS_VAR_START(48,1480 #define IS_VAR_CHAR(51,1577 #define IS_VAR_BEGIN_DELIMITER(54,1712 #define IS_VAR_END_DELIMITER(57,1795 kpse_var_expand P1C(66,2023 test_var 132,3850 main 144,4105 version.c,0 xcalloc.c,20 xcalloc P2C(23,787 xfopen.c,40 xfopen P2C(26,912 xfclose P2C(38,1075 xmalloc.c,16 xmalloc 27,930 xopendir.c,43 xopendir P1C(25,827 xclosedir P1C(37,957 xputenv.c,46 xputenv P2C(36,1485 xputenv_int P2C(97,3325 xrealloc.c,17 xrealloc 29,959 xstat.c,38 xstat P1C(25,834 xlstat P1C(41,1097 xstrdup.c,20 xstrdup P1C(25,829 absolute.h,35 #define KPATHSEA_ABSOLUTE_H20,763 c-auto.h,354 #define DIRENT 10,329 #define _POSIX_SOURCE 16,498 #define STDC_HEADERS 19,574 #define HAVE_PUTENV 34,958 #define HAVE_ASSERT_H 37,1035 #define HAVE_FLOAT_H 40,1113 #define HAVE_LIMITS_H 43,1191 #define HAVE_MEMORY_H 46,1270 #define HAVE_PWD_H 49,1346 #define HAVE_STDLIB_H 52,1422 #define HAVE_STRING_H 55,1501 #define HAVE_UNISTD_H 58,1580 c-ctype.h,457 #define KPATHSEA_C_CTYPE_H20,788 #define isascii(26,886 #define ISALNUM(29,915 #define ISALPHA(30,962 #define ISASCII 31,1009 #define ISCNTRL(32,1033 #define ISDIGIT(33,1080 #define ISGRAPH(34,1128 #define ISLOWER(35,1175 #define ISPRINT(36,1222 #define ISPUNCT(37,1269 #define ISSPACE(38,1316 #define ISUPPER(39,1363 #define ISXDIGIT(40,1410 #define TOASCII 41,1459 #define TOLOWER(42,1483 #define TOUPPER(43,1536 #define isblank(47,1680 c-errno.h,34 #define KPATHSEA_C_ERRNO_H20,777 c-fopen.h,248 #define C_FOPEN_H20,764 #define FOPEN_R_MODE 24,836 #define FOPEN_W_MODE 28,890 #define FOPEN_RBIN_MODE 34,1047 #define FOPEN_RBIN_MODE 36,1082 #define FOPEN_WBIN_MODE 43,1265 #define FOPEN_WBIN_MODE 46,1313 #define FOPEN_WBIN_MODE 48,1369 c-limits.h,26 #define C_LIMITS_H20,775 c-memstr.h,247 #define KPATHSEA_C_MEMSTR_H20,770 #define index 38,1423 #define rindex 41,1466 #define bcmp(47,1555 #define bcopy(50,1629 #define bzero(53,1708 #define strchr 62,1875 #define strrchr 65,1919 #define memcmp(68,1950 #define memcpy(69,1999 c-minmax.h,450 #define KPATHSEA_C_MINMAX_H21,828 #define SCHAR_MIN 30,1076 #define SCHAR_MAX 33,1126 #define UCHAR_MAX 36,1173 #define SHRT_MIN 40,1220 #define SHRT_MAX 43,1270 #define USHRT_MAX 46,1318 #define INT_MIN 50,1366 #define INT_MAX 53,1419 #define UINT_MAX 56,1470 #define LONG_MIN 60,1523 #define LONG_MAX 63,1572 #define ULONG_MAX 66,1622 #define DBL_MIN 71,1721 #define DBL_MAX 74,1766 #define FLT_MIN 78,1812 #define FLT_MAX 81,1857 c-namemx.h,95 #define KPATHSEA_C_NAME_MX_H22,896 #define _POSIX_NAME_MAX 29,1097 #define NAME_MAX 33,1150 c-pathch.h,563 #define C_PATHCH_H21,836 #define DIR_SEP 26,926 #define DIR_SEP_STRING 27,946 #define DIR_SEP 30,990 #define DIR_SEP_STRING 31,1011 #define IS_DIR_SEP(33,1107 #define DIR_SEP 36,1182 #define DIR_SEP_STRING 37,1202 #define DIR_SEP 39,1235 #define DIR_SEP_STRING 40,1255 #define IS_DIR_SEP(47,1394 #define ENV_SEP 54,1538 #define ENV_SEP_STRING 55,1558 #define ENV_SEP 58,1602 #define ENV_SEP_STRING 59,1622 #define ENV_SEP 62,1668 #define ENV_SEP_STRING 63,1688 #define ENV_SEP 65,1721 #define ENV_SEP_STRING 66,1741 #define IS_ENV_SEP(73,1879 c-pathmx.h,121 #define KPATHSEA_C_PATH_MX_H22,895 #define _POSIX_PATH_MAX 30,1114 #define PATH_MAX 35,1185 #define PATH_MAX 37,1219 c-proto.h,454 #define KPATHSEA_C_PROTO_H20,788 #define P1H(29,1101 #define P2H(30,1122 #define P3H(31,1150 #define P4H(32,1185 #define P5H(33,1227 #define P1C(35,1277 #define P2C(36,1303 #define P3C(37,1343 #define P4C(38,1397 #define P5C(39,1465 #define P1H(44,1579 #define P2H(45,1598 #define P3H(46,1621 #define P4H(47,1648 #define P5H(48,1679 #define P1C(50,1715 #define P2C(51,1746 #define P3C(52,1795 #define P4C(53,1862 #define P5C(55,1951 c-stat.h,311 #define KPATHSEA_STAT_H20,771 #define S_ISBLK(28,948 #define S_ISCHR(31,1046 #define S_ISDIR(34,1144 #define S_ISREG(37,1242 #define S_ISFIFO(40,1341 #define S_ISLNK(43,1440 #define S_ISSOCK(46,1540 #define S_ISMPB(49,1649 #define S_ISMPC(50,1696 #define S_ISNWK(53,1806 #define SAME_FILE_P(59,2070 c-std.h,296 #define KPATHSEA_C_STD_H20,767 #define SYSV25,926 #define X_NOT_STDC_ENV27,945 #define ALLOC_RETURN_TYPE 51,1666 #define ALLOC_RETURN_TYPE 53,1703 #define EXIT_SUCCESS 69,2199 #define EXIT_FAILURE 70,2222 #define EXIT_SUCCESS 72,2251 #define EXIT_FAILURE 73,2274 #define assert(90,2669 c-unistd.h,293 #define KPATHSEA_C_UNISTD_H21,818 #define SEEK_SET 34,1046 #define SEEK_CUR 35,1065 #define SEEK_END 36,1084 #define F_OK 41,1162 #define X_OK 42,1177 #define W_OK 43,1192 #define R_OK 44,1207 #define STDIN_FILENO 48,1266 #define STDOUT_FILENO 49,1292 #define STDERR_FILENO 50,1318 c-vararg.h,314 #define C_VARARG_H20,751 #define PVAR1H(31,1137 #define PVAR2H(32,1166 #define PVAR3H(33,1203 #define PVAR1C(35,1249 #define PVAR2C(37,1327 #define PVAR3C(39,1421 #define PVAR1H(45,1579 #define PVAR2H(46,1601 #define PVAR3H(47,1627 #define PVAR1C(49,1658 #define PVAR2C(52,1790 #define PVAR3C(55,1960 concatn.h,34 #define KPATHSEA_CONCATN_H23,954 config.h,63 #define KPATHSEA_CONFIG_H21,832 #define UNIX_ST_NLINK47,1792 db.h,77 #define KPATHSEA_DB_H20,754 #define DB_DIR 29,985 #define DB_NAME 32,1046 debug.h,164 #define KPATHSEA_DEBUG_H20,741 #define DEBUG26,870 #define DEBUG_SET(32,985 #define DEBUG_P(35,1084 #define DEBUG_STAT 37,1138 #define DEBUG_DB_BUILD 38,1177 default.h,34 #define KPATHSEA_DEFAULT_H20,755 dir.h,103 #define KPATHSEA_DIR_H20,769 #define NLENGTH(28,972 #define dirent 30,1065 #define NLENGTH(31,1087 expand.h,33 #define KPATHSEA_EXPAND_H20,741 fn.h,140 #define KPATHSEA_FN_H20,760 } fn_type;fn_type36,1312 #define FN_STRING(38,1324 #define FN_ALLOCATED(39,1357 #define FN_LENGTH(40,1399 fontmap.h,25 #define FONTMAP_H20,803 getpagesize.h,161 #define getpagesize(6,90 #define getpagesize(14,193 #define getpagesize(20,289 #define getpagesize(23,343 #define CLSIZE 25,394 #define getpagesize(29,466 hash.h,173 #define HASH_H20,740 typedef struct hash_element_structhash_element_struct27,850 } hash_element_type;hash_element_type32,965 } hash_table_type;hash_table_type39,1113 init-path.h,36 #define KPATHSEA_INIT_PATH_H20,770 lib.h,608 #define KPATHSEA_LIB_H20,796 #define FATAL_PERROR(30,1088 #define START_FATAL(33,1164 #define END_FATAL(34,1217 #define FATAL(36,1283 #define FATAL1(38,1370 #define FATAL2(40,1460 #define FATAL3(42,1557 #define FATAL4(44,1662 #define FATAL6(46,1774 #define START_WARNING(50,1903 #define END_WARNING(51,1960 #define WARNING(53,2035 #define WARNING1(55,2128 #define WARNING2(57,2223 #define WARNING3(59,2326 #define WARNING4(61,2436 #define STREQ(66,2591 #define MAX_INT_LENGTH 71,2805 #define ENVVAR(75,2971 #define XTALLOC(138,5739 #define XTALLOC1(139,5796 #define XRETALLOC(140,5831 line.h,22 #define LINE_H20,765 malloc.h,568 #define __XMALLOC_H__4,135 #define MALLOC_TRACE 6,158 #define univptr_t 9,251 #define univptr_t 11,302 #define size_t 12,328 #define size_t 16,428 #define __proto(20,488 #define __proto(22,515 #define CSRIMALLOC29,650 #define malloc(47,1563 #define calloc(48,1616 #define realloc(49,1677 #define memalign(50,1740 #define valloc(51,1805 #define emalloc(52,1858 #define ecalloc(53,1913 #define erealloc(54,1976 #define strdup(55,2041 #define strsave(56,2094 #define cfree(58,2184 #define free(59,2234 #define alloca(96,3491 #define alloca(99,3564 paths.h,590 #define DEFAULT_TEX_PATH 19,814 #define DEFAULT_MF_PATH 25,1079 #define DEFAULT_FMT_PATH 30,1223 #define DEFAULT_BASE_PATH 33,1310 #define DEFAULT_TEXPOOL_PATH 38,1433 #define DEFAULT_MFPOOL_PATH 41,1524 #define DEFAULT_TFM_PATH 45,1642 #define DEFAULT_VF_PATH 49,1764 #define DEFAULT_GLYPH_PATH 54,1921 #define DEFAULT_GF_PATH 57,2012 #define DEFAULT_PK_PATH 60,2102 #define DEFAULT_BIB_PATH 65,2237 #define DEFAULT_BST_PATH 68,2330 #define DEFAULT_CONFIG_PATH 73,2462 #define DEFAULT_HEADER_PATH 78,2635 #define DEFAULT_FIG_PATH 85,2953 #define DEFAULT_PICT_PATH 90,3060 pathsearch.h,37 #define KPATHSEA_PATHSEARCH_H20,758 readable.h,35 #define KPATHSEA_READABLE_H20,746 str-list.h,196 #define KPATHSEA_STR_LIST_H20,757 } str_list_type;str_list_type32,957 #define STR_LIST_LENGTH(34,975 #define STR_LIST(35,1015 #define STR_LIST_ELT(36,1046 #define STR_LIST_LAST_ELT(37,1089 str-llist.h,307 #define STR_LLIST_H24,917 struct str_llist_eltstr_llist_elt35,1276 typedef struct str_llist_elt str_llist_elt_type;str_llist_elt_type41,1363 typedef struct str_llist_elt *str_llist_type;str_llist_type42,1412 #define STR_LLIST(44,1459 #define STR_LLIST_MOVED(45,1492 #define STR_LLIST_NEXT(46,1533 systypes.h,54 #define C_SYSTYPES_H22,895 #define __TYPES__28,1044 tex-file.h,1299 #define KPATHSEA_TEX_FILE_H20,769 } kpse_file_format_type;kpse_file_format_type61,2070 #define KPSE_FONT_PATH(65,2155 #define KPSE_NONFONT_PATH(68,2317 #define KPSE_BASE_ENVS 73,2599 #define KPSE_BASE_PATH(74,2632 #define KPSE_BIB_ENVS 76,2712 #define KPSE_BIB_PATH(77,2746 #define KPSE_BST_ENVS 79,2823 #define KPSE_BST_PATH(80,2870 #define KPSE_FMT_ENVS 82,2947 #define KPSE_FMT_PATH(83,2982 #define KPSE_GF_ENVS 85,3059 #define KPSE_GF_PATH(86,3107 #define KPSE_GLYPH_ENVS 88,3178 #define KPSE_GLYPH_PATH(89,3227 #define KPSE_MF_ENVS 91,3307 #define KPSE_MF_PATH(92,3339 #define KPSE_MFPOOL_ENVS 94,3413 #define KPSE_MFPOOL_PATH(95,3447 #define KPSE_PK_ENVS 98,3537 #define KPSE_PK_PATH(99,3595 #define KPSE_TEX_ENVS 101,3666 #define KPSE_TEX_PATH(102,3700 #define KPSE_TEXPOOL_ENVS 104,3777 #define KPSE_TEXPOOL_PATH(105,3813 #define KPSE_TFM_ENVS 108,3906 #define KPSE_TFM_PATH(109,3951 #define KPSE_VF_ENVS 111,4025 #define KPSE_VF_PATH(112,4068 } kpse_source_type;kpse_source_type123,4539 } kpse_font_file_type;kpse_font_file_type131,4771 #define KPSE_FONT_FILE_NAME(133,4797 #define KPSE_FONT_FILE_DPI(134,4839 #define KPSE_FONT_FILE_FORMAT(135,4879 #define KPSE_FONT_FILE_SOURCE(136,4925 #define kpse_find_tfm(150,5579 #define kpse_find_vf(151,5659 tex-glyph.h,66 #define KPATHSEA_TEX_GLYPH_H20,766 #define kpse_find_pk(39,1588 tex-make.h,242 #define KPATHSEA_TEX_MAKE_H20,775 } kpse_make_spec_type;kpse_make_spec_type32,1066 #define KPSE_MAKE_SPEC_ENABLED(34,1090 #define KPSE_MAKE_SPEC_PROGRAM(35,1140 #define KPSE_MAKE_SPEC_ARGS(36,1190 #define KPSE_BITMAP_TOLERANCE(63,2297 tilde.h,32 #define KPATHSEA_TILDE_H20,744 truncate.h,35 #define KPATHSEA_TRUNCATE_H20,770 types.h,267 #define KPATHSEA_TYPES_H20,754 typedef enum { false = 0, true = 1 } boolean;boolean23,797 #define FALSE 28,961 #define TRUE 29,981 typedef char *string;string33,1060 typedef const char *const_string;const_string38,1237 typedef void *address;address41,1298 variable.h,35 #define KPATHSEA_VARIABLE_H20,753 xstat.h,56 #define KPATHSEA_XSTAT_H20,769 #define xlstat 33,1127 octave-1.1.0/kpathsea/Makefile.in100666 415 17 63722 5662226346 15051 0ustar jweusers# Makefile for kpathsea --karl@cs.umb.edu. version = 1.8 lib = libkpathsea.a # The following make definitions (down to `end of installation # directories') are repeated in several Makefiles, because different # installations like to change them at different levels. If you edit the # top-level Makefile, the changes should propagate, however. # # The following define installation directories. The default paths are # defined in kpathsea/paths.h, which is built from kpathsea/paths.h.in. # See kpathsea/INSTALL for a description of how the various path-related # files are used and created. # Generic installation directories. prefix = /usr/local exec_prefix = $(prefix) bindir = $(exec_prefix)/bin scriptdir = $(bindir) libdir = $(exec_prefix)/lib datadir = $(prefix)/lib infodir = $(prefix)/info includedir = $(prefix)/include manext = 1 mandir = $(prefix)/man/man$(manext) # TeX & MF-specific directories. Not all of the following are relevant # for all programs, but it seems cleaner to collect everything in one place. # The default paths are now in kpathsea/paths.h.in. Passing all the # paths to sub-makes can make the arg list too long on system V. # The root of the tree. texmf_prefix = $(datadir)/texmf # TeX and MF source files. texinputdir = $(texmf_prefix)/tex mfinputdir = $(texmf_prefix)/mf # The top-level font directory. fontdir = $(texmf_prefix)/fonts # Where memory dumps are installed. fmtdir = $(texmf_prefix)/ini basedir = $(fmtdir) # Pool files. texpooldir = $(texmf_prefix)/ini mfpooldir = $(texpooldir) # If install_fonts=true, the PostScript/LaserJet TFM and VF files for # the builtin fonts get installed in subdirectories of this directory, # named for the typeface families of these directories. If you don't # have the default directory setup, you will want to set # install_fonts=false. install_fonts = true ps_fontdir = $(fontdir)/adobe bh_fontdir = $(fontdir)/bh cg_fontdir = $(fontdir)/cg mt_fontdir = $(fontdir)/monotype # Where the configuration files get installed. dvips_prefix = $(texmf_prefix)/dvips configdir = $(dvips_prefix) # Where the PostScript prologues go. headerdir = $(configdir) # Where dvips' TeX macro files get installed. psmacrodir = $(texinputdir)/dvips # If a font can't be found close enough to its stated size, we look for # each of these sizes in the order given. This colon-separated list is # overridden by the envvar TEXSIZES, and by a program-specific variable # (e.g., XDVISIZES), and perhaps by a config file (e.g., in dvips). default_texsizes = 300:600 # Full filename of the database file. It is not an error for this file # not to exist. See the `Filename database' node in the kpathsea # documentation for details. db_dir = $(texmf_prefix) db_name = ls-R # End of installation directory definitions. # Add -DNO_DEBUG to squeeze out the last bit of performance. DEFS = $(XDEFS) # Set this to gmalloc.o to use GNU malloc. malloc = CC = @CC@ # CFLAGS is used for both compilation and linking. CFLAGS = @CFLAGS@ $(XCFLAGS) # Do not override CPPFLAGS; change CFLAGS or DEFS instead. CPPFLAGS = $(XCPPFLAGS) -I. -I$(srcdir) \ -I$(kpathsea_parent) -I$(kpathsea_srcdir_parent) \ $(x_include_flags) $(DEFS) .c.o: $(CC) $(CPPFLAGS) $(CFLAGS) -c $< # Linking. LDFLAGS = $(CFLAGS) $(XLDFLAGS) LOADLIBES = $(kpathsea) $(x_libs) $(LIBS) -lm $(x_extra_libs) $(XLOADLIBES) # This is so kpathsea will get remade automatically if you change # something in it and recompile from the package directory. kpathsea_parent = .. kpathsea_dir = $(kpathsea_parent)/kpathsea kpathsea_srcdir_parent = $(srcdir)/.. kpathsea_srcdir = $(kpathsea_srcdir_parent)/kpathsea kpathsea = $(kpathsea_dir)/libkpathsea.a # Stuff for making libraries. AR = ar ARFLAGS = cq RANLIB = @RANLIB@ # Installation. INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ # Install these header files. install_headers = *.h MAKEINFO = makeinfo MAKEINFO_FLAGS = --paragraph-indent=2 -I$(HOME)/gnu/gnuorg # That -I is purely for my own benefit in doing `make dist'. It won't # hurt anything for you (I hope). TEXI2DVI = texi2dvi .SUFFIXES: .info .texi .texi.info: $(MAKEINFO) $(MAKEINFO_FLAGS) $< -o $@ .SUFFIXES: .dvi .texi .texi.dvi: $(TEXI2DVI) $(TEXI2DVI_FLAGS) $< -o $@ SHELL = /bin/sh srcdir = @srcdir@ VPATH = @srcdir@ # Put tex-file.o first, because it's what depends on the paths, and may # reduce frustration in recompiling if the paths are wrong by doing it first. objects = tex-file.o absolute.o concat.o concat3.o concatn.o db.o \ debug.o default.o dir.o elt-dirs.o expand.o extend-fname.o file-p.o \ find-suffix.o fn.o fontmap.o hash.o init-path.o itoa.o line.o make-suffix.o \ path-elt.o pathsearch.o putenv.o readable.o rm-suffix.o str-list.o \ str-llist.o tex-glyph.o tex-make.o tilde.o truncate.o uppercasify.o \ variable.o version.o xcalloc.o xfopen.o xmalloc.o xopendir.o xputenv.o \ xrealloc.o xstat.o xstrdup.o $(malloc) all: $(lib) # kpathsea.info $(lib): $(objects) rm -f $(lib) $(AR) $(ARFLAGS) $(lib) $(objects) $(RANLIB) $(lib) $(kpathsea_dir)/paths.h: $(srcdir)/paths.h.in rm -f paths.h echo "/* paths.h: Generated from paths.h.in (`date`). */" >paths.h sed \ -e 's,(texmf_prefix),$(texmf_prefix),g' \ -e 's,(texinputdir),$(texinputdir),g' \ -e 's,(mfinputdir),$(mfinputdir),g' \ -e 's,(fontdir),$(fontdir),g' \ -e 's,(fmtdir),$(fmtdir),g' \ -e 's,(basedir),$(basedir),g' \ -e 's,(texpooldir),$(texpooldir),g' \ -e 's,(mfpooldir),$(mfpooldir),g' \ -e 's,(ps_fontdir),$(ps_fontdir),g' \ -e 's,(dvips_prefix),$(dvips_prefix),g' \ -e 's,(configdir),$(configdir),g' \ -e 's,(headerdir),$(headerdir),g' \ -e 's,(psmacrodir),$(psmacrodir),g' \ $(srcdir)/paths.h.in >> paths.h tex-file.o: $(CC) $(CPPFLAGS) -DDEFAULT_FONT_SIZES=\"$(default_texsizes)\" \ $(CFLAGS) -c $(srcdir)/tex-file.c db.o: $(CC) $(CPPFLAGS) -DDB_DIR=\"$(db_dir)\" -DDB_NAME=\"$(db_name)\" \ $(CFLAGS) -c $(srcdir)/db.c pathsearch.o: $(CC) $(CPPFLAGS) -DDB_DIR=\"$(db_dir)\" \ $(CFLAGS) -c $(srcdir)/pathsearch.c # Need the -DHAVE_CONFIG_H. gmalloc.o: $(CC) $(CPPFLAGS) @DEFS@ $(CFLAGS) -c $(srcdir)/gmalloc.c check: install: #install-exec install-data uninstall: #uninstall-exec uninstall-data install-exec: $(lib) $(SHELL) $(srcdir)/../mkdirchain $(libdir) $(INSTALL_DATA) $(lib) $(libdir)/$(lib) uninstall-exec: rm -f $(libdir)/$(lib) install-info: for f in kpathsea.info*; do $(INSTALL_DATA) $$f $(infodir)/$$f; done install-data: install-info $(SHELL) $(srcdir)/../mkdirchain $(infodir) $(includedir) for f in $(install_headers); do \ $(INSTALL_DATA) $$f $(includedir)/$$f; done rm -f $(includedir)/c-auto.h uninstall-data: rm -f $(infodir)/kpathsea.info* for f in $(install_headers); do \ rm -f $(includedir)/$$f; done # distdir is used by other distributions; they define $(distdir). distdir: INSTALL TAGS kpathsea.info # Install new info files locally. cp -pf kpathsea.info* $(info) rm -rf $(distdir) mkdir -p $(distdir) ln $(ln_files) HIER $(distdir) cp -p $(HOME)/gnu/gnuorg/*.texi $(distdir) ln PROJECTS *.info* *.texi common.ac $(distdir) cd $(distdir); rm -f c-auto.h paths.h cd $(distdir); add-version $(version) version.c # I define $(autoconf) to acgeneral.m4 and the other Autoconf files, so # configure automatically gets remade with a new Autoconf release. But # since some people do not have AC installed, I take out the variable # $(autoconf) definition before release. #configure_in = $(srcdir)/configure.in $(srcdir)/../kpathsea/common.ac #$(srcdir)/configure: $(configure_in) $(autoconf) # cd $(srcdir); autoconf # #config.status: $(srcdir)/configure # $(SHELL) $(srcdir)/configure --no-create --verbose # #Makefile: $(srcdir)/Makefile.in config.status # $(SHELL) config.status # # This rule isn't used for web2c or the top-level Makefile, but it # doesn't hurt. We don't depend on config.status because configure # always rewrites config.status, even when it doesn't change. Thus it # might be newer than c-auto.h when we don't need to remake the latter. #c-auto.h: $(srcdir)/c-auto.h.in # $(SHELL) config.status # #$(srcdir)/c-auto.h.in: $(configure_in) # rm -f $(srcdir)/c-auto.h.in # echo '/* Generated by autoheader. */' >$(srcdir)/c-auto.h.in # echo '/* Used only when making the library standalone. */' \ # >>$(srcdir)/c-auto.h.in # @echo 'SMART_PUTENV will not be covered.' # -cd $(srcdir); autoheader configure.in >>c-auto.h.in # echo '#undef SMART_PUTENV' >>$(srcdir)/c-auto.h.in dvi: kpathsea.dvi kpathsea.dvi: *.texi info: kpathsea.info kpathsea.info: *.texi INSTALL: install.texi $(MAKEINFO) $(MAKEINFO_FLAGS) --no-headers --no-split \ kpathsea.texi -o - \ | sed -n '/^Installation/,/^Path spec/'p \ | sed '$$d' > INSTALL TAGS: *.c *.h etags -t *.c *.h mostlyclean:: rm -f *.o $(program) $(lib) $(programs) clean:: mostlyclean rm -f *.dvi *.lj distclean:: clean rm -f Makefile config.status c-auto.h *.pool # Although we can remake configure and c-auto.h.in, we don't remove # them, since many people may lack Autoconf. Use configclean for that. realclean:: distclean rm -f TAGS *.info* extraclean:: rm -f *.aux *.bak *.bbl *.blg *.dvi *.log *.orig *.pl *.rej rm -f *.i *.s *.tfm *.vf *.vpl *\#* *gf *pk *~ rm -f CONTENTS.tex a.out core mfput.* texput.* configclean: rm -f configure c-auto.h.in c-auto.h # Prevent GNU make 3 from overflowing arg limit on system V. .NOEXPORT: distclean:: rm -f paths.h depend_encies = $(kpathsea_dir)/paths.h # Dependencies. # Have to use -M, not -MM, since we use instead of # "kpathsea/..." in the sources. But then have to remove the directory # prefixes and all the system include files. depend depend.make: c-auto.h $(depend_encies) $(CC) -M $(CPPFLAGS) *.c \ | sed -e 's,\.\./kpathsea,$$(kpathsea_dir),g' \ -e 's,/usr[^ ]* ,,g' \ | uniq \ >depend.make absolute.o : absolute.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/absolute.h $(kpathsea_dir)/c-pathch.h concat.o : concat.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h concat3.o : concat3.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h concatn.o : concatn.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/concatn.h $(kpathsea_dir)/c-vararg.h db.o : db.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/db.h \ $(kpathsea_dir)/str-list.h $(kpathsea_dir)/hash.h $(kpathsea_dir)/line.h $(kpathsea_dir)/readable.h debug.o : debug.c $(kpathsea_dir)/debug.h default.o : default.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/default.h dir.o : dir.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h \ $(kpathsea_dir)/dir.h elt-dirs.o : elt-dirs.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/dir.h \ $(kpathsea_dir)/expand.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h expand.o : expand.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/tilde.h $(kpathsea_dir)/variable.h extend-fname.o : extend-fname.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h file-p.o : file-p.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h find-suffix.o : find-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h fn.o : fn.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/fn.h fontmap.o : fontmap.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/fontmap.h $(kpathsea_dir)/hash.h \ $(kpathsea_dir)/line.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/str-list.h gmalloc.o : gmalloc.c \ getpagesize.h hash.o : hash.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/hash.h $(kpathsea_dir)/str-list.h init-path.o : init-path.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/default.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h itoa.o : itoa.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h line.o : line.c make-suffix.o : make-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h path-elt.o : path-elt.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h pathsearch.o : pathsearch.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/absolute.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/db.h \ $(kpathsea_dir)/str-list.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/readable.h putenv.o : putenv.c $(kpathsea_dir)/c-auto.h readable.o : readable.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h \ $(kpathsea_dir)/readable.h $(kpathsea_dir)/truncate.h rm-suffix.o : rm-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h str-list.o : str-list.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/str-list.h str-llist.o : str-llist.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/str-llist.h tex-file.o : tex-file.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/default.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h \ $(kpathsea_dir)/tex-file.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h $(kpathsea_dir)/paths.h tex-glyph.o : tex-glyph.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/fontmap.h $(kpathsea_dir)/hash.h \ $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/tex-file.h $(kpathsea_dir)/default.h \ $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h $(kpathsea_dir)/paths.h $(kpathsea_dir)/tex-glyph.h \ $(kpathsea_dir)/tex-make.h $(kpathsea_dir)/variable.h tex-make.o : tex-make.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/concatn.h $(kpathsea_dir)/c-vararg.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/readable.h $(kpathsea_dir)/tex-make.h $(kpathsea_dir)/tex-file.h \ $(kpathsea_dir)/default.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/paths.h $(kpathsea_dir)/variable.h tilde.o : tilde.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/tilde.h truncate.o : truncate.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-namemx.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/c-pathmx.h \ $(kpathsea_dir)/truncate.h uppercasify.o : uppercasify.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-ctype.h variable.o : variable.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-ctype.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/variable.h version.o : version.c xcalloc.o : xcalloc.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xfopen.o : xfopen.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xmalloc.o : xmalloc.c xopendir.o : xopendir.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/dir.h xputenv.o : xputenv.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xrealloc.o : xrealloc.c xstat.o : xstat.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/xstat.h $(kpathsea_dir)/c-stat.h xstrdup.o : xstrdup.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h octave-1.1.0/kpathsea/c-auto.h.in100666 415 17 2730 5635173100 14707 0ustar jweusers/* Generated by autoheader. */ /* Used only when making the library standalone. */ /* c-auto.h.in. Generated automatically from configure.in by autoheader. */ /* Define to empty if the keyword does not work. */ #undef const /* Define if you have dirent.h. */ #undef DIRENT /* Define if you don't have dirent.h, but have ndir.h. */ #undef NDIR /* Define if you need to in order for stat and other things to work. */ #undef _POSIX_SOURCE /* Define if you have the ANSI C header files. */ #undef STDC_HEADERS /* Define if you don't have dirent.h, but have sys/dir.h. */ #undef SYSDIR /* Define if you don't have dirent.h, but have sys/ndir.h. */ #undef SYSNDIR /* Define if the closedir function returns void instead of int. */ #undef VOID_CLOSEDIR /* Define if you have memmove. */ #undef HAVE_MEMMOVE /* Define if you have putenv. */ #undef HAVE_PUTENV /* Define if you have the header file. */ #undef HAVE_ASSERT_H /* Define if you have the header file. */ #undef HAVE_FLOAT_H /* Define if you have the header file. */ #undef HAVE_LIMITS_H /* Define if you have the header file. */ #undef HAVE_MEMORY_H /* Define if you have the header file. */ #undef HAVE_PWD_H /* Define if you have the header file. */ #undef HAVE_STDLIB_H /* Define if you have the header file. */ #undef HAVE_STRING_H /* Define if you have the header file. */ #undef HAVE_UNISTD_H #undef SMART_PUTENV octave-1.1.0/kpathsea/configure.in100666 415 17 206 5532214411 15223 0ustar jweusersdnl Process this file with autoconf to produce a configure script. AC_INIT(kpathsea.texi) sinclude(common.ac) AC_OUTPUT(./Makefile) octave-1.1.0/kpathsea/paths.h.in100666 415 17 5355 5544327542 14656 0ustar jweusers/* paths.h.in: fallback paths for TeX file searching. Kpathsea doesn't provide format-specific routines for all these, but it still seems best to centralize the definitions. The meanings of all these paths are described in the various programs' documentation. Various environment variables override these. By the way, // means to search subdirectories (recursively). A leading %% means to look only in the ls-R db, not on the disk. See the Kpathsea manual for full details. See kpathsea/INSTALL for a description of how the various path-related files are used and created, and how to change the default paths. */ /* TeX and MF inputs, and the default for eps figures. */ #ifndef DEFAULT_TEX_PATH #define DEFAULT_TEX_PATH ".:(texinputdir)//" #endif #ifndef DEFAULT_MF_PATH /* It's pointless to search the adobe, bitstream, etc. directories for Metafont sources, but we want at least ams/ and public/, and who knows if there might be others. */ #define DEFAULT_MF_PATH ".:(mfinputdir)//:(fontdir)//src//" #endif /* Dumped formats. */ #ifndef DEFAULT_FMT_PATH #define DEFAULT_FMT_PATH ".:(fmtdir)" #endif #ifndef DEFAULT_BASE_PATH #define DEFAULT_BASE_PATH ".:(basedir)" #endif /* INI* string pool files. */ #ifndef DEFAULT_TEXPOOL_PATH #define DEFAULT_TEXPOOL_PATH "(texpooldir)" #endif #ifndef DEFAULT_MFPOOL_PATH #define DEFAULT_MFPOOL_PATH "(mfpooldir)" #endif #ifndef DEFAULT_TFM_PATH /* TeX font metric files. */ #define DEFAULT_TFM_PATH ".:(fontdir)//tfm" #endif #ifndef DEFAULT_VF_PATH /* Virtual font metrics. */ #define DEFAULT_VF_PATH ".:(fontdir)//vf" #endif /* The TeX bitmap formats. */ #ifndef DEFAULT_GLYPH_PATH /* This is for texfonts.map. */ #define DEFAULT_GLYPH_PATH ".:(fontdir)//" #endif #ifndef DEFAULT_GF_PATH #define DEFAULT_GF_PATH ".:(fontdir)//gf" #endif #ifndef DEFAULT_PK_PATH #define DEFAULT_PK_PATH ".:(fontdir)//pk//" #endif /* BibTeX bibliographies and styles. */ #ifndef DEFAULT_BIB_PATH #define DEFAULT_BIB_PATH ".:(texmf_prefix)/bibtex/bib" #endif #ifndef DEFAULT_BST_PATH #define DEFAULT_BST_PATH ".:(texmf_prefix)/bibtex/bst" #endif /* Dvips' configuration files. */ #ifndef DEFAULT_CONFIG_PATH #define DEFAULT_CONFIG_PATH ".:~:(configdir)" #endif /* Dvips' PostScript prologues, and downloadable fonts (.pf[ab] files). */ #ifndef DEFAULT_HEADER_PATH #define DEFAULT_HEADER_PATH ".:(headerdir):(fontdir)//type1" #endif /* Dvips' and xdvi's epsf and ps figures. It is probably a mistake to make this more restrictive than the DEFAULT_TEX_PATH, because TeX needs to be able to read the .eps files also. */ #ifndef DEFAULT_FIG_PATH #define DEFAULT_FIG_PATH DEFAULT_TEX_PATH #endif /* Dvips' TIFF files, etc. */ #ifndef DEFAULT_PICT_PATH #define DEFAULT_PICT_PATH DEFAULT_FIG_PATH #endif octave-1.1.0/kpathsea/absolute.h100666 415 17 2030 5405154144 14723 0ustar jweusers/* absolute.h: Declare absolute filename predicate. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_ABSOLUTE_H #define KPATHSEA_ABSOLUTE_H #include #include /* True if FILENAME is absolute (/foo) or explicitly relative (./foo, ../foo), else false (foo). */ extern boolean kpse_absolute_p P1H(string filename); #endif /* not KPATHSEA_ABSOLUTE_H */ octave-1.1.0/kpathsea/version.c100666 415 17 101 5547256420 14551 0ustar jweuserschar *kpathsea_version_string = (char *) "kpathsea version 1.8"; octave-1.1.0/kpathsea/c-ctype.h100666 415 17 5366 5421524721 14470 0ustar jweusers/* c-ctype.h: ASCII-safe versions of the macros. Copyright (C) 1992 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_CTYPE_H #define KPATHSEA_C_CTYPE_H #include /* Be sure we have `isascii'. */ #ifndef isascii #define isascii(c) 1 #endif #define ISALNUM(c) (isascii (c) && isalnum(c)) #define ISALPHA(c) (isascii (c) && isalpha(c)) #define ISASCII isascii #define ISCNTRL(c) (isascii (c) && iscntrl(c)) #define ISDIGIT(c) (isascii (c) && isdigit (c)) #define ISGRAPH(c) (isascii (c) && isgraph(c)) #define ISLOWER(c) (isascii (c) && islower(c)) #define ISPRINT(c) (isascii (c) && isprint(c)) #define ISPUNCT(c) (isascii (c) && ispunct(c)) #define ISSPACE(c) (isascii (c) && isspace(c)) #define ISUPPER(c) (isascii (c) && isupper(c)) #define ISXDIGIT(c) (isascii (c) && isxdigit(c)) #define TOASCII toascii #define TOLOWER(c) (ISUPPER (c) ? tolower (c) : (c)) #define TOUPPER(c) (ISLOWER (c) ? toupper (c) : (c)) /* This isn't part of the usual , but it's useful sometimes. */ #ifndef isblank #define isblank(c) ((c) == ' ' || (c) == '\t') #endif /* Here's why this mess is necessary: From: meyering@cs.utexas.edu (Jim Meyering) Date: Wed, 25 Nov 1992 09:52:33 -0600 Subject: ss-921123: using isascii with macros Yesterday some cursory regression testing found that GNU od (in an upcoming release of textutils) generated incorrect output when run on an SGI indigo because isprint ('\377') returned true. Of course, '\377' is not a printing character; the problem lay in using isprint without first making sure its integer argument corresponded to an ascii code. MORAL: always guard uses of ctype macros with isascii if it's available. An obvious alternative is to avoid and define and use your own versions of the ctype macros. A pretty clean approach to using and isascii was suggested by David MacKenzie: #ifndef isascii #define isascii(c) 1 #endif #define ISDIGIT(c) (isascii (c) && isdigit (c)) #define ISPRINT(c) (isascii (c) && isprint (c)) ... then, use ISDIGIT, etc. instead of isdigit, etc. */ #endif /* not KPATHSEA_C_CTYPE_H */ octave-1.1.0/kpathsea/c-errno.h100666 415 17 1604 5405152563 14463 0ustar jweusers/* c-errno.h: and the errno variable. Copyright (C) 1992 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_ERRNO_H #define KPATHSEA_C_ERRNO_H #include #ifndef errno extern int errno; #endif #endif /* not KPATHSEA_C_ERRNO_H */ octave-1.1.0/kpathsea/c-fopen.h100666 415 17 2737 5312427513 14452 0ustar jweusers/* c-fopen.h: how to open files with fopen. Copyright (C) 1992 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef C_FOPEN_H #define C_FOPEN_H /* How to open a text file: */ #ifndef FOPEN_R_MODE #define FOPEN_R_MODE "r" #endif #ifndef FOPEN_W_MODE #define FOPEN_W_MODE "w" #endif /* How to open a binary file for reading: */ #ifndef FOPEN_RBIN_MODE #if defined (VMS) || defined (DOS) || defined (VMCMS) #define FOPEN_RBIN_MODE "rb" #else #define FOPEN_RBIN_MODE "r" #endif /* not (VM/CMS or DOS or VMS) */ #endif /* not FOPEN_RBIN_MODE */ /* How to open a binary file for writing: */ #ifndef FOPEN_WBIN_MODE #ifdef DOS #define FOPEN_WBIN_MODE "wb" #else #ifdef VMCMS #define FOPEN_WBIN_MODE "wb, lrecl=1024, recfm=f" #else #define FOPEN_WBIN_MODE "w" #endif /* not VM/CMS */ #endif /* not DOS */ #endif /* not FOPEN_WBIN_MODE */ #endif /* not C_FOPEN_H */ octave-1.1.0/kpathsea/c-limits.h100666 415 17 2065 5412344433 14636 0ustar jweusers/* c-limits.h: include the system parameter file. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef C_LIMITS_H #define C_LIMITS_H #ifdef HAVE_LIMITS_H #include #else #include #include #endif /* Some systems may have the floating-point limits in the above. */ #if defined (HAVE_FLOAT_H) && !defined (FLT_MAX) #include #endif #endif /* not C_LIMITS_H */ octave-1.1.0/kpathsea/c-memstr.h100666 415 17 4222 5504660575 14653 0ustar jweusers/* c-memstr.h: memcpy, strchr, etc. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_MEMSTR_H #define KPATHSEA_C_MEMSTR_H /* Just to be complete, we make both the system V/ANSI and the BSD versions of the string functions available. */ #if defined (STDC_HEADERS) || defined (HAVE_STRING_H) #include /* An ANSI string.h and pre-ANSI memory.h might conflict. */ #if !defined (STDC_HEADERS) && defined (HAVE_MEMORY_H) #include #endif /* not STDC_HEADERS and HAVE_MEMORY_H */ /* Do not define these if we are not STDC_HEADERS, because in that case X11/Xos.h defines `strchr' to be `index'. */ #ifdef STDC_HEADERS /* Let's hope that if index/rindex are defined, they're defined to the right thing. */ #ifndef index #define index strchr #endif #ifndef rindex #define rindex strrchr #endif #endif /* STDC_HEADERS */ #ifndef HAVE_BCOPY #ifndef bcmp #define bcmp(s1, s2, len) memcmp ((s1), (s2), (len)) #endif #ifndef bcopy #define bcopy(from, to, len) memcpy ((to), (from), (len)) #endif #ifndef bzero #define bzero(s, len) memset ((s), 0, (len)) #endif #endif /* not HAVE_BCOPY */ #else /* not (STDC_HEADERS or HAVE_STRING_H) */ #include #ifndef strchr #define strchr index #endif #ifndef strrchr #define strrchr rindex #endif #define memcmp(s1, s2, n) bcmp ((s1), (s2), (n)) #define memcpy(to, from, len) bcopy ((from), (to), (len)) extern char *strtok (); extern char *strstr (); #endif /* not (STDC_HEADERS or HAVE_STRING_H) */ #endif /* not KPATHSEA_C_MEMSTR_H */ octave-1.1.0/kpathsea/c-minmax.h100666 415 17 3604 5405157635 14636 0ustar jweusers/* c-minmax.h: define INT_MIN, etc. Assume a 32-bit machine if the values aren't defined. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_MINMAX_H #define KPATHSEA_C_MINMAX_H #include /* Declared in on ANSI C systems. If the system doesn't define it, we use the minimum ANSI values -- except for `int'; we assume 32-bit integers. */ #ifndef SCHAR_MIN #define SCHAR_MIN (-127) #endif #ifndef SCHAR_MAX #define SCHAR_MAX 128 #endif #ifndef UCHAR_MAX #define UCHAR_MAX 255 #endif #ifndef SHRT_MIN #define SHRT_MIN (-32767) #endif #ifndef SHRT_MAX #define SHRT_MAX 32767 #endif #ifndef USHRT_MAX #define USHRT_MAX 65535 #endif #ifndef INT_MIN #define INT_MIN (-2147483647) #endif #ifndef INT_MAX #define INT_MAX 2147483647 #endif #ifndef UINT_MAX #define UINT_MAX 4294967295 #endif #ifndef LONG_MIN #define LONG_MIN INT_MIN #endif #ifndef LONG_MAX #define LONG_MAX INT_MAX #endif #ifndef ULONG_MAX #define ULONG_MAX UINT_MAX #endif /* Declared in on ANSI C systems. */ #ifndef DBL_MIN #define DBL_MIN 1e-37 #endif #ifndef DBL_MAX #define DBL_MAX 1e+37 #endif #ifndef FLT_MIN #define FLT_MIN 1e-37 #endif #ifndef FLT_MAX #define FLT_MAX 1e+37 #endif #endif /* not KPATHSEA_C_MINMAX_H */ octave-1.1.0/kpathsea/c-namemx.h100666 415 17 2315 5467270120 14621 0ustar jweusers/* c-namemx.h: define NAME_MAX, the maximum length of a single component in a filename. No such limit may exist, or may vary depending on the filesystem. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_NAME_MX_H #define KPATHSEA_C_NAME_MX_H #include /* Most likely the system will truncate filenames if it is not POSIX, and so we can use the BSD value here. */ #ifndef _POSIX_NAME_MAX #define _POSIX_NAME_MAX 255 #endif #ifndef NAME_MAX #define NAME_MAX _POSIX_NAME_MAX #endif #endif /* not KPATHSEA_C_NAME_MX_H */ octave-1.1.0/kpathsea/c-pathch.h100666 415 17 3644 5400464376 14616 0ustar jweusers/* c-pathch.h: define the characters which separate components of filenames and environment variable paths. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef C_PATHCH_H #define C_PATHCH_H /* What separates filename components? */ #ifndef DIR_SEP #ifdef VMS #define DIR_SEP ':' #define DIR_SEP_STRING ":" #else #ifdef DOS #define DIR_SEP '\\' #define DIR_SEP_STRING "\\" /* On DOS, it's good to allow both \ and / between directories. */ #define IS_DIR_SEP(ch) ((ch) == DIR_SEP || (ch) == '/') #else #ifdef VMCMS #define DIR_SEP ' ' #define DIR_SEP_STRING " " #else #define DIR_SEP '/' #define DIR_SEP_STRING "/" #endif /* not VM/CMS */ #endif /* not DOS */ #endif /* not VMS */ #endif /* not PATH_SEP */ #ifndef IS_DIR_SEP #define IS_DIR_SEP(ch) ((ch) == DIR_SEP) #endif /* What separates elements in environment variable path lists? */ #ifndef ENV_SEP #ifdef VMS #define ENV_SEP ',' #define ENV_SEP_STRING "," #else #ifdef DOS #define ENV_SEP ';' #define ENV_SEP_STRING ";" #else #ifdef VMCMS #define ENV_SEP ' ' #define ENV_SEP_STRING " " #else #define ENV_SEP ':' #define ENV_SEP_STRING ":" #endif /* not VM/CMS */ #endif /* not DOS */ #endif /* not VMS */ #endif /* not ENV_SEP */ #ifndef IS_ENV_SEP #define IS_ENV_SEP(ch) ((ch) == ENV_SEP) #endif #endif /* not C_PATHCH_H */ octave-1.1.0/kpathsea/c-pathmx.h100666 415 17 2456 5477676441 14664 0ustar jweusers/* c-pathmx.h: define PATH_MAX, the maximum length of a filename. Since no such limit may exist, it's preferable to dynamically grow filenames as needed. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_PATH_MX_H #define KPATHSEA_C_PATH_MX_H #include /* Cheat and define this as a manifest constant no matter what, instead of using pathconf. I forget why we want to do this. */ #ifndef _POSIX_PATH_MAX #define _POSIX_PATH_MAX 255 #endif #ifndef PATH_MAX #ifdef MAXPATHLEN #define PATH_MAX MAXPATHLEN #else #define PATH_MAX _POSIX_PATH_MAX #endif #endif /* not PATH_MAX */ #endif /* not KPATHSEA_C_PATH_MAX_H */ octave-1.1.0/kpathsea/c-proto.h100666 415 17 4112 5406117127 14474 0ustar jweusers/* c-proto.h: macros to include or discard prototypes. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_PROTO_H #define KPATHSEA_C_PROTO_H /* These macros munge function declarations to make them work in both cases. The P?H macros are used for declarations, the P?C for definitions. Cf. from the GNU C library. P1H(void) also works for definitions of routines which take no args. */ #if __STDC__ #define P1H(p1) (p1) #define P2H(p1,p2) (p1, p2) #define P3H(p1,p2,p3) (p1, p2, p3) #define P4H(p1,p2,p3,p4) (p1, p2, p3, p4) #define P5H(p1,p2,p3,p4,p5) (p1, p2, p3, p4, p5) #define P1C(t1,n1)(t1 n1) #define P2C(t1,n1, t2,n2)(t1 n1, t2 n2) #define P3C(t1,n1, t2,n2, t3,n3)(t1 n1, t2 n2, t3 n3) #define P4C(t1,n1, t2,n2, t3,n3, t4,n4)(t1 n1, t2 n2, t3 n3, t4 n4) #define P5C(t1,n1, t2,n2, t3,n3, t4,n4, t5,n5) \ (t1 n1, t2 n2, t3 n3, t4 n4, t5 n5) #else /* not __STDC__ */ #define P1H(p1) () #define P2H(p1, p2) () #define P3H(p1, p2, p3) () #define P4H(p1, p2, p3, p4) () #define P5H(p1, p2, p3, p4, p5) () #define P1C(t1,n1) (n1) t1 n1; #define P2C(t1,n1, t2,n2) (n1, n2) t1 n1; t2 n2; #define P3C(t1,n1, t2,n2, t3,n3) (n1, n2, n3) t1 n1; t2 n2; t3 n3; #define P4C(t1,n1, t2,n2, t3,n3, t4,n4) (n1, n2, n3, n4) \ t1 n1; t2 n2; t3 n3; t4 n4; #define P5C(t1,n1, t2,n2, t3,n3, t4,n4, t5,n5) (n1, n2, n3, n4, n5) \ t1 n1; t2 n2; t3 n3; t4 n4; t5 n5; #endif /* not __STDC__ */ #endif /* not KPATHSEA_C_PROTO_H */ octave-1.1.0/kpathsea/c-stat.h100666 415 17 4223 5412343440 14303 0ustar jweusers/* c-stat.h: declarations for using stat(2). Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_STAT_H #define KPATHSEA_STAT_H #include #include /* POSIX predicates for testing file attributes. */ #if !defined (S_ISBLK) && defined (S_IFBLK) #define S_ISBLK(m) (((m) & S_IFMT) == S_IFBLK) #endif #if !defined (S_ISCHR) && defined (S_IFCHR) #define S_ISCHR(m) (((m) & S_IFMT) == S_IFCHR) #endif #if !defined (S_ISDIR) && defined (S_IFDIR) #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif #if !defined (S_ISREG) && defined (S_IFREG) #define S_ISREG(m) (((m) & S_IFMT) == S_IFREG) #endif #if !defined (S_ISFIFO) && defined (S_IFIFO) #define S_ISFIFO(m) (((m) & S_IFMT) == S_IFIFO) #endif #if !defined (S_ISLNK) && defined (S_IFLNK) #define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK) #endif #if !defined (S_ISSOCK) && defined (S_IFSOCK) #define S_ISSOCK(m) (((m) & S_IFMT) == S_IFSOCK) #endif #if !defined (S_ISMPB) && defined (S_IFMPB) /* V7 */ #define S_ISMPB(m) (((m) & S_IFMT) == S_IFMPB) #define S_ISMPC(m) (((m) & S_IFMT) == S_IFMPC) #endif #if !defined (S_ISNWK) && defined (S_IFNWK) /* HP/UX */ #define S_ISNWK(m) (((m) & S_IFMT) == S_IFNWK) #endif /* Two files are indistinguishable if they are on the same device and have the same inode. This checks two stat buffers for that. Cf. the `same_file_p' routine in file-p.c, declared in kpathlib.h. */ #define SAME_FILE_P(s1, s2) \ ((s1).st_ino == (s2).st_ino && (s1).st_dev == (s2).st_dev) #endif /* not KPATHSEA_STAT_H */ octave-1.1.0/kpathsea/c-std.h100666 415 17 5742 5523520657 14143 0ustar jweusers/* c-std.h: the first header files. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_STD_H #define KPATHSEA_C_STD_H /* X uses these symbols to say whether we have , , etc. We never use them ourselves. */ #ifdef STDC_HEADERS #define SYSV #else #define X_NOT_STDC_ENV #endif /* Header files that essentially all of our sources need, and that all implementations have. We include these first, to help with NULL being defined multiple times. */ #include #include /* Be sure we have constants from . */ #include #if HAVE_STDLIB_H #include /* Include before , to help avoid NULL redefinitions on some systems. (We don't include ourselves any more, but FYI.) */ #else /* It's impossible to say for sure what the system will deign to put in , but let's hope it's at least these. */ extern char *getenv (); #ifndef ALLOC_RETURN_TYPE #ifdef DOS #define ALLOC_RETURN_TYPE void #else #define ALLOC_RETURN_TYPE char #endif /* not DOS */ #endif /* not ALLOC_RETURN_TYPE */ #ifndef _MALLOC_INTERNAL /* Don't bother to declare these if we are compiling gmalloc.c itself. */ extern ALLOC_RETURN_TYPE *calloc (), *malloc (), *realloc (); #endif #endif /* not STDC_HEADERS */ /* SunOS 4.1.1 gets STDC_HEADERS defined, but it doesn't provide EXIT_FAILURE. So far no system has defined one of EXIT_FAILURE and EXIT_SUCCESS without the other. */ #ifndef EXIT_SUCCESS #ifdef VMS #define EXIT_SUCCESS 1 #define EXIT_FAILURE 0 #else #define EXIT_SUCCESS 0 #define EXIT_FAILURE 1 #endif #endif /* not EXIT_SUCCESS */ /* strchr vs. index, memcpy vs. bcopy, etc. */ #include /* Error numbers and errno declaration. */ #include /* Numeric minima and maxima. */ #include /* Assertions are too useful to not make generally available. */ #ifdef HAVE_ASSERT_H #include #else #define assert(expr) /* as nothing */ #endif #ifdef VMS #include #include #else /* `popen' and `pclose' are part of POSIX.2, not POSIX.1. So STDC_HEADERS isn't enough. */ extern FILE *popen (); extern int pclose (); #endif /* hypot appears not to have made it into POSIX.2, even. */ extern double hypot (); #endif /* not KPATHSEA_C_STD_H */ octave-1.1.0/kpathsea/c-unistd.h100666 415 17 2604 5405157335 14647 0ustar jweusers/* c-unistd.h: ensure we have constants from . Included from c-std.h. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_C_UNISTD_H #define KPATHSEA_C_UNISTD_H /* is allowed to depend on . */ #include #if HAVE_UNISTD_H #include #endif #include /* For fseek. */ #ifndef SEEK_SET #define SEEK_SET 0 #define SEEK_CUR 1 #define SEEK_END 2 #endif /* not SEEK_SET */ /* For access. */ #ifndef F_OK #define F_OK 0 #define X_OK 1 #define W_OK 2 #define R_OK 4 #endif /* not F_OK */ #ifndef STDIN_FILENO #define STDIN_FILENO 0 #define STDOUT_FILENO 1 #define STDERR_FILENO 2 #endif /* not STDIN_FILENO */ #endif /* not KPATHSEA_C_UNISTD_H */ octave-1.1.0/kpathsea/c-vararg.h100666 415 17 4307 5532747241 14627 0ustar jweusers/* c-vararg.h: Top layer for stdarg and varargs. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef C_VARARG_H #define C_VARARG_H /* See `kpathsea/init-path.c' for an example of use. The idea is to say PVAR1(type1, parameter1, ap) in the function header, and then end the function with two }}'s. We do this to avoid having to specify the argument list (with types) twice -- once in the function header, and once in a (hypothetical) VA_START1. */ #if __STDC__ #include #define PVAR1H(p1) (p1, ...) #define PVAR2H(p1, p2) (p1, p2, ...) #define PVAR3H(p1, p2, p3) (p1, p2, p3, ...) #define PVAR1C(t1, n1, ap) \ (t1 n1, ...) { va_list ap; va_start (ap, n1); #define PVAR2C(t1, n1, t2, n2, ap) \ (t1 n1, t2 n2, ...) { va_list ap; va_start (ap, n2); #define PVAR3C(t1, n1, t2, n2, t3, n3, ap) \ (t1 n1, t2 n2, t3 n3, ...) { va_list ap; va_start (ap, n3); #else /* not __STDC__ */ #include #define PVAR1H(p1) () #define PVAR2H(p1, p2) () #define PVAR3H(p1, p2, p3) () #define PVAR1C(t1, n1, ap) \ (va_alist) va_dcl { t1 n1; va_list ap; va_start (ap); \ n1 = va_arg (ap, t1); #define PVAR2C(t1, n1, t2, n2, ap) \ (va_alist) va_dcl { t1 n1; t2 n2; va_list ap; va_start (ap); \ n1 = va_arg (ap, t1); n2 = va_arg (ap, t2); #define PVAR3C(t1, n1, t2, n2, t3, n3, ap) \ (va_alist) va_dcl { t1 n1; t2 n2; t3 n3; va_list ap; va_start (ap); \ n1 = va_arg (ap, t1); n2 = va_arg (ap, t2); \ n3 = va_arg (ap, t3); #endif /* not __STDC__ */ #endif /* not C_VARARG_H */ octave-1.1.0/kpathsea/concatn.h100666 415 17 2362 5445050746 14551 0ustar jweusers/* concatn.h: concatenate a variable number of strings. This is a separate include file only because I don't see the point of having every source file include . The declarations for the other concat routines are in lib.h. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_CONCATN_H #define KPATHSEA_CONCATN_H #include #include #include /* Concatenate a null-terminated list of strings and return the result in malloc-allocated memory. */ extern string concatn PVAR1H(const_string str1); #endif /* not KPATHSEA_CONCATN_H */ octave-1.1.0/kpathsea/config.h100666 415 17 3551 5504661174 14371 0ustar jweusers/* config.h: master configuration file, included first by all compilable source files (not headers). Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_CONFIG_H #define KPATHSEA_CONFIG_H /* System dependencies that are figured out by `configure'. If we are compiling standalone, we get our c-auto.h. Otherwise, the package containing us must provide this (unless it can somehow generate ours from c-auto.h.in). We use <...> instead of "..." so that the current cpp directory (i.e., kpathsea/) won't be searched. */ #include /* ``Standard'' system headers. */ #include /* Macros to discard or keep prototypes. */ #include /* Our own definitions of supposedly always-useful stuff. */ #include #include /* Support extra runtime tracing. */ #include /* If you want to find subdirectories in a directory with non-Unix semantics (specifically, if a directory with no subdirectories does not have exactly two links), define this. */ #if !defined (DOS) && !defined (VMS) && !defined (VMCMS) #define UNIX_ST_NLINK #endif /* not DOS and not VMS and not VMCMS */ #endif /* not KPATHSEA_CONFIG_H */ octave-1.1.0/kpathsea/db.h100666 415 17 2731 5540677222 13511 0ustar jweusers/* db.h: lookups in an externally built db file. Copyright (C) 1994 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_DB_H #define KPATHSEA_DB_H #include #include #include /* It's not an error if this doesn't exist; we just go ahead and search the actual directories. */ #ifndef DB_DIR #define DB_DIR "/usr/local/lib/texmf" #endif #ifndef DB_NAME #define DB_NAME "ls-R" #endif /* Return list of matches for NAME in the external db file that match PATH. If ALL is set, return all matches, else the first. If there are no matches, returns a pointer to an empty list. If the database can't be located, returns NULL. */ extern str_list_type *kpse_db_search P3H(const_string name, const_string path, boolean all); #endif /* not KPATHSEA_DB_H */ octave-1.1.0/kpathsea/debug.h100666 415 17 2421 5542667734 14217 0ustar jweusers/* debug.h: Runtime tracing. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_DEBUG_H #define KPATHSEA_DEBUG_H /* If NO_DEBUG is defined, skip all this. */ #ifndef NO_DEBUG /* OK, we'll have tracing support. */ #define DEBUG /* Bit vector defining what we should trace. */ extern unsigned kpathsea_debug; /* Set a bit. */ #define DEBUG_SET(bit) do { kpathsea_debug |= 1 << (bit); } while (0) /* Test if a bit is on. */ #define DEBUG_P(bit) (kpathsea_debug & (1 << (bit))) #define DEBUG_STAT 0 /* stat calls */ #define DEBUG_DB_BUILD 1 /* hash table built from ls-R */ #endif /* not NO_DEBUG */ #endif /* not KPATHSEA_DEBUG_H */ octave-1.1.0/kpathsea/default.h100666 415 17 2227 5405171746 14550 0ustar jweusers/* default.h: Declare default path expander. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_DEFAULT_H #define KPATHSEA_DEFAULT_H #include #include /* Replace a leading or trailing or doubled : in PATH with FALLBACK. If no extra colons, return PATH. Only one extra colon is replaced. FALLBACK may not be NULL. */ extern string kpse_expand_default P2H(const_string path, const_string fallback); #endif /* not KPATHSEA_FALLBACK_H */ octave-1.1.0/kpathsea/dir.h100666 415 17 3325 5502160712 13667 0ustar jweusers/* dir.h: checked directory operations. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_DIR_H #define KPATHSEA_DIR_H #include #include /* Use struct dirent instead of struct direct. */ #if defined (DIRENT) || defined (_POSIX_VERSION) #include #define NLENGTH(dirent) strlen ((dirent)->d_name) #else /* not (DIRENT or _POSIX_VERSION) */ #define dirent direct #define NLENGTH(dirent) ((dirent)->d_namlen) #ifdef SYSNDIR #include #endif #ifdef NDIR #include #endif #ifdef SYSDIR #include #endif #endif /* not (DIRENT or _POSIX_VERSION) */ /* Like opendir, closedir, and chdir, but abort if DIRNAME can't be opened. */ extern DIR *xopendir P1H(string dirname); extern void xclosedir P1H(DIR *); /* Returns true if FN is a directory or a symlink to a directory. */ extern boolean dir_p P1H(const_string fn); /* If FN is a readable directory, return the number of links it has. Otherwise, return -1. */ extern int dir_links P1H(const_string fn); #endif /* not KPATHSEA_DIR_H */ octave-1.1.0/kpathsea/expand.h100666 415 17 2030 5422312114 14354 0ustar jweusers/* expand.h: general expansion. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_EXPAND_H #define KPATHSEA_EXPAND_H #include #include /* Call kpse_var_expand and kpse_tilde_expand (in that order). Result is always in fresh memory, even if no expansions were done. */ extern string kpse_expand P1H(const_string s); #endif /* not KPATHSEA_EXPAND_H */ octave-1.1.0/kpathsea/fn.h100666 415 17 4562 5422273433 13526 0ustar jweusers/* fn.h: arbitrarily long filenames (or just strings). Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_FN_H #define KPATHSEA_FN_H #include #include /* Arbitrarily long filenames; it's inconvenient to use obstacks here, because we want to maintain a null terminator. Also used for dynamically growing strings even when the null byte isn't necessary, e.g., in `variable.c', since I don't want to pass obstacks around everywhere, and one can't free parts of an obstack arbitrarily. */ typedef struct { string str; unsigned allocated; unsigned length; /* includes the terminating null byte, if any */ } fn_type; #define FN_STRING(fn) ((fn).str) #define FN_ALLOCATED(fn) ((fn).allocated) #define FN_LENGTH(fn) ((fn).length) /* Create a new empty fn. */ extern fn_type fn_init P1H(void); /* Create a new fn from the first LEN characters from S and a null. */ extern fn_type fn_copy0 P2H(const_string s, unsigned len); /* Free what's been allocated. Can also just free the string if it's been extracted out. Fatal error if nothing allocated in F. */ extern void fn_free P1H(fn_type *f); /* Append the character C to the fn F. Don't append trailing null. */ extern void fn_1grow P2H(fn_type *f, char c); /* Append LENGTH bytes from SOURCE to F. */ extern void fn_grow P3H(fn_type *f, address source, unsigned length); /* Concatenate the component S to the fn F. Assumes string currently in F is null terminated. */ extern void fn_str_grow P2H(fn_type *f, const_string s); /* Add a null to F's string at position LOC, and update its length. Fatal error if LOC is past the end of the string. */ extern void fn_shrink_to P2H(fn_type *f, unsigned loc); #endif /* not KPATHSEA_FN_H */ octave-1.1.0/kpathsea/fontmap.h100666 415 17 2475 5534212414 14564 0ustar jweusers/* fontmap.h: declarations for reading a file to define additional font names. Copyright (C) 1993, 94 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef FONTMAP_H #define FONTMAP_H #include #include #include /* Parse the file `texfonts.map' in each of the directories in PATH and return the resulting structure. Entries in earlier files override later files. */ extern hash_table_type map_create P1H(const_string path); /* Look up KEY in MAP, and return a null-terminated list of all matching entries. If none, return NULL. */ extern string *map_lookup P2H(hash_table_type map, const_string key); #endif /* not FONTMAP_H */ octave-1.1.0/kpathsea/getpagesize.h100777 415 17 1162 5426320432 15422 0ustar jweusers/* Emulate getpagesize on systems that lack it. */ #ifndef HAVE_GETPAGESIZE #ifdef VMS #define getpagesize() 512 #endif #ifdef HAVE_UNISTD_H #include #endif #ifdef _SC_PAGESIZE #define getpagesize() sysconf(_SC_PAGESIZE) #else #include #ifdef EXEC_PAGESIZE #define getpagesize() EXEC_PAGESIZE #else #ifdef NBPG #define getpagesize() NBPG * CLSIZE #ifndef CLSIZE #define CLSIZE 1 #endif /* no CLSIZE */ #else /* no NBPG */ #ifdef NBPC #define getpagesize() NBPC #endif /* NBPC */ #endif /* no NBPG */ #endif /* no EXEC_PAGESIZE */ #endif /* no _SC_PAGESIZE */ #endif /* not HAVE_GETPAGESIZE */ octave-1.1.0/kpathsea/hash.h100666 415 17 3451 5535633004 14041 0ustar jweusers/* hash.h: declarations for a hash table. Copyright (C) 1994 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef HASH_H #define HASH_H #include #include /* A single (key,value) pair. */ typedef struct hash_element_struct { const_string key; const_string value; struct hash_element_struct *next; } hash_element_type; /* The usual arrangement of buckets initialized to null. */ typedef struct { hash_element_type **buckets; unsigned size; } hash_table_type; /* Create a hash table of size SIZE. */ extern hash_table_type hash_create P1H(unsigned size); /* Look up KEY in MAP, and return a null-terminated list of all matching entries. If none, return NULL. The list can be freed, but the elements in the list are the actual values in the hash table. */ extern string *hash_lookup P2H(hash_table_type table, const_string key); /* Insert the (KEY,VALUE) association into TABLE. KEY may have more than one VALUE. */ extern void hash_insert P3H(hash_table_type *table, const_string key, const_string value); /* Print TABLE to stdout. */ extern void hash_print P1H(hash_table_type table); #endif /* not HASH_H */ octave-1.1.0/kpathsea/init-path.h100666 415 17 2467 5533153470 15023 0ustar jweusers/* init-path.h: Declarations for path initialization. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_INIT_PATH_H #define KPATHSEA_INIT_PATH_H #include #include /* The first arguments are fixed. Any number of additional arguments, must be strings naming environment variables, terminated with NULL. Expand the value of the first set environment variable, or CURRENT if none are set, with `kpse_expand_default' (with DEFAULT_PATH), and return the result. */ extern string kpse_init_path PVAR2H(const_string current, const_string default_path); #endif /* not KPATHSEA_INIT_PATH_H */ octave-1.1.0/kpathsea/lib.h100666 415 17 13470 5464036546 13717 0ustar jweusers/* lib.h: declarations for common, low-level routines in kpathsea. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_LIB_H #define KPATHSEA_LIB_H #include /* Define common sorts of messages. */ /* This should be called only after a system call fails. Don't exit with status `errno', because that might be 256, which would mean success (exit statuses are truncated to eight bits). */ #define FATAL_PERROR(s) do { perror (s); exit (EXIT_FAILURE); } while (0) #define START_FATAL() do { fputs ("fatal: ", stderr) #define END_FATAL() fputs (".\n", stderr); exit (1); } while (0) #define FATAL(str) \ START_FATAL (); fprintf (stderr, "%s", str); END_FATAL () #define FATAL1(str, e1) \ START_FATAL (); fprintf (stderr, str, e1); END_FATAL () #define FATAL2(str, e1, e2) \ START_FATAL (); fprintf (stderr, str, e1, e2); END_FATAL () #define FATAL3(str, e1, e2, e3) \ START_FATAL (); fprintf (stderr, str, e1, e2, e3); END_FATAL () #define FATAL4(str, e1, e2, e3, e4) \ START_FATAL (); fprintf (stderr, str, e1, e2, e3, e4); END_FATAL () #define FATAL6(str, e1, e2, e3, e4, e5, e6) \ START_FATAL (); fprintf (stderr, str, e1, e2, e3, e4, e5, e6); END_FATAL () #define START_WARNING() do { fputs ("warning: ", stderr) #define END_WARNING() fputs (".\n", stderr); fflush (stderr); } while (0) #define WARNING(str) \ START_WARNING (); fprintf (stderr, "%s", str); END_WARNING () #define WARNING1(str, e1) \ START_WARNING (); fprintf (stderr, str, e1); END_WARNING () #define WARNING2(str, e1, e2) \ START_WARNING (); fprintf (stderr, str, e1, e2); END_WARNING () #define WARNING3(str, e1, e2, e3) \ START_WARNING (); fprintf (stderr, str, e1, e2, e3); END_WARNING () #define WARNING4(str, e1, e2, e3, e4) \ START_WARNING (); fprintf (stderr, str, e1, e2, e3, e4); END_WARNING () /* I find this easier to read. */ #define STREQ(s1, s2) (strcmp (s1, s2) == 0) /* This is the maximum number of numerals that result when a 64-bit integer is converted to a string, plus one for a trailing null byte, plus one for a sign. */ #define MAX_INT_LENGTH 21 /* If the environment variable TEST is set, return it; otherwise, DEFAULT. This is useful for paths that use more than one envvar. */ #define ENVVAR(test, default) (getenv (test) ? (test) : (default)) /* Return a fresh copy of S1 followed by S2, et al. */ extern string concat P2H(const_string s1, const_string s2); extern string concat3 P3H(const_string, const_string, const_string); /* `concatn' is declared in its own include file, to avoid pulling in all the varargs stuff. */ /* A fresh copy of just S. */ extern string xstrdup P1H(const_string s); /* Convert all lowercase characters in S to uppercase. */ extern string uppercasify P1H(const_string s); /* Convert the integer I to a string. */ extern string itoa P1H(int i); /* True if FILENAME1 and FILENAME2 are the same file. If stat fails on either name, returns false, with no error message. Cf. the `SAME_FILE_P' macro in xstat.h. */ extern boolean same_file_p P2H(const_string filename1, const_string filename2); /* If NAME has a suffix, return a pointer to its first character (i.e., the one after the `.'); otherwise, return NULL. */ extern string find_suffix P1H(const_string name); /* Return NAME with any suffix removed. */ extern string remove_suffix P1H(const_string name); /* Return S with the suffix SUFFIX, removing any suffix already present. For example, `make_suffix ("/foo/bar.baz", "karl")' returns `/foo/bar.karl'. Returns a string allocated with malloc. */ extern string make_suffix P2H(const_string s, const_string suffix); /* Return NAME with STEM_PREFIX prepended to the stem. For example, `make_prefix ("/foo/bar.baz", "x")' returns `/foo/xbar.baz'. Returns a string allocated with malloc. */ extern string make_prefix P2H(string stem_prefix, string name); /* If NAME has a suffix, simply return it; otherwise, return `NAME.SUFFIX'. */ extern string extend_filename P2H(const_string name, const_string suffix); /* Call putenv with the string `VAR=VALUE' and abort on error. */ extern void xputenv P2H(const_string var, const_string value); extern void xputenv_int P2H(const_string var, int value); /* Like their stdio counterparts, but abort on error, after calling perror(3) with FILENAME as its argument. */ extern FILE *xfopen P2H(const_string filename, const_string mode); extern void xfclose P2H(FILE *, const_string filename); extern void xfseek P4H(FILE *, long, int, string filename); extern unsigned long xftell P2H(FILE *, string filename); /* These call the corresponding function in the standard library, and abort if those routines fail. Also, `xrealloc' calls `xmalloc' if OLD_ADDRESS is null. */ extern address xmalloc P1H(unsigned size); extern address xrealloc P2H(address old_address, unsigned new_size); extern address xcalloc P2H(unsigned nelem, unsigned elsize); /* (Re)Allocate N items of type T using xmalloc/xrealloc. */ #define XTALLOC(n, t) ((t *) xmalloc ((n) * sizeof (t))) #define XTALLOC1(t) XTALLOC (1, t) #define XRETALLOC(addr, n, t) ((addr) = (t *) xrealloc (addr, (n) * sizeof(t))) #endif /* not KPATHSEA_LIB_H */ octave-1.1.0/kpathsea/line.h100666 415 17 2037 5427573311 14050 0ustar jweusers/* line.h: read an arbitrary-length input line. Copyright (C) 1992 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef LINE_H #define LINE_H #include #include /* Return NULL if we are at EOF, else the next line of F. The newline character at the end of string is removed. The string is allocated with malloc. */ extern string read_line P1H(FILE *f); #endif /* not LINE_H */ octave-1.1.0/kpathsea/malloc.h100666 415 17 7563 5633701763 14404 0ustar jweusers/* Author: Mark Moraes */ /* $Id: malloc.h,v 1.1 1994/09/08 21:36:26 jwe Exp $ */ #ifndef __XMALLOC_H__ #define __XMALLOC_H__ #define MALLOC_TRACE /* my one modification */ #if defined(ANSI_TYPES) || defined(__STDC__) #define univptr_t void * #else /* ! ANSI_TYPES */ #define univptr_t char * #define size_t unsigned int #endif /* ANSI_TYPES */ #if defined(ANSI_TYPES) && !defined(__STDC__) #define size_t unsigned long #endif #if defined(__STDC__) #define __proto(x) x #else #define __proto(x) () #endif /* * defined so users of new features of this malloc can #ifdef * invocations of those features. */ #define CSRIMALLOC #ifdef MALLOC_TRACE /* Tracing malloc definitions - helps find leaks */ extern univptr_t __malloc __proto((size_t, const char *, int)); extern univptr_t __calloc __proto((size_t, size_t, const char *, int)); extern univptr_t __realloc __proto((univptr_t, size_t, const char *, int)); extern univptr_t __valloc __proto((size_t, const char *, int)); extern univptr_t __memalign __proto((size_t, size_t, const char *, int)); extern univptr_t __emalloc __proto((size_t, const char *, int)); extern univptr_t __ecalloc __proto((size_t, size_t, const char *, int)); extern univptr_t __erealloc __proto((univptr_t, size_t, const char *, int)); extern char *__strdup __proto((const char *, const char *, int)); extern char *__strsave __proto((const char *, const char *, int)); extern void __free __proto((univptr_t, const char *, int)); extern void __cfree __proto((univptr_t, const char *, int)); #define malloc(x) __malloc((x), __FILE__, __LINE__) #define calloc(x, n) __calloc((x), (n), __FILE__, __LINE__) #define realloc(p, x) __realloc((p), (x), __FILE__, __LINE__) #define memalign(x, n) __memalign((x), (n), __FILE__, __LINE__) #define valloc(x) __valloc((x), __FILE__, __LINE__) #define emalloc(x) __emalloc((x), __FILE__, __LINE__) #define ecalloc(x, n) __ecalloc((x), (n), __FILE__, __LINE__) #define erealloc(p, x) __erealloc((p), (x), __FILE__, __LINE__) #define strdup(p) __strdup((p), __FILE__, __LINE__) #define strsave(p) __strsave((p), __FILE__, __LINE__) /* cfree and free are identical */ #define cfree(p) __free((p), __FILE__, __LINE__) #define free(p) __free((p), __FILE__, __LINE__) #else /* MALLOC_TRACE */ extern univptr_t malloc __proto((size_t)); extern univptr_t calloc __proto((size_t, size_t)); extern univptr_t realloc __proto((univptr_t, size_t)); extern univptr_t valloc __proto((size_t)); extern univptr_t memalign __proto((size_t, size_t)); extern univptr_t emalloc __proto((size_t)); extern univptr_t ecalloc __proto((size_t, size_t)); extern univptr_t erealloc __proto((univptr_t, size_t)); extern char *strdup __proto((const char *)); extern char *strsave __proto((const char *)); extern void free __proto((univptr_t)); extern void cfree __proto((univptr_t)); #endif /* MALLOC_TRACE */ extern void mal_debug __proto((int)); extern void mal_dumpleaktrace __proto((FILE *)); extern void mal_heapdump __proto((FILE *)); extern void mal_leaktrace __proto((int)); extern void mal_sbrkset __proto((int)); extern void mal_slopset __proto((int)); extern void mal_statsdump __proto(()); extern void mal_setstatsfile __proto((FILE *)); extern void mal_trace __proto((int)); extern int mal_verify __proto((int)); extern void mal_mmap __proto((char *)); /* * You may or may not want this - In gcc version 1.30, on Sun3s running * SunOS3.5, this works fine. */ #ifdef __GNUC__ #define alloca(n) __builtin_alloca(n) #endif /* __GNUC__ */ #ifdef sparc #define alloca(n) __builtin_alloca(n) #endif /* sparc */ #ifdef ANSI_TYPES #undef univptr_t #else /* ! ANSI_TYPES */ #undef univptr_t #undef size_t #endif /* ANSI_TYPES */ /* Just in case you want an ANSI malloc without an ANSI compiler */ #if defined(ANSI_TYPES) && !defined(__STDC__) #undef size_t #endif #undef __proto #endif /* __XMALLOC_H__ */ /* Do not add anything after this line */ octave-1.1.0/kpathsea/pathsearch.h100666 415 17 5223 5540713053 15236 0ustar jweusers/* pathsearch.h: generic path searching. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_PATHSEARCH_H #define KPATHSEA_PATHSEARCH_H #include #include #include /* If PATH is non-null, return its first element (as defined by IS_ENV_SEP). If it's NULL, return the next element in the previous path, a la strtok. Leading, trailing, or doubled colons result in the empty string. When at the end of PATH, return NULL. In any case, return a pointer to an area that may be overwritten on subsequent calls. */ extern string kpse_path_element P1H(const_string path); /* Given a path element ELT, return a pointer to a NULL-terminated list of the corresponding (existing) directory or directories, with trailing slashes, or NULL. If ELT is the empty string, check the current working directory. */ extern str_llist_type *kpse_element_dirs P1H(const_string elt); /* Expand any leading ~ and variable references in NAME. If the result is an absolute or explicitly relative filename, check whether it is a readable (regular) file. Otherwise, look in each of the directories specified in PATH (also do tilde and variable expansion on elements in PATH), using a prebuilt db (see db.h) if it's relevant for a given path element. If the prebuilt db doesn't exist, or if MUST_EXIST is true and NAME isn't found in the prebuilt db, look on the filesystem. (I.e., if MUST_EXIST is false, and NAME isn't found in the db, do *not* look on the filesystem.) In any case, return the complete filename if it was found, otherwise NULL. */ extern string kpse_path_search P3H(const_string path, const_string name, boolean must_exist); /* Like `kpse_path_search' with MUST_EXIST true, but return a list of all the filenames (or NULL if none), instead of taking the first. */ extern string *kpse_all_path_search P2H(const_string path, const_string name); #endif /* not KPATHSEA_PATHSEARCH_H */ octave-1.1.0/kpathsea/readable.h100666 415 17 2171 5422012324 14642 0ustar jweusers/* readable.h: Is a file readable? Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_READABLE_H #define KPATHSEA_READABLE_H #include #include /* If NAME is readable and is a regular file, return it. If the error is ENAMETOOLONG, truncate any too-long path components, and if the result is a readable file, return that. Otherwise return NULL. */ extern string kpse_readable_file P1H(const_string name); #endif /* not KPATHSEA_READABLE_H */ octave-1.1.0/kpathsea/str-list.h100666 415 17 3361 5426532177 14707 0ustar jweusers/* str-list.h: Declarations for string lists. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_STR_LIST_H #define KPATHSEA_STR_LIST_H #include #include /* Lists of strings; used for, e.g., directory lists. */ typedef struct { unsigned length; string *list; } str_list_type; #define STR_LIST_LENGTH(l) ((l).length) #define STR_LIST(l) ((l).list) #define STR_LIST_ELT(l, n) STR_LIST (l)[n] #define STR_LIST_LAST_ELT(l) STR_LIST_ELT (l, STR_LIST_LENGTH (l) - 1) /* Return a new, empty, list. */ extern str_list_type str_list_init P1H(void); /* Save the string S in the list L. It's up to the caller to not deallocate S; we don't copy it. Also up to the caller to terminate the list with a null entry. */ extern void str_list_add P2H(str_list_type *l, string s); /* Append all the elements from MORE to TARGET. */ extern void str_list_concat P2H(str_list_type * target, str_list_type more); /* Free the space for the list elements (but not the list elements themselves). */ extern void str_list_free P1H(str_list_type *l); #endif /* not KPATHSEA_STR_LIST_H */ octave-1.1.0/kpathsea/str-llist.h100666 415 17 3572 5463304060 15054 0ustar jweusers/* str-llist.h: A linked list of strings, It's pretty disgusting that both this and str-list exist; the reason is that C cannot express iterators very well, and I don't want to change all the for loops right now. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef STR_LLIST_H #define STR_LLIST_H #include #include /* It's a little bizarre to be using the same type for the list and the elements of the list, but no reason not to in this case, I think -- we never need a NULL string in the middle of the list, and an extra NULL/NULL element always at the end is inconsequential. */ struct str_llist_elt { string str; boolean moved; struct str_llist_elt *next; }; typedef struct str_llist_elt str_llist_elt_type; typedef struct str_llist_elt *str_llist_type; #define STR_LLIST(sl) ((sl).str) #define STR_LLIST_MOVED(sl) ((sl).moved) #define STR_LLIST_NEXT(sl) ((sl).next) /* Add the new string E to the end of the list L. */ extern void str_llist_add P2H(str_llist_type * l, string e); /* Reorganize L so that E is below only other elements that have already been moved. Set `moved' member for E. */ extern void str_llist_float P2H(str_llist_type *l, str_llist_elt_type *e); #endif /* not STR_LLIST_H */ octave-1.1.0/kpathsea/systypes.h100666 415 17 2105 5400464121 15005 0ustar jweusers/* c-systypes.h: include . It's too bad we need this file, but some systems don't protect from multiple inclusions, and I'm not willing to put up with that. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef C_SYSTYPES_H #define C_SYSTYPES_H #include /* This is the symbol that X uses to determine if has been read, so we define it. */ #define __TYPES__ #endif /* not C_SYSTYPES_H */ octave-1.1.0/kpathsea/tex-file.h100666 415 17 13220 5540713052 14644 0ustar jweusers/* tex-file.h: declarations for all TeX font formats. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TEX_FILE_H #define KPATHSEA_TEX_FILE_H #include #include #include #include #include /* If non-NULL, try looking for this if can't find the real font. */ extern const_string kpse_fallback_font; /* If non-NULL, check these if can't find (within a few percent of) the given resolution. List must end with a zero element. */ extern unsigned *kpse_fallback_resolutions; /* This initializes the fallback resolution list. If ENVVAR is set, it is used; otherwise, the envvar `TEXSIZES' is looked at; if that's not set either, a compile-time default is used. */ extern void kpse_init_fallback_resolutions P1H(string envvar); /* If non-null, used instead of the usual envvar/path defaults, e.g., set to `getenv ("XDVIFONTS")'. */ extern string kpse_font_override_path; /* We put the glyphs first so we don't waste space in an array. A new format here should be accompanied by a new initialization abbreviation below and a new entry in `tex-make.c'. */ typedef enum { kpse_gf_format, kpse_pk_format, kpse_any_glyph_format, /* ``any'' meaning any of the above */ kpse_bib_format, kpse_bst_format, kpse_mf_format, kpse_tex_format, kpse_tfm_format, kpse_vf_format } kpse_file_format_type; /* Abbreviate what we're going to do a million times. */ #define KPSE_FONT_PATH(def, envs) (kpse_font_override_path \ ? kpse_expand_default (kpse_font_override_path, def) \ : kpse_init_path (NULL, def, envs, NULL)) #define KPSE_NONFONT_PATH(def, envs) kpse_init_path (NULL, def, envs, NULL) /* Do initialization for the various file formats. We separate the envvar lists so they can be used in other contexts with a different default, as in dvipsk (until we have config file support). */ #define KPSE_BASE_ENVS "MFBASES" #define KPSE_BASE_PATH() KPSE_NONFONT_PATH (DEFAULT_BASE_PATH, KPSE_BASE_ENVS) #define KPSE_BIB_ENVS "BIBINPUTS" #define KPSE_BIB_PATH() KPSE_NONFONT_PATH (DEFAULT_BIB_PATH, KPSE_BIB_ENVS) #define KPSE_BST_ENVS "BSTINPUTS", "TEXINPUTS" #define KPSE_BST_PATH() KPSE_NONFONT_PATH (DEFAULT_BST_PATH, KPSE_BST_ENVS) #define KPSE_FMT_ENVS "TEXFORMATS" #define KPSE_FMT_PATH() KPSE_NONFONT_PATH (DEFAULT_FMT_PATH, KPSE_FMT_ENVS) #define KPSE_GF_ENVS "GFFONTS", KPSE_GLYPH_ENVS #define KPSE_GF_PATH() KPSE_FONT_PATH (DEFAULT_GF_PATH, KPSE_GF_ENVS) #define KPSE_GLYPH_ENVS "GLYPHFONTS", "TEXFONTS" #define KPSE_GLYPH_PATH() KPSE_FONT_PATH (DEFAULT_GLYPH_PATH, KPSE_GLYPH_ENVS) #define KPSE_MF_ENVS "MFINPUTS" #define KPSE_MF_PATH() KPSE_NONFONT_PATH (DEFAULT_MF_PATH, KPSE_MF_ENVS) #define KPSE_MFPOOL_ENVS "MFPOOL" #define KPSE_MFPOOL_PATH() \ KPSE_NONFONT_PATH (DEFAULT_MFPOOL_PATH, KPSE_MFPOOL_ENVS) #define KPSE_PK_ENVS "PKFONTS", "TEXPKS", KPSE_GLYPH_ENVS #define KPSE_PK_PATH() KPSE_FONT_PATH (DEFAULT_PK_PATH, KPSE_PK_ENVS) #define KPSE_TEX_ENVS "TEXINPUTS" #define KPSE_TEX_PATH() KPSE_NONFONT_PATH (DEFAULT_TEX_PATH, KPSE_TEX_ENVS) #define KPSE_TEXPOOL_ENVS "TEXPOOL" #define KPSE_TEXPOOL_PATH() \ KPSE_NONFONT_PATH (DEFAULT_TEXPOOL_PATH, KPSE_TEXPOOL_ENVS) #define KPSE_TFM_ENVS "TFMFONTS", "TEXFONTS" #define KPSE_TFM_PATH() KPSE_FONT_PATH (DEFAULT_TFM_PATH, KPSE_TFM_ENVS) #define KPSE_VF_ENVS "VFFONTS", "TEXFONTS" #define KPSE_VF_PATH() KPSE_FONT_PATH (DEFAULT_VF_PATH, KPSE_VF_ENVS) /* This type describes a glyph font that we have found. Maybe it would work for all kinds of fonts, and other files. */ typedef enum { kpse_source_normal, /* the searched-for font: already existed */ kpse_source_alias, /* : was an alias for an existing file */ kpse_source_maketex, /* : was created on the fly */ kpse_source_fallback /* : wasn't found, but the fallback font was */ } kpse_source_type; typedef struct { string name; /* font name found */ unsigned dpi; /* size found, for glyphs */ kpse_file_format_type format; /* glyph format found */ kpse_source_type source; /* where we found it */ } kpse_font_file_type; #define KPSE_FONT_FILE_NAME(f) ((f).name) #define KPSE_FONT_FILE_DPI(f) ((f).dpi) #define KPSE_FONT_FILE_FORMAT(f) ((f).format) #define KPSE_FONT_FILE_SOURCE(f) ((f).source) /* Concatenate NAME "." EXT and call `kpse_path_search' with the result and the other arguments. */ extern string kpse_find_file P4H(const_string name, const_string ext, const_string path, boolean must_exist); /* Here are the file formats we actually look up like this, so far. We do call init_path every time, which is bad. The saving grace is that the actual filesystem lookups are only done once (if at all), because we cache the results (per path element). Still not very clean, though. xdvik uses kpse_find_vf, and dviljk uses kpse_find_tfm. */ #define kpse_find_tfm(name) kpse_find_file (name, "tfm", KPSE_TFM_PATH (),true) #define kpse_find_vf(name) kpse_find_file (name, "vf", KPSE_VF_PATH (), false) #endif /* not KPATHSEA_TEX_FILE_H */ octave-1.1.0/kpathsea/tex-glyph.h100666 415 17 3322 5533155501 15033 0ustar jweusers/* tex-glyph.h: look for a TeX glyph font (GF or PK). Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TEX_GLYPH_H #define KPATHSEA_TEX_GLYPH_H #include /* Search first for the font named FONT_NAME at resolution DPI in the glyph format FORMAT (see `try_size' for details of format searching). Then try resolutions within KPSE_BITMAP_TOLERANCE of DPI. Then try the resolutions in `kpse_fallback_sizes', then within the tolerance of each of those. Then if FONT_NAME is an alias defined in a texfonts.map do all the above for its real name. Then try the above for kpse_fallback_name. Then fail. Return either the filename found, or NULL. Also return information about the file found in *FONT_FILE. */ extern string kpse_find_glyph_format P4H(const_string font_name, unsigned dpi, kpse_file_format_type format, kpse_font_file_type *font_file); /* Look for PK files only. */ #define kpse_find_pk(font_name, dpi, font_file) \ kpse_find_glyph_format (font_name, dpi, kpse_pk_format, font_file) #endif /* not KPATHSEA_TEX_GLYPH_H */ octave-1.1.0/kpathsea/tex-make.h100666 415 17 4737 5533153464 14646 0ustar jweusers/* tex-make.h: declarations for executing external scripts. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TEX_MAKE_H #define KPATHSEA_TEX_MAKE_H #include #include #include typedef struct { boolean enabled; /* whether to run the program */ const_string program; /* executable name */ const_string args; /* additional args to pass */ } kpse_make_spec_type; #define KPSE_MAKE_SPEC_ENABLED(ms) ((ms).enabled) #define KPSE_MAKE_SPEC_PROGRAM(ms) ((ms).program) #define KPSE_MAKE_SPEC_ARGS(ms) ((ms).args) /* Indexed by `kpse_file_format_type', gives info for each file format. */ extern kpse_make_spec_type kpse_make_specs[]; /* Says whether to throw away stderr output from the MakeTeX... scripts, or let it be seen. */ extern boolean kpse_make_tex_discard_errors; /* Look for a file named by BASE_FILE in format FORMAT. If other information about the file is needed, it can be passed through environment variables. See the MakeTeXPK stuff in `tex-make.c' for an example. */ extern string kpse_make_tex P2H(kpse_file_format_type format, const_string base_file); /* Set the environment variable MAKETEX_MAG to the magstep string (suitable for assigning to Metafont's `mag' parameter) corresponding to a font loaded at DPI on a base resolution of BASE_DPI. */ extern void kpse_set_maketex_mag P2H(int dpi, int base_dpi); /* Defines how far away a pixel file can be found from its stated size. The DVI standard says any resolution within 0.2% of the stated size is ok, but we are more forgiving. */ #define KPSE_BITMAP_TOLERANCE(r) ((r) / 500.0 + 1) /* Check whether DPI2 is within KPSE_BITMAP_TOLERANCE of DPI1. */ extern boolean kpse_check_bitmap_tolerance P2H(double dpi1, double dpi2); #endif /* not KPATHSEA_TEX_MAKE_H */ octave-1.1.0/kpathsea/tilde.h100666 415 17 2051 5422313721 14206 0ustar jweusers/* tilde.h: Declare tilde expander. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TILDE_H #define KPATHSEA_TILDE_H #include #include /* Replace a leading ~ or ~name in FILENAME with getenv ("HOME") or name's home directory, respectively. FILENAME may not be null. */ extern string kpse_tilde_expand P1H(const_string filename); #endif /* not KPATHSEA_TILDE_H */ octave-1.1.0/kpathsea/types.h100666 415 17 2514 5405171752 14264 0ustar jweusers/* types.h: general types. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TYPES_H #define KPATHSEA_TYPES_H /* Booleans. */ typedef enum { false = 0, true = 1 } boolean; /* The X11 library defines `FALSE' and `TRUE', and so we only want to define them if necessary. */ #ifndef FALSE #define FALSE false #define TRUE true #endif /* FALSE */ /* The usual null-terminated string. */ typedef char *string; /* A pointer to constant data. (ANSI says `const string' is `char const *', which is a constant pointer, which is not what we typically want.) */ typedef const char *const_string; /* A generic pointer. */ typedef void *address; #endif /* not KPATHSEA_TYPES_H */ octave-1.1.0/kpathsea/truncate.h100666 415 17 2127 5405171745 14747 0ustar jweusers/* truncate.h: truncate too-long components in a filename. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_TRUNCATE_H #define KPATHSEA_TRUNCATE_H #include #include /* Truncate any component in NAME longer than the system NAME_MAX, and return the result as a malloced string. If none, return a copy of NAME. */ extern string kpse_truncate_filename P1H(const_string name); #endif /* not KPATHSEA_TRUNCATE_H */ octave-1.1.0/kpathsea/variable.h100666 415 17 2672 5422310540 14677 0ustar jweusers/* variable.h: Declare variable expander. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_VARIABLE_H #define KPATHSEA_VARIABLE_H #include #include /* Expand $VAR and ${VAR} references in SRC, returning the (always dynamically-allocated) result. An unterminated ${ or any other character following $ produce error messages, and that part of SRC is ignored. In the $VAR form, the variable name consists of consecutive letters, digits, and underscores. In the ${VAR} form, the variable name consists of whatever is between the braces. In any case, ``expansion'' just means calling `getenv'; if the variable is not set, the expansion is the empty string. */ extern string kpse_var_expand P1H(const_string src); #endif /* not KPATHSEA_VARIABLE_H */ octave-1.1.0/kpathsea/xstat.h100666 415 17 2246 5412343422 14256 0ustar jweusers/* xstat.h: stat with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef KPATHSEA_XSTAT_H #define KPATHSEA_XSTAT_H #include #include #include /* Does stat(2) on PATH, and aborts if the stat fails. */ extern struct stat xstat P1H(const_string path); /* Ditto, for lstat(2) (except that lstat might not exist). */ #ifdef S_ISLNK extern struct stat xlstat P1H(const_string path); #else #define xlstat xstat #endif #endif /* not KPATHSEA_XSTAT_H */ octave-1.1.0/kpathsea/absolute.c100666 415 17 3016 5523507727 14735 0ustar jweusers/* absolute.c: Test if a filename is absolute or explicitly relative. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #ifdef DOS #include /* For ISALPHA */ #endif /* DOS */ /* Sorry this is such a system-dependent mess, but I can't see any way to usefully generalize. */ boolean kpse_absolute_p P1C(string, filename) { #ifdef VMS #include return strcspn (filename, "]>:") != strlen (filename); #else /* not VMS */ boolean absolute = IS_DIR_SEP (*filename) #ifdef DOS || ISALPHA (*filename) && filename[1] == ':' #endif /* DOS */ ; boolean explicit_relative = (*filename == '.' && (IS_DIR_SEP (filename[1]) || (filename[1] == '.' && IS_DIR_SEP (filename[2])))); return absolute || explicit_relative; #endif /* not VMS */ } octave-1.1.0/kpathsea/concat.c100666 415 17 2113 5422071051 14343 0ustar jweusers/* concat.c: dynamic string concatenation. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* Return the concatenation of S1 and S2. See `concatn.c' for a `concatn', which takes a variable number of arguments. */ string concat P2C(const_string, s1, const_string, s2) { string answer = (string) xmalloc (strlen (s1) + strlen (s2) + 1); strcpy (answer, s1); strcat (answer, s2); return answer; } octave-1.1.0/kpathsea/concat3.c100666 415 17 2002 5405157220 14427 0ustar jweusers/* concat3.c: concatenate three strings. Copyright (C) 1992 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include string concat3 P3C(const_string, s1, const_string, s2, const_string, s3) { string answer = (string) xmalloc (strlen (s1) + strlen (s2) + strlen (s3) + 1); strcpy (answer, s1); strcat (answer, s2); strcat (answer, s3); return answer; } octave-1.1.0/kpathsea/concatn.c100666 415 17 3425 5422322074 14534 0ustar jweusers/* concatn.c: Concatenate an arbitrary number of strings. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* OK, it would be epsilon more efficient to compute the total length and then do the copying ourselves, but I doubt it matters in reality. */ string concatn PVAR1C(const_string, str1, ap) { string arg; string ret; if (!str1) return NULL; ret = xstrdup (str1); while ((arg = va_arg (ap, string)) != NULL) { ret = concat (ret, arg); } va_end (ap); return ret; }} #ifdef TEST int main () { printf ("null = \"%s\"\n", concatn (NULL)); printf ("\"a\" = \"%s\"\n", concatn ("a", NULL)); printf ("\"ab\" = \"%s\"\n", concatn ("a", "b", NULL)); printf ("\"abc\" = \"%s\"\n", concatn ("a", "b", "c", NULL)); printf ("\"abcd\" = \"%s\"\n", concatn ("ab", "cd", NULL)); printf ("\"abcde\" = \"%s\"\n", concatn ("ab", "c", "de", NULL)); printf ("\"abcdef\" = \"%s\"\n", concatn ("", "a", "", "bcd", "ef", NULL)); return 0; } #endif /* TEST */ /* Local variables: standalone-compile-command: "gcc -posix -g -I. -I.. -DTEST concatn.c kpathsea.a" End: */ octave-1.1.0/kpathsea/db.c100666 415 17 10563 5544327542 13527 0ustar jweusers/* db.c: an external database to avoid filesystem lookups. Copyright (C) 1994 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include #include #include #include /* If no DB_FILE, return false (maybe they aren't using this feature). Otherwise, build the db and return true. */ static boolean db_build P1C(hash_table_type *, table) { string line; string cur_dir = NULL; /* First thing in ls-R might be a filename. */ string db_filename = concat3 (DB_DIR, DIR_SEP_STRING, DB_NAME); FILE *db_file = fopen (db_filename, FOPEN_R_MODE); if (db_file) { while ((line = read_line (db_file)) != NULL) { unsigned len = strlen (line); if (line[0] == DIR_SEP && line[len - 1] == ':') /* /...: = new dir */ { cur_dir = xstrdup (line); cur_dir[len - 1] = DIR_SEP; } else if (line[0] != 0 && cur_dir) /* other nonblank line */ { /* New hash table entry with a key of `line' and a data of `cur_dir'. Already-existing identical keys are ok, since a file named `foo' can be in more than one directory. Since it doesn't hurt, share the directory name string among all the files in the directory. */ hash_insert (table, xstrdup (line), cur_dir); } /* else ignore blank lines */ free (line); } xfclose (db_file, db_filename); #ifdef DEBUG if (DEBUG_P (DEBUG_DB_BUILD)) hash_print (*table); #endif } free (db_filename); return db_file != NULL; } /* Return true if FILENAME could be in PATH_ELT, i.e., if the directory part of FILENAME matches PATH_ELT. Have to consider // wildcards, but $ and ~ expansion have already been done. */ static boolean match P2C(const_string, filename, const_string, path_elt) { return true; /* Punt for now. */ } /* Don't bother implementing a search path for the database itself, or multiple databases, until people ask. */ str_list_type * kpse_db_search P3C(const_string, name, const_string, path_elt, boolean, all) { static hash_table_type db; string *db_dirs, *orig_dirs; boolean done; str_list_type *ret; /* Hash up the database if this is the first call. */ if (db.size == 0) { db = hash_create (7603); /* What the heck, sparse is ok. */ if (!db_build (&db)) { /* If db can't be built, leave `size' alone (so we don't rebuild it), but clear `buckets' (so we don't look in it). */ free (db.buckets); db.buckets = NULL; } } /* If we failed to build the database, quit. */ if (db.buckets == NULL) return NULL; /* We have a db. Look up NAME. */ orig_dirs = db_dirs = hash_lookup (db, name); done = false; ret = XTALLOC1 (str_list_type); *ret = str_list_init (); /* For each filename found, see if it matches the path element. For example, if we have ../cx/cmr10.300pk and .../ricoh/cmr10.300pk, and the path looks like .../cx, we don't want the ricoh file. */ while (!done && db_dirs && *db_dirs) { string db_file = concat (*db_dirs, name); if (match (db_file, path_elt) && kpse_readable_file (db_file)) { str_list_add (ret, db_file); if (!all) done = true; } else free (db_file); /* On to the next directory, if any. */ db_dirs++; } /* This is just the space for the pointers, not the strings. */ if (orig_dirs && *orig_dirs) free (orig_dirs); return ret; } octave-1.1.0/kpathsea/debug.c100666 415 17 1520 5404746533 14201 0ustar jweusers/* debug.c: Define the external variable that says what we're debugging. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #ifdef DEBUG unsigned kpathsea_debug = 0; #endif /* DEBUG */ octave-1.1.0/kpathsea/default.c100666 415 17 6411 5427032367 14541 0ustar jweusers/* default.c: Expand extra colons. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include /* Check for leading colon first, then trailing, then doubled, since that is fastest. Usually it will be leading or trailing. */ string kpse_expand_default P2C(const_string, path, const_string, fallback) { unsigned path_length; string expansion; /* The default path better not be null. */ assert (fallback); if (path == NULL) expansion = (string) fallback; /* Solitary or leading :? */ else if (IS_ENV_SEP (*path)) { expansion = path[1] == 0 ? (string) fallback : concat (fallback, path); } /* Sorry about the assignment in the middle of the expression, but conventions were made to be flouted and all that. I don't see the point of calling strlen twice or complicating the logic just to avoid the assignment (especially now that I've pointed it out at such great length). */ else if (path[(path_length = strlen (path)) - 1] == ENV_SEP) expansion = concat (path, fallback); /* OK, not leading or trailing. Check for doubled. */ else { const_string loc; /* What we'll return if we find none. */ expansion = (string) path; for (loc = path; *loc && expansion == path; loc++) { if (IS_ENV_SEP (loc[0]) && IS_ENV_SEP (loc[1])) { /* We have a doubled colon. */ expansion = xmalloc (path_length + strlen (fallback) + 1); /* Copy stuff up to and including the first colon. */ strncpy (expansion, path, loc - path + 1); expansion[loc - path + 1] = 0; /* Copy in FALLBACK, and then the rest of PATH. */ strcat (expansion, fallback); strcat (expansion, loc + 1); } } } return expansion; } #ifdef TEST void test_expand_default (const_string path, const_string def) { string answer; printf ("Expansion of `%s':\t", path ? path : "(null)"); answer = kpse_expand_default (path, def); puts (answer); } int main () { string default_path = "default"; test_expand_default (NULL, default_path); test_expand_default ("", default_path); test_expand_default ("none", default_path); test_expand_default (":", default_path); test_expand_default (":first", default_path); test_expand_default ("last:", default_path); test_expand_default ("middle::elddim", default_path); return 0; } #endif /* TEST */ /* Local variables: standalone-compile-command: "gcc -g -I. -I.. -DTEST default.c kpathsea.a" End: */ octave-1.1.0/kpathsea/dir.c100666 415 17 2714 5412343422 13664 0ustar jweusers/* dir.c: directory operations. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include /* Return true if FN is a directory or a symlink to a directory, false if not. */ boolean dir_p P1C(const_string, fn) { struct stat stats; return stat (fn, &stats) == 0 && S_ISDIR (stats.st_mode); } /* Return -1 if FN isn't a directory, else its number of links. Duplicate the call to stat; no need to incur overhead of a function call for that much cleanliness. */ int dir_links P1C(const_string, fn) { int ret; struct stat stats; ret = stat (fn, &stats) == 0 && S_ISDIR (stats.st_mode) ? stats.st_nlink : -1; #ifdef DEBUG if (DEBUG_P (DEBUG_STAT)) printf ("dir_links (%s) => %d\n", fn, ret); #endif return ret; } octave-1.1.0/kpathsea/elt-dirs.c100666 415 17 24172 5533127040 14653 0ustar jweusers/* elt-dirs.c: Translate a path element to its corresponding director{y,ies}. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include /* To avoid giving prototypes for all the routines and then their real definitions, we give all the subroutines first. The entry point is the last routine in the file. */ /* Make a copy of DIR (unless it's null) and save it in L. Ensure that DIR ends with a DIR_SEP for the benefit of later searches. */ static void dir_list_add P2C(str_llist_type *, l, const_string, dir) { string saved_dir = IS_DIR_SEP (dir[strlen (dir) - 1]) ? xstrdup (dir) : concat (dir, DIR_SEP_STRING); str_llist_add (l, saved_dir); } /* If DIR is a directory, add it to the list L. */ static void checked_dir_list_add P2C(str_llist_type *, l, const_string, dir) { if (dir_p (dir)) dir_list_add (l, dir); } /* The cache. Typically, several paths have the same element; for example, /usr/local/lib/texmf/fonts//. We don't want to compute the expansion of such a thing more than once. */ typedef struct { const_string key; str_llist_type *value; } cache_entry; static cache_entry *the_cache = NULL; static unsigned cache_length = 0; /* Associate KEY with VALUE. We implement the cache as a simple linear list, since it's unlikely to ever be more than a dozen or so elements long. We don't bother to check here if PATH has already been saved; we always add it to our list. We copy KEY but not VALUE; not sure that's right, but it seems to be all that's needed. */ static void cache P2C(const_string, key, str_llist_type *, value) { cache_length++; XRETALLOC (the_cache, cache_length, cache_entry); the_cache[cache_length - 1].key = xstrdup (key); the_cache[cache_length - 1].value = value; } /* To retrieve, just check the list in order. */ static str_llist_type * cached P1C(const_string, key) { unsigned p; for (p = 0; p < cache_length; p++) { if (STREQ (the_cache[p].key, key)) return the_cache[p].value; } return NULL; } /* Handle the magic path constructs. */ /* Declare recursively called routine. */ static void expand_elt P3H(str_llist_type *, const_string, unsigned); /* POST is a pointer into the original element (which may no longer be ELT) to just after the doubled DIR_SEP, perhaps to the null. Append subdirectories of ELT (up to ELT_LENGTH, which must be a /) to STR_LIST_PTR. */ static void do_subdir P4C(str_llist_type *, str_list_ptr, const_string, elt, unsigned, elt_length, const_string, post) { DIR *dir; struct dirent *e; fn_type name; /* Some old compilers don't allow aggregate initialization. */ name = fn_copy0 (elt, elt_length); assert (IS_DIR_SEP (elt[elt_length - 1])); /* If we can't open it, quit. */ dir = opendir (FN_STRING (name)); if (dir == NULL) { fn_free (&name); return; } /* Include top-level directory before subdirectories. */ if (*post == 0) dir_list_add (str_list_ptr, FN_STRING (name)); while ((e = readdir (dir)) != NULL) { /* If it's . or .., never mind. */ if (!(e->d_name[0] == '.' && (e->d_name[1] == 0 || (e->d_name[1] == '.' && e->d_name[2] == 0)))) { int links; /* Construct the potential subdirectory name. */ fn_str_grow (&name, e->d_name); /* If we can't stat it, or if it isn't a directory, continue. */ links = dir_links (FN_STRING (name)); if (links >= 0) { unsigned potential_length = FN_LENGTH (name); /* It's a directory, so append the separator. */ fn_str_grow (&name, DIR_SEP_STRING); /* NAME is a subdirectory; recursively expand NAME + POST. */ if (*post != 0) { /* But if POST is exactly NAME, don't tack it on, just try it. If the path is /a//b, and there is an actual directory a/b, we want to find it. */ if (!STREQ (post, e->d_name)) fn_str_grow (&name, post); expand_elt (str_list_ptr, FN_STRING (name), potential_length); } /* Should we recurse? To see if the subdirectory is a leaf, check if it has two links (one for . and one for ..). This means that symbolic links to directories do not affect the leaf-ness. This is arguably wrong, but the only alternative I know of is to stat every entry in the directory, and that is unacceptably slow. The #ifdef here makes this configurable at compile-time, so that if we're using VMS directories or some such, we can still find subdirectories, even if it is much slower. */ #ifdef UNIX_ST_NLINK if (links > 2) #endif { /* All criteria are met; find subdirectories. */ do_subdir (str_list_ptr, FN_STRING (name), potential_length, post); } #ifdef UNIX_ST_NLINK else #endif if (*post == 0) /* Nothing more to match, no recursive subdirectories to look for: we're done with this branch. Add it. */ dir_list_add (str_list_ptr, FN_STRING (name)); } /* Remove the directory entry we just checked from `name'. */ fn_shrink_to (&name, elt_length); } } fn_free (&name); xclosedir (dir); } /* Assume ELT is non-empty and non-NULL. Return list of corresponding directories (with no terminating NULL entry) in STR_LIST_PTR. Start looking for magic constructs at START. */ static void expand_elt P3C(str_llist_type *, str_list_ptr, const_string, elt, unsigned, start) { boolean found_special = false; const_string dir = elt + start; while (*dir != 0) { if (IS_DIR_SEP (*dir)) { /* If two consecutive directory separators, find subdirectories. */ if (IS_DIR_SEP (dir[1])) { do_subdir (str_list_ptr, elt, dir - elt + 1, dir + 2); found_special = true; } #if 0 /* Maybe eventually I'll implement this. */ /* If /?, make following component optional. */ else if (dir[1] == '?') do_optional (str_list_ptr, elt, dir - elt + 1, dir + 2); #endif /* No special stuff at this slash. Keep going. */ } dir++; } if (!found_special) /* When we reach the end of ELT, it will be a normal filename. */ checked_dir_list_add (str_list_ptr, elt); } /* Here is the entry point. Returns directory list for ELT. */ str_llist_type * kpse_element_dirs P1C(const_string, elt) { str_llist_type *ret; /* If given nothing, return nothing. */ if (!elt) return NULL; /* If we've already cached the answer for ELT, return it. */ ret = cached (elt); if (ret) return ret; /* We're going to have a real directory list to return. */ ret = XTALLOC1 (str_llist_type); *ret = NULL; /* If ELT is the empty string, just return cwd. */ if (*elt == 0) { /* Some old compilers do not support aggregate initialization. */ char cwd[3]; cwd[0] = '.'; cwd[1] = DIR_SEP; cwd[2] = 0; checked_dir_list_add (ret, cwd); } /* OK, so much for the trivial cases. We handle the hard case in a subroutine. */ else { /* If the path starts with ~ or ~user, expand it. Do this before calling `expand_subdir' or `add_directory', so that we don't expand the same ~ over and over. */ string dir = kpse_expand (elt); expand_elt (ret, dir, 0); free (dir); } /* Remember the directory list we just found, in case future calls are made with the same ELT. */ cache (elt, ret); return ret; } #ifdef TEST void print_element_dirs (const_string elt) { str_llist_type *dirs; printf ("Directories of %s:\t", elt ? elt : "(null)"); fflush (stdout); dirs = kpse_element_dirs (elt); if (!dirs) printf ("(null)"); else { str_llist_elt_type *dir; for (dir = *dirs; dir; dir = STR_LLIST_NEXT (*dir)) { string d = STR_LLIST (*dir); printf ("%s ", *d ? d : "`'"); } } putchar ('\n'); } int main () { /* DEBUG_SET (DEBUG_STAT); */ /* All lists end with NULL. */ print_element_dirs (NULL); /* */ print_element_dirs (""); /* ./ */ print_element_dirs ("/k"); /* */ print_element_dirs (".//"); /* ./ ./archive/ */ print_element_dirs (".//archive"); /* ./ ./archive/ */ print_element_dirs ("/tmp/fonts//"); /* no need to stat anything */ print_element_dirs ("/usr/local/lib/tex/fonts//"); /* lots */ print_element_dirs ("/usr/local/lib/tex/fonts//times"); /* just one */ print_element_dirs ("/usr/local/lib/tex/fonts//"); /* lots again [cache] */ print_element_dirs ("~karl"); /* tilde expansion */ print_element_dirs ("$karl"); /* variable expansion */ print_element_dirs ("~${LOGNAME}"); /* both */ return 0; } #endif /* TEST */ /* Local variables: test-compile-command: "gcc -posix -g -I. -I.. -DTEST elt-dirs.c kpathsea.a" End: */ octave-1.1.0/kpathsea/expand.c100666 415 17 2504 5453073414 14370 0ustar jweusers/* expand.c: general expansion. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include /* Do variable expansion so ~${USER} will work. (Besides, it's what the shells do.) */ string kpse_expand P1C(const_string, s) { string var_expansion = kpse_var_expand (s); string tilde_expansion = kpse_tilde_expand (var_expansion); /* `kpse_var_expand' always gives us new memory; `kpse_tilde_expand' doesn't, necessarily. So be careful that we don't free what we are about to return. */ if (tilde_expansion != var_expansion) free (var_expansion); return tilde_expansion; } octave-1.1.0/kpathsea/extend-fname.c100666 415 17 2223 5405170142 15453 0ustar jweusers/* extend-fname.c: give a filename a suffix, if necessary. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* We may or may not return NAME. It's up to the caller not to assume the return value is modifiable. */ string extend_filename P2C(const_string, name, const_string, default_suffix) { string new_s; const_string suffix = find_suffix (name); new_s = suffix == NULL ? concat3 (name, ".", default_suffix) : (string) name; return new_s; } octave-1.1.0/kpathsea/file-p.c100666 415 17 2401 5412343422 14253 0ustar jweusers/* file-p.c: file predicates. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* Test whether FILENAME1 and FILENAME2 are actually the same file. If stat fails on either of the names, we return false, without error. */ boolean same_file_p P2C(const_string, filename1, const_string, filename2) { struct stat sb1, sb2; /* These are put in variables only so the results can be inspected under gdb. */ int r1 = stat (filename1, &sb1); int r2 = stat (filename2, &sb2); return r1 == 0 && r2 == 0 ? SAME_FILE_P (sb1, sb2) : false; } octave-1.1.0/kpathsea/find-suffix.c100666 415 17 2437 5425227152 15337 0ustar jweusers/* find-suffix.c: return the stuff after a dot. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* Return pointer to first character after `.' in last directory element of NAME. If the name is `foo' or `/foo.bar/baz', we have no extension. */ string find_suffix P1C(const_string, name) { const_string slash_pos; string dot_pos = strrchr (name, '.'); if (dot_pos == NULL) return NULL; for (slash_pos = name + strlen (name) + 1; slash_pos > dot_pos && !IS_DIR_SEP (*slash_pos); slash_pos--) ; return slash_pos > dot_pos ? NULL : dot_pos + 1; } octave-1.1.0/kpathsea/fn.c100666 415 17 5261 5524170547 13523 0ustar jweusers/* fn.c: arbitrarily long filenames (or just strings). Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* /usr/local/lib/texmf/fonts/public/cm/pk/ljfour/cmr10.300pk is 58 chars, so ASCII `K' seems a good choice. */ #define CHUNK_SIZE 75 fn_type fn_init P1H(void) { fn_type ret; FN_ALLOCATED (ret) = FN_LENGTH (ret) = 0; FN_STRING (ret) = NULL; return ret; } fn_type fn_copy0 P2C(const_string, s, unsigned, len) { fn_type ret; FN_ALLOCATED (ret) = CHUNK_SIZE > len ? CHUNK_SIZE : len + 1; FN_STRING (ret) = xmalloc (FN_ALLOCATED (ret)); strncpy (FN_STRING (ret), s, len); FN_STRING (ret)[len] = 0; FN_LENGTH (ret) = len + 1; return ret; } /* Don't think we ever try to free something that might usefully be empty, so give fatal error if nothing allocated. */ void fn_free P1C(fn_type *, f) { assert (FN_STRING (*f) != NULL); free (FN_STRING (*f)); FN_STRING (*f) = NULL; FN_ALLOCATED (*f) = 0; FN_LENGTH (*f) = 0; } /* An arithmetic increase seems more reasonable than geometric. We don't increase the length member since it may be more convenient for the caller to add than subtract when appending the stuff that will presumably follow. */ static void grow P2C(fn_type *, f, unsigned, len) { while (FN_LENGTH (*f) + len > FN_ALLOCATED (*f)) { FN_ALLOCATED (*f) += CHUNK_SIZE; XRETALLOC (FN_STRING (*f), FN_ALLOCATED (*f), char); } } void fn_1grow P2C(fn_type *, f, char, c) { grow (f, 1); FN_STRING (*f)[FN_LENGTH (*f)] = c; FN_LENGTH (*f)++; } void fn_grow P3C(fn_type *, f, address, source, unsigned, len) { grow (f, len); strncpy (FN_STRING (*f) + FN_LENGTH (*f), source, len); FN_LENGTH (*f) += len; } void fn_str_grow P2C(fn_type *, f, const_string, s) { unsigned more_len = strlen (s); grow (f, more_len); strcat (FN_STRING (*f), s); FN_LENGTH (*f) += more_len; } void fn_shrink_to P2C(fn_type *, f, unsigned, loc) { assert (FN_LENGTH (*f) > loc); FN_STRING (*f)[loc] = 0; FN_LENGTH (*f) = loc + 1; } octave-1.1.0/kpathsea/fontmap.c100666 415 17 7530 5535412720 14557 0ustar jweusers/* fontmap.c: read a file for additional font names. Copyright (C) 1993, 94 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include #include /* Look up KEY in MAP; if it's not found, remove any suffix from KEY and try again. */ string * map_lookup P2C(hash_table_type, map, const_string, key) { string suffix = find_suffix (key); string *ret = hash_lookup (map, key); if (!ret) { /* OK, the original KEY didn't work. Let's check for the KEY without an extension -- perhaps they gave foobar.tfm, but the mapping only defines `foobar'. */ if (suffix) { string base_key = remove_suffix (key); ret = hash_lookup (map, base_key); free (base_key); } } /* Append the original suffix, if we had one. */ if (ret && suffix) while (*ret) { *ret = extend_filename (*ret, suffix); ret++; } return ret; } /* Open and read the mapping file MAP_FILENAME, putting its entries into MAP. Comments begin with % and continue to the end of the line. Each line of the file defines an entry: the first word is the real filename (e.g., `ptmr'), the second word is the alias (e.g., `Times-Roman'), and any subsequent words are ignored. .tfm is added if either the filename or the alias have no extension. This is the same order as in Dvips' psfonts.map; unfortunately, we can't have TeX read that same file, since most of the real filenames start with an `r', because of the virtual fonts Dvips uses. */ static void map_file_parse P2C(hash_table_type *, map, const_string, map_filename) { extern FILE *xfopen (); /* In xfopen.c. */ char *l; unsigned map_lineno = 0; FILE *f = xfopen (map_filename, FOPEN_R_MODE); while ((l = read_line (f)) != NULL) { string filename; string comment_loc = strchr (l, '%'); map_lineno++; /* Ignore anything after a %. */ if (comment_loc) *comment_loc = 0; /* If we don't have any filename, that's ok, the line is blank. */ filename = strtok (l, " \t"); if (filename) { string alias = strtok (NULL, " \t"); /* But if we have a filename and no alias, something's wrong. */ if (alias == NULL || *alias == 0) fprintf (stderr, "%s:%u: Alias missing for filename `%s'.\n", map_filename, map_lineno, filename); else { /* We've got everything. Insert the new entry. */ hash_insert (map, xstrdup (alias), xstrdup (filename)); } } free (l); } xfclose (f, map_filename); } /* Search for all the MAP_NAME's in PATH. */ #define MAP_NAME "texfonts.map" hash_table_type map_create P1C(const_string, path) { string *filenames = kpse_all_path_search (path, MAP_NAME); hash_table_type map; /* some old compilers ... */ map = hash_create (751); while (*filenames) { map_file_parse (&map, *filenames); filenames++; } return map; } octave-1.1.0/kpathsea/gmalloc.c100666 415 17 110764 5520314211 14563 0ustar jweusers/* DO NOT EDIT THIS FILE -- it is automagically generated. -*- C -*- */ #define _MALLOC_INTERNAL /* The malloc headers and source files from the C library follow here. */ /* Declarations for `malloc' and friends. Copyright 1990, 1991, 1992, 1993 Free Software Foundation, Inc. Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_H #define _MALLOC_H 1 #ifdef _MALLOC_INTERNAL #ifdef HAVE_CONFIG_H #include #endif #if defined(_LIBC) || defined(STDC_HEADERS) || defined(USG) #include #else #ifndef memset #define memset(s, zero, n) bzero ((s), (n)) #endif #ifndef memcpy #define memcpy(d, s, n) bcopy ((s), (d), (n)) #endif #endif #if defined(__GNU_LIBRARY__) || defined(__STDC__) #include #else #define CHAR_BIT 8 #endif #endif /* _MALLOC_INTERNAL. */ #ifdef __cplusplus extern "C" { #endif #if defined (__cplusplus) || (defined (__STDC__) && __STDC__) #undef __P #define __P(args) args #undef __ptr_t #define __ptr_t void * #else /* Not C++ or ANSI C. */ #undef __P #define __P(args) () #undef const #define const #undef __ptr_t #define __ptr_t char * #endif /* C++ or ANSI C. */ #ifdef __STDC__ #include #else #undef size_t #define size_t unsigned int #undef ptrdiff_t #define ptrdiff_t int #endif #ifndef NULL #define NULL 0 #endif /* Allocate SIZE bytes of memory. */ extern __ptr_t malloc __P ((size_t __size)); /* Re-allocate the previously allocated block in __ptr_t, making the new block SIZE bytes long. */ extern __ptr_t realloc __P ((__ptr_t __ptr, size_t __size)); /* Allocate NMEMB elements of SIZE bytes each, all initialized to 0. */ extern __ptr_t calloc __P ((size_t __nmemb, size_t __size)); /* Free a block allocated by `malloc', `realloc' or `calloc'. */ extern void free __P ((__ptr_t __ptr)); /* Allocate SIZE bytes allocated to ALIGNMENT bytes. */ extern __ptr_t memalign __P ((size_t __alignment, size_t __size)); /* Allocate SIZE bytes on a page boundary. */ extern __ptr_t valloc __P ((size_t __size)); #ifdef _MALLOC_INTERNAL /* The allocator divides the heap into blocks of fixed size; large requests receive one or more whole blocks, and small requests receive a fragment of a block. Fragment sizes are powers of two, and all fragments of a block are the same size. When all the fragments in a block have been freed, the block itself is freed. */ #define INT_BIT (CHAR_BIT * sizeof(int)) #define BLOCKLOG (INT_BIT > 16 ? 12 : 9) #define BLOCKSIZE (1 << BLOCKLOG) #define BLOCKIFY(SIZE) (((SIZE) + BLOCKSIZE - 1) / BLOCKSIZE) /* Determine the amount of memory spanned by the initial heap table (not an absolute limit). */ #define HEAP (INT_BIT > 16 ? 4194304 : 65536) /* Number of contiguous free blocks allowed to build up at the end of memory before they will be returned to the system. */ #define FINAL_FREE_BLOCKS 8 /* Data structure giving per-block information. */ typedef union { /* Heap information for a busy block. */ struct { /* Zero for a large block, or positive giving the logarithm to the base two of the fragment size. */ int type; union { struct { size_t nfree; /* Free fragments in a fragmented block. */ size_t first; /* First free fragment of the block. */ } frag; /* Size (in blocks) of a large cluster. */ size_t size; } info; } busy; /* Heap information for a free block (that may be the first of a free cluster). */ struct { size_t size; /* Size (in blocks) of a free cluster. */ size_t next; /* Index of next free cluster. */ size_t prev; /* Index of previous free cluster. */ } free; } malloc_info; /* Pointer to first block of the heap. */ extern char *_heapbase; /* Table indexed by block number giving per-block information. */ extern malloc_info *_heapinfo; /* Address to block number and vice versa. */ #define BLOCK(A) (((char *) (A) - _heapbase) / BLOCKSIZE + 1) #define ADDRESS(B) ((__ptr_t) (((B) - 1) * BLOCKSIZE + _heapbase)) /* Current search index for the heap table. */ extern size_t _heapindex; /* Limit of valid info table indices. */ extern size_t _heaplimit; /* Doubly linked lists of free fragments. */ struct list { struct list *next; struct list *prev; }; /* Free list headers for each fragment size. */ extern struct list _fraghead[]; /* List of blocks allocated with `memalign' (or `valloc'). */ struct alignlist { struct alignlist *next; __ptr_t aligned; /* The address that memaligned returned. */ __ptr_t exact; /* The address that malloc returned. */ }; extern struct alignlist *_aligned_blocks; /* Instrumentation. */ extern size_t _chunks_used; extern size_t _bytes_used; extern size_t _chunks_free; extern size_t _bytes_free; /* Internal version of `free' used in `morecore' (malloc.c). */ extern void _free_internal __P ((__ptr_t __ptr)); #endif /* _MALLOC_INTERNAL. */ /* Underlying allocation function; successive calls should return contiguous pieces of memory. */ extern __ptr_t (*__morecore) __P ((ptrdiff_t __size)); /* Default value of `__morecore'. */ extern __ptr_t __default_morecore __P ((ptrdiff_t __size)); /* If not NULL, this function is called after each time `__morecore' is called to increase the data size. */ extern void (*__after_morecore_hook) __P ((void)); /* Nonzero if `malloc' has been called and done its initialization. */ extern int __malloc_initialized; /* Hooks for debugging versions. */ extern void (*__free_hook) __P ((__ptr_t __ptr)); extern __ptr_t (*__malloc_hook) __P ((size_t __size)); extern __ptr_t (*__realloc_hook) __P ((__ptr_t __ptr, size_t __size)); /* Activate a standard collection of debugging hooks. */ extern int mcheck __P ((void (*__func) __P ((void)))); /* Activate a standard collection of tracing hooks. */ extern void mtrace __P ((void)); /* Statistics available to the user. */ struct mstats { size_t bytes_total; /* Total size of the heap. */ size_t chunks_used; /* Chunks allocated by the user. */ size_t bytes_used; /* Byte total of user-allocated chunks. */ size_t chunks_free; /* Chunks in the free list. */ size_t bytes_free; /* Byte total of chunks in the free list. */ }; /* Pick up the current statistics. */ extern struct mstats mstats __P ((void)); /* Call WARNFUN with a warning message when memory usage is high. */ extern void memory_warnings __P ((__ptr_t __start, void (*__warnfun) __P ((const char *)))); /* Relocating allocator. */ /* Allocate SIZE bytes, and store the address in *HANDLEPTR. */ extern __ptr_t r_alloc __P ((__ptr_t *__handleptr, size_t __size)); /* Free the storage allocated in HANDLEPTR. */ extern void r_alloc_free __P ((__ptr_t *__handleptr)); /* Adjust the block at HANDLEPTR to be SIZE bytes long. */ extern __ptr_t r_re_alloc __P ((__ptr_t *__handleptr, size_t __size)); #ifdef __cplusplus } #endif #endif /* malloc.h */ /* Memory allocator `malloc'. Copyright 1990, 1991, 1992, 1993 Free Software Foundation Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* How to really get more memory. */ __ptr_t (*__morecore) __P ((ptrdiff_t __size)) = __default_morecore; /* Debugging hook for `malloc'. */ __ptr_t (*__malloc_hook) __P ((size_t __size)); /* Pointer to the base of the first block. */ char *_heapbase; /* Block information table. Allocated with align/__free (not malloc/free). */ malloc_info *_heapinfo; /* Number of info entries. */ static size_t heapsize; /* Search index in the info table. */ size_t _heapindex; /* Limit of valid info table indices. */ size_t _heaplimit; /* Free lists for each fragment size. */ struct list _fraghead[BLOCKLOG]; /* Instrumentation. */ size_t _chunks_used; size_t _bytes_used; size_t _chunks_free; size_t _bytes_free; /* Are you experienced? */ int __malloc_initialized; void (*__after_morecore_hook) __P ((void)); /* Aligned allocation. */ static __ptr_t align __P ((size_t)); static __ptr_t align (size) size_t size; { __ptr_t result; unsigned long int adj; result = (*__morecore) (size); adj = (unsigned long int) ((unsigned long int) ((char *) result - (char *) NULL)) % BLOCKSIZE; if (adj != 0) { adj = BLOCKSIZE - adj; (void) (*__morecore) (adj); result = (char *) result + adj; } if (__after_morecore_hook) (*__after_morecore_hook) (); return result; } /* Set everything up and remember that we have. */ static int initialize __P ((void)); static int initialize () { heapsize = HEAP / BLOCKSIZE; _heapinfo = (malloc_info *) align (heapsize * sizeof (malloc_info)); if (_heapinfo == NULL) return 0; memset (_heapinfo, 0, heapsize * sizeof (malloc_info)); _heapinfo[0].free.size = 0; _heapinfo[0].free.next = _heapinfo[0].free.prev = 0; _heapindex = 0; _heapbase = (char *) _heapinfo; __malloc_initialized = 1; return 1; } /* Get neatly aligned memory, initializing or growing the heap info table as necessary. */ static __ptr_t morecore __P ((size_t)); static __ptr_t morecore (size) size_t size; { __ptr_t result; malloc_info *newinfo, *oldinfo; size_t newsize; result = align (size); if (result == NULL) return NULL; /* Check if we need to grow the info table. */ if ((size_t) BLOCK ((char *) result + size) > heapsize) { newsize = heapsize; while ((size_t) BLOCK ((char *) result + size) > newsize) newsize *= 2; newinfo = (malloc_info *) align (newsize * sizeof (malloc_info)); if (newinfo == NULL) { (*__morecore) (-size); return NULL; } memset (newinfo, 0, newsize * sizeof (malloc_info)); memcpy (newinfo, _heapinfo, heapsize * sizeof (malloc_info)); oldinfo = _heapinfo; newinfo[BLOCK (oldinfo)].busy.type = 0; newinfo[BLOCK (oldinfo)].busy.info.size = BLOCKIFY (heapsize * sizeof (malloc_info)); _heapinfo = newinfo; _free_internal (oldinfo); heapsize = newsize; } _heaplimit = BLOCK ((char *) result + size); return result; } /* Allocate memory from the heap. */ __ptr_t malloc (size) size_t size; { __ptr_t result; size_t block, blocks, lastblocks, start; register size_t i; struct list *next; /* ANSI C allows `malloc (0)' to either return NULL, or to return a valid address you can realloc and free (though not dereference). It turns out that some extant code (sunrpc, at least Ultrix's version) expects `malloc (0)' to return non-NULL and breaks otherwise. Be compatible. */ #if 0 if (size == 0) return NULL; #endif if (__malloc_hook != NULL) return (*__malloc_hook) (size); if (!__malloc_initialized) if (!initialize ()) return NULL; if (size < sizeof (struct list)) size = sizeof (struct list); #ifdef SUNOS_LOCALTIME_BUG if (size < 16) size = 16; #endif /* Determine the allocation policy based on the request size. */ if (size <= BLOCKSIZE / 2) { /* Small allocation to receive a fragment of a block. Determine the logarithm to base two of the fragment size. */ register size_t log = 1; --size; while ((size /= 2) != 0) ++log; /* Look in the fragment lists for a free fragment of the desired size. */ next = _fraghead[log].next; if (next != NULL) { /* There are free fragments of this size. Pop a fragment out of the fragment list and return it. Update the block's nfree and first counters. */ result = (__ptr_t) next; next->prev->next = next->next; if (next->next != NULL) next->next->prev = next->prev; block = BLOCK (result); if (--_heapinfo[block].busy.info.frag.nfree != 0) _heapinfo[block].busy.info.frag.first = (unsigned long int) ((unsigned long int) ((char *) next->next - (char *) NULL) % BLOCKSIZE) >> log; /* Update the statistics. */ ++_chunks_used; _bytes_used += 1 << log; --_chunks_free; _bytes_free -= 1 << log; } else { /* No free fragments of the desired size, so get a new block and break it into fragments, returning the first. */ result = malloc (BLOCKSIZE); if (result == NULL) return NULL; /* Link all fragments but the first into the free list. */ for (i = 1; i < (size_t) (BLOCKSIZE >> log); ++i) { next = (struct list *) ((char *) result + (i << log)); next->next = _fraghead[log].next; next->prev = &_fraghead[log]; next->prev->next = next; if (next->next != NULL) next->next->prev = next; } /* Initialize the nfree and first counters for this block. */ block = BLOCK (result); _heapinfo[block].busy.type = log; _heapinfo[block].busy.info.frag.nfree = i - 1; _heapinfo[block].busy.info.frag.first = i - 1; _chunks_free += (BLOCKSIZE >> log) - 1; _bytes_free += BLOCKSIZE - (1 << log); _bytes_used -= BLOCKSIZE - (1 << log); } } else { /* Large allocation to receive one or more blocks. Search the free list in a circle starting at the last place visited. If we loop completely around without finding a large enough space we will have to get more memory from the system. */ blocks = BLOCKIFY (size); start = block = _heapindex; while (_heapinfo[block].free.size < blocks) { block = _heapinfo[block].free.next; if (block == start) { /* Need to get more from the system. Check to see if the new core will be contiguous with the final free block; if so we don't need to get as much. */ block = _heapinfo[0].free.prev; lastblocks = _heapinfo[block].free.size; if (_heaplimit != 0 && block + lastblocks == _heaplimit && (*__morecore) (0) == ADDRESS (block + lastblocks) && (morecore ((blocks - lastblocks) * BLOCKSIZE)) != NULL) { /* Which block we are extending (the `final free block' referred to above) might have changed, if it got combined with a freed info table. */ block = _heapinfo[0].free.prev; _heapinfo[block].free.size += (blocks - lastblocks); _bytes_free += (blocks - lastblocks) * BLOCKSIZE; continue; } result = morecore (blocks * BLOCKSIZE); if (result == NULL) return NULL; block = BLOCK (result); _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = blocks; ++_chunks_used; _bytes_used += blocks * BLOCKSIZE; return result; } } /* At this point we have found a suitable free list entry. Figure out how to remove what we need from the list. */ result = ADDRESS (block); if (_heapinfo[block].free.size > blocks) { /* The block we found has a bit left over, so relink the tail end back into the free list. */ _heapinfo[block + blocks].free.size = _heapinfo[block].free.size - blocks; _heapinfo[block + blocks].free.next = _heapinfo[block].free.next; _heapinfo[block + blocks].free.prev = _heapinfo[block].free.prev; _heapinfo[_heapinfo[block].free.prev].free.next = _heapinfo[_heapinfo[block].free.next].free.prev = _heapindex = block + blocks; } else { /* The block exactly matches our requirements, so just remove it from the list. */ _heapinfo[_heapinfo[block].free.next].free.prev = _heapinfo[block].free.prev; _heapinfo[_heapinfo[block].free.prev].free.next = _heapindex = _heapinfo[block].free.next; --_chunks_free; } _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = blocks; ++_chunks_used; _bytes_used += blocks * BLOCKSIZE; _bytes_free -= blocks * BLOCKSIZE; } return result; } #ifndef _LIBC /* On some ANSI C systems, some libc functions call _malloc, _free and _realloc. Make them use the GNU functions. */ __ptr_t _malloc (size) size_t size; { return malloc (size); } void _free (ptr) __ptr_t ptr; { free (ptr); } __ptr_t _realloc (ptr, size) __ptr_t ptr; size_t size; { return realloc (ptr, size); } #endif /* Free a block of memory allocated by `malloc'. Copyright 1990, 1991, 1992 Free Software Foundation Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* Debugging hook for free. */ void (*__free_hook) __P ((__ptr_t __ptr)); /* List of blocks allocated by memalign. */ struct alignlist *_aligned_blocks = NULL; /* Return memory to the heap. Like `free' but don't call a __free_hook if there is one. */ void _free_internal (ptr) __ptr_t ptr; { int type; size_t block, blocks; register size_t i; struct list *prev, *next; block = BLOCK (ptr); type = _heapinfo[block].busy.type; switch (type) { case 0: /* Get as many statistics as early as we can. */ --_chunks_used; _bytes_used -= _heapinfo[block].busy.info.size * BLOCKSIZE; _bytes_free += _heapinfo[block].busy.info.size * BLOCKSIZE; /* Find the free cluster previous to this one in the free list. Start searching at the last block referenced; this may benefit programs with locality of allocation. */ i = _heapindex; if (i > block) while (i > block) i = _heapinfo[i].free.prev; else { do i = _heapinfo[i].free.next; while (i > 0 && i < block); i = _heapinfo[i].free.prev; } /* Determine how to link this block into the free list. */ if (block == i + _heapinfo[i].free.size) { /* Coalesce this block with its predecessor. */ _heapinfo[i].free.size += _heapinfo[block].busy.info.size; block = i; } else { /* Really link this block back into the free list. */ _heapinfo[block].free.size = _heapinfo[block].busy.info.size; _heapinfo[block].free.next = _heapinfo[i].free.next; _heapinfo[block].free.prev = i; _heapinfo[i].free.next = block; _heapinfo[_heapinfo[block].free.next].free.prev = block; ++_chunks_free; } /* Now that the block is linked in, see if we can coalesce it with its successor (by deleting its successor from the list and adding in its size). */ if (block + _heapinfo[block].free.size == _heapinfo[block].free.next) { _heapinfo[block].free.size += _heapinfo[_heapinfo[block].free.next].free.size; _heapinfo[block].free.next = _heapinfo[_heapinfo[block].free.next].free.next; _heapinfo[_heapinfo[block].free.next].free.prev = block; --_chunks_free; } /* Now see if we can return stuff to the system. */ blocks = _heapinfo[block].free.size; if (blocks >= FINAL_FREE_BLOCKS && block + blocks == _heaplimit && (*__morecore) (0) == ADDRESS (block + blocks)) { register size_t bytes = blocks * BLOCKSIZE; _heaplimit -= blocks; (*__morecore) (-bytes); _heapinfo[_heapinfo[block].free.prev].free.next = _heapinfo[block].free.next; _heapinfo[_heapinfo[block].free.next].free.prev = _heapinfo[block].free.prev; block = _heapinfo[block].free.prev; --_chunks_free; _bytes_free -= bytes; } /* Set the next search to begin at this block. */ _heapindex = block; break; default: /* Do some of the statistics. */ --_chunks_used; _bytes_used -= 1 << type; ++_chunks_free; _bytes_free += 1 << type; /* Get the address of the first free fragment in this block. */ prev = (struct list *) ((char *) ADDRESS (block) + (_heapinfo[block].busy.info.frag.first << type)); if (_heapinfo[block].busy.info.frag.nfree == (BLOCKSIZE >> type) - 1) { /* If all fragments of this block are free, remove them from the fragment list and free the whole block. */ next = prev; for (i = 1; i < (size_t) (BLOCKSIZE >> type); ++i) next = next->next; prev->prev->next = next; if (next != NULL) next->prev = prev->prev; _heapinfo[block].busy.type = 0; _heapinfo[block].busy.info.size = 1; /* Keep the statistics accurate. */ ++_chunks_used; _bytes_used += BLOCKSIZE; _chunks_free -= BLOCKSIZE >> type; _bytes_free -= BLOCKSIZE; free (ADDRESS (block)); } else if (_heapinfo[block].busy.info.frag.nfree != 0) { /* If some fragments of this block are free, link this fragment into the fragment list after the first free fragment of this block. */ next = (struct list *) ptr; next->next = prev->next; next->prev = prev; prev->next = next; if (next->next != NULL) next->next->prev = next; ++_heapinfo[block].busy.info.frag.nfree; } else { /* No fragments of this block are free, so link this fragment into the fragment list and announce that it is the first free fragment of this block. */ prev = (struct list *) ptr; _heapinfo[block].busy.info.frag.nfree = 1; _heapinfo[block].busy.info.frag.first = (unsigned long int) ((unsigned long int) ((char *) ptr - (char *) NULL) % BLOCKSIZE >> type); prev->next = _fraghead[type].next; prev->prev = &_fraghead[type]; prev->prev->next = prev; if (prev->next != NULL) prev->next->prev = prev; } break; } } /* Return memory to the heap. */ void free (ptr) __ptr_t ptr; { register struct alignlist *l; if (ptr == NULL) return; for (l = _aligned_blocks; l != NULL; l = l->next) if (l->aligned == ptr) { l->aligned = NULL; /* Mark the slot in the list as free. */ ptr = l->exact; break; } if (__free_hook != NULL) (*__free_hook) (ptr); else _free_internal (ptr); } /* Copyright (C) 1991, 1993 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. The GNU C 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with the GNU C Library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #undef cfree #ifdef _LIBC #include #include function_alias(cfree, free, void, (ptr), DEFUN(cfree, (ptr), PTR ptr)) #else void cfree (ptr) __ptr_t ptr; { free (ptr); } #endif /* Change the size of a block allocated by `malloc'. Copyright 1990, 1991, 1992, 1993 Free Software Foundation, Inc. Written May 1989 by Mike Haertel. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #if !(defined (_LIBC) || defined (HAVE_MEMMOVE)) /* Snarfed directly from Emacs src/dispnew.c: XXX Should use system bcopy if it handles overlap. */ #ifndef emacs /* Like bcopy except never gets confused by overlap. */ static void safe_bcopy (from, to, size) char *from, *to; int size; { if (size <= 0 || from == to) return; /* If the source and destination don't overlap, then bcopy can handle it. If they do overlap, but the destination is lower in memory than the source, we'll assume bcopy can handle that. */ if (to < from || from + size <= to) bcopy (from, to, size); /* Otherwise, we'll copy from the end. */ else { register char *endf = from + size; register char *endt = to + size; /* If TO - FROM is large, then we should break the copy into nonoverlapping chunks of TO - FROM bytes each. However, if TO - FROM is small, then the bcopy function call overhead makes this not worth it. The crossover point could be about anywhere. Since I don't think the obvious copy loop is too bad, I'm trying to err in its favor. */ if (to - from < 64) { do *--endt = *--endf; while (endf != from); } else { for (;;) { endt -= (to - from); endf -= (to - from); if (endt < to) break; bcopy (endf, endt, to - from); } /* If SIZE wasn't a multiple of TO - FROM, there will be a little left over. The amount left over is (endt + (to - from)) - to, which is endt - from. */ bcopy (from, to, endt - from); } } } #endif /* Not emacs. */ #define memmove(to, from, size) safe_bcopy ((from), (to), (size)) #endif #define min(A, B) ((A) < (B) ? (A) : (B)) /* Debugging hook for realloc. */ __ptr_t (*__realloc_hook) __P ((__ptr_t __ptr, size_t __size)); /* Resize the given region to the new size, returning a pointer to the (possibly moved) region. This is optimized for speed; some benchmarks seem to indicate that greater compactness is achieved by unconditionally allocating and copying to a new region. This module has incestuous knowledge of the internals of both free and malloc. */ __ptr_t realloc (ptr, size) __ptr_t ptr; size_t size; { __ptr_t result; int type; size_t block, blocks, oldlimit; if (size == 0) { free (ptr); return malloc (0); } else if (ptr == NULL) return malloc (size); if (__realloc_hook != NULL) return (*__realloc_hook) (ptr, size); block = BLOCK (ptr); type = _heapinfo[block].busy.type; switch (type) { case 0: /* Maybe reallocate a large block to a small fragment. */ if (size <= BLOCKSIZE / 2) { result = malloc (size); if (result != NULL) { memcpy (result, ptr, size); _free_internal (ptr); return result; } } /* The new size is a large allocation as well; see if we can hold it in place. */ blocks = BLOCKIFY (size); if (blocks < _heapinfo[block].busy.info.size) { /* The new size is smaller; return excess memory to the free list. */ _heapinfo[block + blocks].busy.type = 0; _heapinfo[block + blocks].busy.info.size = _heapinfo[block].busy.info.size - blocks; _heapinfo[block].busy.info.size = blocks; _free_internal (ADDRESS (block + blocks)); result = ptr; } else if (blocks == _heapinfo[block].busy.info.size) /* No size change necessary. */ result = ptr; else { /* Won't fit, so allocate a new region that will. Free the old region first in case there is sufficient adjacent free space to grow without moving. */ blocks = _heapinfo[block].busy.info.size; /* Prevent free from actually returning memory to the system. */ oldlimit = _heaplimit; _heaplimit = 0; _free_internal (ptr); _heaplimit = oldlimit; result = malloc (size); if (result == NULL) { /* Now we're really in trouble. We have to unfree the thing we just freed. Unfortunately it might have been coalesced with its neighbors. */ if (_heapindex == block) (void) malloc (blocks * BLOCKSIZE); else { __ptr_t previous = malloc ((block - _heapindex) * BLOCKSIZE); (void) malloc (blocks * BLOCKSIZE); _free_internal (previous); } return NULL; } if (ptr != result) memmove (result, ptr, blocks * BLOCKSIZE); } break; default: /* Old size is a fragment; type is logarithm to base two of the fragment size. */ if (size > (size_t) (1 << (type - 1)) && size <= (size_t) (1 << type)) /* The new size is the same kind of fragment. */ result = ptr; else { /* The new size is different; allocate a new space, and copy the lesser of the new size and the old. */ result = malloc (size); if (result == NULL) return NULL; memcpy (result, ptr, min (size, (size_t) 1 << type)); free (ptr); } break; } return result; } /* Copyright (C) 1991, 1992 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif /* Allocate an array of NMEMB elements each SIZE bytes long. The entire array is initialized to zeros. */ __ptr_t calloc (nmemb, size) register size_t nmemb; register size_t size; { register __ptr_t result = malloc (nmemb * size); if (result != NULL) (void) memset (result, 0, nmemb * size); return result; } /* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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, or (at your option) any later version. The GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif #ifndef __GNU_LIBRARY__ #define __sbrk sbrk #endif #ifdef __GNU_LIBRARY__ /* It is best not to declare this and cast its result on foreign operating systems with potentially hostile include files. */ extern __ptr_t __sbrk __P ((int increment)); #else #if defined (HPUX8) || defined (HAVE_UNISTD_H) #include #endif #endif #ifndef NULL #define NULL 0 #endif /* Allocate INCREMENT more bytes of data space, and return the start of data space, or NULL on errors. If INCREMENT is negative, shrink data space. */ __ptr_t __default_morecore (increment) ptrdiff_t increment; { __ptr_t result = (__ptr_t) __sbrk ((int) increment); if (result == (__ptr_t) -1) return NULL; return result; } /* Copyright (C) 1991, 1992 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif __ptr_t memalign (alignment, size) size_t alignment; size_t size; { __ptr_t result; unsigned long int adj; size = ((size + alignment - 1) / alignment) * alignment; result = malloc (size); if (result == NULL) return NULL; adj = (unsigned long int) ((unsigned long int) ((char *) result - (char *) NULL)) % alignment; if (adj != 0) { struct alignlist *l; for (l = _aligned_blocks; l != NULL; l = l->next) if (l->aligned == NULL) /* This slot is free. Use it. */ break; if (l == NULL) { l = (struct alignlist *) malloc (sizeof (struct alignlist)); if (l == NULL) { free (result); return NULL; } } l->exact = result; result = l->aligned = (char *) result + alignment - adj; l->next = _aligned_blocks; _aligned_blocks = l; } return result; } /* Allocate memory on a page boundary. Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This 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 Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. The author may be reached (Email) at the address mike@ai.mit.edu, or (US mail) as Mike Haertel c/o Free Software Foundation. */ #if defined (__GNU_LIBRARY__) || defined (_LIBC) #include #include extern size_t __getpagesize __P ((void)); #else #include "getpagesize.h" #define __getpagesize() getpagesize() #endif #ifndef _MALLOC_INTERNAL #define _MALLOC_INTERNAL #include #endif static size_t pagesize; __ptr_t valloc (size) size_t size; { if (pagesize == 0) pagesize = __getpagesize (); return memalign (pagesize, size); } octave-1.1.0/kpathsea/hash.c100666 415 17 7212 5540636605 14041 0ustar jweusers/* hash.c: hash table operations. Copyright (C) 1994 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include /* The hash function. We go for simplicity here. */ static unsigned hash P2C(hash_table_type, table, const_string, key) { unsigned n = 0; /* Our keys aren't often anagrams of each other, so no point in weighting the characters. */ while (*key != 0) n = (n + n + *key++) % table.size; return n; } hash_table_type hash_create P1C(unsigned, size) { unsigned b; hash_table_type ret; ret.buckets = XTALLOC (size, hash_element_type *); ret.size = size; /* calloc's zeroes aren't necessarily NULL, according to ANSI, so be safe. (Not that I know of any exceptions in reality.) */ for (b = 0; b buckets[n]; table->buckets[n] = XTALLOC1 (hash_element_type); table->buckets[n]->key = key; table->buckets[n]->value = value; table->buckets[n]->next = head; } /* Look up STR in MAP. Return a (dynamically-allocated) list of the corresponding strings or NULL if no match. */ string * hash_lookup P2C(hash_table_type, table, const_string, key) { hash_element_type *p; str_list_type ret; unsigned n = hash (table, key); ret = str_list_init (); /* Look at everything in this bucket. */ for (p = table.buckets[n]; p != NULL; p = p->next) if (STREQ (key, p->key)) /* Cast because the general str_list_type shouldn't force const data. */ str_list_add (&ret, (string) p->value); /* If we found anything, mark end of list with null. */ if (STR_LIST (ret)) str_list_add (&ret, NULL); return STR_LIST (ret); } /* We only print nonempty buckets, to decrease output volume. */ void hash_print P1C(hash_table_type, table) { unsigned b; unsigned total_elements = 0, total_buckets = 0; for (b = 0; b < table.size; b++) { hash_element_type *bucket = table.buckets[b]; if (bucket) { unsigned len = 1; hash_element_type *tb; total_buckets++; printf ("%4d ", b); for (tb = bucket->next; tb != NULL; tb = tb->next) len++; printf (":%-5d", len); total_elements += len; for (tb = bucket; tb != NULL; tb = tb->next) printf (" %s=>%s", tb->key, tb->value); putchar ('\n'); } } printf ("%u buckets, %u nonempty (%u%%); %u entries, average chain %.1f.\n", table.size, total_buckets, 100 * total_buckets / table.size, total_elements, total_buckets ? total_elements / (double) total_buckets : 0.0); } octave-1.1.0/kpathsea/init-path.c100666 415 17 3344 5533153466 15016 0ustar jweusers/* init-path.c: Find how to initialize a path. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include /* See init-path.h. */ string kpse_init_path PVAR2C(const_string, current, const_string, default_path, ap) { string env_name; string ret; string env_path = NULL; /* First envvar that's set will exit the loop. */ while (!env_path && (env_name = va_arg (ap, string)) != NULL) { env_path = getenv (env_name); } va_end (ap); /* Expand extra colons. */ ret = kpse_expand_default (env_path ? env_path : current, default_path); return ret; }} #ifdef TEST int main () { printf ("null = \"%s\"\n", kpse_init_path (false, "def", NULL)); printf ("TEXFONTS" = \"%s\"\n", kpse_init_path (false, "def", "TEXFONTS", NULL)); printf ("GLYPHFONTS" = \"%s\"\n", kpse_init_path ("false, def", "GLYPHFONTS", "TEXFONTS", NULL)); return 0; } #endif /* TEST */ /* Local variables: compile-command: "gcc -posix -g -I. -I.. -DTEST init-path.c kpathsea.a" End: */ octave-1.1.0/kpathsea/itoa.c100666 415 17 1530 5426532177 14051 0ustar jweusers/* itoa.c: convert an int to a string. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include string itoa P1C(int, i) { char a[MAX_INT_LENGTH]; sprintf (a, "%d", i); return xstrdup (a); } octave-1.1.0/kpathsea/line.c100666 415 17 4034 5462025236 14037 0ustar jweusers/* line.c: return the next line from a file, or NULL. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Don't include config.h or all our other usual includes, since it's useful to just throw this file into other programs. */ #include extern void free (); /* From xmalloc.c and xrealloc.c. This saves having to include config.h. */ extern void *xmalloc (), *xrealloc (); /* Allocate in increments of this size. */ #define BLOCK_SIZE 40 char * read_line (f) FILE *f; { int c; unsigned limit = BLOCK_SIZE; unsigned loc = 0; char *line = xmalloc (limit); while ((c = getc (f)) != EOF && c != '\n') { line[loc] = c; loc++; /* By testing after the assignment, we guarantee that we'll always have space for the null we append below. We know we always have room for the first char, since we start with BLOCK_SIZE. */ if (loc == limit) { limit += BLOCK_SIZE; line = xrealloc (line, limit); } } /* If we read anything, return it. This can't represent a last ``line'' which doesn't end in a newline, but so what. */ if (c != EOF) { /* Terminate the string. We can't represent nulls in the file, either. Again, it doesn't matter. */ line[loc] = 0; } else /* At end of file. */ { free (line); line = NULL; } return line; } octave-1.1.0/kpathsea/make-suffix.c100666 415 17 2631 5455050350 15325 0ustar jweusers/* make_suffix.c: unconditionally add a filename suffix. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* Return a new string: S suffixed with SUFFIX, regardless of what it was before. This returns a newly allocated string. */ string make_suffix P2C(const_string, s, const_string, suffix) { string new_s; const_string dot_pos = strrchr (s, '.'); const_string slash_pos = strrchr (s, '/'); if (dot_pos == NULL || dot_pos < slash_pos) new_s = concat3 (s, ".", suffix); else { unsigned past_dot_index = dot_pos + 1 - s; new_s = (string) xmalloc (past_dot_index + strlen (suffix) + 1); strncpy (new_s, s, dot_pos + 1 - s); strcpy (new_s + past_dot_index, suffix); } return new_s; } octave-1.1.0/kpathsea/path-elt.c100666 415 17 6470 5407425256 14641 0ustar jweusers/* path-elt.c: Return the stuff between colons. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include /* The static (but dynamically allocated) area we return the answer in, and how much we've currently allocated for it. */ static string elt = NULL; static unsigned elt_alloc = 0; /* The path we're currently working on. */ static const_string path = NULL; /* Upon entry, the static `path' is at the first (and perhaps last) character of the return value, or else NULL if we're at the end (or haven't been called). I make no provision for caching the results; thus, we parse the same path over and over, on every lookup. If that turns out to be a significant lose, it can be fixed, but I'm guessing disk accesses overwhelm everything else. */ string kpse_path_element P1C(const_string, passed_path) { const_string p; string ret; if (passed_path) path = passed_path; /* Check if called with NULL, and no previous path (perhaps we reached the end). */ else if (!path) return NULL; /* OK, we have a non-null `path' if we get here. */ assert (path); p = path; /* Find the next colon (or the end of the path). */ while (*p != 0 && !IS_ENV_SEP (*p)) p++; /* If there were no separators, return the whole thing this time, and return NULL next time. */ if (*p == 0) { ret = (string) path; path = NULL; } /* Otherwise, return the substring starting at `path'. */ else { unsigned len = p - path; /* Make sure we have enough space (including the null byte). */ if (len + 1 > elt_alloc) { elt_alloc = len + 1; elt = xrealloc (elt, elt_alloc); } strncpy (elt, path, len); elt[len] = 0; ret = elt; path += len + 1; } return ret; } #ifdef TEST void print_path_elements (const_string path) { string elt; printf ("Elements of `%s':", path ? path : "(null)"); for (elt = kpse_path_element (path); elt != NULL; elt = kpse_path_element (NULL)) { printf (" %s", *elt ? elt : "`'"); } puts ("."); } int main () { /* All lists end with NULL. */ print_path_elements (NULL); /* */ print_path_elements (""); /* "" */ print_path_elements ("a"); /* a */ print_path_elements (":"); /* "", "" */ print_path_elements ("::"); /* "", "", "" */ print_path_elements ("a:"); /* a, "" */ print_path_elements (":b"); /* "", b */ print_path_elements ("a:b"); /* a, b */ return 0; } #endif /* TEST */ /* Local variables: standalone-compile-command: "gcc -g -I. -I.. -DTEST path-elt.c kpathsea.a" End: */ octave-1.1.0/kpathsea/pathsearch.c100666 415 17 23537 5544327542 15271 0ustar jweusers/* pathsearch.c: look up a filename in a path. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include #include /* Concatenate each element in DIRS with NAME (assume each ends with a /, to save time). If SEARCH_ALL is false, return the first readable regular file. Else continue to search for more. In any case, if none, return a list containing just NULL. We keep a single buffer for the potential filenames and reallocate only when necessary. I'm not sure it's noticeably faster, but it does seem cleaner. (We do waste a bit of space in the return value, though, since we don't shrink it to the final size returned.) */ #define INIT_ALLOC 75 /* Doesn't much matter what this number is. */ static str_list_type dir_list_search P3C(str_llist_type *, dirs, const_string, name, boolean, search_all) { str_llist_elt_type *elt; str_list_type ret; unsigned name_len = strlen (name); unsigned allocated = INIT_ALLOC; string potential = xmalloc (allocated); ret = str_list_init (); for (elt = *dirs; elt; elt = STR_LLIST_NEXT (*elt)) { const_string dir = STR_LLIST (*elt); unsigned dir_len = strlen (dir); while (dir_len + name_len + 1 > allocated) { allocated += allocated; XRETALLOC (potential, allocated, char); } strcpy (potential, dir); strcat (potential, name); if (kpse_readable_file (potential)) { str_list_add (&ret, potential); /* Move this element towards the top of the list. */ str_llist_float (dirs, elt); /* If caller only wanted one file returned, no need to terminate the list with NULL; the caller knows to only look at the first element. */ if (!search_all) return ret; /* Start new filename. */ allocated = INIT_ALLOC; potential = xmalloc (allocated); } } /* If we get here, either we didn't find any files, or we were finding all the files. But we're done with the last filename, anyway. */ free (potential); return ret; } /* This is called when NAME is absolute or explicitly relative; if it's readable, return (a list containing) it; otherwise, return NULL. */ static str_list_type absolute_search P1C(string, name) { str_list_type ret_list; string found = kpse_readable_file (name); /* Some old compilers can't initialize structs. */ ret_list = str_list_init (); /* If NAME wasn't found, free the expansion. */ if (name != found) free (name); /* Add `found' to the return list even if it's null; that tells the caller we didn't find anything. */ str_list_add (&ret_list, found); return ret_list; } /* If DB_DIR is a prefix of PATH_ELT, return true; otherwise false. That is, the question is whether to try the db for a file looked up in PATH_ELT. If PATH_ELT == ".", for example, the answer is no. If PATH_ELT == "/usr/local/lib/texmf/fonts//tfm", the answer is yes. We do a simple string compare, ignoring //. In practice I think //'s will always be after DB_DIR. */ static boolean elt_in_db P1C(const_string, path_elt) { const_string db_dir = DB_DIR; while (*db_dir++ == *path_elt++) { /* If we've matched the entire db directory, it's good. */ if (*db_dir == 0) return true; /* If we've reached the end of PATH_ELT, but not the end of the db directory, that's no good. */ if (*path_elt == 0) break; } return false; } /* This is the hard case -- look for NAME in PATH. If ALL is false, just return the first file found. Otherwise, search all elements of PATH. */ static str_list_type path_search P4C(const_string, path, string, name, boolean, must_exist, boolean, all) { string elt; str_list_type ret_list; boolean done = false; ret_list = str_list_init (); for (elt = kpse_path_element (path); !done && elt; elt = kpse_path_element (NULL)) { boolean try_db; boolean forbid_fs_search = false; str_list_type *found = NULL; if (*elt == '%' && *(elt + 1) == '%') { /* Magic leading chars in a path element means don't search the disk regardless. And take off the magic for use below. */ forbid_fs_search = true; elt += 2; } /* Try the prebuilt db only if it's relevant to this path element. */ try_db = elt_in_db (elt); found = try_db ? kpse_db_search (name, elt, all) : NULL; /* Search the filesystem if (1) the path spec allows it, and either (2a) the db was irrelevant to ELT (try_db == false); or (2b) no db exists (kpse_db_search returns NULL); or (3) NAME was not in the db (kpse_db_search returns an empty list) and MUST_EXIST. In (2a) and (2b), `found' will be NULL. */ if (!forbid_fs_search && (!found || (!STR_LIST (*found) && must_exist))) { str_llist_type *dirs = kpse_element_dirs (elt); if (dirs && *dirs) { if (!found) found = XTALLOC1 (str_list_type); *found = dir_list_search (dirs, name, all); } } /* Did we find anything anywhere? */ if (found && STR_LIST (*found)) if (all) str_list_concat (&ret_list, *found); else { str_list_add (&ret_list, STR_LIST_ELT (*found, 0)); done = true; } /* Free the list space, if any (but not the elements). */ if (found) free (found); } /* Free the expanded name we were passed. It can't be in the return list, since the path directories got unconditionally prepended. */ free (name); return ret_list; } /* Search PATH for ORIGINAL_NAME. If ALL is false, or ORIGINAL_NAME is absolute_p, check ORIGINAL_NAME itself. Otherwise, look at each element of PATH for the first readable ORIGINAL_NAME. Always return a list; if no files are found, the list will contain just NULL. If ALL is true, the list will be terminated with NULL. */ static string * search P4C(const_string, path, const_string, original_name, boolean, must_exist, boolean, all) { str_list_type ret_list; /* Make a leading ~ count as an absolute filename, and expand $FOO's. */ string name = kpse_expand (original_name); /* If the first name is absolute or explicitly relative, no need to consider PATH at all. */ boolean absolute_p = kpse_absolute_p (name); /* Find the file(s). */ ret_list = absolute_p ? absolute_search (name) : path_search (path, name, must_exist, all); /* Append NULL terminator if we didn't find anything at all, or we're supposed to find ALL and the list doesn't end in NULL now. */ if (STR_LIST_LENGTH (ret_list) == 0 || (all && STR_LIST_LAST_ELT (ret_list) != NULL)) str_list_add (&ret_list, NULL); return STR_LIST (ret_list); } /* Search PATH for the first NAME. */ string kpse_path_search P3C(const_string, path, const_string, name, boolean, must_exist) { string *ret_list = search (path, name, must_exist, false); return *ret_list; } /* Search all elements of PATH for files named NAME. Not sure if it's right to assert `must_exist' here, but it suffices now. */ string * kpse_all_path_search P2C(const_string, path, const_string, name) { string *ret = search (path, name, true, true); return ret; } #ifdef TEST void test_path_search (const_string path, const_string file) { string answer; string *answer_list; printf ("\nSearch %s for %s:\t", path, file); answer = kpse_path_search (path, file); puts (answer ? answer : "(null)"); printf ("Search %s for all %s:\t", path, file); answer_list = kpse_all_path_search (path, file); putchar ('\n'); while (*answer_list) { putchar ('\t'); puts (*answer_list); answer_list++; } } #define TEXFONTS "/usr/local/lib/tex/fonts" int main () { /* All lists end with NULL. */ test_path_search (".", "nonexistent"); test_path_search (".", "/nonexistent"); test_path_search ("/k:.", "kpathsea.texi"); test_path_search ("/k:.", "/etc/fstab"); test_path_search (".:" TEXFONTS "//", "cmr10.tfm"); test_path_search (".:" TEXFONTS "//", "logo10.tfm"); test_path_search (TEXFONTS "//times:.::", "ptmr.vf"); test_path_search (TEXFONTS "/adobe//:" "/usr/local/src/TeX+MF/typefaces//", "plcr.pfa"); test_path_search ("~karl", ".bashrc"); test_path_search ("/k", "~karl/.bashrc"); xputenv ("NONEXIST", "nonexistent"); test_path_search (".", "$NONEXISTENT"); xputenv ("KPATHSEA", "kpathsea"); test_path_search ("/k:.", "$KPATHSEA.texi"); test_path_search ("/k:.", "${KPATHSEA}.texi"); test_path_search ("$KPATHSEA:.", "README"); test_path_search (".:$KPATHSEA", "README"); return 0; } #endif /* TEST */ /* Local variables: test-compile-command: "gcc -posix -g -I. -I.. -DTEST pathsearch.c kpathsea.a" End: */ octave-1.1.0/kpathsea/putenv.c100666 415 17 5735 5427573312 14446 0ustar jweusers/****************************************************************/ /* */ /* putenv(3) */ /* */ /* Change or add an environment entry */ /* */ /****************************************************************/ /* origination 1987-Oct-7 T. Holm */ /* (slightly modified by karl@cs.umb.edu for kpathsea.) */ /****************************************************************/ /* for HAVE_PUTENV and const -- need nothing else. */ #include #ifndef HAVE_PUTENV /* whole file */ /* Path: hoptoad!pacbell!ames!ll-xn!mit-eddie!uw-beaver!ssc-vax!uvicctr!tholm From: tholm@uvicctr.UUCP (Terrence W. Holm) Newsgroups: comp.os.minix Subject: putenv(3) Message-ID: <395@uvicctr.UUCP> Date: 5 May 88 06:40:52 GMT Organization: University of Victoria, Victoria B.C. Canada EFTH Minix report #2 - May 1988 - putenv(3) This is an implementation of putenv(3) that we wrote for Minix. Please consider this a public domain program. */ #define NULL 0 #define PSIZE sizeof(char *) extern char **environ; char *strchr(); char *malloc(); /****************************************************************/ /* */ /* int */ /* putenv( entry ) */ /* */ /* The "entry" should follow the form */ /* "NAME=VALUE". This routine will search the */ /* user environment for "NAME" and replace its */ /* value with "VALUE". */ /* */ /* Note that "entry" is not copied, it is used */ /* as the environment entry. This means that it */ /* must not be unallocated or otherwise modifed */ /* by the caller, unless it is replaced by a */ /* subsequent putenv(). */ /* */ /* If the name is not found in the environment, */ /* then a new vector of pointers is allocated, */ /* "entry" is put at the end and the global */ /* variable "environ" is updated. */ /* */ /* This function normally returns 0, but -1 */ /* is returned if it can not allocate enough */ /* space using malloc(3), or "entry" does not */ /* contain a '='. */ /* */ /****************************************************************/ int putenv( entry ) char *entry; { unsigned length; unsigned size; char *temp; char **p; char **new_environ; /* Find the length of the "NAME=" */ temp = strchr(entry,'='); if ( temp == 0 ) return( -1 ); length = (unsigned) (temp - entry + 1); /* Scan through the environment looking for "NAME=" */ for ( p=environ; *p != 0 ; p++ ) if ( strncmp( entry, *p, length ) == 0 ) { *p = entry; return( 0 ); } /* The name was not found, build a bigger environment */ size = p - environ; new_environ = (char **) malloc( (size+2)*PSIZE ); if ( new_environ == (char **) NULL ) return( -1 ); memcpy ((char *) new_environ, (const char *) environ, size*PSIZE ); new_environ[size] = entry; new_environ[size+1] = NULL; environ = new_environ; return(0); } #endif /* not HAVE_PUTENV */ octave-1.1.0/kpathsea/readable.c100666 415 17 3746 5541661711 14662 0ustar jweusers/* readable.c: check if a filename is a readable regular file. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include /* If access can read FN, run stat (assigning to stat buffer ST) and check that fn is a regular file. */ #define READABLE(fn, st) \ (access (fn, R_OK) == 0 && stat (fn, &(st)) == 0 && S_ISREG (st.st_mode)) /* POSIX invented the brain-damage of not necessarily truncating filename components; the system's behavior is defined by the value of the symbol _POSIX_NO_TRUNC, but you can't change it dynamically! Generic const return warning. See extend-fname.c. */ string kpse_readable_file P1C(const_string, name) { struct stat st; string ret; if (READABLE (name, st)) ret = (string) name; #ifdef ENAMETOOLONG else if (errno == ENAMETOOLONG) { ret = kpse_truncate_filename (name); /* Perhaps some other error will occur with the truncated name, so let's call access again. */ if (!READABLE (ret, st)) { /* Failed. */ if (ret != name) free (ret); ret = NULL; } } #endif else /* Some other error. */ { if (errno == EACCES) /* Warn them if permissions are bad. */ perror (name); ret = NULL; } return ret; } octave-1.1.0/kpathsea/rm-suffix.c100666 415 17 2224 5455050347 15032 0ustar jweusers/* remove-suffx.c: remove any suffix. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* Generic const warning -- see extend-fname.c. */ string remove_suffix P1C(const_string, s) { string ret; const_string suffix = find_suffix (s); if (suffix) { /* Back up to before the dot. */ suffix--; ret = (string) xmalloc (suffix - s + 1); strncpy (ret, s, suffix - s); ret[suffix - s] = 0; } else ret = (string) s; return ret; } octave-1.1.0/kpathsea/str-list.c100666 415 17 3473 5410651576 14704 0ustar jweusers/* str-list.c: define routines for string lists. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* See the .h file for comments. */ str_list_type str_list_init P1H(void) { str_list_type ret; STR_LIST_LENGTH (ret) = 0; STR_LIST (ret) = NULL; return ret; } void str_list_add P2C(str_list_type *, l, string, s) { STR_LIST_LENGTH (*l)++; XRETALLOC (STR_LIST (*l), STR_LIST_LENGTH (*l), string); STR_LIST_LAST_ELT (*l) = s; } /* May as well save some reallocations and do everything in a chunk instead of calling str_list_add on each element. */ void str_list_concat P2C(str_list_type *, target, str_list_type, more) { unsigned e; unsigned prev_len = STR_LIST_LENGTH (*target); STR_LIST_LENGTH (*target) += STR_LIST_LENGTH (more); XRETALLOC (STR_LIST (*target), STR_LIST_LENGTH (*target), string); for (e = 0; e < STR_LIST_LENGTH (more); e++) STR_LIST_ELT (*target, prev_len + e) = STR_LIST_ELT (more, e); } /* Free the list (but not the elements within it). */ void str_list_free P1C(str_list_type *, l) { if (STR_LIST (*l)) { free (STR_LIST (*l)); STR_LIST (*l) = NULL; } } octave-1.1.0/kpathsea/str-llist.c100666 415 17 6020 5463304316 15042 0ustar jweusers/* str-llist.c: Implementation of a linked list of strings. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include /* Add the new string STR to the end of the list L. */ void str_llist_add P2C(str_llist_type *, l, string, str) { str_llist_elt_type *e; str_llist_elt_type *new_elt = XTALLOC1 (str_llist_elt_type); /* The new element will be at the end of the list. */ STR_LLIST (*new_elt) = str; STR_LLIST_MOVED (*new_elt) = false; STR_LLIST_NEXT (*new_elt) = NULL; /* Find the current end of the list. */ for (e = *l; e && STR_LLIST_NEXT (*e); e = STR_LLIST_NEXT (*e)) ; if (!e) *l = new_elt; else STR_LLIST_NEXT (*e) = new_elt; } /* Move an element towards the top. The idea is that when a file is found in a given directory, later files will likely be in that same directory, and looking for the file in all the directories in between is thus a waste. */ void str_llist_float P2C(str_llist_type *, l, str_llist_elt_type *, mover) { str_llist_elt_type *last_moved, *unmoved; /* If we've already moved this element, never mind. */ if (STR_LLIST_MOVED (*mover)) return; /* Find the first unmoved element (to insert before). We're guaranteed this will terminate, since MOVER itself is currently unmoved, and it must be in L (by hypothesis). */ for (last_moved = NULL, unmoved = *l; STR_LLIST_MOVED (*unmoved); last_moved = unmoved, unmoved = STR_LLIST_NEXT (*unmoved)) ; /* If we are the first unmoved element, nothing to relink. */ if (unmoved != mover) { /* Remember `mover's current successor, so we can relink `mover's predecessor to it. */ str_llist_elt_type *before_mover; str_llist_elt_type *after_mover = STR_LLIST_NEXT (*mover); /* Find `mover's predecessor. */ for (before_mover = unmoved; STR_LLIST_NEXT (*before_mover) != mover; before_mover = STR_LLIST_NEXT (*before_mover)) ; /* `before_mover' now links to `after_mover'. */ STR_LLIST_NEXT (*before_mover) = after_mover; /* Insert `mover' before `unmoved' and after `last_moved' (or at the head of the list). */ STR_LLIST_NEXT (*mover) = unmoved; if (!last_moved) *l = mover; else STR_LLIST_NEXT (*last_moved) = mover; } /* We've moved it. */ STR_LLIST_MOVED (*mover) = true; } octave-1.1.0/kpathsea/tex-file.c100666 415 17 4524 5540713052 14626 0ustar jweusers/* tex-file.c: stuff for all TeX formats. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include /* See tex-font.h. */ const_string kpse_fallback_font = NULL; unsigned *kpse_fallback_resolutions = NULL; string kpse_font_override_path = NULL; /* The compiled-in default list, DEFAULT_FONT_SIZES, is intended to be set from the command line (presumably via the Makefile). */ #ifndef DEFAULT_FONT_SIZES #define DEFAULT_FONT_SIZES "" #endif void kpse_init_fallback_resolutions P1C(string, envvar) { const_string size_var = ENVVAR (envvar, "TEXSIZES"); string size_str = getenv (size_var); unsigned *last_resort_sizes = NULL; unsigned size_count = 0; string size_list = kpse_expand_default (size_str, DEFAULT_FONT_SIZES); /* Initialize the list of last-resort sizes. */ for (size_str = kpse_path_element (size_list); size_str != NULL; size_str = kpse_path_element (NULL)) { if (! *size_str) continue; size_count++; XRETALLOC (last_resort_sizes, size_count, unsigned); last_resort_sizes[size_count - 1] = atoi (size_str); } /* Add a zero to mark the end of the list. */ size_count++; XRETALLOC (last_resort_sizes, size_count, unsigned); last_resort_sizes[size_count - 1] = 0; kpse_fallback_resolutions = last_resort_sizes; } /* See the .h file for the description. */ string kpse_find_file P4C(const_string, name, const_string, ext, const_string, path, boolean, must_exist) { string full_name = concat3 (name, ".", ext); string ret = kpse_path_search (path, full_name, must_exist); free (full_name); return ret; } octave-1.1.0/kpathsea/tex-glyph.c100666 415 17 30072 5544337453 15062 0ustar jweusers/* tex-glyph.c: Search for GF/PK files. Copyright (C) 1993, 94 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include #include #include /* Routines are in bottom-up order. */ /* Return malloced filename for bitmap font NAME at resolution DPI with extension SUFFIX. We depend on callers setting the environment variables; we only find the right variable spec to use. */ #ifndef KPATHSEA_BITMAP_NAME #ifdef DOS /* dpi300\cmr10.pk */ #define KPATHSEA_BITMAP_NAME \ "dpi$KPATHSEA_DPI\\$KPATHSEA_NAME.$KPATHSEA_FORMAT" #else /* cmr10.300pk */ #define KPATHSEA_BITMAP_NAME "$KPATHSEA_NAME.$KPATHSEA_DPI$KPATHSEA_FORMAT" #endif /* not DOS */ #endif /* not KPATHSEA_BITMAP_NAME */ static string bitmap_name P3C(const_string, name, unsigned, dpi, const_string, suffix) { string ret; const_string spec = getenv ("KPATHSEA_BITMAP_NAME"); /* We could save a speck of time by setting the environment variable to our compile-time default at the beginning of the program, but it it doesn't seem worth the code separation. */ if (!spec) spec = KPATHSEA_BITMAP_NAME; ret = kpse_var_expand (spec); return ret; } /* Look up FONT_NAME at resolution DPI in PATH, with filename suffix EXTENSION. Return file found or NULL. */ static string try_format P4C(const_string, font_name, unsigned, dpi, const_string, path, const_string, extension) { string name, ret; /* Set the suffix on the name we'll be searching for. */ xputenv ("KPATHSEA_FORMAT", extension); name = bitmap_name (font_name, dpi, extension); ret = kpse_path_search (path, name, true); if (name != ret) free (name); return ret; } /* Look for FONT_NAME at resolution DPI, using GLYPH_PATHS. If GLYPH_PATHS[format] is NULL, don't search for that format; otherwise, it is the raw search path to use for that format. Search the (entire) PK path first, then the GF path, if we're looking for both. Return the filename found, and (if it's non-NULL) fill in FONT_FILE. */ static string try_size P4C(const_string, font_name, unsigned, dpi, string *, glyph_paths, kpse_font_file_type *, font_file) { kpse_file_format_type format_found; string ret; string gf_path = glyph_paths[kpse_gf_format]; string pk_path = glyph_paths[kpse_pk_format]; xputenv_int ("KPATHSEA_DPI", dpi); /* Look for PK first (since it's more likely to be found), then GF. */ ret = pk_path ? try_format (font_name, dpi, pk_path, "pk") : NULL; if (ret != NULL) format_found = kpse_pk_format; else { if (gf_path) { ret = try_format (font_name, dpi, gf_path, "gf"); format_found = kpse_gf_format; } } if (ret != NULL && font_file) { /* Success. Fill in the return info. Discard const. */ font_file->name = (string) font_name; font_file->dpi = dpi; font_file->format = format_found; } return ret; } /* Look for FONT_NAME at resolution DPI, then at the resolutions within KPSE_BITMAP_TOLERANCE of DPI. See `try_name' for information on other args and return value. */ static string try_resolution P4C(const_string, font_name, unsigned, dpi, string *, glyph_paths, kpse_font_file_type *, font_file) { string ret = try_size (font_name, dpi, glyph_paths, font_file); if (!ret) { unsigned r; unsigned tolerance = KPSE_BITMAP_TOLERANCE (dpi); unsigned lower_bound = (int) (dpi - tolerance) < 0 ? 0 : dpi - tolerance; unsigned upper_bound = dpi + tolerance; /* Prefer scaling up to scaling down, since scaling down can omit character features (Tom did this in dvips). */ for (r = lower_bound; !ret && r <= upper_bound; r++) if (r != dpi) ret = try_size (font_name, r, glyph_paths, font_file); } return ret; } /* Look up FONT_NAME in format FORMAT at DPI in the texfonts.map files that we can find, returning the filename found and FONT_FILE. */ static string try_fontmap P4C(const_string, font_name, unsigned, dpi, string *, glyph_paths, kpse_font_file_type *, font_file) { static hash_table_type fontmap; string *mapped_names; string ret = NULL; if (fontmap.size == 0) { /* If we wanted to complicate our lives, we could handle separate maps for GF and PK ones. I don't see that this has any practical utility, though, because if someone wants an alias, most likely the alias should apply to non-glyphs as well as glyphs (let alone to only GF format or PK format). */ const_string map_path = KPSE_GLYPH_PATH (); fontmap = map_create (map_path); } mapped_names = map_lookup (fontmap, font_name); if (mapped_names) { string mapped_name; while ((mapped_name = *mapped_names++) && !ret) { xputenv ("KPATHSEA_NAME", mapped_name); ret = try_resolution (mapped_name, dpi, glyph_paths, font_file); } } return ret; } /* Look for FONT_NAME in `kpse_fallback_resolutions', omitting DPI if we happen across it. Pass GLYPH_PATHS and FONT_FILE along as usual. Assume `kpse_fallback_resolutions' is sorted. */ static string try_fallback_resolutions P4C(const_string, font_name, unsigned, dpi, string *, glyph_paths, kpse_font_file_type *, font_file) { unsigned s; int loc, max_loc; int lower_loc, upper_loc; unsigned lower_diff, upper_diff; unsigned closest_diff = UINT_MAX; string ret = NULL; /* Initialize in case the first fallback resolution is DPI. */ /* First find the fallback size closest to DPI. */ for (s = 0; kpse_fallback_resolutions[s] != 0; s++) { unsigned this_diff = abs (kpse_fallback_resolutions[s] - dpi); if (this_diff < closest_diff) { closest_diff = this_diff; loc = s; } } max_loc = s; lower_loc = loc - 1; upper_loc = loc + 1; for (;;) { /* Don't bother to try DPI itself again. */ if (kpse_fallback_resolutions[loc] != dpi) ret = try_resolution (font_name, kpse_fallback_resolutions[loc], glyph_paths, font_file); if (ret) break; /* That didn't work. How far away are the locs above or below? */ lower_diff = lower_loc > -1 ? dpi - kpse_fallback_resolutions[lower_loc] : INT_MAX; upper_diff = upper_loc < max_loc ? kpse_fallback_resolutions[upper_loc] - dpi : INT_MAX; /* But if we're at the end in both directions, quit. */ if (lower_diff == INT_MAX && upper_diff == INT_MAX) break; /* Go in whichever direction is closest. */ if (lower_diff < upper_diff) { loc = lower_loc; lower_loc--; } else { loc = upper_loc; upper_loc++; } } return ret; } /* See the .h file for description. This is the entry point. */ string kpse_find_glyph_format P4C(const_string, font_name, unsigned, dpi, kpse_file_format_type, format, kpse_font_file_type *, font_file) { string glyph_paths[kpse_any_glyph_format]; string ret; kpse_source_type source; /* Initialize the path strings for the glyph formats we will try. */ glyph_paths[kpse_gf_format] = format == kpse_any_glyph_format || format == kpse_gf_format ? KPSE_GF_PATH () : NULL; glyph_paths[kpse_pk_format] = format == kpse_any_glyph_format || format == kpse_pk_format ? KPSE_PK_PATH () : NULL; /* Start the search: try the name we're given. */ source = kpse_source_normal; xputenv ("KPATHSEA_NAME", font_name); ret = try_resolution (font_name, dpi, glyph_paths, font_file); /* Sorry for the spaghetti logic. How to improve? */ if (!ret) { /* Maybe FONT_NAME was an alias. */ source = kpse_source_alias; ret = try_fontmap (font_name, dpi, glyph_paths, font_file); /* OK, maybe we can create it on the fly with MakeTeXPK. */ if (!ret) { source = kpse_source_maketex; /* `try_resolution' leaves the envvar set randomly. */ xputenv_int ("KPATHSEA_DPI", dpi); ret = kpse_make_tex (format, font_name); } /* If MakeTeX... succeeded, set return struct. (Doesn't make sense for `kpse_make_tex' to set it, since it can only succeed or fail, unlike the other routines.) */ if (ret) { KPSE_FONT_FILE_DPI (*font_file) = dpi; /* Discarding const here. */ KPSE_FONT_FILE_NAME (*font_file) = (string) font_name; } /* If MakeTeX... failed, try any fallback resolutions. */ else { if (kpse_fallback_resolutions) ret = try_fallback_resolutions (font_name, dpi, glyph_paths, font_file); /* We're down to the font of last resort. */ if (!ret && kpse_fallback_font) { /* As before, first try it at the given size. */ source = kpse_source_fallback; xputenv ("KPATHSEA_NAME", kpse_fallback_font); ret = try_resolution (kpse_fallback_font, dpi, glyph_paths, font_file); /* The fallback font at the fallback resolutions. */ if (!ret && kpse_fallback_resolutions) ret = try_fallback_resolutions (kpse_fallback_font, dpi, glyph_paths, font_file); } } } /* If RET is null, then the caller must not look at FONT_FILE, so it doesn't matter if we assign something incorrect to it. */ KPSE_FONT_FILE_SOURCE (*font_file) = source; return ret; } #ifdef TEST void test_find_glyph (const_string font_name, unsigned dpi) { string answer; kpse_font_file_type ret; printf ("\nSearch for %s@%u:\n\t", font_name, dpi); answer = kpse_find_glyph_format (font_name, dpi, kpse_any_glyph_format, &ret); if (answer) { string format = ret.format == kpse_pk_format ? "pk" : "gf"; if (!ret.name) ret.name = "(null)"; printf ("%s\n\t(%s@%u, %s)\n", answer, ret.name, ret.dpi, format); } else puts ("(null)"); } int main () { test_find_glyph ("/usr/local/lib/tex/fonts/cm/cmr10", 300); /* absolute */ test_find_glyph ("cmr10", 300); /* normal */ test_find_glyph ("logo10", 300); /* find gf */ test_find_glyph ("cmr10", 299); /* find 300 */ test_find_glyph ("circle10", 300); /* in fontmap */ test_find_glyph ("none", 300); /* do not find */ kpse_fallback_font = "cmr10"; test_find_glyph ("fallback", 300); /* find fallback font cmr10 */ kpse_init_fallback_resolutions ("KPATHSEA_TEST_SIZES"); test_find_glyph ("fallbackdpi", 759); /* find fallback font cmr10@300 */ xputenv ("GFFONTS", "."); test_find_glyph ("cmr10", 300); /* different GFFONTS/TEXFONTS */ return 0; } #endif /* TEST */ /* Local variables: test-compile-command: "gcc -posix -g -I. -I.. -DTEST tex-glyph.c kpathsea.a" End: */ octave-1.1.0/kpathsea/tex-make.c100666 415 17 22055 5523737655 14663 0ustar jweusers/* tex-make.c: Run external programs to make TeX files. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include #include #include /* We never throw away stdout, since that is supposed to be the filename found, if all is successful. This variable controls whether stderr is thrown away. */ boolean kpse_make_tex_discard_errors = false; #define MAKE_TEX_PK_SPEC \ "$KPATHSEA_DPI $MAKETEX_BASE_DPI $MAKETEX_MAG $MAKETEX_MODE" /* We could generalize this to the idea of a ``path spec'', and collect the default paths, environment variables, and whatever else in the same structure. `kpse_var_expand' could understand ${PARM-word} to go along with it, then the envvar search list itself would be overridable. Is it worth it? */ kpse_make_spec_type kpse_make_specs[] = { /* kpse_gf_format */ { false, NULL, NULL }, /* kpse_pk_format */ { false, "MakeTeXPK", MAKE_TEX_PK_SPEC }, /* kpse_any_glyph_format */ { false, "MakeTeXPK", MAKE_TEX_PK_SPEC }, /* kpse_bib_format */ { false, NULL, NULL }, /* kpse_bst_format */ { false, NULL, NULL }, /* kpse_mf_format */ { false, "MakeTeXMF", NULL }, /* kpse_tex_format */ { false, "MakeTeXTeX", NULL }, /* kpse_tfm_format */ { false, "MakeTeXTFM", NULL }, /* kpse_vf_format */ { false, NULL, NULL }, }; /* We assume the script will output the filename it creates (and nothing else) on standard output, and hence run the script with `popen'. */ string kpse_make_tex P2C(kpse_file_format_type, format, const_string, base_file) { string ret; kpse_make_spec_type spec; spec = kpse_make_specs[format]; if (KPSE_MAKE_SPEC_ENABLED (spec)) { FILE *f; const_string prog = KPSE_MAKE_SPEC_PROGRAM (spec); string PROG = uppercasify (prog); string progenv = getenv (PROG); const_string arg_spec = progenv ? progenv : KPSE_MAKE_SPEC_ARGS (spec); string args = arg_spec ? kpse_var_expand (arg_spec) : (string) ""; string cmd = concatn (prog, " ", base_file, " ", args, NULL); /* Only way to discard errors is redirect stderr inside another shell; otherwise, if the MakeTeX... script doesn't exist, we will see the `sh: MakeTeX...: not found' error. */ if (kpse_make_tex_discard_errors) { string old_cmd = cmd; cmd = concat3 ("sh -c \"", cmd, "\" 2>/dev/null"); free (old_cmd); } /* Run the script and prepare to read the output. */ f = popen (cmd, FOPEN_R_MODE); free (PROG); free (cmd); if (strlen (args) > 0) free (args); if (f) { int c; string fn; /* The final filename. */ unsigned len; /* And its length. */ fn_type output; output = fn_init (); /* Collect the script output. */ /* Read all the output and terminate with a null. */ while ((c = getc (f)) != EOF) fn_1grow (&output, c); fn_1grow (&output, 0); /* Maybe should check for `EXIT_SUCCESS' status before even looking at the output? */ if (pclose (f) == -1) FATAL_PERROR (cmd); len = FN_LENGTH (output); fn = FN_STRING (output); /* Remove trailing newlines and returns. */ while (len > 1 && (fn[len - 2] == '\n' || fn[len - 2] == '\r')) { fn[len - 2] = 0; len--; } /* If no output from script, return NULL. Otherwise check what it output. */ ret = len == 1 ? NULL : kpse_readable_file (fn); /* Free the name if we're not returning it. */ if (fn != ret) free (fn); } else /* popen failed. Maybe should give error (optionally), but for now be silent, to avoid annoying people who purposefully don't have the script installed. */ ret = NULL; } else ret = NULL; /* This MakeTeX... program was disabled. */ return ret; } /* Return true magstep N for resolution BDPI. From dvips. */ static int magstep P2C(int, n, int, bdpi) { register double t; int step; int neg = 0; if (n < 0) { neg = 1; n = -n; } if (n & 1) { n &= ~1; t = 1.095445115; } else t = 1.0; while (n > 8) { n -= 8; t = t * 2.0736; } while (n > 0) { n -= 2; t = t * 1.2; } step = 0.5 + (neg ? bdpi / t : bdpi * t); return step; } /* Tom Rokicki wrote this code for dvips. It is in kpathsea now so that we can be sure xdvik and dvipsk use the same code to compute this. His comments: Here we want to return a string. If we can find some integer m such that floor(0.5 + bdpi * 1.2 ^ (m/2)) = dpi, we write out magstep(m/2) where m/2 is a decimal number; else we write out dpi/bdpi We do this for the very slight improvement in accuracy that magstep() gives us over the rounded dpi/bdpi. Instead of returning a string, we set the envvar MAKETEX_MAG, which is part of the default spec for MakeTeXPK above. (That's why this routine is in this source file.) We allow +-1 when checking if DPI is a given magstep, so that DPI values of 328, 329, and 330 will all translate to magstep(.5). Floating-point computation with the DVI scale factors leads to 328. */ /* Don't bother trying to use fabs or some other ``standard'' routine which can only cause trouble; just roll our own simple-minded absolute-value function that is all we need. */ #define ABS(expr) ((expr) < 0 ? -(expr) : (expr)) void kpse_set_maketex_mag P2C(int, dpi, int, bdpi) { int m, n; char q[1000]; m = 0; if (dpi < bdpi) { for (;;) { m--; n = magstep(m, bdpi); if (ABS (n - dpi) <= 1) break; if (n < dpi || m < -40) { m = 9999; break; } } } else if (dpi > bdpi) { for (;;) { m++; n = magstep(m, bdpi); if (ABS (n - dpi) <= 1) break; if (n > dpi || m > 40) { m = 9999; break; } } } #if defined (DOS) || defined (OS2) { double t; /* write out magnification as decimal number ... why? --karl */ if (m == 9999) { t = (double)dpi/bdpi; } else { if (m < 0) n = -m; else n = m; if (n & 1) { n &= ~1; t = 1.095445115; } else t = 1.0; while (n > 0) { n -= 2; t = t * 1.2; } if (m < 0) t = 1 / t; } sprintf(q, "%12.9f", t); } #else /* not DOS or OS2 */ if (m == 9999) { sprintf(q, "%d+%d/%d", dpi/bdpi, dpi%bdpi, bdpi); } else if (m >= 0) { sprintf(q, "magstep\\(%d.%d\\)", m/2, (m&1)*5); } else { sprintf(q, "magstep\\(-%d.%d\\)", (-m)/2, (m&1)*5); } #endif /* not DOS or OS2 */ xputenv ("MAKETEX_MAG", q); } /* I don't think it makes much difference whether we check if DPI2 can tolerate DPI1 or the reverse. */ boolean kpse_check_bitmap_tolerance P2C(double, dpi1, double, dpi2) { unsigned tolerance = KPSE_BITMAP_TOLERANCE (dpi2); unsigned lower_bound = (int) (dpi2 - tolerance) < 0 ? 0 : dpi2 - tolerance; unsigned upper_bound = dpi2 + tolerance; return lower_bound <= dpi1 && dpi1 <= upper_bound; } #ifdef TEST void test_make_tex (kpse_file_format_type fmt, const_string base_file) { string answer; printf ("\nAttempting %s in format %d:\n", base_file, fmt); answer = kpse_make_tex (fmt, base_file); puts (answer ? answer : "(null)"); } int main () { xputenv ("MAKETEX_DPI", "781"); /* call MakeTeXPK */ xputenv ("MAKETEX_BASE_DPI", "300"); /* call MakeTeXPK */ xputenv ("MAKETEX_MAG", "781/300"); /* call MakeTeXPK */ KPSE_MAKE_SPEC_ENABLED (kpse_make_specs[kpse_pk_format]) = true; test_make_tex (kpse_pk_format, "cmr10"); /* Fail with MakeTeXTFM. */ KPSE_MAKE_SPEC_ENABLED (kpse_make_specs[kpse_tfm_format]) = true; test_make_tex (kpse_tfm_format, "foozler99"); /* Call something disabled. */ test_make_tex (kpse_bst_format, "no-way"); return 0; } #endif /* TEST */ /* Local variables: test-compile-command: "gcc -posix -g -I. -I.. -DTEST tex-make.c kpathsea.a" End: */ octave-1.1.0/kpathsea/tilde.c100666 415 17 5713 5454535112 14216 0ustar jweusers/* tilde.c: Expand user's home directories. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #ifdef HAVE_PWD_H #include #endif /* If NAME has a leading ~ or ~user, Unix-style, expand it to the user's home directory, and return a new malloced string. If no ~, or no , just return NAME. */ string kpse_tilde_expand P1C(const_string, name) { #ifdef HAVE_PWD_H const_string expansion; const_string home; assert (name); /* If no leading tilde, do nothing. */ if (*name != '~') expansion = name; /* If `~' or `~/', use $HOME if it exists, or `.' if it doesn't. */ else if (IS_DIR_SEP (name[1]) || name[1] == 0) { home = getenv ("HOME"); if (!home) home = "."; expansion = name[1] == 0 ? xstrdup (home) : concat3 (home, DIR_SEP_STRING, name + 2); } /* If `~user' or `~user/', look up user in the passwd database. */ else { struct passwd *p; string user; unsigned c = 2; while (!IS_DIR_SEP (name[c]) && name[c] != 0) c++; user = (string) xmalloc (c); strncpy (user, name + 1, c - 1); user[c - 1] = 0; /* We only need the cast here for those (deficient) systems which do not declare `getpwnam' in . */ p = (struct passwd *) getpwnam (user); free (user); /* If no such user, just use `.'. */ home = p == NULL ? "." : p->pw_dir; expansion = name[c] == 0 ? xstrdup (home) : concat (home, name + c); } /* We may return the same thing as the original, and then we might not be returning a malloc-ed string. */ return (string) expansion; #else return name; #endif /* not HAVE_PWD_H */ } #ifdef TEST void test_expand_tilde (const_string filename) { string answer; printf ("Tilde expansion of `%s':\t", filename ? filename : "(null)"); answer = kpse_expand_tilde (filename); puts (answer); } int main () { string tilde_path = "tilde"; test_expand_tilde (""); test_expand_tilde ("none"); test_expand_tilde ("~root"); test_expand_tilde ("~"); test_expand_tilde ("foo~bar"); return 0; } #endif /* TEST */ /* Local variables: standalone-compile-command: "gcc -g -I. -I.. -DTEST tilde.c kpathsea.a" End: */ octave-1.1.0/kpathsea/truncate.c100666 415 17 3310 5405171652 14732 0ustar jweusers/* truncate.c: truncate too-long components in a filename. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #include /* Truncate any too-long components in NAME, returning the result. It's too bad this is necessary. See comments in readable.c for why. */ string kpse_truncate_filename P1C(const_string, name) { unsigned c_len = 0; /* Length of current component. */ unsigned ret_len = 0; /* Length of constructed result. */ /* Allocate enough space. */ string ret = (string) xmalloc (strlen (name) + 1); for (; *name; name++) { if (IS_DIR_SEP (*name)) { /* At a directory delimiter, reset component length. */ c_len = 0; } else if (c_len > NAME_MAX) { /* If past the max for a component, ignore this character. */ continue; } /* Copy this character. */ ret[ret_len++] = *name; c_len++; } ret[ret_len] = 0; return ret; } octave-1.1.0/kpathsea/uppercasify.c100666 415 17 1752 5437430616 15452 0ustar jweusers/* uppercasify.c: change all lowercase letters to uppercase. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include string uppercasify P1C(const_string, s) { string target; string ret = xstrdup (s); for (target = ret; *target; target++) { *target = TOUPPER (*target); } return ret; } octave-1.1.0/kpathsea/variable.c100666 415 17 11142 5426532652 14720 0ustar jweusers/* variable.c: variable expansion. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include /* Append the result of `getenv (var)' to EXPANSION, where `var' begins at START and ends at END. If `var' is not set, do not complain. */ static void expand P3C(fn_type *, expansion, const_string, start, const_string, end) { string value; unsigned len = end - start + 1; string var = xmalloc (len + 1); strncpy (var, start, len); var[len] = 0; value = getenv (var); if (value) fn_grow (expansion, value, strlen (value)); free (var); } /* Can't think of when it would be useful to change these (and the diagnostic messages assume them), but ... */ #ifndef IS_VAR_START /* starts all variable references */ #define IS_VAR_START(c) ((c) == '$') #endif #ifndef IS_VAR_CHAR /* variable name constituent */ #define IS_VAR_CHAR(c) (ISALNUM (c) || (c) == '_') #endif #ifndef IS_VAR_BEGIN_DELIMITER /* start delimited variable name (after $) */ #define IS_VAR_BEGIN_DELIMITER(c) ((c) == '{') #endif #ifndef IS_VAR_END_DELIMITER #define IS_VAR_END_DELIMITER(c) ((c) == '}') #endif /* Maybe we should generalize to allow some or all of the various shell ${...} constructs. See comments at `kpse_make_specs' in `tex-make.c', for example. */ string kpse_var_expand P1C(const_string, src) { const_string s; string ret; fn_type expansion; expansion = fn_init (); /* Copy everything but variable constructs. */ for (s = src; *s; s++) { if (IS_VAR_START (*s)) { s++; /* Three cases: `$VAR', `${VAR}', `$'. */ if (IS_VAR_CHAR (*s)) { /* $V: collect name constituents, then expand. */ const_string var_end = s; do var_end++; while (IS_VAR_CHAR (*var_end)); var_end--; /* had to go one past */ expand (&expansion, s, var_end); s = var_end; } else if (IS_VAR_BEGIN_DELIMITER (*s)) { /* ${: scan ahead for matching delimiter, then expand. */ const_string var_end = ++s; while (*var_end && !IS_VAR_END_DELIMITER (*var_end)) var_end++; if (! *var_end) { WARNING1 ("%s: No matching right brace for ${", src); s = var_end - 1; /* will incr to null at top of loop */ } else { expand (&expansion, s, var_end - 1); s = var_end; /* will incr past } at top of loop*/ } } else { /* $: error. */ WARNING2 ("%s: Unrecognized variable construct `$%c'", src, *s); /* Just ignore those chars and keep going. */ } } else fn_1grow (&expansion, *s); } fn_1grow (&expansion, 0); ret = FN_STRING (expansion); return ret; } #ifdef TEST static void test_var (string test, string right_answer) { string result = kpse_var_expand (test); printf ("expansion of `%s'\t=> %s", test, result); if (!STREQ (result, right_answer)) printf (" [should be `%s']", right_answer); putchar ('\n'); } int main () { test_var ("a", "a"); test_var ("$foo", ""); test_var ("a$foo", "a"); test_var ("$foo a", " a"); test_var ("a$foo b", "a b"); xputenv ("FOO", "foo value"); test_var ("a$FOO", "afoo value"); xputenv ("Dollar", "$"); test_var ("$Dollar a", "$ a"); test_var ("a${FOO}b", "afoo valueb"); test_var ("a${}b", "ab"); test_var ("$$", ""); /* and error */ test_var ("a${oops", "a"); /* and error */ return 0; } #endif /* TEST */ /* Local variables: standalone-compile-command: "gcc -posix -g -I. -I.. -DTEST variable.c kpathsea.a" End: */ octave-1.1.0/kpathsea/xcalloc.c100666 415 17 2067 5405156520 14537 0ustar jweusers/* xcalloc.c: calloc with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include address xcalloc P2C(unsigned, nelem, unsigned, elsize) { address new_mem = (address) calloc (nelem, elsize); if (new_mem == NULL) { fprintf (stderr, "xcalloc: request for %u elements of size %u failed.\n", nelem, elsize); abort (); } return new_mem; } octave-1.1.0/kpathsea/xfopen.c100666 415 17 2237 5405156473 14417 0ustar jweusers/* xfopen.c: fopen and fclose with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* These routines just check the return status from standard library routines and abort if an error happens. */ FILE * xfopen P2C(const_string, filename, const_string, mode) { FILE *f = fopen (filename, mode); if (f == NULL) FATAL_PERROR (filename); return f; } void xfclose P2C(FILE *, f, const_string, filename) { if (fclose (f) == EOF) FATAL_PERROR (filename); } octave-1.1.0/kpathsea/xmalloc.c100666 415 17 2345 5502160711 14543 0ustar jweusers/* xmalloc.c: malloc with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Don't include config.h or all our other usual includes, since it's useful to just throw this file into other programs. */ #include extern char *malloc (); void * xmalloc (size) unsigned size; { void *new_mem = (void *) malloc (size); if (new_mem == NULL) { fprintf (stderr, "fatal: memory exhausted (xmalloc of %u bytes).\n", size); /* 1 means success on VMS, so pick a random number (ASCII `K'). */ exit (75); } return new_mem; } octave-1.1.0/kpathsea/xopendir.c100666 415 17 2127 5403406131 14731 0ustar jweusers/* xopendir.c: opendir and closedir with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include DIR * xopendir P1C(string, dirname) { DIR *d = opendir (dirname); if (d == NULL) FATAL_PERROR (dirname); return d; } void xclosedir P1C(DIR *, d) { #ifdef VOID_CLOSEDIR closedir (d); #else int ret = closedir (d); if (ret != 0) FATAL ("closedir failed"); #endif } octave-1.1.0/kpathsea/xputenv.c100666 415 17 6612 5523474714 14634 0ustar jweusers/* xputenv.c: set an environment variable without return. Copyright (C) 1993 Karl Berry. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* This `x' function is different from the others in that it takes different parameters than the standard function; but I find it much more convenient to pass the variable and the value separately. Also, this way we can guarantee that the environment value won't become garbage. Also, putenv just overwrites old entries with the new, and we want to reclaim that space -- this may be called hundreds of times on a run. But naturally, some systems do it differently. In this case, it's net2 that is smart and does its own saving/freeing. If you can write a test for configure to check this, please send it to me. Until then, you'll have to define SMART_PUTENV yourself. */ void xputenv P2C(const_string, var_name, const_string, value) { static const_string *saved_env_items; static unsigned saved_len; string old_item = NULL; string new_item = concat3 (var_name, "=", value); #ifndef SMART_PUTENV /* Check if we have saved anything yet. */ if (!saved_env_items) { saved_env_items = XTALLOC1 (const_string); saved_env_items[0] = var_name; saved_len = 1; } else { /* Check if we've assigned VAR_NAME before. */ unsigned i; unsigned len = strlen (var_name); for (i = 0; i < saved_len && !old_item; i++) { if (STREQ (saved_env_items[i], var_name)) { old_item = getenv (var_name); assert (old_item); old_item -= (len + 1); /* Back up to the `NAME='. */ } } if (!old_item) { /* If we haven't seen VAR_NAME before, save it. Assume it is in safe storage. */ saved_len++; XRETALLOC (saved_env_items, saved_len, const_string); saved_env_items[saved_len - 1] = var_name; } } #endif /* not SMART_PUTENV */ /* As far as I can see there's no way to distinguish between the various errors; putenv doesn't have errno values. */ if (putenv (new_item) < 0) FATAL1 ("putenv (%s) failed", new_item); #ifndef SMART_PUTENV /* Can't free `new_item' because its contained value is now in `environ', but we can free `old_item', since it's been replaced. */ if (old_item) free (old_item); #endif /* not SMART_PUTENV */ } /* A special case for setting a variable to a numeric value (specifically, KPATHSEA_DPI). We don't need to dynamically allocate and free the string for the number, since it's saved as part of the environment value. */ void xputenv_int P2C(const_string, var_name, int, num) { char str[MAX_INT_LENGTH]; sprintf (str, "%d", num); xputenv (var_name, str); } octave-1.1.0/kpathsea/xrealloc.c100666 415 17 3262 5502160712 14715 0ustar jweusers/* xrealloc.c: realloc with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Don't include config.h or all our other usual includes, since it's useful to just throw this file into other programs. */ #include extern char *realloc (); extern void *xmalloc (); void * xrealloc (old_ptr, size) void *old_ptr; unsigned size; { void *new_mem; if (old_ptr == NULL) new_mem = xmalloc (size); else { new_mem = (void *) realloc (old_ptr, size); if (new_mem == NULL) { /* We used to print OLD_PTR here using %x, and casting its value to unsigned, but that lost on the Alpha, where pointers and unsigned had different sizes. Since the info is of little or no value anyway, just don't print it. */ fprintf (stderr, "fatal: memory exhausted (realloc of %u bytes).\n", size); /* 1 means success on VMS, so pick a random number (ASCII `B'). */ exit (66); } } return new_mem; } octave-1.1.0/kpathsea/xstat.c100666 415 17 2314 5405172101 14241 0ustar jweusers/* xstat.c: stat and (maybe) lstat with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include struct stat xstat P1C(const_string, path) { struct stat s; if (stat (path, &s) != 0) FATAL_PERROR (path); return s; } /* If we don't have symbolic links, lstat is the same as stat, and #define is made in the include file. */ #ifdef S_ISLNK struct stat xlstat P1C(const_string, path) { struct stat s; if (lstat (path, &s) != 0) FATAL_PERROR (path); return s; } #endif octave-1.1.0/kpathsea/xstrdup.c100666 415 17 1670 5405156276 14632 0ustar jweusers/* xstrdup.c: strdup with error checking. Copyright (C) 1992, 93 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* Return a copy of S in new storage. */ string xstrdup P1C(const_string, s) { string new_string = (string) xmalloc (strlen (s) + 1); return strcpy (new_string, s); } octave-1.1.0/kpathsea/configure100777 415 17 55711 5541652374 14712 0ustar jweusers#!/bin/sh # Guess values for system-dependent variables and create Makefiles. # Generated automatically using autoconf. # Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. # 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. # Usage: configure [--srcdir=DIR] [--host=HOST] [--gas] [--nfp] # [--prefix=PREFIX] [--exec-prefix=PREFIX] [--with-PACKAGE[=VALUE]] # Ignores all args except --srcdir, --prefix, --exec-prefix, and # --with-PACKAGE[=VALUE] unless this script has special code to handle it. for arg do # Handle --exec-prefix with a space before the argument. if test x$next_exec_prefix = xyes; then exec_prefix=$arg; next_exec_prefix= # Handle --host with a space before the argument. elif test x$next_host = xyes; then next_host= # Handle --prefix with a space before the argument. elif test x$next_prefix = xyes; then prefix=$arg; next_prefix= # Handle --srcdir with a space before the argument. elif test x$next_srcdir = xyes; then srcdir=$arg; next_srcdir= else case $arg in # For backward compatibility, recognize -exec-prefix and --exec_prefix. -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* | --exec=* | --exe=* | --ex=* | --e=*) exec_prefix=`echo $arg | sed 's/[-a-z_]*=//'` ;; -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- | --exec | --exe | --ex | --e) next_exec_prefix=yes ;; -gas | --gas | --ga | --g) ;; -host=* | --host=* | --hos=* | --ho=* | --h=*) ;; -host | --host | --hos | --ho | --h) next_host=yes ;; -nfp | --nfp | --nf) ;; -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) prefix=`echo $arg | sed 's/[-a-z_]*=//'` ;; -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) next_prefix=yes ;; -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=* | --s=*) srcdir=`echo $arg | sed 's/[-a-z_]*=//'` ;; -srcdir | --srcdir | --srcdi | --srcd | --src | --sr | --s) next_srcdir=yes ;; -with-* | --with-*) package=`echo $arg|sed -e 's/-*with-//' -e 's/=.*//'` # Reject names that aren't valid shell variable names. if test -n "`echo $package| sed 's/[-a-zA-Z0-9_]//g'`"; then echo "configure: $package: invalid package name" >&2; exit 1 fi package=`echo $package| sed 's/-/_/g'` case "$arg" in *=*) val="`echo $arg|sed 's/[^=]*=//'`" ;; *) val=1 ;; esac eval "with_$package='$val'" ;; -v | -verbose | --verbose | --verbos | --verbo | --verb | --ver | --ve | --v) verbose=yes ;; *) ;; esac fi done trap 'rm -fr conftest* confdefs* core; exit 1' 1 3 15 trap 'rm -f confdefs*' 0 # NLS nuisances. # These must not be set unconditionally because not all systems understand # e.g. LANG=C (notably SCO). if test "${LC_ALL+set}" = 'set' ; then LC_ALL=C; export LC_ALL; fi if test "${LANG+set}" = 'set' ; then LANG=C; export LANG; fi rm -f conftest* confdefs.h # AIX cpp loses on an empty file, so make sure it contains at least a newline. echo > confdefs.h compile='${CC-cc} $CFLAGS conftest.c -o conftest $LIBS >/dev/null 2>&1' # A filename unique to this package, relative to the directory that # configure is in, which we can look for to find out if srcdir is correct. unique_file=kpathsea.texi # Find the source files, if location was not specified. if test -z "$srcdir"; then srcdirdefaulted=yes # Try the directory containing this script, then `..'. prog=$0 confdir=`echo $prog|sed 's%/[^/][^/]*$%%'` test "X$confdir" = "X$prog" && confdir=. srcdir=$confdir if test ! -r $srcdir/$unique_file; then srcdir=.. fi fi if test ! -r $srcdir/$unique_file; then if test x$srcdirdefaulted = xyes; then echo "configure: Can not find sources in \`${confdir}' or \`..'." 1>&2 else echo "configure: Can not find sources in \`${srcdir}'." 1>&2 fi exit 1 fi # Preserve a srcdir of `.' to avoid automounter screwups with pwd. # But we can't avoid them for `..', to make subdirectories work. case $srcdir in .|/*|~*) ;; *) srcdir=`cd $srcdir; pwd` ;; # Make relative path absolute. esac # Save the original args to write them into config.status later. configure_args="$*" if test -z "$CC"; then # Extract the first word of `gcc', so it can be a program name with args. set dummy gcc; word=$2 echo checking for $word IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. if test -f $dir/$word; then CC="gcc" break fi done IFS="$saveifs" fi test -z "$CC" && CC="cc" test -n "$CC" && test -n "$verbose" && echo " setting CC to $CC" # Find out if we are using GNU C, under whatever name. cat > conftest.c < conftest.out 2>&1 if egrep yes conftest.out >/dev/null 2>&1; then GCC=1 # For later tests. fi rm -f conftest* echo checking how to run the C preprocessor if test -z "$CPP"; then # This must be in double quotes, not single quotes, because CPP may get # substituted into the Makefile and ``${CC-cc}'' will simply confuse # make. It must be expanded now. CPP="${CC-cc} -E" cat > conftest.c < Syntax Error EOF err=`eval "($CPP conftest.c >/dev/null) 2>&1"` if test -z "$err"; then : else rm -rf conftest* CPP=/lib/cpp fi rm -f conftest* fi test ".${verbose}" != "." && echo " setting CPP to $CPP" # Make sure to not get the incompatible SysV /etc/install and # /usr/sbin/install, which might be in PATH before a BSD-like install, # or the SunOS /usr/etc/install directory, or the AIX /bin/install, # or the AFS install, which mishandles nonexistent args, or # /usr/ucb/install on SVR4, which tries to use the nonexistent group # `staff'. On most BSDish systems install is in /usr/bin, not /usr/ucb # anyway. Sigh. if test "z${INSTALL}" = "z" ; then echo checking for install IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. case $dir in /etc|/usr/sbin|/usr/etc|/usr/afsws/bin|/usr/ucb) ;; *) if test -f $dir/installbsd; then INSTALL="$dir/installbsd -c" # OSF1 INSTALL_PROGRAM='$(INSTALL)' INSTALL_DATA='$(INSTALL) -m 644' break fi if test -f $dir/install; then if grep dspmsg $dir/install >/dev/null 2>&1; then : # AIX else INSTALL="$dir/install -c" INSTALL_PROGRAM='$(INSTALL)' INSTALL_DATA='$(INSTALL) -m 644' break fi fi ;; esac done IFS="$saveifs" fi INSTALL=${INSTALL-cp} test -n "$verbose" && echo " setting INSTALL to $INSTALL" INSTALL_PROGRAM=${INSTALL_PROGRAM-'$(INSTALL)'} test -n "$verbose" && echo " setting INSTALL_PROGRAM to $INSTALL_PROGRAM" INSTALL_DATA=${INSTALL_DATA-'$(INSTALL)'} test -n "$verbose" && echo " setting INSTALL_DATA to $INSTALL_DATA" if test -z "$RANLIB"; then # Extract the first word of `ranlib', so it can be a program name with args. set dummy ranlib; word=$2 echo checking for $word IFS="${IFS= }"; saveifs="$IFS"; IFS="${IFS}:" for dir in $PATH; do test -z "$dir" && dir=. if test -f $dir/$word; then RANLIB="ranlib" break fi done IFS="$saveifs" fi test -z "$RANLIB" && RANLIB=":" test -n "$RANLIB" && test -n "$verbose" && echo " setting RANLIB to $RANLIB" echo checking for POSIXized ISC if test -d /etc/conf/kconfig.d && grep _POSIX_VERSION /usr/include/sys/unistd.h >/dev/null 2>&1 then ISC=1 # If later tests want to check for ISC. { test -n "$verbose" && \ echo " defining _POSIX_SOURCE" echo "#define" _POSIX_SOURCE 1 >> confdefs.h DEFS="$DEFS -D_POSIX_SOURCE=1" SEDDEFS="${SEDDEFS}\${SEDdA}_POSIX_SOURCE\${SEDdB}_POSIX_SOURCE\${SEDdC}1\${SEDdD} \${SEDuA}_POSIX_SOURCE\${SEDuB}_POSIX_SOURCE\${SEDuC}1\${SEDuD} \${SEDeA}_POSIX_SOURCE\${SEDeB}_POSIX_SOURCE\${SEDeC}1\${SEDeD} " } if test -n "$GCC"; then CC="$CC -posix" else CC="$CC -Xp" fi fi echo checking for directory library header dirheader= if test -z "$dirheader"; then echo checking for dirent.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining DIRENT" echo "#define" DIRENT 1 >> confdefs.h DEFS="$DEFS -DDIRENT=1" SEDDEFS="${SEDDEFS}\${SEDdA}DIRENT\${SEDdB}DIRENT\${SEDdC}1\${SEDdD} \${SEDuA}DIRENT\${SEDuB}DIRENT\${SEDuC}1\${SEDuD} \${SEDeA}DIRENT\${SEDeB}DIRENT\${SEDeC}1\${SEDeD} " } dirheader=dirent.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for sys/ndir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining SYSNDIR" echo "#define" SYSNDIR 1 >> confdefs.h DEFS="$DEFS -DSYSNDIR=1" SEDDEFS="${SEDDEFS}\${SEDdA}SYSNDIR\${SEDdB}SYSNDIR\${SEDdC}1\${SEDdD} \${SEDuA}SYSNDIR\${SEDuB}SYSNDIR\${SEDuC}1\${SEDuD} \${SEDeA}SYSNDIR\${SEDeB}SYSNDIR\${SEDeC}1\${SEDeD} " } dirheader=sys/ndir.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for sys/dir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining SYSDIR" echo "#define" SYSDIR 1 >> confdefs.h DEFS="$DEFS -DSYSDIR=1" SEDDEFS="${SEDDEFS}\${SEDdA}SYSDIR\${SEDdB}SYSDIR\${SEDdC}1\${SEDdD} \${SEDuA}SYSDIR\${SEDuB}SYSDIR\${SEDuC}1\${SEDuD} \${SEDeA}SYSDIR\${SEDeB}SYSDIR\${SEDeC}1\${SEDeD} " } dirheader=sys/dir.h fi rm -f conftest* fi if test -z "$dirheader"; then echo checking for ndir.h cat > conftest.c < #include int main() { exit(0); } int t() { DIR *dirp = 0; } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining NDIR" echo "#define" NDIR 1 >> confdefs.h DEFS="$DEFS -DNDIR=1" SEDDEFS="${SEDDEFS}\${SEDdA}NDIR\${SEDdB}NDIR\${SEDdC}1\${SEDdD} \${SEDuA}NDIR\${SEDuB}NDIR\${SEDuC}1\${SEDuD} \${SEDeA}NDIR\${SEDeB}NDIR\${SEDeC}1\${SEDeD} " } dirheader=ndir.h fi rm -f conftest* fi echo checking for closedir return value cat > conftest.c < #include <$dirheader> int closedir(); main() { exit(closedir(opendir(".")) != 0); } EOF eval $compile if test -s conftest && (./conftest; exit) 2>/dev/null; then : else { test -n "$verbose" && \ echo " defining VOID_CLOSEDIR" echo "#define" VOID_CLOSEDIR 1 >> confdefs.h DEFS="$DEFS -DVOID_CLOSEDIR=1" SEDDEFS="${SEDDEFS}\${SEDdA}VOID_CLOSEDIR\${SEDdB}VOID_CLOSEDIR\${SEDdC}1\${SEDdD} \${SEDuA}VOID_CLOSEDIR\${SEDuB}VOID_CLOSEDIR\${SEDuC}1\${SEDuD} \${SEDeA}VOID_CLOSEDIR\${SEDeB}VOID_CLOSEDIR\${SEDeC}1\${SEDeD} " } fi rm -fr conftest* echo checking for Xenix cat > conftest.c < conftest.out 2>&1" if egrep "yes" conftest.out >/dev/null 2>&1; then rm -rf conftest* XENIX=1 fi rm -f conftest* if test -n "$XENIX"; then LIBS="$LIBS -lx" case "$DEFS" in *SYSNDIR*) ;; *) LIBS="-ldir $LIBS" ;; # Make sure -ldir precedes any -lx. esac fi echo checking for ANSI C header files cat > conftest.c < #include #include #include EOF err=`eval "($CPP conftest.c >/dev/null) 2>&1"` if test -z "$err"; then rm -rf conftest* # SunOS 4.x string.h does not declare mem*, contrary to ANSI. echo '#include "confdefs.h" #include ' > conftest.c eval "$CPP conftest.c > conftest.out 2>&1" if egrep "memchr" conftest.out >/dev/null 2>&1; then rm -rf conftest* # SGI's /bin/cc from Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. cat > conftest.c < #define ISLOWER(c) ('a' <= (c) && (c) <= 'z') #define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) #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)) exit(2); exit (0); } EOF eval $compile if test -s conftest && (./conftest; exit) 2>/dev/null; then { test -n "$verbose" && \ echo " defining STDC_HEADERS" echo "#define" STDC_HEADERS 1 >> confdefs.h DEFS="$DEFS -DSTDC_HEADERS=1" SEDDEFS="${SEDDEFS}\${SEDdA}STDC_HEADERS\${SEDdB}STDC_HEADERS\${SEDdC}1\${SEDdD} \${SEDuA}STDC_HEADERS\${SEDuB}STDC_HEADERS\${SEDuC}1\${SEDuD} \${SEDeA}STDC_HEADERS\${SEDeB}STDC_HEADERS\${SEDeC}1\${SEDeD} " } fi rm -fr conftest* fi rm -f conftest* fi rm -f conftest* for hdr in assert.h float.h limits.h memory.h pwd.h stdlib.h \ string.h unistd.h do trhdr=HAVE_`echo $hdr | tr '[a-z]./' '[A-Z]__'` echo checking for ${hdr} cat > conftest.c < EOF err=`eval "($CPP conftest.c >/dev/null) 2>&1"` if test -z "$err"; then rm -rf conftest* { test -n "$verbose" && \ echo " defining ${trhdr}" echo "#define" ${trhdr} 1 >> confdefs.h DEFS="$DEFS -D${trhdr}=1" SEDDEFS="${SEDDEFS}\${SEDdA}${trhdr}\${SEDdB}${trhdr}\${SEDdC}1\${SEDdD} \${SEDuA}${trhdr}\${SEDuB}${trhdr}\${SEDuC}1\${SEDuD} \${SEDeA}${trhdr}\${SEDeB}${trhdr}\${SEDeC}1\${SEDeD} " } fi rm -f conftest* done for func in memmove putenv do trfunc=HAVE_`echo $func | tr '[a-z]' '[A-Z]'` echo checking for ${func} cat > conftest.c < int main() { exit(0); } int t() { /* 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_${func}) || defined (__stub___${func}) choke me #else /* Override any gcc2 internal prototype to avoid an error. */ extern char ${func}(); ${func}(); #endif } EOF if eval $compile; then rm -rf conftest* { test -n "$verbose" && \ echo " defining ${trfunc}" echo "#define" ${trfunc} 1 >> confdefs.h DEFS="$DEFS -D${trfunc}=1" SEDDEFS="${SEDDEFS}\${SEDdA}${trfunc}\${SEDdB}${trfunc}\${SEDdC}1\${SEDdD} \${SEDuA}${trfunc}\${SEDuB}${trfunc}\${SEDuC}1\${SEDuD} \${SEDeA}${trfunc}\${SEDeB}${trfunc}\${SEDeC}1\${SEDeD} " } fi rm -f conftest* done # It would be nicer to test for the requisite putenv features directly, # but can't figure out how to do that. if test "`(uname) 2>/dev/null`" = NetBSD \ || test "`(uname) 2>/dev/null`" = FreeBSD; then { test -n "$verbose" && \ echo " defining SMART_PUTENV" echo "#define" SMART_PUTENV 1 >> confdefs.h DEFS="$DEFS -DSMART_PUTENV=1" SEDDEFS="${SEDDEFS}\${SEDdA}SMART_PUTENV\${SEDdB}SMART_PUTENV\${SEDdC}1\${SEDdD} \${SEDuA}SMART_PUTENV\${SEDuB}SMART_PUTENV\${SEDuC}1\${SEDuD} \${SEDeA}SMART_PUTENV\${SEDeB}SMART_PUTENV\${SEDeC}1\${SEDeD} " } fi prog='/* Ultrix mips cc rejects this. */ typedef int charset[2]; const charset x; /* SunOS 4.1.1 cc rejects this. */ char const *const *ccp; char **p; /* AIX XL C 1.02.0.0 rejects this. It does not let you subtract one const X* pointer from another in an arm of an if-expression whose if-part is not a constant expression */ const char *g = "string"; ccp = &g + (g ? g-g : 0); /* HPUX 7.0 cc rejects these. */ ++ccp; p = (char**) ccp; ccp = (char const *const *) p; { /* SCO 3.2v4 cc rejects this. */ char *t; char const *s = 0 ? (char *) 0 : (char const *) 0; *t++ = 0; } { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ int x[] = {25,17}; const int *foo = &x[0]; ++foo; } { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ typedef const int *iptr; iptr p = 0; ++p; } { /* AIX XL C 1.02.0.0 rejects this saying "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ struct s { int j; const int *ap[3]; }; struct s *b; b->j = 5; } { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ const int foo = 10; }' echo checking for lack of working const cat > conftest.c <> confdefs.h DEFS="$DEFS -Dconst=" SEDDEFS="${SEDDEFS}\${SEDdA}const\${SEDdB}const\${SEDdC}\${SEDdD} \${SEDuA}const\${SEDuB}const\${SEDuC}\${SEDuD} \${SEDeA}const\${SEDeB}const\${SEDeC}\${SEDeD} " } fi rm -f conftest* # Any assignment to VPATH causes various Sun make's (both SunOS and # Solaris) to only execute the first set of double-colon rules, as in # the following 5-line Makefile. Since we use :: rules for distclean and # other important targets, we just remove the VPATH lines if they # defined it to be simply `.'. # VPATH = foo # target:: # echo first # target:: # echo second # The line we're matching here is # VPATH = # with arbitrary spaces and tabs around each of the elements. if test x$srcdir = x.; then extrasub='/^[ ]*VPATH[ ]*=[ ]*/d' fi # Set default prefixes. if test -n "$prefix"; then test -z "$exec_prefix" && exec_prefix='${prefix}' prsub="s%^prefix\\([ ]*\\)=\\([ ]*\\).*$%prefix\\1=\\2$prefix%" fi if test -n "$exec_prefix"; then prsub="$prsub s%^exec_prefix\\([ ]*\\)=\\([ ]*\\).*$%exec_prefix\\1=\\2$exec_prefix%" fi # Quote sed substitution magic chars in DEFS. cat >conftest.def < config.status </dev/null | sed 1q`: # # $0 $configure_args for arg do case "\$arg" in -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) echo running \${CONFIG_SHELL-/bin/sh} $0 $configure_args exec \${CONFIG_SHELL-/bin/sh} $0 $configure_args ;; *) echo "Usage: config.status --recheck" 2>&1; exit 1 ;; esac done trap 'rm -fr ./Makefile c-auto.h conftest*; exit 1' 1 3 15 CC='$CC' CPP='$CPP' INSTALL='$INSTALL' INSTALL_PROGRAM='$INSTALL_PROGRAM' INSTALL_DATA='$INSTALL_DATA' RANLIB='$RANLIB' LIBS='$LIBS' srcdir='$srcdir' prefix='$prefix' exec_prefix='$exec_prefix' prsub='$prsub' extrasub='$extrasub' EOF cat >> config.status <<\EOF top_srcdir=$srcdir CONFIG_FILES=${CONFIG_FILES-"./Makefile"} for file in .. ${CONFIG_FILES}; do if test "x$file" != x..; then srcdir=$top_srcdir # Remove last slash and all that follows it. Not all systems have dirname. dir=`echo $file|sed 's%/[^/][^/]*$%%'` if test "$dir" != "$file"; then test "$top_srcdir" != . && srcdir=$top_srcdir/$dir test ! -d $dir && mkdir $dir fi echo creating $file rm -f $file echo "# Generated automatically from `echo $file|sed 's|.*/||'`.in by configure." > $file sed -e " $prsub $extrasub s%@CC@%$CC%g s%@CPP@%$CPP%g s%@INSTALL@%$INSTALL%g s%@INSTALL_PROGRAM@%$INSTALL_PROGRAM%g s%@INSTALL_DATA@%$INSTALL_DATA%g s%@RANLIB@%$RANLIB%g s%@LIBS@%$LIBS%g s%@srcdir@%$srcdir%g s%@DEFS@%-DHAVE_CONFIG_H%" $top_srcdir/${file}.in >> $file fi; done CONFIG_HEADERS=${CONFIG_HEADERS-"c-auto.h"} for file in .. ${CONFIG_HEADERS}; do if test "x$file" != x..; then echo creating $file # These sed commands are put into SEDDEFS when defining a macro. # They are broken into pieces to make the sed script easier to manage. # They are passed to sed as "A NAME B NAME C VALUE D", where NAME # is the cpp macro being defined and VALUE is the value it is being given. # Each defining turns into a single global substitution command. # # SEDd sets the value in "#define NAME VALUE" lines. SEDdA='s@^\([ ]*\)#\([ ]*define[ ][ ]*\)' SEDdB='\([ ][ ]*\)[^ ]*@\1#\2' SEDdC='\3' SEDdD='@g' # SEDu turns "#undef NAME" with trailing blanks into "#define NAME VALUE". SEDuA='s@^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' SEDuB='\([ ]\)@\1#\2define\3' SEDuC=' ' SEDuD='\4@g' # SEDe turns "#undef NAME" without trailing blanks into "#define NAME VALUE". SEDeA='s@^\([ ]*\)#\([ ]*\)undef\([ ][ ]*\)' SEDeB='$@\1#\2define\3' SEDeC=' ' SEDeD='@g' rm -f conftest.sed EOF # Turn off quoting long enough to insert the sed commands. rm -f conftest.sh cat > conftest.sh < conftest.s1 # Like head -20. sed 1,${maxshlines}d conftest.sh > conftest.s2 # Like tail +21. # Write a limited-size here document to append to conftest.sed. echo 'cat >> conftest.sed <> config.status cat conftest.s1 >> config.status echo 'CONFEOF' >> config.status rm -f conftest.s1 conftest.sh mv conftest.s2 conftest.sh done rm -f conftest.sh # Now back to your regularly scheduled config.status. cat >> config.status <<\EOF # This sed command replaces #undef's 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 in # c-auto.h. cat >> conftest.sed <<\CONFEOF s,^[ ]*#[ ]*undef[ ][ ]*[a-zA-Z_][a-zA-Z_0-9]*,/* & */, CONFEOF rm -f conftest.h # Break up the sed commands because old seds have small limits. maxsedlines=20 cp $top_srcdir/$file.in conftest.h1 while : do lines=`grep -c . conftest.sed` if test -z "$lines" || test "$lines" -eq 0; then break; fi rm -f conftest.s1 conftest.s2 conftest.h2 sed ${maxsedlines}q conftest.sed > conftest.s1 # Like head -20. sed 1,${maxsedlines}d conftest.sed > conftest.s2 # Like tail +21. sed -f conftest.s1 < conftest.h1 > conftest.h2 rm -f conftest.s1 conftest.h1 conftest.sed mv conftest.h2 conftest.h1 mv conftest.s2 conftest.sed done rm -f conftest.sed conftest.h echo "/* $file. Generated automatically by configure. */" > conftest.h cat conftest.h1 >> conftest.h rm -f conftest.h1 if cmp -s $file conftest.h 2>/dev/null; then # The file exists and we would not be changing it. echo "$file is unchanged" rm -f conftest.h else rm -f $file mv conftest.h $file fi fi; done exit 0 EOF chmod +x config.status ${CONFIG_SHELL-/bin/sh} config.status octave-1.1.0/kpathsea/.gdbinit100666 415 17 33 5404657545 14332 0ustar jweusersdefine redo file a.out end octave-1.1.0/kpathsea/HIER100666 415 17 13423 5637135102 13436 0ustar jweusersHere is the installed TeX & Metafont hierarchy (as of 31dec93) that we have been working on. Please send comments to mackay@cs.washington.edu, unixtex@u.washington.edu, and kb@cs.umb.edu. (Especially if you try to actually install TeX like this!) First, pick a root directory for the library files: TEXMFROOT = /usr/local/lib/texmf (Or, in make variable terms: $(datadir)/texmf.) All the files are installed relative to $TEXMFROOT. Top-level directories: bibtex -- see below fonts for these tex three mf -- utility MF sources ({plain, expr, null, io, slant, modes, ...}.mf) ini -- .base, .fmt, .pool dvips -- only if you have a PostScript printer, naturally In general, where possible, the same setup as ctan is clearly a win. Under bibtex: bib (xampl.bib & some of Nelson's bib files) bst (at least standard and semi-standard) doc (btxbst.doc, btxdoc.*, btxhak.tex) Under dvips, have the .pro/.ps/psfonts.map files. Under tex, at least: plain ({plain, manmac, null, plain, story, testfont, webmac}.tex, perhaps also texinfo.tex, eplain.tex, other single-file sources) latex (with subdirectories base/ for M&S's files, and contrib/ for other people's styles) tugboat (tugboat.cmn, tugboat.sty, etc.) mft (*.mft) Also under tex/ would go many other things: dvips (rotate.tex, epsf.sty, etc.) texdraw musictex ... Having a whole separate tree for the utility MF sources seems pointless, since there are so few of them. Most .mf files go under fonts/. Under fonts: // for in public, adobe, ams, bitstream, urw, ... for public/ in cm, concrete, punk, ... for ams/ in euler, msym, ... for adobe/ in times, palatino, avantgarde, ... Under .../// src/*.mf tfm/*.tfm vf/*.vf afm/*.afm pk/$MAKETEX_MODE (including pseudo-modes for gsrenderfont, pstopk, gsftopk) type1/*.{pfa,pfb,gsf} truetype/whatever For example: /usr/local/lib/texmf/fonts/public/cm/pk/cx/cmr10.300pk /usr/local/lib/texmf/fonts/public/sauter/src/b-cmbx.mf /usr/local/lib/texmf/fonts/adobe/utopia/type1/putr.pfa All the names which can be matched by the paths you actually use need to be unique. If you have two 300dpi devices, say `cx' and `qms', you can set their PK paths for dvips in their printer-specific configuration file. Conceivably you could instead make the default path include `$MAKETEX_MODE' (kpathsea sets this as it runs), but I'm not quite sure what all the ramifications of that are. Here are default variable values that go with the above: TEXMFROOT = /usr/local/lib/texmf % Read all relevant configuration files along this path, not just the first. TEXCONFIG = .:~:$TEXMFROOT % Although it's pointless to search the adobe, bitstream, etc. directories % for Metafont sources, we want at least ams/ and public/, and unknown others. MFINPUTS = .:$TEXMFROOT/mf:$TEXMFROOT/fonts//src// TEXINPUTS = .:$TEXMFROOT/tex// TEXFORMATS = .:$TEXMFROOT/ini MFBASES = .:$TEXMFROOT/ini TEXPOOL = .:$TEXMFROOT/ini MFPOOL = .:$TEXMFROOT/ini % Fonts for everyone. TFMFONTS = .:$TEXMFROOT/fonts//tfm VFFONTS = .:$TEXMFROOT/fonts//vf PKFONTS = .:$TEXMFROOT/fonts//pk// % .bib and .bst files. BIBINPUTS = .:$TEXMFROOT/bibtex/bib BSTINPUTS = .:$TEXMFROOT/bibtex/bst % PostScript prologues and downloadable fonts. PSHEADERS = .:$TEXMFROOT/dvips:$TEXMFROOT/fonts//type1 From mackay@cs.washington.edu Wed Dec 29 16:27:02 1993 Date: Wed, 29 Dec 1993 13:27:08 -0800 From: mackay@cs.washington.edu (Pierre MacKay) Subject: Directory tree # The write-black, bitmapped type1 and write-white choices at this site set WB=cx set WW=ricoh set BM=ps-to-pk # # use the ${} variable form throughout---it saves grief. # set USRLOCAL=/usr2/local set TEXMFRT=${USRLOCAL}/lib/texmf setenv TEXROOT ${TEXMFRT}/tex setenv TEXFONTS .:${TEXROOT}/fonts// setenv TEXINPUTS .:${TEXROOT}/inputs// setenv TEXFORMATS .:${TEXROOT}/formats setenv TEXPOOL ${TEXFORMATS} setenv MFROOT ${TEXMFRT}/mf setenv MFINPUTS .:${MFROOT}/inputs:${TEXROOT}/fonts/public//src setenv MFBASES ${MFROOT}/bases setenv MFPOOL ${MFBASES}/bases # The 00[TFM.VF,XDVI] directories are "accelerators" where links # to files that are in extremely frequent use are placed. # # The 00PK directory is where MakeTeXPK stores its # output. It must therefore be in both XDVI and DVIPS paths. # It can also be used as an "accelerator" directory for # links to frequently used PK files. But don't store write-white # fonts there unless you are unlucky enough to have a write-white # printer. # # XDVIFONTS takes write-white fonts from the ricoh set # but since we don't have to worry about write-white printers # any more, the ricoh directories contain only resolutions # below 360 dpi. Above that it doesn't really matter very much # when all you are concerned with is screen preview. # Don't leave out the ${BM} part of the XDVI path if type1 # fonts are in use. # NOTE: Locally, if we decide to use MakeTeXPK at all with XDVI, # we will set it to produce fonts for the hardcopy printer only setenv TFMFONTS .:${TEXROOT}/fonts/00TFM:${TEXROOT}/fonts//tfm setenv VFFONTS .:${TEXROOT}/fonts/00VF:${TEXROOT}/fonts//vf setenv XDVIFONTS .:${TEXROOT}/fonts/00XDVI:${TEXROOT}/fonts/00PK:${TEXROOT}/fonts//${WW}:${TEXROOT}/fonts//${BM}:${TEXROOT}//${WB} setenv DVIPSFONTS .:${TEXROOT}/fonts/00PK:${TEXROOT}//${WB} setenv PKFONTS $DVIPSFONTS setenv TEXPKS $DVIPSFONTS This sets up the common root "texmf" for both TEXROOT and MFROOT, but puts both TEXROOT and MFROOT into the environment. Saves much typing. [TEX,MF]POOL really don't need a separate path, since it is only in a run of ini[tex,mf] that they are ever likely to be needed. So TEXFORMATS and MFBASES is the obvious place. For BM I have changed from the specific "ps2pk" to a more general "ps-to-pk" because I sometimes find that pfb2mf->METAFONT->pk works better than ps2pk for a screen image. octave-1.1.0/kpathsea/copying.texi100666 415 17 43616 5375557115 15351 0ustar jweusers@node Copying @appendix GNU GENERAL PUBLIC LICENSE @center Version 2, June 1991 @display Copyright @copyright{} 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @end display @unnumberedsec 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. @iftex @unnumberedsec TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end iftex @ifinfo @center TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end ifinfo @enumerate @item 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. @item 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. @item 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: @enumerate a @item You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. @item 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. @item 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.) @end enumerate 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. @item 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: @enumerate a @item 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, @item 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, @item 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.) @end enumerate 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. @item 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. @item 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. @item 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. @item 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. @item 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. @item 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. @item 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. @iftex @heading NO WARRANTY @end iftex @ifinfo @center NO WARRANTY @end ifinfo @item 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. @item 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 enumerate @iftex @heading END OF TERMS AND CONDITIONS @end iftex @ifinfo @center END OF TERMS AND CONDITIONS @end ifinfo @page @unnumberedsec Appendix: 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. @smallexample @var{one line to give the program's name and a brief idea of what it does.} Copyright (C) 19@var{yy} @var{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., 675 Mass Ave, Cambridge, MA 02139, USA. @end smallexample 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: @smallexample Gnomovision version 69, Copyright (C) 19@var{yy} @var{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. @end smallexample The hypothetical commands @samp{show w} and @samp{show c} should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than @samp{show w} and @samp{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: @example Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. @var{signature of Ty Coon}, 1 April 1989 Ty Coon, President of Vice @end example 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. octave-1.1.0/kpathsea/freedom.texi100666 415 17 24440 5375510257 15310 0ustar jweusers@c Copyright (C) 1992 Karl Berry. @c For copying conditions, see the file copying.texi. @node Freedom @appendix Regain your programming freedom @cindex freedom, programming Until a few years ago, programmers in the United States could write any program they wished. This freedom has now been taken away by two developments: software patents, which grant the patent holder an absolute monopoly on some programming technique, and user interface copyright, which forbid compatible implementations of an existing user interface. In Europe, especially through the GATT treaty, things are rapidly approaching the same pass. @menu * Software patents:: Algorithm monopolies. * User interface copyright:: Forbidding upward-compatibility. * What to do?:: What to do? @end menu @node Software patents, User interface copyright, , Freedom @section Software patents @cindex patents, software @cindex software patents The U.S. Patent and Trademark Office has granted numerous software patents on software techniques. Patents are an absolute monopoly---independent reinvention is precluded. This monopoly lasts for seventeen years, i.e., forever (with respect to computer science). One patent relevant to @TeX{} is patent 4,956,809, issued to the Mark Williams company on September 11, 1990, applied for in 1982, which covers (among other things) @quotation representing in a standardized order consisting of a standard binary structure file stored on auxiliary memory or transported on a communications means, said standardized order being different from a different order used on at least one of the different computers; Converting in each of the different computers binary data read from an auxiliary data storage or communications means from the standardized order to the natural order of the respective host computer after said binary data are read from said auxiliary data storage or communications means and before said binary data are used by the respective host computer; and Converting in each of the different computers binary data written into auxiliary data storage or communications means from the natural order of the respective host computer to the standardized order prior to said writing. @end quotation @noindent @dots{} in other words, storing data on disk in a machine-independent order, as the DVI, TFM, GF, and PK file formats specify. Even though @TeX{} is ``prior art'' in this respect, the patent was granted (the patent examiners not being computer scientists, even less computer typographers). Since there is a strong presumption in the courts of a patent's validity once it has been granted, there is a good chance that users or implementors of @TeX{} could be successfully sued on the issue. As another example, the X window system, which was intended to be able to be used freely by everyone, is now being threatened by two patents: 4,197,590 on the use of exclusive-or to redraw cursors, held by Cadtrak, a litigation company (this has been upheld twice in court); and 4,555,775, held by AT&T, on the use of backing store to redraw windows quickly. Here is one excerpt from a recent mailing by the League for Programming Freedom (@pxref{What to do?}) which I feel sums up the situation rather well. It comes from an article in @cite{Think} magazine, issue #5, 1990. The comments after the quote were written by Richard Stallman. @quotation ``You get value from patents in two ways,'' says Roger Smith, IBM Assistant General Counsel, intellectual property law. ``Through fees, and through licensing negotiations that give IBM access to other patents. ``The IBM patent portfolio gains us the freedom to do what we need to do through cross-licensing---it gives us access to the inventions of others that are the key to rapid innovation. Access is far more valuable to IBM than the fees it receives from its 9,000 active patents. There's no direct calculation of this value, but it's many times larger than the fee income, perhaps an order of magnitude larger.'' @end quotation This information should dispel the belief that the patent system will ``protect'' a small software developer from competition from IBM. IBM can always find patents in its collection which the small developer is infringing, and thus obtain a cross-license. However, the patent system does cause trouble for the smaller companies which, like IBM, need access to patented techniques in order to do useful work in software. Unlike IBM, the smaller companies do not have 9,000 patents and cannot usually get a cross-license. No matter how hard they try, they cannot have enough patents to do this. Only the elimination of patents from the software field can enable most software developers to continue with their work. The value IBM gets from cross-licensing is a measure of the amount of harm that the patent system would do to IBM if IBM could not avoid it. IBM's estimate is that the trouble could easily be ten times the good one can expect from one's own patents---even for a company with 9,000 of them. @node User interface copyright, What to do?, Software patents, Freedom @section User interface copyright @cindex rms @cindex user interface copyright @cindex interface copyright (This section is copied from the GCC manual, by Richard Stallman.) @quotation @i{This section is a political message from the League for Programming Freedom to the users of the GNU font utilities. It is included here as an expression of support for the League on my part.} @end quotation Apple, Lotus and Xerox are trying to create a new form of legal monopoly: a copyright on a class of user interfaces. These monopolies would cause serious problems for users and developers of computer software and systems. Until a few years ago, the law seemed clear: no one could restrict others from using a user interface; programmers were free to implement any interface they chose. Imitating interfaces, sometimes with changes, was standard practice in the computer field. The interfaces we know evolved gradually in this way; for example, the Macintosh user interface drew ideas from the Xerox interface, which in turn drew on work done at Stanford and SRI. 1-2-3 imitated VisiCalc, and dBase imitated a database program from JPL. Most computer companies, and nearly all computer users, were happy with this state of affairs. The companies that are suing say it does not offer ``enough incentive'' to develop their products, but they must have considered it ``enough'' when they made their decision to do so. It seems they are not satisfied with the opportunity to continue to compete in the marketplace---not even with a head start. If Xerox, Lotus, and Apple are permitted to make law through the courts, the precedent will hobble the software industry: @itemize @bullet @item Gratuitous incompatibilities will burden users. Imagine if each car manufacturer had to arrange the pedals in a different order. @item Software will become and remain more expensive. Users will be ``locked in'' to proprietary interfaces, for which there is no real competition. @item Large companies have an unfair advantage wherever lawsuits become commonplace. Since they can easily afford to sue, they can intimidate small companies with threats even when they don't really have a case. @item User interface improvements will come slower, since incremental evolution through creative imitation will no longer be permitted. @item Even Apple, etc., will find it harder to make improvements if they can no longer adapt the good ideas that others introduce, for fear of weakening their own legal positions. Some users suggest that this stagnation may already have started. @item If you use GNU software, you might find it of some concern that user interface copyright will make it hard for the Free Software Foundation to develop programs compatible with the interfaces that you already know. @end itemize @node What to do?, , User interface copyright, Freedom @section What to do? (This section is copied from the GCC manual, by Richard Stallman.) To protect our freedom from lawsuits like these, a group of programmers and users have formed a new grass-roots political organization, the League for Programming Freedom. The purpose of the League is to oppose new monopolistic practices such as user-interface copyright and software patents; it calls for a return to the legal policies of the recent past, in which these practices were not allowed. The League is not concerned with free software as an issue, and not affiliated with the Free Software Foundation. The League's membership rolls include John McCarthy, inventor of Lisp, Marvin Minsky, founder of the Artificial Intelligence lab, Guy L. Steele, Jr., author of well-known books on Lisp and C, as well as Richard Stallman, the developer of GNU CC. Please join and add your name to the list. Membership dues in the League are $42 per year for programmers, managers and professionals; $10.50 for students; $21 for others. The League needs both activist members and members who only pay their dues. To join, or for more information, phone (617) 492-0023 or write to: @display League for Programming Freedom 1 Kendall Square #143 P.O. Box 9171 Cambridge, MA 02139 @end display You can also send electronic mail to @code{league@@prep.ai.mit.edu}. Here are some suggestions from the League for things you can do to protect your freedom to write programs: @itemize @bullet @item Don't buy from Xerox, Lotus or Apple. Buy from their competitors or from the defendants they are suing. @item Don't develop software to work with the systems made by these companies. @item Port your existing software to competing systems, so that you encourage users to switch. @item Write letters to company presidents to let them know their conduct is unacceptable. @item Tell your friends and colleagues about this issue and how it threatens to ruin the computer industry. @item Above all, don't work for the look-and-feel plaintiffs, and don't accept contracts from them. @item Write to Congress to explain the importance of this issue. @display House Subcommittee on Intellectual Property 2137 Rayburn Bldg Washington, DC 20515 Senate Subcommittee on Patents, Trademarks and Copyrights United States Senate Washington, DC 20510 @end display (These committees have received lots of mail already; let's give them even more.) @end itemize Express your opinion! You can make a difference. octave-1.1.0/kpathsea/PROJECTS100666 415 17 1356 5637135104 14124 0ustar jweusersHere are some ideas for improvements. If you would like to contribute, please send mail to me (kb@cs.umb.edu) first. Make KPATHSEA_BITMAP_NAME allow both cmr10.NNNpk and dpiNNN/cmr10.pk. Configuration files so, e.g., $TEXMFROOT can get evaluated at runtime. Make default paths have $TEXMFROOT -- means have to have some way to set the default for that at compilation, unless config files will do? Don't call init_path at every lookup. (See end of tex-file.h.) cd during filesystem operations, to minimize the pathname length constant. Separate the routines needed for path searching, and others that are here only because it's a common place -- i.e., a kutil library. Do the right thing if both (e.g.) DVIPSMAKEPK and MAKETEXPK are set. octave-1.1.0/kpathsea/kpathsea.info100666 415 17 240021 5547047347 15472 0ustar jweusersThis is Info file kpathsea.info, produced by Makeinfo-1.55 from the input file kpathsea.texi. This file documents the Kpathsearch library. Copyright (C) 1993, 94 Karl Berry. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the section entitled "Freedom" and "GNU General Public License" are included exactly as in the original, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that the sections entitled "Freedom" and "GNU General Public License" may be included in a translation approved by the Free Software Foundation instead of in the original English.  File: kpathsea.info, Node: Top, Next: Introduction, Prev: (dir), Up: (dir) Kpathsearch library ******************* This manual documents how to install and use the Kpathsearch library for filename lookup. It corresponds to version 1.8 (released in April 1994). * Menu: * Introduction:: A brief overview. * Installation:: Compilation, installation, and bug reporting. * Path specifications:: User interface. * TeX support:: Special support for TeX lookups. * Copying:: Conditions for copying, modifying and sharing. * Freedom:: Regain your programming freedom. * Index:: General index.  File: kpathsea.info, Node: Introduction, Next: Installation, Prev: Top, Up: Top Introduction ************ This manual corresponds to version 1.8 of the Kpathsearch library, released in April 1994. The library's fundamental purpose is to look up a file in a list of directories specified by the user. The following software, all of which I maintain, uses this library: * web2c * Xdvik * Dvipsk (*note Introduction: (dvipsk)Top.) * GNU font utilities (*note Introduction: (fontu)Top.) The library is still under development. I do not promise to keep the interface unchanged. If you have comments or suggestions, please send them to me (*note Bugs::. for the address). Currently, I distribute the library under the GNU General Public License (*note Copying::.). In summary, this means if you write a program using the library, you must (offer to) distribute the source, and allow anyone to modify the source and distribute their modifications. If you have a problem with this, please contact me. I would consider putting the library under the GNU Library General Public License, which would permit you to distribute the source only to the library, not the your program using it. But I will only do this if someone actually says they will not use the library under the GPL conditions, and would use it under the LGPL. This manual contains a few references to the C source for the library; they're there to help programmers reconcile my statements in this documentation with the Awful Truth of the code. If you're not a programmer, just ignore them.  File: kpathsea.info, Node: Installation, Next: Path specifications, Prev: Introduction, Up: Top Installation ************ Here are the basic steps for configuration and installation: 1. `configure'. This automatically determines most system dependencies. 2. If necessary, edit the definitions in `Makefile' or `c-auto.h'. *Note System dependencies::, below, for additional definitions you may need to make. 3. `make'. 4. `make install'. This installs the library, header files, and documentation. 5. `make distclean'. This removes all files created by the build. Since I only distribute Kpathsea as part of another package, you will probably be doing the above in a top-level directory that contains a `Makefile', `kpathsea', and the other package. But you can do the installation in `kpathsea' itself, if you only want to install the library, not the other package. * Menu: * System dependencies:: Definitions you must supply. * configure:: Options and frills for the `configure' script. * Bugs:: Where and how to report bugs.  File: kpathsea.info, Node: System dependencies, Next: configure, Up: Installation System dependencies =================== Although `configure' can reliably determine most aspects of your system, there are a few things you must help it out with. * Menu: * Default paths:: Changing the default paths and installation dirs. * wchar_t:: Working around `wchar_t' problems, e.g., on Linux. * putenv:: For smart putenv implementations, e.g., Net2/BSD.  File: kpathsea.info, Node: Default paths, Next: wchar_t, Up: System dependencies Default paths ------------- The directories into which files are installed are defined in the top-level `Makefile'. The default paths which programs use to search for inputs are defined in `kpathsea/paths.h'. You will almost certainly want to change either or both of these to match your preferred local directory structure. In particular, if you need to support only one output device, the rather deep structure of the default paths is unnecessary. Both of these files are automatically created: the `Makefile' at `configure' time, `kpathsea/paths.h' at `make' time. Thus, to change the default paths, the simplest thing to do is edit the template files `Makefile.in' and `paths.h.in' before running `configure'. The Make definitions are all repeated in several `Makefile''s; but changing the top-level `Makefile' should suffice, as it passes down all the variable definitions, thus overriding the submakes. (The definitions are repeated so you can potentially run Make in the subdirectories.) If you want to include the mode in a particular path, perhaps to distinguish two different devices with the same resolution, use `$MAKETEX_MODE', as in `/usr/local/lib/texmf/fonts//pk/$MAKETEX_MODE'. *Note `MakeTeX'... script arguments: MakeTeX... script arguments. The file `kpathsea/HIER' has some explanation of the default setup. A caveat: If you put `$HOME' or `~' in any of the paths, do not search that component recursively: when you run as root, you might wind up searching (say) `/zoneinfo/Brazil/tex/macros'. And of course it will take quite some time to look at every directory on the system. *Note Filename database::, for a description of an external database that can help speed searches.  File: kpathsea.info, Node: wchar_t, Next: putenv, Prev: Default paths, Up: System dependencies `wchar_t' --------- The upshot of all the following is that if you get error messages regarding `wchar_t', try defining `NO_FOIL_X_WCHAR_T'. This is reported to be necessary on Linux. `wchar_t' has caused infinite trouble. None of my code ever uses `wchar_t'; all I want to do is include X header files and various system header files, compiling with GCC. This seems an impossible task. The X11R5 `' and GCC's `' have conflicting definitions for wchar_t. The particulars: `' from MIT X11R5 defines `wchar_t' if `X_WCHAR' is defined, which is defined if `X_NOT_STDC_ENV' is defined, and we define *that* if `STDC_HEADERS' is not defined (`configure' decides if STDC_HEADERS gets defined). But when compiling with gcc on SunOS 4.1.x, `STDC_HEADERS' is not defined (`string.h' doesn't declare the `mem'* functions), so we do get X's `wchar_t'--and we also get gcc's `wchar_t' from its `'. Result: conflicting definitions. On the other hand, SunOS 4.1.1 with some other X configurations actually needs GCC to define `wchar_t', and fails otherwise. My current theory is to define `wchar_t' to a nonsense symbol before the X include files are read; that way its definition (if any) will be ignored by other system include files. Going along with that, define `X_WCHAR' to tell X not to use `', that we've already included, but instead to make its own definition. But this is not the end of the story. The X11 include files distributed with DG/UX 5.4.2 for the Aviion have been modified to include `<_int_wchar_t.h>' if `X_WCHAR', so our `#define' will not have any typedef to change--but the uses of `wchar_t' in the X include files will be changed to reference this undefined symbol. So there's nothing to foil in this case; I don't know how to detect this automatically, so it's up to you to define `NO_FOIL_X_WCHAR_T' yourself.  File: kpathsea.info, Node: putenv, Prev: wchar_t, Up: System dependencies `putenv' -------- If you are on a Net2/BSD or other system which has a `putenv' that knows how to avoid garbage when the same environment variable is set many times, define `SMART_PUTENV'. (And if you can write a test for this that could be incorporated into the `configure' script, please send it to the address given in *Note Bugs::.)  File: kpathsea.info, Node: configure, Next: Bugs, Prev: System dependencies, Up: Installation The `configure' script ====================== (This section is largely from the Autoconf manual, by David MacKenzie. *Note Running `configure' scripts: (autoconf)Running configure Scripts.) The `configure' script that comes with this distribution was generated by the Autoconf program. Thus, you can regenerate `configure' by rerunning Autoconf. You might want to do this if a new version of Autoconf is released, for example. The purpose of `configure' is to adapt the present source to the particulars of your system. For example, the name of the directory header file (`dirent.h' or `sys/dir.h'), whether the GNU C compiler `gcc' is available, and so on. Normally, you do not need to give any options to `configure'; just `cd' to the directory with the source code and type `configure'. Exceptions: if `.' is not in your `PATH', you must type `./configure'; if you are using a non-Bourne compatible shell on systems that do not support `#!', you must type `sh configure'. Running `configure' takes a minute or two. While it is running, it prints some messages that tell what it is doing. If you don't want to see the messages, run `configure' with its standard output redirected to `/dev/null'; e.g., `configure >/dev/null'. On the other hand, if you want to see even more messages, give `configure' the `-v' option. To compile the package in a different directory from the one containing the source code, you must use a variant 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 `configure' with the option `--srcdir=DIR', where DIR is the directory that contains the source code. Using this option is unnecessary if the source code is in the parent directory of the one in which you are compiling; `configure' automatically checks for the source code in `..' if it does not find it in `.'. `configure' (in the top-level directory) guesses the default installation prefix (we'll call it `$(prefix)', which is the corresponding Make variable) by looking for a directory which contains an executable named `tex', and using its parent. In the package subdirectories, such as `kpathsea', `configure' doesn't try to guess the prefix (to avoid a conflict with the guess made at the top level); the default `/usr/local' is left. You can override this default guess for the installation prefix by giving `configure' the option `--prefix=PATH'. You can also specify separate installation prefixes for architecture-specific files and architecture-independent files by giving `configure' the option `--exec-prefix=XPATH' (which substitutes for the Make variable `$(exec_prefix)'). Then XPATH will be the prefix for installing programs and libraries. Data files and documentation will still use `$(prefix)'. You can tell `configure' to figure out the configuration for your system, and record it in a file `config.status', without actually configuring the package. To do this, give `configure' the `--no-create' option. Later, you can run `./config.status' to actually configure the package. This option is useful mainly in `Makefile' rules for updating `config.status' and the `Makefile' itself. You can also give `config.status' the `--recheck' option, which makes it rerun `configure' with the same arguments you used before. This is useful if you change `configure'. `configure' ignores any other arguments that you give it. On systems that require unusual options for compilation or linking that the package's `configure' script does not know about, you can give `configure' initial values for variables by setting them in the environment. In Bourne-compatible shells, you can do that on the command line like this: CC='gcc -traditional' LIBS=-lposix sh configure The Make variables that you might want to override with environment variables when running `configure' are: (For these variables, any value given in the environment overrides the value that `configure' would choose.) `CC' The C compiler program. The default is `gcc' if that is in your `PATH', `cc' otherwise. `INSTALL' The program to use to install files. The default is `install' if you have it, `cp' otherwise. (For these variables, any value given in the environment is added to the value that `configure' chooses.) `DEFS' Configuration options, in the form `-Dfoo -Dbar...'. `LIBS' Libraries to link with, in the form `-lfoo -lbar...'. Of course, problems requiring manual intervention (e.g., setting these variables) should ideally be fixed by updating either the Autoconf macros or the `configure.in' file for that package.  File: kpathsea.info, Node: Bugs, Prev: configure, Up: Installation Reporting bugs ============== If you encounter problems, report them to `tex-k@cs.umb.edu'. Include the version number of the library, the system you are using, and enough information to reproduce the bug in your report. To get on this mailing list yourself, email `tex-k-request@cs.umb.edu' with a message whose body contains a line subscribe YOU@YOUR.PREFERRED.ADDRESS To avoid wasted effort and time (both mine and yours), I strongly advise applying the principles given in the GNU C manual (*note Reporting Bugs: (gcc)Bugs.) to your bug reports for any software. Please also report bugs in this documentation--not only factual errors, but unclear explanations, typos, wrong fonts, .... When compiling with old C compilers, you may get some warnings about "illegal pointer combinations". These are spurious; ignore them. I decline to clutter up the source with casts to get rid of them. In general, if you have trouble with a system C compiler, I advise trying the GNU C compiler. (And vice versa, unfortunately; but in that case I also recommend reporting a bug to the GCC bug list.)  File: kpathsea.info, Node: Path specifications, Next: TeX support, Prev: Installation, Up: Top Path specifications ******************* This chapter describes the user interface of the path specifications that the Kpathsearch library implements. Conceptually, there are three stages: look in an externally-built database, generating a list of directories in which to search, and finally looking up files using that list. The sections below describe each of these in turn. In the implementation, however, these stages are interleaved--directory lists are only generated as needed for a particular file lookup, and only if a file cannot be found in the pre-existing database, and then they are cached for future lookups. (Analogous to lazy evaluation in programming languages.) This implies that directories that are created *during* the run are not seen. * Menu: * Filename database:: Using an externally-built file to search. * Directory list generation:: Specifying where to search. * File lookups:: Finding files in directory lists.  File: kpathsea.info, Node: Filename database, Next: Directory list generation, Up: Path specifications Filename database ================= Kpathsearch goes to some lengths to minimize disk accesses for searches (*note Subdirectory problems::.). Nevertheless, at installations with hundreds of directories, doing a linear search of each directory for a given file can take some time, depending on the speed of the disk, whether it's NFS-mounted, and so on. Therefore, Kpathsearch can use an externally-built "database" that maps files to directories, thus avoiding the need to search the disk. By convention, the file is named `ls-R', and is located at the root of the TeX installation hierarchy. Presently, one and only one `ls-R' is read; its location is determined at compile-time. You can build the file with the command `ls -R ROOT-DIR >ls-R', if your `ls' produces the right output format (see the section below). GNU `ls', for example, does output in this format. It is probably most useful to do this via `cron', so changes in the installed files will be automatically reflected (albeit with some delay) in the database. Because the database may be out-of-date for a particular run (if a font was just built with `MakeTeXPK', for example), if a file is not found in the database, by default Kpathsearch goes ahead and searches the disk. If a given path element begins with `%%', however, *only* the database will be searched; the disk is never searched. (If the database does not exist, nothing will be searched.) Because this can lead to great surprise on the part of users ("I see the font `foo.tfm' when I do an `ls'; why can't Dvips find it?"), I recommend using this only as a last resort. * Menu: * Database format:: Precise details of the database.  File: kpathsea.info, Node: Database format, Up: Filename database Database format --------------- The "database" read by Kpathsearch is a line-oriented file of plain text. The format is that generated by GNU (and perhaps other) `ls' programs given the `-R' option, as follows. Blank lines are ignored. If a line begins with `/' and ends with a colon, it's the name of a directory. All other lines name entries in the most recently seen directory `/''s in such lines will yield possibly-strange results. Files listed with no preceding directory are ignored. For example, here's the first few lines of `ls-R' on my system: bibtex dvips fonts ini ls-R mf tex /usr/local/lib/texmf/bibtex: bib bst doc /usr/local/lib/texmf/bibtex/bib: asi.bib bibshare btxdoc.bib  File: kpathsea.info, Node: Directory list generation, Next: File lookups, Prev: Filename database, Up: Path specifications Directory list generation ========================= Kpathsearch constructs a directory list from an environment variable VAR set by the user, (possibly) a setting from a configuration file, and a default path set at compile time. Each of these are colon-separated lists of directories. If VAR is set, its value is used; otherwise, if a config file defines a value, that value is used; otherwise, the compilation default is used. In any case, once the path specification to use is determined, its evaluation is independent of its source. The "colon" and "slash" mentioned below aren't necessarily `:' and `/' on non-Unix systems; the library tries to adapt these characters to other operating systems' conventions. The following subdirectories explain the various kinds of "expansion" the path is subjected to. After expansion, nonexistent directories in the path is ignored. * Menu: * Default expansion:: Extra colons expand to the compilation default. * Tilde expansion:: ~ and ~user expand to home directories. * Variable expansion:: $foo and ${foo} expand to environment values. * Subdirectory expansion:: a// and a//b recursively expand to subdirs. * Path specification example:: An example.  File: kpathsea.info, Node: Default expansion, Next: Tilde expansion, Up: Directory list generation Default expansion ----------------- If an environment variable or config file value has a leading or trailing or doubled colon, the default path is inserted at that point. Putting an extra colon into the default value has unpredictable results, and may cause the program to crash, so installers beware.  File: kpathsea.info, Node: Tilde expansion, Next: Variable expansion, Prev: Default expansion, Up: Directory list generation Tilde expansion --------------- A leading `~' or `~USER' in a path component is replaced by the current or USER's home directory, respectively. If USER is invalid, or the home directory cannot be determined, Kpathsea uses `.' instead.  File: kpathsea.info, Node: Variable expansion, Next: Subdirectory expansion, Prev: Tilde expansion, Up: Directory list generation Variable expansion ------------------ A construct `$foo' or `${foo}' is replaced by the expansion of the environment variable `foo'. In the first case, the variable name consists of consecutive alphanumeric-or-underscore characters. In the second, the variable name consists of everything between the braces. Remember to quote the `$''s and braces as necessary for your shell. *Shell* variable values cannot be seen by Kpathsea.  File: kpathsea.info, Node: Subdirectory expansion, Next: Path specification example, Prev: Variable expansion, Up: Directory list generation Subdirectory expansion ---------------------- If a component directory D contains `//', all subdirectories of D are included in the path: first those subdirectories directly under D, then the subsubdirectories under those, and so on. At each level, the order in which the directories are searched is unspecified. If you specify any filename components after the `//', only subdirectories which have those components are included. For example, `/a//b' would expand into directories `/a/1/b', `/a/2/b', `/a/1/1/b', and so on, but not `/a/b/c' or `/a/1'. * Menu: * Subdirectory problems:: If you have trouble with subdirectories.  File: kpathsea.info, Node: Subdirectory problems, Up: Subdirectory expansion Subdirectory problems ..................... Perhaps the first problem is best put as a question-and-answer. Question: I know all about slow starting TeX `:-)'. How do I organize the directory scheme to avoid the slowness, while at the same time enjoying a structured inputs directory? (Naturally, this applies to any Kpathsea-using program, not just TeX.) I will give the false Short Answer first, then the Real Explanation. The Short Answer: in your equivalent of `/usr/local/lib/tex/macros//' and `.../fonts//', make each subdirectory contain either 1) only directories; or 2) only files. As long as you do not have (literally) hundreds of subdirectories, this should cure the problem. It has in every case I have been told about. The Real Explanation: the thing that makes TeX slow is calling `stat' (if you don't know what `stat' (2) is, ignore this explanation) on "too many" pathnames, where "too many" is some nebulous number depending on things like whether the filesystem is NFS-mounted or not, whether it's on a fast disk, whether your Fast File System implementation is really Fast, etc., etc. (Side note: If you're curious, you can find this number by writing a program that does nothing but read filenames (presumably from a file) and stat them, and see how many pathnames make the execution time noticeable. On the systems I use (Suns with an NFS-mounted directory, ISC 2.2.1 and a local directory), it's several hundred, at least. On an NFS-mounted directory under Solaris 2.1, 150 is quite slow, according to `hammer@kis.uni-freiburg.de'.) Whether or not it's directories or files that are being stat-ed is irrelevant (this is why the Short Answer is false). It's sheer numbers that count. If you think your directory structure is ok, and you're still experiencing slowness, I advise running TeX (or whatever program) under a debugger, setting the bit `DEBUG_STAT' in the variable `kpathsea_debug' (see `debug.h') to one and seeing exactly what is getting stat-ed. If only few things are getting stat-ed, and TeX is still slow, tell me. I should also mention "the trick", which I stole from GNU find. (Matthew Farwell `' suggested it, and David MacKenzie `' implemented it, as far as I know.) The trick is that in every real Unix implementation (that I know about) (as opposed to the POSIX specification), a directory which contains no subdirectories will have exactly two links (specifically, one each for `.' and `..'). That is to say, the `st_nlink' field in the stat structure will be two. Thus, the path searching code doesn't have to stat every entry in the bottom-level directories--it can check `st_nlink', and if it's two, it knows there are no subdirectories. But if you have a directory that contains *one* subdirectory and five hundred files, `st_nlink' will be 3, and Kpathsea has to stat every one of those 501 entries. Therein lies slowness. You can disable the trick by undefining UNIX_`ST_LINK' in `kpathsea/config.h'. The subdirectory searching has one other known (and irreconciliable) deficiency. If a directory D being searched for subdirectories contains plain files and symbolic links to other directories, but no true subdirectories, D will be considered a leaf directory, i.e., the symbolic links will not be followed. The directory immediately followed by the `//', however, is always searched for subdirectories, even if it is a "leaf". We do this since presumably you would not have asked for the directory to be searched for subdirectories if you didn't want it to be. This is a consequence of the trick explained above. You can work around this problem by creating an empty dummy subdirectory in D; then D will no longer be a leaf, and the symlinks will be followed.  File: kpathsea.info, Node: Path specification example, Prev: Subdirectory expansion, Up: Directory list generation Path specification example -------------------------- For example, the following value for an environment variable says to search the following: the current user's `fonts' directory and alll its subdirectories, then the directory `fonts' in user `karl's home directory, and finally the system default directories specified at compilation time. ~/fonts//:~karl/fonts:  File: kpathsea.info, Node: File lookups, Prev: Directory list generation, Up: Path specifications File lookups ============ Given the directory list generated from the rules in the previous section, looking up a file presents no problem at all: we just look in each directory in the list in turn, and return the first one found. The only complication is if the filename is absolute or explicitly relative, i.e., (under Unix-like operating systems) starts with `/' or `./' or `../'. Then the library does not use the directory list at all. Instead, the file is simply searched for in the given directory. In an attempt to speed lookups, the directory in which a file is found is floated to the top of the directory list. This helps in the common case of several files in the same directory being searched for.  File: kpathsea.info, Node: TeX support, Next: Copying, Prev: Path specifications, Up: Top TeX support *********** Although the basic features in Kpathsea can be used for any type of path searching, I wrote Kpathsea specifically for TeX system programs. I had been struggling with the programs I was using (Dvips, Xdvi, and TeX itself) having slightly different notions of how to specify paths; and debugging was painful, since no code was shared. Therefore, Kpathsea provides some TeX-specific features. Indeed, many of the supposedly generic path searching features were provided because it seemed useful in conTeXt, particularly for font lookup. * Menu: * Envvars: TeX environment variables. Overriding compiled-in paths. * Glyph lookup:: Searching for bitmap fonts.  File: kpathsea.info, Node: TeX environment variables, Next: Glyph lookup, Up: TeX support TeX environment variables ========================= Kpathsea defines a sequence of environment variables to search for each type of TeX file. This makes it easy for different programs to check the same environment variables, in the same order. The following table lists the environment variables searched for each file type in the order they are searched (and a brief description of the file type). That is, only if the first variable is unset is the second variable checked, and so on. If none are set, a default set at compilation time is used. `.base' (Metafont memory dump) `MFBASES' `.bib' (BibTeX source) `BIBINPUTS' `.bst' (BibTeX style file) `BSTINPUTS', `TEXINPUTS' `.fmt' (TeX memory dump) `TEXFORMATS' `gf' (generic font bitmap) `GFFONTS', `GLYPHFONTS', `TEXFONTS' `.mf' (Metafont source) `MFINPUTS' `mf.pool' (Metafont program strings) `MFPOOL' `pk' (packed bitmap font) `PKFONTS', `TEXPKS', `GLYPHFONTS', `TEXFONTS' `.tex' (TeX source) `TEXINPUTS' `tex.pool' (TeX program strings) `TEXPOOL' `.tfm' (TeX font metrics) `TFMFONTS', `TEXFONTS' `.vf' (virtual font) `VFFONTS', `TEXFONTS' These lists are defined in the source file `kpathsea/filefmt.h'. For the font variables, the intent is that: 1. `TEXFONTS' is the default for everything. 2. `GLYPHFONTS' the default for bitmap (or, more precisely, non-metric) files. 3. Each format has its own variable. 4. Not shown in the table is that each program can and should have its own path as well--`XDVIFONTS' and `DVIPSFONTS' in the case of Xdvik and Dvipsk.  File: kpathsea.info, Node: Glyph lookup, Prev: TeX environment variables, Up: TeX support Glyph lookup ============ Kpathsea provides a routine (`kpse_find_glyph_format' in `kpathsea/tex-glyph.c') which searches for a bitmap font in GF or PK format (or either) given a font name (e.g., `cmr10') and a resolution (e.g., 300). The search is based solely on filenames, not file contents--if a PK file is named `cmr10.300gf', it will be found as a GF file. Here is an outline of the search strategy (details in the sections below) for a file NAME at resolution DPI. The search stops at the first successful lookup. 1. Look for an existing file NAME.DPI in the specified formats. 2. If NAME is an alias for a file A in some "fontmap" file, look for A.DPI. 3. Run an external script (typically named `MakeTeXPK') to generate the font. 4. Look for FALLBACK.DPI, where FALLBACK is some last-resort font (typically `cmr10'). * Menu: * Basic glyph lookup:: Features common to all glyph lookups. * Fontmap:: Aliases for fonts. * MakeTeX... scripts:: Creating files on the fly. * Fallback font:: Resolutions and fonts of last resort.  File: kpathsea.info, Node: Basic glyph lookup, Next: Fontmap, Up: Glyph lookup Basic glyph lookup ------------------ When Kpathsea looks for a bitmap font NAME at resolution DPI in a format FORMAT, it first checks if a file `NAME.DPIFORMAT' exists; for example, `cmr10.300pk'. Kpathsea looks for a PK file first, then a GF file. If that fails, Kpathsea looks for a font with a close-enough DPI. "Close enough" is defined (by the macro `KPSE_BITMAP_TOLERANCE' in `kpathsea/tex-glyph.h') to be `DPI / 500 + 1', which is slightly more than the 0.2% allowed by the DVI standard. The filename is not hardwired to `NAME.DPIFORMAT'; you can change it by setting the environment variable `KPATHSEA_BITMAP_NAME' to a different specification. The default spec is $KPATHSEA_NAME.$KPATHSEA_DPI$KPATHSEA_FORMAT Kpathsea sets these environment variables as it runs, as appropriate for each lookup. You can use any environment variables you like, not just these, in the spec.  File: kpathsea.info, Node: Fontmap, Next: MakeTeX... scripts, Prev: Basic glyph lookup, Up: Glyph lookup Fontmap ------- If a bitmap font is not found, Kpathsea looks through any "fontmap" files for an "alias" for the original font name. I implemented this for two reasons: 1. An alias name is limited in length only by your available memory, not by whatever bizarre limitations your filesystem might impose. Therefore, if you want to ask for `Adobe-Lucida-Bold-Sans=Typewriter--10' instead of `plcbst10', you can. 2. A few fonts have historically had multiple names: specifically, LaTeX's "circle font" has variously been known as `circle10', `lcircle10', and `lcirc10'. Aliases can make all the names equivalent, so that it no longer matters what the name of the installed file is; TeX documents will find their favorite name. The format of fontmap files that implement these ideas is straightforward: the first word on each line is the true filename; the second word is the alias; subsequent words are ignored. A "word" is just a sequence of non-whitespace characters. Blank lines are ignored; comments start with `%' and continue to end-of-line. If an alias has an extension, it matches only those files with that extension; otherwise, it matches anything with the same root, regardless of extension. For example, an alias `foo.tfm' matches only when exactly `foo.tfm' is being searched for; but an alias `foo' matches `foo.vf', `foo.300pk', or whatever. As an example, here are the fontmap entries that make the circle fonts equivalent: circle10 lcircle10 circle10 lcirc10 lcircle10 circle10 lcircle10 lcirc10 lcirc10 circle10 lcirc10 lcircle10  File: kpathsea.info, Node: MakeTeX... scripts, Next: Fallback font, Prev: Fontmap, Up: Glyph lookup `MakeTeX'... scripts -------------------- If Kpathsea cannot find a bitmap font, by either its original name or a fontmap alias, it can be configured to invoke an external program to create it. The same mechanism can be used for other nonexistent files. The script is passed the name of the file to create and possibly other arguments, as explained below. It must echo the full pathname of the file it created (and nothing else) to standard output; it can write diagnostics to standard error. * Menu: * MakeTeX... script names:: * MakeTeX... script arguments::  File: kpathsea.info, Node: MakeTeX... script names, Next: MakeTeX... script arguments, Up: MakeTeX... scripts `MakeTeX'... script names ......................... The following table shows the default name of the script for each possible file types. (The source is the variable `kpse_make_specs' in `kpathsea/tex-make.c'.) `MakeTeXPK' Glyph fonts. `MakeTeXTeX' TeX input files. `MakeTeXMF' Metafont input files. `MakeTeXTFM' TFM files. These names are overridden by an environment variable specific to the program--`DVIPSMAKEPK' and `XDVIMAKEPK', in the case of Dvipsk and Xdvik.  File: kpathsea.info, Node: MakeTeX... script arguments, Prev: MakeTeX... script names, Up: MakeTeX... scripts `MakeTeX'... script arguments ............................. The first argument to a `MakeTeX'... script is always the name of the file to be created. In the case of `MakeTeXPK', there are three or four additional arguments passed, via corresponding environment variables: 1. The dpi to make the font at (`KPATHSEA_DPI'). 2. The "base dpi" the program is operating at (`MAKETEX_BASE_DPI'), i.e., the assumed resolution of the output device. 3. A "magstep" string suitable for assigning to the Metafont `mag' variable (`MAKETEX_MAG'). 4. Optionally, a Metafont mode name for assigning to the Metafont `mode' variable (`MAKETEX_MODE'). 5. Optionally, a directory name. If the directory is absolute, it is used as-is. Otherwise, it is appended to the root destination directory set at compile-time (the Make variable `mtp_destdir'). If this argument is not supplied, the mode name is appended to `mtp_destdir'. Kpathsea sets `KPATHSEA_DPI' appropriately for each attempt at building a font. It's up to the program using Kpathsea to set the others. You can change the specification for the arguments passed to the external script by setting the environment variable named as the script name, but all capitals--`MAKETEXPK', for example. If you've changed the script name by setting (say) `DVIPSMAKEPK' to `foo', then the spec is taken from the environment variable `FOO'. The spec can contain any variable references, to the above variables or any others you might have set. As an example, the default spec for `MakeTeXPK' is $KPATHSEA_DPI $MAKETEX_BASE_DPI $MAKETEX_MAG $MAKETEX_MODE The convention of passing the name of the file to be created as the first argument cannot be changed.  File: kpathsea.info, Node: Fallback font, Prev: MakeTeX... scripts, Up: Glyph lookup Fallback font ------------- If a bitmap font cannot be found or created at the requested size, Kpathsea looks for the font at a set of "fallback resolutions". You specify these resolutions as a colon-separated list (like search paths). Kpathsea looks first for a program-specific environment variable (`DVIPSSIZES' and `XDVISIZES', in the case of Dvipsk and Xdvik), then the environment variable `TEXSIZES', then a default specified at compilation time (the Make variable `default_texsizes'). You can set this list to be empty if you prefer to find fonts at their stated size or not at all. Finally, if the font cannot be found even at the fallback resolutions, Kpathsea looks for a fallback font, typically `cmr10'. Programs must enable this feature by assigning to the global variable `kpse_fallback_font'; the default is no such fallback font.  File: kpathsea.info, Node: Copying, Next: Freedom, Prev: TeX support, Up: Top GNU GENERAL PUBLIC LICENSE ************************** Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, 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. TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 1. 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. 2. 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. 3. 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 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. 4. 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. 5. 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. 6. 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. 7. 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. 8. 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. 9. 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. 10. 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. 11. 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 12. 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. 13. 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 Appendix: 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., 675 Mass Ave, Cambridge, MA 02139, 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.  File: kpathsea.info, Node: Freedom, Next: Index, Prev: Copying, Up: Top Regain your programming freedom ******************************* Until a few years ago, programmers in the United States could write any program they wished. This freedom has now been taken away by two developments: software patents, which grant the patent holder an absolute monopoly on some programming technique, and user interface copyright, which forbid compatible implementations of an existing user interface. In Europe, especially through the GATT treaty, things are rapidly approaching the same pass. * Menu: * Software patents:: Algorithm monopolies. * User interface copyright:: Forbidding upward-compatibility. * What to do?:: What to do?  File: kpathsea.info, Node: Software patents, Next: User interface copyright, Up: Freedom Software patents ================ The U.S. Patent and Trademark Office has granted numerous software patents on software techniques. Patents are an absolute monopoly--independent reinvention is precluded. This monopoly lasts for seventeen years, i.e., forever (with respect to computer science). One patent relevant to TeX is patent 4,956,809, issued to the Mark Williams company on September 11, 1990, applied for in 1982, which covers (among other things) representing in a standardized order consisting of a standard binary structure file stored on auxiliary memory or transported on a communications means, said standardized order being different from a different order used on at least one of the different computers; Converting in each of the different computers binary data read from an auxiliary data storage or communications means from the standardized order to the natural order of the respective host computer after said binary data are read from said auxiliary data storage or communications means and before said binary data are used by the respective host computer; and Converting in each of the different computers binary data written into auxiliary data storage or communications means from the natural order of the respective host computer to the standardized order prior to said writing. ... in other words, storing data on disk in a machine-independent order, as the DVI, TFM, GF, and PK file formats specify. Even though TeX is "prior art" in this respect, the patent was granted (the patent examiners not being computer scientists, even less computer typographers). Since there is a strong presumption in the courts of a patent's validity once it has been granted, there is a good chance that users or implementors of TeX could be successfully sued on the issue. As another example, the X window system, which was intended to be able to be used freely by everyone, is now being threatened by two patents: 4,197,590 on the use of exclusive-or to redraw cursors, held by Cadtrak, a litigation company (this has been upheld twice in court); and 4,555,775, held by AT&T, on the use of backing store to redraw windows quickly. Here is one excerpt from a recent mailing by the League for Programming Freedom (*note What to do?::.) which I feel sums up the situation rather well. It comes from an article in `Think' magazine, issue #5, 1990. The comments after the quote were written by Richard Stallman. "You get value from patents in two ways," says Roger Smith, IBM Assistant General Counsel, intellectual property law. "Through fees, and through licensing negotiations that give IBM access to other patents. "The IBM patent portfolio gains us the freedom to do what we need to do through cross-licensing--it gives us access to the inventions of others that are the key to rapid innovation. Access is far more valuable to IBM than the fees it receives from its 9,000 active patents. There's no direct calculation of this value, but it's many times larger than the fee income, perhaps an order of magnitude larger." This information should dispel the belief that the patent system will "protect" a small software developer from competition from IBM. IBM can always find patents in its collection which the small developer is infringing, and thus obtain a cross-license. However, the patent system does cause trouble for the smaller companies which, like IBM, need access to patented techniques in order to do useful work in software. Unlike IBM, the smaller companies do not have 9,000 patents and cannot usually get a cross-license. No matter how hard they try, they cannot have enough patents to do this. Only the elimination of patents from the software field can enable most software developers to continue with their work. The value IBM gets from cross-licensing is a measure of the amount of harm that the patent system would do to IBM if IBM could not avoid it. IBM's estimate is that the trouble could easily be ten times the good one can expect from one's own patents--even for a company with 9,000 of them.  File: kpathsea.info, Node: User interface copyright, Next: What to do?, Prev: Software patents, Up: Freedom User interface copyright ======================== (This section is copied from the GCC manual, by Richard Stallman.) This section is a political message from the League for Programming Freedom to the users of the GNU font utilities. It is included here as an expression of support for the League on my part. Apple, Lotus and Xerox are trying to create a new form of legal monopoly: a copyright on a class of user interfaces. These monopolies would cause serious problems for users and developers of computer software and systems. Until a few years ago, the law seemed clear: no one could restrict others from using a user interface; programmers were free to implement any interface they chose. Imitating interfaces, sometimes with changes, was standard practice in the computer field. The interfaces we know evolved gradually in this way; for example, the Macintosh user interface drew ideas from the Xerox interface, which in turn drew on work done at Stanford and SRI. 1-2-3 imitated VisiCalc, and dBase imitated a database program from JPL. Most computer companies, and nearly all computer users, were happy with this state of affairs. The companies that are suing say it does not offer "enough incentive" to develop their products, but they must have considered it "enough" when they made their decision to do so. It seems they are not satisfied with the opportunity to continue to compete in the marketplace--not even with a head start. If Xerox, Lotus, and Apple are permitted to make law through the courts, the precedent will hobble the software industry: * Gratuitous incompatibilities will burden users. Imagine if each car manufacturer had to arrange the pedals in a different order. * Software will become and remain more expensive. Users will be "locked in" to proprietary interfaces, for which there is no real competition. * Large companies have an unfair advantage wherever lawsuits become commonplace. Since they can easily afford to sue, they can intimidate small companies with threats even when they don't really have a case. * User interface improvements will come slower, since incremental evolution through creative imitation will no longer be permitted. * Even Apple, etc., will find it harder to make improvements if they can no longer adapt the good ideas that others introduce, for fear of weakening their own legal positions. Some users suggest that this stagnation may already have started. * If you use GNU software, you might find it of some concern that user interface copyright will make it hard for the Free Software Foundation to develop programs compatible with the interfaces that you already know.  File: kpathsea.info, Node: What to do?, Prev: User interface copyright, Up: Freedom What to do? =========== (This section is copied from the GCC manual, by Richard Stallman.) To protect our freedom from lawsuits like these, a group of programmers and users have formed a new grass-roots political organization, the League for Programming Freedom. The purpose of the League is to oppose new monopolistic practices such as user-interface copyright and software patents; it calls for a return to the legal policies of the recent past, in which these practices were not allowed. The League is not concerned with free software as an issue, and not affiliated with the Free Software Foundation. The League's membership rolls include John McCarthy, inventor of Lisp, Marvin Minsky, founder of the Artificial Intelligence lab, Guy L. Steele, Jr., author of well-known books on Lisp and C, as well as Richard Stallman, the developer of GNU CC. Please join and add your name to the list. Membership dues in the League are $42 per year for programmers, managers and professionals; $10.50 for students; $21 for others. The League needs both activist members and members who only pay their dues. To join, or for more information, phone (617) 492-0023 or write to: League for Programming Freedom 1 Kendall Square #143 P.O. Box 9171 Cambridge, MA 02139 You can also send electronic mail to `league@prep.ai.mit.edu'. Here are some suggestions from the League for things you can do to protect your freedom to write programs: * Don't buy from Xerox, Lotus or Apple. Buy from their competitors or from the defendants they are suing. * Don't develop software to work with the systems made by these companies. * Port your existing software to competing systems, so that you encourage users to switch. * Write letters to company presidents to let them know their conduct is unacceptable. * Tell your friends and colleagues about this issue and how it threatens to ruin the computer industry. * Above all, don't work for the look-and-feel plaintiffs, and don't accept contracts from them. * Write to Congress to explain the importance of this issue. House Subcommittee on Intellectual Property 2137 Rayburn Bldg Washington, DC 20515 Senate Subcommittee on Patents, Trademarks and Copyrights United States Senate Washington, DC 20510 (These committees have received lots of mail already; let's give them even more.) Express your opinion! You can make a difference.  File: kpathsea.info, Node: Index, Prev: Freedom, Up: Top Index ***** * Menu: * #! in configure script: configure. * $: Variable expansion. * %% in path specifications: Filename database. * -exec-prefix option to configure: configure. * -no-create option to configure: configure. * -prefix option to configure: configure. * -recheck option to config.status: configure. * -v option to configure: configure. * .base: TeX environment variables. * .bib: TeX environment variables. * .bst: TeX environment variables. * .fmt: TeX environment variables. * .gf: TeX environment variables. * .mf: TeX environment variables. * .pk: TeX environment variables. * .pool: TeX environment variables. * .pool: TeX environment variables. * .tex: TeX environment variables. * .tfm: TeX environment variables. * .vf: TeX environment variables. * / may not be /: Directory list generation. * //: Subdirectory expansion. * /dev/null: configure. * /usr/local default prefix: configure. * : may not be :: Directory list generation. * ::: Default expansion. * MakeTeX... script names: MakeTeX... script names. * MakeTeX... scripts: MakeTeX... scripts. * $HOME searchin caveat: Default paths. * root peculiarities: Default paths. * ~ searching caveat: Default paths. * TeX environment variables: TeX environment variables. * TeX features: TeX support. * TeX glyph lookup: Glyph lookup. * absolute filenames: File lookups. * aliases for fonts: Fontmap. * architecture dependencies and installation: configure. * arguments to MakeTeX...: MakeTeX... script arguments. * Autoconf: configure. * base dpi: MakeTeX... script arguments. * basic glyph lookup: Basic glyph lookup. * BIBINPUTS: TeX environment variables. * BSTINPUTS: TeX environment variables. * bug address: Bugs. * bugs, reporting: Bugs. * c-auto.h, editing: Installation. * CC variable for configuration: configure. * cc warnings: Bugs. * circle fonts: Fontmap. * common features in glyph lookup: Basic glyph lookup. * compilation: Installation. * compilation in another directory: configure. * compilation value, source for path: Directory list generation. * conditions for use: Introduction. * config.status: configure. * configuration: Installation. * configuration file, source for path: Directory list generation. * configuration problems, fixing properly: configure. * configure: Installation. * configure output, suppressing: configure. * configure script, running: configure. * configure.in: configure. * database for filename searches: Filename database. * database, format of: Database format. * debug.h: Subdirectory problems. * debugging slow startup time: Subdirectory problems. * DEBUG_STAT: Subdirectory problems. * default expansion: Default expansion. * default_texsizes: Fallback font. * DEFS variable for configuration: configure. * destination directory for MakeTeXPK: MakeTeX... script arguments. * directories, changing default installation: Default paths. * directory list generation: Directory list generation. * doubled colon, in paths: Default expansion. * DVIPSFONTS: TeX environment variables. * DVIPSMAKEPK: MakeTeX... script names. * DVIPSSIZES: Fallback font. * environment variable, source for path: Directory list generation. * environment variables for TeX: TeX environment variables. * environment variables in paths: Variable expansion. * excessive startup time: Subdirectory problems. * expansion, default: Default expansion. * expansion, in paths: Directory list generation. * expansion, subdirectory: Subdirectory expansion. * expansion, tilde: Tilde expansion. * expansion, variable: Variable expansion. * explicitly relative filenames: File lookups. * externally-built filename database: Filename database. * extra colons in paths: Default expansion. * fallback font: Fallback font. * fallback resolutions: Fallback font. * filename database: Filename database. * filename lookup: File lookups. * filenames, absolute or explicitly relative: File lookups. * font alias files: Fontmap. * font of last resort: Fallback font. * fontmap files: Fontmap. * fontnames, unlimited length: Fontmap. * format of external database: Database format. * freedom, programming: Freedom. * fundamental purpose: Introduction. * generation of directory lists: Directory list generation. * GFFONTS: TeX environment variables. * glyph lookup: Glyph lookup. * glyph lookup bitmap tolerance: Basic glyph lookup. * GLYPHFONTS: TeX environment variables. * GLYPHFONTS: TeX environment variables. * GNU General Public License: Introduction. * GNU Library General Public License: Introduction. * home directories in paths: Tilde expansion. * illegal pointer combination warnings: Bugs. * INSTALL variable for configuration: configure. * installation: Installation. * installation directories: configure. * installation directories, changing default: Default paths. * installation prefix, default: configure. * interface copyright: User interface copyright. * interface, not frozen: Introduction. * introduction: Introduction. * kpathsea/filefmt.h: TeX environment variables. * kpathsea/paths.h: Default paths. * kpathsea/tex-glyph.c: Glyph lookup. * KPATHSEA_BITMAP_NAME: Basic glyph lookup. * kpathsea_debug: Subdirectory problems. * KPATHSEA_DPI: MakeTeX... script arguments. * KPSE_BITMAP_TOLERANCE: Basic glyph lookup. * kpse_find_glyph_format: Glyph lookup. * kpse_make_specs: MakeTeX... script names. * last-resort font: Fallback font. * lazy evaluation: Path specifications. * leaf directories wrongly guessed: Subdirectory problems. * leaf directory trick: Subdirectory problems. * LIBS variable for configuration: configure. * license for using the library: Introduction. * lookup of filenames: File lookups. * ls-R database file: Filename database. * MacKenzie, David: configure. * mag Metafont variable: MakeTeX... script arguments. * magic characters: Directory list generation. * magstep for MakeTeXPK: MakeTeX... script arguments. * Makefile, editing: Installation. * MakeTeXMF: MakeTeX... script names. * MakeTeXPK: MakeTeX... script names. * MAKETEXPK environment variable: MakeTeX... script arguments. * MakeTeXTeX: MakeTeX... script names. * MakeTeXTFM: MakeTeX... script names. * MAKETEX_BASE_DPI: MakeTeX... script arguments. * MAKETEX_MAG: MakeTeX... script arguments. * MAKETEX_MODE: Default paths. * MAKETEX_MODE: MakeTeX... script arguments. * Metafont mode name for MakeTeXPK: MakeTeX... script arguments. * MFBASES: TeX environment variables. * MFINPUTS: TeX environment variables. * MFPOOL: TeX environment variables. * mode Metafont variable: MakeTeX... script arguments. * mtp_destdir: MakeTeX... script arguments. * names for MakeTeX... scripts: MakeTeX... script names. * NO_FOIL_X_WCHAR_T: wchar_t. * patents, software: Software patents. * path specification: Path specifications. * path specification, example: Path specification example. * PATH, . omitted from: configure. * paths, changing default: Default paths. * paths.h: Default paths. * PKFONTS: TeX environment variables. * pointer combination warnings: Bugs. * prefix Make variable: configure. * prefix for installation directories: configure. * prefix, installation default: configure. * problems with subdirectory searching: Subdirectory problems. * programs using the library: Introduction. * putenv: putenv. * recursion from /: Default paths. * relative filenames: File lookups. * reporting bugs: Bugs. * resolutions, last-resort: Fallback font. * rms: User interface copyright. * scripts for file creation: MakeTeX... scripts. * search path specification: Path specifications. * searching for glyphs: Glyph lookup. * slow startup time: Subdirectory problems. * SMART_PUTENV: putenv. * software patents: Software patents. * sources for path: Directory list generation. * specification for MakeTeXPK: MakeTeX... script arguments. * specifying search paths: Path specifications. * st_nlink: Subdirectory problems. * subdirectory searching: Subdirectory expansion. * subdirectory searching problems: Subdirectory problems. * suppressing configure output: configure. * symbolic links not found: Subdirectory problems. * tex-k@cs.umb.edu bug address: Bugs. * tex-make.c: MakeTeX... script names. * TEXFONTS: TeX environment variables. * TEXFONTS: TeX environment variables. * TEXFONTS: TeX environment variables. * TEXFONTS: TeX environment variables. * TEXFORMATS: TeX environment variables. * TEXINPUTS: TeX environment variables. * TEXINPUTS: TeX environment variables. * TEXPKS: TeX environment variables. * TEXPOOL: TeX environment variables. * TEXSIZES: Fallback font. * TFMFONTS: TeX environment variables. * tilde expansion: Tilde expansion. * tolerance for glyph lookup: Basic glyph lookup. * trick for detecting leaf directories: Subdirectory problems. * UNIX_ST_LINK: Subdirectory problems. * user interface copyright: User interface copyright. * variable expansion: Variable expansion. * verbose configure messages, suppressing: configure. * VFFONTS: TeX environment variables. * VPATH: configure. * warnings, pointer combinations: Bugs. * XDVIFONTS: TeX environment variables. * XDVIMAKEPK: MakeTeX... script names. * XDVISIZES: Fallback font. * ~: Tilde expansion.  Tag Table: Node: Top1059 Node: Introduction1755 Node: Installation3349 Node: System dependencies4453 Node: Default paths4912 Node: wchar_t6722 Node: putenv8724 Node: configure9145 Node: Bugs13939 Node: Path specifications15122 Node: Filename database16179 Node: Database format17967 Node: Directory list generation18837 Node: Default expansion20210 Node: Tilde expansion20625 Node: Variable expansion20999 Node: Subdirectory expansion21577 Node: Subdirectory problems22369 Node: Path specification example26270 Node: File lookups26768 Node: TeX support27595 Node: TeX environment variables28383 Node: Glyph lookup30110 Node: Basic glyph lookup31284 Node: Fontmap32271 Node: MakeTeX... scripts34026 Node: MakeTeX... script names34705 Node: MakeTeX... script arguments35320 Node: Fallback font37189 Node: Copying38137 Node: Freedom57293 Node: Software patents58062 Node: User interface copyright62400 Node: What to do?65283 Node: Index67925  End Tag Table octave-1.1.0/kpathsea/index.texi100666 415 17 56 5423524673 14714 0ustar jweusers@node Index @unnumbered Index @printindex cp octave-1.1.0/kpathsea/install.texi100666 415 17 33376 5544327541 15345 0ustar jweusers@c Copyright (C) 1993, 94 Karl Berry. @c For copying conditions, see the file copying.texi. @node Installation @chapter Installation @cindex installation @cindex configuration @cindex compilation Here are the basic steps for configuration and installation: @enumerate @flindex configure @item @code{configure}. This automatically determines most system dependencies. @flindex Makefile@r{, editing} @flindex c-auto.h@r{, editing} @item If necessary, edit the definitions in @file{Makefile} or @file{c-auto.h}. @xref{System dependencies}, below, for additional definitions you may need to make. @item @code{make}. @item @code{make install}. This installs the library, header files, and documentation. @item @code{make distclean}. This removes all files created by the build. @end enumerate Since I only distribute Kpathsea as part of another package, you will probably be doing the above in a top-level directory that contains a @samp{Makefile}, @samp{kpathsea}, and the other package. But you can do the installation in @samp{kpathsea} itself, if you only want to install the library, not the other package. @menu * System dependencies:: Definitions you must supply. * configure:: Options and frills for the `configure' script. * Bugs:: Where and how to report bugs. @end menu @node System dependencies @section System dependencies Although @code{configure} can reliably determine most aspects of your system, there are a few things you must help it out with. @menu * Default paths:: Changing the default paths and installation dirs. * wchar_t:: Working around `wchar_t' problems, e.g., on Linux. * putenv:: For smart putenv implementations, e.g., Net2/BSD. @end menu @node Default paths @subsection Default paths @cindex paths, changing default @cindex installation directories, changing default @cindex directories, changing default installation @flindex kpathsea/paths.h @flindex paths.h The directories into which files are installed are defined in the top-level @file{Makefile}. The default paths which programs use to search for inputs are defined in @file{kpathsea/paths.h}. You will almost certainly want to change either or both of these to match your preferred local directory structure. In particular, if you need to support only one output device, the rather deep structure of the default paths is unnecessary. Both of these files are automatically created: the @file{Makefile} at @samp{configure} time, @file{kpathsea/paths.h} at @samp{make} time. Thus, to change the default paths, the simplest thing to do is edit the template files @file{Makefile.in} and @file{paths.h.in} before running @samp{configure}. The Make definitions are all repeated in several @file{Makefile}'s; but changing the top-level @file{Makefile} should suffice, as it passes down all the variable definitions, thus overriding the submakes. (The definitions are repeated so you can potentially run Make in the subdirectories.) @vindex MAKETEX_MODE If you want to include the mode in a particular path, perhaps to distinguish two different devices with the same resolution, use @code{$MAKETEX_MODE}, as in @file{/usr/local/lib/texmf/fonts//pk/$MAKETEX_MODE}. @xref{MakeTeX... script arguments, @file{MakeTeX}@dots{} script arguments}. The file @file{kpathsea/HIER} has some explanation of the default setup. @cindex recursion from @file{/} @cindex @samp{~} searching caveat @cindex @samp{$HOME} searchin caveat @cindex @samp{root} peculiarities A caveat: If you put @samp{$HOME} or @samp{~} in any of the paths, do not search that component recursively: when you run as root, you might wind up searching (say) @file{/zoneinfo/Brazil/tex/macros}. And of course it will take quite some time to look at every directory on the system. @xref{Filename database}, for a description of an external database that can help speed searches. @node wchar_t @subsection @code{wchar_t} @vindex NO_FOIL_X_WCHAR_T @tindex wchar_t The upshot of all the following is that if you get error messages regarding @code{wchar_t}, try defining @code{NO_FOIL_X_WCHAR_T}. This is reported to be necessary on Linux. @code{wchar_t} has caused infinite trouble. None of my code ever uses @code{wchar_t}; all I want to do is include X header files and various system header files, compiling with GCC. This seems an impossible task. The X11R5 @file{} and GCC's @file{} have conflicting definitions for wchar_t. The particulars: @file{} from MIT X11R5 defines @code{wchar_t} if @code{X_WCHAR} is defined, which is defined if @code{X_NOT_STDC_ENV} is defined, and we define @emph{that} if @code{STDC_HEADERS} is not defined (@samp{configure} decides if STDC_HEADERS gets defined). But when compiling with gcc on SunOS 4.1.x, @code{STDC_HEADERS} is not defined (@file{string.h} doesn't declare the @samp{mem}* functions), so we do get X's @code{wchar_t}---and we also get gcc's @code{wchar_t} from its @file{}. Result: conflicting definitions. On the other hand, SunOS 4.1.1 with some other X configurations actually needs GCC to define @code{wchar_t}, and fails otherwise. My current theory is to define @code{wchar_t} to a nonsense symbol before the X include files are read; that way its definition (if any) will be ignored by other system include files. Going along with that, define @code{X_WCHAR} to tell X not to use @file{}, that we've already included, but instead to make its own definition. But this is not the end of the story. The X11 include files distributed with DG/UX 5.4.2 for the Aviion have been modified to include @file{<_int_wchar_t.h>} if @code{X_WCHAR}, so our @code{#define} will not have any typedef to change---but the uses of @code{wchar_t} in the X include files will be changed to reference this undefined symbol. So there's nothing to foil in this case; I don't know how to detect this automatically, so it's up to you to define @code{NO_FOIL_X_WCHAR_T} yourself. @node putenv @subsection @code{putenv} @findex putenv @vindex SMART_PUTENV If you are on a Net2/BSD or other system which has a @code{putenv} that knows how to avoid garbage when the same environment variable is set many times, define @code{SMART_PUTENV}. (And if you can write a test for this that could be incorporated into the @code{configure} script, please send it to the address given in @ref{Bugs}.) @node configure @section The @code{configure} script @cindex prefix for installation directories @cindex installation directories @pindex configure @r{script, running} @cindex MacKenzie, David @pindex Autoconf (This section is largely from the Autoconf manual, by David MacKenzie. @xref{Running configure Scripts, , Running @code{configure} scripts, autoconf, Autoconf}.) The @code{configure} script that comes with this distribution was generated by the Autoconf program. Thus, you can regenerate @code{configure} by rerunning Autoconf. You might want to do this if a new version of Autoconf is released, for example. The purpose of @code{configure} is to adapt the present source to the particulars of your system. For example, the name of the directory header file (@file{dirent.h} or @file{sys/dir.h}), whether the GNU C compiler @code{gcc} is available, and so on. @vindex PATH@r{, @file{.} omitted from} @flindex #! @r{in @t{configure} script} Normally, you do not need to give any options to @code{configure}; just @code{cd} to the directory with the source code and type @samp{configure}. Exceptions: if @file{.} is not in your @code{PATH}, you must type @samp{./configure}; if you are using a non-Bourne compatible shell on systems that do not support @samp{#!}, you must type @samp{sh configure}. @pindex configure @r{output, suppressing} @cindex verbose @code{configure} messages, suppressing @cindex suppressing @code{configure} output @opindex -v @r{option to @code{configure}} @flindex /dev/null Running @code{configure} takes a minute or two. While it is running, it prints some messages that tell what it is doing. If you don't want to see the messages, run @code{configure} with its standard output redirected to @file{/dev/null}; e.g., @samp{configure >/dev/null}. On the other hand, if you want to see even more messages, give @code{configure} the @samp{-v} option. @vindex VPATH @cindex compilation in another directory To compile the package in a different directory from the one containing the source code, you must use a variant of Make that supports the @code{VPATH} variable, such as GNU Make. @code{cd} to the directory where you want the object files and executables to go and run @code{configure} with the option @samp{--srcdir=@var{dir}}, where @var{dir} is the directory that contains the source code. Using this option is unnecessary if the source code is in the parent directory of the one in which you are compiling; @code{configure} automatically checks for the source code in @file{..} if it does not find it in @file{.}. @cindex installation prefix, default @cindex prefix, installation default @vindex prefix @r{Make variable} @flindex /usr/local @r{default prefix} @code{configure} (in the top-level directory) guesses the default installation prefix (we'll call it @code{$(prefix)}, which is the corresponding Make variable) by looking for a directory which contains an executable named @samp{tex}, and using its parent. In the package subdirectories, such as @file{kpathsea}, @code{configure} doesn't try to guess the prefix (to avoid a conflict with the guess made at the top level); the default @file{/usr/local} is left. @opindex --prefix @r{option to @code{configure}} @opindex --exec-prefix @r{option to @code{configure}} @cindex architecture dependencies and installation You can override this default guess for the installation prefix by giving @code{configure} the option @samp{--prefix=@var{path}}. You can also specify separate installation prefixes for architecture-specific files and architecture-independent files by giving @code{configure} the option @samp{--exec-prefix=@var{xpath}} (which substitutes for the Make variable @samp{$(exec_prefix)}). Then @var{xpath} will be the prefix for installing programs and libraries. Data files and documentation will still use @samp{$(prefix)}. @flindex config.status @opindex --no-create @r{option to @code{configure}} @opindex --recheck @r{option to @code{config.status}} You can tell @code{configure} to figure out the configuration for your system, and record it in a file @file{config.status}, without actually configuring the package. To do this, give @code{configure} the @samp{--no-create} option. Later, you can run @file{./config.status} to actually configure the package. This option is useful mainly in @file{Makefile} rules for updating @file{config.status} and the @file{Makefile} itself. You can also give @file{config.status} the @samp{--recheck} option, which makes it rerun @code{configure} with the same arguments you used before. This is useful if you change @code{configure}. @code{configure} ignores any other arguments that you give it. On systems that require unusual options for compilation or linking that the package's @code{configure} script does not know about, you can give @code{configure} initial values for variables by setting them in the environment. In Bourne-compatible shells, you can do that on the command line like this: @example CC='gcc -traditional' LIBS=-lposix sh configure @end example The Make variables that you might want to override with environment variables when running @code{configure} are: (For these variables, any value given in the environment overrides the value that @code{configure} would choose.) @table @code @vindex CC @r{variable for configuration} @item CC The C compiler program. The default is @code{gcc} if that is in your @code{PATH}, @code{cc} otherwise. @vindex INSTALL @r{variable for configuration} @item INSTALL The program to use to install files. The default is @code{install} if you have it, @code{cp} otherwise. @end table (For these variables, any value given in the environment is added to the value that @code{configure} chooses.) @table @code @vindex DEFS @r{variable for configuration} @item DEFS Configuration options, in the form @samp{-Dfoo -Dbar@dots{}}. @vindex LIBS @r{variable for configuration} @item LIBS Libraries to link with, in the form @samp{-lfoo -lbar@dots{}}. @end table @flindex configure.in @cindex configuration problems, fixing properly Of course, problems requiring manual intervention (e.g., setting these variables) should ideally be fixed by updating either the Autoconf macros or the @file{configure.in} file for that package. @node Bugs @section Reporting bugs @cindex reporting bugs @cindex bugs, reporting @flindex tex-k@@cs.umb.edu @r{bug address} @cindex bug address If you encounter problems, report them to @samp{tex-k@@cs.umb.edu}. Include the version number of the library, the system you are using, and enough information to reproduce the bug in your report. To get on this mailing list yourself, email @samp{tex-k-request@@cs.umb.edu} with a message whose body contains a line @example subscribe @var{you@@your.preferred.address} @end example To avoid wasted effort and time (both mine and yours), I strongly advise applying the principles given in the GNU C manual (@pxref{Bugs, , Reporting Bugs, gcc, The GNU CC manual}) to your bug reports for any software. Please also report bugs in this documentation---not only factual errors, but unclear explanations, typos, wrong fonts, @dots{}. @cindex warnings, pointer combinations @cindex pointer combination warnings @cindex illegal pointer combination warnings @pindex cc @r{warnings} When compiling with old C compilers, you may get some warnings about ``illegal pointer combinations''. These are spurious; ignore them. I decline to clutter up the source with casts to get rid of them. In general, if you have trouble with a system C compiler, I advise trying the GNU C compiler. (And vice versa, unfortunately; but in that case I also recommend reporting a bug to the GCC bug list.) octave-1.1.0/kpathsea/intro.texi100666 415 17 3635 5440212171 14770 0ustar jweusers@c Copyright (C) 1993 Karl Berry @c For copying conditions, see the file copying.texi. @node Introduction @chapter Introduction @cindex introduction @cindex fundamental purpose This manual corresponds to version @value{version} of the Kpathsearch library, released in @value{month-year}. The library's fundamental purpose is to look up a file in a list of directories specified by the user. @cindex programs using the library The following software, all of which I maintain, uses this library: @itemize @bullet @item web2c @item Xdvik @item Dvipsk (@pxref{Top, , Introduction, dvipsk, Dvips: A DVI driver}) @item GNU font utilities (@pxref{Top, , Introduction, fontu, GNU font utilities}) @end itemize @cindex interface, not frozen The library is still under development. I do not promise to keep the interface unchanged. If you have comments or suggestions, please send them to me (@pxref{Bugs} for the address). @cindex conditions for use @cindex license for using the library @cindex GNU General Public License Currently, I distribute the library under the GNU General Public License (@pxref{Copying}). In summary, this means if you write a program using the library, you must (offer to) distribute the source, and allow anyone to modify the source and distribute their modifications. @cindex GNU Library General Public License If you have a problem with this, please contact me. I would consider putting the library under the GNU Library General Public License, which would permit you to distribute the source only to the library, not the your program using it. But I will only do this if someone actually says they will not use the library under the GPL conditions, and would use it under the LGPL. This manual contains a few references to the C source for the library; they're there to help programmers reconcile my statements in this documentation with the Awful Truth of the code. If you're not a programmer, just ignore them. octave-1.1.0/kpathsea/kpathsea.texi100666 415 17 7407 5547047275 15461 0ustar jweusers\input texinfo @setfilename kpathsea.info @settitle Kpathsearch library @set version 1.8 @set month-year April 1994 @c Define new indices for commands in auxiliary files, filenames, and options. @defcodeindex cm @defcodeindex fl @defcodeindex op @c Put everything in one index (arbitrarily chosen to be the concept index). @syncodeindex cm cp @syncodeindex fl cp @syncodeindex fn cp @syncodeindex ky cp @syncodeindex op cp @syncodeindex pg cp @syncodeindex vr cp @c Here is what we use in the Info `dir' file: @c * Kpathsearch: (kpathsea). File lookup along search paths. @ifinfo This file documents the Kpathsearch library. Copyright (C) 1993, 94 Karl Berry. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. @ignore Permission is granted to process this file through TeX and print the results, provided the printed document carries a copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the section entitled ``Freedom'' and ``GNU General Public License'' are included exactly as in the original, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that the sections entitled ``Freedom'' and ``GNU General Public License'' may be included in a translation approved by the Free Software Foundation instead of in the original English. @end ifinfo @titlepage @title Kpathsearch library @subtitle for version @value{version} @subtitle @value{month-year} @author Karl Berry @page @vskip 0pt plus 1filll Copyright @copyright{} 1993, 94 Karl Berry. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the sections entitled ``Regain your programming freedom'' and ``GNU General Public License'' are included exactly as in the original, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that the sections entitled ``Regain your programming freedom'' and ``GNU General Public License'' may be included in a translation approved by the Free Software Foundation instead of in the original English. @end titlepage @ifinfo @node Top, Introduction, (dir), (dir) @top Kpathsearch library This manual documents how to install and use the Kpathsearch library for filename lookup. It corresponds to version @value{version} (released in @value{month-year}). @menu * Introduction:: A brief overview. * Installation:: Compilation, installation, and bug reporting. * Path specifications:: User interface. * TeX support:: Special support for TeX lookups. * Copying:: Conditions for copying, modifying and sharing. * Freedom:: Regain your programming freedom. * Index:: General index. @end menu @end ifinfo @include intro.texi @include install.texi @include userspec.texi @include tex-doc.texi @include copying.texi @include freedom.texi @include index.texi @contents @bye octave-1.1.0/kpathsea/tex-doc.texi100666 415 17 30707 5532234330 15223 0ustar jweusers@c Copyright (C) 1993 Karl Berry. @c For copying conditions, see the file copying.texi. @node TeX support @chapter @TeX{} support @cindex @TeX{} features Although the basic features in Kpathsea can be used for any type of path searching, I wrote Kpathsea specifically for @TeX{} system programs. I had been struggling with the programs I was using (Dvips, Xdvi, and @TeX{} itself) having slightly different notions of how to specify paths; and debugging was painful, since no code was shared. Therefore, Kpathsea provides some @TeX{}-specific features. Indeed, many of the supposedly generic path searching features were provided because it seemed useful in con@TeX{}t, particularly for font lookup. @menu * Envvars: TeX environment variables. Overriding compiled-in paths. * Glyph lookup:: Searching for bitmap fonts. @end menu @node TeX environment variables @section @TeX{} environment variables @cindex environment variables for @TeX{} @cindex @TeX{} environment variables Kpathsea defines a sequence of environment variables to search for each type of @TeX{} file. This makes it easy for different programs to check the same environment variables, in the same order. The following table lists the environment variables searched for each file type in the order they are searched (and a brief description of the file type). That is, only if the first variable is unset is the second variable checked, and so on. If none are set, a default set at compilation time is used. @table @samp @item .base @flindex .base @vindex MFBASES (Metafont memory dump) @samp{MFBASES} @item .bib @flindex .bib @vindex BIBINPUTS (Bib@TeX{} source) @samp{BIBINPUTS} @item .bst @flindex .bst @vindex BSTINPUTS @vindex TEXINPUTS (Bib@TeX{} style file) @samp{BSTINPUTS}, @samp{TEXINPUTS} @item .fmt @flindex .fmt @vindex TEXFORMATS (@TeX{} memory dump) @samp{TEXFORMATS} @item gf @flindex .gf @vindex GFFONTS @vindex GLYPHFONTS @vindex TEXFONTS (generic font bitmap) @samp{GFFONTS}, @samp{GLYPHFONTS}, @samp{TEXFONTS} @item .mf @flindex .mf @vindex MFINPUTS (Metafont source) @samp{MFINPUTS} @item mf.pool @flindex .pool @vindex MFPOOL (Metafont program strings) @samp{MFPOOL} @item pk @flindex .pk @vindex PKFONTS @vindex TEXPKS @vindex GLYPHFONTS @vindex TEXFONTS (packed bitmap font) @samp{PKFONTS}, @samp{TEXPKS}, @samp{GLYPHFONTS}, @samp{TEXFONTS} @item .tex @flindex .tex @vindex TEXINPUTS (@TeX{} source) @samp{TEXINPUTS} @item tex.pool @flindex .pool @vindex TEXPOOL (@TeX{} program strings) @samp{TEXPOOL} @item .tfm @flindex .tfm @vindex TFMFONTS @vindex TEXFONTS (@TeX{} font metrics) @samp{TFMFONTS}, @samp{TEXFONTS} @item .vf @flindex .vf @vindex VFFONTS @vindex TEXFONTS (virtual font) @samp{VFFONTS}, @samp{TEXFONTS} @end table @flindex kpathsea/filefmt.h @noindent These lists are defined in the source file @file{kpathsea/filefmt.h}. For the font variables, the intent is that: @enumerate @item @samp{TEXFONTS} is the default for everything. @item @samp{GLYPHFONTS} the default for bitmap (or, more precisely, non-metric) files. @item Each format has its own variable. @item @vindex XDVIFONTS @vindex DVIPSFONTS Not shown in the table is that each program can and should have its own path as well---@samp{XDVIFONTS} and @samp{DVIPSFONTS} in the case of Xdvik and Dvipsk. @end enumerate @node Glyph lookup @section Glyph lookup @cindex glyph lookup @cindex searching for glyphs @cindex @TeX{} glyph lookup @flindex kpathsea/tex-glyph.c @findex kpse_find_glyph_format Kpathsea provides a routine (@code{kpse_find_glyph_format} in @file{kpathsea/tex-glyph.c}) which searches for a bitmap font in GF or PK format (or either) given a font name (e.g., @samp{cmr10}) and a resolution (e.g., 300). The search is based solely on filenames, not file contents---if a PK file is named @file{cmr10.300gf}, it will be found as a GF file. Here is an outline of the search strategy (details in the sections below) for a file @var{name} at resolution @var{dpi}. The search stops at the first successful lookup. @enumerate @item Look for an existing file @var{name}.@var{dpi} in the specified formats. @item If @var{name} is an alias for a file @var{a} in some ``fontmap'' file, look for @var{a}.@var{dpi}. @item Run an external script (typically named @code{MakeTeXPK}) to generate the font. @item Look for @var{fallback}.@var{dpi}, where @var{fallback} is some last-resort font (typically @samp{cmr10}). @end enumerate @menu * Basic glyph lookup:: Features common to all glyph lookups. * Fontmap:: Aliases for fonts. * MakeTeX... scripts:: Creating files on the fly. * Fallback font:: Resolutions and fonts of last resort. @end menu @node Basic glyph lookup @subsection Basic glyph lookup @cindex basic glyph lookup @cindex common features in glyph lookup When Kpathsea looks for a bitmap font @var{name} at resolution @var{dpi} in a format @var{format}, it first checks if a file @samp{@var{name}.@var{dpi}@var{format}} exists; for example, @samp{cmr10.300pk}. Kpathsea looks for a PK file first, then a GF file. @cindex tolerance for glyph lookup @cindex glyph lookup bitmap tolerance @findex KPSE_BITMAP_TOLERANCE If that fails, Kpathsea looks for a font with a close-enough @var{dpi}. ``Close enough'' is defined (by the macro @code{KPSE_BITMAP_TOLERANCE} in @file{kpathsea/tex-glyph.h}) to be @code{@var{dpi} / 500 + 1}, which is slightly more than the 0.2% allowed by the DVI standard. @vindex KPATHSEA_BITMAP_NAME The filename is not hardwired to @samp{@var{name}.@var{dpi}@var{format}}; you can change it by setting the environment variable @samp{KPATHSEA_BITMAP_NAME} to a different specification. The default spec is @example $KPATHSEA_NAME.$KPATHSEA_DPI$KPATHSEA_FORMAT @end example @noindent Kpathsea sets these environment variables as it runs, as appropriate for each lookup. You can use any environment variables you like, not just these, in the spec. @node Fontmap @subsection Fontmap @cindex fontmap files @cindex font alias files @cindex aliases for fonts If a bitmap font is not found, Kpathsea looks through any @dfn{fontmap} files for an @dfn{alias} for the original font name. I implemented this for two reasons: @enumerate @item @cindex fontnames, unlimited length An alias name is limited in length only by your available memory, not by whatever bizarre limitations your filesystem might impose. Therefore, if you want to ask for @file{Adobe-Lucida-Bold-Sans=Typewriter--10} instead of @file{plcbst10}, you can. @item @cindex circle fonts A few fonts have historically had multiple names: specifically, La@TeX{}'s ``circle font'' has variously been known as @file{circle10}, @file{lcircle10}, and @file{lcirc10}. Aliases can make all the names equivalent, so that it no longer matters what the name of the installed file is; @TeX{} documents will find their favorite name. @end enumerate The format of fontmap files that implement these ideas is straightforward: the first word on each line is the true filename; the second word is the alias; subsequent words are ignored. A @dfn{word} is just a sequence of non-whitespace characters. Blank lines are ignored; comments start with @samp{%} and continue to end-of-line. If an alias has an extension, it matches only those files with that extension; otherwise, it matches anything with the same root, regardless of extension. For example, an alias @samp{foo.tfm} matches only when exactly @file{foo.tfm} is being searched for; but an alias @samp{foo} matches @file{foo.vf}, @file{foo.300pk}, or whatever. As an example, here are the fontmap entries that make the circle fonts equivalent: @example circle10 lcircle10 circle10 lcirc10 lcircle10 circle10 lcircle10 lcirc10 lcirc10 circle10 lcirc10 lcircle10 @end example @node MakeTeX... scripts @subsection @file{MakeTeX}@dots{} scripts @cindex @file{MakeTeX}@dots{} scripts @cindex scripts for file creation If Kpathsea cannot find a bitmap font, by either its original name or a fontmap alias, it can be configured to invoke an external program to create it. The same mechanism can be used for other nonexistent files. The script is passed the name of the file to create and possibly other arguments, as explained below. It must echo the full pathname of the file it created (and nothing else) to standard output; it can write diagnostics to standard error. @menu * MakeTeX... script names:: * MakeTeX... script arguments:: @end menu @node MakeTeX... script names @subsubsection @file{MakeTeX}@dots{} script names @cindex @file{MakeTeX}@dots{} script names @cindex names for @file{MakeTeX}@dots{} scripts @flindex tex-make.c @vindex kpse_make_specs The following table shows the default name of the script for each possible file types. (The source is the variable @code{kpse_make_specs} in @file{kpathsea/tex-make.c}.) @table @file @item MakeTeXPK @pindex MakeTeXPK Glyph fonts. @item MakeTeXTeX @pindex MakeTeXTeX @TeX{} input files. @item MakeTeXMF @pindex MakeTeXMF Metafont input files. @item MakeTeXTFM @pindex MakeTeXTFM TFM files. @end table @vindex DVIPSMAKEPK @vindex XDVIMAKEPK @noindent These names are overridden by an environment variable specific to the program---@samp{DVIPSMAKEPK} and @samp{XDVIMAKEPK}, in the case of Dvipsk and Xdvik. @node MakeTeX... script arguments @subsubsection @file{MakeTeX}@dots{} script arguments @cindex arguments to @file{MakeTeX}@dots{} The first argument to a @file{MakeTeX}@dots{} script is always the name of the file to be created. In the case of @file{MakeTeXPK}, there are three or four additional arguments passed, via corresponding environment variables: @enumerate @item @vindex KPATHSEA_DPI The dpi to make the font at (@samp{KPATHSEA_DPI}). @item @vindex MAKETEX_BASE_DPI @cindex base dpi The ``base dpi'' the program is operating at (@samp{MAKETEX_BASE_DPI}), i.e., the assumed resolution of the output device. @item @vindex MAKETEX_MAG @vindex mag @r{Metafont variable} @cindex magstep for @file{MakeTeXPK} A ``magstep'' string suitable for assigning to the Metafont @code{mag} variable (@samp{MAKETEX_MAG}). @item @vindex MAKETEX_MODE @vindex mode @r{Metafont variable} @cindex Metafont mode name for @file{MakeTeXPK} Optionally, a Metafont mode name for assigning to the Metafont @code{mode} variable (@samp{MAKETEX_MODE}). @item @vindex mtp_destdir @cindex destination directory for @file{MakeTeXPK} Optionally, a directory name. If the directory is absolute, it is used as-is. Otherwise, it is appended to the root destination directory set at compile-time (the Make variable @code{mtp_destdir}). If this argument is not supplied, the mode name is appended to @code{mtp_destdir}. @end enumerate @noindent Kpathsea sets @samp{KPATHSEA_DPI} appropriately for each attempt at building a font. It's up to the program using Kpathsea to set the others. @vindex MAKETEXPK @r{environment variable} @cindex specification for @file{MakeTeXPK} You can change the specification for the arguments passed to the external script by setting the environment variable named as the script name, but all capitals---@samp{MAKETEXPK}, for example. If you've changed the script name by setting (say) @samp{DVIPSMAKEPK} to @samp{foo}, then the spec is taken from the environment variable @samp{FOO}. The spec can contain any variable references, to the above variables or any others you might have set. As an example, the default spec for @file{MakeTeXPK} is @example $KPATHSEA_DPI $MAKETEX_BASE_DPI $MAKETEX_MAG $MAKETEX_MODE @end example @noindent The convention of passing the name of the file to be created as the first argument cannot be changed. @node Fallback font @subsection Fallback font @cindex fallback font @cindex fallback resolutions @cindex font of last resort @cindex resolutions, last-resort @cindex last-resort font @vindex DVIPSSIZES @vindex XDVISIZES @vindex TEXSIZES @vindex default_texsizes If a bitmap font cannot be found or created at the requested size, Kpathsea looks for the font at a set of @dfn{fallback resolutions}. You specify these resolutions as a colon-separated list (like search paths). Kpathsea looks first for a program-specific environment variable (@samp{DVIPSSIZES} and @samp{XDVISIZES}, in the case of Dvipsk and Xdvik), then the environment variable @samp{TEXSIZES}, then a default specified at compilation time (the Make variable @code{default_texsizes}). You can set this list to be empty if you prefer to find fonts at their stated size or not at all. Finally, if the font cannot be found even at the fallback resolutions, Kpathsea looks for a fallback font, typically @samp{cmr10}. Programs must enable this feature by assigning to the global variable @code{kpse_fallback_font}; the default is no such fallback font. octave-1.1.0/kpathsea/userspec.texi100666 415 17 32437 5544327541 15525 0ustar jweusers@c Copyright (C) 1993, 94 Karl Berry. @c For copying conditions, see the file copying.texi. @node Path specifications @chapter Path specifications @cindex path specification @cindex specifying search paths @cindex search path specification This chapter describes the user interface of the path specifications that the Kpathsearch library implements. Conceptually, there are three stages: look in an externally-built database, generating a list of directories in which to search, and finally looking up files using that list. The sections below describe each of these in turn. @cindex lazy evaluation In the implementation, however, these stages are interleaved---directory lists are only generated as needed for a particular file lookup, and only if a file cannot be found in the pre-existing database, and then they are cached for future lookups. (Analogous to lazy evaluation in programming languages.) This implies that directories that are created @emph{during} the run are not seen. @menu * Filename database:: Using an externally-built file to search. * Directory list generation:: Specifying where to search. * File lookups:: Finding files in directory lists. @end menu @node Filename database @section Filename database @cindex filename database @cindex database for filename searches @cindex externally-built filename database Kpathsearch goes to some lengths to minimize disk accesses for searches (@pxref{Subdirectory problems}). Nevertheless, at installations with hundreds of directories, doing a linear search of each directory for a given file can take some time, depending on the speed of the disk, whether it's NFS-mounted, and so on. @flindex ls-R @r{database file} Therefore, Kpathsearch can use an externally-built ``database'' that maps files to directories, thus avoiding the need to search the disk. By convention, the file is named @file{ls-R}, and is located at the root of the @TeX{} installation hierarchy. Presently, one and only one @file{ls-R} is read; its location is determined at compile-time. You can build the file with the command @code{ls -R @var{root-dir} >ls-R}, if your @code{ls} produces the right output format (see the section below). GNU @code{ls}, for example, does output in this format. It is probably most useful to do this via @code{cron}, so changes in the installed files will be automatically reflected (albeit with some delay) in the database. @kindex %% @r{in path specifications} Because the database may be out-of-date for a particular run (if a font was just built with @code{MakeTeXPK}, for example), if a file is not found in the database, by default Kpathsearch goes ahead and searches the disk. If a given path element begins with @samp{%%}, however, @emph{only} the database will be searched; the disk is never searched. (If the database does not exist, nothing will be searched.) Because this can lead to great surprise on the part of users (``I see the font @file{foo.tfm} when I do an @code{ls}; why can't Dvips find it?''), I recommend using this only as a last resort. @menu * Database format:: Precise details of the database. @end menu @node Database format @subsection Database format @cindex format of external database @cindex database, format of The ``database'' read by Kpathsearch is a line-oriented file of plain text. The format is that generated by GNU (and perhaps other) @code{ls} programs given the @samp{-R} option, as follows. Blank lines are ignored. If a line begins with @samp{/} and ends with a colon, it's the name of a directory. All other lines name entries in the most recently seen directory @samp{/}'s in such lines will yield possibly-strange results. Files listed with no preceding directory are ignored. For example, here's the first few lines of @file{ls-R} on my system: @example bibtex dvips fonts ini ls-R mf tex /usr/local/lib/texmf/bibtex: bib bst doc /usr/local/lib/texmf/bibtex/bib: asi.bib bibshare btxdoc.bib @end example @node Directory list generation @section Directory list generation @cindex directory list generation @cindex generation of directory lists @cindex environment variable, source for path @cindex configuration file, source for path @cindex compilation value, source for path @cindex sources for path Kpathsearch constructs a directory list from an environment variable @var{var} set by the user, (possibly) a setting from a configuration file, and a default path set at compile time. Each of these are colon-separated lists of directories. If @var{var} is set, its value is used; otherwise, if a config file defines a value, that value is used; otherwise, the compilation default is used. In any case, once the path specification to use is determined, its evaluation is independent of its source. @cindex magic characters @kindex : @r{may not be :} @kindex / @r{may not be /} The ``colon'' and ``slash'' mentioned below aren't necessarily @samp{:} and @samp{/} on non-Unix systems; the library tries to adapt these characters to other operating systems' conventions. @cindex expansion, in paths The following subdirectories explain the various kinds of @dfn{expansion} the path is subjected to. After expansion, nonexistent directories in the path is ignored. @menu * Default expansion:: Extra colons expand to the compilation default. * Tilde expansion:: ~ and ~user expand to home directories. * Variable expansion:: $foo and $@{foo@} expand to environment values. * Subdirectory expansion:: a// and a//b recursively expand to subdirs. * Path specification example:: An example. @end menu @node Default expansion @subsection Default expansion @kindex :: @cindex doubled colon, in paths @cindex extra colons in paths @cindex default expansion @cindex expansion, default If an environment variable or config file value has a leading or trailing or doubled colon, the default path is inserted at that point. Putting an extra colon into the default value has unpredictable results, and may cause the program to crash, so installers beware. @node Tilde expansion @subsection Tilde expansion @kindex ~ @cindex home directories in paths @cindex tilde expansion @cindex expansion, tilde A leading @samp{~} or @samp{~@var{user}} in a path component is replaced by the current or @var{user}'s home directory, respectively. If @var{user} is invalid, or the home directory cannot be determined, Kpathsea uses @file{.} instead. @node Variable expansion @subsection Variable expansion @kindex $ @cindex environment variables in paths @cindex variable expansion @cindex expansion, variable A construct @samp{$foo} or @samp{$@{foo@}} is replaced by the expansion of the environment variable @samp{foo}. In the first case, the variable name consists of consecutive alphanumeric-or-underscore characters. In the second, the variable name consists of everything between the braces. Remember to quote the @samp{$}'s and braces as necessary for your shell. @emph{Shell} variable values cannot be seen by Kpathsea. @node Subdirectory expansion @subsection Subdirectory expansion @kindex // @cindex subdirectory searching @cindex expansion, subdirectory If a component directory @var{d} contains @samp{//}, all subdirectories of @var{d} are included in the path: first those subdirectories directly under @var{d}, then the subsubdirectories under those, and so on. At each level, the order in which the directories are searched is unspecified. If you specify any filename components after the @samp{//}, only subdirectories which have those components are included. For example, @samp{/a//b} would expand into directories @file{/a/1/b}, @file{/a/2/b}, @file{/a/1/1/b}, and so on, but not @file{/a/b/c} or @file{/a/1}. @menu * Subdirectory problems:: If you have trouble with subdirectories. @end menu @node Subdirectory problems @subsubsection Subdirectory problems @cindex problems with subdirectory searching @cindex subdirectory searching problems @cindex excessive startup time @cindex slow startup time Perhaps the first problem is best put as a question-and-answer. Question: I know all about slow starting @TeX{} @samp{:-)}. How do I organize the directory scheme to avoid the slowness, while at the same time enjoying a structured inputs directory? (Naturally, this applies to any Kpathsea-using program, not just @TeX{}.) I will give the false Short Answer first, then the Real Explanation. The Short Answer: in your equivalent of @file{/usr/local/lib/tex/macros//} and @file{.../fonts//}, make each subdirectory contain either 1) only directories; or 2) only files. As long as you do not have (literally) hundreds of subdirectories, this should cure the problem. It has in every case I have been told about. The Real Explanation: the thing that makes @TeX{} slow is calling @code{stat} (if you don't know what @code{stat} (2) is, ignore this explanation) on ``too many'' pathnames, where ``too many'' is some nebulous number depending on things like whether the filesystem is NFS-mounted or not, whether it's on a fast disk, whether your Fast File System implementation is really Fast, etc., etc. (Side note: If you're curious, you can find this number by writing a program that does nothing but read filenames (presumably from a file) and stat them, and see how many pathnames make the execution time noticeable. On the systems I use (Suns with an NFS-mounted directory, ISC 2.2.1 and a local directory), it's several hundred, at least. On an NFS-mounted directory under Solaris 2.1, 150 is quite slow, according to @samp{hammer@@kis.uni-freiburg.de}.) Whether or not it's directories or files that are being stat-ed is irrelevant (this is why the Short Answer is false). It's sheer numbers that count. @vindex DEBUG_STAT @vindex kpathsea_debug @cindex debugging slow startup time @flindex debug.h If you think your directory structure is ok, and you're still experiencing slowness, I advise running @TeX{} (or whatever program) under a debugger, setting the bit @code{DEBUG_STAT} in the variable @code{kpathsea_debug} (see @file{debug.h}) to one and seeing exactly what is getting stat-ed. If only few things are getting stat-ed, and @TeX{} is still slow, tell me. @cindex trick for detecting leaf directories @cindex leaf directory trick I should also mention ``the trick'', which I stole from GNU find. (Matthew Farwell @samp{} suggested it, and David MacKenzie @samp{} implemented it, as far as I know.) @vindex st_nlink The trick is that in every real Unix implementation (that I know about) (as opposed to the POSIX specification), a directory which contains no subdirectories will have exactly two links (specifically, one each for @file{.} and @file{..}). That is to say, the @code{st_nlink} field in the stat structure will be two. Thus, the path searching code doesn't have to stat every entry in the bottom-level directories---it can check @code{st_nlink}, and if it's two, it knows there are no subdirectories. But if you have a directory that contains *one* subdirectory and five hundred files, @code{st_nlink} will be 3, and Kpathsea has to stat every one of those 501 entries. Therein lies slowness. @vindex UNIX_ST_LINK You can disable the trick by undefining UNIX_@code{ST_LINK} in @file{kpathsea/config.h}. @cindex symbolic links not found @cindex leaf directories wrongly guessed The subdirectory searching has one other known (and irreconciliable) deficiency. If a directory @var{d} being searched for subdirectories contains plain files and symbolic links to other directories, but no true subdirectories, @var{d} will be considered a leaf directory, i.e., the symbolic links will not be followed. The directory immediately followed by the @samp{//}, however, is always searched for subdirectories, even if it is a ``leaf''. We do this since presumably you would not have asked for the directory to be searched for subdirectories if you didn't want it to be. This is a consequence of the trick explained above. You can work around this problem by creating an empty dummy subdirectory in @var{d}; then @var{d} will no longer be a leaf, and the symlinks will be followed. @node Path specification example @subsection Path specification example @cindex path specification, example For example, the following value for an environment variable says to search the following: the current user's @file{fonts} directory and alll its subdirectories, then the directory @file{fonts} in user @samp{karl}s home directory, and finally the system default directories specified at compilation time. @example ~/fonts//:~karl/fonts: @end example @node File lookups @section File lookups @cindex filename lookup @cindex lookup of filenames Given the directory list generated from the rules in the previous section, looking up a file presents no problem at all: we just look in each directory in the list in turn, and return the first one found. @cindex absolute filenames @cindex relative filenames @cindex explicitly relative filenames @cindex filenames, absolute or explicitly relative The only complication is if the filename is absolute or explicitly relative, i.e., (under Unix-like operating systems) starts with @samp{/} or @samp{./} or @samp{../}. Then the library does not use the directory list at all. Instead, the file is simply searched for in the given directory. In an attempt to speed lookups, the directory in which a file is found is floated to the top of the directory list. This helps in the common case of several files in the same directory being searched for. octave-1.1.0/kpathsea/common.ac100666 415 17 2523 5532215614 14541 0ustar jweusersdnl Common Autoconf sinclude file for kpathsea-using programs. (Have to dnl use the m4 `sinclude' builtin instead of `include', since Autoconf dnl disables `include'.) dnl Write output here, instead of putting a zillion -D's on the command line. AC_CONFIG_HEADER(c-auto.h) AC_PROG_CC AC_PROG_CPP AC_PROG_INSTALL AC_PROG_RANLIB AC_ISC_POSIX AC_DIR_HEADER AC_XENIX_DIR AC_STDC_HEADERS AC_HAVE_HEADERS(assert.h float.h limits.h memory.h pwd.h stdlib.h \ string.h unistd.h) AC_HAVE_FUNCS(memmove putenv) # It would be nicer to test for the requisite putenv features directly, # but can't figure out how to do that. if test "`(uname) 2>/dev/null`" = NetBSD \ || test "`(uname) 2>/dev/null`" = FreeBSD; then AC_DEFINE(SMART_PUTENV) fi AC_CONST # Any assignment to VPATH causes various Sun make's (both SunOS and # Solaris) to only execute the first set of double-colon rules, as in # the following 5-line Makefile. Since we use :: rules for distclean and # other important targets, we just remove the VPATH lines if they # defined it to be simply `.'. # VPATH = foo # target:: # echo first # target:: # echo second # The line we're matching here is # VPATH = # with arbitrary spaces and tabs around each of the elements. if test x$srcdir = x.; then changequote(,) extrasub='/^[ ]*VPATH[ ]*=[ ]*/d' changequote([,]) fi octave-1.1.0/kpathsea/c-auto.h100666 415 17 3160 5674167565 14325 0ustar jweusers/* kpathsea/c-auto.h. Generated automatically by configure. */ /* Generated by autoheader. */ /* Used only when making the library standalone. */ /* c-auto.h.in. Generated automatically from configure.in by autoheader. */ /* Define to empty if the keyword does not work. */ /* #undef const */ /* Define if you have dirent.h. */ /* #undef DIRENT */ /* Define if you don't have dirent.h, but have ndir.h. */ /* #undef NDIR */ /* Define if you need to in order for stat and other things to work. */ /* #undef _POSIX_SOURCE */ /* Define if you have the ANSI C header files. */ /* #undef STDC_HEADERS */ /* Define if you don't have dirent.h, but have sys/dir.h. */ /* #undef SYSDIR */ /* Define if you don't have dirent.h, but have sys/ndir.h. */ /* #undef SYSNDIR */ /* Define if the closedir function returns void instead of int. */ /* #undef VOID_CLOSEDIR */ /* Define if you have memmove. */ /* #undef HAVE_MEMMOVE */ /* Define if you have putenv. */ #define HAVE_PUTENV 1 /* Define if you have the header file. */ #define HAVE_ASSERT_H 1 /* Define if you have the header file. */ #define HAVE_FLOAT_H 1 /* Define if you have the header file. */ #define HAVE_LIMITS_H 1 /* Define if you have the header file. */ #define HAVE_MEMORY_H 1 /* Define if you have the header file. */ #define HAVE_PWD_H 1 /* Define if you have the header file. */ #define HAVE_STDLIB_H 1 /* Define if you have the header file. */ #define HAVE_STRING_H 1 /* Define if you have the header file. */ #define HAVE_UNISTD_H 1 /* #undef SMART_PUTENV */ octave-1.1.0/kpathsea/Makefile100666 415 17 64014 5705371126 14432 0ustar jweusers# Generated automatically from Makefile.in by configure. # Makefile for kpathsea --karl@cs.umb.edu. version = 1.8 lib = libkpathsea.a # The following make definitions (down to `end of installation # directories') are repeated in several Makefiles, because different # installations like to change them at different levels. If you edit the # top-level Makefile, the changes should propagate, however. # # The following define installation directories. The default paths are # defined in kpathsea/paths.h, which is built from kpathsea/paths.h.in. # See kpathsea/INSTALL for a description of how the various path-related # files are used and created. # Generic installation directories. prefix = /usr/local exec_prefix = $(prefix) bindir = $(exec_prefix)/bin scriptdir = $(bindir) libdir = $(exec_prefix)/lib datadir = $(prefix)/lib infodir = $(prefix)/info includedir = $(prefix)/include manext = 1 mandir = $(prefix)/man/man$(manext) # TeX & MF-specific directories. Not all of the following are relevant # for all programs, but it seems cleaner to collect everything in one place. # The default paths are now in kpathsea/paths.h.in. Passing all the # paths to sub-makes can make the arg list too long on system V. # The root of the tree. texmf_prefix = $(datadir)/texmf # TeX and MF source files. texinputdir = $(texmf_prefix)/tex mfinputdir = $(texmf_prefix)/mf # The top-level font directory. fontdir = $(texmf_prefix)/fonts # Where memory dumps are installed. fmtdir = $(texmf_prefix)/ini basedir = $(fmtdir) # Pool files. texpooldir = $(texmf_prefix)/ini mfpooldir = $(texpooldir) # If install_fonts=true, the PostScript/LaserJet TFM and VF files for # the builtin fonts get installed in subdirectories of this directory, # named for the typeface families of these directories. If you don't # have the default directory setup, you will want to set # install_fonts=false. install_fonts = true ps_fontdir = $(fontdir)/adobe bh_fontdir = $(fontdir)/bh cg_fontdir = $(fontdir)/cg mt_fontdir = $(fontdir)/monotype # Where the configuration files get installed. dvips_prefix = $(texmf_prefix)/dvips configdir = $(dvips_prefix) # Where the PostScript prologues go. headerdir = $(configdir) # Where dvips' TeX macro files get installed. psmacrodir = $(texinputdir)/dvips # If a font can't be found close enough to its stated size, we look for # each of these sizes in the order given. This colon-separated list is # overridden by the envvar TEXSIZES, and by a program-specific variable # (e.g., XDVISIZES), and perhaps by a config file (e.g., in dvips). default_texsizes = 300:600 # Full filename of the database file. It is not an error for this file # not to exist. See the `Filename database' node in the kpathsea # documentation for details. db_dir = $(texmf_prefix) db_name = ls-R # End of installation directory definitions. # Add -DNO_DEBUG to squeeze out the last bit of performance. DEFS = $(XDEFS) # Set this to gmalloc.o to use GNU malloc. malloc = CC = gcc # CFLAGS is used for both compilation and linking. CFLAGS = -g -O -Wall $(XCFLAGS) # Do not override CPPFLAGS; change CFLAGS or DEFS instead. CPPFLAGS = $(XCPPFLAGS) -I. -I$(srcdir) \ -I$(kpathsea_parent) -I$(kpathsea_srcdir_parent) \ $(x_include_flags) $(DEFS) .c.o: $(CC) $(CPPFLAGS) $(CFLAGS) -c $< # Linking. LDFLAGS = $(CFLAGS) $(XLDFLAGS) LOADLIBES = $(kpathsea) $(x_libs) $(LIBS) -lm $(x_extra_libs) $(XLOADLIBES) # This is so kpathsea will get remade automatically if you change # something in it and recompile from the package directory. kpathsea_parent = .. kpathsea_dir = $(kpathsea_parent)/kpathsea kpathsea_srcdir_parent = $(srcdir)/.. kpathsea_srcdir = $(kpathsea_srcdir_parent)/kpathsea kpathsea = $(kpathsea_dir)/libkpathsea.a # Stuff for making libraries. AR = ar ARFLAGS = cq RANLIB = ranlib # Installation. INSTALL = /usr/local/gnu/bin/install -c INSTALL_PROGRAM = ${INSTALL} INSTALL_DATA = ${INSTALL} -m 644 # Install these header files. install_headers = *.h MAKEINFO = makeinfo MAKEINFO_FLAGS = --paragraph-indent=2 -I$(HOME)/gnu/gnuorg # That -I is purely for my own benefit in doing `make dist'. It won't # hurt anything for you (I hope). TEXI2DVI = texi2dvi .SUFFIXES: .info .texi .texi.info: $(MAKEINFO) $(MAKEINFO_FLAGS) $< -o $@ .SUFFIXES: .dvi .texi .texi.dvi: $(TEXI2DVI) $(TEXI2DVI_FLAGS) $< -o $@ SHELL = /bin/sh srcdir = . # Put tex-file.o first, because it's what depends on the paths, and may # reduce frustration in recompiling if the paths are wrong by doing it first. objects = tex-file.o absolute.o concat.o concat3.o concatn.o db.o \ debug.o default.o dir.o elt-dirs.o expand.o extend-fname.o file-p.o \ find-suffix.o fn.o fontmap.o hash.o init-path.o itoa.o line.o make-suffix.o \ path-elt.o pathsearch.o putenv.o readable.o rm-suffix.o str-list.o \ str-llist.o tex-glyph.o tex-make.o tilde.o truncate.o uppercasify.o \ variable.o version.o xcalloc.o xfopen.o xmalloc.o xopendir.o xputenv.o \ xrealloc.o xstat.o xstrdup.o $(malloc) all: $(lib) # kpathsea.info $(lib): $(objects) rm -f $(lib) $(AR) $(ARFLAGS) $(lib) $(objects) $(RANLIB) $(lib) $(kpathsea_dir)/paths.h: $(srcdir)/paths.h.in rm -f paths.h echo "/* paths.h: Generated from paths.h.in (`date`). */" >paths.h sed \ -e 's,(texmf_prefix),$(texmf_prefix),g' \ -e 's,(texinputdir),$(texinputdir),g' \ -e 's,(mfinputdir),$(mfinputdir),g' \ -e 's,(fontdir),$(fontdir),g' \ -e 's,(fmtdir),$(fmtdir),g' \ -e 's,(basedir),$(basedir),g' \ -e 's,(texpooldir),$(texpooldir),g' \ -e 's,(mfpooldir),$(mfpooldir),g' \ -e 's,(ps_fontdir),$(ps_fontdir),g' \ -e 's,(dvips_prefix),$(dvips_prefix),g' \ -e 's,(configdir),$(configdir),g' \ -e 's,(headerdir),$(headerdir),g' \ -e 's,(psmacrodir),$(psmacrodir),g' \ $(srcdir)/paths.h.in >> paths.h tex-file.o: $(CC) $(CPPFLAGS) -DDEFAULT_FONT_SIZES=\"$(default_texsizes)\" \ $(CFLAGS) -c $(srcdir)/tex-file.c db.o: $(CC) $(CPPFLAGS) -DDB_DIR=\"$(db_dir)\" -DDB_NAME=\"$(db_name)\" \ $(CFLAGS) -c $(srcdir)/db.c pathsearch.o: $(CC) $(CPPFLAGS) -DDB_DIR=\"$(db_dir)\" \ $(CFLAGS) -c $(srcdir)/pathsearch.c # Need the -DHAVE_CONFIG_H. gmalloc.o: $(CC) $(CPPFLAGS) -DHAVE_CONFIG_H $(CFLAGS) -c $(srcdir)/gmalloc.c check: install: #install-exec install-data uninstall: #uninstall-exec uninstall-data install-exec: $(lib) $(SHELL) $(srcdir)/../mkdirchain $(libdir) $(INSTALL_DATA) $(lib) $(libdir)/$(lib) uninstall-exec: rm -f $(libdir)/$(lib) install-info: for f in kpathsea.info*; do $(INSTALL_DATA) $$f $(infodir)/$$f; done install-data: install-info $(SHELL) $(srcdir)/../mkdirchain $(infodir) $(includedir) for f in $(install_headers); do \ $(INSTALL_DATA) $$f $(includedir)/$$f; done rm -f $(includedir)/c-auto.h uninstall-data: rm -f $(infodir)/kpathsea.info* for f in $(install_headers); do \ rm -f $(includedir)/$$f; done # distdir is used by other distributions; they define $(distdir). distdir: INSTALL TAGS kpathsea.info # Install new info files locally. cp -pf kpathsea.info* $(info) rm -rf $(distdir) mkdir -p $(distdir) ln $(ln_files) HIER $(distdir) cp -p $(HOME)/gnu/gnuorg/*.texi $(distdir) ln PROJECTS *.info* *.texi common.ac $(distdir) cd $(distdir); rm -f c-auto.h paths.h cd $(distdir); add-version $(version) version.c # I define $(autoconf) to acgeneral.m4 and the other Autoconf files, so # configure automatically gets remade with a new Autoconf release. But # since some people do not have AC installed, I take out the variable # $(autoconf) definition before release. #configure_in = $(srcdir)/configure.in $(srcdir)/../kpathsea/common.ac #$(srcdir)/configure: $(configure_in) $(autoconf) # cd $(srcdir); autoconf # #config.status: $(srcdir)/configure # $(SHELL) $(srcdir)/configure --no-create --verbose # #Makefile: $(srcdir)/Makefile.in config.status # $(SHELL) config.status # # This rule isn't used for web2c or the top-level Makefile, but it # doesn't hurt. We don't depend on config.status because configure # always rewrites config.status, even when it doesn't change. Thus it # might be newer than c-auto.h when we don't need to remake the latter. #c-auto.h: $(srcdir)/c-auto.h.in # $(SHELL) config.status # #$(srcdir)/c-auto.h.in: $(configure_in) # rm -f $(srcdir)/c-auto.h.in # echo '/* Generated by autoheader. */' >$(srcdir)/c-auto.h.in # echo '/* Used only when making the library standalone. */' \ # >>$(srcdir)/c-auto.h.in # @echo 'SMART_PUTENV will not be covered.' # -cd $(srcdir); autoheader configure.in >>c-auto.h.in # echo '#undef SMART_PUTENV' >>$(srcdir)/c-auto.h.in dvi: kpathsea.dvi kpathsea.dvi: *.texi info: kpathsea.info kpathsea.info: *.texi INSTALL: install.texi $(MAKEINFO) $(MAKEINFO_FLAGS) --no-headers --no-split \ kpathsea.texi -o - \ | sed -n '/^Installation/,/^Path spec/'p \ | sed '$$d' > INSTALL TAGS: *.c *.h etags -t *.c *.h mostlyclean:: rm -f *.o $(program) $(lib) $(programs) clean:: mostlyclean rm -f *.dvi *.lj distclean:: clean rm -f Makefile config.status c-auto.h *.pool # Although we can remake configure and c-auto.h.in, we don't remove # them, since many people may lack Autoconf. Use configclean for that. realclean:: distclean rm -f TAGS *.info* extraclean:: rm -f *.aux *.bak *.bbl *.blg *.dvi *.log *.orig *.pl *.rej rm -f *.i *.s *.tfm *.vf *.vpl *\#* *gf *pk *~ rm -f CONTENTS.tex a.out core mfput.* texput.* configclean: rm -f configure c-auto.h.in c-auto.h # Prevent GNU make 3 from overflowing arg limit on system V. .NOEXPORT: distclean:: rm -f paths.h depend_encies = $(kpathsea_dir)/paths.h # Dependencies. # Have to use -M, not -MM, since we use instead of # "kpathsea/..." in the sources. But then have to remove the directory # prefixes and all the system include files. depend depend.make: c-auto.h $(depend_encies) $(CC) -M $(CPPFLAGS) *.c \ | sed -e 's,\.\./kpathsea,$$(kpathsea_dir),g' \ -e 's,/usr[^ ]* ,,g' \ | uniq \ >depend.make absolute.o : absolute.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/absolute.h $(kpathsea_dir)/c-pathch.h concat.o : concat.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h concat3.o : concat3.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h concatn.o : concatn.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/concatn.h $(kpathsea_dir)/c-vararg.h db.o : db.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/db.h \ $(kpathsea_dir)/str-list.h $(kpathsea_dir)/hash.h $(kpathsea_dir)/line.h $(kpathsea_dir)/readable.h debug.o : debug.c $(kpathsea_dir)/debug.h default.o : default.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/default.h dir.o : dir.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h \ $(kpathsea_dir)/dir.h elt-dirs.o : elt-dirs.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/dir.h \ $(kpathsea_dir)/expand.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h expand.o : expand.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/tilde.h $(kpathsea_dir)/variable.h extend-fname.o : extend-fname.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h file-p.o : file-p.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h find-suffix.o : find-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h fn.o : fn.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/fn.h fontmap.o : fontmap.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/fontmap.h $(kpathsea_dir)/hash.h \ $(kpathsea_dir)/line.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/str-list.h gmalloc.o : gmalloc.c \ getpagesize.h hash.o : hash.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/hash.h $(kpathsea_dir)/str-list.h init-path.o : init-path.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/default.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h itoa.o : itoa.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h line.o : line.c make-suffix.o : make-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h path-elt.o : path-elt.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h pathsearch.o : pathsearch.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/absolute.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/db.h \ $(kpathsea_dir)/str-list.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/readable.h putenv.o : putenv.c $(kpathsea_dir)/c-auto.h readable.o : readable.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-stat.h \ $(kpathsea_dir)/readable.h $(kpathsea_dir)/truncate.h rm-suffix.o : rm-suffix.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h str-list.o : str-list.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/str-list.h str-llist.o : str-llist.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/str-llist.h tex-file.o : tex-file.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/default.h $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h \ $(kpathsea_dir)/tex-file.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h $(kpathsea_dir)/paths.h tex-glyph.o : tex-glyph.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/expand.h $(kpathsea_dir)/fontmap.h $(kpathsea_dir)/hash.h \ $(kpathsea_dir)/pathsearch.h $(kpathsea_dir)/str-llist.h $(kpathsea_dir)/tex-file.h $(kpathsea_dir)/default.h \ $(kpathsea_dir)/init-path.h $(kpathsea_dir)/c-vararg.h $(kpathsea_dir)/paths.h $(kpathsea_dir)/tex-glyph.h \ $(kpathsea_dir)/tex-make.h $(kpathsea_dir)/variable.h tex-make.o : tex-make.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-fopen.h $(kpathsea_dir)/concatn.h $(kpathsea_dir)/c-vararg.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/readable.h $(kpathsea_dir)/tex-make.h $(kpathsea_dir)/tex-file.h \ $(kpathsea_dir)/default.h $(kpathsea_dir)/init-path.h $(kpathsea_dir)/paths.h $(kpathsea_dir)/variable.h tilde.o : tilde.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/tilde.h truncate.o : truncate.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-namemx.h $(kpathsea_dir)/c-pathch.h $(kpathsea_dir)/c-pathmx.h \ $(kpathsea_dir)/truncate.h uppercasify.o : uppercasify.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-ctype.h variable.o : variable.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/c-ctype.h \ $(kpathsea_dir)/fn.h $(kpathsea_dir)/variable.h version.o : version.c xcalloc.o : xcalloc.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xfopen.o : xfopen.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xmalloc.o : xmalloc.c xopendir.o : xopendir.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h \ $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/dir.h xputenv.o : xputenv.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h xrealloc.o : xrealloc.c xstat.o : xstat.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h $(kpathsea_dir)/xstat.h $(kpathsea_dir)/c-stat.h xstrdup.o : xstrdup.c $(kpathsea_dir)/config.h ./c-auto.h $(kpathsea_dir)/c-std.h \ $(kpathsea_dir)/c-unistd.h $(kpathsea_dir)/systypes.h \ $(kpathsea_dir)/c-memstr.h \ $(kpathsea_dir)/c-errno.h \ $(kpathsea_dir)/c-minmax.h $(kpathsea_dir)/c-limits.h \ $(kpathsea_dir)/c-proto.h $(kpathsea_dir)/lib.h $(kpathsea_dir)/types.h \ $(kpathsea_dir)/debug.h octave-1.1.0/libcruft/ 40777 415 17 0 5705521670 12663 5ustar jweusersoctave-1.1.0/libcruft/balgen/ 40777 415 17 0 5705521616 14113 5ustar jweusersoctave-1.1.0/libcruft/balgen/Makefile.in100666 415 17 507 5662226316 16240 0ustar jweusers# # Makefile for octave's libcruft/balgen directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/balgen/balgen.f100666 415 17 6527 5423602541 15613 0ustar jweusers subroutine balgen (n,ma,a,mb,b,low,igh,cscale,cperm,wk) c c *****parameters: integer igh,low,ma,mb,n double precision a(ma,n),b(mb,n),cperm(n),cscale(n),wk(n,6) c c *****local variables: c none c c *****functions: c none c c *****subroutines called: c reduce, scaleg, gradeq c c --------------------------------------------------------------- c c *****purpose: c this subroutine balances the matrices a and b to improve the c accuracy of computing the eigensystem of the generalized c eigenproblem a*x = (lambda)*b*x. the algorithm is specifically c designed to precede qz type algorithms, but improved performance c is expected from most eigensystem solvers. c ref.: ward, r. c., balancing the generalized eigenvalue c problem, siam j. sci. stat. comput., vol. 2, no. 2, june 1981, c 141-152. c c *****parameter description: c c on input: c c ma,mb integer c row dimensions of the arrays containing matrices c a and b respectively, as declared in the main calling c program dimension statement; c c n integer c order of the matrices a and b; c c a real(ma,n) c contains the a matrix of the generalized eigenproblem c defined above; c c b real(mb,n) c contains the b matrix of the generalized eigenproblem c defined above; c c wk real(n,6) c work array that must contain at least 6*n storage c locations. wk is altered by this subroutine. c c on output: c c a,b contain the balanced a and b matrices; c c low integer c beginning -1 of the submatrices of a and b c containing the non-isolated eigenvalues; c c igh integer c ending -1 of the submatrices of a and b c containing the non-isolated eigenvalues. if c igh = 1 (low = 1 also), the a and b matrices have c been permuted into upper triangular form and have c not been balanced; c c cscale real(n) c contains the exponents of the column scaling factors c in its low through igh locations and the reducing c column permutations in its first low-1 and its c igh+1 through n locations; c c cperm real(n) c contains the column permutations applied in grading c the a and b submatrices in its low through igh c locations; c c wk contains the exponents of the row scaling factors c in its low through igh locations, the reducing row c permutations in its first low-1 and its igh+1 c through n locations, and the row permutations c applied in grading the a and b submatrices in its c n+low through n+igh locations. c c *****algorithm notes: c none c c *****history: c written by r. c. ward....... c c --------------------------------------------------------------- c call reduce (n,ma,a,mb,b,low,igh,cscale,wk) if (low .eq. igh) go to 10 call scaleg (n,ma,a,mb,b,low,igh,cscale,cperm,wk) call gradeq (n,ma,a,mb,b,low,igh,cperm,wk(1,2)) 10 continue return c c last line of balgen c end octave-1.1.0/libcruft/balgen/gradeq.f100666 415 17 11536 5423602541 15642 0ustar jweusers subroutine gradeq (n,ma,a,mb,b,low,igh,cperm,wk) c c *****parameters: integer igh,low,ma,mb,n double precision a(ma,n),b(mb,n),cperm(n),wk(n,2) c c *****local variables: integer i,ighm1,im,ip1,j,jm,jp1,k double precision cmax,rmax,suma,sumb,temp c c *****fortran functions: double precision dabs c c *****subroutines called: c none c c --------------------------------------------------------------- c c *****purpose: c this subroutine grades the submatrices of a and b given by c starting -1 low and ending -1 igh in the generalized c eigenvalue problem a*x = (lambda)*b*x by permuting rows and c columns such that the norm of the i-th row (column) of the c a submatrix divided by the norm of the i-th row (column) of c the b submatrix becomes smaller as i increases. c ref.: ward, r. c., balancing the generalized eigenvalue c problem, siam j. sci. stat. comput., vol. 2, no. 2, june 1981, c 141-152. c c *****parameter description: c c on input: c c ma,mb integer c row dimensions of the arrays containing matrices c a and b respectively, as declared in the main calling c program dimension statement; c c n integer c order of the matrices a and b; c c a real(ma,n) c contains the a matrix of the generalized eigenproblem c defined above; c c b real(mb,n) c contains the b matrix of the generalized eigenproblem c defined above; c c low integer c specifies the beginning -1 for the rows and c columns of a and b to be graded; c c igh integer c specifies the ending -1 for the rows and columns c of a and b to be graded; c c wk real(n,2) c work array that must contain at least 2*n locations. c only locations low through igh and n+low through c n+igh are referenced by this subroutine. c c on output: c c a,b contain the permuted and graded a and b matrices; c c cperm real(n) c contains in its low through igh locations the c column permutations applied in grading the c submatrices. the other locations are not referenced c by this subroutine; c c wk contains in its low through igh locations the row c permutations applied in grading the submatrices. c c *****algorithm notes: c none. c c *****history: c written by r. c. ward....... c c --------------------------------------------------------------- c if (low .eq. igh) go to 510 ighm1 = igh-1 c c compute column norms of a / those of b c do 420 j = low,igh suma = 0.0d0 sumb = 0.0d0 do 410 i = low,igh suma = suma + dabs(a(i,j)) sumb = sumb + dabs(b(i,j)) 410 continue if (sumb .eq. 0.0d0) go to 415 wk(j,2) = suma / sumb go to 420 415 continue wk(j,2) = 1.0d38 420 continue c c permute columns to order them by decreasing quotients c do 450 j = low,ighm1 cmax = wk(j,2) jm = j jp1 = j+1 do 430 k = jp1,igh if (cmax .ge. wk(k,2)) go to 430 jm = k cmax = wk(k,2) 430 continue cperm(j) = jm if (jm .eq. j) go to 450 temp = wk(j,2) wk(j,2) = wk(jm,2) wk(jm,2) = temp do 440 i = 1,igh temp = b(i,j) b(i,j) = b(i,jm) b(i,jm) = temp temp = a(i,j) a(i,j) = a(i,jm) a(i,jm) = temp 440 continue 450 continue cperm(igh) = igh c c compute row norms of a / those of b c do 470 i = low,igh suma = 0.0d0 sumb = 0.0d0 do 460 j = low,igh suma = suma + dabs(a(i,j)) sumb = sumb + dabs(b(i,j)) 460 continue if (sumb .eq. 0.0d0) go to 465 wk(i,2) = suma / sumb go to 470 465 continue wk(i,2) = 1.0d38 c c permute rows to order them by decreasing quotients c 470 continue do 500 i = low,ighm1 rmax = wk(i,2) im = i ip1 = i+1 do 480 k = ip1,igh if (rmax .ge. wk(k,2)) go to 480 im = k rmax = wk(k,2) 480 continue wk(i,1) = im if (im .eq. i) go to 500 temp = wk(i,2) wk(i,2) = wk(im,2) wk(im,2) = temp do 490 j = low,n temp = b(i,j) b(i,j) = b(im,j) b(im,j) = temp temp = a(i,j) a(i,j) = a(im,j) a(im,j) = temp 490 continue 500 continue wk(igh,1) = igh 510 continue return c c last line of gradeq c end octave-1.1.0/libcruft/balgen/reduce.f100666 415 17 11021 5423602541 15633 0ustar jweusers subroutine reduce (n,ma,a,mb,b,low,igh,cscale,wk) c c *****parameters: integer igh,low,ma,mb,n double precision a(ma,n),b(mb,n),cscale(n),wk(n) c c *****local variables: integer i,iflow,ii,ip1,is,j,jp1,k,l,lm1,m double precision f c c *****functions: c none c c *****subroutines called: c none c c --------------------------------------------------------------- c c *****purpose: c this subroutine reduces, if possible, the order of the c generalized eigenvalue problem a*x = (lambda)*b*x by permuting c the rows and columns of a and b so that they each have the c form c u x y c 0 c z c 0 0 r c c where u and r are upper triangular and c, x, y, and z are c arbitrary. thus, the isolated eigenvalues corresponding to c the triangular matrices are obtained by a division, leaving c only eigenvalues corresponding to the center matrices to be c computed. c ref.: ward, r. c., balancing the generalized eigenvalue c problem, siam j. sci. stat. comput., vol. 2, no. 2, june 1981, c 141-152. c c *****parameter description: c c on input: c c ma,mb integer c row dimensions of the arrays containing matrices c a and b respectively, as declared in the main calling c program dimension statement; c c n integer c order of the matrices a and b; c c a real(ma,n) c contains the a matrix of the generalized eigenproblem c defined above; c c b real(mb,n) c contains the b matrix of the generalized eigenproblem c defined above. c c on output: c c a,b contain the permuted a and b matrices; c c low integer c beginning -1 of the submatrices of a and b c containing the non-isolated eigenvalues; c c igh integer c ending -1 of the submatrices of a and b c containing the non-isolated eigenvalues. if c igh = 1 (low = 1 also), the permuted a and b c matrices are upper triangular; c c cscale real(n) c contains the required column permutations in its c first low-1 and its igh+1 through n locations; c c wk real(n) c contains the required row permutations in its first c low-1 and its igh+1 through n locations. c c *****algorithm notes: c none c c *****history: c written by r. c. ward....... c c --------------------------------------------------------------- c k = 1 l = n go to 20 c c find row with one nonzero in columns 1 through l c 10 continue l = lm1 if (l .ne. 1) go to 20 wk(1) = 1 cscale(1) = 1 go to 200 20 continue lm1 = l-1 do 70 ii = 1,l i = l+1-ii do 30 j = 1,lm1 jp1 = j+1 if (a(i,j) .ne. 0.0d0 .or. b(i,j) .ne. 0.0d0) go to 40 30 continue j = l go to 60 40 continue do 50 j = jp1,l if (a(i,j) .ne. 0.0d0 .or. b(i,j) .ne. 0.0d0) go to 70 50 continue j = jp1-1 60 continue m = l iflow = 1 go to 150 70 continue go to 90 c c find column with one nonzero in rows k through n c 80 continue k = k+1 90 continue do 140 j = k,l do 100 i = k,lm1 ip1 = i+1 if (a(i,j) .ne. 0.0d0 .or. b(i,j) .ne. 0.0d0) go to 110 100 continue i = l go to 130 110 continue do 120 i = ip1,l if (a(i,j) .ne. 0.0d0 .or. b(i,j) .ne. 0.0d0) go to 140 120 continue i = ip1-1 130 continue m = k iflow = 2 go to 150 140 continue go to 200 c c permute rows m and i c 150 continue wk(m) = i if (i .eq. m) go to 170 do 160 is = k,n f = a(i,is) a(i,is) = a(m,is) a(m,is) = f f = b(i,is) b(i,is) = b(m,is) b(m,is) = f 160 continue c c permute columns m and j c 170 continue cscale(m) = j if (j .eq. m) go to 190 do 180 is = 1,l f = a(is,j) a(is,j) = a(is,m) a(is,m) = f f = b(is,j) b(is,j) = b(is,m) b(is,m) = f 180 continue 190 continue go to (10,80), iflow 200 continue low = k igh = l return c c last line of reduce c end octave-1.1.0/libcruft/balgen/scaleg.f100666 415 17 15426 5423602541 15637 0ustar jweusers subroutine scaleg (n,ma,a,mb,b,low,igh,cscale,cperm,wk) c c *****parameters: integer igh,low,ma,mb,n double precision a(ma,n),b(mb,n),cperm(n),cscale(n),wk(n,6) c c *****local variables: integer i,ir,it,j,jc,kount,nr,nrp2 double precision alpha,basl,beta,cmax,coef,coef2,coef5,cor, * ew,ewc,fi,fj,gamma,pgamma,sum,t,ta,tb,tc c c *****fortran functions: double precision dabs, dlog10, dsign c float c c *****subroutines called: c none c c --------------------------------------------------------------- c c *****purpose: c scales the matrices a and b in the generalized eigenvalue c problem a*x = (lambda)*b*x such that the magnitudes of the c elements of the submatrices of a and b (as specified by low c and igh) are close to unity in the least squares sense. c ref.: ward, r. c., balancing the generalized eigenvalue c problem, siam j. sci. stat. comput., vol. 2, no. 2, june 1981, c 141-152. c c *****parameter description: c c on input: c c ma,mb integer c row dimensions of the arrays containing matrices c a and b respectively, as declared in the main calling c program dimension statement; c c n integer c order of the matrices a and b; c c a real(ma,n) c contains the a matrix of the generalized eigenproblem c defined above; c c b real(mb,n) c contains the b matrix of the generalized eigenproblem c defined above; c c low integer c specifies the beginning -1 for the rows and c columns of a and b to be scaled; c c igh integer c specifies the ending -1 for the rows and columns c of a and b to be scaled; c c cperm real(n) c work array. only locations low through igh are c referenced and altered by this subroutine; c c wk real(n,6) c work array that must contain at least 6*n locations. c only locations low through igh, n+low through n+igh, c ..., 5*n+low through 5*n+igh are referenced and c altered by this subroutine. c c on output: c c a,b contain the scaled a and b matrices; c c cscale real(n) c contains in its low through igh locations the integer c exponents of 2 used for the column scaling factors. c the other locations are not referenced; c c wk contains in its low through igh locations the integer c exponents of 2 used for the row scaling factors. c c *****algorithm notes: c none. c c *****history: c written by r. c. ward....... c modified 8/86 by bobby bodenheimer so that if c sum = 0 (corresponding to the case where the matrix c doesn't need to be scaled) the routine returns. c c --------------------------------------------------------------- c if (low .eq. igh) go to 410 do 210 i = low,igh wk(i,1) = 0.0d0 wk(i,2) = 0.0d0 wk(i,3) = 0.0d0 wk(i,4) = 0.0d0 wk(i,5) = 0.0d0 wk(i,6) = 0.0d0 cscale(i) = 0.0d0 cperm(i) = 0.0d0 210 continue c c compute right side vector in resulting linear equations c basl = dlog10(2.0d0) do 240 i = low,igh do 240 j = low,igh tb = b(i,j) ta = a(i,j) if (ta .eq. 0.0d0) go to 220 ta = dlog10(dabs(ta)) / basl 220 continue if (tb .eq. 0.0d0) go to 230 tb = dlog10(dabs(tb)) / basl 230 continue wk(i,5) = wk(i,5) - ta - tb wk(j,6) = wk(j,6) - ta - tb 240 continue nr = igh-low+1 coef = 1.0d0/float(2*nr) coef2 = coef*coef coef5 = 0.5d0*coef2 nrp2 = nr+2 beta = 0.0d0 it = 1 c c start generalized conjugate gradient iteration c 250 continue ew = 0.0d0 ewc = 0.0d0 gamma = 0.0d0 do 260 i = low,igh gamma = gamma + wk(i,5)*wk(i,5) + wk(i,6)*wk(i,6) ew = ew + wk(i,5) ewc = ewc + wk(i,6) 260 continue gamma = coef*gamma - coef2*(ew**2 + ewc**2) + - coef5*(ew - ewc)**2 if (it .ne. 1) beta = gamma / pgamma t = coef5*(ewc - 3.0d0*ew) tc = coef5*(ew - 3.0d0*ewc) do 270 i = low,igh wk(i,2) = beta*wk(i,2) + coef*wk(i,5) + t cperm(i) = beta*cperm(i) + coef*wk(i,6) + tc 270 continue c c apply matrix to vector c do 300 i = low,igh kount = 0 sum = 0.0d0 do 290 j = low,igh if (a(i,j) .eq. 0.0d0) go to 280 kount = kount+1 sum = sum + cperm(j) 280 continue if (b(i,j) .eq. 0.0d0) go to 290 kount = kount+1 sum = sum + cperm(j) 290 continue wk(i,3) = float(kount)*wk(i,2) + sum 300 continue do 330 j = low,igh kount = 0 sum = 0.0d0 do 320 i = low,igh if (a(i,j) .eq. 0.0d0) go to 310 kount = kount+1 sum = sum + wk(i,2) 310 continue if (b(i,j) .eq. 0.0d0) go to 320 kount = kount+1 sum = sum + wk(i,2) 320 continue wk(j,4) = float(kount)*cperm(j) + sum 330 continue sum = 0.0d0 do 340 i = low,igh sum = sum + wk(i,2)*wk(i,3) + cperm(i)*wk(i,4) 340 continue if(sum.eq.0.0d0) return alpha = gamma / sum c c determine correction to current iterate c cmax = 0.0d0 do 350 i = low,igh cor = alpha * wk(i,2) if (dabs(cor) .gt. cmax) cmax = dabs(cor) wk(i,1) = wk(i,1) + cor cor = alpha * cperm(i) if (dabs(cor) .gt. cmax) cmax = dabs(cor) cscale(i) = cscale(i) + cor 350 continue if (cmax .lt. 0.5d0) go to 370 do 360 i = low,igh wk(i,5) = wk(i,5) - alpha*wk(i,3) wk(i,6) = wk(i,6) - alpha*wk(i,4) 360 continue pgamma = gamma it = it+1 if (it .le. nrp2) go to 250 c c end generalized conjugate gradient iteration c 370 continue do 380 i = low,igh ir = wk(i,1) + dsign(0.5d0,wk(i,1)) wk(i,1) = ir jc = cscale(i) + dsign(0.5d0,cscale(i)) cscale(i) = jc 380 continue c c scale a and b c do 400 i = 1,igh ir = wk(i,1) fi = 2.0d0**ir if (i .lt. low) fi = 1.0d0 do 400 j =low,n jc = cscale(j) fj = 2.0d0**jc if (j .le. igh) go to 390 if (i .lt. low) go to 400 fj = 1.0d0 390 continue a(i,j) = a(i,j)*fi*fj b(i,j) = b(i,j)*fi*fj 400 continue 410 continue return c c last line of scaleg c end octave-1.1.0/libcruft/blas/ 40777 415 17 0 5705521621 13600 5ustar jweusersoctave-1.1.0/libcruft/blas/Makefile.in100666 415 17 505 5662226306 15726 0ustar jweusers# # Makefile for octave's libcruft/blas directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/blas/dasum.f100666 415 17 1646 5201737450 15164 0ustar jweusers DOUBLE PRECISION FUNCTION DASUM(N,DX,INCX) C C TAKES THE SUM OF THE ABSOLUTE VALUES. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DTEMP INTEGER I,INCX,M,MP1,N,NINCX C DASUM = 0.0D0 DTEMP = 0.0D0 IF(N.LE.0)RETURN IF(INCX.EQ.1)GO TO 20 C C CODE FOR INCREMENT NOT EQUAL TO 1 C NINCX = N*INCX DO 10 I = 1,NINCX,INCX DTEMP = DTEMP + DABS(DX(I)) 10 CONTINUE DASUM = DTEMP RETURN C C CODE FOR INCREMENT EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,6) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DTEMP = DTEMP + DABS(DX(I)) 30 CONTINUE IF( N .LT. 6 ) GO TO 60 40 MP1 = M + 1 DO 50 I = MP1,N,6 DTEMP = DTEMP + DABS(DX(I)) + DABS(DX(I + 1)) + DABS(DX(I + 2)) * + DABS(DX(I + 3)) + DABS(DX(I + 4)) + DABS(DX(I + 5)) 50 CONTINUE 60 DASUM = DTEMP RETURN END octave-1.1.0/libcruft/blas/daxpy.f100666 415 17 2204 5201737450 15167 0ustar jweusers SUBROUTINE DAXPY(N,DA,DX,INCX,DY,INCY) C C CONSTANT TIMES A VECTOR PLUS A VECTOR. C USES UNROLLED LOOPS FOR INCREMENTS EQUAL TO ONE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DY(1),DA INTEGER I,INCX,INCY,IXIY,M,MP1,N C IF(N.LE.0)RETURN IF (DA .EQ. 0.0D0) RETURN IF(INCX.EQ.1.AND.INCY.EQ.1)GO TO 20 C C CODE FOR UNEQUAL INCREMENTS OR EQUAL INCREMENTS C NOT EQUAL TO 1 C IX = 1 IY = 1 IF(INCX.LT.0)IX = (-N+1)*INCX + 1 IF(INCY.LT.0)IY = (-N+1)*INCY + 1 DO 10 I = 1,N DY(IY) = DY(IY) + DA*DX(IX) IX = IX + INCX IY = IY + INCY 10 CONTINUE RETURN C C CODE FOR BOTH INCREMENTS EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,4) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DY(I) = DY(I) + DA*DX(I) 30 CONTINUE IF( N .LT. 4 ) RETURN 40 MP1 = M + 1 DO 50 I = MP1,N,4 DY(I) = DY(I) + DA*DX(I) DY(I + 1) = DY(I + 1) + DA*DX(I + 1) DY(I + 2) = DY(I + 2) + DA*DX(I + 2) DY(I + 3) = DY(I + 3) + DA*DX(I + 3) 50 CONTINUE RETURN END octave-1.1.0/libcruft/blas/dcabs1.f100666 415 17 307 5302556217 15163 0ustar jweusers double precision function dcabs1(z) double complex z,zz double precision t(2) equivalence (zz,t(1)) zz = z dcabs1 = dabs(t(1)) + dabs(t(2)) return end octave-1.1.0/libcruft/blas/dcopy.f100666 415 17 2150 5201737450 15160 0ustar jweusers SUBROUTINE DCOPY(N,DX,INCX,DY,INCY) C C COPIES A VECTOR, X, TO A VECTOR, Y. C USES UNROLLED LOOPS FOR INCREMENTS EQUAL TO ONE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DY(1) INTEGER I,INCX,INCY,IX,IY,M,MP1,N C IF(N.LE.0)RETURN IF(INCX.EQ.1.AND.INCY.EQ.1)GO TO 20 C C CODE FOR UNEQUAL INCREMENTS OR EQUAL INCREMENTS C NOT EQUAL TO 1 C IX = 1 IY = 1 IF(INCX.LT.0)IX = (-N+1)*INCX + 1 IF(INCY.LT.0)IY = (-N+1)*INCY + 1 DO 10 I = 1,N DY(IY) = DX(IX) IX = IX + INCX IY = IY + INCY 10 CONTINUE RETURN C C CODE FOR BOTH INCREMENTS EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,7) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DY(I) = DX(I) 30 CONTINUE IF( N .LT. 7 ) RETURN 40 MP1 = M + 1 DO 50 I = MP1,N,7 DY(I) = DX(I) DY(I + 1) = DX(I + 1) DY(I + 2) = DX(I + 2) DY(I + 3) = DX(I + 3) DY(I + 4) = DX(I + 4) DY(I + 5) = DX(I + 5) DY(I + 6) = DX(I + 6) 50 CONTINUE RETURN END octave-1.1.0/libcruft/blas/ddot.f100666 415 17 2243 5201737450 14777 0ustar jweusers DOUBLE PRECISION FUNCTION DDOT(N,DX,INCX,DY,INCY) C C FORMS THE DOT PRODUCT OF TWO VECTORS. C USES UNROLLED LOOPS FOR INCREMENTS EQUAL TO ONE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DY(1),DTEMP INTEGER I,INCX,INCY,IX,IY,M,MP1,N C DDOT = 0.0D0 DTEMP = 0.0D0 IF(N.LE.0)RETURN IF(INCX.EQ.1.AND.INCY.EQ.1)GO TO 20 C C CODE FOR UNEQUAL INCREMENTS OR EQUAL INCREMENTS C NOT EQUAL TO 1 C IX = 1 IY = 1 IF(INCX.LT.0)IX = (-N+1)*INCX + 1 IF(INCY.LT.0)IY = (-N+1)*INCY + 1 DO 10 I = 1,N DTEMP = DTEMP + DX(IX)*DY(IY) IX = IX + INCX IY = IY + INCY 10 CONTINUE DDOT = DTEMP RETURN C C CODE FOR BOTH INCREMENTS EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,5) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DTEMP = DTEMP + DX(I)*DY(I) 30 CONTINUE IF( N .LT. 5 ) GO TO 60 40 MP1 = M + 1 DO 50 I = MP1,N,5 DTEMP = DTEMP + DX(I)*DY(I) + DX(I + 1)*DY(I + 1) + * DX(I + 2)*DY(I + 2) + DX(I + 3)*DY(I + 3) + DX(I + 4)*DY(I + 4) 50 CONTINUE 60 DDOT = DTEMP RETURN END octave-1.1.0/libcruft/blas/dgemm.f100666 415 17 25550 5226032327 15162 0ustar jweusers************************************************************************ * * File of the DOUBLE PRECISION Level-3 BLAS. * ========================================== * * SUBROUTINE DGEMM ( TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, * $ BETA, C, LDC ) * * SUBROUTINE DSYMM ( SIDE, UPLO, M, N, ALPHA, A, LDA, B, LDB, * $ BETA, C, LDC ) * * SUBROUTINE DSYRK ( UPLO, TRANS, N, K, ALPHA, A, LDA, * $ BETA, C, LDC ) * * SUBROUTINE DSYR2K( UPLO, TRANS, N, K, ALPHA, A, LDA, B, LDB, * $ BETA, C, LDC ) * * SUBROUTINE DTRMM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, * $ B, LDB ) * * SUBROUTINE DTRSM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, * $ B, LDB ) * * See: * * Dongarra J. J., Du Croz J. J., Duff I. and Hammarling S. * A set of Level 3 Basic Linear Algebra Subprograms. Technical * Memorandum No.88 (Revision 1), Mathematics and Computer Science * Division, Argonne National Laboratory, 9700 South Cass Avenue, * Argonne, Illinois 60439. * * ************************************************************************ * SUBROUTINE DGEMM ( TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, $ BETA, C, LDC ) * .. Scalar Arguments .. CHARACTER*1 TRANSA, TRANSB INTEGER M, N, K, LDA, LDB, LDC DOUBLE PRECISION ALPHA, BETA * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * * Purpose * ======= * * DGEMM performs one of the matrix-matrix operations * * C := alpha*op( A )*op( B ) + beta*C, * * where op( X ) is one of * * op( X ) = X or op( X ) = X', * * alpha and beta are scalars, and A, B and C are matrices, with op( A ) * an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. * * Parameters * ========== * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n', op( A ) = A. * * TRANSA = 'T' or 't', op( A ) = A'. * * TRANSA = 'C' or 'c', op( A ) = A'. * * Unchanged on exit. * * TRANSB - CHARACTER*1. * On entry, TRANSB specifies the form of op( B ) to be used in * the matrix multiplication as follows: * * TRANSB = 'N' or 'n', op( B ) = B. * * TRANSB = 'T' or 't', op( B ) = B'. * * TRANSB = 'C' or 'c', op( B ) = B'. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of the matrix * op( A ) and of the matrix C. M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix * op( B ) and the number of columns of the matrix C. N must be * at least zero. * Unchanged on exit. * * K - INTEGER. * On entry, K specifies the number of columns of the matrix * op( A ) and the number of rows of the matrix op( B ). K must * be at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, ka ), where ka is * k when TRANSA = 'N' or 'n', and is m otherwise. * Before entry with TRANSA = 'N' or 'n', the leading m by k * part of the array A must contain the matrix A, otherwise * the leading k by m part of the array A must contain the * matrix A. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When TRANSA = 'N' or 'n' then * LDA must be at least max( 1, m ), otherwise LDA must be at * least max( 1, k ). * Unchanged on exit. * * B - DOUBLE PRECISION array of DIMENSION ( LDB, kb ), where kb is * n when TRANSB = 'N' or 'n', and is k otherwise. * Before entry with TRANSB = 'N' or 'n', the leading k by n * part of the array B must contain the matrix B, otherwise * the leading n by k part of the array B must contain the * matrix B. * Unchanged on exit. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. When TRANSB = 'N' or 'n' then * LDB must be at least max( 1, k ), otherwise LDB must be at * least max( 1, n ). * Unchanged on exit. * * BETA - DOUBLE PRECISION. * On entry, BETA specifies the scalar beta. When BETA is * supplied as zero then C need not be set on input. * Unchanged on exit. * * C - DOUBLE PRECISION array of DIMENSION ( LDC, n ). * Before entry, the leading m by n part of the array C must * contain the matrix C, except when beta is zero, in which * case C need not be set on entry. * On exit, the array C is overwritten by the m by n matrix * ( alpha*op( A )*op( B ) + beta*C ). * * LDC - INTEGER. * On entry, LDC specifies the first dimension of C as declared * in the calling (sub) program. LDC must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. Local Scalars .. LOGICAL NOTA, NOTB INTEGER I, INFO, J, L, NCOLA, NROWA, NROWB DOUBLE PRECISION TEMP * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Executable Statements .. * * Set NOTA and NOTB as true if A and B respectively are not * transposed and set NROWA, NCOLA and NROWB as the number of rows * and columns of A and the number of rows of B respectively. * NOTA = LSAME( TRANSA, 'N' ) NOTB = LSAME( TRANSB, 'N' ) IF( NOTA )THEN NROWA = M NCOLA = K ELSE NROWA = K NCOLA = M END IF IF( NOTB )THEN NROWB = K ELSE NROWB = N END IF * * Test the input parameters. * INFO = 0 IF( ( .NOT.NOTA ).AND. $ ( .NOT.LSAME( TRANSA, 'C' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.NOTB ).AND. $ ( .NOT.LSAME( TRANSB, 'C' ) ).AND. $ ( .NOT.LSAME( TRANSB, 'T' ) ) )THEN INFO = 2 ELSE IF( M .LT.0 )THEN INFO = 3 ELSE IF( N .LT.0 )THEN INFO = 4 ELSE IF( K .LT.0 )THEN INFO = 5 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 8 ELSE IF( LDB.LT.MAX( 1, NROWB ) )THEN INFO = 10 ELSE IF( LDC.LT.MAX( 1, M ) )THEN INFO = 13 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DGEMM ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR. $ ( ( ( ALPHA.EQ.ZERO ).OR.( K.EQ.0 ) ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * * And if alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN IF( BETA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M C( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE DO 40, J = 1, N DO 30, I = 1, M C( I, J ) = BETA*C( I, J ) 30 CONTINUE 40 CONTINUE END IF RETURN END IF * * Start the operations. * IF( NOTB )THEN IF( NOTA )THEN * * Form C := alpha*A*B + beta*C. * DO 90, J = 1, N IF( BETA.EQ.ZERO )THEN DO 50, I = 1, M C( I, J ) = ZERO 50 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 60, I = 1, M C( I, J ) = BETA*C( I, J ) 60 CONTINUE END IF DO 80, L = 1, K IF( B( L, J ).NE.ZERO )THEN TEMP = ALPHA*B( L, J ) DO 70, I = 1, M C( I, J ) = C( I, J ) + TEMP*A( I, L ) 70 CONTINUE END IF 80 CONTINUE 90 CONTINUE ELSE * * Form C := alpha*A'*B + beta*C * DO 120, J = 1, N DO 110, I = 1, M TEMP = ZERO DO 100, L = 1, K TEMP = TEMP + A( L, I )*B( L, J ) 100 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 110 CONTINUE 120 CONTINUE END IF ELSE IF( NOTA )THEN * * Form C := alpha*A*B' + beta*C * DO 170, J = 1, N IF( BETA.EQ.ZERO )THEN DO 130, I = 1, M C( I, J ) = ZERO 130 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 140, I = 1, M C( I, J ) = BETA*C( I, J ) 140 CONTINUE END IF DO 160, L = 1, K IF( B( J, L ).NE.ZERO )THEN TEMP = ALPHA*B( J, L ) DO 150, I = 1, M C( I, J ) = C( I, J ) + TEMP*A( I, L ) 150 CONTINUE END IF 160 CONTINUE 170 CONTINUE ELSE * * Form C := alpha*A'*B' + beta*C * DO 200, J = 1, N DO 190, I = 1, M TEMP = ZERO DO 180, L = 1, K TEMP = TEMP + A( L, I )*B( J, L ) 180 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 190 CONTINUE 200 CONTINUE END IF END IF * RETURN * * End of DGEMM . * END octave-1.1.0/libcruft/blas/dgemv.f100666 415 17 22636 5150622151 15171 0ustar jweusers* ************************************************************************ * * File of the DOUBLE PRECISION Level-2 BLAS. * =========================================== * * SUBROUTINE DGEMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, * $ BETA, Y, INCY ) * * SUBROUTINE DGBMV ( TRANS, M, N, KL, KU, ALPHA, A, LDA, X, INCX, * $ BETA, Y, INCY ) * * SUBROUTINE DSYMV ( UPLO, N, ALPHA, A, LDA, X, INCX, * $ BETA, Y, INCY ) * * SUBROUTINE DSBMV ( UPLO, N, K, ALPHA, A, LDA, X, INCX, * $ BETA, Y, INCY ) * * SUBROUTINE DSPMV ( UPLO, N, ALPHA, AP, X, INCX, BETA, Y, INCY ) * * SUBROUTINE DTRMV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * * SUBROUTINE DTBMV ( UPLO, TRANS, DIAG, N, K, A, LDA, X, INCX ) * * SUBROUTINE DTPMV ( UPLO, TRANS, DIAG, N, AP, X, INCX ) * * SUBROUTINE DTRSV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * * SUBROUTINE DTBSV ( UPLO, TRANS, DIAG, N, K, A, LDA, X, INCX ) * * SUBROUTINE DTPSV ( UPLO, TRANS, DIAG, N, AP, X, INCX ) * * SUBROUTINE DGER ( M, N, ALPHA, X, INCX, Y, INCY, A, LDA ) * * SUBROUTINE DSYR ( UPLO, N, ALPHA, X, INCX, A, LDA ) * * SUBROUTINE DSPR ( UPLO, N, ALPHA, X, INCX, AP ) * * SUBROUTINE DSYR2 ( UPLO, N, ALPHA, X, INCX, Y, INCY, A, LDA ) * * SUBROUTINE DSPR2 ( UPLO, N, ALPHA, X, INCX, Y, INCY, AP ) * * See: * * Dongarra J. J., Du Croz J. J., Hammarling S. and Hanson R. J.. * An extended set of Fortran Basic Linear Algebra Subprograms. * * Technical Memoranda Nos. 41 (revision 3) and 81, Mathematics * and Computer Science Division, Argonne National Laboratory, * 9700 South Cass Avenue, Argonne, Illinois 60439, US. * * Or * * NAG Technical Reports TR3/87 and TR4/87, Numerical Algorithms * Group Ltd., NAG Central Office, 256 Banbury Road, Oxford * OX2 7DE, UK, and Numerical Algorithms Group Inc., 1101 31st * Street, Suite 100, Downers Grove, Illinois 60515-1263, USA. * ************************************************************************ * SUBROUTINE DGEMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, $ BETA, Y, INCY ) * .. Scalar Arguments .. DOUBLE PRECISION ALPHA, BETA INTEGER INCX, INCY, LDA, M, N CHARACTER*1 TRANS * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), X( * ), Y( * ) * .. * * Purpose * ======= * * DGEMV performs one of the matrix-vector operations * * y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, * * where alpha and beta are scalars, x and y are vectors and A is an * m by n matrix. * * Parameters * ========== * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' y := alpha*A*x + beta*y. * * TRANS = 'T' or 't' y := alpha*A'*x + beta*y. * * TRANS = 'C' or 'c' y := alpha*A'*x + beta*y. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of the matrix A. * M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix A. * N must be at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). * Before entry, the leading m by n part of the array A must * contain the matrix of coefficients. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, m ). * Unchanged on exit. * * X - DOUBLE PRECISION array of DIMENSION at least * ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' * and at least * ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. * Before entry, the incremented array X must contain the * vector x. * Unchanged on exit. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * BETA - DOUBLE PRECISION. * On entry, BETA specifies the scalar beta. When BETA is * supplied as zero then Y need not be set on input. * Unchanged on exit. * * Y - DOUBLE PRECISION array of DIMENSION at least * ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' * and at least * ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. * Before entry with BETA non-zero, the incremented array Y * must contain the vector y. On exit, Y is overwritten by the * updated vector y. * * INCY - INTEGER. * On entry, INCY specifies the increment for the elements of * Y. INCY must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. Local Scalars .. DOUBLE PRECISION TEMP INTEGER I, INFO, IX, IY, J, JX, JY, KX, KY, LENX, LENY * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 1 ELSE IF( M.LT.0 )THEN INFO = 2 ELSE IF( N.LT.0 )THEN INFO = 3 ELSE IF( LDA.LT.MAX( 1, M ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 ELSE IF( INCY.EQ.0 )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DGEMV ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR. $ ( ( ALPHA.EQ.ZERO ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * * Set LENX and LENY, the lengths of the vectors x and y, and set * up the start points in X and Y. * IF( LSAME( TRANS, 'N' ) )THEN LENX = N LENY = M ELSE LENX = M LENY = N END IF IF( INCX.GT.0 )THEN KX = 1 ELSE KX = 1 - ( LENX - 1 )*INCX END IF IF( INCY.GT.0 )THEN KY = 1 ELSE KY = 1 - ( LENY - 1 )*INCY END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * * First form y := beta*y. * IF( BETA.NE.ONE )THEN IF( INCY.EQ.1 )THEN IF( BETA.EQ.ZERO )THEN DO 10, I = 1, LENY Y( I ) = ZERO 10 CONTINUE ELSE DO 20, I = 1, LENY Y( I ) = BETA*Y( I ) 20 CONTINUE END IF ELSE IY = KY IF( BETA.EQ.ZERO )THEN DO 30, I = 1, LENY Y( IY ) = ZERO IY = IY + INCY 30 CONTINUE ELSE DO 40, I = 1, LENY Y( IY ) = BETA*Y( IY ) IY = IY + INCY 40 CONTINUE END IF END IF END IF IF( ALPHA.EQ.ZERO ) $ RETURN IF( LSAME( TRANS, 'N' ) )THEN * * Form y := alpha*A*x + y. * JX = KX IF( INCY.EQ.1 )THEN DO 60, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = ALPHA*X( JX ) DO 50, I = 1, M Y( I ) = Y( I ) + TEMP*A( I, J ) 50 CONTINUE END IF JX = JX + INCX 60 CONTINUE ELSE DO 80, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = ALPHA*X( JX ) IY = KY DO 70, I = 1, M Y( IY ) = Y( IY ) + TEMP*A( I, J ) IY = IY + INCY 70 CONTINUE END IF JX = JX + INCX 80 CONTINUE END IF ELSE * * Form y := alpha*A'*x + y. * JY = KY IF( INCX.EQ.1 )THEN DO 100, J = 1, N TEMP = ZERO DO 90, I = 1, M TEMP = TEMP + A( I, J )*X( I ) 90 CONTINUE Y( JY ) = Y( JY ) + ALPHA*TEMP JY = JY + INCY 100 CONTINUE ELSE DO 120, J = 1, N TEMP = ZERO IX = KX DO 110, I = 1, M TEMP = TEMP + A( I, J )*X( IX ) IX = IX + INCX 110 CONTINUE Y( JY ) = Y( JY ) + ALPHA*TEMP JY = JY + INCY 120 CONTINUE END IF END IF * RETURN * * End of DGEMV . * END octave-1.1.0/libcruft/blas/dger.f100666 415 17 10533 5233162474 15012 0ustar jweusers* ************************************************************************ * SUBROUTINE DGER ( M, N, ALPHA, X, INCX, Y, INCY, A, LDA ) * .. Scalar Arguments .. DOUBLE PRECISION ALPHA INTEGER INCX, INCY, LDA, M, N * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), X( * ), Y( * ) * .. * * Purpose * ======= * * DGER performs the rank 1 operation * * A := alpha*x*y' + A, * * where alpha is a scalar, x is an m element vector, y is an n element * vector and A is an m by n matrix. * * Parameters * ========== * * M - INTEGER. * On entry, M specifies the number of rows of the matrix A. * M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix A. * N must be at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * X - DOUBLE PRECISION array of dimension at least * ( 1 + ( m - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the m * element vector x. * Unchanged on exit. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * Y - DOUBLE PRECISION array of dimension at least * ( 1 + ( n - 1 )*abs( INCY ) ). * Before entry, the incremented array Y must contain the n * element vector y. * Unchanged on exit. * * INCY - INTEGER. * On entry, INCY specifies the increment for the elements of * Y. INCY must not be zero. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). * Before entry, the leading m by n part of the array A must * contain the matrix of coefficients. On exit, A is * overwritten by the updated matrix. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, m ). * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. Local Scalars .. DOUBLE PRECISION TEMP INTEGER I, INFO, IX, J, JY, KX * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( M.LT.0 )THEN INFO = 1 ELSE IF( N.LT.0 )THEN INFO = 2 ELSE IF( INCX.EQ.0 )THEN INFO = 5 ELSE IF( INCY.EQ.0 )THEN INFO = 7 ELSE IF( LDA.LT.MAX( 1, M ) )THEN INFO = 9 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DGER ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR.( ALPHA.EQ.ZERO ) ) $ RETURN * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( INCY.GT.0 )THEN JY = 1 ELSE JY = 1 - ( N - 1 )*INCY END IF IF( INCX.EQ.1 )THEN DO 20, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*Y( JY ) DO 10, I = 1, M A( I, J ) = A( I, J ) + X( I )*TEMP 10 CONTINUE END IF JY = JY + INCY 20 CONTINUE ELSE IF( INCX.GT.0 )THEN KX = 1 ELSE KX = 1 - ( M - 1 )*INCX END IF DO 40, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*Y( JY ) IX = KX DO 30, I = 1, M A( I, J ) = A( I, J ) + X( IX )*TEMP IX = IX + INCX 30 CONTINUE END IF JY = JY + INCY 40 CONTINUE END IF * RETURN * * End of DGER . * END octave-1.1.0/libcruft/blas/dmach.f100666 415 17 2530 5201737451 15121 0ustar jweusers DOUBLE PRECISION FUNCTION DMACH(JOB) INTEGER JOB C C SMACH COMPUTES MACHINE PARAMETERS OF FLOATING POINT C ARITHMETIC FOR USE IN TESTING ONLY. NOT REQUIRED BY C LINPACK PROPER. C C IF TROUBLE WITH AUTOMATIC COMPUTATION OF THESE QUANTITIES, C THEY CAN BE SET BY DIRECT ASSIGNMENT STATEMENTS. C ASSUME THE COMPUTER HAS C C B = BASE OF ARITHMETIC C T = NUMBER OF BASE B DIGITS C L = SMALLEST POSSIBLE EXPONENT C U = LARGEST POSSIBLE EXPONENT C C THEN C C EPS = B**(1-T) C TINY = 100.0*B**(-L+T) C HUGE = 0.01*B**(U-T) C C DMACH SAME AS SMACH EXCEPT T, L, U APPLY TO C DOUBLE PRECISION. C C CMACH SAME AS SMACH EXCEPT IF COMPLEX DIVISION C IS DONE BY C C 1/(X+I*Y) = (X-I*Y)/(X**2+Y**2) C C THEN C C TINY = SQRT(TINY) C HUGE = SQRT(HUGE) C C C JOB IS 1, 2 OR 3 FOR EPSILON, TINY AND HUGE, RESPECTIVELY. C DOUBLE PRECISION EPS,TINY,HUGE,S C EPS = 1.0D0 10 EPS = EPS/2.0D0 S = 1.0D0 + EPS IF (S .GT. 1.0D0) GO TO 10 EPS = 2.0D0*EPS C S = 1.0D0 20 TINY = S S = S/16.0D0 IF (S*1.0 .NE. 0.0D0) GO TO 20 TINY = (TINY/EPS)*100.0 HUGE = 1.0D0/TINY C IF (JOB .EQ. 1) DMACH = EPS IF (JOB .EQ. 2) DMACH = TINY IF (JOB .EQ. 3) DMACH = HUGE RETURN END octave-1.1.0/libcruft/blas/dnrm2.f100666 415 17 7311 5201737451 15071 0ustar jweusers DOUBLE PRECISION FUNCTION DNRM2 ( N, DX, INCX) INTEGER NEXT DOUBLE PRECISION DX(1), CUTLO, CUTHI, HITEST, SUM, XMAX,ZERO,ONE DATA ZERO, ONE /0.0D0, 1.0D0/ C C EUCLIDEAN NORM OF THE N-VECTOR STORED IN DX() WITH STORAGE C INCREMENT INCX . C IF N .LE. 0 RETURN WITH RESULT = 0. C IF N .GE. 1 THEN INCX MUST BE .GE. 1 C C C.L.LAWSON, 1978 JAN 08 C C FOUR PHASE METHOD USING TWO BUILT-IN CONSTANTS THAT ARE C HOPEFULLY APPLICABLE TO ALL MACHINES. C CUTLO = MAXIMUM OF DSQRT(U/EPS) OVER ALL KNOWN MACHINES. C CUTHI = MINIMUM OF DSQRT(V) OVER ALL KNOWN MACHINES. C WHERE C EPS = SMALLEST NO. SUCH THAT EPS + 1. .GT. 1. C U = SMALLEST POSITIVE NO. (UNDERFLOW LIMIT) C V = LARGEST NO. (OVERFLOW LIMIT) C C BRIEF OUTLINE OF ALGORITHM.. C C PHASE 1 SCANS ZERO COMPONENTS. C MOVE TO PHASE 2 WHEN A COMPONENT IS NONZERO AND .LE. CUTLO C MOVE TO PHASE 3 WHEN A COMPONENT IS .GT. CUTLO C MOVE TO PHASE 4 WHEN A COMPONENT IS .GE. CUTHI/M C WHERE M = N FOR X() REAL AND M = 2*N FOR COMPLEX. C C VALUES FOR CUTLO AND CUTHI.. C FROM THE ENVIRONMENTAL PARAMETERS LISTED IN THE IMSL CONVERTER C DOCUMENT THE LIMITING VALUES ARE AS FOLLOWS.. C CUTLO, S.P. U/EPS = 2**(-102) FOR HONEYWELL. CLOSE SECONDS ARE C UNIVAC AND DEC AT 2**(-103) C THUS CUTLO = 2**(-51) = 4.44089E-16 C CUTHI, S.P. V = 2**127 FOR UNIVAC, HONEYWELL, AND DEC. C THUS CUTHI = 2**(63.5) = 1.30438E19 C CUTLO, D.P. U/EPS = 2**(-67) FOR HONEYWELL AND DEC. C THUS CUTLO = 2**(-33.5) = 8.23181D-11 C CUTHI, D.P. SAME AS S.P. CUTHI = 1.30438D19 C DATA CUTLO, CUTHI / 8.232D-11, 1.304D19 / C DATA CUTLO, CUTHI / 4.441E-16, 1.304E19 / DATA CUTLO, CUTHI / 8.232D-11, 1.304D19 / C IF(N .GT. 0) GO TO 10 DNRM2 = ZERO GO TO 300 C 10 ASSIGN 30 TO NEXT SUM = ZERO NN = N * INCX C BEGIN MAIN LOOP I = 1 20 GO TO NEXT,(30, 50, 70, 110) 30 IF( DABS(DX(I)) .GT. CUTLO) GO TO 85 ASSIGN 50 TO NEXT XMAX = ZERO C C PHASE 1. SUM IS ZERO C 50 IF( DX(I) .EQ. ZERO) GO TO 200 IF( DABS(DX(I)) .GT. CUTLO) GO TO 85 C C PREPARE FOR PHASE 2. ASSIGN 70 TO NEXT GO TO 105 C C PREPARE FOR PHASE 4. C 100 I = J ASSIGN 110 TO NEXT SUM = (SUM / DX(I)) / DX(I) 105 XMAX = DABS(DX(I)) GO TO 115 C C PHASE 2. SUM IS SMALL. C SCALE TO AVOID DESTRUCTIVE UNDERFLOW. C 70 IF( DABS(DX(I)) .GT. CUTLO ) GO TO 75 C C COMMON CODE FOR PHASES 2 AND 4. C IN PHASE 4 SUM IS LARGE. SCALE TO AVOID OVERFLOW. C 110 IF( DABS(DX(I)) .LE. XMAX ) GO TO 115 SUM = ONE + SUM * (XMAX / DX(I))**2 XMAX = DABS(DX(I)) GO TO 200 C 115 SUM = SUM + (DX(I)/XMAX)**2 GO TO 200 C C C PREPARE FOR PHASE 3. C 75 SUM = (SUM * XMAX) * XMAX C C C FOR REAL OR D.P. SET HITEST = CUTHI/N C FOR COMPLEX SET HITEST = CUTHI/(2*N) C 85 HITEST = CUTHI/FLOAT( N ) C C PHASE 3. SUM IS MID-RANGE. NO SCALING. C DO 95 J =I,NN,INCX IF(DABS(DX(J)) .GE. HITEST) GO TO 100 95 SUM = SUM + DX(J)**2 DNRM2 = DSQRT( SUM ) GO TO 300 C 200 CONTINUE I = I + INCX IF ( I .LE. NN ) GO TO 20 C C END OF MAIN LOOP. C C COMPUTE SQUARE ROOT AND ADJUST FOR SCALING. C DNRM2 = XMAX * DSQRT(SUM) 300 CONTINUE RETURN END octave-1.1.0/libcruft/blas/drot.f100666 415 17 1515 5201737451 15017 0ustar jweusers SUBROUTINE DROT (N,DX,INCX,DY,INCY,C,S) C C APPLIES A PLANE ROTATION. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DY(1),DTEMP,C,S INTEGER I,INCX,INCY,IX,IY,N C IF(N.LE.0)RETURN IF(INCX.EQ.1.AND.INCY.EQ.1)GO TO 20 C C CODE FOR UNEQUAL INCREMENTS OR EQUAL INCREMENTS NOT EQUAL C TO 1 C IX = 1 IY = 1 IF(INCX.LT.0)IX = (-N+1)*INCX + 1 IF(INCY.LT.0)IY = (-N+1)*INCY + 1 DO 10 I = 1,N DTEMP = C*DX(IX) + S*DY(IY) DY(IY) = C*DY(IY) - S*DX(IX) DX(IX) = DTEMP IX = IX + INCX IY = IY + INCY 10 CONTINUE RETURN C C CODE FOR BOTH INCREMENTS EQUAL TO 1 C 20 DO 30 I = 1,N DTEMP = C*DX(I) + S*DY(I) DY(I) = C*DY(I) - S*DX(I) DX(I) = DTEMP 30 CONTINUE RETURN END octave-1.1.0/libcruft/blas/dscal.f100666 415 17 1566 5201737451 15143 0ustar jweusers SUBROUTINE DSCAL(N,DA,DX,INCX) C C SCALES A VECTOR BY A CONSTANT. C USES UNROLLED LOOPS FOR INCREMENT EQUAL TO ONE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DA,DX(1) INTEGER I,INCX,M,MP1,N,NINCX C IF(N.LE.0)RETURN IF(INCX.EQ.1)GO TO 20 C C CODE FOR INCREMENT NOT EQUAL TO 1 C NINCX = N*INCX DO 10 I = 1,NINCX,INCX DX(I) = DA*DX(I) 10 CONTINUE RETURN C C CODE FOR INCREMENT EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,5) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DX(I) = DA*DX(I) 30 CONTINUE IF( N .LT. 5 ) RETURN 40 MP1 = M + 1 DO 50 I = MP1,N,5 DX(I) = DA*DX(I) DX(I + 1) = DA*DX(I + 1) DX(I + 2) = DA*DX(I + 2) DX(I + 3) = DA*DX(I + 3) DX(I + 4) = DA*DX(I + 4) 50 CONTINUE RETURN END octave-1.1.0/libcruft/blas/dswap.f100666 415 17 2324 5201737451 15164 0ustar jweusers SUBROUTINE DSWAP (N,DX,INCX,DY,INCY) C C INTERCHANGES TWO VECTORS. C USES UNROLLED LOOPS FOR INCREMENTS EQUAL ONE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DY(1),DTEMP INTEGER I,INCX,INCY,IX,IY,M,MP1,N C IF(N.LE.0)RETURN IF(INCX.EQ.1.AND.INCY.EQ.1)GO TO 20 C C CODE FOR UNEQUAL INCREMENTS OR EQUAL INCREMENTS NOT EQUAL C TO 1 C IX = 1 IY = 1 IF(INCX.LT.0)IX = (-N+1)*INCX + 1 IF(INCY.LT.0)IY = (-N+1)*INCY + 1 DO 10 I = 1,N DTEMP = DX(IX) DX(IX) = DY(IY) DY(IY) = DTEMP IX = IX + INCX IY = IY + INCY 10 CONTINUE RETURN C C CODE FOR BOTH INCREMENTS EQUAL TO 1 C C C CLEAN-UP LOOP C 20 M = MOD(N,3) IF( M .EQ. 0 ) GO TO 40 DO 30 I = 1,M DTEMP = DX(I) DX(I) = DY(I) DY(I) = DTEMP 30 CONTINUE IF( N .LT. 3 ) RETURN 40 MP1 = M + 1 DO 50 I = MP1,N,3 DTEMP = DX(I) DX(I) = DY(I) DY(I) = DTEMP DTEMP = DX(I + 1) DX(I + 1) = DY(I + 1) DY(I + 1) = DTEMP DTEMP = DX(I + 2) DX(I + 2) = DY(I + 2) DY(I + 2) = DTEMP 50 CONTINUE RETURN END octave-1.1.0/libcruft/blas/dsyrk.f100666 415 17 22322 5462062135 15221 0ustar jweusers* ************************************************************************ * SUBROUTINE DSYRK ( UPLO, TRANS, N, K, ALPHA, A, LDA, $ BETA, C, LDC ) * .. Scalar Arguments .. CHARACTER*1 UPLO, TRANS INTEGER N, K, LDA, LDC DOUBLE PRECISION ALPHA, BETA * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ) * .. * * Purpose * ======= * * DSYRK performs one of the symmetric rank k operations * * C := alpha*A*A' + beta*C, * * or * * C := alpha*A'*A + beta*C, * * where alpha and beta are scalars, C is an n by n symmetric matrix * and A is an n by k matrix in the first case and a k by n matrix * in the second case. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the upper or lower * triangular part of the array C is to be referenced as * follows: * * UPLO = 'U' or 'u' Only the upper triangular part of C * is to be referenced. * * UPLO = 'L' or 'l' Only the lower triangular part of C * is to be referenced. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' C := alpha*A*A' + beta*C. * * TRANS = 'T' or 't' C := alpha*A'*A + beta*C. * * TRANS = 'C' or 'c' C := alpha*A'*A + beta*C. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix C. N must be * at least zero. * Unchanged on exit. * * K - INTEGER. * On entry with TRANS = 'N' or 'n', K specifies the number * of columns of the matrix A, and on entry with * TRANS = 'T' or 't' or 'C' or 'c', K specifies the number * of rows of the matrix A. K must be at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, ka ), where ka is * k when TRANS = 'N' or 'n', and is n otherwise. * Before entry with TRANS = 'N' or 'n', the leading n by k * part of the array A must contain the matrix A, otherwise * the leading k by n part of the array A must contain the * matrix A. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When TRANS = 'N' or 'n' * then LDA must be at least max( 1, n ), otherwise LDA must * be at least max( 1, k ). * Unchanged on exit. * * BETA - DOUBLE PRECISION. * On entry, BETA specifies the scalar beta. * Unchanged on exit. * * C - DOUBLE PRECISION array of DIMENSION ( LDC, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array C must contain the upper * triangular part of the symmetric matrix and the strictly * lower triangular part of C is not referenced. On exit, the * upper triangular part of the array C is overwritten by the * upper triangular part of the updated matrix. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array C must contain the lower * triangular part of the symmetric matrix and the strictly * upper triangular part of C is not referenced. On exit, the * lower triangular part of the array C is overwritten by the * lower triangular part of the updated matrix. * * LDC - INTEGER. * On entry, LDC specifies the first dimension of C as declared * in the calling (sub) program. LDC must be at least * max( 1, n ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. Local Scalars .. LOGICAL UPPER INTEGER I, INFO, J, L, NROWA DOUBLE PRECISION TEMP * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Executable Statements .. * * Test the input parameters. * IF( LSAME( TRANS, 'N' ) )THEN NROWA = N ELSE NROWA = K END IF UPPER = LSAME( UPLO, 'U' ) * INFO = 0 IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.LSAME( TRANS, 'N' ) ).AND. $ ( .NOT.LSAME( TRANS, 'T' ) ).AND. $ ( .NOT.LSAME( TRANS, 'C' ) ) )THEN INFO = 2 ELSE IF( N .LT.0 )THEN INFO = 3 ELSE IF( K .LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 7 ELSE IF( LDC.LT.MAX( 1, N ) )THEN INFO = 10 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DSYRK ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( N.EQ.0 ).OR. $ ( ( ( ALPHA.EQ.ZERO ).OR.( K.EQ.0 ) ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN IF( UPPER )THEN IF( BETA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, J C( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE DO 40, J = 1, N DO 30, I = 1, J C( I, J ) = BETA*C( I, J ) 30 CONTINUE 40 CONTINUE END IF ELSE IF( BETA.EQ.ZERO )THEN DO 60, J = 1, N DO 50, I = J, N C( I, J ) = ZERO 50 CONTINUE 60 CONTINUE ELSE DO 80, J = 1, N DO 70, I = J, N C( I, J ) = BETA*C( I, J ) 70 CONTINUE 80 CONTINUE END IF END IF RETURN END IF * * Start the operations. * IF( LSAME( TRANS, 'N' ) )THEN * * Form C := alpha*A*A' + beta*C. * IF( UPPER )THEN DO 130, J = 1, N IF( BETA.EQ.ZERO )THEN DO 90, I = 1, J C( I, J ) = ZERO 90 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 100, I = 1, J C( I, J ) = BETA*C( I, J ) 100 CONTINUE END IF DO 120, L = 1, K IF( A( J, L ).NE.ZERO )THEN TEMP = ALPHA*A( J, L ) DO 110, I = 1, J C( I, J ) = C( I, J ) + TEMP*A( I, L ) 110 CONTINUE END IF 120 CONTINUE 130 CONTINUE ELSE DO 180, J = 1, N IF( BETA.EQ.ZERO )THEN DO 140, I = J, N C( I, J ) = ZERO 140 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 150, I = J, N C( I, J ) = BETA*C( I, J ) 150 CONTINUE END IF DO 170, L = 1, K IF( A( J, L ).NE.ZERO )THEN TEMP = ALPHA*A( J, L ) DO 160, I = J, N C( I, J ) = C( I, J ) + TEMP*A( I, L ) 160 CONTINUE END IF 170 CONTINUE 180 CONTINUE END IF ELSE * * Form C := alpha*A'*A + beta*C. * IF( UPPER )THEN DO 210, J = 1, N DO 200, I = 1, J TEMP = ZERO DO 190, L = 1, K TEMP = TEMP + A( L, I )*A( L, J ) 190 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 200 CONTINUE 210 CONTINUE ELSE DO 240, J = 1, N DO 230, I = J, N TEMP = ZERO DO 220, L = 1, K TEMP = TEMP + A( L, I )*A( L, J ) 220 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 230 CONTINUE 240 CONTINUE END IF END IF * RETURN * * End of DSYRK . * END octave-1.1.0/libcruft/blas/dtrmm.f100666 415 17 26442 5306555751 15227 0ustar jweusers* ************************************************************************ * SUBROUTINE DTRMM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, $ B, LDB ) * .. Scalar Arguments .. CHARACTER*1 SIDE, UPLO, TRANSA, DIAG INTEGER M, N, LDA, LDB DOUBLE PRECISION ALPHA * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * DTRMM performs one of the matrix-matrix operations * * B := alpha*op( A )*B, or B := alpha*B*op( A ), * * where alpha is a scalar, B is an m by n matrix, A is a unit, or * non-unit, upper or lower triangular matrix and op( A ) is one of * * op( A ) = A or op( A ) = A'. * * Parameters * ========== * * SIDE - CHARACTER*1. * On entry, SIDE specifies whether op( A ) multiplies B from * the left or right as follows: * * SIDE = 'L' or 'l' B := alpha*op( A )*B. * * SIDE = 'R' or 'r' B := alpha*B*op( A ). * * Unchanged on exit. * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix A is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n' op( A ) = A. * * TRANSA = 'T' or 't' op( A ) = A'. * * TRANSA = 'C' or 'c' op( A ) = A'. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit triangular * as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of B. M must be at * least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of B. N must be * at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. When alpha is * zero then A is not referenced and B need not be set before * entry. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, k ), where k is m * when SIDE = 'L' or 'l' and is n when SIDE = 'R' or 'r'. * Before entry with UPLO = 'U' or 'u', the leading k by k * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading k by k * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When SIDE = 'L' or 'l' then * LDA must be at least max( 1, m ), when SIDE = 'R' or 'r' * then LDA must be at least max( 1, n ). * Unchanged on exit. * * B - DOUBLE PRECISION array of DIMENSION ( LDB, n ). * Before entry, the leading m by n part of the array B must * contain the matrix B, and on exit is overwritten by the * transformed matrix. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. LDB must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. Local Scalars .. LOGICAL LSIDE, NOUNIT, UPPER INTEGER I, INFO, J, K, NROWA DOUBLE PRECISION TEMP * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Executable Statements .. * * Test the input parameters. * LSIDE = LSAME( SIDE , 'L' ) IF( LSIDE )THEN NROWA = M ELSE NROWA = N END IF NOUNIT = LSAME( DIAG , 'N' ) UPPER = LSAME( UPLO , 'U' ) * INFO = 0 IF( ( .NOT.LSIDE ).AND. $ ( .NOT.LSAME( SIDE , 'R' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 2 ELSE IF( ( .NOT.LSAME( TRANSA, 'N' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'C' ) ) )THEN INFO = 3 ELSE IF( ( .NOT.LSAME( DIAG , 'U' ) ).AND. $ ( .NOT.LSAME( DIAG , 'N' ) ) )THEN INFO = 4 ELSE IF( M .LT.0 )THEN INFO = 5 ELSE IF( N .LT.0 )THEN INFO = 6 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 9 ELSE IF( LDB.LT.MAX( 1, M ) )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DTRMM ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M B( I, J ) = ZERO 10 CONTINUE 20 CONTINUE RETURN END IF * * Start the operations. * IF( LSIDE )THEN IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*A*B. * IF( UPPER )THEN DO 50, J = 1, N DO 40, K = 1, M IF( B( K, J ).NE.ZERO )THEN TEMP = ALPHA*B( K, J ) DO 30, I = 1, K - 1 B( I, J ) = B( I, J ) + TEMP*A( I, K ) 30 CONTINUE IF( NOUNIT ) $ TEMP = TEMP*A( K, K ) B( K, J ) = TEMP END IF 40 CONTINUE 50 CONTINUE ELSE DO 80, J = 1, N DO 70 K = M, 1, -1 IF( B( K, J ).NE.ZERO )THEN TEMP = ALPHA*B( K, J ) B( K, J ) = TEMP IF( NOUNIT ) $ B( K, J ) = B( K, J )*A( K, K ) DO 60, I = K + 1, M B( I, J ) = B( I, J ) + TEMP*A( I, K ) 60 CONTINUE END IF 70 CONTINUE 80 CONTINUE END IF ELSE * * Form B := alpha*B*A'. * IF( UPPER )THEN DO 110, J = 1, N DO 100, I = M, 1, -1 TEMP = B( I, J ) IF( NOUNIT ) $ TEMP = TEMP*A( I, I ) DO 90, K = 1, I - 1 TEMP = TEMP + A( K, I )*B( K, J ) 90 CONTINUE B( I, J ) = ALPHA*TEMP 100 CONTINUE 110 CONTINUE ELSE DO 140, J = 1, N DO 130, I = 1, M TEMP = B( I, J ) IF( NOUNIT ) $ TEMP = TEMP*A( I, I ) DO 120, K = I + 1, M TEMP = TEMP + A( K, I )*B( K, J ) 120 CONTINUE B( I, J ) = ALPHA*TEMP 130 CONTINUE 140 CONTINUE END IF END IF ELSE IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*B*A. * IF( UPPER )THEN DO 180, J = N, 1, -1 TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 150, I = 1, M B( I, J ) = TEMP*B( I, J ) 150 CONTINUE DO 170, K = 1, J - 1 IF( A( K, J ).NE.ZERO )THEN TEMP = ALPHA*A( K, J ) DO 160, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 160 CONTINUE END IF 170 CONTINUE 180 CONTINUE ELSE DO 220, J = 1, N TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 190, I = 1, M B( I, J ) = TEMP*B( I, J ) 190 CONTINUE DO 210, K = J + 1, N IF( A( K, J ).NE.ZERO )THEN TEMP = ALPHA*A( K, J ) DO 200, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 200 CONTINUE END IF 210 CONTINUE 220 CONTINUE END IF ELSE * * Form B := alpha*B*A'. * IF( UPPER )THEN DO 260, K = 1, N DO 240, J = 1, K - 1 IF( A( J, K ).NE.ZERO )THEN TEMP = ALPHA*A( J, K ) DO 230, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 230 CONTINUE END IF 240 CONTINUE TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( K, K ) IF( TEMP.NE.ONE )THEN DO 250, I = 1, M B( I, K ) = TEMP*B( I, K ) 250 CONTINUE END IF 260 CONTINUE ELSE DO 300, K = N, 1, -1 DO 280, J = K + 1, N IF( A( J, K ).NE.ZERO )THEN TEMP = ALPHA*A( J, K ) DO 270, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 270 CONTINUE END IF 280 CONTINUE TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( K, K ) IF( TEMP.NE.ONE )THEN DO 290, I = 1, M B( I, K ) = TEMP*B( I, K ) 290 CONTINUE END IF 300 CONTINUE END IF END IF END IF * RETURN * * End of DTRMM . * END octave-1.1.0/libcruft/blas/dtrmv.f100666 415 17 21353 5233162512 15220 0ustar jweusers* ************************************************************************ * SUBROUTINE DTRMV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * .. Scalar Arguments .. INTEGER INCX, LDA, N CHARACTER*1 DIAG, TRANS, UPLO * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), X( * ) * .. * * Purpose * ======= * * DTRMV performs one of the matrix-vector operations * * x := A*x, or x := A'*x, * * where x is an n element vector and A is an n by n unit, or non-unit, * upper or lower triangular matrix. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' x := A*x. * * TRANS = 'T' or 't' x := A'*x. * * TRANS = 'C' or 'c' x := A'*x. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit * triangular as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix A. * N must be at least zero. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, n ). * Unchanged on exit. * * X - DOUBLE PRECISION array of dimension at least * ( 1 + ( n - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the n * element vector x. On exit, X is overwritten with the * tranformed vector x. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. Local Scalars .. DOUBLE PRECISION TEMP INTEGER I, INFO, IX, J, JX, KX LOGICAL NOUNIT * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( UPLO , 'U' ).AND. $ .NOT.LSAME( UPLO , 'L' ) )THEN INFO = 1 ELSE IF( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 2 ELSE IF( .NOT.LSAME( DIAG , 'U' ).AND. $ .NOT.LSAME( DIAG , 'N' ) )THEN INFO = 3 ELSE IF( N.LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, N ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DTRMV ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * NOUNIT = LSAME( DIAG, 'N' ) * * Set up the start point in X if the increment is not unity. This * will be ( N - 1 )*INCX too small for descending loops. * IF( INCX.LE.0 )THEN KX = 1 - ( N - 1 )*INCX ELSE IF( INCX.NE.1 )THEN KX = 1 END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( LSAME( TRANS, 'N' ) )THEN * * Form x := A*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 20, J = 1, N IF( X( J ).NE.ZERO )THEN TEMP = X( J ) DO 10, I = 1, J - 1 X( I ) = X( I ) + TEMP*A( I, J ) 10 CONTINUE IF( NOUNIT ) $ X( J ) = X( J )*A( J, J ) END IF 20 CONTINUE ELSE JX = KX DO 40, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = X( JX ) IX = KX DO 30, I = 1, J - 1 X( IX ) = X( IX ) + TEMP*A( I, J ) IX = IX + INCX 30 CONTINUE IF( NOUNIT ) $ X( JX ) = X( JX )*A( J, J ) END IF JX = JX + INCX 40 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 60, J = N, 1, -1 IF( X( J ).NE.ZERO )THEN TEMP = X( J ) DO 50, I = N, J + 1, -1 X( I ) = X( I ) + TEMP*A( I, J ) 50 CONTINUE IF( NOUNIT ) $ X( J ) = X( J )*A( J, J ) END IF 60 CONTINUE ELSE KX = KX + ( N - 1 )*INCX JX = KX DO 80, J = N, 1, -1 IF( X( JX ).NE.ZERO )THEN TEMP = X( JX ) IX = KX DO 70, I = N, J + 1, -1 X( IX ) = X( IX ) + TEMP*A( I, J ) IX = IX - INCX 70 CONTINUE IF( NOUNIT ) $ X( JX ) = X( JX )*A( J, J ) END IF JX = JX - INCX 80 CONTINUE END IF END IF ELSE * * Form x := A'*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 100, J = N, 1, -1 TEMP = X( J ) IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 90, I = J - 1, 1, -1 TEMP = TEMP + A( I, J )*X( I ) 90 CONTINUE X( J ) = TEMP 100 CONTINUE ELSE JX = KX + ( N - 1 )*INCX DO 120, J = N, 1, -1 TEMP = X( JX ) IX = JX IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 110, I = J - 1, 1, -1 IX = IX - INCX TEMP = TEMP + A( I, J )*X( IX ) 110 CONTINUE X( JX ) = TEMP JX = JX - INCX 120 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 140, J = 1, N TEMP = X( J ) IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 130, I = J + 1, N TEMP = TEMP + A( I, J )*X( I ) 130 CONTINUE X( J ) = TEMP 140 CONTINUE ELSE JX = KX DO 160, J = 1, N TEMP = X( JX ) IX = JX IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 150, I = J + 1, N IX = IX + INCX TEMP = TEMP + A( I, J )*X( IX ) 150 CONTINUE X( JX ) = TEMP JX = JX + INCX 160 CONTINUE END IF END IF END IF * RETURN * * End of DTRMV . * END octave-1.1.0/libcruft/blas/dtrsm.f100666 415 17 30106 5310242222 15202 0ustar jweusers* ************************************************************************ * SUBROUTINE DTRSM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, $ B, LDB ) * .. Scalar Arguments .. CHARACTER*1 SIDE, UPLO, TRANSA, DIAG INTEGER M, N, LDA, LDB DOUBLE PRECISION ALPHA * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * DTRSM solves one of the matrix equations * * op( A )*X = alpha*B, or X*op( A ) = alpha*B, * * where alpha is a scalar, X and B are m by n matrices, A is a unit, or * non-unit, upper or lower triangular matrix and op( A ) is one of * * op( A ) = A or op( A ) = A'. * * The matrix X is overwritten on B. * * Parameters * ========== * * SIDE - CHARACTER*1. * On entry, SIDE specifies whether op( A ) appears on the left * or right of X as follows: * * SIDE = 'L' or 'l' op( A )*X = alpha*B. * * SIDE = 'R' or 'r' X*op( A ) = alpha*B. * * Unchanged on exit. * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix A is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n' op( A ) = A. * * TRANSA = 'T' or 't' op( A ) = A'. * * TRANSA = 'C' or 'c' op( A ) = A'. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit triangular * as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of B. M must be at * least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of B. N must be * at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. When alpha is * zero then A is not referenced and B need not be set before * entry. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, k ), where k is m * when SIDE = 'L' or 'l' and is n when SIDE = 'R' or 'r'. * Before entry with UPLO = 'U' or 'u', the leading k by k * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading k by k * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When SIDE = 'L' or 'l' then * LDA must be at least max( 1, m ), when SIDE = 'R' or 'r' * then LDA must be at least max( 1, n ). * Unchanged on exit. * * B - DOUBLE PRECISION array of DIMENSION ( LDB, n ). * Before entry, the leading m by n part of the array B must * contain the right-hand side matrix B, and on exit is * overwritten by the solution matrix X. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. LDB must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. Local Scalars .. LOGICAL LSIDE, NOUNIT, UPPER INTEGER I, INFO, J, K, NROWA DOUBLE PRECISION TEMP * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Executable Statements .. * * Test the input parameters. * LSIDE = LSAME( SIDE , 'L' ) IF( LSIDE )THEN NROWA = M ELSE NROWA = N END IF NOUNIT = LSAME( DIAG , 'N' ) UPPER = LSAME( UPLO , 'U' ) * INFO = 0 IF( ( .NOT.LSIDE ).AND. $ ( .NOT.LSAME( SIDE , 'R' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 2 ELSE IF( ( .NOT.LSAME( TRANSA, 'N' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'C' ) ) )THEN INFO = 3 ELSE IF( ( .NOT.LSAME( DIAG , 'U' ) ).AND. $ ( .NOT.LSAME( DIAG , 'N' ) ) )THEN INFO = 4 ELSE IF( M .LT.0 )THEN INFO = 5 ELSE IF( N .LT.0 )THEN INFO = 6 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 9 ELSE IF( LDB.LT.MAX( 1, M ) )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DTRSM ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M B( I, J ) = ZERO 10 CONTINUE 20 CONTINUE RETURN END IF * * Start the operations. * IF( LSIDE )THEN IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*inv( A )*B. * IF( UPPER )THEN DO 60, J = 1, N IF( ALPHA.NE.ONE )THEN DO 30, I = 1, M B( I, J ) = ALPHA*B( I, J ) 30 CONTINUE END IF DO 50, K = M, 1, -1 IF( B( K, J ).NE.ZERO )THEN IF( NOUNIT ) $ B( K, J ) = B( K, J )/A( K, K ) DO 40, I = 1, K - 1 B( I, J ) = B( I, J ) - B( K, J )*A( I, K ) 40 CONTINUE END IF 50 CONTINUE 60 CONTINUE ELSE DO 100, J = 1, N IF( ALPHA.NE.ONE )THEN DO 70, I = 1, M B( I, J ) = ALPHA*B( I, J ) 70 CONTINUE END IF DO 90 K = 1, M IF( B( K, J ).NE.ZERO )THEN IF( NOUNIT ) $ B( K, J ) = B( K, J )/A( K, K ) DO 80, I = K + 1, M B( I, J ) = B( I, J ) - B( K, J )*A( I, K ) 80 CONTINUE END IF 90 CONTINUE 100 CONTINUE END IF ELSE * * Form B := alpha*inv( A' )*B. * IF( UPPER )THEN DO 130, J = 1, N DO 120, I = 1, M TEMP = ALPHA*B( I, J ) DO 110, K = 1, I - 1 TEMP = TEMP - A( K, I )*B( K, J ) 110 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( I, I ) B( I, J ) = TEMP 120 CONTINUE 130 CONTINUE ELSE DO 160, J = 1, N DO 150, I = M, 1, -1 TEMP = ALPHA*B( I, J ) DO 140, K = I + 1, M TEMP = TEMP - A( K, I )*B( K, J ) 140 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( I, I ) B( I, J ) = TEMP 150 CONTINUE 160 CONTINUE END IF END IF ELSE IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*B*inv( A ). * IF( UPPER )THEN DO 210, J = 1, N IF( ALPHA.NE.ONE )THEN DO 170, I = 1, M B( I, J ) = ALPHA*B( I, J ) 170 CONTINUE END IF DO 190, K = 1, J - 1 IF( A( K, J ).NE.ZERO )THEN DO 180, I = 1, M B( I, J ) = B( I, J ) - A( K, J )*B( I, K ) 180 CONTINUE END IF 190 CONTINUE IF( NOUNIT )THEN TEMP = ONE/A( J, J ) DO 200, I = 1, M B( I, J ) = TEMP*B( I, J ) 200 CONTINUE END IF 210 CONTINUE ELSE DO 260, J = N, 1, -1 IF( ALPHA.NE.ONE )THEN DO 220, I = 1, M B( I, J ) = ALPHA*B( I, J ) 220 CONTINUE END IF DO 240, K = J + 1, N IF( A( K, J ).NE.ZERO )THEN DO 230, I = 1, M B( I, J ) = B( I, J ) - A( K, J )*B( I, K ) 230 CONTINUE END IF 240 CONTINUE IF( NOUNIT )THEN TEMP = ONE/A( J, J ) DO 250, I = 1, M B( I, J ) = TEMP*B( I, J ) 250 CONTINUE END IF 260 CONTINUE END IF ELSE * * Form B := alpha*B*inv( A' ). * IF( UPPER )THEN DO 310, K = N, 1, -1 IF( NOUNIT )THEN TEMP = ONE/A( K, K ) DO 270, I = 1, M B( I, K ) = TEMP*B( I, K ) 270 CONTINUE END IF DO 290, J = 1, K - 1 IF( A( J, K ).NE.ZERO )THEN TEMP = A( J, K ) DO 280, I = 1, M B( I, J ) = B( I, J ) - TEMP*B( I, K ) 280 CONTINUE END IF 290 CONTINUE IF( ALPHA.NE.ONE )THEN DO 300, I = 1, M B( I, K ) = ALPHA*B( I, K ) 300 CONTINUE END IF 310 CONTINUE ELSE DO 360, K = 1, N IF( NOUNIT )THEN TEMP = ONE/A( K, K ) DO 320, I = 1, M B( I, K ) = TEMP*B( I, K ) 320 CONTINUE END IF DO 340, J = K + 1, N IF( A( J, K ).NE.ZERO )THEN TEMP = A( J, K ) DO 330, I = 1, M B( I, J ) = B( I, J ) - TEMP*B( I, K ) 330 CONTINUE END IF 340 CONTINUE IF( ALPHA.NE.ONE )THEN DO 350, I = 1, M B( I, K ) = ALPHA*B( I, K ) 350 CONTINUE END IF 360 CONTINUE END IF END IF END IF * RETURN * * End of DTRSM . * END octave-1.1.0/libcruft/blas/dtrsv.f100666 415 17 21610 5233162525 15226 0ustar jweusers* ************************************************************************ * SUBROUTINE DTRSV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * .. Scalar Arguments .. INTEGER INCX, LDA, N CHARACTER*1 DIAG, TRANS, UPLO * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), X( * ) * .. * * Purpose * ======= * * DTRSV solves one of the systems of equations * * A*x = b, or A'*x = b, * * where b and x are n element vectors and A is an n by n unit, or * non-unit, upper or lower triangular matrix. * * No test for singularity or near-singularity is included in this * routine. Such tests must be performed before calling this routine. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the equations to be solved as * follows: * * TRANS = 'N' or 'n' A*x = b. * * TRANS = 'T' or 't' A'*x = b. * * TRANS = 'C' or 'c' A'*x = b. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit * triangular as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix A. * N must be at least zero. * Unchanged on exit. * * A - DOUBLE PRECISION array of DIMENSION ( LDA, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, n ). * Unchanged on exit. * * X - DOUBLE PRECISION array of dimension at least * ( 1 + ( n - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the n * element right-hand side vector b. On exit, X is overwritten * with the solution vector x. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. Local Scalars .. DOUBLE PRECISION TEMP INTEGER I, INFO, IX, J, JX, KX LOGICAL NOUNIT * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( UPLO , 'U' ).AND. $ .NOT.LSAME( UPLO , 'L' ) )THEN INFO = 1 ELSE IF( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 2 ELSE IF( .NOT.LSAME( DIAG , 'U' ).AND. $ .NOT.LSAME( DIAG , 'N' ) )THEN INFO = 3 ELSE IF( N.LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, N ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'DTRSV ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * NOUNIT = LSAME( DIAG, 'N' ) * * Set up the start point in X if the increment is not unity. This * will be ( N - 1 )*INCX too small for descending loops. * IF( INCX.LE.0 )THEN KX = 1 - ( N - 1 )*INCX ELSE IF( INCX.NE.1 )THEN KX = 1 END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( LSAME( TRANS, 'N' ) )THEN * * Form x := inv( A )*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 20, J = N, 1, -1 IF( X( J ).NE.ZERO )THEN IF( NOUNIT ) $ X( J ) = X( J )/A( J, J ) TEMP = X( J ) DO 10, I = J - 1, 1, -1 X( I ) = X( I ) - TEMP*A( I, J ) 10 CONTINUE END IF 20 CONTINUE ELSE JX = KX + ( N - 1 )*INCX DO 40, J = N, 1, -1 IF( X( JX ).NE.ZERO )THEN IF( NOUNIT ) $ X( JX ) = X( JX )/A( J, J ) TEMP = X( JX ) IX = JX DO 30, I = J - 1, 1, -1 IX = IX - INCX X( IX ) = X( IX ) - TEMP*A( I, J ) 30 CONTINUE END IF JX = JX - INCX 40 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 60, J = 1, N IF( X( J ).NE.ZERO )THEN IF( NOUNIT ) $ X( J ) = X( J )/A( J, J ) TEMP = X( J ) DO 50, I = J + 1, N X( I ) = X( I ) - TEMP*A( I, J ) 50 CONTINUE END IF 60 CONTINUE ELSE JX = KX DO 80, J = 1, N IF( X( JX ).NE.ZERO )THEN IF( NOUNIT ) $ X( JX ) = X( JX )/A( J, J ) TEMP = X( JX ) IX = JX DO 70, I = J + 1, N IX = IX + INCX X( IX ) = X( IX ) - TEMP*A( I, J ) 70 CONTINUE END IF JX = JX + INCX 80 CONTINUE END IF END IF ELSE * * Form x := inv( A' )*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 100, J = 1, N TEMP = X( J ) DO 90, I = 1, J - 1 TEMP = TEMP - A( I, J )*X( I ) 90 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) X( J ) = TEMP 100 CONTINUE ELSE JX = KX DO 120, J = 1, N TEMP = X( JX ) IX = KX DO 110, I = 1, J - 1 TEMP = TEMP - A( I, J )*X( IX ) IX = IX + INCX 110 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) X( JX ) = TEMP JX = JX + INCX 120 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 140, J = N, 1, -1 TEMP = X( J ) DO 130, I = N, J + 1, -1 TEMP = TEMP - A( I, J )*X( I ) 130 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) X( J ) = TEMP 140 CONTINUE ELSE KX = KX + ( N - 1 )*INCX JX = KX DO 160, J = N, 1, -1 TEMP = X( JX ) IX = KX DO 150, I = N, J + 1, -1 TEMP = TEMP - A( I, J )*X( IX ) IX = IX - INCX 150 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) X( JX ) = TEMP JX = JX - INCX 160 CONTINUE END IF END IF END IF * RETURN * * End of DTRSV . * END octave-1.1.0/libcruft/blas/dzasum.f100666 415 17 1402 5302540342 15336 0ustar jweusers double precision function dzasum(n,zx,incx) c c takes the sum of the absolute values. c jack dongarra, 3/11/78. c modified to correct problem with negative increment, 8/21/90. c double complex zx(1) double precision stemp,dcabs1 integer i,incx,ix,n c dzasum = 0.0d0 stemp = 0.0d0 if(n.le.0)return if(incx.eq.1)go to 20 c c code for increment not equal to 1 c ix = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 do 10 i = 1,n stemp = stemp + dcabs1(zx(ix)) ix = ix + incx 10 continue dzasum = stemp return c c code for increment equal to 1 c 20 do 30 i = 1,n stemp = stemp + dcabs1(zx(i)) 30 continue dzasum = stemp return end octave-1.1.0/libcruft/blas/dznrm2.f100666 415 17 10351 5302540350 15271 0ustar jweusers double precision function dznrm2( n, zx, incx) logical imag, scale integer i, incx, ix, n, next double precision cutlo, cuthi, hitest, sum, xmax, absx, zero, one double complex zx(1) double precision dreal,dimag double complex zdumr,zdumi dreal(zdumr) = zdumr dimag(zdumi) = (0.0d0,-1.0d0)*zdumi data zero, one /0.0d0, 1.0d0/ c c unitary norm of the complex n-vector stored in zx() with storage c increment incx . c if n .le. 0 return with result = 0. c if n .ge. 1 then incx must be .ge. 1 c c c.l.lawson , 1978 jan 08 c modified to correct problem with negative increment, 8/21/90. c c four phase method using two built-in constants that are c hopefully applicable to all machines. c cutlo = maximum of sqrt(u/eps) over all known machines. c cuthi = minimum of sqrt(v) over all known machines. c where c eps = smallest no. such that eps + 1. .gt. 1. c u = smallest positive no. (underflow limit) c v = largest no. (overflow limit) c c brief outline of algorithm.. c c phase 1 scans zero components. c move to phase 2 when a component is nonzero and .le. cutlo c move to phase 3 when a component is .gt. cutlo c move to phase 4 when a component is .ge. cuthi/m c where m = n for x() real and m = 2*n for complex. c c values for cutlo and cuthi.. c from the environmental parameters listed in the imsl converter c document the limiting values are as follows.. c cutlo, s.p. u/eps = 2**(-102) for honeywell. close seconds are c univac and dec at 2**(-103) c thus cutlo = 2**(-51) = 4.44089e-16 c cuthi, s.p. v = 2**127 for univac, honeywell, and dec. c thus cuthi = 2**(63.5) = 1.30438e19 c cutlo, d.p. u/eps = 2**(-67) for honeywell and dec. c thus cutlo = 2**(-33.5) = 8.23181d-11 c cuthi, d.p. same as s.p. cuthi = 1.30438d19 c data cutlo, cuthi / 8.232d-11, 1.304d19 / c data cutlo, cuthi / 4.441e-16, 1.304e19 / data cutlo, cuthi / 8.232d-11, 1.304d19 / c if(n .gt. 0) go to 10 dznrm2 = zero go to 300 c 10 assign 30 to next sum = zero i = 1 if( incx .lt. 0 )i = (-n+1)*incx + 1 c begin main loop do 220 ix = 1,n absx = dabs(dreal(zx(i))) imag = .false. go to next,(30, 50, 70, 90, 110) 30 if( absx .gt. cutlo) go to 85 assign 50 to next scale = .false. c c phase 1. sum is zero c 50 if( absx .eq. zero) go to 200 if( absx .gt. cutlo) go to 85 c c prepare for phase 2. assign 70 to next go to 105 c c prepare for phase 4. c 100 assign 110 to next sum = (sum / absx) / absx 105 scale = .true. xmax = absx go to 115 c c phase 2. sum is small. c scale to avoid destructive underflow. c 70 if( absx .gt. cutlo ) go to 75 c c common code for phases 2 and 4. c in phase 4 sum is large. scale to avoid overflow. c 110 if( absx .le. xmax ) go to 115 sum = one + sum * (xmax / absx)**2 xmax = absx go to 200 c 115 sum = sum + (absx/xmax)**2 go to 200 c c c prepare for phase 3. c 75 sum = (sum * xmax) * xmax c 85 assign 90 to next scale = .false. c c for real or d.p. set hitest = cuthi/n c for complex set hitest = cuthi/(2*n) c hitest = cuthi/dble( 2*n ) c c phase 3. sum is mid-range. no scaling. c 90 if(absx .ge. hitest) go to 100 sum = sum + absx**2 200 continue c control selection of real and imaginary parts. c if(imag) go to 210 absx = dabs(dimag(zx(i))) imag = .true. go to next,( 50, 70, 90, 110 ) c 210 continue i = i + incx 220 continue c c end of main loop. c compute square root and adjust for scaling. c dznrm2 = dsqrt(sum) if(scale) dznrm2 = dznrm2 * xmax 300 continue return end octave-1.1.0/libcruft/blas/idamax.f100666 415 17 1445 5201737451 15314 0ustar jweusers INTEGER FUNCTION IDAMAX(N,DX,INCX) C C FINDS THE INDEX OF ELEMENT HAVING MAX. ABSOLUTE VALUE. C JACK DONGARRA, LINPACK, 3/11/78. C DOUBLE PRECISION DX(1),DMAX INTEGER I,INCX,IX,N C IDAMAX = 0 IF( N .LT. 1 ) RETURN IDAMAX = 1 IF(N.EQ.1)RETURN IF(INCX.EQ.1)GO TO 20 C C CODE FOR INCREMENT NOT EQUAL TO 1 C IX = 1 DMAX = DABS(DX(1)) IX = IX + INCX DO 10 I = 2,N IF(DABS(DX(IX)).LE.DMAX) GO TO 5 IDAMAX = I DMAX = DABS(DX(IX)) 5 IX = IX + INCX 10 CONTINUE RETURN C C CODE FOR INCREMENT EQUAL TO 1 C 20 DMAX = DABS(DX(1)) DO 30 I = 2,N IF(DABS(DX(I)).LE.DMAX) GO TO 30 IDAMAX = I DMAX = DABS(DX(I)) 30 CONTINUE RETURN END octave-1.1.0/libcruft/blas/izamax.f100666 415 17 1703 5302540334 15331 0ustar jweusers integer function izamax(n,zx,incx) c c finds the index of element having max. absolute value. c jack dongarra, 1/15/85. c modified to correct problem with negative increment, 8/21/90. c double complex zx(1) double precision smax integer i,incx,ix,n double precision dcabs1 c izamax = 0 if(n.lt.1)return izamax = 1 if(n.eq.1)return if(incx.eq.1)go to 20 c c code for increment not equal to 1 c ix = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 smax = dcabs1(zx(ix)) ix = ix + incx do 10 i = 2,n if(dcabs1(zx(ix)).le.smax) go to 5 izamax = i smax = dcabs1(zx(ix)) 5 ix = ix + incx 10 continue return c c code for increment equal to 1 c 20 smax = dcabs1(zx(1)) do 30 i = 2,n if(dcabs1(zx(i)).le.smax) go to 30 izamax = i smax = dcabs1(zx(i)) 30 continue return end octave-1.1.0/libcruft/blas/lsame.f100666 415 17 4572 5150622170 15150 0ustar jweusers LOGICAL FUNCTION LSAME ( CA, CB ) * .. Scalar Arguments .. CHARACTER*1 CA, CB * .. * * Purpose * ======= * * LSAME tests if CA is the same letter as CB regardless of case. * CB is assumed to be an upper case letter. LSAME returns .TRUE. if * CA is either the same as CB or the equivalent lower case letter. * * N.B. This version of the routine is only correct for ASCII code. * Installers must modify the routine for other character-codes. * * For EBCDIC systems the constant IOFF must be changed to -64. * For CDC systems using 6-12 bit representations, the system- * specific code in comments must be activated. * * Parameters * ========== * * CA - CHARACTER*1 * CB - CHARACTER*1 * On entry, CA and CB specify characters to be compared. * Unchanged on exit. * * * Auxiliary routine for Level 2 Blas. * * -- Written on 20-July-1986 * Richard Hanson, Sandia National Labs. * Jeremy Du Croz, Nag Central Office. * * .. Parameters .. INTEGER IOFF PARAMETER ( IOFF=32 ) * .. Intrinsic Functions .. INTRINSIC ICHAR * .. Executable Statements .. * * Test if the characters are equal * LSAME = CA .EQ. CB * * Now test for equivalence * IF ( .NOT.LSAME ) THEN LSAME = ICHAR(CA) - IOFF .EQ. ICHAR(CB) END IF * RETURN * * The following comments contain code for CDC systems using 6-12 bit * representations. * * .. Parameters .. * INTEGER ICIRFX * PARAMETER ( ICIRFX=62 ) * .. Scalar Arguments .. * CHARACTER*1 CB * .. Array Arguments .. * CHARACTER*1 CA(*) * .. Local Scalars .. * INTEGER IVAL * .. Intrinsic Functions .. * INTRINSIC ICHAR, CHAR * .. Executable Statements .. * * See if the first character in string CA equals string CB. * * LSAME = CA(1) .EQ. CB .AND. CA(1) .NE. CHAR(ICIRFX) * * IF (LSAME) RETURN * * The characters are not identical. Now check them for equivalence. * Look for the 'escape' character, circumflex, followed by the * letter. * * IVAL = ICHAR(CA(2)) * IF (IVAL.GE.ICHAR('A') .AND. IVAL.LE.ICHAR('Z')) THEN * LSAME = CA(1) .EQ. CHAR(ICIRFX) .AND. CA(2) .EQ. CB * END IF * * RETURN * * End of LSAME. * END octave-1.1.0/libcruft/blas/xerbla.f100666 415 17 2054 5405741545 15330 0ustar jweusers SUBROUTINE XERBLA ( SRNAME, INFO ) * .. Scalar Arguments .. INTEGER INFO CHARACTER*6 SRNAME * .. * * Purpose * ======= * * XERBLA is an error handler for the Level 2 BLAS routines. * * It is called by the Level 2 BLAS routines if an input parameter is * invalid. * * Installers should consider modifying the STOP statement in order to * call system-specific exception-handling facilities. * * Parameters * ========== * * SRNAME - CHARACTER*6. * On entry, SRNAME specifies the name of the routine which * called XERBLA. * * INFO - INTEGER. * On entry, INFO specifies the position of the invalid * parameter in the parameter-list of the calling routine. * * * Auxiliary routine for Level 2 Blas. * * Written on 20-July-1986. * * .. Executable Statements .. * WRITE (*,99999) SRNAME, INFO * CALL XSTOPX (' ') * 99999 FORMAT ( ' ** On entry to ', A6, ' parameter number ', I2, $ ' had an illegal value' ) * * End of XERBLA. * END octave-1.1.0/libcruft/blas/zaxpy.f100666 415 17 1431 5302540217 15211 0ustar jweusers subroutine zaxpy(n,za,zx,incx,zy,incy) c c constant times a vector plus a vector. c jack dongarra, 3/11/78. c double complex zx(1),zy(1),za integer i,incx,incy,ix,iy,n double precision dcabs1 if(n.le.0)return if (dcabs1(za) .eq. 0.0d0) return if (incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments c not equal to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n zy(iy) = zy(iy) + za*zx(ix) ix = ix + incx iy = iy + incy 10 continue return c c code for both increments equal to 1 c 20 do 30 i = 1,n zy(i) = zy(i) + za*zx(i) 30 continue return end octave-1.1.0/libcruft/blas/zcopy.f100666 415 17 1276 5302540217 15211 0ustar jweusers subroutine zcopy(n,zx,incx,zy,incy) c c copies a vector, x, to a vector, y. c jack dongarra, linpack, 4/11/78. c double complex zx(1),zy(1) integer i,incx,incy,ix,iy,n c if(n.le.0)return if(incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments c not equal to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n zy(iy) = zx(ix) ix = ix + incx iy = iy + incy 10 continue return c c code for both increments equal to 1 c 20 do 30 i = 1,n zy(i) = zx(i) 30 continue return end octave-1.1.0/libcruft/blas/zdotc.f100666 415 17 1520 5302540312 15154 0ustar jweusers double complex function zdotc(n,zx,incx,zy,incy) c c forms the dot product of a vector. c jack dongarra, 3/11/78. c double complex zx(1),zy(1),ztemp integer i,incx,incy,ix,iy,n ztemp = (0.0d0,0.0d0) zdotc = (0.0d0,0.0d0) if(n.le.0)return if(incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments c not equal to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n ztemp = ztemp + dconjg(zx(ix))*zy(iy) ix = ix + incx iy = iy + incy 10 continue zdotc = ztemp return c c code for both increments equal to 1 c 20 do 30 i = 1,n ztemp = ztemp + dconjg(zx(i))*zy(i) 30 continue zdotc = ztemp return end octave-1.1.0/libcruft/blas/zdotu.f100666 415 17 1503 5302540312 15177 0ustar jweusers double complex function zdotu(n,zx,incx,zy,incy) c c forms the dot product of two vectors. c jack dongarra, 3/11/78. c double complex zx(1),zy(1),ztemp integer i,incx,incy,ix,iy,n ztemp = (0.0d0,0.0d0) zdotu = (0.0d0,0.0d0) if(n.le.0)return if(incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments c not equal to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n ztemp = ztemp + zx(ix)*zy(iy) ix = ix + incx iy = iy + incy 10 continue zdotu = ztemp return c c code for both increments equal to 1 c 20 do 30 i = 1,n ztemp = ztemp + zx(i)*zy(i) 30 continue zdotu = ztemp return end octave-1.1.0/libcruft/blas/zdrot.f100666 415 17 1714 5302540315 15203 0ustar jweusers subroutine zdrot (n,zx,incx,zy,incy,c,s) c c applies a plane rotation, where the cos and sin (c and s) are c double precision and the vectors zx and zy are double complex. c jack dongarra, linpack, 3/11/78. c double complex zx(1),zy(1),ztemp double precision c,s integer i,incx,incy,ix,iy,n c if(n.le.0)return if(incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments not equal c to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n ztemp = c*zx(ix) + s*zy(iy) zy(iy) = c*zy(iy) - s*zx(ix) zx(ix) = ztemp ix = ix + incx iy = iy + incy 10 continue return c c code for both increments equal to 1 c 20 do 30 i = 1,n ztemp = c*zx(i) + s*zy(i) zy(i) = c*zy(i) - s*zx(i) zx(i) = ztemp 30 continue return end octave-1.1.0/libcruft/blas/zdscal.f100666 415 17 1226 5302540323 15316 0ustar jweusers subroutine zdscal(n,da,zx,incx) c c scales a vector by a constant. c jack dongarra, 3/11/78. c modified to correct problem with negative increment, 8/21/90. c double complex zx(1) double precision da integer i,incx,ix,n c if(n.le.0)return if(incx.eq.1)go to 20 c c code for increment not equal to 1 c ix = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 do 10 i = 1,n zx(ix) = dcmplx(da,0.0d0)*zx(ix) ix = ix + incx 10 continue return c c code for increment equal to 1 c 20 do 30 i = 1,n zx(i) = dcmplx(da,0.0d0)*zx(i) 30 continue return end octave-1.1.0/libcruft/blas/zgemm.f100666 415 17 31643 5302540201 15176 0ustar jweusers SUBROUTINE ZGEMM ( TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, $ BETA, C, LDC ) * .. Scalar Arguments .. CHARACTER*1 TRANSA, TRANSB INTEGER M, N, K, LDA, LDB, LDC COMPLEX*16 ALPHA, BETA * .. Array Arguments .. COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * * Purpose * ======= * * ZGEMM performs one of the matrix-matrix operations * * C := alpha*op( A )*op( B ) + beta*C, * * where op( X ) is one of * * op( X ) = X or op( X ) = X' or op( X ) = conjg( X' ), * * alpha and beta are scalars, and A, B and C are matrices, with op( A ) * an m by k matrix, op( B ) a k by n matrix and C an m by n matrix. * * Parameters * ========== * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n', op( A ) = A. * * TRANSA = 'T' or 't', op( A ) = A'. * * TRANSA = 'C' or 'c', op( A ) = conjg( A' ). * * Unchanged on exit. * * TRANSB - CHARACTER*1. * On entry, TRANSB specifies the form of op( B ) to be used in * the matrix multiplication as follows: * * TRANSB = 'N' or 'n', op( B ) = B. * * TRANSB = 'T' or 't', op( B ) = B'. * * TRANSB = 'C' or 'c', op( B ) = conjg( B' ). * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of the matrix * op( A ) and of the matrix C. M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix * op( B ) and the number of columns of the matrix C. N must be * at least zero. * Unchanged on exit. * * K - INTEGER. * On entry, K specifies the number of columns of the matrix * op( A ) and the number of rows of the matrix op( B ). K must * be at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, ka ), where ka is * k when TRANSA = 'N' or 'n', and is m otherwise. * Before entry with TRANSA = 'N' or 'n', the leading m by k * part of the array A must contain the matrix A, otherwise * the leading k by m part of the array A must contain the * matrix A. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When TRANSA = 'N' or 'n' then * LDA must be at least max( 1, m ), otherwise LDA must be at * least max( 1, k ). * Unchanged on exit. * * B - COMPLEX*16 array of DIMENSION ( LDB, kb ), where kb is * n when TRANSB = 'N' or 'n', and is k otherwise. * Before entry with TRANSB = 'N' or 'n', the leading k by n * part of the array B must contain the matrix B, otherwise * the leading n by k part of the array B must contain the * matrix B. * Unchanged on exit. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. When TRANSB = 'N' or 'n' then * LDB must be at least max( 1, k ), otherwise LDB must be at * least max( 1, n ). * Unchanged on exit. * * BETA - COMPLEX*16 . * On entry, BETA specifies the scalar beta. When BETA is * supplied as zero then C need not be set on input. * Unchanged on exit. * * C - COMPLEX*16 array of DIMENSION ( LDC, n ). * Before entry, the leading m by n part of the array C must * contain the matrix C, except when beta is zero, in which * case C need not be set on entry. * On exit, the array C is overwritten by the m by n matrix * ( alpha*op( A )*op( B ) + beta*C ). * * LDC - INTEGER. * On entry, LDC specifies the first dimension of C as declared * in the calling (sub) program. LDC must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. Local Scalars .. LOGICAL CONJA, CONJB, NOTA, NOTB INTEGER I, INFO, J, L, NCOLA, NROWA, NROWB COMPLEX*16 TEMP * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. * .. Executable Statements .. * * Set NOTA and NOTB as true if A and B respectively are not * conjugated or transposed, set CONJA and CONJB as true if A and * B respectively are to be transposed but not conjugated and set * NROWA, NCOLA and NROWB as the number of rows and columns of A * and the number of rows of B respectively. * NOTA = LSAME( TRANSA, 'N' ) NOTB = LSAME( TRANSB, 'N' ) CONJA = LSAME( TRANSA, 'C' ) CONJB = LSAME( TRANSB, 'C' ) IF( NOTA )THEN NROWA = M NCOLA = K ELSE NROWA = K NCOLA = M END IF IF( NOTB )THEN NROWB = K ELSE NROWB = N END IF * * Test the input parameters. * INFO = 0 IF( ( .NOT.NOTA ).AND. $ ( .NOT.CONJA ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.NOTB ).AND. $ ( .NOT.CONJB ).AND. $ ( .NOT.LSAME( TRANSB, 'T' ) ) )THEN INFO = 2 ELSE IF( M .LT.0 )THEN INFO = 3 ELSE IF( N .LT.0 )THEN INFO = 4 ELSE IF( K .LT.0 )THEN INFO = 5 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 8 ELSE IF( LDB.LT.MAX( 1, NROWB ) )THEN INFO = 10 ELSE IF( LDC.LT.MAX( 1, M ) )THEN INFO = 13 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZGEMM ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR. $ ( ( ( ALPHA.EQ.ZERO ).OR.( K.EQ.0 ) ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN IF( BETA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M C( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE DO 40, J = 1, N DO 30, I = 1, M C( I, J ) = BETA*C( I, J ) 30 CONTINUE 40 CONTINUE END IF RETURN END IF * * Start the operations. * IF( NOTB )THEN IF( NOTA )THEN * * Form C := alpha*A*B + beta*C. * DO 90, J = 1, N IF( BETA.EQ.ZERO )THEN DO 50, I = 1, M C( I, J ) = ZERO 50 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 60, I = 1, M C( I, J ) = BETA*C( I, J ) 60 CONTINUE END IF DO 80, L = 1, K IF( B( L, J ).NE.ZERO )THEN TEMP = ALPHA*B( L, J ) DO 70, I = 1, M C( I, J ) = C( I, J ) + TEMP*A( I, L ) 70 CONTINUE END IF 80 CONTINUE 90 CONTINUE ELSE IF( CONJA )THEN * * Form C := alpha*conjg( A' )*B + beta*C. * DO 120, J = 1, N DO 110, I = 1, M TEMP = ZERO DO 100, L = 1, K TEMP = TEMP + DCONJG( A( L, I ) )*B( L, J ) 100 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 110 CONTINUE 120 CONTINUE ELSE * * Form C := alpha*A'*B + beta*C * DO 150, J = 1, N DO 140, I = 1, M TEMP = ZERO DO 130, L = 1, K TEMP = TEMP + A( L, I )*B( L, J ) 130 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 140 CONTINUE 150 CONTINUE END IF ELSE IF( NOTA )THEN IF( CONJB )THEN * * Form C := alpha*A*conjg( B' ) + beta*C. * DO 200, J = 1, N IF( BETA.EQ.ZERO )THEN DO 160, I = 1, M C( I, J ) = ZERO 160 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 170, I = 1, M C( I, J ) = BETA*C( I, J ) 170 CONTINUE END IF DO 190, L = 1, K IF( B( J, L ).NE.ZERO )THEN TEMP = ALPHA*DCONJG( B( J, L ) ) DO 180, I = 1, M C( I, J ) = C( I, J ) + TEMP*A( I, L ) 180 CONTINUE END IF 190 CONTINUE 200 CONTINUE ELSE * * Form C := alpha*A*B' + beta*C * DO 250, J = 1, N IF( BETA.EQ.ZERO )THEN DO 210, I = 1, M C( I, J ) = ZERO 210 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 220, I = 1, M C( I, J ) = BETA*C( I, J ) 220 CONTINUE END IF DO 240, L = 1, K IF( B( J, L ).NE.ZERO )THEN TEMP = ALPHA*B( J, L ) DO 230, I = 1, M C( I, J ) = C( I, J ) + TEMP*A( I, L ) 230 CONTINUE END IF 240 CONTINUE 250 CONTINUE END IF ELSE IF( CONJA )THEN IF( CONJB )THEN * * Form C := alpha*conjg( A' )*conjg( B' ) + beta*C. * DO 280, J = 1, N DO 270, I = 1, M TEMP = ZERO DO 260, L = 1, K TEMP = TEMP + $ DCONJG( A( L, I ) )*DCONJG( B( J, L ) ) 260 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 270 CONTINUE 280 CONTINUE ELSE * * Form C := alpha*conjg( A' )*B' + beta*C * DO 310, J = 1, N DO 300, I = 1, M TEMP = ZERO DO 290, L = 1, K TEMP = TEMP + DCONJG( A( L, I ) )*B( J, L ) 290 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 300 CONTINUE 310 CONTINUE END IF ELSE IF( CONJB )THEN * * Form C := alpha*A'*conjg( B' ) + beta*C * DO 340, J = 1, N DO 330, I = 1, M TEMP = ZERO DO 320, L = 1, K TEMP = TEMP + A( L, I )*DCONJG( B( J, L ) ) 320 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 330 CONTINUE 340 CONTINUE ELSE * * Form C := alpha*A'*B' + beta*C * DO 370, J = 1, N DO 360, I = 1, M TEMP = ZERO DO 350, L = 1, K TEMP = TEMP + A( L, I )*B( J, L ) 350 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 360 CONTINUE 370 CONTINUE END IF END IF * RETURN * * End of ZGEMM . * END octave-1.1.0/libcruft/blas/zgemv.f100666 415 17 17755 5302540211 15220 0ustar jweusers SUBROUTINE ZGEMV ( TRANS, M, N, ALPHA, A, LDA, X, INCX, $ BETA, Y, INCY ) * .. Scalar Arguments .. COMPLEX*16 ALPHA, BETA INTEGER INCX, INCY, LDA, M, N CHARACTER*1 TRANS * .. Array Arguments .. COMPLEX*16 A( LDA, * ), X( * ), Y( * ) * .. * * Purpose * ======= * * ZGEMV performs one of the matrix-vector operations * * y := alpha*A*x + beta*y, or y := alpha*A'*x + beta*y, or * * y := alpha*conjg( A' )*x + beta*y, * * where alpha and beta are scalars, x and y are vectors and A is an * m by n matrix. * * Parameters * ========== * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' y := alpha*A*x + beta*y. * * TRANS = 'T' or 't' y := alpha*A'*x + beta*y. * * TRANS = 'C' or 'c' y := alpha*conjg( A' )*x + beta*y. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of the matrix A. * M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix A. * N must be at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, n ). * Before entry, the leading m by n part of the array A must * contain the matrix of coefficients. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, m ). * Unchanged on exit. * * X - COMPLEX*16 array of DIMENSION at least * ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' * and at least * ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. * Before entry, the incremented array X must contain the * vector x. * Unchanged on exit. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * BETA - COMPLEX*16 . * On entry, BETA specifies the scalar beta. When BETA is * supplied as zero then Y need not be set on input. * Unchanged on exit. * * Y - COMPLEX*16 array of DIMENSION at least * ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' * and at least * ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. * Before entry with BETA non-zero, the incremented array Y * must contain the vector y. On exit, Y is overwritten by the * updated vector y. * * INCY - INTEGER. * On entry, INCY specifies the increment for the elements of * Y. INCY must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. Local Scalars .. COMPLEX*16 TEMP INTEGER I, INFO, IX, IY, J, JX, JY, KX, KY, LENX, LENY LOGICAL NOCONJ * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 1 ELSE IF( M.LT.0 )THEN INFO = 2 ELSE IF( N.LT.0 )THEN INFO = 3 ELSE IF( LDA.LT.MAX( 1, M ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 ELSE IF( INCY.EQ.0 )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZGEMV ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR. $ ( ( ALPHA.EQ.ZERO ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * NOCONJ = LSAME( TRANS, 'T' ) * * Set LENX and LENY, the lengths of the vectors x and y, and set * up the start points in X and Y. * IF( LSAME( TRANS, 'N' ) )THEN LENX = N LENY = M ELSE LENX = M LENY = N END IF IF( INCX.GT.0 )THEN KX = 1 ELSE KX = 1 - ( LENX - 1 )*INCX END IF IF( INCY.GT.0 )THEN KY = 1 ELSE KY = 1 - ( LENY - 1 )*INCY END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * * First form y := beta*y. * IF( BETA.NE.ONE )THEN IF( INCY.EQ.1 )THEN IF( BETA.EQ.ZERO )THEN DO 10, I = 1, LENY Y( I ) = ZERO 10 CONTINUE ELSE DO 20, I = 1, LENY Y( I ) = BETA*Y( I ) 20 CONTINUE END IF ELSE IY = KY IF( BETA.EQ.ZERO )THEN DO 30, I = 1, LENY Y( IY ) = ZERO IY = IY + INCY 30 CONTINUE ELSE DO 40, I = 1, LENY Y( IY ) = BETA*Y( IY ) IY = IY + INCY 40 CONTINUE END IF END IF END IF IF( ALPHA.EQ.ZERO ) $ RETURN IF( LSAME( TRANS, 'N' ) )THEN * * Form y := alpha*A*x + y. * JX = KX IF( INCY.EQ.1 )THEN DO 60, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = ALPHA*X( JX ) DO 50, I = 1, M Y( I ) = Y( I ) + TEMP*A( I, J ) 50 CONTINUE END IF JX = JX + INCX 60 CONTINUE ELSE DO 80, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = ALPHA*X( JX ) IY = KY DO 70, I = 1, M Y( IY ) = Y( IY ) + TEMP*A( I, J ) IY = IY + INCY 70 CONTINUE END IF JX = JX + INCX 80 CONTINUE END IF ELSE * * Form y := alpha*A'*x + y or y := alpha*conjg( A' )*x + y. * JY = KY IF( INCX.EQ.1 )THEN DO 110, J = 1, N TEMP = ZERO IF( NOCONJ )THEN DO 90, I = 1, M TEMP = TEMP + A( I, J )*X( I ) 90 CONTINUE ELSE DO 100, I = 1, M TEMP = TEMP + DCONJG( A( I, J ) )*X( I ) 100 CONTINUE END IF Y( JY ) = Y( JY ) + ALPHA*TEMP JY = JY + INCY 110 CONTINUE ELSE DO 140, J = 1, N TEMP = ZERO IX = KX IF( NOCONJ )THEN DO 120, I = 1, M TEMP = TEMP + A( I, J )*X( IX ) IX = IX + INCX 120 CONTINUE ELSE DO 130, I = 1, M TEMP = TEMP + DCONJG( A( I, J ) )*X( IX ) IX = IX + INCX 130 CONTINUE END IF Y( JY ) = Y( JY ) + ALPHA*TEMP JY = JY + INCY 140 CONTINUE END IF END IF * RETURN * * End of ZGEMV . * END octave-1.1.0/libcruft/blas/zgerc.f100666 415 17 10477 5306570531 15210 0ustar jweusers SUBROUTINE ZGERC ( M, N, ALPHA, X, INCX, Y, INCY, A, LDA ) * .. Scalar Arguments .. COMPLEX*16 ALPHA INTEGER INCX, INCY, LDA, M, N * .. Array Arguments .. COMPLEX*16 A( LDA, * ), X( * ), Y( * ) * .. * * Purpose * ======= * * ZGERC performs the rank 1 operation * * A := alpha*x*conjg( y' ) + A, * * where alpha is a scalar, x is an m element vector, y is an n element * vector and A is an m by n matrix. * * Parameters * ========== * * M - INTEGER. * On entry, M specifies the number of rows of the matrix A. * M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix A. * N must be at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * X - COMPLEX*16 array of dimension at least * ( 1 + ( m - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the m * element vector x. * Unchanged on exit. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * Y - COMPLEX*16 array of dimension at least * ( 1 + ( n - 1 )*abs( INCY ) ). * Before entry, the incremented array Y must contain the n * element vector y. * Unchanged on exit. * * INCY - INTEGER. * On entry, INCY specifies the increment for the elements of * Y. INCY must not be zero. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, n ). * Before entry, the leading m by n part of the array A must * contain the matrix of coefficients. On exit, A is * overwritten by the updated matrix. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, m ). * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. Local Scalars .. COMPLEX*16 TEMP INTEGER I, INFO, IX, J, JY, KX * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( M.LT.0 )THEN INFO = 1 ELSE IF( N.LT.0 )THEN INFO = 2 ELSE IF( INCX.EQ.0 )THEN INFO = 5 ELSE IF( INCY.EQ.0 )THEN INFO = 7 ELSE IF( LDA.LT.MAX( 1, M ) )THEN INFO = 9 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZGERC ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR.( ALPHA.EQ.ZERO ) ) $ RETURN * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( INCY.GT.0 )THEN JY = 1 ELSE JY = 1 - ( N - 1 )*INCY END IF IF( INCX.EQ.1 )THEN DO 20, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*DCONJG( Y( JY ) ) DO 10, I = 1, M A( I, J ) = A( I, J ) + X( I )*TEMP 10 CONTINUE END IF JY = JY + INCY 20 CONTINUE ELSE IF( INCX.GT.0 )THEN KX = 1 ELSE KX = 1 - ( M - 1 )*INCX END IF DO 40, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*DCONJG( Y( JY ) ) IX = KX DO 30, I = 1, M A( I, J ) = A( I, J ) + X( IX )*TEMP IX = IX + INCX 30 CONTINUE END IF JY = JY + INCY 40 CONTINUE END IF * RETURN * * End of ZGERC . * END octave-1.1.0/libcruft/blas/zgeru.f100666 415 17 10432 5310242351 15210 0ustar jweusers SUBROUTINE ZGERU ( M, N, ALPHA, X, INCX, Y, INCY, A, LDA ) * .. Scalar Arguments .. COMPLEX*16 ALPHA INTEGER INCX, INCY, LDA, M, N * .. Array Arguments .. COMPLEX*16 A( LDA, * ), X( * ), Y( * ) * .. * * Purpose * ======= * * ZGERU performs the rank 1 operation * * A := alpha*x*y' + A, * * where alpha is a scalar, x is an m element vector, y is an n element * vector and A is an m by n matrix. * * Parameters * ========== * * M - INTEGER. * On entry, M specifies the number of rows of the matrix A. * M must be at least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of the matrix A. * N must be at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * X - COMPLEX*16 array of dimension at least * ( 1 + ( m - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the m * element vector x. * Unchanged on exit. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * Y - COMPLEX*16 array of dimension at least * ( 1 + ( n - 1 )*abs( INCY ) ). * Before entry, the incremented array Y must contain the n * element vector y. * Unchanged on exit. * * INCY - INTEGER. * On entry, INCY specifies the increment for the elements of * Y. INCY must not be zero. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, n ). * Before entry, the leading m by n part of the array A must * contain the matrix of coefficients. On exit, A is * overwritten by the updated matrix. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, m ). * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. Local Scalars .. COMPLEX*16 TEMP INTEGER I, INFO, IX, J, JY, KX * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( M.LT.0 )THEN INFO = 1 ELSE IF( N.LT.0 )THEN INFO = 2 ELSE IF( INCX.EQ.0 )THEN INFO = 5 ELSE IF( INCY.EQ.0 )THEN INFO = 7 ELSE IF( LDA.LT.MAX( 1, M ) )THEN INFO = 9 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZGERU ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( M.EQ.0 ).OR.( N.EQ.0 ).OR.( ALPHA.EQ.ZERO ) ) $ RETURN * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( INCY.GT.0 )THEN JY = 1 ELSE JY = 1 - ( N - 1 )*INCY END IF IF( INCX.EQ.1 )THEN DO 20, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*Y( JY ) DO 10, I = 1, M A( I, J ) = A( I, J ) + X( I )*TEMP 10 CONTINUE END IF JY = JY + INCY 20 CONTINUE ELSE IF( INCX.GT.0 )THEN KX = 1 ELSE KX = 1 - ( M - 1 )*INCX END IF DO 40, J = 1, N IF( Y( JY ).NE.ZERO )THEN TEMP = ALPHA*Y( JY ) IX = KX DO 30, I = 1, M A( I, J ) = A( I, J ) + X( IX )*TEMP IX = IX + INCX 30 CONTINUE END IF JY = JY + INCY 40 CONTINUE END IF * RETURN * * End of ZGERU . * END octave-1.1.0/libcruft/blas/zherk.f100666 415 17 24734 5462062177 15227 0ustar jweusers SUBROUTINE ZHERK ( UPLO, TRANS, N, K, ALPHA, A, LDA, $ BETA, C, LDC ) * .. Scalar Arguments .. CHARACTER*1 UPLO, TRANS INTEGER N, K, LDA, LDC DOUBLE PRECISION ALPHA, BETA * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ) * .. * * Purpose * ======= * * ZHERK performs one of the hermitian rank k operations * * C := alpha*A*conjg( A' ) + beta*C, * * or * * C := alpha*conjg( A' )*A + beta*C, * * where alpha and beta are real scalars, C is an n by n hermitian * matrix and A is an n by k matrix in the first case and a k by n * matrix in the second case. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the upper or lower * triangular part of the array C is to be referenced as * follows: * * UPLO = 'U' or 'u' Only the upper triangular part of C * is to be referenced. * * UPLO = 'L' or 'l' Only the lower triangular part of C * is to be referenced. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' C := alpha*A*conjg( A' ) + beta*C. * * TRANS = 'C' or 'c' C := alpha*conjg( A' )*A + beta*C. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix C. N must be * at least zero. * Unchanged on exit. * * K - INTEGER. * On entry with TRANS = 'N' or 'n', K specifies the number * of columns of the matrix A, and on entry with * TRANS = 'C' or 'c', K specifies the number of rows of the * matrix A. K must be at least zero. * Unchanged on exit. * * ALPHA - DOUBLE PRECISION. * On entry, ALPHA specifies the scalar alpha. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, ka ), where ka is * k when TRANS = 'N' or 'n', and is n otherwise. * Before entry with TRANS = 'N' or 'n', the leading n by k * part of the array A must contain the matrix A, otherwise * the leading k by n part of the array A must contain the * matrix A. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When TRANS = 'N' or 'n' * then LDA must be at least max( 1, n ), otherwise LDA must * be at least max( 1, k ). * Unchanged on exit. * * BETA - DOUBLE PRECISION. * On entry, BETA specifies the scalar beta. * Unchanged on exit. * * C - COMPLEX*16 array of DIMENSION ( LDC, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array C must contain the upper * triangular part of the hermitian matrix and the strictly * lower triangular part of C is not referenced. On exit, the * upper triangular part of the array C is overwritten by the * upper triangular part of the updated matrix. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array C must contain the lower * triangular part of the hermitian matrix and the strictly * upper triangular part of C is not referenced. On exit, the * lower triangular part of the array C is overwritten by the * lower triangular part of the updated matrix. * Note that the imaginary parts of the diagonal elements need * not be set, they are assumed to be zero, and on exit they * are set to zero. * * LDC - INTEGER. * On entry, LDC specifies the first dimension of C as declared * in the calling (sub) program. LDC must be at least * max( 1, n ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCMPLX, DCONJG, MAX, DBLE * .. Local Scalars .. LOGICAL UPPER INTEGER I, INFO, J, L, NROWA DOUBLE PRECISION RTEMP COMPLEX*16 TEMP * .. Parameters .. DOUBLE PRECISION ONE , ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Executable Statements .. * * Test the input parameters. * IF( LSAME( TRANS, 'N' ) )THEN NROWA = N ELSE NROWA = K END IF UPPER = LSAME( UPLO, 'U' ) * INFO = 0 IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.LSAME( TRANS, 'N' ) ).AND. $ ( .NOT.LSAME( TRANS, 'C' ) ) )THEN INFO = 2 ELSE IF( N .LT.0 )THEN INFO = 3 ELSE IF( K .LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 7 ELSE IF( LDC.LT.MAX( 1, N ) )THEN INFO = 10 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZHERK ', INFO ) RETURN END IF * * Quick return if possible. * IF( ( N.EQ.0 ).OR. $ ( ( ( ALPHA.EQ.ZERO ).OR.( K.EQ.0 ) ).AND.( BETA.EQ.ONE ) ) ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN IF( UPPER )THEN IF( BETA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, J C( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE DO 40, J = 1, N DO 30, I = 1, J - 1 C( I, J ) = BETA*C( I, J ) 30 CONTINUE C( J, J ) = BETA*DBLE( C( J, J ) ) 40 CONTINUE END IF ELSE IF( BETA.EQ.ZERO )THEN DO 60, J = 1, N DO 50, I = J, N C( I, J ) = ZERO 50 CONTINUE 60 CONTINUE ELSE DO 80, J = 1, N C( J, J ) = BETA*DBLE( C( J, J ) ) DO 70, I = J + 1, N C( I, J ) = BETA*C( I, J ) 70 CONTINUE 80 CONTINUE END IF END IF RETURN END IF * * Start the operations. * IF( LSAME( TRANS, 'N' ) )THEN * * Form C := alpha*A*conjg( A' ) + beta*C. * IF( UPPER )THEN DO 130, J = 1, N IF( BETA.EQ.ZERO )THEN DO 90, I = 1, J C( I, J ) = ZERO 90 CONTINUE ELSE IF( BETA.NE.ONE )THEN DO 100, I = 1, J - 1 C( I, J ) = BETA*C( I, J ) 100 CONTINUE C( J, J ) = BETA*DBLE( C( J, J ) ) END IF DO 120, L = 1, K IF( A( J, L ).NE.DCMPLX( ZERO ) )THEN TEMP = ALPHA*DCONJG( A( J, L ) ) DO 110, I = 1, J - 1 C( I, J ) = C( I, J ) + TEMP*A( I, L ) 110 CONTINUE C( J, J ) = DBLE( C( J, J ) ) + $ DBLE( TEMP*A( I, L ) ) END IF 120 CONTINUE 130 CONTINUE ELSE DO 180, J = 1, N IF( BETA.EQ.ZERO )THEN DO 140, I = J, N C( I, J ) = ZERO 140 CONTINUE ELSE IF( BETA.NE.ONE )THEN C( J, J ) = BETA*DBLE( C( J, J ) ) DO 150, I = J + 1, N C( I, J ) = BETA*C( I, J ) 150 CONTINUE END IF DO 170, L = 1, K IF( A( J, L ).NE.DCMPLX( ZERO ) )THEN TEMP = ALPHA*DCONJG( A( J, L ) ) C( J, J ) = DBLE( C( J, J ) ) + $ DBLE( TEMP*A( J, L ) ) DO 160, I = J + 1, N C( I, J ) = C( I, J ) + TEMP*A( I, L ) 160 CONTINUE END IF 170 CONTINUE 180 CONTINUE END IF ELSE * * Form C := alpha*conjg( A' )*A + beta*C. * IF( UPPER )THEN DO 220, J = 1, N DO 200, I = 1, J - 1 TEMP = ZERO DO 190, L = 1, K TEMP = TEMP + DCONJG( A( L, I ) )*A( L, J ) 190 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 200 CONTINUE RTEMP = ZERO DO 210, L = 1, K RTEMP = RTEMP + DCONJG( A( L, J ) )*A( L, J ) 210 CONTINUE IF( BETA.EQ.ZERO )THEN C( J, J ) = ALPHA*RTEMP ELSE C( J, J ) = ALPHA*RTEMP + BETA*DBLE( C( J, J ) ) END IF 220 CONTINUE ELSE DO 260, J = 1, N RTEMP = ZERO DO 230, L = 1, K RTEMP = RTEMP + DCONJG( A( L, J ) )*A( L, J ) 230 CONTINUE IF( BETA.EQ.ZERO )THEN C( J, J ) = ALPHA*RTEMP ELSE C( J, J ) = ALPHA*RTEMP + BETA*DBLE( C( J, J ) ) END IF DO 250, I = J + 1, N TEMP = ZERO DO 240, L = 1, K TEMP = TEMP + DCONJG( A( L, I ) )*A( L, J ) 240 CONTINUE IF( BETA.EQ.ZERO )THEN C( I, J ) = ALPHA*TEMP ELSE C( I, J ) = ALPHA*TEMP + BETA*C( I, J ) END IF 250 CONTINUE 260 CONTINUE END IF END IF * RETURN * * End of ZHERK . * END octave-1.1.0/libcruft/blas/zscal.f100666 415 17 1142 5302540220 15143 0ustar jweusers subroutine zscal(n,za,zx,incx) c c scales a vector by a constant. c jack dongarra, 3/11/78. c modified to correct problem with negative increment, 8/21/90. c double complex za,zx(1) integer i,incx,ix,n c if(n.le.0)return if(incx.eq.1)go to 20 c c code for increment not equal to 1 c ix = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 do 10 i = 1,n zx(ix) = za*zx(ix) ix = ix + incx 10 continue return c c code for increment equal to 1 c 20 do 30 i = 1,n zx(i) = za*zx(i) 30 continue return end octave-1.1.0/libcruft/blas/zswap.f100666 415 17 1407 5302540220 15177 0ustar jweusers subroutine zswap (n,zx,incx,zy,incy) c c interchanges two vectors. c jack dongarra, 3/11/78. c double complex zx(1),zy(1),ztemp integer i,incx,incy,ix,iy,n c if(n.le.0)return if(incx.eq.1.and.incy.eq.1)go to 20 c c code for unequal increments or equal increments not equal c to 1 c ix = 1 iy = 1 if(incx.lt.0)ix = (-n+1)*incx + 1 if(incy.lt.0)iy = (-n+1)*incy + 1 do 10 i = 1,n ztemp = zx(ix) zx(ix) = zy(iy) zy(iy) = ztemp ix = ix + incx iy = iy + incy 10 continue return c c code for both increments equal to 1 20 do 30 i = 1,n ztemp = zx(i) zx(i) = zy(i) zy(i) = ztemp 30 continue return end octave-1.1.0/libcruft/blas/ztrmm.f100666 415 17 31440 5306570142 15236 0ustar jweusers SUBROUTINE ZTRMM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, $ B, LDB ) * .. Scalar Arguments .. CHARACTER*1 SIDE, UPLO, TRANSA, DIAG INTEGER M, N, LDA, LDB COMPLEX*16 ALPHA * .. Array Arguments .. COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * ZTRMM performs one of the matrix-matrix operations * * B := alpha*op( A )*B, or B := alpha*B*op( A ) * * where alpha is a scalar, B is an m by n matrix, A is a unit, or * non-unit, upper or lower triangular matrix and op( A ) is one of * * op( A ) = A or op( A ) = A' or op( A ) = conjg( A' ). * * Parameters * ========== * * SIDE - CHARACTER*1. * On entry, SIDE specifies whether op( A ) multiplies B from * the left or right as follows: * * SIDE = 'L' or 'l' B := alpha*op( A )*B. * * SIDE = 'R' or 'r' B := alpha*B*op( A ). * * Unchanged on exit. * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix A is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n' op( A ) = A. * * TRANSA = 'T' or 't' op( A ) = A'. * * TRANSA = 'C' or 'c' op( A ) = conjg( A' ). * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit triangular * as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of B. M must be at * least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of B. N must be * at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. When alpha is * zero then A is not referenced and B need not be set before * entry. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, k ), where k is m * when SIDE = 'L' or 'l' and is n when SIDE = 'R' or 'r'. * Before entry with UPLO = 'U' or 'u', the leading k by k * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading k by k * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When SIDE = 'L' or 'l' then * LDA must be at least max( 1, m ), when SIDE = 'R' or 'r' * then LDA must be at least max( 1, n ). * Unchanged on exit. * * B - COMPLEX*16 array of DIMENSION ( LDB, n ). * Before entry, the leading m by n part of the array B must * contain the matrix B, and on exit is overwritten by the * transformed matrix. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. LDB must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. Local Scalars .. LOGICAL LSIDE, NOCONJ, NOUNIT, UPPER INTEGER I, INFO, J, K, NROWA COMPLEX*16 TEMP * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. * .. Executable Statements .. * * Test the input parameters. * LSIDE = LSAME( SIDE , 'L' ) IF( LSIDE )THEN NROWA = M ELSE NROWA = N END IF NOCONJ = LSAME( TRANSA, 'T' ) NOUNIT = LSAME( DIAG , 'N' ) UPPER = LSAME( UPLO , 'U' ) * INFO = 0 IF( ( .NOT.LSIDE ).AND. $ ( .NOT.LSAME( SIDE , 'R' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 2 ELSE IF( ( .NOT.LSAME( TRANSA, 'N' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'C' ) ) )THEN INFO = 3 ELSE IF( ( .NOT.LSAME( DIAG , 'U' ) ).AND. $ ( .NOT.LSAME( DIAG , 'N' ) ) )THEN INFO = 4 ELSE IF( M .LT.0 )THEN INFO = 5 ELSE IF( N .LT.0 )THEN INFO = 6 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 9 ELSE IF( LDB.LT.MAX( 1, M ) )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZTRMM ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M B( I, J ) = ZERO 10 CONTINUE 20 CONTINUE RETURN END IF * * Start the operations. * IF( LSIDE )THEN IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*A*B. * IF( UPPER )THEN DO 50, J = 1, N DO 40, K = 1, M IF( B( K, J ).NE.ZERO )THEN TEMP = ALPHA*B( K, J ) DO 30, I = 1, K - 1 B( I, J ) = B( I, J ) + TEMP*A( I, K ) 30 CONTINUE IF( NOUNIT ) $ TEMP = TEMP*A( K, K ) B( K, J ) = TEMP END IF 40 CONTINUE 50 CONTINUE ELSE DO 80, J = 1, N DO 70 K = M, 1, -1 IF( B( K, J ).NE.ZERO )THEN TEMP = ALPHA*B( K, J ) B( K, J ) = TEMP IF( NOUNIT ) $ B( K, J ) = B( K, J )*A( K, K ) DO 60, I = K + 1, M B( I, J ) = B( I, J ) + TEMP*A( I, K ) 60 CONTINUE END IF 70 CONTINUE 80 CONTINUE END IF ELSE * * Form B := alpha*B*A' or B := alpha*B*conjg( A' ). * IF( UPPER )THEN DO 120, J = 1, N DO 110, I = M, 1, -1 TEMP = B( I, J ) IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( I, I ) DO 90, K = 1, I - 1 TEMP = TEMP + A( K, I )*B( K, J ) 90 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( I, I ) ) DO 100, K = 1, I - 1 TEMP = TEMP + DCONJG( A( K, I ) )*B( K, J ) 100 CONTINUE END IF B( I, J ) = ALPHA*TEMP 110 CONTINUE 120 CONTINUE ELSE DO 160, J = 1, N DO 150, I = 1, M TEMP = B( I, J ) IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( I, I ) DO 130, K = I + 1, M TEMP = TEMP + A( K, I )*B( K, J ) 130 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( I, I ) ) DO 140, K = I + 1, M TEMP = TEMP + DCONJG( A( K, I ) )*B( K, J ) 140 CONTINUE END IF B( I, J ) = ALPHA*TEMP 150 CONTINUE 160 CONTINUE END IF END IF ELSE IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*B*A. * IF( UPPER )THEN DO 200, J = N, 1, -1 TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 170, I = 1, M B( I, J ) = TEMP*B( I, J ) 170 CONTINUE DO 190, K = 1, J - 1 IF( A( K, J ).NE.ZERO )THEN TEMP = ALPHA*A( K, J ) DO 180, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 180 CONTINUE END IF 190 CONTINUE 200 CONTINUE ELSE DO 240, J = 1, N TEMP = ALPHA IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 210, I = 1, M B( I, J ) = TEMP*B( I, J ) 210 CONTINUE DO 230, K = J + 1, N IF( A( K, J ).NE.ZERO )THEN TEMP = ALPHA*A( K, J ) DO 220, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 220 CONTINUE END IF 230 CONTINUE 240 CONTINUE END IF ELSE * * Form B := alpha*B*A' or B := alpha*B*conjg( A' ). * IF( UPPER )THEN DO 280, K = 1, N DO 260, J = 1, K - 1 IF( A( J, K ).NE.ZERO )THEN IF( NOCONJ )THEN TEMP = ALPHA*A( J, K ) ELSE TEMP = ALPHA*DCONJG( A( J, K ) ) END IF DO 250, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 250 CONTINUE END IF 260 CONTINUE TEMP = ALPHA IF( NOUNIT )THEN IF( NOCONJ )THEN TEMP = TEMP*A( K, K ) ELSE TEMP = TEMP*DCONJG( A( K, K ) ) END IF END IF IF( TEMP.NE.ONE )THEN DO 270, I = 1, M B( I, K ) = TEMP*B( I, K ) 270 CONTINUE END IF 280 CONTINUE ELSE DO 320, K = N, 1, -1 DO 300, J = K + 1, N IF( A( J, K ).NE.ZERO )THEN IF( NOCONJ )THEN TEMP = ALPHA*A( J, K ) ELSE TEMP = ALPHA*DCONJG( A( J, K ) ) END IF DO 290, I = 1, M B( I, J ) = B( I, J ) + TEMP*B( I, K ) 290 CONTINUE END IF 300 CONTINUE TEMP = ALPHA IF( NOUNIT )THEN IF( NOCONJ )THEN TEMP = TEMP*A( K, K ) ELSE TEMP = TEMP*DCONJG( A( K, K ) ) END IF END IF IF( TEMP.NE.ONE )THEN DO 310, I = 1, M B( I, K ) = TEMP*B( I, K ) 310 CONTINUE END IF 320 CONTINUE END IF END IF END IF * RETURN * * End of ZTRMM . * END octave-1.1.0/libcruft/blas/ztrmv.f100666 415 17 24224 5302540211 15237 0ustar jweusers SUBROUTINE ZTRMV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * .. Scalar Arguments .. INTEGER INCX, LDA, N CHARACTER*1 DIAG, TRANS, UPLO * .. Array Arguments .. COMPLEX*16 A( LDA, * ), X( * ) * .. * * Purpose * ======= * * ZTRMV performs one of the matrix-vector operations * * x := A*x, or x := A'*x, or x := conjg( A' )*x, * * where x is an n element vector and A is an n by n unit, or non-unit, * upper or lower triangular matrix. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the operation to be performed as * follows: * * TRANS = 'N' or 'n' x := A*x. * * TRANS = 'T' or 't' x := A'*x. * * TRANS = 'C' or 'c' x := conjg( A' )*x. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit * triangular as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix A. * N must be at least zero. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, n ). * Unchanged on exit. * * X - COMPLEX*16 array of dimension at least * ( 1 + ( n - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the n * element vector x. On exit, X is overwritten with the * tranformed vector x. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. Local Scalars .. COMPLEX*16 TEMP INTEGER I, INFO, IX, J, JX, KX LOGICAL NOCONJ, NOUNIT * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( UPLO , 'U' ).AND. $ .NOT.LSAME( UPLO , 'L' ) )THEN INFO = 1 ELSE IF( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 2 ELSE IF( .NOT.LSAME( DIAG , 'U' ).AND. $ .NOT.LSAME( DIAG , 'N' ) )THEN INFO = 3 ELSE IF( N.LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, N ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZTRMV ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * NOCONJ = LSAME( TRANS, 'T' ) NOUNIT = LSAME( DIAG , 'N' ) * * Set up the start point in X if the increment is not unity. This * will be ( N - 1 )*INCX too small for descending loops. * IF( INCX.LE.0 )THEN KX = 1 - ( N - 1 )*INCX ELSE IF( INCX.NE.1 )THEN KX = 1 END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( LSAME( TRANS, 'N' ) )THEN * * Form x := A*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 20, J = 1, N IF( X( J ).NE.ZERO )THEN TEMP = X( J ) DO 10, I = 1, J - 1 X( I ) = X( I ) + TEMP*A( I, J ) 10 CONTINUE IF( NOUNIT ) $ X( J ) = X( J )*A( J, J ) END IF 20 CONTINUE ELSE JX = KX DO 40, J = 1, N IF( X( JX ).NE.ZERO )THEN TEMP = X( JX ) IX = KX DO 30, I = 1, J - 1 X( IX ) = X( IX ) + TEMP*A( I, J ) IX = IX + INCX 30 CONTINUE IF( NOUNIT ) $ X( JX ) = X( JX )*A( J, J ) END IF JX = JX + INCX 40 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 60, J = N, 1, -1 IF( X( J ).NE.ZERO )THEN TEMP = X( J ) DO 50, I = N, J + 1, -1 X( I ) = X( I ) + TEMP*A( I, J ) 50 CONTINUE IF( NOUNIT ) $ X( J ) = X( J )*A( J, J ) END IF 60 CONTINUE ELSE KX = KX + ( N - 1 )*INCX JX = KX DO 80, J = N, 1, -1 IF( X( JX ).NE.ZERO )THEN TEMP = X( JX ) IX = KX DO 70, I = N, J + 1, -1 X( IX ) = X( IX ) + TEMP*A( I, J ) IX = IX - INCX 70 CONTINUE IF( NOUNIT ) $ X( JX ) = X( JX )*A( J, J ) END IF JX = JX - INCX 80 CONTINUE END IF END IF ELSE * * Form x := A'*x or x := conjg( A' )*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 110, J = N, 1, -1 TEMP = X( J ) IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 90, I = J - 1, 1, -1 TEMP = TEMP + A( I, J )*X( I ) 90 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( J, J ) ) DO 100, I = J - 1, 1, -1 TEMP = TEMP + DCONJG( A( I, J ) )*X( I ) 100 CONTINUE END IF X( J ) = TEMP 110 CONTINUE ELSE JX = KX + ( N - 1 )*INCX DO 140, J = N, 1, -1 TEMP = X( JX ) IX = JX IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 120, I = J - 1, 1, -1 IX = IX - INCX TEMP = TEMP + A( I, J )*X( IX ) 120 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( J, J ) ) DO 130, I = J - 1, 1, -1 IX = IX - INCX TEMP = TEMP + DCONJG( A( I, J ) )*X( IX ) 130 CONTINUE END IF X( JX ) = TEMP JX = JX - INCX 140 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 170, J = 1, N TEMP = X( J ) IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 150, I = J + 1, N TEMP = TEMP + A( I, J )*X( I ) 150 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( J, J ) ) DO 160, I = J + 1, N TEMP = TEMP + DCONJG( A( I, J ) )*X( I ) 160 CONTINUE END IF X( J ) = TEMP 170 CONTINUE ELSE JX = KX DO 200, J = 1, N TEMP = X( JX ) IX = JX IF( NOCONJ )THEN IF( NOUNIT ) $ TEMP = TEMP*A( J, J ) DO 180, I = J + 1, N IX = IX + INCX TEMP = TEMP + A( I, J )*X( IX ) 180 CONTINUE ELSE IF( NOUNIT ) $ TEMP = TEMP*DCONJG( A( J, J ) ) DO 190, I = J + 1, N IX = IX + INCX TEMP = TEMP + DCONJG( A( I, J ) )*X( IX ) 190 CONTINUE END IF X( JX ) = TEMP JX = JX + INCX 200 CONTINUE END IF END IF END IF * RETURN * * End of ZTRMV . * END octave-1.1.0/libcruft/blas/ztrsm.f100666 415 17 33037 5310242235 15242 0ustar jweusers SUBROUTINE ZTRSM ( SIDE, UPLO, TRANSA, DIAG, M, N, ALPHA, A, LDA, $ B, LDB ) * .. Scalar Arguments .. CHARACTER*1 SIDE, UPLO, TRANSA, DIAG INTEGER M, N, LDA, LDB COMPLEX*16 ALPHA * .. Array Arguments .. COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * ZTRSM solves one of the matrix equations * * op( A )*X = alpha*B, or X*op( A ) = alpha*B, * * where alpha is a scalar, X and B are m by n matrices, A is a unit, or * non-unit, upper or lower triangular matrix and op( A ) is one of * * op( A ) = A or op( A ) = A' or op( A ) = conjg( A' ). * * The matrix X is overwritten on B. * * Parameters * ========== * * SIDE - CHARACTER*1. * On entry, SIDE specifies whether op( A ) appears on the left * or right of X as follows: * * SIDE = 'L' or 'l' op( A )*X = alpha*B. * * SIDE = 'R' or 'r' X*op( A ) = alpha*B. * * Unchanged on exit. * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix A is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANSA - CHARACTER*1. * On entry, TRANSA specifies the form of op( A ) to be used in * the matrix multiplication as follows: * * TRANSA = 'N' or 'n' op( A ) = A. * * TRANSA = 'T' or 't' op( A ) = A'. * * TRANSA = 'C' or 'c' op( A ) = conjg( A' ). * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit triangular * as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * M - INTEGER. * On entry, M specifies the number of rows of B. M must be at * least zero. * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the number of columns of B. N must be * at least zero. * Unchanged on exit. * * ALPHA - COMPLEX*16 . * On entry, ALPHA specifies the scalar alpha. When alpha is * zero then A is not referenced and B need not be set before * entry. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, k ), where k is m * when SIDE = 'L' or 'l' and is n when SIDE = 'R' or 'r'. * Before entry with UPLO = 'U' or 'u', the leading k by k * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading k by k * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. When SIDE = 'L' or 'l' then * LDA must be at least max( 1, m ), when SIDE = 'R' or 'r' * then LDA must be at least max( 1, n ). * Unchanged on exit. * * B - COMPLEX*16 array of DIMENSION ( LDB, n ). * Before entry, the leading m by n part of the array B must * contain the right-hand side matrix B, and on exit is * overwritten by the solution matrix X. * * LDB - INTEGER. * On entry, LDB specifies the first dimension of B as declared * in the calling (sub) program. LDB must be at least * max( 1, m ). * Unchanged on exit. * * * Level 3 Blas routine. * * -- Written on 8-February-1989. * Jack Dongarra, Argonne National Laboratory. * Iain Duff, AERE Harwell. * Jeremy Du Croz, Numerical Algorithms Group Ltd. * Sven Hammarling, Numerical Algorithms Group Ltd. * * * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. Local Scalars .. LOGICAL LSIDE, NOCONJ, NOUNIT, UPPER INTEGER I, INFO, J, K, NROWA COMPLEX*16 TEMP * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = ( 1.0D+0, 0.0D+0 ) ) COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. * .. Executable Statements .. * * Test the input parameters. * LSIDE = LSAME( SIDE , 'L' ) IF( LSIDE )THEN NROWA = M ELSE NROWA = N END IF NOCONJ = LSAME( TRANSA, 'T' ) NOUNIT = LSAME( DIAG , 'N' ) UPPER = LSAME( UPLO , 'U' ) * INFO = 0 IF( ( .NOT.LSIDE ).AND. $ ( .NOT.LSAME( SIDE , 'R' ) ) )THEN INFO = 1 ELSE IF( ( .NOT.UPPER ).AND. $ ( .NOT.LSAME( UPLO , 'L' ) ) )THEN INFO = 2 ELSE IF( ( .NOT.LSAME( TRANSA, 'N' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'T' ) ).AND. $ ( .NOT.LSAME( TRANSA, 'C' ) ) )THEN INFO = 3 ELSE IF( ( .NOT.LSAME( DIAG , 'U' ) ).AND. $ ( .NOT.LSAME( DIAG , 'N' ) ) )THEN INFO = 4 ELSE IF( M .LT.0 )THEN INFO = 5 ELSE IF( N .LT.0 )THEN INFO = 6 ELSE IF( LDA.LT.MAX( 1, NROWA ) )THEN INFO = 9 ELSE IF( LDB.LT.MAX( 1, M ) )THEN INFO = 11 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZTRSM ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * And when alpha.eq.zero. * IF( ALPHA.EQ.ZERO )THEN DO 20, J = 1, N DO 10, I = 1, M B( I, J ) = ZERO 10 CONTINUE 20 CONTINUE RETURN END IF * * Start the operations. * IF( LSIDE )THEN IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*inv( A )*B. * IF( UPPER )THEN DO 60, J = 1, N IF( ALPHA.NE.ONE )THEN DO 30, I = 1, M B( I, J ) = ALPHA*B( I, J ) 30 CONTINUE END IF DO 50, K = M, 1, -1 IF( B( K, J ).NE.ZERO )THEN IF( NOUNIT ) $ B( K, J ) = B( K, J )/A( K, K ) DO 40, I = 1, K - 1 B( I, J ) = B( I, J ) - B( K, J )*A( I, K ) 40 CONTINUE END IF 50 CONTINUE 60 CONTINUE ELSE DO 100, J = 1, N IF( ALPHA.NE.ONE )THEN DO 70, I = 1, M B( I, J ) = ALPHA*B( I, J ) 70 CONTINUE END IF DO 90 K = 1, M IF( B( K, J ).NE.ZERO )THEN IF( NOUNIT ) $ B( K, J ) = B( K, J )/A( K, K ) DO 80, I = K + 1, M B( I, J ) = B( I, J ) - B( K, J )*A( I, K ) 80 CONTINUE END IF 90 CONTINUE 100 CONTINUE END IF ELSE * * Form B := alpha*inv( A' )*B * or B := alpha*inv( conjg( A' ) )*B. * IF( UPPER )THEN DO 140, J = 1, N DO 130, I = 1, M TEMP = ALPHA*B( I, J ) IF( NOCONJ )THEN DO 110, K = 1, I - 1 TEMP = TEMP - A( K, I )*B( K, J ) 110 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( I, I ) ELSE DO 120, K = 1, I - 1 TEMP = TEMP - DCONJG( A( K, I ) )*B( K, J ) 120 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( I, I ) ) END IF B( I, J ) = TEMP 130 CONTINUE 140 CONTINUE ELSE DO 180, J = 1, N DO 170, I = M, 1, -1 TEMP = ALPHA*B( I, J ) IF( NOCONJ )THEN DO 150, K = I + 1, M TEMP = TEMP - A( K, I )*B( K, J ) 150 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( I, I ) ELSE DO 160, K = I + 1, M TEMP = TEMP - DCONJG( A( K, I ) )*B( K, J ) 160 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( I, I ) ) END IF B( I, J ) = TEMP 170 CONTINUE 180 CONTINUE END IF END IF ELSE IF( LSAME( TRANSA, 'N' ) )THEN * * Form B := alpha*B*inv( A ). * IF( UPPER )THEN DO 230, J = 1, N IF( ALPHA.NE.ONE )THEN DO 190, I = 1, M B( I, J ) = ALPHA*B( I, J ) 190 CONTINUE END IF DO 210, K = 1, J - 1 IF( A( K, J ).NE.ZERO )THEN DO 200, I = 1, M B( I, J ) = B( I, J ) - A( K, J )*B( I, K ) 200 CONTINUE END IF 210 CONTINUE IF( NOUNIT )THEN TEMP = ONE/A( J, J ) DO 220, I = 1, M B( I, J ) = TEMP*B( I, J ) 220 CONTINUE END IF 230 CONTINUE ELSE DO 280, J = N, 1, -1 IF( ALPHA.NE.ONE )THEN DO 240, I = 1, M B( I, J ) = ALPHA*B( I, J ) 240 CONTINUE END IF DO 260, K = J + 1, N IF( A( K, J ).NE.ZERO )THEN DO 250, I = 1, M B( I, J ) = B( I, J ) - A( K, J )*B( I, K ) 250 CONTINUE END IF 260 CONTINUE IF( NOUNIT )THEN TEMP = ONE/A( J, J ) DO 270, I = 1, M B( I, J ) = TEMP*B( I, J ) 270 CONTINUE END IF 280 CONTINUE END IF ELSE * * Form B := alpha*B*inv( A' ) * or B := alpha*B*inv( conjg( A' ) ). * IF( UPPER )THEN DO 330, K = N, 1, -1 IF( NOUNIT )THEN IF( NOCONJ )THEN TEMP = ONE/A( K, K ) ELSE TEMP = ONE/DCONJG( A( K, K ) ) END IF DO 290, I = 1, M B( I, K ) = TEMP*B( I, K ) 290 CONTINUE END IF DO 310, J = 1, K - 1 IF( A( J, K ).NE.ZERO )THEN IF( NOCONJ )THEN TEMP = A( J, K ) ELSE TEMP = DCONJG( A( J, K ) ) END IF DO 300, I = 1, M B( I, J ) = B( I, J ) - TEMP*B( I, K ) 300 CONTINUE END IF 310 CONTINUE IF( ALPHA.NE.ONE )THEN DO 320, I = 1, M B( I, K ) = ALPHA*B( I, K ) 320 CONTINUE END IF 330 CONTINUE ELSE DO 380, K = 1, N IF( NOUNIT )THEN IF( NOCONJ )THEN TEMP = ONE/A( K, K ) ELSE TEMP = ONE/DCONJG( A( K, K ) ) END IF DO 340, I = 1, M B( I, K ) = TEMP*B( I, K ) 340 CONTINUE END IF DO 360, J = K + 1, N IF( A( J, K ).NE.ZERO )THEN IF( NOCONJ )THEN TEMP = A( J, K ) ELSE TEMP = DCONJG( A( J, K ) ) END IF DO 350, I = 1, M B( I, J ) = B( I, J ) - TEMP*B( I, K ) 350 CONTINUE END IF 360 CONTINUE IF( ALPHA.NE.ONE )THEN DO 370, I = 1, M B( I, K ) = ALPHA*B( I, K ) 370 CONTINUE END IF 380 CONTINUE END IF END IF END IF * RETURN * * End of ZTRSM . * END octave-1.1.0/libcruft/blas/ztrsv.f100666 415 17 24467 5302540212 15257 0ustar jweusers SUBROUTINE ZTRSV ( UPLO, TRANS, DIAG, N, A, LDA, X, INCX ) * .. Scalar Arguments .. INTEGER INCX, LDA, N CHARACTER*1 DIAG, TRANS, UPLO * .. Array Arguments .. COMPLEX*16 A( LDA, * ), X( * ) * .. * * Purpose * ======= * * ZTRSV solves one of the systems of equations * * A*x = b, or A'*x = b, or conjg( A' )*x = b, * * where b and x are n element vectors and A is an n by n unit, or * non-unit, upper or lower triangular matrix. * * No test for singularity or near-singularity is included in this * routine. Such tests must be performed before calling this routine. * * Parameters * ========== * * UPLO - CHARACTER*1. * On entry, UPLO specifies whether the matrix is an upper or * lower triangular matrix as follows: * * UPLO = 'U' or 'u' A is an upper triangular matrix. * * UPLO = 'L' or 'l' A is a lower triangular matrix. * * Unchanged on exit. * * TRANS - CHARACTER*1. * On entry, TRANS specifies the equations to be solved as * follows: * * TRANS = 'N' or 'n' A*x = b. * * TRANS = 'T' or 't' A'*x = b. * * TRANS = 'C' or 'c' conjg( A' )*x = b. * * Unchanged on exit. * * DIAG - CHARACTER*1. * On entry, DIAG specifies whether or not A is unit * triangular as follows: * * DIAG = 'U' or 'u' A is assumed to be unit triangular. * * DIAG = 'N' or 'n' A is not assumed to be unit * triangular. * * Unchanged on exit. * * N - INTEGER. * On entry, N specifies the order of the matrix A. * N must be at least zero. * Unchanged on exit. * * A - COMPLEX*16 array of DIMENSION ( LDA, n ). * Before entry with UPLO = 'U' or 'u', the leading n by n * upper triangular part of the array A must contain the upper * triangular matrix and the strictly lower triangular part of * A is not referenced. * Before entry with UPLO = 'L' or 'l', the leading n by n * lower triangular part of the array A must contain the lower * triangular matrix and the strictly upper triangular part of * A is not referenced. * Note that when DIAG = 'U' or 'u', the diagonal elements of * A are not referenced either, but are assumed to be unity. * Unchanged on exit. * * LDA - INTEGER. * On entry, LDA specifies the first dimension of A as declared * in the calling (sub) program. LDA must be at least * max( 1, n ). * Unchanged on exit. * * X - COMPLEX*16 array of dimension at least * ( 1 + ( n - 1 )*abs( INCX ) ). * Before entry, the incremented array X must contain the n * element right-hand side vector b. On exit, X is overwritten * with the solution vector x. * * INCX - INTEGER. * On entry, INCX specifies the increment for the elements of * X. INCX must not be zero. * Unchanged on exit. * * * Level 2 Blas routine. * * -- Written on 22-October-1986. * Jack Dongarra, Argonne National Lab. * Jeremy Du Croz, Nag Central Office. * Sven Hammarling, Nag Central Office. * Richard Hanson, Sandia National Labs. * * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = ( 0.0D+0, 0.0D+0 ) ) * .. Local Scalars .. COMPLEX*16 TEMP INTEGER I, INFO, IX, J, JX, KX LOGICAL NOCONJ, NOUNIT * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. External Subroutines .. EXTERNAL XERBLA * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF ( .NOT.LSAME( UPLO , 'U' ).AND. $ .NOT.LSAME( UPLO , 'L' ) )THEN INFO = 1 ELSE IF( .NOT.LSAME( TRANS, 'N' ).AND. $ .NOT.LSAME( TRANS, 'T' ).AND. $ .NOT.LSAME( TRANS, 'C' ) )THEN INFO = 2 ELSE IF( .NOT.LSAME( DIAG , 'U' ).AND. $ .NOT.LSAME( DIAG , 'N' ) )THEN INFO = 3 ELSE IF( N.LT.0 )THEN INFO = 4 ELSE IF( LDA.LT.MAX( 1, N ) )THEN INFO = 6 ELSE IF( INCX.EQ.0 )THEN INFO = 8 END IF IF( INFO.NE.0 )THEN CALL XERBLA( 'ZTRSV ', INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * NOCONJ = LSAME( TRANS, 'T' ) NOUNIT = LSAME( DIAG , 'N' ) * * Set up the start point in X if the increment is not unity. This * will be ( N - 1 )*INCX too small for descending loops. * IF( INCX.LE.0 )THEN KX = 1 - ( N - 1 )*INCX ELSE IF( INCX.NE.1 )THEN KX = 1 END IF * * Start the operations. In this version the elements of A are * accessed sequentially with one pass through A. * IF( LSAME( TRANS, 'N' ) )THEN * * Form x := inv( A )*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 20, J = N, 1, -1 IF( X( J ).NE.ZERO )THEN IF( NOUNIT ) $ X( J ) = X( J )/A( J, J ) TEMP = X( J ) DO 10, I = J - 1, 1, -1 X( I ) = X( I ) - TEMP*A( I, J ) 10 CONTINUE END IF 20 CONTINUE ELSE JX = KX + ( N - 1 )*INCX DO 40, J = N, 1, -1 IF( X( JX ).NE.ZERO )THEN IF( NOUNIT ) $ X( JX ) = X( JX )/A( J, J ) TEMP = X( JX ) IX = JX DO 30, I = J - 1, 1, -1 IX = IX - INCX X( IX ) = X( IX ) - TEMP*A( I, J ) 30 CONTINUE END IF JX = JX - INCX 40 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 60, J = 1, N IF( X( J ).NE.ZERO )THEN IF( NOUNIT ) $ X( J ) = X( J )/A( J, J ) TEMP = X( J ) DO 50, I = J + 1, N X( I ) = X( I ) - TEMP*A( I, J ) 50 CONTINUE END IF 60 CONTINUE ELSE JX = KX DO 80, J = 1, N IF( X( JX ).NE.ZERO )THEN IF( NOUNIT ) $ X( JX ) = X( JX )/A( J, J ) TEMP = X( JX ) IX = JX DO 70, I = J + 1, N IX = IX + INCX X( IX ) = X( IX ) - TEMP*A( I, J ) 70 CONTINUE END IF JX = JX + INCX 80 CONTINUE END IF END IF ELSE * * Form x := inv( A' )*x or x := inv( conjg( A' ) )*x. * IF( LSAME( UPLO, 'U' ) )THEN IF( INCX.EQ.1 )THEN DO 110, J = 1, N TEMP = X( J ) IF( NOCONJ )THEN DO 90, I = 1, J - 1 TEMP = TEMP - A( I, J )*X( I ) 90 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) ELSE DO 100, I = 1, J - 1 TEMP = TEMP - DCONJG( A( I, J ) )*X( I ) 100 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( J, J ) ) END IF X( J ) = TEMP 110 CONTINUE ELSE JX = KX DO 140, J = 1, N IX = KX TEMP = X( JX ) IF( NOCONJ )THEN DO 120, I = 1, J - 1 TEMP = TEMP - A( I, J )*X( IX ) IX = IX + INCX 120 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) ELSE DO 130, I = 1, J - 1 TEMP = TEMP - DCONJG( A( I, J ) )*X( IX ) IX = IX + INCX 130 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( J, J ) ) END IF X( JX ) = TEMP JX = JX + INCX 140 CONTINUE END IF ELSE IF( INCX.EQ.1 )THEN DO 170, J = N, 1, -1 TEMP = X( J ) IF( NOCONJ )THEN DO 150, I = N, J + 1, -1 TEMP = TEMP - A( I, J )*X( I ) 150 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) ELSE DO 160, I = N, J + 1, -1 TEMP = TEMP - DCONJG( A( I, J ) )*X( I ) 160 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( J, J ) ) END IF X( J ) = TEMP 170 CONTINUE ELSE KX = KX + ( N - 1 )*INCX JX = KX DO 200, J = N, 1, -1 IX = KX TEMP = X( JX ) IF( NOCONJ )THEN DO 180, I = N, J + 1, -1 TEMP = TEMP - A( I, J )*X( IX ) IX = IX - INCX 180 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/A( J, J ) ELSE DO 190, I = N, J + 1, -1 TEMP = TEMP - DCONJG( A( I, J ) )*X( IX ) IX = IX - INCX 190 CONTINUE IF( NOUNIT ) $ TEMP = TEMP/DCONJG( A( J, J ) ) END IF X( JX ) = TEMP JX = JX - INCX 200 CONTINUE END IF END IF END IF * RETURN * * End of ZTRSV . * END octave-1.1.0/libcruft/dassl/ 40777 415 17 0 5705521623 13767 5ustar jweusersoctave-1.1.0/libcruft/dassl/Makefile.in100666 415 17 506 5662226311 16110 0ustar jweusers# # Makefile for octave's libcruft/dassl directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/dassl/ddaini.f100666 415 17 15475 5150640254 15513 0ustar jweusers SUBROUTINE DDAINI (X, Y, YPRIME, NEQ, RES, JAC, H, WT, IDID, RPAR, + IPAR, PHI, DELTA, E, WM, IWM, HMIN, UROUND, NONNEG, NTEMP) C***BEGIN PROLOGUE DDAINI C***SUBSIDIARY C***PURPOSE Initialization routine for DDASSL. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDAINI-S, DDAINI-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------- C DDAINI TAKES ONE STEP OF SIZE H OR SMALLER C WITH THE BACKWARD EULER METHOD, TO C FIND YPRIME. X AND Y ARE UPDATED TO BE CONSISTENT WITH THE C NEW STEP. A MODIFIED DAMPED NEWTON ITERATION IS USED TO C SOLVE THE CORRECTOR ITERATION. C C THE INITIAL GUESS FOR YPRIME IS USED IN THE C PREDICTION, AND IN FORMING THE ITERATION C MATRIX, BUT IS NOT INVOLVED IN THE C ERROR TEST. THIS MAY HAVE TROUBLE C CONVERGING IF THE INITIAL GUESS IS NO C GOOD, OR IF G(X,Y,YPRIME) DEPENDS C NONLINEARLY ON YPRIME. C C THE PARAMETERS REPRESENT: C X -- INDEPENDENT VARIABLE C Y -- SOLUTION VECTOR AT X C YPRIME -- DERIVATIVE OF SOLUTION VECTOR C NEQ -- NUMBER OF EQUATIONS C H -- STEPSIZE. IMDER MAY USE A STEPSIZE C SMALLER THAN H. C WT -- VECTOR OF WEIGHTS FOR ERROR C CRITERION C IDID -- COMPLETION CODE WITH THE FOLLOWING MEANINGS C IDID= 1 -- YPRIME WAS FOUND SUCCESSFULLY C IDID=-12 -- DDAINI FAILED TO FIND YPRIME C RPAR,IPAR -- REAL AND INTEGER PARAMETER ARRAYS C THAT ARE NOT ALTERED BY DDAINI C PHI -- WORK SPACE FOR DDAINI C DELTA,E -- WORK SPACE FOR DDAINI C WM,IWM -- REAL AND INTEGER ARRAYS STORING C MATRIX INFORMATION C C----------------------------------------------------------------- C***ROUTINES CALLED DDAJAC, DDANRM, DDASLV C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C 901030 Minor corrections to declarations. (FNF) C***END PROLOGUE DDAINI C INTEGER NEQ, IDID, IPAR(*), IWM(*), NONNEG, NTEMP DOUBLE PRECISION * X, Y(*), YPRIME(*), H, WT(*), RPAR(*), PHI(NEQ,*), DELTA(*), * E(*), WM(*), HMIN, UROUND EXTERNAL RES, JAC C EXTERNAL DDAJAC, DDANRM, DDASLV DOUBLE PRECISION DDANRM C INTEGER I, IER, IRES, JCALC, LNJE, LNRE, M, MAXIT, MJAC, NCF, * NEF, NSF DOUBLE PRECISION * CJ, DAMP, DELNRM, ERR, OLDNRM, R, RATE, S, XOLD, YNORM LOGICAL CONVGD C PARAMETER (LNRE=12) PARAMETER (LNJE=13) C DATA MAXIT/10/,MJAC/5/ DATA DAMP/0.75D0/ C C C--------------------------------------------------- C BLOCK 1. C INITIALIZATIONS. C--------------------------------------------------- C C***FIRST EXECUTABLE STATEMENT DDAINI IDID=1 NEF=0 NCF=0 NSF=0 XOLD=X YNORM=DDANRM(NEQ,Y,WT,RPAR,IPAR) C C SAVE Y AND YPRIME IN PHI DO 100 I=1,NEQ PHI(I,1)=Y(I) 100 PHI(I,2)=YPRIME(I) C C C---------------------------------------------------- C BLOCK 2. C DO ONE BACKWARD EULER STEP. C---------------------------------------------------- C C SET UP FOR START OF CORRECTOR ITERATION 200 CJ=1.0D0/H X=X+H C C PREDICT SOLUTION AND DERIVATIVE DO 250 I=1,NEQ 250 Y(I)=Y(I)+H*YPRIME(I) C JCALC=-1 M=0 CONVGD=.TRUE. C C C CORRECTOR LOOP. 300 IWM(LNRE)=IWM(LNRE)+1 IRES=0 C CALL RES(X,Y,YPRIME,DELTA,IRES,RPAR,IPAR) IF (IRES.LT.0) GO TO 430 C C C EVALUATE THE ITERATION MATRIX IF (JCALC.NE.-1) GO TO 310 IWM(LNJE)=IWM(LNJE)+1 JCALC=0 CALL DDAJAC(NEQ,X,Y,YPRIME,DELTA,CJ,H, * IER,WT,E,WM,IWM,RES,IRES, * UROUND,JAC,RPAR,IPAR,NTEMP) C S=1000000.D0 IF (IRES.LT.0) GO TO 430 IF (IER.NE.0) GO TO 430 NSF=0 C C C C MULTIPLY RESIDUAL BY DAMPING FACTOR 310 CONTINUE DO 320 I=1,NEQ 320 DELTA(I)=DELTA(I)*DAMP C C COMPUTE A NEW ITERATE (BACK SUBSTITUTION) C STORE THE CORRECTION IN DELTA C CALL DDASLV(NEQ,DELTA,WM,IWM) C C UPDATE Y AND YPRIME DO 330 I=1,NEQ Y(I)=Y(I)-DELTA(I) 330 YPRIME(I)=YPRIME(I)-CJ*DELTA(I) C C TEST FOR CONVERGENCE OF THE ITERATION. C DELNRM=DDANRM(NEQ,DELTA,WT,RPAR,IPAR) IF (DELNRM.LE.100.D0*UROUND*YNORM) * GO TO 400 C IF (M.GT.0) GO TO 340 OLDNRM=DELNRM GO TO 350 C 340 RATE=(DELNRM/OLDNRM)**(1.0D0/M) IF (RATE.GT.0.90D0) GO TO 430 S=RATE/(1.0D0-RATE) C 350 IF (S*DELNRM .LE. 0.33D0) GO TO 400 C C C THE CORRECTOR HAS NOT YET CONVERGED. UPDATE C M AND AND TEST WHETHER THE MAXIMUM C NUMBER OF ITERATIONS HAVE BEEN TRIED. C EVERY MJAC ITERATIONS, GET A NEW C ITERATION MATRIX. C M=M+1 IF (M.GE.MAXIT) GO TO 430 C IF ((M/MJAC)*MJAC.EQ.M) JCALC=-1 GO TO 300 C C C THE ITERATION HAS CONVERGED. C CHECK NONNEGATIVITY CONSTRAINTS 400 IF (NONNEG.EQ.0) GO TO 450 DO 410 I=1,NEQ 410 DELTA(I)=MIN(Y(I),0.0D0) C DELNRM=DDANRM(NEQ,DELTA,WT,RPAR,IPAR) IF (DELNRM.GT.0.33D0) GO TO 430 C DO 420 I=1,NEQ Y(I)=Y(I)-DELTA(I) 420 YPRIME(I)=YPRIME(I)-CJ*DELTA(I) GO TO 450 C C C EXITS FROM CORRECTOR LOOP. 430 CONVGD=.FALSE. 450 IF (.NOT.CONVGD) GO TO 600 C C C C----------------------------------------------------- C BLOCK 3. C THE CORRECTOR ITERATION CONVERGED. C DO ERROR TEST. C----------------------------------------------------- C DO 510 I=1,NEQ 510 E(I)=Y(I)-PHI(I,1) ERR=DDANRM(NEQ,E,WT,RPAR,IPAR) C IF (ERR.LE.1.0D0) RETURN C C C C-------------------------------------------------------- C BLOCK 4. C THE BACKWARD EULER STEP FAILED. RESTORE X, Y C AND YPRIME TO THEIR ORIGINAL VALUES. C REDUCE STEPSIZE AND TRY AGAIN, IF C POSSIBLE. C--------------------------------------------------------- C 600 CONTINUE X = XOLD DO 610 I=1,NEQ Y(I)=PHI(I,1) 610 YPRIME(I)=PHI(I,2) C IF (CONVGD) GO TO 640 IF (IER.EQ.0) GO TO 620 NSF=NSF+1 H=H*0.25D0 IF (NSF.LT.3.AND.ABS(H).GE.HMIN) GO TO 690 IDID=-12 RETURN 620 IF (IRES.GT.-2) GO TO 630 IDID=-12 RETURN 630 NCF=NCF+1 H=H*0.25D0 IF (NCF.LT.10.AND.ABS(H).GE.HMIN) GO TO 690 IDID=-12 RETURN C 640 NEF=NEF+1 R=0.90D0/(2.0D0*ERR+0.0001D0) R=MAX(0.1D0,MIN(0.5D0,R)) H=H*R IF (ABS(H).GE.HMIN.AND.NEF.LT.10) GO TO 690 IDID=-12 RETURN 690 GO TO 200 C C-------------END OF SUBROUTINE DDAINI---------------------- END octave-1.1.0/libcruft/dassl/ddajac.f100666 415 17 13552 5150640254 15463 0ustar jweusers SUBROUTINE DDAJAC (NEQ, X, Y, YPRIME, DELTA, CJ, H, + IER, WT, E, WM, IWM, RES, IRES, UROUND, JAC, RPAR, + IPAR, NTEMP) C***BEGIN PROLOGUE DDAJAC C***SUBSIDIARY C***PURPOSE Compute the iteration matrix for DDASSL and form the C LU-decomposition. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDAJAC-S, DDAJAC-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C THIS ROUTINE COMPUTES THE ITERATION MATRIX C PD=DG/DY+CJ*DG/DYPRIME (WHERE G(X,Y,YPRIME)=0). C HERE PD IS COMPUTED BY THE USER-SUPPLIED C ROUTINE JAC IF IWM(MTYPE) IS 1 OR 4, AND C IT IS COMPUTED BY NUMERICAL FINITE DIFFERENCING C IF IWM(MTYPE)IS 2 OR 5 C THE PARAMETERS HAVE THE FOLLOWING MEANINGS. C Y = ARRAY CONTAINING PREDICTED VALUES C YPRIME = ARRAY CONTAINING PREDICTED DERIVATIVES C DELTA = RESIDUAL EVALUATED AT (X,Y,YPRIME) C (USED ONLY IF IWM(MTYPE)=2 OR 5) C CJ = SCALAR PARAMETER DEFINING ITERATION MATRIX C H = CURRENT STEPSIZE IN INTEGRATION C IER = VARIABLE WHICH IS .NE. 0 C IF ITERATION MATRIX IS SINGULAR, C AND 0 OTHERWISE. C WT = VECTOR OF WEIGHTS FOR COMPUTING NORMS C E = WORK SPACE (TEMPORARY) OF LENGTH NEQ C WM = REAL WORK SPACE FOR MATRICES. ON C OUTPUT IT CONTAINS THE LU DECOMPOSITION C OF THE ITERATION MATRIX. C IWM = INTEGER WORK SPACE CONTAINING C MATRIX INFORMATION C RES = NAME OF THE EXTERNAL USER-SUPPLIED ROUTINE C TO EVALUATE THE RESIDUAL FUNCTION G(X,Y,YPRIME) C IRES = FLAG WHICH IS EQUAL TO ZERO IF NO ILLEGAL VALUES C IN RES, AND LESS THAN ZERO OTHERWISE. (IF IRES C IS LESS THAN ZERO, THE MATRIX WAS NOT COMPLETED) C IN THIS CASE (IF IRES .LT. 0), THEN IER = 0. C UROUND = THE UNIT ROUNDOFF ERROR OF THE MACHINE BEING USED. C JAC = NAME OF THE EXTERNAL USER-SUPPLIED ROUTINE C TO EVALUATE THE ITERATION MATRIX (THIS ROUTINE C IS ONLY USED IF IWM(MTYPE) IS 1 OR 4) C----------------------------------------------------------------------- C***ROUTINES CALLED DGBFA, DGEFA C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901010 Modified three MAX calls to be all on one line. (FNF) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C 901101 Corrected PURPOSE. (FNF) C***END PROLOGUE DDAJAC C INTEGER NEQ, IER, IWM(*), IRES, IPAR(*), NTEMP DOUBLE PRECISION * X, Y(*), YPRIME(*), DELTA(*), CJ, H, WT(*), E(*), WM(*), * UROUND, RPAR(*) EXTERNAL RES, JAC C EXTERNAL DGBFA, DGEFA C INTEGER I, I1, I2, II, IPSAVE, ISAVE, J, K, L, LENPD, LIPVT, * LML, LMTYPE, LMU, MBA, MBAND, MEB1, MEBAND, MSAVE, MTYPE, N, * NPD, NPDM1, NROW DOUBLE PRECISION DEL, DELINV, SQUR, YPSAVE, YSAVE C PARAMETER (NPD=1) PARAMETER (LML=1) PARAMETER (LMU=2) PARAMETER (LMTYPE=4) PARAMETER (LIPVT=21) C C***FIRST EXECUTABLE STATEMENT DDAJAC IER = 0 NPDM1=NPD-1 MTYPE=IWM(LMTYPE) GO TO (100,200,300,400,500),MTYPE C C C DENSE USER-SUPPLIED MATRIX 100 LENPD=NEQ*NEQ DO 110 I=1,LENPD 110 WM(NPDM1+I)=0.0D0 CALL JAC(X,Y,YPRIME,WM(NPD),CJ,RPAR,IPAR) GO TO 230 C C C DENSE FINITE-DIFFERENCE-GENERATED MATRIX 200 IRES=0 NROW=NPDM1 SQUR = SQRT(UROUND) DO 210 I=1,NEQ DEL=SQUR*MAX(ABS(Y(I)),ABS(H*YPRIME(I)),ABS(WT(I))) DEL=SIGN(DEL,H*YPRIME(I)) DEL=(Y(I)+DEL)-Y(I) YSAVE=Y(I) YPSAVE=YPRIME(I) Y(I)=Y(I)+DEL YPRIME(I)=YPRIME(I)+CJ*DEL CALL RES(X,Y,YPRIME,E,IRES,RPAR,IPAR) IF (IRES .LT. 0) RETURN DELINV=1.0D0/DEL DO 220 L=1,NEQ 220 WM(NROW+L)=(E(L)-DELTA(L))*DELINV NROW=NROW+NEQ Y(I)=YSAVE YPRIME(I)=YPSAVE 210 CONTINUE C C C DO DENSE-MATRIX LU DECOMPOSITION ON PD 230 CALL DGEFA(WM(NPD),NEQ,NEQ,IWM(LIPVT),IER) RETURN C C C DUMMY SECTION FOR IWM(MTYPE)=3 300 RETURN C C C BANDED USER-SUPPLIED MATRIX 400 LENPD=(2*IWM(LML)+IWM(LMU)+1)*NEQ DO 410 I=1,LENPD 410 WM(NPDM1+I)=0.0D0 CALL JAC(X,Y,YPRIME,WM(NPD),CJ,RPAR,IPAR) MEBAND=2*IWM(LML)+IWM(LMU)+1 GO TO 550 C C C BANDED FINITE-DIFFERENCE-GENERATED MATRIX 500 MBAND=IWM(LML)+IWM(LMU)+1 MBA=MIN(MBAND,NEQ) MEBAND=MBAND+IWM(LML) MEB1=MEBAND-1 MSAVE=(NEQ/MBAND)+1 ISAVE=NTEMP-1 IPSAVE=ISAVE+MSAVE IRES=0 SQUR=SQRT(UROUND) DO 540 J=1,MBA DO 510 N=J,NEQ,MBAND K= (N-J)/MBAND + 1 WM(ISAVE+K)=Y(N) WM(IPSAVE+K)=YPRIME(N) DEL=SQUR*MAX(ABS(Y(N)),ABS(H*YPRIME(N)),ABS(WT(N))) DEL=SIGN(DEL,H*YPRIME(N)) DEL=(Y(N)+DEL)-Y(N) Y(N)=Y(N)+DEL 510 YPRIME(N)=YPRIME(N)+CJ*DEL CALL RES(X,Y,YPRIME,E,IRES,RPAR,IPAR) IF (IRES .LT. 0) RETURN DO 530 N=J,NEQ,MBAND K= (N-J)/MBAND + 1 Y(N)=WM(ISAVE+K) YPRIME(N)=WM(IPSAVE+K) DEL=SQUR*MAX(ABS(Y(N)),ABS(H*YPRIME(N)),ABS(WT(N))) DEL=SIGN(DEL,H*YPRIME(N)) DEL=(Y(N)+DEL)-Y(N) DELINV=1.0D0/DEL I1=MAX(1,(N-IWM(LMU))) I2=MIN(NEQ,(N+IWM(LML))) II=N*MEB1-IWM(LML)+NPDM1 DO 520 I=I1,I2 520 WM(II+I)=(E(I)-DELTA(I))*DELINV 530 CONTINUE 540 CONTINUE C C C DO LU DECOMPOSITION OF BANDED PD 550 CALL DGBFA(WM(NPD),MEBAND,NEQ, * IWM(LML),IWM(LMU),IWM(LIPVT),IER) RETURN C------END OF SUBROUTINE DDAJAC------ END octave-1.1.0/libcruft/dassl/ddanrm.f100666 415 17 3053 5150640254 15475 0ustar jweusers DOUBLE PRECISION FUNCTION DDANRM (NEQ, V, WT, RPAR, IPAR) C***BEGIN PROLOGUE DDANRM C***SUBSIDIARY C***PURPOSE Compute vector norm for DDASSL. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDANRM-S, DDANRM-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C THIS FUNCTION ROUTINE COMPUTES THE WEIGHTED C ROOT-MEAN-SQUARE NORM OF THE VECTOR OF LENGTH C NEQ CONTAINED IN THE ARRAY V,WITH WEIGHTS C CONTAINED IN THE ARRAY WT OF LENGTH NEQ. C DDANRM=SQRT((1/NEQ)*SUM(V(I)/WT(I))**2) C----------------------------------------------------------------------- C***ROUTINES CALLED (NONE) C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C***END PROLOGUE DDANRM C INTEGER NEQ, IPAR(*) DOUBLE PRECISION V(NEQ), WT(NEQ), RPAR(*) C INTEGER I DOUBLE PRECISION SUM, VMAX C C***FIRST EXECUTABLE STATEMENT DDANRM DDANRM = 0.0D0 VMAX = 0.0D0 DO 10 I = 1,NEQ IF(ABS(V(I)/WT(I)) .GT. VMAX) VMAX = ABS(V(I)/WT(I)) 10 CONTINUE IF(VMAX .LE. 0.0D0) GO TO 30 SUM = 0.0D0 DO 20 I = 1,NEQ 20 SUM = SUM + ((V(I)/WT(I))/VMAX)**2 DDANRM = VMAX*SQRT(SUM/NEQ) 30 CONTINUE RETURN C------END OF FUNCTION DDANRM------ END octave-1.1.0/libcruft/dassl/ddaslv.f100666 415 17 3606 5150640254 15511 0ustar jweusers SUBROUTINE DDASLV (NEQ, DELTA, WM, IWM) C***BEGIN PROLOGUE DDASLV C***SUBSIDIARY C***PURPOSE Linear system solver for DDASSL. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDASLV-S, DDASLV-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C THIS ROUTINE MANAGES THE SOLUTION OF THE LINEAR C SYSTEM ARISING IN THE NEWTON ITERATION. C MATRICES AND REAL TEMPORARY STORAGE AND C REAL INFORMATION ARE STORED IN THE ARRAY WM. C INTEGER MATRIX INFORMATION IS STORED IN C THE ARRAY IWM. C FOR A DENSE MATRIX, THE LINPACK ROUTINE C DGESL IS CALLED. C FOR A BANDED MATRIX,THE LINPACK ROUTINE C DGBSL IS CALLED. C----------------------------------------------------------------------- C***ROUTINES CALLED DGBSL, DGESL C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C***END PROLOGUE DDASLV C INTEGER NEQ, IWM(*) DOUBLE PRECISION DELTA(*), WM(*) C EXTERNAL DGBSL, DGESL C INTEGER LIPVT, LML, LMU, LMTYPE, MEBAND, MTYPE, NPD PARAMETER (NPD=1) PARAMETER (LML=1) PARAMETER (LMU=2) PARAMETER (LMTYPE=4) PARAMETER (LIPVT=21) C C***FIRST EXECUTABLE STATEMENT DDASLV MTYPE=IWM(LMTYPE) GO TO(100,100,300,400,400),MTYPE C C DENSE MATRIX 100 CALL DGESL(WM(NPD),NEQ,NEQ,IWM(LIPVT),DELTA,0) RETURN C C DUMMY SECTION FOR MTYPE=3 300 CONTINUE RETURN C C BANDED MATRIX 400 MEBAND=2*IWM(LML)+IWM(LMU)+1 CALL DGBSL(WM(NPD),MEBAND,NEQ,IWM(LML), * IWM(LMU),IWM(LIPVT),DELTA,0) RETURN C------END OF SUBROUTINE DDASLV------ END octave-1.1.0/libcruft/dassl/ddassl.f100666 415 17 177555 5150640255 15566 0ustar jweusers SUBROUTINE DDASSL (RES, NEQ, T, Y, YPRIME, TOUT, INFO, RTOL, ATOL, + IDID, RWORK, LRW, IWORK, LIW, RPAR, IPAR, JAC) C***BEGIN PROLOGUE DDASSL C***PURPOSE This code solves a system of differential/algebraic C equations of the form G(T,Y,YPRIME) = 0. C***LIBRARY SLATEC (DASSL) C***CATEGORY I1A2 C***TYPE DOUBLE PRECISION (SDASSL-S, DDASSL-D) C***KEYWORDS DIFFERENTIAL/ALGEBRAIC, BACKWARD DIFFERENTIATION FORMULAS, C IMPLICIT DIFFERENTIAL SYSTEMS C***AUTHOR PETZOLD, LINDA R., (LLNL) C COMPUTING AND MATHEMATICS RESEARCH DIVISION C LAWRENCE LIVERMORE NATIONAL LABORATORY C L - 316, P.O. BOX 808, C LIVERMORE, CA. 94550 C***DESCRIPTION C C *Usage: C C EXTERNAL RES, JAC C INTEGER NEQ, INFO(N), IDID, LRW, LIW, IWORK(LIW), IPAR C DOUBLE PRECISION T, Y(NEQ), YPRIME(NEQ), TOUT, RTOL, ATOL, C * RWORK(LRW), RPAR C C CALL DDASSL (RES, NEQ, T, Y, YPRIME, TOUT, INFO, RTOL, ATOL, C * IDID, RWORK, LRW, IWORK, LIW, RPAR, IPAR, JAC) C C C *Arguments: C (In the following, all real arrays should be type DOUBLE PRECISION.) C C RES:EXT This is a subroutine which you provide to define the C differential/algebraic system. C C NEQ:IN This is the number of equations to be solved. C C T:INOUT This is the current value of the independent variable. C C Y(*):INOUT This array contains the solution components at T. C C YPRIME(*):INOUT This array contains the derivatives of the solution C components at T. C C TOUT:IN This is a point at which a solution is desired. C C INFO(N):IN The basic task of the code is to solve the system from T C to TOUT and return an answer at TOUT. INFO is an integer C array which is used to communicate exactly how you want C this task to be carried out. (See below for details.) C N must be greater than or equal to 15. C C RTOL,ATOL:INOUT These quantities represent relative and absolute C error tolerances which you provide to indicate how C accurately you wish the solution to be computed. You C may choose them to be both scalars or else both vectors. C Caution: In Fortran 77, a scalar is not the same as an C array of length 1. Some compilers may object C to using scalars for RTOL,ATOL. C C IDID:OUT This scalar quantity is an indicator reporting what the C code did. You must monitor this integer variable to C decide what action to take next. C C RWORK:WORK A real work array of length LRW which provides the C code with needed storage space. C C LRW:IN The length of RWORK. (See below for required length.) C C IWORK:WORK An integer work array of length LIW which probides the C code with needed storage space. C C LIW:IN The length of IWORK. (See below for required length.) C C RPAR,IPAR:IN These are real and integer parameter arrays which C you can use for communication between your calling C program and the RES subroutine (and the JAC subroutine) C C JAC:EXT This is the name of a subroutine which you may choose C to provide for defining a matrix of partial derivatives C described below. C C Quantities which may be altered by DDASSL are: C T, Y(*), YPRIME(*), INFO(1), RTOL, ATOL, C IDID, RWORK(*) AND IWORK(*) C C *Description C C Subroutine DDASSL uses the backward differentiation formulas of C orders one through five to solve a system of the above form for Y and C YPRIME. Values for Y and YPRIME at the initial time must be given as C input. These values must be consistent, (that is, if T,Y,YPRIME are C the given initial values, they must satisfy G(T,Y,YPRIME) = 0.). The C subroutine solves the system from T to TOUT. It is easy to continue C the solution to get results at additional TOUT. This is the interval C mode of operation. Intermediate results can also be obtained easily C by using the intermediate-output capability. C C The following detailed description is divided into subsections: C 1. Input required for the first call to DDASSL. C 2. Output after any return from DDASSL. C 3. What to do to continue the integration. C 4. Error messages. C C C -------- INPUT -- WHAT TO DO ON THE FIRST CALL TO DDASSL ------------ C C The first call of the code is defined to be the start of each new C problem. Read through the descriptions of all the following items, C provide sufficient storage space for designated arrays, set C appropriate variables for the initialization of the problem, and C give information about how you want the problem to be solved. C C C RES -- Provide a subroutine of the form C SUBROUTINE RES(T,Y,YPRIME,DELTA,IRES,RPAR,IPAR) C to define the system of differential/algebraic C equations which is to be solved. For the given values C of T,Y and YPRIME, the subroutine should C return the residual of the defferential/algebraic C system C DELTA = G(T,Y,YPRIME) C (DELTA(*) is a vector of length NEQ which is C output for RES.) C C Subroutine RES must not alter T,Y or YPRIME. C You must declare the name RES in an external C statement in your program that calls DDASSL. C You must dimension Y,YPRIME and DELTA in RES. C C IRES is an integer flag which is always equal to C zero on input. Subroutine RES should alter IRES C only if it encounters an illegal value of Y or C a stop condition. Set IRES = -1 if an input value C is illegal, and DDASSL will try to solve the problem C without getting IRES = -1. If IRES = -2, DDASSL C will return control to the calling program C with IDID = -11. C C RPAR and IPAR are real and integer parameter arrays which C you can use for communication between your calling program C and subroutine RES. They are not altered by DDASSL. If you C do not need RPAR or IPAR, ignore these parameters by treat- C ing them as dummy arguments. If you do choose to use them, C dimension them in your calling program and in RES as arrays C of appropriate length. C C NEQ -- Set it to the number of differential equations. C (NEQ .GE. 1) C C T -- Set it to the initial point of the integration. C T must be defined as a variable. C C Y(*) -- Set this vector to the initial values of the NEQ solution C components at the initial point. You must dimension Y of C length at least NEQ in your calling program. C C YPRIME(*) -- Set this vector to the initial values of the NEQ C first derivatives of the solution components at the initial C point. You must dimension YPRIME at least NEQ in your C calling program. If you do not know initial values of some C of the solution components, see the explanation of INFO(11). C C TOUT -- Set it to the first point at which a solution C is desired. You can not take TOUT = T. C integration either forward in T (TOUT .GT. T) or C backward in T (TOUT .LT. T) is permitted. C C The code advances the solution from T to TOUT using C step sizes which are automatically selected so as to C achieve the desired accuracy. If you wish, the code will C return with the solution and its derivative at C intermediate steps (intermediate-output mode) so that C you can monitor them, but you still must provide TOUT in C accord with the basic aim of the code. C C The first step taken by the code is a critical one C because it must reflect how fast the solution changes near C the initial point. The code automatically selects an C initial step size which is practically always suitable for C the problem. By using the fact that the code will not step C past TOUT in the first step, you could, if necessary, C restrict the length of the initial step size. C C For some problems it may not be permissible to integrate C past a point TSTOP because a discontinuity occurs there C or the solution or its derivative is not defined beyond C TSTOP. When you have declared a TSTOP point (SEE INFO(4) C and RWORK(1)), you have told the code not to integrate C past TSTOP. In this case any TOUT beyond TSTOP is invalid C input. C C INFO(*) -- Use the INFO array to give the code more details about C how you want your problem solved. This array should be C dimensioned of length 15, though DDASSL uses only the first C eleven entries. You must respond to all of the following C items, which are arranged as questions. The simplest use C of the code corresponds to answering all questions as yes, C i.e. setting all entries of INFO to 0. C C INFO(1) - This parameter enables the code to initialize C itself. You must set it to indicate the start of every C new problem. C C **** Is this the first call for this problem ... C Yes - Set INFO(1) = 0 C No - Not applicable here. C See below for continuation calls. **** C C INFO(2) - How much accuracy you want of your solution C is specified by the error tolerances RTOL and ATOL. C The simplest use is to take them both to be scalars. C To obtain more flexibility, they can both be vectors. C The code must be told your choice. C C **** Are both error tolerances RTOL, ATOL scalars ... C Yes - Set INFO(2) = 0 C and input scalars for both RTOL and ATOL C No - Set INFO(2) = 1 C and input arrays for both RTOL and ATOL **** C C INFO(3) - The code integrates from T in the direction C of TOUT by steps. If you wish, it will return the C computed solution and derivative at the next C intermediate step (the intermediate-output mode) or C TOUT, whichever comes first. This is a good way to C proceed if you want to see the behavior of the solution. C If you must have solutions at a great many specific C TOUT points, this code will compute them efficiently. C C **** Do you want the solution only at C TOUT (and not at the next intermediate step) ... C Yes - Set INFO(3) = 0 C No - Set INFO(3) = 1 **** C C INFO(4) - To handle solutions at a great many specific C values TOUT efficiently, this code may integrate past C TOUT and interpolate to obtain the result at TOUT. C Sometimes it is not possible to integrate beyond some C point TSTOP because the equation changes there or it is C not defined past TSTOP. Then you must tell the code C not to go past. C C **** Can the integration be carried out without any C restrictions on the independent variable T ... C Yes - Set INFO(4)=0 C No - Set INFO(4)=1 C and define the stopping point TSTOP by C setting RWORK(1)=TSTOP **** C C INFO(5) - To solve differential/algebraic problems it is C necessary to use a matrix of partial derivatives of the C system of differential equations. If you do not C provide a subroutine to evaluate it analytically (see C description of the item JAC in the call list), it will C be approximated by numerical differencing in this code. C although it is less trouble for you to have the code C compute partial derivatives by numerical differencing, C the solution will be more reliable if you provide the C derivatives via JAC. Sometimes numerical differencing C is cheaper than evaluating derivatives in JAC and C sometimes it is not - this depends on your problem. C C **** Do you want the code to evaluate the partial C derivatives automatically by numerical differences ... C Yes - Set INFO(5)=0 C No - Set INFO(5)=1 C and provide subroutine JAC for evaluating the C matrix of partial derivatives **** C C INFO(6) - DDASSL will perform much better if the matrix of C partial derivatives, DG/DY + CJ*DG/DYPRIME, C (here CJ is a scalar determined by DDASSL) C is banded and the code is told this. In this C case, the storage needed will be greatly reduced, C numerical differencing will be performed much cheaper, C and a number of important algorithms will execute much C faster. The differential equation is said to have C half-bandwidths ML (lower) and MU (upper) if equation i C involves only unknowns Y(J) with C I-ML .LE. J .LE. I+MU C for all I=1,2,...,NEQ. Thus, ML and MU are the widths C of the lower and upper parts of the band, respectively, C with the main diagonal being excluded. If you do not C indicate that the equation has a banded matrix of partial C derivatives, the code works with a full matrix of NEQ**2 C elements (stored in the conventional way). Computations C with banded matrices cost less time and storage than with C full matrices if 2*ML+MU .LT. NEQ. If you tell the C code that the matrix of partial derivatives has a banded C structure and you want to provide subroutine JAC to C compute the partial derivatives, then you must be careful C to store the elements of the matrix in the special form C indicated in the description of JAC. C C **** Do you want to solve the problem using a full C (dense) matrix (and not a special banded C structure) ... C Yes - Set INFO(6)=0 C No - Set INFO(6)=1 C and provide the lower (ML) and upper (MU) C bandwidths by setting C IWORK(1)=ML C IWORK(2)=MU **** C C C INFO(7) -- You can specify a maximum (absolute value of) C stepsize, so that the code C will avoid passing over very C large regions. C C **** Do you want the code to decide C on its own maximum stepsize? C Yes - Set INFO(7)=0 C No - Set INFO(7)=1 C and define HMAX by setting C RWORK(2)=HMAX **** C C INFO(8) -- Differential/algebraic problems C may occaisionally suffer from C severe scaling difficulties on the C first step. If you know a great deal C about the scaling of your problem, you can C help to alleviate this problem by C specifying an initial stepsize HO. C C **** Do you want the code to define C its own initial stepsize? C Yes - Set INFO(8)=0 C No - Set INFO(8)=1 C and define HO by setting C RWORK(3)=HO **** C C INFO(9) -- If storage is a severe problem, C you can save some locations by C restricting the maximum order MAXORD. C the default value is 5. for each C order decrease below 5, the code C requires NEQ fewer locations, however C it is likely to be slower. In any C case, you must have 1 .LE. MAXORD .LE. 5 C **** Do you want the maximum order to C default to 5? C Yes - Set INFO(9)=0 C No - Set INFO(9)=1 C and define MAXORD by setting C IWORK(3)=MAXORD **** C C INFO(10) --If you know that the solutions to your equations C will always be nonnegative, it may help to set this C parameter. However, it is probably best to C try the code without using this option first, C and only to use this option if that doesn't C work very well. C **** Do you want the code to solve the problem without C invoking any special nonnegativity constraints? C Yes - Set INFO(10)=0 C No - Set INFO(10)=1 C C INFO(11) --DDASSL normally requires the initial T, C Y, and YPRIME to be consistent. That is, C you must have G(T,Y,YPRIME) = 0 at the initial C time. If you do not know the initial C derivative precisely, you can let DDASSL try C to compute it. C **** Are the initialHE INITIAL T, Y, YPRIME consistent? C Yes - Set INFO(11) = 0 C No - Set INFO(11) = 1, C and set YPRIME to an initial approximation C to YPRIME. (If you have no idea what C YPRIME should be, set it to zero. Note C that the initial Y should be such C that there must exist a YPRIME so that C G(T,Y,YPRIME) = 0.) C C RTOL, ATOL -- You must assign relative (RTOL) and absolute (ATOL C error tolerances to tell the code how accurately you C want the solution to be computed. They must be defined C as variables because the code may change them. You C have two choices -- C Both RTOL and ATOL are scalars. (INFO(2)=0) C Both RTOL and ATOL are vectors. (INFO(2)=1) C in either case all components must be non-negative. C C The tolerances are used by the code in a local error C test at each step which requires roughly that C ABS(LOCAL ERROR) .LE. RTOL*ABS(Y)+ATOL C for each vector component. C (More specifically, a root-mean-square norm is used to C measure the size of vectors, and the error test uses the C magnitude of the solution at the beginning of the step.) C C The true (global) error is the difference between the C true solution of the initial value problem and the C computed approximation. Practically all present day C codes, including this one, control the local error at C each step and do not even attempt to control the global C error directly. C Usually, but not always, the true accuracy of the C computed Y is comparable to the error tolerances. This C code will usually, but not always, deliver a more C accurate solution if you reduce the tolerances and C integrate again. By comparing two such solutions you C can get a fairly reliable idea of the true error in the C solution at the bigger tolerances. C C Setting ATOL=0. results in a pure relative error test on C that component. Setting RTOL=0. results in a pure C absolute error test on that component. A mixed test C with non-zero RTOL and ATOL corresponds roughly to a C relative error test when the solution component is much C bigger than ATOL and to an absolute error test when the C solution component is smaller than the threshhold ATOL. C C The code will not attempt to compute a solution at an C accuracy unreasonable for the machine being used. It will C advise you if you ask for too much accuracy and inform C you as to the maximum accuracy it believes possible. C C RWORK(*) -- Dimension this real work array of length LRW in your C calling program. C C LRW -- Set it to the declared length of the RWORK array. C You must have C LRW .GE. 40+(MAXORD+4)*NEQ+NEQ**2 C for the full (dense) JACOBIAN case (when INFO(6)=0), or C LRW .GE. 40+(MAXORD+4)*NEQ+(2*ML+MU+1)*NEQ C for the banded user-defined JACOBIAN case C (when INFO(5)=1 and INFO(6)=1), or C LRW .GE. 40+(MAXORD+4)*NEQ+(2*ML+MU+1)*NEQ C +2*(NEQ/(ML+MU+1)+1) C for the banded finite-difference-generated JACOBIAN case C (when INFO(5)=0 and INFO(6)=1) C C IWORK(*) -- Dimension this integer work array of length LIW in C your calling program. C C LIW -- Set it to the declared length of the IWORK array. C You must have LIW .GE. 20+NEQ C C RPAR, IPAR -- These are parameter arrays, of real and integer C type, respectively. You can use them for communication C between your program that calls DDASSL and the C RES subroutine (and the JAC subroutine). They are not C altered by DDASSL. If you do not need RPAR or IPAR, C ignore these parameters by treating them as dummy C arguments. If you do choose to use them, dimension C them in your calling program and in RES (and in JAC) C as arrays of appropriate length. C C JAC -- If you have set INFO(5)=0, you can ignore this parameter C by treating it as a dummy argument. Otherwise, you must C provide a subroutine of the form C SUBROUTINE JAC(T,Y,YPRIME,PD,CJ,RPAR,IPAR) C to define the matrix of partial derivatives C PD=DG/DY+CJ*DG/DYPRIME C CJ is a scalar which is input to JAC. C For the given values of T,Y,YPRIME, the C subroutine must evaluate the non-zero partial C derivatives for each equation and each solution C component, and store these values in the C matrix PD. The elements of PD are set to zero C before each call to JAC so only non-zero elements C need to be defined. C C Subroutine JAC must not alter T,Y,(*),YPRIME(*), or CJ. C You must declare the name JAC in an EXTERNAL statement in C your program that calls DDASSL. You must dimension Y, C YPRIME and PD in JAC. C C The way you must store the elements into the PD matrix C depends on the structure of the matrix which you C indicated by INFO(6). C *** INFO(6)=0 -- Full (dense) matrix *** C Give PD a first dimension of NEQ. C When you evaluate the (non-zero) partial derivative C of equation I with respect to variable J, you must C store it in PD according to C PD(I,J) = "DG(I)/DY(J)+CJ*DG(I)/DYPRIME(J)" C *** INFO(6)=1 -- Banded JACOBIAN with ML lower and MU C upper diagonal bands (refer to INFO(6) description C of ML and MU) *** C Give PD a first dimension of 2*ML+MU+1. C when you evaluate the (non-zero) partial derivative C of equation I with respect to variable J, you must C store it in PD according to C IROW = I - J + ML + MU + 1 C PD(IROW,J) = "DG(I)/DY(J)+CJ*DG(I)/DYPRIME(J)" C C RPAR and IPAR are real and integer parameter arrays C which you can use for communication between your calling C program and your JACOBIAN subroutine JAC. They are not C altered by DDASSL. If you do not need RPAR or IPAR, C ignore these parameters by treating them as dummy C arguments. If you do choose to use them, dimension C them in your calling program and in JAC as arrays of C appropriate length. C C C OPTIONALLY REPLACEABLE NORM ROUTINE: C C DDASSL uses a weighted norm DDANRM to measure the size C of vectors such as the estimated error in each step. C A FUNCTION subprogram C DOUBLE PRECISION FUNCTION DDANRM(NEQ,V,WT,RPAR,IPAR) C DIMENSION V(NEQ),WT(NEQ) C is used to define this norm. Here, V is the vector C whose norm is to be computed, and WT is a vector of C weights. A DDANRM routine has been included with DDASSL C which computes the weighted root-mean-square norm C given by C DDANRM=SQRT((1/NEQ)*SUM(V(I)/WT(I))**2) C this norm is suitable for most problems. In some C special cases, it may be more convenient and/or C efficient to define your own norm by writing a function C subprogram to be called instead of DDANRM. This should, C however, be attempted only after careful thought and C consideration. C C C -------- OUTPUT -- AFTER ANY RETURN FROM DDASSL --------------------- C C The principal aim of the code is to return a computed solution at C TOUT, although it is also possible to obtain intermediate results C along the way. To find out whether the code achieved its goal C or if the integration process was interrupted before the task was C completed, you must check the IDID parameter. C C C T -- The solution was successfully advanced to the C output value of T. C C Y(*) -- Contains the computed solution approximation at T. C C YPRIME(*) -- Contains the computed derivative C approximation at T. C C IDID -- Reports what the code did. C C *** Task completed *** C Reported by positive values of IDID C C IDID = 1 -- A step was successfully taken in the C intermediate-output mode. The code has not C yet reached TOUT. C C IDID = 2 -- The integration to TSTOP was successfully C completed (T=TSTOP) by stepping exactly to TSTOP. C C IDID = 3 -- The integration to TOUT was successfully C completed (T=TOUT) by stepping past TOUT. C Y(*) is obtained by interpolation. C YPRIME(*) is obtained by interpolation. C C *** Task interrupted *** C Reported by negative values of IDID C C IDID = -1 -- A large amount of work has been expended. C (About 500 steps) C C IDID = -2 -- The error tolerances are too stringent. C C IDID = -3 -- The local error test cannot be satisfied C because you specified a zero component in ATOL C and the corresponding computed solution C component is zero. Thus, a pure relative error C test is impossible for this component. C C IDID = -6 -- DDASSL had repeated error test C failures on the last attempted step. C C IDID = -7 -- The corrector could not converge. C C IDID = -8 -- The matrix of partial derivatives C is singular. C C IDID = -9 -- The corrector could not converge. C there were repeated error test failures C in this step. C C IDID =-10 -- The corrector could not converge C because IRES was equal to minus one. C C IDID =-11 -- IRES equal to -2 was encountered C and control is being returned to the C calling program. C C IDID =-12 -- DDASSL failed to compute the initial C YPRIME. C C C C IDID = -13,..,-32 -- Not applicable for this code C C *** Task terminated *** C Reported by the value of IDID=-33 C C IDID = -33 -- The code has encountered trouble from which C it cannot recover. A message is printed C explaining the trouble and control is returned C to the calling program. For example, this occurs C when invalid input is detected. C C RTOL, ATOL -- These quantities remain unchanged except when C IDID = -2. In this case, the error tolerances have been C increased by the code to values which are estimated to C be appropriate for continuing the integration. However, C the reported solution at T was obtained using the input C values of RTOL and ATOL. C C RWORK, IWORK -- Contain information which is usually of no C interest to the user but necessary for subsequent calls. C However, you may find use for C C RWORK(3)--Which contains the step size H to be C attempted on the next step. C C RWORK(4)--Which contains the current value of the C independent variable, i.e., the farthest point C integration has reached. This will be different C from T only when interpolation has been C performed (IDID=3). C C RWORK(7)--Which contains the stepsize used C on the last successful step. C C IWORK(7)--Which contains the order of the method to C be attempted on the next step. C C IWORK(8)--Which contains the order of the method used C on the last step. C C IWORK(11)--Which contains the number of steps taken so C far. C C IWORK(12)--Which contains the number of calls to RES C so far. C C IWORK(13)--Which contains the number of evaluations of C the matrix of partial derivatives needed so C far. C C IWORK(14)--Which contains the total number C of error test failures so far. C C IWORK(15)--Which contains the total number C of convergence test failures so far. C (includes singular iteration matrix C failures.) C C C -------- INPUT -- WHAT TO DO TO CONTINUE THE INTEGRATION ------------ C (CALLS AFTER THE FIRST) C C This code is organized so that subsequent calls to continue the C integration involve little (if any) additional effort on your C part. You must monitor the IDID parameter in order to determine C what to do next. C C Recalling that the principal task of the code is to integrate C from T to TOUT (the interval mode), usually all you will need C to do is specify a new TOUT upon reaching the current TOUT. C C Do not alter any quantity not specifically permitted below, C in particular do not alter NEQ,T,Y(*),YPRIME(*),RWORK(*),IWORK(*) C or the differential equation in subroutine RES. Any such C alteration constitutes a new problem and must be treated as such, C i.e., you must start afresh. C C You cannot change from vector to scalar error control or vice C versa (INFO(2)), but you can change the size of the entries of C RTOL, ATOL. Increasing a tolerance makes the equation easier C to integrate. Decreasing a tolerance will make the equation C harder to integrate and should generally be avoided. C C You can switch from the intermediate-output mode to the C interval mode (INFO(3)) or vice versa at any time. C C If it has been necessary to prevent the integration from going C past a point TSTOP (INFO(4), RWORK(1)), keep in mind that the C code will not integrate to any TOUT beyond the currently C specified TSTOP. Once TSTOP has been reached you must change C the value of TSTOP or set INFO(4)=0. You may change INFO(4) C or TSTOP at any time but you must supply the value of TSTOP in C RWORK(1) whenever you set INFO(4)=1. C C Do not change INFO(5), INFO(6), IWORK(1), or IWORK(2) C unless you are going to restart the code. C C *** Following a completed task *** C If C IDID = 1, call the code again to continue the integration C another step in the direction of TOUT. C C IDID = 2 or 3, define a new TOUT and call the code again. C TOUT must be different from T. You cannot change C the direction of integration without restarting. C C *** Following an interrupted task *** C To show the code that you realize the task was C interrupted and that you want to continue, you C must take appropriate action and set INFO(1) = 1 C If C IDID = -1, The code has taken about 500 steps. C If you want to continue, set INFO(1) = 1 and C call the code again. An additional 500 steps C will be allowed. C C IDID = -2, The error tolerances RTOL, ATOL have been C increased to values the code estimates appropriate C for continuing. You may want to change them C yourself. If you are sure you want to continue C with relaxed error tolerances, set INFO(1)=1 and C call the code again. C C IDID = -3, A solution component is zero and you set the C corresponding component of ATOL to zero. If you C are sure you want to continue, you must first C alter the error criterion to use positive values C for those components of ATOL corresponding to zero C solution components, then set INFO(1)=1 and call C the code again. C C IDID = -4,-5 --- Cannot occur with this code. C C IDID = -6, Repeated error test failures occurred on the C last attempted step in DDASSL. A singularity in the C solution may be present. If you are absolutely C certain you want to continue, you should restart C the integration. (Provide initial values of Y and C YPRIME which are consistent) C C IDID = -7, Repeated convergence test failures occurred C on the last attempted step in DDASSL. An inaccurate C or ill-conditioned JACOBIAN may be the problem. If C you are absolutely certain you want to continue, you C should restart the integration. C C IDID = -8, The matrix of partial derivatives is singular. C Some of your equations may be redundant. C DDASSL cannot solve the problem as stated. C It is possible that the redundant equations C could be removed, and then DDASSL could C solve the problem. It is also possible C that a solution to your problem either C does not exist or is not unique. C C IDID = -9, DDASSL had multiple convergence test C failures, preceeded by multiple error C test failures, on the last attempted step. C It is possible that your problem C is ill-posed, and cannot be solved C using this code. Or, there may be a C discontinuity or a singularity in the C solution. If you are absolutely certain C you want to continue, you should restart C the integration. C C IDID =-10, DDASSL had multiple convergence test failures C because IRES was equal to minus one. C If you are absolutely certain you want C to continue, you should restart the C integration. C C IDID =-11, IRES=-2 was encountered, and control is being C returned to the calling program. C C IDID =-12, DDASSL failed to compute the initial YPRIME. C This could happen because the initial C approximation to YPRIME was not very good, or C if a YPRIME consistent with the initial Y C does not exist. The problem could also be caused C by an inaccurate or singular iteration matrix. C C IDID = -13,..,-32 --- Cannot occur with this code. C C C *** Following a terminated task *** C C If IDID= -33, you cannot continue the solution of this problem. C An attempt to do so will result in your C run being terminated. C C C -------- ERROR MESSAGES --------------------------------------------- C C The SLATEC error print routine XERMSG is called in the event of C unsuccessful completion of a task. Most of these are treated as C "recoverable errors", which means that (unless the user has directed C otherwise) control will be returned to the calling program for C possible action after the message has been printed. C C In the event of a negative value of IDID other than -33, an appro- C priate message is printed and the "error number" printed by XERMSG C is the value of IDID. There are quite a number of illegal input C errors that can lead to a returned value IDID=-33. The conditions C and their printed "error numbers" are as follows: C C Error number Condition C C 1 Some element of INFO vector is not zero or one. C 2 NEQ .le. 0 C 3 MAXORD not in range. C 4 LRW is less than the required length for RWORK. C 5 LIW is less than the required length for IWORK. C 6 Some element of RTOL is .lt. 0 C 7 Some element of ATOL is .lt. 0 C 8 All elements of RTOL and ATOL are zero. C 9 INFO(4)=1 and TSTOP is behind TOUT. C 10 HMAX .lt. 0.0 C 11 TOUT is behind T. C 12 INFO(8)=1 and H0=0.0 C 13 Some element of WT is .le. 0.0 C 14 TOUT is too close to T to start integration. C 15 INFO(4)=1 and TSTOP is behind T. C 16 --( Not used in this version )-- C 17 ML illegal. Either .lt. 0 or .gt. NEQ C 18 MU illegal. Either .lt. 0 or .gt. NEQ C 19 TOUT = T. C C If DDASSL is called again without any action taken to remove the C cause of an unsuccessful return, XERMSG will be called with a fatal C error flag, which will cause unconditional termination of the C program. There are two such fatal errors: C C Error number -998: The last step was terminated with a negative C value of IDID other than -33, and no appropriate action was C taken. C C Error number -999: The previous call was terminated because of C illegal input (IDID=-33) and there is illegal input in the C present call, as well. (Suspect infinite loop.) C C --------------------------------------------------------------------- C C***REFERENCES A DESCRIPTION OF DASSL: A DIFFERENTIAL/ALGEBRAIC C SYSTEM SOLVER, L. R. PETZOLD, SAND82-8637, C SANDIA NATIONAL LABORATORIES, SEPTEMBER 1982. C***ROUTINES CALLED D1MACH, DDAINI, DDANRM, DDASTP, DDATRP, DDAWTS, C XERMSG C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 880387 Code changes made. All common statements have been C replaced by a DATA statement, which defines pointers into C RWORK, and PARAMETER statements which define pointers C into IWORK. As well the documentation has gone through C grammatical changes. C 881005 The prologue has been changed to mixed case. C The subordinate routines had revision dates changed to C this date, although the documentation for these routines C is all upper case. No code changes. C 890511 Code changes made. The DATA statement in the declaration C section of DDASSL was replaced with a PARAMETER C statement. Also the statement S = 100.D0 was removed C from the top of the Newton iteration in DDASTP. C The subordinate routines had revision dates changed to C this date. C 890517 The revision date syntax was replaced with the revision C history syntax. Also the "DECK" comment was added to C the top of all subroutines. These changes are consistent C with new SLATEC guidelines. C The subordinate routines had revision dates changed to C this date. No code changes. C 891013 Code changes made. C Removed all occurrances of FLOAT or DBLE. All operations C are now performed with "mixed-mode" arithmetic. C Also, specific function names were replaced with generic C function names to be consistent with new SLATEC guidelines. C In particular: C Replaced DSQRT with SQRT everywhere. C Replaced DABS with ABS everywhere. C Replaced DMIN1 with MIN everywhere. C Replaced MIN0 with MIN everywhere. C Replaced DMAX1 with MAX everywhere. C Replaced MAX0 with MAX everywhere. C Replaced DSIGN with SIGN everywhere. C Also replaced REVISION DATE with REVISION HISTORY in all C subordinate routines. C 901004 Miscellaneous changes to prologue to complete conversion C to SLATEC 4.0 format. No code changes. (F.N.Fritsch) C 901009 Corrected GAMS classification code and converted subsidiary C routines to 4.0 format. No code changes. (F.N.Fritsch) C 901010 Converted XERRWV calls to XERMSG calls. (R.Clemens,AFWL) C 901019 Code changes made. C Merged SLATEC 4.0 changes with previous changes made C by C. Ulrich. Below is a history of the changes made by C C. Ulrich. (Changes in subsidiary routines are implied C by this history) C 891228 Bug was found and repaired inside the DDASSL C and DDAINI routines. DDAINI was incorrectly C returning the initial T with Y and YPRIME C computed at T+H. The routine now returns T+H C rather than the initial T. C Cosmetic changes made to DDASTP. C 900904 Three modifications were made to fix a bug (inside C DDASSL) re interpolation for continuation calls and C cases where TN is very close to TSTOP: C C 1) In testing for whether H is too large, just C compare H to (TSTOP - TN), rather than C (TSTOP - TN) * (1-4*UROUND), and set H to C TSTOP - TN. This will force DDASTP to step C exactly to TSTOP under certain situations C (i.e. when H returned from DDASTP would otherwise C take TN beyond TSTOP). C C 2) Inside the DDASTP loop, interpolate exactly to C TSTOP if TN is very close to TSTOP (rather than C interpolating to within roundoff of TSTOP). C C 3) Modified IDID description for IDID = 2 to say that C the solution is returned by stepping exactly to C TSTOP, rather than TOUT. (In some cases the C solution is actually obtained by extrapolating C over a distance near unit roundoff to TSTOP, C but this small distance is deemed acceptable in C these circumstances.) C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue, removed unreferenced labels, C and improved XERMSG calls. (FNF) C 901030 Added ERROR MESSAGES section and reworked other sections to C be of more uniform format. (FNF) C 910624 Fixed minor bug related to HMAX (five lines ending in C statement 526 in DDASSL). (LRP) C C***END PROLOGUE DDASSL C C**End C C Declare arguments. C INTEGER NEQ, INFO(15), IDID, LRW, IWORK(*), LIW, IPAR(*) DOUBLE PRECISION * T, Y(*), YPRIME(*), TOUT, RTOL(*), ATOL(*), RWORK(*), * RPAR(*) EXTERNAL RES, JAC C C Declare externals. C EXTERNAL D1MACH, DDAINI, DDANRM, DDASTP, DDATRP, DDAWTS, XERMSG DOUBLE PRECISION D1MACH, DDANRM C C Declare local variables. C INTEGER I, ITEMP, LALPHA, LBETA, LCJ, LCJOLD, LCTF, LDELTA, * LENIW, LENPD, LENRW, LE, LETF, LGAMMA, LH, LHMAX, LHOLD, LIPVT, * LJCALC, LK, LKOLD, LIWM, LML, LMTYPE, LMU, LMXORD, LNJE, LNPD, * LNRE, LNS, LNST, LNSTL, LPD, LPHASE, LPHI, LPSI, LROUND, LS, * LSIGMA, LTN, LTSTOP, LWM, LWT, MBAND, MSAVE, MXORD, NPD, NTEMP, * NZFLG DOUBLE PRECISION * ATOLI, H, HMAX, HMIN, HO, R, RH, RTOLI, TDIST, TN, TNEXT, * TSTOP, UROUND, YPNORM LOGICAL DONE C Auxiliary variables for conversion of values to be included in C error messages. CHARACTER*8 XERN1, XERN2 CHARACTER*16 XERN3, XERN4 C C SET POINTERS INTO IWORK PARAMETER (LML=1, LMU=2, LMXORD=3, LMTYPE=4, LNST=11, * LNRE=12, LNJE=13, LETF=14, LCTF=15, LNPD=16, * LIPVT=21, LJCALC=5, LPHASE=6, LK=7, LKOLD=8, * LNS=9, LNSTL=10, LIWM=1) C C SET RELATIVE OFFSET INTO RWORK PARAMETER (NPD=1) C C SET POINTERS INTO RWORK PARAMETER (LTSTOP=1, LHMAX=2, LH=3, LTN=4, * LCJ=5, LCJOLD=6, LHOLD=7, LS=8, LROUND=9, * LALPHA=11, LBETA=17, LGAMMA=23, * LPSI=29, LSIGMA=35, LDELTA=41) C C***FIRST EXECUTABLE STATEMENT DDASSL IF(INFO(1).NE.0)GO TO 100 C C----------------------------------------------------------------------- C THIS BLOCK IS EXECUTED FOR THE INITIAL CALL ONLY. C IT CONTAINS CHECKING OF INPUTS AND INITIALIZATIONS. C----------------------------------------------------------------------- C C FIRST CHECK INFO ARRAY TO MAKE SURE ALL ELEMENTS OF INFO C ARE EITHER ZERO OR ONE. DO 10 I=2,11 IF(INFO(I).NE.0.AND.INFO(I).NE.1)GO TO 701 10 CONTINUE C IF(NEQ.LE.0)GO TO 702 C C CHECK AND COMPUTE MAXIMUM ORDER MXORD=5 IF(INFO(9).EQ.0)GO TO 20 MXORD=IWORK(LMXORD) IF(MXORD.LT.1.OR.MXORD.GT.5)GO TO 703 20 IWORK(LMXORD)=MXORD C C COMPUTE MTYPE,LENPD,LENRW.CHECK ML AND MU. IF(INFO(6).NE.0)GO TO 40 LENPD=NEQ**2 LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD IF(INFO(5).NE.0)GO TO 30 IWORK(LMTYPE)=2 GO TO 60 30 IWORK(LMTYPE)=1 GO TO 60 40 IF(IWORK(LML).LT.0.OR.IWORK(LML).GE.NEQ)GO TO 717 IF(IWORK(LMU).LT.0.OR.IWORK(LMU).GE.NEQ)GO TO 718 LENPD=(2*IWORK(LML)+IWORK(LMU)+1)*NEQ IF(INFO(5).NE.0)GO TO 50 IWORK(LMTYPE)=5 MBAND=IWORK(LML)+IWORK(LMU)+1 MSAVE=(NEQ/MBAND)+1 LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD+2*MSAVE GO TO 60 50 IWORK(LMTYPE)=4 LENRW=40+(IWORK(LMXORD)+4)*NEQ+LENPD C C CHECK LENGTHS OF RWORK AND IWORK 60 LENIW=20+NEQ IWORK(LNPD)=LENPD IF(LRW.LT.LENRW)GO TO 704 IF(LIW.LT.LENIW)GO TO 705 C C CHECK TO SEE THAT TOUT IS DIFFERENT FROM T IF(TOUT .EQ. T)GO TO 719 C C CHECK HMAX IF(INFO(7).EQ.0)GO TO 70 HMAX=RWORK(LHMAX) IF(HMAX.LE.0.0D0)GO TO 710 70 CONTINUE C C INITIALIZE COUNTERS IWORK(LNST)=0 IWORK(LNRE)=0 IWORK(LNJE)=0 C IWORK(LNSTL)=0 IDID=1 GO TO 200 C C----------------------------------------------------------------------- C THIS BLOCK IS FOR CONTINUATION CALLS C ONLY. HERE WE CHECK INFO(1),AND IF THE C LAST STEP WAS INTERRUPTED WE CHECK WHETHER C APPROPRIATE ACTION WAS TAKEN. C----------------------------------------------------------------------- C 100 CONTINUE IF(INFO(1).EQ.1)GO TO 110 IF(INFO(1).NE.-1)GO TO 701 C C IF WE ARE HERE, THE LAST STEP WAS INTERRUPTED C BY AN ERROR CONDITION FROM DDASTP,AND C APPROPRIATE ACTION WAS NOT TAKEN. THIS C IS A FATAL ERROR. WRITE (XERN1, '(I8)') IDID CALL XERMSG ('SLATEC', 'DDASSL', * 'THE LAST STEP TERMINATED WITH A NEGATIVE VALUE OF IDID = ' // * XERN1 // ' AND NO APPROPRIATE ACTION WAS TAKEN. ' // * 'RUN TERMINATED', -998, 2) RETURN 110 CONTINUE IWORK(LNSTL)=IWORK(LNST) C C----------------------------------------------------------------------- C THIS BLOCK IS EXECUTED ON ALL CALLS. C THE ERROR TOLERANCE PARAMETERS ARE C CHECKED, AND THE WORK ARRAY POINTERS C ARE SET. C----------------------------------------------------------------------- C 200 CONTINUE C CHECK RTOL,ATOL NZFLG=0 RTOLI=RTOL(1) ATOLI=ATOL(1) DO 210 I=1,NEQ IF(INFO(2).EQ.1)RTOLI=RTOL(I) IF(INFO(2).EQ.1)ATOLI=ATOL(I) IF(RTOLI.GT.0.0D0.OR.ATOLI.GT.0.0D0)NZFLG=1 IF(RTOLI.LT.0.0D0)GO TO 706 IF(ATOLI.LT.0.0D0)GO TO 707 210 CONTINUE IF(NZFLG.EQ.0)GO TO 708 C C SET UP RWORK STORAGE.IWORK STORAGE IS FIXED C IN DATA STATEMENT. LE=LDELTA+NEQ LWT=LE+NEQ LPHI=LWT+NEQ LPD=LPHI+(IWORK(LMXORD)+1)*NEQ LWM=LPD NTEMP=NPD+IWORK(LNPD) IF(INFO(1).EQ.1)GO TO 400 C C----------------------------------------------------------------------- C THIS BLOCK IS EXECUTED ON THE INITIAL CALL C ONLY. SET THE INITIAL STEP SIZE, AND C THE ERROR WEIGHT VECTOR, AND PHI. C COMPUTE INITIAL YPRIME, IF NECESSARY. C----------------------------------------------------------------------- C TN=T IDID=1 C C SET ERROR WEIGHT VECTOR WT CALL DDAWTS(NEQ,INFO(2),RTOL,ATOL,Y,RWORK(LWT),RPAR,IPAR) DO 305 I = 1,NEQ IF(RWORK(LWT+I-1).LE.0.0D0) GO TO 713 305 CONTINUE C C COMPUTE UNIT ROUNDOFF AND HMIN UROUND = D1MACH(4) RWORK(LROUND) = UROUND HMIN = 4.0D0*UROUND*MAX(ABS(T),ABS(TOUT)) C C CHECK INITIAL INTERVAL TO SEE THAT IT IS LONG ENOUGH TDIST = ABS(TOUT - T) IF(TDIST .LT. HMIN) GO TO 714 C C CHECK HO, IF THIS WAS INPUT IF (INFO(8) .EQ. 0) GO TO 310 HO = RWORK(LH) IF ((TOUT - T)*HO .LT. 0.0D0) GO TO 711 IF (HO .EQ. 0.0D0) GO TO 712 GO TO 320 310 CONTINUE C C COMPUTE INITIAL STEPSIZE, TO BE USED BY EITHER C DDASTP OR DDAINI, DEPENDING ON INFO(11) HO = 0.001D0*TDIST YPNORM = DDANRM(NEQ,YPRIME,RWORK(LWT),RPAR,IPAR) IF (YPNORM .GT. 0.5D0/HO) HO = 0.5D0/YPNORM HO = SIGN(HO,TOUT-T) C ADJUST HO IF NECESSARY TO MEET HMAX BOUND 320 IF (INFO(7) .EQ. 0) GO TO 330 RH = ABS(HO)/RWORK(LHMAX) IF (RH .GT. 1.0D0) HO = HO/RH C COMPUTE TSTOP, IF APPLICABLE 330 IF (INFO(4) .EQ. 0) GO TO 340 TSTOP = RWORK(LTSTOP) IF ((TSTOP - T)*HO .LT. 0.0D0) GO TO 715 IF ((T + HO - TSTOP)*HO .GT. 0.0D0) HO = TSTOP - T IF ((TSTOP - TOUT)*HO .LT. 0.0D0) GO TO 709 C C COMPUTE INITIAL DERIVATIVE, UPDATING TN AND Y, IF APPLICABLE 340 IF (INFO(11) .EQ. 0) GO TO 350 CALL DDAINI(TN,Y,YPRIME,NEQ, * RES,JAC,HO,RWORK(LWT),IDID,RPAR,IPAR, * RWORK(LPHI),RWORK(LDELTA),RWORK(LE), * RWORK(LWM),IWORK(LIWM),HMIN,RWORK(LROUND), * INFO(10),NTEMP) IF (IDID .LT. 0) GO TO 390 C C LOAD H WITH HO. STORE H IN RWORK(LH) 350 H = HO RWORK(LH) = H C C LOAD Y AND H*YPRIME INTO PHI(*,1) AND PHI(*,2) ITEMP = LPHI + NEQ DO 370 I = 1,NEQ RWORK(LPHI + I - 1) = Y(I) 370 RWORK(ITEMP + I - 1) = H*YPRIME(I) C 390 GO TO 500 C C------------------------------------------------------- C THIS BLOCK IS FOR CONTINUATION CALLS ONLY. ITS C PURPOSE IS TO CHECK STOP CONDITIONS BEFORE C TAKING A STEP. C ADJUST H IF NECESSARY TO MEET HMAX BOUND C------------------------------------------------------- C 400 CONTINUE UROUND=RWORK(LROUND) DONE = .FALSE. TN=RWORK(LTN) H=RWORK(LH) IF(INFO(7) .EQ. 0) GO TO 410 RH = ABS(H)/RWORK(LHMAX) IF(RH .GT. 1.0D0) H = H/RH 410 CONTINUE IF(T .EQ. TOUT) GO TO 719 IF((T - TOUT)*H .GT. 0.0D0) GO TO 711 IF(INFO(4) .EQ. 1) GO TO 430 IF(INFO(3) .EQ. 1) GO TO 420 IF((TN-TOUT)*H.LT.0.0D0)GO TO 490 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T=TOUT IDID = 3 DONE = .TRUE. GO TO 490 420 IF((TN-T)*H .LE. 0.0D0) GO TO 490 IF((TN - TOUT)*H .GT. 0.0D0) GO TO 425 CALL DDATRP(TN,TN,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T = TN IDID = 1 DONE = .TRUE. GO TO 490 425 CONTINUE CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T = TOUT IDID = 3 DONE = .TRUE. GO TO 490 430 IF(INFO(3) .EQ. 1) GO TO 440 TSTOP=RWORK(LTSTOP) IF((TN-TSTOP)*H.GT.0.0D0) GO TO 715 IF((TSTOP-TOUT)*H.LT.0.0D0)GO TO 709 IF((TN-TOUT)*H.LT.0.0D0)GO TO 450 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T=TOUT IDID = 3 DONE = .TRUE. GO TO 490 440 TSTOP = RWORK(LTSTOP) IF((TN-TSTOP)*H .GT. 0.0D0) GO TO 715 IF((TSTOP-TOUT)*H .LT. 0.0D0) GO TO 709 IF((TN-T)*H .LE. 0.0D0) GO TO 450 IF((TN - TOUT)*H .GT. 0.0D0) GO TO 445 CALL DDATRP(TN,TN,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T = TN IDID = 1 DONE = .TRUE. GO TO 490 445 CONTINUE CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) T = TOUT IDID = 3 DONE = .TRUE. GO TO 490 450 CONTINUE C CHECK WHETHER WE ARE WITHIN ROUNDOFF OF TSTOP IF(ABS(TN-TSTOP).GT.100.0D0*UROUND* * (ABS(TN)+ABS(H)))GO TO 460 CALL DDATRP(TN,TSTOP,Y,YPRIME,NEQ,IWORK(LKOLD), * RWORK(LPHI),RWORK(LPSI)) IDID=2 T=TSTOP DONE = .TRUE. GO TO 490 460 TNEXT=TN+H IF((TNEXT-TSTOP)*H.LE.0.0D0)GO TO 490 H=TSTOP-TN RWORK(LH)=H C 490 IF (DONE) GO TO 580 C C------------------------------------------------------- C THE NEXT BLOCK CONTAINS THE CALL TO THE C ONE-STEP INTEGRATOR DDASTP. C THIS IS A LOOPING POINT FOR THE INTEGRATION STEPS. C CHECK FOR TOO MANY STEPS. C UPDATE WT. C CHECK FOR TOO MUCH ACCURACY REQUESTED. C COMPUTE MINIMUM STEPSIZE. C------------------------------------------------------- C 500 CONTINUE C CHECK FOR FAILURE TO COMPUTE INITIAL YPRIME IF (IDID .EQ. -12) GO TO 527 C C CHECK FOR TOO MANY STEPS IF((IWORK(LNST)-IWORK(LNSTL)).LT.500) * GO TO 510 IDID=-1 GO TO 527 C C UPDATE WT 510 CALL DDAWTS(NEQ,INFO(2),RTOL,ATOL,RWORK(LPHI), * RWORK(LWT),RPAR,IPAR) DO 520 I=1,NEQ IF(RWORK(I+LWT-1).GT.0.0D0)GO TO 520 IDID=-3 GO TO 527 520 CONTINUE C C TEST FOR TOO MUCH ACCURACY REQUESTED. R=DDANRM(NEQ,RWORK(LPHI),RWORK(LWT),RPAR,IPAR)* * 100.0D0*UROUND IF(R.LE.1.0D0)GO TO 525 C MULTIPLY RTOL AND ATOL BY R AND RETURN IF(INFO(2).EQ.1)GO TO 523 RTOL(1)=R*RTOL(1) ATOL(1)=R*ATOL(1) IDID=-2 GO TO 527 523 DO 524 I=1,NEQ RTOL(I)=R*RTOL(I) 524 ATOL(I)=R*ATOL(I) IDID=-2 GO TO 527 525 CONTINUE C C COMPUTE MINIMUM STEPSIZE HMIN=4.0D0*UROUND*MAX(ABS(TN),ABS(TOUT)) C C TEST H VS. HMAX IF (INFO(7) .EQ. 0) GO TO 526 RH = ABS(H)/RWORK(LHMAX) IF (RH .GT. 1.0D0) H = H/RH 526 CONTINUE C CALL DDASTP(TN,Y,YPRIME,NEQ, * RES,JAC,H,RWORK(LWT),INFO(1),IDID,RPAR,IPAR, * RWORK(LPHI),RWORK(LDELTA),RWORK(LE), * RWORK(LWM),IWORK(LIWM), * RWORK(LALPHA),RWORK(LBETA),RWORK(LGAMMA), * RWORK(LPSI),RWORK(LSIGMA), * RWORK(LCJ),RWORK(LCJOLD),RWORK(LHOLD), * RWORK(LS),HMIN,RWORK(LROUND), * IWORK(LPHASE),IWORK(LJCALC),IWORK(LK), * IWORK(LKOLD),IWORK(LNS),INFO(10),NTEMP) 527 IF(IDID.LT.0)GO TO 600 C C-------------------------------------------------------- C THIS BLOCK HANDLES THE CASE OF A SUCCESSFUL RETURN C FROM DDASTP (IDID=1). TEST FOR STOP CONDITIONS. C-------------------------------------------------------- C IF(INFO(4).NE.0)GO TO 540 IF(INFO(3).NE.0)GO TO 530 IF((TN-TOUT)*H.LT.0.0D0)GO TO 500 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) IDID=3 T=TOUT GO TO 580 530 IF((TN-TOUT)*H.GE.0.0D0)GO TO 535 T=TN IDID=1 GO TO 580 535 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) IDID=3 T=TOUT GO TO 580 540 IF(INFO(3).NE.0)GO TO 550 IF((TN-TOUT)*H.LT.0.0D0)GO TO 542 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) T=TOUT IDID=3 GO TO 580 542 IF(ABS(TN-TSTOP).LE.100.0D0*UROUND* * (ABS(TN)+ABS(H)))GO TO 545 TNEXT=TN+H IF((TNEXT-TSTOP)*H.LE.0.0D0)GO TO 500 H=TSTOP-TN GO TO 500 545 CALL DDATRP(TN,TSTOP,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) IDID=2 T=TSTOP GO TO 580 550 IF((TN-TOUT)*H.GE.0.0D0)GO TO 555 IF(ABS(TN-TSTOP).LE.100.0D0*UROUND*(ABS(TN)+ABS(H)))GO TO 552 T=TN IDID=1 GO TO 580 552 CALL DDATRP(TN,TSTOP,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) IDID=2 T=TSTOP GO TO 580 555 CALL DDATRP(TN,TOUT,Y,YPRIME,NEQ, * IWORK(LKOLD),RWORK(LPHI),RWORK(LPSI)) T=TOUT IDID=3 GO TO 580 C C-------------------------------------------------------- C ALL SUCCESSFUL RETURNS FROM DDASSL ARE MADE FROM C THIS BLOCK. C-------------------------------------------------------- C 580 CONTINUE RWORK(LTN)=TN RWORK(LH)=H RETURN C C----------------------------------------------------------------------- C THIS BLOCK HANDLES ALL UNSUCCESSFUL C RETURNS OTHER THAN FOR ILLEGAL INPUT. C----------------------------------------------------------------------- C 600 CONTINUE ITEMP=-IDID GO TO (610,620,630,690,690,640,650,660,670,675, * 680,685), ITEMP C C THE MAXIMUM NUMBER OF STEPS WAS TAKEN BEFORE C REACHING TOUT 610 WRITE (XERN3, '(1P,D15.6)') TN CALL XERMSG ('SLATEC', 'DDASSL', * 'AT CURRENT T = ' // XERN3 // ' 500 STEPS TAKEN ON THIS ' // * 'CALL BEFORE REACHING TOUT', IDID, 1) GO TO 690 C C TOO MUCH ACCURACY FOR MACHINE PRECISION 620 WRITE (XERN3, '(1P,D15.6)') TN CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' TOO MUCH ACCURACY REQUESTED FOR ' // * 'PRECISION OF MACHINE. RTOL AND ATOL WERE INCREASED TO ' // * 'APPROPRIATE VALUES', IDID, 1) GO TO 690 C C WT(I) .LE. 0.0 FOR SOME I (NOT AT START OF PROBLEM) 630 WRITE (XERN3, '(1P,D15.6)') TN CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' SOME ELEMENT OF WT HAS BECOME .LE. ' // * '0.0', IDID, 1) GO TO 690 C C ERROR TEST FAILED REPEATEDLY OR WITH H=HMIN 640 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE ERROR TEST FAILED REPEATEDLY OR WITH ABS(H)=HMIN', * IDID, 1) GO TO 690 C C CORRECTOR CONVERGENCE FAILED REPEATEDLY OR WITH H=HMIN 650 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE CORRECTOR FAILED TO CONVERGE REPEATEDLY OR WITH ' // * 'ABS(H)=HMIN', IDID, 1) GO TO 690 C C THE ITERATION MATRIX IS SINGULAR 660 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE ITERATION MATRIX IS SINGULAR', IDID, 1) GO TO 690 C C CORRECTOR FAILURE PRECEEDED BY ERROR TEST FAILURES. 670 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE CORRECTOR COULD NOT CONVERGE. ALSO, THE ERROR TEST ' // * 'FAILED REPEATEDLY.', IDID, 1) GO TO 690 C C CORRECTOR FAILURE BECAUSE IRES = -1 675 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE CORRECTOR COULD NOT CONVERGE BECAUSE IRES WAS EQUAL ' // * 'TO MINUS ONE', IDID, 1) GO TO 690 C C FAILURE BECAUSE IRES = -2 680 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') H CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' IRES WAS EQUAL TO MINUS TWO', IDID, 1) GO TO 690 C C FAILED TO COMPUTE INITIAL YPRIME 685 WRITE (XERN3, '(1P,D15.6)') TN WRITE (XERN4, '(1P,D15.6)') HO CALL XERMSG ('SLATEC', 'DDASSL', * 'AT T = ' // XERN3 // ' AND STEPSIZE H = ' // XERN4 // * ' THE INITIAL YPRIME COULD NOT BE COMPUTED', IDID, 1) GO TO 690 C 690 CONTINUE INFO(1)=-1 T=TN RWORK(LTN)=TN RWORK(LH)=H RETURN C C----------------------------------------------------------------------- C THIS BLOCK HANDLES ALL ERROR RETURNS DUE C TO ILLEGAL INPUT, AS DETECTED BEFORE CALLING C DDASTP. FIRST THE ERROR MESSAGE ROUTINE IS C CALLED. IF THIS HAPPENS TWICE IN C SUCCESSION, EXECUTION IS TERMINATED C C----------------------------------------------------------------------- 701 CALL XERMSG ('SLATEC', 'DDASSL', * 'SOME ELEMENT OF INFO VECTOR IS NOT ZERO OR ONE', 1, 1) GO TO 750 C 702 WRITE (XERN1, '(I8)') NEQ CALL XERMSG ('SLATEC', 'DDASSL', * 'NEQ = ' // XERN1 // ' .LE. 0', 2, 1) GO TO 750 C 703 WRITE (XERN1, '(I8)') MXORD CALL XERMSG ('SLATEC', 'DDASSL', * 'MAXORD = ' // XERN1 // ' NOT IN RANGE', 3, 1) GO TO 750 C 704 WRITE (XERN1, '(I8)') LENRW WRITE (XERN2, '(I8)') LRW CALL XERMSG ('SLATEC', 'DDASSL', * 'RWORK LENGTH NEEDED, LENRW = ' // XERN1 // * ', EXCEEDS LRW = ' // XERN2, 4, 1) GO TO 750 C 705 WRITE (XERN1, '(I8)') LENIW WRITE (XERN2, '(I8)') LIW CALL XERMSG ('SLATEC', 'DDASSL', * 'IWORK LENGTH NEEDED, LENIW = ' // XERN1 // * ', EXCEEDS LIW = ' // XERN2, 5, 1) GO TO 750 C 706 CALL XERMSG ('SLATEC', 'DDASSL', * 'SOME ELEMENT OF RTOL IS .LT. 0', 6, 1) GO TO 750 C 707 CALL XERMSG ('SLATEC', 'DDASSL', * 'SOME ELEMENT OF ATOL IS .LT. 0', 7, 1) GO TO 750 C 708 CALL XERMSG ('SLATEC', 'DDASSL', * 'ALL ELEMENTS OF RTOL AND ATOL ARE ZERO', 8, 1) GO TO 750 C 709 WRITE (XERN3, '(1P,D15.6)') TSTOP WRITE (XERN4, '(1P,D15.6)') TOUT CALL XERMSG ('SLATEC', 'DDASSL', * 'INFO(4) = 1 AND TSTOP = ' // XERN3 // ' BEHIND TOUT = ' // * XERN4, 9, 1) GO TO 750 C 710 WRITE (XERN3, '(1P,D15.6)') HMAX CALL XERMSG ('SLATEC', 'DDASSL', * 'HMAX = ' // XERN3 // ' .LT. 0.0', 10, 1) GO TO 750 C 711 WRITE (XERN3, '(1P,D15.6)') TOUT WRITE (XERN4, '(1P,D15.6)') T CALL XERMSG ('SLATEC', 'DDASSL', * 'TOUT = ' // XERN3 // ' BEHIND T = ' // XERN4, 11, 1) GO TO 750 C 712 CALL XERMSG ('SLATEC', 'DDASSL', * 'INFO(8)=1 AND H0=0.0', 12, 1) GO TO 750 C 713 CALL XERMSG ('SLATEC', 'DDASSL', * 'SOME ELEMENT OF WT IS .LE. 0.0', 13, 1) GO TO 750 C 714 WRITE (XERN3, '(1P,D15.6)') TOUT WRITE (XERN4, '(1P,D15.6)') T CALL XERMSG ('SLATEC', 'DDASSL', * 'TOUT = ' // XERN3 // ' TOO CLOSE TO T = ' // XERN4 // * ' TO START INTEGRATION', 14, 1) GO TO 750 C 715 WRITE (XERN3, '(1P,D15.6)') TSTOP WRITE (XERN4, '(1P,D15.6)') T CALL XERMSG ('SLATEC', 'DDASSL', * 'INFO(4)=1 AND TSTOP = ' // XERN3 // ' BEHIND T = ' // XERN4, * 15, 1) GO TO 750 C 717 WRITE (XERN1, '(I8)') IWORK(LML) CALL XERMSG ('SLATEC', 'DDASSL', * 'ML = ' // XERN1 // ' ILLEGAL. EITHER .LT. 0 OR .GT. NEQ', * 17, 1) GO TO 750 C 718 WRITE (XERN1, '(I8)') IWORK(LMU) CALL XERMSG ('SLATEC', 'DDASSL', * 'MU = ' // XERN1 // ' ILLEGAL. EITHER .LT. 0 OR .GT. NEQ', * 18, 1) GO TO 750 C 719 WRITE (XERN3, '(1P,D15.6)') TOUT CALL XERMSG ('SLATEC', 'DDASSL', * 'TOUT = T = ' // XERN3, 19, 1) GO TO 750 C 750 IDID=-33 IF(INFO(1).EQ.-1) THEN CALL XERMSG ('SLATEC', 'DDASSL', * 'REPEATED OCCURRENCES OF ILLEGAL INPUT$$' // * 'RUN TERMINATED. APPARENT INFINITE LOOP', -999, 2) ENDIF C INFO(1)=-1 RETURN C-----------END OF SUBROUTINE DDASSL------------------------------------ END octave-1.1.0/libcruft/dassl/ddastp.f100666 415 17 42741 5150640255 15537 0ustar jweusers SUBROUTINE DDASTP (X, Y, YPRIME, NEQ, RES, JAC, H, WT, JSTART, + IDID, RPAR, IPAR, PHI, DELTA, E, WM, IWM, ALPHA, BETA, GAMMA, + PSI, SIGMA, CJ, CJOLD, HOLD, S, HMIN, UROUND, IPHASE, JCALC, + K, KOLD, NS, NONNEG, NTEMP) C***BEGIN PROLOGUE DDASTP C***SUBSIDIARY C***PURPOSE Perform one step of the DDASSL integration. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDASTP-S, DDASTP-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C DDASTP SOLVES A SYSTEM OF DIFFERENTIAL/ C ALGEBRAIC EQUATIONS OF THE FORM C G(X,Y,YPRIME) = 0, FOR ONE STEP (NORMALLY C FROM X TO X+H). C C THE METHODS USED ARE MODIFIED DIVIDED C DIFFERENCE,FIXED LEADING COEFFICIENT C FORMS OF BACKWARD DIFFERENTIATION C FORMULAS. THE CODE ADJUSTS THE STEPSIZE C AND ORDER TO CONTROL THE LOCAL ERROR PER C STEP. C C C THE PARAMETERS REPRESENT C X -- INDEPENDENT VARIABLE C Y -- SOLUTION VECTOR AT X C YPRIME -- DERIVATIVE OF SOLUTION VECTOR C AFTER SUCCESSFUL STEP C NEQ -- NUMBER OF EQUATIONS TO BE INTEGRATED C RES -- EXTERNAL USER-SUPPLIED SUBROUTINE C TO EVALUATE THE RESIDUAL. THE CALL IS C CALL RES(X,Y,YPRIME,DELTA,IRES,RPAR,IPAR) C X,Y,YPRIME ARE INPUT. DELTA IS OUTPUT. C ON INPUT, IRES=0. RES SHOULD ALTER IRES ONLY C IF IT ENCOUNTERS AN ILLEGAL VALUE OF Y OR A C STOP CONDITION. SET IRES=-1 IF AN INPUT VALUE C OF Y IS ILLEGAL, AND DDASTP WILL TRY TO SOLVE C THE PROBLEM WITHOUT GETTING IRES = -1. IF C IRES=-2, DDASTP RETURNS CONTROL TO THE CALLING C PROGRAM WITH IDID = -11. C JAC -- EXTERNAL USER-SUPPLIED ROUTINE TO EVALUATE C THE ITERATION MATRIX (THIS IS OPTIONAL) C THE CALL IS OF THE FORM C CALL JAC(X,Y,YPRIME,PD,CJ,RPAR,IPAR) C PD IS THE MATRIX OF PARTIAL DERIVATIVES, C PD=DG/DY+CJ*DG/DYPRIME C H -- APPROPRIATE STEP SIZE FOR NEXT STEP. C NORMALLY DETERMINED BY THE CODE C WT -- VECTOR OF WEIGHTS FOR ERROR CRITERION. C JSTART -- INTEGER VARIABLE SET 0 FOR C FIRST STEP, 1 OTHERWISE. C IDID -- COMPLETION CODE WITH THE FOLLOWING MEANINGS: C IDID= 1 -- THE STEP WAS COMPLETED SUCCESSFULLY C IDID=-6 -- THE ERROR TEST FAILED REPEATEDLY C IDID=-7 -- THE CORRECTOR COULD NOT CONVERGE C IDID=-8 -- THE ITERATION MATRIX IS SINGULAR C IDID=-9 -- THE CORRECTOR COULD NOT CONVERGE. C THERE WERE REPEATED ERROR TEST C FAILURES ON THIS STEP. C IDID=-10-- THE CORRECTOR COULD NOT CONVERGE C BECAUSE IRES WAS EQUAL TO MINUS ONE C IDID=-11-- IRES EQUAL TO -2 WAS ENCOUNTERED, C AND CONTROL IS BEING RETURNED TO C THE CALLING PROGRAM C RPAR,IPAR -- REAL AND INTEGER PARAMETER ARRAYS THAT C ARE USED FOR COMMUNICATION BETWEEN THE C CALLING PROGRAM AND EXTERNAL USER ROUTINES C THEY ARE NOT ALTERED BY DDASTP C PHI -- ARRAY OF DIVIDED DIFFERENCES USED BY C DDASTP. THE LENGTH IS NEQ*(K+1),WHERE C K IS THE MAXIMUM ORDER C DELTA,E -- WORK VECTORS FOR DDASTP OF LENGTH NEQ C WM,IWM -- REAL AND INTEGER ARRAYS STORING C MATRIX INFORMATION SUCH AS THE MATRIX C OF PARTIAL DERIVATIVES,PERMUTATION C VECTOR,AND VARIOUS OTHER INFORMATION. C C THE OTHER PARAMETERS ARE INFORMATION C WHICH IS NEEDED INTERNALLY BY DDASTP TO C CONTINUE FROM STEP TO STEP. C C----------------------------------------------------------------------- C***ROUTINES CALLED DDAJAC, DDANRM, DDASLV, DDATRP C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C***END PROLOGUE DDASTP C INTEGER NEQ, JSTART, IDID, IPAR(*), IWM(*), IPHASE, JCALC, K, * KOLD, NS, NONNEG, NTEMP DOUBLE PRECISION * X, Y(*), YPRIME(*), H, WT(*), RPAR(*), PHI(NEQ,*), DELTA(*), * E(*), WM(*), ALPHA(*), BETA(*), GAMMA(*), PSI(*), SIGMA(*), CJ, * CJOLD, HOLD, S, HMIN, UROUND EXTERNAL RES, JAC C EXTERNAL DDAJAC, DDANRM, DDASLV, DDATRP DOUBLE PRECISION DDANRM C INTEGER I, IER, IRES, J, J1, KDIFF, KM1, KNEW, KP1, KP2, LCTF, * LETF, LMXORD, LNJE, LNRE, LNST, M, MAXIT, NCF, NEF, NSF, NSP1 DOUBLE PRECISION * ALPHA0, ALPHAS, CJLAST, CK, DELNRM, ENORM, ERK, ERKM1, * ERKM2, ERKP1, ERR, EST, HNEW, OLDNRM, PNORM, R, RATE, TEMP1, * TEMP2, TERK, TERKM1, TERKM2, TERKP1, XOLD, XRATE LOGICAL CONVGD C PARAMETER (LMXORD=3) PARAMETER (LNST=11) PARAMETER (LNRE=12) PARAMETER (LNJE=13) PARAMETER (LETF=14) PARAMETER (LCTF=15) C DATA MAXIT/4/ DATA XRATE/0.25D0/ C C C C C C----------------------------------------------------------------------- C BLOCK 1. C INITIALIZE. ON THE FIRST CALL,SET C THE ORDER TO 1 AND INITIALIZE C OTHER VARIABLES. C----------------------------------------------------------------------- C C INITIALIZATIONS FOR ALL CALLS C***FIRST EXECUTABLE STATEMENT DDASTP IDID=1 XOLD=X NCF=0 NSF=0 NEF=0 IF(JSTART .NE. 0) GO TO 120 C C IF THIS IS THE FIRST STEP,PERFORM C OTHER INITIALIZATIONS IWM(LETF) = 0 IWM(LCTF) = 0 K=1 KOLD=0 HOLD=0.0D0 JSTART=1 PSI(1)=H CJOLD = 1.0D0/H CJ = CJOLD S = 100.D0 JCALC = -1 DELNRM=1.0D0 IPHASE = 0 NS=0 120 CONTINUE C C C C C C----------------------------------------------------------------------- C BLOCK 2 C COMPUTE COEFFICIENTS OF FORMULAS FOR C THIS STEP. C----------------------------------------------------------------------- 200 CONTINUE KP1=K+1 KP2=K+2 KM1=K-1 XOLD=X IF(H.NE.HOLD.OR.K .NE. KOLD) NS = 0 NS=MIN(NS+1,KOLD+2) NSP1=NS+1 IF(KP1 .LT. NS)GO TO 230 C BETA(1)=1.0D0 ALPHA(1)=1.0D0 TEMP1=H GAMMA(1)=0.0D0 SIGMA(1)=1.0D0 DO 210 I=2,KP1 TEMP2=PSI(I-1) PSI(I-1)=TEMP1 BETA(I)=BETA(I-1)*PSI(I-1)/TEMP2 TEMP1=TEMP2+H ALPHA(I)=H/TEMP1 SIGMA(I)=(I-1)*SIGMA(I-1)*ALPHA(I) GAMMA(I)=GAMMA(I-1)+ALPHA(I-1)/H 210 CONTINUE PSI(KP1)=TEMP1 230 CONTINUE C C COMPUTE ALPHAS, ALPHA0 ALPHAS = 0.0D0 ALPHA0 = 0.0D0 DO 240 I = 1,K ALPHAS = ALPHAS - 1.0D0/I ALPHA0 = ALPHA0 - ALPHA(I) 240 CONTINUE C C COMPUTE LEADING COEFFICIENT CJ CJLAST = CJ CJ = -ALPHAS/H C C COMPUTE VARIABLE STEPSIZE ERROR COEFFICIENT CK CK = ABS(ALPHA(KP1) + ALPHAS - ALPHA0) CK = MAX(CK,ALPHA(KP1)) C C DECIDE WHETHER NEW JACOBIAN IS NEEDED TEMP1 = (1.0D0 - XRATE)/(1.0D0 + XRATE) TEMP2 = 1.0D0/TEMP1 IF (CJ/CJOLD .LT. TEMP1 .OR. CJ/CJOLD .GT. TEMP2) JCALC = -1 IF (CJ .NE. CJLAST) S = 100.D0 C C CHANGE PHI TO PHI STAR IF(KP1 .LT. NSP1) GO TO 280 DO 270 J=NSP1,KP1 DO 260 I=1,NEQ 260 PHI(I,J)=BETA(J)*PHI(I,J) 270 CONTINUE 280 CONTINUE C C UPDATE TIME X=X+H C C C C C C----------------------------------------------------------------------- C BLOCK 3 C PREDICT THE SOLUTION AND DERIVATIVE, C AND SOLVE THE CORRECTOR EQUATION C----------------------------------------------------------------------- C C FIRST,PREDICT THE SOLUTION AND DERIVATIVE 300 CONTINUE DO 310 I=1,NEQ Y(I)=PHI(I,1) 310 YPRIME(I)=0.0D0 DO 330 J=2,KP1 DO 320 I=1,NEQ Y(I)=Y(I)+PHI(I,J) 320 YPRIME(I)=YPRIME(I)+GAMMA(J)*PHI(I,J) 330 CONTINUE PNORM = DDANRM (NEQ,Y,WT,RPAR,IPAR) C C C C SOLVE THE CORRECTOR EQUATION USING A C MODIFIED NEWTON SCHEME. CONVGD= .TRUE. M=0 IWM(LNRE)=IWM(LNRE)+1 IRES = 0 CALL RES(X,Y,YPRIME,DELTA,IRES,RPAR,IPAR) IF (IRES .LT. 0) GO TO 380 C C C IF INDICATED,REEVALUATE THE C ITERATION MATRIX PD = DG/DY + CJ*DG/DYPRIME C (WHERE G(X,Y,YPRIME)=0). SET C JCALC TO 0 AS AN INDICATOR THAT C THIS HAS BEEN DONE. IF(JCALC .NE. -1)GO TO 340 IWM(LNJE)=IWM(LNJE)+1 JCALC=0 CALL DDAJAC(NEQ,X,Y,YPRIME,DELTA,CJ,H, * IER,WT,E,WM,IWM,RES,IRES,UROUND,JAC,RPAR, * IPAR,NTEMP) CJOLD=CJ S = 100.D0 IF (IRES .LT. 0) GO TO 380 IF(IER .NE. 0)GO TO 380 NSF=0 C C C INITIALIZE THE ERROR ACCUMULATION VECTOR E. 340 CONTINUE DO 345 I=1,NEQ 345 E(I)=0.0D0 C C C CORRECTOR LOOP. 350 CONTINUE C C MULTIPLY RESIDUAL BY TEMP1 TO ACCELERATE CONVERGENCE TEMP1 = 2.0D0/(1.0D0 + CJ/CJOLD) DO 355 I = 1,NEQ 355 DELTA(I) = DELTA(I) * TEMP1 C C COMPUTE A NEW ITERATE (BACK-SUBSTITUTION). C STORE THE CORRECTION IN DELTA. CALL DDASLV(NEQ,DELTA,WM,IWM) C C UPDATE Y,E,AND YPRIME DO 360 I=1,NEQ Y(I)=Y(I)-DELTA(I) E(I)=E(I)-DELTA(I) 360 YPRIME(I)=YPRIME(I)-CJ*DELTA(I) C C TEST FOR CONVERGENCE OF THE ITERATION DELNRM=DDANRM(NEQ,DELTA,WT,RPAR,IPAR) IF (DELNRM .LE. 100.D0*UROUND*PNORM) GO TO 375 IF (M .GT. 0) GO TO 365 OLDNRM = DELNRM GO TO 367 365 RATE = (DELNRM/OLDNRM)**(1.0D0/M) IF (RATE .GT. 0.90D0) GO TO 370 S = RATE/(1.0D0 - RATE) 367 IF (S*DELNRM .LE. 0.33D0) GO TO 375 C C THE CORRECTOR HAS NOT YET CONVERGED. C UPDATE M AND TEST WHETHER THE C MAXIMUM NUMBER OF ITERATIONS HAVE C BEEN TRIED. M=M+1 IF(M.GE.MAXIT)GO TO 370 C C EVALUATE THE RESIDUAL C AND GO BACK TO DO ANOTHER ITERATION IWM(LNRE)=IWM(LNRE)+1 IRES = 0 CALL RES(X,Y,YPRIME,DELTA,IRES, * RPAR,IPAR) IF (IRES .LT. 0) GO TO 380 GO TO 350 C C C THE CORRECTOR FAILED TO CONVERGE IN MAXIT C ITERATIONS. IF THE ITERATION MATRIX C IS NOT CURRENT,RE-DO THE STEP WITH C A NEW ITERATION MATRIX. 370 CONTINUE IF(JCALC.EQ.0)GO TO 380 JCALC=-1 GO TO 300 C C C THE ITERATION HAS CONVERGED. IF NONNEGATIVITY OF SOLUTION IS C REQUIRED, SET THE SOLUTION NONNEGATIVE, IF THE PERTURBATION C TO DO IT IS SMALL ENOUGH. IF THE CHANGE IS TOO LARGE, THEN C CONSIDER THE CORRECTOR ITERATION TO HAVE FAILED. 375 IF(NONNEG .EQ. 0) GO TO 390 DO 377 I = 1,NEQ 377 DELTA(I) = MIN(Y(I),0.0D0) DELNRM = DDANRM(NEQ,DELTA,WT,RPAR,IPAR) IF(DELNRM .GT. 0.33D0) GO TO 380 DO 378 I = 1,NEQ 378 E(I) = E(I) - DELTA(I) GO TO 390 C C C EXITS FROM BLOCK 3 C NO CONVERGENCE WITH CURRENT ITERATION C MATRIX,OR SINGULAR ITERATION MATRIX 380 CONVGD= .FALSE. 390 JCALC = 1 IF(.NOT.CONVGD)GO TO 600 C C C C C C----------------------------------------------------------------------- C BLOCK 4 C ESTIMATE THE ERRORS AT ORDERS K,K-1,K-2 C AS IF CONSTANT STEPSIZE WAS USED. ESTIMATE C THE LOCAL ERROR AT ORDER K AND TEST C WHETHER THE CURRENT STEP IS SUCCESSFUL. C----------------------------------------------------------------------- C C ESTIMATE ERRORS AT ORDERS K,K-1,K-2 ENORM = DDANRM(NEQ,E,WT,RPAR,IPAR) ERK = SIGMA(K+1)*ENORM TERK = (K+1)*ERK EST = ERK KNEW=K IF(K .EQ. 1)GO TO 430 DO 405 I = 1,NEQ 405 DELTA(I) = PHI(I,KP1) + E(I) ERKM1=SIGMA(K)*DDANRM(NEQ,DELTA,WT,RPAR,IPAR) TERKM1 = K*ERKM1 IF(K .GT. 2)GO TO 410 IF(TERKM1 .LE. 0.5D0*TERK)GO TO 420 GO TO 430 410 CONTINUE DO 415 I = 1,NEQ 415 DELTA(I) = PHI(I,K) + DELTA(I) ERKM2=SIGMA(K-1)*DDANRM(NEQ,DELTA,WT,RPAR,IPAR) TERKM2 = (K-1)*ERKM2 IF(MAX(TERKM1,TERKM2).GT.TERK)GO TO 430 C LOWER THE ORDER 420 CONTINUE KNEW=K-1 EST = ERKM1 C C C CALCULATE THE LOCAL ERROR FOR THE CURRENT STEP C TO SEE IF THE STEP WAS SUCCESSFUL 430 CONTINUE ERR = CK * ENORM IF(ERR .GT. 1.0D0)GO TO 600 C C C C C C----------------------------------------------------------------------- C BLOCK 5 C THE STEP IS SUCCESSFUL. DETERMINE C THE BEST ORDER AND STEPSIZE FOR C THE NEXT STEP. UPDATE THE DIFFERENCES C FOR THE NEXT STEP. C----------------------------------------------------------------------- IDID=1 IWM(LNST)=IWM(LNST)+1 KDIFF=K-KOLD KOLD=K HOLD=H C C C ESTIMATE THE ERROR AT ORDER K+1 UNLESS: C ALREADY DECIDED TO LOWER ORDER, OR C ALREADY USING MAXIMUM ORDER, OR C STEPSIZE NOT CONSTANT, OR C ORDER RAISED IN PREVIOUS STEP IF(KNEW.EQ.KM1.OR.K.EQ.IWM(LMXORD))IPHASE=1 IF(IPHASE .EQ. 0)GO TO 545 IF(KNEW.EQ.KM1)GO TO 540 IF(K.EQ.IWM(LMXORD)) GO TO 550 IF(KP1.GE.NS.OR.KDIFF.EQ.1)GO TO 550 DO 510 I=1,NEQ 510 DELTA(I)=E(I)-PHI(I,KP2) ERKP1 = (1.0D0/(K+2))*DDANRM(NEQ,DELTA,WT,RPAR,IPAR) TERKP1 = (K+2)*ERKP1 IF(K.GT.1)GO TO 520 IF(TERKP1.GE.0.5D0*TERK)GO TO 550 GO TO 530 520 IF(TERKM1.LE.MIN(TERK,TERKP1))GO TO 540 IF(TERKP1.GE.TERK.OR.K.EQ.IWM(LMXORD))GO TO 550 C C RAISE ORDER 530 K=KP1 EST = ERKP1 GO TO 550 C C LOWER ORDER 540 K=KM1 EST = ERKM1 GO TO 550 C C IF IPHASE = 0, INCREASE ORDER BY ONE AND MULTIPLY STEPSIZE BY C FACTOR TWO 545 K = KP1 HNEW = H*2.0D0 H = HNEW GO TO 575 C C C DETERMINE THE APPROPRIATE STEPSIZE FOR C THE NEXT STEP. 550 HNEW=H TEMP2=K+1 R=(2.0D0*EST+0.0001D0)**(-1.0D0/TEMP2) IF(R .LT. 2.0D0) GO TO 555 HNEW = 2.0D0*H GO TO 560 555 IF(R .GT. 1.0D0) GO TO 560 R = MAX(0.5D0,MIN(0.9D0,R)) HNEW = H*R 560 H=HNEW C C C UPDATE DIFFERENCES FOR NEXT STEP 575 CONTINUE IF(KOLD.EQ.IWM(LMXORD))GO TO 585 DO 580 I=1,NEQ 580 PHI(I,KP2)=E(I) 585 CONTINUE DO 590 I=1,NEQ 590 PHI(I,KP1)=PHI(I,KP1)+E(I) DO 595 J1=2,KP1 J=KP1-J1+1 DO 595 I=1,NEQ 595 PHI(I,J)=PHI(I,J)+PHI(I,J+1) RETURN C C C C C C----------------------------------------------------------------------- C BLOCK 6 C THE STEP IS UNSUCCESSFUL. RESTORE X,PSI,PHI C DETERMINE APPROPRIATE STEPSIZE FOR C CONTINUING THE INTEGRATION, OR EXIT WITH C AN ERROR FLAG IF THERE HAVE BEEN MANY C FAILURES. C----------------------------------------------------------------------- 600 IPHASE = 1 C C RESTORE X,PHI,PSI X=XOLD IF(KP1.LT.NSP1)GO TO 630 DO 620 J=NSP1,KP1 TEMP1=1.0D0/BETA(J) DO 610 I=1,NEQ 610 PHI(I,J)=TEMP1*PHI(I,J) 620 CONTINUE 630 CONTINUE DO 640 I=2,KP1 640 PSI(I-1)=PSI(I)-H C C C TEST WHETHER FAILURE IS DUE TO CORRECTOR ITERATION C OR ERROR TEST IF(CONVGD)GO TO 660 IWM(LCTF)=IWM(LCTF)+1 C C C THE NEWTON ITERATION FAILED TO CONVERGE WITH C A CURRENT ITERATION MATRIX. DETERMINE THE CAUSE C OF THE FAILURE AND TAKE APPROPRIATE ACTION. IF(IER.EQ.0)GO TO 650 C C THE ITERATION MATRIX IS SINGULAR. REDUCE C THE STEPSIZE BY A FACTOR OF 4. IF C THIS HAPPENS THREE TIMES IN A ROW ON C THE SAME STEP, RETURN WITH AN ERROR FLAG NSF=NSF+1 R = 0.25D0 H=H*R IF (NSF .LT. 3 .AND. ABS(H) .GE. HMIN) GO TO 690 IDID=-8 GO TO 675 C C C THE NEWTON ITERATION FAILED TO CONVERGE FOR A REASON C OTHER THAN A SINGULAR ITERATION MATRIX. IF IRES = -2, THEN C RETURN. OTHERWISE, REDUCE THE STEPSIZE AND TRY AGAIN, UNLESS C TOO MANY FAILURES HAVE OCCURED. 650 CONTINUE IF (IRES .GT. -2) GO TO 655 IDID = -11 GO TO 675 655 NCF = NCF + 1 R = 0.25D0 H = H*R IF (NCF .LT. 10 .AND. ABS(H) .GE. HMIN) GO TO 690 IDID = -7 IF (IRES .LT. 0) IDID = -10 IF (NEF .GE. 3) IDID = -9 GO TO 675 C C C THE NEWTON SCHEME CONVERGED,AND THE CAUSE C OF THE FAILURE WAS THE ERROR ESTIMATE C EXCEEDING THE TOLERANCE. 660 NEF=NEF+1 IWM(LETF)=IWM(LETF)+1 IF (NEF .GT. 1) GO TO 665 C C ON FIRST ERROR TEST FAILURE, KEEP CURRENT ORDER OR LOWER C ORDER BY ONE. COMPUTE NEW STEPSIZE BASED ON DIFFERENCES C OF THE SOLUTION. K = KNEW TEMP2 = K + 1 R = 0.90D0*(2.0D0*EST+0.0001D0)**(-1.0D0/TEMP2) R = MAX(0.25D0,MIN(0.9D0,R)) H = H*R IF (ABS(H) .GE. HMIN) GO TO 690 IDID = -6 GO TO 675 C C ON SECOND ERROR TEST FAILURE, USE THE CURRENT ORDER OR C DECREASE ORDER BY ONE. REDUCE THE STEPSIZE BY A FACTOR OF C FOUR. 665 IF (NEF .GT. 2) GO TO 670 K = KNEW H = 0.25D0*H IF (ABS(H) .GE. HMIN) GO TO 690 IDID = -6 GO TO 675 C C ON THIRD AND SUBSEQUENT ERROR TEST FAILURES, SET THE ORDER TO C ONE AND REDUCE THE STEPSIZE BY A FACTOR OF FOUR. 670 K = 1 H = 0.25D0*H IF (ABS(H) .GE. HMIN) GO TO 690 IDID = -6 GO TO 675 C C C C C FOR ALL CRASHES, RESTORE Y TO ITS LAST VALUE, C INTERPOLATE TO FIND YPRIME AT LAST X, AND RETURN 675 CONTINUE CALL DDATRP(X,X,Y,YPRIME,NEQ,K,PHI,PSI) RETURN C C C GO BACK AND TRY THIS STEP AGAIN 690 GO TO 200 C C------END OF SUBROUTINE DDASTP------ END octave-1.1.0/libcruft/dassl/ddatrp.f100666 415 17 4356 5150640255 15516 0ustar jweusers SUBROUTINE DDATRP (X, XOUT, YOUT, YPOUT, NEQ, KOLD, PHI, PSI) C***BEGIN PROLOGUE DDATRP C***SUBSIDIARY C***PURPOSE Interpolation routine for DDASSL. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDATRP-S, DDATRP-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C THE METHODS IN SUBROUTINE DDASTP USE POLYNOMIALS C TO APPROXIMATE THE SOLUTION. DDATRP APPROXIMATES THE C SOLUTION AND ITS DERIVATIVE AT TIME XOUT BY EVALUATING C ONE OF THESE POLYNOMIALS,AND ITS DERIVATIVE,THERE. C INFORMATION DEFINING THIS POLYNOMIAL IS PASSED FROM C DDASTP, SO DDATRP CANNOT BE USED ALONE. C C THE PARAMETERS ARE: C X THE CURRENT TIME IN THE INTEGRATION. C XOUT THE TIME AT WHICH THE SOLUTION IS DESIRED C YOUT THE INTERPOLATED APPROXIMATION TO Y AT XOUT C (THIS IS OUTPUT) C YPOUT THE INTERPOLATED APPROXIMATION TO YPRIME AT XOUT C (THIS IS OUTPUT) C NEQ NUMBER OF EQUATIONS C KOLD ORDER USED ON LAST SUCCESSFUL STEP C PHI ARRAY OF SCALED DIVIDED DIFFERENCES OF Y C PSI ARRAY OF PAST STEPSIZE HISTORY C----------------------------------------------------------------------- C***ROUTINES CALLED (NONE) C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C***END PROLOGUE DDATRP C INTEGER NEQ, KOLD DOUBLE PRECISION X, XOUT, YOUT(*), YPOUT(*), PHI(NEQ,*), PSI(*) C INTEGER I, J, KOLDP1 DOUBLE PRECISION C, D, GAMMA, TEMP1 C C***FIRST EXECUTABLE STATEMENT DDATRP KOLDP1=KOLD+1 TEMP1=XOUT-X DO 10 I=1,NEQ YOUT(I)=PHI(I,1) 10 YPOUT(I)=0.0D0 C=1.0D0 D=0.0D0 GAMMA=TEMP1/PSI(1) DO 30 J=2,KOLDP1 D=D*GAMMA+C/PSI(J-1) C=C*GAMMA GAMMA=(TEMP1+PSI(J-1))/PSI(J) DO 20 I=1,NEQ YOUT(I)=YOUT(I)+C*PHI(I,J) 20 YPOUT(I)=YPOUT(I)+D*PHI(I,J) 30 CONTINUE RETURN C C------END OF SUBROUTINE DDATRP------ END octave-1.1.0/libcruft/dassl/ddawts.f100666 415 17 2720 5150640255 15517 0ustar jweusers SUBROUTINE DDAWTS (NEQ, IWT, RTOL, ATOL, Y, WT, RPAR, IPAR) C***BEGIN PROLOGUE DDAWTS C***SUBSIDIARY C***PURPOSE Set error weight vector for DDASSL. C***LIBRARY SLATEC (DASSL) C***TYPE DOUBLE PRECISION (SDAWTS-S, DDAWTS-D) C***AUTHOR PETZOLD, LINDA R., (LLNL) C***DESCRIPTION C----------------------------------------------------------------------- C THIS SUBROUTINE SETS THE ERROR WEIGHT VECTOR C WT ACCORDING TO WT(I)=RTOL(I)*ABS(Y(I))+ATOL(I), C I=1,-,N. C RTOL AND ATOL ARE SCALARS IF IWT = 0, C AND VECTORS IF IWT = 1. C----------------------------------------------------------------------- C***ROUTINES CALLED (NONE) C***REVISION HISTORY (YYMMDD) C 830315 DATE WRITTEN C 901009 Finished conversion to SLATEC 4.0 format (F.N.Fritsch) C 901019 Merged changes made by C. Ulrich with SLATEC 4.0 format. C 901026 Added explicit declarations for all variables and minor C cosmetic changes to prologue. (FNF) C***END PROLOGUE DDAWTS C INTEGER NEQ, IWT, IPAR(*) DOUBLE PRECISION RTOL(*), ATOL(*), Y(*), WT(*), RPAR(*) C INTEGER I DOUBLE PRECISION ATOLI, RTOLI C C***FIRST EXECUTABLE STATEMENT DDAWTS RTOLI=RTOL(1) ATOLI=ATOL(1) DO 20 I=1,NEQ IF (IWT .EQ.0) GO TO 10 RTOLI=RTOL(I) ATOLI=ATOL(I) 10 WT(I)=RTOLI*ABS(Y(I))+ATOLI 20 CONTINUE RETURN C-----------END OF SUBROUTINE DDAWTS------------------------------------ END octave-1.1.0/libcruft/dassl/dpotf2.f100666 415 17 11413 5462061777 15462 0ustar jweusers SUBROUTINE DPOTF2( UPLO, N, A, LDA, INFO ) * * -- LAPACK routine (version 1.0) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DPOTF2 computes the Cholesky factorization of a real symmetric * positive definite matrix A. * * The factorization has the form * A = U' * U , if UPLO = 'U', or * A = L * L', if UPLO = 'L', * where U is an upper triangular matrix and L is lower triangular. * * This is the unblocked version of the algorithm, calling Level 2 BLAS. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies whether the upper or lower triangular part of the * symmetric matrix A is stored. * = 'U': Upper triangular * = 'L': Lower triangular * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the symmetric matrix A. If UPLO = 'U', the leading * n by n upper triangular part of A contains the upper * triangular part of the matrix A, and the strictly lower * triangular part of A is not referenced. If UPLO = 'L', the * leading n by n lower triangular part of A contains the lower * triangular part of the matrix A, and the strictly upper * triangular part of A is not referenced. * * On exit, if INFO = 0, the factor U or L from the Cholesky * factorization A = U'*U or A = L*L'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, the leading minor of order k is not * positive definite, and the factorization could not be * completed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. LOGICAL UPPER INTEGER J DOUBLE PRECISION AJJ * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DDOT EXTERNAL LSAME, DDOT * .. * .. External Subroutines .. EXTERNAL DGEMV, DSCAL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, SQRT * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 UPPER = LSAME( UPLO, 'U' ) IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DPOTF2', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * IF( UPPER ) THEN * * Compute the Cholesky factorization A = U'*U. * DO 10 J = 1, N * * Compute U(J,J) and test for non-positive-definiteness. * AJJ = A( J, J ) - DDOT( J-1, A( 1, J ), 1, A( 1, J ), 1 ) IF( AJJ.LE.ZERO ) THEN A( J, J ) = AJJ GO TO 30 END IF AJJ = SQRT( AJJ ) A( J, J ) = AJJ * * Compute elements J+1:N of row J. * IF( J.LT.N ) THEN CALL DGEMV( 'Transpose', J-1, N-J, -ONE, A( 1, J+1 ), $ LDA, A( 1, J ), 1, ONE, A( J, J+1 ), LDA ) CALL DSCAL( N-J, ONE / AJJ, A( J, J+1 ), LDA ) END IF 10 CONTINUE ELSE * * Compute the Cholesky factorization A = L*L'. * DO 20 J = 1, N * * Compute L(J,J) and test for non-positive-definiteness. * AJJ = A( J, J ) - DDOT( J-1, A( J, 1 ), LDA, A( J, 1 ), $ LDA ) IF( AJJ.LE.ZERO ) THEN A( J, J ) = AJJ GO TO 30 END IF AJJ = SQRT( AJJ ) A( J, J ) = AJJ * * Compute elements J+1:N of column J. * IF( J.LT.N ) THEN CALL DGEMV( 'No transpose', N-J, J-1, -ONE, A( J+1, 1 ), $ LDA, A( J, 1 ), LDA, ONE, A( J+1, J ), 1 ) CALL DSCAL( N-J, ONE / AJJ, A( J+1, J ), 1 ) END IF 20 CONTINUE END IF GO TO 40 * 30 CONTINUE INFO = J * 40 CONTINUE RETURN * * End of DPOTF2 * END octave-1.1.0/libcruft/dassl/dpotrf.f100666 415 17 13206 5462061761 15555 0ustar jweusers SUBROUTINE DPOTRF( UPLO, N, A, LDA, INFO ) * * -- LAPACK routine (version 1.0) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DPOTRF computes the Cholesky factorization of a real symmetric * positive definite matrix A. * * The factorization has the form * A = U' * U , if UPLO = 'U', or * A = L * L', if UPLO = 'L', * where U is an upper triangular matrix and L is lower triangular. * * This is the block version of the algorithm, calling Level 3 BLAS. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies whether the upper or lower triangular part of the * symmetric matrix A is stored. * = 'U': Upper triangular * = 'L': Lower triangular * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the symmetric matrix A. If UPLO = 'U', the leading * n by n upper triangular part of A contains the upper * triangular part of the matrix A, and the strictly lower * triangular part of A is not referenced. If UPLO = 'L', the * leading n by n lower triangular part of A contains the lower * triangular part of the matrix A, and the strictly upper * triangular part of A is not referenced. * * On exit, if INFO = 0, the factor U or L from the Cholesky * factorization A = U'*U or A = L*L'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, the leading minor of order k is not * positive definite, and the factorization could not be * completed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL UPPER INTEGER J, JB, NB * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL DGEMM, DPOTF2, DSYRK, DTRSM, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 UPPER = LSAME( UPLO, 'U' ) IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DPOTRF', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * * Determine the block size for this environment. * NB = ILAENV( 1, 'DPOTRF', UPLO, N, -1, -1, -1 ) IF( NB.LE.1 .OR. NB.GE.N ) THEN * * Use unblocked code. * CALL DPOTF2( UPLO, N, A, LDA, INFO ) ELSE * * Use blocked code. * IF( UPPER ) THEN * * Compute the Cholesky factorization A = U'*U. * DO 10 J = 1, N, NB * * Update and factorize the current diagonal block and test * for non-positive-definiteness. * JB = MIN( NB, N-J+1 ) CALL DSYRK( 'Upper', 'Transpose', JB, J-1, -ONE, $ A( 1, J ), LDA, ONE, A( J, J ), LDA ) CALL DPOTF2( 'Upper', JB, A( J, J ), LDA, INFO ) IF( INFO.NE.0 ) $ GO TO 30 IF( J+JB.LE.N ) THEN * * Compute the current block row. * CALL DGEMM( 'Transpose', 'No transpose', JB, N-J-JB+1, $ J-1, -ONE, A( 1, J ), LDA, A( 1, J+JB ), $ LDA, ONE, A( J, J+JB ), LDA ) CALL DTRSM( 'Left', 'Upper', 'Transpose', 'Non-unit', $ JB, N-J-JB+1, ONE, A( J, J ), LDA, $ A( J, J+JB ), LDA ) END IF 10 CONTINUE * ELSE * * Compute the Cholesky factorization A = L*L'. * DO 20 J = 1, N, NB * * Update and factorize the current diagonal block and test * for non-positive-definiteness. * JB = MIN( NB, N-J+1 ) CALL DSYRK( 'Lower', 'No transpose', JB, J-1, -ONE, $ A( J, 1 ), LDA, ONE, A( J, J ), LDA ) CALL DPOTF2( 'Lower', JB, A( J, J ), LDA, INFO ) IF( INFO.NE.0 ) $ GO TO 30 IF( J+JB.LE.N ) THEN * * Compute the current block column. * CALL DGEMM( 'No transpose', 'Transpose', N-J-JB+1, JB, $ J-1, -ONE, A( J+JB, 1 ), LDA, A( J, 1 ), $ LDA, ONE, A( J+JB, J ), LDA ) CALL DTRSM( 'Right', 'Lower', 'Transpose', 'Non-unit', $ N-J-JB+1, JB, ONE, A( J, J ), LDA, $ A( J+JB, J ), LDA ) END IF 20 CONTINUE END IF END IF GO TO 40 * 30 CONTINUE INFO = INFO + J - 1 * 40 CONTINUE RETURN * * End of DPOTRF * END octave-1.1.0/libcruft/dassl/xerhlt.f100666 415 17 2454 5404714124 15542 0ustar jweusers SUBROUTINE XERHLT (MESSG) C***BEGIN PROLOGUE XERHLT C***SUBSIDIARY C***PURPOSE Abort program execution and print error message. C***LIBRARY SLATEC (XERROR) C***CATEGORY R3C C***TYPE ALL (XERHLT-A) C***KEYWORDS ERROR, XERROR C***AUTHOR JONES, R. E., (SNLA) C***DESCRIPTION C C Abstract C ***Note*** machine dependent routine C XERHLT aborts the execution of the program. C The error message causing the abort is given in the calling C sequence, in case one needs it for printing on a dayfile, C for example. C C Description of Parameters C MESSG is as in XERROR. C C***REFERENCES JONES R.E., KAHANER D.K., 'XERROR, THE SLATEC ERROR- C HANDLING PACKAGE', SAND82-0800, SANDIA LABORATORIES, C 1982. C***ROUTINES CALLED (NONE) C***REVISION HISTORY (YYMMDD) C 790801 DATE WRITTEN as XERABT C 861211 REVISION DATE from Version 3.2 C 891214 Prologue converted to Version 4.0 format. (BAB) C 900206 Routine changed from user-callable to subsidiary. (WRB) C 900510 Changed calling sequence to delete length of char string C Changed subroutine name from XERABT to XERHLT. (RWC) C***END PROLOGUE XERHLT CHARACTER*(*) MESSG C***FIRST EXECUTABLE STATEMENT XERHLT CALL XSTOPX (MESSG) END octave-1.1.0/libcruft/dassl/xermsg.f100666 415 17 33615 5150640256 15566 0ustar jweusersC*DECK XERMSG SUBROUTINE XERMSG (LIBRAR, SUBROU, MESSG, NERR, LEVEL) C***BEGIN PROLOGUE XERMSG C***PURPOSE Processes error messages for SLATEC and other libraries C***LIBRARY SLATEC C***CATEGORY R3C C***TYPE ALL C***KEYWORDS ERROR MESSAGE, XERROR C***AUTHOR FONG, KIRBY, (NMFECC AT LLNL) C Modified by C FRITSCH, F. N., (LLNL) C***DESCRIPTION C C XERMSG processes a diagnostic message in a manner determined by the C value of LEVEL and the current value of the library error control C flag, KONTRL. See subroutine XSETF for details. C (XSETF is inoperable in this version.). C C LIBRAR A character constant (or character variable) with the name C of the library. This will be 'SLATEC' for the SLATEC C Common Math Library. The error handling package is C general enough to be used by many libraries C simultaneously, so it is desirable for the routine that C detects and reports an error to identify the library name C as well as the routine name. C C SUBROU A character constant (or character variable) with the name C of the routine that detected the error. Usually it is the C name of the routine that is calling XERMSG. There are C some instances where a user callable library routine calls C lower level subsidiary routines where the error is C detected. In such cases it may be more informative to C supply the name of the routine the user called rather than C the name of the subsidiary routine that detected the C error. C C MESSG A character constant (or character variable) with the text C of the error or warning message. In the example below, C the message is a character constant that contains a C generic message. C C CALL XERMSG ('SLATEC', 'MMPY', C *'THE ORDER OF THE MATRIX EXCEEDS THE ROW DIMENSION', C *3, 1) C C It is possible (and is sometimes desirable) to generate a C specific message--e.g., one that contains actual numeric C values. Specific numeric values can be converted into C character strings using formatted WRITE statements into C character variables. This is called standard Fortran C internal file I/O and is exemplified in the first three C lines of the following example. You can also catenate C substrings of characters to construct the error message. C Here is an example showing the use of both writing to C an internal file and catenating character strings. C C CHARACTER*5 CHARN, CHARL C WRITE (CHARN,10) N C WRITE (CHARL,10) LDA C 10 FORMAT(I5) C CALL XERMSG ('SLATEC', 'MMPY', 'THE ORDER'//CHARN// C * ' OF THE MATRIX EXCEEDS ITS ROW DIMENSION OF'// C * CHARL, 3, 1) C C There are two subtleties worth mentioning. One is that C the // for character catenation is used to construct the C error message so that no single character constant is C continued to the next line. This avoids confusion as to C whether there are trailing blanks at the end of the line. C The second is that by catenating the parts of the message C as an actual argument rather than encoding the entire C message into one large character variable, we avoid C having to know how long the message will be in order to C declare an adequate length for that large character C variable. XERMSG calls XERPRN to print the message using C multiple lines if necessary. If the message is very long, C XERPRN will break it into pieces of 72 characters (as C requested by XERMSG) for printing on multiple lines. C Also, XERMSG asks XERPRN to prefix each line with ' * ' C so that the total line length could be 76 characters. C Note also that XERPRN scans the error message backwards C to ignore trailing blanks. Another feature is that C the substring '$$' is treated as a new line sentinel C by XERPRN. If you want to construct a multiline C message without having to count out multiples of 72 C characters, just use '$$' as a separator. '$$' C obviously must occur within 72 characters of the C start of each line to have its intended effect since C XERPRN is asked to wrap around at 72 characters in C addition to looking for '$$'. C C NERR An integer value that is chosen by the library routine's C author. It must be in the range -9999999 to 99999999 (8 C printable digits). Each distinct error should have its C own error number. These error numbers should be described C in the machine readable documentation for the routine. C The error numbers need be unique only within each routine, C so it is reasonable for each routine to start enumerating C errors from 1 and proceeding to the next integer. C C LEVEL An integer value in the range 0 to 2 that indicates the C level (severity) of the error. Their meanings are C C -1 A warning message. This is used if it is not clear C that there really is an error, but the user's attention C may be needed. An attempt is made to only print this C message once. C C 0 A warning message. This is used if it is not clear C that there really is an error, but the user's attention C may be needed. C C 1 A recoverable error. This is used even if the error is C so serious that the routine cannot return any useful C answer. If the user has told the error package to C return after recoverable errors, then XERMSG will C return to the Library routine which can then return to C the user's routine. The user may also permit the error C package to terminate the program upon encountering a C recoverable error. C C 2 A fatal error. XERMSG will not return to its caller C after it receives a fatal error. This level should C hardly ever be used; it is much better to allow the C user a chance to recover. An example of one of the few C cases in which it is permissible to declare a level 2 C error is a reverse communication Library routine that C is likely to be called repeatedly until it integrates C across some interval. If there is a serious error in C the input such that another step cannot be taken and C the Library routine is called again without the input C error having been corrected by the caller, the Library C routine will probably be called forever with improper C input. In this case, it is reasonable to declare the C error to be fatal. C C Each of the arguments to XERMSG is input; none will be modified by C XERMSG. A routine may make multiple calls to XERMSG with warning C level messages; however, after a call to XERMSG with a recoverable C error, the routine should return to the user. C C***REFERENCES JONES, RONDALL E. AND KAHANER, DAVID K., "XERROR, THE C SLATEC ERROR-HANDLING PACKAGE", SOFTWARE - PRACTICE C AND EXPERIENCE, VOLUME 13, NO. 3, PP. 251-257, C MARCH, 1983. C***ROUTINES CALLED XERHLT, XERPRN C***REVISION HISTORY (YYMMDD) C 880101 DATE WRITTEN C 880621 REVISED AS DIRECTED AT SLATEC CML MEETING OF FEBRUARY 1988. C THERE ARE TWO BASIC CHANGES. C 1. A NEW ROUTINE, XERPRN, IS USED INSTEAD OF XERPRT TO C PRINT MESSAGES. THIS ROUTINE WILL BREAK LONG MESSAGES C INTO PIECES FOR PRINTING ON MULTIPLE LINES. '$$' IS C ACCEPTED AS A NEW LINE SENTINEL. A PREFIX CAN BE C ADDED TO EACH LINE TO BE PRINTED. XERMSG USES EITHER C ' ***' OR ' * ' AND LONG MESSAGES ARE BROKEN EVERY C 72 CHARACTERS (AT MOST) SO THAT THE MAXIMUM LINE C LENGTH OUTPUT CAN NOW BE AS GREAT AS 76. C 2. THE TEXT OF ALL MESSAGES IS NOW IN UPPER CASE SINCE THE C FORTRAN STANDARD DOCUMENT DOES NOT ADMIT THE EXISTENCE C OF LOWER CASE. C 880708 REVISED AFTER THE SLATEC CML MEETING OF JUNE 29 AND 30. C THE PRINCIPAL CHANGES ARE C 1. CLARIFY COMMENTS IN THE PROLOGUES C 2. RENAME XRPRNT TO XERPRN C 3. REWORK HANDLING OF '$$' IN XERPRN TO HANDLE BLANK LINES C SIMILAR TO THE WAY FORMAT STATEMENTS HANDLE THE / C CHARACTER FOR NEW RECORDS. C 890706 REVISED WITH THE HELP OF FRED FRITSCH AND REG CLEMENS TO C CLEAN UP THE CODING. C 890721 REVISED TO USE NEW FEATURE IN XERPRN TO COUNT CHARACTERS IN C PREFIX. C 891013 REVISED TO CORRECT COMMENTS. C 891214 Prologue converted to Version 4.0 format. (WRB) C 900510 Changed test on NERR to be -9999999 < NERR < 99999999, but C NERR .ne. 0, and on LEVEL to be -2 < LEVEL < 3. Added C LEVEL=-1 logic, changed calls to XERSAV to XERSVE, and C XERCTL to XERCNT. (RWC) C 901011 Removed error saving features to produce a simplified C version for distribution with DASSL and other LLNL codes. C (FNF) C***END PROLOGUE XERMSG CHARACTER*(*) LIBRAR, SUBROU, MESSG CHARACTER*72 TEMP C***FIRST EXECUTABLE STATEMENT XERMSG C C WE PRINT A FATAL ERROR MESSAGE AND TERMINATE FOR AN ERROR IN C CALLING XERMSG. THE ERROR NUMBER SHOULD BE POSITIVE, C AND THE LEVEL SHOULD BE BETWEEN 0 AND 2. C IF (NERR.LT.-9999999 .OR. NERR.GT.99999999 .OR. NERR.EQ.0 .OR. * LEVEL.LT.-1 .OR. LEVEL.GT.2) THEN CALL XERPRN (' ***', -1, 'FATAL ERROR IN...$$ ' // * 'XERMSG -- INVALID ERROR NUMBER OR LEVEL$$ '// * 'JOB ABORT DUE TO FATAL ERROR.', 72) CALL XERHLT (' ***XERMSG -- INVALID INPUT') RETURN ENDIF C C SET DEFAULT VALUES FOR CONTROL PARAMETERS. C LKNTRL = 1 MKNTRL = 1 C C ANNOUNCE THE NAMES OF THE LIBRARY AND SUBROUTINE BY BUILDING A C MESSAGE IN CHARACTER VARIABLE TEMP (NOT EXCEEDING 66 CHARACTERS) C AND SENDING IT OUT VIA XERPRN. PRINT ONLY IF CONTROL FLAG C IS NOT ZERO. C IF (LKNTRL .NE. 0) THEN TEMP(1:21) = 'MESSAGE FROM ROUTINE ' I = MIN(LEN(SUBROU), 16) TEMP(22:21+I) = SUBROU(1:I) TEMP(22+I:33+I) = ' IN LIBRARY ' LTEMP = 33 + I I = MIN(LEN(LIBRAR), 16) TEMP(LTEMP+1:LTEMP+I) = LIBRAR (1:I) TEMP(LTEMP+I+1:LTEMP+I+1) = '.' LTEMP = LTEMP + I + 1 CALL XERPRN (' ***', -1, TEMP(1:LTEMP), 72) ENDIF C C IF LKNTRL IS POSITIVE, PRINT AN INTRODUCTORY LINE BEFORE C PRINTING THE MESSAGE. THE INTRODUCTORY LINE TELLS THE CHOICE C FROM EACH OF THE FOLLOWING TWO OPTIONS. C 1. LEVEL OF THE MESSAGE C 'INFORMATIVE MESSAGE' C 'POTENTIALLY RECOVERABLE ERROR' C 'FATAL ERROR' C 2. WHETHER CONTROL FLAG WILL ALLOW PROGRAM TO CONTINUE C 'PROGRAM CONTINUES' C 'PROGRAM ABORTED' C NOTICE THAT THE LINE INCLUDING FOUR PREFIX CHARACTERS WILL NOT C EXCEED 74 CHARACTERS. C WE SKIP THE NEXT BLOCK IF THE INTRODUCTORY LINE IS NOT NEEDED. C IF (LKNTRL .GT. 0) THEN C C THE FIRST PART OF THE MESSAGE TELLS ABOUT THE LEVEL. C IF (LEVEL .LE. 0) THEN TEMP(1:20) = 'INFORMATIVE MESSAGE,' LTEMP = 20 ELSEIF (LEVEL .EQ. 1) THEN TEMP(1:30) = 'POTENTIALLY RECOVERABLE ERROR,' LTEMP = 30 ELSE TEMP(1:12) = 'FATAL ERROR,' LTEMP = 12 ENDIF C C THEN WHETHER THE PROGRAM WILL CONTINUE. C IF ((MKNTRL.EQ.2 .AND. LEVEL.GE.1) .OR. * (MKNTRL.EQ.1 .AND. LEVEL.EQ.2)) THEN TEMP(LTEMP+1:LTEMP+17) = ' PROGRAM ABORTED.' LTEMP = LTEMP + 17 ELSE TEMP(LTEMP+1:LTEMP+19) = ' PROGRAM CONTINUES.' LTEMP = LTEMP + 19 ENDIF C CALL XERPRN (' ***', -1, TEMP(1:LTEMP), 72) ENDIF C C NOW SEND OUT THE MESSAGE. C CALL XERPRN (' * ', -1, MESSG, 72) C C IF LKNTRL IS POSITIVE, WRITE THE ERROR NUMBER. C IF (LKNTRL .GT. 0) THEN WRITE (TEMP, '(''ERROR NUMBER = '', I8)') NERR DO 10 I=16,22 IF (TEMP(I:I) .NE. ' ') GO TO 20 10 CONTINUE C 20 CALL XERPRN (' * ', -1, TEMP(1:15) // TEMP(I:23), 72) ENDIF C C IF LKNTRL IS NOT ZERO, PRINT A BLANK LINE AND AN END OF MESSAGE. C IF (LKNTRL .NE. 0) THEN CALL XERPRN (' * ', -1, ' ', 72) CALL XERPRN (' ***', -1, 'END OF MESSAGE', 72) CALL XERPRN (' ', 0, ' ', 72) ENDIF C C IF THE ERROR IS NOT FATAL OR THE ERROR IS RECOVERABLE AND THE C CONTROL FLAG IS SET FOR RECOVERY, THEN RETURN. C 30 IF (LEVEL.LE.0 .OR. (LEVEL.EQ.1 .AND. MKNTRL.LE.1)) RETURN C C THE PROGRAM WILL BE STOPPED DUE TO AN UNRECOVERED ERROR OR A C FATAL ERROR. PRINT THE REASON FOR THE ABORT AND THE ERROR C SUMMARY IF THE CONTROL FLAG AND THE MAXIMUM ERROR COUNT PERMIT. C IF (LKNTRL.GT.0) THEN IF (LEVEL .EQ. 1) THEN CALL XERPRN * (' ***', -1, 'JOB ABORT DUE TO UNRECOVERED ERROR.', 72) ELSE CALL XERPRN(' ***', -1, 'JOB ABORT DUE TO FATAL ERROR.', 72) ENDIF CALL XERHLT (' ') ENDIF RETURN END octave-1.1.0/libcruft/dassl/xerprn.f100666 415 17 21311 5150640256 15565 0ustar jweusersC*DECK XERPRN SUBROUTINE XERPRN (PREFIX, NPREF, MESSG, NWRAP) C***BEGIN PROLOGUE XERPRN C***SUBSIDIARY C***PURPOSE This routine is called by XERMSG to print error messages C***LIBRARY SLATEC C***CATEGORY R3C C***TYPE ALL C***KEYWORDS ERROR MESSAGES, PRINTING, XERROR C***AUTHOR FONG, KIRBY, (NMFECC AT LLNL) C***DESCRIPTION C C This routine sends one or more lines to each of the (up to five) C logical units to which error messages are to be sent. This routine C is called several times by XERMSG, sometimes with a single line to C print and sometimes with a (potentially very long) message that may C wrap around into multiple lines. C C PREFIX Input argument of type CHARACTER. This argument contains C characters to be put at the beginning of each line before C the body of the message. No more than 16 characters of C PREFIX will be used. C C NPREF Input argument of type INTEGER. This argument is the number C of characters to use from PREFIX. If it is negative, the C intrinsic function LEN is used to determine its length. If C it is zero, PREFIX is not used. If it exceeds 16 or if C LEN(PREFIX) exceeds 16, only the first 16 characters will be C used. If NPREF is positive and the length of PREFIX is less C than NPREF, a copy of PREFIX extended with blanks to length C NPREF will be used. C C MESSG Input argument of type CHARACTER. This is the text of a C message to be printed. If it is a long message, it will be C broken into pieces for printing on multiple lines. Each line C will start with the appropriate prefix and be followed by a C piece of the message. NWRAP is the number of characters per C piece; that is, after each NWRAP characters, we break and C start a new line. In addition the characters '$$' embedded C in MESSG are a sentinel for a new line. The counting of C characters up to NWRAP starts over for each new line. The C value of NWRAP typically used by XERMSG is 72 since many C older error messages in the SLATEC Library are laid out to C rely on wrap-around every 72 characters. C C NWRAP Input argument of type INTEGER. This gives the maximum size C piece into which to break MESSG for printing on multiple C lines. An embedded '$$' ends a line, and the count restarts C at the following character. If a line break does not occur C on a blank (it would split a word) that word is moved to the C next line. Values of NWRAP less than 16 will be treated as C 16. Values of NWRAP greater than 132 will be treated as 132. C The actual line length will be NPREF + NWRAP after NPREF has C been adjusted to fall between 0 and 16 and NWRAP has been C adjusted to fall between 16 and 132. C C***REFERENCES (NONE) C***ROUTINES CALLED I1MACH, XGETUA C***REVISION HISTORY (YYMMDD) C 880621 DATE WRITTEN C 880708 REVISED AFTER THE SLATEC CML SUBCOMMITTEE MEETING OF C JUNE 29 AND 30 TO CHANGE THE NAME TO XERPRN AND TO REWORK C THE HANDLING OF THE NEW LINE SENTINEL TO BEHAVE LIKE THE C SLASH CHARACTER IN FORMAT STATEMENTS. C 890706 REVISED WITH THE HELP OF FRED FRITSCH AND REG CLEMMENS TO C STREAMLINE THE CODING AND FIX A BUG THAT CAUSED EXTRA BLANK C LINES TO BE PRINTED. C 890721 REVISED TO ADD A NEW FEATURE. A NEGATIVE VALUE OF NPREF C CAUSES LEN(PREFIX) TO BE USED AS THE LENGTH. C 891013 REVISED TO CORRECT ERROR IN CALCULATING PREFIX LENGTH. C 891214 Prologue converted to Version 4.0 format. (WRB) C 900510 Added code to break messages between words. (RWC) C***END PROLOGUE XERPRN CHARACTER*(*) PREFIX, MESSG INTEGER NPREF, NWRAP CHARACTER*148 CBUFF INTEGER IU(5), NUNIT CHARACTER*2 NEWLIN PARAMETER (NEWLIN = '$$') C***FIRST EXECUTABLE STATEMENT XERPRN CALL XGETUA(IU,NUNIT) C C A ZERO VALUE FOR A LOGICAL UNIT NUMBER MEANS TO USE THE STANDARD C ERROR MESSAGE UNIT INSTEAD. I1MACH(4) RETRIEVES THE STANDARD C ERROR MESSAGE UNIT. C N = I1MACH(4) DO 10 I=1,NUNIT IF (IU(I) .EQ. 0) IU(I) = N 10 CONTINUE C C LPREF IS THE LENGTH OF THE PREFIX. THE PREFIX IS PLACED AT THE C BEGINNING OF CBUFF, THE CHARACTER BUFFER, AND KEPT THERE DURING C THE REST OF THIS ROUTINE. C IF ( NPREF .LT. 0 ) THEN LPREF = LEN(PREFIX) ELSE LPREF = NPREF ENDIF LPREF = MIN(16, LPREF) IF (LPREF .NE. 0) CBUFF(1:LPREF) = PREFIX C C LWRAP IS THE MAXIMUM NUMBER OF CHARACTERS WE WANT TO TAKE AT ONE C TIME FROM MESSG TO PRINT ON ONE LINE. C LWRAP = MAX(16, MIN(132, NWRAP)) C C SET LENMSG TO THE LENGTH OF MESSG, IGNORE ANY TRAILING BLANKS. C LENMSG = LEN(MESSG) N = LENMSG DO 20 I=1,N IF (MESSG(LENMSG:LENMSG) .NE. ' ') GO TO 30 LENMSG = LENMSG - 1 20 CONTINUE 30 CONTINUE C C IF THE MESSAGE IS ALL BLANKS, THEN PRINT ONE BLANK LINE. C IF (LENMSG .EQ. 0) THEN CBUFF(LPREF+1:LPREF+1) = ' ' DO 40 I=1,NUNIT WRITE(IU(I), '(A)') CBUFF(1:LPREF+1) 40 CONTINUE RETURN ENDIF C C SET NEXTC TO THE POSITION IN MESSG WHERE THE NEXT SUBSTRING C STARTS. FROM THIS POSITION WE SCAN FOR THE NEW LINE SENTINEL. C WHEN NEXTC EXCEEDS LENMSG, THERE IS NO MORE TO PRINT. C WE LOOP BACK TO LABEL 50 UNTIL ALL PIECES HAVE BEEN PRINTED. C C WE LOOK FOR THE NEXT OCCURRENCE OF THE NEW LINE SENTINEL. THE C INDEX INTRINSIC FUNCTION RETURNS ZERO IF THERE IS NO OCCURRENCE C OR IF THE LENGTH OF THE FIRST ARGUMENT IS LESS THAN THE LENGTH C OF THE SECOND ARGUMENT. C C THERE ARE SEVERAL CASES WHICH SHOULD BE CHECKED FOR IN THE C FOLLOWING ORDER. WE ARE ATTEMPTING TO SET LPIECE TO THE NUMBER C OF CHARACTERS THAT SHOULD BE TAKEN FROM MESSG STARTING AT C POSITION NEXTC. C C LPIECE .EQ. 0 THE NEW LINE SENTINEL DOES NOT OCCUR IN THE C REMAINDER OF THE CHARACTER STRING. LPIECE C SHOULD BE SET TO LWRAP OR LENMSG+1-NEXTC, C WHICHEVER IS LESS. C C LPIECE .EQ. 1 THE NEW LINE SENTINEL STARTS AT MESSG(NEXTC: C NEXTC). LPIECE IS EFFECTIVELY ZERO, AND WE C PRINT NOTHING TO AVOID PRODUCING UNNECESSARY C BLANK LINES. THIS TAKES CARE OF THE SITUATION C WHERE THE LIBRARY ROUTINE HAS A MESSAGE OF C EXACTLY 72 CHARACTERS FOLLOWED BY A NEW LINE C SENTINEL FOLLOWED BY MORE CHARACTERS. NEXTC C SHOULD BE INCREMENTED BY 2. C C LPIECE .GT. LWRAP+1 REDUCE LPIECE TO LWRAP. C C ELSE THIS LAST CASE MEANS 2 .LE. LPIECE .LE. LWRAP+1 C RESET LPIECE = LPIECE-1. NOTE THAT THIS C PROPERLY HANDLES THE END CASE WHERE LPIECE .EQ. C LWRAP+1. THAT IS, THE SENTINEL FALLS EXACTLY C AT THE END OF A LINE. C NEXTC = 1 50 LPIECE = INDEX(MESSG(NEXTC:LENMSG), NEWLIN) IF (LPIECE .EQ. 0) THEN C C THERE WAS NO NEW LINE SENTINEL FOUND. C IDELTA = 0 LPIECE = MIN(LWRAP, LENMSG+1-NEXTC) IF (LPIECE .LT. LENMSG+1-NEXTC) THEN DO 52 I=LPIECE+1,2,-1 IF (MESSG(NEXTC+I-1:NEXTC+I-1) .EQ. ' ') THEN LPIECE = I-1 IDELTA = 1 GOTO 54 ENDIF 52 CONTINUE ENDIF 54 CBUFF(LPREF+1:LPREF+LPIECE) = MESSG(NEXTC:NEXTC+LPIECE-1) NEXTC = NEXTC + LPIECE + IDELTA ELSEIF (LPIECE .EQ. 1) THEN C C WE HAVE A NEW LINE SENTINEL AT MESSG(NEXTC:NEXTC+1). C DON'T PRINT A BLANK LINE. C NEXTC = NEXTC + 2 GO TO 50 ELSEIF (LPIECE .GT. LWRAP+1) THEN C C LPIECE SHOULD BE SET DOWN TO LWRAP. C IDELTA = 0 LPIECE = LWRAP DO 56 I=LPIECE+1,2,-1 IF (MESSG(NEXTC+I-1:NEXTC+I-1) .EQ. ' ') THEN LPIECE = I-1 IDELTA = 1 GOTO 58 ENDIF 56 CONTINUE 58 CBUFF(LPREF+1:LPREF+LPIECE) = MESSG(NEXTC:NEXTC+LPIECE-1) NEXTC = NEXTC + LPIECE + IDELTA ELSE C C IF WE ARRIVE HERE, IT MEANS 2 .LE. LPIECE .LE. LWRAP+1. C WE SHOULD DECREMENT LPIECE BY ONE. C LPIECE = LPIECE - 1 CBUFF(LPREF+1:LPREF+LPIECE) = MESSG(NEXTC:NEXTC+LPIECE-1) NEXTC = NEXTC + LPIECE + 2 ENDIF C C PRINT C DO 60 I=1,NUNIT WRITE(IU(I), '(A)') CBUFF(1:LPREF+LPIECE) 60 CONTINUE C IF (NEXTC .LE. LENMSG) GO TO 50 RETURN END octave-1.1.0/libcruft/dassl/xgetua.f100666 415 17 4537 5150640256 15537 0ustar jweusersC*DECK XGETUA SUBROUTINE XGETUA (IUNITA, N) C***BEGIN PROLOGUE XGETUA C***PURPOSE Return unit number(s) to which error messages are being C sent. C***LIBRARY SLATEC (XERROR) C***CATEGORY R3C C***TYPE ALL (XGETUA-A) C***KEYWORDS ERROR, XERROR C***AUTHOR JONES, R. E., (SNLA) C Modified by C FRITSCH, F. N., (LLNL) C***DESCRIPTION C C Abstract C XGETUA may be called to determine the unit number or numbers C to which error messages are being sent. C These unit numbers may have been set by a call to XSETUN, C or a call to XSETUA, or may be a default value. C C Description of Parameters C --Output-- C IUNIT - an array of one to five unit numbers, depending C on the value of N. A value of zero refers to the C default unit, as defined by the I1MACH machine C constant routine. Only IUNIT(1),...,IUNIT(N) are C defined by XGETUA. The values of IUNIT(N+1),..., C IUNIT(5) are not defined (for N .LT. 5) or altered C in any way by XGETUA. C N - the number of units to which copies of the C error messages are being sent. N will be in the C range from 1 to 5. C C CAUTION: The use of COMMON in this version is not safe for C multiprocessing. C C***REFERENCES JONES R.E., KAHANER D.K., 'XERROR, THE SLATEC ERROR- C HANDLING PACKAGE', SAND82-0800, SANDIA LABORATORIES, C 1982. C***ROUTINES CALLED (NONE) C***COMMON BLOCKS XERUNI C***REVISION HISTORY (YYMMDD) C 790801 DATE WRITTEN C 861211 REVISION DATE from Version 3.2 C 891214 Prologue converted to Version 4.0 format. (BAB) C 901011 Rewritten to not use J4SAVE. (FNF) C 901012 Corrected initialization problem. (FNF) C***END PROLOGUE XGETUA DIMENSION IUNITA(5) INTEGER NUNIT, IUNIT(5) COMMON /XERUNI/ NUNIT, IUNIT C***FIRST EXECUTABLE STATEMENT XGETUA C Initialize so XERMSG will use standard error unit number if C block has not been set up by a CALL XSETUA. C CAUTION: This assumes uninitialized COMMON tests .LE.0 . IF (NUNIT.LE.0) THEN NUNIT = 1 IUNIT(1) = 0 ENDIF N = NUNIT DO 30 I=1,N IUNITA(I) = IUNIT(I) 30 CONTINUE RETURN END octave-1.1.0/libcruft/dassl/xsetua.f100666 415 17 4240 5150640256 15542 0ustar jweusersC*DECK XSETUA SUBROUTINE XSETUA (IUNITA, N) C***BEGIN PROLOGUE XSETUA C***PURPOSE Set logical unit numbers (up to 5) to which error C messages are to be sent. C***LIBRARY SLATEC (XERROR) C***CATEGORY R3B C***TYPE ALL (XSETUA-A) C***KEYWORDS ERROR, XERROR C***AUTHOR JONES, R. E., (SNLA) C Modified by C FRITSCH, F. N., (LLNL) C***DESCRIPTION C C Abstract C XSETUA may be called to declare a list of up to five C logical units, each of which is to receive a copy of C each error message processed by this package. C The purpose of XSETUA is to allow simultaneous printing C of each error message on, say, a main output file, C an interactive terminal, and other files such as graphics C communication files. C C Description of Parameters C --Input-- C IUNIT - an array of up to five unit numbers. C Normally these numbers should all be different C (but duplicates are not prohibited.) C N - the number of unit numbers provided in IUNIT C must have 1 .LE. N .LE. 5. C C CAUTION: The use of COMMON in this version is not safe for C multiprocessing. C C***REFERENCES JONES R.E., KAHANER D.K., 'XERROR, THE SLATEC ERROR- C HANDLING PACKAGE', SAND82-0800, SANDIA LABORATORIES, C 1982. C***ROUTINES CALLED XERMSG C***COMMON BLOCKS XERUNI C***REVISION HISTORY (YYMMDD) C 790801 DATE WRITTEN C 861211 REVISION DATE from Version 3.2 C 891214 Prologue converted to Version 4.0 format. (BAB) C 900510 Change call to XERRWV to XERMSG. (RWC) C 901011 Rewritten to not use J4SAVE. (FNF) C***END PROLOGUE XSETUA DIMENSION IUNITA(5) INTEGER NUNIT, IUNIT(5) COMMON /XERUNI/ NUNIT, IUNIT CHARACTER *8 XERN1 C***FIRST EXECUTABLE STATEMENT XSETUA C IF (N.LT.1 .OR. N.GT.5) THEN WRITE (XERN1, '(I8)') N CALL XERMSG ('SLATEC', 'XSETUA', * 'INVALID NUMBER OF UNITS, N = ' // XERN1, 1, 2) RETURN ENDIF C DO 10 I=1,N IUNIT(I) = IUNITA(I) 10 CONTINUE NUNIT = N RETURN END octave-1.1.0/libcruft/eispack/ 40777 415 17 0 5705521624 14301 5ustar jweusersoctave-1.1.0/libcruft/eispack/Makefile.in100666 415 17 510 5662226321 16415 0ustar jweusers# # Makefile for octave's libcruft/eispack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/eispack/epslon.f100666 415 17 2466 5431472227 16055 0ustar jweusers double precision function epslon (x) double precision x c c estimate unit roundoff in quantities of size x. c double precision a,b,c,eps c c this program should function properly on all systems c satisfying the following two assumptions, c 1. the base used in representing floating point c numbers is not a power of three. c 2. the quantity a in statement 10 is represented to c the accuracy used in floating point variables c that are stored in memory. c the statement number 10 and the go to 10 are intended to c force optimizing compilers to generate code satisfying c assumption 2. c under these assumptions, it should be true that, c a is not exactly equal to four-thirds, c b has a zero for its last bit or digit, c c is not exactly equal to one, c eps measures the separation of 1.0 from c the next larger floating point number. c the developers of eispack would appreciate being informed c about any systems where these assumptions do not hold. c c this version dated 4/6/83. c a = 4.0d0/3.0d0 10 b = a - 1.0d0 c = b + b + b eps = dabs(c-1.0d0) if (eps .eq. 0.0d0) go to 10 epslon = eps*dabs(x) return end octave-1.1.0/libcruft/eispack/qzhes.f100666 415 17 12177 5431472226 15726 0ustar jweusers subroutine qzhes(nm,n,a,b,matz,z) c integer i,j,k,l,n,lb,l1,nm,nk1,nm1,nm2 double precision a(nm,n),b(nm,n),z(nm,n) double precision r,s,t,u1,u2,v1,v2,rho logical matz c c this subroutine is the first step of the qz algorithm c for solving generalized matrix eigenvalue problems, c siam j. numer. anal. 10, 241-256(1973) by moler and stewart. c c this subroutine accepts a pair of real general matrices and c reduces one of them to upper hessenberg form and the other c to upper triangular form using orthogonal transformations. c it is usually followed by qzit, qzval and, possibly, qzvec. c c on input c c nm must be set to the row dimension of two-dimensional c array parameters as declared in the calling program c dimension statement. c c n is the order of the matrices. c c a contains a real general matrix. c c b contains a real general matrix. c c matz should be set to .true. if the right hand transformations c are to be accumulated for later use in computing c eigenvectors, and to .false. otherwise. c c on output c c a has been reduced to upper hessenberg form. the elements c below the first subdiagonal have been set to zero. c c b has been reduced to upper triangular form. the elements c below the main diagonal have been set to zero. c c z contains the product of the right hand transformations if c matz has been set to .true. otherwise, z is not referenced. c c questions and comments should be directed to burton s. garbow, c mathematics and computer science div, argonne national laboratory c c this version dated august 1983. c c ------------------------------------------------------------------ c c .......... initialize z .......... if (.not. matz) go to 10 c do 3 j = 1, n c do 2 i = 1, n z(i,j) = 0.0d0 2 continue c z(j,j) = 1.0d0 3 continue c .......... reduce b to upper triangular form .......... 10 if (n .le. 1) go to 170 nm1 = n - 1 c do 100 l = 1, nm1 l1 = l + 1 s = 0.0d0 c do 20 i = l1, n s = s + dabs(b(i,l)) 20 continue c if (s .eq. 0.0d0) go to 100 s = s + dabs(b(l,l)) r = 0.0d0 c do 25 i = l, n b(i,l) = b(i,l) / s r = r + b(i,l)**2 25 continue c r = dsign(dsqrt(r),b(l,l)) b(l,l) = b(l,l) + r rho = r * b(l,l) c do 50 j = l1, n t = 0.0d0 c do 30 i = l, n t = t + b(i,l) * b(i,j) 30 continue c t = -t / rho c do 40 i = l, n b(i,j) = b(i,j) + t * b(i,l) 40 continue c 50 continue c do 80 j = 1, n t = 0.0d0 c do 60 i = l, n t = t + b(i,l) * a(i,j) 60 continue c t = -t / rho c do 70 i = l, n a(i,j) = a(i,j) + t * b(i,l) 70 continue c 80 continue c b(l,l) = -s * r c do 90 i = l1, n b(i,l) = 0.0d0 90 continue c 100 continue c .......... reduce a to upper hessenberg form, while c keeping b triangular .......... if (n .eq. 2) go to 170 nm2 = n - 2 c do 160 k = 1, nm2 nk1 = nm1 - k c .......... for l=n-1 step -1 until k+1 do -- .......... do 150 lb = 1, nk1 l = n - lb l1 = l + 1 c .......... zero a(l+1,k) .......... s = dabs(a(l,k)) + dabs(a(l1,k)) if (s .eq. 0.0d0) go to 150 u1 = a(l,k) / s u2 = a(l1,k) / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 110 j = k, n t = a(l,j) + u2 * a(l1,j) a(l,j) = a(l,j) + t * v1 a(l1,j) = a(l1,j) + t * v2 110 continue c a(l1,k) = 0.0d0 c do 120 j = l, n t = b(l,j) + u2 * b(l1,j) b(l,j) = b(l,j) + t * v1 b(l1,j) = b(l1,j) + t * v2 120 continue c .......... zero b(l+1,l) .......... s = dabs(b(l1,l1)) + dabs(b(l1,l)) if (s .eq. 0.0d0) go to 150 u1 = b(l1,l1) / s u2 = b(l1,l) / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 130 i = 1, l1 t = b(i,l1) + u2 * b(i,l) b(i,l1) = b(i,l1) + t * v1 b(i,l) = b(i,l) + t * v2 130 continue c b(l1,l) = 0.0d0 c do 140 i = 1, n t = a(i,l1) + u2 * a(i,l) a(i,l1) = a(i,l1) + t * v1 a(i,l) = a(i,l) + t * v2 140 continue c if (.not. matz) go to 150 c do 145 i = 1, n t = z(i,l1) + u2 * z(i,l) z(i,l1) = z(i,l1) + t * v1 z(i,l) = z(i,l) + t * v2 145 continue c 150 continue c 160 continue c 170 return end octave-1.1.0/libcruft/eispack/qzit.f100666 415 17 26415 5431472226 15563 0ustar jweusers subroutine qzit(nm,n,a,b,eps1,matz,z,ierr) c integer i,j,k,l,n,en,k1,k2,ld,ll,l1,na,nm,ish,itn,its,km1,lm1, x enm2,ierr,lor1,enorn double precision a(nm,n),b(nm,n),z(nm,n) double precision r,s,t,a1,a2,a3,ep,sh,u1,u2,u3,v1,v2,v3,ani,a11, x a12,a21,a22,a33,a34,a43,a44,bni,b11,b12,b22,b33,b34, x b44,epsa,epsb,eps1,anorm,bnorm,epslon logical matz,notlas c c this subroutine is the second step of the qz algorithm c for solving generalized matrix eigenvalue problems, c siam j. numer. anal. 10, 241-256(1973) by moler and stewart, c as modified in technical note nasa tn d-7305(1973) by ward. c c this subroutine accepts a pair of real matrices, one of them c in upper hessenberg form and the other in upper triangular form. c it reduces the hessenberg matrix to quasi-triangular form using c orthogonal transformations while maintaining the triangular form c of the other matrix. it is usually preceded by qzhes and c followed by qzval and, possibly, qzvec. c c on input c c nm must be set to the row dimension of two-dimensional c array parameters as declared in the calling program c dimension statement. c c n is the order of the matrices. c c a contains a real upper hessenberg matrix. c c b contains a real upper triangular matrix. c c eps1 is a tolerance used to determine negligible elements. c eps1 = 0.0 (or negative) may be input, in which case an c element will be neglected only if it is less than roundoff c error times the norm of its matrix. if the input eps1 is c positive, then an element will be considered negligible c if it is less than eps1 times the norm of its matrix. a c positive value of eps1 may result in faster execution, c but less accurate results. c c matz should be set to .true. if the right hand transformations c are to be accumulated for later use in computing c eigenvectors, and to .false. otherwise. c c z contains, if matz has been set to .true., the c transformation matrix produced in the reduction c by qzhes, if performed, or else the identity matrix. c if matz has been set to .false., z is not referenced. c c on output c c a has been reduced to quasi-triangular form. the elements c below the first subdiagonal are still zero and no two c consecutive subdiagonal elements are nonzero. c c b is still in upper triangular form, although its elements c have been altered. the location b(n,1) is used to store c eps1 times the norm of b for later use by qzval and qzvec. c c z contains the product of the right hand transformations c (for both steps) if matz has been set to .true.. c c ierr is set to c zero for normal return, c j if the limit of 30*n iterations is exhausted c while the j-th eigenvalue is being sought. c c questions and comments should be directed to burton s. garbow, c mathematics and computer science div, argonne national laboratory c c this version dated august 1983. c c ------------------------------------------------------------------ c ierr = 0 c .......... compute epsa,epsb .......... anorm = 0.0d0 bnorm = 0.0d0 c do 30 i = 1, n ani = 0.0d0 if (i .ne. 1) ani = dabs(a(i,i-1)) bni = 0.0d0 c do 20 j = i, n ani = ani + dabs(a(i,j)) bni = bni + dabs(b(i,j)) 20 continue c if (ani .gt. anorm) anorm = ani if (bni .gt. bnorm) bnorm = bni 30 continue c if (anorm .eq. 0.0d0) anorm = 1.0d0 if (bnorm .eq. 0.0d0) bnorm = 1.0d0 ep = eps1 if (ep .gt. 0.0d0) go to 50 c .......... use roundoff level if eps1 is zero .......... ep = epslon(1.0d0) 50 epsa = ep * anorm epsb = ep * bnorm c .......... reduce a to quasi-triangular form, while c keeping b triangular .......... lor1 = 1 enorn = n en = n itn = 30*n c .......... begin qz step .......... 60 if (en .le. 2) go to 1001 if (.not. matz) enorn = en its = 0 na = en - 1 enm2 = na - 1 70 ish = 2 c .......... check for convergence or reducibility. c for l=en step -1 until 1 do -- .......... do 80 ll = 1, en lm1 = en - ll l = lm1 + 1 if (l .eq. 1) go to 95 if (dabs(a(l,lm1)) .le. epsa) go to 90 80 continue c 90 a(l,lm1) = 0.0d0 if (l .lt. na) go to 95 c .......... 1-by-1 or 2-by-2 block isolated .......... en = lm1 go to 60 c .......... check for small top of b .......... 95 ld = l 100 l1 = l + 1 b11 = b(l,l) if (dabs(b11) .gt. epsb) go to 120 b(l,l) = 0.0d0 s = dabs(a(l,l)) + dabs(a(l1,l)) u1 = a(l,l) / s u2 = a(l1,l) / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 110 j = l, enorn t = a(l,j) + u2 * a(l1,j) a(l,j) = a(l,j) + t * v1 a(l1,j) = a(l1,j) + t * v2 t = b(l,j) + u2 * b(l1,j) b(l,j) = b(l,j) + t * v1 b(l1,j) = b(l1,j) + t * v2 110 continue c if (l .ne. 1) a(l,lm1) = -a(l,lm1) lm1 = l l = l1 go to 90 120 a11 = a(l,l) / b11 a21 = a(l1,l) / b11 if (ish .eq. 1) go to 140 c .......... iteration strategy .......... if (itn .eq. 0) go to 1000 if (its .eq. 10) go to 155 c .......... determine type of shift .......... b22 = b(l1,l1) if (dabs(b22) .lt. epsb) b22 = epsb b33 = b(na,na) if (dabs(b33) .lt. epsb) b33 = epsb b44 = b(en,en) if (dabs(b44) .lt. epsb) b44 = epsb a33 = a(na,na) / b33 a34 = a(na,en) / b44 a43 = a(en,na) / b33 a44 = a(en,en) / b44 b34 = b(na,en) / b44 t = 0.5d0 * (a43 * b34 - a33 - a44) r = t * t + a34 * a43 - a33 * a44 if (r .lt. 0.0d0) go to 150 c .......... determine single shift zeroth column of a .......... ish = 1 r = dsqrt(r) sh = -t + r s = -t - r if (dabs(s-a44) .lt. dabs(sh-a44)) sh = s c .......... look for two consecutive small c sub-diagonal elements of a. c for l=en-2 step -1 until ld do -- .......... do 130 ll = ld, enm2 l = enm2 + ld - ll if (l .eq. ld) go to 140 lm1 = l - 1 l1 = l + 1 t = a(l,l) if (dabs(b(l,l)) .gt. epsb) t = t - sh * b(l,l) if (dabs(a(l,lm1)) .le. dabs(t/a(l1,l)) * epsa) go to 100 130 continue c 140 a1 = a11 - sh a2 = a21 if (l .ne. ld) a(l,lm1) = -a(l,lm1) go to 160 c .......... determine double shift zeroth column of a .......... 150 a12 = a(l,l1) / b22 a22 = a(l1,l1) / b22 b12 = b(l,l1) / b22 a1 = ((a33 - a11) * (a44 - a11) - a34 * a43 + a43 * b34 * a11) x / a21 + a12 - a11 * b12 a2 = (a22 - a11) - a21 * b12 - (a33 - a11) - (a44 - a11) x + a43 * b34 a3 = a(l1+1,l1) / b22 go to 160 c .......... ad hoc shift .......... 155 a1 = 0.0d0 a2 = 1.0d0 a3 = 1.1605d0 160 its = its + 1 itn = itn - 1 if (.not. matz) lor1 = ld c .......... main loop .......... do 260 k = l, na notlas = k .ne. na .and. ish .eq. 2 k1 = k + 1 k2 = k + 2 km1 = max0(k-1,l) ll = min0(en,k1+ish) if (notlas) go to 190 c .......... zero a(k+1,k-1) .......... if (k .eq. l) go to 170 a1 = a(k,km1) a2 = a(k1,km1) 170 s = dabs(a1) + dabs(a2) if (s .eq. 0.0d0) go to 70 u1 = a1 / s u2 = a2 / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 180 j = km1, enorn t = a(k,j) + u2 * a(k1,j) a(k,j) = a(k,j) + t * v1 a(k1,j) = a(k1,j) + t * v2 t = b(k,j) + u2 * b(k1,j) b(k,j) = b(k,j) + t * v1 b(k1,j) = b(k1,j) + t * v2 180 continue c if (k .ne. l) a(k1,km1) = 0.0d0 go to 240 c .......... zero a(k+1,k-1) and a(k+2,k-1) .......... 190 if (k .eq. l) go to 200 a1 = a(k,km1) a2 = a(k1,km1) a3 = a(k2,km1) 200 s = dabs(a1) + dabs(a2) + dabs(a3) if (s .eq. 0.0d0) go to 260 u1 = a1 / s u2 = a2 / s u3 = a3 / s r = dsign(dsqrt(u1*u1+u2*u2+u3*u3),u1) v1 = -(u1 + r) / r v2 = -u2 / r v3 = -u3 / r u2 = v2 / v1 u3 = v3 / v1 c do 210 j = km1, enorn t = a(k,j) + u2 * a(k1,j) + u3 * a(k2,j) a(k,j) = a(k,j) + t * v1 a(k1,j) = a(k1,j) + t * v2 a(k2,j) = a(k2,j) + t * v3 t = b(k,j) + u2 * b(k1,j) + u3 * b(k2,j) b(k,j) = b(k,j) + t * v1 b(k1,j) = b(k1,j) + t * v2 b(k2,j) = b(k2,j) + t * v3 210 continue c if (k .eq. l) go to 220 a(k1,km1) = 0.0d0 a(k2,km1) = 0.0d0 c .......... zero b(k+2,k+1) and b(k+2,k) .......... 220 s = dabs(b(k2,k2)) + dabs(b(k2,k1)) + dabs(b(k2,k)) if (s .eq. 0.0d0) go to 240 u1 = b(k2,k2) / s u2 = b(k2,k1) / s u3 = b(k2,k) / s r = dsign(dsqrt(u1*u1+u2*u2+u3*u3),u1) v1 = -(u1 + r) / r v2 = -u2 / r v3 = -u3 / r u2 = v2 / v1 u3 = v3 / v1 c do 230 i = lor1, ll t = a(i,k2) + u2 * a(i,k1) + u3 * a(i,k) a(i,k2) = a(i,k2) + t * v1 a(i,k1) = a(i,k1) + t * v2 a(i,k) = a(i,k) + t * v3 t = b(i,k2) + u2 * b(i,k1) + u3 * b(i,k) b(i,k2) = b(i,k2) + t * v1 b(i,k1) = b(i,k1) + t * v2 b(i,k) = b(i,k) + t * v3 230 continue c b(k2,k) = 0.0d0 b(k2,k1) = 0.0d0 if (.not. matz) go to 240 c do 235 i = 1, n t = z(i,k2) + u2 * z(i,k1) + u3 * z(i,k) z(i,k2) = z(i,k2) + t * v1 z(i,k1) = z(i,k1) + t * v2 z(i,k) = z(i,k) + t * v3 235 continue c .......... zero b(k+1,k) .......... 240 s = dabs(b(k1,k1)) + dabs(b(k1,k)) if (s .eq. 0.0d0) go to 260 u1 = b(k1,k1) / s u2 = b(k1,k) / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 250 i = lor1, ll t = a(i,k1) + u2 * a(i,k) a(i,k1) = a(i,k1) + t * v1 a(i,k) = a(i,k) + t * v2 t = b(i,k1) + u2 * b(i,k) b(i,k1) = b(i,k1) + t * v1 b(i,k) = b(i,k) + t * v2 250 continue c b(k1,k) = 0.0d0 if (.not. matz) go to 260 c do 255 i = 1, n t = z(i,k1) + u2 * z(i,k) z(i,k1) = z(i,k1) + t * v1 z(i,k) = z(i,k) + t * v2 255 continue c 260 continue c .......... end qz step .......... go to 70 c .......... set error -- all eigenvalues have not c converged after 30*n iterations .......... 1000 ierr = en c .......... save epsb for use by qzval and qzvec .......... 1001 if (n .gt. 1) b(n,1) = epsb return end octave-1.1.0/libcruft/eispack/qzval.f100666 415 17 22502 5431472226 15722 0ustar jweusers subroutine qzval(nm,n,a,b,alfr,alfi,beta,matz,z) c integer i,j,n,en,na,nm,nn,isw double precision a(nm,n),b(nm,n),alfr(n),alfi(n),beta(n),z(nm,n) double precision c,d,e,r,s,t,an,a1,a2,bn,cq,cz,di,dr,ei,ti,tr,u1, x u2,v1,v2,a1i,a11,a12,a2i,a21,a22,b11,b12,b22,sqi,sqr, x ssi,ssr,szi,szr,a11i,a11r,a12i,a12r,a22i,a22r,epsb logical matz c c this subroutine is the third step of the qz algorithm c for solving generalized matrix eigenvalue problems, c siam j. numer. anal. 10, 241-256(1973) by moler and stewart. c c this subroutine accepts a pair of real matrices, one of them c in quasi-triangular form and the other in upper triangular form. c it reduces the quasi-triangular matrix further, so that any c remaining 2-by-2 blocks correspond to pairs of complex c eigenvalues, and returns quantities whose ratios give the c generalized eigenvalues. it is usually preceded by qzhes c and qzit and may be followed by qzvec. c c on input c c nm must be set to the row dimension of two-dimensional c array parameters as declared in the calling program c dimension statement. c c n is the order of the matrices. c c a contains a real upper quasi-triangular matrix. c c b contains a real upper triangular matrix. in addition, c location b(n,1) contains the tolerance quantity (epsb) c computed and saved in qzit. c c matz should be set to .true. if the right hand transformations c are to be accumulated for later use in computing c eigenvectors, and to .false. otherwise. c c z contains, if matz has been set to .true., the c transformation matrix produced in the reductions by qzhes c and qzit, if performed, or else the identity matrix. c if matz has been set to .false., z is not referenced. c c on output c c a has been reduced further to a quasi-triangular matrix c in which all nonzero subdiagonal elements correspond to c pairs of complex eigenvalues. c c b is still in upper triangular form, although its elements c have been altered. b(n,1) is unaltered. c c alfr and alfi contain the real and imaginary parts of the c diagonal elements of the triangular matrix that would be c obtained if a were reduced completely to triangular form c by unitary transformations. non-zero values of alfi occur c in pairs, the first member positive and the second negative. c c beta contains the diagonal elements of the corresponding b, c normalized to be real and non-negative. the generalized c eigenvalues are then the ratios ((alfr+i*alfi)/beta). c c z contains the product of the right hand transformations c (for all three steps) if matz has been set to .true. c c questions and comments should be directed to burton s. garbow, c mathematics and computer science div, argonne national laboratory c c this version dated august 1983. c c ------------------------------------------------------------------ c epsb = b(n,1) isw = 1 c .......... find eigenvalues of quasi-triangular matrices. c for en=n step -1 until 1 do -- .......... do 510 nn = 1, n en = n + 1 - nn na = en - 1 if (isw .eq. 2) go to 505 if (en .eq. 1) go to 410 if (a(en,na) .ne. 0.0d0) go to 420 c .......... 1-by-1 block, one real root .......... 410 alfr(en) = a(en,en) if (b(en,en) .lt. 0.0d0) alfr(en) = -alfr(en) beta(en) = dabs(b(en,en)) alfi(en) = 0.0d0 go to 510 c .......... 2-by-2 block .......... 420 if (dabs(b(na,na)) .le. epsb) go to 455 if (dabs(b(en,en)) .gt. epsb) go to 430 a1 = a(en,en) a2 = a(en,na) bn = 0.0d0 go to 435 430 an = dabs(a(na,na)) + dabs(a(na,en)) + dabs(a(en,na)) x + dabs(a(en,en)) bn = dabs(b(na,na)) + dabs(b(na,en)) + dabs(b(en,en)) a11 = a(na,na) / an a12 = a(na,en) / an a21 = a(en,na) / an a22 = a(en,en) / an b11 = b(na,na) / bn b12 = b(na,en) / bn b22 = b(en,en) / bn e = a11 / b11 ei = a22 / b22 s = a21 / (b11 * b22) t = (a22 - e * b22) / b22 if (dabs(e) .le. dabs(ei)) go to 431 e = ei t = (a11 - e * b11) / b11 431 c = 0.5d0 * (t - s * b12) d = c * c + s * (a12 - e * b12) if (d .lt. 0.0d0) go to 480 c .......... two real roots. c zero both a(en,na) and b(en,na) .......... e = e + (c + dsign(dsqrt(d),c)) a11 = a11 - e * b11 a12 = a12 - e * b12 a22 = a22 - e * b22 if (dabs(a11) + dabs(a12) .lt. x dabs(a21) + dabs(a22)) go to 432 a1 = a12 a2 = a11 go to 435 432 a1 = a22 a2 = a21 c .......... choose and apply real z .......... 435 s = dabs(a1) + dabs(a2) u1 = a1 / s u2 = a2 / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 440 i = 1, en t = a(i,en) + u2 * a(i,na) a(i,en) = a(i,en) + t * v1 a(i,na) = a(i,na) + t * v2 t = b(i,en) + u2 * b(i,na) b(i,en) = b(i,en) + t * v1 b(i,na) = b(i,na) + t * v2 440 continue c if (.not. matz) go to 450 c do 445 i = 1, n t = z(i,en) + u2 * z(i,na) z(i,en) = z(i,en) + t * v1 z(i,na) = z(i,na) + t * v2 445 continue c 450 if (bn .eq. 0.0d0) go to 475 if (an .lt. dabs(e) * bn) go to 455 a1 = b(na,na) a2 = b(en,na) go to 460 455 a1 = a(na,na) a2 = a(en,na) c .......... choose and apply real q .......... 460 s = dabs(a1) + dabs(a2) if (s .eq. 0.0d0) go to 475 u1 = a1 / s u2 = a2 / s r = dsign(dsqrt(u1*u1+u2*u2),u1) v1 = -(u1 + r) / r v2 = -u2 / r u2 = v2 / v1 c do 470 j = na, n t = a(na,j) + u2 * a(en,j) a(na,j) = a(na,j) + t * v1 a(en,j) = a(en,j) + t * v2 t = b(na,j) + u2 * b(en,j) b(na,j) = b(na,j) + t * v1 b(en,j) = b(en,j) + t * v2 470 continue c 475 a(en,na) = 0.0d0 b(en,na) = 0.0d0 alfr(na) = a(na,na) alfr(en) = a(en,en) if (b(na,na) .lt. 0.0d0) alfr(na) = -alfr(na) if (b(en,en) .lt. 0.0d0) alfr(en) = -alfr(en) beta(na) = dabs(b(na,na)) beta(en) = dabs(b(en,en)) alfi(en) = 0.0d0 alfi(na) = 0.0d0 go to 505 c .......... two complex roots .......... 480 e = e + c ei = dsqrt(-d) a11r = a11 - e * b11 a11i = ei * b11 a12r = a12 - e * b12 a12i = ei * b12 a22r = a22 - e * b22 a22i = ei * b22 if (dabs(a11r) + dabs(a11i) + dabs(a12r) + dabs(a12i) .lt. x dabs(a21) + dabs(a22r) + dabs(a22i)) go to 482 a1 = a12r a1i = a12i a2 = -a11r a2i = -a11i go to 485 482 a1 = a22r a1i = a22i a2 = -a21 a2i = 0.0d0 c .......... choose complex z .......... 485 cz = dsqrt(a1*a1+a1i*a1i) if (cz .eq. 0.0d0) go to 487 szr = (a1 * a2 + a1i * a2i) / cz szi = (a1 * a2i - a1i * a2) / cz r = dsqrt(cz*cz+szr*szr+szi*szi) cz = cz / r szr = szr / r szi = szi / r go to 490 487 szr = 1.0d0 szi = 0.0d0 490 if (an .lt. (dabs(e) + ei) * bn) go to 492 a1 = cz * b11 + szr * b12 a1i = szi * b12 a2 = szr * b22 a2i = szi * b22 go to 495 492 a1 = cz * a11 + szr * a12 a1i = szi * a12 a2 = cz * a21 + szr * a22 a2i = szi * a22 c .......... choose complex q .......... 495 cq = dsqrt(a1*a1+a1i*a1i) if (cq .eq. 0.0d0) go to 497 sqr = (a1 * a2 + a1i * a2i) / cq sqi = (a1 * a2i - a1i * a2) / cq r = dsqrt(cq*cq+sqr*sqr+sqi*sqi) cq = cq / r sqr = sqr / r sqi = sqi / r go to 500 497 sqr = 1.0d0 sqi = 0.0d0 c .......... compute diagonal elements that would result c if transformations were applied .......... 500 ssr = sqr * szr + sqi * szi ssi = sqr * szi - sqi * szr i = 1 tr = cq * cz * a11 + cq * szr * a12 + sqr * cz * a21 x + ssr * a22 ti = cq * szi * a12 - sqi * cz * a21 + ssi * a22 dr = cq * cz * b11 + cq * szr * b12 + ssr * b22 di = cq * szi * b12 + ssi * b22 go to 503 502 i = 2 tr = ssr * a11 - sqr * cz * a12 - cq * szr * a21 x + cq * cz * a22 ti = -ssi * a11 - sqi * cz * a12 + cq * szi * a21 dr = ssr * b11 - sqr * cz * b12 + cq * cz * b22 di = -ssi * b11 - sqi * cz * b12 503 t = ti * dr - tr * di j = na if (t .lt. 0.0d0) j = en r = dsqrt(dr*dr+di*di) beta(j) = bn * r alfr(j) = an * (tr * dr + ti * di) / r alfi(j) = an * t / r if (i .eq. 1) go to 502 505 isw = 3 - isw 510 continue b(n,1) = epsb c return end octave-1.1.0/libcruft/fftpack/ 40777 415 17 0 5705521626 14302 5ustar jweusersoctave-1.1.0/libcruft/fftpack/Makefile.in100666 415 17 510 5662226325 16420 0ustar jweusers# # Makefile for octave's libcruft/fftpack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/fftpack/cfftb.f100666 415 17 404 5355151415 15604 0ustar jweusers subroutine cfftb (n,c,wsave) implicit double precision (a-h,o-z) dimension c(1) ,wsave(1) if (n .eq. 1) return iw1 = n+n+1 iw2 = iw1+n+n call cfftb1 (n,c,wsave,wsave(iw1),wsave(iw2)) return end octave-1.1.0/libcruft/fftpack/cfftb1.f100666 415 17 3431 5355151415 15710 0ustar jweusers subroutine cfftb1 (n,c,ch,wa,ifac) implicit double precision (a-h,o-z) dimension ch(1) ,c(1) ,wa(1) ,ifac(1) nf = ifac(2) na = 0 l1 = 1 iw = 1 do 116 k1=1,nf ip = ifac(k1+2) l2 = ip*l1 ido = n/l2 idot = ido+ido idl1 = idot*l1 if (ip .ne. 4) go to 103 ix2 = iw+idot ix3 = ix2+idot if (na .ne. 0) go to 101 call passb4 (idot,l1,c,ch,wa(iw),wa(ix2),wa(ix3)) go to 102 101 call passb4 (idot,l1,ch,c,wa(iw),wa(ix2),wa(ix3)) 102 na = 1-na go to 115 103 if (ip .ne. 2) go to 106 if (na .ne. 0) go to 104 call passb2 (idot,l1,c,ch,wa(iw)) go to 105 104 call passb2 (idot,l1,ch,c,wa(iw)) 105 na = 1-na go to 115 106 if (ip .ne. 3) go to 109 ix2 = iw+idot if (na .ne. 0) go to 107 call passb3 (idot,l1,c,ch,wa(iw),wa(ix2)) go to 108 107 call passb3 (idot,l1,ch,c,wa(iw),wa(ix2)) 108 na = 1-na go to 115 109 if (ip .ne. 5) go to 112 ix2 = iw+idot ix3 = ix2+idot ix4 = ix3+idot if (na .ne. 0) go to 110 call passb5 (idot,l1,c,ch,wa(iw),wa(ix2),wa(ix3),wa(ix4)) go to 111 110 call passb5 (idot,l1,ch,c,wa(iw),wa(ix2),wa(ix3),wa(ix4)) 111 na = 1-na go to 115 112 if (na .ne. 0) go to 113 call passb (nac,idot,ip,l1,idl1,c,c,c,ch,ch,wa(iw)) go to 114 113 call passb (nac,idot,ip,l1,idl1,ch,ch,ch,c,c,wa(iw)) 114 if (nac .ne. 0) na = 1-na 115 l1 = l2 iw = iw+(ip-1)*idot 116 continue if (na .eq. 0) return n2 = n+n do 117 i=1,n2 c(i) = ch(i) 117 continue return end octave-1.1.0/libcruft/fftpack/cfftf.f100666 415 17 404 5355151415 15610 0ustar jweusers subroutine cfftf (n,c,wsave) implicit double precision (a-h,o-z) dimension c(1) ,wsave(1) if (n .eq. 1) return iw1 = n+n+1 iw2 = iw1+n+n call cfftf1 (n,c,wsave,wsave(iw1),wsave(iw2)) return end octave-1.1.0/libcruft/fftpack/cfftf1.f100666 415 17 3431 5355151415 15714 0ustar jweusers subroutine cfftf1 (n,c,ch,wa,ifac) implicit double precision (a-h,o-z) dimension ch(1) ,c(1) ,wa(1) ,ifac(1) nf = ifac(2) na = 0 l1 = 1 iw = 1 do 116 k1=1,nf ip = ifac(k1+2) l2 = ip*l1 ido = n/l2 idot = ido+ido idl1 = idot*l1 if (ip .ne. 4) go to 103 ix2 = iw+idot ix3 = ix2+idot if (na .ne. 0) go to 101 call passf4 (idot,l1,c,ch,wa(iw),wa(ix2),wa(ix3)) go to 102 101 call passf4 (idot,l1,ch,c,wa(iw),wa(ix2),wa(ix3)) 102 na = 1-na go to 115 103 if (ip .ne. 2) go to 106 if (na .ne. 0) go to 104 call passf2 (idot,l1,c,ch,wa(iw)) go to 105 104 call passf2 (idot,l1,ch,c,wa(iw)) 105 na = 1-na go to 115 106 if (ip .ne. 3) go to 109 ix2 = iw+idot if (na .ne. 0) go to 107 call passf3 (idot,l1,c,ch,wa(iw),wa(ix2)) go to 108 107 call passf3 (idot,l1,ch,c,wa(iw),wa(ix2)) 108 na = 1-na go to 115 109 if (ip .ne. 5) go to 112 ix2 = iw+idot ix3 = ix2+idot ix4 = ix3+idot if (na .ne. 0) go to 110 call passf5 (idot,l1,c,ch,wa(iw),wa(ix2),wa(ix3),wa(ix4)) go to 111 110 call passf5 (idot,l1,ch,c,wa(iw),wa(ix2),wa(ix3),wa(ix4)) 111 na = 1-na go to 115 112 if (na .ne. 0) go to 113 call passf (nac,idot,ip,l1,idl1,c,c,c,ch,ch,wa(iw)) go to 114 113 call passf (nac,idot,ip,l1,idl1,ch,ch,ch,c,c,wa(iw)) 114 if (nac .ne. 0) na = 1-na 115 l1 = l2 iw = iw+(ip-1)*idot 116 continue if (na .eq. 0) return n2 = n+n do 117 i=1,n2 c(i) = ch(i) 117 continue return end octave-1.1.0/libcruft/fftpack/cffti.f100666 415 17 356 5355151415 15621 0ustar jweusers subroutine cffti (n,wsave) implicit double precision (a-h,o-z) dimension wsave(1) if (n .eq. 1) return iw1 = n+n+1 iw2 = iw1+n+n call cffti1 (n,wsave(iw1),wsave(iw2)) return end octave-1.1.0/libcruft/fftpack/cffti1.f100666 415 17 2650 5355151415 15721 0ustar jweusers subroutine cffti1 (n,wa,ifac) implicit double precision (a-h,o-z) dimension wa(1) ,ifac(1) ,ntryh(4) data ntryh(1),ntryh(2),ntryh(3),ntryh(4)/3,4,2,5/ nl = n nf = 0 j = 0 101 j = j+1 if (j-4) 102,102,103 102 ntry = ntryh(j) go to 104 103 ntry = ntry+2 104 nq = nl/ntry nr = nl-ntry*nq if (nr) 101,105,101 105 nf = nf+1 ifac(nf+2) = ntry nl = nq if (ntry .ne. 2) go to 107 if (nf .eq. 1) go to 107 do 106 i=2,nf ib = nf-i+2 ifac(ib+2) = ifac(ib+1) 106 continue ifac(3) = 2 107 if (nl .ne. 1) go to 104 ifac(1) = n ifac(2) = nf tpi = 6.28318530717959d0 argh = tpi/dble(n) i = 2 l1 = 1 do 110 k1=1,nf ip = ifac(k1+2) ld = 0 l2 = l1*ip ido = n/l2 idot = ido+ido+2 ipm = ip-1 do 109 j=1,ipm i1 = i wa(i-1) = 1. wa(i) = 0. ld = ld+l1 fi = 0. argld = dble(ld)*argh do 108 ii=4,idot,2 i = i+2 fi = fi+1. arg = fi*argld wa(i-1) = cos(arg) wa(i) = sin(arg) 108 continue if (ip .le. 5) go to 109 wa(i1-1) = wa(i-1) wa(i1) = wa(i) 109 continue l1 = l2 110 continue return end octave-1.1.0/libcruft/fftpack/passb.f100666 415 17 6234 5355151415 15657 0ustar jweusers subroutine passb (nac,ido,ip,l1,idl1,cc,c1,c2,ch,ch2,wa) implicit double precision (a-h,o-z) dimension ch(ido,l1,ip) ,cc(ido,ip,l1) , 1 c1(ido,l1,ip) ,wa(1) ,c2(idl1,ip), 2 ch2(idl1,ip) idot = ido/2 nt = ip*idl1 ipp2 = ip+2 ipph = (ip+1)/2 idp = ip*ido c if (ido .lt. l1) go to 106 do 103 j=2,ipph jc = ipp2-j do 102 k=1,l1 do 101 i=1,ido ch(i,k,j) = cc(i,j,k)+cc(i,jc,k) ch(i,k,jc) = cc(i,j,k)-cc(i,jc,k) 101 continue 102 continue 103 continue do 105 k=1,l1 do 104 i=1,ido ch(i,k,1) = cc(i,1,k) 104 continue 105 continue go to 112 106 do 109 j=2,ipph jc = ipp2-j do 108 i=1,ido do 107 k=1,l1 ch(i,k,j) = cc(i,j,k)+cc(i,jc,k) ch(i,k,jc) = cc(i,j,k)-cc(i,jc,k) 107 continue 108 continue 109 continue do 111 i=1,ido do 110 k=1,l1 ch(i,k,1) = cc(i,1,k) 110 continue 111 continue 112 idl = 2-ido inc = 0 do 116 l=2,ipph lc = ipp2-l idl = idl+ido do 113 ik=1,idl1 c2(ik,l) = ch2(ik,1)+wa(idl-1)*ch2(ik,2) c2(ik,lc) = wa(idl)*ch2(ik,ip) 113 continue idlj = idl inc = inc+ido do 115 j=3,ipph jc = ipp2-j idlj = idlj+inc if (idlj .gt. idp) idlj = idlj-idp war = wa(idlj-1) wai = wa(idlj) do 114 ik=1,idl1 c2(ik,l) = c2(ik,l)+war*ch2(ik,j) c2(ik,lc) = c2(ik,lc)+wai*ch2(ik,jc) 114 continue 115 continue 116 continue do 118 j=2,ipph do 117 ik=1,idl1 ch2(ik,1) = ch2(ik,1)+ch2(ik,j) 117 continue 118 continue do 120 j=2,ipph jc = ipp2-j do 119 ik=2,idl1,2 ch2(ik-1,j) = c2(ik-1,j)-c2(ik,jc) ch2(ik-1,jc) = c2(ik-1,j)+c2(ik,jc) ch2(ik,j) = c2(ik,j)+c2(ik-1,jc) ch2(ik,jc) = c2(ik,j)-c2(ik-1,jc) 119 continue 120 continue nac = 1 if (ido .eq. 2) return nac = 0 do 121 ik=1,idl1 c2(ik,1) = ch2(ik,1) 121 continue do 123 j=2,ip do 122 k=1,l1 c1(1,k,j) = ch(1,k,j) c1(2,k,j) = ch(2,k,j) 122 continue 123 continue if (idot .gt. l1) go to 127 idij = 0 do 126 j=2,ip idij = idij+2 do 125 i=4,ido,2 idij = idij+2 do 124 k=1,l1 c1(i-1,k,j) = wa(idij-1)*ch(i-1,k,j)-wa(idij)*ch(i,k,j) c1(i,k,j) = wa(idij-1)*ch(i,k,j)+wa(idij)*ch(i-1,k,j) 124 continue 125 continue 126 continue return 127 idj = 2-ido do 130 j=2,ip idj = idj+ido do 129 k=1,l1 idij = idj do 128 i=4,ido,2 idij = idij+2 c1(i-1,k,j) = wa(idij-1)*ch(i-1,k,j)-wa(idij)*ch(i,k,j) c1(i,k,j) = wa(idij-1)*ch(i,k,j)+wa(idij)*ch(i-1,k,j) 128 continue 129 continue 130 continue return end octave-1.1.0/libcruft/fftpack/passb2.f100666 415 17 1443 5355151415 15736 0ustar jweusers subroutine passb2 (ido,l1,cc,ch,wa1) implicit double precision (a-h,o-z) dimension cc(ido,2,l1) ,ch(ido,l1,2) , 1 wa1(1) if (ido .gt. 2) go to 102 do 101 k=1,l1 ch(1,k,1) = cc(1,1,k)+cc(1,2,k) ch(1,k,2) = cc(1,1,k)-cc(1,2,k) ch(2,k,1) = cc(2,1,k)+cc(2,2,k) ch(2,k,2) = cc(2,1,k)-cc(2,2,k) 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ch(i-1,k,1) = cc(i-1,1,k)+cc(i-1,2,k) tr2 = cc(i-1,1,k)-cc(i-1,2,k) ch(i,k,1) = cc(i,1,k)+cc(i,2,k) ti2 = cc(i,1,k)-cc(i,2,k) ch(i,k,2) = wa1(i-1)*ti2+wa1(i)*tr2 ch(i-1,k,2) = wa1(i-1)*tr2-wa1(i)*ti2 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passb3.f100666 415 17 2671 5355151416 15744 0ustar jweusers subroutine passb3 (ido,l1,cc,ch,wa1,wa2) implicit double precision (a-h,o-z) dimension cc(ido,3,l1) ,ch(ido,l1,3) , 1 wa1(1) ,wa2(1) data taur,taui /-.5,.866025403784439/ if (ido .ne. 2) go to 102 do 101 k=1,l1 tr2 = cc(1,2,k)+cc(1,3,k) cr2 = cc(1,1,k)+taur*tr2 ch(1,k,1) = cc(1,1,k)+tr2 ti2 = cc(2,2,k)+cc(2,3,k) ci2 = cc(2,1,k)+taur*ti2 ch(2,k,1) = cc(2,1,k)+ti2 cr3 = taui*(cc(1,2,k)-cc(1,3,k)) ci3 = taui*(cc(2,2,k)-cc(2,3,k)) ch(1,k,2) = cr2-ci3 ch(1,k,3) = cr2+ci3 ch(2,k,2) = ci2+cr3 ch(2,k,3) = ci2-cr3 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 tr2 = cc(i-1,2,k)+cc(i-1,3,k) cr2 = cc(i-1,1,k)+taur*tr2 ch(i-1,k,1) = cc(i-1,1,k)+tr2 ti2 = cc(i,2,k)+cc(i,3,k) ci2 = cc(i,1,k)+taur*ti2 ch(i,k,1) = cc(i,1,k)+ti2 cr3 = taui*(cc(i-1,2,k)-cc(i-1,3,k)) ci3 = taui*(cc(i,2,k)-cc(i,3,k)) dr2 = cr2-ci3 dr3 = cr2+ci3 di2 = ci2+cr3 di3 = ci2-cr3 ch(i,k,2) = wa1(i-1)*di2+wa1(i)*dr2 ch(i-1,k,2) = wa1(i-1)*dr2-wa1(i)*di2 ch(i,k,3) = wa2(i-1)*di3+wa2(i)*dr3 ch(i-1,k,3) = wa2(i-1)*dr3-wa2(i)*di3 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passb4.f100666 415 17 3323 5355151416 15740 0ustar jweusers subroutine passb4 (ido,l1,cc,ch,wa1,wa2,wa3) implicit double precision (a-h,o-z) dimension cc(ido,4,l1) ,ch(ido,l1,4) , 1 wa1(1) ,wa2(1) ,wa3(1) if (ido .ne. 2) go to 102 do 101 k=1,l1 ti1 = cc(2,1,k)-cc(2,3,k) ti2 = cc(2,1,k)+cc(2,3,k) tr4 = cc(2,4,k)-cc(2,2,k) ti3 = cc(2,2,k)+cc(2,4,k) tr1 = cc(1,1,k)-cc(1,3,k) tr2 = cc(1,1,k)+cc(1,3,k) ti4 = cc(1,2,k)-cc(1,4,k) tr3 = cc(1,2,k)+cc(1,4,k) ch(1,k,1) = tr2+tr3 ch(1,k,3) = tr2-tr3 ch(2,k,1) = ti2+ti3 ch(2,k,3) = ti2-ti3 ch(1,k,2) = tr1+tr4 ch(1,k,4) = tr1-tr4 ch(2,k,2) = ti1+ti4 ch(2,k,4) = ti1-ti4 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ti1 = cc(i,1,k)-cc(i,3,k) ti2 = cc(i,1,k)+cc(i,3,k) ti3 = cc(i,2,k)+cc(i,4,k) tr4 = cc(i,4,k)-cc(i,2,k) tr1 = cc(i-1,1,k)-cc(i-1,3,k) tr2 = cc(i-1,1,k)+cc(i-1,3,k) ti4 = cc(i-1,2,k)-cc(i-1,4,k) tr3 = cc(i-1,2,k)+cc(i-1,4,k) ch(i-1,k,1) = tr2+tr3 cr3 = tr2-tr3 ch(i,k,1) = ti2+ti3 ci3 = ti2-ti3 cr2 = tr1+tr4 cr4 = tr1-tr4 ci2 = ti1+ti4 ci4 = ti1-ti4 ch(i-1,k,2) = wa1(i-1)*cr2-wa1(i)*ci2 ch(i,k,2) = wa1(i-1)*ci2+wa1(i)*cr2 ch(i-1,k,3) = wa2(i-1)*cr3-wa2(i)*ci3 ch(i,k,3) = wa2(i-1)*ci3+wa2(i)*cr3 ch(i-1,k,4) = wa3(i-1)*cr4-wa3(i)*ci4 ch(i,k,4) = wa3(i-1)*ci4+wa3(i)*cr4 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passb5.f100666 415 17 5306 5355151416 15744 0ustar jweusers subroutine passb5 (ido,l1,cc,ch,wa1,wa2,wa3,wa4) implicit double precision (a-h,o-z) dimension cc(ido,5,l1) ,ch(ido,l1,5) , 1 wa1(1) ,wa2(1) ,wa3(1) ,wa4(1) data tr11,ti11,tr12,ti12 /.309016994374947,.951056516295154, 1-.809016994374947,.587785252292473/ if (ido .ne. 2) go to 102 do 101 k=1,l1 ti5 = cc(2,2,k)-cc(2,5,k) ti2 = cc(2,2,k)+cc(2,5,k) ti4 = cc(2,3,k)-cc(2,4,k) ti3 = cc(2,3,k)+cc(2,4,k) tr5 = cc(1,2,k)-cc(1,5,k) tr2 = cc(1,2,k)+cc(1,5,k) tr4 = cc(1,3,k)-cc(1,4,k) tr3 = cc(1,3,k)+cc(1,4,k) ch(1,k,1) = cc(1,1,k)+tr2+tr3 ch(2,k,1) = cc(2,1,k)+ti2+ti3 cr2 = cc(1,1,k)+tr11*tr2+tr12*tr3 ci2 = cc(2,1,k)+tr11*ti2+tr12*ti3 cr3 = cc(1,1,k)+tr12*tr2+tr11*tr3 ci3 = cc(2,1,k)+tr12*ti2+tr11*ti3 cr5 = ti11*tr5+ti12*tr4 ci5 = ti11*ti5+ti12*ti4 cr4 = ti12*tr5-ti11*tr4 ci4 = ti12*ti5-ti11*ti4 ch(1,k,2) = cr2-ci5 ch(1,k,5) = cr2+ci5 ch(2,k,2) = ci2+cr5 ch(2,k,3) = ci3+cr4 ch(1,k,3) = cr3-ci4 ch(1,k,4) = cr3+ci4 ch(2,k,4) = ci3-cr4 ch(2,k,5) = ci2-cr5 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ti5 = cc(i,2,k)-cc(i,5,k) ti2 = cc(i,2,k)+cc(i,5,k) ti4 = cc(i,3,k)-cc(i,4,k) ti3 = cc(i,3,k)+cc(i,4,k) tr5 = cc(i-1,2,k)-cc(i-1,5,k) tr2 = cc(i-1,2,k)+cc(i-1,5,k) tr4 = cc(i-1,3,k)-cc(i-1,4,k) tr3 = cc(i-1,3,k)+cc(i-1,4,k) ch(i-1,k,1) = cc(i-1,1,k)+tr2+tr3 ch(i,k,1) = cc(i,1,k)+ti2+ti3 cr2 = cc(i-1,1,k)+tr11*tr2+tr12*tr3 ci2 = cc(i,1,k)+tr11*ti2+tr12*ti3 cr3 = cc(i-1,1,k)+tr12*tr2+tr11*tr3 ci3 = cc(i,1,k)+tr12*ti2+tr11*ti3 cr5 = ti11*tr5+ti12*tr4 ci5 = ti11*ti5+ti12*ti4 cr4 = ti12*tr5-ti11*tr4 ci4 = ti12*ti5-ti11*ti4 dr3 = cr3-ci4 dr4 = cr3+ci4 di3 = ci3+cr4 di4 = ci3-cr4 dr5 = cr2+ci5 dr2 = cr2-ci5 di5 = ci2-cr5 di2 = ci2+cr5 ch(i-1,k,2) = wa1(i-1)*dr2-wa1(i)*di2 ch(i,k,2) = wa1(i-1)*di2+wa1(i)*dr2 ch(i-1,k,3) = wa2(i-1)*dr3-wa2(i)*di3 ch(i,k,3) = wa2(i-1)*di3+wa2(i)*dr3 ch(i-1,k,4) = wa3(i-1)*dr4-wa3(i)*di4 ch(i,k,4) = wa3(i-1)*di4+wa3(i)*dr4 ch(i-1,k,5) = wa4(i-1)*dr5-wa4(i)*di5 ch(i,k,5) = wa4(i-1)*di5+wa4(i)*dr5 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passf.f100666 415 17 6235 5355151416 15665 0ustar jweusers subroutine passf (nac,ido,ip,l1,idl1,cc,c1,c2,ch,ch2,wa) implicit double precision (a-h,o-z) dimension ch(ido,l1,ip) ,cc(ido,ip,l1) , 1 c1(ido,l1,ip) ,wa(1) ,c2(idl1,ip), 2 ch2(idl1,ip) idot = ido/2 nt = ip*idl1 ipp2 = ip+2 ipph = (ip+1)/2 idp = ip*ido c if (ido .lt. l1) go to 106 do 103 j=2,ipph jc = ipp2-j do 102 k=1,l1 do 101 i=1,ido ch(i,k,j) = cc(i,j,k)+cc(i,jc,k) ch(i,k,jc) = cc(i,j,k)-cc(i,jc,k) 101 continue 102 continue 103 continue do 105 k=1,l1 do 104 i=1,ido ch(i,k,1) = cc(i,1,k) 104 continue 105 continue go to 112 106 do 109 j=2,ipph jc = ipp2-j do 108 i=1,ido do 107 k=1,l1 ch(i,k,j) = cc(i,j,k)+cc(i,jc,k) ch(i,k,jc) = cc(i,j,k)-cc(i,jc,k) 107 continue 108 continue 109 continue do 111 i=1,ido do 110 k=1,l1 ch(i,k,1) = cc(i,1,k) 110 continue 111 continue 112 idl = 2-ido inc = 0 do 116 l=2,ipph lc = ipp2-l idl = idl+ido do 113 ik=1,idl1 c2(ik,l) = ch2(ik,1)+wa(idl-1)*ch2(ik,2) c2(ik,lc) = -wa(idl)*ch2(ik,ip) 113 continue idlj = idl inc = inc+ido do 115 j=3,ipph jc = ipp2-j idlj = idlj+inc if (idlj .gt. idp) idlj = idlj-idp war = wa(idlj-1) wai = wa(idlj) do 114 ik=1,idl1 c2(ik,l) = c2(ik,l)+war*ch2(ik,j) c2(ik,lc) = c2(ik,lc)-wai*ch2(ik,jc) 114 continue 115 continue 116 continue do 118 j=2,ipph do 117 ik=1,idl1 ch2(ik,1) = ch2(ik,1)+ch2(ik,j) 117 continue 118 continue do 120 j=2,ipph jc = ipp2-j do 119 ik=2,idl1,2 ch2(ik-1,j) = c2(ik-1,j)-c2(ik,jc) ch2(ik-1,jc) = c2(ik-1,j)+c2(ik,jc) ch2(ik,j) = c2(ik,j)+c2(ik-1,jc) ch2(ik,jc) = c2(ik,j)-c2(ik-1,jc) 119 continue 120 continue nac = 1 if (ido .eq. 2) return nac = 0 do 121 ik=1,idl1 c2(ik,1) = ch2(ik,1) 121 continue do 123 j=2,ip do 122 k=1,l1 c1(1,k,j) = ch(1,k,j) c1(2,k,j) = ch(2,k,j) 122 continue 123 continue if (idot .gt. l1) go to 127 idij = 0 do 126 j=2,ip idij = idij+2 do 125 i=4,ido,2 idij = idij+2 do 124 k=1,l1 c1(i-1,k,j) = wa(idij-1)*ch(i-1,k,j)+wa(idij)*ch(i,k,j) c1(i,k,j) = wa(idij-1)*ch(i,k,j)-wa(idij)*ch(i-1,k,j) 124 continue 125 continue 126 continue return 127 idj = 2-ido do 130 j=2,ip idj = idj+ido do 129 k=1,l1 idij = idj do 128 i=4,ido,2 idij = idij+2 c1(i-1,k,j) = wa(idij-1)*ch(i-1,k,j)+wa(idij)*ch(i,k,j) c1(i,k,j) = wa(idij-1)*ch(i,k,j)-wa(idij)*ch(i-1,k,j) 128 continue 129 continue 130 continue return end octave-1.1.0/libcruft/fftpack/passf2.f100666 415 17 1443 5355151416 15743 0ustar jweusers subroutine passf2 (ido,l1,cc,ch,wa1) implicit double precision (a-h,o-z) dimension cc(ido,2,l1) ,ch(ido,l1,2) , 1 wa1(1) if (ido .gt. 2) go to 102 do 101 k=1,l1 ch(1,k,1) = cc(1,1,k)+cc(1,2,k) ch(1,k,2) = cc(1,1,k)-cc(1,2,k) ch(2,k,1) = cc(2,1,k)+cc(2,2,k) ch(2,k,2) = cc(2,1,k)-cc(2,2,k) 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ch(i-1,k,1) = cc(i-1,1,k)+cc(i-1,2,k) tr2 = cc(i-1,1,k)-cc(i-1,2,k) ch(i,k,1) = cc(i,1,k)+cc(i,2,k) ti2 = cc(i,1,k)-cc(i,2,k) ch(i,k,2) = wa1(i-1)*ti2-wa1(i)*tr2 ch(i-1,k,2) = wa1(i-1)*tr2+wa1(i)*ti2 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passf3.f100666 415 17 2672 5355151416 15751 0ustar jweusers subroutine passf3 (ido,l1,cc,ch,wa1,wa2) implicit double precision (a-h,o-z) dimension cc(ido,3,l1) ,ch(ido,l1,3) , 1 wa1(1) ,wa2(1) data taur,taui /-.5,-.866025403784439/ if (ido .ne. 2) go to 102 do 101 k=1,l1 tr2 = cc(1,2,k)+cc(1,3,k) cr2 = cc(1,1,k)+taur*tr2 ch(1,k,1) = cc(1,1,k)+tr2 ti2 = cc(2,2,k)+cc(2,3,k) ci2 = cc(2,1,k)+taur*ti2 ch(2,k,1) = cc(2,1,k)+ti2 cr3 = taui*(cc(1,2,k)-cc(1,3,k)) ci3 = taui*(cc(2,2,k)-cc(2,3,k)) ch(1,k,2) = cr2-ci3 ch(1,k,3) = cr2+ci3 ch(2,k,2) = ci2+cr3 ch(2,k,3) = ci2-cr3 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 tr2 = cc(i-1,2,k)+cc(i-1,3,k) cr2 = cc(i-1,1,k)+taur*tr2 ch(i-1,k,1) = cc(i-1,1,k)+tr2 ti2 = cc(i,2,k)+cc(i,3,k) ci2 = cc(i,1,k)+taur*ti2 ch(i,k,1) = cc(i,1,k)+ti2 cr3 = taui*(cc(i-1,2,k)-cc(i-1,3,k)) ci3 = taui*(cc(i,2,k)-cc(i,3,k)) dr2 = cr2-ci3 dr3 = cr2+ci3 di2 = ci2+cr3 di3 = ci2-cr3 ch(i,k,2) = wa1(i-1)*di2-wa1(i)*dr2 ch(i-1,k,2) = wa1(i-1)*dr2+wa1(i)*di2 ch(i,k,3) = wa2(i-1)*di3-wa2(i)*dr3 ch(i-1,k,3) = wa2(i-1)*dr3+wa2(i)*di3 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passf4.f100666 415 17 3323 5355151416 15744 0ustar jweusers subroutine passf4 (ido,l1,cc,ch,wa1,wa2,wa3) implicit double precision (a-h,o-z) dimension cc(ido,4,l1) ,ch(ido,l1,4) , 1 wa1(1) ,wa2(1) ,wa3(1) if (ido .ne. 2) go to 102 do 101 k=1,l1 ti1 = cc(2,1,k)-cc(2,3,k) ti2 = cc(2,1,k)+cc(2,3,k) tr4 = cc(2,2,k)-cc(2,4,k) ti3 = cc(2,2,k)+cc(2,4,k) tr1 = cc(1,1,k)-cc(1,3,k) tr2 = cc(1,1,k)+cc(1,3,k) ti4 = cc(1,4,k)-cc(1,2,k) tr3 = cc(1,2,k)+cc(1,4,k) ch(1,k,1) = tr2+tr3 ch(1,k,3) = tr2-tr3 ch(2,k,1) = ti2+ti3 ch(2,k,3) = ti2-ti3 ch(1,k,2) = tr1+tr4 ch(1,k,4) = tr1-tr4 ch(2,k,2) = ti1+ti4 ch(2,k,4) = ti1-ti4 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ti1 = cc(i,1,k)-cc(i,3,k) ti2 = cc(i,1,k)+cc(i,3,k) ti3 = cc(i,2,k)+cc(i,4,k) tr4 = cc(i,2,k)-cc(i,4,k) tr1 = cc(i-1,1,k)-cc(i-1,3,k) tr2 = cc(i-1,1,k)+cc(i-1,3,k) ti4 = cc(i-1,4,k)-cc(i-1,2,k) tr3 = cc(i-1,2,k)+cc(i-1,4,k) ch(i-1,k,1) = tr2+tr3 cr3 = tr2-tr3 ch(i,k,1) = ti2+ti3 ci3 = ti2-ti3 cr2 = tr1+tr4 cr4 = tr1-tr4 ci2 = ti1+ti4 ci4 = ti1-ti4 ch(i-1,k,2) = wa1(i-1)*cr2+wa1(i)*ci2 ch(i,k,2) = wa1(i-1)*ci2-wa1(i)*cr2 ch(i-1,k,3) = wa2(i-1)*cr3+wa2(i)*ci3 ch(i,k,3) = wa2(i-1)*ci3-wa2(i)*cr3 ch(i-1,k,4) = wa3(i-1)*cr4+wa3(i)*ci4 ch(i,k,4) = wa3(i-1)*ci4-wa3(i)*cr4 103 continue 104 continue return end octave-1.1.0/libcruft/fftpack/passf5.f100666 415 17 5310 5355151416 15743 0ustar jweusers subroutine passf5 (ido,l1,cc,ch,wa1,wa2,wa3,wa4) implicit double precision (a-h,o-z) dimension cc(ido,5,l1) ,ch(ido,l1,5) , 1 wa1(1) ,wa2(1) ,wa3(1) ,wa4(1) data tr11,ti11,tr12,ti12 /.309016994374947,-.951056516295154, 1-.809016994374947,-.587785252292473/ if (ido .ne. 2) go to 102 do 101 k=1,l1 ti5 = cc(2,2,k)-cc(2,5,k) ti2 = cc(2,2,k)+cc(2,5,k) ti4 = cc(2,3,k)-cc(2,4,k) ti3 = cc(2,3,k)+cc(2,4,k) tr5 = cc(1,2,k)-cc(1,5,k) tr2 = cc(1,2,k)+cc(1,5,k) tr4 = cc(1,3,k)-cc(1,4,k) tr3 = cc(1,3,k)+cc(1,4,k) ch(1,k,1) = cc(1,1,k)+tr2+tr3 ch(2,k,1) = cc(2,1,k)+ti2+ti3 cr2 = cc(1,1,k)+tr11*tr2+tr12*tr3 ci2 = cc(2,1,k)+tr11*ti2+tr12*ti3 cr3 = cc(1,1,k)+tr12*tr2+tr11*tr3 ci3 = cc(2,1,k)+tr12*ti2+tr11*ti3 cr5 = ti11*tr5+ti12*tr4 ci5 = ti11*ti5+ti12*ti4 cr4 = ti12*tr5-ti11*tr4 ci4 = ti12*ti5-ti11*ti4 ch(1,k,2) = cr2-ci5 ch(1,k,5) = cr2+ci5 ch(2,k,2) = ci2+cr5 ch(2,k,3) = ci3+cr4 ch(1,k,3) = cr3-ci4 ch(1,k,4) = cr3+ci4 ch(2,k,4) = ci3-cr4 ch(2,k,5) = ci2-cr5 101 continue return 102 do 104 k=1,l1 do 103 i=2,ido,2 ti5 = cc(i,2,k)-cc(i,5,k) ti2 = cc(i,2,k)+cc(i,5,k) ti4 = cc(i,3,k)-cc(i,4,k) ti3 = cc(i,3,k)+cc(i,4,k) tr5 = cc(i-1,2,k)-cc(i-1,5,k) tr2 = cc(i-1,2,k)+cc(i-1,5,k) tr4 = cc(i-1,3,k)-cc(i-1,4,k) tr3 = cc(i-1,3,k)+cc(i-1,4,k) ch(i-1,k,1) = cc(i-1,1,k)+tr2+tr3 ch(i,k,1) = cc(i,1,k)+ti2+ti3 cr2 = cc(i-1,1,k)+tr11*tr2+tr12*tr3 ci2 = cc(i,1,k)+tr11*ti2+tr12*ti3 cr3 = cc(i-1,1,k)+tr12*tr2+tr11*tr3 ci3 = cc(i,1,k)+tr12*ti2+tr11*ti3 cr5 = ti11*tr5+ti12*tr4 ci5 = ti11*ti5+ti12*ti4 cr4 = ti12*tr5-ti11*tr4 ci4 = ti12*ti5-ti11*ti4 dr3 = cr3-ci4 dr4 = cr3+ci4 di3 = ci3+cr4 di4 = ci3-cr4 dr5 = cr2+ci5 dr2 = cr2-ci5 di5 = ci2-cr5 di2 = ci2+cr5 ch(i-1,k,2) = wa1(i-1)*dr2+wa1(i)*di2 ch(i,k,2) = wa1(i-1)*di2-wa1(i)*dr2 ch(i-1,k,3) = wa2(i-1)*dr3+wa2(i)*di3 ch(i,k,3) = wa2(i-1)*di3-wa2(i)*dr3 ch(i-1,k,4) = wa3(i-1)*dr4+wa3(i)*di4 ch(i,k,4) = wa3(i-1)*di4-wa3(i)*dr4 ch(i-1,k,5) = wa4(i-1)*dr5+wa4(i)*di5 ch(i,k,5) = wa4(i-1)*di5-wa4(i)*dr5 103 continue 104 continue return end octave-1.1.0/libcruft/fsqp/ 40777 415 17 0 5705521630 13630 5ustar jweusersoctave-1.1.0/libcruft/fsqp/Makefile.in100666 415 17 757 5662226323 15766 0ustar jweusers# # Makefile for octave's libcruft/fsqp directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ SPECIAL = COPYRIGHT README Version macros.tex manua2.tex \ manual.sty manual.tex sampl1.for sampl2.for sampl3.for EXTERNAL_DISTFILES = Makefile.in COPYRIGHT README README.MISSING \ ql0001.f ql0002.f include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/fsqp/COPYRIGHT100666 415 17 2470 5276236331 15227 0ustar jweusersDate: Sat, 30 May 92 11:37:56 EDT To: fsqp_sites@src.umd.edu From: Andre Tits Subject: FSQP 3.0 1/12: COPYRIGHT Conditions for External Use 1. The FSQP routines may not be distributed to third parties. Interested parties should contact the authors directly. 2. If modifications are performed on the routines, these modifications shall be communicated to the authors. The modified routines will remain the sole property of the authors. 3. Due acknowledgment must be made of the use of the FSQP routines in research reports or publications. A copy of such reports or publications should be forwarded to the authors. 4. The FSQP routines may not be used for commercial applications, unless this has been agreed upon with the authors in writing. Copyright (c) 1989 --- 1992 by Jian L. Zhou and Andre L. Tits. All rights Reserved. Enquiries should be directed to Prof. Andre L. Tits Electrical Engineering Dept. and Systems Research Center University of Maryland College Park, Md 20742 U. S. A. Phone: 301-405-3669 Fax: 301-405-6707 E-mail: andre@src.umd.edu octave-1.1.0/libcruft/fsqp/README100666 415 17 2531 5276236331 14612 0ustar jweusersDate: Sat, 30 May 92 11:37:57 EDT To: fsqp_sites@src.umd.edu From: Andre Tits Subject: FSQP 3.0 2/12: README The FSQP distribution consists of the following files: COPYRIGHT README (this file) Version* fsqpd.f macros.tex manual.sty manual.tex manua2.tex qld.f sampl1.f sampl2.f sampl3.f We suggest that you keep all these files in a dedicated subdirectory. All the FSQP routines are in fsqpd.f. FSQP requires a quadratic program solver. As distributed, it calls QLD (written by Klaus Schittkowski, provided in file qld.f for the user's convenience). Three sample test problems are given in sampl1.f, sampl2.f and sampl3.f. Thus, for example, to run sample1.f one should use the following compiling sequence on a UNIX-based system f77 sampl1.f fsqpd.f qld.f The results obtained should be compared with those given in the User's Guide. The User's Guide is provided in latex format (files manual.tex, manua2.tex, macros.tex and manual.sty). It provides detailed information concerning FSQP and its use. Simply type latex manual.tex with files manua2.tex, manual.sty and macros.tex present in the same directory. Finally, the file Versionx.x lists the enhancements in the successive versions of FSQP. Please send us your comments. Any feedback is highly appreciated. octave-1.1.0/libcruft/fsqp/README.MISSING100666 415 17 1347 5300576513 15723 0ustar jweusersIf it were freely redistributable, the source for Tits and Zhou's nonlinear programming solver FSQP would be in this directory. Unfortunately, if you want octave to use FSQP to solve constrained nonlinear optimization problems, you must get the source from the FSQP authors. Enquiries should be directed to: Prof. Andre L. Tits Electrical Engineering Dept. and Systems Research Center University of Maryland College Park, MD 20742 USA Phone: 301-405-3669 Fax: 301-405-6707 E-mail: andre@src.umd.edu As of November, 1992, the routines were available free of charge to academic sites. I do not know what the distribution terms are for others. See the file COPYRIGHT in the directory for more information. octave-1.1.0/libcruft/fsqp/ql0001.f100666 415 17 17243 5414717440 15043 0ustar jweusers SUBROUTINE QL0001(M,ME,MMAX,N,NMAX,MNN,C,D,A,B,XL,XU, 1 X,U,IOUT,IFAIL,IPRINT,WAR,LWAR,IWAR,LIWAR) c cCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC c c !!!! NOTICE !!!! c c 1. The routines contained in this file are due to Prof. K.Schittkowski c of the University of Bayreuth, Germany (modification of routines c due to Prof. MJD Powell at the University of Cambridge). They can c be freely distributed. c c 2. A minor modification was performed at the University of Maryland. c It is marked in the code by "c umd". c c A.L. Tits and J.L. Zhou c University of Maryland C C*********************************************************************** C C C SOLUTION OF QUADRATIC PROGRAMMING PROBLEMS C C C C QL0001 SOLVES THE QUADRATIC PROGRAMMING PROBLEM C C MINIMIZE .5*X'*C*X + D'*X C SUBJECT TO A(J)*X + B(J) = 0 , J=1,...,ME C A(J)*X + B(J) >= 0 , J=ME+1,...,M C XL <= X <= XU C C HERE C MUST BE AN N BY N SYMMETRIC AND POSITIVE MATRIX, D AN N-DIMENSIONAL C VECTOR, A AN M BY N MATRIX AND B AN M-DIMENSIONAL VECTOR. THE ABOVE C SITUATION IS INDICATED BY IWAR(1)=1. ALTERNATIVELY, I.E. IF IWAR(1)=0, C THE OBJECTIVE FUNCTION MATRIX CAN ALSO BE PROVIDED IN FACTORIZED FORM. C IN THIS CASE, C IS AN UPPER TRIANGULAR MATRIX. C C THE SUBROUTINE REORGANIZES SOME DATA SO THAT THE PROBLEM CAN BE SOLVED C BY A MODIFICATION OF AN ALGORITHM PROPOSED BY POWELL (1983). C C C USAGE: C C QL0001(M,ME,MMAX,N,NMAX,MNN,C,D,A,B,XL,XU,X,U,IOUT,IFAIL,IPRINT, C WAR,LWAR,IWAR,LIWAR) C C C DEFINITION OF THE PARAMETERS: C C M : TOTAL NUMBER OF CONSTRAINTS. C ME : NUMBER OF EQUALITY CONSTRAINTS. C MMAX : ROW DIMENSION OF A. MMAX MUST BE AT LEAST ONE AND GREATER C THAN M. C N : NUMBER OF VARIABLES. C NMAX : ROW DIMENSION OF C. NMAX MUST BE GREATER OR EQUAL TO N. C MNN : MUST BE EQUAL TO M + N + N. C C(NMAX,NMAX): OBJECTIVE FUNCTION MATRIX WHICH SHOULD BE SYMMETRIC AND C POSITIVE DEFINITE. IF IWAR(1) = 0, C IS SUPPOSED TO BE THE C CHOLESKEY-FACTOR OF ANOTHER MATRIX, I.E. C IS UPPER C TRIANGULAR. C D(NMAX) : CONTAINS THE CONSTANT VECTOR OF THE OBJECTIVE FUNCTION. C A(MMAX,NMAX): CONTAINS THE DATA MATRIX OF THE LINEAR CONSTRAINTS. C B(MMAX) : CONTAINS THE CONSTANT DATA OF THE LINEAR CONSTRAINTS. C XL(N),XU(N): CONTAIN THE LOWER AND UPPER BOUNDS FOR THE VARIABLES. C X(N) : ON RETURN, X CONTAINS THE OPTIMAL SOLUTION VECTOR. C U(MNN) : ON RETURN, U CONTAINS THE LAGRANGE MULTIPLIERS. THE FIRST C M POSITIONS ARE RESERVED FOR THE MULTIPLIERS OF THE M C LINEAR CONSTRAINTS AND THE SUBSEQUENT ONES FOR THE C MULTIPLIERS OF THE LOWER AND UPPER BOUNDS. ON SUCCESSFUL C TERMINATION, ALL VALUES OF U WITH RESPECT TO INEQUALITIES C AND BOUNDS SHOULD BE GREATER OR EQUAL TO ZERO. C IOUT : INTEGER INDICATING THE DESIRED OUTPUT UNIT NUMBER, I.E. C ALL WRITE-STATEMENTS START WITH 'WRITE(IOUT,... '. C IFAIL : SHOWS THE TERMINATION REASON. C IFAIL = 0 : SUCCESSFUL RETURN. C IFAIL = 1 : TOO MANY ITERATIONS (MORE THAN 40*(N+M)). C IFAIL = 2 : ACCURACY INSUFFICIENT TO SATISFY CONVERGENCE C CRITERION. C IFAIL = 5 : LENGTH OF A WORKING ARRAY IS TOO SHORT. C IFAIL > 10 : THE CONSTRAINTS ARE INCONSISTENT. C IPRINT : OUTPUT CONTROL. C IPRINT = 0 : NO OUTPUT OF QL0001. C IPRINT > 0 : BRIEF OUTPUT IN ERROR CASES. C WAR(LWAR) : REAL WORKING ARRAY. THE LENGTH LWAR SHOULD BE GRATER THAN C NMAX*(3*NMAX+15)/2 + 2*M. C IWAR(LIWAR): INTEGER WORKING ARRAY. THE LENGTH LIWAR SHOULD BE AT C LEAST N. C IF IWAR(1)=0 INITIALLY, THEN THE CHOLESKY DECOMPOSITION C WHICH IS REQUIRED BY THE DUAL ALGORITHM TO GET THE FIRST C UNCONSTRAINED MINIMUM OF THE OBJECTIVE FUNCTION, IS C PERFORMED INTERNALLY. OTHERWISE, I.E. IF IWAR(1)=1, THEN C IT IS ASSUMED THAT THE USER PROVIDES THE INITIAL FAC- C TORIZATION BY HIMSELF AND STORES IT IN THE UPPER TRIAN- C GULAR PART OF THE ARRAY C. C C A NAMED COMMON-BLOCK /CMACHE/EPS MUST BE PROVIDED BY THE USER, C WHERE EPS DEFINES A GUESS FOR THE UNDERLYING MACHINE PRECISION. C C C AUTHOR: K. SCHITTKOWSKI, C MATHEMATISCHES INSTITUT, C UNIVERSITAET BAYREUTH, C 8580 BAYREUTH, C GERMANY, F.R. C C C VERSION: 1.4 (MARCH, 1987) C C C********************************************************************* C C INTEGER NMAX,MMAX,N,MNN,LWAR,LIWAR DIMENSION C(NMAX,NMAX),D(NMAX),A(MMAX,NMAX),B(MMAX), 1 XL(N),XU(N),X(N),U(MNN),WAR(LWAR),IWAR(LIWAR) DOUBLE PRECISION C,D,A,B,X,XL,XU,U,WAR,DIAG,ZERO, 1 EPS,QPEPS,TEN INTEGER M,ME,IOUT,IFAIL,IPRINT,IWAR,INW1,INW2,IN,J,LW,MN,I, 1 IDIAG,INFO,NACT,MAXIT LOGICAL LQL C C INTRINSIC FUNCTIONS: DSQRT C COMMON /CMACHE/EPS C C CONSTANT DATA C c################################################################# c if(c(nmax,nmax).eq.0.d0) c(nmax,nmax)=eps c c umd c This prevents a subsequent more major modification of the Hessian c matrix in the important case when a minmax problem (yielding a c singular Hessian matrix) is being solved. c ----UMCP, April 1991, Jian L. Zhou c################################################################# c LQL=.FALSE. IF (IWAR(1).EQ.1) LQL=.TRUE. ZERO=0.0D+0 TEN=1.D+1 MAXIT=40*(M+N) QPEPS=EPS INW1=1 INW2=INW1+M C C PREPARE PROBLEM DATA FOR EXECUTION C IF (M.LE.0) GOTO 20 IN=INW1 DO 10 J=1,M WAR(IN)=-B(J) 10 IN=IN+1 20 LW=NMAX*(3*NMAX+15)/2 + M IF (INW2+LW-1 .GT. LWAR) GOTO 80 IF (LIWAR.LT.N) GOTO 81 IF (MNN.LT.M+N+N) GOTO 82 MN=M+N C C CALL OF QL0002 C CALL QL0002(N,M,ME,MMAX,MN,MNN,NMAX,LQL,A,WAR(INW1), 1 D,C,XL,XU,X,NACT,IWAR,MAXIT,QPEPS,INFO,DIAG, 2 WAR(INW2),LW) C C TEST OF MATRIX CORRECTIONS C IFAIL=0 IF (INFO.EQ.1) GOTO 40 IF (INFO.EQ.2) GOTO 90 IDIAG=0 IF ((DIAG.GT.ZERO).AND.(DIAG.LT.1000.0)) IDIAG=DIAG IF ((IPRINT.GT.0).AND.(IDIAG.GT.0)) 1 WRITE(IOUT,1000) IDIAG IF (INFO .LT. 0) GOTO 70 C C REORDER MULTIPLIER C DO 50 J=1,MNN 50 U(J)=ZERO IN=INW2-1 IF (NACT.EQ.0) GOTO 30 DO 60 I=1,NACT J=IWAR(I) U(J)=WAR(IN+I) 60 CONTINUE 30 CONTINUE RETURN C C ERROR MESSAGES C 70 IFAIL=-INFO+10 IF ((IPRINT.GT.0).AND.(NACT.GT.0)) 1 WRITE(IOUT,1100) -INFO,(IWAR(I),I=1,NACT) RETURN 80 IFAIL=5 IF (IPRINT .GT. 0) WRITE(IOUT,1200) RETURN 81 IFAIL=5 IF (IPRINT .GT. 0) WRITE(IOUT,1210) RETURN 82 IFAIL=5 IF (IPRINT .GT. 0) WRITE(IOUT,1220) RETURN 40 IFAIL=1 IF (IPRINT.GT.0) WRITE(IOUT,1300) MAXIT RETURN 90 IFAIL=2 IF (IPRINT.GT.0) WRITE(IOUT,1400) RETURN C C FORMAT-INSTRUCTIONS C 1000 FORMAT(/8X,28H***QL: MATRIX G WAS ENLARGED,I3, 1 20H-TIMES BY UNITMATRIX) 1100 FORMAT(/8X,18H***QL: CONSTRAINT ,I5, 1 19H NOT CONSISTENT TO ,/,(10X,10I5)) 1200 FORMAT(/8X,21H***QL: LWAR TOO SMALL) 1210 FORMAT(/8X,22H***QL: LIWAR TOO SMALL) 1220 FORMAT(/8X,20H***QL: MNN TOO SMALL) 1300 FORMAT(/8X,37H***QL: TOO MANY ITERATIONS (MORE THAN,I6,1H)) 1400 FORMAT(/8X,50H***QL: ACCURACY INSUFFICIENT TO ATTAIN CONVERGENCE) END octave-1.1.0/libcruft/fsqp/ql0002.f100666 415 17 56562 5414716516 15056 0ustar jweusersC SUBROUTINE QL0002(N,M,MEQ,MMAX,MN,MNN,NMAX,LQL,A,B,GRAD,G, 1 XL,XU,X,NACT,IACT,MAXIT,VSMALL,INFO,DIAG,W,LW) C C************************************************************************** C C C THIS SUBROUTINE SOLVES THE QUADRATIC PROGRAMMING PROBLEM C C MINIMIZE GRAD'*X + 0.5 * X*G*X C SUBJECT TO A(K)*X = B(K) K=1,2,...,MEQ, C A(K)*X >= B(K) K=MEQ+1,...,M, C XL <= X <= XU C C THE QUADRATIC PROGRAMMING METHOD PROCEEDS FROM AN INITIAL CHOLESKY- C DECOMPOSITION OF THE OBJECTIVE FUNCTION MATRIX, TO CALCULATE THE C UNIQUELY DETERMINED MINIMIZER OF THE UNCONSTRAINED PROBLEM. C SUCCESSIVELY ALL VIOLATED CONSTRAINTS ARE ADDED TO A WORKING SET C AND A MINIMIZER OF THE OBJECTIVE FUNCTION SUBJECT TO ALL CONSTRAINTS C IN THIS WORKING SET IS COMPUTED. IT IS POSSIBLE THAT CONSTRAINTS C HAVE TO LEAVE THE WORKING SET. C C C DESCRIPTION OF PARAMETERS: C C N : IS THE NUMBER OF VARIABLES. C M : TOTAL NUMBER OF CONSTRAINTS. C MEQ : NUMBER OF EQUALITY CONTRAINTS. C MMAX : ROW DIMENSION OF A, DIMENSION OF B. MMAX MUST BE AT C LEAST ONE AND GREATER OR EQUAL TO M. C MN : MUST BE EQUAL M + N. C MNN : MUST BE EQUAL M + N + N. C NMAX : ROW DIEMSION OF G. MUST BE AT LEAST N. C LQL : DETERMINES INITIAL DECOMPOSITION. C LQL = .FALSE. : THE UPPER TRIANGULAR PART OF THE MATRIX G C CONTAINS INITIALLY THE CHOLESKY-FACTOR OF A SUITABLE C DECOMPOSITION. C LQL = .TRUE. : THE INITIAL CHOLESKY-FACTORISATION OF G IS TO BE C PERFORMED BY THE ALGORITHM. C A(MMAX,NMAX) : A IS A MATRIX WHOSE COLUMNS ARE THE CONSTRAINTS NORMALS. C B(MMAX) : CONTAINS THE RIGHT HAND SIDES OF THE CONSTRAINTS. C GRAD(N) : CONTAINS THE OBJECTIVE FUNCTION VECTOR GRAD. C G(NMAX,N): CONTAINS THE SYMMETRIC OBJECTIVE FUNCTION MATRIX. C XL(N), XU(N): CONTAIN THE LOWER AND UPPER BOUNDS FOR X. C X(N) : VECTOR OF VARIABLES. C NACT : FINAL NUMBER OF ACTIVE CONSTRAINTS. C IACT(K) (K=1,2,...,NACT): INDICES OF THE FINAL ACTIVE CONSTRAINTS. C INFO : REASON FOR THE RETURN FROM THE SUBROUTINE. C INFO = 0 : CALCULATION WAS TERMINATED SUCCESSFULLY. C INFO = 1 : MAXIMUM NUMBER OF ITERATIONS ATTAINED. C INFO = 2 : ACCURACY IS INSUFFICIENT TO MAINTAIN INCREASING C FUNCTION VALUES. C INFO < 0 : THE CONSTRAINT WITH INDEX ABS(INFO) AND THE CON- C STRAINTS WHOSE INDICES ARE IACT(K), K=1,2,...,NACT, C ARE INCONSISTENT. C MAXIT : MAXIMUM NUMBER OF ITERATIONS. C VSMALL : REQUIRED ACCURACY TO BE ACHIEVED (E.G. IN THE ORDER OF THE C MACHINE PRECISION FOR SMALL AND WELL-CONDITIONED PROBLEMS). C DIAG : ON RETURN DIAG IS EQUAL TO THE MULTIPLE OF THE UNIT MATRIX C THAT WAS ADDED TO G TO ACHIEVE POSITIVE DEFINITENESS. C W(LW) : THE ELEMENTS OF W(.) ARE USED FOR WORKING SPACE. THE LENGTH C OF W MUST NOT BE LESS THAN (1.5*NMAX*NMAX + 10*NMAX + M). C WHEN INFO = 0 ON RETURN, THE LAGRANGE MULTIPLIERS OF THE C FINAL ACTIVE CONSTRAINTS ARE HELD IN W(K), K=1,2,...,NACT. C THE VALUES OF N, M, MEQ, MMAX, MN, MNN AND NMAX AND THE ELEMENTS OF C A, B, GRAD AND G ARE NOT ALTERED. C C THE FOLLOWING INTEGERS ARE USED TO PARTITION W: C THE FIRST N ELEMENTS OF W HOLD LAGRANGE MULTIPLIER ESTIMATES. C W(IWZ+I+(N-1)*J) HOLDS THE MATRIX ELEMENT Z(I,J). C W(IWR+I+0.5*J*(J-1)) HOLDS THE UPPER TRIANGULAR MATRIX C ELEMENT R(I,J). THE SUBSEQUENT N COMPONENTS OF W MAY BE C TREATED AS AN EXTRA COLUMN OF R(.,.). C W(IWW-N+I) (I=1,2,...,N) ARE USED FOR TEMPORARY STORAGE. C W(IWW+I) (I=1,2,...,N) ARE USED FOR TEMPORARY STORAGE. C W(IWD+I) (I=1,2,...,N) HOLDS G(I,I) DURING THE CALCULATION. C W(IWX+I) (I=1,2,...,N) HOLDS VARIABLES THAT WILL BE USED TO C TEST THAT THE ITERATIONS INCREASE THE OBJECTIVE FUNCTION. C W(IWA+K) (K=1,2,...,M) USUALLY HOLDS THE RECIPROCAL OF THE C LENGTH OF THE K-TH CONSTRAINT, BUT ITS SIGN INDICATES C WHETHER THE CONSTRAINT IS ACTIVE. C C C AUTHOR: K. SCHITTKOWSKI, C MATHEMATISCHES INSTITUT, C UNIVERSITAET BAYREUTH, C 8580 BAYREUTH, C GERMANY, F.R. C C AUTHOR OF ORIGINAL VERSION: C M.J.D. POWELL, DAMTP, C UNIVERSITY OF CAMBRIDGE, SILVER STREET C CAMBRIDGE, C ENGLAND C C C REFERENCE: M.J.D. POWELL: ZQPCVX, A FORTRAN SUBROUTINE FOR CONVEX C PROGRAMMING, REPORT DAMTP/1983/NA17, UNIVERSITY OF C CAMBRIDGE, ENGLAND, 1983. C C C VERSION : 2.0 (MARCH, 1987) C C C************************************************************************* C INTEGER MMAX,NMAX,N,LW DIMENSION A(MMAX,NMAX),B(MMAX),GRAD(N),G(NMAX,N),X(N),IACT(N), 1 W(LW),XL(N),XU(N) INTEGER M,MEQ,MN,MNN,NACT,IACT,INFO,MAXIT DOUBLE PRECISION CVMAX,DIAG,DIAGR,FDIFF,FDIFFA,GA,GB,PARINC,PARNEW 1 ,RATIO,RES,STEP,SUM,SUMX,SUMY,SUMA,SUMB,SUMC,TEMP,TEMPA, 2 VSMALL,XMAG,XMAGR,ZERO,ONE,TWO,ONHA,VFACT DOUBLE PRECISION A,B,G,GRAD,W,X,XL,XU C C INTRINSIC FUNCTIONS: DMAX1,DSQRT,DABS,DMIN1 C INTEGER IWZ,IWR,IWW,IWD,IWA,IFINC,KFINC,K,I,IA,ID,II,IR,IRA, 1 IRB,J,NM,IZ,IZA,ITERC,ITREF,JFINC,IFLAG,IWS,IS,K1,IW,KK,IP, 2 IPP,IL,IU,JU,KFLAG,LFLAG,JFLAG,KDROP,NU,MFLAG,KNEXT,IX,IWX, 3 IWY,IY,JL LOGICAL LQL,LOWER C C INITIAL ADDRESSES C IWZ=NMAX IWR=IWZ+NMAX*NMAX IWW=IWR+(NMAX*(NMAX+3))/2 IWD=IWW+NMAX IWX=IWD+NMAX IWA=IWX+NMAX C C SET SOME CONSTANTS. C ZERO=0.D+0 ONE=1.D+0 TWO=2.D+0 ONHA=1.5D+0 VFACT=1.D+0 C C SET SOME PARAMETERS. C NUMBER LESS THAN VSMALL ARE ASSUMED TO BE NEGLIGIBLE. C THE MULTIPLE OF I THAT IS ADDED TO G IS AT MOST DIAGR TIMES C THE LEAST MULTIPLE OF I THAT GIVES POSITIVE DEFINITENESS. C X IS RE-INITIALISED IF ITS MAGNITUDE IS REDUCED BY THE C FACTOR XMAGR. C A CHECK IS MADE FOR AN INCREASE IN F EVERY IFINC ITERATIONS, C AFTER KFINC ITERATIONS ARE COMPLETED. C DIAGR=TWO XMAGR=1.0D-2 IFINC=3 KFINC=MAX0(10,N) C C FIND THE RECIPROCALS OF THE LENGTHS OF THE CONSTRAINT NORMALS. C RETURN IF A CONSTRAINT IS INFEASIBLE DUE TO A ZERO NORMAL. C NACT=0 IF (M .LE. 0) GOTO 45 DO 40 K=1,M SUM=ZERO DO 10 I=1,N 10 SUM=SUM+A(K,I)**2 IF (SUM .GT. ZERO) GOTO 20 IF (B(K) .EQ. ZERO) GOTO 30 INFO=-K IF (K .LE. MEQ) GOTO 730 IF (B(K)) 30,30,730 20 SUM=ONE/DSQRT(SUM) 30 IA=IWA+K 40 W(IA)=SUM 45 DO 50 K=1,N IA=IWA+M+K 50 W(IA)=ONE C C IF NECESSARY INCREASE THE DIAGONAL ELEMENTS OF G. C IF (.NOT. LQL) GOTO 165 DIAG=ZERO DO 60 I=1,N ID=IWD+I W(ID)=G(I,I) DIAG=DMAX1(DIAG,VSMALL-W(ID)) IF (I .EQ. N) GOTO 60 II=I+1 DO 55 J=II,N GA=-DMIN1(W(ID),G(J,J)) GB=DABS(W(ID)-G(J,J))+DABS(G(I,J)) IF (GB .GT. ZERO) GA=GA+G(I,J)**2/GB 55 DIAG=DMAX1(DIAG,GA) 60 CONTINUE IF (DIAG .LE. ZERO) GOTO 90 70 DIAG=DIAGR*DIAG DO 80 I=1,N ID=IWD+I 80 G(I,I)=DIAG+W(ID) C C FORM THE CHOLESKY FACTORISATION OF G. THE TRANSPOSE C OF THE FACTOR WILL BE PLACED IN THE R-PARTITION OF W. C 90 IR=IWR DO 130 J=1,N IRA=IWR IRB=IR+1 DO 120 I=1,J TEMP=G(I,J) IF (I .EQ. 1) GOTO 110 DO 100 K=IRB,IR IRA=IRA+1 100 TEMP=TEMP-W(K)*W(IRA) 110 IR=IR+1 IRA=IRA+1 IF (I .LT. J) W(IR)=TEMP/W(IRA) 120 CONTINUE IF (TEMP .LT. VSMALL) GOTO 140 130 W(IR)=DSQRT(TEMP) GOTO 170 C C INCREASE FURTHER THE DIAGONAL ELEMENT OF G. C 140 W(J)=ONE SUMX=ONE K=J 150 SUM=ZERO IRA=IR-1 DO 160 I=K,J SUM=SUM-W(IRA)*W(I) 160 IRA=IRA+I IR=IR-K K=K-1 W(K)=SUM/W(IR) SUMX=SUMX+W(K)**2 IF (K .GE. 2) GOTO 150 DIAG=DIAG+VSMALL-TEMP/SUMX GOTO 70 C C STORE THE CHOLESKY FACTORISATION IN THE R-PARTITION C OF W. C 165 IR=IWR DO 166 I=1,N DO 166 J=1,I IR=IR+1 166 W(IR)=G(J,I) C C SET Z THE INVERSE OF THE MATRIX IN R. C 170 NM=N-1 DO 220 I=1,N IZ=IWZ+I IF (I .EQ. 1) GOTO 190 DO 180 J=2,I W(IZ)=ZERO 180 IZ=IZ+N 190 IR=IWR+(I+I*I)/2 W(IZ)=ONE/W(IR) IF (I .EQ. N) GOTO 220 IZA=IZ DO 210 J=I,NM IR=IR+I SUM=ZERO DO 200 K=IZA,IZ,N SUM=SUM+W(K)*W(IR) 200 IR=IR+1 IZ=IZ+N 210 W(IZ)=-SUM/W(IR) 220 CONTINUE C C SET THE INITIAL VALUES OF SOME VARIABLES. C ITERC COUNTS THE NUMBER OF ITERATIONS. C ITREF IS SET TO ONE WHEN ITERATIVE REFINEMENT IS REQUIRED. C JFINC INDICATES WHEN TO TEST FOR AN INCREASE IN F. C ITERC=1 ITREF=0 JFINC=-KFINC C C SET X TO ZERO AND SET THE CORRESPONDING RESIDUALS OF THE C KUHN-TUCKER CONDITIONS. C 230 IFLAG=1 IWS=IWW-N DO 240 I=1,N X(I)=ZERO IW=IWW+I W(IW)=GRAD(I) IF (I .GT. NACT) GOTO 240 W(I)=ZERO IS=IWS+I K=IACT(I) IF (K .LE. M) GOTO 235 IF (K .GT. MN) GOTO 234 K1=K-M W(IS)=XL(K1) GOTO 240 234 K1=K-MN W(IS)=-XU(K1) GOTO 240 235 W(IS)=B(K) 240 CONTINUE XMAG=ZERO VFACT=1.D+0 IF (NACT) 340,340,280 C C SET THE RESIDUALS OF THE KUHN-TUCKER CONDITIONS FOR GENERAL X. C 250 IFLAG=2 IWS=IWW-N DO 260 I=1,N IW=IWW+I W(IW)=GRAD(I) IF (LQL) GOTO 259 ID=IWD+I W(ID)=ZERO DO 251 J=I,N 251 W(ID)=W(ID)+G(I,J)*X(J) DO 252 J=1,I ID=IWD+J 252 W(IW)=W(IW)+G(J,I)*W(ID) GOTO 260 259 DO 261 J=1,N 261 W(IW)=W(IW)+G(I,J)*X(J) 260 CONTINUE IF (NACT .EQ. 0) GOTO 340 DO 270 K=1,NACT KK=IACT(K) IS=IWS+K IF (KK .GT. M) GOTO 265 W(IS)=B(KK) DO 264 I=1,N IW=IWW+I W(IW)=W(IW)-W(K)*A(KK,I) 264 W(IS)=W(IS)-X(I)*A(KK,I) GOTO 270 265 IF (KK .GT. MN) GOTO 266 K1=KK-M IW=IWW+K1 W(IW)=W(IW)-W(K) W(IS)=XL(K1)-X(K1) GOTO 270 266 K1=KK-MN IW=IWW+K1 W(IW)=W(IW)+W(K) W(IS)=-XU(K1)+X(K1) 270 CONTINUE C C PRE-MULTIPLY THE VECTOR IN THE S-PARTITION OF W BY THE C INVERS OF R TRANSPOSE. C 280 IR=IWR IP=IWW+1 IPP=IWW+N IL=IWS+1 IU=IWS+NACT DO 310 I=IL,IU SUM=ZERO IF (I .EQ. IL) GOTO 300 JU=I-1 DO 290 J=IL,JU IR=IR+1 290 SUM=SUM+W(IR)*W(J) 300 IR=IR+1 310 W(I)=(W(I)-SUM)/W(IR) C C SHIFT X TO SATISFY THE ACTIVE CONSTRAINTS AND MAKE THE C CORRESPONDING CHANGE TO THE GRADIENT RESIDUALS. C DO 330 I=1,N IZ=IWZ+I SUM=ZERO DO 320 J=IL,IU SUM=SUM+W(J)*W(IZ) 320 IZ=IZ+N X(I)=X(I)+SUM IF (LQL) GOTO 329 ID=IWD+I W(ID)=ZERO DO 321 J=I,N 321 W(ID)=W(ID)+G(I,J)*SUM IW=IWW+I DO 322 J=1,I ID=IWD+J 322 W(IW)=W(IW)+G(J,I)*W(ID) GOTO 330 329 DO 331 J=1,N IW=IWW+J 331 W(IW)=W(IW)+SUM*G(I,J) 330 CONTINUE C C FORM THE SCALAR PRODUCT OF THE CURRENT GRADIENT RESIDUALS C WITH EACH COLUMN OF Z. C 340 KFLAG=1 GOTO 930 350 IF (NACT .EQ. N) GOTO 380 C C SHIFT X SO THAT IT SATISFIES THE REMAINING KUHN-TUCKER C CONDITIONS. C IL=IWS+NACT+1 IZA=IWZ+NACT*N DO 370 I=1,N SUM=ZERO IZ=IZA+I DO 360 J=IL,IWW SUM=SUM+W(IZ)*W(J) 360 IZ=IZ+N 370 X(I)=X(I)-SUM INFO=0 IF (NACT .EQ. 0) GOTO 410 C C UPDATE THE LAGRANGE MULTIPLIERS. C 380 LFLAG=3 GOTO 740 390 DO 400 K=1,NACT IW=IWW+K 400 W(K)=W(K)+W(IW) C C REVISE THE VALUES OF XMAG. C BRANCH IF ITERATIVE REFINEMENT IS REQUIRED. C 410 JFLAG=1 GOTO 910 420 IF (IFLAG .EQ. ITREF) GOTO 250 C C DELETE A CONSTRAINT IF A LAGRANGE MULTIPLIER OF AN C INEQUALITY CONSTRAINT IS NEGATIVE. C KDROP=0 GOTO 440 430 KDROP=KDROP+1 IF (W(KDROP) .GE. ZERO) GOTO 440 IF (IACT(KDROP) .LE. MEQ) GOTO 440 NU=NACT MFLAG=1 GOTO 800 440 IF (KDROP .LT. NACT) GOTO 430 C C SEEK THE GREATEAST NORMALISED CONSTRAINT VIOLATION, DISREGARDING C ANY THAT MAY BE DUE TO COMPUTER ROUNDING ERRORS. C 450 CVMAX=ZERO IF (M .LE. 0) GOTO 481 DO 480 K=1,M IA=IWA+K IF (W(IA) .LE. ZERO) GOTO 480 SUM=-B(K) DO 460 I=1,N 460 SUM=SUM+X(I)*A(K,I) SUMX=-SUM*W(IA) IF (K .LE. MEQ) SUMX=DABS(SUMX) IF (SUMX .LE. CVMAX) GOTO 480 TEMP=DABS(B(K)) DO 470 I=1,N 470 TEMP=TEMP+DABS(X(I)*A(K,I)) TEMPA=TEMP+DABS(SUM) IF (TEMPA .LE. TEMP) GOTO 480 TEMP=TEMP+ONHA*DABS(SUM) IF (TEMP .LE. TEMPA) GOTO 480 CVMAX=SUMX RES=SUM KNEXT=K 480 CONTINUE 481 DO 485 K=1,N LOWER=.TRUE. IA=IWA+M+K IF (W(IA) .LE. ZERO) GOTO 485 SUM=XL(K)-X(K) IF (SUM) 482,485,483 482 SUM=X(K)-XU(K) LOWER=.FALSE. 483 IF (SUM .LE. CVMAX) GOTO 485 CVMAX=SUM RES=-SUM KNEXT=K+M IF (LOWER) GOTO 485 KNEXT=K+MN 485 CONTINUE C C TEST FOR CONVERGENCE C INFO=0 IF (CVMAX .LE. VSMALL) GOTO 700 C C RETURN IF, DUE TO ROUNDING ERRORS, THE ACTUAL CHANGE IN C X MAY NOT INCREASE THE OBJECTIVE FUNCTION C JFINC=JFINC+1 IF (JFINC .EQ. 0) GOTO 510 IF (JFINC .NE. IFINC) GOTO 530 FDIFF=ZERO FDIFFA=ZERO DO 500 I=1,N SUM=TWO*GRAD(I) SUMX=DABS(SUM) IF (LQL) GOTO 489 ID=IWD+I W(ID)=ZERO DO 486 J=I,N IX=IWX+J 486 W(ID)=W(ID)+G(I,J)*(W(IX)+X(J)) DO 487 J=1,I ID=IWD+J TEMP=G(J,I)*W(ID) SUM=SUM+TEMP 487 SUMX=SUMX+DABS(TEMP) GOTO 495 489 DO 490 J=1,N IX=IWX+J TEMP=G(I,J)*(W(IX)+X(J)) SUM=SUM+TEMP 490 SUMX=SUMX+DABS(TEMP) 495 IX=IWX+I FDIFF=FDIFF+SUM*(X(I)-W(IX)) 500 FDIFFA=FDIFFA+SUMX*DABS(X(I)-W(IX)) INFO=2 SUM=FDIFFA+FDIFF IF (SUM .LE. FDIFFA) GOTO 700 TEMP=FDIFFA+ONHA*FDIFF IF (TEMP .LE. SUM) GOTO 700 JFINC=0 INFO=0 510 DO 520 I=1,N IX=IWX+I 520 W(IX)=X(I) C C FORM THE SCALAR PRODUCT OF THE NEW CONSTRAINT NORMAL WITH EACH C COLUMN OF Z. PARNEW WILL BECOME THE LAGRANGE MULTIPLIER OF C THE NEW CONSTRAINT. C 530 ITERC=ITERC+1 IF (ITERC.LE.MAXIT) GOTO 531 INFO=1 GOTO 710 531 CONTINUE IWS=IWR+(NACT+NACT*NACT)/2 IF (KNEXT .GT. M) GOTO 541 DO 540 I=1,N IW=IWW+I 540 W(IW)=A(KNEXT,I) GOTO 549 541 DO 542 I=1,N IW=IWW+I 542 W(IW)=ZERO K1=KNEXT-M IF (K1 .GT. N) GOTO 545 IW=IWW+K1 W(IW)=ONE IZ=IWZ+K1 DO 543 I=1,N IS=IWS+I W(IS)=W(IZ) 543 IZ=IZ+N GOTO 550 545 K1=KNEXT-MN IW=IWW+K1 W(IW)=-ONE IZ=IWZ+K1 DO 546 I=1,N IS=IWS+I W(IS)=-W(IZ) 546 IZ=IZ+N GOTO 550 549 KFLAG=2 GOTO 930 550 PARNEW=ZERO C C APPLY GIVENS ROTATIONS TO MAKE THE LAST (N-NACT-2) SCALAR C PRODUCTS EQUAL TO ZERO. C IF (NACT .EQ. N) GOTO 570 NU=N NFLAG=1 GOTO 860 C C BRANCH IF THERE IS NO NEED TO DELETE A CONSTRAINT. C 560 IS=IWS+NACT IF (NACT .EQ. 0) GOTO 640 SUMA=ZERO SUMB=ZERO SUMC=ZERO IZ=IWZ+NACT*N DO 563 I=1,N IZ=IZ+1 IW=IWW+I SUMA=SUMA+W(IW)*W(IZ) SUMB=SUMB+DABS(W(IW)*W(IZ)) 563 SUMC=SUMC+W(IZ)**2 TEMP=SUMB+.1D+0*DABS(SUMA) TEMPA=SUMB+.2D+0*DABS(SUMA) IF (TEMP .LE. SUMB) GOTO 570 IF (TEMPA .LE. TEMP) GOTO 570 IF (SUMB .GT. VSMALL) GOTO 5 GOTO 570 5 SUMC=DSQRT(SUMC) IA=IWA+KNEXT IF (KNEXT .LE. M) SUMC=SUMC/W(IA) TEMP=SUMC+.1D+0*DABS(SUMA) TEMPA=SUMC+.2D+0*DABS(SUMA) IF (TEMP .LE. SUMC) GOTO 567 IF (TEMPA .LE. TEMP) GOTO 567 GOTO 640 C C CALCULATE THE MULTIPLIERS FOR THE NEW CONSTRAINT NORMAL C EXPRESSED IN TERMS OF THE ACTIVE CONSTRAINT NORMALS. C THEN WORK OUT WHICH CONTRAINT TO DROP. C 567 LFLAG=4 GOTO 740 570 LFLAG=1 GOTO 740 C C COMPLETE THE TEST FOR LINEARLY DEPENDENT CONSTRAINTS. C 571 IF (KNEXT .GT. M) GOTO 574 DO 573 I=1,N SUMA=A(KNEXT,I) SUMB=DABS(SUMA) IF (NACT.EQ.0) GOTO 581 DO 572 K=1,NACT KK=IACT(K) IF (KK.LE.M) GOTO 568 KK=KK-M TEMP=ZERO IF (KK.EQ.I) TEMP=W(IWW+KK) KK=KK-N IF (KK.EQ.I) TEMP=-W(IWW+KK) GOTO 569 568 CONTINUE IW=IWW+K TEMP=W(IW)*A(KK,I) 569 CONTINUE SUMA=SUMA-TEMP 572 SUMB=SUMB+DABS(TEMP) 581 IF (SUMA .LE. VSMALL) GOTO 573 TEMP=SUMB+.1D+0*DABS(SUMA) TEMPA=SUMB+.2D+0*DABS(SUMA) IF (TEMP .LE. SUMB) GOTO 573 IF (TEMPA .LE. TEMP) GOTO 573 GOTO 630 573 CONTINUE LFLAG=1 GOTO 775 574 K1=KNEXT-M IF (K1 .GT. N) K1=K1-N DO 578 I=1,N SUMA=ZERO IF (I .NE. K1) GOTO 575 SUMA=ONE IF (KNEXT .GT. MN) SUMA=-ONE 575 SUMB=DABS(SUMA) IF (NACT.EQ.0) GOTO 582 DO 577 K=1,NACT KK=IACT(K) IF (KK .LE. M) GOTO 579 KK=KK-M TEMP=ZERO IF (KK.EQ.I) TEMP=W(IWW+KK) KK=KK-N IF (KK.EQ.I) TEMP=-W(IWW+KK) GOTO 576 579 IW=IWW+K TEMP=W(IW)*A(KK,I) 576 SUMA=SUMA-TEMP 577 SUMB=SUMB+DABS(TEMP) 582 TEMP=SUMB+.1D+0*DABS(SUMA) TEMPA=SUMB+.2D+0*DABS(SUMA) IF (TEMP .LE. SUMB) GOTO 578 IF (TEMPA .LE. TEMP) GOTO 578 GOTO 630 578 CONTINUE LFLAG=1 GOTO 775 C C BRANCH IF THE CONTRAINTS ARE INCONSISTENT. C 580 INFO=-KNEXT IF (KDROP .EQ. 0) GOTO 700 PARINC=RATIO PARNEW=PARINC C C REVISE THE LAGRANGE MULTIPLIERS OF THE ACTIVE CONSTRAINTS. C 590 IF (NACT.EQ.0) GOTO 601 DO 600 K=1,NACT IW=IWW+K W(K)=W(K)-PARINC*W(IW) IF (IACT(K) .GT. MEQ) W(K)=DMAX1(ZERO,W(K)) 600 CONTINUE 601 IF (KDROP .EQ. 0) GOTO 680 C C DELETE THE CONSTRAINT TO BE DROPPED. C SHIFT THE VECTOR OF SCALAR PRODUCTS. C THEN, IF APPROPRIATE, MAKE ONE MORE SCALAR PRODUCT ZERO. C NU=NACT+1 MFLAG=2 GOTO 800 610 IWS=IWS-NACT-1 NU=MIN0(N,NU) DO 620 I=1,NU IS=IWS+I J=IS+NACT 620 W(IS)=W(J+1) NFLAG=2 GOTO 860 C C CALCULATE THE STEP TO THE VIOLATED CONSTRAINT. C 630 IS=IWS+NACT 640 SUMY=W(IS+1) STEP=-RES/SUMY PARINC=STEP/SUMY IF (NACT .EQ. 0) GOTO 660 C C CALCULATE THE CHANGES TO THE LAGRANGE MULTIPLIERS, AND REDUCE C THE STEP ALONG THE NEW SEARCH DIRECTION IF NECESSARY. C LFLAG=2 GOTO 740 650 IF (KDROP .EQ. 0) GOTO 660 TEMP=ONE-RATIO/PARINC IF (TEMP .LE. ZERO) KDROP=0 IF (KDROP .EQ. 0) GOTO 660 STEP=RATIO*SUMY PARINC=RATIO RES=TEMP*RES C C UPDATE X AND THE LAGRANGE MULTIPIERS. C DROP A CONSTRAINT IF THE FULL STEP IS NOT TAKEN. C 660 IWY=IWZ+NACT*N DO 670 I=1,N IY=IWY+I 670 X(I)=X(I)+STEP*W(IY) PARNEW=PARNEW+PARINC IF (NACT .GE. 1) GOTO 590 C C ADD THE NEW CONSTRAINT TO THE ACTIVE SET. C 680 NACT=NACT+1 W(NACT)=PARNEW IACT(NACT)=KNEXT IA=IWA+KNEXT IF (KNEXT .GT. MN) IA=IA-N W(IA)=-W(IA) C C ESTIMATE THE MAGNITUDE OF X. THEN BEGIN A NEW ITERATION, C RE-INITILISING X IF THIS MAGNITUDE IS SMALL. C JFLAG=2 GOTO 910 690 IF (SUM .LT. (XMAGR*XMAG)) GOTO 230 IF (ITREF) 450,450,250 C C INITIATE ITERATIVE REFINEMENT IF IT HAS NOT YET BEEN USED, C OR RETURN AFTER RESTORING THE DIAGONAL ELEMENTS OF G. C 700 IF (ITERC .EQ. 0) GOTO 710 ITREF=ITREF+1 JFINC=-1 IF (ITREF .EQ. 1) GOTO 250 710 IF (.NOT. LQL) RETURN DO 720 I=1,N ID=IWD+I 720 G(I,I)=W(ID) 730 RETURN C C C THE REMAINIG INSTRUCTIONS ARE USED AS SUBROUTINES. C C C******************************************************************** C C C CALCULATE THE LAGRANGE MULTIPLIERS BY PRE-MULTIPLYING THE C VECTOR IN THE S-PARTITION OF W BY THE INVERSE OF R. C 740 IR=IWR+(NACT+NACT*NACT)/2 I=NACT SUM=ZERO GOTO 770 750 IRA=IR-1 SUM=ZERO IF (NACT.EQ.0) GOTO 761 DO 760 J=I,NACT IW=IWW+J SUM=SUM+W(IRA)*W(IW) 760 IRA=IRA+J 761 IR=IR-I I=I-1 770 IW=IWW+I IS=IWS+I W(IW)=(W(IS)-SUM)/W(IR) IF (I .GT. 1) GOTO 750 IF (LFLAG .EQ. 3) GOTO 390 IF (LFLAG .EQ. 4) GOTO 571 C C CALCULATE THE NEXT CONSTRAINT TO DROP. C 775 IP=IWW+1 IPP=IWW+NACT KDROP=0 IF (NACT.EQ.0) GOTO 791 DO 790 K=1,NACT IF (IACT(K) .LE. MEQ) GOTO 790 IW=IWW+K IF ((RES*W(IW)) .GE. ZERO) GOTO 790 TEMP=W(K)/W(IW) IF (KDROP .EQ. 0) GOTO 780 IF (DABS(TEMP) .GE. DABS(RATIO)) GOTO 790 780 KDROP=K RATIO=TEMP 790 CONTINUE 791 GOTO (580,650), LFLAG C C C******************************************************************** C C C DROP THE CONSTRAINT IN POSITION KDROP IN THE ACTIVE SET. C 800 IA=IWA+IACT(KDROP) IF (IACT(KDROP) .GT. MN) IA=IA-N W(IA)=-W(IA) IF (KDROP .EQ. NACT) GOTO 850 C C SET SOME INDICES AND CALCULATE THE ELEMENTS OF THE NEXT C GIVENS ROTATION. C IZ=IWZ+KDROP*N IR=IWR+(KDROP+KDROP*KDROP)/2 810 IRA=IR IR=IR+KDROP+1 TEMP=DMAX1(DABS(W(IR-1)),DABS(W(IR))) SUM=TEMP*DSQRT((W(IR-1)/TEMP)**2+(W(IR)/TEMP)**2) GA=W(IR-1)/SUM GB=W(IR)/SUM C C EXCHANGE THE COLUMNS OF R. C DO 820 I=1,KDROP IRA=IRA+1 J=IRA-KDROP TEMP=W(IRA) W(IRA)=W(J) 820 W(J)=TEMP W(IR)=ZERO C C APPLY THE ROTATION TO THE ROWS OF R. C W(J)=SUM KDROP=KDROP+1 DO 830 I=KDROP,NU TEMP=GA*W(IRA)+GB*W(IRA+1) W(IRA+1)=GA*W(IRA+1)-GB*W(IRA) W(IRA)=TEMP 830 IRA=IRA+I C C APPLY THE ROTATION TO THE COLUMNS OF Z. C DO 840 I=1,N IZ=IZ+1 J=IZ-N TEMP=GA*W(J)+GB*W(IZ) W(IZ)=GA*W(IZ)-GB*W(J) 840 W(J)=TEMP C C REVISE IACT AND THE LAGRANGE MULTIPLIERS. C IACT(KDROP-1)=IACT(KDROP) W(KDROP-1)=W(KDROP) IF (KDROP .LT. NACT) GOTO 810 850 NACT=NACT-1 GOTO (250,610), MFLAG C C C******************************************************************** C C C APPLY GIVENS ROTATION TO REDUCE SOME OF THE SCALAR C PRODUCTS IN THE S-PARTITION OF W TO ZERO. C 860 IZ=IWZ+NU*N 870 IZ=IZ-N 880 IS=IWS+NU NU=NU-1 IF (NU .EQ. NACT) GOTO 900 IF (W(IS) .EQ. ZERO) GOTO 870 TEMP=DMAX1(DABS(W(IS-1)),DABS(W(IS))) SUM=TEMP*DSQRT((W(IS-1)/TEMP)**2+(W(IS)/TEMP)**2) GA=W(IS-1)/SUM GB=W(IS)/SUM W(IS-1)=SUM DO 890 I=1,N K=IZ+N TEMP=GA*W(IZ)+GB*W(K) W(K)=GA*W(K)-GB*W(IZ) W(IZ)=TEMP 890 IZ=IZ-1 GOTO 880 900 GOTO (560,630), NFLAG C C C******************************************************************** C C C CALCULATE THE MAGNITUDE OF X AN REVISE XMAG. C 910 SUM=ZERO DO 920 I=1,N SUM=SUM+DABS(X(I))*VFACT*(DABS(GRAD(I))+DABS(G(I,I)*X(I))) IF (LQL) GOTO 920 IF (SUM .LT. 1.D-30) GOTO 920 VFACT=1.D-10*VFACT SUM=1.D-10*SUM XMAG=1.D-10*XMAG 920 CONTINUE 925 XMAG=DMAX1(XMAG,SUM) GOTO (420,690), JFLAG C C C******************************************************************** C C C PRE-MULTIPLY THE VECTOR IN THE W-PARTITION OF W BY Z TRANSPOSE. C 930 JL=IWW+1 IZ=IWZ DO 940 I=1,N IS=IWS+I W(IS)=ZERO IWWN=IWW+N DO 940 J=JL,IWWN IZ=IZ+1 940 W(IS)=W(IS)+W(IZ)*W(J) GOTO (350,550), KFLAG RETURN END octave-1.1.0/libcruft/lapack/ 40777 415 17 0 5705521646 14121 5ustar jweusersoctave-1.1.0/libcruft/lapack/Makefile.in100666 415 17 507 5662226323 16241 0ustar jweusers# # Makefile for octave's libcruft/lapack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/lapack/dbdsqr.f100666 415 17 77637 5306544267 15711 0ustar jweusers SUBROUTINE DBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, $ LDU, C, LDC, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDC, LDU, LDVT, N, NCC, NCVT, NRU * .. * .. Array Arguments .. DOUBLE PRECISION C( LDC, * ), D( * ), E( * ), U( LDU, * ), $ VT( LDVT, * ), WORK( * ) * .. * * Purpose * ======= * * DBDSQR computes the singular value decomposition (SVD) of a real * N-by-N (upper or lower) bidiagonal matrix with diagonal D and * offdiagonal E, accumulating the transformations if desired. Letting * B denote the input bidiagonal matrix, the algorithm computes * orthogonal matrices Q and P such that B = Q * S * P' (P' denotes the * transpose of P). The singular values S are overwritten on D. * * The input matrix U is changed to U * Q if desired. * The input matrix VT is changed to P' * VT if desired. * The input matrix C is changed to Q' * C if desired. * * See "Computing Small Singular Values of Bidiagonal Matrices With * Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan, * LAPACK Working Note #3, for a detailed description of the algorithm. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * On entry, UPLO specifies whether the input bidiagonal matrix * is upper or lower bidiagonal. * UPLO = 'U' or 'u' B is upper bidiagonal. * UPLO = 'L' or 'l' B is lower bidiagonal. * * N (input) INTEGER * On entry, N specifies the number of rows and columns * in the matrix. N must be at least 0. * * NCVT (input) INTEGER * On entry, NCVT specifies the number of columns of * the matrix VT. NCVT must be at least 0. * * NRU (input) INTEGER * On entry, NRU specifies the number of rows of * the matrix U. NRU must be at least 0. * * NCC (input) INTEGER * On entry, NCC specifies the number of columns of * the matrix C. NCC must be at least 0. * * D (input/output) DOUBLE PRECISION array, dimension (N) * On entry, D contains the diagonal entries of the * bidiagonal matrix whose SVD is desired. On normal exit, * D contains the singular values in decreasing order. * * E (input/output) DOUBLE PRECISION array, dimension (N-1) * On entry, the entries of E contain the * offdiagonal entries of of the bidiagonal matrix * whose SVD is desired. On normal exit, E will contain 0. * If the algorithm does not converge, D and E will contain * the diagonal and superdiagonal entries of a bidiagonal * matrix orthogonally equivalent to the one given as input. * * VT (input/output) DOUBLE PRECISION array, dimension (LDVT, NCVT) * On entry, contains an N-by-NCVT matrix which on exit * has been premultiplied by P' (not referenced if NCVT=0). * * LDVT (input) INTEGER * On entry, LDVT specifies the leading dimension of VT as * declared in the calling (sub) program. LDVT must be at * least 1. If NCVT is nonzero LDVT must also be at least N. * * U (input/output) DOUBLE PRECISION array, dimension (LDU, N) * On entry, contains an NRU-by-N matrix which on exit * has been postmultiplied by Q (not referenced if NRU=0). * * LDU (input) INTEGER * On entry, LDU specifies the leading dimension of U as * declared in the calling (sub) program. LDU must be at * least max( 1, NRU ) . * * C (input/output) DOUBLE PRECISION array, dimension (LDC, NCC) * On entry, contains an N-by-NCC matrix which on exit * has been premultiplied by Q' (not referenced if NCC=0). * * LDC (input) INTEGER * On entry, LDC specifies the leading dimension of C as * declared in the calling (sub) program. LDC must be at * least 1. If NCC is nonzero, LDC must also be at least N. * * WORK (workspace) DOUBLE PRECISION array, dimension * (MAX( 1, 4*N-4 )) * Workspace. Only referenced if one of NCVT, NRU, or NCC is * nonzero, and if N is at least 2. * * INFO (output) INTEGER * On exit, a value of 0 indicates a successful exit. * If INFO < 0, argument number -INFO is illegal. * If INFO > 0, the algorithm did not converge, and INFO * specifies how many superdiagonals did not converge. * * Internal Parameters * =================== * * TOLMUL DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8))) * TOLMUL controls the convergence criterion of the QR loop. * If it is positive, TOLMUL*EPS is the desired relative * precision in the computed singular values. * If it is negative, abs(TOLMUL*EPS*sigma_max) is the * desired absolute accuracy in the computed singular * values (corresponds to relative accuracy * abs(TOLMUL*EPS) in the largest singular value. * abs(TOLMUL) should be between 1 and 1/EPS, and preferably * between 10 (for fast convergence) and .1/EPS * (for there to be some accuracy in the results). * Default is to lose at either one eighth or 2 of the * available decimal digits in each computed singular value * (whichever is smaller). * * MAXITR INTEGER, default = 6 * MAXITR controls the maximum number of passes of the * algorithm through its inner loop. The algorithms stops * (and so fails to converge) if the number of passes * through the inner loop exceeds MAXITR*N**2. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) DOUBLE PRECISION NEGONE PARAMETER ( NEGONE = -1.0D0 ) DOUBLE PRECISION HNDRTH PARAMETER ( HNDRTH = 0.01D0 ) DOUBLE PRECISION TEN PARAMETER ( TEN = 10.0D0 ) DOUBLE PRECISION HNDRD PARAMETER ( HNDRD = 100.0D0 ) DOUBLE PRECISION MEIGTH PARAMETER ( MEIGTH = -0.125D0 ) INTEGER MAXITR PARAMETER ( MAXITR = 6 ) * .. * .. Local Scalars .. LOGICAL ROTATE INTEGER I, IDIR, IROT, ISUB, ITER, IUPLO, J, JOB, LL, $ LLL, M, MAXIT, NM1, NM12, NM13, OLDLL, OLDM DOUBLE PRECISION ABSE, ABSS, COSL, COSR, CS, EPS, F, G, GAP, $ GMAX, H, MU, OLDCS, OLDSN, R, SHIFT, SIGMN, $ SIGMX, SINL, SINR, SLL, SMAX, SMIN, SMINL, $ SMINLO, SMINOA, SN, THRESH, TOL, TOLMUL, UNFL * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLAMCH EXTERNAL LSAME, DLAMCH * .. * .. External Subroutines .. EXTERNAL DLARTG, DLAS2, DLASR, DLASV2, DROT, DSCAL, $ DSWAP, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, MAX, MIN, SIGN, SQRT * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IUPLO = 0 IF( LSAME( UPLO, 'U' ) ) $ IUPLO = 1 IF( LSAME( UPLO, 'L' ) ) $ IUPLO = 2 IF( IUPLO.EQ.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NCVT.LT.0 ) THEN INFO = -3 ELSE IF( NRU.LT.0 ) THEN INFO = -4 ELSE IF( NCC.LT.0 ) THEN INFO = -5 ELSE IF( ( NCVT.EQ.0 .AND. LDVT.LT.1 ) .OR. $ ( NCVT.GT.0 .AND. LDVT.LT.MAX( 1, N ) ) ) THEN INFO = -9 ELSE IF( LDU.LT.MAX( 1, NRU ) ) THEN INFO = -11 ELSE IF( ( NCC.EQ.0 .AND. LDC.LT.1 ) .OR. $ ( NCC.GT.0 .AND. LDC.LT.MAX( 1, N ) ) ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DBDSQR', -INFO ) RETURN END IF IF( N.EQ.0 ) $ RETURN IF( N.EQ.1 ) $ GO TO 190 * * ROTATE is true if any singular vectors desired, false otherwise * ROTATE = ( NCVT.GT.0 ) .OR. ( NRU.GT.0 ) .OR. ( NCC.GT.0 ) NM1 = N - 1 NM12 = NM1 + NM1 NM13 = NM12 + NM1 * * Get machine constants * EPS = DLAMCH( 'Epsilon' ) UNFL = DLAMCH( 'Safe minimum' ) TOLMUL = MAX( TEN, MIN( HNDRD, EPS**MEIGTH ) ) TOL = TOLMUL*EPS * * If matrix lower bidiagonal, rotate to be upper bidiagonal * by applying Givens rotations on the left * IF( IUPLO.EQ.2 ) THEN DO 10 I = 1, N - 1 CALL DLARTG( D( I ), E( I ), CS, SN, R ) D( I ) = R E( I ) = SN*D( I+1 ) D( I+1 ) = CS*D( I+1 ) IF( ROTATE ) THEN WORK( I ) = CS WORK( NM1+I ) = SN END IF 10 CONTINUE * * Update singular vectors if desired * IF( NRU.GT.0 ) $ CALL DLASR( 'R', 'V', 'F', NRU, N, WORK( 1 ), WORK( N ), U, $ LDU ) IF( NCC.GT.0 ) $ CALL DLASR( 'L', 'V', 'F', N, NCC, WORK( 1 ), WORK( N ), C, $ LDC ) END IF * * Compute approximate maximum, minimum singular values * SMAX = ABS( D( N ) ) DO 20 I = 1, N - 1 SMAX = MAX( SMAX, ABS( D( I ) ), ABS( E( I ) ) ) 20 CONTINUE SMINL = ZERO IF( TOL.GE.ZERO ) THEN SMINOA = ABS( D( 1 ) ) IF( SMINOA.EQ.ZERO ) $ GO TO 40 MU = SMINOA DO 30 I = 2, N MU = ABS( D( I ) )*( MU / ( MU+ABS( E( I-1 ) ) ) ) SMINOA = MIN( SMINOA, MU ) IF( SMINOA.EQ.ZERO ) $ GO TO 40 30 CONTINUE 40 CONTINUE SMINOA = SMINOA / SQRT( DBLE( N ) ) END IF * * Prepare for main iteration loop for the singular values * MAXIT = MAXITR*N*N ITER = 0 OLDLL = -1 OLDM = -1 IF( NCC.EQ.0 .AND. NRU.EQ.0 .AND. NCVT.EQ.0 ) THEN * * No singular vectors desired * JOB = 0 ELSE * * Singular vectors desired * JOB = 1 END IF IF( TOL.GE.ZERO ) THEN * * Relative accuracy desired * THRESH = MAX( TOL*SMINOA, MAXIT*UNFL ) ELSE * * Absolute accuracy desired * THRESH = MAX( ABS( TOL )*SMAX, MAXIT*UNFL ) END IF * * M points to last entry of unconverged part of matrix * M = N * * Begin main iteration loop * 50 CONTINUE * * Check for convergence or exceeding iteration count * IF( M.LE.1 ) $ GO TO 190 IF( ITER.GT.MAXIT ) $ GO TO 230 * * Find diagonal block of matrix to work on * IF( TOL.LT.ZERO .AND. ABS( D( M ) ).LE.THRESH ) $ D( M ) = ZERO SMAX = ABS( D( M ) ) SMIN = SMAX DO 60 LLL = 1, M LL = M - LLL IF( LL.EQ.0 ) $ GO TO 80 ABSS = ABS( D( LL ) ) ABSE = ABS( E( LL ) ) IF( TOL.LT.ZERO .AND. ABSS.LE.THRESH ) $ D( LL ) = ZERO IF( ABSE.LE.THRESH ) $ GO TO 70 SMIN = MIN( SMIN, ABSS ) SMAX = MAX( SMAX, ABSS, ABSE ) 60 CONTINUE 70 CONTINUE E( LL ) = ZERO * * Matrix splits since E(LL) = 0 * IF( LL.EQ.M-1 ) THEN * * Convergence of bottom singular value, return to top of loop * M = M - 1 GO TO 50 END IF 80 CONTINUE LL = LL + 1 * * E(LL) through E(M-1) are nonzero, E(LL-1) is zero * IF( LL.EQ.M-1 ) THEN * * 2 by 2 block, handle separately * CALL DLASV2( D( M-1 ), E( M-1 ), D( M ), SIGMN, SIGMX, SINR, $ COSR, SINL, COSL ) D( M-1 ) = SIGMX E( M-1 ) = ZERO D( M ) = SIGMN * * Compute singular vectors, if desired * IF( NCVT.GT.0 ) $ CALL DROT( NCVT, VT( M-1, 1 ), LDVT, VT( M, 1 ), LDVT, COSR, $ SINR ) IF( NRU.GT.0 ) $ CALL DROT( NRU, U( 1, M-1 ), 1, U( 1, M ), 1, COSL, SINL ) IF( NCC.GT.0 ) $ CALL DROT( NCC, C( M-1, 1 ), LDC, C( M, 1 ), LDC, COSL, $ SINL ) M = M - 2 GO TO 50 END IF * * If working on new submatrix, choose shift direction * (from larger end diagonal entry towards smaller) * IF( LL.GT.OLDM .OR. M.LT.OLDLL ) THEN IF( ABS( D( LL ) ).GE.ABS( D( M ) ) ) THEN * * Chase bulge from top (big end) to bottom (small end) * IDIR = 1 ELSE * * Chase bulge from bottom (big end) to top (small end) * IDIR = 2 END IF END IF * * Apply convergence tests * IF( IDIR.EQ.1 ) THEN * * Run convergence test in forward direction * First apply standard test to bottom of matrix * IF( ABS( E( M-1 ) ).LE.ABS( TOL )*ABS( D( M ) ) .OR. $ ( TOL.LT.ZERO .AND. ABS( E( M-1 ) ).LE.THRESH ) ) THEN E( M-1 ) = ZERO GO TO 50 END IF * IF( TOL.GE.ZERO ) THEN * * If relative accuracy desired, * apply convergence criterion forward * MU = ABS( D( LL ) ) SMINL = MU DO 90 LLL = LL, M - 1 IF( ABS( E( LLL ) ).LE.TOL*MU ) THEN E( LLL ) = ZERO GO TO 50 END IF SMINLO = SMINL MU = ABS( D( LLL+1 ) )*( MU / ( MU+ABS( E( LLL ) ) ) ) SMINL = MIN( SMINL, MU ) 90 CONTINUE * * If singular values only wanted, apply gap test to bottom * end of matrix * IF( JOB.EQ.0 ) THEN GAP = SMINLO / SQRT( DBLE( M-LL ) ) - ABS( D( M ) ) IF( GAP.GT.ZERO ) THEN ABSS = ABS( D( M ) ) ABSE = ABS( E( M-1 ) ) GMAX = MAX( GAP, ABSS, ABSE ) IF( ( ABSE / GMAX )**2.LE.TOL*( GAP / GMAX )* $ ( ABSS / GMAX ) ) THEN E( M-1 ) = ZERO GO TO 50 END IF END IF END IF END IF ELSE * * Run convergence test in backward direction * First apply standard test to top of matrix * IF( ABS( E( LL ) ).LE.ABS( TOL )*ABS( D( LL ) ) .OR. $ ( TOL.LT.ZERO .AND. ABS( E( LL ) ).LE.THRESH ) ) THEN E( LL ) = ZERO GO TO 50 END IF * IF( TOL.GE.ZERO ) THEN * * If relative accuracy desired, * apply convergence criterion backward * MU = ABS( D( M ) ) SMINL = MU DO 100 LLL = M - 1, LL, -1 IF( ABS( E( LLL ) ).LE.TOL*MU ) THEN E( LLL ) = ZERO GO TO 50 END IF SMINLO = SMINL MU = ABS( D( LLL ) )*( MU / ( MU+ABS( E( LLL ) ) ) ) SMINL = MIN( SMINL, MU ) 100 CONTINUE * * If singular values only wanted, apply gap test to top * end of matrix * IF( JOB.EQ.0 ) THEN GAP = SMINLO / SQRT( DBLE( M-LL ) ) - ABS( D( LL ) ) IF( GAP.GT.ZERO ) THEN ABSS = ABS( D( LL ) ) ABSE = ABS( E( LL ) ) GMAX = MAX( GAP, ABSS, ABSE ) IF( ( ABSE / GMAX )**2.LE.TOL*( GAP / GMAX )* $ ( ABSS / GMAX ) ) THEN E( LL ) = ZERO GO TO 50 END IF END IF END IF END IF END IF OLDLL = LL OLDM = M * * Compute shift. First, test if shifting would ruin relative * accuracy, and if so set the shift to zero. * IF( TOL.GE.ZERO .AND. N*TOL*( SMINL / SMAX ).LE. $ MAX( EPS, HNDRTH*TOL ) ) THEN * * Use a zero shift to avoid loss of relative accuracy * SHIFT = ZERO ELSE * * Compute the shift from 2-by-2 block at end of matrix * IF( IDIR.EQ.1 ) THEN SLL = ABS( D( LL ) ) CALL DLAS2( D( M-1 ), E( M-1 ), D( M ), SHIFT, R ) ELSE SLL = ABS( D( M ) ) CALL DLAS2( D( LL ), E( LL ), D( LL+1 ), SHIFT, R ) END IF * * Test if shift negligible, and if so set to zero * IF( SLL.GT.ZERO ) THEN IF( ( SHIFT / SLL )**2.LT.EPS ) $ SHIFT = ZERO END IF END IF * * Increment iteration count * ITER = ITER + M - LL * * If SHIFT = 0, do simplified QR iteration * IF( SHIFT.EQ.ZERO ) THEN IF( IDIR.EQ.1 ) THEN * * Chase bulge from top to bottom * CS = ONE OLDCS = ONE * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( D( LL )*CS, E( LL ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( LL+1 )*SN, OLDCS, OLDSN, $ D( LL ) ) WORK( 1 ) = CS WORK( 1+NM1 ) = SN WORK( 1+NM12 ) = OLDCS WORK( 1+NM13 ) = OLDSN IROT = 1 DO 110 I = LL + 1, M - 1 CALL DLARTG( D( I )*CS, E( I ), CS, SN, R ) E( I-1 ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I+1 )*SN, OLDCS, OLDSN, $ D( I ) ) IROT = IROT + 1 WORK( IROT ) = CS WORK( IROT+NM1 ) = SN WORK( IROT+NM12 ) = OLDCS WORK( IROT+NM13 ) = OLDSN 110 CONTINUE H = D( M )*CS D( M ) = H*OLDCS E( M-1 ) = H*OLDSN * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL DLASR( 'L', 'V', 'F', M-LL+1, NCVT, WORK( 1 ), $ WORK( N ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL DLASR( 'R', 'V', 'F', NRU, M-LL+1, $ WORK( NM12+1 ), WORK( NM13+1 ), $ U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL DLASR( 'L', 'V', 'F', M-LL+1, NCC, $ WORK( NM12+1 ), WORK( NM13+1 ), $ C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( D( LL )*CS, E( LL ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( LL+1 )*SN, OLDCS, OLDSN, $ D( LL ) ) DO 120 I = LL + 1, M - 1 CALL DLARTG( D( I )*CS, E( I ), CS, SN, R ) E( I-1 ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I+1 )*SN, OLDCS, OLDSN, $ D( I ) ) 120 CONTINUE H = D( M )*CS D( M ) = H*OLDCS E( M-1 ) = H*OLDSN * END IF * * Test convergence * IF( ABS( E( M-1 ) ).LE.THRESH ) $ E( M-1 ) = ZERO * ELSE * * Chase bulge from bottom to top * CS = ONE OLDCS = ONE * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( D( M )*CS, E( M-1 ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( M-1 )*SN, OLDCS, OLDSN, D( M ) ) WORK( M-LL ) = CS WORK( M-LL+NM1 ) = -SN WORK( M-LL+NM12 ) = OLDCS WORK( M-LL+NM13 ) = -OLDSN IROT = M - LL DO 130 I = M - 1, LL + 1, -1 CALL DLARTG( D( I )*CS, E( I-1 ), CS, SN, R ) E( I ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I-1 )*SN, OLDCS, OLDSN, $ D( I ) ) IROT = IROT - 1 WORK( IROT ) = CS WORK( IROT+NM1 ) = -SN WORK( IROT+NM12 ) = OLDCS WORK( IROT+NM13 ) = -OLDSN 130 CONTINUE H = D( LL )*CS D( LL ) = H*OLDCS E( LL ) = H*OLDSN * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL DLASR( 'L', 'V', 'B', M-LL+1, NCVT, $ WORK( NM12+1 ), WORK( NM13+1 ), $ VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL DLASR( 'R', 'V', 'B', NRU, M-LL+1, WORK( 1 ), $ WORK( N ), U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL DLASR( 'L', 'V', 'B', M-LL+1, NCC, WORK( 1 ), $ WORK( N ), C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( D( M )*CS, E( M-1 ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( M-1 )*SN, OLDCS, OLDSN, D( M ) ) DO 140 I = M - 1, LL + 1, -1 CALL DLARTG( D( I )*CS, E( I-1 ), CS, SN, R ) E( I ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I-1 )*SN, OLDCS, OLDSN, $ D( I ) ) 140 CONTINUE H = D( LL )*CS D( LL ) = H*OLDCS E( LL ) = H*OLDSN * END IF * * Test convergence * IF( ABS( E( LL ) ).LE.THRESH ) $ E( LL ) = ZERO END IF ELSE * * Use nonzero shift * IF( IDIR.EQ.1 ) THEN * * Chase bulge from top to bottom * F = ( ABS( D( LL ) )-SHIFT )* $ ( SIGN( ONE, D( LL ) )+SHIFT / D( LL ) ) G = E( LL ) * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( LL ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL ) G = SINR*D( LL+1 ) D( LL+1 ) = COSR*D( LL+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL ) = R F = COSL*E( LL ) + SINL*D( LL+1 ) D( LL+1 ) = COSL*D( LL+1 ) - SINL*E( LL ) G = SINL*E( LL+1 ) E( LL+1 ) = COSL*E( LL+1 ) WORK( 1 ) = COSR WORK( 1+NM1 ) = SINR WORK( 1+NM12 ) = COSL WORK( 1+NM13 ) = SINL IROT = 1 DO 150 I = LL + 1, M - 2 CALL DLARTG( F, G, COSR, SINR, R ) E( I-1 ) = R F = COSR*D( I ) + SINR*E( I ) E( I ) = COSR*E( I ) - SINR*D( I ) G = SINR*D( I+1 ) D( I+1 ) = COSR*D( I+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I ) + SINL*D( I+1 ) D( I+1 ) = COSL*D( I+1 ) - SINL*E( I ) G = SINL*E( I+1 ) E( I+1 ) = COSL*E( I+1 ) IROT = IROT + 1 WORK( IROT ) = COSR WORK( IROT+NM1 ) = SINR WORK( IROT+NM12 ) = COSL WORK( IROT+NM13 ) = SINL 150 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( M-2 ) = R F = COSR*D( M-1 ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M-1 ) G = SINR*D( M ) D( M ) = COSR*D( M ) CALL DLARTG( F, G, COSL, SINL, R ) D( M-1 ) = R F = COSL*E( M-1 ) + SINL*D( M ) D( M ) = COSL*D( M ) - SINL*E( M-1 ) IROT = IROT + 1 WORK( IROT ) = COSR WORK( IROT+NM1 ) = SINR WORK( IROT+NM12 ) = COSL WORK( IROT+NM13 ) = SINL E( M-1 ) = F * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL DLASR( 'L', 'V', 'F', M-LL+1, NCVT, WORK( 1 ), $ WORK( N ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL DLASR( 'R', 'V', 'F', NRU, M-LL+1, $ WORK( NM12+1 ), WORK( NM13+1 ), $ U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL DLASR( 'L', 'V', 'F', M-LL+1, NCC, $ WORK( NM12+1 ), WORK( NM13+1 ), $ C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( LL ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL ) G = SINR*D( LL+1 ) D( LL+1 ) = COSR*D( LL+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL ) = R F = COSL*E( LL ) + SINL*D( LL+1 ) D( LL+1 ) = COSL*D( LL+1 ) - SINL*E( LL ) G = SINL*E( LL+1 ) E( LL+1 ) = COSL*E( LL+1 ) DO 160 I = LL + 1, M - 2 CALL DLARTG( F, G, COSR, SINR, R ) E( I-1 ) = R F = COSR*D( I ) + SINR*E( I ) E( I ) = COSR*E( I ) - SINR*D( I ) G = SINR*D( I+1 ) D( I+1 ) = COSR*D( I+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I ) + SINL*D( I+1 ) D( I+1 ) = COSL*D( I+1 ) - SINL*E( I ) G = SINL*E( I+1 ) E( I+1 ) = COSL*E( I+1 ) 160 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( M-2 ) = R F = COSR*D( M-1 ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M-1 ) G = SINR*D( M ) D( M ) = COSR*D( M ) CALL DLARTG( F, G, COSL, SINL, R ) D( M-1 ) = R F = COSL*E( M-1 ) + SINL*D( M ) D( M ) = COSL*D( M ) - SINL*E( M-1 ) E( M-1 ) = F * END IF * * Test convergence * IF( ABS( E( M-1 ) ).LE.THRESH ) $ E( M-1 ) = ZERO * ELSE * * Chase bulge from bottom to top * F = ( ABS( D( M ) )-SHIFT )*( SIGN( ONE, D( M ) )+SHIFT / $ D( M ) ) G = E( M-1 ) * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( M ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M ) G = SINR*D( M-1 ) D( M-1 ) = COSR*D( M-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( M ) = R F = COSL*E( M-1 ) + SINL*D( M-1 ) D( M-1 ) = COSL*D( M-1 ) - SINL*E( M-1 ) G = SINL*E( M-2 ) E( M-2 ) = COSL*E( M-2 ) WORK( M-LL ) = COSR WORK( M-LL+NM1 ) = -SINR WORK( M-LL+NM12 ) = COSL WORK( M-LL+NM13 ) = -SINL IROT = M - LL DO 170 I = M - 1, LL + 2, -1 CALL DLARTG( F, G, COSR, SINR, R ) E( I ) = R F = COSR*D( I ) + SINR*E( I-1 ) E( I-1 ) = COSR*E( I-1 ) - SINR*D( I ) G = SINR*D( I-1 ) D( I-1 ) = COSR*D( I-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I-1 ) + SINL*D( I-1 ) D( I-1 ) = COSL*D( I-1 ) - SINL*E( I-1 ) G = SINL*E( I-2 ) E( I-2 ) = COSL*E( I-2 ) IROT = IROT - 1 WORK( IROT ) = COSR WORK( IROT+NM1 ) = -SINR WORK( IROT+NM12 ) = COSL WORK( IROT+NM13 ) = -SINL 170 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( LL+1 ) = R F = COSR*D( LL+1 ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL+1 ) G = SINR*D( LL ) D( LL ) = COSR*D( LL ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL+1 ) = R F = COSL*E( LL ) + SINL*D( LL ) D( LL ) = COSL*D( LL ) - SINL*E( LL ) IROT = IROT - 1 WORK( IROT ) = COSR WORK( IROT+NM1 ) = -SINR WORK( IROT+NM12 ) = COSL WORK( IROT+NM13 ) = -SINL E( LL ) = F * ELSE * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( M ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M ) G = SINR*D( M-1 ) D( M-1 ) = COSR*D( M-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( M ) = R F = COSL*E( M-1 ) + SINL*D( M-1 ) D( M-1 ) = COSL*D( M-1 ) - SINL*E( M-1 ) G = SINL*E( M-2 ) E( M-2 ) = COSL*E( M-2 ) DO 180 I = M - 1, LL + 2, -1 CALL DLARTG( F, G, COSR, SINR, R ) E( I ) = R F = COSR*D( I ) + SINR*E( I-1 ) E( I-1 ) = COSR*E( I-1 ) - SINR*D( I ) G = SINR*D( I-1 ) D( I-1 ) = COSR*D( I-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I-1 ) + SINL*D( I-1 ) D( I-1 ) = COSL*D( I-1 ) - SINL*E( I-1 ) G = SINL*E( I-2 ) E( I-2 ) = COSL*E( I-2 ) 180 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( LL+1 ) = R F = COSR*D( LL+1 ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL+1 ) G = SINR*D( LL ) D( LL ) = COSR*D( LL ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL+1 ) = R F = COSL*E( LL ) + SINL*D( LL ) D( LL ) = COSL*D( LL ) - SINL*E( LL ) E( LL ) = F * END IF * * Test convergence * IF( ABS( E( LL ) ).LE.THRESH ) $ E( LL ) = ZERO * * Update singular vectors if desired * IF( NCVT.GT.0 ) $ CALL DLASR( 'L', 'V', 'B', M-LL+1, NCVT, WORK( NM12+1 ), $ WORK( NM13+1 ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL DLASR( 'R', 'V', 'B', NRU, M-LL+1, WORK( 1 ), $ WORK( N ), U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL DLASR( 'L', 'V', 'B', M-LL+1, NCC, WORK( 1 ), $ WORK( N ), C( LL, 1 ), LDC ) END IF END IF * * QR iteration finished, go back and check convergence * GO TO 50 * * All singular values converged, so make them positive * 190 CONTINUE DO 200 I = 1, N IF( D( I ).LT.ZERO ) THEN D( I ) = -D( I ) * * Change sign of singular vectors, if desired * IF( NCVT.GT.0 ) $ CALL DSCAL( NCVT, NEGONE, VT( I, 1 ), LDVT ) END IF 200 CONTINUE * * Sort the singular values into decreasing order (insertion sort on * singular values, but only one transposition per singular vector) * DO 220 I = 1, N - 1 * * Scan for smallest D(I) * ISUB = 1 SMIN = D( 1 ) DO 210 J = 2, N + 1 - I IF( D( J ).LE.SMIN ) THEN ISUB = J SMIN = D( J ) END IF 210 CONTINUE IF( ISUB.NE.N+1-I ) THEN * * Swap singular values and vectors * D( ISUB ) = D( N+1-I ) D( N+1-I ) = SMIN IF( NCVT.GT.0 ) $ CALL DSWAP( NCVT, VT( ISUB, 1 ), LDVT, VT( N+1-I, 1 ), $ LDVT ) IF( NRU.GT.0 ) $ CALL DSWAP( NRU, U( 1, ISUB ), 1, U( 1, N+1-I ), 1 ) IF( NCC.GT.0 ) $ CALL DSWAP( NCC, C( ISUB, 1 ), LDC, C( N+1-I, 1 ), LDC ) END IF 220 CONTINUE GO TO 250 * * Maximum number of iterations exceeded, failure to converge * 230 CONTINUE INFO = 0 DO 240 I = 1, N - 1 IF( E( I ).NE.ZERO ) $ INFO = INFO + 1 240 CONTINUE 250 CONTINUE RETURN * * End of DBDSQR * END octave-1.1.0/libcruft/lapack/dgebak.f100666 415 17 12677 5306544262 15633 0ustar jweusers SUBROUTINE DGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, $ INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER JOB, SIDE INTEGER IHI, ILO, INFO, LDV, M, N * .. * .. Array Arguments .. DOUBLE PRECISION SCALE( * ), V( LDV, * ) * .. * * Purpose * ======= * * DGEBAK forms the right or left eigenvectors of a real general matrix * by backward transformation on the computed eigenvectors of the matrix * preprocessed by DGEBAL. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies the type of backward transformation required: * = 'N', do nothing, return immediately. * = 'P', do backward transformation for permutation. * = 'S', do backward transformation for balancing. * = 'B', do backward transformations for both permutation and * balancing. * JOB must be the same as the JOB parameter in DGEBAL. * * SIDE (input) CHARACTER*1 * Specifies whether the eigenvectors given in the array V * are right eigenvectors or left eigenvectors. * = 'R', right eigenvectors * = 'L', left eigenvectors * * N (input) INTEGER * The number of rows of the matrix V. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * ILO and IHI are integers determined by DGEBAL. * * SCALE (input) DOUBLE PRECISION array, dimension (N) * SCALE contains information determining the permutations * and/or scaling factors used by DGEBAL. * * M (input) INTEGER * M is the number of columns of the matrix of eigenvectors V * to be back transformed. * * V (input/output) DOUBLE PRECISION array, dimension (LDV,M) * On entry, V contains the real and imaginary parts of the * eigenvectors to be backward transformed in its first M * columns. * On exit, V contains the real and imaginary parts of the * transformed eigenvectors in its first M columns. * * LDV (input) INTEGER * The leading dimension of the matrix V. LDV >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFTV, RIGHTV INTEGER I, II, K DOUBLE PRECISION S * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DSCAL, DSWAP, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Decode and Test the input parameters * RIGHTV = LSAME( SIDE, 'R' ) LEFTV = LSAME( SIDE, 'L' ) * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND. $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN INFO = -1 ELSE IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -5 ELSE IF( M.LT.0 ) THEN INFO = -7 ELSE IF( LDV.LT.MAX( 1, N ) ) THEN INFO = -9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEBAK', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN IF( M.EQ.0 ) $ RETURN IF( LSAME( JOB, 'N' ) ) $ RETURN * IF( ILO.EQ.IHI ) $ GO TO 30 * * Backward balance * IF( LSAME( JOB, 'S' ) .OR. LSAME( JOB, 'B' ) ) THEN * IF( RIGHTV ) THEN DO 10 I = ILO, IHI S = SCALE( I ) CALL DSCAL( M, S, V( I, 1 ), LDV ) 10 CONTINUE END IF * IF( LEFTV ) THEN DO 20 I = ILO, IHI S = ONE / SCALE( I ) CALL DSCAL( M, S, V( I, 1 ), LDV ) 20 CONTINUE END IF * END IF * * Backward permutation * * For I = ILO-1 step -1 until 1, * IHI+1 step 1 until N do -- * 30 CONTINUE IF( LSAME( JOB, 'P' ) .OR. LSAME( JOB, 'B' ) ) THEN IF( RIGHTV ) THEN DO 40 II = 1, N I = II IF( I.GE.ILO .AND. I.LE.IHI ) $ GO TO 40 IF( I.LT.ILO ) $ I = ILO - II K = SCALE( I ) IF( K.EQ.I ) $ GO TO 40 CALL DSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) 40 CONTINUE END IF * IF( LEFTV ) THEN DO 50 II = 1, N I = II IF( I.GE.ILO .AND. I.LE.IHI ) $ GO TO 50 IF( I.LT.ILO ) $ I = ILO - II K = SCALE( I ) IF( K.EQ.I ) $ GO TO 50 CALL DSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) 50 CONTINUE END IF END IF * RETURN * * End of DGEBAK * END octave-1.1.0/libcruft/lapack/dgebal.f100666 415 17 16347 5306544264 15634 0ustar jweusers SUBROUTINE DGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER JOB INTEGER IHI, ILO, INFO, LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), SCALE( * ) * .. * * Purpose * ======= * * DGEBAL does permutations to isolate eigenvalues and/or balances a * real general matrix. Balancing may reduce the 1-norm of the * matrix and can improve the accuracy of the computed eigenvalues * and/or eigenvectors. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies the operations to be done: * = 'N', do nothing with the input matrix, but set * ILO = 1, IHI = N, SCALE(I) = ONE. * = 'P', only permute to isolate eigenvalues. * = 'S', only balance the input matrix. * = 'B', both permute and balance. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, A contains the input matrix to be balanced. * On exit, A contains the permuted and/or balanced matrix. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the matrix A. LDA >= max(1,N). * * ILO (output) INTEGER * IHI (output) INTEGER * On exit, ILO and IHI are two integers such that A(I,J) * is equal to zero if * (1) I is greater than J and * (2) J = 1,...,ILO-1 or I = IHI+1,...,N. * * SCALE (output) DOUBLE PRECISION array, dimension (N) * On exit, SCALE contains information about the permutations * and scaling factors used. If P(J) is the index of the * row and column interchanged with row and column J and D(J,J) * is the scaling factor used to balance row and column J of the * submatrix of A, then * SCALE(J) = P(J), for J = 1,...,ILO-1 * = D(J,J), J = ILO,...,IHI * = P(J) J = IHI+1,...,N. * The order in which the interchanges are made is N to IHI+1, * then 1 to ILO-1. * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -k, the k-th argument had an illegal value. * * Further Details * =============== * * The permutations consist of row and column interchanges which put * the matrix in the form * * ( T1 X Y ) * P A P = ( 0 B Z ) * ( 0 0 T2 ) * * where T1 and T2 are upper triangular matrices whose eigenvalues lie * along the diagonal. The column indices ILO and IHI mark the starting * and ending columns of the submatrix B. Balancing consists of applying * a diagonal similarity transformation inv(D) * B * D to make the * 1-norms of each row of B and its corresponding column nearly equal. * The output matrix is * * ( T1 X*D Y ) * ( 0 inv(D)*B*D inv(D)*Z ). * ( 0 0 T2 ) * * Information about the permutations P and the diagonal matrix D is * returned in the vector SCALE. * * This subroutine is based on the EISPACK routine BALANC. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION SCLFAC, B2 PARAMETER ( SCLFAC = 1.0D+1, B2 = SCLFAC*SCLFAC ) DOUBLE PRECISION FACTOR PARAMETER ( FACTOR = 0.95D+0 ) * .. * .. Local Scalars .. LOGICAL NOCONV INTEGER I, IEXC, J, K, L, M DOUBLE PRECISION C, F, G, R, S * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DSCAL, DSWAP, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND. $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEBAL', -INFO ) RETURN END IF * K = 1 L = N * IF( N.EQ.0 ) $ GO TO 210 * IF( LSAME( JOB, 'N' ) ) THEN DO 10 I = 1, N SCALE( I ) = ONE 10 CONTINUE GO TO 210 END IF * IF( LSAME( JOB, 'S' ) ) $ GO TO 120 * * Permutation to isolate eigenvalues if possible * GO TO 50 * * Row and column exchange. * 20 CONTINUE SCALE( M ) = J IF( J.EQ.M ) $ GO TO 30 * CALL DSWAP( L, A( 1, J ), 1, A( 1, M ), 1 ) CALL DSWAP( N-K+1, A( J, K ), LDA, A( M, K ), LDA ) * 30 CONTINUE GO TO ( 40, 80 )IEXC * * Search for rows isolating an eigenvalue and push them down. * 40 CONTINUE IF( L.EQ.1 ) $ GO TO 210 L = L - 1 * 50 CONTINUE DO 70 J = L, 1, -1 * DO 60 I = 1, L IF( I.EQ.J ) $ GO TO 60 IF( A( J, I ).NE.ZERO ) $ GO TO 70 60 CONTINUE * M = L IEXC = 1 GO TO 20 70 CONTINUE * GO TO 90 * * Search for columns isolating an eigenvalue and push them left. * 80 CONTINUE K = K + 1 * 90 CONTINUE DO 110 J = K, L * DO 100 I = K, L IF( I.EQ.J ) $ GO TO 100 IF( A( I, J ).NE.ZERO ) $ GO TO 110 100 CONTINUE * M = K IEXC = 2 GO TO 20 110 CONTINUE * 120 CONTINUE DO 130 I = K, L SCALE( I ) = ONE 130 CONTINUE * IF( LSAME( JOB, 'P' ) ) $ GO TO 210 * * Balance the submatrix in rows K to L. * * Iterative loop for norm reduction * 140 CONTINUE NOCONV = .FALSE. * DO 200 I = K, L C = ZERO R = ZERO * DO 150 J = K, L IF( J.EQ.I ) $ GO TO 150 C = C + ABS( A( J, I ) ) R = R + ABS( A( I, J ) ) 150 CONTINUE * * Guard against zero C or R due to underflow. * IF( C.EQ.ZERO .OR. R.EQ.ZERO ) $ GO TO 200 G = R / SCLFAC F = ONE S = C + R 160 CONTINUE IF( C.GE.G ) $ GO TO 170 F = F*SCLFAC C = C*B2 GO TO 160 * 170 CONTINUE G = R*SCLFAC 180 CONTINUE IF( C.LT.G ) $ GO TO 190 F = F / SCLFAC C = C / B2 GO TO 180 * * Now balance. * 190 CONTINUE IF( ( C+R ) / F.GE.FACTOR*S ) $ GO TO 200 G = ONE / F SCALE( I ) = SCALE( I )*F NOCONV = .TRUE. * CALL DSCAL( N-K+1, G, A( I, K ), LDA ) CALL DSCAL( L, F, A( 1, I ), 1 ) * 200 CONTINUE * IF( NOCONV ) $ GO TO 140 * 210 CONTINUE ILO = K IHI = L * RETURN * * End of DGEBAL * END octave-1.1.0/libcruft/lapack/dgebd2.f100666 415 17 17473 5306544271 15544 0ustar jweusers SUBROUTINE DGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), D( * ), E( * ), TAUP( * ), $ TAUQ( * ), WORK( * ) * .. * * Purpose * ======= * * DGEBD2 reduces a real general m by n matrix A to upper or lower * bidiagonal form B by an orthogonal transformation: Q' * A * P = B. * * If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. M >= 0. * * N (input) INTEGER * The number of columns in the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, * if m >= n, the diagonal and the first superdiagonal are * overwritten with the upper bidiagonal matrix B; the * elements below the diagonal, with the array TAUQ, represent * the orthogonal matrix Q as a product of elementary * reflectors, and the elements above the first superdiagonal, * with the array TAUP, represent the orthogonal matrix P as * a product of elementary reflectors; * if m < n, the diagonal and the first subdiagonal are * overwritten with the lower bidiagonal matrix B; the * elements below the first subdiagonal, with the array TAUQ, * represent the orthogonal matrix Q as a product of * elementary reflectors, and the elements above the diagonal, * with the array TAUP, represent the orthogonal matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (min(M,N)) * The diagonal elements of the bidiagonal matrix B: * D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (min(M,N)-1) * The off-diagonal elements of the bidiagonal matrix B: * if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; * if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. * * TAUQ (output) DOUBLE PRECISION array dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix Q. See Further Details. * * TAUP (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix P. See Further Details. * * WORK (workspace) DOUBLE PRECISION array, dimension (max(M,N)) * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * If m >= n, * * Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are real scalars, and v and u are real vectors; * v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in A(i+1:m,i); * u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in A(i,i+2:n); * tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, * * Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are real scalars, and v and u are real vectors; * v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in A(i+2:m,i); * u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in A(i,i+1:n); * tauq is stored in TAUQ(i) and taup in TAUP(i). * * The contents of A on exit are illustrated by the following examples: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) * ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) * ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) * ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) * ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) * ( v1 v2 v3 v4 v5 ) * * where d and e denote diagonal and off-diagonal elements of B, vi * denotes an element of the vector defining H(i), and ui an element of * the vector defining G(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I * .. * .. External Subroutines .. EXTERNAL DLARF, DLARFG, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.LT.0 ) THEN CALL XERBLA( 'DGEBD2', -INFO ) RETURN END IF * IF( M.GE.N ) THEN * * Reduce to upper bidiagonal form * DO 10 I = 1, N * * Generate elementary reflector H(i) to annihilate A(i+1:m,i) * CALL DLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1, $ TAUQ( I ) ) D( I ) = A( I, I ) A( I, I ) = ONE * * Apply H(i) to A(i:m,i+1:n) from the left * CALL DLARF( 'Left', M-I+1, N-I, A( I, I ), 1, TAUQ( I ), $ A( I, I+1 ), LDA, WORK ) A( I, I ) = D( I ) * IF( I.LT.N ) THEN * * Generate elementary reflector G(i) to annihilate * A(i,i+2:n) * CALL DLARFG( N-I, A( I, I+1 ), A( I, MIN( I+2, N ) ), $ LDA, TAUP( I ) ) E( I ) = A( I, I+1 ) A( I, I+1 ) = ONE * * Apply G(i) to A(i+1:m,i+1:n) from the right * CALL DLARF( 'Right', M-I, N-I, A( I, I+1 ), LDA, $ TAUP( I ), A( I+1, I+1 ), LDA, WORK ) A( I, I+1 ) = E( I ) ELSE TAUP( I ) = ZERO END IF 10 CONTINUE ELSE * * Reduce to lower bidiagonal form * DO 20 I = 1, M * * Generate elementary reflector G(i) to annihilate A(i,i+1:n) * CALL DLARFG( N-I+1, A( I, I ), A( I, MIN( I+1, N ) ), LDA, $ TAUP( I ) ) D( I ) = A( I, I ) A( I, I ) = ONE * * Apply G(i) to A(i+1:m,i:n) from the right * CALL DLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, TAUP( I ), $ A( MIN( I+1, M ), I ), LDA, WORK ) A( I, I ) = D( I ) * IF( I.LT.M ) THEN * * Generate elementary reflector H(i) to annihilate * A(i+2:m,i) * CALL DLARFG( M-I, A( I+1, I ), A( MIN( I+2, M ), I ), 1, $ TAUQ( I ) ) E( I ) = A( I+1, I ) A( I+1, I ) = ONE * * Apply H(i) to A(i+1:m,i+1:n) from the left * CALL DLARF( 'Left', M-I, N-I, A( I+1, I ), 1, TAUQ( I ), $ A( I+1, I+1 ), LDA, WORK ) A( I+1, I ) = E( I ) ELSE TAUQ( I ) = ZERO END IF 20 CONTINUE END IF RETURN * * End of DGEBD2 * END octave-1.1.0/libcruft/lapack/dgebrd.f100666 415 17 21233 5306544271 15631 0ustar jweusers SUBROUTINE DGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, $ INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), D( * ), E( * ), TAUP( * ), $ TAUQ( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DGEBRD reduces a real general m by n matrix A to upper or lower * bidiagonal form B by an orthogonal transformation: Q' * A * P = B. * * If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. M >= 0. * * N (input) INTEGER * The number of columns in the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, * if m >= n, the diagonal and the first superdiagonal are * overwritten with the upper bidiagonal matrix B; the * elements below the diagonal, with the array TAUQ, represent * the orthogonal matrix Q as a product of elementary * reflectors, and the elements above the first superdiagonal, * with the array TAUP, represent the orthogonal matrix P as * a product of elementary reflectors; * if m < n, the diagonal and the first subdiagonal are * overwritten with the lower bidiagonal matrix B; the * elements below the first subdiagonal, with the array TAUQ, * represent the orthogonal matrix Q as a product of * elementary reflectors, and the elements above the diagonal, * with the array TAUP, represent the orthogonal matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (min(M,N)) * The diagonal elements of the bidiagonal matrix B: * D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (min(M,N)-1) * The off-diagonal elements of the bidiagonal matrix B: * if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; * if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. * * TAUQ (output) DOUBLE PRECISION array dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix Q. See Further Details. * * TAUP (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix P. See Further Details. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The length of the array WORK. LWORK >= max(1,M,N). * For optimum performance LWORK should be at least (M+N)*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * If m >= n, * * Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are real scalars, and v and u are real vectors; * v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in A(i+1:m,i); * u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in A(i,i+2:n); * tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, * * Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are real scalars, and v and u are real vectors; * v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in A(i+2:m,i); * u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in A(i,i+1:n); * tauq is stored in TAUQ(i) and taup in TAUP(i). * * The contents of A on exit are illustrated by the following examples: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) * ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) * ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) * ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) * ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) * ( v1 v2 v3 v4 v5 ) * * where d and e denote diagonal and off-diagonal elements of B, vi * denotes an element of the vector defining H(i), and ui an element of * the vector defining G(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, LDWRKX, LDWRKY, MINMN, NB, NBMIN, $ NX DOUBLE PRECISION WS * .. * .. External Subroutines .. EXTERNAL DGEBD2, DGEMM, DLABRD, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, M, N ) ) THEN INFO = -10 END IF IF( INFO.LT.0 ) THEN CALL XERBLA( 'DGEBRD', -INFO ) RETURN END IF * * Quick return if possible * MINMN = MIN( M, N ) IF( MINMN.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * WS = MAX( M, N ) LDWRKX = M LDWRKY = N * * Set the block size NB and the crossover point NX. * NB = MAX( 1, ILAENV( 1, 'DGEBRD', ' ', M, N, -1, -1 ) ) * IF( NB.GT.1 .AND. NB.LT.MINMN ) THEN * * Determine when to switch from blocked to unblocked code. * NX = MAX( NB, ILAENV( 3, 'DGEBRD', ' ', M, N, -1, -1 ) ) IF( NX.LT.MINMN ) THEN WS = ( M+N )*NB IF( LWORK.LT.WS ) THEN * * Not enough work space for the optimal NB, consider using * a smaller block size. * NBMIN = ILAENV( 2, 'DGEBRD', ' ', M, N, -1, -1 ) IF( LWORK.GE.( M+N )*NBMIN ) THEN NB = LWORK / ( M+N ) ELSE NB = 1 NX = MINMN END IF END IF END IF ELSE NX = MINMN END IF * DO 30 I = 1, MINMN - NX, NB * * Reduce rows and columns i:i+nb-1 to bidiagonal form and return * the matrices X and Y which are needed to update the unreduced * part of the matrix * CALL DLABRD( M-I+1, N-I+1, NB, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, LDWRKX, $ WORK( LDWRKX*NB+1 ), LDWRKY ) * * Update the trailing submatrix A(i+nb:m,i+nb:n), using an update * of the form A := A - V*Y' - X*U' * CALL DGEMM( 'No transpose', 'Transpose', M-I-NB+1, N-I-NB+1, $ NB, -ONE, A( I+NB, I ), LDA, $ WORK( LDWRKX*NB+NB+1 ), LDWRKY, ONE, $ A( I+NB, I+NB ), LDA ) CALL DGEMM( 'No transpose', 'No transpose', M-I-NB+1, N-I-NB+1, $ NB, -ONE, WORK( NB+1 ), LDWRKX, A( I, I+NB ), LDA, $ ONE, A( I+NB, I+NB ), LDA ) * * Copy diagonal and off-diagonal elements of B back into A * IF( M.GE.N ) THEN DO 10 J = I, I + NB - 1 A( J, J ) = D( J ) A( J, J+1 ) = E( J ) 10 CONTINUE ELSE DO 20 J = I, I + NB - 1 A( J, J ) = D( J ) A( J+1, J ) = E( J ) 20 CONTINUE END IF 30 CONTINUE * * Use unblocked code to reduce the remainder of the matrix * CALL DGEBD2( M-I+1, N-I+1, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, IINFO ) WORK( 1 ) = WS RETURN * * End of DGEBRD * END octave-1.1.0/libcruft/lapack/dgeesx.f100666 415 17 42623 5412143564 15665 0ustar jweusers SUBROUTINE DGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, $ WR, WI, VS, LDVS, RCONDE, RCONDV, WORK, LWORK, $ IWORK, LIWORK, BWORK, INFO ) * * -- LAPACK driver routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER JOBVS, SENSE, SORT INTEGER INFO, LDA, LDVS, LIWORK, LWORK, N, SDIM DOUBLE PRECISION RCONDE, RCONDV * .. * .. Array Arguments .. LOGICAL BWORK( * ) INTEGER IWORK( * ) DOUBLE PRECISION A( LDA, * ), VS( LDVS, * ), WI( * ), WORK( * ), $ WR( * ) * .. * .. Function Arguments .. LOGICAL SELECT EXTERNAL SELECT * .. * * Purpose * ======= * * DGEESX computes for an N-by-N real nonsymmetric matrix A, the * eigenvalues, the real Schur form T, and, optionally, the matrix of * Schur vectors Z. This gives the Schur factorization A = Z*T*(Z**T). * * Optionally, it also orders the eigenvalues on the diagonal of the * real Schur form so that selected eigenvalues are at the top left; * computes a reciprocal condition number for the average of the * selected eigenvalues (RCONDE); and computes a reciprocal condition * number for the right invariant subspace corresponding to the * selected eigenvalues (RCONDV). The leading columns of Z form an * orthonormal basis for this invariant subspace. * * For further explanation of the reciprocal condition numbers RCONDE * and RCONDV, see Section 4.10 of the LAPACK Users' Guide (where * these quantities are called s and sep respectively). * * A real matrix is in real Schur form if it is upper quasi-triangular * with 1-by-1 and 2-by-2 blocks. 2-by-2 blocks will be standardized in * the form * [ a b ] * [ c a ] * * where b*c < 0. The eigenvalues of such a block are a +- sqrt(bc). * * Arguments * ========= * * JOBVS (input) CHARACTER*1 * = 'N': Schur vectors are not computed; * = 'V': Schur vectors are computed. * * SORT (input) CHARACTER*1 * Specifies whether or not to order the eigenvalues on the * diagonal of the Schur form. * = 'N': Eigenvalues are not ordered; * = 'S': Eigenvalues are ordered (see SELECT). * * SELECT (input) LOGICAL FUNCTION of two DOUBLE PRECISION variables * SELECT must be declared EXTERNAL in the calling subroutine. * If SORT = 'S', SELECT is used to select eigenvalues to sort * to the top left of the Schur form. * If SORT = 'N', SELECT is not referenced. * An eigenvalue WR(j)+sqrt(-1)*WI(j) is selected if * SELECT(WR(j),WI(j)) is true; i.e., if either one of a * complex conjugate pair of eigenvalues is selected, then both * are. Note that a selected complex eigenvalue may no longer * satisfy SELECT(WR(j),WI(j)) = .TRUE. after ordering, since * ordering may change the value of complex eigenvalues * (especially if the eigenvalue is ill-conditioned); in this * case INFO may be set to N+3 (see INFO below). * * SENSE (input) CHARACTER*1 * Determines which reciprocal condition numbers are computed. * = 'N': None are computed; * = 'E': Computed for average of selected eigenvalues only; * = 'V': Computed for selected right invariant subspace only; * = 'B': Computed for both. * If SENSE = 'E', 'V' or 'B', SORT must equal 'S'. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA, N) * On entry, the N-by-N matrix A. * On exit, A is overwritten by its real Schur form T. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * SDIM (output) INTEGER * If SORT = 'N', SDIM = 0. * If SORT = 'S', SDIM = number of eigenvalues (after sorting) * for which SELECT is true. (Complex conjugate * pairs for which SELECT is true for either * eigenvalue count as 2.) * * WR (output) DOUBLE PRECISION array, dimension (N) * WI (output) DOUBLE PRECISION array, dimension (N) * WR and WI contain the real and imaginary parts, respectively, * of the computed eigenvalues, in the same order that they * appear on the diagonal of the output Schur form T. Complex * conjugate pairs of eigenvalues appear consecutively with the * eigenvalue having the positive imaginary part first. * * VS (output) DOUBLE PRECISION array, dimension (LDVS,N) * If JOBVS = 'V', VS contains the orthogonal matrix Z of Schur * vectors. * If JOBVS = 'N', VS is not referenced. * * LDVS (input) INTEGER * The leading dimension of the array VS. LDVS >= 1, and if * JOBVS = 'V', LDVS >= N. * * RCONDE (output) DOUBLE PRECISION * If SENSE = 'E' or 'B', RCONDE contains the reciprocal * condition number for the average of the selected eigenvalues. * Not referenced if SENSE = 'N' or 'V'. * * RCONDV (output) DOUBLE PRECISION * If SENSE = 'V' or 'B', RCONDV contains the reciprocal * condition number for the selected right invariant subspace. * Not referenced if SENSE = 'N' or 'E'. * * WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the optimal LWORK. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,3*N). * Also, if SENSE = 'E' or 'V' or 'B', * LWORK >= N+2*SDIM*(N-SDIM), where SDIM is the number of * selected eigenvalues computed by this routine. Note that * N+2*SDIM*(N-SDIM) <= N+N*N/2. * For good performance, LWORK must generally be larger. * * IWORK (workspace) INTEGER array, dimension (LIWORK) * Not referenced if SENSE = 'N' or 'E'. * * LIWORK (input) INTEGER * The dimension of the array IWORK. * LIWORK >= 1; if SENSE = 'V' or 'B', LIWORK >= SDIM*(N-SDIM). * * BWORK (workspace) LOGICAL array, dimension (N) * Not referenced if SORT = 'N'. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * > 0: if INFO = i, and i is * <= N: the QR algorithm failed to compute all the * eigenvalues; elements 1:ILO-1 and i+1:N of WR and WI * contain those eigenvalues which have converged; if * JOBVS = 'V', VS contains the transformation which * reduces A to its partially converged Schur form. * = N+1: the eigenvalues could not be reordered because some * eigenvalues were too close to separate (the problem * is very ill-conditioned); * = N+2: after reordering, roundoff changed values of some * complex eigenvalues so that leading eigenvalues in * the Schur form no longer satisfy SELECT=.TRUE. This * could also be caused by underflow due to scaling. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL CURSL, LASTSL, LST2SL, SCALEA, WANTSB, WANTSE, $ WANTSN, WANTST, WANTSV, WANTVS INTEGER HSWORK, I, I1, I2, IBAL, ICOND, IERR, IEVAL, $ IHI, ILO, INXT, IP, ITAU, IWRK, K, MAXB, $ MAXWRK, MINWRK DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, SMLNUM * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DCOPY, DGEBAK, DGEBAL, DGEHRD, DHSEQR, DLABAD, $ DLACPY, DLASCL, DORGHR, DSWAP, DTRSEN, XERBLA * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV DOUBLE PRECISION DLAMCH, DLANGE EXTERNAL LSAME, ILAENV, DLAMCH, DLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTVS = LSAME( JOBVS, 'V' ) WANTST = LSAME( SORT, 'S' ) WANTSN = LSAME( SENSE, 'N' ) WANTSE = LSAME( SENSE, 'E' ) WANTSV = LSAME( SENSE, 'V' ) WANTSB = LSAME( SENSE, 'B' ) IF( ( .NOT.WANTVS ) .AND. ( .NOT.LSAME( JOBVS, 'N' ) ) ) THEN INFO = -1 ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN INFO = -2 ELSE IF( .NOT.( WANTSN .OR. WANTSE .OR. WANTSV .OR. WANTSB ) .OR. $ ( .NOT.WANTST .AND. .NOT.WANTSN ) ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -7 ELSE IF( LDVS.LT.1 .OR. ( WANTVS .AND. LDVS.LT.N ) ) THEN INFO = -12 END IF * * Compute workspace * (Note: Comments in the code beginning "RWorkspace:" describe the * minimal amount of real workspace needed at that point in the * code, as well as the preferred amount for good performance. * IWorkspace refers to integer workspace. * NB refers to the optimal block size for the immediately * following subroutine, as returned by ILAENV. * HSWORK refers to the workspace preferred by DHSEQR, as * calculated below. HSWORK is computed assuming ILO=1 and IHI=N, * the worst case. * If SENSE = 'E', 'V' or 'B', then the amount of workspace needed * depends on SDIM, which is computed by the routine DTRSEN later * in the code.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = 2*N + N*ILAENV( 1, 'DGEHRD', ' ', N, 1, N, 0 ) MINWRK = MAX( 1, 3*N ) IF( .NOT.WANTVS ) THEN MAXB = MAX( ILAENV( 8, 'DHSEQR', 'SN', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'DHSEQR', 'SN', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, N+HSWORK, 1 ) ELSE MAXWRK = MAX( MAXWRK, 2*N+( N-1 )* $ ILAENV( 1, 'DORGHR', ' ', N, 1, N, -1 ) ) MAXB = MAX( ILAENV( 8, 'DHSEQR', 'SV', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'DHSEQR', 'SV', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, N+HSWORK, 1 ) END IF WORK( 1 ) = MAXWRK END IF IF( LWORK.LT.MINWRK ) THEN INFO = -16 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEESX', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) THEN SDIM = 0 RETURN END IF * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SQRT( SMLNUM ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = DLANGE( 'M', N, N, A, LDA, DUM ) SCALEA = .FALSE. IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN SCALEA = .TRUE. CSCALE = SMLNUM ELSE IF( ANRM.GT.BIGNUM ) THEN SCALEA = .TRUE. CSCALE = BIGNUM END IF IF( SCALEA ) $ CALL DLASCL( 'G', 0, 0, ANRM, CSCALE, N, N, A, LDA, IERR ) * * Permute the matrix to make it more nearly triangular * (RWorkspace: need N) * IBAL = 1 CALL DGEBAL( 'P', N, A, LDA, ILO, IHI, WORK( IBAL ), IERR ) * * Reduce to upper Hessenberg form * (RWorkspace: need 3*N, prefer 2*N+N*NB) * ITAU = N + IBAL IWRK = N + ITAU CALL DGEHRD( N, ILO, IHI, A, LDA, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * IF( WANTVS ) THEN * * Copy Householder vectors to VS * CALL DLACPY( 'L', N, N, A, LDA, VS, LDVS ) * * Generate orthogonal matrix in VS * (RWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * CALL DORGHR( N, ILO, IHI, VS, LDVS, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) END IF * SDIM = 0 * * Perform QR iteration, accumulating Schur vectors in VS if desired * (RWorkspace: need N+1, prefer N+HSWORK (see comments) ) * IWRK = ITAU CALL DHSEQR( 'S', JOBVS, N, ILO, IHI, A, LDA, WR, WI, VS, LDVS, $ WORK( IWRK ), LWORK-IWRK+1, IEVAL ) IF( IEVAL.GT.0 ) $ INFO = IEVAL * * Sort eigenvalues if desired * IF( WANTST .AND. INFO.EQ.0 ) THEN IF( SCALEA ) THEN CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, N, 1, WR, N, IERR ) CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, N, 1, WI, N, IERR ) END IF DO 10 I = 1, N BWORK( I ) = SELECT( WR( I ), WI( I ) ) 10 CONTINUE * * Reorder eigenvalues, transform Schur vectors, and compute * reciprocal condition numbers * (RWorkspace: if SENSE is not 'N', need N+2*SDIM*(N-SDIM) * otherwise, need N ) * (IWorkspace: if SENSE is 'V' or 'B', need SDIM*(N-SDIM) * otherwise, need 0 ) * CALL DTRSEN( SENSE, JOBVS, BWORK, N, A, LDA, VS, LDVS, WR, WI, $ SDIM, RCONDE, RCONDV, WORK( IWRK ), LWORK-IWRK+1, $ IWORK, LIWORK, ICOND ) IF( .NOT.WANTSN ) $ MAXWRK = MAX( MAXWRK, N+2*SDIM*( N-SDIM ) ) IF( ICOND.EQ.-15 ) THEN * * Not enough real workspace * INFO = -16 ELSE IF( ICOND.EQ.-17 ) THEN * * Not enough integer workspace * INFO = -18 ELSE IF( ICOND.GT.0 ) THEN * * DTRSEN failed to reorder or to restore standard Schur form * INFO = ICOND + N END IF END IF * IF( WANTVS ) THEN * * Undo balancing * (RWorkspace: need N) * CALL DGEBAK( 'P', 'R', N, ILO, IHI, WORK( IBAL ), N, VS, LDVS, $ IERR ) END IF * IF( SCALEA ) THEN * * Undo scaling for the Schur form of A * CALL DLASCL( 'H', 0, 0, CSCALE, ANRM, N, N, A, LDA, IERR ) CALL DCOPY( N, A, LDA+1, WR, 1 ) IF( ( WANTSV .OR. WANTSB ) .AND. INFO.EQ.0 ) THEN DUM( 1 ) = RCONDV CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, 1, 1, DUM, 1, IERR ) RCONDV = DUM( 1 ) END IF IF( CSCALE.EQ.SMLNUM ) THEN * * If scaling back towards underflow, adjust WI if an * offdiagonal element of a 2-by-2 block in the Schur form * underflows. * IF( IEVAL.GT.0 ) THEN I1 = IEVAL + 1 I2 = IHI - 1 CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, ILO-1, 1, WI, N, $ IERR ) ELSE IF( WANTST ) THEN I1 = 1 I2 = N - 1 ELSE I1 = ILO I2 = IHI - 1 END IF INXT = I1 - 1 DO 20 I = I1, I2 IF( I.LT.INXT ) $ GO TO 20 IF( WI( I ).EQ.ZERO ) THEN INXT = I + 1 ELSE IF( A( I+1, I ).EQ.ZERO ) THEN WI( I ) = ZERO WI( I+1 ) = ZERO ELSE IF( A( I+1, I ).NE.ZERO .AND. A( I, I+1 ).EQ. $ ZERO ) THEN WI( I ) = ZERO WI( I+1 ) = ZERO IF( I.GT.1 ) $ CALL DSWAP( I-1, A( 1, I ), 1, A( 1, I+1 ), 1 ) IF( N.GT.I+1 ) $ CALL DSWAP( N-I-1, A( I, I+2 ), LDA, $ A( I+1, I+2 ), LDA ) CALL DSWAP( N, VS( 1, I ), 1, VS( 1, I+1 ), 1 ) A( I, I+1 ) = A( I+1, I ) A( I+1, I ) = ZERO END IF INXT = I + 2 END IF 20 CONTINUE END IF CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, N-IEVAL, 1, $ WI( IEVAL+1 ), MAX( N-IEVAL, 1 ), IERR ) END IF * IF( WANTST .AND. INFO.EQ.0 ) THEN * * Check if reordering successful * LASTSL = .TRUE. LST2SL = .TRUE. SDIM = 0 IP = 0 DO 30 I = 1, N CURSL = SELECT( WR( I ), WI( I ) ) IF( WI( I ).EQ.ZERO ) THEN IF( CURSL ) $ SDIM = SDIM + 1 IP = 0 IF( CURSL .AND. .NOT.LASTSL ) $ INFO = N + 2 ELSE IF( IP.EQ.1 ) THEN * * Last eigenvalue of conjugate pair * CURSL = CURSL .OR. LASTSL LASTSL = CURSL IF( CURSL ) $ SDIM = SDIM + 2 IP = -1 IF( CURSL .AND. .NOT.LST2SL ) $ INFO = N + 2 ELSE * * First eigenvalue of conjugate pair * IP = 1 END IF END IF LST2SL = LASTSL LASTSL = CURSL 30 CONTINUE END IF * WORK( 1 ) = MAXWRK RETURN * * End of DGEESX * END octave-1.1.0/libcruft/lapack/dgeev.f100666 415 17 33112 5306544261 15472 0ustar jweusers SUBROUTINE DGEEV( JOBVL, JOBVR, N, A, LDA, WR, WI, VL, LDVL, VR, $ LDVR, WORK, LWORK, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER JOBVL, JOBVR INTEGER INFO, LDA, LDVL, LDVR, LWORK, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), VL( LDVL, * ), VR( LDVR, * ), $ WI( * ), WORK( * ), WR( * ) * .. * * Purpose * ======= * * DGEEV computes for an n-by-n real nonsymmetric matrix A, the * eigenvalues and, optionally, the left and/or right eigenvectors. * * The left eigenvectors of A are the same as the right eigenvectors of * A**T. If u(j) and v(j) are the left and right eigenvectors, * respectively, corresponding to the eigenvalue lambda(j), then * (u(j)**T)*A = lambda(j)*(u(j)**T) and A*v(j) = lambda(j) * v(j). * * The computed eigenvectors are normalized to have Euclidean norm * equal to 1 and largest component real. * * Arguments * ========= * * JOBVL (input) CHARACTER*1 * = 'N': left eigenvectors of A are not computed; * = 'V': left eigenvectors of A are computed. * * JOBVR (input) CHARACTER*1 * = 'N': right eigenvectors of A are not computed; * = 'V': right eigenvectors of A are computed. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the n-by-n matrix A. * On exit, A has been overwritten. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * WR (output) DOUBLE PRECISION array, dimension (N) * WI (output) DOUBLE PRECISION array, dimension (N) * WR and WI contain the real and imaginary parts, * respectively, of the computed eigenvalues. Complex * conjugate pairs of eigenvalues appear consecutively * with the eigenvalue having the positive imaginary part * first. * * VL (output) DOUBLE PRECISION array, dimension (LDVL,N) * If JOBVL = 'V', the left eigenvectors u(j) are stored one * after another in the columns of VL, in the same order * as their eigenvalues. * If JOBVL = 'N', VL is not referenced. * If the j-th eigenvalue is real, then u(j) = VL(:,j), * the j-th column of VL. * If the j-th and (j+1)-st eigenvalues form a complex * conjugate pair, then u(j) = VL(:,j) + i*VL(:,j+1) and * u(j+1) = VL(:,j) = i*VL(:,j+1). * * LDVL (input) INTEGER * The leading dimension of the array VL. LDVL >= 1, and if * JOBVL = 'V', LDVL >= N. * * VR (output) DOUBLE PRECISION array, dimension (LDVR,N) * If JOBVR = 'V', the right eigenvectors v(j) are stored one * after another in the columns of VR, in the same order * as their eigenvalues. * If JOBVR = 'N', VR is not referenced. * If the j-th eigenvalue is real, then v(j) = VR(:,j), * the j-th column of VR. * If the j-th and (j+1)-st eigenvalues form a complex * conjugate pair, then v(j) = VR(:,j) + i*VR(:,j+1) and * v(j+1) = VR(:,j) = i*VR(:,j+1). * * LDVR (input) INTEGER * The leading dimension of the array VR. LDVR >= 1, and if * JOBVR = 'V', LDVR >= N. * * WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) contains the optimal LWORK. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,3*N), and * if JOBVL = 'V' or JOBVR = 'V', LWORK >= 4*N. For good * performance, LWORK must generally be larger. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * > 0: if INFO = i, the QR algorithm failed to compute all the * eigenvalues, and no eigenvectors have been computed; * elements i+1:N of WR and WI contain eigenvalues which * have converged. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL SCALEA, WANTVL, WANTVR CHARACTER SIDE INTEGER HSWORK, I, IBAL, IERR, IHI, ILO, ITAU, IWRK, K, $ MAXB, MAXWRK, MINWRK, NOUT DOUBLE PRECISION ANRM, BIGNUM, CS, CSCALE, EPS, R, SCL, SMLNUM, $ SN * .. * .. Local Arrays .. LOGICAL SELECT( 1 ) DOUBLE PRECISION DUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DGEBAK, DGEBAL, DGEHRD, DHSEQR, DLABAD, DLACPY, $ DLARTG, DLASCL, DORGHR, DROT, DSCAL, DTREVC, $ XERBLA * .. * .. External Functions .. LOGICAL LSAME INTEGER IDAMAX, ILAENV DOUBLE PRECISION DLAMCH, DLANGE, DLAPY2, DNRM2 EXTERNAL LSAME, IDAMAX, ILAENV, DLAMCH, DLANGE, DLAPY2, $ DNRM2 * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTVL = LSAME( JOBVL, 'V' ) WANTVR = LSAME( JOBVR, 'V' ) IF( ( .NOT.WANTVL ) .AND. ( .NOT.LSAME( JOBVL, 'N' ) ) ) THEN INFO = -1 ELSE IF( ( .NOT.WANTVR ) .AND. ( .NOT.LSAME( JOBVR, 'N' ) ) ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LDVL.LT.1 .OR. ( WANTVL .AND. LDVL.LT.N ) ) THEN INFO = -9 ELSE IF( LDVR.LT.1 .OR. ( WANTVR .AND. LDVR.LT.N ) ) THEN INFO = -11 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * NB refers to the optimal block size for the immediately * following subroutine, as returned by ILAENV. * HSWORK refers to the workspace preferred by DHSEQR, as * calculated below. HSWORK is computed assuming ILO=1 and IHI=N, * the worst case.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = 2*N + N*ILAENV( 1, 'DGEHRD', ' ', N, 1, N, 0 ) IF( ( .NOT.WANTVL ) .AND. ( .NOT.WANTVR ) ) THEN MINWRK = MAX( 1, 3*N ) MAXB = MAX( ILAENV( 8, 'DHSEQR', 'EN', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'DHSEQR', 'EN', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, N+1, N+HSWORK ) ELSE MINWRK = MAX( 1, 4*N ) MAXWRK = MAX( MAXWRK, 2*N+( N-1 )* $ ILAENV( 1, 'DORGHR', ' ', N, 1, N, -1 ) ) MAXB = MAX( ILAENV( 8, 'DHSEQR', 'SV', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'DHSEQR', 'SV', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, N+1, N+HSWORK ) MAXWRK = MAX( MAXWRK, 4*N ) END IF WORK( 1 ) = MAXWRK END IF IF( LWORK.LT.MINWRK ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEEV ', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SQRT( SMLNUM ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = DLANGE( 'M', N, N, A, LDA, DUM ) SCALEA = .FALSE. IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN SCALEA = .TRUE. CSCALE = SMLNUM ELSE IF( ANRM.GT.BIGNUM ) THEN SCALEA = .TRUE. CSCALE = BIGNUM END IF IF( SCALEA ) $ CALL DLASCL( 'G', 0, 0, ANRM, CSCALE, N, N, A, LDA, IERR ) * * Balance the matrix * (Workspace: need N) * IBAL = 1 CALL DGEBAL( 'B', N, A, LDA, ILO, IHI, WORK( IBAL ), IERR ) * * Reduce to upper Hessenberg form * (Workspace: need 3*N, prefer 2*N+N*NB) * ITAU = IBAL + N IWRK = ITAU + N CALL DGEHRD( N, ILO, IHI, A, LDA, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * IF( WANTVL ) THEN * * Want left eigenvectors * Copy Householder vectors to VL * SIDE = 'L' CALL DLACPY( 'L', N, N, A, LDA, VL, LDVL ) * * Generate orthogonal matrix in VL * (Workspace: need 3*N-1, prefer 2*N+(N-1)*NB) * CALL DORGHR( N, ILO, IHI, VL, LDVL, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * * Perform QR iteration, accumulating Schur vectors in VL * (Workspace: need N+1, prefer N+HSWORK (see comments) ) * IWRK = ITAU CALL DHSEQR( 'S', 'V', N, ILO, IHI, A, LDA, WR, WI, VL, LDVL, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) * IF( WANTVR ) THEN * * Want left and right eigenvectors * Copy Schur vectors to VR * SIDE = 'B' CALL DLACPY( 'F', N, N, VL, LDVL, VR, LDVR ) END IF * ELSE IF( WANTVR ) THEN * * Want right eigenvectors * Copy Householder vectors to VR * SIDE = 'R' CALL DLACPY( 'L', N, N, A, LDA, VR, LDVR ) * * Generate orthogonal matrix in VR * (Workspace: need 3*N-1, prefer 2*N+(N-1)*NB) * CALL DORGHR( N, ILO, IHI, VR, LDVR, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * * Perform QR iteration, accumulating Schur vectors in VR * (Workspace: need N+1, prefer N+HSWORK (see comments) ) * IWRK = ITAU CALL DHSEQR( 'S', 'V', N, ILO, IHI, A, LDA, WR, WI, VR, LDVR, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) * ELSE * * Compute eigenvalues only * (Workspace: need N+1, prefer N+HSWORK (see comments) ) * IWRK = ITAU CALL DHSEQR( 'E', 'N', N, ILO, IHI, A, LDA, WR, WI, VR, LDVR, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) END IF * * If INFO > 0 from DHSEQR, then quit * IF( INFO.GT.0 ) $ GO TO 50 * IF( WANTVL .OR. WANTVR ) THEN * * Compute left and/or right eigenvectors * (Workspace: need 4*N) * CALL DTREVC( SIDE, 'O', SELECT, N, A, LDA, VL, LDVL, VR, LDVR, $ N, NOUT, WORK( IWRK ), IERR ) END IF * IF( WANTVL ) THEN * * Undo balancing of left eigenvectors * (Workspace: need N) * CALL DGEBAK( 'B', 'L', N, ILO, IHI, WORK( IBAL ), N, VL, LDVL, $ IERR ) * * Normalize left eigenvectors and make largest component real * DO 20 I = 1, N IF( WI( I ).EQ.ZERO ) THEN SCL = ONE / DNRM2( N, VL( 1, I ), 1 ) CALL DSCAL( N, SCL, VL( 1, I ), 1 ) ELSE IF( WI( I ).GT.ZERO ) THEN SCL = ONE / DLAPY2( DNRM2( N, VL( 1, I ), 1 ), $ DNRM2( N, VL( 1, I+1 ), 1 ) ) CALL DSCAL( N, SCL, VL( 1, I ), 1 ) CALL DSCAL( N, SCL, VL( 1, I+1 ), 1 ) DO 10 K = 1, N WORK( IWRK+K-1 ) = VL( K, I )**2 + VL( K, I+1 )**2 10 CONTINUE K = IDAMAX( N, WORK( IWRK ), 1 ) CALL DLARTG( VL( K, I ), VL( K, I+1 ), CS, SN, R ) CALL DROT( N, VL( 1, I ), 1, VL( 1, I+1 ), 1, CS, SN ) VL( K, I+1 ) = ZERO END IF 20 CONTINUE END IF * IF( WANTVR ) THEN * * Undo balancing of right eigenvectors * (Workspace: need N) * CALL DGEBAK( 'B', 'R', N, ILO, IHI, WORK( IBAL ), N, VR, LDVR, $ IERR ) * * Normalize right eigenvectors and make largest component real * DO 40 I = 1, N IF( WI( I ).EQ.ZERO ) THEN SCL = ONE / DNRM2( N, VR( 1, I ), 1 ) CALL DSCAL( N, SCL, VR( 1, I ), 1 ) ELSE IF( WI( I ).GT.ZERO ) THEN SCL = ONE / DLAPY2( DNRM2( N, VR( 1, I ), 1 ), $ DNRM2( N, VR( 1, I+1 ), 1 ) ) CALL DSCAL( N, SCL, VR( 1, I ), 1 ) CALL DSCAL( N, SCL, VR( 1, I+1 ), 1 ) DO 30 K = 1, N WORK( IWRK+K-1 ) = VR( K, I )**2 + VR( K, I+1 )**2 30 CONTINUE K = IDAMAX( N, WORK( IWRK ), 1 ) CALL DLARTG( VR( K, I ), VR( K, I+1 ), CS, SN, R ) CALL DROT( N, VR( 1, I ), 1, VR( 1, I+1 ), 1, CS, SN ) VR( K, I+1 ) = ZERO END IF 40 CONTINUE END IF * * Undo scaling if necessary * 50 CONTINUE IF( SCALEA ) THEN CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, N-INFO, 1, WR( INFO+1 ), $ MAX( N-INFO, 1 ), IERR ) CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, N-INFO, 1, WI( INFO+1 ), $ MAX( N-INFO, 1 ), IERR ) IF( INFO.GT.0 ) THEN CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, ILO-1, 1, WR, N, $ IERR ) CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, ILO-1, 1, WI, N, $ IERR ) END IF END IF * WORK( 1 ) = MAXWRK RETURN * * End of DGEEV * END octave-1.1.0/libcruft/lapack/dgehd2.f100666 415 17 11233 5306544264 15540 0ustar jweusers SUBROUTINE DGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DGEHD2 reduces a real general matrix A to upper Hessenberg form H by * an orthogonal similarity transformation: Q' * A * Q = H . * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that A is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to DGEBAL; otherwise they should be * set to 1 and N respectively. See Further Details. * 1 <= ILO <= IHI <= max(1,N). * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the n by n general matrix to be reduced. * On exit, the upper triangle and the first subdiagonal of A * are overwritten with the upper Hessenberg matrix H, and the * elements below the first subdiagonal, with the array TAU, * represent the orthogonal matrix Q as a product of elementary * reflectors. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) DOUBLE PRECISION array, dimension (N-1) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrix Q is represented as a product of (ihi-ilo) elementary * reflectors * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on * exit in A(i+2:ihi,i), and tau in TAU(i). * * The contents of A are illustrated by the following example, with * n = 7, ilo = 2 and ihi = 6: * * on entry on exit * * ( a a a a a a a ) ( a a h h h h a ) * ( a a a a a a ) ( a h h h h a ) * ( a a a a a a ) ( h h h h h h ) * ( a a a a a a ) ( v2 h h h h h ) * ( a a a a a a ) ( v2 v3 h h h h ) * ( a a a a a a ) ( v2 v3 v4 h h h ) * ( a ) ( a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I DOUBLE PRECISION AII * .. * .. External Subroutines .. EXTERNAL DLARF, DLARFG, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEHD2', -INFO ) RETURN END IF * DO 10 I = ILO, IHI - 1 * * Compute elementary reflector H(i) to annihilate A(i+2:ihi,i) * CALL DLARFG( IHI-I, A( I+1, I ), A( MIN( I+2, N ), I ), 1, $ TAU( I ) ) AII = A( I+1, I ) A( I+1, I ) = ONE * * Apply H(i) to A(1:ihi,i+1:ihi) from the right * CALL DLARF( 'Right', IHI, IHI-I, A( I+1, I ), 1, TAU( I ), $ A( 1, I+1 ), LDA, WORK ) * * Apply H(i) to A(i+1:ihi,i+1:n) from the left * CALL DLARF( 'Left', IHI-I, N-I, A( I+1, I ), 1, TAU( I ), $ A( I+1, I+1 ), LDA, WORK ) * A( I+1, I ) = AII 10 CONTINUE * RETURN * * End of DGEHD2 * END octave-1.1.0/libcruft/lapack/dgehrd.f100666 415 17 17161 5306544263 15645 0ustar jweusers SUBROUTINE DGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, LWORK, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DGEHRD reduces a real general matrix A to upper Hessenberg form H by * an orthogonal similarity transformation: Q' * A * Q = H . * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that A is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to DGEBAL; otherwise they should be * set to 1 and N respectively. See Further Details. If N > 0, * 1 <= ILO <= IHI <= N; otherwise set ILO = 1, IHI = N. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the n by n general matrix to be reduced. * On exit, the upper triangle and the first subdiagonal of A * are overwritten with the upper Hessenberg matrix H, and the * elements below the first subdiagonal, with the array TAU, * represent the orthogonal matrix Q as a product of elementary * reflectors. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) DOUBLE PRECISION array, dimension (N-1) * The scalar factors of the elementary reflectors (see Further * Details). Elements 1:ILO-1 and IHI:N-1 of TAU are set to * zero. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimum blocksize. * * LWORK (input) INTEGER * The length of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrix Q is represented as a product of (ihi-ilo) elementary * reflectors * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on * exit in A(i+2:ihi,i), and tau in TAU(i). * * The contents of A are illustrated by the following example, with * n = 7, ilo = 2 and ihi = 6: * * on entry on exit * * ( a a a a a a a ) ( a a h h h h a ) * ( a a a a a a ) ( a h h h h a ) * ( a a a a a a ) ( h h h h h h ) * ( a a a a a a ) ( v2 h h h h h ) * ( a a a a a a ) ( v2 v3 h h h h ) * ( a a a a a a ) ( v2 v3 v4 h h h ) * ( a ) ( a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, LDWORK, NB, NBMIN, NH, NX DOUBLE PRECISION EI * .. * .. Local Arrays .. DOUBLE PRECISION T( LDT, NBMAX ) * .. * .. External Subroutines .. EXTERNAL DGEHD2, DGEMM, DLAHRD, DLARFB, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEHRD', -INFO ) RETURN END IF * * Set elements 1:ILO-1 and IHI:N-1 of TAU to zero * DO 10 I = 1, ILO - 1 TAU( I ) = ZERO 10 CONTINUE DO 20 I = MAX( 1, IHI ), N - 1 TAU( I ) = ZERO 20 CONTINUE * * Quick return if possible * NH = IHI - ILO + 1 IF( NH.LE.1 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = MIN( NBMAX, ILAENV( 1, 'DGEHRD', ' ', N, ILO, IHI, -1 ) ) NBMIN = 2 IWS = 1 IF( NB.GT.1 .AND. NB.LT.NH ) THEN * * Determine when to cross over from blocked to unblocked code * (last block is always handled by unblocked code). * NX = MAX( NB, ILAENV( 3, 'DGEHRD', ' ', N, ILO, IHI, -1 ) ) IF( NX.LT.NH ) THEN * * Determine if workspace is large enough for blocked code. * IWS = N*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: determine the * minimum value of NB, and reduce NB or force use of * unblocked code. * NBMIN = MAX( 2, ILAENV( 2, 'DGEHRD', ' ', N, ILO, IHI, $ -1 ) ) IF( LWORK.GE.N*NBMIN ) THEN NB = LWORK / N ELSE NB = 1 END IF END IF END IF END IF LDWORK = N * IF( NB.LT.NBMIN .OR. NB.GE.NH ) THEN * * Use unblocked code below * I = ILO * ELSE * * Use blocked code * DO 30 I = ILO, IHI - 1 - NX, NB IB = MIN( NB, IHI-I ) * * Reduce columns i:i+ib-1 to Hessenberg form, returning the * matrices V and T of the block reflector H = I - V*T*V' * which performs the reduction, and also the matrix Y = A*V*T * CALL DLAHRD( IHI, I, IB, A( 1, I ), LDA, TAU( I ), T, LDT, $ WORK, LDWORK ) * * Apply the block reflector H to A(1:ihi,i+ib:ihi) from the * right, computing A := A - Y * V'. V(i+ib,ib-1) must be set * to 1. * EI = A( I+IB, I+IB-1 ) A( I+IB, I+IB-1 ) = ONE CALL DGEMM( 'No transpose', 'Transpose', IHI, IHI-I-IB+1, $ IB, -ONE, WORK, LDWORK, A( I+IB, I ), LDA, ONE, $ A( 1, I+IB ), LDA ) A( I+IB, I+IB-1 ) = EI * * Apply the block reflector H to A(i+1:ihi,i+ib:n) from the * left * CALL DLARFB( 'Left', 'Transpose', 'Forward', 'Columnwise', $ IHI-I, N-I-IB+1, IB, A( I+1, I ), LDA, T, LDT, $ A( I+1, I+IB ), LDA, WORK, LDWORK ) 30 CONTINUE END IF * * Use unblocked code to reduce the rest of the matrix * CALL DGEHD2( N, I, IHI, A, LDA, TAU, WORK, IINFO ) WORK( 1 ) = IWS * RETURN * * End of DGEHRD * END octave-1.1.0/libcruft/lapack/dgelq2.f100666 415 17 6512 5306544267 15550 0ustar jweusers SUBROUTINE DGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DGELQ2 computes an LQ factorization of a real m by n matrix A: * A = L * Q. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and below the diagonal of the array * contain the m by min(m,n) lower trapezoidal matrix L (L is * lower triangular if m <= n); the elements above the diagonal, * with the array TAU, represent the orthogonal matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) DOUBLE PRECISION array, dimension (M) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(k) . . . H(2) H(1), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), * and tau in TAU(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, K DOUBLE PRECISION AII * .. * .. External Subroutines .. EXTERNAL DLARF, DLARFG, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGELQ2', -INFO ) RETURN END IF * K = MIN( M, N ) * DO 10 I = 1, K * * Generate elementary reflector H(i) to annihilate A(i,i+1:n) * CALL DLARFG( N-I+1, A( I, I ), A( I, MIN( I+1, N ) ), LDA, $ TAU( I ) ) IF( I.LT.M ) THEN * * Apply H(i) to A(i+1:m,i:n) from the right * AII = A( I, I ) A( I, I ) = ONE CALL DLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, TAU( I ), $ A( I+1, I ), LDA, WORK ) A( I, I ) = AII END IF 10 CONTINUE RETURN * * End of DGELQ2 * END octave-1.1.0/libcruft/lapack/dgelqf.f100666 415 17 12525 5306544266 15654 0ustar jweusers SUBROUTINE DGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DGELQF computes an LQ factorization of a real m by n matrix A: * A = L * Q. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and below the diagonal of the array * contain the m by min(m,n) lower trapezoidal matrix L (L is * lower triangular if m <= n); the elements above the diagonal, * with the array TAU, represent the orthogonal matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,M). * For optimum performance LWORK should be at least M*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(k) . . . H(2) H(1), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:n) is stored on exit in A(i,i+1:n), * and tau in TAU(i). * * ===================================================================== * * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, K, LDWORK, NB, NBMIN, NX * .. * .. External Subroutines .. EXTERNAL DGELQ2, DLARFB, DLARFT, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, M ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGELQF', -INFO ) RETURN END IF * * Quick return if possible * K = MIN( M, N ) IF( K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) NBMIN = 2 NX = 0 IWS = M IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'DGELQF', ' ', M, N, -1, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = M IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DGELQF', ' ', M, N, -1, $ -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code initially * DO 10 I = 1, K - NX, NB IB = MIN( K-I+1, NB ) * * Compute the LQ factorization of the current block * A(i:i+ib-1,i:n) * CALL DGELQ2( IB, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) IF( I+IB.LE.M ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ), $ LDA, TAU( I ), WORK, LDWORK ) * * Apply H to A(i+ib:m,i:n) from the right * CALL DLARFB( 'Right', 'No transpose', 'Forward', $ 'Rowwise', M-I-IB+1, N-I+1, IB, A( I, I ), $ LDA, WORK, LDWORK, A( I+IB, I ), LDA, $ WORK( IB+1 ), LDWORK ) END IF 10 CONTINUE ELSE I = 1 END IF * * Use unblocked code to factor the last or only block. * IF( I.LE.K ) $ CALL DGELQ2( M-I+1, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * WORK( 1 ) = IWS RETURN * * End of DGELQF * END octave-1.1.0/libcruft/lapack/dgelss.f100666 415 17 51254 5406730200 15657 0ustar jweusers SUBROUTINE DGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, $ WORK, LWORK, INFO ) * * -- LAPACK driver routine (version 1.0) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK DOUBLE PRECISION RCOND * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ), S( * ), WORK( * ) * .. * * Purpose * ======= * * DGELSS uses the singular value decomposition of A to solve the least * squares problem of finding X to minimize the Euclidean norm of each * column of A*X-B, where A is M by N, and X and B are N by NRHS. * If M is greater than or equal to N the problem is overdetermined, and * if M is less than N the problem is underdetermined; in this case a * minimum norm solution is returned. The solution X overwrites B. * * The singular values of A smaller than RCOND times the largest * singular value are treated as zero in solving the least squares * problem; in this case a minimum norm solution is returned. * The actual singular values are returned in S in decreasing order. * * Arguments * ========= * * M (input) INTEGER * The number of rows of A. M must be at least 0. * * N (input) INTEGER * The number of columns of A. N must be at least 0. * * NRHS (input) INTEGER * The number of columns of B and X. NRHS must be at least 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On input, the matrix specifying the least squares problem. * On output, A has been overwritten with its right singular * vectors. * * LDA (input) INTEGER * The leading dimension of A in the calling subprogram. * LDA must be at least max(1,M). * * B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS) * On input, B contains the right hand sides of the least * squares problem in rows 1 through M. On output, B contains * the solution X in rows 1 through N. * * LDB (input) INTEGER * The leading dimension of B in the calling subprogram. * LDB must be at least max(1,MAX( M, N ) ). * * S (output) DOUBLE PRECISION array, dimension (min(M,N)) * On output, contains the singular values of A in decreasing * order. * * RCOND (input) DOUBLE PRECISION * The singular values of A less than or equal to RCOND times * the largest singular value are treated as zero in solving * the least squares problem. If RCOND is negative, * machine precision is used instead. * For example, if diag(S)*X=B were the least squares problem, * where diag(S) is a diagonal matrix of singular values, the * solution would be X(i) = B(i) / S(i) if S(i) is greater than * RCOND*max(S), and X(i) = 0 if S(i) is less than or equal to * RCOND*max(S). * * RANK (output) INTEGER * The number of singular values of A greater than RCOND times * the largest singular value. * * WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK) * On exit, WORK(1) contains the optimal workspace size LWORK * for high performance. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK must be at least 1. * The exact minimum amount of workspace needed depends on M, * N and NRHS. As long as LWORK is at least * 3*N+MAX(2*N,NRHS,M) if M is greater than or equal to N * 3*M+MAX(2*M,NRHS,N) otherwise * the code will execute correctly. * For good performance, LWORK should generally be larger. * The optimum value of LWORK for high performance is * returned in WORK(1). * * INFO (output) INTEGER * 0 - successful exit * <0 - if INFO = -i, the i-th argument had an illegal value. * >0 - if DBDSQR did not converge, INFO specifies how many * superdiagonals of an intermediate bidiagonal form * did not converge to zero. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. INTEGER BL, CHUNK, I, IASCL, IBSCL, IE, IL, ITAU, $ ITAUP, ITAUQ, IWORK, LDWORK, MAXMN, MAXWRK, $ MINMN, MINWRK, MM, MNTHR DOUBLE PRECISION ANRM, BIGNUM, BNRM, EPS, SFMIN, SMLNUM, THR * .. * .. Local Arrays .. DOUBLE PRECISION VDUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DBDSQR, DCOPY, DGEBRD, DGELQF, DGEMM, DGEMV, $ DGEQRF, DLABAD, DLACPY, DLASCL, DLASET, DORGBR, $ DORMBR, DORMLQ, DORMQR, DRSCL, XERBLA * .. * .. External Functions .. INTEGER ILAENV DOUBLE PRECISION DLAMCH, DLANGE EXTERNAL ILAENV, DLAMCH, DLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 MINMN = MIN( M, N ) MAXMN = MAX( M, N ) MNTHR = ILAENV( 6, 'DGELSS', ' ', M, N, NRHS, -1 ) IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NRHS.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LDB.LT.MAX( 1, MAXMN ) ) THEN INFO = -7 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * NB refers to the optimal block size for the immediately * following subroutine, as returned by ILAENV.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = 0 MM = M IF( M.GE.N .AND. M.GE.MNTHR ) THEN * * Path 1a - overdetermined, with many more rows than columns * MM = N MAXWRK = MAX( MAXWRK, N+N*ILAENV( 1, 'DGEQRF', ' ', M, N, $ -1, -1 ) ) MAXWRK = MAX( MAXWRK, N+NRHS* $ ILAENV( 1, 'DORMQR', 'LT', M, NRHS, N, -1 ) ) END IF IF( M.GE.N ) THEN * * Path 1 - overdetermined or exactly determined * MAXWRK = MAX( MAXWRK, 3*N+( MM+N )* $ ILAENV( 1, 'DGEBRD', ' ', MM, N, -1, -1 ) ) MAXWRK = MAX( MAXWRK, 3*N+NRHS* $ ILAENV( 1, 'DORMBR', 'QLT', MM, NRHS, N, -1 ) ) MAXWRK = MAX( MAXWRK, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) MAXWRK = MAX( MAXWRK, 5*N-4 ) MAXWRK = MAX( MAXWRK, N*NRHS ) MINWRK = MAX( 3*N+MM, 3*N+NRHS, 5*N-4 ) END IF IF( N.GT.M ) THEN MINWRK = MAX( 3*M+NRHS, 3*M+N, 5*M-4 ) IF( N.GE.MNTHR ) THEN * * Path 2a - underdetermined, with many more columns * than rows * MAXWRK = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) MAXWRK = MAX( MAXWRK, M*M+4*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) MAXWRK = MAX( MAXWRK, M*M+4*M+NRHS* $ ILAENV( 1, 'DORMBR', 'QLT', M, NRHS, M, -1 ) ) MAXWRK = MAX( MAXWRK, M*M+4*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) MAXWRK = MAX( MAXWRK, M*M+6*M-4 ) IF( NRHS.GT.1 ) THEN MAXWRK = MAX( MAXWRK, M*M+M+M*NRHS ) ELSE MAXWRK = MAX( MAXWRK, M*M+2*M ) END IF MAXWRK = MAX( MAXWRK, M+NRHS* $ ILAENV( 1, 'DORMLQ', 'LT', N, NRHS, M, -1 ) ) ELSE * * Path 2 - underdetermined * MAXWRK = 3*M + ( N+M )*ILAENV( 1, 'DGEBRD', ' ', M, N, $ -1, -1 ) MAXWRK = MAX( MAXWRK, 3*M+NRHS* $ ILAENV( 1, 'DORMBR', 'QLT', M, NRHS, M, -1 ) ) MAXWRK = MAX( MAXWRK, 3*M+M* $ ILAENV( 1, 'DORGBR', 'P', M, N, M, -1 ) ) MAXWRK = MAX( MAXWRK, 5*M-4 ) MAXWRK = MAX( MAXWRK, N*NRHS ) END IF END IF MINWRK = MIN( MINWRK, MAXWRK ) WORK( 1 ) = MAXWRK END IF * MINWRK = MAX( MINWRK, 1 ) IF( LWORK.LT.MINWRK ) $ INFO = -12 IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGELSS', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN RANK = 0 RETURN END IF * * Get machine parameters * EPS = DLAMCH( 'P' ) SFMIN = DLAMCH( 'S' ) SMLNUM = SFMIN / EPS BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = DLANGE( 'M', M, N, A, LDA, WORK ) IASCL = 0 IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN * * Scale matrix norm up to SMLNUM * CALL DLASCL( 'G', 0, 0, ANRM, SMLNUM, M, N, A, LDA, INFO ) IASCL = 1 ELSE IF( ANRM.GT.BIGNUM ) THEN * * Scale matrix norm down to BIGNUM * CALL DLASCL( 'G', 0, 0, ANRM, BIGNUM, M, N, A, LDA, INFO ) IASCL = 2 ELSE IF( ANRM.EQ.ZERO ) THEN * * Matrix all zero. Return zero solution. * CALL DLASET( 'F', MAX( M, N ), NRHS, ZERO, ZERO, B, LDB ) CALL DLASET( 'F', MINMN, 1, ZERO, ZERO, S, 1 ) RANK = 0 GO TO 70 END IF * * Scale B if max entry outside range [SMLNUM,BIGNUM] * BNRM = DLANGE( 'M', M, NRHS, B, LDB, WORK ) IBSCL = 0 IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN * * Scale matrix norm up to SMLNUM * CALL DLASCL( 'G', 0, 0, BNRM, SMLNUM, M, NRHS, B, LDB, INFO ) IBSCL = 1 ELSE IF( BNRM.GT.BIGNUM ) THEN * * Scale matrix norm down to BIGNUM * CALL DLASCL( 'G', 0, 0, BNRM, BIGNUM, M, NRHS, B, LDB, INFO ) IBSCL = 2 END IF * * Overdetermined case * IF( M.GE.N ) THEN * * Path 1 - overdetermined or exactly determined * MM = M IF( M.GE.MNTHR ) THEN * * Path 1a - overdetermined, with many more rows than columns * MM = N ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Multiply B by transpose(Q) * (Workspace: need N+NRHS, prefer N+NRHS*NB) * CALL DORMQR( 'L', 'T', M, NRHS, N, A, LDA, WORK( ITAU ), B, $ LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Zero out below R * IF( N.GT.1 ) $ CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), LDA ) END IF * IE = 1 ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in A * (Workspace: need 3*N+MM, prefer 3*N+(MM+N)*NB) * CALL DGEBRD( MM, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) * * Multiply B by transpose of left bidiagonalizing vectors of R * (Workspace: need 3*N+NRHS, prefer 3*N+NRHS*NB) * CALL DORMBR( 'Q', 'L', 'T', MM, NRHS, N, A, LDA, WORK( ITAUQ ), $ B, LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors of R in A * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration * multiply B by transpose of left singular vectors * compute right singular vectors in A * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, 0, NRHS, S, WORK( IE ), A, LDA, VDUM, $ 1, B, LDB, WORK( IWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 10 I = 1, N IF( S( I ).GT.THR ) THEN CALL DRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL DLASET( 'F', 1, NRHS, ZERO, ZERO, B( I, 1 ), LDB ) END IF 10 CONTINUE * * Multiply B by right singular vectors * (Workspace: need N, prefer N*NRHS) * IF( LWORK.GE.LDB*NRHS .AND. NRHS.GT.1 ) THEN CALL DGEMM( 'T', 'N', N, NRHS, N, ONE, A, LDA, B, LDB, ZERO, $ WORK, LDB ) CALL DLACPY( 'G', N, NRHS, WORK, LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = LWORK / N DO 20 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL DGEMM( 'T', 'N', N, BL, N, ONE, A, LDA, B, LDB, $ ZERO, WORK, N ) CALL DLACPY( 'G', N, BL, WORK, N, B, LDB ) 20 CONTINUE ELSE CALL DGEMV( 'T', N, N, ONE, A, LDA, B, 1, ZERO, WORK, 1 ) CALL DCOPY( N, WORK, 1, B, 1 ) END IF * ELSE IF( N.GE.MNTHR .AND. LWORK.GE.4*M+M*M+ $ MAX( M, 2*M-4, NRHS, N-3*M ) ) THEN * * Path 2a - underdetermined, with many more columns than rows * and sufficient workspace for an efficient algorithm * LDWORK = M IF( LWORK.GE.MAX( 4*M+M*LDA+MAX( M, 2*M-4, NRHS, N-3*M ), $ M*LDA+M+M*NRHS ) )LDWORK = LDA ITAU = 1 IWORK = M + 1 * * Compute A=L*Q * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IL = IWORK * * Copy L to WORK(IL), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IL ), LDWORK ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, WORK( IL+LDWORK ), $ LDWORK ) IE = IL + LDWORK*M ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IL) * (Workspace: need M*M+5*M, prefer M*M+4*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IL ), LDWORK, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Multiply B by transpose of left bidiagonalizing vectors of L * (Workspace: need M*M+4*M+NRHS, prefer M*M+4*M+NRHS*NB) * CALL DORMBR( 'Q', 'L', 'T', M, NRHS, M, WORK( IL ), LDWORK, $ WORK( ITAUQ ), B, LDB, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors of R in WORK(IL) * (Workspace: need M*M+5*M-1, prefer M*M+4*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IL ), LDWORK, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, * computing right singular vectors of L in WORK(IL) and * multiplying B by transpose of left singular vectors * (Workspace: need M*M+6*M-4) * CALL DBDSQR( 'U', M, M, 0, NRHS, S, WORK( IE ), WORK( IL ), $ LDWORK, A, LDA, B, LDB, WORK( IWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 30 I = 1, M IF( S( I ).GT.THR ) THEN CALL DRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL DLASET( 'F', 1, NRHS, ZERO, ZERO, B( I, 1 ), LDB ) END IF 30 CONTINUE IWORK = IE * * Multiply B by right singular vectors of L in WORK(IL) * (Workspace: need M*M+2*M, prefer M*M+M+M*NRHS) * IF( LWORK.GE.LDB*NRHS+IWORK-1 .AND. NRHS.GT.1 ) THEN CALL DGEMM( 'T', 'N', M, NRHS, M, ONE, WORK( IL ), LDWORK, $ B, LDB, ZERO, WORK( IWORK ), LDB ) CALL DLACPY( 'G', M, NRHS, WORK( IWORK ), LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = ( LWORK-IWORK+1 ) / M DO 40 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL DGEMM( 'T', 'N', M, BL, M, ONE, WORK( IL ), LDWORK, $ B( 1, I ), LDB, ZERO, WORK( IWORK ), N ) CALL DLACPY( 'G', M, BL, WORK( IWORK ), N, B, LDB ) 40 CONTINUE ELSE CALL DGEMV( 'T', M, M, ONE, WORK( IL ), LDWORK, B( 1, 1 ), $ 1, ZERO, WORK( IWORK ), 1 ) CALL DCOPY( M, WORK( IWORK ), 1, B( 1, 1 ), 1 ) END IF * * Zero out below first M rows of B * CALL DLASET( 'F', N-M, NRHS, ZERO, ZERO, B( M+1, 1 ), LDB ) IWORK = ITAU + M * * Multiply transpose(Q) by B * (Workspace: need M+NRHS, prefer M+NRHS*NB) * CALL DORMLQ( 'L', 'T', N, NRHS, M, A, LDA, WORK( ITAU ), B, $ LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * ELSE * * Path 2 - remaining underdetermined cases * IE = 1 ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (Workspace: need 3*M+N, prefer 3*M+(M+N)*NB) * CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) * * Multiply B by transpose of left bidiagonalizing vectors * (Workspace: need 3*M+NRHS, prefer 3*M+NRHS*NB) * CALL DORMBR( 'Q', 'L', 'T', M, NRHS, N, A, LDA, WORK( ITAUQ ), $ B, LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in A * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, * computing right singular vectors of A in A and * multiplying B by transpose of left singular vectors * (Workspace: need 5*M-4) * CALL DBDSQR( 'L', M, N, 0, NRHS, S, WORK( IE ), A, LDA, VDUM, $ 1, B, LDB, WORK( IWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 50 I = 1, M IF( S( I ).GT.THR ) THEN CALL DRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL DLASET( 'F', 1, NRHS, ZERO, ZERO, B( I, 1 ), LDB ) END IF 50 CONTINUE * * Multiply B by right singular vectors of A * (Workspace: need N, prefer N*NRHS) * IF( LWORK.GE.LDB*NRHS .AND. NRHS.GT.1 ) THEN CALL DGEMM( 'T', 'N', N, NRHS, M, ONE, A, LDA, B, LDB, ZERO, $ WORK, LDB ) CALL DLACPY( 'F', N, NRHS, WORK, LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = LWORK / N DO 60 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL DGEMM( 'T', 'N', N, BL, M, ONE, A, LDA, B( 1, I ), $ LDB, ZERO, WORK, N ) CALL DLACPY( 'F', N, BL, WORK, N, B( 1, I ), LDB ) 60 CONTINUE ELSE CALL DGEMV( 'T', M, N, ONE, A, LDA, B, 1, ZERO, WORK, 1 ) CALL DCOPY( N, WORK, 1, B, 1 ) END IF END IF * * Undo scaling * IF( IASCL.EQ.1 ) THEN CALL DLASCL( 'G', 0, 0, ANRM, SMLNUM, N, NRHS, B, LDB, INFO ) CALL DLASCL( 'G', 0, 0, SMLNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) ELSE IF( IASCL.EQ.2 ) THEN CALL DLASCL( 'G', 0, 0, ANRM, BIGNUM, N, NRHS, B, LDB, INFO ) CALL DLASCL( 'G', 0, 0, BIGNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) END IF IF( IBSCL.EQ.1 ) THEN CALL DLASCL( 'G', 0, 0, SMLNUM, BNRM, N, NRHS, B, LDB, INFO ) ELSE IF( IBSCL.EQ.2 ) THEN CALL DLASCL( 'G', 0, 0, BIGNUM, BNRM, N, NRHS, B, LDB, INFO ) END IF * 70 CONTINUE WORK( 1 ) = MAXWRK RETURN * * End of DGELSS * END octave-1.1.0/libcruft/lapack/dgeqpf.f100666 415 17 14674 5613564610 15663 0ustar jweusers SUBROUTINE DGEQPF( M, N, A, LDA, JPVT, TAU, WORK, INFO ) * * -- LAPACK test routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER JPVT( * ) DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DGEQPF computes a QR factorization with column pivoting of a * real M-by-N matrix A: A*P = Q*R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0 * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the M-by-N matrix A. * On exit, the upper triangle of the array contains the * min(M,N)-by-N upper triangular matrix R; the elements * below the diagonal, together with the array TAU, * represent the orthogonal matrix Q as a product of * min(m,n) elementary reflectors. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * JPVT (input/output) INTEGER array, dimension (N) * On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted * to the front of A*P (a leading column); if JPVT(i) = 0, * the i-th column of A is a free column. * On exit, if JPVT(i) = k, then the i-th column of A*P * was the k-th column of A. * * TAU (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors. * * WORK (workspace) DOUBLE PRECISION array, dimension (3*N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(n) * * Each H(i) has the form * * H = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i). * * The matrix P is represented in jpvt as follows: If * jpvt(j) = i * then the jth column of P is the ith canonical unit vector. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, ITEMP, J, MA, MN, PVT DOUBLE PRECISION AII, TEMP, TEMP2 * .. * .. External Subroutines .. EXTERNAL DGEQR2, DLARF, DLARFG, DORM2R, DSWAP, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. External Functions .. INTEGER IDAMAX DOUBLE PRECISION DNRM2 EXTERNAL IDAMAX, DNRM2 * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEQPF', -INFO ) RETURN END IF * MN = MIN( M, N ) * * Move initial columns up front * ITEMP = 1 DO 10 I = 1, N IF( JPVT( I ).NE.0 ) THEN IF( I.NE.ITEMP ) THEN CALL DSWAP( M, A( 1, I ), 1, A( 1, ITEMP ), 1 ) JPVT( I ) = JPVT( ITEMP ) JPVT( ITEMP ) = I ELSE JPVT( I ) = I END IF ITEMP = ITEMP + 1 ELSE JPVT( I ) = I END IF 10 CONTINUE ITEMP = ITEMP - 1 * * Compute the QR factorization and update remaining columns * IF( ITEMP.GT.0 ) THEN MA = MIN( ITEMP, M ) CALL DGEQR2( M, MA, A, LDA, TAU, WORK, INFO ) IF( MA.LT.N ) THEN CALL DORM2R( 'Left', 'Transpose', M, N-MA, MA, A, LDA, TAU, $ A( 1, MA+1 ), LDA, WORK, INFO ) END IF END IF * IF( ITEMP.LT.MN ) THEN * * Initialize partial column norms. The first n entries of * work store the exact column norms. * DO 20 I = ITEMP + 1, N WORK( I ) = DNRM2( M-ITEMP, A( ITEMP+1, I ), 1 ) WORK( N+I ) = WORK( I ) 20 CONTINUE * * Compute factorization * DO 40 I = ITEMP + 1, MN * * Determine ith pivot column and swap if necessary * PVT = ( I-1 ) + IDAMAX( N-I+1, WORK( I ), 1 ) * IF( PVT.NE.I ) THEN CALL DSWAP( M, A( 1, PVT ), 1, A( 1, I ), 1 ) ITEMP = JPVT( PVT ) JPVT( PVT ) = JPVT( I ) JPVT( I ) = ITEMP WORK( PVT ) = WORK( I ) WORK( N+PVT ) = WORK( N+I ) END IF * * Generate elementary reflector H(i) * IF( I.LT.M ) THEN CALL DLARFG( M-I+1, A( I, I ), A( I+1, I ), 1, TAU( I ) ) ELSE CALL DLARFG( 1, A( M, M ), A( M, M ), 1, TAU( M ) ) END IF * IF( I.LT.N ) THEN * * Apply H(i) to A(i:m,i+1:n) from the left * AII = A( I, I ) A( I, I ) = ONE CALL DLARF( 'LEFT', M-I+1, N-I, A( I, I ), 1, TAU( I ), $ A( I, I+1 ), LDA, WORK( 2*N+1 ) ) A( I, I ) = AII END IF * * Update partial column norms * DO 30 J = I + 1, N IF( WORK( J ).NE.ZERO ) THEN TEMP = ONE - ( ABS( A( I, J ) ) / WORK( J ) )**2 TEMP = MAX( TEMP, ZERO ) TEMP2 = ONE + 0.05D0*TEMP* $ ( WORK( J ) / WORK( N+J ) )**2 IF( TEMP2.EQ.ONE ) THEN IF( M-I.GT.0 ) THEN WORK( J ) = DNRM2( M-I, A( I+1, J ), 1 ) WORK( N+J ) = WORK( J ) ELSE WORK( J ) = ZERO WORK( N+J ) = ZERO END IF ELSE WORK( J ) = WORK( J )*SQRT( TEMP ) END IF END IF 30 CONTINUE * 40 CONTINUE END IF RETURN * * End of DGEQPF * END octave-1.1.0/libcruft/lapack/dgeqr2.f100666 415 17 6503 5306544271 15551 0ustar jweusers SUBROUTINE DGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DGEQR2 computes a QR factorization of a real m by n matrix A: * A = Q * R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and above the diagonal of the array * contain the min(m,n) by n upper trapezoidal matrix R (R is * upper triangular if m >= n); the elements below the diagonal, * with the array TAU, represent the orthogonal matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(k), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), * and tau in TAU(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, K DOUBLE PRECISION AII * .. * .. External Subroutines .. EXTERNAL DLARF, DLARFG, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEQR2', -INFO ) RETURN END IF * K = MIN( M, N ) * DO 10 I = 1, K * * Generate elementary reflector H(i) to annihilate A(i+1:m,i) * CALL DLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1, $ TAU( I ) ) IF( I.LT.N ) THEN * * Apply H(i) to A(i:m,i+1:n) from the left * AII = A( I, I ) A( I, I ) = ONE CALL DLARF( 'Left', M-I+1, N-I, A( I, I ), 1, TAU( I ), $ A( I, I+1 ), LDA, WORK ) A( I, I ) = AII END IF 10 CONTINUE RETURN * * End of DGEQR2 * END octave-1.1.0/libcruft/lapack/dgeqrf.f100666 415 17 12526 5306544271 15657 0ustar jweusers SUBROUTINE DGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DGEQRF computes a QR factorization of a real m by n matrix A: * A = Q * R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and above the diagonal of the array * contain the min(m,n) by n upper trapezoidal matrix R (R is * upper triangular if m >= n); the elements below the diagonal, * with the array TAU, represent the orthogonal matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) DOUBLE PRECISION array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(k), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), * and tau in TAU(i). * * ===================================================================== * * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, K, LDWORK, NB, NBMIN, NX * .. * .. External Subroutines .. EXTERNAL DGEQR2, DLARFB, DLARFT, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGEQRF', -INFO ) RETURN END IF * * Quick return if possible * K = MIN( M, N ) IF( K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) NBMIN = 2 NX = 0 IWS = N IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'DGEQRF', ' ', M, N, -1, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = N IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DGEQRF', ' ', M, N, -1, $ -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code initially * DO 10 I = 1, K - NX, NB IB = MIN( K-I+1, NB ) * * Compute the QR factorization of the current block * A(i:m,i:i+ib-1) * CALL DGEQR2( M-I+1, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) IF( I+IB.LE.N ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Columnwise', M-I+1, IB, $ A( I, I ), LDA, TAU( I ), WORK, LDWORK ) * * Apply H' to A(i:m,i+ib:n) from the left * CALL DLARFB( 'Left', 'Transpose', 'Forward', $ 'Columnwise', M-I+1, N-I-IB+1, IB, $ A( I, I ), LDA, WORK, LDWORK, A( I, I+IB ), $ LDA, WORK( IB+1 ), LDWORK ) END IF 10 CONTINUE ELSE I = 1 END IF * * Use unblocked code to factor the last or only block. * IF( I.LE.K ) $ CALL DGEQR2( M-I+1, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * WORK( 1 ) = IWS RETURN * * End of DGEQRF * END octave-1.1.0/libcruft/lapack/dgesv.f100666 415 17 6622 5310240625 15466 0ustar jweusers SUBROUTINE DGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LDB, N, NRHS * .. * .. Array Arguments .. INTEGER IPIV( * ) DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * DGESV computes the solution to a real system of linear equations * A * X = B, * where A is an N by N matrix and X and B are N by NRHS matrices. * * The LU decomposition with partial pivoting and row interchanges is * used to factor A as * A = P * L * U, * where P is a permutation matrix, L is unit lower triangular, and U is * upper triangular. The factored form of A is then used to solve the * system of equations A * X = B. * * Arguments * ========= * * N (input) INTEGER * The number of linear equations, i.e., the order of the * matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrix B. NRHS >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the N by N matrix of coefficients A. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * IPIV (output) INTEGER array, dimension (N) * The pivot indices that define the permutation matrix P; * row i of the matrix was interchanged with row IPIV(i). * * B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS) * On entry, the N by NRHS matrix of right hand side vectors B * for the system of equations A*X = B. * On exit, if INFO = 0, the N by NRHS matrix of solution * vectors X. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, so the solution could not be computed. * * ===================================================================== * * .. External Subroutines .. EXTERNAL DGETRF, DGETRS, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( NRHS.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGESV ', -INFO ) RETURN END IF * * Compute the LU factorization of A. * CALL DGETRF( N, N, A, LDA, IPIV, INFO ) IF( INFO.EQ.0 ) THEN * * Solve the system A*X = B, overwriting B with X. * CALL DGETRS( 'No transpose', N, NRHS, A, LDA, IPIV, B, LDB, $ INFO ) END IF RETURN * * End of DGESV * END octave-1.1.0/libcruft/lapack/dgesvd.f100666 415 17 403676 5306544266 15721 0ustar jweusers SUBROUTINE DGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, $ WORK, LWORK, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER JOBU, JOBVT INTEGER INFO, LDA, LDU, LDVT, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), S( * ), U( LDU, * ), $ VT( LDVT, * ), WORK( * ) * .. * * Purpose * ======= * * DGESVD computes the singular value decomposition (SVD) of a real * M-by-N matrix A, optionally computing the left and/or right singular * vectors. The SVD is written * * A = U * SIGMA * transpose(V) * * where SIGMA is a diagonal matrix with the singular values on the * diagonal and U and V are orthogonal. The columns of U are the left * singular vectors and the columns of V are the right singular vectors. * If the right singular vectors are requested, VT = transpose(V) is * returned by the routine. * * The diagonal entries of SIGMA are returned in S: * S(1) >= ... >= S(MINMN) >= 0, where MINMN=MIN(M,N). * * Depending on JOBU all M left singular vectors may be computed * and stored in U, min(M,N) left singular vectors may be computed and * stored in U or overwritten on A, or no vectors may be computed. * * Depending on JOBVT all N right singular vectors may be computed * and stored in VT, min(M,N) right singular vectors may be computed and * stored in VT or overwritten on A, or no vectors may be computed. * * Arguments * ========= * * JOBU (input) CHARACTER*1 * JOBU specifies which left singular vectors to compute. If * JOBU = 'A' all M M-dimensional left singular * vectors are returned in U. * JOBU = 'S' only MIN(M,N) M-dimensional left * singular vectors are returned in U. * JOBU = 'O' only MIN(M,N) M-dimensional left * singular vectors are overwritten on A. * JOBU = 'N' no left singular vectors are computed. * * JOBVT (input) CHARACTER*1 * JOBVT specifies which right singular vectors to compute. If * JOBVT = 'A' all N N-dimensional right singular * vectors are returned in VT. * JOBVT = 'S' only MIN(M,N) N-dimensional right * singular vectors are returned in VT. * JOBVT = 'O' only MIN(M,N) N-dimensional right * singular vectors are overwritten on A. * JOBVT = 'N' no right singular vectors are computed. * * JOBVT and JOBU cannot simultaneously be 'O'. * * M (input) INTEGER * The number of rows of the input matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the input matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On input, A is the matrix whose SVD is desired. * On output, * if JOBU = 'O', A has been overwritten with * min(M,N) left singular vectors; * if JOBVT = 'O', A has been overwritten with * min(M,N) right singular vectors. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * S (output) DOUBLE PRECISION array, dimension (min(M,N)) * The singular values of A, sorted so that S(i) >= S(i+1). * * U (output) DOUBLE PRECISION array, dimension (LDU,UCOL) * where UCOL is defined as follows. * U contains the computed left singular vectors. * U has M rows and UCOL=M columns if JOBU = 'A'. * U has M rows and UCOL=min(M,N) columns if JOBU = 'S'. * U is not referenced if JOBU = 'N' or 'O'. * * LDU (input) INTEGER * The leading dimension of the array U. LDU >= 1, and * LDU >= M if JOBU = 'S' or 'A'. * * VT (output) DOUBLE PRECISION array, dimension (LDVT,N) * VT contains the transpose of the computed left singular * vectors. * VT has N rows and N columns if JOBVT = 'A'. * VT has min(M,N) rows and N columns if JOBVT = 'S'. * VT is not referenced if JOBVT = 'N' or 'O'. * * LDVT (input) INTEGER * The leading dimension of the array VT. LDVT >= 1, and * LDVT >= min(M,N) if JOBVT = 'S', or LDVT >= N if JOBVT = 'A'. * * WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK) * On exit, WORK(1) contains the optimal workspace size LWORK * for high performance. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK must be at least 1. * The exact minimum amount of workspace needed depends * on JOBU, JOBVT, M and N. As long as LWORK is at least * MAX(3*MIN(M,N)+MAX(M,N),5*MIN(M,N)-4), then the code * will execute correctly. * For good performance, LWORK should generally be larger. * The optimum value of LWORK for high performance is * returned in WORK(1). * * INFO (output) INTEGER * 0 - successful exit * <0 - if INFO = -i, the i-th argument had an illegal value. * >0 - if DBDSQR did not converge, INFO specifies how many * superdiagonals of an intermediate bidiagonal form * did not converge to zero. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL WNTUA, WNTUAS, WNTUN, WNTUO, WNTUS, WNTVA, $ WNTVAS, WNTVN, WNTVO, WNTVS INTEGER BLK, CHUNK, I, IE, IR, ISCL, ITAU, ITAUP, $ ITAUQ, IU, IWORK, LDWRKR, LDWRKU, MAXWRK, $ MINMN, MINWRK, MNTHR, NCU, NCVT, NRU, NRVT, $ WRKBL DOUBLE PRECISION ANRM, BIGNUM, EPS, SMLNUM * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DBDSQR, DGEBRD, DGELQF, DGEMM, DGEQRF, DLACPY, $ DLASCL, DLASET, DORGBR, DORGLQ, DORGQR, DORMBR, $ XERBLA * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV DOUBLE PRECISION DLAMCH, DLANGE EXTERNAL LSAME, ILAENV, DLAMCH, DLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 MINMN = MIN( M, N ) MNTHR = ILAENV( 6, 'DGESVD', JOBU // JOBVT, M, N, 0, 0 ) WNTUA = LSAME( JOBU, 'A' ) WNTUS = LSAME( JOBU, 'S' ) WNTUAS = WNTUA .OR. WNTUS WNTUO = LSAME( JOBU, 'O' ) WNTUN = LSAME( JOBU, 'N' ) WNTVA = LSAME( JOBVT, 'A' ) WNTVS = LSAME( JOBVT, 'S' ) WNTVAS = WNTVA .OR. WNTVS WNTVO = LSAME( JOBVT, 'O' ) WNTVN = LSAME( JOBVT, 'N' ) MINWRK = 1 * IF( .NOT.( WNTUA .OR. WNTUS .OR. WNTUO .OR. WNTUN ) ) THEN INFO = -1 ELSE IF( .NOT.( WNTVA .OR. WNTVS .OR. WNTVO .OR. WNTVN ) .OR. $ ( WNTVO .AND. WNTUO ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -6 ELSE IF( LDU.LT.1 .OR. ( WNTUAS .AND. LDU.LT.M ) ) THEN INFO = -9 ELSE IF( LDVT.LT.1 .OR. ( WNTVA .AND. LDVT.LT.N ) .OR. $ ( WNTVS .AND. LDVT.LT.MINMN ) ) THEN INFO = -11 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * NB refers to the optimal block size for the immediately * following subroutine, as returned by ILAENV.) * IF( INFO.EQ.0 .AND. LWORK.GE.1 .AND. M.GT.0 .AND. N.GT.0 ) THEN IF( M.GE.N ) THEN IF( M.GE.MNTHR ) THEN IF( WNTUN ) THEN * * Path 1 (M much larger than N, JOBU='N') * MAXWRK = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, $ -1 ) MAXWRK = MAX( MAXWRK, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) IF( WNTVO .OR. WNTVAS ) $ MAXWRK = MAX( MAXWRK, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) MAXWRK = MAX( MAXWRK, 5*N-4 ) MINWRK = MAX( 4*N, 5*N-4 ) ELSE IF( WNTUO .AND. WNTVN ) THEN * * Path 2 (M much larger than N, JOBU='O', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'DORGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = MAX( N*N+WRKBL, N*N+M*N ) MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUO .AND. WNTVAS ) THEN * * Path 3 (M much larger than N, JOBU='O', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'DORGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = MAX( N*N+WRKBL, N*N+M*N ) MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVN ) THEN * * Path 4 (M much larger than N, JOBU='S', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'DORGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVO ) THEN * * Path 5 (M much larger than N, JOBU='S', JOBVT='O') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'DORGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = 2*N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVAS ) THEN * * Path 6 (M much larger than N, JOBU='S', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'DORGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVN ) THEN * * Path 7 (M much larger than N, JOBU='A', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'DORGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVO ) THEN * * Path 8 (M much larger than N, JOBU='A', JOBVT='O') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'DORGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = 2*N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVAS ) THEN * * Path 9 (M much larger than N, JOBU='A', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'DGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'DORGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+2*N* $ ILAENV( 1, 'DGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = N*N + WRKBL MINWRK = MAX( 3*N+M, 5*N-4 ) MINWRK = MIN( MINWRK, MAXWRK ) END IF ELSE * * Path 10 (M at least N, but not much larger) * MAXWRK = 3*N + ( M+N )*ILAENV( 1, 'DGEBRD', ' ', M, N, $ -1, -1 ) IF( WNTUS .OR. WNTUO ) $ MAXWRK = MAX( MAXWRK, 3*N+N* $ ILAENV( 1, 'DORGBR', 'Q', M, N, N, -1 ) ) IF( WNTUA ) $ MAXWRK = MAX( MAXWRK, 3*N+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, N, -1 ) ) IF( .NOT.WNTVN ) $ MAXWRK = MAX( MAXWRK, 3*N+( N-1 )* $ ILAENV( 1, 'DORGBR', 'P', N, N, N, -1 ) ) MAXWRK = MAX( MAXWRK, 5*N-4 ) MINWRK = MAX( 3*N+M, 5*N-4 ) END IF ELSE IF( N.GE.MNTHR ) THEN IF( WNTVN ) THEN * * Path 1t(N much larger than M, JOBVT='N') * MAXWRK = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, $ -1 ) MAXWRK = MAX( MAXWRK, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) IF( WNTUO .OR. WNTUAS ) $ MAXWRK = MAX( MAXWRK, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) MAXWRK = MAX( MAXWRK, 5*M-4 ) MINWRK = MAX( 4*M, 5*M-4 ) ELSE IF( WNTVO .AND. WNTUN ) THEN * * Path 2t(N much larger than M, JOBU='N', JOBVT='O') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'DORGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = MAX( M*M+WRKBL, M*M+M*N ) MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVO .AND. WNTUAS ) THEN * * Path 3t(N much larger than M, JOBU='S' or 'A', * JOBVT='O') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'DORGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = MAX( M*M+WRKBL, M*M+M*N ) MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUN ) THEN * * Path 4t(N much larger than M, JOBU='N', JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'DORGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUO ) THEN * * Path 5t(N much larger than M, JOBU='O', JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'DORGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = 2*M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUAS ) THEN * * Path 6t(N much larger than M, JOBU='S' or 'A', * JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'DORGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUN ) THEN * * Path 7t(N much larger than M, JOBU='N', JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'DORGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUO ) THEN * * Path 8t(N much larger than M, JOBU='O', JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'DORGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = 2*M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUAS ) THEN * * Path 9t(N much larger than M, JOBU='S' or 'A', * JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'DGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'DORGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+2*M* $ ILAENV( 1, 'DGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 3*M+M* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 5*M-4 ) MAXWRK = M*M + WRKBL MINWRK = MAX( 3*M+N, 5*M-4 ) MINWRK = MIN( MINWRK, MAXWRK ) END IF ELSE * * Path 10t(N greater than M, but not much larger) * MAXWRK = 3*M + ( M+N )*ILAENV( 1, 'DGEBRD', ' ', M, N, $ -1, -1 ) IF( WNTVS .OR. WNTVO ) $ MAXWRK = MAX( MAXWRK, 3*M+M* $ ILAENV( 1, 'DORGBR', 'P', M, N, M, -1 ) ) IF( WNTVA ) $ MAXWRK = MAX( MAXWRK, 3*M+N* $ ILAENV( 1, 'DORGBR', 'P', N, N, M, -1 ) ) IF( .NOT.WNTUN ) $ MAXWRK = MAX( MAXWRK, 3*M+( M-1 )* $ ILAENV( 1, 'DORGBR', 'Q', M, M, M, -1 ) ) MAXWRK = MAX( MAXWRK, 5*M-4 ) MINWRK = MAX( 3*M+N, 5*M-4 ) END IF END IF WORK( 1 ) = MAXWRK END IF * IF( LWORK.LT.MINWRK ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGESVD', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN IF( LWORK.GE.1 ) $ WORK( 1 ) = ONE RETURN END IF * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = SQRT( DLAMCH( 'S' ) ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = DLANGE( 'M', M, N, A, LDA, DUM ) ISCL = 0 IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN ISCL = 1 CALL DLASCL( 'G', 0, 0, ANRM, SMLNUM, M, N, A, LDA, INFO ) ELSE IF( ANRM.GT.BIGNUM ) THEN ISCL = 1 CALL DLASCL( 'G', 0, 0, ANRM, BIGNUM, M, N, A, LDA, INFO ) END IF * IF( M.GE.N ) THEN * * A has at least as many rows as columns. If A has sufficiently * more rows than columns, first reduce using the QR * decomposition (if sufficient workspace available) * IF( M.GE.MNTHR ) THEN * IF( WNTUN ) THEN * * Path 1 (M much larger than N, JOBU='N') * No left singular vectors to be computed * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Zero out below R * CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), LDA ) IE = 1 ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in A * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) NCVT = 0 IF( WNTVO .OR. WNTVAS ) THEN * * If right singular vectors desired, generate P'. * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) NCVT = N END IF IWORK = IE + N * * Perform bidiagonal QR iteration, computing right * singular vectors of A in A if desired * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, NCVT, 0, 0, S, WORK( IE ), A, LDA, $ DUM, 1, DUM, 1, WORK( IWORK ), INFO ) * * If right singular vectors desired in VT, copy them there * IF( WNTVAS ) $ CALL DLACPY( 'F', N, N, A, LDA, VT, LDVT ) * ELSE IF( WNTUO .AND. WNTVN ) THEN * * Path 2 (M much larger than N, JOBU='O', JOBVT='N') * N left singular vectors to be overwritten on A and * no right singular vectors to be computed * IF( LWORK.GE.N*N+MAX( 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*N ) THEN * * WORK(IU) is LDA by N, WORK(IR) is LDA by N * LDWRKU = LDA LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+N*N ) THEN * * WORK(IU) is LDA by N, WORK(IR) is N by N * LDWRKU = LDA LDWRKR = N ELSE * * WORK(IU) is LDWRKU by N, WORK(IR) is N by N * LDWRKU = ( LWORK-N*N ) / N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IR) and zero out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IR ), LDWRKR ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, WORK( IR+1 ), $ LDWRKR ) * * Generate Q in A * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IR ), LDWRKR, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing R * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, 0, N, 0, S, WORK( IE ), DUM, 1, $ WORK( IR ), LDWRKR, DUM, 1, $ WORK( IWORK ), INFO ) IU = IE * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in WORK(IU) and copying to A * (Workspace: need N*N+N, prefer N*N+M*N) * DO 10 I = 1, M, LDWRKU CHUNK = MIN( M-I+1, LDWRKU ) CALL DGEMM( 'N', 'N', CHUNK, N, N, ONE, A( I, 1 ), $ LDA, WORK( IR ), LDWRKR, ZERO, $ WORK( IU ), LDWRKU ) CALL DLACPY( 'F', CHUNK, N, WORK( IU ), LDWRKU, $ A( I, 1 ), LDA ) 10 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * IE = 1 ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize A * (Workspace: need 3*N+M, prefer 3*N+(M+N)*NB) * CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing A * (Workspace: need 4*N, prefer 3*N+N*NB) * CALL DORGBR( 'Q', M, N, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, 0, M, 0, S, WORK( IE ), DUM, 1, $ A, LDA, DUM, 1, WORK( IWORK ), INFO ) * END IF * ELSE IF( WNTUO .AND. WNTVAS ) THEN * * Path 3 (M much larger than N, JOBU='O', JOBVT='S' or 'A') * N left singular vectors to be overwritten on A and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+MAX( 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+N*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA LDWRKR = N ELSE * * WORK(IU) is LDWRKU by N and WORK(IR) is N by N * LDWRKU = ( LWORK-N*N ) / N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, VT( 2, 1 ), $ LDVT ) * * Generate Q in A * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT, copying result to WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, VT, LDVT, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', N, N, VT, LDVT, WORK( IR ), LDWRKR ) * * Generate left vectors bidiagonalizing R in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in VT * (Workspace: need N*N+4*N-1, prefer N*N+3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) and computing right * singular vectors of R in VT * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, N, N, 0, S, WORK( IE ), VT, LDVT, $ WORK( IR ), LDWRKR, DUM, 1, $ WORK( IWORK ), INFO ) IU = IE * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in WORK(IU) and copying to A * (Workspace: need N*N+N, prefer N*N+M*N) * DO 20 I = 1, M, LDWRKU CHUNK = MIN( M-I+1, LDWRKU ) CALL DGEMM( 'N', 'N', CHUNK, N, N, ONE, A( I, 1 ), $ LDA, WORK( IR ), LDWRKR, ZERO, $ WORK( IU ), LDWRKU ) CALL DLACPY( 'F', CHUNK, N, WORK( IU ), LDWRKU, $ A( I, 1 ), LDA ) 20 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, VT( 2, 1 ), $ LDVT ) * * Generate Q in A * (Workspace: need 2*N, prefer N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, VT, LDVT, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in A by left vectors bidiagonalizing R * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), A, LDA, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in VT * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A and computing right * singular vectors of A in VT * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, M, 0, S, WORK( IE ), VT, LDVT, $ A, LDA, DUM, 1, WORK( IWORK ), INFO ) * END IF * ELSE IF( WNTUS ) THEN * IF( WNTVN ) THEN * * Path 4 (M much larger than N, JOBU='S', JOBVT='N') * N left singular vectors to be computed in U and * no right singular vectors to be computed * IF( LWORK.GE.N*N+MAX( 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IR) is LDA by N * LDWRKR = LDA ELSE * * WORK(IR) is N by N * LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IR), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IR ), $ LDWRKR ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IR+1 ), LDWRKR ) * * Generate Q in A * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IR ), LDWRKR, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing R in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, 0, N, 0, S, WORK( IE ), DUM, $ 1, WORK( IR ), LDWRKR, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in U * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, A, LDA, $ WORK( IR ), LDWRKR, ZERO, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need 2*N, prefer N+N*NB) * CALL DORGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), $ LDA ) * * Bidiagonalize R in A * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left vectors bidiagonalizing R * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, 0, M, 0, S, WORK( IE ), DUM, $ 1, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTVO ) THEN * * Path 5 (M much larger than N, JOBU='S', JOBVT='O') * N left singular vectors to be computed in U and * N right singular vectors to be overwritten on A * IF( LWORK.GE.2*N*N+MAX( 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+N )*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = N ELSE * * WORK(IU) is N by N and WORK(IR) is N by N * LDWRKU = N IR = IU + LDWRKU*N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IU+1 ), LDWRKU ) * * Generate Q in A * (Workspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to * WORK(IR) * (Workspace: need 2*N*N+4*N, * prefer 2*N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', N, N, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate left bidiagonalizing vectors in WORK(IU) * (Workspace: need 2*N*N+4*N, prefer 2*N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (Workspace: need 2*N*N+4*N-1, * prefer 2*N*N+3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in WORK(IR) * (Workspace: need 2*N*N+5*N-4) * CALL DBDSQR( 'U', N, N, N, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, WORK( IU ), $ LDWRKU, DUM, 1, WORK( IWORK ), INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IU), storing result in U * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, A, LDA, $ WORK( IU ), LDWRKU, ZERO, U, LDU ) * * Copy right singular vectors of R to A * (Workspace: need N*N) * CALL DLACPY( 'F', N, N, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need 2*N, prefer N+N*NB) * CALL DORGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), $ LDA ) * * Bidiagonalize R in A * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left vectors bidiagonalizing R * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in A * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, M, 0, S, WORK( IE ), A, $ LDA, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTVAS ) THEN * * Path 6 (M much larger than N, JOBU='S', JOBVT='S' * or 'A') * N left singular vectors to be computed in U and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+MAX( 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is N by N * LDWRKU = N END IF ITAU = IU + LDWRKU*N IWORK = ITAU + N * * Compute A=Q*R * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IU+1 ), LDWRKU ) * * Generate Q in A * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DORGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to VT * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', N, N, WORK( IU ), LDWRKU, VT, $ LDVT ) * * Generate left bidiagonalizing vectors in WORK(IU) * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (Workspace: need N*N+4*N-1, * prefer N*N+3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in VT * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, N, N, 0, S, WORK( IE ), VT, $ LDVT, WORK( IU ), LDWRKU, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IU), storing result in U * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, A, LDA, $ WORK( IU ), LDWRKU, ZERO, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need 2*N, prefer N+N*NB) * CALL DORGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, VT( 2, 1 ), $ LDVT ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, VT, LDVT, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in VT * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, M, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * END IF * ELSE IF( WNTUA ) THEN * IF( WNTVN ) THEN * * Path 7 (M much larger than N, JOBU='A', JOBVT='N') * M left singular vectors to be computed in U and * no right singular vectors to be computed * IF( LWORK.GE.N*N+MAX( N+M, 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IR) is LDA by N * LDWRKR = LDA ELSE * * WORK(IR) is N by N * LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Copy R to WORK(IR), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IR ), $ LDWRKR ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IR+1 ), LDWRKR ) * * Generate Q in U * (Workspace: need N*N+N+M, prefer N*N+N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IR ), LDWRKR, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, 0, N, 0, S, WORK( IE ), DUM, $ 1, WORK( IR ), LDWRKR, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IR), storing result in A * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, U, LDU, $ WORK( IR ), LDWRKR, ZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL DLACPY( 'F', M, N, A, LDA, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need N+M, prefer N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), $ LDA ) * * Bidiagonalize R in A * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in A * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, 0, M, 0, S, WORK( IE ), DUM, $ 1, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTVO ) THEN * * Path 8 (M much larger than N, JOBU='A', JOBVT='O') * M left singular vectors to be computed in U and * N right singular vectors to be overwritten on A * IF( LWORK.GE.2*N*N+MAX( N+M, 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+N )*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = N ELSE * * WORK(IU) is N by N and WORK(IR) is N by N * LDWRKU = N IR = IU + LDWRKU*N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need 2*N*N+N+M, prefer 2*N*N+N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IU+1 ), LDWRKU ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to * WORK(IR) * (Workspace: need 2*N*N+4*N, * prefer 2*N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', N, N, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate left bidiagonalizing vectors in WORK(IU) * (Workspace: need 2*N*N+4*N, prefer 2*N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (Workspace: need 2*N*N+4*N-1, * prefer 2*N*N+3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in WORK(IR) * (Workspace: need 2*N*N+5*N-4) * CALL DBDSQR( 'U', N, N, N, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, WORK( IU ), $ LDWRKU, DUM, 1, WORK( IWORK ), INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IU), storing result in A * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, U, LDU, $ WORK( IU ), LDWRKU, ZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL DLACPY( 'F', M, N, A, LDA, U, LDU ) * * Copy right singular vectors of R from WORK(IR) to A * CALL DLACPY( 'F', N, N, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need N+M, prefer N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, A( 2, 1 ), $ LDA ) * * Bidiagonalize R in A * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in A * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in A * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, M, 0, S, WORK( IE ), A, $ LDA, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTVAS ) THEN * * Path 9 (M much larger than N, JOBU='A', JOBVT='S' * or 'A') * M left singular vectors to be computed in U and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+MAX( N+M, 4*N, 5*N-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is N by N * LDWRKU = N END IF ITAU = IU + LDWRKU*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need N*N+2*N, prefer N*N+N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need N*N+N+M, prefer N*N+N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, $ WORK( IU+1 ), LDWRKU ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to VT * (Workspace: need N*N+4*N, prefer N*N+3*N+2*N*NB) * CALL DGEBRD( N, N, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', N, N, WORK( IU ), LDWRKU, VT, $ LDVT ) * * Generate left bidiagonalizing vectors in WORK(IU) * (Workspace: need N*N+4*N, prefer N*N+3*N+N*NB) * CALL DORGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (Workspace: need N*N+4*N-1, * prefer N*N+3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in VT * (Workspace: need N*N+5*N-4) * CALL DBDSQR( 'U', N, N, N, 0, S, WORK( IE ), VT, $ LDVT, WORK( IU ), LDWRKU, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IU), storing result in A * (Workspace: need N*N) * CALL DGEMM( 'N', 'N', M, N, N, ONE, U, LDU, $ WORK( IU ), LDWRKU, ZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL DLACPY( 'F', M, N, A, LDA, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (Workspace: need 2*N, prefer N+N*NB) * CALL DGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (Workspace: need N+M, prefer N+M*NB) * CALL DORGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R from A to VT, zeroing out below it * CALL DLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL DLASET( 'L', N-1, N-1, ZERO, ZERO, VT( 2, 1 ), $ LDVT ) IE = ITAU ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (Workspace: need 4*N, prefer 3*N+2*N*NB) * CALL DGEBRD( N, N, VT, LDVT, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in VT * (Workspace: need 3*N+M, prefer 3*N+M*NB) * CALL DORMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, N, M, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * END IF * END IF * ELSE * * M .LT. MNTHR * * Path 10 (M at least N, but not much larger) * Reduce to bidiagonal form without QR decomposition * IE = 1 ITAUQ = IE + N ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize A * (Workspace: need 3*N+M, prefer 3*N+(M+N)*NB) * CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUAS ) THEN * * If left singular vectors desired in U, copy result to U * and generate left bidiagonalizing vectors in U * (Workspace: need 3*N+NCU, prefer 3*N+NCU*NB) * CALL DLACPY( 'L', M, N, A, LDA, U, LDU ) IF( WNTUS ) $ NCU = N IF( WNTUA ) $ NCU = M CALL DORGBR( 'Q', M, NCU, N, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVAS ) THEN * * If right singular vectors desired in VT, copy result to * VT and generate right bidiagonalizing vectors in VT * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL DORGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTUO ) THEN * * If left singular vectors desired in A, generate left * bidiagonalizing vectors in A * (Workspace: need 4*N, prefer 3*N+N*NB) * CALL DORGBR( 'Q', M, N, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVO ) THEN * * If right singular vectors desired in A, generate right * bidiagonalizing vectors in A * (Workspace: need 4*N-1, prefer 3*N+(N-1)*NB) * CALL DORGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IWORK = IE + N IF( WNTUAS .OR. WNTUO ) $ NRU = M IF( WNTUN ) $ NRU = 0 IF( WNTVAS .OR. WNTVO ) $ NCVT = N IF( WNTVN ) $ NCVT = 0 IF( ( .NOT.WNTUO ) .AND. ( .NOT.WNTVO ) ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in VT * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, NCVT, NRU, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), INFO ) ELSE IF( ( .NOT.WNTUO ) .AND. WNTVO ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in A * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, NCVT, NRU, 0, S, WORK( IE ), A, LDA, $ U, LDU, DUM, 1, WORK( IWORK ), INFO ) ELSE * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in A and computing right singular * vectors in VT * (Workspace: need 5*N-4) * CALL DBDSQR( 'U', N, NCVT, NRU, 0, S, WORK( IE ), VT, $ LDVT, A, LDA, DUM, 1, WORK( IWORK ), INFO ) END IF * END IF * ELSE * * A has more columns than rows. If A has sufficiently more * columns than rows, first reduce using the LQ decomposition (if * sufficient workspace available) * IF( N.GE.MNTHR ) THEN * IF( WNTVN ) THEN * * Path 1t(N much larger than M, JOBVT='N') * No right singular vectors to be computed * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Zero out above L * CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, A( 1, 2 ), LDA ) IE = 1 ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in A * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUO .OR. WNTUAS ) THEN * * If left singular vectors desired, generate Q * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IWORK = IE + M NRU = 0 IF( WNTUO .OR. WNTUAS ) $ NRU = M * * Perform bidiagonal QR iteration, computing left singular * vectors of A in A if desired * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, 0, NRU, 0, S, WORK( IE ), DUM, 1, A, $ LDA, DUM, 1, WORK( IWORK ), INFO ) * * If left singular vectors desired in U, copy them there * IF( WNTUAS ) $ CALL DLACPY( 'F', M, M, A, LDA, U, LDU ) * ELSE IF( WNTVO .AND. WNTUN ) THEN * * Path 2t(N much larger than M, JOBU='N', JOBVT='O') * M right singular vectors to be overwritten on A and * no left singular vectors to be computed * IF( LWORK.GE.M*M+MAX( 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by M * LDWRKU = LDA CHUNK = N LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+M*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is M by M * LDWRKU = LDA CHUNK = N LDWRKR = M ELSE * * WORK(IU) is M by CHUNK and WORK(IR) is M by M * LDWRKU = M CHUNK = ( LWORK-M*M ) / M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IR) and zero out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IR ), LDWRKR ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in A * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IR ), LDWRKR, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing L * (Workspace: need M*M+4*M-1, prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, 0, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, DUM, 1, DUM, 1, $ WORK( IWORK ), INFO ) IU = IE * * Multiply right singular vectors of L in WORK(IR) by Q * in A, storing result in WORK(IU) and copying to A * (Workspace: need M*M+M, prefer M*M+M*N) * DO 30 I = 1, N, CHUNK BLK = MIN( N-I+1, CHUNK ) CALL DGEMM( 'N', 'N', M, BLK, M, ONE, WORK( IR ), $ LDWRKR, A( 1, I ), LDA, ZERO, $ WORK( IU ), LDWRKU ) CALL DLACPY( 'F', M, BLK, WORK( IU ), LDWRKU, $ A( 1, I ), LDA ) 30 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * IE = 1 ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (Workspace: need 3*M+N, prefer 3*M+(M+N)*NB) * CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing A * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in A * (Workspace: need 5*M-4) * CALL DBDSQR( 'L', M, N, 0, 0, S, WORK( IE ), A, LDA, $ DUM, 1, DUM, 1, WORK( IWORK ), INFO ) * END IF * ELSE IF( WNTVO .AND. WNTUAS ) THEN * * Path 3t(N much larger than M, JOBU='S' or 'A', JOBVT='O') * M right singular vectors to be overwritten on A and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+MAX( 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by M * LDWRKU = LDA CHUNK = N LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+M*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is M by M * LDWRKU = LDA CHUNK = N LDWRKR = M ELSE * * WORK(IU) is M by CHUNK and WORK(IR) is M by M * LDWRKU = M CHUNK = ( LWORK-M*M ) / M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing about above it * CALL DLACPY( 'L', M, M, A, LDA, U, LDU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, U( 1, 2 ), $ LDU ) * * Generate Q in A * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U, copying result to WORK(IR) * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, U, LDU, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, M, U, LDU, WORK( IR ), LDWRKR ) * * Generate right vectors bidiagonalizing L in WORK(IR) * (Workspace: need M*M+4*M-1, prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing L in U * (Workspace: need M*M+4*M, prefer M*M+3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U, and computing right * singular vectors of L in WORK(IR) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, M, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, U, LDU, DUM, 1, $ WORK( IWORK ), INFO ) IU = IE * * Multiply right singular vectors of L in WORK(IR) by Q * in A, storing result in WORK(IU) and copying to A * (Workspace: need M*M+M, prefer M*M+M*N)) * DO 40 I = 1, N, CHUNK BLK = MIN( N-I+1, CHUNK ) CALL DGEMM( 'N', 'N', M, BLK, M, ONE, WORK( IR ), $ LDWRKR, A( 1, I ), LDA, ZERO, $ WORK( IU ), LDWRKU ) CALL DLACPY( 'F', M, BLK, WORK( IU ), LDWRKU, $ A( 1, I ), LDA ) 40 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, U, LDU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, U( 1, 2 ), $ LDU ) * * Generate Q in A * (Workspace: need 2*M, prefer M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, U, LDU, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in A * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, U, LDU, $ WORK( ITAUP ), A, LDA, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing L in U * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, M, 0, S, WORK( IE ), A, LDA, $ U, LDU, DUM, 1, WORK( IWORK ), INFO ) * END IF * ELSE IF( WNTVS ) THEN * IF( WNTUN ) THEN * * Path 4t(N much larger than M, JOBU='N', JOBVT='S') * M right singular vectors to be computed in VT and * no left singular vectors to be computed * IF( LWORK.GE.M*M+MAX( 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IR) is LDA by M * LDWRKR = LDA ELSE * * WORK(IR) is M by M * LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IR), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IR ), $ LDWRKR ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in A * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IR ), LDWRKR, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing L in * WORK(IR) * (Workspace: need M*M+4*M, prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, 0, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, DUM, 1, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IR) by * Q in A, storing result in VT * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IR ), $ LDWRKR, A, LDA, ZERO, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy result to VT * CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DORGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, A( 1, 2 ), $ LDA ) * * Bidiagonalize L in A * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, 0, 0, S, WORK( IE ), VT, $ LDVT, DUM, 1, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTUO ) THEN * * Path 5t(N much larger than M, JOBU='O', JOBVT='S') * M right singular vectors to be computed in VT and * M left singular vectors to be overwritten on A * IF( LWORK.GE.2*M*M+MAX( 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is LDA by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+M )*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is M by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = M ELSE * * WORK(IU) is M by M and WORK(IR) is M by M * LDWRKU = M IR = IU + LDWRKU*M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out below it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IU+LDWRKU ), LDWRKU ) * * Generate Q in A * (Workspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to * WORK(IR) * (Workspace: need 2*M*M+4*M, * prefer 2*M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, M, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate right bidiagonalizing vectors in WORK(IU) * (Workspace: need 2*M*M+4*M-1, * prefer 2*M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (Workspace: need 2*M*M+4*M, prefer 2*M*M+3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in WORK(IR) and computing * right singular vectors of L in WORK(IU) * (Workspace: need 2*M*M+5*M-4) * CALL DBDSQR( 'U', M, M, M, 0, S, WORK( IE ), $ WORK( IU ), LDWRKU, WORK( IR ), $ LDWRKR, DUM, 1, WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in A, storing result in VT * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IU ), $ LDWRKU, A, LDA, ZERO, VT, LDVT ) * * Copy left singular vectors of L to A * (Workspace: need M*M) * CALL DLACPY( 'F', M, M, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DORGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, A( 1, 2 ), $ LDA ) * * Bidiagonalize L in A * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors of L in A * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, compute left * singular vectors of A in A and compute right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, M, 0, S, WORK( IE ), VT, $ LDVT, A, LDA, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTUAS ) THEN * * Path 6t(N much larger than M, JOBU='S' or 'A', * JOBVT='S') * M right singular vectors to be computed in VT and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+MAX( 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is LDA by M * LDWRKU = M END IF ITAU = IU + LDWRKU*M IWORK = ITAU + M * * Compute A=L*Q * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IU+LDWRKU ), LDWRKU ) * * Generate Q in A * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DORGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to U * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, M, WORK( IU ), LDWRKU, U, $ LDU ) * * Generate right bidiagonalizing vectors in WORK(IU) * (Workspace: need M*M+4*M-1, * prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (Workspace: need M*M+4*M, prefer M*M+3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U and computing right * singular vectors of L in WORK(IU) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, M, 0, S, WORK( IE ), $ WORK( IU ), LDWRKU, U, LDU, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in A, storing result in VT * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IU ), $ LDWRKU, A, LDA, ZERO, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DORGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, U, LDU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, U( 1, 2 ), $ LDU ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, U, LDU, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in U by Q * in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, U, LDU, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, M, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * END IF * ELSE IF( WNTVA ) THEN * IF( WNTUN ) THEN * * Path 7t(N much larger than M, JOBU='N', JOBVT='A') * N right singular vectors to be computed in VT and * no left singular vectors to be computed * IF( LWORK.GE.M*M+MAX( N+M, 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IR) is LDA by M * LDWRKR = LDA ELSE * * WORK(IR) is M by M * LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Copy L to WORK(IR), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IR ), $ LDWRKR ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in VT * (Workspace: need M*M+M+N, prefer M*M+M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IR ), LDWRKR, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (Workspace: need M*M+4*M-1, * prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, 0, 0, S, WORK( IE ), $ WORK( IR ), LDWRKR, DUM, 1, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IR) by * Q in VT, storing result in A * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IR ), $ LDWRKR, VT, LDVT, ZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL DLACPY( 'F', M, N, A, LDA, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need M+N, prefer M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, A( 1, 2 ), $ LDA ) * * Bidiagonalize L in A * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in A by Q * in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, 0, 0, S, WORK( IE ), VT, $ LDVT, DUM, 1, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTUO ) THEN * * Path 8t(N much larger than M, JOBU='O', JOBVT='A') * N right singular vectors to be computed in VT and * M left singular vectors to be overwritten on A * IF( LWORK.GE.2*M*M+MAX( N+M, 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is LDA by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+M )*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is M by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = M ELSE * * WORK(IU) is M by M and WORK(IR) is M by M * LDWRKU = M IR = IU + LDWRKU*M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need 2*M*M+M+N, prefer 2*M*M+M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IU+LDWRKU ), LDWRKU ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to * WORK(IR) * (Workspace: need 2*M*M+4*M, * prefer 2*M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, M, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate right bidiagonalizing vectors in WORK(IU) * (Workspace: need 2*M*M+4*M-1, * prefer 2*M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (Workspace: need 2*M*M+4*M, prefer 2*M*M+3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in WORK(IR) and computing * right singular vectors of L in WORK(IU) * (Workspace: need 2*M*M+5*M-4) * CALL DBDSQR( 'U', M, M, M, 0, S, WORK( IE ), $ WORK( IU ), LDWRKU, WORK( IR ), $ LDWRKR, DUM, 1, WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in VT, storing result in A * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IU ), $ LDWRKU, VT, LDVT, ZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL DLACPY( 'F', M, N, A, LDA, VT, LDVT ) * * Copy left singular vectors of A from WORK(IR) to A * CALL DLACPY( 'F', M, M, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need M+N, prefer M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, A( 1, 2 ), $ LDA ) * * Bidiagonalize L in A * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, A, LDA, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in A by Q * in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in A * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A and computing right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, M, 0, S, WORK( IE ), VT, $ LDVT, A, LDA, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * ELSE IF( WNTUAS ) THEN * * Path 9t(N much larger than M, JOBU='S' or 'A', * JOBVT='A') * N right singular vectors to be computed in VT and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+MAX( N+M, 4*M, 5*M-4 ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IU) is LDA by M * LDWRKU = LDA ELSE * * WORK(IU) is M by M * LDWRKU = M END IF ITAU = IU + LDWRKU*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need M*M+2*M, prefer M*M+M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need M*M+M+N, prefer M*M+M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, $ WORK( IU+LDWRKU ), LDWRKU ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to U * (Workspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * CALL DGEBRD( M, M, WORK( IU ), LDWRKU, S, $ WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL DLACPY( 'L', M, M, WORK( IU ), LDWRKU, U, $ LDU ) * * Generate right bidiagonalizing vectors in WORK(IU) * (Workspace: need M*M+4*M, prefer M*M+3*M+(M-1)*NB) * CALL DORGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (Workspace: need M*M+4*M, prefer M*M+3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U and computing right * singular vectors of L in WORK(IU) * (Workspace: need M*M+5*M-4) * CALL DBDSQR( 'U', M, M, M, 0, S, WORK( IE ), $ WORK( IU ), LDWRKU, U, LDU, DUM, 1, $ WORK( IWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in VT, storing result in A * (Workspace: need M*M) * CALL DGEMM( 'N', 'N', M, N, M, ONE, WORK( IU ), $ LDWRKU, VT, LDVT, ZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL DLACPY( 'F', M, N, A, LDA, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (Workspace: need 2*M, prefer M+M*NB) * CALL DGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (Workspace: need M+N, prefer M+N*NB) * CALL DORGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL DLACPY( 'L', M, M, A, LDA, U, LDU ) CALL DLASET( 'U', M-1, M-1, ZERO, ZERO, U( 1, 2 ), $ LDU ) IE = ITAU ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (Workspace: need 4*M, prefer 3*M+2*M*NB) * CALL DGEBRD( M, M, U, LDU, S, WORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in U by Q * in VT * (Workspace: need 3*M+N, prefer 3*M+N*NB) * CALL DORMBR( 'P', 'L', 'T', M, N, M, U, LDU, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'U', M, N, M, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), $ INFO ) * END IF * END IF * END IF * ELSE * * N .LT. MNTHR * * Path 10t(N greater than M, but not much larger) * Reduce to bidiagonal form without LQ decomposition * IE = 1 ITAUQ = IE + M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (Workspace: need 3*M+N, prefer 3*M+(M+N)*NB) * CALL DGEBRD( M, N, A, LDA, S, WORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUAS ) THEN * * If left singular vectors desired in U, copy result to U * and generate left bidiagonalizing vectors in U * (Workspace: need 4*M-1, prefer 3*M+(M-1)*NB) * CALL DLACPY( 'L', M, M, A, LDA, U, LDU ) CALL DORGBR( 'Q', M, M, N, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVAS ) THEN * * If right singular vectors desired in VT, copy result to * VT and generate right bidiagonalizing vectors in VT * (Workspace: need 3*M+NRVT, prefer 3*M+NRVT*NB) * CALL DLACPY( 'U', M, N, A, LDA, VT, LDVT ) IF( WNTVA ) $ NRVT = N IF( WNTVS ) $ NRVT = M CALL DORGBR( 'P', NRVT, N, M, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTUO ) THEN * * If left singular vectors desired in A, generate left * bidiagonalizing vectors in A * (Workspace: need 4*M-1, prefer 3*M+(M-1)*NB) * CALL DORGBR( 'Q', M, M, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVO ) THEN * * If right singular vectors desired in A, generate right * bidiagonalizing vectors in A * (Workspace: need 4*M, prefer 3*M+M*NB) * CALL DORGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IWORK = IE + M IF( WNTUAS .OR. WNTUO ) $ NRU = M IF( WNTUN ) $ NRU = 0 IF( WNTVAS .OR. WNTVO ) $ NCVT = N IF( WNTVN ) $ NCVT = 0 IF( ( .NOT.WNTUO ) .AND. ( .NOT.WNTVO ) ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'L', M, NCVT, NRU, 0, S, WORK( IE ), VT, $ LDVT, U, LDU, DUM, 1, WORK( IWORK ), INFO ) ELSE IF( ( .NOT.WNTUO ) .AND. WNTVO ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in A * (Workspace: need 5*M-4) * CALL DBDSQR( 'L', M, NCVT, NRU, 0, S, WORK( IE ), A, LDA, $ U, LDU, DUM, 1, WORK( IWORK ), INFO ) ELSE * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in A and computing right singular * vectors in VT * (Workspace: need 5*M-4) * CALL DBDSQR( 'L', M, NCVT, NRU, 0, S, WORK( IE ), VT, $ LDVT, A, LDA, DUM, 1, WORK( IWORK ), INFO ) END IF * END IF * END IF * * Undo scaling if necessary * IF( ISCL.EQ.1 ) THEN IF( ANRM.GT.BIGNUM ) $ CALL DLASCL( 'G', 0, 0, BIGNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) IF( ANRM.LT.SMLNUM ) $ CALL DLASCL( 'G', 0, 0, SMLNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) END IF * * Return optimal workspace in WORK(1) * WORK( 1 ) = MAXWRK * RETURN * * End of DGESVD * END octave-1.1.0/libcruft/lapack/dgetf2.f100666 415 17 7343 5310240626 15533 0ustar jweusers SUBROUTINE DGETF2( M, N, A, LDA, IPIV, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER IPIV( * ) DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DGETF2 computes an LU factorization of a general m-by-n matrix A * using partial pivoting with row interchanges. * * The factorization has the form * A = P * L * U * where P is a permutation matrix, L is lower triangular with unit * diagonal elements (lower trapezoidal if m > n), and U is upper * triangular (upper trapezoidal if m < n). * * This is the right-looking Level 2 BLAS version of the algorithm. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix to be factored. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * IPIV (output) INTEGER array, dimension (min(M,N)) * The pivot indices; for 1 <= i <= min(M,N), row i of the * matrix was interchanged with row IPIV(i). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, and division by zero will occur if it is used * to solve a system of equations. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER J, JP * .. * .. External Functions .. INTEGER IDAMAX EXTERNAL IDAMAX * .. * .. External Subroutines .. EXTERNAL DGER, DSCAL, DSWAP, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGETF2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * DO 10 J = 1, MIN( M, N ) * * Find pivot and test for singularity. * JP = J - 1 + IDAMAX( M-J+1, A( J, J ), 1 ) IPIV( J ) = JP IF( A( JP, J ).NE.ZERO ) THEN * * Apply the interchange to columns 1:N. * IF( JP.NE.J ) $ CALL DSWAP( N, A( J, 1 ), LDA, A( JP, 1 ), LDA ) * * Compute elements J+1:M of J-th column. * IF( J.LT.M ) $ CALL DSCAL( M-J, ONE / A( J, J ), A( J+1, J ), 1 ) * ELSE IF( INFO.EQ.0 ) THEN * INFO = J END IF * IF( J.LT.MIN( M, N ) ) THEN * * Update trailing submatrix. * CALL DGER( M-J, N-J, -ONE, A( J+1, J ), 1, A( J, J+1 ), LDA, $ A( J+1, J+1 ), LDA ) END IF 10 CONTINUE RETURN * * End of DGETF2 * END octave-1.1.0/libcruft/lapack/dgetrf.f100666 415 17 11174 5310240625 15647 0ustar jweusers SUBROUTINE DGETRF( M, N, A, LDA, IPIV, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER IPIV( * ) DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DGETRF computes an LU factorization of a general m-by-n matrix A * using partial pivoting with row interchanges. * * The factorization has the form * A = P * L * U * where P is a permutation matrix, L is lower triangular with unit * diagonal elements (lower trapezoidal if m > n), and U is upper * triangular (upper trapezoidal if m < n). * * This is the right-looking Level 3 BLAS version of the algorithm. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n matrix to be factored. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * IPIV (output) INTEGER array, dimension (min(M,N)) * The pivot indices; for 1 <= i <= min(M,N), row i of the * matrix was interchanged with row IPIV(i). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, and division by zero will occur if it is used * to solve a system of equations. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, JB, NB * .. * .. External Subroutines .. EXTERNAL DGEMM, DGETF2, DLASWP, DTRSM, XERBLA * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGETRF', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * * Determine the block size for this environment. * NB = ILAENV( 1, 'DGETRF', ' ', M, N, -1, -1 ) IF( NB.LE.1 .OR. NB.GE.MIN( M, N ) ) THEN * * Use unblocked code. * CALL DGETF2( M, N, A, LDA, IPIV, INFO ) ELSE * * Use blocked code. * DO 20 J = 1, MIN( M, N ), NB JB = MIN( MIN( M, N )-J+1, NB ) * * Factor diagonal and subdiagonal blocks and test for exact * singularity. * CALL DGETF2( M-J+1, JB, A( J, J ), LDA, IPIV( J ), IINFO ) * * Adjust INFO and the pivot indices. * IF( INFO.EQ.0 .AND. IINFO.GT.0 ) $ INFO = IINFO + J - 1 DO 10 I = J, MIN( M, J+JB-1 ) IPIV( I ) = J - 1 + IPIV( I ) 10 CONTINUE * * Apply interchanges to columns 1:J-1. * CALL DLASWP( J-1, A, LDA, J, J+JB-1, IPIV, 1 ) * IF( J+JB.LE.N ) THEN * * Apply interchanges to columns J+JB:N. * CALL DLASWP( N-J-JB+1, A( 1, J+JB ), LDA, J, J+JB-1, $ IPIV, 1 ) * * Compute block row of U. * CALL DTRSM( 'Left', 'Lower', 'No transpose', 'Unit', JB, $ N-J-JB+1, ONE, A( J, J ), LDA, A( J, J+JB ), $ LDA ) IF( J+JB.LE.M ) THEN * * Update trailing submatrix. * CALL DGEMM( 'No transpose', 'No transpose', M-J-JB+1, $ N-J-JB+1, JB, -ONE, A( J+JB, J ), LDA, $ A( J, J+JB ), LDA, ONE, A( J+JB, J+JB ), $ LDA ) END IF END IF 20 CONTINUE END IF RETURN * * End of DGETRF * END octave-1.1.0/libcruft/lapack/dgetrs.f100666 415 17 10246 5310240625 15663 0ustar jweusers SUBROUTINE DGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER TRANS INTEGER INFO, LDA, LDB, N, NRHS * .. * .. Array Arguments .. INTEGER IPIV( * ) DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * DGETRS solves a system of linear equations * A * X = B or A' * X = B * with a general n by n matrix A using the LU factorization computed * by DGETRF. * * Arguments * ========= * * TRANS (input) CHARACTER*1 * Specifies the form of the system of equations. * = 'N': A * X = B (No transpose) * = 'T': A'* X = B (Transpose) * = 'C': A'* X = B (Conjugate transpose = Transpose) * * N (input) INTEGER * The order of the matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrix B. NRHS >= 0. * * A (input) DOUBLE PRECISION array, dimension (LDA,N) * The factors L and U from the factorization A = P*L*U * as computed by DGETRF. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * IPIV (input) INTEGER array, dimension (N) * The pivot indices from DGETRF; for 1<=i<=N, row i of the * matrix was interchanged with row IPIV(i). * * B (input/output) DOUBLE PRECISION array, dimension (LDB,NRHS) * On entry, the right hand side vectors B for the system of * linear equations. * On exit, the solution vectors, X. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL NOTRAN * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DLASWP, DTRSM, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 NOTRAN = LSAME( TRANS, 'N' ) IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) .AND. .NOT. $ LSAME( TRANS, 'C' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NRHS.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DGETRS', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 .OR. NRHS.EQ.0 ) $ RETURN * IF( NOTRAN ) THEN * * Solve A * X = B. * * Apply row interchanges to the right hand sides. * CALL DLASWP( NRHS, B, LDB, 1, N, IPIV, 1 ) * * Solve L*X = B, overwriting B with X. * CALL DTRSM( 'Left', 'Lower', 'No transpose', 'Unit', N, NRHS, $ ONE, A, LDA, B, LDB ) * * Solve U*X = B, overwriting B with X. * CALL DTRSM( 'Left', 'Upper', 'No transpose', 'Non-unit', N, $ NRHS, ONE, A, LDA, B, LDB ) ELSE * * Solve A' * X = B. * * Solve U'*X = B, overwriting B with X. * CALL DTRSM( 'Left', 'Upper', 'Transpose', 'Non-unit', N, NRHS, $ ONE, A, LDA, B, LDB ) * * Solve L'*X = B, overwriting B with X. * CALL DTRSM( 'Left', 'Lower', 'Transpose', 'Unit', N, NRHS, ONE, $ A, LDA, B, LDB ) * * Apply row interchanges to the solution vectors. * CALL DLASWP( NRHS, B, LDB, 1, N, IPIV, -1 ) END IF * RETURN * * End of DGETRS * END octave-1.1.0/libcruft/lapack/dhseqr.f100666 415 17 36345 5306544262 15702 0ustar jweusers SUBROUTINE DHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, WR, WI, Z, $ LDZ, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER COMPZ, JOB INTEGER IHI, ILO, INFO, LDH, LDZ, LWORK, N * .. * .. Array Arguments .. DOUBLE PRECISION H( LDH, * ), WI( * ), WORK( * ), WR( * ), $ Z( LDZ, * ) * .. * * Purpose * ======= * * DHSEQR computes the eigenvalues of a real upper Hessenberg matrix H * and, optionally, the matrices T and Z from the Schur decomposition * H = Z T Z', where T is an upper quasi-triangular matrix (the Schur * form), Z is the orthogonal matrix of Schur vectors, and Z' denotes * the transpose of Z. * * Optionally Z may be postmultiplied into an input orthogonal matrix Q, * so that this routine can give the Schur factorization of a matrix A * which has been reduced to the Hessenberg form H by the orthogonal * matrix Q: A = Q*H*Q' = (QZ)*T*(QZ)'. * * Arguments * ========= * * JOB (input) CHARACTER*1 * = 'E': compute eigenvalues only; * = 'S': compute eigenvalues and the Schur form T. * * COMPZ (input) CHARACTER*1 * = 'N': no Schur vectors are computed; * = 'I': Z is initialized to the unit matrix and the matrix Z * of Schur vectors of H is returned; * = 'V': Z must contain an orthogonal matrix Q on entry, and * the product Q*Z is returned. * * N (input) INTEGER * The order of the matrix H. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that H is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to DGEBAL, and then passed to SGEHRD * when the matrix output by DGEBAL is reduced to Hessenberg * form. Otherwise ILO and IHI should be set to 1 and N * respectively. * 1 <= ILO <= max(1,IHI); IHI <= N. * * H (input/output) DOUBLE PRECISION array, dimension (LDH,N) * On entry, the upper Hessenberg matrix H. * On exit, if JOB = 'S', H contains the upper quasi-triangular * matrix T from the Schur decomposition (the Schur form); * 2-by-2 diagonal blocks (corresponding to complex conjugate * pairs of eigenvalues) are returned in standard form, with * H(i,i) = H(i+1,i+1) and H(i+1,i)*H(i,i+1) < 0. If JOB = 'E', * the contents of H are unspecified on exit. * * LDH (input) INTEGER * The leading dimension of the array H. LDH >= max(1,N). * * WR (output) DOUBLE PRECISION array, dimension (N) * WI (output) DOUBLE PRECISION array, dimension (N) * The real and imaginary parts, respectively, of the computed * eigenvalues. If two eigenvalues are computed as a complex * conjugate pair, they are stored in consecutive elements of * WR and WI, say the i-th and (i+1)th, with WI(i) > 0 and * WI(i+1) < 0. If JOB = 'S', the eigenvalues are stored in the * same order as on the diagonal of the Schur form returned in * H, with WR(i) = H(i,i) and, if H(i:i+1,i:i+1) is a 2-by-2 * diagonal block, WI(i) = sqrt(H(i+1,i)*H(i,i+1)) and * WI(i+1) = -WI(i). * * Z (input/output) DOUBLE PRECISION array, dimension (LDZ,N) * If COMPZ = 'N': Z is not referenced. * If COMPZ = 'I': on entry, Z need not be set, and on exit, Z * contains the orthogonal matrix Z of the Schur vectors of H. * If COMPZ = 'V': on entry Z must contain an n-by-n matrix Q, * which is assumed to be equal to the unit matrix except for * the submatrix Z(ILO:IHI,ILO:IHI); on exit Z contains Q*Z. * Normally Q is the orthogonal matrix generated by DORGHR after * the call to DGEHRD which formed the Hessenberg matrix H. * * LDZ (input) INTEGER * The leading dimension of the array Z. * LDZ >= max(1,N) if COMPZ = 'I' or 'V'; LDZ >= 1 otherwise. * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * LWORK (input) INTEGER * This argument is redundant. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * > 0: DHSEQR failed to compute all the eigenvalues in a total * of 30*(IHI-ILO+1) iterations; if INFO = i, elements * 1:ilo-1 and i+1:n of WR and WI contain those * eigenvalues which have been successfully computed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE, TWO PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, TWO = 2.0D+0 ) DOUBLE PRECISION CONST PARAMETER ( CONST = 1.5D+0 ) INTEGER NSMAX, LDS PARAMETER ( NSMAX = 15, LDS = NSMAX ) * .. * .. Local Scalars .. LOGICAL INITZ, WANTT, WANTZ INTEGER I, I1, I2, IERR, II, ITEMP, ITN, ITS, J, K, L, $ MAXB, NH, NR, NS, NV DOUBLE PRECISION ABSW, OVFL, SMLNUM, TAU, TEMP, TST1, ULP, UNFL * .. * .. Local Arrays .. DOUBLE PRECISION S( LDS, NSMAX ), V( NSMAX+1 ), VV( NSMAX+1 ) * .. * .. External Functions .. LOGICAL LSAME INTEGER IDAMAX, ILAENV DOUBLE PRECISION DLAMCH, DLANHS, DLAPY2 EXTERNAL LSAME, IDAMAX, ILAENV, DLAMCH, DLANHS, DLAPY2 * .. * .. External Subroutines .. EXTERNAL DCOPY, DGEMV, DLABAD, DLACPY, DLAHQR, DLARFG, $ DLARFX, DLASET, DSCAL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN * .. * .. Executable Statements .. * * Decode and test the input parameters * WANTT = LSAME( JOB, 'S' ) INITZ = LSAME( COMPZ, 'I' ) WANTZ = INITZ .OR. LSAME( COMPZ, 'V' ) * INFO = 0 IF( .NOT.LSAME( JOB, 'E' ) .AND. .NOT.WANTT ) THEN INFO = -1 ELSE IF( .NOT.LSAME( COMPZ, 'N' ) .AND. .NOT.WANTZ ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -5 ELSE IF( LDH.LT.MAX( 1, N ) ) THEN INFO = -7 ELSE IF( LDZ.LT.1 .OR. WANTZ .AND. LDZ.LT.MAX( 1, N ) ) THEN INFO = -11 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DHSEQR', -INFO ) RETURN END IF * * Initialize Z, if necessary * IF( INITZ ) $ CALL DLASET( 'Full', N, N, ZERO, ONE, Z, LDZ ) * * Store the eigenvalues isolated by DGEBAL. * DO 10 I = 1, ILO - 1 WR( I ) = H( I, I ) WI( I ) = ZERO 10 CONTINUE DO 20 I = IHI + 1, N WR( I ) = H( I, I ) WI( I ) = ZERO 20 CONTINUE * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN IF( ILO.EQ.IHI ) THEN WR( ILO ) = H( ILO, ILO ) WI( ILO ) = ZERO RETURN END IF * * Set rows and columns ILO to IHI to zero below the first * subdiagonal. * DO 40 J = ILO, IHI - 2 DO 30 I = J + 2, N H( I, J ) = ZERO 30 CONTINUE 40 CONTINUE NH = IHI - ILO + 1 * * Determine the order of the multi-shift QR algorithm to be used. * NS = ILAENV( 4, 'DHSEQR', JOB // COMPZ, N, ILO, IHI, -1 ) MAXB = ILAENV( 8, 'DHSEQR', JOB // COMPZ, N, ILO, IHI, -1 ) IF( NS.LE.2 .OR. NS.GT.NH .OR. MAXB.GE.NH ) THEN * * Use the standard double-shift algorithm * CALL DLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, ILO, $ IHI, Z, LDZ, INFO ) RETURN END IF MAXB = MAX( 3, MAXB ) NS = MIN( NS, MAXB, NSMAX ) * * Now 2 < NS <= MAXB < NH. * * Set machine-dependent constants for the stopping criterion. * If norm(H) <= sqrt(OVFL), overflow should not occur. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = ONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( NH / ULP ) * * I1 and I2 are the indices of the first row and last column of H * to which transformations must be applied. If eigenvalues only are * being computed, I1 and I2 are set inside the main loop. * IF( WANTT ) THEN I1 = 1 I2 = N END IF * * ITN is the total number of multiple-shift QR iterations allowed. * ITN = 30*NH * * The main loop begins here. I is the loop index and decreases from * IHI to ILO in steps of at most MAXB. Each iteration of the loop * works with the active submatrix in rows and columns L to I. * Eigenvalues I+1 to IHI have already converged. Either L = ILO or * H(L,L-1) is negligible so that the matrix splits. * I = IHI 50 CONTINUE L = ILO IF( I.LT.ILO ) $ GO TO 170 * * Perform multiple-shift QR iterations on rows and columns ILO to I * until a submatrix of order at most MAXB splits off at the bottom * because a subdiagonal element has become negligible. * DO 150 ITS = 0, ITN * * Look for a single small subdiagonal element. * DO 60 K = I, L + 1, -1 TST1 = ABS( H( K-1, K-1 ) ) + ABS( H( K, K ) ) IF( TST1.EQ.ZERO ) $ TST1 = DLANHS( '1', I-L+1, H( L, L ), LDH, WORK ) IF( ABS( H( K, K-1 ) ).LE.MAX( ULP*TST1, SMLNUM ) ) $ GO TO 70 60 CONTINUE 70 CONTINUE L = K IF( L.GT.ILO ) THEN * * H(L,L-1) is negligible. * H( L, L-1 ) = ZERO END IF * * Exit from loop if a submatrix of order <= MAXB has split off. * IF( L.GE.I-MAXB+1 ) $ GO TO 160 * * Now the active submatrix is in rows and columns L to I. If * eigenvalues only are being computed, only the active submatrix * need be transformed. * IF( .NOT.WANTT ) THEN I1 = L I2 = I END IF * IF( ITS.EQ.20 .OR. ITS.EQ.30 ) THEN * * Exceptional shifts. * DO 80 II = I - NS + 1, I WR( II ) = CONST*( ABS( H( II, II-1 ) )+ $ ABS( H( II, II ) ) ) WI( II ) = ZERO 80 CONTINUE ELSE * * Use eigenvalues of trailing submatrix of order NS as shifts. * CALL DLACPY( 'Full', NS, NS, H( I-NS+1, I-NS+1 ), LDH, S, $ LDS ) CALL DLAHQR( .FALSE., .FALSE., NS, 1, NS, S, LDS, $ WR( I-NS+1 ), WI( I-NS+1 ), 1, NS, Z, LDZ, $ IERR ) IF( IERR.GT.0 ) THEN * * If DLAHQR failed to compute all NS eigenvalues, use the * unconverged diagonal elements as the remaining shifts. * DO 90 II = 1, IERR WR( I-NS+II ) = S( II, II ) WI( I-NS+II ) = ZERO 90 CONTINUE END IF END IF * * Form the first column of (G-w(1)) (G-w(2)) . . . (G-w(ns)) * where G is the Hessenberg submatrix H(L:I,L:I) and w is * the vector of shifts (stored in WR and WI). The result is * stored in the local array V. * V( 1 ) = ONE DO 100 II = 2, NS + 1 V( II ) = ZERO 100 CONTINUE NV = 1 DO 120 J = I - NS + 1, I IF( WI( J ).GE.ZERO ) THEN IF( WI( J ).EQ.ZERO ) THEN * * real shift * CALL DCOPY( NV+1, V, 1, VV, 1 ) CALL DGEMV( 'No transpose', NV+1, NV, ONE, H( L, L ), $ LDH, VV, 1, -WR( J ), V, 1 ) NV = NV + 1 ELSE IF( WI( J ).GT.ZERO ) THEN * * complex conjugate pair of shifts * CALL DCOPY( NV+1, V, 1, VV, 1 ) CALL DGEMV( 'No transpose', NV+1, NV, ONE, H( L, L ), $ LDH, V, 1, -TWO*WR( J ), VV, 1 ) ITEMP = IDAMAX( NV+1, VV, 1 ) TEMP = ONE / MAX( ABS( VV( ITEMP ) ), SMLNUM ) CALL DSCAL( NV+1, TEMP, VV, 1 ) ABSW = DLAPY2( WR( J ), WI( J ) ) TEMP = ( TEMP*ABSW )*ABSW CALL DGEMV( 'No transpose', NV+2, NV+1, ONE, $ H( L, L ), LDH, VV, 1, TEMP, V, 1 ) NV = NV + 2 END IF * * Scale V(1:NV) so that max(abs(V(i))) = 1. If V is zero, * reset it to the unit vector. * ITEMP = IDAMAX( NV, V, 1 ) TEMP = ABS( V( ITEMP ) ) IF( TEMP.EQ.ZERO ) THEN V( 1 ) = ONE DO 110 II = 2, NV V( II ) = ZERO 110 CONTINUE ELSE TEMP = MAX( TEMP, SMLNUM ) CALL DSCAL( NV, ONE / TEMP, V, 1 ) END IF END IF 120 CONTINUE * * Multiple-shift QR step * DO 140 K = L, I - 1 * * The first iteration of this loop determines a reflection G * from the vector V and applies it from left and right to H, * thus creating a nonzero bulge below the subdiagonal. * * Each subsequent iteration determines a reflection G to * restore the Hessenberg form in the (K-1)th column, and thus * chases the bulge one step toward the bottom of the active * submatrix. NR is the order of G. * NR = MIN( NS+1, I-K+1 ) IF( K.GT.L ) $ CALL DCOPY( NR, H( K, K-1 ), 1, V, 1 ) CALL DLARFG( NR, V( 1 ), V( 2 ), 1, TAU ) IF( K.GT.L ) THEN H( K, K-1 ) = V( 1 ) DO 130 II = K + 1, I H( II, K-1 ) = ZERO 130 CONTINUE END IF V( 1 ) = ONE * * Apply G from the left to transform the rows of the matrix in * columns K to I2. * CALL DLARFX( 'Left', NR, I2-K+1, V, TAU, H( K, K ), LDH, $ WORK ) * * Apply G from the right to transform the columns of the * matrix in rows I1 to min(K+NR,I). * CALL DLARFX( 'Right', MIN( K+NR, I )-I1+1, NR, V, TAU, $ H( I1, K ), LDH, WORK ) * IF( WANTZ ) THEN * * Accumulate transformations in the matrix Z * CALL DLARFX( 'Right', NH, NR, V, TAU, Z( ILO, K ), LDZ, $ WORK ) END IF 140 CONTINUE * 150 CONTINUE * * Failure to converge in remaining number of iterations * INFO = I RETURN * 160 CONTINUE * * A submatrix of order <= MAXB in rows and columns L to I has split * off. Use the double-shift QR algorithm to handle it. * CALL DLAHQR( WANTT, WANTZ, N, L, I, H, LDH, WR, WI, ILO, IHI, Z, $ LDZ, INFO ) IF( INFO.GT.0 ) $ RETURN * * Decrement number of remaining iterations, and return to start of * the main loop with a new value of I. * ITN = ITN - ITS I = L - 1 GO TO 50 * 170 CONTINUE RETURN * * End of DHSEQR * END octave-1.1.0/libcruft/lapack/dlabad.f100666 415 17 3521 5306544263 15572 0ustar jweusers SUBROUTINE DLABAD( SMALL, LARGE ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION LARGE, SMALL * .. * * Purpose * ======= * * DLABAD takes as input the values computed by SLAMCH for underflow and * overflow, and returns the square root of each of these values if the * log of LARGE is sufficiently large. This subroutine is intended to * identify machines with a large exponent range, such as the Crays, and * redefine the underflow and overflow limits to be the square roots of * the values computed by DLAMCH. This subroutine is needed because * DLAMCH does not compensate for poor arithmetic in the upper half of * the exponent range, as is found on a Cray. * * Arguments * ========= * * SMALL (input/output) DOUBLE PRECISION * On entry, the underflow threshold as computed by DLAMCH. * On exit, if LOG10(LARGE) is sufficiently large, the square * root of SMALL, otherwise unchanged. * * LARGE (input/output) DOUBLE PRECISION * On entry, the overflow threshold as computed by DLAMCH. * On exit, if LOG10(LARGE) is sufficiently large, the square * root of LARGE, otherwise unchanged. * * ===================================================================== * * .. Intrinsic Functions .. INTRINSIC LOG10, SQRT * .. * .. Executable Statements .. * * If it looks like we're on a Cray, take the square root of * SMALL and LARGE to avoid overflow and underflow problems. * IF( LOG10( LARGE ).GT.2000.D0 ) THEN SMALL = SQRT( SMALL ) LARGE = SQRT( LARGE ) END IF * RETURN * * End of DLABAD * END octave-1.1.0/libcruft/lapack/dlabrd.f100666 415 17 26645 5306544271 15646 0ustar jweusers SUBROUTINE DLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, $ LDY ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER LDA, LDX, LDY, M, N, NB * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), D( * ), E( * ), TAUP( * ), $ TAUQ( * ), X( LDX, * ), Y( LDY, * ) * .. * * Purpose * ======= * * DLABRD reduces the first NB rows and columns of a real general * m by n matrix A to upper or lower bidiagonal form by an orthogonal * transformation Q' * A * P, and returns the matrices X and Y which * are needed to apply the transformation to the unreduced part of A. * * If m >= n, A is reduced to upper bidiagonal form; if m < n, to lower * bidiagonal form. * * This is an auxiliary routine called by DGEBRD * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. * * N (input) INTEGER * The number of columns in the matrix A. * * NB (input) INTEGER * The number of leading rows and columns of A to be reduced. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, the first NB rows and columns of the matrix are * overwritten; the rest of the array is unchanged. * If m >= n, elements on and below the diagonal in the first NB * columns, with the array TAUQ, represent the orthogonal * matrix Q as a product of elementary reflectors; and * elements above the diagonal in the first NB rows, with the * array TAUP, represent the orthogonal matrix P as a product * of elementary reflectors. * If m < n, elements below the diagonal in the first NB * columns, with the array TAUQ, represent the orthogonal * matrix Q as a product of elementary reflectors, and * elements on and above the diagonal in the first NB rows, * with the array TAUP, represent the orthogonal matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (NB) * The diagonal elements of the first NB rows and columns of * the reduced matrix. D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (NB) * The off-diagonal elements of the first NB rows and columns of * the reduced matrix. * * TAUQ (output) DOUBLE PRECISION array dimension (NB) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix Q. See Further Details. * * TAUP (output) DOUBLE PRECISION array, dimension (NB) * The scalar factors of the elementary reflectors which * represent the orthogonal matrix P. See Further Details. * * X (output) DOUBLE PRECISION array, dimension (LDX,NB) * The m-by-nb matrix X required to update the unreduced part * of A. * * LDX (input) INTEGER * The leading dimension of the array X. LDX >= M. * * Y (output) DOUBLE PRECISION array, dimension (LDY,NB) * The n-by-nb matrix Y required to update the unreduced part * of A. * * LDY (output) INTEGER * The leading dimension of the array Y. LDY >= N. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * Q = H(1) H(2) . . . H(nb) and P = G(1) G(2) . . . G(nb) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are real scalars, and v and u are real vectors. * * If m >= n, v(1:i-1) = 0, v(i) = 1, and v(i:m) is stored on exit in * A(i:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+1:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, v(1:i) = 0, v(i+1) = 1, and v(i+1:m) is stored on exit in * A(i+2:m,i); u(1:i-1) = 0, u(i) = 1, and u(i:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * The elements of the vectors v and u together form the m-by-nb matrix * V and the nb-by-n matrix U' which are needed, with X and Y, to apply * the transformation to the unreduced part of the matrix, using a block * update of the form: A := A - V*Y' - X*U'. * * The contents of A on exit are illustrated by the following examples * with nb = 2: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( 1 1 u1 u1 u1 ) ( 1 u1 u1 u1 u1 u1 ) * ( v1 1 1 u2 u2 ) ( 1 1 u2 u2 u2 u2 ) * ( v1 v2 a a a ) ( v1 1 a a a a ) * ( v1 v2 a a a ) ( v1 v2 a a a a ) * ( v1 v2 a a a ) ( v1 v2 a a a a ) * ( v1 v2 a a a ) * * where a denotes an element of the original matrix which is unchanged, * vi denotes an element of the vector defining H(i), and ui an element * of the vector defining G(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. INTEGER I * .. * .. External Subroutines .. EXTERNAL DGEMV, DLARFG, DSCAL * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * * Quick return if possible * IF( M.LE.0 .OR. N.LE.0 ) $ RETURN * IF( M.GE.N ) THEN * * Reduce to upper bidiagonal form * DO 10 I = 1, NB * * Update A(i:m,i) * CALL DGEMV( 'No transpose', M-I+1, I-1, -ONE, A( I, 1 ), $ LDA, Y( I, 1 ), LDY, ONE, A( I, I ), 1 ) CALL DGEMV( 'No transpose', M-I+1, I-1, -ONE, X( I, 1 ), $ LDX, A( 1, I ), 1, ONE, A( I, I ), 1 ) * * Generate reflection Q(i) to annihilate A(i+1:m,i) * CALL DLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1, $ TAUQ( I ) ) D( I ) = A( I, I ) IF( I.LT.N ) THEN A( I, I ) = ONE * * Compute Y(i+1:n,i) * CALL DGEMV( 'Transpose', M-I+1, N-I, ONE, A( I, I+1 ), $ LDA, A( I, I ), 1, ZERO, Y( I+1, I ), 1 ) CALL DGEMV( 'Transpose', M-I+1, I-1, ONE, A( I, 1 ), LDA, $ A( I, I ), 1, ZERO, Y( 1, I ), 1 ) CALL DGEMV( 'No transpose', N-I, I-1, -ONE, Y( I+1, 1 ), $ LDY, Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL DGEMV( 'Transpose', M-I+1, I-1, ONE, X( I, 1 ), LDX, $ A( I, I ), 1, ZERO, Y( 1, I ), 1 ) CALL DGEMV( 'Transpose', I-1, N-I, -ONE, A( 1, I+1 ), $ LDA, Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL DSCAL( N-I, TAUQ( I ), Y( I+1, I ), 1 ) * * Update A(i,i+1:n) * CALL DGEMV( 'No transpose', N-I, I, -ONE, Y( I+1, 1 ), $ LDY, A( I, 1 ), LDA, ONE, A( I, I+1 ), LDA ) CALL DGEMV( 'Transpose', I-1, N-I, -ONE, A( 1, I+1 ), $ LDA, X( I, 1 ), LDX, ONE, A( I, I+1 ), LDA ) * * Generate reflection P(i) to annihilate A(i,i+2:n) * CALL DLARFG( N-I, A( I, I+1 ), A( I, MIN( I+2, N ) ), $ LDA, TAUP( I ) ) E( I ) = A( I, I+1 ) A( I, I+1 ) = ONE * * Compute X(i+1:m,i) * CALL DGEMV( 'No transpose', M-I, N-I, ONE, A( I+1, I+1 ), $ LDA, A( I, I+1 ), LDA, ZERO, X( I+1, I ), 1 ) CALL DGEMV( 'Transpose', N-I, I, ONE, Y( I+1, 1 ), LDY, $ A( I, I+1 ), LDA, ZERO, X( 1, I ), 1 ) CALL DGEMV( 'No transpose', M-I, I, -ONE, A( I+1, 1 ), $ LDA, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL DGEMV( 'No transpose', I-1, N-I, ONE, A( 1, I+1 ), $ LDA, A( I, I+1 ), LDA, ZERO, X( 1, I ), 1 ) CALL DGEMV( 'No transpose', M-I, I-1, -ONE, X( I+1, 1 ), $ LDX, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL DSCAL( M-I, TAUP( I ), X( I+1, I ), 1 ) END IF 10 CONTINUE ELSE * * Reduce to lower bidiagonal form * DO 20 I = 1, NB * * Update A(i,i:n) * CALL DGEMV( 'No transpose', N-I+1, I-1, -ONE, Y( I, 1 ), $ LDY, A( I, 1 ), LDA, ONE, A( I, I ), LDA ) CALL DGEMV( 'Transpose', I-1, N-I+1, -ONE, A( 1, I ), LDA, $ X( I, 1 ), LDX, ONE, A( I, I ), LDA ) * * Generate reflection P(i) to annihilate A(i,i+1:n) * CALL DLARFG( N-I+1, A( I, I ), A( I, MIN( I+1, N ) ), LDA, $ TAUP( I ) ) D( I ) = A( I, I ) IF( I.LT.M ) THEN A( I, I ) = ONE * * Compute X(i+1:m,i) * CALL DGEMV( 'No transpose', M-I, N-I+1, ONE, A( I+1, I ), $ LDA, A( I, I ), LDA, ZERO, X( I+1, I ), 1 ) CALL DGEMV( 'Transpose', N-I+1, I-1, ONE, Y( I, 1 ), LDY, $ A( I, I ), LDA, ZERO, X( 1, I ), 1 ) CALL DGEMV( 'No transpose', M-I, I-1, -ONE, A( I+1, 1 ), $ LDA, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL DGEMV( 'No transpose', I-1, N-I+1, ONE, A( 1, I ), $ LDA, A( I, I ), LDA, ZERO, X( 1, I ), 1 ) CALL DGEMV( 'No transpose', M-I, I-1, -ONE, X( I+1, 1 ), $ LDX, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL DSCAL( M-I, TAUP( I ), X( I+1, I ), 1 ) * * Update A(i+1:m,i) * CALL DGEMV( 'No transpose', M-I, I-1, -ONE, A( I+1, 1 ), $ LDA, Y( I, 1 ), LDY, ONE, A( I+1, I ), 1 ) CALL DGEMV( 'No transpose', M-I, I, -ONE, X( I+1, 1 ), $ LDX, A( 1, I ), 1, ONE, A( I+1, I ), 1 ) * * Generate reflection Q(i) to annihilate A(i+2:m,i) * CALL DLARFG( M-I, A( I+1, I ), A( MIN( I+2, M ), I ), 1, $ TAUQ( I ) ) E( I ) = A( I+1, I ) A( I+1, I ) = ONE * * Compute Y(i+1:n,i) * CALL DGEMV( 'Transpose', M-I, N-I, ONE, A( I+1, I+1 ), $ LDA, A( I+1, I ), 1, ZERO, Y( I+1, I ), 1 ) CALL DGEMV( 'Transpose', M-I, I-1, ONE, A( I+1, 1 ), LDA, $ A( I+1, I ), 1, ZERO, Y( 1, I ), 1 ) CALL DGEMV( 'No transpose', N-I, I-1, -ONE, Y( I+1, 1 ), $ LDY, Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL DGEMV( 'Transpose', M-I, I, ONE, X( I+1, 1 ), LDX, $ A( I+1, I ), 1, ZERO, Y( 1, I ), 1 ) CALL DGEMV( 'Transpose', I, N-I, -ONE, A( 1, I+1 ), LDA, $ Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL DSCAL( N-I, TAUQ( I ), Y( I+1, I ), 1 ) END IF 20 CONTINUE END IF RETURN * * End of DLABRD * END octave-1.1.0/libcruft/lapack/dlarf.f100666 415 17 6057 5306544264 15463 0ustar jweusers SUBROUTINE DLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE INTEGER INCV, LDC, M, N DOUBLE PRECISION TAU * .. * .. Array Arguments .. DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * * Purpose * ======= * * DLARF applies a real elementary reflector H to a real m by n matrix * C, from either the left or the right. H is represented in the form * * H = I - tau * v * v' * * where tau is a real scalar and v is a real vector. * * If tau = 0, then H is taken to be the unit matrix. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': form H * C * = 'R': form C * H * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * V (input) DOUBLE PRECISION array, dimension * (1 + (M-1)*abs(INCV)) if SIDE = 'L' * or (1 + (N-1)*abs(INCV)) if SIDE = 'R' * The vector v in the representation of H. V is not used if * TAU = 0. * * INCV (input) INTEGER * The increment between elements of v. INCV <> 0. * * TAU (input) DOUBLE PRECISION * The value tau in the representation of H. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by the matrix H * C if SIDE = 'L', * or C * H if SIDE = 'R'. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension * (N) if SIDE = 'L' * or (M) if SIDE = 'R' * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. External Subroutines .. EXTERNAL DGEMV, DGER * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Executable Statements .. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C * IF( TAU.NE.ZERO ) THEN * * w := C' * v * CALL DGEMV( 'Transpose', M, N, ONE, C, LDC, V, INCV, ZERO, $ WORK, 1 ) * * C := C - v * w' * CALL DGER( M, N, -TAU, V, INCV, WORK, 1, C, LDC ) END IF ELSE * * Form C * H * IF( TAU.NE.ZERO ) THEN * * w := C * v * CALL DGEMV( 'No transpose', M, N, ONE, C, LDC, V, INCV, $ ZERO, WORK, 1 ) * * C := C - w * v' * CALL DGER( M, N, -TAU, WORK, 1, V, INCV, C, LDC ) END IF END IF RETURN * * End of DLARF * END octave-1.1.0/libcruft/lapack/dlacon.f100666 415 17 12213 5412145357 15640 0ustar jweusers SUBROUTINE DLACON( N, V, X, ISGN, EST, KASE ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER KASE, N DOUBLE PRECISION EST * .. * .. Array Arguments .. INTEGER ISGN( * ) DOUBLE PRECISION V( * ), X( * ) * .. * * Purpose * ======= * * DLACON estimates the 1-norm of a square, real matrix A. * Reverse communication is used for evaluating matrix-vector products. * * Arguments * ========= * * N (input) INTEGER * The order of the matrix. N >= 1. * * V (workspace) DOUBLE PRECISION array, dimension (N) * On the final return, V = A*W, where EST = norm(V)/norm(W) * (W is not returned). * * X (input/output) DOUBLE PRECISION array, dimension (N) * On an intermediate return, X should be overwritten by * A * X, if KASE=1, * A' * X, if KASE=2, * and DLACON must be re-called with all the other parameters * unchanged. * * ISGN (workspace) INTEGER array, dimension (N) * * EST (output) DOUBLE PRECISION * An estimate (a lower bound) for norm(A). * * KASE (input/output) INTEGER * On the initial call to DLACON, KASE should be 0. * On an intermediate return, KASE will be 1 or 2, indicating * whether X should be overwritten by A * X or A' * X. * On the final return from DLACON, KASE will again be 0. * * Further Details * ======= ======= * * Contributed by Nick Higham, University of Manchester. * Originally named SONEST, dated March 16, 1988. * * Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of * a real or complex matrix, with applications to condition estimation", * ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. * * ===================================================================== * * .. Parameters .. INTEGER ITMAX PARAMETER ( ITMAX = 5 ) DOUBLE PRECISION ZERO, ONE, TWO PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0, TWO = 2.0D+0 ) * .. * .. Local Scalars .. INTEGER I, ITER, J, JLAST, JUMP DOUBLE PRECISION ALTSGN, ESTOLD, TEMP * .. * .. External Functions .. INTEGER IDAMAX DOUBLE PRECISION DASUM EXTERNAL IDAMAX, DASUM * .. * .. External Subroutines .. EXTERNAL DCOPY * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, NINT, SIGN * .. * .. Save statement .. SAVE * .. * .. Executable Statements .. * IF( KASE.EQ.0 ) THEN DO 10 I = 1, N X( I ) = ONE / DBLE( N ) 10 CONTINUE KASE = 1 JUMP = 1 RETURN END IF * GO TO ( 20, 40, 70, 110, 140 )JUMP * * ................ ENTRY (JUMP = 1) * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY A*X. * 20 CONTINUE IF( N.EQ.1 ) THEN V( 1 ) = X( 1 ) EST = ABS( V( 1 ) ) * ... QUIT GO TO 150 END IF EST = DASUM( N, X, 1 ) * DO 30 I = 1, N X( I ) = SIGN( ONE, X( I ) ) ISGN( I ) = NINT( X( I ) ) 30 CONTINUE KASE = 2 JUMP = 2 RETURN * * ................ ENTRY (JUMP = 2) * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY TRANDPOSE(A)*X. * 40 CONTINUE J = IDAMAX( N, X, 1 ) ITER = 2 * * MAIN LOOP - ITERATIONS 2,3,...,ITMAX. * 50 CONTINUE DO 60 I = 1, N X( I ) = ZERO 60 CONTINUE X( J ) = ONE KASE = 1 JUMP = 3 RETURN * * ................ ENTRY (JUMP = 3) * X HAS BEEN OVERWRITTEN BY A*X. * 70 CONTINUE CALL DCOPY( N, X, 1, V, 1 ) ESTOLD = EST EST = DASUM( N, V, 1 ) DO 80 I = 1, N IF( NINT( SIGN( ONE, X( I ) ) ).NE.ISGN( I ) ) $ GO TO 90 80 CONTINUE * REPEATED SIGN VECTOR DETECTED, HENCE ALGORITHM HAS CONVERGED. GO TO 120 * 90 CONTINUE * TEST FOR CYCLING. IF( EST.LE.ESTOLD ) $ GO TO 120 * DO 100 I = 1, N X( I ) = SIGN( ONE, X( I ) ) ISGN( I ) = NINT( X( I ) ) 100 CONTINUE KASE = 2 JUMP = 4 RETURN * * ................ ENTRY (JUMP = 4) * X HAS BEEN OVERWRITTEN BY TRANDPOSE(A)*X. * 110 CONTINUE JLAST = J J = IDAMAX( N, X, 1 ) IF( ( X( JLAST ).NE.ABS( X( J ) ) ) .AND. ( ITER.LT.ITMAX ) ) THEN ITER = ITER + 1 GO TO 50 END IF * * ITERATION COMPLETE. FINAL STAGE. * 120 CONTINUE ALTSGN = ONE DO 130 I = 1, N X( I ) = ALTSGN*( ONE+DBLE( I-1 ) / DBLE( N-1 ) ) ALTSGN = -ALTSGN 130 CONTINUE KASE = 1 JUMP = 5 RETURN * * ................ ENTRY (JUMP = 5) * X HAS BEEN OVERWRITTEN BY A*X. * 140 CONTINUE TEMP = TWO*( DASUM( N, X, 1 ) / DBLE( 3*N ) ) IF( TEMP.GT.EST ) THEN CALL DCOPY( N, X, 1, V, 1 ) EST = TEMP END IF * 150 CONTINUE KASE = 0 RETURN * * End of DLACON * END octave-1.1.0/libcruft/lapack/dlacpy.f100666 415 17 4627 5306544262 15646 0ustar jweusers SUBROUTINE DLACPY( UPLO, M, N, A, LDA, B, LDB ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER LDA, LDB, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * DLACPY copies all or part of a two-dimensional matrix A to another * matrix B. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies the part of the matrix A to be copied to B. * = 'U': Upper triangular part * = 'L': Lower triangular part * Otherwise: All of the matrix A * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input) DOUBLE PRECISION array, dimension (LDA,N) * The m by n matrix A. If UPLO = 'U', only the upper triangle * or trapezoid is accessed; if UPLO = 'L', only the lower * triangle or trapezoid is accessed. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * B (output) DOUBLE PRECISION array, dimension (LDB,N) * On exit, B = A in the locations specified by UPLO. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,M). * * ===================================================================== * * .. Local Scalars .. INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * IF( LSAME( UPLO, 'U' ) ) THEN DO 20 J = 1, N DO 10 I = 1, MIN( J, M ) B( I, J ) = A( I, J ) 10 CONTINUE 20 CONTINUE ELSE IF( LSAME( UPLO, 'L' ) ) THEN DO 40 J = 1, N DO 30 I = J, M B( I, J ) = A( I, J ) 30 CONTINUE 40 CONTINUE ELSE DO 60 J = 1, N DO 50 I = 1, M B( I, J ) = A( I, J ) 50 CONTINUE 60 CONTINUE END IF RETURN * * End of DLACPY * END octave-1.1.0/libcruft/lapack/dladiv.f100666 415 17 3026 5306544262 15625 0ustar jweusers SUBROUTINE DLADIV( A, B, C, D, P, Q ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION A, B, C, D, P, Q * .. * * Purpose * ======= * * DLADIV performs complex division in real arithmetic * * a + i*b * p + i*q = --------- * c + i*d * * The algorithm is due to Robert L. Smith and can be found * in D. Knuth, The art of Computer Programming, Vol.2, p.195 * * Arguments * ========= * * A (input) DOUBLE PRECISION * B (input) DOUBLE PRECISION * C (input) DOUBLE PRECISION * D (input) DOUBLE PRECISION * The scalars a, b, c, and d in the above expression. * * P (output) DOUBLE PRECISION * Q (output) DOUBLE PRECISION * The scalars p and q in the above expression. * * ===================================================================== * * .. Local Scalars .. DOUBLE PRECISION E, F * .. * .. Intrinsic Functions .. INTRINSIC ABS * .. * .. Executable Statements .. * IF( ABS( D ).LT.ABS( C ) ) THEN E = D / C F = C + D*E P = ( A+B*E ) / F Q = ( B-A*E ) / F ELSE E = C / D F = D + C*E P = ( B+A*E ) / F Q = ( -A+B*E ) / F END IF * RETURN * * End of DLADIV * END octave-1.1.0/libcruft/lapack/dlaexc.f100666 415 17 25057 5412145361 15645 0ustar jweusers SUBROUTINE DLAEXC( WANTQ, N, T, LDT, Q, LDQ, J1, N1, N2, WORK, $ INFO ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. LOGICAL WANTQ INTEGER INFO, J1, LDQ, LDT, N, N1, N2 * .. * .. Array Arguments .. DOUBLE PRECISION Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * * Purpose * ======= * * DLAEXC swaps adjacent diagonal blocks T11 and T22 of order 1 or 2 in * an upper quasi-triangular matrix T by an orthogonal similarity * transformation. * * T must be in Schur canonical form, that is, block upper triangular * with 1-by-1 and 2-by-2 diagonal blocks; each 2-by-2 diagonal block * has its diagonal elemnts equal and its off-diagonal elements of * opposite sign. * * Arguments * ========= * * WANTQ (input) LOGICAL * = .TRUE. : accumulate the transformation in the matrix Q; * = .FALSE.: do not accumulate the transformation. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) DOUBLE PRECISION array, dimension (LDT,N) * On entry, the upper quasi-triangular matrix T, in Schur * canonical form. * On exit, the updated matrix T, again in Schur canonical form. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * Q (input/output) DOUBLE PRECISION array, dimension (LDQ,N) * On entry, if WANTQ is .TRUE., the orthogonal matrix Q. * On exit, if WANTQ is .TRUE., the updated matrix Q. * If WANTQ is .FALSE., Q is not referenced. * * LDQ (input) INTEGER * The leading dimension of the array Q. * LDQ >= 1; and if WANTQ is .TRUE., LDQ >= N. * * J1 (input) INTEGER * The index of the first row of the first block T11. * * N1 (input) INTEGER * The order of the first block T11. N1 = 0, 1 or 2. * * N2 (input) INTEGER * The order of the second block T22. N2 = 0, 1 or 2. * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * = 1: the transformed matrix T would be too far from Schur * form; the blocks are not swapped and T and Q are * unchanged. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION TEN PARAMETER ( TEN = 1.0D+1 ) INTEGER LDD, LDX PARAMETER ( LDD = 4, LDX = 2 ) * .. * .. Local Scalars .. INTEGER IERR, J2, J3, J4, K, ND DOUBLE PRECISION CS, DNORM, EPS, SCALE, SMLNUM, SN, T11, T22, $ T33, TAU, TAU1, TAU2, TEMP, THRESH, WI1, WI2, $ WR1, WR2, XNORM * .. * .. Local Arrays .. DOUBLE PRECISION D( LDD, 4 ), U( 3 ), U1( 3 ), U2( 3 ), $ X( LDX, 2 ) * .. * .. External Functions .. DOUBLE PRECISION DLAMCH, DLANGE EXTERNAL DLAMCH, DLANGE * .. * .. External Subroutines .. EXTERNAL DLACPY, DLANV2, DLARFG, DLARFX, DLARTG, DLASY2, $ DROT * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX * .. * .. Executable Statements .. * INFO = 0 * * Quick return if possible * IF( N.EQ.0 .OR. N1.EQ.0 .OR. N2.EQ.0 ) $ RETURN IF( J1+N1.GT.N ) $ RETURN * J2 = J1 + 1 J3 = J1 + 2 J4 = J1 + 3 * IF( N1.EQ.1 .AND. N2.EQ.1 ) THEN * * Swap two 1-by-1 blocks. * T11 = T( J1, J1 ) T22 = T( J2, J2 ) * * Determine the transformation to perform the interchange. * CALL DLARTG( T( J1, J2 ), T22-T11, CS, SN, TEMP ) * * Apply transformation to the matrix T. * IF( J3.LE.N ) $ CALL DROT( N-J1-1, T( J1, J3 ), LDT, T( J2, J3 ), LDT, CS, $ SN ) CALL DROT( J1-1, T( 1, J1 ), 1, T( 1, J2 ), 1, CS, SN ) * T( J1, J1 ) = T22 T( J2, J2 ) = T11 * IF( WANTQ ) THEN * * Accumulate transformation in the matrix Q. * CALL DROT( N, Q( 1, J1 ), 1, Q( 1, J2 ), 1, CS, SN ) END IF * ELSE * * Swapping involves at least one 2-by-2 block. * * Copy the diagonal block of order N1+N2 to the local array D * and compute its norm. * ND = N1 + N2 CALL DLACPY( 'Full', ND, ND, T( J1, J1 ), LDT, D, LDD ) DNORM = DLANGE( 'Max', ND, ND, D, LDD, WORK ) * * Compute machine-dependent threshold for test for accepting * swap. * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) / EPS THRESH = MAX( TEN*EPS*DNORM, SMLNUM ) * * Solve T11*X - X*T22 = scale*T12 for X. * CALL DLASY2( .FALSE., .FALSE., -1, N1, N2, D, LDD, $ D( N1+1, N1+1 ), LDD, D( 1, N1+1 ), LDD, SCALE, X, $ LDX, XNORM, IERR ) * * Swap the adjacent diagonal blocks. * K = N1 + N1 + N2 - 3 GO TO ( 10, 20, 30 )K * 10 CONTINUE * * N1 = 1, N2 = 2: generate elementary reflector H so that: * * ( scale, X11, X12 ) H = ( 0, 0, * ) * U( 1 ) = SCALE U( 2 ) = X( 1, 1 ) U( 3 ) = X( 1, 2 ) CALL DLARFG( 3, U( 3 ), U, 1, TAU ) U( 3 ) = ONE T11 = T( J1, J1 ) * * Perform swap provisionally on diagonal block in D. * CALL DLARFX( 'L', 3, 3, U, TAU, D, LDD, WORK ) CALL DLARFX( 'R', 3, 3, U, TAU, D, LDD, WORK ) * * Test whether to reject swap. * IF( MAX( ABS( D( 3, 1 ) ), ABS( D( 3, 2 ) ), ABS( D( 3, $ 3 )-T11 ) ).GT.THRESH )GO TO 50 * * Accept swap: apply transformation to the entire matrix T. * CALL DLARFX( 'L', 3, N-J1+1, U, TAU, T( J1, J1 ), LDT, WORK ) CALL DLARFX( 'R', J2, 3, U, TAU, T( 1, J1 ), LDT, WORK ) * T( J3, J1 ) = ZERO T( J3, J2 ) = ZERO T( J3, J3 ) = T11 * IF( WANTQ ) THEN * * Accumulate transformation in the matrix Q. * CALL DLARFX( 'R', N, 3, U, TAU, Q( 1, J1 ), LDQ, WORK ) END IF GO TO 40 * 20 CONTINUE * * N1 = 2, N2 = 1: generate elementary reflector H so that: * * H ( -X11 ) = ( * ) * ( -X21 ) = ( 0 ) * ( scale ) = ( 0 ) * U( 1 ) = -X( 1, 1 ) U( 2 ) = -X( 2, 1 ) U( 3 ) = SCALE CALL DLARFG( 3, U( 1 ), U( 2 ), 1, TAU ) U( 1 ) = ONE T33 = T( J3, J3 ) * * Perform swap provisionally on diagonal block in D. * CALL DLARFX( 'L', 3, 3, U, TAU, D, LDD, WORK ) CALL DLARFX( 'R', 3, 3, U, TAU, D, LDD, WORK ) * * Test whether to reject swap. * IF( MAX( ABS( D( 2, 1 ) ), ABS( D( 3, 1 ) ), ABS( D( 1, $ 1 )-T33 ) ).GT.THRESH )GO TO 50 * * Accept swap: apply transformation to the entire matrix T. * CALL DLARFX( 'R', J3, 3, U, TAU, T( 1, J1 ), LDT, WORK ) CALL DLARFX( 'L', 3, N-J1, U, TAU, T( J1, J2 ), LDT, WORK ) * T( J1, J1 ) = T33 T( J2, J1 ) = ZERO T( J3, J1 ) = ZERO * IF( WANTQ ) THEN * * Accumulate transformation in the matrix Q. * CALL DLARFX( 'R', N, 3, U, TAU, Q( 1, J1 ), LDQ, WORK ) END IF GO TO 40 * 30 CONTINUE * * N1 = 2, N2 = 2: generate elementary reflectors H(1) and H(2) so * that: * * H(2) H(1) ( -X11 -X12 ) = ( * * ) * ( -X21 -X22 ) ( 0 * ) * ( scale 0 ) ( 0 0 ) * ( 0 scale ) ( 0 0 ) * U1( 1 ) = -X( 1, 1 ) U1( 2 ) = -X( 2, 1 ) U1( 3 ) = SCALE CALL DLARFG( 3, U1( 1 ), U1( 2 ), 1, TAU1 ) U1( 1 ) = ONE * TEMP = -TAU1*( X( 1, 2 )+U1( 2 )*X( 2, 2 ) ) U2( 1 ) = -TEMP*U1( 2 ) - X( 2, 2 ) U2( 2 ) = -TEMP*U1( 3 ) U2( 3 ) = SCALE CALL DLARFG( 3, U2( 1 ), U2( 2 ), 1, TAU2 ) U2( 1 ) = ONE * * Perform swap provisionally on diagonal block in D. * CALL DLARFX( 'L', 3, 4, U1, TAU1, D, LDD, WORK ) CALL DLARFX( 'R', 4, 3, U1, TAU1, D, LDD, WORK ) CALL DLARFX( 'L', 3, 4, U2, TAU2, D( 2, 1 ), LDD, WORK ) CALL DLARFX( 'R', 4, 3, U2, TAU2, D( 1, 2 ), LDD, WORK ) * * Test whether to reject swap. * IF( MAX( ABS( D( 3, 1 ) ), ABS( D( 3, 2 ) ), ABS( D( 4, 1 ) ), $ ABS( D( 4, 2 ) ) ).GT.THRESH )GO TO 50 * * Accept swap: apply transformation to the entire matrix T. * CALL DLARFX( 'L', 3, N-J1+1, U1, TAU1, T( J1, J1 ), LDT, WORK ) CALL DLARFX( 'R', J4, 3, U1, TAU1, T( 1, J1 ), LDT, WORK ) CALL DLARFX( 'L', 3, N-J1+1, U2, TAU2, T( J2, J1 ), LDT, WORK ) CALL DLARFX( 'R', J4, 3, U2, TAU2, T( 1, J2 ), LDT, WORK ) * T( J3, J1 ) = ZERO T( J3, J2 ) = ZERO T( J4, J1 ) = ZERO T( J4, J2 ) = ZERO * IF( WANTQ ) THEN * * Accumulate transformation in the matrix Q. * CALL DLARFX( 'R', N, 3, U1, TAU1, Q( 1, J1 ), LDQ, WORK ) CALL DLARFX( 'R', N, 3, U2, TAU2, Q( 1, J2 ), LDQ, WORK ) END IF * 40 CONTINUE * IF( N2.EQ.2 ) THEN * * Standardize new 2-by-2 block T11 * CALL DLANV2( T( J1, J1 ), T( J1, J2 ), T( J2, J1 ), $ T( J2, J2 ), WR1, WI1, WR2, WI2, CS, SN ) CALL DROT( N-J1-1, T( J1, J1+2 ), LDT, T( J2, J1+2 ), LDT, $ CS, SN ) CALL DROT( J1-1, T( 1, J1 ), 1, T( 1, J2 ), 1, CS, SN ) IF( WANTQ ) $ CALL DROT( N, Q( 1, J1 ), 1, Q( 1, J2 ), 1, CS, SN ) END IF * IF( N1.EQ.2 ) THEN * * Standardize new 2-by-2 block T22 * J3 = J1 + N2 J4 = J3 + 1 CALL DLANV2( T( J3, J3 ), T( J3, J4 ), T( J4, J3 ), $ T( J4, J4 ), WR1, WI1, WR2, WI2, CS, SN ) IF( J3+2.LE.N ) $ CALL DROT( N-J3-1, T( J3, J3+2 ), LDT, T( J4, J3+2 ), $ LDT, CS, SN ) CALL DROT( J3-1, T( 1, J3 ), 1, T( 1, J4 ), 1, CS, SN ) IF( WANTQ ) $ CALL DROT( N, Q( 1, J3 ), 1, Q( 1, J4 ), 1, CS, SN ) END IF * END IF RETURN * * Exit with INFO = 1 if swap was rejected. * 50 CONTINUE INFO = 1 RETURN * * End of DLAEXC * END octave-1.1.0/libcruft/lapack/dlahqr.f100666 415 17 32347 5306544263 15666 0ustar jweusers SUBROUTINE DLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, WR, WI, $ ILOZ, IHIZ, Z, LDZ, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL WANTT, WANTZ INTEGER IHI, IHIZ, ILO, ILOZ, INFO, LDH, LDZ, N * .. * .. Array Arguments .. DOUBLE PRECISION H( LDH, * ), WI( * ), WR( * ), Z( LDZ, * ) * .. * * Purpose * ======= * * DLAHQR is an auxiliary routine called by DHSEQR to update the * eigenvalues and Schur decomposition already computed by DHSEQR, by * dealing with the Hessenberg submatrix in rows and columns ILO to IHI. * * Arguments * ========= * * WANTT (input) LOGICAL * = .TRUE. : the full Schur form T is required; * = .FALSE.: only eigenvalues are required. * * WANTZ (input) LOGICAL * = .TRUE. : the matrix of Schur vectors Z is required; * = .FALSE.: Schur vectors are not required. * * N (input) INTEGER * The order of the matrix H. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that H is already upper quasi-triangular in * rows and columns IHI+1:N, and that H(ILO,ILO-1) = 0 (unless * ILO = 1). DLAHQR works primarily with the Hessenberg * submatrix in rows and columns ILO to IHI, but applies * transformations to all of H if WANTT is .TRUE.. * 1 <= ILO <= max(1,IHI); IHI <= N. * * H (input/output) DOUBLE PRECISION array, dimension (LDH,N) * On entry, the upper Hessenberg matrix H. * On exit, if WANTT is .TRUE., H is upper quasi-triangular in * rows and columns ILO:IHI, with any 2-by-2 diagonal blocks in * standard form. If WANTT is .FALSE., the contents of H are * unspecified on exit. * * LDH (input) INTEGER * The leading dimension of the array H. LDH >= max(1,N). * * WR (output) DOUBLE PRECISION array, dimension (N) * WI (output) DOUBLE PRECISION array, dimension (N) * The real and imaginary parts, respectively, of the computed * eigenvalues ILO to IHI are stored in the corresponding * elements of WR and WI. If two eigenvalues are computed as a * complex conjugate pair, they are stored in consecutive * elements of WR and WI, say the i-th and (i+1)th, with * WI(i) > 0 and WI(i+1) < 0. If WANTT is .TRUE., the * eigenvalues are stored in the same order as on the diagonal * of the Schur form returned in H, with WR(i) = H(i,i), and, if * H(i:i+1,i:i+1) is a 2-by-2 diagonal block, * WI(i) = sqrt(H(i+1,i)*H(i,i+1)) and WI(i+1) = -WI(i). * * ILOZ (input) INTEGER * IHIZ (input) INTEGER * Specify the rows of Z to which transformations must be * applied if WANTZ is .TRUE.. * 1 <= ILOZ <= ILO; IHI <= IHIZ <= N. * * Z (input/output) DOUBLE PRECISION array, dimension (LDZ,N) * If WANTZ is .TRUE., on entry Z must contain the current * matrix Z of transformations accumulated by DHSEQR, and on * exit Z has been updated; transformations are applied only to * the submatrix Z(ILOZ:IHIZ,ILO:IHI). * If WANTZ is .FALSE., Z is not referenced. * * LDZ (input) INTEGER * The leading dimension of the array Z. LDZ >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * > 0: DLAHQR failed to compute all the eigenvalues ILO to IHI * in a total of 30*(IHI-ILO+1) iterations; if INFO = i, * elements i+1:ihi of WR and WI contain those eigenvalues * which have been successfully computed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION DAT1, DAT2 PARAMETER ( DAT1 = 0.75D+0, DAT2 = -0.4375D+0 ) * .. * .. Local Scalars .. INTEGER I, I1, I2, ITN, ITS, J, K, L, M, NH, NR, NZ DOUBLE PRECISION CS, H00, H10, H11, H12, H21, H22, H33, H33S, $ H43H34, H44, H44S, OVFL, S, SMLNUM, SN, SUM, $ T1, T2, T3, TST1, ULP, UNFL, V1, V2, V3 * .. * .. Local Arrays .. DOUBLE PRECISION V( 3 ), WORK( 1 ) * .. * .. External Functions .. DOUBLE PRECISION DLAMCH, DLANHS EXTERNAL DLAMCH, DLANHS * .. * .. External Subroutines .. EXTERNAL DCOPY, DLABAD, DLANV2, DLARFG, DROT * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN * .. * .. Executable Statements .. * INFO = 0 * * Quick return if possible * IF( N.EQ.0 ) $ RETURN IF( ILO.EQ.IHI ) THEN WR( ILO ) = H( ILO, ILO ) WI( ILO ) = ZERO RETURN END IF * NH = IHI - ILO + 1 NZ = IHIZ - ILOZ + 1 * * Set machine-dependent constants for the stopping criterion. * If norm(H) <= sqrt(OVFL), overflow should not occur. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = ONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( NH / ULP ) * * I1 and I2 are the indices of the first row and last column of H * to which transformations must be applied. If eigenvalues only are * being computed, I1 and I2 are set inside the main loop. * IF( WANTT ) THEN I1 = 1 I2 = N END IF * * ITN is the total number of QR iterations allowed. * ITN = 30*NH * * The main loop begins here. I is the loop index and decreases from * IHI to ILO in steps of 1 or 2. Each iteration of the loop works * with the active submatrix in rows and columns L to I. * Eigenvalues I+1 to IHI have already converged. Either L = ILO or * H(L,L-1) is negligible so that the matrix splits. * I = IHI 10 CONTINUE L = ILO IF( I.LT.ILO ) $ GO TO 150 * * Perform QR iterations on rows and columns ILO to I until a * submatrix of order 1 or 2 splits off at the bottom because a * subdiagonal element has become negligible. * DO 130 ITS = 0, ITN * * Look for a single small subdiagonal element. * DO 20 K = I, L + 1, -1 TST1 = ABS( H( K-1, K-1 ) ) + ABS( H( K, K ) ) IF( TST1.EQ.ZERO ) $ TST1 = DLANHS( '1', I-L+1, H( L, L ), LDH, WORK ) IF( ABS( H( K, K-1 ) ).LE.MAX( ULP*TST1, SMLNUM ) ) $ GO TO 30 20 CONTINUE 30 CONTINUE L = K IF( L.GT.ILO ) THEN * * H(L,L-1) is negligible * H( L, L-1 ) = ZERO END IF * * Exit from loop if a submatrix of order 1 or 2 has split off. * IF( L.GE.I-1 ) $ GO TO 140 * * Now the active submatrix is in rows and columns L to I. If * eigenvalues only are being computed, only the active submatrix * need be transformed. * IF( .NOT.WANTT ) THEN I1 = L I2 = I END IF * IF( ITS.EQ.10 .OR. ITS.EQ.20 ) THEN * * Exceptional shift. * S = ABS( H( I, I-1 ) ) + ABS( H( I-1, I-2 ) ) H44 = DAT1*S H33 = H44 H43H34 = DAT2*S*S ELSE * * Prepare to use Wilkinson's double shift * H44 = H( I, I ) H33 = H( I-1, I-1 ) H43H34 = H( I, I-1 )*H( I-1, I ) END IF * * Look for two consecutive small subdiagonal elements. * DO 40 M = I - 2, L, -1 * * Determine the effect of starting the double-shift QR * iteration at row M, and see if this would make H(M,M-1) * negligible. * H11 = H( M, M ) H22 = H( M+1, M+1 ) H21 = H( M+1, M ) H12 = H( M, M+1 ) H44S = H44 - H11 H33S = H33 - H11 V1 = ( H33S*H44S-H43H34 ) / H21 + H12 V2 = H22 - H11 - H33S - H44S V3 = H( M+2, M+1 ) S = ABS( V1 ) + ABS( V2 ) + ABS( V3 ) V1 = V1 / S V2 = V2 / S V3 = V3 / S V( 1 ) = V1 V( 2 ) = V2 V( 3 ) = V3 IF( M.EQ.L ) $ GO TO 50 H00 = H( M-1, M-1 ) H10 = H( M, M-1 ) TST1 = ABS( V1 )*( ABS( H00 )+ABS( H11 )+ABS( H22 ) ) IF( ABS( H10 )*( ABS( V2 )+ABS( V3 ) ).LE.ULP*TST1 ) $ GO TO 50 40 CONTINUE 50 CONTINUE * * Double-shift QR step * DO 120 K = M, I - 1 * * The first iteration of this loop determines a reflection G * from the vector V and applies it from left and right to H, * thus creating a nonzero bulge below the subdiagonal. * * Each subsequent iteration determines a reflection G to * restore the Hessenberg form in the (K-1)th column, and thus * chases the bulge one step toward the bottom of the active * submatrix. NR is the order of G. * NR = MIN( 3, I-K+1 ) IF( K.GT.M ) $ CALL DCOPY( NR, H( K, K-1 ), 1, V, 1 ) CALL DLARFG( NR, V( 1 ), V( 2 ), 1, T1 ) IF( K.GT.M ) THEN H( K, K-1 ) = V( 1 ) H( K+1, K-1 ) = ZERO IF( K.LT.I-1 ) $ H( K+2, K-1 ) = ZERO ELSE IF( M.GT.L ) THEN H( K, K-1 ) = -H( K, K-1 ) END IF V2 = V( 2 ) T2 = T1*V2 IF( NR.EQ.3 ) THEN V3 = V( 3 ) T3 = T1*V3 * * Apply G from the left to transform the rows of the matrix * in columns K to I2. * DO 60 J = K, I2 SUM = H( K, J ) + V2*H( K+1, J ) + V3*H( K+2, J ) H( K, J ) = H( K, J ) - SUM*T1 H( K+1, J ) = H( K+1, J ) - SUM*T2 H( K+2, J ) = H( K+2, J ) - SUM*T3 60 CONTINUE * * Apply G from the right to transform the columns of the * matrix in rows I1 to min(K+3,I). * DO 70 J = I1, MIN( K+3, I ) SUM = H( J, K ) + V2*H( J, K+1 ) + V3*H( J, K+2 ) H( J, K ) = H( J, K ) - SUM*T1 H( J, K+1 ) = H( J, K+1 ) - SUM*T2 H( J, K+2 ) = H( J, K+2 ) - SUM*T3 70 CONTINUE * IF( WANTZ ) THEN * * Accumulate transformations in the matrix Z * DO 80 J = ILOZ, IHIZ SUM = Z( J, K ) + V2*Z( J, K+1 ) + V3*Z( J, K+2 ) Z( J, K ) = Z( J, K ) - SUM*T1 Z( J, K+1 ) = Z( J, K+1 ) - SUM*T2 Z( J, K+2 ) = Z( J, K+2 ) - SUM*T3 80 CONTINUE END IF ELSE IF( NR.EQ.2 ) THEN * * Apply G from the left to transform the rows of the matrix * in columns K to I2. * DO 90 J = K, I2 SUM = H( K, J ) + V2*H( K+1, J ) H( K, J ) = H( K, J ) - SUM*T1 H( K+1, J ) = H( K+1, J ) - SUM*T2 90 CONTINUE * * Apply G from the right to transform the columns of the * matrix in rows I1 to min(K+3,I). * DO 100 J = I1, I SUM = H( J, K ) + V2*H( J, K+1 ) H( J, K ) = H( J, K ) - SUM*T1 H( J, K+1 ) = H( J, K+1 ) - SUM*T2 100 CONTINUE * IF( WANTZ ) THEN * * Accumulate transformations in the matrix Z * DO 110 J = ILOZ, IHIZ SUM = Z( J, K ) + V2*Z( J, K+1 ) Z( J, K ) = Z( J, K ) - SUM*T1 Z( J, K+1 ) = Z( J, K+1 ) - SUM*T2 110 CONTINUE END IF END IF 120 CONTINUE * 130 CONTINUE * * Failure to converge in remaining number of iterations * INFO = I RETURN * 140 CONTINUE * IF( L.EQ.I ) THEN * * H(I,I-1) is negligible: one eigenvalue has converged. * WR( I ) = H( I, I ) WI( I ) = ZERO ELSE IF( L.EQ.I-1 ) THEN * * H(I-1,I-2) is negligible: a pair of eigenvalues have converged. * * Transform the 2-by-2 submatrix to standard Schur form, * and compute and store the eigenvalues. * CALL DLANV2( H( I-1, I-1 ), H( I-1, I ), H( I, I-1 ), $ H( I, I ), WR( I-1 ), WI( I-1 ), WR( I ), WI( I ), $ CS, SN ) * IF( WANTT ) THEN * * Apply the transformation to the rest of H. * IF( I2.GT.I ) $ CALL DROT( I2-I, H( I-1, I+1 ), LDH, H( I, I+1 ), LDH, $ CS, SN ) CALL DROT( I-I1-1, H( I1, I-1 ), 1, H( I1, I ), 1, CS, SN ) END IF IF( WANTZ ) THEN * * Apply the transformation to Z. * CALL DROT( NZ, Z( ILOZ, I-1 ), 1, Z( ILOZ, I ), 1, CS, SN ) END IF END IF * * Decrement number of remaining iterations, and return to start of * the main loop with new value of I. * ITN = ITN - ITS I = L - 1 GO TO 10 * 150 CONTINUE RETURN * * End of DLAHQR * END octave-1.1.0/libcruft/lapack/dlahrd.f100666 415 17 14720 5306544264 15645 0ustar jweusers SUBROUTINE DLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER K, LDA, LDT, LDY, N, NB * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), T( LDT, NB ), TAU( NB ), $ Y( LDY, NB ) * .. * * Purpose * ======= * * DLAHRD reduces the first NB columns of a real general n-by-(n-k+1) * matrix A so that elements below the k-th subdiagonal are zero. The * reduction is performed by an orthogonal similarity transformation * Q' * A * Q. The routine returns the matrices V and T which determine * Q as a block reflector I - V*T*V', and also the matrix Y = A * V * T. * * This is an auxiliary routine called by DGEHRD. * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. * * K (input) INTEGER * The offset for the reduction. Elements below the k-th * subdiagonal in the first NB columns are reduced to zero. * * NB (input) INTEGER * The number of columns to be reduced. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N-K+1) * On entry, the n-by-(n-k+1) general matrix A. * On exit, the elements on and above the k-th subdiagonal in * the first NB columns are overwritten with the corresponding * elements of the reduced matrix; the elements below the k-th * subdiagonal, with the array TAU, represent the matrix Q as a * product of elementary reflectors. The other columns of A are * unchanged. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) DOUBLE PRECISION array, dimension (NB) * The scalar factors of the elementary reflectors. See Further * Details. * * T (output) DOUBLE PRECISION array, dimension (NB,NB) * The upper triangular matrix T. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= NB. * * Y (output) DOUBLE PRECISION array, dimension (LDY,NB) * The n-by-nb matrix Y. * * LDY (input) INTEGER * The leading dimension of the array Y. LDY >= N. * * Further Details * =============== * * The matrix Q is represented as a product of nb elementary reflectors * * Q = H(1) H(2) . . . H(nb). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a real scalar, and v is a real vector with * v(1:i+k-1) = 0, v(i+k) = 1; v(i+k+1:n) is stored on exit in * A(i+k+1:n,i), and tau in TAU(i). * * The elements of the vectors v together form the (n-k+1)-by-nb matrix * V which is needed, with T and Y, to apply the transformation to the * unreduced part of the matrix, using an update of the form: * A := (I - V*T*V') * (A - Y*V'). * * The contents of A on exit are illustrated by the following example * with n = 7, k = 3 and nb = 2: * * ( a h a a a ) * ( a h a a a ) * ( a h a a a ) * ( h h a a a ) * ( v1 h a a a ) * ( v1 v2 a a a ) * ( v1 v2 a a a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I DOUBLE PRECISION EI * .. * .. External Subroutines .. EXTERNAL DAXPY, DCOPY, DGEMV, DLARFG, DSCAL, DTRMV * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * * Quick return if possible * IF( N.LE.1 ) $ RETURN * DO 10 I = 1, NB IF( I.GT.1 ) THEN * * Update A(1:n,i) * * Compute i-th column of A - Y * V' * CALL DGEMV( 'No transpose', N, I-1, -ONE, Y, LDY, $ A( K+I-1, 1 ), LDA, ONE, A( 1, I ), 1 ) * * Apply I - V * T' * V' to this column (call it b) from the * left, using the last column of T as workspace * * Let V = ( V1 ) and b = ( b1 ) (first I-1 rows) * ( V2 ) ( b2 ) * * where V1 is unit lower triangular * * w := V1' * b1 * CALL DCOPY( I-1, A( K+1, I ), 1, T( 1, NB ), 1 ) CALL DTRMV( 'Lower', 'Transpose', 'Unit', I-1, A( K+1, 1 ), $ LDA, T( 1, NB ), 1 ) * * w := w + V2'*b2 * CALL DGEMV( 'Transpose', N-K-I+1, I-1, ONE, A( K+I, 1 ), $ LDA, A( K+I, I ), 1, ONE, T( 1, NB ), 1 ) * * w := T'*w * CALL DTRMV( 'Upper', 'Transpose', 'Non-unit', I-1, T, LDT, $ T( 1, NB ), 1 ) * * b2 := b2 - V2*w * CALL DGEMV( 'No transpose', N-K-I+1, I-1, -ONE, A( K+I, 1 ), $ LDA, T( 1, NB ), 1, ONE, A( K+I, I ), 1 ) * * b1 := b1 - V1*w * CALL DTRMV( 'Lower', 'No transpose', 'Unit', I-1, $ A( K+1, 1 ), LDA, T( 1, NB ), 1 ) CALL DAXPY( I-1, -ONE, T( 1, NB ), 1, A( K+1, I ), 1 ) * A( K+I-1, I-1 ) = EI END IF * * Generate the elementary reflector H(i) to annihilate * A(k+i+1:n,i) * CALL DLARFG( N-K-I+1, A( K+I, I ), A( MIN( K+I+1, N ), I ), 1, $ TAU( I ) ) EI = A( K+I, I ) A( K+I, I ) = ONE * * Compute Y(1:n,i) * CALL DGEMV( 'No transpose', N, N-K-I+1, ONE, A( 1, I+1 ), LDA, $ A( K+I, I ), 1, ZERO, Y( 1, I ), 1 ) CALL DGEMV( 'Transpose', N-K-I+1, I-1, ONE, A( K+I, 1 ), LDA, $ A( K+I, I ), 1, ZERO, T( 1, I ), 1 ) CALL DGEMV( 'No transpose', N, I-1, -ONE, Y, LDY, T( 1, I ), 1, $ ONE, Y( 1, I ), 1 ) CALL DSCAL( N, TAU( I ), Y( 1, I ), 1 ) * * Compute T(1:i,i) * CALL DSCAL( I-1, -TAU( I ), T( 1, I ), 1 ) CALL DTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T, LDT, $ T( 1, I ), 1 ) T( I, I ) = TAU( I ) * 10 CONTINUE A( K+NB, NB ) = EI * RETURN * * End of DLAHRD * END octave-1.1.0/libcruft/lapack/dlaln2.f100666 415 17 40374 5306544262 15565 0ustar jweusers SUBROUTINE DLALN2( LTRANS, NA, NW, SMIN, CA, A, LDA, D1, D2, B, $ LDB, WR, WI, X, LDX, SCALE, XNORM, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL LTRANS INTEGER INFO, LDA, LDB, LDX, NA, NW DOUBLE PRECISION CA, D1, D2, SCALE, SMIN, WI, WR, XNORM * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ), X( LDX, * ) * .. * * Purpose * ======= * * DLALN2 solves a system of the form (ca A - w D ) X = s B * or (ca A' - w D) X = s B with possible scaling ("s") and * perturbation of A. (A' means A-transpose.) * * A is an NA x NA real matrix, ca is a real scalar, D is an NA x NA * real diagonal matrix, w is a real or complex value, and X and B are * NA x 1 matrices -- real if w is real, complex if w is complex. NA * may be 1 or 2. * * If w is complex, X and B are represented as NA x 2 matrices, * the first column of each being the real part and the second * being the imaginary part. * * "s" is a scaling factor (.LE. 1), computed by DLALN2, which is * so chosen that X can be computed without overflow. X is further * scaled if necessary to assure that norm(ca A - w D)*norm(X) is less * than overflow. * * If both singular values of (ca A - w D) are less than SMIN, * SMIN*identity will be used instead of (ca A - w D). If only one * singular value is less than SMIN, one element of (ca A - w D) will be * perturbed enough to make the smallest singular value roughly SMIN. * If both singular values are at least SMIN, (ca A - w D) will not be * perturbed. In any case, the perturbation will be at most some small * multiple of max( SMIN, ulp*norm(ca A - w D) ). The singular values * are computed by infinity-norm approximations, and thus will only be * correct to a factor of 2 or so. * * Note: all input quantities are assumed to be smaller than overflow * by a reasonable factor. (See BIGNUM.) * * Arguments * ========== * * LTRANS (input) LOGICAL * =.TRUE.: A-transpose will be used. * =.FALSE.: A will be used (not transposed.) * * NA (input) INTEGER * The size of the matrix A. It may (only) be 1 or 2. * * NW (input) INTEGER * 1 if "w" is real, 2 if "w" is complex. It may only be 1 * or 2. * * SMIN (input) DOUBLE PRECISION * The desired lower bound on the singular values of A. This * should be a safe distance away from underflow or overflow, * say, between (underflow/machine precision) and (machine * precision * overflow ). (See BIGNUM and ULP.) * * CA (input) DOUBLE PRECISION * The coefficient c, which A is multiplied by. * * A (input) DOUBLE PRECISION array, dimension (LDA,NA) * The NA x NA matrix A. * * LDA (input) INTEGER * The leading dimension of A. It must be at least NA. * * D1 (input) DOUBLE PRECISION * The 1,1 entry in the diagonal matrix D. * * D2 (input) DOUBLE PRECISION * The 2,2 entry in the diagonal matrix D. Not used if NW=1. * * B (input) DOUBLE PRECISION array, dimension (LDB,NW) * The NA x NW matrix B (right-hand side). If NW=2 ("w" is * complex), column 1 contains the real part of B and column 2 * contains the imaginary part. * * LDB (input) INTEGER * The leading dimension of B. It must be at least NA. * * WR (input) DOUBLE PRECISION * The real part of the scalar "w". * * WI (input) DOUBLE PRECISION * The imaginary part of the scalar "w". Not used if NW=1. * * X (output) DOUBLE PRECISION array, dimension (LDX,NW) * The NA x NW matrix X (unknowns), as computed by DLALN2. * If NW=2 ("w" is complex), on exit, column 1 will contain * the real part of X and column 2 will contain the imaginary * part. * * LDX (input) INTEGER * The leading dimension of X. It must be at least NA. * * SCALE (output) DOUBLE PRECISION * The scale factor that B must be multiplied by to insure * that overflow does not occur when computing X. Thus, * (ca A - w D) X will be SCALE*B, not B (ignoring * perturbations of A.) It will be at most 1. * * XNORM (output) DOUBLE PRECISION * The infinity-norm of X, when X is regarded as an NA x NW * real matrix. * * INFO (output) INTEGER * An error flag. It will be set to zero if no error occurs, * a negative number if an argument is in error, or a positive * number if ca A - w D had to be perturbed. * The possible values are: * = 0: No error occurred, and (ca A - w D) did not have to be * perturbed. * = 1: (ca A - w D) had to be perturbed to make its smallest * (or only) singular value greater than SMIN. * NOTE: In the interests of speed, this routine does not * check the inputs for errors. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) DOUBLE PRECISION TWO PARAMETER ( TWO = 2.0D0 ) * .. * .. Local Scalars .. INTEGER ICMAX, J DOUBLE PRECISION BBND, BI1, BI2, BIGNUM, BNORM, BR1, BR2, CI21, $ CI22, CMAX, CNORM, CR21, CR22, CSI, CSR, LI21, $ LR21, SMINI, SMLNUM, TEMP, U22ABS, UI11, UI11R, $ UI12, UI12S, UI22, UR11, UR11R, UR12, UR12S, $ UR22, XI1, XI2, XR1, XR2 * .. * .. Local Arrays .. LOGICAL RSWAP( 4 ), ZSWAP( 4 ) INTEGER IPIVOT( 4, 4 ) DOUBLE PRECISION CI( 2, 2 ), CIV( 4 ), CR( 2, 2 ), CRV( 4 ) * .. * .. External Functions .. DOUBLE PRECISION DLAMCH EXTERNAL DLAMCH * .. * .. External Subroutines .. EXTERNAL DLADIV * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX * .. * .. Equivalences .. EQUIVALENCE ( CI( 1, 1 ), CIV( 1 ) ), $ ( CR( 1, 1 ), CRV( 1 ) ) * .. * .. Data statements .. DATA ZSWAP / .FALSE., .FALSE., .TRUE., .TRUE. / DATA RSWAP / .FALSE., .TRUE., .FALSE., .TRUE. / DATA IPIVOT / 1, 2, 3, 4, 2, 1, 4, 3, 3, 4, 1, 2, 4, $ 3, 2, 1 / * .. * .. Executable Statements .. * * Compute BIGNUM * SMLNUM = TWO*DLAMCH( 'Safe minimum' ) BIGNUM = ONE / SMLNUM SMINI = MAX( SMIN, SMLNUM ) * * Don't check for input errors * INFO = 0 * * Standard Initializations * SCALE = ONE * IF( NA.EQ.1 ) THEN * * 1 x 1 (i.e., scalar) system C X = B * IF( NW.EQ.1 ) THEN * * Real 1x1 system. * * C = ca A - w D * CSR = CA*A( 1, 1 ) - WR*D1 CNORM = ABS( CSR ) * * If | C | < SMINI, use C = SMINI * IF( CNORM.LT.SMINI ) THEN CSR = SMINI CNORM = SMINI INFO = 1 END IF * * Check scaling for X = B / C * BNORM = ABS( B( 1, 1 ) ) IF( CNORM.LT.ONE .AND. BNORM.GT.ONE ) THEN IF( BNORM.GT.BIGNUM*CNORM ) $ SCALE = ONE / BNORM END IF * * Compute X * X( 1, 1 ) = ( B( 1, 1 )*SCALE ) / CSR XNORM = ABS( X( 1, 1 ) ) ELSE * * Complex 1x1 system (w is complex) * * C = ca A - w D * CSR = CA*A( 1, 1 ) - WR*D1 CSI = -WI*D1 CNORM = ABS( CSR ) + ABS( CSI ) * * If | C | < SMINI, use C = SMINI * IF( CNORM.LT.SMINI ) THEN CSR = SMINI CSI = ZERO CNORM = SMINI INFO = 1 END IF * * Check scaling for X = B / C * BNORM = ABS( B( 1, 1 ) ) + ABS( B( 1, 2 ) ) IF( CNORM.LT.ONE .AND. BNORM.GT.ONE ) THEN IF( BNORM.GT.BIGNUM*CNORM ) $ SCALE = ONE / BNORM END IF * * Compute X * CALL DLADIV( SCALE*B( 1, 1 ), SCALE*B( 1, 2 ), CSR, CSI, $ X( 1, 1 ), X( 1, 2 ) ) XNORM = ABS( X( 1, 1 ) ) + ABS( X( 1, 2 ) ) END IF * ELSE * * 2x2 System * * Compute the real part of C = ca A - w D (or ca A' - w D ) * CR( 1, 1 ) = CA*A( 1, 1 ) - WR*D1 CR( 2, 2 ) = CA*A( 2, 2 ) - WR*D2 IF( LTRANS ) THEN CR( 1, 2 ) = CA*A( 2, 1 ) CR( 2, 1 ) = CA*A( 1, 2 ) ELSE CR( 2, 1 ) = CA*A( 2, 1 ) CR( 1, 2 ) = CA*A( 1, 2 ) END IF * IF( NW.EQ.1 ) THEN * * Real 2x2 system (w is real) * * Find the largest entry in C * CMAX = ZERO ICMAX = 0 * DO 10 J = 1, 4 IF( ABS( CRV( J ) ).GT.CMAX ) THEN CMAX = ABS( CRV( J ) ) ICMAX = J END IF 10 CONTINUE * * If norm(C) < SMINI, use SMINI*identity. * IF( CMAX.LT.SMINI ) THEN BNORM = MAX( ABS( B( 1, 1 ) ), ABS( B( 2, 1 ) ) ) IF( SMINI.LT.ONE .AND. BNORM.GT.ONE ) THEN IF( BNORM.GT.BIGNUM*SMINI ) $ SCALE = ONE / BNORM END IF TEMP = SCALE / SMINI X( 1, 1 ) = TEMP*B( 1, 1 ) X( 2, 1 ) = TEMP*B( 2, 1 ) XNORM = TEMP*BNORM INFO = 1 RETURN END IF * * Gaussian elimination with complete pivoting. * UR11 = CRV( ICMAX ) CR21 = CRV( IPIVOT( 2, ICMAX ) ) UR12 = CRV( IPIVOT( 3, ICMAX ) ) CR22 = CRV( IPIVOT( 4, ICMAX ) ) UR11R = ONE / UR11 LR21 = UR11R*CR21 UR22 = CR22 - UR12*LR21 * * If smaller pivot < SMINI, use SMINI * IF( ABS( UR22 ).LT.SMINI ) THEN UR22 = SMINI INFO = 1 END IF IF( RSWAP( ICMAX ) ) THEN BR1 = B( 2, 1 ) BR2 = B( 1, 1 ) ELSE BR1 = B( 1, 1 ) BR2 = B( 2, 1 ) END IF BR2 = BR2 - LR21*BR1 BBND = MAX( ABS( BR1*( UR22*UR11R ) ), ABS( BR2 ) ) IF( BBND.GT.ONE .AND. ABS( UR22 ).LT.ONE ) THEN IF( BBND.GE.BIGNUM*ABS( UR22 ) ) $ SCALE = ONE / BBND END IF * XR2 = ( BR2*SCALE ) / UR22 XR1 = ( SCALE*BR1 )*UR11R - XR2*( UR11R*UR12 ) IF( ZSWAP( ICMAX ) ) THEN X( 1, 1 ) = XR2 X( 2, 1 ) = XR1 ELSE X( 1, 1 ) = XR1 X( 2, 1 ) = XR2 END IF XNORM = MAX( ABS( XR1 ), ABS( XR2 ) ) * * Further scaling if norm(A) norm(X) > overflow * IF( XNORM.GT.ONE .AND. CMAX.GT.ONE ) THEN IF( XNORM.GT.BIGNUM / CMAX ) THEN TEMP = CMAX / BIGNUM X( 1, 1 ) = TEMP*X( 1, 1 ) X( 2, 1 ) = TEMP*X( 2, 1 ) XNORM = TEMP*XNORM SCALE = TEMP*SCALE END IF END IF ELSE * * Complex 2x2 system (w is complex) * * Find the largest entry in C * CI( 1, 1 ) = -WI*D1 CI( 2, 1 ) = ZERO CI( 1, 2 ) = ZERO CI( 2, 2 ) = -WI*D2 CMAX = ZERO ICMAX = 0 * DO 20 J = 1, 4 IF( ABS( CRV( J ) )+ABS( CIV( J ) ).GT.CMAX ) THEN CMAX = ABS( CRV( J ) ) + ABS( CIV( J ) ) ICMAX = J END IF 20 CONTINUE * * If norm(C) < SMINI, use SMINI*identity. * IF( CMAX.LT.SMINI ) THEN BNORM = MAX( ABS( B( 1, 1 ) )+ABS( B( 1, 2 ) ), $ ABS( B( 2, 1 ) )+ABS( B( 2, 2 ) ) ) IF( SMINI.LT.ONE .AND. BNORM.GT.ONE ) THEN IF( BNORM.GT.BIGNUM*SMINI ) $ SCALE = ONE / BNORM END IF TEMP = SCALE / SMINI X( 1, 1 ) = TEMP*B( 1, 1 ) X( 2, 1 ) = TEMP*B( 2, 1 ) X( 1, 2 ) = TEMP*B( 1, 2 ) X( 2, 2 ) = TEMP*B( 2, 2 ) XNORM = TEMP*BNORM INFO = 1 RETURN END IF * * Gaussian elimination with complete pivoting. * UR11 = CRV( ICMAX ) UI11 = CIV( ICMAX ) CR21 = CRV( IPIVOT( 2, ICMAX ) ) CI21 = CIV( IPIVOT( 2, ICMAX ) ) UR12 = CRV( IPIVOT( 3, ICMAX ) ) UI12 = CIV( IPIVOT( 3, ICMAX ) ) CR22 = CRV( IPIVOT( 4, ICMAX ) ) CI22 = CIV( IPIVOT( 4, ICMAX ) ) IF( ICMAX.EQ.1 .OR. ICMAX.EQ.4 ) THEN * * Code when off-diagonals of pivoted C are real * IF( ABS( UR11 ).GT.ABS( UI11 ) ) THEN TEMP = UI11 / UR11 UR11R = ONE / ( UR11*( ONE+TEMP**2 ) ) UI11R = -TEMP*UR11R ELSE TEMP = UR11 / UI11 UI11R = -ONE / ( UI11*( ONE+TEMP**2 ) ) UR11R = -TEMP*UI11R END IF LR21 = CR21*UR11R LI21 = CR21*UI11R UR12S = UR12*UR11R UI12S = UR12*UI11R UR22 = CR22 - UR12*LR21 UI22 = CI22 - UR12*LI21 ELSE * * Code when diagonals of pivoted C are real * UR11R = ONE / UR11 UI11R = ZERO LR21 = CR21*UR11R LI21 = CI21*UR11R UR12S = UR12*UR11R UI12S = UI12*UR11R UR22 = CR22 - UR12*LR21 + UI12*LI21 UI22 = -UR12*LI21 - UI12*LR21 END IF U22ABS = ABS( UR22 ) + ABS( UI22 ) * * If smaller pivot < SMINI, use SMINI * IF( U22ABS.LT.SMINI ) THEN UR22 = SMINI UI22 = ZERO INFO = 1 END IF IF( RSWAP( ICMAX ) ) THEN BR2 = B( 1, 1 ) BR1 = B( 2, 1 ) BI2 = B( 1, 2 ) BI1 = B( 2, 2 ) ELSE BR1 = B( 1, 1 ) BR2 = B( 2, 1 ) BI1 = B( 1, 2 ) BI2 = B( 2, 2 ) END IF BR2 = BR2 - LR21*BR1 + LI21*BI1 BI2 = BI2 - LI21*BR1 - LR21*BI1 BBND = MAX( ( ABS( BR1 )+ABS( BI1 ) )* $ ( U22ABS*( ABS( UR11R )+ABS( UI11R ) ) ), $ ABS( BR2 )+ABS( BI2 ) ) IF( BBND.GT.ONE .AND. U22ABS.LT.ONE ) THEN IF( BBND.GE.BIGNUM*U22ABS ) THEN SCALE = ONE / BBND BR1 = SCALE*BR1 BI1 = SCALE*BI1 BR2 = SCALE*BR2 BI2 = SCALE*BI2 END IF END IF * CALL DLADIV( BR2, BI2, UR22, UI22, XR2, XI2 ) XR1 = UR11R*BR1 - UI11R*BI1 - UR12S*XR2 + UI12S*XI2 XI1 = UI11R*BR1 + UR11R*BI1 - UI12S*XR2 - UR12S*XI2 IF( ZSWAP( ICMAX ) ) THEN X( 1, 1 ) = XR2 X( 2, 1 ) = XR1 X( 1, 2 ) = XI2 X( 2, 2 ) = XI1 ELSE X( 1, 1 ) = XR1 X( 2, 1 ) = XR2 X( 1, 2 ) = XI1 X( 2, 2 ) = XI2 END IF XNORM = MAX( ABS( XR1 )+ABS( XI1 ), ABS( XR2 )+ABS( XI2 ) ) * * Further scaling if norm(A) norm(X) > overflow * IF( XNORM.GT.ONE .AND. CMAX.GT.ONE ) THEN IF( XNORM.GT.BIGNUM / CMAX ) THEN TEMP = CMAX / BIGNUM X( 1, 1 ) = TEMP*X( 1, 1 ) X( 2, 1 ) = TEMP*X( 2, 1 ) X( 1, 2 ) = TEMP*X( 1, 2 ) X( 2, 2 ) = TEMP*X( 2, 2 ) XNORM = TEMP*XNORM SCALE = TEMP*SCALE END IF END IF END IF END IF * RETURN * * End of DLALN2 * END octave-1.1.0/libcruft/lapack/dlamc1.f100666 415 17 12265 5306544265 15553 0ustar jweusers* ************************************************************************ * SUBROUTINE DLAMC1( BETA, T, RND, IEEE1 ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL IEEE1, RND INTEGER BETA, T * .. * * Purpose * ======= * * DLAMC1 determines the machine parameters given by BETA, T, RND, and * IEEE1. * * Arguments * ========= * * BETA (output) INTEGER * The base of the machine. * * T (output) INTEGER * The number of ( BETA ) digits in the mantissa. * * RND (output) LOGICAL * Specifies whether proper rounding ( RND = .TRUE. ) or * chopping ( RND = .FALSE. ) occurs in addition. This may not * be a reliable guide to the way in which the machine performs * its arithmetic. * * IEEE1 (output) LOGICAL * Specifies whether rounding appears to be done in the IEEE * 'round to nearest' style. * * Further Details * =============== * * The routine is based on the routine ENVRON by Malcolm and * incorporates suggestions by Gentleman and Marovich. See * * Malcolm M. A. (1972) Algorithms to reveal properties of * floating-point arithmetic. Comms. of the ACM, 15, 949-951. * * Gentleman W. M. and Marovich S. B. (1974) More on algorithms * that reveal properties of floating point arithmetic units. * Comms. of the ACM, 17, 276-277. * * ===================================================================== * * .. Local Scalars .. LOGICAL FIRST, LIEEE1, LRND INTEGER LBETA, LT DOUBLE PRECISION A, B, C, F, ONE, QTR, SAVEC, T1, T2 * .. * .. External Functions .. DOUBLE PRECISION DLAMC3 EXTERNAL DLAMC3 * .. * .. Save statement .. SAVE FIRST, LIEEE1, LBETA, LRND, LT * .. * .. Data statements .. DATA FIRST / .TRUE. / * .. * .. Executable Statements .. * IF( FIRST ) THEN FIRST = .FALSE. ONE = 1 * * LBETA, LIEEE1, LT and LRND are the local values of BETA, * IEEE1, T and RND. * * Throughout this routine we use the function DLAMC3 to ensure * that relevant values are stored and not held in registers, or * are not affected by optimizers. * * Compute a = 2.0**m with the smallest positive integer m such * that * * fl( a + 1.0 ) = a. * A = 1 C = 1 * *+ WHILE( C.EQ.ONE )LOOP 10 CONTINUE IF( C.EQ.ONE ) THEN A = 2*A C = DLAMC3( A, ONE ) C = DLAMC3( C, -A ) GO TO 10 END IF *+ END WHILE * * Now compute b = 2.0**m with the smallest positive integer m * such that * * fl( a + b ) .gt. a. * B = 1 C = DLAMC3( A, B ) * *+ WHILE( C.EQ.A )LOOP 20 CONTINUE IF( C.EQ.A ) THEN B = 2*B C = DLAMC3( A, B ) GO TO 20 END IF *+ END WHILE * * Now compute the base. a and c are neighbouring floating point * numbers in the interval ( beta**t, beta**( t + 1 ) ) and so * their difference is beta. Adding 0.25 to c is to ensure that it * is truncated to beta and not ( beta - 1 ). * QTR = ONE / 4 SAVEC = C C = DLAMC3( C, -A ) LBETA = C + QTR * * Now determine whether rounding or chopping occurs, by adding a * bit less than beta/2 and a bit more than beta/2 to a. * B = LBETA F = DLAMC3( B / 2, -B / 100 ) C = DLAMC3( F, A ) IF( C.EQ.A ) THEN LRND = .TRUE. ELSE LRND = .FALSE. END IF F = DLAMC3( B / 2, B / 100 ) C = DLAMC3( F, A ) IF( ( LRND ) .AND. ( C.EQ.A ) ) $ LRND = .FALSE. * * Try and decide whether rounding is done in the IEEE 'round to * nearest' style. B/2 is half a unit in the last place of the two * numbers A and SAVEC. Furthermore, A is even, i.e. has last bit * zero, and SAVEC is odd. Thus adding B/2 to A should not change * A, but adding B/2 to SAVEC should change SAVEC. * T1 = DLAMC3( B / 2, A ) T2 = DLAMC3( B / 2, SAVEC ) LIEEE1 = ( T1.EQ.A ) .AND. ( T2.GT.SAVEC ) .AND. LRND * * Now find the mantissa, t. It should be the integer part of * log to the base beta of a, however it is safer to determine t * by powering. So we find t as the smallest positive integer for * which * * fl( beta**t + 1.0 ) = 1.0. * LT = 0 A = 1 C = 1 * *+ WHILE( C.EQ.ONE )LOOP 30 CONTINUE IF( C.EQ.ONE ) THEN LT = LT + 1 A = A*LBETA C = DLAMC3( A, ONE ) C = DLAMC3( C, -A ) GO TO 30 END IF *+ END WHILE * END IF * BETA = LBETA T = LT RND = LRND IEEE1 = LIEEE1 RETURN * * End of DLAMC1 * END octave-1.1.0/libcruft/lapack/dlamc2.f100666 415 17 17630 5306544265 15555 0ustar jweusers* ************************************************************************ * SUBROUTINE DLAMC2( BETA, T, RND, EPS, EMIN, RMIN, EMAX, RMAX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL RND INTEGER BETA, EMAX, EMIN, T DOUBLE PRECISION EPS, RMAX, RMIN * .. * * Purpose * ======= * * DLAMC2 determines the machine parameters specified in its argument * list. * * Arguments * ========= * * BETA (output) INTEGER * The base of the machine. * * T (output) INTEGER * The number of ( BETA ) digits in the mantissa. * * RND (output) LOGICAL * Specifies whether proper rounding ( RND = .TRUE. ) or * chopping ( RND = .FALSE. ) occurs in addition. This may not * be a reliable guide to the way in which the machine performs * its arithmetic. * * EPS (output) DOUBLE PRECISION * The smallest positive number such that * * fl( 1.0 - EPS ) .LT. 1.0, * * where fl denotes the computed value. * * EMIN (output) INTEGER * The minimum exponent before (gradual) underflow occurs. * * RMIN (output) DOUBLE PRECISION * The smallest normalized number for the machine, given by * BASE**( EMIN - 1 ), where BASE is the floating point value * of BETA. * * EMAX (output) INTEGER * The maximum exponent before overflow occurs. * * RMAX (output) DOUBLE PRECISION * The largest positive number for the machine, given by * BASE**EMAX * ( 1 - EPS ), where BASE is the floating point * value of BETA. * * Further Details * =============== * * The computation of EPS is based on a routine PARANOIA by * W. Kahan of the University of California at Berkeley. * * ===================================================================== * * .. Local Scalars .. LOGICAL FIRST, IEEE, IWARN, LIEEE1, LRND INTEGER GNMIN, GPMIN, I, LBETA, LEMAX, LEMIN, LT, $ NGNMIN, NGPMIN DOUBLE PRECISION A, B, C, HALF, LEPS, LRMAX, LRMIN, ONE, RBASE, $ SIXTH, SMALL, THIRD, TWO, ZERO * .. * .. External Functions .. DOUBLE PRECISION DLAMC3 EXTERNAL DLAMC3 * .. * .. External Subroutines .. EXTERNAL DLAMC1, DLAMC4, DLAMC5 * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN * .. * .. Save statement .. SAVE FIRST, IWARN, LBETA, LEMAX, LEMIN, LEPS, LRMAX, $ LRMIN, LT * .. * .. Data statements .. DATA FIRST / .TRUE. / , IWARN / .FALSE. / * .. * .. Executable Statements .. * IF( FIRST ) THEN FIRST = .FALSE. ZERO = 0 ONE = 1 TWO = 2 * * LBETA, LT, LRND, LEPS, LEMIN and LRMIN are the local values of * BETA, T, RND, EPS, EMIN and RMIN. * * Throughout this routine we use the function DLAMC3 to ensure * that relevant values are stored and not held in registers, or * are not affected by optimizers. * * DLAMC1 returns the parameters LBETA, LT, LRND and LIEEE1. * CALL DLAMC1( LBETA, LT, LRND, LIEEE1 ) * * Start to find EPS. * B = LBETA A = B**( -LT ) LEPS = A * * Try some tricks to see whether or not this is the correct EPS. * B = TWO / 3 HALF = ONE / 2 SIXTH = DLAMC3( B, -HALF ) THIRD = DLAMC3( SIXTH, SIXTH ) B = DLAMC3( THIRD, -HALF ) B = DLAMC3( B, SIXTH ) B = ABS( B ) IF( B.LT.LEPS ) $ B = LEPS * LEPS = 1 * *+ WHILE( ( LEPS.GT.B ).AND.( B.GT.ZERO ) )LOOP 10 CONTINUE IF( ( LEPS.GT.B ) .AND. ( B.GT.ZERO ) ) THEN LEPS = B C = DLAMC3( HALF*LEPS, ( TWO**5 )*( LEPS**2 ) ) C = DLAMC3( HALF, -C ) B = DLAMC3( HALF, C ) C = DLAMC3( HALF, -B ) B = DLAMC3( HALF, C ) GO TO 10 END IF *+ END WHILE * IF( A.LT.LEPS ) $ LEPS = A * * Computation of EPS complete. * * Now find EMIN. Let A = + or - 1, and + or - (1 + BASE**(-3)). * Keep dividing A by BETA until (gradual) underflow occurs. This * is detected when we cannot recover the previous A. * RBASE = ONE / LBETA SMALL = ONE DO 20 I = 1, 3 SMALL = DLAMC3( SMALL*RBASE, ZERO ) 20 CONTINUE A = DLAMC3( ONE, SMALL ) CALL DLAMC4( NGPMIN, ONE, LBETA ) CALL DLAMC4( NGNMIN, -ONE, LBETA ) CALL DLAMC4( GPMIN, A, LBETA ) CALL DLAMC4( GNMIN, -A, LBETA ) IEEE = .FALSE. * IF( ( NGPMIN.EQ.NGNMIN ) .AND. ( GPMIN.EQ.GNMIN ) ) THEN IF( NGPMIN.EQ.GPMIN ) THEN LEMIN = NGPMIN * ( Non twos-complement machines, no gradual underflow; * e.g., VAX ) ELSE IF( ( GPMIN-NGPMIN ).EQ.3 ) THEN LEMIN = NGPMIN - 1 + LT IEEE = .TRUE. * ( Non twos-complement machines, with gradual underflow; * e.g., IEEE standard followers ) ELSE LEMIN = MIN( NGPMIN, GPMIN ) * ( A guess; no known machine ) IWARN = .TRUE. END IF * ELSE IF( ( NGPMIN.EQ.GPMIN ) .AND. ( NGNMIN.EQ.GNMIN ) ) THEN IF( ABS( NGPMIN-NGNMIN ).EQ.1 ) THEN LEMIN = MAX( NGPMIN, NGNMIN ) * ( Twos-complement machines, no gradual underflow; * e.g., CYBER 205 ) ELSE LEMIN = MIN( NGPMIN, NGNMIN ) * ( A guess; no known machine ) IWARN = .TRUE. END IF * ELSE IF( ( ABS( NGPMIN-NGNMIN ).EQ.1 ) .AND. $ ( GPMIN.EQ.GNMIN ) ) THEN IF( ( GPMIN-MIN( NGPMIN, NGNMIN ) ).EQ.3 ) THEN LEMIN = MAX( NGPMIN, NGNMIN ) - 1 + LT * ( Twos-complement machines with gradual underflow; * no known machine ) ELSE LEMIN = MIN( NGPMIN, NGNMIN ) * ( A guess; no known machine ) IWARN = .TRUE. END IF * ELSE LEMIN = MIN( NGPMIN, NGNMIN, GPMIN, GNMIN ) * ( A guess; no known machine ) IWARN = .TRUE. END IF *** * Comment out this if block if EMIN is ok IF( IWARN ) THEN FIRST = .TRUE. WRITE( 6, FMT = 9999 )LEMIN END IF *** * * Assume IEEE arithmetic if we found denormalised numbers above, * or if arithmetic seems to round in the IEEE style, determined * in routine DLAMC1. A true IEEE machine should have both things * true; however, faulty machines may have one or the other. * IEEE = IEEE .OR. LIEEE1 * * Compute RMIN by successive division by BETA. We could compute * RMIN as BASE**( EMIN - 1 ), but some machines underflow during * this computation. * LRMIN = 1 DO 30 I = 1, 1 - LEMIN LRMIN = DLAMC3( LRMIN*RBASE, ZERO ) 30 CONTINUE * * Finally, call DLAMC5 to compute EMAX and RMAX. * CALL DLAMC5( LBETA, LT, LEMIN, IEEE, LEMAX, LRMAX ) END IF * BETA = LBETA T = LT RND = LRND EPS = LEPS EMIN = LEMIN RMIN = LRMIN EMAX = LEMAX RMAX = LRMAX * RETURN * 9999 FORMAT( / / ' WARNING. The value EMIN may be incorrect:-', $ ' EMIN = ', I8, / $ ' If, after inspection, the value EMIN looks', $ ' acceptable please comment out ', $ / ' the IF block as marked within the code of routine', $ ' DLAMC2,', / ' otherwise supply EMIN explicitly.', / ) * * End of DLAMC2 * END octave-1.1.0/libcruft/lapack/dlamc3.f100666 415 17 1574 5306544265 15536 0ustar jweusers* ************************************************************************ * DOUBLE PRECISION FUNCTION DLAMC3( A, B ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION A, B * .. * * Purpose * ======= * * DLAMC3 is intended to force A and B to be stored prior to doing * the addition of A and B , for use in situations where optimizers * might hold one of these in a register. * * Arguments * ========= * * A, B (input) DOUBLE PRECISION * The values A and B. * * ===================================================================== * * .. Executable Statements .. * DLAMC3 = A + B * RETURN * * End of DLAMC3 * END octave-1.1.0/libcruft/lapack/dlamc4.f100666 415 17 4047 5306544265 15535 0ustar jweusers* ************************************************************************ * SUBROUTINE DLAMC4( EMIN, START, BASE ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER BASE, EMIN DOUBLE PRECISION START * .. * * Purpose * ======= * * DLAMC4 is a service routine for DLAMC2. * * Arguments * ========= * * EMIN (output) EMIN * The minimum exponent before (gradual) underflow, computed by * setting A = START and dividing by BASE until the previous A * can not be recovered. * * START (input) DOUBLE PRECISION * The starting point for determining EMIN. * * BASE (input) INTEGER * The base of the machine. * * ===================================================================== * * .. Local Scalars .. INTEGER I DOUBLE PRECISION A, B1, B2, C1, C2, D1, D2, ONE, RBASE, ZERO * .. * .. External Functions .. DOUBLE PRECISION DLAMC3 EXTERNAL DLAMC3 * .. * .. Executable Statements .. * A = START ONE = 1 RBASE = ONE / BASE ZERO = 0 EMIN = 1 B1 = DLAMC3( A*RBASE, ZERO ) C1 = A C2 = A D1 = A D2 = A *+ WHILE( ( C1.EQ.A ).AND.( C2.EQ.A ).AND. * $ ( D1.EQ.A ).AND.( D2.EQ.A ) )LOOP 10 CONTINUE IF( ( C1.EQ.A ) .AND. ( C2.EQ.A ) .AND. ( D1.EQ.A ) .AND. $ ( D2.EQ.A ) ) THEN EMIN = EMIN - 1 A = B1 B1 = DLAMC3( A / BASE, ZERO ) C1 = DLAMC3( B1*BASE, ZERO ) D1 = ZERO DO 20 I = 1, BASE D1 = D1 + B1 20 CONTINUE B2 = DLAMC3( A*RBASE, ZERO ) C2 = DLAMC3( B2 / RBASE, ZERO ) D2 = ZERO DO 30 I = 1, BASE D2 = D2 + B2 30 CONTINUE GO TO 10 END IF *+ END WHILE * RETURN * * End of DLAMC4 * END octave-1.1.0/libcruft/lapack/dlamc5.f100666 415 17 11224 5306544265 15551 0ustar jweusers* ************************************************************************ * SUBROUTINE DLAMC5( BETA, P, EMIN, IEEE, EMAX, RMAX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL IEEE INTEGER BETA, EMAX, EMIN, P DOUBLE PRECISION RMAX * .. * * Purpose * ======= * * DLAMC5 attempts to compute RMAX, the largest machine floating-point * number, without overflow. It assumes that EMAX + abs(EMIN) sum * approximately to a power of 2. It will fail on machines where this * assumption does not hold, for example, the Cyber 205 (EMIN = -28625, * EMAX = 28718). It will also fail if the value supplied for EMIN is * too large (i.e. too close to zero), probably with overflow. * * Arguments * ========= * * BETA (input) INTEGER * The base of floating-point arithmetic. * * P (input) INTEGER * The number of base BETA digits in the mantissa of a * floating-point value. * * EMIN (input) INTEGER * The minimum exponent before (gradual) underflow. * * IEEE (input) LOGICAL * A logical flag specifying whether or not the arithmetic * system is thought to comply with the IEEE standard. * * EMAX (output) INTEGER * The largest exponent before overflow * * RMAX (output) DOUBLE PRECISION * The largest machine floating-point number. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. INTEGER EXBITS, EXPSUM, I, LEXP, NBITS, TRY, UEXP DOUBLE PRECISION OLDY, RECBAS, Y, Z * .. * .. External Functions .. DOUBLE PRECISION DLAMC3 EXTERNAL DLAMC3 * .. * .. Intrinsic Functions .. INTRINSIC MOD * .. * .. Executable Statements .. * * First compute LEXP and UEXP, two powers of 2 that bound * abs(EMIN). We then assume that EMAX + abs(EMIN) will sum * approximately to the bound that is closest to abs(EMIN). * (EMAX is the exponent of the required number RMAX). * LEXP = 1 EXBITS = 1 10 CONTINUE TRY = LEXP*2 IF( TRY.LE.( -EMIN ) ) THEN LEXP = TRY EXBITS = EXBITS + 1 GO TO 10 END IF IF( LEXP.EQ.-EMIN ) THEN UEXP = LEXP ELSE UEXP = TRY EXBITS = EXBITS + 1 END IF * * Now -LEXP is less than or equal to EMIN, and -UEXP is greater * than or equal to EMIN. EXBITS is the number of bits needed to * store the exponent. * IF( ( UEXP+EMIN ).GT.( -LEXP-EMIN ) ) THEN EXPSUM = 2*LEXP ELSE EXPSUM = 2*UEXP END IF * * EXPSUM is the exponent range, approximately equal to * EMAX - EMIN + 1 . * EMAX = EXPSUM + EMIN - 1 NBITS = 1 + EXBITS + P * * NBITS is the total number of bits needed to store a * floating-point number. * IF( ( MOD( NBITS, 2 ).EQ.1 ) .AND. ( BETA.EQ.2 ) ) THEN * * Either there are an odd number of bits used to store a * floating-point number, which is unlikely, or some bits are * not used in the representation of numbers, which is possible, * (e.g. Cray machines) or the mantissa has an implicit bit, * (e.g. IEEE machines, Dec Vax machines), which is perhaps the * most likely. We have to assume the last alternative. * If this is true, then we need to reduce EMAX by one because * there must be some way of representing zero in an implicit-bit * system. On machines like Cray, we are reducing EMAX by one * unnecessarily. * EMAX = EMAX - 1 END IF * IF( IEEE ) THEN * * Assume we are on an IEEE machine which reserves one exponent * for infinity and NaN. * EMAX = EMAX - 1 END IF * * Now create RMAX, the largest machine number, which should * be equal to (1.0 - BETA**(-P)) * BETA**EMAX . * * First compute 1.0 - BETA**(-P), being careful that the * result is less than 1.0 . * RECBAS = ONE / BETA Z = BETA - ONE Y = ZERO DO 20 I = 1, P Z = Z*RECBAS IF( Y.LT.ONE ) $ OLDY = Y Y = DLAMC3( Y, Z ) 20 CONTINUE IF( Y.GE.ONE ) $ Y = OLDY * * Now multiply by BETA**EMAX to get RMAX. * DO 30 I = 1, EMAX Y = DLAMC3( Y*BETA, ZERO ) 30 CONTINUE * RMAX = Y RETURN * * End of DLAMC5 * END octave-1.1.0/libcruft/lapack/dlamch.f100666 415 17 7305 5306544265 15621 0ustar jweusers DOUBLE PRECISION FUNCTION DLAMCH( CMACH ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER CMACH * .. * * Purpose * ======= * * DLAMCH determines double precision machine parameters. * * Arguments * ========= * * CMACH (input) CHARACTER*1 * Specifies the value to be returned by DLAMCH: * = 'E' or 'e', DLAMCH := eps * = 'S' or 's , DLAMCH := sfmin * = 'B' or 'b', DLAMCH := base * = 'P' or 'p', DLAMCH := eps*base * = 'N' or 'n', DLAMCH := t * = 'R' or 'r', DLAMCH := rnd * = 'M' or 'm', DLAMCH := emin * = 'U' or 'u', DLAMCH := rmin * = 'L' or 'l', DLAMCH := emax * = 'O' or 'o', DLAMCH := rmax * * where * * eps = relative machine precision * sfmin = safe minimum, such that 1/sfmin does not overflow * base = base of the machine * prec = eps*base * t = number of (base) digits in the mantissa * rnd = 1.0 when rounding occurs in addition, 0.0 otherwise * emin = minimum exponent before (gradual) underflow * rmin = underflow threshold - base**(emin-1) * emax = largest exponent before overflow * rmax = overflow threshold - (base**emax)*(1-eps) * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. LOGICAL FIRST, LRND INTEGER BETA, IMAX, IMIN, IT DOUBLE PRECISION BASE, EMAX, EMIN, EPS, PREC, RMACH, RMAX, RMIN, $ RND, SFMIN, SMALL, T * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DLAMC2 * .. * .. Save statement .. SAVE FIRST, EPS, SFMIN, BASE, T, RND, EMIN, RMIN, $ EMAX, RMAX, PREC * .. * .. Data statements .. DATA FIRST / .TRUE. / * .. * .. Executable Statements .. * IF( FIRST ) THEN FIRST = .FALSE. CALL DLAMC2( BETA, IT, LRND, EPS, IMIN, RMIN, IMAX, RMAX ) BASE = BETA T = IT IF( LRND ) THEN RND = ONE EPS = ( BASE**( 1-IT ) ) / 2 ELSE RND = ZERO EPS = BASE**( 1-IT ) END IF PREC = EPS*BASE EMIN = IMIN EMAX = IMAX SFMIN = RMIN SMALL = ONE / RMAX IF( SMALL.GE.SFMIN ) THEN * * Use SMALL plus a bit, to avoid the possibility of rounding * causing overflow when computing 1/sfmin. * SFMIN = SMALL*( ONE+EPS ) END IF END IF * IF( LSAME( CMACH, 'E' ) ) THEN RMACH = EPS ELSE IF( LSAME( CMACH, 'S' ) ) THEN RMACH = SFMIN ELSE IF( LSAME( CMACH, 'B' ) ) THEN RMACH = BASE ELSE IF( LSAME( CMACH, 'P' ) ) THEN RMACH = PREC ELSE IF( LSAME( CMACH, 'N' ) ) THEN RMACH = T ELSE IF( LSAME( CMACH, 'R' ) ) THEN RMACH = RND ELSE IF( LSAME( CMACH, 'M' ) ) THEN RMACH = EMIN ELSE IF( LSAME( CMACH, 'U' ) ) THEN RMACH = RMIN ELSE IF( LSAME( CMACH, 'L' ) ) THEN RMACH = EMAX ELSE IF( LSAME( CMACH, 'O' ) ) THEN RMACH = RMAX END IF * DLAMCH = RMACH RETURN * * End of DLAMCH * END octave-1.1.0/libcruft/lapack/dlange.f100666 415 17 7657 5306544265 15635 0ustar jweusers DOUBLE PRECISION FUNCTION DLANGE( NORM, M, N, A, LDA, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER NORM INTEGER LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * * Purpose * ======= * * DLANGE returns the value of the one norm, or the Frobenius norm, or * the infinity norm, or the element of largest absolute value of a * real matrix A. * * Description * =========== * * DLANGE returns the value * * DLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' * ( * ( norm1(A), NORM = '1', 'O' or 'o' * ( * ( normI(A), NORM = 'I' or 'i' * ( * ( normF(A), NORM = 'F', 'f', 'E' or 'e' * * where norm1 denotes the one norm of a matrix (maximum column sum), * normI denotes the infinity norm of a matrix (maximum row sum) and * normF denotes the Frobenius norm of a matrix (square root of sum of * squares). Note that max(abs(A(i,j))) is not a matrix norm. * * Arguments * ========= * * NORM (input) CHARACTER*1 * Specifies the value to be returned in DLANGE as described * above. * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. When M = 0, * DLANGE is set to zero. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. When N = 0, * DLANGE is set to zero. * * A (input) DOUBLE PRECISION array, dimension (LDA,N) * The m by n matrix A. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(M,1). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK), * where LWORK >= M when NORM = 'I'; otherwise, WORK is not * referenced. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J DOUBLE PRECISION SCALE, SUM, VALUE * .. * .. External Subroutines .. EXTERNAL DLASSQ * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * IF( MIN( M, N ).EQ.0 ) THEN VALUE = ZERO ELSE IF( LSAME( NORM, 'M' ) ) THEN * * Find max(abs(A(i,j))). * VALUE = ZERO DO 20 J = 1, N DO 10 I = 1, M VALUE = MAX( VALUE, ABS( A( I, J ) ) ) 10 CONTINUE 20 CONTINUE ELSE IF( ( LSAME( NORM, 'O' ) ) .OR. ( NORM.EQ.'1' ) ) THEN * * Find norm1(A). * VALUE = ZERO DO 40 J = 1, N SUM = ZERO DO 30 I = 1, M SUM = SUM + ABS( A( I, J ) ) 30 CONTINUE VALUE = MAX( VALUE, SUM ) 40 CONTINUE ELSE IF( LSAME( NORM, 'I' ) ) THEN * * Find normI(A). * DO 50 I = 1, M WORK( I ) = ZERO 50 CONTINUE DO 70 J = 1, N DO 60 I = 1, M WORK( I ) = WORK( I ) + ABS( A( I, J ) ) 60 CONTINUE 70 CONTINUE VALUE = ZERO DO 80 I = 1, M VALUE = MAX( VALUE, WORK( I ) ) 80 CONTINUE ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN * * Find normF(A). * SCALE = ZERO SUM = ONE DO 90 J = 1, N CALL DLASSQ( M, A( 1, J ), 1, SCALE, SUM ) 90 CONTINUE VALUE = SCALE*SQRT( SUM ) END IF * DLANGE = VALUE RETURN * * End of DLANGE * END octave-1.1.0/libcruft/lapack/dlanhs.f100666 415 17 7637 5306544263 15650 0ustar jweusers DOUBLE PRECISION FUNCTION DLANHS( NORM, N, A, LDA, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER NORM INTEGER LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), WORK( * ) * .. * * Purpose * ======= * * DLANHS returns the value of the one norm, or the Frobenius norm, or * the infinity norm, or the element of largest absolute value of a * Hessenberg matrix A. * * Description * =========== * * DLANHS returns the value * * DLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' * ( * ( norm1(A), NORM = '1', 'O' or 'o' * ( * ( normI(A), NORM = 'I' or 'i' * ( * ( normF(A), NORM = 'F', 'f', 'E' or 'e' * * where norm1 denotes the one norm of a matrix (maximum column sum), * normI denotes the infinity norm of a matrix (maximum row sum) and * normF denotes the Frobenius norm of a matrix (square root of sum of * squares). Note that max(abs(A(i,j))) is not a matrix norm. * * Arguments * ========= * * NORM (input) CHARACTER*1 * Specifies the value to be returned in DLANHS as described * above. * * N (input) INTEGER * The order of the matrix A. N >= 0. When N = 0, DLANHS is * set to zero. * * A (input) DOUBLE PRECISION array, dimension (LDA,N) * The n by n upper Hessenberg matrix A; the part of A below the * first sub-diagonal is not referenced. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(N,1). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK), * where LWORK >= N when NORM = 'I'; otherwise, WORK is not * referenced. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J DOUBLE PRECISION SCALE, SUM, VALUE * .. * .. External Subroutines .. EXTERNAL DLASSQ * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * IF( N.EQ.0 ) THEN VALUE = ZERO ELSE IF( LSAME( NORM, 'M' ) ) THEN * * Find max(abs(A(i,j))). * VALUE = ZERO DO 20 J = 1, N DO 10 I = 1, MIN( N, J+1 ) VALUE = MAX( VALUE, ABS( A( I, J ) ) ) 10 CONTINUE 20 CONTINUE ELSE IF( ( LSAME( NORM, 'O' ) ) .OR. ( NORM.EQ.'1' ) ) THEN * * Find norm1(A). * VALUE = ZERO DO 40 J = 1, N SUM = ZERO DO 30 I = 1, MIN( N, J+1 ) SUM = SUM + ABS( A( I, J ) ) 30 CONTINUE VALUE = MAX( VALUE, SUM ) 40 CONTINUE ELSE IF( LSAME( NORM, 'I' ) ) THEN * * Find normI(A). * DO 50 I = 1, N WORK( I ) = ZERO 50 CONTINUE DO 70 J = 1, N DO 60 I = 1, MIN( N, J+1 ) WORK( I ) = WORK( I ) + ABS( A( I, J ) ) 60 CONTINUE 70 CONTINUE VALUE = ZERO DO 80 I = 1, N VALUE = MAX( VALUE, WORK( I ) ) 80 CONTINUE ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN * * Find normF(A). * SCALE = ZERO SUM = ONE DO 90 J = 1, N CALL DLASSQ( MIN( N, J+1 ), A( 1, J ), 1, SCALE, SUM ) 90 CONTINUE VALUE = SCALE*SQRT( SUM ) END IF * DLANHS = VALUE RETURN * * End of DLANHS * END octave-1.1.0/libcruft/lapack/dlanv2.f100666 415 17 11135 5306544263 15571 0ustar jweusers SUBROUTINE DLANV2( A, B, C, D, RT1R, RT1I, RT2R, RT2I, CS, SN ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION A, B, C, CS, D, RT1I, RT1R, RT2I, RT2R, SN * .. * * Purpose * ======= * * DLANV2 computes the Schur factorization of a real 2-by-2 nonsymmetric * matrix in standard form: * * [ A B ] = [ CS -SN ] [ AA BB ] [ CS SN ] * [ C D ] [ SN CS ] [ CC DD ] [-SN CS ] * * where either * 1) CC = 0 so that AA and DD are real eigenvalues of the matrix, or * 2) AA = DD and BB*CC < 0, so that AA + or - sqrt(BB*CC) are complex * conjugate eigenvalues. * * Arguments * ========= * * A (input/output) DOUBLE PRECISION * B (input/output) DOUBLE PRECISION * C (input/output) DOUBLE PRECISION * D (input/output) DOUBLE PRECISION * On entry, the elements of the input matrix. * On exit, they are overwritten by the elements of the * standardised Schur form. * * RT1R (output) DOUBLE PRECISION * RT1I (output) DOUBLE PRECISION * RT2R (output) DOUBLE PRECISION * RT2I (output) DOUBLE PRECISION * The real and imaginary parts of the eigenvalues. If the * eigenvalues are both real, abs(RT1R) >= abs(RT2R); if the * eigenvalues are a complex conjugate pair, RT1I > 0. * * CS (output) DOUBLE PRECISION * SN (output) DOUBLE PRECISION * Parameters of the rotation matrix. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, HALF, ONE PARAMETER ( ZERO = 0.0D+0, HALF = 0.5D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. DOUBLE PRECISION AA, BB, CC, CS1, DD, P, SAB, SAC, SIGMA, SN1, $ TAU, TEMP * .. * .. External Functions .. DOUBLE PRECISION DLAPY2 EXTERNAL DLAPY2 * .. * .. Intrinsic Functions .. INTRINSIC ABS, SIGN, SQRT * .. * .. Executable Statements .. * * Initialize CS and SN * CS = ONE SN = ZERO * IF( C.EQ.ZERO ) THEN GO TO 10 * ELSE IF( B.EQ.ZERO ) THEN * * Swap rows and columns * CS = ZERO SN = ONE TEMP = D D = A A = TEMP B = -C C = ZERO GO TO 10 ELSE IF( A.EQ.D .AND. SIGN( ONE, B ).NE.SIGN( ONE, C ) ) THEN GO TO 10 ELSE * * Make diagonal elements equal * TEMP = A - D P = HALF*TEMP SIGMA = B + C TAU = DLAPY2( SIGMA, TEMP ) CS1 = SQRT( HALF*( ONE+ABS( SIGMA ) / TAU ) ) SN1 = -( P / ( TAU*CS1 ) )*SIGN( ONE, SIGMA ) * * Compute [ AA BB ] = [ A B ] [ CS1 -SN1 ] * [ CC DD ] [ C D ] [ SN1 CS1 ] * AA = A*CS1 + B*SN1 BB = -A*SN1 + B*CS1 CC = C*CS1 + D*SN1 DD = -C*SN1 + D*CS1 * * Compute [ A B ] = [ CS1 SN1 ] [ AA BB ] * [ C D ] [-SN1 CS1 ] [ CC DD ] * A = AA*CS1 + CC*SN1 B = BB*CS1 + DD*SN1 C = -AA*SN1 + CC*CS1 D = -BB*SN1 + DD*CS1 * * Accumulate transformation * TEMP = CS*CS1 - SN*SN1 SN = CS*SN1 + SN*CS1 CS = TEMP * TEMP = HALF*( A+D ) A = TEMP D = TEMP * IF( C.NE.ZERO ) THEN IF( B.NE.ZERO ) THEN IF( SIGN( ONE, B ).EQ.SIGN( ONE, C ) ) THEN * * Real eigenvalues: reduce to upper triangular form * SAB = SQRT( ABS( B ) ) SAC = SQRT( ABS( C ) ) P = SIGN( SAB*SAC, C ) TAU = ONE / SQRT( ABS( B+C ) ) A = TEMP + P D = TEMP - P B = B - C C = ZERO CS1 = SAB*TAU SN1 = SAC*TAU TEMP = CS*CS1 - SN*SN1 SN = CS*SN1 + SN*CS1 CS = TEMP END IF ELSE B = -C C = ZERO TEMP = CS CS = -SN SN = TEMP END IF END IF END IF * 10 CONTINUE * * Store eigenvalues in (RT1R,RT1I) and (RT2R,RT2I). * RT1R = A RT2R = D IF( C.EQ.ZERO ) THEN RT1I = ZERO RT2I = ZERO ELSE RT1I = SQRT( ABS( B ) )*SQRT( ABS( C ) ) RT2I = -RT1I END IF RETURN * * End of DLANV2 * END octave-1.1.0/libcruft/lapack/dlapy2.f100666 415 17 2421 5306544264 15555 0ustar jweusers DOUBLE PRECISION FUNCTION DLAPY2( X, Y ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION X, Y * .. * * Purpose * ======= * * DLAPY2 returns sqrt(x**2+y**2), taking care not to cause unnecessary * overflow. * * Arguments * ========= * * X (input) DOUBLE PRECISION * Y (input) DOUBLE PRECISION * X and Y specify the values x and y. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) * .. * .. Local Scalars .. DOUBLE PRECISION W, XABS, YABS, Z * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * XABS = ABS( X ) YABS = ABS( Y ) W = MAX( XABS, YABS ) Z = MIN( XABS, YABS ) IF( Z.EQ.ZERO ) THEN DLAPY2 = W ELSE DLAPY2 = W*SQRT( ONE+( Z / W )**2 ) END IF RETURN * * End of DLAPY2 * END octave-1.1.0/libcruft/lapack/dlapy3.f100666 415 17 2463 5306544275 15566 0ustar jweusers DOUBLE PRECISION FUNCTION DLAPY3( X, Y, Z ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION X, Y, Z * .. * * Purpose * ======= * * DLAPY3 returns sqrt(x**2+y**2+z**2), taking care not to cause * unnecessary overflow. * * Arguments * ========= * * X (input) DOUBLE PRECISION * Y (input) DOUBLE PRECISION * Z (input) DOUBLE PRECISION * X, Y and Z specify the values x, y and z. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) * .. * .. Local Scalars .. DOUBLE PRECISION W, XABS, YABS, ZABS * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, SQRT * .. * .. Executable Statements .. * XABS = ABS( X ) YABS = ABS( Y ) ZABS = ABS( Z ) W = MAX( XABS, YABS, ZABS ) IF( W.EQ.ZERO ) THEN DLAPY3 = ZERO ELSE DLAPY3 = W*SQRT( ( XABS / W )**2+( YABS / W )**2+ $ ( ZABS / W )**2 ) END IF RETURN * * End of DLAPY3 * END octave-1.1.0/libcruft/lapack/dlarfb.f100666 415 17 42314 5306544264 15641 0ustar jweusers SUBROUTINE DLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, $ T, LDT, C, LDC, WORK, LDWORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, SIDE, STOREV, TRANS INTEGER K, LDC, LDT, LDV, LDWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION C( LDC, * ), T( LDT, * ), V( LDV, * ), $ WORK( LDWORK, * ) * .. * * Purpose * ======= * * DLARFB applies a real block reflector H or its transpose H' to a * real m by n matrix C, from either the left or the right. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply H or H' from the Left * = 'R': apply H or H' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply H (No transpose) * = 'T': apply H' (Transpose) * * DIRECT (input) CHARACTER*1 * Indicates how H is formed from a product of elementary * reflectors * = 'F': H = H(1) H(2) . . . H(k) (Forward) * = 'B': H = H(k) . . . H(2) H(1) (Backward) * * STOREV (input) CHARACTER*1 * Indicates how the vectors which define the elementary * reflectors are stored: * = 'C': Columnwise * = 'R': Rowwise * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * K (input) INTEGER * The order of the matrix T (= the number of elementary * reflectors whose product defines the block reflector). * * V (input) DOUBLE PRECISION array, dimension * (LDV,K) if STOREV = 'C' * (LDV,M) if STOREV = 'R' and SIDE = 'L' * (LDV,N) if STOREV = 'R' and SIDE = 'R' * The matrix V. See further details. * * LDV (input) INTEGER * The leading dimension of the array V. * If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); * if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); * if STOREV = 'R', LDV >= K. * * T (input) DOUBLE PRECISION array, dimension (LDT,K) * The triangular k by k matrix T in the representation of the * block reflector. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= K. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by H*C or H'*C or C*H or C*H'. * * LDC (input) INTEGER * The leading dimension of the array C. LDA >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension (LDWORK,K) * * LDWORK (input) INTEGER * The leading dimension of the array WORK. * If SIDE = 'L', LDWORK >= max(1,N); * if SIDE = 'R', LDWORK >= max(1,M). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. CHARACTER TRANST INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DCOPY, DGEMM, DTRMM * .. * .. Executable Statements .. * * Quick return if possible * IF( M.LE.0 .OR. N.LE.0 ) $ RETURN * IF( LSAME( TRANS, 'N' ) ) THEN TRANST = 'T' ELSE TRANST = 'N' END IF * IF( LSAME( STOREV, 'C' ) ) THEN * IF( LSAME( DIRECT, 'F' ) ) THEN * * Let V = ( V1 ) (first K rows) * ( V2 ) * where V1 is unit lower triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V = (C1'*V1 + C2'*V2) (stored in WORK) * * W := C1' * DO 10 J = 1, K CALL DCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) 10 CONTINUE * * W := W * V1 * CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N, $ K, ONE, V, LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C2'*V2 * CALL DGEMM( 'Transpose', 'No transpose', N, K, M-K, $ ONE, C( K+1, 1 ), LDC, V( K+1, 1 ), LDV, $ ONE, WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL DTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V * W' * IF( M.GT.K ) THEN * * C2 := C2 - V2 * W' * CALL DGEMM( 'No transpose', 'Transpose', M-K, N, K, $ -ONE, V( K+1, 1 ), LDV, WORK, LDWORK, ONE, $ C( K+1, 1 ), LDC ) END IF * * W := W * V1' * CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', N, K, $ ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W' * DO 30 J = 1, K DO 20 I = 1, N C( J, I ) = C( J, I ) - WORK( I, J ) 20 CONTINUE 30 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V = (C1*V1 + C2*V2) (stored in WORK) * * W := C1 * DO 40 J = 1, K CALL DCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 ) 40 CONTINUE * * W := W * V1 * CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M, $ K, ONE, V, LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C2 * V2 * CALL DGEMM( 'No transpose', 'No transpose', M, K, N-K, $ ONE, C( 1, K+1 ), LDC, V( K+1, 1 ), LDV, $ ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL DTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V' * IF( N.GT.K ) THEN * * C2 := C2 - W * V2' * CALL DGEMM( 'No transpose', 'Transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V( K+1, 1 ), LDV, ONE, $ C( 1, K+1 ), LDC ) END IF * * W := W * V1' * CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', M, K, $ ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 60 J = 1, K DO 50 I = 1, M C( I, J ) = C( I, J ) - WORK( I, J ) 50 CONTINUE 60 CONTINUE END IF * ELSE * * Let V = ( V1 ) * ( V2 ) (last K rows) * where V2 is unit upper triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V = (C1'*V1 + C2'*V2) (stored in WORK) * * W := C2' * DO 70 J = 1, K CALL DCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 ) 70 CONTINUE * * W := W * V2 * CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N, $ K, ONE, V( M-K+1, 1 ), LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C1'*V1 * CALL DGEMM( 'Transpose', 'No transpose', N, K, M-K, $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL DTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V * W' * IF( M.GT.K ) THEN * * C1 := C1 - V1 * W' * CALL DGEMM( 'No transpose', 'Transpose', M-K, N, K, $ -ONE, V, LDV, WORK, LDWORK, ONE, C, LDC ) END IF * * W := W * V2' * CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', N, K, $ ONE, V( M-K+1, 1 ), LDV, WORK, LDWORK ) * * C2 := C2 - W' * DO 90 J = 1, K DO 80 I = 1, N C( M-K+J, I ) = C( M-K+J, I ) - WORK( I, J ) 80 CONTINUE 90 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V = (C1*V1 + C2*V2) (stored in WORK) * * W := C2 * DO 100 J = 1, K CALL DCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 ) 100 CONTINUE * * W := W * V2 * CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M, $ K, ONE, V( N-K+1, 1 ), LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C1 * V1 * CALL DGEMM( 'No transpose', 'No transpose', M, K, N-K, $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL DTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V' * IF( N.GT.K ) THEN * * C1 := C1 - W * V1' * CALL DGEMM( 'No transpose', 'Transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V, LDV, ONE, C, LDC ) END IF * * W := W * V2' * CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', M, K, $ ONE, V( N-K+1, 1 ), LDV, WORK, LDWORK ) * * C2 := C2 - W * DO 120 J = 1, K DO 110 I = 1, M C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J ) 110 CONTINUE 120 CONTINUE END IF END IF * ELSE IF( LSAME( STOREV, 'R' ) ) THEN * IF( LSAME( DIRECT, 'F' ) ) THEN * * Let V = ( V1 V2 ) (V1: first K columns) * where V1 is unit upper triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V' = (C1'*V1' + C2'*V2') (stored in WORK) * * W := C1' * DO 130 J = 1, K CALL DCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) 130 CONTINUE * * W := W * V1' * CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', N, K, $ ONE, V, LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C2'*V2' * CALL DGEMM( 'Transpose', 'Transpose', N, K, M-K, ONE, $ C( K+1, 1 ), LDC, V( 1, K+1 ), LDV, ONE, $ WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL DTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V' * W' * IF( M.GT.K ) THEN * * C2 := C2 - V2' * W' * CALL DGEMM( 'Transpose', 'Transpose', M-K, N, K, -ONE, $ V( 1, K+1 ), LDV, WORK, LDWORK, ONE, $ C( K+1, 1 ), LDC ) END IF * * W := W * V1 * CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N, $ K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W' * DO 150 J = 1, K DO 140 I = 1, N C( J, I ) = C( J, I ) - WORK( I, J ) 140 CONTINUE 150 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V' = (C1*V1' + C2*V2') (stored in WORK) * * W := C1 * DO 160 J = 1, K CALL DCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 ) 160 CONTINUE * * W := W * V1' * CALL DTRMM( 'Right', 'Upper', 'Transpose', 'Unit', M, K, $ ONE, V, LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C2 * V2' * CALL DGEMM( 'No transpose', 'Transpose', M, K, N-K, $ ONE, C( 1, K+1 ), LDC, V( 1, K+1 ), LDV, $ ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL DTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V * IF( N.GT.K ) THEN * * C2 := C2 - W * V2 * CALL DGEMM( 'No transpose', 'No transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V( 1, K+1 ), LDV, ONE, $ C( 1, K+1 ), LDC ) END IF * * W := W * V1 * CALL DTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M, $ K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 180 J = 1, K DO 170 I = 1, M C( I, J ) = C( I, J ) - WORK( I, J ) 170 CONTINUE 180 CONTINUE * END IF * ELSE * * Let V = ( V1 V2 ) (V2: last K columns) * where V2 is unit lower triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V' = (C1'*V1' + C2'*V2') (stored in WORK) * * W := C2' * DO 190 J = 1, K CALL DCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 ) 190 CONTINUE * * W := W * V2' * CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', N, K, $ ONE, V( 1, M-K+1 ), LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C1'*V1' * CALL DGEMM( 'Transpose', 'Transpose', N, K, M-K, ONE, $ C, LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL DTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V' * W' * IF( M.GT.K ) THEN * * C1 := C1 - V1' * W' * CALL DGEMM( 'Transpose', 'Transpose', M-K, N, K, -ONE, $ V, LDV, WORK, LDWORK, ONE, C, LDC ) END IF * * W := W * V2 * CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N, $ K, ONE, V( 1, M-K+1 ), LDV, WORK, LDWORK ) * * C2 := C2 - W' * DO 210 J = 1, K DO 200 I = 1, N C( M-K+J, I ) = C( M-K+J, I ) - WORK( I, J ) 200 CONTINUE 210 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V' = (C1*V1' + C2*V2') (stored in WORK) * * W := C2 * DO 220 J = 1, K CALL DCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 ) 220 CONTINUE * * W := W * V2' * CALL DTRMM( 'Right', 'Lower', 'Transpose', 'Unit', M, K, $ ONE, V( 1, N-K+1 ), LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C1 * V1' * CALL DGEMM( 'No transpose', 'Transpose', M, K, N-K, $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL DTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V * IF( N.GT.K ) THEN * * C1 := C1 - W * V1 * CALL DGEMM( 'No transpose', 'No transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V, LDV, ONE, C, LDC ) END IF * * W := W * V2 * CALL DTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M, $ K, ONE, V( 1, N-K+1 ), LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 240 J = 1, K DO 230 I = 1, M C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J ) 230 CONTINUE 240 CONTINUE * END IF * END IF END IF * RETURN * * End of DLARFB * END octave-1.1.0/libcruft/lapack/dlarfg.f100666 415 17 7020 5306544264 15621 0ustar jweusers SUBROUTINE DLARFG( N, ALPHA, X, INCX, TAU ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INCX, N DOUBLE PRECISION ALPHA, TAU * .. * .. Array Arguments .. DOUBLE PRECISION X( * ) * .. * * Purpose * ======= * * DLARFG generates a real elementary reflector H of order n, such * that * * H * ( alpha ) = ( beta ), H' * H = I. * ( x ) ( 0 ) * * where alpha and beta are scalars, and x is an (n-1)-element real * vector. H is represented in the form * * H = I - tau * ( 1 ) * ( 1 v' ) , * ( v ) * * where tau is a real scalar and v is a real (n-1)-element * vector. * * If the elements of x are all zero, then tau = 0 and H is taken to be * the unit matrix. * * Otherwise 1 <= tau <= 2. * * Arguments * ========= * * N (input) INTEGER * The order of the elementary reflector. * * ALPHA (input/output) DOUBLE PRECISION * On entry, the value alpha. * On exit, it is overwritten with the value beta. * * X (input/output) DOUBLE PRECISION array, dimension * (1+(N-2)*abs(INCX)) * On entry, the vector x. * On exit, it is overwritten with the vector v. * * INCX (input) INTEGER * The increment between elements of X. INCX <> 0. * * TAU (output) DOUBLE PRECISION * The value tau. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER J, KNT DOUBLE PRECISION BETA, RSAFMN, SAFMIN, XNORM * .. * .. External Functions .. DOUBLE PRECISION DLAMCH, DLAPY2, DNRM2 EXTERNAL DLAMCH, DLAPY2, DNRM2 * .. * .. Intrinsic Functions .. INTRINSIC ABS, SIGN * .. * .. External Subroutines .. EXTERNAL DSCAL * .. * .. Executable Statements .. * IF( N.LE.1 ) THEN TAU = ZERO RETURN END IF * XNORM = DNRM2( N-1, X, INCX ) * IF( XNORM.EQ.ZERO ) THEN * * H = I * TAU = ZERO ELSE * * general case * BETA = -SIGN( DLAPY2( ALPHA, XNORM ), ALPHA ) SAFMIN = DLAMCH( 'S' ) IF( ABS( BETA ).LT.SAFMIN ) THEN * * XNORM, BETA may be inaccurate; scale X and recompute them * RSAFMN = ONE / SAFMIN KNT = 0 10 CONTINUE KNT = KNT + 1 CALL DSCAL( N-1, RSAFMN, X, INCX ) BETA = BETA*RSAFMN ALPHA = ALPHA*RSAFMN IF( ABS( BETA ).LT.SAFMIN ) $ GO TO 10 * * New BETA is at most 1, at least SAFMIN * XNORM = DNRM2( N-1, X, INCX ) BETA = -SIGN( DLAPY2( ALPHA, XNORM ), ALPHA ) TAU = ( BETA-ALPHA ) / BETA CALL DSCAL( N-1, ONE / ( ALPHA-BETA ), X, INCX ) * * If ALPHA is subnormal, it may lose relative accuracy * ALPHA = BETA DO 20 J = 1, KNT ALPHA = ALPHA*SAFMIN 20 CONTINUE ELSE TAU = ( BETA-ALPHA ) / BETA CALL DSCAL( N-1, ONE / ( ALPHA-BETA ), X, INCX ) ALPHA = BETA END IF END IF * RETURN * * End of DLARFG * END octave-1.1.0/libcruft/lapack/dlarft.f100666 415 17 16002 5306544263 15655 0ustar jweusers SUBROUTINE DLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, STOREV INTEGER K, LDT, LDV, N * .. * .. Array Arguments .. DOUBLE PRECISION T( LDT, * ), TAU( * ), V( LDV, * ) * .. * * Purpose * ======= * * DLARFT forms the triangular factor T of a real block reflector H * of order n, which is defined as a product of k elementary reflectors. * * If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular; * * If DIRECT = 'B', H = H(k) . . . H(2) H(1) and T is lower triangular. * * If STOREV = 'C', the vector which defines the elementary reflector * H(i) is stored in the i-th column of the array V, and * * H = I - V * T * V' * * If STOREV = 'R', the vector which defines the elementary reflector * H(i) is stored in the i-th row of the array V, and * * H = I - V' * T * V * * Arguments * ========= * * DIRECT (input) CHARACTER*1 * Specifies the order in which the elementary reflectors are * multiplied to form the block reflector: * = 'F': H = H(1) H(2) . . . H(k) (Forward) * = 'B': H = H(k) . . . H(2) H(1) (Backward) * * STOREV (input) CHARACTER*1 * Specifies how the vectors which define the elementary * reflectors are stored (see also Further Details): * = 'C': columnwise * = 'R': rowwise * * N (input) INTEGER * The order of the block reflector H. N >= 0. * * K (input) INTEGER * The order of the triangular factor T (= the number of * elementary reflectors). K >= 1. * * V (input/output) DOUBLE PRECISION array, dimension * (LDV,K) if STOREV = 'C' * (LDV,N) if STOREV = 'R' * The matrix V. See further details. * * LDV (input) INTEGER * The leading dimension of the array V. * If STOREV = 'C', LDV >= max(1,N); if STOREV = 'R', LDV >= K. * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i). * * T (output) DOUBLE PRECISION array, dimension (LDT,K) * The k by k triangular factor T of the block reflector. * If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is * lower triangular. The rest of the array is not used. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= K. * * Further Details * =============== * * The shape of the matrix V and the storage of the vectors which define * the H(i) is best illustrated by the following example with n = 5 and * k = 3. The elements equal to 1 are not stored; the corresponding * array elements are modified but restored on exit. The rest of the * array is not used. * * DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R': * * V = ( 1 ) V = ( 1 v1 v1 v1 v1 ) * ( v1 1 ) ( 1 v2 v2 v2 ) * ( v1 v2 1 ) ( 1 v3 v3 ) * ( v1 v2 v3 ) * ( v1 v2 v3 ) * * DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R': * * V = ( v1 v2 v3 ) V = ( v1 v1 1 ) * ( v1 v2 v3 ) ( v2 v2 v2 1 ) * ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) * ( 1 v3 ) * ( 1 ) * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J DOUBLE PRECISION VII * .. * .. External Subroutines .. EXTERNAL DGEMV, DTRMV * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Executable Statements .. * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * IF( LSAME( DIRECT, 'F' ) ) THEN DO 20 I = 1, K IF( TAU( I ).EQ.ZERO ) THEN * * H(i) = I * DO 10 J = 1, I T( J, I ) = ZERO 10 CONTINUE ELSE * * general case * VII = V( I, I ) V( I, I ) = ONE IF( LSAME( STOREV, 'C' ) ) THEN * * T(1:i-1,i) := - tau(i) * V(i:n,1:i-1)' * V(i:n,i) * CALL DGEMV( 'Transpose', N-I+1, I-1, -TAU( I ), $ V( I, 1 ), LDV, V( I, I ), 1, ZERO, $ T( 1, I ), 1 ) ELSE * * T(1:i-1,i) := - tau(i) * V(1:i-1,i:n) * V(i,i:n)' * CALL DGEMV( 'No transpose', I-1, N-I+1, -TAU( I ), $ V( 1, I ), LDV, V( I, I ), LDV, ZERO, $ T( 1, I ), 1 ) END IF V( I, I ) = VII * * T(1:i-1,i) := T(1:i-1,1:i-1) * T(1:i-1,i) * CALL DTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T, $ LDT, T( 1, I ), 1 ) T( I, I ) = TAU( I ) END IF 20 CONTINUE ELSE DO 40 I = K, 1, -1 IF( TAU( I ).EQ.ZERO ) THEN * * H(i) = I * DO 30 J = I, K T( J, I ) = ZERO 30 CONTINUE ELSE * * general case * IF( I.LT.K ) THEN IF( LSAME( STOREV, 'C' ) ) THEN VII = V( N-K+I, I ) V( N-K+I, I ) = ONE * * T(i+1:k,i) := * - tau(i) * V(1:n-k+i,i+1:k)' * V(1:n-k+i,i) * CALL DGEMV( 'Transpose', N-K+I, K-I, -TAU( I ), $ V( 1, I+1 ), LDV, V( 1, I ), 1, ZERO, $ T( I+1, I ), 1 ) V( N-K+I, I ) = VII ELSE VII = V( I, N-K+I ) V( I, N-K+I ) = ONE * * T(i+1:k,i) := * - tau(i) * V(i+1:k,1:n-k+i) * V(i,1:n-k+i)' * CALL DGEMV( 'No transpose', K-I, N-K+I, -TAU( I ), $ V( I+1, 1 ), LDV, V( I, 1 ), LDV, ZERO, $ T( I+1, I ), 1 ) V( I, N-K+I ) = VII END IF * * T(i+1:k,i) := T(i+1:k,i+1:k) * T(i+1:k,i) * CALL DTRMV( 'Lower', 'No transpose', 'Non-unit', K-I, $ T( I+1, I+1 ), LDT, T( I+1, I ), 1 ) END IF T( I, I ) = TAU( I ) END IF 40 CONTINUE END IF RETURN * * End of DLARFT * END octave-1.1.0/libcruft/lapack/dlarfx.f100666 415 17 42507 5306544262 15671 0ustar jweusers SUBROUTINE DLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE INTEGER LDC, M, N DOUBLE PRECISION TAU * .. * .. Array Arguments .. DOUBLE PRECISION C( LDC, * ), V( * ), WORK( * ) * .. * * Purpose * ======= * * DLARFX applies a real elementary reflector H to a real m by n * matrix C, from either the left or the right. H is represented in the * form * * H = I - tau * v * v' * * where tau is a real scalar and v is a real vector. * * If tau = 0, then H is taken to be the unit matrix * * This version uses inline code if H has order < 11. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': form H * C * = 'R': form C * H * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * V (input) DOUBLE PRECISION array, dimension (M) if SIDE = 'L' * or (N) if SIDE = 'R' * The vector v in the representation of H. * * TAU (input) DOUBLE PRECISION * The value tau in the representation of H. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by the matrix H * C if SIDE = 'L', * or C * H if SIDE = 'R'. * * LDC (input) INTEGER * The leading dimension of the array C. LDA >= (1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension * (N) if SIDE = 'L' * or (M) if SIDE = 'R' * WORK is not referenced if H has order < 11. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER J DOUBLE PRECISION SUM, T1, T10, T2, T3, T4, T5, T6, T7, T8, T9, $ V1, V10, V2, V3, V4, V5, V6, V7, V8, V9 * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DGEMV, DGER * .. * .. Executable Statements .. * IF( TAU.EQ.ZERO ) $ RETURN IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C, where H has order m. * GO TO ( 10, 30, 50, 70, 90, 110, 130, 150, $ 170, 190 )M * * Code for general M * * w := C'*v * CALL DGEMV( 'Transpose', M, N, ONE, C, LDC, V, 1, ZERO, WORK, $ 1 ) * * C := C - tau * v * w' * CALL DGER( M, N, -TAU, V, 1, WORK, 1, C, LDC ) GO TO 410 10 CONTINUE * * Special code for 1 x 1 Householder * T1 = ONE - TAU*V( 1 )*V( 1 ) DO 20 J = 1, N C( 1, J ) = T1*C( 1, J ) 20 CONTINUE GO TO 410 30 CONTINUE * * Special code for 2 x 2 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 DO 40 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 40 CONTINUE GO TO 410 50 CONTINUE * * Special code for 3 x 3 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 DO 60 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 60 CONTINUE GO TO 410 70 CONTINUE * * Special code for 4 x 4 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 DO 80 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 80 CONTINUE GO TO 410 90 CONTINUE * * Special code for 5 x 5 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 DO 100 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 100 CONTINUE GO TO 410 110 CONTINUE * * Special code for 6 x 6 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 DO 120 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 120 CONTINUE GO TO 410 130 CONTINUE * * Special code for 7 x 7 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 DO 140 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 140 CONTINUE GO TO 410 150 CONTINUE * * Special code for 8 x 8 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 DO 160 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 160 CONTINUE GO TO 410 170 CONTINUE * * Special code for 9 x 9 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 V9 = V( 9 ) T9 = TAU*V9 DO 180 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) + V9*C( 9, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 C( 9, J ) = C( 9, J ) - SUM*T9 180 CONTINUE GO TO 410 190 CONTINUE * * Special code for 10 x 10 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 V9 = V( 9 ) T9 = TAU*V9 V10 = V( 10 ) T10 = TAU*V10 DO 200 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) + V9*C( 9, J ) + $ V10*C( 10, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 C( 9, J ) = C( 9, J ) - SUM*T9 C( 10, J ) = C( 10, J ) - SUM*T10 200 CONTINUE GO TO 410 ELSE * * Form C * H, where H has order n. * GO TO ( 210, 230, 250, 270, 290, 310, 330, 350, $ 370, 390 )N * * Code for general N * * w := C * v * CALL DGEMV( 'No transpose', M, N, ONE, C, LDC, V, 1, ZERO, $ WORK, 1 ) * * C := C - tau * w * v' * CALL DGER( M, N, -TAU, WORK, 1, V, 1, C, LDC ) GO TO 410 210 CONTINUE * * Special code for 1 x 1 Householder * T1 = ONE - TAU*V( 1 )*V( 1 ) DO 220 J = 1, M C( J, 1 ) = T1*C( J, 1 ) 220 CONTINUE GO TO 410 230 CONTINUE * * Special code for 2 x 2 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 DO 240 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 240 CONTINUE GO TO 410 250 CONTINUE * * Special code for 3 x 3 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 DO 260 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 260 CONTINUE GO TO 410 270 CONTINUE * * Special code for 4 x 4 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 DO 280 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 280 CONTINUE GO TO 410 290 CONTINUE * * Special code for 5 x 5 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 DO 300 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 300 CONTINUE GO TO 410 310 CONTINUE * * Special code for 6 x 6 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 DO 320 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 320 CONTINUE GO TO 410 330 CONTINUE * * Special code for 7 x 7 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 DO 340 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 340 CONTINUE GO TO 410 350 CONTINUE * * Special code for 8 x 8 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 DO 360 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 360 CONTINUE GO TO 410 370 CONTINUE * * Special code for 9 x 9 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 V9 = V( 9 ) T9 = TAU*V9 DO 380 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) + V9*C( J, 9 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 C( J, 9 ) = C( J, 9 ) - SUM*T9 380 CONTINUE GO TO 410 390 CONTINUE * * Special code for 10 x 10 Householder * V1 = V( 1 ) T1 = TAU*V1 V2 = V( 2 ) T2 = TAU*V2 V3 = V( 3 ) T3 = TAU*V3 V4 = V( 4 ) T4 = TAU*V4 V5 = V( 5 ) T5 = TAU*V5 V6 = V( 6 ) T6 = TAU*V6 V7 = V( 7 ) T7 = TAU*V7 V8 = V( 8 ) T8 = TAU*V8 V9 = V( 9 ) T9 = TAU*V9 V10 = V( 10 ) T10 = TAU*V10 DO 400 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) + V9*C( J, 9 ) + $ V10*C( J, 10 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 C( J, 9 ) = C( J, 9 ) - SUM*T9 C( J, 10 ) = C( J, 10 ) - SUM*T10 400 CONTINUE GO TO 410 END IF 410 CONTINUE RETURN * * End of DLARFX * END octave-1.1.0/libcruft/lapack/dlartg.f100666 415 17 4373 5306544262 15645 0ustar jweusers SUBROUTINE DLARTG( F, G, CS, SN, R ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION CS, F, G, R, SN * .. * * Purpose * ======= * * DLARTG generate a plane rotation so that * * [ CS SN ] . [ F ] = [ R ] where CS**2 + SN**2 = 1. * [ -SN CS ] [ G ] [ 0 ] * * This is a faster version of the BLAS1 routine DROTG, except for * the following differences: * F and G are unchanged on return. * If G=0, then CS=1 and SN=0. * If F=0 and (G .ne. 0), then CS=0 and SN=1 without doing any * floating point operations (saves work in DBDSQR when * there are zeros on the diagonal). * * Arguments * ========= * * F (input) DOUBLE PRECISION * The first component of vector to be rotated. * * G (input) DOUBLE PRECISION * The second component of vector to be rotated. * * CS (output) DOUBLE PRECISION * The cosine of the rotation. * * SN (output) DOUBLE PRECISION * The sine of the rotation. * * R (output) DOUBLE PRECISION * The nonzero component of the rotated vector. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) * .. * .. Local Scalars .. DOUBLE PRECISION T, TT * .. * .. Intrinsic Functions .. INTRINSIC ABS, SQRT * .. * .. Executable Statements .. * IF( G.EQ.ZERO ) THEN CS = ONE SN = ZERO R = F ELSE IF( F.EQ.ZERO ) THEN CS = ZERO SN = ONE R = G ELSE IF( ABS( F ).GT.ABS( G ) ) THEN T = G / F TT = SQRT( ONE+T*T ) CS = ONE / TT SN = T*CS R = F*TT ELSE T = F / G TT = SQRT( ONE+T*T ) SN = ONE / TT CS = T*SN R = G*TT END IF END IF RETURN * * End of DLARTG * END octave-1.1.0/libcruft/lapack/dlas2.f100666 415 17 6701 5306544270 15371 0ustar jweusers SUBROUTINE DLAS2( F, G, H, SSMIN, SSMAX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION F, G, H, SSMAX, SSMIN * .. * * Purpose * ======= * * DLAS2 computes the singular values of the 2-by-2 matrix * [ F G ] * [ 0 H ]. * On return, SSMIN is the smaller singular value and SSMAX is the * larger singular value. * * Arguments * ========= * * F (input) DOUBLE PRECISION * The (1,1) entry of the 2-by-2 matrix. * * G (input) DOUBLE PRECISION * The (1,2) entry of the 2-by-2 matrix. * * H (input) DOUBLE PRECISION * The (2,2) entry of the 2-by-2 matrix. * * SSMIN (output) DOUBLE PRECISION * The smaller singular value. * * SSMAX (output) DOUBLE PRECISION * The larger singular value. * * Further Details * =============== * * Barring over/underflow, all output quantities are correct to within * a few units in the last place (ulps), even in the absence of a guard * digit in addition/subtraction. * * In IEEE arithmetic, the code works correctly if one matrix entry is * infinite. * * Overflow will not occur unless the largest singular value itself * overflows, or is within a few ulps of overflow. (On machines with * partial overflow, like the Cray, overflow may occur if the largest * singular value is within a factor of 2 of overflow.) * * Underflow is harmless if underflow is gradual. Otherwise, results * may correspond to a matrix modified by perturbations of size near * the underflow threshold. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) DOUBLE PRECISION TWO PARAMETER ( TWO = 2.0D0 ) * .. * .. Local Scalars .. DOUBLE PRECISION AS, AT, AU, C, FA, FHMN, FHMX, GA, HA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * FA = ABS( F ) GA = ABS( G ) HA = ABS( H ) FHMN = MIN( FA, HA ) FHMX = MAX( FA, HA ) IF( FHMN.EQ.ZERO ) THEN SSMIN = ZERO SSMAX = MAX( FHMX, GA )*SQRT( ONE+ $ ( MIN( FHMX, GA ) / MAX( FHMX, GA ) )**2 ) ELSE IF( GA.LT.FHMX ) THEN AS = ONE + FHMN / FHMX AT = ( FHMX-FHMN ) / FHMX AU = ( GA / FHMX )**2 C = TWO / ( SQRT( AS*AS+AU )+SQRT( AT*AT+AU ) ) SSMIN = FHMN*C SSMAX = FHMX / C ELSE AU = FHMX / GA IF( AU.EQ.ZERO ) THEN * * Avoid possible harmful underflow if exponent range * asymmetric (true SSMIN may not underflow even if * AU underflows) * SSMIN = ( FHMN*FHMX ) / GA SSMAX = GA ELSE AS = ONE + FHMN / FHMX AT = ( FHMX-FHMN ) / FHMX C = ONE / ( SQRT( ONE+( AS*AU )**2 )+ $ SQRT( ONE+( AT*AU )**2 ) ) SSMIN = ( FHMN*C )*AU SSMIN = SSMIN + SSMIN SSMAX = GA / ( C+C ) END IF END IF END IF RETURN * * End of DLAS2 * END octave-1.1.0/libcruft/lapack/dlascl.f100666 415 17 16231 5306544265 15651 0ustar jweusers SUBROUTINE DLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER TYPE INTEGER INFO, KL, KU, LDA, M, N DOUBLE PRECISION CFROM, CTO * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DLASCL multiplies the M by N real matrix A by the real scalar * CTO/CFROM. This is done without over/underflow as long as the final * result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that * A may be full, upper triangular, lower triangular, upper Hessenberg, * or banded. * * Arguments * ========= * * TYPE (input) CHARACTER*1 * TYPE indices the storage type of the input matrix. * = 'G': A is a full matrix. * = 'L': A is a lower triangular matrix. * = 'U': A is an upper triangular matrix. * = 'H': A is an upper Hessenberg matrix. * = 'B': A is a symmetric band matrix with lower bandwidth KL * and upper bandwidth KU and with the only the lower * half stored. * = 'Q': A is a symmetric band matrix with lower bandwidth KL * and upper bandwidth KU and with the only the upper * half stored. * = 'Z': A is a band matrix with lower bandwidth KL and upper * bandwidth KU. * * KL (input) INTEGER * The lower bandwidth of A. Referenced only if TYPE = 'B', * 'Q' or 'Z'. * * KU (input) INTEGER * The upper bandwidth of A. Referenced only if TYPE = 'B', * 'Q' or 'Z'. * * CFROM (input) DOUBLE PRECISION * CTO (input) DOUBLE PRECISION * The matrix A is multiplied by CTO/CFROM. A(I,J) is computed * without over/underflow if the final result CTO*A(I,J)/CFROM * can be represented without over/underflow. CFROM must be * nonzero. * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,M) * The matrix to be multiplied by CTO/CFROM. See TYPE for the * storage type. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * INFO (output) INTEGER * 0 - successful exit * <0 - if INFO = -i, the i-th argument had an illegal value. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL DONE INTEGER I, ITYPE, J, K1, K2, K3, K4 DOUBLE PRECISION BIGNUM, CFROM1, CFROMC, CTO1, CTOC, MUL, SMLNUM * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLAMCH EXTERNAL LSAME, DLAMCH * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN * .. * .. External Subroutines .. EXTERNAL XERBLA * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 * IF( LSAME( TYPE, 'G' ) ) THEN ITYPE = 0 ELSE IF( LSAME( TYPE, 'L' ) ) THEN ITYPE = 1 ELSE IF( LSAME( TYPE, 'U' ) ) THEN ITYPE = 2 ELSE IF( LSAME( TYPE, 'H' ) ) THEN ITYPE = 3 ELSE IF( LSAME( TYPE, 'B' ) ) THEN ITYPE = 4 ELSE IF( LSAME( TYPE, 'Q' ) ) THEN ITYPE = 5 ELSE IF( LSAME( TYPE, 'Z' ) ) THEN ITYPE = 6 ELSE ITYPE = -1 END IF * IF( ITYPE.EQ.-1 ) THEN INFO = -1 ELSE IF( CFROM.EQ.ZERO ) THEN INFO = -4 ELSE IF( M.LT.0 ) THEN INFO = -6 ELSE IF( N.LT.0 .OR. ( ITYPE.EQ.4 .AND. N.NE.M ) .OR. $ ( ITYPE.EQ.5 .AND. N.NE.M ) ) THEN INFO = -7 ELSE IF( ITYPE.LE.3 .AND. LDA.LT.MAX( 1, M ) ) THEN INFO = -9 ELSE IF( ITYPE.GE.4 ) THEN IF( KL.LT.0 .OR. KL.GT.MAX( M-1, 0 ) ) THEN INFO = -2 ELSE IF( KU.LT.0 .OR. KU.GT.MAX( N-1, 0 ) .OR. $ ( ( ITYPE.EQ.4 .OR. ITYPE.EQ.5 ) .AND. KL.NE.KU ) ) $ THEN INFO = -3 ELSE IF( ( ITYPE.EQ.4 .AND. LDA.LT.KL+1 ) .OR. $ ( ITYPE.EQ.5 .AND. LDA.LT.KU+1 ) .OR. $ ( ITYPE.EQ.6 .AND. LDA.LT.2*KL+KU+1 ) ) THEN INFO = -9 END IF END IF * IF( INFO.NE.0 ) THEN CALL XERBLA( 'DLASCL', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 .OR. M.EQ.0 ) $ RETURN * * Get machine parameters * SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM * CFROMC = CFROM CTOC = CTO * 10 CONTINUE CFROM1 = CFROMC*SMLNUM CTO1 = CTOC / BIGNUM IF( ABS( CFROM1 ).GT.ABS( CTOC ) .AND. CTOC.NE.ZERO ) THEN MUL = SMLNUM DONE = .FALSE. CFROMC = CFROM1 ELSE IF( ABS( CTO1 ).GT.ABS( CFROMC ) ) THEN MUL = BIGNUM DONE = .FALSE. CTOC = CTO1 ELSE MUL = CTOC / CFROMC DONE = .TRUE. END IF * IF( ITYPE.EQ.0 ) THEN * * Full matrix * DO 30 J = 1, N DO 20 I = 1, M A( I, J ) = A( I, J )*MUL 20 CONTINUE 30 CONTINUE * ELSE IF( ITYPE.EQ.1 ) THEN * * Lower triangular matrix * DO 50 J = 1, N DO 40 I = J, M A( I, J ) = A( I, J )*MUL 40 CONTINUE 50 CONTINUE * ELSE IF( ITYPE.EQ.2 ) THEN * * Upper triangular matrix * DO 70 J = 1, N DO 60 I = 1, MIN( J, M ) A( I, J ) = A( I, J )*MUL 60 CONTINUE 70 CONTINUE * ELSE IF( ITYPE.EQ.3 ) THEN * * Upper Hessenberg matrix * DO 90 J = 1, N DO 80 I = 1, MIN( J+1, M ) A( I, J ) = A( I, J )*MUL 80 CONTINUE 90 CONTINUE * ELSE IF( ITYPE.EQ.4 ) THEN * * Lower half of a symmetric band matrix * K3 = KL + 1 K4 = N + 1 DO 110 J = 1, N DO 100 I = 1, MIN( K3, K4-J ) A( I, J ) = A( I, J )*MUL 100 CONTINUE 110 CONTINUE * ELSE IF( ITYPE.EQ.5 ) THEN * * Upper half of a symmetric band matrix * K1 = KU + 2 K3 = KU + 1 DO 130 J = 1, N DO 120 I = MAX( K1-J, 1 ), K3 A( I, J ) = A( I, J )*MUL 120 CONTINUE 130 CONTINUE * ELSE IF( ITYPE.EQ.6 ) THEN * * Band matrix * K1 = KL + KU + 2 K2 = KL + 1 K3 = 2*KL + KU + 1 K4 = KL + KU + 1 + M DO 150 J = 1, N DO 140 I = MAX( K1-J, K2 ), MIN( K3, K4-J ) A( I, J ) = A( I, J )*MUL 140 CONTINUE 150 CONTINUE * END IF * IF( .NOT.DONE ) $ GO TO 10 * RETURN * * End of DLASCL * END octave-1.1.0/libcruft/lapack/dlasr.f100666 415 17 26374 5306544270 15521 0ustar jweusers SUBROUTINE DLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, PIVOT, SIDE INTEGER LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( * ), S( * ) * .. * * Purpose * ======= * * DLASR performs the transformation * * A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) * * A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) * * where A is an m by n real matrix and P is an orthogonal matrix, * consisting of a sequence of plane rotations determined by the * parameters PIVOT and DIRECT as follows ( z = m when SIDE = 'L' or 'l' * and z = n when SIDE = 'R' or 'r' ): * * When DIRECT = 'F' or 'f' ( Forward sequence ) then * * P = P( z - 1 )*...*P( 2 )*P( 1 ), * * and when DIRECT = 'B' or 'b' ( Backward sequence ) then * * P = P( 1 )*P( 2 )*...*P( z - 1 ), * * where P( k ) is a plane rotation matrix for the following planes: * * when PIVOT = 'V' or 'v' ( Variable pivot ), * the plane ( k, k + 1 ) * * when PIVOT = 'T' or 't' ( Top pivot ), * the plane ( 1, k + 1 ) * * when PIVOT = 'B' or 'b' ( Bottom pivot ), * the plane ( k, z ) * * c( k ) and s( k ) must contain the cosine and sine that define the * matrix P( k ). The two by two plane rotation part of the matrix * P( k ), R( k ), is assumed to be of the form * * R( k ) = ( c( k ) s( k ) ). * ( -s( k ) c( k ) ) * * This version vectorises across rows of the array A when SIDE = 'L'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * Specifies whether the plane rotation matrix P is applied to * A on the left or the right. * = 'L': Left, compute A := P*A * = 'R': Right, compute A:= A*P' * * DIRECT (input) CHARACTER*1 * Specifies whether P is a forward or backward sequence of * plane rotations. * = 'F': Forward, P = P( z - 1 )*...*P( 2 )*P( 1 ) * = 'B': Backward, P = P( 1 )*P( 2 )*...*P( z - 1 ) * * PIVOT (input) CHARACTER*1 * Specifies the plane for which P(k) is a plane rotation * matrix. * = 'V': Variable pivot, the plane (k,k+1) * = 'T': Top pivot, the plane (1,k+1) * = 'B': Bottom pivot, the plane (k,z) * * M (input) INTEGER * The number of rows of the matrix A. If m <= 1, an immediate * return is effected. * * N (input) INTEGER * The number of columns of the matrix A. If n <= 1, an * immediate return is effected. * * C, S (input) DOUBLE PRECISION arrays, dimension * (M-1) if SIDE = 'L' * (N-1) if SIDE = 'R' * c(k) and s(k) contain the cosine and sine that define the * matrix P(k). The two by two plane rotation part of the * matrix P(k), R(k), is assumed to be of the form * R( k ) = ( c( k ) s( k ) ). * ( -s( k ) c( k ) ) * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * The m by n matrix A. On exit, A is overwritten by P*A if * SIDE = 'R' or by A*P' if SIDE = 'L'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, INFO, J DOUBLE PRECISION CTEMP, STEMP, TEMP * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( .NOT.( LSAME( SIDE, 'L' ) .OR. LSAME( SIDE, 'R' ) ) ) THEN INFO = 1 ELSE IF( .NOT.( LSAME( PIVOT, 'V' ) .OR. LSAME( PIVOT, $ 'T' ) .OR. LSAME( PIVOT, 'B' ) ) ) THEN INFO = 2 ELSE IF( .NOT.( LSAME( DIRECT, 'F' ) .OR. LSAME( DIRECT, 'B' ) ) ) $ THEN INFO = 3 ELSE IF( M.LT.0 ) THEN INFO = 4 ELSE IF( N.LT.0 ) THEN INFO = 5 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = 9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DLASR ', INFO ) RETURN END IF * * Quick return if possible * IF( ( M.EQ.0 ) .OR. ( N.EQ.0 ) ) $ RETURN IF( LSAME( SIDE, 'L' ) ) THEN * * Form P * A * IF( LSAME( PIVOT, 'V' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 20 J = 1, M - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 10 I = 1, N TEMP = A( J+1, I ) A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) 10 CONTINUE END IF 20 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 40 J = M - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 30 I = 1, N TEMP = A( J+1, I ) A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) 30 CONTINUE END IF 40 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'T' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 60 J = 2, M CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 50 I = 1, N TEMP = A( J, I ) A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) 50 CONTINUE END IF 60 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 80 J = M, 2, -1 CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 70 I = 1, N TEMP = A( J, I ) A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) 70 CONTINUE END IF 80 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'B' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 100 J = 1, M - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 90 I = 1, N TEMP = A( J, I ) A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP 90 CONTINUE END IF 100 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 120 J = M - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 110 I = 1, N TEMP = A( J, I ) A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP 110 CONTINUE END IF 120 CONTINUE END IF END IF ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form A * P' * IF( LSAME( PIVOT, 'V' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 140 J = 1, N - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 130 I = 1, M TEMP = A( I, J+1 ) A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) 130 CONTINUE END IF 140 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 160 J = N - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 150 I = 1, M TEMP = A( I, J+1 ) A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) 150 CONTINUE END IF 160 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'T' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 180 J = 2, N CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 170 I = 1, M TEMP = A( I, J ) A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) 170 CONTINUE END IF 180 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 200 J = N, 2, -1 CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 190 I = 1, M TEMP = A( I, J ) A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) 190 CONTINUE END IF 200 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'B' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 220 J = 1, N - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 210 I = 1, M TEMP = A( I, J ) A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP 210 CONTINUE END IF 220 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 240 J = N - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 230 I = 1, M TEMP = A( I, J ) A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP 230 CONTINUE END IF 240 CONTINUE END IF END IF END IF * RETURN * * End of DLASR * END octave-1.1.0/libcruft/lapack/dlaset.f100666 415 17 6214 5306544263 15641 0ustar jweusers SUBROUTINE DLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER LDA, M, N DOUBLE PRECISION ALPHA, BETA * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DLASET initializes an m-by-n matrix A to BETA on the diagonal and * ALPHA on the offdiagonals. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies the part of the matrix A to be set. * = 'U': Upper triangular part is set; the strictly lower * triangular part of A is not changed. * = 'L': Lower triangular part is set; the strictly upper * triangular part of A is not changed. * Otherwise: All of the matrix A is set. * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * ALPHA (input) DOUBLE PRECISION * The constant to which the offdiagonal elements are to be set. * * BETA (input) DOUBLE PRECISION * The constant to which the diagonal elements are to be set. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On exit, the leading m-by-n submatrix of A is set as follows: * * if UPLO = 'U', A(i,j) = ALPHA, 1<=i<=j-1, 1<=j<=n, * if UPLO = 'L', A(i,j) = ALPHA, j+1<=i<=m, 1<=j<=n, * otherwise, A(i,j) = ALPHA, 1<=i<=m, 1<=j<=n, i.ne.j, * * and, for all UPLO, A(i,i) = BETA, 1<=i<=min(m,n). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * ===================================================================== * * .. Local Scalars .. INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * IF( LSAME( UPLO, 'U' ) ) THEN * * Set the strictly upper triangular or trapezoidal part of the * array to ALPHA. * DO 20 J = 2, N DO 10 I = 1, MIN( J-1, M ) A( I, J ) = ALPHA 10 CONTINUE 20 CONTINUE * ELSE IF( LSAME( UPLO, 'L' ) ) THEN * * Set the strictly lower triangular or trapezoidal part of the * array to ALPHA. * DO 40 J = 1, MIN( M, N ) DO 30 I = J + 1, M A( I, J ) = ALPHA 30 CONTINUE 40 CONTINUE * ELSE * * Set the leading m-by-n submatrix to ALPHA. * DO 60 J = 1, N DO 50 I = 1, M A( I, J ) = ALPHA 50 CONTINUE 60 CONTINUE END IF * * Set the first min(M,N) diagonal elements to BETA. * DO 70 I = 1, MIN( M, N ) A( I, I ) = BETA 70 CONTINUE * RETURN * * End of DLASET * END octave-1.1.0/libcruft/lapack/dlassq.f100666 415 17 5147 5306544266 15663 0ustar jweusers SUBROUTINE DLASSQ( N, X, INCX, SCALE, SUMSQ ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, N DOUBLE PRECISION SCALE, SUMSQ * .. * .. Array Arguments .. DOUBLE PRECISION X( * ) * .. * * Purpose * ======= * * DLASSQ returns the values scl and smsq such that * * ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, * * where x( i ) = X( 1 + ( i - 1 )*INCX ). The value of sumsq is * assumed to be non-negative and scl returns the value * * scl = max( scale, abs( x( i ) ) ). * * scale and sumsq must be supplied in SCALE and SUMSQ and * scl and smsq are overwritten on SCALE and SUMSQ respectively. * * The routine makes only one pass through the vector x. * * Arguments * ========= * * N (input) INTEGER * The number of elements to be used from the vector X. * * X (input) DOUBLE PRECISION * The vector for which a scaled sum of squares is computed. * x( i ) = X( 1 + ( i - 1 )*INCX ), 1 <= i <= n. * * INCX (input) INTEGER * The increment between successive values of the vector X. * INCX > 0. * * SCALE (input/output) DOUBLE PRECISION * On entry, the value scale in the equation above. * On exit, SCALE is overwritten with scl , the scaling factor * for the sum of squares. * * SUMSQ (input/output) DOUBLE PRECISION * On entry, the value sumsq in the equation above. * On exit, SUMSQ is overwritten with smsq , the basic sum of * squares from which scl has been factored out. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER IX DOUBLE PRECISION ABSXI * .. * .. Intrinsic Functions .. INTRINSIC ABS * .. * .. Executable Statements .. * IF( N.GT.0 ) THEN DO 10 IX = 1, 1 + ( N-1 )*INCX, INCX IF( X( IX ).NE.ZERO ) THEN ABSXI = ABS( X( IX ) ) IF( SCALE.LT.ABSXI ) THEN SUMSQ = 1 + SUMSQ*( SCALE / ABSXI )**2 SCALE = ABSXI ELSE SUMSQ = SUMSQ + ( ABSXI / SCALE )**2 END IF END IF 10 CONTINUE END IF RETURN * * End of DLASSQ * END octave-1.1.0/libcruft/lapack/dlasv2.f100666 415 17 15117 5306544270 15600 0ustar jweusers SUBROUTINE DLASV2( F, G, H, SSMIN, SSMAX, SNR, CSR, SNL, CSL ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. DOUBLE PRECISION CSL, CSR, F, G, H, SNL, SNR, SSMAX, SSMIN * .. * * Purpose * ======= * * DLASV2 computes the singular value decomposition of a 2-by-2 * triangular matrix * [ F G ] * [ 0 H ]. * On return, abs(SSMAX) is the larger singular value, abs(SSMIN) is the * smaller singular value, and (CSL,SNL) and (CSR,SNR) are the left and * right singular vectors for abs(SSMAX), giving the decomposition * * [ CSL SNL ] [ F G ] [ CSR -SNR ] = [ SSMAX 0 ] * [-SNL CSL ] [ 0 H ] [ SNR CSR ] [ 0 SSMIN ]. * * Arguments * ========= * * F (input) DOUBLE PRECISION * The (1,1) entry of the 2-by-2 matrix. * * G (input) DOUBLE PRECISION * The (1,2) entry of the 2-by-2 matrix. * * H (input) DOUBLE PRECISION * The (2,2) entry of the 2-by-2 matrix. * * SSMIN (output) DOUBLE PRECISION * abs(SSMIN) is the smaller singular value. * * SSMAX (output) DOUBLE PRECISION * abs(SSMAX) is the larger singular value. * * SNL (output) DOUBLE PRECISION * CSL (output) DOUBLE PRECISION * The vector (CSL, SNL) is a unit left singular vector for the * singular value abs(SSMAX). * * SNR (output) DOUBLE PRECISION * CSR (output) DOUBLE PRECISION * The vector (CSR, SNR) is a unit right singular vector for the * singular value abs(SSMAX). * * Further Details * =============== * * Any input parameter may be aliased with any output parameter. * * Barring over/underflow and assuming a guard digit in subtraction, all * output quantities are correct to within a few units in the last * place (ulps). * * In IEEE arithmetic, the code works correctly if one matrix entry is * infinite. * * Overflow will not occur unless the largest singular value itself * overflows or is within a few ulps of overflow. (On machines with * partial overflow, like the Cray, overflow may occur if the largest * singular value is within a factor of 2 of overflow.) * * Underflow is harmless if underflow is gradual. Otherwise, results * may correspond to a matrix modified by perturbations of size near * the underflow threshold. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION HALF PARAMETER ( HALF = 0.5D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) DOUBLE PRECISION TWO PARAMETER ( TWO = 2.0D0 ) DOUBLE PRECISION FOUR PARAMETER ( FOUR = 4.0D0 ) * .. * .. Local Scalars .. LOGICAL GASMAL, SWAP INTEGER PMAX DOUBLE PRECISION A, CLT, CRT, D, FA, FT, GA, GT, HA, HT, L, M, $ MM, R, S, SLT, SRT, T, TEMP, TSIGN, TT * .. * .. Intrinsic Functions .. INTRINSIC ABS, SIGN, SQRT * .. * .. External Functions .. DOUBLE PRECISION DLAMCH EXTERNAL DLAMCH * .. * .. Executable Statements .. * FT = F FA = ABS( FT ) HT = H HA = ABS( H ) * * PMAX points to the maximum absolute entry of matrix * PMAX = 1 if F largest in absolute values * PMAX = 2 if G largest in absolute values * PMAX = 3 if H largest in absolute values * PMAX = 1 SWAP = ( HA.GT.FA ) IF( SWAP ) THEN PMAX = 3 TEMP = FT FT = HT HT = TEMP TEMP = FA FA = HA HA = TEMP * * Now FA .ge. HA * END IF GT = G GA = ABS( GT ) IF( GA.EQ.ZERO ) THEN * * Diagonal matrix * SSMIN = HA SSMAX = FA CLT = ONE CRT = ONE SLT = ZERO SRT = ZERO ELSE GASMAL = .TRUE. IF( GA.GT.FA ) THEN PMAX = 2 IF( ( FA / GA ).LT.DLAMCH( 'EPS' ) ) THEN * * Case of very large GA * GASMAL = .FALSE. SSMAX = GA IF( HA.GT.ONE ) THEN SSMIN = FA / ( GA / HA ) ELSE SSMIN = ( FA / GA )*HA END IF CLT = ONE SLT = HT / GT SRT = ONE CRT = FT / GT END IF END IF IF( GASMAL ) THEN * * Normal case * D = FA - HA IF( D.EQ.FA ) THEN * * Copes with infinite F or H * L = ONE ELSE L = D / FA END IF * * Note that 0 .le. L .le. 1 * M = GT / FT * * Note that abs(M) .le. 1/macheps * T = TWO - L * * Note that T .ge. 1 * MM = M*M TT = T*T S = SQRT( TT+MM ) * * Note that 1 .le. S .le. 1 + 1/macheps * IF( L.EQ.ZERO ) THEN R = ABS( M ) ELSE R = SQRT( L*L+MM ) END IF * * Note that 0 .le. R .le. 1 + 1/macheps * A = HALF*( S+R ) * * Note that 1 .le. A .le. 1 + abs(M) * SSMIN = HA / A SSMAX = FA*A IF( MM.EQ.ZERO ) THEN * * Note that M is very tiny * IF( L.EQ.ZERO ) THEN T = SIGN( TWO, FT )*SIGN( ONE, GT ) ELSE T = GT / SIGN( D, FT ) + M / T END IF ELSE T = ( M / ( S+T )+M / ( R+L ) )*( ONE+A ) END IF L = SQRT( T*T+FOUR ) CRT = TWO / L SRT = T / L CLT = ( CRT+SRT*M ) / A SLT = ( HT / FT )*SRT / A END IF END IF IF( SWAP ) THEN CSL = SRT SNL = CRT CSR = SLT SNR = CLT ELSE CSL = CLT SNL = SLT CSR = CRT SNR = SRT END IF * * Correct signs of SSMAX and SSMIN * IF( PMAX.EQ.1 ) $ TSIGN = SIGN( ONE, CSR )*SIGN( ONE, CSL )*SIGN( ONE, F ) IF( PMAX.EQ.2 ) $ TSIGN = SIGN( ONE, SNR )*SIGN( ONE, CSL )*SIGN( ONE, G ) IF( PMAX.EQ.3 ) $ TSIGN = SIGN( ONE, SNR )*SIGN( ONE, SNL )*SIGN( ONE, H ) SSMAX = SIGN( SSMAX, TSIGN ) SSMIN = SIGN( SSMIN, TSIGN*SIGN( ONE, F )*SIGN( ONE, H ) ) RETURN * * End of DLASV2 * END octave-1.1.0/libcruft/lapack/dlaswp.f100666 415 17 5432 5310240626 15647 0ustar jweusers SUBROUTINE DLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, K1, K2, LDA, N * .. * .. Array Arguments .. INTEGER IPIV( * ) DOUBLE PRECISION A( LDA, * ) * .. * * Purpose * ======= * * DLASWP performs a series of row interchanges on the matrix A. * One row interchange is initiated for each of rows K1 through K2 of A. * * Arguments * ========= * * N (input) INTEGER * The number of columns of the matrix A. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the matrix of column dimension N to which the row * interchanges will be applied. * On exit, the permuted matrix. * * LDA (input) INTEGER * The leading dimension of the array A. * * K1 (input) INTEGER * The first element of IPIV for which a row interchange will * be done. * * K2 (input) INTEGER * The last element of IPIV for which a row interchange will * be done. * * IPIV (input) INTEGER array, dimension (M*abs(INCX)) * The vector of pivot indices. Only the elements in positions * K1 through K2 of IPIV are accessed. * IPIV(K) = L implies rows K and L are to be interchanged. * * INCX (input) INTEGER * The increment between successive values of IPIV. If IPIV * is negative, the pivots are applied in reverse order. * * ===================================================================== * * .. Local Scalars .. INTEGER I, IP, IX * .. * .. External Subroutines .. EXTERNAL DSWAP * .. * .. Executable Statements .. * * Interchange row I with row IPIV(I) for each of rows K1 through K2. * IF( INCX.EQ.0 ) $ RETURN IF( INCX.GT.0 ) THEN IX = K1 ELSE IX = 1 + ( 1-K2 )*INCX END IF IF( INCX.EQ.1 ) THEN DO 10 I = K1, K2 IP = IPIV( I ) IF( IP.NE.I ) $ CALL DSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) 10 CONTINUE ELSE IF( INCX.GT.1 ) THEN DO 20 I = K1, K2 IP = IPIV( IX ) IF( IP.NE.I ) $ CALL DSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) IX = IX + INCX 20 CONTINUE ELSE IF( INCX.LT.0 ) THEN DO 30 I = K2, K1, -1 IP = IPIV( IX ) IF( IP.NE.I ) $ CALL DSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) IX = IX + INCX 30 CONTINUE END IF * RETURN * * End of DLASWP * END octave-1.1.0/libcruft/lapack/dlasy2.f100666 415 17 27612 5412145361 15602 0ustar jweusers SUBROUTINE DLASY2( LTRANL, LTRANR, ISGN, N1, N2, TL, LDTL, TR, $ LDTR, B, LDB, SCALE, X, LDX, XNORM, INFO ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. LOGICAL LTRANL, LTRANR INTEGER INFO, ISGN, LDB, LDTL, LDTR, LDX, N1, N2 DOUBLE PRECISION SCALE, XNORM * .. * .. Array Arguments .. DOUBLE PRECISION B( LDB, * ), TL( LDTL, * ), TR( LDTR, * ), $ X( LDX, * ) * .. * * Purpose * ======= * * DLASY2 solves for the N1 by N2 matrix X, 1 <= N1,N2 <= 2, in * * op(TL)*X + ISGN*X*op(TR) = SCALE*B, * * where TL is N1 by N1, TR is N2 by N2, B is N1 by N2, and ISGN = 1 or * -1. op(T) = T or T', where T' denotes the transpose of T. * * Arguments * ========= * * LTRANL (input) LOGICAL * On entry, LTRANL specifies the op(TL): * = .FALSE., op(TL) = TL, * = .TRUE., op(TL) = TL'. * * LTRANR (input) LOGICAL * On entry, LTRANR specifies the op(TR): * = .FALSE., op(TR) = TR, * = .TRUE., op(TR) = TR'. * * ISGN (input) INTEGER * On entry, ISGN specifies the sign of the equation * as described before. ISGN may only be 1 or -1. * * N1 (input) INTEGER * On entry, N1 specifies the order of matrix TL. * N1 may only be 0, 1 or 2. * * N2 (input) INTEGER * On entry, N2 specifies the order of matrix TR. * N2 may only be 0, 1 or 2. * * TL (input) DOUBLE PRECISION array, dimension (LDTL,2) * On entry, TL contains an N1 by N1 matrix. * * LDTL (input) INTEGER * The leading dimension of the matrix TL. LDTL >= max(1,N1). * * TR (input) DOUBLE PRECISION array, dimension (LDTR,2) * On entry, TR contains an N2 by N2 matrix. * * LDTR (input) INTEGER * The leading dimension of the matrix TR. LDTR >= max(1,N2). * * B (input) DOUBLE PRECISION array, dimension (LDB,2) * On entry, the N1 by N2 matrix B contains the right-hand * side of the equation. * * LDB (input) INTEGER * The leading dimension of the matrix B. LDB >= max(1,N1). * * SCALE (output) DOUBLE PRECISION * On exit, SCALE contains the scale factor. SCALE is chosen * less than or equal to 1 to prevent the solution overflowing. * * X (output) DOUBLE PRECISION array, dimension (LDX,2) * On exit, X contains the N1 by N2 solution. * * LDX (input) INTEGER * The leading dimension of the matrix X. LDX >= max(1,N1). * * XNORM (output) DOUBLE PRECISION * On exit, XNORM is the infinity-norm of the solution. * * INFO (output) INTEGER * On exit, INFO is set to * 0: successful exit. * 1: TL and TR have too close eigenvalues, so TL or * TR is perturbed to get a nonsingular equation. * NOTE: In the interests of speed, this routine does not * check the inputs for errors. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION TWO, HALF, EIGHT PARAMETER ( TWO = 2.0D+0, HALF = 0.5D+0, EIGHT = 8.0D+0 ) * .. * .. Local Scalars .. LOGICAL BSWAP, XSWAP INTEGER I, IP, IPIV, IPSV, J, JP, JPSV, K DOUBLE PRECISION BET, EPS, GAM, L21, SGN, SMIN, SMLNUM, TAU1, $ TEMP, U11, U12, U22, XMAX * .. * .. Local Arrays .. LOGICAL BSWPIV( 4 ), XSWPIV( 4 ) INTEGER JPIV( 4 ), LOCL21( 4 ), LOCU12( 4 ), $ LOCU22( 4 ) DOUBLE PRECISION BTMP( 4 ), T16( 4, 4 ), TMP( 4 ), X2( 2 ) * .. * .. External Functions .. INTEGER IDAMAX DOUBLE PRECISION DLAMCH EXTERNAL IDAMAX, DLAMCH * .. * .. External Subroutines .. EXTERNAL DCOPY, DSWAP * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX * .. * .. Data statements .. DATA LOCU12 / 3, 4, 1, 2 / , LOCL21 / 2, 1, 4, 3 / , $ LOCU22 / 4, 3, 2, 1 / DATA XSWPIV / .FALSE., .FALSE., .TRUE., .TRUE. / DATA BSWPIV / .FALSE., .TRUE., .FALSE., .TRUE. / * .. * .. Executable Statements .. * * Do not check the input parameters for errors * INFO = 0 * * Quick return if possible * IF( N1.EQ.0 .OR. N2.EQ.0 ) $ RETURN * * Set constants to control overflow * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) / EPS SGN = ISGN * K = N1 + N1 + N2 - 2 GO TO ( 10, 20, 30, 50 )K * * 1 by 1: TL11*X + SGN*X*TR11 = B11 * 10 CONTINUE TAU1 = TL( 1, 1 ) + SGN*TR( 1, 1 ) BET = ABS( TAU1 ) IF( BET.LE.SMLNUM ) THEN TAU1 = SMLNUM BET = SMLNUM INFO = 1 END IF * SCALE = ONE GAM = ABS( B( 1, 1 ) ) IF( SMLNUM*GAM.GT.BET ) $ SCALE = ONE / GAM * X( 1, 1 ) = ( B( 1, 1 )*SCALE ) / TAU1 XNORM = ABS( X( 1, 1 ) ) RETURN * * 1 by 2: * TL11*[X11 X12] + ISGN*[X11 X12]*op[TR11 TR12] = [B11 B12] * [TR21 TR22] * 20 CONTINUE * SMIN = MAX( EPS*MAX( ABS( TL( 1, 1 ) ), ABS( TR( 1, 1 ) ), $ ABS( TR( 1, 2 ) ), ABS( TR( 2, 1 ) ), ABS( TR( 2, 2 ) ) ), $ SMLNUM ) TMP( 1 ) = TL( 1, 1 ) + SGN*TR( 1, 1 ) TMP( 4 ) = TL( 1, 1 ) + SGN*TR( 2, 2 ) IF( LTRANR ) THEN TMP( 2 ) = SGN*TR( 2, 1 ) TMP( 3 ) = SGN*TR( 1, 2 ) ELSE TMP( 2 ) = SGN*TR( 1, 2 ) TMP( 3 ) = SGN*TR( 2, 1 ) END IF BTMP( 1 ) = B( 1, 1 ) BTMP( 2 ) = B( 1, 2 ) GO TO 40 * * 2 by 1: * op[TL11 TL12]*[X11] + ISGN* [X11]*TR11 = [B11] * [TL21 TL22] [X21] [X21] [B21] * 30 CONTINUE SMIN = MAX( EPS*MAX( ABS( TR( 1, 1 ) ), ABS( TL( 1, 1 ) ), $ ABS( TL( 1, 2 ) ), ABS( TL( 2, 1 ) ), ABS( TL( 2, 2 ) ) ), $ SMLNUM ) TMP( 1 ) = TL( 1, 1 ) + SGN*TR( 1, 1 ) TMP( 4 ) = TL( 2, 2 ) + SGN*TR( 1, 1 ) IF( LTRANL ) THEN TMP( 2 ) = TL( 1, 2 ) TMP( 3 ) = TL( 2, 1 ) ELSE TMP( 2 ) = TL( 2, 1 ) TMP( 3 ) = TL( 1, 2 ) END IF BTMP( 1 ) = B( 1, 1 ) BTMP( 2 ) = B( 2, 1 ) 40 CONTINUE * * Solve 2 by 2 system using complete pivoting. * Set pivots less than SMIN to SMIN. * IPIV = IDAMAX( 4, TMP, 1 ) U11 = TMP( IPIV ) IF( ABS( U11 ).LE.SMIN ) THEN INFO = 1 U11 = SMIN END IF U12 = TMP( LOCU12( IPIV ) ) L21 = TMP( LOCL21( IPIV ) ) / U11 U22 = TMP( LOCU22( IPIV ) ) - U12*L21 XSWAP = XSWPIV( IPIV ) BSWAP = BSWPIV( IPIV ) IF( ABS( U22 ).LE.SMIN ) THEN INFO = 1 U22 = SMIN END IF IF( BSWAP ) THEN TEMP = BTMP( 2 ) BTMP( 2 ) = BTMP( 1 ) - L21*TEMP BTMP( 1 ) = TEMP ELSE BTMP( 2 ) = BTMP( 2 ) - L21*BTMP( 1 ) END IF SCALE = ONE IF( ( TWO*SMLNUM )*ABS( BTMP( 2 ) ).GT.ABS( U22 ) .OR. $ ( TWO*SMLNUM )*ABS( BTMP( 1 ) ).GT.ABS( U11 ) ) THEN SCALE = HALF / MAX( ABS( BTMP( 1 ) ), ABS( BTMP( 2 ) ) ) BTMP( 1 ) = BTMP( 1 )*SCALE BTMP( 2 ) = BTMP( 2 )*SCALE END IF X2( 2 ) = BTMP( 2 ) / U22 X2( 1 ) = BTMP( 1 ) / U11 - ( U12 / U11 )*X2( 2 ) IF( XSWAP ) THEN TEMP = X2( 2 ) X2( 2 ) = X2( 1 ) X2( 1 ) = TEMP END IF X( 1, 1 ) = X2( 1 ) IF( N1.EQ.1 ) THEN X( 1, 2 ) = X2( 2 ) XNORM = ABS( X( 1, 1 ) ) + ABS( X( 1, 2 ) ) ELSE X( 2, 1 ) = X2( 2 ) XNORM = MAX( ABS( X( 1, 1 ) ), ABS( X( 2, 1 ) ) ) END IF RETURN * * 2 by 2: * op[TL11 TL12]*[X11 X12] +ISGN* [X11 X12]*op[TR11 TR12] = [B11 B12] * [TL21 TL22] [X21 X22] [X21 X22] [TR21 TR22] [B21 B22] * * Solve equivalent 4 by 4 system using complete pivoting. * Set pivots less than SMIN to SMIN. * 50 CONTINUE SMIN = MAX( ABS( TR( 1, 1 ) ), ABS( TR( 1, 2 ) ), $ ABS( TR( 2, 1 ) ), ABS( TR( 2, 2 ) ) ) SMIN = MAX( SMIN, ABS( TL( 1, 1 ) ), ABS( TL( 1, 2 ) ), $ ABS( TL( 2, 1 ) ), ABS( TL( 2, 2 ) ) ) SMIN = MAX( EPS*SMIN, SMLNUM ) BTMP( 1 ) = ZERO CALL DCOPY( 16, BTMP, 0, T16, 1 ) T16( 1, 1 ) = TL( 1, 1 ) + SGN*TR( 1, 1 ) T16( 2, 2 ) = TL( 2, 2 ) + SGN*TR( 1, 1 ) T16( 3, 3 ) = TL( 1, 1 ) + SGN*TR( 2, 2 ) T16( 4, 4 ) = TL( 2, 2 ) + SGN*TR( 2, 2 ) IF( LTRANL ) THEN T16( 1, 2 ) = TL( 2, 1 ) T16( 2, 1 ) = TL( 1, 2 ) T16( 3, 4 ) = TL( 2, 1 ) T16( 4, 3 ) = TL( 1, 2 ) ELSE T16( 1, 2 ) = TL( 1, 2 ) T16( 2, 1 ) = TL( 2, 1 ) T16( 3, 4 ) = TL( 1, 2 ) T16( 4, 3 ) = TL( 2, 1 ) END IF IF( LTRANR ) THEN T16( 1, 3 ) = SGN*TR( 1, 2 ) T16( 2, 4 ) = SGN*TR( 1, 2 ) T16( 3, 1 ) = SGN*TR( 2, 1 ) T16( 4, 2 ) = SGN*TR( 2, 1 ) ELSE T16( 1, 3 ) = SGN*TR( 2, 1 ) T16( 2, 4 ) = SGN*TR( 2, 1 ) T16( 3, 1 ) = SGN*TR( 1, 2 ) T16( 4, 2 ) = SGN*TR( 1, 2 ) END IF BTMP( 1 ) = B( 1, 1 ) BTMP( 2 ) = B( 2, 1 ) BTMP( 3 ) = B( 1, 2 ) BTMP( 4 ) = B( 2, 2 ) * * Perform elimination * DO 100 I = 1, 3 XMAX = ZERO DO 70 IP = I, 4 DO 60 JP = I, 4 IF( ABS( T16( IP, JP ) ).GE.XMAX ) THEN XMAX = ABS( T16( IP, JP ) ) IPSV = IP JPSV = JP END IF 60 CONTINUE 70 CONTINUE IF( IPSV.NE.I ) THEN CALL DSWAP( 4, T16( IPSV, 1 ), 4, T16( I, 1 ), 4 ) TEMP = BTMP( I ) BTMP( I ) = BTMP( IPSV ) BTMP( IPSV ) = TEMP END IF IF( JPSV.NE.I ) $ CALL DSWAP( 4, T16( 1, JPSV ), 1, T16( 1, I ), 1 ) JPIV( I ) = JPSV IF( ABS( T16( I, I ) ).LT.SMIN ) THEN INFO = 1 T16( I, I ) = SMIN END IF DO 90 J = I + 1, 4 T16( J, I ) = T16( J, I ) / T16( I, I ) BTMP( J ) = BTMP( J ) - T16( J, I )*BTMP( I ) DO 80 K = I + 1, 4 T16( J, K ) = T16( J, K ) - T16( J, I )*T16( I, K ) 80 CONTINUE 90 CONTINUE 100 CONTINUE IF( ABS( T16( 4, 4 ) ).LT.SMIN ) $ T16( 4, 4 ) = SMIN SCALE = ONE IF( ( EIGHT*SMLNUM )*ABS( BTMP( 1 ) ).GT.ABS( T16( 1, 1 ) ) .OR. $ ( EIGHT*SMLNUM )*ABS( BTMP( 2 ) ).GT.ABS( T16( 2, 2 ) ) .OR. $ ( EIGHT*SMLNUM )*ABS( BTMP( 3 ) ).GT.ABS( T16( 3, 3 ) ) .OR. $ ( EIGHT*SMLNUM )*ABS( BTMP( 4 ) ).GT.ABS( T16( 4, 4 ) ) ) THEN SCALE = ( ONE / EIGHT ) / MAX( ABS( BTMP( 1 ) ), $ ABS( BTMP( 2 ) ), ABS( BTMP( 3 ) ), ABS( BTMP( 4 ) ) ) BTMP( 1 ) = BTMP( 1 )*SCALE BTMP( 2 ) = BTMP( 2 )*SCALE BTMP( 3 ) = BTMP( 3 )*SCALE BTMP( 4 ) = BTMP( 4 )*SCALE END IF DO 120 I = 1, 4 K = 5 - I TEMP = ONE / T16( K, K ) TMP( K ) = BTMP( K )*TEMP DO 110 J = K + 1, 4 TMP( K ) = TMP( K ) - ( TEMP*T16( K, J ) )*TMP( J ) 110 CONTINUE 120 CONTINUE DO 130 I = 1, 3 IF( JPIV( 4-I ).NE.4-I ) THEN TEMP = TMP( 4-I ) TMP( 4-I ) = TMP( JPIV( 4-I ) ) TMP( JPIV( 4-I ) ) = TEMP END IF 130 CONTINUE X( 1, 1 ) = TMP( 1 ) X( 2, 1 ) = TMP( 2 ) X( 1, 2 ) = TMP( 3 ) X( 2, 2 ) = TMP( 4 ) XNORM = MAX( ABS( TMP( 1 ) )+ABS( TMP( 3 ) ), $ ABS( TMP( 2 ) )+ABS( TMP( 4 ) ) ) RETURN * * End of DLASY2 * END octave-1.1.0/libcruft/lapack/dorg2r.f100666 415 17 6663 5306544263 15574 0ustar jweusers SUBROUTINE DORG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DORG2R generates an m by n real matrix Q with orthonormal columns, * which is defined as the first n columns of a product of k elementary * reflectors of order m * * Q = H(1) H(2) . . . H(k) * * as returned by DGEQRF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. M >= N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. N >= K >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the i-th column must contain the vector which * defines the elementary reflector H(i), for i = 1,2,...,k, as * returned by DGEQRF in the first k columns of its array * argument A. * On exit, the m-by-n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGEQRF. * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J, L * .. * .. External Subroutines .. EXTERNAL DLARF, DSCAL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 .OR. N.GT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORG2R', -INFO ) RETURN END IF * * Quick return if possible * IF( N.LE.0 ) $ RETURN * * Initialise columns k+1:n to columns of the unit matrix * DO 20 J = K + 1, N DO 10 L = 1, M A( L, J ) = ZERO 10 CONTINUE A( J, J ) = ONE 20 CONTINUE * DO 40 I = K, 1, -1 * * Apply H(i) to A(i:m,i:n) from the left * IF( I.LT.N ) THEN A( I, I ) = ONE CALL DLARF( 'Left', M-I+1, N-I, A( I, I ), 1, TAU( I ), $ A( I, I+1 ), LDA, WORK ) END IF IF( I.LT.M ) $ CALL DSCAL( M-I, -TAU( I ), A( I+1, I ), 1 ) A( I, I ) = ONE - TAU( I ) * * Set A(1:i-1,i) to zero * DO 30 L = 1, I - 1 A( L, I ) = ZERO 30 CONTINUE 40 CONTINUE RETURN * * End of DORG2R * END octave-1.1.0/libcruft/lapack/dorgbr.f100666 415 17 15262 5306544270 15665 0ustar jweusers SUBROUTINE DORGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER VECT INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DORGBR generates one of the matrices Q or P' determined by DGEBRD * when reducing a real matrix A to bidiagonal form: A = Q * B * P'. * Q and P' are defined as products of elementary reflectors H(i) or * G(i) respectively.. * * If VECT = 'Q', A is assumed to have been an m-by-k matrix, and Q * is of order m: * if m >= k, Q = H(1) H(2) . . . H(k) and DORGBR returns the first n * columns of Q, where m >= n >= k; * if m < k, Q = H(1) H(2) . . . H(m-1) and DORGBR returns Q as an * m-by-m matrix. * * If VECT = 'P', A is assumed to have been a k-by-n matrix, and P' * is of order n: * if k < n, P' = G(k) . . . G(2) G(1) and DORGBR returns the first m * rows of P', where n >= m >= k; * if k >= n, P' = G(n-1) . . . G(2) G(1) and DORGBR returns P' as an * n-by-n matrix. * * Arguments * ========= * * VECT (input) CHARACTER*1 * Specifies whether the matrix Q or the matrix P' is required, * as defined in the transformation applied by DGEBRD: * = 'Q': generate Q; * = 'P': generate P'. * * M (input) INTEGER * The number of rows of the matrix Q or P' to be returned. * M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q or P' to be returned. * N >= 0. * If VECT = 'Q', M >= N >= min(M,K); * if VECT = 'P', N >= M >= min(N,K). * * K (input) INTEGER * If VECT = 'Q', the number of columns in the original m-by-k * matrix reduced by DGEBRD. * If VECT = 'P', the number of rows in the original k-by-n * matrix reduced by DGEBRD. * K >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the vectors which define the elementary reflectors, * as returned by DGEBRD. * On exit, the m-by-n matrix Q or P'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (input) DOUBLE PRECISION array, dimension * (min(M,K)) if VECT = 'Q' * (min(N,K)) if VECT = 'P' * TAU(i) must contain the scalar factor of the elementary * reflector H(i) or G(i), which determines Q or P', as returned * by DGEBRD in its array argument TAUQ or TAUP. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,min(M,N)). * For optimum performance LWORK should be at least min(M,N)*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL WANTQ INTEGER I, IINFO, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DORGLQ, DORGQR, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTQ = LSAME( VECT, 'Q' ) IF( .NOT.WANTQ .AND. .NOT.LSAME( VECT, 'P' ) ) THEN INFO = -1 ELSE IF( M.LT.0 ) THEN INFO = -2 ELSE IF( N.LT.0 .OR. ( WANTQ .AND. ( N.GT.M .OR. N.LT.MIN( M, $ K ) ) ) .OR. ( .NOT.WANTQ .AND. ( M.GT.N .OR. M.LT. $ MIN( N, K ) ) ) ) THEN INFO = -3 ELSE IF( K.LT.0 ) THEN INFO = -4 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -6 ELSE IF( LWORK.LT.MAX( 1, MIN( M, N ) ) ) THEN INFO = -9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORGBR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * IF( WANTQ ) THEN * * Form Q, determined by a call to DGEBRD to reduce an m-by-k * matrix * IF( M.GE.K ) THEN * * If m >= k, assume m >= n >= k * CALL DORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, IINFO ) * ELSE * * If m < k, assume m = n * * Shift the vectors which define the elementary reflectors one * column to the right, and set the first row and column of Q * to those of the unit matrix * DO 20 J = M, 2, -1 A( 1, J ) = ZERO DO 10 I = J + 1, M A( I, J ) = A( I, J-1 ) 10 CONTINUE 20 CONTINUE A( 1, 1 ) = ONE DO 30 I = 2, M A( I, 1 ) = ZERO 30 CONTINUE IF( M.GT.1 ) THEN * * Form Q(2:m,2:m) * CALL DORGQR( M-1, M-1, M-1, A( 2, 2 ), LDA, TAU, WORK, $ LWORK, IINFO ) END IF END IF ELSE * * Form P', determined by a call to DGEBRD to reduce a k-by-n * matrix * IF( K.LT.N ) THEN * * If k < n, assume k <= m <= n * CALL DORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, IINFO ) * ELSE * * If k >= n, assume m = n * * Shift the vectors which define the elementary reflectors one * row downward, and set the first row and column of P' to * those of the unit matrix * A( 1, 1 ) = ONE DO 40 I = 2, N A( I, 1 ) = ZERO 40 CONTINUE DO 60 J = 2, N DO 50 I = J - 1, 2, -1 A( I, J ) = A( I-1, J ) 50 CONTINUE A( 1, J ) = ZERO 60 CONTINUE IF( N.GT.1 ) THEN * * Form P'(2:n,2:n) * CALL DORGLQ( N-1, N-1, N-1, A( 2, 2 ), LDA, TAU, WORK, $ LWORK, IINFO ) END IF END IF END IF RETURN * * End of DORGBR * END octave-1.1.0/libcruft/lapack/dorghr.f100666 415 17 10160 5306544263 15665 0ustar jweusers SUBROUTINE DORGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, LWORK, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DORGHR generates a real orthogonal matrix Q which is defined as the * product of ihi-ilo elementary reflectors of order n, as returned by * DGEHRD: * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Arguments * ========= * * N (input) INTEGER * The order of the matrix Q. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * ILO and IHI must have the same values as in the previous call * of DGEHRD. Q is equal to the unit matrix except in the * submatrix Q(ilo+1:ihi,ilo+1:ihi). If N > 0, * 1 <= ILO <= IHI <= N; otherwise ILO = 1 and IHI = N. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the vectors which define the elementary reflectors, * as returned by DGEHRD. * On exit, the n by n orthogonal matrix Q. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (input) DOUBLE PRECISION array, dimension (N-1) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGEHRD. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= IHI-ILO. * For optimum performance LWORK should be at least * (IHI-ILO)*NB, where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, NH * .. * .. External Subroutines .. EXTERNAL DORGQR, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, IHI-ILO ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORGHR', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Shift the vectors which define the elementary reflectors one * column to the right, and set the first ilo and the last n-ihi * rows and columns to those of the unit matrix * DO 40 J = IHI, ILO + 1, -1 DO 10 I = 1, J - 1 A( I, J ) = ZERO 10 CONTINUE DO 20 I = J + 1, IHI A( I, J ) = A( I, J-1 ) 20 CONTINUE DO 30 I = IHI + 1, N A( I, J ) = ZERO 30 CONTINUE 40 CONTINUE DO 60 J = 1, ILO DO 50 I = 1, N A( I, J ) = ZERO 50 CONTINUE A( J, J ) = ONE 60 CONTINUE DO 80 J = IHI + 1, N DO 70 I = 1, N A( I, J ) = ZERO 70 CONTINUE A( J, J ) = ONE 80 CONTINUE * NH = IHI - ILO IF( NH.GT.0 ) THEN * * Generate Q(ilo+1:ihi,ilo+1:ihi) * CALL DORGQR( NH, NH, NH, A( ILO+1, ILO+1 ), LDA, TAU( ILO ), $ WORK, LWORK, IINFO ) END IF RETURN * * End of DORGHR * END octave-1.1.0/libcruft/lapack/dorgl2.f100666 415 17 7024 5306544270 15554 0ustar jweusers SUBROUTINE DORGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DORGL2 generates an m by n real matrix Q with orthonormal rows, * which is defined as the first m rows of a product of k elementary * reflectors of order n * * Q = H(k) . . . H(2) H(1) * * as returned by DGELQF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. N >= M. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. M >= K >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the i-th row must contain the vector which defines * the elementary reflector H(i), for i = 1,2,...,k, as returned * by DGELQF in the first k rows of its array argument A. * On exit, the m-by-n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGELQF. * * WORK (workspace) DOUBLE PRECISION array, dimension (M) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J, L * .. * .. External Subroutines .. EXTERNAL DLARF, DSCAL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.M ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORGL2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.LE.0 ) $ RETURN * IF( K.LT.M ) THEN * * Initialise rows k+1:m to rows of the unit matrix * DO 20 J = 1, N DO 10 L = K + 1, M A( L, J ) = ZERO 10 CONTINUE IF( J.GT.K .AND. J.LE.M ) $ A( J, J ) = ONE 20 CONTINUE END IF * DO 40 I = K, 1, -1 * * Apply H(i) to A(i:m,i:n) from the right * IF( I.LT.N ) THEN IF( I.LT.M ) THEN A( I, I ) = ONE CALL DLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, $ TAU( I ), A( I+1, I ), LDA, WORK ) END IF CALL DSCAL( N-I, -TAU( I ), A( I, I+1 ), LDA ) END IF A( I, I ) = ONE - TAU( I ) * * Set A(1:i-1,i) to zero * DO 30 L = 1, I - 1 A( I, L ) = ZERO 30 CONTINUE 40 CONTINUE RETURN * * End of DORGL2 * END octave-1.1.0/libcruft/lapack/dorglq.f100666 415 17 13501 5306544270 15670 0ustar jweusers SUBROUTINE DORGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DORGLQ generates an m by n real matrix Q with orthonormal rows, * which is defined as the first m rows of a product of k elementary * reflectors of order n * * Q = H(k) . . . H(2) H(1) * * as returned by DGELQF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. N >= M. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. M >= K >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the i-th row must contain the vector which defines * the elementary reflector H(i), for i = 1,2,...,k, as returned * by DGELQF in the first k rows of its array argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGELQF. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,M). * For optimum performance LWORK should be at least M*NB, where * NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, J, KI, KK, L, LDWORK, NB, $ NBMIN, NX * .. * .. External Subroutines .. EXTERNAL DLARFB, DLARFT, DORGL2, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.M ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, M ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORGLQ', -INFO ) RETURN END IF * * Quick return if possible * IF( M.LE.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'DORGLQ', ' ', M, N, K, -1 ) NBMIN = 2 NX = 0 IWS = M IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'DORGLQ', ' ', M, N, K, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = M IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DORGLQ', ' ', M, N, K, -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code after the last block. * The first kk rows are handled by the block method. * KI = ( ( K-NX-1 ) / NB )*NB KK = MIN( K, KI+NB ) * * Set A(kk+1:m,1:kk) to zero. * DO 20 J = 1, KK DO 10 I = KK + 1, M A( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE KK = 0 END IF * * Use unblocked code for the last or only block. * IF( KK.LT.M ) $ CALL DORGL2( M-KK, N-KK, K-KK, A( KK+1, KK+1 ), LDA, $ TAU( KK+1 ), WORK, IINFO ) * IF( KK.GT.0 ) THEN * * Use blocked code * DO 50 I = KI + 1, 1, -NB IB = MIN( NB, K-I+1 ) IF( I+IB.LE.M ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ), $ LDA, TAU( I ), WORK, LDWORK ) * * Apply H' to A(i+ib:m,i:n) from the right * CALL DLARFB( 'Right', 'Transpose', 'Forward', 'Rowwise', $ M-I-IB+1, N-I+1, IB, A( I, I ), LDA, WORK, $ LDWORK, A( I+IB, I ), LDA, WORK( IB+1 ), $ LDWORK ) END IF * * Apply H' to columns i:n of current block * CALL DORGL2( IB, N-I+1, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * * Set columns 1:i-1 of current block to zero * DO 40 J = 1, I - 1 DO 30 L = I, I + IB - 1 A( L, J ) = ZERO 30 CONTINUE 40 CONTINUE 50 CONTINUE END IF * WORK( 1 ) = IWS RETURN * * End of DORGLQ * END octave-1.1.0/libcruft/lapack/dorgqr.f100666 415 17 13553 5306544263 15707 0ustar jweusers SUBROUTINE DORGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * DORGQR generates an m by n real matrix Q with orthonormal columns, * which is defined as the first n columns of a product of k elementary * reflectors of order m * * Q = H(1) H(2) . . . H(k) * * as returned by DGEQRF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. M >= N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. N >= K >= 0. * * A (input/output) DOUBLE PRECISION array, dimension (LDA,N) * On entry, the i-th column must contain the vector which * defines the elementary reflector H(i), for i = 1,2,...,k, as * returned by DGEQRF in the first k columns of its array * argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGEQRF. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, where * NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, J, KI, KK, L, LDWORK, NB, $ NBMIN, NX * .. * .. External Subroutines .. EXTERNAL DLARFB, DLARFT, DORG2R, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 .OR. N.GT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORGQR', -INFO ) RETURN END IF * * Quick return if possible * IF( N.LE.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'DORGQR', ' ', M, N, K, -1 ) NBMIN = 2 NX = 0 IWS = N IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'DORGQR', ' ', M, N, K, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = N IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DORGQR', ' ', M, N, K, -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code after the last block. * The first kk columns are handled by the block method. * KI = ( ( K-NX-1 ) / NB )*NB KK = MIN( K, KI+NB ) * * Set A(1:kk,kk+1:n) to zero. * DO 20 J = KK + 1, N DO 10 I = 1, KK A( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE KK = 0 END IF * * Use unblocked code for the last or only block. * IF( KK.LT.N ) $ CALL DORG2R( M-KK, N-KK, K-KK, A( KK+1, KK+1 ), LDA, $ TAU( KK+1 ), WORK, IINFO ) * IF( KK.GT.0 ) THEN * * Use blocked code * DO 50 I = KI + 1, 1, -NB IB = MIN( NB, K-I+1 ) IF( I+IB.LE.N ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Columnwise', M-I+1, IB, $ A( I, I ), LDA, TAU( I ), WORK, LDWORK ) * * Apply H to A(i:m,i+ib:n) from the left * CALL DLARFB( 'Left', 'No transpose', 'Forward', $ 'Columnwise', M-I+1, N-I-IB+1, IB, $ A( I, I ), LDA, WORK, LDWORK, A( I, I+IB ), $ LDA, WORK( IB+1 ), LDWORK ) END IF * * Apply H to rows i:m of current block * CALL DORG2R( M-I+1, IB, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * * Set rows 1:i-1 of current block to zero * DO 40 J = I, I + IB - 1 DO 30 L = 1, I - 1 A( L, J ) = ZERO 30 CONTINUE 40 CONTINUE 50 CONTINUE END IF * WORK( 1 ) = IWS RETURN * * End of DORGQR * END octave-1.1.0/libcruft/lapack/dorm2r.f100666 415 17 12247 5306544267 15621 0ustar jweusers SUBROUTINE DORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DORM2R overwrites the general real m by n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'T', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'T', * * where Q is a real orthogonal matrix defined as the product of k * elementary reflectors * * Q = H(1) H(2) . . . H(k) * * as returned by DGEQRF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'T': apply Q' (Transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) DOUBLE PRECISION array, dimension (LDA,K) * The i-th column must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * DGEQRF in the first k columns of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. * If SIDE = 'L', LDA >= max(1,M); * if SIDE = 'R', LDA >= max(1,N). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGEQRF. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension * (N) if SIDE = 'L', * (M) if SIDE = 'R' * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ DOUBLE PRECISION AII * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DLARF, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q * IF( LEFT ) THEN NQ = M ELSE NQ = N END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORM2R', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) $ RETURN * IF( ( LEFT .AND. .NOT.NOTRAN ) .OR. ( .NOT.LEFT .AND. NOTRAN ) ) $ THEN I1 = 1 I2 = K I3 = 1 ELSE I1 = K I2 = 1 I3 = -1 END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IF( LEFT ) THEN * * H(i) is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H(i) is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H(i) * AII = A( I, I ) A( I, I ) = ONE CALL DLARF( SIDE, MI, NI, A( I, I ), 1, TAU( I ), C( IC, JC ), $ LDC, WORK ) A( I, I ) = AII 10 CONTINUE RETURN * * End of DORM2R * END octave-1.1.0/libcruft/lapack/dormbr.f100666 415 17 17220 5306544267 15675 0ustar jweusers SUBROUTINE DORMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, $ LDC, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS, VECT INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * If VECT = 'Q', DORMBR overwrites the general real m by n matrix C * with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'T', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'T'. * * If VECT = 'P', DORMBR overwrites the general real m by n matrix C * with * * P * C if SIDE = 'L' and TRANS = 'N', or * * P'* C if SIDE = 'L' and TRANS = 'T', or * * C * P if SIDE = 'R' and TRANS = 'N', or * * C * P' if SIDE = 'R' and TRANS = 'T'. * * Here Q and P' are the orthogonal matrices determined by DGEBRD when * reducing a real matrix A to bidiagonal form: A = Q * B * P'. Q and P' * are defined as products of elementary reflectors H(i) and G(i) * respectively. * * Let nq = m if SIDE = 'L' and nq = n if SIDE = 'R'. Thus nq is the * order of the orthogonal matrix Q or P' that is applied. * * If VECT = 'Q', A is assumed to have been an nq-by-k matrix: * if nq >= k, Q = H(1) H(2) . . . H(k); * if nq < k, Q = H(1) H(2) . . . H(nq-1). * * If VECT = 'P', A is assumed to have been a k-by-nq matrix: * if k < nq, P = G(1) G(2) . . . G(k); * if k >= nq, P = G(1) G(2) . . . G(nq-1). * * Arguments * ========= * * VECT (input) CHARACTER*1 * = 'Q': apply Q or Q' * = 'P': apply P or P' * * SIDE (input) CHARACTER*1 * = 'L': apply Q, Q', P or P' from the Left * = 'R': apply Q, Q', P or P' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q or P (No transpose) * = 'T': apply Q' or P' (Transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * If VECT = 'Q', the number of columns in the original * matrix reduced by DGEBRD. * If VECT = 'P', the number of rows in the original * matrix reduced by DGEBRD. * K >= 0. * * A (input) DOUBLE PRECISION array, dimension * (LDA,min(nq,K)) if VECT = 'Q' * (LDA,nq) if VECT = 'P' * The vectors which define the elementary reflectors H(i) and * G(i), whose products determine the matrices Q and P, as * returned by DGEBRD. * * LDA (input) INTEGER * The leading dimension of the array A. * If VECT = 'Q', LDA >= max(1,nq); * if VECT = 'P', LDA >= max(1,min(nq,K)). * * TAU (input) DOUBLE PRECISION array, dimension (min(nq,K)) * TAU(i) must contain the scalar factor of the elementary * reflector H(i) or G(i) which determines Q or P, as returned * by DGEBRD in the array argument TAUQ or TAUP. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q * or P*C or P'*C or C*P or C*P'. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Local Scalars .. LOGICAL APPLYQ, LEFT, NOTRAN CHARACTER TRANST INTEGER I1, I2, IINFO, MI, NI, NQ, NW * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DORMLQ, DORMQR, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 APPLYQ = LSAME( VECT, 'Q' ) LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q or P and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.APPLYQ .AND. .NOT.LSAME( VECT, 'P' ) ) THEN INFO = -1 ELSE IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -2 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) ) THEN INFO = -3 ELSE IF( M.LT.0 ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( K.LT.0 ) THEN INFO = -6 ELSE IF( ( APPLYQ .AND. LDA.LT.MAX( 1, NQ ) ) .OR. $ ( .NOT.APPLYQ .AND. LDA.LT.MAX( 1, MIN( NQ, K ) ) ) ) $ THEN INFO = -8 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -11 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORMBR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * IF( APPLYQ ) THEN * * Apply Q * IF( NQ.GE.K ) THEN * * Q was determined by a call to DGEBRD with nq >= k * CALL DORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, IINFO ) ELSE * * Q was determined by a call to DGEBRD with nq < k * IF( LEFT ) THEN MI = M - 1 NI = N I1 = 2 I2 = 1 ELSE MI = M NI = N - 1 I1 = 1 I2 = 2 END IF CALL DORMQR( SIDE, TRANS, MI, NI, NQ-1, A( 2, 1 ), LDA, TAU, $ C( I1, I2 ), LDC, WORK, LWORK, IINFO ) END IF ELSE * * Apply P * IF( NOTRAN ) THEN TRANST = 'T' ELSE TRANST = 'N' END IF IF( NQ.GT.K ) THEN * * P was determined by a call to DGEBRD with nq > k * CALL DORMLQ( SIDE, TRANST, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, IINFO ) ELSE * * P was determined by a call to DGEBRD with nq <= k * IF( LEFT ) THEN MI = M - 1 NI = N I1 = 2 I2 = 1 ELSE MI = M NI = N - 1 I1 = 1 I2 = 2 END IF CALL DORMLQ( SIDE, TRANST, MI, NI, NQ-1, A( 1, 2 ), LDA, $ TAU, C( I1, I2 ), LDC, WORK, LWORK, IINFO ) END IF END IF RETURN * * End of DORMBR * END octave-1.1.0/libcruft/lapack/dorml2.f100666 415 17 12302 5306544267 15603 0ustar jweusers SUBROUTINE DORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * DORML2 overwrites the general real m by n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'T', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'T', * * where Q is a real orthogonal matrix defined as the product of k * elementary reflectors * * Q = H(k) . . . H(2) H(1) * * as returned by DGELQF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'T': apply Q' (Transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) DOUBLE PRECISION array, dimension * (LDA,M) if SIDE = 'L', * (LDA,N) if SIDE = 'R' * The i-th row must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * DGELQF in the first k rows of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,K). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGELQF. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension * (N) if SIDE = 'L', * (M) if SIDE = 'R' * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ DOUBLE PRECISION AII * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DLARF, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q * IF( LEFT ) THEN NQ = M ELSE NQ = N END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, K ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORML2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) $ RETURN * IF( ( LEFT .AND. NOTRAN ) .OR. ( .NOT.LEFT .AND. .NOT.NOTRAN ) ) $ THEN I1 = 1 I2 = K I3 = 1 ELSE I1 = K I2 = 1 I3 = -1 END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IF( LEFT ) THEN * * H(i) is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H(i) is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H(i) * AII = A( I, I ) A( I, I ) = ONE CALL DLARF( SIDE, MI, NI, A( I, I ), LDA, TAU( I ), $ C( IC, JC ), LDC, WORK ) A( I, I ) = AII 10 CONTINUE RETURN * * End of DORML2 * END octave-1.1.0/libcruft/lapack/dormlq.f100666 415 17 16317 5306544267 15714 0ustar jweusers SUBROUTINE DORMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * DORMLQ overwrites the general real m by n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'T', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'T', * * where Q is a real orthogonal matrix defined as the product of k * elementary reflectors * * Q = H(k) . . . H(2) H(1) * * as returned by DGELQF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'T': apply Q' (Transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) DOUBLE PRECISION array, dimension * (LDA,M) if SIDE = 'L', * (LDA,N) if SIDE = 'R' * The i-th row must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * DGELQF in the first k rows of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,K). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGELQF. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN CHARACTER TRANST INTEGER I, I1, I2, I3, IB, IC, IINFO, IWS, JC, LDWORK, $ MI, NB, NBMIN, NI, NQ, NW * .. * .. Local Arrays .. DOUBLE PRECISION T( LDT, NBMAX ) * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL DLARFB, DLARFT, DORML2, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, K ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -12 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORMLQ', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. NB may be at most NBMAX, where NBMAX * is used to define the local array T. * NB = MIN( NBMAX, ILAENV( 1, 'DORMLQ', SIDE // TRANS, M, N, K, $ -1 ) ) NBMIN = 2 LDWORK = NW IF( NB.GT.1 .AND. NB.LT.K ) THEN IWS = NW*NB IF( LWORK.LT.IWS ) THEN NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DORMLQ', SIDE // TRANS, M, N, K, $ -1 ) ) END IF ELSE IWS = NW END IF * IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN * * Use unblocked code * CALL DORML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK, $ IINFO ) ELSE * * Use blocked code * IF( ( LEFT .AND. NOTRAN ) .OR. $ ( .NOT.LEFT .AND. .NOT.NOTRAN ) ) THEN I1 = 1 I2 = K I3 = NB ELSE I1 = ( ( K-1 ) / NB )*NB + 1 I2 = 1 I3 = -NB END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * IF( NOTRAN ) THEN TRANST = 'T' ELSE TRANST = 'N' END IF * DO 10 I = I1, I2, I3 IB = MIN( NB, K-I+1 ) * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Rowwise', NQ-I+1, IB, A( I, I ), $ LDA, TAU( I ), T, LDT ) IF( LEFT ) THEN * * H or H' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H or H' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H or H' * CALL DLARFB( SIDE, TRANST, 'Forward', 'Rowwise', MI, NI, IB, $ A( I, I ), LDA, T, LDT, C( IC, JC ), LDC, WORK, $ LDWORK ) 10 CONTINUE END IF WORK( 1 ) = IWS RETURN * * End of DORMLQ * END octave-1.1.0/libcruft/lapack/dormqr.f100666 415 17 16056 5306544267 15722 0ustar jweusers SUBROUTINE DORMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * DORMQR overwrites the general real m by n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'T', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'T', * * where Q is a real orthogonal matrix defined as the product of k * elementary reflectors * * Q = H(1) H(2) . . . H(k) * * as returned by DGEQRF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'T': apply Q' (Transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) DOUBLE PRECISION array, dimension (LDA,K) * The i-th column must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * DGEQRF in the first k columns of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. * If SIDE = 'L', LDA >= max(1,M); * if SIDE = 'R', LDA >= max(1,N). * * TAU (input) DOUBLE PRECISION array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by DGEQRF. * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IB, IC, IINFO, IWS, JC, LDWORK, $ MI, NB, NBMIN, NI, NQ, NW * .. * .. Local Arrays .. DOUBLE PRECISION T( LDT, NBMAX ) * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL DLARFB, DLARFT, DORM2R, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -12 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DORMQR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. NB may be at most NBMAX, where NBMAX * is used to define the local array T. * NB = MIN( NBMAX, ILAENV( 1, 'DORMQR', SIDE // TRANS, M, N, K, $ -1 ) ) NBMIN = 2 LDWORK = NW IF( NB.GT.1 .AND. NB.LT.K ) THEN IWS = NW*NB IF( LWORK.LT.IWS ) THEN NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'DORMQR', SIDE // TRANS, M, N, K, $ -1 ) ) END IF ELSE IWS = NW END IF * IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN * * Use unblocked code * CALL DORM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK, $ IINFO ) ELSE * * Use blocked code * IF( ( LEFT .AND. .NOT.NOTRAN ) .OR. $ ( .NOT.LEFT .AND. NOTRAN ) ) THEN I1 = 1 I2 = K I3 = NB ELSE I1 = ( ( K-1 ) / NB )*NB + 1 I2 = 1 I3 = -NB END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IB = MIN( NB, K-I+1 ) * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL DLARFT( 'Forward', 'Columnwise', NQ-I+1, IB, A( I, I ), $ LDA, TAU( I ), T, LDT ) IF( LEFT ) THEN * * H or H' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H or H' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H or H' * CALL DLARFB( SIDE, TRANS, 'Forward', 'Columnwise', MI, NI, $ IB, A( I, I ), LDA, T, LDT, C( IC, JC ), LDC, $ WORK, LDWORK ) 10 CONTINUE END IF WORK( 1 ) = IWS RETURN * * End of DORMQR * END octave-1.1.0/libcruft/lapack/drscl.f100666 415 17 5527 5406730420 15473 0ustar jweusers SUBROUTINE DRSCL( N, SA, SX, INCX ) * * -- LAPACK auxiliary routine (version 1.0) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INCX, N DOUBLE PRECISION SA * .. * .. Array Arguments .. DOUBLE PRECISION SX( * ) * .. * * Purpose * ======= * * DRSCL multiplies an n-element real vector x by the real scalar 1/a. * This is done without overflow or underflow as long as * the final result x/a does not overflow or underflow. * * Arguments * ========= * * N (input) INTEGER * The number of components of the vector x. * * SA (input) DOUBLE PRECISION * The scalar a which is used to divide each component of x. * SA must be >= 0, or the subroutine will divide by zero. * * SX (input/output) DOUBLE PRECISION array, dimension * (1+(N-1)*abs(INCX)) * The n-element vector x. * * INCX (input) INTEGER * The increment between successive values of the vector SX. * > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n * < 0: SX(1) = X(n) and SX(1+(i-1)*INCX) = x(n-i+1), 1< i<= n * * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. LOGICAL DONE DOUBLE PRECISION BIGNUM, CDEN, CDEN1, CNUM, CNUM1, MUL, SMLNUM * .. * .. External Functions .. DOUBLE PRECISION DLAMCH EXTERNAL DLAMCH * .. * .. External Subroutines .. EXTERNAL DLABAD, DSCAL * .. * .. Intrinsic Functions .. INTRINSIC ABS * .. * .. Executable Statements .. * * Quick return if possible * IF( N.LE.0 ) $ RETURN * * Get machine parameters * SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) * * Initialize the denominator to SA and the numerator to 1. * CDEN = SA CNUM = ONE * 10 CONTINUE CDEN1 = CDEN*SMLNUM CNUM1 = CNUM / BIGNUM IF( ABS( CDEN1 ).GT.ABS( CNUM ) .AND. CNUM.NE.ZERO ) THEN * * Pre-multiply X by SMLNUM if CDEN is large compared to CNUM. * MUL = SMLNUM DONE = .FALSE. CDEN = CDEN1 ELSE IF( ABS( CNUM1 ).GT.ABS( CDEN ) ) THEN * * Pre-multiply X by BIGNUM if CDEN is small compared to CNUM. * MUL = BIGNUM DONE = .FALSE. CNUM = CNUM1 ELSE * * Multiply X by CNUM / CDEN and return. * MUL = CNUM / CDEN DONE = .TRUE. END IF * * Scale the vector X by MUL * CALL DSCAL( N, MUL, SX, INCX ) * IF( .NOT.DONE ) $ GO TO 10 * RETURN * * End of DRSCL * END octave-1.1.0/libcruft/lapack/dtrevc.f100666 415 17 103337 5306544262 15717 0ustar jweusers SUBROUTINE DTREVC( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, $ LDVR, MM, M, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER HOWMNY, JOB INTEGER INFO, LDT, LDVL, LDVR, M, MM, N * .. * .. Array Arguments .. LOGICAL SELECT( * ) DOUBLE PRECISION T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), $ WORK( * ) * .. * * Purpose * ======= * * DTREVC computes all or some right and/or left eigenvectors of a * real upper quasi-triangular matrix T in Schur canonical form. * * The right eigenvector x and the left eigenvector y of T corresponding * to an eigenvalue w are defined by: * * T*x = w*x, y'*T = w*y' * * where y' denotes the conjugate transpose of the vector y. * * The routine may either return the matrices X and/or Y of right or * left eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an * input orthogonal matrix. If T was obtained from the real Schur * factorization of an original matrix A = Q*T*Q', then Q*X and/or Q*Y * are the matrices of right or left eigenvectors of A. * * Arguments * ========= * * JOB (input) CHARACTER*1 * = 'R': compute right eigenvectors only * = 'L': compute left eigenvectors only * = 'B': compute both right and left eigenvectors * * HOWMNY (input) CHARACTER*1 * Specifies how many left/right eigenvectors are wanted and the * form of the eigenvector matrix X or Y returned in VR or VL. * = 'A': compute all right and/or left eigenvectors; * = 'O': compute all right and/or left eigenvectors, multiplied * on the left by an input (generally orthogonal) matrix; * = 'S': compute some right and/or left eigenvectors, specified * by the logical array SELECT. * * SELECT (input/output) LOGICAL array, dimension (N) * If HOWMNY = 'S', SELECT specifies the eigenvectors to be * computed. To select the real eigenvector corresponding to a * real eigenvalue w(j), SELECT(j) must be set to .TRUE.. To * select the complex eigenvector corresponding to a complex * conjugate pair w(j) and w(j+1), either SELECT(j) or * SELECT(j+1) must be set to .TRUE.; then on exit SELECT(j) is * .TRUE. and SELECT(j+1) is .FALSE.. * If HOWMNY = 'A' or 'O', SELECT is not referenced. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input) DOUBLE PRECISION array, dimension (LDT,N) * The upper quasi-triangular matrix T in Schur canonical form. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * VL (input/output) DOUBLE PRECISION array, dimension (LDVL,MM) * On entry, if JOB = 'L' or 'B' and HOWMNY = 'O', VL must * contain an n-by-n matrix Q (usually the orthogonal matrix Q * of Schur vectors returned by DHSEQR). * On exit, if JOB = 'L' or 'B', VL contains: * if HOWMNY = 'A', the matrix Y of left eigenvectors of T; * if HOWMNY = 'O', the matrix Q*Y; * if HOWMNY = 'S', the left eigenvectors of T specified by * SELECT, stored consecutively in the columns * of VL, in the same order as their * eigenvalues. * A complex eigenvector corresponding to a complex eigenvalue * is stored in two consecutive columns, the first holding the * real part, and the second the imaginary part. * If JOB = 'R', VL is not referenced. * * LDVL (input) INTEGER * The leading dimension of the array VL. * LDVL >= max(1,N) if JOB = 'L' or 'B'; LDVL >= 1 otherwise. * * VR (input/output) DOUBLE PRECISION array, dimension (LDVR,MM) * On entry, if JOB = 'R' or 'B' and HOWMNY = 'O', VR must * contain an n-by-n matrix Q (usually the orthogonal matrix Q * of Schur vectors returned by DHSEQR). * On exit, if JOB = 'R' or 'B', VR contains: * if HOWMNY = 'A', the matrix X of right eigenvectors of T; * if HOWMNY = 'O', the matrix Q*X; * if HOWMNY = 'S', the right eigenvectors of T specified by * SELECT, stored consecutively in the columns * of VR, in the same order as their * eigenvalues. * A complex eigenvector corresponding to a complex eigenvalue * is stored in two consecutive columns, the first holding the * real part and the second the imaginary part. * If JOB = 'L', VR is not referenced. * * LDVR (input) INTEGER * The leading dimension of the array VR. * LDVR >= max(1,N) if JOB = 'R' or 'B'; LDVR >= 1 otherwise. * * MM (input) INTEGER * The number of columns in the arrays VL and/or VR. MM >= M. * * M (output) INTEGER * The number of columns in the arrays VL and/or VR required to * store the eigenvectors; each selected real eigenvector * occupies one column and each selected complex eigenvector * occupies two columns. If HOWMNY = 'A' or 'O', M is set to N. * * WORK (workspace) DOUBLE PRECISION array, dimension (3*N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The algorithm used in this program is basically backward (forward) * substitution, with scaling to make the the code robust against * possible overflow. * * Each eigenvector is normalized so that the element of largest * magnitude has magnitude 1; here the magnitude of a complex number * (x,y) is taken to be |x| + |y|. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL ALLV, BOTHV, LEFTV, OVER, PAIR, RIGHTV, SOMEV INTEGER I, IERR, II, IP, IS, J, J1, J2, JNXT, K, KI, N2 DOUBLE PRECISION BETA, BIGNUM, EMAX, OVFL, REC, REMAX, SCALE, $ SMIN, SMLNUM, ULP, UNFL, VCRIT, VMAX, WI, WR, $ XNORM * .. * .. External Functions .. LOGICAL LSAME INTEGER IDAMAX DOUBLE PRECISION DDOT, DLAMCH EXTERNAL LSAME, IDAMAX, DDOT, DLAMCH * .. * .. External Subroutines .. EXTERNAL DAXPY, DCOPY, DGEMV, DLABAD, DLALN2, DSCAL, $ XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, SQRT * .. * .. Local Arrays .. DOUBLE PRECISION X( 2, 2 ) * .. * .. Executable Statements .. * * Decode and test the input parameters * BOTHV = LSAME( JOB, 'B' ) RIGHTV = LSAME( JOB, 'R' ) .OR. BOTHV LEFTV = LSAME( JOB, 'L' ) .OR. BOTHV * ALLV = LSAME( HOWMNY, 'A' ) OVER = LSAME( HOWMNY, 'O' ) SOMEV = LSAME( HOWMNY, 'S' ) * INFO = 0 IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN INFO = -1 ELSE IF( .NOT.ALLV .AND. .NOT.OVER .AND. .NOT.SOMEV ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -6 ELSE IF( LDVL.LT.1 .OR. ( LEFTV .AND. LDVL.LT.N ) ) THEN INFO = -8 ELSE IF( LDVR.LT.1 .OR. ( RIGHTV .AND. LDVR.LT.N ) ) THEN INFO = -10 ELSE * * Set M to the number of columns required to store the selected * eigenvectors, standardize the array SELECT if necessary, and * test MM. * IF( SOMEV ) THEN M = 0 PAIR = .FALSE. DO 10 J = 1, N IF( PAIR ) THEN PAIR = .FALSE. SELECT( J ) = .FALSE. ELSE IF( J.LT.N ) THEN IF( T( J+1, J ).EQ.ZERO ) THEN IF( SELECT( J ) ) $ M = M + 1 ELSE PAIR = .TRUE. IF( SELECT( J ) .OR. SELECT( J+1 ) ) THEN SELECT( J ) = .TRUE. M = M + 2 END IF END IF ELSE IF( SELECT( N ) ) $ M = M + 1 END IF END IF 10 CONTINUE ELSE M = N END IF * IF( MM.LT.M ) THEN INFO = -11 END IF END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DTREVC', -INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * Set the constants to control overflow. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = ONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( N / ULP ) BIGNUM = ( ONE-ULP ) / SMLNUM * * Compute 1-norm of each column of strictly upper triangular * part of T to control overflow in triangular solver. * WORK( 1 ) = ZERO DO 30 J = 2, N WORK( J ) = ZERO DO 20 I = 1, J - 1 WORK( J ) = WORK( J ) + ABS( T( I, J ) ) 20 CONTINUE 30 CONTINUE * * Index IP is used to specify the real or complex eigenvalue: * IP = 0, real eigenvalue, * 1, first of conjugate complex pair: (wr,wi) * -1, second of conjugate complex pair: (wr,wi) * N2 = 2*N * IF( RIGHTV ) THEN * * Compute right eigenvectors. * IP = 0 IS = M DO 140 KI = N, 1, -1 * IF( IP.EQ.1 ) $ GO TO 130 IF( KI.EQ.1 ) $ GO TO 40 IF( T( KI, KI-1 ).EQ.ZERO ) $ GO TO 40 IP = -1 * 40 CONTINUE IF( SOMEV ) THEN IF( IP.EQ.0 ) THEN IF( .NOT.SELECT( KI ) ) $ GO TO 130 ELSE IF( .NOT.SELECT( KI-1 ) ) $ GO TO 130 END IF END IF * * Compute the KI-th eigenvalue (WR,WI). * WR = T( KI, KI ) WI = ZERO IF( IP.NE.0 ) $ WI = SQRT( ABS( T( KI, KI-1 ) ) )* $ SQRT( ABS( T( KI-1, KI ) ) ) SMIN = MAX( ULP*( ABS( WR )+ABS( WI ) ), SMLNUM ) * IF( IP.EQ.0 ) THEN * * Real right eigenvector * WORK( KI+N ) = ONE * * Form right-hand side * DO 50 K = 1, KI - 1 WORK( K+N ) = -T( K, KI ) 50 CONTINUE * * Solve the upper quasi-triangular system: * (T(1:KI-1,1:KI-1) - WR)*X = SCALE*WORK. * JNXT = KI - 1 DO 60 J = KI - 1, 1, -1 IF( J.GT.JNXT ) $ GO TO 60 J1 = J J2 = J JNXT = J - 1 IF( J.GT.1 ) THEN IF( T( J, J-1 ).NE.ZERO ) THEN J1 = J - 1 JNXT = J - 2 END IF END IF * IF( J1.EQ.J2 ) THEN * * 1-by-1 diagonal block * CALL DLALN2( .FALSE., 1, 1, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, $ ZERO, X, 2, SCALE, XNORM, IERR ) * * Scale X(1,1) to avoid overflow when updating * the right-hand side. * IF( XNORM.GT.ONE ) THEN IF( WORK( J ).GT.BIGNUM / XNORM ) THEN X( 1, 1 ) = X( 1, 1 ) / XNORM SCALE = SCALE / XNORM END IF END IF * * Scale if necessary * IF( SCALE.NE.ONE ) $ CALL DSCAL( KI, SCALE, WORK( 1+N ), 1 ) WORK( J+N ) = X( 1, 1 ) * * Update right-hand side * CALL DAXPY( J-1, -X( 1, 1 ), T( 1, J ), 1, $ WORK( 1+N ), 1 ) * ELSE * * 2-by-2 diagonal block * CALL DLALN2( .FALSE., 2, 1, SMIN, ONE, $ T( J-1, J-1 ), LDT, ONE, ONE, $ WORK( J-1+N ), N, WR, ZERO, X, 2, $ SCALE, XNORM, IERR ) * * Scale X(1,1) and X(2,1) to avoid overflow when * updating the right-hand side. * IF( XNORM.GT.ONE ) THEN BETA = MAX( WORK( J-1 ), WORK( J ) ) IF( BETA.GT.BIGNUM / XNORM ) THEN X( 1, 1 ) = X( 1, 1 ) / XNORM X( 2, 1 ) = X( 2, 1 ) / XNORM SCALE = SCALE / XNORM END IF END IF * * Scale if necessary * IF( SCALE.NE.ONE ) $ CALL DSCAL( KI, SCALE, WORK( 1+N ), 1 ) WORK( J-1+N ) = X( 1, 1 ) WORK( J+N ) = X( 2, 1 ) * * Update right-hand side * CALL DAXPY( J-2, -X( 1, 1 ), T( 1, J-1 ), 1, $ WORK( 1+N ), 1 ) CALL DAXPY( J-2, -X( 2, 1 ), T( 1, J ), 1, $ WORK( 1+N ), 1 ) END IF 60 CONTINUE * * Copy the vector x or Q*x to VR and normalize. * IF( .NOT.OVER ) THEN CALL DCOPY( KI, WORK( 1+N ), 1, VR( 1, IS ), 1 ) * II = IDAMAX( KI, VR( 1, IS ), 1 ) REMAX = ONE / ABS( VR( II, IS ) ) CALL DSCAL( KI, REMAX, VR( 1, IS ), 1 ) * DO 70 K = KI + 1, N VR( K, IS ) = ZERO 70 CONTINUE ELSE IF( KI.GT.1 ) $ CALL DGEMV( 'N', N, KI-1, ONE, VR, LDVR, $ WORK( 1+N ), 1, WORK( KI+N ), $ VR( 1, KI ), 1 ) * II = IDAMAX( N, VR( 1, KI ), 1 ) REMAX = ONE / ABS( VR( II, KI ) ) CALL DSCAL( N, REMAX, VR( 1, KI ), 1 ) END IF * ELSE * * Complex right eigenvector. * * Initial solve * [ (T(KI-1,KI-1) T(KI-1,KI) ) - (WR + I* WI)]*X = 0. * [ (T(KI,KI-1) T(KI,KI) ) ] * IF( ABS( T( KI-1, KI ) ).GE.ABS( T( KI, KI-1 ) ) ) THEN WORK( KI-1+N ) = ONE WORK( KI+N2 ) = WI / T( KI-1, KI ) ELSE WORK( KI-1+N ) = -WI / T( KI, KI-1 ) WORK( KI+N2 ) = ONE END IF WORK( KI+N ) = ZERO WORK( KI-1+N2 ) = ZERO * * Form right-hand side * DO 80 K = 1, KI - 2 WORK( K+N ) = -WORK( KI-1+N )*T( K, KI-1 ) WORK( K+N2 ) = -WORK( KI+N2 )*T( K, KI ) 80 CONTINUE * * Solve upper quasi-triangular system: * (T(1:KI-2,1:KI-2) - (WR+i*WI))*X = SCALE*(WORK+i*WORK2) * JNXT = KI - 2 DO 90 J = KI - 2, 1, -1 IF( J.GT.JNXT ) $ GO TO 90 J1 = J J2 = J JNXT = J - 1 IF( J.GT.1 ) THEN IF( T( J, J-1 ).NE.ZERO ) THEN J1 = J - 1 JNXT = J - 2 END IF END IF * IF( J1.EQ.J2 ) THEN * * 1-by-1 diagonal block * CALL DLALN2( .FALSE., 1, 2, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, WI, $ X, 2, SCALE, XNORM, IERR ) * * Scale X(1,1) and X(1,2) to avoid overflow when * updating the right-hand side. * IF( XNORM.GT.ONE ) THEN IF( WORK( J ).GT.BIGNUM / XNORM ) THEN X( 1, 1 ) = X( 1, 1 ) / XNORM X( 1, 2 ) = X( 1, 2 ) / XNORM SCALE = SCALE / XNORM END IF END IF * * Scale if necessary * IF( SCALE.NE.ONE ) THEN CALL DSCAL( KI, SCALE, WORK( 1+N ), 1 ) CALL DSCAL( KI, SCALE, WORK( 1+N2 ), 1 ) END IF WORK( J+N ) = X( 1, 1 ) WORK( J+N2 ) = X( 1, 2 ) * * Update the right-hand side * CALL DAXPY( J-1, -X( 1, 1 ), T( 1, J ), 1, $ WORK( 1+N ), 1 ) CALL DAXPY( J-1, -X( 1, 2 ), T( 1, J ), 1, $ WORK( 1+N2 ), 1 ) * ELSE * * 2-by-2 diagonal block * CALL DLALN2( .FALSE., 2, 2, SMIN, ONE, $ T( J-1, J-1 ), LDT, ONE, ONE, $ WORK( J-1+N ), N, WR, WI, X, 2, SCALE, $ XNORM, IERR ) * * Scale X to avoid overflow when updating * the right-hand side. * IF( XNORM.GT.ONE ) THEN BETA = MAX( WORK( J-1 ), WORK( J ) ) IF( BETA.GT.BIGNUM / XNORM ) THEN REC = ONE / XNORM X( 1, 1 ) = X( 1, 1 )*REC X( 1, 2 ) = X( 1, 2 )*REC X( 2, 1 ) = X( 2, 1 )*REC X( 2, 2 ) = X( 2, 2 )*REC SCALE = SCALE*REC END IF END IF * * Scale if necessary * IF( SCALE.NE.ONE ) THEN CALL DSCAL( KI, SCALE, WORK( 1+N ), 1 ) CALL DSCAL( KI, SCALE, WORK( 1+N2 ), 1 ) END IF WORK( J-1+N ) = X( 1, 1 ) WORK( J+N ) = X( 2, 1 ) WORK( J-1+N2 ) = X( 1, 2 ) WORK( J+N2 ) = X( 2, 2 ) * * Update the right-hand side * CALL DAXPY( J-2, -X( 1, 1 ), T( 1, J-1 ), 1, $ WORK( 1+N ), 1 ) CALL DAXPY( J-2, -X( 2, 1 ), T( 1, J ), 1, $ WORK( 1+N ), 1 ) CALL DAXPY( J-2, -X( 1, 2 ), T( 1, J-1 ), 1, $ WORK( 1+N2 ), 1 ) CALL DAXPY( J-2, -X( 2, 2 ), T( 1, J ), 1, $ WORK( 1+N2 ), 1 ) END IF 90 CONTINUE * * Copy the vector x or Q*x to VR and normalize. * IF( .NOT.OVER ) THEN CALL DCOPY( KI, WORK( 1+N ), 1, VR( 1, IS-1 ), 1 ) CALL DCOPY( KI, WORK( 1+N2 ), 1, VR( 1, IS ), 1 ) * EMAX = ZERO DO 100 K = 1, KI EMAX = MAX( EMAX, ABS( VR( K, IS-1 ) )+ $ ABS( VR( K, IS ) ) ) 100 CONTINUE * REMAX = ONE / EMAX CALL DSCAL( KI, REMAX, VR( 1, IS-1 ), 1 ) CALL DSCAL( KI, REMAX, VR( 1, IS ), 1 ) * DO 110 K = KI + 1, N VR( K, IS-1 ) = ZERO VR( K, IS ) = ZERO 110 CONTINUE * ELSE * IF( KI.GT.2 ) THEN CALL DGEMV( 'N', N, KI-2, ONE, VR, LDVR, $ WORK( 1+N ), 1, WORK( KI-1+N ), $ VR( 1, KI-1 ), 1 ) CALL DGEMV( 'N', N, KI-2, ONE, VR, LDVR, $ WORK( 1+N2 ), 1, WORK( KI+N2 ), $ VR( 1, KI ), 1 ) ELSE CALL DSCAL( N, WORK( KI-1+N ), VR( 1, KI-1 ), 1 ) CALL DSCAL( N, WORK( KI+N2 ), VR( 1, KI ), 1 ) END IF * EMAX = ZERO DO 120 K = 1, N EMAX = MAX( EMAX, ABS( VR( K, KI-1 ) )+ $ ABS( VR( K, KI ) ) ) 120 CONTINUE REMAX = ONE / EMAX CALL DSCAL( N, REMAX, VR( 1, KI-1 ), 1 ) CALL DSCAL( N, REMAX, VR( 1, KI ), 1 ) END IF END IF * IS = IS - 1 IF( IP.NE.0 ) $ IS = IS - 1 130 CONTINUE IF( IP.EQ.1 ) $ IP = 0 IF( IP.EQ.-1 ) $ IP = 1 140 CONTINUE END IF * IF( LEFTV ) THEN * * Compute left eigenvectors. * IP = 0 IS = 1 DO 260 KI = 1, N * IF( IP.EQ.-1 ) $ GO TO 250 IF( KI.EQ.N ) $ GO TO 150 IF( T( KI+1, KI ).EQ.ZERO ) $ GO TO 150 IP = 1 * 150 CONTINUE IF( SOMEV ) THEN IF( .NOT.SELECT( KI ) ) $ GO TO 250 END IF * * Compute the KI-th eigenvalue (WR,WI). * WR = T( KI, KI ) WI = ZERO IF( IP.NE.0 ) $ WI = SQRT( ABS( T( KI, KI+1 ) ) )* $ SQRT( ABS( T( KI+1, KI ) ) ) SMIN = MAX( ULP*( ABS( WR )+ABS( WI ) ), SMLNUM ) * IF( IP.EQ.0 ) THEN * * Real left eigenvector. * WORK( KI+N ) = ONE * * Form right-hand side * DO 160 K = KI + 1, N WORK( K+N ) = -T( KI, K ) 160 CONTINUE * * Solve the quasi-triangular system: * (T(KI+1:N,KI+1:N) - WR)'*X = SCALE*WORK * VMAX = ONE VCRIT = BIGNUM * JNXT = KI + 1 DO 170 J = KI + 1, N IF( J.LT.JNXT ) $ GO TO 170 J1 = J J2 = J JNXT = J + 1 IF( J.LT.N ) THEN IF( T( J+1, J ).NE.ZERO ) THEN J2 = J + 1 JNXT = J + 2 END IF END IF * IF( J1.EQ.J2 ) THEN * * 1-by-1 diagonal block * * Scale if necessary to avoid overflow when forming * the right-hand side. * IF( WORK( J ).GT.VCRIT ) THEN REC = ONE / VMAX CALL DSCAL( N-KI+1, REC, WORK( KI+N ), 1 ) VMAX = ONE VCRIT = BIGNUM END IF * WORK( J+N ) = WORK( J+N ) - $ DDOT( J-KI-1, T( KI+1, J ), 1, $ WORK( KI+1+N ), 1 ) * * Solve (T(J,J)-WR)'*X = WORK * CALL DLALN2( .FALSE., 1, 1, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, $ ZERO, X, 2, SCALE, XNORM, IERR ) * * Scale if necessary * IF( SCALE.NE.ONE ) $ CALL DSCAL( N-KI+1, SCALE, WORK( KI+N ), 1 ) WORK( J+N ) = X( 1, 1 ) VMAX = MAX( ABS( WORK( J+N ) ), VMAX ) VCRIT = BIGNUM / VMAX * ELSE * * 2-by-2 diagonal block * * Scale if necessary to avoid overflow when forming * the right-hand side. * BETA = MAX( WORK( J ), WORK( J+1 ) ) IF( BETA.GT.VCRIT ) THEN REC = ONE / VMAX CALL DSCAL( N-KI+1, REC, WORK( KI+N ), 1 ) VMAX = ONE VCRIT = BIGNUM END IF * WORK( J+N ) = WORK( J+N ) - $ DDOT( J-KI-1, T( KI+1, J ), 1, $ WORK( KI+1+N ), 1 ) * WORK( J+1+N ) = WORK( J+1+N ) - $ DDOT( J-KI-1, T( KI+1, J+1 ), 1, $ WORK( KI+1+N ), 1 ) * * Solve * [T(J,J)-WR T(J,J+1) ]'* X = SCALE*( WORK1 ) * [T(J+1,J) T(J+1,J+1)-WR] ( WORK2 ) * CALL DLALN2( .TRUE., 2, 1, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, $ ZERO, X, 2, SCALE, XNORM, IERR ) * * Scale if necessary * IF( SCALE.NE.ONE ) $ CALL DSCAL( N-KI+1, SCALE, WORK( KI+N ), 1 ) WORK( J+N ) = X( 1, 1 ) WORK( J+1+N ) = X( 2, 1 ) * VMAX = MAX( ABS( WORK( J+N ) ), $ ABS( WORK( J+1+N ) ), VMAX ) VCRIT = BIGNUM / VMAX * END IF 170 CONTINUE * * Copy the vector x or Q*x to VL and normalize. * IF( .NOT.OVER ) THEN CALL DCOPY( N-KI+1, WORK( KI+N ), 1, VL( KI, IS ), 1 ) * II = IDAMAX( N-KI+1, VL( KI, IS ), 1 ) + KI - 1 REMAX = ONE / ABS( VL( II, IS ) ) CALL DSCAL( N-KI+1, REMAX, VL( KI, IS ), 1 ) * DO 180 K = 1, KI - 1 VL( K, IS ) = ZERO 180 CONTINUE * ELSE * IF( KI.LT.N ) $ CALL DGEMV( 'N', N, N-KI, ONE, VL( 1, KI+1 ), LDVL, $ WORK( KI+1+N ), 1, WORK( KI+N ), $ VL( 1, KI ), 1 ) * II = IDAMAX( N, VL( 1, KI ), 1 ) REMAX = ONE / ABS( VL( II, KI ) ) CALL DSCAL( N, REMAX, VL( 1, KI ), 1 ) * END IF * ELSE * * Complex left eigenvector. * * Initial solve: * ((T(KI,KI) T(KI,KI+1) )' - (WR - I* WI))*X = 0. * ((T(KI+1,KI) T(KI+1,KI+1)) ) * IF( ABS( T( KI, KI+1 ) ).GE.ABS( T( KI+1, KI ) ) ) THEN WORK( KI+N ) = WI / T( KI, KI+1 ) WORK( KI+1+N2 ) = ONE ELSE WORK( KI+N ) = ONE WORK( KI+1+N2 ) = -WI / T( KI+1, KI ) END IF WORK( KI+1+N ) = ZERO WORK( KI+N2 ) = ZERO * * Form right-hand side * DO 190 K = KI + 2, N WORK( K+N ) = -WORK( KI+N )*T( KI, K ) WORK( K+N2 ) = -WORK( KI+1+N2 )*T( KI+1, K ) 190 CONTINUE * * Solve complex quasi-triangular system: * ( T(KI+2,N:KI+2,N) - (WR-i*WI) )*X = WORK1+i*WORK2 * VMAX = ONE VCRIT = BIGNUM * JNXT = KI + 2 DO 200 J = KI + 2, N IF( J.LT.JNXT ) $ GO TO 200 J1 = J J2 = J JNXT = J + 1 IF( J.LT.N ) THEN IF( T( J+1, J ).NE.ZERO ) THEN J2 = J + 1 JNXT = J + 2 END IF END IF * IF( J1.EQ.J2 ) THEN * * 1-by-1 diagonal block * * Scale if necessary to avoid overflow when * forming the right-hand side entries. * IF( WORK( J ).GT.VCRIT ) THEN REC = ONE / VMAX CALL DSCAL( N-KI+1, REC, WORK( KI+N ), 1 ) CALL DSCAL( N-KI+1, REC, WORK( KI+N2 ), 1 ) VMAX = ONE VCRIT = BIGNUM END IF * WORK( J+N ) = WORK( J+N ) - $ DDOT( J-KI-2, T( KI+2, J ), 1, $ WORK( KI+2+N ), 1 ) WORK( J+N2 ) = WORK( J+N2 ) - $ DDOT( J-KI-2, T( KI+2, J ), 1, $ WORK( KI+2+N2 ), 1 ) * * Solve (T(J,J)-(WR-i*WI))*(X11+i*X12)= WK+I*WK2 * CALL DLALN2( .FALSE., 1, 2, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, $ -WI, X, 2, SCALE, XNORM, IERR ) * * Scale if necessary * IF( SCALE.NE.ONE ) THEN CALL DSCAL( N-KI+1, SCALE, WORK( KI+N ), 1 ) CALL DSCAL( N-KI+1, SCALE, WORK( KI+N2 ), 1 ) END IF WORK( J+N ) = X( 1, 1 ) WORK( J+N2 ) = X( 1, 2 ) VMAX = MAX( ABS( WORK( J+N ) ), $ ABS( WORK( J+N2 ) ), VMAX ) VCRIT = BIGNUM / VMAX * ELSE * * 2-by-2 diagonal block * * Scale if necessary to avoid overflow when forming * the right-hand side entries. * BETA = MAX( WORK( J ), WORK( J+1 ) ) IF( BETA.GT.VCRIT ) THEN REC = ONE / VMAX CALL DSCAL( N-KI+1, REC, WORK( KI+N ), 1 ) CALL DSCAL( N-KI+1, REC, WORK( KI+N2 ), 1 ) VMAX = ONE VCRIT = BIGNUM END IF * WORK( J+N ) = WORK( J+N ) - $ DDOT( J-KI-2, T( KI+2, J ), 1, $ WORK( KI+2+N ), 1 ) * WORK( J+N2 ) = WORK( J+N2 ) - $ DDOT( J-KI-2, T( KI+2, J ), 1, $ WORK( KI+2+N2 ), 1 ) * WORK( J+1+N ) = WORK( J+1+N ) - $ DDOT( J-KI-2, T( KI+2, J+1 ), 1, $ WORK( KI+2+N ), 1 ) * WORK( J+1+N2 ) = WORK( J+1+N2 ) - $ DDOT( J-KI-2, T( KI+2, J+1 ), 1, $ WORK( KI+2+N2 ), 1 ) * * Solve 2-by-2 complex linear equation * ([T(j,j) T(j,j+1) ]'-(wr-i*wi)*I)*X = SCALE*B * ([T(j+1,j) T(j+1,j+1)] ) * CALL DLALN2( .TRUE., 2, 2, SMIN, ONE, T( J, J ), $ LDT, ONE, ONE, WORK( J+N ), N, WR, $ -WI, X, 2, SCALE, XNORM, IERR ) * * Scale if necessary * IF( SCALE.NE.ONE ) THEN CALL DSCAL( N-KI+1, SCALE, WORK( KI+N ), 1 ) CALL DSCAL( N-KI+1, SCALE, WORK( KI+N2 ), 1 ) END IF WORK( J+N ) = X( 1, 1 ) WORK( J+N2 ) = X( 1, 2 ) WORK( J+1+N ) = X( 2, 1 ) WORK( J+1+N2 ) = X( 2, 2 ) VMAX = MAX( ABS( X( 1, 1 ) ), ABS( X( 1, 2 ) ), $ ABS( X( 2, 1 ) ), ABS( X( 2, 2 ) ), VMAX ) VCRIT = BIGNUM / VMAX * END IF 200 CONTINUE * * Copy the vector x or Q*x to VL and normalize. * 210 CONTINUE IF( .NOT.OVER ) THEN CALL DCOPY( N-KI+1, WORK( KI+N ), 1, VL( KI, IS ), 1 ) CALL DCOPY( N-KI+1, WORK( KI+N2 ), 1, VL( KI, IS+1 ), $ 1 ) * EMAX = ZERO DO 220 K = KI, N EMAX = MAX( EMAX, ABS( VL( K, IS ) )+ $ ABS( VL( K, IS+1 ) ) ) 220 CONTINUE REMAX = ONE / EMAX CALL DSCAL( N-KI+1, REMAX, VL( KI, IS ), 1 ) CALL DSCAL( N-KI+1, REMAX, VL( KI, IS+1 ), 1 ) * DO 230 K = 1, KI - 1 VL( K, IS ) = ZERO VL( K, IS+1 ) = ZERO 230 CONTINUE ELSE IF( KI.LT.N-1 ) THEN CALL DGEMV( 'N', N, N-KI-1, ONE, VL( 1, KI+2 ), $ LDVL, WORK( KI+2+N ), 1, WORK( KI+N ), $ VL( 1, KI ), 1 ) CALL DGEMV( 'N', N, N-KI-1, ONE, VL( 1, KI+2 ), $ LDVL, WORK( KI+2+N2 ), 1, $ WORK( KI+1+N2 ), VL( 1, KI+1 ), 1 ) ELSE CALL DSCAL( N, WORK( KI+N ), VL( 1, KI ), 1 ) CALL DSCAL( N, WORK( KI+1+N2 ), VL( 1, KI+1 ), 1 ) END IF * EMAX = ZERO DO 240 K = 1, N EMAX = MAX( EMAX, ABS( VL( K, KI ) )+ $ ABS( VL( K, KI+1 ) ) ) 240 CONTINUE REMAX = ONE / EMAX CALL DSCAL( N, REMAX, VL( 1, KI ), 1 ) CALL DSCAL( N, REMAX, VL( 1, KI+1 ), 1 ) * END IF * END IF * IS = IS + 1 IF( IP.NE.0 ) $ IS = IS + 1 250 CONTINUE IF( IP.EQ.-1 ) $ IP = 0 IF( IP.EQ.1 ) $ IP = -1 * 260 CONTINUE * END IF * RETURN * * End of DTREVC * END octave-1.1.0/libcruft/lapack/dtrexc.f100666 415 17 24203 5412145360 15665 0ustar jweusers SUBROUTINE DTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, WORK, $ INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER COMPQ INTEGER IFST, ILST, INFO, LDQ, LDT, N * .. * .. Array Arguments .. DOUBLE PRECISION Q( LDQ, * ), T( LDT, * ), WORK( * ) * .. * * Purpose * ======= * * DTREXC reorders the real Schur factorization of a real matrix * A = Q*T*Q**T, so that the diagonal block of T with row index IFST is * moved to row ILST. * * The real Schur form T is reordered by an orthogonal similarity * transformation Z**T*T*Z, and optionally the matrix Q of Schur vectors * is updated by postmultiplying it with Z. * * T must be in Schur canonical form (as returned by DHSEQR), that is, * block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each * 2-by-2 diagonal block has its diagonal elements equal and its * off-diagonal elements of opposite sign. * * Arguments * ========= * * COMPQ (input) CHARACTER*1 * = 'V': update the matrix Q of Schur vectors; * = 'N': do not update Q. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) DOUBLE PRECISION array, dimension (LDT,N) * On entry, the upper quasi-triangular matrix T, in Schur * Schur canonical form. * On exit, the reordered upper quasi-triangular matrix, again * in Schur canonical form. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * Q (input/output) DOUBLE PRECISION array, dimension (LDQ,N) * On entry, if COMPQ = 'V', the matrix Q of Schur vectors. * On exit, if COMPQ = 'V', Q has been postmultiplied by the * orthogonal transformation matrix Z which reorders T. * If COMPQ = 'N', Q is not referenced. * * LDQ (input) INTEGER * The leading dimension of the array Q. LDQ >= max(1,N). * * IFST (input/output) INTEGER * ILST (input/output) INTEGER * Specify the reordering of the diagonal blocks of T. * The block with row index IFST is moved to row ILST, by a * sequence of transpositions between adjacent blocks. * On exit, if IFST pointed on entry to the second row of a * 2-by-2 block, it is changed to point to the first row; ILST * always points to the first row of the block in its final * position (which may differ from its input value by +1 or -1). * 1 <= IFST <= N; 1 <= ILST <= N. * * WORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * = 1: two adjacent blocks were too close to swap (the problem * is very ill-conditioned); T may have been partially * reordered, and ILST points to the first row of the * current position of the block being moved. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. LOGICAL WANTQ INTEGER HERE, NBF, NBL, NBNEXT * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL DLAEXC, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Decode and test the input arguments. * INFO = 0 WANTQ = LSAME( COMPQ, 'V' ) IF( .NOT.WANTQ .AND. .NOT.LSAME( COMPQ, 'N' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.MAX( 1, N ) ) ) THEN INFO = -6 ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN INFO = -7 ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DTREXC', -INFO ) RETURN END IF * * Quick return if possible * IF( N.LE.1 ) $ RETURN * * Determine the first row of specified block * and find out it is 1 by 1 or 2 by 2. * IF( IFST.GT.1 ) THEN IF( T( IFST, IFST-1 ).NE.ZERO ) $ IFST = IFST - 1 END IF NBF = 1 IF( IFST.LT.N ) THEN IF( T( IFST+1, IFST ).NE.ZERO ) $ NBF = 2 END IF * * Determine the first row of the final block * and find out it is 1 by 1 or 2 by 2. * IF( ILST.GT.1 ) THEN IF( T( ILST, ILST-1 ).NE.ZERO ) $ ILST = ILST - 1 END IF NBL = 1 IF( ILST.LT.N ) THEN IF( T( ILST+1, ILST ).NE.ZERO ) $ NBL = 2 END IF * IF( IFST.EQ.ILST ) $ RETURN * IF( IFST.LT.ILST ) THEN * * Update ILST * IF( NBF.EQ.2 .AND. NBL.EQ.1 ) $ ILST = ILST - 1 IF( NBF.EQ.1 .AND. NBL.EQ.2 ) $ ILST = ILST + 1 * HERE = IFST * 10 CONTINUE * * Swap block with next one below * IF( NBF.EQ.1 .OR. NBF.EQ.2 ) THEN * * Current block either 1 by 1 or 2 by 2 * NBNEXT = 1 IF( HERE+NBF+1.LE.N ) THEN IF( T( HERE+NBF+1, HERE+NBF ).NE.ZERO ) $ NBNEXT = 2 END IF CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, NBF, NBNEXT, $ WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF HERE = HERE + NBNEXT * * Test if 2 by 2 block breaks into two 1 by 1 blocks * IF( NBF.EQ.2 ) THEN IF( T( HERE+1, HERE ).EQ.ZERO ) $ NBF = 3 END IF * ELSE * * Current block consists of two 1 by 1 blocks each of which * must be swapped individually * NBNEXT = 1 IF( HERE+3.LE.N ) THEN IF( T( HERE+3, HERE+2 ).NE.ZERO ) $ NBNEXT = 2 END IF CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE+1, 1, NBNEXT, $ WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF IF( NBNEXT.EQ.1 ) THEN * * Swap two 1 by 1 blocks, no problems possible * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, 1, NBNEXT, $ WORK, INFO ) HERE = HERE + 1 ELSE * * Recompute NBNEXT in case 2 by 2 split * IF( T( HERE+2, HERE+1 ).EQ.ZERO ) $ NBNEXT = 1 IF( NBNEXT.EQ.2 ) THEN * * 2 by 2 Block did not split * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, 1, $ NBNEXT, WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF HERE = HERE + 2 ELSE * * 2 by 2 Block did split * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, 1, 1, $ WORK, INFO ) CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE+1, 1, 1, $ WORK, INFO ) HERE = HERE + 2 END IF END IF END IF IF( HERE.LT.ILST ) $ GO TO 10 * ELSE * HERE = IFST 20 CONTINUE * * Swap block with next one above * IF( NBF.EQ.1 .OR. NBF.EQ.2 ) THEN * * Current block either 1 by 1 or 2 by 2 * NBNEXT = 1 IF( HERE.GE.3 ) THEN IF( T( HERE-1, HERE-2 ).NE.ZERO ) $ NBNEXT = 2 END IF CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE-NBNEXT, NBNEXT, $ NBF, WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF HERE = HERE - NBNEXT * * Test if 2 by 2 block breaks into two 1 by 1 blocks * IF( NBF.EQ.2 ) THEN IF( T( HERE+1, HERE ).EQ.ZERO ) $ NBF = 3 END IF * ELSE * * Current block consists of two 1 by 1 blocks each of which * must be swapped individually * NBNEXT = 1 IF( HERE.GE.3 ) THEN IF( T( HERE-1, HERE-2 ).NE.ZERO ) $ NBNEXT = 2 END IF CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE-NBNEXT, NBNEXT, $ 1, WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF IF( NBNEXT.EQ.1 ) THEN * * Swap two 1 by 1 blocks, no problems possible * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, NBNEXT, 1, $ WORK, INFO ) HERE = HERE - 1 ELSE * * Recompute NBNEXT in case 2 by 2 split * IF( T( HERE, HERE-1 ).EQ.ZERO ) $ NBNEXT = 1 IF( NBNEXT.EQ.2 ) THEN * * 2 by 2 Block did not split * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE-1, 2, 1, $ WORK, INFO ) IF( INFO.NE.0 ) THEN ILST = HERE RETURN END IF HERE = HERE - 2 ELSE * * 2 by 2 Block did split * CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE, 1, 1, $ WORK, INFO ) CALL DLAEXC( WANTQ, N, T, LDT, Q, LDQ, HERE-1, 1, 1, $ WORK, INFO ) HERE = HERE - 2 END IF END IF END IF IF( HERE.GT.ILST ) $ GO TO 20 END IF ILST = HERE * RETURN * * End of DTREXC * END octave-1.1.0/libcruft/lapack/dtrsen.f100666 415 17 34071 5412145356 15704 0ustar jweusers SUBROUTINE DTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, WR, WI, $ M, S, SEP, WORK, LWORK, IWORK, LIWORK, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER COMPQ, JOB INTEGER INFO, LDQ, LDT, LIWORK, LWORK, M, N DOUBLE PRECISION S, SEP * .. * .. Array Arguments .. LOGICAL SELECT( * ) INTEGER IWORK( * ) DOUBLE PRECISION Q( LDQ, * ), T( LDT, * ), WI( * ), WORK( * ), $ WR( * ) * .. * * Purpose * ======= * * DTRSEN reorders the real Schur factorization of a real matrix * A = Q*T*Q**T, so that a selected cluster of eigenvalues appears in * the leading diagonal blocks of the upper quasi-triangular matrix T, * and the leading columns of Q form an orthonormal basis of the * corresponding right invariant subspace. * * Optionally the routine computes the reciprocal condition numbers of * the cluster of eigenvalues and/or the invariant subspace. * * T must be in Schur canonical form (as returned by DHSEQR), that is, * block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; each * 2-by-2 diagonal block has its diagonal elemnts equal and its * off-diagonal elements of opposite sign. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies whether condition numbers are required for the * cluster of eigenvalues (S) or the invariant subspace (SEP): * = 'N': none; * = 'E': for eigenvalues only (S); * = 'V': for invariant subspace only (SEP); * = 'B': for both eigenvalues and invariant subspace (S and * SEP). * * COMPQ (input) CHARACTER*1 * = 'V': update the matrix Q of Schur vectors; * = 'N': do not update Q. * * SELECT (input) LOGICAL array, dimension (N) * SELECT specifies the eigenvalues in the selected cluster. To * select a real eigenvalue w(j), SELECT(j) must be set to * .TRUE.. To select a complex conjugate pair of eigenvalues * w(j) and w(j+1), corresponding to a 2-by-2 diagonal block, * either SELECT(j) or SELECT(j+1) or both must be set to * .TRUE.; a complex conjugate pair of eigenvalues must be * either both included in the cluster or both excluded. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) DOUBLE PRECISION array, dimension(LDT,N) * On entry, the upper quasi-triangular matrix T, in Schur * canonical form. * On exit, T is overwritten by the reordered matrix T, again in * Schur canonical form, with the selected eigenvalues in the * leading diagonal blocks. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * Q (input/output) DOUBLE PRECISION array, dimension (LDQ,N) * On entry, if COMPQ = 'V', the matrix Q of Schur vectors. * On exit, if COMPQ = 'V', Q has been postmultiplied by the * orthogonal transformation matrix which reorders T; the * leading M columns of Q form an orthonormal basis for the * specified invariant subspace. * If COMPQ = 'N', Q is not referenced. * * LDQ (input) INTEGER * The leading dimension of the array Q. * LDQ >= 1; and if COMPQ = 'V', LDQ >= N. * * WR (output) DOUBLE PRECISION array, dimension (N) * WI (output) DOUBLE PRECISION array, dimension (N) * The real and imaginary parts, respectively, of the reordered * eigenvalues of T. The eigenvalues are stored in the same * order as on the diagonal of T, with WR(i) = T(i,i) and, if * T(i:i+1,i:i+1) is a 2-by-2 diagonal block, WI(i) > 0 and * WI(i+1) = -WI(i). Note that if a complex eigenvalue is * sufficiently ill-conditioned, then its value may differ * significantly from its value before reordering. * * M (output) INTEGER * The dimension of the specified invariant subspace. * 0 < = M <= N. * * S (output) DOUBLE PRECISION * If JOB = 'E' or 'B', S is a lower bound on the reciprocal * condition number for the selected cluster of eigenvalues. * S cannot underestimate the true reciprocal condition number * by more than a factor of sqrt(N). If M = 0 or N, S = 1. * If JOB = 'N' or 'V', S is not referenced. * * SEP (output) DOUBLE PRECISION * If JOB = 'V' or 'B', SEP is the estimated reciprocal * condition number of the specified invariant subspace. If * M = 0 or N, SEP = norm(T). * If JOB = 'N' or 'E', SEP is not referenced. * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK) * * LWORK (input) INTEGER * The dimension of the array WORK. * If JOB = 'N', LWORK >= max(1,N); * if JOB = 'E', LWORK >= M*(N-M); * if JOB = 'V' or 'B', LWORK >= 2*M*(N-M). * * IWORK (workspace) INTEGER * IF JOB = 'N' or 'E', IWORK is not referenced. * * LIWORK (input) INTEGER * The dimension of the array IWORK. * If JOB = 'N' or 'E', LIWORK >= 1; * if JOB = 'V' or 'B', LIWORK >= M*(N-M). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * = 1: reordering of T failed because some eigenvalues are too * close to separate (the problem is very ill-conditioned); * T may have been partially reordered, and WR and WI * contain the eigenvalues in the same order as in T; S and * SEP (if requested) are set to zero. * * Further Details * =============== * * DTRSEN first collects the selected eigenvalues by computing an * orthogonal transformation Z to move them to the top left corner of T. * In other words, the selected eigenvalues are the eigenvalues of T11 * in: * * Z'*T*Z = ( T11 T12 ) n1 * ( 0 T22 ) n2 * n1 n2 * * where N = n1+n2 and Z' means the transpose of Z. The first n1 columns * of Z span the specified invariant subspace of T. * * If T has been obtained from the real Schur factorization of a matrix * A = Q*T*Q', then the reordered real Schur factorization of A is given * by A = (Q*Z)*(Z'*T*Z)*(Q*Z)', and the first n1 columns of Q*Z span * the corresponding invariant subspace of A. * * The reciprocal condition number of the average of the eigenvalues of * T11 may be returned in S. S lies between 0 (very badly conditioned) * and 1 (very well conditioned). It is computed as follows. First we * compute R so that * * P = ( I R ) n1 * ( 0 0 ) n2 * n1 n2 * * is the projector on the invariant subspace associated with T11. * R is the solution of the Sylvester equation: * * T11*R - R*T22 = T12. * * Let F-norm(M) denote the Frobenius-norm of M and 2-norm(M) denote * the two-norm of M. Then S is computed as the lower bound * * (1 + F-norm(R)**2)**(-1/2) * * on the reciprocal of 2-norm(P), the true reciprocal condition number. * S cannot underestimate 1 / 2-norm(P) by more than a factor of * sqrt(N). * * An approximate error bound for the computed average of the * eigenvalues of T11 is * * EPS * norm(T) / S * * where EPS is the machine precision. * * The reciprocal condition number of the right invariant subspace * spanned by the first n1 columns of Z (or of Q*Z) is returned in SEP. * SEP is defined as the separation of T11 and T22: * * sep( T11, T22 ) = sigma-min( C ) * * where sigma-min(C) is the smallest singular value of the * n1*n2-by-n1*n2 matrix * * C = kprod( I(n2), T11 ) - kprod( transpose(T22), I(n1) ) * * I(m) is an m by m identity matrix, and kprod denotes the Kronecker * product. We estimate sigma-min(C) by the reciprocal of an estimate of * the 1-norm of inverse(C). The true reciprocal 1-norm of inverse(C) * cannot differ from sigma-min(C) by more than a factor of sqrt(n1*n2). * * When SEP is small, small changes in T can cause large changes in * the invariant subspace. An approximate bound on the maximum angular * error in the computed right invariant subspace is * * EPS * norm(T) / SEP * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL PAIR, SWAP, WANTBH, WANTQ, WANTS, WANTSP INTEGER IERR, K, KASE, KK, KS, N1, N2, NN DOUBLE PRECISION EST, RNORM, SCALE * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLANGE EXTERNAL LSAME, DLANGE * .. * .. External Subroutines .. EXTERNAL DLACON, DLACPY, DTREXC, DTRSYL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, SQRT * .. * .. Executable Statements .. * * Decode and test the input parameters * WANTBH = LSAME( JOB, 'B' ) WANTS = LSAME( JOB, 'E' ) .OR. WANTBH WANTSP = LSAME( JOB, 'V' ) .OR. WANTBH WANTQ = LSAME( COMPQ, 'V' ) * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.WANTS .AND. .NOT.WANTSP ) $ THEN INFO = -1 ELSE IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -6 ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN INFO = -8 ELSE * * Set M to the dimension of the specified invariant subspace, * and test LWORK and LIWORK. * M = 0 PAIR = .FALSE. DO 10 K = 1, N IF( PAIR ) THEN PAIR = .FALSE. ELSE IF( K.LT.N ) THEN IF( T( K+1, K ).EQ.ZERO ) THEN IF( SELECT( K ) ) $ M = M + 1 ELSE PAIR = .TRUE. IF( SELECT( K ) .OR. SELECT( K+1 ) ) $ M = M + 2 END IF ELSE IF( SELECT( N ) ) $ M = M + 1 END IF END IF 10 CONTINUE * N1 = M N2 = N - M NN = N1*N2 * IF( LWORK.LT.1 .OR. ( ( WANTS .AND. .NOT.WANTSP ) .AND. $ LWORK.LT.NN ) .OR. ( WANTSP .AND. LWORK.LT.2*NN ) ) THEN INFO = -15 ELSE IF( LIWORK.LT.1 .OR. ( WANTSP .AND. LIWORK.LT.NN ) ) THEN INFO = -17 END IF END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DTRSEN', -INFO ) RETURN END IF * * Quick return if possible. * IF( M.EQ.N .OR. M.EQ.0 ) THEN IF( WANTS ) $ S = ONE IF( WANTSP ) $ SEP = DLANGE( '1', N, N, T, LDT, WORK ) GO TO 40 END IF * * Collect the selected blocks at the top-left corner of T. * KS = 0 PAIR = .FALSE. DO 20 K = 1, N IF( PAIR ) THEN PAIR = .FALSE. ELSE SWAP = SELECT( K ) IF( K.LT.N ) THEN IF( T( K+1, K ).NE.ZERO ) THEN PAIR = .TRUE. SWAP = SWAP .OR. SELECT( K+1 ) END IF END IF IF( SWAP ) THEN KS = KS + 1 * * Swap the K-th block to position KS. * IERR = 0 KK = K IF( K.NE.KS ) $ CALL DTREXC( COMPQ, N, T, LDT, Q, LDQ, KK, KS, WORK, $ IERR ) IF( IERR.EQ.1 .OR. IERR.EQ.2 ) THEN * * Blocks too close to swap: exit. * INFO = 1 IF( WANTS ) $ S = ZERO IF( WANTSP ) $ SEP = ZERO GO TO 40 END IF IF( PAIR ) $ KS = KS + 1 END IF END IF 20 CONTINUE * IF( WANTS ) THEN * * Solve Sylvester equation for R: * * T11*R - R*T22 = scale*T12 * CALL DLACPY( 'F', N1, N2, T( 1, N1+1 ), LDT, WORK, N1 ) CALL DTRSYL( 'N', 'N', -1, N1, N2, T, LDT, T( N1+1, N1+1 ), $ LDT, WORK, N1, SCALE, IERR ) * * Estimate the reciprocal of the condition number of the cluster * of eigenvalues. * RNORM = DLANGE( 'F', N1, N2, WORK, N1, WORK ) IF( RNORM.EQ.ZERO ) THEN S = ONE ELSE S = SCALE / ( SQRT( SCALE*SCALE / RNORM+RNORM )* $ SQRT( RNORM ) ) END IF END IF * IF( WANTSP ) THEN * * Estimate sep(T11,T22). * EST = ZERO KASE = 0 30 CONTINUE CALL DLACON( NN, WORK( NN+1 ), WORK, IWORK, EST, KASE ) IF( KASE.NE.0 ) THEN IF( KASE.EQ.1 ) THEN * * Solve T11*R - R*T22 = scale*X. * CALL DTRSYL( 'N', 'N', -1, N1, N2, T, LDT, $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE, $ IERR ) ELSE * * Solve T11'*R - R*T22' = scale*X. * CALL DTRSYL( 'T', 'T', -1, N1, N2, T, LDT, $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE, $ IERR ) END IF GO TO 30 END IF * SEP = SCALE / EST END IF * 40 CONTINUE * * Store the output eigenvalues in WR and WI. * DO 50 K = 1, N WR( K ) = T( K, K ) WI( K ) = ZERO 50 CONTINUE DO 60 K = 1, N - 1 IF( T( K+1, K ).NE.ZERO ) THEN WI( K ) = SQRT( ABS( T( K, K+1 ) ) )* $ SQRT( ABS( T( K+1, K ) ) ) WI( K+1 ) = -WI( K ) END IF 60 CONTINUE RETURN * * End of DTRSEN * END octave-1.1.0/libcruft/lapack/dtrsyl.f100666 415 17 101404 5412145357 15742 0ustar jweusers SUBROUTINE DTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, $ LDC, SCALE, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER TRANA, TRANB INTEGER INFO, ISGN, LDA, LDB, LDC, M, N DOUBLE PRECISION SCALE * .. * .. Array Arguments .. DOUBLE PRECISION A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * * Purpose * ======= * * DTRSYL solves the real Sylvester matrix equation: * * op(A)*X + X*op(B) = scale*C or * op(A)*X - X*op(B) = scale*C, * * where op(A) = A or A**T, and A and B are both upper quasi- * triangular. A is M-by-M and B is N-by-N; the right hand side C and * the solution X are M-by-N; and scale is an output scale factor, set * <= 1 to avoid overflow in X. * * A and B must be in Schur canonical form (as returned by DHSEQR), that * is, block upper triangular with 1-by-1 and 2-by-2 diagonal blocks; * each 2-by-2 diagonal block has its diagonal elements equal and its * off-diagonal elements of opposite sign. * * Arguments * ========= * * TRANA (input) CHARACTER*1 * Specifies the option op(A): * = 'N': op(A) = A (No transpose) * = 'T': op(A) = A**T (Transpose) * = 'C': op(A) = A**H (Conjugate transpose = Transpose) * * TRANB (input) CHARACTER*1 * Specifies the option op(B): * = 'N': op(B) = B (No transpose) * = 'T': op(B) = B**T (Transpose) * = 'C': op(B) = B**H (Conjugate transpose = Transpose) * * ISGN (input) INTEGER * Specifies the sign in the equation: * = +1: solve op(A)*X + X*op(B) = scale*C * = -1: solve op(A)*X - X*op(B) = scale*C * * M (input) INTEGER * The order of the matrix A, and the number of rows in the * matrices X and C. M >= 0. * * N (input) INTEGER * The order of the matrix B, and the number of columns in the * matrices X and C. N >= 0. * * A (input) DOUBLE PRECISION array, dimension (LDA,M) * The upper quasi-triangular matrix A, in Schur canonical form. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * B (input) DOUBLE PRECISION array, dimension (LDB,N) * The upper quasi-triangular matrix B, in Schur canonical form. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * C (input/output) DOUBLE PRECISION array, dimension (LDC,N) * On entry, the M-by-N right hand side matrix C. * On exit, C is overwritten by the solution matrix X. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M) * * SCALE (output) DOUBLE PRECISION * The scale factor, scale, set <= 1 to avoid overflow in X. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * = 1: A and B have common or very close eigenvalues; perturbed * values were used to solve the equation (but the matrices * A and B are unchanged). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL NOTRNA, NOTRNB INTEGER IERR, J, K, K1, K2, KNEXT, L, L1, L2, LNEXT DOUBLE PRECISION A11, BIGNUM, DA11, DB, EPS, SCALOC, SGN, SMIN, $ SMLNUM, SUML, SUMR, XNORM * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ), VEC( 2, 2 ), X( 2, 2 ) * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DDOT, DLAMCH, DLANGE EXTERNAL LSAME, DDOT, DLAMCH, DLANGE * .. * .. External Subroutines .. EXTERNAL DLABAD, DLALN2, DLASY2, DSCAL, XERBLA * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, MAX, MIN * .. * .. Executable Statements .. * * Decode and Test input parameters * NOTRNA = LSAME( TRANA, 'N' ) NOTRNB = LSAME( TRANB, 'N' ) * INFO = 0 IF( .NOT.NOTRNA .AND. .NOT.LSAME( TRANA, 'T' ) .AND. .NOT. $ LSAME( TRANA, 'C' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRNB .AND. .NOT.LSAME( TRANB, 'T' ) .AND. .NOT. $ LSAME( TRANB, 'C' ) ) THEN INFO = -2 ELSE IF( ISGN.NE.1 .AND. ISGN.NE.-1 ) THEN INFO = -3 ELSE IF( M.LT.0 ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -7 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -9 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -11 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'DTRSYL', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * * Set constants to control overflow * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SMLNUM*DBLE( M*N ) / EPS BIGNUM = ONE / SMLNUM * SMIN = MAX( SMLNUM, EPS*DLANGE( 'M', M, M, A, LDA, DUM ), $ EPS*DLANGE( 'M', N, N, B, LDB, DUM ) ) * SCALE = ONE SGN = ISGN * IF( NOTRNA .AND. NOTRNB ) THEN * * Solve A*X + ISGN*X*B = scale*C. * * The (K,L)th block of X is determined starting from * bottom-left corner column by column by * * A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) * * Where * M L-1 * R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)]. * I=K+1 J=1 * * Start column loop (index = L) * L1 (L2) : column index of the first (first) row of X(K,L). * LNEXT = 1 DO 60 L = 1, N IF( L.LT.LNEXT ) $ GO TO 60 IF( L.EQ.N ) THEN L1 = L L2 = L ELSE IF( B( L+1, L ).NE.ZERO ) THEN L1 = L L2 = L + 1 LNEXT = L + 2 ELSE L1 = L L2 = L LNEXT = L + 1 END IF END IF * * Start row loop (index = K) * K1 (K2): row index of the first (last) row of X(K,L). * KNEXT = M DO 50 K = M, 1, -1 IF( K.GT.KNEXT ) $ GO TO 50 IF( K.EQ.1 ) THEN K1 = K K2 = K ELSE IF( A( K, K-1 ).NE.ZERO ) THEN K1 = K - 1 K2 = K KNEXT = K - 2 ELSE K1 = K K2 = K KNEXT = K - 1 END IF END IF * IF( L1.EQ.L2 .AND. K1.EQ.K2 ) THEN SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) SCALOC = ONE * A11 = A( K1, K1 ) + SGN*B( L1, L1 ) DA11 = ABS( A11 ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( VEC( 1, 1 ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF X( 1, 1 ) = ( VEC( 1, 1 )*SCALOC ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 10 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 10 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) * ELSE IF( L1.EQ.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * CALL DLALN2( .FALSE., 2, 1, SMIN, ONE, A( K1, K1 ), $ LDA, ONE, ONE, VEC, 2, -SGN*B( L1, L1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 20 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 20 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K2, L1 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.EQ.K2 ) THEN * SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = SGN*( C( K1, L1 )-( SUML+SGN*SUMR ) ) * SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L2 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 2, 1 ) = SGN*( C( K1, L2 )-( SUML+SGN*SUMR ) ) * CALL DLALN2( .TRUE., 2, 1, SMIN, ONE, B( L1, L1 ), $ LDB, ONE, ONE, VEC, 2, -SGN*A( K1, K1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 30 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 30 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L2 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 1, 2 ) = C( K1, L2 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L2 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 2, 2 ) = C( K2, L2 ) - ( SUML+SGN*SUMR ) * CALL DLASY2( .FALSE., .FALSE., ISGN, 2, 2, $ A( K1, K1 ), LDA, B( L1, L1 ), LDB, VEC, $ 2, SCALOC, X, 2, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 40 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 40 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 1, 2 ) C( K2, L1 ) = X( 2, 1 ) C( K2, L2 ) = X( 2, 2 ) END IF * 50 CONTINUE * 60 CONTINUE * ELSE IF( .NOT.NOTRNA .AND. NOTRNB ) THEN * * Solve A' *X + ISGN*X*B = scale*C. * * The (K,L)th block of X is determined starting from * upper-left corner column by column by * * A(K,K)'*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) * * Where * K-1 L-1 * R(K,L) = SUM [A(I,K)'*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)] * I=1 J=1 * * Start column loop (index = L) * L1 (L2): column index of the first (last) row of X(K,L) * LNEXT = 1 DO 120 L = 1, N IF( L.LT.LNEXT ) $ GO TO 120 IF( L.EQ.N ) THEN L1 = L L2 = L ELSE IF( B( L+1, L ).NE.ZERO ) THEN L1 = L L2 = L + 1 LNEXT = L + 2 ELSE L1 = L L2 = L LNEXT = L + 1 END IF END IF * * Start row loop (index = K) * K1 (K2): row index of the first (last) row of X(K,L) * KNEXT = 1 DO 110 K = 1, M IF( K.LT.KNEXT ) $ GO TO 110 IF( K.EQ.M ) THEN K1 = K K2 = K ELSE IF( A( K+1, K ).NE.ZERO ) THEN K1 = K K2 = K + 1 KNEXT = K + 2 ELSE K1 = K K2 = K KNEXT = K + 1 END IF END IF * IF( L1.EQ.L2 .AND. K1.EQ.K2 ) THEN SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) SCALOC = ONE * A11 = A( K1, K1 ) + SGN*B( L1, L1 ) DA11 = ABS( A11 ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( VEC( 1, 1 ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF X( 1, 1 ) = ( VEC( 1, 1 )*SCALOC ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 70 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 70 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) * ELSE IF( L1.EQ.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * CALL DLALN2( .TRUE., 2, 1, SMIN, ONE, A( K1, K1 ), $ LDA, ONE, ONE, VEC, 2, -SGN*B( L1, L1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 80 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 80 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K2, L1 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.EQ.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = SGN*( C( K1, L1 )-( SUML+SGN*SUMR ) ) * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 2, 1 ) = SGN*( C( K1, L2 )-( SUML+SGN*SUMR ) ) * CALL DLALN2( .TRUE., 2, 1, SMIN, ONE, B( L1, L1 ), $ LDB, ONE, ONE, VEC, 2, -SGN*A( K1, K1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 90 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 90 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( L1-1, C( K1, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 1, 2 ) = C( K1, L2 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L1 ), 1 ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( L1-1, C( K2, 1 ), LDC, B( 1, L2 ), 1 ) VEC( 2, 2 ) = C( K2, L2 ) - ( SUML+SGN*SUMR ) * CALL DLASY2( .TRUE., .FALSE., ISGN, 2, 2, A( K1, K1 ), $ LDA, B( L1, L1 ), LDB, VEC, 2, SCALOC, X, $ 2, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 100 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 100 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 1, 2 ) C( K2, L1 ) = X( 2, 1 ) C( K2, L2 ) = X( 2, 2 ) END IF * 110 CONTINUE 120 CONTINUE * ELSE IF( .NOT.NOTRNA .AND. .NOT.NOTRNB ) THEN * * Solve A'*X + ISGN*X*B' = scale*C. * * The (K,L)th block of X is determined starting from * top-right corner column by column by * * A(K,K)'*X(K,L) + ISGN*X(K,L)*B(L,L)' = C(K,L) - R(K,L) * * Where * K-1 N * R(K,L) = SUM [A(I,K)'*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)']. * I=1 J=L+1 * * Start column loop (index = L) * L1 (L2): column index of the first (last) row of X(K,L) * LNEXT = N DO 180 L = N, 1, -1 IF( L.GT.LNEXT ) $ GO TO 180 IF( L.EQ.1 ) THEN L1 = L L2 = L ELSE IF( B( L, L-1 ).NE.ZERO ) THEN L1 = L - 1 L2 = L LNEXT = L - 2 ELSE L1 = L L2 = L LNEXT = L - 1 END IF END IF * * Start row loop (index = K) * K1 (K2): row index of the first (last) row of X(K,L) * KNEXT = 1 DO 170 K = 1, M IF( K.LT.KNEXT ) $ GO TO 170 IF( K.EQ.M ) THEN K1 = K K2 = K ELSE IF( A( K+1, K ).NE.ZERO ) THEN K1 = K K2 = K + 1 KNEXT = K + 2 ELSE K1 = K K2 = K KNEXT = K + 1 END IF END IF * IF( L1.EQ.L2 .AND. K1.EQ.K2 ) THEN SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L1, C( K1, MIN( L1+1, N ) ), LDC, $ B( L1, MIN( L1+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) SCALOC = ONE * A11 = A( K1, K1 ) + SGN*B( L1, L1 ) DA11 = ABS( A11 ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( VEC( 1, 1 ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF X( 1, 1 ) = ( VEC( 1, 1 )*SCALOC ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 130 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 130 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) * ELSE IF( L1.EQ.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * CALL DLALN2( .TRUE., 2, 1, SMIN, ONE, A( K1, K1 ), $ LDA, ONE, ONE, VEC, 2, -SGN*B( L1, L1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 140 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 140 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K2, L1 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.EQ.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = SGN*( C( K1, L1 )-( SUML+SGN*SUMR ) ) * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = SGN*( C( K1, L2 )-( SUML+SGN*SUMR ) ) * CALL DLALN2( .FALSE., 2, 1, SMIN, ONE, B( L1, L1 ), $ LDB, ONE, ONE, VEC, 2, -SGN*A( K1, K1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 150 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 150 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K1 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 1, 2 ) = C( K1, L2 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L1 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( K1-1, A( 1, K2 ), 1, C( 1, L2 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 2, 2 ) = C( K2, L2 ) - ( SUML+SGN*SUMR ) * CALL DLASY2( .TRUE., .TRUE., ISGN, 2, 2, A( K1, K1 ), $ LDA, B( L1, L1 ), LDB, VEC, 2, SCALOC, X, $ 2, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 160 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 160 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 1, 2 ) C( K2, L1 ) = X( 2, 1 ) C( K2, L2 ) = X( 2, 2 ) END IF * 170 CONTINUE 180 CONTINUE * ELSE IF( NOTRNA .AND. .NOT.NOTRNB ) THEN * * Solve A*X + ISGN*X*B' = scale*C. * * The (K,L)th block of X is determined starting from * bottom-right corner column by column by * * A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L)' = C(K,L) - R(K,L) * * Where * M N * R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B(L,J)']. * I=K+1 J=L+1 * * Start column loop (index = L) * L1 (L2): column index of the first (last) row of X(K,L) * LNEXT = N DO 240 L = N, 1, -1 IF( L.GT.LNEXT ) $ GO TO 240 IF( L.EQ.1 ) THEN L1 = L L2 = L ELSE IF( B( L, L-1 ).NE.ZERO ) THEN L1 = L - 1 L2 = L LNEXT = L - 2 ELSE L1 = L L2 = L LNEXT = L - 1 END IF END IF * * Start row loop (index = K) * K1 (K2): row index of the first (last) row of X(K,L) * KNEXT = M DO 230 K = M, 1, -1 IF( K.GT.KNEXT ) $ GO TO 230 IF( K.EQ.1 ) THEN K1 = K K2 = K ELSE IF( A( K, K-1 ).NE.ZERO ) THEN K1 = K - 1 K2 = K KNEXT = K - 2 ELSE K1 = K K2 = K KNEXT = K - 1 END IF END IF * IF( L1.EQ.L2 .AND. K1.EQ.K2 ) THEN SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L1 ), 1 ) SUMR = DDOT( N-L1, C( K1, MIN( L1+1, N ) ), LDC, $ B( L1, MIN( L1+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) SCALOC = ONE * A11 = A( K1, K1 ) + SGN*B( L1, L1 ) DA11 = ABS( A11 ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( VEC( 1, 1 ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF X( 1, 1 ) = ( VEC( 1, 1 )*SCALOC ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 190 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 190 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) * ELSE IF( L1.EQ.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * CALL DLALN2( .FALSE., 2, 1, SMIN, ONE, A( K1, K1 ), $ LDA, ONE, ONE, VEC, 2, -SGN*B( L1, L1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 200 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 200 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K2, L1 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.EQ.K2 ) THEN * SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = SGN*( C( K1, L1 )-( SUML+SGN*SUMR ) ) * SUML = DDOT( M-K1, A( K1, MIN( K1+1, M ) ), LDA, $ C( MIN( K1+1, M ), L2 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = SGN*( C( K1, L2 )-( SUML+SGN*SUMR ) ) * CALL DLALN2( .FALSE., 2, 1, SMIN, ONE, B( L1, L1 ), $ LDB, ONE, ONE, VEC, 2, -SGN*A( K1, K1 ), $ ZERO, X, 2, SCALOC, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 210 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 210 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 2, 1 ) * ELSE IF( L1.NE.L2 .AND. K1.NE.K2 ) THEN * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 1, 1 ) = C( K1, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K1, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L2 ), 1 ) SUMR = DDOT( N-L2, C( K1, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 1, 2 ) = C( K1, L2 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L1 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L1, MIN( L2+1, N ) ), LDB ) VEC( 2, 1 ) = C( K2, L1 ) - ( SUML+SGN*SUMR ) * SUML = DDOT( M-K2, A( K2, MIN( K2+1, M ) ), LDA, $ C( MIN( K2+1, M ), L2 ), 1 ) SUMR = DDOT( N-L2, C( K2, MIN( L2+1, N ) ), LDC, $ B( L2, MIN( L2+1, N ) ), LDB ) VEC( 2, 2 ) = C( K2, L2 ) - ( SUML+SGN*SUMR ) * CALL DLASY2( .FALSE., .TRUE., ISGN, 2, 2, A( K1, K1 ), $ LDA, B( L1, L1 ), LDB, VEC, 2, SCALOC, X, $ 2, XNORM, IERR ) IF( IERR.NE.0 ) $ INFO = 1 * IF( SCALOC.NE.ONE ) THEN DO 220 J = 1, N CALL DSCAL( M, SCALOC, C( 1, J ), 1 ) 220 CONTINUE SCALE = SCALE*SCALOC END IF C( K1, L1 ) = X( 1, 1 ) C( K1, L2 ) = X( 1, 2 ) C( K2, L1 ) = X( 2, 1 ) C( K2, L2 ) = X( 2, 2 ) END IF * 230 CONTINUE 240 CONTINUE * END IF * RETURN * * End of DTRSYL * END octave-1.1.0/libcruft/lapack/dzsum1.f100666 415 17 3471 5412145401 15577 0ustar jweusers DOUBLE PRECISION FUNCTION DZSUM1( N, CX, INCX ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, N * .. * .. Array Arguments .. COMPLEX*16 CX( * ) * .. * * Purpose * ======= * * DZSUM1 takes the sum of the absolute values of a complex * vector and returns a double precision result. * * Based on DZASUM from the Level 1 BLAS. * The change is to use the 'genuine' absolute value. * * Contributed by Nick Higham for use with ZLACON. * * Arguments * ========= * * N (input) INTEGER * The number of elements in the vector CX. * * CX (input) COMPLEX*16 array, dimension (N) * The vector whose elements will be summed. * * INCX (input) INTEGER * The spacing between successive values of CX. INCX > 0. * * ===================================================================== * * .. Local Scalars .. INTEGER I, NINCX DOUBLE PRECISION STEMP * .. * .. Intrinsic Functions .. INTRINSIC ABS * .. * .. Executable Statements .. * DZSUM1 = 0.0D0 STEMP = 0.0D0 IF( N.LE.0 ) $ RETURN IF( INCX.EQ.1 ) $ GO TO 20 * * CODE FOR INCREMENT NOT EQUAL TO 1 * NINCX = N*INCX DO 10 I = 1, NINCX, INCX * * NEXT LINE MODIFIED. * STEMP = STEMP + ABS( CX( I ) ) 10 CONTINUE DZSUM1 = STEMP RETURN * * CODE FOR INCREMENT EQUAL TO 1 * 20 CONTINUE DO 30 I = 1, N * * NEXT LINE MODIFIED. * STEMP = STEMP + ABS( CX( I ) ) 30 CONTINUE DZSUM1 = STEMP RETURN * * End of DZSUM1 * END octave-1.1.0/libcruft/lapack/ilaenv.f100666 415 17 35612 5306544264 15670 0ustar jweusers INTEGER FUNCTION ILAENV( ISPEC, NAME, OPTS, N1, N2, N3, $ N4 ) * * -- LAPACK auxiliary routine (preliminary version) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 20, 1992 * * .. Scalar Arguments .. CHARACTER*( * ) NAME, OPTS INTEGER ISPEC, N1, N2, N3, N4 * .. * * Purpose * ======= * * ILAENV is called from the LAPACK routines to choose problem-dependent * parameters for the local environment. See ISPEC for a description of * the parameters. * * This version provides a set of parameters which should give good, * but not optimal, performance on many of the currently available * computers. Users are encouraged to modify this subroutine to set * the tuning parameters for their particular machine using the option * and problem size information in the arguments. * * This routine will not function correctly if it is converted to all * lower case. Converting it to all upper case is allowed. * * Arguments * ========= * * ISPEC (input) INTEGER * Specifies the parameter to be returned as the value of * ILAENV. * = 1: the optimal blocksize; if this value is 1, an unblocked * algorithm will give the best performance. * = 2: the minimum block size for which the block routine * should be used; if the usable block size is less than * this value, an unblocked routine should be used. * = 3: the crossover point (in a block routine, for N less * than this value, an unblocked routine should be used) * = 4: the number of shifts, used in the nonsymmetric * eigenvalue routines * = 5: the minimum column dimension for blocking to be used; * rectangular blocks must have dimension at least k by m, * where k is given by ILAENV(2,...) and m by ILAENV(5,...) * = 6: the crossover point for the SVD (when reducing an m by n * matrix to bidiagonal form, if max(m,n)/min(m,n) exceeds * this value, a QR factorization is used first to reduce * the matrix to a triangular form.) * = 7: the number of processors * = 8: the crossover point for the multishift QR and QZ methods * for nonsymmetric eigenvalue problems. * * NAME (input) CHARACTER*(*) * The name of the calling subroutine, in either upper case or * lower case. * * OPTS (input) CHARACTER*(*) * The character options to the subroutine NAME, concatenated * into a single character string. For example, UPLO = 'U', * TRANS = 'T', and DIAG = 'N' for a triangular routine would * be specified as OPTS = 'UTN'. * * N1 (input) INTEGER * N2 (input) INTEGER * N3 (input) INTEGER * N4 (input) INTEGER * Problem dimensions for the subroutine NAME; these may not all * be required. * * (ILAENV) (output) INTEGER * >= 0: the value of the parameter specified by ISPEC * < 0: if ILAENV = -k, the k-th argument had an illegal value. * * Further Details * =============== * * The following conventions have been used when calling ILAENV from the * LAPACK routines: * 1) OPTS is a concatenation of all of the character options to * subroutine NAME, in the same order that they appear in the * argument list for NAME, even if they are not used in determining * the value of the parameter specified by ISPEC. * 2) The problem dimensions N1, N2, N3, N4 are specified in the order * that they appear in the argument list for NAME. N1 is used * first, N2 second, and so on, and unused problem dimensions are * passed a value of -1. * 3) The parameter value returned by ILAENV is checked for validity in * the calling subroutine. For example, ILAENV is used to retrieve * the optimal blocksize for STRTRI as follows: * * NB = ILAENV( 1, 'STRTRI', UPLO // DIAG, N, -1, -1, -1 ) * IF( NB.LE.1 ) NB = MAX( 1, N ) * * ===================================================================== * * .. Local Scalars .. LOGICAL CNAME, SNAME CHARACTER*1 C1 CHARACTER*2 C2, C4 CHARACTER*3 C3 CHARACTER*6 SUBNAM INTEGER I, IC, IZ, NB, NBMIN, NX * .. * .. Intrinsic Functions .. INTRINSIC CHAR, ICHAR, INT, MIN, REAL * .. * .. Executable Statements .. * GO TO ( 100, 100, 100, 400, 500, 600, 700, 800 ) ISPEC * * Invalid value for ISPEC * ILAENV = -1 RETURN * 100 CONTINUE * * Convert NAME to upper case if the first character is lower case. * ILAENV = 1 SUBNAM = NAME IC = ICHAR( SUBNAM( 1:1 ) ) IZ = ICHAR( 'Z' ) IF( IZ.EQ.90 .OR. IZ.EQ.122 ) THEN * * ASCII character set * IF( IC.GE.97 .AND. IC.LE.122 ) THEN SUBNAM( 1:1 ) = CHAR( IC-32 ) DO 10 I = 2, 6 IC = ICHAR( SUBNAM( I:I ) ) IF( IC.GE.97 .AND. IC.LE.122 ) $ SUBNAM( I:I ) = CHAR( IC-32 ) 10 CONTINUE END IF * ELSE IF( IZ.EQ.233 .OR. IZ.EQ.169 ) THEN * * EBCDIC character set * IF( ( IC.GE.129 .AND. IC.LE.137 ) .OR. $ ( IC.GE.145 .AND. IC.LE.153 ) .OR. $ ( IC.GE.162 .AND. IC.LE.169 ) ) THEN SUBNAM( 1:1 ) = CHAR( IC+64 ) DO 20 I = 2, 6 IC = ICHAR( SUBNAM( I:I ) ) IF( ( IC.GE.129 .AND. IC.LE.137 ) .OR. $ ( IC.GE.145 .AND. IC.LE.153 ) .OR. $ ( IC.GE.162 .AND. IC.LE.169 ) ) $ SUBNAM( I:I ) = CHAR( IC+64 ) 20 CONTINUE END IF * ELSE IF( IZ.EQ.218 .OR. IZ.EQ.250 ) THEN * * Prime machines: ASCII+128 * IF( IC.GE.225 .AND. IC.LE.250 ) THEN SUBNAM( 1:1 ) = CHAR( IC-32 ) DO 30 I = 2, 6 IC = ICHAR( SUBNAM( I:I ) ) IF( IC.GE.225 .AND. IC.LE.250 ) $ SUBNAM( I:I ) = CHAR( IC-32 ) 30 CONTINUE END IF END IF * C1 = SUBNAM( 1:1 ) SNAME = C1.EQ.'S' .OR. C1.EQ.'D' CNAME = C1.EQ.'C' .OR. C1.EQ.'Z' IF( .NOT.( CNAME .OR. SNAME ) ) $ RETURN C2 = SUBNAM( 2:3 ) C3 = SUBNAM( 4:6 ) C4 = C3( 2:3 ) * GO TO ( 110, 200, 300 ) ISPEC * 110 CONTINUE * * ISPEC = 1: block size * * In these examples, separate code is provided for setting NB for * real and complex. We assume that NB will take the same value in * single or double precision. * NB = 1 * IF( C2.EQ.'GE' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF ELSE IF( C3.EQ.'QRF' .OR. C3.EQ.'RQF' .OR. C3.EQ.'LQF' .OR. $ C3.EQ.'QLF' ) THEN IF( SNAME ) THEN NB = 32 ELSE NB = 32 END IF ELSE IF( C3.EQ.'HRD' ) THEN IF( SNAME ) THEN NB = 32 ELSE NB = 32 END IF ELSE IF( C3.EQ.'BRD' ) THEN IF( SNAME ) THEN NB = 32 ELSE NB = 32 END IF ELSE IF( C3.EQ.'TRI' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF END IF ELSE IF( C2.EQ.'PO' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF END IF ELSE IF( C2.EQ.'SY' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF ELSE IF( SNAME .AND. C3.EQ.'TRD' ) THEN NB = 1 ELSE IF( SNAME .AND. C3.EQ.'GST' ) THEN NB = 64 END IF ELSE IF( CNAME .AND. C2.EQ.'HE' ) THEN IF( C3.EQ.'TRF' ) THEN NB = 64 ELSE IF( C3.EQ.'TRD' ) THEN NB = 1 ELSE IF( C3.EQ.'GST' ) THEN NB = 64 END IF ELSE IF( SNAME .AND. C2.EQ.'OR' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NB = 32 END IF ELSE IF( C3( 1:1 ).EQ.'M' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NB = 32 END IF END IF ELSE IF( CNAME .AND. C2.EQ.'UN' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NB = 32 END IF ELSE IF( C3( 1:1 ).EQ.'M' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NB = 32 END IF END IF ELSE IF( C2.EQ.'GB' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN IF( N4.LE.64 ) THEN NB = 1 ELSE NB = 32 END IF ELSE IF( N4.LE.64 ) THEN NB = 1 ELSE NB = 32 END IF END IF END IF ELSE IF( C2.EQ.'PB' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN IF( N2.LE.64 ) THEN NB = 1 ELSE NB = 32 END IF ELSE IF( N2.LE.64 ) THEN NB = 1 ELSE NB = 32 END IF END IF END IF ELSE IF( C2.EQ.'TR' ) THEN IF( C3.EQ.'TRI' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF END IF ELSE IF( C2.EQ.'LA' ) THEN IF( C3.EQ.'UUM' ) THEN IF( SNAME ) THEN NB = 64 ELSE NB = 64 END IF END IF ELSE IF( SNAME .AND. C2.EQ.'ST' ) THEN IF( C3.EQ.'EBZ' ) THEN NB = 1 END IF END IF ILAENV = NB RETURN * 200 CONTINUE * * ISPEC = 2: minimum block size * NBMIN = 2 IF( C2.EQ.'GE' ) THEN IF( C3.EQ.'QRF' .OR. C3.EQ.'RQF' .OR. C3.EQ.'LQF' .OR. $ C3.EQ.'QLF' ) THEN IF( SNAME ) THEN NBMIN = 2 ELSE NBMIN = 2 END IF ELSE IF( C3.EQ.'HRD' ) THEN IF( SNAME ) THEN NBMIN = 2 ELSE NBMIN = 2 END IF ELSE IF( C3.EQ.'BRD' ) THEN IF( SNAME ) THEN NBMIN = 2 ELSE NBMIN = 2 END IF ELSE IF( C3.EQ.'TRI' ) THEN IF( SNAME ) THEN NBMIN = 2 ELSE NBMIN = 2 END IF END IF ELSE IF( C2.EQ.'SY' ) THEN IF( C3.EQ.'TRF' ) THEN IF( SNAME ) THEN NBMIN = 2 ELSE NBMIN = 2 END IF ELSE IF( SNAME .AND. C3.EQ.'TRD' ) THEN NBMIN = 2 END IF ELSE IF( CNAME .AND. C2.EQ.'HE' ) THEN IF( C3.EQ.'TRD' ) THEN NBMIN = 2 END IF ELSE IF( SNAME .AND. C2.EQ.'OR' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NBMIN = 2 END IF ELSE IF( C3( 1:1 ).EQ.'M' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NBMIN = 2 END IF END IF ELSE IF( CNAME .AND. C2.EQ.'UN' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NBMIN = 2 END IF ELSE IF( C3( 1:1 ).EQ.'M' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NBMIN = 2 END IF END IF END IF ILAENV = NBMIN RETURN * 300 CONTINUE * * ISPEC = 3: crossover point * NX = 0 IF( C2.EQ.'GE' ) THEN IF( C3.EQ.'QRF' .OR. C3.EQ.'RQF' .OR. C3.EQ.'LQF' .OR. $ C3.EQ.'QLF' ) THEN IF( SNAME ) THEN NX = 128 ELSE NX = 128 END IF ELSE IF( C3.EQ.'HRD' ) THEN IF( SNAME ) THEN NX = 128 ELSE NX = 128 END IF ELSE IF( C3.EQ.'BRD' ) THEN IF( SNAME ) THEN NX = 128 ELSE NX = 128 END IF END IF ELSE IF( C2.EQ.'SY' ) THEN IF( SNAME .AND. C3.EQ.'TRD' ) THEN NX = 1 END IF ELSE IF( CNAME .AND. C2.EQ.'HE' ) THEN IF( C3.EQ.'TRD' ) THEN NX = 1 END IF ELSE IF( SNAME .AND. C2.EQ.'OR' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NX = 128 END IF END IF ELSE IF( CNAME .AND. C2.EQ.'UN' ) THEN IF( C3( 1:1 ).EQ.'G' ) THEN IF( C4.EQ.'QR' .OR. C4.EQ.'RQ' .OR. C4.EQ.'LQ' .OR. $ C4.EQ.'QL' .OR. C4.EQ.'HR' .OR. C4.EQ.'TR' .OR. $ C4.EQ.'BR' ) THEN NX = 128 END IF END IF END IF ILAENV = NX RETURN * 400 CONTINUE * * ISPEC = 4: number of shifts (used by xHSEQR) * ILAENV = 6 RETURN * 500 CONTINUE * * ISPEC = 5: minimum column dimension (not used) * ILAENV = 2 RETURN * 600 CONTINUE * * ISPEC = 6: crossover point for SVD (used by xGELSS and xGESVD) * ILAENV = INT( REAL( MIN( N1, N2 ) )*1.6E0 ) RETURN * 700 CONTINUE * * ISPEC = 7: number of processors (not used) * ILAENV = 1 RETURN * 800 CONTINUE * * ISPEC = 8: crossover point for multishift (used by xHSEQR) * ILAENV = 50 RETURN * * End of ILAENV * END octave-1.1.0/libcruft/lapack/izmax1.f100666 415 17 4170 5412145401 15562 0ustar jweusers INTEGER FUNCTION IZMAX1( N, CX, INCX ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INCX, N * .. * .. Array Arguments .. COMPLEX*16 CX( * ) * .. * * Purpose * ======= * * IZMAX1 finds the index of the element whose real part has maximum * absolute value. * * Based on IZAMAX from Level 1 BLAS. * The change is to use the 'genuine' absolute value. * * Contributed by Nick Higham for use with ZLACON. * * Arguments * ========= * * N (input) INTEGER * The number of elements in the vector CX. * * CX (input) COMPLEX*16 array, dimension (N) * The vector whose elements will be summed. * * INCX (input) INTEGER * The spacing between successive values of CX. INCX >= 1. * * .. Local Scalars .. INTEGER I, IX DOUBLE PRECISION SMAX COMPLEX*16 ZDUM * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE * .. * .. Statement Functions .. DOUBLE PRECISION CABS1 * .. * .. Statement Function definitions .. * * NEXT LINE IS THE ONLY MODIFICATION. CABS1( ZDUM ) = ABS( DBLE( ZDUM ) ) * .. * .. Executable Statements .. * IZMAX1 = 0 IF( N.LT.1 ) $ RETURN IZMAX1 = 1 IF( N.EQ.1 ) $ RETURN IF( INCX.EQ.1 ) $ GO TO 30 * * CODE FOR INCREMENT NOT EQUAL TO 1 * IX = 1 SMAX = CABS1( CX( 1 ) ) IX = IX + INCX DO 20 I = 2, N IF( CABS1( CX( IX ) ).LE.SMAX ) $ GO TO 10 IZMAX1 = I SMAX = CABS1( CX( IX ) ) 10 CONTINUE IX = IX + INCX 20 CONTINUE RETURN * * CODE FOR INCREMENT EQUAL TO 1 * 30 CONTINUE SMAX = CABS1( CX( 1 ) ) DO 40 I = 2, N IF( CABS1( CX( I ) ).LE.SMAX ) $ GO TO 40 IZMAX1 = I SMAX = CABS1( CX( I ) ) 40 CONTINUE RETURN * * End of IZMAX1 * END octave-1.1.0/libcruft/lapack/zbdsqr.f100666 415 17 77767 5306544301 15730 0ustar jweusers SUBROUTINE ZBDSQR( UPLO, N, NCVT, NRU, NCC, D, E, VT, LDVT, U, $ LDU, C, LDC, RWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDC, LDU, LDVT, N, NCC, NCVT, NRU * .. * .. Array Arguments .. DOUBLE PRECISION D( * ), E( * ), RWORK( * ) COMPLEX*16 C( LDC, * ), U( LDU, * ), VT( LDVT, * ) * .. * * Purpose * ======= * * ZBDSQR computes the singular value decomposition (SVD) of a real * N-by-N (upper or lower) bidiagonal matrix with diagonal D and * offdiagonal E, accumulating the transformations if desired. Letting * B denote the input bidiagonal matrix, the algorithm computes * orthogonal matrices Q and P such that B = Q * S * P' (P' denotes the * transpose of P). The singular values S are overwritten on D. * * The complex input matrix U is changed to U * Q if desired. * The complex input matrix VT is changed to P' * VT if desired. * The complex input matrix C is changed to Q' * C if desired. * * See "Computing Small Singular Values of Bidiagonal Matrices With * Guaranteed High Relative Accuracy," by J. Demmel and W. Kahan, * LAPACK Working Note #3, for a detailed description of the algorithm. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * On entry, UPLO specifies whether the input bidiagonal matrix * is upper or lower bidiagonal. * UPLO = 'U' or 'u' B is upper bidiagonal. * UPLO = 'L' or 'l' B is lower bidiagonal. * * N (input) INTEGER * On entry, N specifies the number of rows and columns * in the matrix. N must be at least 0. * * NCVT (input) INTEGER * On entry, NCVT specifies the number of columns of * the matrix VT. NCVT must be at least 0. * * NRU (input) INTEGER * On entry, NRU specifies the number of rows of * the matrix U. NRU must be at least 0. * * NCC (input) INTEGER * On entry, NCC specifies the number of columns of * the matrix C. NCC must be at least 0. * * D (input/output) DOUBLE PRECISION array, dimension (N) * On entry, D contains the diagonal entries of the * bidiagonal matrix whose SVD is desired. On normal exit, * D contains the singular values in decreasing order. * * E (input/output) DOUBLE PRECISION array, dimension (N-1) * On entry, the entries of E contain the * offdiagonal entries of of the bidiagonal matrix * whose SVD is desired. On normal exit, E will contain 0. * If the algorithm does not converge, D and E will contain * the diagonal and superdiagonal entries of a bidiagonal * matrix orthogonally equivalent to the one given as input. * * VT (input/output) COMPLEX*16 array, dimension (LDVT , NCVT) * On entry, contains an N-by-NCVT matrix which on exit * has been premultiplied by P' (not referenced if NCVT=0). * * LDVT (input) INTEGER * On entry, LDVT specifies the leading dimension of VT as * declared in the calling (sub) program. LDVT must be at * least 1. If NCVT is nonzero LDVT must also be at least N. * * U (input/output) COMPLEX*16 array, dimension (LDU , N) * On entry, contains an NRU-by-N matrix which on exit * has been postmultiplied by Q (not referenced if NRU=0). * * LDU (input) INTEGER * On entry, LDU specifies the leading dimension of U as * declared in the calling (sub) program. LDU must be at * least max( 1, NRU ) . * * C (input/output) COMPLEX*16 array, dimension (LDC , NCC) * On entry, contains an N-by-NCC matrix which on exit * has been premultiplied by Q' (not referenced if NCC=0). * * LDC (input) INTEGER * On entry, LDC specifies the leading dimension of C as * declared in the calling (sub) program. LDC must be at * least 1. If NCC is nonzero, LDC must also be at least N. * * RWORK (workspace) DOUBLE PRECISION array, dimension * (MAX( 1, 4*N-4 )) * Workspace. Only referenced if one of NCVT, NRU, or NCC is * nonzero, and if N is at least 2. * * INFO (output) INTEGER * On exit, a value of 0 indicates a successful exit. * If INFO < 0, argument number -INFO is illegal. * If INFO > 0, the algorithm did not converge, and INFO * specifies how many superdiagonals did not converge. * * Internal Parameters * =================== * * TOLMUL DOUBLE PRECISION, default = max(10,min(100,EPS**(-1/8))) * TOLMUL controls the convergence criterion of the QR loop. * If it is positive, TOLMUL*EPS is the desired relative * precision in the computed singular values. * If it is negative, abs(TOLMUL*EPS*sigma_max) is the * desired absolute accuracy in the computed singular * values (corresponds to relative accuracy * abs(TOLMUL*EPS) in the largest singular value. * abs(TOLMUL) should be between 1 and 1/EPS, and preferably * between 10 (for fast convergence) and .1/EPS * (for there to be some accuracy in the results). * Default is to lose at either one eighth or 2 of the * available decimal digits in each computed singular value * (whichever is smaller). * * MAXITR INTEGER, default = 6 * MAXITR controls the maximum number of passes of the * algorithm through its inner loop. The algorithms stops * (and so fails to converge) if the number of passes * through the inner loop exceeds MAXITR*N**2. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D0 ) DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D0 ) DOUBLE PRECISION NEGONE PARAMETER ( NEGONE = -1.0D0 ) DOUBLE PRECISION HNDRTH PARAMETER ( HNDRTH = 0.01D0 ) DOUBLE PRECISION TEN PARAMETER ( TEN = 10.0D0 ) DOUBLE PRECISION HNDRD PARAMETER ( HNDRD = 100.0D0 ) DOUBLE PRECISION MEIGTH PARAMETER ( MEIGTH = -0.125D0 ) INTEGER MAXITR PARAMETER ( MAXITR = 6 ) * .. * .. Local Scalars .. LOGICAL ROTATE INTEGER I, IDIR, IROT, ISUB, ITER, IUPLO, J, JOB, LL, $ LLL, M, MAXIT, NM1, NM12, NM13, OLDLL, OLDM DOUBLE PRECISION ABSE, ABSS, COSL, COSR, CS, EPS, F, G, GAP, $ GMAX, H, MU, OLDCS, OLDSN, R, SHIFT, SIGMN, $ SIGMX, SINL, SINR, SLL, SMAX, SMIN, SMINL, $ SMINLO, SMINOA, SN, THRESH, TOL, TOLMUL, UNFL * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLAMCH EXTERNAL LSAME, DLAMCH * .. * .. External Subroutines .. EXTERNAL DLARTG, DLAS2, DLASV2, XERBLA, ZDROT, ZDSCAL, $ ZLASR, ZSWAP * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, MAX, MIN, SIGN, SQRT * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IUPLO = 0 IF( LSAME( UPLO, 'U' ) ) $ IUPLO = 1 IF( LSAME( UPLO, 'L' ) ) $ IUPLO = 2 IF( IUPLO.EQ.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NCVT.LT.0 ) THEN INFO = -3 ELSE IF( NRU.LT.0 ) THEN INFO = -4 ELSE IF( NCC.LT.0 ) THEN INFO = -5 ELSE IF( ( NCVT.EQ.0 .AND. LDVT.LT.1 ) .OR. $ ( NCVT.GT.0 .AND. LDVT.LT.MAX( 1, N ) ) ) THEN INFO = -9 ELSE IF( LDU.LT.MAX( 1, NRU ) ) THEN INFO = -11 ELSE IF( ( NCC.EQ.0 .AND. LDC.LT.1 ) .OR. $ ( NCC.GT.0 .AND. LDC.LT.MAX( 1, N ) ) ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZBDSQR', -INFO ) RETURN END IF IF( N.EQ.0 ) $ RETURN IF( N.EQ.1 ) $ GO TO 190 * * ROTATE is true if any singular vectors desired, false otherwise * ROTATE = ( NCVT.GT.0 ) .OR. ( NRU.GT.0 ) .OR. ( NCC.GT.0 ) NM1 = N - 1 NM12 = NM1 + NM1 NM13 = NM12 + NM1 * * Get machine constants * EPS = DLAMCH( 'Epsilon' ) UNFL = DLAMCH( 'Safe minimum' ) TOLMUL = MAX( TEN, MIN( HNDRD, EPS**MEIGTH ) ) TOL = TOLMUL*EPS * * If matrix lower bidiagonal, rotate to be upper bidiagonal * by applying Givens rotations on the left * IF( IUPLO.EQ.2 ) THEN DO 10 I = 1, N - 1 CALL DLARTG( D( I ), E( I ), CS, SN, R ) D( I ) = R E( I ) = SN*D( I+1 ) D( I+1 ) = CS*D( I+1 ) IF( ROTATE ) THEN RWORK( I ) = CS RWORK( NM1+I ) = SN END IF 10 CONTINUE * * Update singular vectors if desired * IF( NRU.GT.0 ) $ CALL ZLASR( 'R', 'V', 'F', NRU, N, RWORK( 1 ), RWORK( N ), $ U, LDU ) IF( NCC.GT.0 ) $ CALL ZLASR( 'L', 'V', 'F', N, NCC, RWORK( 1 ), RWORK( N ), $ C, LDC ) END IF * * Compute approximate maximum, minimum singular values * SMAX = ABS( D( N ) ) DO 20 I = 1, N - 1 SMAX = MAX( SMAX, ABS( D( I ) ), ABS( E( I ) ) ) 20 CONTINUE SMINL = ZERO IF( TOL.GE.ZERO ) THEN SMINOA = ABS( D( 1 ) ) IF( SMINOA.EQ.ZERO ) $ GO TO 40 MU = SMINOA DO 30 I = 2, N MU = ABS( D( I ) )*( MU / ( MU+ABS( E( I-1 ) ) ) ) SMINOA = MIN( SMINOA, MU ) IF( SMINOA.EQ.ZERO ) $ GO TO 40 30 CONTINUE 40 CONTINUE SMINOA = SMINOA / SQRT( DBLE( N ) ) END IF * * Prepare for main iteration loop for the singular values * MAXIT = MAXITR*N*N ITER = 0 OLDLL = -1 OLDM = -1 IF( NCC.EQ.0 .AND. NRU.EQ.0 .AND. NCVT.EQ.0 ) THEN * * No singular vectors desired * JOB = 0 ELSE * * Singular vectors desired * JOB = 1 END IF IF( TOL.GE.ZERO ) THEN * * Relative accuracy desired * THRESH = MAX( TOL*SMINOA, MAXIT*UNFL ) ELSE * * Absolute accuracy desired * THRESH = MAX( ABS( TOL )*SMAX, MAXIT*UNFL ) END IF * * M points to last entry of unconverged part of matrix * M = N * * Begin main iteration loop * 50 CONTINUE * * Check for convergence or exceeding iteration count * IF( M.LE.1 ) $ GO TO 190 IF( ITER.GT.MAXIT ) $ GO TO 230 * * Find diagonal block of matrix to work on * IF( TOL.LT.ZERO .AND. ABS( D( M ) ).LE.THRESH ) $ D( M ) = ZERO SMAX = ABS( D( M ) ) SMIN = SMAX DO 60 LLL = 1, M LL = M - LLL IF( LL.EQ.0 ) $ GO TO 80 ABSS = ABS( D( LL ) ) ABSE = ABS( E( LL ) ) IF( TOL.LT.ZERO .AND. ABSS.LE.THRESH ) $ D( LL ) = ZERO IF( ABSE.LE.THRESH ) $ GO TO 70 SMIN = MIN( SMIN, ABSS ) SMAX = MAX( SMAX, ABSS, ABSE ) 60 CONTINUE 70 CONTINUE E( LL ) = ZERO * * Matrix splits since E(LL) = 0 * IF( LL.EQ.M-1 ) THEN * * Convergence of bottom singular value, return to top of loop * M = M - 1 GO TO 50 END IF 80 CONTINUE LL = LL + 1 * * E(LL) through E(M-1) are nonzero, E(LL-1) is zero * IF( LL.EQ.M-1 ) THEN * * 2 by 2 block, handle separately * CALL DLASV2( D( M-1 ), E( M-1 ), D( M ), SIGMN, SIGMX, SINR, $ COSR, SINL, COSL ) D( M-1 ) = SIGMX E( M-1 ) = ZERO D( M ) = SIGMN * * Compute singular vectors, if desired * IF( NCVT.GT.0 ) $ CALL ZDROT( NCVT, VT( M-1, 1 ), LDVT, VT( M, 1 ), LDVT, $ COSR, SINR ) IF( NRU.GT.0 ) $ CALL ZDROT( NRU, U( 1, M-1 ), 1, U( 1, M ), 1, COSL, SINL ) IF( NCC.GT.0 ) $ CALL ZDROT( NCC, C( M-1, 1 ), LDC, C( M, 1 ), LDC, COSL, $ SINL ) M = M - 2 GO TO 50 END IF * * If working on new submatrix, choose shift direction * (from larger end diagonal entry towards smaller) * IF( LL.GT.OLDM .OR. M.LT.OLDLL ) THEN IF( ABS( D( LL ) ).GE.ABS( D( M ) ) ) THEN * * Chase bulge from top (big end) to bottom (small end) * IDIR = 1 ELSE * * Chase bulge from bottom (big end) to top (small end) * IDIR = 2 END IF END IF * * Apply convergence tests * IF( IDIR.EQ.1 ) THEN * * Run convergence test in forward direction * First apply standard test to bottom of matrix * IF( ABS( E( M-1 ) ).LE.ABS( TOL )*ABS( D( M ) ) .OR. $ ( TOL.LT.ZERO .AND. ABS( E( M-1 ) ).LE.THRESH ) ) THEN E( M-1 ) = ZERO GO TO 50 END IF * IF( TOL.GE.ZERO ) THEN * * If relative accuracy desired, * apply convergence criterion forward * MU = ABS( D( LL ) ) SMINL = MU DO 90 LLL = LL, M - 1 IF( ABS( E( LLL ) ).LE.TOL*MU ) THEN E( LLL ) = ZERO GO TO 50 END IF SMINLO = SMINL MU = ABS( D( LLL+1 ) )*( MU / ( MU+ABS( E( LLL ) ) ) ) SMINL = MIN( SMINL, MU ) 90 CONTINUE * * If singular values only wanted, apply gap test to bottom * end of matrix * IF( JOB.EQ.0 ) THEN GAP = SMINLO / SQRT( DBLE( M-LL ) ) - ABS( D( M ) ) IF( GAP.GT.ZERO ) THEN ABSS = ABS( D( M ) ) ABSE = ABS( E( M-1 ) ) GMAX = MAX( GAP, ABSS, ABSE ) IF( ( ABSE / GMAX )**2.LE.TOL*( GAP / GMAX )* $ ( ABSS / GMAX ) ) THEN E( M-1 ) = ZERO GO TO 50 END IF END IF END IF END IF ELSE * * Run convergence test in backward direction * First apply standard test to top of matrix * IF( ABS( E( LL ) ).LE.ABS( TOL )*ABS( D( LL ) ) .OR. $ ( TOL.LT.ZERO .AND. ABS( E( LL ) ).LE.THRESH ) ) THEN E( LL ) = ZERO GO TO 50 END IF * IF( TOL.GE.ZERO ) THEN * * If relative accuracy desired, * apply convergence criterion backward * MU = ABS( D( M ) ) SMINL = MU DO 100 LLL = M - 1, LL, -1 IF( ABS( E( LLL ) ).LE.TOL*MU ) THEN E( LLL ) = ZERO GO TO 50 END IF SMINLO = SMINL MU = ABS( D( LLL ) )*( MU / ( MU+ABS( E( LLL ) ) ) ) SMINL = MIN( SMINL, MU ) 100 CONTINUE * * If singular values only wanted, apply gap test to top * end of matrix * IF( JOB.EQ.0 ) THEN GAP = SMINLO / SQRT( DBLE( M-LL ) ) - ABS( D( LL ) ) IF( GAP.GT.ZERO ) THEN ABSS = ABS( D( LL ) ) ABSE = ABS( E( LL ) ) GMAX = MAX( GAP, ABSS, ABSE ) IF( ( ABSE / GMAX )**2.LE.TOL*( GAP / GMAX )* $ ( ABSS / GMAX ) ) THEN E( LL ) = ZERO GO TO 50 END IF END IF END IF END IF END IF OLDLL = LL OLDM = M * * Compute shift. First, test if shifting would ruin relative * accuracy, and if so set the shift to zero. * IF( TOL.GE.ZERO .AND. N*TOL*( SMINL / SMAX ).LE. $ MAX( EPS, HNDRTH*TOL ) ) THEN * * Use a zero shift to avoid loss of relative accuracy * SHIFT = ZERO ELSE * * Compute the shift from 2-by-2 block at end of matrix * IF( IDIR.EQ.1 ) THEN SLL = ABS( D( LL ) ) CALL DLAS2( D( M-1 ), E( M-1 ), D( M ), SHIFT, R ) ELSE SLL = ABS( D( M ) ) CALL DLAS2( D( LL ), E( LL ), D( LL+1 ), SHIFT, R ) END IF * * Test if shift negligible, and if so set to zero * IF( SLL.GT.ZERO ) THEN IF( ( SHIFT / SLL )**2.LT.EPS ) $ SHIFT = ZERO END IF END IF * * Increment iteration count * ITER = ITER + M - LL * * If SHIFT = 0, do simplified QR iteration * IF( SHIFT.EQ.ZERO ) THEN IF( IDIR.EQ.1 ) THEN * * Chase bulge from top to bottom * CS = ONE OLDCS = ONE * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( D( LL )*CS, E( LL ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( LL+1 )*SN, OLDCS, OLDSN, $ D( LL ) ) RWORK( 1 ) = CS RWORK( 1+NM1 ) = SN RWORK( 1+NM12 ) = OLDCS RWORK( 1+NM13 ) = OLDSN IROT = 1 DO 110 I = LL + 1, M - 1 CALL DLARTG( D( I )*CS, E( I ), CS, SN, R ) E( I-1 ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I+1 )*SN, OLDCS, OLDSN, $ D( I ) ) IROT = IROT + 1 RWORK( IROT ) = CS RWORK( IROT+NM1 ) = SN RWORK( IROT+NM12 ) = OLDCS RWORK( IROT+NM13 ) = OLDSN 110 CONTINUE H = D( M )*CS D( M ) = H*OLDCS E( M-1 ) = H*OLDSN * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL ZLASR( 'L', 'V', 'F', M-LL+1, NCVT, RWORK( 1 ), $ RWORK( N ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL ZLASR( 'R', 'V', 'F', NRU, M-LL+1, $ RWORK( NM12+1 ), RWORK( NM13+1 ), $ U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL ZLASR( 'L', 'V', 'F', M-LL+1, NCC, $ RWORK( NM12+1 ), RWORK( NM13+1 ), $ C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( D( LL )*CS, E( LL ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( LL+1 )*SN, OLDCS, OLDSN, $ D( LL ) ) DO 120 I = LL + 1, M - 1 CALL DLARTG( D( I )*CS, E( I ), CS, SN, R ) E( I-1 ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I+1 )*SN, OLDCS, OLDSN, $ D( I ) ) 120 CONTINUE H = D( M )*CS D( M ) = H*OLDCS E( M-1 ) = H*OLDSN * END IF * * Test convergence * IF( ABS( E( M-1 ) ).LE.THRESH ) $ E( M-1 ) = ZERO * ELSE * * Chase bulge from bottom to top * CS = ONE OLDCS = ONE * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( D( M )*CS, E( M-1 ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( M-1 )*SN, OLDCS, OLDSN, D( M ) ) RWORK( M-LL ) = CS RWORK( M-LL+NM1 ) = -SN RWORK( M-LL+NM12 ) = OLDCS RWORK( M-LL+NM13 ) = -OLDSN IROT = M - LL DO 130 I = M - 1, LL + 1, -1 CALL DLARTG( D( I )*CS, E( I-1 ), CS, SN, R ) E( I ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I-1 )*SN, OLDCS, OLDSN, $ D( I ) ) IROT = IROT - 1 RWORK( IROT ) = CS RWORK( IROT+NM1 ) = -SN RWORK( IROT+NM12 ) = OLDCS RWORK( IROT+NM13 ) = -OLDSN 130 CONTINUE H = D( LL )*CS D( LL ) = H*OLDCS E( LL ) = H*OLDSN * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL ZLASR( 'L', 'V', 'B', M-LL+1, NCVT, $ RWORK( NM12+1 ), RWORK( NM13+1 ), $ VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL ZLASR( 'R', 'V', 'B', NRU, M-LL+1, RWORK( 1 ), $ RWORK( N ), U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL ZLASR( 'L', 'V', 'B', M-LL+1, NCC, RWORK( 1 ), $ RWORK( N ), C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( D( M )*CS, E( M-1 ), CS, SN, R ) CALL DLARTG( OLDCS*R, D( M-1 )*SN, OLDCS, OLDSN, D( M ) ) DO 140 I = M - 1, LL + 1, -1 CALL DLARTG( D( I )*CS, E( I-1 ), CS, SN, R ) E( I ) = OLDSN*R CALL DLARTG( OLDCS*R, D( I-1 )*SN, OLDCS, OLDSN, $ D( I ) ) 140 CONTINUE H = D( LL )*CS D( LL ) = H*OLDCS E( LL ) = H*OLDSN * END IF * * Test convergence * IF( ABS( E( LL ) ).LE.THRESH ) $ E( LL ) = ZERO END IF ELSE * * Use nonzero shift * IF( IDIR.EQ.1 ) THEN * * Chase bulge from top to bottom * F = ( ABS( D( LL ) )-SHIFT )* $ ( SIGN( ONE, D( LL ) )+SHIFT / D( LL ) ) G = E( LL ) * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( LL ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL ) G = SINR*D( LL+1 ) D( LL+1 ) = COSR*D( LL+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL ) = R F = COSL*E( LL ) + SINL*D( LL+1 ) D( LL+1 ) = COSL*D( LL+1 ) - SINL*E( LL ) G = SINL*E( LL+1 ) E( LL+1 ) = COSL*E( LL+1 ) RWORK( 1 ) = COSR RWORK( 1+NM1 ) = SINR RWORK( 1+NM12 ) = COSL RWORK( 1+NM13 ) = SINL IROT = 1 DO 150 I = LL + 1, M - 2 CALL DLARTG( F, G, COSR, SINR, R ) E( I-1 ) = R F = COSR*D( I ) + SINR*E( I ) E( I ) = COSR*E( I ) - SINR*D( I ) G = SINR*D( I+1 ) D( I+1 ) = COSR*D( I+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I ) + SINL*D( I+1 ) D( I+1 ) = COSL*D( I+1 ) - SINL*E( I ) G = SINL*E( I+1 ) E( I+1 ) = COSL*E( I+1 ) IROT = IROT + 1 RWORK( IROT ) = COSR RWORK( IROT+NM1 ) = SINR RWORK( IROT+NM12 ) = COSL RWORK( IROT+NM13 ) = SINL 150 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( M-2 ) = R F = COSR*D( M-1 ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M-1 ) G = SINR*D( M ) D( M ) = COSR*D( M ) CALL DLARTG( F, G, COSL, SINL, R ) D( M-1 ) = R F = COSL*E( M-1 ) + SINL*D( M ) D( M ) = COSL*D( M ) - SINL*E( M-1 ) IROT = IROT + 1 RWORK( IROT ) = COSR RWORK( IROT+NM1 ) = SINR RWORK( IROT+NM12 ) = COSL RWORK( IROT+NM13 ) = SINL E( M-1 ) = F * * Update singular vectors * IF( NCVT.GT.0 ) $ CALL ZLASR( 'L', 'V', 'F', M-LL+1, NCVT, RWORK( 1 ), $ RWORK( N ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL ZLASR( 'R', 'V', 'F', NRU, M-LL+1, $ RWORK( NM12+1 ), RWORK( NM13+1 ), $ U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL ZLASR( 'L', 'V', 'F', M-LL+1, NCC, $ RWORK( NM12+1 ), RWORK( NM13+1 ), $ C( LL, 1 ), LDC ) * ELSE * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( LL ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL ) G = SINR*D( LL+1 ) D( LL+1 ) = COSR*D( LL+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL ) = R F = COSL*E( LL ) + SINL*D( LL+1 ) D( LL+1 ) = COSL*D( LL+1 ) - SINL*E( LL ) G = SINL*E( LL+1 ) E( LL+1 ) = COSL*E( LL+1 ) DO 160 I = LL + 1, M - 2 CALL DLARTG( F, G, COSR, SINR, R ) E( I-1 ) = R F = COSR*D( I ) + SINR*E( I ) E( I ) = COSR*E( I ) - SINR*D( I ) G = SINR*D( I+1 ) D( I+1 ) = COSR*D( I+1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I ) + SINL*D( I+1 ) D( I+1 ) = COSL*D( I+1 ) - SINL*E( I ) G = SINL*E( I+1 ) E( I+1 ) = COSL*E( I+1 ) 160 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( M-2 ) = R F = COSR*D( M-1 ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M-1 ) G = SINR*D( M ) D( M ) = COSR*D( M ) CALL DLARTG( F, G, COSL, SINL, R ) D( M-1 ) = R F = COSL*E( M-1 ) + SINL*D( M ) D( M ) = COSL*D( M ) - SINL*E( M-1 ) E( M-1 ) = F * END IF * * Test convergence * IF( ABS( E( M-1 ) ).LE.THRESH ) $ E( M-1 ) = ZERO * ELSE * * Chase bulge from bottom to top * F = ( ABS( D( M ) )-SHIFT )*( SIGN( ONE, D( M ) )+SHIFT / $ D( M ) ) G = E( M-1 ) * * Save cosines and sines if singular vectors desired * IF( ROTATE ) THEN * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( M ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M ) G = SINR*D( M-1 ) D( M-1 ) = COSR*D( M-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( M ) = R F = COSL*E( M-1 ) + SINL*D( M-1 ) D( M-1 ) = COSL*D( M-1 ) - SINL*E( M-1 ) G = SINL*E( M-2 ) E( M-2 ) = COSL*E( M-2 ) RWORK( M-LL ) = COSR RWORK( M-LL+NM1 ) = -SINR RWORK( M-LL+NM12 ) = COSL RWORK( M-LL+NM13 ) = -SINL IROT = M - LL DO 170 I = M - 1, LL + 2, -1 CALL DLARTG( F, G, COSR, SINR, R ) E( I ) = R F = COSR*D( I ) + SINR*E( I-1 ) E( I-1 ) = COSR*E( I-1 ) - SINR*D( I ) G = SINR*D( I-1 ) D( I-1 ) = COSR*D( I-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I-1 ) + SINL*D( I-1 ) D( I-1 ) = COSL*D( I-1 ) - SINL*E( I-1 ) G = SINL*E( I-2 ) E( I-2 ) = COSL*E( I-2 ) IROT = IROT - 1 RWORK( IROT ) = COSR RWORK( IROT+NM1 ) = -SINR RWORK( IROT+NM12 ) = COSL RWORK( IROT+NM13 ) = -SINL 170 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( LL+1 ) = R F = COSR*D( LL+1 ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL+1 ) G = SINR*D( LL ) D( LL ) = COSR*D( LL ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL+1 ) = R F = COSL*E( LL ) + SINL*D( LL ) D( LL ) = COSL*D( LL ) - SINL*E( LL ) IROT = IROT - 1 RWORK( IROT ) = COSR RWORK( IROT+NM1 ) = -SINR RWORK( IROT+NM12 ) = COSL RWORK( IROT+NM13 ) = -SINL E( LL ) = F * ELSE * CALL DLARTG( F, G, COSR, SINR, R ) F = COSR*D( M ) + SINR*E( M-1 ) E( M-1 ) = COSR*E( M-1 ) - SINR*D( M ) G = SINR*D( M-1 ) D( M-1 ) = COSR*D( M-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( M ) = R F = COSL*E( M-1 ) + SINL*D( M-1 ) D( M-1 ) = COSL*D( M-1 ) - SINL*E( M-1 ) G = SINL*E( M-2 ) E( M-2 ) = COSL*E( M-2 ) DO 180 I = M - 1, LL + 2, -1 CALL DLARTG( F, G, COSR, SINR, R ) E( I ) = R F = COSR*D( I ) + SINR*E( I-1 ) E( I-1 ) = COSR*E( I-1 ) - SINR*D( I ) G = SINR*D( I-1 ) D( I-1 ) = COSR*D( I-1 ) CALL DLARTG( F, G, COSL, SINL, R ) D( I ) = R F = COSL*E( I-1 ) + SINL*D( I-1 ) D( I-1 ) = COSL*D( I-1 ) - SINL*E( I-1 ) G = SINL*E( I-2 ) E( I-2 ) = COSL*E( I-2 ) 180 CONTINUE CALL DLARTG( F, G, COSR, SINR, R ) E( LL+1 ) = R F = COSR*D( LL+1 ) + SINR*E( LL ) E( LL ) = COSR*E( LL ) - SINR*D( LL+1 ) G = SINR*D( LL ) D( LL ) = COSR*D( LL ) CALL DLARTG( F, G, COSL, SINL, R ) D( LL+1 ) = R F = COSL*E( LL ) + SINL*D( LL ) D( LL ) = COSL*D( LL ) - SINL*E( LL ) E( LL ) = F * END IF * * Test convergence * IF( ABS( E( LL ) ).LE.THRESH ) $ E( LL ) = ZERO * * Update singular vectors if desired * IF( NCVT.GT.0 ) $ CALL ZLASR( 'L', 'V', 'B', M-LL+1, NCVT, RWORK( NM12+1 ), $ RWORK( NM13+1 ), VT( LL, 1 ), LDVT ) IF( NRU.GT.0 ) $ CALL ZLASR( 'R', 'V', 'B', NRU, M-LL+1, RWORK( 1 ), $ RWORK( N ), U( 1, LL ), LDU ) IF( NCC.GT.0 ) $ CALL ZLASR( 'L', 'V', 'B', M-LL+1, NCC, RWORK( 1 ), $ RWORK( N ), C( LL, 1 ), LDC ) END IF END IF * * QR iteration finished, go back and check convergence * GO TO 50 * * All singular values converged, so make them positive * 190 CONTINUE DO 200 I = 1, N IF( D( I ).LT.ZERO ) THEN D( I ) = -D( I ) * * Change sign of singular vectors, if desired * IF( NCVT.GT.0 ) $ CALL ZDSCAL( NCVT, NEGONE, VT( I, 1 ), LDVT ) END IF 200 CONTINUE * * Sort the singular values into decreasing order (insertion sort on * singular values, but only one transposition per singular vector) * DO 220 I = 1, N - 1 * * Scan for smallest D(I) * ISUB = 1 SMIN = D( 1 ) DO 210 J = 2, N + 1 - I IF( D( J ).LE.SMIN ) THEN ISUB = J SMIN = D( J ) END IF 210 CONTINUE IF( ISUB.NE.N+1-I ) THEN * * Swap singular values and vectors * D( ISUB ) = D( N+1-I ) D( N+1-I ) = SMIN IF( NCVT.GT.0 ) $ CALL ZSWAP( NCVT, VT( ISUB, 1 ), LDVT, VT( N+1-I, 1 ), $ LDVT ) IF( NRU.GT.0 ) $ CALL ZSWAP( NRU, U( 1, ISUB ), 1, U( 1, N+1-I ), 1 ) IF( NCC.GT.0 ) $ CALL ZSWAP( NCC, C( ISUB, 1 ), LDC, C( N+1-I, 1 ), LDC ) END IF 220 CONTINUE GO TO 250 * * Maximum number of iterations exceeded, failure to converge * 230 CONTINUE INFO = 0 DO 240 I = 1, N - 1 IF( E( I ).NE.ZERO ) $ INFO = INFO + 1 240 CONTINUE 250 CONTINUE RETURN * * End of ZBDSQR * END octave-1.1.0/libcruft/lapack/zgeev.f100666 415 17 30577 5306544272 15536 0ustar jweusers SUBROUTINE ZGEEV( JOBVL, JOBVR, N, A, LDA, W, VL, LDVL, VR, LDVR, $ WORK, LWORK, RWORK, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER JOBVL, JOBVR INTEGER INFO, LDA, LDVL, LDVR, LWORK, N * .. * .. Array Arguments .. DOUBLE PRECISION RWORK( * ) COMPLEX*16 A( LDA, * ), VL( LDVL, * ), VR( LDVR, * ), $ W( * ), WORK( * ) * .. * * Purpose * ======= * * ZGEEV computes for an n-by-n complex nonsymmetric matrix A, the * eigenvalues and, optionally, the left and/or right eigenvectors. * * The left eigenvectors of A are the same as the right eigenvectors of * A**H. If u(j) and v(j) are the left and right eigenvectors, * respectively, corresponding to the eigenvalue lambda(j), then * (u(j)**H)*A = lambda(j)*(u(j)**H) and A*v(j) = lambda(j) * v(j). * * The computed eigenvectors are normalized to have Euclidean norm * equal to 1 and largest component real. * * Arguments * ========= * * JOBVL (input) CHARACTER*1 * = 'N': left eigenvectors of A are not computed; * = 'V': left eigenvectors of are computed. * * JOBVR (input) CHARACTER*1 * = 'N': right eigenvectors of A are not computed; * = 'V': right eigenvectors of A are computed. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the n-by-n matrix A. * On exit, A has been overwritten. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * W (output) COMPLEX*16 array, dimension (N) * W contains the computed eigenvalues. * * VL (output) COMPLEX*16 array, dimension (LDVL,N) * If JOBVL = 'V', the left eigenvectors u(j) are stored one * after another in the columns of VL, in the same order * as their eigenvalues. * If JOBVL = 'N', VL is not referenced. * u(j) = VL(:,j), the j-th column of VL. * * LDVL (input) INTEGER * The leading dimension of the array VL. LDVL >= 1, and if * JOBVL = 'V', LDVL >= N. * * VR (output) COMPLEX*16 array, dimension (LDVR,N) * If JOBVR = 'V', the right eigenvectors v(j) are stored one * after another in the columns of VR, in the same order * as their eigenvalues. * If JOBVR = 'N', VR is not referenced. * v(j) = VR(:,j), the j-th column of VR. * * LDVR (input) INTEGER * The leading dimension of the array VR. LDVR >= 1, and if * JOBVR = 'V', LDVR >= N. * * WORK (workspace/output) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) contains the optimal LWORK. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,2*N). * For good performance, LWORK must generally be larger. * * RWORK (workspace) DOUBLE PRECISION array, dimension (2*N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * > 0: if INFO = i, the QR algorithm failed to compute all the * eigenvalues, and no eigenvectors have been computed; * elements and i+1:N of W contain eigenvalues which have * converged. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL SCALEA, WANTVL, WANTVR CHARACTER SIDE INTEGER HSWORK, I, IBAL, IERR, IHI, ILO, IRWORK, ITAU, $ IWRK, K, MAXB, MAXWRK, MINWRK, NOUT DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, SCL, SMLNUM COMPLEX*16 TMP * .. * .. Local Arrays .. LOGICAL SELECT( 1 ) DOUBLE PRECISION DUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DLABAD, XERBLA, ZDSCAL, ZGEBAK, ZGEBAL, ZGEHRD, $ ZHSEQR, ZLACPY, ZLASCL, ZSCAL, ZTREVC, ZUNGHR * .. * .. External Functions .. LOGICAL LSAME INTEGER IDAMAX, ILAENV DOUBLE PRECISION DLAMCH, DZNRM2, ZLANGE EXTERNAL LSAME, IDAMAX, ILAENV, DLAMCH, DZNRM2, ZLANGE * .. * .. Intrinsic Functions .. INTRINSIC DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTVL = LSAME( JOBVL, 'V' ) WANTVR = LSAME( JOBVR, 'V' ) IF( ( .NOT.WANTVL ) .AND. ( .NOT.LSAME( JOBVL, 'N' ) ) ) THEN INFO = -1 ELSE IF( ( .NOT.WANTVR ) .AND. ( .NOT.LSAME( JOBVR, 'N' ) ) ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LDVL.LT.1 .OR. ( WANTVL .AND. LDVL.LT.N ) ) THEN INFO = -8 ELSE IF( LDVR.LT.1 .OR. ( WANTVR .AND. LDVR.LT.N ) ) THEN INFO = -10 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * CWorkspace refers to complex workspace, and RWorkspace to real * workspace. NB refers to the optimal block size for the * immediately following subroutine, as returned by ILAENV. * HSWORK refers to the workspace preferred by ZHSEQR, as * calculated below. HSWORK is computed assuming ILO=1 and IHI=N, * the worst case.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 ) IF( ( .NOT.WANTVL ) .AND. ( .NOT.WANTVR ) ) THEN MINWRK = MAX( 1, 2*N ) MAXB = MAX( ILAENV( 8, 'ZHSEQR', 'EN', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'ZHSEQR', 'EN', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, HSWORK ) ELSE MINWRK = MAX( 1, 2*N ) MAXWRK = MAX( MAXWRK, N+( N-1 )* $ ILAENV( 1, 'ZUNGHR', ' ', N, 1, N, -1 ) ) MAXB = MAX( ILAENV( 8, 'ZHSEQR', 'SV', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'ZHSEQR', 'SV', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, HSWORK, 2*N ) END IF WORK( 1 ) = MAXWRK END IF IF( LWORK.LT.MINWRK ) THEN INFO = -12 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEEV ', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SQRT( SMLNUM ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = ZLANGE( 'M', N, N, A, LDA, DUM ) SCALEA = .FALSE. IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN SCALEA = .TRUE. CSCALE = SMLNUM ELSE IF( ANRM.GT.BIGNUM ) THEN SCALEA = .TRUE. CSCALE = BIGNUM END IF IF( SCALEA ) $ CALL ZLASCL( 'G', 0, 0, ANRM, CSCALE, N, N, A, LDA, IERR ) * * Balance the matrix * (CWorkspace: none) * (RWorkspace: need N) * IBAL = 1 CALL ZGEBAL( 'B', N, A, LDA, ILO, IHI, RWORK( IBAL ), IERR ) * * Reduce to upper Hessenberg form * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: none) * ITAU = 1 IWRK = ITAU + N CALL ZGEHRD( N, ILO, IHI, A, LDA, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * IF( WANTVL ) THEN * * Want left eigenvectors * Copy Householder vectors to VL * SIDE = 'L' CALL ZLACPY( 'L', N, N, A, LDA, VL, LDVL ) * * Generate unitary matrix in VL * (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) * (RWorkspace: none) * CALL ZUNGHR( N, ILO, IHI, VL, LDVL, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * * Perform QR iteration, accumulating Schur vectors in VL * (CWorkspace: need 1, prefer HSWORK (see comments) ) * (RWorkspace: none) * IWRK = ITAU CALL ZHSEQR( 'S', 'V', N, ILO, IHI, A, LDA, W, VL, LDVL, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) * IF( WANTVR ) THEN * * Want left and right eigenvectors * Copy Schur vectors to VR * SIDE = 'B' CALL ZLACPY( 'F', N, N, VL, LDVL, VR, LDVR ) END IF * ELSE IF( WANTVR ) THEN * * Want right eigenvectors * Copy Householder vectors to VR * SIDE = 'R' CALL ZLACPY( 'L', N, N, A, LDA, VR, LDVR ) * * Generate unitary matrix in VR * (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) * (RWorkspace: none) * CALL ZUNGHR( N, ILO, IHI, VR, LDVR, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * * Perform QR iteration, accumulating Schur vectors in VR * (CWorkspace: need 1, prefer HSWORK (see comments) ) * (RWorkspace: none) * IWRK = ITAU CALL ZHSEQR( 'S', 'V', N, ILO, IHI, A, LDA, W, VR, LDVR, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) * ELSE * * Compute eigenvalues only * (CWorkspace: need 1, prefer HSWORK (see comments) ) * (RWorkspace: none) * IWRK = ITAU CALL ZHSEQR( 'E', 'N', N, ILO, IHI, A, LDA, W, VR, LDVR, $ WORK( IWRK ), LWORK-IWRK+1, INFO ) END IF * * If INFO > 0 from ZHSEQR, then quit * IF( INFO.GT.0 ) $ GO TO 50 * IF( WANTVL .OR. WANTVR ) THEN * * Compute left and/or right eigenvectors * (CWorkspace: need 2*N) * (RWorkspace: need 2*N) * IRWORK = IBAL + N CALL ZTREVC( SIDE, 'O', SELECT, N, A, LDA, VL, LDVL, VR, LDVR, $ N, NOUT, WORK( IWRK ), RWORK( IRWORK ), IERR ) END IF * IF( WANTVL ) THEN * * Undo balancing of left eigenvectors * (CWorkspace: none) * (RWorkspace: need N) * CALL ZGEBAK( 'B', 'L', N, ILO, IHI, RWORK( IBAL ), N, VL, LDVL, $ IERR ) * * Normalize left eigenvectors and make largest component real * DO 20 I = 1, N SCL = ONE / DZNRM2( N, VL( 1, I ), 1 ) CALL ZDSCAL( N, SCL, VL( 1, I ), 1 ) DO 10 K = 1, N RWORK( IRWORK+K-1 ) = DBLE( VL( K, I ) )**2 + $ DIMAG( VL( K, I ) )**2 10 CONTINUE K = IDAMAX( N, RWORK( IRWORK ), 1 ) TMP = DCONJG( VL( K, I ) ) / SQRT( RWORK( IRWORK+K-1 ) ) CALL ZSCAL( N, TMP, VL( 1, I ), 1 ) VL( K, I ) = DCMPLX( DBLE( VL( K, I ) ), ZERO ) 20 CONTINUE END IF * IF( WANTVR ) THEN * * Undo balancing of right eigenvectors * (CWorkspace: none) * (RWorkspace: need N) * CALL ZGEBAK( 'B', 'R', N, ILO, IHI, RWORK( IBAL ), N, VR, LDVR, $ IERR ) * * Normalize right eigenvectors and make largest component real * DO 40 I = 1, N SCL = ONE / DZNRM2( N, VR( 1, I ), 1 ) CALL ZDSCAL( N, SCL, VR( 1, I ), 1 ) DO 30 K = 1, N RWORK( IRWORK+K-1 ) = DBLE( VR( K, I ) )**2 + $ DIMAG( VR( K, I ) )**2 30 CONTINUE K = IDAMAX( N, RWORK( IRWORK ), 1 ) TMP = DCONJG( VR( K, I ) ) / SQRT( RWORK( IRWORK+K-1 ) ) CALL ZSCAL( N, TMP, VR( 1, I ), 1 ) VR( K, I ) = DCMPLX( DBLE( VR( K, I ) ), ZERO ) 40 CONTINUE END IF * * Undo scaling if necessary * 50 CONTINUE IF( SCALEA ) THEN CALL ZLASCL( 'G', 0, 0, CSCALE, ANRM, N-INFO, 1, W( INFO+1 ), $ MAX( N-INFO, 1 ), IERR ) IF( INFO.GT.0 ) THEN CALL ZLASCL( 'G', 0, 0, CSCALE, ANRM, ILO-1, 1, W, N, IERR ) END IF END IF * WORK( 1 ) = MAXWRK RETURN * * End of ZGEEV * END octave-1.1.0/libcruft/lapack/zdrscl.f100666 415 17 5532 5406741170 15665 0ustar jweusers SUBROUTINE ZDRSCL( N, SA, SX, INCX ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INCX, N DOUBLE PRECISION SA * .. * .. Array Arguments .. COMPLEX*16 SX( * ) * .. * * Purpose * ======= * * ZDRSCL multiplies an n-element complex vector x by the real scalar * 1/a. This is done without overflow or underflow as long as * the final result x/a does not overflow or underflow. * * Arguments * ========= * * N (input) INTEGER * The number of components of the vector x. * * SA (input) DOUBLE PRECISION * The scalar a which is used to divide each component of x. * SA must be >= 0, or the subroutine will divide by zero. * * SX (input/output) COMPLEX*16 array, dimension * (1+(N-1)*abs(INCX)) * The n-element vector x. * * INCX (input) INTEGER * The increment between successive values of the vector SX. * > 0: SX(1) = X(1) and SX(1+(i-1)*INCX) = x(i), 1< i<= n * < 0: SX(1) = X(n) and SX(1+(i-1)*INCX) = x(n-i+1), 1< i<= n * * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL DONE DOUBLE PRECISION BIGNUM, CDEN, CDEN1, CNUM, CNUM1, MUL, SMLNUM * .. * .. External Functions .. DOUBLE PRECISION DLAMCH EXTERNAL DLAMCH * .. * .. External Subroutines .. EXTERNAL DLABAD, ZDSCAL * .. * .. Intrinsic Functions .. INTRINSIC ABS * .. * .. Executable Statements .. * * Quick return if possible * IF( N.LE.0 ) $ RETURN * * Get machine parameters * SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) * * Initialize the denominator to SA and the numerator to 1. * CDEN = SA CNUM = ONE * 10 CONTINUE CDEN1 = CDEN*SMLNUM CNUM1 = CNUM / BIGNUM IF( ABS( CDEN1 ).GT.ABS( CNUM ) .AND. CNUM.NE.ZERO ) THEN * * Pre-multiply X by SMLNUM if CDEN is large compared to CNUM. * MUL = SMLNUM DONE = .FALSE. CDEN = CDEN1 ELSE IF( ABS( CNUM1 ).GT.ABS( CDEN ) ) THEN * * Pre-multiply X by BIGNUM if CDEN is small compared to CNUM. * MUL = BIGNUM DONE = .FALSE. CNUM = CNUM1 ELSE * * Multiply X by CNUM / CDEN and return. * MUL = CNUM / CDEN DONE = .TRUE. END IF * * Scale the vector X by MUL * CALL ZDSCAL( N, MUL, SX, INCX ) * IF( .NOT.DONE ) $ GO TO 10 * RETURN * * End of ZDRSCL * END octave-1.1.0/libcruft/lapack/zgebak.f100666 415 17 12730 5306544273 15651 0ustar jweusers SUBROUTINE ZGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV, $ INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER JOB, SIDE INTEGER IHI, ILO, INFO, LDV, M, N * .. * .. Array Arguments .. DOUBLE PRECISION SCALE( * ) COMPLEX*16 V( LDV, * ) * .. * * Purpose * ======= * * ZGEBAK forms the right or left eigenvectors of a complex general * matrix by backward transformation on the computed eigenvectors of the * matrix preprocessed by ZGEBAL. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies the type of backward transformation required: * = 'N', do nothing, return immediately. * = 'P', do backward transformation for permutation. * = 'S', do backward transformation for balancing. * = 'B', do backward transformations for both permutation and * balancing. * JOB must be the same as the JOB parameter in ZGEBAL. * * SIDE (input) CHARACTER*1 * Specifies whether the eigenvectors given in the array V * are right eigenvectors or left eigenvectors. * = 'R', right eigenvectors * = 'L', left eigenvectors * * N (input) INTEGER * The number of rows of the matrix V. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * ILO and IHI are integers determined by ZGEBAL. * * SCALE (input) DOUBLE PRECISION array, dimension (N) * SCALE contains information determining the permutations * and/or scaling factors used by ZGEBAL. * * M (input) INTEGER * M is the number of columns of the matrix of eigenvectors V to * be back transformed. * * V (input/output) COMPLEX*16 array, dimension (LDV,M) * On entry, V contains the real and imaginary parts of the * eigenvectors to be backward transformed in its first M * columns. * On exit, V contains the real and imaginary parts of the * transformed eigenvectors in its first M columns. * * LDV (input) INTEGER * The leading dimension of the matrix V. LDV >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -k, the k-th argument had an illegal value. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFTV, RIGHTV INTEGER I, II, K DOUBLE PRECISION S * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZDSCAL, ZSWAP * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Decode and Test the input parameters * RIGHTV = LSAME( SIDE, 'R' ) LEFTV = LSAME( SIDE, 'L' ) * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND. $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN INFO = -1 ELSE IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -5 ELSE IF( M.LT.0 ) THEN INFO = -7 ELSE IF( LDV.LT.MAX( 1, N ) ) THEN INFO = -9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEBAK', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN IF( M.EQ.0 ) $ RETURN IF( LSAME( JOB, 'N' ) ) $ RETURN * IF( ILO.EQ.IHI ) $ GO TO 30 * * Backward balance * IF( LSAME( JOB, 'S' ) .OR. LSAME( JOB, 'B' ) ) THEN * IF( RIGHTV ) THEN DO 10 I = ILO, IHI S = SCALE( I ) CALL ZDSCAL( M, S, V( I, 1 ), LDV ) 10 CONTINUE END IF * IF( LEFTV ) THEN DO 20 I = ILO, IHI S = ONE / SCALE( I ) CALL ZDSCAL( M, S, V( I, 1 ), LDV ) 20 CONTINUE END IF * END IF * * Backward permutation * * For I = ILO-1 step -1 until 1, * IHI+1 step 1 until N do -- * 30 CONTINUE IF( LSAME( JOB, 'P' ) .OR. LSAME( JOB, 'B' ) ) THEN IF( RIGHTV ) THEN DO 40 II = 1, N I = II IF( I.GE.ILO .AND. I.LE.IHI ) $ GO TO 40 IF( I.LT.ILO ) $ I = ILO - II K = SCALE( I ) IF( K.EQ.I ) $ GO TO 40 CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) 40 CONTINUE END IF * IF( LEFTV ) THEN DO 50 II = 1, N I = II IF( I.GE.ILO .AND. I.LE.IHI ) $ GO TO 50 IF( I.LT.ILO ) $ I = ILO - II K = SCALE( I ) IF( K.EQ.I ) $ GO TO 50 CALL ZSWAP( M, V( I, 1 ), LDV, V( K, 1 ), LDV ) 50 CONTINUE END IF END IF * RETURN * * End of ZGEBAK * END octave-1.1.0/libcruft/lapack/zgebal.f100666 415 17 17073 5306544276 15662 0ustar jweusers SUBROUTINE ZGEBAL( JOB, N, A, LDA, ILO, IHI, SCALE, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER JOB INTEGER IHI, ILO, INFO, LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION SCALE( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZGEBAL does permutations to isolate eigenvalues and/or balances a * complex general matrix. Balancing may reduce the 1-norm of the * matrix and can improve the accuracy of the computed eigenvalues * and/or eigenvectors. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies the operations to be done: * = 'N', do nothing with the input matrix, but set * ILO = 1, IHI = N, SCALE(I) = ONE. * = 'P', only permute to isolate eigenvalues. * = 'S', only balance the input matrix. * = 'B', both permute and balance. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, A contains the input matrix to be balanced. * On exit, A contains the permuted and/or balanced matrix. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the matrix A. LDA >= max(1,N). * * ILO (output) INTEGER * IHI (output) INTEGER * On exit, ILO and IHI are two integers such that A(I,J) * is equal to zero if * (1) I is greater than J and * (2) J = 1,...,ILO-1 or I = IHI+1,...,N. * * SCALE (output) DOUBLE PRECISION array, dimension (N) * On exit, SCALE contains information about the permutations * and scaling factors used. If P(J) is the index of the * row and column interchanged with row and column J and D(J,J) * is the scaling factor used to balance row and column J of the * submatrix of A, then * SCALE(J) = P(J), for J = 1,...,ILO-1 * = D(J,J), J = ILO,...,IHI * = P(J) J = IHI+1,...,N. * The order in which the interchanges are made is N to IHI+1, * then 1 to ILO-1. * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -k, the k-th argument had an illegal value. * * Further Details * =============== * * The permutations consist of row and column interchanges which put * the matrix in the form * * ( T1 X Y ) * P A P = ( 0 B Z ) * ( 0 0 T2 ) * * where T1 and T2 are upper triangular matrices whose eigenvalues lie * along the diagonal. The column indices ILO and IHI mark the starting * and ending columns of the submatrix B. Balancing consists of applying * a diagonal similarity transformation inv(D) * B * D to make the * 1-norms of each row of B and its corresponding column nearly equal. * The output matrix is * * ( T1 X*D Y ) * ( 0 inv(D)*B*D inv(D)*Z ). * ( 0 0 T2 ) * * Information about the permutations P and the diagonal matrix D is * returned in the vector SCALE. * * This subroutine is based on the EISPACK routine CBAL. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION SCLFAC, B2 PARAMETER ( SCLFAC = 1.0D+1, B2 = SCLFAC*SCLFAC ) DOUBLE PRECISION FACTOR PARAMETER ( FACTOR = 0.95D+0 ) * .. * .. Local Scalars .. LOGICAL NOCONV INTEGER I, IEXC, J, K, L, M DOUBLE PRECISION C, F, G, R, S COMPLEX*16 CDUM * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZDSCAL, ZSWAP * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DIMAG, MAX * .. * .. Statement Functions .. DOUBLE PRECISION CABS1 * .. * .. Statement Function definitions .. CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) ) * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.LSAME( JOB, 'P' ) .AND. $ .NOT.LSAME( JOB, 'S' ) .AND. .NOT.LSAME( JOB, 'B' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEBAL', -INFO ) RETURN END IF * K = 1 L = N * IF( N.EQ.0 ) $ GO TO 210 * IF( LSAME( JOB, 'N' ) ) THEN DO 10 I = 1, N SCALE( I ) = ONE 10 CONTINUE GO TO 210 END IF * IF( LSAME( JOB, 'S' ) ) $ GO TO 120 * * Permutation to isolate eigenvalues if possible * GO TO 50 * * Row and column exchange. * 20 CONTINUE SCALE( M ) = J IF( J.EQ.M ) $ GO TO 30 * CALL ZSWAP( L, A( 1, J ), 1, A( 1, M ), 1 ) CALL ZSWAP( N-K+1, A( J, K ), LDA, A( M, K ), LDA ) * 30 CONTINUE GO TO ( 40, 80 )IEXC * * Search for rows isolating an eigenvalue and push them down. * 40 CONTINUE IF( L.EQ.1 ) $ GO TO 210 L = L - 1 * 50 CONTINUE DO 70 J = L, 1, -1 * DO 60 I = 1, L IF( I.EQ.J ) $ GO TO 60 IF( DBLE( A( J, I ) ).NE.ZERO .OR. DIMAG( A( J, I ) ).NE. $ ZERO )GO TO 70 60 CONTINUE * M = L IEXC = 1 GO TO 20 70 CONTINUE * GO TO 90 * * Search for columns isolating an eigenvalue and push them left. * 80 CONTINUE K = K + 1 * 90 CONTINUE DO 110 J = K, L * DO 100 I = K, L IF( I.EQ.J ) $ GO TO 100 IF( DBLE( A( I, J ) ).NE.ZERO .OR. DIMAG( A( I, J ) ).NE. $ ZERO )GO TO 110 100 CONTINUE * M = K IEXC = 2 GO TO 20 110 CONTINUE * 120 CONTINUE DO 130 I = K, L SCALE( I ) = ONE 130 CONTINUE * IF( LSAME( JOB, 'P' ) ) $ GO TO 210 * * Balance the submatrix in rows K to L. * * Iterative loop for norm reduction * 140 CONTINUE NOCONV = .FALSE. * DO 200 I = K, L C = ZERO R = ZERO * DO 150 J = K, L IF( J.EQ.I ) $ GO TO 150 C = C + CABS1( A( J, I ) ) R = R + CABS1( A( I, J ) ) 150 CONTINUE * * Guard against zero C or R due to underflow. * IF( C.EQ.ZERO .OR. R.EQ.ZERO ) $ GO TO 200 G = R / SCLFAC F = ONE S = C + R 160 CONTINUE IF( C.GE.G ) $ GO TO 170 F = F*SCLFAC C = C*B2 GO TO 160 * 170 CONTINUE G = R*SCLFAC 180 CONTINUE IF( C.LT.G ) $ GO TO 190 F = F / SCLFAC C = C / B2 GO TO 180 * * Now balance. * 190 CONTINUE IF( ( C+R ) / F.GE.FACTOR*S ) $ GO TO 200 G = ONE / F SCALE( I ) = SCALE( I )*F NOCONV = .TRUE. * CALL ZDSCAL( N-K+1, G, A( I, K ), LDA ) CALL ZDSCAL( L, F, A( 1, I ), 1 ) * 200 CONTINUE * IF( NOCONV ) $ GO TO 140 * 210 CONTINUE ILO = K IHI = L * RETURN * * End of ZGEBAL * END octave-1.1.0/libcruft/lapack/zgebd2.f100666 415 17 20237 5306544302 15555 0ustar jweusers SUBROUTINE ZGEBD2( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION D( * ), E( * ) COMPLEX*16 A( LDA, * ), TAUP( * ), TAUQ( * ), WORK( * ) * .. * * Purpose * ======= * * ZGEBD2 reduces a complex general m by n matrix A to upper or lower * real bidiagonal form B by a unitary transformation: Q' * A * P = B. * * If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. M >= 0. * * N (input) INTEGER * The number of columns in the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, * if m >= n, the diagonal and the first superdiagonal are * overwritten with the upper bidiagonal matrix B; the * elements below the diagonal, with the array TAUQ, represent * the unitary matrix Q as a product of elementary * reflectors, and the elements above the first superdiagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors; * if m < n, the diagonal and the first subdiagonal are * overwritten with the lower bidiagonal matrix B; the * elements below the first subdiagonal, with the array TAUQ, * represent the unitary matrix Q as a product of * elementary reflectors, and the elements above the diagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (min(M,N)) * The diagonal elements of the bidiagonal matrix B: * D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (min(M,N)-1) * The off-diagonal elements of the bidiagonal matrix B: * if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; * if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. * * TAUQ (output) COMPLEX*16 array dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix Q. See Further Details. * * TAUP (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix P. See Further Details. * * WORK (workspace) COMPLEX*16 array, dimension (max(M,N)) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * If m >= n, * * Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors; v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in * A(i+1:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in * A(i,i+2:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, * * Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, v and u are complex vectors; * v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in A(i+2:m,i); * u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in A(i,i+1:n); * tauq is stored in TAUQ(i) and taup in TAUP(i). * * The contents of A on exit are illustrated by the following examples: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) * ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) * ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) * ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) * ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) * ( v1 v2 v3 v4 v5 ) * * where d and e denote diagonal and off-diagonal elements of B, vi * denotes an element of the vector defining H(i), and ui an element of * the vector defining G(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I COMPLEX*16 ALPHA * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLACGV, ZLARF, ZLARFG * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.LT.0 ) THEN CALL XERBLA( 'ZGEBD2', -INFO ) RETURN END IF * IF( M.GE.N ) THEN * * Reduce to upper bidiagonal form * DO 10 I = 1, N * * Generate elementary reflector H(i) to annihilate A(i+1:m,i) * ALPHA = A( I, I ) CALL ZLARFG( M-I+1, ALPHA, A( MIN( I+1, M ), I ), 1, $ TAUQ( I ) ) D( I ) = ALPHA A( I, I ) = ONE * * Apply H(i)' to A(i:m,i+1:n) from the left * CALL ZLARF( 'Left', M-I+1, N-I, A( I, I ), 1, $ DCONJG( TAUQ( I ) ), A( I, I+1 ), LDA, WORK ) A( I, I ) = D( I ) * IF( I.LT.N ) THEN * * Generate elementary reflector G(i) to annihilate * A(i,i+2:n) * CALL ZLACGV( N-I, A( I, I+1 ), LDA ) ALPHA = A( I, I+1 ) CALL ZLARFG( N-I, ALPHA, A( I, MIN( I+2, N ) ), LDA, $ TAUP( I ) ) E( I ) = ALPHA A( I, I+1 ) = ONE * * Apply G(i) to A(i+1:m,i+1:n) from the right * CALL ZLARF( 'Right', M-I, N-I, A( I, I+1 ), LDA, $ TAUP( I ), A( I+1, I+1 ), LDA, WORK ) CALL ZLACGV( N-I, A( I, I+1 ), LDA ) A( I, I+1 ) = E( I ) ELSE TAUP( I ) = ZERO END IF 10 CONTINUE ELSE * * Reduce to lower bidiagonal form * DO 20 I = 1, M * * Generate elementary reflector G(i) to annihilate A(i,i+1:n) * CALL ZLACGV( N-I+1, A( I, I ), LDA ) ALPHA = A( I, I ) CALL ZLARFG( N-I+1, ALPHA, A( I, MIN( I+1, N ) ), LDA, $ TAUP( I ) ) D( I ) = ALPHA A( I, I ) = ONE * * Apply G(i) to A(i+1:m,i:n) from the right * CALL ZLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, TAUP( I ), $ A( MIN( I+1, M ), I ), LDA, WORK ) CALL ZLACGV( N-I+1, A( I, I ), LDA ) A( I, I ) = D( I ) * IF( I.LT.M ) THEN * * Generate elementary reflector H(i) to annihilate * A(i+2:m,i) * ALPHA = A( I+1, I ) CALL ZLARFG( M-I, ALPHA, A( MIN( I+2, M ), I ), 1, $ TAUQ( I ) ) E( I ) = ALPHA A( I+1, I ) = ONE * * Apply H(i)' to A(i+1:m,i+1:n) from the left * CALL ZLARF( 'Left', M-I, N-I, A( I+1, I ), 1, $ DCONJG( TAUQ( I ) ), A( I+1, I+1 ), LDA, $ WORK ) A( I+1, I ) = E( I ) ELSE TAUQ( I ) = ZERO END IF 20 CONTINUE END IF RETURN * * End of ZGEBD2 * END octave-1.1.0/libcruft/lapack/zgebrd.f100666 415 17 21244 5306544302 15654 0ustar jweusers SUBROUTINE ZGEBRD( M, N, A, LDA, D, E, TAUQ, TAUP, WORK, LWORK, $ INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION D( * ), E( * ) COMPLEX*16 A( LDA, * ), TAUP( * ), TAUQ( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * ZGEBRD reduces a complex general m by n matrix A to upper or lower * real bidiagonal form B by a unitary transformation: Q' * A * P = B. * * If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. M >= 0. * * N (input) INTEGER * The number of columns in the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, * if m >= n, the diagonal and the first superdiagonal are * overwritten with the upper bidiagonal matrix B; the * elements below the diagonal, with the array TAUQ, represent * the unitary matrix Q as a product of elementary * reflectors, and the elements above the first superdiagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors; * if m < n, the diagonal and the first subdiagonal are * overwritten with the lower bidiagonal matrix B; the * elements below the first subdiagonal, with the array TAUQ, * represent the unitary matrix Q as a product of * elementary reflectors, and the elements above the diagonal, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (min(M,N)) * The diagonal elements of the bidiagonal matrix B: * D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (min(M,N)-1) * The off-diagonal elements of the bidiagonal matrix B: * if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; * if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. * * TAUQ (output) COMPLEX*16 array dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix Q. See Further Details. * * TAUP (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors which * represent the unitary matrix P. See Further Details. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The length of the array WORK. LWORK >= max(1,M,N). * For optimum performance LWORK should be at least (M+N)*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit. * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * If m >= n, * * Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors; v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in * A(i+1:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in * A(i,i+2:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, * * Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors; v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in * A(i+2:m,i); u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * The contents of A on exit are illustrated by the following examples: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) * ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) * ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) * ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) * ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) * ( v1 v2 v3 v4 v5 ) * * where d and e denote diagonal and off-diagonal elements of B, vi * denotes an element of the vector defining H(i), and ui an element of * the vector defining G(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, LDWRKX, LDWRKY, MINMN, NB, NBMIN, $ NX DOUBLE PRECISION WS * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEBD2, ZGEMM, ZLABRD * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, M, N ) ) THEN INFO = -10 END IF IF( INFO.LT.0 ) THEN CALL XERBLA( 'ZGEBRD', -INFO ) RETURN END IF * * Quick return if possible * MINMN = MIN( M, N ) IF( MINMN.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * WS = MAX( M, N ) LDWRKX = M LDWRKY = N * * Set the block size NB and the crossover point NX. * NB = MAX( 1, ILAENV( 1, 'ZGEBRD', ' ', M, N, -1, -1 ) ) * IF( NB.GT.1 .AND. NB.LT.MINMN ) THEN * * Determine when to switch from blocked to unblocked code. * NX = MAX( NB, ILAENV( 3, 'ZGEBRD', ' ', M, N, -1, -1 ) ) IF( NX.LT.MINMN ) THEN WS = ( M+N )*NB IF( LWORK.LT.WS ) THEN * * Not enough work space for the optimal NB, consider using * a smaller block size. * NBMIN = ILAENV( 2, 'ZGEBRD', ' ', M, N, -1, -1 ) IF( LWORK.GE.( M+N )*NBMIN ) THEN NB = LWORK / ( M+N ) ELSE NB = 1 NX = MINMN END IF END IF END IF ELSE NX = MINMN END IF * DO 30 I = 1, MINMN - NX, NB * * Reduce rows and columns i:i+ib-1 to bidiagonal form and return * the matrices X and Y which are needed to update the unreduced * part of the matrix * CALL ZLABRD( M-I+1, N-I+1, NB, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, LDWRKX, $ WORK( LDWRKX*NB+1 ), LDWRKY ) * * Update the trailing submatrix A(i+ib:m,i+ib:n), using * an update of the form A := A - V*Y' - X*U' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', M-I-NB+1, $ N-I-NB+1, NB, -ONE, A( I+NB, I ), LDA, $ WORK( LDWRKX*NB+NB+1 ), LDWRKY, ONE, $ A( I+NB, I+NB ), LDA ) CALL ZGEMM( 'No transpose', 'No transpose', M-I-NB+1, N-I-NB+1, $ NB, -ONE, WORK( NB+1 ), LDWRKX, A( I, I+NB ), LDA, $ ONE, A( I+NB, I+NB ), LDA ) * * Copy diagonal and off-diagonal elements of B back into A * IF( M.GE.N ) THEN DO 10 J = I, I + NB - 1 A( J, J ) = D( J ) A( J, J+1 ) = E( J ) 10 CONTINUE ELSE DO 20 J = I, I + NB - 1 A( J, J ) = D( J ) A( J+1, J ) = E( J ) 20 CONTINUE END IF 30 CONTINUE * * Use unblocked code to reduce the remainder of the matrix * CALL ZGEBD2( M-I+1, N-I+1, A( I, I ), LDA, D( I ), E( I ), $ TAUQ( I ), TAUP( I ), WORK, IINFO ) WORK( 1 ) = WS RETURN * * End of ZGEBRD * END octave-1.1.0/libcruft/lapack/zgeesx.f100666 415 17 31727 5412143655 15717 0ustar jweusers SUBROUTINE ZGEESX( JOBVS, SORT, SELECT, SENSE, N, A, LDA, SDIM, W, $ VS, LDVS, RCONDE, RCONDV, WORK, LWORK, RWORK, $ BWORK, INFO ) * * -- LAPACK driver routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER JOBVS, SENSE, SORT INTEGER INFO, LDA, LDVS, LWORK, N, SDIM DOUBLE PRECISION RCONDE, RCONDV * .. * .. Array Arguments .. LOGICAL BWORK( * ) DOUBLE PRECISION RWORK( * ) COMPLEX*16 A( LDA, * ), VS( LDVS, * ), W( * ), WORK( * ) * .. * .. Function Arguments .. LOGICAL SELECT EXTERNAL SELECT * .. * * Purpose * ======= * * ZGEESX computes for an N-by-N complex nonsymmetric matrix A, the * eigenvalues, the Schur form T, and, optionally, the matrix of Schur * vectors Z. This gives the Schur factorization A = Z*T*(Z**H). * * Optionally, it also orders the eigenvalues on the diagonal of the * Schur form so that selected eigenvalues are at the top left; * computes a reciprocal condition number for the average of the * selected eigenvalues (RCONDE); and computes a reciprocal condition * number for the right invariant subspace corresponding to the * selected eigenvalues (RCONDV). The leading columns of Z form an * orthonormal basis for this invariant subspace. * * For further explanation of the reciprocal condition numbers RCONDE * and RCONDV, see Section 4.10 of the LAPACK Users' Guide (where * these quantities are called s and sep respectively). * * A complex matrix is in Schur form if it is upper triangular. * * Arguments * ========= * * JOBVS (input) CHARACTER*1 * = 'N': Schur vectors are not computed; * = 'V': Schur vectors are computed. * * SORT (input) CHARACTER*1 * Specifies whether or not to order the eigenvalues on the * diagonal of the Schur form. * = 'N': Eigenvalues are not ordered; * = 'S': Eigenvalues are ordered (see SELECT). * * SELECT (input) LOGICAL FUNCTION of one COMPLEX*16 variable * SELECT must be declared EXTERNAL in the calling subroutine. * If SORT = 'S', SELECT is used to select eigenvalues to order * to the top left of the Schur form. * If SORT = 'N', SELECT is not referenced. * An eigenvalue W(j) is selected if SELECT(W(j)) is true. * * SENSE (input) CHARACTER*1 * Determines which reciprocal condition numbers are computed. * = 'N': None are computed; * = 'E': Computed for average of selected eigenvalues only; * = 'V': Computed for selected right invariant subspace only; * = 'B': Computed for both. * If SENSE = 'E', 'V' or 'B', SORT must equal 'S'. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA, N) * On entry, the N-by-N matrix A. * On exit, A is overwritten by its Schur form T. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * SDIM (output) INTEGER * If SORT = 'N', SDIM = 0. * If SORT = 'S', SDIM = number of eigenvalues for which * SELECT is true. * * W (output) COMPLEX*16 array, dimension (N) * W contains the computed eigenvalues, in the same order * that they appear on the diagonal of the output Schur form T. * * VS (output) COMPLEX*16 array, dimension (LDVS,N) * If JOBVS = 'V', VS contains the unitary matrix Z of Schur * vectors. * If JOBVS = 'N', VS is not referenced. * * LDVS (input) INTEGER * The leading dimension of the array VS. LDVS >= 1, and if * JOBVS = 'V', LDVS >= N. * * RCONDE (output) DOUBLE PRECISION * If SENSE = 'E' or 'B', RCONDE contains the reciprocal * condition number for the average of the selected eigenvalues. * Not referenced if SENSE = 'N' or 'V'. * * RCONDV (output) DOUBLE PRECISION * If SENSE = 'V' or 'B', RCONDV contains the reciprocal * condition number for the selected right invariant subspace. * Not referenced if SENSE = 'N' or 'E'. * * WORK (workspace/output) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the optimal LWORK. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,2*N). * Also, if SENSE = 'E' or 'V' or 'B', LWORK >= 2*SDIM*(N-SDIM), * where SDIM is the number of selected eigenvalues computed by * this routine. Note that 2*SDIM*(N-SDIM) <= N*N/2. * For good performance, LWORK must generally be larger. * * RWORK (workspace) DOUBLE PRECISION array, dimension (N) * * BWORK (workspace) LOGICAL array, dimension (N) * Not referenced if SORT = 'N'. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * > 0: if INFO = i, and i is * <= N: the QR algorithm failed to compute all the * eigenvalues; elements 1:ILO-1 and i+1:N of W * contain those eigenvalues which have converged; if * JOBVS = 'V', VS contains the transformation which * reduces A to its partially converged Schur form. * = N+1: the eigenvalues could not be reordered because some * eigenvalues were too close to separate (the problem * is very ill-conditioned); * = N+2: after reordering, roundoff changed values of some * complex eigenvalues so that leading eigenvalues in * the Schur form no longer satisfy SELECT=.TRUE. This * could also be caused by underflow due to scaling. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL SCALEA, WANTSB, WANTSE, WANTSN, WANTST, WANTSV, $ WANTVS INTEGER HSWORK, I, IBAL, ICOND, IERR, IEVAL, IHI, ILO, $ ITAU, IWRK, K, MAXB, MAXWRK, MINWRK DOUBLE PRECISION ANRM, BIGNUM, CSCALE, EPS, SMLNUM * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DLABAD, DLASCL, XERBLA, ZCOPY, ZGEBAK, ZGEBAL, $ ZGEHRD, ZHSEQR, ZLACPY, ZLASCL, ZTRSEN, ZUNGHR * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV DOUBLE PRECISION DLAMCH, ZLANGE EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTVS = LSAME( JOBVS, 'V' ) WANTST = LSAME( SORT, 'S' ) WANTSN = LSAME( SENSE, 'N' ) WANTSE = LSAME( SENSE, 'E' ) WANTSV = LSAME( SENSE, 'V' ) WANTSB = LSAME( SENSE, 'B' ) IF( ( .NOT.WANTVS ) .AND. ( .NOT.LSAME( JOBVS, 'N' ) ) ) THEN INFO = -1 ELSE IF( ( .NOT.WANTST ) .AND. ( .NOT.LSAME( SORT, 'N' ) ) ) THEN INFO = -2 ELSE IF( .NOT.( WANTSN .OR. WANTSE .OR. WANTSV .OR. WANTSB ) .OR. $ ( .NOT.WANTST .AND. .NOT.WANTSN ) ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -7 ELSE IF( LDVS.LT.1 .OR. ( WANTVS .AND. LDVS.LT.N ) ) THEN INFO = -11 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of real workspace needed at that point in the * code, as well as the preferred amount for good performance. * CWorkspace refers to complex workspace, and RWorkspace to real * workspace. NB refers to the optimal block size for the * immediately following subroutine, as returned by ILAENV. * HSWORK refers to the workspace preferred by ZHSEQR, as * calculated below. HSWORK is computed assuming ILO=1 and IHI=N, * the worst case. * If SENSE = 'E', 'V' or 'B', then the amount of workspace needed * depends on SDIM, which is computed by the routine ZTRSEN later * in the code.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = N + N*ILAENV( 1, 'ZGEHRD', ' ', N, 1, N, 0 ) MINWRK = MAX( 1, 2*N ) IF( .NOT.WANTVS ) THEN MAXB = MAX( ILAENV( 8, 'ZHSEQR', 'SN', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'ZHSEQR', 'SN', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, HSWORK, 1 ) ELSE MAXWRK = MAX( MAXWRK, N+( N-1 )* $ ILAENV( 1, 'ZUNGHR', ' ', N, 1, N, -1 ) ) MAXB = MAX( ILAENV( 8, 'ZHSEQR', 'SV', N, 1, N, -1 ), 2 ) K = MIN( MAXB, N, MAX( 2, ILAENV( 4, 'ZHSEQR', 'SV', N, 1, $ N, -1 ) ) ) HSWORK = MAX( K*( K+2 ), 2*N ) MAXWRK = MAX( MAXWRK, HSWORK, 1 ) END IF WORK( 1 ) = MAXWRK END IF IF( LWORK.LT.MINWRK ) THEN INFO = -15 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEESX', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) THEN SDIM = 0 RETURN END IF * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SQRT( SMLNUM ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = ZLANGE( 'M', N, N, A, LDA, DUM ) SCALEA = .FALSE. IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN SCALEA = .TRUE. CSCALE = SMLNUM ELSE IF( ANRM.GT.BIGNUM ) THEN SCALEA = .TRUE. CSCALE = BIGNUM END IF IF( SCALEA ) $ CALL ZLASCL( 'G', 0, 0, ANRM, CSCALE, N, N, A, LDA, IERR ) * * * Permute the matrix to make it more nearly triangular * (CWorkspace: none) * (RWorkspace: need N) * IBAL = 1 CALL ZGEBAL( 'P', N, A, LDA, ILO, IHI, RWORK( IBAL ), IERR ) * * Reduce to upper Hessenberg form * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: none) * ITAU = 1 IWRK = N + ITAU CALL ZGEHRD( N, ILO, IHI, A, LDA, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) * IF( WANTVS ) THEN * * Copy Householder vectors to VS * CALL ZLACPY( 'L', N, N, A, LDA, VS, LDVS ) * * Generate unitary matrix in VS * (CWorkspace: need 2*N-1, prefer N+(N-1)*NB) * (RWorkspace: none) * CALL ZUNGHR( N, ILO, IHI, VS, LDVS, WORK( ITAU ), WORK( IWRK ), $ LWORK-IWRK+1, IERR ) END IF * SDIM = 0 * * Perform QR iteration, accumulating Schur vectors in VS if desired * (CWorkspace: need 1, prefer HSWORK (see comments) ) * (RWorkspace: none) * IWRK = ITAU CALL ZHSEQR( 'S', JOBVS, N, ILO, IHI, A, LDA, W, VS, LDVS, $ WORK( IWRK ), LWORK-IWRK+1, IEVAL ) IF( IEVAL.GT.0 ) $ INFO = IEVAL * * Sort eigenvalues if desired * IF( WANTST .AND. INFO.EQ.0 ) THEN IF( SCALEA ) $ CALL ZLASCL( 'G', 0, 0, CSCALE, ANRM, N, 1, W, N, IERR ) DO 10 I = 1, N BWORK( I ) = SELECT( W( I ) ) 10 CONTINUE * * Reorder eigenvalues, transform Schur vectors, and compute * reciprocal condition numbers * (CWorkspace: if SENSE is not 'N', need 2*SDIM*(N-SDIM) * otherwise, need none ) * (RWorkspace: none) * CALL ZTRSEN( SENSE, JOBVS, BWORK, N, A, LDA, VS, LDVS, W, SDIM, $ RCONDE, RCONDV, WORK( IWRK ), LWORK-IWRK+1, $ ICOND ) IF( .NOT.WANTSN ) $ MAXWRK = MAX( MAXWRK, 2*SDIM*( N-SDIM ) ) IF( ICOND.EQ.-14 ) THEN * * Not enough complex workspace * INFO = -15 END IF END IF * IF( WANTVS ) THEN * * Undo balancing * (CWorkspace: none) * (RWorkspace: need N) * CALL ZGEBAK( 'P', 'R', N, ILO, IHI, RWORK( IBAL ), N, VS, LDVS, $ IERR ) END IF * IF( SCALEA ) THEN * * Undo scaling for the Schur form of A * CALL ZLASCL( 'U', 0, 0, CSCALE, ANRM, N, N, A, LDA, IERR ) CALL ZCOPY( N, A, LDA+1, W, 1 ) IF( ( WANTSV .OR. WANTSB ) .AND. INFO.EQ.0 ) THEN DUM( 1 ) = RCONDV CALL DLASCL( 'G', 0, 0, CSCALE, ANRM, 1, 1, DUM, 1, IERR ) RCONDV = DUM( 1 ) END IF END IF * WORK( 1 ) = MAXWRK RETURN * * End of ZGEESX * END octave-1.1.0/libcruft/lapack/zgehd2.f100666 415 17 11207 5306544274 15570 0ustar jweusers SUBROUTINE ZGEHD2( N, ILO, IHI, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZGEHD2 reduces a complex general matrix A to upper Hessenberg form H * by a unitary similarity transformation: Q' * A * Q = H . * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that A is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to ZGEBAL; otherwise they should be * set to 1 and N respectively. See Further Details. * 1 <= ILO <= IHI <= max(1,N). * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the n by n general matrix to be reduced. * On exit, the upper triangle and the first subdiagonal of A * are overwritten with the upper Hessenberg matrix H, and the * elements below the first subdiagonal, with the array TAU, * represent the unitary matrix Q as a product of elementary * reflectors. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) COMPLEX*16 array, dimension (N-1) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) COMPLEX*16 array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrix Q is represented as a product of (ihi-ilo) elementary * reflectors * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on * exit in A(i+2:ihi,i), and tau in TAU(i). * * The contents of A are illustrated by the following example, with * n = 7, ilo = 2 and ihi = 6: * * on entry on exit * * ( a a a a a a a ) ( a a h h h h a ) * ( a a a a a a ) ( a h h h h a ) * ( a a a a a a ) ( h h h h h h ) * ( a a a a a a ) ( v2 h h h h h ) * ( a a a a a a ) ( v2 v3 h h h h ) * ( a a a a a a ) ( v2 v3 v4 h h h ) * ( a ) ( a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I COMPLEX*16 ALPHA * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARF, ZLARFG * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEHD2', -INFO ) RETURN END IF * DO 10 I = ILO, IHI - 1 * * Compute elementary reflector H(i) to annihilate A(i+2:ihi,i) * ALPHA = A( I+1, I ) CALL ZLARFG( IHI-I, ALPHA, A( MIN( I+2, N ), I ), 1, TAU( I ) ) A( I+1, I ) = ONE * * Apply H(i) to A(1:ihi,i+1:ihi) from the right * CALL ZLARF( 'Right', IHI, IHI-I, A( I+1, I ), 1, TAU( I ), $ A( 1, I+1 ), LDA, WORK ) * * Apply H(i)' to A(i+1:ihi,i+1:n) from the left * CALL ZLARF( 'Left', IHI-I, N-I, A( I+1, I ), 1, $ DCONJG( TAU( I ) ), A( I+1, I+1 ), LDA, WORK ) * A( I+1, I ) = ALPHA 10 CONTINUE * RETURN * * End of ZGEHD2 * END octave-1.1.0/libcruft/lapack/zgehrd.f100666 415 17 17215 5306544274 15675 0ustar jweusers SUBROUTINE ZGEHRD( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, LWORK, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZGEHRD reduces a complex general matrix A to upper Hessenberg form H * by a unitary similarity transformation: Q' * A * Q = H . * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that A is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to ZGEBAL; otherwise they should be * set to 1 and N respectively. See Further Details. If N > 0, * 1 <= ILO <= IHI <= N; otherwise set ILO = 1, IHI = N. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the n by n general matrix to be reduced. * On exit, the upper triangle and the first subdiagonal of A * are overwritten with the upper Hessenberg matrix H, and the * elements below the first subdiagonal, with the array TAU, * represent the unitary matrix Q as a product of elementary * reflectors. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) COMPLEX*16 array, dimension (N-1) * The scalar factors of the elementary reflectors (see Further * Details). Elements 1:ILO-1 and IHI:N-1 of TAU are set to * zero. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimum blocksize. * * LWORK (input) INTEGER * The length of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * * Further Details * =============== * * The matrix Q is represented as a product of (ihi-ilo) elementary * reflectors * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i) = 0, v(i+1) = 1 and v(ihi+1:n) = 0; v(i+2:ihi) is stored on * exit in A(i+2:ihi,i), and tau in TAU(i). * * The contents of A are illustrated by the following example, with * n = 7, ilo = 2 and ihi = 6: * * on entry on exit * * ( a a a a a a a ) ( a a h h h h a ) * ( a a a a a a ) ( a h h h h a ) * ( a a a a a a ) ( h h h h h h ) * ( a a a a a a ) ( v2 h h h h h ) * ( a a a a a a ) ( v2 v3 h h h h ) * ( a a a a a a ) ( v2 v3 v4 h h h ) * ( a ) ( a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, LDWORK, NB, NBMIN, NH, NX COMPLEX*16 EI * .. * .. Local Arrays .. COMPLEX*16 T( LDT, NBMAX ) * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEHD2, ZGEMM, ZLAHRD, ZLARFB * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEHRD', -INFO ) RETURN END IF * * Set elements 1:ILO-1 and IHI:N-1 of TAU to zero * DO 10 I = 1, ILO - 1 TAU( I ) = ZERO 10 CONTINUE DO 20 I = MAX( 1, IHI ), N - 1 TAU( I ) = ZERO 20 CONTINUE * * Quick return if possible * NH = IHI - ILO + 1 IF( NH.LE.1 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = MIN( NBMAX, ILAENV( 1, 'ZGEHRD', ' ', N, ILO, IHI, -1 ) ) NBMIN = 2 IWS = 1 IF( NB.GT.1 .AND. NB.LT.NH ) THEN * * Determine when to cross over from blocked to unblocked code * (last block is always handled by unblocked code). * NX = MAX( NB, ILAENV( 3, 'ZGEHRD', ' ', N, ILO, IHI, -1 ) ) IF( NX.LT.NH ) THEN * * Determine if workspace is large enough for blocked code. * IWS = N*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: determine the * minimum value of NB, and reduce NB or force use of * unblocked code. * NBMIN = MAX( 2, ILAENV( 2, 'ZGEHRD', ' ', N, ILO, IHI, $ -1 ) ) IF( LWORK.GE.N*NBMIN ) THEN NB = LWORK / N ELSE NB = 1 END IF END IF END IF END IF LDWORK = N * IF( NB.LT.NBMIN .OR. NB.GE.NH ) THEN * * Use unblocked code below * I = ILO * ELSE * * Use blocked code * DO 30 I = ILO, IHI - 1 - NX, NB IB = MIN( NB, IHI-I ) * * Reduce columns i:i+ib-1 to Hessenberg form, returning the * matrices V and T of the block reflector H = I - V*T*V' * which performs the reduction, and also the matrix Y = A*V*T * CALL ZLAHRD( IHI, I, IB, A( 1, I ), LDA, TAU( I ), T, LDT, $ WORK, LDWORK ) * * Apply the block reflector H to A(1:ihi,i+ib:ihi) from the * right, computing A := A - Y * V'. V(i+ib,ib-1) must be set * to 1. * EI = A( I+IB, I+IB-1 ) A( I+IB, I+IB-1 ) = ONE CALL ZGEMM( 'No transpose', 'Conjugate transpose', IHI, $ IHI-I-IB+1, IB, -ONE, WORK, LDWORK, $ A( I+IB, I ), LDA, ONE, A( 1, I+IB ), LDA ) A( I+IB, I+IB-1 ) = EI * * Apply the block reflector H to A(i+1:ihi,i+ib:n) from the * left * CALL ZLARFB( 'Left', 'Conjugate transpose', 'Forward', $ 'Columnwise', IHI-I, N-I-IB+1, IB, A( I+1, I ), $ LDA, T, LDT, A( I+1, I+IB ), LDA, WORK, $ LDWORK ) 30 CONTINUE END IF * * Use unblocked code to reduce the rest of the matrix * CALL ZGEHD2( N, I, IHI, A, LDA, TAU, WORK, IINFO ) WORK( 1 ) = IWS * RETURN * * End of ZGEHRD * END octave-1.1.0/libcruft/lapack/zgelq2.f100666 415 17 6650 5306544300 15565 0ustar jweusers SUBROUTINE ZGELQ2( M, N, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZGELQ2 computes an LQ factorization of a complex m by n matrix A: * A = L * Q. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and below the diagonal of the array * contain the m by min(m,n) lower trapezoidal matrix L (L is * lower triangular if m <= n); the elements above the diagonal, * with the array TAU, represent the unitary matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) COMPLEX*16 array, dimension (M) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(k)' . . . H(2)' H(1)', where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in * A(i,i+1:n), and tau in TAU(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, K COMPLEX*16 ALPHA * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLACGV, ZLARF, ZLARFG * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGELQ2', -INFO ) RETURN END IF * K = MIN( M, N ) * DO 10 I = 1, K * * Generate elementary reflector H(i) to annihilate A(i,i+1:n) * CALL ZLACGV( N-I+1, A( I, I ), LDA ) ALPHA = A( I, I ) CALL ZLARFG( N-I+1, ALPHA, A( I, MIN( I+1, N ) ), LDA, $ TAU( I ) ) IF( I.LT.M ) THEN * * Apply H(i) to A(i+1:m,i:n) from the right * A( I, I ) = ONE CALL ZLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, TAU( I ), $ A( I+1, I ), LDA, WORK ) END IF A( I, I ) = ALPHA CALL ZLACGV( N-I+1, A( I, I ), LDA ) 10 CONTINUE RETURN * * End of ZGELQ2 * END octave-1.1.0/libcruft/lapack/zgelqf.f100666 415 17 12523 5306544300 15665 0ustar jweusers SUBROUTINE ZGELQF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZGELQF computes an LQ factorization of a complex m by n matrix A: * A = L * Q. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and below the diagonal of the array * contain the m by min(m,n) lower trapezoidal matrix L (L is * lower triangular if m <= n); the elements above the diagonal, * with the array TAU, represent the unitary matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,M). * For optimum performance LWORK should be at least M*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(k)' . . . H(2)' H(1)', where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i-1) = 0 and v(i) = 1; conjg(v(i+1:n)) is stored on exit in * A(i,i+1:n), and tau in TAU(i). * * ===================================================================== * * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, K, LDWORK, NB, NBMIN, NX * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGELQ2, ZLARFB, ZLARFT * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, M ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGELQF', -INFO ) RETURN END IF * * Quick return if possible * K = MIN( M, N ) IF( K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) NBMIN = 2 NX = 0 IWS = M IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'ZGELQF', ' ', M, N, -1, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = M IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZGELQF', ' ', M, N, -1, $ -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code initially * DO 10 I = 1, K - NX, NB IB = MIN( K-I+1, NB ) * * Compute the LQ factorization of the current block * A(i:i+ib-1,i:n) * CALL ZGELQ2( IB, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) IF( I+IB.LE.M ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ), $ LDA, TAU( I ), WORK, LDWORK ) * * Apply H to A(i+ib:m,i:n) from the right * CALL ZLARFB( 'Right', 'No transpose', 'Forward', $ 'Rowwise', M-I-IB+1, N-I+1, IB, A( I, I ), $ LDA, WORK, LDWORK, A( I+IB, I ), LDA, $ WORK( IB+1 ), LDWORK ) END IF 10 CONTINUE ELSE I = 1 END IF * * Use unblocked code to factor the last or only block. * IF( I.LE.K ) $ CALL ZGELQ2( M-I+1, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * WORK( 1 ) = IWS RETURN * * End of ZGELQF * END octave-1.1.0/libcruft/lapack/zgelss.f100666 415 17 51677 5406734054 15731 0ustar jweusers SUBROUTINE ZGELSS( M, N, NRHS, A, LDA, B, LDB, S, RCOND, RANK, $ WORK, LWORK, RWORK, INFO ) * * -- LAPACK driver routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. INTEGER INFO, LDA, LDB, LWORK, M, N, NRHS, RANK DOUBLE PRECISION RCOND * .. * .. Array Arguments .. DOUBLE PRECISION RWORK( * ), S( * ) COMPLEX*16 A( LDA, * ), B( LDB, * ), WORK( * ) * .. * * Purpose * ======= * * ZGELSS computes the minimum norm solution to a complex linear * least squares problem: * * Minimize 2-norm(| b - A*x |). * * using the singular value decomposition (SVD) of A. A is an M-by-N * matrix which may be rank-deficient. * * Several right hand side vectors b and solution vectors x can be * handled in a single call; they are stored as the columns of the * M-by-NRHS right hand side matrix B and the N-by-NRHS solution matrix * X. * * The effective rank of A is determined by treating as zero those * singular values which are less than RCOND times the largest singular * value. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrices B and X. NRHS >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the M-by-N matrix A. * On exit, the first min(m,n) rows of A are overwritten with * its right singular vectors, stored rowwise. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * B (input/output) COMPLEX*16 array, dimension (LDB,NRHS) * On entry, the M-by-NRHS right hand side matrix B. * On exit, B is overwritten by the N-by-NRHS solution matrix X. * If m >= n and RANK = n, the residual sum-of-squares for * the solution in the i-th column is given by the sum of * squares of elements n+1:m in that column. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,M,N). * * S (output) DOUBLE PRECISION array, dimension (min(M,N)) * The singular values of A in decreasing order. * The condition number of A in the 2-norm = S(1)/S(min(m,n)). * * RCOND (input) DOUBLE PRECISION * RCOND is used to determine the effective rank of A. * Singular values S(i) <= RCOND*S(1) are treated as zero. * If RCOND $<$ 0, machine precision is used instead. * * RANK (output) INTEGER * The effective rank of A, i.e., the number of singular values * which are greater than RCOND*S(1). * * WORK (workspace/output) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the optimal LWORK. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= 1, and also: * LWORK >= 2*N+MAX(NRHS,M) if M >= N, * LWORK >= 2*M+MAX(NRHS,N) if M < N. * For good performance, LWORK should generally be larger. * * RWORK (workspace) DOUBLE PRECISION array, dimension * (max(5*min(M,N)-4,1)) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value. * > 0: the algorithm for computing the SVD failed to converge; * if INFO = i, i off-diagonal elements of an intermediate * bidiagonal form did not converge to zero. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) COMPLEX*16 CZERO, CONE PARAMETER ( CZERO = 0.0D0, CONE = 1.0D0 ) * .. * .. Local Scalars .. INTEGER BL, CHUNK, I, IASCL, IBSCL, IE, IL, IRWORK, $ ITAU, ITAUP, ITAUQ, IWORK, LDWORK, MAXMN, $ MAXWRK, MINMN, MINWRK, MM, MNTHR DOUBLE PRECISION ANRM, BIGNUM, BNRM, EPS, SFMIN, SMLNUM, THR * .. * .. Local Arrays .. COMPLEX*16 VDUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DLABAD, DLASCL, DLASET, XERBLA, ZBDSQR, ZCOPY, $ ZDRSCL, ZGEBRD, ZGELQF, ZGEMM, ZGEMV, ZGEQRF, $ ZLACPY, ZLASCL, ZLASET, ZUNGBR, ZUNMBR, ZUNMLQ, $ ZUNMQR * .. * .. External Functions .. INTEGER ILAENV DOUBLE PRECISION DLAMCH, ZLANGE EXTERNAL ILAENV, DLAMCH, ZLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 MINMN = MIN( M, N ) MAXMN = MAX( M, N ) MNTHR = ILAENV( 6, 'ZGELSS', ' ', M, N, NRHS, -1 ) IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NRHS.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LDB.LT.MAX( 1, MAXMN ) ) THEN INFO = -7 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * CWorkspace refers to complex workspace, and RWorkspace refers * to real workspace. NB refers to the optimal block size for the * immediately following subroutine, as returned by ILAENV.) * MINWRK = 1 IF( INFO.EQ.0 .AND. LWORK.GE.1 ) THEN MAXWRK = 0 MM = M IF( M.GE.N .AND. M.GE.MNTHR ) THEN * * Path 1a - overdetermined, with many more rows than columns * MM = N MAXWRK = MAX( MAXWRK, N+N*ILAENV( 1, 'ZGEQRF', ' ', M, N, $ -1, -1 ) ) MAXWRK = MAX( MAXWRK, N+NRHS* $ ILAENV( 1, 'ZUNMQR', 'LT', M, NRHS, N, -1 ) ) END IF IF( M.GE.N ) THEN * * Path 1 - overdetermined or exactly determined * MAXWRK = MAX( MAXWRK, 2*N+( MM+N )* $ ILAENV( 1, 'ZGEBRD', ' ', MM, N, -1, -1 ) ) MAXWRK = MAX( MAXWRK, 2*N+NRHS* $ ILAENV( 1, 'ZUNMBR', 'QLC', MM, NRHS, N, -1 ) ) MAXWRK = MAX( MAXWRK, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MAXWRK = MAX( MAXWRK, 5*N-4 ) MAXWRK = MAX( MAXWRK, N*NRHS ) MINWRK = 2*N + MAX( NRHS, M ) END IF IF( N.GT.M ) THEN MINWRK = 2*M + MAX( NRHS, N ) IF( N.GE.MNTHR ) THEN * * Path 2a - underdetermined, with many more columns * than rows * MAXWRK = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) MAXWRK = MAX( MAXWRK, 3*M+M*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) MAXWRK = MAX( MAXWRK, 3*M+M*M+NRHS* $ ILAENV( 1, 'ZUNMBR', 'QLC', M, NRHS, M, -1 ) ) MAXWRK = MAX( MAXWRK, 3*M+M*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) IF( NRHS.GT.1 ) THEN MAXWRK = MAX( MAXWRK, M*M+M+M*NRHS ) ELSE MAXWRK = MAX( MAXWRK, M*M+2*M ) END IF MAXWRK = MAX( MAXWRK, M+NRHS* $ ILAENV( 1, 'ZUNMLQ', 'LT', N, NRHS, M, -1 ) ) ELSE * * Path 2 - underdetermined * MAXWRK = 2*M + ( N+M )*ILAENV( 1, 'ZGEBRD', ' ', M, N, $ -1, -1 ) MAXWRK = MAX( MAXWRK, 2*M+NRHS* $ ILAENV( 1, 'ZUNMBR', 'QLT', M, NRHS, M, -1 ) ) MAXWRK = MAX( MAXWRK, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'P', M, N, M, -1 ) ) MAXWRK = MAX( MAXWRK, N*NRHS ) END IF END IF MINWRK = MIN( MINWRK, MAXWRK ) WORK( 1 ) = MAXWRK END IF * MINWRK = MAX( MINWRK, 1 ) IF( LWORK.LT.MINWRK ) $ INFO = -12 IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGELSS', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN RANK = 0 RETURN END IF * * Get machine parameters * EPS = DLAMCH( 'P' ) SFMIN = DLAMCH( 'S' ) SMLNUM = SFMIN / EPS BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = ZLANGE( 'M', M, N, A, LDA, RWORK ) IASCL = 0 IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN * * Scale matrix norm up to SMLNUM * CALL ZLASCL( 'G', 0, 0, ANRM, SMLNUM, M, N, A, LDA, INFO ) IASCL = 1 ELSE IF( ANRM.GT.BIGNUM ) THEN * * Scale matrix norm down to BIGNUM * CALL ZLASCL( 'G', 0, 0, ANRM, BIGNUM, M, N, A, LDA, INFO ) IASCL = 2 ELSE IF( ANRM.EQ.ZERO ) THEN * * Matrix all zero. Return zero solution. * CALL ZLASET( 'F', MAX( M, N ), NRHS, CZERO, CZERO, B, LDB ) CALL DLASET( 'F', MINMN, 1, ZERO, ZERO, S, MINMN ) RANK = 0 GO TO 70 END IF * * Scale B if max entry outside range [SMLNUM,BIGNUM] * BNRM = ZLANGE( 'M', M, NRHS, B, LDB, RWORK ) IBSCL = 0 IF( BNRM.GT.ZERO .AND. BNRM.LT.SMLNUM ) THEN * * Scale matrix norm up to SMLNUM * CALL ZLASCL( 'G', 0, 0, BNRM, SMLNUM, M, NRHS, B, LDB, INFO ) IBSCL = 1 ELSE IF( BNRM.GT.BIGNUM ) THEN * * Scale matrix norm down to BIGNUM * CALL ZLASCL( 'G', 0, 0, BNRM, BIGNUM, M, NRHS, B, LDB, INFO ) IBSCL = 2 END IF * * Overdetermined case * IF( M.GE.N ) THEN * * Path 1 - overdetermined or exactly determined * MM = M IF( M.GE.MNTHR ) THEN * * Path 1a - overdetermined, with many more rows than columns * MM = N ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: none) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Multiply B by transpose(Q) * (CWorkspace: need N+NRHS, prefer N+NRHS*NB) * (RWorkspace: none) * CALL ZUNMQR( 'L', 'C', M, NRHS, N, A, LDA, WORK( ITAU ), B, $ LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Zero out below R * IF( N.GT.1 ) $ CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, A( 2, 1 ), $ LDA ) END IF * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in A * (CWorkspace: need 2*N+MM, prefer 2*N+(MM+N)*NB) * (RWorkspace: need N) * CALL ZGEBRD( MM, N, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) * * Multiply B by transpose of left bidiagonalizing vectors of R * (CWorkspace: need 2*N+NRHS, prefer 2*N+NRHS*NB) * (RWorkspace: none) * CALL ZUNMBR( 'Q', 'L', 'C', MM, NRHS, N, A, LDA, WORK( ITAUQ ), $ B, LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors of R in A * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: none) * CALL ZUNGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration * multiply B by transpose of left singular vectors * compute right singular vectors in A * (CWorkspace: none) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, 0, NRHS, S, RWORK( IE ), A, LDA, VDUM, $ 1, B, LDB, RWORK( IRWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 10 I = 1, N IF( S( I ).GT.THR ) THEN CALL ZDRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL ZLASET( 'F', 1, NRHS, CZERO, CZERO, B( I, 1 ), LDB ) END IF 10 CONTINUE * * Multiply B by right singular vectors * (CWorkspace: need N, prefer N*NRHS) * (RWorkspace: none) * IF( LWORK.GE.LDB*NRHS .AND. NRHS.GT.1 ) THEN CALL ZGEMM( 'C', 'N', N, NRHS, N, CONE, A, LDA, B, LDB, $ CZERO, WORK, LDB ) CALL ZLACPY( 'G', N, NRHS, WORK, LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = LWORK / N DO 20 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL ZGEMM( 'C', 'N', N, BL, N, CONE, A, LDA, B, LDB, $ CZERO, WORK, N ) CALL ZLACPY( 'G', N, BL, WORK, N, B, LDB ) 20 CONTINUE ELSE CALL ZGEMV( 'C', N, N, CONE, A, LDA, B, 1, CZERO, WORK, 1 ) CALL ZCOPY( N, WORK, 1, B, 1 ) END IF * ELSE IF( N.GE.MNTHR .AND. LWORK.GE.3*M+M*M+MAX( M, NRHS, N-2*M ) ) $ THEN * * Underdetermined case, M much less than N * * Path 2a - underdetermined, with many more columns than rows * and sufficient workspace for an efficient algorithm * LDWORK = M IF( LWORK.GE.3*M+M*LDA+MAX( M, NRHS, N-2*M ) ) $ LDWORK = LDA ITAU = 1 IWORK = M + 1 * * Compute A=L*Q * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: none) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IL = IWORK * * Copy L to WORK(IL), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IL ), LDWORK ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, WORK( IL+LDWORK ), $ LDWORK ) IE = 1 ITAUQ = IL + LDWORK*M ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IL) * (CWorkspace: need M*M+4*M, prefer M*M+3*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IL ), LDWORK, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Multiply B by transpose of left bidiagonalizing vectors of L * (CWorkspace: need M*M+3*M+NRHS, prefer M*M+3*M+NRHS*NB) * (RWorkspace: none) * CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, M, WORK( IL ), LDWORK, $ WORK( ITAUQ ), B, LDB, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors of R in WORK(IL) * (CWorkspace: need M*M+4*M-1, prefer M*M+3*M+(M-1)*NB) * CALL ZUNGBR( 'P', M, M, M, WORK( IL ), LDWORK, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right singular * vectors of L in WORK(IL) and multiplying B by transpose of * left singular vectors * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, 0, NRHS, S, RWORK( IE ), WORK( IL ), $ LDWORK, A, LDA, B, LDB, RWORK( IRWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 30 I = 1, M IF( S( I ).GT.THR ) THEN CALL ZDRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL ZLASET( 'F', 1, NRHS, CZERO, CZERO, B( I, 1 ), LDB ) END IF 30 CONTINUE IWORK = IL + M*LDWORK * * Multiply B by right singular vectors of L in WORK(IL) * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NRHS) * (RWorkspace: none) * IF( LWORK.GE.LDB*NRHS+IWORK-1 .AND. NRHS.GT.1 ) THEN CALL ZGEMM( 'C', 'N', M, NRHS, M, CONE, WORK( IL ), LDWORK, $ B, LDB, CZERO, WORK( IWORK ), LDB ) CALL ZLACPY( 'G', M, NRHS, WORK( IWORK ), LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = ( LWORK-IWORK+1 ) / M DO 40 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL ZGEMM( 'C', 'N', M, BL, M, CONE, WORK( IL ), LDWORK, $ B( 1, I ), LDB, CZERO, WORK( IWORK ), N ) CALL ZLACPY( 'G', M, BL, WORK( IWORK ), N, B, LDB ) 40 CONTINUE ELSE CALL ZGEMV( 'C', M, M, CONE, WORK( IL ), LDWORK, B( 1, 1 ), $ 1, CZERO, WORK( IWORK ), 1 ) CALL ZCOPY( M, WORK( IWORK ), 1, B( 1, 1 ), 1 ) END IF * * Zero out below first M rows of B * CALL ZLASET( 'F', N-M, NRHS, CZERO, CZERO, B( M+1, 1 ), LDB ) IWORK = ITAU + M * * Multiply transpose(Q) by B * (CWorkspace: need M+NRHS, prefer M+NHRS*NB) * (RWorkspace: none) * CALL ZUNMLQ( 'L', 'C', N, NRHS, M, A, LDA, WORK( ITAU ), B, $ LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * ELSE * * Path 2 - remaining underdetermined cases * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (CWorkspace: need 3*M, prefer 2*M+(M+N)*NB) * (RWorkspace: need N) * CALL ZGEBRD( M, N, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) * * Multiply B by transpose of left bidiagonalizing vectors * (CWorkspace: need 2*M+NRHS, prefer 2*M+NRHS*NB) * (RWorkspace: none) * CALL ZUNMBR( 'Q', 'L', 'C', M, NRHS, N, A, LDA, WORK( ITAUQ ), $ B, LDB, WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in A * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: none) * CALL ZUNGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IWORK = IE + M * * Perform bidiagonal QR iteration, * computing right singular vectors of A in A and * multiplying B by transpose of left singular vectors * (CWorkspace: none) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'L', M, N, 0, NRHS, S, RWORK( IE ), A, LDA, VDUM, $ 1, B, LDB, RWORK( IWORK ), INFO ) IF( INFO.NE.0 ) $ GO TO 70 * * Multiply B by reciprocals of singular values * THR = MAX( RCOND*S( 1 ), SFMIN ) IF( THR.LT.ZERO ) $ THR = MAX( EPS*S( 1 ), SFMIN ) RANK = 0 DO 50 I = 1, M IF( S( I ).GT.THR ) THEN CALL ZDRSCL( NRHS, S( I ), B( I, 1 ), LDB ) RANK = RANK + 1 ELSE CALL ZLASET( 'F', 1, NRHS, CZERO, CZERO, B( I, 1 ), LDB ) END IF 50 CONTINUE * * Multiply B by right singular vectors of A * (CWorkspace: need N, prefer N*NRHS) * (RWorkspace: none) * IF( LWORK.GE.LDB*NRHS .AND. NRHS.GT.1 ) THEN CALL ZGEMM( 'C', 'N', N, NRHS, M, CONE, A, LDA, B, LDB, $ CZERO, WORK, LDB ) CALL ZLACPY( 'G', N, NRHS, WORK, LDB, B, LDB ) ELSE IF( NRHS.GT.1 ) THEN CHUNK = LWORK / N DO 60 I = 1, NRHS, CHUNK BL = MIN( NRHS-I+1, CHUNK ) CALL ZGEMM( 'C', 'N', N, BL, M, CONE, A, LDA, B( 1, I ), $ LDB, CZERO, WORK, N ) CALL ZLACPY( 'F', N, BL, WORK, N, B( 1, I ), LDB ) 60 CONTINUE ELSE CALL ZGEMV( 'C', M, N, CONE, A, LDA, B, 1, CZERO, WORK, 1 ) CALL ZCOPY( N, WORK, 1, B, 1 ) END IF END IF * * Undo scaling * IF( IASCL.EQ.1 ) THEN CALL ZLASCL( 'G', 0, 0, ANRM, SMLNUM, N, NRHS, B, LDB, INFO ) CALL DLASCL( 'G', 0, 0, SMLNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) ELSE IF( IASCL.EQ.2 ) THEN CALL ZLASCL( 'G', 0, 0, ANRM, BIGNUM, N, NRHS, B, LDB, INFO ) CALL DLASCL( 'G', 0, 0, BIGNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) END IF IF( IBSCL.EQ.1 ) THEN CALL ZLASCL( 'G', 0, 0, SMLNUM, BNRM, N, NRHS, B, LDB, INFO ) ELSE IF( IBSCL.EQ.2 ) THEN CALL ZLASCL( 'G', 0, 0, BIGNUM, BNRM, N, NRHS, B, LDB, INFO ) END IF 70 CONTINUE WORK( 1 ) = MAXWRK RETURN * * End of ZGELSS * END octave-1.1.0/libcruft/lapack/zgeqpf.f100666 415 17 15103 5613564665 15707 0ustar jweusers SUBROUTINE ZGEQPF( M, N, A, LDA, JPVT, TAU, WORK, RWORK, INFO ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER JPVT( * ) DOUBLE PRECISION RWORK( * ) COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZGEQPF computes a QR factorization with column pivoting of a * complex M-by-N matrix A: A*P = Q*R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0 * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the M-by-N matrix A. * On exit, the upper triangle of the array contains the * min(M,N)-by-N upper triangular matrix R; the elements * below the diagonal, together with the array TAU, * represent the orthogonal matrix Q as a product of * min(m,n) elementary reflectors. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * JPVT (input/output) INTEGER array, dimension (N) * On entry, if JPVT(i) .ne. 0, the i-th column of A is permuted * to the front of A*P (a leading column); if JPVT(i) = 0, * the i-th column of A is a free column. * On exit, if JPVT(i) = k, then the i-th column of A*P * was the k-th column of A. * * TAU (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors. * * WORK (workspace) COMPLEX*16 array, dimension (N) * * RWORK (workspace) DOUBLE PRECISION array, dimension (2*N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(n) * * Each H(i) has the form * * H = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i). * * The matrix P is represented in jpvt as follows: If * jpvt(j) = i * then the jth column of P is the ith canonical unit vector. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, ITEMP, J, MA, MN, PVT DOUBLE PRECISION TEMP, TEMP2 COMPLEX*16 AII * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEQR2, ZLARF, ZLARFG, ZSWAP, ZUNM2R * .. * .. Intrinsic Functions .. INTRINSIC ABS, DCMPLX, DCONJG, MAX, MIN, SQRT * .. * .. External Functions .. INTEGER IDAMAX DOUBLE PRECISION DZNRM2 EXTERNAL IDAMAX, DZNRM2 * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEQPF', -INFO ) RETURN END IF * MN = MIN( M, N ) * * Move initial columns up front * ITEMP = 1 DO 10 I = 1, N IF( JPVT( I ).NE.0 ) THEN IF( I.NE.ITEMP ) THEN CALL ZSWAP( M, A( 1, I ), 1, A( 1, ITEMP ), 1 ) JPVT( I ) = JPVT( ITEMP ) JPVT( ITEMP ) = I ELSE JPVT( I ) = I END IF ITEMP = ITEMP + 1 ELSE JPVT( I ) = I END IF 10 CONTINUE ITEMP = ITEMP - 1 * * Compute the QR factorization and update remaining columns * IF( ITEMP.GT.0 ) THEN MA = MIN( ITEMP, M ) CALL ZGEQR2( M, MA, A, LDA, TAU, WORK, INFO ) IF( MA.LT.N ) THEN CALL ZUNM2R( 'Left', 'Conjugate transpose', M, N-MA, MA, A, $ LDA, TAU, A( 1, MA+1 ), LDA, WORK, INFO ) END IF END IF * IF( ITEMP.LT.MN ) THEN * * Initialize partial column norms. The first n entries of * work store the exact column norms. * DO 20 I = ITEMP + 1, N RWORK( I ) = DZNRM2( M-ITEMP, A( ITEMP+1, I ), 1 ) RWORK( N+I ) = RWORK( I ) 20 CONTINUE * * Compute factorization * DO 40 I = ITEMP + 1, MN * * Determine ith pivot column and swap if necessary * PVT = ( I-1 ) + IDAMAX( N-I+1, RWORK( I ), 1 ) * IF( PVT.NE.I ) THEN CALL ZSWAP( M, A( 1, PVT ), 1, A( 1, I ), 1 ) ITEMP = JPVT( PVT ) JPVT( PVT ) = JPVT( I ) JPVT( I ) = ITEMP RWORK( PVT ) = RWORK( I ) RWORK( N+PVT ) = RWORK( N+I ) END IF * * Generate elementary reflector H(i) * AII = A( I, I ) CALL ZLARFG( M-I+1, AII, A( MIN( I+1, M ), I ), 1, $ TAU( I ) ) A( I, I ) = AII * IF( I.LT.N ) THEN * * Apply H(i) to A(i:m,i+1:n) from the left * AII = A( I, I ) A( I, I ) = DCMPLX( ONE ) CALL ZLARF( 'Left', M-I+1, N-I, A( I, I ), 1, $ DCONJG( TAU( I ) ), A( I, I+1 ), LDA, WORK ) A( I, I ) = AII END IF * * Update partial column norms * DO 30 J = I + 1, N IF( RWORK( J ).NE.ZERO ) THEN TEMP = ONE - ( ABS( A( I, J ) ) / RWORK( J ) )**2 TEMP = MAX( TEMP, ZERO ) TEMP2 = ONE + 0.05D0*TEMP* $ ( RWORK( J ) / RWORK( N+J ) )**2 IF( TEMP2.EQ.ONE ) THEN IF( M-I.GT.0 ) THEN RWORK( J ) = DZNRM2( M-I, A( I+1, J ), 1 ) RWORK( N+J ) = RWORK( J ) ELSE RWORK( J ) = ZERO RWORK( N+J ) = ZERO END IF ELSE RWORK( J ) = RWORK( J )*SQRT( TEMP ) END IF END IF 30 CONTINUE * 40 CONTINUE END IF RETURN * * End of ZGEQPF * END octave-1.1.0/libcruft/lapack/zgeqr2.f100666 415 17 6520 5306544303 15572 0ustar jweusers SUBROUTINE ZGEQR2( M, N, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZGEQR2 computes a QR factorization of a complex m by n matrix A: * A = Q * R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and above the diagonal of the array * contain the min(m,n) by n upper trapezoidal matrix R (R is * upper triangular if m >= n); the elements below the diagonal, * with the array TAU, represent the unitary matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) COMPLEX*16 array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(k), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), * and tau in TAU(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, K COMPLEX*16 ALPHA * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARF, ZLARFG * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEQR2', -INFO ) RETURN END IF * K = MIN( M, N ) * DO 10 I = 1, K * * Generate elementary reflector H(i) to annihilate A(i+1:m,i) * CALL ZLARFG( M-I+1, A( I, I ), A( MIN( I+1, M ), I ), 1, $ TAU( I ) ) IF( I.LT.N ) THEN * * Apply H(i)' to A(i:m,i+1:n) from the left * ALPHA = A( I, I ) A( I, I ) = ONE CALL ZLARF( 'Left', M-I+1, N-I, A( I, I ), 1, $ DCONJG( TAU( I ) ), A( I, I+1 ), LDA, WORK ) A( I, I ) = ALPHA END IF 10 CONTINUE RETURN * * End of ZGEQR2 * END octave-1.1.0/libcruft/lapack/zgeqrf.f100666 415 17 12524 5306544303 15677 0ustar jweusers SUBROUTINE ZGEQRF( M, N, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZGEQRF computes a QR factorization of a complex m by n matrix A: * A = Q * R. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, the elements on and above the diagonal of the array * contain the min(m,n) by n upper trapezoidal matrix R (R is * upper triangular if m >= n); the elements below the diagonal, * with the array TAU, represent the unitary matrix Q as a * product of elementary reflectors (see Further Details). * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * TAU (output) COMPLEX*16 array, dimension (min(M,N)) * The scalar factors of the elementary reflectors (see Further * Details). * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The matrix Q is represented as a product of elementary reflectors * * Q = H(1) H(2) . . . H(k), where k = min(m,n). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i-1) = 0 and v(i) = 1; v(i+1:m) is stored on exit in A(i+1:m,i), * and tau in TAU(i). * * ===================================================================== * * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, K, LDWORK, NB, NBMIN, NX * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEQR2, ZLARFB, ZLARFT * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGEQRF', -INFO ) RETURN END IF * * Quick return if possible * K = MIN( M, N ) IF( K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) NBMIN = 2 NX = 0 IWS = N IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'ZGEQRF', ' ', M, N, -1, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = N IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZGEQRF', ' ', M, N, -1, $ -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code initially * DO 10 I = 1, K - NX, NB IB = MIN( K-I+1, NB ) * * Compute the QR factorization of the current block * A(i:m,i:i+ib-1) * CALL ZGEQR2( M-I+1, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) IF( I+IB.LE.N ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Columnwise', M-I+1, IB, $ A( I, I ), LDA, TAU( I ), WORK, LDWORK ) * * Apply H' to A(i:m,i+ib:n) from the left * CALL ZLARFB( 'Left', 'Conjugate transpose', 'Forward', $ 'Columnwise', M-I+1, N-I-IB+1, IB, $ A( I, I ), LDA, WORK, LDWORK, A( I, I+IB ), $ LDA, WORK( IB+1 ), LDWORK ) END IF 10 CONTINUE ELSE I = 1 END IF * * Use unblocked code to factor the last or only block. * IF( I.LE.K ) $ CALL ZGEQR2( M-I+1, N-I+1, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * WORK( 1 ) = IWS RETURN * * End of ZGEQRF * END octave-1.1.0/libcruft/lapack/zgesv.f100666 415 17 6611 5310240742 15512 0ustar jweusers SUBROUTINE ZGESV( N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, LDB, N, NRHS * .. * .. Array Arguments .. INTEGER IPIV( * ) COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * ZGESV computes the solution to a complex system of linear equations * A * X = B, * where A is an N by N matrix and X and B are N by NRHS matrices. * * The LU decomposition with partial pivoting and row interchanges is * used to factor A as * A = P * L * U, * where P is a permutation matrix, L is unit lower triangular, and U is * upper triangular. The factored form of A is then used to solve the * system of equations A * X = B. * * Arguments * ========= * * N (input) INTEGER * The number of linear equations, i.e., the order of the * matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrix B. NRHS >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the N by N matrix of coefficients A. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * IPIV (output) INTEGER array, dimension (N) * The pivot indices that define the permutation matrix P; * row i of the matrix was interchanged with row IPIV(i). * * B (input/output) COMPLEX*16 array, dimension (LDB,NRHS) * On entry, the N by NRHS matrix of right hand side vectors B * for the system of equations A*X = B. * On exit, if INFO = 0, the N by NRHS matrix of solution * vectors X. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, so the solution could not be computed. * * ===================================================================== * * .. External Subroutines .. EXTERNAL XERBLA, ZGETRF, ZGETRS * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( NRHS.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGESV ', -INFO ) RETURN END IF * * Compute the LU factorization of A. * CALL ZGETRF( N, N, A, LDA, IPIV, INFO ) IF( INFO.EQ.0 ) THEN * * Solve the system A*X = B, overwriting B with X. * CALL ZGETRS( 'No transpose', N, NRHS, A, LDA, IPIV, B, LDB, $ INFO ) END IF RETURN * * End of ZGESV * END octave-1.1.0/libcruft/lapack/zgesvd.f100666 415 17 423243 5306544277 15741 0ustar jweusers SUBROUTINE ZGESVD( JOBU, JOBVT, M, N, A, LDA, S, U, LDU, VT, LDVT, $ WORK, LWORK, RWORK, INFO ) * * -- LAPACK driver routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER JOBU, JOBVT INTEGER INFO, LDA, LDU, LDVT, LWORK, M, N * .. * .. Array Arguments .. DOUBLE PRECISION RWORK( * ), S( * ) COMPLEX*16 A( LDA, * ), U( LDU, * ), VT( LDVT, * ), $ WORK( * ) * .. * * Purpose * ======= * * ZGESVD computes the singular value decomposition (SVD) of a complex * M-by-N matrix A, optionally computing the left and/or right singular * vectors. The SVD is written * * A = U * SIGMA * conjugate-transpose(V) * * where SIGMA is a diagonal matrix with the singular values on the * diagonal and U and V are unitary. The columns of U are the left * singular vectors and the columns of V are the right singular vectors. * If the right singular vectors are requested, * VT = conjugate-transpose(V) is returned by the routine. * * The diagonal entries of SIGMA are returned in S: * S(1) >= ... >= S(MINMN) >= 0, where MINMN=MIN(M,N). * * Depending on JOBU all M left singular vectors may be computed * and stored in U, min(M,N) left singular vectors may be computed and * stored in U or overwritten on A, or no vectors may be computed. * * Depending on JOBVT all N right singular vectors may be computed * and stored in VT, min(M,N) right singular vectors may be computed and * stored in VT or overwritten on A, or no vectors may be computed. * * Arguments * ========= * * JOBU (input) CHARACTER*1 * JOBU specifies which left singular vectors to compute. If * JOBU = 'A' all M M-dimensional left singular * vectors are returned in U. * JOBU = 'S' only MIN(M,N) M-dimensional left * singular vectors are returned in U. * JOBU = 'O' only MIN(M,N) M-dimensional left * singular vectors are overwritten on A. * JOBU = 'N' no left singular vectors are computed. * * JOBVT (input) CHARACTER*1 * JOBVT specifies which right singular vectors to compute. If * JOBVT = 'A' all N N-dimensional right singular * vectors are returned in VT. * JOBVT = 'S' only MIN(M,N) N-dimensional right * singular vectors are returned in VT. * JOBVT = 'O' only MIN(M,N) N-dimensional right * singular vectors are overwritten on A. * JOBVT = 'N' no right singular vectors are computed. * * JOBVT and JOBU cannot simultaneously be 'O'. * * M (input) INTEGER * The number of rows of the input matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the input matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On input, A is the matrix whose SVD is desired. * On output, * if JOBU = 'O', A has been overwritten with * min(M,N) left singular vectors; * if JOBVT = 'O', A has been overwritten with * min(M,N) right singular vectors. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * S (output) DOUBLE PRECISION array, dimension (min(M,N)) * The singular values of A, sorted so that S(i) >= S(i+1). * * U (output) COMPLEX*16 array, dimension (LDU,UCOL) * where UCOL is defined as follows. * U contains the computed left singular vectors. * U has M rows and UCOL=M columns if JOBU = 'A'. * U has M rows and UCOL=min(M,N) columns if JOBU = 'S'. * U is not referenced if JOBU = 'N' or 'O'. * * LDU (input) INTEGER * The leading dimension of the array U. LDU >= 1, and * LDU >= M if JOBU = 'S' or 'A'. * * VT (output) COMPLEX*16 array, dimension (LDVT,N) * VT contains the transpose of the computed left singular * vectors. * VT has N rows and N columns if JOBVT = 'A'. * VT has min(M,N) rows and N columns if JOBVT = 'S'. * VT is not referenced if JOBVT = 'N' or 'O'. * * LDVT (input) INTEGER * The leading dimension of the array VT. LDVT >= 1, and * LDVT >= min(M,N) if JOBVT = 'S', or LDVT >= N if JOBVT = 'A'. * * WORK (workspace/output) COMPLEX*16 array, dimension (LWORK) * On exit, WORK(1) contains the optimal workspace size LWORK * for high performance. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK must be at least 1. * The exact minimum amount of workspace needed depends * on JOBU, JOBVT, M and N. As long as LWORK is at least * 2*MIN(M,N)+MAX(M,N), then the code will execute correctly. * For good performance, LWORK should generally be larger. * The optimum value of LWORK for high performance is * returned in WORK(1). * * RWORK (workspace) DOUBLE PRECISION array, dimension (5*max(M,N)) * * INFO (output) INTEGER * 0 - successful exit * <0 - if INFO = -i, the i-th argument had an illegal value. * >0 - if ZBDSQR did not converge, INFO specifies how many * superdiagonals of an intermediate bidiagonal form * did not converge to zero. * * ===================================================================== * * .. Parameters .. COMPLEX*16 CZERO, CONE PARAMETER ( CZERO = 0.0D0, CONE = 1.0D0 ) DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL WNTUA, WNTUAS, WNTUN, WNTUO, WNTUS, WNTVA, $ WNTVAS, WNTVN, WNTVO, WNTVS INTEGER BLK, CHUNK, I, IE, IR, IRWORK, ISCL, ITAU, $ ITAUP, ITAUQ, IU, IWORK, LDWRKR, LDWRKU, $ MAXWRK, MINMN, MINWRK, MNTHR, NCU, NCVT, NRU, $ NRVT, WRKBL DOUBLE PRECISION ANRM, BIGNUM, EPS, SMLNUM * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ) COMPLEX*16 CDUM( 1 ) * .. * .. External Subroutines .. EXTERNAL DLASCL, XERBLA, ZBDSQR, ZGEBRD, ZGELQF, ZGEMM, $ ZGEQRF, ZLACPY, ZLASCL, ZLASET, ZUNGBR, ZUNGLQ, $ ZUNGQR, ZUNMBR * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV DOUBLE PRECISION DLAMCH, ZLANGE EXTERNAL LSAME, ILAENV, DLAMCH, ZLANGE * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN, SQRT * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 MINMN = MIN( M, N ) MNTHR = ILAENV( 6, 'ZGESVD', JOBU // JOBVT, M, N, 0, 0 ) WNTUA = LSAME( JOBU, 'A' ) WNTUS = LSAME( JOBU, 'S' ) WNTUAS = WNTUA .OR. WNTUS WNTUO = LSAME( JOBU, 'O' ) WNTUN = LSAME( JOBU, 'N' ) WNTVA = LSAME( JOBVT, 'A' ) WNTVS = LSAME( JOBVT, 'S' ) WNTVAS = WNTVA .OR. WNTVS WNTVO = LSAME( JOBVT, 'O' ) WNTVN = LSAME( JOBVT, 'N' ) MINWRK = 1 * IF( .NOT.( WNTUA .OR. WNTUS .OR. WNTUO .OR. WNTUN ) ) THEN INFO = -1 ELSE IF( .NOT.( WNTVA .OR. WNTVS .OR. WNTVO .OR. WNTVN ) .OR. $ ( WNTVO .AND. WNTUO ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -6 ELSE IF( LDU.LT.1 .OR. ( WNTUAS .AND. LDU.LT.M ) ) THEN INFO = -9 ELSE IF( LDVT.LT.1 .OR. ( WNTVA .AND. LDVT.LT.N ) .OR. $ ( WNTVS .AND. LDVT.LT.MINMN ) ) THEN INFO = -11 END IF * * Compute workspace * (Note: Comments in the code beginning "Workspace:" describe the * minimal amount of workspace needed at that point in the code, * as well as the preferred amount for good performance. * CWorkspace refers to complex workspace, and RWorkspace to * real workspace. NB refers to the optimal block size for the * immediately following subroutine, as returned by ILAENV.) * IF( INFO.EQ.0 .AND. LWORK.GE.1 .AND. M.GT.0 .AND. N.GT.0 ) THEN IF( M.GE.N ) THEN IF( M.GE.MNTHR ) THEN IF( WNTUN ) THEN * * Path 1 (M much larger than N, JOBU='N') * MAXWRK = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, $ -1 ) MAXWRK = MAX( MAXWRK, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) IF( WNTVO .OR. WNTVAS ) $ MAXWRK = MAX( MAXWRK, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MINWRK = 3*N ELSE IF( WNTUO .AND. WNTVN ) THEN * * Path 2 (M much larger than N, JOBU='O', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'ZUNGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = MAX( N*N+WRKBL, N*N+M*N ) MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUO .AND. WNTVAS ) THEN * * Path 3 (M much larger than N, JOBU='O', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'ZUNGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MAXWRK = MAX( N*N+WRKBL, N*N+M*N ) MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVN ) THEN * * Path 4 (M much larger than N, JOBU='S', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'ZUNGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) MAXWRK = N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVO ) THEN * * Path 5 (M much larger than N, JOBU='S', JOBVT='O') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'ZUNGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 5*N-4 ) MAXWRK = 2*N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUS .AND. WNTVAS ) THEN * * Path 6 (M much larger than N, JOBU='S', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+N*ILAENV( 1, 'ZUNGQR', ' ', M, $ N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MAXWRK = N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVN ) THEN * * Path 7 (M much larger than N, JOBU='A', JOBVT='N') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'ZUNGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) MAXWRK = N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVO ) THEN * * Path 8 (M much larger than N, JOBU='A', JOBVT='O') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'ZUNGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MAXWRK = 2*N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTUA .AND. WNTVAS ) THEN * * Path 9 (M much larger than N, JOBU='A', JOBVT='S' or * 'A') * WRKBL = N + N*ILAENV( 1, 'ZGEQRF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, N+M*ILAENV( 1, 'ZUNGQR', ' ', M, $ M, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+2*N* $ ILAENV( 1, 'ZGEBRD', ' ', N, N, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', N, N, N, -1 ) ) WRKBL = MAX( WRKBL, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MAXWRK = N*N + WRKBL MINWRK = 2*N + M MINWRK = MIN( MINWRK, MAXWRK ) END IF ELSE * * Path 10 (M at least N, but not much larger) * MAXWRK = 2*N + ( M+N )*ILAENV( 1, 'ZGEBRD', ' ', M, N, $ -1, -1 ) IF( WNTUS .OR. WNTUO ) $ MAXWRK = MAX( MAXWRK, 2*N+N* $ ILAENV( 1, 'ZUNGBR', 'Q', M, N, N, -1 ) ) IF( WNTUA ) $ MAXWRK = MAX( MAXWRK, 2*N+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, N, -1 ) ) IF( .NOT.WNTVN ) $ MAXWRK = MAX( MAXWRK, 2*N+( N-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, N, -1 ) ) MINWRK = 2*N + M END IF ELSE IF( N.GE.MNTHR ) THEN IF( WNTVN ) THEN * * Path 1t(N much larger than M, JOBVT='N') * MAXWRK = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, $ -1 ) MAXWRK = MAX( MAXWRK, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) IF( WNTUO .OR. WNTUAS ) $ MAXWRK = MAX( MAXWRK, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MINWRK = 3*M ELSE IF( WNTVO .AND. WNTUN ) THEN * * Path 2t(N much larger than M, JOBU='N', JOBVT='O') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'ZUNGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) MAXWRK = MAX( M*M+WRKBL, M*M+M*N ) MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVO .AND. WNTUAS ) THEN * * Path 3t(N much larger than M, JOBU='S' or 'A', * JOBVT='O') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'ZUNGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MAXWRK = MAX( M*M+WRKBL, M*M+M*N ) MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUN ) THEN * * Path 4t(N much larger than M, JOBU='N', JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'ZUNGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) MAXWRK = M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUO ) THEN * * Path 5t(N much larger than M, JOBU='O', JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'ZUNGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MAXWRK = 2*M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVS .AND. WNTUAS ) THEN * * Path 6t(N much larger than M, JOBU='S' or 'A', * JOBVT='S') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+M*ILAENV( 1, 'ZUNGLQ', ' ', M, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MAXWRK = M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUN ) THEN * * Path 7t(N much larger than M, JOBU='N', JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'ZUNGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) MAXWRK = M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUO ) THEN * * Path 8t(N much larger than M, JOBU='O', JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'ZUNGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MAXWRK = 2*M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) ELSE IF( WNTVA .AND. WNTUAS ) THEN * * Path 9t(N much larger than M, JOBU='S' or 'A', * JOBVT='A') * WRKBL = M + M*ILAENV( 1, 'ZGELQF', ' ', M, N, -1, -1 ) WRKBL = MAX( WRKBL, M+N*ILAENV( 1, 'ZUNGLQ', ' ', N, $ N, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+2*M* $ ILAENV( 1, 'ZGEBRD', ' ', M, M, -1, -1 ) ) WRKBL = MAX( WRKBL, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'P', M, M, M, -1 ) ) WRKBL = MAX( WRKBL, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MAXWRK = M*M + WRKBL MINWRK = 2*M + N MINWRK = MIN( MINWRK, MAXWRK ) END IF ELSE * * Path 10t(N greater than M, but not much larger) * MAXWRK = 2*M + ( M+N )*ILAENV( 1, 'ZGEBRD', ' ', M, N, $ -1, -1 ) IF( WNTVS .OR. WNTVO ) $ MAXWRK = MAX( MAXWRK, 2*M+M* $ ILAENV( 1, 'ZUNGBR', 'P', M, N, M, -1 ) ) IF( WNTVA ) $ MAXWRK = MAX( MAXWRK, 2*M+N* $ ILAENV( 1, 'ZUNGBR', 'P', N, N, M, -1 ) ) IF( .NOT.WNTUN ) $ MAXWRK = MAX( MAXWRK, 2*M+( M-1 )* $ ILAENV( 1, 'ZUNGBR', 'Q', M, M, M, -1 ) ) MINWRK = 2*M + N END IF END IF WORK( 1 ) = MAXWRK END IF * IF( LWORK.LT.MINWRK ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGESVD', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN IF( LWORK.GE.1 ) $ WORK( 1 ) = ONE RETURN END IF * * Get machine constants * EPS = DLAMCH( 'P' ) SMLNUM = SQRT( DLAMCH( 'S' ) ) / EPS BIGNUM = ONE / SMLNUM * * Scale A if max entry outside range [SMLNUM,BIGNUM] * ANRM = ZLANGE( 'M', M, N, A, LDA, DUM ) ISCL = 0 IF( ANRM.GT.ZERO .AND. ANRM.LT.SMLNUM ) THEN ISCL = 1 CALL ZLASCL( 'G', 0, 0, ANRM, SMLNUM, M, N, A, LDA, INFO ) ELSE IF( ANRM.GT.BIGNUM ) THEN ISCL = 1 CALL ZLASCL( 'G', 0, 0, ANRM, BIGNUM, M, N, A, LDA, INFO ) END IF * IF( M.GE.N ) THEN * * A has at least as many rows as columns. If A has sufficiently * more rows than columns, first reduce using the QR * decomposition (if sufficient workspace available) * IF( M.GE.MNTHR ) THEN * IF( WNTUN ) THEN * * Path 1 (M much larger than N, JOBU='N') * No left singular vectors to be computed * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: need 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Zero out below R * CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, A( 2, 1 ), $ LDA ) IE = 1 ITAUQ = 1 ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) NCVT = 0 IF( WNTVO .OR. WNTVAS ) THEN * * If right singular vectors desired, generate P'. * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) NCVT = N END IF IRWORK = IE + N * * Perform bidiagonal QR iteration, computing right * singular vectors of A in A if desired * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, NCVT, 0, 0, S, RWORK( IE ), A, LDA, $ CDUM, 1, CDUM, 1, RWORK( IRWORK ), INFO ) * * If right singular vectors desired in VT, copy them there * IF( WNTVAS ) $ CALL ZLACPY( 'F', N, N, A, LDA, VT, LDVT ) * ELSE IF( WNTUO .AND. WNTVN ) THEN * * Path 2 (M much larger than N, JOBU='O', JOBVT='N') * N left singular vectors to be overwritten on A and * no right singular vectors to be computed * IF( LWORK.GE.N*N+3*N ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*N ) THEN * * WORK(IU) is LDA by N, WORK(IR) is LDA by N * LDWRKU = LDA LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+N*N ) THEN * * WORK(IU) is LDA by N, WORK(IR) is N by N * LDWRKU = LDA LDWRKR = N ELSE * * WORK(IU) is LDWRKU by N, WORK(IR) is N by N * LDWRKU = ( LWORK-N*N ) / N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IR) and zero out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IR ), LDWRKR ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IR+1 ), LDWRKR ) * * Generate Q in A * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IR ), LDWRKR, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing R * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: need 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, N, 0, S, RWORK( IE ), CDUM, 1, $ WORK( IR ), LDWRKR, CDUM, 1, $ RWORK( IRWORK ), INFO ) IU = ITAUQ * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in WORK(IU) and copying to A * (CWorkspace: need N*N+N, prefer N*N+M*N) * (RWorkspace: 0) * DO 10 I = 1, M, LDWRKU CHUNK = MIN( M-I+1, LDWRKU ) CALL ZGEMM( 'N', 'N', CHUNK, N, N, CONE, A( I, 1 ), $ LDA, WORK( IR ), LDWRKR, CZERO, $ WORK( IU ), LDWRKU ) CALL ZLACPY( 'F', CHUNK, N, WORK( IU ), LDWRKU, $ A( I, 1 ), LDA ) 10 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize A * (CWorkspace: need 2*N+M, prefer 2*N+(M+N)*NB) * (RWorkspace: N) * CALL ZGEBRD( M, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing A * (CWorkspace: need 3*N, prefer 2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, N, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A * (CWorkspace: need 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, M, 0, S, RWORK( IE ), CDUM, 1, $ A, LDA, CDUM, 1, RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTUO .AND. WNTVAS ) THEN * * Path 3 (M much larger than N, JOBU='O', JOBVT='S' or 'A') * N left singular vectors to be overwritten on A and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+3*N ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+N*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA LDWRKR = N ELSE * * WORK(IU) is LDWRKU by N and WORK(IR) is N by N * LDWRKU = ( LWORK-N*N ) / N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, VT( 2, 1 ), $ LDVT ) * * Generate Q in A * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT, copying result to WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, VT, LDVT, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', N, N, VT, LDVT, WORK( IR ), LDWRKR ) * * Generate left vectors bidiagonalizing R in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in VT * (CWorkspace: need N*N+3*N-1, prefer N*N+2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) and computing right * singular vectors of R in VT * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, N, 0, S, RWORK( IE ), VT, $ LDVT, WORK( IR ), LDWRKR, CDUM, 1, $ RWORK( IRWORK ), INFO ) IU = ITAUQ * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in WORK(IU) and copying to A * (CWorkspace: need N*N+N, prefer N*N+M*N) * (RWorkspace: 0) * DO 20 I = 1, M, LDWRKU CHUNK = MIN( M-I+1, LDWRKU ) CALL ZGEMM( 'N', 'N', CHUNK, N, N, CONE, A( I, 1 ), $ LDA, WORK( IR ), LDWRKR, CZERO, $ WORK( IU ), LDWRKU ) CALL ZLACPY( 'F', CHUNK, N, WORK( IU ), LDWRKU, $ A( I, 1 ), LDA ) 20 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, VT( 2, 1 ), $ LDVT ) * * Generate Q in A * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: N) * CALL ZGEBRD( N, N, VT, LDVT, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in A by left vectors bidiagonalizing R * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), A, LDA, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in VT * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, M, 0, S, RWORK( IE ), VT, $ LDVT, A, LDA, CDUM, 1, RWORK( IRWORK ), $ INFO ) * END IF * ELSE IF( WNTUS ) THEN * IF( WNTVN ) THEN * * Path 4 (M much larger than N, JOBU='S', JOBVT='N') * N left singular vectors to be computed in U and * no right singular vectors to be computed * IF( LWORK.GE.N*N+3*N ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IR) is LDA by N * LDWRKR = LDA ELSE * * WORK(IR) is N by N * LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IR), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IR ), $ LDWRKR ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IR+1 ), LDWRKR ) * * Generate Q in A * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IR ), LDWRKR, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing R in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, N, 0, S, RWORK( IE ), CDUM, $ 1, WORK( IR ), LDWRKR, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IR), storing result in U * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, A, LDA, $ WORK( IR ), LDWRKR, CZERO, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ A( 2, 1 ), LDA ) * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left vectors bidiagonalizing R * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, M, 0, S, RWORK( IE ), CDUM, $ 1, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * END IF * ELSE IF( WNTVO ) THEN * * Path 5 (M much larger than N, JOBU='S', JOBVT='O') * N left singular vectors to be computed in U and * N right singular vectors to be overwritten on A * IF( LWORK.GE.2*N*N+3*N ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+N )*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = N ELSE * * WORK(IU) is N by N and WORK(IR) is N by N * LDWRKU = N IR = IU + LDWRKU*N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IU+1 ), LDWRKU ) * * Generate Q in A * (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to * WORK(IR) * (CWorkspace: need 2*N*N+3*N, * prefer 2*N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', N, N, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate left bidiagonalizing vectors in WORK(IU) * (CWorkspace: need 2*N*N+3*N, prefer 2*N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (CWorkspace: need 2*N*N+3*N-1, * prefer 2*N*N+2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in WORK(IR) * (CWorkspace: need 2*N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, N, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, WORK( IU ), $ LDWRKU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IU), storing result in U * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, A, LDA, $ WORK( IU ), LDWRKU, CZERO, U, LDU ) * * Copy right singular vectors of R to A * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZLACPY( 'F', N, N, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ A( 2, 1 ), LDA ) * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left vectors bidiagonalizing R * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing R in A * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, M, 0, S, RWORK( IE ), A, $ LDA, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * END IF * ELSE IF( WNTVAS ) THEN * * Path 6 (M much larger than N, JOBU='S', JOBVT='S' * or 'A') * N left singular vectors to be computed in U and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+3*N ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is N by N * LDWRKU = N END IF ITAU = IU + LDWRKU*N IWORK = ITAU + N * * Compute A=Q*R * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IU+1 ), LDWRKU ) * * Generate Q in A * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to VT * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', N, N, WORK( IU ), LDWRKU, VT, $ LDVT ) * * Generate left bidiagonalizing vectors in WORK(IU) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (CWorkspace: need N*N+3*N-1, * prefer N*N+2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in VT * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, N, 0, S, RWORK( IE ), VT, $ LDVT, WORK( IU ), LDWRKU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply Q in A by left singular vectors of R in * WORK(IU), storing result in U * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, A, LDA, $ WORK( IU ), LDWRKU, CZERO, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, N, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to VT, zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ VT( 2, 1 ), LDVT ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, VT, LDVT, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in VT * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, M, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * END IF * ELSE IF( WNTUA ) THEN * IF( WNTVN ) THEN * * Path 7 (M much larger than N, JOBU='A', JOBVT='N') * M left singular vectors to be computed in U and * no right singular vectors to be computed * IF( LWORK.GE.N*N+MAX( N+M, 3*N ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IR) is LDA by N * LDWRKR = LDA ELSE * * WORK(IR) is N by N * LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Copy R to WORK(IR), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IR ), $ LDWRKR ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IR+1 ), LDWRKR ) * * Generate Q in U * (CWorkspace: need N*N+N+M, prefer N*N+N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IR ), LDWRKR, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IR) * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, N, 0, S, RWORK( IE ), CDUM, $ 1, WORK( IR ), LDWRKR, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IR), storing result in A * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, U, LDU, $ WORK( IR ), LDWRKR, CZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL ZLACPY( 'F', M, N, A, LDA, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need N+M, prefer N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ A( 2, 1 ), LDA ) * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in A * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, 0, M, 0, S, RWORK( IE ), CDUM, $ 1, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * END IF * ELSE IF( WNTVO ) THEN * * Path 8 (M much larger than N, JOBU='A', JOBVT='O') * M left singular vectors to be computed in U and * N right singular vectors to be overwritten on A * IF( LWORK.GE.2*N*N+MAX( N+M, 3*N ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+N )*N ) THEN * * WORK(IU) is LDA by N and WORK(IR) is N by N * LDWRKU = LDA IR = IU + LDWRKU*N LDWRKR = N ELSE * * WORK(IU) is N by N and WORK(IR) is N by N * LDWRKU = N IR = IU + LDWRKU*N LDWRKR = N END IF ITAU = IR + LDWRKR*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N*N+2*N, prefer 2*N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need 2*N*N+N+M, prefer 2*N*N+N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IU+1 ), LDWRKU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to * WORK(IR) * (CWorkspace: need 2*N*N+3*N, * prefer 2*N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', N, N, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate left bidiagonalizing vectors in WORK(IU) * (CWorkspace: need 2*N*N+3*N, prefer 2*N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (CWorkspace: need 2*N*N+3*N-1, * prefer 2*N*N+2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in WORK(IR) * (CWorkspace: need 2*N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, N, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, WORK( IU ), $ LDWRKU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IU), storing result in A * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, U, LDU, $ WORK( IU ), LDWRKU, CZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL ZLACPY( 'F', M, N, A, LDA, U, LDU ) * * Copy right singular vectors of R from WORK(IR) to A * CALL ZLACPY( 'F', N, N, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need N+M, prefer N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Zero out below R in A * CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ A( 2, 1 ), LDA ) * * Bidiagonalize R in A * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in A * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, A, LDA, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in A * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, M, 0, S, RWORK( IE ), A, $ LDA, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) * END IF * ELSE IF( WNTVAS ) THEN * * Path 9 (M much larger than N, JOBU='A', JOBVT='S' * or 'A') * M left singular vectors to be computed in U and * N right singular vectors to be computed in VT * IF( LWORK.GE.N*N+MAX( N+M, 3*N ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*N ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is N by N * LDWRKU = N END IF ITAU = IU + LDWRKU*N IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need N*N+2*N, prefer N*N+N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need N*N+N+M, prefer N*N+N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R to WORK(IU), zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ WORK( IU+1 ), LDWRKU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in WORK(IU), copying result to VT * (CWorkspace: need N*N+3*N, prefer N*N+2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', N, N, WORK( IU ), LDWRKU, VT, $ LDVT ) * * Generate left bidiagonalizing vectors in WORK(IU) * (CWorkspace: need N*N+3*N, prefer N*N+2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', N, N, N, WORK( IU ), LDWRKU, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (CWorkspace: need N*N+3*N-1, * prefer N*N+2*N+(N-1)*NB) * (RWorkspace: need 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of R in WORK(IU) and computing * right singular vectors of R in VT * (CWorkspace: need N*N) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, N, 0, S, RWORK( IE ), VT, $ LDVT, WORK( IU ), LDWRKU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply Q in U by left singular vectors of R in * WORK(IU), storing result in A * (CWorkspace: need N*N) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, N, CONE, U, LDU, $ WORK( IU ), LDWRKU, CZERO, A, LDA ) * * Copy left singular vectors of A from A to U * CALL ZLACPY( 'F', M, N, A, LDA, U, LDU ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + N * * Compute A=Q*R, copying result to U * (CWorkspace: need 2*N, prefer N+N*NB) * (RWorkspace: 0) * CALL ZGEQRF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) * * Generate Q in U * (CWorkspace: need N+M, prefer N+M*NB) * (RWorkspace: 0) * CALL ZUNGQR( M, M, N, U, LDU, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy R from A to VT, zeroing out below it * CALL ZLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL ZLASET( 'L', N-1, N-1, CZERO, CZERO, $ VT( 2, 1 ), LDVT ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize R in VT * (CWorkspace: need 3*N, prefer 2*N+2*N*NB) * (RWorkspace: need N) * CALL ZGEBRD( N, N, VT, LDVT, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply Q in U by left bidiagonalizing vectors * in VT * (CWorkspace: need 2*N+M, prefer 2*N+M*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'Q', 'R', 'N', M, N, N, VT, LDVT, $ WORK( ITAUQ ), U, LDU, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in VT * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + N * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, N, M, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * END IF * END IF * ELSE * * M .LT. MNTHR * * Path 10 (M at least N, but not much larger) * Reduce to bidiagonal form without QR decomposition * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + N IWORK = ITAUP + N * * Bidiagonalize A * (CWorkspace: need 2*N+M, prefer 2*N+(M+N)*NB) * (RWorkspace: need N) * CALL ZGEBRD( M, N, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUAS ) THEN * * If left singular vectors desired in U, copy result to U * and generate left bidiagonalizing vectors in U * (CWorkspace: need 2*N+NCU, prefer 2*N+NCU*NB) * (RWorkspace: 0) * CALL ZLACPY( 'L', M, N, A, LDA, U, LDU ) IF( WNTUS ) $ NCU = N IF( WNTUA ) $ NCU = M CALL ZUNGBR( 'Q', M, NCU, N, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVAS ) THEN * * If right singular vectors desired in VT, copy result to * VT and generate right bidiagonalizing vectors in VT * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZLACPY( 'U', N, N, A, LDA, VT, LDVT ) CALL ZUNGBR( 'P', N, N, N, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTUO ) THEN * * If left singular vectors desired in A, generate left * bidiagonalizing vectors in A * (CWorkspace: need 3*N, prefer 2*N+N*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, N, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVO ) THEN * * If right singular vectors desired in A, generate right * bidiagonalizing vectors in A * (CWorkspace: need 3*N-1, prefer 2*N+(N-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', N, N, N, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IRWORK = IE + N IF( WNTUAS .OR. WNTUO ) $ NRU = M IF( WNTUN ) $ NRU = 0 IF( WNTVAS .OR. WNTVO ) $ NCVT = N IF( WNTVN ) $ NCVT = 0 IF( ( .NOT.WNTUO ) .AND. ( .NOT.WNTVO ) ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in VT * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, NCVT, NRU, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) ELSE IF( ( .NOT.WNTUO ) .AND. WNTVO ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in A * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, NCVT, NRU, 0, S, RWORK( IE ), A, $ LDA, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) ELSE * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in A and computing right singular * vectors in VT * (CWorkspace: 0) * (RWorkspace: need 5*N-4) * CALL ZBDSQR( 'U', N, NCVT, NRU, 0, S, RWORK( IE ), VT, $ LDVT, A, LDA, CDUM, 1, RWORK( IRWORK ), $ INFO ) END IF * END IF * ELSE * * A has more columns than rows. If A has sufficiently more * columns than rows, first reduce using the LQ decomposition (if * sufficient workspace available) * IF( N.GE.MNTHR ) THEN * IF( WNTVN ) THEN * * Path 1t(N much larger than M, JOBVT='N') * No right singular vectors to be computed * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Zero out above L * CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, A( 1, 2 ), $ LDA ) IE = 1 ITAUQ = 1 ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in A * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUO .OR. WNTUAS ) THEN * * If left singular vectors desired, generate Q * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IRWORK = IE + M NRU = 0 IF( WNTUO .OR. WNTUAS ) $ NRU = M * * Perform bidiagonal QR iteration, computing left singular * vectors of A in A if desired * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, 0, NRU, 0, S, RWORK( IE ), CDUM, 1, $ A, LDA, CDUM, 1, RWORK( IRWORK ), INFO ) * * If left singular vectors desired in U, copy them there * IF( WNTUAS ) $ CALL ZLACPY( 'F', M, M, A, LDA, U, LDU ) * ELSE IF( WNTVO .AND. WNTUN ) THEN * * Path 2t(N much larger than M, JOBU='N', JOBVT='O') * M right singular vectors to be overwritten on A and * no left singular vectors to be computed * IF( LWORK.GE.M*M+3*M ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by M * LDWRKU = LDA CHUNK = N LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+M*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is M by M * LDWRKU = LDA CHUNK = N LDWRKR = M ELSE * * WORK(IU) is M by CHUNK and WORK(IR) is M by M * LDWRKU = M CHUNK = ( LWORK-M*M ) / M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IR) and zero out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IR ), LDWRKR ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in A * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IR ), LDWRKR, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing L * (CWorkspace: need M*M+3*M-1, prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, 0, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, CDUM, 1, CDUM, 1, $ RWORK( IRWORK ), INFO ) IU = ITAUQ * * Multiply right singular vectors of L in WORK(IR) by Q * in A, storing result in WORK(IU) and copying to A * (CWorkspace: need M*M+M, prefer M*M+M*N) * (RWorkspace: 0) * DO 30 I = 1, N, CHUNK BLK = MIN( N-I+1, CHUNK ) CALL ZGEMM( 'N', 'N', M, BLK, M, CONE, WORK( IR ), $ LDWRKR, A( 1, I ), LDA, CZERO, $ WORK( IU ), LDWRKU ) CALL ZLACPY( 'F', M, BLK, WORK( IU ), LDWRKU, $ A( 1, I ), LDA ) 30 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (CWorkspace: need 2*M+N, prefer 2*M+(M+N)*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, N, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing A * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in A * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'L', M, N, 0, 0, S, RWORK( IE ), A, LDA, $ CDUM, 1, CDUM, 1, RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTVO .AND. WNTUAS ) THEN * * Path 3t(N much larger than M, JOBU='S' or 'A', JOBVT='O') * M right singular vectors to be overwritten on A and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+3*M ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.MAX( WRKBL, LDA*N )+LDA*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is LDA by M * LDWRKU = LDA CHUNK = N LDWRKR = LDA ELSE IF( LWORK.GE.MAX( WRKBL, LDA*N )+M*M ) THEN * * WORK(IU) is LDA by N and WORK(IR) is M by M * LDWRKU = LDA CHUNK = N LDWRKR = M ELSE * * WORK(IU) is M by CHUNK and WORK(IR) is M by M * LDWRKU = M CHUNK = ( LWORK-M*M ) / M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing about above it * CALL ZLACPY( 'L', M, M, A, LDA, U, LDU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, U( 1, 2 ), $ LDU ) * * Generate Q in A * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U, copying result to WORK(IR) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, U, LDU, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, M, U, LDU, WORK( IR ), LDWRKR ) * * Generate right vectors bidiagonalizing L in WORK(IR) * (CWorkspace: need M*M+3*M-1, prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing L in U * (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U, and computing right * singular vectors of L in WORK(IR) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, M, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) IU = ITAUQ * * Multiply right singular vectors of L in WORK(IR) by Q * in A, storing result in WORK(IU) and copying to A * (CWorkspace: need M*M+M, prefer M*M+M*N)) * (RWorkspace: 0) * DO 40 I = 1, N, CHUNK BLK = MIN( N-I+1, CHUNK ) CALL ZGEMM( 'N', 'N', M, BLK, M, CONE, WORK( IR ), $ LDWRKR, A( 1, I ), LDA, CZERO, $ WORK( IU ), LDWRKU ) CALL ZLACPY( 'F', M, BLK, WORK( IU ), LDWRKU, $ A( 1, I ), LDA ) 40 CONTINUE * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, U, LDU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, U( 1, 2 ), $ LDU ) * * Generate Q in A * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, U, LDU, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in A * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, U, LDU, $ WORK( ITAUP ), A, LDA, WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left vectors bidiagonalizing L in U * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in A * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, M, 0, S, RWORK( IE ), A, LDA, $ U, LDU, CDUM, 1, RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTVS ) THEN * IF( WNTUN ) THEN * * Path 4t(N much larger than M, JOBU='N', JOBVT='S') * M right singular vectors to be computed in VT and * no left singular vectors to be computed * IF( LWORK.GE.M*M+3*M ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IR) is LDA by M * LDWRKR = LDA ELSE * * WORK(IR) is M by M * LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IR), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IR ), $ LDWRKR ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in A * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IR ), LDWRKR, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right vectors bidiagonalizing L in * WORK(IR) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, 0, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, CDUM, 1, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IR) by * Q in A, storing result in VT * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IR ), $ LDWRKR, A, LDA, CZERO, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy result to VT * CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ A( 1, 2 ), LDA ) * * Bidiagonalize L in A * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, 0, 0, S, RWORK( IE ), VT, $ LDVT, CDUM, 1, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTUO ) THEN * * Path 5t(N much larger than M, JOBU='O', JOBVT='S') * M right singular vectors to be computed in VT and * M left singular vectors to be overwritten on A * IF( LWORK.GE.2*M*M+3*M ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is LDA by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+M )*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is M by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = M ELSE * * WORK(IU) is M by M and WORK(IR) is M by M * LDWRKU = M IR = IU + LDWRKU*M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out below it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IU+LDWRKU ), LDWRKU ) * * Generate Q in A * (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to * WORK(IR) * (CWorkspace: need 2*M*M+3*M, * prefer 2*M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, M, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate right bidiagonalizing vectors in WORK(IU) * (CWorkspace: need 2*M*M+3*M-1, * prefer 2*M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (CWorkspace: need 2*M*M+3*M, prefer 2*M*M+2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in WORK(IR) and computing * right singular vectors of L in WORK(IU) * (CWorkspace: need 2*M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, M, 0, S, RWORK( IE ), $ WORK( IU ), LDWRKU, WORK( IR ), $ LDWRKR, CDUM, 1, RWORK( IRWORK ), $ INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in A, storing result in VT * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IU ), $ LDWRKU, A, LDA, CZERO, VT, LDVT ) * * Copy left singular vectors of L to A * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZLACPY( 'F', M, M, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ A( 1, 2 ), LDA ) * * Bidiagonalize L in A * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right vectors bidiagonalizing L by Q in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors of L in A * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, M, 0, S, RWORK( IE ), VT, $ LDVT, A, LDA, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTUAS ) THEN * * Path 6t(N much larger than M, JOBU='S' or 'A', * JOBVT='S') * M right singular vectors to be computed in VT and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+3*M ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IU) is LDA by N * LDWRKU = LDA ELSE * * WORK(IU) is LDA by M * LDWRKU = M END IF ITAU = IU + LDWRKU*M IWORK = ITAU + M * * Compute A=L*Q * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IU+LDWRKU ), LDWRKU ) * * Generate Q in A * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to U * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, M, WORK( IU ), LDWRKU, U, $ LDU ) * * Generate right bidiagonalizing vectors in WORK(IU) * (CWorkspace: need M*M+3*M-1, * prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U and computing right * singular vectors of L in WORK(IU) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, M, 0, S, RWORK( IE ), $ WORK( IU ), LDWRKU, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in A, storing result in VT * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IU ), $ LDWRKU, A, LDA, CZERO, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZUNGLQ( M, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, U, LDU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ U( 1, 2 ), LDU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, U, LDU, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in U by Q * in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, U, LDU, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, M, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * END IF * ELSE IF( WNTVA ) THEN * IF( WNTUN ) THEN * * Path 7t(N much larger than M, JOBU='N', JOBVT='A') * N right singular vectors to be computed in VT and * no left singular vectors to be computed * IF( LWORK.GE.M*M+MAX( N+M, 3*M ) ) THEN * * Sufficient workspace for a fast algorithm * IR = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IR) is LDA by M * LDWRKR = LDA ELSE * * WORK(IR) is M by M * LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Copy L to WORK(IR), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IR ), $ LDWRKR ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IR+LDWRKR ), LDWRKR ) * * Generate Q in VT * (CWorkspace: need M*M+M+N, prefer M*M+M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IR) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IR ), LDWRKR, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate right bidiagonalizing vectors in WORK(IR) * (CWorkspace: need M*M+3*M-1, * prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of L in WORK(IR) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, 0, 0, S, RWORK( IE ), $ WORK( IR ), LDWRKR, CDUM, 1, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IR) by * Q in VT, storing result in A * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IR ), $ LDWRKR, VT, LDVT, CZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL ZLACPY( 'F', M, N, A, LDA, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need M+N, prefer M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ A( 1, 2 ), LDA ) * * Bidiagonalize L in A * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in A by Q * in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, 0, 0, S, RWORK( IE ), VT, $ LDVT, CDUM, 1, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTUO ) THEN * * Path 8t(N much larger than M, JOBU='O', JOBVT='A') * N right singular vectors to be computed in VT and * M left singular vectors to be overwritten on A * IF( LWORK.GE.2*M*M+MAX( N+M, 3*M ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+2*LDA*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is LDA by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = LDA ELSE IF( LWORK.GE.WRKBL+( LDA+M )*M ) THEN * * WORK(IU) is LDA by M and WORK(IR) is M by M * LDWRKU = LDA IR = IU + LDWRKU*M LDWRKR = M ELSE * * WORK(IU) is M by M and WORK(IR) is M by M * LDWRKU = M IR = IU + LDWRKU*M LDWRKR = M END IF ITAU = IR + LDWRKR*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M*M+2*M, prefer 2*M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need 2*M*M+M+N, prefer 2*M*M+M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IU+LDWRKU ), LDWRKU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to * WORK(IR) * (CWorkspace: need 2*M*M+3*M, * prefer 2*M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, M, WORK( IU ), LDWRKU, $ WORK( IR ), LDWRKR ) * * Generate right bidiagonalizing vectors in WORK(IU) * (CWorkspace: need 2*M*M+3*M-1, * prefer 2*M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in WORK(IR) * (CWorkspace: need 2*M*M+3*M, prefer 2*M*M+2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, WORK( IR ), LDWRKR, $ WORK( ITAUQ ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in WORK(IR) and computing * right singular vectors of L in WORK(IU) * (CWorkspace: need 2*M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, M, 0, S, RWORK( IE ), $ WORK( IU ), LDWRKU, WORK( IR ), $ LDWRKR, CDUM, 1, RWORK( IRWORK ), $ INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in VT, storing result in A * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IU ), $ LDWRKU, VT, LDVT, CZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL ZLACPY( 'F', M, N, A, LDA, VT, LDVT ) * * Copy left singular vectors of A from WORK(IR) to A * CALL ZLACPY( 'F', M, M, WORK( IR ), LDWRKR, A, $ LDA ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need M+N, prefer M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Zero out above L in A * CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ A( 1, 2 ), LDA ) * * Bidiagonalize L in A * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, A, LDA, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in A by Q * in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, A, LDA, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in A * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in A and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, M, 0, S, RWORK( IE ), VT, $ LDVT, A, LDA, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * ELSE IF( WNTUAS ) THEN * * Path 9t(N much larger than M, JOBU='S' or 'A', * JOBVT='A') * N right singular vectors to be computed in VT and * M left singular vectors to be computed in U * IF( LWORK.GE.M*M+MAX( N+M, 3*M ) ) THEN * * Sufficient workspace for a fast algorithm * IU = 1 IF( LWORK.GE.WRKBL+LDA*M ) THEN * * WORK(IU) is LDA by M * LDWRKU = LDA ELSE * * WORK(IU) is M by M * LDWRKU = M END IF ITAU = IU + LDWRKU*M IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need M*M+2*M, prefer M*M+M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need M*M+M+N, prefer M*M+M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to WORK(IU), zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, WORK( IU ), $ LDWRKU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ WORK( IU+LDWRKU ), LDWRKU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in WORK(IU), copying result to U * (CWorkspace: need M*M+3*M, prefer M*M+2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, WORK( IU ), LDWRKU, S, $ RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) CALL ZLACPY( 'L', M, M, WORK( IU ), LDWRKU, U, $ LDU ) * * Generate right bidiagonalizing vectors in WORK(IU) * (CWorkspace: need M*M+3*M, prefer M*M+2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, M, M, WORK( IU ), LDWRKU, $ WORK( ITAUP ), WORK( IWORK ), $ LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (CWorkspace: need M*M+3*M, prefer M*M+2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of L in U and computing right * singular vectors of L in WORK(IU) * (CWorkspace: need M*M) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, M, M, 0, S, RWORK( IE ), $ WORK( IU ), LDWRKU, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * * Multiply right singular vectors of L in WORK(IU) by * Q in VT, storing result in A * (CWorkspace: need M*M) * (RWorkspace: 0) * CALL ZGEMM( 'N', 'N', M, N, M, CONE, WORK( IU ), $ LDWRKU, VT, LDVT, CZERO, A, LDA ) * * Copy right singular vectors of A from A to VT * CALL ZLACPY( 'F', M, N, A, LDA, VT, LDVT ) * ELSE * * Insufficient workspace for a fast algorithm * ITAU = 1 IWORK = ITAU + M * * Compute A=L*Q, copying result to VT * (CWorkspace: need 2*M, prefer M+M*NB) * (RWorkspace: 0) * CALL ZGELQF( M, N, A, LDA, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) * * Generate Q in VT * (CWorkspace: need M+N, prefer M+N*NB) * (RWorkspace: 0) * CALL ZUNGLQ( N, N, M, VT, LDVT, WORK( ITAU ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Copy L to U, zeroing out above it * CALL ZLACPY( 'L', M, M, A, LDA, U, LDU ) CALL ZLASET( 'U', M-1, M-1, CZERO, CZERO, $ U( 1, 2 ), LDU ) IE = 1 ITAUQ = ITAU ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize L in U * (CWorkspace: need 3*M, prefer 2*M+2*M*NB) * (RWorkspace: need M) * CALL ZGEBRD( M, M, U, LDU, S, RWORK( IE ), $ WORK( ITAUQ ), WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Multiply right bidiagonalizing vectors in U by Q * in VT * (CWorkspace: need 2*M+N, prefer 2*M+N*NB) * (RWorkspace: 0) * CALL ZUNMBR( 'P', 'L', 'C', M, N, M, U, LDU, $ WORK( ITAUP ), VT, LDVT, $ WORK( IWORK ), LWORK-IWORK+1, INFO ) * * Generate left bidiagonalizing vectors in U * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, M, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) IRWORK = IE + M * * Perform bidiagonal QR iteration, computing left * singular vectors of A in U and computing right * singular vectors of A in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'U', M, N, M, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, $ RWORK( IRWORK ), INFO ) * END IF * END IF * END IF * ELSE * * N .LT. MNTHR * * Path 10t(N greater than M, but not much larger) * Reduce to bidiagonal form without LQ decomposition * IE = 1 ITAUQ = 1 ITAUP = ITAUQ + M IWORK = ITAUP + M * * Bidiagonalize A * (CWorkspace: need 2*M+N, prefer 2*M+(M+N)*NB) * (RWorkspace: M) * CALL ZGEBRD( M, N, A, LDA, S, RWORK( IE ), WORK( ITAUQ ), $ WORK( ITAUP ), WORK( IWORK ), LWORK-IWORK+1, $ INFO ) IF( WNTUAS ) THEN * * If left singular vectors desired in U, copy result to U * and generate left bidiagonalizing vectors in U * (CWorkspace: need 3*M-1, prefer 2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZLACPY( 'L', M, M, A, LDA, U, LDU ) CALL ZUNGBR( 'Q', M, M, N, U, LDU, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVAS ) THEN * * If right singular vectors desired in VT, copy result to * VT and generate right bidiagonalizing vectors in VT * (CWorkspace: need 2*M+NRVT, prefer 2*M+NRVT*NB) * (RWorkspace: 0) * CALL ZLACPY( 'U', M, N, A, LDA, VT, LDVT ) IF( WNTVA ) $ NRVT = N IF( WNTVS ) $ NRVT = M CALL ZUNGBR( 'P', NRVT, N, M, VT, LDVT, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTUO ) THEN * * If left singular vectors desired in A, generate left * bidiagonalizing vectors in A * (CWorkspace: need 3*M-1, prefer 2*M+(M-1)*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'Q', M, M, N, A, LDA, WORK( ITAUQ ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IF( WNTVO ) THEN * * If right singular vectors desired in A, generate right * bidiagonalizing vectors in A * (CWorkspace: need 3*M, prefer 2*M+M*NB) * (RWorkspace: 0) * CALL ZUNGBR( 'P', M, N, M, A, LDA, WORK( ITAUP ), $ WORK( IWORK ), LWORK-IWORK+1, INFO ) END IF IRWORK = IE + M IF( WNTUAS .OR. WNTUO ) $ NRU = M IF( WNTUN ) $ NRU = 0 IF( WNTVAS .OR. WNTVO ) $ NCVT = N IF( WNTVN ) $ NCVT = 0 IF( ( .NOT.WNTUO ) .AND. ( .NOT.WNTVO ) ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'L', M, NCVT, NRU, 0, S, RWORK( IE ), VT, $ LDVT, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) ELSE IF( ( .NOT.WNTUO ) .AND. WNTVO ) THEN * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in U and computing right singular * vectors in A * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'L', M, NCVT, NRU, 0, S, RWORK( IE ), A, $ LDA, U, LDU, CDUM, 1, RWORK( IRWORK ), $ INFO ) ELSE * * Perform bidiagonal QR iteration, if desired, computing * left singular vectors in A and computing right singular * vectors in VT * (CWorkspace: 0) * (RWorkspace: need 5*M-4) * CALL ZBDSQR( 'L', M, NCVT, NRU, 0, S, RWORK( IE ), VT, $ LDVT, A, LDA, CDUM, 1, RWORK( IRWORK ), $ INFO ) END IF * END IF * END IF * * Undo scaling if necessary * IF( ISCL.EQ.1 ) THEN IF( ANRM.GT.BIGNUM ) $ CALL DLASCL( 'G', 0, 0, BIGNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) IF( ANRM.LT.SMLNUM ) $ CALL DLASCL( 'G', 0, 0, SMLNUM, ANRM, MINMN, 1, S, MINMN, $ INFO ) END IF * * Return optimal workspace in WORK(1) * WORK( 1 ) = MAXWRK * RETURN * * End of ZGESVD * END octave-1.1.0/libcruft/lapack/zgetf2.f100666 415 17 7340 5310240742 15555 0ustar jweusers SUBROUTINE ZGETF2( M, N, A, LDA, IPIV, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER IPIV( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZGETF2 computes an LU factorization of a general m-by-n matrix A * using partial pivoting with row interchanges. * * The factorization has the form * A = P * L * U * where P is a permutation matrix, L is lower triangular with unit * diagonal elements (lower trapezoidal if m > n), and U is upper * triangular (upper trapezoidal if m < n). * * This is the right-looking Level 2 BLAS version of the algorithm. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix to be factored. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * IPIV (output) INTEGER array, dimension (min(M,N)) * The pivot indices; for 1 <= i <= min(M,N), row i of the * matrix was interchanged with row IPIV(i). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, and division by zero will occur if it is used * to solve a system of equations. * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER J, JP * .. * .. External Functions .. INTEGER IZAMAX EXTERNAL IZAMAX * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGERU, ZSCAL, ZSWAP * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGETF2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * DO 10 J = 1, MIN( M, N ) * * Find pivot and test for singularity. * JP = J - 1 + IZAMAX( M-J+1, A( J, J ), 1 ) IPIV( J ) = JP IF( A( JP, J ).NE.ZERO ) THEN * * Apply the interchange to columns 1:N. * IF( JP.NE.J ) $ CALL ZSWAP( N, A( J, 1 ), LDA, A( JP, 1 ), LDA ) * * Compute elements J+1:M of J-th column. * IF( J.LT.M ) $ CALL ZSCAL( M-J, ONE / A( J, J ), A( J+1, J ), 1 ) * ELSE IF( INFO.EQ.0 ) THEN * INFO = J END IF * IF( J.LT.MIN( M, N ) ) THEN * * Update trailing submatrix. * CALL ZGERU( M-J, N-J, -ONE, A( J+1, J ), 1, A( J, J+1 ), $ LDA, A( J+1, J+1 ), LDA ) END IF 10 CONTINUE RETURN * * End of ZGETF2 * END octave-1.1.0/libcruft/lapack/zgetrf.f100666 415 17 11166 5310240645 15700 0ustar jweusers SUBROUTINE ZGETRF( M, N, A, LDA, IPIV, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, LDA, M, N * .. * .. Array Arguments .. INTEGER IPIV( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZGETRF computes an LU factorization of a general m-by-n matrix A * using partial pivoting with row interchanges. * * The factorization has the form * A = P * L * U * where P is a permutation matrix, L is lower triangular with unit * diagonal elements (lower trapezoidal if m > n), and U is upper * triangular (upper trapezoidal if m < n). * * This is the right-looking Level 3 BLAS version of the algorithm. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix to be factored. * On exit, the factors L and U from the factorization * A = P*L*U; the unit diagonal elements of L are not stored. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * IPIV (output) INTEGER array, dimension (min(M,N)) * The pivot indices; for 1 <= i <= min(M,N), row i of the * matrix was interchanged with row IPIV(i). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, U(k,k) is exactly zero. The factorization * has been completed, but the factor U is exactly * singular, and division by zero will occur if it is used * to solve a system of equations. * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, JB, NB * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEMM, ZGETF2, ZLASWP, ZTRSM * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGETRF', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * * Determine the block size for this environment. * NB = ILAENV( 1, 'ZGETRF', ' ', M, N, -1, -1 ) IF( NB.LE.1 .OR. NB.GE.MIN( M, N ) ) THEN * * Use unblocked code. * CALL ZGETF2( M, N, A, LDA, IPIV, INFO ) ELSE * * Use blocked code. * DO 20 J = 1, MIN( M, N ), NB JB = MIN( MIN( M, N )-J+1, NB ) * * Factor diagonal and subdiagonal blocks and test for exact * singularity. * CALL ZGETF2( M-J+1, JB, A( J, J ), LDA, IPIV( J ), IINFO ) * * Adjust INFO and the pivot indices. * IF( INFO.EQ.0 .AND. IINFO.GT.0 ) $ INFO = IINFO + J - 1 DO 10 I = J, MIN( M, J+JB-1 ) IPIV( I ) = J - 1 + IPIV( I ) 10 CONTINUE * * Apply interchanges to columns 1:J-1. * CALL ZLASWP( J-1, A, LDA, J, J+JB-1, IPIV, 1 ) * IF( J+JB.LE.N ) THEN * * Apply interchanges to columns J+JB:N. * CALL ZLASWP( N-J-JB+1, A( 1, J+JB ), LDA, J, J+JB-1, $ IPIV, 1 ) * * Compute block row of U. * CALL ZTRSM( 'Left', 'Lower', 'No transpose', 'Unit', JB, $ N-J-JB+1, ONE, A( J, J ), LDA, A( J, J+JB ), $ LDA ) IF( J+JB.LE.M ) THEN * * Update trailing submatrix. * CALL ZGEMM( 'No transpose', 'No transpose', M-J-JB+1, $ N-J-JB+1, JB, -ONE, A( J+JB, J ), LDA, $ A( J, J+JB ), LDA, ONE, A( J+JB, J+JB ), $ LDA ) END IF END IF 20 CONTINUE END IF RETURN * * End of ZGETRF * END octave-1.1.0/libcruft/lapack/zgetrs.f100666 415 17 10260 5310240645 15707 0ustar jweusers SUBROUTINE ZGETRS( TRANS, N, NRHS, A, LDA, IPIV, B, LDB, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER TRANS INTEGER INFO, LDA, LDB, N, NRHS * .. * .. Array Arguments .. INTEGER IPIV( * ) COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * ZGETRS solves a system of linear equations * A * X = B, A**T * X = B, or A**H * X = B * with a general n by n matrix A using the LU factorization computed * by ZGETRF. * * Arguments * ========= * * TRANS (input) CHARACTER*1 * Specifies the form of the system of equations. * = 'N': A * X = B (No transpose) * = 'T': A**T * X = B (Transpose) * = 'C': A**H * X = B (Conjugate transpose) * * N (input) INTEGER * The order of the matrix A. N >= 0. * * NRHS (input) INTEGER * The number of right hand sides, i.e., the number of columns * of the matrix B. NRHS >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,N) * The factors L and U from the factorization A = P*L*U * as computed by ZGETRF. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * IPIV (input) INTEGER array, dimension (N) * The pivot indices from ZGETRF; for 1<=i<=N, row i of the * matrix was interchanged with row IPIV(i). * * B (input/output) COMPLEX*16 array, dimension (LDB,NRHS) * On entry, the right hand side vectors B for the system of * linear equations. * On exit, the solution vectors, X. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL NOTRAN * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLASWP, ZTRSM * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 NOTRAN = LSAME( TRANS, 'N' ) IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) .AND. .NOT. $ LSAME( TRANS, 'C' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( NRHS.LT.0 ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZGETRS', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 .OR. NRHS.EQ.0 ) $ RETURN * IF( NOTRAN ) THEN * * Solve A * X = B. * * Apply row interchanges to the right hand sides. * CALL ZLASWP( NRHS, B, LDB, 1, N, IPIV, 1 ) * * Solve L*X = B, overwriting B with X. * CALL ZTRSM( 'Left', 'Lower', 'No transpose', 'Unit', N, NRHS, $ ONE, A, LDA, B, LDB ) * * Solve U*X = B, overwriting B with X. * CALL ZTRSM( 'Left', 'Upper', 'No transpose', 'Non-unit', N, $ NRHS, ONE, A, LDA, B, LDB ) ELSE * * Solve A**T * X = B or A**H * X = B. * * Solve U'*X = B, overwriting B with X. * CALL ZTRSM( 'Left', 'Upper', TRANS, 'Non-unit', N, NRHS, ONE, $ A, LDA, B, LDB ) * * Solve L'*X = B, overwriting B with X. * CALL ZTRSM( 'Left', 'Lower', TRANS, 'Unit', N, NRHS, ONE, A, $ LDA, B, LDB ) * * Apply row interchanges to the solution vectors. * CALL ZLASWP( NRHS, B, LDB, 1, N, IPIV, -1 ) END IF * RETURN * * End of ZGETRS * END octave-1.1.0/libcruft/lapack/zhseqr.f100666 415 17 35651 5306544273 15731 0ustar jweusers SUBROUTINE ZHSEQR( JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, $ WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER COMPZ, JOB INTEGER IHI, ILO, INFO, LDH, LDZ, LWORK, N * .. * .. Array Arguments .. COMPLEX*16 H( LDH, * ), W( * ), WORK( * ), Z( LDZ, * ) * .. * * Purpose * ======= * * ZHSEQR computes the eigenvalues of a complex upper Hessenberg * matrix H, and, optionally, the matrices T and Z from the Schur * decomposition H = Z T Z', where T is an upper triangular matrix * (the Schur form), Z is the unitary matrix of Schur vectors, and Z' * denotes the conjugate transpose of Z. * * Optionally Z may be postmultiplied into an input unitary matrix Q, * so that this routine can give the Schur factorization of a matrix A * which has been reduced to the Hessenberg form H by the unitary * matrix Q: A = Q*H*Q' = (QZ)*T*(QZ)'. * * Arguments * ========= * * JOB (input) CHARACTER*1 * = 'E': compute eigenvalues only; * = 'S': compute eigenvalues and the Schur form T. * * COMPZ (input) CHARACTER*1 * = 'N': no Schur vectors are computed; * = 'I': Z is initialized to the unit matrix and the matrix Z * of Schur vectors of H is returned; * = 'V': Z must contain an unitary matrix Q on entry, and * the product Q*Z is returned. * * N (input) INTEGER * The order of the matrix H. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that H is already upper triangular in rows * and columns 1:ILO-1 and IHI+1:N. ILO and IHI are normally * set by a previous call to ZGEBAL, and then passed to CGEHRD * when the matrix output by ZGEBAL is reduced to Hessenberg * form. Otherwise ILO and IHI should be set to 1 and N * respectively. * 1 <= ILO <= max(1,IHI); IHI <= N. * * H (input/output) COMPLEX*16 array, dimension (LDH,N) * On entry, the upper Hessenberg matrix H. * On exit, if JOB = 'S', H contains the upper triangular matrix * T from the Schur decomposition (the Schur form). If * JOB = 'E', the contents of H are unspecified on exit. * * LDH (input) INTEGER * The leading dimension of the array H. LDH >= max(1,N). * * W (output) COMPLEX*16 array, dimension (N) * The computed eigenvalues. If JOB = 'S', the eigenvalues are * stored in the same order as on the diagonal of the Schur form * returned in H, with W(i) = H(i,i). * * Z (input/output) COMPLEX*16 array, dimension (LDZ,N) * If COMPZ = 'N': Z is not referenced. * If COMPZ = 'I': on entry, Z need not be set, and on exit, Z * contains the unitary matrix Z of the Schur vectors of H. * If COMPZ = 'V': on entry Z must contain an n-by-n matrix Q, * which is assumed to be equal to the unit matrix except for * the submatrix Z(ILO:IHI,ILO:IHI); on exit Z contains Q*Z. * Normally Q is the unitary matrix generated by ZUNGHR after * the call to ZGEHRD which formed the Hessenberg matrix H. * * LDZ (input) INTEGER * The leading dimension of the array Z. * LDZ >= max(1,N) if COMPZ = 'I' or 'V'; LDZ >= 1 otherwise. * * WORK (workspace) COMPLEX*16 array, dimension (N) * * LWORK (input) INTEGER * This argument is now redundant. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * > 0: ZHSEQR failed to compute all the eigenvalues in a total * of 30*(IHI-ILO+1) iterations; if INFO = i, elements * 1:ilo-1 and i+1:n of W contain those eigenvalues which * have been successfully computed. * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION RZERO, RONE, CONST PARAMETER ( RZERO = 0.0D+0, RONE = 1.0D+0, $ CONST = 1.5D+0 ) INTEGER NSMAX, LDS PARAMETER ( NSMAX = 15, LDS = NSMAX ) * .. * .. Local Scalars .. LOGICAL INITZ, WANTT, WANTZ INTEGER I, I1, I2, IERR, II, ITEMP, ITN, ITS, J, K, L, $ MAXB, NH, NR, NS, NV DOUBLE PRECISION OVFL, RTEMP, SMLNUM, TST1, ULP, UNFL COMPLEX*16 CDUM, TAU, TEMP * .. * .. Local Arrays .. DOUBLE PRECISION RWORK( 1 ) COMPLEX*16 S( LDS, NSMAX ), V( NSMAX+1 ), VV( NSMAX+1 ) * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV, IZAMAX DOUBLE PRECISION DLAMCH, DLAPY2, ZLANHS EXTERNAL LSAME, ILAENV, IZAMAX, DLAMCH, DLAPY2, ZLANHS * .. * .. External Subroutines .. EXTERNAL DLABAD, XERBLA, ZCOPY, ZDSCAL, ZGEMV, ZLACPY, $ ZLAHQR, ZLARFG, ZLARFX, ZLASET, ZSCAL * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCONJG, DIMAG, MAX, MIN * .. * .. Statement Functions .. DOUBLE PRECISION CABS1 * .. * .. Statement Function definitions .. CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) ) * .. * .. Executable Statements .. * * Decode and test the input parameters * WANTT = LSAME( JOB, 'S' ) INITZ = LSAME( COMPZ, 'I' ) WANTZ = INITZ .OR. LSAME( COMPZ, 'V' ) * INFO = 0 IF( .NOT.LSAME( JOB, 'E' ) .AND. .NOT.WANTT ) THEN INFO = -1 ELSE IF( .NOT.LSAME( COMPZ, 'N' ) .AND. .NOT.WANTZ ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -3 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -5 ELSE IF( LDH.LT.MAX( 1, N ) ) THEN INFO = -7 ELSE IF( LDZ.LT.1 .OR. WANTZ .AND. LDZ.LT.MAX( 1, N ) ) THEN INFO = -10 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZHSEQR', -INFO ) RETURN END IF * * Initialize Z, if necessary * IF( INITZ ) $ CALL ZLASET( 'Full', N, N, ZERO, ONE, Z, LDZ ) * * Store the eigenvalues isolated by ZGEBAL. * DO 10 I = 1, ILO - 1 W( I ) = H( I, I ) 10 CONTINUE DO 20 I = IHI + 1, N W( I ) = H( I, I ) 20 CONTINUE * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN IF( ILO.EQ.IHI ) THEN W( ILO ) = H( ILO, ILO ) RETURN END IF * * Set rows and columns ILO to IHI to zero below the first * subdiagonal. * DO 40 J = ILO, IHI - 2 DO 30 I = J + 2, N H( I, J ) = ZERO 30 CONTINUE 40 CONTINUE NH = IHI - ILO + 1 * * I1 and I2 are the indices of the first row and last column of H * to which transformations must be applied. If eigenvalues only are * being computed, I1 and I2 are re-set inside the main loop. * IF( WANTT ) THEN I1 = 1 I2 = N ELSE I1 = ILO I2 = IHI END IF * * Ensure that the subdiagonal elements are real. * DO 50 I = ILO + 1, IHI TEMP = H( I, I-1 ) IF( DIMAG( TEMP ).NE.RZERO ) THEN RTEMP = DLAPY2( DBLE( TEMP ), DIMAG( TEMP ) ) H( I, I-1 ) = RTEMP TEMP = TEMP / RTEMP IF( I2.GT.I ) $ CALL ZSCAL( I2-I, DCONJG( TEMP ), H( I, I+1 ), LDH ) CALL ZSCAL( I-I1, TEMP, H( I1, I ), 1 ) IF( I.LT.IHI ) $ H( I+1, I ) = TEMP*H( I+1, I ) IF( WANTZ ) $ CALL ZSCAL( NH, TEMP, Z( ILO, I ), 1 ) END IF 50 CONTINUE * * Determine the order of the multi-shift QR algorithm to be used. * NS = ILAENV( 4, 'ZHSEQR', JOB // COMPZ, N, ILO, IHI, -1 ) MAXB = ILAENV( 8, 'ZHSEQR', JOB // COMPZ, N, ILO, IHI, -1 ) IF( NS.LE.1 .OR. NS.GT.NH .OR. MAXB.GE.NH ) THEN * * Use the standard double-shift algorithm * CALL ZLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILO, IHI, Z, $ LDZ, INFO ) RETURN END IF MAXB = MAX( 2, MAXB ) NS = MIN( NS, MAXB, NSMAX ) * * Now 1 < NS <= MAXB < NH. * * Set machine-dependent constants for the stopping criterion. * If norm(H) <= sqrt(OVFL), overflow should not occur. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = RONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( NH / ULP ) * * ITN is the total number of multiple-shift QR iterations allowed. * ITN = 30*NH * * The main loop begins here. I is the loop index and decreases from * IHI to ILO in steps of at most MAXB. Each iteration of the loop * works with the active submatrix in rows and columns L to I. * Eigenvalues I+1 to IHI have already converged. Either L = ILO, or * H(L,L-1) is negligible so that the matrix splits. * I = IHI 60 CONTINUE IF( I.LT.ILO ) $ GO TO 180 * * Perform multiple-shift QR iterations on rows and columns ILO to I * until a submatrix of order at most MAXB splits off at the bottom * because a subdiagonal element has become negligible. * L = ILO DO 160 ITS = 0, ITN * * Look for a single small subdiagonal element. * DO 70 K = I, L + 1, -1 TST1 = CABS1( H( K-1, K-1 ) ) + CABS1( H( K, K ) ) IF( TST1.EQ.RZERO ) $ TST1 = ZLANHS( '1', I-L+1, H( L, L ), LDH, RWORK ) IF( ABS( DBLE( H( K, K-1 ) ) ).LE.MAX( ULP*TST1, SMLNUM ) ) $ GO TO 80 70 CONTINUE 80 CONTINUE L = K IF( L.GT.ILO ) THEN * * H(L,L-1) is negligible. * H( L, L-1 ) = ZERO END IF * * Exit from loop if a submatrix of order <= MAXB has split off. * IF( L.GE.I-MAXB+1 ) $ GO TO 170 * * Now the active submatrix is in rows and columns L to I. If * eigenvalues only are being computed, only the active submatrix * need be transformed. * IF( .NOT.WANTT ) THEN I1 = L I2 = I END IF * IF( ITS.EQ.20 .OR. ITS.EQ.30 ) THEN * * Exceptional shifts. * DO 90 II = I - NS + 1, I W( II ) = CONST*( ABS( DBLE( H( II, II-1 ) ) )+ $ ABS( DBLE( H( II, II ) ) ) ) 90 CONTINUE ELSE * * Use eigenvalues of trailing submatrix of order NS as shifts. * CALL ZLACPY( 'Full', NS, NS, H( I-NS+1, I-NS+1 ), LDH, S, $ LDS ) CALL ZLAHQR( .FALSE., .FALSE., NS, 1, NS, S, LDS, $ W( I-NS+1 ), 1, NS, Z, LDZ, IERR ) IF( IERR.GT.0 ) THEN * * If ZLAHQR failed to compute all NS eigenvalues, use the * unconverged diagonal elements as the remaining shifts. * DO 100 II = 1, IERR W( I-NS+II ) = S( II, II ) 100 CONTINUE END IF END IF * * Form the first column of (G-w(1)) (G-w(2)) . . . (G-w(ns)) * where G is the Hessenberg submatrix H(L:I,L:I) and w is * the vector of shifts (stored in W). The result is * stored in the local array V. * V( 1 ) = ONE DO 110 II = 2, NS + 1 V( II ) = ZERO 110 CONTINUE NV = 1 DO 130 J = I - NS + 1, I CALL ZCOPY( NV+1, V, 1, VV, 1 ) CALL ZGEMV( 'No transpose', NV+1, NV, ONE, H( L, L ), LDH, $ VV, 1, -W( J ), V, 1 ) NV = NV + 1 * * Scale V(1:NV) so that max(abs(V(i))) = 1. If V is zero, * reset it to the unit vector. * ITEMP = IZAMAX( NV, V, 1 ) RTEMP = CABS1( V( ITEMP ) ) IF( RTEMP.EQ.RZERO ) THEN V( 1 ) = ONE DO 120 II = 2, NV V( II ) = ZERO 120 CONTINUE ELSE RTEMP = MAX( RTEMP, SMLNUM ) CALL ZDSCAL( NV, RONE / RTEMP, V, 1 ) END IF 130 CONTINUE * * Multiple-shift QR step * DO 150 K = L, I - 1 * * The first iteration of this loop determines a reflection G * from the vector V and applies it from left and right to H, * thus creating a nonzero bulge below the subdiagonal. * * Each subsequent iteration determines a reflection G to * restore the Hessenberg form in the (K-1)th column, and thus * chases the bulge one step toward the bottom of the active * submatrix. NR is the order of G. * NR = MIN( NS+1, I-K+1 ) IF( K.GT.L ) $ CALL ZCOPY( NR, H( K, K-1 ), 1, V, 1 ) CALL ZLARFG( NR, V( 1 ), V( 2 ), 1, TAU ) IF( K.GT.L ) THEN H( K, K-1 ) = V( 1 ) DO 140 II = K + 1, I H( II, K-1 ) = ZERO 140 CONTINUE END IF V( 1 ) = ONE * * Apply G' from the left to transform the rows of the matrix * in columns K to I2. * CALL ZLARFX( 'Left', NR, I2-K+1, V, DCONJG( TAU ), $ H( K, K ), LDH, WORK ) * * Apply G from the right to transform the columns of the * matrix in rows I1 to min(K+NR,I). * CALL ZLARFX( 'Right', MIN( K+NR, I )-I1+1, NR, V, TAU, $ H( I1, K ), LDH, WORK ) * IF( WANTZ ) THEN * * Accumulate transformations in the matrix Z * CALL ZLARFX( 'Right', NH, NR, V, TAU, Z( ILO, K ), LDZ, $ WORK ) END IF 150 CONTINUE * * Ensure that H(I,I-1) is real. * TEMP = H( I, I-1 ) IF( DIMAG( TEMP ).NE.RZERO ) THEN RTEMP = DLAPY2( DBLE( TEMP ), DIMAG( TEMP ) ) H( I, I-1 ) = RTEMP TEMP = TEMP / RTEMP IF( I2.GT.I ) $ CALL ZSCAL( I2-I, DCONJG( TEMP ), H( I, I+1 ), LDH ) CALL ZSCAL( I-I1, TEMP, H( I1, I ), 1 ) IF( WANTZ ) THEN CALL ZSCAL( NH, TEMP, Z( ILO, I ), 1 ) END IF END IF * 160 CONTINUE * * Failure to converge in remaining number of iterations * INFO = I RETURN * 170 CONTINUE * * A submatrix of order <= MAXB in rows and columns L to I has split * off. Use the double-shift QR algorithm to handle it. * CALL ZLAHQR( WANTT, WANTZ, N, L, I, H, LDH, W, ILO, IHI, Z, LDZ, $ INFO ) IF( INFO.GT.0 ) $ RETURN * * Decrement number of remaining iterations, and return to start of * the main loop with a new value of I. * ITN = ITN - ITS I = L - 1 GO TO 60 * 180 CONTINUE RETURN * * End of ZHSEQR * END octave-1.1.0/libcruft/lapack/zlabrd.f100666 415 17 31466 5306544302 15664 0ustar jweusers SUBROUTINE ZLABRD( M, N, NB, A, LDA, D, E, TAUQ, TAUP, X, LDX, Y, $ LDY ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER LDA, LDX, LDY, M, N, NB * .. * .. Array Arguments .. DOUBLE PRECISION D( * ), E( * ) COMPLEX*16 A( LDA, * ), TAUP( * ), TAUQ( * ), X( LDX, * ), $ Y( LDY, * ) * .. * * Purpose * ======= * * ZLABRD reduces the first NB rows and columns of a complex general * m by n matrix A to upper or lower real bidiagonal form by a unitary * transformation Q' * A * P, and returns the matrices X and Y which * are needed to apply the transformation to the unreduced part of A. * * If m >= n, A is reduced to upper bidiagonal form; if m < n, to lower * bidiagonal form. * * This is an auxiliary routine called by ZGEBRD * * Arguments * ========= * * M (input) INTEGER * The number of rows in the matrix A. * * N (input) INTEGER * The number of columns in the matrix A. * * NB (input) INTEGER * The number of leading rows and columns of A to be reduced. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n general matrix to be reduced. * On exit, the first NB rows and columns of the matrix are * overwritten; the rest of the array is unchanged. * If m >= n, elements on and below the diagonal in the first NB * columns, with the array TAUQ, represent the unitary * matrix Q as a product of elementary reflectors; and * elements above the diagonal in the first NB rows, with the * array TAUP, represent the unitary matrix P as a product * of elementary reflectors. * If m < n, elements below the diagonal in the first NB * columns, with the array TAUQ, represent the unitary * matrix Q as a product of elementary reflectors, and * elements on and above the diagonal in the first NB rows, * with the array TAUP, represent the unitary matrix P as * a product of elementary reflectors. * See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * D (output) DOUBLE PRECISION array, dimension (NB) * The diagonal elements of the first NB rows and columns of * the reduced matrix. D(i) = A(i,i). * * E (output) DOUBLE PRECISION array, dimension (NB) * The off-diagonal elements of the first NB rows and columns of * the reduced matrix. * * TAUQ (output) COMPLEX*16 array dimension (NB) * The scalar factors of the elementary reflectors which * represent the unitary matrix Q. See Further Details. * * TAUP (output) COMPLEX*16 array, dimension (NB) * The scalar factors of the elementary reflectors which * represent the unitary matrix P. See Further Details. * * X (output) COMPLEX*16 array, dimension (LDX,NB) * The m-by-nb matrix X required to update the unreduced part * of A. * * LDX (input) INTEGER * The leading dimension of the array X. LDX >= max(1,M). * * Y (output) COMPLEX*16 array, dimension (LDY,NB) * The n-by-nb matrix Y required to update the unreduced part * of A. * * LDY (output) INTEGER * The leading dimension of the array Y. LDY >= max(1,N). * * Further Details * =============== * * The matrices Q and P are represented as products of elementary * reflectors: * * Q = H(1) H(2) . . . H(nb) and P = G(1) G(2) . . . G(nb) * * Each H(i) and G(i) has the form: * * H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' * * where tauq and taup are complex scalars, and v and u are complex * vectors. * * If m >= n, v(1:i-1) = 0, v(i) = 1, and v(i:m) is stored on exit in * A(i:m,i); u(1:i) = 0, u(i+1) = 1, and u(i+1:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * If m < n, v(1:i) = 0, v(i+1) = 1, and v(i+1:m) is stored on exit in * A(i+2:m,i); u(1:i-1) = 0, u(i) = 1, and u(i:n) is stored on exit in * A(i,i+1:n); tauq is stored in TAUQ(i) and taup in TAUP(i). * * The elements of the vectors v and u together form the m-by-nb matrix * V and the nb-by-n matrix U' which are needed, with X and Y, to apply * the transformation to the unreduced part of the matrix, using a block * update of the form: A := A - V*Y' - X*U'. * * The contents of A on exit are illustrated by the following examples * with nb = 2: * * m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): * * ( 1 1 u1 u1 u1 ) ( 1 u1 u1 u1 u1 u1 ) * ( v1 1 1 u2 u2 ) ( 1 1 u2 u2 u2 u2 ) * ( v1 v2 a a a ) ( v1 1 a a a a ) * ( v1 v2 a a a ) ( v1 v2 a a a a ) * ( v1 v2 a a a ) ( v1 v2 a a a a ) * ( v1 v2 a a a ) * * where a denotes an element of the original matrix which is unchanged, * vi denotes an element of the vector defining H(i), and ui an element * of the vector defining G(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. INTEGER I COMPLEX*16 ALPHA * .. * .. External Subroutines .. EXTERNAL ZGEMV, ZLACGV, ZLARFG, ZSCAL * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * * Quick return if possible * IF( M.LE.0 .OR. N.LE.0 ) $ RETURN * IF( M.GE.N ) THEN * * Reduce to upper bidiagonal form * DO 10 I = 1, NB * * Update A(i:m,i) * CALL ZLACGV( I-1, Y( I, 1 ), LDY ) CALL ZGEMV( 'No transpose', M-I+1, I-1, -ONE, A( I, 1 ), $ LDA, Y( I, 1 ), LDY, ONE, A( I, I ), 1 ) CALL ZLACGV( I-1, Y( I, 1 ), LDY ) CALL ZGEMV( 'No transpose', M-I+1, I-1, -ONE, X( I, 1 ), $ LDX, A( 1, I ), 1, ONE, A( I, I ), 1 ) * * Generate reflection Q(i) to annihilate A(i+1:m,i) * ALPHA = A( I, I ) CALL ZLARFG( M-I+1, ALPHA, A( MIN( I+1, M ), I ), 1, $ TAUQ( I ) ) D( I ) = ALPHA IF( I.LT.N ) THEN A( I, I ) = ONE * * Compute Y(i+1:n,i) * CALL ZGEMV( 'Conjugate transpose', M-I+1, N-I, ONE, $ A( I, I+1 ), LDA, A( I, I ), 1, ZERO, $ Y( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', M-I+1, I-1, ONE, $ A( I, 1 ), LDA, A( I, I ), 1, ZERO, $ Y( 1, I ), 1 ) CALL ZGEMV( 'No transpose', N-I, I-1, -ONE, Y( I+1, 1 ), $ LDY, Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', M-I+1, I-1, ONE, $ X( I, 1 ), LDX, A( I, I ), 1, ZERO, $ Y( 1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', I-1, N-I, -ONE, $ A( 1, I+1 ), LDA, Y( 1, I ), 1, ONE, $ Y( I+1, I ), 1 ) CALL ZSCAL( N-I, TAUQ( I ), Y( I+1, I ), 1 ) * * Update A(i,i+1:n) * CALL ZLACGV( N-I, A( I, I+1 ), LDA ) CALL ZLACGV( I, A( I, 1 ), LDA ) CALL ZGEMV( 'No transpose', N-I, I, -ONE, Y( I+1, 1 ), $ LDY, A( I, 1 ), LDA, ONE, A( I, I+1 ), LDA ) CALL ZLACGV( I, A( I, 1 ), LDA ) CALL ZLACGV( I-1, X( I, 1 ), LDX ) CALL ZGEMV( 'Conjugate transpose', I-1, N-I, -ONE, $ A( 1, I+1 ), LDA, X( I, 1 ), LDX, ONE, $ A( I, I+1 ), LDA ) CALL ZLACGV( I-1, X( I, 1 ), LDX ) * * Generate reflection P(i) to annihilate A(i,i+2:n) * ALPHA = A( I, I+1 ) CALL ZLARFG( N-I, ALPHA, A( I, MIN( I+2, N ) ), LDA, $ TAUP( I ) ) E( I ) = ALPHA A( I, I+1 ) = ONE * * Compute X(i+1:m,i) * CALL ZGEMV( 'No transpose', M-I, N-I, ONE, A( I+1, I+1 ), $ LDA, A( I, I+1 ), LDA, ZERO, X( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', N-I, I, ONE, $ Y( I+1, 1 ), LDY, A( I, I+1 ), LDA, ZERO, $ X( 1, I ), 1 ) CALL ZGEMV( 'No transpose', M-I, I, -ONE, A( I+1, 1 ), $ LDA, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL ZGEMV( 'No transpose', I-1, N-I, ONE, A( 1, I+1 ), $ LDA, A( I, I+1 ), LDA, ZERO, X( 1, I ), 1 ) CALL ZGEMV( 'No transpose', M-I, I-1, -ONE, X( I+1, 1 ), $ LDX, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL ZSCAL( M-I, TAUP( I ), X( I+1, I ), 1 ) CALL ZLACGV( N-I, A( I, I+1 ), LDA ) END IF 10 CONTINUE ELSE * * Reduce to lower bidiagonal form * DO 20 I = 1, NB * * Update A(i,i:n) * CALL ZLACGV( N-I+1, A( I, I ), LDA ) CALL ZLACGV( I-1, A( I, 1 ), LDA ) CALL ZGEMV( 'No transpose', N-I+1, I-1, -ONE, Y( I, 1 ), $ LDY, A( I, 1 ), LDA, ONE, A( I, I ), LDA ) CALL ZLACGV( I-1, A( I, 1 ), LDA ) CALL ZLACGV( I-1, X( I, 1 ), LDX ) CALL ZGEMV( 'Conjugate transpose', I-1, N-I+1, -ONE, $ A( 1, I ), LDA, X( I, 1 ), LDX, ONE, A( I, I ), $ LDA ) CALL ZLACGV( I-1, X( I, 1 ), LDX ) * * Generate reflection P(i) to annihilate A(i,i+1:n) * ALPHA = A( I, I ) CALL ZLARFG( N-I+1, ALPHA, A( I, MIN( I+1, N ) ), LDA, $ TAUP( I ) ) D( I ) = ALPHA IF( I.LT.M ) THEN A( I, I ) = ONE * * Compute X(i+1:m,i) * CALL ZGEMV( 'No transpose', M-I, N-I+1, ONE, A( I+1, I ), $ LDA, A( I, I ), LDA, ZERO, X( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', N-I+1, I-1, ONE, $ Y( I, 1 ), LDY, A( I, I ), LDA, ZERO, $ X( 1, I ), 1 ) CALL ZGEMV( 'No transpose', M-I, I-1, -ONE, A( I+1, 1 ), $ LDA, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL ZGEMV( 'No transpose', I-1, N-I+1, ONE, A( 1, I ), $ LDA, A( I, I ), LDA, ZERO, X( 1, I ), 1 ) CALL ZGEMV( 'No transpose', M-I, I-1, -ONE, X( I+1, 1 ), $ LDX, X( 1, I ), 1, ONE, X( I+1, I ), 1 ) CALL ZSCAL( M-I, TAUP( I ), X( I+1, I ), 1 ) CALL ZLACGV( N-I+1, A( I, I ), LDA ) * * Update A(i+1:m,i) * CALL ZLACGV( I-1, Y( I, 1 ), LDY ) CALL ZGEMV( 'No transpose', M-I, I-1, -ONE, A( I+1, 1 ), $ LDA, Y( I, 1 ), LDY, ONE, A( I+1, I ), 1 ) CALL ZLACGV( I-1, Y( I, 1 ), LDY ) CALL ZGEMV( 'No transpose', M-I, I, -ONE, X( I+1, 1 ), $ LDX, A( 1, I ), 1, ONE, A( I+1, I ), 1 ) * * Generate reflection Q(i) to annihilate A(i+2:m,i) * ALPHA = A( I+1, I ) CALL ZLARFG( M-I, ALPHA, A( MIN( I+2, M ), I ), 1, $ TAUQ( I ) ) E( I ) = ALPHA A( I+1, I ) = ONE * * Compute Y(i+1:n,i) * CALL ZGEMV( 'Conjugate transpose', M-I, N-I, ONE, $ A( I+1, I+1 ), LDA, A( I+1, I ), 1, ZERO, $ Y( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', M-I, I-1, ONE, $ A( I+1, 1 ), LDA, A( I+1, I ), 1, ZERO, $ Y( 1, I ), 1 ) CALL ZGEMV( 'No transpose', N-I, I-1, -ONE, Y( I+1, 1 ), $ LDY, Y( 1, I ), 1, ONE, Y( I+1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', M-I, I, ONE, $ X( I+1, 1 ), LDX, A( I+1, I ), 1, ZERO, $ Y( 1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', I, N-I, -ONE, $ A( 1, I+1 ), LDA, Y( 1, I ), 1, ONE, $ Y( I+1, I ), 1 ) CALL ZSCAL( N-I, TAUQ( I ), Y( I+1, I ), 1 ) ELSE CALL ZLACGV( N-I+1, A( I, I ), LDA ) END IF 20 CONTINUE END IF RETURN * * End of ZLABRD * END octave-1.1.0/libcruft/lapack/zlacgv.f100666 415 17 2732 5306544275 15657 0ustar jweusers SUBROUTINE ZLACGV( N, X, INCX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, N * .. * .. Array Arguments .. COMPLEX*16 X( * ) * .. * * Purpose * ======= * * ZLACGV conjugates a complex vector of length N. * * Arguments * ========= * * N (input) INTEGER * The length of the vector X. N >= 0. * * X (input/output) COMPLEX*16 array, dimension * (1+(N-1)*abs(INCX)) * On entry, the vector of length N to be conjugated. * On exit, X is overwritten with conjg(X). * * INCX (input) INTEGER * The spacing between successive elements of X. * * ===================================================================== * * .. Local Scalars .. INTEGER I, IOFF * .. * .. Intrinsic Functions .. INTRINSIC DCONJG * .. * .. Executable Statements .. * IF( INCX.EQ.1 ) THEN DO 10 I = 1, N X( I ) = DCONJG( X( I ) ) 10 CONTINUE ELSE IOFF = 1 IF( INCX.LT.0 ) $ IOFF = 1 - ( N-1 )*INCX DO 20 I = 1, N X( IOFF ) = DCONJG( X( IOFF ) ) IOFF = IOFF + INCX 20 CONTINUE END IF RETURN * * End of ZLACGV * END octave-1.1.0/libcruft/lapack/zlacon.f100666 415 17 12370 5412145401 15660 0ustar jweusers SUBROUTINE ZLACON( N, V, X, EST, KASE ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER KASE, N DOUBLE PRECISION EST * .. * .. Array Arguments .. COMPLEX*16 V( N ), X( N ) * .. * * Purpose * ======= * * ZLACON estimates the 1-norm of a square, complex matrix A. * Reverse communication is used for evaluating matrix-vector products. * * Arguments * ========= * * N (input) INTEGER * The order of the matrix. N >= 1. * * V (workspace) COMPLEX*16 array, dimension (N) * On the final return, V = A*W, where EST = norm(V)/norm(W) * (W is not returned). * * X (input/output) COMPLEX*16 array, dimension (N) * On an intermediate return, X should be overwritten by * A * X, if KASE=1, * A' * X, if KASE=2, * where A' is the conjugate transpose of A, and ZLACON must be * re-called with all the other parameters unchanged. * * EST (output) DOUBLE PRECISION * An estimate (a lower bound) for norm(A). * * KASE (input/output) INTEGER * On the initial call to ZLACON, KASE should be 0. * On an intermediate return, KASE will be 1 or 2, indicating * whether X should be overwritten by A * X or A' * X. * On the final return from ZLACON, KASE will again be 0. * * Further Details * ======= ======= * * Contributed by Nick Higham, University of Manchester. * Originally named CONEST, dated March 16, 1988. * * Reference: N.J. Higham, "FORTRAN codes for estimating the one-norm of * a real or complex matrix, with applications to condition estimation", * ACM Trans. Math. Soft., vol. 14, no. 4, pp. 381-396, December 1988. * * ===================================================================== * * .. Parameters .. INTEGER ITMAX PARAMETER ( ITMAX = 5 ) DOUBLE PRECISION ONE, TWO PARAMETER ( ONE = 1.0D0, TWO = 2.0D0 ) COMPLEX*16 CZERO, CONE PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ), $ CONE = ( 1.0D0, 0.0D0 ) ) * .. * .. Local Scalars .. INTEGER I, ITER, J, JLAST, JUMP DOUBLE PRECISION ALTSGN, ESTOLD, SAFMIN, TEMP * .. * .. External Functions .. INTEGER IZMAX1 DOUBLE PRECISION DLAMCH, DZSUM1 EXTERNAL IZMAX1, DLAMCH, DZSUM1 * .. * .. External Subroutines .. EXTERNAL ZCOPY * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCMPLX * .. * .. Save statement .. SAVE * .. * .. Executable Statements .. * SAFMIN = DLAMCH( 'Safe minimum' ) IF( KASE.EQ.0 ) THEN DO 10 I = 1, N X( I ) = DCMPLX( ONE / DBLE( N ) ) 10 CONTINUE KASE = 1 JUMP = 1 RETURN END IF * GO TO ( 20, 40, 70, 90, 120 )JUMP * * ................ ENTRY (JUMP = 1) * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY A*X. * 20 CONTINUE IF( N.EQ.1 ) THEN V( 1 ) = X( 1 ) EST = ABS( V( 1 ) ) * ... QUIT GO TO 130 END IF EST = DZSUM1( N, X, 1 ) * DO 30 I = 1, N IF( ABS( X( I ) ).GT.SAFMIN ) THEN X( I ) = X( I ) / DCMPLX( ABS( X( I ) ) ) ELSE X( I ) = CONE END IF 30 CONTINUE KASE = 2 JUMP = 2 RETURN * * ................ ENTRY (JUMP = 2) * FIRST ITERATION. X HAS BEEN OVERWRITTEN BY ZTRANS(A)*X. * 40 CONTINUE J = IZMAX1( N, X, 1 ) ITER = 2 * * MAIN LOOP - ITERATIONS 2,3,...,ITMAX. * 50 CONTINUE DO 60 I = 1, N X( I ) = CZERO 60 CONTINUE X( J ) = CONE KASE = 1 JUMP = 3 RETURN * * ................ ENTRY (JUMP = 3) * X HAS BEEN OVERWRITTEN BY A*X. * 70 CONTINUE CALL ZCOPY( N, X, 1, V, 1 ) ESTOLD = EST EST = DZSUM1( N, V, 1 ) * * TEST FOR CYCLING. IF( EST.LE.ESTOLD ) $ GO TO 100 * DO 80 I = 1, N IF( ABS( X( I ) ).GT.SAFMIN ) THEN X( I ) = X( I ) / DCMPLX( ABS( X( I ) ) ) ELSE X( I ) = CONE END IF 80 CONTINUE KASE = 2 JUMP = 4 RETURN * * ................ ENTRY (JUMP = 4) * X HAS BEEN OVERWRITTEN BY ZTRANS(A)*X. * 90 CONTINUE JLAST = J J = IZMAX1( N, X, 1 ) IF( ( DBLE( X( JLAST ) ).NE.ABS( DBLE( X( J ) ) ) ) .AND. $ ( ITER.LT.ITMAX ) ) THEN ITER = ITER + 1 GO TO 50 END IF * * ITERATION COMPLETE. FINAL STAGE. * 100 CONTINUE ALTSGN = ONE DO 110 I = 1, N X( I ) = DCMPLX( ALTSGN*( ONE+DBLE( I-1 ) / DBLE( N-1 ) ) ) ALTSGN = -ALTSGN 110 CONTINUE KASE = 1 JUMP = 5 RETURN * * ................ ENTRY (JUMP = 5) * X HAS BEEN OVERWRITTEN BY A*X. * 120 CONTINUE TEMP = TWO*( DZSUM1( N, X, 1 ) / DBLE( 3*N ) ) IF( TEMP.GT.EST ) THEN CALL ZCOPY( N, X, 1, V, 1 ) EST = TEMP END IF * 130 CONTINUE KASE = 0 RETURN * * End of ZLACON * END octave-1.1.0/libcruft/lapack/zlacpy.f100666 415 17 4571 5306544273 15674 0ustar jweusers SUBROUTINE ZLACPY( UPLO, M, N, A, LDA, B, LDB ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER LDA, LDB, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), B( LDB, * ) * .. * * Purpose * ======= * * ZLACPY copies all or part of a two-dimensional matrix A to another * matrix B. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies the part of the matrix A to be copied to B. * = 'U': Upper triangular part * = 'L': Lower triangular part * Otherwise: All of the matrix A * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,N) * The m by n matrix A. If UPLO = 'U', only the upper trapezium * is accessed; if UPLO = 'L', only the lower trapezium is * accessed. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * B (output) COMPLEX*16 array, dimension (LDB,N) * On exit, B = A in the locations specified by UPLO. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,M). * * ===================================================================== * * .. Local Scalars .. INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * IF( LSAME( UPLO, 'U' ) ) THEN DO 20 J = 1, N DO 10 I = 1, MIN( J, M ) B( I, J ) = A( I, J ) 10 CONTINUE 20 CONTINUE * ELSE IF( LSAME( UPLO, 'L' ) ) THEN DO 40 J = 1, N DO 30 I = J, M B( I, J ) = A( I, J ) 30 CONTINUE 40 CONTINUE * ELSE DO 60 J = 1, N DO 50 I = 1, M B( I, J ) = A( I, J ) 50 CONTINUE 60 CONTINUE END IF * RETURN * * End of ZLACPY * END octave-1.1.0/libcruft/lapack/zladiv.f100666 415 17 2171 5306544275 15657 0ustar jweusers DOUBLE COMPLEX FUNCTION ZLADIV( X, Y ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. COMPLEX*16 X, Y * .. * * Purpose * ======= * * ZLADIV := X / Y, where X and Y are complex. The computation of X / Y * will not overflow on an intermediary step unless the results * overflows. * * Arguments * ========= * * X (input) COMPLEX*16 * Y (input) COMPLEX*16 * The complex scalars X and Y. * * ===================================================================== * * .. Local Scalars .. DOUBLE PRECISION ZI, ZR * .. * .. External Subroutines .. EXTERNAL DLADIV * .. * .. Intrinsic Functions .. INTRINSIC DBLE, DCMPLX, DIMAG * .. * .. Executable Statements .. * CALL DLADIV( DBLE( X ), DIMAG( X ), DBLE( Y ), DIMAG( Y ), ZR, $ ZI ) ZLADIV = DCMPLX( ZR, ZI ) * RETURN * * End of ZLADIV * END octave-1.1.0/libcruft/lapack/zlarf.f100666 415 17 6206 5306544275 15507 0ustar jweusers SUBROUTINE ZLARF( SIDE, M, N, V, INCV, TAU, C, LDC, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE INTEGER INCV, LDC, M, N COMPLEX*16 TAU * .. * .. Array Arguments .. COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * * Purpose * ======= * * ZLARF applies a complex elementary reflector H to a complex m by n * matrix C, from either the left or the right. H is represented in the * form * * H = I - tau * v * v' * * where tau is a complex scalar and v is a complex vector. * * If tau = 0, then H is taken to be the unit matrix. * * To apply H' (the conjugate transpose of H), supply conjg(tau) instead * tau. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': form H * C * = 'R': form C * H * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * V (input) COMPLEX*16 array, dimension * (1 + (M-1)*abs(INCV)) if SIDE = 'L' * or (1 + (N-1)*abs(INCV)) if SIDE = 'R' * The vector v in the representation of H. V is not used if * TAU = 0. * * INCV (input) INTEGER * The increment between elements of v. INCV <> 0. * * TAU (input) COMPLEX*16 * The value tau in the representation of H. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by the matrix H * C if SIDE = 'L', * or C * H if SIDE = 'R'. * * LDC (input) INTEGER * The leading dimension of the array C. LDA >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension * (N) if SIDE = 'L' * or (M) if SIDE = 'R' * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. External Subroutines .. EXTERNAL ZGEMV, ZGERC * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Executable Statements .. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C * IF( TAU.NE.ZERO ) THEN * * w := C' * v * CALL ZGEMV( 'Conjugate transpose', M, N, ONE, C, LDC, V, $ INCV, ZERO, WORK, 1 ) * * C := C - v * w' * CALL ZGERC( M, N, -TAU, V, INCV, WORK, 1, C, LDC ) END IF ELSE * * Form C * H * IF( TAU.NE.ZERO ) THEN * * w := C * v * CALL ZGEMV( 'No transpose', M, N, ONE, C, LDC, V, INCV, $ ZERO, WORK, 1 ) * * C := C - w * v' * CALL ZGERC( M, N, -TAU, WORK, 1, V, INCV, C, LDC ) END IF END IF RETURN * * End of ZLARF * END octave-1.1.0/libcruft/lapack/zlahqr.f100666 415 17 30071 5306544273 15705 0ustar jweusers SUBROUTINE ZLAHQR( WANTT, WANTZ, N, ILO, IHI, H, LDH, W, ILOZ, $ IHIZ, Z, LDZ, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. LOGICAL WANTT, WANTZ INTEGER IHI, IHIZ, ILO, ILOZ, INFO, LDH, LDZ, N * .. * .. Array Arguments .. COMPLEX*16 H( LDH, * ), W( * ), Z( LDZ, * ) * .. * * Purpose * ======= * * ZLAHQR is an auxiliary routine called by ZHSEQR to update the * eigenvalues and Schur decomposition already computed by ZHSEQR, by * dealing with the Hessenberg submatrix in rows and columns ILO to IHI. * * Arguments * ========= * * WANTT (input) LOGICAL * = .TRUE. : the full Schur form T is required; * = .FALSE.: only eigenvalues are required. * * WANTZ (input) LOGICAL * = .TRUE. : the matrix of Schur vectors Z is required; * = .FALSE.: Schur vectors are not required. * * N (input) INTEGER * The order of the matrix H. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * It is assumed that H is already upper triangular in rows and * columns IHI+1:N, and that H(ILO,ILO-1) = 0 (unless ILO = 1). * ZLAHQR works primarily with the Hessenberg submatrix in rows * and columns ILO to IHI, but applies transformations to all of * H if WANTT is .TRUE.. * 1 <= ILO <= max(1,IHI); IHI <= N. * * H (input/output) COMPLEX*16 array, dimension (LDH,N) * On entry, the upper Hessenberg matrix H. * On exit, if WANTT is .TRUE., H is upper triangular in rows * and columns ILO:IHI, with any 2-by-2 diagonal blocks in * standard form. If WANTT is .FALSE., the contents of H are * unspecified on exit. * * LDH (input) INTEGER * The leading dimension of the array H. LDH >= max(1,N). * * W (output) COMPLEX*16 array, dimension (N) * The computed eigenvalues ILO to IHI are stored in the * corresponding elements of W. If WANTT is .TRUE., the * eigenvalues are stored in the same order as on the diagonal * of the Schur form returned in H, with W(i) = H(i,i). * * ILOZ (input) INTEGER * IHIZ (input) INTEGER * Specify the rows of Z to which transformations must be * applied if WANTZ is .TRUE.. * 1 <= ILOZ <= ILO; IHI <= IHIZ <= N. * * Z (input/output) COMPLEX*16 array, dimension (LDZ,N) * If WANTZ is .TRUE., on entry Z must contain the current * matrix Z of transformations accumulated by ZHSEQR, and on * exit Z has been updated; transformations are applied only to * the submatrix Z(ILOZ:IHIZ,ILO:IHI). * If WANTZ is .FALSE., Z is not referenced. * * LDZ (input) INTEGER * The leading dimension of the array Z. LDZ >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * > 0: ZLAHQR failed to compute all the eigenvalues ILO to IHI * in a total of 30*(IHI-ILO+1) iterations; if INFO = i, * elements i+1:ihi of W contain those eigenvalues which * have been successfully computed. * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) DOUBLE PRECISION RZERO, RONE, HALF PARAMETER ( RZERO = 0.0D+0, RONE = 1.0D+0, $ HALF = 0.5D+0 ) * .. * .. Local Scalars .. INTEGER I, I1, I2, ITN, ITS, J, K, L, M, NH, NZ DOUBLE PRECISION H10, H21, OVFL, RTEMP, S, SMLNUM, T2, TST1, $ ULP, UNFL COMPLEX*16 CDUM, H11, H11S, H22, SUM, T, T1, TEMP, U, V2, $ X, Y * .. * .. Local Arrays .. DOUBLE PRECISION RWORK( 1 ) COMPLEX*16 V( 2 ) * .. * .. External Functions .. DOUBLE PRECISION DLAMCH, DLAPY2, ZLANHS COMPLEX*16 ZLADIV EXTERNAL DLAMCH, DLAPY2, ZLANHS, ZLADIV * .. * .. External Subroutines .. EXTERNAL DLABAD, ZCOPY, ZLARFG, ZSCAL * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCONJG, DIMAG, MAX, MIN, SQRT * .. * .. Statement Functions .. DOUBLE PRECISION CABS1 * .. * .. Statement Function definitions .. CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) ) * .. * .. Executable Statements .. * INFO = 0 * * Quick return if possible * IF( N.EQ.0 ) $ RETURN IF( ILO.EQ.IHI ) THEN W( ILO ) = H( ILO, ILO ) RETURN END IF * NH = IHI - ILO + 1 NZ = IHIZ - ILOZ + 1 * * Set machine-dependent constants for the stopping criterion. * If norm(H) <= sqrt(OVFL), overflow should not occur. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = RONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( NH / ULP ) * * I1 and I2 are the indices of the first row and last column of H * to which transformations must be applied. If eigenvalues only are * being computed, I1 and I2 are set inside the main loop. * IF( WANTT ) THEN I1 = 1 I2 = N END IF * * ITN is the total number of QR iterations allowed. * ITN = 30*NH * * The main loop begins here. I is the loop index and decreases from * IHI to ILO in steps of 1. Each iteration of the loop works * with the active submatrix in rows and columns L to I. * Eigenvalues I+1 to IHI have already converged. Either L = ILO, or * H(L,L-1) is negligible so that the matrix splits. * I = IHI 10 CONTINUE IF( I.LT.ILO ) $ GO TO 130 * * Perform QR iterations on rows and columns ILO to I until a * submatrix of order 1 splits off at the bottom because a * subdiagonal element has become negligible. * L = ILO DO 110 ITS = 0, ITN * * Look for a single small subdiagonal element. * DO 20 K = I, L + 1, -1 TST1 = CABS1( H( K-1, K-1 ) ) + CABS1( H( K, K ) ) IF( TST1.EQ.RZERO ) $ TST1 = ZLANHS( '1', I-L+1, H( L, L ), LDH, RWORK ) IF( ABS( DBLE( H( K, K-1 ) ) ).LE.MAX( ULP*TST1, SMLNUM ) ) $ GO TO 30 20 CONTINUE 30 CONTINUE L = K IF( L.GT.ILO ) THEN * * H(L,L-1) is negligible * H( L, L-1 ) = ZERO END IF * * Exit from loop if a submatrix of order 1 has split off. * IF( L.GE.I ) $ GO TO 120 * * Now the active submatrix is in rows and columns L to I. If * eigenvalues only are being computed, only the active submatrix * need be transformed. * IF( .NOT.WANTT ) THEN I1 = L I2 = I END IF * IF( ITS.EQ.10 .OR. ITS.EQ.20 ) THEN * * Exceptional shift. * T = ABS( DBLE( H( I, I-1 ) ) ) + $ ABS( DBLE( H( I-1, I-2 ) ) ) ELSE * * Wilkinson's shift. * T = H( I, I ) U = H( I-1, I )*DBLE( H( I, I-1 ) ) IF( U.NE.ZERO ) THEN X = HALF*( H( I-1, I-1 )-T ) Y = SQRT( X*X+U ) IF( DBLE( X )*DBLE( Y )+DIMAG( X )*DIMAG( Y ).LT.RZERO ) $ Y = -Y T = T - ZLADIV( U, ( X+Y ) ) END IF END IF * * Look for two consecutive small subdiagonal elements. * DO 40 M = I - 1, L, -1 * * Determine the effect of starting the single-shift QR * iteration at row M, and see if this would make H(M,M-1) * negligible. * H11 = H( M, M ) H22 = H( M+1, M+1 ) H11S = H11 - T H21 = H( M+1, M ) S = CABS1( H11S ) + ABS( H21 ) H11S = H11S / S H21 = H21 / S V( 1 ) = H11S V( 2 ) = H21 IF( M.EQ.L ) $ GO TO 50 H10 = H( M, M-1 ) TST1 = CABS1( H11S )*( CABS1( H11 )+CABS1( H22 ) ) IF( ABS( H10*H21 ).LE.ULP*TST1 ) $ GO TO 50 40 CONTINUE 50 CONTINUE * * Single-shift QR step * DO 100 K = M, I - 1 * * The first iteration of this loop determines a reflection G * from the vector V and applies it from left and right to H, * thus creating a nonzero bulge below the subdiagonal. * * Each subsequent iteration determines a reflection G to * restore the Hessenberg form in the (K-1)th column, and thus * chases the bulge one step toward the bottom of the active * submatrix. * * V(2) is always real before the call to ZLARFG, and hence * after the call T2 ( = T1*V(2) ) is also real. * IF( K.GT.M ) $ CALL ZCOPY( 2, H( K, K-1 ), 1, V, 1 ) CALL ZLARFG( 2, V( 1 ), V( 2 ), 1, T1 ) IF( K.GT.M ) THEN H( K, K-1 ) = V( 1 ) H( K+1, K-1 ) = ZERO END IF V2 = V( 2 ) T2 = DBLE( T1*V2 ) * * Apply G from the left to transform the rows of the matrix * in columns K to I2. * DO 60 J = K, I2 SUM = DCONJG( T1 )*H( K, J ) + T2*H( K+1, J ) H( K, J ) = H( K, J ) - SUM H( K+1, J ) = H( K+1, J ) - SUM*V2 60 CONTINUE * * Apply G from the right to transform the columns of the * matrix in rows I1 to min(K+2,I). * DO 70 J = I1, MIN( K+2, I ) SUM = T1*H( J, K ) + T2*H( J, K+1 ) H( J, K ) = H( J, K ) - SUM H( J, K+1 ) = H( J, K+1 ) - SUM*DCONJG( V2 ) 70 CONTINUE * IF( WANTZ ) THEN * * Accumulate transformations in the matrix Z * DO 80 J = ILOZ, IHIZ SUM = T1*Z( J, K ) + T2*Z( J, K+1 ) Z( J, K ) = Z( J, K ) - SUM Z( J, K+1 ) = Z( J, K+1 ) - SUM*DCONJG( V2 ) 80 CONTINUE END IF * IF( K.EQ.M .AND. M.GT.L ) THEN * * If the QR step was started at row M > L because two * consecutive small subdiagonals were found, then extra * scaling must be performed to ensure that H(M,M-1) remains * real. * TEMP = ONE - T1 TEMP = TEMP / DLAPY2( DBLE( TEMP ), DIMAG( TEMP ) ) H( M+1, M ) = H( M+1, M )*DCONJG( TEMP ) IF( M+2.LE.I ) $ H( M+2, M+1 ) = H( M+2, M+1 )*TEMP DO 90 J = M, I IF( J.NE.M+1 ) THEN IF( I2.GT.J ) $ CALL ZSCAL( I2-J, TEMP, H( J, J+1 ), LDH ) CALL ZSCAL( J-I1, DCONJG( TEMP ), H( I1, J ), 1 ) IF( WANTZ ) THEN CALL ZSCAL( NZ, DCONJG( TEMP ), Z( ILOZ, J ), $ 1 ) END IF END IF 90 CONTINUE END IF 100 CONTINUE * * Ensure that H(I,I-1) is real. * TEMP = H( I, I-1 ) IF( DIMAG( TEMP ).NE.RZERO ) THEN RTEMP = DLAPY2( DBLE( TEMP ), DIMAG( TEMP ) ) H( I, I-1 ) = RTEMP TEMP = TEMP / RTEMP IF( I2.GT.I ) $ CALL ZSCAL( I2-I, DCONJG( TEMP ), H( I, I+1 ), LDH ) CALL ZSCAL( I-I1, TEMP, H( I1, I ), 1 ) IF( WANTZ ) THEN CALL ZSCAL( NZ, TEMP, Z( ILOZ, I ), 1 ) END IF END IF * 110 CONTINUE * * Failure to converge in remaining number of iterations * INFO = I RETURN * 120 CONTINUE * * H(I,I-1) is negligible: one eigenvalue has converged. * W( I ) = H( I, I ) * * Decrement number of remaining iterations, and return to start of * the main loop with new value of I. * ITN = ITN - ITS I = L - 1 GO TO 10 * 130 CONTINUE RETURN * * End of ZLAHQR * END octave-1.1.0/libcruft/lapack/zlahrd.f100666 415 17 15227 5306544275 15700 0ustar jweusers SUBROUTINE ZLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER K, LDA, LDT, LDY, N, NB * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), T( LDT, NB ), TAU( NB ), $ Y( LDY, NB ) * .. * * Purpose * ======= * * ZLAHRD reduces the first NB columns of a complex general n-by-(n-k+1) * matrix A so that elements below the k-th subdiagonal are zero. The * reduction is performed by a unitary similarity transformation * Q' * A * Q. The routine returns the matrices V and T which determine * Q as a block reflector I - V*T*V', and also the matrix Y = A * V * T. * * This is an auxiliary routine called by ZGEHRD. * * Arguments * ========= * * N (input) INTEGER * The order of the matrix A. * * K (input) INTEGER * The offset for the reduction. Elements below the k-th * subdiagonal in the first NB columns are reduced to zero. * * NB (input) INTEGER * The number of columns to be reduced. * * A (input/output) COMPLEX*16 array, dimension (LDA,N-K+1) * On entry, the n-by-(n-k+1) general matrix A. * On exit, the elements on and above the k-th subdiagonal in * the first NB columns are overwritten with the corresponding * elements of the reduced matrix; the elements below the k-th * subdiagonal, with the array TAU, represent the matrix Q as a * product of elementary reflectors. The other columns of A are * unchanged. See Further Details. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (output) COMPLEX*16 array, dimension (NB) * The scalar factors of the elementary reflectors. See Further * Details. * * T (output) COMPLEX*16 array, dimension (NB,NB) * The upper triangular matrix T. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= NB. * * Y (output) COMPLEX*16 array, dimension (LDY,NB) * The n-by-nb matrix Y. * * LDY (input) INTEGER * The leading dimension of the array Y. LDY >= max(1,N). * * Further Details * =============== * * The matrix Q is represented as a product of nb elementary reflectors * * Q = H(1) H(2) . . . H(nb). * * Each H(i) has the form * * H(i) = I - tau * v * v' * * where tau is a complex scalar, and v is a complex vector with * v(1:i+k-1) = 0, v(i+k) = 1; v(i+k+1:n) is stored on exit in * A(i+k+1:n,i), and tau in TAU(i). * * The elements of the vectors v together form the (n-k+1)-by-nb matrix * V which is needed, with T and Y, to apply the transformation to the * unreduced part of the matrix, using an update of the form: * A := (I - V*T*V') * (A - Y*V'). * * The contents of A on exit are illustrated by the following example * with n = 7, k = 3 and nb = 2: * * ( a h a a a ) * ( a h a a a ) * ( a h a a a ) * ( h h a a a ) * ( v1 h a a a ) * ( v1 v2 a a a ) * ( v1 v2 a a a ) * * where a denotes an element of the original matrix A, h denotes a * modified element of the upper Hessenberg matrix H, and vi denotes an * element of the vector defining H(i). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I COMPLEX*16 EI * .. * .. External Subroutines .. EXTERNAL ZAXPY, ZCOPY, ZGEMV, ZLACGV, ZLARFG, ZSCAL, $ ZTRMV * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * * Quick return if possible * IF( N.LE.1 ) $ RETURN * DO 10 I = 1, NB IF( I.GT.1 ) THEN * * Update A(1:n,i) * * Compute i-th column of A - Y * V' * CALL ZLACGV( I-1, A( K+I-1, 1 ), LDA ) CALL ZGEMV( 'No transpose', N, I-1, -ONE, Y, LDY, $ A( K+I-1, 1 ), LDA, ONE, A( 1, I ), 1 ) CALL ZLACGV( I-1, A( K+I-1, 1 ), LDA ) * * Apply I - V * T' * V' to this column (call it b) from the * left, using the last column of T as workspace * * Let V = ( V1 ) and b = ( b1 ) (first I-1 rows) * ( V2 ) ( b2 ) * * where V1 is unit lower triangular * * w := V1' * b1 * CALL ZCOPY( I-1, A( K+1, I ), 1, T( 1, NB ), 1 ) CALL ZTRMV( 'Lower', 'Conjugate transpose', 'Unit', I-1, $ A( K+1, 1 ), LDA, T( 1, NB ), 1 ) * * w := w + V2'*b2 * CALL ZGEMV( 'Conjugate transpose', N-K-I+1, I-1, ONE, $ A( K+I, 1 ), LDA, A( K+I, I ), 1, ONE, $ T( 1, NB ), 1 ) * * w := T'*w * CALL ZTRMV( 'Upper', 'Conjugate transpose', 'Non-unit', I-1, $ T, LDT, T( 1, NB ), 1 ) * * b2 := b2 - V2*w * CALL ZGEMV( 'No transpose', N-K-I+1, I-1, -ONE, A( K+I, 1 ), $ LDA, T( 1, NB ), 1, ONE, A( K+I, I ), 1 ) * * b1 := b1 - V1*w * CALL ZTRMV( 'Lower', 'No transpose', 'Unit', I-1, $ A( K+1, 1 ), LDA, T( 1, NB ), 1 ) CALL ZAXPY( I-1, -ONE, T( 1, NB ), 1, A( K+1, I ), 1 ) * A( K+I-1, I-1 ) = EI END IF * * Generate the elementary reflector H(i) to annihilate * A(k+i+1:n,i) * EI = A( K+I, I ) CALL ZLARFG( N-K-I+1, EI, A( MIN( K+I+1, N ), I ), 1, $ TAU( I ) ) A( K+I, I ) = ONE * * Compute Y(1:n,i) * CALL ZGEMV( 'No transpose', N, N-K-I+1, ONE, A( 1, I+1 ), LDA, $ A( K+I, I ), 1, ZERO, Y( 1, I ), 1 ) CALL ZGEMV( 'Conjugate transpose', N-K-I+1, I-1, ONE, $ A( K+I, 1 ), LDA, A( K+I, I ), 1, ZERO, T( 1, I ), $ 1 ) CALL ZGEMV( 'No transpose', N, I-1, -ONE, Y, LDY, T( 1, I ), 1, $ ONE, Y( 1, I ), 1 ) CALL ZSCAL( N, TAU( I ), Y( 1, I ), 1 ) * * Compute T(1:i,i) * CALL ZSCAL( I-1, -TAU( I ), T( 1, I ), 1 ) CALL ZTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T, LDT, $ T( 1, I ), 1 ) T( I, I ) = TAU( I ) * 10 CONTINUE A( K+NB, NB ) = EI * RETURN * * End of ZLAHRD * END octave-1.1.0/libcruft/lapack/zlange.f100666 415 17 7704 5306544277 15657 0ustar jweusers DOUBLE PRECISION FUNCTION ZLANGE( NORM, M, N, A, LDA, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER NORM INTEGER LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION WORK( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLANGE returns the value of the one norm, or the Frobenius norm, or * the infinity norm, or the element of largest absolute value of a * complex matrix A. * * Description * =========== * * ZLANGE returns the value * * ZLANGE = ( max(abs(A(i,j))), NORM = 'M' or 'm' * ( * ( norm1(A), NORM = '1', 'O' or 'o' * ( * ( normI(A), NORM = 'I' or 'i' * ( * ( normF(A), NORM = 'F', 'f', 'E' or 'e' * * where norm1 denotes the one norm of a matrix (maximum column sum), * normI denotes the infinity norm of a matrix (maximum row sum) and * normF denotes the Frobenius norm of a matrix (square root of sum of * squares). Note that max(abs(A(i,j))) is not a matrix norm. * * Arguments * ========= * * NORM (input) CHARACTER*1 * Specifies the value to be returned in ZLANGE as described * above. * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. When M = 0, * ZLANGE is set to zero. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. When N = 0, * ZLANGE is set to zero. * * A (input) COMPLEX*16 array, dimension (LDA,N) * The m by n matrix A. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(M,1). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK), * where LWORK >= M when NORM = 'I'; otherwise, WORK is not * referenced. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J DOUBLE PRECISION SCALE, SUM, VALUE * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL ZLASSQ * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * IF( MIN( M, N ).EQ.0 ) THEN VALUE = ZERO ELSE IF( LSAME( NORM, 'M' ) ) THEN * * Find max(abs(A(i,j))). * VALUE = ZERO DO 20 J = 1, N DO 10 I = 1, M VALUE = MAX( VALUE, ABS( A( I, J ) ) ) 10 CONTINUE 20 CONTINUE ELSE IF( ( LSAME( NORM, 'O' ) ) .OR. ( NORM.EQ.'1' ) ) THEN * * Find norm1(A). * VALUE = ZERO DO 40 J = 1, N SUM = ZERO DO 30 I = 1, M SUM = SUM + ABS( A( I, J ) ) 30 CONTINUE VALUE = MAX( VALUE, SUM ) 40 CONTINUE ELSE IF( LSAME( NORM, 'I' ) ) THEN * * Find normI(A). * DO 50 I = 1, M WORK( I ) = ZERO 50 CONTINUE DO 70 J = 1, N DO 60 I = 1, M WORK( I ) = WORK( I ) + ABS( A( I, J ) ) 60 CONTINUE 70 CONTINUE VALUE = ZERO DO 80 I = 1, M VALUE = MAX( VALUE, WORK( I ) ) 80 CONTINUE ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN * * Find normF(A). * SCALE = ZERO SUM = ONE DO 90 J = 1, N CALL ZLASSQ( M, A( 1, J ), 1, SCALE, SUM ) 90 CONTINUE VALUE = SCALE*SQRT( SUM ) END IF * ZLANGE = VALUE RETURN * * End of ZLANGE * END octave-1.1.0/libcruft/lapack/zlanhs.f100666 415 17 7661 5306544274 15675 0ustar jweusers DOUBLE PRECISION FUNCTION ZLANHS( NORM, N, A, LDA, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER NORM INTEGER LDA, N * .. * .. Array Arguments .. DOUBLE PRECISION WORK( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLANHS returns the value of the one norm, or the Frobenius norm, or * the infinity norm, or the element of largest absolute value of a * Hessenberg matrix A. * * Description * =========== * * ZLANHS returns the value * * ZLANHS = ( max(abs(A(i,j))), NORM = 'M' or 'm' * ( * ( norm1(A), NORM = '1', 'O' or 'o' * ( * ( normI(A), NORM = 'I' or 'i' * ( * ( normF(A), NORM = 'F', 'f', 'E' or 'e' * * where norm1 denotes the one norm of a matrix (maximum column sum), * normI denotes the infinity norm of a matrix (maximum row sum) and * normF denotes the Frobenius norm of a matrix (square root of sum of * squares). Note that max(abs(A(i,j))) is not a matrix norm. * * Arguments * ========= * * NORM (input) CHARACTER*1 * Specifies the value to be returned in ZLANHS as described * above. * * N (input) INTEGER * The order of the matrix A. N >= 0. When N = 0, ZLANHS is * set to zero. * * A (input) COMPLEX*16 array, dimension (LDA,N) * The n by n upper Hessenberg matrix A; the part of A below the * first sub-diagonal is not referenced. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(N,1). * * WORK (workspace) DOUBLE PRECISION array, dimension (LWORK), * where LWORK >= N when NORM = 'I'; otherwise, WORK is not * referenced. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J DOUBLE PRECISION SCALE, SUM, VALUE * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL ZLASSQ * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN, SQRT * .. * .. Executable Statements .. * IF( N.EQ.0 ) THEN VALUE = ZERO ELSE IF( LSAME( NORM, 'M' ) ) THEN * * Find max(abs(A(i,j))). * VALUE = ZERO DO 20 J = 1, N DO 10 I = 1, MIN( N, J+1 ) VALUE = MAX( VALUE, ABS( A( I, J ) ) ) 10 CONTINUE 20 CONTINUE ELSE IF( ( LSAME( NORM, 'O' ) ) .OR. ( NORM.EQ.'1' ) ) THEN * * Find norm1(A). * VALUE = ZERO DO 40 J = 1, N SUM = ZERO DO 30 I = 1, MIN( N, J+1 ) SUM = SUM + ABS( A( I, J ) ) 30 CONTINUE VALUE = MAX( VALUE, SUM ) 40 CONTINUE ELSE IF( LSAME( NORM, 'I' ) ) THEN * * Find normI(A). * DO 50 I = 1, N WORK( I ) = ZERO 50 CONTINUE DO 70 J = 1, N DO 60 I = 1, MIN( N, J+1 ) WORK( I ) = WORK( I ) + ABS( A( I, J ) ) 60 CONTINUE 70 CONTINUE VALUE = ZERO DO 80 I = 1, N VALUE = MAX( VALUE, WORK( I ) ) 80 CONTINUE ELSE IF( ( LSAME( NORM, 'F' ) ) .OR. ( LSAME( NORM, 'E' ) ) ) THEN * * Find normF(A). * SCALE = ZERO SUM = ONE DO 90 J = 1, N CALL ZLASSQ( MIN( N, J+1 ), A( 1, J ), 1, SCALE, SUM ) 90 CONTINUE VALUE = SCALE*SQRT( SUM ) END IF * ZLANHS = VALUE RETURN * * End of ZLANHS * END octave-1.1.0/libcruft/lapack/zlarfb.f100666 415 17 44243 5306544275 15674 0ustar jweusers SUBROUTINE ZLARFB( SIDE, TRANS, DIRECT, STOREV, M, N, K, V, LDV, $ T, LDT, C, LDC, WORK, LDWORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, SIDE, STOREV, TRANS INTEGER K, LDC, LDT, LDV, LDWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 C( LDC, * ), T( LDT, * ), V( LDV, * ), $ WORK( LDWORK, * ) * .. * * Purpose * ======= * * ZLARFB applies a complex block reflector H or its transpose H' to a * complex m by n matrix C, from either the left or the right. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply H or H' from the Left * = 'R': apply H or H' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply H (No transpose) * = 'C': apply H' (Conjugate transpose) * * DIRECT (input) CHARACTER*1 * Indicates how H is formed from a product of elementary * reflectors * = 'F': H = H(1) H(2) . . . H(k) (Forward) * = 'B': H = H(k) . . . H(2) H(1) (Backward) * * STOREV (input) CHARACTER*1 * Indicates how the vectors which define the elementary * reflectors are stored: * = 'C': Columnwise * = 'R': Rowwise * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * K (input) INTEGER * The order of the matrix T (= the number of elementary * reflectors whose product defines the block reflector). * * V (input) COMPLEX*16 array, dimension * (LDV,K) if STOREV = 'C' * (LDV,M) if STOREV = 'R' and SIDE = 'L' * (LDV,N) if STOREV = 'R' and SIDE = 'R' * The matrix V. See further details. * * LDV (input) INTEGER * The leading dimension of the array V. * If STOREV = 'C' and SIDE = 'L', LDV >= max(1,M); * if STOREV = 'C' and SIDE = 'R', LDV >= max(1,N); * if STOREV = 'R', LDV >= K. * * T (input) COMPLEX*16 array, dimension (LDT,K) * The triangular k-by-k matrix T in the representation of the * block reflector. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= K. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by H*C or H'*C or C*H or C*H'. * * LDC (input) INTEGER * The leading dimension of the array C. LDA >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension (LDWORK,K) * * LDWORK (input) INTEGER * The leading dimension of the array WORK. * If SIDE = 'L', LDWORK >= max(1,N); * if SIDE = 'R', LDWORK >= max(1,M). * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. CHARACTER TRANST INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL ZCOPY, ZGEMM, ZLACGV, ZTRMM * .. * .. Intrinsic Functions .. INTRINSIC DCONJG * .. * .. Executable Statements .. * * Quick return if possible * IF( M.LE.0 .OR. N.LE.0 ) $ RETURN * IF( LSAME( TRANS, 'N' ) ) THEN TRANST = 'C' ELSE TRANST = 'N' END IF * IF( LSAME( STOREV, 'C' ) ) THEN * IF( LSAME( DIRECT, 'F' ) ) THEN * * Let V = ( V1 ) (first K rows) * ( V2 ) * where V1 is unit lower triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V = (C1'*V1 + C2'*V2) (stored in WORK) * * W := C1' * DO 10 J = 1, K CALL ZCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) CALL ZLACGV( N, WORK( 1, J ), 1 ) 10 CONTINUE * * W := W * V1 * CALL ZTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N, $ K, ONE, V, LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C2'*V2 * CALL ZGEMM( 'Conjugate transpose', 'No transpose', N, $ K, M-K, ONE, C( K+1, 1 ), LDC, $ V( K+1, 1 ), LDV, ONE, WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL ZTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V * W' * IF( M.GT.K ) THEN * * C2 := C2 - V2 * W' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', $ M-K, N, K, -ONE, V( K+1, 1 ), LDV, WORK, $ LDWORK, ONE, C( K+1, 1 ), LDC ) END IF * * W := W * V1' * CALL ZTRMM( 'Right', 'Lower', 'Conjugate transpose', $ 'Unit', N, K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W' * DO 30 J = 1, K DO 20 I = 1, N C( J, I ) = C( J, I ) - DCONJG( WORK( I, J ) ) 20 CONTINUE 30 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V = (C1*V1 + C2*V2) (stored in WORK) * * W := C1 * DO 40 J = 1, K CALL ZCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 ) 40 CONTINUE * * W := W * V1 * CALL ZTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M, $ K, ONE, V, LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C2 * V2 * CALL ZGEMM( 'No transpose', 'No transpose', M, K, N-K, $ ONE, C( 1, K+1 ), LDC, V( K+1, 1 ), LDV, $ ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL ZTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V' * IF( N.GT.K ) THEN * * C2 := C2 - W * V2' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', M, $ N-K, K, -ONE, WORK, LDWORK, V( K+1, 1 ), $ LDV, ONE, C( 1, K+1 ), LDC ) END IF * * W := W * V1' * CALL ZTRMM( 'Right', 'Lower', 'Conjugate transpose', $ 'Unit', M, K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 60 J = 1, K DO 50 I = 1, M C( I, J ) = C( I, J ) - WORK( I, J ) 50 CONTINUE 60 CONTINUE END IF * ELSE * * Let V = ( V1 ) * ( V2 ) (last K rows) * where V2 is unit upper triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V = (C1'*V1 + C2'*V2) (stored in WORK) * * W := C2' * DO 70 J = 1, K CALL ZCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 ) CALL ZLACGV( N, WORK( 1, J ), 1 ) 70 CONTINUE * * W := W * V2 * CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N, $ K, ONE, V( M-K+1, 1 ), LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C1'*V1 * CALL ZGEMM( 'Conjugate transpose', 'No transpose', N, $ K, M-K, ONE, C, LDC, V, LDV, ONE, WORK, $ LDWORK ) END IF * * W := W * T' or W * T * CALL ZTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V * W' * IF( M.GT.K ) THEN * * C1 := C1 - V1 * W' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', $ M-K, N, K, -ONE, V, LDV, WORK, LDWORK, $ ONE, C, LDC ) END IF * * W := W * V2' * CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose', $ 'Unit', N, K, ONE, V( M-K+1, 1 ), LDV, WORK, $ LDWORK ) * * C2 := C2 - W' * DO 90 J = 1, K DO 80 I = 1, N C( M-K+J, I ) = C( M-K+J, I ) - $ DCONJG( WORK( I, J ) ) 80 CONTINUE 90 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V = (C1*V1 + C2*V2) (stored in WORK) * * W := C2 * DO 100 J = 1, K CALL ZCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 ) 100 CONTINUE * * W := W * V2 * CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M, $ K, ONE, V( N-K+1, 1 ), LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C1 * V1 * CALL ZGEMM( 'No transpose', 'No transpose', M, K, N-K, $ ONE, C, LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL ZTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V' * IF( N.GT.K ) THEN * * C1 := C1 - W * V1' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', M, $ N-K, K, -ONE, WORK, LDWORK, V, LDV, ONE, $ C, LDC ) END IF * * W := W * V2' * CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose', $ 'Unit', M, K, ONE, V( N-K+1, 1 ), LDV, WORK, $ LDWORK ) * * C2 := C2 - W * DO 120 J = 1, K DO 110 I = 1, M C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J ) 110 CONTINUE 120 CONTINUE END IF END IF * ELSE IF( LSAME( STOREV, 'R' ) ) THEN * IF( LSAME( DIRECT, 'F' ) ) THEN * * Let V = ( V1 V2 ) (V1: first K columns) * where V1 is unit upper triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V' = (C1'*V1' + C2'*V2') (stored in WORK) * * W := C1' * DO 130 J = 1, K CALL ZCOPY( N, C( J, 1 ), LDC, WORK( 1, J ), 1 ) CALL ZLACGV( N, WORK( 1, J ), 1 ) 130 CONTINUE * * W := W * V1' * CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose', $ 'Unit', N, K, ONE, V, LDV, WORK, LDWORK ) IF( M.GT.K ) THEN * * W := W + C2'*V2' * CALL ZGEMM( 'Conjugate transpose', $ 'Conjugate transpose', N, K, M-K, ONE, $ C( K+1, 1 ), LDC, V( 1, K+1 ), LDV, ONE, $ WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL ZTRMM( 'Right', 'Upper', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V' * W' * IF( M.GT.K ) THEN * * C2 := C2 - V2' * W' * CALL ZGEMM( 'Conjugate transpose', $ 'Conjugate transpose', M-K, N, K, -ONE, $ V( 1, K+1 ), LDV, WORK, LDWORK, ONE, $ C( K+1, 1 ), LDC ) END IF * * W := W * V1 * CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit', N, $ K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W' * DO 150 J = 1, K DO 140 I = 1, N C( J, I ) = C( J, I ) - DCONJG( WORK( I, J ) ) 140 CONTINUE 150 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V' = (C1*V1' + C2*V2') (stored in WORK) * * W := C1 * DO 160 J = 1, K CALL ZCOPY( M, C( 1, J ), 1, WORK( 1, J ), 1 ) 160 CONTINUE * * W := W * V1' * CALL ZTRMM( 'Right', 'Upper', 'Conjugate transpose', $ 'Unit', M, K, ONE, V, LDV, WORK, LDWORK ) IF( N.GT.K ) THEN * * W := W + C2 * V2' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', M, $ K, N-K, ONE, C( 1, K+1 ), LDC, $ V( 1, K+1 ), LDV, ONE, WORK, LDWORK ) END IF * * W := W * T or W * T' * CALL ZTRMM( 'Right', 'Upper', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V * IF( N.GT.K ) THEN * * C2 := C2 - W * V2 * CALL ZGEMM( 'No transpose', 'No transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V( 1, K+1 ), LDV, ONE, $ C( 1, K+1 ), LDC ) END IF * * W := W * V1 * CALL ZTRMM( 'Right', 'Upper', 'No transpose', 'Unit', M, $ K, ONE, V, LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 180 J = 1, K DO 170 I = 1, M C( I, J ) = C( I, J ) - WORK( I, J ) 170 CONTINUE 180 CONTINUE * END IF * ELSE * * Let V = ( V1 V2 ) (V2: last K columns) * where V2 is unit lower triangular. * IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C or H' * C where C = ( C1 ) * ( C2 ) * * W := C' * V' = (C1'*V1' + C2'*V2') (stored in WORK) * * W := C2' * DO 190 J = 1, K CALL ZCOPY( N, C( M-K+J, 1 ), LDC, WORK( 1, J ), 1 ) CALL ZLACGV( N, WORK( 1, J ), 1 ) 190 CONTINUE * * W := W * V2' * CALL ZTRMM( 'Right', 'Lower', 'Conjugate transpose', $ 'Unit', N, K, ONE, V( 1, M-K+1 ), LDV, WORK, $ LDWORK ) IF( M.GT.K ) THEN * * W := W + C1'*V1' * CALL ZGEMM( 'Conjugate transpose', $ 'Conjugate transpose', N, K, M-K, ONE, C, $ LDC, V, LDV, ONE, WORK, LDWORK ) END IF * * W := W * T' or W * T * CALL ZTRMM( 'Right', 'Lower', TRANST, 'Non-unit', N, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - V' * W' * IF( M.GT.K ) THEN * * C1 := C1 - V1' * W' * CALL ZGEMM( 'Conjugate transpose', $ 'Conjugate transpose', M-K, N, K, -ONE, V, $ LDV, WORK, LDWORK, ONE, C, LDC ) END IF * * W := W * V2 * CALL ZTRMM( 'Right', 'Lower', 'No transpose', 'Unit', N, $ K, ONE, V( 1, M-K+1 ), LDV, WORK, LDWORK ) * * C2 := C2 - W' * DO 210 J = 1, K DO 200 I = 1, N C( M-K+J, I ) = C( M-K+J, I ) - $ DCONJG( WORK( I, J ) ) 200 CONTINUE 210 CONTINUE * ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form C * H or C * H' where C = ( C1 C2 ) * * W := C * V' = (C1*V1' + C2*V2') (stored in WORK) * * W := C2 * DO 220 J = 1, K CALL ZCOPY( M, C( 1, N-K+J ), 1, WORK( 1, J ), 1 ) 220 CONTINUE * * W := W * V2' * CALL ZTRMM( 'Right', 'Lower', 'Conjugate transpose', $ 'Unit', M, K, ONE, V( 1, N-K+1 ), LDV, WORK, $ LDWORK ) IF( N.GT.K ) THEN * * W := W + C1 * V1' * CALL ZGEMM( 'No transpose', 'Conjugate transpose', M, $ K, N-K, ONE, C, LDC, V, LDV, ONE, WORK, $ LDWORK ) END IF * * W := W * T or W * T' * CALL ZTRMM( 'Right', 'Lower', TRANS, 'Non-unit', M, K, $ ONE, T, LDT, WORK, LDWORK ) * * C := C - W * V * IF( N.GT.K ) THEN * * C1 := C1 - W * V1 * CALL ZGEMM( 'No transpose', 'No transpose', M, N-K, K, $ -ONE, WORK, LDWORK, V, LDV, ONE, C, LDC ) END IF * * W := W * V2 * CALL ZTRMM( 'Right', 'Lower', 'No transpose', 'Unit', M, $ K, ONE, V( 1, N-K+1 ), LDV, WORK, LDWORK ) * * C1 := C1 - W * DO 240 J = 1, K DO 230 I = 1, M C( I, N-K+J ) = C( I, N-K+J ) - WORK( I, J ) 230 CONTINUE 240 CONTINUE * END IF * END IF END IF * RETURN * * End of ZLARFB * END octave-1.1.0/libcruft/lapack/zlarfg.f100666 415 17 7753 5306544275 15666 0ustar jweusers SUBROUTINE ZLARFG( N, ALPHA, X, INCX, TAU ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INCX, N COMPLEX*16 ALPHA, TAU * .. * .. Array Arguments .. COMPLEX*16 X( * ) * .. * * Purpose * ======= * * ZLARFG generates a complex elementary reflector H of order n, such * that * * H' * ( alpha ) = ( beta ), H' * H = I. * ( x ) ( 0 ) * * where alpha and beta are scalars, with beta real, and x is an * (n-1)-element complex vector. H is represented in the form * * H = I - tau * ( 1 ) * ( 1 v' ) , * ( v ) * * where tau is a complex scalar and v is a complex (n-1)-element * vector. Note that H is not hermitian. * * If the elements of x are all zero and alpha is real, then tau = 0 * and H is taken to be the unit matrix. * * Otherwise 1 <= real(tau) <= 2 and abs(tau-1) <= 1 . * * Arguments * ========= * * N (input) INTEGER * The order of the elementary reflector. * * ALPHA (input/output) COMPLEX*16 * On entry, the value alpha. * On exit, it is overwritten with the value beta. * * X (input/output) COMPLEX*16 array, dimension * (1+(N-2)*abs(INCX)) * On entry, the vector x. * On exit, it is overwritten with the vector v. * * INCX (input) INTEGER * The increment between elements of X. INCX <> 0. * * TAU (output) COMPLEX*16 * The value tau. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER J, KNT DOUBLE PRECISION ALPHI, ALPHR, BETA, RSAFMN, SAFMIN, XNORM * .. * .. External Functions .. DOUBLE PRECISION DLAMCH, DLAPY3, DZNRM2 COMPLEX*16 ZLADIV EXTERNAL DLAMCH, DLAPY3, DZNRM2, ZLADIV * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCMPLX, DIMAG, SIGN * .. * .. External Subroutines .. EXTERNAL ZDSCAL, ZSCAL * .. * .. Executable Statements .. * IF( N.LE.0 ) THEN TAU = ZERO RETURN END IF * XNORM = DZNRM2( N-1, X, INCX ) ALPHR = DBLE( ALPHA ) ALPHI = DIMAG( ALPHA ) * IF( XNORM.EQ.ZERO .AND. ALPHI.EQ.ZERO ) THEN * * H = I * TAU = ZERO ELSE * * general case * BETA = -SIGN( DLAPY3( ALPHR, ALPHI, XNORM ), ALPHR ) SAFMIN = DLAMCH( 'S' ) RSAFMN = ONE / SAFMIN * IF( ABS( BETA ).LT.SAFMIN ) THEN * * XNORM, BETA may be inaccurate; scale X and recompute them * KNT = 0 10 CONTINUE KNT = KNT + 1 CALL ZDSCAL( N-1, RSAFMN, X, INCX ) BETA = BETA*RSAFMN ALPHI = ALPHI*RSAFMN ALPHR = ALPHR*RSAFMN IF( ABS( BETA ).LT.SAFMIN ) $ GO TO 10 * * New BETA is at most 1, at least SAFMIN * XNORM = DZNRM2( N-1, X, INCX ) ALPHA = DCMPLX( ALPHR, ALPHI ) BETA = -SIGN( DLAPY3( ALPHR, ALPHI, XNORM ), ALPHR ) TAU = DCMPLX( ( BETA-ALPHR ) / BETA, -ALPHI / BETA ) ALPHA = ZLADIV( DCMPLX( ONE ), ALPHA-BETA ) CALL ZSCAL( N-1, ALPHA, X, INCX ) * * If ALPHA is subnormal, it may lose relative accuracy * ALPHA = BETA DO 20 J = 1, KNT ALPHA = ALPHA*SAFMIN 20 CONTINUE ELSE TAU = DCMPLX( ( BETA-ALPHR ) / BETA, -ALPHI / BETA ) ALPHA = ZLADIV( DCMPLX( ONE ), ALPHA-BETA ) CALL ZSCAL( N-1, ALPHA, X, INCX ) ALPHA = BETA END IF END IF * RETURN * * End of ZLARFG * END octave-1.1.0/libcruft/lapack/zlarft.f100666 415 17 16471 5306544274 15717 0ustar jweusers SUBROUTINE ZLARFT( DIRECT, STOREV, N, K, V, LDV, TAU, T, LDT ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, STOREV INTEGER K, LDT, LDV, N * .. * .. Array Arguments .. COMPLEX*16 T( LDT, * ), TAU( * ), V( LDV, * ) * .. * * Purpose * ======= * * ZLARFT forms the triangular factor T of a complex block reflector H * of order n, which is defined as a product of k elementary reflectors. * * If DIRECT = 'F', H = H(1) H(2) . . . H(k) and T is upper triangular; * * If DIRECT = 'B', H = H(k) . . . H(2) H(1) and T is lower triangular. * * If STOREV = 'C', the vector which defines the elementary reflector * H(i) is stored in the i-th column of the array V, and * * H = I - V * T * V' * * If STOREV = 'R', the vector which defines the elementary reflector * H(i) is stored in the i-th row of the array V, and * * H = I - V' * T * V * * Arguments * ========= * * DIRECT (input) CHARACTER*1 * Specifies the order in which the elementary reflectors are * multiplied to form the block reflector: * = 'F': H = H(1) H(2) . . . H(k) (Forward) * = 'B': H = H(k) . . . H(2) H(1) (Backward) * * STOREV (input) CHARACTER*1 * Specifies how the vectors which define the elementary * reflectors are stored (see also Further Details): * = 'C': columnwise * = 'R': rowwise * * N (input) INTEGER * The order of the block reflector H. N >= 0. * * K (input) INTEGER * The order of the triangular factor T (= the number of * elementary reflectors). K >= 1. * * V (input/output) COMPLEX*16 array, dimension * (LDV,K) if STOREV = 'C' * (LDV,N) if STOREV = 'R' * The matrix V. See further details. * * LDV (input) INTEGER * The leading dimension of the array V. * If STOREV = 'C', LDV >= max(1,N); if STOREV = 'R', LDV >= K. * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i). * * T (output) COMPLEX*16 array, dimension (LDT,K) * The k by k triangular factor T of the block reflector. * If DIRECT = 'F', T is upper triangular; if DIRECT = 'B', T is * lower triangular. The rest of the array is not used. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= K. * * Further Details * =============== * * The shape of the matrix V and the storage of the vectors which define * the H(i) is best illustrated by the following example with n = 5 and * k = 3. The elements equal to 1 are not stored; the corresponding * array elements are modified but restored on exit. The rest of the * array is not used. * * DIRECT = 'F' and STOREV = 'C': DIRECT = 'F' and STOREV = 'R': * * V = ( 1 ) V = ( 1 v1 v1 v1 v1 ) * ( v1 1 ) ( 1 v2 v2 v2 ) * ( v1 v2 1 ) ( 1 v3 v3 ) * ( v1 v2 v3 ) * ( v1 v2 v3 ) * * DIRECT = 'B' and STOREV = 'C': DIRECT = 'B' and STOREV = 'R': * * V = ( v1 v2 v3 ) V = ( v1 v1 1 ) * ( v1 v2 v3 ) ( v2 v2 v2 1 ) * ( 1 v2 v3 ) ( v3 v3 v3 v3 1 ) * ( 1 v3 ) * ( 1 ) * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J COMPLEX*16 VII * .. * .. External Subroutines .. EXTERNAL ZGEMV, ZLACGV, ZTRMV * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Executable Statements .. * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * IF( LSAME( DIRECT, 'F' ) ) THEN DO 20 I = 1, K IF( TAU( I ).EQ.ZERO ) THEN * * H(i) = I * DO 10 J = 1, I T( J, I ) = ZERO 10 CONTINUE ELSE * * general case * VII = V( I, I ) V( I, I ) = ONE IF( LSAME( STOREV, 'C' ) ) THEN * * T(1:i-1,i) := - tau(i) * V(i:n,1:i-1)' * V(i:n,i) * CALL ZGEMV( 'Conjugate transpose', N-I+1, I-1, $ -TAU( I ), V( I, 1 ), LDV, V( I, I ), 1, $ ZERO, T( 1, I ), 1 ) ELSE * * T(1:i-1,i) := - tau(i) * V(1:i-1,i:n) * V(i,i:n)' * IF( I.LT.N ) $ CALL ZLACGV( N-I, V( I, I+1 ), LDV ) CALL ZGEMV( 'No transpose', I-1, N-I+1, -TAU( I ), $ V( 1, I ), LDV, V( I, I ), LDV, ZERO, $ T( 1, I ), 1 ) IF( I.LT.N ) $ CALL ZLACGV( N-I, V( I, I+1 ), LDV ) END IF V( I, I ) = VII * * T(1:i-1,i) := T(1:i-1,1:i-1) * T(1:i-1,i) * CALL ZTRMV( 'Upper', 'No transpose', 'Non-unit', I-1, T, $ LDT, T( 1, I ), 1 ) T( I, I ) = TAU( I ) END IF 20 CONTINUE ELSE DO 40 I = K, 1, -1 IF( TAU( I ).EQ.ZERO ) THEN * * H(i) = I * DO 30 J = I, K T( J, I ) = ZERO 30 CONTINUE ELSE * * general case * IF( I.LT.K ) THEN IF( LSAME( STOREV, 'C' ) ) THEN VII = V( N-K+I, I ) V( N-K+I, I ) = ONE * * T(i+1:k,i) := * - tau(i) * V(1:n-k+i,i+1:k)' * V(1:n-k+i,i) * CALL ZGEMV( 'Conjugate transpose', N-K+I, K-I, $ -TAU( I ), V( 1, I+1 ), LDV, V( 1, I ), $ 1, ZERO, T( I+1, I ), 1 ) V( N-K+I, I ) = VII ELSE VII = V( I, N-K+I ) V( I, N-K+I ) = ONE * * T(i+1:k,i) := * - tau(i) * V(i+1:k,1:n-k+i) * V(i,1:n-k+i)' * CALL ZLACGV( N-K+I-1, V( I, 1 ), LDV ) CALL ZGEMV( 'No transpose', K-I, N-K+I, -TAU( I ), $ V( I+1, 1 ), LDV, V( I, 1 ), LDV, ZERO, $ T( I+1, I ), 1 ) CALL ZLACGV( N-K+I-1, V( I, 1 ), LDV ) V( I, N-K+I ) = VII END IF * * T(i+1:k,i) := T(i+1:k,i+1:k) * T(i+1:k,i) * CALL ZTRMV( 'Lower', 'No transpose', 'Non-unit', K-I, $ T( I+1, I+1 ), LDT, T( I+1, I ), 1 ) END IF T( I, I ) = TAU( I ) END IF 40 CONTINUE END IF RETURN * * End of ZLARFT * END octave-1.1.0/libcruft/lapack/zlarfx.f100666 415 17 45776 5306544273 15734 0ustar jweusers SUBROUTINE ZLARFX( SIDE, M, N, V, TAU, C, LDC, WORK ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE INTEGER LDC, M, N COMPLEX*16 TAU * .. * .. Array Arguments .. COMPLEX*16 C( LDC, * ), V( * ), WORK( * ) * .. * * Purpose * ======= * * ZLARFX applies a complex elementary reflector H to a complex m by n * matrix C, from either the left or the right. H is represented in the * form * * H = I - tau * v * v' * * where tau is a complex scalar and v is a complex vector. * * If tau = 0, then H is taken to be the unit matrix * * This version uses inline code if H has order < 11. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': form H * C * = 'R': form C * H * * M (input) INTEGER * The number of rows of the matrix C. * * N (input) INTEGER * The number of columns of the matrix C. * * V (input) COMPLEX*16 array, dimension (M) if SIDE = 'L' * or (N) if SIDE = 'R' * The vector v in the representation of H. * * TAU (input) COMPLEX*16 * The value tau in the representation of H. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m by n matrix C. * On exit, C is overwritten by the matrix H * C if SIDE = 'L', * or C * H if SIDE = 'R'. * * LDC (input) INTEGER * The leading dimension of the array C. LDA >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension (N) if SIDE = 'L' * or (M) if SIDE = 'R' * WORK is not referenced if H has order < 11. * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER J COMPLEX*16 SUM, T1, T10, T2, T3, T4, T5, T6, T7, T8, T9, $ V1, V10, V2, V3, V4, V5, V6, V7, V8, V9 * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL ZGEMV, ZGERC * .. * .. Intrinsic Functions .. INTRINSIC DCONJG * .. * .. Executable Statements .. * IF( TAU.EQ.ZERO ) $ RETURN IF( LSAME( SIDE, 'L' ) ) THEN * * Form H * C, where H has order m. * GO TO ( 10, 30, 50, 70, 90, 110, 130, 150, $ 170, 190 )M * * Code for general M * * w := C'*v * CALL ZGEMV( 'Conjugate transpose', M, N, ONE, C, LDC, V, 1, $ ZERO, WORK, 1 ) * * C := C - tau * v * w' * CALL ZGERC( M, N, -TAU, V, 1, WORK, 1, C, LDC ) GO TO 410 10 CONTINUE * * Special code for 1 x 1 Householder * T1 = ONE - TAU*V( 1 )*DCONJG( V( 1 ) ) DO 20 J = 1, N C( 1, J ) = T1*C( 1, J ) 20 CONTINUE GO TO 410 30 CONTINUE * * Special code for 2 x 2 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) DO 40 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 40 CONTINUE GO TO 410 50 CONTINUE * * Special code for 3 x 3 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) DO 60 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 60 CONTINUE GO TO 410 70 CONTINUE * * Special code for 4 x 4 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) DO 80 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 80 CONTINUE GO TO 410 90 CONTINUE * * Special code for 5 x 5 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) DO 100 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 100 CONTINUE GO TO 410 110 CONTINUE * * Special code for 6 x 6 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) V6 = DCONJG( V( 6 ) ) T6 = TAU*DCONJG( V6 ) DO 120 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 120 CONTINUE GO TO 410 130 CONTINUE * * Special code for 7 x 7 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) V6 = DCONJG( V( 6 ) ) T6 = TAU*DCONJG( V6 ) V7 = DCONJG( V( 7 ) ) T7 = TAU*DCONJG( V7 ) DO 140 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 140 CONTINUE GO TO 410 150 CONTINUE * * Special code for 8 x 8 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) V6 = DCONJG( V( 6 ) ) T6 = TAU*DCONJG( V6 ) V7 = DCONJG( V( 7 ) ) T7 = TAU*DCONJG( V7 ) V8 = DCONJG( V( 8 ) ) T8 = TAU*DCONJG( V8 ) DO 160 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 160 CONTINUE GO TO 410 170 CONTINUE * * Special code for 9 x 9 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) V6 = DCONJG( V( 6 ) ) T6 = TAU*DCONJG( V6 ) V7 = DCONJG( V( 7 ) ) T7 = TAU*DCONJG( V7 ) V8 = DCONJG( V( 8 ) ) T8 = TAU*DCONJG( V8 ) V9 = DCONJG( V( 9 ) ) T9 = TAU*DCONJG( V9 ) DO 180 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) + V9*C( 9, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 C( 9, J ) = C( 9, J ) - SUM*T9 180 CONTINUE GO TO 410 190 CONTINUE * * Special code for 10 x 10 Householder * V1 = DCONJG( V( 1 ) ) T1 = TAU*DCONJG( V1 ) V2 = DCONJG( V( 2 ) ) T2 = TAU*DCONJG( V2 ) V3 = DCONJG( V( 3 ) ) T3 = TAU*DCONJG( V3 ) V4 = DCONJG( V( 4 ) ) T4 = TAU*DCONJG( V4 ) V5 = DCONJG( V( 5 ) ) T5 = TAU*DCONJG( V5 ) V6 = DCONJG( V( 6 ) ) T6 = TAU*DCONJG( V6 ) V7 = DCONJG( V( 7 ) ) T7 = TAU*DCONJG( V7 ) V8 = DCONJG( V( 8 ) ) T8 = TAU*DCONJG( V8 ) V9 = DCONJG( V( 9 ) ) T9 = TAU*DCONJG( V9 ) V10 = DCONJG( V( 10 ) ) T10 = TAU*DCONJG( V10 ) DO 200 J = 1, N SUM = V1*C( 1, J ) + V2*C( 2, J ) + V3*C( 3, J ) + $ V4*C( 4, J ) + V5*C( 5, J ) + V6*C( 6, J ) + $ V7*C( 7, J ) + V8*C( 8, J ) + V9*C( 9, J ) + $ V10*C( 10, J ) C( 1, J ) = C( 1, J ) - SUM*T1 C( 2, J ) = C( 2, J ) - SUM*T2 C( 3, J ) = C( 3, J ) - SUM*T3 C( 4, J ) = C( 4, J ) - SUM*T4 C( 5, J ) = C( 5, J ) - SUM*T5 C( 6, J ) = C( 6, J ) - SUM*T6 C( 7, J ) = C( 7, J ) - SUM*T7 C( 8, J ) = C( 8, J ) - SUM*T8 C( 9, J ) = C( 9, J ) - SUM*T9 C( 10, J ) = C( 10, J ) - SUM*T10 200 CONTINUE GO TO 410 ELSE * * Form C * H, where H has order n. * GO TO ( 210, 230, 250, 270, 290, 310, 330, 350, $ 370, 390 )N * * Code for general N * * w := C * v * CALL ZGEMV( 'No transpose', M, N, ONE, C, LDC, V, 1, ZERO, $ WORK, 1 ) * * C := C - tau * w * v' * CALL ZGERC( M, N, -TAU, WORK, 1, V, 1, C, LDC ) GO TO 410 210 CONTINUE * * Special code for 1 x 1 Householder * T1 = ONE - TAU*V( 1 )*DCONJG( V( 1 ) ) DO 220 J = 1, M C( J, 1 ) = T1*C( J, 1 ) 220 CONTINUE GO TO 410 230 CONTINUE * * Special code for 2 x 2 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) DO 240 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 240 CONTINUE GO TO 410 250 CONTINUE * * Special code for 3 x 3 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) DO 260 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 260 CONTINUE GO TO 410 270 CONTINUE * * Special code for 4 x 4 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) DO 280 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 280 CONTINUE GO TO 410 290 CONTINUE * * Special code for 5 x 5 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) DO 300 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 300 CONTINUE GO TO 410 310 CONTINUE * * Special code for 6 x 6 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) V6 = V( 6 ) T6 = TAU*DCONJG( V6 ) DO 320 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 320 CONTINUE GO TO 410 330 CONTINUE * * Special code for 7 x 7 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) V6 = V( 6 ) T6 = TAU*DCONJG( V6 ) V7 = V( 7 ) T7 = TAU*DCONJG( V7 ) DO 340 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 340 CONTINUE GO TO 410 350 CONTINUE * * Special code for 8 x 8 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) V6 = V( 6 ) T6 = TAU*DCONJG( V6 ) V7 = V( 7 ) T7 = TAU*DCONJG( V7 ) V8 = V( 8 ) T8 = TAU*DCONJG( V8 ) DO 360 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 360 CONTINUE GO TO 410 370 CONTINUE * * Special code for 9 x 9 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) V6 = V( 6 ) T6 = TAU*DCONJG( V6 ) V7 = V( 7 ) T7 = TAU*DCONJG( V7 ) V8 = V( 8 ) T8 = TAU*DCONJG( V8 ) V9 = V( 9 ) T9 = TAU*DCONJG( V9 ) DO 380 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) + V9*C( J, 9 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 C( J, 9 ) = C( J, 9 ) - SUM*T9 380 CONTINUE GO TO 410 390 CONTINUE * * Special code for 10 x 10 Householder * V1 = V( 1 ) T1 = TAU*DCONJG( V1 ) V2 = V( 2 ) T2 = TAU*DCONJG( V2 ) V3 = V( 3 ) T3 = TAU*DCONJG( V3 ) V4 = V( 4 ) T4 = TAU*DCONJG( V4 ) V5 = V( 5 ) T5 = TAU*DCONJG( V5 ) V6 = V( 6 ) T6 = TAU*DCONJG( V6 ) V7 = V( 7 ) T7 = TAU*DCONJG( V7 ) V8 = V( 8 ) T8 = TAU*DCONJG( V8 ) V9 = V( 9 ) T9 = TAU*DCONJG( V9 ) V10 = V( 10 ) T10 = TAU*DCONJG( V10 ) DO 400 J = 1, M SUM = V1*C( J, 1 ) + V2*C( J, 2 ) + V3*C( J, 3 ) + $ V4*C( J, 4 ) + V5*C( J, 5 ) + V6*C( J, 6 ) + $ V7*C( J, 7 ) + V8*C( J, 8 ) + V9*C( J, 9 ) + $ V10*C( J, 10 ) C( J, 1 ) = C( J, 1 ) - SUM*T1 C( J, 2 ) = C( J, 2 ) - SUM*T2 C( J, 3 ) = C( J, 3 ) - SUM*T3 C( J, 4 ) = C( J, 4 ) - SUM*T4 C( J, 5 ) = C( J, 5 ) - SUM*T5 C( J, 6 ) = C( J, 6 ) - SUM*T6 C( J, 7 ) = C( J, 7 ) - SUM*T7 C( J, 8 ) = C( J, 8 ) - SUM*T8 C( J, 9 ) = C( J, 9 ) - SUM*T9 C( J, 10 ) = C( J, 10 ) - SUM*T10 400 CONTINUE GO TO 410 END IF 410 CONTINUE RETURN * * End of ZLARFX * END octave-1.1.0/libcruft/lapack/zlartg.f100666 415 17 6017 5412145406 15663 0ustar jweusers SUBROUTINE ZLARTG( F, G, CS, SN, R ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. DOUBLE PRECISION CS COMPLEX*16 F, G, R, SN * .. * * Purpose * ======= * * ZLARTG generates a plane rotation so that * * [ CS SN ] [ F ] [ R ] * [ __ ] . [ ] = [ ] where CS**2 + |SN|**2 = 1. * [ -SN CS ] [ G ] [ 0 ] * * This is a faster version of the BLAS1 routine ZROTG, except for * the following differences: * F and G are unchanged on return. * If G=0, then CS=1 and SN=0. * If F=0 and (G .ne. 0), then CS=0 and SN=1 without doing any * floating point operations. * * Arguments * ========= * * F (input) COMPLEX*16 * The first component of vector to be rotated. * * G (input) COMPLEX*16 * The second component of vector to be rotated. * * CS (output) DOUBLE PRECISION * The cosine of the rotation. * * SN (output) COMPLEX*16 * The sine of the rotation. * * R (output) COMPLEX*16 * The nonzero component of the rotated vector. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D0, ZERO = 0.0D0 ) COMPLEX*16 CZERO PARAMETER ( CZERO = 0.0D0 ) * .. * .. Local Scalars .. DOUBLE PRECISION D, DI, F1, F2, FA, G1, G2, GA COMPLEX*16 FS, GS, SS, T * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCONJG, DIMAG, SQRT * .. * .. Statement Functions .. DOUBLE PRECISION ABS1, ABSSQ * .. * .. Statement Function definitions .. ABS1( T ) = ABS( DBLE( T ) ) + ABS( DIMAG( T ) ) ABSSQ( T ) = DBLE( T )**2 + DIMAG( T )**2 * .. * .. Executable Statements .. * * [ 25 or 38 ops for main paths ] * IF( G.EQ.CZERO ) THEN CS = ONE SN = ZERO R = F ELSE IF( F.EQ.CZERO ) THEN CS = ZERO * SN = DCONJG( G ) / ABS( G ) R = ABS( G ) * * SN = ONE * R = G * ELSE F1 = ABS1( F ) G1 = ABS1( G ) IF( F1.GE.G1 ) THEN GS = G / F1 G2 = ABSSQ( GS ) FS = F / F1 F2 = ABSSQ( FS ) D = SQRT( ONE+G2 / F2 ) CS = ONE / D SN = DCONJG( GS )*FS*( CS / F2 ) R = F*D ELSE FS = F / G1 F2 = ABSSQ( FS ) FA = SQRT( F2 ) GS = G / G1 G2 = ABSSQ( GS ) GA = SQRT( G2 ) D = SQRT( ONE+F2 / G2 ) DI = ONE / D CS = ( FA / GA )*DI SS = ( DCONJG( GS )*FS ) / ( FA*GA ) SN = SS*DI R = G*SS*D END IF END IF RETURN * * End of ZLARTG * END octave-1.1.0/libcruft/lapack/zlascl.f100666 415 17 16226 5306544276 15705 0ustar jweusers SUBROUTINE ZLASCL( TYPE, KL, KU, CFROM, CTO, M, N, A, LDA, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER TYPE INTEGER INFO, KL, KU, LDA, M, N DOUBLE PRECISION CFROM, CTO * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLASCL multiplies the M by N complex matrix A by the real scalar * CTO/CFROM. This is done without over/underflow as long as the final * result CTO*A(I,J)/CFROM does not over/underflow. TYPE specifies that * A may be full, upper triangular, lower triangular, upper Hessenberg, * or banded. * * Arguments * ========= * * TYPE (input) CHARACTER*1 * TYPE indices the storage type of the input matrix. * = 'G': A is a full matrix. * = 'L': A is a lower triangular matrix. * = 'U': A is an upper triangular matrix. * = 'H': A is an upper Hessenberg matrix. * = 'B': A is a symmetric band matrix with lower bandwidth KL * and upper bandwidth KU and with the only the lower * half stored. * = 'Q': A is a symmetric band matrix with lower bandwidth KL * and upper bandwidth KU and with the only the upper * half stored. * = 'Z': A is a band matrix with lower bandwidth KL and upper * bandwidth KU. * * KL (input) INTEGER * The lower bandwidth of A. Referenced only if TYPE = 'B', * 'Q' or 'Z'. * * KU (input) INTEGER * The upper bandwidth of A. Referenced only if TYPE = 'B', * 'Q' or 'Z'. * * CFROM (input) DOUBLE PRECISION * CTO (input) DOUBLE PRECISION * The matrix A is multiplied by CTO/CFROM. A(I,J) is computed * without over/underflow if the final result CTO*A(I,J)/CFROM * can be represented without over/underflow. CFROM must be * nonzero. * * M (input) INTEGER * The number of rows of the matrix A. M >= 0. * * N (input) INTEGER * The number of columns of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,M) * The matrix to be multiplied by CTO/CFROM. See TYPE for the * storage type. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * INFO (output) INTEGER * 0 - successful exit * <0 - if INFO = -i, the i-th argument had an illegal value. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0 ) * .. * .. Local Scalars .. LOGICAL DONE INTEGER I, ITYPE, J, K1, K2, K3, K4 DOUBLE PRECISION BIGNUM, CFROM1, CFROMC, CTO1, CTOC, MUL, SMLNUM * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLAMCH EXTERNAL LSAME, DLAMCH * .. * .. Intrinsic Functions .. INTRINSIC ABS, MAX, MIN * .. * .. External Subroutines .. EXTERNAL XERBLA * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 * IF( LSAME( TYPE, 'G' ) ) THEN ITYPE = 0 ELSE IF( LSAME( TYPE, 'L' ) ) THEN ITYPE = 1 ELSE IF( LSAME( TYPE, 'U' ) ) THEN ITYPE = 2 ELSE IF( LSAME( TYPE, 'H' ) ) THEN ITYPE = 3 ELSE IF( LSAME( TYPE, 'B' ) ) THEN ITYPE = 4 ELSE IF( LSAME( TYPE, 'Q' ) ) THEN ITYPE = 5 ELSE IF( LSAME( TYPE, 'Z' ) ) THEN ITYPE = 6 ELSE ITYPE = -1 END IF * IF( ITYPE.EQ.-1 ) THEN INFO = -1 ELSE IF( CFROM.EQ.ZERO ) THEN INFO = -4 ELSE IF( M.LT.0 ) THEN INFO = -6 ELSE IF( N.LT.0 .OR. ( ITYPE.EQ.4 .AND. N.NE.M ) .OR. $ ( ITYPE.EQ.5 .AND. N.NE.M ) ) THEN INFO = -7 ELSE IF( ITYPE.LE.3 .AND. LDA.LT.MAX( 1, M ) ) THEN INFO = -9 ELSE IF( ITYPE.GE.4 ) THEN IF( KL.LT.0 .OR. KL.GT.MAX( M-1, 0 ) ) THEN INFO = -2 ELSE IF( KU.LT.0 .OR. KU.GT.MAX( N-1, 0 ) .OR. $ ( ( ITYPE.EQ.4 .OR. ITYPE.EQ.5 ) .AND. KL.NE.KU ) ) $ THEN INFO = -3 ELSE IF( ( ITYPE.EQ.4 .AND. LDA.LT.KL+1 ) .OR. $ ( ITYPE.EQ.5 .AND. LDA.LT.KU+1 ) .OR. $ ( ITYPE.EQ.6 .AND. LDA.LT.2*KL+KU+1 ) ) THEN INFO = -9 END IF END IF * IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZLASCL', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 .OR. M.EQ.0 ) $ RETURN * * Get machine parameters * SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM * CFROMC = CFROM CTOC = CTO * 10 CONTINUE CFROM1 = CFROMC*SMLNUM CTO1 = CTOC / BIGNUM IF( ABS( CFROM1 ).GT.ABS( CTOC ) .AND. CTOC.NE.ZERO ) THEN MUL = SMLNUM DONE = .FALSE. CFROMC = CFROM1 ELSE IF( ABS( CTO1 ).GT.ABS( CFROMC ) ) THEN MUL = BIGNUM DONE = .FALSE. CTOC = CTO1 ELSE MUL = CTOC / CFROMC DONE = .TRUE. END IF * IF( ITYPE.EQ.0 ) THEN * * Full matrix * DO 30 J = 1, N DO 20 I = 1, M A( I, J ) = A( I, J )*MUL 20 CONTINUE 30 CONTINUE * ELSE IF( ITYPE.EQ.1 ) THEN * * Lower triangular matrix * DO 50 J = 1, N DO 40 I = J, M A( I, J ) = A( I, J )*MUL 40 CONTINUE 50 CONTINUE * ELSE IF( ITYPE.EQ.2 ) THEN * * Upper triangular matrix * DO 70 J = 1, N DO 60 I = 1, MIN( J, M ) A( I, J ) = A( I, J )*MUL 60 CONTINUE 70 CONTINUE * ELSE IF( ITYPE.EQ.3 ) THEN * * Upper Hessenberg matrix * DO 90 J = 1, N DO 80 I = 1, MIN( J+1, M ) A( I, J ) = A( I, J )*MUL 80 CONTINUE 90 CONTINUE * ELSE IF( ITYPE.EQ.4 ) THEN * * Lower half of a symmetric band matrix * K3 = KL + 1 K4 = N + 1 DO 110 J = 1, N DO 100 I = 1, MIN( K3, K4-J ) A( I, J ) = A( I, J )*MUL 100 CONTINUE 110 CONTINUE * ELSE IF( ITYPE.EQ.5 ) THEN * * Upper half of a symmetric band matrix * K1 = KU + 2 K3 = KU + 1 DO 130 J = 1, N DO 120 I = MAX( K1-J, 1 ), K3 A( I, J ) = A( I, J )*MUL 120 CONTINUE 130 CONTINUE * ELSE IF( ITYPE.EQ.6 ) THEN * * Band matrix * K1 = KL + KU + 2 K2 = KL + 1 K3 = 2*KL + KU + 1 K4 = KL + KU + 1 + M DO 150 J = 1, N DO 140 I = MAX( K1-J, K2 ), MIN( K3, K4-J ) A( I, J ) = A( I, J )*MUL 140 CONTINUE 150 CONTINUE * END IF * IF( .NOT.DONE ) $ GO TO 10 * RETURN * * End of ZLASCL * END octave-1.1.0/libcruft/lapack/zlaset.f100666 415 17 6073 5306544274 15674 0ustar jweusers SUBROUTINE ZLASET( UPLO, M, N, ALPHA, BETA, A, LDA ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER LDA, M, N COMPLEX*16 ALPHA, BETA * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLASET initializes a 2-D array A to BETA on the diagonal and * ALPHA on the offdiagonals. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies the part of the matrix A to be set. * = 'U': Upper triangular part is set. The lower triangle * is unchanged. * = 'L': Lower triangular part is set. The upper triangle * is unchanged. * Otherwise: All of the matrix A is set. * * M (input) INTEGER * On entry, M specifies the number of rows of A. * * N (input) INTEGER * On entry, N specifies the number of columns of A. * * ALPHA (input) COMPLEX*16 * All the offdiagonal array elements are set to ALPHA. * * BETA (input) COMPLEX*16 * All the diagonal array elements are set to BETA. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the m by n matrix A. * On exit, A(i,j) = ALPHA, 1 <= i <= m, 1 <= j <= n, i.ne.j; * A(i,i) = BETA , 1 <= i <= min(m,n) * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * ===================================================================== * * .. Local Scalars .. INTEGER I, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. Intrinsic Functions .. INTRINSIC MIN * .. * .. Executable Statements .. * IF( LSAME( UPLO, 'U' ) ) THEN * * Set the diagonal to BETA and the strictly upper triangular * part of the array to ALPHA. * DO 20 J = 2, N DO 10 I = 1, MIN( J-1, M ) A( I, J ) = ALPHA 10 CONTINUE 20 CONTINUE DO 30 I = 1, MIN( N, M ) A( I, I ) = BETA 30 CONTINUE * ELSE IF( LSAME( UPLO, 'L' ) ) THEN * * Set the diagonal to BETA and the strictly lower triangular * part of the array to ALPHA. * DO 50 J = 1, MIN( M, N ) DO 40 I = J + 1, M A( I, J ) = ALPHA 40 CONTINUE 50 CONTINUE DO 60 I = 1, MIN( N, M ) A( I, I ) = BETA 60 CONTINUE * ELSE * * Set the array to BETA on the diagonal and ALPHA on the * offdiagonal. * DO 80 J = 1, N DO 70 I = 1, M A( I, J ) = ALPHA 70 CONTINUE 80 CONTINUE DO 90 I = 1, MIN( M, N ) A( I, I ) = BETA 90 CONTINUE END IF * RETURN * * End of ZLASET * END octave-1.1.0/libcruft/lapack/zlasr.f100666 415 17 26340 5306544301 15533 0ustar jweusers SUBROUTINE ZLASR( SIDE, PIVOT, DIRECT, M, N, C, S, A, LDA ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. CHARACTER DIRECT, PIVOT, SIDE INTEGER LDA, M, N * .. * .. Array Arguments .. DOUBLE PRECISION C( * ), S( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLASR performs the transformation * * A := P*A, when SIDE = 'L' or 'l' ( Left-hand side ) * * A := A*P', when SIDE = 'R' or 'r' ( Right-hand side ) * * where A is an m by n complex matrix and P is an orthogonal matrix, * consisting of a sequence of plane rotations determined by the * parameters PIVOT and DIRECT as follows ( z = m when SIDE = 'L' or 'l' * and z = n when SIDE = 'R' or 'r' ): * * When DIRECT = 'F' or 'f' ( Forward sequence ) then * * P = P( z - 1 )*...*P( 2 )*P( 1 ), * * and when DIRECT = 'B' or 'b' ( Backward sequence ) then * * P = P( 1 )*P( 2 )*...*P( z - 1 ), * * where P( k ) is a plane rotation matrix for the following planes: * * when PIVOT = 'V' or 'v' ( Variable pivot ), * the plane ( k, k + 1 ) * * when PIVOT = 'T' or 't' ( Top pivot ), * the plane ( 1, k + 1 ) * * when PIVOT = 'B' or 'b' ( Bottom pivot ), * the plane ( k, z ) * * c( k ) and s( k ) must contain the cosine and sine that define the * matrix P( k ). The two by two plane rotation part of the matrix * P( k ), R( k ), is assumed to be of the form * * R( k ) = ( c( k ) s( k ) ). * ( -s( k ) c( k ) ) * * Arguments * ========= * * SIDE (input) CHARACTER*1 * Specifies whether the plane rotation matrix P is applied to * A on the left or the right. * = 'L': Left, compute A := P*A * = 'R': Right, compute A:= A*P' * * DIRECT (input) CHARACTER*1 * Specifies whether P is a forward or backward sequence of * plane rotations. * = 'F': Forward, P = P( z - 1 )*...*P( 2 )*P( 1 ) * = 'B': Backward, P = P( 1 )*P( 2 )*...*P( z - 1 ) * * PIVOT (input) CHARACTER*1 * Specifies the plane for which P(k) is a plane rotation * matrix. * = 'V': Variable pivot, the plane (k,k+1) * = 'T': Top pivot, the plane (1,k+1) * = 'B': Bottom pivot, the plane (k,z) * * M (input) INTEGER * The number of rows of the matrix A. If m <= 1, an immediate * return is effected. * * N (input) INTEGER * The number of columns of the matrix A. If n <= 1, an * immediate return is effected. * * C, S (input) DOUBLE PRECISION arrays, dimension * (M-1) if SIDE = 'L' * (N-1) if SIDE = 'R' * c(k) and s(k) contain the cosine and sine that define the * matrix P(k). The two by two plane rotation part of the * matrix P(k), R(k), is assumed to be of the form * R( k ) = ( c( k ) s( k ) ). * ( -s( k ) c( k ) ) * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * The m by n matrix A. On exit, A is overwritten by P*A if * SIDE = 'R' or by A*P' if SIDE = 'L'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, INFO, J DOUBLE PRECISION CTEMP, STEMP COMPLEX*16 TEMP * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA * .. * .. Executable Statements .. * * Test the input parameters * INFO = 0 IF( .NOT.( LSAME( SIDE, 'L' ) .OR. LSAME( SIDE, 'R' ) ) ) THEN INFO = 1 ELSE IF( .NOT.( LSAME( PIVOT, 'V' ) .OR. LSAME( PIVOT, $ 'T' ) .OR. LSAME( PIVOT, 'B' ) ) ) THEN INFO = 2 ELSE IF( .NOT.( LSAME( DIRECT, 'F' ) .OR. LSAME( DIRECT, 'B' ) ) ) $ THEN INFO = 3 ELSE IF( M.LT.0 ) THEN INFO = 4 ELSE IF( N.LT.0 ) THEN INFO = 5 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = 9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZLASR ', INFO ) RETURN END IF * * Quick return if possible * IF( ( M.EQ.0 ) .OR. ( N.EQ.0 ) ) $ RETURN IF( LSAME( SIDE, 'L' ) ) THEN * * Form P * A * IF( LSAME( PIVOT, 'V' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 20 J = 1, M - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 10 I = 1, N TEMP = A( J+1, I ) A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) 10 CONTINUE END IF 20 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 40 J = M - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 30 I = 1, N TEMP = A( J+1, I ) A( J+1, I ) = CTEMP*TEMP - STEMP*A( J, I ) A( J, I ) = STEMP*TEMP + CTEMP*A( J, I ) 30 CONTINUE END IF 40 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'T' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 60 J = 2, M CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 50 I = 1, N TEMP = A( J, I ) A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) 50 CONTINUE END IF 60 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 80 J = M, 2, -1 CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 70 I = 1, N TEMP = A( J, I ) A( J, I ) = CTEMP*TEMP - STEMP*A( 1, I ) A( 1, I ) = STEMP*TEMP + CTEMP*A( 1, I ) 70 CONTINUE END IF 80 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'B' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 100 J = 1, M - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 90 I = 1, N TEMP = A( J, I ) A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP 90 CONTINUE END IF 100 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 120 J = M - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 110 I = 1, N TEMP = A( J, I ) A( J, I ) = STEMP*A( M, I ) + CTEMP*TEMP A( M, I ) = CTEMP*A( M, I ) - STEMP*TEMP 110 CONTINUE END IF 120 CONTINUE END IF END IF ELSE IF( LSAME( SIDE, 'R' ) ) THEN * * Form A * P' * IF( LSAME( PIVOT, 'V' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 140 J = 1, N - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 130 I = 1, M TEMP = A( I, J+1 ) A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) 130 CONTINUE END IF 140 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 160 J = N - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 150 I = 1, M TEMP = A( I, J+1 ) A( I, J+1 ) = CTEMP*TEMP - STEMP*A( I, J ) A( I, J ) = STEMP*TEMP + CTEMP*A( I, J ) 150 CONTINUE END IF 160 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'T' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 180 J = 2, N CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 170 I = 1, M TEMP = A( I, J ) A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) 170 CONTINUE END IF 180 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 200 J = N, 2, -1 CTEMP = C( J-1 ) STEMP = S( J-1 ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 190 I = 1, M TEMP = A( I, J ) A( I, J ) = CTEMP*TEMP - STEMP*A( I, 1 ) A( I, 1 ) = STEMP*TEMP + CTEMP*A( I, 1 ) 190 CONTINUE END IF 200 CONTINUE END IF ELSE IF( LSAME( PIVOT, 'B' ) ) THEN IF( LSAME( DIRECT, 'F' ) ) THEN DO 220 J = 1, N - 1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 210 I = 1, M TEMP = A( I, J ) A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP 210 CONTINUE END IF 220 CONTINUE ELSE IF( LSAME( DIRECT, 'B' ) ) THEN DO 240 J = N - 1, 1, -1 CTEMP = C( J ) STEMP = S( J ) IF( ( CTEMP.NE.ONE ) .OR. ( STEMP.NE.ZERO ) ) THEN DO 230 I = 1, M TEMP = A( I, J ) A( I, J ) = STEMP*A( I, N ) + CTEMP*TEMP A( I, N ) = CTEMP*A( I, N ) - STEMP*TEMP 230 CONTINUE END IF 240 CONTINUE END IF END IF END IF * RETURN * * End of ZLASR * END octave-1.1.0/libcruft/lapack/zlassq.f100666 415 17 6003 5306544277 15703 0ustar jweusers SUBROUTINE ZLASSQ( N, X, INCX, SCALE, SUMSQ ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, N DOUBLE PRECISION SCALE, SUMSQ * .. * .. Array Arguments .. COMPLEX*16 X( * ) * .. * * Purpose * ======= * * ZLASSQ returns the values scl and ssq such that * * ( scl**2 )*ssq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq, * * where x( i ) = abs( X( 1 + ( i - 1 )*INCX ) ). The value of sumsq is * assumed to be at least unity and the value of ssq will then satisfy * * 1.0 .le. ssq .le. ( sumsq + 2*n ). * * scale is assumed to be non-negative and scl returns the value * * scl = max( scale, abs( real( x( i ) ) ), abs( aimag( x( i ) ) ) ), * i * * scale and sumsq must be supplied in SCALE and SUMSQ respectively. * SCALE and SUMSQ are overwritten by scl and ssq respectively. * * The routine makes only one pass through the vector X. * * Arguments * ========= * * N (input) INTEGER * The number of elements to be used from the vector X. * * X (input) DOUBLE PRECISION * The vector x as described above. * x( i ) = X( 1 + ( i - 1 )*INCX ), 1 <= i <= n. * * INCX (input) INTEGER * The increment between successive values of the vector X. * INCX > 0. * * SCALE (input/output) DOUBLE PRECISION * On entry, the value scale in the equation above. * On exit, SCALE is overwritten with the value scl . * * SUMSQ (input/output) DOUBLE PRECISION * On entry, the value sumsq in the equation above. * On exit, SUMSQ is overwritten with the value ssq . * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER IX DOUBLE PRECISION TEMP1 * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DIMAG * .. * .. Executable Statements .. * IF( N.GT.0 ) THEN DO 10 IX = 1, 1 + ( N-1 )*INCX, INCX IF( DBLE( X( IX ) ).NE.ZERO ) THEN TEMP1 = ABS( DBLE( X( IX ) ) ) IF( SCALE.LT.TEMP1 ) THEN SUMSQ = 1 + SUMSQ*( SCALE / TEMP1 )**2 SCALE = TEMP1 ELSE SUMSQ = SUMSQ + ( TEMP1 / SCALE )**2 END IF END IF IF( DIMAG( X( IX ) ).NE.ZERO ) THEN TEMP1 = ABS( DIMAG( X( IX ) ) ) IF( SCALE.LT.TEMP1 ) THEN SUMSQ = 1 + SUMSQ*( SCALE / TEMP1 )**2 SCALE = TEMP1 ELSE SUMSQ = SUMSQ + ( TEMP1 / SCALE )**2 END IF END IF 10 CONTINUE END IF * RETURN * * End of ZLASSQ * END octave-1.1.0/libcruft/lapack/zlaswp.f100666 415 17 5424 5310240645 15677 0ustar jweusers SUBROUTINE ZLASWP( N, A, LDA, K1, K2, IPIV, INCX ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, K1, K2, LDA, N * .. * .. Array Arguments .. INTEGER IPIV( * ) COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZLASWP performs a series of row interchanges on the matrix A. * One row interchange is initiated for each of rows K1 through K2 of A. * * Arguments * ========= * * N (input) INTEGER * The number of columns of the matrix A. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the matrix of column dimension N to which the row * interchanges will be applied. * On exit, the permuted matrix. * * LDA (input) INTEGER * The leading dimension of the array A. * * K1 (input) INTEGER * The first element of IPIV for which a row interchange will * be done. * * K2 (input) INTEGER * The last element of IPIV for which a row interchange will * be done. * * IPIV (input) INTEGER array, dimension (M*abs(INCX)) * The vector of pivot indices. Only the elements in positions * K1 through K2 of IPIV are accessed. * IPIV(K) = L implies rows K and L are to be interchanged. * * INCX (input) INTEGER * The increment between successive values of IPIV. If IPIV * is negative, the pivots are applied in reverse order. * * ===================================================================== * * .. Local Scalars .. INTEGER I, IP, IX * .. * .. External Subroutines .. EXTERNAL ZSWAP * .. * .. Executable Statements .. * * Interchange row I with row IPIV(I) for each of rows K1 through K2. * IF( INCX.EQ.0 ) $ RETURN IF( INCX.GT.0 ) THEN IX = K1 ELSE IX = 1 + ( 1-K2 )*INCX END IF IF( INCX.EQ.1 ) THEN DO 10 I = K1, K2 IP = IPIV( I ) IF( IP.NE.I ) $ CALL ZSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) 10 CONTINUE ELSE IF( INCX.GT.1 ) THEN DO 20 I = K1, K2 IP = IPIV( IX ) IF( IP.NE.I ) $ CALL ZSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) IX = IX + INCX 20 CONTINUE ELSE IF( INCX.LT.0 ) THEN DO 30 I = K2, K1, -1 IP = IPIV( IX ) IF( IP.NE.I ) $ CALL ZSWAP( N, A( I, 1 ), LDA, A( IP, 1 ), LDA ) IX = IX + INCX 30 CONTINUE END IF * RETURN * * End of ZLASWP * END octave-1.1.0/libcruft/lapack/zlatrs.f100666 415 17 66330 5306544273 15732 0ustar jweusers SUBROUTINE ZLATRS( UPLO, TRANS, DIAG, NORMIN, N, A, LDA, X, SCALE, $ CNORM, INFO ) * * -- LAPACK auxiliary routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER DIAG, NORMIN, TRANS, UPLO INTEGER INFO, LDA, N DOUBLE PRECISION SCALE * .. * .. Array Arguments .. DOUBLE PRECISION CNORM( * ) COMPLEX*16 A( LDA, * ), X( * ) * .. * * Purpose * ======= * * ZLATRS solves one of the triangular systems * * A * x = s*b, A**T * x = s*b, or A**H * x = s*b, * * with scaling to prevent overflow. Here A is an upper or lower * triangular matrix, A**T denotes the transpose of A, A**H denotes the * conjugate transpose of A, x and b are n-element vectors, and s is a * scaling factor, usually less than or equal to 1, chosen so that the * components of x will be less than the overflow threshold. If the * unscaled problem will not cause overflow, the Level 2 BLAS routine * ZTRSV is called. If the matrix A is singular (A(j,j) = 0 for some j), * then s is set to 0 and a non-trivial solution to A*x = 0 is returned. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies whether the matrix A is upper or lower triangular. * = 'U': Upper triangular * = 'L': Lower triangular * * TRANS (input) CHARACTER*1 * Specifies the operation applied to A. * = 'N': Solve A * x = s*b (No transpose) * = 'T': Solve A**T * x = s*b (Transpose) * = 'C': Solve A**H * x = s*b (Conjugate transpose) * * DIAG (input) CHARACTER*1 * Specifies whether or not the matrix A is unit triangular. * = 'N': Non-unit triangular * = 'U': Unit triangular * * NORMIN (input) CHARACTER*1 * Specifies whether CNORM has been set or not. * = 'Y': CNORM contains the column norms on entry * = 'N': CNORM is not set on entry. On exit, the norms will * be computed and stored in CNORM. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,N) * The triangular matrix A. If UPLO = 'U', the leading n by n * upper triangular part of the array A contains the upper * triangular matrix, and the strictly lower triangular part of * A is not referenced. If UPLO = 'L', the leading n by n lower * triangular part of the array A contains the lower triangular * matrix, and the strictly upper triangular part of A is not * referenced. If DIAG = 'U', the diagonal elements of A are * also not referenced and are assumed to be 1. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max (1,N). * * X (input/output) COMPLEX*16 array, dimension (N) * On entry, the right hand side b of the triangular system. * On exit, X is overwritten by the solution vector x. * * SCALE (output) DOUBLE PRECISION * The scaling factor s for the triangular system * A * x = s*b, A**T * x = s*b, or A**H * x = s*b. * If SCALE = 0, the matrix A is singular or badly scaled, and * the vector x is an exact or approximate solution to A*x = 0. * * CNORM (input or output) DOUBLE PRECISION array, dimension (N) * * If NORMIN = 'Y', CNORM is an input variable and CNORM(j) * contains the norm of the off-diagonal part of the j-th column * of A. If TRANS = 'N', CNORM(j) must be greater than or equal * to the infinity-norm, and if TRANS = 'T' or 'C', CNORM(j) * must be greater than or equal to the 1-norm. * * If NORMIN = 'N', CNORM is an output variable and CNORM(j) * returns the 1-norm of the offdiagonal part of the j-th column * of A. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * * Further Details * ======= ======= * * A rough bound on x is computed; if that is less than overflow, ZTRSV * is called, otherwise, specific code is used which checks for possible * overflow or divide-by-zero at every operation. * * A columnwise scheme is used for solving A*x = b. The basic algorithm * if A is lower triangular is * * x[1:n] := b[1:n] * for j = 1, ..., n * x(j) := x(j) / A(j,j) * x[j+1:n] := x[j+1:n] - x(j) * A[j+1:n,j] * end * * Define bounds on the components of x after j iterations of the loop: * M(j) = bound on x[1:j] * G(j) = bound on x[j+1:n] * Initially, let M(0) = 0 and G(0) = max{x(i), i=1,...,n}. * * Then for iteration j+1 we have * M(j+1) <= G(j) / | A(j+1,j+1) | * G(j+1) <= G(j) + M(j+1) * | A[j+2:n,j+1] | * <= G(j) ( 1 + CNORM(j+1) / | A(j+1,j+1) | ) * * where CNORM(j+1) is greater than or equal to the infinity-norm of * column j+1 of A, not counting the diagonal. Hence * * G(j) <= G(0) product ( 1 + CNORM(i) / | A(i,i) | ) * 1<=i<=j * and * * |x(j)| <= ( G(0) / |A(j,j)| ) product ( 1 + CNORM(i) / |A(i,i)| ) * 1<=i< j * * Since |x(j)| <= M(j), we use the Level 2 BLAS routine ZTRSV if the * reciprocal of the largest M(j), j=1,..,n, is larger than * max(underflow, 1/overflow). * * The bound on x(j) is also used to determine when a step in the * columnwise method can be performed without fear of overflow. If * the computed bound is greater than a large constant, x is scaled to * prevent overflow, but if the bound overflows, x is set to 0, x(j) to * 1, and scale to 0, and a non-trivial solution to A*x = 0 is found. * * Similarly, a row-wise scheme is used to solve A**T *x = b or * A**H *x = b. The basic algorithm for A upper triangular is * * for j = 1, ..., n * x(j) := ( b(j) - A[1:j-1,j]' * x[1:j-1] ) / A(j,j) * end * * We simultaneously compute two bounds * G(j) = bound on ( b(i) - A[1:i-1,i]' * x[1:i-1] ), 1<=i<=j * M(j) = bound on x(i), 1<=i<=j * * The initial values are G(0) = 0, M(0) = max{b(i), i=1,..,n}, and we * add the constraint G(j) >= G(j-1) and M(j) >= M(j-1) for j >= 1. * Then the bound on x(j) is * * M(j) <= M(j-1) * ( 1 + CNORM(j) ) / | A(j,j) | * * <= M(0) * product ( ( 1 + CNORM(i) ) / |A(i,i)| ) * 1<=i<=j * * and we can safely call ZTRSV if 1/M(n) and 1/G(n) are both greater * than max(underflow, 1/overflow). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, HALF, ONE, TWO PARAMETER ( ZERO = 0.0D+0, HALF = 0.5D+0, ONE = 1.0D+0, $ TWO = 2.0D+0 ) * .. * .. Local Scalars .. LOGICAL NOTRAN, NOUNIT, UPPER INTEGER I, IMAX, J, JFIRST, JINC, JLAST DOUBLE PRECISION BIGNUM, GROW, REC, SMLNUM, TJJ, TMAX, TSCAL, $ XBND, XJ, XMAX COMPLEX*16 CSUMJ, TJJS, USCAL, ZDUM * .. * .. External Functions .. LOGICAL LSAME INTEGER IDAMAX, IZAMAX DOUBLE PRECISION DLAMCH, DZASUM COMPLEX*16 ZDOTC, ZDOTU, ZLADIV EXTERNAL LSAME, IDAMAX, IZAMAX, DLAMCH, DZASUM, ZDOTC, $ ZDOTU, ZLADIV * .. * .. External Subroutines .. EXTERNAL DLABAD, DSCAL, XERBLA, ZAXPY, ZDSCAL, ZTRSV * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN * .. * .. Statement Functions .. DOUBLE PRECISION CABS1, CABS2 * .. * .. Statement Function definitions .. CABS1( ZDUM ) = ABS( DBLE( ZDUM ) ) + ABS( DIMAG( ZDUM ) ) CABS2( ZDUM ) = ABS( DBLE( ZDUM ) / 2.D0 ) + $ ABS( DIMAG( ZDUM ) / 2.D0 ) * .. * .. Executable Statements .. * INFO = 0 UPPER = LSAME( UPLO, 'U' ) NOTRAN = LSAME( TRANS, 'N' ) NOUNIT = LSAME( DIAG, 'N' ) * * Test the input parameters. * IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'T' ) .AND. .NOT. $ LSAME( TRANS, 'C' ) ) THEN INFO = -2 ELSE IF( .NOT.NOUNIT .AND. .NOT.LSAME( DIAG, 'U' ) ) THEN INFO = -3 ELSE IF( .NOT.LSAME( NORMIN, 'Y' ) .AND. .NOT. $ LSAME( NORMIN, 'N' ) ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -7 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZLATRS', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * * Determine machine dependent parameters to control overflow. * SMLNUM = DLAMCH( 'Safe minimum' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SMLNUM / DLAMCH( 'Precision' ) BIGNUM = ONE / SMLNUM SCALE = ONE * IF( LSAME( NORMIN, 'N' ) ) THEN * * Compute the 1-norm of each column, not including the diagonal. * IF( UPPER ) THEN * * A is upper triangular. * DO 10 J = 1, N CNORM( J ) = DZASUM( J-1, A( 1, J ), 1 ) 10 CONTINUE ELSE * * A is lower triangular. * DO 20 J = 1, N - 1 CNORM( J ) = DZASUM( N-J, A( J+1, J ), 1 ) 20 CONTINUE CNORM( N ) = ZERO END IF END IF * * Scale the column norms by TSCAL if the maximum entry in CNORM is * greater than BIGNUM/2. * IMAX = IDAMAX( N, CNORM, 1 ) TMAX = CNORM( IMAX ) IF( TMAX.LE.BIGNUM*HALF ) THEN TSCAL = ONE ELSE TSCAL = HALF / ( SMLNUM*TMAX ) CALL DSCAL( N, TSCAL, CNORM, 1 ) END IF * * Compute a bound on the computed solution vector to see if the * Level 2 BLAS routine ZTRSV can be used. * XMAX = ZERO DO 30 J = 1, N XMAX = MAX( XMAX, CABS2( X( J ) ) ) 30 CONTINUE XBND = XMAX * IF( NOTRAN ) THEN * * Compute the growth in A * x = b. * IF( UPPER ) THEN JFIRST = N JLAST = 1 JINC = -1 ELSE JFIRST = 1 JLAST = N JINC = 1 END IF * IF( TSCAL.NE.ONE ) THEN GROW = ZERO GO TO 60 END IF * IF( NOUNIT ) THEN * * A is non-unit triangular. * * Compute GROW = 1/G(j) and XBND = 1/M(j). * Initially, G(0) = max{x(i), i=1,...,n}. * GROW = HALF / MAX( XBND, SMLNUM ) XBND = GROW DO 40 J = JFIRST, JLAST, JINC * * Exit the loop if the growth factor is too small. * IF( GROW.LE.SMLNUM ) $ GO TO 60 * TJJS = A( J, J ) TJJ = CABS1( TJJS ) * IF( TJJ.GE.SMLNUM ) THEN * * M(j) = G(j-1) / abs(A(j,j)) * XBND = MIN( XBND, MIN( ONE, TJJ )*GROW ) ELSE * * M(j) could overflow, set XBND to 0. * XBND = ZERO END IF * IF( TJJ+CNORM( J ).GE.SMLNUM ) THEN * * G(j) = G(j-1)*( 1 + CNORM(j) / abs(A(j,j)) ) * GROW = GROW*( TJJ / ( TJJ+CNORM( J ) ) ) ELSE * * G(j) could overflow, set GROW to 0. * GROW = ZERO END IF 40 CONTINUE GROW = XBND ELSE * * A is unit triangular. * * Compute GROW = 1/G(j), where G(0) = max{x(i), i=1,...,n}. * GROW = MIN( ONE, HALF / MAX( XBND, SMLNUM ) ) DO 50 J = JFIRST, JLAST, JINC * * Exit the loop if the growth factor is too small. * IF( GROW.LE.SMLNUM ) $ GO TO 60 * * G(j) = G(j-1)*( 1 + CNORM(j) ) * GROW = GROW*( ONE / ( ONE+CNORM( J ) ) ) 50 CONTINUE END IF 60 CONTINUE * ELSE * * Compute the growth in A**T * x = b or A**H * x = b. * IF( UPPER ) THEN JFIRST = 1 JLAST = N JINC = 1 ELSE JFIRST = N JLAST = 1 JINC = -1 END IF * IF( TSCAL.NE.ONE ) THEN GROW = ZERO GO TO 90 END IF * IF( NOUNIT ) THEN * * A is non-unit triangular. * * Compute GROW = 1/G(j) and XBND = 1/M(j). * Initially, M(0) = max{x(i), i=1,...,n}. * GROW = HALF / MAX( XBND, SMLNUM ) XBND = GROW DO 70 J = JFIRST, JLAST, JINC * * Exit the loop if the growth factor is too small. * IF( GROW.LE.SMLNUM ) $ GO TO 90 * * G(j) = max( G(j-1), M(j-1)*( 1 + CNORM(j) ) ) * XJ = ONE + CNORM( J ) GROW = MIN( GROW, XBND / XJ ) * TJJS = A( J, J ) TJJ = CABS1( TJJS ) * IF( TJJ.GE.SMLNUM ) THEN * * M(j) = M(j-1)*( 1 + CNORM(j) ) / abs(A(j,j)) * IF( XJ.GT.TJJ ) $ XBND = XBND*( TJJ / XJ ) ELSE * * M(j) could overflow, set XBND to 0. * XBND = ZERO END IF 70 CONTINUE GROW = MIN( GROW, XBND ) ELSE * * A is unit triangular. * * Compute GROW = 1/G(j), where G(0) = max{x(i), i=1,...,n}. * GROW = MIN( ONE, HALF / MAX( XBND, SMLNUM ) ) DO 80 J = JFIRST, JLAST, JINC * * Exit the loop if the growth factor is too small. * IF( GROW.LE.SMLNUM ) $ GO TO 90 * * G(j) = ( 1 + CNORM(j) )*G(j-1) * XJ = ONE + CNORM( J ) GROW = GROW / XJ 80 CONTINUE END IF 90 CONTINUE END IF * IF( ( GROW*TSCAL ).GT.SMLNUM ) THEN * * Use the Level 2 BLAS solve if the reciprocal of the bound on * elements of X is not too small. * CALL ZTRSV( UPLO, TRANS, DIAG, N, A, LDA, X, 1 ) ELSE * * Use a Level 1 BLAS solve, scaling intermediate results. * IF( XMAX.GT.BIGNUM*HALF ) THEN * * Scale X so that its components are less than or equal to * BIGNUM in absolute value. * SCALE = ( BIGNUM*HALF ) / XMAX CALL ZDSCAL( N, SCALE, X, 1 ) XMAX = BIGNUM ELSE XMAX = XMAX*TWO END IF * IF( NOTRAN ) THEN * * Solve A * x = b * DO 120 J = JFIRST, JLAST, JINC * * Compute x(j) = b(j) / A(j,j), scaling x if necessary. * XJ = CABS1( X( J ) ) IF( NOUNIT ) THEN TJJS = A( J, J )*TSCAL ELSE TJJS = TSCAL IF( TSCAL.EQ.ONE ) $ GO TO 110 END IF TJJ = CABS1( TJJS ) IF( TJJ.GT.SMLNUM ) THEN * * abs(A(j,j)) > SMLNUM: * IF( TJJ.LT.ONE ) THEN IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale x by 1/b(j). * REC = ONE / XJ CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF END IF X( J ) = ZLADIV( X( J ), TJJS ) XJ = CABS1( X( J ) ) ELSE IF( TJJ.GT.ZERO ) THEN * * 0 < abs(A(j,j)) <= SMLNUM: * IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale x by (1/abs(x(j)))*abs(A(j,j))*BIGNUM * to avoid overflow when dividing by A(j,j). * REC = ( TJJ*BIGNUM ) / XJ IF( CNORM( J ).GT.ONE ) THEN * * Scale by 1/CNORM(j) to avoid overflow when * multiplying x(j) times column j. * REC = REC / CNORM( J ) END IF CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF X( J ) = ZLADIV( X( J ), TJJS ) XJ = CABS1( X( J ) ) ELSE * * A(j,j) = 0: Set x(1:n) = 0, x(j) = 1, and * scale = 0, and compute a solution to A*x = 0. * DO 100 I = 1, N X( I ) = ZERO 100 CONTINUE X( J ) = ONE XJ = ONE SCALE = ZERO XMAX = ZERO END IF 110 CONTINUE * * Scale x if necessary to avoid overflow when adding a * multiple of column j of A. * IF( XJ.GT.ONE ) THEN REC = ONE / XJ IF( CNORM( J ).GT.( BIGNUM-XMAX )*REC ) THEN * * Scale x by 1/(2*abs(x(j))). * REC = REC*HALF CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC END IF ELSE IF( XJ*CNORM( J ).GT.( BIGNUM-XMAX ) ) THEN * * Scale x by 1/2. * CALL ZDSCAL( N, HALF, X, 1 ) SCALE = SCALE*HALF END IF * IF( UPPER ) THEN IF( J.GT.1 ) THEN * * Compute the update * x(1:j-1) := x(1:j-1) - x(j) * A(1:j-1,j) * CALL ZAXPY( J-1, -X( J )*TSCAL, A( 1, J ), 1, X, $ 1 ) I = IZAMAX( J-1, X, 1 ) XMAX = CABS1( X( I ) ) END IF ELSE IF( J.LT.N ) THEN * * Compute the update * x(j+1:n) := x(j+1:n) - x(j) * A(j+1:n,j) * CALL ZAXPY( N-J, -X( J )*TSCAL, A( J+1, J ), 1, $ X( J+1 ), 1 ) I = J + IZAMAX( N-J, X( J+1 ), 1 ) XMAX = CABS1( X( I ) ) END IF END IF 120 CONTINUE * ELSE IF( LSAME( TRANS, 'T' ) ) THEN * * Solve A**T * x = b * DO 170 J = JFIRST, JLAST, JINC * * Compute x(j) = b(j) - sum A(k,j)*x(k). * k<>j * XJ = CABS1( X( J ) ) USCAL = TSCAL REC = ONE / MAX( XMAX, ONE ) IF( CNORM( J ).GT.( BIGNUM-XJ )*REC ) THEN * * If x(j) could overflow, scale x by 1/(2*XMAX). * REC = REC*HALF IF( NOUNIT ) THEN TJJS = A( J, J )*TSCAL ELSE TJJS = TSCAL END IF TJJ = CABS1( TJJS ) IF( TJJ.GT.ONE ) THEN * * Divide by A(j,j) when scaling x if A(j,j) > 1. * REC = MIN( ONE, REC*TJJ ) USCAL = ZLADIV( USCAL, TJJS ) END IF IF( REC.LT.ONE ) THEN CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF END IF * CSUMJ = ZERO IF( USCAL.EQ.DCMPLX( ONE ) ) THEN * * If the scaling needed for A in the dot product is 1, * call ZDOTU to perform the dot product. * IF( UPPER ) THEN CSUMJ = ZDOTU( J-1, A( 1, J ), 1, X, 1 ) ELSE IF( J.LT.N ) THEN CSUMJ = ZDOTU( N-J, A( J+1, J ), 1, X( J+1 ), 1 ) END IF ELSE * * Otherwise, use in-line code for the dot product. * IF( UPPER ) THEN DO 130 I = 1, J - 1 CSUMJ = CSUMJ + ( A( I, J )*USCAL )*X( I ) 130 CONTINUE ELSE IF( J.LT.N ) THEN DO 140 I = J + 1, N CSUMJ = CSUMJ + ( A( I, J )*USCAL )*X( I ) 140 CONTINUE END IF END IF * IF( USCAL.EQ.DCMPLX( TSCAL ) ) THEN * * Compute x(j) := ( x(j) - CSUMJ ) / A(j,j) if 1/A(j,j) * was not used to scale the dotproduct. * X( J ) = X( J ) - CSUMJ XJ = CABS1( X( J ) ) IF( NOUNIT ) THEN TJJS = A( J, J )*TSCAL ELSE TJJS = TSCAL IF( TSCAL.EQ.ONE ) $ GO TO 160 END IF * * Compute x(j) = x(j) / A(j,j), scaling if necessary. * TJJ = CABS1( TJJS ) IF( TJJ.GT.SMLNUM ) THEN * * abs(A(j,j)) > SMLNUM: * IF( TJJ.LT.ONE ) THEN IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale X by 1/abs(x(j)). * REC = ONE / XJ CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF END IF X( J ) = ZLADIV( X( J ), TJJS ) ELSE IF( TJJ.GT.ZERO ) THEN * * 0 < abs(A(j,j)) <= SMLNUM: * IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale x by (1/abs(x(j)))*abs(A(j,j))*BIGNUM. * REC = ( TJJ*BIGNUM ) / XJ CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF X( J ) = ZLADIV( X( J ), TJJS ) ELSE * * A(j,j) = 0: Set x(1:n) = 0, x(j) = 1, and * scale = 0 and compute a solution to A**T *x = 0. * DO 150 I = 1, N X( I ) = ZERO 150 CONTINUE X( J ) = ONE SCALE = ZERO XMAX = ZERO END IF 160 CONTINUE ELSE * * Compute x(j) := x(j) / A(j,j) - CSUMJ if the dot * product has already been divided by 1/A(j,j). * X( J ) = ZLADIV( X( J ), TJJS ) - CSUMJ END IF XMAX = MAX( XMAX, CABS1( X( J ) ) ) 170 CONTINUE * ELSE * * Solve A**H * x = b * DO 220 J = JFIRST, JLAST, JINC * * Compute x(j) = b(j) - sum A(k,j)*x(k). * k<>j * XJ = CABS1( X( J ) ) USCAL = TSCAL REC = ONE / MAX( XMAX, ONE ) IF( CNORM( J ).GT.( BIGNUM-XJ )*REC ) THEN * * If x(j) could overflow, scale x by 1/(2*XMAX). * REC = REC*HALF IF( NOUNIT ) THEN TJJS = DCONJG( A( J, J ) )*TSCAL ELSE TJJS = TSCAL END IF TJJ = CABS1( TJJS ) IF( TJJ.GT.ONE ) THEN * * Divide by A(j,j) when scaling x if A(j,j) > 1. * REC = MIN( ONE, REC*TJJ ) USCAL = ZLADIV( USCAL, TJJS ) END IF IF( REC.LT.ONE ) THEN CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF END IF * CSUMJ = ZERO IF( USCAL.EQ.DCMPLX( ONE ) ) THEN * * If the scaling needed for A in the dot product is 1, * call ZDOTC to perform the dot product. * IF( UPPER ) THEN CSUMJ = ZDOTC( J-1, A( 1, J ), 1, X, 1 ) ELSE IF( J.LT.N ) THEN CSUMJ = ZDOTC( N-J, A( J+1, J ), 1, X( J+1 ), 1 ) END IF ELSE * * Otherwise, use in-line code for the dot product. * IF( UPPER ) THEN DO 180 I = 1, J - 1 CSUMJ = CSUMJ + ( DCONJG( A( I, J ) )*USCAL )* $ X( I ) 180 CONTINUE ELSE IF( J.LT.N ) THEN DO 190 I = J + 1, N CSUMJ = CSUMJ + ( DCONJG( A( I, J ) )*USCAL )* $ X( I ) 190 CONTINUE END IF END IF * IF( USCAL.EQ.DCMPLX( TSCAL ) ) THEN * * Compute x(j) := ( x(j) - CSUMJ ) / A(j,j) if 1/A(j,j) * was not used to scale the dotproduct. * X( J ) = X( J ) - CSUMJ XJ = CABS1( X( J ) ) IF( NOUNIT ) THEN TJJS = DCONJG( A( J, J ) )*TSCAL ELSE TJJS = TSCAL IF( TSCAL.EQ.ONE ) $ GO TO 210 END IF * * Compute x(j) = x(j) / A(j,j), scaling if necessary. * TJJ = CABS1( TJJS ) IF( TJJ.GT.SMLNUM ) THEN * * abs(A(j,j)) > SMLNUM: * IF( TJJ.LT.ONE ) THEN IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale X by 1/abs(x(j)). * REC = ONE / XJ CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF END IF X( J ) = ZLADIV( X( J ), TJJS ) ELSE IF( TJJ.GT.ZERO ) THEN * * 0 < abs(A(j,j)) <= SMLNUM: * IF( XJ.GT.TJJ*BIGNUM ) THEN * * Scale x by (1/abs(x(j)))*abs(A(j,j))*BIGNUM. * REC = ( TJJ*BIGNUM ) / XJ CALL ZDSCAL( N, REC, X, 1 ) SCALE = SCALE*REC XMAX = XMAX*REC END IF X( J ) = ZLADIV( X( J ), TJJS ) ELSE * * A(j,j) = 0: Set x(1:n) = 0, x(j) = 1, and * scale = 0 and compute a solution to A**H *x = 0. * DO 200 I = 1, N X( I ) = ZERO 200 CONTINUE X( J ) = ONE SCALE = ZERO XMAX = ZERO END IF 210 CONTINUE ELSE * * Compute x(j) := x(j) / A(j,j) - CSUMJ if the dot * product has already been divided by 1/A(j,j). * X( J ) = ZLADIV( X( J ), TJJS ) - CSUMJ END IF XMAX = MAX( XMAX, CABS1( X( J ) ) ) 220 CONTINUE END IF SCALE = SCALE / TSCAL END IF * * Scale the column norms by 1/TSCAL for return. * IF( TSCAL.NE.ONE ) THEN CALL DSCAL( N, ONE / TSCAL, CNORM, 1 ) END IF * RETURN * * End of ZLATRS * END octave-1.1.0/libcruft/lapack/zpotf2.f100666 415 17 12120 5462062465 15624 0ustar jweusers SUBROUTINE ZPOTF2( UPLO, N, A, LDA, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDA, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZPOTF2 computes the Cholesky factorization of a complex Hermitian * positive definite matrix A. * * The factorization has the form * A = U' * U , if UPLO = 'U', or * A = L * L', if UPLO = 'L', * where U is an upper triangular matrix and L is lower triangular. * * This is the unblocked version of the algorithm, calling Level 2 BLAS. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * Specifies whether the upper or lower triangular part of the * Hermitian matrix A is stored. * = 'U': Upper triangular * = 'L': Lower triangular * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the Hermitian matrix A. If UPLO = 'U', the leading * n by n upper triangular part of A contains the upper * triangular part of the matrix A, and the strictly lower * triangular part of A is not referenced. If UPLO = 'L', the * leading n by n lower triangular part of A contains the lower * triangular part of the matrix A, and the strictly upper * triangular part of A is not referenced. * * On exit, if INFO = 0, the factor U or L from the Cholesky * factorization A = U'*U or A = L*L'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -k, the k-th argument had an illegal value * > 0: if INFO = k, the leading minor of order k is not * positive definite, and the factorization could not be * completed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) COMPLEX*16 CONE PARAMETER ( CONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL UPPER INTEGER J DOUBLE PRECISION AJJ * .. * .. External Functions .. LOGICAL LSAME COMPLEX*16 ZDOTC EXTERNAL LSAME, ZDOTC * .. * .. External Subroutines .. EXTERNAL XERBLA, ZDSCAL, ZGEMV, ZLACGV * .. * .. Intrinsic Functions .. INTRINSIC DBLE, MAX, SQRT * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 UPPER = LSAME( UPLO, 'U' ) IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZPOTF2', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * IF( UPPER ) THEN * * Compute the Cholesky factorization A = U'*U. * DO 10 J = 1, N * * Compute U(J,J) and test for non-positive-definiteness. * AJJ = DBLE( A( J, J ) ) - ZDOTC( J-1, A( 1, J ), 1, $ A( 1, J ), 1 ) IF( AJJ.LE.ZERO ) THEN A( J, J ) = AJJ GO TO 30 END IF AJJ = SQRT( AJJ ) A( J, J ) = AJJ * * Compute elements J+1:N of row J. * IF( J.LT.N ) THEN CALL ZLACGV( J-1, A( 1, J ), 1 ) CALL ZGEMV( 'Transpose', J-1, N-J, -CONE, A( 1, J+1 ), $ LDA, A( 1, J ), 1, CONE, A( J, J+1 ), LDA ) CALL ZLACGV( J-1, A( 1, J ), 1 ) CALL ZDSCAL( N-J, ONE / AJJ, A( J, J+1 ), LDA ) END IF 10 CONTINUE ELSE * * Compute the Cholesky factorization A = L*L'. * DO 20 J = 1, N * * Compute L(J,J) and test for non-positive-definiteness. * AJJ = DBLE( A( J, J ) ) - ZDOTC( J-1, A( J, 1 ), LDA, $ A( J, 1 ), LDA ) IF( AJJ.LE.ZERO ) THEN A( J, J ) = AJJ GO TO 30 END IF AJJ = SQRT( AJJ ) A( J, J ) = AJJ * * Compute elements J+1:N of column J. * IF( J.LT.N ) THEN CALL ZLACGV( J-1, A( J, 1 ), LDA ) CALL ZGEMV( 'No transpose', N-J, J-1, -CONE, A( J+1, 1 ), $ LDA, A( J, 1 ), LDA, CONE, A( J+1, J ), 1 ) CALL ZLACGV( J-1, A( J, 1 ), LDA ) CALL ZDSCAL( N-J, ONE / AJJ, A( J+1, J ), 1 ) END IF 20 CONTINUE END IF GO TO 40 * 30 CONTINUE INFO = J * 40 CONTINUE RETURN * * End of ZPOTF2 * END octave-1.1.0/libcruft/lapack/zpotrf.f100666 415 17 13331 5462062465 15731 0ustar jweusers SUBROUTINE ZPOTRF( UPLO, N, A, LDA, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER UPLO INTEGER INFO, LDA, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ) * .. * * Purpose * ======= * * ZPOTRF computes the Cholesky factorization of a complex Hermitian * positive definite matrix A. * * The factorization has the form * A = U**H * U, if UPLO = 'U', or * A = L * L**H, if UPLO = 'L', * where U is an upper triangular matrix and L is lower triangular. * * This is the block version of the algorithm, calling Level 3 BLAS. * * Arguments * ========= * * UPLO (input) CHARACTER*1 * = 'U': Upper triangle of A is stored; * = 'L': Lower triangle of A is stored. * * N (input) INTEGER * The order of the matrix A. N >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the Hermitian matrix A. If UPLO = 'U', the leading * N-by-N upper triangular part of A contains the upper * triangular part of the matrix A, and the strictly lower * triangular part of A is not referenced. If UPLO = 'L', the * leading N-by-N lower triangular part of A contains the lower * triangular part of the matrix A, and the strictly upper * triangular part of A is not referenced. * * On exit, if INFO = 0, the factor U or L from the Cholesky * factorization A = U**H*U or A = L*L**H. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * > 0: if INFO = i, the leading minor of order i is not * positive definite, and the factorization could not be * completed. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE COMPLEX*16 CONE PARAMETER ( ONE = 1.0D+0, CONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL UPPER INTEGER J, JB, NB * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL XERBLA, ZGEMM, ZHERK, ZPOTF2, ZTRSM * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input parameters. * INFO = 0 UPPER = LSAME( UPLO, 'U' ) IF( .NOT.UPPER .AND. .NOT.LSAME( UPLO, 'L' ) ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -4 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZPOTRF', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) $ RETURN * * Determine the block size for this environment. * NB = ILAENV( 1, 'ZPOTRF', UPLO, N, -1, -1, -1 ) IF( NB.LE.1 .OR. NB.GE.N ) THEN * * Use unblocked code. * CALL ZPOTF2( UPLO, N, A, LDA, INFO ) ELSE * * Use blocked code. * IF( UPPER ) THEN * * Compute the Cholesky factorization A = U'*U. * DO 10 J = 1, N, NB * * Update and factorize the current diagonal block and test * for non-positive-definiteness. * JB = MIN( NB, N-J+1 ) CALL ZHERK( 'Upper', 'Conjugate transpose', JB, J-1, $ -ONE, A( 1, J ), LDA, ONE, A( J, J ), LDA ) CALL ZPOTF2( 'Upper', JB, A( J, J ), LDA, INFO ) IF( INFO.NE.0 ) $ GO TO 30 IF( J+JB.LE.N ) THEN * * Compute the current block row. * CALL ZGEMM( 'Conjugate transpose', 'No transpose', JB, $ N-J-JB+1, J-1, -CONE, A( 1, J ), LDA, $ A( 1, J+JB ), LDA, CONE, A( J, J+JB ), $ LDA ) CALL ZTRSM( 'Left', 'Upper', 'Conjugate transpose', $ 'Non-unit', JB, N-J-JB+1, CONE, A( J, J ), $ LDA, A( J, J+JB ), LDA ) END IF 10 CONTINUE * ELSE * * Compute the Cholesky factorization A = L*L'. * DO 20 J = 1, N, NB * * Update and factorize the current diagonal block and test * for non-positive-definiteness. * JB = MIN( NB, N-J+1 ) CALL ZHERK( 'Lower', 'No transpose', JB, J-1, -ONE, $ A( J, 1 ), LDA, ONE, A( J, J ), LDA ) CALL ZPOTF2( 'Lower', JB, A( J, J ), LDA, INFO ) IF( INFO.NE.0 ) $ GO TO 30 IF( J+JB.LE.N ) THEN * * Compute the current block column. * CALL ZGEMM( 'No transpose', 'Conjugate transpose', $ N-J-JB+1, JB, J-1, -CONE, A( J+JB, 1 ), $ LDA, A( J, 1 ), LDA, CONE, A( J+JB, J ), $ LDA ) CALL ZTRSM( 'Right', 'Lower', 'Conjugate transpose', $ 'Non-unit', N-J-JB+1, JB, CONE, A( J, J ), $ LDA, A( J+JB, J ), LDA ) END IF 20 CONTINUE END IF END IF GO TO 40 * 30 CONTINUE INFO = INFO + J - 1 * 40 CONTINUE RETURN * * End of ZPOTRF * END octave-1.1.0/libcruft/lapack/zrot.f100666 415 17 4707 5412145406 15362 0ustar jweusers SUBROUTINE ZROT( N, CX, INCX, CY, INCY, C, S ) * * -- LAPACK auxiliary routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER INCX, INCY, N DOUBLE PRECISION C COMPLEX*16 S * .. * .. Array Arguments .. COMPLEX*16 CX( * ), CY( * ) * .. * * Purpose * ======= * * ZROT applies a plane rotation, where the cos (C) is real and the * sin (S) is complex, and the vectors CX and CY are complex. * * Arguments * ========= * * N (input) INTEGER * The number of elements in the vectors CX and CY. * * CX (input/output) COMPLEX*16 array, dimension (N) * On input, the vector X. * On output, CX is overwritten with C*X + S*Y. * * INCX (input) INTEGER * The increment between successive values of CY. INCX <> 0. * * CY (input/output) COMPLEX*16 array, dimension (N) * On input, the vector Y. * On output, CY is overwritten with -CONJG(S)*X + C*Y. * * INCY (input) INTEGER * The increment between successive values of CY. INCX <> 0. * * C (input) DOUBLE PRECISION * S (input) COMPLEX*16 * C and S define a rotation * [ C S ] * [ -conjg(S) C ] * where C*C + S*CONJG(S) = 1.0. * * ===================================================================== * * .. Local Scalars .. INTEGER I, IX, IY COMPLEX*16 STEMP * .. * .. Intrinsic Functions .. INTRINSIC DCONJG * .. * .. Executable Statements .. * IF( N.LE.0 ) $ RETURN IF( INCX.EQ.1 .AND. INCY.EQ.1 ) $ GO TO 20 * * Code for unequal increments or equal increments not equal to 1 * IX = 1 IY = 1 IF( INCX.LT.0 ) $ IX = ( -N+1 )*INCX + 1 IF( INCY.LT.0 ) $ IY = ( -N+1 )*INCY + 1 DO 10 I = 1, N STEMP = C*CX( IX ) + S*CY( IY ) CY( IY ) = C*CY( IY ) - DCONJG( S )*CX( IX ) CX( IX ) = STEMP IX = IX + INCX IY = IY + INCY 10 CONTINUE RETURN * * Code for both increments equal to 1 * 20 CONTINUE DO 30 I = 1, N STEMP = C*CX( I ) + S*CY( I ) CY( I ) = C*CY( I ) - DCONJG( S )*CX( I ) CX( I ) = STEMP 30 CONTINUE RETURN END octave-1.1.0/libcruft/lapack/ztrevc.f100666 415 17 30176 5306544273 15727 0ustar jweusers SUBROUTINE ZTREVC( JOB, HOWMNY, SELECT, N, T, LDT, VL, LDVL, VR, $ LDVR, MM, M, WORK, RWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER HOWMNY, JOB INTEGER INFO, LDT, LDVL, LDVR, M, MM, N * .. * .. Array Arguments .. LOGICAL SELECT( * ) DOUBLE PRECISION RWORK( * ) COMPLEX*16 T( LDT, * ), VL( LDVL, * ), VR( LDVR, * ), $ WORK( * ) * .. * * Purpose * ======= * * ZTREVC computes all or some right and/or left eigenvectors of a * complex upper triangular matrix T. * * The right eigenvector x and the left eigenvector y of T corresponding * to an eigenvalue w are defined by: * * T*x = w*x, y'*T = w*y' * * where y' denotes the conjugate transpose of the vector y. * * The routine may either return the matrices X and/or Y of right or * left eigenvectors of T, or the products Q*X and/or Q*Y, where Q is an * input unitary matrix. If T was obtained from the Schur factorization * of an original matrix A = Q*T*Q', then Q*X and/or Q*Y are the * matrices of right or left eigenvectors of A. * * Arguments * ========= * * JOB (input) CHARACTER*1 * = 'R': compute right eigenvectors only * = 'L': compute left eigenvectors only * = 'B': compute both right and left eigenvectors * * HOWMNY (input) CHARACTER*1 * Specifies how many left/right eigenvectors are wanted and the * form of the eigenvector matrix X or Y returned in VR or VL. * = 'A': compute all right and/or left eigenvectors; * = 'O': compute all right and/or left eigenvectors, multiplied * on the left by an input (generally unitary) matrix; * = 'S': compute some right and/or left eigenvectors, specified * by the logical array SELECT. * * SELECT (input) LOGICAL array, dimension (N) * If HOWMNY = 'S', SELECT specifies the eigenvectors to be * computed. To select the eigenvector corresponding to the * j-th eigenvalue, SELECT(j) must be set to .TRUE.. * If HOWMNY = 'A' or 'O', SELECT is not referenced. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) COMPLEX*16 array, dimension (LDT,N) * The upper triangular matrix T. T is modified, but restored. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * VL (input/output) COMPLEX*16 array, dimension (LDVL,MM) * On entry, if JOB = 'L' or 'B' and HOWMNY = 'O', VL must * contain an n-by-n matrix Q (usually the unitary matrix Q of * Schur vectors returned by ZHSEQR). * On exit, if JOB = 'L' or 'B', VL contains: * if HOWMNY = 'A', the matrix Y of left eigenvectors of T; * if HOWMNY = 'O', the matrix Q*Y; * if HOWMNY = 'S', the left eigenvectors of T specified by * SELECT, stored consecutively in the columns * of VL, in the same order as their * eigenvalues. * If JOB = 'R', VL is not referenced. * * LDVL (input) INTEGER * The leading dimension of the array VL. * LDVL >= max(1,N) if JOB = 'L' or 'B'; LDVL >= 1 otherwise. * * VR (input/output) COMPLEX*16 array, dimension (LDVR,MM) * On entry, if JOB = 'R' or 'B' and HOWMNY = 'O', VR must * contain an n-by-n matrix Q (usually the unitary matrix Q of * Schur vectors returned by ZHSEQR). * On exit, if JOB = 'R' or 'B', VR contains: * if HOWMNY = 'A', the matrix X of right eigenvectors of T; * if HOWMNY = 'O', the matrix Q*X; * if HOWMNY = 'S', the right eigenvectors of T specified by * SELECT, stored consecutively in the columns * of VR, in the same order as their * eigenvalues. * If JOB = 'L', VR is not referenced. * * LDVR (input) INTEGER * The leading dimension of the array VR. * LDVR >= max(1,N) if JOB = 'R' or 'B'; LDVR >= 1 otherwise. * * MM (input) INTEGER * The number of columns in the arrays VL and/or VR. MM >= M. * * M (output) INTEGER * The number of columns in the arrays VL and/or VR required to * store the eigenvectors. If HOWMNY = 'A' or 'O', M is set * to N. * * WORK (workspace) COMPLEX*16 array, dimension (2*N) * * RWORK (workspace) DOUBLE PRECISION array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * The algorithm used in this program is basically backward (forward) * substitution, with scaling to make the the code robust against * possible overflow. * * Each eigenvector is normalized so that the element of largest * magnitude has magnitude 1; here the magnitude of a complex number * (x,y) is taken to be |x| + |y|. * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) COMPLEX*16 CMZERO, CMONE PARAMETER ( CMZERO = 0.0D+0, CMONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL ALLV, BOTHV, LEFTV, OVER, RIGHTV, SOMEV INTEGER I, II, IS, J, K, KI DOUBLE PRECISION OVFL, REMAX, SCALE, SMIN, SMLNUM, ULP, UNFL COMPLEX*16 CDUM * .. * .. External Functions .. LOGICAL LSAME INTEGER IZAMAX DOUBLE PRECISION DLAMCH, DZASUM EXTERNAL LSAME, IZAMAX, DLAMCH, DZASUM * .. * .. External Subroutines .. EXTERNAL DLABAD, XERBLA, ZCOPY, ZDSCAL, ZGEMV, ZLATRS * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX * .. * .. Statement Functions .. DOUBLE PRECISION CABS1 * .. * .. Statement Function definitions .. CABS1( CDUM ) = ABS( DBLE( CDUM ) ) + ABS( DIMAG( CDUM ) ) * .. * .. Executable Statements .. * * Decode and test the input parameters * BOTHV = LSAME( JOB, 'B' ) RIGHTV = LSAME( JOB, 'R' ) .OR. BOTHV LEFTV = LSAME( JOB, 'L' ) .OR. BOTHV * ALLV = LSAME( HOWMNY, 'A' ) OVER = LSAME( HOWMNY, 'O' ) SOMEV = LSAME( HOWMNY, 'S' ) * * Set M to the number of columns required to store the selected * eigenvectors. * IF( SOMEV ) THEN M = 0 DO 10 J = 1, N IF( SELECT( J ) ) $ M = M + 1 10 CONTINUE ELSE M = N END IF * INFO = 0 IF( .NOT.RIGHTV .AND. .NOT.LEFTV ) THEN INFO = -1 ELSE IF( .NOT.ALLV .AND. .NOT.OVER .AND. .NOT.SOMEV ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -6 ELSE IF( LDVL.LT.1 .OR. ( LEFTV .AND. LDVL.LT.N ) ) THEN INFO = -8 ELSE IF( LDVR.LT.1 .OR. ( RIGHTV .AND. LDVR.LT.N ) ) THEN INFO = -10 ELSE IF( MM.LT.M ) THEN INFO = -11 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZTREVC', -INFO ) RETURN END IF * * Quick return if possible. * IF( N.EQ.0 ) $ RETURN * * Set the constants to control overflow. * UNFL = DLAMCH( 'Safe minimum' ) OVFL = ONE / UNFL CALL DLABAD( UNFL, OVFL ) ULP = DLAMCH( 'Precision' ) SMLNUM = UNFL*( N / ULP ) * * Store the diagonal elements of T in working array WORK. * DO 20 I = 1, N WORK( I+N ) = T( I, I ) 20 CONTINUE * * Compute 1-norm of each column of strictly upper triangular * part of T to control overflow in triangular solver. * RWORK( 1 ) = ZERO DO 30 J = 2, N RWORK( J ) = DZASUM( J-1, T( 1, J ), 1 ) 30 CONTINUE * IF( RIGHTV ) THEN * * Compute right eigenvectors. * IS = M DO 80 KI = N, 1, -1 * IF( SOMEV ) THEN IF( .NOT.SELECT( KI ) ) $ GO TO 80 END IF SMIN = MAX( ULP*( CABS1( T( KI, KI ) ) ), SMLNUM ) * WORK( 1 ) = CMONE * * Form right-hand side. * DO 40 K = 1, KI - 1 WORK( K ) = -T( K, KI ) 40 CONTINUE * * Solve the triangular system: * (T(1:KI-1,1:KI-1) - T(KI,KI))*X = SCALE*WORK. * DO 50 K = 1, KI - 1 T( K, K ) = T( K, K ) - T( KI, KI ) IF( CABS1( T( K, K ) ).LT.SMIN ) $ T( K, K ) = SMIN 50 CONTINUE * IF( KI.GT.1 ) THEN CALL ZLATRS( 'Upper', 'No transpose', 'Non-unit', 'Y', $ KI-1, T, LDT, WORK( 1 ), SCALE, RWORK, $ INFO ) WORK( KI ) = SCALE END IF * * Copy the vector x or Q*x to VR and normalize. * IF( .NOT.OVER ) THEN CALL ZCOPY( KI, WORK( 1 ), 1, VR( 1, IS ), 1 ) * II = IZAMAX( KI, VR( 1, IS ), 1 ) REMAX = ONE / CABS1( VR( II, IS ) ) CALL ZDSCAL( KI, REMAX, VR( 1, IS ), 1 ) * DO 60 K = KI + 1, N VR( K, IS ) = CMZERO 60 CONTINUE ELSE IF( KI.GT.1 ) $ CALL ZGEMV( 'N', N, KI-1, CMONE, VR, LDVR, WORK( 1 ), $ 1, DCMPLX( SCALE ), VR( 1, KI ), 1 ) * II = IZAMAX( N, VR( 1, KI ), 1 ) REMAX = ONE / CABS1( VR( II, KI ) ) CALL ZDSCAL( N, REMAX, VR( 1, KI ), 1 ) END IF * * Set back the original diagonal elements of T. * DO 70 K = 1, KI - 1 T( K, K ) = WORK( K+N ) 70 CONTINUE * IS = IS - 1 80 CONTINUE END IF * IF( LEFTV ) THEN * * Compute left eigenvectors. * IS = 1 DO 130 KI = 1, N * IF( SOMEV ) THEN IF( .NOT.SELECT( KI ) ) $ GO TO 130 END IF SMIN = MAX( ULP*( CABS1( T( KI, KI ) ) ), SMLNUM ) * WORK( N ) = CMONE * * Form right-hand side. * DO 90 K = KI + 1, N WORK( K ) = -DCONJG( T( KI, K ) ) 90 CONTINUE * * Solve the triangular system: * (T(KI+1:N,KI+1:N) - T(KI,KI))'*X = SCALE*WORK. * DO 100 K = KI + 1, N T( K, K ) = T( K, K ) - T( KI, KI ) IF( CABS1( T( K, K ) ).LT.SMIN ) $ T( K, K ) = SMIN 100 CONTINUE * IF( KI.LT.N ) THEN CALL ZLATRS( 'Upper', 'Conjugate transpose', 'Non-unit', $ 'Y', N-KI, T( KI+1, KI+1 ), LDT, $ WORK( KI+1 ), SCALE, RWORK, INFO ) WORK( KI ) = SCALE END IF * * Copy the vector x or Q*x to VL and normalize. * IF( .NOT.OVER ) THEN CALL ZCOPY( N-KI+1, WORK( KI ), 1, VL( KI, IS ), 1 ) * II = IZAMAX( N-KI+1, VL( KI, IS ), 1 ) + KI - 1 REMAX = ONE / CABS1( VL( II, IS ) ) CALL ZDSCAL( N-KI+1, REMAX, VL( KI, IS ), 1 ) * DO 110 K = 1, KI - 1 VL( K, IS ) = CMZERO 110 CONTINUE ELSE IF( KI.LT.N ) $ CALL ZGEMV( 'N', N, N-KI, CMONE, VL( 1, KI+1 ), LDVL, $ WORK( KI+1 ), 1, DCMPLX( SCALE ), $ VL( 1, KI ), 1 ) * II = IZAMAX( N, VL( 1, KI ), 1 ) REMAX = ONE / CABS1( VL( II, KI ) ) CALL ZDSCAL( N, REMAX, VL( 1, KI ), 1 ) END IF * * Set back the original diagonal elements of T. * DO 120 K = KI + 1, N T( K, K ) = WORK( K+N ) 120 CONTINUE * IS = IS + 1 130 CONTINUE END IF * RETURN * * End of ZTREVC * END octave-1.1.0/libcruft/lapack/ztrexc.f100666 415 17 11011 5412145406 15705 0ustar jweusers SUBROUTINE ZTREXC( COMPQ, N, T, LDT, Q, LDQ, IFST, ILST, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER COMPQ INTEGER IFST, ILST, INFO, LDQ, LDT, N * .. * .. Array Arguments .. COMPLEX*16 Q( LDQ, * ), T( LDT, * ) * .. * * Purpose * ======= * * ZTREXC reorders the Schur factorization of a complex matrix * A = Q*T*Q**H, so that the diagonal element of T with row index IFST * is moved to row ILST. * * The Schur form T is reordered by a unitary similarity transformation * Z**H*T*Z, and optionally the matrix Q of Schur vectors is updated by * postmultplying it with Z. * * Arguments * ========= * * COMPQ (input) CHARACTER*1 * = 'V': update the matrix Q of Schur vectors; * = 'N': do not update Q. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) COMPLEX*16 array, dimension (LDT,N) * On entry, the upper triangular matrix T. * On exit, the reordered upper triangular matrix. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * Q (input/output) COMPLEX*16 array, dimension (LDQ,N) * On entry, if COMPQ = 'V', the matrix Q of Schur vectors. * On exit, if COMPQ = 'V', Q has been postmultiplied by the * unitary transformation matrix Z which reorders T. * If COMPQ = 'N', Q is not referenced. * * LDQ (input) INTEGER * The leading dimension of the array Q. LDQ >= max(1,N). * * IFST (input) INTEGER * ILST (input) INTEGER * Specify the reordering of the diagonal elements of T: * The element with row index IFST is moved to row ILST by a * sequence of transpositions between adjacent elements. * 1 <= IFST <= N; 1 <= ILST <= N. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Local Scalars .. LOGICAL WANTQ INTEGER K, M1, M2, M3 DOUBLE PRECISION CS COMPLEX*16 SN, T11, T22, TEMP * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARTG, ZROT * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Decode and test the input parameters. * INFO = 0 WANTQ = LSAME( COMPQ, 'V' ) IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN INFO = -1 ELSE IF( N.LT.0 ) THEN INFO = -2 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -4 ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.MAX( 1, N ) ) ) THEN INFO = -6 ELSE IF( IFST.LT.1 .OR. IFST.GT.N ) THEN INFO = -7 ELSE IF( ILST.LT.1 .OR. ILST.GT.N ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZTREXC', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.1 .OR. IFST.EQ.ILST ) $ RETURN * IF( IFST.LT.ILST ) THEN * * Move the IFST-th diagonal element forward down the diagonal. * M1 = 0 M2 = -1 M3 = 1 ELSE * * Move the IFST-th diagonal element backward up the diagonal. * M1 = -1 M2 = 0 M3 = -1 END IF * DO 10 K = IFST + M1, ILST + M2, M3 * * Interchange the k-th and (k+1)-th diagonal elements. * T11 = T( K, K ) T22 = T( K+1, K+1 ) * * Determine the transformation to perform the interchange. * CALL ZLARTG( T( K, K+1 ), T22-T11, CS, SN, TEMP ) * * Apply transformation to the matrix T. * IF( K+2.LE.N ) $ CALL ZROT( N-K-1, T( K, K+2 ), LDT, T( K+1, K+2 ), LDT, CS, $ SN ) CALL ZROT( K-1, T( 1, K ), 1, T( 1, K+1 ), 1, CS, $ DCONJG( SN ) ) * T( K, K ) = T22 T( K+1, K+1 ) = T11 * IF( WANTQ ) THEN * * Accumulate transformation in the matrix Q. * CALL ZROT( N, Q( 1, K ), 1, Q( 1, K+1 ), 1, CS, $ DCONJG( SN ) ) END IF * 10 CONTINUE * RETURN * * End of ZTREXC * END octave-1.1.0/libcruft/lapack/ztrsen.f100666 415 17 25231 5412145401 15717 0ustar jweusers SUBROUTINE ZTRSEN( JOB, COMPQ, SELECT, N, T, LDT, Q, LDQ, W, M, S, $ SEP, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER COMPQ, JOB INTEGER INFO, LDQ, LDT, LWORK, M, N DOUBLE PRECISION S, SEP * .. * .. Array Arguments .. LOGICAL SELECT( * ) COMPLEX*16 Q( LDQ, * ), T( LDT, * ), W( * ), WORK( * ) * .. * * Purpose * ======= * * ZTRSEN reorders the Schur factorization of a complex matrix * A = Q*T*Q**H, so that a selected cluster of eigenvalues appears in * the leading positions on the diagonal of the upper triangular matrix * T, and the leading columns of Q form an orthonormal basis of the * corresponding right invariant subspace. * * Optionally the routine computes the reciprocal condition numbers of * the cluster of eigenvalues and/or the invariant subspace. * * Arguments * ========= * * JOB (input) CHARACTER*1 * Specifies whether condition numbers are required for the * cluster of eigenvalues (S) or the invariant subspace (SEP): * = 'N': none; * = 'E': for eigenvalues only (S); * = 'V': for invariant subspace only (SEP); * = 'B': for both eigenvalues and invariant subspace (S and * SEP). * * COMPQ (input) CHARACTER*1 * = 'V': update the matrix Q of Schur vectors; * = 'N': do not update Q. * * SELECT (input) LOGICAL array, dimension (N) * SELECT specifies the eigenvalues in the selected cluster. To * select the j-th eigenvalue, SELECT(j) must be set to .TRUE.. * * N (input) INTEGER * The order of the matrix T. N >= 0. * * T (input/output) COMPLEX*16 array, dimension(LDT,N) * On entry, the upper triangular matrix T. * On exit, T is overwritten by the reordered matrix T, with the * selected eigenvalues as the leading diagonal elements. * * LDT (input) INTEGER * The leading dimension of the array T. LDT >= max(1,N). * * Q (input/output) COMPLEX*16 array, dimension (LDQ,N) * On entry, if COMPQ = 'V', the matrix Q of Schur vectors. * On exit, if COMPQ = 'V', Q has been postmultiplied by the * unitary transformation matrix which reorders T; the leading M * columns of Q form an orthonormal basis for the specified * invariant subspace. * If COMPQ = 'N', Q is not referenced. * * LDQ (input) INTEGER * The leading dimension of the array Q. * LDQ >= 1; and if COMPQ = 'V', LDQ >= N. * * W (output) COMPLEX*16 * The reordered eigenvalues of T, in the same order as they * appear on the diagonal of T. * * M (output) INTEGER * The dimension of the specified invariant subspace. * 0 <= M <= N. * * S (output) DOUBLE PRECISION * If JOB = 'E' or 'B', S is a lower bound on the reciprocal * condition number for the selected cluster of eigenvalues. * S cannot underestimate the true reciprocal condition number * by more than a factor of sqrt(N). If M = 0 or N, S = 1. * If JOB = 'N' or 'V', S is not referenced. * * SEP (output) DOUBLE PRECISION * If JOB = 'V' or 'B', SEP is the estimated reciprocal * condition number of the specified invariant subspace. If * M = 0 or N, SEP = norm(T). * If JOB = 'N' or 'E', SEP is not referenced. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * If JOB = 'N', WORK is not referenced. * * LWORK (input) INTEGER * The dimension of the array WORK. * If JOB = 'N', LWORK >= 1; * if JOB = 'E', LWORK = M*(N-M); * if JOB = 'V' or 'B', LWORK >= 2*M*(N-M). * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * Further Details * =============== * * ZTRSEN first collects the selected eigenvalues by computing a unitary * transformation Z to move them to the top left corner of T. In other * words, the selected eigenvalues are the eigenvalues of T11 in: * * Z'*T*Z = ( T11 T12 ) n1 * ( 0 T22 ) n2 * n1 n2 * * where N = n1+n2 and Z' means the conjugate transpose of Z. The first * n1 columns of Z span the specified invariant subspace of T. * * If T has been obtained from the Schur factorization of a matrix * A = Q*T*Q', then the reordered Schur factorization of A is given by * A = (Q*Z)*(Z'*T*Z)*(Q*Z)', and the first n1 columns of Q*Z span the * corresponding invariant subspace of A. * * The reciprocal condition number of the average of the eigenvalues of * T11 may be returned in S. S lies between 0 (very badly conditioned) * and 1 (very well conditioned). It is computed as follows. First we * compute R so that * * P = ( I R ) n1 * ( 0 0 ) n2 * n1 n2 * * is the projector on the invariant subspace associated with T11. * R is the solution of the Sylvester equation: * * T11*R - R*T22 = T12. * * Let F-norm(M) denote the Frobenius-norm of M and 2-norm(M) denote * the two-norm of M. Then S is computed as the lower bound * * (1 + F-norm(R)**2)**(-1/2) * * on the reciprocal of 2-norm(P), the true reciprocal condition number. * S cannot underestimate 1 / 2-norm(P) by more than a factor of * sqrt(N). * * An approximate error bound for the computed average of the * eigenvalues of T11 is * * EPS * norm(T) / S * * where EPS is the machine precision. * * The reciprocal condition number of the right invariant subspace * spanned by the first n1 columns of Z (or of Q*Z) is returned in SEP. * SEP is defined as the separation of T11 and T22: * * sep( T11, T22 ) = sigma-min( C ) * * where sigma-min(C) is the smallest singular value of the * n1*n2-by-n1*n2 matrix * * C = kprod( I(n2), T11 ) - kprod( transpose(T22), I(n1) ) * * I(m) is an m by m identity matrix, and kprod denotes the Kronecker * product. We estimate sigma-min(C) by the reciprocal of an estimate of * the 1-norm of inverse(C). The true reciprocal 1-norm of inverse(C) * cannot differ from sigma-min(C) by more than a factor of sqrt(n1*n2). * * When SEP is small, small changes in T can cause large changes in * the invariant subspace. An approximate bound on the maximum angular * error in the computed right invariant subspace is * * EPS * norm(T) / SEP * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL WANTBH, WANTQ, WANTS, WANTSP INTEGER IERR, K, KASE, KS, N1, N2, NN DOUBLE PRECISION EST, RNORM, SCALE * .. * .. Local Arrays .. DOUBLE PRECISION RWORK( 1 ) * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION ZLANGE EXTERNAL LSAME, ZLANGE * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLACON, ZLACPY, ZTREXC, ZTRSYL * .. * .. Intrinsic Functions .. INTRINSIC MAX, SQRT * .. * .. Executable Statements .. * * Decode and test the input parameters. * WANTBH = LSAME( JOB, 'B' ) WANTS = LSAME( JOB, 'E' ) .OR. WANTBH WANTSP = LSAME( JOB, 'V' ) .OR. WANTBH WANTQ = LSAME( COMPQ, 'V' ) * * Set M to the number of selected eigenvalues. * M = 0 DO 10 K = 1, N IF( SELECT( K ) ) $ M = M + 1 10 CONTINUE * N1 = M N2 = N - M NN = N1*N2 * INFO = 0 IF( .NOT.LSAME( JOB, 'N' ) .AND. .NOT.WANTS .AND. .NOT.WANTSP ) $ THEN INFO = -1 ELSE IF( .NOT.LSAME( COMPQ, 'N' ) .AND. .NOT.WANTQ ) THEN INFO = -2 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( LDT.LT.MAX( 1, N ) ) THEN INFO = -6 ELSE IF( LDQ.LT.1 .OR. ( WANTQ .AND. LDQ.LT.N ) ) THEN INFO = -8 ELSE IF( LWORK.LT.1 .OR. ( ( WANTS .AND. .NOT.WANTSP ) .AND. $ LWORK.LT.NN ) .OR. ( WANTSP .AND. LWORK.LT.2*NN ) ) THEN INFO = -14 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZTRSEN', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.N .OR. M.EQ.0 ) THEN IF( WANTS ) $ S = ONE IF( WANTSP ) $ SEP = ZLANGE( '1', N, N, T, LDT, RWORK ) GO TO 40 END IF * * Collect the selected eigenvalues at the top left corner of T. * KS = 0 DO 20 K = 1, N IF( SELECT( K ) ) THEN KS = KS + 1 * * Swap the K-th eigenvalue to position KS. * IF( K.NE.KS ) $ CALL ZTREXC( COMPQ, N, T, LDT, Q, LDQ, K, KS, IERR ) END IF 20 CONTINUE * IF( WANTS ) THEN * * Solve the Sylvester equation for R: * * T11*R - R*T22 = scale*T12 * CALL ZLACPY( 'F', N1, N2, T( 1, N1+1 ), LDT, WORK, N1 ) CALL ZTRSYL( 'N', 'N', -1, N1, N2, T, LDT, T( N1+1, N1+1 ), $ LDT, WORK, N1, SCALE, IERR ) * * Estimate the reciprocal of the condition number of the cluster * of eigenvalues. * RNORM = ZLANGE( 'F', N1, N2, WORK, N1, RWORK ) IF( RNORM.EQ.ZERO ) THEN S = ONE ELSE S = SCALE / ( SQRT( SCALE*SCALE / RNORM+RNORM )* $ SQRT( RNORM ) ) END IF END IF * IF( WANTSP ) THEN * * Estimate sep(T11,T22). * EST = ZERO KASE = 0 30 CONTINUE CALL ZLACON( NN, WORK( NN+1 ), WORK, EST, KASE ) IF( KASE.NE.0 ) THEN IF( KASE.EQ.1 ) THEN * * Solve T11*R - R*T22 = scale*X. * CALL ZTRSYL( 'N', 'N', -1, N1, N2, T, LDT, $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE, $ IERR ) ELSE * * Solve T11'*R - R*T22' = scale*X. * CALL ZTRSYL( 'C', 'C', -1, N1, N2, T, LDT, $ T( N1+1, N1+1 ), LDT, WORK, N1, SCALE, $ IERR ) END IF GO TO 30 END IF * SEP = SCALE / EST END IF * 40 CONTINUE * * Copy reordered eigenvalues to W. * DO 50 K = 1, N W( K ) = T( K, K ) 50 CONTINUE RETURN * * End of ZTRSEN * END octave-1.1.0/libcruft/lapack/ztrsyl.f100666 415 17 26612 5412145402 15746 0ustar jweusers SUBROUTINE ZTRSYL( TRANA, TRANB, ISGN, M, N, A, LDA, B, LDB, C, $ LDC, SCALE, INFO ) * * -- LAPACK routine (version 1.1) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * March 31, 1993 * * .. Scalar Arguments .. CHARACTER TRANA, TRANB INTEGER INFO, ISGN, LDA, LDB, LDC, M, N DOUBLE PRECISION SCALE * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), B( LDB, * ), C( LDC, * ) * .. * * Purpose * ======= * * ZTRSYL solves the complex Sylvester matrix equation: * * op(A)*X + X*op(B) = scale*C or * op(A)*X - X*op(B) = scale*C, * * where op(A) = A or A**H, and A and B are both upper triangular. A is * M-by-M and B is N-by-N; the right hand side C and the solution X are * M-by-N; and scale is an output scale factor, set <= 1 to avoid * overflow in X. * * Arguments * ========= * * TRANA (input) CHARACTER*1 * Specifies the option op(A): * = 'N': op(A) = A (No transpose) * = 'C': op(A) = A**H (Conjugate transpose) * * TRANB (input) CHARACTER*1 * Specifies the option op(B): * = 'N': op(B) = B (No transpose) * = 'C': op(B) = B**H (Conjugate transpose) * * ISGN (input) INTEGER * Specifies the sign in the equation: * = +1: solve op(A)*X + X*op(B) = scale*C * = -1: solve op(A)*X - X*op(B) = scale*C * * M (input) INTEGER * The order of the matrix A, and the number of rows in the * matrices X and C. M >= 0. * * N (input) INTEGER * The order of the matrix B, and the number of columns in the * matrices X and C. N >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,M) * The upper triangular matrix A. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,M). * * B (input) COMPLEX*16 array, dimension (LDB,N) * The upper triangular matrix B. * * LDB (input) INTEGER * The leading dimension of the array B. LDB >= max(1,N). * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the M-by-N right hand side matrix C. * On exit, C is overwritten by the solution matrix X. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M) * * SCALE (output) DOUBLE PRECISION * The scale factor, scale, set <= 1 to avoid overflow in X. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * = 1: A and B have common or very close eigenvalues; perturbed * values were used to solve the equation (but the matrices * A and B are unchanged). * * ===================================================================== * * .. Parameters .. DOUBLE PRECISION ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL NOTRNA, NOTRNB INTEGER J, K, L DOUBLE PRECISION BIGNUM, DA11, DB, EPS, SCALOC, SGN, SMIN, $ SMLNUM COMPLEX*16 A11, SUML, SUMR, VEC, X11 * .. * .. Local Arrays .. DOUBLE PRECISION DUM( 1 ) * .. * .. External Functions .. LOGICAL LSAME DOUBLE PRECISION DLAMCH, ZLANGE COMPLEX*16 ZDOTC, ZDOTU EXTERNAL LSAME, DLAMCH, ZLANGE, ZDOTC, ZDOTU * .. * .. External Subroutines .. EXTERNAL DLABAD, XERBLA, ZDSCAL * .. * .. Intrinsic Functions .. INTRINSIC ABS, DBLE, DCMPLX, DCONJG, DIMAG, MAX, MIN * .. * .. Executable Statements .. * * Decode and Test input parameters * NOTRNA = LSAME( TRANA, 'N' ) NOTRNB = LSAME( TRANB, 'N' ) * INFO = 0 IF( .NOT.NOTRNA .AND. .NOT.LSAME( TRANA, 'T' ) .AND. .NOT. $ LSAME( TRANA, 'C' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRNB .AND. .NOT.LSAME( TRANB, 'T' ) .AND. .NOT. $ LSAME( TRANB, 'C' ) ) THEN INFO = -2 ELSE IF( ISGN.NE.1 .AND. ISGN.NE.-1 ) THEN INFO = -3 ELSE IF( M.LT.0 ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -7 ELSE IF( LDB.LT.MAX( 1, N ) ) THEN INFO = -9 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -11 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZTRSYL', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) $ RETURN * * Set constants to control overflow * EPS = DLAMCH( 'P' ) SMLNUM = DLAMCH( 'S' ) BIGNUM = ONE / SMLNUM CALL DLABAD( SMLNUM, BIGNUM ) SMLNUM = SMLNUM*DBLE( M*N ) / EPS BIGNUM = ONE / SMLNUM SMIN = MAX( SMLNUM, EPS*ZLANGE( 'M', M, M, A, LDA, DUM ), $ EPS*ZLANGE( 'M', N, N, B, LDB, DUM ) ) SCALE = ONE SGN = ISGN * IF( NOTRNA .AND. NOTRNB ) THEN * * Solve A*X + ISGN*X*B = scale*C. * * The (K,L)th block of X is determined starting from * bottom-left corner column by column by * * A(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) * * Where * M L-1 * R(K,L) = SUM [A(K,I)*X(I,L)] +ISGN*SUM [X(K,J)*B(J,L)]. * I=K+1 J=1 * DO 30 L = 1, N DO 20 K = M, 1, -1 * SUML = ZDOTU( M-K, A( K, MIN( K+1, M ) ), LDA, $ C( MIN( K+1, M ), L ), 1 ) SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 ) VEC = C( K, L ) - ( SUML+SGN*SUMR ) * SCALOC = ONE A11 = A( K, K ) + SGN*B( L, L ) DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF X11 = ( VEC*DCMPLX( SCALOC ) ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 10 J = 1, N CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) 10 CONTINUE SCALE = SCALE*SCALOC END IF C( K, L ) = X11 * 20 CONTINUE 30 CONTINUE * ELSE IF( .NOT.NOTRNA .AND. NOTRNB ) THEN * * Solve A' *X + ISGN*X*B = scale*C. * * The (K,L)th block of X is determined starting from * upper-left corner column by column by * * A'(K,K)*X(K,L) + ISGN*X(K,L)*B(L,L) = C(K,L) - R(K,L) * * Where * K-1 L-1 * R(K,L) = SUM [A'(I,K)*X(I,L)] + ISGN*SUM [X(K,J)*B(J,L)] * I=1 J=1 * DO 60 L = 1, N DO 50 K = 1, M * SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 ) SUMR = ZDOTU( L-1, C( K, 1 ), LDC, B( 1, L ), 1 ) VEC = C( K, L ) - ( SUML+SGN*SUMR ) * SCALOC = ONE A11 = DCONJG( A( K, K ) ) + SGN*B( L, L ) DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF * X11 = ( VEC*DCMPLX( SCALOC ) ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 40 J = 1, N CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) 40 CONTINUE SCALE = SCALE*SCALOC END IF C( K, L ) = X11 * 50 CONTINUE 60 CONTINUE * ELSE IF( .NOT.NOTRNA .AND. .NOT.NOTRNB ) THEN * * Solve A'*X + ISGN*X*B' = C. * * The (K,L)th block of X is determined starting from * upper-right corner column by column by * * A'(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L) * * Where * K-1 * R(K,L) = SUM [A'(I,K)*X(I,L)] + * I=1 * N * ISGN*SUM [X(K,J)*B'(L,J)]. * J=L+1 * DO 90 L = N, 1, -1 DO 80 K = 1, M * SUML = ZDOTC( K-1, A( 1, K ), 1, C( 1, L ), 1 ) SUMR = ZDOTC( N-L, C( K, MIN( L+1, N ) ), LDC, $ B( L, MIN( L+1, N ) ), LDB ) VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) ) * SCALOC = ONE A11 = DCONJG( A( K, K )+SGN*B( L, L ) ) DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF * X11 = ( VEC*DCMPLX( SCALOC ) ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 70 J = 1, N CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) 70 CONTINUE SCALE = SCALE*SCALOC END IF C( K, L ) = X11 * 80 CONTINUE 90 CONTINUE * ELSE IF( NOTRNA .AND. .NOT.NOTRNB ) THEN * * Solve A*X + ISGN*X*B' = C. * * The (K,L)th block of X is determined starting from * bottom-left corner column by column by * * A(K,K)*X(K,L) + ISGN*X(K,L)*B'(L,L) = C(K,L) - R(K,L) * * Where * M N * R(K,L) = SUM [A(K,I)*X(I,L)] + ISGN*SUM [X(K,J)*B'(L,J)] * I=K+1 J=L+1 * DO 120 L = N, 1, -1 DO 110 K = M, 1, -1 * SUML = ZDOTU( M-K, A( K, MIN( K+1, M ) ), LDA, $ C( MIN( K+1, M ), L ), 1 ) SUMR = ZDOTC( N-L, C( K, MIN( L+1, N ) ), LDC, $ B( L, MIN( L+1, N ) ), LDB ) VEC = C( K, L ) - ( SUML+SGN*DCONJG( SUMR ) ) * SCALOC = ONE A11 = A( K, K ) + SGN*DCONJG( B( L, L ) ) DA11 = ABS( DBLE( A11 ) ) + ABS( DIMAG( A11 ) ) IF( DA11.LE.SMIN ) THEN A11 = SMIN DA11 = SMIN INFO = 1 END IF DB = ABS( DBLE( VEC ) ) + ABS( DIMAG( VEC ) ) IF( DA11.LT.ONE .AND. DB.GT.ONE ) THEN IF( DB.GT.BIGNUM*DA11 ) $ SCALOC = ONE / DB END IF * X11 = ( VEC*DCMPLX( SCALOC ) ) / A11 * IF( SCALOC.NE.ONE ) THEN DO 100 J = 1, N CALL ZDSCAL( M, SCALOC, C( 1, J ), 1 ) 100 CONTINUE SCALE = SCALE*SCALOC END IF C( K, L ) = X11 * 110 CONTINUE 120 CONTINUE * END IF * RETURN * * End of ZTRSYL * END octave-1.1.0/libcruft/lapack/zung2r.f100666 415 17 6644 5306544274 15625 0ustar jweusers SUBROUTINE ZUNG2R( M, N, K, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZUNG2R generates an m by n complex matrix Q with orthonormal columns, * which is defined as the first n columns of a product of k elementary * reflectors of order m * * Q = H(1) H(2) . . . H(k) * * as returned by ZGEQRF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. M >= N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. N >= K >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the i-th column must contain the vector which * defines the elementary reflector H(i), for i = 1,2,...,k, as * returned by ZGEQRF in the first k columns of its array * argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGEQRF. * * WORK (workspace) COMPLEX*16 array, dimension (N) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J, L * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARF, ZSCAL * .. * .. Intrinsic Functions .. INTRINSIC MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 .OR. N.GT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNG2R', -INFO ) RETURN END IF * * Quick return if possible * IF( N.LE.0 ) $ RETURN * * Initialise columns k+1:n to columns of the unit matrix * DO 20 J = K + 1, N DO 10 L = 1, M A( L, J ) = ZERO 10 CONTINUE A( J, J ) = ONE 20 CONTINUE * DO 40 I = K, 1, -1 * * Apply H(i) to A(i:m,i:n) from the left * IF( I.LT.N ) THEN A( I, I ) = ONE CALL ZLARF( 'Left', M-I+1, N-I, A( I, I ), 1, TAU( I ), $ A( I, I+1 ), LDA, WORK ) END IF IF( I.LT.M ) $ CALL ZSCAL( M-I, -TAU( I ), A( I+1, I ), 1 ) A( I, I ) = ONE - TAU( I ) * * Set A(1:i-1,i) to zero * DO 30 L = 1, I - 1 A( L, I ) = ZERO 30 CONTINUE 40 CONTINUE RETURN * * End of ZUNG2R * END octave-1.1.0/libcruft/lapack/zungbr.f100666 415 17 15234 5306544301 15707 0ustar jweusers SUBROUTINE ZUNGBR( VECT, M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * June 30, 1992 * * .. Scalar Arguments .. CHARACTER VECT INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZUNGBR generates one of the matrices Q or P' determined by ZGEBRD * when reducing a complex matrix A to bidiagonal form: A = Q * B * P'. * Q and P' are defined as products of elementary reflectors H(i) or * G(i) respectively.. * * If VECT = 'Q', A is assumed to have been an m-by-k matrix, and Q * is of order m: * if m >= k, Q = H(1) H(2) . . . H(k) and ZUNGBR returns the first n * columns of Q, where m >= n >= k; * if m < k, Q = H(1) H(2) . . . H(m-1) and ZUNGBR returns Q as an * m-by-m matrix. * * If VECT = 'P', A is assumed to have been a k-by-n matrix, and P' * is of order n: * if k < n, P' = G(k) . . . G(2) G(1) and ZUNGBR returns the first m * rows of P', where n >= m >= k; * if k >= n, P' = G(n-1) . . . G(2) G(1) and ZUNGBR returns P' as an * n-by-n matrix. * * Arguments * ========= * * VECT (input) CHARACTER*1 * Specifies whether the matrix Q or the matrix P' is required, * as defined in the transformation applied by ZGEBRD: * = 'Q': generate Q; * = 'P': generate P'. * * M (input) INTEGER * The number of rows of the matrix Q or P' to be returned. * M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q or P' to be returned. * N >= 0. * If VECT = 'Q', M >= N >= min(M,K); * if VECT = 'P', N >= M >= min(N,K). * * K (input) INTEGER * If VECT = 'Q', the number of columns in the original m-by-k * matrix reduced by ZGEBRD. * If VECT = 'P', the number of rows in the original k-by-n * matrix reduced by ZGEBRD. * K >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the vectors which define the elementary reflectors, * as returned by ZGEBRD. * On exit, the m-by-n matrix Q or P'. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= M. * * TAU (input) COMPLEX*16 array, dimension * (min(M,K)) if VECT = 'Q' * (min(N,K)) if VECT = 'P' * TAU(i) must contain the scalar factor of the elementary * reflector H(i) or G(i), which determines Q or P', as returned * by ZGEBRD in its array argument TAUQ or TAUP. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,min(M,N)). * For optimum performance LWORK should be at least min(M,N)*NB, * where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL WANTQ INTEGER I, IINFO, J * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZUNGLQ, ZUNGQR * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 WANTQ = LSAME( VECT, 'Q' ) IF( .NOT.WANTQ .AND. .NOT.LSAME( VECT, 'P' ) ) THEN INFO = -1 ELSE IF( M.LT.0 ) THEN INFO = -2 ELSE IF( N.LT.0 .OR. ( WANTQ .AND. ( N.GT.M .OR. N.LT.MIN( M, $ K ) ) ) .OR. ( .NOT.WANTQ .AND. ( M.GT.N .OR. M.LT. $ MIN( N, K ) ) ) ) THEN INFO = -3 ELSE IF( K.LT.0 ) THEN INFO = -4 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -6 ELSE IF( LWORK.LT.MAX( 1, MIN( M, N ) ) ) THEN INFO = -9 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNGBR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * IF( WANTQ ) THEN * * Form Q, determined by a call to ZGEBRD to reduce an m-by-k * matrix * IF( M.GE.K ) THEN * * If m >= k, assume m >= n >= k * CALL ZUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, IINFO ) * ELSE * * If m < k, assume m = n * * Shift the vectors which define the elementary reflectors one * column to the right, and set the first row and column of Q * to those of the unit matrix * DO 20 J = M, 2, -1 A( 1, J ) = ZERO DO 10 I = J + 1, M A( I, J ) = A( I, J-1 ) 10 CONTINUE 20 CONTINUE A( 1, 1 ) = ONE DO 30 I = 2, M A( I, 1 ) = ZERO 30 CONTINUE IF( M.GT.1 ) THEN * * Form Q(2:m,2:m) * CALL ZUNGQR( M-1, M-1, M-1, A( 2, 2 ), LDA, TAU, WORK, $ LWORK, IINFO ) END IF END IF ELSE * * Form P', determined by a call to ZGEBRD to reduce a k-by-n * matrix * IF( K.LT.N ) THEN * * If k < n, assume k <= m <= n * CALL ZUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, IINFO ) * ELSE * * If k >= n, assume m = n * * Shift the vectors which define the elementary reflectors one * row downward, and set the first row and column of P' to * those of the unit matrix * A( 1, 1 ) = ONE DO 40 I = 2, N A( I, 1 ) = ZERO 40 CONTINUE DO 60 J = 2, N DO 50 I = J - 1, 2, -1 A( I, J ) = A( I-1, J ) 50 CONTINUE A( 1, J ) = ZERO 60 CONTINUE IF( N.GT.1 ) THEN * * Form P'(2:n,2:n) * CALL ZUNGLQ( N-1, N-1, N-1, A( 2, 2 ), LDA, TAU, WORK, $ LWORK, IINFO ) END IF END IF END IF RETURN * * End of ZUNGBR * END octave-1.1.0/libcruft/lapack/zunghr.f100666 415 17 10133 5306544274 15717 0ustar jweusers SUBROUTINE ZUNGHR( N, ILO, IHI, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * October 31, 1992 * * .. Scalar Arguments .. INTEGER IHI, ILO, INFO, LDA, LWORK, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZUNGHR generates a complex unitary matrix Q which is defined as the * product of ihi-ilo elementary reflectors of order n, as returned by * ZGEHRD: * * Q = H(ilo) H(ilo+1) . . . H(ihi-1). * * Arguments * ========= * * N (input) INTEGER * The order of the matrix Q. N >= 0. * * ILO (input) INTEGER * IHI (input) INTEGER * ILO and IHI must have the same values as in the previous call * of ZGEHRD. Q is equal to the unit matrix except in the * submatrix Q(ilo+1:ihi,ilo+1:ihi). If N > 0, * 1 <= ILO <= IHI <= N; otherwise ILO = 1 and IHI = N. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the vectors which define the elementary reflectors, * as returned by ZGEHRD. * On exit, the n by n unitary matrix Q. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,N). * * TAU (input) COMPLEX*16 array, dimension (N-1) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGEHRD. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= IHI-ILO. * For optimum performance LWORK should be at least * (IHI-ILO)*NB, where NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO, ONE PARAMETER ( ZERO = 0.0D+0, ONE = 1.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IINFO, J, NH * .. * .. External Subroutines .. EXTERNAL XERBLA, ZUNGQR * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( N.LT.0 ) THEN INFO = -1 ELSE IF( ILO.LT.1 .OR. ILO.GT.MAX( 1, N ) ) THEN INFO = -2 ELSE IF( IHI.LT.MIN( ILO, N ) .OR. IHI.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, N ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, IHI-ILO ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNGHR', -INFO ) RETURN END IF * * Quick return if possible * IF( N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Shift the vectors which define the elementary reflectors one * column to the right, and set the first ilo and the last n-ihi * rows and columns to those of the unit matrix * DO 40 J = IHI, ILO + 1, -1 DO 10 I = 1, J - 1 A( I, J ) = ZERO 10 CONTINUE DO 20 I = J + 1, IHI A( I, J ) = A( I, J-1 ) 20 CONTINUE DO 30 I = IHI + 1, N A( I, J ) = ZERO 30 CONTINUE 40 CONTINUE DO 60 J = 1, ILO DO 50 I = 1, N A( I, J ) = ZERO 50 CONTINUE A( J, J ) = ONE 60 CONTINUE DO 80 J = IHI + 1, N DO 70 I = 1, N A( I, J ) = ZERO 70 CONTINUE A( J, J ) = ONE 80 CONTINUE * NH = IHI - ILO IF( NH.GT.0 ) THEN * * Generate Q(ilo+1:ihi,ilo+1:ihi) * CALL ZUNGQR( NH, NH, NH, A( ILO+1, ILO+1 ), LDA, TAU( ILO ), $ WORK, LWORK, IINFO ) END IF RETURN * * End of ZUNGHR * END octave-1.1.0/libcruft/lapack/zungl2.f100666 415 17 7217 5306544302 15604 0ustar jweusers SUBROUTINE ZUNGL2( M, N, K, A, LDA, TAU, WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZUNGL2 generates an m-by-n complex matrix Q with orthonormal rows, * which is defined as the first m rows of a product of k elementary * reflectors of order n * * Q = H(k)' . . . H(2)' H(1)' * * as returned by ZGELQF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. N >= M. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. M >= K >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the i-th row must contain the vector which defines * the elementary reflector H(i), for i = 1,2,...,k, as returned * by ZGELQF in the first k rows of its array argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGELQF. * * WORK (workspace) COMPLEX*16 array, dimension (M) * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE, ZERO PARAMETER ( ONE = 1.0D+0, ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, J, L * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLACGV, ZLARF, ZSCAL * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.M ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNGL2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.LE.0 ) $ RETURN * IF( K.LT.M ) THEN * * Initialise rows k+1:m to rows of the unit matrix * DO 20 J = 1, N DO 10 L = K + 1, M A( L, J ) = ZERO 10 CONTINUE IF( J.GT.K .AND. J.LE.M ) $ A( J, J ) = ONE 20 CONTINUE END IF * DO 40 I = K, 1, -1 * * Apply H(i)' to A(i:m,i:n) from the right * IF( I.LT.N ) THEN CALL ZLACGV( N-I, A( I, I+1 ), LDA ) IF( I.LT.M ) THEN A( I, I ) = ONE CALL ZLARF( 'Right', M-I, N-I+1, A( I, I ), LDA, $ DCONJG( TAU( I ) ), A( I+1, I ), LDA, WORK ) END IF CALL ZSCAL( N-I, -TAU( I ), A( I, I+1 ), LDA ) CALL ZLACGV( N-I, A( I, I+1 ), LDA ) END IF A( I, I ) = ONE - DCONJG( TAU( I ) ) * * Set A(1:i-1,i) to zero * DO 30 L = 1, I - 1 A( I, L ) = ZERO 30 CONTINUE 40 CONTINUE RETURN * * End of ZUNGL2 * END octave-1.1.0/libcruft/lapack/zunglq.f100666 415 17 13500 5306544302 15713 0ustar jweusers SUBROUTINE ZUNGLQ( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZUNGLQ generates an m by n complex matrix Q with orthonormal rows, * which is defined as the first m rows of a product of k elementary * reflectors of order n * * Q = H(k)' . . . H(2)' H(1)' * * as returned by ZGELQF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. N >= M. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. M >= K >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the i-th row must contain the vector which defines * the elementary reflector H(i), for i = 1,2,...,k, as returned * by ZGELQF in the first k rows of its array argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGELQF. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,M). * For optimum performance LWORK should be at least M*NB, where * NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit; * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, J, KI, KK, L, LDWORK, NB, $ NBMIN, NX * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNGL2 * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.M ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, M ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNGLQ', -INFO ) RETURN END IF * * Quick return if possible * IF( M.LE.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'ZUNGLQ', ' ', M, N, K, -1 ) NBMIN = 2 NX = 0 IWS = M IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'ZUNGLQ', ' ', M, N, K, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = M IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZUNGLQ', ' ', M, N, K, -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code after the last block. * The first kk rows are handled by the block method. * KI = ( ( K-NX-1 ) / NB )*NB KK = MIN( K, KI+NB ) * * Set A(kk+1:m,1:kk) to zero. * DO 20 J = 1, KK DO 10 I = KK + 1, M A( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE KK = 0 END IF * * Use unblocked code for the last or only block. * IF( KK.LT.M ) $ CALL ZUNGL2( M-KK, N-KK, K-KK, A( KK+1, KK+1 ), LDA, $ TAU( KK+1 ), WORK, IINFO ) * IF( KK.GT.0 ) THEN * * Use blocked code * DO 50 I = KI + 1, 1, -NB IB = MIN( NB, K-I+1 ) IF( I+IB.LE.M ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Rowwise', N-I+1, IB, A( I, I ), $ LDA, TAU( I ), WORK, LDWORK ) * * Apply H' to A(i+ib:m,i:n) from the right * CALL ZLARFB( 'Right', 'Conjugate transpose', 'Forward', $ 'Rowwise', M-I-IB+1, N-I+1, IB, A( I, I ), $ LDA, WORK, LDWORK, A( I+IB, I ), LDA, $ WORK( IB+1 ), LDWORK ) END IF * * Apply H' to columns i:n of current block * CALL ZUNGL2( IB, N-I+1, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * * Set columns 1:i-1 of current block to zero * DO 40 J = 1, I - 1 DO 30 L = I, I + IB - 1 A( L, J ) = ZERO 30 CONTINUE 40 CONTINUE 50 CONTINUE END IF * WORK( 1 ) = IWS RETURN * * End of ZUNGLQ * END octave-1.1.0/libcruft/lapack/zungqr.f100666 415 17 13535 5306544274 15741 0ustar jweusers SUBROUTINE ZUNGQR( M, N, K, A, LDA, TAU, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. INTEGER INFO, K, LDA, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), TAU( * ), WORK( LWORK ) * .. * * Purpose * ======= * * ZUNGQR generates an m-by-n complex matrix Q with orthonormal columns, * which is defined as the first n columns of a product of k elementary * reflectors of order m * * Q = H(1) H(2) . . . H(k) * * as returned by ZGEQRF. * * Arguments * ========= * * M (input) INTEGER * The number of rows of the matrix Q. M >= 0. * * N (input) INTEGER * The number of columns of the matrix Q. M >= N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines the * matrix Q. N >= K >= 0. * * A (input/output) COMPLEX*16 array, dimension (LDA,N) * On entry, the i-th column must contain the vector which * defines the elementary reflector H(i), for i = 1,2,...,k, as * returned by ZGEQRF in the first k columns of its array * argument A. * On exit, the m by n matrix Q. * * LDA (input) INTEGER * The first dimension of the array A. LDA >= max(1,M). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGEQRF. * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. LWORK >= max(1,N). * For optimum performance LWORK should be at least N*NB, where * NB is the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit; * < 0: if INFO = -i, the i-th argument has an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ZERO PARAMETER ( ZERO = 0.0D+0 ) * .. * .. Local Scalars .. INTEGER I, IB, IINFO, IWS, J, KI, KK, L, LDWORK, NB, $ NBMIN, NX * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNG2R * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. External Functions .. INTEGER ILAENV EXTERNAL ILAENV * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 IF( M.LT.0 ) THEN INFO = -1 ELSE IF( N.LT.0 .OR. N.GT.M ) THEN INFO = -2 ELSE IF( K.LT.0 .OR. K.GT.N ) THEN INFO = -3 ELSE IF( LDA.LT.MAX( 1, M ) ) THEN INFO = -5 ELSE IF( LWORK.LT.MAX( 1, N ) ) THEN INFO = -8 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNGQR', -INFO ) RETURN END IF * * Quick return if possible * IF( N.LE.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. * NB = ILAENV( 1, 'ZUNGQR', ' ', M, N, K, -1 ) NBMIN = 2 NX = 0 IWS = N IF( NB.GT.1 .AND. NB.LT.K ) THEN * * Determine when to cross over from blocked to unblocked code. * NX = MAX( 0, ILAENV( 3, 'ZUNGQR', ' ', M, N, K, -1 ) ) IF( NX.LT.K ) THEN * * Determine if workspace is large enough for blocked code. * LDWORK = N IWS = LDWORK*NB IF( LWORK.LT.IWS ) THEN * * Not enough workspace to use optimal NB: reduce NB and * determine the minimum value of NB. * NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZUNGQR', ' ', M, N, K, -1 ) ) END IF END IF END IF * IF( NB.GE.NBMIN .AND. NB.LT.K .AND. NX.LT.K ) THEN * * Use blocked code after the last block. * The first kk columns are handled by the block method. * KI = ( ( K-NX-1 ) / NB )*NB KK = MIN( K, KI+NB ) * * Set A(1:kk,kk+1:n) to zero. * DO 20 J = KK + 1, N DO 10 I = 1, KK A( I, J ) = ZERO 10 CONTINUE 20 CONTINUE ELSE KK = 0 END IF * * Use unblocked code for the last or only block. * IF( KK.LT.N ) $ CALL ZUNG2R( M-KK, N-KK, K-KK, A( KK+1, KK+1 ), LDA, $ TAU( KK+1 ), WORK, IINFO ) * IF( KK.GT.0 ) THEN * * Use blocked code * DO 50 I = KI + 1, 1, -NB IB = MIN( NB, K-I+1 ) IF( I+IB.LE.N ) THEN * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Columnwise', M-I+1, IB, $ A( I, I ), LDA, TAU( I ), WORK, LDWORK ) * * Apply H to A(i:m,i+ib:n) from the left * CALL ZLARFB( 'Left', 'No transpose', 'Forward', $ 'Columnwise', M-I+1, N-I-IB+1, IB, $ A( I, I ), LDA, WORK, LDWORK, A( I, I+IB ), $ LDA, WORK( IB+1 ), LDWORK ) END IF * * Apply H to rows i:m of current block * CALL ZUNG2R( M-I+1, IB, IB, A( I, I ), LDA, TAU( I ), WORK, $ IINFO ) * * Set rows 1:i-1 of current block to zero * DO 40 J = I, I + IB - 1 DO 30 L = 1, I - 1 A( L, J ) = ZERO 30 CONTINUE 40 CONTINUE 50 CONTINUE END IF * WORK( 1 ) = IWS RETURN * * End of ZUNGQR * END octave-1.1.0/libcruft/lapack/zunm2r.f100666 415 17 12455 5306544301 15637 0ustar jweusers SUBROUTINE ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZUNM2R overwrites the general complex m-by-n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'C', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'C', * * where Q is a complex unitary matrix defined as the product of k * elementary reflectors * * Q = H(1) H(2) . . . H(k) * * as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'C': apply Q' (Conjugate transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,K) * The i-th column must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * ZGEQRF in the first k columns of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. * If SIDE = 'L', LDA >= max(1,M); * if SIDE = 'R', LDA >= max(1,N). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGEQRF. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension * (N) if SIDE = 'L', * (M) if SIDE = 'R' * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ COMPLEX*16 AII, TAUI * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARF * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q * IF( LEFT ) THEN NQ = M ELSE NQ = N END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNM2R', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) $ RETURN * IF( ( LEFT .AND. .NOT.NOTRAN .OR. .NOT.LEFT .AND. NOTRAN ) ) THEN I1 = 1 I2 = K I3 = 1 ELSE I1 = K I2 = 1 I3 = -1 END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IF( LEFT ) THEN * * H(i) or H(i)' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H(i) or H(i)' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H(i) or H(i)' * IF( NOTRAN ) THEN TAUI = TAU( I ) ELSE TAUI = DCONJG( TAU( I ) ) END IF AII = A( I, I ) A( I, I ) = ONE CALL ZLARF( SIDE, MI, NI, A( I, I ), 1, TAUI, C( IC, JC ), LDC, $ WORK ) A( I, I ) = AII 10 CONTINUE RETURN * * End of ZUNM2R * END octave-1.1.0/libcruft/lapack/zunmbr.f100666 415 17 17205 5306544300 15714 0ustar jweusers SUBROUTINE ZUNMBR( VECT, SIDE, TRANS, M, N, K, A, LDA, TAU, C, $ LDC, WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS, VECT INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * If VECT = 'Q', ZUNMBR overwrites the general complex m-by-n matrix C * with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'C', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'C'. * * If VECT = 'P', ZUNMBR overwrites the general complex m-by-n matrix C * with * * P * C if SIDE = 'L' and TRANS = 'N', or * * P'* C if SIDE = 'L' and TRANS = 'C', or * * C * P if SIDE = 'R' and TRANS = 'N', or * * C * P' if SIDE = 'R' and TRANS = 'C'. * * Here Q and P' are the unitary matrices determined by ZGEBRD when * reducing a complex matrix A to bidiagonal form: A = Q * B * P'. Q and * P' are defined as products of elementary reflectors H(i) and G(i) * respectively. * * Let nq = m if SIDE = 'L' and nq = n if SIDE = 'R'. Thus nq is the * order of the unitary matrix Q or P' that is applied. * * If VECT = 'Q', A is assumed to have been an nq-by-k matrix: * if nq >= k, Q = H(1) H(2) . . . H(k); * if nq < k, Q = H(1) H(2) . . . H(nq-1). * * If VECT = 'P', A is assumed to have been a k-by-nq matrix: * if k < nq, P = G(1) G(2) . . . G(k); * if k >= nq, P = G(1) G(2) . . . G(nq-1). * * Arguments * ========= * * VECT (input) CHARACTER*1 * = 'Q': apply Q or Q' * = 'P': apply P or P' * * SIDE (input) CHARACTER*1 * = 'L': apply Q, Q', P or P' from the Left * = 'R': apply Q, Q', P or P' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q or P (No transpose) * = 'C': apply Q' or P' (Conjugate transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * If VECT = 'Q', the number of columns in the original * matrix reduced by ZGEBRD. * If VECT = 'P', the number of rows in the original * matrix reduced by ZGEBRD. * K >= 0. * * A (input) COMPLEX*16 array, dimension * (LDA,min(nq,K)) if VECT = 'Q' * (LDA,nq) if VECT = 'P' * The vectors which define the elementary reflectors H(i) and * G(i), whose products determine the matrices Q and P, as * returned by ZGEBRD. * * LDA (input) INTEGER * The leading dimension of the array A. * If VECT = 'Q', LDA >= max(1,nq); * if VECT = 'P', LDA >= max(1,min(nq,K)). * * TAU (input) COMPLEX*16 array, dimension (min(nq,K)) * TAU(i) must contain the scalar factor of the elementary * reflector H(i) or G(i) which determines Q or P, as returned * by ZGEBRD in the array argument TAUQ or TAUP. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q * or P*C or P'*C or C*P or C*P'. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Local Scalars .. LOGICAL APPLYQ, LEFT, NOTRAN CHARACTER TRANST INTEGER I1, I2, IINFO, MI, NI, NQ, NW * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZUNMLQ, ZUNMQR * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 APPLYQ = LSAME( VECT, 'Q' ) LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q or P and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.APPLYQ .AND. .NOT.LSAME( VECT, 'P' ) ) THEN INFO = -1 ELSE IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -2 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN INFO = -3 ELSE IF( M.LT.0 ) THEN INFO = -4 ELSE IF( N.LT.0 ) THEN INFO = -5 ELSE IF( K.LT.0 ) THEN INFO = -6 ELSE IF( ( APPLYQ .AND. LDA.LT.MAX( 1, NQ ) ) .OR. $ ( .NOT.APPLYQ .AND. LDA.LT.MAX( 1, MIN( NQ, K ) ) ) ) $ THEN INFO = -8 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -11 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -13 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNMBR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * IF( APPLYQ ) THEN * * Apply Q * IF( NQ.GE.K ) THEN * * Q was determined by a call to ZGEBRD with nq >= k * CALL ZUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, IINFO ) ELSE * * Q was determined by a call to ZGEBRD with nq < k * IF( LEFT ) THEN MI = M - 1 NI = N I1 = 2 I2 = 1 ELSE MI = M NI = N - 1 I1 = 1 I2 = 2 END IF CALL ZUNMQR( SIDE, TRANS, MI, NI, NQ-1, A( 2, 1 ), LDA, TAU, $ C( I1, I2 ), LDC, WORK, LWORK, IINFO ) END IF ELSE * * Apply P * IF( NOTRAN ) THEN TRANST = 'C' ELSE TRANST = 'N' END IF IF( NQ.GT.K ) THEN * * P was determined by a call to ZGEBRD with nq > k * CALL ZUNMLQ( SIDE, TRANST, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, IINFO ) ELSE * * P was determined by a call to ZGEBRD with nq <= k * IF( LEFT ) THEN MI = M - 1 NI = N I1 = 2 I2 = 1 ELSE MI = M NI = N - 1 I1 = 1 I2 = 2 END IF CALL ZUNMLQ( SIDE, TRANST, MI, NI, NQ-1, A( 1, 2 ), LDA, $ TAU, C( I1, I2 ), LDC, WORK, LWORK, IINFO ) END IF END IF RETURN * * End of ZUNMBR * END octave-1.1.0/libcruft/lapack/zunml2.f100666 415 17 12745 5306544300 15632 0ustar jweusers SUBROUTINE ZUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), WORK( * ) * .. * * Purpose * ======= * * ZUNML2 overwrites the general complex m-by-n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'C', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'C', * * where Q is a complex unitary matrix defined as the product of k * elementary reflectors * * Q = H(k)' . . . H(2)' H(1)' * * as returned by ZGELQF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'C': apply Q' (Conjugate transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) COMPLEX*16 array, dimension * (LDA,M) if SIDE = 'L', * (LDA,N) if SIDE = 'R' * The i-th row must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * ZGELQF in the first k rows of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,K). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGELQF. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension * (N) if SIDE = 'L', * (M) if SIDE = 'R' * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. COMPLEX*16 ONE PARAMETER ( ONE = 1.0D+0 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IC, JC, MI, NI, NQ COMPLEX*16 AII, TAUI * .. * .. External Functions .. LOGICAL LSAME EXTERNAL LSAME * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLACGV, ZLARF * .. * .. Intrinsic Functions .. INTRINSIC DCONJG, MAX * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q * IF( LEFT ) THEN NQ = M ELSE NQ = N END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, K ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNML2', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) $ RETURN * IF( ( LEFT .AND. NOTRAN .OR. .NOT.LEFT .AND. .NOT.NOTRAN ) ) THEN I1 = 1 I2 = K I3 = 1 ELSE I1 = K I2 = 1 I3 = -1 END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IF( LEFT ) THEN * * H(i) or H(i)' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H(i) or H(i)' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H(i) or H(i)' * IF( NOTRAN ) THEN TAUI = DCONJG( TAU( I ) ) ELSE TAUI = TAU( I ) END IF IF( I.LT.NQ ) $ CALL ZLACGV( NQ-I, A( I, I+1 ), LDA ) AII = A( I, I ) A( I, I ) = ONE CALL ZLARF( SIDE, MI, NI, A( I, I ), LDA, TAUI, C( IC, JC ), $ LDC, WORK ) A( I, I ) = AII IF( I.LT.NQ ) $ CALL ZLACGV( NQ-I, A( I, I+1 ), LDA ) 10 CONTINUE RETURN * * End of ZUNML2 * END octave-1.1.0/libcruft/lapack/zunmlq.f100666 415 17 16307 5306544300 15727 0ustar jweusers SUBROUTINE ZUNMLQ( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * ZUNMLQ overwrites the general complex m-by-n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'C', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'C', * * where Q is a complex unitary matrix defined as the product of k * elementary reflectors * * Q = H(k)' . . . H(2)' H(1)' * * as returned by ZGELQF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'C': apply Q' (Conjugate transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) COMPLEX*16 array, dimension * (LDA,M) if SIDE = 'L', * (LDA,N) if SIDE = 'R' * The i-th row must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * ZGELQF in the first k rows of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. LDA >= max(1,K). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGELQF. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN CHARACTER TRANST INTEGER I, I1, I2, I3, IB, IC, IINFO, IWS, JC, LDWORK, $ MI, NB, NBMIN, NI, NQ, NW * .. * .. Local Arrays .. COMPLEX*16 T( LDT, NBMAX ) * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNML2 * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, K ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -12 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNMLQ', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. NB may be at most NBMAX, where NBMAX * is used to define the local array T. * NB = MIN( NBMAX, ILAENV( 1, 'ZUNMLQ', SIDE // TRANS, M, N, K, $ -1 ) ) NBMIN = 2 LDWORK = NW IF( NB.GT.1 .AND. NB.LT.K ) THEN IWS = NW*NB IF( LWORK.LT.IWS ) THEN NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZUNMLQ', SIDE // TRANS, M, N, K, $ -1 ) ) END IF ELSE IWS = NW END IF * IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN * * Use unblocked code * CALL ZUNML2( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK, $ IINFO ) ELSE * * Use blocked code * IF( ( LEFT .AND. NOTRAN ) .OR. $ ( .NOT.LEFT .AND. .NOT.NOTRAN ) ) THEN I1 = 1 I2 = K I3 = NB ELSE I1 = ( ( K-1 ) / NB )*NB + 1 I2 = 1 I3 = -NB END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * IF( NOTRAN ) THEN TRANST = 'C' ELSE TRANST = 'N' END IF * DO 10 I = I1, I2, I3 IB = MIN( NB, K-I+1 ) * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Rowwise', NQ-I+1, IB, A( I, I ), $ LDA, TAU( I ), T, LDT ) IF( LEFT ) THEN * * H or H' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H or H' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H or H' * CALL ZLARFB( SIDE, TRANST, 'Forward', 'Rowwise', MI, NI, IB, $ A( I, I ), LDA, T, LDT, C( IC, JC ), LDC, WORK, $ LDWORK ) 10 CONTINUE END IF WORK( 1 ) = IWS RETURN * * End of ZUNMLQ * END octave-1.1.0/libcruft/lapack/zunmqr.f100666 415 17 16043 5306544300 15732 0ustar jweusers SUBROUTINE ZUNMQR( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, $ WORK, LWORK, INFO ) * * -- LAPACK routine (version 1.0b) -- * Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., * Courant Institute, Argonne National Lab, and Rice University * February 29, 1992 * * .. Scalar Arguments .. CHARACTER SIDE, TRANS INTEGER INFO, K, LDA, LDC, LWORK, M, N * .. * .. Array Arguments .. COMPLEX*16 A( LDA, * ), C( LDC, * ), TAU( * ), $ WORK( LWORK ) * .. * * Purpose * ======= * * ZUNMQR overwrites the general complex m-by-n matrix C with * * Q * C if SIDE = 'L' and TRANS = 'N', or * * Q'* C if SIDE = 'L' and TRANS = 'C', or * * C * Q if SIDE = 'R' and TRANS = 'N', or * * C * Q' if SIDE = 'R' and TRANS = 'C', * * where Q is a complex unitary matrix defined as the product of k * elementary reflectors * * Q = H(1) H(2) . . . H(k) * * as returned by ZGEQRF. Q is of order m if SIDE = 'L' and of order n * if SIDE = 'R'. * * Arguments * ========= * * SIDE (input) CHARACTER*1 * = 'L': apply Q or Q' from the Left * = 'R': apply Q or Q' from the Right * * TRANS (input) CHARACTER*1 * = 'N': apply Q (No transpose) * = 'C': apply Q' (Conjugate transpose) * * M (input) INTEGER * The number of rows of the matrix C. M >= 0. * * N (input) INTEGER * The number of columns of the matrix C. N >= 0. * * K (input) INTEGER * The number of elementary reflectors whose product defines * the matrix Q. * If SIDE = 'L', M >= K >= 0; * if SIDE = 'R', N >= K >= 0. * * A (input) COMPLEX*16 array, dimension (LDA,K) * The i-th column must contain the vector which defines the * elementary reflector H(i), for i = 1,2,...,k, as returned by * ZGEQRF in the first k columns of its array argument A. * A is modified by the routine but restored on exit. * * LDA (input) INTEGER * The leading dimension of the array A. * If SIDE = 'L', LDA >= max(1,M); * if SIDE = 'R', LDA >= max(1,N). * * TAU (input) COMPLEX*16 array, dimension (K) * TAU(i) must contain the scalar factor of the elementary * reflector H(i), as returned by ZGEQRF. * * C (input/output) COMPLEX*16 array, dimension (LDC,N) * On entry, the m-by-n matrix C. * On exit, C is overwritten by Q*C or Q'*C or C*Q' or C*Q. * * LDC (input) INTEGER * The leading dimension of the array C. LDC >= max(1,M). * * WORK (workspace) COMPLEX*16 array, dimension (LWORK) * On exit, if INFO = 0, WORK(1) returns the minimum value of * LWORK required to use the optimal blocksize. * * LWORK (input) INTEGER * The dimension of the array WORK. * If SIDE = 'L', LWORK >= max(1,N); * if SIDE = 'R', LWORK >= max(1,M). * For optimum performance LWORK should be at least N*NB * if SIDE = 'L' and at least M*NB if SIDE = 'R', where NB is * the optimal blocksize. * * INFO (output) INTEGER * = 0: successful exit * < 0: if INFO = -i, the i-th argument had an illegal value * * ===================================================================== * * .. Parameters .. INTEGER NBMAX, LDT PARAMETER ( NBMAX = 64, LDT = NBMAX+1 ) * .. * .. Local Scalars .. LOGICAL LEFT, NOTRAN INTEGER I, I1, I2, I3, IB, IC, IINFO, IWS, JC, LDWORK, $ MI, NB, NBMIN, NI, NQ, NW * .. * .. Local Arrays .. COMPLEX*16 T( LDT, NBMAX ) * .. * .. External Functions .. LOGICAL LSAME INTEGER ILAENV EXTERNAL LSAME, ILAENV * .. * .. External Subroutines .. EXTERNAL XERBLA, ZLARFB, ZLARFT, ZUNM2R * .. * .. Intrinsic Functions .. INTRINSIC MAX, MIN * .. * .. Executable Statements .. * * Test the input arguments * INFO = 0 LEFT = LSAME( SIDE, 'L' ) NOTRAN = LSAME( TRANS, 'N' ) * * NQ is the order of Q and NW is the minimum dimension of WORK * IF( LEFT ) THEN NQ = M NW = N ELSE NQ = N NW = M END IF IF( .NOT.LEFT .AND. .NOT.LSAME( SIDE, 'R' ) ) THEN INFO = -1 ELSE IF( .NOT.NOTRAN .AND. .NOT.LSAME( TRANS, 'C' ) ) THEN INFO = -2 ELSE IF( M.LT.0 ) THEN INFO = -3 ELSE IF( N.LT.0 ) THEN INFO = -4 ELSE IF( K.LT.0 .OR. K.GT.NQ ) THEN INFO = -5 ELSE IF( LDA.LT.MAX( 1, NQ ) ) THEN INFO = -7 ELSE IF( LDC.LT.MAX( 1, M ) ) THEN INFO = -10 ELSE IF( LWORK.LT.MAX( 1, NW ) ) THEN INFO = -12 END IF IF( INFO.NE.0 ) THEN CALL XERBLA( 'ZUNMQR', -INFO ) RETURN END IF * * Quick return if possible * IF( M.EQ.0 .OR. N.EQ.0 .OR. K.EQ.0 ) THEN WORK( 1 ) = 1 RETURN END IF * * Determine the block size. NB may be at most NBMAX, where NBMAX * is used to define the local array T. * NB = MIN( NBMAX, ILAENV( 1, 'ZUNMQR', SIDE // TRANS, M, N, K, $ -1 ) ) NBMIN = 2 LDWORK = NW IF( NB.GT.1 .AND. NB.LT.K ) THEN IWS = NW*NB IF( LWORK.LT.IWS ) THEN NB = LWORK / LDWORK NBMIN = MAX( 2, ILAENV( 2, 'ZUNMQR', SIDE // TRANS, M, N, K, $ -1 ) ) END IF ELSE IWS = NW END IF * IF( NB.LT.NBMIN .OR. NB.GE.K ) THEN * * Use unblocked code * CALL ZUNM2R( SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK, $ IINFO ) ELSE * * Use blocked code * IF( ( LEFT .AND. .NOT.NOTRAN ) .OR. $ ( .NOT.LEFT .AND. NOTRAN ) ) THEN I1 = 1 I2 = K I3 = NB ELSE I1 = ( ( K-1 ) / NB )*NB + 1 I2 = 1 I3 = -NB END IF * IF( LEFT ) THEN NI = N JC = 1 ELSE MI = M IC = 1 END IF * DO 10 I = I1, I2, I3 IB = MIN( NB, K-I+1 ) * * Form the triangular factor of the block reflector * H = H(i) H(i+1) . . . H(i+ib-1) * CALL ZLARFT( 'Forward', 'Columnwise', NQ-I+1, IB, A( I, I ), $ LDA, TAU( I ), T, LDT ) IF( LEFT ) THEN * * H or H' is applied to C(i:m,1:n) * MI = M - I + 1 IC = I ELSE * * H or H' is applied to C(1:m,i:n) * NI = N - I + 1 JC = I END IF * * Apply H or H' * CALL ZLARFB( SIDE, TRANS, 'Forward', 'Columnwise', MI, NI, $ IB, A( I, I ), LDA, T, LDT, C( IC, JC ), LDC, $ WORK, LDWORK ) 10 CONTINUE END IF WORK( 1 ) = IWS RETURN * * End of ZUNMQR * END octave-1.1.0/libcruft/linpack/ 40777 415 17 0 5705521650 14302 5ustar jweusersoctave-1.1.0/libcruft/linpack/Makefile.in100666 415 17 510 5662226307 16423 0ustar jweusers# # Makefile for octave's libcruft/linpack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/linpack/dgbfa.f100666 415 17 12142 5227007207 15625 0ustar jweusers SUBROUTINE DGBFA(ABD,LDA,N,ML,MU,IPVT,INFO) INTEGER LDA,N,ML,MU,IPVT(1),INFO DOUBLE PRECISION ABD(LDA,1) C C DGBFA FACTORS A DOUBLE PRECISION BAND MATRIX BY ELIMINATION. C C DGBFA IS USUALLY CALLED BY DGBCO, BUT IT CAN BE CALLED C DIRECTLY WITH A SAVING IN TIME IF RCOND IS NOT NEEDED. C C ON ENTRY C C ABD DOUBLE PRECISION(LDA, N) C CONTAINS THE MATRIX IN BAND STORAGE. THE COLUMNS C OF THE MATRIX ARE STORED IN THE COLUMNS OF ABD AND C THE DIAGONALS OF THE MATRIX ARE STORED IN ROWS C ML+1 THROUGH 2*ML+MU+1 OF ABD . C SEE THE COMMENTS BELOW FOR DETAILS. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY ABD . C LDA MUST BE .GE. 2*ML + MU + 1 . C C N INTEGER C THE ORDER OF THE ORIGINAL MATRIX. C C ML INTEGER C NUMBER OF DIAGONALS BELOW THE MAIN DIAGONAL. C 0 .LE. ML .LT. N . C C MU INTEGER C NUMBER OF DIAGONALS ABOVE THE MAIN DIAGONAL. C 0 .LE. MU .LT. N . C MORE EFFICIENT IF ML .LE. MU . C ON RETURN C C ABD AN UPPER TRIANGULAR MATRIX IN BAND STORAGE AND C THE MULTIPLIERS WHICH WERE USED TO OBTAIN IT. C THE FACTORIZATION CAN BE WRITTEN A = L*U WHERE C L IS A PRODUCT OF PERMUTATION AND UNIT LOWER C TRIANGULAR MATRICES AND U IS UPPER TRIANGULAR. C C IPVT INTEGER(N) C AN INTEGER VECTOR OF PIVOT INDICES. C C INFO INTEGER C = 0 NORMAL VALUE. C = K IF U(K,K) .EQ. 0.0 . THIS IS NOT AN ERROR C CONDITION FOR THIS SUBROUTINE, BUT IT DOES C INDICATE THAT DGBSL WILL DIVIDE BY ZERO IF C CALLED. USE RCOND IN DGBCO FOR A RELIABLE C INDICATION OF SINGULARITY. C C BAND STORAGE C C IF A IS A BAND MATRIX, THE FOLLOWING PROGRAM SEGMENT C WILL SET UP THE INPUT. C C ML = (BAND WIDTH BELOW THE DIAGONAL) C MU = (BAND WIDTH ABOVE THE DIAGONAL) C M = ML + MU + 1 C DO 20 J = 1, N C I1 = MAX0(1, J-MU) C I2 = MIN0(N, J+ML) C DO 10 I = I1, I2 C K = I - J + M C ABD(K,J) = A(I,J) C 10 CONTINUE C 20 CONTINUE C C THIS USES ROWS ML+1 THROUGH 2*ML+MU+1 OF ABD . C IN ADDITION, THE FIRST ML ROWS IN ABD ARE USED FOR C ELEMENTS GENERATED DURING THE TRIANGULARIZATION. C THE TOTAL NUMBER OF ROWS NEEDED IN ABD IS 2*ML+MU+1 . C THE ML+MU BY ML+MU UPPER LEFT TRIANGLE AND THE C ML BY ML LOWER RIGHT TRIANGLE ARE NOT REFERENCED. C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C BLAS DAXPY,DSCAL,IDAMAX C FORTRAN MAX0,MIN0 C C INTERNAL VARIABLES C DOUBLE PRECISION T INTEGER I,IDAMAX,I0,J,JU,JZ,J0,J1,K,KP1,L,LM,M,MM,NM1 C C M = ML + MU + 1 INFO = 0 C C ZERO INITIAL FILL-IN COLUMNS C J0 = MU + 2 J1 = MIN0(N,M) - 1 IF (J1 .LT. J0) GO TO 30 DO 20 JZ = J0, J1 I0 = M + 1 - JZ DO 10 I = I0, ML ABD(I,JZ) = 0.0D0 10 CONTINUE 20 CONTINUE 30 CONTINUE JZ = J1 JU = 0 C C GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING C NM1 = N - 1 IF (NM1 .LT. 1) GO TO 130 DO 120 K = 1, NM1 KP1 = K + 1 C C ZERO NEXT FILL-IN COLUMN C JZ = JZ + 1 IF (JZ .GT. N) GO TO 50 IF (ML .LT. 1) GO TO 50 DO 40 I = 1, ML ABD(I,JZ) = 0.0D0 40 CONTINUE 50 CONTINUE C C FIND L = PIVOT INDEX C LM = MIN0(ML,N-K) L = IDAMAX(LM+1,ABD(M,K),1) + M - 1 IPVT(K) = L + K - M C C ZERO PIVOT IMPLIES THIS COLUMN ALREADY TRIANGULARIZED C IF (ABD(L,K) .EQ. 0.0D0) GO TO 100 C C INTERCHANGE IF NECESSARY C IF (L .EQ. M) GO TO 60 T = ABD(L,K) ABD(L,K) = ABD(M,K) ABD(M,K) = T 60 CONTINUE C C COMPUTE MULTIPLIERS C T = -1.0D0/ABD(M,K) CALL DSCAL(LM,T,ABD(M+1,K),1) C C ROW ELIMINATION WITH COLUMN INDEXING C JU = MIN0(MAX0(JU,MU+IPVT(K)),N) MM = M IF (JU .LT. KP1) GO TO 90 DO 80 J = KP1, JU L = L - 1 MM = MM - 1 T = ABD(L,J) IF (L .EQ. MM) GO TO 70 ABD(L,J) = ABD(MM,J) ABD(MM,J) = T 70 CONTINUE CALL DAXPY(LM,T,ABD(M+1,K),1,ABD(MM+1,J),1) 80 CONTINUE 90 CONTINUE GO TO 110 100 CONTINUE INFO = K 110 CONTINUE 120 CONTINUE 130 CONTINUE IPVT(N) = N IF (ABD(M,N) .EQ. 0.0D0) INFO = N RETURN END octave-1.1.0/libcruft/linpack/dgbsl.f100666 415 17 7274 5227007213 15644 0ustar jweusers SUBROUTINE DGBSL(ABD,LDA,N,ML,MU,IPVT,B,JOB) INTEGER LDA,N,ML,MU,IPVT(1),JOB DOUBLE PRECISION ABD(LDA,1),B(1) C C DGBSL SOLVES THE DOUBLE PRECISION BAND SYSTEM C A * X = B OR TRANS(A) * X = B C USING THE FACTORS COMPUTED BY DGBCO OR DGBFA. C C ON ENTRY C C ABD DOUBLE PRECISION(LDA, N) C THE OUTPUT FROM DGBCO OR DGBFA. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY ABD . C C N INTEGER C THE ORDER OF THE ORIGINAL MATRIX. C C ML INTEGER C NUMBER OF DIAGONALS BELOW THE MAIN DIAGONAL. C C MU INTEGER C NUMBER OF DIAGONALS ABOVE THE MAIN DIAGONAL. C C IPVT INTEGER(N) C THE PIVOT VECTOR FROM DGBCO OR DGBFA. C C B DOUBLE PRECISION(N) C THE RIGHT HAND SIDE VECTOR. C C JOB INTEGER C = 0 TO SOLVE A*X = B , C = NONZERO TO SOLVE TRANS(A)*X = B , WHERE C TRANS(A) IS THE TRANSPOSE. C C ON RETURN C C B THE SOLUTION VECTOR X . C C ERROR CONDITION C C A DIVISION BY ZERO WILL OCCUR IF THE INPUT FACTOR CONTAINS A C ZERO ON THE DIAGONAL. TECHNICALLY THIS INDICATES SINGULARITY C BUT IT IS OFTEN CAUSED BY IMPROPER ARGUMENTS OR IMPROPER C SETTING OF LDA . IT WILL NOT OCCUR IF THE SUBROUTINES ARE C CALLED CORRECTLY AND IF DGBCO HAS SET RCOND .GT. 0.0 C OR DGBFA HAS SET INFO .EQ. 0 . C C TO COMPUTE INVERSE(A) * C WHERE C IS A MATRIX C WITH P COLUMNS C CALL DGBCO(ABD,LDA,N,ML,MU,IPVT,RCOND,Z) C IF (RCOND IS TOO SMALL) GO TO ... C DO 10 J = 1, P C CALL DGBSL(ABD,LDA,N,ML,MU,IPVT,C(1,J),0) C 10 CONTINUE C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C BLAS DAXPY,DDOT C FORTRAN MIN0 C C INTERNAL VARIABLES C DOUBLE PRECISION DDOT,T INTEGER K,KB,L,LA,LB,LM,M,NM1 C M = MU + ML + 1 NM1 = N - 1 IF (JOB .NE. 0) GO TO 50 C C JOB = 0 , SOLVE A * X = B C FIRST SOLVE L*Y = B C IF (ML .EQ. 0) GO TO 30 IF (NM1 .LT. 1) GO TO 30 DO 20 K = 1, NM1 LM = MIN0(ML,N-K) L = IPVT(K) T = B(L) IF (L .EQ. K) GO TO 10 B(L) = B(K) B(K) = T 10 CONTINUE CALL DAXPY(LM,T,ABD(M+1,K),1,B(K+1),1) 20 CONTINUE 30 CONTINUE C C NOW SOLVE U*X = Y C DO 40 KB = 1, N K = N + 1 - KB B(K) = B(K)/ABD(M,K) LM = MIN0(K,M) - 1 LA = M - LM LB = K - LM T = -B(K) CALL DAXPY(LM,T,ABD(LA,K),1,B(LB),1) 40 CONTINUE GO TO 100 50 CONTINUE C C JOB = NONZERO, SOLVE TRANS(A) * X = B C FIRST SOLVE TRANS(U)*Y = B C DO 60 K = 1, N LM = MIN0(K,M) - 1 LA = M - LM LB = K - LM T = DDOT(LM,ABD(LA,K),1,B(LB),1) B(K) = (B(K) - T)/ABD(M,K) 60 CONTINUE C C NOW SOLVE TRANS(L)*X = Y C IF (ML .EQ. 0) GO TO 90 IF (NM1 .LT. 1) GO TO 90 DO 80 KB = 1, NM1 K = N - KB LM = MIN0(ML,N-K) B(K) = B(K) + DDOT(LM,ABD(M+1,K),1,B(K+1),1) L = IPVT(K) IF (L .EQ. K) GO TO 70 T = B(L) B(L) = B(K) B(K) = T 70 CONTINUE 80 CONTINUE 90 CONTINUE 100 CONTINUE RETURN END octave-1.1.0/libcruft/linpack/dgeco.f100666 415 17 13166 5150436211 15646 0ustar jweusers SUBROUTINE DGECO(A,LDA,N,IPVT,RCOND,Z) INTEGER LDA,N,IPVT(1) DOUBLE PRECISION A(LDA,1),Z(1) DOUBLE PRECISION RCOND C C DGECO FACTORS A DOUBLE PRECISION MATRIX BY GAUSSIAN ELIMINATION C AND ESTIMATES THE CONDITION OF THE MATRIX. C C IF RCOND IS NOT NEEDED, DGEFA IS SLIGHTLY FASTER. C TO SOLVE A*X = B , FOLLOW DGECO BY DGESL. C TO COMPUTE INVERSE(A)*C , FOLLOW DGECO BY DGESL. C TO COMPUTE DETERMINANT(A) , FOLLOW DGECO BY DGEDI. C TO COMPUTE INVERSE(A) , FOLLOW DGECO BY DGEDI. C C ON ENTRY C C A DOUBLE PRECISION(LDA, N) C THE MATRIX TO BE FACTORED. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY A . C C N INTEGER C THE ORDER OF THE MATRIX A . C C ON RETURN C C A AN UPPER TRIANGULAR MATRIX AND THE MULTIPLIERS C WHICH WERE USED TO OBTAIN IT. C THE FACTORIZATION CAN BE WRITTEN A = L*U WHERE C L IS A PRODUCT OF PERMUTATION AND UNIT LOWER C TRIANGULAR MATRICES AND U IS UPPER TRIANGULAR. C C IPVT INTEGER(N) C AN INTEGER VECTOR OF PIVOT INDICES. C C RCOND DOUBLE PRECISION C AN ESTIMATE OF THE RECIPROCAL CONDITION OF A . C FOR THE SYSTEM A*X = B , RELATIVE PERTURBATIONS C IN A AND B OF SIZE EPSILON MAY CAUSE C RELATIVE PERTURBATIONS IN X OF SIZE EPSILON/RCOND . C IF RCOND IS SO SMALL THAT THE LOGICAL EXPRESSION C 1.0 + RCOND .EQ. 1.0 C IS TRUE, THEN A MAY BE SINGULAR TO WORKING C PRECISION. IN PARTICULAR, RCOND IS ZERO IF C EXACT SINGULARITY IS DETECTED OR THE ESTIMATE C UNDERFLOWS. C C Z DOUBLE PRECISION(N) C A WORK VECTOR WHOSE CONTENTS ARE USUALLY UNIMPORTANT. C IF A IS CLOSE TO A SINGULAR MATRIX, THEN Z IS C AN APPROXIMATE NULL VECTOR IN THE SENSE THAT C NORM(A*Z) = RCOND*NORM(A)*NORM(Z) . C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C LINPACK DGEFA C BLAS DAXPY,DDOT,DSCAL,DASUM C FORTRAN DABS,DMAX1,DSIGN C C INTERNAL VARIABLES C DOUBLE PRECISION DDOT,EK,T,WK,WKM DOUBLE PRECISION ANORM,S,DASUM,SM,YNORM INTEGER INFO,J,K,KB,KP1,L C C C COMPUTE 1-NORM OF A C ANORM = 0.0D0 DO 10 J = 1, N ANORM = DMAX1(ANORM,DASUM(N,A(1,J),1)) 10 CONTINUE C C FACTOR C CALL DGEFA(A,LDA,N,IPVT,INFO) C C RCOND = 1/(NORM(A)*(ESTIMATE OF NORM(INVERSE(A)))) . C ESTIMATE = NORM(Z)/NORM(Y) WHERE A*Z = Y AND TRANS(A)*Y = E . C TRANS(A) IS THE TRANSPOSE OF A . THE COMPONENTS OF E ARE C CHOSEN TO CAUSE MAXIMUM LOCAL GROWTH IN THE ELEMENTS OF W WHERE C TRANS(U)*W = E . THE VECTORS ARE FREQUENTLY RESCALED TO AVOID C OVERFLOW. C C SOLVE TRANS(U)*W = E C EK = 1.0D0 DO 20 J = 1, N Z(J) = 0.0D0 20 CONTINUE DO 100 K = 1, N IF (Z(K) .NE. 0.0D0) EK = DSIGN(EK,-Z(K)) IF (DABS(EK-Z(K)) .LE. DABS(A(K,K))) GO TO 30 S = DABS(A(K,K))/DABS(EK-Z(K)) CALL DSCAL(N,S,Z,1) EK = S*EK 30 CONTINUE WK = EK - Z(K) WKM = -EK - Z(K) S = DABS(WK) SM = DABS(WKM) IF (A(K,K) .EQ. 0.0D0) GO TO 40 WK = WK/A(K,K) WKM = WKM/A(K,K) GO TO 50 40 CONTINUE WK = 1.0D0 WKM = 1.0D0 50 CONTINUE KP1 = K + 1 IF (KP1 .GT. N) GO TO 90 DO 60 J = KP1, N SM = SM + DABS(Z(J)+WKM*A(K,J)) Z(J) = Z(J) + WK*A(K,J) S = S + DABS(Z(J)) 60 CONTINUE IF (S .GE. SM) GO TO 80 T = WKM - WK WK = WKM DO 70 J = KP1, N Z(J) = Z(J) + T*A(K,J) 70 CONTINUE 80 CONTINUE 90 CONTINUE Z(K) = WK 100 CONTINUE S = 1.0D0/DASUM(N,Z,1) CALL DSCAL(N,S,Z,1) C C SOLVE TRANS(L)*Y = W C DO 120 KB = 1, N K = N + 1 - KB IF (K .LT. N) Z(K) = Z(K) + DDOT(N-K,A(K+1,K),1,Z(K+1),1) IF (DABS(Z(K)) .LE. 1.0D0) GO TO 110 S = 1.0D0/DABS(Z(K)) CALL DSCAL(N,S,Z,1) 110 CONTINUE L = IPVT(K) T = Z(L) Z(L) = Z(K) Z(K) = T 120 CONTINUE S = 1.0D0/DASUM(N,Z,1) CALL DSCAL(N,S,Z,1) C YNORM = 1.0D0 C C SOLVE L*V = Y C DO 140 K = 1, N L = IPVT(K) T = Z(L) Z(L) = Z(K) Z(K) = T IF (K .LT. N) CALL DAXPY(N-K,T,A(K+1,K),1,Z(K+1),1) IF (DABS(Z(K)) .LE. 1.0D0) GO TO 130 S = 1.0D0/DABS(Z(K)) CALL DSCAL(N,S,Z,1) YNORM = S*YNORM 130 CONTINUE 140 CONTINUE S = 1.0D0/DASUM(N,Z,1) CALL DSCAL(N,S,Z,1) YNORM = S*YNORM C C SOLVE U*Z = V C DO 160 KB = 1, N K = N + 1 - KB IF (DABS(Z(K)) .LE. DABS(A(K,K))) GO TO 150 S = DABS(A(K,K))/DABS(Z(K)) CALL DSCAL(N,S,Z,1) YNORM = S*YNORM 150 CONTINUE IF (A(K,K) .NE. 0.0D0) Z(K) = Z(K)/A(K,K) IF (A(K,K) .EQ. 0.0D0) Z(K) = 1.0D0 T = -Z(K) CALL DAXPY(K-1,T,A(1,K),1,Z(1),1) 160 CONTINUE C MAKE ZNORM = 1.0 S = 1.0D0/DASUM(N,Z,1) CALL DSCAL(N,S,Z,1) YNORM = S*YNORM C IF (ANORM .NE. 0.0D0) RCOND = YNORM/ANORM IF (ANORM .EQ. 0.0D0) RCOND = 0.0D0 RETURN END octave-1.1.0/libcruft/linpack/dgedi.f100666 415 17 6771 5201737133 15631 0ustar jweusers SUBROUTINE DGEDI(A,LDA,N,IPVT,DET,WORK,JOB) INTEGER LDA,N,IPVT(1),JOB DOUBLE PRECISION A(LDA,1),DET(2),WORK(1) C C DGEDI COMPUTES THE DETERMINANT AND INVERSE OF A MATRIX C USING THE FACTORS COMPUTED BY DGECO OR DGEFA. C C ON ENTRY C C A DOUBLE PRECISION(LDA, N) C THE OUTPUT FROM DGECO OR DGEFA. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY A . C C N INTEGER C THE ORDER OF THE MATRIX A . C C IPVT INTEGER(N) C THE PIVOT VECTOR FROM DGECO OR DGEFA. C C WORK DOUBLE PRECISION(N) C WORK VECTOR. CONTENTS DESTROYED. C C JOB INTEGER C = 11 BOTH DETERMINANT AND INVERSE. C = 01 INVERSE ONLY. C = 10 DETERMINANT ONLY. C C ON RETURN C C A INVERSE OF ORIGINAL MATRIX IF REQUESTED. C OTHERWISE UNCHANGED. C C DET DOUBLE PRECISION(2) C DETERMINANT OF ORIGINAL MATRIX IF REQUESTED. C OTHERWISE NOT REFERENCED. C DETERMINANT = DET(1) * 10.0**DET(2) C WITH 1.0 .LE. DABS(DET(1)) .LT. 10.0 C OR DET(1) .EQ. 0.0 . C C ERROR CONDITION C C A DIVISION BY ZERO WILL OCCUR IF THE INPUT FACTOR CONTAINS C A ZERO ON THE DIAGONAL AND THE INVERSE IS REQUESTED. C IT WILL NOT OCCUR IF THE SUBROUTINES ARE CALLED CORRECTLY C AND IF DGECO HAS SET RCOND .GT. 0.0 OR DGEFA HAS SET C INFO .EQ. 0 . C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C BLAS DAXPY,DSCAL,DSWAP C FORTRAN DABS,MOD C C INTERNAL VARIABLES C DOUBLE PRECISION T DOUBLE PRECISION TEN INTEGER I,J,K,KB,KP1,L,NM1 C C C COMPUTE DETERMINANT C IF (JOB/10 .EQ. 0) GO TO 70 DET(1) = 1.0D0 DET(2) = 0.0D0 TEN = 10.0D0 DO 50 I = 1, N IF (IPVT(I) .NE. I) DET(1) = -DET(1) DET(1) = A(I,I)*DET(1) C ...EXIT IF (DET(1) .EQ. 0.0D0) GO TO 60 10 IF (DABS(DET(1)) .GE. 1.0D0) GO TO 20 DET(1) = TEN*DET(1) DET(2) = DET(2) - 1.0D0 GO TO 10 20 CONTINUE 30 IF (DABS(DET(1)) .LT. TEN) GO TO 40 DET(1) = DET(1)/TEN DET(2) = DET(2) + 1.0D0 GO TO 30 40 CONTINUE 50 CONTINUE 60 CONTINUE 70 CONTINUE C C COMPUTE INVERSE(U) C IF (MOD(JOB,10) .EQ. 0) GO TO 150 DO 100 K = 1, N A(K,K) = 1.0D0/A(K,K) T = -A(K,K) CALL DSCAL(K-1,T,A(1,K),1) KP1 = K + 1 IF (N .LT. KP1) GO TO 90 DO 80 J = KP1, N T = A(K,J) A(K,J) = 0.0D0 CALL DAXPY(K,T,A(1,K),1,A(1,J),1) 80 CONTINUE 90 CONTINUE 100 CONTINUE C C FORM INVERSE(U)*INVERSE(L) C NM1 = N - 1 IF (NM1 .LT. 1) GO TO 140 DO 130 KB = 1, NM1 K = N - KB KP1 = K + 1 DO 110 I = KP1, N WORK(I) = A(I,K) A(I,K) = 0.0D0 110 CONTINUE DO 120 J = KP1, N T = WORK(J) CALL DAXPY(N,T,A(1,J),1,A(1,K),1) 120 CONTINUE L = IPVT(K) IF (L .NE. K) CALL DSWAP(N,A(1,K),1,A(1,L),1) 130 CONTINUE 140 CONTINUE 150 CONTINUE RETURN END octave-1.1.0/libcruft/linpack/dgefa.f100666 415 17 5422 5302556110 15607 0ustar jweusers SUBROUTINE DGEFA(A,LDA,N,IPVT,INFO) INTEGER LDA,N,IPVT(1),INFO DOUBLE PRECISION A(LDA,1) C C DGEFA FACTORS A DOUBLE PRECISION MATRIX BY GAUSSIAN ELIMINATION. C C DGEFA IS USUALLY CALLED BY DGECO, BUT IT CAN BE CALLED C DIRECTLY WITH A SAVING IN TIME IF RCOND IS NOT NEEDED. C (TIME FOR DGECO) = (1 + 9/N)*(TIME FOR DGEFA) . C C ON ENTRY C C A DOUBLE PRECISION(LDA, N) C THE MATRIX TO BE FACTORED. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY A . C C N INTEGER C THE ORDER OF THE MATRIX A . C C ON RETURN C C A AN UPPER TRIANGULAR MATRIX AND THE MULTIPLIERS C WHICH WERE USED TO OBTAIN IT. C THE FACTORIZATION CAN BE WRITTEN A = L*U WHERE C L IS A PRODUCT OF PERMUTATION AND UNIT LOWER C TRIANGULAR MATRICES AND U IS UPPER TRIANGULAR. C C IPVT INTEGER(N) C AN INTEGER VECTOR OF PIVOT INDICES. C C INFO INTEGER C = 0 NORMAL VALUE. C = K IF U(K,K) .EQ. 0.0 . THIS IS NOT AN ERROR C CONDITION FOR THIS SUBROUTINE, BUT IT DOES C INDICATE THAT DGESL OR DGEDI WILL DIVIDE BY ZERO C IF CALLED. USE RCOND IN DGECO FOR A RELIABLE C INDICATION OF SINGULARITY. C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C BLAS DAXPY,DSCAL,IDAMAX C C INTERNAL VARIABLES C DOUBLE PRECISION T INTEGER IDAMAX,J,K,KP1,L,NM1 C C C GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING C INFO = 0 NM1 = N - 1 IF (NM1 .LT. 1) GO TO 70 DO 60 K = 1, NM1 KP1 = K + 1 C C FIND L = PIVOT INDEX C L = IDAMAX(N-K+1,A(K,K),1) + K - 1 IPVT(K) = L C C ZERO PIVOT IMPLIES THIS COLUMN ALREADY TRIANGULARIZED C IF (A(L,K) .EQ. 0.0D0) GO TO 40 C C INTERCHANGE IF NECESSARY C IF (L .EQ. K) GO TO 10 T = A(L,K) A(L,K) = A(K,K) A(K,K) = T 10 CONTINUE C C COMPUTE MULTIPLIERS C T = -1.0D0/A(K,K) CALL DSCAL(N-K,T,A(K+1,K),1) C C ROW ELIMINATION WITH COLUMN INDEXING C DO 30 J = KP1, N T = A(L,J) IF (L .EQ. K) GO TO 20 A(L,J) = A(K,J) A(K,J) = T 20 CONTINUE CALL DAXPY(N-K,T,A(K+1,K),1,A(K+1,J),1) 30 CONTINUE GO TO 50 40 CONTINUE INFO = K 50 CONTINUE 60 CONTINUE 70 CONTINUE IPVT(N) = N IF (A(N,N) .EQ. 0.0D0) INFO = N RETURN END octave-1.1.0/libcruft/linpack/dgesl.f100666 415 17 6103 5150600265 15636 0ustar jweusers SUBROUTINE DGESL(A,LDA,N,IPVT,B,JOB) INTEGER LDA,N,IPVT(1),JOB DOUBLE PRECISION A(LDA,1),B(1) C C DGESL SOLVES THE DOUBLE PRECISION SYSTEM C A * X = B OR TRANS(A) * X = B C USING THE FACTORS COMPUTED BY DGECO OR DGEFA. C C ON ENTRY C C A DOUBLE PRECISION(LDA, N) C THE OUTPUT FROM DGECO OR DGEFA. C C LDA INTEGER C THE LEADING DIMENSION OF THE ARRAY A . C C N INTEGER C THE ORDER OF THE MATRIX A . C C IPVT INTEGER(N) C THE PIVOT VECTOR FROM DGECO OR DGEFA. C C B DOUBLE PRECISION(N) C THE RIGHT HAND SIDE VECTOR. C C JOB INTEGER C = 0 TO SOLVE A*X = B , C = NONZERO TO SOLVE TRANS(A)*X = B WHERE C TRANS(A) IS THE TRANSPOSE. C C ON RETURN C C B THE SOLUTION VECTOR X . C C ERROR CONDITION C C A DIVISION BY ZERO WILL OCCUR IF THE INPUT FACTOR CONTAINS A C ZERO ON THE DIAGONAL. TECHNICALLY THIS INDICATES SINGULARITY C BUT IT IS OFTEN CAUSED BY IMPROPER ARGUMENTS OR IMPROPER C SETTING OF LDA . IT WILL NOT OCCUR IF THE SUBROUTINES ARE C CALLED CORRECTLY AND IF DGECO HAS SET RCOND .GT. 0.0 C OR DGEFA HAS SET INFO .EQ. 0 . C C TO COMPUTE INVERSE(A) * C WHERE C IS A MATRIX C WITH P COLUMNS C CALL DGECO(A,LDA,N,IPVT,RCOND,Z) C IF (RCOND IS TOO SMALL) GO TO ... C DO 10 J = 1, P C CALL DGESL(A,LDA,N,IPVT,C(1,J),0) C 10 CONTINUE C C LINPACK. THIS VERSION DATED 08/14/78 . C CLEVE MOLER, UNIVERSITY OF NEW MEXICO, ARGONNE NATIONAL LAB. C C SUBROUTINES AND FUNCTIONS C C BLAS DAXPY,DDOT C C INTERNAL VARIABLES C DOUBLE PRECISION DDOT,T INTEGER K,KB,L,NM1 C NM1 = N - 1 IF (JOB .NE. 0) GO TO 50 C C JOB = 0 , SOLVE A * X = B C FIRST SOLVE L*Y = B C IF (NM1 .LT. 1) GO TO 30 DO 20 K = 1, NM1 L = IPVT(K) T = B(L) IF (L .EQ. K) GO TO 10 B(L) = B(K) B(K) = T 10 CONTINUE CALL DAXPY(N-K,T,A(K+1,K),1,B(K+1),1) 20 CONTINUE 30 CONTINUE C C NOW SOLVE U*X = Y C DO 40 KB = 1, N K = N + 1 - KB B(K) = B(K)/A(K,K) T = -B(K) CALL DAXPY(K-1,T,A(1,K),1,B(1),1) 40 CONTINUE GO TO 100 50 CONTINUE C C JOB = NONZERO, SOLVE TRANS(A) * X = B C FIRST SOLVE TRANS(U)*Y = B C DO 60 K = 1, N T = DDOT(K-1,A(1,K),1,B(1),1) B(K) = (B(K) - T)/A(K,K) 60 CONTINUE C C NOW SOLVE TRANS(L)*X = Y C IF (NM1 .LT. 1) GO TO 90 DO 80 KB = 1, NM1 K = N - KB B(K) = B(K) + DDOT(N-K,A(K+1,K),1,B(K+1),1) L = IPVT(K) IF (L .EQ. K) GO TO 70 T = B(L) B(L) = B(K) B(K) = T 70 CONTINUE 80 CONTINUE 90 CONTINUE 100 CONTINUE RETURN END octave-1.1.0/libcruft/linpack/zgeco.f100666 415 17 14117 5302535206 15674 0ustar jweusers subroutine zgeco(a,lda,n,ipvt,rcond,z) integer lda,n,ipvt(1) complex*16 a(lda,1),z(1) double precision rcond c c zgeco factors a complex*16 matrix by gaussian elimination c and estimates the condition of the matrix. c c if rcond is not needed, zgefa is slightly faster. c to solve a*x = b , follow zgeco by zgesl. c to compute inverse(a)*c , follow zgeco by zgesl. c to compute determinant(a) , follow zgeco by zgedi. c to compute inverse(a) , follow zgeco by zgedi. c c on entry c c a complex*16(lda, n) c the matrix to be factored. c c lda integer c the leading dimension of the array a . c c n integer c the order of the matrix a . c c on return c c a an upper triangular matrix and the multipliers c which were used to obtain it. c the factorization can be written a = l*u where c l is a product of permutation and unit lower c triangular matrices and u is upper triangular. c c ipvt integer(n) c an integer vector of pivot indices. c c rcond double precision c an estimate of the reciprocal condition of a . c for the system a*x = b , relative perturbations c in a and b of size epsilon may cause c relative perturbations in x of size epsilon/rcond . c if rcond is so small that the logical expression c 1.0 + rcond .eq. 1.0 c is true, then a may be singular to working c precision. in particular, rcond is zero if c exact singularity is detected or the estimate c underflows. c c z complex*16(n) c a work vector whose contents are usually unimportant. c if a is close to a singular matrix, then z is c an approximate null vector in the sense that c norm(a*z) = rcond*norm(a)*norm(z) . c c linpack. this version dated 08/14/78 . c cleve moler, university of new mexico, argonne national lab. c c subroutines and functions c c linpack zgefa c blas zaxpy,zdotc,zdscal,dzasum c fortran dabs,dmax1,dcmplx,dconjg c c internal variables c complex*16 zdotc,ek,t,wk,wkm double precision anorm,s,dzasum,sm,ynorm integer info,j,k,kb,kp1,l c complex*16 zdum,zdum1,zdum2,csign1 double precision cabs1 double precision dreal,dimag complex*16 zdumr,zdumi dreal(zdumr) = zdumr dimag(zdumi) = (0.0d0,-1.0d0)*zdumi cabs1(zdum) = dabs(dreal(zdum)) + dabs(dimag(zdum)) csign1(zdum1,zdum2) = cabs1(zdum1)*(zdum2/cabs1(zdum2)) c c compute 1-norm of a c anorm = 0.0d0 do 10 j = 1, n anorm = dmax1(anorm,dzasum(n,a(1,j),1)) 10 continue c c factor c call zgefa(a,lda,n,ipvt,info) c c rcond = 1/(norm(a)*(estimate of norm(inverse(a)))) . c estimate = norm(z)/norm(y) where a*z = y and ctrans(a)*y = e . c ctrans(a) is the conjugate transpose of a . c the components of e are chosen to cause maximum local c growth in the elements of w where ctrans(u)*w = e . c the vectors are frequently rescaled to avoid overflow. c c solve ctrans(u)*w = e c ek = (1.0d0,0.0d0) do 20 j = 1, n z(j) = (0.0d0,0.0d0) 20 continue do 100 k = 1, n if (cabs1(z(k)) .ne. 0.0d0) ek = csign1(ek,-z(k)) if (cabs1(ek-z(k)) .le. cabs1(a(k,k))) go to 30 s = cabs1(a(k,k))/cabs1(ek-z(k)) call zdscal(n,s,z,1) ek = dcmplx(s,0.0d0)*ek 30 continue wk = ek - z(k) wkm = -ek - z(k) s = cabs1(wk) sm = cabs1(wkm) if (cabs1(a(k,k)) .eq. 0.0d0) go to 40 wk = wk/dconjg(a(k,k)) wkm = wkm/dconjg(a(k,k)) go to 50 40 continue wk = (1.0d0,0.0d0) wkm = (1.0d0,0.0d0) 50 continue kp1 = k + 1 if (kp1 .gt. n) go to 90 do 60 j = kp1, n sm = sm + cabs1(z(j)+wkm*dconjg(a(k,j))) z(j) = z(j) + wk*dconjg(a(k,j)) s = s + cabs1(z(j)) 60 continue if (s .ge. sm) go to 80 t = wkm - wk wk = wkm do 70 j = kp1, n z(j) = z(j) + t*dconjg(a(k,j)) 70 continue 80 continue 90 continue z(k) = wk 100 continue s = 1.0d0/dzasum(n,z,1) call zdscal(n,s,z,1) c c solve ctrans(l)*y = w c do 120 kb = 1, n k = n + 1 - kb if (k .lt. n) z(k) = z(k) + zdotc(n-k,a(k+1,k),1,z(k+1),1) if (cabs1(z(k)) .le. 1.0d0) go to 110 s = 1.0d0/cabs1(z(k)) call zdscal(n,s,z,1) 110 continue l = ipvt(k) t = z(l) z(l) = z(k) z(k) = t 120 continue s = 1.0d0/dzasum(n,z,1) call zdscal(n,s,z,1) c ynorm = 1.0d0 c c solve l*v = y c do 140 k = 1, n l = ipvt(k) t = z(l) z(l) = z(k) z(k) = t if (k .lt. n) call zaxpy(n-k,t,a(k+1,k),1,z(k+1),1) if (cabs1(z(k)) .le. 1.0d0) go to 130 s = 1.0d0/cabs1(z(k)) call zdscal(n,s,z,1) ynorm = s*ynorm 130 continue 140 continue s = 1.0d0/dzasum(n,z,1) call zdscal(n,s,z,1) ynorm = s*ynorm c c solve u*z = v c do 160 kb = 1, n k = n + 1 - kb if (cabs1(z(k)) .le. cabs1(a(k,k))) go to 150 s = cabs1(a(k,k))/cabs1(z(k)) call zdscal(n,s,z,1) ynorm = s*ynorm 150 continue if (cabs1(a(k,k)) .ne. 0.0d0) z(k) = z(k)/a(k,k) if (cabs1(a(k,k)) .eq. 0.0d0) z(k) = (1.0d0,0.0d0) t = -z(k) call zaxpy(k-1,t,a(1,k),1,z(1),1) 160 continue c make znorm = 1.0 s = 1.0d0/dzasum(n,z,1) call zdscal(n,s,z,1) ynorm = s*ynorm c if (anorm .ne. 0.0d0) rcond = ynorm/anorm if (anorm .eq. 0.0d0) rcond = 0.0d0 return end octave-1.1.0/libcruft/linpack/zgedi.f100666 415 17 7462 5302535206 15654 0ustar jweusers subroutine zgedi(a,lda,n,ipvt,det,work,job) integer lda,n,ipvt(1),job complex*16 a(lda,1),det(2),work(1) c c zgedi computes the determinant and inverse of a matrix c using the factors computed by zgeco or zgefa. c c on entry c c a complex*16(lda, n) c the output from zgeco or zgefa. c c lda integer c the leading dimension of the array a . c c n integer c the order of the matrix a . c c ipvt integer(n) c the pivot vector from zgeco or zgefa. c c work complex*16(n) c work vector. contents destroyed. c c job integer c = 11 both determinant and inverse. c = 01 inverse only. c = 10 determinant only. c c on return c c a inverse of original matrix if requested. c otherwise unchanged. c c det complex*16(2) c determinant of original matrix if requested. c otherwise not referenced. c determinant = det(1) * 10.0**det(2) c with 1.0 .le. cabs1(det(1)) .lt. 10.0 c or det(1) .eq. 0.0 . c c error condition c c a division by zero will occur if the input factor contains c a zero on the diagonal and the inverse is requested. c it will not occur if the subroutines are called correctly c and if zgeco has set rcond .gt. 0.0 or zgefa has set c info .eq. 0 . c c linpack. this version dated 08/14/78 . c cleve moler, university of new mexico, argonne national lab. c c subroutines and functions c c blas zaxpy,zscal,zswap c fortran dabs,dcmplx,mod c c internal variables c complex*16 t double precision ten integer i,j,k,kb,kp1,l,nm1 c complex*16 zdum double precision cabs1 double precision dreal,dimag complex*16 zdumr,zdumi dreal(zdumr) = zdumr dimag(zdumi) = (0.0d0,-1.0d0)*zdumi cabs1(zdum) = dabs(dreal(zdum)) + dabs(dimag(zdum)) c c compute determinant c if (job/10 .eq. 0) go to 70 det(1) = (1.0d0,0.0d0) det(2) = (0.0d0,0.0d0) ten = 10.0d0 do 50 i = 1, n if (ipvt(i) .ne. i) det(1) = -det(1) det(1) = a(i,i)*det(1) c ...exit if (cabs1(det(1)) .eq. 0.0d0) go to 60 10 if (cabs1(det(1)) .ge. 1.0d0) go to 20 det(1) = dcmplx(ten,0.0d0)*det(1) det(2) = det(2) - (1.0d0,0.0d0) go to 10 20 continue 30 if (cabs1(det(1)) .lt. ten) go to 40 det(1) = det(1)/dcmplx(ten,0.0d0) det(2) = det(2) + (1.0d0,0.0d0) go to 30 40 continue 50 continue 60 continue 70 continue c c compute inverse(u) c if (mod(job,10) .eq. 0) go to 150 do 100 k = 1, n a(k,k) = (1.0d0,0.0d0)/a(k,k) t = -a(k,k) call zscal(k-1,t,a(1,k),1) kp1 = k + 1 if (n .lt. kp1) go to 90 do 80 j = kp1, n t = a(k,j) a(k,j) = (0.0d0,0.0d0) call zaxpy(k,t,a(1,k),1,a(1,j),1) 80 continue 90 continue 100 continue c c form inverse(u)*inverse(l) c nm1 = n - 1 if (nm1 .lt. 1) go to 140 do 130 kb = 1, nm1 k = n - kb kp1 = k + 1 do 110 i = kp1, n work(i) = a(i,k) a(i,k) = (0.0d0,0.0d0) 110 continue do 120 j = kp1, n t = work(j) call zaxpy(n,t,a(1,j),1,a(1,k),1) 120 continue l = ipvt(k) if (l .ne. k) call zswap(n,a(1,k),1,a(1,l),1) 130 continue 140 continue 150 continue return end octave-1.1.0/libcruft/linpack/zgefa.f100666 415 17 6025 5302556120 15636 0ustar jweusers subroutine zgefa(a,lda,n,ipvt,info) integer lda,n,ipvt(1),info complex*16 a(lda,1) c c zgefa factors a complex*16 matrix by gaussian elimination. c c zgefa is usually called by zgeco, but it can be called c directly with a saving in time if rcond is not needed. c (time for zgeco) = (1 + 9/n)*(time for zgefa) . c c on entry c c a complex*16(lda, n) c the matrix to be factored. c c lda integer c the leading dimension of the array a . c c n integer c the order of the matrix a . c c on return c c a an upper triangular matrix and the multipliers c which were used to obtain it. c the factorization can be written a = l*u where c l is a product of permutation and unit lower c triangular matrices and u is upper triangular. c c ipvt integer(n) c an integer vector of pivot indices. c c info integer c = 0 normal value. c = k if u(k,k) .eq. 0.0 . this is not an error c condition for this subroutine, but it does c indicate that zgesl or zgedi will divide by zero c if called. use rcond in zgeco for a reliable c indication of singularity. c c linpack. this version dated 08/14/78 . c cleve moler, university of new mexico, argonne national lab. c c subroutines and functions c c blas zaxpy,zscal,izamax c fortran dabs c c internal variables c complex*16 t integer izamax,j,k,kp1,l,nm1 c complex*16 zdum double precision cabs1 double precision dreal,dimag complex*16 zdumr,zdumi dreal(zdumr) = zdumr dimag(zdumi) = (0.0d0,-1.0d0)*zdumi cabs1(zdum) = dabs(dreal(zdum)) + dabs(dimag(zdum)) c c gaussian elimination with partial pivoting c info = 0 nm1 = n - 1 if (nm1 .lt. 1) go to 70 do 60 k = 1, nm1 kp1 = k + 1 c c find l = pivot index c l = izamax(n-k+1,a(k,k),1) + k - 1 ipvt(k) = l c c zero pivot implies this column already triangularized c if (cabs1(a(l,k)) .eq. 0.0d0) go to 40 c c interchange if necessary c if (l .eq. k) go to 10 t = a(l,k) a(l,k) = a(k,k) a(k,k) = t 10 continue c c compute multipliers c t = -(1.0d0,0.0d0)/a(k,k) call zscal(n-k,t,a(k+1,k),1) c c row elimination with column indexing c do 30 j = kp1, n t = a(l,j) if (l .eq. k) go to 20 a(l,j) = a(k,j) a(k,j) = t 20 continue call zaxpy(n-k,t,a(k+1,k),1,a(k+1,j),1) 30 continue go to 50 40 continue info = k 50 continue 60 continue 70 continue ipvt(n) = n if (cabs1(a(n,n)) .eq. 0.0d0) info = n return end octave-1.1.0/libcruft/linpack/zgesl.f100666 415 17 6333 5655260651 15704 0ustar jweusers subroutine zgesl(a,lda,n,ipvt,b,job) integer lda,n,ipvt(1),job complex*16 a(lda,1),b(1) c c zgesl solves the complex*16 system c a * x = b or ctrans(a) * x = b c using the factors computed by zgeco or zgefa. c c on entry c c a complex*16(lda, n) c the output from zgeco or zgefa. c c lda integer c the leading dimension of the array a . c c n integer c the order of the matrix a . c c ipvt integer(n) c the pivot vector from zgeco or zgefa. c c b complex*16(n) c the right hand side vector. c c job integer c = 0 to solve a*x = b , c = nonzero to solve ctrans(a)*x = b where c ctrans(a) is the conjugate transpose. c c on return c c b the solution vector x . c c error condition c c a division by zero will occur if the input factor contains a c zero on the diagonal. technically this indicates singularity c but it is often caused by improper arguments or improper c setting of lda . it will not occur if the subroutines are c called correctly and if zgeco has set rcond .gt. 0.0 c or zgefa has set info .eq. 0 . c c to compute inverse(a) * c where c is a matrix c with p columns c call zgeco(a,lda,n,ipvt,rcond,z) c if (rcond is too small) go to ... c do 10 j = 1, p c call zgesl(a,lda,n,ipvt,c(1,j),0) c 10 continue c c linpack. this version dated 08/14/78 . c cleve moler, university of new mexico, argonne national lab. c c subroutines and functions c c blas zaxpy,zdotc c fortran dconjg c c internal variables c complex*16 zdotc,t integer k,kb,l,nm1 c double precision dreal,dimag c complex*16 zdumr,zdumi c dreal(zdumr) = zdumr c dimag(zdumi) = (0.0d0,-1.0d0)*zdumi c nm1 = n - 1 if (job .ne. 0) go to 50 c c job = 0 , solve a * x = b c first solve l*y = b c if (nm1 .lt. 1) go to 30 do 20 k = 1, nm1 l = ipvt(k) t = b(l) if (l .eq. k) go to 10 b(l) = b(k) b(k) = t 10 continue call zaxpy(n-k,t,a(k+1,k),1,b(k+1),1) 20 continue 30 continue c c now solve u*x = y c do 40 kb = 1, n k = n + 1 - kb b(k) = b(k)/a(k,k) t = -b(k) call zaxpy(k-1,t,a(1,k),1,b(1),1) 40 continue go to 100 50 continue c c job = nonzero, solve ctrans(a) * x = b c first solve ctrans(u)*y = b c do 60 k = 1, n t = zdotc(k-1,a(1,k),1,b(1),1) b(k) = (b(k) - t)/dconjg(a(k,k)) 60 continue c c now solve ctrans(l)*x = y c if (nm1 .lt. 1) go to 90 do 80 kb = 1, nm1 k = n - kb b(k) = b(k) + zdotc(n-k,a(k+1,k),1,b(k+1),1) l = ipvt(k) if (l .eq. k) go to 70 t = b(l) b(l) = b(k) b(k) = t 70 continue 80 continue 90 continue 100 continue return end octave-1.1.0/libcruft/minpack/ 40777 415 17 0 5705521653 14306 5ustar jweusersoctave-1.1.0/libcruft/minpack/Makefile.in100666 415 17 510 5662226313 16421 0ustar jweusers# # Makefile for octave's libcruft/minpack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/minpack/dogleg.f100666 415 17 12210 5274161720 16023 0ustar jweusers SUBROUTINE DOGLEG(N,R,LR,DIAG,QTB,DELTA,X,WA1,WA2) INTEGER N,LR DOUBLE PRECISION DELTA DOUBLE PRECISION R(LR),DIAG(N),QTB(N),X(N),WA1(N),WA2(N) C ********** C C SUBROUTINE DOGLEG C C GIVEN AN M BY N MATRIX A, AN N BY N NONSINGULAR DIAGONAL C MATRIX D, AN M-VECTOR B, AND A POSITIVE NUMBER DELTA, THE C PROBLEM IS TO DETERMINE THE CONVEX COMBINATION X OF THE C GAUSS-NEWTON AND SCALED GRADIENT DIRECTIONS THAT MINIMIZES C (A*X - B) IN THE LEAST SQUARES SENSE, SUBJECT TO THE C RESTRICTION THAT THE EUCLIDEAN NORM OF D*X BE AT MOST DELTA. C C THIS SUBROUTINE COMPLETES THE SOLUTION OF THE PROBLEM C IF IT IS PROVIDED WITH THE NECESSARY INFORMATION FROM THE C QR FACTORIZATION OF A. THAT IS, IF A = Q*R, WHERE Q HAS C ORTHOGONAL COLUMNS AND R IS AN UPPER TRIANGULAR MATRIX, C THEN DOGLEG EXPECTS THE FULL UPPER TRIANGLE OF R AND C THE FIRST N COMPONENTS OF (Q TRANSPOSE)*B. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE DOGLEG(N,R,LR,DIAG,QTB,DELTA,X,WA1,WA2) C C WHERE C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE ORDER OF R. C C R IS AN INPUT ARRAY OF LENGTH LR WHICH MUST CONTAIN THE UPPER C TRIANGULAR MATRIX R STORED BY ROWS. C C LR IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(N+1))/2. C C DIAG IS AN INPUT ARRAY OF LENGTH N WHICH MUST CONTAIN THE C DIAGONAL ELEMENTS OF THE MATRIX D. C C QTB IS AN INPUT ARRAY OF LENGTH N WHICH MUST CONTAIN THE FIRST C N ELEMENTS OF THE VECTOR (Q TRANSPOSE)*B. C C DELTA IS A POSITIVE INPUT VARIABLE WHICH SPECIFIES AN UPPER C BOUND ON THE EUCLIDEAN NORM OF D*X. C C X IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS THE DESIRED C CONVEX COMBINATION OF THE GAUSS-NEWTON DIRECTION AND THE C SCALED GRADIENT DIRECTION. C C WA1 AND WA2 ARE WORK ARRAYS OF LENGTH N. C C SUBPROGRAMS CALLED C C MINPACK-SUPPLIED ... DPMPAR,ENORM C C FORTRAN-SUPPLIED ... DABS,DMAX1,DMIN1,DSQRT C C MINPACK. VERSION OF JULY 1978. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,J,JJ,JP1,K,L DOUBLE PRECISION ALPHA,BNORM,EPSMCH,GNORM,ONE,QNORM,SGNORM,SUM, * TEMP,ZERO DOUBLE PRECISION DPMPAR,ENORM DATA ONE,ZERO /1.0D0,0.0D0/ C C EPSMCH IS THE MACHINE PRECISION. C EPSMCH = DPMPAR(1) C C FIRST, CALCULATE THE GAUSS-NEWTON DIRECTION. C JJ = (N*(N + 1))/2 + 1 DO 50 K = 1, N J = N - K + 1 JP1 = J + 1 JJ = JJ - K L = JJ + 1 SUM = ZERO IF (N .LT. JP1) GO TO 20 DO 10 I = JP1, N SUM = SUM + R(L)*X(I) L = L + 1 10 CONTINUE 20 CONTINUE TEMP = R(JJ) IF (TEMP .NE. ZERO) GO TO 40 L = J DO 30 I = 1, J TEMP = DMAX1(TEMP,DABS(R(L))) L = L + N - I 30 CONTINUE TEMP = EPSMCH*TEMP IF (TEMP .EQ. ZERO) TEMP = EPSMCH 40 CONTINUE X(J) = (QTB(J) - SUM)/TEMP 50 CONTINUE C C TEST WHETHER THE GAUSS-NEWTON DIRECTION IS ACCEPTABLE. C DO 60 J = 1, N WA1(J) = ZERO WA2(J) = DIAG(J)*X(J) 60 CONTINUE QNORM = ENORM(N,WA2) IF (QNORM .LE. DELTA) GO TO 140 C C THE GAUSS-NEWTON DIRECTION IS NOT ACCEPTABLE. C NEXT, CALCULATE THE SCALED GRADIENT DIRECTION. C L = 1 DO 80 J = 1, N TEMP = QTB(J) DO 70 I = J, N WA1(I) = WA1(I) + R(L)*TEMP L = L + 1 70 CONTINUE WA1(J) = WA1(J)/DIAG(J) 80 CONTINUE C C CALCULATE THE NORM OF THE SCALED GRADIENT DIRECTION, C NORMALIZE, AND RESCALE THE GRADIENT. C GNORM = ENORM(N,WA1) SGNORM = ZERO ALPHA = DELTA/QNORM IF (GNORM .EQ. ZERO) GO TO 120 DO 90 J = 1, N WA1(J) = (WA1(J)/GNORM)/DIAG(J) 90 CONTINUE C C CALCULATE THE POINT ALONG THE SCALED GRADIENT C AT WHICH THE QUADRATIC IS MINIMIZED. C L = 1 DO 110 J = 1, N SUM = ZERO DO 100 I = J, N SUM = SUM + R(L)*WA1(I) L = L + 1 100 CONTINUE WA2(J) = SUM 110 CONTINUE TEMP = ENORM(N,WA2) SGNORM = (GNORM/TEMP)/TEMP C C TEST WHETHER THE SCALED GRADIENT DIRECTION IS ACCEPTABLE. C ALPHA = ZERO IF (SGNORM .GE. DELTA) GO TO 120 C C THE SCALED GRADIENT DIRECTION IS NOT ACCEPTABLE. C FINALLY, CALCULATE THE POINT ALONG THE DOGLEG C AT WHICH THE QUADRATIC IS MINIMIZED. C BNORM = ENORM(N,QTB) TEMP = (BNORM/GNORM)*(BNORM/QNORM)*(SGNORM/DELTA) TEMP = TEMP - (DELTA/QNORM)*(SGNORM/DELTA)**2 * + DSQRT((TEMP-(DELTA/QNORM))**2 * +(ONE-(DELTA/QNORM)**2)*(ONE-(SGNORM/DELTA)**2)) ALPHA = ((DELTA/QNORM)*(ONE - (SGNORM/DELTA)**2))/TEMP 120 CONTINUE C C FORM APPROPRIATE CONVEX COMBINATION OF THE GAUSS-NEWTON C DIRECTION AND THE SCALED GRADIENT DIRECTION. C TEMP = (ONE - ALPHA)*DMIN1(SGNORM,DELTA) DO 130 J = 1, N X(J) = TEMP*WA1(J) + ALPHA*X(J) 130 CONTINUE 140 CONTINUE RETURN C C LAST CARD OF SUBROUTINE DOGLEG. C END octave-1.1.0/libcruft/minpack/dpmpar.f100666 415 17 2771 5274161721 16041 0ustar jweusers DOUBLE PRECISION FUNCTION DPMPAR(I) INTEGER I C ********** C C FUNCTION DPMPAR C C THIS FUNCTION PROVIDES DOUBLE PRECISION MACHINE PARAMETERS C WHEN THE APPROPRIATE SET OF DATA STATEMENTS IS ACTIVATED (BY C REMOVING THE C FROM COLUMN 1) AND ALL OTHER DATA STATEMENTS ARE C RENDERED INACTIVE. MOST OF THE PARAMETER VALUES WERE OBTAINED C FROM THE CORRESPONDING BELL LABORATORIES PORT LIBRARY FUNCTION. C C THE FUNCTION STATEMENT IS C C DOUBLE PRECISION FUNCTION DPMPAR(I) C C WHERE C C I IS AN INTEGER INPUT VARIABLE SET TO 1, 2, OR 3 WHICH C SELECTS THE DESIRED MACHINE PARAMETER. IF THE MACHINE HAS C T BASE B DIGITS AND ITS SMALLEST AND LARGEST EXPONENTS ARE C EMIN AND EMAX, RESPECTIVELY, THEN THESE PARAMETERS ARE C C DPMPAR(1) = B**(1 - T), THE MACHINE PRECISION, C C DPMPAR(2) = B**(EMIN - 1), THE SMALLEST MAGNITUDE, C C DPMPAR(3) = B**EMAX*(1 - B**(-T)), THE LARGEST MAGNITUDE. C C ARGONNE NATIONAL LABORATORY. MINPACK PROJECT. JUNE 1983. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C Modified Mon Aug 28 14:46:17 CDT 1989 by John W. Eaton C (chpf127@emx.utexas.edu) to use D1MACH C C ********** C DOUBLE PRECISION D1MACH C IF ( I .EQ. 1 ) THEN DPMPAR = D1MACH(4) ELSEIF ( I . EQ. 2 ) THEN DPMPAR = D1MACH(1) ELSEIF ( I .EQ. 3 ) THEN DPMPAR = D1MACH(2) ENDIF C RETURN C C LAST CARD OF FUNCTION DPMPAR. C END octave-1.1.0/libcruft/minpack/enorm.f100666 415 17 6047 5274161721 15676 0ustar jweusers DOUBLE PRECISION FUNCTION ENORM(N,X) INTEGER N DOUBLE PRECISION X(N) C ********** C C FUNCTION ENORM C C GIVEN AN N-VECTOR X, THIS FUNCTION CALCULATES THE C EUCLIDEAN NORM OF X. C C THE EUCLIDEAN NORM IS COMPUTED BY ACCUMULATING THE SUM OF C SQUARES IN THREE DIFFERENT SUMS. THE SUMS OF SQUARES FOR THE C SMALL AND LARGE COMPONENTS ARE SCALED SO THAT NO OVERFLOWS C OCCUR. NON-DESTRUCTIVE UNDERFLOWS ARE PERMITTED. UNDERFLOWS C AND OVERFLOWS DO NOT OCCUR IN THE COMPUTATION OF THE UNSCALED C SUM OF SQUARES FOR THE INTERMEDIATE COMPONENTS. C THE DEFINITIONS OF SMALL, INTERMEDIATE AND LARGE COMPONENTS C DEPEND ON TWO CONSTANTS, RDWARF AND RGIANT. THE MAIN C RESTRICTIONS ON THESE CONSTANTS ARE THAT RDWARF**2 NOT C UNDERFLOW AND RGIANT**2 NOT OVERFLOW. THE CONSTANTS C GIVEN HERE ARE SUITABLE FOR EVERY KNOWN COMPUTER. C C THE FUNCTION STATEMENT IS C C DOUBLE PRECISION FUNCTION ENORM(N,X) C C WHERE C C N IS A POSITIVE INTEGER INPUT VARIABLE. C C X IS AN INPUT ARRAY OF LENGTH N. C C SUBPROGRAMS CALLED C C FORTRAN-SUPPLIED ... DABS,DSQRT C C MINPACK. VERSION OF OCTOBER 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I DOUBLE PRECISION AGIANT,FLOATN,ONE,RDWARF,RGIANT,S1,S2,S3,XABS, * X1MAX,X3MAX,ZERO DATA ONE,ZERO,RDWARF,RGIANT /1.0D0,0.0D0,3.834D-20,1.304D19/ S1 = ZERO S2 = ZERO S3 = ZERO X1MAX = ZERO X3MAX = ZERO FLOATN = N AGIANT = RGIANT/FLOATN DO 90 I = 1, N XABS = DABS(X(I)) IF (XABS .GT. RDWARF .AND. XABS .LT. AGIANT) GO TO 70 IF (XABS .LE. RDWARF) GO TO 30 C C SUM FOR LARGE COMPONENTS. C IF (XABS .LE. X1MAX) GO TO 10 S1 = ONE + S1*(X1MAX/XABS)**2 X1MAX = XABS GO TO 20 10 CONTINUE S1 = S1 + (XABS/X1MAX)**2 20 CONTINUE GO TO 60 30 CONTINUE C C SUM FOR SMALL COMPONENTS. C IF (XABS .LE. X3MAX) GO TO 40 S3 = ONE + S3*(X3MAX/XABS)**2 X3MAX = XABS GO TO 50 40 CONTINUE IF (XABS .NE. ZERO) S3 = S3 + (XABS/X3MAX)**2 50 CONTINUE 60 CONTINUE GO TO 80 70 CONTINUE C C SUM FOR INTERMEDIATE COMPONENTS. C S2 = S2 + XABS**2 80 CONTINUE 90 CONTINUE C C CALCULATION OF NORM. C IF (S1 .EQ. ZERO) GO TO 100 ENORM = X1MAX*DSQRT(S1+(S2/X1MAX)/X1MAX) GO TO 130 100 CONTINUE IF (S2 .EQ. ZERO) GO TO 110 IF (S2 .GE. X3MAX) * ENORM = DSQRT(S2*(ONE+(X3MAX/S2)*(X3MAX*S3))) IF (S2 .LT. X3MAX) * ENORM = DSQRT(X3MAX*((S2/X3MAX)+(X3MAX*S3))) GO TO 120 110 CONTINUE ENORM = X3MAX*DSQRT(S3) 120 CONTINUE 130 CONTINUE RETURN C C LAST CARD OF FUNCTION ENORM. C END octave-1.1.0/libcruft/minpack/fdjac1.f100666 415 17 11515 5274161721 15722 0ustar jweusers SUBROUTINE FDJAC1(FCN,N,X,FVEC,FJAC,LDFJAC,IFLAG,ML,MU,EPSFCN, * WA1,WA2) INTEGER N,LDFJAC,IFLAG,ML,MU DOUBLE PRECISION EPSFCN DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N),WA1(N),WA2(N) EXTERNAL FCN C ********** C C SUBROUTINE FDJAC1 C C THIS SUBROUTINE COMPUTES A FORWARD-DIFFERENCE APPROXIMATION C TO THE N BY N JACOBIAN MATRIX ASSOCIATED WITH A SPECIFIED C PROBLEM OF N FUNCTIONS IN N VARIABLES. IF THE JACOBIAN HAS C A BANDED FORM, THEN FUNCTION EVALUATIONS ARE SAVED BY ONLY C APPROXIMATING THE NONZERO TERMS. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE FDJAC1(FCN,N,X,FVEC,FJAC,LDFJAC,IFLAG,ML,MU,EPSFCN, C WA1,WA2) C C WHERE C C FCN IS THE NAME OF THE USER-SUPPLIED SUBROUTINE WHICH C CALCULATES THE FUNCTIONS. FCN MUST BE DECLARED C IN AN EXTERNAL STATEMENT IN THE USER CALLING C PROGRAM, AND SHOULD BE WRITTEN AS FOLLOWS. C C SUBROUTINE FCN(N,X,FVEC,IFLAG) C INTEGER N,IFLAG C DOUBLE PRECISION X(N),FVEC(N) C ---------- C CALCULATE THE FUNCTIONS AT X AND C RETURN THIS VECTOR IN FVEC. C ---------- C RETURN C END C C THE VALUE OF IFLAG SHOULD NOT BE CHANGED BY FCN UNLESS C THE USER WANTS TO TERMINATE EXECUTION OF FDJAC1. C IN THIS CASE SET IFLAG TO A NEGATIVE INTEGER. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF FUNCTIONS AND VARIABLES. C C X IS AN INPUT ARRAY OF LENGTH N. C C FVEC IS AN INPUT ARRAY OF LENGTH N WHICH MUST CONTAIN THE C FUNCTIONS EVALUATED AT X. C C FJAC IS AN OUTPUT N BY N ARRAY WHICH CONTAINS THE C APPROXIMATION TO THE JACOBIAN MATRIX EVALUATED AT X. C C LDFJAC IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN N C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY FJAC. C C IFLAG IS AN INTEGER VARIABLE WHICH CAN BE USED TO TERMINATE C THE EXECUTION OF FDJAC1. SEE DESCRIPTION OF FCN. C C ML IS A NONNEGATIVE INTEGER INPUT VARIABLE WHICH SPECIFIES C THE NUMBER OF SUBDIAGONALS WITHIN THE BAND OF THE C JACOBIAN MATRIX. IF THE JACOBIAN IS NOT BANDED, SET C ML TO AT LEAST N - 1. C C EPSFCN IS AN INPUT VARIABLE USED IN DETERMINING A SUITABLE C STEP LENGTH FOR THE FORWARD-DIFFERENCE APPROXIMATION. THIS C APPROXIMATION ASSUMES THAT THE RELATIVE ERRORS IN THE C FUNCTIONS ARE OF THE ORDER OF EPSFCN. IF EPSFCN IS LESS C THAN THE MACHINE PRECISION, IT IS ASSUMED THAT THE RELATIVE C ERRORS IN THE FUNCTIONS ARE OF THE ORDER OF THE MACHINE C PRECISION. C C MU IS A NONNEGATIVE INTEGER INPUT VARIABLE WHICH SPECIFIES C THE NUMBER OF SUPERDIAGONALS WITHIN THE BAND OF THE C JACOBIAN MATRIX. IF THE JACOBIAN IS NOT BANDED, SET C MU TO AT LEAST N - 1. C C WA1 AND WA2 ARE WORK ARRAYS OF LENGTH N. IF ML + MU + 1 IS AT C LEAST N, THEN THE JACOBIAN IS CONSIDERED DENSE, AND WA2 IS C NOT REFERENCED. C C SUBPROGRAMS CALLED C C MINPACK-SUPPLIED ... DPMPAR C C FORTRAN-SUPPLIED ... DABS,DMAX1,DSQRT C C MINPACK. VERSION OF JUNE 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,J,K,MSUM DOUBLE PRECISION EPS,EPSMCH,H,TEMP,ZERO DOUBLE PRECISION DPMPAR DATA ZERO /0.0D0/ C C EPSMCH IS THE MACHINE PRECISION. C EPSMCH = DPMPAR(1) C EPS = DSQRT(DMAX1(EPSFCN,EPSMCH)) MSUM = ML + MU + 1 IF (MSUM .LT. N) GO TO 40 C C COMPUTATION OF DENSE APPROXIMATE JACOBIAN. C DO 20 J = 1, N TEMP = X(J) H = EPS*DABS(TEMP) IF (H .EQ. ZERO) H = EPS X(J) = TEMP + H CALL FCN(N,X,WA1,IFLAG) IF (IFLAG .LT. 0) GO TO 30 X(J) = TEMP DO 10 I = 1, N FJAC(I,J) = (WA1(I) - FVEC(I))/H 10 CONTINUE 20 CONTINUE 30 CONTINUE GO TO 110 40 CONTINUE C C COMPUTATION OF BANDED APPROXIMATE JACOBIAN. C DO 90 K = 1, MSUM DO 60 J = K, N, MSUM WA2(J) = X(J) H = EPS*DABS(WA2(J)) IF (H .EQ. ZERO) H = EPS X(J) = WA2(J) + H 60 CONTINUE CALL FCN(N,X,WA1,IFLAG) IF (IFLAG .LT. 0) GO TO 100 DO 80 J = K, N, MSUM X(J) = WA2(J) H = EPS*DABS(WA2(J)) IF (H .EQ. ZERO) H = EPS DO 70 I = 1, N FJAC(I,J) = ZERO IF (I .GE. J - MU .AND. I .LE. J + ML) * FJAC(I,J) = (WA1(I) - FVEC(I))/H 70 CONTINUE 80 CONTINUE 90 CONTINUE 100 CONTINUE 110 CONTINUE RETURN C C LAST CARD OF SUBROUTINE FDJAC1. C END octave-1.1.0/libcruft/minpack/hybrd.f100666 415 17 35040 5274161721 15701 0ustar jweusers SUBROUTINE HYBRD(FCN,N,X,FVEC,XTOL,MAXFEV,ML,MU,EPSFCN,DIAG, * MODE,FACTOR,NPRINT,INFO,NFEV,FJAC,LDFJAC,R,LR, * QTF,WA1,WA2,WA3,WA4) INTEGER N,MAXFEV,ML,MU,MODE,NPRINT,INFO,NFEV,LDFJAC,LR DOUBLE PRECISION XTOL,EPSFCN,FACTOR DOUBLE PRECISION X(N),FVEC(N),DIAG(N),FJAC(LDFJAC,N),R(LR), * QTF(N),WA1(N),WA2(N),WA3(N),WA4(N) EXTERNAL FCN C ********** C C SUBROUTINE HYBRD C C THE PURPOSE OF HYBRD IS TO FIND A ZERO OF A SYSTEM OF C N NONLINEAR FUNCTIONS IN N VARIABLES BY A MODIFICATION C OF THE POWELL HYBRID METHOD. THE USER MUST PROVIDE A C SUBROUTINE WHICH CALCULATES THE FUNCTIONS. THE JACOBIAN IS C THEN CALCULATED BY A FORWARD-DIFFERENCE APPROXIMATION. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE HYBRD(FCN,N,X,FVEC,XTOL,MAXFEV,ML,MU,EPSFCN, C DIAG,MODE,FACTOR,NPRINT,INFO,NFEV,FJAC, C LDFJAC,R,LR,QTF,WA1,WA2,WA3,WA4) C C WHERE C C FCN IS THE NAME OF THE USER-SUPPLIED SUBROUTINE WHICH C CALCULATES THE FUNCTIONS. FCN MUST BE DECLARED C IN AN EXTERNAL STATEMENT IN THE USER CALLING C PROGRAM, AND SHOULD BE WRITTEN AS FOLLOWS. C C SUBROUTINE FCN(N,X,FVEC,IFLAG) C INTEGER N,IFLAG C DOUBLE PRECISION X(N),FVEC(N) C ---------- C CALCULATE THE FUNCTIONS AT X AND C RETURN THIS VECTOR IN FVEC. C --------- C RETURN C END C C THE VALUE OF IFLAG SHOULD NOT BE CHANGED BY FCN UNLESS C THE USER WANTS TO TERMINATE EXECUTION OF HYBRD. C IN THIS CASE SET IFLAG TO A NEGATIVE INTEGER. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF FUNCTIONS AND VARIABLES. C C X IS AN ARRAY OF LENGTH N. ON INPUT X MUST CONTAIN C AN INITIAL ESTIMATE OF THE SOLUTION VECTOR. ON OUTPUT X C CONTAINS THE FINAL ESTIMATE OF THE SOLUTION VECTOR. C C FVEC IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE FUNCTIONS EVALUATED AT THE OUTPUT X. C C XTOL IS A NONNEGATIVE INPUT VARIABLE. TERMINATION C OCCURS WHEN THE RELATIVE ERROR BETWEEN TWO CONSECUTIVE C ITERATES IS AT MOST XTOL. C C MAXFEV IS A POSITIVE INTEGER INPUT VARIABLE. TERMINATION C OCCURS WHEN THE NUMBER OF CALLS TO FCN IS AT LEAST MAXFEV C BY THE END OF AN ITERATION. C C ML IS A NONNEGATIVE INTEGER INPUT VARIABLE WHICH SPECIFIES C THE NUMBER OF SUBDIAGONALS WITHIN THE BAND OF THE C JACOBIAN MATRIX. IF THE JACOBIAN IS NOT BANDED, SET C ML TO AT LEAST N - 1. C C MU IS A NONNEGATIVE INTEGER INPUT VARIABLE WHICH SPECIFIES C THE NUMBER OF SUPERDIAGONALS WITHIN THE BAND OF THE C JACOBIAN MATRIX. IF THE JACOBIAN IS NOT BANDED, SET C MU TO AT LEAST N - 1. C C EPSFCN IS AN INPUT VARIABLE USED IN DETERMINING A SUITABLE C STEP LENGTH FOR THE FORWARD-DIFFERENCE APPROXIMATION. THIS C APPROXIMATION ASSUMES THAT THE RELATIVE ERRORS IN THE C FUNCTIONS ARE OF THE ORDER OF EPSFCN. IF EPSFCN IS LESS C THAN THE MACHINE PRECISION, IT IS ASSUMED THAT THE RELATIVE C ERRORS IN THE FUNCTIONS ARE OF THE ORDER OF THE MACHINE C PRECISION. C C DIAG IS AN ARRAY OF LENGTH N. IF MODE = 1 (SEE C BELOW), DIAG IS INTERNALLY SET. IF MODE = 2, DIAG C MUST CONTAIN POSITIVE ENTRIES THAT SERVE AS IMPLICIT C (MULTIPLICATIVE) SCALE FACTORS FOR THE VARIABLES. C C MODE IS AN INTEGER INPUT VARIABLE. IF MODE = 1, THE C VARIABLES WILL BE SCALED INTERNALLY. IF MODE = 2, C THE SCALING IS SPECIFIED BY THE INPUT DIAG. OTHER C VALUES OF MODE ARE EQUIVALENT TO MODE = 1. C C FACTOR IS A POSITIVE INPUT VARIABLE USED IN DETERMINING THE C INITIAL STEP BOUND. THIS BOUND IS SET TO THE PRODUCT OF C FACTOR AND THE EUCLIDEAN NORM OF DIAG*X IF NONZERO, OR ELSE C TO FACTOR ITSELF. IN MOST CASES FACTOR SHOULD LIE IN THE C INTERVAL (.1,100.). 100. IS A GENERALLY RECOMMENDED VALUE. C C NPRINT IS AN INTEGER INPUT VARIABLE THAT ENABLES CONTROLLED C PRINTING OF ITERATES IF IT IS POSITIVE. IN THIS CASE, C FCN IS CALLED WITH IFLAG = 0 AT THE BEGINNING OF THE FIRST C ITERATION AND EVERY NPRINT ITERATIONS THEREAFTER AND C IMMEDIATELY PRIOR TO RETURN, WITH X AND FVEC AVAILABLE C FOR PRINTING. IF NPRINT IS NOT POSITIVE, NO SPECIAL CALLS C OF FCN WITH IFLAG = 0 ARE MADE. C C INFO IS AN INTEGER OUTPUT VARIABLE. IF THE USER HAS C TERMINATED EXECUTION, INFO IS SET TO THE (NEGATIVE) C VALUE OF IFLAG. SEE DESCRIPTION OF FCN. OTHERWISE, C INFO IS SET AS FOLLOWS. C C INFO = 0 IMPROPER INPUT PARAMETERS. C C INFO = 1 RELATIVE ERROR BETWEEN TWO CONSECUTIVE ITERATES C IS AT MOST TOL. C C INFO = 2 NUMBER OF CALLS TO FCN HAS REACHED OR EXCEEDED C MAXFEV. C C INFO = 3 XTOL IS TOO SMALL. NO FURTHER IMPROVEMENT IN C THE APPROXIMATE SOLUTION X IS POSSIBLE. C C INFO = 4 ITERATION IS NOT MAKING GOOD PROGRESS, AS C MEASURED BY THE IMPROVEMENT FROM THE LAST C FIVE JACOBIAN EVALUATIONS. C C INFO = 5 ITERATION IS NOT MAKING GOOD PROGRESS, AS C MEASURED BY THE IMPROVEMENT FROM THE LAST C TEN ITERATIONS. C C NFEV IS AN INTEGER OUTPUT VARIABLE SET TO THE NUMBER OF C CALLS TO FCN. C C FJAC IS AN OUTPUT N BY N ARRAY WHICH CONTAINS THE C ORTHOGONAL MATRIX Q PRODUCED BY THE QR FACTORIZATION C OF THE FINAL APPROXIMATE JACOBIAN. C C LDFJAC IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN N C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY FJAC. C C R IS AN OUTPUT ARRAY OF LENGTH LR WHICH CONTAINS THE C UPPER TRIANGULAR MATRIX PRODUCED BY THE QR FACTORIZATION C OF THE FINAL APPROXIMATE JACOBIAN, STORED ROWWISE. C C LR IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(N+1))/2. C C QTF IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE VECTOR (Q TRANSPOSE)*FVEC. C C WA1, WA2, WA3, AND WA4 ARE WORK ARRAYS OF LENGTH N. C C SUBPROGRAMS CALLED C C USER-SUPPLIED ...... FCN C C MINPACK-SUPPLIED ... DOGLEG,DPMPAR,ENORM,FDJAC1, C QFORM,QRFAC,R1MPYQ,R1UPDT C C FORTRAN-SUPPLIED ... DABS,DMAX1,DMIN1,MIN0,MOD C C MINPACK. VERSION OF SEPTEMBER 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,IFLAG,ITER,J,JM1,L,MSUM,NCFAIL,NCSUC,NSLOW1,NSLOW2 INTEGER IWA(1) LOGICAL JEVAL,SING DOUBLE PRECISION ACTRED,DELTA,EPSMCH,FNORM,FNORM1,ONE,PNORM, * PRERED,P1,P5,P001,P0001,RATIO,SUM,TEMP,XNORM, * ZERO DOUBLE PRECISION DPMPAR,ENORM DATA ONE,P1,P5,P001,P0001,ZERO * /1.0D0,1.0D-1,5.0D-1,1.0D-3,1.0D-4,0.0D0/ C C EPSMCH IS THE MACHINE PRECISION. C EPSMCH = DPMPAR(1) C INFO = 0 IFLAG = 0 NFEV = 0 C C CHECK THE INPUT PARAMETERS FOR ERRORS. C IF (N .LE. 0 .OR. XTOL .LT. ZERO .OR. MAXFEV .LE. 0 * .OR. ML .LT. 0 .OR. MU .LT. 0 .OR. FACTOR .LE. ZERO * .OR. LDFJAC .LT. N .OR. LR .LT. (N*(N + 1))/2) GO TO 300 IF (MODE .NE. 2) GO TO 20 DO 10 J = 1, N IF (DIAG(J) .LE. ZERO) GO TO 300 10 CONTINUE 20 CONTINUE C C EVALUATE THE FUNCTION AT THE STARTING POINT C AND CALCULATE ITS NORM. C IFLAG = 1 CALL FCN(N,X,FVEC,IFLAG) NFEV = 1 IF (IFLAG .LT. 0) GO TO 300 FNORM = ENORM(N,FVEC) C C DETERMINE THE NUMBER OF CALLS TO FCN NEEDED TO COMPUTE C THE JACOBIAN MATRIX. C MSUM = MIN0(ML+MU+1,N) C C INITIALIZE ITERATION COUNTER AND MONITORS. C ITER = 1 NCSUC = 0 NCFAIL = 0 NSLOW1 = 0 NSLOW2 = 0 C C BEGINNING OF THE OUTER LOOP. C 30 CONTINUE JEVAL = .TRUE. C C CALCULATE THE JACOBIAN MATRIX. C IFLAG = 2 CALL FDJAC1(FCN,N,X,FVEC,FJAC,LDFJAC,IFLAG,ML,MU,EPSFCN,WA1, * WA2) NFEV = NFEV + MSUM IF (IFLAG .LT. 0) GO TO 300 C C COMPUTE THE QR FACTORIZATION OF THE JACOBIAN. C CALL QRFAC(N,N,FJAC,LDFJAC,.FALSE.,IWA,1,WA1,WA2,WA3) C C ON THE FIRST ITERATION AND IF MODE IS 1, SCALE ACCORDING C TO THE NORMS OF THE COLUMNS OF THE INITIAL JACOBIAN. C IF (ITER .NE. 1) GO TO 70 IF (MODE .EQ. 2) GO TO 50 DO 40 J = 1, N DIAG(J) = WA2(J) IF (WA2(J) .EQ. ZERO) DIAG(J) = ONE 40 CONTINUE 50 CONTINUE C C ON THE FIRST ITERATION, CALCULATE THE NORM OF THE SCALED X C AND INITIALIZE THE STEP BOUND DELTA. C DO 60 J = 1, N WA3(J) = DIAG(J)*X(J) 60 CONTINUE XNORM = ENORM(N,WA3) DELTA = FACTOR*XNORM IF (DELTA .EQ. ZERO) DELTA = FACTOR 70 CONTINUE C C FORM (Q TRANSPOSE)*FVEC AND STORE IN QTF. C DO 80 I = 1, N QTF(I) = FVEC(I) 80 CONTINUE DO 120 J = 1, N IF (FJAC(J,J) .EQ. ZERO) GO TO 110 SUM = ZERO DO 90 I = J, N SUM = SUM + FJAC(I,J)*QTF(I) 90 CONTINUE TEMP = -SUM/FJAC(J,J) DO 100 I = J, N QTF(I) = QTF(I) + FJAC(I,J)*TEMP 100 CONTINUE 110 CONTINUE 120 CONTINUE C C COPY THE TRIANGULAR FACTOR OF THE QR FACTORIZATION INTO R. C SING = .FALSE. DO 150 J = 1, N L = J JM1 = J - 1 IF (JM1 .LT. 1) GO TO 140 DO 130 I = 1, JM1 R(L) = FJAC(I,J) L = L + N - I 130 CONTINUE 140 CONTINUE R(L) = WA1(J) IF (WA1(J) .EQ. ZERO) SING = .TRUE. 150 CONTINUE C C ACCUMULATE THE ORTHOGONAL FACTOR IN FJAC. C CALL QFORM(N,N,FJAC,LDFJAC,WA1) C C RESCALE IF NECESSARY. C IF (MODE .EQ. 2) GO TO 170 DO 160 J = 1, N DIAG(J) = DMAX1(DIAG(J),WA2(J)) 160 CONTINUE 170 CONTINUE C C BEGINNING OF THE INNER LOOP. C 180 CONTINUE C C IF REQUESTED, CALL FCN TO ENABLE PRINTING OF ITERATES. C IF (NPRINT .LE. 0) GO TO 190 IFLAG = 0 IF (MOD(ITER-1,NPRINT) .EQ. 0) CALL FCN(N,X,FVEC,IFLAG) IF (IFLAG .LT. 0) GO TO 300 190 CONTINUE C C DETERMINE THE DIRECTION P. C CALL DOGLEG(N,R,LR,DIAG,QTF,DELTA,WA1,WA2,WA3) C C STORE THE DIRECTION P AND X + P. CALCULATE THE NORM OF P. C DO 200 J = 1, N WA1(J) = -WA1(J) WA2(J) = X(J) + WA1(J) WA3(J) = DIAG(J)*WA1(J) 200 CONTINUE PNORM = ENORM(N,WA3) C C ON THE FIRST ITERATION, ADJUST THE INITIAL STEP BOUND. C IF (ITER .EQ. 1) DELTA = DMIN1(DELTA,PNORM) C C EVALUATE THE FUNCTION AT X + P AND CALCULATE ITS NORM. C IFLAG = 1 CALL FCN(N,WA2,WA4,IFLAG) NFEV = NFEV + 1 IF (IFLAG .LT. 0) GO TO 300 FNORM1 = ENORM(N,WA4) C C COMPUTE THE SCALED ACTUAL REDUCTION. C ACTRED = -ONE IF (FNORM1 .LT. FNORM) ACTRED = ONE - (FNORM1/FNORM)**2 C C COMPUTE THE SCALED PREDICTED REDUCTION. C L = 1 DO 220 I = 1, N SUM = ZERO DO 210 J = I, N SUM = SUM + R(L)*WA1(J) L = L + 1 210 CONTINUE WA3(I) = QTF(I) + SUM 220 CONTINUE TEMP = ENORM(N,WA3) PRERED = ZERO IF (TEMP .LT. FNORM) PRERED = ONE - (TEMP/FNORM)**2 C C COMPUTE THE RATIO OF THE ACTUAL TO THE PREDICTED C REDUCTION. C RATIO = ZERO IF (PRERED .GT. ZERO) RATIO = ACTRED/PRERED C C UPDATE THE STEP BOUND. C IF (RATIO .GE. P1) GO TO 230 NCSUC = 0 NCFAIL = NCFAIL + 1 DELTA = P5*DELTA GO TO 240 230 CONTINUE NCFAIL = 0 NCSUC = NCSUC + 1 IF (RATIO .GE. P5 .OR. NCSUC .GT. 1) * DELTA = DMAX1(DELTA,PNORM/P5) IF (DABS(RATIO-ONE) .LE. P1) DELTA = PNORM/P5 240 CONTINUE C C TEST FOR SUCCESSFUL ITERATION. C IF (RATIO .LT. P0001) GO TO 260 C C SUCCESSFUL ITERATION. UPDATE X, FVEC, AND THEIR NORMS. C DO 250 J = 1, N X(J) = WA2(J) WA2(J) = DIAG(J)*X(J) FVEC(J) = WA4(J) 250 CONTINUE XNORM = ENORM(N,WA2) FNORM = FNORM1 ITER = ITER + 1 260 CONTINUE C C DETERMINE THE PROGRESS OF THE ITERATION. C NSLOW1 = NSLOW1 + 1 IF (ACTRED .GE. P001) NSLOW1 = 0 IF (JEVAL) NSLOW2 = NSLOW2 + 1 IF (ACTRED .GE. P1) NSLOW2 = 0 C C TEST FOR CONVERGENCE. C IF (DELTA .LE. XTOL*XNORM .OR. FNORM .EQ. ZERO) INFO = 1 IF (INFO .NE. 0) GO TO 300 C C TESTS FOR TERMINATION AND STRINGENT TOLERANCES. C IF (NFEV .GE. MAXFEV) INFO = 2 IF (P1*DMAX1(P1*DELTA,PNORM) .LE. EPSMCH*XNORM) INFO = 3 IF (NSLOW2 .EQ. 5) INFO = 4 IF (NSLOW1 .EQ. 10) INFO = 5 IF (INFO .NE. 0) GO TO 300 C C CRITERION FOR RECALCULATING JACOBIAN APPROXIMATION C BY FORWARD DIFFERENCES. C IF (NCFAIL .EQ. 2) GO TO 290 C C CALCULATE THE RANK ONE MODIFICATION TO THE JACOBIAN C AND UPDATE QTF IF NECESSARY. C DO 280 J = 1, N SUM = ZERO DO 270 I = 1, N SUM = SUM + FJAC(I,J)*WA4(I) 270 CONTINUE WA2(J) = (SUM - WA3(J))/PNORM WA1(J) = DIAG(J)*((DIAG(J)*WA1(J))/PNORM) IF (RATIO .GE. P0001) QTF(J) = SUM 280 CONTINUE C C COMPUTE THE QR FACTORIZATION OF THE UPDATED JACOBIAN. C CALL R1UPDT(N,N,R,LR,WA1,WA2,WA3,SING) CALL R1MPYQ(N,N,FJAC,LDFJAC,WA2,WA3) CALL R1MPYQ(1,N,QTF,1,WA2,WA3) C C END OF THE INNER LOOP. C JEVAL = .FALSE. GO TO 180 290 CONTINUE C C END OF THE OUTER LOOP. C GO TO 30 300 CONTINUE C C TERMINATION, EITHER NORMAL OR USER IMPOSED. C IF (IFLAG .LT. 0) INFO = IFLAG IFLAG = 0 IF (NPRINT .GT. 0) CALL FCN(N,X,FVEC,IFLAG) RETURN C C LAST CARD OF SUBROUTINE HYBRD. C END octave-1.1.0/libcruft/minpack/hybrd1.f100666 415 17 7471 5274161721 15751 0ustar jweusers SUBROUTINE HYBRD1(FCN,N,X,FVEC,TOL,INFO,WA,LWA) INTEGER N,INFO,LWA DOUBLE PRECISION TOL DOUBLE PRECISION X(N),FVEC(N),WA(LWA) EXTERNAL FCN C ********** C C SUBROUTINE HYBRD1 C C THE PURPOSE OF HYBRD1 IS TO FIND A ZERO OF A SYSTEM OF C N NONLINEAR FUNCTIONS IN N VARIABLES BY A MODIFICATION C OF THE POWELL HYBRID METHOD. THIS IS DONE BY USING THE C MORE GENERAL NONLINEAR EQUATION SOLVER HYBRD. THE USER C MUST PROVIDE A SUBROUTINE WHICH CALCULATES THE FUNCTIONS. C THE JACOBIAN IS THEN CALCULATED BY A FORWARD-DIFFERENCE C APPROXIMATION. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE HYBRD1(FCN,N,X,FVEC,TOL,INFO,WA,LWA) C C WHERE C C FCN IS THE NAME OF THE USER-SUPPLIED SUBROUTINE WHICH C CALCULATES THE FUNCTIONS. FCN MUST BE DECLARED C IN AN EXTERNAL STATEMENT IN THE USER CALLING C PROGRAM, AND SHOULD BE WRITTEN AS FOLLOWS. C C SUBROUTINE FCN(N,X,FVEC,IFLAG) C INTEGER N,IFLAG C DOUBLE PRECISION X(N),FVEC(N) C ---------- C CALCULATE THE FUNCTIONS AT X AND C RETURN THIS VECTOR IN FVEC. C --------- C RETURN C END C C THE VALUE OF IFLAG SHOULD NOT BE CHANGED BY FCN UNLESS C THE USER WANTS TO TERMINATE EXECUTION OF HYBRD1. C IN THIS CASE SET IFLAG TO A NEGATIVE INTEGER. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF FUNCTIONS AND VARIABLES. C C X IS AN ARRAY OF LENGTH N. ON INPUT X MUST CONTAIN C AN INITIAL ESTIMATE OF THE SOLUTION VECTOR. ON OUTPUT X C CONTAINS THE FINAL ESTIMATE OF THE SOLUTION VECTOR. C C FVEC IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE FUNCTIONS EVALUATED AT THE OUTPUT X. C C TOL IS A NONNEGATIVE INPUT VARIABLE. TERMINATION OCCURS C WHEN THE ALGORITHM ESTIMATES THAT THE RELATIVE ERROR C BETWEEN X AND THE SOLUTION IS AT MOST TOL. C C INFO IS AN INTEGER OUTPUT VARIABLE. IF THE USER HAS C TERMINATED EXECUTION, INFO IS SET TO THE (NEGATIVE) C VALUE OF IFLAG. SEE DESCRIPTION OF FCN. OTHERWISE, C INFO IS SET AS FOLLOWS. C C INFO = 0 IMPROPER INPUT PARAMETERS. C C INFO = 1 ALGORITHM ESTIMATES THAT THE RELATIVE ERROR C BETWEEN X AND THE SOLUTION IS AT MOST TOL. C C INFO = 2 NUMBER OF CALLS TO FCN HAS REACHED OR EXCEEDED C 200*(N+1). C C INFO = 3 TOL IS TOO SMALL. NO FURTHER IMPROVEMENT IN C THE APPROXIMATE SOLUTION X IS POSSIBLE. C C INFO = 4 ITERATION IS NOT MAKING GOOD PROGRESS. C C WA IS A WORK ARRAY OF LENGTH LWA. C C LWA IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(3*N+13))/2. C C SUBPROGRAMS CALLED C C USER-SUPPLIED ...... FCN C C MINPACK-SUPPLIED ... HYBRD C C MINPACK. VERSION OF JULY 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER INDEX,J,LR,MAXFEV,ML,MODE,MU,NFEV,NPRINT DOUBLE PRECISION EPSFCN,FACTOR,ONE,XTOL,ZERO DATA FACTOR,ONE,ZERO /1.0D2,1.0D0,0.0D0/ INFO = 0 C C CHECK THE INPUT PARAMETERS FOR ERRORS. C IF (N .LE. 0 .OR. TOL .LT. ZERO .OR. LWA .LT. (N*(3*N + 13))/2) * GO TO 20 C C CALL HYBRD. C MAXFEV = 200*(N + 1) XTOL = TOL ML = N - 1 MU = N - 1 EPSFCN = ZERO MODE = 2 DO 10 J = 1, N WA(J) = ONE 10 CONTINUE NPRINT = 0 LR = (N*(N + 1))/2 INDEX = 6*N + LR CALL HYBRD(FCN,N,X,FVEC,XTOL,MAXFEV,ML,MU,EPSFCN,WA(1),MODE, * FACTOR,NPRINT,INFO,NFEV,WA(INDEX+1),N,WA(6*N+1),LR, * WA(N+1),WA(2*N+1),WA(3*N+1),WA(4*N+1),WA(5*N+1)) IF (INFO .EQ. 5) INFO = 4 20 CONTINUE RETURN C C LAST CARD OF SUBROUTINE HYBRD1. C END octave-1.1.0/libcruft/minpack/hybrj.f100666 415 17 33404 5274161721 15711 0ustar jweusers SUBROUTINE HYBRJ(FCN,N,X,FVEC,FJAC,LDFJAC,XTOL,MAXFEV,DIAG,MODE, * FACTOR,NPRINT,INFO,NFEV,NJEV,R,LR,QTF,WA1,WA2, * WA3,WA4) INTEGER N,LDFJAC,MAXFEV,MODE,NPRINT,INFO,NFEV,NJEV,LR DOUBLE PRECISION XTOL,FACTOR DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N),DIAG(N),R(LR), * QTF(N),WA1(N),WA2(N),WA3(N),WA4(N) EXTERNAL FCN C ********** C C SUBROUTINE HYBRJ C C THE PURPOSE OF HYBRJ IS TO FIND A ZERO OF A SYSTEM OF C N NONLINEAR FUNCTIONS IN N VARIABLES BY A MODIFICATION C OF THE POWELL HYBRID METHOD. THE USER MUST PROVIDE A C SUBROUTINE WHICH CALCULATES THE FUNCTIONS AND THE JACOBIAN. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE HYBRJ(FCN,N,X,FVEC,FJAC,LDFJAC,XTOL,MAXFEV,DIAG, C MODE,FACTOR,NPRINT,INFO,NFEV,NJEV,R,LR,QTF, C WA1,WA2,WA3,WA4) C C WHERE C C FCN IS THE NAME OF THE USER-SUPPLIED SUBROUTINE WHICH C CALCULATES THE FUNCTIONS AND THE JACOBIAN. FCN MUST C BE DECLARED IN AN EXTERNAL STATEMENT IN THE USER C CALLING PROGRAM, AND SHOULD BE WRITTEN AS FOLLOWS. C C SUBROUTINE FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) C INTEGER N,LDFJAC,IFLAG C DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N) C ---------- C IF IFLAG = 1 CALCULATE THE FUNCTIONS AT X AND C RETURN THIS VECTOR IN FVEC. DO NOT ALTER FJAC. C IF IFLAG = 2 CALCULATE THE JACOBIAN AT X AND C RETURN THIS MATRIX IN FJAC. DO NOT ALTER FVEC. C --------- C RETURN C END C C THE VALUE OF IFLAG SHOULD NOT BE CHANGED BY FCN UNLESS C THE USER WANTS TO TERMINATE EXECUTION OF HYBRJ. C IN THIS CASE SET IFLAG TO A NEGATIVE INTEGER. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF FUNCTIONS AND VARIABLES. C C X IS AN ARRAY OF LENGTH N. ON INPUT X MUST CONTAIN C AN INITIAL ESTIMATE OF THE SOLUTION VECTOR. ON OUTPUT X C CONTAINS THE FINAL ESTIMATE OF THE SOLUTION VECTOR. C C FVEC IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE FUNCTIONS EVALUATED AT THE OUTPUT X. C C FJAC IS AN OUTPUT N BY N ARRAY WHICH CONTAINS THE C ORTHOGONAL MATRIX Q PRODUCED BY THE QR FACTORIZATION C OF THE FINAL APPROXIMATE JACOBIAN. C C LDFJAC IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN N C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY FJAC. C C XTOL IS A NONNEGATIVE INPUT VARIABLE. TERMINATION C OCCURS WHEN THE RELATIVE ERROR BETWEEN TWO CONSECUTIVE C ITERATES IS AT MOST XTOL. C C MAXFEV IS A POSITIVE INTEGER INPUT VARIABLE. TERMINATION C OCCURS WHEN THE NUMBER OF CALLS TO FCN WITH IFLAG = 1 C HAS REACHED MAXFEV. C C DIAG IS AN ARRAY OF LENGTH N. IF MODE = 1 (SEE C BELOW), DIAG IS INTERNALLY SET. IF MODE = 2, DIAG C MUST CONTAIN POSITIVE ENTRIES THAT SERVE AS IMPLICIT C (MULTIPLICATIVE) SCALE FACTORS FOR THE VARIABLES. C C MODE IS AN INTEGER INPUT VARIABLE. IF MODE = 1, THE C VARIABLES WILL BE SCALED INTERNALLY. IF MODE = 2, C THE SCALING IS SPECIFIED BY THE INPUT DIAG. OTHER C VALUES OF MODE ARE EQUIVALENT TO MODE = 1. C C FACTOR IS A POSITIVE INPUT VARIABLE USED IN DETERMINING THE C INITIAL STEP BOUND. THIS BOUND IS SET TO THE PRODUCT OF C FACTOR AND THE EUCLIDEAN NORM OF DIAG*X IF NONZERO, OR ELSE C TO FACTOR ITSELF. IN MOST CASES FACTOR SHOULD LIE IN THE C INTERVAL (.1,100.). 100. IS A GENERALLY RECOMMENDED VALUE. C C NPRINT IS AN INTEGER INPUT VARIABLE THAT ENABLES CONTROLLED C PRINTING OF ITERATES IF IT IS POSITIVE. IN THIS CASE, C FCN IS CALLED WITH IFLAG = 0 AT THE BEGINNING OF THE FIRST C ITERATION AND EVERY NPRINT ITERATIONS THEREAFTER AND C IMMEDIATELY PRIOR TO RETURN, WITH X AND FVEC AVAILABLE C FOR PRINTING. FVEC AND FJAC SHOULD NOT BE ALTERED. C IF NPRINT IS NOT POSITIVE, NO SPECIAL CALLS OF FCN C WITH IFLAG = 0 ARE MADE. C C INFO IS AN INTEGER OUTPUT VARIABLE. IF THE USER HAS C TERMINATED EXECUTION, INFO IS SET TO THE (NEGATIVE) C VALUE OF IFLAG. SEE DESCRIPTION OF FCN. OTHERWISE, C INFO IS SET AS FOLLOWS. C C INFO = 0 IMPROPER INPUT PARAMETERS. C C INFO = 1 RELATIVE ERROR BETWEEN TWO CONSECUTIVE ITERATES C IS AT MOST TOL. C C INFO = 2 NUMBER OF CALLS TO FCN WITH IFLAG = 1 HAS C REACHED MAXFEV. C C INFO = 3 XTOL IS TOO SMALL. NO FURTHER IMPROVEMENT IN C THE APPROXIMATE SOLUTION X IS POSSIBLE. C C INFO = 4 ITERATION IS NOT MAKING GOOD PROGRESS, AS C MEASURED BY THE IMPROVEMENT FROM THE LAST C FIVE JACOBIAN EVALUATIONS. C C INFO = 5 ITERATION IS NOT MAKING GOOD PROGRESS, AS C MEASURED BY THE IMPROVEMENT FROM THE LAST C TEN ITERATIONS. C C NFEV IS AN INTEGER OUTPUT VARIABLE SET TO THE NUMBER OF C CALLS TO FCN WITH IFLAG = 1. C C NJEV IS AN INTEGER OUTPUT VARIABLE SET TO THE NUMBER OF C CALLS TO FCN WITH IFLAG = 2. C C R IS AN OUTPUT ARRAY OF LENGTH LR WHICH CONTAINS THE C UPPER TRIANGULAR MATRIX PRODUCED BY THE QR FACTORIZATION C OF THE FINAL APPROXIMATE JACOBIAN, STORED ROWWISE. C C LR IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(N+1))/2. C C QTF IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE VECTOR (Q TRANSPOSE)*FVEC. C C WA1, WA2, WA3, AND WA4 ARE WORK ARRAYS OF LENGTH N. C C SUBPROGRAMS CALLED C C USER-SUPPLIED ...... FCN C C MINPACK-SUPPLIED ... DOGLEG,DPMPAR,ENORM, C QFORM,QRFAC,R1MPYQ,R1UPDT C C FORTRAN-SUPPLIED ... DABS,DMAX1,DMIN1,MOD C C MINPACK. VERSION OF SEPTEMBER 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,IFLAG,ITER,J,JM1,L,NCFAIL,NCSUC,NSLOW1,NSLOW2 INTEGER IWA(1) LOGICAL JEVAL,SING DOUBLE PRECISION ACTRED,DELTA,EPSMCH,FNORM,FNORM1,ONE,PNORM, * PRERED,P1,P5,P001,P0001,RATIO,SUM,TEMP,XNORM, * ZERO DOUBLE PRECISION DPMPAR,ENORM DATA ONE,P1,P5,P001,P0001,ZERO * /1.0D0,1.0D-1,5.0D-1,1.0D-3,1.0D-4,0.0D0/ C C EPSMCH IS THE MACHINE PRECISION. C EPSMCH = DPMPAR(1) C INFO = 0 IFLAG = 0 NFEV = 0 NJEV = 0 C C CHECK THE INPUT PARAMETERS FOR ERRORS. C IF (N .LE. 0 .OR. LDFJAC .LT. N .OR. XTOL .LT. ZERO * .OR. MAXFEV .LE. 0 .OR. FACTOR .LE. ZERO * .OR. LR .LT. (N*(N + 1))/2) GO TO 300 IF (MODE .NE. 2) GO TO 20 DO 10 J = 1, N IF (DIAG(J) .LE. ZERO) GO TO 300 10 CONTINUE 20 CONTINUE C C EVALUATE THE FUNCTION AT THE STARTING POINT C AND CALCULATE ITS NORM. C IFLAG = 1 CALL FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) NFEV = 1 IF (IFLAG .LT. 0) GO TO 300 FNORM = ENORM(N,FVEC) C C INITIALIZE ITERATION COUNTER AND MONITORS. C ITER = 1 NCSUC = 0 NCFAIL = 0 NSLOW1 = 0 NSLOW2 = 0 C C BEGINNING OF THE OUTER LOOP. C 30 CONTINUE JEVAL = .TRUE. C C CALCULATE THE JACOBIAN MATRIX. C IFLAG = 2 CALL FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) NJEV = NJEV + 1 IF (IFLAG .LT. 0) GO TO 300 C C COMPUTE THE QR FACTORIZATION OF THE JACOBIAN. C CALL QRFAC(N,N,FJAC,LDFJAC,.FALSE.,IWA,1,WA1,WA2,WA3) C C ON THE FIRST ITERATION AND IF MODE IS 1, SCALE ACCORDING C TO THE NORMS OF THE COLUMNS OF THE INITIAL JACOBIAN. C IF (ITER .NE. 1) GO TO 70 IF (MODE .EQ. 2) GO TO 50 DO 40 J = 1, N DIAG(J) = WA2(J) IF (WA2(J) .EQ. ZERO) DIAG(J) = ONE 40 CONTINUE 50 CONTINUE C C ON THE FIRST ITERATION, CALCULATE THE NORM OF THE SCALED X C AND INITIALIZE THE STEP BOUND DELTA. C DO 60 J = 1, N WA3(J) = DIAG(J)*X(J) 60 CONTINUE XNORM = ENORM(N,WA3) DELTA = FACTOR*XNORM IF (DELTA .EQ. ZERO) DELTA = FACTOR 70 CONTINUE C C FORM (Q TRANSPOSE)*FVEC AND STORE IN QTF. C DO 80 I = 1, N QTF(I) = FVEC(I) 80 CONTINUE DO 120 J = 1, N IF (FJAC(J,J) .EQ. ZERO) GO TO 110 SUM = ZERO DO 90 I = J, N SUM = SUM + FJAC(I,J)*QTF(I) 90 CONTINUE TEMP = -SUM/FJAC(J,J) DO 100 I = J, N QTF(I) = QTF(I) + FJAC(I,J)*TEMP 100 CONTINUE 110 CONTINUE 120 CONTINUE C C COPY THE TRIANGULAR FACTOR OF THE QR FACTORIZATION INTO R. C SING = .FALSE. DO 150 J = 1, N L = J JM1 = J - 1 IF (JM1 .LT. 1) GO TO 140 DO 130 I = 1, JM1 R(L) = FJAC(I,J) L = L + N - I 130 CONTINUE 140 CONTINUE R(L) = WA1(J) IF (WA1(J) .EQ. ZERO) SING = .TRUE. 150 CONTINUE C C ACCUMULATE THE ORTHOGONAL FACTOR IN FJAC. C CALL QFORM(N,N,FJAC,LDFJAC,WA1) C C RESCALE IF NECESSARY. C IF (MODE .EQ. 2) GO TO 170 DO 160 J = 1, N DIAG(J) = DMAX1(DIAG(J),WA2(J)) 160 CONTINUE 170 CONTINUE C C BEGINNING OF THE INNER LOOP. C 180 CONTINUE C C IF REQUESTED, CALL FCN TO ENABLE PRINTING OF ITERATES. C IF (NPRINT .LE. 0) GO TO 190 IFLAG = 0 IF (MOD(ITER-1,NPRINT) .EQ. 0) * CALL FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) IF (IFLAG .LT. 0) GO TO 300 190 CONTINUE C C DETERMINE THE DIRECTION P. C CALL DOGLEG(N,R,LR,DIAG,QTF,DELTA,WA1,WA2,WA3) C C STORE THE DIRECTION P AND X + P. CALCULATE THE NORM OF P. C DO 200 J = 1, N WA1(J) = -WA1(J) WA2(J) = X(J) + WA1(J) WA3(J) = DIAG(J)*WA1(J) 200 CONTINUE PNORM = ENORM(N,WA3) C C ON THE FIRST ITERATION, ADJUST THE INITIAL STEP BOUND. C IF (ITER .EQ. 1) DELTA = DMIN1(DELTA,PNORM) C C EVALUATE THE FUNCTION AT X + P AND CALCULATE ITS NORM. C IFLAG = 1 CALL FCN(N,WA2,WA4,FJAC,LDFJAC,IFLAG) NFEV = NFEV + 1 IF (IFLAG .LT. 0) GO TO 300 FNORM1 = ENORM(N,WA4) C C COMPUTE THE SCALED ACTUAL REDUCTION. C ACTRED = -ONE IF (FNORM1 .LT. FNORM) ACTRED = ONE - (FNORM1/FNORM)**2 C C COMPUTE THE SCALED PREDICTED REDUCTION. C L = 1 DO 220 I = 1, N SUM = ZERO DO 210 J = I, N SUM = SUM + R(L)*WA1(J) L = L + 1 210 CONTINUE WA3(I) = QTF(I) + SUM 220 CONTINUE TEMP = ENORM(N,WA3) PRERED = ZERO IF (TEMP .LT. FNORM) PRERED = ONE - (TEMP/FNORM)**2 C C COMPUTE THE RATIO OF THE ACTUAL TO THE PREDICTED C REDUCTION. C RATIO = ZERO IF (PRERED .GT. ZERO) RATIO = ACTRED/PRERED C C UPDATE THE STEP BOUND. C IF (RATIO .GE. P1) GO TO 230 NCSUC = 0 NCFAIL = NCFAIL + 1 DELTA = P5*DELTA GO TO 240 230 CONTINUE NCFAIL = 0 NCSUC = NCSUC + 1 IF (RATIO .GE. P5 .OR. NCSUC .GT. 1) * DELTA = DMAX1(DELTA,PNORM/P5) IF (DABS(RATIO-ONE) .LE. P1) DELTA = PNORM/P5 240 CONTINUE C C TEST FOR SUCCESSFUL ITERATION. C IF (RATIO .LT. P0001) GO TO 260 C C SUCCESSFUL ITERATION. UPDATE X, FVEC, AND THEIR NORMS. C DO 250 J = 1, N X(J) = WA2(J) WA2(J) = DIAG(J)*X(J) FVEC(J) = WA4(J) 250 CONTINUE XNORM = ENORM(N,WA2) FNORM = FNORM1 ITER = ITER + 1 260 CONTINUE C C DETERMINE THE PROGRESS OF THE ITERATION. C NSLOW1 = NSLOW1 + 1 IF (ACTRED .GE. P001) NSLOW1 = 0 IF (JEVAL) NSLOW2 = NSLOW2 + 1 IF (ACTRED .GE. P1) NSLOW2 = 0 C C TEST FOR CONVERGENCE. C IF (DELTA .LE. XTOL*XNORM .OR. FNORM .EQ. ZERO) INFO = 1 IF (INFO .NE. 0) GO TO 300 C C TESTS FOR TERMINATION AND STRINGENT TOLERANCES. C IF (NFEV .GE. MAXFEV) INFO = 2 IF (P1*DMAX1(P1*DELTA,PNORM) .LE. EPSMCH*XNORM) INFO = 3 IF (NSLOW2 .EQ. 5) INFO = 4 IF (NSLOW1 .EQ. 10) INFO = 5 IF (INFO .NE. 0) GO TO 300 C C CRITERION FOR RECALCULATING JACOBIAN. C IF (NCFAIL .EQ. 2) GO TO 290 C C CALCULATE THE RANK ONE MODIFICATION TO THE JACOBIAN C AND UPDATE QTF IF NECESSARY. C DO 280 J = 1, N SUM = ZERO DO 270 I = 1, N SUM = SUM + FJAC(I,J)*WA4(I) 270 CONTINUE WA2(J) = (SUM - WA3(J))/PNORM WA1(J) = DIAG(J)*((DIAG(J)*WA1(J))/PNORM) IF (RATIO .GE. P0001) QTF(J) = SUM 280 CONTINUE C C COMPUTE THE QR FACTORIZATION OF THE UPDATED JACOBIAN. C CALL R1UPDT(N,N,R,LR,WA1,WA2,WA3,SING) CALL R1MPYQ(N,N,FJAC,LDFJAC,WA2,WA3) CALL R1MPYQ(1,N,QTF,1,WA2,WA3) C C END OF THE INNER LOOP. C JEVAL = .FALSE. GO TO 180 290 CONTINUE C C END OF THE OUTER LOOP. C GO TO 30 300 CONTINUE C C TERMINATION, EITHER NORMAL OR USER IMPOSED. C IF (IFLAG .LT. 0) INFO = IFLAG IFLAG = 0 IF (NPRINT .GT. 0) CALL FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) RETURN C C LAST CARD OF SUBROUTINE HYBRJ. C END octave-1.1.0/libcruft/minpack/hybrj1.f100666 415 17 10315 5274161721 15766 0ustar jweusers SUBROUTINE HYBRJ1(FCN,N,X,FVEC,FJAC,LDFJAC,TOL,INFO,WA,LWA) INTEGER N,LDFJAC,INFO,LWA DOUBLE PRECISION TOL DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N),WA(LWA) EXTERNAL FCN C ********** C C SUBROUTINE HYBRJ1 C C THE PURPOSE OF HYBRJ1 IS TO FIND A ZERO OF A SYSTEM OF C N NONLINEAR FUNCTIONS IN N VARIABLES BY A MODIFICATION C OF THE POWELL HYBRID METHOD. THIS IS DONE BY USING THE C MORE GENERAL NONLINEAR EQUATION SOLVER HYBRJ. THE USER C MUST PROVIDE A SUBROUTINE WHICH CALCULATES THE FUNCTIONS C AND THE JACOBIAN. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE HYBRJ1(FCN,N,X,FVEC,FJAC,LDFJAC,TOL,INFO,WA,LWA) C C WHERE C C FCN IS THE NAME OF THE USER-SUPPLIED SUBROUTINE WHICH C CALCULATES THE FUNCTIONS AND THE JACOBIAN. FCN MUST C BE DECLARED IN AN EXTERNAL STATEMENT IN THE USER C CALLING PROGRAM, AND SHOULD BE WRITTEN AS FOLLOWS. C C SUBROUTINE FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG) C INTEGER N,LDFJAC,IFLAG C DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N) C ---------- C IF IFLAG = 1 CALCULATE THE FUNCTIONS AT X AND C RETURN THIS VECTOR IN FVEC. DO NOT ALTER FJAC. C IF IFLAG = 2 CALCULATE THE JACOBIAN AT X AND C RETURN THIS MATRIX IN FJAC. DO NOT ALTER FVEC. C --------- C RETURN C END C C THE VALUE OF IFLAG SHOULD NOT BE CHANGED BY FCN UNLESS C THE USER WANTS TO TERMINATE EXECUTION OF HYBRJ1. C IN THIS CASE SET IFLAG TO A NEGATIVE INTEGER. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF FUNCTIONS AND VARIABLES. C C X IS AN ARRAY OF LENGTH N. ON INPUT X MUST CONTAIN C AN INITIAL ESTIMATE OF THE SOLUTION VECTOR. ON OUTPUT X C CONTAINS THE FINAL ESTIMATE OF THE SOLUTION VECTOR. C C FVEC IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS C THE FUNCTIONS EVALUATED AT THE OUTPUT X. C C FJAC IS AN OUTPUT N BY N ARRAY WHICH CONTAINS THE C ORTHOGONAL MATRIX Q PRODUCED BY THE QR FACTORIZATION C OF THE FINAL APPROXIMATE JACOBIAN. C C LDFJAC IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN N C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY FJAC. C C TOL IS A NONNEGATIVE INPUT VARIABLE. TERMINATION OCCURS C WHEN THE ALGORITHM ESTIMATES THAT THE RELATIVE ERROR C BETWEEN X AND THE SOLUTION IS AT MOST TOL. C C INFO IS AN INTEGER OUTPUT VARIABLE. IF THE USER HAS C TERMINATED EXECUTION, INFO IS SET TO THE (NEGATIVE) C VALUE OF IFLAG. SEE DESCRIPTION OF FCN. OTHERWISE, C INFO IS SET AS FOLLOWS. C C INFO = 0 IMPROPER INPUT PARAMETERS. C C INFO = 1 ALGORITHM ESTIMATES THAT THE RELATIVE ERROR C BETWEEN X AND THE SOLUTION IS AT MOST TOL. C C INFO = 2 NUMBER OF CALLS TO FCN WITH IFLAG = 1 HAS C REACHED 100*(N+1). C C INFO = 3 TOL IS TOO SMALL. NO FURTHER IMPROVEMENT IN C THE APPROXIMATE SOLUTION X IS POSSIBLE. C C INFO = 4 ITERATION IS NOT MAKING GOOD PROGRESS. C C WA IS A WORK ARRAY OF LENGTH LWA. C C LWA IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(N+13))/2. C C SUBPROGRAMS CALLED C C USER-SUPPLIED ...... FCN C C MINPACK-SUPPLIED ... HYBRJ C C MINPACK. VERSION OF JULY 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER J,LR,MAXFEV,MODE,NFEV,NJEV,NPRINT DOUBLE PRECISION FACTOR,ONE,XTOL,ZERO DATA FACTOR,ONE,ZERO /1.0D2,1.0D0,0.0D0/ INFO = 0 C C CHECK THE INPUT PARAMETERS FOR ERRORS. C IF (N .LE. 0 .OR. LDFJAC .LT. N .OR. TOL .LT. ZERO * .OR. LWA .LT. (N*(N + 13))/2) GO TO 20 C C CALL HYBRJ. C MAXFEV = 100*(N + 1) XTOL = TOL MODE = 2 DO 10 J = 1, N WA(J) = ONE 10 CONTINUE NPRINT = 0 LR = (N*(N + 1))/2 CALL HYBRJ(FCN,N,X,FVEC,FJAC,LDFJAC,XTOL,MAXFEV,WA(1),MODE, * FACTOR,NPRINT,INFO,NFEV,NJEV,WA(6*N+1),LR,WA(N+1), * WA(2*N+1),WA(3*N+1),WA(4*N+1),WA(5*N+1)) IF (INFO .EQ. 5) INFO = 4 20 CONTINUE RETURN C C LAST CARD OF SUBROUTINE HYBRJ1. C END octave-1.1.0/libcruft/minpack/qform.f100666 415 17 4646 5274161721 15705 0ustar jweusers SUBROUTINE QFORM(M,N,Q,LDQ,WA) INTEGER M,N,LDQ DOUBLE PRECISION Q(LDQ,M),WA(M) C ********** C C SUBROUTINE QFORM C C THIS SUBROUTINE PROCEEDS FROM THE COMPUTED QR FACTORIZATION OF C AN M BY N MATRIX A TO ACCUMULATE THE M BY M ORTHOGONAL MATRIX C Q FROM ITS FACTORED FORM. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE QFORM(M,N,Q,LDQ,WA) C C WHERE C C M IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF ROWS OF A AND THE ORDER OF Q. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF COLUMNS OF A. C C Q IS AN M BY M ARRAY. ON INPUT THE FULL LOWER TRAPEZOID IN C THE FIRST MIN(M,N) COLUMNS OF Q CONTAINS THE FACTORED FORM. C ON OUTPUT Q HAS BEEN ACCUMULATED INTO A SQUARE MATRIX. C C LDQ IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN M C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY Q. C C WA IS A WORK ARRAY OF LENGTH M. C C SUBPROGRAMS CALLED C C FORTRAN-SUPPLIED ... MIN0 C C MINPACK. VERSION OF JANUARY 1979. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,J,JM1,K,L,MINMN,NP1 DOUBLE PRECISION ONE,SUM,TEMP,ZERO DATA ONE,ZERO /1.0D0,0.0D0/ C C ZERO OUT UPPER TRIANGLE OF Q IN THE FIRST MIN(M,N) COLUMNS. C MINMN = MIN0(M,N) IF (MINMN .LT. 2) GO TO 30 DO 20 J = 2, MINMN JM1 = J - 1 DO 10 I = 1, JM1 Q(I,J) = ZERO 10 CONTINUE 20 CONTINUE 30 CONTINUE C C INITIALIZE REMAINING COLUMNS TO THOSE OF THE IDENTITY MATRIX. C NP1 = N + 1 IF (M .LT. NP1) GO TO 60 DO 50 J = NP1, M DO 40 I = 1, M Q(I,J) = ZERO 40 CONTINUE Q(J,J) = ONE 50 CONTINUE 60 CONTINUE C C ACCUMULATE Q FROM ITS FACTORED FORM. C DO 120 L = 1, MINMN K = MINMN - L + 1 DO 70 I = K, M WA(I) = Q(I,K) Q(I,K) = ZERO 70 CONTINUE Q(K,K) = ONE IF (WA(K) .EQ. ZERO) GO TO 110 DO 100 J = K, M SUM = ZERO DO 80 I = K, M SUM = SUM + Q(I,J)*WA(I) 80 CONTINUE TEMP = SUM/WA(K) DO 90 I = K, M Q(I,J) = Q(I,J) - TEMP*WA(I) 90 CONTINUE 100 CONTINUE 110 CONTINUE 120 CONTINUE RETURN C C LAST CARD OF SUBROUTINE QFORM. C END octave-1.1.0/libcruft/minpack/qrfac.f100666 415 17 12422 5274161721 15664 0ustar jweusers SUBROUTINE QRFAC(M,N,A,LDA,PIVOT,IPVT,LIPVT,SIGMA,ACNORM,WA) INTEGER M,N,LDA,LIPVT INTEGER IPVT(LIPVT) LOGICAL PIVOT DOUBLE PRECISION A(LDA,N),SIGMA(N),ACNORM(N),WA(N) C ********** C C SUBROUTINE QRFAC C C THIS SUBROUTINE USES HOUSEHOLDER TRANSFORMATIONS WITH COLUMN C PIVOTING (OPTIONAL) TO COMPUTE A QR FACTORIZATION OF THE C M BY N MATRIX A. THAT IS, QRFAC DETERMINES AN ORTHOGONAL C MATRIX Q, A PERMUTATION MATRIX P, AND AN UPPER TRAPEZOIDAL C MATRIX R WITH DIAGONAL ELEMENTS OF NONINCREASING MAGNITUDE, C SUCH THAT A*P = Q*R. THE HOUSEHOLDER TRANSFORMATION FOR C COLUMN K, K = 1,2,...,MIN(M,N), IS OF THE FORM C C T C I - (1/U(K))*U*U C C WHERE U HAS ZEROS IN THE FIRST K-1 POSITIONS. THE FORM OF C THIS TRANSFORMATION AND THE METHOD OF PIVOTING FIRST C APPEARED IN THE CORRESPONDING LINPACK SUBROUTINE. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE QRFAC(M,N,A,LDA,PIVOT,IPVT,LIPVT,SIGMA,ACNORM,WA) C C WHERE C C M IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF ROWS OF A. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF COLUMNS OF A. C C A IS AN M BY N ARRAY. ON INPUT A CONTAINS THE MATRIX FOR C WHICH THE QR FACTORIZATION IS TO BE COMPUTED. ON OUTPUT C THE STRICT UPPER TRAPEZOIDAL PART OF A CONTAINS THE STRICT C UPPER TRAPEZOIDAL PART OF R, AND THE LOWER TRAPEZOIDAL C PART OF A CONTAINS A FACTORED FORM OF Q (THE NON-TRIVIAL C ELEMENTS OF THE U VECTORS DESCRIBED ABOVE). C C LDA IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN M C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY A. C C PIVOT IS A LOGICAL INPUT VARIABLE. IF PIVOT IS SET TRUE, C THEN COLUMN PIVOTING IS ENFORCED. IF PIVOT IS SET FALSE, C THEN NO COLUMN PIVOTING IS DONE. C C IPVT IS AN INTEGER OUTPUT ARRAY OF LENGTH LIPVT. IPVT C DEFINES THE PERMUTATION MATRIX P SUCH THAT A*P = Q*R. C COLUMN J OF P IS COLUMN IPVT(J) OF THE IDENTITY MATRIX. C IF PIVOT IS FALSE, IPVT IS NOT REFERENCED. C C LIPVT IS A POSITIVE INTEGER INPUT VARIABLE. IF PIVOT IS FALSE, C THEN LIPVT MAY BE AS SMALL AS 1. IF PIVOT IS TRUE, THEN C LIPVT MUST BE AT LEAST N. C C SIGMA IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS THE C DIAGONAL ELEMENTS OF R. C C ACNORM IS AN OUTPUT ARRAY OF LENGTH N WHICH CONTAINS THE C NORMS OF THE CORRESPONDING COLUMNS OF THE INPUT MATRIX A. C IF THIS INFORMATION IS NOT NEEDED, THEN ACNORM CAN COINCIDE C WITH SIGMA. C C WA IS A WORK ARRAY OF LENGTH N. IF PIVOT IS FALSE, THEN WA C CAN COINCIDE WITH SIGMA. C C SUBPROGRAMS CALLED C C MINPACK-SUPPLIED ... DPMPAR,ENORM C C FORTRAN-SUPPLIED ... DMAX1,DSQRT,MIN0 C C MINPACK. VERSION OF DECEMBER 1978. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,J,JP1,K,KMAX,MINMN DOUBLE PRECISION AJNORM,EPSMCH,ONE,P05,SUM,TEMP,ZERO DOUBLE PRECISION DPMPAR,ENORM DATA ONE,P05,ZERO /1.0D0,5.0D-2,0.0D0/ C C EPSMCH IS THE MACHINE PRECISION. C EPSMCH = DPMPAR(1) C C COMPUTE THE INITIAL COLUMN NORMS AND INITIALIZE SEVERAL ARRAYS. C DO 10 J = 1, N ACNORM(J) = ENORM(M,A(1,J)) SIGMA(J) = ACNORM(J) WA(J) = SIGMA(J) IF (PIVOT) IPVT(J) = J 10 CONTINUE C C REDUCE A TO R WITH HOUSEHOLDER TRANSFORMATIONS. C MINMN = MIN0(M,N) DO 110 J = 1, MINMN IF (.NOT.PIVOT) GO TO 40 C C BRING THE COLUMN OF LARGEST NORM INTO THE PIVOT POSITION. C KMAX = J DO 20 K = J, N IF (SIGMA(K) .GT. SIGMA(KMAX)) KMAX = K 20 CONTINUE IF (KMAX .EQ. J) GO TO 40 DO 30 I = 1, M TEMP = A(I,J) A(I,J) = A(I,KMAX) A(I,KMAX) = TEMP 30 CONTINUE SIGMA(KMAX) = SIGMA(J) WA(KMAX) = WA(J) K = IPVT(J) IPVT(J) = IPVT(KMAX) IPVT(KMAX) = K 40 CONTINUE C C COMPUTE THE HOUSEHOLDER TRANSFORMATION TO REDUCE THE C J-TH COLUMN OF A TO A MULTIPLE OF THE J-TH UNIT VECTOR. C AJNORM = ENORM(M-J+1,A(J,J)) IF (AJNORM .EQ. ZERO) GO TO 100 IF (A(J,J) .LT. ZERO) AJNORM = -AJNORM DO 50 I = J, M A(I,J) = A(I,J)/AJNORM 50 CONTINUE A(J,J) = A(J,J) + ONE C C APPLY THE TRANSFORMATION TO THE REMAINING COLUMNS C AND UPDATE THE NORMS. C JP1 = J + 1 IF (N .LT. JP1) GO TO 100 DO 90 K = JP1, N SUM = ZERO DO 60 I = J, M SUM = SUM + A(I,J)*A(I,K) 60 CONTINUE TEMP = SUM/A(J,J) DO 70 I = J, M A(I,K) = A(I,K) - TEMP*A(I,J) 70 CONTINUE IF (.NOT.PIVOT .OR. SIGMA(K) .EQ. ZERO) GO TO 80 TEMP = A(J,K)/SIGMA(K) SIGMA(K) = SIGMA(K)*DSQRT(DMAX1(ZERO,ONE-TEMP**2)) IF (P05*(SIGMA(K)/WA(K))**2 .GT. EPSMCH) GO TO 80 SIGMA(K) = ENORM(M-J,A(JP1,K)) WA(K) = SIGMA(K) 80 CONTINUE 90 CONTINUE 100 CONTINUE SIGMA(J) = -AJNORM 110 CONTINUE RETURN C C LAST CARD OF SUBROUTINE QRFAC. C END octave-1.1.0/libcruft/minpack/r1mpyq.f100666 415 17 5426 5274161721 16007 0ustar jweusers SUBROUTINE R1MPYQ(M,N,A,LDA,V,W) INTEGER M,N,LDA DOUBLE PRECISION A(LDA,N),V(N),W(N) C ********** C C SUBROUTINE R1MPYQ C C GIVEN AN M BY N MATRIX A, THIS SUBROUTINE COMPUTES A*Q WHERE C Q IS THE PRODUCT OF 2*(N - 1) TRANSFORMATIONS C C GV(N-1)*...*GV(1)*GW(1)*...*GW(N-1) C C AND GV(I), GW(I) ARE GIVENS ROTATIONS IN THE (I,N) PLANE WHICH C ELIMINATE ELEMENTS IN THE I-TH AND N-TH PLANES, RESPECTIVELY. C Q ITSELF IS NOT GIVEN, RATHER THE INFORMATION TO RECOVER THE C GV, GW ROTATIONS IS SUPPLIED. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE R1MPYQ(M,N,A,LDA,V,W) C C WHERE C C M IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF ROWS OF A. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF COLUMNS OF A. C C A IS AN M BY N ARRAY. ON INPUT A MUST CONTAIN THE MATRIX C TO BE POSTMULTIPLIED BY THE ORTHOGONAL MATRIX Q C DESCRIBED ABOVE. ON OUTPUT A*Q HAS REPLACED A. C C LDA IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN M C WHICH SPECIFIES THE LEADING DIMENSION OF THE ARRAY A. C C V IS AN INPUT ARRAY OF LENGTH N. V(I) MUST CONTAIN THE C INFORMATION NECESSARY TO RECOVER THE GIVENS ROTATION GV(I) C DESCRIBED ABOVE. C C W IS AN INPUT ARRAY OF LENGTH N. W(I) MUST CONTAIN THE C INFORMATION NECESSARY TO RECOVER THE GIVENS ROTATION GW(I) C DESCRIBED ABOVE. C C SUBROUTINES CALLED C C FORTRAN-SUPPLIED ... DABS,DSQRT C C MINPACK. VERSION OF DECEMBER 1978. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE C C ********** INTEGER I,J,NMJ,NM1 DOUBLE PRECISION COS,ONE,SIN,TEMP DATA ONE /1.0D0/ C C APPLY THE FIRST SET OF GIVENS ROTATIONS TO A. C NM1 = N - 1 IF (NM1 .LT. 1) GO TO 50 DO 20 NMJ = 1, NM1 J = N - NMJ IF (DABS(V(J)) .GT. ONE) COS = ONE/V(J) IF (DABS(V(J)) .GT. ONE) SIN = DSQRT(ONE-COS**2) IF (DABS(V(J)) .LE. ONE) SIN = V(J) IF (DABS(V(J)) .LE. ONE) COS = DSQRT(ONE-SIN**2) DO 10 I = 1, M TEMP = COS*A(I,J) - SIN*A(I,N) A(I,N) = SIN*A(I,J) + COS*A(I,N) A(I,J) = TEMP 10 CONTINUE 20 CONTINUE C C APPLY THE SECOND SET OF GIVENS ROTATIONS TO A. C DO 40 J = 1, NM1 IF (DABS(W(J)) .GT. ONE) COS = ONE/W(J) IF (DABS(W(J)) .GT. ONE) SIN = DSQRT(ONE-COS**2) IF (DABS(W(J)) .LE. ONE) SIN = W(J) IF (DABS(W(J)) .LE. ONE) COS = DSQRT(ONE-SIN**2) DO 30 I = 1, M TEMP = COS*A(I,J) + SIN*A(I,N) A(I,N) = -SIN*A(I,J) + COS*A(I,N) A(I,J) = TEMP 30 CONTINUE 40 CONTINUE 50 CONTINUE RETURN C C LAST CARD OF SUBROUTINE R1MPYQ. C END octave-1.1.0/libcruft/minpack/r1updt.f100666 415 17 13054 5274161721 16011 0ustar jweusers SUBROUTINE R1UPDT(M,N,S,LS,U,V,W,SING) INTEGER M,N,LS LOGICAL SING DOUBLE PRECISION S(LS),U(M),V(N),W(M) C ********** C C SUBROUTINE R1UPDT C C GIVEN AN M BY N LOWER TRAPEZOIDAL MATRIX S, AN M-VECTOR U, C AND AN N-VECTOR V, THE PROBLEM IS TO DETERMINE AN C ORTHOGONAL MATRIX Q SUCH THAT C C T C (S + U*V )*Q C C IS AGAIN LOWER TRAPEZOIDAL. C C THIS SUBROUTINE DETERMINES Q AS THE PRODUCT OF 2*(N - 1) C TRANSFORMATIONS C C GV(N-1)*...*GV(1)*GW(1)*...*GW(N-1) C C WHERE GV(I), GW(I) ARE GIVENS ROTATIONS IN THE (I,N) PLANE C WHICH ELIMINATE ELEMENTS IN THE I-TH AND N-TH PLANES, C RESPECTIVELY. Q ITSELF IS NOT ACCUMULATED, RATHER THE C INFORMATION TO RECOVER THE GV, GW ROTATIONS IS RETURNED. C C THE SUBROUTINE STATEMENT IS C C SUBROUTINE R1UPDT(M,N,S,LS,U,V,W,SING) C C WHERE C C M IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF ROWS OF S. C C N IS A POSITIVE INTEGER INPUT VARIABLE SET TO THE NUMBER C OF COLUMNS OF S. N MUST NOT EXCEED M. C C S IS AN ARRAY OF LENGTH LS. ON INPUT S MUST CONTAIN THE LOWER C TRAPEZOIDAL MATRIX S STORED BY COLUMNS. ON OUTPUT S CONTAINS C THE LOWER TRAPEZOIDAL MATRIX PRODUCED AS DESCRIBED ABOVE. C C LS IS A POSITIVE INTEGER INPUT VARIABLE NOT LESS THAN C (N*(2*M-N+1))/2. C C U IS AN INPUT ARRAY OF LENGTH M WHICH MUST CONTAIN THE C VECTOR U. C C V IS AN ARRAY OF LENGTH N. ON INPUT V MUST CONTAIN THE VECTOR C V. ON OUTPUT V(I) CONTAINS THE INFORMATION NECESSARY TO C RECOVER THE GIVENS ROTATION GV(I) DESCRIBED ABOVE. C C W IS AN OUTPUT ARRAY OF LENGTH M. W(I) CONTAINS INFORMATION C NECESSARY TO RECOVER THE GIVENS ROTATION GW(I) DESCRIBED C ABOVE. C C SING IS A LOGICAL OUTPUT VARIABLE. SING IS SET TRUE IF ANY C OF THE DIAGONAL ELEMENTS OF THE OUTPUT S ARE ZERO. OTHERWISE C V IS SET FALSE. C C SUBPROGRAMS CALLED C C MINPACK-SUPPLIED ... DPMPAR C C FORTRAN-SUPPLIED ... DABS,DSQRT C C MINPACK. VERSION OF DECEMBER 1978. C BURTON S. GARBOW, KENNETH E. HILLSTROM, JORGE J. MORE, C JOHN L. NAZARETH C C ********** INTEGER I,J,JJ,L,NMJ,NM1 DOUBLE PRECISION COS,COTAN,GIANT,ONE,P5,P25,SIN,TAN,TAU,TEMP, * ZERO DOUBLE PRECISION DPMPAR DATA ONE,P5,P25,ZERO /1.0D0,5.0D-1,2.5D-1,0.0D0/ C C GIANT IS THE LARGEST MAGNITUDE. C GIANT = DPMPAR(3) C C INITIALIZE THE DIAGONAL ELEMENT POINTER. C JJ = (N*(2*M - N + 1))/2 - (M - N) C C MOVE THE NONTRIVIAL PART OF THE LAST COLUMN OF S INTO W. C L = JJ DO 10 I = N, M W(I) = S(L) L = L + 1 10 CONTINUE C C ROTATE THE VECTOR V INTO A MULTIPLE OF THE N-TH UNIT VECTOR C IN SUCH A WAY THAT A SPIKE IS INTRODUCED INTO W. C NM1 = N - 1 IF (NM1 .LT. 1) GO TO 70 DO 60 NMJ = 1, NM1 J = N - NMJ JJ = JJ - (M - J + 1) W(J) = ZERO IF (V(J) .EQ. ZERO) GO TO 50 C C DETERMINE A GIVENS ROTATION WHICH ELIMINATES THE C J-TH ELEMENT OF V. C IF (DABS(V(N)) .GE. DABS(V(J))) GO TO 20 COTAN = V(N)/V(J) SIN = P5/DSQRT(P25+P25*COTAN**2) COS = SIN*COTAN TAU = ONE IF (DABS(COS)*GIANT .GT. ONE) TAU = ONE/COS GO TO 30 20 CONTINUE TAN = V(J)/V(N) COS = P5/DSQRT(P25+P25*TAN**2) SIN = COS*TAN TAU = SIN 30 CONTINUE C C APPLY THE TRANSFORMATION TO V AND STORE THE INFORMATION C NECESSARY TO RECOVER THE GIVENS ROTATION. C V(N) = SIN*V(J) + COS*V(N) V(J) = TAU C C APPLY THE TRANSFORMATION TO S AND EXTEND THE SPIKE IN W. C L = JJ DO 40 I = J, M TEMP = COS*S(L) - SIN*W(I) W(I) = SIN*S(L) + COS*W(I) S(L) = TEMP L = L + 1 40 CONTINUE 50 CONTINUE 60 CONTINUE 70 CONTINUE C C ADD THE SPIKE FROM THE RANK 1 UPDATE TO W. C DO 80 I = 1, M W(I) = W(I) + V(N)*U(I) 80 CONTINUE C C ELIMINATE THE SPIKE. C SING = .FALSE. IF (NM1 .LT. 1) GO TO 140 DO 130 J = 1, NM1 IF (W(J) .EQ. ZERO) GO TO 120 C C DETERMINE A GIVENS ROTATION WHICH ELIMINATES THE C J-TH ELEMENT OF THE SPIKE. C IF (DABS(S(JJ)) .GE. DABS(W(J))) GO TO 90 COTAN = S(JJ)/W(J) SIN = P5/DSQRT(P25+P25*COTAN**2) COS = SIN*COTAN TAU = ONE IF (DABS(COS)*GIANT .GT. ONE) TAU = ONE/COS GO TO 100 90 CONTINUE TAN = W(J)/S(JJ) COS = P5/DSQRT(P25+P25*TAN**2) SIN = COS*TAN TAU = SIN 100 CONTINUE C C APPLY THE TRANSFORMATION TO S AND REDUCE THE SPIKE IN W. C L = JJ DO 110 I = J, M TEMP = COS*S(L) + SIN*W(I) W(I) = -SIN*S(L) + COS*W(I) S(L) = TEMP L = L + 1 110 CONTINUE C C STORE THE INFORMATION NECESSARY TO RECOVER THE C GIVENS ROTATION. C W(J) = TAU 120 CONTINUE C C TEST FOR ZERO DIAGONAL ELEMENTS IN THE OUTPUT S. C IF (S(JJ) .EQ. ZERO) SING = .TRUE. JJ = JJ + (M - J + 1) 130 CONTINUE 140 CONTINUE C C MOVE W BACK INTO THE LAST COLUMN OF THE OUTPUT S. C L = JJ DO 150 I = N, M S(L) = W(I) L = L + 1 150 CONTINUE IF (S(JJ) .EQ. ZERO) SING = .TRUE. RETURN C C LAST CARD OF SUBROUTINE R1UPDT. C END octave-1.1.0/libcruft/misc/ 40777 415 17 0 5705521654 13620 5ustar jweusersoctave-1.1.0/libcruft/misc/Makefile.in100666 415 17 1204 5662226317 15757 0ustar jweusers# # Makefile for octave's libcruft/misc directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ SPECIAL = gen-d1mach.c d1mach-tst.for dostop.c SPECIAL_DEPEND = d1mach.o dostop.o DISTFILES = $(subst d1mach.f, , $(DISTFILES)) EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules d1mach.f: gen-d1mach ./gen-d1mach > d1mach.f # Don't optimize. XCC = $(patsubst -O%, , $(CC)) gen-d1mach: $(srcdir)/gen-d1mach.c $(XCC) -DDP -o gen-d1mach $(srcdir)/gen-d1mach.c -lm octave-1.1.0/libcruft/misc/i1mach.f100666 415 17 37364 5673465356 15275 0ustar jweusers INTEGER FUNCTION I1MACH(I) C C I/O UNIT NUMBERS. C C I1MACH( 1) = THE STANDARD INPUT UNIT. C C I1MACH( 2) = THE STANDARD OUTPUT UNIT. C C I1MACH( 3) = THE STANDARD PUNCH UNIT. C C I1MACH( 4) = THE STANDARD ERROR MESSAGE UNIT. C C WORDS. C C I1MACH( 5) = THE NUMBER OF BITS PER INTEGER STORAGE UNIT. C C I1MACH( 6) = THE NUMBER OF CHARACTERS PER CHARACTER STORAGE UNIT. C FOR FORTRAN 77, THIS IS ALWAYS 1. FOR FORTRAN 66, C CHARACTER STORAGE UNIT = INTEGER STORAGE UNIT. C C INTEGERS. C C ASSUME INTEGERS ARE REPRESENTED IN THE S-DIGIT, BASE-A FORM C C SIGN ( X(S-1)*A**(S-1) + ... + X(1)*A + X(0) ) C C WHERE 0 .LE. X(I) .LT. A FOR I=0,...,S-1. C C I1MACH( 7) = A, THE BASE. C C I1MACH( 8) = S, THE NUMBER OF BASE-A DIGITS. C C I1MACH( 9) = A**S - 1, THE LARGEST MAGNITUDE. C C FLOATING-POINT NUMBERS. C C ASSUME FLOATING-POINT NUMBERS ARE REPRESENTED IN THE T-DIGIT, C BASE-B FORM C C SIGN (B**E)*( (X(1)/B) + ... + (X(T)/B**T) ) C C WHERE 0 .LE. X(I) .LT. B FOR I=1,...,T, C 0 .LT. X(1), AND EMIN .LE. E .LE. EMAX. C C I1MACH(10) = B, THE BASE. C C SINGLE-PRECISION C C I1MACH(11) = T, THE NUMBER OF BASE-B DIGITS. C C I1MACH(12) = EMIN, THE SMALLEST EXPONENT E. C C I1MACH(13) = EMAX, THE LARGEST EXPONENT E. C C DOUBLE-PRECISION C C I1MACH(14) = T, THE NUMBER OF BASE-B DIGITS. C C I1MACH(15) = EMIN, THE SMALLEST EXPONENT E. C C I1MACH(16) = EMAX, THE LARGEST EXPONENT E. C C TO ALTER THIS FUNCTION FOR A PARTICULAR ENVIRONMENT, C THE DESIRED SET OF DATA STATEMENTS SHOULD BE ACTIVATED BY C REMOVING THE C FROM COLUMN 1. ALSO, THE VALUES OF C I1MACH(1) - I1MACH(4) SHOULD BE CHECKED FOR CONSISTENCY C WITH THE LOCAL OPERATING SYSTEM. FOR FORTRAN 77, YOU MAY WISH C TO ADJUST THE DATA STATEMENT SO IMACH(6) IS SET TO 1, AND C THEN TO COMMENT OUT THE EXECUTABLE TEST ON I .EQ. 6 BELOW. C ON RARE MACHINES A STATIC STATEMENT MAY NEED TO BE ADDED. C (BUT PROBABLY MORE SYSTEMS PROHIBIT IT THAN REQUIRE IT.) C C FOR IEEE-ARITHMETIC MACHINES (BINARY STANDARD), THE FIRST C SET OF CONSTANTS BELOW SHOULD BE APPROPRIATE, EXCEPT PERHAPS C FOR IMACH(1) - IMACH(4). C INTEGER IMACH(16),OUTPUT,SANITY C EQUIVALENCE (IMACH(4),OUTPUT) C C MACHINE CONSTANTS FOR IEEE ARITHMETIC MACHINES, SUCH AS THE AT&T C 3B SERIES, MOTOROLA 68000 BASED MACHINES (E.G. SUN 3 AND AT&T C PC 7300), AND 8087 BASED MICROS (E.G. IBM PC AND AT&T 6300). C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / 2147483647 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -125 / C DATA IMACH(13) / 128 / C DATA IMACH(14) / 53 / C DATA IMACH(15) / -1021 / C DATA IMACH(16) / 1024 /, SANITY/987/ C C MACHINE CONSTANTS FOR AMDAHL MACHINES. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / 2147483647 / C DATA IMACH(10) / 16 / C DATA IMACH(11) / 6 / C DATA IMACH(12) / -64 / C DATA IMACH(13) / 63 / C DATA IMACH(14) / 14 / C DATA IMACH(15) / -64 / C DATA IMACH(16) / 63 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE BURROUGHS 1700 SYSTEM. C C DATA IMACH( 1) / 7 / C DATA IMACH( 2) / 2 / C DATA IMACH( 3) / 2 / C DATA IMACH( 4) / 2 / C DATA IMACH( 5) / 36 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 33 / C DATA IMACH( 9) / Z1FFFFFFFF / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -256 / C DATA IMACH(13) / 255 / C DATA IMACH(14) / 60 / C DATA IMACH(15) / -256 / C DATA IMACH(16) / 255 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE BURROUGHS 5700 SYSTEM. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 48 / C DATA IMACH( 6) / 6 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 39 / C DATA IMACH( 9) / O0007777777777777 / C DATA IMACH(10) / 8 / C DATA IMACH(11) / 13 / C DATA IMACH(12) / -50 / C DATA IMACH(13) / 76 / C DATA IMACH(14) / 26 / C DATA IMACH(15) / -50 / C DATA IMACH(16) / 76 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE BURROUGHS 6700/7700 SYSTEMS. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 48 / C DATA IMACH( 6) / 6 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 39 / C DATA IMACH( 9) / O0007777777777777 / C DATA IMACH(10) / 8 / C DATA IMACH(11) / 13 / C DATA IMACH(12) / -50 / C DATA IMACH(13) / 76 / C DATA IMACH(14) / 26 / C DATA IMACH(15) / -32754 / C DATA IMACH(16) / 32780 /, SANITY/987/ C C MACHINE CONSTANTS FOR FTN4 ON THE CDC 6000/7000 SERIES. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 60 / C DATA IMACH( 6) / 10 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 48 / C DATA IMACH( 9) / 00007777777777777777B / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 47 / C DATA IMACH(12) / -929 / C DATA IMACH(13) / 1070 / C DATA IMACH(14) / 94 / C DATA IMACH(15) / -929 / C DATA IMACH(16) / 1069 /, SANITY/987/ C C MACHINE CONSTANTS FOR FTN5 ON THE CDC 6000/7000 SERIES. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 60 / C DATA IMACH( 6) / 10 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 48 / C DATA IMACH( 9) / O"00007777777777777777" / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 47 / C DATA IMACH(12) / -929 / C DATA IMACH(13) / 1070 / C DATA IMACH(14) / 94 / C DATA IMACH(15) / -929 / C DATA IMACH(16) / 1069 /, SANITY/987/ C C MACHINE CONSTANTS FOR CONVEX C-1. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / 2147483647 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -128 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 53 / C DATA IMACH(15) /-1024 / C DATA IMACH(16) / 1023 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE CRAY 1, XMP, 2, AND 3. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 102 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 64 / C DATA IMACH( 6) / 8 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 63 / C DATA IMACH( 9) / 777777777777777777777B / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 47 / C DATA IMACH(12) / -8189 / C DATA IMACH(13) / 8190 / C DATA IMACH(14) / 94 / C DATA IMACH(15) / -8099 / C DATA IMACH(16) / 8190 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE DATA GENERAL ECLIPSE S/200. C C DATA IMACH( 1) / 11 / C DATA IMACH( 2) / 12 / C DATA IMACH( 3) / 8 / C DATA IMACH( 4) / 10 / C DATA IMACH( 5) / 16 / C DATA IMACH( 6) / 2 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 15 / C DATA IMACH( 9) /32767 / C DATA IMACH(10) / 16 / C DATA IMACH(11) / 6 / C DATA IMACH(12) / -64 / C DATA IMACH(13) / 63 / C DATA IMACH(14) / 14 / C DATA IMACH(15) / -64 / C DATA IMACH(16) / 63 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE HARRIS SLASH 6 AND SLASH 7. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 0 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 24 / C DATA IMACH( 6) / 3 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 23 / C DATA IMACH( 9) / 8388607 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 23 / C DATA IMACH(12) / -127 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 38 / C DATA IMACH(15) / -127 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE HONEYWELL DPS 8/70 SERIES. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 43 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 36 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 35 / C DATA IMACH( 9) / O377777777777 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 27 / C DATA IMACH(12) / -127 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 63 / C DATA IMACH(15) / -127 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE IBM 360/370 SERIES, C THE XEROX SIGMA 5/7/9 AND THE SEL SYSTEMS 85/86. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / Z7FFFFFFF / C DATA IMACH(10) / 16 / C DATA IMACH(11) / 6 / C DATA IMACH(12) / -64 / C DATA IMACH(13) / 63 / C DATA IMACH(14) / 14 / C DATA IMACH(15) / -64 / C DATA IMACH(16) / 63 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE INTERDATA 8/32 C WITH THE UNIX SYSTEM FORTRAN 77 COMPILER. C C FOR THE INTERDATA FORTRAN VII COMPILER REPLACE C THE Z'S SPECIFYING HEX CONSTANTS WITH Y'S. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 6 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / Z'7FFFFFFF' / C DATA IMACH(10) / 16 / C DATA IMACH(11) / 6 / C DATA IMACH(12) / -64 / C DATA IMACH(13) / 62 / C DATA IMACH(14) / 14 / C DATA IMACH(15) / -64 / C DATA IMACH(16) / 62 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE PDP-10 (KA PROCESSOR). C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 36 / C DATA IMACH( 6) / 5 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 35 / C DATA IMACH( 9) / "377777777777 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 27 / C DATA IMACH(12) / -128 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 54 / C DATA IMACH(15) / -101 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE PDP-10 (KI PROCESSOR). C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 36 / C DATA IMACH( 6) / 5 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 35 / C DATA IMACH( 9) / "377777777777 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 27 / C DATA IMACH(12) / -128 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 62 / C DATA IMACH(15) / -128 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR PDP-11 FORTRANS SUPPORTING C 32-BIT INTEGER ARITHMETIC. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / 2147483647 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -127 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 56 / C DATA IMACH(15) / -127 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR PDP-11 FORTRANS SUPPORTING C 16-BIT INTEGER ARITHMETIC. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 16 / C DATA IMACH( 6) / 2 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 15 / C DATA IMACH( 9) / 32767 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -127 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 56 / C DATA IMACH(15) / -127 / C DATA IMACH(16) / 127 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE PRIME 50 SERIES SYSTEMS C WTIH 32-BIT INTEGERS AND 64V MODE INSTRUCTIONS, C SUPPLIED BY IGOR BRAY. C C DATA IMACH( 1) / 1 / C DATA IMACH( 2) / 1 / C DATA IMACH( 3) / 2 / C DATA IMACH( 4) / 1 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 4 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / :17777777777 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 23 / C DATA IMACH(12) / -127 / C DATA IMACH(13) / +127 / C DATA IMACH(14) / 47 / C DATA IMACH(15) / -32895 / C DATA IMACH(16) / +32637 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE SEQUENT BALANCE 8000. C C DATA IMACH( 1) / 0 / C DATA IMACH( 2) / 0 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 0 / C DATA IMACH( 5) / 32 / C DATA IMACH( 6) / 1 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 31 / C DATA IMACH( 9) / 2147483647 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 24 / C DATA IMACH(12) / -125 / C DATA IMACH(13) / 128 / C DATA IMACH(14) / 53 / C DATA IMACH(15) / -1021 / C DATA IMACH(16) / 1024 /, SANITY/987/ C C MACHINE CONSTANTS FOR THE UNIVAC 1100 SERIES. C C NOTE THAT THE PUNCH UNIT, I1MACH(3), HAS BEEN SET TO 7 C WHICH IS APPROPRIATE FOR THE UNIVAC-FOR SYSTEM. C IF YOU HAVE THE UNIVAC-FTN SYSTEM, SET IT TO 1. C C DATA IMACH( 1) / 5 / C DATA IMACH( 2) / 6 / C DATA IMACH( 3) / 7 / C DATA IMACH( 4) / 6 / C DATA IMACH( 5) / 36 / C DATA IMACH( 6) / 6 / C DATA IMACH( 7) / 2 / C DATA IMACH( 8) / 35 / C DATA IMACH( 9) / O377777777777 / C DATA IMACH(10) / 2 / C DATA IMACH(11) / 27 / C DATA IMACH(12) / -128 / C DATA IMACH(13) / 127 / C DATA IMACH(14) / 60 / C DATA IMACH(15) /-1024 / C DATA IMACH(16) / 1023 /, SANITY/987/ C C MACHINE CONSTANTS FOR VAX. C DATA IMACH( 1) / 5 / DATA IMACH( 2) / 6 / DATA IMACH( 3) / 7 / DATA IMACH( 4) / 6 / DATA IMACH( 5) / 32 / DATA IMACH( 6) / 4 / DATA IMACH( 7) / 2 / DATA IMACH( 8) / 31 / DATA IMACH( 9) / 2147483647 / DATA IMACH(10) / 2 / DATA IMACH(11) / 24 / DATA IMACH(12) / -127 / DATA IMACH(13) / 127 / DATA IMACH(14) / 56 / DATA IMACH(15) / -127 / DATA IMACH(16) / 127 /, SANITY/987/ C C *** ISSUE STOP 777 IF ALL DATA STATEMENTS ARE COMMENTED... IF (SANITY .NE. 987) STOP 777 IF (I .LT. 1 .OR. I .GT. 16) GO TO 10 C I1MACH = IMACH(I) C/6S C/7S IF(I.EQ.6) I1MACH=1 C/ RETURN 10 WRITE(OUTPUT,1999) I 1999 FORMAT(' I1MACH - I OUT OF BOUNDS',I10) CALL XSTOPX (' ') I1MACH = 0 END octave-1.1.0/libcruft/misc/xstopx.f100666 415 17 400 5406471667 15411 0ustar jweusers subroutine xstopx (string) character *(*) string integer slen slen = len (string) if (slen .eq. 0) goto 9999 if (slen .eq. 1 .and. string(1:1) .eq. ' ') goto 9999 write (*, *) string 9999 call dostop () end octave-1.1.0/libcruft/misc/gen-d1mach.c100666 415 17 25205 5673465355 16022 0ustar jweusers/* This file combines the single and double precision versions of machar, selected by cc -DSP or cc -DDP. This feature provided by D. G. Hough, August 3, 1988. */ #ifdef SP #define REAL float #define ZERO 0.0 #define ONE 1.0 #define PREC "Single " #define REALSIZE 1 #endif #ifdef DP #define REAL double #define ZERO 0.0e0 #define ONE 1.0e0 #define PREC "Double " #define REALSIZE 2 #endif #include #include #define ABS(xxx) ((xxx>ZERO)?(xxx):(-xxx)) void rmachar(ibeta,it,irnd,ngrd,machep,negep,iexp,minexp, maxexp,eps,epsneg,xmin,xmax) int *ibeta,*iexp,*irnd,*it,*machep,*maxexp,*minexp,*negep,*ngrd; REAL *eps,*epsneg,*xmax,*xmin; /* This subroutine is intended to determine the parameters of the floating-point arithmetic system specified below. The determination of the first three uses an extension of an algorithm due to M. Malcolm, CACM 15 (1972), pp. 949-951, incorporating some, but not all, of the improvements suggested by M. Gentleman and S. Marovich, CACM 17 (1974), pp. 276-277. An earlier version of this program was published in the book Software Manual for the Elementary Functions by W. J. Cody and W. Waite, Prentice-Hall, Englewood Cliffs, NJ, 1980. The present program is a translation of the Fortran 77 program in W. J. Cody, "MACHAR: A subroutine to dynamically determine machine parameters". TOMS (14), 1988. Parameter values reported are as follows: ibeta - the radix for the floating-point representation it - the number of base ibeta digits in the floating-point significand irnd - 0 if floating-point addition chops 1 if floating-point addition rounds, but not in the IEEE style 2 if floating-point addition rounds in the IEEE style 3 if floating-point addition chops, and there is partial underflow 4 if floating-point addition rounds, but not in the IEEE style, and there is partial underflow 5 if floating-point addition rounds in the IEEE style, and there is partial underflow ngrd - the number of guard digits for multiplication with truncating arithmetic. It is 0 if floating-point arithmetic rounds, or if it truncates and only it base ibeta digits participate in the post-normalization shift of the floating-point significand in multiplication; 1 if floating-point arithmetic truncates and more than it base ibeta digits participate in the post-normalization shift of the floating-point significand in multiplication. machep - the largest negative integer such that 1.0+FLOAT(ibeta)**machep .NE. 1.0, except that machep is bounded below by -(it+3) negeps - the largest negative integer such that 1.0-FLOAT(ibeta)**negeps .NE. 1.0, except that negeps is bounded below by -(it+3) iexp - the number of bits (decimal places if ibeta = 10) reserved for the representation of the exponent (including the bias or sign) of a floating-point number minexp - the largest in magnitude negative integer such that FLOAT(ibeta)**minexp is positive and normalized maxexp - the smallest positive power of BETA that overflows eps - the smallest positive floating-point number such that 1.0+eps .NE. 1.0. In particular, if either ibeta = 2 or IRND = 0, eps = FLOAT(ibeta)**machep. Otherwise, eps = (FLOAT(ibeta)**machep)/2 epsneg - A small positive floating-point number such that 1.0-epsneg .NE. 1.0. In particular, if ibeta = 2 or IRND = 0, epsneg = FLOAT(ibeta)**negeps. Otherwise, epsneg = (ibeta**negeps)/2. Because negeps is bounded below by -(it+3), epsneg may not be the smallest number that can alter 1.0 by subtraction. xmin - the smallest non-vanishing normalized floating-point power of the radix, i.e., xmin = FLOAT(ibeta)**minexp xmax - the largest finite floating-point number. In particular xmax = (1.0-epsneg)*FLOAT(ibeta)**maxexp Note - on some machines xmax will be only the second, or perhaps third, largest number, being too small by 1 or 2 units in the last digit of the significand. Latest revision - August 4, 1988 Author - W. J. Cody Argonne National Laboratory */ { int i,iz,j,k; int mx,itmp,nxres; REAL a,b,beta,betain,one,y,z,zero; REAL betah,t,tmp,tmpa,tmp1,two; (*irnd) = 1; one = (REAL)(*irnd); two = one + one; a = two; b = a; zero = 0.0e0; /* determine ibeta,beta ala malcolm */ tmp = ((a+one)-a)-one; while (tmp == zero) { a = a+a; tmp = a+one; tmp1 = tmp-a; tmp = tmp1-one; } tmp = a+b; itmp = (int)(tmp-a); while (itmp == 0) { b = b+b; tmp = a+b; itmp = (int)(tmp-a); } *ibeta = itmp; beta = (REAL)(*ibeta); /* determine irnd, it */ (*it) = 0; b = one; tmp = ((b+one)-b)-one; while (tmp == zero) { *it = *it+1; b = b*beta; tmp = b+one; tmp1 = tmp-b; tmp = tmp1-one; } *irnd = 0; betah = beta/two; tmp = a+betah; tmp1 = tmp-a; if (tmp1 != zero) *irnd = 1; tmpa = a+beta; tmp = tmpa+betah; if ((*irnd == 0) && (tmp-tmpa != zero)) *irnd = 2; /* determine negep, epsneg */ (*negep) = (*it) + 3; betain = one / beta; a = one; for (i = 1; i<=(*negep); i++) { a = a * betain; } b = a; tmp = (one-a); tmp = tmp-one; while (tmp == zero) { a = a*beta; *negep = *negep-1; tmp1 = one-a; tmp = tmp1-one; } (*negep) = -(*negep); (*epsneg) = a; /* determine machep, eps */ (*machep) = -(*it) - 3; a = b; tmp = one+a; while (tmp-one == zero) { a = a*beta; *machep = *machep+1; tmp = one+a; } *eps = a; /* determine ngrd */ (*ngrd) = 0; tmp = one+*eps; tmp = tmp*one; if (((*irnd) == 0) && (tmp-one) != zero) (*ngrd) = 1; /* determine iexp, minexp, xmin loop to determine largest i such that (1/beta) ** (2**(i)) does not underflow. exit from loop is signaled by an underflow. */ i = 0; k = 1; z = betain; t = one+*eps; nxres = 0; for (;;) { y = z; z = y * y; /* check for underflow */ a = z * one; tmp = z*t; if ((a+a == zero) || (ABS(z) > y)) break; tmp1 = tmp*betain; if (tmp1*beta == z) break; i = i + 1; k = k+k; } /* determine k such that (1/beta)**k does not underflow first set k = 2 ** i */ (*iexp) = i + 1; mx = k + k; if (*ibeta == 10) { /* for decimal machines only */ (*iexp) = 2; iz = *ibeta; while (k >= iz) { iz = iz * (*ibeta); (*iexp) = (*iexp) + 1; } mx = iz + iz - 1; } /* loop to determine minexp, xmin. exit from loop is signaled by an underflow. */ for (;;) { (*xmin) = y; y = y * betain; a = y * one; tmp = y*t; tmp1 = a+a; if ((tmp1 == zero) || (ABS(y) >= (*xmin))) break; k = k + 1; tmp1 = tmp*betain; tmp1 = tmp1*beta; if ((tmp1 == y) && (tmp != y)) { nxres = 3; *xmin = y; break; } } (*minexp) = -k; /* determine maxexp, xmax */ if ((mx <= k+k-3) && ((*ibeta) != 10)) { mx = mx + mx; (*iexp) = (*iexp) + 1; } (*maxexp) = mx + (*minexp); /* Adjust *irnd to reflect partial underflow. */ (*irnd) = (*irnd)+nxres; /* Adjust for IEEE style machines. */ if ((*irnd) >= 2) (*maxexp) = (*maxexp)-2; /* adjust for machines with implicit leading bit in binary significand and machines with radix point at extreme right of significand. */ i = (*maxexp) + (*minexp); if (((*ibeta) == 2) && (i == 0)) (*maxexp) = (*maxexp) - 1; if (i > 20) (*maxexp) = (*maxexp) - 1; if (a != y) (*maxexp) = (*maxexp) - 2; (*xmax) = one - (*epsneg); tmp = (*xmax)*one; if (tmp != (*xmax)) (*xmax) = one - beta * (*epsneg); (*xmax) = (*xmax) / (beta * beta * beta * (*xmin)); i = (*maxexp) + (*minexp) + 3; if (i > 0) { for (j = 1; j<=i; j++ ) { if ((*ibeta) == 2) (*xmax) = (*xmax) + (*xmax); if ((*ibeta) != 2) (*xmax) = (*xmax) * beta; } } return; } typedef union { double d; int i[2]; } equiv; int main (void) { /* Works for 32 bit machines with 32 bit ints and 64 bit doubles */ int ibeta, iexp, irnd, it, machep, maxexp, minexp, negep, ngrd; REAL eps, epsneg, xmax, xmin; int i; equiv flt_params[6]; rmachar (&ibeta, &it, &irnd, &ngrd, &machep, &negep, &iexp, &minexp, &maxexp, &eps, &epsneg, &xmin, &xmax); flt_params[1].d = xmin; flt_params[2].d = xmax; flt_params[3].d = epsneg; flt_params[4].d = eps; flt_params[5].d = log10 ((double) ibeta); printf ("* d1mach.f Do not edit. Generated automatically by gen-d1mach.c\n\ double precision function d1mach(i)\n\ integer i\n\ integer i1var (2)\n\ integer i2var (2)\n\ integer i3var (2)\n\ integer i4var (2)\n\ integer i5var (2)\n\ double precision dmach(5)\n\ equivalence (dmach(1), i1var(1))\n\ equivalence (dmach(2), i2var(1))\n\ equivalence (dmach(3), i3var(1))\n\ equivalence (dmach(4), i4var(1))\n\ equivalence (dmach(5), i5var(1))\n"); for (i = 1; i < 6; i++) printf (" data i%dvar(1), i%dvar(2) / %ld , %ld /\n", i, i, flt_params[i].i[0], flt_params[i].i[1]); printf (" if (i .lt. 1 .or. i .gt. 5) goto 999\n\ d1mach = dmach(i)\n\ return\n\ 999 write(*,1999) i\n\ 1999 format(' d1mach - i out of bounds', i10)\n\ call xstopx (' ')\n\ d1mach = 0\n\ end\n"); return 0; } octave-1.1.0/libcruft/misc/d1mach-tst.for100666 415 17 213 5274446300 16341 0ustar jweusers program main integer i double precision d1mach do 10 i = 1, 5 print *, d1mach (i) 10 continue end octave-1.1.0/libcruft/misc/dostop.c100666 415 17 3156 5513700423 15364 0ustar jweusers/* dostop.c -*- C -*- */ /* Copyright (C) 1992, 1993 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include /* * All the STOP statements in the Fortran routines have been replaced * with a call to XSTOPX, defined in the file libcruft/misc/xstopx.f. * * The XSTOPX function calls this function, which will send a SIGINT * signal to the program that invoked it. * * Octave\'s SIGINT signal handler calls jump_to_top_level(), and the * user will end up at the top level instead of the shell prompt. * * Programs that don\'t handle SIGINT will be interrupted. */ volatile void #if defined (F77_APPEND_UNDERSCORE) dostop_ (void) #else dostop (void) #endif { kill (getpid (), SIGINT); abort (); } /* ;;; Local Variables: *** ;;; mode: C *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/libcruft/npsol/ 40777 415 17 0 5705521656 14022 5ustar jweusersoctave-1.1.0/libcruft/npsol/Makefile.in100666 415 17 524 5662226320 16135 0ustar jweusers# # Makefile for octave's libcruft/npsol directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = Makefile.in README.MISSING include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/npsol/README.MISSING100666 415 17 1106 5300576516 16101 0ustar jweusersIf it were freely redistributable, the source for Gill and Murray's nonlinear programming solver NPSOL would be in this directory. Unfortunately, if you want octave to use NPSOL to solve constrained nonlinear optimization problems, you must get the source from the Stanford Office of Technology Licensing: Stanford University Office of Technology Licensing 857 Serra Street Stanford CA 94305-7295 USA Tel: (415) 723-0651 Fax: (415) 725-7295 As of April, 1992, the license fee for NPSOL was $3600 for commercial sites and $400 for academic and US Government sites. octave-1.1.0/libcruft/odepack/ 40777 415 17 0 5705521660 14270 5ustar jweusersoctave-1.1.0/libcruft/odepack/Makefile.in100666 415 17 510 5662226313 16405 0ustar jweusers# # Makefile for octave's libcruft/odepack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/odepack/cfode.f100666 415 17 10271 5501527344 15634 0ustar jweusers SUBROUTINE CFODE (METH, ELCO, TESCO) CLLL. OPTIMIZE INTEGER METH INTEGER I, IB, NQ, NQM1, NQP1 DOUBLE PRECISION ELCO, TESCO DOUBLE PRECISION AGAMQ, FNQ, FNQM1, PC, PINT, RAGQ, 1 RQFAC, RQ1FAC, TSIGN, XPIN DIMENSION ELCO(13,12), TESCO(3,12) C----------------------------------------------------------------------- C CFODE IS CALLED BY THE INTEGRATOR ROUTINE TO SET COEFFICIENTS C NEEDED THERE. THE COEFFICIENTS FOR THE CURRENT METHOD, AS C GIVEN BY THE VALUE OF METH, ARE SET FOR ALL ORDERS AND SAVED. C THE MAXIMUM ORDER ASSUMED HERE IS 12 IF METH = 1 AND 5 IF METH = 2. C (A SMALLER VALUE OF THE MAXIMUM ORDER IS ALSO ALLOWED.) C CFODE IS CALLED ONCE AT THE BEGINNING OF THE PROBLEM, C AND IS NOT CALLED AGAIN UNLESS AND UNTIL METH IS CHANGED. C C THE ELCO ARRAY CONTAINS THE BASIC METHOD COEFFICIENTS. C THE COEFFICIENTS EL(I), 1 .LE. I .LE. NQ+1, FOR THE METHOD OF C ORDER NQ ARE STORED IN ELCO(I,NQ). THEY ARE GIVEN BY A GENETRATING C POLYNOMIAL, I.E., C L(X) = EL(1) + EL(2)*X + ... + EL(NQ+1)*X**NQ. C FOR THE IMPLICIT ADAMS METHODS, L(X) IS GIVEN BY C DL/DX = (X+1)*(X+2)*...*(X+NQ-1)/FACTORIAL(NQ-1), L(-1) = 0. C FOR THE BDF METHODS, L(X) IS GIVEN BY C L(X) = (X+1)*(X+2)* ... *(X+NQ)/K, C WHERE K = FACTORIAL(NQ)*(1 + 1/2 + ... + 1/NQ). C C THE TESCO ARRAY CONTAINS TEST CONSTANTS USED FOR THE C LOCAL ERROR TEST AND THE SELECTION OF STEP SIZE AND/OR ORDER. C AT ORDER NQ, TESCO(K,NQ) IS USED FOR THE SELECTION OF STEP C SIZE AT ORDER NQ - 1 IF K = 1, AT ORDER NQ IF K = 2, AND AT ORDER C NQ + 1 IF K = 3. C----------------------------------------------------------------------- DIMENSION PC(12) C GO TO (100, 200), METH C 100 ELCO(1,1) = 1.0D0 ELCO(2,1) = 1.0D0 TESCO(1,1) = 0.0D0 TESCO(2,1) = 2.0D0 TESCO(1,2) = 1.0D0 TESCO(3,12) = 0.0D0 PC(1) = 1.0D0 RQFAC = 1.0D0 DO 140 NQ = 2,12 C----------------------------------------------------------------------- C THE PC ARRAY WILL CONTAIN THE COEFFICIENTS OF THE POLYNOMIAL C P(X) = (X+1)*(X+2)*...*(X+NQ-1). C INITIALLY, P(X) = 1. C----------------------------------------------------------------------- RQ1FAC = RQFAC RQFAC = RQFAC/DBLE(NQ) NQM1 = NQ - 1 FNQM1 = DBLE(NQM1) NQP1 = NQ + 1 C FORM COEFFICIENTS OF P(X)*(X+NQ-1). ---------------------------------- PC(NQ) = 0.0D0 DO 110 IB = 1,NQM1 I = NQP1 - IB 110 PC(I) = PC(I-1) + FNQM1*PC(I) PC(1) = FNQM1*PC(1) C COMPUTE INTEGRAL, -1 TO 0, OF P(X) AND X*P(X). ----------------------- PINT = PC(1) XPIN = PC(1)/2.0D0 TSIGN = 1.0D0 DO 120 I = 2,NQ TSIGN = -TSIGN PINT = PINT + TSIGN*PC(I)/DBLE(I) 120 XPIN = XPIN + TSIGN*PC(I)/DBLE(I+1) C STORE COEFFICIENTS IN ELCO AND TESCO. -------------------------------- ELCO(1,NQ) = PINT*RQ1FAC ELCO(2,NQ) = 1.0D0 DO 130 I = 2,NQ 130 ELCO(I+1,NQ) = RQ1FAC*PC(I)/DBLE(I) AGAMQ = RQFAC*XPIN RAGQ = 1.0D0/AGAMQ TESCO(2,NQ) = RAGQ IF (NQ .LT. 12) TESCO(1,NQP1) = RAGQ*RQFAC/DBLE(NQP1) TESCO(3,NQM1) = RAGQ 140 CONTINUE RETURN C 200 PC(1) = 1.0D0 RQ1FAC = 1.0D0 DO 230 NQ = 1,5 C----------------------------------------------------------------------- C THE PC ARRAY WILL CONTAIN THE COEFFICIENTS OF THE POLYNOMIAL C P(X) = (X+1)*(X+2)*...*(X+NQ). C INITIALLY, P(X) = 1. C----------------------------------------------------------------------- FNQ = DBLE(NQ) NQP1 = NQ + 1 C FORM COEFFICIENTS OF P(X)*(X+NQ). ------------------------------------ PC(NQP1) = 0.0D0 DO 210 IB = 1,NQ I = NQ + 2 - IB 210 PC(I) = PC(I-1) + FNQ*PC(I) PC(1) = FNQ*PC(1) C STORE COEFFICIENTS IN ELCO AND TESCO. -------------------------------- DO 220 I = 1,NQP1 220 ELCO(I,NQ) = PC(I)/PC(2) ELCO(2,NQ) = 1.0D0 TESCO(1,NQ) = RQ1FAC TESCO(2,NQ) = DBLE(NQP1)/ELCO(1,NQ) TESCO(3,NQ) = DBLE(NQ+2)/ELCO(1,NQ) RQ1FAC = RQ1FAC/FNQ 230 CONTINUE RETURN C----------------------- END OF SUBROUTINE CFODE ----------------------- END octave-1.1.0/libcruft/odepack/ewset.f100666 415 17 2106 5501527250 15655 0ustar jweusers SUBROUTINE EWSET (N, ITOL, RTOL, ATOL, YCUR, EWT) CLLL. OPTIMIZE C----------------------------------------------------------------------- C THIS SUBROUTINE SETS THE ERROR WEIGHT VECTOR EWT ACCORDING TO C EWT(I) = RTOL(I)*ABS(YCUR(I)) + ATOL(I), I = 1,...,N, C WITH THE SUBSCRIPT ON RTOL AND/OR ATOL POSSIBLY REPLACED BY 1 ABOVE, C DEPENDING ON THE VALUE OF ITOL. C----------------------------------------------------------------------- INTEGER N, ITOL INTEGER I DOUBLE PRECISION RTOL, ATOL, YCUR, EWT DIMENSION RTOL(1), ATOL(1), YCUR(N), EWT(N) C GO TO (10, 20, 30, 40), ITOL 10 CONTINUE DO 15 I = 1,N 15 EWT(I) = RTOL(1)*DABS(YCUR(I)) + ATOL(1) RETURN 20 CONTINUE DO 25 I = 1,N 25 EWT(I) = RTOL(1)*DABS(YCUR(I)) + ATOL(I) RETURN 30 CONTINUE DO 35 I = 1,N 35 EWT(I) = RTOL(I)*DABS(YCUR(I)) + ATOL(1) RETURN 40 CONTINUE DO 45 I = 1,N 45 EWT(I) = RTOL(I)*DABS(YCUR(I)) + ATOL(I) RETURN C----------------------- END OF SUBROUTINE EWSET ----------------------- END octave-1.1.0/libcruft/odepack/intdy.f100666 415 17 6147 5501527256 15674 0ustar jweusers SUBROUTINE INTDY (T, K, YH, NYH, DKY, IFLAG) CLLL. OPTIMIZE INTEGER K, NYH, IFLAG INTEGER IOWND, IOWNS, 1 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 2 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU INTEGER I, IC, J, JB, JB2, JJ, JJ1, JP1 DOUBLE PRECISION T, YH, DKY DOUBLE PRECISION ROWNS, 1 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND DOUBLE PRECISION C, R, S, TP DIMENSION YH(NYH,1), DKY(1) COMMON /LS0001/ ROWNS(209), 2 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND, 3 IOWND(14), IOWNS(6), 4 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 5 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU C----------------------------------------------------------------------- C INTDY COMPUTES INTERPOLATED VALUES OF THE K-TH DERIVATIVE OF THE C DEPENDENT VARIABLE VECTOR Y, AND STORES IT IN DKY. THIS ROUTINE C IS CALLED WITHIN THE PACKAGE WITH K = 0 AND T = TOUT, BUT MAY C ALSO BE CALLED BY THE USER FOR ANY K UP TO THE CURRENT ORDER. C (SEE DETAILED INSTRUCTIONS IN THE USAGE DOCUMENTATION.) C----------------------------------------------------------------------- C THE COMPUTED VALUES IN DKY ARE GOTTEN BY INTERPOLATION USING THE C NORDSIECK HISTORY ARRAY YH. THIS ARRAY CORRESPONDS UNIQUELY TO A C VECTOR-VALUED POLYNOMIAL OF DEGREE NQCUR OR LESS, AND DKY IS SET C TO THE K-TH DERIVATIVE OF THIS POLYNOMIAL AT T. C THE FORMULA FOR DKY IS.. C Q C DKY(I) = SUM C(J,K) * (T - TN)**(J-K) * H**(-J) * YH(I,J+1) C J=K C WHERE C(J,K) = J*(J-1)*...*(J-K+1), Q = NQCUR, TN = TCUR, H = HCUR. C THE QUANTITIES NQ = NQCUR, L = NQ+1, N = NEQ, TN, AND H ARE C COMMUNICATED BY COMMON. THE ABOVE SUM IS DONE IN REVERSE ORDER. C IFLAG IS RETURNED NEGATIVE IF EITHER K OR T IS OUT OF BOUNDS. C----------------------------------------------------------------------- IFLAG = 0 IF (K .LT. 0 .OR. K .GT. NQ) GO TO 80 TP = TN - HU - 100.0D0*UROUND*(TN + HU) IF ((T-TP)*(T-TN) .GT. 0.0D0) GO TO 90 C S = (T - TN)/H IC = 1 IF (K .EQ. 0) GO TO 15 JJ1 = L - K DO 10 JJ = JJ1,NQ 10 IC = IC*JJ 15 C = DBLE(IC) DO 20 I = 1,N 20 DKY(I) = C*YH(I,L) IF (K .EQ. NQ) GO TO 55 JB2 = NQ - K DO 50 JB = 1,JB2 J = NQ - JB JP1 = J + 1 IC = 1 IF (K .EQ. 0) GO TO 35 JJ1 = JP1 - K DO 30 JJ = JJ1,J 30 IC = IC*JJ 35 C = DBLE(IC) DO 40 I = 1,N 40 DKY(I) = C*YH(I,JP1) + S*DKY(I) 50 CONTINUE IF (K .EQ. 0) RETURN 55 R = H**(-K) DO 60 I = 1,N 60 DKY(I) = R*DKY(I) RETURN C 80 CALL XERRWV(30HINTDY-- K (=I1) ILLEGAL , 1 30, 51, 0, 1, K, 0, 0, 0.0D0, 0.0D0) IFLAG = -1 RETURN 90 CALL XERRWV(30HINTDY-- T (=R1) ILLEGAL , 1 30, 52, 0, 0, 0, 0, 1, T, 0.0D0) CALL XERRWV( 1 60H T NOT IN INTERVAL TCUR - HU (= R1) TO TCUR (=R2) , 1 60, 52, 0, 0, 0, 0, 2, TP, TN) IFLAG = -2 RETURN C----------------------- END OF SUBROUTINE INTDY ----------------------- END octave-1.1.0/libcruft/odepack/lsode.f100666 415 17 216346 5503256676 15726 0ustar jweusers SUBROUTINE LSODE (F, NEQ, Y, T, TOUT, ITOL, RTOL, ATOL, ITASK, 1 ISTATE, IOPT, RWORK, LRW, IWORK, LIW, JAC, MF) EXTERNAL F, JAC INTEGER NEQ, ITOL, ITASK, ISTATE, IOPT, LRW, IWORK, LIW, MF DOUBLE PRECISION Y, T, TOUT, RTOL, ATOL, RWORK DIMENSION NEQ(1), Y(1), RTOL(1), ATOL(1), RWORK(LRW), IWORK(LIW) C----------------------------------------------------------------------- C THIS IS THE MARCH 30, 1987 VERSION OF C LSODE.. LIVERMORE SOLVER FOR ORDINARY DIFFERENTIAL EQUATIONS. C THIS VERSION IS IN DOUBLE PRECISION. C C LSODE SOLVES THE INITIAL VALUE PROBLEM FOR STIFF OR NONSTIFF C SYSTEMS OF FIRST ORDER ODE-S, C DY/DT = F(T,Y) , OR, IN COMPONENT FORM, C DY(I)/DT = F(I) = F(I,T,Y(1),Y(2),...,Y(NEQ)) (I = 1,...,NEQ). C LSODE IS A PACKAGE BASED ON THE GEAR AND GEARB PACKAGES, AND ON THE C OCTOBER 23, 1978 VERSION OF THE TENTATIVE ODEPACK USER INTERFACE C STANDARD, WITH MINOR MODIFICATIONS. C----------------------------------------------------------------------- C REFERENCE.. C ALAN C. HINDMARSH, ODEPACK, A SYSTEMATIZED COLLECTION OF ODE C SOLVERS, IN SCIENTIFIC COMPUTING, R. S. STEPLEMAN ET AL. (EDS.), C NORTH-HOLLAND, AMSTERDAM, 1983, PP. 55-64. C----------------------------------------------------------------------- C AUTHOR AND CONTACT.. ALAN C. HINDMARSH, C COMPUTING AND MATHEMATICS RESEARCH DIV., L-316 C LAWRENCE LIVERMORE NATIONAL LABORATORY C LIVERMORE, CA 94550. C----------------------------------------------------------------------- C SUMMARY OF USAGE. C C COMMUNICATION BETWEEN THE USER AND THE LSODE PACKAGE, FOR NORMAL C SITUATIONS, IS SUMMARIZED HERE. THIS SUMMARY DESCRIBES ONLY A SUBSET C OF THE FULL SET OF OPTIONS AVAILABLE. SEE THE FULL DESCRIPTION FOR C DETAILS, INCLUDING OPTIONAL COMMUNICATION, NONSTANDARD OPTIONS, C AND INSTRUCTIONS FOR SPECIAL SITUATIONS. SEE ALSO THE EXAMPLE C PROBLEM (WITH PROGRAM AND OUTPUT) FOLLOWING THIS SUMMARY. C C A. FIRST PROVIDE A SUBROUTINE OF THE FORM.. C SUBROUTINE F (NEQ, T, Y, YDOT, IERR) C DIMENSION Y(NEQ), YDOT(NEQ) C WHICH SUPPLIES THE VECTOR FUNCTION F BY LOADING YDOT(I) WITH F(I). C C B. NEXT DETERMINE (OR GUESS) WHETHER OR NOT THE PROBLEM IS STIFF. C STIFFNESS OCCURS WHEN THE JACOBIAN MATRIX DF/DY HAS AN EIGENVALUE C WHOSE REAL PART IS NEGATIVE AND LARGE IN MAGNITUDE, COMPARED TO THE C RECIPROCAL OF THE T SPAN OF INTEREST. IF THE PROBLEM IS NONSTIFF, C USE A METHOD FLAG MF = 10. IF IT IS STIFF, THERE ARE FOUR STANDARD C CHOICES FOR MF, AND LSODE REQUIRES THE JACOBIAN MATRIX IN SOME FORM. C THIS MATRIX IS REGARDED EITHER AS FULL (MF = 21 OR 22), C OR BANDED (MF = 24 OR 25). IN THE BANDED CASE, LSODE REQUIRES TWO C HALF-BANDWIDTH PARAMETERS ML AND MU. THESE ARE, RESPECTIVELY, THE C WIDTHS OF THE LOWER AND UPPER PARTS OF THE BAND, EXCLUDING THE MAIN C DIAGONAL. THUS THE BAND CONSISTS OF THE LOCATIONS (I,J) WITH C I-ML .LE. J .LE. I+MU, AND THE FULL BANDWIDTH IS ML+MU+1. C C C. IF THE PROBLEM IS STIFF, YOU ARE ENCOURAGED TO SUPPLY THE JACOBIAN C DIRECTLY (MF = 21 OR 24), BUT IF THIS IS NOT FEASIBLE, LSODE WILL C COMPUTE IT INTERNALLY BY DIFFERENCE QUOTIENTS (MF = 22 OR 25). C IF YOU ARE SUPPLYING THE JACOBIAN, PROVIDE A SUBROUTINE OF THE FORM.. C SUBROUTINE JAC (NEQ, T, Y, ML, MU, PD, NROWPD) C DIMENSION Y(NEQ), PD(NROWPD,NEQ) C WHICH SUPPLIES DF/DY BY LOADING PD AS FOLLOWS.. C FOR A FULL JACOBIAN (MF = 21), LOAD PD(I,J) WITH DF(I)/DY(J), C THE PARTIAL DERIVATIVE OF F(I) WITH RESPECT TO Y(J). (IGNORE THE C ML AND MU ARGUMENTS IN THIS CASE.) C FOR A BANDED JACOBIAN (MF = 24), LOAD PD(I-J+MU+1,J) WITH C DF(I)/DY(J), I.E. LOAD THE DIAGONAL LINES OF DF/DY INTO THE ROWS OF C PD FROM THE TOP DOWN. C IN EITHER CASE, ONLY NONZERO ELEMENTS NEED BE LOADED. C C D. WRITE A MAIN PROGRAM WHICH CALLS SUBROUTINE LSODE ONCE FOR C EACH POINT AT WHICH ANSWERS ARE DESIRED. THIS SHOULD ALSO PROVIDE C FOR POSSIBLE USE OF LOGICAL UNIT 6 FOR OUTPUT OF ERROR MESSAGES C BY LSODE. ON THE FIRST CALL TO LSODE, SUPPLY ARGUMENTS AS FOLLOWS.. C F = NAME OF SUBROUTINE FOR RIGHT-HAND SIDE VECTOR F. C THIS NAME MUST BE DECLARED EXTERNAL IN CALLING PROGRAM. C NEQ = NUMBER OF FIRST ORDER ODE-S. C Y = ARRAY OF INITIAL VALUES, OF LENGTH NEQ. C T = THE INITIAL VALUE OF THE INDEPENDENT VARIABLE. C TOUT = FIRST POINT WHERE OUTPUT IS DESIRED (.NE. T). C ITOL = 1 OR 2 ACCORDING AS ATOL (BELOW) IS A SCALAR OR ARRAY. C RTOL = RELATIVE TOLERANCE PARAMETER (SCALAR). C ATOL = ABSOLUTE TOLERANCE PARAMETER (SCALAR OR ARRAY). C THE ESTIMATED LOCAL ERROR IN Y(I) WILL BE CONTROLLED SO AS C TO BE ROUGHLY LESS (IN MAGNITUDE) THAN C EWT(I) = RTOL*ABS(Y(I)) + ATOL IF ITOL = 1, OR C EWT(I) = RTOL*ABS(Y(I)) + ATOL(I) IF ITOL = 2. C THUS THE LOCAL ERROR TEST PASSES IF, IN EACH COMPONENT, C EITHER THE ABSOLUTE ERROR IS LESS THAN ATOL (OR ATOL(I)), C OR THE RELATIVE ERROR IS LESS THAN RTOL. C USE RTOL = 0.0 FOR PURE ABSOLUTE ERROR CONTROL, AND C USE ATOL = 0.0 (OR ATOL(I) = 0.0) FOR PURE RELATIVE ERROR C CONTROL. CAUTION.. ACTUAL (GLOBAL) ERRORS MAY EXCEED THESE C LOCAL TOLERANCES, SO CHOOSE THEM CONSERVATIVELY. C ITASK = 1 FOR NORMAL COMPUTATION OF OUTPUT VALUES OF Y AT T = TOUT. C ISTATE = INTEGER FLAG (INPUT AND OUTPUT). SET ISTATE = 1. C IOPT = 0 TO INDICATE NO OPTIONAL INPUTS USED. C RWORK = REAL WORK ARRAY OF LENGTH AT LEAST.. C 20 + 16*NEQ FOR MF = 10, C 22 + 9*NEQ + NEQ**2 FOR MF = 21 OR 22, C 22 + 10*NEQ + (2*ML + MU)*NEQ FOR MF = 24 OR 25. C LRW = DECLARED LENGTH OF RWORK (IN USER-S DIMENSION). C IWORK = INTEGER WORK ARRAY OF LENGTH AT LEAST.. C 20 FOR MF = 10, C 20 + NEQ FOR MF = 21, 22, 24, OR 25. C IF MF = 24 OR 25, INPUT IN IWORK(1),IWORK(2) THE LOWER C AND UPPER HALF-BANDWIDTHS ML,MU. C LIW = DECLARED LENGTH OF IWORK (IN USER-S DIMENSION). C JAC = NAME OF SUBROUTINE FOR JACOBIAN MATRIX (MF = 21 OR 24). C IF USED, THIS NAME MUST BE DECLARED EXTERNAL IN CALLING C PROGRAM. IF NOT USED, PASS A DUMMY NAME. C MF = METHOD FLAG. STANDARD VALUES ARE.. C 10 FOR NONSTIFF (ADAMS) METHOD, NO JACOBIAN USED. C 21 FOR STIFF (BDF) METHOD, USER-SUPPLIED FULL JACOBIAN. C 22 FOR STIFF METHOD, INTERNALLY GENERATED FULL JACOBIAN. C 24 FOR STIFF METHOD, USER-SUPPLIED BANDED JACOBIAN. C 25 FOR STIFF METHOD, INTERNALLY GENERATED BANDED JACOBIAN. C NOTE THAT THE MAIN PROGRAM MUST DECLARE ARRAYS Y, RWORK, IWORK, C AND POSSIBLY ATOL. C C E. THE OUTPUT FROM THE FIRST CALL (OR ANY CALL) IS.. C Y = ARRAY OF COMPUTED VALUES OF Y(T) VECTOR. C T = CORRESPONDING VALUE OF INDEPENDENT VARIABLE (NORMALLY TOUT). C ISTATE = 2 IF LSODE WAS SUCCESSFUL, NEGATIVE OTHERWISE. C -1 MEANS EXCESS WORK DONE ON THIS CALL (PERHAPS WRONG MF). C -2 MEANS EXCESS ACCURACY REQUESTED (TOLERANCES TOO SMALL). C -3 MEANS ILLEGAL INPUT DETECTED (SEE PRINTED MESSAGE). C -4 MEANS REPEATED ERROR TEST FAILURES (CHECK ALL INPUTS). C -5 MEANS REPEATED CONVERGENCE FAILURES (PERHAPS BAD JACOBIAN C SUPPLIED OR WRONG CHOICE OF MF OR TOLERANCES). C -6 MEANS ERROR WEIGHT BECAME ZERO DURING PROBLEM. (SOLUTION C COMPONENT I VANISHED, AND ATOL OR ATOL(I) = 0.) C -13 MEANS EXIT REQUESTED IN USER-SUPPLIED FUNCTION. C C F. TO CONTINUE THE INTEGRATION AFTER A SUCCESSFUL RETURN, SIMPLY C RESET TOUT AND CALL LSODE AGAIN. NO OTHER PARAMETERS NEED BE RESET. C C----------------------------------------------------------------------- C EXAMPLE PROBLEM. C C THE FOLLOWING IS A SIMPLE EXAMPLE PROBLEM, WITH THE CODING C NEEDED FOR ITS SOLUTION BY LSODE. THE PROBLEM IS FROM CHEMICAL C KINETICS, AND CONSISTS OF THE FOLLOWING THREE RATE EQUATIONS.. C DY1/DT = -.04*Y1 + 1.E4*Y2*Y3 C DY2/DT = .04*Y1 - 1.E4*Y2*Y3 - 3.E7*Y2**2 C DY3/DT = 3.E7*Y2**2 C ON THE INTERVAL FROM T = 0.0 TO T = 4.E10, WITH INITIAL CONDITIONS C Y1 = 1.0, Y2 = Y3 = 0. THE PROBLEM IS STIFF. C C THE FOLLOWING CODING SOLVES THIS PROBLEM WITH LSODE, USING MF = 21 C AND PRINTING RESULTS AT T = .4, 4., ..., 4.E10. IT USES C ITOL = 2 AND ATOL MUCH SMALLER FOR Y2 THAN Y1 OR Y3 BECAUSE C Y2 HAS MUCH SMALLER VALUES. C AT THE END OF THE RUN, STATISTICAL QUANTITIES OF INTEREST ARE C PRINTED (SEE OPTIONAL OUTPUTS IN THE FULL DESCRIPTION BELOW). C C EXTERNAL FEX, JEX C DOUBLE PRECISION ATOL, RTOL, RWORK, T, TOUT, Y C DIMENSION Y(3), ATOL(3), RWORK(58), IWORK(23) C NEQ = 3 C Y(1) = 1.D0 C Y(2) = 0.D0 C Y(3) = 0.D0 C T = 0.D0 C TOUT = .4D0 C ITOL = 2 C RTOL = 1.D-4 C ATOL(1) = 1.D-6 C ATOL(2) = 1.D-10 C ATOL(3) = 1.D-6 C ITASK = 1 C ISTATE = 1 C IOPT = 0 C LRW = 58 C LIW = 23 C MF = 21 C DO 40 IOUT = 1,12 C CALL LSODE(FEX,NEQ,Y,T,TOUT,ITOL,RTOL,ATOL,ITASK,ISTATE, C 1 IOPT,RWORK,LRW,IWORK,LIW,JEX,MF) C WRITE(6,20)T,Y(1),Y(2),Y(3) C 20 FORMAT(7H AT T =,E12.4,6H Y =,3E14.6) C IF (ISTATE .LT. 0) GO TO 80 C 40 TOUT = TOUT*10.D0 C WRITE(6,60)IWORK(11),IWORK(12),IWORK(13) C 60 FORMAT(/12H NO. STEPS =,I4,11H NO. F-S =,I4,11H NO. J-S =,I4) C STOP C 80 WRITE(6,90)ISTATE C 90 FORMAT(///22H ERROR HALT.. ISTATE =,I3) C STOP C END C C SUBROUTINE FEX (NEQ, T, Y, YDOT) C DOUBLE PRECISION T, Y, YDOT C DIMENSION Y(3), YDOT(3) C YDOT(1) = -.04D0*Y(1) + 1.D4*Y(2)*Y(3) C YDOT(3) = 3.D7*Y(2)*Y(2) C YDOT(2) = -YDOT(1) - YDOT(3) C RETURN C END C C SUBROUTINE JEX (NEQ, T, Y, ML, MU, PD, NRPD) C DOUBLE PRECISION PD, T, Y C DIMENSION Y(3), PD(NRPD,3) C PD(1,1) = -.04D0 C PD(1,2) = 1.D4*Y(3) C PD(1,3) = 1.D4*Y(2) C PD(2,1) = .04D0 C PD(2,3) = -PD(1,3) C PD(3,2) = 6.D7*Y(2) C PD(2,2) = -PD(1,2) - PD(3,2) C RETURN C END C C THE OUTPUT OF THIS PROGRAM (ON A CDC-7600 IN SINGLE PRECISION) C IS AS FOLLOWS.. C C AT T = 4.0000E-01 Y = 9.851726E-01 3.386406E-05 1.479357E-02 C AT T = 4.0000E+00 Y = 9.055142E-01 2.240418E-05 9.446344E-02 C AT T = 4.0000E+01 Y = 7.158050E-01 9.184616E-06 2.841858E-01 C AT T = 4.0000E+02 Y = 4.504846E-01 3.222434E-06 5.495122E-01 C AT T = 4.0000E+03 Y = 1.831701E-01 8.940379E-07 8.168290E-01 C AT T = 4.0000E+04 Y = 3.897016E-02 1.621193E-07 9.610297E-01 C AT T = 4.0000E+05 Y = 4.935213E-03 1.983756E-08 9.950648E-01 C AT T = 4.0000E+06 Y = 5.159269E-04 2.064759E-09 9.994841E-01 C AT T = 4.0000E+07 Y = 5.306413E-05 2.122677E-10 9.999469E-01 C AT T = 4.0000E+08 Y = 5.494529E-06 2.197824E-11 9.999945E-01 C AT T = 4.0000E+09 Y = 5.129458E-07 2.051784E-12 9.999995E-01 C AT T = 4.0000E+10 Y = -7.170586E-08 -2.868234E-13 1.000000E+00 C C NO. STEPS = 330 NO. F-S = 405 NO. J-S = 69 C----------------------------------------------------------------------- C FULL DESCRIPTION OF USER INTERFACE TO LSODE. C C THE USER INTERFACE TO LSODE CONSISTS OF THE FOLLOWING PARTS. C C I. THE CALL SEQUENCE TO SUBROUTINE LSODE, WHICH IS A DRIVER C ROUTINE FOR THE SOLVER. THIS INCLUDES DESCRIPTIONS OF BOTH C THE CALL SEQUENCE ARGUMENTS AND OF USER-SUPPLIED ROUTINES. C FOLLOWING THESE DESCRIPTIONS IS A DESCRIPTION OF C OPTIONAL INPUTS AVAILABLE THROUGH THE CALL SEQUENCE, AND THEN C A DESCRIPTION OF OPTIONAL OUTPUTS (IN THE WORK ARRAYS). C C II. DESCRIPTIONS OF OTHER ROUTINES IN THE LSODE PACKAGE THAT MAY BE C (OPTIONALLY) CALLED BY THE USER. THESE PROVIDE THE ABILITY TO C ALTER ERROR MESSAGE HANDLING, SAVE AND RESTORE THE INTERNAL C COMMON, AND OBTAIN SPECIFIED DERIVATIVES OF THE SOLUTION Y(T). C C III. DESCRIPTIONS OF COMMON BLOCKS TO BE DECLARED IN OVERLAY C OR SIMILAR ENVIRONMENTS, OR TO BE SAVED WHEN DOING AN INTERRUPT C OF THE PROBLEM AND CONTINUED SOLUTION LATER. C C IV. DESCRIPTION OF TWO ROUTINES IN THE LSODE PACKAGE, EITHER OF C WHICH THE USER MAY REPLACE WITH HIS OWN VERSION, IF DESIRED. C THESE RELATE TO THE MEASUREMENT OF ERRORS. C C----------------------------------------------------------------------- C PART I. CALL SEQUENCE. C C THE CALL SEQUENCE PARAMETERS USED FOR INPUT ONLY ARE C F, NEQ, TOUT, ITOL, RTOL, ATOL, ITASK, IOPT, LRW, LIW, JAC, MF, C AND THOSE USED FOR BOTH INPUT AND OUTPUT ARE C Y, T, ISTATE. C THE WORK ARRAYS RWORK AND IWORK ARE ALSO USED FOR CONDITIONAL AND C OPTIONAL INPUTS AND OPTIONAL OUTPUTS. (THE TERM OUTPUT HERE REFERS C TO THE RETURN FROM SUBROUTINE LSODE TO THE USER-S CALLING PROGRAM.) C C THE LEGALITY OF INPUT PARAMETERS WILL BE THOROUGHLY CHECKED ON THE C INITIAL CALL FOR THE PROBLEM, BUT NOT CHECKED THEREAFTER UNLESS A C CHANGE IN INPUT PARAMETERS IS FLAGGED BY ISTATE = 3 ON INPUT. C C THE DESCRIPTIONS OF THE CALL ARGUMENTS ARE AS FOLLOWS. C C F = THE NAME OF THE USER-SUPPLIED SUBROUTINE DEFINING THE C ODE SYSTEM. THE SYSTEM MUST BE PUT IN THE FIRST-ORDER C FORM DY/DT = F(T,Y), WHERE F IS A VECTOR-VALUED FUNCTION C OF THE SCALAR T AND THE VECTOR Y. SUBROUTINE F IS TO C COMPUTE THE FUNCTION F. IT IS TO HAVE THE FORM C SUBROUTINE F (NEQ, T, Y, YDOT) C DIMENSION Y(1), YDOT(1) C WHERE NEQ, T, AND Y ARE INPUT, AND THE ARRAY YDOT = F(T,Y) C IS OUTPUT. Y AND YDOT ARE ARRAYS OF LENGTH NEQ. C (IN THE DIMENSION STATEMENT ABOVE, 1 IS A DUMMY C DIMENSION.. IT CAN BE REPLACED BY ANY VALUE.) C SUBROUTINE F SHOULD NOT ALTER Y(1),...,Y(NEQ). C F MUST BE DECLARED EXTERNAL IN THE CALLING PROGRAM. C C SUBROUTINE F MAY ACCESS USER-DEFINED QUANTITIES IN C NEQ(2),... AND/OR IN Y(NEQ(1)+1),... IF NEQ IS AN ARRAY C (DIMENSIONED IN F) AND/OR Y HAS LENGTH EXCEEDING NEQ(1). C SEE THE DESCRIPTIONS OF NEQ AND Y BELOW. C C IF QUANTITIES COMPUTED IN THE F ROUTINE ARE NEEDED C EXTERNALLY TO LSODE, AN EXTRA CALL TO F SHOULD BE MADE C FOR THIS PURPOSE, FOR CONSISTENT AND ACCURATE RESULTS. C IF ONLY THE DERIVATIVE DY/DT IS NEEDED, USE INTDY INSTEAD. C C NEQ = THE SIZE OF THE ODE SYSTEM (NUMBER OF FIRST ORDER C ORDINARY DIFFERENTIAL EQUATIONS). USED ONLY FOR INPUT. C NEQ MAY BE DECREASED, BUT NOT INCREASED, DURING THE PROBLEM. C IF NEQ IS DECREASED (WITH ISTATE = 3 ON INPUT), THE C REMAINING COMPONENTS OF Y SHOULD BE LEFT UNDISTURBED, IF C THESE ARE TO BE ACCESSED IN F AND/OR JAC. C C NORMALLY, NEQ IS A SCALAR, AND IT IS GENERALLY REFERRED TO C AS A SCALAR IN THIS USER INTERFACE DESCRIPTION. HOWEVER, C NEQ MAY BE AN ARRAY, WITH NEQ(1) SET TO THE SYSTEM SIZE. C (THE LSODE PACKAGE ACCESSES ONLY NEQ(1).) IN EITHER CASE, C THIS PARAMETER IS PASSED AS THE NEQ ARGUMENT IN ALL CALLS C TO F AND JAC. HENCE, IF IT IS AN ARRAY, LOCATIONS C NEQ(2),... MAY BE USED TO STORE OTHER INTEGER DATA AND PASS C IT TO F AND/OR JAC. SUBROUTINES F AND/OR JAC MUST INCLUDE C NEQ IN A DIMENSION STATEMENT IN THAT CASE. C C Y = A REAL ARRAY FOR THE VECTOR OF DEPENDENT VARIABLES, OF C LENGTH NEQ OR MORE. USED FOR BOTH INPUT AND OUTPUT ON THE C FIRST CALL (ISTATE = 1), AND ONLY FOR OUTPUT ON OTHER CALLS. C ON THE FIRST CALL, Y MUST CONTAIN THE VECTOR OF INITIAL C VALUES. ON OUTPUT, Y CONTAINS THE COMPUTED SOLUTION VECTOR, C EVALUATED AT T. IF DESIRED, THE Y ARRAY MAY BE USED C FOR OTHER PURPOSES BETWEEN CALLS TO THE SOLVER. C C THIS ARRAY IS PASSED AS THE Y ARGUMENT IN ALL CALLS TO C F AND JAC. HENCE ITS LENGTH MAY EXCEED NEQ, AND LOCATIONS C Y(NEQ+1),... MAY BE USED TO STORE OTHER REAL DATA AND C PASS IT TO F AND/OR JAC. (THE LSODE PACKAGE ACCESSES ONLY C Y(1),...,Y(NEQ).) C C T = THE INDEPENDENT VARIABLE. ON INPUT, T IS USED ONLY ON THE C FIRST CALL, AS THE INITIAL POINT OF THE INTEGRATION. C ON OUTPUT, AFTER EACH CALL, T IS THE VALUE AT WHICH A C COMPUTED SOLUTION Y IS EVALUATED (USUALLY THE SAME AS TOUT). C ON AN ERROR RETURN, T IS THE FARTHEST POINT REACHED. C C TOUT = THE NEXT VALUE OF T AT WHICH A COMPUTED SOLUTION IS DESIRED. C USED ONLY FOR INPUT. C C WHEN STARTING THE PROBLEM (ISTATE = 1), TOUT MAY BE EQUAL C TO T FOR ONE CALL, THEN SHOULD .NE. T FOR THE NEXT CALL. C FOR THE INITIAL T, AN INPUT VALUE OF TOUT .NE. T IS USED C IN ORDER TO DETERMINE THE DIRECTION OF THE INTEGRATION C (I.E. THE ALGEBRAIC SIGN OF THE STEP SIZES) AND THE ROUGH C SCALE OF THE PROBLEM. INTEGRATION IN EITHER DIRECTION C (FORWARD OR BACKWARD IN T) IS PERMITTED. C C IF ITASK = 2 OR 5 (ONE-STEP MODES), TOUT IS IGNORED AFTER C THE FIRST CALL (I.E. THE FIRST CALL WITH TOUT .NE. T). C OTHERWISE, TOUT IS REQUIRED ON EVERY CALL. C C IF ITASK = 1, 3, OR 4, THE VALUES OF TOUT NEED NOT BE C MONOTONE, BUT A VALUE OF TOUT WHICH BACKS UP IS LIMITED C TO THE CURRENT INTERNAL T INTERVAL, WHOSE ENDPOINTS ARE C TCUR - HU AND TCUR (SEE OPTIONAL OUTPUTS, BELOW, FOR C TCUR AND HU). C C ITOL = AN INDICATOR FOR THE TYPE OF ERROR CONTROL. SEE C DESCRIPTION BELOW UNDER ATOL. USED ONLY FOR INPUT. C C RTOL = A RELATIVE ERROR TOLERANCE PARAMETER, EITHER A SCALAR OR C AN ARRAY OF LENGTH NEQ. SEE DESCRIPTION BELOW UNDER ATOL. C INPUT ONLY. C C ATOL = AN ABSOLUTE ERROR TOLERANCE PARAMETER, EITHER A SCALAR OR C AN ARRAY OF LENGTH NEQ. INPUT ONLY. C C THE INPUT PARAMETERS ITOL, RTOL, AND ATOL DETERMINE C THE ERROR CONTROL PERFORMED BY THE SOLVER. THE SOLVER WILL C CONTROL THE VECTOR E = (E(I)) OF ESTIMATED LOCAL ERRORS C IN Y, ACCORDING TO AN INEQUALITY OF THE FORM C RMS-NORM OF ( E(I)/EWT(I) ) .LE. 1, C WHERE EWT(I) = RTOL(I)*ABS(Y(I)) + ATOL(I), C AND THE RMS-NORM (ROOT-MEAN-SQUARE NORM) HERE IS C RMS-NORM(V) = SQRT(SUM V(I)**2 / NEQ). HERE EWT = (EWT(I)) C IS A VECTOR OF WEIGHTS WHICH MUST ALWAYS BE POSITIVE, AND C THE VALUES OF RTOL AND ATOL SHOULD ALL BE NON-NEGATIVE. C THE FOLLOWING TABLE GIVES THE TYPES (SCALAR/ARRAY) OF C RTOL AND ATOL, AND THE CORRESPONDING FORM OF EWT(I). C C ITOL RTOL ATOL EWT(I) C 1 SCALAR SCALAR RTOL*ABS(Y(I)) + ATOL C 2 SCALAR ARRAY RTOL*ABS(Y(I)) + ATOL(I) C 3 ARRAY SCALAR RTOL(I)*ABS(Y(I)) + ATOL C 4 ARRAY ARRAY RTOL(I)*ABS(Y(I)) + ATOL(I) C C WHEN EITHER OF THESE PARAMETERS IS A SCALAR, IT NEED NOT C BE DIMENSIONED IN THE USER-S CALLING PROGRAM. C C IF NONE OF THE ABOVE CHOICES (WITH ITOL, RTOL, AND ATOL C FIXED THROUGHOUT THE PROBLEM) IS SUITABLE, MORE GENERAL C ERROR CONTROLS CAN BE OBTAINED BY SUBSTITUTING C USER-SUPPLIED ROUTINES FOR THE SETTING OF EWT AND/OR FOR C THE NORM CALCULATION. SEE PART IV BELOW. C C IF GLOBAL ERRORS ARE TO BE ESTIMATED BY MAKING A REPEATED C RUN ON THE SAME PROBLEM WITH SMALLER TOLERANCES, THEN ALL C COMPONENTS OF RTOL AND ATOL (I.E. OF EWT) SHOULD BE SCALED C DOWN UNIFORMLY. C C ITASK = AN INDEX SPECIFYING THE TASK TO BE PERFORMED. C INPUT ONLY. ITASK HAS THE FOLLOWING VALUES AND MEANINGS. C 1 MEANS NORMAL COMPUTATION OF OUTPUT VALUES OF Y(T) AT C T = TOUT (BY OVERSHOOTING AND INTERPOLATING). C 2 MEANS TAKE ONE STEP ONLY AND RETURN. C 3 MEANS STOP AT THE FIRST INTERNAL MESH POINT AT OR C BEYOND T = TOUT AND RETURN. C 4 MEANS NORMAL COMPUTATION OF OUTPUT VALUES OF Y(T) AT C T = TOUT BUT WITHOUT OVERSHOOTING T = TCRIT. C TCRIT MUST BE INPUT AS RWORK(1). TCRIT MAY BE EQUAL TO C OR BEYOND TOUT, BUT NOT BEHIND IT IN THE DIRECTION OF C INTEGRATION. THIS OPTION IS USEFUL IF THE PROBLEM C HAS A SINGULARITY AT OR BEYOND T = TCRIT. C 5 MEANS TAKE ONE STEP, WITHOUT PASSING TCRIT, AND RETURN. C TCRIT MUST BE INPUT AS RWORK(1). C C NOTE.. IF ITASK = 4 OR 5 AND THE SOLVER REACHES TCRIT C (WITHIN ROUNDOFF), IT WILL RETURN T = TCRIT (EXACTLY) TO C INDICATE THIS (UNLESS ITASK = 4 AND TOUT COMES BEFORE TCRIT, C IN WHICH CASE ANSWERS AT T = TOUT ARE RETURNED FIRST). C C ISTATE = AN INDEX USED FOR INPUT AND OUTPUT TO SPECIFY THE C THE STATE OF THE CALCULATION. C C ON INPUT, THE VALUES OF ISTATE ARE AS FOLLOWS. C 1 MEANS THIS IS THE FIRST CALL FOR THE PROBLEM C (INITIALIZATIONS WILL BE DONE). SEE NOTE BELOW. C 2 MEANS THIS IS NOT THE FIRST CALL, AND THE CALCULATION C IS TO CONTINUE NORMALLY, WITH NO CHANGE IN ANY INPUT C PARAMETERS EXCEPT POSSIBLY TOUT AND ITASK. C (IF ITOL, RTOL, AND/OR ATOL ARE CHANGED BETWEEN CALLS C WITH ISTATE = 2, THE NEW VALUES WILL BE USED BUT NOT C TESTED FOR LEGALITY.) C 3 MEANS THIS IS NOT THE FIRST CALL, AND THE C CALCULATION IS TO CONTINUE NORMALLY, BUT WITH C A CHANGE IN INPUT PARAMETERS OTHER THAN C TOUT AND ITASK. CHANGES ARE ALLOWED IN C NEQ, ITOL, RTOL, ATOL, IOPT, LRW, LIW, MF, ML, MU, C AND ANY OF THE OPTIONAL INPUTS EXCEPT H0. C (SEE IWORK DESCRIPTION FOR ML AND MU.) C NOTE.. A PRELIMINARY CALL WITH TOUT = T IS NOT COUNTED C AS A FIRST CALL HERE, AS NO INITIALIZATION OR CHECKING OF C INPUT IS DONE. (SUCH A CALL IS SOMETIMES USEFUL FOR THE C PURPOSE OF OUTPUTTING THE INITIAL CONDITIONS.) C THUS THE FIRST CALL FOR WHICH TOUT .NE. T REQUIRES C ISTATE = 1 ON INPUT. C C ON OUTPUT, ISTATE HAS THE FOLLOWING VALUES AND MEANINGS. C 1 MEANS NOTHING WAS DONE, AS TOUT WAS EQUAL TO T WITH C ISTATE = 1 ON INPUT. (HOWEVER, AN INTERNAL COUNTER WAS C SET TO DETECT AND PREVENT REPEATED CALLS OF THIS TYPE.) C 2 MEANS THE INTEGRATION WAS PERFORMED SUCCESSFULLY. C -1 MEANS AN EXCESSIVE AMOUNT OF WORK (MORE THAN MXSTEP C STEPS) WAS DONE ON THIS CALL, BEFORE COMPLETING THE C REQUESTED TASK, BUT THE INTEGRATION WAS OTHERWISE C SUCCESSFUL AS FAR AS T. (MXSTEP IS AN OPTIONAL INPUT C AND IS NORMALLY 500.) TO CONTINUE, THE USER MAY C SIMPLY RESET ISTATE TO A VALUE .GT. 1 AND CALL AGAIN C (THE EXCESS WORK STEP COUNTER WILL BE RESET TO 0). C IN ADDITION, THE USER MAY INCREASE MXSTEP TO AVOID C THIS ERROR RETURN (SEE BELOW ON OPTIONAL INPUTS). C -2 MEANS TOO MUCH ACCURACY WAS REQUESTED FOR THE PRECISION C OF THE MACHINE BEING USED. THIS WAS DETECTED BEFORE C COMPLETING THE REQUESTED TASK, BUT THE INTEGRATION C WAS SUCCESSFUL AS FAR AS T. TO CONTINUE, THE TOLERANCE C PARAMETERS MUST BE RESET, AND ISTATE MUST BE SET C TO 3. THE OPTIONAL OUTPUT TOLSF MAY BE USED FOR THIS C PURPOSE. (NOTE.. IF THIS CONDITION IS DETECTED BEFORE C TAKING ANY STEPS, THEN AN ILLEGAL INPUT RETURN C (ISTATE = -3) OCCURS INSTEAD.) C -3 MEANS ILLEGAL INPUT WAS DETECTED, BEFORE TAKING ANY C INTEGRATION STEPS. SEE WRITTEN MESSAGE FOR DETAILS. C NOTE.. IF THE SOLVER DETECTS AN INFINITE LOOP OF CALLS C TO THE SOLVER WITH ILLEGAL INPUT, IT WILL CAUSE C THE RUN TO STOP. C -4 MEANS THERE WERE REPEATED ERROR TEST FAILURES ON C ONE ATTEMPTED STEP, BEFORE COMPLETING THE REQUESTED C TASK, BUT THE INTEGRATION WAS SUCCESSFUL AS FAR AS T. C THE PROBLEM MAY HAVE A SINGULARITY, OR THE INPUT C MAY BE INAPPROPRIATE. C -5 MEANS THERE WERE REPEATED CONVERGENCE TEST FAILURES ON C ONE ATTEMPTED STEP, BEFORE COMPLETING THE REQUESTED C TASK, BUT THE INTEGRATION WAS SUCCESSFUL AS FAR AS T. C THIS MAY BE CAUSED BY AN INACCURATE JACOBIAN MATRIX, C IF ONE IS BEING USED. C -6 MEANS EWT(I) BECAME ZERO FOR SOME I DURING THE C INTEGRATION. PURE RELATIVE ERROR CONTROL (ATOL(I)=0.0) C WAS REQUESTED ON A VARIABLE WHICH HAS NOW VANISHED. C THE INTEGRATION WAS SUCCESSFUL AS FAR AS T. C C NOTE.. SINCE THE NORMAL OUTPUT VALUE OF ISTATE IS 2, C IT DOES NOT NEED TO BE RESET FOR NORMAL CONTINUATION. C ALSO, SINCE A NEGATIVE INPUT VALUE OF ISTATE WILL BE C REGARDED AS ILLEGAL, A NEGATIVE OUTPUT VALUE REQUIRES THE C USER TO CHANGE IT, AND POSSIBLY OTHER INPUTS, BEFORE C CALLING THE SOLVER AGAIN. C C IOPT = AN INTEGER FLAG TO SPECIFY WHETHER OR NOT ANY OPTIONAL C INPUTS ARE BEING USED ON THIS CALL. INPUT ONLY. C THE OPTIONAL INPUTS ARE LISTED SEPARATELY BELOW. C IOPT = 0 MEANS NO OPTIONAL INPUTS ARE BEING USED. C DEFAULT VALUES WILL BE USED IN ALL CASES. C IOPT = 1 MEANS ONE OR MORE OPTIONAL INPUTS ARE BEING USED. C C RWORK = A REAL WORKING ARRAY (DOUBLE PRECISION). C THE LENGTH OF RWORK MUST BE AT LEAST C 20 + NYH*(MAXORD + 1) + 3*NEQ + LWM WHERE C NYH = THE INITIAL VALUE OF NEQ, C MAXORD = 12 (IF METH = 1) OR 5 (IF METH = 2) (UNLESS A C SMALLER VALUE IS GIVEN AS AN OPTIONAL INPUT), C LWM = 0 IF MITER = 0, C LWM = NEQ**2 + 2 IF MITER IS 1 OR 2, C LWM = NEQ + 2 IF MITER = 3, AND C LWM = (2*ML+MU+1)*NEQ + 2 IF MITER IS 4 OR 5. C (SEE THE MF DESCRIPTION FOR METH AND MITER.) C THUS IF MAXORD HAS ITS DEFAULT VALUE AND NEQ IS CONSTANT, C THIS LENGTH IS.. C 20 + 16*NEQ FOR MF = 10, C 22 + 16*NEQ + NEQ**2 FOR MF = 11 OR 12, C 22 + 17*NEQ FOR MF = 13, C 22 + 17*NEQ + (2*ML+MU)*NEQ FOR MF = 14 OR 15, C 20 + 9*NEQ FOR MF = 20, C 22 + 9*NEQ + NEQ**2 FOR MF = 21 OR 22, C 22 + 10*NEQ FOR MF = 23, C 22 + 10*NEQ + (2*ML+MU)*NEQ FOR MF = 24 OR 25. C THE FIRST 20 WORDS OF RWORK ARE RESERVED FOR CONDITIONAL C AND OPTIONAL INPUTS AND OPTIONAL OUTPUTS. C C THE FOLLOWING WORD IN RWORK IS A CONDITIONAL INPUT.. C RWORK(1) = TCRIT = CRITICAL VALUE OF T WHICH THE SOLVER C IS NOT TO OVERSHOOT. REQUIRED IF ITASK IS C 4 OR 5, AND IGNORED OTHERWISE. (SEE ITASK.) C C LRW = THE LENGTH OF THE ARRAY RWORK, AS DECLARED BY THE USER. C (THIS WILL BE CHECKED BY THE SOLVER.) C C IWORK = AN INTEGER WORK ARRAY. THE LENGTH OF IWORK MUST BE AT LEAST C 20 IF MITER = 0 OR 3 (MF = 10, 13, 20, 23), OR C 20 + NEQ OTHERWISE (MF = 11, 12, 14, 15, 21, 22, 24, 25). C THE FIRST FEW WORDS OF IWORK ARE USED FOR CONDITIONAL AND C OPTIONAL INPUTS AND OPTIONAL OUTPUTS. C C THE FOLLOWING 2 WORDS IN IWORK ARE CONDITIONAL INPUTS.. C IWORK(1) = ML THESE ARE THE LOWER AND UPPER C IWORK(2) = MU HALF-BANDWIDTHS, RESPECTIVELY, OF THE C BANDED JACOBIAN, EXCLUDING THE MAIN DIAGONAL. C THE BAND IS DEFINED BY THE MATRIX LOCATIONS C (I,J) WITH I-ML .LE. J .LE. I+MU. ML AND MU C MUST SATISFY 0 .LE. ML,MU .LE. NEQ-1. C THESE ARE REQUIRED IF MITER IS 4 OR 5, AND C IGNORED OTHERWISE. ML AND MU MAY IN FACT BE C THE BAND PARAMETERS FOR A MATRIX TO WHICH C DF/DY IS ONLY APPROXIMATELY EQUAL. C C LIW = THE LENGTH OF THE ARRAY IWORK, AS DECLARED BY THE USER. C (THIS WILL BE CHECKED BY THE SOLVER.) C C NOTE.. THE WORK ARRAYS MUST NOT BE ALTERED BETWEEN CALLS TO LSODE C FOR THE SAME PROBLEM, EXCEPT POSSIBLY FOR THE CONDITIONAL AND C OPTIONAL INPUTS, AND EXCEPT FOR THE LAST 3*NEQ WORDS OF RWORK. C THE LATTER SPACE IS USED FOR INTERNAL SCRATCH SPACE, AND SO IS C AVAILABLE FOR USE BY THE USER OUTSIDE LSODE BETWEEN CALLS, IF C DESIRED (BUT NOT FOR USE BY F OR JAC). C C JAC = THE NAME OF THE USER-SUPPLIED ROUTINE (MITER = 1 OR 4) TO C COMPUTE THE JACOBIAN MATRIX, DF/DY, AS A FUNCTION OF C THE SCALAR T AND THE VECTOR Y. IT IS TO HAVE THE FORM C SUBROUTINE JAC (NEQ, T, Y, ML, MU, PD, NROWPD) C DIMENSION Y(1), PD(NROWPD,1) C WHERE NEQ, T, Y, ML, MU, AND NROWPD ARE INPUT AND THE ARRAY C PD IS TO BE LOADED WITH PARTIAL DERIVATIVES (ELEMENTS OF C THE JACOBIAN MATRIX) ON OUTPUT. PD MUST BE GIVEN A FIRST C DIMENSION OF NROWPD. T AND Y HAVE THE SAME MEANING AS IN C SUBROUTINE F. (IN THE DIMENSION STATEMENT ABOVE, 1 IS A C DUMMY DIMENSION.. IT CAN BE REPLACED BY ANY VALUE.) C IN THE FULL MATRIX CASE (MITER = 1), ML AND MU ARE C IGNORED, AND THE JACOBIAN IS TO BE LOADED INTO PD IN C COLUMNWISE MANNER, WITH DF(I)/DY(J) LOADED INTO PD(I,J). C IN THE BAND MATRIX CASE (MITER = 4), THE ELEMENTS C WITHIN THE BAND ARE TO BE LOADED INTO PD IN COLUMNWISE C MANNER, WITH DIAGONAL LINES OF DF/DY LOADED INTO THE ROWS C OF PD. THUS DF(I)/DY(J) IS TO BE LOADED INTO PD(I-J+MU+1,J). C ML AND MU ARE THE HALF-BANDWIDTH PARAMETERS (SEE IWORK). C THE LOCATIONS IN PD IN THE TWO TRIANGULAR AREAS WHICH C CORRESPOND TO NONEXISTENT MATRIX ELEMENTS CAN BE IGNORED C OR LOADED ARBITRARILY, AS THEY ARE OVERWRITTEN BY LSODE. C JAC NEED NOT PROVIDE DF/DY EXACTLY. A CRUDE C APPROXIMATION (POSSIBLY WITH A SMALLER BANDWIDTH) WILL DO. C IN EITHER CASE, PD IS PRESET TO ZERO BY THE SOLVER, C SO THAT ONLY THE NONZERO ELEMENTS NEED BE LOADED BY JAC. C EACH CALL TO JAC IS PRECEDED BY A CALL TO F WITH THE SAME C ARGUMENTS NEQ, T, AND Y. THUS TO GAIN SOME EFFICIENCY, C INTERMEDIATE QUANTITIES SHARED BY BOTH CALCULATIONS MAY BE C SAVED IN A USER COMMON BLOCK BY F AND NOT RECOMPUTED BY JAC, C IF DESIRED. ALSO, JAC MAY ALTER THE Y ARRAY, IF DESIRED. C JAC MUST BE DECLARED EXTERNAL IN THE CALLING PROGRAM. C SUBROUTINE JAC MAY ACCESS USER-DEFINED QUANTITIES IN C NEQ(2),... AND/OR IN Y(NEQ(1)+1),... IF NEQ IS AN ARRAY C (DIMENSIONED IN JAC) AND/OR Y HAS LENGTH EXCEEDING NEQ(1). C SEE THE DESCRIPTIONS OF NEQ AND Y ABOVE. C C MF = THE METHOD FLAG. USED ONLY FOR INPUT. THE LEGAL VALUES OF C MF ARE 10, 11, 12, 13, 14, 15, 20, 21, 22, 23, 24, AND 25. C MF HAS DECIMAL DIGITS METH AND MITER.. MF = 10*METH + MITER. C METH INDICATES THE BASIC LINEAR MULTISTEP METHOD.. C METH = 1 MEANS THE IMPLICIT ADAMS METHOD. C METH = 2 MEANS THE METHOD BASED ON BACKWARD C DIFFERENTIATION FORMULAS (BDF-S). C MITER INDICATES THE CORRECTOR ITERATION METHOD.. C MITER = 0 MEANS FUNCTIONAL ITERATION (NO JACOBIAN MATRIX C IS INVOLVED). C MITER = 1 MEANS CHORD ITERATION WITH A USER-SUPPLIED C FULL (NEQ BY NEQ) JACOBIAN. C MITER = 2 MEANS CHORD ITERATION WITH AN INTERNALLY C GENERATED (DIFFERENCE QUOTIENT) FULL JACOBIAN C (USING NEQ EXTRA CALLS TO F PER DF/DY VALUE). C MITER = 3 MEANS CHORD ITERATION WITH AN INTERNALLY C GENERATED DIAGONAL JACOBIAN APPROXIMATION. C (USING 1 EXTRA CALL TO F PER DF/DY EVALUATION). C MITER = 4 MEANS CHORD ITERATION WITH A USER-SUPPLIED C BANDED JACOBIAN. C MITER = 5 MEANS CHORD ITERATION WITH AN INTERNALLY C GENERATED BANDED JACOBIAN (USING ML+MU+1 EXTRA C CALLS TO F PER DF/DY EVALUATION). C IF MITER = 1 OR 4, THE USER MUST SUPPLY A SUBROUTINE JAC C (THE NAME IS ARBITRARY) AS DESCRIBED ABOVE UNDER JAC. C FOR OTHER VALUES OF MITER, A DUMMY ARGUMENT CAN BE USED. C----------------------------------------------------------------------- C OPTIONAL INPUTS. C C THE FOLLOWING IS A LIST OF THE OPTIONAL INPUTS PROVIDED FOR IN THE C CALL SEQUENCE. (SEE ALSO PART II.) FOR EACH SUCH INPUT VARIABLE, C THIS TABLE LISTS ITS NAME AS USED IN THIS DOCUMENTATION, ITS C LOCATION IN THE CALL SEQUENCE, ITS MEANING, AND THE DEFAULT VALUE. C THE USE OF ANY OF THESE INPUTS REQUIRES IOPT = 1, AND IN THAT C CASE ALL OF THESE INPUTS ARE EXAMINED. A VALUE OF ZERO FOR ANY C OF THESE OPTIONAL INPUTS WILL CAUSE THE DEFAULT VALUE TO BE USED. C THUS TO USE A SUBSET OF THE OPTIONAL INPUTS, SIMPLY PRELOAD C LOCATIONS 5 TO 10 IN RWORK AND IWORK TO 0.0 AND 0 RESPECTIVELY, AND C THEN SET THOSE OF INTEREST TO NONZERO VALUES. C C NAME LOCATION MEANING AND DEFAULT VALUE C C H0 RWORK(5) THE STEP SIZE TO BE ATTEMPTED ON THE FIRST STEP. C THE DEFAULT VALUE IS DETERMINED BY THE SOLVER. C C HMAX RWORK(6) THE MAXIMUM ABSOLUTE STEP SIZE ALLOWED. C THE DEFAULT VALUE IS INFINITE. C C HMIN RWORK(7) THE MINIMUM ABSOLUTE STEP SIZE ALLOWED. C THE DEFAULT VALUE IS 0. (THIS LOWER BOUND IS NOT C ENFORCED ON THE FINAL STEP BEFORE REACHING TCRIT C WHEN ITASK = 4 OR 5.) C C MAXORD IWORK(5) THE MAXIMUM ORDER TO BE ALLOWED. THE DEFAULT C VALUE IS 12 IF METH = 1, AND 5 IF METH = 2. C IF MAXORD EXCEEDS THE DEFAULT VALUE, IT WILL C BE REDUCED TO THE DEFAULT VALUE. C IF MAXORD IS CHANGED DURING THE PROBLEM, IT MAY C CAUSE THE CURRENT ORDER TO BE REDUCED. C C MXSTEP IWORK(6) MAXIMUM NUMBER OF (INTERNALLY DEFINED) STEPS C ALLOWED DURING ONE CALL TO THE SOLVER. C THE DEFAULT VALUE IS 500. C C MXHNIL IWORK(7) MAXIMUM NUMBER OF MESSAGES PRINTED (PER PROBLEM) C WARNING THAT T + H = T ON A STEP (H = STEP SIZE). C THIS MUST BE POSITIVE TO RESULT IN A NON-DEFAULT C VALUE. THE DEFAULT VALUE IS 10. C----------------------------------------------------------------------- C OPTIONAL OUTPUTS. C C AS OPTIONAL ADDITIONAL OUTPUT FROM LSODE, THE VARIABLES LISTED C BELOW ARE QUANTITIES RELATED TO THE PERFORMANCE OF LSODE C WHICH ARE AVAILABLE TO THE USER. THESE ARE COMMUNICATED BY WAY OF C THE WORK ARRAYS, BUT ALSO HAVE INTERNAL MNEMONIC NAMES AS SHOWN. C EXCEPT WHERE STATED OTHERWISE, ALL OF THESE OUTPUTS ARE DEFINED C ON ANY SUCCESSFUL RETURN FROM LSODE, AND ON ANY RETURN WITH C ISTATE = -1, -2, -4, -5, OR -6. ON AN ILLEGAL INPUT RETURN C (ISTATE = -3), THEY WILL BE UNCHANGED FROM THEIR EXISTING VALUES C (IF ANY), EXCEPT POSSIBLY FOR TOLSF, LENRW, AND LENIW. C ON ANY ERROR RETURN, OUTPUTS RELEVANT TO THE ERROR WILL BE DEFINED, C AS NOTED BELOW. C C NAME LOCATION MEANING C C HU RWORK(11) THE STEP SIZE IN T LAST USED (SUCCESSFULLY). C C HCUR RWORK(12) THE STEP SIZE TO BE ATTEMPTED ON THE NEXT STEP. C C TCUR RWORK(13) THE CURRENT VALUE OF THE INDEPENDENT VARIABLE C WHICH THE SOLVER HAS ACTUALLY REACHED, I.E. THE C CURRENT INTERNAL MESH POINT IN T. ON OUTPUT, TCUR C WILL ALWAYS BE AT LEAST AS FAR AS THE ARGUMENT C T, BUT MAY BE FARTHER (IF INTERPOLATION WAS DONE). C C TOLSF RWORK(14) A TOLERANCE SCALE FACTOR, GREATER THAN 1.0, C COMPUTED WHEN A REQUEST FOR TOO MUCH ACCURACY WAS C DETECTED (ISTATE = -3 IF DETECTED AT THE START OF C THE PROBLEM, ISTATE = -2 OTHERWISE). IF ITOL IS C LEFT UNALTERED BUT RTOL AND ATOL ARE UNIFORMLY C SCALED UP BY A FACTOR OF TOLSF FOR THE NEXT CALL, C THEN THE SOLVER IS DEEMED LIKELY TO SUCCEED. C (THE USER MAY ALSO IGNORE TOLSF AND ALTER THE C TOLERANCE PARAMETERS IN ANY OTHER WAY APPROPRIATE.) C C NST IWORK(11) THE NUMBER OF STEPS TAKEN FOR THE PROBLEM SO FAR. C C NFE IWORK(12) THE NUMBER OF F EVALUATIONS FOR THE PROBLEM SO FAR. C C NJE IWORK(13) THE NUMBER OF JACOBIAN EVALUATIONS (AND OF MATRIX C LU DECOMPOSITIONS) FOR THE PROBLEM SO FAR. C C NQU IWORK(14) THE METHOD ORDER LAST USED (SUCCESSFULLY). C C NQCUR IWORK(15) THE ORDER TO BE ATTEMPTED ON THE NEXT STEP. C C IMXER IWORK(16) THE INDEX OF THE COMPONENT OF LARGEST MAGNITUDE IN C THE WEIGHTED LOCAL ERROR VECTOR ( E(I)/EWT(I) ), C ON AN ERROR RETURN WITH ISTATE = -4 OR -5. C C LENRW IWORK(17) THE LENGTH OF RWORK ACTUALLY REQUIRED. C THIS IS DEFINED ON NORMAL RETURNS AND ON AN ILLEGAL C INPUT RETURN FOR INSUFFICIENT STORAGE. C C LENIW IWORK(18) THE LENGTH OF IWORK ACTUALLY REQUIRED. C THIS IS DEFINED ON NORMAL RETURNS AND ON AN ILLEGAL C INPUT RETURN FOR INSUFFICIENT STORAGE. C C THE FOLLOWING TWO ARRAYS ARE SEGMENTS OF THE RWORK ARRAY WHICH C MAY ALSO BE OF INTEREST TO THE USER AS OPTIONAL OUTPUTS. C FOR EACH ARRAY, THE TABLE BELOW GIVES ITS INTERNAL NAME, C ITS BASE ADDRESS IN RWORK, AND ITS DESCRIPTION. C C NAME BASE ADDRESS DESCRIPTION C C YH 21 THE NORDSIECK HISTORY ARRAY, OF SIZE NYH BY C (NQCUR + 1), WHERE NYH IS THE INITIAL VALUE C OF NEQ. FOR J = 0,1,...,NQCUR, COLUMN J+1 C OF YH CONTAINS HCUR**J/FACTORIAL(J) TIMES C THE J-TH DERIVATIVE OF THE INTERPOLATING C POLYNOMIAL CURRENTLY REPRESENTING THE SOLUTION, C EVALUATED AT T = TCUR. C C ACOR LENRW-NEQ+1 ARRAY OF SIZE NEQ USED FOR THE ACCUMULATED C CORRECTIONS ON EACH STEP, SCALED ON OUTPUT C TO REPRESENT THE ESTIMATED LOCAL ERROR IN Y C ON THE LAST STEP. THIS IS THE VECTOR E IN C THE DESCRIPTION OF THE ERROR CONTROL. IT IS C DEFINED ONLY ON A SUCCESSFUL RETURN FROM LSODE. C C----------------------------------------------------------------------- C PART II. OTHER ROUTINES CALLABLE. C C THE FOLLOWING ARE OPTIONAL CALLS WHICH THE USER MAY MAKE TO C GAIN ADDITIONAL CAPABILITIES IN CONJUNCTION WITH LSODE. C (THE ROUTINES XSETUN AND XSETF ARE DESIGNED TO CONFORM TO THE C SLATEC ERROR HANDLING PACKAGE.) C C FORM OF CALL FUNCTION C CALL XSETUN(LUN) SET THE LOGICAL UNIT NUMBER, LUN, FOR C OUTPUT OF MESSAGES FROM LSODE, IF C THE DEFAULT IS NOT DESIRED. C THE DEFAULT VALUE OF LUN IS 6. C C CALL XSETF(MFLAG) SET A FLAG TO CONTROL THE PRINTING OF C MESSAGES BY LSODE. C MFLAG = 0 MEANS DO NOT PRINT. (DANGER.. C THIS RISKS LOSING VALUABLE INFORMATION.) C MFLAG = 1 MEANS PRINT (THE DEFAULT). C C EITHER OF THE ABOVE CALLS MAY BE MADE AT C ANY TIME AND WILL TAKE EFFECT IMMEDIATELY. C C CALL SRCOM(RSAV,ISAV,JOB) SAVES AND RESTORES THE CONTENTS OF C THE INTERNAL COMMON BLOCKS USED BY C LSODE (SEE PART III BELOW). C RSAV MUST BE A REAL ARRAY OF LENGTH 218 C OR MORE, AND ISAV MUST BE AN INTEGER C ARRAY OF LENGTH 41 OR MORE. C JOB=1 MEANS SAVE COMMON INTO RSAV/ISAV. C JOB=2 MEANS RESTORE COMMON FROM RSAV/ISAV. C SRCOM IS USEFUL IF ONE IS C INTERRUPTING A RUN AND RESTARTING C LATER, OR ALTERNATING BETWEEN TWO OR C MORE PROBLEMS SOLVED WITH LSODE. C C CALL INTDY(,,,,,) PROVIDE DERIVATIVES OF Y, OF VARIOUS C (SEE BELOW) ORDERS, AT A SPECIFIED POINT T, IF C DESIRED. IT MAY BE CALLED ONLY AFTER C A SUCCESSFUL RETURN FROM LSODE. C C THE DETAILED INSTRUCTIONS FOR USING INTDY ARE AS FOLLOWS. C THE FORM OF THE CALL IS.. C C CALL INTDY (T, K, RWORK(21), NYH, DKY, IFLAG) C C THE INPUT PARAMETERS ARE.. C C T = VALUE OF INDEPENDENT VARIABLE WHERE ANSWERS ARE DESIRED C (NORMALLY THE SAME AS THE T LAST RETURNED BY LSODE). C FOR VALID RESULTS, T MUST LIE BETWEEN TCUR - HU AND TCUR. C (SEE OPTIONAL OUTPUTS FOR TCUR AND HU.) C K = INTEGER ORDER OF THE DERIVATIVE DESIRED. K MUST SATISFY C 0 .LE. K .LE. NQCUR, WHERE NQCUR IS THE CURRENT ORDER C (SEE OPTIONAL OUTPUTS). THE CAPABILITY CORRESPONDING C TO K = 0, I.E. COMPUTING Y(T), IS ALREADY PROVIDED C BY LSODE DIRECTLY. SINCE NQCUR .GE. 1, THE FIRST C DERIVATIVE DY/DT IS ALWAYS AVAILABLE WITH INTDY. C RWORK(21) = THE BASE ADDRESS OF THE HISTORY ARRAY YH. C NYH = COLUMN LENGTH OF YH, EQUAL TO THE INITIAL VALUE OF NEQ. C C THE OUTPUT PARAMETERS ARE.. C C DKY = A REAL ARRAY OF LENGTH NEQ CONTAINING THE COMPUTED VALUE C OF THE K-TH DERIVATIVE OF Y(T). C IFLAG = INTEGER FLAG, RETURNED AS 0 IF K AND T WERE LEGAL, C -1 IF K WAS ILLEGAL, AND -2 IF T WAS ILLEGAL. C ON AN ERROR RETURN, A MESSAGE IS ALSO WRITTEN. C----------------------------------------------------------------------- C PART III. COMMON BLOCKS. C C IF LSODE IS TO BE USED IN AN OVERLAY SITUATION, THE USER C MUST DECLARE, IN THE PRIMARY OVERLAY, THE VARIABLES IN.. C (1) THE CALL SEQUENCE TO LSODE, C (2) THE TWO INTERNAL COMMON BLOCKS C /LS0001/ OF LENGTH 257 (218 DOUBLE PRECISION WORDS C FOLLOWED BY 39 INTEGER WORDS), C /EH0001/ OF LENGTH 2 (INTEGER WORDS). C C IF LSODE IS USED ON A SYSTEM IN WHICH THE CONTENTS OF INTERNAL C COMMON BLOCKS ARE NOT PRESERVED BETWEEN CALLS, THE USER SHOULD C DECLARE THE ABOVE TWO COMMON BLOCKS IN HIS MAIN PROGRAM TO INSURE C THAT THEIR CONTENTS ARE PRESERVED. C C IF THE SOLUTION OF A GIVEN PROBLEM BY LSODE IS TO BE INTERRUPTED C AND THEN LATER CONTINUED, SUCH AS WHEN RESTARTING AN INTERRUPTED RUN C OR ALTERNATING BETWEEN TWO OR MORE PROBLEMS, THE USER SHOULD SAVE, C FOLLOWING THE RETURN FROM THE LAST LSODE CALL PRIOR TO THE C INTERRUPTION, THE CONTENTS OF THE CALL SEQUENCE VARIABLES AND THE C INTERNAL COMMON BLOCKS, AND LATER RESTORE THESE VALUES BEFORE THE C NEXT LSODE CALL FOR THAT PROBLEM. TO SAVE AND RESTORE THE COMMON C BLOCKS, USE SUBROUTINE SRCOM (SEE PART II ABOVE). C C----------------------------------------------------------------------- C PART IV. OPTIONALLY REPLACEABLE SOLVER ROUTINES. C C BELOW ARE DESCRIPTIONS OF TWO ROUTINES IN THE LSODE PACKAGE WHICH C RELATE TO THE MEASUREMENT OF ERRORS. EITHER ROUTINE CAN BE C REPLACED BY A USER-SUPPLIED VERSION, IF DESIRED. HOWEVER, SINCE SUCH C A REPLACEMENT MAY HAVE A MAJOR IMPACT ON PERFORMANCE, IT SHOULD BE C DONE ONLY WHEN ABSOLUTELY NECESSARY, AND ONLY WITH GREAT CAUTION. C (NOTE.. THE MEANS BY WHICH THE PACKAGE VERSION OF A ROUTINE IS C SUPERSEDED BY THE USER-S VERSION MAY BE SYSTEM-DEPENDENT.) C C (A) EWSET. C THE FOLLOWING SUBROUTINE IS CALLED JUST BEFORE EACH INTERNAL C INTEGRATION STEP, AND SETS THE ARRAY OF ERROR WEIGHTS, EWT, AS C DESCRIBED UNDER ITOL/RTOL/ATOL ABOVE.. C SUBROUTINE EWSET (NEQ, ITOL, RTOL, ATOL, YCUR, EWT) C WHERE NEQ, ITOL, RTOL, AND ATOL ARE AS IN THE LSODE CALL SEQUENCE, C YCUR CONTAINS THE CURRENT DEPENDENT VARIABLE VECTOR, AND C EWT IS THE ARRAY OF WEIGHTS SET BY EWSET. C C IF THE USER SUPPLIES THIS SUBROUTINE, IT MUST RETURN IN EWT(I) C (I = 1,...,NEQ) A POSITIVE QUANTITY SUITABLE FOR COMPARING ERRORS C IN Y(I) TO. THE EWT ARRAY RETURNED BY EWSET IS PASSED TO THE C VNORM ROUTINE (SEE BELOW), AND ALSO USED BY LSODE IN THE COMPUTATION C OF THE OPTIONAL OUTPUT IMXER, THE DIAGONAL JACOBIAN APPROXIMATION, C AND THE INCREMENTS FOR DIFFERENCE QUOTIENT JACOBIANS. C C IN THE USER-SUPPLIED VERSION OF EWSET, IT MAY BE DESIRABLE TO USE C THE CURRENT VALUES OF DERIVATIVES OF Y. DERIVATIVES UP TO ORDER NQ C ARE AVAILABLE FROM THE HISTORY ARRAY YH, DESCRIBED ABOVE UNDER C OPTIONAL OUTPUTS. IN EWSET, YH IS IDENTICAL TO THE YCUR ARRAY, C EXTENDED TO NQ + 1 COLUMNS WITH A COLUMN LENGTH OF NYH AND SCALE C FACTORS OF H**J/FACTORIAL(J). ON THE FIRST CALL FOR THE PROBLEM, C GIVEN BY NST = 0, NQ IS 1 AND H IS TEMPORARILY SET TO 1.0. C THE QUANTITIES NQ, NYH, H, AND NST CAN BE OBTAINED BY INCLUDING C IN EWSET THE STATEMENTS.. C DOUBLE PRECISION H, RLS C COMMON /LS0001/ RLS(218),ILS(39) C NQ = ILS(35) C NYH = ILS(14) C NST = ILS(36) C H = RLS(212) C THUS, FOR EXAMPLE, THE CURRENT VALUE OF DY/DT CAN BE OBTAINED AS C YCUR(NYH+I)/H (I=1,...,NEQ) (AND THE DIVISION BY H IS C UNNECESSARY WHEN NST = 0). C C (B) VNORM. C THE FOLLOWING IS A REAL FUNCTION ROUTINE WHICH COMPUTES THE WEIGHTED C ROOT-MEAN-SQUARE NORM OF A VECTOR V.. C D = VNORM (N, V, W) C WHERE.. C N = THE LENGTH OF THE VECTOR, C V = REAL ARRAY OF LENGTH N CONTAINING THE VECTOR, C W = REAL ARRAY OF LENGTH N CONTAINING WEIGHTS, C D = SQRT( (1/N) * SUM(V(I)*W(I))**2 ). C VNORM IS CALLED WITH N = NEQ AND WITH W(I) = 1.0/EWT(I), WHERE C EWT IS AS SET BY SUBROUTINE EWSET. C C IF THE USER SUPPLIES THIS FUNCTION, IT SHOULD RETURN A NON-NEGATIVE C VALUE OF VNORM SUITABLE FOR USE IN THE ERROR CONTROL IN LSODE. C NONE OF THE ARGUMENTS SHOULD BE ALTERED BY VNORM. C FOR EXAMPLE, A USER-SUPPLIED VNORM ROUTINE MIGHT.. C -SUBSTITUTE A MAX-NORM OF (V(I)*W(I)) FOR THE RMS-NORM, OR C -IGNORE SOME COMPONENTS OF V IN THE NORM, WITH THE EFFECT OF C SUPPRESSING THE ERROR CONTROL ON THOSE COMPONENTS OF Y. C----------------------------------------------------------------------- C----------------------------------------------------------------------- C OTHER ROUTINES IN THE LSODE PACKAGE. C C IN ADDITION TO SUBROUTINE LSODE, THE LSODE PACKAGE INCLUDES THE C FOLLOWING SUBROUTINES AND FUNCTION ROUTINES.. C INTDY COMPUTES AN INTERPOLATED VALUE OF THE Y VECTOR AT T = TOUT. C STODE IS THE CORE INTEGRATOR, WHICH DOES ONE STEP OF THE C INTEGRATION AND THE ASSOCIATED ERROR CONTROL. C CFODE SETS ALL METHOD COEFFICIENTS AND TEST CONSTANTS. C PREPJ COMPUTES AND PREPROCESSES THE JACOBIAN MATRIX J = DF/DY C AND THE NEWTON ITERATION MATRIX P = I - H*L0*J. C SOLSY MANAGES SOLUTION OF LINEAR SYSTEM IN CHORD ITERATION. C EWSET SETS THE ERROR WEIGHT VECTOR EWT BEFORE EACH STEP. C VNORM COMPUTES THE WEIGHTED R.M.S. NORM OF A VECTOR. C SRCOM IS A USER-CALLABLE ROUTINE TO SAVE AND RESTORE C THE CONTENTS OF THE INTERNAL COMMON BLOCKS. C DGEFA AND DGESL ARE ROUTINES FROM LINPACK FOR SOLVING FULL C SYSTEMS OF LINEAR ALGEBRAIC EQUATIONS. C DGBFA AND DGBSL ARE ROUTINES FROM LINPACK FOR SOLVING BANDED C LINEAR SYSTEMS. C DAXPY, DSCAL, IDAMAX, AND DDOT ARE BASIC LINEAR ALGEBRA MODULES C (BLAS) USED BY THE ABOVE LINPACK ROUTINES. C D1MACH COMPUTES THE UNIT ROUNDOFF IN A MACHINE-INDEPENDENT MANNER. C XERRWV, XSETUN, AND XSETF HANDLE THE PRINTING OF ALL ERROR C MESSAGES AND WARNINGS. XERRWV IS MACHINE-DEPENDENT. C NOTE.. VNORM, IDAMAX, DDOT, AND D1MACH ARE FUNCTION ROUTINES. C ALL THE OTHERS ARE SUBROUTINES. C C THE INTRINSIC AND EXTERNAL ROUTINES USED BY LSODE ARE.. C DABS, DMAX1, DMIN1, DBLE, MAX0, MIN0, MOD, DSIGN, DSQRT, AND WRITE. C C A BLOCK DATA SUBPROGRAM IS ALSO INCLUDED WITH THE PACKAGE, C FOR LOADING SOME OF THE VARIABLES IN INTERNAL COMMON. C C----------------------------------------------------------------------- C THE FOLLOWING CARD IS FOR OPTIMIZED COMPILATION ON LLNL COMPILERS. CLLL. OPTIMIZE C----------------------------------------------------------------------- EXTERNAL PREPJ, SOLSY INTEGER ILLIN, INIT, LYH, LEWT, LACOR, LSAVF, LWM, LIWM, 1 MXSTEP, MXHNIL, NHNIL, NTREP, NSLAST, NYH, IOWNS INTEGER ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 1 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU INTEGER I, I1, I2, IFLAG, IMXER, KGO, LF0, 1 LENIW, LENRW, LENWM, ML, MORD, MU, MXHNL0, MXSTP0 DOUBLE PRECISION ROWNS, 1 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND DOUBLE PRECISION ATOLI, AYI, BIG, EWTI, H0, HMAX, HMX, RH, RTOLI, 1 TCRIT, TDIST, TNEXT, TOL, TOLSF, TP, SIZE, SUM, W0, 2 D1MACH, VNORM DIMENSION MORD(2) LOGICAL IHIT C----------------------------------------------------------------------- C THE FOLLOWING INTERNAL COMMON BLOCK CONTAINS C (A) VARIABLES WHICH ARE LOCAL TO ANY SUBROUTINE BUT WHOSE VALUES MUST C BE PRESERVED BETWEEN CALLS TO THE ROUTINE (OWN VARIABLES), AND C (B) VARIABLES WHICH ARE COMMUNICATED BETWEEN SUBROUTINES. C THE STRUCTURE OF THE BLOCK IS AS FOLLOWS.. ALL REAL VARIABLES ARE C LISTED FIRST, FOLLOWED BY ALL INTEGERS. WITHIN EACH TYPE, THE C VARIABLES ARE GROUPED WITH THOSE LOCAL TO SUBROUTINE LSODE FIRST, C THEN THOSE LOCAL TO SUBROUTINE STODE, AND FINALLY THOSE USED C FOR COMMUNICATION. THE BLOCK IS DECLARED IN SUBROUTINES C LSODE, INTDY, STODE, PREPJ, AND SOLSY. GROUPS OF VARIABLES ARE C REPLACED BY DUMMY ARRAYS IN THE COMMON DECLARATIONS IN ROUTINES C WHERE THOSE VARIABLES ARE NOT USED. C----------------------------------------------------------------------- COMMON /LS0001/ ROWNS(209), 1 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND, 2 ILLIN, INIT, LYH, LEWT, LACOR, LSAVF, LWM, LIWM, 3 MXSTEP, MXHNIL, NHNIL, NTREP, NSLAST, NYH, IOWNS(6), 4 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 5 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU C DATA MORD(1),MORD(2)/12,5/, MXSTP0/500/, MXHNL0/10/ C----------------------------------------------------------------------- C BLOCK A. C THIS CODE BLOCK IS EXECUTED ON EVERY CALL. C IT TESTS ISTATE AND ITASK FOR LEGALITY AND BRANCHES APPROPRIATELY. C IF ISTATE .GT. 1 BUT THE FLAG INIT SHOWS THAT INITIALIZATION HAS C NOT YET BEEN DONE, AN ERROR RETURN OCCURS. C IF ISTATE = 1 AND TOUT = T, JUMP TO BLOCK G AND RETURN IMMEDIATELY. C----------------------------------------------------------------------- IF (ISTATE .LT. 1 .OR. ISTATE .GT. 3) GO TO 601 IF (ITASK .LT. 1 .OR. ITASK .GT. 5) GO TO 602 IF (ISTATE .EQ. 1) GO TO 10 IF (INIT .EQ. 0) GO TO 603 IF (ISTATE .EQ. 2) GO TO 200 GO TO 20 10 INIT = 0 IF (TOUT .EQ. T) GO TO 430 20 NTREP = 0 C----------------------------------------------------------------------- C BLOCK B. C THE NEXT CODE BLOCK IS EXECUTED FOR THE INITIAL CALL (ISTATE = 1), C OR FOR A CONTINUATION CALL WITH PARAMETER CHANGES (ISTATE = 3). C IT CONTAINS CHECKING OF ALL INPUTS AND VARIOUS INITIALIZATIONS. C C FIRST CHECK LEGALITY OF THE NON-OPTIONAL INPUTS NEQ, ITOL, IOPT, C MF, ML, AND MU. C----------------------------------------------------------------------- IF (NEQ(1) .LE. 0) GO TO 604 IF (ISTATE .EQ. 1) GO TO 25 IF (NEQ(1) .GT. N) GO TO 605 25 N = NEQ(1) IF (ITOL .LT. 1 .OR. ITOL .GT. 4) GO TO 606 IF (IOPT .LT. 0 .OR. IOPT .GT. 1) GO TO 607 METH = MF/10 MITER = MF - 10*METH IF (METH .LT. 1 .OR. METH .GT. 2) GO TO 608 IF (MITER .LT. 0 .OR. MITER .GT. 5) GO TO 608 IF (MITER .LE. 3) GO TO 30 ML = IWORK(1) MU = IWORK(2) IF (ML .LT. 0 .OR. ML .GE. N) GO TO 609 IF (MU .LT. 0 .OR. MU .GE. N) GO TO 610 30 CONTINUE C NEXT PROCESS AND CHECK THE OPTIONAL INPUTS. -------------------------- IF (IOPT .EQ. 1) GO TO 40 MAXORD = MORD(METH) MXSTEP = MXSTP0 MXHNIL = MXHNL0 IF (ISTATE .EQ. 1) H0 = 0.0D0 HMXI = 0.0D0 HMIN = 0.0D0 GO TO 60 40 MAXORD = IWORK(5) IF (MAXORD .LT. 0) GO TO 611 IF (MAXORD .EQ. 0) MAXORD = 100 MAXORD = MIN0(MAXORD,MORD(METH)) MXSTEP = IWORK(6) IF (MXSTEP .LT. 0) GO TO 612 IF (MXSTEP .EQ. 0) MXSTEP = MXSTP0 MXHNIL = IWORK(7) IF (MXHNIL .LT. 0) GO TO 613 IF (MXHNIL .EQ. 0) MXHNIL = MXHNL0 IF (ISTATE .NE. 1) GO TO 50 H0 = RWORK(5) IF ((TOUT - T)*H0 .LT. 0.0D0) GO TO 614 50 HMAX = RWORK(6) IF (HMAX .LT. 0.0D0) GO TO 615 HMXI = 0.0D0 IF (HMAX .GT. 0.0D0) HMXI = 1.0D0/HMAX HMIN = RWORK(7) IF (HMIN .LT. 0.0D0) GO TO 616 C----------------------------------------------------------------------- C SET WORK ARRAY POINTERS AND CHECK LENGTHS LRW AND LIW. C POINTERS TO SEGMENTS OF RWORK AND IWORK ARE NAMED BY PREFIXING L TO C THE NAME OF THE SEGMENT. E.G., THE SEGMENT YH STARTS AT RWORK(LYH). C SEGMENTS OF RWORK (IN ORDER) ARE DENOTED YH, WM, EWT, SAVF, ACOR. C----------------------------------------------------------------------- 60 LYH = 21 IF (ISTATE .EQ. 1) NYH = N LWM = LYH + (MAXORD + 1)*NYH IF (MITER .EQ. 0) LENWM = 0 IF (MITER .EQ. 1 .OR. MITER .EQ. 2) LENWM = N*N + 2 IF (MITER .EQ. 3) LENWM = N + 2 IF (MITER .GE. 4) LENWM = (2*ML + MU + 1)*N + 2 LEWT = LWM + LENWM LSAVF = LEWT + N LACOR = LSAVF + N LENRW = LACOR + N - 1 IWORK(17) = LENRW LIWM = 1 LENIW = 20 + N IF (MITER .EQ. 0 .OR. MITER .EQ. 3) LENIW = 20 IWORK(18) = LENIW IF (LENRW .GT. LRW) GO TO 617 IF (LENIW .GT. LIW) GO TO 618 C CHECK RTOL AND ATOL FOR LEGALITY. ------------------------------------ RTOLI = RTOL(1) ATOLI = ATOL(1) DO 70 I = 1,N IF (ITOL .GE. 3) RTOLI = RTOL(I) IF (ITOL .EQ. 2 .OR. ITOL .EQ. 4) ATOLI = ATOL(I) IF (RTOLI .LT. 0.0D0) GO TO 619 IF (ATOLI .LT. 0.0D0) GO TO 620 70 CONTINUE IF (ISTATE .EQ. 1) GO TO 100 C IF ISTATE = 3, SET FLAG TO SIGNAL PARAMETER CHANGES TO STODE. -------- JSTART = -1 IF (NQ .LE. MAXORD) GO TO 90 C MAXORD WAS REDUCED BELOW NQ. COPY YH(*,MAXORD+2) INTO SAVF. --------- DO 80 I = 1,N 80 RWORK(I+LSAVF-1) = RWORK(I+LWM-1) C RELOAD WM(1) = RWORK(LWM), SINCE LWM MAY HAVE CHANGED. --------------- 90 IF (MITER .GT. 0) RWORK(LWM) = DSQRT(UROUND) IF (N .EQ. NYH) GO TO 200 C NEQ WAS REDUCED. ZERO PART OF YH TO AVOID UNDEFINED REFERENCES. ----- I1 = LYH + L*NYH I2 = LYH + (MAXORD + 1)*NYH - 1 IF (I1 .GT. I2) GO TO 200 DO 95 I = I1,I2 95 RWORK(I) = 0.0D0 GO TO 200 C----------------------------------------------------------------------- C BLOCK C. C THE NEXT BLOCK IS FOR THE INITIAL CALL ONLY (ISTATE = 1). C IT CONTAINS ALL REMAINING INITIALIZATIONS, THE INITIAL CALL TO F, C AND THE CALCULATION OF THE INITIAL STEP SIZE. C THE ERROR WEIGHTS IN EWT ARE INVERTED AFTER BEING LOADED. C----------------------------------------------------------------------- 100 UROUND = D1MACH(4) TN = T IF (ITASK .NE. 4 .AND. ITASK .NE. 5) GO TO 110 TCRIT = RWORK(1) IF ((TCRIT - TOUT)*(TOUT - T) .LT. 0.0D0) GO TO 625 IF (H0 .NE. 0.0D0 .AND. (T + H0 - TCRIT)*H0 .GT. 0.0D0) 1 H0 = TCRIT - T 110 JSTART = 0 IF (MITER .GT. 0) RWORK(LWM) = DSQRT(UROUND) NHNIL = 0 NST = 0 NJE = 0 NSLAST = 0 HU = 0.0D0 NQU = 0 CCMAX = 0.3D0 MAXCOR = 3 MSBP = 20 MXNCF = 10 C INITIAL CALL TO F. (LF0 POINTS TO YH(*,2).) ------------------------- LF0 = LYH + NYH IERR = 0 CALL F (NEQ, T, Y, RWORK(LF0), IERR) IF (IERR .LT. 0) THEN ISTATE = -13 RETURN ENDIF NFE = 1 C LOAD THE INITIAL VALUE VECTOR IN YH. --------------------------------- DO 115 I = 1,N 115 RWORK(I+LYH-1) = Y(I) C LOAD AND INVERT THE EWT ARRAY. (H IS TEMPORARILY SET TO 1.0.) ------- NQ = 1 H = 1.0D0 CALL EWSET (N, ITOL, RTOL, ATOL, RWORK(LYH), RWORK(LEWT)) DO 120 I = 1,N IF (RWORK(I+LEWT-1) .LE. 0.0D0) GO TO 621 120 RWORK(I+LEWT-1) = 1.0D0/RWORK(I+LEWT-1) C----------------------------------------------------------------------- C THE CODING BELOW COMPUTES THE STEP SIZE, H0, TO BE ATTEMPTED ON THE C FIRST STEP, UNLESS THE USER HAS SUPPLIED A VALUE FOR THIS. C FIRST CHECK THAT TOUT - T DIFFERS SIGNIFICANTLY FROM ZERO. C A SCALAR TOLERANCE QUANTITY TOL IS COMPUTED, AS MAX(RTOL(I)) C IF THIS IS POSITIVE, OR MAX(ATOL(I)/ABS(Y(I))) OTHERWISE, ADJUSTED C SO AS TO BE BETWEEN 100*UROUND AND 1.0E-3. C THEN THE COMPUTED VALUE H0 IS GIVEN BY.. C NEQ C H0**2 = TOL / ( W0**-2 + (1/NEQ) * SUM ( F(I)/YWT(I) )**2 ) C 1 C WHERE W0 = MAX ( ABS(T), ABS(TOUT) ), C F(I) = I-TH COMPONENT OF INITIAL VALUE OF F, C YWT(I) = EWT(I)/TOL (A WEIGHT FOR Y(I)). C THE SIGN OF H0 IS INFERRED FROM THE INITIAL VALUES OF TOUT AND T. C----------------------------------------------------------------------- IF (H0 .NE. 0.0D0) GO TO 180 TDIST = DABS(TOUT - T) W0 = DMAX1(DABS(T),DABS(TOUT)) IF (TDIST .LT. 2.0D0*UROUND*W0) GO TO 622 TOL = RTOL(1) IF (ITOL .LE. 2) GO TO 140 DO 130 I = 1,N 130 TOL = DMAX1(TOL,RTOL(I)) 140 IF (TOL .GT. 0.0D0) GO TO 160 ATOLI = ATOL(1) DO 150 I = 1,N IF (ITOL .EQ. 2 .OR. ITOL .EQ. 4) ATOLI = ATOL(I) AYI = DABS(Y(I)) IF (AYI .NE. 0.0D0) TOL = DMAX1(TOL,ATOLI/AYI) 150 CONTINUE 160 TOL = DMAX1(TOL,100.0D0*UROUND) TOL = DMIN1(TOL,0.001D0) SUM = VNORM (N, RWORK(LF0), RWORK(LEWT)) SUM = 1.0D0/(TOL*W0*W0) + TOL*SUM**2 H0 = 1.0D0/DSQRT(SUM) H0 = DMIN1(H0,TDIST) H0 = DSIGN(H0,TOUT-T) C ADJUST H0 IF NECESSARY TO MEET HMAX BOUND. --------------------------- 180 RH = DABS(H0)*HMXI IF (RH .GT. 1.0D0) H0 = H0/RH C LOAD H WITH H0 AND SCALE YH(*,2) BY H0. ------------------------------ H = H0 DO 190 I = 1,N 190 RWORK(I+LF0-1) = H0*RWORK(I+LF0-1) GO TO 270 C----------------------------------------------------------------------- C BLOCK D. C THE NEXT CODE BLOCK IS FOR CONTINUATION CALLS ONLY (ISTATE = 2 OR 3) C AND IS TO CHECK STOP CONDITIONS BEFORE TAKING A STEP. C----------------------------------------------------------------------- 200 NSLAST = NST GO TO (210, 250, 220, 230, 240), ITASK 210 IF ((TN - TOUT)*H .LT. 0.0D0) GO TO 250 CALL INTDY (TOUT, 0, RWORK(LYH), NYH, Y, IFLAG) IF (IFLAG .NE. 0) GO TO 627 T = TOUT GO TO 420 220 TP = TN - HU*(1.0D0 + 100.0D0*UROUND) IF ((TP - TOUT)*H .GT. 0.0D0) GO TO 623 IF ((TN - TOUT)*H .LT. 0.0D0) GO TO 250 GO TO 400 230 TCRIT = RWORK(1) IF ((TN - TCRIT)*H .GT. 0.0D0) GO TO 624 IF ((TCRIT - TOUT)*H .LT. 0.0D0) GO TO 625 IF ((TN - TOUT)*H .LT. 0.0D0) GO TO 245 CALL INTDY (TOUT, 0, RWORK(LYH), NYH, Y, IFLAG) IF (IFLAG .NE. 0) GO TO 627 T = TOUT GO TO 420 240 TCRIT = RWORK(1) IF ((TN - TCRIT)*H .GT. 0.0D0) GO TO 624 245 HMX = DABS(TN) + DABS(H) IHIT = DABS(TN - TCRIT) .LE. 100.0D0*UROUND*HMX IF (IHIT) GO TO 400 TNEXT = TN + H*(1.0D0 + 4.0D0*UROUND) IF ((TNEXT - TCRIT)*H .LE. 0.0D0) GO TO 250 H = (TCRIT - TN)*(1.0D0 - 4.0D0*UROUND) IF (ISTATE .EQ. 2) JSTART = -2 C----------------------------------------------------------------------- C BLOCK E. C THE NEXT BLOCK IS NORMALLY EXECUTED FOR ALL CALLS AND CONTAINS C THE CALL TO THE ONE-STEP CORE INTEGRATOR STODE. C C THIS IS A LOOPING POINT FOR THE INTEGRATION STEPS. C C FIRST CHECK FOR TOO MANY STEPS BEING TAKEN, UPDATE EWT (IF NOT AT C START OF PROBLEM), CHECK FOR TOO MUCH ACCURACY BEING REQUESTED, AND C CHECK FOR H BELOW THE ROUNDOFF LEVEL IN T. C----------------------------------------------------------------------- 250 CONTINUE IF ((NST-NSLAST) .GE. MXSTEP) GO TO 500 CALL EWSET (N, ITOL, RTOL, ATOL, RWORK(LYH), RWORK(LEWT)) DO 260 I = 1,N IF (RWORK(I+LEWT-1) .LE. 0.0D0) GO TO 510 260 RWORK(I+LEWT-1) = 1.0D0/RWORK(I+LEWT-1) 270 TOLSF = UROUND*VNORM (N, RWORK(LYH), RWORK(LEWT)) IF (TOLSF .LE. 1.0D0) GO TO 280 TOLSF = TOLSF*2.0D0 IF (NST .EQ. 0) GO TO 626 GO TO 520 280 IF ((TN + H) .NE. TN) GO TO 290 NHNIL = NHNIL + 1 IF (NHNIL .GT. MXHNIL) GO TO 290 CALL XERRWV(50HLSODE-- WARNING..INTERNAL T (=R1) AND H (=R2) ARE, 1 50, 101, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV( 1 60H SUCH THAT IN THE MACHINE, T + H = T ON THE NEXT STEP , 1 60, 101, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H (H = STEP SIZE). SOLVER WILL CONTINUE ANYWAY, 1 50, 101, 0, 0, 0, 0, 2, TN, H) IF (NHNIL .LT. MXHNIL) GO TO 290 CALL XERRWV(50HLSODE-- ABOVE WARNING HAS BEEN ISSUED I1 TIMES. , 1 50, 102, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H IT WILL NOT BE ISSUED AGAIN FOR THIS PROBLEM, 1 50, 102, 0, 1, MXHNIL, 0, 0, 0.0D0, 0.0D0) 290 CONTINUE C----------------------------------------------------------------------- C CALL STODE(NEQ,Y,YH,NYH,YH,EWT,SAVF,ACOR,WM,IWM,F,JAC,PREPJ,SOLSY) C----------------------------------------------------------------------- IERR = 0 CALL STODE (NEQ, Y, RWORK(LYH), NYH, RWORK(LYH), RWORK(LEWT), 1 RWORK(LSAVF), RWORK(LACOR), RWORK(LWM), IWORK(LIWM), 2 F, JAC, PREPJ, SOLSY, IERR) IF (IERR .LT. 0) THEN ISTATE = -13 RETURN ENDIF KGO = 1 - KFLAG GO TO (300, 530, 540), KGO C----------------------------------------------------------------------- C BLOCK F. C THE FOLLOWING BLOCK HANDLES THE CASE OF A SUCCESSFUL RETURN FROM THE C CORE INTEGRATOR (KFLAG = 0). TEST FOR STOP CONDITIONS. C----------------------------------------------------------------------- 300 INIT = 1 GO TO (310, 400, 330, 340, 350), ITASK C ITASK = 1. IF TOUT HAS BEEN REACHED, INTERPOLATE. ------------------- 310 IF ((TN - TOUT)*H .LT. 0.0D0) GO TO 250 CALL INTDY (TOUT, 0, RWORK(LYH), NYH, Y, IFLAG) T = TOUT GO TO 420 C ITASK = 3. JUMP TO EXIT IF TOUT WAS REACHED. ------------------------ 330 IF ((TN - TOUT)*H .GE. 0.0D0) GO TO 400 GO TO 250 C ITASK = 4. SEE IF TOUT OR TCRIT WAS REACHED. ADJUST H IF NECESSARY. 340 IF ((TN - TOUT)*H .LT. 0.0D0) GO TO 345 CALL INTDY (TOUT, 0, RWORK(LYH), NYH, Y, IFLAG) T = TOUT GO TO 420 345 HMX = DABS(TN) + DABS(H) IHIT = DABS(TN - TCRIT) .LE. 100.0D0*UROUND*HMX IF (IHIT) GO TO 400 TNEXT = TN + H*(1.0D0 + 4.0D0*UROUND) IF ((TNEXT - TCRIT)*H .LE. 0.0D0) GO TO 250 H = (TCRIT - TN)*(1.0D0 - 4.0D0*UROUND) JSTART = -2 GO TO 250 C ITASK = 5. SEE IF TCRIT WAS REACHED AND JUMP TO EXIT. --------------- 350 HMX = DABS(TN) + DABS(H) IHIT = DABS(TN - TCRIT) .LE. 100.0D0*UROUND*HMX C----------------------------------------------------------------------- C BLOCK G. C THE FOLLOWING BLOCK HANDLES ALL SUCCESSFUL RETURNS FROM LSODE. C IF ITASK .NE. 1, Y IS LOADED FROM YH AND T IS SET ACCORDINGLY. C ISTATE IS SET TO 2, THE ILLEGAL INPUT COUNTER IS ZEROED, AND THE C OPTIONAL OUTPUTS ARE LOADED INTO THE WORK ARRAYS BEFORE RETURNING. C IF ISTATE = 1 AND TOUT = T, THERE IS A RETURN WITH NO ACTION TAKEN, C EXCEPT THAT IF THIS HAS HAPPENED REPEATEDLY, THE RUN IS TERMINATED. C----------------------------------------------------------------------- 400 DO 410 I = 1,N 410 Y(I) = RWORK(I+LYH-1) T = TN IF (ITASK .NE. 4 .AND. ITASK .NE. 5) GO TO 420 IF (IHIT) T = TCRIT 420 ISTATE = 2 ILLIN = 0 RWORK(11) = HU RWORK(12) = H RWORK(13) = TN IWORK(11) = NST IWORK(12) = NFE IWORK(13) = NJE IWORK(14) = NQU IWORK(15) = NQ RETURN C 430 NTREP = NTREP + 1 IF (NTREP .LT. 5) RETURN CALL XERRWV( 1 60HLSODE-- REPEATED CALLS WITH ISTATE = 1 AND TOUT = T (=R1) , 1 60, 301, 0, 0, 0, 0, 1, T, 0.0D0) GO TO 800 C----------------------------------------------------------------------- C BLOCK H. C THE FOLLOWING BLOCK HANDLES ALL UNSUCCESSFUL RETURNS OTHER THAN C THOSE FOR ILLEGAL INPUT. FIRST THE ERROR MESSAGE ROUTINE IS CALLED. C IF THERE WAS AN ERROR TEST OR CONVERGENCE TEST FAILURE, IMXER IS SET. C THEN Y IS LOADED FROM YH, T IS SET TO TN, AND THE ILLEGAL INPUT C COUNTER ILLIN IS SET TO 0. THE OPTIONAL OUTPUTS ARE LOADED INTO C THE WORK ARRAYS BEFORE RETURNING. C----------------------------------------------------------------------- C THE MAXIMUM NUMBER OF STEPS WAS TAKEN BEFORE REACHING TOUT. ---------- 500 CALL XERRWV(50HLSODE-- AT CURRENT T (=R1), MXSTEP (=I1) STEPS , 1 50, 201, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H TAKEN ON THIS CALL BEFORE REACHING TOUT , 1 50, 201, 0, 1, MXSTEP, 0, 1, TN, 0.0D0) ISTATE = -1 GO TO 580 C EWT(I) .LE. 0.0 FOR SOME I (NOT AT START OF PROBLEM). ---------------- 510 EWTI = RWORK(LEWT+I-1) CALL XERRWV(50HLSODE-- AT T (=R1), EWT(I1) HAS BECOME R2 .LE. 0., 1 50, 202, 0, 1, I, 0, 2, TN, EWTI) ISTATE = -6 GO TO 580 C TOO MUCH ACCURACY REQUESTED FOR MACHINE PRECISION. ------------------- 520 CALL XERRWV(50HLSODE-- AT T (=R1), TOO MUCH ACCURACY REQUESTED , 1 50, 203, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H FOR PRECISION OF MACHINE.. SEE TOLSF (=R2) , 1 50, 203, 0, 0, 0, 0, 2, TN, TOLSF) RWORK(14) = TOLSF ISTATE = -2 GO TO 580 C KFLAG = -1. ERROR TEST FAILED REPEATEDLY OR WITH ABS(H) = HMIN. ----- 530 CALL XERRWV(50HLSODE-- AT T(=R1) AND STEP SIZE H(=R2), THE ERROR, 1 50, 204, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H TEST FAILED REPEATEDLY OR WITH ABS(H) = HMIN, 1 50, 204, 0, 0, 0, 0, 2, TN, H) ISTATE = -4 GO TO 560 C KFLAG = -2. CONVERGENCE FAILED REPEATEDLY OR WITH ABS(H) = HMIN. ---- 540 CALL XERRWV(50HLSODE-- AT T (=R1) AND STEP SIZE H (=R2), THE , 1 50, 205, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(50H CORRECTOR CONVERGENCE FAILED REPEATEDLY , 1 50, 205, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV(30H OR WITH ABS(H) = HMIN , 1 30, 205, 0, 0, 0, 0, 2, TN, H) ISTATE = -5 C COMPUTE IMXER IF RELEVANT. ------------------------------------------- 560 BIG = 0.0D0 IMXER = 1 DO 570 I = 1,N SIZE = DABS(RWORK(I+LACOR-1)*RWORK(I+LEWT-1)) IF (BIG .GE. SIZE) GO TO 570 BIG = SIZE IMXER = I 570 CONTINUE IWORK(16) = IMXER C SET Y VECTOR, T, ILLIN, AND OPTIONAL OUTPUTS. ------------------------ 580 DO 590 I = 1,N 590 Y(I) = RWORK(I+LYH-1) T = TN ILLIN = 0 RWORK(11) = HU RWORK(12) = H RWORK(13) = TN IWORK(11) = NST IWORK(12) = NFE IWORK(13) = NJE IWORK(14) = NQU IWORK(15) = NQ RETURN C----------------------------------------------------------------------- C BLOCK I. C THE FOLLOWING BLOCK HANDLES ALL ERROR RETURNS DUE TO ILLEGAL INPUT C (ISTATE = -3), AS DETECTED BEFORE CALLING THE CORE INTEGRATOR. C FIRST THE ERROR MESSAGE ROUTINE IS CALLED. THEN IF THERE HAVE BEEN C 5 CONSECUTIVE SUCH RETURNS JUST BEFORE THIS CALL TO THE SOLVER, C THE RUN IS HALTED. C----------------------------------------------------------------------- 601 CALL XERRWV(30HLSODE-- ISTATE (=I1) ILLEGAL , 1 30, 1, 0, 1, ISTATE, 0, 0, 0.0D0, 0.0D0) GO TO 700 602 CALL XERRWV(30HLSODE-- ITASK (=I1) ILLEGAL , 1 30, 2, 0, 1, ITASK, 0, 0, 0.0D0, 0.0D0) GO TO 700 603 CALL XERRWV(50HLSODE-- ISTATE .GT. 1 BUT LSODE NOT INITIALIZED , 1 50, 3, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) GO TO 700 604 CALL XERRWV(30HLSODE-- NEQ (=I1) .LT. 1 , 1 30, 4, 0, 1, NEQ(1), 0, 0, 0.0D0, 0.0D0) GO TO 700 605 CALL XERRWV(50HLSODE-- ISTATE = 3 AND NEQ INCREASED (I1 TO I2) , 1 50, 5, 0, 2, N, NEQ(1), 0, 0.0D0, 0.0D0) GO TO 700 606 CALL XERRWV(30HLSODE-- ITOL (=I1) ILLEGAL , 1 30, 6, 0, 1, ITOL, 0, 0, 0.0D0, 0.0D0) GO TO 700 607 CALL XERRWV(30HLSODE-- IOPT (=I1) ILLEGAL , 1 30, 7, 0, 1, IOPT, 0, 0, 0.0D0, 0.0D0) GO TO 700 608 CALL XERRWV(30HLSODE-- MF (=I1) ILLEGAL , 1 30, 8, 0, 1, MF, 0, 0, 0.0D0, 0.0D0) GO TO 700 609 CALL XERRWV(50HLSODE-- ML (=I1) ILLEGAL.. .LT.0 OR .GE.NEQ (=I2), 1 50, 9, 0, 2, ML, NEQ(1), 0, 0.0D0, 0.0D0) GO TO 700 610 CALL XERRWV(50HLSODE-- MU (=I1) ILLEGAL.. .LT.0 OR .GE.NEQ (=I2), 1 50, 10, 0, 2, MU, NEQ(1), 0, 0.0D0, 0.0D0) GO TO 700 611 CALL XERRWV(30HLSODE-- MAXORD (=I1) .LT. 0 , 1 30, 11, 0, 1, MAXORD, 0, 0, 0.0D0, 0.0D0) GO TO 700 612 CALL XERRWV(30HLSODE-- MXSTEP (=I1) .LT. 0 , 1 30, 12, 0, 1, MXSTEP, 0, 0, 0.0D0, 0.0D0) GO TO 700 613 CALL XERRWV(30HLSODE-- MXHNIL (=I1) .LT. 0 , 1 30, 13, 0, 1, MXHNIL, 0, 0, 0.0D0, 0.0D0) GO TO 700 614 CALL XERRWV(40HLSODE-- TOUT (=R1) BEHIND T (=R2) , 1 40, 14, 0, 0, 0, 0, 2, TOUT, T) CALL XERRWV(50H INTEGRATION DIRECTION IS GIVEN BY H0 (=R1) , 1 50, 14, 0, 0, 0, 0, 1, H0, 0.0D0) GO TO 700 615 CALL XERRWV(30HLSODE-- HMAX (=R1) .LT. 0.0 , 1 30, 15, 0, 0, 0, 0, 1, HMAX, 0.0D0) GO TO 700 616 CALL XERRWV(30HLSODE-- HMIN (=R1) .LT. 0.0 , 1 30, 16, 0, 0, 0, 0, 1, HMIN, 0.0D0) GO TO 700 617 CALL XERRWV( 1 60HLSODE-- RWORK LENGTH NEEDED, LENRW (=I1), EXCEEDS LRW (=I2), 1 60, 17, 0, 2, LENRW, LRW, 0, 0.0D0, 0.0D0) GO TO 700 618 CALL XERRWV( 1 60HLSODE-- IWORK LENGTH NEEDED, LENIW (=I1), EXCEEDS LIW (=I2), 1 60, 18, 0, 2, LENIW, LIW, 0, 0.0D0, 0.0D0) GO TO 700 619 CALL XERRWV(40HLSODE-- RTOL(I1) IS R1 .LT. 0.0 , 1 40, 19, 0, 1, I, 0, 1, RTOLI, 0.0D0) GO TO 700 620 CALL XERRWV(40HLSODE-- ATOL(I1) IS R1 .LT. 0.0 , 1 40, 20, 0, 1, I, 0, 1, ATOLI, 0.0D0) GO TO 700 621 EWTI = RWORK(LEWT+I-1) CALL XERRWV(40HLSODE-- EWT(I1) IS R1 .LE. 0.0 , 1 40, 21, 0, 1, I, 0, 1, EWTI, 0.0D0) GO TO 700 622 CALL XERRWV( 1 60HLSODE-- TOUT (=R1) TOO CLOSE TO T(=R2) TO START INTEGRATION, 1 60, 22, 0, 0, 0, 0, 2, TOUT, T) GO TO 700 623 CALL XERRWV( 1 60HLSODE-- ITASK = I1 AND TOUT (=R1) BEHIND TCUR - HU (= R2) , 1 60, 23, 0, 1, ITASK, 0, 2, TOUT, TP) GO TO 700 624 CALL XERRWV( 1 60HLSODE-- ITASK = 4 OR 5 AND TCRIT (=R1) BEHIND TCUR (=R2) , 1 60, 24, 0, 0, 0, 0, 2, TCRIT, TN) GO TO 700 625 CALL XERRWV( 1 60HLSODE-- ITASK = 4 OR 5 AND TCRIT (=R1) BEHIND TOUT (=R2) , 1 60, 25, 0, 0, 0, 0, 2, TCRIT, TOUT) GO TO 700 626 CALL XERRWV(50HLSODE-- AT START OF PROBLEM, TOO MUCH ACCURACY , 1 50, 26, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) CALL XERRWV( 1 60H REQUESTED FOR PRECISION OF MACHINE.. SEE TOLSF (=R1) , 1 60, 26, 0, 0, 0, 0, 1, TOLSF, 0.0D0) RWORK(14) = TOLSF GO TO 700 627 CALL XERRWV(50HLSODE-- TROUBLE FROM INTDY. ITASK = I1, TOUT = R1, 1 50, 27, 0, 1, ITASK, 0, 1, TOUT, 0.0D0) C 700 IF (ILLIN .EQ. 5) GO TO 710 ILLIN = ILLIN + 1 ISTATE = -3 RETURN 710 CALL XERRWV(50HLSODE-- REPEATED OCCURRENCES OF ILLEGAL INPUT , 1 50, 302, 0, 0, 0, 0, 0, 0.0D0, 0.0D0) C 800 CALL XERRWV(50HLSODE-- RUN ABORTED.. APPARENT INFINITE LOOP , 1 50, 303, 2, 0, 0, 0, 0, 0.0D0, 0.0D0) RETURN C----------------------- END OF SUBROUTINE LSODE ----------------------- END octave-1.1.0/libcruft/odepack/prepj.f100666 415 17 14672 5503251265 15703 0ustar jweusers SUBROUTINE PREPJ (NEQ, Y, YH, NYH, EWT, FTEM, SAVF, WM, IWM, 1 F, JAC, IERR) CLLL. OPTIMIZE EXTERNAL F, JAC INTEGER NEQ, NYH, IWM INTEGER IOWND, IOWNS, 1 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 2 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU INTEGER I, I1, I2, IER, II, J, J1, JJ, LENP, 1 MBA, MBAND, MEB1, MEBAND, ML, ML3, MU, NP1 DOUBLE PRECISION Y, YH, EWT, FTEM, SAVF, WM DOUBLE PRECISION ROWNS, 1 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND DOUBLE PRECISION CON, DI, FAC, HL0, R, R0, SRUR, YI, YJ, YJJ, 1 VNORM DIMENSION NEQ(1), Y(1), YH(NYH,1), EWT(1), FTEM(1), SAVF(1), 1 WM(1), IWM(1) COMMON /LS0001/ ROWNS(209), 2 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND, 3 IOWND(14), IOWNS(6), 4 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 5 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU C----------------------------------------------------------------------- C PREPJ IS CALLED BY STODE TO COMPUTE AND PROCESS THE MATRIX C P = I - H*EL(1)*J , WHERE J IS AN APPROXIMATION TO THE JACOBIAN. C HERE J IS COMPUTED BY THE USER-SUPPLIED ROUTINE JAC IF C MITER = 1 OR 4, OR BY FINITE DIFFERENCING IF MITER = 2, 3, OR 5. C IF MITER = 3, A DIAGONAL APPROXIMATION TO J IS USED. C J IS STORED IN WM AND REPLACED BY P. IF MITER .NE. 3, P IS THEN C SUBJECTED TO LU DECOMPOSITION IN PREPARATION FOR LATER SOLUTION C OF LINEAR SYSTEMS WITH P AS COEFFICIENT MATRIX. THIS IS DONE C BY DGEFA IF MITER = 1 OR 2, AND BY DGBFA IF MITER = 4 OR 5. C C IN ADDITION TO VARIABLES DESCRIBED PREVIOUSLY, COMMUNICATION C WITH PREPJ USES THE FOLLOWING.. C Y = ARRAY CONTAINING PREDICTED VALUES ON ENTRY. C FTEM = WORK ARRAY OF LENGTH N (ACOR IN STODE). C SAVF = ARRAY CONTAINING F EVALUATED AT PREDICTED Y. C WM = REAL WORK SPACE FOR MATRICES. ON OUTPUT IT CONTAINS THE C INVERSE DIAGONAL MATRIX IF MITER = 3 AND THE LU DECOMPOSITION C OF P IF MITER IS 1, 2 , 4, OR 5. C STORAGE OF MATRIX ELEMENTS STARTS AT WM(3). C WM ALSO CONTAINS THE FOLLOWING MATRIX-RELATED DATA.. C WM(1) = SQRT(UROUND), USED IN NUMERICAL JACOBIAN INCREMENTS. C WM(2) = H*EL0, SAVED FOR LATER USE IF MITER = 3. C IWM = INTEGER WORK SPACE CONTAINING PIVOT INFORMATION, STARTING AT C IWM(21), IF MITER IS 1, 2, 4, OR 5. IWM ALSO CONTAINS BAND C PARAMETERS ML = IWM(1) AND MU = IWM(2) IF MITER IS 4 OR 5. C EL0 = EL(1) (INPUT). C IERPJ = OUTPUT ERROR FLAG, = 0 IF NO TROUBLE, .GT. 0 IF C P MATRIX FOUND TO BE SINGULAR. C JCUR = OUTPUT FLAG = 1 TO INDICATE THAT THE JACOBIAN MATRIX C (OR APPROXIMATION) IS NOW CURRENT. C THIS ROUTINE ALSO USES THE COMMON VARIABLES EL0, H, TN, UROUND, C MITER, N, NFE, AND NJE. C----------------------------------------------------------------------- NJE = NJE + 1 IERPJ = 0 JCUR = 1 HL0 = H*EL0 GO TO (100, 200, 300, 400, 500), MITER C IF MITER = 1, CALL JAC AND MULTIPLY BY SCALAR. ----------------------- 100 LENP = N*N DO 110 I = 1,LENP 110 WM(I+2) = 0.0D0 CALL JAC (NEQ, TN, Y, 0, 0, WM(3), N) CON = -HL0 DO 120 I = 1,LENP 120 WM(I+2) = WM(I+2)*CON GO TO 240 C IF MITER = 2, MAKE N CALLS TO F TO APPROXIMATE J. -------------------- 200 FAC = VNORM (N, SAVF, EWT) R0 = 1000.0D0*DABS(H)*UROUND*DBLE(N)*FAC IF (R0 .EQ. 0.0D0) R0 = 1.0D0 SRUR = WM(1) J1 = 2 DO 230 J = 1,N YJ = Y(J) R = DMAX1(SRUR*DABS(YJ),R0/EWT(J)) Y(J) = Y(J) + R FAC = -HL0/R IERR = 0 CALL F (NEQ, TN, Y, FTEM, IERR) IF (IERR .LT. 0) RETURN DO 220 I = 1,N 220 WM(I+J1) = (FTEM(I) - SAVF(I))*FAC Y(J) = YJ J1 = J1 + N 230 CONTINUE NFE = NFE + N C ADD IDENTITY MATRIX. ------------------------------------------------- 240 J = 3 NP1 = N + 1 DO 250 I = 1,N WM(J) = WM(J) + 1.0D0 250 J = J + NP1 C DO LU DECOMPOSITION ON P. -------------------------------------------- CALL DGEFA (WM(3), N, N, IWM(21), IER) IF (IER .NE. 0) IERPJ = 1 RETURN C IF MITER = 3, CONSTRUCT A DIAGONAL APPROXIMATION TO J AND P. --------- 300 WM(2) = HL0 R = EL0*0.1D0 DO 310 I = 1,N 310 Y(I) = Y(I) + R*(H*SAVF(I) - YH(I,2)) IERR = 0 CALL F (NEQ, TN, Y, WM(3), IERR) IF (IERR .LT. 0) RETURN NFE = NFE + 1 DO 320 I = 1,N R0 = H*SAVF(I) - YH(I,2) DI = 0.1D0*R0 - H*(WM(I+2) - SAVF(I)) WM(I+2) = 1.0D0 IF (DABS(R0) .LT. UROUND/EWT(I)) GO TO 320 IF (DABS(DI) .EQ. 0.0D0) GO TO 330 WM(I+2) = 0.1D0*R0/DI 320 CONTINUE RETURN 330 IERPJ = 1 RETURN C IF MITER = 4, CALL JAC AND MULTIPLY BY SCALAR. ----------------------- 400 ML = IWM(1) MU = IWM(2) ML3 = ML + 3 MBAND = ML + MU + 1 MEBAND = MBAND + ML LENP = MEBAND*N DO 410 I = 1,LENP 410 WM(I+2) = 0.0D0 CALL JAC (NEQ, TN, Y, ML, MU, WM(ML3), MEBAND) CON = -HL0 DO 420 I = 1,LENP 420 WM(I+2) = WM(I+2)*CON GO TO 570 C IF MITER = 5, MAKE MBAND CALLS TO F TO APPROXIMATE J. ---------------- 500 ML = IWM(1) MU = IWM(2) MBAND = ML + MU + 1 MBA = MIN0(MBAND,N) MEBAND = MBAND + ML MEB1 = MEBAND - 1 SRUR = WM(1) FAC = VNORM (N, SAVF, EWT) R0 = 1000.0D0*DABS(H)*UROUND*DBLE(N)*FAC IF (R0 .EQ. 0.0D0) R0 = 1.0D0 DO 560 J = 1,MBA DO 530 I = J,N,MBAND YI = Y(I) R = DMAX1(SRUR*DABS(YI),R0/EWT(I)) 530 Y(I) = Y(I) + R IERR = 0 CALL F (NEQ, TN, Y, FTEM, IERR) IF (IERR .LT. 0) RETURN DO 550 JJ = J,N,MBAND Y(JJ) = YH(JJ,1) YJJ = Y(JJ) R = DMAX1(SRUR*DABS(YJJ),R0/EWT(JJ)) FAC = -HL0/R I1 = MAX0(JJ-MU,1) I2 = MIN0(JJ+ML,N) II = JJ*MEB1 - ML + 2 DO 540 I = I1,I2 540 WM(II+I) = (FTEM(I) - SAVF(I))*FAC 550 CONTINUE 560 CONTINUE NFE = NFE + MBA C ADD IDENTITY MATRIX. ------------------------------------------------- 570 II = MBAND + 2 DO 580 I = 1,N WM(II) = WM(II) + 1.0D0 580 II = II + MEBAND C DO LU DECOMPOSITION OF P. -------------------------------------------- CALL DGBFA (WM(3), MEBAND, N, ML, MU, IWM(21), IER) IF (IER .NE. 0) IERPJ = 1 RETURN C----------------------- END OF SUBROUTINE PREPJ ----------------------- END octave-1.1.0/libcruft/odepack/solsy.f100666 415 17 5515 5501527272 15712 0ustar jweusers SUBROUTINE SOLSY (WM, IWM, X, TEM) CLLL. OPTIMIZE INTEGER IWM INTEGER IOWND, IOWNS, 1 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 2 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU INTEGER I, MEBAND, ML, MU DOUBLE PRECISION WM, X, TEM DOUBLE PRECISION ROWNS, 1 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND DOUBLE PRECISION DI, HL0, PHL0, R DIMENSION WM(1), IWM(1), X(1), TEM(1) COMMON /LS0001/ ROWNS(209), 2 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND, 3 IOWND(14), IOWNS(6), 4 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 5 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU C----------------------------------------------------------------------- C THIS ROUTINE MANAGES THE SOLUTION OF THE LINEAR SYSTEM ARISING FROM C A CHORD ITERATION. IT IS CALLED IF MITER .NE. 0. C IF MITER IS 1 OR 2, IT CALLS DGESL TO ACCOMPLISH THIS. C IF MITER = 3 IT UPDATES THE COEFFICIENT H*EL0 IN THE DIAGONAL C MATRIX, AND THEN COMPUTES THE SOLUTION. C IF MITER IS 4 OR 5, IT CALLS DGBSL. C COMMUNICATION WITH SOLSY USES THE FOLLOWING VARIABLES.. C WM = REAL WORK SPACE CONTAINING THE INVERSE DIAGONAL MATRIX IF C MITER = 3 AND THE LU DECOMPOSITION OF THE MATRIX OTHERWISE. C STORAGE OF MATRIX ELEMENTS STARTS AT WM(3). C WM ALSO CONTAINS THE FOLLOWING MATRIX-RELATED DATA.. C WM(1) = SQRT(UROUND) (NOT USED HERE), C WM(2) = HL0, THE PREVIOUS VALUE OF H*EL0, USED IF MITER = 3. C IWM = INTEGER WORK SPACE CONTAINING PIVOT INFORMATION, STARTING AT C IWM(21), IF MITER IS 1, 2, 4, OR 5. IWM ALSO CONTAINS BAND C PARAMETERS ML = IWM(1) AND MU = IWM(2) IF MITER IS 4 OR 5. C X = THE RIGHT-HAND SIDE VECTOR ON INPUT, AND THE SOLUTION VECTOR C ON OUTPUT, OF LENGTH N. C TEM = VECTOR OF WORK SPACE OF LENGTH N, NOT USED IN THIS VERSION. C IERSL = OUTPUT FLAG (IN COMMON). IERSL = 0 IF NO TROUBLE OCCURRED. C IERSL = 1 IF A SINGULAR MATRIX AROSE WITH MITER = 3. C THIS ROUTINE ALSO USES THE COMMON VARIABLES EL0, H, MITER, AND N. C----------------------------------------------------------------------- IERSL = 0 GO TO (100, 100, 300, 400, 400), MITER 100 CALL DGESL (WM(3), N, N, IWM(21), X, 0) RETURN C 300 PHL0 = WM(2) HL0 = H*EL0 WM(2) = HL0 IF (HL0 .EQ. PHL0) GO TO 330 R = HL0/PHL0 DO 320 I = 1,N DI = 1.0D0 - R*(1.0D0 - 1.0D0/WM(I+2)) IF (DABS(DI) .EQ. 0.0D0) GO TO 390 320 WM(I+2) = 1.0D0/DI 330 DO 340 I = 1,N 340 X(I) = WM(I+2)*X(I) RETURN 390 IERSL = 1 RETURN C 400 ML = IWM(1) MU = IWM(2) MEBAND = 2*ML + MU + 1 CALL DGBSL (WM(3), MEBAND, N, ML, MU, IWM(21), X, 0) RETURN C----------------------- END OF SUBROUTINE SOLSY ----------------------- END octave-1.1.0/libcruft/odepack/stode.f100666 415 17 47213 5517333026 15677 0ustar jweusers SUBROUTINE STODE (NEQ, Y, YH, NYH, YH1, EWT, SAVF, ACOR, 1 WM, IWM, F, JAC, PJAC, SLVS, IERR) CLLL. OPTIMIZE EXTERNAL F, JAC, PJAC, SLVS INTEGER NEQ, NYH, IWM INTEGER IOWND, IALTH, IPUP, LMAX, MEO, NQNYH, NSLP, 1 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 2 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU INTEGER I, I1, IREDO, IRET, J, JB, M, NCF, NEWQ DOUBLE PRECISION Y, YH, YH1, EWT, SAVF, ACOR, WM DOUBLE PRECISION CONIT, CRATE, EL, ELCO, HOLD, RMAX, TESCO, 2 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND DOUBLE PRECISION DCON, DDN, DEL, DELP, DSM, DUP, EXDN, EXSM, EXUP, 1 R, RH, RHDN, RHSM, RHUP, TOLD, VNORM DIMENSION NEQ(1), Y(1), YH(NYH,1), YH1(1), EWT(1), SAVF(1), 1 ACOR(1), WM(1), IWM(1) COMMON /LS0001/ CONIT, CRATE, EL(13), ELCO(13,12), 1 HOLD, RMAX, TESCO(3,12), 2 CCMAX, EL0, H, HMIN, HMXI, HU, RC, TN, UROUND, IOWND(14), 3 IALTH, IPUP, LMAX, MEO, NQNYH, NSLP, 4 ICF, IERPJ, IERSL, JCUR, JSTART, KFLAG, L, METH, MITER, 5 MAXORD, MAXCOR, MSBP, MXNCF, N, NQ, NST, NFE, NJE, NQU C----------------------------------------------------------------------- C STODE PERFORMS ONE STEP OF THE INTEGRATION OF AN INITIAL VALUE C PROBLEM FOR A SYSTEM OF ORDINARY DIFFERENTIAL EQUATIONS. C NOTE.. STODE IS INDEPENDENT OF THE VALUE OF THE ITERATION METHOD C INDICATOR MITER, WHEN THIS IS .NE. 0, AND HENCE IS INDEPENDENT C OF THE TYPE OF CHORD METHOD USED, OR THE JACOBIAN STRUCTURE. C COMMUNICATION WITH STODE IS DONE WITH THE FOLLOWING VARIABLES.. C C NEQ = INTEGER ARRAY CONTAINING PROBLEM SIZE IN NEQ(1), AND C PASSED AS THE NEQ ARGUMENT IN ALL CALLS TO F AND JAC. C Y = AN ARRAY OF LENGTH .GE. N USED AS THE Y ARGUMENT IN C ALL CALLS TO F AND JAC. C YH = AN NYH BY LMAX ARRAY CONTAINING THE DEPENDENT VARIABLES C AND THEIR APPROXIMATE SCALED DERIVATIVES, WHERE C LMAX = MAXORD + 1. YH(I,J+1) CONTAINS THE APPROXIMATE C J-TH DERIVATIVE OF Y(I), SCALED BY H**J/FACTORIAL(J) C (J = 0,1,...,NQ). ON ENTRY FOR THE FIRST STEP, THE FIRST C TWO COLUMNS OF YH MUST BE SET FROM THE INITIAL VALUES. C NYH = A CONSTANT INTEGER .GE. N, THE FIRST DIMENSION OF YH. C YH1 = A ONE-DIMENSIONAL ARRAY OCCUPYING THE SAME SPACE AS YH. C EWT = AN ARRAY OF LENGTH N CONTAINING MULTIPLICATIVE WEIGHTS C FOR LOCAL ERROR MEASUREMENTS. LOCAL ERRORS IN Y(I) ARE C COMPARED TO 1.0/EWT(I) IN VARIOUS ERROR TESTS. C SAVF = AN ARRAY OF WORKING STORAGE, OF LENGTH N. C ALSO USED FOR INPUT OF YH(*,MAXORD+2) WHEN JSTART = -1 C AND MAXORD .LT. THE CURRENT ORDER NQ. C ACOR = A WORK ARRAY OF LENGTH N, USED FOR THE ACCUMULATED C CORRECTIONS. ON A SUCCESSFUL RETURN, ACOR(I) CONTAINS C THE ESTIMATED ONE-STEP LOCAL ERROR IN Y(I). C WM,IWM = REAL AND INTEGER WORK ARRAYS ASSOCIATED WITH MATRIX C OPERATIONS IN CHORD ITERATION (MITER .NE. 0). C PJAC = NAME OF ROUTINE TO EVALUATE AND PREPROCESS JACOBIAN MATRIX C AND P = I - H*EL0*JAC, IF A CHORD METHOD IS BEING USED. C SLVS = NAME OF ROUTINE TO SOLVE LINEAR SYSTEM IN CHORD ITERATION. C CCMAX = MAXIMUM RELATIVE CHANGE IN H*EL0 BEFORE PJAC IS CALLED. C H = THE STEP SIZE TO BE ATTEMPTED ON THE NEXT STEP. C H IS ALTERED BY THE ERROR CONTROL ALGORITHM DURING THE C PROBLEM. H CAN BE EITHER POSITIVE OR NEGATIVE, BUT ITS C SIGN MUST REMAIN CONSTANT THROUGHOUT THE PROBLEM. C HMIN = THE MINIMUM ABSOLUTE VALUE OF THE STEP SIZE H TO BE USED. C HMXI = INVERSE OF THE MAXIMUM ABSOLUTE VALUE OF H TO BE USED. C HMXI = 0.0 IS ALLOWED AND CORRESPONDS TO AN INFINITE HMAX. C HMIN AND HMXI MAY BE CHANGED AT ANY TIME, BUT WILL NOT C TAKE EFFECT UNTIL THE NEXT CHANGE OF H IS CONSIDERED. C TN = THE INDEPENDENT VARIABLE. TN IS UPDATED ON EACH STEP TAKEN. C JSTART = AN INTEGER USED FOR INPUT ONLY, WITH THE FOLLOWING C VALUES AND MEANINGS.. C 0 PERFORM THE FIRST STEP. C .GT.0 TAKE A NEW STEP CONTINUING FROM THE LAST. C -1 TAKE THE NEXT STEP WITH A NEW VALUE OF H, MAXORD, C N, METH, MITER, AND/OR MATRIX PARAMETERS. C -2 TAKE THE NEXT STEP WITH A NEW VALUE OF H, C BUT WITH OTHER INPUTS UNCHANGED. C ON RETURN, JSTART IS SET TO 1 TO FACILITATE CONTINUATION. C KFLAG = A COMPLETION CODE WITH THE FOLLOWING MEANINGS.. C 0 THE STEP WAS SUCCESFUL. C -1 THE REQUESTED ERROR COULD NOT BE ACHIEVED. C -2 CORRECTOR CONVERGENCE COULD NOT BE ACHIEVED. C -3 FATAL ERROR IN PJAC OR SLVS. C A RETURN WITH KFLAG = -1 OR -2 MEANS EITHER C ABS(H) = HMIN OR 10 CONSECUTIVE FAILURES OCCURRED. C ON A RETURN WITH KFLAG NEGATIVE, THE VALUES OF TN AND C THE YH ARRAY ARE AS OF THE BEGINNING OF THE LAST C STEP, AND H IS THE LAST STEP SIZE ATTEMPTED. C MAXORD = THE MAXIMUM ORDER OF INTEGRATION METHOD TO BE ALLOWED. C MAXCOR = THE MAXIMUM NUMBER OF CORRECTOR ITERATIONS ALLOWED. C MSBP = MAXIMUM NUMBER OF STEPS BETWEEN PJAC CALLS (MITER .GT. 0). C MXNCF = MAXIMUM NUMBER OF CONVERGENCE FAILURES ALLOWED. C METH/MITER = THE METHOD FLAGS. SEE DESCRIPTION IN DRIVER. C N = THE NUMBER OF FIRST-ORDER DIFFERENTIAL EQUATIONS. C IERR = ERROR FLAG FROM USER-SUPPLIED FUNCTION C----------------------------------------------------------------------- KFLAG = 0 TOLD = TN NCF = 0 IERPJ = 0 IERSL = 0 JCUR = 0 ICF = 0 DELP = 0.0D0 IF (JSTART .GT. 0) GO TO 200 IF (JSTART .EQ. -1) GO TO 100 IF (JSTART .EQ. -2) GO TO 160 C----------------------------------------------------------------------- C ON THE FIRST CALL, THE ORDER IS SET TO 1, AND OTHER VARIABLES ARE C INITIALIZED. RMAX IS THE MAXIMUM RATIO BY WHICH H CAN BE INCREASED C IN A SINGLE STEP. IT IS INITIALLY 1.E4 TO COMPENSATE FOR THE SMALL C INITIAL H, BUT THEN IS NORMALLY EQUAL TO 10. IF A FAILURE C OCCURS (IN CORRECTOR CONVERGENCE OR ERROR TEST), RMAX IS SET AT 2 C FOR THE NEXT INCREASE. C----------------------------------------------------------------------- LMAX = MAXORD + 1 NQ = 1 L = 2 IALTH = 2 RMAX = 10000.0D0 RC = 0.0D0 EL0 = 1.0D0 CRATE = 0.7D0 HOLD = H MEO = METH NSLP = 0 IPUP = MITER IRET = 3 GO TO 140 C----------------------------------------------------------------------- C THE FOLLOWING BLOCK HANDLES PRELIMINARIES NEEDED WHEN JSTART = -1. C IPUP IS SET TO MITER TO FORCE A MATRIX UPDATE. C IF AN ORDER INCREASE IS ABOUT TO BE CONSIDERED (IALTH = 1), C IALTH IS RESET TO 2 TO POSTPONE CONSIDERATION ONE MORE STEP. C IF THE CALLER HAS CHANGED METH, CFODE IS CALLED TO RESET C THE COEFFICIENTS OF THE METHOD. C IF THE CALLER HAS CHANGED MAXORD TO A VALUE LESS THAN THE CURRENT C ORDER NQ, NQ IS REDUCED TO MAXORD, AND A NEW H CHOSEN ACCORDINGLY. C IF H IS TO BE CHANGED, YH MUST BE RESCALED. C IF H OR METH IS BEING CHANGED, IALTH IS RESET TO L = NQ + 1 C TO PREVENT FURTHER CHANGES IN H FOR THAT MANY STEPS. C----------------------------------------------------------------------- 100 IPUP = MITER LMAX = MAXORD + 1 IF (IALTH .EQ. 1) IALTH = 2 IF (METH .EQ. MEO) GO TO 110 CALL CFODE (METH, ELCO, TESCO) MEO = METH IF (NQ .GT. MAXORD) GO TO 120 IALTH = L IRET = 1 GO TO 150 110 IF (NQ .LE. MAXORD) GO TO 160 120 NQ = MAXORD L = LMAX DO 125 I = 1,L 125 EL(I) = ELCO(I,NQ) NQNYH = NQ*NYH RC = RC*EL(1)/EL0 EL0 = EL(1) CONIT = 0.5D0/DBLE(NQ+2) DDN = VNORM (N, SAVF, EWT)/TESCO(1,L) EXDN = 1.0D0/DBLE(L) RHDN = 1.0D0/(1.3D0*DDN**EXDN + 0.0000013D0) RH = DMIN1(RHDN,1.0D0) IREDO = 3 IF (H .EQ. HOLD) GO TO 170 RH = DMIN1(RH,DABS(H/HOLD)) H = HOLD GO TO 175 C----------------------------------------------------------------------- C CFODE IS CALLED TO GET ALL THE INTEGRATION COEFFICIENTS FOR THE C CURRENT METH. THEN THE EL VECTOR AND RELATED CONSTANTS ARE RESET C WHENEVER THE ORDER NQ IS CHANGED, OR AT THE START OF THE PROBLEM. C----------------------------------------------------------------------- 140 CALL CFODE (METH, ELCO, TESCO) 150 DO 155 I = 1,L 155 EL(I) = ELCO(I,NQ) NQNYH = NQ*NYH RC = RC*EL(1)/EL0 EL0 = EL(1) CONIT = 0.5D0/DBLE(NQ+2) GO TO (160, 170, 200), IRET C----------------------------------------------------------------------- C IF H IS BEING CHANGED, THE H RATIO RH IS CHECKED AGAINST C RMAX, HMIN, AND HMXI, AND THE YH ARRAY RESCALED. IALTH IS SET TO C L = NQ + 1 TO PREVENT A CHANGE OF H FOR THAT MANY STEPS, UNLESS C FORCED BY A CONVERGENCE OR ERROR TEST FAILURE. C----------------------------------------------------------------------- 160 IF (H .EQ. HOLD) GO TO 200 RH = H/HOLD H = HOLD IREDO = 3 GO TO 175 170 RH = DMAX1(RH,HMIN/DABS(H)) 175 RH = DMIN1(RH,RMAX) RH = RH/DMAX1(1.0D0,DABS(H)*HMXI*RH) R = 1.0D0 DO 180 J = 2,L R = R*RH DO 180 I = 1,N 180 YH(I,J) = YH(I,J)*R H = H*RH RC = RC*RH IALTH = L IF (IREDO .EQ. 0) GO TO 690 C----------------------------------------------------------------------- C THIS SECTION COMPUTES THE PREDICTED VALUES BY EFFECTIVELY C MULTIPLYING THE YH ARRAY BY THE PASCAL TRIANGLE MATRIX. C RC IS THE RATIO OF NEW TO OLD VALUES OF THE COEFFICIENT H*EL(1). C WHEN RC DIFFERS FROM 1 BY MORE THAN CCMAX, IPUP IS SET TO MITER C TO FORCE PJAC TO BE CALLED, IF A JACOBIAN IS INVOLVED. C IN ANY CASE, PJAC IS CALLED AT LEAST EVERY MSBP STEPS. C----------------------------------------------------------------------- 200 IF (DABS(RC-1.0D0) .GT. CCMAX) IPUP = MITER IF (NST .GE. NSLP+MSBP) IPUP = MITER TN = TN + H I1 = NQNYH + 1 DO 215 JB = 1,NQ I1 = I1 - NYH CDIR$ IVDEP DO 210 I = I1,NQNYH 210 YH1(I) = YH1(I) + YH1(I+NYH) 215 CONTINUE C----------------------------------------------------------------------- C UP TO MAXCOR CORRECTOR ITERATIONS ARE TAKEN. A CONVERGENCE TEST IS C MADE ON THE R.M.S. NORM OF EACH CORRECTION, WEIGHTED BY THE ERROR C WEIGHT VECTOR EWT. THE SUM OF THE CORRECTIONS IS ACCUMULATED IN THE C VECTOR ACOR(I). THE YH ARRAY IS NOT ALTERED IN THE CORRECTOR LOOP. C----------------------------------------------------------------------- 220 M = 0 DO 230 I = 1,N 230 Y(I) = YH(I,1) IERR = 0 CALL F (NEQ, TN, Y, SAVF, IERR) IF (IERR .LT. 0) RETURN NFE = NFE + 1 IF (IPUP .LE. 0) GO TO 250 C----------------------------------------------------------------------- C IF INDICATED, THE MATRIX P = I - H*EL(1)*J IS REEVALUATED AND C PREPROCESSED BEFORE STARTING THE CORRECTOR ITERATION. IPUP IS SET C TO 0 AS AN INDICATOR THAT THIS HAS BEEN DONE. C----------------------------------------------------------------------- IERR = 0 CALL PJAC (NEQ, Y, YH, NYH, EWT, ACOR, SAVF, WM, IWM, F, JAC, 1 IERR) IF (IERR .LT. 0) RETURN IPUP = 0 RC = 1.0D0 NSLP = NST CRATE = 0.7D0 IF (IERPJ .NE. 0) GO TO 430 250 DO 260 I = 1,N 260 ACOR(I) = 0.0D0 270 IF (MITER .NE. 0) GO TO 350 C----------------------------------------------------------------------- C IN THE CASE OF FUNCTIONAL ITERATION, UPDATE Y DIRECTLY FROM C THE RESULT OF THE LAST FUNCTION EVALUATION. C----------------------------------------------------------------------- DO 290 I = 1,N SAVF(I) = H*SAVF(I) - YH(I,2) 290 Y(I) = SAVF(I) - ACOR(I) DEL = VNORM (N, Y, EWT) DO 300 I = 1,N Y(I) = YH(I,1) + EL(1)*SAVF(I) 300 ACOR(I) = SAVF(I) GO TO 400 C----------------------------------------------------------------------- C IN THE CASE OF THE CHORD METHOD, COMPUTE THE CORRECTOR ERROR, C AND SOLVE THE LINEAR SYSTEM WITH THAT AS RIGHT-HAND SIDE AND C P AS COEFFICIENT MATRIX. C----------------------------------------------------------------------- 350 DO 360 I = 1,N 360 Y(I) = H*SAVF(I) - (YH(I,2) + ACOR(I)) CALL SLVS (WM, IWM, Y, SAVF) IF (IERSL .LT. 0) GO TO 430 IF (IERSL .GT. 0) GO TO 410 DEL = VNORM (N, Y, EWT) DO 380 I = 1,N ACOR(I) = ACOR(I) + Y(I) 380 Y(I) = YH(I,1) + EL(1)*ACOR(I) C----------------------------------------------------------------------- C TEST FOR CONVERGENCE. IF M.GT.0, AN ESTIMATE OF THE CONVERGENCE C RATE CONSTANT IS STORED IN CRATE, AND THIS IS USED IN THE TEST. C----------------------------------------------------------------------- 400 IF (M .NE. 0) CRATE = DMAX1(0.2D0*CRATE,DEL/DELP) DCON = DEL*DMIN1(1.0D0,1.5D0*CRATE)/(TESCO(2,NQ)*CONIT) IF (DCON .LE. 1.0D0) GO TO 450 M = M + 1 IF (M .EQ. MAXCOR) GO TO 410 IF (M .GE. 2 .AND. DEL .GT. 2.0D0*DELP) GO TO 410 DELP = DEL IERR = 0 CALL F (NEQ, TN, Y, SAVF, IERR) IF (IERR .LT. 0) RETURN NFE = NFE + 1 GO TO 270 C----------------------------------------------------------------------- C THE CORRECTOR ITERATION FAILED TO CONVERGE. C IF MITER .NE. 0 AND THE JACOBIAN IS OUT OF DATE, PJAC IS CALLED FOR C THE NEXT TRY. OTHERWISE THE YH ARRAY IS RETRACTED TO ITS VALUES C BEFORE PREDICTION, AND H IS REDUCED, IF POSSIBLE. IF H CANNOT BE C REDUCED OR MXNCF FAILURES HAVE OCCURRED, EXIT WITH KFLAG = -2. C----------------------------------------------------------------------- 410 IF (MITER .EQ. 0 .OR. JCUR .EQ. 1) GO TO 430 ICF = 1 IPUP = MITER GO TO 220 430 ICF = 2 NCF = NCF + 1 RMAX = 2.0D0 TN = TOLD I1 = NQNYH + 1 DO 445 JB = 1,NQ I1 = I1 - NYH CDIR$ IVDEP DO 440 I = I1,NQNYH 440 YH1(I) = YH1(I) - YH1(I+NYH) 445 CONTINUE IF (IERPJ .LT. 0 .OR. IERSL .LT. 0) GO TO 680 IF (DABS(H) .LE. HMIN*1.00001D0) GO TO 670 IF (NCF .EQ. MXNCF) GO TO 670 RH = 0.25D0 IPUP = MITER IREDO = 1 GO TO 170 C----------------------------------------------------------------------- C THE CORRECTOR HAS CONVERGED. JCUR IS SET TO 0 C TO SIGNAL THAT THE JACOBIAN INVOLVED MAY NEED UPDATING LATER. C THE LOCAL ERROR TEST IS MADE AND CONTROL PASSES TO STATEMENT 500 C IF IT FAILS. C----------------------------------------------------------------------- 450 JCUR = 0 IF (M .EQ. 0) DSM = DEL/TESCO(2,NQ) IF (M .GT. 0) DSM = VNORM (N, ACOR, EWT)/TESCO(2,NQ) IF (DSM .GT. 1.0D0) GO TO 500 C----------------------------------------------------------------------- C AFTER A SUCCESSFUL STEP, UPDATE THE YH ARRAY. C CONSIDER CHANGING H IF IALTH = 1. OTHERWISE DECREASE IALTH BY 1. C IF IALTH IS THEN 1 AND NQ .LT. MAXORD, THEN ACOR IS SAVED FOR C USE IN A POSSIBLE ORDER INCREASE ON THE NEXT STEP. C IF A CHANGE IN H IS CONSIDERED, AN INCREASE OR DECREASE IN ORDER C BY ONE IS CONSIDERED ALSO. A CHANGE IN H IS MADE ONLY IF IT IS BY A C FACTOR OF AT LEAST 1.1. IF NOT, IALTH IS SET TO 3 TO PREVENT C TESTING FOR THAT MANY STEPS. C----------------------------------------------------------------------- KFLAG = 0 IREDO = 0 NST = NST + 1 HU = H NQU = NQ DO 470 J = 1,L DO 470 I = 1,N 470 YH(I,J) = YH(I,J) + EL(J)*ACOR(I) IALTH = IALTH - 1 IF (IALTH .EQ. 0) GO TO 520 IF (IALTH .GT. 1) GO TO 700 IF (L .EQ. LMAX) GO TO 700 DO 490 I = 1,N 490 YH(I,LMAX) = ACOR(I) GO TO 700 C----------------------------------------------------------------------- C THE ERROR TEST FAILED. KFLAG KEEPS TRACK OF MULTIPLE FAILURES. C RESTORE TN AND THE YH ARRAY TO THEIR PREVIOUS VALUES, AND PREPARE C TO TRY THE STEP AGAIN. COMPUTE THE OPTIMUM STEP SIZE FOR THIS OR C ONE LOWER ORDER. AFTER 2 OR MORE FAILURES, H IS FORCED TO DECREASE C BY A FACTOR OF 0.2 OR LESS. C----------------------------------------------------------------------- 500 KFLAG = KFLAG - 1 TN = TOLD I1 = NQNYH + 1 DO 515 JB = 1,NQ I1 = I1 - NYH CDIR$ IVDEP DO 510 I = I1,NQNYH 510 YH1(I) = YH1(I) - YH1(I+NYH) 515 CONTINUE RMAX = 2.0D0 IF (DABS(H) .LE. HMIN*1.00001D0) GO TO 660 IF (KFLAG .LE. -3) GO TO 640 IREDO = 2 RHUP = 0.0D0 GO TO 540 C----------------------------------------------------------------------- C REGARDLESS OF THE SUCCESS OR FAILURE OF THE STEP, FACTORS C RHDN, RHSM, AND RHUP ARE COMPUTED, BY WHICH H COULD BE MULTIPLIED C AT ORDER NQ - 1, ORDER NQ, OR ORDER NQ + 1, RESPECTIVELY. C IN THE CASE OF FAILURE, RHUP = 0.0 TO AVOID AN ORDER INCREASE. C THE LARGEST OF THESE IS DETERMINED AND THE NEW ORDER CHOSEN C ACCORDINGLY. IF THE ORDER IS TO BE INCREASED, WE COMPUTE ONE C ADDITIONAL SCALED DERIVATIVE. C----------------------------------------------------------------------- 520 RHUP = 0.0D0 IF (L .EQ. LMAX) GO TO 540 DO 530 I = 1,N 530 SAVF(I) = ACOR(I) - YH(I,LMAX) DUP = VNORM (N, SAVF, EWT)/TESCO(3,NQ) EXUP = 1.0D0/DBLE(L+1) RHUP = 1.0D0/(1.4D0*DUP**EXUP + 0.0000014D0) 540 EXSM = 1.0D0/DBLE(L) RHSM = 1.0D0/(1.2D0*DSM**EXSM + 0.0000012D0) RHDN = 0.0D0 IF (NQ .EQ. 1) GO TO 560 DDN = VNORM (N, YH(1,L), EWT)/TESCO(1,NQ) EXDN = 1.0D0/DBLE(NQ) RHDN = 1.0D0/(1.3D0*DDN**EXDN + 0.0000013D0) 560 IF (RHSM .GE. RHUP) GO TO 570 IF (RHUP .GT. RHDN) GO TO 590 GO TO 580 570 IF (RHSM .LT. RHDN) GO TO 580 NEWQ = NQ RH = RHSM GO TO 620 580 NEWQ = NQ - 1 RH = RHDN IF (KFLAG .LT. 0 .AND. RH .GT. 1.0D0) RH = 1.0D0 GO TO 620 590 NEWQ = L RH = RHUP IF (RH .LT. 1.1D0) GO TO 610 R = EL(L)/DBLE(L) DO 600 I = 1,N 600 YH(I,NEWQ+1) = ACOR(I)*R GO TO 630 610 IALTH = 3 GO TO 700 620 IF ((KFLAG .EQ. 0) .AND. (RH .LT. 1.1D0)) GO TO 610 IF (KFLAG .LE. -2) RH = DMIN1(RH,0.2D0) C----------------------------------------------------------------------- C IF THERE IS A CHANGE OF ORDER, RESET NQ, L, AND THE COEFFICIENTS. C IN ANY CASE H IS RESET ACCORDING TO RH AND THE YH ARRAY IS RESCALED. C THEN EXIT FROM 690 IF THE STEP WAS OK, OR REDO THE STEP OTHERWISE. C----------------------------------------------------------------------- IF (NEWQ .EQ. NQ) GO TO 170 630 NQ = NEWQ L = NQ + 1 IRET = 2 GO TO 150 C----------------------------------------------------------------------- C CONTROL REACHES THIS SECTION IF 3 OR MORE FAILURES HAVE OCCURED. C IF 10 FAILURES HAVE OCCURRED, EXIT WITH KFLAG = -1. C IT IS ASSUMED THAT THE DERIVATIVES THAT HAVE ACCUMULATED IN THE C YH ARRAY HAVE ERRORS OF THE WRONG ORDER. HENCE THE FIRST C DERIVATIVE IS RECOMPUTED, AND THE ORDER IS SET TO 1. THEN C H IS REDUCED BY A FACTOR OF 10, AND THE STEP IS RETRIED, C UNTIL IT SUCCEEDS OR H REACHES HMIN. C----------------------------------------------------------------------- 640 IF (KFLAG .EQ. -10) GO TO 660 RH = 0.1D0 RH = DMAX1(HMIN/DABS(H),RH) H = H*RH DO 645 I = 1,N 645 Y(I) = YH(I,1) IERR = 0 CALL F (NEQ, TN, Y, SAVF, IERR) IF (IERR .LT. 0) RETURN NFE = NFE + 1 DO 650 I = 1,N 650 YH(I,2) = H*SAVF(I) IPUP = MITER IALTH = 5 IF (NQ .EQ. 1) GO TO 200 NQ = 1 L = 2 IRET = 3 GO TO 150 C----------------------------------------------------------------------- C ALL RETURNS ARE MADE THROUGH THIS SECTION. H IS SAVED IN HOLD C TO ALLOW THE CALLER TO CHANGE H ON THE NEXT STEP. C----------------------------------------------------------------------- 660 KFLAG = -1 GO TO 720 670 KFLAG = -2 GO TO 720 680 KFLAG = -3 GO TO 720 690 RMAX = 10.0D0 700 R = 1.0D0/TESCO(2,NQU) DO 710 I = 1,N 710 ACOR(I) = ACOR(I)*R 720 HOLD = H JSTART = 1 RETURN C----------------------- END OF SUBROUTINE STODE ----------------------- END octave-1.1.0/libcruft/odepack/vnorm.f100666 415 17 1326 5501527242 15673 0ustar jweusers DOUBLE PRECISION FUNCTION VNORM (N, V, W) CLLL. OPTIMIZE C----------------------------------------------------------------------- C THIS FUNCTION ROUTINE COMPUTES THE WEIGHTED ROOT-MEAN-SQUARE NORM C OF THE VECTOR OF LENGTH N CONTAINED IN THE ARRAY V, WITH WEIGHTS C CONTAINED IN THE ARRAY W OF LENGTH N.. C VNORM = SQRT( (1/N) * SUM( V(I)*W(I) )**2 ) C----------------------------------------------------------------------- INTEGER N, I DOUBLE PRECISION V, W, SUM DIMENSION V(N), W(N) SUM = 0.0D0 DO 10 I = 1,N 10 SUM = SUM + (V(I)*W(I))**2 VNORM = DSQRT(SUM/DBLE(N)) RETURN C----------------------- END OF FUNCTION VNORM ------------------------- END octave-1.1.0/libcruft/odepack/xerrwv.f100666 415 17 12243 5501527263 16112 0ustar jweusers SUBROUTINE XERRWV (MSG, NMES, NERR, LEVEL, NI, I1, I2, NR, R1, R2) INTEGER MSG, NMES, NERR, LEVEL, NI, I1, I2, NR, 1 I, LUN, LUNIT, MESFLG, NCPW, NCH, NWDS DOUBLE PRECISION R1, R2 DIMENSION MSG(NMES) C----------------------------------------------------------------------- C SUBROUTINES XERRWV, XSETF, AND XSETUN, AS GIVEN HERE, CONSTITUTE C A SIMPLIFIED VERSION OF THE SLATEC ERROR HANDLING PACKAGE. C WRITTEN BY A. C. HINDMARSH AT LLNL. VERSION OF MARCH 30, 1987. C THIS VERSION IS IN DOUBLE PRECISION. C C ALL ARGUMENTS ARE INPUT ARGUMENTS. C C MSG = THE MESSAGE (HOLLERITH LITERAL OR INTEGER ARRAY). C NMES = THE LENGTH OF MSG (NUMBER OF CHARACTERS). C NERR = THE ERROR NUMBER (NOT USED). C LEVEL = THE ERROR LEVEL.. C 0 OR 1 MEANS RECOVERABLE (CONTROL RETURNS TO CALLER). C 2 MEANS FATAL (RUN IS ABORTED--SEE NOTE BELOW). C NI = NUMBER OF INTEGERS (0, 1, OR 2) TO BE PRINTED WITH MESSAGE. C I1,I2 = INTEGERS TO BE PRINTED, DEPENDING ON NI. C NR = NUMBER OF REALS (0, 1, OR 2) TO BE PRINTED WITH MESSAGE. C R1,R2 = REALS TO BE PRINTED, DEPENDING ON NR. C C NOTE.. THIS ROUTINE IS MACHINE-DEPENDENT AND SPECIALIZED FOR USE C IN LIMITED CONTEXT, IN THE FOLLOWING WAYS.. C 1. THE NUMBER OF HOLLERITH CHARACTERS STORED PER WORD, DENOTED C BY NCPW BELOW, IS A DATA-LOADED CONSTANT. C 2. THE VALUE OF NMES IS ASSUMED TO BE AT MOST 60. C (MULTI-LINE MESSAGES ARE GENERATED BY REPEATED CALLS.) C 3. IF LEVEL = 2, CONTROL PASSES TO THE STATEMENT STOP C TO ABORT THE RUN. THIS STATEMENT MAY BE MACHINE-DEPENDENT. C 4. R1 AND R2 ARE ASSUMED TO BE IN DOUBLE PRECISION AND ARE PRINTED C IN D21.13 FORMAT. C 5. THE COMMON BLOCK /EH0001/ BELOW IS DATA-LOADED (A MACHINE- C DEPENDENT FEATURE) WITH DEFAULT VALUES. C THIS BLOCK IS NEEDED FOR PROPER RETENTION OF PARAMETERS USED BY C THIS ROUTINE WHICH THE USER CAN RESET BY CALLING XSETF OR XSETUN. C THE VARIABLES IN THIS BLOCK ARE AS FOLLOWS.. C MESFLG = PRINT CONTROL FLAG.. C 1 MEANS PRINT ALL MESSAGES (THE DEFAULT). C 0 MEANS NO PRINTING. C LUNIT = LOGICAL UNIT NUMBER FOR MESSAGES. C THE DEFAULT IS 6 (MACHINE-DEPENDENT). C----------------------------------------------------------------------- C THE FOLLOWING ARE INSTRUCTIONS FOR INSTALLING THIS ROUTINE C IN DIFFERENT MACHINE ENVIRONMENTS. C C TO CHANGE THE DEFAULT OUTPUT UNIT, CHANGE THE DATA STATEMENT C IN THE BLOCK DATA SUBPROGRAM BELOW. C C FOR A DIFFERENT NUMBER OF CHARACTERS PER WORD, CHANGE THE C DATA STATEMENT SETTING NCPW BELOW, AND FORMAT 10. ALTERNATIVES FOR C VARIOUS COMPUTERS ARE SHOWN IN COMMENT CARDS. C C FOR A DIFFERENT RUN-ABORT COMMAND, CHANGE THE STATEMENT FOLLOWING C STATEMENT 100 AT THE END. C----------------------------------------------------------------------- COMMON /EH0001/ MESFLG, LUNIT C----------------------------------------------------------------------- C THE FOLLOWING DATA-LOADED VALUE OF NCPW IS VALID FOR THE CDC-6600 C AND CDC-7600 COMPUTERS. C DATA NCPW/10/ C THE FOLLOWING IS VALID FOR THE CRAY-1 COMPUTER. C DATA NCPW/8/ C THE FOLLOWING IS VALID FOR THE BURROUGHS 6700 AND 7800 COMPUTERS. C DATA NCPW/6/ C THE FOLLOWING IS VALID FOR THE PDP-10 COMPUTER. C DATA NCPW/5/ C THE FOLLOWING IS VALID FOR THE VAX COMPUTER WITH 4 BYTES PER INTEGER, C AND FOR THE IBM-360, IBM-370, IBM-303X, AND IBM-43XX COMPUTERS. DATA NCPW/4/ C THE FOLLOWING IS VALID FOR THE PDP-11, OR VAX WITH 2-BYTE INTEGERS. C DATA NCPW/2/ C----------------------------------------------------------------------- IF (MESFLG .EQ. 0) GO TO 100 C GET LOGICAL UNIT NUMBER. --------------------------------------------- LUN = LUNIT C GET NUMBER OF WORDS IN MESSAGE. -------------------------------------- NCH = MIN0(NMES,60) NWDS = NCH/NCPW IF (NCH .NE. NWDS*NCPW) NWDS = NWDS + 1 C WRITE THE MESSAGE. --------------------------------------------------- WRITE (LUN, 10) (MSG(I),I=1,NWDS) C----------------------------------------------------------------------- C THE FOLLOWING FORMAT STATEMENT IS TO HAVE THE FORM C 10 FORMAT(1X,MMANN) C WHERE NN = NCPW AND MM IS THE SMALLEST INTEGER .GE. 60/NCPW. C THE FOLLOWING IS VALID FOR NCPW = 10. C 10 FORMAT(1X,6A10) C THE FOLLOWING IS VALID FOR NCPW = 8. C 10 FORMAT(1X,8A8) C THE FOLLOWING IS VALID FOR NCPW = 6. C 10 FORMAT(1X,10A6) C THE FOLLOWING IS VALID FOR NCPW = 5. C 10 FORMAT(1X,12A5) C THE FOLLOWING IS VALID FOR NCPW = 4. 10 FORMAT(1X,15A4) C THE FOLLOWING IS VALID FOR NCPW = 2. C 10 FORMAT(1X,30A2) C----------------------------------------------------------------------- IF (NI .EQ. 1) WRITE (LUN, 20) I1 20 FORMAT(6X,23HIN ABOVE MESSAGE, I1 =,I10) IF (NI .EQ. 2) WRITE (LUN, 30) I1,I2 30 FORMAT(6X,23HIN ABOVE MESSAGE, I1 =,I10,3X,4HI2 =,I10) IF (NR .EQ. 1) WRITE (LUN, 40) R1 40 FORMAT(6X,23HIN ABOVE MESSAGE, R1 =,D21.13) IF (NR .EQ. 2) WRITE (LUN, 50) R1,R2 50 FORMAT(6X,15HIN ABOVE, R1 =,D21.13,3X,4HR2 =,D21.13) C ABORT THE RUN IF LEVEL = 2. ------------------------------------------ 100 IF (LEVEL .NE. 2) RETURN CALL XSTOPX (' ') C----------------------- END OF SUBROUTINE XERRWV ---------------------- END octave-1.1.0/libcruft/qpsol/ 40777 415 17 0 5705521661 14021 5ustar jweusersoctave-1.1.0/libcruft/qpsol/Makefile.in100666 415 17 524 5662226324 16144 0ustar jweusers# # Makefile for octave's libcruft/qpsol directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = Makefile.in README.MISSING include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/qpsol/README.MISSING100666 415 17 1055 5331437104 16100 0ustar jweusersIf it were freely redistributable, the source for Gill and Murray's quadratic programming solver QPSOL would be in this directory. Unfortunately, if you want octave to use QPSOL to solve quadratic programs, you must get the source from the Stanford Office of Technology Licensing: Stanford University Office of Technology Licensing 857 Serra Street Stanford CA 94305-7295 USA Tel: (415) 723-0651 Fax: (415) 725-7295 As of April, 1992, the license fee for QPSOL was $3600 for commercial sites and $400 for academic and US Government sites. octave-1.1.0/libcruft/quadpack/ 40777 415 17 0 5705521663 14456 5ustar jweusersoctave-1.1.0/libcruft/quadpack/Makefile.in100666 415 17 511 5662226314 16572 0ustar jweusers# # Makefile for octave's libcruft/quadpack directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/quadpack/dqagi.f100666 415 17 21142 5503443403 16016 0ustar jweusers SUBROUTINE DQAGI(F,BOUND,INF,EPSABS,EPSREL,RESULT,ABSERR,NEVAL, * IER,LIMIT,LENW,LAST,IWORK,WORK) C***BEGIN PROLOGUE DQAGI C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A3A1,H2A4A1 C***KEYWORDS AUTOMATIC INTEGRATOR, INFINITE INTERVALS, C GENERAL-PURPOSE, TRANSFORMATION, EXTRAPOLATION, C GLOBALLY ADAPTIVE C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. -K.U.LEUVEN C***PURPOSE THE ROUTINE CALCULATES AN APPROXIMATION RESULT TO A GIVEN C INTEGRAL I = INTEGRAL OF F OVER (BOUND,+INFINITY) C OR I = INTEGRAL OF F OVER (-INFINITY,BOUND) C OR I = INTEGRAL OF F OVER (-INFINITY,+INFINITY) C HOPEFULLY SATISFYING FOLLOWING CLAIM FOR ACCURACY C ABS(I-RESULT).LE.MAX(EPSABS,EPSREL*ABS(I)). C***DESCRIPTION C C INTEGRATION OVER INFINITE INTERVALS C STANDARD FORTRAN SUBROUTINE C C PARAMETERS C ON ENTRY C F - DOUBLE PRECISION C FUNCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE DRIVER PROGRAM. C C BOUND - DOUBLE PRECISION C FINITE BOUND OF INTEGRATION RANGE C (HAS NO MEANING IF INTERVAL IS DOUBLY-INFINITE) C C INF - INTEGER C INDICATING THE KIND OF INTEGRATION RANGE INVOLVED C INF = 1 CORRESPONDS TO (BOUND,+INFINITY), C INF = -1 TO (-INFINITY,BOUND), C INF = 2 TO (-INFINITY,+INFINITY). C C EPSABS - DOUBLE PRECISION C ABSOLUTE ACCURACY REQUESTED C EPSREL - DOUBLE PRECISION C RELATIVE ACCURACY REQUESTED C IF EPSABS.LE.0 C AND EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28), C THE ROUTINE WILL END WITH IER = 6. C C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD EQUAL OR EXCEED ABS(I-RESULT) C C NEVAL - INTEGER C NUMBER OF INTEGRAND EVALUATIONS C C IER - INTEGER C IER = 0 NORMAL AND RELIABLE TERMINATION OF THE C ROUTINE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS BEEN ACHIEVED. C - IER.GT.0 ABNORMAL TERMINATION OF THE ROUTINE. THE C ESTIMATES FOR RESULT AND ERROR ARE LESS C RELIABLE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS NOT BEEN ACHIEVED. C ERROR MESSAGES C IER = 1 MAXIMUM NUMBER OF SUBDIVISIONS ALLOWED C HAS BEEN ACHIEVED. ONE CAN ALLOW MORE C SUBDIVISIONS BY INCREASING THE VALUE OF C LIMIT (AND TAKING THE ACCORDING DIMENSION C ADJUSTMENTS INTO ACCOUNT). HOWEVER, IF C THIS YIELDS NO IMPROVEMENT IT IS ADVISED C TO ANALYZE THE INTEGRAND IN ORDER TO C DETERMINE THE INTEGRATION DIFFICULTIES. IF C THE POSITION OF A LOCAL DIFFICULTY CAN BE C DETERMINED (E.G. SINGULARITY, C DISCONTINUITY WITHIN THE INTERVAL) ONE C WILL PROBABLY GAIN FROM SPLITTING UP THE C INTERVAL AT THIS POINT AND CALLING THE C INTEGRATOR ON THE SUBRANGES. IF POSSIBLE, C AN APPROPRIATE SPECIAL-PURPOSE INTEGRATOR C SHOULD BE USED, WHICH IS DESIGNED FOR C HANDLING THE TYPE OF DIFFICULTY INVOLVED. C = 2 THE OCCURRENCE OF ROUNDOFF ERROR IS C DETECTED, WHICH PREVENTS THE REQUESTED C TOLERANCE FROM BEING ACHIEVED. C THE ERROR MAY BE UNDER-ESTIMATED. C = 3 EXTREMELY BAD INTEGRAND BEHAVIOUR OCCURS C AT SOME POINTS OF THE INTEGRATION C INTERVAL. C = 4 THE ALGORITHM DOES NOT CONVERGE. C ROUNDOFF ERROR IS DETECTED IN THE C EXTRAPOLATION TABLE. C IT IS ASSUMED THAT THE REQUESTED TOLERANCE C CANNOT BE ACHIEVED, AND THAT THE RETURNED C RESULT IS THE BEST WHICH CAN BE OBTAINED. C = 5 THE INTEGRAL IS PROBABLY DIVERGENT, OR C SLOWLY CONVERGENT. IT MUST BE NOTED THAT C DIVERGENCE CAN OCCUR WITH ANY OTHER VALUE C OF IER. C = 6 THE INPUT IS INVALID, BECAUSE C (EPSABS.LE.0 AND C EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28)) C OR LIMIT.LT.1 OR LENIW.LT.LIMIT*4. C RESULT, ABSERR, NEVAL, LAST ARE SET TO C ZERO. EXEPT WHEN LIMIT OR LENIW IS C INVALID, IWORK(1), WORK(LIMIT*2+1) AND C WORK(LIMIT*3+1) ARE SET TO ZERO, WORK(1) C IS SET TO A AND WORK(LIMIT+1) TO B. C C DIMENSIONING PARAMETERS C LIMIT - INTEGER C DIMENSIONING PARAMETER FOR IWORK C LIMIT DETERMINES THE MAXIMUM NUMBER OF SUBINTERVALS C IN THE PARTITION OF THE GIVEN INTEGRATION INTERVAL C (A,B), LIMIT.GE.1. C IF LIMIT.LT.1, THE ROUTINE WILL END WITH IER = 6. C C LENW - INTEGER C DIMENSIONING PARAMETER FOR WORK C LENW MUST BE AT LEAST LIMIT*4. C IF LENW.LT.LIMIT*4, THE ROUTINE WILL END C WITH IER = 6. C C LAST - INTEGER C ON RETURN, LAST EQUALS THE NUMBER OF SUBINTERVALS C PRODUCED IN THE SUBDIVISION PROCESS, WHICH C DETERMINES THE NUMBER OF SIGNIFICANT ELEMENTS C ACTUALLY IN THE WORK ARRAYS. C C WORK ARRAYS C IWORK - INTEGER C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C K ELEMENTS OF WHICH CONTAIN POINTERS C TO THE ERROR ESTIMATES OVER THE SUBINTERVALS, C SUCH THAT WORK(LIMIT*3+IWORK(1)),... , C WORK(LIMIT*3+IWORK(K)) FORM A DECREASING C SEQUENCE, WITH K = LAST IF LAST.LE.(LIMIT/2+2), AND C K = LIMIT+1-LAST OTHERWISE C C WORK - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LENW C ON RETURN C WORK(1), ..., WORK(LAST) CONTAIN THE LEFT C END POINTS OF THE SUBINTERVALS IN THE C PARTITION OF (A,B), C WORK(LIMIT+1), ..., WORK(LIMIT+LAST) CONTAIN C THE RIGHT END POINTS, C WORK(LIMIT*2+1), ...,WORK(LIMIT*2+LAST) CONTAIN THE C INTEGRAL APPROXIMATIONS OVER THE SUBINTERVALS, C WORK(LIMIT*3+1), ..., WORK(LIMIT*3) C CONTAIN THE ERROR ESTIMATES. C***REFERENCES (NONE) C***ROUTINES CALLED DQAGIE,XERROR C***END PROLOGUE DQAGI C DOUBLE PRECISION ABSERR,BOUND,EPSABS,EPSREL,F,RESULT,WORK INTEGER IER,INF,IWORK,LAST,LENW,LIMIT,LVL,L1,L2,L3,NEVAL C DIMENSION IWORK(LIMIT),WORK(LENW) C EXTERNAL F C C CHECK VALIDITY OF LIMIT AND LENW. C C***FIRST EXECUTABLE STATEMENT DQAGI IER = 6 NEVAL = 0 LAST = 0 RESULT = 0.0D+00 ABSERR = 0.0D+00 IF(LIMIT.LT.1.OR.LENW.LT.LIMIT*4) GO TO 10 C C PREPARE CALL FOR DQAGIE. C L1 = LIMIT+1 L2 = LIMIT+L1 L3 = LIMIT+L2 C CALL DQAGIE(F,BOUND,INF,EPSABS,EPSREL,LIMIT,RESULT,ABSERR, * NEVAL,IER,WORK(1),WORK(L1),WORK(L2),WORK(L3),IWORK,LAST) C C CALL ERROR HANDLER IF NECESSARY. C LVL = 0 10 IF(IER.EQ.6) LVL = 1 IF(IER.GT.0) CALL XERROR(26HABNORMAL RETURN FROM DQAGI,26,IER,LVL) RETURN END octave-1.1.0/libcruft/quadpack/dqagie.f100666 415 17 43355 5503443207 16177 0ustar jweusers SUBROUTINE DQAGIE(F,BOUND,INF,EPSABS,EPSREL,LIMIT,RESULT,ABSERR, * NEVAL,IER,ALIST,BLIST,RLIST,ELIST,IORD,LAST) C***BEGIN PROLOGUE DQAGIE C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A3A1,H2A4A1 C***KEYWORDS AUTOMATIC INTEGRATOR, INFINITE INTERVALS, C GENERAL-PURPOSE, TRANSFORMATION, EXTRAPOLATION, C GLOBALLY ADAPTIVE C***AUTHOR PIESSENS,ROBERT,APPL. MATH & PROGR. DIV - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH & PROGR. DIV - K.U.LEUVEN C***PURPOSE THE ROUTINE CALCULATES AN APPROXIMATION RESULT TO A GIVEN C INTEGRAL I = INTEGRAL OF F OVER (BOUND,+INFINITY) C OR I = INTEGRAL OF F OVER (-INFINITY,BOUND) C OR I = INTEGRAL OF F OVER (-INFINITY,+INFINITY), C HOPEFULLY SATISFYING FOLLOWING CLAIM FOR ACCURACY C ABS(I-RESULT).LE.MAX(EPSABS,EPSREL*ABS(I)) C***DESCRIPTION C C INTEGRATION OVER INFINITE INTERVALS C STANDARD FORTRAN SUBROUTINE C C F - DOUBLE PRECISION C FUNCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE DRIVER PROGRAM. C C BOUND - DOUBLE PRECISION C FINITE BOUND OF INTEGRATION RANGE C (HAS NO MEANING IF INTERVAL IS DOUBLY-INFINITE) C C INF - DOUBLE PRECISION C INDICATING THE KIND OF INTEGRATION RANGE INVOLVED C INF = 1 CORRESPONDS TO (BOUND,+INFINITY), C INF = -1 TO (-INFINITY,BOUND), C INF = 2 TO (-INFINITY,+INFINITY). C C EPSABS - DOUBLE PRECISION C ABSOLUTE ACCURACY REQUESTED C EPSREL - DOUBLE PRECISION C RELATIVE ACCURACY REQUESTED C IF EPSABS.LE.0 C AND EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28), C THE ROUTINE WILL END WITH IER = 6. C C LIMIT - INTEGER C GIVES AN UPPER BOUND ON THE NUMBER OF SUBINTERVALS C IN THE PARTITION OF (A,B), LIMIT.GE.1 C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD EQUAL OR EXCEED ABS(I-RESULT) C C NEVAL - INTEGER C NUMBER OF INTEGRAND EVALUATIONS C C IER - INTEGER C IER = 0 NORMAL AND RELIABLE TERMINATION OF THE C ROUTINE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS BEEN ACHIEVED. C IER.GT.0 ABNORMAL TERMINATION OF THE ROUTINE. THE C ESTIMATES FOR RESULT AND ERROR ARE LESS C RELIABLE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS NOT BEEN ACHIEVED. C IER.LT.0 EXIT REQUESTED FROM USER-SUPPLIED C FUNCTION. C C ERROR MESSAGES C IER = 1 MAXIMUM NUMBER OF SUBDIVISIONS ALLOWED C HAS BEEN ACHIEVED. ONE CAN ALLOW MORE C SUBDIVISIONS BY INCREASING THE VALUE OF C LIMIT (AND TAKING THE ACCORDING DIMENSION C ADJUSTMENTS INTO ACCOUNT). HOWEVER,IF C THIS YIELDS NO IMPROVEMENT IT IS ADVISED C TO ANALYZE THE INTEGRAND IN ORDER TO C DETERMINE THE INTEGRATION DIFFICULTIES. C IF THE POSITION OF A LOCAL DIFFICULTY CAN C BE DETERMINED (E.G. SINGULARITY, C DISCONTINUITY WITHIN THE INTERVAL) ONE C WILL PROBABLY GAIN FROM SPLITTING UP THE C INTERVAL AT THIS POINT AND CALLING THE C INTEGRATOR ON THE SUBRANGES. IF POSSIBLE, C AN APPROPRIATE SPECIAL-PURPOSE INTEGRATOR C SHOULD BE USED, WHICH IS DESIGNED FOR C HANDLING THE TYPE OF DIFFICULTY INVOLVED. C = 2 THE OCCURRENCE OF ROUNDOFF ERROR IS C DETECTED, WHICH PREVENTS THE REQUESTED C TOLERANCE FROM BEING ACHIEVED. C THE ERROR MAY BE UNDER-ESTIMATED. C = 3 EXTREMELY BAD INTEGRAND BEHAVIOUR OCCURS C AT SOME POINTS OF THE INTEGRATION C INTERVAL. C = 4 THE ALGORITHM DOES NOT CONVERGE. C ROUNDOFF ERROR IS DETECTED IN THE C EXTRAPOLATION TABLE. C IT IS ASSUMED THAT THE REQUESTED TOLERANCE C CANNOT BE ACHIEVED, AND THAT THE RETURNED C RESULT IS THE BEST WHICH CAN BE OBTAINED. C = 5 THE INTEGRAL IS PROBABLY DIVERGENT, OR C SLOWLY CONVERGENT. IT MUST BE NOTED THAT C DIVERGENCE CAN OCCUR WITH ANY OTHER VALUE C OF IER. C = 6 THE INPUT IS INVALID, BECAUSE C (EPSABS.LE.0 AND C EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28), C RESULT, ABSERR, NEVAL, LAST, RLIST(1), C ELIST(1) AND IORD(1) ARE SET TO ZERO. C ALIST(1) AND BLIST(1) ARE SET TO 0 C AND 1 RESPECTIVELY. C C ALIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE LEFT C END POINTS OF THE SUBINTERVALS IN THE PARTITION C OF THE TRANSFORMED INTEGRATION RANGE (0,1). C C BLIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE RIGHT C END POINTS OF THE SUBINTERVALS IN THE PARTITION C OF THE TRANSFORMED INTEGRATION RANGE (0,1). C C RLIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE INTEGRAL C APPROXIMATIONS ON THE SUBINTERVALS C C ELIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE MODULI OF THE C ABSOLUTE ERROR ESTIMATES ON THE SUBINTERVALS C C IORD - INTEGER C VECTOR OF DIMENSION LIMIT, THE FIRST K C ELEMENTS OF WHICH ARE POINTERS TO THE C ERROR ESTIMATES OVER THE SUBINTERVALS, C SUCH THAT ELIST(IORD(1)), ..., ELIST(IORD(K)) C FORM A DECREASING SEQUENCE, WITH K = LAST C IF LAST.LE.(LIMIT/2+2), AND K = LIMIT+1-LAST C OTHERWISE C C LAST - INTEGER C NUMBER OF SUBINTERVALS ACTUALLY PRODUCED C IN THE SUBDIVISION PROCESS C C***REFERENCES (NONE) C***ROUTINES CALLED D1MACH,DQELG,DQK15I,DQPSRT C***END PROLOGUE DQAGIE DOUBLE PRECISION ABSEPS,ABSERR,ALIST,AREA,AREA1,AREA12,AREA2,A1, * A2,BLIST,BOUN,BOUND,B1,B2,CORREC,DABS,DEFABS,DEFAB1,DEFAB2, * DMAX1,DRES,D1MACH,ELIST,EPMACH,EPSABS,EPSREL,ERLARG,ERLAST, * ERRBND,ERRMAX,ERROR1,ERROR2,ERRO12,ERRSUM,ERTEST,F,OFLOW,RESABS, * RESEPS,RESULT,RES3LA,RLIST,RLIST2,SMALL,UFLOW INTEGER ID,IER,IERRO,INF,IORD,IROFF1,IROFF2,IROFF3,JUPBND,K,KSGN, * KTMIN,LAST,LIMIT,MAXERR,NEVAL,NRES,NRMAX,NUMRL2 LOGICAL EXTRAP,NOEXT C DIMENSION ALIST(LIMIT),BLIST(LIMIT),ELIST(LIMIT),IORD(LIMIT), * RES3LA(3),RLIST(LIMIT),RLIST2(52) C EXTERNAL F C C THE DIMENSION OF RLIST2 IS DETERMINED BY THE VALUE OF C LIMEXP IN SUBROUTINE DQELG. C C C LIST OF MAJOR VARIABLES C ----------------------- C C ALIST - LIST OF LEFT END POINTS OF ALL SUBINTERVALS C CONSIDERED UP TO NOW C BLIST - LIST OF RIGHT END POINTS OF ALL SUBINTERVALS C CONSIDERED UP TO NOW C RLIST(I) - APPROXIMATION TO THE INTEGRAL OVER C (ALIST(I),BLIST(I)) C RLIST2 - ARRAY OF DIMENSION AT LEAST (LIMEXP+2), C CONTAINING THE PART OF THE EPSILON TABLE C WICH IS STILL NEEDED FOR FURTHER COMPUTATIONS C ELIST(I) - ERROR ESTIMATE APPLYING TO RLIST(I) C MAXERR - POINTER TO THE INTERVAL WITH LARGEST ERROR C ESTIMATE C ERRMAX - ELIST(MAXERR) C ERLAST - ERROR ON THE INTERVAL CURRENTLY SUBDIVIDED C (BEFORE THAT SUBDIVISION HAS TAKEN PLACE) C AREA - SUM OF THE INTEGRALS OVER THE SUBINTERVALS C ERRSUM - SUM OF THE ERRORS OVER THE SUBINTERVALS C ERRBND - REQUESTED ACCURACY MAX(EPSABS,EPSREL* C ABS(RESULT)) C *****1 - VARIABLE FOR THE LEFT SUBINTERVAL C *****2 - VARIABLE FOR THE RIGHT SUBINTERVAL C LAST - INDEX FOR SUBDIVISION C NRES - NUMBER OF CALLS TO THE EXTRAPOLATION ROUTINE C NUMRL2 - NUMBER OF ELEMENTS CURRENTLY IN RLIST2. IF AN C APPROPRIATE APPROXIMATION TO THE COMPOUNDED C INTEGRAL HAS BEEN OBTAINED, IT IS PUT IN C RLIST2(NUMRL2) AFTER NUMRL2 HAS BEEN INCREASED C BY ONE. C SMALL - LENGTH OF THE SMALLEST INTERVAL CONSIDERED UP C TO NOW, MULTIPLIED BY 1.5 C ERLARG - SUM OF THE ERRORS OVER THE INTERVALS LARGER C THAN THE SMALLEST INTERVAL CONSIDERED UP TO NOW C EXTRAP - LOGICAL VARIABLE DENOTING THAT THE ROUTINE C IS ATTEMPTING TO PERFORM EXTRAPOLATION. I.E. C BEFORE SUBDIVIDING THE SMALLEST INTERVAL WE C TRY TO DECREASE THE VALUE OF ERLARG. C NOEXT - LOGICAL VARIABLE DENOTING THAT EXTRAPOLATION C IS NO LONGER ALLOWED (TRUE-VALUE) C C MACHINE DEPENDENT CONSTANTS C --------------------------- C C EPMACH IS THE LARGEST RELATIVE SPACING. C UFLOW IS THE SMALLEST POSITIVE MAGNITUDE. C OFLOW IS THE LARGEST POSITIVE MAGNITUDE. C C***FIRST EXECUTABLE STATEMENT DQAGIE EPMACH = D1MACH(4) C C TEST ON VALIDITY OF PARAMETERS C ----------------------------- C IER = 0 NEVAL = 0 LAST = 0 RESULT = 0.0D+00 ABSERR = 0.0D+00 ALIST(1) = 0.0D+00 BLIST(1) = 0.1D+01 RLIST(1) = 0.0D+00 ELIST(1) = 0.0D+00 IORD(1) = 0 IF(EPSABS.LE.0.0D+00.AND.EPSREL.LT.DMAX1(0.5D+02*EPMACH,0.5D-28)) * IER = 6 IF(IER.EQ.6) GO TO 999 C C C FIRST APPROXIMATION TO THE INTEGRAL C ----------------------------------- C C DETERMINE THE INTERVAL TO BE MAPPED ONTO (0,1). C IF INF = 2 THE INTEGRAL IS COMPUTED AS I = I1+I2, WHERE C I1 = INTEGRAL OF F OVER (-INFINITY,0), C I2 = INTEGRAL OF F OVER (0,+INFINITY). C BOUN = BOUND IF(INF.EQ.2) BOUN = 0.0D+00 CALL DQK15I(F,BOUN,INF,0.0D+00,0.1D+01,RESULT,ABSERR, * DEFABS,RESABS,IER) IF (IER .LT. 0) RETURN C C TEST ON ACCURACY C LAST = 1 RLIST(1) = RESULT ELIST(1) = ABSERR IORD(1) = 1 DRES = DABS(RESULT) ERRBND = DMAX1(EPSABS,EPSREL*DRES) IF(ABSERR.LE.1.0D+02*EPMACH*DEFABS.AND.ABSERR.GT.ERRBND) IER = 2 IF(LIMIT.EQ.1) IER = 1 IF(IER.NE.0.OR.(ABSERR.LE.ERRBND.AND.ABSERR.NE.RESABS).OR. * ABSERR.EQ.0.0D+00) GO TO 130 C C INITIALIZATION C -------------- C UFLOW = D1MACH(1) OFLOW = D1MACH(2) RLIST2(1) = RESULT ERRMAX = ABSERR MAXERR = 1 AREA = RESULT ERRSUM = ABSERR ABSERR = OFLOW NRMAX = 1 NRES = 0 KTMIN = 0 NUMRL2 = 2 EXTRAP = .FALSE. NOEXT = .FALSE. IERRO = 0 IROFF1 = 0 IROFF2 = 0 IROFF3 = 0 KSGN = -1 IF(DRES.GE.(0.1D+01-0.5D+02*EPMACH)*DEFABS) KSGN = 1 C C MAIN DO-LOOP C ------------ C DO 90 LAST = 2,LIMIT C C BISECT THE SUBINTERVAL WITH NRMAX-TH LARGEST ERROR ESTIMATE. C A1 = ALIST(MAXERR) B1 = 0.5D+00*(ALIST(MAXERR)+BLIST(MAXERR)) A2 = B1 B2 = BLIST(MAXERR) ERLAST = ERRMAX CALL DQK15I(F,BOUN,INF,A1,B1,AREA1,ERROR1,RESABS,DEFAB1,IER) IF (IER .LT. 0) RETURN CALL DQK15I(F,BOUN,INF,A2,B2,AREA2,ERROR2,RESABS,DEFAB2,IER) IF (IER .LT. 0) RETURN C C IMPROVE PREVIOUS APPROXIMATIONS TO INTEGRAL C AND ERROR AND TEST FOR ACCURACY. C AREA12 = AREA1+AREA2 ERRO12 = ERROR1+ERROR2 ERRSUM = ERRSUM+ERRO12-ERRMAX AREA = AREA+AREA12-RLIST(MAXERR) IF(DEFAB1.EQ.ERROR1.OR.DEFAB2.EQ.ERROR2)GO TO 15 IF(DABS(RLIST(MAXERR)-AREA12).GT.0.1D-04*DABS(AREA12) * .OR.ERRO12.LT.0.99D+00*ERRMAX) GO TO 10 IF(EXTRAP) IROFF2 = IROFF2+1 IF(.NOT.EXTRAP) IROFF1 = IROFF1+1 10 IF(LAST.GT.10.AND.ERRO12.GT.ERRMAX) IROFF3 = IROFF3+1 15 RLIST(MAXERR) = AREA1 RLIST(LAST) = AREA2 ERRBND = DMAX1(EPSABS,EPSREL*DABS(AREA)) C C TEST FOR ROUNDOFF ERROR AND EVENTUALLY SET ERROR FLAG. C IF(IROFF1+IROFF2.GE.10.OR.IROFF3.GE.20) IER = 2 IF(IROFF2.GE.5) IERRO = 3 C C SET ERROR FLAG IN THE CASE THAT THE NUMBER OF C SUBINTERVALS EQUALS LIMIT. C IF(LAST.EQ.LIMIT) IER = 1 C C SET ERROR FLAG IN THE CASE OF BAD INTEGRAND BEHAVIOUR C AT SOME POINTS OF THE INTEGRATION RANGE. C IF(DMAX1(DABS(A1),DABS(B2)).LE.(0.1D+01+0.1D+03*EPMACH)* * (DABS(A2)+0.1D+04*UFLOW)) IER = 4 C C APPEND THE NEWLY-CREATED INTERVALS TO THE LIST. C IF(ERROR2.GT.ERROR1) GO TO 20 ALIST(LAST) = A2 BLIST(MAXERR) = B1 BLIST(LAST) = B2 ELIST(MAXERR) = ERROR1 ELIST(LAST) = ERROR2 GO TO 30 20 ALIST(MAXERR) = A2 ALIST(LAST) = A1 BLIST(LAST) = B1 RLIST(MAXERR) = AREA2 RLIST(LAST) = AREA1 ELIST(MAXERR) = ERROR2 ELIST(LAST) = ERROR1 C C CALL SUBROUTINE DQPSRT TO MAINTAIN THE DESCENDING ORDERING C IN THE LIST OF ERROR ESTIMATES AND SELECT THE SUBINTERVAL C WITH NRMAX-TH LARGEST ERROR ESTIMATE (TO BE BISECTED NEXT). C 30 CALL DQPSRT(LIMIT,LAST,MAXERR,ERRMAX,ELIST,IORD,NRMAX) IF(ERRSUM.LE.ERRBND) GO TO 115 IF(IER.NE.0) GO TO 100 IF(LAST.EQ.2) GO TO 80 IF(NOEXT) GO TO 90 ERLARG = ERLARG-ERLAST IF(DABS(B1-A1).GT.SMALL) ERLARG = ERLARG+ERRO12 IF(EXTRAP) GO TO 40 C C TEST WHETHER THE INTERVAL TO BE BISECTED NEXT IS THE C SMALLEST INTERVAL. C IF(DABS(BLIST(MAXERR)-ALIST(MAXERR)).GT.SMALL) GO TO 90 EXTRAP = .TRUE. NRMAX = 2 40 IF(IERRO.EQ.3.OR.ERLARG.LE.ERTEST) GO TO 60 C C THE SMALLEST INTERVAL HAS THE LARGEST ERROR. C BEFORE BISECTING DECREASE THE SUM OF THE ERRORS OVER THE C LARGER INTERVALS (ERLARG) AND PERFORM EXTRAPOLATION. C ID = NRMAX JUPBND = LAST IF(LAST.GT.(2+LIMIT/2)) JUPBND = LIMIT+3-LAST DO 50 K = ID,JUPBND MAXERR = IORD(NRMAX) ERRMAX = ELIST(MAXERR) IF(DABS(BLIST(MAXERR)-ALIST(MAXERR)).GT.SMALL) GO TO 90 NRMAX = NRMAX+1 50 CONTINUE C C PERFORM EXTRAPOLATION. C 60 NUMRL2 = NUMRL2+1 RLIST2(NUMRL2) = AREA CALL DQELG(NUMRL2,RLIST2,RESEPS,ABSEPS,RES3LA,NRES) KTMIN = KTMIN+1 IF(KTMIN.GT.5.AND.ABSERR.LT.0.1D-02*ERRSUM) IER = 5 IF(ABSEPS.GE.ABSERR) GO TO 70 KTMIN = 0 ABSERR = ABSEPS RESULT = RESEPS CORREC = ERLARG ERTEST = DMAX1(EPSABS,EPSREL*DABS(RESEPS)) IF(ABSERR.LE.ERTEST) GO TO 100 C C PREPARE BISECTION OF THE SMALLEST INTERVAL. C 70 IF(NUMRL2.EQ.1) NOEXT = .TRUE. IF(IER.EQ.5) GO TO 100 MAXERR = IORD(1) ERRMAX = ELIST(MAXERR) NRMAX = 1 EXTRAP = .FALSE. SMALL = SMALL*0.5D+00 ERLARG = ERRSUM GO TO 90 80 SMALL = 0.375D+00 ERLARG = ERRSUM ERTEST = ERRBND RLIST2(2) = AREA 90 CONTINUE C C SET FINAL RESULT AND ERROR ESTIMATE. C ------------------------------------ C 100 IF(ABSERR.EQ.OFLOW) GO TO 115 IF((IER+IERRO).EQ.0) GO TO 110 IF(IERRO.EQ.3) ABSERR = ABSERR+CORREC IF(IER.EQ.0) IER = 3 IF(RESULT.NE.0.0D+00.AND.AREA.NE.0.0D+00)GO TO 105 IF(ABSERR.GT.ERRSUM)GO TO 115 IF(AREA.EQ.0.0D+00) GO TO 130 GO TO 110 105 IF(ABSERR/DABS(RESULT).GT.ERRSUM/DABS(AREA))GO TO 115 C C TEST ON DIVERGENCE C 110 IF(KSGN.EQ.(-1).AND.DMAX1(DABS(RESULT),DABS(AREA)).LE. * DEFABS*0.1D-01) GO TO 130 IF(0.1D-01.GT.(RESULT/AREA).OR.(RESULT/AREA).GT.0.1D+03. *OR.ERRSUM.GT.DABS(AREA)) IER = 6 GO TO 130 C C COMPUTE GLOBAL INTEGRAL SUM. C 115 RESULT = 0.0D+00 DO 120 K = 1,LAST RESULT = RESULT+RLIST(K) 120 CONTINUE ABSERR = ERRSUM 130 NEVAL = 30*LAST-15 IF(INF.EQ.2) NEVAL = 2*NEVAL IF(IER.GT.2) IER=IER-1 999 RETURN END octave-1.1.0/libcruft/quadpack/dqagp.f100666 415 17 24425 5503443442 16037 0ustar jweusers SUBROUTINE DQAGP(F,A,B,NPTS2,POINTS,EPSABS,EPSREL,RESULT,ABSERR, * NEVAL,IER,LENIW,LENW,LAST,IWORK,WORK) C***BEGIN PROLOGUE DQAGP C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A2A1 C***KEYWORDS AUTOMATIC INTEGRATOR, GENERAL-PURPOSE, C SINGULARITIES AT USER SPECIFIED POINTS, C EXTRAPOLATION, GLOBALLY ADAPTIVE C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C***PURPOSE THE ROUTINE CALCULATES AN APPROXIMATION RESULT TO A GIVEN C DEFINITE INTEGRAL I = INTEGRAL OF F OVER (A,B), C HOPEFULLY SATISFYING FOLLOWING CLAIM FOR ACCURACY C BREAK POINTS OF THE INTEGRATION INTERVAL, WHERE LOCAL C DIFFICULTIES OF THE INTEGRAND MAY OCCUR (E.G. C SINGULARITIES, DISCONTINUITIES), ARE PROVIDED BY THE USER. C***DESCRIPTION C C COMPUTATION OF A DEFINITE INTEGRAL C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS C ON ENTRY C F - DOUBLE PRECISION C FUNCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE DRIVER PROGRAM. C C A - DOUBLE PRECISION C LOWER LIMIT OF INTEGRATION C C B - DOUBLE PRECISION C UPPER LIMIT OF INTEGRATION C C NPTS2 - INTEGER C NUMBER EQUAL TO TWO MORE THAN THE NUMBER OF C USER-SUPPLIED BREAK POINTS WITHIN THE INTEGRATION C RANGE, NPTS.GE.2. C IF NPTS2.LT.2, THE ROUTINE WILL END WITH IER = 6. C C POINTS - DOUBLE PRECISION C VECTOR OF DIMENSION NPTS2, THE FIRST (NPTS2-2) C ELEMENTS OF WHICH ARE THE USER PROVIDED BREAK C POINTS. IF THESE POINTS DO NOT CONSTITUTE AN C ASCENDING SEQUENCE THERE WILL BE AN AUTOMATIC C SORTING. C C EPSABS - DOUBLE PRECISION C ABSOLUTE ACCURACY REQUESTED C EPSREL - DOUBLE PRECISION C RELATIVE ACCURACY REQUESTED C IF EPSABS.LE.0 C AND EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28), C THE ROUTINE WILL END WITH IER = 6. C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD EQUAL OR EXCEED ABS(I-RESULT) C C NEVAL - INTEGER C NUMBER OF INTEGRAND EVALUATIONS C C IER - INTEGER C IER = 0 NORMAL AND RELIABLE TERMINATION OF THE C ROUTINE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS BEEN ACHIEVED. C IER.GT.0 ABNORMAL TERMINATION OF THE ROUTINE. C THE ESTIMATES FOR INTEGRAL AND ERROR ARE C LESS RELIABLE. IT IS ASSUMED THAT THE C REQUESTED ACCURACY HAS NOT BEEN ACHIEVED. C ERROR MESSAGES C IER = 1 MAXIMUM NUMBER OF SUBDIVISIONS ALLOWED C HAS BEEN ACHIEVED. ONE CAN ALLOW MORE C SUBDIVISIONS BY INCREASING THE VALUE OF C LIMIT (AND TAKING THE ACCORDING DIMENSION C ADJUSTMENTS INTO ACCOUNT). HOWEVER, IF C THIS YIELDS NO IMPROVEMENT IT IS ADVISED C TO ANALYZE THE INTEGRAND IN ORDER TO C DETERMINE THE INTEGRATION DIFFICULTIES. IF C THE POSITION OF A LOCAL DIFFICULTY CAN BE C DETERMINED (I.E. SINGULARITY, C DISCONTINUITY WITHIN THE INTERVAL), IT C SHOULD BE SUPPLIED TO THE ROUTINE AS AN C ELEMENT OF THE VECTOR POINTS. IF NECESSARY C AN APPROPRIATE SPECIAL-PURPOSE INTEGRATOR C MUST BE USED, WHICH IS DESIGNED FOR C HANDLING THE TYPE OF DIFFICULTY INVOLVED. C = 2 THE OCCURRENCE OF ROUNDOFF ERROR IS C DETECTED, WHICH PREVENTS THE REQUESTED C TOLERANCE FROM BEING ACHIEVED. C THE ERROR MAY BE UNDER-ESTIMATED. C = 3 EXTREMELY BAD INTEGRAND BEHAVIOUR OCCURS C AT SOME POINTS OF THE INTEGRATION C INTERVAL. C = 4 THE ALGORITHM DOES NOT CONVERGE. C ROUNDOFF ERROR IS DETECTED IN THE C EXTRAPOLATION TABLE. C IT IS PRESUMED THAT THE REQUESTED C TOLERANCE CANNOT BE ACHIEVED, AND THAT C THE RETURNED RESULT IS THE BEST WHICH C CAN BE OBTAINED. C = 5 THE INTEGRAL IS PROBABLY DIVERGENT, OR C SLOWLY CONVERGENT. IT MUST BE NOTED THAT C DIVERGENCE CAN OCCUR WITH ANY OTHER VALUE C OF IER.GT.0. C = 6 THE INPUT IS INVALID BECAUSE C NPTS2.LT.2 OR C BREAK POINTS ARE SPECIFIED OUTSIDE C THE INTEGRATION RANGE OR C (EPSABS.LE.0 AND C EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28)) C RESULT, ABSERR, NEVAL, LAST ARE SET TO C ZERO. EXEPT WHEN LENIW OR LENW OR NPTS2 IS C INVALID, IWORK(1), IWORK(LIMIT+1), C WORK(LIMIT*2+1) AND WORK(LIMIT*3+1) C ARE SET TO ZERO. C WORK(1) IS SET TO A AND WORK(LIMIT+1) C TO B (WHERE LIMIT = (LENIW-NPTS2)/2). C C DIMENSIONING PARAMETERS C LENIW - INTEGER C DIMENSIONING PARAMETER FOR IWORK C LENIW DETERMINES LIMIT = (LENIW-NPTS2)/2, C WHICH IS THE MAXIMUM NUMBER OF SUBINTERVALS IN THE C PARTITION OF THE GIVEN INTEGRATION INTERVAL (A,B), C LENIW.GE.(3*NPTS2-2). C IF LENIW.LT.(3*NPTS2-2), THE ROUTINE WILL END WITH C IER = 6. C C LENW - INTEGER C DIMENSIONING PARAMETER FOR WORK C LENW MUST BE AT LEAST LENIW*2-NPTS2. C IF LENW.LT.LENIW*2-NPTS2, THE ROUTINE WILL END C WITH IER = 6. C C LAST - INTEGER C ON RETURN, LAST EQUALS THE NUMBER OF SUBINTERVALS C PRODUCED IN THE SUBDIVISION PROCESS, WHICH C DETERMINES THE NUMBER OF SIGNIFICANT ELEMENTS C ACTUALLY IN THE WORK ARRAYS. C C WORK ARRAYS C IWORK - INTEGER C VECTOR OF DIMENSION AT LEAST LENIW. ON RETURN, C THE FIRST K ELEMENTS OF WHICH CONTAIN C POINTERS TO THE ERROR ESTIMATES OVER THE C SUBINTERVALS, SUCH THAT WORK(LIMIT*3+IWORK(1)),..., C WORK(LIMIT*3+IWORK(K)) FORM A DECREASING C SEQUENCE, WITH K = LAST IF LAST.LE.(LIMIT/2+2), AND C K = LIMIT+1-LAST OTHERWISE C IWORK(LIMIT+1), ...,IWORK(LIMIT+LAST) CONTAIN THE C SUBDIVISION LEVELS OF THE SUBINTERVALS, I.E. C IF (AA,BB) IS A SUBINTERVAL OF (P1,P2) C WHERE P1 AS WELL AS P2 IS A USER-PROVIDED C BREAK POINT OR INTEGRATION LIMIT, THEN (AA,BB) HAS C LEVEL L IF ABS(BB-AA) = ABS(P2-P1)*2**(-L), C IWORK(LIMIT*2+1), ..., IWORK(LIMIT*2+NPTS2) HAVE C NO SIGNIFICANCE FOR THE USER, C NOTE THAT LIMIT = (LENIW-NPTS2)/2. C C WORK - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LENW C ON RETURN C WORK(1), ..., WORK(LAST) CONTAIN THE LEFT C END POINTS OF THE SUBINTERVALS IN THE C PARTITION OF (A,B), C WORK(LIMIT+1), ..., WORK(LIMIT+LAST) CONTAIN C THE RIGHT END POINTS, C WORK(LIMIT*2+1), ..., WORK(LIMIT*2+LAST) CONTAIN C THE INTEGRAL APPROXIMATIONS OVER THE SUBINTERVALS, C WORK(LIMIT*3+1), ..., WORK(LIMIT*3+LAST) C CONTAIN THE CORRESPONDING ERROR ESTIMATES, C WORK(LIMIT*4+1), ..., WORK(LIMIT*4+NPTS2) C CONTAIN THE INTEGRATION LIMITS AND THE C BREAK POINTS SORTED IN AN ASCENDING SEQUENCE. C NOTE THAT LIMIT = (LENIW-NPTS2)/2. C C***REFERENCES (NONE) C***ROUTINES CALLED DQAGPE,XERROR C***END PROLOGUE DQAGP C DOUBLE PRECISION A,ABSERR,B,EPSABS,EPSREL,F,POINTS,RESULT,WORK INTEGER IER,IWORK,LAST,LENIW,LENW,LIMIT,LVL,L1,L2,L3,L4,NEVAL, * NPTS2 C DIMENSION IWORK(LENIW),POINTS(NPTS2),WORK(LENW) C EXTERNAL F C C CHECK VALIDITY OF LIMIT AND LENW. C C***FIRST EXECUTABLE STATEMENT DQAGP IER = 6 NEVAL = 0 LAST = 0 RESULT = 0.0D+00 ABSERR = 0.0D+00 IF(LENIW.LT.(3*NPTS2-2).OR.LENW.LT.(LENIW*2-NPTS2).OR.NPTS2.LT.2) * GO TO 10 C C PREPARE CALL FOR DQAGPE. C LIMIT = (LENIW-NPTS2)/2 L1 = LIMIT+1 L2 = LIMIT+L1 L3 = LIMIT+L2 L4 = LIMIT+L3 C CALL DQAGPE(F,A,B,NPTS2,POINTS,EPSABS,EPSREL,LIMIT,RESULT,ABSERR, * NEVAL,IER,WORK(1),WORK(L1),WORK(L2),WORK(L3),WORK(L4), * IWORK(1),IWORK(L1),IWORK(L2),LAST) C C CALL ERROR HANDLER IF NECESSARY. C LVL = 0 10 IF(IER.EQ.6) LVL = 1 IF(IER.GT.0) CALL XERROR(26HABNORMAL RETURN FROM DQAGP,26,IER,LVL) RETURN END octave-1.1.0/libcruft/quadpack/dqagpe.f100666 415 17 51773 5503443265 16215 0ustar jweusers SUBROUTINE DQAGPE(F,A,B,NPTS2,POINTS,EPSABS,EPSREL,LIMIT,RESULT, * ABSERR,NEVAL,IER,ALIST,BLIST,RLIST,ELIST,PTS,IORD,LEVEL,NDIN, * LAST) C***BEGIN PROLOGUE DQAGPE C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A2A1 C***KEYWORDS AUTOMATIC INTEGRATOR, GENERAL-PURPOSE, C SINGULARITIES AT USER SPECIFIED POINTS, C EXTRAPOLATION, GLOBALLY ADAPTIVE. C***AUTHOR PIESSENS,ROBERT ,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C***PURPOSE THE ROUTINE CALCULATES AN APPROXIMATION RESULT TO A GIVEN C DEFINITE INTEGRAL I = INTEGRAL OF F OVER (A,B), HOPEFULLY C SATISFYING FOLLOWING CLAIM FOR ACCURACY ABS(I-RESULT).LE. C MAX(EPSABS,EPSREL*ABS(I)). BREAK POINTS OF THE INTEGRATION C INTERVAL, WHERE LOCAL DIFFICULTIES OF THE INTEGRAND MAY C OCCUR(E.G. SINGULARITIES,DISCONTINUITIES),PROVIDED BY USER. C***DESCRIPTION C C COMPUTATION OF A DEFINITE INTEGRAL C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS C ON ENTRY C F - DOUBLE PRECISION C FUNCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE DRIVER PROGRAM. C C A - DOUBLE PRECISION C LOWER LIMIT OF INTEGRATION C C B - DOUBLE PRECISION C UPPER LIMIT OF INTEGRATION C C NPTS2 - INTEGER C NUMBER EQUAL TO TWO MORE THAN THE NUMBER OF C USER-SUPPLIED BREAK POINTS WITHIN THE INTEGRATION C RANGE, NPTS2.GE.2. C IF NPTS2.LT.2, THE ROUTINE WILL END WITH IER = 6. C C POINTS - DOUBLE PRECISION C VECTOR OF DIMENSION NPTS2, THE FIRST (NPTS2-2) C ELEMENTS OF WHICH ARE THE USER PROVIDED BREAK C POINTS. IF THESE POINTS DO NOT CONSTITUTE AN C ASCENDING SEQUENCE THERE WILL BE AN AUTOMATIC C SORTING. C C EPSABS - DOUBLE PRECISION C ABSOLUTE ACCURACY REQUESTED C EPSREL - DOUBLE PRECISION C RELATIVE ACCURACY REQUESTED C IF EPSABS.LE.0 C AND EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28), C THE ROUTINE WILL END WITH IER = 6. C C LIMIT - INTEGER C GIVES AN UPPER BOUND ON THE NUMBER OF SUBINTERVALS C IN THE PARTITION OF (A,B), LIMIT.GE.NPTS2 C IF LIMIT.LT.NPTS2, THE ROUTINE WILL END WITH C IER = 6. C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD EQUAL OR EXCEED ABS(I-RESULT) C C NEVAL - INTEGER C NUMBER OF INTEGRAND EVALUATIONS C C IER - INTEGER C IER = 0 NORMAL AND RELIABLE TERMINATION OF THE C ROUTINE. IT IS ASSUMED THAT THE REQUESTED C ACCURACY HAS BEEN ACHIEVED. C IER.GT.0 ABNORMAL TERMINATION OF THE ROUTINE. C THE ESTIMATES FOR INTEGRAL AND ERROR ARE C LESS RELIABLE. IT IS ASSUMED THAT THE C REQUESTED ACCURACY HAS NOT BEEN ACHIEVED. C IER.LT.0 EXIT REQUESTED FROM USER-SUPPLIED C FUNCTION. C C ERROR MESSAGES C IER = 1 MAXIMUM NUMBER OF SUBDIVISIONS ALLOWED C HAS BEEN ACHIEVED. ONE CAN ALLOW MORE C SUBDIVISIONS BY INCREASING THE VALUE OF C LIMIT (AND TAKING THE ACCORDING DIMENSION C ADJUSTMENTS INTO ACCOUNT). HOWEVER, IF C THIS YIELDS NO IMPROVEMENT IT IS ADVISED C TO ANALYZE THE INTEGRAND IN ORDER TO C DETERMINE THE INTEGRATION DIFFICULTIES. IF C THE POSITION OF A LOCAL DIFFICULTY CAN BE C DETERMINED (I.E. SINGULARITY, C DISCONTINUITY WITHIN THE INTERVAL), IT C SHOULD BE SUPPLIED TO THE ROUTINE AS AN C ELEMENT OF THE VECTOR POINTS. IF NECESSARY C AN APPROPRIATE SPECIAL-PURPOSE INTEGRATOR C MUST BE USED, WHICH IS DESIGNED FOR C HANDLING THE TYPE OF DIFFICULTY INVOLVED. C = 2 THE OCCURRENCE OF ROUNDOFF ERROR IS C DETECTED, WHICH PREVENTS THE REQUESTED C TOLERANCE FROM BEING ACHIEVED. C THE ERROR MAY BE UNDER-ESTIMATED. C = 3 EXTREMELY BAD INTEGRAND BEHAVIOUR OCCURS C AT SOME POINTS OF THE INTEGRATION C INTERVAL. C = 4 THE ALGORITHM DOES NOT CONVERGE. C ROUNDOFF ERROR IS DETECTED IN THE C EXTRAPOLATION TABLE. IT IS PRESUMED THAT C THE REQUESTED TOLERANCE CANNOT BE C ACHIEVED, AND THAT THE RETURNED RESULT IS C THE BEST WHICH CAN BE OBTAINED. C = 5 THE INTEGRAL IS PROBABLY DIVERGENT, OR C SLOWLY CONVERGENT. IT MUST BE NOTED THAT C DIVERGENCE CAN OCCUR WITH ANY OTHER VALUE C OF IER.GT.0. C = 6 THE INPUT IS INVALID BECAUSE C NPTS2.LT.2 OR C BREAK POINTS ARE SPECIFIED OUTSIDE C THE INTEGRATION RANGE OR C (EPSABS.LE.0 AND C EPSREL.LT.MAX(50*REL.MACH.ACC.,0.5D-28)) C OR LIMIT.LT.NPTS2. C RESULT, ABSERR, NEVAL, LAST, RLIST(1), C AND ELIST(1) ARE SET TO ZERO. ALIST(1) AND C BLIST(1) ARE SET TO A AND B RESPECTIVELY. C C ALIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE LEFT END POINTS C OF THE SUBINTERVALS IN THE PARTITION OF THE GIVEN C INTEGRATION RANGE (A,B) C C BLIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE RIGHT END POINTS C OF THE SUBINTERVALS IN THE PARTITION OF THE GIVEN C INTEGRATION RANGE (A,B) C C RLIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE INTEGRAL C APPROXIMATIONS ON THE SUBINTERVALS C C ELIST - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST C LAST ELEMENTS OF WHICH ARE THE MODULI OF THE C ABSOLUTE ERROR ESTIMATES ON THE SUBINTERVALS C C PTS - DOUBLE PRECISION C VECTOR OF DIMENSION AT LEAST NPTS2, CONTAINING THE C INTEGRATION LIMITS AND THE BREAK POINTS OF THE C INTERVAL IN ASCENDING SEQUENCE. C C LEVEL - INTEGER C VECTOR OF DIMENSION AT LEAST LIMIT, CONTAINING THE C SUBDIVISION LEVELS OF THE SUBINTERVAL, I.E. IF C (AA,BB) IS A SUBINTERVAL OF (P1,P2) WHERE P1 AS C WELL AS P2 IS A USER-PROVIDED BREAK POINT OR C INTEGRATION LIMIT, THEN (AA,BB) HAS LEVEL L IF C ABS(BB-AA) = ABS(P2-P1)*2**(-L). C C NDIN - INTEGER C VECTOR OF DIMENSION AT LEAST NPTS2, AFTER FIRST C INTEGRATION OVER THE INTERVALS (PTS(I)),PTS(I+1), C I = 0,1, ..., NPTS2-2, THE ERROR ESTIMATES OVER C SOME OF THE INTERVALS MAY HAVE BEEN INCREASED C ARTIFICIALLY, IN ORDER TO PUT THEIR SUBDIVISION C FORWARD. IF THIS HAPPENS FOR THE SUBINTERVAL C NUMBERED K, NDIN(K) IS PUT TO 1, OTHERWISE C NDIN(K) = 0. C C IORD - INTEGER C VECTOR OF DIMENSION AT LEAST LIMIT, THE FIRST K C ELEMENTS OF WHICH ARE POINTERS TO THE C ERROR ESTIMATES OVER THE SUBINTERVALS, C SUCH THAT ELIST(IORD(1)), ..., ELIST(IORD(K)) C FORM A DECREASING SEQUENCE, WITH K = LAST C IF LAST.LE.(LIMIT/2+2), AND K = LIMIT+1-LAST C OTHERWISE C C LAST - INTEGER C NUMBER OF SUBINTERVALS ACTUALLY PRODUCED IN THE C SUBDIVISIONS PROCESS C C***REFERENCES (NONE) C***ROUTINES CALLED D1MACH,DQELG,DQK21,DQPSRT C***END PROLOGUE DQAGPE DOUBLE PRECISION A,ABSEPS,ABSERR,ALIST,AREA,AREA1,AREA12,AREA2,A1, * A2,B,BLIST,B1,B2,CORREC,DABS,DEFABS,DEFAB1,DEFAB2,DMAX1,DMIN1, * DRES,D1MACH,ELIST,EPMACH,EPSABS,EPSREL,ERLARG,ERLAST,ERRBND, * ERRMAX,ERROR1,ERRO12,ERROR2,ERRSUM,ERTEST,F,OFLOW,POINTS,PTS, * RESA,RESABS,RESEPS,RESULT,RES3LA,RLIST,RLIST2,SIGN,TEMP,UFLOW INTEGER I,ID,IER,IERRO,IND1,IND2,IORD,IP1,IROFF1,IROFF2,IROFF3,J, * JLOW,JUPBND,K,KSGN,KTMIN,LAST,LEVCUR,LEVEL,LEVMAX,LIMIT,MAXERR, * NDIN,NEVAL,NINT,NINTP1,NPTS,NPTS2,NRES,NRMAX,NUMRL2 LOGICAL EXTRAP,NOEXT C C DIMENSION ALIST(LIMIT),BLIST(LIMIT),ELIST(LIMIT),IORD(LIMIT), * LEVEL(LIMIT),NDIN(NPTS2),POINTS(NPTS2),PTS(NPTS2),RES3LA(3), * RLIST(LIMIT),RLIST2(52) C EXTERNAL F C C THE DIMENSION OF RLIST2 IS DETERMINED BY THE VALUE OF C LIMEXP IN SUBROUTINE EPSALG (RLIST2 SHOULD BE OF DIMENSION C (LIMEXP+2) AT LEAST). C C C LIST OF MAJOR VARIABLES C ----------------------- C C ALIST - LIST OF LEFT END POINTS OF ALL SUBINTERVALS C CONSIDERED UP TO NOW C BLIST - LIST OF RIGHT END POINTS OF ALL SUBINTERVALS C CONSIDERED UP TO NOW C RLIST(I) - APPROXIMATION TO THE INTEGRAL OVER C (ALIST(I),BLIST(I)) C RLIST2 - ARRAY OF DIMENSION AT LEAST LIMEXP+2 C CONTAINING THE PART OF THE EPSILON TABLE WHICH C IS STILL NEEDED FOR FURTHER COMPUTATIONS C ELIST(I) - ERROR ESTIMATE APPLYING TO RLIST(I) C MAXERR - POINTER TO THE INTERVAL WITH LARGEST ERROR C ESTIMATE C ERRMAX - ELIST(MAXERR) C ERLAST - ERROR ON THE INTERVAL CURRENTLY SUBDIVIDED C (BEFORE THAT SUBDIVISION HAS TAKEN PLACE) C AREA - SUM OF THE INTEGRALS OVER THE SUBINTERVALS C ERRSUM - SUM OF THE ERRORS OVER THE SUBINTERVALS C ERRBND - REQUESTED ACCURACY MAX(EPSABS,EPSREL* C ABS(RESULT)) C *****1 - VARIABLE FOR THE LEFT SUBINTERVAL C *****2 - VARIABLE FOR THE RIGHT SUBINTERVAL C LAST - INDEX FOR SUBDIVISION C NRES - NUMBER OF CALLS TO THE EXTRAPOLATION ROUTINE C NUMRL2 - NUMBER OF ELEMENTS IN RLIST2. IF AN APPROPRIATE C APPROXIMATION TO THE COMPOUNDED INTEGRAL HAS C BEEN OBTAINED, IT IS PUT IN RLIST2(NUMRL2) AFTER C NUMRL2 HAS BEEN INCREASED BY ONE. C ERLARG - SUM OF THE ERRORS OVER THE INTERVALS LARGER C THAN THE SMALLEST INTERVAL CONSIDERED UP TO NOW C EXTRAP - LOGICAL VARIABLE DENOTING THAT THE ROUTINE C IS ATTEMPTING TO PERFORM EXTRAPOLATION. I.E. C BEFORE SUBDIVIDING THE SMALLEST INTERVAL WE C TRY TO DECREASE THE VALUE OF ERLARG. C NOEXT - LOGICAL VARIABLE DENOTING THAT EXTRAPOLATION IS C NO LONGER ALLOWED (TRUE-VALUE) C C MACHINE DEPENDENT CONSTANTS C --------------------------- C C EPMACH IS THE LARGEST RELATIVE SPACING. C UFLOW IS THE SMALLEST POSITIVE MAGNITUDE. C OFLOW IS THE LARGEST POSITIVE MAGNITUDE. C C***FIRST EXECUTABLE STATEMENT DQAGPE EPMACH = D1MACH(4) C C TEST ON VALIDITY OF PARAMETERS C ----------------------------- C IER = 0 NEVAL = 0 LAST = 0 RESULT = 0.0D+00 ABSERR = 0.0D+00 ALIST(1) = A BLIST(1) = B RLIST(1) = 0.0D+00 ELIST(1) = 0.0D+00 IORD(1) = 0 LEVEL(1) = 0 NPTS = NPTS2-2 IF(NPTS2.LT.2.OR.LIMIT.LE.NPTS.OR.(EPSABS.LE.0.0D+00.AND. * EPSREL.LT.DMAX1(0.5D+02*EPMACH,0.5D-28))) IER = 6 IF(IER.EQ.6) GO TO 999 C C IF ANY BREAK POINTS ARE PROVIDED, SORT THEM INTO AN C ASCENDING SEQUENCE. C SIGN = 1.0D+00 IF(A.GT.B) SIGN = -1.0D+00 PTS(1) = DMIN1(A,B) IF(NPTS.EQ.0) GO TO 15 DO 10 I = 1,NPTS PTS(I+1) = POINTS(I) 10 CONTINUE 15 PTS(NPTS+2) = DMAX1(A,B) NINT = NPTS+1 A1 = PTS(1) IF(NPTS.EQ.0) GO TO 40 NINTP1 = NINT+1 DO 20 I = 1,NINT IP1 = I+1 DO 20 J = IP1,NINTP1 IF(PTS(I).LE.PTS(J)) GO TO 20 TEMP = PTS(I) PTS(I) = PTS(J) PTS(J) = TEMP 20 CONTINUE IF(PTS(1).NE.DMIN1(A,B).OR.PTS(NINTP1).NE.DMAX1(A,B)) IER = 6 IF(IER.EQ.6) GO TO 999 C C COMPUTE FIRST INTEGRAL AND ERROR APPROXIMATIONS. C ------------------------------------------------ C 40 RESABS = 0.0D+00 DO 50 I = 1,NINT B1 = PTS(I+1) CALL DQK21(F,A1,B1,AREA1,ERROR1,DEFABS,RESA,IER) IF (IER .LT. 0) RETURN ABSERR = ABSERR+ERROR1 RESULT = RESULT+AREA1 NDIN(I) = 0 IF(ERROR1.EQ.RESA.AND.ERROR1.NE.0.0D+00) NDIN(I) = 1 RESABS = RESABS+DEFABS LEVEL(I) = 0 ELIST(I) = ERROR1 ALIST(I) = A1 BLIST(I) = B1 RLIST(I) = AREA1 IORD(I) = I A1 = B1 50 CONTINUE ERRSUM = 0.0D+00 DO 55 I = 1,NINT IF(NDIN(I).EQ.1) ELIST(I) = ABSERR ERRSUM = ERRSUM+ELIST(I) 55 CONTINUE C C TEST ON ACCURACY. C LAST = NINT NEVAL = 21*NINT DRES = DABS(RESULT) ERRBND = DMAX1(EPSABS,EPSREL*DRES) IF(ABSERR.LE.0.1D+03*EPMACH*RESABS.AND.ABSERR.GT.ERRBND) IER = 2 IF(NINT.EQ.1) GO TO 80 DO 70 I = 1,NPTS JLOW = I+1 IND1 = IORD(I) DO 60 J = JLOW,NINT IND2 = IORD(J) IF(ELIST(IND1).GT.ELIST(IND2)) GO TO 60 IND1 = IND2 K = J 60 CONTINUE IF(IND1.EQ.IORD(I)) GO TO 70 IORD(K) = IORD(I) IORD(I) = IND1 70 CONTINUE IF(LIMIT.LT.NPTS2) IER = 1 80 IF(IER.NE.0.OR.ABSERR.LE.ERRBND) GO TO 210 C C INITIALIZATION C -------------- C RLIST2(1) = RESULT MAXERR = IORD(1) ERRMAX = ELIST(MAXERR) AREA = RESULT NRMAX = 1 NRES = 0 NUMRL2 = 1 KTMIN = 0 EXTRAP = .FALSE. NOEXT = .FALSE. ERLARG = ERRSUM ERTEST = ERRBND LEVMAX = 1 IROFF1 = 0 IROFF2 = 0 IROFF3 = 0 IERRO = 0 UFLOW = D1MACH(1) OFLOW = D1MACH(2) ABSERR = OFLOW KSGN = -1 IF(DRES.GE.(0.1D+01-0.5D+02*EPMACH)*RESABS) KSGN = 1 C C MAIN DO-LOOP C ------------ C DO 160 LAST = NPTS2,LIMIT C C BISECT THE SUBINTERVAL WITH THE NRMAX-TH LARGEST ERROR C ESTIMATE. C LEVCUR = LEVEL(MAXERR)+1 A1 = ALIST(MAXERR) B1 = 0.5D+00*(ALIST(MAXERR)+BLIST(MAXERR)) A2 = B1 B2 = BLIST(MAXERR) ERLAST = ERRMAX CALL DQK21(F,A1,B1,AREA1,ERROR1,RESA,DEFAB1,IER) IF (IER .LT. 0) RETURN CALL DQK21(F,A2,B2,AREA2,ERROR2,RESA,DEFAB2,IER) IF (IER .LT. 0) RETURN C C IMPROVE PREVIOUS APPROXIMATIONS TO INTEGRAL C AND ERROR AND TEST FOR ACCURACY. C NEVAL = NEVAL+42 AREA12 = AREA1+AREA2 ERRO12 = ERROR1+ERROR2 ERRSUM = ERRSUM+ERRO12-ERRMAX AREA = AREA+AREA12-RLIST(MAXERR) IF(DEFAB1.EQ.ERROR1.OR.DEFAB2.EQ.ERROR2) GO TO 95 IF(DABS(RLIST(MAXERR)-AREA12).GT.0.1D-04*DABS(AREA12) * .OR.ERRO12.LT.0.99D+00*ERRMAX) GO TO 90 IF(EXTRAP) IROFF2 = IROFF2+1 IF(.NOT.EXTRAP) IROFF1 = IROFF1+1 90 IF(LAST.GT.10.AND.ERRO12.GT.ERRMAX) IROFF3 = IROFF3+1 95 LEVEL(MAXERR) = LEVCUR LEVEL(LAST) = LEVCUR RLIST(MAXERR) = AREA1 RLIST(LAST) = AREA2 ERRBND = DMAX1(EPSABS,EPSREL*DABS(AREA)) C C TEST FOR ROUNDOFF ERROR AND EVENTUALLY SET ERROR FLAG. C IF(IROFF1+IROFF2.GE.10.OR.IROFF3.GE.20) IER = 2 IF(IROFF2.GE.5) IERRO = 3 C C SET ERROR FLAG IN THE CASE THAT THE NUMBER OF C SUBINTERVALS EQUALS LIMIT. C IF(LAST.EQ.LIMIT) IER = 1 C C SET ERROR FLAG IN THE CASE OF BAD INTEGRAND BEHAVIOUR C AT A POINT OF THE INTEGRATION RANGE C IF(DMAX1(DABS(A1),DABS(B2)).LE.(0.1D+01+0.1D+03*EPMACH)* * (DABS(A2)+0.1D+04*UFLOW)) IER = 4 C C APPEND THE NEWLY-CREATED INTERVALS TO THE LIST. C IF(ERROR2.GT.ERROR1) GO TO 100 ALIST(LAST) = A2 BLIST(MAXERR) = B1 BLIST(LAST) = B2 ELIST(MAXERR) = ERROR1 ELIST(LAST) = ERROR2 GO TO 110 100 ALIST(MAXERR) = A2 ALIST(LAST) = A1 BLIST(LAST) = B1 RLIST(MAXERR) = AREA2 RLIST(LAST) = AREA1 ELIST(MAXERR) = ERROR2 ELIST(LAST) = ERROR1 C C CALL SUBROUTINE DQPSRT TO MAINTAIN THE DESCENDING ORDERING C IN THE LIST OF ERROR ESTIMATES AND SELECT THE SUBINTERVAL C WITH NRMAX-TH LARGEST ERROR ESTIMATE (TO BE BISECTED NEXT). C 110 CALL DQPSRT(LIMIT,LAST,MAXERR,ERRMAX,ELIST,IORD,NRMAX) C ***JUMP OUT OF DO-LOOP IF(ERRSUM.LE.ERRBND) GO TO 190 C ***JUMP OUT OF DO-LOOP IF(IER.NE.0) GO TO 170 IF(NOEXT) GO TO 160 ERLARG = ERLARG-ERLAST IF(LEVCUR+1.LE.LEVMAX) ERLARG = ERLARG+ERRO12 IF(EXTRAP) GO TO 120 C C TEST WHETHER THE INTERVAL TO BE BISECTED NEXT IS THE C SMALLEST INTERVAL. C IF(LEVEL(MAXERR)+1.LE.LEVMAX) GO TO 160 EXTRAP = .TRUE. NRMAX = 2 120 IF(IERRO.EQ.3.OR.ERLARG.LE.ERTEST) GO TO 140 C C THE SMALLEST INTERVAL HAS THE LARGEST ERROR. C BEFORE BISECTING DECREASE THE SUM OF THE ERRORS OVER C THE LARGER INTERVALS (ERLARG) AND PERFORM EXTRAPOLATION. C ID = NRMAX JUPBND = LAST IF(LAST.GT.(2+LIMIT/2)) JUPBND = LIMIT+3-LAST DO 130 K = ID,JUPBND MAXERR = IORD(NRMAX) ERRMAX = ELIST(MAXERR) C ***JUMP OUT OF DO-LOOP IF(LEVEL(MAXERR)+1.LE.LEVMAX) GO TO 160 NRMAX = NRMAX+1 130 CONTINUE C C PERFORM EXTRAPOLATION. C 140 NUMRL2 = NUMRL2+1 RLIST2(NUMRL2) = AREA IF(NUMRL2.LE.2) GO TO 155 CALL DQELG(NUMRL2,RLIST2,RESEPS,ABSEPS,RES3LA,NRES) KTMIN = KTMIN+1 IF(KTMIN.GT.5.AND.ABSERR.LT.0.1D-02*ERRSUM) IER = 5 IF(ABSEPS.GE.ABSERR) GO TO 150 KTMIN = 0 ABSERR = ABSEPS RESULT = RESEPS CORREC = ERLARG ERTEST = DMAX1(EPSABS,EPSREL*DABS(RESEPS)) C ***JUMP OUT OF DO-LOOP IF(ABSERR.LT.ERTEST) GO TO 170 C C PREPARE BISECTION OF THE SMALLEST INTERVAL. C 150 IF(NUMRL2.EQ.1) NOEXT = .TRUE. IF(IER.GE.5) GO TO 170 155 MAXERR = IORD(1) ERRMAX = ELIST(MAXERR) NRMAX = 1 EXTRAP = .FALSE. LEVMAX = LEVMAX+1 ERLARG = ERRSUM 160 CONTINUE C C SET THE FINAL RESULT. C --------------------- C C 170 IF(ABSERR.EQ.OFLOW) GO TO 190 IF((IER+IERRO).EQ.0) GO TO 180 IF(IERRO.EQ.3) ABSERR = ABSERR+CORREC IF(IER.EQ.0) IER = 3 IF(RESULT.NE.0.0D+00.AND.AREA.NE.0.0D+00)GO TO 175 IF(ABSERR.GT.ERRSUM)GO TO 190 IF(AREA.EQ.0.0D+00) GO TO 210 GO TO 180 175 IF(ABSERR/DABS(RESULT).GT.ERRSUM/DABS(AREA))GO TO 190 C C TEST ON DIVERGENCE. C 180 IF(KSGN.EQ.(-1).AND.DMAX1(DABS(RESULT),DABS(AREA)).LE. * RESABS*0.1D-01) GO TO 210 IF(0.1D-01.GT.(RESULT/AREA).OR.(RESULT/AREA).GT.0.1D+03.OR. * ERRSUM.GT.DABS(AREA)) IER = 6 GO TO 210 C C COMPUTE GLOBAL INTEGRAL SUM. C 190 RESULT = 0.0D+00 DO 200 K = 1,LAST RESULT = RESULT+RLIST(K) 200 CONTINUE ABSERR = ERRSUM 210 IF(IER.GT.2) IER = IER-1 RESULT = RESULT*SIGN 999 RETURN END octave-1.1.0/libcruft/quadpack/dqelg.f100666 415 17 13576 5503440307 16041 0ustar jweusers SUBROUTINE DQELG(N,EPSTAB,RESULT,ABSERR,RES3LA,NRES) C***BEGIN PROLOGUE DQELG C***REFER TO DQAGIE,DQAGOE,DQAGPE,DQAGSE C***ROUTINES CALLED D1MACH C***REVISION DATE 830518 (YYMMDD) C***KEYWORDS EPSILON ALGORITHM, CONVERGENCE ACCELERATION, C EXTRAPOLATION C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH & PROGR. DIV. - K.U.LEUVEN C***PURPOSE THE ROUTINE DETERMINES THE LIMIT OF A GIVEN SEQUENCE OF C APPROXIMATIONS, BY MEANS OF THE EPSILON ALGORITHM OF C P.WYNN. AN ESTIMATE OF THE ABSOLUTE ERROR IS ALSO GIVEN. C THE CONDENSED EPSILON TABLE IS COMPUTED. ONLY THOSE C ELEMENTS NEEDED FOR THE COMPUTATION OF THE NEXT DIAGONAL C ARE PRESERVED. C***DESCRIPTION C C EPSILON ALGORITHM C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS C N - INTEGER C EPSTAB(N) CONTAINS THE NEW ELEMENT IN THE C FIRST COLUMN OF THE EPSILON TABLE. C C EPSTAB - DOUBLE PRECISION C VECTOR OF DIMENSION 52 CONTAINING THE ELEMENTS C OF THE TWO LOWER DIAGONALS OF THE TRIANGULAR C EPSILON TABLE. THE ELEMENTS ARE NUMBERED C STARTING AT THE RIGHT-HAND CORNER OF THE C TRIANGLE. C C RESULT - DOUBLE PRECISION C RESULTING APPROXIMATION TO THE INTEGRAL C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE ABSOLUTE ERROR COMPUTED FROM C RESULT AND THE 3 PREVIOUS RESULTS C C RES3LA - DOUBLE PRECISION C VECTOR OF DIMENSION 3 CONTAINING THE LAST 3 C RESULTS C C NRES - INTEGER C NUMBER OF CALLS TO THE ROUTINE C (SHOULD BE ZERO AT FIRST CALL) C C***END PROLOGUE DQELG C DOUBLE PRECISION ABSERR,DABS,DELTA1,DELTA2,DELTA3,DMAX1,D1MACH, * EPMACH,EPSINF,EPSTAB,ERROR,ERR1,ERR2,ERR3,E0,E1,E1ABS,E2,E3, * OFLOW,RES,RESULT,RES3LA,SS,TOL1,TOL2,TOL3 INTEGER I,IB,IB2,IE,INDX,K1,K2,K3,LIMEXP,N,NEWELM,NRES,NUM DIMENSION EPSTAB(52),RES3LA(3) C C LIST OF MAJOR VARIABLES C ----------------------- C C E0 - THE 4 ELEMENTS ON WHICH THE COMPUTATION OF A NEW C E1 ELEMENT IN THE EPSILON TABLE IS BASED C E2 C E3 E0 C E3 E1 NEW C E2 C NEWELM - NUMBER OF ELEMENTS TO BE COMPUTED IN THE NEW C DIAGONAL C ERROR - ERROR = ABS(E1-E0)+ABS(E2-E1)+ABS(NEW-E2) C RESULT - THE ELEMENT IN THE NEW DIAGONAL WITH LEAST VALUE C OF ERROR C C MACHINE DEPENDENT CONSTANTS C --------------------------- C C EPMACH IS THE LARGEST RELATIVE SPACING. C OFLOW IS THE LARGEST POSITIVE MAGNITUDE. C LIMEXP IS THE MAXIMUM NUMBER OF ELEMENTS THE EPSILON C TABLE CAN CONTAIN. IF THIS NUMBER IS REACHED, THE UPPER C DIAGONAL OF THE EPSILON TABLE IS DELETED. C C***FIRST EXECUTABLE STATEMENT DQELG EPMACH = D1MACH(4) OFLOW = D1MACH(2) NRES = NRES+1 ABSERR = OFLOW RESULT = EPSTAB(N) IF(N.LT.3) GO TO 100 LIMEXP = 50 EPSTAB(N+2) = EPSTAB(N) NEWELM = (N-1)/2 EPSTAB(N) = OFLOW NUM = N K1 = N DO 40 I = 1,NEWELM K2 = K1-1 K3 = K1-2 RES = EPSTAB(K1+2) E0 = EPSTAB(K3) E1 = EPSTAB(K2) E2 = RES E1ABS = DABS(E1) DELTA2 = E2-E1 ERR2 = DABS(DELTA2) TOL2 = DMAX1(DABS(E2),E1ABS)*EPMACH DELTA3 = E1-E0 ERR3 = DABS(DELTA3) TOL3 = DMAX1(E1ABS,DABS(E0))*EPMACH IF(ERR2.GT.TOL2.OR.ERR3.GT.TOL3) GO TO 10 C C IF E0, E1 AND E2 ARE EQUAL TO WITHIN MACHINE C ACCURACY, CONVERGENCE IS ASSUMED. C RESULT = E2 C ABSERR = ABS(E1-E0)+ABS(E2-E1) C RESULT = RES ABSERR = ERR2+ERR3 C ***JUMP OUT OF DO-LOOP GO TO 100 10 E3 = EPSTAB(K1) EPSTAB(K1) = E1 DELTA1 = E1-E3 ERR1 = DABS(DELTA1) TOL1 = DMAX1(E1ABS,DABS(E3))*EPMACH C C IF TWO ELEMENTS ARE VERY CLOSE TO EACH OTHER, OMIT C A PART OF THE TABLE BY ADJUSTING THE VALUE OF N C IF(ERR1.LE.TOL1.OR.ERR2.LE.TOL2.OR.ERR3.LE.TOL3) GO TO 20 SS = 0.1D+01/DELTA1+0.1D+01/DELTA2-0.1D+01/DELTA3 EPSINF = DABS(SS*E1) C C TEST TO DETECT IRREGULAR BEHAVIOUR IN THE TABLE, AND C EVENTUALLY OMIT A PART OF THE TABLE ADJUSTING THE VALUE C OF N. C IF(EPSINF.GT.0.1D-03) GO TO 30 20 N = I+I-1 C ***JUMP OUT OF DO-LOOP GO TO 50 C C COMPUTE A NEW ELEMENT AND EVENTUALLY ADJUST C THE VALUE OF RESULT. C 30 RES = E1+0.1D+01/SS EPSTAB(K1) = RES K1 = K1-2 ERROR = ERR2+DABS(RES-E2)+ERR3 IF(ERROR.GT.ABSERR) GO TO 40 ABSERR = ERROR RESULT = RES 40 CONTINUE C C SHIFT THE TABLE. C 50 IF(N.EQ.LIMEXP) N = 2*(LIMEXP/2)-1 IB = 1 IF((NUM/2)*2.EQ.NUM) IB = 2 IE = NEWELM+1 DO 60 I=1,IE IB2 = IB+2 EPSTAB(IB) = EPSTAB(IB2) IB = IB2 60 CONTINUE IF(NUM.EQ.N) GO TO 80 INDX = NUM-N+1 DO 70 I = 1,N EPSTAB(I)= EPSTAB(INDX) INDX = INDX+1 70 CONTINUE 80 IF(NRES.GE.4) GO TO 90 RES3LA(NRES) = RESULT ABSERR = OFLOW GO TO 100 C C COMPUTE ERROR ESTIMATE C 90 ABSERR = DABS(RESULT-RES3LA(3))+DABS(RESULT-RES3LA(2)) * +DABS(RESULT-RES3LA(1)) RES3LA(1) = RES3LA(2) RES3LA(2) = RES3LA(3) RES3LA(3) = RESULT 100 ABSERR = DMAX1(ABSERR,0.5D+01*EPMACH*DABS(RESULT)) RETURN END octave-1.1.0/libcruft/quadpack/dqk15i.f100666 415 17 20003 5503442461 16025 0ustar jweusers SUBROUTINE DQK15I(F,BOUN,INF,A,B,RESULT,ABSERR,RESABS,RESASC, 1 IERR) C***BEGIN PROLOGUE DQK15I C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A3A2,H2A4A2 C***KEYWORDS 15-POINT TRANSFORMED GAUSS-KRONROD RULES C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C***PURPOSE THE ORIGINAL (INFINITE INTEGRATION RANGE IS MAPPED C ONTO THE INTERVAL (0,1) AND (A,B) IS A PART OF (0,1). C IT IS THE PURPOSE TO COMPUTE C I = INTEGRAL OF TRANSFORMED INTEGRAND OVER (A,B), C J = INTEGRAL OF ABS(TRANSFORMED INTEGRAND) OVER (A,B). C***DESCRIPTION C C INTEGRATION RULE C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS C ON ENTRY C F - DOUBLE PRECISION C FUCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE CALLING PROGRAM. C C BOUN - DOUBLE PRECISION C FINITE BOUND OF ORIGINAL INTEGRATION C RANGE (SET TO ZERO IF INF = +2) C C INF - INTEGER C IF INF = -1, THE ORIGINAL INTERVAL IS C (-INFINITY,BOUND), C IF INF = +1, THE ORIGINAL INTERVAL IS C (BOUND,+INFINITY), C IF INF = +2, THE ORIGINAL INTERVAL IS C (-INFINITY,+INFINITY) AND C THE INTEGRAL IS COMPUTED AS THE SUM OF TWO C INTEGRALS, ONE OVER (-INFINITY,0) AND ONE OVER C (0,+INFINITY). C C A - DOUBLE PRECISION C LOWER LIMIT FOR INTEGRATION OVER SUBRANGE C OF (0,1) C C B - DOUBLE PRECISION C UPPER LIMIT FOR INTEGRATION OVER SUBRANGE C OF (0,1) C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL I C RESULT IS COMPUTED BY APPLYING THE 15-POINT C KRONROD RULE(RESK) OBTAINED BY OPTIMAL ADDITION C OF ABSCISSAE TO THE 7-POINT GAUSS RULE(RESG). C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD EQUAL OR EXCEED ABS(I-RESULT) C C RESABS - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL J C C RESASC - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL OF C ABS((TRANSFORMED INTEGRAND)-I/(B-A)) OVER (A,B) C C***REFERENCES (NONE) C***ROUTINES CALLED D1MACH C***END PROLOGUE DQK15I C DOUBLE PRECISION A,ABSC,ABSC1,ABSC2,ABSERR,B,BOUN,CENTR,DABS,DINF, * DMAX1,DMIN1,D1MACH,EPMACH,F,FC,FSUM,FVAL1,FVAL2,FV1,FV2,HLGTH, * RESABS,RESASC,RESG,RESK,RESKH,RESULT,TABSC1,TABSC2,UFLOW,WG,WGK, * XGK,FVALT INTEGER INF,J EXTERNAL F C DIMENSION FV1(7),FV2(7),XGK(8),WGK(8),WG(8) C C THE ABSCISSAE AND WEIGHTS ARE SUPPLIED FOR THE INTERVAL C (-1,1). BECAUSE OF SYMMETRY ONLY THE POSITIVE ABSCISSAE AND C THEIR CORRESPONDING WEIGHTS ARE GIVEN. C C XGK - ABSCISSAE OF THE 15-POINT KRONROD RULE C XGK(2), XGK(4), ... ABSCISSAE OF THE 7-POINT C GAUSS RULE C XGK(1), XGK(3), ... ABSCISSAE WHICH ARE OPTIMALLY C ADDED TO THE 7-POINT GAUSS RULE C C WGK - WEIGHTS OF THE 15-POINT KRONROD RULE C C WG - WEIGHTS OF THE 7-POINT GAUSS RULE, CORRESPONDING C TO THE ABSCISSAE XGK(2), XGK(4), ... C WG(1), WG(3), ... ARE SET TO ZERO. C DATA WG(1) / 0.0D0 / DATA WG(2) / 0.1294849661 6886969327 0611432679 082D0 / DATA WG(3) / 0.0D0 / DATA WG(4) / 0.2797053914 8927666790 1467771423 780D0 / DATA WG(5) / 0.0D0 / DATA WG(6) / 0.3818300505 0511894495 0369775488 975D0 / DATA WG(7) / 0.0D0 / DATA WG(8) / 0.4179591836 7346938775 5102040816 327D0 / C DATA XGK(1) / 0.9914553711 2081263920 6854697526 329D0 / DATA XGK(2) / 0.9491079123 4275852452 6189684047 851D0 / DATA XGK(3) / 0.8648644233 5976907278 9712788640 926D0 / DATA XGK(4) / 0.7415311855 9939443986 3864773280 788D0 / DATA XGK(5) / 0.5860872354 6769113029 4144838258 730D0 / DATA XGK(6) / 0.4058451513 7739716690 6606412076 961D0 / DATA XGK(7) / 0.2077849550 0789846760 0689403773 245D0 / DATA XGK(8) / 0.0000000000 0000000000 0000000000 000D0 / C DATA WGK(1) / 0.0229353220 1052922496 3732008058 970D0 / DATA WGK(2) / 0.0630920926 2997855329 0700663189 204D0 / DATA WGK(3) / 0.1047900103 2225018383 9876322541 518D0 / DATA WGK(4) / 0.1406532597 1552591874 5189590510 238D0 / DATA WGK(5) / 0.1690047266 3926790282 6583426598 550D0 / DATA WGK(6) / 0.1903505780 6478540991 3256402421 014D0 / DATA WGK(7) / 0.2044329400 7529889241 4161999234 649D0 / DATA WGK(8) / 0.2094821410 8472782801 2999174891 714D0 / C C C LIST OF MAJOR VARIABLES C ----------------------- C C CENTR - MID POINT OF THE INTERVAL C HLGTH - HALF-LENGTH OF THE INTERVAL C ABSC* - ABSCISSA C TABSC* - TRANSFORMED ABSCISSA C FVAL* - FUNCTION VALUE C RESG - RESULT OF THE 7-POINT GAUSS FORMULA C RESK - RESULT OF THE 15-POINT KRONROD FORMULA C RESKH - APPROXIMATION TO THE MEAN VALUE OF THE TRANSFORMED C INTEGRAND OVER (A,B), I.E. TO I/(B-A) C C MACHINE DEPENDENT CONSTANTS C --------------------------- C C EPMACH IS THE LARGEST RELATIVE SPACING. C UFLOW IS THE SMALLEST POSITIVE MAGNITUDE. C C***FIRST EXECUTABLE STATEMENT DQK15I EPMACH = D1MACH(4) UFLOW = D1MACH(1) DINF = MIN0(1,INF) C CENTR = 0.5D+00*(A+B) HLGTH = 0.5D+00*(B-A) TABSC1 = BOUN+DINF*(0.1D+01-CENTR)/CENTR IERR = 0 FVAL1 = F(TABSC1,IERR) IF (IERR .LT. 0) RETURN IF(INF.EQ.2) THEN FVALT = F(-TABSC1,IERR) IF (IERR .LT. 0) RETURN FVAL1 = FVAL1+FVALT ENDIF FC = (FVAL1/CENTR)/CENTR C C COMPUTE THE 15-POINT KRONROD APPROXIMATION TO C THE INTEGRAL, AND ESTIMATE THE ERROR. C RESG = WG(8)*FC RESK = WGK(8)*FC RESABS = DABS(RESK) DO 10 J=1,7 ABSC = HLGTH*XGK(J) ABSC1 = CENTR-ABSC ABSC2 = CENTR+ABSC TABSC1 = BOUN+DINF*(0.1D+01-ABSC1)/ABSC1 TABSC2 = BOUN+DINF*(0.1D+01-ABSC2)/ABSC2 FVAL1 = F(TABSC1,IERR) IF (IERR .LT. 0) RETURN FVAL2 = F(TABSC2,IERR) IF (IERR .LT. 0) RETURN IF(INF.EQ.2) THEN FVALT = F(-TABSC1,IERR) IF (IERR .LT. 0) RETURN FVAL1 = FVAL1+FVALT ENDIF IF(INF.EQ.2) THEN FVALT = F(-TABSC2,IERR) IF (IERR .LT. 0) RETURN FVAL2 = FVAL2+FVALT ENDIF FVAL1 = (FVAL1/ABSC1)/ABSC1 FVAL2 = (FVAL2/ABSC2)/ABSC2 FV1(J) = FVAL1 FV2(J) = FVAL2 FSUM = FVAL1+FVAL2 RESG = RESG+WG(J)*FSUM RESK = RESK+WGK(J)*FSUM RESABS = RESABS+WGK(J)*(DABS(FVAL1)+DABS(FVAL2)) 10 CONTINUE RESKH = RESK*0.5D+00 RESASC = WGK(8)*DABS(FC-RESKH) DO 20 J=1,7 RESASC = RESASC+WGK(J)*(DABS(FV1(J)-RESKH)+DABS(FV2(J)-RESKH)) 20 CONTINUE RESULT = RESK*HLGTH RESASC = RESASC*HLGTH RESABS = RESABS*HLGTH ABSERR = DABS((RESK-RESG)*HLGTH) IF(RESASC.NE.0.0D+00.AND.ABSERR.NE.0.D0) ABSERR = RESASC* * DMIN1(0.1D+01,(0.2D+03*ABSERR/RESASC)**1.5D+00) IF(RESABS.GT.UFLOW/(0.5D+02*EPMACH)) ABSERR = DMAX1 * ((EPMACH*0.5D+02)*RESABS,ABSERR) RETURN END octave-1.1.0/libcruft/quadpack/dqk21.f100666 415 17 16176 5503442023 15663 0ustar jweusers SUBROUTINE DQK21(F,A,B,RESULT,ABSERR,RESABS,RESASC,IERR) C***BEGIN PROLOGUE DQK21 C***DATE WRITTEN 800101 (YYMMDD) C***REVISION DATE 830518 (YYMMDD) C***CATEGORY NO. H2A1A2 C***KEYWORDS 21-POINT GAUSS-KRONROD RULES C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C***PURPOSE TO COMPUTE I = INTEGRAL OF F OVER (A,B), WITH ERROR C ESTIMATE C J = INTEGRAL OF ABS(F) OVER (A,B) C***DESCRIPTION C C INTEGRATION RULES C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS C ON ENTRY C F - DOUBLE PRECISION C FUNCTION SUBPROGRAM DEFINING THE INTEGRAND C FUNCTION F(X). THE ACTUAL NAME FOR F NEEDS TO BE C DECLARED E X T E R N A L IN THE DRIVER PROGRAM. C C A - DOUBLE PRECISION C LOWER LIMIT OF INTEGRATION C C B - DOUBLE PRECISION C UPPER LIMIT OF INTEGRATION C C ON RETURN C RESULT - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL I C RESULT IS COMPUTED BY APPLYING THE 21-POINT C KRONROD RULE (RESK) OBTAINED BY OPTIMAL ADDITION C OF ABSCISSAE TO THE 10-POINT GAUSS RULE (RESG). C C ABSERR - DOUBLE PRECISION C ESTIMATE OF THE MODULUS OF THE ABSOLUTE ERROR, C WHICH SHOULD NOT EXCEED ABS(I-RESULT) C C RESABS - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL J C C RESASC - DOUBLE PRECISION C APPROXIMATION TO THE INTEGRAL OF ABS(F-I/(B-A)) C OVER (A,B) C C***REFERENCES (NONE) C***ROUTINES CALLED D1MACH C***END PROLOGUE DQK21 C DOUBLE PRECISION A,ABSC,ABSERR,B,CENTR,DABS,DHLGTH,DMAX1,DMIN1, * D1MACH,EPMACH,F,FC,FSUM,FVAL1,FVAL2,FV1,FV2,HLGTH,RESABS,RESASC, * RESG,RESK,RESKH,RESULT,UFLOW,WG,WGK,XGK INTEGER J,JTW,JTWM1 EXTERNAL F C DIMENSION FV1(10),FV2(10),WG(5),WGK(11),XGK(11) C C THE ABSCISSAE AND WEIGHTS ARE GIVEN FOR THE INTERVAL (-1,1). C BECAUSE OF SYMMETRY ONLY THE POSITIVE ABSCISSAE AND THEIR C CORRESPONDING WEIGHTS ARE GIVEN. C C XGK - ABSCISSAE OF THE 21-POINT KRONROD RULE C XGK(2), XGK(4), ... ABSCISSAE OF THE 10-POINT C GAUSS RULE C XGK(1), XGK(3), ... ABSCISSAE WHICH ARE OPTIMALLY C ADDED TO THE 10-POINT GAUSS RULE C C WGK - WEIGHTS OF THE 21-POINT KRONROD RULE C C WG - WEIGHTS OF THE 10-POINT GAUSS RULE C C C GAUSS QUADRATURE WEIGHTS AND KRONRON QUADRATURE ABSCISSAE AND WEIGHTS C AS EVALUATED WITH 80 DECIMAL DIGIT ARITHMETIC BY L. W. FULLERTON, C BELL LABS, NOV. 1981. C DATA WG ( 1) / 0.0666713443 0868813759 3568809893 332 D0 / DATA WG ( 2) / 0.1494513491 5058059314 5776339657 697 D0 / DATA WG ( 3) / 0.2190863625 1598204399 5534934228 163 D0 / DATA WG ( 4) / 0.2692667193 0999635509 1226921569 469 D0 / DATA WG ( 5) / 0.2955242247 1475287017 3892994651 338 D0 / C DATA XGK ( 1) / 0.9956571630 2580808073 5527280689 003 D0 / DATA XGK ( 2) / 0.9739065285 1717172007 7964012084 452 D0 / DATA XGK ( 3) / 0.9301574913 5570822600 1207180059 508 D0 / DATA XGK ( 4) / 0.8650633666 8898451073 2096688423 493 D0 / DATA XGK ( 5) / 0.7808177265 8641689706 3717578345 042 D0 / DATA XGK ( 6) / 0.6794095682 9902440623 4327365114 874 D0 / DATA XGK ( 7) / 0.5627571346 6860468333 9000099272 694 D0 / DATA XGK ( 8) / 0.4333953941 2924719079 9265943165 784 D0 / DATA XGK ( 9) / 0.2943928627 0146019813 1126603103 866 D0 / DATA XGK ( 10) / 0.1488743389 8163121088 4826001129 720 D0 / DATA XGK ( 11) / 0.0000000000 0000000000 0000000000 000 D0 / C DATA WGK ( 1) / 0.0116946388 6737187427 8064396062 192 D0 / DATA WGK ( 2) / 0.0325581623 0796472747 8818972459 390 D0 / DATA WGK ( 3) / 0.0547558965 7435199603 1381300244 580 D0 / DATA WGK ( 4) / 0.0750396748 1091995276 7043140916 190 D0 / DATA WGK ( 5) / 0.0931254545 8369760553 5065465083 366 D0 / DATA WGK ( 6) / 0.1093871588 0229764189 9210590325 805 D0 / DATA WGK ( 7) / 0.1234919762 6206585107 7958109831 074 D0 / DATA WGK ( 8) / 0.1347092173 1147332592 8054001771 707 D0 / DATA WGK ( 9) / 0.1427759385 7706008079 7094273138 717 D0 / DATA WGK ( 10) / 0.1477391049 0133849137 4841515972 068 D0 / DATA WGK ( 11) / 0.1494455540 0291690566 4936468389 821 D0 / C C C LIST OF MAJOR VARIABLES C ----------------------- C C CENTR - MID POINT OF THE INTERVAL C HLGTH - HALF-LENGTH OF THE INTERVAL C ABSC - ABSCISSA C FVAL* - FUNCTION VALUE C RESG - RESULT OF THE 10-POINT GAUSS FORMULA C RESK - RESULT OF THE 21-POINT KRONROD FORMULA C RESKH - APPROXIMATION TO THE MEAN VALUE OF F OVER (A,B), C I.E. TO I/(B-A) C C C MACHINE DEPENDENT CONSTANTS C --------------------------- C C EPMACH IS THE LARGEST RELATIVE SPACING. C UFLOW IS THE SMALLEST POSITIVE MAGNITUDE. C C***FIRST EXECUTABLE STATEMENT DQK21 EPMACH = D1MACH(4) UFLOW = D1MACH(1) C CENTR = 0.5D+00*(A+B) HLGTH = 0.5D+00*(B-A) DHLGTH = DABS(HLGTH) C C COMPUTE THE 21-POINT KRONROD APPROXIMATION TO C THE INTEGRAL, AND ESTIMATE THE ABSOLUTE ERROR. C RESG = 0.0D+00 IERR = 0 FC = F(CENTR,IERR) IF (IERR .LT. 0) RETURN RESK = WGK(11)*FC RESABS = DABS(RESK) DO 10 J=1,5 JTW = 2*J ABSC = HLGTH*XGK(JTW) FVAL1 = F(CENTR-ABSC,IERR) IF (IERR .LT. 0) RETURN FVAL2 = F(CENTR+ABSC,IERR) IF (IERR .LT. 0) RETURN FV1(JTW) = FVAL1 FV2(JTW) = FVAL2 FSUM = FVAL1+FVAL2 RESG = RESG+WG(J)*FSUM RESK = RESK+WGK(JTW)*FSUM RESABS = RESABS+WGK(JTW)*(DABS(FVAL1)+DABS(FVAL2)) 10 CONTINUE DO 15 J = 1,5 JTWM1 = 2*J-1 ABSC = HLGTH*XGK(JTWM1) FVAL1 = F(CENTR-ABSC,IERR) IF (IERR .LT. 0) RETURN FVAL2 = F(CENTR+ABSC,IERR) IF (IERR .LT. 0) RETURN FV1(JTWM1) = FVAL1 FV2(JTWM1) = FVAL2 FSUM = FVAL1+FVAL2 RESK = RESK+WGK(JTWM1)*FSUM RESABS = RESABS+WGK(JTWM1)*(DABS(FVAL1)+DABS(FVAL2)) 15 CONTINUE RESKH = RESK*0.5D+00 RESASC = WGK(11)*DABS(FC-RESKH) DO 20 J=1,10 RESASC = RESASC+WGK(J)*(DABS(FV1(J)-RESKH)+DABS(FV2(J)-RESKH)) 20 CONTINUE RESULT = RESK*HLGTH RESABS = RESABS*DHLGTH RESASC = RESASC*DHLGTH ABSERR = DABS((RESK-RESG)*HLGTH) IF(RESASC.NE.0.0D+00.AND.ABSERR.NE.0.0D+00) * ABSERR = RESASC*DMIN1(0.1D+01,(0.2D+03*ABSERR/RESASC)**1.5D+00) IF(RESABS.GT.UFLOW/(0.5D+02*EPMACH)) ABSERR = DMAX1 * ((EPMACH*0.5D+02)*RESABS,ABSERR) RETURN END octave-1.1.0/libcruft/quadpack/dqpsrt.f100666 415 17 10223 5503436657 16261 0ustar jweusers SUBROUTINE DQPSRT(LIMIT,LAST,MAXERR,ERMAX,ELIST,IORD,NRMAX) C***BEGIN PROLOGUE DQPSRT C***REFER TO DQAGE,DQAGIE,DQAGPE,DQAWSE C***ROUTINES CALLED (NONE) C***REVISION DATE 810101 (YYMMDD) C***KEYWORDS SEQUENTIAL SORTING C***AUTHOR PIESSENS,ROBERT,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C DE DONCKER,ELISE,APPL. MATH. & PROGR. DIV. - K.U.LEUVEN C***PURPOSE THIS ROUTINE MAINTAINS THE DESCENDING ORDERING IN THE C LIST OF THE LOCAL ERROR ESTIMATED RESULTING FROM THE C INTERVAL SUBDIVISION PROCESS. AT EACH CALL TWO ERROR C ESTIMATES ARE INSERTED USING THE SEQUENTIAL SEARCH C METHOD, TOP-DOWN FOR THE LARGEST ERROR ESTIMATE AND C BOTTOM-UP FOR THE SMALLEST ERROR ESTIMATE. C***DESCRIPTION C C ORDERING ROUTINE C STANDARD FORTRAN SUBROUTINE C DOUBLE PRECISION VERSION C C PARAMETERS (MEANING AT OUTPUT) C LIMIT - INTEGER C MAXIMUM NUMBER OF ERROR ESTIMATES THE LIST C CAN CONTAIN C C LAST - INTEGER C NUMBER OF ERROR ESTIMATES CURRENTLY IN THE LIST C C MAXERR - INTEGER C MAXERR POINTS TO THE NRMAX-TH LARGEST ERROR C ESTIMATE CURRENTLY IN THE LIST C C ERMAX - DOUBLE PRECISION C NRMAX-TH LARGEST ERROR ESTIMATE C ERMAX = ELIST(MAXERR) C C ELIST - DOUBLE PRECISION C VECTOR OF DIMENSION LAST CONTAINING C THE ERROR ESTIMATES C C IORD - INTEGER C VECTOR OF DIMENSION LAST, THE FIRST K ELEMENTS C OF WHICH CONTAIN POINTERS TO THE ERROR C ESTIMATES, SUCH THAT C ELIST(IORD(1)),..., ELIST(IORD(K)) C FORM A DECREASING SEQUENCE, WITH C K = LAST IF LAST.LE.(LIMIT/2+2), AND C K = LIMIT+1-LAST OTHERWISE C C NRMAX - INTEGER C MAXERR = IORD(NRMAX) C C***END PROLOGUE DQPSRT C DOUBLE PRECISION ELIST,ERMAX,ERRMAX,ERRMIN INTEGER I,IBEG,IDO,IORD,ISUCC,J,JBND,JUPBN,K,LAST,LIMIT,MAXERR, * NRMAX DIMENSION ELIST(LAST),IORD(LAST) C C CHECK WHETHER THE LIST CONTAINS MORE THAN C TWO ERROR ESTIMATES. C C***FIRST EXECUTABLE STATEMENT DQPSRT IF(LAST.GT.2) GO TO 10 IORD(1) = 1 IORD(2) = 2 GO TO 90 C C THIS PART OF THE ROUTINE IS ONLY EXECUTED IF, DUE TO A C DIFFICULT INTEGRAND, SUBDIVISION INCREASED THE ERROR C ESTIMATE. IN THE NORMAL CASE THE INSERT PROCEDURE SHOULD C START AFTER THE NRMAX-TH LARGEST ERROR ESTIMATE. C 10 ERRMAX = ELIST(MAXERR) IF(NRMAX.EQ.1) GO TO 30 IDO = NRMAX-1 DO 20 I = 1,IDO ISUCC = IORD(NRMAX-1) C ***JUMP OUT OF DO-LOOP IF(ERRMAX.LE.ELIST(ISUCC)) GO TO 30 IORD(NRMAX) = ISUCC NRMAX = NRMAX-1 20 CONTINUE C C COMPUTE THE NUMBER OF ELEMENTS IN THE LIST TO BE MAINTAINED C IN DESCENDING ORDER. THIS NUMBER DEPENDS ON THE NUMBER OF C SUBDIVISIONS STILL ALLOWED. C 30 JUPBN = LAST IF(LAST.GT.(LIMIT/2+2)) JUPBN = LIMIT+3-LAST ERRMIN = ELIST(LAST) C C INSERT ERRMAX BY TRAVERSING THE LIST TOP-DOWN, C STARTING COMPARISON FROM THE ELEMENT ELIST(IORD(NRMAX+1)). C JBND = JUPBN-1 IBEG = NRMAX+1 IF(IBEG.GT.JBND) GO TO 50 DO 40 I=IBEG,JBND ISUCC = IORD(I) C ***JUMP OUT OF DO-LOOP IF(ERRMAX.GE.ELIST(ISUCC)) GO TO 60 IORD(I-1) = ISUCC 40 CONTINUE 50 IORD(JBND) = MAXERR IORD(JUPBN) = LAST GO TO 90 C C INSERT ERRMIN BY TRAVERSING THE LIST BOTTOM-UP. C 60 IORD(I-1) = MAXERR K = JBND DO 70 J=I,JBND ISUCC = IORD(K) C ***JUMP OUT OF DO-LOOP IF(ERRMIN.LT.ELIST(ISUCC)) GO TO 80 IORD(K+1) = ISUCC K = K-1 70 CONTINUE IORD(I) = LAST GO TO 90 80 IORD(K+1) = LAST C C SET MAXERR AND ERMAX. C 90 MAXERR = IORD(NRMAX) ERMAX = ELIST(MAXERR) RETURN END octave-1.1.0/libcruft/quadpack/xerror.f100666 415 17 3202 5307574040 16233 0ustar jweusers SUBROUTINE XERROR(MESSG,NMESSG,NERR,LEVEL) C C ABSTRACT C XERROR PROCESSES A DIAGNOSTIC MESSAGE, IN A MANNER C DETERMINED BY THE VALUE OF LEVEL AND THE CURRENT VALUE C OF THE LIBRARY ERROR CONTROL FLAG, KONTRL. C (SEE SUBROUTINE XSETF FOR DETAILS.) C C DESCRIPTION OF PARAMETERS C --INPUT-- C MESSG - THE HOLLERITH MESSAGE TO BE PROCESSED, CONTAINING C NO MORE THAN 72 CHARACTERS. C NMESSG- THE ACTUAL NUMBER OF CHARACTERS IN MESSG. C NERR - THE ERROR NUMBER ASSOCIATED WITH THIS MESSAGE. C NERR MUST NOT BE ZERO. C LEVEL - ERROR CATEGORY. C =2 MEANS THIS IS AN UNCONDITIONALLY FATAL ERROR. C =1 MEANS THIS IS A RECOVERABLE ERROR. (I.E., IT IS C NON-FATAL IF XSETF HAS BEEN APPROPRIATELY CALLED.) C =0 MEANS THIS IS A WARNING MESSAGE ONLY. C =-1 MEANS THIS IS A WARNING MESSAGE WHICH IS TO BE C PRINTED AT MOST ONCE, REGARDLESS OF HOW MANY C TIMES THIS CALL IS EXECUTED. C C EXAMPLES C CALL XERROR(23HSMOOTH -- NUM WAS ZERO.,23,1,2) C CALL XERROR(43HINTEG -- LESS THAN FULL ACCURACY ACHIEVED., C 43,2,1) C CALL XERROR(65HROOTER -- ACTUAL ZERO OF F FOUND BEFORE INTERVAL C 1 FULLY COLLAPSED.,65,3,0) C CALL XERROR(39HEXP -- UNDERFLOWS BEING SET TO ZERO.,39,1,-1) C C WRITTEN BY RON JONES, WITH SLATEC COMMON MATH LIBRARY SUBCOMMITTEE C LATEST REVISION --- 7 FEB 1979 C DIMENSION MESSG(NMESSG) CALL XERRWV(MESSG,NMESSG,NERR,LEVEL,0,0,0,0,0.,0.) RETURN END octave-1.1.0/libcruft/ranlib/ 40777 415 17 0 5705521666 14137 5ustar jweusersoctave-1.1.0/libcruft/ranlib/Makefile.in100666 415 17 624 5662226322 16254 0ustar jweusers# # Makefile for octave's libcruft/ranlib directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ SPECIAL = README ranlib.chs ranlib.fdoc tstbot.for tstgmn.for \ tstmid.for EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/ranlib/advnst.f100666 415 17 4203 5404723231 15665 0ustar jweusers SUBROUTINE advnst(k) C********************************************************************** C C SUBROUTINE ADVNST(K) C ADV-a-N-ce ST-ate C C Advances the state of the current generator by 2^K values and C resets the initial seed to that value. C C This is a transcription from Pascal to Fortran of routine C Advance_State from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C K -> The generator is advanced by2^K values C INTEGER K C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. INTEGER k C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g,i,ib1,ib2 C .. C .. External Functions .. INTEGER mltmod LOGICAL qrgnin EXTERNAL mltmod,qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn,setsd C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C Abort unless random number generator initialized IF (qrgnin()) GO TO 10 WRITE (*,*) ' ADVNST called before random number generator ', + ' initialized -- abort!' CALL XSTOPX + (' ADVNST called before random number generator initialized') 10 CALL getcgn(g) C ib1 = a1 ib2 = a2 DO 20,i = 1,k ib1 = mltmod(ib1,ib1,m1) ib2 = mltmod(ib2,ib2,m2) 20 CONTINUE CALL setsd(mltmod(ib1,cg1(g),m1),mltmod(ib2,cg2(g),m2)) C C NOW, IB1 = A1**K AND IB2 = A2**K C RETURN END octave-1.1.0/libcruft/ranlib/genbet.f100666 415 17 7614 5404723213 15643 0ustar jweusers REAL FUNCTION genbet(aa,bb) C********************************************************************** C C REAL FUNCTION GENBET( A, B ) C GeNerate BETa random deviate C C C Function C C C Returns a single random deviate from the beta distribution with C parameters A and B. The density of the beta is C x^(a-1) * (1-x)^(b-1) / B(a,b) for 0 < x < 1 C C C Arguments C C C A --> First parameter of the beta distribution C REAL A C C B --> Second parameter of the beta distribution C REAL B C C C Method C C C R. C. H. Cheng C Generating Beta Variatew with Nonintegral Shape Parameters C Communications of the ACM, 21:317-322 (1978) C (Algorithms BB and BC) C C********************************************************************** C .. Parameters .. C Close to the largest number that can be exponentiated REAL expmax PARAMETER (expmax=89.0) C Close to the largest representable single precision number REAL infnty PARAMETER (infnty=1.0E38) C .. C .. Scalar Arguments .. REAL aa,bb C .. C .. Local Scalars .. REAL a,alpha,b,beta,delta,gamma,k1,k2,olda,oldb,r,s,t,u1,u2,v,w,y, + z LOGICAL qsame C .. C .. External Functions .. REAL ranf EXTERNAL ranf C .. C .. Intrinsic Functions .. INTRINSIC exp,log,max,min,sqrt C .. C .. Save statement .. SAVE olda,oldb,alpha,beta,gamma,k1,k2 C .. C .. Data statements .. DATA olda,oldb/-1,-1/ C .. C .. Executable Statements .. qsame = (olda.EQ.aa) .AND. (oldb.EQ.bb) IF (qsame) GO TO 20 IF (.NOT. (aa.LE.0.0.OR.bb.LE.0.0)) GO TO 10 WRITE (*,*) ' AA or BB <= 0 in GENBET - Abort!' WRITE (*,*) ' AA: ',aa,' BB ',bb CALL XSTOPX (' AA or BB <= 0 in GENBET - Abort!') 10 olda = aa oldb = bb 20 IF (.NOT. (min(aa,bb).GT.1.0)) GO TO 100 C Alborithm BB C C Initialize C IF (qsame) GO TO 30 a = min(aa,bb) b = max(aa,bb) alpha = a + b beta = sqrt((alpha-2.0)/ (2.0*a*b-alpha)) gamma = a + 1.0/beta 30 CONTINUE 40 u1 = ranf() C C Step 1 C u2 = ranf() v = beta*log(u1/ (1.0-u1)) IF (.NOT. (v.GT.expmax)) GO TO 50 w = infnty GO TO 60 50 w = a*exp(v) 60 z = u1**2*u2 r = gamma*v - 1.3862944 s = a + r - w C C Step 2 C IF ((s+2.609438).GE. (5.0*z)) GO TO 70 C C Step 3 C t = log(z) IF (s.GT.t) GO TO 70 C C Step 4 C IF ((r+alpha*log(alpha/ (b+w))).LT.t) GO TO 40 C C Step 5 C 70 IF (.NOT. (aa.EQ.a)) GO TO 80 genbet = w/ (b+w) GO TO 90 80 genbet = b/ (b+w) 90 GO TO 230 C Algorithm BC C C Initialize C 100 IF (qsame) GO TO 110 a = max(aa,bb) b = min(aa,bb) alpha = a + b beta = 1.0/b delta = 1.0 + a - b k1 = delta* (0.0138889+0.0416667*b)/ (a*beta-0.777778) k2 = 0.25 + (0.5+0.25/delta)*b 110 CONTINUE 120 u1 = ranf() C C Step 1 C u2 = ranf() IF (u1.GE.0.5) GO TO 130 C C Step 2 C y = u1*u2 z = u1*y IF ((0.25*u2+z-y).GE.k1) GO TO 120 GO TO 170 C C Step 3 C 130 z = u1**2*u2 IF (.NOT. (z.LE.0.25)) GO TO 160 v = beta*log(u1/ (1.0-u1)) IF (.NOT. (v.GT.expmax)) GO TO 140 w = infnty GO TO 150 140 w = a*exp(v) 150 GO TO 200 160 IF (z.GE.k2) GO TO 120 C C Step 4 C C C Step 5 C 170 v = beta*log(u1/ (1.0-u1)) IF (.NOT. (v.GT.expmax)) GO TO 180 w = infnty GO TO 190 180 w = a*exp(v) 190 IF ((alpha* (log(alpha/ (b+w))+v)-1.3862944).LT.log(z)) GO TO 120 C C Step 6 C 200 IF (.NOT. (a.EQ.aa)) GO TO 210 genbet = w/ (b+w) GO TO 220 210 genbet = b/ (b+w) 220 CONTINUE 230 RETURN END octave-1.1.0/libcruft/ranlib/genchi.f100666 415 17 2110 5404723205 15617 0ustar jweusers REAL FUNCTION genchi(df) C********************************************************************** C C REAL FUNCTION GENCHI( DF ) C Generate random value of CHIsquare variable C C C Function C C C Generates random deviate from the distribution of a chisquare C with DF degrees of freedom random variable. C C C Arguments C C C DF --> Degrees of freedom of the chisquare C (Must be positive) C REAL DF C C C Method C C C Uses relation between chisquare and gamma. C C********************************************************************** C .. Scalar Arguments .. REAL df C .. C .. External Functions .. REAL gengam EXTERNAL gengam C .. C .. Executable Statements .. IF (.NOT. (df.LE.0.0)) GO TO 10 WRITE (*,*) 'DF <= 0 in GENCHI - ABORT' WRITE (*,*) 'Value of DF: ',df CALL XSTOPX ('DF <= 0 in GENCHI - ABORT') 10 genchi = 2.0*gengam(1.0,df/2.0) RETURN END octave-1.1.0/libcruft/ranlib/genexp.f100666 415 17 2410 5175267314 15664 0ustar jweusers REAL FUNCTION genexp(av) C********************************************************************** C C REAL FUNCTION GENEXP( AV ) C C GENerate EXPonential random deviate C C C Function C C C Generates a single random deviate from an exponential C distribution with mean AV. C C C Arguments C C C AV --> The mean of the exponential distribution from which C a random deviate is to be generated. C REAL AV C C GENEXP <-- The random deviate. C REAL GENEXP C C C Method C C C Renames SEXPO from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C C Ahrens, J.H. and Dieter, U. C Computer Methods for Sampling From the C Exponential and Normal Distributions. C Comm. ACM, 15,10 (Oct. 1972), 873 - 882. C C********************************************************************** C .. Scalar Arguments .. REAL av C .. C .. External Functions .. REAL sexpo EXTERNAL sexpo C .. C .. Executable Statements .. genexp = sexpo()*av RETURN END octave-1.1.0/libcruft/ranlib/genf.f100666 415 17 3377 5614626267 15336 0ustar jweusers REAL FUNCTION genf(dfn,dfd) C********************************************************************** C C REAL FUNCTION GENF( DFN, DFD ) C GENerate random deviate from the F distribution C C C Function C C C Generates a random deviate from the F (variance ratio) C distribution with DFN degrees of freedom in the numerator C and DFD degrees of freedom in the denominator. C C C Arguments C C C DFN --> Numerator degrees of freedom C (Must be positive) C REAL DFN C DFD --> Denominator degrees of freedom C (Must be positive) C REAL DFD C C C Method C C C Directly generates ratio of chisquare variates C C********************************************************************** C .. Scalar Arguments .. REAL dfd,dfn C .. C .. Local Scalars .. REAL xden,xnum C .. C .. External Functions .. REAL genchi EXTERNAL genchi C .. C .. Executable Statements .. IF (.NOT. (dfn.LE.0.0.OR.dfd.LE.0.0)) GO TO 10 WRITE (*,*) 'Degrees of freedom nonpositive in GENF - abort!' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd CALL XSTOPX ('Degrees of freedom nonpositive in GENF - abort!') 10 xnum = genchi(dfn)/dfn C GENF = ( GENCHI( DFN ) / DFN ) / ( GENCHI( DFD ) / DFD ) xden = genchi(dfd)/dfd IF (.NOT. (xden.LE. (1.2E-38*xnum))) GO TO 20 WRITE (*,*) ' GENF - generated numbers would cause overflow' WRITE (*,*) ' Numerator ',xnum,' Denominator ',xden WRITE (*,*) ' GENF returning 1.0E38' genf = 1.0E38 GO TO 30 20 genf = xnum/xden 30 RETURN END octave-1.1.0/libcruft/ranlib/gengam.f100666 415 17 3114 5175267314 15636 0ustar jweusers REAL FUNCTION gengam(a,r) C********************************************************************** C C REAL FUNCTION GENGAM( A, R ) C GENerates random deviates from GAMma distribution C C C Function C C C Generates random deviates from the gamma distribution whose C density is C (A**R)/Gamma(R) * X**(R-1) * Exp(-A*X) C C C Arguments C C C A --> Location parameter of Gamma distribution C REAL A C C R --> Shape parameter of Gamma distribution C REAL R C C C Method C C C Renames SGAMMA from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C (Case R >= 1.0) C Ahrens, J.H. and Dieter, U. C Generating Gamma Variates by a C Modified Rejection Technique. C Comm. ACM, 25,1 (Jan. 1982), 47 - 54. C Algorithm GD C C (Case 0.0 <= R <= 1.0) C Ahrens, J.H. and Dieter, U. C Computer Methods for Sampling from Gamma, C Beta, Poisson and Binomial Distributions. C Computing, 12 (1974), 223-246/ C Adapted algorithm GS. C C********************************************************************** C .. Scalar Arguments .. REAL a,r C .. C .. External Functions .. REAL sgamma EXTERNAL sgamma C .. C .. Executable Statements .. gengam = sgamma(r) gengam = gengam/a RETURN END octave-1.1.0/libcruft/ranlib/genmn.f100666 415 17 4505 5175267314 15511 0ustar jweusers SUBROUTINE genmn(parm,x,work) C********************************************************************** C C SUBROUTINE GENMN(PARM,X,WORK) C GENerate Multivariate Normal random deviate C C C Arguments C C C PARM --> Parameters needed to generate multivariate normal C deviates (MEANV and Cholesky decomposition of C COVM). Set by a previous call to SETGMN. C 1 : 1 - size of deviate, P C 2 : P + 1 - mean vector C P+2 : P*(P+3)/2 + 1 - upper half of cholesky C decomposition of cov matrix C REAL PARM(*) C C X <-- Vector deviate generated. C REAL X(P) C C WORK <--> Scratch array C REAL WORK(P) C C C Method C C C 1) Generate P independent standard normal deviates - Ei ~ N(0,1) C C 2) Using Cholesky decomposition find A s.t. trans(A)*A = COVM C C 3) trans(A)E + MEANV ~ N(MEANV,COVM) C C********************************************************************** C .. Array Arguments .. REAL parm(*),work(*),x(*) C .. C .. Local Scalars .. REAL ae INTEGER i,icount,j,p C .. C .. External Functions .. REAL snorm EXTERNAL snorm C .. C .. Intrinsic Functions .. INTRINSIC int C .. C .. Executable Statements .. p = int(parm(1)) C C Generate P independent normal deviates - WORK ~ N(0,1) C DO 10,i = 1,p work(i) = snorm() 10 CONTINUE DO 30,i = 1,p C C PARM (P+2 : P*(P+3)/2 + 1) contains A, the Cholesky C decomposition of the desired covariance matrix. C trans(A)(1,1) = PARM(P+2) C trans(A)(2,1) = PARM(P+3) C trans(A)(2,2) = PARM(P+2+P) C trans(A)(3,1) = PARM(P+4) C trans(A)(3,2) = PARM(P+3+P) C trans(A)(3,3) = PARM(P+2-1+2P) ... C C trans(A)*WORK + MEANV ~ N(MEANV,COVM) C icount = 0 ae = 0.0 DO 20,j = 1,i icount = icount + j - 1 ae = ae + parm(i+ (j-1)*p-icount+p+1)*work(j) 20 CONTINUE x(i) = ae + parm(i+1) 30 CONTINUE RETURN C END octave-1.1.0/libcruft/ranlib/gennch.f100666 415 17 3105 5404723162 15633 0ustar jweusers REAL FUNCTION gennch(df,xnonc) C********************************************************************** C C REAL FUNCTION GENNCH( DF, XNONC ) C Generate random value of Noncentral CHIsquare variable C C C Function C C C Generates random deviate from the distribution of a noncentral C chisquare with DF degrees of freedom and noncentrality parameter C XNONC. C C C Arguments C C C DF --> Degrees of freedom of the chisquare C (Must be > 1.0) C REAL DF C C XNONC --> Noncentrality parameter of the chisquare C (Must be >= 0.0) C REAL XNONC C C C Method C C C Uses fact that noncentral chisquare is the sum of a chisquare C deviate with DF-1 degrees of freedom plus the square of a normal C deviate with mean XNONC and standard deviation 1. C C********************************************************************** C .. Scalar Arguments .. REAL df,xnonc C .. C .. External Functions .. REAL genchi,gennor EXTERNAL genchi,gennor C .. C .. Intrinsic Functions .. INTRINSIC sqrt C .. C .. Executable Statements .. IF (.NOT. (df.LE.1.0.OR.xnonc.LT.0.0)) GO TO 10 WRITE (*,*) 'DF <= 1 or XNONC < 0 in GENNCH - ABORT' WRITE (*,*) 'Value of DF: ',df,' Value of XNONC',xnonc CALL XSTOPX ('DF <= 1 or XNONC < 0 in GENNCH - ABORT') 10 gennch = genchi(df-1.0) + gennor(sqrt(xnonc),1.0)**2 RETURN END octave-1.1.0/libcruft/ranlib/gennf.f100666 415 17 4403 5614626257 15502 0ustar jweusers REAL FUNCTION gennf(dfn,dfd,xnonc) C********************************************************************** C C REAL FUNCTION GENNF( DFN, DFD, XNONC ) C GENerate random deviate from the Noncentral F distribution C C C Function C C C Generates a random deviate from the noncentral F (variance ratio) C distribution with DFN degrees of freedom in the numerator, and DFD C degrees of freedom in the denominator, and noncentrality parameter C XNONC. C C C Arguments C C C DFN --> Numerator degrees of freedom C (Must be >= 1.0) C REAL DFN C DFD --> Denominator degrees of freedom C (Must be positive) C REAL DFD C C XNONC --> Noncentrality parameter C (Must be nonnegative) C REAL XNONC C C C Method C C C Directly generates ratio of noncentral numerator chisquare variate C to central denominator chisquare variate. C C********************************************************************** C .. Scalar Arguments .. REAL dfd,dfn,xnonc C .. C .. Local Scalars .. REAL xden,xnum LOGICAL qcond C .. C .. External Functions .. REAL genchi,gennch EXTERNAL genchi,gennch C .. C .. Executable Statements .. qcond = dfn .LE. 1.0 .OR. dfd .LE. 0.0 .OR. xnonc .LT. 0.0 IF (.NOT. (qcond)) GO TO 10 WRITE (*,*) 'In GENNF - Either (1) Numerator DF <= 1.0 or' WRITE (*,*) '(2) Denominator DF < 0.0 or ' WRITE (*,*) '(3) Noncentrality parameter < 0.0' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd,'XNONC value: ', + xnonc CALL XSTOPX + ('Degrees of freedom or noncent param our of range in GENNF') 10 xnum = gennch(dfn,xnonc)/dfn C GENNF = ( GENNCH( DFN, XNONC ) / DFN ) / ( GENCHI( DFD ) / DFD ) xden = genchi(dfd)/dfd IF (.NOT. (xden.LE. (1.2E-38*xnum))) GO TO 20 WRITE (*,*) ' GENNF - generated numbers would cause overflow' WRITE (*,*) ' Numerator ',xnum,' Denominator ',xden WRITE (*,*) ' GENNF returning 1.0E38' gennf = 1.0E38 GO TO 30 20 gennf = xnum/xden 30 RETURN END octave-1.1.0/libcruft/ranlib/gennor.f100666 415 17 2542 5175267314 15674 0ustar jweusers REAL FUNCTION gennor(av,sd) C********************************************************************** C C REAL FUNCTION GENNOR( AV, SD ) C C GENerate random deviate from a NORmal distribution C C C Function C C C Generates a single random deviate from a normal distribution C with mean, AV, and standard deviation, SD. C C C Arguments C C C AV --> Mean of the normal distribution. C REAL AV C C SD --> Standard deviation of the normal distribution. C REAL SD C C GENNOR <-- Generated normal deviate. C REAL GENNOR C C C Method C C C Renames SNORM from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C Ahrens, J.H. and Dieter, U. C Extensions of Forsythe's Method for Random C Sampling from the Normal Distribution. C Math. Comput., 27,124 (Oct. 1973), 927 - 937. C C C********************************************************************** C .. Scalar Arguments .. REAL av,sd C .. C .. External Functions .. REAL snorm EXTERNAL snorm C .. C .. Executable Statements .. gennor = sd*snorm() + av RETURN END octave-1.1.0/libcruft/ranlib/genprm.f100666 415 17 2044 5175267314 15671 0ustar jweusers SUBROUTINE genprm(iarray,larray) C********************************************************************** C C SUBROUTINE GENPRM( IARRAY, LARRAY ) C GENerate random PeRMutation of iarray C C C Arguments C C C IARRAY <--> On output IARRAY is a random permutation of its C value on input C INTEGER IARRAY( LARRAY ) C C LARRAY <--> Length of IARRAY C INTEGER LARRAY C C********************************************************************** C .. Scalar Arguments .. INTEGER larray C .. C .. Array Arguments .. INTEGER iarray(larray) C .. C .. Local Scalars .. INTEGER i,itmp,iwhich C .. C .. External Functions .. INTEGER ignuin EXTERNAL ignuin C .. C .. Executable Statements .. DO 10,i = 1,larray iwhich = ignuin(i,larray) itmp = iarray(iwhich) iarray(iwhich) = iarray(i) iarray(i) = itmp 10 CONTINUE RETURN END octave-1.1.0/libcruft/ranlib/genunf.f100666 415 17 2061 5404723135 15653 0ustar jweusers REAL FUNCTION genunf(low,high) C********************************************************************** C C REAL FUNCTION GENUNF( LOW, HIGH ) C C GeNerate Uniform Real between LOW and HIGH C C C Function C C C Generates a real uniformly distributed between LOW and HIGH. C C C Arguments C C C LOW --> Low bound (exclusive) on real value to be generated C REAL LOW C C HIGH --> High bound (exclusive) on real value to be generated C REAL HIGH C C********************************************************************** C .. Scalar Arguments .. REAL high,low C .. C .. External Functions .. REAL ranf EXTERNAL ranf C .. C .. Executable Statements .. IF (.NOT. (low.GT.high)) GO TO 10 WRITE (*,*) 'LOW > HIGH in GENUNF: LOW ',low,' HIGH: ',high WRITE (*,*) 'Abort' CALL XSTOPX ('LOW > High in GENUNF - Abort') 10 genunf = low + (high-low)*ranf() RETURN END octave-1.1.0/libcruft/ranlib/getcgn.f100666 415 17 2602 5404723127 15642 0ustar jweusers SUBROUTINE getcgn(g) INTEGER g C********************************************************************** C C SUBROUTINE GETCGN(G) C Get GeNerator C C Returns in G the number of the current random number generator C C C Arguments C C C G <-- Number of the current random number generator (1..32) C INTEGER G C C********************************************************************** C INTEGER curntg,numg SAVE curntg PARAMETER (numg=32) DATA curntg/1/ C g = curntg RETURN ENTRY setcgn(g) C********************************************************************** C C SUBROUTINE SETCGN( G ) C Set GeNerator C C Sets the current generator to G. All references to a generat C are to the current generator. C C C Arguments C C C G --> Number of the current random number generator (1..32) C INTEGER G C C********************************************************************** C C Abort if generator number out of range C IF (.NOT. (g.LT.0.OR.g.GT.numg)) GO TO 10 WRITE (*,*) ' Generator number out of range in SETCGN:', + ' Legal range is 1 to ',numg,' -- ABORT!' CALL XSTOPX (' Generator number out of range in SETCGN') 10 curntg = g RETURN END octave-1.1.0/libcruft/ranlib/getsd.f100666 415 17 3743 5404723117 15507 0ustar jweusers SUBROUTINE getsd(iseed1,iseed2) C********************************************************************** C C SUBROUTINE GETSD(ISEED1,ISEED2) C GET SeeD C C Returns the value of two integer seeds of the current generator C C This is a transcription from Pascal to Fortran of routine C Get_State from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C C ISEED1 <- First integer seed of generator G C INTEGER ISEED1 C C ISEED2 <- Second integer seed of generator G C INTEGER ISEED1 C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. INTEGER iseed1,iseed2 C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g C .. C .. External Functions .. LOGICAL qrgnin EXTERNAL qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C Abort unless random number generator initialized IF (qrgnin()) GO TO 10 WRITE (*,*) ' GETSD called before random number generator ', + ' initialized -- abort!' CALL XSTOPX + (' GETSD called before random number generator initialized') 10 CALL getcgn(g) iseed1 = cg1(g) iseed2 = cg2(g) RETURN END octave-1.1.0/libcruft/ranlib/ignbin.f100666 415 17 22065 5175267315 15675 0ustar jweusers INTEGER FUNCTION ignbin(n,pp) C********************************************************************** C C INTEGER FUNCTION IGNBIN( N, P ) C C GENerate BINomial random deviate C C C Function C C C Generates a single random deviate from a binomial C distribution whose number of trials is N and whose C probability of an event in each trial is P. C C C Arguments C C C N --> The number of trials in the binomial distribution C from which a random deviate is to be generated. C INTEGER N C C P --> The probability of an event in each trial of the C binomial distribution from which a random deviate C is to be generated. C REAL P C C IGNBIN <-- A random deviate yielding the number of events C from N independent trials, each of which has C a probability of event P. C INTEGER IGNBIN C C C Note C C C Uses RANF so the value of the seeds, ISEED1 and ISEED2 must be set C by a call similar to the following C DUM = RANSET( ISEED1, ISEED2 ) C C C Method C C C This is algorithm BTPE from: C C Kachitvichyanukul, V. and Schmeiser, B. W. C C Binomial Random Variate Generation. C Communications of the ACM, 31, 2 C (February, 1988) 216. C C********************************************************************** C SUBROUTINE BTPEC(N,PP,ISEED,JX) C C BINOMIAL RANDOM VARIATE GENERATOR C MEAN .LT. 30 -- INVERSE CDF C MEAN .GE. 30 -- ALGORITHM BTPE: ACCEPTANCE-REJECTION VIA C FOUR REGION COMPOSITION. THE FOUR REGIONS ARE A TRIANGLE C (SYMMETRIC IN THE CENTER), A PAIR OF PARALLELOGRAMS (ABOVE C THE TRIANGLE), AND EXPONENTIAL LEFT AND RIGHT TAILS. C C BTPE REFERS TO BINOMIAL-TRIANGLE-PARALLELOGRAM-EXPONENTIAL. C BTPEC REFERS TO BTPE AND "COMBINED." THUS BTPE IS THE C RESEARCH AND BTPEC IS THE IMPLEMENTATION OF A COMPLETE C USABLE ALGORITHM. C REFERENCE: VORATAS KACHITVICHYANUKUL AND BRUCE SCHMEISER, C "BINOMIAL RANDOM VARIATE GENERATION," C COMMUNICATIONS OF THE ACM, FORTHCOMING C WRITTEN: SEPTEMBER 1980. C LAST REVISED: MAY 1985, JULY 1987 C REQUIRED SUBPROGRAM: RAND() -- A UNIFORM (0,1) RANDOM NUMBER C GENERATOR C ARGUMENTS C C N : NUMBER OF BERNOULLI TRIALS (INPUT) C PP : PROBABILITY OF SUCCESS IN EACH TRIAL (INPUT) C ISEED: RANDOM NUMBER SEED (INPUT AND OUTPUT) C JX: RANDOMLY GENERATED OBSERVATION (OUTPUT) C C VARIABLES C PSAVE: VALUE OF PP FROM THE LAST CALL TO BTPEC C NSAVE: VALUE OF N FROM THE LAST CALL TO BTPEC C XNP: VALUE OF THE MEAN FROM THE LAST CALL TO BTPEC C C P: PROBABILITY USED IN THE GENERATION PHASE OF BTPEC C FFM: TEMPORARY VARIABLE EQUAL TO XNP + P C M: INTEGER VALUE OF THE CURRENT MODE C FM: FLOATING POINT VALUE OF THE CURRENT MODE C XNPQ: TEMPORARY VARIABLE USED IN SETUP AND SQUEEZING STEPS C P1: AREA OF THE TRIANGLE C C: HEIGHT OF THE PARALLELOGRAMS C XM: CENTER OF THE TRIANGLE C XL: LEFT END OF THE TRIANGLE C XR: RIGHT END OF THE TRIANGLE C AL: TEMPORARY VARIABLE C XLL: RATE FOR THE LEFT EXPONENTIAL TAIL C XLR: RATE FOR THE RIGHT EXPONENTIAL TAIL C P2: AREA OF THE PARALLELOGRAMS C P3: AREA OF THE LEFT EXPONENTIAL TAIL C P4: AREA OF THE RIGHT EXPONENTIAL TAIL C U: A U(0,P4) RANDOM VARIATE USED FIRST TO SELECT ONE OF THE C FOUR REGIONS AND THEN CONDITIONALLY TO GENERATE A VALUE C FROM THE REGION C V: A U(0,1) RANDOM NUMBER USED TO GENERATE THE RANDOM VALUE C (REGION 1) OR TRANSFORMED INTO THE VARIATE TO ACCEPT OR C REJECT THE CANDIDATE VALUE C IX: INTEGER CANDIDATE VALUE C X: PRELIMINARY CONTINUOUS CANDIDATE VALUE IN REGION 2 LOGIC C AND A FLOATING POINT IX IN THE ACCEPT/REJECT LOGIC C K: ABSOLUTE VALUE OF (IX-M) C F: THE HEIGHT OF THE SCALED DENSITY FUNCTION USED IN THE C ACCEPT/REJECT DECISION WHEN BOTH M AND IX ARE SMALL C ALSO USED IN THE INVERSE TRANSFORMATION C R: THE RATIO P/Q C G: CONSTANT USED IN CALCULATION OF PROBABILITY C MP: MODE PLUS ONE, THE LOWER INDEX FOR EXPLICIT CALCULATION C OF F WHEN IX IS GREATER THAN M C IX1: CANDIDATE VALUE PLUS ONE, THE LOWER INDEX FOR EXPLICIT C CALCULATION OF F WHEN IX IS LESS THAN M C I: INDEX FOR EXPLICIT CALCULATION OF F FOR BTPE C AMAXP: MAXIMUM ERROR OF THE LOGARITHM OF NORMAL BOUND C YNORM: LOGARITHM OF NORMAL BOUND C ALV: NATURAL LOGARITHM OF THE ACCEPT/REJECT VARIATE V C C X1,F1,Z,W,Z2,X2,F2, AND W2 ARE TEMPORARY VARIABLES TO BE C USED IN THE FINAL ACCEPT/REJECT TEST C C QN: PROBABILITY OF NO SUCCESS IN N TRIALS C C REMARK C IX AND JX COULD LOGICALLY BE THE SAME VARIABLE, WHICH WOULD C SAVE A MEMORY POSITION AND A LINE OF CODE. HOWEVER, SOME C COMPILERS (E.G.,CDC MNF) OPTIMIZE BETTER WHEN THE ARGUMENTS C ARE NOT INVOLVED. C C ISEED NEEDS TO BE DOUBLE PRECISION IF THE IMSL ROUTINE C GGUBFS IS USED TO GENERATE UNIFORM RANDOM NUMBER, OTHERWISE C TYPE OF ISEED SHOULD BE DICTATED BY THE UNIFORM GENERATOR C C********************************************************************** C C C C*****DETERMINE APPROPRIATE ALGORITHM AND WHETHER SETUP IS NECESSARY C C .. C .. Scalar Arguments .. REAL pp INTEGER n C .. C .. Local Scalars .. REAL al,alv,amaxp,c,f,f1,f2,ffm,fm,g,p,p1,p2,p3,p4,psave,q,qn,r,u, + v,w,w2,x,x1,x2,xl,xll,xlr,xm,xnp,xnpq,xr,ynorm,z,z2 INTEGER i,ix,ix1,k,m,mp,nsave C .. C .. External Functions .. REAL ranf EXTERNAL ranf C .. C .. Intrinsic Functions .. INTRINSIC abs,alog,amin1,iabs,int,sqrt C .. C .. Data statements .. DATA psave,nsave/-1.,-1/ C .. C .. Executable Statements .. IF (pp.NE.psave) GO TO 10 IF (n.NE.nsave) GO TO 20 IF (xnp-30.) 150,30,30 C C*****SETUP, PERFORM ONLY WHEN PARAMETERS CHANGE C 10 psave = pp p = amin1(psave,1.-psave) q = 1. - p 20 xnp = n*p nsave = n IF (xnp.LT.30.) GO TO 140 ffm = xnp + p m = ffm fm = m xnpq = xnp*q p1 = int(2.195*sqrt(xnpq)-4.6*q) + 0.5 xm = fm + 0.5 xl = xm - p1 xr = xm + p1 c = 0.134 + 20.5/ (15.3+fm) al = (ffm-xl)/ (ffm-xl*p) xll = al* (1.+.5*al) al = (xr-ffm)/ (xr*q) xlr = al* (1.+.5*al) p2 = p1* (1.+c+c) p3 = p2 + c/xll p4 = p3 + c/xlr C WRITE(6,100) N,P,P1,P2,P3,P4,XL,XR,XM,FM C 100 FORMAT(I15,4F18.7/5F18.7) C C*****GENERATE VARIATE C 30 u = ranf()*p4 v = ranf() C C TRIANGULAR REGION C IF (u.GT.p1) GO TO 40 ix = xm - p1*v + u GO TO 170 C C PARALLELOGRAM REGION C 40 IF (u.GT.p2) GO TO 50 x = xl + (u-p1)/c v = v*c + 1. - abs(xm-x)/p1 IF (v.GT.1. .OR. v.LE.0.) GO TO 30 ix = x GO TO 70 C C LEFT TAIL C 50 IF (u.GT.p3) GO TO 60 ix = xl + alog(v)/xll IF (ix.LT.0) GO TO 30 v = v* (u-p2)*xll GO TO 70 C C RIGHT TAIL C 60 ix = xr - alog(v)/xlr IF (ix.GT.n) GO TO 30 v = v* (u-p3)*xlr C C*****DETERMINE APPROPRIATE WAY TO PERFORM ACCEPT/REJECT TEST C 70 k = iabs(ix-m) IF (k.GT.20 .AND. k.LT.xnpq/2-1) GO TO 130 C C EXPLICIT EVALUATION C f = 1.0 r = p/q g = (n+1)*r IF (m-ix) 80,120,100 80 mp = m + 1 DO 90 i = mp,ix f = f* (g/i-r) 90 CONTINUE GO TO 120 100 ix1 = ix + 1 DO 110 i = ix1,m f = f/ (g/i-r) 110 CONTINUE 120 IF (v-f) 170,170,30 C C SQUEEZING USING UPPER AND LOWER BOUNDS ON ALOG(F(X)) C 130 amaxp = (k/xnpq)* ((k* (k/3.+.625)+.1666666666666)/xnpq+.5) ynorm = -k*k/ (2.*xnpq) alv = alog(v) IF (alv.LT.ynorm-amaxp) GO TO 170 IF (alv.GT.ynorm+amaxp) GO TO 30 C C STIRLING'S FORMULA TO MACHINE ACCURACY FOR C THE FINAL ACCEPTANCE/REJECTION TEST C x1 = ix + 1 f1 = fm + 1. z = n + 1 - fm w = n - ix + 1. z2 = z*z x2 = x1*x1 f2 = f1*f1 w2 = w*w IF (alv- (xm*alog(f1/x1)+ (n-m+.5)*alog(z/w)+ (ix- + m)*alog(w*p/ (x1*q))+ (13860.- (462.- (132.- (99.- + 140./f2)/f2)/f2)/f2)/f1/166320.+ (13860.- (462.- (132.- (99.- + 140./z2)/z2)/z2)/z2)/z/166320.+ (13860.- (462.- (132.- (99.- + 140./x2)/x2)/x2)/x2)/x1/166320.+ (13860.- (462.- (132.- (99.- + 140./w2)/w2)/w2)/w2)/w/166320.)) 170,170,30 C C INVERSE CDF LOGIC FOR MEAN LESS THAN 30 C 140 qn = q**n r = p/q g = r* (n+1) 150 ix = 0 f = qn u = ranf() 160 IF (u.LT.f) GO TO 170 IF (ix.GT.110) GO TO 150 u = u - f ix = ix + 1 f = f* (g/ix-r) GO TO 160 170 IF (psave.GT.0.5) ix = n - ix ignbin = ix RETURN END octave-1.1.0/libcruft/ranlib/ignlgi.f100666 415 17 4220 5175267315 15651 0ustar jweusers INTEGER FUNCTION ignlgi() C********************************************************************** C C INTEGER FUNCTION IGNLGI() C GeNerate LarGe Integer C C Returns a random integer following a uniform distribution over C (1, 2147483562) using the current generator. C C This is a transcription from Pascal to Fortran of routine C Random from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER curntg,k,s1,s2,z LOGICAL qqssd C .. C .. External Functions .. LOGICAL qrgnin EXTERNAL qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn,inrgcm,rgnqsd,setall C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C C IF THE RANDOM NUMBER PACKAGE HAS NOT BEEN INITIALIZED YET, DO SO. C IT CAN BE INITIALIZED IN ONE OF TWO WAYS : 1) THE FIRST CALL TO C THIS ROUTINE 2) A CALL TO SETALL. C IF (.NOT. (qrgnin())) CALL inrgcm() CALL rgnqsd(qqssd) IF (.NOT. (qqssd)) CALL setall(1234567890,123456789) C C Get Current Generator C CALL getcgn(curntg) s1 = cg1(curntg) s2 = cg2(curntg) k = s1/53668 s1 = a1* (s1-k*53668) - k*12211 IF (s1.LT.0) s1 = s1 + m1 k = s2/52774 s2 = a2* (s2-k*52774) - k*3791 IF (s2.LT.0) s2 = s2 + m2 cg1(curntg) = s1 cg2(curntg) = s2 z = s1 - s2 IF (z.LT.1) z = z + m1 - 1 IF (qanti(curntg)) z = m1 - z ignlgi = z RETURN END octave-1.1.0/libcruft/ranlib/ignpoi.f100666 415 17 17462 5175267315 15721 0ustar jweusers INTEGER FUNCTION ignpoi(mu) C********************************************************************** C C INTEGER FUNCTION IGNPOI( AV ) C C GENerate POIsson random deviate C C C Function C C C Generates a single random deviate from a Poisson C distribution with mean AV. C C C Arguments C C C AV --> The mean of the Poisson distribution from which C a random deviate is to be generated. C REAL AV C C GENEXP <-- The random deviate. C REAL GENEXP C C C Method C C C Renames KPOIS from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C C Ahrens, J.H. and Dieter, U. C Computer Generation of Poisson Deviates C From Modified Normal Distributions. C ACM Trans. Math. Software, 8, 2 C (June 1982),163-179 C C********************************************************************** C**********************************************************************C C**********************************************************************C C C C C C P O I S S O N DISTRIBUTION C C C C C C**********************************************************************C C**********************************************************************C C C C FOR DETAILS SEE: C C C C AHRENS, J.H. AND DIETER, U. C C COMPUTER GENERATION OF POISSON DEVIATES C C FROM MODIFIED NORMAL DISTRIBUTIONS. C C ACM TRANS. MATH. SOFTWARE, 8,2 (JUNE 1982), 163 - 179. C C C C (SLIGHTLY MODIFIED VERSION OF THE PROGRAM IN THE ABOVE ARTICLE) C C C C**********************************************************************C C C INTEGER FUNCTION IGNPOI(IR,MU) C C INPUT: IR=CURRENT STATE OF BASIC RANDOM NUMBER GENERATOR C MU=MEAN MU OF THE POISSON DISTRIBUTION C OUTPUT: IGNPOI=SAMPLE FROM THE POISSON-(MU)-DISTRIBUTION C C C C MUPREV=PREVIOUS MU, MUOLD=MU AT LAST EXECUTION OF STEP P OR B. C TABLES: COEFFICIENTS A0-A7 FOR STEP F. FACTORIALS FACT C COEFFICIENTS A(K) - FOR PX = FK*V*V*SUM(A(K)*V**K)-DEL C C C C SEPARATION OF CASES A AND B C C .. Scalar Arguments .. REAL mu C .. C .. Local Scalars .. REAL a0,a1,a2,a3,a4,a5,a6,a7,b1,b2,c,c0,c1,c2,c3,d,del,difmuk,e, + fk,fx,fy,g,muold,muprev,omega,p,p0,px,py,q,s,t,u,v,x,xx INTEGER j,k,kflag,l,m C .. C .. Local Arrays .. REAL fact(10),pp(35) C .. C .. External Functions .. REAL ranf,sexpo,snorm EXTERNAL ranf,sexpo,snorm C .. C .. Intrinsic Functions .. INTRINSIC abs,alog,exp,float,ifix,max0,min0,sign,sqrt C .. C .. Data statements .. DATA muprev,muold/0.,0./ DATA a0,a1,a2,a3,a4,a5,a6,a7/-.5,.3333333,-.2500068,.2000118, + -.1661269,.1421878,-.1384794,.1250060/ DATA fact/1.,1.,2.,6.,24.,120.,720.,5040.,40320.,362880./ C .. C .. Executable Statements .. IF (mu.EQ.muprev) GO TO 10 IF (mu.LT.10.0) GO TO 120 C C C A S E A. (RECALCULATION OF S,D,L IF MU HAS CHANGED) C muprev = mu s = sqrt(mu) d = 6.0*mu*mu C C THE POISSON PROBABILITIES PK EXCEED THE DISCRETE NORMAL C PROBABILITIES FK WHENEVER K >= M(MU). L=IFIX(MU-1.1484) C IS AN UPPER BOUND TO M(MU) FOR ALL MU >= 10 . C l = ifix(mu-1.1484) C C STEP N. NORMAL SAMPLE - SNORM(IR) FOR STANDARD NORMAL DEVIATE C 10 g = mu + s*snorm() IF (g.LT.0.0) GO TO 20 ignpoi = ifix(g) C C STEP I. IMMEDIATE ACCEPTANCE IF IGNPOI IS LARGE ENOUGH C IF (ignpoi.GE.l) RETURN C C STEP S. SQUEEZE ACCEPTANCE - SUNIF(IR) FOR (0,1)-SAMPLE U C fk = float(ignpoi) difmuk = mu - fk u = ranf() IF (d*u.GE.difmuk*difmuk*difmuk) RETURN C C STEP P. PREPARATIONS FOR STEPS Q AND H. C (RECALCULATIONS OF PARAMETERS IF NECESSARY) C .3989423=(2*PI)**(-.5) .416667E-1=1./24. .1428571=1./7. C THE QUANTITIES B1, B2, C3, C2, C1, C0 ARE FOR THE HERMITE C APPROXIMATIONS TO THE DISCRETE NORMAL PROBABILITIES FK. C C=.1069/MU GUARANTEES MAJORIZATION BY THE 'HAT'-FUNCTION. C 20 IF (mu.EQ.muold) GO TO 30 muold = mu omega = .3989423/s b1 = .4166667E-1/mu b2 = .3*b1*b1 c3 = .1428571*b1*b2 c2 = b2 - 15.*c3 c1 = b1 - 6.*b2 + 45.*c3 c0 = 1. - b1 + 3.*b2 - 15.*c3 c = .1069/mu 30 IF (g.LT.0.0) GO TO 50 C C 'SUBROUTINE' F IS CALLED (KFLAG=0 FOR CORRECT RETURN) C kflag = 0 GO TO 70 C C STEP Q. QUOTIENT ACCEPTANCE (RARE CASE) C 40 IF (fy-u*fy.LE.py*exp(px-fx)) RETURN C C STEP E. EXPONENTIAL SAMPLE - SEXPO(IR) FOR STANDARD EXPONENTIAL C DEVIATE E AND SAMPLE T FROM THE LAPLACE 'HAT' C (IF T <= -.6744 THEN PK < FK FOR ALL MU >= 10.) C 50 e = sexpo() u = ranf() u = u + u - 1.0 t = 1.8 + sign(e,u) IF (t.LE. (-.6744)) GO TO 50 ignpoi = ifix(mu+s*t) fk = float(ignpoi) difmuk = mu - fk C C 'SUBROUTINE' F IS CALLED (KFLAG=1 FOR CORRECT RETURN) C kflag = 1 GO TO 70 C C STEP H. HAT ACCEPTANCE (E IS REPEATED ON REJECTION) C 60 IF (c*abs(u).GT.py*exp(px+e)-fy*exp(fx+e)) GO TO 50 RETURN C C STEP F. 'SUBROUTINE' F. CALCULATION OF PX,PY,FX,FY. C CASE IGNPOI .LT. 10 USES FACTORIALS FROM TABLE FACT C 70 IF (ignpoi.GE.10) GO TO 80 px = -mu py = mu**ignpoi/fact(ignpoi+1) GO TO 110 C C CASE IGNPOI .GE. 10 USES POLYNOMIAL APPROXIMATION C A0-A7 FOR ACCURACY WHEN ADVISABLE C .8333333E-1=1./12. .3989423=(2*PI)**(-.5) C 80 del = .8333333E-1/fk del = del - 4.8*del*del*del v = difmuk/fk IF (abs(v).LE.0.25) GO TO 90 px = fk*alog(1.0+v) - difmuk - del GO TO 100 90 px = fk*v*v* (((((((a7*v+a6)*v+a5)*v+a4)*v+a3)*v+a2)*v+a1)*v+a0) - + del 100 py = .3989423/sqrt(fk) 110 x = (0.5-difmuk)/s xx = x*x fx = -0.5*xx fy = omega* (((c3*xx+c2)*xx+c1)*xx+c0) IF (kflag) 40,40,60 C C C A S E B. (START NEW TABLE AND CALCULATE P0 IF NECESSARY) C 120 muprev = 0.0 IF (mu.EQ.muold) GO TO 130 muold = mu m = max0(1,ifix(mu)) l = 0 p = exp(-mu) q = p p0 = p C C STEP U. UNIFORM SAMPLE FOR INVERSION METHOD C 130 u = ranf() ignpoi = 0 IF (u.LE.p0) RETURN C C STEP T. TABLE COMPARISON UNTIL THE END PP(L) OF THE C PP-TABLE OF CUMULATIVE POISSON PROBABILITIES C (0.458=PP(9) FOR MU=10) C IF (l.EQ.0) GO TO 150 j = 1 IF (u.GT.0.458) j = min0(l,m) DO 140 k = j,l IF (u.LE.pp(k)) GO TO 180 140 CONTINUE IF (l.EQ.35) GO TO 130 C C STEP C. CREATION OF NEW POISSON PROBABILITIES P C AND THEIR CUMULATIVES Q=PP(K) C 150 l = l + 1 DO 160 k = l,35 p = p*mu/float(k) q = q + p pp(k) = q IF (u.LE.q) GO TO 170 160 CONTINUE l = 35 GO TO 130 170 l = k 180 ignpoi = k RETURN END octave-1.1.0/libcruft/ranlib/ignuin.f100666 415 17 4764 5673465356 15716 0ustar jweusers INTEGER FUNCTION ignuin(low,high) C********************************************************************** C C INTEGER FUNCTION IGNUIN( LOW, HIGH ) C C GeNerate Uniform INteger C C C Function C C C Generates an integer uniformly distributed between LOW and HIGH. C C C Arguments C C C LOW --> Low bound (inclusive) on integer value to be generated C INTEGER LOW C C HIGH --> High bound (inclusive) on integer value to be generated C INTEGER HIGH C C C Note C C C If (HIGH-LOW) > 2,147,483,561 prints error message on * unit and C stops the program. C C********************************************************************** C IGNLGI generates integers between 1 and 2147483562 C MAXNUM is 1 less than maximum generable value C .. Parameters .. INTEGER maxnum PARAMETER (maxnum=2147483561) CHARACTER*(*) err1,err2 PARAMETER (err1='LOW > HIGH in IGNUIN', + err2=' ( HIGH - LOW ) > 2,147,483,561 in IGNUIN') C .. C .. Scalar Arguments .. INTEGER high,low C .. C .. Local Scalars .. INTEGER err,ign,maxnow,range,ranp1 C .. C .. External Functions .. INTEGER ignlgi EXTERNAL ignlgi C .. C .. Intrinsic Functions .. INTRINSIC mod C .. C .. Executable Statements .. IF (.NOT. (low.GT.high)) GO TO 10 err = 1 C ABORT-PROGRAM GO TO 80 10 range = high - low IF (.NOT. (range.GT.maxnum)) GO TO 20 err = 2 C ABORT-PROGRAM GO TO 80 20 IF (.NOT. (low.EQ.high)) GO TO 30 ignuin = low RETURN GO TO 70 C Number to be generated should be in range 0..RANGE C Set MAXNOW so that the number of integers in 0..MAXNOW is an C integral multiple of the number in 0..RANGE 30 ranp1 = range + 1 maxnow = (maxnum/ranp1)*ranp1 40 ign = ignlgi() - 1 IF (.NOT. (ign.LE.maxnow)) GO TO 50 ignuin = low + mod(ign,ranp1) RETURN 50 GO TO 40 60 CONTINUE 70 CONTINUE 80 IF (.NOT. (err.EQ.1)) GO TO 90 WRITE (*,*) err1 GO TO 100 C TO ABORT-PROGRAM 90 WRITE (*,*) err2 100 WRITE (*,*) ' LOW: ',low,' HIGH: ',high WRITE (*,*) ' Abort on Fatal ERROR' IF (.NOT. (err.EQ.1)) GO TO 110 CALL XSTOPX ('LOW > HIGH in IGNUIN') IGNUIN = 0 GO TO 120 110 STOP ' ( HIGH - LOW ) > 2,147,483,561 in IGNUIN' 120 END octave-1.1.0/libcruft/ranlib/initgn.f100666 415 17 4772 5404723073 15675 0ustar jweusers SUBROUTINE initgn(isdtyp) C********************************************************************** C C SUBROUTINE INITGN(ISDTYP) C INIT-ialize current G-e-N-erator C C Reinitializes the state of the current generator C C This is a transcription from Pascal to Fortran of routine C Init_Generator from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISDTYP -> The state to which the generator is to be set C C ISDTYP = -1 => sets the seeds to their initial value C ISDTYP = 0 => sets the seeds to the first value of C the current block C ISDTYP = 1 => sets the seeds to the first value of C the next block C C INTEGER ISDTYP C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. INTEGER isdtyp C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g C .. C .. External Functions .. LOGICAL qrgnin INTEGER mltmod EXTERNAL qrgnin,mltmod C .. C .. External Subroutines .. EXTERNAL getcgn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C Abort unless random number generator initialized IF (qrgnin()) GO TO 10 WRITE (*,*) ' INITGN called before random number generator ', + ' initialized -- abort!' CALL XSTOPX + (' INITGN called before random number generator initialized') 10 CALL getcgn(g) IF ((-1).NE. (isdtyp)) GO TO 20 lg1(g) = ig1(g) lg2(g) = ig2(g) GO TO 50 20 IF ((0).NE. (isdtyp)) GO TO 30 CONTINUE GO TO 50 C do nothing 30 IF ((1).NE. (isdtyp)) GO TO 40 lg1(g) = mltmod(a1w,lg1(g),m1) lg2(g) = mltmod(a2w,lg2(g),m2) GO TO 50 40 STOP 'ISDTYP NOT IN RANGE' 50 cg1(g) = lg1(g) cg2(g) = lg2(g) RETURN END octave-1.1.0/libcruft/ranlib/inrgcm.f100666 415 17 3620 5175267315 15662 0ustar jweusers SUBROUTINE inrgcm() C********************************************************************** C C SUBROUTINE INRGCM() C INitialize Random number Generator CoMmon C C C Function C C C Initializes common area for random number generator. This saves C the nuisance of a BLOCK DATA routine and the difficulty of C assuring that the routine is loaded with the other routines. C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER i LOGICAL qdum C .. C .. External Functions .. LOGICAL qrgnsn EXTERNAL qrgnsn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C V=20; W=30; C C A1W = MOD(A1**(2**W),M1) A2W = MOD(A2**(2**W),M2) C A1VW = MOD(A1**(2**(V+W)),M1) A2VW = MOD(A2**(2**(V+W)),M2) C C If V or W is changed A1W, A2W, A1VW, and A2VW need to be recomputed. C An efficient way to precompute a**(2*j) MOD m is to start with C a and square it j times modulo m using the function MLTMOD. C m1 = 2147483563 m2 = 2147483399 a1 = 40014 a2 = 40692 a1w = 1033780774 a2w = 1494757890 a1vw = 2082007225 a2vw = 784306273 DO 10,i = 1,numg qanti(i) = .FALSE. 10 CONTINUE C C Tell the world that common has been initialized C qdum = qrgnsn(.TRUE.) RETURN END octave-1.1.0/libcruft/ranlib/lennob.f100666 415 17 1522 5175267315 15657 0ustar jweusers INTEGER FUNCTION lennob(string) IMPLICIT INTEGER (a-p,r-z),LOGICAL (q) C********************************************************************** C C INTEGER FUNCTION LENNOB( STRING ) C LENgth NOt counting trailing Blanks C C C Function C C C Returns the length of STRING up to and including the last C non-blank character. C C C Arguments C C C STRING --> String whose length not counting trailing blanks C is returned. C C********************************************************************** CHARACTER*(*) string end = len(string) DO 20,i = end,1,-1 IF (.NOT. (string(i:i).NE.' ')) GO TO 10 lennob = i RETURN 10 CONTINUE 20 CONTINUE lennob = 0 RETURN END octave-1.1.0/libcruft/ranlib/mltmod.f100666 415 17 4500 5404723055 15666 0ustar jweusers INTEGER FUNCTION mltmod(a,s,m) C********************************************************************** C C INTEGER FUNCTION MLTMOD(A,S,M) C C Returns (A*S) MOD M C C This is a transcription from Pascal to Fortran of routine C MULtMod_Decompos from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C A, S, M --> C INTEGER A,S,M C C********************************************************************** C .. Parameters .. INTEGER h PARAMETER (h=32768) C .. C .. Scalar Arguments .. INTEGER a,m,s C .. C .. Local Scalars .. INTEGER a0,a1,k,p,q,qh,rh C .. C .. Executable Statements .. C C H = 2**((b-2)/2) where b = 32 because we are using a 32 bit C machine. On a different machine recompute H C IF (.NOT. (a.LE.0.OR.a.GE.m.OR.s.LE.0.OR.s.GE.m)) GO TO 10 WRITE (*,*) ' A, M, S out of order in MLTMOD - ABORT!' WRITE (*,*) ' A = ',a,' S = ',s,' M = ',m WRITE (*,*) ' MLTMOD requires: 0 < A < M; 0 < S < M' CALL XSTOPX (' A, M, S out of order in MLTMOD - ABORT!') 10 IF (.NOT. (a.LT.h)) GO TO 20 a0 = a p = 0 GO TO 120 20 a1 = a/h a0 = a - h*a1 qh = m/h rh = m - h*qh IF (.NOT. (a1.GE.h)) GO TO 50 a1 = a1 - h k = s/qh p = h* (s-k*qh) - k*rh 30 IF (.NOT. (p.LT.0)) GO TO 40 p = p + m GO TO 30 40 GO TO 60 50 p = 0 C C P = (A2*S*H)MOD M C 60 IF (.NOT. (a1.NE.0)) GO TO 90 q = m/a1 k = s/q p = p - k* (m-a1*q) IF (p.GT.0) p = p - m p = p + a1* (s-k*q) 70 IF (.NOT. (p.LT.0)) GO TO 80 p = p + m GO TO 70 80 CONTINUE 90 k = p/qh C C P = ((A2*H + A1)*S)MOD M C p = h* (p-k*qh) - k*rh 100 IF (.NOT. (p.LT.0)) GO TO 110 p = p + m GO TO 100 110 CONTINUE 120 IF (.NOT. (a0.NE.0)) GO TO 150 C C P = ((A2*H + A1)*H*S)MOD M C q = m/a0 k = s/q p = p - k* (m-a0*q) IF (p.GT.0) p = p - m p = p + a0* (s-k*q) 130 IF (.NOT. (p.LT.0)) GO TO 140 p = p + m GO TO 130 140 CONTINUE 150 mltmod = p C RETURN END octave-1.1.0/libcruft/ranlib/phrtsd.f100666 415 17 4350 5175267315 15710 0ustar jweusers SUBROUTINE phrtsd(phrase,seed1,seed2) C********************************************************************** C C SUBROUTINE PHRTSD( PHRASE, SEED1, SEED2 ) C PHRase To SeeDs C C C Function C C C Uses a phrase (character string) to generate two seeds for the RGN C random number generator. C C C Arguments C C C PHRASE --> Phrase to be used for random number generation C CHARACTER*(*) PHRASE C C SEED1 <-- First seed for RGN generator C INTEGER SEED1 C C SEED2 <-- Second seed for RGN generator C INTEGER SEED2 C C C Note C C C Trailing blanks are eliminated before the seeds are generated. C C Generated seed values will fall in the range 1..2^30 C (1..1,073,741,824) C C********************************************************************** C .. Parameters .. CHARACTER*(*) table PARAMETER (table='abcdefghijklmnopqrstuvwxyz'// + 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'//'0123456789'// + '!@#$%^&*()_+[];:''"<>?,./') INTEGER twop30 PARAMETER (twop30=1073741824) C .. C .. Scalar Arguments .. INTEGER seed1,seed2 CHARACTER phrase* (*) C .. C .. Local Scalars .. INTEGER i,ichr,j,lphr C .. C .. Local Arrays .. INTEGER shift(0:4),values(5) C .. C .. External Functions .. INTEGER lennob EXTERNAL lennob C .. C .. Intrinsic Functions .. INTRINSIC index,mod C .. C .. Data statements .. DATA shift/1,64,4096,262144,16777216/ C .. C .. Executable Statements .. seed1 = 1234567890 seed2 = 123456789 lphr = lennob(phrase) IF (lphr.LT.1) RETURN DO 30,i = 1,lphr ichr = mod(index(table,phrase(i:i)),64) IF (ichr.EQ.0) ichr = 63 DO 10,j = 1,5 values(j) = ichr - j IF (values(j).LT.1) values(j) = values(j) + 63 10 CONTINUE DO 20,j = 1,5 seed1 = mod(seed1+shift(j-1)*values(j),twop30) seed2 = mod(seed2+shift(j-1)*values(6-j),twop30) 20 CONTINUE 30 CONTINUE RETURN END octave-1.1.0/libcruft/ranlib/qrgnin.f100666 415 17 2465 5175267315 15707 0ustar jweusers LOGICAL FUNCTION qrgnin() C********************************************************************** C C LOGICAL FUNCTION QRGNIN() C Q Random GeNerators INitialized? C C A trivial routine to determine whether or not the random C number generator has been initialized. Returns .TRUE. if C it has, else .FALSE. C C********************************************************************** C .. Scalar Arguments .. LOGICAL qvalue C .. C .. Local Scalars .. LOGICAL qinit C .. C .. Entry Points .. LOGICAL qrgnsn C .. C .. Save statement .. SAVE qinit C .. C .. Data statements .. DATA qinit/.FALSE./ C .. C .. Executable Statements .. qrgnin = qinit RETURN ENTRY qrgnsn(qvalue) C********************************************************************** C C LOGICAL FUNCTION QRGNSN( QVALUE ) C Q Random GeNerators Set whether iNitialized C C Sets state of whether random number generator is initialized C to QVALUE. C C This routine is actually an entry in QRGNIN, hence it is a C logical function. It returns the (meaningless) value .TRUE. C C********************************************************************** qinit = qvalue qrgnsn = .TRUE. RETURN END octave-1.1.0/libcruft/ranlib/ranf.f100666 415 17 1776 5175267315 15343 0ustar jweusers REAL FUNCTION ranf() C********************************************************************** C C REAL FUNCTION RANF() C RANDom number generator as a Function C C Returns a random floating point number from a uniform distribution C over 0 - 1 (endpoints of this interval are not returned) using the C current generator C C This is a transcription from Pascal to Fortran of routine C Uniform_01 from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C********************************************************************** C .. External Functions .. INTEGER ignlgi EXTERNAL ignlgi C .. C .. Executable Statements .. C C 4.656613057E-10 is 1/M1 M1 is set in a data statement in IGNLGI C and is currently 2147483563. If M1 changes, change this also. C ranf = ignlgi()*4.656613057E-10 RETURN END octave-1.1.0/libcruft/ranlib/setall.f100666 415 17 5444 5175267315 15675 0ustar jweusers SUBROUTINE setall(iseed1,iseed2) C********************************************************************** C C SUBROUTINE SETALL(ISEED1,ISEED2) C SET ALL random number generators C C Sets the initial seed of generator 1 to ISEED1 and ISEED2. The C initial seeds of the other generators are set accordingly, and C all generators states are set to these seeds. C C This is a transcription from Pascal to Fortran of routine C Set_Initial_Seed from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISEED1 -> First of two integer seeds C INTEGER ISEED1 C C ISEED2 -> Second of two integer seeds C INTEGER ISEED1 C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. INTEGER iseed1,iseed2 LOGICAL qssd C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g,ocgn LOGICAL qqssd C .. C .. External Functions .. INTEGER mltmod LOGICAL qrgnin EXTERNAL mltmod,qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn,initgn,inrgcm,setcgn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/,qqssd C .. C .. Data statements .. DATA qqssd/.FALSE./ C .. C .. Executable Statements .. C C TELL IGNLGI, THE ACTUAL NUMBER GENERATOR, THAT THIS ROUTINE C HAS BEEN CALLED. C qqssd = .TRUE. CALL getcgn(ocgn) C C Initialize Common Block if Necessary C IF (.NOT. (qrgnin())) CALL inrgcm() ig1(1) = iseed1 ig2(1) = iseed2 CALL initgn(-1) DO 10,g = 2,numg ig1(g) = mltmod(a1vw,ig1(g-1),m1) ig2(g) = mltmod(a2vw,ig2(g-1),m2) CALL setcgn(g) CALL initgn(-1) 10 CONTINUE CALL setcgn(ocgn) RETURN ENTRY rgnqsd(qssd) C********************************************************************** C C SUBROUTINE RGNQSD C Random Number Generator Query SeeD set? C C Returns (LOGICAL) QSSD as .TRUE. if SETALL has been invoked, C otherwise returns .FALSE. C C********************************************************************** qssd = qqssd RETURN END octave-1.1.0/libcruft/ranlib/setant.f100666 415 17 4355 5404723040 15672 0ustar jweusers SUBROUTINE setant(qvalue) C********************************************************************** C C SUBROUTINE SETANT(QVALUE) C SET ANTithetic C C Sets whether the current generator produces antithetic values. If C X is the value normally returned from a uniform [0,1] random C number generator then 1 - X is the antithetic value. If X is the C value normally returned from a uniform [0,N] random number C generator then N - 1 - X is the antithetic value. C C All generators are initialized to NOT generate antithetic values. C C This is a transcription from Pascal to Fortran of routine C Set_Antithetic from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C QVALUE -> .TRUE. if generator G is to generating antithetic C values, otherwise .FALSE. C LOGICAL QVALUE C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. LOGICAL qvalue C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g C .. C .. External Functions .. LOGICAL qrgnin EXTERNAL qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C Abort unless random number generator initialized IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETANT called before random number generator ', + ' initialized -- abort!' CALL XSTOPX + (' SETANT called before random number generator initialized') 10 CALL getcgn(g) qanti(g) = qvalue RETURN END octave-1.1.0/libcruft/ranlib/setgmn.f100666 415 17 5100 5404723021 15655 0ustar jweusers SUBROUTINE setgmn(meanv,covm,p,parm) C********************************************************************** C C SUBROUTINE SETGMN( MEANV, COVM, P, PARM) C SET Generate Multivariate Normal random deviate C C C Function C C C Places P, MEANV, and the Cholesky factoriztion of COVM C in GENMN. C C C Arguments C C C MEANV --> Mean vector of multivariate normal distribution. C REAL MEANV(P) C C COVM <--> (Input) Covariance matrix of the multivariate C normal distribution C (Output) Destroyed on output C REAL COVM(P,P) C C P --> Dimension of the normal, or length of MEANV. C INTEGER P C C PARM <-- Array of parameters needed to generate multivariate norma C deviates (P, MEANV and Cholesky decomposition of C COVM). C 1 : 1 - P C 2 : P + 1 - MEANV C P+2 : P*(P+3)/2 + 1 - Cholesky decomposition of COVM C REAL PARM(P*(P+3)/2 + 1) C C********************************************************************** C .. Scalar Arguments .. INTEGER p C .. C .. Array Arguments .. REAL covm(p,p),meanv(p),parm(p* (p+3)/2+1) C .. C .. Local Scalars .. INTEGER i,icount,info,j C .. C .. External Subroutines .. EXTERNAL spofa C .. C .. Executable Statements .. C C C TEST THE INPUT C IF (.NOT. (p.LE.0)) GO TO 10 WRITE (*,*) 'P nonpositive in SETGMN' WRITE (*,*) 'Value of P: ',p CALL XSTOPX ('P nonpositive in SETGMN') 10 parm(1) = p C C PUT P AND MEANV INTO PARM C DO 20,i = 2,p + 1 parm(i) = meanv(i-1) 20 CONTINUE C C Cholesky decomposition to find A s.t. trans(A)*(A) = COVM C CALL spofa(covm,p,p,info) IF (.NOT. (info.NE.0)) GO TO 30 WRITE (*,*) ' COVM not positive definite in SETGMN' CALL XSTOPX (' COVM not positive definite in SETGMN') 30 icount = p + 1 C C PUT UPPER HALF OF A, WHICH IS NOW THE CHOLESKY FACTOR, INTO PARM C COVM(1,1) = PARM(P+2) C COVM(1,2) = PARM(P+3) C : C COVM(1,P) = PARM(2P+1) C COVM(2,2) = PARM(2P+2) ... C DO 50,i = 1,p DO 40,j = i,p icount = icount + 1 parm(icount) = covm(i,j) 40 CONTINUE 50 CONTINUE RETURN C END octave-1.1.0/libcruft/ranlib/setsd.f100666 415 17 4051 5404722772 15522 0ustar jweusers SUBROUTINE setsd(iseed1,iseed2) C********************************************************************** C C SUBROUTINE SETSD(ISEED1,ISEED2) C SET S-ee-D of current generator C C Resets the initial seed of the current generator to ISEED1 and C ISEED2. The seeds of the other generators remain unchanged. C C This is a transcription from Pascal to Fortran of routine C Set_Seed from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISEED1 -> First integer seed C INTEGER ISEED1 C C ISEED2 -> Second integer seed C INTEGER ISEED1 C C********************************************************************** C .. Parameters .. INTEGER numg PARAMETER (numg=32) C .. C .. Scalar Arguments .. INTEGER iseed1,iseed2 C .. C .. Scalars in Common .. INTEGER a1,a1vw,a1w,a2,a2vw,a2w,m1,m2 C .. C .. Arrays in Common .. INTEGER cg1(numg),cg2(numg),ig1(numg),ig2(numg),lg1(numg), + lg2(numg) LOGICAL qanti(numg) C .. C .. Local Scalars .. INTEGER g C .. C .. External Functions .. LOGICAL qrgnin EXTERNAL qrgnin C .. C .. External Subroutines .. EXTERNAL getcgn,initgn C .. C .. Common blocks .. COMMON /globe/m1,m2,a1,a2,a1w,a2w,a1vw,a2vw,ig1,ig2,lg1,lg2,cg1, + cg2,qanti C .. C .. Save statement .. SAVE /globe/ C .. C .. Executable Statements .. C Abort unless random number generator initialized IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETSD called before random number generator ', + ' initialized -- abort!' CALL XSTOPX + (' SETSD called before random number generator initialized') 10 CALL getcgn(g) ig1(g) = iseed1 ig2(g) = iseed2 CALL initgn(-1) RETURN END octave-1.1.0/libcruft/ranlib/sexpo.f100666 415 17 4530 5175267315 15542 0ustar jweusers REAL FUNCTION sexpo() C**********************************************************************C C C C C C (STANDARD-) E X P O N E N T I A L DISTRIBUTION C C C C C C**********************************************************************C C**********************************************************************C C C C FOR DETAILS SEE: C C C C AHRENS, J.H. AND DIETER, U. C C COMPUTER METHODS FOR SAMPLING FROM THE C C EXPONENTIAL AND NORMAL DISTRIBUTIONS. C C COMM. ACM, 15,10 (OCT. 1972), 873 - 882. C C C C ALL STATEMENT NUMBERS CORRESPOND TO THE STEPS OF ALGORITHM C C 'SA' IN THE ABOVE PAPER (SLIGHTLY MODIFIED IMPLEMENTATION) C C C C Modified by Barry W. Brown, Feb 3, 1988 to use RANF instead of C C SUNIF. The argument IR thus goes away. C C C C**********************************************************************C C DIMENSION q(8) EQUIVALENCE (q(1),q1) C C Q(N) = SUM(ALOG(2.0)**K/K!) K=1,..,N , THE HIGHEST N C (HERE 8) IS DETERMINED BY Q(N)=1.0 WITHIN STANDARD PRECISION C DATA q/.6931472,.9333737,.9888778,.9984959,.9998293,.9999833, + .9999986,.9999999/ C 10 a = 0.0 u = ranf() GO TO 30 20 a = a + q1 30 u = u + u IF (u.LE.1.0) GO TO 20 40 u = u - 1.0 IF (u.GT.q1) GO TO 60 50 sexpo = a + u RETURN 60 i = 1 ustar = ranf() umin = ustar 70 ustar = ranf() IF (ustar.LT.umin) umin = ustar 80 i = i + 1 IF (u.GT.q(i)) GO TO 70 90 sexpo = a + umin*q1 RETURN END octave-1.1.0/libcruft/ranlib/sgamma.f100666 415 17 15400 5175267315 15667 0ustar jweusers REAL FUNCTION sgamma(a) C**********************************************************************C C C C C C (STANDARD-) G A M M A DISTRIBUTION C C C C C C**********************************************************************C C**********************************************************************C C C C PARAMETER A >= 1.0 ! C C C C**********************************************************************C C C C FOR DETAILS SEE: C C C C AHRENS, J.H. AND DIETER, U. C C GENERATING GAMMA VARIATES BY A C C MODIFIED REJECTION TECHNIQUE. C C COMM. ACM, 25,1 (JAN. 1982), 47 - 54. C C C C STEP NUMBERS CORRESPOND TO ALGORITHM 'GD' IN THE ABOVE PAPER C C (STRAIGHTFORWARD IMPLEMENTATION) C C C C Modified by Barry W. Brown, Feb 3, 1988 to use RANF instead of C C SUNIF. The argument IR thus goes away. C C C C**********************************************************************C C C C PARAMETER 0.0 < A < 1.0 ! C C C C**********************************************************************C C C C FOR DETAILS SEE: C C C C AHRENS, J.H. AND DIETER, U. C C COMPUTER METHODS FOR SAMPLING FROM GAMMA, C C BETA, POISSON AND BINOMIAL DISTRIBUTIONS. C C COMPUTING, 12 (1974), 223 - 246. C C C C (ADAPTED IMPLEMENTATION OF ALGORITHM 'GS' IN THE ABOVE PAPER) C C C C**********************************************************************C C C C INPUT: A =PARAMETER (MEAN) OF THE STANDARD GAMMA DISTRIBUTION C OUTPUT: SGAMMA = SAMPLE FROM THE GAMMA-(A)-DISTRIBUTION C C COEFFICIENTS Q(K) - FOR Q0 = SUM(Q(K)*A**(-K)) C COEFFICIENTS A(K) - FOR Q = Q0+(T*T/2)*SUM(A(K)*V**K) C COEFFICIENTS E(K) - FOR EXP(Q)-1 = SUM(E(K)*Q**K) C DATA q1,q2,q3,q4,q5,q6,q7/.04166669,.02083148,.00801191,.00144121, + -.00007388,.00024511,.00024240/ DATA a1,a2,a3,a4,a5,a6,a7/.3333333,-.2500030,.2000062,-.1662921, + .1423657,-.1367177,.1233795/ DATA e1,e2,e3,e4,e5/1.,.4999897,.1668290,.0407753,.0102930/ C C PREVIOUS A PRE-SET TO ZERO - AA IS A', AAA IS A" C SQRT32 IS THE SQUAREROOT OF 32 = 5.656854249492380 C DATA aa/0.0/,aaa/0.0/,sqrt32/5.656854/ C IF (a.EQ.aa) GO TO 10 IF (a.LT.1.0) GO TO 120 C C STEP 1: RECALCULATIONS OF S2,S,D IF A HAS CHANGED C aa = a s2 = a - 0.5 s = sqrt(s2) d = sqrt32 - 12.0*s C C STEP 2: T=STANDARD NORMAL DEVIATE, C X=(S,1/2)-NORMAL DEVIATE. C IMMEDIATE ACCEPTANCE (I) C 10 t = snorm() x = s + 0.5*t sgamma = x*x IF (t.GE.0.0) RETURN C C STEP 3: U= 0,1 -UNIFORM SAMPLE. SQUEEZE ACCEPTANCE (S) C u = ranf() IF (d*u.LE.t*t*t) RETURN C C STEP 4: RECALCULATIONS OF Q0,B,SI,C IF NECESSARY C IF (a.EQ.aaa) GO TO 40 aaa = a r = 1.0/a q0 = ((((((q7*r+q6)*r+q5)*r+q4)*r+q3)*r+q2)*r+q1)*r C C APPROXIMATION DEPENDING ON SIZE OF PARAMETER A C THE CONSTANTS IN THE EXPRESSIONS FOR B, SI AND C C WERE ESTABLISHED BY NUMERICAL EXPERIMENTS C IF (a.LE.3.686) GO TO 30 IF (a.LE.13.022) GO TO 20 C C CASE 3: A .GT. 13.022 C b = 1.77 si = .75 c = .1515/s GO TO 40 C C CASE 2: 3.686 .LT. A .LE. 13.022 C 20 b = 1.654 + .0076*s2 si = 1.68/s + .275 c = .062/s + .024 GO TO 40 C C CASE 1: A .LE. 3.686 C 30 b = .463 + s - .178*s2 si = 1.235 c = .195/s - .079 + .016*s C C STEP 5: NO QUOTIENT TEST IF X NOT POSITIVE C 40 IF (x.LE.0.0) GO TO 70 C C STEP 6: CALCULATION OF V AND QUOTIENT Q C v = t/ (s+s) IF (abs(v).LE.0.25) GO TO 50 q = q0 - s*t + 0.25*t*t + (s2+s2)*alog(1.0+v) GO TO 60 50 q = q0 + 0.5*t*t* ((((((a7*v+a6)*v+a5)*v+a4)*v+a3)*v+a2)*v+a1)*v C C STEP 7: QUOTIENT ACCEPTANCE (Q) C 60 IF (alog(1.0-u).LE.q) RETURN C C STEP 8: E=STANDARD EXPONENTIAL DEVIATE C U= 0,1 -UNIFORM DEVIATE C T=(B,SI)-DOUBLE EXPONENTIAL (LAPLACE) SAMPLE C 70 e = sexpo() u = ranf() u = u + u - 1.0 t = b + sign(si*e,u) C C STEP 9: REJECTION IF T .LT. TAU(1) = -.71874483771719 C IF (t.LT. (-.7187449)) GO TO 70 C C STEP 10: CALCULATION OF V AND QUOTIENT Q C v = t/ (s+s) IF (abs(v).LE.0.25) GO TO 80 q = q0 - s*t + 0.25*t*t + (s2+s2)*alog(1.0+v) GO TO 90 80 q = q0 + 0.5*t*t* ((((((a7*v+a6)*v+a5)*v+a4)*v+a3)*v+a2)*v+a1)*v C C STEP 11: HAT ACCEPTANCE (H) (IF Q NOT POSITIVE GO TO STEP 8) C 90 IF (q.LE.0.0) GO TO 70 IF (q.LE.0.5) GO TO 100 w = exp(q) - 1.0 GO TO 110 100 w = ((((e5*q+e4)*q+e3)*q+e2)*q+e1)*q C C IF T IS REJECTED, SAMPLE AGAIN AT STEP 8 C 110 IF (c*abs(u).GT.w*exp(e-0.5*t*t)) GO TO 70 x = s + 0.5*t sgamma = x*x RETURN C C ALTERNATE METHOD FOR PARAMETERS A BELOW 1 (.3678794=EXP(-1.)) C 120 aa = 0.0 b = 1.0 + .3678794*a 130 p = b*ranf() IF (p.GE.1.0) GO TO 140 sgamma = exp(alog(p)/a) IF (sexpo().LT.sgamma) GO TO 130 RETURN 140 sgamma = -alog((b-p)/a) IF (sexpo().LT. (1.0-a)*alog(sgamma)) GO TO 130 RETURN END octave-1.1.0/libcruft/ranlib/snorm.f100666 415 17 10734 5175267315 15565 0ustar jweusers REAL FUNCTION snorm() C**********************************************************************C C C C C C (STANDARD-) N O R M A L DISTRIBUTION C C C C C C**********************************************************************C C**********************************************************************C C C C FOR DETAILS SEE: C C C C AHRENS, J.H. AND DIETER, U. C C EXTENSIONS OF FORSYTHE'S METHOD FOR RANDOM C C SAMPLING FROM THE NORMAL DISTRIBUTION. C C MATH. COMPUT., 27,124 (OCT. 1973), 927 - 937. C C C C ALL STATEMENT NUMBERS CORRESPOND TO THE STEPS OF ALGORITHM 'FL' C C (M=5) IN THE ABOVE PAPER (SLIGHTLY MODIFIED IMPLEMENTATION) C C C C Modified by Barry W. Brown, Feb 3, 1988 to use RANF instead of C C SUNIF. The argument IR thus goes away. C C C C**********************************************************************C C DIMENSION a(32),d(31),t(31),h(31) C C THE DEFINITIONS OF THE CONSTANTS A(K), D(K), T(K) AND C H(K) ARE ACCORDING TO THE ABOVEMENTIONED ARTICLE C DATA a/0.0,.3917609E-1,.7841241E-1,.1177699,.1573107,.1970991, + .2372021,.2776904,.3186394,.3601299,.4022501,.4450965, + .4887764,.5334097,.5791322,.6260990,.6744898,.7245144, + .7764218,.8305109,.8871466,.9467818,1.009990,1.077516, + 1.150349,1.229859,1.318011,1.417797,1.534121,1.675940, + 1.862732,2.153875/ DATA d/5*0.0,.2636843,.2425085,.2255674,.2116342,.1999243, + .1899108,.1812252,.1736014,.1668419,.1607967,.1553497, + .1504094,.1459026,.1417700,.1379632,.1344418,.1311722, + .1281260,.1252791,.1226109,.1201036,.1177417,.1155119, + .1134023,.1114027,.1095039/ DATA t/.7673828E-3,.2306870E-2,.3860618E-2,.5438454E-2, + .7050699E-2,.8708396E-2,.1042357E-1,.1220953E-1,.1408125E-1, + .1605579E-1,.1815290E-1,.2039573E-1,.2281177E-1,.2543407E-1, + .2830296E-1,.3146822E-1,.3499233E-1,.3895483E-1,.4345878E-1, + .4864035E-1,.5468334E-1,.6184222E-1,.7047983E-1,.8113195E-1, + .9462444E-1,.1123001,.1364980,.1716886,.2276241,.3304980, + .5847031/ DATA h/.3920617E-1,.3932705E-1,.3950999E-1,.3975703E-1, + .4007093E-1,.4045533E-1,.4091481E-1,.4145507E-1,.4208311E-1, + .4280748E-1,.4363863E-1,.4458932E-1,.4567523E-1,.4691571E-1, + .4833487E-1,.4996298E-1,.5183859E-1,.5401138E-1,.5654656E-1, + .5953130E-1,.6308489E-1,.6737503E-1,.7264544E-1,.7926471E-1, + .8781922E-1,.9930398E-1,.1155599,.1404344,.1836142,.2790016, + .7010474/ C 10 u = ranf() s = 0.0 IF (u.GT.0.5) s = 1.0 u = u + u - s 20 u = 32.0*u i = int(u) IF (i.EQ.32) i = 31 IF (i.EQ.0) GO TO 100 C C START CENTER C 30 ustar = u - float(i) aa = a(i) 40 IF (ustar.LE.t(i)) GO TO 60 w = (ustar-t(i))*h(i) C C EXIT (BOTH CASES) C 50 y = aa + w snorm = y IF (s.EQ.1.0) snorm = -y RETURN C C CENTER CONTINUED C 60 u = ranf() w = u* (a(i+1)-aa) tt = (0.5*w+aa)*w GO TO 80 70 tt = u ustar = ranf() 80 IF (ustar.GT.tt) GO TO 50 90 u = ranf() IF (ustar.GE.u) GO TO 70 ustar = ranf() GO TO 40 C C START TAIL C 100 i = 6 aa = a(32) GO TO 120 110 aa = aa + d(i) i = i + 1 120 u = u + u IF (u.LT.1.0) GO TO 110 130 u = u - 1.0 140 w = u*d(i) tt = (0.5*w+aa)*w GO TO 160 150 tt = u 160 ustar = ranf() IF (ustar.GT.tt) GO TO 50 170 u = ranf() IF (ustar.GE.u) GO TO 150 u = ranf() GO TO 140 END octave-1.1.0/libcruft/ranlib/wrap.f100666 415 17 461 5276375664 15345 0ustar jweusers subroutine dgennor (av, sd, result) double precision av, sd, result result = gennor (real (av), real (sd)) return end subroutine dgenunf (low, high, result) double precision low, high, result result = genunf (real (low), real (high)) return end octave-1.1.0/libcruft/ranlib/README100666 415 17 16667 5175267217 15154 0ustar jweusers RANLIB Library of Fortran Routines for Random Number Generation README Compiled and Written by: Barry W. Brown James Lovato Department of Biomathematics, Box 237 The University of Texas, M.D. Anderson Cancer Center 1515 Holcombe Boulevard Houston, TX 77030 This work was supported by grant CA-16672 from the National Cancer Institute. SUMMARY OF RANLIB The bottom level routines provide 32 virtual random number generators. Each generator can provide 1,048,576 blocks of numbers, and each block is of length 1,073,741,824. Any generator can be set to the beginning or end of the current block or to its starting value. Packaging is provided so that if these capabilities are not needed, a single generator with period 2.3 X 10^18 is seen. Using this base, routines are provided that return: (1) Beta random deviates (2) Chi-square random deviates (3) Exponential random deviates (4) F random deviates (5) Gamma random deviates (6) Multivariate normal random deviates (mean and covariance matrix specified) (7) Noncentral chi-square random deviates (8) Noncentral F random deviates (9) Univariate normal random deviates (10) Random permutations of an integer array (11) Real uniform random deviates between specified limits (12) Binomial random deviates (13) Poisson random deviates (14) Integer uniform deviates between specified limits (15) Seeds for the random number generator calculated from a character string INSTALLATION Directory src contains the Fortran source for most of the routines. Directory linpack contains two linpack routines needed by the multivariate generator. If linpack is present on your machine, you won't need these routines. The Fortran code from these directories should be compiled and placed in a library. Directory test contains three test programs for this code. DOCUMENTATION Documentation is on directory doc on the distribution. All of the documentation is in the form of character (ASCII) files. An explanation of the concepts involved in the base generator and details of its implementation are contained in Basegen.doc. A summary of all of the available routines is contained in ranlib.chs (chs is an abbreviation of 'cheat sheet'). The 'chs' file will probably be the reference to ranlib that is primarily used. The file, ranlib.fdoc, contains all comments heading each routine. There is somewhat more information in 'fdoc' than 'chs', but the additional information consists primarily of references to the literature. SOURCES The following routines, which were written by others and lightly modified for consistency in packaging, are included in RANLIB. Bottom Level Routines These routines are a transliteration of the Pascal in the reference to Fortran. L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package with Splitting Facilities." ACM Transactions on Mathematical Software, 17:98-111 (1991) Exponential This code was obtained from Netlib. Ahrens, J.H. and Dieter, U. Computer Methods for Sampling From the Exponential and Normal Distributions. Comm. ACM, 15,10 (Oct. 1972), 873 - 882. Gamma (Case R >= 1.0) Ahrens, J.H. and Dieter, U. Generating Gamma Variates by a Modified Rejection Technique. Comm. ACM, 25,1 (Jan. 1982), 47 - 54. Algorithm GD (Case 0.0 <= R <= 1.0) Ahrens, J.H. and Dieter, U. Computer Methods for Sampling from Gamma, Beta, Poisson and Binomial Distributions. Computing, 12 (1974), 223-246. Adaptation of algorithm GS. Normal This code was obtained from netlib. Ahrens, J.H. and Dieter, U. Extensions of Forsythe's Method for Random Sampling from the Normal Distribution. Math. Comput., 27,124 (Oct. 1973), 927 - 937. Binomial This code was kindly sent me by Dr. Kachitvichyanukul. Kachitvichyanukul, V. and Schmeiser, B. W. Binomial Random Variate Generation. Communications of the ACM, 31, 2 (February, 1988) 216. Poisson This code was obtained from netlib. Ahrens, J.H. and Dieter, U. Computer Generation of Poisson Deviates From Modified Normal Distributions. ACM Trans. Math. Software, 8, 2 (June 1982),163-179 Beta This code was written by us following the recipe in the following. R. C. H. Cheng Generating Beta Variables with Nonintegral Shape Parameters. Communications of the ACM, 21:317-322 (1978) (Algorithms BB and BC) Linpack Routines SPOFA and SDOT are used to perform the Cholesky decomposition of the covariance matrix in SETGMN (used for the generation of multivariate normal deviates). Dongarra, J. J., Moler, C. B., Bunch, J. R. and Stewart, G. W. Linpack User's Guide. SIAM Press, Philadelphia. (1979) LEGALITIES Code that appeared in an ACM publication is subject to their algorithms policy: Submittal of an algorithm for publication in one of the ACM Transactions implies that unrestricted use of the algorithm within a computer is permissible. General permission to copy and distribute the algorithm without fee is granted provided that the copies are not made or distributed for direct commercial advantage. The ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. Krogh, F. Algorithms Policy. ACM Tran. Math. Softw. 13(1987), 183-186. We place the Ranlib code that we have written in the public domain. NO WARRANTY WE PROVIDE ABSOLUTELY NO 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 THIS PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS OR ANY OF ITS COMPONENT INSTITUTIONS INCLUDING M. D. ANDERSON HOSPITAL BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY LOST PROFITS, LOST MONIES, OR OTHER SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA OR ITS ANALYSIS BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY THIRD PARTIES) THE PROGRAM. (Above NO WARRANTY modified from the GNU NO WARRANTY statement.) octave-1.1.0/libcruft/ranlib/ranlib.chs100666 415 17 27515 5175267234 16233 0ustar jweusers SUMMARY OF ROUTINES IN RANLIB 0. Base Level Routines to Set and Obtain Values of Seeds (These should be the only base level routines used by those who don't need multiple generators with blocks of numbers.) C********************************************************************** C C SUBROUTINE SETALL(ISEED1,ISEED2) C SET ALL random number generators C INTEGER ISEED1, ISEED2 C C********************************************************************** C********************************************************************** C C SUBROUTINE GETSD(ISEED1,ISEED2) C GET SeeD C INTEGER ISEED1, ISEED2 C C Returns the value of two integer seeds of the current generator C in ISEED1, ISEED2 C C********************************************************************** I. Higher Level Routines C********************************************************************** C C REAL FUNCTION GENBET( A, B ) C GeNerate BETa random deviate C REAL A,B C C Returns a single random deviate from the beta distribution with C parameters A and B. The density of the beta is C x^(a-1) * (1-x)^(b-1) / B(a,b) for 0 < x < 1 C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENCHI( DF ) C Generate random value of CHIsquare variable C REAL DF C C Generates random deviate from the distribution of a chisquare C with DF degrees of freedom random variable. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENEXP( AV ) C GENerate EXPonential random deviate C REAL AV C C Generates a single random deviate from an exponential C distribution with mean AV. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENF( DFN, DFD ) C GENerate random deviate from the F distribution C REAL DFN, DFD C C Generates a random deviate from the F (variance ratio) C distribution with DFN degrees of freedom in the numerator C and DFD degrees of freedom in the denominator. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENGAM( A, R ) C GENerates random deviates from GAMma distribution C REAL A, R C C Generates random deviates from the gamma distribution whose C density is C (A**R)/Gamma(R) * X**(R-1) * Exp(-A*X) C C********************************************************************** C********************************************************************** C C SUBROUTINE GENMN(PARM,X,WORK) C GENerate Multivariate Normal random deviate C REAL PARM(*), X(*), WORK(*) C C PARM is set by SETGMN which must be called prior to GENMN. The C generated deviates are placed in X. WORK is a work array of the C same size as X. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNCH( DF, XNONC ) C Generate random value of Noncentral CHIsquare variable C REAL DF, XNONC C C Generates random deviate from the distribution of a noncentral C chisquare with DF degrees of freedom and noncentrality parameter C XNONC. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNF( DFN, DFD, XNONC ) C GENerate random deviate from the Noncentral F distribution C REAL DFN, DFD, XNONC C C Generates a random deviate from the noncentral F (variance ratio) C distribution with DFN degrees of freedom in the numerator, and DFD C degrees of freedom in the denominator, and noncentrality parameter C XNONC. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNOR( AV, SD ) C GENerate random deviate from a NORmal distribution C REAL AV, SD C C Generates a single random deviate from a normal distribution C with mean, AV, and standard deviation, SD. C C********************************************************************** C********************************************************************** C C SUBROUTINE GENPRM( IARRAY, LARRAY ) C GENerate random PeRMutation of iarray C INTEGER IARRAY(LARRAY), LARRAY C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENUNF( LOW, HIGH ) C GeNerate Uniform Real between LOW and HIGH C REAL LOW, HIGH C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNBIN( N, P ) C GENerate BINomial random deviate C INTEGER N C REAL P C C Returns a single random deviate from a binomial C distribution whose number of trials is N and whose C probability of an event in each trial is P. C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNPOI( AV ) C GENerate POIsson random deviate C REAL AV C C Generates a single random deviate from a Poisson C distribution with mean AV. C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNUIN( LOW, HIGH ) C GeNerate Uniform INteger C INTEGER LOW, HIGH C C Generates an integer uniformly distributed between LOW and HIGH. C C********************************************************************** C********************************************************************** C C SUBROUTINE PHRTSD( PHRASE, SEED1, SEED2 ) C PHRase To SeeDs C CHARACTER*(*) PHRASE C INTEGER SEED1, SEED2 C C Uses a phrase (character string) to generate two seeds for the RGN C random number generator. C C********************************************************************** C********************************************************************** C C REAL FUNCTION RANF() C RANDom number generator as a Function C C Returns a random floating point number from a uniform distribution C over 0 - 1 (endpoints of this interval are not returned) using the C current generator C C********************************************************************** C********************************************************************** C C SUBROUTINE SETGMN( MEANV, COVM, P, PARM) C SET Generate Multivariate Normal random deviate C INTEGER P C REAL MEANV(P), COVM(P,P), PARM(P*(P+3)/2 + 1) C C P is the length of normal vectors to be generated, MEANV C is the vector of their means and COVM is their variance C covariance matrix. Places information necessary to generate C the deviates in PARM. C C********************************************************************** II. Uniform Generator and Associated Routines A. SETTING THE SEED OF ALL GENERATORS C********************************************************************** C C SUBROUTINE SETALL(ISEED1,ISEED2) C SET ALL random number generators C INTEGER ISEED1, ISEED2 C C********************************************************************** B. OBTAINING RANDOM NUMBERS C********************************************************************** C C INTEGER FUNCTION IGNLGI() C GeNerate LarGe Integer C C Returns a random integer following a uniform distribution over C (1, 2147483562) using the current generator. C C********************************************************************** C********************************************************************** C C REAL FUNCTION RANF() C RANDom number generator as a Function C C Returns a random floating point number from a uniform distribution C over 0 - 1 (endpoints of this interval are not returned) using the C current generator C C********************************************************************** C. SETTING AND OBTAINING THE NUMBER OF THE CURRENT GENERATOR C********************************************************************** C C SUBROUTINE SETCGN( G ) C Set GeNerator C INTEGER G C C Sets the current generator to G. All references to a generator C are to the current generator. C C********************************************************************** C********************************************************************** C C SUBROUTINE GETCGN(G) C GET Current GeNerator C INTEGER G C C Returns in G the number of the current random number generator C C********************************************************************** D. OBTAINING OR CHANGING SEEDS IN CURRENT GENERATOR C********************************************************************** C C SUBROUTINE ADVNST(K) C ADV-a-N-ce ST-ate C INTEGER K C C Advances the state of the current generator by 2^K values and C resets the initial seed to that value. C C********************************************************************** C********************************************************************** C C SUBROUTINE GETSD(ISEED1,ISEED2) C GET SeeD C INTEGER ISEED1, ISEED2 C C Returns the value of two integer seeds of the current generator C in ISEED1, ISEED2 C C********************************************************************** C********************************************************************** C C SUBROUTINE INITGN(ISDTYP) C INIT-ialize current G-e-N-erator C C INTEGER ISDTYP The state to which the generator is to be set C ISDTYP = -1 => sets the seeds to their initial value C ISDTYP = 0 => sets the seeds to the first value of C the current block C ISDTYP = 1 => sets the seeds to the first value of C the next block C C********************************************************************** C********************************************************************** C C SUBROUTINE SETSD(ISEED1,ISEED2) C SET S-ee-D of current generator C C Resets the initial seed of the current generator to ISEED1 and C ISEED2. The seeds of the other generators remain unchanged. C C********************************************************************** E. MISCELLANY C********************************************************************** C C INTEGER FUNCTION MLTMOD(A,S,M) C Returns (A*S) MOD M C INTEGER A, S, M C C********************************************************************** C********************************************************************** C C SUBROUTINE SETANT(QVALUE) C SET ANTithetic C LOGICAL QVALUE C C Sets whether the current generator produces antithetic values. If C X is the value normally returned from a uniform [0,1] random C number generator then 1 - X is the antithetic value. If X is the C value normally returned from a uniform [0,N] random number C generator then N - 1 - X is the antithetic value. C C All generators are initialized to NOT generate antithetic values. C C********************************************************************** octave-1.1.0/libcruft/ranlib/ranlib.fdoc100666 415 17 167233 5175267234 16413 0ustar jweusers RANLIB Library of Fortran Routines for Random Number Generation Full Documentation of Each Routine Compiled and Written by: Barry W. Brown James Lovato Department of Biomathematics, Box 237 The University of Texas, M.D. Anderson Cancer Center 1515 Holcombe Boulevard Houston, TX 77030 This work was supported by grant CA-16672 from the National Cancer Institute. C********************************************************************** C C SUBROUTINE ADVNST(K) C ADV-a-N-ce ST-ate C C Advances the state of the current generator by 2^K values and C resets the initial seed to that value. C C This is a transcription from Pascal to Fortran of routine C Advance_State from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C K -> The generator is advanced by2^K values C INTEGER K C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENBET( A, B ) C GeNerate BETa random deviate C C C Function C C C Returns a single random deviate from the beta distribution with C parameters A and B. The density of the beta is C x^(a-1) * (1-x)^(b-1) / B(a,b) for 0 < x < 1 C C C Arguments C C C A --> First parameter of the beta distribution C REAL A C C B --> Second parameter of the beta distribution C REAL B C C C Method C C C R. C. H. Cheng C Generating Beta Variables with Nonintegral Shape Parameters C Communications of the ACM, 21:317-322 (1978) C (Algorithms BB and BC) C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENCHI( DF ) C Generate random value of CHIsquare variable C C C Function C C C Generates random deviate from the distribution of a chisquare C with DF degrees of freedom random variable. C C C Arguments C C C DF --> Degrees of freedom of the chisquare C (Must be positive) C REAL DF C C C Method C C C Uses relation between chisquare and gamma. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENEXP( AV ) C C GENerate EXPonential random deviate C C C Function C C C Generates a single random deviate from an exponential C distribution with mean AV. C C C Arguments C C C AV --> The mean of the exponential distribution from which C a random deviate is to be generated. C REAL AV C C GENEXP <-- The random deviate. C REAL GENEXP C C C Method C C C Renames SEXPO from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C C Ahrens, J.H. and Dieter, U. C Computer Methods for Sampling From the C Exponential and Normal Distributions. C Comm. ACM, 15,10 (Oct. 1972), 873 - 882. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENF( DFN, DFD ) C GENerate random deviate from the F distribution C C C Function C C C Generates a random deviate from the F (variance ratio) C distribution with DFN degrees of freedom in the numerator C and DFD degrees of freedom in the denominator. C C C Arguments C C C DFN --> Numerator degrees of freedom C (Must be positive) C REAL DFN C DFD --> Denominator degrees of freedom C (Must be positive) C REAL DFD C C C Method C C C Directly generates ratio of chisquare variates C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENGAM( A, R ) C GENerates random deviates from GAMma distribution C C C Function C C C Generates random deviates from the gamma distribution whose C density is C (A**R)/Gamma(R) * X**(R-1) * Exp(-A*X) C C C Arguments C C C A --> Location parameter of Gamma distribution C REAL A C C R --> Shape parameter of Gamma distribution C REAL R C C C Method C C C Renames SGAMMA from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C (Case R >= 1.0) C Ahrens, J.H. and Dieter, U. C Generating Gamma Variates by a C Modified Rejection Technique. C Comm. ACM, 25,1 (Jan. 1982), 47 - 54. C Algorithm GD C C (Case 0.0 <= R <= 1.0) C Ahrens, J.H. and Dieter, U. C Computer Methods for Sampling from Gamma, C Beta, Poisson and Binomial Distributions. C Computing, 12 (1974), 223-246/ C Adapted algorithm GS. C C********************************************************************** C********************************************************************** C C SUBROUTINE GENMN(PARM,X,WORK) C GENerate Multivariate Normal random deviate C C C Arguments C C C PARM --> Parameters needed to generate multivariate normal C deviates (MEANV and Cholesky decomposition of C COVM). Set by a previous call to SETGMN. C C 1 : 1 - size of deviate, P C 2 : P + 1 - mean vector C P+2 : P*(P+3)/2 + 1 - upper half of cholesky C decomposition of cov matrix C REAL PARM(*) C C X <-- Vector deviate generated. C REAL X(P) C C WORK <--> Scratch array C REAL WORK(P) C C C Method C C C 1) Generate P independent standard normal deviates - Ei ~ N(0,1) C C 2) SETGMN uses Cholesky decomposition find A s.t. trans(A)*A = COV C C 3) Generate trans(A)*E + MEANV ~ N(MEANV,COVM) C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNCH( DF, XNONC ) C Generate random value of Noncentral CHIsquare variable C C C Function C C C Generates random deviate from the distribution of a noncentral C chisquare with DF degrees of freedom and noncentrality parameter C XNONC. C C C Arguments C C C DF --> Degrees of freedom of the chisquare C (Must be > 1.0) C REAL DF C C XNONC --> Noncentrality parameter of the chisquare C (Must be >= 0.0) C REAL XNONC C C C Method C C C Uses fact that noncentral chisquare is the sum of a chisquare C deviate with DF-1 degrees of freedom plus the square of a normal C deviate with mean XNONC and standard deviation 1. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNF( DFN, DFD, XNONC ) C GENerate random deviate from the Noncentral F distribution C C C Function C C C Generates a random deviate from the noncentral F (variance ratio) C distribution with DFN degrees of freedom in the numerator, and DFD C degrees of freedom in the denominator, and noncentrality parameter C XNONC. C C C Arguments C C C DFN --> Numerator degrees of freedom C (Must be >= 1.0) C REAL DFN C DFD --> Denominator degrees of freedom C (Must be positive) C REAL DFD C C XNONC --> Noncentrality parameter C (Must be nonnegative) C REAL XNONC C C C Method C C C Directly generates ratio of noncentral numerator chisquare variate C to central denominator chisquare variate. C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENNOR( AV, SD ) C C GENerate random deviate from a NORmal distribution C C C Function C C C Generates a single random deviate from a normal distribution C with mean, AV, and standard deviation, SD. C C C Arguments C C C AV --> Mean of the normal distribution. C REAL AV C C SD --> Standard deviation of the normal distribution. C REAL SD C C GENNOR <-- Generated normal deviate. C REAL GENNOR C C C Method C C C Renames SNORM from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C Ahrens, J.H. and Dieter, U. C Extensions of Forsythe's Method for Random C Sampling from the Normal Distribution. C Math. Comput., 27,124 (Oct. 1973), 927 - 937. C C C********************************************************************** C********************************************************************** C C SUBROUTINE GENPRM( IARRAY, LARRAY ) C GENerate random PeRMutation of iarray C C C Arguments C C C IARRAY <--> On output IARRAY is a random permutation of its C value on input C INTEGER IARRAY( LARRAY ) C C LARRAY <--> Length of IARRAY C INTEGER LARRAY C C********************************************************************** C********************************************************************** C C REAL FUNCTION GENUNF( LOW, HIGH ) C C GeNerate Uniform Real between LOW and HIGH C C C Function C C C Generates a real uniformly distributed between LOW and HIGH. C C C Arguments C C C LOW --> Low bound (exclusive) on real value to be generated C REAL LOW C C HIGH --> High bound (exclusive) on real value to be generated C REAL HIGH C C********************************************************************** C********************************************************************** C C SUBROUTINE GETCGN(G) C Get GeNerator C C Returns in G the number of the current random number generator C C C Arguments C C C G <-- Number of the current random number generator (1..32) C INTEGER G C C********************************************************************** C********************************************************************** C C SUBROUTINE GETSD(ISEED1,ISEED2) C GET SeeD C C Returns the value of two integer seeds of the current generator C C This is a transcription from Pascal to Fortran of routine C Get_State from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C C ISEED1 <- First integer seed of generator G C INTEGER ISEED1 C C ISEED2 <- Second integer seed of generator G C INTEGER ISEED1 C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNBIN( N, P ) C C GENerate BINomial random deviate C C C Function C C C Generates a single random deviate from a binomial C distribution whose number of trials is N and whose C probability of an event in each trial is P. C C C Arguments C C C N --> The number of trials in the binomial distribution C from which a random deviate is to be generated. C INTEGER N C C P --> The probability of an event in each trial of the C binomial distribution from which a random deviate C is to be generated. C REAL P C C IGNBIN <-- A random deviate yielding the number of events C from N independent trials, each of which has C a probability of event P. C INTEGER IGNBIN C C C Note C C C Uses RANF so the value of the seeds, ISEED1 and ISEED2 must be set C by a call similar to the following C DUM = RANSET( ISEED1, ISEED2 ) C C C Method C C C This is algorithm BTPE from: C C Kachitvichyanukul, V. and Schmeiser, B. W. C C Binomial Random Variate Generation. C Communications of the ACM, 31, 2 C (February, 1988) 216. C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNLGI() C GeNerate LarGe Integer C C Returns a random integer following a uniform distribution over C (1, 2147483562) using the current generator. C C This is a transcription from Pascal to Fortran of routine C Random from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNPOI( AV ) C C GENerate POIsson random deviate C C C Function C C C Generates a single random deviate from a Poisson C distribution with mean AV. C C C Arguments C C C AV --> The mean of the Poisson distribution from which C a random deviate is to be generated. C REAL AV C C GENEXP <-- The random deviate. C REAL GENEXP C C C Method C C C Renames KPOIS from TOMS as slightly modified by BWB to use RANF C instead of SUNIF. C C For details see: C C Ahrens, J.H. and Dieter, U. C Computer Generation of Poisson Deviates C From Modified Normal Distributions. C ACM Trans. Math. Software, 8, 2 C (June 1982),163-179 C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION IGNUIN( LOW, HIGH ) C C GeNerate Uniform INteger C C C Function C C C Generates an integer uniformly distributed between LOW and HIGH. C C C Arguments C C C LOW --> Low bound (inclusive) on integer value to be generated C INTEGER LOW C C HIGH --> High bound (inclusive) on integer value to be generated C INTEGER HIGH C C C Note C C C If (HIGH-LOW) > 2,147,483,561 prints error message on * unit and C stops the program. C C********************************************************************** C********************************************************************** C C SUBROUTINE INITGN(ISDTYP) C INIT-ialize current G-e-N-erator C C Reinitializes the state of the current generator C ISDTYP = -1 => sets the state to its initial seed C ISDTYP = 0 => sets the state to its last (previous) seed C ISDTYP = 1 => sets the state to a new seed 2^w values C from its last seed C C This is a transcription from Pascal to Fortran of routine C Init_Generator from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISDTYP -> The state to which the generator is to be set C C INTEGER ISDTYP C C********************************************************************** C********************************************************************** C C SUBROUTINE INRGCM() C INitialize Random number Generator CoMmon C C C Function C C C Initializes common area for random number generator. This saves C the nuisance of a BLOCK DATA routine and the difficulty of C assuring that the routine is loaded with the other routines. C C********************************************************************** C********************************************************************** C C INTEGER FUNCTION MLTMOD(A,S,M) C C Returns (A*S) MOD M C C This is a transcription from Pascal to Fortran of routine C MULtMod_Decompos from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C A, S, M --> C INTEGER A,S,M C C********************************************************************** C********************************************************************** C C SUBROUTINE PHRTSD( PHRASE, SEED1, SEED2 ) C PHRase To SeeDs C C C Function C C C Uses a phrase (character string) to generate two seeds for the RGN C random number generator. C C C Arguments C C C PHRASE --> Phrase to be used for random number generation C CHARACTER*(*) PHRASE C C SEED1 <-- First seed for RGN generator C INTEGER SEED1 C C SEED2 <-- Second seed for RGN generator C INTEGER SEED2 C C C Note C C C Trailing blanks are eliminated before the seeds are generated. C C Generated seed values will fall in the range 1..2^30 C (1..1,073,741,824) C C********************************************************************** C********************************************************************** C C REAL FUNCTION RANF() C RANDom number generator as a Function C C Returns a random floating point number from a uniform distribution C over 0 - 1 (endpoints of this interval are not returned) using the C current generator C C This is a transcription from Pascal to Fortran of routine C Uniform_01 from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C********************************************************************** C********************************************************************** C C SUBROUTINE SETALL(ISEED1,ISEED2) C SET ALL random number generators C C Sets the initial seed of generator 1 to ISEED1 and ISEED2. The C initial seeds of the other generators are set accordingly, and C all generators states are set to these seeds. C C This is a transcription from Pascal to Fortran of routine C Set_Initial_Seed from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISEED1 -> First of two integer seeds C INTEGER ISEED1 C C ISEED2 -> Second of two integer seeds C INTEGER ISEED1 C C********************************************************************** C********************************************************************** C C SUBROUTINE SETANT(QVALUE) C SET ANTithetic C C Sets whether the current generator produces antithetic values. If C X is the value normally returned from a uniform [0,1] random C number generator then 1 - X is the antithetic value. If X is the C value normally returned from a uniform [0,N] random number C generator then N - 1 - X is the antithetic value. C C All generators are initialized to NOT generate antithetic values. C C This is a transcription from Pascal to Fortran of routine C Set_Antithetic from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C QVALUE -> .TRUE. if generator G is to generating antithetic C values, otherwise .FALSE. C LOGICAL QVALUE C C********************************************************************** C********************************************************************** C C SUBROUTINE SETCGN( G ) C Set GeNerator C C Sets the current generator to G. All references to a generato C are to the current generator. C C C Arguments C C C G --> Number of the current random number generator (1..32) C INTEGER G C C********************************************************************** C********************************************************************** C C SUBROUTINE SETGMN( MEANV, COVM, P, PARM) C SET Generate Multivariate Normal random deviate C C C Function C C C Places P, MEANV, and the Cholesky factoriztion of COVM C in GENMN. C C C Arguments C C C MEANV --> Mean vector of multivariate normal distribution. C REAL MEANV(P) C C COVM <--> (Input) Covariance matrix of the multivariate C normal distribution C (Output) Destroyed on output C REAL COVM(P,P) C C P --> Dimension of the normal, or length of MEANV. C INTEGER P C C PARM <-- Array of parameters needed to generate multivariate norma C deviates (P, MEANV and Cholesky decomposition of C COVM). C 1 : 1 - P C 2 : P + 1 - MEANV C P+2 : P*(P+3)/2 + 1 - Cholesky decomposition of COVM C REAL PARM(P*(P+3)/2 + 1) C C********************************************************************** C********************************************************************** C C SUBROUTINE SETSD(ISEED1,ISEED2) C SET S-ee-D of current generator C C Resets the initial seed and state of generator g to ISEED1 and C ISEED2. The seeds and states of the other generators remain C unchanged. C C This is a transcription from Pascal to Fortran of routine C Set_Seed from the paper C C L'Ecuyer, P. and Cote, S. "Implementing a Random Number Package C with Splitting Facilities." ACM Transactions on Mathematical C Software, 17:98-111 (1991) C C C Arguments C C C ISEED1 -> First integer seed C INTEGER ISEED1 C C ISEED2 -> Second integer seed C INTEGER ISEED1 C C********************************************************************** octave-1.1.0/libcruft/ranlib/tstbot.for100666 415 17 5122 5077646151 16262 0ustar jweusers PROGRAM tstbot C********************************************************************** C C A test program for the bottom level routines C C********************************************************************** C Set up the random number generator C .. Local Scalars .. INTEGER ians,iblock,igen,iseed1,iseed2,itmp,ix,ixgen,nbad C .. C .. Local Arrays .. INTEGER answer(10000),genlst(5) C .. C .. External Functions .. INTEGER ignlgi EXTERNAL ignlgi C .. C .. External Subroutines .. EXTERNAL getsd,initgn,setall,setcgn C .. C .. Data statements .. DATA genlst/1,5,10,20,32/ C .. C .. Executable Statements .. nbad = 0 WRITE (*,9000) 9000 FORMAT (' For five virual generators of the 32'/ + ' This test generates 10000 numbers then resets the block'/ + ' and does it again'/ + ' Any disagreements are reported -- there should be none'/) C C Set up Generators C CALL setall(12345,54321) C C For a selected set of generators C DO 60,ixgen = 1,5 igen = genlst(ixgen) CALL setcgn(igen) WRITE (*,*) ' Testing generator ',igen C C Use 10 blocks C CALL initgn(-1) CALL getsd(iseed1,iseed2) DO 20,iblock = 1,10 C C Generate 1000 numbers C DO 10,ians = 1,1000 ix = ians + (iblock-1)*1000 answer(ix) = ignlgi() 10 CONTINUE CALL initgn(+1) 20 CONTINUE CALL initgn(-1) C C Do it again and compare answers C CALL getsd(iseed1,iseed2) C C Use 10 blocks C DO 50,iblock = 1,10 C C Generate 1000 numbers C DO 40,ians = 1,1000 ix = ians + (iblock-1)*1000 C ANSWER( IX ) = IGNLGI() itmp = ignlgi() IF (.NOT. (itmp.NE.answer(ix))) GO TO 30 WRITE (*,9010) iblock,ians,ix,answer(ix),itmp 9010 FORMAT (' Disagreement on regeneration of numbers'/ + ' Block ',I2,' N within Block ',I2, + ' Index in answer ',I5/ + ' Originally Generated ',I10,' Regenerated ', + I10) nbad = nbad + 1 IF (nbad.GT.10) STOP ' More than 10 mismatches' 30 CONTINUE 40 CONTINUE CALL initgn(+1) 50 CONTINUE WRITE (*,*) ' Finished testing generator ',igen WRITE (*,*) ' Test completed successfully' 60 CONTINUE STOP END octave-1.1.0/libcruft/ranlib/tstgmn.for100666 415 17 11417 5077646151 16303 0ustar jweusers REAL FUNCTION covar(x,y,n) C .. Scalar Arguments .. INTEGER n C .. C .. Array Arguments .. REAL x(n),y(n) C .. C .. Local Scalars .. REAL avx,avy,varx,vary,xmax,xmin INTEGER i C .. C .. External Subroutines .. EXTERNAL stat C .. C .. Intrinsic Functions .. INTRINSIC real C .. C .. Executable Statements .. CALL stat(x,n,avx,varx,xmin,xmax) CALL stat(y,n,avy,vary,xmin,xmax) covar = 0.0 DO 10,i = 1,n covar = covar + (x(i)-avx)* (y(i)-avy) 10 CONTINUE covar = covar/real(n-1) RETURN END SUBROUTINE prcomp(p,mean,xcovar,answer) INTEGER p,maxp PARAMETER (maxp=10) REAL mean(p),xcovar(p,p),rcovar(maxp,maxp) REAL answer(1000,maxp) REAL rmean(maxp),rvar(maxp) INTEGER maxobs PARAMETER (maxobs=1000) DO 10,i = 1,p CALL stat(answer(1,i),maxobs,rmean(i),rvar(i),dum1,dum2) WRITE (*,*) ' Variable Number',i WRITE (*,*) ' Mean ',mean(i),' Generated ',rmean(i) WRITE (*,*) ' Variance ',xcovar(i,i),' Generated',rvar(i) 10 CONTINUE WRITE (*,*) ' Covariances' DO 30,i = 1,p DO 20,j = 1,i - 1 WRITE (*,*) ' I = ',i,' J = ',j rcovar(i,j) = covar(answer(1,i),answer(1,j),maxobs) WRITE (*,*) ' Covariance ',xcovar(i,j),' Generated ', + rcovar(i,j) 20 CONTINUE 30 CONTINUE RETURN END SUBROUTINE setcov(p,var,corr,covar) C Set covariance matrix from variance and common correlation C .. Scalar Arguments .. REAL corr INTEGER p C .. C .. Array Arguments .. REAL covar(p,p),var(p) C .. C .. Local Scalars .. INTEGER i,j C .. C .. Intrinsic Functions .. INTRINSIC sqrt C .. C .. Executable Statements .. DO 40,i = 1,p DO 30,j = 1,p IF (.NOT. (i.EQ.j)) GO TO 10 covar(i,j) = var(i) GO TO 20 10 covar(i,j) = corr*sqrt(var(i)*var(j)) 20 CONTINUE 30 CONTINUE 40 CONTINUE RETURN END SUBROUTINE stat(x,n,av,var,xmin,xmax) C .. Scalar Arguments .. REAL av,var,xmax,xmin INTEGER n C .. C .. Array Arguments .. REAL x(n) C .. C .. Local Scalars .. REAL sum INTEGER i C .. C .. Intrinsic Functions .. INTRINSIC real C .. C .. Executable Statements .. xmin = x(1) xmax = x(1) sum = 0.0 DO 10,i = 1,n sum = sum + x(i) IF (x(i).LT.xmin) xmin = x(i) IF (x(i).GT.xmax) xmax = x(i) 10 CONTINUE av = sum/real(n) sum = 0.0 DO 20,i = 1,n sum = sum + (x(i)-av)**2 20 CONTINUE var = sum/real(n-1) RETURN END PROGRAM tstgmn C Test Generation of Multivariate Normal Data C .. Parameters .. INTEGER maxp PARAMETER (maxp=10) INTEGER maxobs PARAMETER (maxobs=1000) INTEGER p2 PARAMETER (p2=maxp*maxp) C .. C .. Local Scalars .. REAL corr INTEGER i,iobs,is1,is2,j,p CHARACTER phrase*100 C .. C .. Local Arrays .. REAL answer(1000,maxp),ccovar(p2),covar(p2),mean(maxp),param(500), + temp(maxp),var(maxp),work(maxp) C .. C .. External Subroutines .. EXTERNAL genmn,phrtsd,prcomp,setall,setcov,setgmn C .. C .. Executable Statements .. WRITE (*,9000) 9000 FORMAT ( + ' Tests Multivariate Normal Generator for Up to 10 Variables' + / + ' User inputs means, variances, one correlation that is applied' + /' to all pairs of variables'/ + ' 1000 multivariate normal deviates are generated'/ + ' Means, variances and covariances are calculated for these.' + ) 10 WRITE (*,*) 'Enter number of variables for normal generator' READ (*,*) p WRITE (*,*) 'Enter mean vector of length ',p READ (*,*) (mean(i),i=1,p) WRITE (*,*) 'Enter variance vector of length ',p READ (*,*) (var(i),i=1,p) WRITE (*,*) 'Enter correlation of all variables' READ (*,*) corr CALL setcov(p,var,corr,covar) WRITE (*,*) ' Enter phrase to initialize rn generator' READ (*,'(a)') phrase CALL phrtsd(phrase,is1,is2) CALL setall(is1,is2) DO 20,i = 1,p2 ccovar(i) = covar(i) 20 CONTINUE C C Generate Variables C CALL setgmn(mean,ccovar,p,param) DO 40,iobs = 1,maxobs CALL genmn(param,work,temp) DO 30,j = 1,p answer(iobs,j) = work(j) 30 CONTINUE 40 CONTINUE CALL prcomp(p,mean,covar,answer) C C Print Comparison of Generated and Reconstructed Values C GO TO 10 END octave-1.1.0/libcruft/ranlib/tstmid.for100666 415 17 30523 5077646151 16272 0ustar jweusers SUBROUTINE stat(x,n,av,var,xmin,xmax) C********************************************************************** C C SUBROUTINE STAT( X, N, AV, VAR) C C compute STATistics C C C Function C C C Computes AVerage and VARiance of array X(N). C C********************************************************************** C .. Scalar Arguments .. REAL av,var,xmax,xmin INTEGER n C .. C .. Array Arguments .. REAL x(n) C .. C .. Local Scalars .. REAL sum INTEGER i C .. C .. Intrinsic Functions .. INTRINSIC real C .. C .. Executable Statements .. xmin = x(1) xmax = x(1) sum = 0.0 DO 10,i = 1,n sum = sum + x(i) IF (x(i).LT.xmin) xmin = x(i) IF (x(i).GT.xmax) xmax = x(i) 10 CONTINUE av = sum/real(n) sum = 0.0 DO 20,i = 1,n sum = sum + (x(i)-av)**2 20 CONTINUE var = sum/real(n-1) RETURN END PROGRAM tstall IMPLICIT LOGICAL (q) C Interactive test for PHRTSD C .. Parameters .. INTEGER mxwh PARAMETER (mxwh=10) C .. C .. Local Scalars .. REAL av,avtr,var,vartr,xmin,xmax INTEGER i,is1,is2,itmp,iwhich,j,mxint,nperm,nrep,ntot CHARACTER type*4,phrase*100 C .. C .. Local Arrays .. REAL array(1000),param(3) INTEGER iarray(1000),perm(500) C .. C .. External Functions .. REAL genbet,genchi,genf,gennch,gennf,genunf INTEGER ignuin,myhand EXTERNAL genbet,genchi,genf,gennch,gennf,genunf,ignuin,myhand C .. C .. External Subroutines .. EXTERNAL genprm,phrtsd,setall,stat,trstat C .. C .. Equivalences .. EQUIVALENCE (array,iarray) C .. C .. Executable Statements .. WRITE (*,9000) 9000 FORMAT (' Tests most generators of specific distributions.'/ + ' Generates 1000 deviates: reports mean and variance.'/ + ' Also reports theoretical mean and variance.'/ + ' If theoretical mean or var doesn''t exist prints -1.'/ + ' For permutations, generates one permutation of 1..n'/ + ' and prints it.'/ + ' For uniform integers asks for upper bound, number of'/ + ' replicates per integer in 1..upper bound.'/ + ' Prints table of num times each integer generated.') C C Menu for choosing tests C 10 WRITE (*,9010) 9010 FORMAT (' Enter number corresponding to choice:'/ + ' (0) Exit this program'/ + ' (1) Generate Chi-Square deviates'/ + ' (2) Generate noncentral Chi-Square deviates'/ + ' (3) Generate F deviates'/ + ' (4) Generate noncentral F deviates'/ + ' (5) Generate random permutation'/ + ' (6) Generate uniform integers'/ + ' (7) Generate uniform reals'/ + ' (8) Generate beta deviates'/ + ' (9) Generate binomial outcomes'/ + ' (10) Generate Poisson ourcomes'/) READ (*,*) iwhich IF (.NOT. (iwhich.LT.0.OR.iwhich.GT.mxwh)) GO TO 20 WRITE (*,*) ' Choices are 1..',mxwh,' - try again.' GO TO 10 20 IF (iwhich.EQ.0) STOP ' Normal termination rn tests' WRITE (*,*) ' Enter phrase to initialize rn generator' READ (*,'(a)') phrase CALL phrtsd(phrase,is1,is2) CALL setall(is1,is2) IF ((1).NE. (iwhich)) GO TO 40 C C Chi-square deviates C type = 'chis' WRITE (*,*) ' Enter (real) df for the chi-square generation' READ (*,*) param(1) DO 30,i = 1,1000 array(i) = genchi(param(1)) 30 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax 9020 FORMAT (' Mean Generated: ',T30,G15.7,5X,'True:',T60, + G15.7/' Variance Generated:',T30,G15.7,5X,'True:',T60, + G15.7/' Minimun: ',T30,G15.7,5X,'Maximum:',T60,G15.7) GO TO 280 40 IF ((2).NE. (iwhich)) GO TO 60 C C Noncentral Chi-square deviates C type = 'ncch' WRITE (*,*) ' Enter (real) df' WRITE (*,*) ' (real) noncentrality parameter' READ (*,*) param(1),param(2) DO 50,i = 1,1000 array(i) = gennch(param(1),param(2)) 50 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 60 IF ((3).NE. (iwhich)) GO TO 80 C C F deviates C type = 'f' WRITE (*,*) ' Enter (real) df of the numerator' WRITE (*,*) ' (real) df of the denominator' READ (*,*) param(1),param(2) DO 70,i = 1,1000 array(i) = genf(param(1),param(2)) 70 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 80 IF ((4).NE. (iwhich)) GO TO 100 C C Noncentral F deviates C type = 'ncf' WRITE (*,*) ' Enter (real) df of the numerator' WRITE (*,*) ' (real) df of the denominator' WRITE (*,*) ' (real) noncentrality parameter' READ (*,*) param(1),param(2),param(3) DO 90,i = 1,1000 array(i) = gennf(param(1),param(2),param(3)) 90 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 100 IF ((5).NE. (iwhich)) GO TO 140 C C Random permutation C 110 WRITE (*,*) ' Enter size of permutation' READ (*,*) nperm IF (.NOT. (nperm.LT.1.OR.nperm.GT.500)) GO TO 120 WRITE (*,*) ' Permutation size must be between 1 and 500 ', + '- try again!' GO TO 110 120 WRITE (*,*) ' Random Permutation Generated - Size',nperm DO 130,i = 1,500 perm(i) = i 130 CONTINUE CALL genprm(perm,nperm) WRITE (*,*) ' Perm Generated' WRITE (*,'(20I4)') (perm(i),i=1,nperm) GO TO 280 140 IF ((6).NE. (iwhich)) GO TO 170 C C Uniform integer C WRITE (*,*) ' Enter maximum uniform integer' READ (*,*) mxint WRITE (*,*) ' Enter number of replications per integer' READ (*,*) nrep DO 150,i = 1,1000 iarray(i) = 0 150 CONTINUE ntot = mxint*nrep DO 160,i = 1,ntot itmp = ignuin(1,mxint) iarray(itmp) = iarray(itmp) + 1 160 CONTINUE WRITE (*,*) ' Counts of Integers Generated' WRITE (*,'(20I4)') (iarray(j),j=1,mxint) GO TO 280 170 IF ((7).NE. (iwhich)) GO TO 190 C C Uniform real C type = 'unif' WRITE (*,*) ' Enter Low then High bound for uniforms' READ (*,*) param(1),param(2) DO 180,i = 1,1000 array(i) = genunf(param(1),param(2)) 180 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 190 IF ((8).NE. (iwhich)) GO TO 210 C C Beta deviate C type = 'beta' WRITE (*,*) ' Enter A, B for Beta deviate' READ (*,*) param(1),param(2) DO 200,i = 1,1000 array(i) = genbet(param(1),param(2)) 200 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 210 IF ((9).NE. (iwhich)) GO TO 240 C C Binomial outcomes C type = 'bin' WRITE (*,*) ' Enter number of trials, Prob event for ', + 'binomial outcomes' READ (*,*) ntry,pevt DO 220,i = 1,1000 iarray(i) = ignbin(ntry,pevt) 220 CONTINUE DO 230,i = 1,1000 array(i) = iarray(i) 230 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) param(1) = ntry param(2) = pevt CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 240 IF ((10).NE. (iwhich)) GO TO 270 C C Poisson outcomes C type = 'pois' WRITE (*,*) ' Enter mean for Poisson generation' READ (*,*) param(1) DO 250,i = 1,1000 iarray(i) = ignpoi(param(1)) 250 CONTINUE DO 260,i = 1,1000 array(i) = iarray(i) 260 CONTINUE CALL stat(array,1000,av,var,xmin,xmax) CALL trstat(type,param,avtr,vartr) WRITE (*,9020) av,avtr,var,vartr,xmin,xmax GO TO 280 270 CONTINUE 280 GO TO 10 END SUBROUTINE trstat(type,parin,av,var) IMPLICIT INTEGER (i-n),REAL (a-h,o-p,r-z),LOGICAL (q) C********************************************************************** C C SUBROUTINE TRSTAT( TYPE, PARIN, AV, VAR ) C TRue STATistics C C Returns mean and variance for a number of statistical distribution C as a function of their parameters. C C C Arguments C C C TYPE --> Character string indicating type of distribution C 'chis' chisquare C 'ncch' noncentral chisquare C 'f' F (variance ratio) C 'ncf' noncentral f C 'unif' uniform C 'beta' beta distribution C CHARACTER*(4) TYPE C C PARIN --> Array containing parameters of distribution C chisquare C PARIN(1) is df C noncentral chisquare C PARIN(1) is df C PARIN(2) is noncentrality parameter C F (variance ratio) C PARIN(1) is df numerator C PARIN(2) is df denominator C noncentral F C PARIN(1) is df numerator C PARIN(2) is df denominator C PARIN(3) is noncentrality parameter C uniform C PARIN(1) is LOW bound C PARIN(2) is HIGH bound C beta C PARIN(1) is A C PARIN(2) is B C REAL PARIN(*) C binonial C PARIN(1) is Number of trials C PARIN(2) is Prob Event at Each Trial C poisson C PARIN(1) is Mean C C AV <-- Mean of specified distribution with specified parameters C REAL AV C C VAR <-- Variance of specified distribution with specified paramete C REAL VAR C C C Note C C C AV and Var will be returned -1 if mean or variance is infinite C C********************************************************************** C .. Scalar Arguments .. REAL av,var CHARACTER type* (4) C .. C .. Array Arguments .. REAL parin(*) C .. C .. Local Scalars .. REAL a,b,range C .. C .. Executable Statements .. IF (('chis').NE. (type)) GO TO 10 av = parin(1) var = 2.0*parin(1) GO TO 170 10 IF (('ncch').NE. (type)) GO TO 20 a = parin(1) + parin(2) b = parin(2)/a av = a var = 2.0*a* (1.0+b) GO TO 170 20 IF (('f').NE. (type)) GO TO 70 IF (.NOT. (parin(2).LE.2.0001)) GO TO 30 av = -1.0 GO TO 40 30 av = parin(2)/ (parin(2)-2.0) 40 IF (.NOT. (parin(2).LE.4.0001)) GO TO 50 var = -1.0 GO TO 60 50 var = (2.0*parin(2)**2* (parin(1)+parin(2)-2.0))/ + (parin(1)* (parin(2)-2.0)**2* (parin(2)-4.0)) 60 GO TO 170 70 IF (('ncf').NE. (type)) GO TO 120 IF (.NOT. (parin(2).LE.2.0001)) GO TO 80 av = -1.0 GO TO 90 80 av = (parin(2)* (parin(1)+parin(3)))/ ((parin(2)-2.0)*parin(1)) 90 IF (.NOT. (parin(2).LE.4.0001)) GO TO 100 var = -1.0 GO TO 110 100 a = (parin(1)+parin(3))**2 + (parin(1)+2.0*parin(3))* + (parin(2)-2.0) b = (parin(2)-2.0)**2* (parin(2)-4.0) var = 2.0* (parin(2)/parin(1))**2* (a/b) 110 GO TO 170 120 IF (('unif').NE. (type)) GO TO 130 range = parin(2) - parin(1) av = parin(1) + range/2.0 var = range**2/12.0 GO TO 170 130 IF (('beta').NE. (type)) GO TO 140 av = parin(1)/ (parin(1)+parin(2)) var = (av*parin(2))/ ((parin(1)+parin(2))* + (parin(1)+parin(2)+1.0)) WRITE (*,*) ' A, B, AV, VAR ',parin(1),parin(2),av,var GO TO 170 140 IF (('bin').NE. (type)) GO TO 150 av = parin(1)*parin(2) var = av* (1.0-parin(2)) GO TO 170 150 IF (('pois').NE. (type)) GO TO 160 av = parin(1) var = parin(1) GO TO 170 160 WRITE (*,*) 'Unimplemented type ',type STOP 'Unimplemented type in TRSTAT' 170 RETURN END octave-1.1.0/libcruft/villad/ 40777 415 17 0 5705521667 14144 5ustar jweusersoctave-1.1.0/libcruft/villad/Makefile.in100666 415 17 507 5662226312 16257 0ustar jweusers# # Makefile for octave's libcruft/villad directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ EXTERNAL_DISTFILES = $(DISTFILES) include $(TOPDIR)/Makeconf include ../Makerules octave-1.1.0/libcruft/villad/dfopr.f100666 415 17 10567 5307302420 15531 0ustar jweusers SUBROUTINE DFOPR + ( + ND, N, N0, N1, I, ID, DIF1, DIF2, DIF3, ROOT, VECT + ) INTEGER ND, N, N0, N1, I, ID DOUBLE PRECISION DIF1(ND), DIF2(ND), DIF3(ND), ROOT(ND), VECT(ND) C C*********************************************************************** C C VILLADSEN AND MICHELSEN, PAGES 133-134, 419 C C INPUT PARAMETERS: C C ND : THE DIMENSION OF THE VECTORS DIF1, DIF2, DIF3, AND ROOT C C N : THE DEGREE OF THE JACOBI POLYNOMIAL, (i.e. THE NUMBER C OF INTERIOR INTERPOLATION POINTS) C C N0 : DETERMINES WHETHER X = 0 IS INCLUDED AS AN C INTERPOLATION POINT C C N0 = 0 ==> X = 0 IS NOT INCLUDED C N0 = 1 ==> X = 0 IS INCLUDED C C N1 : DETERMINES WHETHER X = 1 IS INCLUDED AS AN C INTERPOLATION POINT C C N1 = 0 ==> X = 1 IS NOT INCLUDED C N1 = 1 ==> X = 1 IS INCLUDED C C I : THE INDEX OF THE NODE FOR WHICH THE WEIGHTS ARE TO BE C CALCULATED C C ID : INDICATOR C C ID = 1 ==> FIRST DERIVATIVE WEIGHTS ARE COMPUTED C ID = 2 ==> SECOND DERIVATIVE WEIGHTS ARE COMPUTED C ID = 3 ==> GAUSSIAN WEIGHTS ARE COMPUTED (IN THIS C CASE, THE VALUE OF I IS IRRELEVANT) C C OUTPUT PARAMETERS: C C DIF1 : ONE DIMENSIONAL VECTOR CONTAINING THE FIRST DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C DIF2 : ONE DIMENSIONAL VECTOR CONTAINING THE SECOND DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C DIF3 : ONE DIMENSIONAL VECTOR CONTAINING THE THIRD DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C VECT : ONE DIMENSIONAL VECTOR OF COMPUTED WEIGHTS C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: VILERR C C*********************************************************************** C INTEGER J,NT,IER DOUBLE PRECISION AX,X,Y DOUBLE PRECISION ZERO,ONE,TWO,THREE LOGICAL LSTOP C PARAMETER ( ZERO = 0.0D+00, ONE = 1.0D+00, + TWO = 2.0D+00, THREE = 3.0D+00 ) C C -- ERROR CHECKING C IF ((N0 .NE. 0) .AND. (N0 .NE. 1)) THEN IER = 1 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((N1 .NE. 0) .AND. (N1 .NE. 1)) THEN IER = 2 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (ND .LT. (N + N0 + N1)) THEN IER = 3 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((ID .NE. 1) .AND. (ID.NE. 2) .AND. (ID .NE. 3)) THEN IER = 6 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (ID .NE. 3) THEN IF (I .LT. 1) THEN IER = 4 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (I .GT. (N + N0 + N1)) THEN IER = 5 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF ELSE END IF C IF ((N + N0 + N1) .LT. 1) THEN IER = 7 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C C -- EVALUATE DISCRETIZATION MATRICES AND GAUSSIAN QUADRATURE C -- WEIGHTS. QUADRATURE WEIGHTS ARE NORMALIZED TO SUM TO ONE. C NT = N + N0 + N1 C IF (ID .NE. 3) THEN DO 20 J = 1,NT C IF (J .EQ. I) THEN IF (ID .EQ. 1) THEN VECT(I) = DIF2(I)/DIF1(I)/TWO ELSE VECT(I) = DIF3(I)/DIF1(I)/THREE END IF ELSE Y = ROOT(I) - ROOT(J) VECT(J) = DIF1(I)/DIF1(J)/Y IF (ID .EQ. 2) THEN VECT(J) = VECT(J)*(DIF2(I)/DIF1(I) - TWO/Y) ELSE END IF END IF C 20 CONTINUE ELSE Y = ZERO C DO 25 J = 1,NT C X = ROOT(J) AX = X*(ONE - X) C IF(N0 .EQ. 0) THEN AX = AX/X/X ELSE END IF C IF(N1 .EQ. 0) THEN AX = AX/(ONE - X)/(ONE - X) ELSE END IF C VECT(J) = AX/DIF1(J)**2 Y = Y + VECT(J) C 25 CONTINUE C DO 60 J = 1,NT VECT(J) = VECT(J)/Y 60 CONTINUE C END IF C RETURN END octave-1.1.0/libcruft/villad/dif.f100666 415 17 3527 5307302420 15137 0ustar jweusers SUBROUTINE DIF ( NT, ROOT, DIF1, DIF2, DIF3 ) C INTEGER NT DOUBLE PRECISION ROOT(NT), DIF1(NT), DIF2(NT), DIF3(NT) C C*********************************************************************** C C SUBROUTINE DIF C C THIS ROUTINE IS NOT GIVEN SEPARATELY BY VILLADSEN AND MICHELSEN C BUT AS PART OF JCOBI C C DIF COMPUTES THE FIRST THREE DERIVATIVES OF THE NODE POLYNOMIAL C C N0 (ALPHA,BETA) N1 C P (X) = (X) * P (X) * (1 - X) C NT N C C AT THE INTERPOLATION POINTS. EACH OF THE PARAMETERS N0 AND N1 C MAY BE GIVEN THE VALUE 0 OR 1. NT = N + N0 + N1 C C THE VALUES OF ROOT MUST BE KNOWN BEFORE A CALL TO DIF IS POSSIBLE. C THEY MAY BE COMPUTED USING JCOBI. C C PARAMETER LIST: SEE THE SUBROUTINE JCOBI C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: VILERR C C*********************************************************************** C INTEGER I,J,IER DOUBLE PRECISION X,Y DOUBLE PRECISION ZERO,ONE,TWO,THREE LOGICAL LSTOP C PARAMETER ( ZERO = 0.0D+00, ONE = 1.0D+00, + TWO = 2.0D+00, THREE = 3.0D+00 ) C C -- ERROR CHECKING C IF (NT .LT. 1) THEN IER = 7 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C C -- EVALUATE DERIVATIVES OF NODE POLYNOMIAL USING RECURSION FORMULAS C DO 40 I = 1,NT C X = ROOT(I) DIF1(I) = ONE DIF2(I) = ZERO DIF3(I) = ZERO C DO 30 J = 1,NT C IF (J .NE. I) THEN Y = X - ROOT(J) DIF3(I) = Y*DIF3(I) + THREE*DIF2(I) DIF2(I) = Y*DIF2(I) + TWO *DIF1(I) DIF1(I) = Y*DIF1(I) ELSE END IF C 30 CONTINUE 40 CONTINUE C RETURN END octave-1.1.0/libcruft/villad/intrp.f100666 415 17 4125 5307302420 15524 0ustar jweusers SUBROUTINE INTRP ( ND, NT, X, ROOT, DIF1, XINTP ) C INTEGER ND, NT DOUBLE PRECISION ROOT(ND), DIF1(ND), XINTP(ND) C C*********************************************************************** C C LAGRANGE INTERPOLATION C C VILLADSEN AND MICHELSEN, PAGES 132-133, 420 C C INPUT PARAMETERS: C C NT : THE TOTAL NUMBER OF INTERPOLATION POINTS FOR WHICH THE C VALUE OF THE DEPENDENT VARIABLE Y IS KNOWN. NOTE: C C NT = N + N0 + N1 C C X : THE ABCISSA X WHERE Y(X) IS DESIRED C C ROOT : ONE DIMENSIONAL VECTOR CONTAINING ON EXIT THE C N + N0 + N1 ZEROS OF THE NODE POLYNOMIAL USED IN THE C INTERPOLATION ROUTINE C C DIF1 : ONE DIMENSIONAL VECTOR CONTAINING THE FIRST DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C OUTPUT PARAMETERS: C C XINTP : THE VECTOR OF INTERPOLATION WEIGHTS C C Y(X) IS GIVEN BY: C C NT C Y(X) = SUM XINTRP(I) * Y(I) C I=1 C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: VILERR C C*********************************************************************** C INTEGER I,IER DOUBLE PRECISION POL,Y,X DOUBLE PRECISION ZERO,ONE LOGICAL LSTOP C PARAMETER ( ZERO = 0.0D+00, ONE = 1.0D+00 ) C C -- ERROR CHECKING C IF (ND .LT. NT) THEN IER = 3 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (NT .LT. 1) THEN IER = 7 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C C -- EVALUATE LAGRANGIAN INTERPOLATION COEFFICIENTS C POL = ONE C DO 5 I = 1,NT C Y = X - ROOT(I) XINTP(I) = ZERO C IF (Y .EQ. ZERO) THEN XINTP(I) = ONE ELSE END IF C POL = POL*Y C 5 CONTINUE C IF (POL .NE. ZERO) THEN DO 6 I = 1,NT XINTP(I) = POL/DIF1(I)/(X - ROOT(I)) 6 CONTINUE ELSE END IF C RETURN END octave-1.1.0/libcruft/villad/jcobi.f100666 415 17 13565 5307302420 15506 0ustar jweusers**************************************************************** * * The following routines (JCOBI, DIF, DFOPR, INTRP, AND RADAU) * are the same as found in Villadsen, J. and M.L. Michelsen, * Solution of Differential Equation Models by Polynomial * Approximation, Prentice-Hall (1978) pages 418-420. * * Cosmetic changes (elimination of arithmetic IF statements, most * GO TO statements, and indentation of program blocks) made by: * * John W. Eaton * Department of Chemical Engineering * The University of Texas at Austin * Austin, Texas 78712 * * June 6, 1987 * * Some error checking additions also made on June 7, 1987 * * Further cosmetic changes made August 20, 1987 * ************************************************************************ * SUBROUTINE JCOBI + ( + ND, N, N0, N1, ALPHA, BETA, DIF1, DIF2, DIF3, ROOT + ) C INTEGER + + ND, N, N0, N1 C DOUBLE PRECISION + + ALPHA, BETA, DIF1(ND), DIF2(ND), DIF3(ND), ROOT(ND) C C*********************************************************************** C C VILLADSEN AND MICHELSEN, PAGES 131-132, 418 C C THIS SUBROUTINE COMPUTES THE ZEROS OF THE JACOBI POLYNOMIAL C C (ALPHA,BETA) C P (X) C N C C USE DIF (GIVEN BELOW) TO COMPUTE THE DERIVATIVES OF THE NODE C POLYNOMIAL C C N0 (ALPHA,BETA) N1 C P (X) = (X) * P (X) * (1 - X) C NT N C C AT THE INTERPOLATION POINTS. C C INPUT PARAMETERS: C C ND : THE DIMENSION OF THE VECTORS DIF1, DIF2, DIF3, AND ROOT C C N : THE DEGREE OF THE JACOBI POLYNOMIAL, (i.e. THE NUMBER C OF INTERIOR INTERPOLATION POINTS) C C N0 : DETERMINES WHETHER X = 0 IS INCLUDED AS AN C INTERPOLATION POINT C C N0 = 0 ==> X = 0 IS NOT INCLUDED C N0 = 1 ==> X = 0 IS INCLUDED C C N1 : DETERMINES WHETHER X = 1 IS INCLUDED AS AN C INTERPOLATION POINT C C N1 = 0 ==> X = 1 IS NOT INCLUDED C N1 = 1 ==> X = 1 IS INCLUDED C C ALPHA : THE VALUE OF ALPHA IN THE DESCRIPTION OF THE JACOBI C POLYNOMIAL C C BETA : THE VALUE OF BETA IN THE DESCRIPTION OF THE JACOBI C POLYNOMIAL C C FOR A MORE COMPLETE EXPLANATION OF ALPHA AN BETA, SEE VILLADSEN C AND MICHELSEN, PAGES 57 TO 59 C C OUTPUT PARAMETERS: C C ROOT : ONE DIMENSIONAL VECTOR CONTAINING ON EXIT THE C N + N0 + N1 ZEROS OF THE NODE POLYNOMIAL USED IN THE C INTERPOLATION ROUTINE C C DIF1 : ONE DIMENSIONAL VECTOR CONTAINING THE FIRST DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C DIF2 : ONE DIMENSIONAL VECTOR CONTAINING THE SECOND DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C DIF3 : ONE DIMENSIONAL VECTOR CONTAINING THE THIRD DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: VILERR, DIF C C*********************************************************************** C INTEGER I,J,NT,IER DOUBLE PRECISION AB,AD,AP,Z1,Z,Y,X,XD,XN,XD1,XN1,XP,XP1,ZC DOUBLE PRECISION ZERO,ONE,TWO LOGICAL LSTOP C PARAMETER ( ZERO = 0.0D+00, ONE = 1.0D+00, TWO = 2.0D+00 ) C C -- ERROR CHECKING C IF ((N0 .NE. 0) .AND. (N0 .NE. 1)) THEN IER = 1 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((N1 .NE. 0) .AND. (N1 .NE. 1)) THEN IER = 2 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (ND .LT. (N + N0 + N1)) THEN IER = 3 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((N + N0 + N1) .LT. 1) THEN IER = 7 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C C -- FIRST EVALUATION OF COEFFICIENTS IN RECURSION FORMULAS. C -- RECURSION COEFFICIENTS ARE STORED IN DIF1 AND DIF2. C AB = ALPHA + BETA AD = BETA - ALPHA AP = BETA*ALPHA DIF1(1) = (AD/(AB + TWO) + ONE)/TWO DIF2(1) = ZERO C IF(N .GE. 2) THEN DO 10 I = 2,N C Z1 = DBLE(I) - ONE Z = AB + 2*Z1 DIF1(I) = (AB*AD/Z/(Z + TWO) + ONE)/TWO C IF (I .EQ. 2) THEN DIF2(I) = (AB + AP + Z1)/Z/Z/(Z + ONE) ELSE Z = Z*Z Y = Z1*(AB + Z1) Y = Y*(AP + Y) DIF2(I) = Y/Z/(Z - ONE) END IF C 10 CONTINUE ELSE END IF C C -- ROOT DETERMINATION BY NEWTON METHOD WITH SUPPRESSION OF C -- PREVIOUSLY DETERMINED ROOTS C X = ZERO C DO 20 I = 1,N C 25 CONTINUE XD = ZERO XN = ONE XD1 = ZERO XN1 = ZERO C DO 30 J = 1,N XP = (DIF1(J) - X)*XN - DIF2(J)*XD XP1 = (DIF1(J) - X)*XN1 - DIF2(J)*XD1 - XN XD = XN XD1 = XN1 XN = XP XN1 = XP1 30 CONTINUE C ZC = ONE Z = XN/XN1 C IF (I .NE. 1) THEN DO 22 J = 2,I ZC = ZC - Z/(X - ROOT(J-1)) 22 CONTINUE ELSE END IF C Z = Z/ZC X = X - Z C IF (DABS(Z) .GT. 1.D-09) THEN C C -- BACKWARD BRANCH C GO TO 25 ELSE END IF C ROOT(I) = X X = X + 0.0001D0 C 20 CONTINUE C C -- ADD INTERPOLATION POINTS AT X = 0 AND/OR X = 1 C NT = N + N0 + N1 C IF (N0 .NE. 0) THEN DO 31 I = 1,N J = N + 1 - I ROOT(J+1) = ROOT(J) 31 CONTINUE ROOT(1) = ZERO ELSE END IF C IF (N1 .EQ. 1) THEN ROOT(NT) = ONE ELSE END IF C CALL DIF ( NT, ROOT, DIF1, DIF2, DIF3 ) C RETURN END octave-1.1.0/libcruft/villad/radau.f100666 415 17 12420 5307302421 15502 0ustar jweusers SUBROUTINE RADAU + ( + ND, N, N0, N1, ID, ALPHA, BETA, ROOT, DIF1, VECT + ) C INTEGER ND, N, N0, N1, ID DOUBLE PRECISION ALPHA, BETA, ROOT(ND), DIF1(ND), VECT(ND) C C*********************************************************************** C C RADAU OR LOBATTO QUADRATURE C C VILLADSEN AND MICHELSEN, PAGES 133-135, 419 C C INPUT PARAMETERS: C C ND : THE DIMENSION OF THE VECTORS DIF1, DIF2, DIF3, AND ROOT C C N : THE DEGREE OF THE JACOBI POLYNOMIAL, (i.e. THE NUMBER C OF INTERIOR INTERPOLATION POINTS) C C N0 : DETERMINES WHETHER X = 0 IS INCLUDED AS AN C INTERPOLATION POINT C C N0 = 0 ==> X = 0 IS NOT INCLUDED C N0 = 1 ==> X = 0 IS INCLUDED C C N1 : DETERMINES WHETHER X = 1 IS INCLUDED AS AN C INTERPOLATION POINT C C N1 = 0 ==> X = 1 IS NOT INCLUDED C N1 = 1 ==> X = 1 IS INCLUDED C C ID : INDICATOR C C ID = 1 ==> RADAU QUADRATURE WEIGHTS INCLUDING X = 1 C ID = 2 ==> RADAU QUADRATURE WEIGHTS INCLUDING X = 0 C ID = 3 ==> LOBATTO QUADRATURE WEIGHTS INCLUDING C BOTH X = 0 AND X = 1 C C ALPHA : THE VALUE OF ALPHA IN THE DESCRIPTION OF THE JACOBI C POLYNOMIAL C C BETA : THE VALUE OF BETA IN THE DESCRIPTION OF THE JACOBI C POLYNOMIAL C C FOR A MORE COMPLETE EXPLANATION OF ALPHA AN BETA, SEE C VILLADSEN AND MICHELSEN, PAGES 57 TO 59 C C ROOT : ONE DIMENSIONAL VECTOR CONTAINING ON EXIT THE C N + N0 + N1 ZEROS OF THE NODE POLYNOMIAL USED IN THE C INTERPOLATION ROUTINE C C DIF1 : ONE DIMENSIONAL VECTOR CONTAINING THE FIRST DERIVATIVE C OF THE NODE POLYNOMIAL AT THE ZEROS C C THE NODE POLYNOMIAL IS GIVEN BY C C N0 (ALPHA',BETA') N1 C P (X) = X * P (X) * (X - 1) C NT N C C THE ARGUMENTS ALPHA' AND BETA' TO BE USED IN JCOBI FOR C CALCULATION OF ROOT AND DIF1 DEPEND ON WHETHER X = 0 , X = 1 OR C BOTH ARE USED AS EXTRA QUADRATURE POINTS. THUS: C C ID = 1: ALPHA' = ALPHA + 1, BETA' = BETA C ID = 2: ALPHA' = ALPHA , BETA' = BETA + 1 C ID = 3: ALPHA' = ALPHA + 1, BETA' = BETA + 1 C C NOTE: C C ID = 1 REQUIRES THAT N0 = 0 OR 1, N1 = 1 C ID = 2 REQUIRES THAT N0 = 1 , N1 = 0 OR 1 C ID = 3 REQUIRES THAT N0 = 1 , N1 = 1 C C OUTPUT PARAMETERS: C C VECT : VECTOR OF THE NT COMPUTED QUADRATURE WEIGHTS, C NORMALIZED SUCH THAT C C NT C SUM VECT(I) = 1 C I=1 C C FOR A MORE COMPLETE EXPLANATION SEE VILLADSEN AND C MICHELSEN, PAGES 133 TO 135 C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: VILERR C C*********************************************************************** C INTEGER I,NT,IER DOUBLE PRECISION AX,S,X DOUBLE PRECISION ZERO,ONE LOGICAL LSTOP C PARAMETER ( ZERO = 0.0D+00, ONE = 1.0D+00 ) C C -- ERROR CHECKING C IF ((N0 .NE. 0) .AND. (N0 .NE. 1)) THEN IER = 1 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((N1 .NE. 0) .AND. (N1 .NE. 1)) THEN IER = 2 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF (ND .LT. (N + N0 + N1)) THEN IER = 3 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((N + N0 + N1) .LT. 1) THEN IER = 7 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((ID .NE. 1) .AND. (ID.NE. 2) .AND. (ID .NE. 3)) THEN IER = 8 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((ID .EQ. 1) .AND. (N1 .NE. 1)) THEN IER = 9 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((ID .EQ. 2) .AND. (N0 .NE. 1)) THEN IER = 10 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C IF ((ID .EQ. 3) .AND. ((N0 .NE. 1) .OR. (N1 .NE. 1))) THEN IER = 11 LSTOP = .TRUE. CALL VILERR(IER,LSTOP) ELSE END IF C C -- EVALUATE RADAU OR LOBATTO QUADRATURE WEIGHTS C S = ZERO NT = N + N0 + N1 C DO 40 I = 1,NT C X = ROOT(I) C IF (ID .EQ. 1) THEN AX = X IF (N0 .EQ. 0) THEN AX = ONE/AX ELSE END IF ELSE IF (ID .EQ. 2) THEN AX = ONE - X IF (N1 .EQ. 0) THEN AX = ONE/AX ELSE END IF ELSE IF (ID .EQ. 3) THEN AX = ONE ELSE END IF C VECT(I) = AX/DIF1(I)**2 C 40 CONTINUE C IF (ID .NE. 2) THEN VECT(NT) = VECT(NT)/(ONE + ALPHA) ELSE END IF C IF (ID .GT. 1) THEN VECT(1) = VECT( 1)/(ONE + BETA) ELSE END IF C DO 50 I = 1,NT S = S + VECT(I) 50 CONTINUE C DO 60 I = 1,NT VECT(I) = VECT(I)/S 60 CONTINUE C RETURN END octave-1.1.0/libcruft/villad/vilerr.f100666 415 17 4126 5405741666 15716 0ustar jweusers SUBROUTINE VILERR ( IER, LSTOP ) C INTEGER IER LOGICAL LSTOP C C*********************************************************************** C C THIS SUBROUTINE HANDLES ERRORS FOR THE SUBROUTINES JCOBI, DFOPR, C INTRP, AND RADAU GIVEN BY VILLADSEN AND MICHELSEN. C C PARAMETER LIST: C C IER : ERROR NUMBER C LSTOP : LOGICAL FLAG C C LSTOP = .TRUE. ==> FATAL ERROR, PROGRAM TERMINATION C LSTOP = .FALSE. ==> WARNING ERROR, NORMAL RETURN C C COMMON BLOCKS: NONE C C REQUIRED ROUTINES: NONE C C*********************************************************************** C C -- BEGIN C IF ( IER .EQ. 1) THEN C WRITE(*,*) '** VILERR : Illegal value for N0 ' C ELSE IF ( IER .EQ. 2) THEN C WRITE(*,*) '** VILERR : Illegal value for N1 ' C ELSE IF ( IER .EQ. 3 ) THEN C WRITE(*,*) '** VILERR : Insufficient dimension for problem ' C ELSE IF ( IER .EQ. 4 ) THEN C WRITE(*,*) '** VILERR : Index less than zero in DFOPR ' C ELSE IF ( IER .EQ. 5 ) THEN C WRITE(*,*) '** VILERR : Index greater than NTOTAL in DFOPR ' C ELSE IF ( IER .EQ. 6 ) THEN C WRITE(*,*) '** VILERR : Illegal ID in DFOPR ' C ELSE IF ( IER .EQ. 7 ) THEN C WRITE(*,*) '** VILERR : Number of interpolation points ' WRITE(*,*) ' less than 1 ' C ELSE IF ( IER .EQ. 8 ) THEN C WRITE(*,*) '** VILERR : Illegal ID in RADAU ' C ELSE IF ( IER .EQ. 9 ) THEN C WRITE(*,*) '** VILERR : ID = 1 but N1 not equal to 1 in RADAU ' C ELSE IF ( IER .EQ. 10 ) THEN C WRITE(*,*) '** VILERR : ID = 2 but N0 not equal to 1 in RADAU ' C ELSE IF ( IER .EQ. 11 ) THEN C WRITE(*,*) '** VILERR : ID = 3 but N0 not equal to 1 or ' WRITE(*,*) ' N1 not equal to 1 in RADAU ' C ELSE C WRITE(*,*) 'UNRECOGNIZED ERROR FLAG SET FOR VILERR ' C END IF C IF ( LSTOP ) THEN C C -- PROGRAM EXECUTION TERMINATES HERE C CALL XSTOPX (' ') C ELSE END IF C RETURN END octave-1.1.0/libcruft/Makefile.in100666 415 17 5666 5662226315 15042 0ustar jweusers# # Makefile for octave's libcruft directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ # List of the directories that contain Fortran source. Simply copying # a new .f file into one of these directories is sufficient to have it # added to libcruft.a. If you add a new directory here, you also need # generate a new configure script (edit configure.in and run autoconf). CRUFT_DIRS = balgen blas dassl eispack fftpack fsqp lapack linpack \ minpack misc npsol odepack qpsol quadpack ranlib villad SUBDIRS = $(CRUFT_DIRS) DISTFILES = Makefile.in Makerules.in $(SOURCES) STOP.patch all: make-objects libcruft.a .PHONY: all make-objects: for dir in $(SUBDIRS); do echo making all in $$dir; cd $$dir; $(MAKE) $(MDEFINES) all; cd ..; done .PHONY: make-objects CRUFT_FSRC = $(foreach dir, $(SUBDIRS), $(wildcard $(srcdir)/$(dir)/*.f)) CRUFT_OBJ3 = $(patsubst $(srcdir)/%, %, $(CRUFT_FSRC)) CRUFT_OBJ2 = $(patsubst %.f, %.o, $(CRUFT_OBJ3)) CRUFT_OBJ1 = $(subst misc/d1mach.o, , $(CRUFT_OBJ2)) CRUFT_OBJ = $(CRUFT_OBJ1) misc/d1mach.o misc/dostop.o libcruft.a: $(CRUFT_OBJ) rm -f libcruft.a $(AR) $(ARFLAGS) libcruft.a $(CRUFT_OBJ) $(RANLIB) libcruft.a $(CRUFT_OBJ): check: all .PHONY: check install: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done $(top_srcdir)/mkinstalldirs $(libdir) rm -f $(libdir)/libcruft.a $(INSTALL_DATA) libcruft.a $(libdir)/libcruft.a $(RANLIB) $(libdir)/libcruft.a .PHONY: install uninstall: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done rm -f $(libdir)/libcruft.a .PHONY: uninstall tags: $(SOURCES) for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done ctags $(SOURCES) TAGS: $(SOURCES) for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done etags $(SOURCES) clean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done rm -f *.a *.o .PHONY: clean mostlyclean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done rm -f *.a *.o .PHONY: mostlyclean distclean: rm -f *.a *.o Makefile .PHONY: distclean realclean: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $(MDEFINES) $@; cd ..; done rm -f *.a *.o tags TAGS Makefile .PHONY: realclean local-dist: for dir in $(SUBDIRS); do mkdir ../`cat ../.fname`/libcruft/$$dir; cd $$dir; $(MAKE) $@; cd ..; done ln $(DISTFILES) ../`cat ../.fname`/libcruft .PHONY: local-dist dist: for dir in $(SUBDIRS); do mkdir ../`cat ../.fname`/libcruft/$$dir; cd $$dir; $(MAKE) $@; cd ..; done ln $(DISTFILES) ../`cat ../.fname`/libcruft .PHONY: dist octave-1.1.0/libcruft/Makerules.in100666 415 17 1721 5654257365 15253 0ustar jweusers# @configure_input@ # # Common rules for octave's libcruft directories. # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin SOURCES = *.f DISTFILES = Makefile.in $(SOURCES) $(SPECIAL) CRUFT_FSRC = $(wildcard $(srcdir)/*.f) CRUFT_BASE = $(notdir $(CRUFT_FSRC)) CRUFT_CSRC = $(patsubst %.f, %.c, $(CRUFT_BASE)) CRUFT_OBJ = $(patsubst %.f, %.o, $(CRUFT_BASE)) CWD = $(shell pwd) THISDIR = $(notdir $(CWD)) all: $(CRUFT_OBJ) $(SPECIAL_DEPEND) .PHONY: all install: all .PHONY: install uninstall: .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: rm -f *.a *.o .PHONY: clean mostlyclean: rm -f *.o .PHONY: mostlyclean realclean: clean rm -f tags TAGS Makefile .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/libcruft/$(THISDIR) .PHONY: local-dist dist: ln $(EXTERNAL_DISTFILES) ../../`cat ../../.fname`/libcruft/$(THISDIR) .PHONY: dist octave-1.1.0/libcruft/STOP.patch100666 415 17 40021 5405741475 14607 0ustar jweusersThis patch replaces all STOP statements with calls to XSTOPX so that Fortran routines won't be able to kill Octave. If you decide not to use the versions of the Fortran subroutines that are distributed with Octave, you might want to apply this patch (or something like it) to your sources. John W. Eaton jwe@che.utexas.edu Department of Chemical Engineering The University of Texas at Austin diff -rc libcruft.orig/blas/xerbla.f libcruft/blas/xerbla.f *** libcruft.orig/blas/xerbla.f Wed Feb 19 21:46:03 1992 --- libcruft/blas/xerbla.f Mon Jun 7 14:33:52 1993 *************** *** 35,41 **** * WRITE (*,99999) SRNAME, INFO * ! STOP * 99999 FORMAT ( ' ** On entry to ', A6, ' parameter number ', I2, $ ' had an illegal value' ) --- 35,41 ---- * WRITE (*,99999) SRNAME, INFO * ! CALL XSTOPX (' ') * 99999 FORMAT ( ' ** On entry to ', A6, ' parameter number ', I2, $ ' had an illegal value' ) diff -rc libcruft.orig/dassl/xerhlt.f libcruft/dassl/xerhlt.f *** libcruft.orig/dassl/xerhlt.f Wed Feb 19 23:46:22 1992 --- libcruft/dassl/xerhlt.f Mon Jun 7 14:34:44 1993 *************** *** 33,37 **** C***END PROLOGUE XERHLT CHARACTER*(*) MESSG C***FIRST EXECUTABLE STATEMENT XERHLT ! STOP END --- 33,37 ---- C***END PROLOGUE XERHLT CHARACTER*(*) MESSG C***FIRST EXECUTABLE STATEMENT XERHLT ! CALL XSTOPX (MESSG) END diff -rc libcruft.orig/misc/i1mach.f libcruft/misc/i1mach.f *** libcruft.orig/misc/i1mach.f Tue Jul 21 22:31:59 1992 --- libcruft/misc/i1mach.f Mon Jun 7 14:36:50 1993 *************** *** 523,527 **** RETURN 10 WRITE(OUTPUT,1999) I 1999 FORMAT(' I1MACH - I OUT OF BOUNDS',I10) ! STOP END --- 523,527 ---- RETURN 10 WRITE(OUTPUT,1999) I 1999 FORMAT(' I1MACH - I OUT OF BOUNDS',I10) ! CALL XSTOPX (' ') END diff -rc libcruft.orig/npsol/mcenv2.f libcruft/npsol/mcenv2.f *** libcruft.orig/npsol/mcenv2.f Sun Oct 25 23:36:33 1992 --- libcruft/npsol/mcenv2.f Mon Jun 7 14:36:21 1993 *************** *** 134,140 **** END IF ELSE WRITE( NOUT, 9999 ) ! STOP END IF ELSE IF( NGPMIN.EQ.GPMIN )THEN --- 134,140 ---- END IF ELSE WRITE( NOUT, 9999 ) ! CALL XSTOPX (' ') END IF ELSE IF( NGPMIN.EQ.GPMIN )THEN *************** *** 148,154 **** END IF ELSE WRITE( NOUT, 9999 ) ! STOP END IF IF( NGNMIN.EQ.GNMIN )THEN LEMIN2 = NGNMIN --- 148,154 ---- END IF ELSE WRITE( NOUT, 9999 ) ! CALL XSTOPX (' ') END IF IF( NGNMIN.EQ.GNMIN )THEN LEMIN2 = NGNMIN *************** *** 161,167 **** END IF ELSE WRITE( NOUT, 9999 ) ! STOP END IF LEMIN = MAX( LEMIN1, LEMIN2 ) END IF --- 161,167 ---- END IF ELSE WRITE( NOUT, 9999 ) ! CALL XSTOPX (' ') END IF LEMIN = MAX( LEMIN1, LEMIN2 ) END IF diff -rc libcruft.orig/odepack/xerrwv.f libcruft/odepack/xerrwv.f *** libcruft.orig/odepack/xerrwv.f Wed Feb 19 23:50:24 1992 --- libcruft/odepack/xerrwv.f Mon Jun 7 14:38:00 1993 *************** *** 109,114 **** 50 FORMAT(6X,15HIN ABOVE, R1 =,D21.13,3X,4HR2 =,D21.13) C ABORT THE RUN IF LEVEL = 2. ------------------------------------------ 100 IF (LEVEL .NE. 2) RETURN ! STOP C----------------------- END OF SUBROUTINE XERRWV ---------------------- END --- 109,114 ---- 50 FORMAT(6X,15HIN ABOVE, R1 =,D21.13,3X,4HR2 =,D21.13) C ABORT THE RUN IF LEVEL = 2. ------------------------------------------ 100 IF (LEVEL .NE. 2) RETURN ! CALL XSTOPX (' ') C----------------------- END OF SUBROUTINE XERRWV ---------------------- END diff -rc libcruft.orig/ranlib/advnst.f libcruft/ranlib/advnst.f *** libcruft.orig/ranlib/advnst.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/advnst.f Mon Jun 7 15:35:37 1993 *************** *** 60,66 **** IF (qrgnin()) GO TO 10 WRITE (*,*) ' ADVNST called before random number generator ', + ' initialized -- abort!' ! STOP ' ADVNST called before random number generator initialized' 10 CALL getcgn(g) C --- 60,67 ---- IF (qrgnin()) GO TO 10 WRITE (*,*) ' ADVNST called before random number generator ', + ' initialized -- abort!' ! CALL XSTOPX ! + (' ADVNST called before random number generator initialized') 10 CALL getcgn(g) C diff -rc libcruft.orig/ranlib/genbet.f libcruft/ranlib/genbet.f *** libcruft.orig/ranlib/genbet.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/genbet.f Mon Jun 7 15:35:23 1993 *************** *** 67,73 **** IF (.NOT. (aa.LE.0.0.OR.bb.LE.0.0)) GO TO 10 WRITE (*,*) ' AA or BB <= 0 in GENBET - Abort!' WRITE (*,*) ' AA: ',aa,' BB ',bb ! STOP ' AA or BB <= 0 in GENBET - Abort!' 10 olda = aa oldb = bb --- 67,73 ---- IF (.NOT. (aa.LE.0.0.OR.bb.LE.0.0)) GO TO 10 WRITE (*,*) ' AA or BB <= 0 in GENBET - Abort!' WRITE (*,*) ' AA: ',aa,' BB ',bb ! CALL XSTOPX (' AA or BB <= 0 in GENBET - Abort!') 10 olda = aa oldb = bb diff -rc libcruft.orig/ranlib/genchi.f libcruft/ranlib/genchi.f *** libcruft.orig/ranlib/genchi.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/genchi.f Mon Jun 7 15:35:17 1993 *************** *** 37,43 **** IF (.NOT. (df.LE.0.0)) GO TO 10 WRITE (*,*) 'DF <= 0 in GENCHI - ABORT' WRITE (*,*) 'Value of DF: ',df ! STOP 'DF <= 0 in GENCHI - ABORT' 10 genchi = 2.0*gengam(1.0,df/2.0) RETURN --- 37,43 ---- IF (.NOT. (df.LE.0.0)) GO TO 10 WRITE (*,*) 'DF <= 0 in GENCHI - ABORT' WRITE (*,*) 'Value of DF: ',df ! CALL XSTOPX ('DF <= 0 in GENCHI - ABORT') 10 genchi = 2.0*gengam(1.0,df/2.0) RETURN diff -rc libcruft.orig/ranlib/genf.f libcruft/ranlib/genf.f *** libcruft.orig/ranlib/genf.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/genf.f Mon Jun 7 15:35:07 1993 *************** *** 44,50 **** IF (.NOT. (dfn.LE.0.0.OR.dfd.LE.0.0)) GO TO 10 WRITE (*,*) 'Degrees of freedom nonpositive in GENF - abort!' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd ! STOP 'Degrees of freedom nonpositive in GENF - abort!' 10 xnum = genchi(dfn)/dfn C GENF = ( GENCHI( DFN ) / DFN ) / ( GENCHI( DFD ) / DFD ) --- 44,50 ---- IF (.NOT. (dfn.LE.0.0.OR.dfd.LE.0.0)) GO TO 10 WRITE (*,*) 'Degrees of freedom nonpositive in GENF - abort!' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd ! CALL XSTOPX ('Degrees of freedom nonpositive in GENF - abort!') 10 xnum = genchi(dfn)/dfn C GENF = ( GENCHI( DFN ) / DFN ) / ( GENCHI( DFD ) / DFD ) diff -rc libcruft.orig/ranlib/gennch.f libcruft/ranlib/gennch.f *** libcruft.orig/ranlib/gennch.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/gennch.f Mon Jun 7 15:34:58 1993 *************** *** 48,54 **** IF (.NOT. (df.LE.1.0.OR.xnonc.LT.0.0)) GO TO 10 WRITE (*,*) 'DF <= 1 or XNONC < 0 in GENNCH - ABORT' WRITE (*,*) 'Value of DF: ',df,' Value of XNONC',xnonc ! STOP 'DF <= 1 or XNONC < 0 in GENNCH - ABORT' 10 gennch = genchi(df-1.0) + gennor(sqrt(xnonc),1.0)**2 RETURN --- 48,54 ---- IF (.NOT. (df.LE.1.0.OR.xnonc.LT.0.0)) GO TO 10 WRITE (*,*) 'DF <= 1 or XNONC < 0 in GENNCH - ABORT' WRITE (*,*) 'Value of DF: ',df,' Value of XNONC',xnonc ! CALL XSTOPX ('DF <= 1 or XNONC < 0 in GENNCH - ABORT') 10 gennch = genchi(df-1.0) + gennor(sqrt(xnonc),1.0)**2 RETURN diff -rc libcruft.orig/ranlib/gennf.f libcruft/ranlib/gennf.f *** libcruft.orig/ranlib/gennf.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/gennf.f Mon Jun 7 15:56:26 1993 *************** *** 56,62 **** WRITE (*,*) '(3) Noncentrality parameter < 0.0' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd,'XNONC value: ', + xnonc ! STOP 'Degrees of freedom or noncent param our of range in GENNF' 10 xnum = gennch(dfn,xnonc)/dfn C GENNF = ( GENNCH( DFN, XNONC ) / DFN ) / ( GENCHI( DFD ) / DFD ) --- 56,63 ---- WRITE (*,*) '(3) Noncentrality parameter < 0.0' WRITE (*,*) 'DFN value: ',dfn,'DFD value: ',dfd,'XNONC value: ', + xnonc ! CALL XSTOPX ! + ('Degrees of freedom or noncent param our of range in GENNF') 10 xnum = gennch(dfn,xnonc)/dfn C GENNF = ( GENNCH( DFN, XNONC ) / DFN ) / ( GENCHI( DFD ) / DFD ) diff -rc libcruft.orig/ranlib/genunf.f libcruft/ranlib/genunf.f *** libcruft.orig/ranlib/genunf.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/genunf.f Mon Jun 7 15:34:37 1993 *************** *** 33,39 **** IF (.NOT. (low.GT.high)) GO TO 10 WRITE (*,*) 'LOW > HIGH in GENUNF: LOW ',low,' HIGH: ',high WRITE (*,*) 'Abort' ! STOP 'LOW > High in GENUNF - Abort' 10 genunf = low + (high-low)*ranf() --- 33,39 ---- IF (.NOT. (low.GT.high)) GO TO 10 WRITE (*,*) 'LOW > HIGH in GENUNF: LOW ',low,' HIGH: ',high WRITE (*,*) 'Abort' ! CALL XSTOPX ('LOW > High in GENUNF - Abort') 10 genunf = low + (high-low)*ranf() diff -rc libcruft.orig/ranlib/getcgn.f libcruft/ranlib/getcgn.f *** libcruft.orig/ranlib/getcgn.f Wed Apr 22 08:49:00 1992 --- libcruft/ranlib/getcgn.f Mon Jun 7 15:34:31 1993 *************** *** 47,53 **** IF (.NOT. (g.LT.0.OR.g.GT.numg)) GO TO 10 WRITE (*,*) ' Generator number out of range in SETCGN:', + ' Legal range is 1 to ',numg,' -- ABORT!' ! STOP ' Generator number out of range in SETCGN' 10 curntg = g RETURN --- 47,53 ---- IF (.NOT. (g.LT.0.OR.g.GT.numg)) GO TO 10 WRITE (*,*) ' Generator number out of range in SETCGN:', + ' Legal range is 1 to ',numg,' -- ABORT!' ! CALL XSTOPX (' Generator number out of range in SETCGN') 10 curntg = g RETURN diff -rc libcruft.orig/ranlib/getsd.f libcruft/ranlib/getsd.f *** libcruft.orig/ranlib/getsd.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/getsd.f Mon Jun 7 15:34:23 1993 *************** *** 62,68 **** IF (qrgnin()) GO TO 10 WRITE (*,*) ' GETSD called before random number generator ', + ' initialized -- abort!' ! STOP ' GETSD called before random number generator initialized' 10 CALL getcgn(g) iseed1 = cg1(g) --- 62,69 ---- IF (qrgnin()) GO TO 10 WRITE (*,*) ' GETSD called before random number generator ', + ' initialized -- abort!' ! CALL XSTOPX ! + (' GETSD called before random number generator initialized') 10 CALL getcgn(g) iseed1 = cg1(g) diff -rc libcruft.orig/ranlib/ignuin.f libcruft/ranlib/ignuin.f *** libcruft.orig/ranlib/ignuin.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/ignuin.f Mon Jun 7 15:34:09 1993 *************** *** 94,100 **** 100 WRITE (*,*) ' LOW: ',low,' HIGH: ',high WRITE (*,*) ' Abort on Fatal ERROR' IF (.NOT. (err.EQ.1)) GO TO 110 ! STOP 'LOW > HIGH in IGNUIN' GO TO 120 --- 94,100 ---- 100 WRITE (*,*) ' LOW: ',low,' HIGH: ',high WRITE (*,*) ' Abort on Fatal ERROR' IF (.NOT. (err.EQ.1)) GO TO 110 ! CALL XSTOPX ('LOW > HIGH in IGNUIN') GO TO 120 diff -rc libcruft.orig/ranlib/initgn.f libcruft/ranlib/initgn.f *** libcruft.orig/ranlib/initgn.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/initgn.f Mon Jun 7 15:34:03 1993 *************** *** 66,72 **** IF (qrgnin()) GO TO 10 WRITE (*,*) ' INITGN called before random number generator ', + ' initialized -- abort!' ! STOP ' INITGN called before random number generator initialized' 10 CALL getcgn(g) IF ((-1).NE. (isdtyp)) GO TO 20 --- 66,73 ---- IF (qrgnin()) GO TO 10 WRITE (*,*) ' INITGN called before random number generator ', + ' initialized -- abort!' ! CALL XSTOPX ! + (' INITGN called before random number generator initialized') 10 CALL getcgn(g) IF ((-1).NE. (isdtyp)) GO TO 20 diff -rc libcruft.orig/ranlib/mltmod.f libcruft/ranlib/mltmod.f *** libcruft.orig/ranlib/mltmod.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/mltmod.f Mon Jun 7 15:33:49 1993 *************** *** 39,45 **** WRITE (*,*) ' A, M, S out of order in MLTMOD - ABORT!' WRITE (*,*) ' A = ',a,' S = ',s,' M = ',m WRITE (*,*) ' MLTMOD requires: 0 < A < M; 0 < S < M' ! STOP ' A, M, S out of order in MLTMOD - ABORT!' 10 IF (.NOT. (a.LT.h)) GO TO 20 a0 = a --- 39,45 ---- WRITE (*,*) ' A, M, S out of order in MLTMOD - ABORT!' WRITE (*,*) ' A = ',a,' S = ',s,' M = ',m WRITE (*,*) ' MLTMOD requires: 0 < A < M; 0 < S < M' ! CALL XSTOPX (' A, M, S out of order in MLTMOD - ABORT!') 10 IF (.NOT. (a.LT.h)) GO TO 20 a0 = a diff -rc libcruft.orig/ranlib/setant.f libcruft/ranlib/setant.f *** libcruft.orig/ranlib/setant.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/setant.f Mon Jun 7 15:33:36 1993 *************** *** 65,71 **** IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETANT called before random number generator ', + ' initialized -- abort!' ! STOP ' SETANT called before random number generator initialized' 10 CALL getcgn(g) qanti(g) = qvalue --- 65,72 ---- IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETANT called before random number generator ', + ' initialized -- abort!' ! CALL XSTOPX ! + (' SETANT called before random number generator initialized') 10 CALL getcgn(g) qanti(g) = qvalue diff -rc libcruft.orig/ranlib/setgmn.f libcruft/ranlib/setgmn.f *** libcruft.orig/ranlib/setgmn.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/setgmn.f Mon Jun 7 15:33:21 1993 *************** *** 55,61 **** IF (.NOT. (p.LE.0)) GO TO 10 WRITE (*,*) 'P nonpositive in SETGMN' WRITE (*,*) 'Value of P: ',p ! STOP 'P nonpositive in SETGMN' 10 parm(1) = p C --- 55,61 ---- IF (.NOT. (p.LE.0)) GO TO 10 WRITE (*,*) 'P nonpositive in SETGMN' WRITE (*,*) 'Value of P: ',p ! CALL XSTOPX ('P nonpositive in SETGMN') 10 parm(1) = p C *************** *** 70,76 **** CALL spofa(covm,p,p,info) IF (.NOT. (info.NE.0)) GO TO 30 WRITE (*,*) ' COVM not positive definite in SETGMN' ! STOP ' COVM not positive definite in SETGMN' 30 icount = p + 1 C --- 70,76 ---- CALL spofa(covm,p,p,info) IF (.NOT. (info.NE.0)) GO TO 30 WRITE (*,*) ' COVM not positive definite in SETGMN' ! CALL XSTOPX (' COVM not positive definite in SETGMN') 30 icount = p + 1 C diff -rc libcruft.orig/ranlib/setsd.f libcruft/ranlib/setsd.f *** libcruft.orig/ranlib/setsd.f Wed Apr 22 08:49:01 1992 --- libcruft/ranlib/setsd.f Mon Jun 7 15:32:58 1993 *************** *** 62,68 **** IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETSD called before random number generator ', + ' initialized -- abort!' ! STOP ' SETSD called before random number generator initialized' 10 CALL getcgn(g) ig1(g) = iseed1 --- 62,69 ---- IF (qrgnin()) GO TO 10 WRITE (*,*) ' SETSD called before random number generator ', + ' initialized -- abort!' ! CALL XSTOPX ! + (' SETSD called before random number generator initialized') 10 CALL getcgn(g) ig1(g) = iseed1 diff -rc libcruft.orig/villad/vilerr.f libcruft/villad/vilerr.f *** libcruft.orig/villad/vilerr.f Wed Dec 2 21:54:57 1992 --- libcruft/villad/vilerr.f Mon Jun 7 15:55:08 1993 *************** *** 80,86 **** C C -- PROGRAM EXECUTION TERMINATES HERE C ! STOP C ELSE END IF --- 80,86 ---- C C -- PROGRAM EXECUTION TERMINATES HERE C ! CALL XSTOPX (' ') C ELSE END IF octave-1.1.0/liboctave/ 40777 415 17 0 5705521700 13013 5ustar jweusersoctave-1.1.0/liboctave/Makefile.in100666 415 17 5747 5662226741 15203 0ustar jweusers# # Makefile for octave's liboctave directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ MATRIX_INC = Array.h MArray.h Matrix.h mx-base.h mx-defs.h mx-ext.h \ mx-kludge.h CColVector.h CDiagMatrix.h CMatrix.h CRowVector.h \ CmplxAEPBAL.h CmplxCHOL.h CmplxDET.h CmplxHESS.h CmplxLU.h \ CmplxQR.h CmplxQRP.h CmplxSCHUR.h CmplxSVD.h EIG.h \ dColVector.h dDiagMatrix.h dMatrix.h dRowVector.h dbleAEPBAL.h \ dbleCHOL.h dbleDET.h dbleGEPBAL.h dbleHESS.h dbleLU.h dbleQR.h \ dbleQRP.h dbleSCHUR.h dbleSVD.h INCLUDES = Bounds.h CollocWt.h DAE.h DAEFunc.h FEGrid.h FSQP.h \ LinConst.h LP.h LPsolve.h NLConst.h NLEqn.h NLFunc.h NLP.h \ NPSOL.h ODE.h ODEFunc.h Objective.h QLD.h QP.h QPSOL.h \ Quad.h Range.h lo-error.h f77-uscore.h sun-utils.h \ $(MATRIX_INC) TEMPLATE_SRC = Array.cc TI_SRC = Array-C.cc Array-d.cc MATRIX_SRC = CColVector.cc CDiagMatrix.cc CMatrix.cc CRowVector.cc \ CmplxAEPBAL.cc CmplxCHOL.cc CmplxDET.cc CmplxHESS.cc CmplxLU.cc \ CmplxQR.cc CmplxQRP.cc CmplxSCHUR.cc CmplxSVD.cc EIG.cc \ dColVector.cc dDiagMatrix.cc dMatrix.cc dRowVector.cc \ dbleAEPBAL.cc dbleCHOL.cc dbleDET.cc dbleGEPBAL.cc dbleHESS.cc \ dbleLU.cc dbleQR.cc dbleQRP.cc dbleSCHUR.cc dbleSVD.cc SOURCES = Bounds.cc CollocWt.cc DAE.cc DAEFunc.cc FEGrid.cc FSQP.cc \ LinConst.cc LP.cc LPsolve.cc NLConst.cc NLEqn.cc NLFunc.cc \ NPSOL.cc Objective.cc ODE.cc ODEFunc.cc QLD.cc QP.cc QPSOL.cc \ Quad.cc Range.cc lo-error.cc sun-utils.cc $(TEMPLATE_SRC) \ $(TI_SRC) $(MATRIX_SRC) EXTRAS = MArray.cc mx-kludge.cc mx-inlines.cc DISTFILES = Makefile.in $(SOURCES) $(INCLUDES) $(EXTRAS) MAKEDEPS = $(patsubst %.cc, %.d, $(SOURCES)) OBJECTS = $(patsubst %.cc, %.o, $(SOURCES)) LIBOCTAVE_DEPEND := $(patsubst %, liboctave.a(%), $(OBJECTS)) all: liboctave.a .PHONY: all liboctave.a: $(OBJECTS) $(AR) $(ARFLAGS) liboctave.a $(OBJECTS) $(RANLIB) liboctave.a check: all .PHONY: check install: all $(top_srcdir)/mkinstalldirs $(libdir) $(includedir) rm -f $(libdir)/liboctave.a $(INSTALL_DATA) liboctave.a $(libdir)/liboctave.a $(RANLIB) $(libdir)/liboctave.a for f in $(INCLUDES) $(TEMPLATE_SRC) ; do \ rm -f $(includedir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(includedir)/$$f ; \ done .PHONY: install uninstall: rm -f $(libdir)/liboctave.a for f in $(INCLUDES) ; do rm -f $(includedir)/$$f ; done .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: rm -f *.a *.o .PHONY: clean mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile *.a $(TMPSRC) $(TMPINC) *.d .PHONY: distclean realclean: distclean rm -f tags TAGS *.d .PHONY: realclean local-dist: ln $(DISTFILES) ../`cat ../.fname`/liboctave .PHONY: local-dist dist: ln $(DISTFILES) ../`cat ../.fname`/liboctave .PHONY: dist -include $(MAKEDEPS) octave-1.1.0/liboctave/Bounds.cc100666 415 17 7123 5702420342 14651 0ustar jweusers// Bounds.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "Bounds.h" #include "lo-error.h" // error handling void Bounds::error (const char* msg) { (*current_liboctave_error_handler) ("fatal bounds error: ", msg); } Bounds::Bounds (void) { nb = 0; } Bounds::Bounds (int n) { nb = n; lb.resize (nb); ub.resize (nb); lb.fill (0.0); ub.fill (0.0); } Bounds::Bounds (const ColumnVector l, const ColumnVector u) { if (l.capacity () != u.capacity ()) { error ("inconsistent sizes for lower and upper bounds"); return; } nb = l.capacity (); lb = l; ub = u; } Bounds::Bounds (const Bounds& a) { nb = a.size (); lb = a.lower_bounds (); ub = a.upper_bounds (); } Bounds& Bounds::operator = (const Bounds& a) { nb = a.size (); lb = a.lower_bounds (); ub = a.upper_bounds (); return *this; } Bounds& Bounds::resize (int n) { nb = n; lb.resize (nb); ub.resize (nb); return *this; } double Bounds::lower_bound (int index) const { return lb.elem (index); } double Bounds::upper_bound (int index) const { return ub.elem (index); } ColumnVector Bounds::lower_bounds (void) const { return lb; } ColumnVector Bounds::upper_bounds (void) const { return ub; } int Bounds::size (void) const { return nb; } Bounds& Bounds::set_bound (int index, double low, double high) { lb.elem (index) = low; ub.elem (index) = high; return *this; } Bounds& Bounds::set_bounds (double low, double high) { lb.fill (low); ub.fill (high); return *this; } Bounds& Bounds::set_bounds (const ColumnVector l, const ColumnVector u) { if (l.capacity () != u.capacity ()) { error ("inconsistent sizes for lower and upper bounds"); return *this; } nb = l.capacity (); lb = l; ub = u; return *this; } Bounds& Bounds::set_lower_bound (int index, double low) { lb.elem (index) = low; return *this; } Bounds& Bounds::set_upper_bound (int index, double high) { ub.elem (index) = high; return *this; } Bounds& Bounds::set_lower_bounds (double low) { lb.fill (low); return *this; } Bounds& Bounds::set_upper_bounds (double high) { ub.fill (high); return *this; } Bounds& Bounds::set_lower_bounds (const ColumnVector l) { if (nb != l.capacity ()) { error ("inconsistent size for lower bounds"); return *this; } lb = l; return *this; } Bounds& Bounds::set_upper_bounds (const ColumnVector u) { if (nb != u.capacity ()) { error ("inconsistent size for upper bounds"); return *this; } ub = u; return *this; } ostream& operator << (ostream& os, const Bounds& b) { for (int i = 0; i < b.size (); i++) os << b.lower_bound (i) << " " << b.upper_bound (i) << "\n"; return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CollocWt.cc100666 415 17 13254 5702420334 15170 0ustar jweusers// CollocWt.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "CollocWt.h" #include "f77-uscore.h" #include "lo-error.h" extern "C" { int F77_FCN (jcobi) (int*, int*, int*, int*, double*, double*, double*, double*, double*, double*); int F77_FCN (dfopr) (int*, int*, int*, int*, int*, int*, double*, double*, double*, double*, double*); } // Error handling. void CollocWt::error (const char* msg) { (*current_liboctave_error_handler) ("fatal CollocWt error: %s", msg); } CollocWt::CollocWt (void) { n = 0; inc_left = 0; inc_right = 0; lb = 0.0; rb = 1.0; Alpha = 0.0; Beta = 0.0; initialized = 0; } CollocWt::CollocWt (int nc, int il, int ir) { n = nc; inc_left = il; inc_right = ir; lb = 0.0; rb = 1.0; Alpha = 0.0; Beta = 0.0; initialized = 0; } CollocWt::CollocWt (int nc, int ir, int il, double l, double r) { n = nc; inc_left = il; inc_right = ir; lb = l; rb = r; Alpha = 0.0; Beta = 0.0; initialized = 0; } CollocWt::CollocWt (int nc, double a, double b, int il, int ir) { n = nc; inc_left = il; inc_right = ir; lb = 0.0; rb = 1.0; Alpha = a; Beta = b; initialized = 0; } CollocWt::CollocWt (int nc, double a, double b, int ir, int il, double l, double r) { n = nc; inc_left = il; inc_right = ir; lb = l; rb = r; Alpha = a; Beta = b; initialized = 0; } CollocWt::CollocWt (const CollocWt& a) { n = a.n; inc_left = a.inc_left; inc_right = a.inc_right; lb = a.lb; rb = a.rb; r = a.r; q = a.q; A = a.A; B = a.B; nt = n + inc_left + inc_right; initialized = a.initialized; } CollocWt& CollocWt::operator = (const CollocWt& a) { n = a.n; inc_left = a.inc_left; inc_right = a.inc_right; lb = a.lb; rb = a.rb; r = a.r; q = a.q; A = a.A; B = a.B; nt = a.nt; initialized = a.initialized; return *this; } CollocWt& CollocWt::resize (int ncol) { n = ncol; initialized = 0; return *this; } CollocWt& CollocWt::add_left (void) { inc_left = 1; initialized = 0; return *this; } CollocWt& CollocWt::delete_left (void) { inc_left = 0; initialized = 0; return *this; } CollocWt& CollocWt::set_left (double val) { if (val >= rb) { error ("left bound greater than right bound"); return *this; } lb = val; initialized = 0; return *this; } CollocWt& CollocWt::add_right (void) { inc_right = 1; initialized = 0; return *this; } CollocWt& CollocWt::delete_right (void) { inc_right = 0; initialized = 0; return *this; } CollocWt& CollocWt::set_right (double val) { if (val <= lb) { error ("right bound less than left bound"); return *this; } rb = val; initialized = 0; return *this; } CollocWt& CollocWt::set_alpha (double val) { Alpha = val; initialized = 0; return *this; } CollocWt& CollocWt::set_beta (double val) { Beta = val; initialized = 0; return *this; } void CollocWt::init (void) { // Check for possible errors. double wid = rb - lb; if (wid <= 0.0) { error ("width less than or equal to zero"); return; } nt = n + inc_left + inc_right; if (nt < 0) { error ("total number of collocation points less than zero"); return; } else if (nt == 0) return; double *dif1 = new double [nt]; double *dif2 = new double [nt]; double *dif3 = new double [nt]; double *vect = new double [nt]; r.resize (nt); q.resize (nt); A.resize (nt, nt); B.resize (nt, nt); double *pr = r.fortran_vec (); // Compute roots. F77_FCN (jcobi) (&nt, &n, &inc_left, &inc_right, &Alpha, &Beta, dif1, dif2, dif3, pr); int id; int i, j; // First derivative weights. id = 1; for (i = 1; i <= nt; i++) { F77_FCN (dfopr) (&nt, &n, &inc_left, &inc_right, &i, &id, dif1, dif2, dif3, pr, vect); for (j = 0; j < nt; j++) A (i-1, j) = vect[j]; } // Second derivative weights. id = 2; for (i = 1; i <= nt; i++) { F77_FCN (dfopr) (&nt, &n, &inc_left, &inc_right, &i, &id, dif1, dif2, dif3, pr, vect); for (j = 0; j < nt; j++) B (i-1, j) = vect[j]; } // Gaussian quadrature weights. id = 3; double *pq = q.fortran_vec (); F77_FCN (dfopr) (&nt, &n, &inc_left, &inc_right, &i, &id, dif1, dif2, dif3, pr, pq); delete [] dif1; delete [] dif2; delete [] dif3; delete [] vect; initialized = 1; } ostream& operator << (ostream& os, const CollocWt& a) { if (a.left_included ()) os << "left boundary is included\n"; else os << "left boundary is not included\n"; if (a.right_included ()) os << "right boundary is included\n"; else os << "right boundary is not included\n"; os << "\n"; os << a.Alpha << " " << a.Beta << "\n\n" << a.r << "\n\n" << a.q << "\n\n" << a.A << "\n" << a.B << "\n"; return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/DAE.cc100666 415 17 23642 5702420334 14035 0ustar jweusers// DAE.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "DAE.h" #include "f77-uscore.h" #include "lo-error.h" extern "C" { int F77_FCN (ddassl) (int (*)(double*, double*, double*, double*, int*, double*, int*), const int*, double*, double*, double*, double*, const int*, const double*, const double*, int*, double*, const int*, int*, const int*, const double*, const int*, int (*)(double*, double*, double*, double*, double*, double*, int*)); } static DAEFunc::DAERHSFunc user_fun; static DAEFunc::DAEJacFunc user_jac; static int nn; DAE::DAE (void) { n = 0; t = 0.0; stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; DAEFunc::set_function (0); DAEFunc::set_jacobian_function (0); liw = 0; lrw = 0; info = new int [15]; iwork = (int *) 0; rwork = (double *) 0; for (int i = 0; i < 15; i++) info [i] = 0; } DAE::DAE (int size) { n = size; t = 0.0; stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; DAEFunc::set_function (0); DAEFunc::set_jacobian_function (0); liw = 20 + n; lrw = 40 + 9*n + n*n; info = new int [15]; iwork = new int [liw]; rwork = new double [lrw]; for (int i = 0; i < 15; i++) info [i] = 0; } DAE::DAE (const Vector& state, double time, DAEFunc& f) { n = state.capacity (); t = time; x = state; xdot.resize (n, 0.0); stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; DAEFunc::set_function (f.function ()); DAEFunc::set_jacobian_function (f.jacobian_function ()); liw = 20 + n; lrw = 40 + 9*n + n*n; info = new int [15]; iwork = new int [liw]; rwork = new double [lrw]; for (int i = 0; i < 15; i++) info [i] = 0; } DAE::DAE (const Vector& state, const Vector& deriv, double time, DAEFunc& f) { if (deriv.capacity () != state.capacity ()) { (*current_liboctave_error_handler) ("x, xdot size mismatch in DAE constructor"); n = 0; t = 0.0; return; } n = state.capacity (); t = time; xdot = deriv; x = state; stop_time_set = 0; stop_time = 0.0; DAEFunc::set_function (f.function ()); DAEFunc::set_jacobian_function (f.jacobian_function ()); liw = 20 + n; lrw = 40 + 9*n + n*n; info = new int [15]; iwork = new int [liw]; rwork = new double [lrw]; for (int i = 0; i < 15; i++) info [i] = 0; } DAE::~DAE (void) { delete info; delete rwork; delete iwork; } Vector DAE::deriv (void) { return xdot; } void DAE::initialize (const Vector& state, double time) { integration_error = 0; restart = 1; x = state; int nx = x.capacity (); xdot.resize (nx, 0.0); t = time; } void DAE::initialize (const Vector& state, const Vector& deriv, double time) { integration_error = 0; restart = 1; xdot = deriv; x = state; t = time; } int ddassl_f (double *time, double *state, double *deriv, double *delta, int *ires, double *rpar, int *ipar) { Vector tmp_deriv (nn); Vector tmp_state (nn); Vector tmp_delta (nn); for (int i = 0; i < nn; i++) { tmp_deriv.elem (i) = deriv [i]; tmp_state.elem (i) = state [i]; } tmp_delta = user_fun (tmp_state, tmp_deriv, *time); if (tmp_delta.length () == 0) *ires = -2; else { for (i = 0; i < nn; i++) delta [i] = tmp_delta.elem (i); } return 0; } int ddassl_j (double *time, double *state, double *deriv, double *pd, double *cj, double *rpar, int *ipar) { Vector tmp_state (nn); Vector tmp_deriv (nn); // XXX FIXME XXX Matrix tmp_dfdxdot (nn, nn); Matrix tmp_dfdx (nn, nn); DAEFunc::DAEJac tmp_jac; tmp_jac.dfdxdot = &tmp_dfdxdot; tmp_jac.dfdx = &tmp_dfdx; tmp_jac = user_jac (tmp_state, tmp_deriv, *time); // Fix up the matrix of partial derivatives for dassl. tmp_dfdx = tmp_dfdx + (tmp_dfdxdot * (*cj)); for (int j = 0; j < nn; j++) for (int i = 0; i < nn; i++) pd [nn * j + i] = tmp_dfdx.elem (i, j); return 0; } Vector DAE::integrate (double tout) { integration_error = 0; if (DAEFunc::jacobian_function ()) iwork [4] = 1; else iwork [4] = 0; double *px = x.fortran_vec (); double *pxdot = xdot.fortran_vec (); nn = n; user_fun = DAEFunc::fun; user_jac = DAEFunc::jac; if (stop_time_set) { info [3] = 1; rwork [0] = stop_time; } else info [3] = 0; double abs_tol = absolute_tolerance (); double rel_tol = relative_tolerance (); if (initial_step_size () >= 0.0) { rwork[2] = initial_step_size (); info[7] = 1; } else info[7] = 0; if (maximum_step_size () >= 0.0) { rwork[2] = maximum_step_size (); info[6] = 1; } else info[6] = 0; double dummy; int idummy; if (restart) { restart = 0; info[0] = 0; } // again: F77_FCN (ddassl) (ddassl_f, &n, &t, px, pxdot, &tout, info, &rel_tol, &abs_tol, &idid, rwork, &lrw, iwork, &liw, &dummy, &idummy, ddassl_j); switch (idid) { case 1: // A step was successfully taken in the // intermediate-output mode. The code has not yet reached // TOUT. break; case 2: // The integration to TSTOP was successfully completed // (T=TSTOP) by stepping exactly to TSTOP. break; case 3: // The integration to TOUT was successfully completed // (T=TOUT) by stepping past TOUT. Y(*) is obtained by // interpolation. YPRIME(*) is obtained by interpolation. break; case -1: // A large amount of work has been expended. (About 500 steps). case -2: // The error tolerances are too stringent. case -3: // The local error test cannot be satisfied because you // specified a zero component in ATOL and the // corresponding computed solution component is zero. // Thus, a pure relative error test is impossible for // this component. case -6: // DDASSL had repeated error test failures on the last // attempted step. case -7: // The corrector could not converge. case -8: // The matrix of partial derivatives is singular. case -9: // The corrector could not converge. There were repeated // error test failures in this step. case -10: // The corrector could not converge because IRES was // equal to minus one. case -11: // IRES equal to -2 was encountered and control is being // returned to the calling program. case -12: // DDASSL failed to compute the initial YPRIME. case -33: // The code has encountered trouble from which it cannot // recover. A message is printed explaining the trouble // and control is returned to the calling program. For // example, this occurs when invalid input is detected. default: integration_error = 1; break; } t = tout; return x; } Matrix DAE::integrate (const Vector& tout, Matrix& xdot_out) { Matrix retval; int n_out = tout.capacity (); if (n_out > 0 && n > 0) { retval.resize (n_out, n); xdot_out.resize (n_out, n); for (int i = 0; i < n; i++) { retval.elem (0, i) = x.elem (i); xdot_out.elem (0, i) = xdot.elem (i); } for (int j = 1; j < n_out; j++) { ColumnVector x_next = integrate (tout.elem (j)); if (integration_error) return retval; for (i = 0; i < n; i++) { retval.elem (j, i) = x_next.elem (i); xdot_out.elem (j, i) = xdot.elem (i); } } } return retval; } Matrix DAE::integrate (const Vector& tout, Matrix& xdot_out, const Vector& tcrit) { Matrix retval; int n_out = tout.capacity (); if (n_out > 0 && n > 0) { retval.resize (n_out, n); xdot_out.resize (n_out, n); for (int i = 0; i < n; i++) { retval.elem (0, i) = x.elem (i); xdot_out.elem (0, i) = xdot.elem (i); } int n_crit = tcrit.capacity (); if (n_crit > 0) { int i_crit = 0; int i_out = 1; double next_crit = tcrit.elem (0); double next_out; while (i_out < n_out) { int do_restart = 0; next_out = tout.elem (i_out); if (i_crit < n_crit) next_crit = tcrit.elem (i_crit); int save_output; double t_out; if (next_crit == next_out) { set_stop_time (next_crit); t_out = next_out; save_output = 1; i_out++; i_crit++; do_restart = 1; } else if (next_crit < next_out) { if (i_crit < n_crit) { set_stop_time (next_crit); t_out = next_crit; save_output = 0; i_crit++; do_restart = 1; } else { clear_stop_time (); t_out = next_out; save_output = 1; i_out++; } } else { set_stop_time (next_crit); t_out = next_out; save_output = 1; i_out++; } ColumnVector x_next = integrate (t_out); if (integration_error) return retval; if (save_output) { for (i = 0; i < n; i++) { retval.elem (i_out-1, i) = x_next.elem (i); xdot_out.elem (i_out-1, i) = xdot.elem (i); } } if (do_restart) force_restart (); } } else { retval = integrate (tout, xdot_out); if (integration_error) return retval; } } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/DAEFunc.cc100666 415 17 3010 5702420333 14613 0ustar jweusers// DAEFunc.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "DAEFunc.h" DAEFunc::DAEFunc (void) { fun = 0; jac = 0; } DAEFunc::DAEFunc (DAERHSFunc f) { fun = f; jac = 0; } DAEFunc::DAEFunc (DAERHSFunc f, DAEJacFunc j) { fun = f; jac = j; } DAEFunc::DAEFunc (const DAEFunc& a) { fun = a.fun; jac = a.jac; } DAEFunc& DAEFunc::operator = (const DAEFunc& a) { fun = a.fun; jac = a.jac; return *this; } DAEFunc::DAERHSFunc DAEFunc::function (void) const { return fun; } DAEFunc& DAEFunc::set_function (DAERHSFunc f) { fun = f; return *this; } DAEFunc::DAEJacFunc DAEFunc::jacobian_function (void) const { return jac; } DAEFunc& DAEFunc::set_jacobian_function (DAEJacFunc j) { jac = j; return *this; } octave-1.1.0/liboctave/FEGrid.cc100666 415 17 4744 5702420332 14524 0ustar jweusers// FEGrid.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "FEGrid.h" #include "lo-error.h" // error handling void FEGrid::error (const char* msg) const { (*current_liboctave_error_handler) ("fatal FEGrid error: %s", msg); } void FEGrid::nel_error (void) const { error ("number of elements less than 1"); } // Constructors FEGrid::FEGrid (int nel, double width) { if (nel < 1) { nel_error (); return; } elem.resize (nel+1); for (int i = 0; i <= nel; i++) elem.elem (i) = i * width; } FEGrid::FEGrid (int nel, double left, double right) { if (nel < 1) { nel_error (); return; } elem.resize (nel+1); double width = (right - left) / (double) nel; for (int i = 0; i <= nel; i++) elem.elem (i) = i * width + left; check_grid (); } int FEGrid::element (double x) const { if (! in_bounds (x)) { error ("value not within grid boundaries"); return -1; } int nel = elem.capacity () - 1; for (int i = 1; i <= nel; i++) { if (x >= elem.elem (i-1) && x <= elem.elem (i)) return i; } return -1; } void FEGrid::check_grid (void) const { int nel = elem.capacity () - 1; if (nel < 1) { nel_error (); return; } for (int i = 1; i <= nel; i++) { if (elem.elem (i-1) > elem.elem (i)) { error ("element boundaries not in ascending order"); return; } if (elem.elem (i-1) == elem.elem (i)) { error ("zero width element"); return; } } } ostream& operator << (ostream& s, const FEGrid& g) { s << g.element_boundaries (); return s; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/FSQP.cc100666 415 17 2020 5702420332 14156 0ustar jweusers// FSQP.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef FSQP_MISSING #include "FSQP.h" #include "f77-uscore.h" #endif /* FSQP_MISSING */ /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LinConst.cc100666 415 17 6633 5702420331 15153 0ustar jweusers// LinConst.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "LinConst.h" #include "lo-error.h" // error handling void LinConst::error (const char* msg) { (*current_liboctave_error_handler) ("fatal LinConst error: %s", msg); } LinConst::LinConst (const Matrix& a_eq, const Vector& b_eq, const Matrix& a_ineq, const Vector& b_ineq) { // Need some checks here. int nc_eq = b_eq.capacity (); int nc_ineq = b_ineq.capacity (); nb = nc_eq + nc_ineq; lb.resize (nb); ub.resize (nb); lb.insert (b_eq, 0); lb.insert (-b_ineq, nc_eq); ub.insert (b_eq, 0); ub.fill (DBL_MAX, nc_eq, nb-1); int nx = a_eq.columns (); A.resize (nb, nx); A.insert (a_eq, 0, 0); A.insert (a_ineq, nc_eq, 0); } LinConst& LinConst::resize (int nc, int n) { nb = nc; lb.resize (nb); A.resize (nb, n); ub.resize (nb); return *this; } Matrix LinConst::eq_constraint_matrix (void) const { int anr = A.rows (); int anc = A.columns (); Matrix retval (anr, anc); int count = 0; for (int i = 0; i < anr; i++) { if (lb.elem (i) == ub.elem (i)) { retval.insert (A.extract (i, 0, i, anc-1), count, 0); count++; } } retval.resize (count, anc); return retval; } Matrix LinConst::ineq_constraint_matrix (void) const { int anr = A.rows (); int anc = A.columns (); Matrix retval (2*anr, anc); int count = 0; for (int i = 0; i < anr; i++) { if (lb.elem (i) != ub.elem (i)) { Matrix tmp = A.extract (i, 0, i, anc-1); retval.insert (tmp, count, 0); count++; if (ub.elem (i) < DBL_MAX) { retval.insert (-tmp, count, 0); count++; } } } retval.resize (count, anc); return retval; } Vector LinConst::eq_constraint_vector (void) const { Vector retval (nb); int count = 0; for (int i = 0; i < nb; i++) { if (lb.elem (i) == ub.elem (i)) { retval.elem (count) = lb.elem (i); count++; } } retval.resize (count); return retval; } Vector LinConst::ineq_constraint_vector (void) const { Vector retval (2*nb); int count = 0; for (int i = 0; i < nb; i++) { if (lb.elem (i) != ub.elem (i)) { retval.elem (count) = -lb.elem (i); count++; if (ub.elem (i) < DBL_MAX) { retval.elem (count) = ub.elem (i); count++; } } } retval.resize (count); return retval; } ostream& operator << (ostream& os, const LinConst& c) { for (int i = 0; i < c.size (); i++) os << c.lower_bound (i) << " " << c.upper_bound (i) << "\n"; os << "\n"; os << c.constraint_matrix (); return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LP.cc100666 415 17 3124 5702420332 13726 0ustar jweusers// LP.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "LP.h" LP::LP (void) {} LP::LP (const Vector& c_arg) : c (c_arg) { } LP::LP (const Vector& c_arg, const Bounds& b) : c (c_arg), bnds (b) { } LP::LP (const Vector& c_arg, const LinConst& l) : c (c_arg), lc (l) { } LP::LP (const Vector& c_arg, const Bounds& b, const LinConst& l) : c (c_arg), bnds (b), lc (l) { } Vector LP::minimize (void) { double objf; int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector LP::minimize (double& objf) { int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector LP::minimize (double& objf, int& inform) { Vector lambda; return minimize (objf, inform, lambda); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LPsolve.cc100666 415 17 2215 5702420331 14776 0ustar jweusers// LPsolve.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dColVector.h" #include "LPsolve.h" Vector LPsolve::minimize (double& objf, int& inform, Vector& lambda) { return Vector (); } void LPsolve::set_default_options (void) { // Maybe this isn't needed? } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLConst.cc100666 415 17 2575 5702420330 14742 0ustar jweusers// NLConst.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "NLConst.h" NLConst::NLConst (void) : Bounds (), NLFunc () { } NLConst::NLConst (int n) : Bounds (n), NLFunc () { } NLConst::NLConst (const Vector& l, const NLFunc f, const Vector& u) : Bounds (l, u), NLFunc (f) { } NLConst::NLConst (const NLConst& a) : Bounds (a.lb, a.ub), NLFunc (a.fun, a.jac) { } NLConst& NLConst::operator = (const NLConst& a) { nb = a.nb; lb = a.lb; fun = a.fun; jac = a.jac; ub = a.ub; return *this; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLEqn.cc100666 415 17 12443 5702420330 14412 0ustar jweusers// NLEqn.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "NLEqn.h" #include "dMatrix.h" #include "f77-uscore.h" #include "lo-error.h" extern "C" { int F77_FCN (hybrd1) (int (*)(int*, double*, double*, int*), const int*, double*, double*, const double*, int*, double*, const int*); int F77_FCN (hybrj1) (int (*)(int*, double*, double*, double*, int*, int*), const int*, double*, double*, double*, const int*, const double*, int*, double*, const int*); } static nonlinear_fcn user_fun; static jacobian_fcn user_jac; // error handling void NLEqn::error (const char* msg) { (*current_liboctave_error_handler) ("fatal NLEqn error: %s", msg); } // Constructors NLEqn::NLEqn (void) : NLFunc (), n (0), x () { } NLEqn::NLEqn (const Vector& xvec, const NLFunc f) : NLFunc (f), n (xvec.capacity ()), x (xvec) { } NLEqn::NLEqn (const NLEqn& a) : NLFunc (a.fun, a.jac), n (a.n), x (a.x) { } void NLEqn::resize (int nn) { if (n != nn) { n = nn; x.resize (n); } } int NLEqn::size (void) const { return n; } // Assignment NLEqn& NLEqn::operator = (const NLEqn& a) { fun = a.fun; jac = a.jac; x = a.n; return *this; } Vector NLEqn::states (void) const { return x; } void NLEqn::set_states (const Vector& xvec) { if (xvec.capacity () != n) { error ("dimension error"); return; } x = xvec; } // Other operations Vector NLEqn::solve (const Vector& xvec) { set_states (xvec); int info; return solve (info); } Vector NLEqn::solve (const Vector& xvec, int& info) { set_states (xvec); return solve (info); } Vector NLEqn::solve (void) { int info; return solve (info); } int hybrd1_fcn (int *n, double *x, double *fvec, int *iflag) { int nn = *n; Vector tmp_f (nn); Vector tmp_x (nn); for (int i = 0; i < nn; i++) tmp_x.elem (i) = x[i]; tmp_f = (*user_fun) (tmp_x); if (tmp_f.length () == 0) *iflag = -1; else { for (i = 0; i < nn; i++) fvec[i] = tmp_f.elem (i); } return 0; } int hybrj1_fcn (int *n, double *x, double *fvec, double *fjac, int *ldfjac, int *iflag) { int nn = *n; Vector tmp_x (nn); for (int i = 0; i < nn; i++) tmp_x.elem (i) = x[i]; int flag = *iflag; if (flag == 1) { Vector tmp_f (nn); tmp_f = (*user_fun) (tmp_x); if (tmp_f.length () == 0) *iflag = -1; else { for (i = 0; i < nn; i++) fvec[i] = tmp_f.elem (i); } } else { Matrix tmp_fj (nn, nn); tmp_fj = (*user_jac) (tmp_x); if (tmp_fj.rows () == 0 || tmp_fj.columns () == 0) *iflag = -1; else { int ld = *ldfjac; for (int j = 0; j < nn; j++) for (i = 0; i < nn; i++) fjac[j*ld+i] = tmp_fj.elem (i, j); } } return 0; } Vector NLEqn::solve (int& info) { int tmp_info = 0; if (n == 0) { error ("equation set not initialized"); return Vector (); } double tol = tolerance (); double *fvec = new double [n]; double *px = new double [n]; for (int i = 0; i < n; i++) px[i] = x.elem (i); user_fun = fun; user_jac = jac; if (jac) { int lwa = (n*(n+13))/2; double *wa = new double [lwa]; double *fjac = new double [n*n]; F77_FCN (hybrj1) (hybrj1_fcn, &n, px, fvec, fjac, &n, &tol, &tmp_info, wa, &lwa); delete [] wa; delete [] fjac; } else { int lwa = (n*(3*n+13))/2; double *wa = new double [lwa]; F77_FCN (hybrd1) (hybrd1_fcn, &n, px, fvec, &tol, &tmp_info, wa, &lwa); delete [] wa; } Vector retval; info = tmp_info; if (info >= 0) { retval.resize (n); for (i = 0; i < n; i++) retval.elem (i) = px[i]; } delete [] fvec; delete [] px; return retval; } NLEqn_options::NLEqn_options (void) { init (); } NLEqn_options::NLEqn_options (const NLEqn_options& opt) { copy (opt); } NLEqn_options& NLEqn_options::operator = (const NLEqn_options& opt) { if (this != &opt) copy (opt); return *this; } NLEqn_options::~NLEqn_options (void) { } void NLEqn_options::init (void) { double sqrt_eps = sqrt (DBL_EPSILON); x_tolerance = sqrt_eps; } void NLEqn_options::copy (const NLEqn_options& opt) { x_tolerance = opt.x_tolerance; } void NLEqn_options::set_default_options (void) { init (); } void NLEqn_options::set_tolerance (double val) { x_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } double NLEqn_options::tolerance (void) { return x_tolerance; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLFunc.cc100666 415 17 3244 5702420327 14547 0ustar jweusers// NLFunc.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "NLFunc.h" NLFunc::NLFunc (void) { fun = 0; jac = 0; } NLFunc::NLFunc (const nonlinear_fcn f) { fun = f; jac = 0; } NLFunc::NLFunc (const nonlinear_fcn f, const jacobian_fcn j) { fun = f; jac = j; } NLFunc::NLFunc (const NLFunc& a) { fun = a.function (); jac = a.jacobian_function (); } NLFunc& NLFunc::operator = (const NLFunc& a) { fun = a.function (); jac = a.jacobian_function (); return *this; } nonlinear_fcn NLFunc::function (void) const { return fun; } NLFunc& NLFunc::set_function (const nonlinear_fcn f) { fun = f; return *this; } jacobian_fcn NLFunc::jacobian_function (void) const { return jac; } NLFunc& NLFunc::set_jacobian_function (const jacobian_fcn j) { jac = j; return *this; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NPSOL.cc100666 415 17 37376 5702420327 14352 0ustar jweusers// NPSOL.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #ifndef NPSOL_MISSING #include "dMatrix.h" #include "NPSOL.h" #include "f77-uscore.h" #include "sun-utils.h" extern "C" { int F77_FCN (npoptn) (char *, long); int F77_FCN (npsol) (int *, int *, int *, int *, int *, int *, double *, double *, double *, int (*)(int*, int*, int*, int*, int*, double*, double*, double*, int*), int (*)(int*, int*, double*, double*, double*, int*), int *, int *, int *, double *, double *, double *, double *, double *, double *, double *, int *, int *, double *, int *); } // XXX FIXME XXX -- would be nice to not have to have this global // variable. // Nonzero means an error occurred in the calculation of the objective // function, and the user wants us to quit. int npsol_objective_error = 0; static objective_fcn user_phi; static gradient_fcn user_grad; static nonlinear_fcn user_g; static jacobian_fcn user_jac; int npsol_objfun (int *mode, int *n, double *xx, double *objf, double *objgrd, int *nstate) { int nn = *n; Vector tmp_x (nn); npsol_objective_error = 0; for (int i = 0; i < nn; i++) tmp_x.elem (i) = xx[i]; if (*mode == 0 || *mode == 2) { double value = (*user_phi) (tmp_x); if (npsol_objective_error) { *mode = -1; return 0; } #if defined (sun) && defined (__GNUC__) assign_double (objf, value); #else *objf = value; #endif } if ((*mode == 1 || *mode == 2) && user_grad) { Vector tmp_grad (nn); tmp_grad = (*user_grad) (tmp_x); if (tmp_grad.length () == 0) *mode = -1; else { for (i = 0; i < nn; i++) objgrd[i] = tmp_grad.elem (i); } } return 0; } int npsol_confun (int *mode, int *ncnln, int *n, int *nrowj, int *needc, double *xx, double *cons, double *cjac, int *nstate) { int nn = *n, nncnln = *ncnln; Vector tmp_x (nn); Vector tmp_c (nncnln); for (int i = 0; i < nn; i++) tmp_x.elem (i) = xx[i]; tmp_c = (*user_g) (tmp_x); if (tmp_c.length () == 0) { *mode = -1; return 0; } else { for (i = 0; i < nncnln; i++) cons[i] = tmp_c.elem (i); } if (user_jac) { Matrix tmp_jac (nncnln, nn); tmp_jac = (*user_jac) (tmp_x); if (tmp_jac.rows () == 0 || tmp_jac.columns () == 0) *mode = -1; else { int ld = *nrowj; for (int j = 0; j < nn; j++) for (i = 0; i < nncnln; i++) cjac[i+j*ld] = tmp_jac (i, j); } } return 0; } Vector NPSOL::minimize (void) { double objf; int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector NPSOL::minimize (double& objf) { int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector NPSOL::minimize (double& objf, int& inform) { Vector lambda; return minimize (objf, inform, lambda); } Vector NPSOL::minimize (double& objf, int& inform, Vector& lambda) { // Dimensions of various things. int n = x.capacity (); int nclin = lc.size (); int ncnln = nlc.size (); int nrowa = 1 > nclin ? 1 : nclin; int nrowj = 1 > ncnln ? 1 : ncnln; int nrowr = n; // Informative stuff. int iter; int *istate = new int [n+nclin+ncnln]; // User defined function stuff is defined above in the functions // npsol_confun() and npsol_objfun(); // Constraint stuff. double dummy; double *pclin = &dummy; Matrix clin; if (nclin > 0) { clin = lc.constraint_matrix (); pclin = clin.fortran_vec (); } double *clow = new double [n+nclin+ncnln]; double *cup = new double [n+nclin+ncnln]; if (bnds.size () > 0) { for (int i = 0; i < n; i++) { clow[i] = bnds.lower_bound (i); cup[i] = bnds.upper_bound (i); } } else { double huge = 1.0e30; for (int i = 0; i < n; i++) { clow[i] = -huge; cup[i] = huge; } } for (int i = 0; i < nclin; i++) { clow[i+n] = lc.lower_bound (i); cup[i+n] = lc.upper_bound (i); } for (i = 0; i < ncnln; i++) { clow[i+n+nclin] = nlc.lower_bound (i); cup[i+n+nclin] = nlc.upper_bound (i); } double *c = 0; double *cjac = 0; if (ncnln > 0) { c = new double [ncnln]; cjac = new double [nrowj*n]; } // Objective stuff. double *objgrd = new double [n]; // Other stuff. double *r = new double [n*n]; lambda.resize (n+nclin+ncnln); double *pclambda = lambda.fortran_vec (); // Decision variable stuff. double *px = x.fortran_vec (); // Workspace parameters. int lenw; int leniw = 3 * n + nclin + 2 * ncnln; if (nclin == 0 && ncnln == 0) lenw = 20*n; else if (ncnln == 0) lenw = 2*n*(10 + n) + 11*nclin; else lenw = 2*n*(n + 10) + nclin*(n + 11) + ncnln*(2*n + 21); int *iw = new int [leniw]; double *w = new double [lenw]; user_phi = phi.objective_function (); user_grad = phi.gradient_function (); user_g = nlc.function (); user_jac = nlc.jacobian_function (); pass_options_to_npsol (); if (! user_jac && ! user_grad) F77_FCN (npoptn) ("Derivative Level 0", 18L); else if (! user_jac && user_grad) F77_FCN (npoptn) ("Derivative Level 1", 18L); else if (user_jac && ! user_grad) F77_FCN (npoptn) ("Derivative Level 2", 18L); else if (user_jac && user_grad) F77_FCN (npoptn) ("Derivative Level 3", 18L); int attempt = 0; while (attempt++ < 5) { F77_FCN (npsol) (&n, &nclin, &ncnln, &nrowa, &nrowj, &nrowr, pclin, clow, cup, npsol_confun, npsol_objfun, &inform, &iter, istate, c, cjac, pclambda, &objf, objgrd, r, px, iw, &leniw, w, &lenw); if (inform == 6 || inform == 1) continue; else break; } // Clean up. delete [] istate; delete [] clow; delete [] cup; delete [] c; delete [] cjac; delete [] objgrd; delete [] r; delete [] iw; delete [] w; // See how it went. return x; } Vector NPSOL::minimize (const Vector& xnew) { x = xnew; return minimize (); } Vector NPSOL::minimize (const Vector& xnew, double& objf) { x = xnew; return minimize (objf); } Vector NPSOL::minimize (const Vector& xnew, double& objf, int& inform) { x = xnew; return minimize (objf, inform); } Vector NPSOL::minimize (const Vector& xnew, double& objf, int& inform, Vector& lambda) { x = xnew; return minimize (objf, inform, lambda); } NPSOL& NPSOL::option (char *s) { cerr << "This function no longer has any effect.\n" << "Use the NPSOL_option class instead\n"; return *this; } NPSOL_options::NPSOL_options (void) { init (); } NPSOL_options::NPSOL_options (const NPSOL_options& opt) { copy (opt); } NPSOL_options& NPSOL_options::operator = (const NPSOL_options& opt) { if (this != &opt) copy (opt); return *this; } NPSOL_options::~NPSOL_options (void) { } void NPSOL_options::init (void) { x_central_difference_interval = -1.0; x_crash_tolerance = 0.1; x_difference_interval = -1.0; x_function_precision = pow (DBL_EPSILON, 0.9); x_infinite_bound = 1.0e+30; x_infinite_step = 1.0e+30; x_linear_feasibility_tolerance = sqrt (DBL_EPSILON); x_linesearch_tolerance = 0.9; x_nonlinear_feasibility_tolerance = sqrt (DBL_EPSILON); x_optimality_tolerance = pow (DBL_EPSILON, 0.8); x_derivative_level = 0; x_major_iteration_limit = -1; x_minor_iteration_limit = -1; x_major_print_level = 0; x_minor_print_level = 0; x_start_objective_check = 1; x_start_constraint_check = 1; x_stop_objective_check = -1; x_stop_constraint_check = -1; x_verify_level = 0; } void NPSOL_options::copy (const NPSOL_options& opt) { x_central_difference_interval = opt.x_central_difference_interval; x_crash_tolerance = opt.x_crash_tolerance; x_difference_interval = opt.x_difference_interval; x_function_precision = opt.x_function_precision; x_infinite_bound = opt.x_infinite_bound; x_infinite_step = opt.x_infinite_step; x_linear_feasibility_tolerance = opt.x_linear_feasibility_tolerance; x_linesearch_tolerance = opt.x_linesearch_tolerance; x_nonlinear_feasibility_tolerance = opt.x_nonlinear_feasibility_tolerance; x_optimality_tolerance = opt.x_optimality_tolerance; x_derivative_level = opt.x_derivative_level; x_major_iteration_limit = opt.x_major_iteration_limit; x_minor_iteration_limit = opt.x_minor_iteration_limit; x_major_print_level = opt.x_major_print_level; x_minor_print_level = opt.x_minor_print_level; x_start_objective_check = opt.x_start_objective_check; x_start_constraint_check = opt.x_start_constraint_check; x_stop_objective_check = opt.x_stop_objective_check; x_stop_constraint_check = opt.x_stop_constraint_check; x_verify_level = opt.x_verify_level; } void NPSOL_options::set_default_options (void) { init (); } /* * Passing invalid values to the set_* functions will result in * setting the default option. */ void NPSOL_options::set_central_difference_interval (double val) { x_central_difference_interval = (val > 0.0) ? val : -1.0; } void NPSOL_options::set_crash_tolerance (double val) { x_crash_tolerance = (val >= 0.0) ? val : 0.1; } void NPSOL_options::set_difference_interval (double val) { x_difference_interval = (val > 0.0) ? val : -1.0; } void NPSOL_options::set_function_precision (double val) { x_function_precision = (val > 0.0) ? val : pow (DBL_EPSILON, 0.9); } void NPSOL_options::set_infinite_bound (double val) { x_infinite_bound = (val > 0.0) ? val : 1.0e+30; } void NPSOL_options::set_infinite_step (double val) { x_infinite_step = (val > 0.0) ? val : 1.0e+30; } void NPSOL_options::set_linear_feasibility_tolerance (double val) { x_linear_feasibility_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } void NPSOL_options::set_linesearch_tolerance (double val) { x_linesearch_tolerance = (val >= 0.0 && val < 1.0) ? val : 0.9; } void NPSOL_options::set_nonlinear_feasibility_tolerance (double val) { x_nonlinear_feasibility_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } void NPSOL_options::set_optimality_tolerance (double val) { x_optimality_tolerance = (val > 0.0) ? val : pow (DBL_EPSILON, 0.8); } void NPSOL_options::set_derivative_level (int val) { x_derivative_level = (val >= 0 && val < 4) ? val : 0; } void NPSOL_options::set_major_iteration_limit (int val) { x_major_iteration_limit = (val > 0) ? val : -1; } void NPSOL_options::set_minor_iteration_limit (int val) { x_minor_iteration_limit = (val > 0) ? val : -1; } void NPSOL_options::set_major_print_level (int val) { x_major_print_level = (val >= 0) ? val : -1; } void NPSOL_options::set_minor_print_level (int val) { x_minor_print_level = (val >= 0) ? val : -1; } void NPSOL_options::set_start_objective_check (int val) { x_start_objective_check = (val >= 0) ? val : -1; } void NPSOL_options::set_start_constraint_check (int val) { x_start_constraint_check = (val >= 0) ? val : -1; } void NPSOL_options::set_stop_objective_check (int val) { x_stop_objective_check = (val >= 0) ? val : -1; } void NPSOL_options::set_stop_constraint_check (int val) { x_stop_constraint_check = (val >= 0) ? val : -1; } void NPSOL_options::set_verify_level (int val) { x_verify_level = ((val > -1 && val < 4) || (val > 9 && val < 14)) ? val : 0; } double NPSOL_options::central_difference_interval (void) const { return x_central_difference_interval; } double NPSOL_options::crash_tolerance (void) const { return x_crash_tolerance; } double NPSOL_options::difference_interval (void) const { return x_difference_interval; } double NPSOL_options::function_precision (void) const { return x_function_precision; } double NPSOL_options::infinite_bound (void) const { return x_infinite_bound; } double NPSOL_options::infinite_step (void) const { return x_infinite_step; } double NPSOL_options::linear_feasibility_tolerance (void) const { return x_linear_feasibility_tolerance; } double NPSOL_options::linesearch_tolerance (void) const { return x_linesearch_tolerance; } double NPSOL_options::nonlinear_feasibility_tolerance (void) const { return x_nonlinear_feasibility_tolerance; } double NPSOL_options::optimality_tolerance (void) const { return x_optimality_tolerance; } int NPSOL_options::derivative_level (void) const { return x_derivative_level; } int NPSOL_options::major_iteration_limit (void) const { return x_major_iteration_limit; } int NPSOL_options::minor_iteration_limit (void) const { return x_minor_iteration_limit; } int NPSOL_options::major_print_level (void) const { return x_major_print_level; } int NPSOL_options::minor_print_level (void) const { return x_minor_print_level; } int NPSOL_options::start_objective_check (void) const { return x_start_objective_check; } int NPSOL_options::start_constraint_check (void) const { return x_start_constraint_check; } int NPSOL_options::stop_objective_check (void) const { return x_stop_objective_check; } int NPSOL_options::stop_constraint_check (void) const { return x_stop_constraint_check; } int NPSOL_options::verify_level (void) const { return x_verify_level; } void NPSOL_options::pass_options_to_npsol (void) { F77_FCN (npoptn) ("Nolist", 6L); F77_FCN (npoptn) ("Defaults", 8L); if (x_central_difference_interval > 0.0) set_option ("Central Difference", x_central_difference_interval); set_option ("Crash Tolerance", x_crash_tolerance); if (x_difference_interval > 0.0) set_option ("Difference Interval", x_difference_interval); set_option ("Function Precision", x_function_precision); set_option ("Infinite Bound", x_infinite_bound); set_option ("Infinite Step", x_infinite_step); set_option ("Linear Feasibility", x_linear_feasibility_tolerance); set_option ("Linesearch Tolerance", x_linesearch_tolerance); set_option ("Nonlinear Feasibility", x_nonlinear_feasibility_tolerance); set_option ("Optimality Tolerance", x_optimality_tolerance); set_option ("Derivative Level", x_derivative_level); if (x_major_iteration_limit > 0) set_option ("Major Iteration", x_major_iteration_limit); if (x_minor_iteration_limit > 0) set_option ("Minor Iteration", x_minor_iteration_limit); set_option ("Major Print", x_major_print_level); set_option ("Minor Print", x_minor_print_level); set_option ("Start Objective", x_start_objective_check); set_option ("Start Constraint", x_start_constraint_check); if (x_stop_objective_check > 0) set_option ("Stop Objective", x_stop_objective_check); if (x_stop_constraint_check > 0) set_option ("Stop Constraint", x_stop_constraint_check); set_option ("Verify Level", x_verify_level); } void NPSOL_options::set_option (const char *key, int opt) { ostrstream buf; buf << key << " " << opt << ends; char *command = buf.str (); size_t len = strlen (command); F77_FCN (npoptn) (command, (long) len); delete [] command; } void NPSOL_options::set_option (const char *key, double opt) { ostrstream buf; buf << key << " " << opt << ends; char *command = buf.str (); size_t len = strlen (command); F77_FCN (npoptn) (command, (long) len); delete [] command; } #endif /* NPSOL_MISSING */ /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Objective.cc100666 415 17 3324 5702420325 15331 0ustar jweusers// Objective.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "Objective.h" Objective::Objective (void) { phi = 0; grad = 0; } Objective::Objective (const objective_fcn obj) { phi = obj; grad = 0; } Objective::Objective (const objective_fcn obj, const gradient_fcn g) { phi = obj; grad = g; } Objective::Objective (const Objective& a) { phi = a.phi; grad = a.grad; } Objective& Objective::operator = (const Objective& a) { phi = a.phi; grad = a.grad; return *this; } objective_fcn Objective::objective_function (void) const { return phi; } Objective& Objective::set_objective_function (const objective_fcn obj) { phi = obj; return *this; } gradient_fcn Objective::gradient_function (void) const { return grad; } Objective& Objective::set_gradient_function (const gradient_fcn g) { grad = g; return *this; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/ODE.cc100666 415 17 25055 5702420326 14054 0ustar jweusers// ODE.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include "ODE.h" #include "f77-uscore.h" #include "lo-error.h" extern "C" { int F77_FCN (lsode) (int (*)(int*, double*, double*, double*, int*), int *, double *, double *, double *, int *, double *, double *, int *, int *, int *, double *, int *, int *, int *, int (*)(int*, double*, double*, int*, int*, double*, int*), int *); } static ODEFunc::ODERHSFunc user_fun; static ODEFunc::ODEJacFunc user_jac; static ColumnVector *tmp_x; ODE::ODE (void) { n = 0; t = 0.0; stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; istate = 1; itol = 1; itask = 1; iopt = 0; liw = 20 + n; lrw = 22 + n * (9 + n); iwork = new int [liw]; rwork = new double [lrw]; for (int i = 4; i < 9; i++) { iwork[i] = 0; rwork[i] = 0.0; } fun = 0; jac = 0; } ODE::ODE (int size) { n = size; t = 0.0; stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; istate = 1; itol = 1; itask = 1; iopt = 0; liw = 20 + n; lrw = 22 + n * (9 + n); iwork = new int [liw]; rwork = new double [lrw]; for (int i = 4; i < 9; i++) { iwork[i] = 0; rwork[i] = 0.0; } fun = 0; jac = 0; } ODE::ODE (const ColumnVector& state, double time, const ODEFunc& f) { n = state.capacity (); t = time; x = state; stop_time_set = 0; stop_time = 0.0; integration_error = 0; restart = 1; istate = 1; itol = 1; itask = 1; iopt = 1; liw = 20 + n; lrw = 22 + n * (9 + n); iwork = new int [liw]; rwork = new double [lrw]; for (int i = 4; i < 9; i++) { iwork[i] = 0; rwork[i] = 0.0; } fun = f.function (); jac = f.jacobian_function (); } ODE::~ODE (void) { delete [] rwork; delete [] iwork; } int lsode_f (int *neq, double *time, double *state, double *deriv, int *ierr) { int nn = *neq; ColumnVector tmp_deriv (nn); /* * NOTE: this won't work if LSODE passes copies of the state vector. * In that case we have to create a temporary vector object * and copy. */ tmp_deriv = (*user_fun) (*tmp_x, *time); if (tmp_deriv.length () == 0) *ierr = -1; else { for (int i = 0; i < nn; i++) deriv [i] = tmp_deriv.elem (i); } return 0; } int lsode_j (int *neq, double *time, double *state, int *ml, int *mu, double *pd, int *nrowpd) { int nn = *neq; Matrix tmp_jac (nn, nn); /* * NOTE: this won't work if LSODE passes copies of the state vector. * In that case we have to create a temporary vector object * and copy. */ tmp_jac = (*user_jac) (*tmp_x, *time); for (int j = 0; j < nn; j++) for (int i = 0; i < nn; i++) pd [*nrowpd * j + i] = tmp_jac (i, j); return 0; } ColumnVector ODE::integrate (double tout) { if (jac) method_flag = 21; else method_flag = 22; integration_error = 0; double *xp = x.fortran_vec (); // NOTE: this won't work if LSODE passes copies of the state vector. // In that case we have to create a temporary vector object // and copy. tmp_x = &x; user_fun = fun; user_jac = jac; // Try 5000 steps before giving up. iwork[5] = 5000; int working_too_hard = 0; if (stop_time_set) { itask = 4; rwork [0] = stop_time; } else { itask = 1; } double abs_tol = absolute_tolerance (); double rel_tol = relative_tolerance (); rwork[4] = (initial_step_size () >= 0.0) ? initial_step_size () : 0.0; rwork[5] = (maximum_step_size () >= 0.0) ? maximum_step_size () : 0.0; rwork[6] = (minimum_step_size () >= 0.0) ? minimum_step_size () : 0.0; if (restart) { restart = 0; istate = 1; } again: (void) F77_FCN (lsode) (lsode_f, &n, xp, &t, &tout, &itol, &rel_tol, &abs_tol, &itask, &istate, &iopt, rwork, &lrw, iwork, &liw, lsode_j, &method_flag); switch (istate) { case -13: // Return requested in user-supplied function. case -6: // error weight became zero during problem. (solution // component i vanished, and atol or atol(i) = 0.) case -5: // repeated convergence failures (perhaps bad jacobian // supplied or wrong choice of mf or tolerances). case -4: // repeated error test failures (check all inputs). case -3: // illegal input detected (see printed message). case -2: // excess accuracy requested (tolerances too small). integration_error = 1; return ColumnVector (); break; case -1: // excess work done on this call (perhaps wrong mf). working_too_hard++; if (working_too_hard > 20) { (*current_liboctave_error_handler) ("giving up after more than %d steps attempted in lsode", iwork[5] * 20); integration_error = 1; return ColumnVector (); } else { istate = 2; goto again; } break; case 2: // lsode was successful break; default: // Error? break; } t = tout; return x; } void ODE::integrate (int nsteps, double tstep, ostream& s) { int time_to_quit = 0; double tout = t; s << t << " " << x << "\n"; for (int i = 0; i < nsteps; i++) { tout += tstep; if (stop_time_set && tout > stop_time) { tout = stop_time; time_to_quit = 1; } x = integrate (tout); s << t << " " << x << "\n"; if (time_to_quit) return; } } Matrix ODE::integrate (const ColumnVector& tout) { Matrix retval; int n_out = tout.capacity (); if (n_out > 0 && n > 0) { retval.resize (n_out, n); for (int i = 0; i < n; i++) retval.elem (0, i) = x.elem (i); for (int j = 1; j < n_out; j++) { ColumnVector x_next = integrate (tout.elem (j)); if (integration_error) return retval; for (i = 0; i < n; i++) retval.elem (j, i) = x_next.elem (i); } } return retval; } Matrix ODE::integrate (const ColumnVector& tout, const ColumnVector& tcrit) { Matrix retval; int n_out = tout.capacity (); if (n_out > 0 && n > 0) { retval.resize (n_out, n); for (int i = 0; i < n; i++) retval.elem (0, i) = x.elem (i); int n_crit = tcrit.capacity (); if (n_crit > 0) { int i_crit = 0; int i_out = 1; double next_crit = tcrit.elem (0); double next_out; while (i_out < n_out) { int do_restart = 0; next_out = tout.elem (i_out); if (i_crit < n_crit) next_crit = tcrit.elem (i_crit); int save_output; double t_out; if (next_crit == next_out) { set_stop_time (next_crit); t_out = next_out; save_output = 1; i_out++; i_crit++; do_restart = 1; } else if (next_crit < next_out) { if (i_crit < n_crit) { set_stop_time (next_crit); t_out = next_crit; save_output = 0; i_crit++; do_restart = 1; } else { clear_stop_time (); t_out = next_out; save_output = 1; i_out++; } } else { set_stop_time (next_crit); t_out = next_out; save_output = 1; i_out++; } ColumnVector x_next = integrate (t_out); if (integration_error) return retval; if (save_output) { for (i = 0; i < n; i++) retval.elem (i_out-1, i) = x_next.elem (i); } if (do_restart) force_restart (); } } else { retval = integrate (tout); if (integration_error) return retval; } } return retval; } int ODE::size (void) const { return n; } ColumnVector ODE::state (void) const { return x; } double ODE::time (void) const { return t; } void ODE::force_restart (void) { restart = 1; } void ODE::initialize (const ColumnVector& state, double time) { restart = 1; x = state; t = time; } void ODE::set_stop_time (double time) { stop_time_set = 1; stop_time = time; } void ODE::clear_stop_time (void) { stop_time_set = 0; } ODE_options::ODE_options (void) { init (); } ODE_options::ODE_options (const ODE_options& opt) { copy (opt); } ODE_options& ODE_options::operator = (const ODE_options& opt) { if (this != &opt) copy (opt); return *this; } ODE_options::~ODE_options (void) { } void ODE_options::init (void) { double sqrt_eps = sqrt (DBL_EPSILON); x_absolute_tolerance = sqrt_eps; x_initial_step_size = -1.0; x_maximum_step_size = -1.0; x_minimum_step_size = 0.0; x_relative_tolerance = sqrt_eps; } void ODE_options::copy (const ODE_options& opt) { x_absolute_tolerance = opt.x_absolute_tolerance; x_initial_step_size = opt.x_initial_step_size; x_maximum_step_size = opt.x_maximum_step_size; x_minimum_step_size = opt.x_minimum_step_size; x_relative_tolerance = opt.x_relative_tolerance; } void ODE_options::set_default_options (void) { init (); } void ODE_options::set_absolute_tolerance (double val) { x_absolute_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } void ODE_options::set_initial_step_size (double val) { x_initial_step_size = (val >= 0.0) ? val : -1.0; } void ODE_options::set_maximum_step_size (double val) { x_maximum_step_size = (val >= 0.0) ? val : -1.0; } void ODE_options::set_minimum_step_size (double val) { x_minimum_step_size = (val >= 0.0) ? val : 0.0; } void ODE_options::set_relative_tolerance (double val) { x_relative_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } double ODE_options::absolute_tolerance (void) { return x_absolute_tolerance; } double ODE_options::initial_step_size (void) { return x_initial_step_size; } double ODE_options::maximum_step_size (void) { return x_maximum_step_size; } double ODE_options::minimum_step_size (void) { return x_minimum_step_size; } double ODE_options::relative_tolerance (void) { return x_relative_tolerance; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/ODEFunc.cc100666 415 17 3227 5702420326 14645 0ustar jweusers// ODEFunc.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "ODEFunc.h" ODEFunc::ODEFunc (void) { fun = 0; jac = 0; } ODEFunc::ODEFunc (ODERHSFunc f) { fun = f; jac = 0; } ODEFunc::ODEFunc (ODERHSFunc f, ODEJacFunc j) { fun = f; jac = j; } ODEFunc::ODEFunc (const ODEFunc& a) { fun = a.function (); jac = a.jacobian_function (); } ODEFunc& ODEFunc::operator = (const ODEFunc& a) { fun = a.function (); jac = a.jacobian_function (); return *this; } ODEFunc::ODERHSFunc ODEFunc::function (void) const { return fun; } ODEFunc& ODEFunc::set_function (ODERHSFunc f) { fun = f; return *this; } ODEFunc::ODEJacFunc ODEFunc::jacobian_function (void) const { return jac; } ODEFunc& ODEFunc::set_jacobian_function (ODEJacFunc j) { jac = j; return *this; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QLD.cc100666 415 17 5543 5702420325 14044 0ustar jweusers// QLD.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "dMatrix.h" #include "dColVector.h" #include "dRowVector.h" #include "QLD.h" #include "f77-uscore.h" extern "C" { int F77_FCN (qld) (int*, int*, int*, int*, int*, double*, double*, double*, double*, double*, double*, double*, double*, int*, int*, int*, double*, int*, int*, int*); } Vector QLD::minimize (double& objf, int& inform) { int n = x.capacity (); Matrix A1 = lc.eq_constraint_matrix (); Vector b1 = lc.eq_constraint_vector (); Matrix A2 = lc.ineq_constraint_matrix (); Vector b2 = lc.ineq_constraint_vector (); int me = A1.rows (); int m = me + A2.rows (); cout << "n: " << n << "\n"; cout << "m: " << m << "\n"; cout << "me: " << me << "\n"; A1.stack (A2); b1.stack (b2); int lwar = n*(3*n + 15)/2 + m + 100; int liwar = n + 100; double *war = new double [lwar]; int *iwar = new int [liwar]; iwar[0] = 0; double *u = new double [m+n+n + 100]; int iout = 0; double *px = x.fortran_vec (); double *ph = H.fortran_vec (); cout << x; cout << H; cout << c; double *pc = 0; if (c.capacity () > 0) pc = c.fortran_vec (); double *pa = 0; if (A1.rows () > 0 && A1.columns () > 0) pa = A1.fortran_vec (); double *pb = 0; if (b1.capacity () > 0) pb = b1.fortran_vec (); Vector xlb = bnds.lower_bounds (); Vector xub = bnds.upper_bounds (); if (xlb.capacity () <= 0) { xlb.resize (n, -1.0e30); xub.resize (n, 1.0e30); } double *pxl = xlb.fortran_vec (); double *pxu = xub.fortran_vec (); int mmax = m > 0 ? m : 1; iprint = 1; F77_FCN (qld) (&m, &me, &mmax, &n, &n, ph, pc, pa, pb, pxl, pxu, px, u, &iout, &inform, &iprint, war, &lwar, iwar, &liwar); delete war; delete iwar; delete u; objf = (x.transpose () * H * x) / 2.0; if (c.capacity () > 0) objf += c.transpose () * x; return x; } void QLD::set_default_options (void) { iprint = 0; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QP.cc100666 415 17 6061 5702420324 13737 0ustar jweusers// QP.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "QP.h" QP::QP (void) {} QP::QP (const Vector& x0, const Matrix& H_arg) : x (x0), H (H_arg) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Vector& c_arg) : x (x0), H (H_arg), c (c_arg) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Bounds& b) : x (x0), H (H_arg), bnds (b) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const LinConst& l) : x (x0), H (H_arg), lc (l) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Vector& c_arg, const Bounds& b) : x (x0), H (H_arg), c (c_arg), bnds (b) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Vector& c_arg, const LinConst& l) : x (x0), H (H_arg), c (c_arg), lc (l) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Bounds& b, const LinConst& l) : x (x0), H (H_arg), bnds (b), lc (l) { make_h_symmetric (); } QP::QP (const Vector& x0, const Matrix& H_arg, const Vector& c_arg, const Bounds& b, const LinConst& l) : x (x0), H (H_arg), c (c_arg), bnds (b), lc (l) { make_h_symmetric (); } Matrix QP::make_h_symmetric (void) { return 0.5 * (H + H.transpose ()); } Vector QP::minimize (void) { double objf; int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (double& objf) { int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (double& objf, int& inform) { Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (const Vector& x0) { x = x0; double objf; int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (const Vector& x0, double& objf) { x = x0; int inform; Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (const Vector& x0, double& objf, int& inform) { x = x0; Vector lambda; return minimize (objf, inform, lambda); } Vector QP::minimize (const Vector& x0, double& objf, int& inform, Vector& lambda) { x = x0; return minimize (objf, inform, lambda); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QPSOL.cc100666 415 17 12640 5702420324 14335 0ustar jweusers// QPSOL.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #ifndef QPSOL_MISSING #include "QPSOL.h" #include "f77-uscore.h" extern "C" { int F77_FCN (qpsol) (int*, int*, int*, int*, int*, int*, int*, int*, double*, double*, double*, double*, double*, double*, double*, int (*)(int*, int*, int*, int*, double*, double*, double*), int*, int*, int*, int*, double*, int*, int*, double*, double*, int*, int*, double*, int*); int F77_FCN (dgemv) (const char*, const int*, const int*, const double*, const double*, const int*, const double*, const int*, const double*, double*, const int*, long); } int qphess (int *pn, int *pnrowh, int *ncolh, int *pcol, double *hess, double *x, double *hx) { int n = *pn; int nrowh = *pnrowh; int jthcol = *pcol; if (jthcol > 0) { int hp = (jthcol - 1) * nrowh; for (int i = 0; i < n; i++) hx[i] = hess[hp+i]; } else { char trans = 'N'; double alpha = 1.0; double beta = 0.0; int i_one = 1; F77_FCN (dgemv) (&trans, pn, pn, &alpha, hess, pn, x, &i_one, &beta, hx, &i_one, 1L); } return 0; } Vector QPSOL::minimize (double& objf, int& inform, Vector& lambda) { int i; int n = x.capacity (); int itmax = (iteration_limit () < 0) ? 50 * n : iteration_limit (); int msglvl = print_level (); int nclin = lc.size (); int nctotl = nclin + n; double bigbnd = infinite_bound (); double dummy; double *pa = &dummy; Matrix clin; if (nclin > 0) { clin = lc.constraint_matrix (); pa = clin.fortran_vec (); } double *pbl = new double [nctotl]; double *pbu = new double [nctotl]; if (bnds.size () > 0) { for (i = 0; i < n; i++) { pbl[i] = bnds.lower_bound (i); pbu[i] = bnds.upper_bound (i); } } else { for (i = 0; i < n; i++) { pbl[i] = -bigbnd; pbu[i] = bigbnd; } } for (i = 0; i < nclin; i++) { pbl[i+n] = lc.lower_bound (i); pbu[i+n] = lc.upper_bound (i); } double *pc = c.fortran_vec (); double *featol = new double [nctotl]; double tmp = feasibility_tolerance (); for (i = 0; i < nctotl; i++) featol[i] = tmp; double *ph = H.fortran_vec (); int cold = 1; int lp = 0; int orthog = 1; int *istate = new int [nctotl]; double *px = x.fortran_vec (); int iter = 0; lambda.resize (nctotl); double *pclambda = lambda.fortran_vec (); int leniw = 2 * n; int lenw; int ncon = nclin > 1 ? nclin : 1; if (lp == 0 || nclin >= n) lenw = 2*n*(n + 2) + nclin + 2*ncon; else lenw = 2*ncon*(1 + ncon) + 4*n + nclin; int *iw = new int [leniw]; double *w = new double [lenw]; F77_FCN (qpsol) (&itmax, &msglvl, &n, &nclin, &nctotl, &ncon, &n, &n, &bigbnd, pa, pbl, pbu, pc, featol, ph, qphess, &cold, &lp, &orthog, istate, px, &inform, &iter, &objf, pclambda, iw, &leniw, w, &lenw); delete [] pbl; delete [] pbu; delete [] featol; delete [] istate; delete [] iw; delete [] w; return x; } QPSOL_options::QPSOL_options (void) { init (); } QPSOL_options::QPSOL_options (const QPSOL_options& opt) { copy (opt); } QPSOL_options& QPSOL_options::operator = (const QPSOL_options& opt) { if (this != &opt) copy (opt); return *this; } QPSOL_options::~QPSOL_options (void) { } void QPSOL_options::init (void) { x_feasibility_tolerance = sqrt (DBL_EPSILON); x_infinite_bound = 1.0e+30; x_iteration_limit = -1; x_print_level = 0; } void QPSOL_options::copy (const QPSOL_options& opt) { x_feasibility_tolerance = opt.x_feasibility_tolerance; x_infinite_bound = opt.x_infinite_bound; x_iteration_limit = opt.x_iteration_limit; x_print_level = opt.x_print_level; } void QPSOL_options::set_default_options (void) { init (); } void QPSOL_options::set_feasibility_tolerance (double val) { x_feasibility_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } void QPSOL_options::set_infinite_bound (double val) { x_infinite_bound = (val > 0.0) ? val : 1.0e+30; } void QPSOL_options::set_iteration_limit (int val) { x_iteration_limit = (val > 0) ? val : -1; } void QPSOL_options::set_print_level (int val) { x_print_level = (val >= 0) ? val : 0; } double QPSOL_options::feasibility_tolerance (void) { return x_feasibility_tolerance; } double QPSOL_options::infinite_bound (void) { return x_infinite_bound; } int QPSOL_options::iteration_limit (void) { return x_iteration_limit; } int QPSOL_options::print_level (void) { return x_print_level; } #endif /* QPSOL_MISSING */ /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Quad.cc100666 415 17 14667 5702420324 14344 0ustar jweusers// Quad.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "Quad.h" #include "f77-uscore.h" #include "sun-utils.h" static integrand_fcn user_fcn; // XXX FIXME XXX -- would be nice to not have to have this global // variable. // Nonzero means an error occurred in the calculation of the integrand // function, and the user wants us to quit. int quad_integration_error = 0; extern "C" { int F77_FCN (dqagp) (const double (*)(double*, int*), const double*, const double*, const int*, const double*, const double*, const double*, double*, double*, int*, int*, const int*, const int*, int*, int*, double*); int F77_FCN (dqagi) (const double (*)(double*, int*), const double*, const int*, const double*, const double*, double*, double*, int*, int*, const int*, const int*, int*, int*, double*); } Quad::Quad (integrand_fcn fcn) { f = fcn; } Quad::Quad (integrand_fcn fcn, double abs, double rel) { f = fcn; } double Quad::integrate (void) { int ier, neval; double abserr; return integrate (ier, neval, abserr); } double Quad::integrate (int& ier) { int neval; double abserr; return integrate (ier, neval, abserr); } double Quad::integrate (int& ier, int& neval) { double abserr; return integrate (ier, neval, abserr); } static double user_function (double *x, int *ierr) { #if defined (sun) && defined (__GNUC__) double xx = access_double (x); #else double xx = *x; #endif quad_integration_error = 0; double retval = (*user_fcn) (xx); if (quad_integration_error) *ierr = -1; return retval; } DefQuad::DefQuad (integrand_fcn fcn) : Quad (fcn) { lower_limit = 0.0; upper_limit = 1.0; } DefQuad::DefQuad (integrand_fcn fcn, double ll, double ul) : Quad (fcn) { lower_limit = ll; upper_limit = ul; } DefQuad::DefQuad (integrand_fcn fcn, double ll, double ul, double abs, double rel) : Quad (fcn, abs, rel) { lower_limit = ll; upper_limit = ul; } DefQuad::DefQuad (integrand_fcn fcn, double ll, double ul, const Vector& sing) : Quad (fcn) { lower_limit = ll; upper_limit = ul; singularities = sing; } DefQuad::DefQuad (integrand_fcn fcn, const Vector& sing, double abs, double rel) : Quad (fcn, abs, rel) { lower_limit = 0.0; upper_limit = 1.0; singularities = sing; } DefQuad::DefQuad (integrand_fcn fcn, const Vector& sing) : Quad (fcn) { lower_limit = 0.0; upper_limit = 1.0; singularities = sing; } DefQuad::DefQuad (integrand_fcn fcn, double ll, double ul, const Vector& sing, double abs, double rel) : Quad (fcn, abs, rel) { lower_limit = ll; upper_limit = ul; singularities = sing; } double DefQuad::integrate (int& ier, int& neval, double& abserr) { int npts = singularities.capacity () + 2; double *points = singularities.fortran_vec (); double result = 0.0; int leniw = 183*npts - 122; int lenw = 2*leniw - npts; int *iwork = new int [leniw]; double *work = new double [lenw]; user_fcn = f; int last; double abs_tol = absolute_tolerance (); double rel_tol = relative_tolerance (); F77_FCN (dqagp) (user_function, &lower_limit, &upper_limit, &npts, points, &abs_tol, &rel_tol, &result, &abserr, &neval, &ier, &leniw, &lenw, &last, iwork, work); delete [] iwork; delete [] work; return result; } IndefQuad::IndefQuad (integrand_fcn fcn) : Quad (fcn) { bound = 0.0; type = bound_to_inf; } IndefQuad::IndefQuad (integrand_fcn fcn, double b, IntegralType t) : Quad (fcn) { bound = b; type = t; } IndefQuad::IndefQuad (integrand_fcn fcn, double b, IntegralType t, double abs, double rel) : Quad (fcn, abs, rel) { bound = b; type = t; } IndefQuad::IndefQuad (integrand_fcn fcn, double abs, double rel) : Quad (fcn, abs, rel) { bound = 0.0; type = bound_to_inf; } double IndefQuad::integrate (int& ier, int& neval, double& abserr) { double result = 0.0; int leniw = 128; int lenw = 8*leniw; int *iwork = new int [leniw]; double *work = new double [lenw]; user_fcn = f; int last; int inf; switch (type) { case bound_to_inf: inf = 1; break; case neg_inf_to_bound: inf = -1; break; case doubly_infinite: inf = 2; break; default: assert (0); break; } double abs_tol = absolute_tolerance (); double rel_tol = relative_tolerance (); F77_FCN (dqagi) (user_function, &bound, &inf, &abs_tol, &rel_tol, &result, &abserr, &neval, &ier, &leniw, &lenw, &last, iwork, work); delete [] iwork; delete [] work; return result; } Quad_options::Quad_options (void) { init (); } Quad_options::Quad_options (const Quad_options& opt) { copy (opt); } Quad_options& Quad_options::operator = (const Quad_options& opt) { if (this != &opt) copy (opt); return *this; } Quad_options::~Quad_options (void) { } void Quad_options::init (void) { double sqrt_eps = sqrt (DBL_EPSILON); x_absolute_tolerance = sqrt_eps; x_relative_tolerance = sqrt_eps; } void Quad_options::copy (const Quad_options& opt) { x_absolute_tolerance = opt.x_absolute_tolerance; x_relative_tolerance = opt.x_relative_tolerance; } void Quad_options::set_default_options (void) { init (); } void Quad_options::set_absolute_tolerance (double val) { x_absolute_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } void Quad_options::set_relative_tolerance (double val) { x_relative_tolerance = (val > 0.0) ? val : sqrt (DBL_EPSILON); } double Quad_options::absolute_tolerance (void) { return x_absolute_tolerance; } double Quad_options::relative_tolerance (void) { return x_relative_tolerance; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Range.cc100666 415 17 11027 5702420323 14470 0ustar jweusers// Range.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "Range.h" #include "dMatrix.h" Matrix Range::matrix_value (void) const { Matrix retval; if (rng_nelem > 0) { retval.resize (1, rng_nelem); double b = rng_base; double increment = rng_inc; for (int i = 0; i < rng_nelem; i++) retval.elem (0, i) = b + i * increment; } return retval; } // NOTE: max and min only return useful values if nelem > 0. double Range::min (void) const { double retval = 0.0; if (rng_nelem > 0) { if (rng_inc > 0) retval = rng_base; else retval = rng_base + (rng_nelem - 1) * rng_inc; } return retval; } double Range::max (void) const { double retval = 0.0; if (rng_nelem > 0) { if (rng_inc > 0) retval = rng_base + (rng_nelem - 1) * rng_inc; else retval = rng_base; } return retval; } void Range::sort (void) { if (rng_base > rng_limit && rng_inc < 0.0) { double tmp = rng_base; rng_base = min (); rng_limit = tmp; rng_inc = -rng_inc; } } void Range::print_range (void) { cerr << "Range: rng_base = " << rng_base << " rng_limit " << rng_limit << " rng_inc " << rng_inc << " rng_nelem " << rng_nelem << "\n"; } ostream& operator << (ostream& os, const Range& a) { double b = a.base (); double increment = a.inc (); int num_elem = a.nelem (); for (int i = 0; i < num_elem; i++) os << b + i * increment << " "; os << "\n"; return os; } istream& operator >> (istream& is, Range& a) { is >> a.rng_base; if (is) { is >> a.rng_limit; if (is) { is >> a.rng_inc; a.rng_nelem = a.nelem_internal (); } } return is; } int Range::nelem_internal (void) const { // Find an approximate number of intervals, then do the best we can to // find the number of intervals that we would get if we had done // something like // // nelem = 0; // while (base + nelem * inc <= limit) // nelem++; // // (for limit > base && inc > 0) // // The number of elements in the range is one greater than the number // of intervals. // We can't have more than INT_MAX elements in the range. double d_n_intervals = (rng_limit - rng_base) / rng_inc; int max_intervals = INT_MAX - 1; double d_max_val = (double) max_intervals; if (d_n_intervals > d_max_val) return -1; int n_intervals = (d_n_intervals > 0) ? ((int) (d_n_intervals + 0.5)) : ((int) (d_n_intervals - 0.5)); if (rng_limit > rng_base && rng_inc > 0) { // Our approximation may have been too big. while (rng_base + n_intervals * rng_inc > rng_limit && n_intervals > 0) n_intervals--; // Now that we are close, get the actual number. Try to avoid // problems with extended precision registers. for (;;) { volatile double tmp_inc = (n_intervals + 1) * rng_inc; volatile double tmp_val = rng_base + tmp_inc; if (tmp_val <= rng_limit && n_intervals < max_intervals) n_intervals++; else break; } } else if (rng_limit < rng_base && rng_inc < 0) { // Our approximation may have been too big. while (rng_base + n_intervals * rng_inc < rng_limit && n_intervals > 0) n_intervals--; // Now that we are close, get the actual number. Try to avoid // problems with extended precision registers. for (;;) { volatile double tmp_inc = (n_intervals + 1) * rng_inc; volatile double tmp_val = rng_base + tmp_inc; if (tmp_val >= rng_limit && n_intervals < max_intervals) n_intervals++; else break; } } else if (rng_limit == rng_base) n_intervals = 0; else n_intervals = -1; return (n_intervals >= max_intervals) ? -1 : n_intervals + 1; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/lo-error.cc100666 415 17 3141 5702420315 15154 0ustar jweusers// error.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include "lo-error.h" liboctave_error_handler current_liboctave_error_handler = liboctave_fatal; static void verror (const char *name, const char *fmt, va_list args) { if (name) fprintf (stderr, "%s: ", name); vfprintf (stderr, fmt, args); fprintf (stderr, "\n"); fflush (stderr); } void set_liboctave_error_handler (liboctave_error_handler f) { if (f) current_liboctave_error_handler = f; else current_liboctave_error_handler = liboctave_fatal; } void liboctave_fatal (const char *fmt, ...) { va_list args; va_start (args, fmt); verror ("fatal", fmt, args); va_end (args); exit (1); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/sun-utils.cc100666 415 17 2264 5702420556 15372 0ustar jweusers// sun-utils.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef sun #include /* * I think that this is really only needed if linking to Fortran * compiled libraries on a Sun. It should never be called. * There should probably be a sysdep.cc file, eh? */ extern "C" { int MAIN_ (void) { assert (0); return 0; } } #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Array.cc100666 415 17 37722 5702420342 14525 0ustar jweusers// Template array classes -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "Array.h" /* * The real representation of all arrays. */ template ArrayRep::ArrayRep (T *d, int l) { data = d; len = l; } template ArrayRep::ArrayRep (void) { len = 0; data = (T *) 0; } template ArrayRep::ArrayRep (int n) { len = n; data = new T [len]; } template ArrayRep::ArrayRep (const ArrayRep& a) { len = a.len; count = a.count; data = new T [len]; for (int i = 0; i < len; i++) data[i] = a.data[i]; } template ArrayRep::~ArrayRep (void) { delete [] data; data = (T *) 0; } template int ArrayRep::length (void) const { return len; } template T& ArrayRep::elem (int n) { return data[n]; } template T ArrayRep::elem (int n) const { return data[n]; } /* * One dimensional array class. Handles the reference counting for * all the derived classes. */ template Array::Array (T *d, int l) { rep = new ArrayRep (d, l); rep->count = 1; } template Array::Array (void) { rep = new ArrayRep; rep->count = 1; } template Array::Array (int n) { rep = new ArrayRep (n); rep->count = 1; } template Array::Array (int n, const T& val) { rep = new ArrayRep (n); rep->count = 1; for (int i = 0; i < n; i++) rep->data[i] = val; } template Array::Array (const Array& a) { rep = a.rep; rep->count++; } template Array::~Array (void) { if (--rep->count <= 0) delete rep; } template Array& Array::operator = (const Array& a) { if (this != &a) { if (--rep->count <= 0) delete rep; rep = a.rep; rep->count++; } return *this; } template int Array::capacity (void) const { return rep->length (); } template int Array::length (void) const { return rep->length (); } template T& Array::elem (int n) { if (rep->count > 1) { --rep->count; rep = new ArrayRep (*rep); rep->count = 1; } return rep->elem (n); } template T& Array::checkelem (int n) { if (n < 0 || n >= rep->length ()) { (*current_liboctave_error_handler) ("range error"); static T foo; return foo; } return elem (n); } template T& Array::operator () (int n) { return checkelem (n); } template T& Array::xelem (int n) { return rep->elem (n); } template T Array::elem (int n) const { return rep->elem (n); } template T Array::checkelem (int n) const { if (n < 0 || n >= rep->length ()) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return elem (n); } template T Array::operator () (int n) const { return checkelem (n); } template void Array::resize (int n) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return; } if (n == length ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_len = length (); rep = new ArrayRep (n); rep->count = 1; if (old_data && old_len > 0) { int min_len = old_len < n ? old_len : n; for (int i = 0; i < min_len; i++) xelem (i) = old_data[i]; } if (--old_rep->count <= 0) delete old_rep; } template void Array::resize (int n, const T& val) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return; } if (n == length ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_len = length (); rep = new ArrayRep (n); rep->count = 1; int min_len = old_len < n ? old_len : n; if (old_data && old_len > 0) { for (int i = 0; i < min_len; i++) xelem (i) = old_data[i]; } for (int i = old_len; i < n; i++) xelem (i) = val; if (--old_rep->count <= 0) delete old_rep; } template const T * Array::data (void) const { return rep->data; } template T * Array::fortran_vec (void) { if (rep->count > 1) { --rep->count; rep = new ArrayRep (*rep); rep->count = 1; } return rep->data; } /* * Two dimensional array class. */ template Array2::Array2 (T *d, int n, int m) : Array (d, n*m) { d1 = n; d2 = m; } template Array2::Array2 (void) : Array () { d1 = 0; d2 = 0; } template Array2::Array2 (int n, int m) : Array (n*m) { d1 = n; d2 = m; } template Array2::Array2 (int n, int m, const T& val) : Array (n*m, val) { d1 = n; d2 = m; } template Array2::Array2 (const Array2& a) : Array (a) { d1 = a.d1; d2 = a.d2; } template Array2::Array2 (const DiagArray& a) : Array (a.rows () * a.cols (), T (0)) { for (int i = 0; i < a.length (); i++) elem (i, i) = a.elem (i, i); } template Array2& Array2::operator = (const Array2& a) { if (this != &a) { Array::operator = (a); d1 = a.d1; d2 = a.d2; } return *this; } template int Array2::dim1 (void) const { return d1; } template int Array2::dim2 (void) const { return d2; } template int Array2::rows (void) const { return d1; } template int Array2::cols (void) const { return d2; } template int Array2::columns (void) const { return d2; } template T& Array2::elem (int i, int j) { return Array::elem (d1*j+i); } template T& Array2::checkelem (int i, int j) { if (i < 0 || j < 0 || i >= d1 || j >= d2) { (*current_liboctave_error_handler) ("range error"); static T foo; return foo; } return Array::elem (d1*j+i); } template T& Array2::operator () (int i, int j) { if (i < 0 || j < 0 || i >= d1 || j >= d2) { (*current_liboctave_error_handler) ("range error"); static T foo; return foo; } return Array::elem (d1*j+i); } template T& Array2::xelem (int i, int j) { return Array::xelem (d1*j+i); } template T Array2::elem (int i, int j) const { return Array::elem (d1*j+i); } template T Array2::checkelem (int i, int j) const { if (i < 0 || j < 0 || i >= d1 || j >= d2) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return Array::elem (d1*j+i); } template T Array2::operator () (int i, int j) const { if (i < 0 || j < 0 || i >= d1 || j >= d2) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return Array::elem (d1*j+i); } template void Array2::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return; } if (r == dim1 () && c == dim2 ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_d1 = dim1 (); int old_d2 = dim2 (); int old_len = length (); rep = new ArrayRep (r*c); rep->count = 1; d1 = r; d2 = c; if (old_data && old_len > 0) { int min_r = old_d1 < r ? old_d1 : r; int min_c = old_d2 < c ? old_d2 : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) xelem (i, j) = old_data[old_d1*j+i]; } if (--old_rep->count <= 0) delete old_rep; } template void Array2::resize (int r, int c, const T& val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return; } if (r == dim1 () && c == dim2 ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_d1 = dim1 (); int old_d2 = dim2 (); int old_len = length (); rep = new ArrayRep (r*c); rep->count = 1; d1 = r; d2 = c; int min_r = old_d1 < r ? old_d1 : r; int min_c = old_d2 < c ? old_d2 : c; int i, j; if (old_data && old_len > 0) { for (j = 0; j < min_c; j++) for (i = 0; i < min_r; i++) xelem (i, j) = old_data[old_d1*j+i]; } for (j = 0; j < min_c; j++) for (i = min_r; i < r; i++) xelem (i, j) = val; for (j = min_c; j < c; j++) for (i = 0; i < r; i++) xelem (i, j) = val; if (--old_rep->count <= 0) delete old_rep; } /* * Three dimensional array class. */ template Array3::Array3 (T *d, int n, int m, int k) : Array2 (d, n, m*k) { d2 = m; d3 = k; } template Array3::Array3 (void) : Array2 () { d2 = 0; d3 = 0; } template Array3::Array3 (int n, int m, int k) : Array2 (n, m*k) { d2 = m; d3 = k; } template Array3::Array3 (int n, int m, int k, const T& val) : Array2 (n, m*k, val) { d2 = m; d3 = k; } template Array3::Array3 (const Array3& a) : Array2 (a) { d2 = a.d2; d3 = a.d3; } template Array3& Array3::operator = (const Array3& a) { if (this != &a) { Array::operator = (a); d1 = a.d1; d2 = a.d2; d3 = a.d3; } return *this; } template int Array3::dim3 (void) const { return d3; } template T& Array3::elem (int i, int j, int k) { return Array2::elem (i, d2*k+j); } template T& Array3::checkelem (int i, int j, int k) { if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3) { (*current_liboctave_error_handler) ("range error"); static T foo; return foo; } return Array2::elem (i, d1*k+j); } template T& Array3::operator () (int i, int j, int k) { if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3) { (*current_liboctave_error_handler) ("range error"); static T foo; return foo; } return Array2::elem (i, d2*k+j); } template T& Array3::xelem (int i, int j, int k) { return Array2::xelem (i, d2*k+j); } template T Array3::elem (int i, int j, int k) const { return Array2::elem (i, d2*k+j); } template T Array3::checkelem (int i, int j, int k) const { if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return Array2::elem (i, d1*k+j); } template T Array3::operator () (int i, int j, int k) const { if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return Array2::elem (i, d2*k+j); } template void Array3::resize (int n, int m, int k) { assert (0); /* XXX FIXME XXX */ } template void Array3::resize (int n, int m, int k, const T& val) { assert (0); /* XXX FIXME XXX */ } /* * A two-dimensional array with diagonal elements only. */ template DiagArray::DiagArray (T *d, int r, int c) : Array (d, r < c ? r : c) { nr = r; nc = c; } template DiagArray::DiagArray (void) : Array () { nr = 0; nc = 0; } template DiagArray::DiagArray (int n) : Array (n) { nr = n; nc = n; } template DiagArray::DiagArray (int n, const T& val) : Array (n, val) { nr = nc = n; } template DiagArray::DiagArray (int r, int c) : Array (r < c ? r : c) { nr = r; nc = c; } template DiagArray::DiagArray (int r, int c, const T& val) : Array (r < c ? r : c, val) { nr = r; nc = c; } template DiagArray::DiagArray (const Array& a) : Array (a) { nr = nc = a.length (); } template DiagArray::DiagArray (const DiagArray& a) : Array (a) { nr = a.nr; nc = a.nc; } template DiagArray& DiagArray::operator = (const DiagArray& a) { if (this != &a) { Array::operator = (a); nr = a.nr; nc = a.nc; } return *this; } template int DiagArray::dim1 (void) const { return nr; } template int DiagArray::dim2 (void) const { return nc; } template int DiagArray::rows (void) const { return nr; } template int DiagArray::cols (void) const { return nc; } template int DiagArray::columns (void) const { return nc; } #if 1 template T& DiagArray::elem (int r, int c) { static T foo (0); return (r == c) ? Array::elem (r) : foo; } template T& DiagArray::checkelem (int r, int c) { static T foo (0); if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); return foo; } return (r == c) ? Array::elem (r) : foo; } template T& DiagArray::operator () (int r, int c) { static T foo (0); if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); return foo; } return (r == c) ? Array::elem (r) : foo; } #endif template T& DiagArray::xelem (int r, int c) { static T foo (0); return (r == c) ? Array::xelem (r) : foo; } template T DiagArray::elem (int r, int c) const { return (r == c) ? Array::elem (r) : T (0); } template T DiagArray::checkelem (int r, int c) const { if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return (r == c) ? Array::elem (r) : T (0); } template T DiagArray::operator () (int r, int c) const { if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); T foo; return foo; } return (r == c) ? Array::elem (r) : T (0); } template void DiagArray::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return; } if (r == dim1 () && c == dim2 ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_len = length (); int new_len = r < c ? r : c; rep = new ArrayRep (new_len); rep->count = 1; nr = r; nc = c; if (old_data && old_len > 0) { int min_len = old_len < new_len ? old_len : new_len; for (int i = 0; i < min_len; i++) xelem (i, i) = old_data[i]; } if (--old_rep->count <= 0) delete old_rep; } template void DiagArray::resize (int r, int c, const T& val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return; } if (r == dim1 () && c == dim2 ()) return; ArrayRep *old_rep = rep; const T *old_data = data (); int old_len = length (); int new_len = r < c ? r : c; rep = new ArrayRep (new_len); rep->count = 1; nr = r; nc = c; int min_len = old_len < new_len ? old_len : new_len; if (old_data && old_len > 0) { for (int i = 0; i < min_len; i++) xelem (i, i) = old_data[i]; } for (int i = min_len; i < new_len; i++) xelem (i, i) = val; if (--old_rep->count <= 0) delete old_rep; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Array-C.cc100666 415 17 2151 5702420344 14653 0ustar jweusers// Array-C.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Arrays of Complex values. #include "Array.h" #include "Array.cc" #include template class ArrayRep; template class Array; template class Array2; template class DiagArray; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Array-d.cc100666 415 17 2116 5702420343 14714 0ustar jweusers// Array-d.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Arrays of double values. #include "Array.h" #include "Array.cc" template class ArrayRep; template class Array; template class Array2; template class DiagArray; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CColVector.cc100666 415 17 32635 5702420342 15450 0ustar jweusers// ColumnVector manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "f77-uscore.h" #include "lo-error.h" // Fortran functions we call. extern "C" { int F77_FCN (zgemm) (const char*, const char*, const int*, const int*, const int*, const Complex*, const Complex*, const int*, const Complex*, const int*, const Complex*, Complex*, const int*, long, long); } /* * Complex Column Vector class */ #define KLUDGE_VECTORS #define TYPE Complex #define KL_VEC_TYPE ComplexColumnVector #include "mx-kludge.cc" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE ComplexColumnVector::ComplexColumnVector (const ColumnVector& a) : Array (a.length ()) { for (int i = 0; i < length (); i++) elem (i) = a.elem (i); } #if 0 ComplexColumnVector& ComplexColumnVector::resize (int n) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return *this; } Complex *new_data = 0; if (n > 0) { new_data = new Complex [n]; int min_len = len < n ? len : n; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; len = n; data = new_data; return *this; } ComplexColumnVector& ComplexColumnVector::resize (int n, double val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } ComplexColumnVector& ComplexColumnVector::resize (int n, const Complex& val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } #endif int ComplexColumnVector::operator == (const ComplexColumnVector& a) const { int len = length (); if (len != a.length ()) return 0; return equal (data (), a.data (), len); } int ComplexColumnVector::operator != (const ComplexColumnVector& a) const { return !(*this == a); } // destructive insert/delete/reorder operations ComplexColumnVector& ComplexColumnVector::insert (const ColumnVector& a, int r) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i) = a.elem (i); return *this; } ComplexColumnVector& ComplexColumnVector::insert (const ComplexColumnVector& a, int r) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i) = a.elem (i); return *this; } ComplexColumnVector& ComplexColumnVector::fill (double val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } ComplexColumnVector& ComplexColumnVector::fill (const Complex& val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } ComplexColumnVector& ComplexColumnVector::fill (double val, int r1, int r2) { int len = length (); if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } for (int i = r1; i <= r2; i++) elem (i) = val; return *this; } ComplexColumnVector& ComplexColumnVector::fill (const Complex& val, int r1, int r2) { int len = length (); if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } for (int i = r1; i <= r2; i++) elem (i) = val; return *this; } ComplexColumnVector ComplexColumnVector::stack (const ColumnVector& a) const { int len = length (); int nr_insert = len; ComplexColumnVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nr_insert); return retval; } ComplexColumnVector ComplexColumnVector::stack (const ComplexColumnVector& a) const { int len = length (); int nr_insert = len; ComplexColumnVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nr_insert); return retval; } ComplexRowVector ComplexColumnVector::hermitian (void) const { int len = length (); return ComplexRowVector (conj_dup (data (), len), len); } ComplexRowVector ComplexColumnVector::transpose (void) const { int len = length (); return ComplexRowVector (dup (data (), len), len); } ColumnVector real (const ComplexColumnVector& a) { int a_len = a.length (); ColumnVector retval; if (a_len > 0) retval = ColumnVector (real_dup (a.data (), a_len), a_len); return retval; } ColumnVector imag (const ComplexColumnVector& a) { int a_len = a.length (); ColumnVector retval; if (a_len > 0) retval = ColumnVector (imag_dup (a.data (), a_len), a_len); return retval; } ComplexColumnVector conj (const ComplexColumnVector& a) { int a_len = a.length (); ComplexColumnVector retval; if (a_len > 0) retval = ComplexColumnVector (conj_dup (a.data (), a_len), a_len); return retval; } // resize is the destructive equivalent for this one ComplexColumnVector ComplexColumnVector::extract (int r1, int r2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } int new_r = r2 - r1 + 1; ComplexColumnVector result (new_r); for (int i = 0; i < new_r; i++) result.elem (i) = elem (r1+i); return result; } // column vector by column vector -> column vector operations ComplexColumnVector& ComplexColumnVector::operator += (const ColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } ComplexColumnVector& ComplexColumnVector::operator -= (const ColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } ComplexColumnVector& ComplexColumnVector::operator += (const ComplexColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } ComplexColumnVector& ComplexColumnVector::operator -= (const ComplexColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } // column vector by scalar -> column vector operations ComplexColumnVector operator + (const ComplexColumnVector& v, double s) { int len = v.length (); return ComplexColumnVector (add (v.data (), len, s), len); } ComplexColumnVector operator - (const ComplexColumnVector& v, double s) { int len = v.length (); return ComplexColumnVector (subtract (v.data (), len, s), len); } ComplexColumnVector operator * (const ComplexColumnVector& v, double s) { int len = v.length (); return ComplexColumnVector (multiply (v.data (), len, s), len); } ComplexColumnVector operator / (const ComplexColumnVector& v, double s) { int len = v.length (); return ComplexColumnVector (divide (v.data (), len, s), len); } // scalar by column vector -> column vector operations ComplexColumnVector operator + (double s, const ComplexColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (add (a.data (), a_len, s), a_len); } ComplexColumnVector operator - (double s, const ComplexColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (subtract (s, a.data (), a_len), a_len); } ComplexColumnVector operator * (double s, const ComplexColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (multiply (a.data (), a_len, s), a_len); } ComplexColumnVector operator / (double s, const ComplexColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (divide (s, a.data (), a_len), a_len); } // column vector by row vector -> matrix operations ComplexMatrix operator * (const ComplexColumnVector& v, const ComplexRowVector& a) { int len = v.length (); int a_len = a.length (); if (len != a_len) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return ComplexMatrix (); } if (len == 0) return ComplexMatrix (len, len, 0.0); char transa = 'N'; char transb = 'N'; Complex alpha (1.0); Complex beta (0.0); int anr = 1; Complex *c = new Complex [len * a_len]; F77_FCN (zgemm) (&transa, &transb, &len, &a_len, &anr, &alpha, v.data (), &len, a.data (), &anr, &beta, c, &len, 1L, 1L); return ComplexMatrix (c, len, a_len); } // column vector by column vector -> column vector operations ComplexColumnVector operator + (const ComplexColumnVector& v, const ColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector addition attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (add (v.data (), a.data (), len), len); } ComplexColumnVector operator - (const ComplexColumnVector& v, const ColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector subtraction attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (subtract (v.data (), a.data (), len), len); } ComplexColumnVector product (const ComplexColumnVector& v, const ColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector product attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (multiply (v.data (), a.data (), len), len); } ComplexColumnVector quotient (const ComplexColumnVector& v, const ColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector quotient attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (divide (v.data (), a.data (), len), len); } // other operations ComplexColumnVector map (c_c_Mapper f, const ComplexColumnVector& a) { ComplexColumnVector b (a); b.map (f); return b; } ColumnVector map (d_c_Mapper f, const ComplexColumnVector& a) { int a_len = a.length (); ColumnVector b (a_len); for (int i = 0; i < a_len; i++) b.elem (i) = f (a.elem (i)); return b; } void ComplexColumnVector::map (c_c_Mapper f) { for (int i = 0; i < length (); i++) elem (i) = f (elem (i)); } Complex ComplexColumnVector::min (void) const { int len = length (); if (len == 0) return 0.0; Complex res = elem (0); double absres = abs (res); for (int i = 1; i < len; i++) if (abs (elem (i)) < absres) { res = elem (i); absres = abs (res); } return res; } Complex ComplexColumnVector::max (void) const { int len = length (); if (len == 0) return 0.0; Complex res = elem (0); double absres = abs (res); for (int i = 1; i < len; i++) if (abs (elem (i)) > absres) { res = elem (i); absres = abs (res); } return res; } // i/o ostream& operator << (ostream& os, const ComplexColumnVector& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.length (); i++) os << /* setw (field_width) << */ a.elem (i) << "\n"; return os; } istream& operator >> (istream& is, ComplexColumnVector& a) { int len = a.length(); if (len < 1) is.clear (ios::badbit); else { double tmp; for (int i = 0; i < len; i++) { is >> tmp; if (is) a.elem (i) = tmp; else break; } } return is; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CDiagMatrix.cc100666 415 17 57373 5702420341 15606 0ustar jweusers// DiagMatrix manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "lo-error.h" /* * Complex Diagonal Matrix class */ #define KLUDGE_DIAG_MATRICES #define TYPE Complex #define KL_DMAT_TYPE ComplexDiagMatrix #include "mx-kludge.cc" #undef KLUDGE_DIAG_MATRICES #undef TYPE #undef KL_DMAT_TYPE ComplexDiagMatrix::ComplexDiagMatrix (const RowVector& a) : DiagArray (a.length ()) { for (int i = 0; i < length (); i++) elem (i, i) = a.elem (i); } ComplexDiagMatrix::ComplexDiagMatrix (const ColumnVector& a) : DiagArray (a.length ()) { for (int i = 0; i < length (); i++) elem (i, i) = a.elem (i); } ComplexDiagMatrix::ComplexDiagMatrix (const DiagMatrix& a) : DiagArray (a.rows (), a.cols ()) { for (int i = 0; i < length (); i++) elem (i, i) = a.elem (i, i); } #if 0 ComplexDiagMatrix& ComplexDiagMatrix::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r < c ? r : c; Complex *new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; int min_len = new_len < len ? new_len : len; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::resize (int r, int c, double val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r < c ? r : c; Complex *new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; int min_len = new_len < len ? new_len : len; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; for (i = min_len; i < new_len; i++) new_data[i] = val; } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::resize (int r, int c, const Complex& val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r < c ? r : c; Complex *new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; int min_len = new_len < len ? new_len : len; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; for (i = min_len; i < new_len; i++) new_data[i] = val; } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } #endif int ComplexDiagMatrix::operator == (const ComplexDiagMatrix& a) const { if (rows () != a.rows () || cols () != a.cols ()) return 0; return equal (data (), a.data (), length ()); } int ComplexDiagMatrix::operator != (const ComplexDiagMatrix& a) const { return !(*this == a); } ComplexDiagMatrix ComplexDiagMatrix::hermitian (void) const { return ComplexDiagMatrix (conj_dup (data (), length ()), cols (), rows ()); } ComplexDiagMatrix& ComplexDiagMatrix::fill (double val) { for (int i = 0; i < length (); i++) elem (i, i) = val; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const Complex& val) { for (int i = 0; i < length (); i++) elem (i, i) = val; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (double val, int beg, int end) { if (beg < 0 || end >= length () || end < beg) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = beg; i < end; i++) elem (i, i) = val; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const Complex& val, int beg, int end) { if (beg < 0 || end >= length () || end < beg) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = beg; i < end; i++) elem (i, i) = val; return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ColumnVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ComplexColumnVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const RowVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ComplexRowVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ColumnVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ComplexColumnVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const RowVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::fill (const ComplexRowVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } ComplexDiagMatrix ComplexDiagMatrix::transpose (void) const { return ComplexDiagMatrix (dup (data (), length ()), cols (), rows ()); } DiagMatrix real (const ComplexDiagMatrix& a) { DiagMatrix retval; int a_len = a.length (); if (a_len > 0) retval = DiagMatrix (real_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } DiagMatrix imag (const ComplexDiagMatrix& a) { DiagMatrix retval; int a_len = a.length (); if (a_len > 0) retval = DiagMatrix (imag_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } ComplexDiagMatrix conj (const ComplexDiagMatrix& a) { ComplexDiagMatrix retval; int a_len = a.length (); if (a_len > 0) retval = ComplexDiagMatrix (conj_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } // resize is the destructive analog for this one ComplexMatrix ComplexDiagMatrix::extract (int r1, int c1, int r2, int c2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_r = r2 - r1 + 1; int new_c = c2 - c1 + 1; ComplexMatrix result (new_r, new_c); for (int j = 0; j < new_c; j++) for (int i = 0; i < new_r; i++) result.elem (i, j) = elem (r1+i, c1+j); return result; } // extract row or column i. ComplexRowVector ComplexDiagMatrix::row (int i) const { int nr = rows (); int nc = cols (); if (i < 0 || i >= nr) { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } ComplexRowVector retval (nc, 0.0); if (nr <= nc || (nr > nc && i < nc)) retval.elem (i) = elem (i, i); return retval; } ComplexRowVector ComplexDiagMatrix::row (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid row selection"); return ComplexRowVector (); } char c = *s; if (c == 'f' || c == 'F') return row (0); else if (c == 'l' || c == 'L') return row (rows () - 1); else { (*current_liboctave_error_handler) ("invalid row selection"); return ComplexRowVector (); } } ComplexColumnVector ComplexDiagMatrix::column (int i) const { int nr = rows (); int nc = cols (); if (i < 0 || i >= nc) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } ComplexColumnVector retval (nr, 0.0); if (nr >= nc || (nr < nc && i < nr)) retval.elem (i) = elem (i, i); return retval; } ComplexColumnVector ComplexDiagMatrix::column (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } char c = *s; if (c == 'f' || c == 'F') return column (0); else if (c == 'l' || c == 'L') return column (cols () - 1); else { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } } ComplexDiagMatrix ComplexDiagMatrix::inverse (void) const { int info; return inverse (info); } ComplexDiagMatrix ComplexDiagMatrix::inverse (int& info) const { int nr = rows (); int nc = cols (); if (nr != nc) { (*current_liboctave_error_handler) ("inverse requires square matrix"); return DiagMatrix (); } ComplexDiagMatrix retval (nr, nc); info = 0; for (int i = 0; i < length (); i++) { if (elem (i, i) == 0.0) { info = -1; return *this; } else retval.elem (i, i) = 1.0 / elem (i, i); } return *this; } // diagonal matrix by diagonal matrix -> diagonal matrix operations ComplexDiagMatrix& ComplexDiagMatrix::operator += (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::operator -= (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::operator += (const ComplexDiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } ComplexDiagMatrix& ComplexDiagMatrix::operator -= (const ComplexDiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } // diagonal matrix by scalar -> matrix operations ComplexMatrix operator + (const ComplexDiagMatrix& a, double s) { ComplexMatrix tmp (a.rows (), a.cols (), s); return a + tmp; } ComplexMatrix operator - (const ComplexDiagMatrix& a, double s) { ComplexMatrix tmp (a.rows (), a.cols (), -s); return a + tmp; } ComplexMatrix operator + (const ComplexDiagMatrix& a, const Complex& s) { ComplexMatrix tmp (a.rows (), a.cols (), s); return a + tmp; } ComplexMatrix operator - (const ComplexDiagMatrix& a, const Complex& s) { ComplexMatrix tmp (a.rows (), a.cols (), -s); return a + tmp; } // diagonal matrix by scalar -> diagonal matrix operations ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, double s) { return ComplexDiagMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexDiagMatrix operator / (const ComplexDiagMatrix& a, double s) { return ComplexDiagMatrix (divide (a.data (), a.length (), s), a.rows (), a.cols ()); } // scalar by diagonal matrix -> matrix operations ComplexMatrix operator + (double s, const ComplexDiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp + a; } ComplexMatrix operator - (double s, const ComplexDiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp - a; } ComplexMatrix operator + (const Complex& s, const ComplexDiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp + a; } ComplexMatrix operator - (const Complex& s, const ComplexDiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp - a; } // scalar by diagonal matrix -> diagonal matrix operations ComplexDiagMatrix operator * (double s, const ComplexDiagMatrix& a) { return ComplexDiagMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } // diagonal matrix by column vector -> column vector operations ComplexColumnVector operator * (const ComplexDiagMatrix& m, const ColumnVector& a) { int nr = m.rows (); int nc = m.cols (); int a_len = a.length (); if (nc != a_len) { (*current_liboctave_error_handler) ("nonconformant matrix muliplication attempted"); return ComplexColumnVector (); } if (nc == 0 || nr == 0) return ComplexColumnVector (0); ComplexColumnVector result (nr); for (int i = 0; i < a_len; i++) result.elem (i) = a.elem (i) * m.elem (i, i); for (i = a_len; i < nr; i++) result.elem (i) = 0.0; return result; } ComplexColumnVector operator * (const ComplexDiagMatrix& m, const ComplexColumnVector& a) { int nr = m.rows (); int nc = m.cols (); int a_len = a.length (); if (nc != a_len) { (*current_liboctave_error_handler) ("nonconformant matrix muliplication attempted"); return ComplexColumnVector (); } if (nc == 0 || nr == 0) return ComplexColumnVector (0); ComplexColumnVector result (nr); for (int i = 0; i < a_len; i++) result.elem (i) = a.elem (i) * m.elem (i, i); for (i = a_len; i < nr; i++) result.elem (i) = 0.0; return result; } // diagonal matrix by diagonal matrix -> diagonal matrix operations ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, const ComplexDiagMatrix& b) { int nr_a = a.rows (); int nc_a = a.cols (); int nr_b = b.rows (); int nc_b = b.cols (); if (nc_a != nr_b) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexDiagMatrix (); } if (nr_a == 0 || nc_a == 0 || nc_b == 0) return ComplexDiagMatrix (nr_a, nc_a, 0.0); ComplexDiagMatrix c (nr_a, nc_b); int len = nr_a < nc_b ? nr_a : nc_b; for (int i = 0; i < len; i++) { Complex a_element = a.elem (i, i); Complex b_element = b.elem (i, i); if (a_element == 0.0 || b_element == 0.0) c.elem (i, i) = 0.0; else if (a_element == 1.0) c.elem (i, i) = b_element; else if (b_element == 1.0) c.elem (i, i) = a_element; else c.elem (i, i) = a_element * b_element; } return c; } ComplexDiagMatrix operator + (const ComplexDiagMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexDiagMatrix (); } if (nr == 0 || nc == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (add (m.data (), a.data (), m.length ()), nr, nc); } ComplexDiagMatrix operator - (const ComplexDiagMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexDiagMatrix (); } if (nr == 0 || nc == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (subtract (m.data (), a.data (), m.length ()), nr, nc); } ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, const DiagMatrix& b) { int nr_a = a.rows (); int nc_a = a.cols (); int nr_b = b.rows (); int nc_b = b.cols (); if (nc_a != nr_b) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexDiagMatrix (); } if (nr_a == 0 || nc_a == 0 || nc_b == 0) return ComplexDiagMatrix (nr_a, nc_a, 0.0); ComplexDiagMatrix c (nr_a, nc_b); int len = nr_a < nc_b ? nr_a : nc_b; for (int i = 0; i < len; i++) { Complex a_element = a.elem (i, i); double b_element = b.elem (i, i); if (a_element == 0.0 || b_element == 0.0) c.elem (i, i) = 0.0; else if (a_element == 1.0) c.elem (i, i) = b_element; else if (b_element == 1.0) c.elem (i, i) = a_element; else c.elem (i, i) = a_element * b_element; } return c; } ComplexDiagMatrix product (const ComplexDiagMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix product attempted"); return ComplexDiagMatrix (); } if (nr == 0 || nc == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (multiply (m.data (), a.data (), m.length ()), nr, nc); } // diagonal matrix by matrix -> matrix operations ComplexMatrix operator + (const ComplexDiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator - (const ComplexDiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (-a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator * (const ComplexDiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, a_nc, 0.0); ComplexMatrix c (nr, a_nc); for (int i = 0; i < m.length (); i++) { if (m.elem (i, i) == 1.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = a.elem (i, j); } else if (m.elem (i, i) == 0.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = 0.0; } else { for (int j = 0; j < a_nc; j++) c.elem (i, j) = m.elem (i, i) * a.elem (i, j); } } if (nr > nc) { for (int j = 0; j < a_nc; j++) for (int i = a_nr; i < nr; i++) c.elem (i, j) = 0.0; } return c; } ComplexMatrix operator + (const ComplexDiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator - (const ComplexDiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (-a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator * (const ComplexDiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, a_nc, 0.0); ComplexMatrix c (nr, a_nc); for (int i = 0; i < m.length (); i++) { if (m.elem (i, i) == 1.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = a.elem (i, j); } else if (m.elem (i, i) == 0.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = 0.0; } else { for (int j = 0; j < a_nc; j++) c.elem (i, j) = m.elem (i, i) * a.elem (i, j); } } if (nr > nc) { for (int j = 0; j < a_nc; j++) for (int i = a_nr; i < nr; i++) c.elem (i, j) = 0.0; } return c; } // other operations ComplexColumnVector ComplexDiagMatrix::diag (void) const { return diag (0); } // Could be optimized... ComplexColumnVector ComplexDiagMatrix::diag (int k) const { int nnr = rows (); int nnc = cols (); if (k > 0) nnc -= k; else if (k < 0) nnr += k; ComplexColumnVector d; if (nnr > 0 && nnc > 0) { int ndiag = (nnr < nnc) ? nnr : nnc; d.resize (ndiag); if (k > 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i+k); } else if ( k < 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i-k, i); } else { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i); } } else cerr << "diag: requested diagonal out of range\n"; return d; } // i/o ostream& operator << (ostream& os, const ComplexDiagMatrix& a) { Complex ZERO (0.0); // int field_width = os.precision () + 7; for (int i = 0; i < a.rows (); i++) { for (int j = 0; j < a.cols (); j++) { if (i == j) os << " " /* setw (field_width) */ << a.elem (i, i); else os << " " /* setw (field_width) */ << ZERO; } os << "\n"; } return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CMatrix.cc100666 415 17 163123 5702420341 15030 0ustar jweusers// Matrix manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include "mx-base.h" #include "CmplxDET.h" #include "CmplxSVD.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" // Fortran functions we call. extern "C" { int F77_FCN (zgemm) (const char*, const char*, const int*, const int*, const int*, const Complex*, const Complex*, const int*, const Complex*, const int*, const Complex*, Complex*, const int*, long, long); int F77_FCN (zgemv) (const char*, const int*, const int*, const Complex*, const Complex*, const int*, const Complex*, const int*, const Complex*, Complex*, const int*, long); int F77_FCN (zgeco) (Complex*, const int*, const int*, int*, double*, Complex*); int F77_FCN (zgedi) (Complex*, const int*, const int*, int*, Complex*, Complex*, const int*); int F77_FCN (zgesl) (Complex*, const int*, const int*, int*, Complex*, const int*); int F77_FCN (zgelss) (const int*, const int*, const int*, Complex*, const int*, Complex*, const int*, double*, const double*, int*, Complex*, const int*, double*, int*); // Note that the original complex fft routines were not written for // double complex arguments. They have been modified by adding an // implicit double precision (a-h,o-z) statement at the beginning of // each subroutine. int F77_FCN (cffti) (const int*, Complex*); int F77_FCN (cfftf) (const int*, Complex*, Complex*); int F77_FCN (cfftb) (const int*, Complex*, Complex*); } #define KLUDGE_MATRICES #define TYPE Complex #define KL_MAT_TYPE ComplexMatrix #include "mx-kludge.cc" #undef KLUDGE_MATRICES #undef TYPE #undef KL_MAT_TYPE /* * Complex Matrix class */ ComplexMatrix::ComplexMatrix (const Matrix& a) : Array2 (a.rows (), a.cols ()) { for (int j = 0; j < cols (); j++) for (int i = 0; i < rows (); i++) elem (i, j) = a.elem (i, j); } ComplexMatrix::ComplexMatrix (const DiagMatrix& a) : Array2 (a.rows (), a.cols (), 0.0) { for (int i = 0; i < a.length (); i++) elem (i, i) = a.elem (i, i); } ComplexMatrix::ComplexMatrix (const ComplexDiagMatrix& a) : Array2 (a.rows (), a.cols (), 0.0) { for (int i = 0; i < a.length (); i++) elem (i, i) = a.elem (i, i); } #if 0 ComplexMatrix& ComplexMatrix::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r * c; Complex* new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; int min_r = nr < r ? nr : r; int min_c = nc < c ? nc : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) new_data[r*j+i] = elem (i, j); } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } ComplexMatrix& ComplexMatrix::resize (int r, int c, double val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r * c; Complex *new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; // There may be faster or cleaner ways to do this. if (r > nr || c > nc) copy (new_data, new_len, val); int min_r = nr < r ? nr : r; int min_c = nc < c ? nc : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) new_data[r*j+i] = elem (i, j); } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } ComplexMatrix& ComplexMatrix::resize (int r, int c, const Complex& val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r * c; Complex *new_data = 0; if (new_len > 0) { new_data = new Complex [new_len]; // There may be faster or cleaner ways to do this. if (r > nr || c > nc) copy (new_data, new_len, val); int min_r = nr < r ? nr : r; int min_c = nc < c ? nc : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) new_data[r*j+i] = elem (i, j); } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } #endif int ComplexMatrix::operator == (const ComplexMatrix& a) const { if (rows () != a.rows () || cols () != a.cols ()) return 0; return equal (data (), a.data (), length ()); } int ComplexMatrix::operator != (const ComplexMatrix& a) const { return !(*this == a); } // destructive insert/delete/reorder operations ComplexMatrix& ComplexMatrix::insert (const Matrix& a, int r, int c) { int a_nr = a.rows (); int a_nc = a.cols (); if (r < 0 || r + a_nr - 1 > rows () || c < 0 || c + a_nc - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int j = 0; j < a_nc; j++) for (int i = 0; i < a_nr; i++) elem (r+i, c+j) = a.elem (i, j); return *this; } ComplexMatrix& ComplexMatrix::insert (const RowVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r >= rows () || c < 0 || c + a_len - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r, c+i) = a.elem (i); return *this; } ComplexMatrix& ComplexMatrix::insert (const ColumnVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > rows () || c < 0 || c >= cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i, c) = a.elem (i); return *this; } ComplexMatrix& ComplexMatrix::insert (const DiagMatrix& a, int r, int c) { if (r < 0 || r + a.rows () - 1 > rows () || c < 0 || c + a.cols () - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a.length (); i++) elem (r+i, c+i) = a.elem (i, i); return *this; } ComplexMatrix& ComplexMatrix::insert (const ComplexMatrix& a, int r, int c) { int a_nr = a.rows (); int a_nc = a.cols (); if (r < 0 || r + a_nr - 1 > rows () || c < 0 || c + a_nc - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int j = 0; j < a_nc; j++) for (int i = 0; i < a_nr; i++) elem (r+i, c+j) = a.elem (i, j); return *this; } ComplexMatrix& ComplexMatrix::insert (const ComplexRowVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r >= rows () || c < 0 || c + a_len - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r, c+i) = a.elem (i); return *this; } ComplexMatrix& ComplexMatrix::insert (const ComplexColumnVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > rows () || c < 0 || c >= cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i, c) = a.elem (i); return *this; } ComplexMatrix& ComplexMatrix::insert (const ComplexDiagMatrix& a, int r, int c) { if (r < 0 || r + a.rows () - 1 > rows () || c < 0 || c + a.cols () - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a.length (); i++) elem (r+i, c+i) = a.elem (i, i); return *this; } ComplexMatrix& ComplexMatrix::fill (double val) { int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) elem (i, j) = val; return *this; } ComplexMatrix& ComplexMatrix::fill (const Complex& val) { int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) elem (i, j) = val; return *this; } ComplexMatrix& ComplexMatrix::fill (double val, int r1, int c1, int r2, int c2) { int nr = rows (); int nc = cols (); if (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0 || r1 >= nr || r2 >= nr || c1 >= nc || c2 >= nc) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int j = c1; j <= c2; j++) for (int i = r1; i <= r2; i++) elem (i, j) = val; return *this; } ComplexMatrix& ComplexMatrix::fill (const Complex& val, int r1, int c1, int r2, int c2) { int nr = rows (); int nc = cols (); if (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0 || r1 >= nr || r2 >= nr || c1 >= nc || c2 >= nc) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int j = c1; j <= c2; j++) for (int i = r1; i <= r2; i++) elem (i, j) = val; return *this; } ComplexMatrix ComplexMatrix::append (const Matrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const RowVector& a) const { int nr = rows (); int nc = cols (); if (nr != 1) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.length ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const ColumnVector& a) const { int nr = rows (); int nc = cols (); if (nr != a.length ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + 1); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const DiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const ComplexMatrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const ComplexRowVector& a) const { int nr = rows (); int nc = cols (); if (nr != 1) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.length ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const ComplexColumnVector& a) const { int nr = rows (); int nc = cols (); if (nr != a.length ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + 1); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::append (const ComplexDiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; ComplexMatrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } ComplexMatrix ComplexMatrix::stack (const Matrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const RowVector& a) const { int nr = rows (); int nc = cols (); if (nc != a.length ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + 1, nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const ColumnVector& a) const { int nr = rows (); int nc = cols (); if (nc != 1) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.length (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const DiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const ComplexMatrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const ComplexRowVector& a) const { int nr = rows (); int nc = cols (); if (nc != a.length ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + 1, nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const ComplexColumnVector& a) const { int nr = rows (); int nc = cols (); if (nc != 1) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.length (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::stack (const ComplexDiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return *this; } int nr_insert = nr; ComplexMatrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } ComplexMatrix ComplexMatrix::hermitian (void) const { int nr = rows (); int nc = cols (); ComplexMatrix result; if (length () > 0) { result.resize (nc, nr); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (j, i) = conj (elem (i, j)); } return result; } ComplexMatrix ComplexMatrix::transpose (void) const { int nr = rows (); int nc = cols (); ComplexMatrix result (nc, nr); if (length () > 0) { for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (j, i) = elem (i, j); } return result; } Matrix real (const ComplexMatrix& a) { int a_len = a.length (); Matrix retval; if (a_len > 0) retval = Matrix (real_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } Matrix imag (const ComplexMatrix& a) { int a_len = a.length (); Matrix retval; if (a_len > 0) retval = Matrix (imag_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } ComplexMatrix conj (const ComplexMatrix& a) { int a_len = a.length (); ComplexMatrix retval; if (a_len > 0) retval = ComplexMatrix (conj_dup (a.data (), a_len), a.rows (), a.cols ()); return retval; } // resize is the destructive equivalent for this one ComplexMatrix ComplexMatrix::extract (int r1, int c1, int r2, int c2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_r = r2 - r1 + 1; int new_c = c2 - c1 + 1; ComplexMatrix result (new_r, new_c); for (int j = 0; j < new_c; j++) for (int i = 0; i < new_r; i++) result.elem (i, j) = elem (r1+i, c1+j); return result; } // extract row or column i. ComplexRowVector ComplexMatrix::row (int i) const { int nc = cols (); if (i < 0 || i >= rows ()) { (*current_liboctave_error_handler) ("invalid row selection"); return ComplexRowVector (); } ComplexRowVector retval (nc); for (int j = 0; j < cols (); j++) retval.elem (j) = elem (i, j); return retval; } ComplexRowVector ComplexMatrix::row (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid row selection"); return ComplexRowVector (); } char c = *s; if (c == 'f' || c == 'F') return row (0); else if (c == 'l' || c == 'L') return row (rows () - 1); else { (*current_liboctave_error_handler) ("invalid row selection"); return ComplexRowVector (); } } ComplexColumnVector ComplexMatrix::column (int i) const { int nr = rows (); if (i < 0 || i >= cols ()) { (*current_liboctave_error_handler) ("invalid column selection"); return ComplexColumnVector (); } ComplexColumnVector retval (nr); for (int j = 0; j < nr; j++) retval.elem (j) = elem (j, i); return retval; } ComplexColumnVector ComplexMatrix::column (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid column selection"); return ComplexColumnVector (); } char c = *s; if (c == 'f' || c == 'F') return column (0); else if (c == 'l' || c == 'L') return column (cols () - 1); else { (*current_liboctave_error_handler) ("invalid column selection"); return ComplexColumnVector (); } } ComplexMatrix ComplexMatrix::inverse (void) const { int info; double rcond; return inverse (info, rcond); } ComplexMatrix ComplexMatrix::inverse (int& info) const { double rcond; return inverse (info, rcond); } ComplexMatrix ComplexMatrix::inverse (int& info, double& rcond) const { int nr = rows (); int nc = cols (); int len = length (); if (nr != nc) { (*current_liboctave_error_handler) ("inverse requires square matrix"); return ComplexMatrix (); } info = 0; int *ipvt = new int [nr]; Complex *z = new Complex [nr]; Complex *tmp_data = dup (data (), len); F77_FCN (zgeco) (tmp_data, &nr, &nc, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -1; copy (tmp_data, data (), len); // Restore contents. } else { int job = 1; Complex dummy; F77_FCN (zgedi) (tmp_data, &nr, &nc, ipvt, &dummy, z, &job); } delete [] ipvt; delete [] z; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix ComplexMatrix::pseudo_inverse (double tol) { ComplexSVD result (*this); DiagMatrix S = result.singular_values (); ComplexMatrix U = result.left_singular_matrix (); ComplexMatrix V = result.right_singular_matrix (); ColumnVector sigma = S.diag (); int r = sigma.length () - 1; int nr = rows (); int nc = cols (); if (tol <= 0.0) { if (nr > nc) tol = nr * sigma.elem (0) * DBL_EPSILON; else tol = nc * sigma.elem (0) * DBL_EPSILON; } while (r >= 0 && sigma.elem (r) < tol) r--; if (r < 0) return ComplexMatrix (nc, nr, 0.0); else { ComplexMatrix Ur = U.extract (0, 0, nr-1, r); DiagMatrix D = DiagMatrix (sigma.extract (0, r)) . inverse (); ComplexMatrix Vr = V.extract (0, 0, nc-1, r); return Vr * D * Ur.hermitian (); } } ComplexMatrix ComplexMatrix::fourier (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = dup (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftf) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix ComplexMatrix::ifourier (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = dup (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftb) (&npts, &tmp_data[npts*j], wsave); for (j = 0; j < npts*nsamples; j++) tmp_data[j] = tmp_data[j] / (double) npts; delete [] wsave; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix ComplexMatrix::fourier2d (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = dup (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftf) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; npts = nc; nsamples = nr; nn = 4*npts+15; wsave = new Complex [nn]; Complex *row = new Complex[npts]; F77_FCN (cffti) (&npts, wsave); for (j = 0; j < nsamples; j++) { for (int i = 0; i < npts; i++) row[i] = tmp_data[i*nr + j]; F77_FCN (cfftf) (&npts, row, wsave); for (i = 0; i < npts; i++) tmp_data[i*nr + j] = row[i]; } delete [] wsave; delete [] row; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix ComplexMatrix::ifourier2d (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = dup (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftb) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; for (j = 0; j < npts*nsamples; j++) tmp_data[j] = tmp_data[j] / (double) npts; npts = nc; nsamples = nr; nn = 4*npts+15; wsave = new Complex [nn]; Complex *row = new Complex[npts]; F77_FCN (cffti) (&npts, wsave); for (j = 0; j < nsamples; j++) { for (int i = 0; i < npts; i++) row[i] = tmp_data[i*nr + j]; F77_FCN (cfftb) (&npts, row, wsave); for (i = 0; i < npts; i++) tmp_data[i*nr + j] = row[i] / (double) npts; } delete [] wsave; delete [] row; return ComplexMatrix (tmp_data, nr, nc); } ComplexDET ComplexMatrix::determinant (void) const { int info; double rcond; return determinant (info, rcond); } ComplexDET ComplexMatrix::determinant (int& info) const { double rcond; return determinant (info, rcond); } ComplexDET ComplexMatrix::determinant (int& info, double& rcond) const { ComplexDET retval; int nr = rows (); int nc = cols (); if (nr == 0 || nc == 0) { Complex d[2]; d[0] = 1.0; d[1] = 0.0; retval = ComplexDET (d); } else { info = 0; int *ipvt = new int [nr]; Complex *z = new Complex [nr]; Complex *tmp_data = dup (data (), length ()); F77_FCN (zgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -1; retval = ComplexDET (); } else { int job = 10; Complex d[2]; F77_FCN (zgedi) (tmp_data, &nr, &nr, ipvt, d, z, &job); retval = ComplexDET (d); } delete [] tmp_data; delete [] ipvt; delete [] z; } return retval; } ComplexMatrix ComplexMatrix::solve (const Matrix& b) const { int info; double rcond; return solve (b, info, rcond); } ComplexMatrix ComplexMatrix::solve (const Matrix& b, int& info) const { double rcond; return solve (b, info, rcond); } ComplexMatrix ComplexMatrix::solve (const Matrix& b, int& info, double& rcond) const { ComplexMatrix tmp (b); return solve (tmp, info, rcond); } ComplexMatrix ComplexMatrix::solve (const ComplexMatrix& b) const { int info; double rcond; return solve (b, info, rcond); } ComplexMatrix ComplexMatrix::solve (const ComplexMatrix& b, int& info) const { double rcond; return solve (b, info, rcond); } ComplexMatrix ComplexMatrix::solve (const ComplexMatrix& b, int& info, double& rcond) const { ComplexMatrix retval; int nr = rows (); int nc = cols (); int b_nr = b.rows (); int b_nc = b.cols (); if (nr == 0 || nc == 0 || nr != nc || nr != b_nr) { (*current_liboctave_error_handler) ("matrix dimension mismatch in solution of linear equations"); return ComplexMatrix (); } info = 0; int *ipvt = new int [nr]; Complex *z = new Complex [nr]; Complex *tmp_data = dup (data (), length ()); F77_FCN (zgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -2; } else { int job = 0; Complex *result = dup (b.data (), b.length ()); for (int j = 0; j < b_nc; j++) F77_FCN (zgesl) (tmp_data, &nr, &nr, ipvt, &result[nr*j], &job); retval = ComplexMatrix (result, b_nr, b_nc); } delete [] tmp_data; delete [] ipvt; delete [] z; return retval; } ComplexColumnVector ComplexMatrix::solve (const ComplexColumnVector& b) const { int info; double rcond; return solve (b, info, rcond); } ComplexColumnVector ComplexMatrix::solve (const ComplexColumnVector& b, int& info) const { double rcond; return solve (b, info, rcond); } ComplexColumnVector ComplexMatrix::solve (const ComplexColumnVector& b, int& info, double& rcond) const { ComplexColumnVector retval; int nr = rows (); int nc = cols (); int b_len = b.length (); if (nr == 0 || nc == 0 || nr != nc || nr != b_len) { (*current_liboctave_error_handler) ("matrix dimension mismatch in solution of linear equations"); return ComplexColumnVector (); } info = 0; int *ipvt = new int [nr]; Complex *z = new Complex [nr]; Complex *tmp_data = dup (data (), length ()); F77_FCN (zgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -2; } else { int job = 0; Complex *result = dup (b.data (), b_len); F77_FCN (zgesl) (tmp_data, &nr, &nr, ipvt, result, &job); retval = ComplexColumnVector (result, b_len); } delete [] tmp_data; delete [] ipvt; delete [] z; return retval; } ComplexMatrix ComplexMatrix::lssolve (const ComplexMatrix& b) const { int info; int rank; return lssolve (b, info, rank); } ComplexMatrix ComplexMatrix::lssolve (const ComplexMatrix& b, int& info) const { int rank; return lssolve (b, info, rank); } ComplexMatrix ComplexMatrix::lssolve (const ComplexMatrix& b, int& info, int& rank) const { int nrhs = b.cols (); int m = rows (); int n = cols (); if (m == 0 || n == 0 || m != b.rows ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch solution of linear equations"); return Matrix (); } Complex *tmp_data = dup (data (), length ()); int nrr = m > n ? m : n; ComplexMatrix result (nrr, nrhs); int i, j; for (j = 0; j < nrhs; j++) for (i = 0; i < m; i++) result.elem (i, j) = b.elem (i, j); Complex *presult = result.fortran_vec (); int len_s = m < n ? m : n; double *s = new double [len_s]; double rcond = -1.0; int lwork; if (m < n) lwork = 2*m + (nrhs > n ? nrhs : n); else lwork = 2*n + (nrhs > m ? nrhs : m); Complex *work = new Complex [lwork]; int lrwork = (5 * (m < n ? m : n)) - 4; lrwork = lrwork > 1 ? lrwork : 1; double *rwork = new double [lrwork]; F77_FCN (zgelss) (&m, &n, &nrhs, tmp_data, &m, presult, &nrr, s, &rcond, &rank, work, &lwork, rwork, &info); ComplexMatrix retval (n, nrhs); for (j = 0; j < nrhs; j++) for (i = 0; i < n; i++) retval.elem (i, j) = result.elem (i, j); delete [] tmp_data; delete [] s; delete [] work; delete [] rwork; return retval; } ComplexColumnVector ComplexMatrix::lssolve (const ComplexColumnVector& b) const { int info; int rank; return lssolve (b, info, rank); } ComplexColumnVector ComplexMatrix::lssolve (const ComplexColumnVector& b, int& info) const { int rank; return lssolve (b, info, rank); } ComplexColumnVector ComplexMatrix::lssolve (const ComplexColumnVector& b, int& info, int& rank) const { int nrhs = 1; int m = rows (); int n = cols (); if (m == 0 || n == 0 || m != b.length ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch solution of least squares problem"); return ComplexColumnVector (); } Complex *tmp_data = dup (data (), length ()); int nrr = m > n ? m : n; ComplexColumnVector result (nrr); int i; for (i = 0; i < m; i++) result.elem (i) = b.elem (i); Complex *presult = result.fortran_vec (); int len_s = m < n ? m : n; double *s = new double [len_s]; double rcond = -1.0; int lwork; if (m < n) lwork = 2*m + (nrhs > n ? nrhs : n); else lwork = 2*n + (nrhs > m ? nrhs : m); Complex *work = new Complex [lwork]; int lrwork = (5 * (m < n ? m : n)) - 4; lrwork = lrwork > 1 ? lrwork : 1; double *rwork = new double [lrwork]; F77_FCN (zgelss) (&m, &n, &nrhs, tmp_data, &m, presult, &nrr, s, &rcond, &rank, work, &lwork, rwork, &info); ComplexColumnVector retval (n); for (i = 0; i < n; i++) retval.elem (i) = result.elem (i); delete [] tmp_data; delete [] s; delete [] work; delete [] rwork; return retval; } // matrix by diagonal matrix -> matrix operations ComplexMatrix& ComplexMatrix::operator += (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) += a.elem (i, i); return *this; } ComplexMatrix& ComplexMatrix::operator -= (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) -= a.elem (i, i); return *this; } ComplexMatrix& ComplexMatrix::operator += (const ComplexDiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) += a.elem (i, i); return *this; } ComplexMatrix& ComplexMatrix::operator -= (const ComplexDiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) -= a.elem (i, i); return *this; } // matrix by matrix -> matrix operations ComplexMatrix& ComplexMatrix::operator += (const Matrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } ComplexMatrix& ComplexMatrix::operator -= (const Matrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } ComplexMatrix& ComplexMatrix::operator += (const ComplexMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } ComplexMatrix& ComplexMatrix::operator -= (const ComplexMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } // unary operations Matrix ComplexMatrix::operator ! (void) const { return Matrix (not (data (), length ()), rows (), cols ()); } // matrix by scalar -> matrix operations ComplexMatrix operator + (const ComplexMatrix& a, double s) { return ComplexMatrix (add (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator - (const ComplexMatrix& a, double s) { return ComplexMatrix (subtract (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator * (const ComplexMatrix& a, double s) { return ComplexMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator / (const ComplexMatrix& a, double s) { return ComplexMatrix (divide (a.data (), a.length (), s), a.rows (), a.cols ()); } // scalar by matrix -> matrix operations ComplexMatrix operator + (double s, const ComplexMatrix& a) { return ComplexMatrix (add (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator - (double s, const ComplexMatrix& a) { return ComplexMatrix (subtract (s, a.data (), a.length ()), a.rows (), a.cols ()); } ComplexMatrix operator * (double s, const ComplexMatrix& a) { return ComplexMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator / (double s, const ComplexMatrix& a) { return ComplexMatrix (divide (s, a.data (), a.length ()), a.rows (), a.cols ()); } // matrix by column vector -> column vector operations ComplexColumnVector operator * (const ComplexMatrix& m, const ColumnVector& a) { ComplexColumnVector tmp (a); return m * tmp; } ComplexColumnVector operator * (const ComplexMatrix& m, const ComplexColumnVector& a) { int nr = m.rows (); int nc = m.cols (); if (nc != a.length ()) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexColumnVector (); } if (nc == 0 || nr == 0) return ComplexColumnVector (0); char trans = 'N'; int ld = nr; Complex alpha (1.0); Complex beta (0.0); int i_one = 1; Complex *y = new Complex [nr]; F77_FCN (zgemv) (&trans, &nr, &nc, &alpha, m.data (), &ld, a.data (), &i_one, &beta, y, &i_one, 1L); return ComplexColumnVector (y, nr); } // matrix by diagonal matrix -> matrix operations ComplexMatrix operator + (const ComplexMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) += a.elem (i, i); return result; } ComplexMatrix operator - (const ComplexMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) -= a.elem (i, i); return result; } ComplexMatrix operator * (const ComplexMatrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nc = a.cols (); if (nc != a.rows ()) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, nc, 0.0); Complex *c = new Complex [nr*a_nc]; Complex *ctmp = 0; for (int j = 0; j < a.length (); j++) { int idx = j * nr; ctmp = c + idx; if (a.elem (j, j) == 1.0) { for (int i = 0; i < nr; i++) ctmp[i] = m.elem (i, j); } else if (a.elem (j, j) == 0.0) { for (int i = 0; i < nr; i++) ctmp[i] = 0.0; } else { for (int i = 0; i < nr; i++) ctmp[i] = a.elem (j, j) * m.elem (i, j); } } if (a.rows () < a_nc) { for (int i = nr * nc; i < nr * a_nc; i++) ctmp[i] = 0.0; } return ComplexMatrix (c, nr, a_nc); } ComplexMatrix operator + (const ComplexMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) += a.elem (i, i); return result; } ComplexMatrix operator - (const ComplexMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) -= a.elem (i, i); return result; } ComplexMatrix operator * (const ComplexMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nc = a.cols (); if (nc != a.rows ()) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, nc, 0.0); Complex *c = new Complex [nr*a_nc]; Complex *ctmp = 0; for (int j = 0; j < a.length (); j++) { int idx = j * nr; ctmp = c + idx; if (a.elem (j, j) == 1.0) { for (int i = 0; i < nr; i++) ctmp[i] = m.elem (i, j); } else if (a.elem (j, j) == 0.0) { for (int i = 0; i < nr; i++) ctmp[i] = 0.0; } else { for (int i = 0; i < nr; i++) ctmp[i] = a.elem (j, j) * m.elem (i, j); } } if (a.rows () < a_nc) { for (int i = nr * nc; i < nr * a_nc; i++) ctmp[i] = 0.0; } return ComplexMatrix (c, nr, a_nc); } // matrix by matrix -> matrix operations ComplexMatrix operator + (const ComplexMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (add (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix operator - (const ComplexMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (subtract (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix operator * (const ComplexMatrix& m, const Matrix& a) { ComplexMatrix tmp (a); return m * tmp; } ComplexMatrix operator * (const ComplexMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nc = a.cols (); if (nc != a.rows ()) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, nc, 0.0); char trans = 'N'; char transa = 'N'; int ld = nr; int lda = a.rows (); Complex alpha (1.0); Complex beta (0.0); Complex *c = new Complex [nr*a_nc]; F77_FCN (zgemm) (&trans, &transa, &nr, &a_nc, &nc, &alpha, m.data (), &ld, a.data (), &lda, &beta, c, &nr, 1L, 1L); return ComplexMatrix (c, nr, a_nc); } ComplexMatrix product (const ComplexMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix product attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (multiply (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix quotient (const ComplexMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix quotient attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (divide (m.data (), a.data (), m.length ()), nr, nc); } // other operations ComplexMatrix map (c_c_Mapper f, const ComplexMatrix& a) { ComplexMatrix b (a); b.map (f); return b; } Matrix map (d_c_Mapper f, const ComplexMatrix& a) { int a_nc = a.cols (); int a_nr = a.rows (); Matrix b (a_nr, a_nc); for (int j = 0; j < a_nc; j++) for (int i = 0; i < a_nr; i++) b.elem (i, j) = f (a.elem (i, j)); return b; } void ComplexMatrix::map (c_c_Mapper f) { for (int j = 0; j < cols (); j++) for (int i = 0; i < rows (); i++) elem (i, j) = f (elem (i, j)); } Matrix ComplexMatrix::all (void) const { int nr = rows (); int nc = cols (); Matrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int j = 0; j < nc; j++) { if (elem (0, j) == 0.0) { retval.elem (0, 0) = 0.0; break; } } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int i = 0; i < nr; i++) { if (elem (i, 0) == 0.0) { retval.elem (0, 0) = 0.0; break; } } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 1.0; for (int i = 0; i < nr; i++) { if (elem (i, j) == 0.0) { retval.elem (0, j) = 0.0; break; } } } } } return retval; } Matrix ComplexMatrix::any (void) const { int nr = rows (); int nc = cols (); Matrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) { if (elem (0, j) != 0.0) { retval.elem (0, 0) = 1.0; break; } } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) { if (elem (i, 0) != 0.0) { retval.elem (0, 0) = 1.0; break; } } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) { if (elem (i, j) != 0.0) { retval.elem (0, j) = 1.0; break; } } } } } return retval; } ComplexMatrix ComplexMatrix::cumprod (void) const { int nr = rows (); int nc = cols (); ComplexMatrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, nc); Complex prod = elem (0, 0); for (int j = 0; j < nc; j++) { retval.elem (0, j) = prod; if (j < nc - 1) prod *= elem (0, j+1); } } else if (nc == 1) { retval.resize (nr, 1); Complex prod = elem (0, 0); for (int i = 0; i < nr; i++) { retval.elem (i, 0) = prod; if (i < nr - 1) prod *= elem (i+1, 0); } } else { retval.resize (nr, nc); for (int j = 0; j < nc; j++) { Complex prod = elem (0, j); for (int i = 0; i < nr; i++) { retval.elem (i, j) = prod; if (i < nr - 1) prod *= elem (i+1, j); } } } } return retval; } ComplexMatrix ComplexMatrix::cumsum (void) const { int nr = rows (); int nc = cols (); ComplexMatrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, nc); Complex sum = elem (0, 0); for (int j = 0; j < nc; j++) { retval.elem (0, j) = sum; if (j < nc - 1) sum += elem (0, j+1); } } else if (nc == 1) { retval.resize (nr, 1); Complex sum = elem (0, 0); for (int i = 0; i < nr; i++) { retval.elem (i, 0) = sum; if (i < nr - 1) sum += elem (i+1, 0); } } else { retval.resize (nr, nc); for (int j = 0; j < nc; j++) { Complex sum = elem (0, j); for (int i = 0; i < nr; i++) { retval.elem (i, j) = sum; if (i < nr - 1) sum += elem (i+1, j); } } } } return retval; } ComplexMatrix ComplexMatrix::prod (void) const { int nr = rows (); int nc = cols (); ComplexMatrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int j = 0; j < nc; j++) retval.elem (0, 0) *= elem (0, j); } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int i = 0; i < nr; i++) retval.elem (0, 0) *= elem (i, 0); } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 1.0; for (int i = 0; i < nr; i++) retval.elem (0, j) *= elem (i, j); } } } return retval; } ComplexMatrix ComplexMatrix::sum (void) const { int nr = rows (); int nc = cols (); ComplexMatrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) retval.elem (0, 0) += elem (0, j); } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) retval.elem (0, 0) += elem (i, 0); } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) retval.elem (0, j) += elem (i, j); } } } return retval; } ComplexMatrix ComplexMatrix::sumsq (void) const { int nr = rows (); int nc = cols (); ComplexMatrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) { Complex d = elem (0, j); retval.elem (0, 0) += d * d; } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) { Complex d = elem (i, 0); retval.elem (0, 0) += d * d; } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) { Complex d = elem (i, j); retval.elem (0, j) += d * d; } } } } return retval; } ComplexColumnVector ComplexMatrix::diag (void) const { return diag (0); } ComplexColumnVector ComplexMatrix::diag (int k) const { int nnr = rows (); int nnc = cols (); if (k > 0) nnc -= k; else if (k < 0) nnr += k; ComplexColumnVector d; if (nnr > 0 && nnc > 0) { int ndiag = (nnr < nnc) ? nnr : nnc; d.resize (ndiag); if (k > 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i+k); } else if ( k < 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i-k, i); } else { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i); } } else cerr << "diag: requested diagonal out of range\n"; return d; } // XXX FIXME XXX -- it would be nice to share some code among all the // min/max functions below. It would also be nice to combine the // min/max and min_loc/max_loc functions. ComplexColumnVector ComplexMatrix::row_min (void) const { ComplexColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int row_is_real_only = 1; for (int j = 0; j < nc; j++) if (imag (elem (i, j)) != 0.0) { row_is_real_only = 0; break; } if (row_is_real_only) { double res = real (elem (i, 0)); for (int j = 1; j < nc; j++) { double tmp = real (elem (i, j)); if (tmp < res) res = tmp; } result.elem (i) = res; } else { Complex res = elem (i, 0); double absres = abs (res); for (int j = 1; j < nc; j++) if (abs (elem (i, j)) < absres) { res = elem (i, j); absres = abs (res); } result.elem (i) = res; } } } return result; } ComplexColumnVector ComplexMatrix::row_min_loc (void) const { ComplexColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int column_is_real_only = 1; for (int j = 0; j < nc; j++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = 0; double tmp = real (elem (i, 0)); for (int j = 1; j < nc; j++) if (real (elem (i, j)) < tmp) res = j; result.elem (i) = res + 1; } else { Complex res = 0; double absres = abs (elem (i, 0)); for (int j = 1; j < nc; j++) if (abs (elem (i, j)) < absres) { res = j; absres = abs (elem (i, j)); } result.elem (i) = res + 1; } } } return result; } ComplexColumnVector ComplexMatrix::row_max (void) const { ComplexColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int row_is_real_only = 1; for (int j = 0; j < nc; j++) if (imag (elem (i, j)) != 0.0) { row_is_real_only = 0; break; } if (row_is_real_only) { double res = real (elem (i, 0)); for (int j = 1; j < nc; j++) { double tmp = real (elem (i, j)); if (tmp > res) res = tmp; } result.elem (i) = res; } else { Complex res = elem (i, 0); double absres = abs (res); for (int j = 1; j < nc; j++) if (abs (elem (i, j)) > absres) { res = elem (i, j); absres = abs (res); } result.elem (i) = res; } } } return result; } ComplexColumnVector ComplexMatrix::row_max_loc (void) const { ComplexColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int column_is_real_only = 1; for (int j = 0; j < nc; j++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = 0; double tmp = real (elem (i, 0)); for (int j = 1; j < nc; j++) if (real (elem (i, j)) > tmp) res = j; result.elem (i) = res + 1; } else { Complex res = 0; double absres = abs (elem (i, 0)); for (int j = 1; j < nc; j++) if (abs (elem (i, j)) > absres) { res = j; absres = abs (elem (i, j)); } result.elem (i) = res + 1; } } } return result; } ComplexRowVector ComplexMatrix::column_min (void) const { ComplexRowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int column_is_real_only = 1; for (int i = 0; i < nr; i++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = real (elem (0, j)); for (int i = 1; i < nr; i++) { double tmp = real (elem (i, j)); if (tmp < res) res = tmp; } result.elem (j) = res; } else { Complex res = elem (0, j); double absres = abs (res); for (int i = 1; i < nr; i++) if (abs (elem (i, j)) < absres) { res = elem (i, j); absres = abs (res); } result.elem (j) = res; } } } return result; } ComplexRowVector ComplexMatrix::column_min_loc (void) const { ComplexRowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int column_is_real_only = 1; for (int i = 0; i < nr; i++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = 0; double tmp = real (elem (0, j)); for (int i = 1; i < nr; i++) if (real (elem (i, j)) < tmp) res = i; result.elem (j) = res + 1; } else { Complex res = 0; double absres = abs (elem (0, j)); for (int i = 1; i < nr; i++) if (abs (elem (i, j)) < absres) { res = i; absres = abs (elem (i, j)); } result.elem (j) = res + 1; } } } return result; } ComplexRowVector ComplexMatrix::column_max (void) const { ComplexRowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int column_is_real_only = 1; for (int i = 0; i < nr; i++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = real (elem (0, j)); for (int i = 1; i < nr; i++) { double tmp = real (elem (i, j)); if (tmp > res) res = tmp; } result.elem (j) = res; } else { Complex res = elem (0, j); double absres = abs (res); for (int i = 1; i < nr; i++) if (abs (elem (i, j)) > absres) { res = elem (i, j); absres = abs (res); } result.elem (j) = res; } } } return result; } ComplexRowVector ComplexMatrix::column_max_loc (void) const { ComplexRowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int column_is_real_only = 1; for (int i = 0; i < nr; i++) if (imag (elem (i, j)) != 0.0) { column_is_real_only = 0; break; } if (column_is_real_only) { double res = 0; double tmp = real (elem (0, j)); for (int i = 1; i < nr; i++) if (real (elem (i, j)) > tmp) res = i; result.elem (j) = res + 1; } else { Complex res = 0; double absres = abs (elem (0, j)); for (int i = 1; i < nr; i++) if (abs (elem (i, j)) > absres) { res = i; absres = abs (elem (i, j)); } result.elem (j) = res + 1; } } } return result; } // i/o ostream& operator << (ostream& os, const ComplexMatrix& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.rows (); i++) { for (int j = 0; j < a.cols (); j++) os << " " /* setw (field_width) */ << a.elem (i, j); os << "\n"; } return os; } istream& operator >> (istream& is, ComplexMatrix& a) { int nr = a.rows (); int nc = a.cols (); if (nr < 1 || nc < 1) is.clear (ios::badbit); else { Complex tmp; for (int i = 0; i < nr; i++) for (int j = 0; j < nc; j++) { is >> tmp; if (is) a.elem (i, j) = tmp; else break; } } return is; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CRowVector.cc100666 415 17 33063 5702420340 15474 0ustar jweusers// RowVector manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" // Fortran functions we call. extern "C" { int F77_FCN (zgemv) (const char*, const int*, const int*, const Complex*, const Complex*, const int*, const Complex*, const int*, const Complex*, Complex*, const int*, long); } /* * Complex Row Vector class */ #define KLUDGE_VECTORS #define TYPE Complex #define KL_VEC_TYPE ComplexRowVector #include "mx-kludge.cc" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE ComplexRowVector::ComplexRowVector (const RowVector& a) : Array (a.length ()) { for (int i = 0; i < length (); i++) elem (i) = a.elem (i); } #if 0 ComplexRowVector& ComplexRowVector::resize (int n) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return *this; } Complex *new_data = 0; if (n > 0) { new_data = new Complex [n]; int min_len = len < n ? len : n; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; len = n; data = new_data; return *this; } ComplexRowVector& ComplexRowVector::resize (int n, double val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } ComplexRowVector& ComplexRowVector::resize (int n, const Complex& val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } #endif int ComplexRowVector::operator == (const ComplexRowVector& a) const { int len = length (); if (len != a.length ()) return 0; return equal (data (), a.data (), len); } int ComplexRowVector::operator != (const ComplexRowVector& a) const { return !(*this == a); } // destructive insert/delete/reorder operations ComplexRowVector& ComplexRowVector::insert (const RowVector& a, int c) { int a_len = a.length (); if (c < 0 || c + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (c+i) = a.elem (i); return *this; } ComplexRowVector& ComplexRowVector::insert (const ComplexRowVector& a, int c) { int a_len = a.length (); if (c < 0 || c + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (c+i) = a.elem (i); return *this; } ComplexRowVector& ComplexRowVector::fill (double val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } ComplexRowVector& ComplexRowVector::fill (const Complex& val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } ComplexRowVector& ComplexRowVector::fill (double val, int c1, int c2) { int len = length (); if (c1 < 0 || c2 < 0 || c1 >= len || c2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int i = c1; i <= c2; i++) elem (i) = val; return *this; } ComplexRowVector& ComplexRowVector::fill (const Complex& val, int c1, int c2) { int len = length (); if (c1 < 0 || c2 < 0 || c1 >= len || c2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int i = c1; i <= c2; i++) elem (i) = val; return *this; } ComplexRowVector ComplexRowVector::append (const RowVector& a) const { int len = length (); int nc_insert = len; ComplexRowVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nc_insert); return retval; } ComplexRowVector ComplexRowVector::append (const ComplexRowVector& a) const { int len = length (); int nc_insert = len; ComplexRowVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nc_insert); return retval; } ComplexColumnVector ComplexRowVector::hermitian (void) const { int len = length (); return ComplexColumnVector (conj_dup (data (), len), len); } ComplexColumnVector ComplexRowVector::transpose (void) const { int len = length (); return ComplexColumnVector (dup (data (), len), len); } RowVector real (const ComplexRowVector& a) { int a_len = a.length (); RowVector retval; if (a_len > 0) retval = RowVector (real_dup (a.data (), a_len), a_len); return retval; } RowVector imag (const ComplexRowVector& a) { int a_len = a.length (); RowVector retval; if (a_len > 0) retval = RowVector (imag_dup (a.data (), a_len), a_len); return retval; } ComplexRowVector conj (const ComplexRowVector& a) { int a_len = a.length (); ComplexRowVector retval; if (a_len > 0) retval = ComplexRowVector (conj_dup (a.data (), a_len), a_len); return retval; } // resize is the destructive equivalent for this one ComplexRowVector ComplexRowVector::extract (int c1, int c2) const { if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_c = c2 - c1 + 1; ComplexRowVector result (new_c); for (int i = 0; i < new_c; i++) result.elem (i) = elem (c1+i); return result; } // row vector by row vector -> row vector operations ComplexRowVector& ComplexRowVector::operator += (const RowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } ComplexRowVector& ComplexRowVector::operator -= (const RowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } ComplexRowVector& ComplexRowVector::operator += (const ComplexRowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } ComplexRowVector& ComplexRowVector::operator -= (const ComplexRowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; Complex *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } // row vector by scalar -> row vector operations ComplexRowVector operator + (const ComplexRowVector& v, double s) { int len = v.length (); return ComplexRowVector (add (v.data (), len, s), len); } ComplexRowVector operator - (const ComplexRowVector& v, double s) { int len = v.length (); return ComplexRowVector (subtract (v.data (), len, s), len); } ComplexRowVector operator * (const ComplexRowVector& v, double s) { int len = v.length (); return ComplexRowVector (multiply (v.data (), len, s), len); } ComplexRowVector operator / (const ComplexRowVector& v, double s) { int len = v.length (); return ComplexRowVector (divide (v.data (), len, s), len); } // scalar by row vector -> row vector operations ComplexRowVector operator + (double s, const ComplexRowVector& a) { int a_len = a.length (); return ComplexRowVector (add (a.data (), a_len, s), a_len); } ComplexRowVector operator - (double s, const ComplexRowVector& a) { int a_len = a.length (); return ComplexRowVector (subtract (s, a.data (), a_len), a_len); } ComplexRowVector operator * (double s, const ComplexRowVector& a) { int a_len = a.length (); return ComplexRowVector (multiply (a.data (), a_len, s), a_len); } ComplexRowVector operator / (double s, const ComplexRowVector& a) { int a_len = a.length (); return ComplexRowVector (divide (s, a.data (), a_len), a_len); } // row vector by column vector -> scalar Complex operator * (const ComplexRowVector& v, const ColumnVector& a) { ComplexColumnVector tmp (a); return v * tmp; } Complex operator * (const ComplexRowVector& v, const ComplexColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return 0.0; } Complex retval (0.0, 0.0); for (int i = 0; i < len; i++) retval += v.elem (i) * a.elem (i); return retval; } // row vector by matrix -> row vector ComplexRowVector operator * (const ComplexRowVector& v, const ComplexMatrix& a) { int len = v.length (); if (a.rows () != len) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return ComplexRowVector (); } if (len == 0 || a.cols () == 0) return ComplexRowVector (0); // Transpose A to form A'*x == (x'*A)' int a_nr = a.rows (); int a_nc = a.cols (); char trans = 'T'; int ld = a_nr; Complex alpha (1.0); Complex beta (0.0); int i_one = 1; Complex *y = new Complex [len]; F77_FCN (zgemv) (&trans, &a_nc, &a_nr, &alpha, a.data (), &ld, v.data (), &i_one, &beta, y, &i_one, 1L); return ComplexRowVector (y, len); } // row vector by row vector -> row vector operations ComplexRowVector operator + (const ComplexRowVector& v, const RowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector addition attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (add (v.data (), a.data (), len), len); } ComplexRowVector operator - (const ComplexRowVector& v, const RowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector subtraction attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (subtract (v.data (), a.data (), len), len); } ComplexRowVector product (const ComplexRowVector& v, const RowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector product attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (multiply (v.data (), a.data (), len), len); } ComplexRowVector quotient (const ComplexRowVector& v, const RowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector quotient attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (divide (v.data (), a.data (), len), len); } // other operations ComplexRowVector map (c_c_Mapper f, const ComplexRowVector& a) { ComplexRowVector b (a); b.map (f); return b; } RowVector map (d_c_Mapper f, const ComplexRowVector& a) { int a_len = a.length (); RowVector b (a_len); for (int i = 0; i < a_len; i++) b.elem (i) = f (a.elem (i)); return b; } void ComplexRowVector::map (c_c_Mapper f) { for (int i = 0; i < length (); i++) elem (i) = f (elem (i)); } Complex ComplexRowVector::min (void) const { int len = length (); if (len == 0) return Complex (0.0); Complex res = elem (0); double absres = abs (res); for (int i = 1; i < len; i++) if (abs (elem (i)) < absres) { res = elem (i); absres = abs (res); } return res; } Complex ComplexRowVector::max (void) const { int len = length (); if (len == 0) return Complex (0.0); Complex res = elem (0); double absres = abs (res); for (int i = 1; i < len; i++) if (abs (elem (i)) > absres) { res = elem (i); absres = abs (res); } return res; } // i/o ostream& operator << (ostream& os, const ComplexRowVector& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.length (); i++) os << " " /* setw (field_width) */ << a.elem (i); return os; } istream& operator >> (istream& is, ComplexRowVector& a) { int len = a.length(); if (len < 1) is.clear (ios::badbit); else { Complex tmp; for (int i = 0; i < len; i++) { is >> tmp; if (is) a.elem (i) = tmp; else break; } } return is; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxAEPBAL.cc100666 415 17 3712 5702420340 15345 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxAEPBAL.h" #include "dMatrix.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgebal) (const char*, const int*, Complex*, const int*, int*, int*, double*, int*, long, long); int F77_FCN (zgebak) (const char*, const char*, const int*, const int*, const int*, double*, const int*, Complex*, const int*, int*, long, long); } int ComplexAEPBALANCE::init (const ComplexMatrix& a, const char *balance_job) { int n = a.cols (); // Parameters for balance call. int info; int ilo; int ihi; double *scale = new double [n]; // Copy matrix into local structure. balanced_mat = a; F77_FCN (zgebal) (balance_job, &n, balanced_mat.fortran_vec (), &n, &ilo, &ihi, scale, &info, 1L, 1L); // Initialize balancing matrix to identity. balancing_mat = Matrix (n, n, 0.0); for (int i = 0; i < n; i++) balancing_mat (i, i) = 1.0; F77_FCN (zgebak) (balance_job, "R", &n, &ilo, &ihi, scale, &n, balancing_mat.fortran_vec (), &n, &info, 1L, 1L); delete [] scale; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxCHOL.cc100666 415 17 3426 5702420337 15156 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxCHOL.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zpotrf) (const char*, const int*, Complex*, const int*, int*, long); } int ComplexCHOL::init (const ComplexMatrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("ComplexCHOL requires square matrix"); return -1; } char uplo = 'U'; int n = a_nc; int info; Complex *h = dup (a.data (), a.length ()); F77_FCN (zpotrf) (&uplo, &n, h, &n, &info, 1L); chol_mat = ComplexMatrix (h, n, n); // If someone thinks of a more graceful way of doing this (or faster for // that matter :-)), please let me know! if (n > 1) for (int j = 0; j < a_nc; j++) for (int i = j+1; i < a_nr; i++) chol_mat.elem (i, j) = 0.0; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxDET.cc100666 415 17 2673 5702420337 15050 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include "CmplxDET.h" int ComplexDET::value_will_overflow (void) const { return det[2].real () + 1 > log10 (DBL_MAX) ? 1 : 0; } int ComplexDET::value_will_underflow (void) const { return det[2].real () - 1 < log10 (DBL_MIN) ? 1 : 0; } Complex ComplexDET::coefficient (void) const { return det[0]; } int ComplexDET::exponent (void) const { return (int) (det[1].real ()); } Complex ComplexDET::value (void) const { return det[0] * pow (10.0, det[1].real ()); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxHESS.cc100666 415 17 5710 5702420337 15171 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxHESS.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgebal) (const char*, const int*, Complex*, const int*, int*, int*, double*, int*, long, long); int F77_FCN (zgebak) (const char*, const char*, const int*, const int*, const int*, double*, const int*, Complex*, const int*, int*, long, long); int F77_FCN (zgehrd) (const int*, const int*, const int*, Complex*, const int*, Complex*, Complex*, const int*, int*, long, long); int F77_FCN (zunghr) (const int*, const int*, const int*, Complex*, const int*, Complex*, Complex*, const int*, int*, long, long); } int ComplexHESS::init (const ComplexMatrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("ComplexHESS requires square matrix"); return -1; } char job = 'N'; char side = 'R'; int n = a_nc; int lwork = 32 * n; int info; int ilo; int ihi; Complex *h = dup (a.data (), a.length ()); double *scale = new double [n]; Complex *tau = new Complex [n-1]; Complex *work = new Complex [lwork]; Complex *z = new Complex [n*n]; F77_FCN (zgebal) (&job, &n, h, &n, &ilo, &ihi, scale, &info, 1L, 1L); F77_FCN (zgehrd) (&n, &ilo, &ihi, h, &n, tau, work, &lwork, &info, 1L, 1L); copy (z, h, n*n); F77_FCN (zunghr) (&n, &ilo, &ihi, z, &n, tau, work, &lwork, &info, 1L, 1L); F77_FCN (zgebak) (&job, &side, &n, &ilo, &ihi, scale, &n, z, &n, &info, 1L, 1L); hess_mat = ComplexMatrix (h, n, n); unitary_hess_mat = ComplexMatrix (z, n, n); // If someone thinks of a more graceful way of doing this (or faster for // that matter :-)), please let me know! if (n > 2) for (int j = 0; j < a_nc; j++) for (int i = j+2; i < a_nr; i++) hess_mat.elem (i, j) = 0; delete [] work; delete [] tau; delete [] scale; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxLU.cc100666 415 17 4341 5702420336 14745 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxLU.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgesv) (const int*, const int*, Complex*, const int*, int*, Complex*, const int*, int*); } ComplexLU::ComplexLU (const ComplexMatrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr == 0 || a_nc == 0 || a_nr != a_nc) { (*current_liboctave_error_handler) ("ComplexLU requires square matrix"); return; } int n = a_nr; int *ipvt = new int [n]; int *pvt = new int [n]; Complex *tmp_data = dup (a.data (), a.length ()); int info = 0; int zero = 0; Complex b; F77_FCN (zgesv) (&n, &zero, tmp_data, &n, ipvt, &b, &n, &info); ComplexMatrix A_fact (tmp_data, n, n); int i; for (i = 0; i < n; i++) { ipvt[i] -= 1; pvt[i] = i; } for (i = 0; i < n - 1; i++) { int k = ipvt[i]; if (k != i) { int tmp = pvt[k]; pvt[k] = pvt[i]; pvt[i] = tmp; } } l.resize (n, n, 0.0); u.resize (n, n, 0.0); p.resize (n, n, 0.0); for (i = 0; i < n; i++) { p.elem (i, pvt[i]) = 1.0; int j; l.elem (i, i) = 1.0; for (j = 0; j < i; j++) l.elem (i, j) = A_fact.elem (i, j); for (j = i; j < n; j++) u.elem (i, j) = A_fact.elem (i, j); } delete [] ipvt; delete [] pvt; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxQR.cc100666 415 17 5242 5702420336 14750 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxQR.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgeqrf) (const int*, const int*, Complex*, const int*, Complex*, Complex*, const int*, int*); int F77_FCN (zungqr) (const int*, const int*, const int*, Complex*, const int*, Complex*, Complex*, const int*, int*); } ComplexQR::ComplexQR (const ComplexMatrix& a, QR::type qr_type) { int m = a.rows (); int n = a.cols (); if (m == 0 || n == 0) { (*current_liboctave_error_handler) ("ComplexQR must have non-empty matrix"); return; } Complex *tmp_data; int min_mn = m < n ? m : n; Complex *tau = new Complex[min_mn]; int lwork = 32*n; Complex *work = new Complex[lwork]; int info = 0; if (m > n) { tmp_data = new Complex [m*m]; copy (tmp_data, a.data (), a.length ()); } else tmp_data = dup (a.data (), a.length ()); F77_FCN (zgeqrf) (&m, &n, tmp_data, &m, tau, work, &lwork, &info); delete [] work; if (qr_type == QR::raw) { for (int j = 0; j < min_mn; j++) { int limit = j < min_mn - 1 ? j : min_mn - 1; for (int i = limit + 1; i < m; i++) tmp_data[m*j+i] *= tau[j]; } } else { int n2; if (qr_type == QR::economy && m > n) { n2 = n; r.resize (n, n, 0.0); } else { n2 = m; r.resize (m, n, 0.0); } for (int j = 0; j < n; j++) { int limit = j < min_mn-1 ? j : min_mn-1; for (int i = 0; i <= limit; i++) r.elem (i, j) = tmp_data[m*j+i]; } lwork = 32*m; work = new Complex[lwork]; F77_FCN (zungqr) (&m, &m, &min_mn, tmp_data, &m, tau, work, &lwork, &info); q = ComplexMatrix (tmp_data, m, m); q.resize (m, n2); delete [] tau; delete [] work; } } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxQRP.cc100666 415 17 6202 5702420335 15064 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "CmplxQRP.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgeqpf) (const int*, const int*, Complex*, const int*, int*, Complex*, Complex*, double*, int*); int F77_FCN (zungqr) (const int*, const int*, const int*, Complex*, const int*, Complex*, Complex*, const int*, int*); } // It would be best to share some of this code with ComplexQR class... ComplexQRP::ComplexQRP (const ComplexMatrix& a, QR::type qr_type) { assert (qr_type != QR::raw); int m = a.rows (); int n = a.cols (); if (m == 0 || n == 0) { (*current_liboctave_error_handler) ("ComplexQR must have non-empty matrix"); return; } Complex *tmp_data; int min_mn = m < n ? m : n; Complex *tau = new Complex[min_mn]; int lwork = n; Complex *work = new Complex[lwork]; int info = 0; if (m > n) { tmp_data = new Complex [m*m]; copy (tmp_data, a.data (), a.length ()); } else tmp_data = dup (a.data (), a.length ()); work = new Complex[n]; double *rwork = new double[2*n]; int *jpvt = new int[n]; // Clear Pivot vector (code to enforce a certain permutation would go // here...) for (int i = 0; i < n; i++) jpvt[i] = 0; F77_FCN (zgeqpf) (&m, &n, tmp_data, &m, jpvt, tau, work, rwork, &info); // Form Permutation matrix (if economy is requested, return the // indices only!) if (qr_type == QR::economy && m > n) { p.resize (1, n, 0.0); for (int j = 0; j < n; j++) p.elem (0, j) = jpvt[j]; } else { p.resize (n, n, 0.0); for (int j = 0; j < n; j++) p.elem (jpvt[j]-1, j) = 1.0; } delete [] jpvt; delete [] work; int n2; if (qr_type == QR::economy && m > n) { n2 = n; r.resize (n, n, 0.0); } else { n2 = m; r.resize (m, n, 0.0); } for (int j = 0; j < n; j++) { int limit = j < min_mn-1 ? j : min_mn-1; for (int i = 0; i <= limit; i++) r.elem (i, j) = tmp_data[m*j+i]; } lwork = 32*m; work = new Complex[lwork]; F77_FCN (zungqr) (&m, &m, &min_mn, tmp_data, &m, tau, work, &lwork, &info); q = ComplexMatrix (tmp_data, m, m); q.resize (m, n2); delete [] tau; delete [] work; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxSCHUR.cc100666 415 17 5756 5702420335 15323 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxSCHUR.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (zgeesx) (const char*, const char*, int (*)(Complex*), const char*, const int*, Complex*, const int*, int*, Complex*, Complex*, const int*, double*, double*, Complex*, const int*, double*, int*, int*, long, long); } static int complex_select_ana (Complex *a) { return a->real () < 0.0; } static int complex_select_dig (Complex *a) { return (abs (*a) < 1.0); } int ComplexSCHUR::init (const ComplexMatrix& a, const char *ord) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("ComplexSCHUR requires square matrix"); return -1; } char jobvs = 'V'; char sort; if (*ord == 'A' || *ord == 'D' || *ord == 'a' || *ord == 'd') sort = 'S'; else sort = 'N'; char sense = 'N'; int n = a_nc; int lwork = 8 * n; int info; int sdim; double rconde; double rcondv; double *rwork = new double [n]; // bwork is not referenced for non-ordered Schur. int *bwork = 0; if (*ord == 'A' || *ord == 'D' || *ord == 'a' || *ord == 'd') bwork = new int [n]; Complex *s = dup (a.data (), a.length ()); Complex *work = new Complex [lwork]; Complex *q = new Complex [n*n]; Complex *w = new Complex [n]; if (*ord == 'A' || *ord == 'a') { F77_FCN (zgeesx) (&jobvs, &sort, complex_select_ana, &sense, &n, s, &n, &sdim, w, q, &n, &rconde, &rcondv, work, &lwork, rwork, bwork, &info, 1L, 1L); } else if (*ord == 'D' || *ord == 'd') { F77_FCN (zgeesx) (&jobvs, &sort, complex_select_dig, &sense, &n, s, &n, &sdim, w, q, &n, &rconde, &rcondv, work, &lwork, rwork, bwork, &info, 1L, 1L); } else { F77_FCN (zgeesx) (&jobvs, &sort, (void *) 0, &sense, &n, s, &n, &sdim, w, q, &n, &rconde, &rcondv, work, &lwork, rwork, bwork, &info, 1L, 1L); } schur_mat = ComplexMatrix (s, n, n); unitary_mat = ComplexMatrix (q, n, n); delete [] w; delete [] work; delete [] rwork; delete [] bwork; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxSVD.cc100666 415 17 4401 5702420334 15054 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CmplxSVD.h" #include "mx-inlines.cc" #include "f77-uscore.h" extern "C" { int F77_FCN (zgesvd) (const char*, const char*, const int*, const int*, Complex*, const int*, double*, Complex*, const int*, Complex*, const int*, Complex*, const int*, double*, int*, long, long); } int ComplexSVD::init (const ComplexMatrix& a, SVD::type svd_type) { int info; int m = a.rows (); int n = a.cols (); Complex *tmp_data = dup (a.data (), a.length ()); int min_mn = m < n ? m : n; int max_mn = m > n ? m : n; char jobu = 'A'; char jobv = 'A'; int ncol_u = m; int nrow_vt = n; int nrow_s = m; int ncol_s = n; if (svd_type == SVD::economy) { jobu = jobv = 'S'; ncol_u = nrow_vt = nrow_s = ncol_s = min_mn; } Complex *u = new Complex[m * ncol_u]; double *s_vec = new double[min_mn]; Complex *vt = new Complex[nrow_vt * n]; int lwork = 2*min_mn + max_mn; Complex *work = new Complex[lwork]; int lrwork = 5*max_mn; double *rwork = new double[lrwork]; F77_FCN (zgesvd) (&jobu, &jobv, &m, &n, tmp_data, &m, s_vec, u, &m, vt, &nrow_vt, work, &lwork, rwork, &info, 1L, 1L); left_sm = ComplexMatrix (u, m, ncol_u); sigma = DiagMatrix (s_vec, nrow_s, ncol_s); ComplexMatrix vt_m (vt, nrow_vt, n); right_sm = vt_m.hermitian (); delete [] tmp_data; delete [] work; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/EIG.cc100666 415 17 7126 5702420333 14026 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "EIG.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgeev) (const char*, const char*, const int*, double*, const int*, double*, double*, double*, const int*, double*, const int*, double*, const int*, int*, long, long); int F77_FCN (zgeev) (const char*, const char*, const int*, Complex*, const int*, Complex*, Complex*, const int*, Complex*, const int*, Complex*, const int*, double*, int*, long, long); } int EIG::init (const Matrix& a) { int a_nr = a.rows (); if (a_nr != a.cols ()) { (*current_liboctave_error_handler) ("EIG requires square matrix"); return -1; } int n = a_nr; int info; char jobvl = 'N'; char jobvr = 'V'; double *tmp_data = dup (a.data (), a.length ()); double *wr = new double[n]; double *wi = new double[n]; Matrix vr (n, n); double *pvr = vr.fortran_vec (); int lwork = 8*n; double *work = new double[lwork]; double dummy; int idummy = 1; F77_FCN (dgeev) (&jobvl, &jobvr, &n, tmp_data, &n, wr, wi, &dummy, &idummy, pvr, &n, work, &lwork, &info, 1L, 1L); lambda.resize (n); v.resize (n, n); for (int j = 0; j < n; j++) { if (wi[j] == 0.0) { lambda.elem (j) = Complex (wr[j]); for (int i = 0; i < n; i++) v.elem (i, j) = vr.elem (i, j); } else { if (j+1 >= n) { (*current_liboctave_error_handler) ("EIG: internal error"); return -1; } for (int i = 0; i < n; i++) { lambda.elem (j) = Complex (wr[j], wi[j]); lambda.elem (j+1) = Complex (wr[j+1], wi[j+1]); double real_part = vr.elem (i, j); double imag_part = vr.elem (i, j+1); v.elem (i, j) = Complex (real_part, imag_part); v.elem (i, j+1) = Complex (real_part, -imag_part); } j++; } } delete [] tmp_data; delete [] wr; delete [] wi; delete [] work; return info; } int EIG::init (const ComplexMatrix& a) { int a_nr = a.rows (); if (a_nr != a.cols ()) { (*current_liboctave_error_handler) ("EIG requires square matrix"); return -1; } int n = a_nr; int info; char jobvl = 'N'; char jobvr = 'V'; lambda.resize (n); v.resize (n, n); Complex *pw = lambda.fortran_vec (); Complex *pvr = v.fortran_vec (); Complex *tmp_data = dup (a.data (), a.length ()); int lwork = 8*n; Complex *work = new Complex[lwork]; double *rwork = new double[4*n]; Complex dummy; int idummy = 1; F77_FCN (zgeev) (&jobvl, &jobvr, &n, tmp_data, &n, pw, &dummy, &idummy, pvr, &n, work, &lwork, rwork, &info, 1L, 1L); delete [] tmp_data; delete [] work; delete [] rwork; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dColVector.cc100666 415 17 23303 5702420323 15500 0ustar jweusers// ColumnVector manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "f77-uscore.h" #include "lo-error.h" // Fortran functions we call. extern "C" { int F77_FCN (dgemm) (const char*, const char*, const int*, const int*, const int*, const double*, const double*, const int*, const double*, const int*, const double*, double*, const int*, long, long); } /* * Column Vector class. */ #define KLUDGE_VECTORS #define TYPE double #define KL_VEC_TYPE ColumnVector #include "mx-kludge.cc" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE #if 0 ColumnVector& ColumnVector::resize (int n) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return *this; } double *new_data = 0; if (n > 0) { new_data = new double [n]; int min_len = len < n ? len : n; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; len = n; data = new_data; return *this; } ColumnVector& ColumnVector::resize (int n, double val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } #endif int ColumnVector::operator == (const ColumnVector& a) const { int len = length (); if (len != a.length ()) return 0; return equal (data (), a.data (), len); } int ColumnVector::operator != (const ColumnVector& a) const { return !(*this == a); } ColumnVector& ColumnVector::insert (const ColumnVector& a, int r) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i) = a.elem (i); return *this; } ColumnVector& ColumnVector::fill (double val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } ColumnVector& ColumnVector::fill (double val, int r1, int r2) { int len = length (); if (r1 < 0 || r2 < 0 || r1 >= len || r2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } for (int i = r1; i <= r2; i++) elem (i) = val; return *this; } ColumnVector ColumnVector::stack (const ColumnVector& a) const { int len = length (); int nr_insert = len; ColumnVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nr_insert); return retval; } RowVector ColumnVector::transpose (void) const { int len = length (); return RowVector (dup (data (), len), len); } // resize is the destructive equivalent for this one ColumnVector ColumnVector::extract (int r1, int r2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } int new_r = r2 - r1 + 1; ColumnVector result (new_r); for (int i = 0; i < new_r; i++) result.elem (i) = elem (r1+i); return result; } // column vector by column vector -> column vector operations ColumnVector& ColumnVector::operator += (const ColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } ColumnVector& ColumnVector::operator -= (const ColumnVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } // scalar by column vector -> column vector operations ComplexColumnVector operator + (const ColumnVector& a, const Complex& s) { int len = a.length (); return ComplexColumnVector (add (a.data (), len, s), len); } ComplexColumnVector operator - (const ColumnVector& a, const Complex& s) { int len = a.length (); return ComplexColumnVector (subtract (a.data (), len, s), len); } ComplexColumnVector operator * (const ColumnVector& a, const Complex& s) { int len = a.length (); return ComplexColumnVector (multiply (a.data (), len, s), len); } ComplexColumnVector operator / (const ColumnVector& a, const Complex& s) { int len = a.length (); return ComplexColumnVector (divide (a.data (), len, s), len); } // scalar by column vector -> column vector operations ComplexColumnVector operator + (const Complex& s, const ColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (add (a.data (), a_len, s), a_len); } ComplexColumnVector operator - (const Complex& s, const ColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (subtract (s, a.data (), a_len), a_len); } ComplexColumnVector operator * (const Complex& s, const ColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (multiply (a.data (), a_len, s), a_len); } ComplexColumnVector operator / (const Complex& s, const ColumnVector& a) { int a_len = a.length (); return ComplexColumnVector (divide (s, a.data (), a_len), a_len); } // column vector by row vector -> matrix operations Matrix operator * (const ColumnVector& v, const RowVector& a) { int len = v.length (); int a_len = a.length (); if (len != a_len) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return Matrix (); } if (len == 0) return Matrix (len, len, 0.0); char transa = 'N'; char transb = 'N'; double alpha = 1.0; double beta = 0.0; int anr = 1; double *c = new double [len * a_len]; F77_FCN (dgemm) (&transa, &transb, &len, &a_len, &anr, &alpha, v.data (), &len, a.data (), &anr, &beta, c, &len, 1L, 1L); return Matrix (c, len, a_len); } ComplexMatrix operator * (const ColumnVector& v, const ComplexRowVector& a) { ComplexColumnVector tmp (v); return tmp * a; } ComplexColumnVector operator + (const ColumnVector& v, const ComplexColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector subtraction attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (add (v.data (), a.data (), len), len); } ComplexColumnVector operator - (const ColumnVector& v, const ComplexColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector subtraction attempted"); return ComplexColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (subtract (v.data (), a.data (), len), len); } ComplexColumnVector product (const ColumnVector& v, const ComplexColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector product attempted"); return ColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (multiply (v.data (), a.data (), len), len); } ComplexColumnVector quotient (const ColumnVector& v, const ComplexColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector quotient attempted"); return ColumnVector (); } if (len == 0) return ComplexColumnVector (0); return ComplexColumnVector (divide (v.data (), a.data (), len), len); } // other operations ColumnVector map (d_d_Mapper f, const ColumnVector& a) { ColumnVector b (a); b.map (f); return b; } void ColumnVector::map (d_d_Mapper f) { for (int i = 0; i < length (); i++) elem (i) = f (elem (i)); } double ColumnVector::min (void) const { int len = length (); if (len == 0) return 0.0; double res = elem (0); for (int i = 1; i < len; i++) if (elem (i) < res) res = elem (i); return res; } double ColumnVector::max (void) const { int len = length (); if (len == 0) return 0.0; double res = elem (0); for (int i = 1; i < len; i++) if (elem (i) > res) res = elem (i); return res; } ostream& operator << (ostream& os, const ColumnVector& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.length (); i++) os << /* setw (field_width) << */ a.elem (i) << "\n"; return os; } istream& operator >> (istream& is, ColumnVector& a) { int len = a.length(); if (len < 1) is.clear (ios::badbit); else { double tmp; for (int i = 0; i < len; i++) { is >> tmp; if (is) a.elem (i) = tmp; else break; } } return is; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dDiagMatrix.cc100666 415 17 45047 5702420322 15641 0ustar jweusers// DiagMatrix manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "lo-error.h" /* * Diagonal Matrix class. */ #define KLUDGE_DIAG_MATRICES #define TYPE double #define KL_DMAT_TYPE DiagMatrix #include "mx-kludge.cc" #undef KLUDGE_DIAG_MATRICES #undef TYPE #undef KL_DMAT_TYPE #if 0 DiagMatrix& DiagMatrix::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r < c ? r : c; double *new_data = 0; if (new_len > 0) { new_data = new double [new_len]; int min_len = new_len < len ? new_len : len; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } DiagMatrix& DiagMatrix::resize (int r, int c, double val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r < c ? r : c; double *new_data = 0; if (new_len > 0) { new_data = new double [new_len]; int min_len = new_len < len ? new_len : len; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; for (i = min_len; i < new_len; i++) new_data[i] = val; } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } #endif int DiagMatrix::operator == (const DiagMatrix& a) const { if (rows () != a.rows () || cols () != a.cols ()) return 0; return equal (data (), a.data (), length ()); } int DiagMatrix::operator != (const DiagMatrix& a) const { return !(*this == a); } DiagMatrix& DiagMatrix::fill (double val) { for (int i = 0; i < length (); i++) elem (i, i) = val; return *this; } DiagMatrix& DiagMatrix::fill (double val, int beg, int end) { if (beg < 0 || end >= length () || end < beg) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = beg; i < end; i++) elem (i, i) = val; return *this; } DiagMatrix& DiagMatrix::fill (const ColumnVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } DiagMatrix& DiagMatrix::fill (const RowVector& a) { int len = length (); if (a.length () != len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < len; i++) elem (i, i) = a.elem (i); return *this; } DiagMatrix& DiagMatrix::fill (const ColumnVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } DiagMatrix& DiagMatrix::fill (const RowVector& a, int beg) { int a_len = a.length (); if (beg < 0 || beg + a_len >= length ()) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } for (int i = 0; i < a_len; i++) elem (i+beg, i+beg) = a.elem (i); return *this; } DiagMatrix DiagMatrix::transpose (void) const { return DiagMatrix (dup (data (), length ()), cols (), rows ()); } Matrix DiagMatrix::extract (int r1, int c1, int r2, int c2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_r = r2 - r1 + 1; int new_c = c2 - c1 + 1; Matrix result (new_r, new_c); for (int j = 0; j < new_c; j++) for (int i = 0; i < new_r; i++) result.elem (i, j) = elem (r1+i, c1+j); return result; } // extract row or column i. RowVector DiagMatrix::row (int i) const { int nr = rows (); int nc = cols (); if (i < 0 || i >= nr) { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } RowVector retval (nc, 0.0); if (nr <= nc || (nr > nc && i < nc)) retval.elem (i) = elem (i, i); return retval; } RowVector DiagMatrix::row (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } char c = *s; if (c == 'f' || c == 'F') return row (0); else if (c == 'l' || c == 'L') return row (rows () - 1); else { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } } ColumnVector DiagMatrix::column (int i) const { int nr = rows (); int nc = cols (); if (i < 0 || i >= nc) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } ColumnVector retval (nr, 0.0); if (nr >= nc || (nr < nc && i < nr)) retval.elem (i) = elem (i, i); return retval; } ColumnVector DiagMatrix::column (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } char c = *s; if (c == 'f' || c == 'F') return column (0); else if (c == 'l' || c == 'L') return column (cols () - 1); else { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } } DiagMatrix DiagMatrix::inverse (void) const { int info; return inverse (info); } DiagMatrix DiagMatrix::inverse (int &info) const { int nr = rows (); int nc = cols (); int len = length (); if (nr != nc) { (*current_liboctave_error_handler) ("inverse requires square matrix"); return DiagMatrix (); } info = 0; double *tmp_data = dup (data (), len); for (int i = 0; i < len; i++) { if (elem (i, i) == 0.0) { info = -1; copy (tmp_data, data (), len); // Restore contents. break; } else { tmp_data[i] = 1.0 / elem (i, i); } } return DiagMatrix (tmp_data, nr, nc); } // diagonal matrix by diagonal matrix -> diagonal matrix operations DiagMatrix& DiagMatrix::operator += (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nc == 0 || nr == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } DiagMatrix& DiagMatrix::operator -= (const DiagMatrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } // diagonal matrix by scalar -> matrix operations Matrix operator + (const DiagMatrix& a, double s) { Matrix tmp (a.rows (), a.cols (), s); return a + tmp; } Matrix operator - (const DiagMatrix& a, double s) { Matrix tmp (a.rows (), a.cols (), -s); return a + tmp; } ComplexMatrix operator + (const DiagMatrix& a, const Complex& s) { ComplexMatrix tmp (a.rows (), a.cols (), s); return a + tmp; } ComplexMatrix operator - (const DiagMatrix& a, const Complex& s) { ComplexMatrix tmp (a.rows (), a.cols (), -s); return a + tmp; } // diagonal matrix by scalar -> diagonal matrix operations ComplexDiagMatrix operator * (const DiagMatrix& a, const Complex& s) { return ComplexDiagMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexDiagMatrix operator / (const DiagMatrix& a, const Complex& s) { return ComplexDiagMatrix (divide (a.data (), a.length (), s), a.rows (), a.cols ()); } // scalar by diagonal matrix -> matrix operations Matrix operator + (double s, const DiagMatrix& a) { Matrix tmp (a.rows (), a.cols (), s); return tmp + a; } Matrix operator - (double s, const DiagMatrix& a) { Matrix tmp (a.rows (), a.cols (), s); return tmp - a; } ComplexMatrix operator + (const Complex& s, const DiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp + a; } ComplexMatrix operator - (const Complex& s, const DiagMatrix& a) { ComplexMatrix tmp (a.rows (), a.cols (), s); return tmp - a; } // scalar by diagonal matrix -> diagonal matrix operations ComplexDiagMatrix operator * (const Complex& s, const DiagMatrix& a) { return ComplexDiagMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } // diagonal matrix by column vector -> column vector operations ColumnVector operator * (const DiagMatrix& m, const ColumnVector& a) { int nr = m.rows (); int nc = m.cols (); int a_len = a.length (); if (nc != a_len) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ColumnVector (); } if (nc == 0 || nr == 0) return ColumnVector (0); ColumnVector result (nr); for (int i = 0; i < a_len; i++) result.elem (i) = a.elem (i) * m.elem (i, i); for (i = a_len; i < nr; i++) result.elem (i) = 0.0; return result; } ComplexColumnVector operator * (const DiagMatrix& m, const ComplexColumnVector& a) { int nr = m.rows (); int nc = m.cols (); int a_len = a.length (); if (nc != a_len) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ColumnVector (); } if (nc == 0 || nr == 0) return ComplexColumnVector (0); ComplexColumnVector result (nr); for (int i = 0; i < a_len; i++) result.elem (i) = a.elem (i) * m.elem (i, i); for (i = a_len; i < nr; i++) result.elem (i) = 0.0; return result; } // diagonal matrix by diagonal matrix -> diagonal matrix operations DiagMatrix operator * (const DiagMatrix& a, const DiagMatrix& b) { int nr_a = a.rows (); int nc_a = a.cols (); int nr_b = b.rows (); int nc_b = b.cols (); if (nc_a != nr_b) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return DiagMatrix (); } if (nr_a == 0 || nc_a == 0 || nc_b == 0) return DiagMatrix (nr_a, nc_a, 0.0); DiagMatrix c (nr_a, nc_b); int len = nr_a < nc_b ? nr_a : nc_b; for (int i = 0; i < len; i++) { double a_element = a.elem (i, i); double b_element = b.elem (i, i); if (a_element == 0.0 || b_element == 0.0) c.elem (i, i) = 0.0; else if (a_element == 1.0) c.elem (i, i) = b_element; else if (b_element == 1.0) c.elem (i, i) = a_element; else c.elem (i, i) = a_element * b_element; } return c; } ComplexDiagMatrix operator + (const DiagMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexDiagMatrix (); } if (nc == 0 || nr == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (add (m.data (), a.data (), m.length ()), nr, nc); } ComplexDiagMatrix operator - (const DiagMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexDiagMatrix (); } if (nc == 0 || nr == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (subtract (m.data (), a.data (), m.length ()), nr, nc); } ComplexDiagMatrix operator * (const DiagMatrix& a, const ComplexDiagMatrix& b) { int nr_a = a.rows (); int nc_a = a.cols (); int nr_b = b.rows (); int nc_b = b.cols (); if (nc_a != nr_b) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexDiagMatrix (); } if (nr_a == 0 || nc_a == 0 || nc_b == 0) return ComplexDiagMatrix (nr_a, nc_a, 0.0); ComplexDiagMatrix c (nr_a, nc_b); int len = nr_a < nc_b ? nr_a : nc_b; for (int i = 0; i < len; i++) { double a_element = a.elem (i, i); Complex b_element = b.elem (i, i); if (a_element == 0.0 || b_element == 0.0) c.elem (i, i) = 0.0; else if (a_element == 1.0) c.elem (i, i) = b_element; else if (b_element == 1.0) c.elem (i, i) = a_element; else c.elem (i, i) = a_element * b_element; } return c; } ComplexDiagMatrix product (const DiagMatrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix product attempted"); return ComplexDiagMatrix (); } if (nc == 0 || nr == 0) return ComplexDiagMatrix (nr, nc); return ComplexDiagMatrix (multiply (m.data (), a.data (), m.length ()), nr, nc); } // diagonal matrix by matrix -> matrix operations Matrix operator + (const DiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return Matrix (); } if (nr == 0 || nc == 0) return Matrix (nr, nc); Matrix result (a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } Matrix operator - (const DiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return Matrix (); } if (nr == 0 || nc == 0) return Matrix (nr, nc); Matrix result (-a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } Matrix operator * (const DiagMatrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return Matrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return Matrix (nr, a_nc, 0.0); Matrix c (nr, a_nc); for (int i = 0; i < m.length (); i++) { if (m.elem (i, i) == 1.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = a.elem (i, j); } else if (m.elem (i, i) == 0.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = 0.0; } else { for (int j = 0; j < a_nc; j++) c.elem (i, j) = m.elem (i, i) * a.elem (i, j); } } if (nr > nc) { for (int j = 0; j < a_nc; j++) for (int i = a_nr; i < nr; i++) c.elem (i, j) = 0.0; } return c; } ComplexMatrix operator + (const DiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator - (const DiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (-a); for (int i = 0; i < m.length (); i++) result.elem (i, i) += m.elem (i, i); return result; } ComplexMatrix operator * (const DiagMatrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, nc, 0.0); ComplexMatrix c (nr, a_nc); for (int i = 0; i < m.length (); i++) { if (m.elem (i, i) == 1.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = a.elem (i, j); } else if (m.elem (i, i) == 0.0) { for (int j = 0; j < a_nc; j++) c.elem (i, j) = 0.0; } else { for (int j = 0; j < a_nc; j++) c.elem (i, j) = m.elem (i, i) * a.elem (i, j); } } if (nr > nc) { for (int j = 0; j < a_nc; j++) for (int i = a_nr; i < nr; i++) c.elem (i, j) = 0.0; } return c; } // other operations ColumnVector DiagMatrix::diag (void) const { return diag (0); } // Could be optimized... ColumnVector DiagMatrix::diag (int k) const { int nnr = rows (); int nnc = cols (); if (k > 0) nnc -= k; else if (k < 0) nnr += k; ColumnVector d; if (nnr > 0 && nnc > 0) { int ndiag = (nnr < nnc) ? nnr : nnc; d.resize (ndiag); if (k > 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i+k); } else if ( k < 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i-k, i); } else { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i); } } else cerr << "diag: requested diagonal out of range\n"; return d; } ostream& operator << (ostream& os, const DiagMatrix& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.rows (); i++) { for (int j = 0; j < a.cols (); j++) { if (i == j) os << " " /* setw (field_width) */ << a.elem (i, i); else os << " " /* setw (field_width) */ << 0.0; } os << "\n"; } return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dMatrix.cc100666 415 17 137227 5702420322 15076 0ustar jweusers// Matrix manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include "mx-base.h" #include "dbleDET.h" #include "dbleSVD.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" // Fortran functions we call. extern "C" { int F77_FCN (dgemm) (const char*, const char*, const int*, const int*, const int*, const double*, const double*, const int*, const double*, const int*, const double*, double*, const int*, long, long); int F77_FCN (dgemv) (const char*, const int*, const int*, const double*, const double*, const int*, const double*, const int*, const double*, double*, const int*, long); int F77_FCN (dgeco) (double*, const int*, const int*, int*, double*, double*); int F77_FCN (dgesl) (const double*, const int*, const int*, const int*, double*, const int*); int F77_FCN (dgedi) (double*, const int*, const int*, const int*, double*, double*, const int*); int F77_FCN (dgelss) (const int*, const int*, const int*, double*, const int*, double*, const int*, double*, const double*, int*, double*, const int*, int*); // Note that the original complex fft routines were not written for // double complex arguments. They have been modified by adding an // implicit double precision (a-h,o-z) statement at the beginning of // each subroutine. int F77_FCN (cffti) (const int*, Complex*); int F77_FCN (cfftf) (const int*, Complex*, Complex*); int F77_FCN (cfftb) (const int*, Complex*, Complex*); } #define KLUDGE_MATRICES #define TYPE double #define KL_MAT_TYPE Matrix #include "mx-kludge.cc" #undef KLUDGE_MATRICES #undef TYPE #undef KL_MAT_TYPE /* * Matrix class. */ Matrix::Matrix (const DiagMatrix& a) : Array2 (a.rows (), a.cols (), 0.0) { for (int i = 0; i < a.length (); i++) elem (i, i) = a.elem (i, i); } #if 0 Matrix& Matrix::resize (int r, int c) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r * c; double* new_data = 0; if (new_len > 0) { new_data = new double [new_len]; int min_r = nr < r ? nr : r; int min_c = nc < c ? nc : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) new_data[r*j+i] = elem (i, j); } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } Matrix& Matrix::resize (int r, int c, double val) { if (r < 0 || c < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimensions"); return *this; } int new_len = r * c; double *new_data = 0; if (new_len > 0) { new_data = new double [new_len]; // There may be faster or cleaner ways to do this. if (r > nr || c > nc) copy (new_data, new_len, val); int min_r = nr < r ? nr : r; int min_c = nc < c ? nc : c; for (int j = 0; j < min_c; j++) for (int i = 0; i < min_r; i++) new_data[r*j+i] = elem (i, j); } delete [] data; nr = r; nc = c; len = new_len; data = new_data; return *this; } #endif int Matrix::operator == (const Matrix& a) const { if (rows () != a.rows () || cols () != a.cols ()) return 0; return equal (data (), a.data (), length ()); } int Matrix::operator != (const Matrix& a) const { return !(*this == a); } Matrix& Matrix::insert (const Matrix& a, int r, int c) { int a_rows = a.rows (); int a_cols = a.cols (); if (r < 0 || r + a_rows - 1 > rows () || c < 0 || c + a_cols - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int j = 0; j < a_cols; j++) for (int i = 0; i < a_rows; i++) elem (r+i, c+j) = a.elem (i, j); return *this; } Matrix& Matrix::insert (const RowVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r >= rows () || c < 0 || c + a_len - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r, c+i) = a.elem (i); return *this; } Matrix& Matrix::insert (const ColumnVector& a, int r, int c) { int a_len = a.length (); if (r < 0 || r + a_len - 1 > rows () || c < 0 || c >= cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (r+i, c) = a.elem (i); return *this; } Matrix& Matrix::insert (const DiagMatrix& a, int r, int c) { if (r < 0 || r + a.rows () - 1 > rows () || c < 0 || c + a.cols () - 1 > cols ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a.length (); i++) elem (r+i, c+i) = a.elem (i, i); return *this; } Matrix& Matrix::fill (double val) { int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) elem (i, j) = val; return *this; } Matrix& Matrix::fill (double val, int r1, int c1, int r2, int c2) { int nr = rows (); int nc = cols (); if (r1 < 0 || r2 < 0 || c1 < 0 || c2 < 0 || r1 >= nr || r2 >= nr || c1 >= nc || c2 >= nc) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int j = c1; j <= c2; j++) for (int i = r1; i <= r2; i++) elem (i, j) = val; return *this; } Matrix Matrix::append (const Matrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return Matrix (); } int nc_insert = nc; Matrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } Matrix Matrix::append (const RowVector& a) const { int nr = rows (); int nc = cols (); if (nr != 1) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return Matrix (); } int nc_insert = nc; Matrix retval (nr, nc + a.length ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } Matrix Matrix::append (const ColumnVector& a) const { int nr = rows (); int nc = cols (); if (nr != a.length ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return Matrix (); } int nc_insert = nc; Matrix retval (nr, nc + 1); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } Matrix Matrix::append (const DiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nr != a.rows ()) { (*current_liboctave_error_handler) ("row dimension mismatch for append"); return *this; } int nc_insert = nc; Matrix retval (nr, nc + a.cols ()); retval.insert (*this, 0, 0); retval.insert (a, 0, nc_insert); return retval; } Matrix Matrix::stack (const Matrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return Matrix (); } int nr_insert = nr; Matrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } Matrix Matrix::stack (const RowVector& a) const { int nr = rows (); int nc = cols (); if (nc != a.length ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return Matrix (); } int nr_insert = nr; Matrix retval (nr + 1, nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } Matrix Matrix::stack (const ColumnVector& a) const { int nr = rows (); int nc = cols (); if (nc != 1) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return Matrix (); } int nr_insert = nr; Matrix retval (nr + a.length (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } Matrix Matrix::stack (const DiagMatrix& a) const { int nr = rows (); int nc = cols (); if (nc != a.cols ()) { (*current_liboctave_error_handler) ("column dimension mismatch for stack"); return Matrix (); } int nr_insert = nr; Matrix retval (nr + a.rows (), nc); retval.insert (*this, 0, 0); retval.insert (a, nr_insert, 0); return retval; } Matrix Matrix::transpose (void) const { int nr = rows (); int nc = cols (); Matrix result (nc, nr); if (length () > 0) { for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (j, i) = elem (i, j); } return result; } Matrix Matrix::extract (int r1, int c1, int r2, int c2) const { if (r1 > r2) { int tmp = r1; r1 = r2; r2 = tmp; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_r = r2 - r1 + 1; int new_c = c2 - c1 + 1; Matrix result (new_r, new_c); for (int j = 0; j < new_c; j++) for (int i = 0; i < new_r; i++) result.elem (i, j) = elem (r1+i, c1+j); return result; } // extract row or column i. RowVector Matrix::row (int i) const { int nc = cols (); if (i < 0 || i >= rows ()) { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } RowVector retval (nc); for (int j = 0; j < nc; j++) retval.elem (j) = elem (i, j); return retval; } RowVector Matrix::row (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } char c = *s; if (c == 'f' || c == 'F') return row (0); else if (c == 'l' || c == 'L') return row (rows () - 1); else { (*current_liboctave_error_handler) ("invalid row selection"); return RowVector (); } } ColumnVector Matrix::column (int i) const { int nr = rows (); if (i < 0 || i >= cols ()) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } ColumnVector retval (nr); for (int j = 0; j < nr; j++) retval.elem (j) = elem (j, i); return retval; } ColumnVector Matrix::column (char *s) const { if (! s) { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } char c = *s; if (c == 'f' || c == 'F') return column (0); else if (c == 'l' || c == 'L') return column (cols () - 1); else { (*current_liboctave_error_handler) ("invalid column selection"); return ColumnVector (); } } Matrix Matrix::inverse (void) const { int info; double rcond; return inverse (info, rcond); } Matrix Matrix::inverse (int& info) const { double rcond; return inverse (info, rcond); } Matrix Matrix::inverse (int& info, double& rcond) const { int nr = rows (); int nc = cols (); int len = length (); if (nr != nc || nr == 0 || nc == 0) { (*current_liboctave_error_handler) ("inverse requires square matrix"); return Matrix (); } info = 0; int *ipvt = new int [nr]; double *z = new double [nr]; double *tmp_data = dup (data (), len); F77_FCN (dgeco) (tmp_data, &nr, &nc, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -1; copy (tmp_data, data (), len); // Restore matrix contents. } else { int job = 1; double dummy; F77_FCN (dgedi) (tmp_data, &nr, &nc, ipvt, &dummy, z, &job); } delete [] ipvt; delete [] z; return Matrix (tmp_data, nr, nc); } Matrix Matrix::pseudo_inverse (double tol) { SVD result (*this); DiagMatrix S = result.singular_values (); Matrix U = result.left_singular_matrix (); Matrix V = result.right_singular_matrix (); ColumnVector sigma = S.diag (); int r = sigma.length () - 1; int nr = rows (); int nc = cols (); if (tol <= 0.0) { if (nr > nc) tol = nr * sigma.elem (0) * DBL_EPSILON; else tol = nc * sigma.elem (0) * DBL_EPSILON; } while (r >= 0 && sigma.elem (r) < tol) r--; if (r < 0) return Matrix (nc, nr, 0.0); else { Matrix Ur = U.extract (0, 0, nr-1, r); DiagMatrix D = DiagMatrix (sigma.extract (0, r)) . inverse (); Matrix Vr = V.extract (0, 0, nc-1, r); return Vr * D * Ur.transpose (); } } ComplexMatrix Matrix::fourier (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = make_complex (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftf) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix Matrix::ifourier (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = make_complex (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftb) (&npts, &tmp_data[npts*j], wsave); for (j = 0; j < npts*nsamples; j++) tmp_data[j] = tmp_data[j] / (double) npts; delete [] wsave; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix Matrix::fourier2d (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = make_complex (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftf) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; npts = nc; nsamples = nr; nn = 4*npts+15; wsave = new Complex [nn]; Complex *row = new Complex[npts]; F77_FCN (cffti) (&npts, wsave); for (j = 0; j < nsamples; j++) { for (int i = 0; i < npts; i++) row[i] = tmp_data[i*nr + j]; F77_FCN (cfftf) (&npts, row, wsave); for (i = 0; i < npts; i++) tmp_data[i*nr + j] = row[i]; } delete [] wsave; delete [] row; return ComplexMatrix (tmp_data, nr, nc); } ComplexMatrix Matrix::ifourier2d (void) const { int nr = rows (); int nc = cols (); int npts, nsamples; if (nr == 1 || nc == 1) { npts = nr > nc ? nr : nc; nsamples = 1; } else { npts = nr; nsamples = nc; } int nn = 4*npts+15; Complex *wsave = new Complex [nn]; Complex *tmp_data = make_complex (data (), length ()); F77_FCN (cffti) (&npts, wsave); for (int j = 0; j < nsamples; j++) F77_FCN (cfftb) (&npts, &tmp_data[npts*j], wsave); delete [] wsave; for (j = 0; j < npts*nsamples; j++) tmp_data[j] = tmp_data[j] / (double) npts; npts = nc; nsamples = nr; nn = 4*npts+15; wsave = new Complex [nn]; Complex *row = new Complex[npts]; F77_FCN (cffti) (&npts, wsave); for (j = 0; j < nsamples; j++) { for (int i = 0; i < npts; i++) row[i] = tmp_data[i*nr + j]; F77_FCN (cfftb) (&npts, row, wsave); for (i = 0; i < npts; i++) tmp_data[i*nr + j] = row[i] / (double) npts; } delete [] wsave; delete [] row; return ComplexMatrix (tmp_data, nr, nc); } DET Matrix::determinant (void) const { int info; double rcond; return determinant (info, rcond); } DET Matrix::determinant (int& info) const { double rcond; return determinant (info, rcond); } DET Matrix::determinant (int& info, double& rcond) const { DET retval; int nr = rows (); int nc = cols (); if (nr == 0 || nc == 0) { double d[2]; d[0] = 1.0; d[1] = 0.0; retval = DET (d); } else { info = 0; int *ipvt = new int [nr]; double *z = new double [nr]; double *tmp_data = dup (data (), length ()); F77_FCN (dgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -1; retval = DET (); } else { int job = 10; double d[2]; F77_FCN (dgedi) (tmp_data, &nr, &nr, ipvt, d, z, &job); retval = DET (d); } delete [] tmp_data; delete [] ipvt; delete [] z; } return retval; } Matrix Matrix::solve (const Matrix& b) const { int info; double rcond; return solve (b, info, rcond); } Matrix Matrix::solve (const Matrix& b, int& info) const { double rcond; return solve (b, info, rcond); } Matrix Matrix::solve (const Matrix& b, int& info, double& rcond) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 0 || nc == 0 || nr != nc || nr != b.rows ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch solution of linear equations"); return Matrix (); } info = 0; int *ipvt = new int [nr]; double *z = new double [nr]; double *tmp_data = dup (data (), length ()); F77_FCN (dgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -2; } else { int job = 0; double *result = dup (b.data (), b.length ()); int b_nc = b.cols (); for (int j = 0; j < b_nc; j++) F77_FCN (dgesl) (tmp_data, &nr, &nr, ipvt, &result[nr*j], &job); retval = Matrix (result, b.rows (), b_nc); } delete [] tmp_data; delete [] ipvt; delete [] z; return retval; } ComplexMatrix Matrix::solve (const ComplexMatrix& b) const { ComplexMatrix tmp (*this); return tmp.solve (b); } ComplexMatrix Matrix::solve (const ComplexMatrix& b, int& info) const { ComplexMatrix tmp (*this); return tmp.solve (b, info); } ComplexMatrix Matrix::solve (const ComplexMatrix& b, int& info, double& rcond) const { ComplexMatrix tmp (*this); return tmp.solve (b, info, rcond); } ColumnVector Matrix::solve (const ColumnVector& b) const { int info; double rcond; return solve (b, info, rcond); } ColumnVector Matrix::solve (const ColumnVector& b, int& info) const { double rcond; return solve (b, info, rcond); } ColumnVector Matrix::solve (const ColumnVector& b, int& info, double& rcond) const { ColumnVector retval; int nr = rows (); int nc = cols (); if (nr == 0 || nc == 0 || nr != nc || nr != b.length ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch solution of linear equations"); return ColumnVector (); } info = 0; int *ipvt = new int [nr]; double *z = new double [nr]; double *tmp_data = dup (data (), length ()); F77_FCN (dgeco) (tmp_data, &nr, &nr, ipvt, &rcond, z); volatile double tmp_rcond = rcond; if (tmp_rcond + 1.0 == 1.0) { info = -2; } else { int job = 0; int b_len = b.length (); double *result = dup (b.data (), b_len); F77_FCN (dgesl) (tmp_data, &nr, &nr, ipvt, result, &job); retval = ColumnVector (result, b_len); } delete [] tmp_data; delete [] ipvt; delete [] z; return retval; } ComplexColumnVector Matrix::solve (const ComplexColumnVector& b) const { ComplexMatrix tmp (*this); return tmp.solve (b); } ComplexColumnVector Matrix::solve (const ComplexColumnVector& b, int& info) const { ComplexMatrix tmp (*this); return tmp.solve (b, info); } ComplexColumnVector Matrix::solve (const ComplexColumnVector& b, int& info, double& rcond) const { ComplexMatrix tmp (*this); return tmp.solve (b, info, rcond); } Matrix Matrix::lssolve (const Matrix& b) const { int info; int rank; return lssolve (b, info, rank); } Matrix Matrix::lssolve (const Matrix& b, int& info) const { int rank; return lssolve (b, info, rank); } Matrix Matrix::lssolve (const Matrix& b, int& info, int& rank) const { int nrhs = b.cols (); int m = rows (); int n = cols (); if (m == 0 || n == 0 || m != b.rows ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch in solution of least squares problem"); return Matrix (); } double *tmp_data = dup (data (), length ()); int nrr = m > n ? m : n; Matrix result (nrr, nrhs); int i, j; for (j = 0; j < nrhs; j++) for (i = 0; i < m; i++) result.elem (i, j) = b.elem (i, j); double *presult = result.fortran_vec (); int len_s = m < n ? m : n; double *s = new double [len_s]; double rcond = -1.0; int lwork; if (m < n) lwork = 3*m + (2*m > nrhs ? (2*m > n ? 2*m : n) : (nrhs > n ? nrhs : n)); else lwork = 3*n + (2*n > nrhs ? (2*n > m ? 2*n : m) : (nrhs > m ? nrhs : m)); double *work = new double [lwork]; F77_FCN (dgelss) (&m, &n, &nrhs, tmp_data, &m, presult, &nrr, s, &rcond, &rank, work, &lwork, &info); Matrix retval (n, nrhs); for (j = 0; j < nrhs; j++) for (i = 0; i < n; i++) retval.elem (i, j) = result.elem (i, j); delete [] tmp_data; delete [] s; delete [] work; return retval; } ComplexMatrix Matrix::lssolve (const ComplexMatrix& b) const { ComplexMatrix tmp (*this); return tmp.lssolve (b); } ComplexMatrix Matrix::lssolve (const ComplexMatrix& b, int& info) const { ComplexMatrix tmp (*this); return tmp.lssolve (b); } ComplexMatrix Matrix::lssolve (const ComplexMatrix& b, int& info, int& rank) const { ComplexMatrix tmp (*this); return tmp.lssolve (b); } ColumnVector Matrix::lssolve (const ColumnVector& b) const { int info; int rank; return lssolve (b, info, rank); } ColumnVector Matrix::lssolve (const ColumnVector& b, int& info) const { int rank; return lssolve (b, info, rank); } ColumnVector Matrix::lssolve (const ColumnVector& b, int& info, int& rank) const { int nrhs = 1; int m = rows (); int n = cols (); if (m == 0 || n == 0 || m != b.length ()) { (*current_liboctave_error_handler) ("matrix dimension mismatch in solution of least squares problem"); return ColumnVector (); } double *tmp_data = dup (data (), length ()); int nrr = m > n ? m : n; ColumnVector result (nrr); int i; for (i = 0; i < m; i++) result.elem (i) = b.elem (i); double *presult = result.fortran_vec (); int len_s = m < n ? m : n; double *s = new double [len_s]; double rcond = -1.0; int lwork; if (m < n) lwork = 3*m + (2*m > nrhs ? (2*m > n ? 2*m : n) : (nrhs > n ? nrhs : n)); else lwork = 3*n + (2*n > nrhs ? (2*n > m ? 2*n : m) : (nrhs > m ? nrhs : m)); double *work = new double [lwork]; F77_FCN (dgelss) (&m, &n, &nrhs, tmp_data, &m, presult, &nrr, s, &rcond, &rank, work, &lwork, &info); ColumnVector retval (n); for (i = 0; i < n; i++) retval.elem (i) = result.elem (i); delete [] tmp_data; delete [] s; delete [] work; return retval; } ComplexColumnVector Matrix::lssolve (const ComplexColumnVector& b) const { ComplexMatrix tmp (*this); return tmp.lssolve (b); } ComplexColumnVector Matrix::lssolve (const ComplexColumnVector& b, int& info) const { ComplexMatrix tmp (*this); return tmp.lssolve (b, info); } ComplexColumnVector Matrix::lssolve (const ComplexColumnVector& b, int& info, int& rank) const { ComplexMatrix tmp (*this); return tmp.lssolve (b, info, rank); } Matrix& Matrix::operator += (const Matrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), length ()); return *this; } Matrix& Matrix::operator -= (const Matrix& a) { int nr = rows (); int nc = cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix -= operation attempted"); return *this; } if (nr == 0 || nc == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), length ()); return *this; } Matrix& Matrix::operator += (const DiagMatrix& a) { if (rows () != a.rows () || cols () != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) += a.elem (i, i); return *this; } Matrix& Matrix::operator -= (const DiagMatrix& a) { if (rows () != a.rows () || cols () != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix += operation attempted"); return *this; } for (int i = 0; i < a.length (); i++) elem (i, i) -= a.elem (i, i); return *this; } // unary operations Matrix Matrix::operator ! (void) const { int nr = rows (); int nc = cols (); Matrix b (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) b.elem (i, j) = ! elem (i, j); return b; } // matrix by scalar -> matrix operations. ComplexMatrix operator + (const Matrix& a, const Complex& s) { return ComplexMatrix (add (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator - (const Matrix& a, const Complex& s) { return ComplexMatrix (subtract (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator * (const Matrix& a, const Complex& s) { return ComplexMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator / (const Matrix& a, const Complex& s) { return ComplexMatrix (divide (a.data (), a.length (), s), a.rows (), a.cols ()); } // scalar by matrix -> matrix operations. ComplexMatrix operator + (const Complex& s, const Matrix& a) { return ComplexMatrix (add (s, a.data (), a.length ()), a.rows (), a.cols ()); } ComplexMatrix operator - (const Complex& s, const Matrix& a) { return ComplexMatrix (subtract (s, a.data (), a.length ()), a.rows (), a.cols ()); } ComplexMatrix operator * (const Complex& s, const Matrix& a) { return ComplexMatrix (multiply (a.data (), a.length (), s), a.rows (), a.cols ()); } ComplexMatrix operator / (const Complex& s, const Matrix& a) { return ComplexMatrix (divide (s, a.data (), a.length ()), a.rows (), a.cols ()); } // matrix by column vector -> column vector operations ColumnVector operator * (const Matrix& m, const ColumnVector& a) { int nr = m.rows (); int nc = m.cols (); if (nc != a.length ()) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ColumnVector (); } if (nr == 0 || nc == 0) return ColumnVector (0); char trans = 'N'; int ld = nr; double alpha = 1.0; double beta = 0.0; int i_one = 1; double *y = new double [nr]; F77_FCN (dgemv) (&trans, &nr, &nc, &alpha, m.data (), &ld, a.data (), &i_one, &beta, y, &i_one, 1L); return ColumnVector (y, nr); } ComplexColumnVector operator * (const Matrix& m, const ComplexColumnVector& a) { ComplexMatrix tmp (m); return tmp * a; } // matrix by diagonal matrix -> matrix operations Matrix operator + (const Matrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return Matrix (); } if (nr == 0 || nc == 0) return Matrix (nr, nc); Matrix result (m); int a_len = a.length (); for (int i = 0; i < a_len; i++) result.elem (i, i) += a.elem (i, i); return result; } Matrix operator - (const Matrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return Matrix (); } if (nr == 0 || nc == 0) return Matrix (nr, nc); Matrix result (m); int a_len = a.length (); for (int i = 0; i < a_len; i++) result.elem (i, i) -= a.elem (i, i); return result; } Matrix operator * (const Matrix& m, const DiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return Matrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return Matrix (nr, a_nc, 0.0); double *c = new double [nr*a_nc]; double *ctmp = 0; int a_len = a.length (); for (int j = 0; j < a_len; j++) { int idx = j * nr; ctmp = c + idx; if (a.elem (j, j) == 1.0) { for (int i = 0; i < nr; i++) ctmp[i] = m.elem (i, j); } else if (a.elem (j, j) == 0.0) { for (int i = 0; i < nr; i++) ctmp[i] = 0.0; } else { for (int i = 0; i < nr; i++) ctmp[i] = a.elem (j, j) * m.elem (i, j); } } if (a_nr < a_nc) { for (int i = nr * nc; i < nr * a_nc; i++) ctmp[i] = 0.0; } return Matrix (c, nr, a_nc); } ComplexMatrix operator + (const Matrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) += a.elem (i, i); return result; } ComplexMatrix operator - (const Matrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); ComplexMatrix result (m); for (int i = 0; i < a.length (); i++) result.elem (i, i) -= a.elem (i, i); return result; } ComplexMatrix operator * (const Matrix& m, const ComplexDiagMatrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return ComplexMatrix (nr, a_nc, 0.0); Complex *c = new Complex [nr*a_nc]; Complex *ctmp = 0; for (int j = 0; j < a.length (); j++) { int idx = j * nr; ctmp = c + idx; if (a.elem (j, j) == 1.0) { for (int i = 0; i < nr; i++) ctmp[i] = m.elem (i, j); } else if (a.elem (j, j) == 0.0) { for (int i = 0; i < nr; i++) ctmp[i] = 0.0; } else { for (int i = 0; i < nr; i++) ctmp[i] = a.elem (j, j) * m.elem (i, j); } } if (a_nr < a_nc) { for (int i = nr * nc; i < nr * a_nc; i++) ctmp[i] = 0.0; } return ComplexMatrix (c, nr, a_nc); } // matrix by matrix -> matrix operations Matrix operator * (const Matrix& m, const Matrix& a) { int nr = m.rows (); int nc = m.cols (); int a_nr = a.rows (); int a_nc = a.cols (); if (nc != a_nr) { (*current_liboctave_error_handler) ("nonconformant matrix multiplication attempted"); return Matrix (); } if (nr == 0 || nc == 0 || a_nc == 0) return Matrix (nr, a_nc, 0.0); char trans = 'N'; char transa = 'N'; int ld = nr; int lda = a_nr; double alpha = 1.0; double beta = 0.0; double *c = new double [nr*a_nc]; F77_FCN (dgemm) (&trans, &transa, &nr, &a_nc, &nc, &alpha, m.data (), &ld, a.data (), &lda, &beta, c, &nr, 1L, 1L); return Matrix (c, nr, a_nc); } ComplexMatrix operator * (const Matrix& m, const ComplexMatrix& a) { ComplexMatrix tmp (m); return tmp * a; } ComplexMatrix operator + (const Matrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix addition attempted"); return ComplexMatrix (); } return ComplexMatrix (add (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix operator - (const Matrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix subtraction attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (subtract (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix product (const Matrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix product attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (multiply (m.data (), a.data (), m.length ()), nr, nc); } ComplexMatrix quotient (const Matrix& m, const ComplexMatrix& a) { int nr = m.rows (); int nc = m.cols (); if (nr != a.rows () || nc != a.cols ()) { (*current_liboctave_error_handler) ("nonconformant matrix quotient attempted"); return ComplexMatrix (); } if (nr == 0 || nc == 0) return ComplexMatrix (nr, nc); return ComplexMatrix (divide (m.data (), a.data (), m.length ()), nr, nc); } // other operations. Matrix map (d_d_Mapper f, const Matrix& a) { Matrix b (a); b.map (f); return b; } void Matrix::map (d_d_Mapper f) { double *d = fortran_vec (); // Ensures only one reference to my privates! for (int i = 0; i < length (); i++) d[i] = f (d[i]); } // XXX FIXME XXX Do these really belong here? They should maybe be // cleaned up a bit, no? What about corresponding functions for the // Vectors? Matrix Matrix::all (void) const { int nr = rows (); int nc = cols (); Matrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int j = 0; j < nc; j++) { if (elem (0, j) == 0.0) { retval.elem (0, 0) = 0.0; break; } } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int i = 0; i < nr; i++) { if (elem (i, 0) == 0.0) { retval.elem (0, 0) = 0.0; break; } } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 1.0; for (int i = 0; i < nr; i++) { if (elem (i, j) == 0.0) { retval.elem (0, j) = 0.0; break; } } } } } return retval; } Matrix Matrix::any (void) const { int nr = rows (); int nc = cols (); Matrix retval; if (nr > 0 && nc > 0) { if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) { if (elem (0, j) != 0.0) { retval.elem (0, 0) = 1.0; break; } } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) { if (elem (i, 0) != 0.0) { retval.elem (0, 0) = 1.0; break; } } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) { if (elem (i, j) != 0.0) { retval.elem (0, j) = 1.0; break; } } } } } return retval; } Matrix Matrix::cumprod (void) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 1) { retval.resize (1, nc); if (nc > 0) { double prod = elem (0, 0); for (int j = 0; j < nc; j++) { retval.elem (0, j) = prod; if (j < nc - 1) prod *= elem (0, j+1); } } } else if (nc == 1) { retval.resize (nr, 1); if (nr > 0) { double prod = elem (0, 0); for (int i = 0; i < nr; i++) { retval.elem (i, 0) = prod; if (i < nr - 1) prod *= elem (i+1, 0); } } } else { retval.resize (nr, nc); if (nr > 0 && nc > 0) { for (int j = 0; j < nc; j++) { double prod = elem (0, j); for (int i = 0; i < nr; i++) { retval.elem (i, j) = prod; if (i < nr - 1) prod *= elem (i+1, j); } } } } return retval; } Matrix Matrix::cumsum (void) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 1) { retval.resize (1, nc); if (nc > 0) { double sum = elem (0, 0); for (int j = 0; j < nc; j++) { retval.elem (0, j) = sum; if (j < nc - 1) sum += elem (0, j+1); } } } else if (nc == 1) { retval.resize (nr, 1); if (nr > 0) { double sum = elem (0, 0); for (int i = 0; i < nr; i++) { retval.elem (i, 0) = sum; if (i < nr - 1) sum += elem (i+1, 0); } } } else { retval.resize (nr, nc); if (nr > 0 && nc > 0) { for (int j = 0; j < nc; j++) { double sum = elem (0, j); for (int i = 0; i < nr; i++) { retval.elem (i, j) = sum; if (i < nr - 1) sum += elem (i+1, j); } } } } return retval; } Matrix Matrix::prod (void) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int j = 0; j < nc; j++) retval.elem (0, 0) *= elem (0, j); } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; for (int i = 0; i < nr; i++) retval.elem (0, 0) *= elem (i, 0); } else { if (nc == 0) { retval.resize (1, 1); retval.elem (0, 0) = 1.0; } else retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 1.0; for (int i = 0; i < nr; i++) retval.elem (0, j) *= elem (i, j); } } return retval; } Matrix Matrix::sum (void) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) retval.elem (0, 0) += elem (0, j); } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) retval.elem (0, 0) += elem (i, 0); } else { if (nc == 0) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; } else retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) retval.elem (0, j) += elem (i, j); } } return retval; } Matrix Matrix::sumsq (void) const { Matrix retval; int nr = rows (); int nc = cols (); if (nr == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int j = 0; j < nc; j++) { double d = elem (0, j); retval.elem (0, 0) += d * d; } } else if (nc == 1) { retval.resize (1, 1); retval.elem (0, 0) = 0.0; for (int i = 0; i < nr; i++) { double d = elem (i, 0); retval.elem (0, 0) += d * d; } } else { retval.resize (1, nc); for (int j = 0; j < nc; j++) { retval.elem (0, j) = 0.0; for (int i = 0; i < nr; i++) { double d = elem (i, j); retval.elem (0, j) += d * d; } } } return retval; } ColumnVector Matrix::diag (void) const { return diag (0); } ColumnVector Matrix::diag (int k) const { int nnr = rows (); int nnc = cols (); if (k > 0) nnc -= k; else if (k < 0) nnr += k; ColumnVector d; if (nnr > 0 && nnc > 0) { int ndiag = (nnr < nnc) ? nnr : nnc; d.resize (ndiag); if (k > 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i+k); } else if ( k < 0) { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i-k, i); } else { for (int i = 0; i < ndiag; i++) d.elem (i) = elem (i, i); } } else cerr << "diag: requested diagonal out of range\n"; return d; } ColumnVector Matrix::row_min (void) const { ColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { double res = elem (i, 0); for (int j = 1; j < nc; j++) if (elem (i, j) < res) res = elem (i, j); result.elem (i) = res; } } return result; } ColumnVector Matrix::row_min_loc (void) const { ColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int res = 0; for (int j = 0; j < nc; j++) if (elem (i, j) < elem (i, res)) res = j; result.elem (i) = (double) (res + 1); } } return result; } ColumnVector Matrix::row_max (void) const { ColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { double res = elem (i, 0); for (int j = 1; j < nc; j++) if (elem (i, j) > res) res = elem (i, j); result.elem (i) = res; } } return result; } ColumnVector Matrix::row_max_loc (void) const { ColumnVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nr); for (int i = 0; i < nr; i++) { int res = 0; for (int j = 0; j < nc; j++) if (elem (i, j) > elem (i, res)) res = j; result.elem (i) = (double) (res + 1); } } return result; } RowVector Matrix::column_min (void) const { RowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { double res = elem (0, j); for (int i = 1; i < nr; i++) if (elem (i, j) < res) res = elem (i, j); result.elem (j) = res; } } return result; } RowVector Matrix::column_min_loc (void) const { RowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int res = 0; for (int i = 0; i < nr; i++) if (elem (i, j) < elem (res, j)) res = i; result.elem (j) = (double) (res + 1); } } return result; } RowVector Matrix::column_max (void) const { RowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { double res = elem (0, j); for (int i = 1; i < nr; i++) if (elem (i, j) > res) res = elem (i, j); result.elem (j) = res; } } return result; } RowVector Matrix::column_max_loc (void) const { RowVector result; int nr = rows (); int nc = cols (); if (nr > 0 && nc > 0) { result.resize (nc); for (int j = 0; j < nc; j++) { int res = 0; for (int i = 0; i < nr; i++) if (elem (i, j) > elem (res, j)) res = i; result.elem (j) = (double) (res + 1); } } return result; } ostream& operator << (ostream& os, const Matrix& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.rows (); i++) { for (int j = 0; j < a.cols (); j++) os << " " /* setw (field_width) */ << a.elem (i, j); os << "\n"; } return os; } istream& operator >> (istream& is, Matrix& a) { int nr = a.rows (); int nc = a.cols (); if (nr < 1 || nc < 1) is.clear (ios::badbit); else { double tmp; for (int i = 0; i < nr; i++) for (int j = 0; j < nc; j++) { is >> tmp; if (is) a.elem (i, j) = tmp; else break; } } return is; } /* * Read an array of data froma file in binary format. */ int Matrix::read (FILE *fptr, char *type) { // Allocate buffer pointers. union { void *vd; char *ch; u_char *uc; short *sh; u_short *us; int *in; u_int *ui; long *ln; u_long *ul; float *fl; double *db; } buf; // Convert data to double. if (! type) { (*current_liboctave_error_handler) ("fread: invalid NULL type parameter"); return 0; } int count; int nitems = length (); double *d = fortran_vec (); // Ensures only one reference to my privates! #define DO_FREAD(TYPE,ELEM) \ do \ { \ size_t size = sizeof (TYPE); \ buf.ch = new char [size * nitems]; \ count = fread (buf.ch, size, nitems, fptr); \ for (int k = 0; k < count; k++) \ d[k] = buf.ELEM[k]; \ delete [] buf.ch; \ } \ while (0) if (strcasecmp (type, "double") == 0) DO_FREAD (double, db); else if (strcasecmp (type, "char") == 0) DO_FREAD (char, ch); else if (strcasecmp (type, "uchar") == 0) DO_FREAD (u_char, uc); else if (strcasecmp (type, "short") == 0) DO_FREAD (short, sh); else if (strcasecmp (type, "ushort") == 0) DO_FREAD (u_short, us); else if (strcasecmp (type, "int") == 0) DO_FREAD (int, in); else if (strcasecmp (type, "uint") == 0) DO_FREAD (u_int, ui); else if (strcasecmp (type, "long") == 0) DO_FREAD (long, ul); else if (strcasecmp (type, "float") == 0) DO_FREAD (float, fl); else { (*current_liboctave_error_handler) ("fread: invalid NULL type parameter"); return 0; } return count; } /* * Write the data array to a file in binary format. */ int Matrix::write (FILE *fptr, char *type) { // Allocate buffer pointers. union { void *vd; char *ch; u_char *uc; short *sh; u_short *us; int *in; u_int *ui; long *ln; u_long *ul; float *fl; double *db; } buf; int nitems = length (); double *d = fortran_vec (); // Convert from double to correct size. if (! type) { (*current_liboctave_error_handler) ("fwrite: invalid NULL type parameter"); return 0; } size_t size; int count; #define DO_FWRITE(TYPE,ELEM) \ do \ { \ size = sizeof (TYPE); \ buf.ELEM = new TYPE [nitems]; \ for (int k = 0; k < nitems; k++) \ buf.ELEM[k] = (TYPE) d[k]; \ count = fwrite (buf.ELEM, size, nitems, fptr); \ delete [] buf.ELEM; \ } \ while (0) if (strcasecmp (type, "double") == 0) DO_FWRITE (double, db); else if (strcasecmp (type, "char") == 0) DO_FWRITE (char, ch); else if (strcasecmp (type, "uchar") == 0) DO_FWRITE (u_char, uc); else if (strcasecmp (type, "short") == 0) DO_FWRITE (short, sh); else if (strcasecmp (type, "ushort") == 0) DO_FWRITE (u_short, us); else if (strcasecmp (type, "int") == 0) DO_FWRITE (int, in); else if (strcasecmp (type, "uint") == 0) DO_FWRITE (u_int, ui); else if (strcasecmp (type, "long") == 0) DO_FWRITE (long, ln); else if (strcasecmp (type, "ulong") == 0) DO_FWRITE (u_long, ul); else if (strcasecmp (type, "float") == 0) DO_FWRITE (float, fl); else { (*current_liboctave_error_handler) ("fwrite: unrecognized type parameter %s", type); return 0; } return count; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dRowVector.cc100666 415 17 23360 5702420322 15534 0ustar jweusers// RowVector manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "mx-base.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" // Fortran functions we call. extern "C" { int F77_FCN (dgemv) (const char*, const int*, const int*, const double*, const double*, const int*, const double*, const int*, const double*, double*, const int*, long); double F77_FCN (ddot) (const int*, const double*, const int*, const double*, const int*); } /* * Row Vector class. */ #define KLUDGE_VECTORS #define TYPE double #define KL_VEC_TYPE RowVector #include "mx-kludge.cc" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE #if 0 RowVector& RowVector::resize (int n) { if (n < 0) { (*current_liboctave_error_handler) ("can't resize to negative dimension"); return *this; } double *new_data = 0; if (n > 0) { new_data = new double [n]; int min_len = len < n ? len : n; for (int i = 0; i < min_len; i++) new_data[i] = data[i]; } delete [] data; len = n; data = new_data; return *this; } RowVector& RowVector::resize (int n, double val) { int old_len = len; resize (n); for (int i = old_len; i < len; i++) data[i] = val; return *this; } #endif int RowVector::operator == (const RowVector& a) const { int len = length (); if (len != a.length ()) return 0; return equal (data (), a.data (), len); } int RowVector::operator != (const RowVector& a) const { return !(*this == a); } RowVector& RowVector::insert (const RowVector& a, int c) { int a_len = a.length (); if (c < 0 || c + a_len - 1 > length ()) { (*current_liboctave_error_handler) ("range error for insert"); return *this; } for (int i = 0; i < a_len; i++) elem (c+i) = a.elem (i); return *this; } RowVector& RowVector::fill (double val) { int len = length (); if (len > 0) for (int i = 0; i < len; i++) elem (i) = val; return *this; } RowVector& RowVector::fill (double val, int c1, int c2) { int len = length (); if (c1 < 0 || c2 < 0 || c1 >= len || c2 >= len) { (*current_liboctave_error_handler) ("range error for fill"); return *this; } if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } for (int i = c1; i <= c2; i++) elem (i) = val; return *this; } RowVector RowVector::append (const RowVector& a) const { int len = length (); int nc_insert = len; RowVector retval (len + a.length ()); retval.insert (*this, 0); retval.insert (a, nc_insert); return retval; } ColumnVector RowVector::transpose (void) const { int len = length (); return ColumnVector (dup (data (), len), len); } RowVector RowVector::extract (int c1, int c2) const { if (c1 > c2) { int tmp = c1; c1 = c2; c2 = tmp; } int new_c = c2 - c1 + 1; RowVector result (new_c); for (int i = 0; i < new_c; i++) result.elem (i) = elem (c1+i); return result; } // row vector by row vector -> row vector operations RowVector& RowVector::operator += (const RowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector += operation attempted"); return *this; } if (len == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! add2 (d, a.data (), len); return *this; } RowVector& RowVector::operator -= (const RowVector& a) { int len = length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector -= operation attempted"); return *this; } if (len == 0) return *this; double *d = fortran_vec (); // Ensures only one reference to my privates! subtract2 (d, a.data (), len); return *this; } // row vector by scalar -> row vector operations ComplexRowVector operator + (const RowVector& v, const Complex& s) { int len = v.length (); return ComplexRowVector (add (v.data (), len, s), len); } ComplexRowVector operator - (const RowVector& v, const Complex& s) { int len = v.length (); return ComplexRowVector (subtract (v.data (), len, s), len); } ComplexRowVector operator * (const RowVector& v, const Complex& s) { int len = v.length (); return ComplexRowVector (multiply (v.data (), len, s), len); } ComplexRowVector operator / (const RowVector& v, const Complex& s) { int len = v.length (); return ComplexRowVector (divide (v.data (), len, s), len); } // scalar by row vector -> row vector operations ComplexRowVector operator + (const Complex& s, const RowVector& a) { return ComplexRowVector (); } ComplexRowVector operator - (const Complex& s, const RowVector& a) { return ComplexRowVector (); } ComplexRowVector operator * (const Complex& s, const RowVector& a) { return ComplexRowVector (); } ComplexRowVector operator / (const Complex& s, const RowVector& a) { return ComplexRowVector (); } // row vector by column vector -> scalar double operator * (const RowVector& v, const ColumnVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return 0.0; } int i_one = 1; return F77_FCN (ddot) (&len, v.data (), &i_one, a.data (), &i_one); } Complex operator * (const RowVector& v, const ComplexColumnVector& a) { ComplexRowVector tmp (v); return tmp * a; } // row vector by matrix -> row vector RowVector operator * (const RowVector& v, const Matrix& a) { int len = v.length (); if (a.rows () != len) { (*current_liboctave_error_handler) ("nonconformant vector multiplication attempted"); return RowVector (); } if (len == 0 || a.cols () == 0) return RowVector (0); // Transpose A to form A'*x == (x'*A)' int a_nr = a.rows (); int a_nc = a.cols (); char trans = 'T'; int ld = a_nr; double alpha = 1.0; double beta = 0.0; int i_one = 1; double *y = new double [len]; F77_FCN (dgemv) (&trans, &a_nc, &a_nr, &alpha, a.data (), &ld, v.data (), &i_one, &beta, y, &i_one, 1L); return RowVector (y, len); } ComplexRowVector operator * (const RowVector& v, const ComplexMatrix& a) { ComplexRowVector tmp (v); return tmp * a; } // row vector by row vector -> row vector operations ComplexRowVector operator + (const RowVector& v, const ComplexRowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector addition attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (add (v.data (), a.data (), len), len); } ComplexRowVector operator - (const RowVector& v, const ComplexRowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector subtraction attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (subtract (v.data (), a.data (), len), len); } ComplexRowVector product (const RowVector& v, const ComplexRowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector product attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (multiply (v.data (), a.data (), len), len); } ComplexRowVector quotient (const RowVector& v, const ComplexRowVector& a) { int len = v.length (); if (len != a.length ()) { (*current_liboctave_error_handler) ("nonconformant vector quotient attempted"); return ComplexRowVector (); } if (len == 0) return ComplexRowVector (0); return ComplexRowVector (divide (v.data (), a.data (), len), len); } // other operations RowVector map (d_d_Mapper f, const RowVector& a) { RowVector b (a); b.map (f); return b; } void RowVector::map (d_d_Mapper f) { for (int i = 0; i < length (); i++) elem (i) = f (elem (i)); } double RowVector::min (void) const { int len = length (); if (len == 0) return 0; double res = elem (0); for (int i = 1; i < len; i++) if (elem (i) < res) res = elem (i); return res; } double RowVector::max (void) const { int len = length (); if (len == 0) return 0; double res = elem (0); for (int i = 1; i < len; i++) if (elem (i) > res) res = elem (i); return res; } ostream& operator << (ostream& os, const RowVector& a) { // int field_width = os.precision () + 7; for (int i = 0; i < a.length (); i++) os << " " /* setw (field_width) */ << a.elem (i); return os; } istream& operator >> (istream& is, RowVector& a) { int len = a.length(); if (len < 1) is.clear (ios::badbit); else { double tmp; for (int i = 0; i < len; i++) { is >> tmp; if (is) a.elem (i) = tmp; else break; } } return is; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleAEPBAL.cc100666 415 17 4131 5702420321 15163 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleAEPBAL.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgebal) (const char*, const int*, double*, const int*, int*, int*, double*, int*, long, long); int F77_FCN (dgebak) (const char*, const char*, const int*, const int*, const int*, double*, const int*, double*, const int*, int*, long, long); } int AEPBALANCE::init (const Matrix& a, const char *balance_job) { int a_nc = a.cols (); if (a.rows () != a_nc) { (*current_liboctave_error_handler) ("AEPBALANCE requires square matrix"); return -1; } int n = a_nc; // Parameters for balance call. int info; int ilo; int ihi; double *scale = new double [n]; // Copy matrix into local structure. balanced_mat = a; F77_FCN (dgebal) (balance_job, &n, balanced_mat.fortran_vec (), &n, &ilo, &ihi, scale, &info, 1L, 1L); // Initialize balancing matrix to identity. balancing_mat = Matrix (n, n, 0.0); for (int i = 0; i < n; i++) balancing_mat.elem (i ,i) = 1.0; F77_FCN (dgebak) (balance_job, "R", &n, &ilo, &ihi, scale, &n, balancing_mat.fortran_vec (), &n, &info, 1L, 1L); delete [] scale; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleCHOL.cc100666 415 17 3351 5702420321 14767 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleCHOL.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dpotrf) (const char*, const int*, double*, const int*, int*, long); } int CHOL::init (const Matrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("CHOL requires square matrix"); return -1; } char uplo = 'U'; int n = a_nc; int info; double *h = dup (a.data (), a.length ()); F77_FCN (dpotrf) (&uplo, &n, h, &n, &info, 1L); chol_mat = Matrix (h, n, n); // If someone thinks of a more graceful way of doing this (or faster for // that matter :-)), please let me know! if (n > 1) for (int j = 0; j < a_nc; j++) for (int i = j+1; i < a_nr; i++) chol_mat.elem (i, j) = 0.0; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleDET.cc100666 415 17 2535 5702420320 14660 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "dbleDET.h" int DET::value_will_overflow (void) const { return det[2] + 1 > log10 (DBL_MAX) ? 1 : 0; } int DET::value_will_underflow (void) const { return det[2] - 1 < log10 (DBL_MIN) ? 1 : 0; } double DET::coefficient (void) const { return det[0]; } int DET::exponent (void) const { return (int) det[1]; } double DET::value (void) const { return det[0] * pow (10.0, det[1]); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleGEPBAL.cc100666 415 17 11347 5702420320 15217 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "dbleGEPBAL.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgebak) (const char*, const char*, const int*, const int*, const int*, double*, const int*, double*, const int*, int*, long, long); int F77_FCN (reduce) (const int*, const int*, double*, const int*, double*, int*, int*, double*, double*); int F77_FCN (scaleg) (const int*, const int*, double*, const int*, double*, const int*, const int*, double*, double*, double*); int F77_FCN (gradeq) (const int*, const int*, double*, const int*, double*, int*, int*, double*, double*); } int GEPBALANCE::init (const Matrix& a, const Matrix& b, const char *balance_job) { int a_nr = a.rows (); int a_nc = a.cols (); int b_nr = b.rows (); if (a_nr != a_nc || a_nr != b_nr || b_nr != b.cols ()) { (*current_liboctave_error_handler) ("GEPBALANCE requires square matrices of the same size"); return -1; } int n = a_nc; // Parameters for balance call. int info; int ilo; int ihi; double *cscale = new double [n]; double *cperm = new double [n]; Matrix wk (n, 6, 0.0); // Back out the permutations: // // cscale contains the exponents of the column scaling factors in its // ilo through ihi locations and the reducing column permutations in // its first ilo-1 and its ihi+1 through n locations. // // cperm contains the column permutations applied in grading the a and b // submatrices in its ilo through ihi locations. // // wk contains the exponents of the row scaling factors in its ilo // through ihi locations, the reducing row permutations in its first // ilo-1 and its ihi+1 through n locations, and the row permutations // applied in grading the a and b submatrices in its n+ilo through // n+ihi locations. // Copy matrices into local structure. balanced_a_mat = a; balanced_b_mat = b; // Initialize balancing matrices to identity. left_balancing_mat = Matrix (n, n, 0.0); for (int i = 0; i < n; i++) left_balancing_mat (i, i) = 1.0; right_balancing_mat = left_balancing_mat; // Check for permutation option. if (*balance_job == 'P' || *balance_job == 'B') { F77_FCN (reduce) (&n, &n, balanced_a_mat.fortran_vec (), &n, balanced_b_mat.fortran_vec (), &ilo, &ihi, cscale, wk.fortran_vec ()); } else { // Set up for scaling later. ilo = 1; ihi = n; } // Check for scaling option. if ((*balance_job == 'S' || *balance_job == 'B') && ilo != ihi) { F77_FCN (scaleg) (&n, &n, balanced_a_mat.fortran_vec (), &n, balanced_b_mat.fortran_vec (), &ilo, &ihi, cscale, cperm, wk.fortran_vec ()); } else { // Set scaling data to 0's. for (int tmp = ilo-1; tmp < ihi; tmp++) { cscale[tmp] = 0.0; wk.elem (tmp, 0) = 0.0; } } // Scaleg returns exponents, not values, so... for (int tmp = ilo-1; tmp < ihi; tmp++) { cscale[tmp] = pow (2.0, cscale[tmp]); wk.elem (tmp, 0) = pow (2.0, -wk.elem (tmp, 0)); } // Column permutations/scaling. F77_FCN (dgebak) (balance_job, "R", &n, &ilo, &ihi, cscale, &n, right_balancing_mat.fortran_vec (), &n, &info, 1L, 1L); // Row permutations/scaling. F77_FCN (dgebak) (balance_job, "L", &n, &ilo, &ihi, &wk.elem (0, 0), &n, left_balancing_mat.fortran_vec (), &n, &info, 1L, 1L); // XXX FIXME XXX --- these four lines need to be added and debugged. // GEPBALANCE::init will work without them, though, so here they are. #if 0 if ((*balance_job == 'P' || *balance_job == 'B') && ilo != ihi) { F77_FCN (gradeq) (&n, &n, balanced_a_mat.fortran_vec (), &n, balanced_b_mat.fortran_vec (), &ilo, &ihi, cperm, &wk.elem (0, 1)); } #endif // Transpose for aa = cc*a*dd convention... left_balancing_mat = left_balancing_mat.transpose (); delete [] cscale; delete [] cperm; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleHESS.cc100666 415 17 6005 5702420320 15002 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleHESS.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgebal) (const char*, const int*, double*, const int*, int*, int*, double*, int*, long, long); int F77_FCN (dgebak) (const char*, const char*, const int*, const int*, const int*, double*, const int*, double*, const int*, int*, long, long); int F77_FCN (dgehrd) (const int*, const int*, const int*, double*, const int*, double*, double*, const int*, int*, long, long); int F77_FCN (dorghr) (const int*, const int*, const int*, double*, const int*, double*, double*, const int*, int*, long, long); } int HESS::init (const Matrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("HESS requires square matrix"); return -1; } char jobbal = 'N'; char side = 'R'; int n = a_nc; int lwork = 32 * n; int info; int ilo; int ihi; double *h = dup (a.data (), a.length ()); double *tau = new double [n+1]; double *scale = new double [n]; double *z = new double [n*n]; double *work = new double [lwork]; F77_FCN (dgebal) (&jobbal, &n, h, &n, &ilo, &ihi, scale, &info, 1L, 1L); F77_FCN (dgehrd) (&n, &ilo, &ihi, h, &n, tau, work, &lwork, &info, 1L, 1L); copy (z, h, n*n); F77_FCN (dorghr) (&n, &ilo, &ihi, z, &n, tau, work, &lwork, &info, 1L, 1L); F77_FCN (dgebak) (&jobbal, &side, &n, &ilo, &ihi, scale, &n, z, &n, &info, 1L, 1L); // We need to clear out all of the area below the sub-diagonal which was used // to store the unitary matrix. hess_mat = Matrix (h, n, n); unitary_hess_mat = Matrix (z, n, n); // If someone thinks of a more graceful way of doing this (or faster for // that matter :-)), please let me know! if (n > 2) for (int j = 0; j < a_nc; j++) for (int i = j+2; i < a_nr; i++) hess_mat.elem (i, j) = 0; delete [] tau; delete [] work; delete [] scale; return info; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleLU.cc100666 415 17 4271 5702420317 14571 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleLU.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgesv) (const int*, const int*, double*, const int*, int*, double*, const int*, int*); } LU::LU (const Matrix& a) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr == 0 || a_nc == 0 || a_nr != a_nc) { (*current_liboctave_error_handler) ("LU requires square matrix"); return; } int n = a_nr; int *ipvt = new int [n]; int *pvt = new int [n]; double *tmp_data = dup (a.data (), a.length ()); int info = 0; int zero = 0; double b; F77_FCN (dgesv) (&n, &zero, tmp_data, &n, ipvt, &b, &n, &info); Matrix A_fact (tmp_data, n, n); int i; for (i = 0; i < n; i++) { ipvt[i] -= 1; pvt[i] = i; } for (i = 0; i < n - 1; i++) { int k = ipvt[i]; if (k != i) { int tmp = pvt[k]; pvt[k] = pvt[i]; pvt[i] = tmp; } } l.resize (n, n, 0.0); u.resize (n, n, 0.0); p.resize (n, n, 0.0); for (i = 0; i < n; i++) { p.elem (i, pvt[i]) = 1.0; int j; l.elem (i, i) = 1.0; for (j = 0; j < i; j++) l.elem (i, j) = A_fact.elem (i, j); for (j = i; j < n; j++) u.elem (i, j) = A_fact.elem (i, j); } delete [] ipvt; delete [] pvt; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleQR.cc100666 415 17 5330 5702420317 14570 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleQR.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgeqrf) (const int*, const int*, double*, const int*, double*, double*, const int*, int*); int F77_FCN (dorgqr) (const int*, const int*, const int*, double*, const int*, double*, double*, const int*, int*); int F77_FCN (dgeqpf) (const int*, const int*, double*, const int*, int*, double*, double*, int*); } QR::QR (const Matrix& a, QR::type qr_type) { int m = a.rows (); int n = a.cols (); if (m == 0 || n == 0) { (*current_liboctave_error_handler) ("QR must have non-empty matrix"); return; } double *tmp_data; int min_mn = m < n ? m : n; double *tau = new double[min_mn]; int lwork = 32*n; double *work = new double[lwork]; int info = 0; if (m > n) { tmp_data = new double [m*m]; copy (tmp_data, a.data (), a.length ()); } else tmp_data = dup (a.data (), a.length ()); F77_FCN (dgeqrf) (&m, &n, tmp_data, &m, tau, work, &lwork, &info); delete [] work; if (qr_type == QR::raw) { for (int j = 0; j < min_mn; j++) { int limit = j < min_mn - 1 ? j : min_mn - 1; for (int i = limit + 1; i < m; i++) tmp_data[m*j+i] *= tau[j]; } } else { int n2; if (qr_type == QR::economy && m > n) { n2 = n; r.resize (n, n, 0.0); } else { n2 = m; r.resize (m, n, 0.0); } for (int j = 0; j < n; j++) { int limit = j < min_mn-1 ? j : min_mn-1; for (int i = 0; i <= limit; i++) r.elem (i, j) = tmp_data[m*j+i]; } lwork = 32*m; work = new double[lwork]; F77_FCN (dorgqr) (&m, &m, &min_mn, tmp_data, &m, tau, work, &lwork, &info); q = Matrix (tmp_data, m, m); q.resize (m, n2); delete [] tau; delete [] work; } } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleQRP.cc100666 415 17 5770 5702420316 14717 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "dbleQRP.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgeqpf) (const int*, const int*, double*, const int*, int*, double*, double*, int*); int F77_FCN (dorgqr) (const int*, const int*, const int*, double*, const int*, double*, double*, const int*, int*); } // It would be best to share some of this code with QR class... QRP::QRP (const Matrix& a, QR::type qr_type) { assert (qr_type != QR::raw); int m = a.rows (); int n = a.cols (); if (m == 0 || n == 0) { (*current_liboctave_error_handler) ("QR must have non-empty matrix"); return; } double *tmp_data; int min_mn = m < n ? m : n; double *tau = new double[min_mn]; int lwork = 3*n; double *work = new double[lwork]; int info = 0; if (m > n) { tmp_data = new double [m*m]; copy (tmp_data, a.data (), a.length ()); } else tmp_data = dup (a.data (), a.length ()); int *jpvt = new int[n]; // Clear Pivot vector (code to enforce a certain permutation would go // here...) for (int i = 0; i < n; i++) jpvt[i] = 0; F77_FCN (dgeqpf) (&m, &n, tmp_data, &m, jpvt, tau, work, &info); // Form Permutation matrix (if economy is requested, return the // indices only!) if (qr_type == QR::economy && m > n) { p.resize (1, n, 0.0); for (int j = 0; j < n; j++) p.elem (0, j) = jpvt[j]; } else { p.resize (n, n, 0.0); for (int j = 0; j < n; j++) p.elem (jpvt[j]-1, j) = 1.0; } delete [] jpvt; delete [] work; int n2; if (qr_type == QR::economy && m > n) { n2 = n; r.resize (n, n, 0.0); } else { n2 = m; r.resize (m, n, 0.0); } for (int j = 0; j < n; j++) { int limit = j < min_mn-1 ? j : min_mn-1; for (int i = 0; i <= limit; i++) r.elem (i, j) = tmp_data[m*j+i]; } lwork = 32*m; work = new double[lwork]; F77_FCN (dorgqr) (&m, &m, &min_mn, tmp_data, &m, tau, work, &lwork, &info); q = Matrix (tmp_data, m, m); q.resize (m, n2); delete [] tau; delete [] work; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleSCHUR.cc100666 415 17 6376 5702420316 15144 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleSCHUR.h" #include "mx-inlines.cc" #include "lo-error.h" #include "f77-uscore.h" extern "C" { int F77_FCN (dgeesx) (const char*, const char*, int (*)(double*, double*), const char*, const int*, double*, const int*, int*, double*, double*, double*, const int*, double*, double*, double*, const int*, int*, const int*, int*, int*, long, long); } static int select_ana (double *a, double *b) { return (*a < 0.0); } static int select_dig (double *a, double *b) { return (hypot (*a, *b) < 1.0); } int SCHUR::init (const Matrix& a, const char *ord) { int a_nr = a.rows (); int a_nc = a.cols (); if (a_nr != a_nc) { (*current_liboctave_error_handler) ("SCHUR requires square matrix"); return -1; } char jobvs = 'V'; char sort; if (*ord == 'A' || *ord == 'D' || *ord == 'a' || *ord == 'd') sort = 'S'; else sort = 'N'; char sense = 'N'; int n = a_nc; int lwork = 8 * n; int liwork = 1; int info; int sdim; double rconde; double rcondv; double *s = dup (a.data (), a.length ()); double *wr = new double [n]; double *wi = new double [n]; double *q = new double [n*n]; double *work = new double [lwork]; // These are not referenced for the non-ordered Schur routine. int *iwork = 0; int *bwork = 0; if (*ord == 'A' || *ord == 'D' || *ord == 'a' || *ord == 'd') { iwork = new int [liwork]; bwork = new int [n]; } if (*ord == 'A' || *ord == 'a') { F77_FCN (dgeesx) (&jobvs, &sort, select_ana, &sense, &n, s, &n, &sdim, wr, wi, q, &n, &rconde, &rcondv, work, &lwork, iwork, &liwork, bwork, &info, 1L, 1L); } else if (*ord == 'D' || *ord == 'd') { F77_FCN (dgeesx) (&jobvs, &sort, select_dig, &sense, &n, s, &n, &sdim, wr, wi, q, &n, &rconde, &rcondv, work, &lwork, iwork, &liwork, bwork, &info, 1L, 1L); } else { F77_FCN (dgeesx) (&jobvs, &sort, (void *) 0, &sense, &n, s, &n, &sdim, wr, wi, q, &n, &rconde, &rcondv, work, &lwork, iwork, &liwork, bwork, &info, 1L, 1L); } schur_mat = Matrix (s, n, n); unitary_mat = Matrix (q, n, n); delete [] wr; delete [] wi; delete [] work; delete [] iwork; delete [] bwork; return info; } ostream& operator << (ostream& os, const SCHUR& a) { os << a.schur_matrix () << "\n"; os << a.unitary_matrix () << "\n"; return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleSVD.cc100666 415 17 4615 5702420315 14705 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleSVD.h" #include "mx-inlines.cc" #include "f77-uscore.h" extern "C" { int F77_FCN (dgesvd) (const char*, const char*, const int*, const int*, double*, const int*, double*, double*, const int*, double*, const int*, double*, const int*, int*, long, long); } int SVD::init (const Matrix& a, SVD::type svd_type) { int info; int m = a.rows (); int n = a.cols (); double *tmp_data = dup (a.data (), a.length ()); int min_mn = m < n ? m : n; int max_mn = m > n ? m : n; char jobu = 'A'; char jobv = 'A'; int ncol_u = m; int nrow_vt = n; int nrow_s = m; int ncol_s = n; if (svd_type == SVD::economy) { jobu = jobv = 'S'; ncol_u = nrow_vt = nrow_s = ncol_s = min_mn; } double *u = new double[m * ncol_u]; double *s_vec = new double[min_mn]; double *vt = new double[nrow_vt * n]; int tmp1 = 3*min_mn + max_mn; int tmp2 = 5*min_mn - 4; int lwork = tmp1 > tmp2 ? tmp1 : tmp2; double *work = new double[lwork]; F77_FCN (dgesvd) (&jobu, &jobv, &m, &n, tmp_data, &m, s_vec, u, &m, vt, &nrow_vt, work, &lwork, &info, 1L, 1L); left_sm = Matrix (u, m, ncol_u); sigma = DiagMatrix (s_vec, nrow_s, ncol_s); Matrix vt_m (vt, nrow_vt, n); right_sm = vt_m.transpose (); delete [] tmp_data; delete [] work; return info; } ostream& operator << (ostream& os, const SVD& a) { os << a.left_singular_matrix () << "\n"; os << a.singular_values () << "\n"; os << a.right_singular_matrix () << "\n"; return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Bounds.h100666 415 17 4040 5702420313 14504 0ustar jweusers// Bounds.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Bounds_h) #define octave_Bounds_h 1 class ostream; #include "dColVector.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class Bounds { public: Bounds (void); Bounds (int n); Bounds (const Vector lb, const Vector ub); Bounds (const Bounds& a); Bounds& operator = (const Bounds& a); Bounds& resize (int n); double lower_bound (int index) const; double upper_bound (int index) const; Vector lower_bounds (void) const; Vector upper_bounds (void) const; int size (void) const; Bounds& set_bound (int index, double low, double high); Bounds& set_bounds (double low, double high); Bounds& set_bounds (const Vector lb, const Vector ub); Bounds& set_lower_bound (int index, double low); Bounds& set_upper_bound (int index, double high); Bounds& set_lower_bounds (double low); Bounds& set_upper_bounds (double high); Bounds& set_lower_bounds (const Vector lb); Bounds& set_upper_bounds (const Vector ub); friend ostream& operator << (ostream& os, const Bounds& b); protected: Vector lb; Vector ub; int nb; private: void error (const char *msg); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CollocWt.h100666 415 17 6615 5702420305 15013 0ustar jweusers// CollocWt.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_CollocWt_h) #define octave_CollocWt_h 1 class ostream; #include "dMatrix.h" #include "dColVector.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class CollocWt { public: CollocWt (void); CollocWt (int ncol, int include_left, int include_right); CollocWt (int ncol, int include_left, int include_right, double left, double right); CollocWt (int ncol, double alpha, double beta, int include_left, int include_right); CollocWt (int ncol, double alpha, double beta, int include_left, int include_right, double left, double right); CollocWt (const CollocWt&); CollocWt& operator = (const CollocWt&); CollocWt& resize (int ncol); CollocWt& add_left (void); CollocWt& delete_left (void); CollocWt& set_left (double val); CollocWt& add_right (void); CollocWt& delete_right (void); CollocWt& set_right (double val); CollocWt& set_alpha (double val); CollocWt& set_beta (double val); int ncol (void) const; int left_included (void) const; int right_included (void) const; double left (void) const; double right (void) const; double width (void) const; double alpha (void) const; double beta (void) const; Vector roots (void); Vector quad (void); Vector quad_weights (void); Matrix first (void); Matrix second (void); friend ostream& operator << (ostream&, const CollocWt&); protected: int n; int nt; int inc_left; int inc_right; double lb; double rb; double Alpha; double Beta; Vector r; Vector q; Matrix A; Matrix B; int initialized; void init (void); void error (const char *msg); }; inline int CollocWt::ncol (void) const { return n; } inline int CollocWt::left_included (void) const { return inc_left; } inline int CollocWt::right_included (void) const { return inc_right; } inline double CollocWt::left (void) const { return lb; } inline double CollocWt::right (void) const { return rb; } inline double CollocWt::width (void) const { return rb - lb; } inline double CollocWt::alpha (void) const { return Alpha; } inline double CollocWt::beta (void) const { return Beta; } inline Vector CollocWt::roots (void) { if (!initialized) init (); return r; } inline Vector CollocWt::quad (void) { if (!initialized) init (); return q; } inline Vector CollocWt::quad_weights (void) { return quad (); } inline Matrix CollocWt::first (void) { if (!initialized) init (); return A; } inline Matrix CollocWt::second (void) { if (!initialized) init (); return B; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/DAE.h100666 415 17 4211 5702420305 13644 0ustar jweusers// DAE.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_DAE_h) #define octave_DAE_h 1 #include "dColVector.h" #include "ODE.h" #include "DAEFunc.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class DAE : public ODE, public DAEFunc { public: DAE (void); DAE (int); DAE (const Vector& x, double time, DAEFunc& f); DAE (const Vector& x, const Vector& xdot, double time, DAEFunc& f); ~DAE (void); Vector deriv (void); virtual void initialize (const Vector& x, double t); virtual void initialize (const Vector& x, const Vector& xdot, double t); Vector integrate (double t); Matrix integrate (const Vector& tout, Matrix& xdot_out); Matrix integrate (const Vector& tout, Matrix& xdot_out, const Vector& tcrit); protected: /* * Some of this is probably too closely related to DASSL, but hey, * this is just a first attempt... */ Vector xdot; private: int integration_error; int restart; int liw; int lrw; int idid; int *info; int *iwork; double *rwork; friend int ddassl_j (double *time, double *state, double *deriv, double *pd, double *cj, double *rpar, int *ipar); friend int ddassl_f (double *time, double *state, double *deriv, double *delta, int *ires, double *rpar, int *ipar); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/DAEFunc.h100666 415 17 3434 5702420305 14466 0ustar jweusers// DAEFunc.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_DAEFunc_h) #define octave_DAEFunc_h 1 class Matrix; class ColumnVector; extern "C++" { #ifndef Vector #define Vector ColumnVector #endif #if !defined (octave_DAEFunc_typedefs) #define octave_DAEFunc_typedefs 1 #endif class DAEFunc { public: struct DAEJac { Matrix *dfdxdot; Matrix *dfdx; }; typedef Vector (*DAERHSFunc) (const Vector& x, const Vector& xdot, double); typedef DAEJac (*DAEJacFunc) (const Vector& x, const Vector& xdot, double); DAEFunc (void); DAEFunc (DAERHSFunc f); DAEFunc (DAERHSFunc f, DAEJacFunc j); DAEFunc (const DAEFunc& a); DAEFunc& operator = (const DAEFunc& a); DAERHSFunc function (void) const; DAEFunc& set_function (DAERHSFunc f); DAEJacFunc jacobian_function (void) const; DAEFunc& set_jacobian_function (DAEJacFunc f); protected: DAERHSFunc fun; DAEJacFunc jac; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/FEGrid.h100666 415 17 4014 5702420304 14353 0ustar jweusers// FEGrid.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_FEGrid_h) #define octave_FEGrid_h 1 class ostream; #include "dColVector.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class FEGrid { public: FEGrid (void); FEGrid (const Vector& elbnds); FEGrid (int nel, double width); FEGrid (int nel, double left, double right); int in_bounds (double x) const; int element (double x) const; double left (void) const; double right (void) const; Vector element_boundaries (void) const; friend ostream& operator << (ostream&, const FEGrid&); protected: Vector elem; private: void error (const char* msg) const; void nel_error (void) const; void check_grid (void) const; }; inline FEGrid::FEGrid (void) {} inline FEGrid::FEGrid (const Vector& elbnds) { elem = elbnds; check_grid (); } inline int FEGrid::in_bounds (double x) const { return (x >= left () && x <= right ()); } inline double FEGrid::left (void) const { return elem.elem (0); } inline double FEGrid::right (void) const { return elem.elem (elem.capacity () - 1); } inline Vector FEGrid::element_boundaries (void) const { return elem; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/FSQP.h100666 415 17 2212 5702420303 14021 0ustar jweusers// FSQP.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_FSQP_h) #define octave_FSQP_h 1 #ifndef FSQP_MISSING #include "NLP.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class FSQP : public NLP { public: private: }; } // extern "C++" #endif /* FSQP_MISSING */ #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LinConst.h100666 415 17 5605 5702420302 15011 0ustar jweusers// LinConst.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_LinConst_h) #define octave_LinConst_h 1 class ostream; class ColumnVector; #include #include "dMatrix.h" #include "Bounds.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class LinConst : public Bounds { public: LinConst (void); LinConst (int nclin, int nx); LinConst (int nclin_eq, int nclin_ineq, int nx); LinConst (const Vector& lb, const Matrix& A, const Vector& ub); LinConst (const Matrix& A_eq, const Vector& b_eq, const Matrix& A_ineq, const Vector& b_ineq); LinConst (const LinConst& a); LinConst& operator = (const LinConst& a); LinConst& resize (int nclin, int n); Matrix constraint_matrix (void) const; LinConst& set_constraint_matrix (const Matrix& A); Matrix eq_constraint_matrix (void) const; Matrix ineq_constraint_matrix (void) const; Vector eq_constraint_vector (void) const; Vector ineq_constraint_vector (void) const; friend ostream& operator << (ostream& os, const LinConst& b); protected: Matrix A; private: void error (const char *msg); }; inline LinConst::LinConst (void) : Bounds () {} inline LinConst::LinConst (int nc, int n) : Bounds (nc), A (nb, n) {} inline LinConst::LinConst (int eq, int ineq, int n) : Bounds (eq+ineq), A (nb, n) {} inline LinConst::LinConst (const Vector& l, const Matrix& amat, const Vector& u) : Bounds (l, u), A (amat) { if (nb != amat.rows ()) error ("inconsistent sizes for constraint matrix and bounds vectors"); } inline LinConst::LinConst (const LinConst& a) : Bounds (a.lb, a.ub), A (a.constraint_matrix ()) {} inline LinConst& LinConst::operator = (const LinConst& a) { nb = a.nb; lb = a.lb; A = a.A; ub = a.ub; return *this; } inline Matrix LinConst::constraint_matrix (void) const { return A; } inline LinConst& LinConst::set_constraint_matrix (const Matrix& amat) { if (lb.capacity () != amat.rows ()) error ("inconsistent size for new linear constraint matrix"); A = amat; return *this; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LP.h100666 415 17 3073 5702420303 13571 0ustar jweusers// LP.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_LP_h) #define octave_LP_h 1 #include "dColVector.h" #include "Bounds.h" #include "LinConst.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class LP { public: LP (void); LP (const Vector& c); LP (const Vector& c, const Bounds& b); LP (const Vector& c, const Bounds& b, const LinConst& lc); LP (const Vector& c, const LinConst& lc); virtual Vector minimize (void); virtual Vector minimize (double& objf); virtual Vector minimize (double& objf, int& inform); virtual Vector minimize (double& objf, int& inform, Vector& lambda) = 0; protected: Vector c; Bounds bnds; LinConst lc; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/LPsolve.h100666 415 17 3216 5702420303 14641 0ustar jweusers// LPsolve.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_LPsolve_h) #define octave_LPsolve_h 1 class ColumnVector; #include "LP.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class LPsolve : public LP { public: LPsolve (void) : LP () { set_default_options (); } LPsolve (const Vector& c) : LP (c) { set_default_options (); } LPsolve (const Vector& c, const Bounds& b) : LP (c, b) { set_default_options (); } LPsolve (const Vector& c, const Bounds& b, const LinConst& lc) : LP (c, b, lc) { set_default_options (); } LPsolve (const Vector& c, const LinConst& lc) : LP (c, lc) { set_default_options (); } virtual Vector minimize (double& objf, int& inform, Vector& lambda); private: void set_default_options (void); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLConst.h100666 415 17 2561 5702420301 14575 0ustar jweusers// NLConst.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_NLConst_h) #define octave_NLConst_h 1 class ColumnVector; #include "Bounds.h" #include "NLFunc.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class NLConst : public Bounds, public NLFunc { public: NLConst (void); NLConst (int n); NLConst (const Vector& lb, const NLFunc f, const Vector& ub); NLConst (const NLConst& a); NLConst& operator = (const NLConst& a); private: void error (const char *msg); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLEqn.h100666 415 17 3657 5702420277 14255 0ustar jweusers// NLEqn.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_NLEqn_h) #define octave_NLEqn_h 1 #include "dColVector.h" #include "NLFunc.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class NLEqn_options { public: NLEqn_options (void); NLEqn_options (const NLEqn_options& opt); NLEqn_options& operator = (const NLEqn_options& opt); ~NLEqn_options (void); void init (void); void copy (const NLEqn_options& opt); void set_default_options (void); void set_tolerance (double); double tolerance (void); private: double x_tolerance; }; class NLEqn : public NLFunc, public NLEqn_options { public: NLEqn (void); NLEqn (const Vector&, const NLFunc); NLEqn (const NLEqn &); NLEqn& operator = (const NLEqn& a); void resize (int); void set_states (const Vector&); Vector states (void) const; int size (void) const; Vector solve (void); Vector solve (const Vector&); Vector solve (int& info); Vector solve (const Vector&, int& info); private: int n; Vector x; void error (const char* msg); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLFunc.h100666 415 17 3140 5702420277 14410 0ustar jweusers// NLFunc.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_NLFunc_h) #define octave_NLFunc_h 1 class ColumnVector; class Matrix; extern "C++" { #ifndef Vector #define Vector ColumnVector #endif typedef Vector (*nonlinear_fcn) (const Vector&); typedef Matrix (*jacobian_fcn) (const Vector&); class NLFunc { public: NLFunc (void); NLFunc (const nonlinear_fcn); NLFunc (const nonlinear_fcn, const jacobian_fcn); NLFunc (const NLFunc& a); NLFunc& operator = (const NLFunc& a); nonlinear_fcn function (void) const; NLFunc& set_function (const nonlinear_fcn f); jacobian_fcn jacobian_function (void) const; NLFunc& set_jacobian_function (const jacobian_fcn j); protected: nonlinear_fcn fun; jacobian_fcn jac; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NLP.h100666 415 17 6372 5702420276 13725 0ustar jweusers// NLP.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_NLP_h) #define octave_NLP_h 1 #include "dColVector.h" #include "Objective.h" #include "Bounds.h" #include "LinConst.h" #include "NLConst.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class NLP { public: NLP (void); NLP (const Vector& x, const Objective& phi); NLP (const Vector& x, const Objective& phi, const Bounds& b); NLP (const Vector& x, const Objective& phi, const Bounds& b, const LinConst& lc); NLP (const Vector& x, const Objective& phi, const Bounds& b, const LinConst& lc, const NLConst& nlc); NLP (const Vector& x, const Objective& phi, const LinConst& lc); NLP (const Vector& x, const Objective& phi, const LinConst& lc, const NLConst& nlc); NLP (const Vector& x, const Objective& phi, const NLConst& nlc); NLP (const Vector& x, const Objective& phi, const Bounds& b, const NLConst& nlc); ~NLP (void); NLP& operator = (const NLP& a); int size (void) const; protected: Vector x; Objective phi; Bounds bnds; LinConst lc; NLConst nlc; }; inline NLP::NLP (void) {} inline NLP::NLP (const Vector& xx, const Objective& obj) : x (xx), phi (obj) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const Bounds& b) : x (xx), phi (obj), bnds (b) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const Bounds& b, const LinConst& l) : x (xx), phi (obj), bnds (b), lc (l) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const Bounds& b, const LinConst& l, const NLConst& nl) : x (xx), phi (obj), bnds (b), lc (l), nlc (nl) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const LinConst& l) : x (xx), phi (obj), lc (l) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const LinConst& l, const NLConst& nl) : x (xx), phi (obj), lc (l), nlc (nl) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const NLConst& nl) : x (xx), phi (obj), nlc (nl) {} inline NLP::NLP (const Vector& xx, const Objective& obj, const Bounds& b, const NLConst& nl) : x (xx), phi (obj), bnds (b), nlc (nl) {} inline NLP::~NLP (void) { } inline NLP& NLP::operator = (const NLP& a) { if (this != &a) { x = a.x; phi = a.phi; bnds = a.bnds; lc = a.lc; nlc = a.nlc; } return *this; } inline int NLP::size (void) const { return x.capacity (); } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/NPSOL.h100666 415 17 13052 5702420276 14200 0ustar jweusers// NPSOL.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_NPSOL_h) #define octave_NPSOL_h 1 #ifndef NPSOL_MISSING #include "dColVector.h" #include "NLP.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class NPSOL_options { public: NPSOL_options (void); NPSOL_options (const NPSOL_options& opt); NPSOL_options& operator = (const NPSOL_options& opt); ~NPSOL_options (void); void init (void); void copy (const NPSOL_options& opt); void set_default_options (void); void set_central_difference_interval (double val); void set_crash_tolerance (double val); void set_difference_interval (double val); void set_function_precision (double val); void set_infinite_bound (double val); void set_infinite_step (double val); void set_linear_feasibility_tolerance (double val); void set_linesearch_tolerance (double val); void set_nonlinear_feasibility_tolerance (double val); void set_optimality_tolerance (double val); void set_derivative_level (int val); void set_major_iteration_limit (int val); void set_minor_iteration_limit (int val); void set_major_print_level (int val); void set_minor_print_level (int val); void set_start_objective_check (int val); void set_start_constraint_check (int val); void set_stop_objective_check (int val); void set_stop_constraint_check (int val); void set_verify_level (int val); double central_difference_interval (void) const; double crash_tolerance (void) const; double difference_interval (void) const; double function_precision (void) const; double infinite_bound (void) const; double infinite_step (void) const; double linear_feasibility_tolerance (void) const; double linesearch_tolerance (void) const; double nonlinear_feasibility_tolerance (void) const; double optimality_tolerance (void) const; int derivative_level (void) const; int major_iteration_limit (void) const; int minor_iteration_limit (void) const; int major_print_level (void) const; int minor_print_level (void) const; int start_objective_check (void) const; int start_constraint_check (void) const; int stop_objective_check (void) const; int stop_constraint_check (void) const; int verify_level (void) const; protected: void pass_options_to_npsol (void); void set_option (const char *key, int opt); void set_option (const char *key, double opt); private: double x_central_difference_interval; double x_crash_tolerance; double x_difference_interval; double x_function_precision; double x_infinite_bound; double x_infinite_step; double x_linear_feasibility_tolerance; double x_linesearch_tolerance; double x_nonlinear_feasibility_tolerance; double x_optimality_tolerance; int x_derivative_level; int x_major_iteration_limit; int x_minor_iteration_limit; int x_major_print_level; int x_minor_print_level; int x_start_objective_check; int x_start_constraint_check; int x_stop_objective_check; int x_stop_constraint_check; int x_verify_level; }; class NPSOL : public NLP, public NPSOL_options { public: NPSOL (void) : NLP () { } NPSOL (const Vector& x, const Objective& phi) : NLP (x, phi) { } NPSOL (const Vector& x, const Objective& phi, const Bounds& b) : NLP (x, phi, b) { } NPSOL (const Vector& x, const Objective& phi, const Bounds& b, const LinConst& lc) : NLP (x, phi, b, lc) { } NPSOL (const Vector& x, const Objective& phi, const Bounds& b, const LinConst& lc, const NLConst& nlc) : NLP (x, phi, b, lc, nlc) { } NPSOL (const Vector& x, const Objective& phi, const LinConst& lc) : NLP (x, phi, lc) { } NPSOL (const Vector& x, const Objective& phi, const LinConst& lc, const NLConst& nlc) : NLP (x, phi, lc, nlc) { } NPSOL (const Vector& x, const Objective& phi, const NLConst& nlc) : NLP (x, phi, nlc) { } NPSOL (const Vector& x, const Objective& phi, const Bounds& b, const NLConst& nlc) : NLP (x, phi, b, nlc) { } NPSOL (const NPSOL& a); Vector minimize (void); Vector minimize (double& objf); Vector minimize (double& objf, int& inform); Vector minimize (double& objf, int& inform, Vector& lambda); Vector minimize (const Vector& x); Vector minimize (const Vector& x, double& objf); Vector minimize (const Vector& x, double& objf, int& inform); Vector minimize (const Vector& x, double& objf, int& inform, Vector& lambda); NPSOL& option (char *s); private: }; // XXX FIXME XXX -- would be nice to not have to have this global // variable. // Nonzero means an error occurred in the calculation of the objective // function, and the user wants us to quit. extern int npsol_objective_error; inline NPSOL::NPSOL (const NPSOL& a) : NLP (a.x, a.phi, a.bnds, a.lc, a.nlc) { } } // extern "C++" #endif /* NPSOL_MISSING */ #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/ODE.h100666 415 17 6106 5702420275 13675 0ustar jweusers// ODE.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ODE_h) #define octave_ODE_h 1 class ostream; #include "dMatrix.h" #include "dColVector.h" #include "ODEFunc.h" extern "C++" { class ODE_options { public: ODE_options (void); ODE_options (const ODE_options& opt); ODE_options& operator = (const ODE_options& opt); ~ODE_options (void); void init (void); void copy (const ODE_options& opt); void set_default_options (void); void set_absolute_tolerance (double); void set_initial_step_size (double); void set_maximum_step_size (double); void set_minimum_step_size (double); void set_relative_tolerance (double); double absolute_tolerance (void); double initial_step_size (void); double maximum_step_size (void); double minimum_step_size (void); double relative_tolerance (void); private: double x_absolute_tolerance; double x_initial_step_size; double x_maximum_step_size; double x_minimum_step_size; double x_relative_tolerance; }; class ODE : public ODEFunc, public ODE_options { public: ODE (void); ODE (int n); ODE (const ColumnVector& state, double time, const ODEFunc& f); virtual ~ODE (void); virtual int size (void) const; virtual ColumnVector state (void) const; virtual double time (void) const; virtual void force_restart (void); virtual void initialize (const ColumnVector& x, double t); virtual void set_stop_time (double t); virtual void clear_stop_time (void); virtual ColumnVector integrate (double t); void integrate (int nsteps, double tstep, ostream& s); Matrix integrate (const ColumnVector& tout); Matrix integrate (const ColumnVector& tout, const ColumnVector& tcrit); protected: /* * Some of this is probably too closely related to LSODE, but hey, * this is just a first attempt... */ int n; double t; ColumnVector x; double stop_time; int stop_time_set; private: int integration_error; int restart; int method_flag; int *iwork; double *rwork; int istate; int itol; int itask; int iopt; int liw; int lrw; friend int lsode_f (int *neq, double *t, double *y, double *ydot); friend int lsode_j (int *neq, double *t, double *y, int *ml, int *mu, double *pd, int *nrowpd); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/ODEFunc.h100666 415 17 3113 5702420275 14504 0ustar jweusers// ODEFunc.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ODEFunc_h) #define octave_ODEFunc_h 1 class Matrix; class ColumnVector; extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class ODEFunc { public: typedef Vector (*ODERHSFunc) (const Vector&, double); typedef Matrix (*ODEJacFunc) (const Vector&, double); ODEFunc (void); ODEFunc (ODERHSFunc f); ODEFunc (ODERHSFunc f, ODEJacFunc j); ODEFunc (const ODEFunc& a); ODEFunc& operator = (const ODEFunc& a); ODERHSFunc function (void) const; ODEFunc& set_function (ODERHSFunc f); ODEJacFunc jacobian_function (void) const; ODEFunc& set_jacobian_function (ODEJacFunc j); protected: ODERHSFunc fun; ODEJacFunc jac; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Objective.h100666 415 17 3175 5702420273 15201 0ustar jweusers// Objective.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Objective_h) #define octave_Objective_h 1 #include "dColVector.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif typedef double (*objective_fcn) (Vector&); typedef Vector (*gradient_fcn) (Vector&); class Objective { public: Objective (void); Objective (const objective_fcn); Objective (const objective_fcn, const gradient_fcn); Objective (const Objective& a); Objective& operator = (const Objective& a); objective_fcn objective_function (void) const; Objective& set_objective_function (const objective_fcn); gradient_fcn gradient_function (void) const; Objective& set_gradient_function (const gradient_fcn); private: objective_fcn phi; gradient_fcn grad; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QLD.h100666 415 17 4762 5702420273 13712 0ustar jweusers// QLD.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_QLD_h) #define octave_QLD_h 1 class Matrix; class ColumnVector; #include "QP.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class QLD : public QP { public: QLD (void) : QP () { set_default_options (); } QLD (const Vector& x, const Matrix& H) : QP (x, H) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Vector& c) : QP (x, H, c) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Bounds& b) : QP (x, H, b) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const LinConst& lc) : QP (x, H, lc) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b) : QP (x, H, c, b) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Vector& c, const LinConst& lc) : QP (x, H, c, lc) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Bounds& b, const LinConst& lc) : QP (x, H, b, lc) { set_default_options (); } QLD (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b, const LinConst& lc) : QP (x, H, c, b, lc) { set_default_options (); } QLD (const QLD& a); QLD& operator = (const QLD& a); Vector minimize (double& objf, int& inform); private: void set_default_options (void); int iprint; }; inline QLD::QLD (const QLD& a) : QP (a.x, a.H, a.c, a.bnds, a.lc) { set_default_options (); } inline QLD& QLD::operator = (const QLD& a) { x = a.x; H = a.H; c = a.c; bnds = a.bnds; lc = a.lc; iprint = a.iprint; return *this; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QP.h100666 415 17 4422 5702420272 13602 0ustar jweusers// QP.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_QP_h) #define octave_QP_h 1 #include "dMatrix.h" #include "dColVector.h" #include "Bounds.h" #include "LinConst.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class QP { public: QP (void); QP (const Vector& x, const Matrix& H); QP (const Vector& x, const Matrix& H, const Vector& c); QP (const Vector& x, const Matrix& H, const Bounds& b); QP (const Vector& x, const Matrix& H, const LinConst& lc); QP (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b); QP (const Vector& x, const Matrix& H, const Vector& c, const LinConst& lc); QP (const Vector& x, const Matrix& H, const Bounds& b, const LinConst& lc); QP (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b, const LinConst& lc); virtual Vector minimize (void); virtual Vector minimize (double& objf); virtual Vector minimize (double& objf, int& inform); virtual Vector minimize (double& objf, int& inform, Vector& lambda) = 0; virtual Vector minimize (const Vector& x); virtual Vector minimize (const Vector& x, double& objf); virtual Vector minimize (const Vector& x, double& objf, int& inform); virtual Vector minimize (const Vector& x, double& objf, int& inform, Vector& lambda); protected: Vector x; Matrix H; Vector c; Bounds bnds; LinConst lc; private: Matrix make_h_symmetric (void); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/QPSOL.h100666 415 17 5746 5702420272 14172 0ustar jweusers// QPSOL.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_QPSOL_h) #define octave_QPSOL_h 1 #ifndef QPSOL_MISSING #include "dMatrix.h" #include "dColVector.h" #include "QP.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif class QPSOL_options { public: QPSOL_options (void); QPSOL_options (const QPSOL_options& opt); QPSOL_options& operator = (const QPSOL_options& opt); ~QPSOL_options (void); void init (void); void copy (const QPSOL_options& opt); void set_default_options (void); void set_feasibility_tolerance (double); void set_infinite_bound (double); void set_iteration_limit (int); void set_print_level (int); double feasibility_tolerance (void); double infinite_bound (void); int iteration_limit (void); int print_level (void); private: double x_feasibility_tolerance; double x_infinite_bound; int x_iteration_limit; int x_print_level; }; class QPSOL : public QP, public QPSOL_options { public: QPSOL (void) : QP () { } QPSOL (const Vector& x, const Matrix& H) : QP (x, H) { } QPSOL (const Vector& x, const Matrix& H, const Vector& c) : QP (x, H, c) { } QPSOL (const Vector& x, const Matrix& H, const Bounds& b) : QP (x, H, b) { } QPSOL (const Vector& x, const Matrix& H, const LinConst& lc) : QP (x, H, lc) { } QPSOL (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b) : QP (x, H, c, b) { } QPSOL (const Vector& x, const Matrix& H, const Vector& c, const LinConst& lc) : QP (x, H, c, lc) { } QPSOL (const Vector& x, const Matrix& H, const Bounds& b, const LinConst& lc) : QP (x, H, b, lc) { } QPSOL (const Vector& x, const Matrix& H, const Vector& c, const Bounds& b, const LinConst& lc) : QP (x, H, c, b, lc) { } QPSOL (const QPSOL& a); QPSOL& operator = (const QPSOL& a); Vector minimize (double& objf, int& inform, Vector& lambda); }; inline QPSOL::QPSOL (const QPSOL& a) : QP (a.x, a.H, a.c, a.bnds, a.lc) { } inline QPSOL& QPSOL::operator = (const QPSOL& a) { x = a.x; H = a.H; c = a.c; bnds = a.bnds; lc = a.lc; return *this; } } // extern "C++" #endif /* QPSOL_MISSING */ #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Quad.h100666 415 17 6532 5702420271 14157 0ustar jweusers// Quad.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Quad_h) #define octave_Quad_h 1 #include "dColVector.h" extern "C++" { #ifndef Vector #define Vector ColumnVector #endif #if !defined (octave_Quad_typedefs) #define octave_Quad_typedefs 1 typedef double (*integrand_fcn) (double x); #endif // XXX FIXME XXX -- would be nice to not have to have this global // variable. // Nonzero means an error occurred in the calculation of the integrand // function, and the user wants us to quit. extern int quad_integration_error; class Quad_options { public: Quad_options (void); Quad_options (const Quad_options& opt); Quad_options& operator = (const Quad_options& opt); ~Quad_options (void); void init (void); void copy (const Quad_options& opt); void set_default_options (void); void set_absolute_tolerance (double); void set_relative_tolerance (double); double absolute_tolerance (void); double relative_tolerance (void); private: double x_absolute_tolerance; double x_relative_tolerance; }; class Quad : public Quad_options { public: Quad (integrand_fcn fcn); Quad (integrand_fcn fcn, double abs, double rel); virtual double integrate (void); virtual double integrate (int& ier); virtual double integrate (int& ier, int& neval); virtual double integrate (int& ier, int& neval, double& abserr) = 0; protected: integrand_fcn f; }; class DefQuad : public Quad { public: DefQuad (integrand_fcn fcn); DefQuad (integrand_fcn fcn, double ll, double ul); DefQuad (integrand_fcn fcn, double ll, double ul, double abs, double rel); DefQuad (integrand_fcn fcn, double ll, double ul, const Vector& sing); DefQuad (integrand_fcn fcn, const Vector& sing, double abs, double rel); DefQuad (integrand_fcn fcn, const Vector& sing); DefQuad (integrand_fcn fcn, double ll, double ul, const Vector& sing, double abs, double rel); double integrate (int& ier, int& neval, double& abserr); private: double lower_limit; double upper_limit; Vector singularities; }; class IndefQuad : public Quad { public: enum IntegralType { bound_to_inf, neg_inf_to_bound, doubly_infinite }; IndefQuad (integrand_fcn fcn); IndefQuad (integrand_fcn fcn, double b, IntegralType t); IndefQuad (integrand_fcn fcn, double b, IntegralType t, double abs, double rel); IndefQuad (integrand_fcn fcn, double abs, double rel); double integrate (int& ier, int& neval, double& abserr); private: int integration_error; double bound; IntegralType type; }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Range.h100666 415 17 5173 5702420271 14321 0ustar jweusers// Range.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Range_h) #define octave_Range_h 1 extern "C++" { class istream; class ostream; class Matrix; class Range { public: Range (void); Range (const Range& r); Range (double b, double l); Range (double b, double l, double i); double base (void) const; double limit (void) const; double inc (void) const; int nelem (void) const; Matrix matrix_value (void) const; double min (void) const; double max (void) const; void sort (void); void set_base (double b); void set_limit (double l); void set_inc (double i); friend ostream& operator << (ostream& os, const Range& r); friend istream& operator >> (istream& is, Range& r); void print_range (void); private: double rng_base; double rng_limit; double rng_inc; int rng_nelem; int nelem_internal (void) const; }; inline Range::Range (void) { rng_base = -1; rng_limit = -1; rng_inc = -1; rng_nelem = -1; } inline Range::Range (const Range& r) { rng_base = r.rng_base; rng_limit = r.rng_limit; rng_inc = r.rng_inc; rng_nelem = r.rng_nelem; } inline Range::Range (double b, double l) { rng_base = b; rng_limit = l; rng_inc = 1; rng_nelem = nelem_internal (); } inline Range::Range (double b, double l, double i) { rng_base = b; rng_limit = l; rng_inc = i; rng_nelem = nelem_internal (); } inline double Range::base (void) const { return rng_base; } inline double Range::limit (void) const { return rng_limit; } inline double Range::inc (void) const { return rng_inc; } inline int Range::nelem (void) const { return rng_nelem; } inline void Range::set_base (double b) { rng_base = b; } inline void Range::set_limit (double l) { rng_limit = l; } inline void Range::set_inc (double i) { rng_inc = i; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/lo-error.h100666 415 17 2737 5702420261 15030 0ustar jweusers// error.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_liboctave_error_h) #define octave_liboctave_error_h 1 extern "C++" { // Tell g++ that fatal doesn't return; #ifdef __GNUG__ typedef void v_fcn_cpc_x (const char *, ...); volatile v_fcn_cpc_x fatal; #endif extern void liboctave_fatal (const char *fmt, ...); typedef void (*liboctave_error_handler) (const char *, ...); // Would be nice to make this private, but we want to share it among // all the liboctave classes. extern liboctave_error_handler current_liboctave_error_handler; extern void set_liboctave_error_handler (liboctave_error_handler f); } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/f77-uscore.h100666 415 17 2053 5702420262 15160 0ustar jweusers// f77-uscore.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_f77_uscore_h) #define octave_f77_uscore_h 1 #if defined (F77_APPEND_UNDERSCORE) #define F77_FCN(f) f##_ #else #define F77_FCN(f) f #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/sun-utils.h100666 415 17 3744 5702420252 15231 0ustar jweusers// sun-utils.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_sun_utils_h) #define octave_sun_utils_h 1 extern "C++" { #ifdef sun /* * I think that this is really only needed if linking to Fortran * compiled libraries on a Sun. It should never be called. * There should probably be a sysdep.cc file, eh? */ extern "C" int MAIN_ (void); /* * This is only needed to dereference pointers to doubles if mixing * GCC and Sun f77/cc compiled code. See the GCC manual (where the * function access_double() is described) and the Sun f77 manual, * which explains that doubles are not always aligned on 8 byte * boundaries. */ #ifdef __GNUC__ inline double access_double (double *unaligned_ptr) { union d2i { double d; int i[2]; }; union d2i *p = (union d2i *) unaligned_ptr; union d2i u; u.i[0] = p->i[0]; u.i[1] = p->i[1]; return u.d; } inline void assign_double (double *unaligned_ptr, double value) { union d2i { double d; int i[2]; }; double *ptr = &value; union d2i *v = (union d2i *) ptr; union d2i *p = (union d2i *) unaligned_ptr; p->i[0] = v->i[0]; p->i[1] = v->i[1]; } #endif #endif #endif } // extern "C++" /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Array.h100666 415 17 15627 5702420314 14366 0ustar jweusers// Template array classes -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Array_h) #define octave_Array_h 1 #include #include "lo-error.h" extern "C++" { // Classes we declare. template class ArrayRep; template class Array; template class Array2; template class Array3; template class DiagArray; /* * The real representation of all arrays. */ template class ArrayRep { // Rethink resize()? friend class Array; friend class Array2; friend class Array3; friend class DiagArray; protected: ArrayRep (T *d, int l); public: ArrayRep (void); ArrayRep (int n); ArrayRep (const ArrayRep& a); ~ArrayRep (void); int length (void) const; T& elem (int n); T elem (int n) const; void resize (int n); private: T *data; int len; int count; }; /* * One dimensional array class. Handles the reference counting for * all the derived classes. */ template class Array { protected: ArrayRep *rep; Array (T *d, int l); public: Array (void); Array (int n); Array (int n, const T& val); Array (const Array& a); ~Array (void); Array& operator = (const Array& a); int capacity (void) const; int length (void) const; T& elem (int n); T& checkelem (int n); T& operator () (int n); // No checking. T& xelem (int n); T elem (int n) const; T checkelem (int n) const; T operator () (int n) const; void resize (int n); void resize (int n, const T& val); const T *data (void) const; T *fortran_vec (void); }; /* * Two dimensional array class. */ template class Array2 : public Array { protected: int d1; int d2; Array2 (T *d, int n, int m); public: Array2 (void); Array2 (int n, int m); Array2 (int n, int m, const T& val); Array2 (const Array2& a); Array2 (const DiagArray& a); Array2& operator = (const Array2& a); int dim1 (void) const; int dim2 (void) const; int rows (void) const; int cols (void) const; int columns (void) const; T& elem (int i, int j); T& checkelem (int i, int j); T& operator () (int i, int j); // No checking. T& xelem (int i, int j); T elem (int i, int j) const; T checkelem (int i, int j) const; T operator () (int i, int j) const; void resize (int n, int m); void resize (int n, int m, const T& val); }; /* * Three dimensional array class. */ template class Array3 : public Array2 { protected: int d3; Array3 (T *d, int n, int m, int k); public: Array3 (void); Array3 (int n, int m, int k); Array3 (int n, int m, int k, const T& val); Array3 (const Array3& a); Array3& operator = (const Array3& a); int dim3 (void) const; T& elem (int i, int j, int k); T& checkelem (int i, int j, int k); T& operator () (int i, int j, int k); // No checking. T& xelem (int i, int j, int k); T elem (int i, int j, int k) const; T checkelem (int i, int j, int k) const; T operator () (int i, int j, int k) const; void resize (int n, int m, int k); void resize (int n, int m, int k, const T& val); }; /* * A two-dimensional array with diagonal elements only. * * Idea and example code for Proxy class and functions from: * * From: kanze@us-es.sel.de (James Kanze) * Subject: Re: How to overload [] to do READ/WRITE differently ? * Message-ID: * Sender: news@us-es.sel.de * Date: 29 Nov 1993 14:14:07 GMT * -- * James Kanze email: kanze@us-es.sel.de * GABI Software, Sarl., 8 rue du Faisan, F-67000 Strasbourg, France */ template class DiagArray : public Array { private: inline T get (int i) { return Array::elem (i); } inline void set (const T& val, int i) { Array::elem (i) = val; } #if 0 #if ! (defined (_AIX) && defined (__GNUG__) && __GNUC__ > 1 && __GNUC_MINOR__ < 6) class Proxy { public: inline Proxy (DiagArray *ref, int r, int c) : i (r), j (c), object (ref) { } inline const Proxy& operator = (const T& val) const { if (i == j) { if (object) object->set (val, i); } else (*current_liboctave_error_handler) ("assignment to off-diagonal element attempted for diagonal array"); return *this; } inline operator T () const { if (object && i == j) return object->get (i); else { static T foo (0); return foo; } } private: // XXX FIXME XXX -- this is declared private to keep the user from // taking the address of a Proxy. Maybe it should be implemented by // means of a companion function in the DiagArray class. inline T *operator& () const { assert (0); return (T *) 0; } int i; int j; DiagArray *object; }; friend class Proxy; #endif #endif protected: int nr; int nc; DiagArray (T *d, int r, int c); public: DiagArray (void); DiagArray (int n); DiagArray (int n, const T& val); DiagArray (int r, int c); DiagArray (int r, int c, const T& val); DiagArray (const Array& a); DiagArray (const DiagArray& a); DiagArray& operator = (const DiagArray& a); int dim1 (void) const; int dim2 (void) const; int rows (void) const; int cols (void) const; int columns (void) const; #if 0 inline Proxy elem (int r, int c) { return Proxy (this, r, c); } inline Proxy checkelem (int r, int c) { if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); return Proxy (0, r, c); } else return Proxy (this, r, c); } inline Proxy operator () (int r, int c) { if (r < 0 || c < 0 || r >= nr || c >= nc) { (*current_liboctave_error_handler) ("range error"); return Proxy (0, r, c); } else return Proxy (this, r, c); } #else T& elem (int r, int c); T& checkelem (int r, int c); T& operator () (int r, int c); #endif // No checking. T& xelem (int r, int c); T elem (int r, int c) const; T checkelem (int r, int c) const; T operator () (int r, int c) const; void resize (int n, int m); void resize (int n, int m, const T& val); }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/MArray.h100666 415 17 14671 5702420302 14476 0ustar jweusers// Template array classes with like-type math ops -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_MArray_h) #define octave_MArray_h 1 extern "C++" { #include "Array.h" // Classes we declare. template class MArray; template class MArray2; template class MDiagArray; /* * One dimensional array with math ops. */ template class MArray : public Array { protected: MArray (T *d, int l) : Array (d, l) { } public: MArray (void) : Array () { } MArray (int n) : Array (n) { } MArray (int n, const T& val) : Array (n, val) { } MArray (const Array& a) : Array (a) { } MArray (const MArray& a) : Array (a) { } MArray& operator = (const MArray& a) { return Array::operator = (a); } // Element by element MArray by scalar ops. MArray& operator += (const T& s) { /* XXX FIXME XXX */ } MArray& operator -= (const T& s) { /* XXX FIXME XXX */ } // Element by element MArray by MArray ops. MArray& operator += (const MArray& a) { /* XXX FIXME XXX */ } MArray& operator -= (const MArray& a) { /* XXX FIXME XXX */ } // Element by element MArray by scalar ops. friend MArray operator + (const MArray& a, const T& s); friend MArray operator - (const MArray& a, const T& s); friend MArray operator * (const MArray& a, const T& s); friend MArray operator / (const MArray& a, const T& s); // Element by element scalar by MArray ops. friend MArray operator + (const T& s, const MArray& a); friend MArray operator - (const T& s, const MArray& a); friend MArray operator * (const T& s, const MArray& a); friend MArray operator / (const T& s, const MArray& a); // Element by element MArray by MArray ops. friend MArray operator + (const MArray& a, const MArray& b); friend MArray operator - (const MArray& a, const MArray& b); friend MArray product (const MArray& a, const MArray& b); friend MArray quotient (const MArray& a, const MArray& b); friend MArray operator - (const MArray& a); }; /* * Two dimensional array with math ops. */ template class MArray2 : public Array2 { protected: MArray2 (T *d, int n, int m) : Array2 (d, n, m) { } public: MArray2 (void) : Array2 () { } MArray2 (int n, int m) : Array2 (n, m) { } MArray2 (int n, int m, const T& val) : Array2 (n, m, val) { } MArray2 (const Array2& a) : Array2 (a) { } MArray2 (const MArray2& a) : Array2 (a) { } MArray2 (const MDiagArray& a); MArray2& operator = (const MArray2& a) { return Array2::operator = (a); } // Element by element MArray2 by scalar ops. MArray2& operator += (const T& s) { /* XXX FIXME XXX */ } MArray2& operator -= (const T& s) { /* XXX FIXME XXX */ } // Element by element MArray2 by MArray2 ops. MArray2& operator += (const MArray2& a) { /* XXX FIXME XXX */ } MArray2& operator -= (const MArray2& a) { /* XXX FIXME XXX */ } // Element by element MArray2 by scalar ops. friend MArray2 operator + (const MArray2& a, const T& s); friend MArray2 operator - (const MArray2& a, const T& s); friend MArray2 operator * (const MArray2& a, const T& s); friend MArray2 operator / (const MArray2& a, const T& s); // Element by element scalar by MArray2 ops. friend MArray2 operator + (const T& s, const MArray2& a); friend MArray2 operator - (const T& s, const MArray2& a); friend MArray2 operator * (const T& s, const MArray2& a); friend MArray2 operator / (const T& s, const MArray2& a); // Element by element MArray2 by MArray2 ops. friend MArray2 operator + (const MArray2& a, const MArray2& b); friend MArray2 operator - (const MArray2& a, const MArray2& b); friend MArray2 product (const MArray2& a, const MArray2& b); friend MArray2 quotient (const MArray2& a, const MArray2& b); friend MArray2 operator - (const MArray2& a); }; /* * Two dimensional diagonal array with math ops. */ template class MDiagArray : public DiagArray { protected: MDiagArray (T *d, int r, int c) : DiagArray (d, r, c) { } public: MDiagArray (void) : DiagArray () { } MDiagArray (int n) : DiagArray (n) { } MDiagArray (int n, const T& val) : DiagArray (n, val) { } MDiagArray (int r, int c) : DiagArray (r, c) { } MDiagArray (int r, int c, const T& val) : DiagArray (r, c, val) { } MDiagArray (const DiagArray& a) : DiagArray (a) { } MDiagArray (const MDiagArray& a) : DiagArray (a) { } MDiagArray (const MArray& a) : DiagArray (a) { } MDiagArray& operator = (const MDiagArray& a) { return DiagArray::operator = (a); } MDiagArray& operator += (const MDiagArray& a) { /* XXX FIXME XXX */ } MDiagArray& operator -= (const MDiagArray& a) { /* XXX FIXME XXX */ } // Element by element MDiagArray by scalar ops. friend MDiagArray operator * (const MDiagArray& a, const T& s); friend MDiagArray operator / (const MDiagArray& a, const T& s); // Element by element scalar by MDiagArray ops. friend MDiagArray operator * (const T& s, const MDiagArray& a); // Element by element MDiagArray by MDiagArray ops. friend MDiagArray operator + (const MDiagArray& a, const MDiagArray& b); friend MDiagArray operator - (const MDiagArray& a, const MDiagArray& b); friend MDiagArray product (const MDiagArray& a, const MDiagArray& b); friend MDiagArray operator - (const MDiagArray& a); }; #ifdef __GNUG__ #include "MArray.cc" #endif } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/Matrix.h100666 415 17 2153 5702420301 14516 0ustar jweusers// Matrix manipulations. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Should probably say something here about why these classes are not represented by some sort of inheritance tree... */ #if !defined (octave_Matrix_h) #define octave_Matrix_h 1 #include "mx-base.h" #include "mx-ext.h" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-base.h100666 415 17 2361 5702420257 14621 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_mx_base_h) #define octave_mx_base_h 1 /* * Matrix classes. */ #include "dMatrix.h" #include "CMatrix.h" /* * Column Vector classes. */ #include "dColVector.h" #include "CColVector.h" /* * Row Vector classes. */ #include "dRowVector.h" #include "CRowVector.h" /* * Diagonal Matrix classes. */ #include "dDiagMatrix.h" #include "CDiagMatrix.h" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-defs.h100666 415 17 3322 5702420256 14625 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_mx_defs_h) #define octave_mx_defs_h 1 // Classes we declare. class Matrix; class ColumnVector; class RowVector; class DiagMatrix; class ComplexMatrix; class ComplexColumnVector; class ComplexRowVector; class ComplexDiagMatrix; class AEPBALANCE; class ComplexAEPBALANCE; class GEPBALANCE; class CHOL; class ComplexCHOL; class DET; class ComplexDET; class EIG; class HESS; class ComplexHESS; class SCHUR; class ComplexSCHUR; class SVD; class ComplexSVD; class LU; class ComplexLU; class QR; class ComplexQR; // Other data types we use but that don't always need to have full // declarations. class Complex; class istream; class ostream; #ifndef MAPPER_FCN_TYPEDEFS #define MAPPER_FCN_TYPEDEFS 1 typedef double (*d_d_Mapper)(double); typedef double (*d_c_Mapper)(const Complex&); typedef Complex (*c_c_Mapper)(const Complex&); #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-ext.h100666 415 17 3467 5702420254 14514 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_mx_ext_h) #define octave_mx_ext_h 1 // Result of a AEP Balance operation. #include "dbleAEPBAL.h" #include "CmplxAEPBAL.h" // Result of a Determinant calculation. #include "dbleDET.h" #include "CmplxDET.h" // Result of a GEP Balance operation // Note: currenlty only do balancing on real data. Complex balancing // done on magnitudes of complex data. #include "dbleGEPBAL.h" // Result of a Cholesky Factorization #include "dbleCHOL.h" #include "CmplxCHOL.h" // Result of a Hessenberg Decomposition #include "dbleHESS.h" #include "CmplxHESS.h" // Result of a Schur Decomposition #include "dbleSCHUR.h" #include "CmplxSCHUR.h" // Result of a Singular Value Decomposition. #include "dbleSVD.h" #include "CmplxSVD.h" // Result of an Eigenvalue computation. #include "EIG.h" // Result of an LU decomposition. #include "dbleLU.h" #include "CmplxLU.h" // Result of a QR decomposition. #include "dbleQR.h" #include "CmplxQR.h" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-kludge.h100666 415 17 10462 5702420247 15202 0ustar jweusers// kludge.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Nothing like a little CPP abuse to brighten everyone's day. Would // have been nice to do this with template functions but as of 2.5.x, // g++ seems to fail in various ways, either not resolving general // template functions, or not instatiating non-member template // functions. // // When templates work more reliably in g++, this will be replaced by // the MArray class. #ifdef KLUDGE_VECTORS /* * Like type operations for vectors. */ // Element by element vector by scalar ops. friend KL_VEC_TYPE operator + (const KL_VEC_TYPE& a, const TYPE& s); friend KL_VEC_TYPE operator - (const KL_VEC_TYPE& a, const TYPE& s); friend KL_VEC_TYPE operator * (const KL_VEC_TYPE& a, const TYPE& s); friend KL_VEC_TYPE operator / (const KL_VEC_TYPE& a, const TYPE& s); // Element by element scalar by vector ops. friend KL_VEC_TYPE operator + (const TYPE& s, const KL_VEC_TYPE& a); friend KL_VEC_TYPE operator - (const TYPE& s, const KL_VEC_TYPE& a); friend KL_VEC_TYPE operator * (const TYPE& s, const KL_VEC_TYPE& a); friend KL_VEC_TYPE operator / (const TYPE& s, const KL_VEC_TYPE& a); // Element by element vector by vector ops. friend KL_VEC_TYPE operator + (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b); friend KL_VEC_TYPE operator - (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b); friend KL_VEC_TYPE product (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b); friend KL_VEC_TYPE quotient (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b); // Unary MArray ops. friend KL_VEC_TYPE operator - (const KL_VEC_TYPE& a); #endif #ifdef KLUDGE_MATRICES /* * Like type operations for matrices */ // Element by element matrix by scalar ops. friend KL_MAT_TYPE operator + (const KL_MAT_TYPE& a, const TYPE& s); friend KL_MAT_TYPE operator - (const KL_MAT_TYPE& a, const TYPE& s); friend KL_MAT_TYPE operator * (const KL_MAT_TYPE& a, const TYPE& s); friend KL_MAT_TYPE operator / (const KL_MAT_TYPE& a, const TYPE& s); // Element by element scalar by matrix ops. friend KL_MAT_TYPE operator + (const TYPE& s, const KL_MAT_TYPE& a); friend KL_MAT_TYPE operator - (const TYPE& s, const KL_MAT_TYPE& a); friend KL_MAT_TYPE operator * (const TYPE& s, const KL_MAT_TYPE& a); friend KL_MAT_TYPE operator / (const TYPE& s, const KL_MAT_TYPE& a); // Element by element matrix by matrix ops. friend KL_MAT_TYPE operator + (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b); friend KL_MAT_TYPE operator - (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b); friend KL_MAT_TYPE product (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b); friend KL_MAT_TYPE quotient (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b); // Unary matrix ops. friend KL_MAT_TYPE operator - (const KL_MAT_TYPE& a); #endif #ifdef KLUDGE_DIAG_MATRICES /* * Like type operations for diagonal matrices. */ // Element by element MDiagArray by scalar ops. friend KL_DMAT_TYPE operator * (const KL_DMAT_TYPE& a, const TYPE& s); friend KL_DMAT_TYPE operator / (const KL_DMAT_TYPE& a, const TYPE& s); // Element by element scalar by MDiagArray ops. friend KL_DMAT_TYPE operator * (const TYPE& s, const KL_DMAT_TYPE& a); // Element by element MDiagArray by MDiagArray ops. friend KL_DMAT_TYPE operator + (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b); friend KL_DMAT_TYPE operator - (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b); friend KL_DMAT_TYPE product (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b); // Unary MDiagArray ops. friend KL_DMAT_TYPE operator - (const KL_DMAT_TYPE& a); #endif #undef DO_SV_OP #undef DO_VS_OP #undef DO_VV_OP #undef NEG_V /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CColVector.h100666 415 17 12727 5702420313 15310 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexColumnVector_h) #define octave_ComplexColumnVector_h 1 #include "Array.h" #include "mx-defs.h" extern "C++" { class ComplexColumnVector : public Array { friend class ColumnVector; friend class ComplexRowVector; friend class ComplexMatrix; public: ComplexColumnVector (void) : Array () { } ComplexColumnVector (int n) : Array (n) { } ComplexColumnVector (int n, const Complex& val) : Array (n, val) { } ComplexColumnVector (const ColumnVector& a); ComplexColumnVector (const Array& a) : Array (a) { } ComplexColumnVector (const ComplexColumnVector& a) : Array (a) { } // ComplexColumnVector (double a) : Array (1, a) { } // ComplexColumnVector (const Complex& a) : Array (1, a) { } ComplexColumnVector& operator = (const ComplexColumnVector& a) { Array::operator = (a); return *this; } // operator Array& () const { return *this; } int operator == (const ComplexColumnVector& a) const; int operator != (const ComplexColumnVector& a) const; // destructive insert/delete/reorder operations ComplexColumnVector& insert (const ColumnVector& a, int r); ComplexColumnVector& insert (const ComplexColumnVector& a, int r); ComplexColumnVector& fill (double val); ComplexColumnVector& fill (const Complex& val); ComplexColumnVector& fill (double val, int r1, int r2); ComplexColumnVector& fill (const Complex& val, int r1, int r2); ComplexColumnVector stack (const ColumnVector& a) const; ComplexColumnVector stack (const ComplexColumnVector& a) const; ComplexRowVector hermitian (void) const; // complex conjugate transpose. ComplexRowVector transpose (void) const; friend ColumnVector real (const ComplexColumnVector& a); friend ColumnVector imag (const ComplexColumnVector& a); friend ComplexColumnVector conj (const ComplexColumnVector& a); // resize is the destructive equivalent for this one ComplexColumnVector extract (int r1, int r2) const; // column vector by column vector -> column vector operations ComplexColumnVector& operator += (const ColumnVector& a); ComplexColumnVector& operator -= (const ColumnVector& a); ComplexColumnVector& operator += (const ComplexColumnVector& a); ComplexColumnVector& operator -= (const ComplexColumnVector& a); // column vector by scalar -> column vector operations friend ComplexColumnVector operator + (const ComplexColumnVector& a, double s); friend ComplexColumnVector operator - (const ComplexColumnVector& a, double s); friend ComplexColumnVector operator * (const ComplexColumnVector& a, double s); friend ComplexColumnVector operator / (const ComplexColumnVector& a, double s); // scalar by column vector -> column vector operations friend ComplexColumnVector operator + (double s, const ComplexColumnVector& a); friend ComplexColumnVector operator - (double s, const ComplexColumnVector& a); friend ComplexColumnVector operator * (double s, const ComplexColumnVector& a); friend ComplexColumnVector operator / (double s, const ComplexColumnVector& a); // column vector by row vector -> matrix operations friend ComplexMatrix operator * (const ComplexColumnVector& a, const ComplexRowVector& b); // column vector by column vector -> column vector operations friend ComplexColumnVector operator + (const ComplexColumnVector& a, const ColumnVector& b); friend ComplexColumnVector operator - (const ComplexColumnVector& a, const ColumnVector& b); friend ComplexColumnVector product (const ComplexColumnVector& a, const ColumnVector& b); friend ComplexColumnVector quotient (const ComplexColumnVector& a, const ColumnVector& b); // other operations friend ComplexColumnVector map (c_c_Mapper f, const ComplexColumnVector& a); friend ColumnVector map (d_c_Mapper f, const ComplexColumnVector& a); void map (c_c_Mapper f); Complex min (void) const; Complex max (void) const; // i/o friend ostream& operator << (ostream& os, const ComplexColumnVector& a); friend istream& operator >> (istream& is, ComplexColumnVector& a); #define KLUDGE_VECTORS #define TYPE Complex #define KL_VEC_TYPE ComplexColumnVector #include "mx-kludge.h" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE // private: // XXX FIXME XXX -- why does it not work to make this private, with // ColumnVector declared as a friend of ComplexColumnVector? It seems // to work for the similar case with Matrix/ComplexMatrix. Hmm... ComplexColumnVector (Complex *d, int l) : Array (d, l) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CDiagMatrix.h100666 415 17 15724 5702420312 15440 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexDiagMatrix_h) #define octave_ComplexDiagMatrix_h 1 #include "Array.h" #include "dRowVector.h" #include "CRowVector.h" #include "dColVector.h" #include "CColVector.h" #include "mx-defs.h" extern "C++" { class ComplexDiagMatrix : public DiagArray { friend DiagMatrix; public: ComplexDiagMatrix (void) : DiagArray () { } ComplexDiagMatrix (int n) : DiagArray (n) { } ComplexDiagMatrix (int n, const Complex& val) : DiagArray (n, val) { } ComplexDiagMatrix (int r, int c) : DiagArray (r, c) { } ComplexDiagMatrix (int r, int c, const Complex& val) : DiagArray (r, c, val) { } ComplexDiagMatrix (const RowVector& a); ComplexDiagMatrix (const ComplexRowVector& a) : DiagArray (a) { } ComplexDiagMatrix (const ColumnVector& a); ComplexDiagMatrix (const ComplexColumnVector& a) : DiagArray (a) { } ComplexDiagMatrix (const DiagMatrix& a); ComplexDiagMatrix (const DiagArray& a) : DiagArray (a) { } ComplexDiagMatrix (const ComplexDiagMatrix& a) : DiagArray (a) { } // ComplexDiagMatrix (const Complex& a) : DiagArray (1, a) { } ComplexDiagMatrix& operator = (const ComplexDiagMatrix& a) { DiagArray::operator = (a); return *this; } // operator DiagArray& () const { return *this; } int operator == (const ComplexDiagMatrix& a) const; int operator != (const ComplexDiagMatrix& a) const; ComplexDiagMatrix& fill (double val); ComplexDiagMatrix& fill (const Complex& val); ComplexDiagMatrix& fill (double val, int beg, int end); ComplexDiagMatrix& fill (const Complex& val, int beg, int end); ComplexDiagMatrix& fill (const ColumnVector& a); ComplexDiagMatrix& fill (const ComplexColumnVector& a); ComplexDiagMatrix& fill (const RowVector& a); ComplexDiagMatrix& fill (const ComplexRowVector& a); ComplexDiagMatrix& fill (const ColumnVector& a, int beg); ComplexDiagMatrix& fill (const ComplexColumnVector& a, int beg); ComplexDiagMatrix& fill (const RowVector& a, int beg); ComplexDiagMatrix& fill (const ComplexRowVector& a, int beg); ComplexDiagMatrix hermitian (void) const; // complex conjugate transpose ComplexDiagMatrix transpose (void) const; friend DiagMatrix real (const ComplexDiagMatrix& a); friend DiagMatrix imag (const ComplexDiagMatrix& a); friend ComplexDiagMatrix conj (const ComplexDiagMatrix& a); // resize is the destructive analog for this one ComplexMatrix extract (int r1, int c1, int r2, int c2) const; // extract row or column i. ComplexRowVector row (int i) const; ComplexRowVector row (char *s) const; ComplexColumnVector column (int i) const; ComplexColumnVector column (char *s) const; ComplexDiagMatrix inverse (int& info) const; ComplexDiagMatrix inverse (void) const; // diagonal matrix by diagonal matrix -> diagonal matrix operations ComplexDiagMatrix& operator += (const DiagMatrix& a); ComplexDiagMatrix& operator -= (const DiagMatrix& a); ComplexDiagMatrix& operator += (const ComplexDiagMatrix& a); ComplexDiagMatrix& operator -= (const ComplexDiagMatrix& a); // diagonal matrix by scalar -> matrix operations friend ComplexMatrix operator + (const ComplexDiagMatrix& a, double s); friend ComplexMatrix operator - (const ComplexDiagMatrix& a, double s); friend ComplexMatrix operator + (const ComplexDiagMatrix& a, const Complex& s); friend ComplexMatrix operator - (const ComplexDiagMatrix& a, const Complex& s); // diagonal matrix by scalar -> diagonal matrix operations friend ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, double s); friend ComplexDiagMatrix operator / (const ComplexDiagMatrix& a, double s); // scalar by diagonal matrix -> matrix operations friend ComplexMatrix operator + (double s, const ComplexDiagMatrix& a); friend ComplexMatrix operator - (double s, const ComplexDiagMatrix& a); friend ComplexMatrix operator + (const Complex& s, const ComplexDiagMatrix& a); friend ComplexMatrix operator - (const Complex& s, const ComplexDiagMatrix& a); // scalar by diagonal matrix -> diagonal matrix operations friend ComplexDiagMatrix operator * (double s, const ComplexDiagMatrix& a); // diagonal matrix by column vector -> column vector operations friend ComplexColumnVector operator * (const ComplexDiagMatrix& a, const ColumnVector& b); friend ComplexColumnVector operator * (const ComplexDiagMatrix& a, const ComplexColumnVector& b); // diagonal matrix by diagonal matrix -> diagonal matrix operations friend ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, const ComplexDiagMatrix& b); friend ComplexDiagMatrix operator + (const ComplexDiagMatrix& a, const DiagMatrix& b); friend ComplexDiagMatrix operator - (const ComplexDiagMatrix& a, const DiagMatrix& b); friend ComplexDiagMatrix operator * (const ComplexDiagMatrix& a, const DiagMatrix& b); friend ComplexDiagMatrix product (const ComplexDiagMatrix& a, const DiagMatrix& b); // diagonal matrix by matrix -> matrix operations friend ComplexMatrix operator + (const ComplexDiagMatrix& a, const Matrix& b); friend ComplexMatrix operator - (const ComplexDiagMatrix& a, const Matrix& b); friend ComplexMatrix operator * (const ComplexDiagMatrix& a, const Matrix& b); friend ComplexMatrix operator + (const ComplexDiagMatrix& a, const ComplexMatrix& b); friend ComplexMatrix operator - (const ComplexDiagMatrix& a, const ComplexMatrix& b); friend ComplexMatrix operator * (const ComplexDiagMatrix& a, const ComplexMatrix& b); // other operations ComplexColumnVector diag (void) const; ComplexColumnVector diag (int k) const; // i/o friend ostream& operator << (ostream& os, const ComplexDiagMatrix& a); #define KLUDGE_DIAG_MATRICES #define TYPE Complex #define KL_DMAT_TYPE ComplexDiagMatrix #include "mx-kludge.h" #undef KLUDGE_DIAG_MATRICES #undef TYPE #undef KL_DMAT_TYPE private: ComplexDiagMatrix (Complex *d, int nr, int nc) : DiagArray (d, nr, nc) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CMatrix.h100666 415 17 23337 5702420312 14652 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexMatrix_h) #define octave_ComplexMatrix_h 1 #include #include "Array.h" #include "mx-defs.h" extern "C++" { class ComplexMatrix : public Array2 { friend class ComplexCHOL; friend class ComplexHESS; friend class ComplexLU; friend class ComplexQR; friend class ComplexQRP; friend class ComplexSCHUR; friend class ComplexSVD; friend class ComplexColumnVector; friend class Matrix; public: ComplexMatrix (void) : Array2 () { } ComplexMatrix (int r, int c) : Array2 (r, c) { } ComplexMatrix (int r, int c, const Complex& val) : Array2 (r, c, val) { } ComplexMatrix (const Matrix& a); ComplexMatrix (const Array2& a) : Array2 (a) { } ComplexMatrix (const ComplexMatrix& a) : Array2 (a) { } ComplexMatrix (const DiagMatrix& a); ComplexMatrix (const DiagArray& a) : Array2 (a) { } ComplexMatrix (const ComplexDiagMatrix& a); // ComplexMatrix (double a) : Array2 (1, 1, a) { } // ComplexMatrix (const Complex& a) : Array2 (1, 1, a) { } ComplexMatrix& operator = (const ComplexMatrix& a) { Array2::operator = (a); return *this; } // operator Array2& () const { return *this; } int operator == (const ComplexMatrix& a) const; int operator != (const ComplexMatrix& a) const; // destructive insert/delete/reorder operations ComplexMatrix& insert (const Matrix& a, int r, int c); ComplexMatrix& insert (const RowVector& a, int r, int c); ComplexMatrix& insert (const ColumnVector& a, int r, int c); ComplexMatrix& insert (const DiagMatrix& a, int r, int c); ComplexMatrix& insert (const ComplexMatrix& a, int r, int c); ComplexMatrix& insert (const ComplexRowVector& a, int r, int c); ComplexMatrix& insert (const ComplexColumnVector& a, int r, int c); ComplexMatrix& insert (const ComplexDiagMatrix& a, int r, int c); ComplexMatrix& fill (double val); ComplexMatrix& fill (const Complex& val); ComplexMatrix& fill (double val, int r1, int c1, int r2, int c2); ComplexMatrix& fill (const Complex& val, int r1, int c1, int r2, int c2); ComplexMatrix append (const Matrix& a) const; ComplexMatrix append (const RowVector& a) const; ComplexMatrix append (const ColumnVector& a) const; ComplexMatrix append (const DiagMatrix& a) const; ComplexMatrix append (const ComplexMatrix& a) const; ComplexMatrix append (const ComplexRowVector& a) const; ComplexMatrix append (const ComplexColumnVector& a) const; ComplexMatrix append (const ComplexDiagMatrix& a) const; ComplexMatrix stack (const Matrix& a) const; ComplexMatrix stack (const RowVector& a) const; ComplexMatrix stack (const ColumnVector& a) const; ComplexMatrix stack (const DiagMatrix& a) const; ComplexMatrix stack (const ComplexMatrix& a) const; ComplexMatrix stack (const ComplexRowVector& a) const; ComplexMatrix stack (const ComplexColumnVector& a) const; ComplexMatrix stack (const ComplexDiagMatrix& a) const; ComplexMatrix hermitian (void) const; // complex conjugate transpose ComplexMatrix transpose (void) const; friend Matrix real (const ComplexMatrix& a); friend Matrix imag (const ComplexMatrix& a); friend ComplexMatrix conj (const ComplexMatrix& a); // resize is the destructive equivalent for this one ComplexMatrix extract (int r1, int c1, int r2, int c2) const; // extract row or column i. ComplexRowVector row (int i) const; ComplexRowVector row (char *s) const; ComplexColumnVector column (int i) const; ComplexColumnVector column (char *s) const; ComplexMatrix inverse (void) const; ComplexMatrix inverse (int& info) const; ComplexMatrix inverse (int& info, double& rcond) const; ComplexMatrix pseudo_inverse (double tol = 0.0); ComplexMatrix fourier (void) const; ComplexMatrix ifourier (void) const; ComplexMatrix fourier2d (void) const; ComplexMatrix ifourier2d (void) const; ComplexDET determinant (void) const; ComplexDET determinant (int& info) const; ComplexDET determinant (int& info, double& rcond) const; ComplexMatrix solve (const Matrix& b) const; ComplexMatrix solve (const Matrix& b, int& info) const; ComplexMatrix solve (const Matrix& b, int& info, double& rcond) const; ComplexMatrix solve (const ComplexMatrix& b) const; ComplexMatrix solve (const ComplexMatrix& b, int& info) const; ComplexMatrix solve (const ComplexMatrix& b, int& info, double& rcond) const; ComplexColumnVector solve (const ComplexColumnVector& b) const; ComplexColumnVector solve (const ComplexColumnVector& b, int& info) const; ComplexColumnVector solve (const ComplexColumnVector& b, int& info, double& rcond) const; ComplexMatrix lssolve (const ComplexMatrix& b) const; ComplexMatrix lssolve (const ComplexMatrix& b, int& info) const; ComplexMatrix lssolve (const ComplexMatrix& b, int& info, int& rank) const; ComplexColumnVector lssolve (const ComplexColumnVector& b) const; ComplexColumnVector lssolve (const ComplexColumnVector& b, int& info) const; ComplexColumnVector lssolve (const ComplexColumnVector& b, int& info, int& rank) const; // matrix by diagonal matrix -> matrix operations ComplexMatrix& operator += (const DiagMatrix& a); ComplexMatrix& operator -= (const DiagMatrix& a); ComplexMatrix& operator += (const ComplexDiagMatrix& a); ComplexMatrix& operator -= (const ComplexDiagMatrix& a); // matrix by matrix -> matrix operations ComplexMatrix& operator += (const Matrix& a); ComplexMatrix& operator -= (const Matrix& a); ComplexMatrix& operator += (const ComplexMatrix& a); ComplexMatrix& operator -= (const ComplexMatrix& a); // unary operations Matrix operator ! (void) const; // matrix by scalar -> matrix operations friend ComplexMatrix operator + (const ComplexMatrix& a, double s); friend ComplexMatrix operator - (const ComplexMatrix& a, double s); friend ComplexMatrix operator * (const ComplexMatrix& a, double s); friend ComplexMatrix operator / (const ComplexMatrix& a, double s); // scalar by matrix -> matrix operations friend ComplexMatrix operator + (double s, const ComplexMatrix& a); friend ComplexMatrix operator - (double s, const ComplexMatrix& a); friend ComplexMatrix operator * (double s, const ComplexMatrix& a); friend ComplexMatrix operator / (double s, const ComplexMatrix& a); // matrix by column vector -> column vector operations friend ComplexColumnVector operator * (const ComplexMatrix& a, const ColumnVector& b); friend ComplexColumnVector operator * (const ComplexMatrix& a, const ComplexColumnVector& b); // matrix by diagonal matrix -> matrix operations friend ComplexMatrix operator + (const ComplexMatrix& a, const DiagMatrix& b); friend ComplexMatrix operator - (const ComplexMatrix& a, const DiagMatrix& b); friend ComplexMatrix operator * (const ComplexMatrix& a, const DiagMatrix& b); friend ComplexMatrix operator + (const ComplexMatrix& a, const ComplexDiagMatrix& b); friend ComplexMatrix operator - (const ComplexMatrix& a, const ComplexDiagMatrix& b); friend ComplexMatrix operator * (const ComplexMatrix& a, const ComplexDiagMatrix& b); // matrix by matrix -> matrix operations friend ComplexMatrix operator + (const ComplexMatrix& a, const Matrix& b); friend ComplexMatrix operator - (const ComplexMatrix& a, const Matrix& b); friend ComplexMatrix operator * (const ComplexMatrix& a, const Matrix& b); friend ComplexMatrix operator * (const ComplexMatrix& a, const ComplexMatrix& b); friend ComplexMatrix product (const ComplexMatrix& a, const Matrix& b); friend ComplexMatrix quotient (const ComplexMatrix& a, const Matrix& b); // other operations friend ComplexMatrix map (c_c_Mapper f, const ComplexMatrix& a); friend Matrix map (d_c_Mapper f, const ComplexMatrix& a); void map (c_c_Mapper f); Matrix all (void) const; Matrix any (void) const; ComplexMatrix cumprod (void) const; ComplexMatrix cumsum (void) const; ComplexMatrix prod (void) const; ComplexMatrix sum (void) const; ComplexMatrix sumsq (void) const; ComplexColumnVector diag (void) const; ComplexColumnVector diag (int k) const; ComplexColumnVector row_min (void) const; ComplexColumnVector row_min_loc (void) const; ComplexColumnVector row_max (void) const; ComplexColumnVector row_max_loc (void) const; ComplexRowVector column_min (void) const; ComplexRowVector column_min_loc (void) const; ComplexRowVector column_max (void) const; ComplexRowVector column_max_loc (void) const; // i/o friend ostream& operator << (ostream& os, const ComplexMatrix& a); friend istream& operator >> (istream& is, ComplexMatrix& a); #define KLUDGE_MATRICES #define TYPE Complex #define KL_MAT_TYPE ComplexMatrix #include "mx-kludge.h" #undef KLUDGE_MATRICES #undef TYPE #undef KL_MAT_TYPE private: ComplexMatrix (Complex *d, int r, int c) : Array2 (d, r, c) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CRowVector.h100666 415 17 12177 5702420312 15340 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexRowVector_h) #define octave_ComplexRowVector_h 1 #include "Array.h" #include "mx-defs.h" extern "C++" { class ComplexRowVector : public Array { friend class ComplexColumnVector; friend class RowVector; public: ComplexRowVector (void) : Array () { } ComplexRowVector (int n) : Array (n) { } ComplexRowVector (int n, const Complex& val) : Array (n, val) { } ComplexRowVector (const RowVector& a); ComplexRowVector (const Array& a) : Array (a) { } ComplexRowVector (const ComplexRowVector& a) : Array (a) { } // ComplexRowVector (double a) : Array (1, a) { } // ComplexRowVector (const Complex& a) : Array (1, a) { } ComplexRowVector& operator = (const ComplexRowVector& a) { Array::operator = (a); return *this; } // operator Array& () const { return *this; } int operator == (const ComplexRowVector& a) const; int operator != (const ComplexRowVector& a) const; // destructive insert/delete/reorder operations ComplexRowVector& insert (const RowVector& a, int c); ComplexRowVector& insert (const ComplexRowVector& a, int c); ComplexRowVector& fill (double val); ComplexRowVector& fill (const Complex& val); ComplexRowVector& fill (double val, int c1, int c2); ComplexRowVector& fill (const Complex& val, int c1, int c2); ComplexRowVector append (const RowVector& a) const; ComplexRowVector append (const ComplexRowVector& a) const; ComplexColumnVector hermitian (void) const; // complex conjugate transpose. ComplexColumnVector transpose (void) const; friend RowVector real (const ComplexRowVector& a); friend RowVector imag (const ComplexRowVector& a); friend ComplexRowVector conj (const ComplexRowVector& a); // resize is the destructive equivalent for this one ComplexRowVector extract (int c1, int c2) const; // row vector by row vector -> row vector operations ComplexRowVector& operator += (const RowVector& a); ComplexRowVector& operator -= (const RowVector& a); ComplexRowVector& operator += (const ComplexRowVector& a); ComplexRowVector& operator -= (const ComplexRowVector& a); // row vector by scalar -> row vector operations friend ComplexRowVector operator + (const ComplexRowVector& a, double s); friend ComplexRowVector operator - (const ComplexRowVector& a, double s); friend ComplexRowVector operator * (const ComplexRowVector& a, double s); friend ComplexRowVector operator / (const ComplexRowVector& a, double s); // scalar by row vector -> row vector operations friend ComplexRowVector operator + (double s, const ComplexRowVector& a); friend ComplexRowVector operator - (double s, const ComplexRowVector& a); friend ComplexRowVector operator * (double s, const ComplexRowVector& a); friend ComplexRowVector operator / (double s, const ComplexRowVector& a); // row vector by column vector -> scalar friend Complex operator * (const ComplexRowVector& a, const ColumnVector& b); friend Complex operator * (const ComplexRowVector& a, const ComplexColumnVector& b); // row vector by matrix -> row vector friend ComplexRowVector operator * (const ComplexRowVector& a, const ComplexMatrix& b); // row vector by row vector -> row vector operations friend ComplexRowVector operator + (const ComplexRowVector& a, const RowVector& b); friend ComplexRowVector operator - (const ComplexRowVector& a, const RowVector& b); friend ComplexRowVector product (const ComplexRowVector& a, const RowVector& b); friend ComplexRowVector quotient (const ComplexRowVector& a, const RowVector& b); // other operations friend ComplexRowVector map (c_c_Mapper f, const ComplexRowVector& a); friend RowVector map (d_c_Mapper f, const ComplexRowVector& a); void map (c_c_Mapper f); Complex min (void) const; Complex max (void) const; // i/o friend ostream& operator << (ostream& os, const ComplexRowVector& a); friend istream& operator >> (istream& is, ComplexRowVector& a); #define KLUDGE_VECTORS #define TYPE Complex #define KL_VEC_TYPE ComplexRowVector #include "mx-kludge.h" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE private: ComplexRowVector (Complex *d, int l) : Array (d, l) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxAEPBAL.h100666 415 17 4343 5702420311 15206 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexAEPBALANCE_h) #define octave_ComplexAEPBALANCE_h 1 class ostream; #include "CMatrix.h" extern "C++" { class ComplexAEPBALANCE { friend class ComplexMatrix; public: ComplexAEPBALANCE (void) {} ComplexAEPBALANCE (const ComplexMatrix& a, const char *balance_job); ComplexAEPBALANCE (const ComplexAEPBALANCE& a); ComplexAEPBALANCE& operator = (const ComplexAEPBALANCE& a); ComplexMatrix balanced_matrix (void) const; ComplexMatrix balancing_matrix (void) const; friend ostream& operator << (ostream& os, const ComplexAEPBALANCE& a); private: int init (const ComplexMatrix& a, const char * balance_job); ComplexMatrix balanced_mat; ComplexMatrix balancing_mat; }; inline ComplexAEPBALANCE::ComplexAEPBALANCE (const ComplexMatrix& a, const char * balance_job) { init (a, balance_job); } inline ComplexAEPBALANCE::ComplexAEPBALANCE (const ComplexAEPBALANCE& a) { balanced_mat = a.balanced_mat; balancing_mat = a.balancing_mat; } inline ComplexAEPBALANCE& ComplexAEPBALANCE::operator = (const ComplexAEPBALANCE& a) { balanced_mat = a.balanced_mat; balancing_mat = a.balancing_mat; return *this; } inline ComplexMatrix ComplexAEPBALANCE::balanced_matrix (void) const { return balanced_mat; } inline ComplexMatrix ComplexAEPBALANCE::balancing_matrix (void) const { return balancing_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxCHOL.h100666 415 17 3604 5702420311 15006 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexCHOL_h) #define octave_ComplexCHOL_h 1 class ostream; #include "CMatrix.h" extern "C++" { class ComplexCHOL { friend class ComplexMatrix; public: ComplexCHOL (void) {} ComplexCHOL (const ComplexMatrix& a); ComplexCHOL (const ComplexMatrix& a, int& info); ComplexCHOL (const ComplexCHOL& a); ComplexCHOL& operator = (const ComplexCHOL& a); ComplexMatrix chol_matrix (void) const; friend ostream& operator << (ostream& os, const ComplexCHOL& a); private: int init (const ComplexMatrix& a); ComplexMatrix chol_mat; }; inline ComplexCHOL::ComplexCHOL (const ComplexMatrix& a) { init (a); } inline ComplexCHOL::ComplexCHOL (const ComplexMatrix& a, int& info) { info = init (a); } inline ComplexCHOL::ComplexCHOL (const ComplexCHOL& a) { chol_mat = a.chol_mat; } inline ComplexCHOL& ComplexCHOL::operator = (const ComplexCHOL& a) { chol_mat = a.chol_mat; return *this; } inline ComplexMatrix ComplexCHOL::chol_matrix (void) const { return chol_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxDET.h100666 415 17 3503 5702420310 14672 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexDET_h) #define octave_ComplexDET_h 1 class ostream; #include extern "C++" { class ComplexDET { friend class ComplexMatrix; public: ComplexDET (void); ComplexDET (const ComplexDET& a); ComplexDET& operator = (const ComplexDET& a); int value_will_overflow (void) const; int value_will_underflow (void) const; Complex coefficient (void) const; int exponent (void) const; Complex value (void) const; friend ostream& operator << (ostream& os, const ComplexDET& a); private: ComplexDET (const Complex *d); Complex det [2]; }; inline ComplexDET::ComplexDET (void) { } inline ComplexDET::ComplexDET (const ComplexDET& a) { det[0] = a.det[0]; det[1] = a.det[1]; } inline ComplexDET& ComplexDET::operator = (const ComplexDET& a) { det[0] = a.det[0]; det[1] = a.det[1]; return *this; } inline ComplexDET::ComplexDET (const Complex *d) { det[0] = d[0]; det[1] = d[1]; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxHESS.h100666 415 17 4215 5702420310 15021 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexHESS_h) #define octave_ComplexHESS_h 1 class ostream; #include "CMatrix.h" extern "C++" { class ComplexHESS { friend class ComplexMatrix; public: ComplexHESS (void) {} ComplexHESS (const ComplexMatrix& a); ComplexHESS (const ComplexMatrix& a, int& info); ComplexHESS (const ComplexHESS& a); ComplexHESS& operator = (const ComplexHESS& a); ComplexMatrix hess_matrix (void) const; ComplexMatrix unitary_hess_matrix (void) const; friend ostream& operator << (ostream& os, const ComplexHESS& a); private: int init (const ComplexMatrix& a); ComplexMatrix hess_mat; ComplexMatrix unitary_hess_mat; }; inline ComplexHESS::ComplexHESS (const ComplexMatrix& a) { init (a); } inline ComplexHESS::ComplexHESS (const ComplexMatrix& a, int& info) { info = init (a); } inline ComplexHESS::ComplexHESS (const ComplexHESS& a) { hess_mat = a.hess_mat; unitary_hess_mat = a.unitary_hess_mat; } inline ComplexHESS& ComplexHESS::operator = (const ComplexHESS& a) { hess_mat = a.hess_mat; unitary_hess_mat = a.unitary_hess_mat; return *this; } inline ComplexMatrix ComplexHESS::hess_matrix (void) const { return hess_mat; } inline ComplexMatrix ComplexHESS::unitary_hess_matrix (void) const { return unitary_hess_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxLU.h100666 415 17 3474 5702420310 14605 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexLU_h) #define octave_Complex_LU_h 1 class ostream; #include "dMatrix.h" #include "CMatrix.h" extern "C++" { class ComplexLU { friend class ComplexMatrix; public: ComplexLU (void) {} ComplexLU (const ComplexMatrix& a); ComplexLU (const ComplexLU& a); ComplexLU& operator = (const ComplexLU& a); ComplexMatrix L (void) const; ComplexMatrix U (void) const; Matrix P (void) const; friend ostream& operator << (ostream& os, const ComplexLU& a); private: ComplexMatrix l; ComplexMatrix u; Matrix p; }; inline ComplexLU::ComplexLU (const ComplexLU& a) { l = a.l; u = a.u; p = a.p; } inline ComplexLU& ComplexLU::operator = (const ComplexLU& a) { l = a.l; u = a.u; p = a.p; return *this; } inline ComplexMatrix ComplexLU::L (void) const { return l; } inline ComplexMatrix ComplexLU::U (void) const { return u; } inline Matrix ComplexLU::P (void) const { return p; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxQR.h100666 415 17 3307 5702420307 14610 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexQR_h) #define octave_ComplexQR_h 1 class ostream; #include "CMatrix.h" #include "dbleQR.h" extern "C++" { class ComplexQR { public: ComplexQR (void) {} ComplexQR (const ComplexMatrix& A, QR::type qr_type = QR::std); ComplexQR (const ComplexQR& a); ComplexQR& operator = (const ComplexQR& a); ComplexMatrix Q (void) const; ComplexMatrix R (void) const; friend ostream& operator << (ostream& os, const ComplexQR& a); protected: ComplexMatrix q; ComplexMatrix r; }; inline ComplexQR::ComplexQR (const ComplexQR& a) { q = a.q; r = a.r; } inline ComplexQR& ComplexQR::operator = (const ComplexQR& a) { q = a.q; r = a.r; return *this; } inline ComplexMatrix ComplexQR::Q (void) const { return q; } inline ComplexMatrix ComplexQR::R (void) const { return r; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxQRP.h100666 415 17 3144 5702420307 14727 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexQRP_h) #define octave_ComplexQRP_h 1 class ostream; #include "CmplxQR.h" extern "C++" { class ComplexQRP : public ComplexQR { public: ComplexQRP (void) {} ComplexQRP (const ComplexMatrix& A, QR::type qr_type = QR::std); ComplexQRP (const ComplexQRP& a); ComplexQRP& operator = (const ComplexQRP& a); Matrix P (void) const; friend ostream& operator << (ostream& os, const ComplexQRP& a); private: Matrix p; }; inline ComplexQRP::ComplexQRP (const ComplexQRP& a) : ComplexQR (a) { p = a.p; } inline ComplexQRP& ComplexQRP::operator = (const ComplexQRP& a) { ComplexQR::operator = (a); p = a.p; return *this; } inline Matrix ComplexQRP::P (void) const { return p; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxSCHUR.h100666 415 17 4417 5702420306 15154 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexSCHUR_h) #define octave_ComplexSCHUR_h 1 class ostream; #include "CMatrix.h" extern "C++" { class ComplexSCHUR { friend class ComplexMatrix; public: ComplexSCHUR (void) {} ComplexSCHUR (const ComplexMatrix& a, const char *ord); ComplexSCHUR (const ComplexMatrix& a, const char *ord, int& info); ComplexSCHUR (const ComplexSCHUR& a, const char *ord); ComplexSCHUR& operator = (const ComplexSCHUR& a); ComplexMatrix schur_matrix (void) const; ComplexMatrix unitary_matrix (void) const; friend ostream& operator << (ostream& os, const ComplexSCHUR& a); private: int init (const ComplexMatrix& a, const char *ord); ComplexMatrix schur_mat; ComplexMatrix unitary_mat; }; inline ComplexSCHUR::ComplexSCHUR (const ComplexMatrix& a, const char *ord) { init (a,ord); } inline ComplexSCHUR::ComplexSCHUR (const ComplexMatrix& a, const char *ord, int& info) { info = init (a,ord); } inline ComplexSCHUR::ComplexSCHUR (const ComplexSCHUR& a, const char *ord) { schur_mat = a.schur_mat; unitary_mat = a.unitary_mat; } inline ComplexSCHUR& ComplexSCHUR::operator = (const ComplexSCHUR& a) { schur_mat = a.schur_mat; unitary_mat = a.unitary_mat; return *this; } inline ComplexMatrix ComplexSCHUR::schur_matrix (void) const { return schur_mat; } inline ComplexMatrix ComplexSCHUR::unitary_matrix (void) const { return unitary_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/CmplxSVD.h100666 415 17 4753 5702420306 14727 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ComplexSVD_h) #define octave_ComplexSVD_h 1 class ostream; #include "dDiagMatrix.h" #include "CMatrix.h" #include "dbleSVD.h" extern "C++" { class ComplexSVD { friend class ComplexMatrix; public: ComplexSVD (void) {} ComplexSVD (const ComplexMatrix& a, SVD::type svd_type = SVD::std); ComplexSVD (const ComplexMatrix& a, int& info, SVD::type svd_type = SVD::std); ComplexSVD (const ComplexSVD& a); ComplexSVD& operator = (const ComplexSVD& a); DiagMatrix singular_values (void) const; ComplexMatrix left_singular_matrix (void) const; ComplexMatrix right_singular_matrix (void) const; friend ostream& operator << (ostream& os, const ComplexSVD& a); private: int init (const ComplexMatrix& a, SVD::type svd_type = SVD::std); DiagMatrix sigma; ComplexMatrix left_sm; ComplexMatrix right_sm; }; inline ComplexSVD::ComplexSVD (const ComplexMatrix& a, SVD::type svd_type) { init (a, svd_type); } inline ComplexSVD::ComplexSVD (const ComplexMatrix& a, int& info, SVD::type svd_type) { info = init (a, svd_type); } inline ComplexSVD::ComplexSVD (const ComplexSVD& a) { sigma = a.sigma; left_sm = a.left_sm; right_sm = a.right_sm; } inline ComplexSVD& ComplexSVD::operator = (const ComplexSVD& a) { sigma = a.sigma; left_sm = a.left_sm; right_sm = a.right_sm; return *this; } inline DiagMatrix ComplexSVD::singular_values (void) const { return sigma; } inline ComplexMatrix ComplexSVD::left_singular_matrix (void) const { return left_sm; } inline ComplexMatrix ComplexSVD::right_singular_matrix (void) const { return right_sm; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/EIG.h100666 415 17 4215 5702420304 13662 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_EIG_h) #define octave_EIG_h 1 class ostream; #include "dMatrix.h" #include "CMatrix.h" #include "CColVector.h" extern "C++" { class EIG { friend class Matrix; friend class ComplexMatrix; public: EIG (void) {} EIG (const Matrix& a); EIG (const Matrix& a, int& info); EIG (const ComplexMatrix& a); EIG (const ComplexMatrix& a, int& info); EIG (const EIG& a); EIG& operator = (const EIG& a); ComplexColumnVector eigenvalues (void) const; ComplexMatrix eigenvectors (void) const; friend ostream& operator << (ostream& os, const EIG& a); private: int init (const Matrix& a); int init (const ComplexMatrix& a); ComplexColumnVector lambda; ComplexMatrix v; }; inline EIG::EIG (const Matrix& a) { init (a); } inline EIG::EIG (const Matrix& a, int& info) { info = init (a); } inline EIG::EIG (const ComplexMatrix& a) { init (a); } inline EIG::EIG (const ComplexMatrix& a, int& info) { info = init (a); } inline EIG::EIG (const EIG& a) { lambda = a.lambda; v = a.v; } inline EIG& EIG::operator = (const EIG& a) { lambda = a.lambda; v = a.v; return *this; } inline ComplexColumnVector EIG::eigenvalues (void) const { return lambda; } inline ComplexMatrix EIG::eigenvectors (void) const { return v; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dColVector.h100666 415 17 10511 5702420270 15340 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_ColumnVector_h) #define octave_ColumnVector_h 1 #include "Array.h" #include "mx-defs.h" extern "C++" { class ColumnVector : public Array { friend class Matrix; friend class RowVector; friend class ComplexColumnVector; public: ColumnVector (void) : Array () { } ColumnVector (int n) : Array (n) { } ColumnVector (int n, double val) : Array (n, val) { } ColumnVector (const Array& a) : Array (a) { } ColumnVector (const ColumnVector& a) : Array (a) { } // ColumnVector (double a) : Array (1, a) { } ColumnVector& operator = (const ColumnVector& a) { Array::operator = (a); return *this; } // operator Array& () const { return *this; } int operator == (const ColumnVector& a) const; int operator != (const ColumnVector& a) const; // destructive insert/delete/reorder operations ColumnVector& insert (const ColumnVector& a, int r); ColumnVector& fill (double val); ColumnVector& fill (double val, int r1, int r2); ColumnVector stack (const ColumnVector& a) const; RowVector transpose (void) const; // resize is the destructive equivalent for this one ColumnVector extract (int r1, int r2) const; // column vector by column vector -> column vector operations ColumnVector& operator += (const ColumnVector& a); ColumnVector& operator -= (const ColumnVector& a); // column vector by scalar -> column vector operations friend ComplexColumnVector operator + (const ColumnVector& a, const Complex& s); friend ComplexColumnVector operator - (const ColumnVector& a, const Complex& s); friend ComplexColumnVector operator * (const ColumnVector& a, const Complex& s); friend ComplexColumnVector operator / (const ColumnVector& a, const Complex& s); // scalar by column vector -> column vector operations friend ComplexColumnVector operator + (const Complex& s, const ColumnVector& a); friend ComplexColumnVector operator - (const Complex& s, const ColumnVector& a); friend ComplexColumnVector operator * (const Complex& s, const ColumnVector& a); friend ComplexColumnVector operator / (const Complex& s, const ColumnVector& a); // column vector by row vector -> matrix operations friend Matrix operator * (const ColumnVector& a, const RowVector& a); friend ComplexMatrix operator * (const ColumnVector& a, const ComplexRowVector& b); // column vector by column vector -> column vector operations friend ComplexColumnVector operator + (const ComplexColumnVector& a, const ComplexColumnVector& b); friend ComplexColumnVector operator - (const ComplexColumnVector& a, const ComplexColumnVector& b); friend ComplexColumnVector product (const ComplexColumnVector& a, const ComplexColumnVector& b); friend ComplexColumnVector quotient (const ComplexColumnVector& a, const ComplexColumnVector& b); // other operations friend ColumnVector map (d_d_Mapper f, const ColumnVector& a); void map (d_d_Mapper f); double min (void) const; double max (void) const; // i/o friend ostream& operator << (ostream& os, const ColumnVector& a); friend istream& operator >> (istream& is, ColumnVector& a); #define KLUDGE_VECTORS #define TYPE double #define KL_VEC_TYPE ColumnVector #include "mx-kludge.h" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE private: ColumnVector (double *d, int l) : Array (d, l) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dDiagMatrix.h100666 415 17 13044 5702420270 15475 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_DiagMatrix_h) #define octave_DiagMatrix_h 1 #include "Array.h" #include "dRowVector.h" #include "dColVector.h" #include "mx-defs.h" extern "C++" { class DiagMatrix : public DiagArray { friend class SVD; friend class ComplexSVD; friend class ComplexDiagMatrix; public: DiagMatrix (void) : DiagArray () { } DiagMatrix (int n) : DiagArray (n) { } DiagMatrix (int n, double val) : DiagArray (n, val) { } DiagMatrix (int r, int c) : DiagArray (r, c) { } DiagMatrix (int r, int c, double val) : DiagArray (r, c, val) { } DiagMatrix (const RowVector& a) : DiagArray (a) { } DiagMatrix (const ColumnVector& a) : DiagArray (a) { } DiagMatrix (const DiagArray& a) : DiagArray (a) { } DiagMatrix (const DiagMatrix& a) : DiagArray (a) { } // DiagMatrix (double a) : DiagArray (1, a) { } DiagMatrix& operator = (const DiagMatrix& a) { DiagArray::operator = (a); return *this; } // operator DiagArray& () const { return *this; } int operator == (const DiagMatrix& a) const; int operator != (const DiagMatrix& a) const; DiagMatrix& fill (double val); DiagMatrix& fill (double val, int beg, int end); DiagMatrix& fill (const ColumnVector& a); DiagMatrix& fill (const RowVector& a); DiagMatrix& fill (const ColumnVector& a, int beg); DiagMatrix& fill (const RowVector& a, int beg); DiagMatrix transpose (void) const; // resize is the destructive analog for this one Matrix extract (int r1, int c1, int r2, int c2) const; // extract row or column i. RowVector row (int i) const; RowVector row (char *s) const; ColumnVector column (int i) const; ColumnVector column (char *s) const; DiagMatrix inverse (void) const; DiagMatrix inverse (int& info) const; // diagonal matrix by diagonal matrix -> diagonal matrix operations DiagMatrix& operator += (const DiagMatrix& a); DiagMatrix& operator -= (const DiagMatrix& a); // diagonal matrix by scalar -> matrix operations friend Matrix operator + (const DiagMatrix& a, double s); friend Matrix operator - (const DiagMatrix& a, double s); friend ComplexMatrix operator + (const DiagMatrix& a, const Complex& s); friend ComplexMatrix operator - (const DiagMatrix& a, const Complex& s); // diagonal matrix by scalar -> diagonal matrix operations friend ComplexDiagMatrix operator * (const DiagMatrix& a, const Complex& s); friend ComplexDiagMatrix operator / (const DiagMatrix& a, const Complex& s); // scalar by diagonal matrix -> matrix operations friend Matrix operator + (double s, const DiagMatrix& a); friend Matrix operator - (double s, const DiagMatrix& a); friend ComplexMatrix operator + (const Complex& s, const DiagMatrix& a); friend ComplexMatrix operator - (const Complex& s, const DiagMatrix& a); // scalar by diagonal matrix -> diagonal matrix operations friend ComplexDiagMatrix operator * (const Complex& s, const DiagMatrix& a); // diagonal matrix by column vector -> column vector operations friend ColumnVector operator * (const DiagMatrix& a, const ColumnVector& b); friend ComplexColumnVector operator * (const DiagMatrix& a, const ComplexColumnVector& b); // diagonal matrix by diagonal matrix -> diagonal matrix operations friend DiagMatrix operator * (const DiagMatrix& a, const DiagMatrix& b); friend ComplexDiagMatrix operator + (const DiagMatrix& a, const ComplexDiagMatrix& b); friend ComplexDiagMatrix operator - (const DiagMatrix& a, const ComplexDiagMatrix& b); friend ComplexDiagMatrix operator * (const DiagMatrix& a, const ComplexDiagMatrix& b); friend ComplexDiagMatrix product (const DiagMatrix& a, const ComplexDiagMatrix& b); // diagonal matrix by matrix -> matrix operations friend Matrix operator + (const DiagMatrix& a, const Matrix& b); friend Matrix operator - (const DiagMatrix& a, const Matrix& b); friend Matrix operator * (const DiagMatrix& a, const Matrix& b); friend ComplexMatrix operator + (const DiagMatrix& a, const ComplexMatrix& b); friend ComplexMatrix operator - (const DiagMatrix& a, const ComplexMatrix& b); friend ComplexMatrix operator * (const DiagMatrix& a, const ComplexMatrix& b); // other operations ColumnVector diag (void) const; ColumnVector diag (int k) const; // i/o friend ostream& operator << (ostream& os, const DiagMatrix& a); #define KLUDGE_DIAG_MATRICES #define TYPE double #define KL_DMAT_TYPE DiagMatrix #include "mx-kludge.h" #undef KLUDGE_DIAG_MATRICES #undef TYPE #undef KL_DMAT_TYPE private: DiagMatrix (double *d, int nr, int nc) : DiagArray (d, nr, nc) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dMatrix.h100666 415 17 20170 5702420267 14714 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_Matrix_int_h) #define octave_Matrix_int_h 1 // For FILE... #include #include "Array.h" #include "mx-defs.h" extern "C++" { class Matrix : public Array2 { friend class ColumnVector; friend class AEPBAL; friend class CHOL; friend class GEPBAL; friend class HESS; friend class LU; friend class QR; friend class QRP; friend class SCHUR; friend class SVD; friend class ComplexMatrix; public: Matrix (void) : Array2 () { } Matrix (int r, int c) : Array2 (r, c) { } Matrix (int r, int c, double val) : Array2 (r, c, val) { } Matrix (const Array2& a) : Array2 (a) { } Matrix (const Matrix& a) : Array2 (a) { } Matrix (const DiagArray& a) : Array2 (a) { } Matrix (const DiagMatrix& a); // Matrix (double a) : Array2 (1, 1, a) { } Matrix& operator = (const Matrix& a) { Array2::operator = (a); return *this; } int operator == (const Matrix& a) const; int operator != (const Matrix& a) const; // destructive insert/delete/reorder operations Matrix& insert (const Matrix& a, int r, int c); Matrix& insert (const RowVector& a, int r, int c); Matrix& insert (const ColumnVector& a, int r, int c); Matrix& insert (const DiagMatrix& a, int r, int c); Matrix& fill (double val); Matrix& fill (double val, int r1, int c1, int r2, int c2); Matrix append (const Matrix& a) const; Matrix append (const RowVector& a) const; Matrix append (const ColumnVector& a) const; Matrix append (const DiagMatrix& a) const; Matrix stack (const Matrix& a) const; Matrix stack (const RowVector& a) const; Matrix stack (const ColumnVector& a) const; Matrix stack (const DiagMatrix& a) const; Matrix transpose (void) const; // resize is the destructive equivalent for this one Matrix extract (int r1, int c1, int r2, int c2) const; // extract row or column i. RowVector row (int i) const; RowVector row (char *s) const; ColumnVector column (int i) const; ColumnVector column (char *s) const; Matrix inverse (void) const; Matrix inverse (int& info) const; Matrix inverse (int& info, double& rcond) const; Matrix pseudo_inverse (double tol = 0.0); ComplexMatrix fourier (void) const; ComplexMatrix ifourier (void) const; ComplexMatrix fourier2d (void) const; ComplexMatrix ifourier2d (void) const; DET determinant (void) const; DET determinant (int& info) const; DET determinant (int& info, double& rcond) const; Matrix solve (const Matrix& b) const; Matrix solve (const Matrix& b, int& info) const; Matrix solve (const Matrix& b, int& info, double& rcond) const; ComplexMatrix solve (const ComplexMatrix& b) const; ComplexMatrix solve (const ComplexMatrix& b, int& info) const; ComplexMatrix solve (const ComplexMatrix& b, int& info, double& rcond) const; ColumnVector solve (const ColumnVector& b) const; ColumnVector solve (const ColumnVector& b, int& info) const; ColumnVector solve (const ColumnVector& b, int& info, double& rcond) const; ComplexColumnVector solve (const ComplexColumnVector& b) const; ComplexColumnVector solve (const ComplexColumnVector& b, int& info) const; ComplexColumnVector solve (const ComplexColumnVector& b, int& info, double& rcond) const; Matrix lssolve (const Matrix& b) const; Matrix lssolve (const Matrix& b, int& info) const; Matrix lssolve (const Matrix& b, int& info, int& rank) const; ComplexMatrix lssolve (const ComplexMatrix& b) const; ComplexMatrix lssolve (const ComplexMatrix& b, int& info) const; ComplexMatrix lssolve (const ComplexMatrix& b, int& info, int& rank) const; ColumnVector lssolve (const ColumnVector& b) const; ColumnVector lssolve (const ColumnVector& b, int& info) const; ColumnVector lssolve (const ColumnVector& b, int& info, int& rank) const; ComplexColumnVector lssolve (const ComplexColumnVector& b) const; ComplexColumnVector lssolve (const ComplexColumnVector& b, int& info) const; ComplexColumnVector lssolve (const ComplexColumnVector& b, int& info, int& rank) const; Matrix& operator += (const Matrix& a); Matrix& operator -= (const Matrix& a); Matrix& operator += (const DiagMatrix& a); Matrix& operator -= (const DiagMatrix& a); // unary operations Matrix operator ! (void) const; // matrix by scalar -> matrix operations friend ComplexMatrix operator + (const Matrix& a, const Complex& s); friend ComplexMatrix operator - (const Matrix& a, const Complex& s); friend ComplexMatrix operator * (const Matrix& a, const Complex& s); friend ComplexMatrix operator / (const Matrix& a, const Complex& s); // scalar by matrix -> matrix operations friend ComplexMatrix operator + (const Complex& s, const Matrix& a); friend ComplexMatrix operator - (const Complex& s, const Matrix& a); friend ComplexMatrix operator * (const Complex& s, const Matrix& a); friend ComplexMatrix operator / (const Complex& s, const Matrix& a); // matrix by column vector -> column vector operations friend ColumnVector operator * (const Matrix& a, const ColumnVector& b); friend ComplexColumnVector operator * (const Matrix& a, const ComplexColumnVector& b); // matrix by diagonal matrix -> matrix operations friend Matrix operator + (const Matrix& a, const DiagMatrix& b); friend Matrix operator - (const Matrix& a, const DiagMatrix& b); friend Matrix operator * (const Matrix& a, const DiagMatrix& b); friend ComplexMatrix operator + (const Matrix& a, const ComplexDiagMatrix& b); friend ComplexMatrix operator - (const Matrix& a, const ComplexDiagMatrix& b); friend ComplexMatrix operator * (const Matrix& a, const ComplexDiagMatrix& b); // matrix by matrix -> matrix operations friend Matrix operator * (const Matrix& a, const Matrix& b); friend ComplexMatrix operator * (const Matrix& a, const ComplexMatrix& b); friend ComplexMatrix operator + (const Matrix& a, const ComplexMatrix& b); friend ComplexMatrix operator - (const Matrix& a, const ComplexMatrix& b); friend ComplexMatrix product (const Matrix& a, const ComplexMatrix& b); friend ComplexMatrix quotient (const Matrix& a, const ComplexMatrix& b); // other operations friend Matrix map (d_d_Mapper f, const Matrix& a); void map (d_d_Mapper f); Matrix all (void) const; Matrix any (void) const; Matrix cumprod (void) const; Matrix cumsum (void) const; Matrix prod (void) const; Matrix sum (void) const; Matrix sumsq (void) const; ColumnVector diag (void) const; ColumnVector diag (int k) const; ColumnVector row_min (void) const; ColumnVector row_min_loc (void) const; ColumnVector row_max (void) const; ColumnVector row_max_loc (void) const; RowVector column_min (void) const; RowVector column_min_loc (void) const; RowVector column_max (void) const; RowVector column_max_loc (void) const; // i/o friend ostream& operator << (ostream& os, const Matrix& a); friend istream& operator >> (istream& is, Matrix& a); int read (FILE *fptr, char *type); int write (FILE *fptr, char *type); // Until templates really work with g++: #define KLUDGE_MATRICES #define TYPE double #define KL_MAT_TYPE Matrix #include "mx-kludge.h" #undef KLUDGE_MATRICES #undef TYPE #undef KL_MAT_TYPE private: Matrix (double *d, int r, int c) : Array2 (d, r, c) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dRowVector.h100666 415 17 10312 5702420267 15377 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_RowVector_h) #define octave_RowVector_h 1 #include "Array.h" #include "mx-defs.h" extern "C++" { class RowVector : public Array { friend class ColumnVector; friend class ComplexRowVector; public: RowVector (void) : Array () { } RowVector (int n) : Array (n) { } RowVector (int n, double val) : Array (n, val) { } RowVector (const Array& a) : Array (a) { } RowVector (const RowVector& a) : Array (a) { } // RowVector (double a) : Array (1, a) { } RowVector& operator = (const RowVector& a) { Array::operator = (a); return *this; } // operator Array& () const { return *this; } int operator == (const RowVector& a) const; int operator != (const RowVector& a) const; // destructive insert/delete/reorder operations RowVector& insert (const RowVector& a, int c); RowVector& fill (double val); RowVector& fill (double val, int c1, int c2); RowVector append (const RowVector& a) const; ColumnVector transpose (void) const; // resize is the destructive equivalent for this one RowVector extract (int c1, int c2) const; // row vector by row vector -> row vector operations RowVector& operator += (const RowVector& a); RowVector& operator -= (const RowVector& a); // row vector by scalar -> row vector operations friend ComplexRowVector operator + (const RowVector& a, const Complex& s); friend ComplexRowVector operator - (const RowVector& a, const Complex& s); friend ComplexRowVector operator * (const RowVector& a, const Complex& s); friend ComplexRowVector operator / (const RowVector& a, const Complex& s); // scalar by row vector -> row vector operations friend ComplexRowVector operator + (const Complex& s, const RowVector& a); friend ComplexRowVector operator - (const Complex& s, const RowVector& a); friend ComplexRowVector operator * (const Complex& s, const RowVector& a); friend ComplexRowVector operator / (const Complex& s, const RowVector& a); // row vector by column vector -> scalar friend double operator * (const RowVector& a, const ColumnVector& b); friend Complex operator * (const RowVector& a, const ComplexColumnVector& b); // row vector by matrix -> row vector friend RowVector operator * (const RowVector& a, const Matrix& b); friend ComplexRowVector operator * (const RowVector& a, const ComplexMatrix& b); // row vector by row vector -> row vector operations friend ComplexRowVector operator + (const RowVector& a, const ComplexRowVector& b); friend ComplexRowVector operator - (const RowVector& a, const ComplexRowVector& b); friend ComplexRowVector product (const RowVector& a, const ComplexRowVector& b); friend ComplexRowVector quotient (const RowVector& a, const ComplexRowVector& b); // other operations friend RowVector map (d_d_Mapper f, const RowVector& a); void map (d_d_Mapper f); double min (void) const; double max (void) const; // i/o friend ostream& operator << (ostream& os, const RowVector& a); friend istream& operator >> (istream& is, RowVector& a); #define KLUDGE_VECTORS #define TYPE double #define KL_VEC_TYPE RowVector #include "mx-kludge.h" #undef KLUDGE_VECTORS #undef TYPE #undef KL_VEC_TYPE private: RowVector (double *d, int l) : Array (d, l) { } }; } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleAEPBAL.h100666 415 17 4011 5702420266 15032 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_AEPBALANCE_h) #define octave_AEPBALANCE_h 1 class ostream; #include "dMatrix.h" extern "C++" { class AEPBALANCE { friend class Matrix; public: AEPBALANCE (void) {} AEPBALANCE (const Matrix& a, const char *balance_job); AEPBALANCE (const AEPBALANCE& a); AEPBALANCE& operator = (const AEPBALANCE& a); Matrix balanced_matrix (void) const; Matrix balancing_matrix (void) const; friend ostream& operator << (ostream& os, const AEPBALANCE& a); private: int init (const Matrix& a, const char * balance_job); Matrix balanced_mat; Matrix balancing_mat; }; inline AEPBALANCE::AEPBALANCE (const Matrix& a,const char * balance_job) { init (a, balance_job); } inline AEPBALANCE::AEPBALANCE (const AEPBALANCE& a) { balanced_mat = a.balanced_mat; balancing_mat = a.balancing_mat; } inline AEPBALANCE& AEPBALANCE::operator = (const AEPBALANCE& a) { balanced_mat = a.balanced_mat; balancing_mat = a.balancing_mat; return *this; } inline Matrix AEPBALANCE::balanced_matrix (void) const { return balanced_mat; } inline Matrix AEPBALANCE::balancing_matrix (void) const { return balancing_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleCHOL.h100666 415 17 3255 5702420266 14644 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_CHOL_h) #define octave_CHOL_h 1 class ostream; #include "dMatrix.h" extern "C++" { class CHOL { friend class Matrix; public: CHOL (void) {} CHOL (const Matrix& a); CHOL (const Matrix& a, int& info); CHOL (const CHOL& a); CHOL& operator = (const CHOL& a); Matrix chol_matrix (void) const; friend ostream& operator << (ostream& os, const CHOL& a); private: int init (const Matrix& a); Matrix chol_mat; }; inline CHOL::CHOL (const Matrix& a) { init (a); } inline CHOL::CHOL (const Matrix& a, int& info) { info = init (a); } inline CHOL::CHOL (const CHOL& a) { chol_mat = a.chol_mat; } inline CHOL& CHOL::operator = (const CHOL& a) { chol_mat = a.chol_mat; return *this; } inline Matrix CHOL::chol_matrix (void) const { return chol_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleDET.h100666 415 17 3223 5702420266 14526 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_DET_h) #define octave_DET_h 1 class ostream; extern "C++" { class DET { friend class Matrix; public: DET (void); DET (const DET& a); DET& operator = (const DET& a); int value_will_overflow (void) const; int value_will_underflow (void) const; double coefficient (void) const; int exponent (void) const; double value (void) const; friend ostream& operator << (ostream& os, const DET& a); private: DET (const double *d); double det [2]; }; inline DET::DET (void) { } inline DET::DET (const DET& a) { det[0] = a.det[0]; det[1] = a.det[1]; } inline DET& DET::operator = (const DET& a) { det[0] = a.det[0]; det[1] = a.det[1]; return *this; } inline DET::DET (const double *d) { det[0] = d[0]; det[1] = d[1]; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleGEPBAL.h100666 415 17 5164 5702420265 15051 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_GEPBALANCE_h) #define octave_GEPBALANCE_h 1 class ostream; #include "dMatrix.h" extern "C++" { class GEPBALANCE { friend class Matrix; public: GEPBALANCE (void) {} GEPBALANCE (const Matrix& a, const Matrix &, const char *balance_job); GEPBALANCE (const GEPBALANCE& a); GEPBALANCE& operator = (const GEPBALANCE& a); Matrix balanced_a_matrix (void) const; Matrix balanced_b_matrix (void) const; Matrix left_balancing_matrix (void) const; Matrix right_balancing_matrix (void) const; friend ostream& operator << (ostream& os, const GEPBALANCE& a); private: int init (const Matrix& a, const Matrix& b, const char * balance_job); Matrix balanced_a_mat; Matrix balanced_b_mat; Matrix left_balancing_mat; Matrix right_balancing_mat; }; inline GEPBALANCE::GEPBALANCE (const Matrix& a, const Matrix& b, const char * balance_job) { init (a, b, balance_job); } inline GEPBALANCE::GEPBALANCE (const GEPBALANCE& a) { balanced_a_mat = a.balanced_a_mat; balanced_b_mat = a.balanced_b_mat; left_balancing_mat = a.left_balancing_mat; right_balancing_mat = a.right_balancing_mat; } inline GEPBALANCE& GEPBALANCE::operator = (const GEPBALANCE& a) { balanced_a_mat = a.balanced_a_mat; balanced_b_mat = a.balanced_b_mat; left_balancing_mat = a.left_balancing_mat; right_balancing_mat = a.right_balancing_mat; return *this; } inline Matrix GEPBALANCE::balanced_a_matrix (void) const { return balanced_a_mat; } inline Matrix GEPBALANCE::balanced_b_matrix (void) const { return balanced_b_mat; } inline Matrix GEPBALANCE::left_balancing_matrix (void) const { return left_balancing_mat; } inline Matrix GEPBALANCE::right_balancing_matrix (void) const { return right_balancing_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleHESS.h100666 415 17 3631 5702420265 14656 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_HESS_h) #define octave_HESS_h 1 class ostream; #include "dMatrix.h" extern "C++" { class HESS { friend class Matrix; public: HESS (void) {} HESS (const Matrix& a); HESS (const Matrix&a, int& info); HESS (const HESS& a); HESS& operator = (const HESS& a); Matrix hess_matrix (void) const; Matrix unitary_hess_matrix (void) const; friend ostream& operator << (ostream& os, const HESS& a); private: int init (const Matrix& a); Matrix hess_mat; Matrix unitary_hess_mat; }; inline HESS::HESS (const Matrix& a) { init (a); } inline HESS::HESS (const Matrix& a, int& info) { info = init (a); } inline HESS::HESS (const HESS& a) { hess_mat = a.hess_mat; unitary_hess_mat = a.unitary_hess_mat; } inline HESS& HESS::operator = (const HESS& a) { hess_mat = a.hess_mat; unitary_hess_mat = a.unitary_hess_mat; return *this; } inline Matrix HESS::hess_matrix (void) const { return hess_mat; } inline Matrix HESS::unitary_hess_matrix (void) const { return unitary_hess_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleLU.h100666 415 17 3151 5702420264 14430 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_LU_h) #define octave_LU_h 1 class ostream; #include "dMatrix.h" extern "C++" { class LU { friend class Matrix; public: LU (void) {} LU (const Matrix& a); LU (const LU& a); LU& operator = (const LU& a); Matrix L (void) const; Matrix U (void) const; Matrix P (void) const; friend ostream& operator << (ostream& os, const LU& a); private: Matrix l; Matrix u; Matrix p; }; inline LU::LU (const LU& a) { l = a.l; u = a.u; p = a.p; } inline LU& LU::operator = (const LU& a) { l = a.l; u = a.u; p = a.p; return *this; } inline Matrix LU::L (void) const { return l; } inline Matrix LU::U (void) const { return u; } inline Matrix LU::P (void) const { return p; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleQR.h100666 415 17 3077 5702420264 14441 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_QR_h) #define octave_QR_h 1 class ostream; #include "dMatrix.h" extern "C++" { class QR { public: enum type { std, raw, economy, }; QR (void) {} QR (const Matrix& A, type qr_type = QR::std); QR (const QR& a); QR& operator = (const QR& a); Matrix Q (void) const; Matrix R (void) const; friend ostream& operator << (ostream& os, const QR& a); protected: Matrix q; Matrix r; }; inline QR::QR (const QR& a) { q = a.q; r = a.r; } inline QR& QR::operator = (const QR& a) { q = a.q; r = a.r; return *this; } inline Matrix QR::Q (void) const { return q; } inline Matrix QR::R (void) const { return r; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleQRP.h100666 415 17 2720 5702420263 14552 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_QRP_h) #define octave_QRP_h 1 class ostream; #include "dbleQR.h" extern "C++" { class QRP : public QR { public: QRP (void) {} QRP (const Matrix& A, QR::type qr_type = QR::std); QRP (const QRP& a); QRP& operator = (const QRP& a); Matrix P (void) const; friend ostream& operator << (ostream& os, const QRP& a); private: Matrix p; }; inline QRP::QRP (const QRP& a) : QR (a) { p = a.p; } inline QRP& QRP::operator = (const QRP& a) { QR::operator = (a); p = a.p; return *this; } inline Matrix QRP::P (void) const { return p; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleSCHUR.h100666 415 17 4027 5702420263 14776 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_SCHUR_h) #define octave_SCHUR_h 1 class ostream; #include "dMatrix.h" extern "C++" { class SCHUR { friend class Matrix; public: SCHUR (void) {} SCHUR (const Matrix& a, const char *ord); SCHUR (const Matrix& a, const char *ord, int& info); SCHUR (const SCHUR& a, const char *ord); SCHUR& operator = (const SCHUR& a); Matrix schur_matrix (void) const; Matrix unitary_matrix (void) const; friend ostream& operator << (ostream& os, const SCHUR& a); private: int init (const Matrix& a, const char *ord); Matrix schur_mat; Matrix unitary_mat; }; inline SCHUR::SCHUR (const Matrix& a, const char *ord) { init (a, ord); } inline SCHUR::SCHUR (const Matrix& a, const char *ord, int& info) { info = init (a, ord); } inline SCHUR::SCHUR (const SCHUR& a, const char *ord) { schur_mat = a.schur_mat; unitary_mat = a.unitary_mat; } inline SCHUR& SCHUR::operator = (const SCHUR& a) { schur_mat = a.schur_mat; unitary_mat = a.unitary_mat; return *this; } inline Matrix SCHUR::schur_matrix (void) const { return schur_mat; } inline Matrix SCHUR::unitary_matrix (void) const { return unitary_mat; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/dbleSVD.h100666 415 17 4372 5702420262 14550 0ustar jweusers// -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_SVD_h) #define octave_SVD_h 1 class ostream; #include "dDiagMatrix.h" #include "dMatrix.h" extern "C++" { class SVD { friend class Matrix; public: enum type { std, economy, }; SVD (void) {} SVD (const Matrix& a, SVD::type svd_type = SVD::std); SVD (const Matrix& a, int& info, SVD::type svd_type = SVD::std); SVD (const SVD& a); SVD& operator = (const SVD& a); DiagMatrix singular_values (void) const; Matrix left_singular_matrix (void) const; Matrix right_singular_matrix (void) const; friend ostream& operator << (ostream& os, const SVD& a); private: int init (const Matrix& a, SVD::type svd_type = SVD::std); DiagMatrix sigma; Matrix left_sm; Matrix right_sm; }; inline SVD::SVD (const Matrix& a, SVD::type svd_type) { init (a, svd_type); } inline SVD::SVD (const Matrix& a, int& info, SVD::type svd_type) { info = init (a, svd_type); } inline SVD::SVD (const SVD& a) { sigma = a.sigma; left_sm = a.left_sm; right_sm = a.right_sm; } inline SVD& SVD::operator = (const SVD& a) { sigma = a.sigma; left_sm = a.left_sm; right_sm = a.right_sm; return *this; } inline DiagMatrix SVD::singular_values (void) const { return sigma; } inline Matrix SVD::left_singular_matrix (void) const { return left_sm; } inline Matrix SVD::right_singular_matrix (void) const { return right_sm; } } // extern "C++" #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/MArray.cc100666 415 17 25054 5702420527 14642 0ustar jweusers// MArray.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "MArray.h" #include "lo-error.h" // Nothing like a little CPP abuse to brighten everyone's day. Would // have been nice to do this with template functions but as of 2.5.x, // g++ seems to fail to resolve them properly. #define DO_VS_OP(OP) \ int l = a.length (); \ T *result = 0; \ if (l > 0) \ { \ result = new T [l]; \ const T *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = x[i] OP s; \ } #define DO_SV_OP(OP) \ int l = a.length (); \ T *result = 0; \ if (l > 0) \ { \ result = new T [l]; \ const T *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = s OP x[i]; \ } #define DO_VV_OP(OP) \ T *result = 0; \ if (l > 0) \ { \ result = new T [l]; \ const T *x = a.data (); \ const T *y = b.data (); \ for (int i = 0; i < l; i++) \ result[i] = x[i] OP y[i]; \ } #define NEG_V \ int l = a.length (); \ T *result = 0; \ if (l > 0) \ { \ result = new T [l]; \ const T *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = -x[i]; \ } /* * One dimensional array with math ops. */ // Element by element MArray by scalar ops. template MArray operator + (const MArray& a, const T& s) { DO_VS_OP (+); return MArray (result, l); } template MArray operator - (const MArray& a, const T& s) { DO_VS_OP (-); return MArray (result, l); } template MArray operator * (const MArray& a, const T& s) { DO_VS_OP (*); return MArray (result, l); } template MArray operator / (const MArray& a, const T& s) { DO_VS_OP (/); return MArray (result, l); } // Element by element scalar by MArray ops. template MArray operator + (const T& s, const MArray& a) { DO_SV_OP (+); return MArray (result, l); } template MArray operator - (const T& s, const MArray& a) { DO_SV_OP (-); return MArray (result, l); } template MArray operator * (const T& s, const MArray& a) { DO_SV_OP (*); return MArray (result, l); } template MArray operator / (const T& s, const MArray& a) { DO_SV_OP (/); return MArray (result, l); } // Element by element MArray by MArray ops. template MArray operator + (const MArray& a, const MArray& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array addition attempted"); return MArray (); } if (l == 0) return MArray (); DO_VV_OP (+); return MArray (result, l); } template MArray operator - (const MArray& a, const MArray& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array subtraction attempted"); return MArray (); } if (l == 0) return MArray (); DO_VV_OP (-); return MArray (result, l); } template MArray product (const MArray& a, const MArray& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array product attempted"); return MArray (); } if (l == 0) return MArray (); DO_VV_OP (*); return MArray (result, l); } template MArray quotient (const MArray& a, const MArray& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array quotient attempted"); return MArray (); } if (l == 0) return MArray (); DO_VV_OP (/); return MArray (result, l); } // Unary MArray ops. template MArray operator - (const MArray& a) { NEG_V; return MArray (result, l); } /* * Two dimensional array with math ops. */ template MArray2::MArray2 (const MDiagArray& a) : Array2 (a.rows (), a.cols (), T (0)) { for (int i = 0; i < a.length (); i++) elem (i, i) = a.elem (i, i); } // Element by element MArray2 by scalar ops. template MArray2 operator + (const MArray2& a, const T& s) { DO_VS_OP (+); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator - (const MArray2& a, const T& s) { DO_VS_OP (-); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator * (const MArray2& a, const T& s) { DO_VS_OP (*); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator / (const MArray2& a, const T& s) { DO_VS_OP (/); return MArray2 (result, a.rows (), a.cols ()); } // Element by element scalar by MArray2 ops. template MArray2 operator + (const T& s, const MArray2& a) { DO_SV_OP (+); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator - (const T& s, const MArray2& a) { DO_SV_OP (-); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator * (const T& s, const MArray2& a) { DO_SV_OP (*); return MArray2 (result, a.rows (), a.cols ()); } template MArray2 operator / (const T& s, const MArray2& a) { DO_SV_OP (/); return MArray2 (result, a.rows (), a.cols ()); } // Element by element MArray2 by MArray2 ops. template MArray2 operator + (const MArray2& a, const MArray2& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array addition attempted"); return MArray2 (); } if (r == 0 || c == 0) return MArray2 (); int l = a.length (); DO_VV_OP (+); return MArray2 (result, r, c); } template MArray2 operator - (const MArray2& a, const MArray2& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array subtraction attempted"); return MArray2 (); } if (r == 0 || c == 0) return MArray2 (); int l = a.length (); DO_VV_OP (-); return MArray2 (result, r, c); } template MArray2 product (const MArray2& a, const MArray2& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array product attempted"); return MArray2 (); } if (r == 0 || c == 0) return MArray2 (); int l = a.length (); DO_VV_OP (*); return MArray2 (result, r, c); } template MArray2 quotient (const MArray2& a, const MArray2& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array quotient attempted"); return MArray2 (); } if (r == 0 || c == 0) return MArray2 (); int l = a.length (); DO_VV_OP (/); return MArray2 (result, r, c); } // Unary MArray2 ops. template MArray2 operator - (const MArray2& a) { NEG_V; return MArray2 (result, a.rows (), a.cols ()); } /* * Two dimensional diagonal array with math ops. */ // Element by element MDiagArray by scalar ops. template MDiagArray operator * (const MDiagArray& a, const T& s) { DO_VS_OP (*); return MDiagArray (result, a.rows (), a.cols ()); } template MDiagArray operator / (const MDiagArray& a, const T& s) { DO_VS_OP (/); return MDiagArray (result, a.rows (), a.cols ()); } // Element by element scalar by MDiagArray ops. template MDiagArray operator * (const T& s, const MDiagArray& a) { DO_SV_OP (*); return MDiagArray (result, a.rows (), a.cols ()); } // Element by element MDiagArray by MDiagArray ops. template MDiagArray operator + (const MDiagArray& a, const MDiagArray& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array addition attempted"); return MDiagArray (); } if (c == 0 || r == 0) return MDiagArray (); int l = a.length (); DO_VV_OP (+); return MDiagArray (result, r, c); } template MDiagArray operator - (const MDiagArray& a, const MDiagArray& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array subtraction attempted"); return MDiagArray (); } if (c == 0 || r == 0) return MDiagArray (); int l = a.length (); DO_VV_OP (-); return MDiagArray (result, r, c); } template MDiagArray product (const MDiagArray& a, const MDiagArray& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array product attempted"); return MDiagArray (); } if (c == 0 || r == 0) return MDiagArray (); int l = a.length (); DO_VV_OP (*); return MDiagArray (result, r, c); } // Unary MDiagArray ops. template MDiagArray operator - (const MDiagArray& a) { NEG_V; return MDiagArray (result, a.rows (), a.cols ()); } #undef DO_SV_OP #undef DO_VS_OP #undef DO_VV_OP #undef NEG_V #if 0 #ifdef OCTAVE typedefMArray octave_mad_template_type; typedefMArray2 octave_ma2d_template_type; typedefMDiagArray octave_mdad_template_type; #include typedefMArray octave_mac_template_type; typedefMArray2 octave_ma2c_template_type; typedefMDiagArray octave_mdac_template_type; #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-kludge.cc100666 415 17 23452 5702420536 15344 0ustar jweusers// kludge.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Nothing like a little CPP abuse to brighten everyone's day. Would // have been nice to do this with template functions but as of 2.5.x, // g++ seems to fail in various ways, either not resolving general // template functions, or not instantiating non-member template // functions. // // When templates work more reliably in g++, this will be replaced by // the MArray class. #define DO_VS_OP(OP) \ int l = a.length (); \ TYPE *result = 0; \ if (l > 0) \ { \ result = new TYPE [l]; \ const TYPE *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = x[i] OP s; \ } #define DO_SV_OP(OP) \ int l = a.length (); \ TYPE *result = 0; \ if (l > 0) \ { \ result = new TYPE [l]; \ const TYPE *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = s OP x[i]; \ } #define DO_VV_OP(OP) \ TYPE *result = 0; \ if (l > 0) \ { \ result = new TYPE [l]; \ const TYPE *x = a.data (); \ const TYPE *y = b.data (); \ for (int i = 0; i < l; i++) \ result[i] = x[i] OP y[i]; \ } #define NEG_V \ int l = a.length (); \ TYPE *result = 0; \ if (l > 0) \ { \ result = new TYPE [l]; \ const TYPE *x = a.data (); \ for (int i = 0; i < l; i++) \ result[i] = -x[i]; \ } #ifdef KLUDGE_VECTORS /* * Like type operations for vectors. */ // Element by element vector by scalar ops. KL_VEC_TYPE operator + (const KL_VEC_TYPE& a, const TYPE& s) { DO_VS_OP (+); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator - (const KL_VEC_TYPE& a, const TYPE& s) { DO_VS_OP (-); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator * (const KL_VEC_TYPE& a, const TYPE& s) { DO_VS_OP (*); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator / (const KL_VEC_TYPE& a, const TYPE& s) { DO_VS_OP (/); return KL_VEC_TYPE (result, l); } // Element by element scalar by vector ops. KL_VEC_TYPE operator + (const TYPE& s, const KL_VEC_TYPE& a) { DO_SV_OP (+); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator - (const TYPE& s, const KL_VEC_TYPE& a) { DO_SV_OP (-); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator * (const TYPE& s, const KL_VEC_TYPE& a) { DO_SV_OP (*); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator / (const TYPE& s, const KL_VEC_TYPE& a) { DO_SV_OP (/); return KL_VEC_TYPE (result, l); } // Element by element vector by vector ops. KL_VEC_TYPE operator + (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array addition attempted"); return KL_VEC_TYPE (); } if (l == 0) return KL_VEC_TYPE (); DO_VV_OP (+); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE operator - (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array subtraction attempted"); return KL_VEC_TYPE (); } if (l == 0) return KL_VEC_TYPE (); DO_VV_OP (-); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE product (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array product attempted"); return KL_VEC_TYPE (); } if (l == 0) return KL_VEC_TYPE (); DO_VV_OP (*); return KL_VEC_TYPE (result, l); } KL_VEC_TYPE quotient (const KL_VEC_TYPE& a, const KL_VEC_TYPE& b) { int l = a.length (); if (l != b.length ()) { (*current_liboctave_error_handler) ("nonconformant array quotient attempted"); return KL_VEC_TYPE (); } if (l == 0) return KL_VEC_TYPE (); DO_VV_OP (/); return KL_VEC_TYPE (result, l); } // Unary MArray ops. KL_VEC_TYPE operator - (const KL_VEC_TYPE& a) { NEG_V; return KL_VEC_TYPE (result, l); } #endif #ifdef KLUDGE_MATRICES /* * Like type operations for matrices */ // Element by element matrix by scalar ops. KL_MAT_TYPE operator + (const KL_MAT_TYPE& a, const TYPE& s) { DO_VS_OP (+); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator - (const KL_MAT_TYPE& a, const TYPE& s) { DO_VS_OP (-); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator * (const KL_MAT_TYPE& a, const TYPE& s) { DO_VS_OP (*); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator / (const KL_MAT_TYPE& a, const TYPE& s) { DO_VS_OP (/); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } // Element by element scalar by matrix ops. KL_MAT_TYPE operator + (const TYPE& s, const KL_MAT_TYPE& a) { DO_SV_OP (+); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator - (const TYPE& s, const KL_MAT_TYPE& a) { DO_SV_OP (-); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator * (const TYPE& s, const KL_MAT_TYPE& a) { DO_SV_OP (*); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } KL_MAT_TYPE operator / (const TYPE& s, const KL_MAT_TYPE& a) { DO_SV_OP (/); return KL_MAT_TYPE (result, a.rows (), a.cols ()); } // Element by element matrix by matrix ops. KL_MAT_TYPE operator + (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array addition attempted"); return KL_MAT_TYPE (); } if (r == 0 || c == 0) return KL_MAT_TYPE (r, c); int l = a.length (); DO_VV_OP (+); return KL_MAT_TYPE (result, r, c); } KL_MAT_TYPE operator - (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array subtraction attempted"); return KL_MAT_TYPE (); } if (r == 0 || c == 0) return KL_MAT_TYPE (r, c); int l = a.length (); DO_VV_OP (-); return KL_MAT_TYPE (result, r, c); } KL_MAT_TYPE product (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array product attempted"); return KL_MAT_TYPE (); } if (r == 0 || c == 0) return KL_MAT_TYPE (r, c); int l = a.length (); DO_VV_OP (*); return KL_MAT_TYPE (result, r, c); } KL_MAT_TYPE quotient (const KL_MAT_TYPE& a, const KL_MAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant array quotient attempted"); return KL_MAT_TYPE (); } if (r == 0 || c == 0) return KL_MAT_TYPE (r, c); int l = a.length (); DO_VV_OP (/); return KL_MAT_TYPE (result, r, c); } // Unary matrix ops. KL_MAT_TYPE operator - (const KL_MAT_TYPE& a) { NEG_V; return KL_MAT_TYPE (result, a.rows (), a.cols ()); } #endif #ifdef KLUDGE_DIAG_MATRICES /* * Like type operations for diagonal matrices. */ // Element by element MDiagArray by scalar ops. KL_DMAT_TYPE operator * (const KL_DMAT_TYPE& a, const TYPE& s) { DO_VS_OP (*); return KL_DMAT_TYPE (result, a.rows (), a.cols ()); } KL_DMAT_TYPE operator / (const KL_DMAT_TYPE& a, const TYPE& s) { DO_VS_OP (/); return KL_DMAT_TYPE (result, a.rows (), a.cols ()); } // Element by element scalar by MDiagArray ops. KL_DMAT_TYPE operator * (const TYPE& s, const KL_DMAT_TYPE& a) { DO_SV_OP (*); return KL_DMAT_TYPE (result, a.rows (), a.cols ()); } // Element by element MDiagArray by MDiagArray ops. KL_DMAT_TYPE operator + (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array addition attempted"); return KL_DMAT_TYPE (); } if (c == 0 || r == 0) return KL_DMAT_TYPE (); int l = a.length (); DO_VV_OP (+); return KL_DMAT_TYPE (result, r, c); } KL_DMAT_TYPE operator - (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array subtraction attempted"); return KL_DMAT_TYPE (); } if (c == 0 || r == 0) return KL_DMAT_TYPE (); int l = a.length (); DO_VV_OP (-); return KL_DMAT_TYPE (result, r, c); } KL_DMAT_TYPE product (const KL_DMAT_TYPE& a, const KL_DMAT_TYPE& b) { int r = a.rows (); int c = a.cols (); if (r != b.rows () || c != b.cols ()) { (*current_liboctave_error_handler) ("nonconformant diagonal array product attempted"); return KL_DMAT_TYPE (); } if (c == 0 || r == 0) return KL_DMAT_TYPE (); int l = a.length (); DO_VV_OP (*); return KL_DMAT_TYPE (result, r, c); } // Unary MDiagArray ops. KL_DMAT_TYPE operator - (const KL_DMAT_TYPE& a) { NEG_V; return KL_DMAT_TYPE (result, a.rows (), a.cols ()); } #endif #undef DO_SV_OP #undef DO_VS_OP #undef DO_VV_OP #undef NEG_V /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/liboctave/mx-inlines.cc100666 415 17 35677 5702420315 15541 0ustar jweusers// Helper functions for matrix classes. -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include // But first, some helper functions... static inline double * add (const double *d, int len, double s) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = d[i] + s; } return result; } static inline double * subtract (const double *d, int len, double s) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = d[i] - s; } return result; } static inline double * subtract (double s, const double *d, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = s - d[i]; } return result; } static inline double * multiply (const double *d, int len, double s) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = d[i] * s; } return result; } static inline double * divide (const double *d, int len, double s) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = d[i] / s; } return result; } static inline double * divide (double s, const double *d, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = s / d[i]; } return result; } static inline double * add (const double *x, const double *y, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = x[i] + y[i]; } return result; } static inline double * subtract (const double *x, const double *y, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = x[i] - y[i]; } return result; } static inline double * multiply (const double *x, const double *y, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = x[i] * y[i]; } return result; } static inline double * divide (const double *x, const double *y, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = x[i] / y[i]; } return result; } static inline double * add2 (double *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] += y[i]; return x; } static inline double * subtract2 (double *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] -= y[i]; return x; } static inline double * negate (const double *d, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = -d[i]; } return result; } static inline void copy (double *d, int len, double s) { for (int i = 0; i < len; i++) d[i] = s; } static inline void copy (double *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] = y[i]; } static inline double * dup (const double *x, int len) { double *retval = 0; if (len > 0) { retval = new double [len]; for (int i = 0; i < len; i++) retval[i] = x[i]; } return retval; } static inline int equal (const double *x, const double *y, int len) { for (int i = 0; i < len; i++) if (x[i] != y[i]) return 0; return 1; } // And some for Complex too... static inline Complex * add (const Complex *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] + s; } return result; } static inline Complex * add (Complex s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s + d[i]; } return result; } static inline Complex * subtract (const Complex *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] - s; } return result; } static inline Complex * subtract (Complex s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s - d[i]; } return result; } static inline Complex * multiply (const Complex *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] * s; } return result; } static inline Complex * multiply (Complex s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s * d[i]; } return result; } static inline Complex * divide (const Complex *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] / s; } return result; } static inline Complex * divide (Complex s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s / d[i]; } return result; } static inline Complex * add (const Complex *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] + y[i]; } return result; } static inline Complex * subtract (const Complex *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] - y[i]; } return result; } static inline Complex * multiply (const Complex *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] * y[i]; } return result; } static inline Complex * divide (const Complex *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] / y[i]; } return result; } static inline Complex * add2 (Complex *x, const Complex *y, int len) { for (int i = 0; i < len; i++) x[i] += y[i]; return x; } static inline Complex * subtract2 (Complex *x, const Complex *y, int len) { for (int i = 0; i < len; i++) x[i] -= y[i]; return x; } static inline Complex * negate (const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = -d[i]; } return result; } static inline double * not (const Complex *d, int len) { double *result = 0; if (len > 0) { result = new double [len]; for (int i = 0; i < len; i++) result[i] = (d[i] == 0.0); } return result; } static inline void copy (Complex *d, int len, Complex s) { for (int i = 0; i < len; i++) d[i] = s; } static inline void copy (Complex *x, const Complex *y, int len) { for (int i = 0; i < len; i++) x[i] = y[i]; } static inline Complex * dup (const Complex *x, int len) { Complex *retval = 0; if (len > 0) { retval = new Complex [len]; for (int i = 0; i < len; i++) retval[i] = x[i]; } return retval; } static inline Complex * make_complex (const double *x, int len) { Complex *retval = 0; if (len > 0) { retval = new Complex [len]; for (int i = 0; i < len; i++) retval[i] = x[i]; } return retval; } static inline Complex * conj_dup (const Complex *x, int len) { Complex *retval = 0; if (len > 0) { retval = new Complex [len]; for (int i = 0; i < len; i++) retval[i] = conj (x[i]); } return retval; } static inline double * real_dup (const Complex *x, int len) { double *retval = 0; if (len > 0) { retval = new double [len]; for (int i = 0; i < len; i++) retval[i] = real (x[i]); } return retval; } static inline double * imag_dup (const Complex *x, int len) { double *retval = 0; if (len > 0) { retval = new double [len]; for (int i = 0; i < len; i++) retval[i] = imag (x[i]); } return retval; } static inline int equal (const Complex *x, const Complex *y, int len) { for (int i = 0; i < len; i++) if (x[i] != y[i]) return 0; return 1; } // And still some more for mixed Complex/double operations... static inline Complex * add (const Complex *d, int len, double s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] + s; } return result; } static inline Complex * add (const double *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] + s; } return result; } static inline Complex * add (double s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s + d[i]; } return result; } static inline Complex * add (Complex s, const double *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s + d[i]; } return result; } static inline Complex * subtract (const Complex *d, int len, double s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] - s; } return result; } static inline Complex * subtract (const double *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] - s; } return result; } static inline Complex * subtract (double s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s - d[i]; } return result; } static inline Complex * subtract (Complex s, const double *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s - d[i]; } return result; } static inline Complex * multiply (const Complex *d, int len, double s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] * s; } return result; } static inline Complex * multiply (const double *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] * s; } return result; } static inline Complex * divide (const Complex *d, int len, double s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] / s; } return result; } static inline Complex * divide (const double *d, int len, Complex s) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = d[i] / s; } return result; } static inline Complex * divide (double s, const Complex *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s / d[i]; } return result; } static inline Complex * divide (Complex s, const double *d, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = s / d[i]; } return result; } static inline Complex * add (const Complex *x, const double *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] + y[i]; } return result; } static inline Complex * add (const double *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] + y[i]; } return result; } static inline Complex * subtract (const Complex *x, const double *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] - y[i]; } return result; } static inline Complex * subtract (const double *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] - y[i]; } return result; } static inline Complex * multiply (const Complex *x, const double *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] * y[i]; } return result; } static inline Complex * multiply (const double *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] * y[i]; } return result; } static inline Complex * divide (const Complex *x, const double *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] / y[i]; } return result; } static inline Complex * divide (const double *x, const Complex *y, int len) { Complex *result = 0; if (len > 0) { result = new Complex [len]; for (int i = 0; i < len; i++) result[i] = x[i] / y[i]; } return result; } static inline Complex * add2 (Complex *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] += y[i]; return x; } static inline Complex * subtract2 (Complex *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] -= y[i]; return x; } static inline void copy (Complex *d, int len, double s) { for (int i = 0; i < len; i++) d[i] = s; } static inline void copy (Complex *x, const double *y, int len) { for (int i = 0; i < len; i++) x[i] = y[i]; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/info/ 40777 415 17 0 5705521705 12003 5ustar jweusersoctave-1.1.0/info/Makefile.in100666 415 17 14027 5662226326 14174 0ustar jweusers# Makefile for Octave's info directory. Adapted from the makefile for # texinfo/info. # # Copyright (C) 1993, 1994 Free Software Foundation, Inc. # # 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. #### Start of system configuration section. #### TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@:@srcdir@/../src include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ common = @srcdir@/../src MAKEINFO= makeinfo LDEFS = -DNAMED_FUNCTIONS=1 -DDEFAULT_INFOPATH='"$(DEFAULT_INFOPATH)"' TERMLIBS = @TERMLIBS@ LIBS = $(TERMLIBS) @LIBS@ LOADLIBES = $(LIBS) SHELL = /bin/sh #### End of system configuration section. #### SOURCES = dir.c display.c echo_area.c filesys.c info-utils.c info.c \ infodoc.c infomap.c m-x.c nodes.c search.c session.c \ signals.c terminal.c tilde.c window.c xmalloc.c indices.c \ makedoc.c nodemenu.c footnotes.c dribble.c variables.c gc.c \ error.c INCLUDES = display.h doc.h echo_area.h filesys.h general.h \ info-utils.h info.h infomap.h nodes.h search.h session.h \ signals.h termdep.h terminal.h tilde.h indices.h window.h \ footnotes.h dribble.h variables.h gc.h TEXI = info-stnd.texi info.texi userdoc.texi DISTFILES = Makefile.in README NEWS info.1 \ $(SOURCES) $(INCLUDES) $(TEXINFO) GETOPT_OBJS = getopt.o getopt1.o LIBOBJS = dir.o display.o doc.o echo_area.o filesys.o info-utils.o \ infodoc.o infomap.o m-x.o nodes.o search.o session.o signals.o \ terminal.o tilde.o window.o indices.o xmalloc.o nodemenu.o \ footnotes.o dribble.o variables.o gc.o error.o OBJECTS = info.o $(LIBOBJS) $(GETOPT_OBJS) # The names of files which declare info commands. CMDFILES = $(srcdir)/session.c $(srcdir)/echo_area.c $(srcdir)/infodoc.c \ $(srcdir)/m-x.c $(srcdir)/indices.c $(srcdir)/nodemenu.c \ $(srcdir)/footnotes.c $(srcdir)/variables.c # The name of the program which builds documentation structure from CMDFILES. MAKEDOC_OBJECTS = makedoc.o xmalloc.o MAKEDOC_SOURCE = makedoc.c xmalloc.c .c.o: $(CC) -c $(CPPFLAGS) $(LDEFS) -I$(common) $(UGLY_ALL_CFLAGS) $< all: libinfo.a # info.info info-stnd.info .PHONY: all sub-all: all .PHONY: sub-all install: all # $(INSTALL_PROGRAM) info $(datadir)/info # -d=$(srcdir); test -f ./info.info && d=.; \ # $(INSTALL_DATA) $$d/info.info $(infodir)/info.info # -d=$(srcdir); test -f ./info-stnd.info && d=.; \ # $(INSTALL_DATA) $$d/info-stnd.info $(infodir)/info-stnd.info # -$(INSTALL_DATA) $(srcdir)/info.1 $(mandir)/info.$(manext) .PHONY: install uninstall: # rm -f $(datadir)/info # rm -f $(infodir)/info.info # rm -f $(infodir)/info-stnd.info # rm -f $(mandir)/info.$(manext) .PHONY: uninstall libinfo.a: $(LIBOBJS) $(AR) $(ARFLAGS) libinfo.a $(LIBOBJS) $(RANLIB) libinfo.a info: $(OBJECTS) $(CC) $(LDFLAGS) -o info $(OBJECTS) $(LOADLIBES) info.info: info.texi $(MAKEINFO) --no-split -I$(srcdir) info.texi info-stnd.info: info-stnd.texi $(MAKEINFO) --no-split -I$(srcdir) info-stnd.texi makedoc: $(MAKEDOC_OBJECTS) $(CC) $(LDFLAGS) -o makedoc $(MAKEDOC_OBJECTS) $(LOADLIBES) clean: rm -f info funs.h doc.c makedoc $(OBJECTS) $(MAKEDOC_OBJECTS) distclean: clean texclean rm -f Makefile config.status *~ core core.* *.BAK TAGS mostlyclean: clean realclean: distclean rm -f funs.h doc.c rm -f info.info info-stnd.info local-dist: ln $(DISTFILES) ../`cat ../.fname`/info .PHONY: local-dist dist: ln $(DISTFILES) ../`cat ../.fname`/info .PHONY: dist TAGS: $(SOURCES) makedoc-TAGS etags $(SOURCES) cat makedoc-TAGS >>TAGS && rm -f makedoc-TAGS makedoc-TAGS: $(CMDFILES) ./makedoc -tags $(CMDFILES) >makedoc-TAGS texclean: rm -f *.toc *.aux *.log *.cp *.fn *.tp *.vr *.pg *.ky *.cps \ *.tps *.fns *.kys *.pgs *.vrs check: info # The files `doc.c' and `funs.h' are created by ./makedoc run over the source # files which contain DECLARE_INFO_COMMAND. `funs.h' is a header file # listing the functions found. `doc.c' is a structure containing pointers # to those functions along with completable names and documentation strings. funs.h: makedoc $(CMDFILES) -@if test -f funs.h; then mv -f funs.h old-funs.h; fi; : -@if test -f doc.c; then mv -f doc.c old-doc.c; fi; : ./makedoc $(CMDFILES) -@if cmp -s old-funs.h funs.h; then mv old-funs.h funs.h; \ else rm -f old-funs.h; fi; : -@if cmp -s old-doc.c doc.c; then mv old-doc.c doc.c; \ else rm -f old-doc.c; fi; : doc.c: funs.h dribble.o: dribble.c dribble.h display.o: display.c echo_area.o: echo_area.c filesys.o: filesys.c info-utils.o: info-utils.c info.o: info.c infodoc.o: infodoc.c infomap.o: infomap.c m-x.o: m-x.c nodes.o: nodes.c search.o: search.c session.o: session.c signals.o: signals.c terminal.o: terminal.c tilde.o: tilde.c window.o: window.c xmalloc.o: xmalloc.c indices.o: indices.c makedoc.o: makedoc.c dir.o: dir.c display.o: nodes.h info-utils.h search.h display.o: terminal.h window.h display.h echo_area.o: info.h filesys.o: general.h tilde.h filesys.h footnotes.o: footnotes.h info-utils.o: info-utils.h nodes.h search.h info.o: info.h $(common)/getopt.h infodoc.o: info.h doc.h infomap.o: infomap.h funs.h gc.o: info.h m-x.o: info.h nodes.o: search.h filesys.h nodes.o: nodes.h info-utils.h search.o: general.h search.h nodes.h session.o: info.h signals.o: info.h signals.h terminal.o: terminal.h termdep.h tilde.o: tilde.h variables.c: variables.h window.o: nodes.h window.h display.h window.o: info-utils.h search.h infomap.h # Prevent GNU make v3 from overflowing arg limit on SysV. .NOEXPORT: # eof octave-1.1.0/info/README100666 415 17 4171 5327624315 12764 0ustar jweusers Please Emacs, use -*- text -*- mode when editing this file. * The file RELEASE contains information about what has changed since the last release. * The file INSTALL contains instructions on how to install Info. (Type "./configure" and then "make".) This is the README file GNU Info version 2.8. This marks the first non-beta release. Thu Jan 21 14:50:52 1993 ---------------------------------------- Version 2.7 beta, Wed Dec 30 02:02:38 1992 Version 2.6 beta, Tue Dec 22 03:58:07 1992 Version 2.5 beta, Tue Dec 8 14:50:35 1992 Version 2.4 beta, Sat Nov 28 14:34:02 1992 Version 2.3 beta, Fri Nov 27 01:04:13 1992 Version 2.2 beta, Tue Nov 24 09:36:08 1992 Version 2.1 beta, Tue Nov 17 23:29:36 1992 Info 2.0 is a complete rewrite of the original standalone Info I wrote in 1987, the first program I wrote for rms. That program was something like my second Unix program ever, and my die-hard machine language coding habits tended to show through. I found the original Info hard to read and maintain, and thus decided to write this one. The rewrite consists of about 12,000 lines of code written in about 12 days. I believe this version of Info to be in much better shape than the original Info, and the only reason it is in Beta test is because of its short life span. Info 2.0 is substantially different from its original standalone predecessor. It appears almost identical to the GNU Emacs version, but has the advantages of smaller size, ease of portability, and a built in library which can be used in other programs (to get or display documentation from Info files, for example). I eagerly await responses to this newer version of Info; comments on its portability, ease of use and user interface, code quality, and general usefulness are all of interest to me, and I will appreciate any comments that you would care to make. A full listing of the commands available in Info can be gotten by typing `?' while within an Info window. This produces a node in a window which can be viewed just like any Info node. So, please send your comments, bug reports, and suggestions to bfox@ai.mit.edu Thanks for beta testing this software. octave-1.1.0/info/NEWS100666 415 17 15712 5325113142 12613 0ustar jweusersThis release of Info is version 2.8. Please read the file README. Changes since 2.5 beta: Note that versions 2.6 and 2.7 Beta were only released to a select group. * "info-" removed from the front of M-x commands. * Automatic footnote display. When you enter a node which contains footnotes, and the variable "automatic-footnotes" is "On", Info pops up a window containing the footnotes. Likewise, when you leave that node, the window containing the footnotes goes away. * Cleaner built in documentation, and documentation functions. Use: o `M-x describe-variable' to read a variable's documenation o `M-x describe-key' to find out what a particular keystroke does. o `M-x describe-function' to read a function's documentation. o `M-x where-is' to find out what keys invoke a particular function. * Info can "tile" the displayed windows (via "M-x tile-windows"). If the variable "automatic-tiling" is "On", then splitting a window or deleting a window causes the remaining windows to be retiled. * You can save every keystroke you type in a "dribble file" by using the `--dribble FILENAME' option. You can initially read keystrokes from an alternate input stream with `--restore FILENAME', or by redirecting input on the command line `info < old-dribble'. * New behaviour of menu items. If the label is the same as the target node name, and the node couldn't be found in the current file, treat the label as a file name. For example, a menu entry in "DIR" might contain: * Emacs:: Cool text-editor. Info would not find the node "(dir)Emacs", so just plain "(emacs)" would be tried. * New variable "ISO-Latin" allows you to use European machines with 8-bit character sets. * Cleanups in echo area reading, and redisplay. Cleanups in handling the window which shows possible completions. * Info can now read files that have been compressed. An array in filesys.c maps extensions to programs that can decompress stdin, and write the results to stdout. Currently, ".Z"/uncompress, ".z"/gunzip, and ".Y"/unyabba are supported. The modeline for a compressed file shows "zz" in it. * There is a new variable "gc-compressed-files" which, if non-zero, says it is okay to reclaim the file buffer space allocated to a file which was compressed, if, and only if, that file's contents do not appear in any history node. * New file `nodemenu.c' implements a few functions for manipulating previously visited nodes. `C-x C-b' (list-visited-nodes) produces a menu of the nodes that could be reached by info-history-node in some window. `C-x b' (select-visited-node) is similar, but reads one of the node names with completion. * Keystroke `M-r' (move_to_screen_line) allows the user to place the cursor at the start of a specific screen line. Without a numeric argument, place the cursor on the center line; with an arg, place the cursor on that line. * Interruptible display implemented. Basic display speedups and hacks. * The message "*** Tags Out of Date ***" now means what it says. * Index searching with `,' (info-index-next) has been improved. * When scrolling with C-v, C-M-v, or M-v, only "Page Only" scrolling will happen. * Continous scrolling (along with `]' (info-global-next) and `[' (info-global-prev) works better. `]' and `[' accept numeric arguments, moving that many nodes in that case. * `C-x w' (info-toggle-wrap) controls how lines wider than the width of the screen are displayed. If a line is too long, a `$' is displayed in the rightmost column of the window. * There are some new variables for controlling the behaviour of Info interactively. The current list of variables is as follows: Variable Name Default Value Description ------------- ------------- ----------- `automatic-footnotes' On When "On", footnotes appear and disappear automatically. `automatic-tiling' Off When "On", creating of deleting a window resizes other windows. `visible-bell' Off If non-zero, try to use a visible bell. `errors-ring-bell' On If non-zero, errors cause a ring. `show-index-match' On If non-zero, the portion of the string matched is highlighted by changing its case. `scroll-behaviour' Continuous One of "Continuous", "Next Only", or "Page Only". "Page Only" prevents you from scrolling past the bottom or top of a node. "Next Only" causes the Next or Prev node to be selected when you scroll past the bottom or top of a node. "Continous" moves linearly through the files hierchichal structure. `scroll-step' 0 Controls how scrolling is done for you when the cursor moves out of the current window. Non-zero means it is the number of lines you would like the screen to shift. A value of 0 means to center the line containing the cursor in the window. `gc-compressed-files' Off If non-zero means it is okay to reclaim the file buffer space allocated to a file which was compressed, if, and only if, that file's contents do not appear in the node list of any window. `ISO-Latin' Off Non-zero means that you are using an ISO Latin character set. By default, standard ASCII characters are assumed. ________________________________________ This release of Info is version 2.5 beta. Changes since 2.4 beta: * Index (i) and (,) commands fully implemented. * "configure" script now shipped with Info. * New function "set-variable" allows users to set various variables. * User-settable behaviour on end or beginning of node scrolling. This supercedes the SPC and DEL changes in 2.3 beta. ________________________________________ This release of Info is version 2.4 beta. Changes since 2.3 beta: * info-last-node now means move to the last node of this info file. * info-history-node means move backwards through this window's node history. * info-first-node moves to the first node in the Info file. This node is not necessarily "Top"! * SPC and DEL can select the Next or Prev node after printing an informative message when pressed at the end/beg of a node. ---------------------------------------- This release of Info is version 2.3 beta. Changes since 2.2 beta: * M-x command lines if NAMED_COMMANDS is #defined. Variable in Makefile. * Screen height changes made quite robust. * Interactive function "set-screen-height" implements user height changes. * Scrolling on some terminals is faster now. * C-l with numeric arguement is fixed. ---------------------------------------- This release of Info is version 2.2 beta. Changes since 2.0: * C-g can now interrupt multi-file searches. * Incremental search is fully implemented. * Loading large tag tables is much faster now. * makedoc.c replaces shell script, speeding incremental builds. * Scrolling in redisplay is implemented. * Recursive uses of the echo area made more robust. * Garbage collection of unreferenced nodes. octave-1.1.0/info/info.1100666 415 17 11052 5354504046 13133 0ustar jweusers.TH info 1 "7th December 1990" .SH NAME info \- GNU's hypertext system .SH SYNOPSIS .B info [ .B \-\-option-name option-value ] .B \menu-item... .SH COPYRIGHT .if n Copyright (C) 1989, 1993 Free Software Foundation, Inc. .if t Copyright \(co 1989, 1993 Free Software Foundation, Inc. .SH DESCRIPTION .LP The GNU project has a hypertext system called .I Info which allows the same source file to be either printed as a paper manual, or viewed using .B info. It is possible to use the .B info program from inside Emacs, or to use the stand-alone version described here. This manual page gives a brief summary of its capabilities. .SH OPTIONS .TP .B \-\-directory directory-path Add .B directory-path to the list of directory paths searched when .B info needs to find a file. You may issue .B \-\-directory multiple times. Alternatively, you may specify a value for the environment variable .B INFOPATH; if .B \-\-directory is not given, the value of .B INFOPATH is used. The value of .B INFOPATH is a colon separated list of directory names. If you do not supply either .B INFOPATH or .B \-\-directory-path, .B info uses a default path. .TP .B \-f filename Specify a particular .B info file to visit. By default, .B info visits the file .B dir; if you use this option, .B info will start with .B (FILENAME)Top as the first file and node. .TP .B \-n nodename Specify a particular node to visit in the initial file that .B info loads. This is especially useful in conjunction with .B \-\-file. You may specify .B \-\-node multiple times. .TP .B -o file Direct output to .B file instead of starting an interactive .B info session. .TP .B \-h Produce a relatively brief description of the available .B info options. .TP .B \-\-version Print the version information of .B info and exit. .TP .B menu-item .B info treats its remaining arguments as the names of menu items. The first argument is a menu item in the initial node visited, while the second argument is a menu item in the first argument's node. You can easily move to the node of your choice by specifying the menu names which describe the path to that node. For example, .B info emacs buffers first selects the menu item .B emacs in the node .B (dir)Top, and then selects the menu item .B buffers in the node .B (emacs)Top. .SH COMMANDS When in .B info the following commands are available: .TP .B h Invoke the Info tutorial. .TP .B ? Get a short summary of .B info commands. .TP .B h Select the .B info node from the main directory; this is much more complete than just using .B ?. .TP .B Ctrl-g Abort whatever you are doing. .TP .B Ctrl-l Redraw the screen. .PP Selecting other nodes: .TP .B n Move to the "next" node of this node. .TP .B p Move to the "previous" node of this node. .TP .B u Move to this node's "up" node. .TP .B m Pick a menu item specified by name. Picking a menu item causes another node to be selected. You do not need to type a complete nodename; if you type a few letters and then a space or tab .B info will will try to fill in the rest of the nodename. If you ask for further completion without typing any more characters you'll be given a list of possibilities; you can also get the list with .B ?. If you type a few characters and then hit return .B info will try to do a completion, and if it is ambigous use the first possibility. .TP .B f Follow a cross reference. You are asked for the name of the reference, using command completion as for .B m. .TP .B l Move to the last node you were at. .PP Moving within a node: .TP .B Space Scroll forward a page. .TP .B DEL Scroll backward a page. .TP .B b Go to the beginning of this node. .PP Advanced commands: .TP .B q Quit .B info. .TP .B 1 Pick first item in node's menu. .TP .B 2 \-\- 5 Pick second ... fifth item in node's menu. .TP .B g Move to node specified by name. You may include a filename as well, as .B (FILENAME)NODENAME. .TP .B s Search through this .B info file for a specified string, and select the node in which the next occurrence is found. .TP .B M-x print-node Pipe the contents of the current node through the command in the environment variable .B INFO_PRINT_COMMAND. If the variable does not exist, the node is simply piped to .B lpr. .SH ENVIRONMENT .TP .B INFOPATHS A colon-separated list of directories to search for .B info files. Used if .B \-\-directory is not given. .TP .B INFO_PRINT_COMMAND The command used for printing. .SH SEE ALSO .BR emacs (1) .SH AUTHOR .RS Brian Fox, Free Software Foundation .br bfox@ai.mit.edu .SH MANUAL AUTHOR .RS Robert Lupton; updated by Robert J. Chassell. .br rhl@astro.princeton.edu; bob@gnu.ai.mit.edu octave-1.1.0/info/dir.c100666 415 17 15060 5364072707 13050 0ustar jweusers/* dir.c -- How to build a special "dir" node from "localdir" files. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include #include #include "info-utils.h" #include "filesys.h" #include "tilde.h" /* The "dir" node can be built from the contents of a file called "dir", with the addition of the menus of every file called "localdir" found in INFOPATH. */ static void add_menu_to_file_buffer (), insert_text_into_fb_at_binding (); void maybe_build_dir_node (dirname, from_files_named) char *dirname; char *from_files_named; { FILE_BUFFER *dir_buffer; /* See if the file has already been loaded and exists. */ dir_buffer = info_find_file (dirname); /* If there is no "dir" in the current info path, we cannot build one from nothing. */ if (!dir_buffer) return; /* If this directory has already been built, return now. */ if (dir_buffer->flags & N_CannotGC) return; dir_buffer->flags |= N_CannotGC; /* For every file named FROM_FILES_NAMED in the search path, add the contents of that file's menu to our "dir" node. */ { struct stat finfo; char *this_dir; int namelen, path_index; int update_tags = 0; namelen = strlen (from_files_named); path_index = 0; /* Using each element of the path, check for "localdir". Do not check for "localdir.info.Z" or anything else. Only files explictly named "localdir" are eligible. This is a design decision. There can be an info file name "localdir.info" which contains information on the setting up of "localdir" files. */ while (this_dir = extract_colon_unit (infopath, &path_index)) { char *fullpath; int statable; /* Expand a leading tilde if one is present. */ if (*this_dir == '~') { char *tilde_expanded_dirname; tilde_expanded_dirname = tilde_expand_word (this_dir); free (this_dir); this_dir = tilde_expanded_dirname; } fullpath = (char *)xmalloc (3 + strlen (this_dir) + namelen); strcpy (fullpath, this_dir); if (fullpath[strlen (fullpath) - 1] != '/') strcat (fullpath, "/"); strcat (fullpath, from_files_named); statable = (stat (fullpath, &finfo) == 0); if (statable && S_ISREG (finfo.st_mode)) { long filesize; char *contents; contents = filesys_read_info_file (fullpath, &filesize, &finfo); if (contents) { update_tags++; add_menu_to_file_buffer (contents, filesize, dir_buffer); free (contents); } } free (fullpath); free (this_dir); } if (update_tags) build_tags_and_nodes (dir_buffer); } } /* Given CONTENTS and FB (a file buffer), add the menu found in CONTENTS to the menu found in FB->contents. Second argument SIZE is the total size of CONTENTS. */ static void add_menu_to_file_buffer (contents, size, fb) char *contents; long size; FILE_BUFFER *fb; { SEARCH_BINDING contents_binding, fb_binding; long contents_offset, fb_offset; contents_binding.buffer = contents; contents_binding.start = 0; contents_binding.end = size; contents_binding.flags = S_FoldCase | S_SkipDest; fb_binding.buffer = fb->contents; fb_binding.start = 0; fb_binding.end = fb->filesize; fb_binding.flags = S_FoldCase | S_SkipDest; /* Move to the start of the menus in CONTENTS and FB. */ contents_offset = search_forward (INFO_MENU_LABEL, &contents_binding); fb_offset = search_forward (INFO_MENU_LABEL, &fb_binding); /* If there is no menu in CONTENTS, quit now. */ if (contents_offset == -1) return; /* If there is no menu in FB, make one. */ if (fb_offset == -1) { /* Find the start of the second node in this file buffer. If there is only one node, we will be adding the contents to the end of this node. */ fb_offset = find_node_separator (&fb_binding); /* If not even a single node separator, give up. */ if (fb_offset == -1) return; fb_binding.start = fb_offset; fb_binding.start += skip_node_separator (fb_binding.buffer + fb_binding.start); /* Try to find the next node separator. */ fb_offset = find_node_separator (&fb_binding); /* If found one, consider that the start of the menu. Otherwise, the start of this menu is the end of the file buffer (i.e., fb->size). */ if (fb_offset != -1) fb_binding.start = fb_offset; else fb_binding.start = fb_binding.end; insert_text_into_fb_at_binding (fb, &fb_binding, INFO_MENU_LABEL, strlen (INFO_MENU_LABEL)); fb_binding.buffer = fb->contents; fb_binding.start = 0; fb_binding.end = fb->filesize; fb_offset = search_forward (INFO_MENU_LABEL, &fb_binding); if (fb_offset == -1) abort (); } /* CONTENTS_OFFSET and FB_OFFSET point to the starts of the menus that appear in their respective buffers. Add the remainder of CONTENTS to the end of FB's menu. */ fb_binding.start = fb_offset; fb_offset = find_node_separator (&fb_binding); if (fb_offset != -1) fb_binding.start = fb_offset; else fb_binding.start = fb_binding.end; insert_text_into_fb_at_binding (fb, &fb_binding, contents + contents_offset, size - contents_offset); } static void insert_text_into_fb_at_binding (fb, binding, text, textlen) FILE_BUFFER *fb; SEARCH_BINDING *binding; char *text; int textlen; { char *contents; long start, end; start = binding->start; end = fb->filesize; contents = (char *)xmalloc (fb->filesize + textlen + 1); memcpy (contents, fb->contents, start); memcpy (contents + start, text, textlen); memcpy (contents + start + textlen, fb->contents + start, end - start); free (fb->contents); fb->contents = contents; fb->filesize += textlen; fb->finfo.st_size = fb->filesize; } octave-1.1.0/info/display.c100666 415 17 40452 5336525665 13747 0ustar jweusers/* display.c -- How to display Info windows. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include #include "display.h" extern int info_any_buffered_input_p (); /* Found in session.c. */ static void free_display (); static DISPLAY_LINE **make_display (); /* An array of display lines which tell us what is currently visible on the display. */ DISPLAY_LINE **the_display = (DISPLAY_LINE **)NULL; /* Non-zero means do no output. */ int display_inhibited = 0; /* Initialize THE_DISPLAY to WIDTH and HEIGHT, with nothing in it. */ void display_initialize_display (width, height) int width, height; { free_display (the_display); the_display = make_display (width, height); display_clear_display (the_display); } /* Clear all of the lines in DISPLAY making the screen blank. */ void display_clear_display (display) DISPLAY_LINE **display; { register int i; register DISPLAY_LINE *display_line; for (i = 0; display_line = display[i]; i++) { display[i]->text[0] = '\0'; display[i]->textlen = 0; display[i]->inverse = 0; } } /* Non-zero if we didn't completely redisplay a window. */ int display_was_interrupted_p = 0; /* Update the windows pointed to by WINDOW in the_display. This actually writes the text on the screen. */ void display_update_display (window) WINDOW *window; { register WINDOW *win; display_was_interrupted_p = 0; /* For every window in the list, check contents against the display. */ for (win = window; win; win = win->next) { /* Only re-display visible windows which need updating. */ if (((win->flags & W_WindowVisible) == 0) || ((win->flags & W_UpdateWindow) == 0) || (win->height == 0)) continue; display_update_one_window (win); if (display_was_interrupted_p) break; } /* Always update the echo area. */ display_update_one_window (the_echo_area); } /* Display WIN on the_display. Unlike display_update_display (), this function only does one window. */ void display_update_one_window (win) WINDOW *win; { register char *nodetext; /* Current character to display. */ register char *last_node_char; /* Position of the last character in node. */ register int i; /* General use index. */ char *printed_line; /* Buffer for a printed line. */ int pl_index = 0; /* Index into PRINTED_LINE. */ int line_index = 0; /* Number of lines done so far. */ DISPLAY_LINE **display = the_display; /* If display is inhibited, that counts as an interrupted display. */ if (display_inhibited) display_was_interrupted_p = 1; /* If the window has no height, or display is inhibited, quit now. */ if (!win->height || display_inhibited) return; /* If the window's first row doesn't appear in the_screen, then it cannot be displayed. This can happen when the_echo_area is the window to be displayed, and the screen has shrunk to less than one line. */ if ((win->first_row < 0) || (win->first_row > the_screen->height)) return; /* Print each line in the window into our local buffer, and then check the contents of that buffer against the display. If they differ, update the display. */ printed_line = (char *)xmalloc (1 + win->width); if (!win->node || !win->line_starts) goto done_with_node_display; nodetext = win->line_starts[win->pagetop]; last_node_char = win->node->contents + win->node->nodelen; for (; nodetext < last_node_char; nodetext++) { char *rep, *rep_carried_over, rep_temp[2]; int replen; if (isprint (*nodetext)) { rep_temp[0] = *nodetext; replen = 1; rep_temp[1] = '\0'; rep = rep_temp; } else { if (*nodetext == '\r' || *nodetext == '\n') { replen = win->width - pl_index; } else { rep = printed_representation (*nodetext, pl_index); replen = strlen (rep); } } /* If this character can be printed without passing the width of the line, then stuff it into the line. */ if (replen + pl_index < win->width) { /* Optimize if possible. */ if (replen == 1) { printed_line[pl_index++] = *rep; } else { for (i = 0; i < replen; i++) printed_line[pl_index++] = rep[i]; } } else { DISPLAY_LINE *entry; /* If this character cannot be printed in this line, we have found the end of this line as it would appear on the screen. Carefully print the end of the line, and then compare. */ if (*nodetext == '\n' || *nodetext == '\r' || *nodetext == '\t') { printed_line[pl_index] = '\0'; rep_carried_over = (char *)NULL; } else { /* The printed representation of this character extends into the next line. Remember the offset of the last character printed out of REP so that we can carry the character over to the next line. */ for (i = 0; pl_index < (win->width - 1);) printed_line[pl_index++] = rep[i++]; rep_carried_over = rep + i; /* If printing the last character in this window couldn't possibly cause the screen to scroll, place a backslash in the rightmost column. */ if (1 + line_index + win->first_row < the_screen->height) { if (win->flags & W_NoWrap) printed_line[pl_index++] = '$'; else printed_line[pl_index++] = '\\'; } printed_line[pl_index] = '\0'; } /* We have the exact line as it should appear on the screen. Check to see if this line matches the one already appearing on the screen. */ entry = display[line_index + win->first_row]; /* If the screen line is inversed, then we have to clear the line from the screen first. Why, I don't know. */ if (entry->inverse) { terminal_goto_xy (0, line_index + win->first_row); terminal_clear_to_eol (); entry->inverse = 0; entry->text[0] = '\0'; entry->textlen = 0; } /* Find the offset where these lines differ. */ for (i = 0; i < pl_index; i++) if (printed_line[i] != entry->text[i]) break; /* If the lines are not the same length, or if they differed at all, we must do some redrawing. */ if ((i != pl_index) || (pl_index != entry->textlen)) { /* Move to the proper point on the terminal. */ terminal_goto_xy (i, line_index + win->first_row); /* If there is any text to print, print it. */ if (i != pl_index) terminal_put_text (printed_line + i); /* If the printed text didn't extend all the way to the edge of the window, and text was appearing between here and the edge of the window, clear from here to the end of the line. */ if ((pl_index < win->width && pl_index < entry->textlen) || (entry->inverse)) terminal_clear_to_eol (); fflush (stdout); /* Update the display text buffer. */ strcpy (entry->text + i, printed_line + i); entry->textlen = pl_index; /* Lines showing node text are not in inverse. Only modelines have that distinction. */ entry->inverse = 0; } /* We have done at least one line. Increment our screen line index, and check against the bottom of the window. */ if (++line_index == win->height) break; /* A line has been displayed, and the screen reflects that state. If there is typeahead pending, then let that typeahead be read now, instead of continuing with the display. */ if (info_any_buffered_input_p ()) { free (printed_line); display_was_interrupted_p = 1; return; } /* Reset PL_INDEX to the start of the line. */ pl_index = 0; /* If there are characters from REP left to print, stuff them into the buffer now. */ if (rep_carried_over) for (; rep[pl_index]; pl_index++) printed_line[pl_index] = rep[pl_index]; /* If this window has chosen not to wrap lines, skip to the end of the physical line in the buffer, and start a new line here. */ if (pl_index && (win->flags & W_NoWrap)) { char *begin; pl_index = 0; printed_line[0] = '\0'; begin = nodetext; while ((nodetext < last_node_char) && (*nodetext != '\n')) nodetext++; } } } done_with_node_display: /* We have reached the end of the node or the end of the window. If it is the end of the node, then clear the lines of the window from here to the end of the window. */ for (; line_index < win->height; line_index++) { DISPLAY_LINE *entry = display[line_index + win->first_row]; /* If this line has text on it then make it go away. */ if (entry && entry->textlen) { entry->textlen = 0; entry->text[0] = '\0'; terminal_goto_xy (0, line_index + win->first_row); terminal_clear_to_eol (); } } /* Finally, if this window has a modeline it might need to be redisplayed. Check the window's modeline against the one in the display, and update if necessary. */ if ((win->flags & W_InhibitMode) == 0) { window_make_modeline (win); line_index = win->first_row + win->height; /* This display line must both be in inverse, and have the same contents. */ if ((!display[line_index]->inverse) || (strcmp (display[line_index]->text, win->modeline) != 0)) { terminal_goto_xy (0, line_index); terminal_begin_inverse (); terminal_put_text (win->modeline); terminal_end_inverse (); strcpy (display[line_index]->text, win->modeline); display[line_index]->inverse = 1; display[line_index]->textlen = strlen (win->modeline); fflush (stdout); } } /* Okay, this window doesn't need updating anymore. */ win->flags &= ~W_UpdateWindow; free (printed_line); fflush (stdout); } /* Scroll the region of the_display starting at START, ending at END, and moving the lines AMOUNT lines. If AMOUNT is less than zero, the lines are moved up in the screen, otherwise down. Actually, it is possible for no scrolling to take place in the case that the terminal doesn't support it. This doesn't matter to us. */ void display_scroll_display (start, end, amount) int start, end, amount; { register int i, last; DISPLAY_LINE *temp; /* If this terminal cannot do scrolling, give up now. */ if (!terminal_can_scroll) return; /* If there isn't anything displayed on the screen because it is too small, quit now. */ if (!the_display[0]) return; /* If there is typeahead pending, then don't actually do any scrolling. */ if (info_any_buffered_input_p ()) return; /* Do it on the screen. */ terminal_scroll_terminal (start, end, amount); /* Now do it in the display buffer so our contents match the screen. */ if (amount > 0) { last = end + amount; /* Shift the lines to scroll right into place. */ for (i = 0; i < (end - start); i++) { temp = the_display[last - i]; the_display[last - i] = the_display[end - i]; the_display[end - i] = temp; } /* The lines have been shifted down in the buffer. Clear all of the lines that were vacated. */ for (i = start; i != (start + amount); i++) { the_display[i]->text[0] = '\0'; the_display[i]->textlen = 0; the_display[i]->inverse = 0; } } if (amount < 0) { last = start + amount; for (i = 0; i < (end - start); i++) { temp = the_display[last + i]; the_display[last + i] = the_display[start + i]; the_display[start + i] = temp; } /* The lines have been shifted up in the buffer. Clear all of the lines that are left over. */ for (i = end + amount; i != end; i++) { the_display[i]->text[0] = '\0'; the_display[i]->textlen = 0; the_display[i]->inverse = 0; } } } /* Try to scroll lines in WINDOW. OLD_PAGETOP is the pagetop of WINDOW before having had its line starts recalculated. OLD_STARTS is the list of line starts that used to appear in this window. OLD_COUNT is the number of lines that appear in the OLD_STARTS array. */ void display_scroll_line_starts (window, old_pagetop, old_starts, old_count) WINDOW *window; int old_pagetop, old_count; char **old_starts; { register int i, old, new; /* Indices into the line starts arrays. */ int last_new, last_old; /* Index of the last visible line. */ int old_first, new_first; /* Index of the first changed line. */ int unchanged_at_top = 0; int already_scrolled = 0; /* Locate the first line which was displayed on the old window. */ old_first = old_pagetop; new_first = window->pagetop; /* Find the last line currently visible in this window. */ last_new = window->pagetop + (window->height - 1); if (last_new > window->line_count) last_new = window->line_count - 1; /* Find the last line which used to be currently visible in this window. */ last_old = old_pagetop + (window->height - 1); if (last_old > old_count) last_old = old_count - 1; for (old = old_first, new = new_first; old < last_old && new < last_new; old++, new++) if (old_starts[old] != window->line_starts[new]) break; else unchanged_at_top++; /* Loop through the old lines looking for a match in the new lines. */ for (old = old_first + unchanged_at_top; old < last_old; old++) { for (new = new_first; new < last_new; new++) if (old_starts[old] == window->line_starts[new]) { /* Find the extent of the matching lines. */ for (i = 0; (old + i) < last_old; i++) if (old_starts[old + i] != window->line_starts[new + i]) break; /* Scroll these lines if there are enough of them. */ { int start, end, amount; start = (window->first_row + ((old + already_scrolled) - old_pagetop)); amount = new - (old + already_scrolled); end = window->first_row + window->height; /* If we are shifting the block of lines down, then the last AMOUNT lines will become invisible. Thus, don't bother scrolling them. */ if (amount > 0) end -= amount; if ((end - start) > 0) { display_scroll_display (start, end, amount); /* Some lines have been scrolled. Simulate the scrolling by offsetting the value of the old index. */ old += i; already_scrolled += amount; } } } } } /* Move the screen cursor to directly over the current character in WINDOW. */ void display_cursor_at_point (window) WINDOW *window; { int vpos, hpos; vpos = window_line_of_point (window) - window->pagetop + window->first_row; hpos = window_get_cursor_column (window); terminal_goto_xy (hpos, vpos); } /* **************************************************************** */ /* */ /* Functions Static to this File */ /* */ /* **************************************************************** */ /* Make a DISPLAY_LINE ** with width and height. */ static DISPLAY_LINE ** make_display (width, height) int width, height; { register int i; DISPLAY_LINE **display; display = (DISPLAY_LINE **)xmalloc ((1 + height) * sizeof (DISPLAY_LINE *)); for (i = 0; i < height; i++) { display[i] = (DISPLAY_LINE *)xmalloc (sizeof (DISPLAY_LINE)); display[i]->text = (char *)xmalloc (1 + width); display[i]->textlen = 0; display[i]->inverse = 0; } display[i] = (DISPLAY_LINE *)NULL; return (display); } /* Free the storage allocated to DISPLAY. */ static void free_display (display) DISPLAY_LINE **display; { register int i; register DISPLAY_LINE *display_line; if (!display) return; for (i = 0; display_line = display[i]; i++) { free (display_line->text); free (display_line); } free (display); } octave-1.1.0/info/echo_area.c100666 415 17 115761 5377234726 14236 0ustar jweusers/* echo_area.c -- How to read a line in the echo area. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* Non-zero means that C-g was used to quit reading input. */ int info_aborted_echo_area = 0; /* Non-zero means that the echo area is being used to read input. */ int echo_area_is_active = 0; /* The address of the last command executed in the echo area. */ VFunction *ea_last_executed_command = (VFunction *)NULL; /* Non-zero means that the last command executed while reading input killed some text. */ int echo_area_last_command_was_kill = 0; /* Variables which hold on to the current state of the input line. */ static char input_line[1 + EA_MAX_INPUT]; static char *input_line_prompt; static int input_line_point; static int input_line_beg; static int input_line_end; static NODE input_line_node = { (char *)NULL, (char *)NULL, (char *)NULL, input_line, EA_MAX_INPUT, 0 }; static void echo_area_initialize_node (); static void push_echo_area (), pop_echo_area (); static int echo_area_stack_depth (), echo_area_stack_contains_completions_p (); static void ea_kill_text (); /* Non-zero means we force the user to complete. */ static int echo_area_must_complete_p = 0; static int completions_window_p (); /* If non-null, this is a window which was specifically created to display possible completions output. We remember it so we can delete it when appropriate. */ static WINDOW *echo_area_completions_window = (WINDOW *)NULL; /* Variables which keep track of the window which was active prior to entering the echo area. */ static WINDOW *calling_window = (WINDOW *)NULL; static NODE *calling_window_node = (NODE *)NULL; static long calling_window_point = 0; static long calling_window_pagetop = 0; /* Remember the node and pertinent variables of the calling window. */ static void remember_calling_window (window) WINDOW *window; { /* Only do this if the calling window is not the completions window, or, if it is the completions window and there is no other window. */ if (!completions_window_p (window) || ((window == windows) && !(window->next))) { calling_window = window; calling_window_node = window->node; calling_window_point = window->point; calling_window_pagetop = window->pagetop; } } /* Restore the caller's window so that it shows the node that it was showing on entry to info_read_xxx_echo_area (). */ static void restore_calling_window () { register WINDOW *win, *compwin = (WINDOW *)NULL; /* If the calling window is still visible, and it is the window that we used for completions output, then restore the calling window. */ for (win = windows; win; win = win->next) { if (completions_window_p (win)) compwin = win; if (win == calling_window && win == compwin) { window_set_node_of_window (calling_window, calling_window_node); calling_window->point = calling_window_point; calling_window->pagetop = calling_window_pagetop; compwin = (WINDOW *)NULL; break; } } /* Delete the completions window if it is still present, it isn't the last window on the screen, and there aren't any prior echo area reads pending which created a completions window. */ if (compwin) { if ((compwin != windows || windows->next) && !echo_area_stack_contains_completions_p ()) { WINDOW *next; int pagetop, start, end, amount; next = compwin->next; if (next) { start = next->first_row; end = start + next->height; amount = - (compwin->height + 1); pagetop = next->pagetop; } info_delete_window_internal (compwin); /* This is not necessary because info_delete_window_internal () calls echo_area_inform_of_deleted_window (), which does the right thing. */ #if defined (UNNECESSARY) echo_area_completions_window = (WINDOW *)NULL; #endif /* UNNECESSARY */ if (next) { display_scroll_display (start, end, amount); next->pagetop = pagetop; display_update_display (windows); } } } } /* Set up a new input line with PROMPT. */ static void initialize_input_line (prompt) char *prompt; { input_line_prompt = prompt; if (prompt) strcpy (input_line, prompt); else input_line[0] = '\0'; input_line_beg = input_line_end = input_line_point = strlen (prompt); } static char * echo_area_after_read () { char *return_value; if (info_aborted_echo_area) { info_aborted_echo_area = 0; return_value = (char *)NULL; } else { if (input_line_beg == input_line_end) return_value = savestring (""); else { int line_len = input_line_end - input_line_beg; return_value = (char *) xmalloc (1 + line_len); strncpy (return_value, &input_line[input_line_beg], line_len); return_value[line_len] = '\0'; } } return (return_value); } /* Read a line of text in the echo area. Return a malloc ()'ed string, or NULL if the user aborted out of this read. WINDOW is the currently active window, so that we can restore it when we need to. PROMPT, if non-null, is a prompt to print before reading the line. */ char * info_read_in_echo_area (window, prompt) WINDOW *window; char *prompt; { char *line; /* If the echo area is already active, remember the current state. */ if (echo_area_is_active) push_echo_area (); /* Initialize our local variables. */ initialize_input_line (prompt); /* Initialize the echo area for the first (but maybe not the last) time. */ echo_area_initialize_node (); /* Save away the original node of this window, and the window itself, so echo area commands can temporarily use this window. */ remember_calling_window (window); /* Let the rest of Info know that the echo area is active. */ echo_area_is_active++; active_window = the_echo_area; /* Read characters in the echo area. */ info_read_and_dispatch (); echo_area_is_active--; /* Restore the original active window and show point in it. */ active_window = calling_window; restore_calling_window (); display_cursor_at_point (active_window); fflush (stdout); /* Get the value of the line. */ line = echo_area_after_read (); /* If there is a previous loop waiting for us, restore it now. */ if (echo_area_is_active) pop_echo_area (); /* Return the results to the caller. */ return (line); } /* (re) Initialize the echo area node. */ static void echo_area_initialize_node () { register int i; for (i = input_line_end; i < sizeof (input_line); i++) input_line[i] = ' '; input_line[i - 1] = '\n'; window_set_node_of_window (the_echo_area, &input_line_node); input_line[input_line_end] = '\n'; } /* Prepare to read characters in the echo area. This can initialize the echo area node, but its primary purpose is to side effect the input line buffer contents. */ void echo_area_prep_read () { if (the_echo_area->node != &input_line_node) echo_area_initialize_node (); the_echo_area->point = input_line_point; input_line[input_line_end] = '\n'; display_update_one_window (the_echo_area); display_cursor_at_point (active_window); } /* **************************************************************** */ /* */ /* Echo Area Movement Commands */ /* */ /* **************************************************************** */ DECLARE_INFO_COMMAND (ea_forward, "Move forward a character") { if (count < 0) ea_backward (window, -count, key); else { input_line_point += count; if (input_line_point > input_line_end) input_line_point = input_line_end; } } DECLARE_INFO_COMMAND (ea_backward, "Move backward a character") { if (count < 0) ea_forward (window, -count, key); else { input_line_point -= count; if (input_line_point < input_line_beg) input_line_point = input_line_beg; } } DECLARE_INFO_COMMAND (ea_beg_of_line, "Move to the start of this line") { input_line_point = input_line_beg; } DECLARE_INFO_COMMAND (ea_end_of_line, "Move to the end of this line") { input_line_point = input_line_end; } #define alphabetic(c) (islower (c) || isupper (c) || isdigit (c)) /* Move forward a word in the input line. */ DECLARE_INFO_COMMAND (ea_forward_word, "Move forward a word") { int c; if (count < 0) ea_backward_word (window, -count, key); else { while (count--) { if (input_line_point == input_line_end) return; /* If we are not in a word, move forward until we are in one. Then, move forward until we hit a non-alphabetic character. */ c = input_line[input_line_point]; if (!alphabetic (c)) { while (++input_line_point < input_line_end) { c = input_line[input_line_point]; if (alphabetic (c)) break; } } if (input_line_point == input_line_end) return; while (++input_line_point < input_line_end) { c = input_line[input_line_point]; if (!alphabetic (c)) break; } } } } DECLARE_INFO_COMMAND (ea_backward_word, "Move backward a word") { int c; if (count < 0) ea_forward_word (window, -count, key); else { while (count--) { if (input_line_point == input_line_beg) return; /* Like ea_forward_word (), except that we look at the characters just before point. */ c = input_line[input_line_point - 1]; if (!alphabetic (c)) { while (--input_line_point) { c = input_line[input_line_point - 1]; if (alphabetic (c)) break; } } while (input_line_point != input_line_beg) { c = input_line[input_line_point - 1]; if (!alphabetic (c)) break; else --input_line_point; } } } } DECLARE_INFO_COMMAND (ea_delete, "Delete the character under the cursor") { register int i; if (count < 0) ea_rubout (window, -count, key); else { if (input_line_point == input_line_end) return; if (info_explicit_arg || count > 1) { int orig_point; orig_point = input_line_point; ea_forward (window, count, key); ea_kill_text (orig_point, input_line_point); input_line_point = orig_point; } else { for (i = input_line_point; i < input_line_end; i++) input_line[i] = input_line[i + 1]; input_line_end--; } } } DECLARE_INFO_COMMAND (ea_rubout, "Delete the character behind the cursor") { if (count < 0) ea_delete (window, -count, key); else { int start; if (input_line_point == input_line_beg) return; start = input_line_point; ea_backward (window, count, key); if (info_explicit_arg || count > 1) ea_kill_text (start, input_line_point); else ea_delete (window, count, key); } } DECLARE_INFO_COMMAND (ea_abort, "Cancel or quit operation") { /* If any text, just discard it, and restore the calling window's node. If no text, quit. */ if (input_line_end != input_line_beg) { terminal_ring_bell (); input_line_end = input_line_point = input_line_beg; if (calling_window->node != calling_window_node) restore_calling_window (); } else info_aborted_echo_area = 1; } DECLARE_INFO_COMMAND (ea_newline, "Accept (or force completion of) this line") { /* Stub does nothing. Simply here to see if it has been executed. */ } DECLARE_INFO_COMMAND (ea_quoted_insert, "Insert next character verbatim") { unsigned char character; character = info_get_another_input_char (); ea_insert (window, count, character); } DECLARE_INFO_COMMAND (ea_insert, "Insert this character") { register int i; if ((input_line_end + 1) == EA_MAX_INPUT) { terminal_ring_bell (); return; } for (i = input_line_end + 1; i != input_line_point; i--) input_line[i] = input_line[i - 1]; input_line[input_line_point] = key; input_line_point++; input_line_end++; } DECLARE_INFO_COMMAND (ea_tab_insert, "Insert a TAB character") { ea_insert (window, count, '\t'); } /* Transpose the characters at point. If point is at the end of the line, then transpose the characters before point. */ DECLARE_INFO_COMMAND (ea_transpose_chars, "Transpose characters at point") { /* Handle conditions that would make it impossible to transpose characters. */ if (!count || !input_line_point || (input_line_end - input_line_beg) < 2) return; while (count) { int t; if (input_line_point == input_line_end) { t = input_line[input_line_point - 1]; input_line[input_line_point - 1] = input_line[input_line_point - 2]; input_line[input_line_point - 2] = t; } else { t = input_line[input_line_point]; input_line[input_line_point] = input_line[input_line_point - 1]; input_line[input_line_point - 1] = t; if (count < 0 && input_line_point != input_line_beg) input_line_point--; else input_line_point++; } if (count < 0) count++; else count--; } } /* **************************************************************** */ /* */ /* Echo Area Killing and Yanking */ /* */ /* **************************************************************** */ static char **kill_ring = (char **)NULL; static int kill_ring_index = 0; /* Number of kills appearing in KILL_RING. */ static int kill_ring_slots = 0; /* Number of slots allocated to KILL_RING. */ static int kill_ring_loc = 0; /* Location of current yank pointer. */ /* The largest number of kills that we remember at one time. */ static int max_retained_kills = 15; DECLARE_INFO_COMMAND (ea_yank, "Yank back the contents of the last kill") { register int i; register char *text; if (!kill_ring_index) { inform_in_echo_area ("Kill ring is empty"); return; } text = kill_ring[kill_ring_loc]; for (i = 0; text[i]; i++) ea_insert (window, 1, text[i]); } /* If the last command was yank, or yank_pop, and the text just before point is identical to the current kill item, then delete that text from the line, rotate the index down, and yank back some other text. */ DECLARE_INFO_COMMAND (ea_yank_pop, "Yank back a previous kill") { register int len; if (((ea_last_executed_command != ea_yank) && (ea_last_executed_command != ea_yank_pop)) || (kill_ring_index == 0)) return; len = strlen (kill_ring[kill_ring_loc]); /* Delete the last yanked item from the line. */ { register int i, counter; counter = input_line_end - input_line_point; for (i = input_line_point - len; counter; i++, counter--) input_line[i] = input_line[i + len]; input_line_end -= len; input_line_point -= len; } /* Get a previous kill, and yank that. */ kill_ring_loc--; if (kill_ring_loc < 0) kill_ring_loc = kill_ring_index - 1; ea_yank (window, count, key); } /* Delete the text from point to end of line. */ DECLARE_INFO_COMMAND (ea_kill_line, "Kill to the end of the line") { if (count < 0) { ea_kill_text (input_line_point, input_line_beg); input_line_point = input_line_beg; } else ea_kill_text (input_line_point, input_line_end); } /* Delete the text from point to beg of line. */ DECLARE_INFO_COMMAND (ea_backward_kill_line, "Kill to the beginning of the line") { if (count < 0) ea_kill_text (input_line_point, input_line_end); else { ea_kill_text (input_line_point, input_line_beg); input_line_point = input_line_beg; } } /* Delete from point to the end of the current word. */ DECLARE_INFO_COMMAND (ea_kill_word, "Kill the word following the cursor") { int orig_point = input_line_point; if (count < 0) ea_backward_kill_word (window, -count, key); else { ea_forward_word (window, count, key); if (input_line_point != orig_point) ea_kill_text (orig_point, input_line_point); input_line_point = orig_point; } } /* Delete from point to the start of the current word. */ DECLARE_INFO_COMMAND (ea_backward_kill_word, "Kill the word preceding the cursor") { int orig_point = input_line_point; if (count < 0) ea_kill_word (window, -count, key); else { ea_backward_word (window, count, key); if (input_line_point != orig_point) ea_kill_text (orig_point, input_line_point); } } /* The way to kill something. This appends or prepends to the last kill, if the last command was a kill command. If FROM is less than TO, then the killed text is appended to the most recent kill, otherwise it is prepended. If the last command was not a kill command, then a new slot is made for this kill. */ static void ea_kill_text (from, to) int from, to; { register int i, counter, distance; int killing_backwards, slot; char *killed_text; killing_backwards = (from > to); /* If killing backwards, reverse the values of FROM and TO. */ if (killing_backwards) { int temp = from; from = to; to = temp; } /* Remember the text that we are about to delete. */ distance = to - from; killed_text = (char *)xmalloc (1 + distance); strncpy (killed_text, &input_line[from], distance); killed_text[distance] = '\0'; /* Actually delete the text from the line. */ counter = input_line_end - to; for (i = from; counter; i++, counter--) input_line[i] = input_line[i + distance]; input_line_end -= distance; /* If the last command was a kill, append or prepend the killed text to the last command's killed text. */ if (echo_area_last_command_was_kill) { char *old, *new; slot = kill_ring_loc; old = kill_ring[slot]; new = (char *)xmalloc (1 + strlen (old) + strlen (killed_text)); if (killing_backwards) { /* Prepend TEXT to current kill. */ strcpy (new, killed_text); strcat (new, old); } else { /* Append TEXT to current kill. */ strcpy (new, old); strcat (new, killed_text); } free (old); free (killed_text); kill_ring[slot] = new; } else { /* Try to store the kill in a new slot, unless that would cause there to be too many remembered kills. */ slot = kill_ring_index; if (slot == max_retained_kills) slot = 0; if (slot + 1 > kill_ring_slots) kill_ring = (char **) xrealloc (kill_ring, (kill_ring_slots += max_retained_kills) * sizeof (char *)); if (slot != kill_ring_index) free (kill_ring[slot]); else kill_ring_index++; kill_ring[slot] = killed_text; kill_ring_loc = slot; } /* Notice that the last command was a kill. */ echo_area_last_command_was_kill++; } /* **************************************************************** */ /* */ /* Echo Area Completion */ /* */ /* **************************************************************** */ /* Pointer to an array of REFERENCE to complete over. */ static REFERENCE **echo_area_completion_items = (REFERENCE **)NULL; /* Sorted array of REFERENCE * which is the possible completions found in the variable echo_area_completion_items. If there is only one element, it is the only possible completion. */ static REFERENCE **completions_found = (REFERENCE **)NULL; static int completions_found_index = 0; static int completions_found_slots = 0; /* The lowest common denominator found while completing. */ static REFERENCE *LCD_completion; /* Internal functions used by the user calls. */ static void build_completions (), completions_must_be_rebuilt (); /* Variable which holds the output of completions. */ static NODE *possible_completions_output_node = (NODE *)NULL; static char *compwin_name = "*Completions*"; /* Return non-zero if WINDOW is a window used for completions output. */ static int completions_window_p (window) WINDOW *window; { int result = 0; if (internal_info_node_p (window->node) && (strcmp (window->node->nodename, compwin_name) == 0)) result = 1; return (result); } /* Workhorse for completion readers. If FORCE is non-zero, the user cannot exit unless the line read completes, or is empty. */ char * info_read_completing_internal (window, prompt, completions, force) WINDOW *window; char *prompt; REFERENCE **completions; int force; { char *line; /* If the echo area is already active, remember the current state. */ if (echo_area_is_active) push_echo_area (); echo_area_must_complete_p = force; /* Initialize our local variables. */ initialize_input_line (prompt); /* Initialize the echo area for the first (but maybe not the last) time. */ echo_area_initialize_node (); /* Save away the original node of this window, and the window itself, so echo area commands can temporarily use this window. */ remember_calling_window (window); /* Save away the list of items to complete over. */ echo_area_completion_items = completions; completions_must_be_rebuilt (); active_window = the_echo_area; echo_area_is_active++; /* Read characters in the echo area. */ while (1) { info_read_and_dispatch (); line = echo_area_after_read (); /* Force the completion to take place if the user hasn't accepted a default or aborted, and if FORCE is active. */ if (force && line && *line && completions) { register int i; build_completions (); /* If there is only one completion, then make the line be that completion. */ if (completions_found_index == 1) { free (line); line = savestring (completions_found[0]->label); break; } /* If one of the completions matches exactly, then that is okay, so return the current line. */ for (i = 0; i < completions_found_index; i++) if (stricmp (completions_found[i]->label, line) == 0) { free (line); line = savestring (completions_found[i]->label); break; } /* If no match, go back and try again. */ if (i == completions_found_index) { inform_in_echo_area ("Not complete"); continue; } } break; } echo_area_is_active--; /* Restore the original active window and show point in it. */ active_window = calling_window; restore_calling_window (); display_cursor_at_point (active_window); fflush (stdout); echo_area_completion_items = (REFERENCE **)NULL; completions_must_be_rebuilt (); /* If there is a previous loop waiting for us, restore it now. */ if (echo_area_is_active) pop_echo_area (); return (line); } /* Read a line in the echo area with completion over COMPLETIONS. */ char * info_read_completing_in_echo_area (window, prompt, completions) WINDOW *window; char *prompt; REFERENCE **completions; { return (info_read_completing_internal (window, prompt, completions, 1)); } /* Read a line in the echo area allowing completion over COMPLETIONS, but not requiring it. */ char * info_read_maybe_completing (window, prompt, completions) WINDOW *window; char *prompt; REFERENCE **completions; { return (info_read_completing_internal (window, prompt, completions, 0)); } DECLARE_INFO_COMMAND (ea_possible_completions, "List possible completions") { if (!echo_area_completion_items) { ea_insert (window, count, key); return; } build_completions (); if (!completions_found_index) { terminal_ring_bell (); inform_in_echo_area ("No completions"); } else if ((completions_found_index == 1) && (key != '?')) { inform_in_echo_area ("Sole completion"); } else { register int i, l; int limit, count, max_label = 0; initialize_message_buffer (); printf_to_message_buffer ("There %s %d ", completions_found_index == 1 ? "is" : "are", completions_found_index); printf_to_message_buffer ("completion%s:\n", completions_found_index == 1 ? "" : "s"); /* Find the maximum length of a label. */ for (i = 0; i < completions_found_index; i++) { int len = strlen (completions_found[i]->label); if (len > max_label) max_label = len; } max_label += 4; /* Find out how many columns we should print in. */ limit = calling_window->width / max_label; if (limit != 1 && (limit * max_label == calling_window->width)) limit--; /* Avoid a possible floating exception. If max_label > width then the limit will be 0 and a divide-by-zero fault will result. */ if (limit == 0) limit = 1; /* How many iterations of the printing loop? */ count = (completions_found_index + (limit - 1)) / limit; /* Watch out for special case. If the number of completions is less than LIMIT, then just do the inner printing loop. */ if (completions_found_index < limit) count = 1; /* Print the sorted items, up-and-down alphabetically. */ for (i = 0; i < count; i++) { register int j; for (j = 0, l = i; j < limit; j++) { if (l >= completions_found_index) break; else { char *label; int printed_length, k; label = completions_found[l]->label; printed_length = strlen (label); printf_to_message_buffer ("%s", label); if (j + 1 < limit) { for (k = 0; k < max_label - printed_length; k++) printf_to_message_buffer (" "); } } l += count; } printf_to_message_buffer ("\n"); } /* Make a new node to hold onto possible completions. Don't destroy dangling pointers. */ { NODE *temp; temp = message_buffer_to_node (); add_gcable_pointer (temp->contents); name_internal_node (temp, compwin_name); possible_completions_output_node = temp; } /* Find a suitable window for displaying the completions output. First choice is an existing window showing completions output. If there is only one window, and it is large, make another (smaller) window, and use that one. Otherwise, use the caller's window. */ { WINDOW *compwin; compwin = get_internal_info_window (compwin_name); if (!compwin) { /* If we can split the window to display most of the completion items, then do so. */ if (calling_window->height > (count * 2)) { int start, end, pagetop; active_window = calling_window; /* Perhaps we can scroll this window on redisplay. */ start = calling_window->first_row; pagetop = calling_window->pagetop; compwin = window_make_window (possible_completions_output_node); active_window = the_echo_area; window_change_window_height (compwin, -(compwin->height - (count + 2))); window_adjust_pagetop (calling_window); remember_calling_window (calling_window); #if defined (SPLIT_BEFORE_ACTIVE) /* If the pagetop hasn't changed, scrolling the calling window is a reasonable thing to do. */ if (pagetop == calling_window->pagetop) { end = start + calling_window->height; display_scroll_display (start, end, calling_window->prev->height + 1); } #else /* !SPLIT_BEFORE_ACTIVE */ /* If the pagetop has changed, set the new pagetop here. */ if (pagetop != calling_window->pagetop) { int newtop = calling_window->pagetop; calling_window->pagetop = pagetop; set_window_pagetop (calling_window, newtop); } #endif /* !SPLIT_BEFORE_ACTIVE */ echo_area_completions_window = compwin; remember_window_and_node (compwin, compwin->node); } else compwin = calling_window; } if (compwin->node != possible_completions_output_node) { window_set_node_of_window (compwin, possible_completions_output_node); remember_window_and_node (compwin, compwin->node); } display_update_display (windows); } } } DECLARE_INFO_COMMAND (ea_complete, "Insert completion") { if (!echo_area_completion_items) { ea_insert (window, count, key); return; } /* If KEY is SPC, and we are not forcing completion to take place, simply insert the key. */ if (!echo_area_must_complete_p && key == SPC) { ea_insert (window, count, key); return; } if (ea_last_executed_command == ea_complete) { /* If the keypress is a SPC character, and we have already tried completing once, and there are several completions, then check the batch of completions to see if any continue with a space. If there are some, insert the space character and continue. */ if (key == SPC && completions_found_index > 1) { register int i, offset; offset = input_line_end - input_line_beg; for (i = 0; i < completions_found_index; i++) if (completions_found[i]->label[offset] == ' ') break; if (completions_found[i]) ea_insert (window, 1, ' '); else { ea_possible_completions (window, count, key); return; } } else { ea_possible_completions (window, count, key); return; } } input_line_point = input_line_end; build_completions (); if (!completions_found_index) terminal_ring_bell (); else if (LCD_completion->label[0] == '\0') ea_possible_completions (window, count, key); else { register int i; input_line_point = input_line_end = input_line_beg; for (i = 0; LCD_completion->label[i]; i++) ea_insert (window, 1, LCD_completion->label[i]); } } /* Utility REFERENCE used to store possible LCD. */ static REFERENCE LCD_reference = { (char *)NULL, (char *)NULL, (char *)NULL }; static void remove_completion_duplicates (); /* Variables which remember the state of the most recent call to build_completions (). */ static char *last_completion_request = (char *)NULL; static REFERENCE **last_completion_items = (REFERENCE **)NULL; /* How to tell the completion builder to reset internal state. */ static void completions_must_be_rebuilt () { maybe_free (last_completion_request); last_completion_request = (char *)NULL; last_completion_items = (REFERENCE **)NULL; } /* Build a list of possible completions from echo_area_completion_items, and the contents of input_line. */ static void build_completions () { register int i, len; register REFERENCE *entry; char *request; int informed_of_lengthy_job = 0; /* If there are no items to complete over, exit immediately. */ if (!echo_area_completion_items) { completions_found_index = 0; LCD_completion = (REFERENCE *)NULL; return; } /* Check to see if this call to build completions is the same as the last call to build completions. */ len = input_line_end - input_line_beg; request = (char *)xmalloc (1 + len); strncpy (request, &input_line[input_line_beg], len); request[len] = '\0'; if (last_completion_request && last_completion_items && last_completion_items == echo_area_completion_items && (strcmp (last_completion_request, request) == 0)) { free (request); return; } maybe_free (last_completion_request); last_completion_request = request; last_completion_items = echo_area_completion_items; /* Always start at the beginning of the list. */ completions_found_index = 0; LCD_completion = (REFERENCE *)NULL; for (i = 0; entry = echo_area_completion_items[i]; i++) { if (strnicmp (request, entry->label, len) == 0) add_pointer_to_array (entry, completions_found_index, completions_found, completions_found_slots, 20, REFERENCE *); if (!informed_of_lengthy_job && completions_found_index > 100) { informed_of_lengthy_job = 1; window_message_in_echo_area ("Building completions..."); } } if (!completions_found_index) return; /* Sort and prune duplicate entries from the completions array. */ remove_completion_duplicates (); /* If there is only one completion, just return that. */ if (completions_found_index == 1) { LCD_completion = completions_found[0]; return; } /* Find the least common denominator. */ { long shortest = 100000; for (i = 1; i < completions_found_index; i++) { register int j; int c1, c2; for (j = 0; (c1 = info_tolower (completions_found[i - 1]->label[j])) && (c2 = info_tolower (completions_found[i]->label[j])); j++) if (c1 != c2) break; if (shortest > j) shortest = j; } maybe_free (LCD_reference.label); LCD_reference.label = (char *)xmalloc (1 + shortest); strncpy (LCD_reference.label, completions_found[0]->label, shortest); LCD_reference.label[shortest] = '\0'; LCD_completion = &LCD_reference; } if (informed_of_lengthy_job) echo_area_initialize_node (); } /* Function called by qsort. */ static int compare_references (entry1, entry2) REFERENCE **entry1, **entry2; { return (stricmp ((*entry1)->label, (*entry2)->label)); } /* Prune duplicate entries from COMPLETIONS_FOUND. */ static void remove_completion_duplicates () { register int i, j; REFERENCE **temp; int newlen; if (!completions_found_index) return; /* Sort the items. */ qsort (completions_found, completions_found_index, sizeof (REFERENCE *), compare_references); for (i = 0, newlen = 1; i < completions_found_index - 1; i++) { if (strcmp (completions_found[i]->label, completions_found[i + 1]->label) == 0) completions_found[i] = (REFERENCE *)NULL; else newlen++; } /* We have marked all the dead slots. It is faster to copy the live slots twice than to prune the dead slots one by one. */ temp = (REFERENCE **)xmalloc ((1 + newlen) * sizeof (REFERENCE *)); for (i = 0, j = 0; i < completions_found_index; i++) if (completions_found[i]) temp[j++] = completions_found[i]; for (i = 0; i < newlen; i++) completions_found[i] = temp[i]; completions_found[i] = (REFERENCE *)NULL; completions_found_index = newlen; free (temp); } /* Scroll the "other" window. If there is a window showing completions, scroll that one, otherwise scroll the window which was active on entering the read function. */ DECLARE_INFO_COMMAND (ea_scroll_completions_window, "Scroll the completions window") { WINDOW *compwin; int old_pagetop; compwin = get_internal_info_window (compwin_name); if (!compwin) compwin = calling_window; old_pagetop = compwin->pagetop; /* Let info_scroll_forward () do the work, and print any messages that need to be displayed. */ info_scroll_forward (compwin, count, key); } /* Function which gets called when an Info window is deleted while the echo area is active. WINDOW is the window which has just been deleted. */ void echo_area_inform_of_deleted_window (window) WINDOW *window; { /* If this is the calling_window, forget what we remembered about it. */ if (window == calling_window) { if (active_window != the_echo_area) remember_calling_window (active_window); else remember_calling_window (windows); } /* If this window was the echo_area_completions_window, then notice that the window has been deleted. */ if (window == echo_area_completions_window) echo_area_completions_window = (WINDOW *)NULL; } /* **************************************************************** */ /* */ /* Pushing and Popping the Echo Area */ /* */ /* **************************************************************** */ /* Push and Pop the echo area. */ typedef struct { char *line; char *prompt; REFERENCE **comp_items; int point, beg, end; int must_complete; NODE node; WINDOW *compwin; } PUSHED_EA; static PUSHED_EA **pushed_echo_areas = (PUSHED_EA **)NULL; static int pushed_echo_areas_index = 0; static int pushed_echo_areas_slots = 0; /* Pushing the echo_area has a side effect of zeroing the completion_items. */ static void push_echo_area () { PUSHED_EA *pushed; pushed = (PUSHED_EA *)xmalloc (sizeof (PUSHED_EA)); pushed->line = savestring (input_line); pushed->prompt = input_line_prompt; pushed->point = input_line_point; pushed->beg = input_line_beg; pushed->end = input_line_end; pushed->node = input_line_node; pushed->comp_items = echo_area_completion_items; pushed->must_complete = echo_area_must_complete_p; pushed->compwin = echo_area_completions_window; add_pointer_to_array (pushed, pushed_echo_areas_index, pushed_echo_areas, pushed_echo_areas_slots, 4, PUSHED_EA *); echo_area_completion_items = (REFERENCE **)NULL; } static void pop_echo_area () { PUSHED_EA *popped; popped = pushed_echo_areas[--pushed_echo_areas_index]; strcpy (input_line, popped->line); free (popped->line); input_line_prompt = popped->prompt; input_line_point = popped->point; input_line_beg = popped->beg; input_line_end = popped->end; input_line_node = popped->node; echo_area_completion_items = popped->comp_items; echo_area_must_complete_p = popped->must_complete; echo_area_completions_window = popped->compwin; completions_must_be_rebuilt (); /* If the completion window no longer exists, forget about it. */ if (echo_area_completions_window) { register WINDOW *win; for (win = windows; win; win = win->next) if (echo_area_completions_window == win) break; /* If the window wasn't found, then it has already been deleted. */ if (!win) echo_area_completions_window = (WINDOW *)NULL; } free (popped); } static int echo_area_stack_depth () { return (pushed_echo_areas_index); } /* Returns non-zero if any of the prior stacked calls to read in the echo area produced a completions window. */ static int echo_area_stack_contains_completions_p () { register int i; for (i = 0; i < pushed_echo_areas_index; i++) if (pushed_echo_areas[i]->compwin) return (1); return (0); } /* **************************************************************** */ /* */ /* Error Messages While Reading in Echo Area */ /* */ /* **************************************************************** */ #if defined (HAVE_SYS_TIME_H) # include # define HAVE_STRUCT_TIMEVAL #endif /* HAVE_SYS_TIME_H */ static void pause_or_input () { #if defined (FD_SET) struct timeval timer; fd_set readfds; int ready; FD_ZERO (&readfds); FD_SET (fileno (stdin), &readfds); timer.tv_sec = 2; timer.tv_usec = 750; ready = select (1, &readfds, (fd_set *)NULL, (fd_set *)NULL, &timer); #endif /* FD_SET */ } /* Print MESSAGE right after the end of the current line, and wait for input or 2.75 seconds, whichever comes first. Then flush the informational message that was printed. */ void inform_in_echo_area (message) char *message; { register int i; char *text; text = savestring (message); for (i = 0; text[i] && text[i] != '\n'; i++); text[i] = '\0'; echo_area_initialize_node (); sprintf (&input_line[input_line_end], "%s[%s]\n", echo_area_is_active ? " ": "", text); free (text); the_echo_area->point = input_line_point; display_update_one_window (the_echo_area); display_cursor_at_point (active_window); fflush (stdout); pause_or_input (); echo_area_initialize_node (); } octave-1.1.0/info/filesys.c100666 415 17 36252 5463055236 13754 0ustar jweusers/* filesys.c -- File system specific functions for hacking this system. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include #include #include "general.h" #include "tilde.h" #include "filesys.h" #if !defined (O_RDONLY) #if defined (HAVE_SYS_FCNTL_H) #include #else /* !HAVE_SYS_FCNTL_H */ #include #endif /* !HAVE_SYS_FCNTL_H */ #endif /* !O_RDONLY */ #if !defined (errno) extern int errno; #endif /* !errno */ /* Found in info-utils.c. */ extern char *filename_non_directory (); #if !defined (BUILDING_LIBRARY) /* Found in session.c */ extern int info_windows_initialized_p; /* Found in window.c. */ extern void message_in_echo_area (), unmessage_in_echo_area (); #endif /* !BUILDING_LIBRARY */ /* Local to this file. */ static char *info_file_in_path (), *lookup_info_filename (); static void remember_info_filename (), maybe_initialize_infopath (); #if !defined (NULL) # define NULL 0x0 #endif /* !NULL */ typedef struct { char *suffix; char *decompressor; } COMPRESSION_ALIST; static char *info_suffixes[] = { "", ".info", "-info", (char *)NULL }; static COMPRESSION_ALIST compress_suffixes[] = { { ".Z", "uncompress" }, { ".Y", "unyabba" }, { ".z", "gunzip" }, { ".gz", "gunzip" }, { (char *)NULL, (char *)NULL } }; /* The path on which we look for info files. You can initialize this from the environment variable INFOPATH if there is one, or you can call info_add_path () to add paths to the beginning or end of it. You can call zap_infopath () to make the path go away. */ char *infopath = (char *)NULL; static int infopath_size = 0; /* Expand the filename in PARTIAL to make a real name for this operating system. This looks in INFO_PATHS in order to find the correct file. If it can't find the file, it returns NULL. */ static char *local_temp_filename = (char *)NULL; static int local_temp_filename_size = 0; char * info_find_fullpath (partial) char *partial; { int initial_character; char *temp; filesys_error_number = 0; maybe_initialize_infopath (); if (partial && (initial_character = *partial)) { char *expansion; expansion = lookup_info_filename (partial); if (expansion) return (expansion); /* If we have the full path to this file, we still may have to add various extensions to it. I guess we have to stat this file after all. */ if (initial_character == '/') temp = info_file_in_path (partial + 1, "/"); else if (initial_character == '~') { expansion = tilde_expand_word (partial); if (*expansion == '/') { temp = info_file_in_path (expansion + 1, "/"); free (expansion); } else temp = expansion; } else if (initial_character == '.' && (partial[1] == '/' || (partial[1] == '.' && partial[2] == '/'))) { if (local_temp_filename_size < 1024) local_temp_filename = (char *)xrealloc (local_temp_filename, (local_temp_filename_size = 1024)); #if defined (HAVE_GETCWD) if (!getcwd (local_temp_filename, local_temp_filename_size)) #else /* !HAVE_GETCWD */ if (!getwd (local_temp_filename)) #endif /* !HAVE_GETCWD */ { filesys_error_number = errno; return (partial); } strcat (local_temp_filename, "/"); strcat (local_temp_filename, partial); return (local_temp_filename); } else temp = info_file_in_path (partial, infopath); if (temp) { remember_info_filename (partial, temp); if (strlen (temp) > local_temp_filename_size) local_temp_filename = (char *) xrealloc (local_temp_filename, (local_temp_filename_size = (50 + strlen (temp)))); strcpy (local_temp_filename, temp); free (temp); return (local_temp_filename); } } return (partial); } /* Scan the list of directories in PATH looking for FILENAME. If we find one that is a regular file, return it as a new string. Otherwise, return a NULL pointer. */ static char * info_file_in_path (filename, path) char *filename, *path; { struct stat finfo; char *temp_dirname; int statable, dirname_index; dirname_index = 0; while (temp_dirname = extract_colon_unit (path, &dirname_index)) { register int i, pre_suffix_length; char *temp; /* Expand a leading tilde if one is present. */ if (*temp_dirname == '~') { char *expanded_dirname; expanded_dirname = tilde_expand_word (temp_dirname); free (temp_dirname); temp_dirname = expanded_dirname; } temp = (char *)xmalloc (30 + strlen (temp_dirname) + strlen (filename)); strcpy (temp, temp_dirname); if (temp[(strlen (temp)) - 1] != '/') strcat (temp, "/"); strcat (temp, filename); pre_suffix_length = strlen (temp); free (temp_dirname); for (i = 0; info_suffixes[i]; i++) { strcpy (temp + pre_suffix_length, info_suffixes[i]); statable = (stat (temp, &finfo) == 0); /* If we have found a regular file, then use that. Else, if we have found a directory, look in that directory for this file. */ if (statable) { if (S_ISREG (finfo.st_mode)) { return (temp); } else if (S_ISDIR (finfo.st_mode)) { char *newpath, *filename_only, *newtemp; newpath = savestring (temp); filename_only = filename_non_directory (filename); newtemp = info_file_in_path (filename_only, newpath); free (newpath); if (newtemp) { free (temp); return (newtemp); } } } else { /* Add various compression suffixes to the name to see if the file is present in compressed format. */ register int j, pre_compress_suffix_length; pre_compress_suffix_length = strlen (temp); for (j = 0; compress_suffixes[j].suffix; j++) { strcpy (temp + pre_compress_suffix_length, compress_suffixes[j].suffix); statable = (stat (temp, &finfo) == 0); if (statable && (S_ISREG (finfo.st_mode))) return (temp); } } } free (temp); } return ((char *)NULL); } /* Given a string containing units of information separated by colons, return the next one pointed to by IDX, or NULL if there are no more. Advance IDX to the character after the colon. */ char * extract_colon_unit (string, idx) char *string; int *idx; { register int i, start; i = start = *idx; if ((i >= strlen (string)) || !string) return ((char *) NULL); while (string[i] && string[i] != ':') i++; if (i == start) { return ((char *) NULL); } else { char *value = (char *) xmalloc (1 + (i - start)); strncpy (value, &string[start], (i - start)); value[i - start] = '\0'; if (string[i]) ++i; *idx = i; return (value); } } /* A structure which associates a filename with its expansion. */ typedef struct { char *filename; char *expansion; } FILENAME_LIST; /* An array of remembered arguments and results. */ static FILENAME_LIST **names_and_files = (FILENAME_LIST **)NULL; static int names_and_files_index = 0; static int names_and_files_slots = 0; /* Find the result for having already called info_find_fullpath () with FILENAME. */ static char * lookup_info_filename (filename) char *filename; { if (filename && names_and_files) { register int i; for (i = 0; names_and_files[i]; i++) { if (strcmp (names_and_files[i]->filename, filename) == 0) return (names_and_files[i]->expansion); } } return (char *)NULL;; } /* Add a filename and its expansion to our list. */ static void remember_info_filename (filename, expansion) char *filename, *expansion; { FILENAME_LIST *new; if (names_and_files_index + 2 > names_and_files_slots) { int alloc_size; names_and_files_slots += 10; alloc_size = names_and_files_slots * sizeof (FILENAME_LIST *); names_and_files = (FILENAME_LIST **) xrealloc (names_and_files, alloc_size); } new = (FILENAME_LIST *)xmalloc (sizeof (FILENAME_LIST)); new->filename = savestring (filename); new->expansion = expansion ? savestring (expansion) : (char *)NULL; names_and_files[names_and_files_index++] = new; names_and_files[names_and_files_index] = (FILENAME_LIST *)NULL; } static void maybe_initialize_infopath () { if (!infopath_size) { infopath = (char *) xmalloc (infopath_size = (1 + strlen (DEFAULT_INFOPATH))); strcpy (infopath, DEFAULT_INFOPATH); } } /* Add PATH to the list of paths found in INFOPATH. 2nd argument says whether to put PATH at the front or end of INFOPATH. */ void info_add_path (path, where) char *path; int where; { int len; if (!infopath) { infopath = (char *)xmalloc (infopath_size = 200 + strlen (path)); infopath[0] = '\0'; } len = strlen (path) + strlen (infopath); if (len + 2 >= infopath_size) infopath = (char *)xrealloc (infopath, (infopath_size += (2 * len) + 2)); if (!*infopath) strcpy (infopath, path); else if (where == INFOPATH_APPEND) { strcat (infopath, ":"); strcat (infopath, path); } else if (where == INFOPATH_PREPEND) { char *temp = savestring (infopath); strcpy (infopath, path); strcat (infopath, ":"); strcat (infopath, temp); free (temp); } } /* Make INFOPATH have absolutely nothing in it. */ void zap_infopath () { if (infopath) free (infopath); infopath = (char *)NULL; infopath_size = 0; } /* Read the contents of PATHNAME, returning a buffer with the contents of that file in it, and returning the size of that buffer in FILESIZE. FINFO is a stat struct which has already been filled in by the caller. If the file cannot be read, return a NULL pointer. */ char * filesys_read_info_file (pathname, filesize, finfo) char *pathname; long *filesize; struct stat *finfo; { *filesize = filesys_error_number = 0; if (compressed_filename_p (pathname)) return (filesys_read_compressed (pathname, filesize, finfo)); else { int descriptor; char *contents; descriptor = open (pathname, O_RDONLY, 0666); /* If the file couldn't be opened, give up. */ if (descriptor < 0) { filesys_error_number = errno; return ((char *)NULL); } /* Try to read the contents of this file. */ contents = (char *)xmalloc (1 + finfo->st_size); if ((read (descriptor, contents, finfo->st_size)) != finfo->st_size) { filesys_error_number = errno; close (descriptor); free (contents); return ((char *)NULL); } close (descriptor); *filesize = finfo->st_size; return (contents); } } /* Typically, pipe buffers are 4k. */ #define BASIC_PIPE_BUFFER (4 * 1024) /* We use some large multiple of that. */ #define FILESYS_PIPE_BUFFER_SIZE (16 * BASIC_PIPE_BUFFER) char * filesys_read_compressed (pathname, filesize, finfo) char *pathname; long *filesize; struct stat *finfo; { FILE *stream; char *command, *decompressor; char *contents = (char *)NULL; *filesize = filesys_error_number = 0; decompressor = filesys_decompressor_for_file (pathname); if (!decompressor) return ((char *)NULL); command = (char *)xmalloc (10 + strlen (pathname) + strlen (decompressor)); sprintf (command, "%s < %s", decompressor, pathname); #if !defined (BUILDING_LIBRARY) if (info_windows_initialized_p) { char *temp; temp = (char *)xmalloc (5 + strlen (command)); sprintf (temp, "%s...", command); message_in_echo_area ("%s", temp); free (temp); } #endif /* !BUILDING_LIBRARY */ stream = popen (command, "r"); free (command); /* Read chunks from this file until there are none left to read. */ if (stream) { int offset, size; char *chunk; offset = size = 0; chunk = (char *)xmalloc (FILESYS_PIPE_BUFFER_SIZE); while (1) { int bytes_read; bytes_read = fread (chunk, 1, FILESYS_PIPE_BUFFER_SIZE, stream); if (bytes_read + offset >= size) contents = (char *)xrealloc (contents, size += (2 * FILESYS_PIPE_BUFFER_SIZE)); memcpy (contents + offset, chunk, bytes_read); offset += bytes_read; if (bytes_read != FILESYS_PIPE_BUFFER_SIZE) break; } free (chunk); pclose (stream); contents = (char *)xrealloc (contents, offset + 1); *filesize = offset; } else { filesys_error_number = errno; } #if !defined (BUILDING_LIBARARY) if (info_windows_initialized_p) unmessage_in_echo_area (); #endif /* !BUILDING_LIBRARY */ return (contents); } /* Return non-zero if FILENAME belongs to a compressed file. */ int compressed_filename_p (filename) char *filename; { char *decompressor; /* Find the final extension of this filename, and see if it matches one of our known ones. */ decompressor = filesys_decompressor_for_file (filename); if (decompressor) return (1); else return (0); } /* Return the command string that would be used to decompress FILENAME. */ char * filesys_decompressor_for_file (filename) char *filename; { register int i; char *extension = (char *)NULL; /* Find the final extension of FILENAME, and see if it appears in our list of known compression extensions. */ for (i = strlen (filename) - 1; i > 0; i--) if (filename[i] == '.') { extension = filename + i; break; } if (!extension) return ((char *)NULL); for (i = 0; compress_suffixes[i].suffix; i++) if (strcmp (extension, compress_suffixes[i].suffix) == 0) return (compress_suffixes[i].decompressor); return ((char *)NULL); } /* The number of the most recent file system error. */ int filesys_error_number = 0; #if !defined (HAVE_STRERROR) extern char *sys_errlist[]; extern int sys_nerr; char * strerror (num) int num; { if (num >= sys_nerr) return (""); else return (sys_errlist[num]); } #endif /* !HAVE_STRERROR */ /* A function which returns a pointer to a static buffer containing an error message for FILENAME and ERROR_NUM. */ static char *errmsg_buf = (char *)NULL; static int errmsg_buf_size = 0; char * filesys_error_string (filename, error_num) char *filename; int error_num; { int len; char *result; if (error_num == 0) return ((char *)NULL); result = strerror (error_num); len = 4 + strlen (filename) + strlen (result); if (len >= errmsg_buf_size) errmsg_buf = (char *)xrealloc (errmsg_buf, (errmsg_buf_size = 2 + len)); sprintf (errmsg_buf, "%s: %s", filename, result); return (errmsg_buf); } octave-1.1.0/info/info-utils.c100666 415 17 37604 5333270245 14364 0ustar jweusers/* info-utils.c -- Useful functions for manipulating Info file quirks. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include /* For "NULL". Yechhh! */ #include #include #include #include "info-utils.h" /* When non-zero, various display and input functions handle ISO Latin character sets correctly. */ int ISO_Latin_p = 0; /* Variable which holds the most recent filename parsed as a result of calling info_parse_xxx (). */ char *info_parsed_filename = (char *)NULL; /* Variable which holds the most recent nodename parsed as a result of calling info_parse_xxx (). */ char *info_parsed_nodename = (char *)NULL; /* Functions to remember a filename or nodename for later return. */ static void save_filename (), saven_filename (); static void save_nodename (), saven_nodename (); /* How to get a reference (either menu or cross). */ static REFERENCE **info_references_internal (); /* Parse the filename and nodename out of STRING. If STRING doesn't contain a filename (i.e., it is NOT (FILENAME)NODENAME) then set INFO_PARSED_FILENAME to NULL. If second argument NEWLINES_OKAY is non-zero, it says to allow the nodename specification to cross a newline boundary (i.e., only `,', `.', or `TAB' can end the spec). */ void info_parse_node (string, newlines_okay) char *string; int newlines_okay; { register int i = 0; /* Default the answer. */ save_filename ((char *)NULL); save_nodename ((char *)NULL); /* Special case of nothing passed. Return nothing. */ if (!string || !*string) return; string += skip_whitespace (string); /* Check for (FILENAME)NODENAME. */ if (*string == '(') { i = 0; /* Advance past the opening paren. */ string++; /* Find the closing paren. */ while (string[i] && string[i] != ')') i++; /* Remember parsed filename. */ saven_filename (string, i); /* Point directly at the nodename. */ string += i; if (*string) string++; } /* Parse out nodename. */ i = skip_node_characters (string, newlines_okay); saven_nodename (string, i); canonicalize_whitespace (info_parsed_nodename); if (info_parsed_nodename && !*info_parsed_nodename) { free (info_parsed_nodename); info_parsed_nodename = (char *)NULL; } } /* Return the node addressed by LABEL in NODE (usually one of "Prev:", "Next:", "Up:", "File:", or "Node:". After a call to this function, the global INFO_PARSED_NODENAME and INFO_PARSED_FILENAME contain the information. */ void info_parse_label (label, node) char *label; NODE *node; { register int i; char *nodeline; /* Default answer to failure. */ save_nodename ((char *)NULL); save_filename ((char *)NULL); /* Find the label in the first line of this node. */ nodeline = node->contents; i = string_in_line (label, nodeline); if (i == -1) return; nodeline += i; nodeline += skip_whitespace (nodeline); info_parse_node (nodeline, DONT_SKIP_NEWLINES); } /* **************************************************************** */ /* */ /* Finding and Building Menus */ /* */ /* **************************************************************** */ /* Return a NULL terminated array of REFERENCE * which represents the menu found in NODE. If there is no menu in NODE, just return a NULL pointer. */ REFERENCE ** info_menu_of_node (node) NODE *node; { long position; SEARCH_BINDING search; REFERENCE **menu = (REFERENCE **)NULL; search.buffer = node->contents; search.start = 0; search.end = node->nodelen; search.flags = S_FoldCase; /* Find the start of the menu. */ position = search_forward (INFO_MENU_LABEL, &search); if (position == -1) return ((REFERENCE **) NULL); /* We have the start of the menu now. Glean menu items from the rest of the node. */ search.start = position + strlen (INFO_MENU_LABEL); search.start += skip_line (search.buffer + search.start); search.start--; menu = info_menu_items (&search); return (menu); } /* Return a NULL terminated array of REFERENCE * which represents the cross refrences found in NODE. If there are no cross references in NODE, just return a NULL pointer. */ REFERENCE ** info_xrefs_of_node (node) NODE *node; { SEARCH_BINDING search; search.buffer = node->contents; search.start = 0; search.end = node->nodelen; search.flags = S_FoldCase; return (info_xrefs (&search)); } /* Glean menu entries from BINDING->buffer + BINDING->start until we have looked at the entire contents of BINDING. Return an array of REFERENCE * that represents each menu item in this range. */ REFERENCE ** info_menu_items (binding) SEARCH_BINDING *binding; { return (info_references_internal (INFO_MENU_ENTRY_LABEL, binding)); } /* Glean cross references from BINDING->buffer + BINDING->start until BINDING->end. Return an array of REFERENCE * that represents each cross reference in this range. */ REFERENCE ** info_xrefs (binding) SEARCH_BINDING *binding; { return (info_references_internal (INFO_XREF_LABEL, binding)); } /* Glean cross references or menu items from BINDING. Return an array of REFERENCE * that represents the items found. */ static REFERENCE ** info_references_internal (label, binding) char *label; SEARCH_BINDING *binding; { SEARCH_BINDING search; REFERENCE **refs = (REFERENCE **)NULL; int refs_index = 0, refs_slots = 0; int searching_for_menu_items = 0; long position; search.buffer = binding->buffer; search.start = binding->start; search.end = binding->end; search.flags = S_FoldCase | S_SkipDest; searching_for_menu_items = (stricmp (label, INFO_MENU_ENTRY_LABEL) == 0); while ((position = search_forward (label, &search)) != -1) { int offset, start; char *refdef; REFERENCE *entry; search.start = position; search.start += skip_whitespace (search.buffer + search.start); start = search.start - binding->start; refdef = search.buffer + search.start; offset = string_in_line (":", refdef); /* When searching for menu items, if no colon, there is no menu item on this line. */ if (offset == -1) { if (searching_for_menu_items) continue; else { int temp; temp = skip_line (refdef); offset = string_in_line (":", refdef + temp); if (offset == -1) continue; /* Give up? */ else offset += temp; } } entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->filename = (char *)NULL; entry->nodename = (char *)NULL; entry->label = (char *)xmalloc (offset); strncpy (entry->label, refdef, offset - 1); entry->label[offset - 1] = '\0'; canonicalize_whitespace (entry->label); refdef += offset; entry->start = start; entry->end = refdef - binding->buffer; /* If this reference entry continues with another ':' then the nodename is the same as the label. */ if (*refdef == ':') { entry->nodename = savestring (entry->label); } else { /* This entry continues with a specific nodename. Parse the nodename from the specification. */ refdef += skip_whitespace_and_newlines (refdef); if (searching_for_menu_items) info_parse_node (refdef, DONT_SKIP_NEWLINES); else info_parse_node (refdef, SKIP_NEWLINES); if (info_parsed_filename) entry->filename = savestring (info_parsed_filename); if (info_parsed_nodename) entry->nodename = savestring (info_parsed_nodename); } add_pointer_to_array (entry, refs_index, refs, refs_slots, 50, REFERENCE *); } return (refs); } /* Get the entry associated with LABEL in MENU. Return a pointer to the REFERENCE if found, or NULL. */ REFERENCE * info_get_labeled_reference (label, references) char *label; REFERENCE **references; { register int i; REFERENCE *entry; for (i = 0; references && (entry = references[i]); i++) { if (strcmp (label, entry->label) == 0) return (entry); } return ((REFERENCE *)NULL); } /* A utility function for concatenating REFERENCE **. Returns a new REFERENCE ** which is the concatenation of REF1 and REF2. The REF1 and REF2 arrays are freed, but their contents are not. */ REFERENCE ** info_concatenate_references (ref1, ref2) REFERENCE **ref1, **ref2; { register int i, j; REFERENCE **result; int size; /* With one argument passed as NULL, simply return the other arg. */ if (!ref1) return (ref2); else if (!ref2) return (ref1); /* Get the total size of the slots that we will need. */ for (i = 0; ref1[i]; i++); size = i; for (i = 0; ref2[i]; i++); size += i; result = (REFERENCE **)xmalloc ((1 + size) * sizeof (REFERENCE *)); /* Copy the contents over. */ for (i = 0; ref1[i]; i++) result[i] = ref1[i]; j = i; for (i = 0; ref2[i]; i++) result[j++] = ref2[i]; result[j] = (REFERENCE *)NULL; free (ref1); free (ref2); return (result); } /* Free the data associated with REFERENCES. */ void info_free_references (references) REFERENCE **references; { register int i; REFERENCE *entry; if (references) { for (i = 0; references && (entry = references[i]); i++) { maybe_free (entry->label); maybe_free (entry->filename); maybe_free (entry->nodename); free (entry); } free (references); } } /* Search for sequences of whitespace or newlines in STRING, replacing all such sequences with just a single space. Remove whitespace from start and end of string. */ void canonicalize_whitespace (string) char *string; { register int i, j; int len, whitespace_found, whitespace_loc; char *temp; if (!string) return; len = strlen (string); temp = (char *)xmalloc (1 + len); /* Search for sequences of whitespace or newlines. Replace all such sequences in the string with just a single space. */ whitespace_found = 0; for (i = 0, j = 0; string[i]; i++) { if (whitespace_or_newline (string[i])) { whitespace_found++; whitespace_loc = i; continue; } else { if (whitespace_found && whitespace_loc) { whitespace_found = 0; temp[j++] = ' '; } temp[j++] = string[i]; } } /* Kill trailing whitespace. */ if (j && whitespace (temp[j - 1])) j--; temp[j] = '\0'; strcpy (string, temp); free (temp); } /* String representation of a char returned by printed_representation (). */ static char the_rep[10]; /* Return a pointer to a string which is the printed representation of CHARACTER if it were printed at HPOS. */ char * printed_representation (character, hpos) unsigned char character; int hpos; { register int i = 0; int printable_limit; if (ISO_Latin_p) printable_limit = 160; else printable_limit = 127; if (character == '\177') { the_rep[i++] = '^'; the_rep[i++] = '?'; } else if (iscntrl (character)) { switch (character) { case '\r': case '\n': the_rep[i++] = character; break; case '\t': { int tw; tw = ((hpos + 8) & 0xf8) - hpos; while (i < tw) the_rep[i++] = ' '; } break; default: the_rep[i++] = '^'; the_rep[i++] = (character | 0x40); } } else if (character > printable_limit) { sprintf (the_rep + i, "\\%0o", character); i = strlen (the_rep); } else the_rep[i++] = character; the_rep[i] = '\0'; return (the_rep); } /* **************************************************************** */ /* */ /* Functions Static To This File */ /* */ /* **************************************************************** */ /* Amount of space allocated to INFO_PARSED_FILENAME via xmalloc (). */ static int parsed_filename_size = 0; /* Amount of space allocated to INFO_PARSED_NODENAME via xmalloc (). */ static int parsed_nodename_size = 0; static void save_string (), saven_string (); /* Remember FILENAME in PARSED_FILENAME. An empty FILENAME is translated to a NULL pointer in PARSED_FILENAME. */ static void save_filename (filename) char *filename; { save_string (filename, &info_parsed_filename, &parsed_filename_size); } /* Just like save_filename (), but you pass the length of the string. */ static void saven_filename (filename, len) char *filename; int len; { saven_string (filename, len, &info_parsed_filename, &parsed_filename_size); } /* Remember NODENAME in PARSED_NODENAME. An empty NODENAME is translated to a NULL pointer in PARSED_NODENAME. */ static void save_nodename (nodename) char *nodename; { save_string (nodename, &info_parsed_nodename, &parsed_nodename_size); } /* Just like save_nodename (), but you pass the length of the string. */ static void saven_nodename (nodename, len) char *nodename; int len; { saven_string (nodename, len, &info_parsed_nodename, &parsed_nodename_size); } /* Remember STRING in STRING_P. STRING_P should currently have STRING_SIZE_P bytes allocated to it. An empty STRING is translated to a NULL pointer in STRING_P. */ static void save_string (string, string_p, string_size_p) char *string; char **string_p; int *string_size_p; { if (!string || !*string) { if (*string_p) free (*string_p); *string_p = (char *)NULL; *string_size_p = 0; } else { if (strlen (string) >= *string_size_p) *string_p = (char *)xrealloc (*string_p, (*string_size_p = 1 + strlen (string))); strcpy (*string_p, string); } } /* Just like save_string (), but you also pass the length of STRING. */ static void saven_string (string, len, string_p, string_size_p) char *string; int len; char **string_p; int *string_size_p; { if (!string) { if (*string_p) free (*string_p); *string_p = (char *)NULL; *string_size_p = 0; } else { if (len >= *string_size_p) *string_p = (char *)xrealloc (*string_p, (*string_size_p = 1 + len)); strncpy (*string_p, string, len); (*string_p)[len] = '\0'; } } /* Return a pointer to the part of PATHNAME that simply defines the file. */ char * filename_non_directory (pathname) char *pathname; { char *filename; filename = (char *)rindex (pathname, '/'); if (filename) filename++; else filename = pathname; return (filename); } /* Return non-zero if NODE is one especially created by Info. */ int internal_info_node_p (node) NODE *node; { if (node && (node->filename && !*node->filename) && !node->parent && node->nodename) return (1); else return (0); } /* Make NODE appear to be one especially created by Info. */ void name_internal_node (node, name) NODE *node; char *name; { if (!node) return; node->filename = ""; node->parent = (char *)NULL; node->nodename = name; node->flags |= N_IsInternal; } /* Return the window displaying NAME, the name of an internally created Info window. */ WINDOW * get_internal_info_window (name) char *name; { WINDOW *win = (WINDOW *)NULL; for (win = windows; win; win = win->next) if (internal_info_node_p (win->node) && (strcmp (win->node->nodename, name) == 0)) break; return (win); } octave-1.1.0/info/info.c100666 415 17 34067 5500705751 13227 0ustar jweusers/* info.c -- Display nodes of Info files in multiple windows. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include "dribble.h" #include "terminal.h" #include "getopt.h" /* Non-zero means search all indices for APROPOS_SEARCH_STRING. */ static int apropos_p = 0; /* Variable containing the string to search for when apropos_p is non-zero. */ static char *apropos_search_string = (char *)NULL; /* Non-zero means search all indices for INDEX_SEARCH_STRING. Unlike apropos, this puts the user at the node, running info. */ static int index_search_p = 0; /* Variable containing the string to search for when index_search_p is non-zero. */ static char *index_search_string = (char *)NULL; /* Non-zero means print version info only. */ static int print_version_p = 0; /* Non-zero means print a short description of the options. */ static int print_help_p = 0; /* Array of the names of nodes that the user specified with "--node" on the command line. */ static char **user_nodenames = (char **)NULL; static int user_nodenames_index = 0; static int user_nodenames_slots = 0; /* String specifying the first file to load. This string can only be set by the user specifying "--file" on the command line. */ static char *user_filename = (char *)NULL; /* String specifying the name of the file to dump nodes to. This value is filled if the user speficies "--output" on the command line. */ static char *user_output_filename = (char *)NULL; /* Non-zero indicates that when "--output" is specified, all of the menu items of the specified nodes (and their subnodes as well) should be dumped in the order encountered. This basically can print a book. */ int dump_subnodes = 0; /* Structure describing the options that Info accepts. We pass this structure to getopt_long (). If you add or otherwise change this structure, you must also change the string which follows it. */ #define APROPOS_OPTION 1 #define DRIBBLE_OPTION 2 #define RESTORE_OPTION 3 #define IDXSRCH_OPTION 4 static struct option long_options[] = { { "apropos", 1, 0, APROPOS_OPTION }, { "directory", 1, 0, 'd' }, { "node", 1, 0, 'n' }, { "file", 1, 0, 'f' }, { "subnodes", 0, &dump_subnodes, 1 }, { "output", 1, 0, 'o' }, { "help", 0, &print_help_p, 1 }, { "version", 0, &print_version_p, 1 }, { "dribble", 1, 0, DRIBBLE_OPTION }, { "restore", 1, 0, RESTORE_OPTION }, { "index-search", 1, 0, IDXSRCH_OPTION }, {NULL, 0, NULL, 0} }; /* String describing the shorthand versions of the long options found above. */ static char *short_options = "d:n:f:o:s"; /* Some "forward" declarations. */ static void usage (), info_short_help (), remember_info_program_name (); /* **************************************************************** */ /* */ /* Main Entry Point to the Info Program */ /* */ /* **************************************************************** */ int main (argc, argv) int argc; char **argv; { int getopt_long_index; /* Index returned by getopt_long (). */ NODE *initial_node; /* First node loaded by Info. */ #if defined (NeXT) && defined (NOTDEF) malloc_debug (0x0ffffffff); #endif /* NeXT && NOTDEF */ remember_info_program_name (argv[0]); while (1) { int option_character; option_character = getopt_long (argc, argv, short_options, long_options, &getopt_long_index); /* getopt_long () returns EOF when there are no more long options. */ if (option_character == EOF) break; /* If this is a long option, then get the short version of it. */ if (option_character == 0 && long_options[getopt_long_index].flag == 0) option_character = long_options[getopt_long_index].val; /* Case on the option that we have received. */ switch (option_character) { case 0: break; /* User wants to add a directory. */ case 'd': info_add_path (optarg, INFOPATH_PREPEND); break; /* User is specifying a particular node. */ case 'n': add_pointer_to_array (optarg, user_nodenames_index, user_nodenames, user_nodenames_slots, 10, char *); break; /* User is specifying a particular Info file. */ case 'f': if (user_filename) free (user_filename); user_filename = savestring (optarg); break; /* User is specifying the name of a file to output to. */ case 'o': if (user_output_filename) free (user_output_filename); user_output_filename = savestring (optarg); break; /* User is specifying that she wishes to dump the subnodes of the node that she is dumping. */ case 's': dump_subnodes = 1; break; /* User has specified a string to search all indices for. */ case APROPOS_OPTION: apropos_p = 1; maybe_free (apropos_search_string); apropos_search_string = savestring (optarg); break; /* User has specified a dribble file to receive keystrokes. */ case DRIBBLE_OPTION: close_dribble_file (); open_dribble_file (optarg); break; /* User has specified an alternate input stream. */ case RESTORE_OPTION: info_set_input_from_file (optarg); break; /* User has specified a string to search all indices for. */ case IDXSRCH_OPTION: index_search_p = 1; maybe_free (index_search_string); index_search_string = savestring (optarg); break; default: usage (); } } /* If the user specified --version, then show the version and exit. */ if (print_version_p) { printf ("GNU Info, Version %s.\n", version_string ()); exit (0); } /* If the `--help' option was present, show the help and exit. */ if (print_help_p) { info_short_help (); exit (0); } /* If the user hasn't specified a path for Info files, default that path now. */ if (!infopath) { char *path_from_env, *getenv (); path_from_env = getenv ("INFOPATH"); if (path_from_env) info_add_path (path_from_env); else info_add_path (DEFAULT_INFOPATH); } /* If the user specified a particular filename, add the path of that file to the contents of INFOPATH. */ if (user_filename) { char *directory_name, *temp; directory_name = savestring (user_filename); temp = filename_non_directory (directory_name); if (temp != directory_name) { *temp = 0; info_add_path (directory_name, INFOPATH_PREPEND); } free (directory_name); } /* If the user wants to search every known index for a given string, do that now, and report the results. */ if (apropos_p) { info_apropos (apropos_search_string); exit (0); } /* Get the initial Info node. It is either "(dir)Top", or what the user specifed with values in user_filename and user_nodenames. */ if (user_nodenames) initial_node = info_get_node (user_filename, user_nodenames[0]); else initial_node = info_get_node (user_filename, (char *)NULL); /* If we couldn't get the initial node, this user is in trouble. */ if (!initial_node) { if (info_recent_file_error) info_error (info_recent_file_error); else info_error (CANT_FIND_NODE, user_nodenames ? user_nodenames[0] : "Top"); exit (1); } /* Special cases for when the user specifies multiple nodes. If we are dumping to an output file, dump all of the nodes specified. Otherwise, attempt to create enough windows to handle the nodes that this user wants displayed. */ if (user_nodenames_index > 1) { free (initial_node); if (user_output_filename) dump_nodes_to_file (user_filename, user_nodenames, user_output_filename, dump_subnodes); else begin_multiple_window_info_session (user_filename, user_nodenames); exit (0); } /* If the user specified `--index-search string', start the info session in the node corresponding to the first match. */ if (index_search_p) { int status = 0; initialize_info_session (initial_node, 0); if (index_entry_exists (windows, index_search_string)) { terminal_clear_screen (); terminal_prep_terminal (); display_update_display (windows); info_last_executed_command = (VFunction *)NULL; do_info_index_search (windows, 0, index_search_string); info_read_and_dispatch (); terminal_unprep_terminal (); } else { fprintf (stderr, "no entries found\n"); status = 13; } close_dribble_file (); exit (status); } /* If there are arguments remaining, they are the names of menu items in sequential info files starting from the first one loaded. That file name is either "dir", or the contents of user_filename if one was specified. */ while (optind != argc) { REFERENCE **menu; REFERENCE *entry; NODE *node; char *arg; /* Remember the name of the menu entry we want. */ arg = argv[optind++]; /* Build and return a list of the menu items in this node. */ menu = info_menu_of_node (initial_node); /* If there wasn't a menu item in this node, stop here, but let the user continue to use Info. Perhaps they wanted this node and didn't realize it. */ if (!menu) { begin_info_session_with_error (initial_node, "There is no menu in this node."); exit (0); } /* Find the specified menu item. */ entry = info_get_labeled_reference (arg, menu); /* If the item wasn't found, search the list sloppily. Perhaps this user typed "buffer" when they really meant "Buffers". */ if (!entry) { register int i; for (i = 0; entry = menu[i]; i++) if (strnicmp (entry->label, arg, strlen (arg)) == 0) break; } /* If we failed to find the reference, start Info with the current node anyway. It is probably a misspelling. */ if (!entry) { char *error_message = "There is no menu item \"%s\" in this node."; info_free_references (menu); /* If we were supposed to dump this node, complain. */ if (user_output_filename) info_error (error_message, arg); else begin_info_session_with_error (initial_node, error_message, arg); exit (0); } /* We have found the reference that the user specified. Clean it up a little bit. */ if (!entry->filename) { if (initial_node->parent) entry->filename = savestring (initial_node->parent); else entry->filename = savestring (initial_node->filename); } /* Find this node. If we can find it, then turn the initial_node into this one. If we cannot find it, try using the label of the entry as a file (i.e., "(LABEL)Top"). Otherwise the Info file is malformed in some way, and we will just use the current value of initial node. */ node = info_get_node (entry->filename, entry->nodename); if (!node && entry->nodename && (strcmp (entry->label, entry->nodename) == 0)) node = info_get_node (entry->label, "Top"); if (node) { free (initial_node); initial_node = node; info_free_references (menu); } else { char *temp = savestring (entry->label); char *error_message; error_message = "Unable to find the node referenced by \"%s\"."; info_free_references (menu); /* If we were trying to dump the node, then give up. Otherwise, start the session with an error message. */ if (user_output_filename) info_error (error_message, temp); else begin_info_session_with_error (initial_node, error_message, temp); exit (0); } } /* If the user specified that this node should be output, then do that now. Otherwise, start the Info session with this node. */ if (user_output_filename) dump_node_to_file (initial_node, user_output_filename, dump_subnodes); else begin_info_session (initial_node); exit (0); } static char *program_name = "info"; static void remember_info_program_name (fullpath) char *fullpath; { char *filename; filename = filename_non_directory (fullpath); program_name = savestring (filename); } /* Produce a very brief descripton of the available options and exit with an error. */ static void usage () { fprintf (stderr,"%s\n%s\n%s\n%s\n%s\n", "Usage: info [-d dir-path] [-f info-file] [-o output-file] [-n node-name]...", " [--directory dir-path] [--file info-file] [--node node-name]...", " [--help] [--output output-file] [--subnodes] [--version]", " [--dribble dribble-file] [--restore from-file]", " [menu-selection ...]"); exit (1); } /* Produce a scaled down description of the available options to Info. */ static void info_short_help () { printf ("%s", "\ Here is a quick description of Info's options. For a more complete\n\ description of how to use Info, type `info info options'.\n\ \n\ --directory DIR Add DIR to INFOPATH.\n\ --file FILENAME Specify Info file to visit.\n\ --node NODENAME Specify nodes in first visited Info file.\n\ --output FILENAME Output selected nodes to FILENAME.\n\ --dribble FILENAME Remember user keystrokes in FILENAME.\n\ --restore FILENAME Read initial keystrokes from FILENAME.\n\ --subnodes Recursively output menu items.\n\ --help Get this help message.\n\ --version Display Info's version information.\n\ \n\ Remaining arguments to Info are treated as the names of menu\n\ items in the initial node visited. You can easily move to the\n\ node of your choice by specifying the menu names which describe\n\ the path to that node. For example, `info emacs buffers'.\n"); exit (0); } octave-1.1.0/info/infodoc.c100666 415 17 42560 5334112207 13703 0ustar jweusers/* infohelp.c -- Functions which build documentation nodes. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* **************************************************************** */ /* */ /* Info Help Windows */ /* */ /* **************************************************************** */ /* The name of the node used in the help window. */ static char *info_help_nodename = "*Info Help*"; /* A node containing printed key bindings and their documentation. */ static NODE *internal_info_help_node = (NODE *)NULL; /* The static text which appears in the internal info help node. */ static char *info_internal_help_text[] = { "Basic Commands in Info Windows", "******************************", "", " h Invoke the Info tutorial.", "", "Selecting other nodes:", "----------------------", " n Move to the \"next\" node of this node.", " p Move to the \"previous\" node of this node.", " u Move \"up\" from this node.", " m Pick menu item specified by name.", " Picking a menu item causes another node to be selected.", " f Follow a cross reference. Reads name of reference.", " l Move to the last node seen in this window.", " d Move to the `directory' node. Equivalent to `g(DIR)'.", "", "Moving within a node:", "---------------------", " SPC Scroll forward a page.", " DEL Scroll backward a page.", " b Go to the beginning of this node.", " e Go to the end of this node.", "", "\"Advanced\" commands:", "--------------------", " q Quit Info.", " 1 Pick first item in node's menu.", " 2-9 Pick second ... ninth item in node's menu.", " 0 Pick last item in node's menu.", " g Move to node specified by name.", " You may include a filename as well, as in (FILENAME)NODENAME.", " s Search through this Info file for a specified string,", " and select the node in which the next occurrence is found.", (char *)NULL }; void dump_map_to_message_buffer (prefix, map) char *prefix; Keymap map; { register int i; for (i = 0; i < 256; i++) { if (map[i].type == ISKMAP) { char *new_prefix, *keyname; keyname = pretty_keyname (i); new_prefix = (char *) xmalloc (3 + strlen (prefix) + strlen (keyname)); sprintf (new_prefix, "%s%s%s ", prefix, *prefix ? " " : "", keyname); dump_map_to_message_buffer (new_prefix, (Keymap)map[i].function); free (new_prefix); } else if (map[i].function) { register int last; char *doc, *name; doc = function_documentation (map[i].function); name = function_name (map[i].function); if (!*doc) continue; /* Find out if there is a series of identical functions, as in ea_insert (). */ for (last = i + 1; last < 256; last++) if ((map[last].type != ISFUNC) || (map[last].function != map[i].function)) break; if (last - 1 != i) { printf_to_message_buffer ("%s%s .. ", prefix, pretty_keyname (i)); printf_to_message_buffer ("%s%s\t", prefix, pretty_keyname (last - 1)); i = last - 1; } else printf_to_message_buffer ("%s%s\t", prefix, pretty_keyname (i)); #if defined (NAMED_FUNCTIONS) /* Print the name of the function, and some padding before the documentation string is printed. */ { int length_so_far; int desired_doc_start = 40; /* Must be multiple of 8. */ printf_to_message_buffer ("(%s)", name); length_so_far = message_buffer_length_this_line (); if ((desired_doc_start + strlen (doc)) >= the_screen->width) printf_to_message_buffer ("\n "); else { while (length_so_far < desired_doc_start) { printf_to_message_buffer ("\t"); length_so_far += character_width ('\t', length_so_far); } } } #endif /* NAMED_FUNCTIONS */ printf_to_message_buffer ("%s\n", doc); } } } /* How to create internal_info_help_node. */ static void create_internal_info_help_node () { register int i; initialize_message_buffer (); for (i = 0; info_internal_help_text[i]; i++) printf_to_message_buffer ("%s\n", info_internal_help_text[i]); printf_to_message_buffer ("---------------------\n\n"); printf_to_message_buffer ("The current search path is:\n"); printf_to_message_buffer (" \"%s\"\n", infopath); printf_to_message_buffer ("---------------------\n\n"); printf_to_message_buffer ("Commands available in Info windows:\n\n"); dump_map_to_message_buffer ("", info_keymap); printf_to_message_buffer ("---------------------\n\n"); printf_to_message_buffer ("Commands available in the echo area:\n\n"); dump_map_to_message_buffer ("", echo_area_keymap); { char *message; message = replace_in_documentation ("--- Use `\\[history-node]' or `\\[kill-node]' to exit ---\n"); printf_to_message_buffer ("%s", message); } internal_info_help_node = message_buffer_to_node (); add_gcable_pointer (internal_info_help_node->contents); name_internal_node (internal_info_help_node, info_help_nodename); /* Even though this is an internal node, we don't want the window system to treat it specially. So we turn off the internalness of it here. */ internal_info_help_node->flags &= ~N_IsInternal; } /* Return a window which is the window showing help in this Info. */ static WINDOW * info_find_or_create_help_window () { WINDOW *help_window; help_window = get_internal_info_window (info_help_nodename); /* If we couldn't find the help window, then make it. */ if (!help_window) { WINDOW *window, *eligible = (WINDOW *)NULL; int max = 0; for (window = windows; window; window = window->next) { if (window->height > max) { max = window->height; eligible = window; } } if (!eligible) return ((WINDOW *)NULL); else { /* Make a new node containing the help text. Split the largest window into 2 windows, and show the help text in that window. */ if (!internal_info_help_node) create_internal_info_help_node (); if (eligible->height > 30) { active_window = eligible; help_window = window_make_window (internal_info_help_node); } else { set_remembered_pagetop_and_point (active_window); window_set_node_of_window (active_window, internal_info_help_node); help_window = active_window; } remember_window_and_node (help_window, help_window->node); } } return (help_window); } /* Create or move to the help window. */ DECLARE_INFO_COMMAND (info_get_help_window, "Display help message") { WINDOW *help_window; help_window = info_find_or_create_help_window (); if (help_window) { active_window = help_window; active_window->flags |= W_UpdateWindow; } else { info_error (CANT_MAKE_HELP); } } /* Show the Info help node. This means that the "info" file is installed where it can easily be found on your system. */ DECLARE_INFO_COMMAND (info_get_info_help_node, "Visit Info node `(info)Help'") { NODE *node; char *nodename; /* If there is a window on the screen showing the node "(info)Help" or the node "(info)Help-Small-Screen", simply select that window. */ { WINDOW *win; for (win = windows; win; win = win->next) { if (win->node && win->node->filename && (stricmp (filename_non_directory (win->node->filename), "info") == 0) && ((strcmp (win->node->nodename, "Help") == 0) || (strcmp (win->node->nodename, "Help-Small-Screen") == 0))) { active_window = win; return; } } } /* If the current window is small, show the small screen help. */ if (active_window->height < 24) nodename = "Help-Small-Screen"; else nodename = "Help"; /* Try to get the info file for Info. */ node = info_get_node ("Info", nodename); if (!node) { if (info_recent_file_error) info_error (info_recent_file_error); else info_error (CANT_FILE_NODE, "Info", nodename); } else { /* If the current window is very large (greater than 45 lines), then split it and show the help node in another window. Otherwise, use the current window. */ if (active_window->height > 45) active_window = window_make_window (node); else { set_remembered_pagetop_and_point (active_window); window_set_node_of_window (active_window, node); } remember_window_and_node (active_window, node); } } /* **************************************************************** */ /* */ /* Groveling Info Keymaps and Docs */ /* */ /* **************************************************************** */ /* Return the documentation associated with the Info command FUNCTION. */ char * function_documentation (function) VFunction *function; { register int i; for (i = 0; function_doc_array[i].func; i++) if (function == function_doc_array[i].func) break; return (replace_in_documentation (function_doc_array[i].doc)); } #if defined (NAMED_FUNCTIONS) /* Return the user-visible name of the function associated with the Info command FUNCTION. */ char * function_name (function) VFunction *function; { register int i; for (i = 0; function_doc_array[i].func; i++) if (function == function_doc_array[i].func) break; return (function_doc_array[i].func_name); } /* Return a pointer to the function named NAME. */ VFunction * named_function (name) char *name; { register int i; for (i = 0; function_doc_array[i].func; i++) if (strcmp (function_doc_array[i].func_name, name) == 0) break; return (function_doc_array[i].func); } #endif /* NAMED_FUNCTIONS */ /* Return the documentation associated with KEY in MAP. */ char * key_documentation (key, map) char key; Keymap map; { VFunction *function = map[key].function; if (function) return (function_documentation (function)); else return ((char *)NULL); } DECLARE_INFO_COMMAND (describe_key, "Print documentation for KEY") { char keyname[50]; int keyname_index = 0; unsigned char keystroke; char *rep; Keymap map; keyname[0] = '\0'; map = window->keymap; while (1) { message_in_echo_area ("Describe key: %s", keyname); keystroke = info_get_input_char (); unmessage_in_echo_area (); if (Meta_p (keystroke) && (!ISO_Latin_p || key < 160)) { if (map[ESC].type != ISKMAP) { window_message_in_echo_area ("ESC %s is undefined.", pretty_keyname (UnMeta (keystroke))); return; } strcpy (keyname + keyname_index, "ESC "); keyname_index = strlen (keyname); keystroke = UnMeta (keystroke); map = (Keymap)map[ESC].function; } /* Add the printed representation of KEYSTROKE to our keyname. */ rep = pretty_keyname (keystroke); strcpy (keyname + keyname_index, rep); keyname_index = strlen (keyname); if (map[keystroke].function == (VFunction *)NULL) { message_in_echo_area ("%s is undefined.", keyname); return; } else if (map[keystroke].type == ISKMAP) { map = (Keymap)map[keystroke].function; strcat (keyname, " "); keyname_index = strlen (keyname); continue; } else { char *message, *fundoc, *funname = ""; #if defined (NAMED_FUNCTIONS) funname = function_name (map[keystroke].function); #endif /* NAMED_FUNCTIONS */ fundoc = function_documentation (map[keystroke].function); message = (char *)xmalloc (10 + strlen (keyname) + strlen (fundoc) + strlen (funname)); #if defined (NAMED_FUNCTIONS) sprintf (message, "%s (%s): %s.", keyname, funname, fundoc); #else sprintf (message, "%s is defined to %s.", keyname, fundoc); #endif /* !NAMED_FUNCTIONS */ window_message_in_echo_area ("%s", message); free (message); break; } } } /* How to get the pretty printable name of a character. */ static char rep_buffer[30]; char * pretty_keyname (key) unsigned char key; { char *rep; if (Meta_p (key)) { char temp[20]; rep = pretty_keyname (UnMeta (key)); sprintf (temp, "ESC %s", rep); strcpy (rep_buffer, temp); rep = rep_buffer; } else if (Control_p (key)) { switch (key) { case '\n': rep = "LFD"; break; case '\t': rep = "TAB"; break; case '\r': rep = "RET"; break; case ESC: rep = "ESC"; break; default: sprintf (rep_buffer, "C-%c", UnControl (key)); rep = rep_buffer; } } else { switch (key) { case ' ': rep = "SPC"; break; case DEL: rep = "DEL"; break; default: rep_buffer[0] = key; rep_buffer[1] = '\0'; rep = rep_buffer; } } return (rep); } /* Replace the names of functions with the key that invokes them. */ static char *where_is (), *where_is_internal (); char * replace_in_documentation (string) char *string; { register int i, start, next; static char *result = (char *)NULL; maybe_free (result); result = (char *)xmalloc (1 + strlen (string)); i = next = start = 0; /* Skip to the beginning of a replaceable function. */ for (i = start; string[i]; i++) { /* Is this the start of a replaceable function name? */ if (string[i] == '\\' && string[i + 1] == '[') { char *fun_name, *rep; VFunction *function; /* Copy in the old text. */ strncpy (result + next, string + start, i - start); next += (i - start); start = i + 2; /* Move to the end of the function name. */ for (i = start; string[i] && (string[i] != ']'); i++); fun_name = (char *)xmalloc (1 + i - start); strncpy (fun_name, string + start, i - start); fun_name[i - start] = '\0'; /* Find a key which invokes this function in the info_keymap. */ function = named_function (fun_name); /* If the internal documentation string fails, there is a serious problem with the associated command's documentation. We croak so that it can be fixed immediately. */ if (!function) abort (); rep = where_is (info_keymap, function); strcpy (result + next, rep); next = strlen (result); start = i; if (string[i]) start++; } } strcpy (result + next, string + start); return (result); } /* Return a string of characters which could be typed from the keymap MAP to invoke FUNCTION. */ static char *where_is_rep = (char *)NULL; static int where_is_rep_index = 0; static int where_is_rep_size = 0; static char * where_is (map, function) Keymap map; VFunction *function; { char *rep; if (!where_is_rep_size) where_is_rep = (char *)xmalloc (where_is_rep_size = 100); where_is_rep_index = 0; rep = where_is_internal (map, function); /* If it couldn't be found, return "M-x Foo". */ if (!rep) { char *name; name = function_name (function); if (name) sprintf (where_is_rep, "M-x %s", name); rep = where_is_rep; } return (rep); } /* Return the printed rep of FUNCTION as found in MAP, or NULL. */ static char * where_is_internal (map, function) Keymap map; VFunction *function; { register int i; /* If the function is directly invokable in MAP, return the representation of that keystroke. */ for (i = 0; i < 256; i++) if ((map[i].type == ISFUNC) && map[i].function == function) { sprintf (where_is_rep + where_is_rep_index, "%s", pretty_keyname (i)); return (where_is_rep); } /* Okay, search subsequent maps for this function. */ for (i = 0; i < 256; i++) { if (map[i].type == ISKMAP) { int saved_index = where_is_rep_index; char *rep; sprintf (where_is_rep + where_is_rep_index, "%s ", pretty_keyname (i)); where_is_rep_index = strlen (where_is_rep); rep = where_is_internal ((Keymap)map[i].function, function); if (rep) return (where_is_rep); where_is_rep_index = saved_index; } } return ((char *)NULL); } extern char *read_function_name (); DECLARE_INFO_COMMAND (info_where_is, "Show what to type to execute a given command") { char *command_name; command_name = read_function_name ("Where is command: ", window); if (!command_name) { info_abort_key (active_window, count, key); return; } if (*command_name) { VFunction *function; function = named_function (command_name); if (function) { char *location; location = where_is (active_window->keymap, function); if (!location) { info_error ("`%s' is not on any keys", command_name); } else { if (strncmp (location, "M-x ", 4) == 0) window_message_in_echo_area ("%s can only be invoked via %s.", command_name, location); else window_message_in_echo_area ("%s can be invoked via %s.", command_name, location); } } else info_error ("There is no function named `%s'", command_name); } free (command_name); } octave-1.1.0/info/infomap.c100666 415 17 20552 5333270144 13714 0ustar jweusers/* infomap.c -- Keymaps for Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "stdio.h" #include "ctype.h" #include "infomap.h" #include "funs.h" /* Return a new keymap which has all the uppercase letters mapped to run the function info_do_lowercase_version (). */ Keymap keymap_make_keymap () { register int i; Keymap keymap; keymap = (Keymap)xmalloc (256 * sizeof (KEYMAP_ENTRY)); for (i = 0; i < 256; i++) { keymap[i].type = ISFUNC; keymap[i].function = (VFunction *)NULL; } for (i = 'A'; i < ('Z' + 1); i++) { keymap[i].type = ISFUNC; keymap[i].function = info_do_lowercase_version; } return (keymap); } /* Return a new keymap which is a copy of MAP. */ Keymap keymap_copy_keymap (map) Keymap map; { register int i; Keymap keymap; keymap = keymap_make_keymap (); for (i = 0; i < 256; i++) { keymap[i].type = map[i].type; keymap[i].function = map[i].function; } return (keymap); } /* Free the keymap and it's descendents. */ void keymap_discard_keymap (map) Keymap (map); { register int i; if (!map) return; for (i = 0; i < 256; i++) { switch (map[i].type) { case ISFUNC: break; case ISKMAP: keymap_discard_keymap ((Keymap)map[i].function); break; } } } /* Initialize the standard info keymaps. */ Keymap info_keymap = (Keymap)NULL; Keymap echo_area_keymap = (Keymap)NULL; void initialize_info_keymaps () { register int i; Keymap map; if (!info_keymap) { info_keymap = keymap_make_keymap (); info_keymap[ESC].type = ISKMAP; info_keymap[ESC].function = (VFunction *)keymap_make_keymap (); info_keymap[Control ('x')].type = ISKMAP; info_keymap[Control ('x')].function = (VFunction *)keymap_make_keymap (); echo_area_keymap = keymap_make_keymap (); echo_area_keymap[ESC].type = ISKMAP; echo_area_keymap[ESC].function = (VFunction *)keymap_make_keymap (); echo_area_keymap[Control ('x')].type = ISKMAP; echo_area_keymap[Control ('x')].function = (VFunction *)keymap_make_keymap (); } /* Bind numeric arg functions for both echo area and info window maps. */ for (i = '0'; i < '9' + 1; i++) { ((Keymap) info_keymap[ESC].function)[i].function = ((Keymap) echo_area_keymap[ESC].function)[i].function = info_add_digit_to_numeric_arg; } ((Keymap) info_keymap[ESC].function)['-'].function = ((Keymap) echo_area_keymap[ESC].function)['-'].function = info_add_digit_to_numeric_arg; /* Bind the echo area routines. */ map = echo_area_keymap; /* Bind the echo area insert routines. */ for (i = 0; i < 160; i++) if (isprint (i)) map[i].function = ea_insert; map[Control ('a')].function = ea_beg_of_line; map[Control ('b')].function = ea_backward; map[Control ('d')].function = ea_delete; map[Control ('e')].function = ea_end_of_line; map[Control ('f')].function = ea_forward; map[Control ('g')].function = ea_abort; map[Control ('h')].function = ea_rubout; map[Control ('k')].function = ea_kill_line; map[Control ('l')].function = info_redraw_display; map[Control ('q')].function = ea_quoted_insert; map[Control ('t')].function = ea_transpose_chars; map[Control ('u')].function = info_universal_argument; map[Control ('y')].function = ea_yank; map[LFD].function = ea_newline; map[RET].function = ea_newline; map[SPC].function = ea_complete; map[TAB].function = ea_complete; map['?'].function = ea_possible_completions; map[DEL].function = ea_rubout; /* Bind the echo area ESC keymap. */ map = (Keymap)echo_area_keymap[ESC].function; map[Control ('g')].function = ea_abort; map[Control ('v')].function = ea_scroll_completions_window; map['b'].function = ea_backward_word; map['d'].function = ea_kill_word; map['f'].function = ea_forward_word; #if defined (NAMED_FUNCTIONS) /* map['x'].function = info_execute_command; */ #endif /* NAMED_FUNCTIONS */ map['y'].function = ea_yank_pop; map['?'].function = ea_possible_completions; map[TAB].function = ea_tab_insert; map[DEL].function = ea_backward_kill_word; /* Bind the echo area Control-x keymap. */ map = (Keymap)echo_area_keymap[Control ('x')].function; map['o'].function = info_next_window; map[DEL].function = ea_backward_kill_line; /* Bind commands for Info window keymaps. */ map = info_keymap; map[TAB].function = info_move_to_next_xref; map[LFD].function = info_select_reference_this_line; map[RET].function = info_select_reference_this_line; map[SPC].function = info_scroll_forward; map[Control ('a')].function = info_beginning_of_line; map[Control ('b')].function = info_backward_char; map[Control ('e')].function = info_end_of_line; map[Control ('f')].function = info_forward_char; map[Control ('g')].function = info_abort_key; map[Control ('h')].function = info_get_help_window; map[Control ('l')].function = info_redraw_display; map[Control ('n')].function = info_next_line; map[Control ('p')].function = info_prev_line; map[Control ('r')].function = isearch_backward; map[Control ('s')].function = isearch_forward; map[Control ('u')].function = info_universal_argument; map[Control ('v')].function = info_scroll_forward; map[','].function = info_next_index_match; for (i = '1'; i < '9' + 1; i++) map[i].function = info_menu_digit; map['0'].function = info_last_menu_item; map['<'].function = info_first_node; map['>'].function = info_last_node; map['?'].function = info_get_help_window; map['['].function = info_global_prev_node; map[']'].function = info_global_next_node; map['b'].function = info_beginning_of_node; map['d'].function = info_dir_node; map['e'].function = info_end_of_node; map['f'].function = info_xref_item; map['g'].function = info_goto_node; map['h'].function = info_get_info_help_node; map['i'].function = info_index_search; map['l'].function = info_history_node; map['m'].function = info_menu_item; map['n'].function = info_next_node; map['p'].function = info_prev_node; map['q'].function = info_quit; map['r'].function = info_xref_item; map['s'].function = info_search; map['t'].function = info_top_node; map['u'].function = info_up_node; map[DEL].function = info_scroll_backward; /* Bind members in the ESC map for Info windows. */ map = (Keymap)info_keymap[ESC].function; map[Control ('f')].function = info_show_footnotes; map[Control ('g')].function = info_abort_key; map[TAB].function = info_move_to_prev_xref; map[Control ('v')].function = info_scroll_other_window; map['<'].function = info_beginning_of_node; map['>'].function = info_end_of_node; map['b'].function = info_backward_word; map['f'].function = info_forward_word; map['r'].function = info_move_to_window_line; map['v'].function = info_scroll_backward; #if defined (NAMED_FUNCTIONS) map['x'].function = info_execute_command; #endif /* NAMED_FUNCTIONS */ /* Bind members in the Control-X map for Info windows. */ map = (Keymap)info_keymap[Control ('x')].function; map[Control ('b')].function = list_visited_nodes; map[Control ('c')].function = info_quit; map[Control ('f')].function = info_view_file; map[Control ('g')].function = info_abort_key; map[Control ('v')].function = info_view_file; map['0'].function = info_delete_window; map['1'].function = info_keep_one_window; map['2'].function = info_split_window; map['^'].function = info_grow_window; map['b'].function = select_visited_node; map['k'].function = info_kill_node; map['o'].function = info_next_window; map['t'].function = info_tile_windows; map['w'].function = info_toggle_wrap; } octave-1.1.0/info/m-x.c100666 415 17 11336 5333270136 12765 0ustar jweusers/* m-x.c -- Meta-X minibuffer reader. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* **************************************************************** */ /* */ /* Reading Named Commands */ /* */ /* **************************************************************** */ /* Read the name of an Info function in the echo area and return the name. A return value of NULL indicates that no function name could be read. */ char * read_function_name (prompt, window) char *prompt; WINDOW *window; { register int i; char *line; REFERENCE **array = (REFERENCE **)NULL; int array_index = 0, array_slots = 0; /* Make an array of REFERENCE which actually contains the names of the functions available in Info. */ for (i = 0; function_doc_array[i].func; i++) { REFERENCE *entry; entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->label = savestring (function_doc_array[i].func_name); entry->nodename = (char *)NULL; entry->filename = (char *)NULL; add_pointer_to_array (entry, array_index, array, array_slots, 200, REFERENCE *); } line = info_read_completing_in_echo_area (window, prompt, array); info_free_references (array); if (!echo_area_is_active) window_clear_echo_area (); return (line); } DECLARE_INFO_COMMAND (describe_command, "Read the name of an Info command and describe it") { char *line; line = read_function_name ("Describe command: ", window); if (!line) { info_abort_key (active_window, count, key); return; } /* Describe the function named in "LINE". */ if (*line) { char *fundoc; VFunction *fun; fun = named_function (line); if (!fun) return; window_message_in_echo_area ("%s: %s.", line, function_documentation (fun)); } free (line); } DECLARE_INFO_COMMAND (info_execute_command, "Read a command name in the echo area and execute it") { char *line; /* Ask the completer to read a reference for us. */ if (info_explicit_arg || count != 1) { char *prompt; prompt = (char *)xmalloc (20); sprintf (prompt, "%d M-x ", count); line = read_function_name (prompt, window); } else line = read_function_name ("M-x ", window); /* User aborted? */ if (!line) { info_abort_key (active_window, count, key); return; } /* User accepted "default"? (There is none.) */ if (!*line) { free (line); return; } /* User wants to execute a named command. Do it. */ { VFunction *function; if ((active_window != the_echo_area) && (strncmp (line, "echo-area-", 10) == 0)) { free (line); info_error ("Cannot execute an `echo-area' command here."); return; } function = named_function (line); free (line); if (!function) return; (*function) (active_window, count, 0); } } /* Okay, now that we have M-x, let the user set the screen height. */ DECLARE_INFO_COMMAND (set_screen_height, "Set the height of the displayed window") { int new_height; if (info_explicit_arg || count != 1) new_height = count; else { char prompt[80]; char *line; new_height = screenheight; sprintf (prompt, "Set screen height to (%d): ", new_height); line = info_read_in_echo_area (window, prompt); /* If the user aborted, do that now. */ if (!line) { info_abort_key (active_window, count, 0); return; } /* Find out what the new height is supposed to be. */ if (*line) new_height = atoi (line); /* Clear the echo area if it isn't active. */ if (!echo_area_is_active) window_clear_echo_area (); free (line); } terminal_clear_screen (); display_clear_display (the_display); screenheight = new_height; display_initialize_display (screenwidth, screenheight); window_new_screen_size (screenwidth, screenheight); } octave-1.1.0/info/nodes.c100666 415 17 104522 5377240221 13414 0ustar jweusers/* nodes.c -- How to get an Info file and node. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include #include #include #include "nodes.h" #include "search.h" #include "filesys.h" #include "info-utils.h" #if !defined (O_RDONLY) #if defined (HAVE_SYS_FCNTL_H) #include #else /* !HAVE_SYS_FCNTL_H */ #include #endif /* !HAVE_SYS_FCNTL_H */ #endif /* !O_RDONLY */ #if !defined (errno) extern int errno; #endif /* !errno */ /* **************************************************************** */ /* */ /* Functions Static to this File */ /* */ /* **************************************************************** */ static void forget_info_file (), remember_info_file (); static void free_file_buffer_tags (), free_info_tag (); static void get_nodes_of_tags_table (), get_nodes_of_info_file (); static void get_tags_of_indirect_tags_table (); static void info_reload_file_buffer_contents (); static char *adjust_nodestart (); static FILE_BUFFER *make_file_buffer (); static FILE_BUFFER *info_load_file_internal (), *info_find_file_internal (); static NODE *info_node_of_file_buffer_tags (); static long get_node_length (); /* Magic number that RMS used to decide how much a tags table pointer could be off by. I feel that it should be much smaller, like on the order of 4. */ #define DEFAULT_INFO_FUDGE 1000 /* Passed to *_internal functions. INFO_GET_TAGS says to do what is neccessary to fill in the nodes or tags arrays in FILE_BUFFER. */ #define INFO_NO_TAGS 0 #define INFO_GET_TAGS 1 /* **************************************************************** */ /* */ /* Global Variables */ /* */ /* **************************************************************** */ /* When non-zero, this is a string describing the recent file error. */ char *info_recent_file_error = (char *)NULL; /* The list of already loaded nodes. */ FILE_BUFFER **info_loaded_files = (FILE_BUFFER **)NULL; /* The number of slots currently allocated to LOADED_FILES. */ int info_loaded_files_slots = 0; /* **************************************************************** */ /* */ /* Public Functions for Node Manipulation */ /* */ /* **************************************************************** */ /* Used to build "dir" menu from "localdir" files found in INFOPATH. */ extern void maybe_build_dir_node (); /* Return a pointer to a NODE structure for the Info node (FILENAME)NODENAME. FILENAME can be passed as NULL, in which case the filename of "dir" is used. NODENAME can be passed as NULL, in which case the nodename of "Top" is used. If the node cannot be found, return a NULL pointer. */ NODE * info_get_node (filename, nodename) char *filename, *nodename; { FILE_BUFFER *file_buffer; NODE *node; file_buffer = (FILE_BUFFER *)NULL; info_recent_file_error = (char *)NULL; info_parse_node (nodename, DONT_SKIP_NEWLINES); nodename = (char *)NULL; if (info_parsed_filename) filename = info_parsed_filename; if (info_parsed_nodename) nodename = info_parsed_nodename; /* If FILENAME is not specified, it defaults to "dir". */ if (!filename) filename = "dir"; /* If the file to be looked up is "dir", build the contents from all of the "localdir"'s found in INFOPATH. */ if (stricmp (filename, "dir") == 0) maybe_build_dir_node (filename, "localdir"); /* Find the correct info file. */ file_buffer = info_find_file (filename); if (!file_buffer) { if (filesys_error_number) info_recent_file_error = filesys_error_string (filename, filesys_error_number); return ((NODE *)NULL); } node = info_get_node_of_file_buffer (nodename, file_buffer); /* If the node looked for was "Top", try again looking for the node under a slightly different name. */ if (!node && (nodename == NULL || stricmp (nodename, "Top") == 0)) { node = info_get_node_of_file_buffer ("Top", file_buffer); if (!node) node = info_get_node_of_file_buffer ("top", file_buffer); if (!node) node = info_get_node_of_file_buffer ("TOP", file_buffer); } return (node); } /* Return a pointer to a NODE structure for the Info node NODENAME in FILE_BUFFER. NODENAME can be passed as NULL, in which case the nodename of "Top" is used. If the node cannot be found, return a NULL pointer. */ NODE * info_get_node_of_file_buffer (nodename, file_buffer) char *nodename; FILE_BUFFER *file_buffer; { NODE *node = (NODE *)NULL; /* If we are unable to find the file, we have to give up. There isn't anything else we can do. */ if (!file_buffer) return ((NODE *)NULL); /* If the file buffer was gc'ed, reload the contents now. */ if (!file_buffer->contents) info_reload_file_buffer_contents (file_buffer); /* If NODENAME is not specified, it defaults to "Top". */ if (!nodename) nodename = "Top"; /* If the name of the node that we wish to find is exactly "*", then the node body is the contents of the entire file. Create and return such a node. */ if (strcmp (nodename, "*") == 0) { node = (NODE *)xmalloc (sizeof (NODE)); node->filename = file_buffer->fullpath; node->parent = (char *)NULL; node->nodename = savestring ("*"); node->contents = file_buffer->contents; node->nodelen = file_buffer->filesize; node->flags = 0; } /* If this is the "main" info file, it might contain a tags table. Search the tags table for an entry which matches the node that we want. If there is a tags table, get the file which contains this node, but don't bother building a node list for it. */ else if (file_buffer->tags) node = info_node_of_file_buffer_tags (file_buffer, nodename); /* Return the results of our node search. */ return (node); } /* Locate the file named by FILENAME, and return the information structure describing this file. The file may appear in our list of loaded files already, or it may not. If it does not already appear, find the file, and add it to the list of loaded files. If the file cannot be found, return a NULL FILE_BUFFER *. */ FILE_BUFFER * info_find_file (filename) char *filename; { return (info_find_file_internal (filename, INFO_GET_TAGS)); } /* Load the info file FILENAME, remembering information about it in a file buffer. */ FILE_BUFFER * info_load_file (filename) char *filename; { return (info_load_file_internal (filename, INFO_GET_TAGS)); } /* **************************************************************** */ /* */ /* Private Functions Implementation */ /* */ /* **************************************************************** */ /* The workhorse for info_find_file (). Non-zero 2nd argument says to try to build a tags table (or otherwise glean the nodes) for this file once found. By default, we build the tags table, but when this function is called by info_get_node () when we already have a valid tags table describing the nodes, it is unnecessary. */ static FILE_BUFFER * info_find_file_internal (filename, get_tags) char *filename; int get_tags; { register int i; register FILE_BUFFER *file_buffer; /* First try to find the file in our list of already loaded files. */ if (info_loaded_files) { for (i = 0; file_buffer = info_loaded_files[i]; i++) if ((strcmp (filename, file_buffer->filename) == 0) || (strcmp (filename, file_buffer->fullpath) == 0) || ((*filename != '/') && strcmp (filename, filename_non_directory (file_buffer->fullpath)) == 0)) { struct stat new_info, *old_info; /* This file is loaded. If the filename that we want is specifically "dir", then simply return the file buffer. */ if (stricmp (filename_non_directory (filename), "dir") == 0) return (file_buffer); /* The file appears to be already loaded, and it is not "dir". Check to see if it has changed since the last time it was loaded. */ if (stat (file_buffer->fullpath, &new_info) == -1) { filesys_error_number = errno; return ((FILE_BUFFER *)NULL); } old_info = &file_buffer->finfo; if ((new_info.st_size != old_info->st_size) || (new_info.st_mtime != old_info->st_mtime)) { /* The file has changed. Forget that we ever had loaded it in the first place. */ forget_info_file (filename); break; } else { /* The info file exists, and has not changed since the last time it was loaded. If the caller requested a nodes list for this file, and there isn't one here, build the nodes for this file_buffer. In any case, return the file_buffer object. */ if (get_tags && !file_buffer->tags) build_tags_and_nodes (file_buffer); return (file_buffer); } } } /* The file wasn't loaded. Try to load it now. */ file_buffer = info_load_file_internal (filename, get_tags); /* If the file was loaded, remember the name under which it was found. */ if (file_buffer) remember_info_file (file_buffer); return (file_buffer); } /* The workhorse function for info_load_file (). Non-zero second argument says to build a list of tags (or nodes) for this file. This is the default behaviour when info_load_file () is called, but it is not necessary when loading a subfile for which we already have tags. */ static FILE_BUFFER * info_load_file_internal (filename, get_tags) char *filename; int get_tags; { char *fullpath, *contents; long filesize; struct stat finfo; int retcode; FILE_BUFFER *file_buffer = (FILE_BUFFER *)NULL; /* Get the full pathname of this file, as known by the info system. That is to say, search along INFOPATH and expand tildes, etc. */ fullpath = info_find_fullpath (filename); /* Did we actually find the file? */ retcode = stat (fullpath, &finfo); /* If the file referenced by the name returned from info_find_fullpath () doesn't exist, then try again with the last part of the filename appearing in lowercase. */ if (retcode < 0) { char *lowered_name; char *basename; lowered_name = savestring (filename); basename = (char *)rindex (lowered_name, '/'); if (basename) basename++; else basename = lowered_name; while (*basename) { if (isupper (*basename)) *basename = tolower (*basename); basename++; } fullpath = info_find_fullpath (lowered_name); free (lowered_name); retcode = stat (fullpath, &finfo); } /* If the file wasn't found, give up, returning a NULL pointer. */ if (retcode < 0) { filesys_error_number = errno; return ((FILE_BUFFER *)NULL); } /* Otherwise, try to load the file. */ contents = filesys_read_info_file (fullpath, &filesize, &finfo); if (!contents) return ((FILE_BUFFER *)NULL); /* The file was found, and can be read. Allocate FILE_BUFFER and fill in the various members. */ file_buffer = make_file_buffer (); file_buffer->filename = savestring (filename); file_buffer->fullpath = savestring (fullpath); file_buffer->finfo = finfo; file_buffer->filesize = filesize; file_buffer->contents = contents; if (file_buffer->filesize != file_buffer->finfo.st_size) file_buffer->flags |= N_IsCompressed; /* If requested, build the tags and nodes for this file buffer. */ if (get_tags) build_tags_and_nodes (file_buffer); return (file_buffer); } /* Grovel FILE_BUFFER->contents finding tags and nodes, and filling in the various slots. This can also be used to rebuild a tag or node table. */ void build_tags_and_nodes (file_buffer) FILE_BUFFER *file_buffer; { SEARCH_BINDING binding; long position; free_file_buffer_tags (file_buffer); file_buffer->flags &= ~N_HasTagsTable; /* See if there is a tags table in this info file. */ binding.buffer = file_buffer->contents; binding.start = file_buffer->filesize; binding.end = binding.start - 1000; if (binding.end < 0) binding.end = 0; binding.flags = S_FoldCase; position = search_backward (TAGS_TABLE_END_LABEL, &binding); /* If there is a tag table, find the start of it, and grovel over it extracting tag information. */ if (position != -1) while (1) { long tags_table_begin, tags_table_end; binding.end = position; binding.start = binding.end - 5 - strlen (TAGS_TABLE_END_LABEL); if (binding.start < 0) binding.start = 0; position = find_node_separator (&binding); /* For this test, (and all others here) failure indicates a bogus tags table. Grovel the file. */ if (position == -1) break; /* Remember the end of the tags table. */ binding.start = position; tags_table_end = binding.start; binding.end = 0; /* Locate the start of the tags table. */ position = search_backward (TAGS_TABLE_BEG_LABEL, &binding); if (position == -1) break; binding.end = position; binding.start = binding.end - 5 - strlen (TAGS_TABLE_BEG_LABEL); position = find_node_separator (&binding); if (position == -1) break; /* The file contains a valid tags table. Fill the FILE_BUFFER's tags member. */ file_buffer->flags |= N_HasTagsTable; tags_table_begin = position; /* If this isn't an indirect tags table, just remember the nodes described locally in this tags table. Note that binding.end is pointing to just after the beginning label. */ binding.start = binding.end; binding.end = file_buffer->filesize; if (!looking_at (TAGS_TABLE_IS_INDIRECT_LABEL, &binding)) { binding.start = tags_table_begin; binding.end = tags_table_end; get_nodes_of_tags_table (file_buffer, &binding); return; } else { /* This is an indirect tags table. Build TAGS member. */ SEARCH_BINDING indirect; indirect.start = tags_table_begin; indirect.end = 0; indirect.buffer = binding.buffer; indirect.flags = S_FoldCase; position = search_backward (INDIRECT_TAGS_TABLE_LABEL, &indirect); if (position == -1) { /* This file is malformed. Give up. */ return; } indirect.start = position; indirect.end = tags_table_begin; binding.start = tags_table_begin; binding.end = tags_table_end; get_tags_of_indirect_tags_table (file_buffer, &indirect, &binding); return; } } /* This file doesn't contain any kind of tags table. Grovel the file and build node entries for it. */ get_nodes_of_info_file (file_buffer); } /* Search through FILE_BUFFER->contents building an array of TAG *, one entry per each node present in the file. Store the tags in FILE_BUFFER->tags, and the number of allocated slots in FILE_BUFFER->tags_slots. */ static void get_nodes_of_info_file (file_buffer) FILE_BUFFER *file_buffer; { long nodestart; int tags_index = 0; SEARCH_BINDING binding; binding.buffer = file_buffer->contents; binding.start = 0; binding.end = file_buffer->filesize; binding.flags = S_FoldCase; while ((nodestart = find_node_separator (&binding)) != -1) { int start, end; char *nodeline; TAG *entry; /* Skip past the characters just found. */ binding.start = nodestart; binding.start += skip_node_separator (binding.buffer + binding.start); /* Move to the start of the line defining the node. */ nodeline = binding.buffer + binding.start; /* Find "Node:" */ start = string_in_line (INFO_NODE_LABEL, nodeline); /* If not there, this is not the start of a node. */ if (start == -1) continue; /* Find the start of the nodename. */ start += skip_whitespace (nodeline + start); /* Find the end of the nodename. */ end = start + skip_node_characters (nodeline + start, DONT_SKIP_NEWLINES); /* Okay, we have isolated the node name, and we know where the node starts. Remember this information in a NODE structure. */ entry = (TAG *)xmalloc (sizeof (TAG)); entry->nodename = (char *)xmalloc (1 + (end - start)); strncpy (entry->nodename, nodeline + start, end - start); entry->nodename[end - start] = '\0'; entry->nodestart = nodestart; { SEARCH_BINDING node_body; node_body.buffer = binding.buffer + binding.start; node_body.start = 0; node_body.end = binding.end - binding.start; node_body.flags = S_FoldCase; entry->nodelen = get_node_length (&node_body); } entry->filename = file_buffer->fullpath; /* Add this tag to the array of tag structures in this FILE_BUFFER. */ add_pointer_to_array (entry, tags_index, file_buffer->tags, file_buffer->tags_slots, 100, TAG *); } } /* Return the length of the node which starts at BINDING. */ static long get_node_length (binding) SEARCH_BINDING *binding; { register int i; char *body; /* From the Info-RFC file: [A node] ends with either a ^_, a ^L, or the end of file. */ for (i = binding->start, body = binding->buffer; i < binding->end; i++) { if (body[i] == INFO_FF || body[i] == INFO_COOKIE) break; } return ((long) i - binding->start); } /* Build and save the array of nodes in FILE_BUFFER by searching through the contents of BUFFER_BINDING for a tags table, and groveling the contents. */ static void get_nodes_of_tags_table (file_buffer, buffer_binding) FILE_BUFFER *file_buffer; SEARCH_BINDING *buffer_binding; { int offset, tags_index = 0; SEARCH_BINDING *search; long position; search = copy_binding (buffer_binding); /* Find the start of the tags table. */ position = find_tags_table (search); /* If none, we're all done. */ if (position == -1) return; /* Move to one character before the start of the actual table. */ search->start = position; search->start += skip_node_separator (search->buffer + search->start); search->start += strlen (TAGS_TABLE_BEG_LABEL); search->start--; /* The tag table consists of lines containing node names and positions. Do each line until we find one that doesn't contain a node name. */ while ((position = search_forward ("\n", search)) != -1) { TAG *entry; char *nodedef; /* Prepare to skip this line. */ search->start = position; search->start++; /* Skip past informative "(Indirect)" tags table line. */ if (!tags_index && looking_at (TAGS_TABLE_IS_INDIRECT_LABEL, search)) continue; /* Find the label preceding the node name. */ offset = string_in_line (INFO_NODE_LABEL, search->buffer + search->start); /* If not there, not a defining line, so we must be out of the tags table. */ if (offset == -1) break; /* Point to the beginning of the node definition. */ search->start += offset; nodedef = search->buffer + search->start; nodedef += skip_whitespace (nodedef); /* Move past the node's name. */ for (offset = 0; (nodedef[offset]) && (nodedef[offset] != INFO_TAGSEP); offset++); if (nodedef[offset] != INFO_TAGSEP) continue; entry = (TAG *)xmalloc (sizeof (TAG)); entry->nodename = (char *)xmalloc (1 + offset); strncpy (entry->nodename, nodedef, offset); entry->nodename[offset] = '\0'; offset++; entry->nodestart = (long) atol (nodedef + offset); /* We don't know the length of this node yet. */ entry->nodelen = -1; /* The filename of this node is currently known as the same as the name of this file. */ entry->filename = file_buffer->fullpath; /* Add this node structure to the array of node structures in this FILE_BUFFER. */ add_pointer_to_array (entry, tags_index, file_buffer->tags, file_buffer->tags_slots, 100, TAG *); } free (search); } /* A structure used only in get_tags_of_indirect_tags_table () to hold onto an intermediate value. */ typedef struct { char *filename; long first_byte; } SUBFILE; /* Remember in FILE_BUFFER the nodenames, subfilenames, and offsets within the subfiles of every node which appears in TAGS_BINDING. The 2nd argument is a binding surrounding the indirect files list. */ static void get_tags_of_indirect_tags_table (file_buffer, indirect_binding, tags_binding) FILE_BUFFER *file_buffer; SEARCH_BINDING *indirect_binding, *tags_binding; { register int i; SUBFILE **subfiles = (SUBFILE **)NULL; int subfiles_index = 0, subfiles_slots = 0; TAG *entry; /* First get the list of tags from the tags table. Then lookup the associated file in the indirect list for each tag, and update it. */ get_nodes_of_tags_table (file_buffer, tags_binding); /* We have the list of tags in file_buffer->tags. Get the list of subfiles from the indirect table. */ { char *start, *end, *line; SUBFILE *subfile; start = indirect_binding->buffer + indirect_binding->start; end = indirect_binding->buffer + indirect_binding->end; line = start; while (line < end) { int colon; colon = string_in_line (":", line); if (colon == -1) break; subfile = (SUBFILE *)xmalloc (sizeof (SUBFILE)); subfile->filename = (char *)xmalloc (colon); strncpy (subfile->filename, line, colon - 1); subfile->filename[colon - 1] = '\0'; subfile->first_byte = (long) atol (line + colon); add_pointer_to_array (subfile, subfiles_index, subfiles, subfiles_slots, 10, SUBFILE *); while (*line++ != '\n'); } } /* If we have successfully built the indirect files table, then merge the information in the two tables. */ if (!subfiles) { free_file_buffer_tags (file_buffer); return; } else { register int tags_index; long header_length; SEARCH_BINDING binding; /* Find the length of the header of the file containing the indirect tags table. This header appears at the start of every file. We want the absolute position of each node within each subfile, so we subtract the start of the containing subfile from the logical position of the node, and then add the length of the header in. */ binding.buffer = file_buffer->contents; binding.start = 0; binding.end = file_buffer->filesize; binding.flags = S_FoldCase; header_length = find_node_separator (&binding); if (header_length == -1) header_length = 0; /* Build the file buffer's list of subfiles. */ { char *containing_dir, *temp; int len_containing_dir; containing_dir = savestring (file_buffer->fullpath); temp = (char *)rindex (containing_dir, '/'); if (temp) *temp = '\0'; len_containing_dir = strlen (containing_dir); for (i = 0; subfiles[i]; i++); file_buffer->subfiles = (char **) xmalloc ((1 + i) * sizeof (char *)); for (i = 0; subfiles[i]; i++) { char *fullpath; fullpath = (char *) xmalloc (2 + strlen (subfiles[i]->filename) + len_containing_dir); sprintf (fullpath, "%s/%s", containing_dir, subfiles[i]->filename); file_buffer->subfiles[i] = fullpath; } file_buffer->subfiles[i] = (char *)NULL; free (containing_dir); } /* For each node in the file's tags table, remember the starting position. */ for (tags_index = 0; entry = file_buffer->tags[tags_index]; tags_index++) { for (i = 0; subfiles[i] && entry->nodestart >= subfiles[i]->first_byte; i++); /* If the Info file containing the indirect tags table is malformed, then give up. */ if (!i) { /* The Info file containing the indirect tags table is malformed. Give up. */ for (i = 0; subfiles[i]; i++) { free (subfiles[i]->filename); free (subfiles[i]); free (file_buffer->subfiles[i]); } file_buffer->subfiles = (char **)NULL; free_file_buffer_tags (file_buffer); return; } /* SUBFILES[i] is the index of the first subfile whose logical first byte is greater than the logical offset of this node's starting position. This means that the subfile directly preceding this one is the one containing the node. */ entry->filename = file_buffer->subfiles[i - 1]; entry->nodestart -= subfiles[i -1]->first_byte; entry->nodestart += header_length; entry->nodelen = -1; } /* We have successfully built the tags table. Remember that it was indirect. */ file_buffer->flags |= N_TagsIndirect; } /* Free the structures assigned to SUBFILES. Free the names as well as the structures themselves, then finally, the array. */ for (i = 0; subfiles[i]; i++) { free (subfiles[i]->filename); free (subfiles[i]); } free (subfiles); } /* Return the node from FILE_BUFFER which matches NODENAME by searching the tags table in FILE_BUFFER. If the node could not be found, return a NULL pointer. */ static NODE * info_node_of_file_buffer_tags (file_buffer, nodename) FILE_BUFFER *file_buffer; char *nodename; { register int i; TAG *tag; for (i = 0; tag = file_buffer->tags[i]; i++) if (strcmp (nodename, tag->nodename) == 0) { FILE_BUFFER *subfile; subfile = info_find_file_internal (tag->filename, INFO_NO_TAGS); if (!subfile) return ((NODE *)NULL); if (!subfile->contents) info_reload_file_buffer_contents (subfile); if (!subfile->contents) return ((NODE *)NULL); /* If we were able to find this file and load it, then return the node within it. */ { NODE *node; node = (NODE *)xmalloc (sizeof (NODE)); node->filename = (subfile->fullpath); node->nodename = tag->nodename; node->contents = subfile->contents + tag->nodestart; node->flags = 0; node->parent = (char *)NULL; if (file_buffer->flags & N_HasTagsTable) { node->flags |= N_HasTagsTable; if (file_buffer->flags & N_TagsIndirect) { node->flags |= N_TagsIndirect; node->parent = file_buffer->fullpath; } } if (subfile->flags & N_IsCompressed) node->flags |= N_IsCompressed; /* If TAG->nodelen hasn't been calculated yet, then we aren't in a position to trust the entry pointer. Adjust things so that ENTRY->nodestart gets the exact address of the start of the node separator which starts this node, and NODE->contents gets the address of the line defining this node. If we cannot do that, the node isn't really here. */ if (tag->nodelen == -1) { int min, max; char *node_sep; SEARCH_BINDING node_body; char *buff_end; min = max = DEFAULT_INFO_FUDGE; if (tag->nodestart < DEFAULT_INFO_FUDGE) min = tag->nodestart; if (DEFAULT_INFO_FUDGE > (subfile->filesize - tag->nodestart)) max = subfile->filesize - tag->nodestart; /* NODE_SEP gets the address of the separator which defines this node, or (char *)NULL if the node wasn't found. NODE->contents is side-effected to point to right after the separator. */ node_sep = adjust_nodestart (node, min, max); if (node_sep == (char *)NULL) { free (node); return ((NODE *)NULL); } /* Readjust tag->nodestart. */ tag->nodestart = node_sep - subfile->contents; /* Calculate the length of the current node. */ buff_end = subfile->contents + subfile->filesize; node_body.buffer = node->contents; node_body.start = 0; node_body.end = buff_end - node_body.buffer; node_body.flags = 0; tag->nodelen = get_node_length (&node_body); } else { /* Since we know the length of this node, we have already adjusted tag->nodestart to point to the exact start of it. Simply skip the node separator. */ node->contents += skip_node_separator (node->contents); } node->nodelen = tag->nodelen; return (node); } } /* There was a tag table for this file, and the node wasn't found. Return NULL, since this file doesn't contain the desired node. */ return ((NODE *)NULL); } /* **************************************************************** */ /* */ /* Managing file_buffers, nodes, and tags. */ /* */ /* **************************************************************** */ static FILE_BUFFER * make_file_buffer () { FILE_BUFFER *file_buffer; file_buffer = (FILE_BUFFER *)xmalloc (sizeof (FILE_BUFFER)); file_buffer->filename = file_buffer->fullpath = (char *)NULL; file_buffer->contents = (char *)NULL; file_buffer->tags = (TAG **)NULL; file_buffer->subfiles = (char **)NULL; file_buffer->tags_slots = 0; file_buffer->flags = 0; return (file_buffer); } /* Add FILE_BUFFER to our list of already loaded info files. */ static void remember_info_file (file_buffer) FILE_BUFFER *file_buffer; { int i; for (i = 0; info_loaded_files && info_loaded_files[i]; i++) ; add_pointer_to_array (file_buffer, i, info_loaded_files, info_loaded_files_slots, 10, FILE_BUFFER *); } /* Forget the contents, tags table, nodes list, and names of FILENAME. */ static void forget_info_file (filename) char *filename; { register int i; FILE_BUFFER *file_buffer; if (!info_loaded_files) return; for (i = 0; file_buffer = info_loaded_files[i]; i++) if ((strcmp (filename, file_buffer->filename) == 0) || (strcmp (filename, file_buffer->fullpath) == 0)) { free (file_buffer->filename); free (file_buffer->fullpath); if (file_buffer->contents) free (file_buffer->contents); /* Note that free_file_buffer_tags () also kills the subfiles list, since the subfiles list is only of use in conjunction with tags. */ free_file_buffer_tags (file_buffer); while (info_loaded_files[i] = info_loaded_files[++i]) ; break; } } /* Free the tags (if any) associated with FILE_BUFFER. */ static void free_file_buffer_tags (file_buffer) FILE_BUFFER *file_buffer; { register int i; if (file_buffer->tags) { register TAG *tag; for (i = 0; tag = file_buffer->tags[i]; i++) free_info_tag (tag); free (file_buffer->tags); file_buffer->tags = (TAG **)NULL; file_buffer->tags_slots = 0; } if (file_buffer->subfiles) { for (i = 0; file_buffer->subfiles[i]; i++) free (file_buffer->subfiles[i]); free (file_buffer->subfiles); file_buffer->subfiles = (char **)NULL; } } /* Free the data associated with TAG, as well as TAG itself. */ static void free_info_tag (tag) TAG *tag; { free (tag->nodename); /* We don't free tag->filename, because that filename is part of the subfiles list for the containing FILE_BUFFER. free_info_tags () will free the subfiles when it is appropriate. */ free (tag); } /* Load the contents of FILE_BUFFER->contents. This function is called when a file buffer was loaded, and then in order to conserve memory, the file buffer's contents were freed and the pointer was zero'ed. Note that the file was already loaded at least once successfully, so the tags and/or nodes members are still correctly filled. */ static void info_reload_file_buffer_contents (fb) FILE_BUFFER *fb; { fb->flags &= ~N_IsCompressed; /* Let the filesystem do all the work for us. */ fb->contents = filesys_read_info_file (fb->fullpath, &(fb->filesize), &(fb->finfo)); if (fb->filesize != fb->finfo.st_size) fb->flags |= N_IsCompressed; } /* Return the actual starting memory location of NODE, side-effecting NODE->contents. MIN and MAX are bounds for a search if one is necessary. Because of the way that tags are implemented, the physical nodestart may not actually be where the tag says it is. If that is the case, but the node was found anyway, set N_UpdateTags in NODE->flags. If the node is found, return non-zero. NODE->contents is returned positioned right after the node separator that precedes this node, while the return value is position directly on the separator that precedes this node. If the node could not be found, return a NULL pointer. */ static char * adjust_nodestart (node, min, max) NODE *node; int min, max; { long position; SEARCH_BINDING node_body; /* Define the node body. */ node_body.buffer = node->contents; node_body.start = 0; node_body.end = max; node_body.flags = 0; /* Try the optimal case first. Who knows? This file may actually be formatted (mostly) correctly. */ if (node_body.buffer[0] != INFO_COOKIE && min > 2) node_body.buffer -= 3; position = find_node_separator (&node_body); /* If we found a node start, then check it out. */ if (position != -1) { int sep_len; sep_len = skip_node_separator (node->contents); /* If we managed to skip a node separator, then check for this node being the right one. */ if (sep_len != 0) { char *nodedef, *nodestart; int offset; nodestart = node_body.buffer + position + sep_len; nodedef = nodestart; offset = string_in_line (INFO_NODE_LABEL, nodedef); if (offset != -1) { nodedef += offset; nodedef += skip_whitespace (nodedef); offset = skip_node_characters (nodedef, DONT_SKIP_NEWLINES); if ((offset == strlen (node->nodename)) && (strncmp (node->nodename, nodedef, offset) == 0)) { node->contents = nodestart; return (node_body.buffer + position); } } } } /* Oh well, I guess we have to try to find it in a larger area. */ node_body.buffer = node->contents - min; node_body.start = 0; node_body.end = min + max; node_body.flags = 0; position = find_node_in_binding (node->nodename, &node_body); /* If the node couldn't be found, we lose big. */ if (position == -1) return ((char *)NULL); /* Otherwise, the node was found, but the tags table could need updating (if we used a tag to get here, that is). Set the flag in NODE->flags. */ node->contents = node_body.buffer + position; node->contents += skip_node_separator (node->contents); if (node->flags & N_HasTagsTable) node->flags |= N_UpdateTags; return (node_body.buffer + position); } octave-1.1.0/info/search.c100666 415 17 34260 5517100214 13523 0ustar jweusers/* search.c -- How to search large bodies of text. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include "general.h" #include "search.h" #include "nodes.h" #if !defined (NULL) # define NULL 0x0 #endif /* !NULL */ /* The search functions take two arguments: 1) a string to search for, and 2) a pointer to a SEARCH_BINDING which contains the buffer, start, and end of the search. They return a long, which is the offset from the start of the buffer at which the match was found. An offset of -1 indicates failure. */ /* A function which makes a binding with buffer and bounds. */ SEARCH_BINDING * make_binding (buffer, start, end) char *buffer; long start, end; { SEARCH_BINDING *binding; binding = (SEARCH_BINDING *)xmalloc (sizeof (SEARCH_BINDING)); binding->buffer = buffer; binding->start = start; binding->end = end; binding->flags = 0; return (binding); } /* Make a copy of BINDING without duplicating the data. */ SEARCH_BINDING * copy_binding (binding) SEARCH_BINDING *binding; { SEARCH_BINDING *copy; copy = make_binding (binding->buffer, binding->start, binding->end); copy->flags = binding->flags; return (copy); } /* **************************************************************** */ /* */ /* The Actual Searching Functions */ /* */ /* **************************************************************** */ /* Search forwards or backwards for the text delimited by BINDING. The search is forwards if BINDING->start is greater than BINDING->end. */ long search (string, binding) char *string; SEARCH_BINDING *binding; { long result; /* If the search is backwards, then search backwards, otherwise forwards. */ if (binding->start > binding->end) result = search_backward (string, binding); else result = search_forward (string, binding); return (result); } /* Search forwards for STRING through the text delimited in BINDING. */ long search_forward (string, binding) char *string; SEARCH_BINDING *binding; { register int c, i, len; register char *buff, *end; char *alternate = (char *)NULL; len = strlen (string); /* We match characters in the search buffer against STRING and ALTERNATE. ALTERNATE is a case reversed version of STRING; this is cheaper than case folding each character before comparison. Alternate is only used if the case folding bit is turned on in the passed BINDING. */ if (binding->flags & S_FoldCase) { alternate = savestring (string); for (i = 0; i < len; i++) { if (islower (alternate[i])) alternate[i] = toupper (alternate[i]); else if (isupper (alternate[i])) alternate[i] = tolower (alternate[i]); } } buff = binding->buffer + binding->start; end = binding->buffer + binding->end + 1; while (buff < (end - len)) { for (i = 0; i < len; i++) { c = buff[i]; if ((c != string[i]) && (!alternate || c != alternate[i])) break; } if (!string[i]) { if (alternate) free (alternate); if (binding->flags & S_SkipDest) buff += len; return ((long) (buff - binding->buffer)); } buff++; } if (alternate) free (alternate); return ((long) -1); } /* Search for STRING backwards through the text delimited in BINDING. */ long search_backward (input_string, binding) char *input_string; SEARCH_BINDING *binding; { register int c, i, len; register char *buff, *end; char *string; char *alternate = (char *)NULL; len = strlen (input_string); /* Reverse the characters in the search string. */ string = (char *)xmalloc (1 + len); for (c = 0, i = len - 1; input_string[c]; c++, i--) string[i] = input_string[c]; string[c] = '\0'; /* We match characters in the search buffer against STRING and ALTERNATE. ALTERNATE is a case reversed version of STRING; this is cheaper than case folding each character before comparison. ALTERNATE is only used if the case folding bit is turned on in the passed BINDING. */ if (binding->flags & S_FoldCase) { alternate = savestring (string); for (i = 0; i < len; i++) { if (islower (alternate[i])) alternate[i] = toupper (alternate[i]); else if (isupper (alternate[i])) alternate[i] = tolower (alternate[i]); } } buff = binding->buffer + binding->start; end = binding->buffer + binding->end; while (buff > end + len) { for (i = 0; i < len; i++) { c = *(buff - i); if (c != string[i] && (alternate && c != alternate[i])) break; } if (!string[i]) { free (string); if (alternate) free (alternate); if (binding->flags & S_SkipDest) buff -= len; return ((long) (1 + (buff - binding->buffer))); } buff--; } free (string); if (alternate) free (alternate); return ((long) -1); } /* Find STRING in LINE, returning the offset of the end of the string. Return an offset of -1 if STRING does not appear in LINE. The search is bound by the end of the line (i.e., either NEWLINE or 0). */ int string_in_line (string, line) char *string, *line; { register int end; SEARCH_BINDING binding; /* Find the end of the line. */ for (end = 0; line[end] && line[end] != '\n'; end++); /* Search for STRING within these confines. */ binding.buffer = line; binding.start = 0; binding.end = end; binding.flags = S_FoldCase | S_SkipDest; return (search_forward (string, &binding)); } /* Return non-zero if STRING is the first text to appear at BINDING. */ int looking_at (string, binding) char *string; SEARCH_BINDING *binding; { long search_end; search_end = search (string, binding); /* If the string was not found, SEARCH_END is -1. If the string was found, but not right away, SEARCH_END is != binding->start. Otherwise, the string was found at binding->start. */ return (search_end == binding->start); } /* **************************************************************** */ /* */ /* Small String Searches */ /* */ /* **************************************************************** */ /* Function names that start with "skip" are passed a string, and return an offset from the start of that string. Function names that start with "find" are passed a SEARCH_BINDING, and return an absolute position marker of the item being searched for. "Find" functions return a value of -1 if the item being looked for couldn't be found. */ /* Return the index of the first non-whitespace character in STRING. */ int skip_whitespace (string) char *string; { register int i; for (i = 0; string && whitespace (string[i]); i++); return (i); } /* Return the index of the first non-whitespace or newline character in STRING. */ int skip_whitespace_and_newlines (string) char *string; { register int i; for (i = 0; string && (whitespace (string[i]) || string[i] == '\n'); i++); return (i); } /* Return the index of the first whitespace character in STRING. */ int skip_non_whitespace (string) char *string; { register int i; for (i = 0; string && !whitespace (string[i]); i++); return (i); } /* Return the index of the first non-node character in STRING. Note that this function contains quite a bit of hair to ignore periods in some special cases. This is because we here at GNU ship some info files which contain nodenames that contain periods. No such nodename can start with a period, or continue with whitespace, newline, or ')' immediately following the period. If second argument NEWLINES_OKAY is non-zero, newlines should be skipped while parsing out the nodename specification. */ int skip_node_characters (string, newlines_okay) char *string; int newlines_okay; { register int c, i = 0; int paren_seen = 0; int paren = 0; /* Handle special case. This is when another function has parsed out the filename component of the node name, and we just want to parse out the nodename proper. In that case, a period at the start of the nodename indicates an empty nodename. */ if (string && *string == '.') return (0); if (string && *string == '(') { paren++; paren_seen++; i++; } for (; string && (c = string[i]); i++) { if (paren) { if (c == '(') paren++; else if (c == ')') paren--; continue; } /* If the character following the close paren is a space or period, then this node name has no more characters associated with it. */ if (c == '\t' || c == ',' || c == INFO_TAGSEP || ((!newlines_okay) && (c == '\n')) || ((paren_seen && string[i - 1] == ')') && (c == ' ' || c == '.')) || (c == '.' && ((!string[i + 1]) || (whitespace_or_newline (string[i + 1])) || (string[i + 1] == ')')))) break; } return (i); } #ifndef HAVE_STRICMP int stricmp (string1, string2) char *string1, *string2; { char ch1, ch2; for (;;) { ch1 = *string1++; ch2 = *string2++; if (!(ch1 | ch2)) return (0); ch1 = info_toupper (ch1); ch2 = info_toupper (ch2); if (ch1 != ch2) return (ch1 - ch2); } } #endif #ifndef HAVE_STRNICMP /* Compare at most COUNT characters from string1 to string2. Case doesn't matter. */ int strnicmp (string1, string2, count) char *string1, *string2; int count; { register char ch1, ch2; while (count) { ch1 = *string1++; ch2 = *string2++; ch1 = info_toupper (ch1); ch2 = info_toupper (ch2); if (ch1 == ch2) count--; else break; } return (count); } #endif /* **************************************************************** */ /* */ /* Searching FILE_BUFFER's */ /* */ /* **************************************************************** */ /* Return the absolute position of the first occurence of a node separator in BINDING-buffer. The search starts at BINDING->start. Return -1 if no node separator was found. */ long find_node_separator (binding) SEARCH_BINDING *binding; { register long i; char *body; body = binding->buffer; /* A node is started by [^L]^_[^L]\n. That is to say, the C-l's are optional, but the DELETE and NEWLINE are not. This separator holds true for all separated elements in an Info file, including the tags table (if present) and the indirect tags table (if present). */ for (i = binding->start; i < binding->end - 1; i++) if (((body[i] == INFO_FF && body[i + 1] == INFO_COOKIE) && (body[i + 2] == '\n' || (body[i + 2] == INFO_FF && body[i + 3] == '\n'))) || ((body[i] == INFO_COOKIE) && (body[i + 1] == '\n' || (body[i + 1] == INFO_FF && body[i + 2] == '\n')))) return (i); return (-1); } /* Return the length of the node separator characters that BODY is currently pointing at. */ int skip_node_separator (body) char *body; { register int i; i = 0; if (body[i] == INFO_FF) i++; if (body[i++] != INFO_COOKIE) return (0); if (body[i] == INFO_FF) i++; if (body[i++] != '\n') return (0); return (i); } /* Return the number of characters from STRING to the start of the next line. */ int skip_line (string) char *string; { register int i; for (i = 0; string && string[i] && string[i] != '\n'; i++); if (string[i] == '\n') i++; return (i); } /* Return the absolute position of the beginning of a tags table in this binding starting the search at binding->start. */ long find_tags_table (binding) SEARCH_BINDING *binding; { SEARCH_BINDING search; long position; search.buffer = binding->buffer; search.start = binding->start; search.end = binding->end; search.flags = S_FoldCase; while ((position = find_node_separator (&search)) != -1 ) { search.start = position; search.start += skip_node_separator (search.buffer + search.start); if (looking_at (TAGS_TABLE_BEG_LABEL, &search)) return (position); } return (-1); } /* Return the absolute position of the node named NODENAME in BINDING. This is a brute force search, and we wish to avoid it when possible. This function is called when a tag (indirect or otherwise) doesn't really point to the right node. It returns the absolute position of the separator preceding the node. */ long find_node_in_binding (nodename, binding) char *nodename; SEARCH_BINDING *binding; { register long position; register int offset, namelen; SEARCH_BINDING search; namelen = strlen (nodename); search.buffer = binding->buffer; search.start = binding->start; search.end = binding->end; search.flags = 0; while ((position = find_node_separator (&search)) != -1) { search.start = position; search.start += skip_node_separator (search.buffer + search.start); offset = string_in_line (INFO_NODE_LABEL, search.buffer + search.start); if (offset == -1) continue; search.start += offset; search.start += skip_whitespace (search.buffer + search.start); offset = skip_node_characters (search.buffer + search.start, DONT_SKIP_NEWLINES); /* Notice that this is an exact match. You cannot grovel through the buffer with this function looking for random nodes. */ if ((offset == namelen) && (search.buffer[search.start] == nodename[0]) && (strncmp (search.buffer + search.start, nodename, offset) == 0)) return (position); } return (-1); } octave-1.1.0/info/session.c100666 415 17 323304 5627213554 13777 0ustar jweusers/* session.c -- The user windowing interface to Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include #include #include #if defined (HAVE_SYS_TIME_H) # include # define HAVE_STRUCT_TIMEVAL #endif /* HAVE_SYS_TIME_H */ static void info_clear_pending_input (), info_set_pending_input (); static void info_handle_pointer (); /* **************************************************************** */ /* */ /* Running an Info Session */ /* */ /* **************************************************************** */ /* The place that we are reading input from. */ static FILE *info_input_stream = (FILE *)NULL; /* The last executed command. */ VFunction *info_last_executed_command = (VFunction *)NULL; /* Becomes non-zero when 'q' is typed to an Info window. */ int quit_info_immediately = 0; /* Array of structures describing for each window which nodes have been visited in that window. */ INFO_WINDOW **info_windows = (INFO_WINDOW **)NULL; /* Where to add the next window, if we need to add one. */ static int info_windows_index = 0; /* Number of slots allocated to INFO_WINDOWS. */ static int info_windows_slots = 0; void remember_window_and_node (), forget_window_and_nodes (); void display_startup_message_and_start (), info_session (); void finish_info_session (); int initialize_info_session (); /* Begin an info session finding the nodes specified by FILENAME and NODENAMES. For each loaded node, create a new window. Always split the largest of the available windows. */ void begin_multiple_window_info_session (filename, nodenames) char *filename; char **nodenames; { register int i; WINDOW *window = (WINDOW *)NULL; for (i = 0; nodenames[i]; i++) { NODE *node; node = info_get_node (filename, nodenames[i]); if (!node) break; /* If this is the first node, initialize the info session. */ if (!window) { initialize_info_session (node, 1); window = active_window; } else { /* Find the largest window in WINDOWS, and make that be the active one. Then split it and add our window and node to the list of remembered windows and nodes. Then tile the windows. */ register WINDOW *win, *largest = (WINDOW *)NULL; int max_height = 0; for (win = windows; win; win = win->next) if (win->height > max_height) { max_height = win->height; largest = win; } if (!largest) { display_update_display (windows); info_error (CANT_FIND_WIND); info_session (); exit (0); } active_window = largest; window = window_make_window (node); if (window) { window_tile_windows (TILE_INTERNALS); remember_window_and_node (window, node); } else { display_update_display (windows); info_error (WIN_TOO_SMALL); info_session (); exit (0); } } } display_startup_message_and_start (); } /* Start an info session with INITIAL_NODE, and an error message in the echo area made from FORMAT and ARG. */ void begin_info_session_with_error (initial_node, format, arg) NODE *initial_node; char *format; void *arg; { initialize_info_session (initial_node, 1); info_error (format, arg, (void *)NULL); info_session (); } /* Start an info session with INITIAL_NODE. */ void begin_info_session (initial_node) NODE *initial_node; { initialize_info_session (initial_node, 1); display_startup_message_and_start (); } void finish_info_session () { close_dribble_file (); clear_info_signal_handler (); } void display_startup_message_and_start () { char *format; format = replace_in_documentation ("Welcome to Info version %s. Type \"\\[get-help-window]\" for help."); window_message_in_echo_area (format, version_string ()); info_session (); } /* Run an info session with an already initialized window and node. */ void info_session () { terminal_prep_terminal (); display_update_display (windows); info_last_executed_command = (VFunction *)NULL; info_read_and_dispatch (); terminal_unprep_terminal (); close_dribble_file (); } /* Here is a window-location dependent event loop. Called from the functions info_session (), and from read_xxx_in_echo_area (). */ void info_read_and_dispatch () { unsigned char key; int done; done = 0; while (!done && !quit_info_immediately) { int lk; /* If we haven't just gone up or down a line, there is no goal column for this window. */ if ((info_last_executed_command != info_next_line) && (info_last_executed_command != info_prev_line)) active_window->goal_column = -1; if (echo_area_is_active) { lk = echo_area_last_command_was_kill; echo_area_prep_read (); } if (!info_any_buffered_input_p ()) display_update_display (windows); display_cursor_at_point (active_window); info_initialize_numeric_arg (); initialize_keyseq (); key = info_get_input_char (); /* No errors yet. We just read a character, that's all. Only clear the echo_area if it is not currently active. */ if (!echo_area_is_active) window_clear_echo_area (); info_error_was_printed = 0; /* Do the selected command. */ info_dispatch_on_key (key, active_window->keymap); if (echo_area_is_active) { /* Echo area commands that do killing increment the value of ECHO_AREA_LAST_COMMAND_WAS_KILL. Thus, if there is no change in the value of this variable, the last command executed was not a kill command. */ if (lk == echo_area_last_command_was_kill) echo_area_last_command_was_kill = 0; if (ea_last_executed_command == ea_newline || info_aborted_echo_area) { ea_last_executed_command = (VFunction *)NULL; done = 1; } if (info_last_executed_command == info_quit) quit_info_immediately = 1; } else if (info_last_executed_command == info_quit) done = 1; } } /* Found in signals.c */ extern void initialize_info_signal_handler (); /* Initialize the first info session by starting the terminal, window, and display systems. */ int initialize_info_session (node, clear_screen) NODE *node; int clear_screen; { char *getenv (), *term_name; term_name = getenv ("TERM"); terminal_initialize_terminal (term_name); if (terminal_is_dumb_p) { if (!term_name) term_name = "dumb"; info_error (TERM_TOO_DUMB, term_name); return -1; } if (screenwidth < 4 || screenheight < 4) { info_error (TERM_TOO_SMALL, screenheight, screenwidth); return -1; } if (clear_screen) terminal_clear_screen (); initialize_info_keymaps (); window_initialize_windows (screenwidth, screenheight); initialize_info_signal_handler (); display_initialize_display (screenwidth, screenheight); info_set_node_of_window (active_window, node); /* Tell the window system how to notify us when a window needs to be asynchronously deleted (e.g., user resizes window very small). */ window_deletion_notifier = forget_window_and_nodes; /* If input has not been redirected yet, make it come from STDIN. */ if (!info_input_stream) info_input_stream = stdin; info_windows_initialized_p = 1; return 0; } /* Tell Info that input is coming from the file FILENAME. */ void info_set_input_from_file (filename) char *filename; { FILE *stream; stream = fopen (filename, "r"); if (!stream) return; if (info_input_stream != stdin) fclose (info_input_stream); info_input_stream = stream; if (stream != stdin) display_inhibited = 1; } /* Return the INFO_WINDOW containing WINDOW, or NULL if there isn't one. */ static INFO_WINDOW * get_info_window_of_window (window) WINDOW *window; { register int i; INFO_WINDOW *info_win = (INFO_WINDOW *)NULL; for (i = 0; info_windows && (info_win = info_windows[i]); i++) if (info_win->window == window) break; return (info_win); } /* Reset the remembered pagetop and point of WINDOW to WINDOW's current values if the window and node are the same as the current one being displayed. */ void set_remembered_pagetop_and_point (window) WINDOW *window; { INFO_WINDOW *info_win; info_win = get_info_window_of_window (window); if (!info_win) return; if (info_win->nodes_index && (info_win->nodes[info_win->current] == window->node)) { info_win->pagetops[info_win->current] = window->pagetop; info_win->points[info_win->current] = window->point; } } void remember_window_and_node (window, node) WINDOW *window; NODE *node; { INFO_WINDOW *info_win; /* See if we already have this window in our list. */ info_win = get_info_window_of_window (window); /* If the window wasn't already on our list, then make a new entry. */ if (!info_win) { info_win = (INFO_WINDOW *)xmalloc (sizeof (INFO_WINDOW)); info_win->window = window; info_win->nodes = (NODE **)NULL; info_win->pagetops = (int *)NULL; info_win->points = (long *)NULL; info_win->current = 0; info_win->nodes_index = 0; info_win->nodes_slots = 0; add_pointer_to_array (info_win, info_windows_index, info_windows, info_windows_slots, 10, INFO_WINDOW *); } /* If this node, the current pagetop, and the current point are the same as the last saved node and pagetop, don't really add this to the list of history nodes. */ { int ni = info_win->nodes_index - 1; if ((ni != -1) && (info_win->nodes[ni]->contents == node->contents) && (info_win->pagetops[ni] == window->pagetop) && (info_win->points[ni] == window->point)) return; } /* Remember this node, the currently displayed pagetop, and the current location of point in this window. Because we are updating pagetops and points as well as nodes, it is more efficient to avoid the add_pointer_to_array macro here. */ if (info_win->nodes_index + 2 >= info_win->nodes_slots) { info_win->nodes = (NODE **) xrealloc (info_win->nodes, (info_win->nodes_slots += 20) * sizeof (NODE *)); info_win->pagetops = (int *) xrealloc (info_win->pagetops, info_win->nodes_slots * sizeof (int)); info_win->points = (long *) xrealloc (info_win->points, info_win->nodes_slots * sizeof (long)); } info_win->nodes[info_win->nodes_index] = node; info_win->pagetops[info_win->nodes_index] = window->pagetop; info_win->points[info_win->nodes_index] = window->point; info_win->current = info_win->nodes_index++; info_win->nodes[info_win->nodes_index] = (NODE *)NULL; info_win->pagetops[info_win->nodes_index] = 0; info_win->points[info_win->nodes_index] = 0; } #define DEBUG_FORGET_WINDOW_AND_NODES #if defined (DEBUG_FORGET_WINDOW_AND_NODES) static void consistency_check_info_windows () { register int i; INFO_WINDOW *info_win; for (i = 0; i < info_windows_index; i++) { WINDOW *win; for (win = windows; win; win = win->next) if (win == info_windows[i]->window) break; if (!win) abort (); } } #endif /* DEBUG_FORGET_WINDOW_AND_NODES */ /* Remove WINDOW and its associated list of nodes from INFO_WINDOWS. */ void forget_window_and_nodes (window) WINDOW *window; { register int i; INFO_WINDOW *info_win = (INFO_WINDOW *)NULL; for (i = 0; info_windows && (info_win = info_windows[i]); i++) if (info_win->window == window) break; /* If we found the window to forget, then do so. */ if (info_win) { while (i < info_windows_index) info_windows[i] = info_windows[++i]; info_windows_index--; info_windows[info_windows_index] = (INFO_WINDOW *)NULL; if (info_win->nodes) { for (i = 0; info_win->nodes[i]; i++) if (internal_info_node_p (info_win->nodes[i])) free (info_win->nodes[i]); free (info_win->nodes); maybe_free (info_win->pagetops); maybe_free (info_win->points); } free (info_win); } #if defined (DEBUG_FORGET_WINDOW_AND_NODES) consistency_check_info_windows (); #endif /* DEBUG_FORGET_WINDOW_AND_NODES */ } /* Set WINDOW to show NODE. Remember the new window in our list of Info windows. If we are doing automatic footnote display, also try to display the footnotes for this window. */ void info_set_node_of_window (window, node) WINDOW *window; NODE *node; { /* Put this node into the window. */ window_set_node_of_window (window, node); /* Remember this node and window in our list of info windows. */ remember_window_and_node (window, node); /* If doing auto-footnote display/undisplay, show the footnotes belonging to this window's node. */ if (auto_footnotes_p) info_get_or_remove_footnotes (window); } /* **************************************************************** */ /* */ /* Info Movement Commands */ /* */ /* **************************************************************** */ /* Change the pagetop of WINDOW to DESIRED_TOP, perhaps scrolling the screen to do so. */ void set_window_pagetop (window, desired_top) WINDOW *window; int desired_top; { int point_line, old_pagetop; if (desired_top < 0) desired_top = 0; else if (desired_top > window->line_count) desired_top = window->line_count - 1; if (window->pagetop == desired_top) return; old_pagetop = window->pagetop; window->pagetop = desired_top; /* Make sure that point appears in this window. */ point_line = window_line_of_point (window); if ((point_line < window->pagetop) || ((point_line - window->pagetop) > window->height - 1)) window->point = window->line_starts[window->pagetop] - window->node->contents; window->flags |= W_UpdateWindow; /* Find out which direction to scroll, and scroll the window in that direction. Do this only if there would be a savings in redisplay time. This is true if the amount to scroll is less than the height of the window, and if the number of lines scrolled would be greater than 10 % of the window's height. */ if (old_pagetop < desired_top) { int start, end, amount; amount = desired_top - old_pagetop; if ((amount >= window->height) || (((window->height - amount) * 10) < window->height)) return; start = amount + window->first_row; end = window->height + window->first_row; display_scroll_display (start, end, -amount); } else { int start, end, amount; amount = old_pagetop - desired_top; if ((amount >= window->height) || (((window->height - amount) * 10) < window->height)) return; start = window->first_row; end = (window->first_row + window->height) - amount; display_scroll_display (start, end, amount); } } /* Immediately make WINDOW->point visible on the screen, and move the terminal cursor there. */ static void info_show_point (window) WINDOW *window; { int old_pagetop; old_pagetop = window->pagetop; window_adjust_pagetop (window); if (old_pagetop != window->pagetop) { int new_pagetop; new_pagetop = window->pagetop; window->pagetop = old_pagetop; set_window_pagetop (window, new_pagetop); } if (window->flags & W_UpdateWindow) display_update_one_window (window); display_cursor_at_point (window); } /* Move WINDOW->point from OLD line index to NEW line index. */ static void move_to_new_line (old, new, window) int old, new; WINDOW *window; { if (old == -1) { info_error (CANT_FIND_POINT); } else { int goal; if (new >= window->line_count || new < 0) return; goal = window_get_goal_column (window); window->goal_column = goal; window->point = window->line_starts[new] - window->node->contents; window->point += window_chars_to_goal (window->line_starts[new], goal); info_show_point (window); } } /* Move WINDOW's point down to the next line if possible. */ DECLARE_INFO_COMMAND (info_next_line, "Move down to the next line") { int old_line, new_line; if (count < 0) info_prev_line (window, -count, key); else { old_line = window_line_of_point (window); new_line = old_line + count; move_to_new_line (old_line, new_line, window); } } /* Move WINDOW's point up to the previous line if possible. */ DECLARE_INFO_COMMAND (info_prev_line, "Move up to the previous line") { int old_line, new_line; if (count < 0) info_next_line (window, -count, key); else { old_line = window_line_of_point (window); new_line = old_line - count; move_to_new_line (old_line, new_line, window); } } /* Move WINDOW's point to the end of the true line. */ DECLARE_INFO_COMMAND (info_end_of_line, "Move to the end of the line") { register int point, len; register char *buffer; buffer = window->node->contents; len = window->node->nodelen; for (point = window->point; (point < len) && (buffer[point] != '\n'); point++); if (point != window->point) { window->point = point; info_show_point (window); } } /* Move WINDOW's point to the beginning of the true line. */ DECLARE_INFO_COMMAND (info_beginning_of_line, "Move to the start of the line") { register int point; register char *buffer; buffer = window->node->contents; point = window->point; for (; (point) && (buffer[point - 1] != '\n'); point--); /* If at a line start alreay, do nothing. */ if (point != window->point) { window->point = point; info_show_point (window); } } /* Move point forward in the node. */ DECLARE_INFO_COMMAND (info_forward_char, "Move forward a character") { if (count < 0) info_backward_char (window, -count, key); else { window->point += count; if (window->point >= window->node->nodelen) window->point = window->node->nodelen - 1; info_show_point (window); } } /* Move point backward in the node. */ DECLARE_INFO_COMMAND (info_backward_char, "Move backward a character") { if (count < 0) info_forward_char (window, -count, key); else { window->point -= count; if (window->point < 0) window->point = 0; info_show_point (window); } } #define alphabetic(c) (islower (c) || isupper (c) || isdigit (c)) /* Move forward a word in this node. */ DECLARE_INFO_COMMAND (info_forward_word, "Move forward a word") { long point; char *buffer; int end, c; if (count < 0) { info_backward_word (window, -count, key); return; } point = window->point; buffer = window->node->contents; end = window->node->nodelen; while (count) { if (point + 1 >= end) return; /* If we are not in a word, move forward until we are in one. Then, move forward until we hit a non-alphabetic character. */ c = buffer[point]; if (!alphabetic (c)) { while (++point < end) { c = buffer[point]; if (alphabetic (c)) break; } } if (point >= end) return; while (++point < end) { c = buffer[point]; if (!alphabetic (c)) break; } --count; } window->point = point; info_show_point (window); } DECLARE_INFO_COMMAND (info_backward_word, "Move backward a word") { long point; char *buffer; int c; if (count < 0) { info_forward_word (window, -count, key); return; } buffer = window->node->contents; point = window->point; while (count) { if (point == 0) break; /* Like info_forward_word (), except that we look at the characters just before point. */ c = buffer[point - 1]; if (!alphabetic (c)) { while (--point) { c = buffer[point - 1]; if (alphabetic (c)) break; } } while (point) { c = buffer[point - 1]; if (!alphabetic (c)) break; else --point; } --count; } window->point = point; info_show_point (window); } /* Here is a list of time counter names which correspond to ordinal numbers. It is used to print "once" instead of "1". */ static char *counter_names[] = { "not at all", "once", "twice", "three", "four", "five", "six", (char *)NULL }; /* Buffer used to return values from times_description (). */ static char td_buffer[50]; /* Function returns a static string fully describing the number of times present in COUNT. */ static char * times_description (count) int count; { register int i; td_buffer[0] = '\0'; for (i = 0; counter_names[i]; i++) if (count == i) break; if (counter_names[i]) sprintf (td_buffer, "%s%s", counter_names[i], count > 2 ? " times" : ""); else sprintf (td_buffer, "%d times", count); return (td_buffer); } /* Variable controlling the behaviour of default scrolling when you are already at the bottom of a node. Possible values are defined in session.h. The meanings are: IS_Continuous Try to get first menu item, or failing that, the "Next:" pointer, or failing that, the "Up:" and "Next:" of the up. IS_NextOnly Try to get "Next:" menu item. IS_PageOnly Simply give up at the bottom of a node. */ int info_scroll_behaviour = IS_Continuous; /* Choices used by the completer when reading a value for the user-visible variable "scroll-behaviour". */ char *info_scroll_choices[] = { "Continuous", "Next Only", "Page Only", (char *)NULL }; /* Move to 1st menu item, Next, Up/Next, or error in this window. */ static void forward_move_node_structure (window, behaviour) WINDOW *window; int behaviour; { switch (behaviour) { case IS_PageOnly: info_error (AT_NODE_BOTTOM); break; case IS_NextOnly: info_next_label_of_node (window->node); if (!info_parsed_nodename && !info_parsed_filename) info_error ("No \"Next\" pointer for this node."); else { window_message_in_echo_area ("Following \"Next\" node..."); info_handle_pointer ("Next", window); } break; case IS_Continuous: { /* First things first. If this node contains a menu, move down into the menu. */ { REFERENCE **menu; menu = info_menu_of_node (window->node); if (menu) { info_free_references (menu); window_message_in_echo_area ("Selecting first menu item..."); info_menu_digit (window, 1, '1'); return; } } /* Okay, this node does not contain a menu. If it contains a "Next:" pointer, use that. */ info_next_label_of_node (window->node); if (info_label_was_found) { window_message_in_echo_area ("Selecting \"Next\" node..."); info_handle_pointer ("Next", window); return; } /* Okay, there wasn't a "Next:" for this node. Move "Up:" until we can move "Next:". If that isn't possible, complain that there are no more nodes. */ { int up_counter, old_current; INFO_WINDOW *info_win; /* Remember the current node and location. */ info_win = get_info_window_of_window (window); old_current = info_win->current; /* Back up through the "Up:" pointers until we have found a "Next:" that isn't the same as the first menu item found in that node. */ up_counter = 0; while (!info_error_was_printed) { info_up_label_of_node (window->node); if (info_label_was_found) { info_handle_pointer ("Up", window); if (info_error_was_printed) continue; up_counter++; info_next_label_of_node (window->node); /* If no "Next" pointer, keep backing up. */ if (!info_label_was_found) continue; /* If this node's first menu item is the same as this node's Next pointer, keep backing up. */ if (!info_parsed_filename) { REFERENCE **menu; char *next_nodename; /* Remember the name of the Next node, since reading the menu can overwrite the contents of the info_parsed_xxx strings. */ next_nodename = savestring (info_parsed_nodename); menu = info_menu_of_node (window->node); if (menu && (strcmp (menu[0]->nodename, next_nodename) == 0)) { info_free_references (menu); free (next_nodename); continue; } else { /* Restore the world to where it was before reading the menu contents. */ info_free_references (menu); free (next_nodename); info_next_label_of_node (window->node); } } /* This node has a "Next" pointer, and it is not the same as the first menu item found in this node. */ window_message_in_echo_area ("Moving \"Up\" %s, then \"Next\".", times_description (up_counter)); info_handle_pointer ("Next", window); return; } else { /* No more "Up" pointers. Print an error, and call it quits. */ register int i; for (i = 0; i < up_counter; i++) { info_win->nodes_index--; free (info_win->nodes[info_win->nodes_index]); info_win->nodes[info_win->nodes_index] = (NODE *)NULL; } info_win->current = old_current; window->node = info_win->nodes[old_current]; window->pagetop = info_win->pagetops[old_current]; window->point = info_win->points[old_current]; recalculate_line_starts (window); window->flags |= W_UpdateWindow; info_error ("No more nodes."); } } } break; } } } /* Move Prev, Up or error in WINDOW depending on BEHAVIOUR. */ static void backward_move_node_structure (window, behaviour) WINDOW *window; int behaviour; { switch (behaviour) { case IS_PageOnly: info_error (AT_NODE_TOP); break; case IS_NextOnly: info_prev_label_of_node (window->node); if (!info_parsed_nodename && !info_parsed_filename) info_error ("No \"Prev\" for this node."); else { window_message_in_echo_area ("Moving \"Prev\" in this window."); info_handle_pointer ("Prev", window); } break; case IS_Continuous: info_prev_label_of_node (window->node); if (!info_parsed_nodename && !info_parsed_filename) { info_up_label_of_node (window->node); if (!info_parsed_nodename && !info_parsed_filename) info_error ("No \"Prev\" or \"Up\" for this node."); else { window_message_in_echo_area ("Moving \"Up\" in this window."); info_handle_pointer ("Up", window); } } else { REFERENCE **menu; int inhibit_menu_traversing = 0; /* Watch out! If this node's Prev is the same as the Up, then move Up. Otherwise, we could move Prev, and then to the last menu item in the Prev. This would cause the user to loop through a subsection of the info file. */ if (!info_parsed_filename && info_parsed_nodename) { char *pnode; pnode = savestring (info_parsed_nodename); info_up_label_of_node (window->node); if (!info_parsed_filename && info_parsed_nodename && strcmp (info_parsed_nodename, pnode) == 0) { /* The nodes are the same. Inhibit moving to the last menu item. */ free (pnode); inhibit_menu_traversing = 1; } else { free (pnode); info_prev_label_of_node (window->node); } } /* Move to the previous node. If this node now contains a menu, and we have not inhibited movement to it, move to the node corresponding to the last menu item. */ window_message_in_echo_area ("Moving \"Prev\" in this window."); info_handle_pointer ("Prev", window); if (!inhibit_menu_traversing) { while (!info_error_was_printed && (menu = info_menu_of_node (window->node))) { info_free_references (menu); window_message_in_echo_area ("Moving to \"Prev\"'s last menu item."); info_menu_digit (window, 1, '0'); } } } break; } } /* Move continuously forward through the node structure of this info file. */ DECLARE_INFO_COMMAND (info_global_next_node, "Move forwards or down through node structure") { if (count < 0) info_global_prev_node (window, -count, key); else { while (count && !info_error_was_printed) { forward_move_node_structure (window, IS_Continuous); count--; } } } /* Move continuously backward through the node structure of this info file. */ DECLARE_INFO_COMMAND (info_global_prev_node, "Move backwards or up through node structure") { if (count < 0) info_global_next_node (window, -count, key); else { while (count && !info_error_was_printed) { backward_move_node_structure (window, IS_Continuous); count--; } } } /* Show the next screen of WINDOW's node. */ DECLARE_INFO_COMMAND (info_scroll_forward, "Scroll forward in this window") { if (count < 0) info_scroll_backward (window, -count, key); else { int desired_top; /* Without an explicit numeric argument, scroll the bottom two lines to the top of this window, Or, if at bottom of window, and the user wishes to scroll through nodes get the "Next" node for this window. */ if (!info_explicit_arg && count == 1) { desired_top = window->pagetop + (window->height - 2); /* If there are no more lines to scroll here, error, or get another node, depending on INFO_SCROLL_BEHAVIOUR. */ if (desired_top > window->line_count) { int behaviour = info_scroll_behaviour; /* Here is a hack. If the key being used is not SPC, do the PageOnly behaviour. */ if (key != SPC && key != DEL) behaviour = IS_PageOnly; forward_move_node_structure (window, behaviour); return; } } else desired_top = window->pagetop + count; if (desired_top >= window->line_count) desired_top = window->line_count - 2; if (window->pagetop > desired_top) return; else set_window_pagetop (window, desired_top); } } /* Show the previous screen of WINDOW's node. */ DECLARE_INFO_COMMAND (info_scroll_backward, "Scroll backward in this window") { if (count < 0) info_scroll_forward (window, -count, key); else { int desired_top; /* Without an explicit numeric argument, scroll the top two lines to the bottom of this window, or move to the previous, or Up'th node. */ if (!info_explicit_arg && count == 1) { desired_top = window->pagetop - (window->height - 2); if ((desired_top < 0) && (window->pagetop == 0)) { int behaviour = info_scroll_behaviour; /* Same kind of hack as in info_scroll_forward. If the key used to invoke this command is not DEL, do only the PageOnly behaviour. */ if (key != DEL && key != SPC) behaviour = IS_PageOnly; backward_move_node_structure (window, behaviour); return; } } else desired_top = window->pagetop - count; if (desired_top < 0) desired_top = 0; set_window_pagetop (window, desired_top); } } /* Move to the beginning of the node. */ DECLARE_INFO_COMMAND (info_beginning_of_node, "Move to the start of this node") { window->pagetop = window->point = 0; window->flags |= W_UpdateWindow; } /* Move to the end of the node. */ DECLARE_INFO_COMMAND (info_end_of_node, "Move to the end of this node") { window->point = window->node->nodelen - 1; info_show_point (window); } /* **************************************************************** */ /* */ /* Commands for Manipulating Windows */ /* */ /* **************************************************************** */ /* Make the next window in the chain be the active window. */ DECLARE_INFO_COMMAND (info_next_window, "Select the next window") { if (count < 0) { info_prev_window (window, -count, key); return; } /* If no other window, error now. */ if (!windows->next && !echo_area_is_active) { info_error (ONE_WINDOW); return; } while (count--) { if (window->next) window = window->next; else { if (window == the_echo_area || !echo_area_is_active) window = windows; else window = the_echo_area; } } if (active_window != window) { if (auto_footnotes_p) info_get_or_remove_footnotes (window); window->flags |= W_UpdateWindow; active_window = window; } } /* Make the previous window in the chain be the active window. */ DECLARE_INFO_COMMAND (info_prev_window, "Select the previous window") { if (count < 0) { info_next_window (window, -count, key); return; } /* Only one window? */ if (!windows->next && !echo_area_is_active) { info_error (ONE_WINDOW); return; } while (count--) { /* If we are in the echo area, or if the echo area isn't active and we are in the first window, find the last window in the chain. */ if (window == the_echo_area || (window == windows && !echo_area_is_active)) { register WINDOW *win, *last; for (win = windows; win; win = win->next) last = win; window = last; } else { if (window == windows) window = the_echo_area; else window = window->prev; } } if (active_window != window) { if (auto_footnotes_p) info_get_or_remove_footnotes (window); window->flags |= W_UpdateWindow; active_window = window; } } /* Split WINDOW into two windows, both showing the same node. If we are automatically tiling windows, re-tile after the split. */ DECLARE_INFO_COMMAND (info_split_window, "Split the current window") { WINDOW *split, *old_active; int pagetop; /* Remember the current pagetop of the window being split. If it doesn't change, we can scroll its contents around after the split. */ pagetop = window->pagetop; /* Make the new window. */ old_active = active_window; active_window = window; split = window_make_window (window->node); active_window = old_active; if (!split) { info_error (WIN_TOO_SMALL); } else { #if defined (SPLIT_BEFORE_ACTIVE) /* Try to scroll the old window into its new postion. */ if (pagetop == window->pagetop) { int start, end, amount; start = split->first_row; end = start + window->height; amount = split->height + 1; display_scroll_display (start, end, amount); } #else /* !SPLIT_BEFORE_ACTIVE */ /* Make sure point still appears in the active window. */ info_show_point (window); #endif /* !SPLIT_BEFORE_ACTIVE */ /* If the window just split was one internal to Info, try to display something else in it. */ if (internal_info_node_p (split->node)) { register int i, j; INFO_WINDOW *iw; NODE *node = (NODE *)NULL; char *filename; for (i = 0; iw = info_windows[i]; i++) { for (j = 0; j < iw->nodes_index; j++) if (!internal_info_node_p (iw->nodes[j])) { if (iw->nodes[j]->parent) filename = iw->nodes[j]->parent; else filename = iw->nodes[j]->filename; node = info_get_node (filename, iw->nodes[j]->nodename); if (node) { window_set_node_of_window (split, node); i = info_windows_index - 1; break; } } } } split->pagetop = window->pagetop; if (auto_tiling_p) window_tile_windows (DONT_TILE_INTERNALS); else window_adjust_pagetop (split); remember_window_and_node (split, split->node); } } /* Delete WINDOW, forgetting the list of last visited nodes. If we are automatically displaying footnotes, show or remove the footnotes window. If we are automatically tiling windows, re-tile after the deletion. */ DECLARE_INFO_COMMAND (info_delete_window, "Delete the current window") { if (!windows->next) { info_error (CANT_KILL_LAST); } else if (window->flags & W_WindowIsPerm) { info_error ("Cannot delete a permanent window"); } else { info_delete_window_internal (window); if (auto_footnotes_p) info_get_or_remove_footnotes (active_window); if (auto_tiling_p) window_tile_windows (DONT_TILE_INTERNALS); } } /* Do the physical deletion of WINDOW, and forget this window and associated nodes. */ void info_delete_window_internal (window) WINDOW *window; { if (windows->next && ((window->flags & W_WindowIsPerm) == 0)) { /* We not only delete the window from the display, we forget it from our list of remembered windows. */ forget_window_and_nodes (window); window_delete_window (window); if (echo_area_is_active) echo_area_inform_of_deleted_window (window); } } /* Just keep WINDOW, deleting all others. */ DECLARE_INFO_COMMAND (info_keep_one_window, "Delete all other windows") { int num_deleted; /* The number of windows we deleted. */ int pagetop, start, end; /* Remember a few things about this window. We may be able to speed up redisplay later by scrolling its contents. */ pagetop = window->pagetop; start = window->first_row; end = start + window->height; num_deleted = 0; while (1) { WINDOW *win; /* Find an eligible window and delete it. If no eligible windows are found, we are done. A window is eligible for deletion if is it not permanent, and it is not WINDOW. */ for (win = windows; win; win = win->next) if (win != window && ((win->flags & W_WindowIsPerm) == 0)) break; if (!win) break; info_delete_window_internal (win); num_deleted++; } /* Scroll the contents of this window into the right place so that the user doesn't have to wait any longer than necessary for redisplay. */ if (num_deleted) { int amount; amount = (window->first_row - start); amount -= (window->pagetop - pagetop); display_scroll_display (start, end, amount); } window->flags |= W_UpdateWindow; } /* Scroll the "other" window of WINDOW. */ DECLARE_INFO_COMMAND (info_scroll_other_window, "Scroll the other window") { WINDOW *other; /* If only one window, give up. */ if (!windows->next) { info_error (ONE_WINDOW); return; } other = window->next; if (!other) other = window->prev; info_scroll_forward (other, count, key); } /* Change the size of WINDOW by AMOUNT. */ DECLARE_INFO_COMMAND (info_grow_window, "Grow (or shrink) this window") { window_change_window_height (window, count); } /* When non-zero, tiling takes place automatically when info_split_window is called. */ int auto_tiling_p = 0; /* Tile all of the visible windows. */ DECLARE_INFO_COMMAND (info_tile_windows, "Divide the available screen space among the visible windows") { window_tile_windows (TILE_INTERNALS); } /* Toggle the state of this window's wrapping of lines. */ DECLARE_INFO_COMMAND (info_toggle_wrap, "Toggle the state of line wrapping in the current window") { window_toggle_wrap (window); } /* **************************************************************** */ /* */ /* Info Node Commands */ /* */ /* **************************************************************** */ /* Using WINDOW for various defaults, select the node referenced by ENTRY in it. If the node is selected, the window and node are remembered. */ void info_select_reference (window, entry) WINDOW *window; REFERENCE *entry; { NODE *node; char *filename, *nodename, *file_system_error; file_system_error = (char *)NULL; filename = entry->filename; if (!filename) filename = window->node->parent; if (!filename) filename = window->node->filename; if (filename) filename = savestring (filename); if (entry->nodename) nodename = savestring (entry->nodename); else nodename = savestring ("Top"); node = info_get_node (filename, nodename); /* Try something a little weird. If the node couldn't be found, and the reference was of the form "foo::", see if the entry->label can be found as a file, with a node of "Top". */ if (!node) { if (info_recent_file_error) file_system_error = savestring (info_recent_file_error); if (entry->nodename && (strcmp (entry->nodename, entry->label) == 0)) { node = info_get_node (entry->label, "Top"); if (!node && info_recent_file_error) { maybe_free (file_system_error); file_system_error = savestring (info_recent_file_error); } } } if (!node) { if (file_system_error) info_error (file_system_error); else info_error (CANT_FIND_NODE, nodename); } maybe_free (file_system_error); maybe_free (filename); maybe_free (nodename); if (node) { set_remembered_pagetop_and_point (window); info_set_node_of_window (window, node); } } /* Parse the node specification in LINE using WINDOW to default the filename. Select the parsed node in WINDOW and remember it, or error if the node couldn't be found. */ static void info_parse_and_select (line, window) char *line; WINDOW *window; { REFERENCE entry; info_parse_node (line, DONT_SKIP_NEWLINES); entry.nodename = info_parsed_nodename; entry.filename = info_parsed_filename; entry.label = "*info-parse-and-select*"; info_select_reference (window, &entry); } /* Given that the values of INFO_PARSED_FILENAME and INFO_PARSED_NODENAME are previously filled, try to get the node represented by them into WINDOW. The node should have been pointed to by the LABEL pointer of WINDOW->node. */ static void info_handle_pointer (label, window) char *label; WINDOW *window; { if (info_parsed_filename || info_parsed_nodename) { char *filename, *nodename; NODE *node; filename = nodename = (char *)NULL; if (info_parsed_filename) filename = savestring (info_parsed_filename); else { if (window->node->parent) filename = savestring (window->node->parent); else if (window->node->filename) filename = savestring (window->node->filename); } if (info_parsed_nodename) nodename = savestring (info_parsed_nodename); else nodename = savestring ("Top"); node = info_get_node (filename, nodename); if (node) { INFO_WINDOW *info_win; info_win = get_info_window_of_window (window); if (info_win) { info_win->pagetops[info_win->current] = window->pagetop; info_win->points[info_win->current] = window->point; } set_remembered_pagetop_and_point (window); info_set_node_of_window (window, node); } else { if (info_recent_file_error) info_error (info_recent_file_error); else info_error (CANT_FILE_NODE, filename, nodename); } free (filename); free (nodename); } else { info_error (NO_POINTER, label); } } /* Make WINDOW display the "Next:" node of the node currently being displayed. */ DECLARE_INFO_COMMAND (info_next_node, "Select the `Next' node") { info_next_label_of_node (window->node); info_handle_pointer ("Next", window); } /* Make WINDOW display the "Prev:" node of the node currently being displayed. */ DECLARE_INFO_COMMAND (info_prev_node, "Select the `Prev' node") { info_prev_label_of_node (window->node); info_handle_pointer ("Prev", window); } /* Make WINDOW display the "Up:" node of the node currently being displayed. */ DECLARE_INFO_COMMAND (info_up_node, "Select the `Up' node") { info_up_label_of_node (window->node); info_handle_pointer ("Up", window); } /* Make WINDOW display the last node of this info file. */ DECLARE_INFO_COMMAND (info_last_node, "Select the last node in this file") { register int i; FILE_BUFFER *fb = file_buffer_of_window (window); NODE *node = (NODE *)NULL; if (fb && fb->tags) { for (i = 0; fb->tags[i]; i++); node = info_get_node (fb->filename, fb->tags[i - 1]->nodename); } if (!node) info_error ("This window has no additional nodes"); else { set_remembered_pagetop_and_point (window); info_set_node_of_window (window, node); } } /* Make WINDOW display the first node of this info file. */ DECLARE_INFO_COMMAND (info_first_node, "Select the first node in this file") { FILE_BUFFER *fb = file_buffer_of_window (window); NODE *node = (NODE *)NULL; if (fb && fb->tags) node = info_get_node (fb->filename, fb->tags[0]->nodename); if (!node) info_error ("This window has no additional nodes"); else { set_remembered_pagetop_and_point (window); info_set_node_of_window (window, node); } } /* Make WINDOW display the previous node displayed in this window. */ DECLARE_INFO_COMMAND (info_history_node, "Select the most recently selected node") { INFO_WINDOW *info_win; /* Find the INFO_WINDOW which contains WINDOW. */ info_win = get_info_window_of_window (window); if (!info_win) { info_error ("Requested window is not present!"); return; } set_remembered_pagetop_and_point (window); if (!info_win->current) { if (info_win->nodes_index > 1) { window_message_in_echo_area ("Now wrapped around to beginning of history."); info_win->current = info_win->nodes_index; } else { info_error ("No earlier nodes in this window."); return; } } info_win->current--; window_set_node_of_window (window, info_win->nodes[info_win->current]); window->pagetop = info_win->pagetops[info_win->current]; window->point = info_win->points[info_win->current]; window->flags |= W_UpdateWindow; if (auto_footnotes_p) info_get_or_remove_footnotes (window); } /* Select the last menu item in WINDOW->node. */ DECLARE_INFO_COMMAND (info_last_menu_item, "Select the last item in this node's menu") { info_menu_digit (window, 1, '0'); } /* Use KEY (a digit) to select the Nth menu item in WINDOW->node. */ DECLARE_INFO_COMMAND (info_menu_digit, "Select this menu item") { register int i, item; register REFERENCE *entry, **menu; menu = info_menu_of_node (window->node); if (!menu) { info_error (NO_MENU_NODE); return; } /* We have the menu. See if there are this many items in it. */ item = key - '0'; /* Special case. Item "0" is the last item in this menu. */ if (item == 0) for (i = 0; menu[i + 1]; i++); else { for (i = 0; entry = menu[i]; i++) if (i == item - 1) break; } if (menu[i]) info_select_reference (window, menu[i]); else info_error ("There aren't %d items in this menu.", item); info_free_references (menu); return; } /* Read a menu or followed reference from the user defaulting to the reference found on the current line, and select that node. The reading is done with completion. BUILDER is the function used to build the list of references. ASK_P is non-zero if the user should be prompted, or zero to select the default item. */ static void info_menu_or_ref_item (window, count, key, builder, ask_p) WINDOW *window; int count; unsigned char key; REFERENCE **(*builder) (); int ask_p; { REFERENCE **menu, *entry, *defentry = (REFERENCE *)NULL; char *line; menu = (*builder) (window->node); if (!menu) { if (builder == info_menu_of_node) info_error (NO_MENU_NODE); else info_error (NO_XREF_NODE); return; } /* Default the selected reference to the one which is on the line that point is in. */ { REFERENCE **refs = (REFERENCE **)NULL; int point_line; point_line = window_line_of_point (window); if (point_line != -1) { SEARCH_BINDING binding; binding.start = 0; binding.buffer = window->line_starts[point_line]; if (window->line_starts[point_line + 1]) binding.end = window->line_starts[point_line + 1] - binding.buffer; else binding.end = (window->node->contents + window->node->nodelen) - binding.buffer; binding.flags = 0; if (builder == info_menu_of_node) { if (point_line) { binding.buffer--; binding.end++; refs = info_menu_items (&binding); } } else refs = info_xrefs (&binding); if (refs) { if ((strcmp (refs[0]->label, "Menu") != 0) || (builder == info_xrefs_of_node)) { defentry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); defentry->label = savestring (refs[0]->label); defentry->filename = refs[0]->filename; defentry->nodename = refs[0]->nodename; if (defentry->filename) defentry->filename = savestring (defentry->filename); if (defentry->nodename) defentry->nodename = savestring (defentry->nodename); } info_free_references (refs); } } } /* If we are going to ask the user a question, do it now. */ if (ask_p) { char *prompt; /* Build the prompt string. */ if (defentry) prompt = (char *)xmalloc (20 + strlen (defentry->label)); else prompt = (char *)xmalloc (20); if (builder == info_menu_of_node) { if (defentry) sprintf (prompt, "Menu item (%s): ", defentry->label); else sprintf (prompt, "Menu item: "); } else { if (defentry) sprintf (prompt, "Follow xref (%s): ", defentry->label); else sprintf (prompt, "Follow xref: "); } line = info_read_completing_in_echo_area (window, prompt, menu); free (prompt); window = active_window; /* User aborts, just quit. */ if (!line) { maybe_free (defentry); info_free_references (menu); info_abort_key (window, 0, 0); return; } /* If we had a default and the user accepted it, use that. */ if (!*line) { free (line); if (defentry) line = savestring (defentry->label); else line = (char *)NULL; } } else { /* Not going to ask any questions. If we have a default entry, use that, otherwise return. */ if (!defentry) return; else line = savestring (defentry->label); } if (line) { /* Find the selected label in the references. */ entry = info_get_labeled_reference (line, menu); if (!entry && defentry) info_error ("The reference disappeared! (%s).", line); else { NODE *orig; orig = window->node; info_select_reference (window, entry); if ((builder == info_xrefs_of_node) && (window->node != orig)) { long offset; long start; if (window->line_count > 0) start = window->line_starts[1] - window->node->contents; else start = 0; offset = info_target_search_node (window->node, entry->label, start); if (offset != -1) { window->point = offset; window_adjust_pagetop (window); } } } free (line); if (defentry) { free (defentry->label); maybe_free (defentry->filename); maybe_free (defentry->nodename); free (defentry); } } info_free_references (menu); if (!info_error_was_printed) window_clear_echo_area (); } /* Read a line (with completion) which is the name of a menu item, and select that item. */ DECLARE_INFO_COMMAND (info_menu_item, "Read a menu item and select its node") { info_menu_or_ref_item (window, count, key, info_menu_of_node, 1); } /* Read a line (with completion) which is the name of a reference to follow, and select the node. */ DECLARE_INFO_COMMAND (info_xref_item, "Read a footnote or cross reference and select its node") { info_menu_or_ref_item (window, count, key, info_xrefs_of_node, 1); } /* Position the cursor at the start of this node's menu. */ DECLARE_INFO_COMMAND (info_find_menu, "Move to the start of this node's menu") { SEARCH_BINDING binding; long position; binding.buffer = window->node->contents; binding.start = 0; binding.end = window->node->nodelen; binding.flags = S_FoldCase | S_SkipDest; position = search (INFO_MENU_LABEL, &binding); if (position == -1) info_error (NO_MENU_NODE); else { window->point = position; window_adjust_pagetop (window); window->flags |= W_UpdateWindow; } } /* Visit as many menu items as is possible, each in a separate window. */ DECLARE_INFO_COMMAND (info_visit_menu, "Visit as many menu items at once as possible") { register int i; REFERENCE *entry, **menu; menu = info_menu_of_node (window->node); if (!menu) info_error (NO_MENU_NODE); for (i = 0; (!info_error_was_printed) && (entry = menu[i]); i++) { WINDOW *new; new = window_make_window (window->node); window_tile_windows (TILE_INTERNALS); if (!new) info_error (WIN_TOO_SMALL); else { active_window = new; info_select_reference (new, entry); } } } /* Read a line of input which is a node name, and go to that node. */ DECLARE_INFO_COMMAND (info_goto_node, "Read a node name and select it") { char *line; NODE *node; #define GOTO_COMPLETES #if defined (GOTO_COMPLETES) /* Build a completion list of all of the known nodes. */ { register int fbi, i; FILE_BUFFER *current; REFERENCE **items = (REFERENCE **)NULL; int items_index = 0; int items_slots = 0; current = file_buffer_of_window (window); for (fbi = 0; info_loaded_files && info_loaded_files[fbi]; fbi++) { FILE_BUFFER *fb; REFERENCE *entry; int this_is_the_current_fb; fb = info_loaded_files[fbi]; this_is_the_current_fb = (current == fb); entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->filename = entry->nodename = (char *)NULL; entry->label = (char *)xmalloc (4 + strlen (fb->filename)); sprintf (entry->label, "(%s)*", fb->filename); add_pointer_to_array (entry, items_index, items, items_slots, 10, REFERENCE *); if (fb->tags) { for (i = 0; fb->tags[i]; i++) { entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->filename = entry->nodename = (char *)NULL; entry->label = (char *) xmalloc (4 + strlen (fb->filename) + strlen (fb->tags[i]->nodename)); sprintf (entry->label, "(%s)%s", fb->filename, fb->tags[i]->nodename); add_pointer_to_array (entry, items_index, items, items_slots, 100, REFERENCE *); } if (this_is_the_current_fb) { for (i = 0; fb->tags[i]; i++) { entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->filename = entry->nodename = (char *)NULL; entry->label = savestring (fb->tags[i]->nodename); add_pointer_to_array (entry, items_index, items, items_slots, 100, REFERENCE *); } } } } line = info_read_maybe_completing (window, "Goto Node: ", items); info_free_references (items); } #else /* !GOTO_COMPLETES */ line = info_read_in_echo_area (window, "Goto Node: "); #endif /* !GOTO_COMPLETES */ /* If the user aborted, quit now. */ if (!line) { info_abort_key (window, 0, 0); return; } canonicalize_whitespace (line); if (*line) info_parse_and_select (line, window); free (line); if (!info_error_was_printed) window_clear_echo_area (); } /* Move to the "Top" node in this file. */ DECLARE_INFO_COMMAND (info_top_node, "Select the node `Top' in this file") { info_parse_and_select ("Top", window); } /* Move to the node "(dir)Top". */ DECLARE_INFO_COMMAND (info_dir_node, "Select the node `(dir)'") { info_parse_and_select ("(dir)Top", window); } /* Try to delete the current node appearing in this window, showing the most recently selected node in this window. */ DECLARE_INFO_COMMAND (info_kill_node, "Kill this node") { register int iw, i; register INFO_WINDOW *info_win; char *nodename = (char *)NULL; NODE *temp = (NODE *)NULL; /* Read the name of a node to kill. The list of available nodes comes from the nodes appearing in the current window configuration. */ { REFERENCE **menu = (REFERENCE **)NULL; int menu_index = 0, menu_slots = 0; char *default_nodename, *prompt; for (iw = 0; info_win = info_windows[iw]; iw++) { REFERENCE *entry; entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->label = savestring (info_win->window->node->nodename); entry->filename = entry->nodename = (char *)NULL; add_pointer_to_array (entry, menu_index, menu, menu_slots, 10, REFERENCE *); } default_nodename = savestring (active_window->node->nodename); prompt = (char *)xmalloc (40 + strlen (default_nodename)); sprintf (prompt, "Kill node (%s): ", default_nodename); nodename = info_read_completing_in_echo_area (window, prompt, menu); free (prompt); info_free_references (menu); if (nodename && !*nodename) { free (nodename); nodename = default_nodename; } else free (default_nodename); } /* If there is no nodename to kill, quit now. */ if (!nodename) { info_abort_key (window, 0, 0); return; } /* If there is a nodename, find it in our window list. */ for (iw = 0; info_win = info_windows[iw]; iw++) if (strcmp (nodename, info_win->nodes[info_win->current]->nodename) == 0) break; if (!info_win) { if (*nodename) info_error ("Cannot kill the node `%s'", nodename); else window_clear_echo_area (); return; } /* If there are no more nodes left anywhere to view, complain and exit. */ if (info_windows_index == 1 && info_windows[0]->nodes_index == 1) { info_error ("Cannot kill the last node"); return; } /* INFO_WIN contains the node that the user wants to stop viewing. Delete this node from the list of nodes previously shown in this window. */ for (i = info_win->current; i < info_win->nodes_index; i++) info_win->nodes[i] = info_win->nodes[i++]; /* There is one less node in this window's history list. */ info_win->nodes_index--; /* Make this window show the most recent history node. */ info_win->current = info_win->nodes_index - 1; /* If there aren't any nodes left in this window, steal one from the next window. */ if (info_win->current < 0) { INFO_WINDOW *stealer; int which, pagetop; long point; if (info_windows[iw + 1]) stealer = info_windows[iw + 1]; else stealer = info_windows[0]; /* If the node being displayed in the next window is not the most recently loaded one, get the most recently loaded one. */ if ((stealer->nodes_index - 1) != stealer->current) which = stealer->nodes_index - 1; /* Else, if there is another node behind the stealers current node, use that one. */ else if (stealer->current > 0) which = stealer->current - 1; /* Else, just use the node appearing in STEALER's window. */ else which = stealer->current; /* Copy this node. */ { NODE *copy; temp = stealer->nodes[which]; point = stealer->points[which]; pagetop = stealer->pagetops[which]; copy = (NODE *)xmalloc (sizeof (NODE)); copy->filename = temp->filename; copy->parent = temp->parent; copy->nodename = temp->nodename; copy->contents = temp->contents; copy->nodelen = temp->nodelen; copy->flags = temp->flags; temp = copy; } window_set_node_of_window (info_win->window, temp); window->point = point; window->pagetop = pagetop; remember_window_and_node (info_win->window, temp); } else { temp = info_win->nodes[info_win->current]; window_set_node_of_window (info_win->window, temp); } if (!info_error_was_printed) window_clear_echo_area (); } /* Read the name of a file and select the entire file. */ DECLARE_INFO_COMMAND (info_view_file, "Read the name of a file and select it") { char *line; line = info_read_in_echo_area (window, "Find file: "); if (!line) { info_abort_key (active_window, 1, 0); return; } if (*line) { NODE *node; node = info_get_node (line, "*"); if (!node) { if (info_recent_file_error) info_error (info_recent_file_error); else info_error ("Cannot find \"%s\".", line); } else { set_remembered_pagetop_and_point (active_window); info_set_node_of_window (window, node); } free (line); } if (!info_error_was_printed) window_clear_echo_area (); } /* **************************************************************** */ /* */ /* Dumping and Printing Nodes */ /* */ /* **************************************************************** */ #define VERBOSE_NODE_DUMPING static void write_node_to_stream (); static void dump_node_to_stream (); static void initialize_dumping (); /* Dump the nodes specified by FILENAME and NODENAMES to the file named in OUTPUT_FILENAME. If DUMP_SUBNODES is non-zero, recursively dump the nodes which appear in the menu of each node dumped. */ void dump_nodes_to_file (filename, nodenames, output_filename, dump_subnodes) char *filename; char **nodenames; char *output_filename; int dump_subnodes; { register int i; FILE *output_stream; /* Get the stream to print the nodes to. Special case of an output filename of "-" means to dump the nodes to stdout. */ if (strcmp (output_filename, "-") == 0) output_stream = stdout; else output_stream = fopen (output_filename, "w"); if (!output_stream) { info_error ("Could not create output file \"%s\".", output_filename); return; } /* Print each node to stream. */ initialize_dumping (); for (i = 0; nodenames[i]; i++) dump_node_to_stream (filename, nodenames[i], output_stream, dump_subnodes); if (output_stream != stdout) fclose (output_stream); #if defined (VERBOSE_NODE_DUMPING) info_error ("Done."); #endif /* VERBOSE_NODE_DUMPING */ } /* A place to remember already dumped nodes. */ static char **dumped_already = (char **)NULL; static int dumped_already_index = 0; static int dumped_already_slots = 0; static void initialize_dumping () { dumped_already_index = 0; } /* Get and print the node specified by FILENAME and NODENAME to STREAM. If DUMP_SUBNODES is non-zero, recursively dump the nodes which appear in the menu of each node dumped. */ static void dump_node_to_stream (filename, nodename, stream, dump_subnodes) char *filename, *nodename; FILE *stream; int dump_subnodes; { register int i; NODE *node; node = info_get_node (filename, nodename); if (!node) { if (info_recent_file_error) info_error (info_recent_file_error); else { if (filename && *nodename != '(') info_error (CANT_FILE_NODE, filename_non_directory (filename), nodename); else info_error (CANT_FIND_NODE, nodename); } return; } /* If we have already dumped this node, don't dump it again. */ for (i = 0; i < dumped_already_index; i++) if (strcmp (node->nodename, dumped_already[i]) == 0) { free (node); return; } add_pointer_to_array (node->nodename, dumped_already_index, dumped_already, dumped_already_slots, 50, char *); #if defined (VERBOSE_NODE_DUMPING) /* Maybe we should print some information about the node being output. */ if (node->filename) info_error ("Writing node \"(%s)%s\"...", filename_non_directory (node->filename), node->nodename); else info_error ("Writing node \"%s\"...", node->nodename); #endif /* VERBOSE_NODE_DUMPING */ write_node_to_stream (node, stream); /* If we are dumping subnodes, get the list of menu items in this node, and dump each one recursively. */ if (dump_subnodes) { REFERENCE **menu = (REFERENCE **)NULL; /* If this node is an Index, do not dump the menu references. */ if (string_in_line ("Index", node->nodename) == -1) menu = info_menu_of_node (node); if (menu) { for (i = 0; menu[i]; i++) { /* We don't dump Info files which are different than the current one. */ if (!menu[i]->filename) dump_node_to_stream (filename, menu[i]->nodename, stream, dump_subnodes); } info_free_references (menu); } } free (node); } /* Dump NODE to FILENAME. If DUMP_SUBNODES is non-zero, recursively dump the nodes which appear in the menu of each node dumped. */ void dump_node_to_file (node, filename, dump_subnodes) NODE *node; char *filename; int dump_subnodes; { FILE *output_stream; char *nodes_filename; /* Get the stream to print this node to. Special case of an output filename of "-" means to dump the nodes to stdout. */ if (strcmp (filename, "-") == 0) output_stream = stdout; else output_stream = fopen (filename, "w"); if (!output_stream) { info_error ("Could not create output file \"%s\".", filename); return; } if (node->parent) nodes_filename = node->parent; else nodes_filename = node->filename; initialize_dumping (); dump_node_to_stream (nodes_filename, node->nodename, output_stream, dump_subnodes); if (output_stream != stdout) fclose (output_stream); #if defined (VERBOSE_NODE_DUMPING) info_error ("Done."); #endif /* VERBOSE_NODE_DUMPING */ } #if !defined (DEFAULT_INFO_PRINT_COMMAND) # define DEFAULT_INFO_PRINT_COMMAND "lpr" #endif /* !DEFAULT_INFO_PRINT_COMMAND */ DECLARE_INFO_COMMAND (info_print_node, "Pipe the contents of this node through INFO_PRINT_COMMAND") { print_node (window->node); } /* Print NODE on a printer piping it into INFO_PRINT_COMMAND. */ void print_node (node) NODE *node; { char *print_command, *getenv (); FILE *printer_pipe; print_command = getenv ("INFO_PRINT_COMMAND"); if (!print_command || !*print_command) print_command = DEFAULT_INFO_PRINT_COMMAND; printer_pipe = popen (print_command, "w"); if (!printer_pipe) { info_error ("Cannot open pipe to \"%s\".", print_command); return; } #if defined (VERBOSE_NODE_DUMPING) /* Maybe we should print some information about the node being output. */ if (node->filename) info_error ("Printing node \"(%s)%s\"...", filename_non_directory (node->filename), node->nodename); else info_error ("Printing node \"%s\"...", node->nodename); #endif /* VERBOSE_NODE_DUMPING */ write_node_to_stream (node, printer_pipe); pclose (printer_pipe); #if defined (VERBOSE_NODE_DUMPING) info_error ("Done."); #endif /* VERBOSE_NODE_DUMPING */ } static void write_node_to_stream (node, stream) NODE *node; FILE *stream; { fwrite (node->contents, 1, node->nodelen, stream); } /* **************************************************************** */ /* */ /* Info Searching Commands */ /* */ /* **************************************************************** */ /* Variable controlling the garbage collection of files briefly visited during searches. Such files are normally gc'ed, unless they were compressed to begin with. If this variable is non-zero, it says to gc even those file buffer contents which had to be uncompressed. */ int gc_compressed_files = 0; static void info_gc_file_buffers (); static char *search_string = (char *)NULL; static int search_string_index = 0; static int search_string_size = 0; static int isearch_is_active = 0; /* Return the file buffer which belongs to WINDOW's node. */ FILE_BUFFER * file_buffer_of_window (window) WINDOW *window; { /* If this window has no node, then it has no file buffer. */ if (!window->node) return ((FILE_BUFFER *)NULL); if (window->node->parent) return (info_find_file (window->node->parent)); if (window->node->filename) return (info_find_file (window->node->filename)); return ((FILE_BUFFER *)NULL); } /* Search for STRING in NODE starting at START. Return -1 if the string was not found, or the location of the string if it was. If WINDOW is passed as non-null, set the window's node to be NODE, its point to be the found string, and readjust the window's pagetop. Final argument DIR says which direction to search in. If it is positive, search forward, else backwards. */ long info_search_in_node (string, node, start, window, dir) char *string; NODE *node; long start; WINDOW *window; int dir; { SEARCH_BINDING binding; long offset; binding.buffer = node->contents; binding.start = start; binding.end = node->nodelen; binding.flags = S_FoldCase; if (dir < 0) { binding.end = 0; binding.flags |= S_SkipDest; } if (binding.start < 0) return (-1); /* For incremental searches, we always wish to skip past the string. */ if (isearch_is_active) binding.flags |= S_SkipDest; offset = search (string, &binding); if (offset != -1 && window) { set_remembered_pagetop_and_point (window); if (window->node != node) window_set_node_of_window (window, node); window->point = offset; window_adjust_pagetop (window); } return (offset); } /* Search NODE, looking for the largest possible match of STRING. Start the search at START. Return the absolute position of the match, or -1, if no part of the string could be found. */ long info_target_search_node (node, string, start) NODE *node; char *string; long start; { register int i; long offset; char *target; target = savestring (string); i = strlen (target); /* Try repeatedly searching for this string while removing words from the end of it. */ while (i) { target[i] = '\0'; offset = info_search_in_node (target, node, start, (WINDOW *)NULL, 1); if (offset != -1) break; /* Delete the last word from TARGET. */ for (; i && (!whitespace (target[i]) && (target[i] != ',')); i--); } free (target); return (offset); } /* Search for STRING starting in WINDOW at point. If the string is found in this node, set point to that position. Otherwise, get the file buffer associated with WINDOW's node, and search through each node in that file. If the search fails, return non-zero, else zero. Side-effect window leaving the node and point where the string was found current. */ static char *last_searched_for_string = (char *)NULL; static int info_search_internal (string, window, dir) char *string; WINDOW *window; int dir; { register int i; FILE_BUFFER *file_buffer; char *initial_nodename; long ret, start = 0; file_buffer = file_buffer_of_window (window); initial_nodename = window->node->nodename; if ((info_last_executed_command == info_search) && (last_searched_for_string) && (strcmp (last_searched_for_string, string) == 0)) { ret = info_search_in_node (string, window->node, window->point + dir, window, dir); } else { ret = info_search_in_node (string, window->node, window->point, window, dir); } maybe_free (last_searched_for_string); last_searched_for_string = savestring (string); if (ret != -1) { /* We won! */ if (!echo_area_is_active && !isearch_is_active) window_clear_echo_area (); return (0); } /* The string wasn't found in the current node. Search through the window's file buffer, iff the current node is not "*". */ if (!file_buffer || (strcmp (initial_nodename, "*") == 0)) return (-1); /* If this file has tags, search through every subfile, starting at this node's subfile and node. Otherwise, search through the file's node list. */ if (file_buffer->tags) { register int current_tag, number_of_tags; char *last_subfile; TAG *tag; /* Find number of tags and current tag. */ last_subfile = (char *)NULL; for (i = 0; file_buffer->tags[i]; i++) if (strcmp (initial_nodename, file_buffer->tags[i]->nodename) == 0) { current_tag = i; last_subfile = file_buffer->tags[i]->filename; } number_of_tags = i; /* If there is no last_subfile, our tag wasn't found. */ if (!last_subfile) return (-1); /* Search through subsequent nodes, wrapping around to the top of the info file until we find the string or return to this window's node and point. */ while (1) { NODE *node; /* Allow C-g to quit the search, failing it if pressed. */ return_if_control_g (-1); current_tag += dir; if (current_tag < 0) current_tag = number_of_tags - 1; else if (current_tag == number_of_tags) current_tag = 0; tag = file_buffer->tags[current_tag]; if (!echo_area_is_active && (last_subfile != tag->filename)) { window_message_in_echo_area ("Searching subfile \"%s\"...", filename_non_directory (tag->filename)); last_subfile = tag->filename; } node = info_get_node (file_buffer->filename, tag->nodename); if (!node) { /* If not doing i-search... */ if (!echo_area_is_active) { if (info_recent_file_error) info_error (info_recent_file_error); else info_error (CANT_FILE_NODE, filename_non_directory (file_buffer->filename), tag->nodename); } return (-1); } if (dir < 0) start = tag->nodelen; ret = info_search_in_node (string, node, start, window, dir); /* Did we find the string in this node? */ if (ret != -1) { /* Yes! We win. */ remember_window_and_node (window, node); if (!echo_area_is_active) window_clear_echo_area (); return (0); } /* No. Free this node, and make sure that we haven't passed our starting point. */ free (node); if (strcmp (initial_nodename, tag->nodename) == 0) return (-1); } } return (-1); } DECLARE_INFO_COMMAND (info_search, "Read a string and search for it") { char *line, *prompt; int result, old_pagetop; int direction; if (count < 0) direction = -1; else direction = 1; /* Read a string from the user, defaulting the search to SEARCH_STRING. */ if (!search_string) { search_string = (char *)xmalloc (search_string_size = 100); search_string[0] = '\0'; } prompt = (char *)xmalloc (50 + strlen (search_string)); sprintf (prompt, "%s for string [%s]: ", direction < 0 ? "Search backward" : "Search", search_string); line = info_read_in_echo_area (window, prompt); free (prompt); if (!line) { info_abort_key (); return; } if (*line) { if (strlen (line) + 1 > search_string_size) search_string = (char *) xrealloc (search_string, (search_string_size += 50 + strlen (line))); strcpy (search_string, line); search_string_index = strlen (line); free (line); } old_pagetop = active_window->pagetop; result = info_search_internal (search_string, active_window, direction); if (result != 0 && !info_error_was_printed) info_error ("Search failed."); else if (old_pagetop != active_window->pagetop) { int new_pagetop; new_pagetop = active_window->pagetop; active_window->pagetop = old_pagetop; set_window_pagetop (active_window, new_pagetop); if (auto_footnotes_p) info_get_or_remove_footnotes (active_window); } /* Perhaps free the unreferenced file buffers that were searched, but not retained. */ info_gc_file_buffers (); } /* **************************************************************** */ /* */ /* Incremental Searching */ /* */ /* **************************************************************** */ static void incremental_search (); DECLARE_INFO_COMMAND (isearch_forward, "Search interactively for a string as you type it") { incremental_search (window, count, key); } DECLARE_INFO_COMMAND (isearch_backward, "Search interactively for a string as you type it") { incremental_search (window, -count, key); } /* Incrementally search for a string as it is typed. */ /* The last accepted incremental search string. */ static char *last_isearch_accepted = (char *)NULL; /* The current incremental search string. */ static char *isearch_string = (char *)NULL; static int isearch_string_index = 0; static int isearch_string_size = 0; static unsigned char isearch_terminate_search_key = ESC; /* Structure defining the current state of an incremental search. */ typedef struct { WINDOW_STATE_DECL; /* The node, pagetop and point. */ int search_index; /* Offset of the last char in the search string. */ int direction; /* The direction that this search is heading in. */ int failing; /* Whether or not this search failed. */ } SEARCH_STATE; /* Array of search states. */ static SEARCH_STATE **isearch_states = (SEARCH_STATE **)NULL; static int isearch_states_index = 0; static int isearch_states_slots = 0; /* Push the state of this search. */ static void push_isearch (window, search_index, direction, failing) WINDOW *window; int search_index, direction, failing; { SEARCH_STATE *state; state = (SEARCH_STATE *)xmalloc (sizeof (SEARCH_STATE)); window_get_state (window, state); state->search_index = search_index; state->direction = direction; state->failing = failing; add_pointer_to_array (state, isearch_states_index, isearch_states, isearch_states_slots, 20, SEARCH_STATE *); } /* Pop the state of this search to WINDOW, SEARCH_INDEX, and DIRECTION. */ static void pop_isearch (window, search_index, direction, failing) WINDOW *window; int *search_index, *direction, *failing; { SEARCH_STATE *state; if (isearch_states_index) { isearch_states_index--; state = isearch_states[isearch_states_index]; window_set_state (window, state); *search_index = state->search_index; *direction = state->direction; *failing = state->failing; free (state); isearch_states[isearch_states_index] = (SEARCH_STATE *)NULL; } } /* Free the memory used by isearch_states. */ static void free_isearch_states () { register int i; for (i = 0; i < isearch_states_index; i++) { free (isearch_states[i]); isearch_states[i] = (SEARCH_STATE *)NULL; } isearch_states_index = 0; } /* Display the current search in the echo area. */ static void show_isearch_prompt (dir, string, failing_p) int dir; unsigned char *string; int failing_p; { register int i; char *prefix, *prompt, *p_rep; int prompt_len, p_rep_index, p_rep_size; if (dir < 0) prefix = "I-search backward: "; else prefix = "I-search: "; p_rep_index = p_rep_size = 0; p_rep = (char *)NULL; for (i = 0; string[i]; i++) { char *rep; switch (string[i]) { case ' ': rep = " "; break; case LFD: rep = "\\n"; break; case TAB: rep = "\\t"; break; default: rep = pretty_keyname (string[i]); } if ((p_rep_index + strlen (rep) + 1) >= p_rep_size) p_rep = (char *)xrealloc (p_rep, p_rep_size += 100); strcpy (p_rep + p_rep_index, rep); p_rep_index += strlen (rep); } prompt_len = strlen (prefix) + p_rep_index + 20; prompt = (char *)xmalloc (prompt_len); sprintf (prompt, "%s%s%s", failing_p ? "Failing " : "", prefix, p_rep ? p_rep : ""); window_message_in_echo_area ("%s", prompt); maybe_free (p_rep); free (prompt); display_cursor_at_point (active_window); } static void incremental_search (window, count, ignore) WINDOW *window; int count; unsigned char ignore; { unsigned char key; int last_search_result, search_result, dir; SEARCH_STATE mystate, orig_state; if (count < 0) dir = -1; else dir = 1; last_search_result = search_result = 0; window_get_state (window, &orig_state); isearch_string_index = 0; if (!isearch_string_size) isearch_string = (char *)xmalloc (isearch_string_size = 50); /* Show the search string in the echo area. */ isearch_string[isearch_string_index] = '\0'; show_isearch_prompt (dir, isearch_string, search_result); isearch_is_active = 1; while (isearch_is_active) { VFunction *func = (VFunction *)NULL; int quoted = 0; /* If a recent display was interrupted, then do the redisplay now if it is convenient. */ if (!info_any_buffered_input_p () && display_was_interrupted_p) { display_update_one_window (window); display_cursor_at_point (active_window); } /* Read a character and dispatch on it. */ key = info_get_input_char (); window_get_state (window, &mystate); if (key == DEL) { /* User wants to delete one level of search? */ if (!isearch_states_index) { terminal_ring_bell (); continue; } else { pop_isearch (window, &isearch_string_index, &dir, &search_result); isearch_string[isearch_string_index] = '\0'; show_isearch_prompt (dir, isearch_string, search_result); goto after_search; } } else if (key == Control ('q')) { key = info_get_input_char (); quoted = 1; } /* We are about to search again, or quit. Save the current search. */ push_isearch (window, isearch_string_index, dir, search_result); if (quoted) goto insert_and_search; if (!Meta_p (key) || (ISO_Latin_p && key < 160)) { func = window->keymap[key].function; /* If this key invokes an incremental search, then this means that we will either search again in the same direction, search again in the reverse direction, or insert the last search string that was accepted through incremental searching. */ if (func == isearch_forward || func == isearch_backward) { if ((func == isearch_forward && dir > 0) || (func == isearch_backward && dir < 0)) { /* If the user has typed no characters, then insert the last successful search into the current search string. */ if (isearch_string_index == 0) { /* Of course, there must be something to insert. */ if (last_isearch_accepted) { if (strlen (last_isearch_accepted) + 1 >= isearch_string_size) isearch_string = (char *) xrealloc (isearch_string, isearch_string_size += 10 + strlen (last_isearch_accepted)); strcpy (isearch_string, last_isearch_accepted); isearch_string_index = strlen (isearch_string); goto search_now; } else continue; } else { /* Search again in the same direction. This means start from a new place if the last search was successful. */ if (search_result == 0) window->point += dir; } } else { /* Reverse the direction of the search. */ dir = -dir; } } else if (isprint (key) || func == (VFunction *)NULL) { insert_and_search: if (isearch_string_index + 2 >= isearch_string_size) isearch_string = (char *)xrealloc (isearch_string, isearch_string_size += 100); isearch_string[isearch_string_index++] = key; isearch_string[isearch_string_index] = '\0'; goto search_now; } else if (func == info_abort_key) { /* If C-g pressed, and the search is failing, pop the search stack back to the last unfailed search. */ if (isearch_states_index && (search_result != 0)) { terminal_ring_bell (); while (isearch_states_index && (search_result != 0)) pop_isearch (window, &isearch_string_index, &dir, &search_result); isearch_string[isearch_string_index] = '\0'; show_isearch_prompt (dir, isearch_string, search_result); continue; } else goto exit_search; } else goto exit_search; } else { exit_search: /* The character is not printable, or it has a function which is non-null. Exit the search, remembering the search string. If the key is not the same as the isearch_terminate_search_key, then push it into pending input. */ if (isearch_string_index && func != info_abort_key) { maybe_free (last_isearch_accepted); last_isearch_accepted = savestring (isearch_string); } if (key != isearch_terminate_search_key) info_set_pending_input (key); if (func == info_abort_key) { if (isearch_states_index) window_set_state (window, &orig_state); } if (!echo_area_is_active) window_clear_echo_area (); if (auto_footnotes_p) info_get_or_remove_footnotes (active_window); isearch_is_active = 0; continue; } /* Search for the contents of isearch_string. */ search_now: show_isearch_prompt (dir, isearch_string, search_result); if (search_result == 0) { /* Check to see if the current search string is right here. If we are looking at it, then don't bother calling the search function. */ if (((dir < 0) && (strnicmp (window->node->contents + window->point, isearch_string, isearch_string_index) == 0)) || ((dir > 0) && ((window->point - isearch_string_index) >= 0) && (strnicmp (window->node->contents + (window->point - (isearch_string_index - 1)), isearch_string, isearch_string_index) == 0))) { if (dir > 0) window->point++; } else search_result = info_search_internal (isearch_string, window, dir); } /* If this search failed, and we didn't already have a failed search, then ring the terminal bell. */ if (search_result != 0 && last_search_result == 0) terminal_ring_bell (); after_search: show_isearch_prompt (dir, isearch_string, search_result); if (search_result == 0) { if ((mystate.node == window->node) && (mystate.pagetop != window->pagetop)) { int newtop = window->pagetop; window->pagetop = mystate.pagetop; set_window_pagetop (window, newtop); } display_update_one_window (window); display_cursor_at_point (window); } last_search_result = search_result; } /* Free the memory used to remember each search state. */ free_isearch_states (); /* Perhaps GC some file buffers. */ info_gc_file_buffers (); /* After searching, leave the window in the correct state. */ if (!echo_area_is_active) window_clear_echo_area (); } /* GC some file buffers. A file buffer can be gc-ed if there we have no nodes in INFO_WINDOWS that reference this file buffer's contents. Garbage collecting a file buffer means to free the file buffers contents. */ static void info_gc_file_buffers () { register int fb_index, iw_index, i; register FILE_BUFFER *fb; register INFO_WINDOW *iw; if (!info_loaded_files) return; for (fb_index = 0; fb = info_loaded_files[fb_index]; fb_index++) { int fb_referenced_p = 0; /* If already gc-ed, do nothing. */ if (!fb->contents) continue; /* If this file had to be uncompressed, check to see if we should gc it. This means that the user-variable "gc-compressed-files" is non-zero. */ if ((fb->flags & N_IsCompressed) && !gc_compressed_files) continue; /* If this file's contents are not gc-able, move on. */ if (fb->flags & N_CannotGC) continue; /* Check each INFO_WINDOW to see if it has any nodes which reference this file. */ for (iw_index = 0; iw = info_windows[iw_index]; iw_index++) { for (i = 0; iw->nodes && iw->nodes[i]; i++) { if ((strcmp (fb->fullpath, iw->nodes[i]->filename) == 0) || (strcmp (fb->filename, iw->nodes[i]->filename) == 0)) { fb_referenced_p = 1; break; } } } /* If this file buffer wasn't referenced, free its contents. */ if (!fb_referenced_p) { free (fb->contents); fb->contents = (char *)NULL; } } } /* **************************************************************** */ /* */ /* Traversing and Selecting References */ /* */ /* **************************************************************** */ /* Move to the next or previous cross reference in this node. */ static void info_move_to_xref (window, count, key, dir) WINDOW *window; int count; unsigned char key; int dir; { long firstmenu, firstxref; long nextmenu, nextxref; long placement = -1; long start = 0; NODE *node = window->node; if (dir < 0) start = node->nodelen; /* This search is only allowed to fail if there is no menu or cross reference in the current node. Otherwise, the first menu or xref found is moved to. */ firstmenu = info_search_in_node (INFO_MENU_ENTRY_LABEL, node, start, (WINDOW *)NULL, dir); /* FIRSTMENU may point directly to the line defining the menu. Skip that and go directly to the first item. */ if (firstmenu != -1) { char *text = node->contents + firstmenu; if (strncmp (text, INFO_MENU_LABEL, strlen (INFO_MENU_LABEL)) == 0) firstmenu = info_search_in_node (INFO_MENU_ENTRY_LABEL, node, firstmenu + dir, (WINDOW *)NULL, dir); } firstxref = info_search_in_node (INFO_XREF_LABEL, node, start, (WINDOW *)NULL, dir); if (firstmenu == -1 && firstxref == -1) { info_error ("No cross references in this node."); return; } /* There is at least one cross reference or menu entry in this node. Try hard to find the next available one. */ nextmenu = info_search_in_node (INFO_MENU_ENTRY_LABEL, node, window->point + dir, (WINDOW *)NULL, dir); nextxref = info_search_in_node (INFO_XREF_LABEL, node, window->point + dir, (WINDOW *)NULL, dir); /* Ignore "Menu:" as a menu item. */ if (nextmenu != -1) { char *text = node->contents + nextmenu; if (strncmp (text, INFO_MENU_LABEL, strlen (INFO_MENU_LABEL)) == 0) nextmenu = info_search_in_node (INFO_MENU_ENTRY_LABEL, node, nextmenu + dir, (WINDOW *)NULL, dir); } /* If there is both a next menu entry, and a next xref entry, choose the one which occurs first. Otherwise, select the one which actually appears in this node following point. */ if (nextmenu != -1 && nextxref != -1) { if (((dir == 1) && (nextmenu < nextxref)) || ((dir == -1) && (nextmenu > nextxref))) placement = nextmenu + 1; else placement = nextxref; } else if (nextmenu != -1) placement = nextmenu + 1; else if (nextxref != -1) placement = nextxref; /* If there was neither a menu or xref entry appearing in this node after point, choose the first menu or xref entry appearing in this node. */ if (placement == -1) { if (firstmenu != -1 && firstxref != -1) { if (((dir == 1) && (firstmenu < firstxref)) || ((dir == -1) && (firstmenu > firstxref))) placement = firstmenu + 1; else placement = firstxref; } else if (firstmenu != -1) placement = firstmenu + 1; else placement = firstxref; } window->point = placement; window_adjust_pagetop (window); window->flags |= W_UpdateWindow; } DECLARE_INFO_COMMAND (info_move_to_prev_xref, "Move to the previous cross reference") { if (count < 0) info_move_to_prev_xref (window, -count, key); else info_move_to_xref (window, count, key, -1); } DECLARE_INFO_COMMAND (info_move_to_next_xref, "Move to the next cross reference") { if (count < 0) info_move_to_next_xref (window, -count, key); else info_move_to_xref (window, count, key, 1); } /* Select the menu item or reference that appears on this line. */ DECLARE_INFO_COMMAND (info_select_reference_this_line, "Select reference or menu item appearing on this line") { char *line; NODE *orig; line = window->line_starts[window_line_of_point (window)]; orig = window->node; /* If this line contains a menu item, select that one. */ if (strncmp ("* ", line, 2) == 0) info_menu_or_ref_item (window, count, key, info_menu_of_node, 0); else info_menu_or_ref_item (window, count, key, info_xrefs_of_node, 0); } /* **************************************************************** */ /* */ /* Miscellaneous Info Commands */ /* */ /* **************************************************************** */ /* What to do when C-g is pressed in a window. */ DECLARE_INFO_COMMAND (info_abort_key, "Cancel current operation") { /* If error printing doesn't oridinarily ring the bell, do it now, since C-g always rings the bell. Otherwise, let the error printer do it. */ if (!info_error_rings_bell_p) terminal_ring_bell (); info_error ("Quit"); info_initialize_numeric_arg (); info_clear_pending_input (); info_last_executed_command = (VFunction *)NULL; } /* Move the cursor to the desired line of the window. */ DECLARE_INFO_COMMAND (info_move_to_window_line, "Move to the cursor to a specific line of the window") { int line; /* With no numeric argument of any kind, default to the center line. */ if (!info_explicit_arg && count == 1) line = (window->height / 2) + window->pagetop; else { if (count < 0) line = (window->height + count) + window->pagetop; else line = window->pagetop + count; } /* If the line doesn't appear in this window, make it do so. */ if ((line - window->pagetop) >= window->height) line = window->pagetop + (window->height - 1); /* If the line is too small, make it fit. */ if (line < window->pagetop) line = window->pagetop; /* If the selected line is past the bottom of the node, force it back. */ if (line >= window->line_count) line = window->line_count - 1; window->point = (window->line_starts[line] - window->node->contents); } /* Clear the screen and redraw its contents. Given a numeric argument, move the line the cursor is on to the COUNT'th line of the window. */ DECLARE_INFO_COMMAND (info_redraw_display, "Redraw the display") { if ((!info_explicit_arg && count == 1) || echo_area_is_active) { terminal_clear_screen (); display_clear_display (the_display); window_mark_chain (windows, W_UpdateWindow); display_update_display (windows); } else { int desired_line, point_line; int new_pagetop; point_line = window_line_of_point (window) - window->pagetop; if (count < 0) desired_line = window->height + count; else desired_line = count; if (desired_line < 0) desired_line = 0; if (desired_line >= window->height) desired_line = window->height - 1; if (desired_line == point_line) return; new_pagetop = window->pagetop + (point_line - desired_line); set_window_pagetop (window, new_pagetop); } } /* This command does nothing. It is the fact that a key is bound to it that has meaning. See the code at the top of info_session (). */ DECLARE_INFO_COMMAND (info_quit, "Quit using Info") {} /* **************************************************************** */ /* */ /* Reading Keys and Dispatching on Them */ /* */ /* **************************************************************** */ /* Declaration only. Special cased in info_dispatch_on_key (). */ DECLARE_INFO_COMMAND (info_do_lowercase_version, "") {} static void dispatch_error (keyseq) char *keyseq; { char *rep; char *format; rep = pretty_keyseq (keyseq); format = replace_in_documentation ("Unknown command (%s). Type \"\\[quit]\" to quit, \"\\[get-help-window]\" for help."); if (!echo_area_is_active) info_error (format, rep); else { char *temp; temp = (char *)xmalloc (1 + strlen (rep) + strlen ("\"\" is invalid")); sprintf (temp, "\"%s\" is invalid", rep); terminal_ring_bell (); inform_in_echo_area (temp); free (temp); } } /* Keeping track of key sequences. */ static char *info_keyseq = (char *)NULL; static char keyseq_rep[100]; static int info_keyseq_index = 0; static int info_keyseq_size = 0; static int info_keyseq_displayed_p = 0; /* Initialize the length of the current key sequence. */ void initialize_keyseq () { info_keyseq_index = 0; info_keyseq_displayed_p = 0; } /* Add CHARACTER to the current key sequence. */ void add_char_to_keyseq (character) char character; { if (info_keyseq_index + 2 >= info_keyseq_size) info_keyseq = (char *)xrealloc (info_keyseq, info_keyseq_size += 10); info_keyseq[info_keyseq_index++] = character; info_keyseq[info_keyseq_index] = '\0'; } /* Return the pretty printable string which represents KEYSEQ. */ char * pretty_keyseq (keyseq) char *keyseq; { register int i; keyseq_rep[0] = '\0'; for (i = 0; keyseq[i]; i++) { sprintf (keyseq_rep + strlen (keyseq_rep), "%s%s", strlen (keyseq_rep) ? " " : "", pretty_keyname (keyseq[i])); } return (keyseq_rep); } /* Display the current value of info_keyseq. If argument EXPECTING is non-zero, input is expected to be read after the key sequence is displayed, so add an additional prompting character to the sequence. */ void display_info_keyseq (expecting_future_input) int expecting_future_input; { char *rep; rep = pretty_keyseq (info_keyseq); if (expecting_future_input) strcat (rep, "-"); if (echo_area_is_active) inform_in_echo_area (rep); else { window_message_in_echo_area (rep); display_cursor_at_point (active_window); } info_keyseq_displayed_p = 1; } /* Called by interactive commands to read a keystroke. */ unsigned char info_get_another_input_char () { int ready = 0; /* If there isn't any input currently available, then wait a moment looking for input. If we don't get it fast enough, prompt a little bit with the current key sequence. */ if (!info_keyseq_displayed_p && !info_any_buffered_input_p () && !info_input_pending_p ()) { #if defined (FD_SET) struct timeval timer; fd_set readfds; FD_ZERO (&readfds); FD_SET (fileno (info_input_stream), &readfds); timer.tv_sec = 1; timer.tv_usec = 750; ready = select (1, &readfds, (fd_set *)NULL, (fd_set *)NULL, &timer); #endif /* FD_SET */ } if (!ready) display_info_keyseq (1); return (info_get_input_char ()); } /* Do the command associated with KEY in MAP. If the associated command is really a keymap, then read another key, and dispatch into that map. */ void info_dispatch_on_key (key, map) unsigned char key; Keymap map; { if (Meta_p (key) && (!ISO_Latin_p || map[key].function != ea_insert)) { if (map[ESC].type == ISKMAP) { map = (Keymap)map[ESC].function; add_char_to_keyseq (ESC); key = UnMeta (key); info_dispatch_on_key (key, map); } else { dispatch_error (info_keyseq); } return; } switch (map[key].type) { case ISFUNC: { VFunction *func; func = map[key].function; if (func != (VFunction *)NULL) { /* Special case info_do_lowercase_version (). */ if (func == info_do_lowercase_version) { info_dispatch_on_key (tolower (key), map); return; } add_char_to_keyseq (key); if (info_keyseq_displayed_p) display_info_keyseq (0); { WINDOW *where; where = active_window; (*map[key].function) (active_window, info_numeric_arg * info_numeric_arg_sign, key); /* If we have input pending, then the last command was a prefix command. Don't change the value of the last function vars. Otherwise, remember the last command executed in the var appropriate to the window in which it was executed. */ if (!info_input_pending_p ()) { if (where == the_echo_area) ea_last_executed_command = map[key].function; else info_last_executed_command = map[key].function; } } } else { add_char_to_keyseq (key); dispatch_error (info_keyseq); return; } } break; case ISKMAP: add_char_to_keyseq (key); if (map[key].function != (VFunction *)NULL) { unsigned char newkey; newkey = info_get_another_input_char (); info_dispatch_on_key (newkey, (Keymap)map[key].function); } else { dispatch_error (info_keyseq); return; } break; } } /* **************************************************************** */ /* */ /* Numeric Arguments */ /* */ /* **************************************************************** */ /* Handle C-u style numeric args, as well as M--, and M-digits. */ /* Non-zero means that an explicit argument has been passed to this command, as in C-u C-v. */ int info_explicit_arg = 0; /* The sign of the numeric argument. */ int info_numeric_arg_sign = 1; /* The value of the argument itself. */ int info_numeric_arg = 1; /* Add the current digit to the argument in progress. */ DECLARE_INFO_COMMAND (info_add_digit_to_numeric_arg, "Add this digit to the current numeric argument") { info_numeric_arg_digit_loop (window, 0, key); } /* C-u, universal argument. Multiply the current argument by 4. Read a key. If the key has nothing to do with arguments, then dispatch on it. If the key is the abort character then abort. */ DECLARE_INFO_COMMAND (info_universal_argument, "Start (or multiply by 4) the current numeric argument") { info_numeric_arg *= 4; info_numeric_arg_digit_loop (window, 0, 0); } /* Create a default argument. */ void info_initialize_numeric_arg () { info_numeric_arg = info_numeric_arg_sign = 1; info_explicit_arg = 0; } DECLARE_INFO_COMMAND (info_numeric_arg_digit_loop, "") { unsigned char pure_key; Keymap keymap = window->keymap; while (1) { if (key) pure_key = key; else { if (display_was_interrupted_p && !info_any_buffered_input_p ()) display_update_display (windows); if (active_window != the_echo_area) display_cursor_at_point (active_window); pure_key = key = info_get_another_input_char (); if (Meta_p (key)) add_char_to_keyseq (ESC); add_char_to_keyseq (UnMeta (key)); } if (Meta_p (key)) key = UnMeta (key); if (keymap[key].type == ISFUNC && keymap[key].function == info_universal_argument) { info_numeric_arg *= 4; key = 0; continue; } if (isdigit (key)) { if (info_explicit_arg) info_numeric_arg = (info_numeric_arg * 10) + (key - '0'); else info_numeric_arg = (key - '0'); info_explicit_arg = 1; } else { if (key == '-' && !info_explicit_arg) { info_numeric_arg_sign = -1; info_numeric_arg = 1; } else { info_keyseq_index--; info_dispatch_on_key (pure_key, keymap); return; } } key = 0; } } /* **************************************************************** */ /* */ /* Input Character Buffering */ /* */ /* **************************************************************** */ /* Character waiting to be read next. */ static int pending_input_character = 0; /* How to make there be no pending input. */ static void info_clear_pending_input () { pending_input_character = 0; } /* How to set the pending input character. */ static void info_set_pending_input (key) unsigned char key; { pending_input_character = key; } /* How to see if there is any pending input. */ unsigned char info_input_pending_p () { return (pending_input_character); } /* Largest number of characters that we can read in advance. */ #define MAX_INFO_INPUT_BUFFERING 512 static int pop_index = 0, push_index = 0; static unsigned char info_input_buffer[MAX_INFO_INPUT_BUFFERING]; /* Add KEY to the buffer of characters to be read. */ static void info_push_typeahead (key) unsigned char key; { /* Flush all pending input in the case of C-g pressed. */ if (key == Control ('g')) { push_index = pop_index; info_set_pending_input (Control ('g')); } else { info_input_buffer[push_index++] = key; if (push_index >= sizeof (info_input_buffer)) push_index = 0; } } /* Return the amount of space available in INFO_INPUT_BUFFER for new chars. */ static int info_input_buffer_space_available () { if (pop_index > push_index) return (pop_index - push_index); else return (sizeof (info_input_buffer - (push_index - pop_index))); } /* Get a key from the buffer of characters to be read. Return the key in KEY. Result is non-zero if there was a key, or 0 if there wasn't. */ static int info_get_key_from_typeahead (key) unsigned char *key; { if (push_index == pop_index) return (0); *key = info_input_buffer[pop_index++]; if (pop_index >= sizeof (info_input_buffer)) pop_index = 0; return (1); } int info_any_buffered_input_p () { info_gather_typeahead (); return (push_index != pop_index); } /* Push KEY into the *front* of the input buffer. Returns non-zero if successful, zero if there is no space left in the buffer. */ static int info_replace_key_to_typeahead (key) unsigned char key; { if (info_input_buffer_space_available ()) { pop_index--; if (pop_index < 0) pop_index = sizeof (info_input_buffer) - 1; info_input_buffer[pop_index] = key; return (1); } return (0); } /* If characters are available to be read, then read them and stuff them into info_input_buffer. Otherwise, do nothing. */ void info_gather_typeahead () { int tty, space_avail; long chars_avail; unsigned char input[MAX_INFO_INPUT_BUFFERING]; tty = fileno (info_input_stream); chars_avail = 0; space_avail = info_input_buffer_space_available (); /* If we can just find out how many characters there are to read, do so. */ #if defined (FIONREAD) { ioctl (tty, FIONREAD, &chars_avail); if (chars_avail > space_avail) chars_avail = space_avail; if (chars_avail) read (tty, &input[0], chars_avail); } #else /* !FIONREAD */ # if defined (O_NDELAY) { int flags; flags = fcntl (tty, F_GETFL, 0); fcntl (tty, F_SETFL, (flags | O_NDELAY)); chars_avail = read (tty, &input[0], space_avail); fcntl (tty, F_SETFL, flags); if (chars_avail == -1) chars_avail = 0; } # endif /* O_NDELAY */ #endif /* !FIONREAD */ /* Store the input characters just read into our input buffer. */ { register int i; for (i = 0; i < chars_avail; i++) info_push_typeahead (input[i]); } } /* How to read a single character. */ unsigned char info_get_input_char () { unsigned char keystroke; info_gather_typeahead (); if (pending_input_character) { keystroke = pending_input_character; pending_input_character = 0; } else if (info_get_key_from_typeahead (&keystroke) == 0) { int rawkey; int ignoreeof = 7; /* Ugh. After returning from a C-z that interrupted us while we were waiting on input, Ultrix (and other?) systems return EOF from getc instead of continuing to wait. Hack around that by trying to read atain up to IGNOREEOF times. */ do { rawkey = getc (info_input_stream); } while (rawkey == EOF && --ignoreeof); keystroke = rawkey; if (rawkey == EOF) { if (info_input_stream != stdin) { fclose (info_input_stream); info_input_stream = stdin; display_inhibited = 0; display_update_display (windows); display_cursor_at_point (active_window); rawkey = getc (info_input_stream); keystroke = rawkey; } if (rawkey == EOF) { keystroke = '\0'; terminal_unprep_terminal (); close_dribble_file (); exit (0); } } } if (info_dribble_file) dribble (keystroke); return (keystroke); } octave-1.1.0/info/signals.c100666 415 17 12221 5627202023 13712 0ustar jweusers/* signals.c -- Install and maintain Info signal handlers. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include "signals.h" /* **************************************************************** */ /* */ /* Pretending That We Have POSIX Signals */ /* */ /* **************************************************************** */ #if !defined (_POSIX_VERSION) /* Perform OPERATION on NEWSET, perhaps leaving information in OLDSET. */ static void sigprocmask (operation, newset, oldset) int operation, *newset, *oldset; { switch (operation) { case SIG_UNBLOCK: #if defined (HAVE_SIGSETMASK) sigsetmask (sigblock (0) & ~(*newset)); #endif /* HAVE_SIGSETMASK */ break; case SIG_BLOCK: *oldset = sigblock (*newset); break; case SIG_SETMASK: #if defined (HAVE_SIGSETMASK) sigsetmask (*newset); #endif /* HAVE_SIGSETMASK */ break; default: abort (); } } #endif /* !_POSIX_VERSION */ /* **************************************************************** */ /* */ /* Signal Handling for Info */ /* */ /* **************************************************************** */ typedef void SigHandlerType; typedef SigHandlerType SigHandler (); static SigHandlerType info_signal_handler (); static SigHandler *old_TSTP, *old_TTOU, *old_TTIN; static SigHandler *old_WINCH, *old_INT; void initialize_info_signal_handler () { #if defined (SIGTSTP) old_TSTP = (SigHandler *) signal (SIGTSTP, info_signal_handler); old_TTOU = (SigHandler *) signal (SIGTTOU, info_signal_handler); old_TTIN = (SigHandler *) signal (SIGTTIN, info_signal_handler); #endif /* SIGTSTP */ #if defined (SIGWINCH) old_WINCH = (SigHandler *) signal (SIGWINCH, info_signal_handler); #endif #if defined (SIGINT) old_INT = (SigHandler *) signal (SIGINT, info_signal_handler); #endif } void clear_info_signal_handler () { #if defined (SIGTSTP) signal (SIGTSTP, old_TSTP); signal (SIGTTOU, old_TTOU); signal (SIGTTIN, old_TTIN); #endif /* SIGTSTP */ #if defined (SIGWINCH) signal (SIGWINCH, old_WINCH); #endif #if defined (SIGINT) signal (SIGINT, old_INT); #endif } static void redisplay_after_signal () { terminal_clear_screen (); display_clear_display (the_display); window_mark_chain (windows, W_UpdateWindow); display_update_display (windows); display_cursor_at_point (active_window); fflush (stdout); } static SigHandlerType info_signal_handler (sig) int sig; { SigHandler **old_signal_handler; switch (sig) { #if defined (SIGTSTP) case SIGTSTP: case SIGTTOU: case SIGTTIN: #endif #if defined (SIGINT) case SIGINT: #endif { #if defined (SIGTSTP) if (sig == SIGTSTP) old_signal_handler = &old_TSTP; else if (sig == SIGTTOU) old_signal_handler = &old_TTOU; else if (sig == SIGTTIN) old_signal_handler = &old_TTIN; #endif /* SIGTSTP */ #if defined (SIGINT) else if (sig == SIGINT) old_signal_handler = &old_INT; #endif /* For stop signals, restore the terminal IO, leave the cursor at the bottom of the window, and stop us. */ terminal_goto_xy (0, screenheight - 1); terminal_clear_to_eol (); fflush (stdout); terminal_unprep_terminal (); UNBLOCK_SIGNAL (sig); signal (sig, *old_signal_handler); kill (getpid (), sig); /* The program is returning now. Restore our signal handler, turn on terminal handling, redraw the screen, and place the cursor where it belongs. */ terminal_prep_terminal (); *old_signal_handler = (SigHandler *) signal (sig, info_signal_handler); redisplay_after_signal (); fflush (stdout); } break; #if defined (SIGWINCH) case SIGWINCH: { /* Turn off terminal IO, tell our parent that the window has changed, then reinitialize the terminal and rebuild our windows. */ old_signal_handler = &old_WINCH; terminal_goto_xy (0, 0); fflush (stdout); terminal_unprep_terminal (); signal (sig, *old_signal_handler); UNBLOCK_SIGNAL (sig); kill (getpid (), sig); /* After our old signal handler returns... */ terminal_get_screen_size (); terminal_prep_terminal (); display_initialize_display (screenwidth, screenheight); window_new_screen_size (screenwidth, screenheight, (VFunction *)NULL); *old_signal_handler = (SigHandler *) signal (sig, info_signal_handler); redisplay_after_signal (); } break; #endif /* SIGWINCH */ } } octave-1.1.0/info/terminal.c100666 415 17 46500 5545663322 14110 0ustar jweusers/* terminal.c -- How to handle the physical terminal for Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. This file has appeared in prior works by the Free Software Foundation; thus it carries copyright dates from 1988 through 1993. Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include "terminal.h" #include "termdep.h" extern void *xmalloc (), *xrealloc (); /* The Unix termcap interface code. */ extern int tgetnum (), tgetflag (), tgetent (); extern char *tgetstr (), *tgoto (); extern char *getenv (); extern void tputs (); /* Function "hooks". If you make one of these point to a function, that function is called when appropriate instead of its namesake. Your function is called with exactly the same arguments that were passed to the namesake function. */ VFunction *terminal_begin_inverse_hook = (VFunction *)NULL; VFunction *terminal_end_inverse_hook = (VFunction *)NULL; VFunction *terminal_prep_terminal_hook = (VFunction *)NULL; VFunction *terminal_unprep_terminal_hook = (VFunction *)NULL; VFunction *terminal_up_line_hook = (VFunction *)NULL; VFunction *terminal_down_line_hook = (VFunction *)NULL; VFunction *terminal_clear_screen_hook = (VFunction *)NULL; VFunction *terminal_clear_to_eol_hook = (VFunction *)NULL; VFunction *terminal_get_screen_size_hook = (VFunction *)NULL; VFunction *terminal_goto_xy_hook = (VFunction *)NULL; VFunction *terminal_initialize_terminal_hook = (VFunction *)NULL; VFunction *terminal_new_terminal_hook = (VFunction *)NULL; VFunction *terminal_put_text_hook = (VFunction *)NULL; VFunction *terminal_ring_bell_hook = (VFunction *)NULL; VFunction *terminal_write_chars_hook = (VFunction *)NULL; VFunction *terminal_scroll_terminal_hook = (VFunction *)NULL; /* **************************************************************** */ /* */ /* Terminal and Termcap */ /* */ /* **************************************************************** */ /* On Solaris2, sys/types.h #includes sys/reg.h, which #defines PC. Unfortunately, PC is a global variable used by the termcap library. */ #undef PC /* TERMCAP requires these variables, whether we access them or not. */ char PC; char *BC, *UP; short ospeed; /* A buffer which holds onto the current terminal description, and a pointer used to float within it. */ static char *term_buffer = (char *)NULL; static char *term_string_buffer = (char *)NULL; /* Some strings to control terminal actions. These are output by tputs (). */ static char *term_goto, *term_clreol, *term_cr, *term_clrpag; static char *term_begin_use, *term_end_use; static char *term_AL, *term_DL, *term_al, *term_dl; /* How to go up a line. */ static char *term_up; /* How to go down a line. */ static char *term_dn; /* An audible bell, if the terminal can be made to make noise. */ static char *audible_bell; /* A visible bell, if the terminal can be made to flash the screen. */ static char *visible_bell; /* The string to write to turn on the meta key, if this term has one. */ static char *term_mm; /* The string to write to turn off the meta key, if this term has one. */ static char *term_mo; /* The string to turn on inverse mode, if this term has one. */ static char *term_invbeg; /* The string to turn off inverse mode, if this term has one. */ static char *term_invend; static void output_character_function (c) int c; { putc (c, stdout); } /* Macro to send STRING to the terminal. */ #define send_to_terminal(string) \ do { \ if (string) \ tputs (string, 1, output_character_function); \ } while (0) /* Tell the terminal that we will be doing cursor addressable motion. */ static void terminal_begin_using_terminal () { send_to_terminal (term_begin_use); } /* Tell the terminal that we will not be doing any more cursor addressable motion. */ static void terminal_end_using_terminal () { send_to_terminal (term_end_use); } /* **************************************************************** */ /* */ /* Necessary Terminal Functions */ /* */ /* **************************************************************** */ /* The functions and variables on this page implement the user visible portion of the terminal interface. */ /* The width and height of the terminal. */ int screenwidth, screenheight; /* Non-zero means this terminal can't really do anything. */ int terminal_is_dumb_p = 0; /* Non-zero means that this terminal has a meta key. */ int terminal_has_meta_p = 0; /* Non-zero means that this terminal can produce a visible bell. */ int terminal_has_visible_bell_p = 0; /* Non-zero means to use that visible bell if at all possible. */ int terminal_use_visible_bell_p = 0; /* Non-zero means that the terminal can do scrolling. */ int terminal_can_scroll = 0; /* The key sequences output by the arrow keys, if this terminal has any. */ char *term_ku, *term_kd, *term_kr, *term_kl; /* Move the cursor to the terminal location of X and Y. */ void terminal_goto_xy (x, y) int x, y; { if (terminal_goto_xy_hook) (*terminal_goto_xy_hook) (x, y); else { if (term_goto) tputs (tgoto (term_goto, x, y), 1, output_character_function); } } /* Print STRING to the terminal at the current position. */ void terminal_put_text (string) char *string; { if (terminal_put_text_hook) (*terminal_put_text_hook) (string); else { printf ("%s", string); } } /* Print NCHARS from STRING to the terminal at the current position. */ void terminal_write_chars (string, nchars) char *string; int nchars; { if (terminal_write_chars_hook) (*terminal_write_chars_hook) (string, nchars); else { if (nchars) fwrite (string, 1, nchars, stdout); } } /* Clear from the current position of the cursor to the end of the line. */ void terminal_clear_to_eol () { if (terminal_clear_to_eol_hook) (*terminal_clear_to_eol_hook) (); else { send_to_terminal (term_clreol); } } /* Clear the entire terminal screen. */ void terminal_clear_screen () { if (terminal_clear_screen_hook) (*terminal_clear_screen_hook) (); else { send_to_terminal (term_clrpag); } } /* Move the cursor up one line. */ void terminal_up_line () { if (terminal_up_line_hook) (*terminal_up_line_hook) (); else { send_to_terminal (term_up); } } /* Move the cursor down one line. */ void terminal_down_line () { if (terminal_down_line_hook) (*terminal_down_line_hook) (); else { send_to_terminal (term_dn); } } /* Turn on reverse video if possible. */ void terminal_begin_inverse () { if (terminal_begin_inverse_hook) (*terminal_begin_inverse_hook) (); else { send_to_terminal (term_invbeg); } } /* Turn off reverse video if possible. */ void terminal_end_inverse () { if (terminal_end_inverse_hook) (*terminal_end_inverse_hook) (); else { send_to_terminal (term_invend); } } /* Ring the terminal bell. The bell is run visibly if it both has one and terminal_use_visible_bell_p is non-zero. */ void terminal_ring_bell () { if (terminal_ring_bell_hook) (*terminal_ring_bell_hook) (); else { if (terminal_has_visible_bell_p && terminal_use_visible_bell_p) send_to_terminal (visible_bell); else send_to_terminal (audible_bell); } } /* At the line START, delete COUNT lines from the terminal display. */ static void terminal_delete_lines (start, count) int start, count; { int lines; /* Normalize arguments. */ if (start < 0) start = 0; lines = screenheight - start; terminal_goto_xy (0, start); if (term_DL) tputs (tgoto (term_DL, 0, count), lines, output_character_function); else { while (count--) tputs (term_dl, lines, output_character_function); } fflush (stdout); } /* At the line START, insert COUNT lines in the terminal display. */ static void terminal_insert_lines (start, count) int start, count; { int lines; /* Normalize arguments. */ if (start < 0) start = 0; lines = screenheight - start; terminal_goto_xy (0, start); if (term_AL) tputs (tgoto (term_AL, 0, count), lines, output_character_function); else { while (count--) tputs (term_al, lines, output_character_function); } fflush (stdout); } /* Scroll an area of the terminal, starting with the region from START to END, AMOUNT lines. If AMOUNT is negative, the lines are scrolled towards the top of the screen, else they are scrolled towards the bottom of the screen. */ void terminal_scroll_terminal (start, end, amount) int start, end, amount; { if (!terminal_can_scroll) return; /* Any scrolling at all? */ if (amount == 0) return; if (terminal_scroll_terminal_hook) (*terminal_scroll_terminal_hook) (start, end, amount); else { /* If we are scrolling down, delete AMOUNT lines at END. Then insert AMOUNT lines at START. */ if (amount > 0) { terminal_delete_lines (end, amount); terminal_insert_lines (start, amount); } /* If we are scrolling up, delete AMOUNT lines before START. This actually does the upwards scroll. Then, insert AMOUNT lines after the already scrolled region (i.e., END - AMOUNT). */ if (amount < 0) { int abs_amount = -amount; terminal_delete_lines (start - abs_amount, abs_amount); terminal_insert_lines (end - abs_amount, abs_amount); } } } /* Re-initialize the terminal considering that the TERM/TERMCAP variable has changed. */ void terminal_new_terminal (terminal_name) char *terminal_name; { if (terminal_new_terminal_hook) (*terminal_new_terminal_hook) (terminal_name); else { terminal_initialize_terminal (terminal_name); } } /* Set the global variables SCREENWIDTH and SCREENHEIGHT. */ void terminal_get_screen_size () { if (terminal_get_screen_size_hook) (*terminal_get_screen_size_hook) (); else { screenwidth = screenheight = 0; #if defined (TIOCGWINSZ) { struct winsize window_size; if (ioctl (fileno (stdout), TIOCGWINSZ, &window_size) == 0) { screenwidth = (int) window_size.ws_col; screenheight = (int) window_size.ws_row; } } #endif /* TIOCGWINSZ */ /* Environment variable COLUMNS overrides setting of "co". */ if (screenwidth <= 0) { char *sw = getenv ("COLUMNS"); if (sw) screenwidth = atoi (sw); if (screenwidth <= 0) screenwidth = tgetnum ("co"); } /* Environment variable LINES overrides setting of "li". */ if (screenheight <= 0) { char *sh = getenv ("LINES"); if (sh) screenheight = atoi (sh); if (screenheight <= 0) screenheight = tgetnum ("li"); } /* If all else fails, default to 80x24 terminal. */ if (screenwidth <= 0) screenwidth = 80; if (screenheight <= 0) screenheight = 24; } } /* Initialize the terminal which is known as TERMINAL_NAME. If this terminal doesn't have cursor addressability, TERMINAL_IS_DUMB_P becomes non-zero. The variables SCREENHEIGHT and SCREENWIDTH are set to the dimensions that this terminal actually has. The variable TERMINAL_HAS_META_P becomes non- zero if this terminal supports a Meta key. Finally, the terminal screen is cleared. */ void terminal_initialize_terminal (terminal_name) char *terminal_name; { char *term, *buffer; terminal_is_dumb_p = 0; if (terminal_initialize_terminal_hook) { (*terminal_initialize_terminal_hook) (terminal_name); return; } term = terminal_name ? terminal_name : getenv ("TERM"); if (!term_string_buffer) term_string_buffer = (char *)xmalloc (2048); if (!term_buffer) term_buffer = (char *)xmalloc (2048); buffer = term_string_buffer; term_clrpag = term_cr = term_clreol = (char *)NULL; if (!term) term = "dumb"; if (tgetent (term_buffer, term) <= 0) { terminal_is_dumb_p = 1; screenwidth = 80; screenheight = 24; term_cr = "\r"; term_up = term_dn = audible_bell = visible_bell = (char *)NULL; term_ku = term_kd = term_kl = term_kr = (char *)NULL; return; } BC = tgetstr ("pc", &buffer); PC = BC ? *BC : 0; #if defined (TIOCGETP) { struct sgttyb sg; if (ioctl (fileno (stdout), TIOCGETP, &sg) != -1) ospeed = sg.sg_ospeed; else ospeed = B9600; } #else ospeed = B9600; #endif /* !TIOCGETP */ term_cr = tgetstr ("cr", &buffer); term_clreol = tgetstr ("ce", &buffer); term_clrpag = tgetstr ("cl", &buffer); term_goto = tgetstr ("cm", &buffer); /* Find out about this terminals scrolling capability. */ term_AL = tgetstr ("AL", &buffer); term_DL = tgetstr ("DL", &buffer); term_al = tgetstr ("al", &buffer); term_dl = tgetstr ("dl", &buffer); terminal_can_scroll = ((term_AL || term_al) && (term_DL || term_dl)); term_invbeg = tgetstr ("mr", &buffer); if (term_invbeg) term_invend = tgetstr ("me", &buffer); else term_invend = (char *)NULL; if (!term_cr) term_cr = "\r"; terminal_get_screen_size (); term_up = tgetstr ("up", &buffer); term_dn = tgetstr ("dn", &buffer); visible_bell = tgetstr ("vb", &buffer); terminal_has_visible_bell_p = (visible_bell != (char *)NULL); audible_bell = tgetstr ("bl", &buffer); if (!audible_bell) audible_bell = "\007"; term_begin_use = tgetstr ("ti", &buffer); term_end_use = tgetstr ("te", &buffer); /* Check to see if this terminal has a meta key. */ terminal_has_meta_p = (tgetflag ("km") || tgetflag ("MT")); if (terminal_has_meta_p) { term_mm = tgetstr ("mm", &buffer); term_mo = tgetstr ("mo", &buffer); } else { term_mm = (char *)NULL; term_mo = (char *)NULL; } /* Attempt to find the arrow keys. */ term_ku = tgetstr ("ku", &buffer); term_kd = tgetstr ("kd", &buffer); term_kr = tgetstr ("kr", &buffer); term_kl = tgetstr ("kl", &buffer); /* If this terminal is not cursor addressable, then it is really dumb. */ if (!term_goto) terminal_is_dumb_p = 1; terminal_begin_using_terminal (); } /* **************************************************************** */ /* */ /* How to Read Characters From the Terminal */ /* */ /* **************************************************************** */ #if defined (TIOCGETC) /* A buffer containing the terminal interrupt characters upon entry to Info. */ struct tchars original_tchars; #endif #if defined (TIOCGLTC) /* A buffer containing the local terminal mode characters upon entry to Info. */ struct ltchars original_ltchars; #endif #if defined (HAVE_TERMIOS_H) /* A buffer containing the terminal mode flags upon entry to info. */ struct termios original_termios, ttybuff; #elif defined (HAVE_TERMIO_H) /* A buffer containing the terminal mode flags upon entry to info. */ struct termio original_termio, ttybuff; #else /* !HAVE_TERMIO_H */ /* Buffers containing the terminal mode flags upon entry to info. */ int original_tty_flags = 0; int original_lmode; struct sgttyb ttybuff; #endif /* !HAVE_TERMIO_H */ /* Prepare to start using the terminal to read characters singly. */ void terminal_prep_terminal () { int tty; if (terminal_prep_terminal_hook) { (*terminal_prep_terminal_hook) (); return; } tty = fileno (stdin); #if defined (HAVE_TERMIOS_H) tcgetattr (tty, &original_termios); tcgetattr (tty, &ttybuff); ttybuff.c_iflag &= (~ISTRIP & ~INLCR & ~IGNCR & ~ICRNL & ~IXON); #if defined (OCRNL) ttybuff.c_oflag &= (~ONLCR & ~OCRNL); #else ttybuff.c_oflag &= (~ONLCR); #endif ttybuff.c_lflag &= (~ICANON & ~ECHO); ttybuff.c_cc[VMIN] = 1; ttybuff.c_cc[VTIME] = 0; if (ttybuff.c_cc[VINTR] = '\177') ttybuff.c_cc[VINTR] = -1; if (ttybuff.c_cc[VQUIT] = '\177') ttybuff.c_cc[VQUIT] = -1; tcsetattr (tty, TCSAFLUSH, &ttybuff); #elif defined (HAVE_TERMIO_H) ioctl (tty, TCGETA, &original_termio); ioctl (tty, TCGETA, &ttybuff); ttybuff.c_iflag &= (~ISTRIP & ~INLCR & ~IGNCR & ~ICRNL & ~IXON); #if defined (OCRNL) ttybuff.c_oflag &= (~ONLCR & ~OCRNL); #else ttybuff.c_oflag &= (~ONLCR); #endif ttybuff.c_lflag &= (~ICANON & ~ECHO); ttybuff.c_cc[VMIN] = 1; ttybuff.c_cc[VTIME] = 0; if (ttybuff.c_cc[VINTR] = '\177') ttybuff.c_cc[VINTR] = -1; if (ttybuff.c_cc[VQUIT] = '\177') ttybuff.c_cc[VQUIT] = -1; ioctl (tty, TCSETA, &ttybuff); #else /* !HAVE_TERMIO_H */ ioctl (tty, TIOCGETP, &ttybuff); if (!original_tty_flags) original_tty_flags = ttybuff.sg_flags; /* Make this terminal pass 8 bits around while we are using it. */ #if defined (PASS8) ttybuff.sg_flags |= PASS8; #endif /* PASS8 */ #if defined (TIOCLGET) && defined (LPASS8) { int flags; ioctl (tty, TIOCLGET, &flags); original_lmode = flags; flags |= LPASS8; ioctl (tty, TIOCLSET, &flags); } #endif /* TIOCLGET && LPASS8 */ #if defined (TIOCGETC) { struct tchars temp; ioctl (tty, TIOCGETC, &original_tchars); temp = original_tchars; /* C-s and C-q. */ temp.t_startc = temp.t_stopc = -1; /* Often set to C-d. */ temp.t_eofc = -1; /* If the a quit or interrupt character conflicts with one of our commands, then make it go away. */ if (temp.t_intrc == '\177') temp.t_intrc = -1; if (temp.t_quitc == '\177') temp.t_quitc = -1; ioctl (tty, TIOCSETC, &temp); } #endif /* TIOCGETC */ #if defined (TIOCGLTC) { struct ltchars temp; ioctl (tty, TIOCGLTC, &original_ltchars); temp = original_ltchars; /* Make the interrupt keys go away. Just enough to make people happy. */ temp.t_lnextc = -1; /* C-v. */ temp.t_dsuspc = -1; /* C-y. */ temp.t_flushc = -1; /* C-o. */ ioctl (tty, TIOCSLTC, &temp); } #endif /* TIOCGLTC */ ttybuff.sg_flags &= ~ECHO; ttybuff.sg_flags |= CBREAK; ioctl (tty, TIOCSETN, &ttybuff); #endif /* !HAVE_TERMIO_H */ } /* Restore the tty settings back to what they were before we started using this terminal. */ void terminal_unprep_terminal () { int tty; if (terminal_unprep_terminal_hook) { (*terminal_unprep_terminal_hook) (); return; } tty = fileno (stdin); #if defined (HAVE_TERMIOS_H) tcsetattr (tty, TCSAFLUSH, &original_termios); #elif defined (HAVE_TERMIO_H) ioctl (tty, TCSETA, &original_termio); #else /* !HAVE_TERMIO_H */ ioctl (tty, TIOCGETP, &ttybuff); ttybuff.sg_flags = original_tty_flags; ioctl (tty, TIOCSETN, &ttybuff); #if defined (TIOCGETC) ioctl (tty, TIOCSETC, &original_tchars); #endif /* TIOCGETC */ #if defined (TIOCGLTC) ioctl (tty, TIOCSLTC, &original_ltchars); #endif /* TIOCGLTC */ #if defined (TIOCLGET) && defined (LPASS8) ioctl (tty, TIOCLSET, &original_lmode); #endif /* TIOCLGET && LPASS8 */ #endif /* !HAVE_TERMIO_H */ terminal_end_using_terminal (); } octave-1.1.0/info/tilde.c100666 415 17 22547 5333267224 13377 0ustar jweusers/* tilde.c -- Tilde expansion code (~/foo := $HOME/foo). */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. This file has appeared in prior works by the Free Software Foundation; thus it carries copyright dates from 1988 through 1993. Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if defined (__GNUC__) # define alloca __builtin_alloca #else /* !__GNUC__ */ # if defined (_AIX) #pragma alloca # else /* !_AIX */ # if defined (HAVE_ALLOCA_H) # include # endif /* HAVE_ALLOCA_H */ # endif /* !AIX */ #endif /* !__GNUC__ */ #include "tilde.h" #include #if !defined (savestring) #define savestring(x) (char *)strcpy (xmalloc (1 + strlen (x)), (x)) #endif /* !savestring */ #if !defined (NULL) # define NULL 0x0 #endif #if defined (TEST) || defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* TEST || STATIC_MALLOC */ /* The default value of tilde_additional_prefixes. This is set to whitespace preceding a tilde so that simple programs which do not perform any word separation get desired behaviour. */ static char *default_prefixes[] = { " ~", "\t~", (char *)NULL }; /* The default value of tilde_additional_suffixes. This is set to whitespace or newline so that simple programs which do not perform any word separation get desired behaviour. */ static char *default_suffixes[] = { " ", "\n", (char *)NULL }; /* If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text (sans tilde, as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. */ Function *tilde_expansion_failure_hook = (Function *)NULL; /* When non-null, this is a NULL terminated array of strings which are duplicates for a tilde prefix. Bash uses this to expand `=~' and `:~'. */ char **tilde_additional_prefixes = default_prefixes; /* When non-null, this is a NULL terminated array of strings which match the end of a username, instead of just "/". Bash sets this to `:' and `=~'. */ char **tilde_additional_suffixes = default_suffixes; /* Find the start of a tilde expansion in STRING, and return the index of the tilde which starts the expansion. Place the length of the text which identified this tilde starter in LEN, excluding the tilde itself. */ static int tilde_find_prefix (string, len) char *string; int *len; { register int i, j, string_len; register char **prefixes = tilde_additional_prefixes; string_len = strlen (string); *len = 0; if (!*string || *string == '~') return (0); if (prefixes) { for (i = 0; i < string_len; i++) { for (j = 0; prefixes[j]; j++) { if (strncmp (string + i, prefixes[j], strlen (prefixes[j])) == 0) { *len = strlen (prefixes[j]) - 1; return (i + *len); } } } } return (string_len); } /* Find the end of a tilde expansion in STRING, and return the index of the character which ends the tilde definition. */ static int tilde_find_suffix (string) char *string; { register int i, j, string_len; register char **suffixes = tilde_additional_suffixes; string_len = strlen (string); for (i = 0; i < string_len; i++) { if (string[i] == '/' || !string[i]) break; for (j = 0; suffixes && suffixes[j]; j++) { if (strncmp (string + i, suffixes[j], strlen (suffixes[j])) == 0) return (i); } } return (i); } /* Return a new string which is the result of tilde expanding STRING. */ char * tilde_expand (string) char *string; { char *result, *tilde_expand_word (); int result_size, result_index; result_size = result_index = 0; result = (char *)NULL; /* Scan through STRING expanding tildes as we come to them. */ while (1) { register int start, end; char *tilde_word, *expansion; int len; /* Make START point to the tilde which starts the expansion. */ start = tilde_find_prefix (string, &len); /* Copy the skipped text into the result. */ if ((result_index + start + 1) > result_size) result = (char *)xrealloc (result, 1 + (result_size += (start + 20))); strncpy (result + result_index, string, start); result_index += start; /* Advance STRING to the starting tilde. */ string += start; /* Make END be the index of one after the last character of the username. */ end = tilde_find_suffix (string); /* If both START and END are zero, we are all done. */ if (!start && !end) break; /* Expand the entire tilde word, and copy it into RESULT. */ tilde_word = (char *)xmalloc (1 + end); strncpy (tilde_word, string, end); tilde_word[end] = '\0'; string += end; expansion = tilde_expand_word (tilde_word); free (tilde_word); len = strlen (expansion); if ((result_index + len + 1) > result_size) result = (char *)xrealloc (result, 1 + (result_size += (len + 20))); strcpy (result + result_index, expansion); result_index += len; free (expansion); } result[result_index] = '\0'; return (result); } /* Do the work of tilde expansion on FILENAME. FILENAME starts with a tilde. If there is no expansion, call tilde_expansion_failure_hook. */ char * tilde_expand_word (filename) char *filename; { char *dirname; dirname = filename ? savestring (filename) : (char *)NULL; if (dirname && *dirname == '~') { char *temp_name; if (!dirname[1] || dirname[1] == '/') { /* Prepend $HOME to the rest of the string. */ char *temp_home = (char *)getenv ("HOME"); /* If there is no HOME variable, look up the directory in the password database. */ if (!temp_home) { extern struct passwd *getpwuid (); struct passwd *entry; entry = getpwuid (getuid ()); if (entry) temp_home = entry->pw_dir; } temp_name = (char *)alloca (1 + strlen (&dirname[1]) + (temp_home ? strlen (temp_home) : 0)); temp_name[0] = '\0'; if (temp_home) strcpy (temp_name, temp_home); strcat (temp_name, &dirname[1]); free (dirname); dirname = savestring (temp_name); } else { struct passwd *getpwnam (), *user_entry; char *username = (char *)alloca (257); int i, c; for (i = 1; c = dirname[i]; i++) { if (c == '/') break; else username[i - 1] = c; } username[i - 1] = '\0'; if (!(user_entry = getpwnam (username))) { /* If the calling program has a special syntax for expanding tildes, and we couldn't find a standard expansion, then let them try. */ if (tilde_expansion_failure_hook) { char *expansion; expansion = (char *)(*tilde_expansion_failure_hook) (username); if (expansion) { temp_name = (char *)alloca (1 + strlen (expansion) + strlen (&dirname[i])); strcpy (temp_name, expansion); strcat (temp_name, &dirname[i]); free (expansion); goto return_name; } } /* We shouldn't report errors. */ } else { temp_name = (char *)alloca (1 + strlen (user_entry->pw_dir) + strlen (&dirname[i])); strcpy (temp_name, user_entry->pw_dir); strcat (temp_name, &dirname[i]); return_name: free (dirname); dirname = savestring (temp_name); } endpwent (); } } return (dirname); } #if defined (TEST) #undef NULL #include main (argc, argv) int argc; char **argv; { char *result, line[512]; int done = 0; while (!done) { printf ("~expand: "); fflush (stdout); if (!gets (line)) strcpy (line, "done"); if ((strcmp (line, "done") == 0) || (strcmp (line, "quit") == 0) || (strcmp (line, "exit") == 0)) { done = 1; break; } result = tilde_expand (line); printf (" --> %s\n", result); free (result); } exit (0); } static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } /* * Local variables: * compile-command: "gcc -g -DTEST -o tilde tilde.c" * end: */ #endif /* TEST */ octave-1.1.0/info/window.c100666 415 17 115615 5336022765 13626 0ustar jweusers/* window.c -- Windows in Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include #include #include #include "nodes.h" #include "window.h" #include "display.h" #include "info-utils.h" #include "infomap.h" /* The window which describes the screen. */ WINDOW *the_screen = (WINDOW *)NULL; /* The window which describes the echo area. */ WINDOW *the_echo_area = (WINDOW *)NULL; /* The list of windows in Info. */ WINDOW *windows = (WINDOW *)NULL; /* Pointer to the active window in WINDOW_LIST. */ WINDOW *active_window = (WINDOW *)NULL; /* The size of the echo area in Info. It never changes, irregardless of the size of the screen. */ #define ECHO_AREA_HEIGHT 1 /* Macro returns the amount of space that the echo area truly requires relative to the entire screen. */ #define echo_area_required (1 + the_echo_area->height) /* Initalize the window system by creating THE_SCREEN and THE_ECHO_AREA. Create the first window ever. You pass the dimensions of the total screen size. */ void window_initialize_windows (width, height) int width, height; { the_screen = (WINDOW *)xmalloc (sizeof (WINDOW)); the_echo_area = (WINDOW *)xmalloc (sizeof (WINDOW)); windows = (WINDOW *)xmalloc (sizeof (WINDOW)); active_window = windows; zero_mem (the_screen, sizeof (WINDOW)); zero_mem (the_echo_area, sizeof (WINDOW)); zero_mem (active_window, sizeof (WINDOW)); /* None of these windows has a goal column yet. */ the_echo_area->goal_column = -1; active_window->goal_column = -1; the_screen->goal_column = -1; /* The active and echo_area windows are visible. The echo_area is permanent. The screen is permanent. */ active_window->flags = W_WindowVisible; the_echo_area->flags = W_WindowIsPerm | W_InhibitMode | W_WindowVisible; the_screen->flags = W_WindowIsPerm; /* The height of the echo area never changes. It is statically set right here, and it must be at least 1 line for display. The size of the initial window cannot be the same size as the screen, since the screen includes the echo area. So, we make the height of the initial window equal to the screen's displayable region minus the height of the echo area. */ the_echo_area->height = ECHO_AREA_HEIGHT; active_window->height = the_screen->height - 1 - the_echo_area->height; window_new_screen_size (width, height, (VFunction *)NULL); /* The echo area uses a different keymap than normal info windows. */ the_echo_area->keymap = echo_area_keymap; active_window->keymap = info_keymap; } /* Given that the size of the screen has changed to WIDTH and HEIGHT from whatever it was before (found in the_screen->height, ->width), change the size (and possibly location) of each window in the screen. If a window would become too small, call the function DELETER on it, after deleting the window from our chain of windows. If DELETER is NULL, nothing extra is done. The last window can never be deleted, but it can become invisible. */ /* If non-null, a function to call with WINDOW as argument when the function window_new_screen_size () has deleted WINDOW. */ VFunction *window_deletion_notifier = (VFunction *)NULL; void window_new_screen_size (width, height) int width, height; { register WINDOW *win; int delta_height, delta_each, delta_leftover; int numwins; /* If no change, do nothing. */ if (width == the_screen->width && height == the_screen->height) return; /* If the new window height is too small, make it be zero. */ if (height < (WINDOW_MIN_SIZE + the_echo_area->height)) height = 0; if (width < 0) width = 0; /* Find out how many windows will change. */ for (numwins = 0, win = windows; win; win = win->next, numwins++); /* See if some windows will need to be deleted. This is the case if the screen is getting smaller, and the available space divided by the number of windows is less than WINDOW_MIN_SIZE. In that case, delete some windows and try again until there is either enough space to divy up among the windows, or until there is only one window left. */ while ((height - echo_area_required) / numwins <= WINDOW_MIN_SIZE) { /* If only one window, make the size of it be zero, and return immediately. */ if (!windows->next) { windows->height = 0; maybe_free (windows->line_starts); windows->line_starts = (char **)NULL; windows->line_count = 0; break; } /* If we have some temporary windows, delete one of them. */ for (win = windows; win; win = win->next) if (win->flags & W_TempWindow) break; /* Otherwise, delete the first window, and try again. */ if (!win) win = windows; if (window_deletion_notifier) (*window_deletion_notifier) (win); window_delete_window (win); numwins--; } /* The screen has changed height and width. */ delta_height = height - the_screen->height; /* This is how much. */ the_screen->height = height; /* This is the new height. */ the_screen->width = width; /* This is the new width. */ /* Set the start of the echo area. */ the_echo_area->first_row = height - the_echo_area->height; the_echo_area->width = width; /* Check to see if the screen can really be changed this way. */ if ((!windows->next) && ((windows->height == 0) && (delta_height < 0))) return; /* Divide the change in height among the available windows. */ delta_each = delta_height / numwins; delta_leftover = delta_height - (delta_each * numwins); /* Change the height of each window in the chain by delta_each. Change the height of the last window in the chain by delta_each and by the leftover amount of change. Change the width of each window to be WIDTH. */ for (win = windows; win; win = win->next) { if ((win->width != width) && ((win->flags & W_InhibitMode) == 0)) { win->width = width; maybe_free (win->modeline); win->modeline = (char *)xmalloc (1 + width); } win->height += delta_each; /* If the previous height of this window was zero, it was the only window, and it was not visible. Thus we need to compensate for the echo_area. */ if (win->height == delta_each) win->height -= (1 + the_echo_area->height); /* If this is not the first window in the chain, then change the first row of it. We cannot just add delta_each to the first row, since this window's first row is the sum of the collective increases that have gone before it. So we just add one to the location of the previous window's modeline. */ if (win->prev) win->first_row = (win->prev->first_row + win->prev->height) + 1; /* The last window in the chain gets the extra space (or shrinkage). */ if (!win->next) win->height += delta_leftover; if (win->node) recalculate_line_starts (win); win->flags |= W_UpdateWindow; } /* If the screen got smaller, check over the windows just shrunk to keep them within bounds. Some of the windows may have gotten smaller than WINDOW_MIN_HEIGHT in which case some of the other windows are larger than the available display space in the screen. Because of our intial test above, we know that there is enough space for all of the windows. */ if ((delta_each < 0) && ((windows->height != 0) && windows->next)) { int avail; avail = the_screen->height - (numwins + the_echo_area->height); win = windows; while (win) { if ((win->height < WINDOW_MIN_HEIGHT) || (win->height > avail)) { WINDOW *lastwin; /* Split the space among the available windows. */ delta_each = avail / numwins; delta_leftover = avail - (delta_each * numwins); for (win = windows; win; win = win->next) { lastwin = win; if (win->prev) win->first_row = (win->prev->first_row + win->prev->height) + 1; win->height = delta_each; } /* Give the leftover space (if any) to the last window. */ lastwin->height += delta_leftover; break; } else win= win->next; } } } /* Make a new window showing NODE, and return that window structure. If NODE is passed as NULL, then show the node showing in the active window. If the window could not be made return a NULL pointer. The active window is not changed.*/ WINDOW * window_make_window (node) NODE *node; { WINDOW *window; if (!node) node = active_window->node; /* If there isn't enough room to make another window, return now. */ if ((active_window->height / 2) < WINDOW_MIN_SIZE) return ((WINDOW *)NULL); /* Make and initialize the new window. The fudging about with -1 and +1 is because the following window in the chain cannot start at window->height, since that is where the modeline for the previous window is displayed. The inverse adjustment is made in window_delete_window (). */ window = (WINDOW *)xmalloc (sizeof (WINDOW)); window->width = the_screen->width; window->height = (active_window->height / 2) - 1; #if defined (SPLIT_BEFORE_ACTIVE) window->first_row = active_window->first_row; #else window->first_row = active_window->first_row + (active_window->height - window->height); #endif window->keymap = info_keymap; window->goal_column = -1; window->modeline = (char *)xmalloc (1 + window->width); window->line_starts = (char **)NULL; window->flags = W_UpdateWindow | W_WindowVisible; window_set_node_of_window (window, node); /* Adjust the height of the old active window. */ active_window->height -= (window->height + 1); #if defined (SPLIT_BEFORE_ACTIVE) active_window->first_row += (window->height + 1); #endif active_window->flags |= W_UpdateWindow; /* Readjust the new and old windows so that their modelines and contents will be displayed correctly. */ #if defined (NOTDEF) /* We don't have to do this for WINDOW since window_set_node_of_window () already did. */ window_adjust_pagetop (window); window_make_modeline (window); #endif /* NOTDEF */ /* We do have to readjust the existing active window. */ window_adjust_pagetop (active_window); window_make_modeline (active_window); #if defined (SPLIT_BEFORE_ACTIVE) /* This window is just before the active one. The active window gets bumped down one. The active window is not changed. */ window->next = active_window; window->prev = active_window->prev; active_window->prev = window; if (window->prev) window->prev->next = window; else windows = window; #else /* This window is just after the active one. Which window is active is not changed. */ window->prev = active_window; window->next = active_window->next; active_window->next = window; if (window->next) window->next->prev = window; #endif /* !SPLIT_BEFORE_ACTIVE */ return (window); } /* These useful macros make it possible to read the code in window_change_window_height (). */ #define grow_me_shrinking_next(me, next, diff) \ do { \ me->height += diff; \ next->height -= diff; \ next->first_row += diff; \ window_adjust_pagetop (next); \ } while (0) #define grow_me_shrinking_prev(me, prev, diff) \ do { \ me->height += diff; \ prev->height -= diff; \ me->first_row -=diff; \ window_adjust_pagetop (prev); \ } while (0) #define shrink_me_growing_next(me, next, diff) \ do { \ me->height -= diff; \ next->height += diff; \ next->first_row -= diff; \ window_adjust_pagetop (next); \ } while (0) #define shrink_me_growing_prev(me, prev, diff) \ do { \ me->height -= diff; \ prev->height += diff; \ me->first_row += diff; \ window_adjust_pagetop (prev); \ } while (0) /* Change the height of WINDOW by AMOUNT. This also automagically adjusts the previous and next windows in the chain. If there is only one user window, then no change takes place. */ void window_change_window_height (window, amount) WINDOW *window; int amount; { register WINDOW *win, *prev, *next; /* If there is only one window, or if the amount of change is zero, return immediately. */ if (!windows->next || amount == 0) return; /* Find this window in our chain. */ for (win = windows; win; win = win->next) if (win == window) break; /* If the window is isolated (i.e., doesn't appear in our window list, then quit now. */ if (!win) return; /* Change the height of this window by AMOUNT, if that is possible. It can be impossible if there isn't enough available room on the screen, or if the resultant window would be too small. */ prev = window->prev; next = window->next; /* WINDOW decreasing in size? */ if (amount < 0) { int abs_amount = -amount; /* It is easier to deal with this way. */ /* If the resultant window would be too small, stop here. */ if ((window->height - abs_amount) < WINDOW_MIN_HEIGHT) return; /* If we have two neighboring windows, choose the smaller one to get larger. */ if (next && prev) { if (prev->height < next->height) shrink_me_growing_prev (window, prev, abs_amount); else shrink_me_growing_next (window, next, abs_amount); } else if (next) shrink_me_growing_next (window, next, abs_amount); else shrink_me_growing_prev (window, prev, abs_amount); } /* WINDOW increasing in size? */ if (amount > 0) { int total_avail, next_avail = 0, prev_avail = 0; if (next) next_avail = next->height - WINDOW_MIN_SIZE; if (prev) prev_avail = prev->height - WINDOW_MIN_SIZE; total_avail = next_avail + prev_avail; /* If there isn't enough space available to grow this window, give up. */ if (amount > total_avail) return; /* If there aren't two neighboring windows, or if one of the neighbors is larger than the other one by at least AMOUNT, grow that one. */ if ((next && !prev) || ((next_avail - amount) >= prev_avail)) grow_me_shrinking_next (window, next, amount); else if ((prev && !next) || ((prev_avail - amount) >= next_avail)) grow_me_shrinking_prev (window, prev, amount); else { int change; /* This window has two neighbors. They both must be shrunk in to make enough space for WINDOW to grow. Make them both the same size. */ if (prev_avail > next_avail) { change = prev_avail - next_avail; grow_me_shrinking_prev (window, prev, change); amount -= change; } else { change = next_avail - prev_avail; grow_me_shrinking_next (window, next, change); amount -= change; } /* Both neighbors are the same size. Split the difference in AMOUNT between them. */ while (amount) { window->height++; amount--; /* Odd numbers grow next, even grow prev. */ if (amount & 1) { prev->height--; window->first_row--; } else { next->height--; next->first_row++; } } window_adjust_pagetop (prev); window_adjust_pagetop (next); } } if (prev) prev->flags |= W_UpdateWindow; if (next) next->flags |= W_UpdateWindow; window->flags |= W_UpdateWindow; window_adjust_pagetop (window); } /* Tile all of the windows currently displayed in the global variable WINDOWS. If argument STYLE is TILE_INTERNALS, tile windows displaying internal nodes as well, otherwise do not change the height of such windows. */ void window_tile_windows (style) int style; { WINDOW *win, *last_adjusted; int numwins, avail, per_win_height, leftover; int do_internals; numwins = avail = 0; do_internals = (style == TILE_INTERNALS); for (win = windows; win; win = win->next) if (do_internals || !win->node || (win->node->flags & N_IsInternal) == 0) { avail += win->height; numwins++; } if (numwins <= 1 || !the_screen->height) return; /* Find the size for each window. Divide the size of the usable portion of the screen by the number of windows. */ per_win_height = avail / numwins; leftover = avail - (per_win_height * numwins); last_adjusted = (WINDOW *)NULL; for (win = windows; win; win = win->next) { if (do_internals || !win->node || (win->node->flags & N_IsInternal) == 0) { last_adjusted = win; win->height = per_win_height; } } if (last_adjusted) last_adjusted->height += leftover; /* Readjust the first_row of every window in the chain. */ for (win = windows; win; win = win->next) { if (win->prev) win->first_row = win->prev->first_row + win->prev->height + 1; window_adjust_pagetop (win); win->flags |= W_UpdateWindow; } } /* Toggle the state of line wrapping in WINDOW. This can do a bit of fancy redisplay. */ void window_toggle_wrap (window) WINDOW *window; { if (window->flags & W_NoWrap) window->flags &= ~W_NoWrap; else window->flags |= W_NoWrap; if (window != the_echo_area) { char **old_starts; int old_lines, old_pagetop; old_starts = window->line_starts; old_lines = window->line_count; old_pagetop = window->pagetop; calculate_line_starts (window); /* Make sure that point appears within this window. */ window_adjust_pagetop (window); /* If the pagetop hasn't changed maybe we can do some scrolling now to speed up the display. Many of the line starts will be the same, so scrolling here is a very good optimization.*/ if (old_pagetop == window->pagetop) display_scroll_line_starts (window, old_pagetop, old_starts, old_lines); maybe_free (old_starts); } window->flags |= W_UpdateWindow; } /* Set WINDOW to display NODE. */ void window_set_node_of_window (window, node) WINDOW *window; NODE *node; { window->node = node; window->pagetop = 0; window->point = 0; recalculate_line_starts (window); window->flags |= W_UpdateWindow; window_adjust_pagetop (window); window_make_modeline (window); } /* Delete WINDOW from the list of known windows. If this window was the active window, make the next window in the chain be the active window. If the active window is the next or previous window, choose that window as the recipient of the extra space. Otherwise, prefer the next window. */ void window_delete_window (window) WINDOW *window; { WINDOW *next, *prev, *window_to_fix; next = window->next; prev = window->prev; /* You cannot delete the only window or a permanent window. */ if ((!next && !prev) || (window->flags & W_WindowIsPerm)) return; if (next) next->prev = prev; if (!prev) windows = next; else prev->next = next; if (window->line_starts) free (window->line_starts); if (window->modeline) free (window->modeline); if (window == active_window) { /* If there isn't a next window, then there must be a previous one, since we cannot delete the last window. If there is a next window, prefer to use that as the active window. */ if (next) active_window = next; else active_window = prev; } if (next && active_window == next) window_to_fix = next; else if (prev && active_window == prev) window_to_fix = prev; else if (next) window_to_fix = next; else if (prev) window_to_fix = prev; else window_to_fix = windows; if (window_to_fix->first_row > window->first_row) { int diff; /* Try to adjust the visible part of the node so that as little text as possible has to move. */ diff = window_to_fix->first_row - window->first_row; window_to_fix->first_row = window->first_row; window_to_fix->pagetop -= diff; if (window_to_fix->pagetop < 0) window_to_fix->pagetop = 0; } /* The `+ 1' is to offset the difference between the first_row locations. See the code in window_make_window (). */ window_to_fix->height += window->height + 1; window_to_fix->flags |= W_UpdateWindow; free (window); } /* For every window in CHAIN, set the flags member to have FLAG set. */ void window_mark_chain (chain, flag) WINDOW *chain; int flag; { register WINDOW *win; for (win = chain; win; win = win->next) win->flags |= flag; } /* For every window in CHAIN, clear the flags member of FLAG. */ void window_unmark_chain (chain, flag) WINDOW *chain; int flag; { register WINDOW *win; for (win = chain; win; win = win->next) win->flags &= ~flag; } /* Return the number of characters it takes to display CHARACTER on the screen at HPOS. */ int character_width (character, hpos) int character, hpos; { int printable_limit = 127; int width = 1; if (ISO_Latin_p) printable_limit = 160; if (character > printable_limit) width = 3; else if (iscntrl (character)) { switch (character) { case '\r': case '\n': width = the_screen->width - hpos; break; case '\t': width = ((hpos + 8) & 0xf8) - hpos; break; default: width = 2; } } else if (character == DEL) width = 2; return (width); } /* Return the number of characters it takes to display STRING on the screen at HPOS. */ int string_width (string, hpos) char *string; int hpos; { register int i, width, this_char_width; for (width = 0, i = 0; string[i]; i++) { this_char_width = character_width (string[i], hpos); width += this_char_width; hpos += this_char_width; } return (width); } /* Quickly guess the approximate number of lines to that NODE would take to display. This really only counts carriage returns. */ int window_physical_lines (node) NODE *node; { register int i, lines; char *contents; if (!node) return (0); contents = node->contents; for (i = 0, lines = 1; i < node->nodelen; i++) if (contents[i] == '\n') lines++; return (lines); } /* Calculate a list of line starts for the node belonging to WINDOW. The line starts are pointers to the actual text within WINDOW->NODE. */ void calculate_line_starts (window) WINDOW *window; { register int i, hpos; char **line_starts = (char **)NULL; int line_starts_index = 0, line_starts_slots = 0; int bump_index; NODE *node; window->line_starts = (char **)NULL; window->line_count = 0; node = window->node; if (!node) return; /* Grovel the node starting at the top, and for each line calculate the width of the characters appearing in that line. Add each line start to our array. */ i = 0; hpos = 0; bump_index = 0; while (i < node->nodelen) { char *line = node->contents + i; unsigned int cwidth, c; add_pointer_to_array (line, line_starts_index, line_starts, line_starts_slots, 100, char *); if (bump_index) { i++; bump_index = 0; } while (1) { c = node->contents[i]; cwidth = character_width (c, hpos); /* If this character fits within this line, just do the next one. */ if ((hpos + cwidth) < window->width) { i++; hpos += cwidth; continue; } else { /* If this character would position the cursor at the start of the next printed screen line, then do the next line. */ if (c == '\n' || c == '\r' || c == '\t') { i++; hpos = 0; break; } else { /* This character passes the window width border. Postion the cursor after the printed character, but remember this line start as where this character is. A bit tricky. */ /* If this window doesn't wrap lines, proceed to the next physical line here. */ if (window->flags & W_NoWrap) { hpos = 0; while (i < node->nodelen && node->contents[i] != '\n') i++; if (node->contents[i] == '\n') i++; } else { hpos = the_screen->width - hpos; bump_index++; } break; } } } } window->line_starts = line_starts; window->line_count = line_starts_index; } /* Given WINDOW, recalculate the line starts for the node it displays. */ void recalculate_line_starts (window) WINDOW *window; { maybe_free (window->line_starts); calculate_line_starts (window); } /* Global variable control redisplay of scrolled windows. If non-zero, it is the desired number of lines to scroll the window in order to make point visible. A user might set this to 1 for smooth scrolling. If set to zero, the line containing point is centered within the window. */ int window_scroll_step = 0; /* Adjust the pagetop of WINDOW such that the cursor point will be visible. */ void window_adjust_pagetop (window) WINDOW *window; { register int line = 0; char *contents; if (!window->node) return; contents = window->node->contents; /* Find the first printed line start which is after WINDOW->point. */ for (line = 0; line < window->line_count; line++) { char *line_start; line_start = window->line_starts[line]; if ((line_start - contents) > window->point) break; } /* The line index preceding the line start which is past point is the one containing point. */ line--; /* If this line appears in the current displayable page, do nothing. Otherwise, adjust the top of the page to make this line visible. */ if ((line < window->pagetop) || (line - window->pagetop > (window->height - 1))) { /* The user-settable variable "scroll-step" is used to attempt to make point visible, iff it is non-zero. If that variable is zero, then the line containing point is centered within the window. */ if (window_scroll_step < window->height) { if ((line < window->pagetop) && ((window->pagetop - window_scroll_step) <= line)) window->pagetop -= window_scroll_step; else if ((line - window->pagetop > (window->height - 1)) && ((line - (window->pagetop + window_scroll_step) < window->height))) window->pagetop += window_scroll_step; else window->pagetop = line - ((window->height - 1) / 2); } else window->pagetop = line - ((window->height - 1) / 2); if (window->pagetop < 0) window->pagetop = 0; window->flags |= W_UpdateWindow; } } /* Return the index of the line containing point. */ int window_line_of_point (window) WINDOW *window; { register int i, start = 0; /* Try to optimize. Check to see if point is past the pagetop for this window, and if so, start searching forward from there. */ if ((window->pagetop > -1 && window->pagetop < window->line_count) && (window->line_starts[window->pagetop] - window->node->contents) <= window->point) start = window->pagetop; for (i = start; i < window->line_count; i++) { if ((window->line_starts[i] - window->node->contents) > window->point) break; } return (i - 1); } /* Get and return the goal column for this window. */ int window_get_goal_column (window) WINDOW *window; { if (!window->node) return (-1); if (window->goal_column != -1) return (window->goal_column); /* Okay, do the work. Find the printed offset of the cursor in this window. */ return (window_get_cursor_column (window)); } /* Get and return the printed column offset of the cursor in this window. */ int window_get_cursor_column (window) WINDOW *window; { int i, hpos, end; char *line; i = window_line_of_point (window); if (i < 0) return (-1); line = window->line_starts[i]; end = window->point - (line - window->node->contents); for (hpos = 0, i = 0; i < end; i++) hpos += character_width (line[i], hpos); return (hpos); } /* Count the number of characters in LINE that precede the printed column offset of GOAL. */ int window_chars_to_goal (line, goal) char *line; int goal; { register int i, check, hpos; for (hpos = 0, i = 0; line[i] != '\n'; i++) { check = hpos + character_width (line[i], hpos); if (check > goal) break; hpos = check; } return (i); } /* Create a modeline for WINDOW, and store it in window->modeline. */ void window_make_modeline (window) WINDOW *window; { register int i; char *modeline; char location_indicator[4]; int lines_remaining; /* Only make modelines for those windows which have one. */ if (window->flags & W_InhibitMode) return; /* Find the number of lines actually displayed in this window. */ lines_remaining = window->line_count - window->pagetop; if (window->pagetop == 0) { if (lines_remaining <= window->height) strcpy (location_indicator, "All"); else strcpy (location_indicator, "Top"); } else { if (lines_remaining <= window->height) strcpy (location_indicator, "Bot"); else { float pt, lc; int percentage; pt = (float)window->pagetop; lc = (float)window->line_count; percentage = 100 * (pt / lc); sprintf (location_indicator, "%2d%%", percentage); } } /* Calculate the maximum size of the information to stick in MODELINE. */ { int modeline_len = 0; char *parent = (char *)NULL, *filename = "*no file*"; char *nodename = "*no node*"; char *update_message = (char *)NULL; NODE *node = window->node; if (node) { if (node->nodename) nodename = node->nodename; if (node->parent) { parent = filename_non_directory (node->parent); modeline_len += strlen ("Subfile: ") + strlen (node->filename); } if (node->filename) filename = filename_non_directory (node->filename); if (node->flags & N_UpdateTags) update_message = "--*** Tags out of Date ***"; } if (update_message) modeline_len += strlen (update_message); modeline_len += strlen (filename); modeline_len += strlen (nodename); modeline_len += 4; /* strlen (location_indicator). */ /* 10 for the decimal representation of the number of lines in this node, and the remainder of the text that can appear in the line. */ modeline_len += 10 + strlen ("-----Info: (), lines ----, "); modeline_len += window->width; modeline = (char *)xmalloc (1 + modeline_len); /* Special internal windows have no filename. */ if (!parent && !*filename) sprintf (modeline, "-%s---Info: %s, %d lines --%s--", (window->flags & W_NoWrap) ? "$" : "-", nodename, window->line_count, location_indicator); else sprintf (modeline, "-%s%s-Info: (%s)%s, %d lines --%s--", (window->flags & W_NoWrap) ? "$" : "-", (node && (node->flags & N_IsCompressed)) ? "zz" : "--", parent ? parent : filename, nodename, window->line_count, location_indicator); if (parent) sprintf (modeline + strlen (modeline), " Subfile: %s", filename); if (update_message) sprintf (modeline + strlen (modeline), "%s", update_message); i = strlen (modeline); if (i >= window->width) modeline[window->width] = '\0'; else { while (i < window->width) modeline[i++] = '-'; modeline[i] = '\0'; } strcpy (window->modeline, modeline); free (modeline); } } /* Make WINDOW start displaying at PERCENT percentage of its node. */ void window_goto_percentage (window, percent) WINDOW *window; int percent; { int desired_line; if (!percent) desired_line = 0; else desired_line = (int) ((float)window->line_count * ((float)percent / 100.0)); window->pagetop = desired_line; window->point = window->line_starts[window->pagetop] - window->node->contents; window->flags |= W_UpdateWindow; window_make_modeline (window); } /* Get the state of WINDOW, and save it in STATE. */ void window_get_state (window, state) WINDOW *window; WINDOW_STATE *state; { state->node = window->node; state->pagetop = window->pagetop; state->point = window->point; } /* Set the node, pagetop, and point of WINDOW. */ void window_set_state (window, state) WINDOW *window; WINDOW_STATE *state; { if (window->node != state->node) window_set_node_of_window (window, state->node); window->pagetop = state->pagetop; window->point = state->point; } /* **************************************************************** */ /* */ /* Manipulating Home-Made Nodes */ /* */ /* **************************************************************** */ /* A place to buffer echo area messages. */ static NODE *echo_area_node = (NODE *)NULL; /* Make the node of the_echo_area be an empty one. */ static void free_echo_area () { if (echo_area_node) { maybe_free (echo_area_node->contents); free (echo_area_node); } echo_area_node = (NODE *)NULL; window_set_node_of_window (the_echo_area, echo_area_node); } /* Clear the echo area, removing any message that is already present. The echo area is cleared immediately. */ void window_clear_echo_area () { free_echo_area (); display_update_one_window (the_echo_area); } /* Make a message appear in the echo area, built from FORMAT, ARG1 and ARG2. The arguments are treated similar to printf () arguments, but not all of printf () hair is present. The message appears immediately. If there was already a message appearing in the echo area, it is removed. */ void window_message_in_echo_area (format, arg1, arg2) char *format; void *arg1, *arg2; { free_echo_area (); echo_area_node = build_message_node (format, arg1, arg2); window_set_node_of_window (the_echo_area, echo_area_node); display_update_one_window (the_echo_area); } /* Place a temporary message in the echo area built from FORMAT, ARG1 and ARG2. The message appears immediately, but does not destroy any existing message. A future call to unmessage_in_echo_area () restores the old contents. */ static NODE **old_echo_area_nodes = (NODE **)NULL; static int old_echo_area_nodes_index = 0; static int old_echo_area_nodes_slots = 0; void message_in_echo_area (format, arg1, arg2) char *format; void *arg1, *arg2; { if (echo_area_node) { add_pointer_to_array (echo_area_node, old_echo_area_nodes_index, old_echo_area_nodes, old_echo_area_nodes_slots, 4, NODE *); } echo_area_node = (NODE *)NULL; window_message_in_echo_area (format, arg1, arg2); } void unmessage_in_echo_area () { free_echo_area (); if (old_echo_area_nodes_index) echo_area_node = old_echo_area_nodes[--old_echo_area_nodes_index]; window_set_node_of_window (the_echo_area, echo_area_node); display_update_one_window (the_echo_area); } /* A place to build a message. */ static char *message_buffer = (char *)NULL; static int message_buffer_index = 0; static int message_buffer_size = 0; /* Ensure that there is enough space to stuff LENGTH characters into MESSAGE_BUFFER. */ static void message_buffer_resize (length) int length; { if (!message_buffer) { message_buffer_size = length + 1; message_buffer = (char *)xmalloc (message_buffer_size); message_buffer_index = 0; } while (message_buffer_size <= message_buffer_index + length) message_buffer = (char *) xrealloc (message_buffer, message_buffer_size += 100 + (2 * length)); } /* Format MESSAGE_BUFFER with the results of printing FORMAT with ARG1 and ARG2. */ static void build_message_buffer (format, arg1, arg2) char *format; void *arg1, *arg2; { register int i, len; void *args[2]; int arg_index = 0; args[0] = arg1; args[1] = arg2; len = strlen (format); message_buffer_resize (len); for (i = 0; format[i]; i++) { if (format[i] != '%') { message_buffer[message_buffer_index++] = format[i]; len--; } else { char c; c = format[++i]; switch (c) { case '%': /* Insert a percent sign. */ message_buffer_resize (len + 1); message_buffer[message_buffer_index++] = '%'; break; case 's': /* Insert the current arg as a string. */ { char *string; int string_len; string = (char *)args[arg_index++]; string_len = strlen (string); message_buffer_resize (len + string_len); sprintf (message_buffer + message_buffer_index, "%s", string); message_buffer_index += string_len; } break; case 'd': /* Insert the current arg as an integer. */ { int integer; integer = (int)args[arg_index++]; message_buffer_resize (len + 32); sprintf (message_buffer + message_buffer_index, "%d", integer); message_buffer_index = strlen (message_buffer); } break; case 'c': /* Insert the current arg as a character. */ { int character; character = (int)args[arg_index++]; message_buffer_resize (len + 1); message_buffer[message_buffer_index++] = character; } break; default: abort (); } } } message_buffer[message_buffer_index] = '\0'; } /* Build a new node which has FORMAT printed with ARG1 and ARG2 as the contents. */ NODE * build_message_node (format, arg1, arg2) char *format; void *arg1, *arg2; { NODE *node; message_buffer_index = 0; build_message_buffer (format, arg1, arg2); node = message_buffer_to_node (); return (node); } /* Convert the contents of the message buffer to a node. */ NODE * message_buffer_to_node () { NODE *node; node = (NODE *)xmalloc (sizeof (NODE)); node->filename = (char *)NULL; node->parent = (char *)NULL; node->nodename = (char *)NULL; node->flags = 0; /* Make sure that this buffer ends with a newline. */ node->nodelen = 1 + strlen (message_buffer); node->contents = (char *)xmalloc (1 + node->nodelen); strcpy (node->contents, message_buffer); node->contents[node->nodelen - 1] = '\n'; node->contents[node->nodelen] = '\0'; return (node); } /* Useful functions can be called from outside of window.c. */ void initialize_message_buffer () { message_buffer_index = 0; } /* Print FORMAT with ARG1,2 to the end of the current message buffer. */ void printf_to_message_buffer (format, arg1, arg2) char *format; void *arg1, *arg2; { build_message_buffer (format, arg1, arg2); } /* Return the current horizontal position of the "cursor" on the most recently output message buffer line. */ int message_buffer_length_this_line () { register int i; if (!message_buffer_index) return (0); for (i = message_buffer_index; i && message_buffer[i - 1] != '\n'; i--); return (string_width (message_buffer + i, 0)); } /* Pad STRING to COUNT characters by inserting blanks. */ int pad_to (count, string) int count; char *string; { register int i; i = strlen (string); if (i >= count) string[i++] = ' '; else { while (i < count) string[i++] = ' '; } string[i] = '\0'; return (i); } octave-1.1.0/info/xmalloc.c100666 415 17 4222 5333267252 13704 0ustar jweusers/* xmalloc.c -- safe versions of malloc and realloc */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. This file has appeared in prior works by the Free Software Foundation; thus it carries copyright dates from 1988 through 1993. Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (ALREADY_HAVE_XMALLOC) #include static void memory_error_and_abort (); /* **************************************************************** */ /* */ /* Memory Allocation and Deallocation. */ /* */ /* **************************************************************** */ /* Return a pointer to free()able block of memory large enough to hold BYTES number of bytes. If the memory cannot be allocated, print an error message and abort. */ void * xmalloc (bytes) int bytes; { void *temp = (void *)malloc (bytes); if (!temp) memory_error_and_abort ("xmalloc"); return (temp); } void * xrealloc (pointer, bytes) void *pointer; int bytes; { void *temp; if (!pointer) temp = (void *)malloc (bytes); else temp = (void *)realloc (pointer, bytes); if (!temp) memory_error_and_abort ("xrealloc"); return (temp); } static void memory_error_and_abort (fname) char *fname; { fprintf (stderr, "%s: Out of virtual memory!\n", fname); abort (); } #endif /* !ALREADY_HAVE_XMALLOC */ octave-1.1.0/info/indices.c100666 415 17 45162 5457127117 13715 0ustar jweusers/* indices.c -- Commands for dealing with an Info file Index. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include "indices.h" /* User-visible variable controls the output of info-index-next. */ int show_index_match = 1; /* In the Info sense, an index is a menu. This variable holds the last parsed index. */ static REFERENCE **index_index = (REFERENCE **)NULL; /* The offset of the most recently selected index element. */ static int index_offset = 0; /* Variable which holds the last string searched for. */ static char *index_search = (char *)NULL; /* A couple of "globals" describing where the initial index was found. */ static char *initial_index_filename = (char *)NULL; static char *initial_index_nodename = (char *)NULL; /* A structure associating index names with index offset ranges. */ typedef struct { char *name; /* The nodename of this index. */ int first; /* The index in our list of the first entry. */ int last; /* The index in our list of the last entry. */ } INDEX_NAME_ASSOC; /* An array associating index nodenames with index offset ranges. */ static INDEX_NAME_ASSOC **index_nodenames = (INDEX_NAME_ASSOC **)NULL; static int index_nodenames_index = 0; static int index_nodenames_slots = 0; /* Add the name of NODE, and the range of the associated index elements (passed in ARRAY) to index_nodenames. */ static void add_index_to_index_nodenames (array, node) REFERENCE **array; NODE *node; { register int i, last; INDEX_NAME_ASSOC *assoc; for (last = 0; array[last]; last++); assoc = (INDEX_NAME_ASSOC *)xmalloc (sizeof (INDEX_NAME_ASSOC)); assoc->name = savestring (node->nodename); if (!index_nodenames_index) { assoc->first = 0; assoc->last = last; } else { for (i = 0; index_nodenames[i + 1]; i++); assoc->first = 1 + index_nodenames[i]->last; assoc->last = assoc->first + last; } add_pointer_to_array (assoc, index_nodenames_index, index_nodenames, index_nodenames_slots, 10, INDEX_NAME_ASSOC *); } /* Find and return the indices of WINDOW's file. The indices are defined as the first node in the file containing the word "Index" and any immediately following nodes whose names also contain "Index". All such indices are concatenated and the result returned. If WINDOW's info file doesn't have any indices, a NULL pointer is returned. */ REFERENCE ** info_indices_of_window (window) WINDOW *window; { FILE_BUFFER *fb; fb = file_buffer_of_window (window); return (info_indices_of_file_buffer (fb)); } REFERENCE ** info_indices_of_file_buffer (file_buffer) FILE_BUFFER *file_buffer; { register int i; REFERENCE **result = (REFERENCE **)NULL; /* No file buffer, no indices. */ if (!file_buffer) return ((REFERENCE **)NULL); /* Reset globals describing where the index was found. */ maybe_free (initial_index_filename); maybe_free (initial_index_nodename); initial_index_filename = (char *)NULL; initial_index_nodename = (char *)NULL; if (index_nodenames) { for (i = 0; index_nodenames[i]; i++) { free (index_nodenames[i]->name); free (index_nodenames[i]); } index_nodenames_index = 0; index_nodenames[0] = (INDEX_NAME_ASSOC *)NULL; } /* Grovel the names of the nodes found in this file. */ if (file_buffer->tags) { TAG *tag; for (i = 0; tag = file_buffer->tags[i]; i++) { if (string_in_line ("Index", tag->nodename) != -1) { NODE *node; REFERENCE **menu; /* Found one. Get its menu. */ node = info_get_node (tag->filename, tag->nodename); if (!node) continue; /* Remember the filename and nodename of this index. */ initial_index_filename = savestring (file_buffer->filename); initial_index_nodename = savestring (tag->nodename); menu = info_menu_of_node (node); /* If we have a menu, add this index's nodename and range to our list of index_nodenames. */ if (menu) { add_index_to_index_nodenames (menu, node); /* Concatenate the references found so far. */ result = info_concatenate_references (result, menu); } free (node); } } } /* If there is a result, clean it up so that every entry has a filename. */ for (i = 0; result && result[i]; i++) if (!result[i]->filename) result[i]->filename = savestring (file_buffer->filename); return (result); } DECLARE_INFO_COMMAND (info_index_search, "Look up a string in the index for this file") { do_info_index_search (window, count, 0); } void do_info_index_search (window, count, search_string) WINDOW *window; int count; char *search_string; { FILE_BUFFER *fb; char *line; /* Reset the index offset, since this is not the info-index-next command. */ index_offset = 0; /* The user is selecting a new search string, so flush the old one. */ maybe_free (index_search); index_search = (char *)NULL; /* If this window's file is not the same as the one that we last built an index for, build and remember an index now. */ fb = file_buffer_of_window (window); if (!initial_index_filename || (strcmp (initial_index_filename, fb->filename) != 0)) { info_free_references (index_index); window_message_in_echo_area ("Finding index entries..."); index_index = info_indices_of_file_buffer (fb); } /* If there is no index, quit now. */ if (!index_index) { info_error ("No indices found."); return; } if (search_string && *search_string) line = savestring (search_string); else { /* Okay, there is an index. Let the user select one of the members of it. */ line = info_read_maybe_completing (window, "Index entry: ", index_index); window = active_window; /* User aborted? */ if (!line) { info_abort_key (active_window, 1, 0); return; } /* Empty line means move to the Index node. */ if (!*line) { free (line); if (initial_index_filename && initial_index_nodename) { NODE *node; node = info_get_node (initial_index_filename, initial_index_nodename); set_remembered_pagetop_and_point (window); window_set_node_of_window (window, node); remember_window_and_node (window, node); window_clear_echo_area (); return; } } } /* The user typed either a completed index label, or a partial string. Find an exact match, or, failing that, the first index entry containing the partial string. So, we just call info_next_index_match () with minor manipulation of INDEX_OFFSET. */ { int old_offset; /* Start the search right after/before this index. */ if (count < 0) { register int i; for (i = 0; index_index[i]; i++); index_offset = i; } else index_offset = -1; old_offset == index_offset; /* The "last" string searched for is this one. */ index_search = line; /* Find it, or error. */ info_next_index_match (window, count, 0); /* If the search failed, return the index offset to where it belongs. */ if (index_offset == old_offset) index_offset = 0; } } int index_entry_exists (window, string) WINDOW *window; char *string; { register int i; FILE_BUFFER *fb; /* If there is no previous search string, the user hasn't built an index yet. */ if (!string) return 0; fb = file_buffer_of_window (window); if (!initial_index_filename || (strcmp (initial_index_filename, fb->filename) != 0)) { info_free_references (index_index); index_index = info_indices_of_file_buffer (fb); } /* If there is no index, that is an error. */ if (!index_index) return 0; for (i = 0; (i > -1) && (index_index[i]); i++) if (strcmp (string, index_index[i]->label) == 0) break; /* If that failed, look for the next substring match. */ if ((i < 0) || (!index_index[i])) { for (i = 0; (i > -1) && (index_index[i]); i++) if (string_in_line (string, index_index[i]->label) != -1) break; if ((i > -1) && (index_index[i])) string_in_line (string, index_index[i]->label); } /* If that failed, return 0. */ if ((i < 0) || (!index_index[i])) return 0; return 1; } DECLARE_INFO_COMMAND (info_next_index_match, "Go to the next matching index item from the last `\\[index-search]' command") { register int i; int partial, dir; NODE *node; /* If there is no previous search string, the user hasn't built an index yet. */ if (!index_search) { info_error ("No previous index search string."); return; } /* If there is no index, that is an error. */ if (!index_index) { info_error ("No index entries."); return; } /* The direction of this search is controlled by the value of the numeric argument. */ if (count < 0) dir = -1; else dir = 1; /* Search for the next occurence of index_search. First try to find an exact match. */ partial = 0; for (i = index_offset + dir; (i > -1) && (index_index[i]); i += dir) if (strcmp (index_search, index_index[i]->label) == 0) break; /* If that failed, look for the next substring match. */ if ((i < 0) || (!index_index[i])) { for (i = index_offset + dir; (i > -1) && (index_index[i]); i += dir) if (string_in_line (index_search, index_index[i]->label) != -1) break; if ((i > -1) && (index_index[i])) partial = string_in_line (index_search, index_index[i]->label); } /* If that failed, print an error. */ if ((i < 0) || (!index_index[i])) { info_error ("No %sindex entries containing \"%s\".", index_offset > 0 ? "more " : "", index_search); return; } /* Okay, we found the next one. Move the offset to the current entry. */ index_offset = i; /* Report to the user on what we have found. */ { register int j; char *name = "CAN'T SEE THIS"; char *match; for (j = 0; index_nodenames[j]; j++) { if ((i >= index_nodenames[j]->first) && (i <= index_nodenames[j]->last)) { name = index_nodenames[j]->name; break; } } /* If we had a partial match, indicate to the user which part of the string matched. */ match = savestring (index_index[i]->label); if (partial && show_index_match) { int j, ls, start, upper; ls = strlen (index_search); start = partial - ls; upper = isupper (match[start]) ? 1 : 0; for (j = 0; j < ls; j++) if (upper) match[j + start] = info_tolower (match[j + start]); else match[j + start] = info_toupper (match[j + start]); } { char *format; format = replace_in_documentation ("Found \"%s\" in %s. (`\\[next-index-match]' tries to find next.)"); window_message_in_echo_area (format, match, name); } free (match); } /* Select the node corresponding to this index entry. */ node = info_get_node (index_index[i]->filename, index_index[i]->nodename); if (!node) { info_error (CANT_FILE_NODE, index_index[i]->filename, index_index[i]->nodename); return; } set_remembered_pagetop_and_point (window); window_set_node_of_window (window, node); remember_window_and_node (window, node); /* Try to find an occurence of LABEL in this node. */ { long start, loc; start = window->line_starts[1] - window->node->contents; loc = info_target_search_node (node, index_index[i]->label, start); if (loc != -1) { window->point = loc; window_adjust_pagetop (window); } } } /* **************************************************************** */ /* */ /* Info APROPOS: Search every known index. */ /* */ /* **************************************************************** */ /* For every menu item in DIR, search the indices of that file for SEARCH_STRING. */ REFERENCE ** apropos_in_all_indices (search_string, inform) char *search_string; int inform; { register int i, dir_index; REFERENCE **all_indices = (REFERENCE **)NULL; REFERENCE **dir_menu = (REFERENCE **)NULL; NODE *dir_node; int printed = 0; dir_node = info_get_node ("dir", "Top"); if (dir_node) dir_menu = info_menu_of_node (dir_node); if (!dir_menu) return; /* For every menu item in DIR, get the associated node's file buffer and read the indices of that file buffer. Gather all of the indices into one large one. */ for (dir_index = 0; dir_menu[dir_index]; dir_index++) { REFERENCE **this_index, *this_item; NODE *this_node; FILE_BUFFER *this_fb; this_item = dir_menu[dir_index]; if (!this_item->filename) { if (dir_node->parent) this_item->filename = savestring (dir_node->parent); else this_item->filename = savestring (dir_node->filename); } /* Find this node. If we cannot find it, try using the label of the entry as a file (i.e., "(LABEL)Top"). */ this_node = info_get_node (this_item->filename, this_item->nodename); if (!this_node && this_item->nodename && (strcmp (this_item->label, this_item->nodename) == 0)) this_node = info_get_node (this_item->label, "Top"); if (!this_node) continue; /* Get the file buffer associated with this node. */ { char *files_name; files_name = this_node->parent; if (!files_name) files_name = this_node->filename; this_fb = info_find_file (files_name); if (this_fb && inform) message_in_echo_area ("Scanning indices of \"%s\"...", files_name); this_index = info_indices_of_file_buffer (this_fb); free (this_node); if (this_fb && inform) unmessage_in_echo_area (); } if (this_index) { /* Remember the filename which contains this set of references. */ for (i = 0; this_index && this_index[i]; i++) if (!this_index[i]->filename) this_index[i]->filename = savestring (this_fb->filename); /* Concatenate with the other indices. */ all_indices = info_concatenate_references (all_indices, this_index); } } info_free_references (dir_menu); /* Build a list of the references which contain SEARCH_STRING. */ if (all_indices) { REFERENCE *entry, **apropos_list = (REFERENCE **)NULL; int apropos_list_index = 0; int apropos_list_slots = 0; for (i = 0; (entry = all_indices[i]); i++) { if (string_in_line (search_string, entry->label) != -1) { add_pointer_to_array (entry, apropos_list_index, apropos_list, apropos_list_slots, 100, REFERENCE *); } else { maybe_free (entry->label); maybe_free (entry->filename); maybe_free (entry->nodename); free (entry); } } free (all_indices); all_indices = apropos_list; } return (all_indices); } #define APROPOS_NONE \ "No available info files reference \"%s\" in their indices." void info_apropos (string) char *string; { REFERENCE **apropos_list; apropos_list = apropos_in_all_indices (string, 0); if (!apropos_list) { info_error (APROPOS_NONE, string); } else { register int i; REFERENCE *entry; for (i = 0; (entry = apropos_list[i]); i++) fprintf (stderr, "\"(%s)%s\" -- %s\n", entry->filename, entry->nodename, entry->label); } info_free_references (apropos_list); } static char *apropos_list_nodename = "*Apropos*"; DECLARE_INFO_COMMAND (info_index_apropos, "Grovel all known info file's indices for a string and build a menu") { char *line; line = info_read_in_echo_area (window, "Index apropos: "); window = active_window; /* User aborted? */ if (!line) { info_abort_key (window, 1, 1); return; } /* User typed something? */ if (*line) { REFERENCE **apropos_list; NODE *apropos_node; apropos_list = apropos_in_all_indices (line, 1); if (!apropos_list) { info_error (APROPOS_NONE, line); } else { register int i; char *line_buffer; initialize_message_buffer (); printf_to_message_buffer ("\n* Menu: Nodes whoses indices contain \"%s\":\n", line); line_buffer = (char *)xmalloc (500); for (i = 0; apropos_list[i]; i++) { int len; sprintf (line_buffer, "* (%s)%s::", apropos_list[i]->filename, apropos_list[i]->nodename); len = pad_to (36, line_buffer); sprintf (line_buffer + len, "%s", apropos_list[i]->label); printf_to_message_buffer ("%s\n", line_buffer); } free (line_buffer); } apropos_node = message_buffer_to_node (); add_gcable_pointer (apropos_node); name_internal_node (apropos_node, apropos_list_nodename); /* Even though this is an internal node, we don't want the window system to treat it specially. So we turn off the internalness of it here. */ apropos_node->flags &= ~N_IsInternal; /* Find/Create a window to contain this node. */ { WINDOW *new; NODE *node; set_remembered_pagetop_and_point (window); /* If a window is visible and showing an apropos list already, re-use it. */ for (new = windows; new; new = new->next) { node = new->node; if (internal_info_node_p (node) && (strcmp (node->nodename, apropos_list_nodename) == 0)) break; } /* If we couldn't find an existing window, try to use the next window in the chain. */ if (!new && window->next) new = window->next; /* If we still don't have a window, make a new one to contain the list. */ if (!new) { WINDOW *old_active; old_active = active_window; active_window = window; new = window_make_window ((NODE *)NULL); active_window = old_active; } /* If we couldn't make a new window, use this one. */ if (!new) new = window; /* Lines do not wrap in this window. */ new->flags |= W_NoWrap; window_set_node_of_window (new, apropos_node); remember_window_and_node (new, apropos_node); active_window = new; } info_free_references (apropos_list); } free (line); if (!info_error_was_printed) window_clear_echo_area (); } octave-1.1.0/info/makedoc.c100666 415 17 26771 5377240255 13707 0ustar jweusers/* makedoc.c -- Make DOC.C and FUNS.H from input files. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ /* This program grovels the contents of the source files passed as arguments and writes out a file of function pointers and documentation strings, and a header file which describes the contents. This only does the functions declared with DECLARE_INFO_COMMAND. */ #include #include #include #include #include #include "general.h" #if !defined (O_RDONLY) #if defined (HAVE_SYS_FCNTL_H) #include #else /* !HAVE_SYS_FCNTL_H */ #include #endif /* !HAVE_SYS_FCNTL_H */ #endif /* !O_RDONLY */ extern void *xmalloc (), *xrealloc (); static void fatal_file_error (); /* Name of the header file which receives the declarations of functions. */ static char *funs_filename = "funs.h"; /* Name of the documentation to function pointer file. */ static char *doc_filename = "doc.c"; static char *doc_header[] = { "/* doc.c -- Generated structure containing function names and doc strings.", "", " This file was automatically made from various source files with the", " command \"%s\". DO NOT EDIT THIS FILE, only \"%s.c\".", (char *)NULL }; static char *doc_header_1[] = { " An entry in the array FUNCTION_DOC_ARRAY is made for each command", " found in the above files; each entry consists of a function pointer,", #if defined (NAMED_FUNCTIONS) " a string which is the user-visible name of the function,", #endif /* NAMED_FUNCTIONS */ " and a string which documents its purpose. */", "", "#include \"doc.h\"", "#include \"funs.h\"", "", "FUNCTION_DOC function_doc_array[] = {", "", (char *)NULL }; /* How to remember the locations of the functions found so that Emacs can use the information in a tag table. */ typedef struct { char *name; /* Name of the tag. */ int line; /* Line number at which it appears. */ long char_offset; /* Character offset at which it appears. */ } EMACS_TAG; typedef struct { char *filename; /* Name of the file containing entries. */ long entrylen; /* Total number of characters in tag block. */ EMACS_TAG **entries; /* Entries found in FILENAME. */ int entries_index; int entries_slots; } EMACS_TAG_BLOCK; EMACS_TAG_BLOCK **emacs_tags = (EMACS_TAG_BLOCK **)NULL; int emacs_tags_index = 0; int emacs_tags_slots = 0; #define DECLARATION_STRING "\nDECLARE_INFO_COMMAND" static void process_one_file (); static void maybe_dump_tags (); static FILE *must_fopen (); int main (argc, argv) int argc; char **argv; { register int i; int tags_only = 0; FILE *funs_stream, *doc_stream; for (i = 1; i < argc; i++) if (strcmp (argv[i], "-tags") == 0) { tags_only++; break; } if (tags_only) { funs_filename = "/dev/null"; doc_filename = "/dev/null"; } funs_stream = must_fopen (funs_filename, "w"); doc_stream = must_fopen (doc_filename, "w"); fprintf (funs_stream, "/* %s -- Generated declarations for Info commands. */\n", funs_filename); for (i = 0; doc_header[i]; i++) { fprintf (doc_stream, doc_header[i], argv[0], argv[0]); fprintf (doc_stream, "\n"); } fprintf (doc_stream, " Source files groveled to make this file include:\n\n"); for (i = 1; i < argc; i++) fprintf (doc_stream, "\t%s\n", argv[i]); fprintf (doc_stream, "\n"); for (i = 0; doc_header_1[i]; i++) fprintf (doc_stream, "%s\n", doc_header_1[i]); for (i = 1; i < argc; i++) { char *curfile; curfile = argv[i]; if (*curfile == '-') continue; fprintf (doc_stream, "/* Commands found in \"%s\". */\n", curfile); fprintf (funs_stream, "\n/* Functions declared in \"%s\". */\n", curfile); process_one_file (curfile, doc_stream, funs_stream); } fprintf (doc_stream, " { (VFunction *)NULL, (char *)NULL, (char *)NULL }\n};\n"); fclose (funs_stream); fclose (doc_stream); if (tags_only) maybe_dump_tags (stdout); exit (0); } /* Dumping out the contents of an Emacs tags table. */ static void maybe_dump_tags (stream) FILE *stream; { register int i; /* Print out the information for each block. */ for (i = 0; i < emacs_tags_index; i++) { register int j; register EMACS_TAG_BLOCK *block; register EMACS_TAG *etag; long block_len; block_len = 0; block = emacs_tags[i]; /* Calculate the length of the dumped block first. */ for (j = 0; j < block->entries_index; j++) { char digits[30]; etag = block->entries[j]; block_len += 3 + strlen (etag->name); sprintf (digits, "%d,%d", etag->line, etag->char_offset); block_len += strlen (digits); } /* Print out the defining line. */ fprintf (stream, "\f\n%s,%d\n", block->filename, block_len); /* Print out the individual tags. */ for (j = 0; j < block->entries_index; j++) { etag = block->entries[j]; fprintf (stream, "%s,\177%d,%d\n", etag->name, etag->line, etag->char_offset); } } } /* Keeping track of names, line numbers and character offsets of functions found in source files. */ static EMACS_TAG_BLOCK * make_emacs_tag_block (filename) char *filename; { EMACS_TAG_BLOCK *block; block = (EMACS_TAG_BLOCK *)xmalloc (sizeof (EMACS_TAG_BLOCK)); block->filename = savestring (filename); block->entrylen = 0; block->entries = (EMACS_TAG **)NULL; block->entries_index = 0; block->entries_slots = 0; return (block); } static void add_tag_to_block (block, name, line, char_offset) EMACS_TAG_BLOCK *block; char *name; int line; long char_offset; { EMACS_TAG *tag; tag = (EMACS_TAG *)xmalloc (sizeof (EMACS_TAG)); tag->name = name; tag->line = line; tag->char_offset = char_offset; add_pointer_to_array (tag, block->entries_index, block->entries, block->entries_slots, 50, EMACS_TAG *); } /* Read the file represented by FILENAME into core, and search it for Info function declarations. Output the declarations in various forms to the DOC_STREAM and FUNS_STREAM. */ static void process_one_file (filename, doc_stream, funs_stream) char *filename; FILE *doc_stream, *funs_stream; { int descriptor, decl_len; char *buffer, *decl_str; struct stat finfo; long offset; EMACS_TAG_BLOCK *block; if (stat (filename, &finfo) == -1) fatal_file_error (filename); descriptor = open (filename, O_RDONLY, 0666); if (descriptor == -1) fatal_file_error (filename); buffer = (char *)xmalloc (1 + finfo.st_size); read (descriptor, buffer, finfo.st_size); close (descriptor); offset = 0; decl_str = DECLARATION_STRING; decl_len = strlen (decl_str); block = make_emacs_tag_block (filename); while (1) { long point = 0; long line_start = 0; int line_number = 0; char *func, *doc; #if defined (NAMED_FUNCTIONS) char *func_name; #endif /* NAMED_FUNCTIONS */ for (; offset < (finfo.st_size - decl_len); offset++) { if (buffer[offset] == '\n') { line_number++; line_start = offset + 1; } if (strncmp (buffer + offset, decl_str, decl_len) == 0) { offset += decl_len; point = offset; break; } } if (!point) break; /* Skip forward until we find the open paren. */ while (point < finfo.st_size) { if (buffer[point] == '\n') { line_number++; line_start = point + 1; } else if (buffer[point] == '(') break; point++; } while (point++ < finfo.st_size) { if (!whitespace_or_newline (buffer[point])) break; else if (buffer[point] == '\n') { line_number++; line_start = point + 1; } } if (point >= finfo.st_size) break; /* Now looking at name of function. Get it. */ for (offset = point; buffer[offset] != ','; offset++); func = (char *)xmalloc (1 + (offset - point)); strncpy (func, buffer + point, offset - point); func[offset - point] = '\0'; /* Remember this tag in the current block. */ { char *tag_name; tag_name = (char *)xmalloc (1 + (offset - line_start)); strncpy (tag_name, buffer + line_start, offset - line_start); tag_name[offset - line_start] = '\0'; add_tag_to_block (block, tag_name, line_number, point); } #if defined (NAMED_FUNCTIONS) /* Generate the user-visible function name from the function's name. */ { register int i; char *name_start; name_start = func; if (strncmp (name_start, "info_", 5) == 0) name_start += 5; func_name = savestring (name_start); /* Fix up "ea" commands. */ if (strncmp (func_name, "ea_", 3) == 0) { char *temp_func_name; temp_func_name = (char *)xmalloc (10 + strlen (func_name)); strcpy (temp_func_name, "echo_area_"); strcat (temp_func_name, func_name + 3); free (func_name); func_name = temp_func_name; } for (i = 0; func_name[i]; i++) if (func_name[i] == '_') func_name[i] = '-'; } #endif /* NAMED_FUNCTIONS */ /* Find doc string. */ point = offset + 1; while (point < finfo.st_size) { if (buffer[point] == '\n') { line_number++; line_start = point + 1; } if (buffer[point] == '"') break; else point++; } offset = point + 1; while (offset < finfo.st_size) { if (buffer[offset] == '\n') { line_number++; line_start = offset + 1; } if (buffer[offset] == '\\') offset += 2; else if (buffer[offset] == '"') break; else offset++; } offset++; if (offset >= finfo.st_size) break; doc = (char *)xmalloc (1 + (offset - point)); strncpy (doc, buffer + point, offset - point); doc[offset - point] = '\0'; #if defined (NAMED_FUNCTIONS) fprintf (doc_stream, " { %s, \"%s\", %s },\n", func, func_name, doc); free (func_name); #else /* !NAMED_FUNCTIONS */ fprintf (doc_stream, " { %s, %s },\n", func, doc); #endif /* !NAMED_FUNCTIONS */ fprintf (funs_stream, "extern void %s ();\n", func); free (func); free (doc); } free (buffer); /* If we created any tags, remember this file on our global list. Otherwise, free the memory already allocated to it. */ if (block->entries) add_pointer_to_array (block, emacs_tags_index, emacs_tags, emacs_tags_slots, 10, EMACS_TAG_BLOCK *); else { free (block->filename); free (block); } } static void fatal_file_error (filename) char *filename; { fprintf (stderr, "Couldn't manipulate the file %s.\n", filename); exit (2); } static FILE * must_fopen (filename, mode) char *filename, *mode; { FILE *stream; stream = fopen (filename, mode); if (!stream) fatal_file_error (filename); return (stream); } octave-1.1.0/info/nodemenu.c100666 415 17 20023 5333270124 14064 0ustar jweusers/* nodemenu.c -- Produce a menu of all visited nodes. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* Return a line describing the format of a node information line. */ static char * nodemenu_format_info () { return ("\n\ * Menu:\n\ (File)Node Lines Size Containing File\n\ ---------- ----- ---- ---------------"); } /* Produce a formatted line of information about NODE. Here is what we want the output listing to look like: * Menu: (File)Node Lines Size Containing File ---------- ----- ---- --------------- * (emacs)Buffers:: 48 2230 /usr/gnu/info/emacs/emacs-1 * (autoconf)Writing configure.in:: 123 58789 /usr/gnu/info/autoconf/autoconf-1 * (dir)Top:: 40 589 /usr/gnu/info/dir */ static char * format_node_info (node) NODE *node; { register int i, len; char *parent, *containing_file; static char *line_buffer = (char *)NULL; if (!line_buffer) line_buffer = (char *)xmalloc (1000); if (node->parent) { parent = filename_non_directory (node->parent); if (!parent) parent = node->parent; } else parent = (char *)NULL; containing_file = node->filename; if (!parent && !*containing_file) sprintf (line_buffer, "* %s::", node->nodename); else { char *file = (char *)NULL; if (parent) file = parent; else file = filename_non_directory (containing_file); if (!file) file = containing_file; if (!*file) file = "dir"; sprintf (line_buffer, "* (%s)%s::", file, node->nodename); } len = pad_to (36, line_buffer); { int lines = 1; for (i = 0; i < node->nodelen; i++) if (node->contents[i] == '\n') lines++; sprintf (line_buffer + len, "%d", lines); } len = pad_to (44, line_buffer); sprintf (line_buffer + len, "%d", node->nodelen); if (node->filename && *(node->filename)) { len = pad_to (51, line_buffer); sprintf (line_buffer + len, node->filename); } return (savestring (line_buffer)); } /* Little string comparison routine for qsort (). */ static int compare_strings (string1, string2) char **string1, **string2; { return (stricmp (*string1, *string2)); } /* The name of the nodemenu node. */ static char *nodemenu_nodename = "*Node Menu*"; /* Produce an informative listing of all the visited nodes, and return it in a node. If FILTER_FUNC is non-null, it is a function which filters which nodes will appear in the listing. FILTER_FUNC takes an argument of NODE, and returns non-zero if the node should appear in the listing. */ NODE * get_visited_nodes (filter_func) Function *filter_func; { register int i, iw_index; INFO_WINDOW *info_win; NODE *node; char **lines = (char **)NULL; int lines_index = 0, lines_slots = 0; if (!info_windows) return ((NODE *)NULL); for (iw_index = 0; info_win = info_windows[iw_index]; iw_index++) { for (i = 0; i < info_win->nodes_index; i++) { node = info_win->nodes[i]; /* We skip mentioning "*Node Menu*" nodes. */ if (internal_info_node_p (node) && (strcmp (node->nodename, nodemenu_nodename) == 0)) continue; if (node && (!filter_func || (*filter_func) (node))) { char *line; line = format_node_info (node); add_pointer_to_array (line, lines_index, lines, lines_slots, 20, char *); } } } /* Sort the array of information lines. */ qsort (lines, lines_index, sizeof (char *), compare_strings); /* Delete duplicates. */ { register int j, newlen; char **temp; for (i = 0, newlen = 1; i < lines_index - 1; i++) { if (strcmp (lines[i], lines[i + 1]) == 0) { free (lines[i]); lines[i] = (char *)NULL; } else newlen++; } /* We have free ()'d and marked all of the duplicate slots. Copy the live slots rather than pruning the dead slots. */ temp = (char **)xmalloc ((1 + newlen) * sizeof (char *)); for (i = 0, j = 0; i < lines_index; i++) if (lines[i]) temp[j++] = lines[i]; temp[j] = (char *)NULL; free (lines); lines = temp; lines_index = newlen; } initialize_message_buffer (); printf_to_message_buffer ("Here is a menu of nodes you could select with info-history-node:\n"); printf_to_message_buffer ("%s\n", nodemenu_format_info ()); for (i = 0; i < lines_index; i++) { printf_to_message_buffer ("%s\n", lines[i]); free (lines[i]); } free (lines); node = message_buffer_to_node (); add_gcable_pointer (node->contents); return (node); } DECLARE_INFO_COMMAND (list_visited_nodes, "Make a window containing a menu of all of the currently visited nodes") { WINDOW *new; NODE *node; set_remembered_pagetop_and_point (window); /* If a window is visible and showing the buffer list already, re-use it. */ for (new = windows; new; new = new->next) { node = new->node; if (internal_info_node_p (node) && (strcmp (node->nodename, nodemenu_nodename) == 0)) break; } /* If we couldn't find an existing window, try to use the next window in the chain. */ if (!new && window->next) new = window->next; /* If we still don't have a window, make a new one to contain the list. */ if (!new) { WINDOW *old_active; old_active = active_window; active_window = window; new = window_make_window ((NODE *)NULL); active_window = old_active; } /* If we couldn't make a new window, use this one. */ if (!new) new = window; /* Lines do not wrap in this window. */ new->flags |= W_NoWrap; node = get_visited_nodes ((Function *)NULL); name_internal_node (node, nodemenu_nodename); /* Even if this is an internal node, we don't want the window system to treat it specially. So we turn off the internalness of it here. */ node->flags &= ~N_IsInternal; /* If this window is already showing a node menu, reuse the existing node slot. */ { int remember_me = 1; #if defined (NOTDEF) if (internal_info_node_p (new->node) && (strcmp (new->node->nodename, nodemenu_nodename) == 0)) remember_me = 0; #endif /* NOTDEF */ window_set_node_of_window (new, node); if (remember_me) remember_window_and_node (new, node); } active_window = new; } DECLARE_INFO_COMMAND (select_visited_node, "Select a node which has been previously visited in a visible window") { char *line; NODE *node; REFERENCE **menu; node = get_visited_nodes ((Function *)NULL); menu = info_menu_of_node (node); free (node); line = info_read_completing_in_echo_area (window, "Select visited node: ", menu); window = active_window; /* User aborts, just quit. */ if (!line) { info_abort_key (window, 0, 0); info_free_references (menu); return; } if (*line) { REFERENCE *entry; /* Find the selected label in the references. */ entry = info_get_labeled_reference (line, menu); if (!entry) info_error ("The reference disappeared! (%s).", line); else info_select_reference (window, entry); } free (line); info_free_references (menu); if (!info_error_was_printed) window_clear_echo_area (); } octave-1.1.0/info/footnotes.c100666 415 17 16436 5334553702 14316 0ustar jweusers/* footnotes.c -- Some functions for manipulating footnotes. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* Non-zero means attempt to show footnotes when displaying a new window. */ int auto_footnotes_p = 1; static char *footnote_nodename = "*Footnotes*"; #define FOOTNOTE_HEADER_FORMAT \ "*** Footnotes appearing in the node \"%s\" ***\n" /* Find the window currently showing footnotes. */ static WINDOW * find_footnotes_window () { WINDOW *win; /* Try to find an existing window first. */ for (win = windows; win; win = win->next) if (internal_info_node_p (win->node) && (strcmp (win->node->nodename, footnote_nodename) == 0)) break; return (win); } /* Manufacture a node containing the footnotes of this node, and return the manufactured node. If NODE has no footnotes, return a NULL pointer. */ NODE * make_footnotes_node (node) NODE *node; { NODE *fn_node, *result = (NODE *)NULL; long fn_start; /* Make the initial assumption that the footnotes appear as simple text within this windows node. */ fn_node = node; /* See if this node contains the magic footnote label. */ fn_start = info_search_in_node (FOOTNOTE_LABEL, node, 0, (WINDOW *)NULL, 1); /* If it doesn't, check to see if it has an associated footnotes node. */ if (fn_start == -1) { REFERENCE **refs; refs = info_xrefs_of_node (node); if (refs) { register int i; char *refname; refname = (char *)xmalloc (1 + strlen ("-Footnotes") + strlen (node->nodename)); strcpy (refname, node->nodename); strcat (refname, "-Footnotes"); for (i = 0; refs[i]; i++) if (strcmp (refs[i]->nodename, refname) == 0) { char *filename; filename = node->parent; if (!filename) filename = node->filename; fn_node = info_get_node (filename, refname); if (fn_node) fn_start = 0; break; } free (refname); info_free_references (refs); } } /* If we never found the start of a footnotes area, quit now. */ if (fn_start == -1) return ((NODE *)NULL); /* Make the new node. */ result = (NODE *)xmalloc (sizeof (NODE)); result->flags = 0; /* Get the size of the footnotes appearing within this node. */ { char *header; long text_start = fn_start; header = (char *)xmalloc (1 + strlen (node->nodename) + strlen (FOOTNOTE_HEADER_FORMAT)); sprintf (header, FOOTNOTE_HEADER_FORMAT, node->nodename); /* Move the start of the displayed text to right after the first line. This effectively skips either "---- footno...", or "File: foo...". */ while (text_start < fn_node->nodelen) if (fn_node->contents[text_start++] == '\n') break; result->nodelen = strlen (header) + fn_node->nodelen - text_start; /* Set the contents of this node. */ result->contents = (char *)xmalloc (1 + result->nodelen); sprintf (result->contents, "%s", header); memcpy (result->contents + strlen (header), fn_node->contents + text_start, fn_node->nodelen - text_start); name_internal_node (result, footnote_nodename); free (header); } #if defined (NOTDEF) /* If the footnotes were gleaned from the node that we were called with, shorten the calling node's display length. */ if (fn_node == node) narrow_node (node, 0, fn_start); #endif /* NOTDEF */ return (result); } /* Create or delete the footnotes window depending on whether footnotes exist in WINDOW's node or not. Returns FN_FOUND if footnotes were found and displayed. Returns FN_UNFOUND if there were no footnotes found in WINDOW's node. Returns FN_UNABLE if there were footnotes, but the window to show them couldn't be made. */ int info_get_or_remove_footnotes (window) WINDOW *window; { WINDOW *fn_win; NODE *new_footnotes; fn_win = find_footnotes_window (); /* If we are in the footnotes window, change nothing. */ if (fn_win == window) return (FN_FOUND); /* Try to find footnotes for this window's node. */ new_footnotes = make_footnotes_node (window->node); /* If there was a window showing footnotes, and there are no footnotes for the current window, delete the old footnote window. */ if (fn_win && !new_footnotes) { if (windows->next) info_delete_window_internal (fn_win); } /* If there are footnotes for this window's node, but no window around showing footnotes, try to make a new window. */ if (new_footnotes && !fn_win) { WINDOW *old_active; WINDOW *last, *win; /* Always make this window be the last one appearing in the list. Find the last window in the chain. */ for (win = windows, last = windows; win; last = win, win = win->next); /* Try to split this window, and make the split window the one to contain the footnotes. */ old_active = active_window; active_window = last; fn_win = window_make_window (new_footnotes); active_window = old_active; if (!fn_win) { free (new_footnotes->contents); free (new_footnotes); /* If we are hacking automatic footnotes, and there are footnotes but we couldn't display them, print a message to that effect. */ if (auto_footnotes_p) inform_in_echo_area ("Footnotes could not be displayed"); return (FN_UNABLE); } } /* If there are footnotes, and there is a window to display them, make that window be the number of lines appearing in the footnotes. */ if (new_footnotes && fn_win) { window_set_node_of_window (fn_win, new_footnotes); window_change_window_height (fn_win, fn_win->line_count - fn_win->height); remember_window_and_node (fn_win, new_footnotes); add_gcable_pointer (new_footnotes->contents); } if (!new_footnotes) return (FN_UNFOUND); else return (FN_FOUND); } /* Show the footnotes associated with this node in another window. */ DECLARE_INFO_COMMAND (info_show_footnotes, "Show the footnotes associated with this node in another window") { int result; /* A negative argument means just make the window go away. */ if (count < 0) { WINDOW *fn_win = find_footnotes_window (); /* If there is an old footnotes window, and it isn't the only window on the screen, delete it. */ if (fn_win && windows->next) info_delete_window_internal (fn_win); } else { int result; result = info_get_or_remove_footnotes (window); switch (result) { case FN_UNFOUND: info_error (NO_FOOT_NODE); break; case FN_UNABLE: info_error (WIN_TOO_SMALL); break; } } } octave-1.1.0/info/gc.c100666 415 17 5732 5333270322 12635 0ustar jweusers/* gc.c -- Functions to remember and garbage collect unused node contents. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" /* Array of pointers to the contents of gc-able nodes. A pointer on this list can be garbage collected when no info window contains a node whose contents member match the pointer. */ static char **gcable_pointers = (char **)NULL; static int gcable_pointers_index = 0; static int gcable_pointers_slots = 0; /* Add POINTER to the list of garbage collectible pointers. A pointer is not actually garbage collected until no info window contains a node whose contents member is equal to the pointer. */ void add_gcable_pointer (pointer) char *pointer; { gc_pointers (); add_pointer_to_array (pointer, gcable_pointers_index, gcable_pointers, gcable_pointers_slots, 10, char *); } /* Grovel the list of info windows and gc-able pointers finding those node->contents which are collectible, and free them. */ void gc_pointers () { register int i, j, k; INFO_WINDOW *iw; char **new = (char **)NULL; int new_index = 0; int new_slots = 0; if (!info_windows || !gcable_pointers_index) return; for (i = 0; iw = info_windows[i]; i++) { for (j = 0; j < iw->nodes_index; j++) { NODE *node = iw->nodes[j]; /* If this node->contents appears in our list of gcable_pointers, it is not gc-able, so save it. */ for (k = 0; k < gcable_pointers_index; k++) if (gcable_pointers[k] == node->contents) { add_pointer_to_array (node->contents, new_index, new, new_slots, 10, char *); break; } } } /* We have gathered all of the pointers which need to be saved. Free any of the original pointers which do not appear in the new list. */ for (i = 0; i < gcable_pointers_index; i++) { for (j = 0; j < new_index; j++) if (gcable_pointers[i] == new[j]) break; /* If we got all the way through the new list, then the old pointer can be garbage collected. */ if (new && !new[j]) free (gcable_pointers[i]); } free (gcable_pointers); gcable_pointers = new; gcable_pointers_slots = new_slots; gcable_pointers_index = new_index; } octave-1.1.0/info/dribble.c100666 415 17 4120 5333270406 13640 0ustar jweusers/* dribble.c -- Dribble files for Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include #include "dribble.h" /* When non-zero, it is a stream to write all input characters to for the duration of this info session. */ FILE *info_dribble_file = (FILE *)NULL; /* Open a dribble file named NAME, perhaps closing an already open one. This sets the global variable INFO_DRIBBLE_FILE to the open stream. */ void open_dribble_file (name) char *name; { /* Perhaps close existing dribble file. */ close_dribble_file (); info_dribble_file = fopen (name, "w"); #if defined (HAVE_SETVBUF) if (info_dribble_file) # if defined (SETVBUF_REVERSED) setvbuf (info_dribble_file, _IONBF, (char *)NULL, 1); # else setvbuf (info_dribble_file, (char *)NULL, _IONBF, 1); # endif /* !SETVBUF_REVERSED */ #endif /* HAVE_SETVBUF */ } /* If there is a dribble file already open, close it. */ void close_dribble_file () { if (info_dribble_file) { fflush (info_dribble_file); fclose (info_dribble_file); info_dribble_file = (FILE *)NULL; } } /* Write some output to our existing dribble file. */ void dribble (byte) unsigned char byte; { if (info_dribble_file) fwrite (&byte, sizeof (unsigned char), 1, info_dribble_file); } octave-1.1.0/info/variables.c100666 415 17 16366 5336324040 14241 0ustar jweusers/* variables.c -- How to manipulate user visible variables in Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include "variables.h" /* **************************************************************** */ /* */ /* User Visible Variables in Info */ /* */ /* **************************************************************** */ /* Choices used by the completer when reading a zero/non-zero value for a variable. */ static char *on_off_choices[] = { "Off", "On", (char *)NULL }; VARIABLE_ALIST info_variables[] = { { "automatic-footnotes", "When \"On\", footnotes appear and disappear automatically", &auto_footnotes_p, (char **)on_off_choices }, { "automatic-tiling", "When \"On\", creating or deleting a window resizes other windows", &auto_tiling_p, (char **)on_off_choices }, { "visible-bell", "When \"On\", flash the screen instead of ringing the bell", &terminal_use_visible_bell_p, (char **)on_off_choices }, { "errors-ring-bell", "When \"On\", errors cause the bell to ring", &info_error_rings_bell_p, (char **)on_off_choices }, { "gc-compressed-files", "When \"On\", Info garbage collects files which had to be uncompressed", &gc_compressed_files, (char **)on_off_choices }, { "show-index-match", "When \"On\", the portion of the matched search string is highlighted", &show_index_match, (char **)on_off_choices }, { "scroll-behaviour", "Controls what happens when scrolling is requested at the end of a node", &info_scroll_behaviour, (char **)info_scroll_choices }, { "scroll-step", "The number lines to scroll when the cursor moves out of the window", &window_scroll_step, (char **)NULL }, { "ISO-Latin", "When \"On\", Info accepts and displays ISO Latin characters", &ISO_Latin_p, (char **)on_off_choices }, { (char *)NULL, (char *)NULL, (int *)NULL, (char **)NULL } }; DECLARE_INFO_COMMAND (describe_variable, "Explain the use of a variable") { VARIABLE_ALIST *var; char *description; /* Get the variable's name. */ var = read_variable_name ("Describe variable: ", window); if (!var) return; description = (char *)xmalloc (20 + strlen (var->name) + strlen (var->doc)); if (var->choices) sprintf (description, "%s (%s): %s.", var->name, var->choices[*(var->value)], var->doc); else sprintf (description, "%s (%d): %s.", var->name, *(var->value), var->doc); window_message_in_echo_area ("%s", description); free (description); } DECLARE_INFO_COMMAND (set_variable, "Set the value of an Info variable") { VARIABLE_ALIST *var; char *line; /* Get the variable's name and value. */ var = read_variable_name ("Set variable: ", window); if (!var) return; /* Read a new value for this variable. */ { char prompt[100]; if (!var->choices) { int potential_value; if (info_explicit_arg || count != 1) potential_value = count; else potential_value = *(var->value); sprintf (prompt, "Set %s to value (%d): ", var->name, potential_value); line = info_read_in_echo_area (active_window, prompt); /* If no error was printed, clear the echo area. */ if (!info_error_was_printed) window_clear_echo_area (); /* User aborted? */ if (!line) return; /* If the user specified a value, get that, otherwise, we are done. */ canonicalize_whitespace (line); if (*line) *(var->value) = atoi (line); else *(var->value) = potential_value; free (line); } else { register int i; REFERENCE **array = (REFERENCE **)NULL; int array_index = 0; int array_slots = 0; for (i = 0; var->choices[i]; i++) { REFERENCE *entry; entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->label = savestring (var->choices[i]); entry->nodename = (char *)NULL; entry->filename = (char *)NULL; add_pointer_to_array (entry, array_index, array, array_slots, 10, REFERENCE *); } sprintf (prompt, "Set %s to value (%s): ", var->name, var->choices[*(var->value)]); /* Ask the completer to read a variable value for us. */ line = info_read_completing_in_echo_area (window, prompt, array); info_free_references (array); if (!echo_area_is_active) window_clear_echo_area (); /* User aborted? */ if (!line) { info_abort_key (active_window, 0, 0); return; } /* User accepted default choice? If so, no change. */ if (!*line) { free (line); return; } /* Find the choice in our list of choices. */ for (i = 0; var->choices[i]; i++) if (strcmp (var->choices[i], line) == 0) break; if (var->choices[i]) *(var->value) = i; } } } /* Read the name of an Info variable in the echo area and return the address of a VARIABLE_ALIST member. A return value of NULL indicates that no variable could be read. */ VARIABLE_ALIST * read_variable_name (prompt, window) char *prompt; WINDOW *window; { register int i; char *line; REFERENCE **variables; /* Get the completion array of variable names. */ variables = make_variable_completions_array (); /* Ask the completer to read a variable for us. */ line = info_read_completing_in_echo_area (window, prompt, variables); info_free_references (variables); if (!echo_area_is_active) window_clear_echo_area (); /* User aborted? */ if (!line) { info_abort_key (active_window, 0, 0); return ((VARIABLE_ALIST *)NULL); } /* User accepted "default"? (There is none.) */ if (!*line) { free (line); return ((VARIABLE_ALIST *)NULL); } /* Find the variable in our list of variables. */ for (i = 0; info_variables[i].name; i++) if (strcmp (info_variables[i].name, line) == 0) break; if (!info_variables[i].name) return ((VARIABLE_ALIST *)NULL); else return (&(info_variables[i])); } /* Make an array of REFERENCE which actually contains the names of the variables available in Info. */ REFERENCE ** make_variable_completions_array () { register int i; REFERENCE **array = (REFERENCE **)NULL; int array_index = 0, array_slots = 0; for (i = 0; info_variables[i].name; i++) { REFERENCE *entry; entry = (REFERENCE *)xmalloc (sizeof (REFERENCE)); entry->label = savestring (info_variables[i].name); entry->nodename = (char *)NULL; entry->filename = (char *)NULL; add_pointer_to_array (entry, array_index, array, array_slots, 200, REFERENCE *); } return (array); } octave-1.1.0/info/error.c100666 415 17 6147 5500706261 13400 0ustar jweusers/* error.c -- Handle info errors. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #include "info.h" #include "dribble.h" #include "terminal.h" #include "getopt.h" /* The version numbers of this version of Info. */ int info_major_version = 2; int info_minor_version = 10; int info_patch_level = 1; /* When non-zero, the Info window system has been initialized. */ int info_windows_initialized_p = 0; /* **************************************************************** */ /* */ /* Main Entry Point to the Info Program */ /* */ /* **************************************************************** */ /* Return a string describing the current version of Info. */ char * version_string () { static char *vstring = (char *)NULL; if (!vstring) { vstring = (char *)xmalloc (50); sprintf (vstring, "%d.%d", info_major_version, info_minor_version); if (info_patch_level) sprintf (vstring + strlen (vstring), "-p%d", info_patch_level); } return (vstring); } /* **************************************************************** */ /* */ /* Error Handling for Info */ /* */ /* **************************************************************** */ static char *program_name = "info"; /* Non-zero if an error has been signalled. */ int info_error_was_printed = 0; /* Non-zero means ring terminal bell on errors. */ int info_error_rings_bell_p = 1; /* Print FORMAT with ARG1 and ARG2. If the window system was initialized, then the message is printed in the echo area. Otherwise, a message is output to stderr. */ void info_error (format, arg1, arg2) char *format; void *arg1, *arg2; { info_error_was_printed = 1; if (!info_windows_initialized_p || display_inhibited) { fprintf (stderr, "%s: ", program_name); fprintf (stderr, format, arg1, arg2); fprintf (stderr, "\n"); fflush (stderr); } else { if (!echo_area_is_active) { if (info_error_rings_bell_p) terminal_ring_bell (); window_message_in_echo_area (format, arg1, arg2); } else { NODE *temp; temp = build_message_node (format, arg1, arg2); if (info_error_rings_bell_p) terminal_ring_bell (); inform_in_echo_area (temp->contents); free (temp->contents); free (temp); } } } octave-1.1.0/info/display.h100666 415 17 5511 5336023157 13716 0ustar jweusers/* display.h -- How the display in Info is done. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_DISPLAY_H_) #define _DISPLAY_H_ #include "info-utils.h" #include "terminal.h" typedef struct { char *text; /* Text of the line as it appears. */ int textlen; /* Printable Length of TEXT. */ int inverse; /* Non-zero means this line is inverse. */ } DISPLAY_LINE; /* An array of display lines which tell us what is currently visible on the display. */ extern DISPLAY_LINE **the_display; /* Non-zero means do no output. */ extern int display_inhibited; /* Non-zero if we didn't completely redisplay a window. */ extern int display_was_interrupted_p; /* Initialize THE_DISPLAY to WIDTH and HEIGHT, with nothing in it. */ extern void display_initialize_display (); /* Clear all of the lines in DISPLAY making the screen blank. */ extern void display_clear_display (); /* Update the windows pointed to by WINDOWS in THE_DISPLAY. This actually writes the text on the screen. */ extern void display_update_display (); /* Display WIN on THE_DISPLAY. Unlike display_update_display (), this function only does one window. */ extern void display_update_one_window (); /* Move the screen cursor to directly over the current character in WINDOW. */ extern void display_cursor_at_point (); /* Scroll the region of the_display starting at START, ending at END, and moving the lines AMOUNT lines. If AMOUNT is less than zero, the lines are moved up in the screen, otherwise down. Actually, it is possible for no scrolling to take place in the case that the terminal doesn't support it. This doesn't matter to us. */ extern void display_scroll_display (); /* Try to scroll lines in WINDOW. OLD_PAGETOP is the pagetop of WINDOW before having had its line starts recalculated. OLD_STARTS is the list of line starts that used to appear in this window. OLD_COUNT is the number of lines that appear in the OLD_STARTS array. */ extern void display_scroll_line_starts (); #endif /* !_DISPLAY_H_ */ octave-1.1.0/info/doc.h100666 415 17 3335 5333267623 13025 0ustar jweusers/* doc.h -- Structure associating function pointers with documentation. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_DOC_H_) #define _DOC_H_ #if !defined (NULL) # define NULL 0x0 #endif /* !NULL */ #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); #endif /* _FUNCTION_DEF */ typedef struct { VFunction *func; #if defined (NAMED_FUNCTIONS) char *func_name; #endif /* NAMED_FUNCTIONS */ char *doc; } FUNCTION_DOC; extern FUNCTION_DOC function_doc_array[]; extern char *function_documentation (); extern char *key_documentation (); extern char *pretty_keyname (); extern char *replace_in_documentation (); extern void info_document_key (); extern void dump_map_to_message_buffer (); #if defined (NAMED_FUNCTIONS) extern char *function_name (); extern VFunction *named_function (); #endif /* NAMED_FUNCTIONS */ #endif /* !_DOC_H_ */ octave-1.1.0/info/echo_area.h100666 415 17 5126 5333267616 14170 0ustar jweusers/* echo_area.h -- Functions used in reading information from the echo area. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_ECHO_AREA_H_) #define _ECHO_AREA_H_ #define EA_MAX_INPUT 256 extern int echo_area_is_active, info_aborted_echo_area; /* Non-zero means that the last command executed while reading input killed some text. */ extern int echo_area_last_command_was_kill; extern void inform_in_echo_area (), echo_area_inform_of_deleted_window (); extern void echo_area_prep_read (); extern VFunction *ea_last_executed_command; /* Read a line of text in the echo area. Return a malloc ()'ed string, or NULL if the user aborted out of this read. WINDOW is the currently active window, so that we can restore it when we need to. PROMPT, if non-null, is a prompt to print before reading the line. */ extern char *info_read_in_echo_area (); /* Read a line in the echo area with completion over COMPLETIONS. Takes arguments of WINDOW, PROMPT, and COMPLETIONS, a REFERENCE **. */ char *info_read_completing_in_echo_area (); /* Read a line in the echo area allowing completion over COMPLETIONS, but not requiring it. Takes arguments of WINDOW, PROMPT, and COMPLETIONS, a REFERENCE **. */ extern char *info_read_maybe_completing (); extern void ea_insert (), ea_quoted_insert (); extern void ea_beg_of_line (), ea_backward (), ea_delete (), ea_end_of_line (); extern void ea_forward (), ea_abort (), ea_rubout (), ea_complete (); extern void ea_newline (), ea_kill_line (), ea_transpose_chars (); extern void ea_yank (), ea_tab_insert (), ea_possible_completions (); extern void ea_backward_word (), ea_kill_word (), ea_forward_word (); extern void ea_yank_pop (), ea_backward_kill_word (); extern void ea_scroll_completions_window (); #endif /* _ECHO_AREA_H_ */ octave-1.1.0/info/filesys.h100666 415 17 6621 5374005036 13730 0ustar jweusers/* filesys.h -- External declarations of functions and vars in filesys.c. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_FILESYS_H_) #define _FILESYS_H_ /* The path on which we look for info files. You can initialize this from the environment variable INFOPATH if there is one, or you can call info_add_path () to add paths to the beginning or end of it. */ extern char *infopath; /* Make INFOPATH have absolutely nothing in it. */ extern void zap_infopath (); /* Add PATH to the list of paths found in INFOPATH. 2nd argument says whether to put PATH at the front or end of INFOPATH. */ extern void info_add_path (); /* Defines that are passed along with the pathname to info_add_path (). */ #define INFOPATH_PREPEND 0 #define INFOPATH_APPEND 1 /* Expand the filename in PARTIAL to make a real name for this operating system. This looks in INFO_PATHS in order to find the correct file. If it can't find the file, it returns NULL. */ extern char *info_find_fullpath (); /* Read the contents of PATHNAME, returning a buffer with the contents of that file in it, and returning the size of that buffer in FILESIZE. FINFO is a stat struct which has already been filled in by the caller. If the file cannot be read, return a NULL pointer. */ extern char *filesys_read_info_file (); extern char *filesys_read_compressed (); /* Return the command string that would be used to decompress FILENAME. */ extern char *filesys_decompressor_for_file (); extern int compressed_filename_p (); /* A function which returns a pointer to a static buffer containing an error message for FILENAME and ERROR_NUM. */ extern char *filesys_error_string (); /* The number of the most recent file system error. */ extern int filesys_error_number; /* Given a string containing units of information separated by colons, return the next one pointed to by IDX, or NULL if there are no more. Advance IDX to the character after the colon. */ extern char *extract_colon_unit (); /* The default value of INFOPATH. */ #if !defined (DEFAULT_INFOPATH) # define DEFAULT_INFOPATH "/usr/gnu/info:/local/gnu/info:/usr/gnu/lib/info:/usr/gnu/lib/emacs/info:/usr/local/gnu/info:/usr/local/gnu/lib/info:/usr/local/gnu/lib/emacs/info:/usr/local/lib/info:/usr/local/lib/emacs/info:/usr/local/emacs/info:." #endif /* !DEFAULT_INFOPATH */ #if !defined (S_ISREG) && defined (S_IFREG) # define S_ISREG(m) (((m) & S_IFMT) == S_IFREG) #endif /* !S_ISREG && S_IFREG */ #if !defined (S_ISDIR) && defined (S_IFDIR) # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif /* !S_ISDIR && S_IFDIR */ #endif /* !_FILESYS_H_ */ octave-1.1.0/info/general.h100666 415 17 5223 5333267571 13675 0ustar jweusers/* general.h -- Some generally useful defines. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_GENERAL_H_) #define _GENERAL_H_ extern void *xmalloc (), *xrealloc (); #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STRING_H) # include #else # include #endif /* !HAVE_STRING_H */ #if !defined (savestring) # define savestring(x) (char *)strcpy ((char *)xmalloc (1 + strlen (x)), x) #endif /* !savestring */ #define info_toupper(x) (islower (x) ? toupper (x) : x) #define info_tolower(x) (isupper (x) ? tolower (x) : x) #if !defined (whitespace) # define whitespace(c) ((c == ' ') || (c == '\t')) #endif /* !whitespace */ #if !defined (whitespace_or_newline) # define whitespace_or_newline(c) (whitespace (c) || (c == '\n')) #endif /* !whitespace_or_newline */ #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); #endif /* _FUNCTION_DEF */ /* Add POINTER to the list of pointers found in ARRAY. SLOTS is the number of slots that have already been allocated. INDEX is the index into the array where POINTER should be added. GROW is the number of slots to grow ARRAY by, in the case that it needs growing. TYPE is a cast of the type of object stored in ARRAY (e.g., NODE_ENTRY *. */ #define add_pointer_to_array(pointer, idx, array, slots, grow, type) \ do { \ if (idx + 2 >= slots) \ array = (type *)(xrealloc (array, (slots += grow) * sizeof (type))); \ array[idx++] = (type)pointer; \ array[idx] = (type)NULL; \ } while (0) #define maybe_free(x) do { if (x) free (x); } while (0) #if !defined (HAVE_BZERO) # define zero_mem(mem, length) memset (mem, 0, length) #else # define zero_mem(mem, length) bzero (mem, length) #endif /* !BZERO_MISSING */ #endif /* !_GENERAL_H_ */ octave-1.1.0/info/info-utils.h100666 415 17 12625 5377314461 14374 0ustar jweusers/* info-utils.h -- Exported functions and variables from info-util.c. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_INFO_UTILS_H_) #define _INFO_UTILS_H_ #if !defined (HAVE_RINDEX) #undef index #undef rindex #define index strchr #define rindex strrchr #endif #if !defined (HAVE_BCOPY) #undef bcopy #define bcopy(source, dest, count) memcpy(dest, source, count) #endif #include "nodes.h" #include "window.h" #include "search.h" /* Structure which describes a node reference, such as a menu entry or cross reference. Arrays of such references can be built by calling info_menus_of_node () or info_xrefs_of_node (). */ typedef struct { char *label; /* User Label. */ char *filename; /* File where this node can be found. */ char *nodename; /* Name of the node. */ int start, end; /* Offsets within the containing node of LABEL. */ } REFERENCE; /* When non-zero, various display and input functions handle ISO Latin character sets correctly. */ extern int ISO_Latin_p; /* Variable which holds the most recent filename parsed as a result of calling info_parse_xxx (). */ extern char *info_parsed_filename; /* Variable which holds the most recent nodename parsed as a result of calling info_parse_xxx (). */ extern char *info_parsed_nodename; /* Parse the filename and nodename out of STRING. If STRING doesn't contain a filename (i.e., it is NOT (FILENAME)NODENAME) then set INFO_PARSED_FILENAME to NULL. If second argument NEWLINES_OKAY is non-zero, it says to allow the nodename specification to cross a newline boundary (i.e., only `,', `.', or `TAB' can end the spec). */ void info_parse_node (); /* Return a NULL terminated array of REFERENCE * which represents the menu found in NODE. If there is no menu in NODE, just return a NULL pointer. */ extern REFERENCE **info_menu_of_node (); /* Return a NULL terminated array of REFERENCE * which represents the cross refrences found in NODE. If there are no cross references in NODE, just return a NULL pointer. */ extern REFERENCE **info_xrefs_of_node (); /* Glean cross references from BINDING->buffer + BINDING->start until BINDING->end. Return an array of REFERENCE * that represents each cross reference in this range. */ extern REFERENCE **info_xrefs (); /* Get the entry associated with LABEL in REFERENCES. Return a pointer to the reference if found, or NULL. */ extern REFERENCE *info_get_labeled_reference (); /* Glean menu entries from BINDING->buffer + BINDING->start until we have looked at the entire contents of BINDING. Return an array of REFERENCE * that represents each menu item in this range. */ extern REFERENCE **info_menu_items (); /* A utility function for concatenating REFERENCE **. Returns a new REFERENCE ** which is the concatenation of REF1 and REF2. The REF1 and REF2 arrays are freed, but their contents are not. */ REFERENCE **info_concatenate_references (); /* Free the data associated with REFERENCES. */ extern void info_free_references (); /* Search for sequences of whitespace or newlines in STRING, replacing all such sequences with just a single space. Remove whitespace from start and end of string. */ void canonicalize_whitespace (); /* Return a pointer to a string which is the printed representation of CHARACTER if it were printed at HPOS. */ extern char *printed_representation (); /* Return a pointer to the part of PATHNAME that simply defines the file. */ extern char *filename_non_directory (); /* Return non-zero if NODE is one especially created by Info. */ extern int internal_info_node_p (); /* Make NODE appear to be one especially created by Info, and give it NAME. */ extern void name_internal_node (); /* Return the window displaying NAME, the name of an internally created Info window. */ extern WINDOW *get_internal_info_window (); /* Return the node addressed by LABEL in NODE (usually one of "Prev:", "Next:", "Up:", "File:", or "Node:". After a call to this function, the global INFO_PARSED_NODENAME and INFO_PARSED_FILENAME contain the information. */ extern void info_parse_label (/* label, node */); #define info_label_was_found \ (info_parsed_nodename != NULL || info_parsed_filename != NULL) #define info_file_label_of_node(n) info_parse_label (INFO_FILE_LABEL, n) #define info_next_label_of_node(n) info_parse_label (INFO_NEXT_LABEL, n) #define info_up_label_of_node(n) info_parse_label (INFO_UP_LABEL, n) #define info_prev_label_of_node(n) \ do { \ info_parse_label (INFO_PREV_LABEL, n); \ if (!info_label_was_found) \ info_parse_label (INFO_ALTPREV_LABEL, n); \ } while (0) #endif /* !_INFO_UTILS_H_ */ octave-1.1.0/info/info.h100666 415 17 7466 5500701034 13205 0ustar jweusers/* info.h -- Header file which includes all of the other headers. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_INFO_H_) #define _INFO_H_ #include #include #include #include #include "filesys.h" #include "display.h" #include "session.h" #include "echo_area.h" #include "doc.h" #include "footnotes.h" #include "gc.h" /* A structure associating the nodes visited in a particular window. */ typedef struct { WINDOW *window; /* The window that this list is attached to. */ NODE **nodes; /* Array of nodes visited in this window. */ int *pagetops; /* For each node in NODES, the pagetop. */ long *points; /* For each node in NODES, the point. */ int current; /* Index in NODES of the current node. */ int nodes_index; /* Index where to add the next node. */ int nodes_slots; /* Number of slots allocated to NODES. */ } INFO_WINDOW; /* Array of structures describing for each window which nodes have been visited in that window. */ extern INFO_WINDOW **info_windows; /* For handling errors. If you initialize the window system, you should also set info_windows_initialized_p to non-zero. It is used by the info_error () function to determine how to format and output errors. */ extern int info_windows_initialized_p; /* Non-zero if an error message has been printed. */ extern int info_error_was_printed; /* Non-zero means ring terminal bell on errors. */ extern int info_error_rings_bell_p; /* Print FORMAT with ARG1 and ARG2. If the window system was initialized, then the message is printed in the echo area. Otherwise, a message is output to stderr. */ extern void info_error (); /* The version numbers of Info. */ extern int info_major_version, info_minor_version, info_patch_level; /* How to get the version string for this version of Info. Returns something similar to "2.9". */ extern char *version_string (); /* Error message defines. */ #define CANT_FIND_NODE "Cannot find the node \"%s\"." #define CANT_FILE_NODE "Cannot find the node \"(%s)%s\"." #define CANT_FIND_WIND "Cannot find a window!" #define CANT_FIND_POINT "Point doesn't appear within this window's node!" #define CANT_KILL_LAST "Cannot delete the last window." #define NO_MENU_NODE "No menu in this node." #define NO_FOOT_NODE "No footnotes in this node." #define NO_XREF_NODE "No cross references in this node." #define NO_POINTER "No \"%s\" pointer for this node." #define UNKNOWN_COMMAND "Unknown Info command `%c'. `?' for help." #define TERM_TOO_DUMB \ "Terminal type \"%s\" unknown or not smart enough to run Info." #define TERM_TOO_SMALL "%d row by %d column terminal too small to run Info." #define AT_NODE_BOTTOM "You are already at the last page of this node." #define AT_NODE_TOP "You are already at the first page of this node." #define ONE_WINDOW "Only one window." #define WIN_TOO_SMALL "Resulting window would be too small." #define CANT_MAKE_HELP \ "There isn't enough room to make a help window. Please delete a window." #endif /* !_INFO_H_ */ octave-1.1.0/info/infomap.h100666 415 17 4774 5333267463 13723 0ustar jweusers/* infomap.h -- Description of a keymap in Info and related functions. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_INFOMAP_H_) #define _INFOMAP_H_ #include "general.h" #define ESC '\033' #define DEL '\177' #define TAB '\011' #define RET '\r' #define LFD '\n' #define SPC ' ' #define meta_character_threshold (DEL + 1) #define control_character_threshold (SPC) #define meta_character_bit 0x80 #define control_character_bit 0x40 #define Meta_p(c) (((c) > meta_character_threshold)) #define Control_p(c) ((c) < control_character_threshold) #define Meta(c) ((c) | (meta_character_bit)) #define UnMeta(c) ((c) & (~meta_character_bit)) #define Control(c) ((toupper (c)) & (~control_character_bit)) #define UnControl(c) (tolower ((c) | control_character_bit)) /* A keymap contains one entry for each key in the ASCII set. Each entry consists of a type and a pointer. FUNCTION is the address of a function to run, or the address of a keymap to indirect through. TYPE says which kind of thing FUNCTION is. */ typedef struct { char type; VFunction *function; } KEYMAP_ENTRY; typedef KEYMAP_ENTRY *Keymap; /* The values that TYPE can have in a keymap entry. */ #define ISFUNC 0 #define ISKMAP 1 extern Keymap info_keymap; extern Keymap echo_area_keymap; /* Return a new keymap which has all the uppercase letters mapped to run the function info_do_lowercase_version (). */ extern Keymap keymap_make_keymap (); /* Return a new keymap which is a copy of MAP. */ extern Keymap keymap_copy_keymap (); /* Free MAP and it's descendents. */ extern void keymap_discard_keymap (); /* Initialize the info keymaps. */ extern void initialize_info_keymaps (); #endif /* !_INFOMAP_H_ */ octave-1.1.0/info/nodes.h100666 415 17 16312 5335561460 13405 0ustar jweusers/* nodes.h -- How we represent nodes internally. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_NODES_H_) #define _NODES_H_ #include "general.h" /* **************************************************************** */ /* */ /* User Code Interface */ /* */ /* **************************************************************** */ /* Callers generally only want the node itself. This structure is used to pass node information around. None of the information in this structure should ever be directly freed. The structure itself can be passed to free (). Note that NODE->parent is non-null if this node's file is a subfile. In that case, NODE->parent is the logical name of the file containing this node. Both names are given as full paths, so you might have: node->filename = "/usr/gnu/info/emacs-1", with node->parent = "/usr/gnu/info/emacs". */ typedef struct { char *filename; /* The physical file containing this node. */ char *parent; /* Non-null is the logical file name. */ char *nodename; /* The name of this node. */ char *contents; /* Characters appearing in this node. */ long nodelen; /* The length of the CONTENTS member. */ int flags; /* See immediately below. */ } NODE; /* Defines that can appear in NODE->flags. All informative. */ #define N_HasTagsTable 0x01 /* This node was found through a tags table. */ #define N_TagsIndirect 0x02 /* The tags table was an indirect one. */ #define N_UpdateTags 0x04 /* The tags table is out of date. */ #define N_IsCompressed 0x08 /* The file is compressed on disk. */ #define N_IsInternal 0x10 /* This node was made by Info. */ #define N_CannotGC 0x20 /* File buffer cannot be gc'ed. */ /* **************************************************************** */ /* */ /* Internal Data Structures */ /* */ /* **************************************************************** */ /* Some defines describing details about Info file contents. */ /* String Constants. */ #define INFO_FILE_LABEL "File:" #define INFO_NODE_LABEL "Node:" #define INFO_PREV_LABEL "Prev:" #define INFO_ALTPREV_LABEL "Previous:" #define INFO_NEXT_LABEL "Next:" #define INFO_UP_LABEL "Up:" #define INFO_MENU_LABEL "\n* Menu:" #define INFO_MENU_ENTRY_LABEL "\n* " #define INFO_XREF_LABEL "*Note" #define TAGS_TABLE_END_LABEL "\nEnd Tag Table" #define TAGS_TABLE_BEG_LABEL "Tag Table:\n" #define INDIRECT_TAGS_TABLE_LABEL "Indirect:\n" #define TAGS_TABLE_IS_INDIRECT_LABEL "(Indirect)" /* Character Constants. */ #define INFO_COOKIE '\037' #define INFO_FF '\014' #define INFO_TAGSEP '\177' /* For each logical file that we have loaded, we keep a list of the names of the nodes that are found in that file. A pointer to a node in an info file is called a "tag". For split files, the tag pointer is "indirect"; that is, the pointer also contains the name of the split file where the node can be found. For non-split files, the filename member in the structure below simply contains the name of the current file. The following structure describes a single node within a file. */ typedef struct { char *filename; /* The file where this node can be found. */ char *nodename; /* The node pointed to by this tag. */ long nodestart; /* The offset of the start of this node. */ long nodelen; /* The length of this node. */ } TAG; /* The following structure is used to remember information about the contents of Info files that we have loaded at least once before. The FINFO member is present so that we can reload the file if it has been modified since last being loaded. All of the arrays appearing within this structure are NULL terminated, and each array which can change size has a corresponding SLOTS member which says how many slots have been allocated (with malloc ()) for this array. */ typedef struct { char *filename; /* The filename used to find this file. */ char *fullpath; /* The full pathname of this info file. */ struct stat finfo; /* Information about this file. */ char *contents; /* The contents of this particular file. */ long filesize; /* The number of bytes this file expands to. */ char **subfiles; /* If non-null, the list of subfiles. */ TAG **tags; /* If non-null, the indirect tags table. */ int tags_slots; /* Number of slots allocated for TAGS. */ int flags; /* Various flags. Mimics of N_* flags. */ } FILE_BUFFER; /* **************************************************************** */ /* */ /* Externally Visible Functions */ /* */ /* **************************************************************** */ /* Array of FILE_BUFFER * which represents the currently loaded info files. */ extern FILE_BUFFER **info_loaded_files; /* The number of slots currently allocated to INFO_LOADED_FILES. */ extern int info_loaded_files_slots; /* Locate the file named by FILENAME, and return the information structure describing this file. The file may appear in our list of loaded files already, or it may not. If it does not already appear, find the file, and add it to the list of loaded files. If the file cannot be found, return a NULL FILE_BUFFER *. */ extern FILE_BUFFER *info_find_file (); /* Force load the file named FILENAME, and return the information structure describing this file. Even if the file was already loaded, this loads a new buffer, rebuilds tags and nodes, and returns a new FILE_BUFFER *. */ extern FILE_BUFFER *info_load_file (); /* Return a pointer to a NODE structure for the Info node (FILENAME)NODENAME. FILENAME can be passed as NULL, in which case the filename of "dir" is used. NODENAME can be passed as NULL, in which case the nodename of "Top" is used. If the node cannot be found, return a NULL pointer. */ extern NODE *info_get_node (); /* Return a pointer to a NODE structure for the Info node NODENAME in FILE_BUFFER. NODENAME can be passed as NULL, in which case the nodename of "Top" is used. If the node cannot be found, return a NULL pointer. */ extern NODE *info_get_node_of_file_buffer (); /* Grovel FILE_BUFFER->contents finding tags and nodes, and filling in the various slots. This can also be used to rebuild a tag or node table. */ extern void build_tags_and_nodes (); /* When non-zero, this is a string describing the most recent file error. */ extern char *info_recent_file_error; #endif /* !_NODES_H_ */ octave-1.1.0/info/search.h100666 415 17 5567 5517055520 13531 0ustar jweusers/* search.h -- Structure used to search large bodies of text, with bounds. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ /* The search functions take two arguments: 1) a string to search for, and 2) a pointer to a SEARCH_BINDING which contains the buffer, start, and end of the search. They return a long, which is the offset from the start of the buffer at which the match was found. An offset of -1 indicates failure. */ #if !defined (_SEARCH_H_) #define _SEARCH_H_ typedef struct { char *buffer; /* The buffer of text to search. */ long start; /* Offset of the start of the search. */ long end; /* Offset of the end of the searh. */ int flags; /* Flags controlling the type of search. */ } SEARCH_BINDING; #define S_FoldCase 0x01 /* Set means fold case in searches. */ #define S_SkipDest 0x02 /* Set means return pointing after the dest. */ SEARCH_BINDING *make_binding (), *copy_binding (); extern long search_forward (), search_backward (), search (); extern int looking_at (); /* Note that STRING_IN_LINE () always returns the offset of the 1st character after the string. */ extern int string_in_line (); #ifndef HAVE_STRICMP /* strcmp (), but caseless. */ extern int stricmp (); #endif #ifndef HAVE_STRNICMP /* Compare at most COUNT characters from STRING1 to STRING2. Case doesn't matter. */ extern int strnicmp (); #endif /* Function names that start with "skip" are passed a string, and return an offset from the start of that string. Function names that start with "find" are passed a SEARCH_BINDING, and return an absolute position marker of the item being searched for. "Find" functions return a value of -1 if the item being looked for couldn't be found. */ extern int skip_whitespace (), skip_non_whitespace (); extern int skip_whitespace_and_newlines (), skip_line (); extern int skip_node_characters (), skip_node_separator (); #define DONT_SKIP_NEWLINES 0 #define SKIP_NEWLINES 1 extern long find_node_separator (), find_tags_table (); extern long find_node_in_binding (); #endif /* !_SEARCH_H_ */ octave-1.1.0/info/session.h100666 415 17 13422 5333267452 13761 0ustar jweusers/* session.h -- Functions found in session.c. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_SESSION_H_) #define _SESSION_H_ #include "general.h" #include "dribble.h" /* All commands that can be invoked from within info_session () receive arguments in the same way. This simple define declares the header of a function named NAME, with associated documentation DOC. The documentation string is groveled out of the source files by the utility program `builddoc', which is also responsible for making the documentation/function-pointer maps. */ #define DECLARE_INFO_COMMAND(name, doc) \ void name (window, count, key) WINDOW *window; int count; unsigned char key; /* Variables found in session.h. */ extern VFunction *info_last_executed_command; /* Variable controlling the garbage collection of files briefly visited during searches. Such files are normally gc'ed, unless they were compressed to begin with. If this variable is non-zero, it says to gc even those file buffer contents which had to be uncompressed. */ extern int gc_compressed_files; /* When non-zero, tiling takes place automatically when info_split_window is called. */ extern int auto_tiling_p; /* Variable controlling the behaviour of default scrolling when you are already at the bottom of a node. */ extern int info_scroll_behaviour; extern char *info_scroll_choices[]; /* Values for info_scroll_behaviour. */ #define IS_Continuous 0 /* Try to get first menu item, or failing that, the "Next:" pointer, or failing that, the "Up:" and "Next:" of the up. */ #define IS_NextOnly 1 /* Try to get "Next:" menu item. */ #define IS_PageOnly 2 /* Simply give up at the bottom of a node. */ /* Utility functions found in session.c */ extern void info_dispatch_on_key (); extern unsigned char info_get_input_char (), info_get_another_input_char (); extern unsigned char info_input_pending_p (); extern void remember_window_and_node (), set_remembered_pagetop_and_point (); extern void set_window_pagetop (), info_set_node_of_window (); extern char *pretty_keyseq (); extern void initialize_keyseq (), add_char_to_keyseq (); extern void info_gather_typeahead (); extern FILE_BUFFER *file_buffer_of_window (); extern long info_search_in_node (), info_target_search_node (); extern void info_select_reference (); extern int info_any_buffered_input_p (); extern void print_node (); extern void dump_node_to_file (), dump_nodes_to_file (); /* Do the physical deletion of WINDOW, and forget this window and associated nodes. */ extern void info_delete_window_internal (); /* Tell Info that input is coming from the file FILENAME. */ extern void info_set_input_from_file (); #define return_if_control_g(val) \ do { \ info_gather_typeahead (); \ if (info_input_pending_p () == Control ('g')) \ return (val); \ } while (0) /* The names of the functions that run an info session. */ /* Starting an info session. */ extern void begin_multiple_window_info_session (), begin_info_session (); extern void begin_info_session_with_error (), info_session (); extern void info_read_and_dispatch (); /* Moving the point within a node. */ extern void info_next_line (), info_prev_line (); extern void info_end_of_line (), info_beginning_of_line (); extern void info_forward_char (), info_backward_char (); extern void info_forward_word (), info_backward_word (); extern void info_beginning_of_node (), info_end_of_node (); extern void info_move_to_prev_xref (), info_move_to_next_xref (); /* Scrolling text within a window. */ extern void info_scroll_forward (), info_scroll_backward (); extern void info_redraw_display (), info_toggle_wrap (); extern void info_move_to_window_line (); /* Manipulating multiple windows. */ extern void info_split_window (), info_delete_window (); extern void info_keep_one_window (), info_grow_window (); extern void info_scroll_other_window (), info_tile_windows (); extern void info_next_window (), info_prev_window (); /* Selecting nodes. */ extern void info_next_node (), info_prev_node (), info_up_node (); extern void info_last_node (), info_first_node (), info_history_node (); extern void info_goto_node (), info_top_node (), info_dir_node (); extern void info_global_next_node (), info_global_prev_node (); extern void info_kill_node (), info_view_file (); /* Selecting cross references. */ extern void info_menu_digit (), info_menu_item (), info_xref_item (); extern void info_find_menu (), info_select_reference_this_line (); /* Hacking numeric arguments. */ extern int info_explicit_arg, info_numeric_arg, info_numeric_arg_sign; extern void info_add_digit_to_numeric_arg (), info_universal_argument (); extern void info_initialize_numeric_arg (), info_numeric_arg_digit_loop (); /* Searching commands. */ extern void info_search (), isearch_forward (), isearch_backward (); /* Dumping and printing nodes. */ extern void info_print_node (); /* Miscellaneous commands. */ extern void info_abort_key (), info_quit (), info_do_lowercase_version (); #endif /* _SESSION_H_ */ octave-1.1.0/info/signals.h100666 415 17 5031 5627201755 13713 0ustar jweusers/* signals.h -- Header to include system dependent signal definitions. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_SIGNALS_H_) #define _SIGNALS_H_ #include #define HAVE_SIGSETMASK #if !defined (_POSIX_VERSION) && !defined (sigmask) # define sigmask(x) (1 << ((x)-1)) #endif /* !POSIX && !sigmask */ #if !defined (_POSIX_VERSION) # if !defined (SIG_BLOCK) # define SIG_UNBLOCK 1 # define SIG_BLOCK 2 # define SIG_SETMASK 3 # endif /* SIG_BLOCK */ /* Type of a signal set. */ # define sigset_t int /* Make SET have no signals in it. */ # define sigemptyset(set) (*(set) = (sigset_t)0x0) /* Make SET have the full range of signal specifications possible. */ # define sigfillset(set) (*(set) = (sigset_t)0xffffffffff) /* Add SIG to the contents of SET. */ # define sigaddset(set, sig) *(set) |= sigmask (sig) /* Delete SIG from the contents of SET. */ # define sigdelset(set, sig) *(set) &= ~(sigmask (sig)) /* Tell if SET contains SIG. */ # define sigismember(set, sig) (*(set) & (sigmask (sig))) /* Suspend the process until the reception of one of the signals not present in SET. */ # define sigsuspend(set) sigpause (*(set)) #endif /* !_POSIX_VERSION */ /* These definitions are used both in POSIX and non-POSIX implementations. */ #define BLOCK_SIGNAL(sig) \ do { \ sigset_t nvar, ovar; \ sigemptyset (&nvar); \ sigemptyset (&ovar); \ sigaddset (&nvar, sig); \ sigprocmask (SIG_BLOCK, &nvar, &ovar); \ } while (0) #define UNBLOCK_SIGNAL(sig) \ do { \ sigset_t nvar, ovar; \ sigemptyset (&ovar); \ sigemptyset (&nvar); \ sigaddset (&nvar, sig); \ sigprocmask (SIG_UNBLOCK, &nvar, &ovar); \ } while (0) #endif /* !_SIGNALS_H_ */ octave-1.1.0/info/termdep.h100666 415 17 3766 5461331751 13724 0ustar jweusers/* termdep.h -- System things that terminal.c depends on. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if defined (HAVE_SYS_FCNTL_H) #include #else #include #endif /* !HAVE_SYS_FCNTL_H */ #if defined (HAVE_TERMIOS_H) #include #include #if defined (HAVE_SYS_PTEM_H) #if !defined (M_XENIX) #include #include #undef TIOCGETC #else /* M_XENIX */ #define tchars tc #endif /* M_XENIX */ #endif /* HAVE_SYS_PTEM_H */ #elif defined (HAVE_TERMIO_H) #include #include #if defined (HAVE_SYS_PTEM_H) #if !defined (M_XENIX) #include #include #undef TIOCGETC #else /* M_XENIX */ #define tchars tc #endif /* M_XENIX */ #endif /* HAVE_SYS_PTEM_H */ #else /* !HAVE_TERMIO_H */ #include #include #include #endif /* !HAVE_TERMIO_H */ #if defined (HAVE_SYS_TTOLD_H) #include #endif /* HAVE_SYS_TTOLD_H */ #if !defined (HAVE_RINDEX) #undef index #undef rindex #define index strchr #define rindex strrchr #endif #if !defined (HAVE_BCOPY) #undef bcopy #define bcopy(source, dest, count) memcpy(dest, source, count) #endif /* eof */ octave-1.1.0/info/terminal.h100666 415 17 11241 5333267401 14100 0ustar jweusers/* terminal.h -- The external interface to terminal I/O. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_TERMINAL_H_) #define _TERMINAL_H_ /* We use the following data type to talk about pointers to functions. */ #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); #endif /* _FUNCTION_DEF */ /* For almost every function externally visible from terminal.c, there is a corresponding "hook" function which can be bound in order to replace the functionality of the one found in terminal.c. This is how we go about implemented X window display. */ /* The width and height of the terminal. */ extern int screenwidth, screenheight; /* Non-zero means this terminal can't really do anything. */ extern int terminal_is_dumb_p; /* Non-zero means that this terminal has a meta key. */ extern int terminal_has_meta_p; /* Non-zero means that this terminal can produce a visible bell. */ extern int terminal_has_visible_bell_p; /* Non-zero means to use that visible bell if at all possible. */ extern int terminal_use_visible_bell_p; /* Non-zero means that this terminal can scroll lines up and down. */ extern int terminal_can_scroll; /* Initialize the terminal which is known as TERMINAL_NAME. If this terminal doesn't have cursor addressability, TERMINAL_IS_DUMB_P becomes non-zero. The variables SCREENHEIGHT and SCREENWIDTH are set to the dimensions that this terminal actually has. The variable TERMINAL_HAS_META_P becomes non- zero if this terminal supports a Meta key. */ extern void terminal_initialize_terminal (); extern VFunction *terminal_initialize_terminal_hook; /* Return the current screen width and height in the variables SCREENWIDTH and SCREENHEIGHT. */ extern void terminal_get_screen_size (); extern VFunction *terminal_get_screen_size_hook; /* Save and restore tty settings. */ extern void terminal_prep_terminal (), terminal_unprep_terminal (); extern VFunction *terminal_prep_terminal_hook, *terminal_unprep_terminal_hook; /* Re-initialize the terminal to TERMINAL_NAME. */ extern void terminal_new_terminal (); extern VFunction *terminal_new_terminal_hook; /* Move the cursor to the terminal location of X and Y. */ extern void terminal_goto_xy (); extern VFunction *terminal_goto_xy_hook; /* Print STRING to the terminal at the current position. */ extern void terminal_put_text (); extern VFunction *terminal_put_text_hook; /* Print NCHARS from STRING to the terminal at the current position. */ extern void terminal_write_chars (); extern VFunction *terminal_write_chars_hook; /* Clear from the current position of the cursor to the end of the line. */ extern void terminal_clear_to_eol (); extern VFunction *terminal_clear_to_eol_hook; /* Clear the entire terminal screen. */ extern void terminal_clear_screen (); extern VFunction *terminal_clear_screen_hook; /* Move the cursor up one line. */ extern void terminal_up_line (); extern VFunction *terminal_up_line_hook; /* Move the cursor down one line. */ extern void terminal_down_line (); extern VFunction *terminal_down_line_hook; /* Turn on reverse video if possible. */ extern void terminal_begin_inverse (); extern VFunction *terminal_begin_inverse_hook; /* Turn off reverse video if possible. */ extern void terminal_end_inverse (); extern VFunction *terminal_end_inverse_hook; /* Scroll an area of the terminal, starting with the region from START to END, AMOUNT lines. If AMOUNT is negative, the lines are scrolled towards the top of the screen, else they are scrolled towards the bottom of the screen. */ extern void terminal_scroll_terminal (); extern VFunction *terminal_scroll_terminal_hook; /* Ring the terminal bell. The bell is run visibly if it both has one and terminal_use_visible_bell_p is non-zero. */ extern void terminal_ring_bell (); extern VFunction *terminal_ring_bell_hook; #endif /* !_TERMINAL_H_ */ octave-1.1.0/info/tilde.h100666 415 17 4451 5333267767 13372 0ustar jweusers/* tilde.h: Externally available variables and function in libtilde.a. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. This file has appeared in prior works by the Free Software Foundation; thus it carries copyright dates from 1988 through 1993. Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ /* Function pointers can be declared as (Function *)foo. */ #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); #endif /* _FUNCTION_DEF */ /* If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text (sans tilde, as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. */ extern Function *tilde_expansion_failure_hook; /* When non-null, this is a NULL terminated array of strings which are duplicates for a tilde prefix. Bash uses this to expand `=~' and `:~'. */ extern char **tilde_additional_prefixes; /* When non-null, this is a NULL terminated array of strings which match the end of a username, instead of just "/". Bash sets this to `:' and `=~'. */ extern char **tilde_additional_suffixes; /* Return a new string which is the result of tilde expanding STRING. */ extern char *tilde_expand (); /* Do the work of tilde expansion on FILENAME. FILENAME starts with a tilde. If there is no expansion, call tilde_expansion_failure_hook. */ extern char *tilde_expand_word (); octave-1.1.0/info/indices.h100666 415 17 2716 5456464756 13714 0ustar jweusers/* indices.h -- Functions defined in indices.c. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_INDICES_H_) #define _INDICES_H_ /* User-visible variable controls the output of info-index-next. */ extern int show_index_match; extern REFERENCE **info_indices_of_window (), **info_indices_of_file_buffer (); extern void info_apropos (); /* For every menu item in DIR, search the indices of that file for STRING. */ REFERENCE **apropos_in_all_indices (); /* User visible functions declared in indices.c. */ extern void info_index_search (), info_next_index_match (); extern void do_info_index_search (); #endif /* !_INDICES_H_ */ octave-1.1.0/info/window.h100666 415 17 23367 5335723673 13622 0ustar jweusers/* window.h -- Structure and flags used in manipulating Info windows. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_WINDOW_H_) #define _WINDOW_H_ #include "nodes.h" #include "infomap.h" /* Smallest number of visible lines in a window. The actual height is always one more than this number because each window has a modeline. */ #define WINDOW_MIN_HEIGHT 2 /* Smallest number of screen lines that can be used to fully present a window. This number includes the modeline of the window. */ #define WINDOW_MIN_SIZE (WINDOW_MIN_HEIGHT + 1) /* The exact same elements are used within the WINDOW_STATE structure and a subsection of the WINDOW structure. We could define a structure which contains this elements, and include that structure in each of WINDOW_STATE and WINDOW. But that would lead references in the code such as window->state->node which we would like to avoid. Instead, we #define the elements here, and simply include the define in both data structures. Thus, if you need to change window state information, here is where you would do it. NB> The last element does NOT end with a semi-colon. */ #define WINDOW_STATE_DECL \ NODE *node; /* The node displayed in this window. */ \ int pagetop; /* LINE_STARTS[PAGETOP] is first line in WINDOW. */ \ long point /* Offset within NODE of the cursor position. */ /* Structure which defines a window. Windows are doubly linked, next and prev. The list of windows is kept on WINDOWS. The structure member window->height is the total height of the window. The position location (0, window->height + window->first_row) is the first character of this windows modeline. The number of lines that can be displayed in a window is equal to window->height - 1. */ typedef struct __window__ { struct __window__ *next; /* Next window in this chain. */ struct __window__ *prev; /* Previous window in this chain. */ int width; /* Width of this window. */ int height; /* Height of this window. */ int first_row; /* Offset of the first line in the_screen. */ int goal_column; /* The column we would like the cursor to appear in. */ Keymap keymap; /* Keymap used to read commands in this window. */ WINDOW_STATE_DECL; /* Node, pagetop and point. */ char *modeline; /* Calculated text of the modeline for this window. */ char **line_starts; /* Array of printed line starts for this node. */ int line_count; /* Number of lines appearing in LINE_STARTS. */ int flags; /* See below for details. */ } WINDOW; typedef struct { WINDOW_STATE_DECL; /* What gets saved. */ } WINDOW_STATE; #define W_UpdateWindow 0x01 /* WINDOW needs updating. */ #define W_WindowIsPerm 0x02 /* This WINDOW is a permanent object. */ #define W_WindowVisible 0x04 /* This WINDOW is currently visible. */ #define W_InhibitMode 0x08 /* This WINDOW has no modeline. */ #define W_NoWrap 0x10 /* Lines do not wrap in this window. */ #define W_InputWindow 0x20 /* Window accepts input. */ #define W_TempWindow 0x40 /* Window is less important. */ extern WINDOW *windows; /* List of visible Info windows. */ extern WINDOW *active_window; /* The currently active window. */ extern WINDOW *the_screen; /* The Info screen is just another window. */ extern WINDOW *the_echo_area; /* THE_ECHO_AREA is a window in THE_SCREEN. */ /* Global variable control redisplay of scrolled windows. If non-zero, it is the desired number of lines to scroll the window in order to make point visible. A user might set this to 1 for smooth scrolling. If set to zero, the line containing point is centered within the window. */ extern int window_scroll_step; /* Make the modeline member for WINDOW. */ extern void window_make_modeline (); /* Initalize the window system by creating THE_SCREEN and THE_ECHO_AREA. Create the first window ever, and make it permanent. You pass WIDTH and HEIGHT; the dimensions of the total screen size. */ extern void window_initialize_windows (); /* Make a new window showing NODE, and return that window structure. The new window is made to be the active window. If NODE is passed as NULL, then show the node showing in the active window. If the window could not be made return a NULL pointer. The active window is not changed.*/ extern WINDOW *window_make_window (); /* Delete WINDOW from the list of known windows. If this window was the active window, make the next window in the chain be the active window, or the previous window in the chain if there is no next window. */ extern void window_delete_window (); /* A function to call when the screen changes size, and some windows have to get deleted. The function is called with the window to be deleted as an argument, and it can't do anything about the window getting deleted; it can only clean up dangling references to that window. */ extern VFunction *window_deletion_notifier; /* Set WINDOW to display NODE. */ extern void window_set_node_of_window (); /* Tell the window system that the size of the screen has changed. This causes lots of interesting things to happen. The permanent windows are resized, as well as every visible window. You pass WIDTH and HEIGHT; the dimensions of the total screen size. */ extern void window_new_screen_size (); /* Change the height of WINDOW by AMOUNT. This also automagically adjusts the previous and next windows in the chain. If there is only one user window, then no change takes place. */ extern void window_change_window_height (); /* Adjust the pagetop of WINDOW such that the cursor point will be visible. */ extern void window_adjust_pagetop (); /* Tile all of the windows currently displayed in the global variable WINDOWS. If argument DO_INTERNALS is non-zero, tile windows displaying internal nodes as well. */ #define DONT_TILE_INTERNALS 0 #define TILE_INTERNALS 1 extern void window_tile_windows (); /* Toggle the state of line wrapping in WINDOW. This can do a bit of fancy redisplay. */ extern void window_toggle_wrap (); /* For every window in CHAIN, set the flags member to have FLAG set. */ extern void window_mark_chain (); /* For every window in CHAIN, clear the flags member of FLAG. */ extern void window_unmark_chain (); /* Make WINDOW start displaying at PERCENT percentage of its node. */ extern void window_goto_percentage (); /* Build a new node which has FORMAT printed with ARG1 and ARG2 as the contents. */ extern NODE *build_message_node (); /* Useful functions can be called from outside of window.c. */ extern void initialize_message_buffer (); /* Print FORMAT with ARG1,2 to the end of the current message buffer. */ extern void printf_to_message_buffer (); /* Convert the contents of the message buffer to a node. */ extern NODE *message_buffer_to_node (); /* Return the length of the most recently printed line in message buffer. */ extern int message_buffer_length_this_line (); /* Pad STRING to COUNT characters by inserting blanks. */ extern int pad_to (); /* Make a message appear in the echo area, built from FORMAT, ARG1 and ARG2. The arguments are treated similar to printf () arguments, but not all of printf () hair is present. The message appears immediately. If there was already a message appearing in the echo area, it is removed. */ extern void window_message_in_echo_area (); /* Place a temporary message in the echo area built from FORMAT, ARG1 and ARG2. The message appears immediately, but does not destroy any existing message. A future call to unmessage_in_echo_area () restores the old contents. */ extern void message_in_echo_area (); extern void unmessage_in_echo_area (); /* Clear the echo area, removing any message that is already present. The echo area is cleared immediately. */ extern void window_clear_echo_area (); /* Quickly guess the approximate number of lines to that NODE would take to display. This really only counts carriage returns. */ extern int window_physical_lines (); /* Calculate a list of line starts for the node belonging to WINDOW. The line starts are pointers to the actual text within WINDOW->NODE. */ extern void calculate_line_starts (); /* Given WINDOW, recalculate the line starts for the node it displays. */ extern void recalculate_line_starts (); /* Return the number of characters it takes to display CHARACTER on the screen at HPOS. */ extern int character_width (); /* Return the number of characters it takes to display STRING on the screen at HPOS. */ extern int string_width (); /* Return the index of the line containing point. */ extern int window_line_of_point (); /* Get and return the goal column for this window. */ extern int window_get_goal_column (); /* Get and return the printed column offset of the cursor in this window. */ extern int window_get_cursor_column (); /* Get and Set the node, pagetop, and point of WINDOW. */ extern void window_get_state (), window_set_state (); /* Count the number of characters in LINE that precede the printed column offset of GOAL. */ extern int window_chars_to_goal (); #endif /* !_WINDOW_H_ */ octave-1.1.0/info/footnotes.h100666 415 17 3251 5333267605 14275 0ustar jweusers/* footnotes.h -- Some functions for manipulating footnotes. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_FOOTNOTES_H_) #define _FOOTNOTES_H_ /* Magic string which indicates following text is footnotes. */ #define FOOTNOTE_LABEL "---------- Footnotes ----------" #define FN_FOUND 0 #define FN_UNFOUND 1 #define FN_UNABLE 2 /* Create or delete the footnotes window depending on whether footnotes exist in WINDOW's node or not. Returns FN_FOUND if footnotes were found and displayed. Returns FN_UNFOUND if there were no footnotes found in WINDOW's node. Returns FN_UNABLE if there were footnotes, but the window to show them couldn't be made. */ extern int info_get_or_remove_footnotes (); /* Non-zero means attempt to show footnotes when displaying a new window. */ extern int auto_footnotes_p; #endif /* !_FOOTNOTES_H_ */ octave-1.1.0/info/dribble.h100666 415 17 2755 5333267620 13665 0ustar jweusers/* dribble.h -- Functions and vars declared in dribble.c. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_DRIBBLE_H_) #define _DRIBBLE_H_ /* When non-zero, it is a stream to write all input characters to for the duration of this info session. */ extern FILE *info_dribble_file; /* Open a dribble file named NAME, perhaps closing an already open one. This sets the global variable INFO_DRIBBLE_FILE to the open stream. */ extern void open_dribble_file (); /* If there is a dribble file already open, close it. */ extern void close_dribble_file (); /* Write some output to our existing dribble file. */ extern void dribble (); #endif /* !_DRIBBLE_H_ */ octave-1.1.0/info/variables.h100666 415 17 4570 5333267362 14232 0ustar jweusers/* variables.h -- Description of user visible variables in Info. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_VARIABLES_H_) #define _VARIABLES_H_ /* A variable (in the Info sense) is an integer value with a user-visible name. You may supply an array of strings to complete over when the variable is set; in that case, the variable is set to the index of the string that the user chose. If you supply a null list, the user can set the variable to a numeric value. */ /* Structure describing a user visible variable. */ typedef struct { char *name; /* Polite name. */ char *doc; /* Documentation string. */ int *value; /* Address of value. */ char **choices; /* Array of strings or NULL if numeric only. */ } VARIABLE_ALIST; /* Read the name of an Info variable in the echo area and return the address of a VARIABLE_ALIST member. A return value of NULL indicates that no variable could be read. */ extern VARIABLE_ALIST *read_variable_name (); /* Make an array of REFERENCE which actually contains the names of the variables available in Info. */ extern REFERENCE **make_variable_completions_array (); /* Set the value of an info variable. */ extern void set_variable (); /* The list of user-visible variables. */ extern int auto_footnotes_p; extern int auto_tiling_p; extern int terminal_use_visible_bell_p; extern int info_error_rings_bell_p; extern int gc_compressed_files; extern int show_index_match; extern int info_scroll_behaviour; extern int window_scroll_step; extern int ISO_Latin_p; #endif /* _VARIABLES_H_ */ octave-1.1.0/info/gc.h100666 415 17 2575 5333267576 12665 0ustar jweusers/* gc.h -- Functions for garbage collecting unused node contents. */ /* This file is part of GNU Info, a program for reading online documentation stored in Info format. Copyright (C) 1993 Free Software Foundation, Inc. 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, 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., 675 Mass Ave, Cambridge, MA 02139, USA. Written by Brian Fox (bfox@ai.mit.edu). */ #if !defined (_GC_H_) #define _GC_H_ /* Add POINTER to the list of garbage collectible pointers. A pointer is not actually garbage collected until no info window contains a node whose contents member is equal to the pointer. */ extern void add_gcable_pointer (); /* Grovel the list of info windows and gc-able pointers finding those node->contents which are collectible, and free them. */ extern void gc_pointers (); #endif /* !_GC_H_ */ octave-1.1.0/readline/ 40777 415 17 0 5705521717 12636 5ustar jweusersoctave-1.1.0/readline/doc/ 40777 415 17 0 5705521714 13400 5ustar jweusersoctave-1.1.0/readline/doc/Makefile.in100666 415 17 1635 5662226330 15545 0ustar jweusers# # Makefile for octave's readline/doc directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf SOURCES = hist.texinfo hstech.texinfo hsuser.texinfo rlman.texinfo \ rltech.texinfo rluser.texinfo texindex.c DISTFILES = Makefile.in $(SOURCES) all: .PHONY: all check: all .PHONY: check install: all .PHONY: install uninstall: .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: .PHONY: clean mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/readline/doc .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/readline/doc .PHONY: dist octave-1.1.0/readline/doc/hist.texinfo100666 415 17 6560 5440717075 16054 0ustar jweusers\input texinfo @c -*-texinfo-*- @comment %**start of header (This is for running Texinfo on a region.) @setfilename history.info @settitle GNU Readline Library @comment %**end of header (This is for running Texinfo on a region.) @synindex vr fn @setchapternewpage odd @ifinfo This document describes the GNU History library, a programming tool that provides a consistent user interface for recalling lines of previously typed input. Copyright (C) 1988, 1991 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice pare preserved on all copies. @ignore Permission is granted to process this file through TeX and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @end ifinfo @titlepage @sp 10 @center @titlefont{GNU History Library} @center Brian Fox @center Free Software Foundation @center Version 1.1 @center April 1991 @c Include the Distribution inside the titlepage environment so @c that headings are turned off. @page This document describes the GNU History library, a programming tool that provides a consistent user interface for recalling lines of previously typed input. Published by the Free Software Foundation @* 675 Massachusetts Avenue, @* Cambridge, MA 02139 USA Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @vskip 0pt plus 1filll Copyright @copyright{} 1989, 1991 Free Software Foundation, Inc. @end titlepage @ifinfo @node Top @top GNU History Library This document describes the GNU History library, a programming tool that provides a consistent user interface for recalling lines of previously typed input. @menu * Using History Interactively:: GNU History User's Manual. * Programming with GNU History:: GNU History Programmer's Manual. * Concept Index:: Index of concepts described in this manual. * Function and Variable Index:: Index of externally visible functions and variables. @end menu @end ifinfo @include hsuser.texinfo @include hstech.texinfo @node Concept Index @appendix Concept Index @printindex cp @node Function and Variable Index @appendix Function and Variable Index @printindex vr @contents @bye octave-1.1.0/readline/doc/hstech.texinfo100666 415 17 24415 5440717075 16402 0ustar jweusers@ignore This file documents the user interface to the GNU History library. Copyright (C) 1988, 1991 Free Software Foundation, Inc. Authored by Brian Fox. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the GNU Copyright statement is available to the distributee, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ignore @node Programming with GNU History @chapter Programming with GNU History This chapter describes how to interface the GNU History Library with programs that you write. It should be considered a technical guide. For information on the interactive use of GNU History, @pxref{Using History Interactively}. @menu * Introduction to History:: What is the GNU History library for? * History Storage:: How information is stored. * History Functions:: Functions that you can use. * History Variables:: Variables that control behaviour. * History Programming Example:: Example of using the GNU History Library. @end menu @node Introduction to History @section Introduction to History Many programs read input from the user a line at a time. The GNU history library is able to keep track of those lines, associate arbitrary data with each line, and utilize information from previous lines in making up new ones. The programmer using the History library has available to him functions for remembering lines on a history stack, associating arbitrary data with a line, removing lines from the stack, searching through the stack for a line containing an arbitrary text string, and referencing any line on the stack directly. In addition, a history @dfn{expansion} function is available which provides for a consistent user interface across many different programs. The end-user using programs written with the History library has the benifit of a consistent user interface, with a set of well-known commands for manipulating the text of previous lines and using that text in new commands. The basic history manipulation commands are similar to the history substitution used by @code{Csh}. If the programmer desires, he can use the Readline library, which includes some history manipulation by default, and has the added advantage of Emacs style command line editing. @node History Storage @section History Storage @example typedef struct _hist_entry @{ char *line; char *data; @} HIST_ENTRY; @end example @node History Functions @section History Functions This section describes the calling sequence for the various functions present in GNU History. @defun {void using_history} () Begin a session in which the history functions might be used. This just initializes the interactive variables. @end defun @defun {void add_history} (char *string) Place @var{string} at the end of the history list. The associated data field (if any) is set to @code{NULL}. @end defun @defun {int where_history} () Returns the number which says what history element we are now looking at. @end defun @defun {int history_set_pos} (int pos) Set the position in the history list to @var{pos}. @end defun @defun {int history_search_pos} (char *string, int direction, int pos) Search for @var{string} in the history list, starting at @var{pos}, an absolute index into the list. @var{direction}, if negative, says to search backwards from @var{pos}, else forwards. Returns the absolute index of the history element where @var{string} was found, or -1 otherwise. @end defun @defun {HIST_ENTRY *remove_history} (); Remove history element @var{which} from the history. The removed element is returned to you so you can free the line, data, and containing structure. @end defun @defun {void stifle_history} (int max) Stifle the history list, remembering only @var{max} number of entries. @end defun @defun {int unstifle_history} (); Stop stifling the history. This returns the previous amount the history was stifled by. The value is positive if the history was stifled, negative if it wasn't. @end defun @defun {int read_history} (char *filename) Add the contents of @var{filename} to the history list, a line at a time. If @var{filename} is @code{NULL}, then read from @file{~/.history}. Returns 0 if successful, or errno if not. @end defun @defun {int read_history_range} (char *filename, int from, int to) Read a range of lines from @var{filename}, adding them to the history list. Start reading at the @var{from}'th line and end at the @var{to}'th. If @var{from} is zero, start at the beginning. If @var{to} is less than @var{from}, then read until the end of the file. If @var{filename} is @code{NULL}, then read from @file{~/.history}. Returns 0 if successful, or @code{errno} if not. @end defun @defun {int write_history} (char *filename) Append the current history to @var{filename}. If @var{filename} is @code{NULL}, then append the history list to @file{~/.history}. Values returned are as in @code{read_history ()}. @end defun @defun {int append_history} (int nelements, char *filename) Append @var{nelement} entries to @var{filename}. The entries appended are from the end of the list minus @var{nelements} up to the end of the list. @end defun @defun {HIST_ENTRY *replace_history_entry} () Make the history entry at @var{which} have @var{line} and @var{data}. This returns the old entry so you can dispose of the data. In the case of an invalid @var{which}, a @code{NULL} pointer is returned. @end defun @defun {HIST_ENTRY *current_history} () Return the history entry at the current position, as determined by @code{history_offset}. If there is no entry there, return a @code{NULL} pointer. @end defun @defun {HIST_ENTRY *previous_history} () Back up @var{history_offset} to the previous history entry, and return a pointer to that entry. If there is no previous entry, return a @code{NULL} pointer. @end defun @defun {HIST_ENTRY *next_history} () Move @code{history_offset} forward to the next history entry, and return the a pointer to that entry. If there is no next entry, return a @code{NULL} pointer. @end defun @defun {HIST_ENTRY **history_list} () Return a @code{NULL} terminated array of @code{HIST_ENTRY} which is the current input history. Element 0 of this list is the beginning of time. If there is no history, return @code{NULL}. @end defun @defun {int history_search} (char *string, int direction) Search the history for @var{string}, starting at @code{history_offset}. If @var{direction} < 0, then the search is through previous entries, else through subsequent. If @var{string} is found, then @code{current_history ()} is the history entry, and the value of this function is the offset in the line of that history entry that the @var{string} was found in. Otherwise, nothing is changed, and a -1 is returned. @end defun @defun {int history_expand} (char *string, char **output) Expand @var{string}, placing the result into @var{output}, a pointer to a string. Returns: @table @code @item 0 If no expansions took place (or, if the only change in the text was the de-slashifying of the history expansion character), @item 1 if expansions did take place, or @item -1 if there was an error in expansion. @end table If an error ocurred in expansion, then @var{output} contains a descriptive error message. @end defun @defun {char *history_arg_extract} (int first, int last, char *string) Extract a string segment consisting of the @var{first} through @var{last} arguments present in @var{string}. Arguments are broken up as in the GNU Bash shell. @end defun @defun {int history_total_bytes} (); Return the number of bytes that the primary history entries are using. This just adds up the lengths of @code{the_history->lines}. @end defun @node History Variables @section History Variables This section describes the variables in GNU History that are externally visible. @defvar {int history_base} For convenience only. You set this when interpreting history commands. It is the logical offset of the first history element. @end defvar @node History Programming Example @section History Programming Example The following snippet of code demonstrates simple use of the GNU History Library. @smallexample main () @{ char line[1024], *t; int done = 0; line[0] = 0; while (!done) @{ fprintf (stdout, "history%% "); t = gets (line); if (!t) strcpy (line, "quit"); if (line[0]) @{ char *expansion; int result; using_history (); result = history_expand (line, &expansion); strcpy (line, expansion); free (expansion); if (result) fprintf (stderr, "%s\n", line); if (result < 0) continue; add_history (line); @} if (strcmp (line, "quit") == 0) done = 1; if (strcmp (line, "save") == 0) write_history (0); if (strcmp (line, "read") == 0) read_history (0); if (strcmp (line, "list") == 0) @{ register HIST_ENTRY **the_list = history_list (); register int i; if (the_list) for (i = 0; the_list[i]; i++) fprintf (stdout, "%d: %s\n", i + history_base, the_list[i]->line); @} if (strncmp (line, "delete", strlen ("delete")) == 0) @{ int which; if ((sscanf (line + strlen ("delete"), "%d", &which)) == 1) @{ HIST_ENTRY *entry = remove_history (which); if (!entry) fprintf (stderr, "No such entry %d\n", which); else @{ free (entry->line); free (entry); @} @} else @{ fprintf (stderr, "non-numeric arg given to `delete'\n"); @} @} @} @} @end smallexample octave-1.1.0/readline/doc/hsuser.texinfo100666 415 17 11714 5440717075 16433 0ustar jweusers@ignore This file documents the user interface to the GNU History library. Copyright (C) 1988, 1991 Free Software Foundation, Inc. Authored by Brian Fox. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the GNU Copyright statement is available to the distributee, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ignore @node Using History Interactively @chapter Using History Interactively @ifset BashFeatures This chapter describes how to use the GNU History Library interactively, from a user's standpoint. It should be considered a user's guide. For information on using the GNU History Library in your own programs, see the GNU Readline Library Manual. @end ifset @ifclear BashFeatures This chapter describes how to use the GNU History Library interactively, from a user's standpoint. It should be considered a user's guide. For information on using the GNU History Library in your own programs, @pxref{Programming with GNU History}. @end ifclear @menu * History Interaction:: What it feels like using History as a user. @end menu @node History Interaction @section History Interaction @cindex expansion The History library provides a history expansion feature that is similar to the history expansion in Csh. The following text describes the sytax that you use to manipulate the history information. History expansion takes place in two parts. The first is to determine which line from the previous history should be used during substitution. The second is to select portions of that line for inclusion into the current one. The line selected from the previous history is called the @dfn{event}, and the portions of that line that are acted upon are called @dfn{words}. The line is broken into words in the same fashion that the Bash shell does, so that several English (or Unix) words surrounded by quotes are considered as one word. @menu * Event Designators:: How to specify which history line to use. * Word Designators:: Specifying which words are of interest. * Modifiers:: Modifying the results of susbstitution. @end menu @node Event Designators @subsection Event Designators @cindex event designators An event designator is a reference to a command line entry in the history list. @table @asis @item @code{!} Start a history subsititution, except when followed by a space, tab, or the end of the line... @key{=} or @key{(}. @item @code{!!} Refer to the previous command. This is a synonym for @code{!-1}. @item @code{!n} Refer to command line @var{n}. @item @code{!-n} Refer to the command line @var{n} lines back. @item @code{!string} Refer to the most recent command starting with @var{string}. @item @code{!?string}[@code{?}] Refer to the most recent command containing @var{string}. @end table @node Word Designators @subsection Word Designators A @key{:} separates the event specification from the word designator. It can be omitted if the word designator begins with a @key{^}, @key{$}, @key{*} or @key{%}. Words are numbered from the beginning of the line, with the first word being denoted by a 0 (zero). @table @code @item 0 (zero) The zero'th word. For many applications, this is the command word. @item n The @var{n}'th word. @item ^ The first argument. that is, word 1. @item $ The last argument. @item % The word matched by the most recent @code{?string?} search. @item x-y A range of words; @code{-@var{y}} Abbreviates @code{0-@var{y}}. @item * All of the words, excepting the zero'th. This is a synonym for @code{1-$}. It is not an error to use @key{*} if there is just one word in the event. The empty string is returned in that case. @end table @node Modifiers @subsection Modifiers After the optional word designator, you can add a sequence of one or more of the following modifiers, each preceded by a @key{:}. @table @code @item # The entire command line typed so far. This means the current command, not the previous command, so it really isn't a word designator, and doesn't belong in this section. @item h Remove a trailing pathname component, leaving only the head. @item r Remove a trailing suffix of the form @samp{.}@var{suffix}, leaving the basename. @item e Remove all but the suffix. @item t Remove all leading pathname components, leaving the tail. @item p Print the new command but do not execute it. @end table octave-1.1.0/readline/doc/rlman.texinfo100666 415 17 6531 5440717075 16214 0ustar jweusers\input texinfo @c -*-texinfo-*- @comment %**start of header (This is for running Texinfo on a region.) @setfilename readline.info @settitle GNU Readline Library @comment %**end of header (This is for running Texinfo on a region.) @synindex vr fn @setchapternewpage odd @ifinfo This document describes the GNU Readline Library, a utility which aids in the consistency of user interface across discrete programs that need to provide a command line interface. Copyright (C) 1988, 1991 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice pare preserved on all copies. @ignore Permission is granted to process this file through TeX and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @end ifinfo @titlepage @sp 10 @center @titlefont{GNU Readline Library} @center Brian Fox @center Free Software Foundation @center Version 1.1 @center April 1991 @page This document describes the GNU Readline Library, a utility which aids in the consistency of user interface across discrete programs that need to provide a command line interface. Published by the Free Software Foundation @* 675 Massachusetts Avenue, @* Cambridge, MA 02139 USA Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @vskip 0pt plus 1filll Copyright @copyright{} 1989, 1991 Free Software Foundation, Inc. @end titlepage @ifinfo @node Top @top GNU Readline Library This document describes the GNU Readline Library, a utility which aids in the consistency of user interface across discrete programs that need to provide a command line interface. @menu * Command Line Editing:: GNU Readline User's Manual. * Programming with GNU Readline:: GNU Readline Programmer's Manual. * Concept Index:: Index of concepts described in this manual. * Function and Variable Index:: Index of externally visible functions and variables. @end menu @end ifinfo @include rluser.texinfo @include rltech.texinfo @node Concept Index @unnumbered Concept Index @printindex cp @node Function and Variable Index @unnumbered Function and Variable Index @printindex fn @contents @bye octave-1.1.0/readline/doc/rltech.texinfo100666 415 17 77400 5440717075 16407 0ustar jweusers@comment %**start of header (This is for running Texinfo on a region.) @setfilename rltech.info @comment %**end of header (This is for running Texinfo on a region.) @setchapternewpage odd @ifinfo This document describes the GNU Readline Library, a utility for aiding in the consitency of user interface across discrete programs that need to provide a command line interface. Copyright (C) 1988 Free Software Foundation, Inc. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice pare preserved on all copies. @ignore Permission is granted to process this file through TeX and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the Foundation. @end ifinfo @node Programming with GNU Readline @chapter Programming with GNU Readline This manual describes the interface between the GNU Readline Library and user programs. If you are a programmer, and you wish to include the features found in GNU Readline in your own programs, such as completion, line editing, and interactive history manipulation, this documentation is for you. @menu * Default Behaviour:: Using the default behaviour of Readline. * Custom Functions:: Adding your own functions to Readline. * Custom Completers:: Supplanting or supplementing Readline's completion functions. @end menu @node Default Behaviour @section Default Behaviour Many programs provide a command line interface, such as @code{mail}, @code{ftp}, and @code{sh}. For such programs, the default behaviour of Readline is sufficient. This section describes how to use Readline in the simplest way possible, perhaps to replace calls in your code to @code{gets ()}. @findex readline () @cindex readline, function The function @code{readline} prints a prompt and then reads and returns a single line of text from the user. The line which @code{readline ()} returns is allocated with @code{malloc ()}; you should @code{free ()} the line when you are done with it. The declaration for @code{readline} in ANSI C is @example @code{char *readline (char *@var{prompt});} @end example So, one might say @example @code{char *line = readline ("Enter a line: ");} @end example in order to read a line of text from the user. The line which is returned has the final newline removed, so only the text of the line remains. If readline encounters an @code{EOF} while reading the line, and the line is empty at that point, then @code{(char *)NULL} is returned. Otherwise, the line is ended just as if a newline was typed. If you want the user to be able to get at the line later, (with @key{C-p} for example), you must call @code{add_history ()} to save the line away in a @dfn{history} list of such lines. @example @code{add_history (line)}; @end example For full details on the GNU History Library, see the associated manual. It is polite to avoid saving empty lines on the history list, since it is rare than someone has a burning need to reuse a blank line. Here is a function which usefully replaces the standard @code{gets ()} library function: @example /* A static variable for holding the line. */ static char *line_read = (char *)NULL; /* Read a string, and return a pointer to it. Returns NULL on EOF. */ char * do_gets () @{ /* If the buffer has already been allocated, return the memory to the free pool. */ if (line_read != (char *)NULL) @{ free (line_read); line_read = (char *)NULL; @} /* Get a line from the user. */ line_read = readline (""); /* If the line has any text in it, save it on the history. */ if (line_read && *line_read) add_history (line_read); return (line_read); @} @end example The above code gives the user the default behaviour of @key{TAB} completion: completion on file names. If you do not want readline to complete on filenames, you can change the binding of the @key{TAB} key with @code{rl_bind_key ()}. @findex rl_bind_key () @example @code{int rl_bind_key (int @var{key}, int (*@var{function})());} @end example @code{rl_bind_key ()} takes 2 arguments; @var{key} is the character that you want to bind, and @var{function} is the address of the function to run when @var{key} is pressed. Binding @key{TAB} to @code{rl_insert ()} makes @key{TAB} just insert itself. @code{rl_bind_key ()} returns non-zero if @var{key} is not a valid ASCII character code (between 0 and 255). @example @code{rl_bind_key ('\t', rl_insert);} @end example This code should be executed once at the start of your program; you might write a function called @code{initialize_readline ()} which performs this and other desired initializations, such as installing custom completers, etc. @node Custom Functions @section Custom Functions Readline provides a great many functions for manipulating the text of the line. But it isn't possible to anticipate the needs of all programs. This section describes the various functions and variables defined in within the Readline library which allow a user program to add customized functionality to Readline. @menu * The Function Type:: C declarations to make code readable. * Function Naming:: How to give a function you write a name. * Keymaps:: Making keymaps. * Binding Keys:: Changing Keymaps. * Function Writing:: Variables and calling conventions. * Allowing Undoing:: How to make your functions undoable. @end menu @node The Function Type @subsection The Function Type For the sake of readabilty, we declare a new type of object, called @dfn{Function}. A @code{Function} is a C language function which returns an @code{int}. The type declaration for @code{Function} is: @noindent @code{typedef int Function ();} The reason for declaring this new type is to make it easier to write code describing pointers to C functions. Let us say we had a variable called @var{func} which was a pointer to a function. Instead of the classic C declaration @code{int (*)()func;} we have @code{Function *func;} @node Function Naming @subsection Naming a Function The user can dynamically change the bindings of keys while using Readline. This is done by representing the function with a descriptive name. The user is able to type the descriptive name when referring to the function. Thus, in an init file, one might find @example Meta-Rubout: backward-kill-word @end example This binds the keystroke @key{Meta-Rubout} to the function @emph{descriptively} named @code{backward-kill-word}. You, as the programmer, should bind the functions you write to descriptive names as well. Readline provides a function for doing that: @defun rl_add_defun (char *name, Function *function, int key) Add @var{name} to the list of named functions. Make @var{function} be the function that gets called. If @var{key} is not -1, then bind it to @var{function} using @code{rl_bind_key ()}. @end defun Using this function alone is sufficient for most applications. It is the recommended way to add a few functions to the default functions that Readline has built in already. If you need to do more or different things than adding a function to Readline, you may need to use the underlying functions described below. @node Keymaps @subsection Selecting a Keymap Key bindings take place on a @dfn{keymap}. The keymap is the association between the keys that the user types and the functions that get run. You can make your own keymaps, copy existing keymaps, and tell Readline which keymap to use. @defun {Keymap rl_make_bare_keymap} () Returns a new, empty keymap. The space for the keymap is allocated with @code{malloc ()}; you should @code{free ()} it when you are done. @end defun @defun {Keymap rl_copy_keymap} (Keymap map) Return a new keymap which is a copy of @var{map}. @end defun @defun {Keymap rl_make_keymap} () Return a new keymap with the printing characters bound to rl_insert, the lowercase Meta characters bound to run their equivalents, and the Meta digits bound to produce numeric arguments. @end defun @node Binding Keys @subsection Binding Keys You associate keys with functions through the keymap. Here are functions for doing that. @defun {int rl_bind_key} (int key, Function *function) Binds @var{key} to @var{function} in the currently selected keymap. Returns non-zero in the case of an invalid @var{key}. @end defun @defun {int rl_bind_key_in_map} (int key, Function *function, Keymap map) Bind @var{key} to @var{function} in @var{map}. Returns non-zero in the case of an invalid @var{key}. @end defun @defun {int rl_unbind_key} (int key) Make @var{key} do nothing in the currently selected keymap. Returns non-zero in case of error. @end defun @defun {int rl_unbind_key_in_map} (int key, Keymap map) Make @var{key} be bound to the null function in @var{map}. Returns non-zero in case of error. @end defun @defun rl_generic_bind (int type, char *keyseq, char *data, Keymap map) Bind the key sequence represented by the string @var{keyseq} to the arbitrary pointer @var{data}. @var{type} says what kind of data is pointed to by @var{data}; right now this can be a function (@code{ISFUNC}), a macro (@code{ISMACR}), or a keymap (@code{ISKMAP}). This makes new keymaps as necessary. The initial place to do bindings is in @var{map}. @end defun @node Function Writing @subsection Writing a New Function In order to write new functions for Readline, you need to know the calling conventions for keyboard invoked functions, and the names of the variables that describe the current state of the line gathered so far. @defvar {char *rl_line_buffer} This is the line gathered so far. You are welcome to modify the contents of this, but see Undoing, below. @end defvar @defvar {int rl_point} The offset of the current cursor position in @var{rl_line_buffer}. @end defvar @defvar {int rl_end} The number of characters present in @code{rl_line_buffer}. When @code{rl_point} is at the end of the line, then @code{rl_point} and @code{rl_end} are equal. @end defvar The calling sequence for a command @code{foo} looks like @example @code{foo (int count, int key)} @end example where @var{count} is the numeric argument (or 1 if defaulted) and @var{key} is the key that invoked this function. It is completely up to the function as to what should be done with the numeric argument; some functions use it as a repeat count, other functions as a flag, and some choose to ignore it. In general, if a function uses the numeric argument as a repeat count, it should be able to do something useful with a negative argument as well as a positive argument. At the very least, it should be aware that it can be passed a negative argument. @node Allowing Undoing @subsection Allowing Undoing Supporting the undo command is a painless thing to do, and makes your functions much more useful to the end user. It is certainly easy to try something if you know you can undo it. I could use an undo function for the stock market. If your function simply inserts text once, or deletes text once, and it calls @code{rl_insert_text ()} or @code{rl_delete_text ()} to do it, then undoing is already done for you automatically, and you can safely skip this section. If you do multiple insertions or multiple deletions, or any combination of these operations, you should group them together into one operation. This can be done with @code{rl_begin_undo_group ()} and @code{rl_end_undo_group ()}. @defun rl_begin_undo_group () Begins saving undo information in a group construct. The undo information usually comes from calls to @code{rl_insert_text ()} and @code{rl_delete_text ()}, but they could be direct calls to @code{rl_add_undo ()}. @end defun @defun rl_end_undo_group () Closes the current undo group started with @code{rl_begin_undo_group ()}. There should be exactly one call to @code{rl_end_undo_group ()} for every call to @code{rl_begin_undo_group ()}. @end defun Finally, if you neither insert nor delete text, but directly modify the existing text (e.g. change its case), you call @code{rl_modifying ()} once, just before you modify the text. You must supply the indices of the text range that you are going to modify. @defun rl_modifying (int start, int end) Tell Readline to save the text between @var{start} and @var{end} as a single undo unit. It is assumed that subsequent to this call you will modify that range of text in some way. @end defun @subsection An Example Here is a function which changes lowercase characters to the uppercase equivalents, and uppercase characters to the lowercase equivalents. If this function was bound to @samp{M-c}, then typing @samp{M-c} would change the case of the character under point. Typing @samp{10 M-c} would change the case of the following 10 characters, leaving the cursor on the last character changed. @example /* Invert the case of the COUNT following characters. */ invert_case_line (count, key) int count, key; @{ register int start, end; start = rl_point; if (count < 0) @{ direction = -1; count = -count; @} else direction = 1; /* Find the end of the range to modify. */ end = start + (count * direction); /* Force it to be within range. */ if (end > rl_end) end = rl_end; else if (end < 0) end = -1; if (start > end) @{ int temp = start; start = end; end = temp; @} if (start == end) return; /* Tell readline that we are modifying the line, so save the undo information. */ rl_modifying (start, end); for (; start != end; start += direction) @{ if (uppercase_p (rl_line_buffer[start])) rl_line_buffer[start] = to_lower (rl_line_buffer[start]); else if (lowercase_p (rl_line_buffer[start])) rl_line_buffer[start] = to_upper (rl_line_buffer[start]); @} /* Move point to on top of the last character changed. */ rl_point = end - direction; @} @end example @node Custom Completers @section Custom Completers Typically, a program that reads commands from the user has a way of disambiguating commands and data. If your program is one of these, then it can provide completion for either commands, or data, or both commands and data. The following sections describe how your program and Readline cooperate to provide this service to end users. @menu * How Completing Works:: The logic used to do completion. * Completion Functions:: Functions provided by Readline. * Completion Variables:: Variables which control completion. * A Short Completion Example:: An example of writing completer subroutines. @end menu @node How Completing Works @subsection How Completing Works In order to complete some text, the full list of possible completions must be available. That is to say, it is not possible to accurately expand a partial word without knowing what all of the possible words that make sense in that context are. The GNU Readline library provides the user interface to completion, and additionally, two of the most common completion functions; filename and username. For completing other types of text, you must write your own completion function. This section describes exactly what those functions must do, and provides an example function. There are three major functions used to perform completion: @enumerate @item The user-interface function @code{rl_complete ()}. This function is called interactively with the same calling conventions as other functions in readline intended for interactive use; i.e. @var{count}, and @var{invoking-key}. It isolates the word to be completed and calls @code{completion_matches ()} to generate a list of possible completions. It then either lists the possible completions or actually performs the completion, depending on which behaviour is desired. @item The internal function @code{completion_matches ()} uses your @dfn{generator} function to generate the list of possible matches, and then returns the array of these matches. You should place the address of your generator function in @code{rl_completion_entry_function}. @item The generator function is called repeatedly from @code{completion_matches ()}, returning a string each time. The arguments to the generator function are @var{text} and @var{state}. @var{text} is the partial word to be completed. @var{state} is zero the first time the function is called, and a positive non-zero integer for each subsequent call. When the generator function returns @code{(char *)NULL} this signals @code{completion_matches ()} that there are no more possibilities left. @end enumerate @defun rl_complete (int ignore, int invoking_key) Complete the word at or before point. You have supplied the function that does the initial simple matching selection algorithm (see @code{completion_matches ()}). The default is to do filename completion. @end defun Note that @code{rl_complete ()} has the identical calling conventions as any other key-invokable function; this is because by default it is bound to the @samp{TAB} key. @defvar {Function *rl_completion_entry_function} This is a pointer to the generator function for @code{completion_matches ()}. If the value of @code{rl_completion_entry_function} is @code{(Function *)NULL} then the default filename generator function is used, namely @code{filename_entry_function ()}. @end defvar @node Completion Functions @subsection Completion Functions Here is the complete list of callable completion functions present in Readline. @defun rl_complete_internal (int what_to_do) Complete the word at or before point. @var{what_to_do} says what to do with the completion. A value of @samp{?} means list the possible completions. @samp{TAB} means do standard completion. @samp{*} means insert all of the possible completions. @end defun @defun rl_complete (int ignore, int invoking_key) Complete the word at or before point. You have supplied the function that does the initial simple matching selection algorithm (see @code{completion_matches ()}). The default is to do filename completion. This just calls @code{rl_complete_internal ()} with an argument of @samp{TAB}. @end defun @defun rl_possible_completions () List the possible completions. See description of @code{rl_complete ()}. This just calls @code{rl_complete_internal ()} with an argument of @samp{?}. @end defun @defun {char **completion_matches} (char *text, char *(*entry_function) ()) Returns an array of @code{(char *)} which is a list of completions for @var{text}. If there are no completions, returns @code{(char **)NULL}. The first entry in the returned array is the substitution for @var{text}. The remaining entries are the possible completions. The array is terminated with a @code{NULL} pointer. @var{entry_function} is a function of two args, and returns a @code{(char *)}. The first argument is @var{text}. The second is a state argument; it is zero on the first call, and non-zero on subsequent calls. It returns a @code{NULL} pointer to the caller when there are no more matches. @end defun @defun {char *filename_completion_function} (char *text, int state) A generator function for filename completion in the general case. Note that completion in the Bash shell is a little different because of all the pathnames that must be followed when looking up the completion for a command. @end defun @defun {char *username_completion_function} (char *text, int state) A completion generator for usernames. @var{text} contains a partial username preceded by a random character (usually @samp{~}). @end defun @node Completion Variables @subsection Completion Variables @defvar {Function *rl_completion_entry_function} A pointer to the generator function for @code{completion_matches ()}. @code{NULL} means to use @code{filename_entry_function ()}, the default filename completer. @end defvar @defvar {Function *rl_attempted_completion_function} A pointer to an alternative function to create matches. The function is called with @var{text}, @var{start}, and @var{end}. @var{start} and @var{end} are indices in @code{rl_line_buffer} saying what the boundaries of @var{text} are. If this function exists and returns @code{NULL} then @code{rl_complete ()} will call the value of @code{rl_completion_entry_function} to generate matches, otherwise the array of strings returned will be used. @end defvar @defvar {int rl_completion_query_items} Up to this many items will be displayed in response to a possible-completions call. After that, we ask the user if she is sure she wants to see them all. The default value is 100. @end defvar @defvar {char *rl_basic_word_break_characters} The basic list of characters that signal a break between words for the completer routine. The contents of this variable is what breaks words in the Bash shell, i.e. " \t\n\"\\'`@@$><=;|&@{(". @end defvar @defvar {char *rl_completer_word_break_characters} The list of characters that signal a break between words for @code{rl_complete_internal ()}. The default list is the contents of @code{rl_basic_word_break_characters}. @end defvar @defvar {char *rl_special_prefixes} The list of characters that are word break characters, but should be left in @var{text} when it is passed to the completion function. Programs can use this to help determine what kind of completing to do. @end defvar @defvar {int rl_ignore_completion_duplicates} If non-zero, then disallow duplicates in the matches. Default is 1. @end defvar @defvar {int rl_filename_completion_desired} Non-zero means that the results of the matches are to be treated as filenames. This is @emph{always} zero on entry, and can only be changed within a completion entry generator function. @end defvar @defvar {Function *rl_ignore_some_completions_function} This function, if defined, is called by the completer when real filename completion is done, after all the matching names have been generated. It is passed a @code{NULL} terminated array of @code{(char *)} known as @var{matches} in the code. The 1st element (@code{matches[0]}) is the maximal substring that is common to all matches. This function can re-arrange the list of matches as required, but each deleted element of the array must be @code{free()}'d. @end defvar @node A Short Completion Example @subsection A Short Completion Example Here is a small application demonstrating the use of the GNU Readline library. It is called @code{fileman}, and the source code resides in @file{readline/examples/fileman.c}. This sample application provides completion of command names, line editing features, and access to the history list. @page @smallexample /* fileman.c -- A tiny application which demonstrates how to use the GNU Readline library. This application interactively allows users to manipulate files and their modes. */ #include #include #include #include #include #include #include /* The names of functions that actually do the manipulation. */ int com_list (), com_view (), com_rename (), com_stat (), com_pwd (); int com_delete (), com_help (), com_cd (), com_quit (); /* A structure which contains information on the commands this program can understand. */ typedef struct @{ char *name; /* User printable name of the function. */ Function *func; /* Function to call to do the job. */ char *doc; /* Documentation for this function. */ @} COMMAND; COMMAND commands[] = @{ @{ "cd", com_cd, "Change to directory DIR" @}, @{ "delete", com_delete, "Delete FILE" @}, @{ "help", com_help, "Display this text" @}, @{ "?", com_help, "Synonym for `help'" @}, @{ "list", com_list, "List files in DIR" @}, @{ "ls", com_list, "Synonym for `list'" @}, @{ "pwd", com_pwd, "Print the current working directory" @}, @{ "quit", com_quit, "Quit using Fileman" @}, @{ "rename", com_rename, "Rename FILE to NEWNAME" @}, @{ "stat", com_stat, "Print out statistics on FILE" @}, @{ "view", com_view, "View the contents of FILE" @}, @{ (char *)NULL, (Function *)NULL, (char *)NULL @} @}; /* The name of this program, as taken from argv[0]. */ char *progname; /* When non-zero, this global means the user is done using this program. */ int done = 0; @page main (argc, argv) int argc; char **argv; @{ progname = argv[0]; initialize_readline (); /* Bind our completer. */ /* Loop reading and executing lines until the user quits. */ while (!done) @{ char *line; line = readline ("FileMan: "); if (!line) @{ done = 1; /* Encountered EOF at top level. */ @} else @{ /* Remove leading and trailing whitespace from the line. Then, if there is anything left, add it to the history list and execute it. */ stripwhite (line); if (*line) @{ add_history (line); execute_line (line); @} @} if (line) free (line); @} exit (0); @} /* Execute a command line. */ execute_line (line) char *line; @{ register int i; COMMAND *find_command (), *command; char *word; /* Isolate the command word. */ i = 0; while (line[i] && !whitespace (line[i])) i++; word = line; if (line[i]) line[i++] = '\0'; command = find_command (word); if (!command) @{ fprintf (stderr, "%s: No such command for FileMan.\n", word); return; @} /* Get argument to command, if any. */ while (whitespace (line[i])) i++; word = line + i; /* Call the function. */ (*(command->func)) (word); @} /* Look up NAME as the name of a command, and return a pointer to that command. Return a NULL pointer if NAME isn't a command name. */ COMMAND * find_command (name) char *name; @{ register int i; for (i = 0; commands[i].name; i++) if (strcmp (name, commands[i].name) == 0) return (&commands[i]); return ((COMMAND *)NULL); @} /* Strip whitespace from the start and end of STRING. */ stripwhite (string) char *string; @{ register int i = 0; while (whitespace (string[i])) i++; if (i) strcpy (string, string + i); i = strlen (string) - 1; while (i > 0 && whitespace (string[i])) i--; string[++i] = '\0'; @} @page /* **************************************************************** */ /* */ /* Interface to Readline Completion */ /* */ /* **************************************************************** */ /* Tell the GNU Readline library how to complete. We want to try to complete on command names if this is the first word in the line, or on filenames if not. */ initialize_readline () @{ char **fileman_completion (); /* Allow conditional parsing of the ~/.inputrc file. */ rl_readline_name = "FileMan"; /* Tell the completer that we want a crack first. */ rl_attempted_completion_function = (Function *)fileman_completion; @} /* Attempt to complete on the contents of TEXT. START and END show the region of TEXT that contains the word to complete. We can use the entire line in case we want to do some simple parsing. Return the array of matches, or NULL if there aren't any. */ char ** fileman_completion (text, start, end) char *text; int start, end; @{ char **matches; char *command_generator (); matches = (char **)NULL; /* If this word is at the start of the line, then it is a command to complete. Otherwise it is the name of a file in the current directory. */ if (start == 0) matches = completion_matches (text, command_generator); return (matches); @} /* Generator function for command completion. STATE lets us know whether to start from scratch; without any state (i.e. STATE == 0), then we start at the top of the list. */ char * command_generator (text, state) char *text; int state; @{ static int list_index, len; char *name; /* If this is a new word to complete, initialize now. This includes saving the length of TEXT for efficiency, and initializing the index variable to 0. */ if (!state) @{ list_index = 0; len = strlen (text); @} /* Return the next name which partially matches from the command list. */ while (name = commands[list_index].name) @{ list_index++; if (strncmp (name, text, len) == 0) return (name); @} /* If no names matched, then return NULL. */ return ((char *)NULL); @} @page /* **************************************************************** */ /* */ /* FileMan Commands */ /* */ /* **************************************************************** */ /* String to pass to system (). This is for the LIST, VIEW and RENAME commands. */ static char syscom[1024]; /* List the file(s) named in arg. */ com_list (arg) char *arg; @{ if (!arg) arg = "*"; sprintf (syscom, "ls -FClg %s", arg); system (syscom); @} com_view (arg) char *arg; @{ if (!valid_argument ("view", arg)) return; sprintf (syscom, "cat %s | more", arg); system (syscom); @} com_rename (arg) char *arg; @{ too_dangerous ("rename"); @} com_stat (arg) char *arg; @{ struct stat finfo; if (!valid_argument ("stat", arg)) return; if (stat (arg, &finfo) == -1) @{ perror (arg); return; @} printf ("Statistics for `%s':\n", arg); printf ("%s has %d link%s, and is %d bytes in length.\n", arg, finfo.st_nlink, (finfo.st_nlink == 1) ? "" : "s", finfo.st_size); printf (" Created on: %s", ctime (&finfo.st_ctime)); printf (" Last access at: %s", ctime (&finfo.st_atime)); printf ("Last modified at: %s", ctime (&finfo.st_mtime)); @} com_delete (arg) char *arg; @{ too_dangerous ("delete"); @} /* Print out help for ARG, or for all of the commands if ARG is not present. */ com_help (arg) char *arg; @{ register int i; int printed = 0; for (i = 0; commands[i].name; i++) @{ if (!*arg || (strcmp (arg, commands[i].name) == 0)) @{ printf ("%s\t\t%s.\n", commands[i].name, commands[i].doc); printed++; @} @} if (!printed) @{ printf ("No commands match `%s'. Possibilties are:\n", arg); for (i = 0; commands[i].name; i++) @{ /* Print in six columns. */ if (printed == 6) @{ printed = 0; printf ("\n"); @} printf ("%s\t", commands[i].name); printed++; @} if (printed) printf ("\n"); @} @} /* Change to the directory ARG. */ com_cd (arg) char *arg; @{ if (chdir (arg) == -1) perror (arg); com_pwd (""); @} /* Print out the current working directory. */ com_pwd (ignore) char *ignore; @{ char dir[1024]; (void) getwd (dir); printf ("Current directory is %s\n", dir); @} /* The user wishes to quit using this program. Just set DONE non-zero. */ com_quit (arg) char *arg; @{ done = 1; @} /* Function which tells you that you can't do this. */ too_dangerous (caller) char *caller; @{ fprintf (stderr, "%s: Too dangerous for me to distribute. Write it yourself.\n", caller); @} /* Return non-zero if ARG is a valid argument for CALLER, else print an error message and return zero. */ int valid_argument (caller, arg) char *caller, *arg; @{ if (!arg || !*arg) @{ fprintf (stderr, "%s: Argument required.\n", caller); return (0); @} return (1); @} @end smallexample octave-1.1.0/readline/doc/rluser.texinfo100666 415 17 46321 5440717075 16440 0ustar jweusers@comment %**start of header (This is for running Texinfo on a region.) @setfilename rluser.info @comment %**end of header (This is for running Texinfo on a region.) @setchapternewpage odd @ignore This file documents the end user interface to the GNU command line editing feautres. It is to be an appendix to manuals for programs which use these features. There is a document entitled "readline.texinfo" which contains both end-user and programmer documentation for the GNU Readline Library. Copyright (C) 1988 Free Software Foundation, Inc. Authored by Brian Fox. Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the GNU Copyright statement is available to the distributee, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ignore @comment If you are including this manual as an appendix, then set the @comment variable readline-appendix. @node Command Line Editing @chapter Command Line Editing This text describes GNU's command line editing interface. @menu * Introduction and Notation:: Notation used in this text. * Readline Interaction:: The minimum set of commands for editing a line. * Readline Init File:: Customizing Readline from a user's view. @end menu @node Introduction and Notation @section Introduction to Line Editing The following paragraphs describe the notation we use to represent keystrokes. The text @key{C-k} is read as `Control-K' and describes the character produced when the Control key is depressed and the @key{k} key is struck. The text @key{M-k} is read as `Meta-K' and describes the character produced when the meta key (if you have one) is depressed, and the @key{k} key is struck. If you do not have a meta key, the identical keystroke can be generated by typing @key{ESC} @i{first}, and then typing @key{k}. Either process is known as @dfn{metafying} the @key{k} key. The text @key{M-C-k} is read as `Meta-Control-k' and describes the character produced by @dfn{metafying} @key{C-k}. In addition, several keys have their own names. Specifically, @key{DEL}, @key{ESC}, @key{LFD}, @key{SPC}, @key{RET}, and @key{TAB} all stand for themselves when seen in this text, or in an init file (@pxref{Readline Init File}, for more info). @node Readline Interaction @section Readline Interaction @cindex interaction, readline Often during an interactive session you type in a long line of text, only to notice that the first word on the line is misspelled. The Readline library gives you a set of commands for manipulating the text as you type it in, allowing you to just fix your typo, and not forcing you to retype the majority of the line. Using these editing commands, you move the cursor to the place that needs correction, and delete or insert the text of the corrections. Then, when you are satisfied with the line, you simply press @key{RETURN}. You do not have to be at the end of the line to press @key{RETURN}; the entire line is accepted regardless of the location of the cursor within the line. @menu * Readline Bare Essentials:: The least you need to know about Readline. * Readline Movement Commands:: Moving about the input line. * Readline Killing Commands:: How to delete text, and how to get it back! * Readline Arguments:: Giving numeric arguments to commands. @end menu @node Readline Bare Essentials @subsection Readline Bare Essentials In order to enter characters into the line, simply type them. The typed character appears where the cursor was, and then the cursor moves one space to the right. If you mistype a character, you can use @key{DEL} to back up, and delete the mistyped character. Sometimes you may miss typing a character that you wanted to type, and not notice your error until you have typed several other characters. In that case, you can type @key{C-b} to move the cursor to the left, and then correct your mistake. Aftwerwards, you can move the cursor to the right with @key{C-f}. When you add text in the middle of a line, you will notice that characters to the right of the cursor get `pushed over' to make room for the text that you have inserted. Likewise, when you delete text behind the cursor, characters to the right of the cursor get `pulled back' to fill in the blank space created by the removal of the text. A list of the basic bare essentials for editing the text of an input line follows. @table @asis @item @key{C-b} Move back one character. @item @key{C-f} Move forward one character. @item @key{DEL} Delete the character to the left of the cursor. @item @key{C-d} Delete the character underneath the cursor. @item @w{Printing characters} Insert itself into the line at the cursor. @item @key{C-_} Undo the last thing that you did. You can undo all the way back to an empty line. @end table @node Readline Movement Commands @subsection Readline Movement Commands The above table describes the most basic possible keystrokes that you need in order to do editing of the input line. For your convenience, many other commands have been added in addition to @key{C-b}, @key{C-f}, @key{C-d}, and @key{DEL}. Here are some commands for moving more rapidly about the line. @table @key @item C-a Move to the start of the line. @item C-e Move to the end of the line. @item M-f Move forward a word. @item M-b Move backward a word. @item C-l Clear the screen, reprinting the current line at the top. @end table Notice how @key{C-f} moves forward a character, while @key{M-f} moves forward a word. It is a loose convention that control keystrokes operate on characters while meta keystrokes operate on words. @node Readline Killing Commands @subsection Readline Killing Commands @dfn{Killing} text means to delete the text from the line, but to save it away for later use, usually by @dfn{yanking} it back into the line. If the description for a command says that it `kills' text, then you can be sure that you can get the text back in a different (or the same) place later. Here is the list of commands for killing text. @table @key @item C-k Kill the text from the current cursor position to the end of the line. @item M-d Kill from the cursor to the end of the current word, or if between words, to the end of the next word. @item M-DEL Kill from the cursor the start of the previous word, or if between words, to the start of the previous word. @item C-w Kill from the cursor to the previous whitespace. This is different than @key{M-DEL} because the word boundaries differ. @end table And, here is how to @dfn{yank} the text back into the line. Yanking is @table @key @item C-y Yank the most recently killed text back into the buffer at the cursor. @item M-y Rotate the kill-ring, and yank the new top. You can only do this if the prior command is @key{C-y} or @key{M-y}. @end table When you use a kill command, the text is saved in a @dfn{kill-ring}. Any number of consecutive kills save all of the killed text together, so that when you yank it back, you get it in one clean sweep. The kill ring is not line specific; the text that you killed on a previously typed line is available to be yanked back later, when you are typing another line. @node Readline Arguments @subsection Readline Arguments You can pass numeric arguments to Readline commands. Sometimes the argument acts as a repeat count, other times it is the @i{sign} of the argument that is significant. If you pass a negative argument to a command which normally acts in a forward direction, that command will act in a backward direction. For example, to kill text back to the start of the line, you might type @key{M--} @key{C-k}. The general way to pass numeric arguments to a command is to type meta digits before the command. If the first `digit' you type is a minus sign (@key{-}), then the sign of the argument will be negative. Once you have typed one meta digit to get the argument started, you can type the remainder of the digits, and then the command. For example, to give the @key{C-d} command an argument of 10, you could type @key{M-1 0 C-d}. @node Readline Init File @section Readline Init File Although the Readline library comes with a set of Emacs-like keybindings, it is possible that you would like to use a different set of keybindings. You can customize programs that use Readline by putting commands in an @dfn{init} file in your home directory. The name of this file is @file{~/.inputrc}. When a program which uses the Readline library starts up, the @file{~/.inputrc} file is read, and the keybindings are set. In addition, the @code{C-x C-r} command re-reads this init file, thus incorporating any changes that you might have made to it. @menu * Readline Init Syntax:: Syntax for the commands in @file{~/.inputrc}. * Readline Vi Mode:: Switching to @code{vi} mode in Readline. @end menu @node Readline Init Syntax @subsection Readline Init Syntax There are only four constructs allowed in the @file{~/.inputrc} file: @table @asis @item Variable Settings You can change the state of a few variables in Readline. You do this by using the @code{set} command within the init file. Here is how you would specify that you wish to use Vi line editing commands: @example set editing-mode vi @end example Right now, there are only a few variables which can be set; so few in fact, that we just iterate them here: @table @code @item editing-mode @vindex editing-mode The @code{editing-mode} variable controls which editing mode you are using. By default, GNU Readline starts up in Emacs editing mode, where the keystrokes are most similar to Emacs. This variable can either be set to @code{emacs} or @code{vi}. @item horizontal-scroll-mode @vindex horizontal-scroll-mode This variable can either be set to @code{On} or @code{Off}. Setting it to @code{On} means that the text of the lines that you edit will scroll horizontally on a single screen line when they are larger than the width of the screen, instead of wrapping onto a new screen line. By default, this variable is set to @code{Off}. @item mark-modified-lines @vindex mark-modified-lines This variable when set to @code{On}, says to display an asterisk (@samp{*}) at the starts of history lines which have been modified. This variable is off by default. @item prefer-visible-bell @vindex prefer-visible-bell If this variable is set to @code{On} it means to use a visible bell if one is available, rather than simply ringing the terminal bell. By default, the value is @code{Off}. @end table @item Key Bindings The syntax for controlling keybindings in the @file{~/.inputrc} file is simple. First you have to know the @i{name} of the command that you want to change. The following pages contain tables of the command name, the default keybinding, and a short description of what the command does. Once you know the name of the command, simply place the name of the key you wish to bind the command to, a colon, and then the name of the command on a line in the @file{~/.inputrc} file. The name of the key can be expressed in different ways, depending on which is most comfortable for you. @table @asis @item @w{@var{keyname}: @var{function-name} or @var{macro}} @var{keyname} is the name of a key spelled out in English. For example: @example Control-u: universal-argument Meta-Rubout: backward-kill-word Control-o: ">&output" @end example In the above example, @samp{C-u} is bound to the function @code{universal-argument}, and @samp{C-o} is bound to run the macro expressed on the right hand side (that is, to insert the text @samp{>&output} into the line). @item @w{"@var{keyseq}": @var{function-name} or @var{macro}} @var{keyseq} differs from @var{keyname} above in that strings denoting an entire key sequence can be specified. Simply place the key sequence in double quotes. GNU Emacs style key escapes can be used, as in the following example: @example "\C-u": universal-argument "\C-x\C-r": re-read-init-file "\e[11~": "Function Key 1" @end example In the above example, @samp{C-u} is bound to the function @code{universal-argument} (just as it was in the first example), @samp{C-x C-r} is bound to the function @code{re-read-init-file}, and @samp{ESC [ 1 1 ~} is bound to insert the text @samp{Function Key 1}. @end table @end table @menu * Commands For Moving:: Moving about the line. * Commands For History:: Getting at previous lines. * Commands For Text:: Commands for changing text. * Commands For Killing:: Commands for killing and yanking. * Numeric Arguments:: Specifying numeric arguments, repeat counts. * Commands For Completion:: Getting Readline to do the typing for you. * Miscellaneous Commands:: Other miscillaneous commands. @end menu @node Commands For Moving @subsubsection Commands For Moving @ftable @code @item beginning-of-line (C-a) Move to the start of the current line. @item end-of-line (C-e) Move to the end of the line. @item forward-char (C-f) Move forward a character. @item backward-char (C-b) Move back a character. @item forward-word (M-f) Move forward to the end of the next word. @item backward-word (M-b) Move back to the start of this, or the previous, word. @item clear-screen (C-l) Clear the screen leaving the current line at the top of the screen. @end ftable @node Commands For History @subsubsection Commands For Manipulating The History @ftable @code @item accept-line (Newline, Return) Accept the line regardless of where the cursor is. If this line is non-empty, add it to the history list. If this line was a history line, then restore the history line to its original state. @item previous-history (C-p) Move `up' through the history list. @item next-history (C-n) Move `down' through the history list. @item beginning-of-history (M-<) Move to the first line in the history. @item end-of-history (M->) Move to the end of the input history, i.e., the line you are entering! @item reverse-search-history (C-r) Search backward starting at the current line and moving `up' through the history as necessary. This is an incremental search. @item forward-search-history (C-s) Search forward starting at the current line and moving `down' through the the history as neccessary. @end ftable @node Commands For Text @subsubsection Commands For Changing Text @ftable @code @item delete-char (C-d) Delete the character under the cursor. If the cursor is at the beginning of the line, and there are no characters in the line, and the last character typed was not C-d, then return EOF. @item backward-delete-char (Rubout) Delete the character behind the cursor. A numeric arg says to kill the characters instead of deleting them. @item quoted-insert (C-q, C-v) Add the next character that you type to the line verbatim. This is how to insert things like C-q for example. @item tab-insert (M-TAB) Insert a tab character. @item self-insert (a, b, A, 1, !, ...) Insert yourself. @item transpose-chars (C-t) Drag the character before point forward over the character at point. Point moves forward as well. If point is at the end of the line, then transpose the two characters before point. Negative args don't work. @item transpose-words (M-t) Drag the word behind the cursor past the word in front of the cursor moving the cursor over that word as well. @item upcase-word (M-u) Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @item downcase-word (M-l) Lowercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @item capitalize-word (M-c) Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @end ftable @node Commands For Killing @subsubsection Killing And Yanking @ftable @code @item kill-line (C-k) Kill the text from the current cursor position to the end of the line. @item backward-kill-line () Kill backward to the beginning of the line. This is normally unbound. @item kill-word (M-d) Kill from the cursor to the end of the current word, or if between words, to the end of the next word. @item backward-kill-word (M-DEL) Kill the word behind the cursor. @item unix-line-discard (C-u) Do what C-u used to do in Unix line input. We save the killed text on the kill-ring, though. @item unix-word-rubout (C-w) Do what C-w used to do in Unix line input. The killed text is saved on the kill-ring. This is different than backward-kill-word because the word boundaries differ. @item yank (C-y) Yank the top of the kill ring into the buffer at point. @item yank-pop (M-y) Rotate the kill-ring, and yank the new top. You can only do this if the prior command is yank or yank-pop. @end ftable @node Numeric Arguments @subsubsection Specifying Numeric Arguments @ftable @code @item digit-argument (M-0, M-1, ... M--) Add this digit to the argument already accumulating, or start a new argument. M-- starts a negative argument. @item universal-argument () Do what C-u does in emacs. By default, this is not bound. @end ftable @node Commands For Completion @subsubsection Letting Readline Type For You @ftable @code @item complete (TAB) Attempt to do completion on the text before point. This is implementation defined. Generally, if you are typing a filename argument, you can do filename completion; if you are typing a command, you can do command completion, if you are typing in a symbol to GDB, you can do symbol name completion, if you are typing in a variable to Bash, you can do variable name completion... @item possible-completions (M-?) List the possible completions of the text before point. @end ftable @node Miscellaneous Commands @subsubsection Some Miscellaneous Commands @ftable @code @item re-read-init-file (C-x C-r) Read in the contents of your @file{~/.inputrc} file, and incorporate any bindings found there. @item abort (C-g) Ding! Stops things. @item do-uppercase-version (M-a, M-b, ...) Run the command that is bound to your uppercase brother. @item prefix-meta (ESC) Make the next character that you type be metafied. This is for people without a meta key. Typing @samp{ESC f} is equivalent to typing @samp{M-f}. @item undo (C-_) Incremental undo, separately remembered for each line. @item revert-line (M-r) Undo all changes made to this line. This is like typing the `undo' command enough times to get back to the beginning. @end ftable @node Readline Vi Mode @subsection Readline Vi Mode While the Readline library does not have a full set of Vi editing functions, it does contain enough to allow simple editing of the line. In order to switch interactively between Emacs and Vi editing modes, use the command M-C-j (toggle-editing-mode). When you enter a line in Vi mode, you are already placed in `insertion' mode, as if you had typed an `i'. Pressing @key{ESC} switches you into `edit' mode, where you can edit the text of the line with the standard Vi movement keys, move to previous history lines with `k', and following lines with `j', and so forth. octave-1.1.0/readline/doc/texindex.c100666 415 17 113135 5440717075 15540 0ustar jweusers/* Prepare Tex index dribble output into an actual index. Copyright (C) 1987 Free Software Foundation, Inc. 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include extern int errno; #ifdef VMS #ifndef VAX11C #define noshare #endif #include #include #define EXIT_SUCCESS ((1 << 28) | 1) #define EXIT_FATAL ((1 << 28) | 4) #define unlink delete #define tell(fd) lseek(fd, 0L, 1) #else /* Not VMS */ #ifdef USG #include #include #endif #include #define EXIT_SUCCESS 0 #define EXIT_FATAL 1 #endif /* Not VMS */ #ifndef L_XTND #define L_XTND 2 #endif #ifdef VMS extern noshare int sys_nerr; extern noshare char *sys_errlist[]; #else extern int sys_nerr; extern char *sys_errlist[]; #endif /* When sorting in core, this structure describes one line and the position and length of its first keyfield. */ struct lineinfo { char *text; /* The actual text of the line */ union { /* The start of the key (for textual comparison) */ char *text; long number; /* or the numeric value (for numeric comparison) */ } key; long keylen; /* Length of key field */ }; /* This structure describes a field to use as a sort key */ struct keyfield { int startwords; /* # words to skip */ int startchars; /* and # additional chars to skip, to start of field */ int endwords; /* similar, from beg (or end) of line, to find end of field */ int endchars; char ignore_blanks; /* Ignore spaces and tabs within the field */ char fold_case; /* Convert upper case to lower before comparing */ char reverse; /* Compare in reverse order */ char numeric; /* Parse text as an integer and compare the integers */ char positional; /* Sort according to position within the file */ char braced; /* Count balanced-braced groupings as fields */ }; /* Vector of keyfields to use */ struct keyfield keyfields[3]; /* Number of keyfields stored in that vector. */ int num_keyfields = 3; /* Vector of input file names, terminated with a zero (null pointer) */ char **infiles; /* Vector of corresponding output file names, or zero meaning default it */ char **outfiles; /* Length of `infiles' */ int num_infiles; /* Pointer to the array of pointers to lines being sorted */ char **linearray; /* The allocated length of `linearray'. */ long nlines; /* Directory to use for temporary files. On Unix, it ends with a slash. */ char *tempdir; /* Start of filename to use for temporary files. */ char *tempbase; /* Number of last temporary file. */ int tempcount; /* Number of last temporary file already deleted. Temporary files are deleted by `flush_tempfiles' in order of creation. */ int last_deleted_tempcount; /* During in-core sort, this points to the base of the data block which contains all the lines of data. */ char *text_base; /* Additional command switches */ int keep_tempfiles; /* Nonzero means do not delete tempfiles -- for debugging */ /* Forward declarations of functions in this file */ void decode_command (); void sort_in_core (); void sort_offline (); char **parsefile (); char *find_field (); char *find_pos (); long find_value (); char *find_braced_pos (); char *find_braced_end (); void writelines (); int compare_full (); long readline (); int merge_files (); int merge_direct (); char *concat (); char *maketempname (); void flush_tempfiles (); char *tempcopy (); extern char *mktemp (); #define MAX_IN_CORE_SORT 500000 int main (argc, argv) int argc; char **argv; { int i; tempcount = 0; last_deleted_tempcount = 0; /* Describe the kind of sorting to do. */ /* The first keyfield uses the first braced field and folds case */ keyfields[0].braced = 1; keyfields[0].fold_case = 1; keyfields[0].endwords = -1; keyfields[0].endchars = -1; /* The second keyfield uses the second braced field, numerically */ keyfields[1].braced = 1; keyfields[1].numeric = 1; keyfields[1].startwords = 1; keyfields[1].endwords = -1; keyfields[1].endchars = -1; /* The third keyfield (which is ignored while discarding duplicates) compares the whole line */ keyfields[2].endwords = -1; keyfields[2].endchars = -1; decode_command (argc, argv); tempbase = mktemp (concat ("txiXXXXXX", "", "")); /* Process input files completely, one by one. */ for (i = 0; i < num_infiles; i++) { int desc; long ptr; char *outfile; char *p; desc = open (infiles[i], 0, 0); if (desc < 0) pfatal_with_name (infiles[i]); lseek (desc, 0, L_XTND); ptr = tell (desc); close (desc); outfile = outfiles[i]; if (!outfile) { outfile = concat (infiles[i], "s", ""); } if (ptr < MAX_IN_CORE_SORT) /* Sort a small amount of data */ sort_in_core (infiles[i], ptr, outfile); else sort_offline (infiles[i], ptr, outfile); } flush_tempfiles (tempcount); exit (EXIT_SUCCESS); } /* This page decodes the command line arguments to set the parameter variables and set up the vector of keyfields and the vector of input files */ void decode_command (argc, argv) int argc; char **argv; { int i; char **ip; char **op; /* Store default values into parameter variables */ #ifdef VMS tempdir = "sys$scratch:"; #else tempdir = "/tmp/"; #endif keep_tempfiles = 0; /* Allocate argc input files, which must be enough. */ infiles = (char **) xmalloc (argc * sizeof (char *)); outfiles = (char **) xmalloc (argc * sizeof (char *)); ip = infiles; op = outfiles; /* First find all switches that control the default kind-of-sort */ for (i = 1; i < argc; i++) { int tem = classify_arg (argv[i]); char c; char *p; if (tem <= 0) { *ip++ = argv[i]; *op++ = 0; continue; } if (tem > 1) { if (i + 1 == argc) fatal ("switch %s given with no argument following it", argv[i]); else if (!strcmp (argv[i], "-T")) tempdir = argv[i + 1]; else if (!strcmp (argv[i], "-o")) *(op - 1) = argv[i + 1]; i += tem - 1; continue; } p = &argv[i][1]; while (c = *p++) switch (c) { case 'k': keep_tempfiles = 1; break; default: fatal ("invalid command switch %c", c); } switchdone: ; } /* Record number of keyfields, terminate list of filenames */ num_infiles = ip - infiles; *ip = 0; } /* Return 0 for an argument that is not a switch; for a switch, return 1 plus the number of following arguments that the switch swallows. */ int classify_arg (arg) char *arg; { if (!strcmp (arg, "-T") || !strcmp (arg, "-o")) return 2; if (arg[0] == '-') return 1; return 0; } /* Create a name for a temporary file */ char * maketempname (count) int count; { char tempsuffix[10]; sprintf (tempsuffix, "%d", count); return concat (tempdir, tempbase, tempsuffix); } /* Delete all temporary files up to the specified count */ void flush_tempfiles (to_count) int to_count; { if (keep_tempfiles) return; while (last_deleted_tempcount < to_count) unlink (maketempname (++last_deleted_tempcount)); } /* Copy an input file into a temporary file, and return the temporary file name */ #define BUFSIZE 1024 char * tempcopy (idesc) int idesc; { char *outfile = maketempname (++tempcount); int odesc; char buffer[BUFSIZE]; odesc = open (outfile, O_WRONLY | O_CREAT, 0666); if (odesc < 0) pfatal_with_name (outfile); while (1) { int nread = read (idesc, buffer, BUFSIZE); write (odesc, buffer, nread); if (!nread) break; } close (odesc); return outfile; } /* Compare two lines, provided as pointers to pointers to text, according to the specified set of keyfields */ int compare_full (line1, line2) char **line1, **line2; { int i; /* Compare using the first keyfield; if that does not distinguish the lines, try the second keyfield; and so on. */ for (i = 0; i < num_keyfields; i++) { long length1, length2; char *start1 = find_field (&keyfields[i], *line1, &length1); char *start2 = find_field (&keyfields[i], *line2, &length2); int tem = compare_field (&keyfields[i], start1, length1, *line1 - text_base, start2, length2, *line2 - text_base); if (tem) { if (keyfields[i].reverse) return - tem; return tem; } } return 0; /* Lines match exactly */ } /* Compare two lines described by structures in which the first keyfield is identified in advance. For positional sorting, assumes that the order of the lines in core reflects their nominal order. */ int compare_prepared (line1, line2) struct lineinfo *line1, *line2; { int i; int tem; char *text1, *text2; /* Compare using the first keyfield, which has been found for us already */ if (keyfields->positional) { if (line1->text - text_base > line2->text - text_base) tem = 1; else tem = -1; } else if (keyfields->numeric) tem = line1->key.number - line2->key.number; else tem = compare_field (keyfields, line1->key.text, line1->keylen, 0, line2->key.text, line2->keylen, 0); if (tem) { if (keyfields->reverse) return - tem; return tem; } text1 = line1->text; text2 = line2->text; /* Compare using the second keyfield; if that does not distinguish the lines, try the third keyfield; and so on. */ for (i = 1; i < num_keyfields; i++) { long length1, length2; char *start1 = find_field (&keyfields[i], text1, &length1); char *start2 = find_field (&keyfields[i], text2, &length2); int tem = compare_field (&keyfields[i], start1, length1, text1 - text_base, start2, length2, text2 - text_base); if (tem) { if (keyfields[i].reverse) return - tem; return tem; } } return 0; /* Lines match exactly */ } /* Like compare_full but more general. You can pass any strings, and you can say how many keyfields to use. `pos1' and `pos2' should indicate the nominal positional ordering of the two lines in the input. */ int compare_general (str1, str2, pos1, pos2, use_keyfields) char *str1, *str2; long pos1, pos2; int use_keyfields; { int i; /* Compare using the first keyfield; if that does not distinguish the lines, try the second keyfield; and so on. */ for (i = 0; i < use_keyfields; i++) { long length1, length2; char *start1 = find_field (&keyfields[i], str1, &length1); char *start2 = find_field (&keyfields[i], str2, &length2); int tem = compare_field (&keyfields[i], start1, length1, pos1, start2, length2, pos2); if (tem) { if (keyfields[i].reverse) return - tem; return tem; } } return 0; /* Lines match exactly */ } /* Find the start and length of a field in `str' according to `keyfield'. A pointer to the starting character is returned, and the length is stored into the int that `lengthptr' points to. */ char * find_field (keyfield, str, lengthptr) struct keyfield *keyfield; char *str; long *lengthptr; { char *start; char *end; char *(*fun) (); if (keyfield->braced) fun = find_braced_pos; else fun = find_pos; start = ( *fun )(str, keyfield->startwords, keyfield->startchars, keyfield->ignore_blanks); if (keyfield->endwords < 0) { if (keyfield->braced) end = find_braced_end (start); else { end = start; while (*end && *end != '\n') end++; } } else { end = ( *fun )(str, keyfield->endwords, keyfield->endchars, 0); if (end - str < start - str) end = start; } *lengthptr = end - start; return start; } /* Find a pointer to a specified place within `str', skipping (from the beginning) `words' words and then `chars' chars. If `ignore_blanks' is nonzero, we skip all blanks after finding the specified word. */ char * find_pos (str, words, chars, ignore_blanks) char *str; int words, chars; int ignore_blanks; { int i; char *p = str; for (i = 0; i < words; i++) { char c; /* Find next bunch of nonblanks and skip them. */ while ((c = *p) == ' ' || c == '\t') p++; while ((c = *p) && c != '\n' && !(c == ' ' || c == '\t')) p++; if (!*p || *p == '\n') return p; } while (*p == ' ' || *p == '\t') p++; for (i = 0; i < chars; i++) { if (!*p || *p == '\n') break; p++; } return p; } /* Like find_pos but assumes that each field is surrounded by braces and that braces within fields are balanced. */ char * find_braced_pos (str, words, chars, ignore_blanks) char *str; int words, chars; int ignore_blanks; { int i; int bracelevel; char *p = str; char c; for (i = 0; i < words; i++) { bracelevel = 1; while ((c = *p++) != '{' && c != '\n' && c); if (c != '{') return p - 1; while (bracelevel) { c = *p++; if (c == '{') bracelevel++; if (c == '}') bracelevel--; #if 0 if (c == '\\' || c == '@') c = *p++; /* \ quotes braces and \ */ #endif if (c == 0 || c == '\n') return p-1; } } while ((c = *p++) != '{' && c != '\n' && c); if (c != '{') return p-1; if (ignore_blanks) while ((c = *p) == ' ' || c == '\t') p++; for (i = 0; i < chars; i++) { if (!*p || *p == '\n') break; p++; } return p; } /* Find the end of the balanced-brace field which starts at `str'. The position returned is just before the closing brace. */ char * find_braced_end (str) char *str; { int bracelevel; char *p = str; char c; bracelevel = 1; while (bracelevel) { c = *p++; if (c == '{') bracelevel++; if (c == '}') bracelevel--; #if 0 if (c == '\\' || c == '@') c = *p++; #endif if (c == 0 || c == '\n') return p-1; } return p - 1; } long find_value (start, length) char *start; long length; { while (length != 0L) { if (isdigit(*start)) return atol(start); length--; start++; } return 0l; } /* Vector used to translate characters for comparison. This is how we make all alphanumerics follow all else, and ignore case in the first sorting. */ int char_order[256]; init_char_order () { int i; for (i = 1; i < 256; i++) char_order[i] = i; for (i = '0'; i <= '9'; i++) char_order[i] += 512; for (i = 'a'; i <= 'z'; i++) { char_order[i] = 512 + i; char_order[i + 'A' - 'a'] = 512 + i; } } /* Compare two fields (each specified as a start pointer and a character count) according to `keyfield'. The sign of the value reports the relation between the fields */ int compare_field (keyfield, start1, length1, pos1, start2, length2, pos2) struct keyfield *keyfield; char *start1; long length1; long pos1; char *start2; long length2; long pos2; { if (keyfields->positional) { if (pos1 > pos2) return 1; else return -1; } if (keyfield->numeric) { long value = find_value (start1, length1) - find_value (start2, length2); if (value > 0) return 1; if (value < 0) return -1; return 0; } else { char *p1 = start1; char *p2 = start2; char *e1 = start1 + length1; char *e2 = start2 + length2; int fold_case = keyfield->fold_case; while (1) { int c1, c2; if (p1 == e1) c1 = 0; else c1 = *p1++; if (p2 == e2) c2 = 0; else c2 = *p2++; if (char_order[c1] != char_order[c2]) return char_order[c1] - char_order[c2]; if (!c1) break; } /* Strings are equal except possibly for case. */ p1 = start1; p2 = start2; while (1) { int c1, c2; if (p1 == e1) c1 = 0; else c1 = *p1++; if (p2 == e2) c2 = 0; else c2 = *p2++; if (c1 != c2) /* Reverse sign here so upper case comes out last. */ return c2 - c1; if (!c1) break; } return 0; } } /* A `struct linebuffer' is a structure which holds a line of text. `readline' reads a line from a stream into a linebuffer and works regardless of the length of the line. */ struct linebuffer { long size; char *buffer; }; /* Initialize a linebuffer for use */ void initbuffer (linebuffer) struct linebuffer *linebuffer; { linebuffer->size = 200; linebuffer->buffer = (char *) xmalloc (200); } /* Read a line of text from `stream' into `linebuffer'. Return the length of the line. */ long readline (linebuffer, stream) struct linebuffer *linebuffer; FILE *stream; { char *buffer = linebuffer->buffer; char *p = linebuffer->buffer; char *end = p + linebuffer->size; while (1) { int c = getc (stream); if (p == end) { buffer = (char *) xrealloc (buffer, linebuffer->size *= 2); p += buffer - linebuffer->buffer; end += buffer - linebuffer->buffer; linebuffer->buffer = buffer; } if (c < 0 || c == '\n') { *p = 0; break; } *p++ = c; } return p - buffer; } /* Sort an input file too big to sort in core. */ void sort_offline (infile, nfiles, total, outfile) char *infile; long total; char *outfile; { int ntemps = 2 * (total + MAX_IN_CORE_SORT - 1) / MAX_IN_CORE_SORT; /* More than enough */ char **tempfiles = (char **) xmalloc (ntemps * sizeof (char *)); FILE *istream = fopen (infile, "r"); int i; struct linebuffer lb; long linelength; int failure = 0; initbuffer (&lb); /* Read in one line of input data. */ linelength = readline (&lb, istream); if (lb.buffer[0] != '\\' && lb.buffer[0] != '@') { error ("%s: not a texinfo index file", infile); return; } /* Split up the input into `ntemps' temporary files, or maybe fewer, and put the new files' names into `tempfiles' */ for (i = 0; i < ntemps; i++) { char *outname = maketempname (++tempcount); FILE *ostream = fopen (outname, "w"); long tempsize = 0; if (!ostream) pfatal_with_name (outname); tempfiles[i] = outname; /* Copy lines into this temp file as long as it does not make file "too big" or until there are no more lines. */ while (tempsize + linelength + 1 <= MAX_IN_CORE_SORT) { tempsize += linelength + 1; fputs (lb.buffer, ostream); putc ('\n', ostream); /* Read another line of input data. */ linelength = readline (&lb, istream); if (!linelength && feof (istream)) break; if (lb.buffer[0] != '\\' && lb.buffer[0] != '@') { error ("%s: not a texinfo index file", infile); failure = 1; goto fail; } } fclose (ostream); if (feof (istream)) break; } free (lb.buffer); fail: /* Record number of temp files we actually needed. */ ntemps = i; /* Sort each tempfile into another tempfile. Delete the first set of tempfiles and put the names of the second into `tempfiles' */ for (i = 0; i < ntemps; i++) { char *newtemp = maketempname (++tempcount); sort_in_core (&tempfiles[i], MAX_IN_CORE_SORT, newtemp); if (!keep_tempfiles) unlink (tempfiles[i]); tempfiles[i] = newtemp; } if (failure) return; /* Merge the tempfiles together and indexify */ merge_files (tempfiles, ntemps, outfile); } /* Sort `infile', whose size is `total', assuming that is small enough to be done in-core, then indexify it and send the output to `outfile' (or to stdout). */ void sort_in_core (infile, total, outfile) char *infile; long total; char *outfile; { char **nextline; char *data = (char *) xmalloc (total + 1); char *file_data; long file_size; int i; FILE *ostream = stdout; struct lineinfo *lineinfo; /* Read the contents of the file into the moby array `data' */ int desc = open (infile, 0, 0); if (desc < 0) fatal ("failure reopening %s", infile); for (file_size = 0; ; ) { if ((i = read (desc, data + file_size, total - file_size)) <= 0) break; file_size += i; } file_data = data; data[file_size] = 0; close (desc); if (file_size > 0 && data[0] != '\\' && data[0] != '@') { error ("%s: not a texinfo index file", infile); return; } init_char_order (); /* Sort routines want to know this address */ text_base = data; /* Create the array of pointers to lines, with a default size frequently enough. */ nlines = total / 50; if (!nlines) nlines = 2; linearray = (char **) xmalloc (nlines * sizeof (char *)); /* `nextline' points to the next free slot in this array. `nlines' is the allocated size. */ nextline = linearray; /* Parse the input file's data, and make entries for the lines. */ nextline = parsefile (infile, nextline, file_data, file_size); if (nextline == 0) { error ("%s: not a texinfo index file", infile); return; } /* Sort the lines */ /* If we have enough space, find the first keyfield of each line in advance. Make a `struct lineinfo' for each line, which records the keyfield as well as the line, and sort them. */ lineinfo = (struct lineinfo *) malloc ((nextline - linearray) * sizeof (struct lineinfo)); if (lineinfo) { struct lineinfo *lp; char **p; for (lp = lineinfo, p = linearray; p != nextline; lp++, p++) { lp->text = *p; lp->key.text = find_field (keyfields, *p, &lp->keylen); if (keyfields->numeric) lp->key.number = find_value (lp->key.text, lp->keylen); } qsort (lineinfo, nextline - linearray, sizeof (struct lineinfo), compare_prepared); for (lp = lineinfo, p = linearray; p != nextline; lp++, p++) *p = lp->text; free (lineinfo); } else qsort (linearray, nextline - linearray, sizeof (char *), compare_full); /* Open the output file */ if (outfile) { ostream = fopen (outfile, "w"); if (!ostream) pfatal_with_name (outfile); } writelines (linearray, nextline - linearray, ostream); if (outfile) fclose (ostream); free (linearray); free (data); } /* Parse an input string in core into lines. DATA is the input string, and SIZE is its length. Data goes in LINEARRAY starting at NEXTLINE. The value returned is the first entry in LINEARRAY still unused. Value 0 means input file contents are invalid. */ char ** parsefile (filename, nextline, data, size) char *filename; char **nextline; char *data; long size; { char *p, *end; char **line = nextline; p = data; end = p + size; *end = 0; while (p != end) { if (p[0] != '\\' && p[0] != '@') return 0; *line = p; while (*p && *p != '\n') p++; if (p != end) p++; line++; if (line == linearray + nlines) { char **old = linearray; linearray = (char **) xrealloc (linearray, sizeof (char *) * (nlines *= 4)); line += linearray - old; } } return line; } /* Indexification is a filter applied to the sorted lines as they are being written to the output file. Multiple entries for the same name, with different page numbers, get combined into a single entry with multiple page numbers. The first braced field, which is used for sorting, is discarded. However, its first character is examined, folded to lower case, and if it is different from that in the previous line fed to us a \initial line is written with one argument, the new initial. If an entry has four braced fields, then the second and third constitute primary and secondary names. In this case, each change of primary name generates a \primary line which contains only the primary name, and in between these are \secondary lines which contain just a secondary name and page numbers. */ /* The last primary name we wrote a \primary entry for. If only one level of indexing is being done, this is the last name seen */ char *lastprimary; int lastprimarylength; /* Length of storage allocated for lastprimary */ /* Similar, for the secondary name. */ char *lastsecondary; int lastsecondarylength; /* Zero if we are not in the middle of writing an entry. One if we have written the beginning of an entry but have not yet written any page numbers into it. Greater than one if we have written the beginning of an entry plus at least one page number. */ int pending; /* The initial (for sorting purposes) of the last primary entry written. When this changes, a \initial {c} line is written */ char * lastinitial; int lastinitiallength; /* When we need a string of length 1 for the value of lastinitial, store it here. */ char lastinitial1[2]; /* Initialize static storage for writing an index */ void init_index () { pending = 0; lastinitial = lastinitial1; lastinitial1[0] = 0; lastinitial1[1] = 0; lastinitiallength = 0; lastprimarylength = 100; lastprimary = (char *) xmalloc (lastprimarylength + 1); bzero (lastprimary, lastprimarylength + 1); lastsecondarylength = 100; lastsecondary = (char *) xmalloc (lastsecondarylength + 1); bzero (lastsecondary, lastsecondarylength + 1); } /* Indexify. Merge entries for the same name, insert headers for each initial character, etc. */ indexify (line, ostream) char *line; FILE *ostream; { char *primary, *secondary, *pagenumber; int primarylength, secondarylength, pagelength; int len = strlen (line); int nosecondary; int initiallength; char *initial; char initial1[2]; register char *p; /* First, analyze the parts of the entry fed to us this time */ p = find_braced_pos (line, 0, 0, 0); if (*p == '{') { initial = p; /* Get length of inner pair of braces starting at p, including that inner pair of braces. */ initiallength = find_braced_end (p + 1) + 1 - p; } else { initial = initial1; initial1[0] = *p; initial1[1] = 0; initiallength = 1; if (initial1[0] >= 'a' && initial1[0] <= 'z') initial1[0] -= 040; } pagenumber = find_braced_pos (line, 1, 0, 0); pagelength = find_braced_end (pagenumber) - pagenumber; if (pagelength == 0) abort (); primary = find_braced_pos (line, 2, 0, 0); primarylength = find_braced_end (primary) - primary; secondary = find_braced_pos (line, 3, 0, 0); nosecondary = !*secondary; if (!nosecondary) secondarylength = find_braced_end (secondary) - secondary; /* If the primary is different from before, make a new primary entry */ if (strncmp (primary, lastprimary, primarylength)) { /* Close off current secondary entry first, if one is open */ if (pending) { fputs ("}\n", ostream); pending = 0; } /* If this primary has a different initial, include an entry for the initial */ if (initiallength != lastinitiallength || strncmp (initial, lastinitial, initiallength)) { fprintf (ostream, "\\initial {"); fwrite (initial, 1, initiallength, ostream); fprintf (ostream, "}\n", initial); if (initial == initial1) { lastinitial = lastinitial1; *lastinitial1 = *initial1; } else { lastinitial = initial; } lastinitiallength = initiallength; } /* Make the entry for the primary. */ if (nosecondary) fputs ("\\entry {", ostream); else fputs ("\\primary {", ostream); fwrite (primary, primarylength, 1, ostream); if (nosecondary) { fputs ("}{", ostream); pending = 1; } else fputs ("}\n", ostream); /* Record name of most recent primary */ if (lastprimarylength < primarylength) { lastprimarylength = primarylength + 100; lastprimary = (char *) xrealloc (lastprimary, 1 + lastprimarylength); } strncpy (lastprimary, primary, primarylength); lastprimary[primarylength] = 0; /* There is no current secondary within this primary, now */ lastsecondary[0] = 0; } /* Should not have an entry with no subtopic following one with a subtopic */ if (nosecondary && *lastsecondary) error ("entry %s follows an entry with a secondary name", line); /* Start a new secondary entry if necessary */ if (!nosecondary && strncmp (secondary, lastsecondary, secondarylength)) { if (pending) { fputs ("}\n", ostream); pending = 0; } /* Write the entry for the secondary. */ fputs ("\\secondary {", ostream); fwrite (secondary, secondarylength, 1, ostream); fputs ("}{", ostream); pending = 1; /* Record name of most recent secondary */ if (lastsecondarylength < secondarylength) { lastsecondarylength = secondarylength + 100; lastsecondary = (char *) xrealloc (lastsecondary, 1 + lastsecondarylength); } strncpy (lastsecondary, secondary, secondarylength); lastsecondary[secondarylength] = 0; } /* Here to add one more page number to the current entry */ if (pending++ != 1) fputs (", ", ostream); /* Punctuate first, if this is not the first */ fwrite (pagenumber, pagelength, 1, ostream); } /* Close out any unfinished output entry */ void finish_index (ostream) FILE *ostream; { if (pending) fputs ("}\n", ostream); free (lastprimary); free (lastsecondary); } /* Copy the lines in the sorted order. Each line is copied out of the input file it was found in. */ void writelines (linearray, nlines, ostream) char **linearray; int nlines; FILE *ostream; { char **stop_line = linearray + nlines; char **next_line; init_index (); /* Output the text of the lines, and free the buffer space */ for (next_line = linearray; next_line != stop_line; next_line++) { /* If -u was specified, output the line only if distinct from previous one. */ if (next_line == linearray /* Compare previous line with this one, using only the explicitly specd keyfields */ || compare_general (*(next_line - 1), *next_line, 0L, 0L, num_keyfields - 1)) { char *p = *next_line; char c; while ((c = *p++) && c != '\n'); *(p-1) = 0; indexify (*next_line, ostream); } } finish_index (ostream); } /* Assume (and optionally verify) that each input file is sorted; merge them and output the result. Returns nonzero if any input file fails to be sorted. This is the high-level interface that can handle an unlimited number of files. */ #define MAX_DIRECT_MERGE 10 int merge_files (infiles, nfiles, outfile) char **infiles; int nfiles; char *outfile; { char **tempfiles; int ntemps; int i; int value = 0; int start_tempcount = tempcount; if (nfiles <= MAX_DIRECT_MERGE) return merge_direct (infiles, nfiles, outfile); /* Merge groups of MAX_DIRECT_MERGE input files at a time, making a temporary file to hold each group's result. */ ntemps = (nfiles + MAX_DIRECT_MERGE - 1) / MAX_DIRECT_MERGE; tempfiles = (char **) xmalloc (ntemps * sizeof (char *)); for (i = 0; i < ntemps; i++) { int nf = MAX_DIRECT_MERGE; if (i + 1 == ntemps) nf = nfiles - i * MAX_DIRECT_MERGE; tempfiles[i] = maketempname (++tempcount); value |= merge_direct (&infiles[i * MAX_DIRECT_MERGE], nf, tempfiles[i]); } /* All temporary files that existed before are no longer needed since their contents have been merged into our new tempfiles. So delete them. */ flush_tempfiles (start_tempcount); /* Now merge the temporary files we created. */ merge_files (tempfiles, ntemps, outfile); free (tempfiles); return value; } /* Assume (and optionally verify) that each input file is sorted; merge them and output the result. Returns nonzero if any input file fails to be sorted. This version of merging will not work if the number of input files gets too high. Higher level functions use it only with a bounded number of input files. */ int merge_direct (infiles, nfiles, outfile) char **infiles; int nfiles; char *outfile; { char **ip = infiles; struct linebuffer *lb1, *lb2; struct linebuffer **thisline, **prevline; FILE **streams; int i; int nleft; int lossage = 0; int *file_lossage; struct linebuffer *prev_out = 0; FILE *ostream = stdout; if (outfile) { ostream = fopen (outfile, "w"); } if (!ostream) pfatal_with_name (outfile); init_index (); if (nfiles == 0) { if (outfile) fclose (ostream); return 0; } /* For each file, make two line buffers. Also, for each file, there is an element of `thisline' which points at any time to one of the file's two buffers, and an element of `prevline' which points to the other buffer. `thisline' is supposed to point to the next available line from the file, while `prevline' holds the last file line used, which is remembered so that we can verify that the file is properly sorted. */ /* lb1 and lb2 contain one buffer each per file */ lb1 = (struct linebuffer *) xmalloc (nfiles * sizeof (struct linebuffer)); lb2 = (struct linebuffer *) xmalloc (nfiles * sizeof (struct linebuffer)); /* thisline[i] points to the linebuffer holding the next available line in file i, or is zero if there are no lines left in that file. */ thisline = (struct linebuffer **) xmalloc (nfiles * sizeof (struct linebuffer *)); /* prevline[i] points to the linebuffer holding the last used line from file i. This is just for verifying that file i is properly sorted. */ prevline = (struct linebuffer **) xmalloc (nfiles * sizeof (struct linebuffer *)); /* streams[i] holds the input stream for file i. */ streams = (FILE **) xmalloc (nfiles * sizeof (FILE *)); /* file_lossage[i] is nonzero if we already know file i is not properly sorted. */ file_lossage = (int *) xmalloc (nfiles * sizeof (int)); /* Allocate and initialize all that storage */ for (i = 0; i < nfiles; i++) { initbuffer (&lb1[i]); initbuffer (&lb2[i]); thisline[i] = &lb1[i]; prevline[i] = &lb2[i]; file_lossage[i] = 0; streams[i] = fopen (infiles[i], "r"); if (!streams[i]) pfatal_with_name (infiles[i]); readline (thisline[i], streams[i]); } /* Keep count of number of files not at eof */ nleft = nfiles; while (nleft) { struct linebuffer *best = 0; struct linebuffer *exch; int bestfile = -1; int i; /* Look at the next avail line of each file; choose the least one. */ for (i = 0; i < nfiles; i++) { if (thisline[i] && (!best || 0 < compare_general (best->buffer, thisline[i]->buffer, (long) bestfile, (long) i, num_keyfields))) { best = thisline[i]; bestfile = i; } } /* Output that line, unless it matches the previous one and we don't want duplicates */ if (!(prev_out && !compare_general (prev_out->buffer, best->buffer, 0L, 1L, num_keyfields - 1))) indexify (best->buffer, ostream); prev_out = best; /* Now make the line the previous of its file, and fetch a new line from that file */ exch = prevline[bestfile]; prevline[bestfile] = thisline[bestfile]; thisline[bestfile] = exch; while (1) { /* If the file has no more, mark it empty */ if (feof (streams[bestfile])) { thisline[bestfile] = 0; nleft--; /* Update the number of files still not empty */ break; } readline (thisline[bestfile], streams[bestfile]); if (thisline[bestfile]->buffer[0] || !feof (streams[bestfile])) break; } } finish_index (ostream); /* Free all storage and close all input streams */ for (i = 0; i < nfiles; i++) { fclose (streams[i]); free (lb1[i].buffer); free (lb2[i].buffer); } free (file_lossage); free (lb1); free (lb2); free (thisline); free (prevline); free (streams); if (outfile) fclose (ostream); return lossage; } /* Print error message and exit. */ fatal (s1, s2) char *s1, *s2; { error (s1, s2); exit (EXIT_FATAL); } /* Print error message. `s1' is printf control string, `s2' is arg for it. */ error (s1, s2) char *s1, *s2; { printf ("texindex: "); printf (s1, s2); printf ("\n"); } perror_with_name (name) char *name; { char *s; if (errno < sys_nerr) s = concat ("", sys_errlist[errno], " for %s"); else s = "cannot open %s"; error (s, name); } pfatal_with_name (name) char *name; { char *s; if (errno < sys_nerr) s = concat ("", sys_errlist[errno], " for %s"); else s = "cannot open %s"; fatal (s, name); } /* Return a newly-allocated string whose contents concatenate those of s1, s2, s3. */ char * concat (s1, s2, s3) char *s1, *s2, *s3; { int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); char *result = (char *) xmalloc (len1 + len2 + len3 + 1); strcpy (result, s1); strcpy (result + len1, s2); strcpy (result + len1 + len2, s3); *(result + len1 + len2 + len3) = 0; return result; } /* Like malloc but get fatal error if memory is exhausted. */ int xmalloc (size) int size; { int result = malloc (size); if (!result) fatal ("virtual memory exhausted", 0); return result; } int xrealloc (ptr, size) char *ptr; int size; { int result = realloc (ptr, size); if (!result) fatal ("virtual memory exhausted"); return result; } bzero (b, length) register char *b; register int length; { #ifdef VMS short zero = 0; long max_str = 65535; long len; while (length > max_str) { (void) LIB$MOVC5 (&zero, &zero, &zero, &max_str, b); length -= max_str; b += max_str; } len = length; (void) LIB$MOVC5 (&zero, &zero, &zero, &len, b); #else while (length-- > 0) *b++ = 0; #endif /* not VMS */ } octave-1.1.0/readline/examples/ 40777 415 17 0 5705521715 14452 5ustar jweusersoctave-1.1.0/readline/examples/Inputrc100666 415 17 2737 5440717076 16132 0ustar jweusers# My ~/.inputrc file is in -*- text -*- for easy editing with Emacs. # # Notice the various bindings which are conditionalized depending # on which program is running, or what terminal is active. # # In all programs, all terminals, make sure this is bound. "\C-x\C-r": re-read-init-file # Hp terminals (and some others) have ugly default behaviour for C-h. "\C-h": backward-delete-char "\e\C-h": backward-kill-word "\C-xd": dump-functions # In xterm windows, make the arrow keys do the right thing. $if TERM=xterm "\e[A": previous-history "\e[B": next-history "\e[C": forward-char "\e[D": backward-char # Under Xterm in Bash, we bind local Function keys to do something useful. $if Bash "\e[11~": "Function Key 1" "\e[12~": "Function Key 2" "\e[13~": "Function Key 3" "\e[14~": "Function Key 4" "\e[15~": "Function Key 5" # I know the following escape sequence numbers are 1 greater than # the function key. Don't ask me why, I didn't design the xterm terminal. "\e[17~": "Function Key 6" "\e[18~": "Function Key 7" "\e[19~": "Function Key 8" "\e[20~": "Function Key 9" "\e[21~": "Function Key 10" $endif $endif # For Bash, all terminals, add some Bash specific hacks. $if Bash "\C-xv": show-bash-version "\C-x\C-e": shell-expand-line # Here is one for editing my path. "\C-xp": "$PATH\C-x\C-e\C-e\"\C-aPATH=\":\C-b" # Make C-x r read my mail in emacs. # "\C-xr": "emacs -f rmail\C-j" $endif # For FTP, different hacks: $if Ftp "\C-xg": "get \M-?" "\C-xt": "put \M-?" $endif " ": self-insert octave-1.1.0/readline/examples/Makefile.in100666 415 17 1544 5662226331 16616 0ustar jweusers# # Makefile for octave's readline/examples directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf SOURCES = fileman.c manexamp.c DISTFILES = Inputrc Makefile.in $(SOURCES) all: .PHONY: all check: all .PHONY: check install: all .PHONY: install uninstall: .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: .PHONY: clean mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/readline/examples .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/readline/examples .PHONY: dist octave-1.1.0/readline/examples/fileman.c100666 415 17 21533 5440717075 16354 0ustar jweusers/* fileman.c -- A tiny application which demonstrates how to use the GNU Readline library. This application interactively allows users to manipulate files and their modes. */ #include #include #include #include #include #include #include /* The names of functions that actually do the manipulation. */ int com_list (), com_view (), com_rename (), com_stat (), com_pwd (); int com_delete (), com_help (), com_cd (), com_quit (); /* A structure which contains information on the commands this program can understand. */ typedef struct { char *name; /* User printable name of the function. */ Function *func; /* Function to call to do the job. */ char *doc; /* Documentation for this function. */ } COMMAND; COMMAND commands[] = { { "cd", com_cd, "Change to directory DIR" }, { "delete", com_delete, "Delete FILE" }, { "help", com_help, "Display this text" }, { "?", com_help, "Synonym for `help'" }, { "list", com_list, "List files in DIR" }, { "ls", com_list, "Synonym for `list'" }, { "pwd", com_pwd, "Print the current working directory" }, { "quit", com_quit, "Quit using Fileman" }, { "rename", com_rename, "Rename FILE to NEWNAME" }, { "stat", com_stat, "Print out statistics on FILE" }, { "view", com_view, "View the contents of FILE" }, { (char *)NULL, (Function *)NULL, (char *)NULL } }; /* The name of this program, as taken from argv[0]. */ char *progname; /* When non-zero, this global means the user is done using this program. */ int done = 0; main (argc, argv) int argc; char **argv; { progname = argv[0]; initialize_readline (); /* Bind our completer. */ /* Loop reading and executing lines until the user quits. */ while (!done) { char *line; line = readline ("FileMan: "); if (!line) { done = 1; /* Encountered EOF at top level. */ } else { /* Remove leading and trailing whitespace from the line. Then, if there is anything left, add it to the history list and execute it. */ stripwhite (line); if (*line) { add_history (line); execute_line (line); } } if (line) free (line); } exit (0); } /* Execute a command line. */ execute_line (line) char *line; { register int i; COMMAND *find_command (), *command; char *word; /* Isolate the command word. */ i = 0; while (line[i] && !whitespace (line[i])) i++; word = line; if (line[i]) line[i++] = '\0'; command = find_command (word); if (!command) { fprintf (stderr, "%s: No such command for FileMan.\n", word); return; } /* Get argument to command, if any. */ while (whitespace (line[i])) i++; word = line + i; /* Call the function. */ (*(command->func)) (word); } /* Look up NAME as the name of a command, and return a pointer to that command. Return a NULL pointer if NAME isn't a command name. */ COMMAND * find_command (name) char *name; { register int i; for (i = 0; commands[i].name; i++) if (strcmp (name, commands[i].name) == 0) return (&commands[i]); return ((COMMAND *)NULL); } /* Strip whitespace from the start and end of STRING. */ stripwhite (string) char *string; { register int i = 0; while (whitespace (string[i])) i++; if (i) strcpy (string, string + i); i = strlen (string) - 1; while (i > 0 && whitespace (string[i])) i--; string[++i] = '\0'; } /* **************************************************************** */ /* */ /* Interface to Readline Completion */ /* */ /* **************************************************************** */ /* Tell the GNU Readline library how to complete. We want to try to complete on command names if this is the first word in the line, or on filenames if not. */ initialize_readline () { char **fileman_completion (); /* Allow conditional parsing of the ~/.inputrc file. */ rl_readline_name = "FileMan"; /* Tell the completer that we want a crack first. */ rl_attempted_completion_function = (Function *)fileman_completion; } /* Attempt to complete on the contents of TEXT. START and END show the region of TEXT that contains the word to complete. We can use the entire line in case we want to do some simple parsing. Return the array of matches, or NULL if there aren't any. */ char ** fileman_completion (text, start, end) char *text; int start, end; { char **matches; char *command_generator (); matches = (char **)NULL; /* If this word is at the start of the line, then it is a command to complete. Otherwise it is the name of a file in the current directory. */ if (start == 0) matches = completion_matches (text, command_generator); return (matches); } /* Generator function for command completion. STATE lets us know whether to start from scratch; without any state (i.e. STATE == 0), then we start at the top of the list. */ char * command_generator (text, state) char *text; int state; { static int list_index, len; char *name; /* If this is a new word to complete, initialize now. This includes saving the length of TEXT for efficiency, and initializing the index variable to 0. */ if (!state) { list_index = 0; len = strlen (text); } /* Return the next name which partially matches from the command list. */ while (name = commands[list_index].name) { list_index++; if (strncmp (name, text, len) == 0) return (name); } /* If no names matched, then return NULL. */ return ((char *)NULL); } /* **************************************************************** */ /* */ /* FileMan Commands */ /* */ /* **************************************************************** */ /* String to pass to system (). This is for the LIST, VIEW and RENAME commands. */ static char syscom[1024]; /* List the file(s) named in arg. */ com_list (arg) char *arg; { if (!arg) arg = "*"; sprintf (syscom, "ls -FClg %s", arg); system (syscom); } com_view (arg) char *arg; { if (!valid_argument ("view", arg)) return; sprintf (syscom, "cat %s | more", arg); system (syscom); } com_rename (arg) char *arg; { too_dangerous ("rename"); } com_stat (arg) char *arg; { struct stat finfo; if (!valid_argument ("stat", arg)) return; if (stat (arg, &finfo) == -1) { perror (arg); return; } printf ("Statistics for `%s':\n", arg); printf ("%s has %d link%s, and is %d bytes in length.\n", arg, finfo.st_nlink, (finfo.st_nlink == 1) ? "" : "s", finfo.st_size); printf (" Created on: %s", ctime (&finfo.st_ctime)); printf (" Last access at: %s", ctime (&finfo.st_atime)); printf ("Last modified at: %s", ctime (&finfo.st_mtime)); } com_delete (arg) char *arg; { too_dangerous ("delete"); } /* Print out help for ARG, or for all of the commands if ARG is not present. */ com_help (arg) char *arg; { register int i; int printed = 0; for (i = 0; commands[i].name; i++) { if (!*arg || (strcmp (arg, commands[i].name) == 0)) { printf ("%s\t\t%s.\n", commands[i].name, commands[i].doc); printed++; } } if (!printed) { printf ("No commands match `%s'. Possibilties are:\n", arg); for (i = 0; commands[i].name; i++) { /* Print in six columns. */ if (printed == 6) { printed = 0; printf ("\n"); } printf ("%s\t", commands[i].name); printed++; } if (printed) printf ("\n"); } } /* Change to the directory ARG. */ com_cd (arg) char *arg; { if (chdir (arg) == -1) perror (arg); com_pwd (""); } /* Print out the current working directory. */ com_pwd (ignore) char *ignore; { char dir[1024]; (void) getwd (dir); printf ("Current directory is %s\n", dir); } /* The user wishes to quit using this program. Just set DONE non-zero. */ com_quit (arg) char *arg; { done = 1; } /* Function which tells you that you can't do this. */ too_dangerous (caller) char *caller; { fprintf (stderr, "%s: Too dangerous for me to distribute. Write it yourself.\n", caller); } /* Return non-zero if ARG is a valid argument for CALLER, else print an error message and return zero. */ int valid_argument (caller, arg) char *caller, *arg; { if (!arg || !*arg) { fprintf (stderr, "%s: Argument required.\n", caller); return (0); } return (1); } /* * Local variables: * compile-command: "cc -g -I../.. -L.. -o fileman fileman.c -lreadline -ltermcap" * end: */ octave-1.1.0/readline/examples/manexamp.c100666 415 17 4641 5440717075 16530 0ustar jweusers/* manexamp.c -- The examples which appear in the documentation are here. */ #include #include /* **************************************************************** */ /* */ * How to Emulate gets () */ /* */ /* **************************************************************** */ /* A static variable for holding the line. */ static char *line_read = (char *)NULL; /* Read a string, and return a pointer to it. Returns NULL on EOF. */ char * do_gets () { /* If the buffer has already been allocated, return the memory to the free pool. */ if (line_read != (char *)NULL) { free (line_read); line_read = (char *)NULL; } /* Get a line from the user. */ line_read = readline (""); /* If the line has any text in it, save it on the history. */ if (line_read && *line_read) add_history (line_read); return (line_read); } /* **************************************************************** */ /* */ /* Writing a Function to be Called by Readline. */ /* */ /* **************************************************************** */ /* Invert the case of the COUNT following characters. */ invert_case_line (count, key) int count, key; { register int start, end; start = rl_point; if (count < 0) { direction = -1; count = -count; } else direction = 1; /* Find the end of the range to modify. */ end = start + (count * direction); /* Force it to be within range. */ if (end > rl_end) end = rl_end; else if (end < 0) end = -1; if (start > end) { int temp = start; start = end; end = temp; } if (start == end) return; /* Tell readline that we are modifying the line, so save the undo information. */ rl_modifying (start, end); for (; start != end; start += direction) { if (uppercase_p (rl_line_buffer[start])) rl_line_buffer[start] = to_lower (rl_line_buffer[start]); else if (lowercase_p (rl_line_buffer[start])) rl_line_buffer[start] = to_upper (rl_line_buffer[start]); } /* Move point to on top of the last character changed. */ rl_point = end - direction; } octave-1.1.0/readline/COPYING100666 415 17 31201 5440717073 14001 0ustar jweusers GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. The Free Software Foundation has exempted Bash from the requirement of Paragraph 2c of the General Public License. This is to say, there is no requirement for Bash to print a notice when it is started interactively in the usual way. We made this exception because users and standards expect shells not to print such messages. This exception applies to any program that serves as a shell and that is based primarily on Bash as opposed to other GNU software. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our 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. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, 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 a 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 tell them 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. 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 Agreement 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 work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 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 General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual 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 General Public License. d) 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. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 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 Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying 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. 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. 7. 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 the 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 the license, you may choose any version ever published by the Free Software Foundation. 8. 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 9. 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. 10. 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 Appendix: 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 humanity, 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. Copyright (C) 19yy 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, 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) 19xx 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 a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! octave-1.1.0/readline/Makefile.in100666 415 17 5465 5662226327 15013 0ustar jweusers# # Makefile for octave's readline directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ INCFLAGS = -I. -I$(srcdir)/.. SOURCES = $(wildcard $(srcdir)/*.c) INCLUDES = $(wildcard $(srcdir)/*.h) DISTFILES = COPYING Makefile.in ChangeLog.old Makefile.old \ $(SOURCES) $(INCLUDES) SUBDIRS = doc examples # This is why you need GNU make. Doing this without functions is too # ugly to think about. READLINE_CSRC = $(wildcard $(srcdir)/*.c) READLINE_BAS1 = $(notdir $(READLINE_CSRC)) # Don't compile emacs_keymap.c and vi_keymap.c since they are included # by keymaps.c. READLINE_BAS2 = $(subst emacs_keymap.c, , $(READLINE_BAS1)) READLINE_BASE = $(subst vi_keymap.c, , $(READLINE_BAS2)) READLINE_OBJ = $(patsubst %.c, %.o, $(READLINE_BASE)) LIBREADLINE_DEPEND := $(patsubst %, libreadline.a(%), $(READLINE_OBJ)) # Define TYPES as -DVOID_SIGHANDLER if your operating system uses # a return type of "void" for signal handlers. # TYPES = -DVOID_SIGHANDLER # Define USG as -DUSG if you are using a System V operating system. #USG = -DUSG # HP-UX compilation requires the BSD library. #LOCAL_LIBS = -lBSD # Xenix compilation requires -ldir -lx #LOCAL_LIBS = -ldir -lx # Comment out "-DVI_MODE" if you don't think that anyone will ever desire # the vi line editing mode and features. Make sure to comment out the # definition of VI if you remove the -DVI_MODE. READLINE_DEFINES = $(TYPES) -DVI_MODE=1 -DPAREN_MATCHING=1 # Override Makeconf's definition of UGLY_ALL_CFLAGS. UGLY_ALL_CFLAGS = $(INCFLAGS) $(UGLY_DEFS) $(READLINE_DEFINES) $(CFLAGS) .c.o: $(CC) -c $(CPPFLAGS) $(UGLY_ALL_CFLAGS) $< all: libreadline.a .PHONY: all libreadline.a: $(LIBREADLINE_DEPEND) $(RANLIB) libreadline.a check: all .PHONY: check install: all .PHONY: install uninstall: .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: rm -f *.a *.o .PHONY: clean mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile *.a .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: for dir in $(SUBDIRS); do mkdir ../`cat ../.fname`/readline/$$dir; cd $$dir; $(MAKE) $@; cd ..; done ln $(DISTFILES) ../`cat ../.fname`/readline .PHONY: local-dist dist: for dir in $(SUBDIRS); do mkdir ../`cat ../.fname`/readline/$$dir; cd $$dir; $(MAKE) $@; cd ..; done ln $(DISTFILES) ../`cat ../.fname`/readline .PHONY: dist readline.o: readline.c readline.h chardefs.h keymaps.h history.h history.o: history.c history.h vi_mode.o: vi_mode.c funmap.o: funmap.c readline.h keymaps.o: keymaps.c emacs_keymap.c vi_keymap.c keymaps.h chardefs.h octave-1.1.0/readline/ChangeLog.old100666 415 17 33555 5440717074 15314 0ustar jweusersTue Mar 23 14:36:51 1993 Brian Fox (bfox@eos.crseo.ucsb.edu) * readline.c (rl_copy): Changed name to rl_copy_text. Mon Mar 22 19:16:05 1993 Brian Fox (bfox@eos.crseo.ucsb.edu) * dispose_cmd.c, several other files. Declare dispose_xxx () as "void". * builtins/hashcom.h: Make declarations of hashed_filenames be "extern" to keep the SGI compiler happy. * readline.c (rl_initialize_everything): Assign values to out_stream and in_stream immediately, since output_character_function () can be called before readline_internal () is called. Tue Dec 8 09:30:56 1992 Brian Fox (bfox@cubit) * readline.c (rl_init_terminal) Set PC from BC, not from *buffer. Mon Nov 30 09:35:47 1992 Brian Fox (bfox@cubit) * readline.c (invoking_keyseqs_in_map, rl_parse_and_bind) Allow backslash to quote characters, such as backslash, double quote, and space. Backslash quotes all character indiscriminately. * funmap.c (vi_keymap) Fix type in "vi-replace" declaration. Fri Nov 20 10:55:05 1992 Brian Fox (bfox@cubit) * readline.c (init_terminal_io, rl_prep_terminal): FINALLY! Declare and use termcap variable `ospeed' when setting up terminal parameters. Thu Oct 8 08:53:07 1992 Brian J. Fox (bfox@helios) * Makefile, this directory: Include (as links to the canonical sources), tilde.c, tilde.h, posixstat.h and xmalloc.c. Tue Sep 29 13:07:21 1992 Brian J. Fox (bfox@helios) * readline.c (init_terminal_io) Don't set arrow keys if the key sequences that represent them are already set. * readline.c (rl_function_of_keyseq) New function returns the first function (or macro) found while searching a key sequence. Mon Sep 28 00:34:04 1992 Brian J. Fox (bfox@helios) * readline.c (LibraryVersion) New static char * contains current version number. Version is at 2.0. * readline.c (rl_complete_internal): Incorporated clean changes from gilmore (gnu@cygnus.com) to support quoted substrings within completion functions. * readline.c (many locations) Added support for the _GO32_, whatever that is. Patches supplied by Cygnus, typed in by hand, with cleanups. Sun Aug 16 12:46:24 1992 Brian Fox (bfox@cubit) * readline.c (init_terminal_io): Find out the values of the keypad arrows and bind them to appropriate RL functions if present. Mon Aug 10 18:13:24 1992 Brian Fox (bfox@cubit) * history.c (stifle_history): A negative argument to stifle becomes zero. Tue Jul 28 09:28:41 1992 Brian Fox (bfox@cubit) * readline.c (rl_variable_bind): New local structure describes booleans by name and address; code in rl_variable_bind () looks at structure to set simple variables. * parens.c (rl_insert_close): New variable rl_blink_matching_paren is non-zero if we want to blink the matching open when a close is inserted. If FD_SET is defined, rl_blink_matching_paren defaults to 1, else 0. If FD_SET is not defined, and rl_blink_matching_paren is non-zero, the close character(s) are/is simply inserted. Wed Jul 22 20:03:59 1992 Brian Fox (bfox@cubit) * history.c, readline.c, vi_mode.c: Cause the functions strchr () and strrchr () to be used instead of index () and rindex () throughout the source. Mon Jul 13 11:34:07 1992 Brian Fox (bfox@cubit) * readline.c: (rl_variable_bind) New variable "meta-flag" if "on" means force the use of the 8th bit as Meta bit. Internal variable is called meta_flag. Thu Jul 9 10:37:56 1992 Brian Fox (bfox@cubit) * history.c (get_history_event) Change INDEX to LOCAL_INDEX. If compiling for the shell, allow shell metacharacters to separate history tokens as they would for shell tokens. Sat Jul 4 19:29:12 1992 Brian Fox (bfox@cubit) * vi_keymap.c: According to Posix, TAB self-inserts instead of doing completion. * vi_mode.c: (rl_vi_yank_arg) Enter VI insert mode after yanking an arg from the previous line. * search.c: New file takes over vi style searching and implements non-incremental searching the history. Makefile: Add search.c and search.o. funmap.c: Add names for non-incremental-forward-search-history and non-incremental-reverse-search-history. readline.h: Add extern definitions for non-incremental searching. vi_mode.c: Remove old search code; add calls to code in search.c. Fri Jul 3 10:36:33 1992 Brian Fox (bfox@cubit) * readline.c (rl_delete_horizontal_space); New function deletes all whitespace surrounding point. funmap.c: Add "delete-horizontal-space". emacs_keymap.c: Put rl_delete_horizontal_space () on M-\. * readline.c (rl_set_signals, rl_clear_signals); New function rl_set_sighandler () is either defined in a Posix way (if HAVE_POSIX_SIGNALS is defined) or in a BSD way. Function is called from rl_set_signals () and rl_clear_signals (). Fri May 8 12:50:15 1992 Brian Fox (bfox@cubit) * readline.c: (readline_default_bindings) Do comparisons with _POSIX_VDISABLE casted to `unsigned char'. Change tty characters to be unsigned char. Thu Apr 30 12:36:35 1992 Brian Fox (bfox@cubit) * readline.c: (rl_getc) Handle "read would block" error on non-blocking IO streams. * readline.c: (rl_signal_handler): Unblock only the signal that we have caught, not all signals. Sun Feb 23 03:33:09 1992 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: Many functions. Use only the macros META_CHAR and UNMETA to deal with meta characters. Prior to this, we used numeric values and tests. * readline.c (rl_complete_internal) Report exactly the number of possible completions, not the number + 1. * vi_mode.c (rl_do_move) Do not change the cursor position when using `cw' or `cW'. * vi_mode.c (rl_vi_complete) Enter insert mode after completing with `*' or `\'. Fri Feb 21 05:58:18 1992 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (rl_dispatch) Increment rl_key_sequence_length for meta characters that map onto ESC map. Mon Feb 10 01:41:35 1992 Brian Fox (bfox at gnuwest.fsf.org) * history.c (history_do_write) Build a buffer of all of the lines to write and write them in one fell swoop (lower overhead than calling write () for each line). Suggested by Peter Ho. * readline.c: Include hbullx20 as well as hpux for determining USGr3ness. * readline.c (rl_unix_word_rubout) As per the "Now REMEMBER" comment, pass arguments to rl_kill_text () in the correct order to preserve prepending and appending of killed text. * readline.c (rl_search_history) malloc (), realloc (), and free () SEARCH_STRING so that there are no static limits on searching. * vi_mode.c (rl_vi_subst) Don't forget to end the undo group. Fri Jan 31 14:51:02 1992 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (rl_signal_handler): Zero the current history entry's pointer after freeing the undo_list when SIGINT received. Reformat a couple of functions. Sat Jan 25 13:47:35 1992 Brian Fox (bfox at bears) * readline.c (parser_if): free () TNAME after use. Tue Jan 21 01:01:35 1992 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (rl_redisplay) and (rl_character_len): Display Control characters as "^c" and Meta characters as "\234", instead of "C-C" and "M-C". Sun Dec 29 10:59:00 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (init_terminal_io) Default to environment variables LINES and COLUMNS before termcap entry values. If all else fails, then assume 80x24 terminal. Sat Dec 28 16:33:11 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: If this machine is USG and it is hpux, then define USGr3. * history.c: Cosmetic fixes. Thu Nov 21 00:10:12 1991 Brian Fox (bfox at gnuwest.fsf.org) * vi_mode.c: (rl_do_move) Place cursor at end of line, never at next to last character. Thu Nov 14 05:08:01 1991 Brian Fox (bfox at gnuwest.fsf.org) * history.c (get_history_event) Non-anchored searches can have a return index of greater than zero from get_history_event (). Fri Nov 1 07:02:13 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (rl_translate_keyseq) Make C-? translate to RUBOUT unconditionally. Mon Oct 28 11:34:52 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c; Use Posix directory routines and macros. * funmap.c; Add entry for call-last-kbd-macro. * readline.c (rl_prep_term); Use system EOF character on POSIX systems also. Thu Oct 3 16:19:53 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c; Make a distinction between having a TERMIOS tty driver, and having POSIX signal handling. You might one without the other. New defines used HAVE_POSIX_SIGNALS, and TERMIOS_TTY_DRIVER. Tue Jul 30 22:37:26 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: rl_getc () If a call to read () returns without an error, but with zero characters, the file is empty, so return EOF. Thu Jul 11 20:58:38 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: (rl_get_next_history, rl_get_previous_history) Reallocate the buffer space if the line being moved to is longer the the current space allocated. Amazing that no one has found this bug until now. Sun Jul 7 02:37:05 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c:(rl_parse_and_bind) Allow leading whitespace. Make sure TERMIO and TERMIOS systems treat CR and NL disctinctly. Tue Jun 25 04:09:27 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: Rework parsing conditionals to pay attention to the prior states of the conditional stack. This makes $if statements work correctly. Mon Jun 24 20:45:59 1991 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: support for displaying key binding information includes the functions rl_list_funmap_names (), invoking_keyseqs_in_map (), rl_invoking_keyseqs (), rl_dump_functions (), and rl_function_dumper (). funmap.c: support for same includes rl_funmap_names (). readline.c, funmap.c: no longer define STATIC_MALLOC. However, update both version of xrealloc () to handle a null pointer. Thu Apr 25 12:03:49 1991 Brian Fox (bfox at gnuwest.fsf.org) * vi_mode.c (rl_vi_fword, fWord, etc. All functions use the macro `isident()'. Fixed movement bug which prevents continious movement through the text. Fri Jul 27 16:47:01 1990 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (parser_if) Allow "$if term=foo" construct. Wed May 23 16:10:33 1990 Brian Fox (bfox at gnuwest.fsf.org) * readline.c (rl_dispatch) Correctly remember the last command executed. Fixed typo in username_completion_function (). Mon Apr 9 19:55:48 1990 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: username_completion_function (); For text passed in with a leading `~', remember that this could be a filename (after it is completed). Thu Apr 5 13:44:24 1990 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: rl_search_history (): Correctly handle case of an unfound search string, but a graceful exit (as with ESC). * readline.c: rl_restart_output (); The Apollo passes the address of the file descriptor to TIOCSTART, not the descriptor itself. Tue Mar 20 05:38:55 1990 Brian Fox (bfox at gnuwest.fsf.org) * readline.c: rl_complete (); second call in a row causes possible completions to be listed. * readline.c: rl_redisplay (), added prompt_this_line variable which is the first character character following \n in prompt. Sun Mar 11 04:32:03 1990 Brian Fox (bfox at gnuwest.fsf.org) * Signals are now supposedly handled inside of SYSV compilation. Wed Jan 17 19:24:09 1990 Brian Fox (bfox at sbphy.ucsb.edu) * history.c: history_expand (); fixed overwriting memory error, added needed argument to call to get_history_event (). Thu Jan 11 10:54:04 1990 Brian Fox (bfox at sbphy.ucsb.edu) * readline.c: added mark_modified_lines to control the display of an asterisk on modified history lines. Also added a user variable called mark-modified-lines to the `set' command. Thu Jan 4 10:38:05 1990 Brian Fox (bfox at sbphy.ucsb.edu) * readline.c: start_insert (). Only use IC if we don't have an im capability. Fri Sep 8 09:00:45 1989 Brian Fox (bfox at aurel) * readline.c: rl_prep_terminal (). Only turn on 8th bit as meta-bit iff the terminal is not using parity. Sun Sep 3 08:57:40 1989 Brian Fox (bfox at aurel) * readline.c: start_insert (). Uses multiple insertion call in cases where that makes sense. rl_insert (). Read type-ahead buffer for additional keys that are bound to rl_insert, and insert them all at once. Make insertion of single keys given with an argument much more efficient. Tue Aug 8 18:13:57 1989 Brian Fox (bfox at aurel) * readline.c: Changed handling of EOF. readline () returns (char *)EOF or consed string. The EOF character is read from the tty, or if the tty doesn't have one, defaults to C-d. * readline.c: Added support for event driven programs. rl_event_hook is the address of a function you want called while Readline is waiting for input. * readline.c: Cleanup time. Functions without type declarations do not use return with a value. * history.c: history_expand () has new variable which is the characters to ignore immediately following history_expansion_char. Sun Jul 16 08:14:00 1989 Brian Fox (bfox at aurel) * rl_prep_terminal () BSD version turns off C-s, C-q, C-y, C-v. * readline.c -- rl_prep_terminal () SYSV version hacks readline_echoing_p. BSD version turns on passing of the 8th bit for the duration of reading the line. Tue Jul 11 06:25:01 1989 Brian Fox (bfox at aurel) * readline.c: new variable rl_tilde_expander. If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text sans tilde (as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. * readline.h - new file chardefs.h Separates things that only readline.c needs from the standard header file publishing interesting things about readline. * readline.c: readline_default_bindings () now looks at terminal chararacters and binds those as well. Wed Jun 28 20:20:51 1989 Brian Fox (bfox at aurel) * Made readline and history into independent libraries. octave-1.1.0/readline/Makefile.old100666 415 17 7412 5440717074 15153 0ustar jweusers## -*- text -*- #################################################### # # # Makefile for the GNU Readline and History Libraries. # # # #################################################################### # This Makefile is hand made from a template file, found in # ../template. Each library must provide several Makefile # targets: `all', `clean', `documentation', `install', and # `what-tar'. The `what-tar' target reports the names of the # files that need to be included in a tarfile to build the full # code and documentation for this library. # Please note that the values for INCLUDES, CC, AR, RM, CP, # RANLIB, and selfdir are passed in from ../Makefile, and do # not need to be defined here. # Here is a rule for making .o files from .c files that doesn't force # the type of the machine (like -sun3) into the flags. .c.o: $(CC) -c $(CFLAGS) $(INCLUDES) $(LOCAL_DEFINES) $(CPPFLAGS) $*.c # LOCAL_DEFINES are flags that are specific to this library. # Comment out "-DVI_MODE" if you don't think that anyone will ever desire # the vi line editing mode and features. Define -DUSG if you are using a # System V operating system. LOCAL_DEFINES = $(LOCAL_INCLUDES) -DVI_MODE #-DUSG # Some systems need to define this (like older NeXT systems) in order # to prevent namespace conflicts. CFLAGS = # -DSTATIC_MALLOC # For libraries which include headers from other libraries. LOCAL_INCLUDES = -I. -I../ # The name of the main library target. LIBRARY_NAME = libreadline.a # The C code source files for this library. CSOURCES = readline.c funmap.c keymaps.c vi_mode.c parens.c \ rltty.c complete.c bind.c isearch.c display.c signals.c \ emacs_keymap.c vi_keymap.c history.c tilde.c xmalloc.c # The header files for this library. HSOURCES = readline.h rldefs.h chardefs.h keymaps.h history.h \ posixstat.h tilde.h OBJECTS = readline.o vi_mode.o funmap.o keymaps.o parens.o search.o \ rltty.o complete.o bind.o isearch.o display.o signals.o \ history.o tilde.o xmalloc.o # The texinfo files which document this library. DOCSOURCE = doc/rlman.texinfo doc/rltech.texinfo doc/rluser.texinfo DOCOBJECT = doc/readline.dvi DOCSUPPORT = doc/Makefile DOCUMENTATION = $(DOCSOURCE) $(DOCOBJECT) $(DOCSUPPORT) SUPPORT = Makefile ChangeLog $(DOCSUPPORT) examples/[-a-z.]* SOURCES = $(CSOURCES) $(HSOURCES) $(DOCSOURCE) THINGS_TO_TAR = $(SOURCES) $(SUPPORT) ########################################################################## all: libreadline.a libhistory.a libreadline.a: $(OBJECTS) $(RM) -f $@ $(AR) cq $@ $(OBJECTS) -if [ -f "$(RANLIB)" ]; then $(RANLIB) $@; fi libhistory.a: history.o $(RM) -f $@ $(AR) cq $@ history.o -if [ -f "$(RANLIB)" ]; then $(RANLIB) $@; fi what-tar: @for file in $(THINGS_TO_TAR); do \ echo $(selfdir)$$file; \ done documentation: force (cd doc; make) force: # The rule for 'includes' is written funny so that the if statement # always returns TRUE unless there really was an error installing the # include files. install: if [ -r $(incdir)/readline ]; then \ :; \ else \ mkdir $(incdir)/readline && chmod a+r $(incdir)/readline; \ fi $(CP) readline.h keymaps.h chardefs.h history.h $(incdir)/readline/ -mv $(bindir)/libreadline.a $(bindir)/libreadline.old cp libreadline.a $(bindir)/libreadline.a if [ -f "$(RANLIB)" ]; then $(RANLIB) -t $(bindir)/libreadline.a; fi clean: rm -f $(OBJECTS) *.a (cd doc; make clean) readline: readline.h rldefs.h chardefs.h readline: $(OBJECTS) $(CC) $(CFLAGS) $(CPPFLAGS) $(READLINE_DEFINES) \ $(LOCAL_INCLUDES) -DTEST -o readline readline.c vi_mode.o funmap.o \ keymaps.o -ltermcap readline.o: readline.c readline.h rldefs.h chardefs.h readline.o: keymaps.h history.h vi_mode.o: vi_mode.c funmap.o: funmap.c readline.h keymaps.o: keymaps.c emacs_keymap.c vi_keymap.c keymaps.h chardefs.h octave-1.1.0/readline/bind.c100666 415 17 103254 5521547743 14063 0ustar jweusers/* bind.c -- key binding and startup file support for the readline library. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #if !defined (NO_SYS_FILE) # include #endif /* !NO_SYS_FILE */ #include #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include /* Not all systems declare ERRNO in errno.h... and some systems #define it! */ #if !defined (errno) extern int errno; #endif /* !errno */ #include "posixstat.h" /* System-specific feature definitions and include files. */ #include "rldefs.h" /* Some standard library routines. */ #include "readline.h" #include "history.h" #if !defined (strchr) && !defined (__STDC__) extern char *strchr (), *strrchr (); #endif /* !strchr && !__STDC__ */ extern char *tilde_expand (); extern int _rl_horizontal_scroll_mode; extern int _rl_mark_modified_lines; extern int _rl_prefer_visible_bell; extern int _rl_meta_flag; extern int rl_blink_matching_paren; extern int _rl_convert_meta_chars_to_ascii; #if defined (VISIBLE_STATS) extern int rl_visible_stats; #endif /* VISIBLE_STATS */ extern int rl_complete_with_tilde_expansion; extern int rl_completion_query_items; extern int rl_explicit_arg; extern int rl_editing_mode; extern unsigned short _rl_parsing_conditionalized_out; extern Keymap _rl_keymap; extern char *possible_control_prefixes[], *possible_meta_prefixes[]; extern char **rl_funmap_names (); static int glean_key_from_name (); static int stricmp (), strnicmp (); #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ /* Defined in this file */ extern int rl_bind_key (), rl_generic_bind (), rl_translate_keyseq (), rl_read_init_file (), rl_parse_and_bind (), rl_variable_bind (); /* Defined in funmap.c */ extern int rl_add_funmap_entry (); extern void rl_initialize_funmap (); /* Defined in display.c */ extern int rl_on_new_line (); /* **************************************************************** */ /* */ /* Binding keys */ /* */ /* **************************************************************** */ /* rl_add_defun (char *name, Function *function, int key) Add NAME to the list of named functions. Make FUNCTION be the function that gets called. If KEY is not -1, then bind it. */ int rl_add_defun (name, function, key) char *name; Function *function; int key; { if (key != -1) rl_bind_key (key, function); rl_add_funmap_entry (name, function); return 0; } /* Bind KEY to FUNCTION. Returns non-zero if KEY is out of range. */ int rl_bind_key (key, function) int key; Function *function; { if (key < 0) return (key); if (META_CHAR (key) && _rl_convert_meta_chars_to_ascii) { if (_rl_keymap[ESC].type == ISKMAP) { #if defined (CRAY) Keymap escmap = (Keymap)((int)_rl_keymap[ESC].function); #else Keymap escmap = (Keymap)_rl_keymap[ESC].function; #endif key = UNMETA (key); escmap[key].type = ISFUNC; escmap[key].function = function; return (0); } return (key); } _rl_keymap[key].type = ISFUNC; _rl_keymap[key].function = function; return (0); } /* Bind KEY to FUNCTION in MAP. Returns non-zero in case of invalid KEY. */ int rl_bind_key_in_map (key, function, map) int key; Function *function; Keymap map; { int result; Keymap oldmap = _rl_keymap; _rl_keymap = map; result = rl_bind_key (key, function); _rl_keymap = oldmap; return (result); } /* Make KEY do nothing in the currently selected keymap. Returns non-zero in case of error. */ int rl_unbind_key (key) int key; { return (rl_bind_key (key, (Function *)NULL)); } /* Make KEY do nothing in MAP. Returns non-zero in case of error. */ int rl_unbind_key_in_map (key, map) int key; Keymap map; { return (rl_bind_key_in_map (key, (Function *)NULL, map)); } /* Bind the key sequence represented by the string KEYSEQ to FUNCTION. This makes new keymaps as necessary. The initial place to do bindings is in MAP. */ int rl_set_key (keyseq, function, map) char *keyseq; Function *function; Keymap map; { rl_generic_bind (ISFUNC, keyseq, function, map); return 0; } /* Bind the key sequence represented by the string KEYSEQ to the string of characters MACRO. This makes new keymaps as necessary. The initial place to do bindings is in MAP. */ int rl_macro_bind (keyseq, macro, map) char *keyseq, *macro; Keymap map; { char *macro_keys; int macro_keys_len; macro_keys = (char *)xmalloc ((2 * strlen (macro)) + 1); if (rl_translate_keyseq (macro, macro_keys, ¯o_keys_len)) { free (macro_keys); return -1; } rl_generic_bind (ISMACR, keyseq, macro_keys, map); return 0; } /* Bind the key sequence represented by the string KEYSEQ to the arbitrary pointer DATA. TYPE says what kind of data is pointed to by DATA, right now this can be a function (ISFUNC), a macro (ISMACR), or a keymap (ISKMAP). This makes new keymaps as necessary. The initial place to do bindings is in MAP. */ int rl_generic_bind (type, keyseq, data, map) int type; char *keyseq, *data; Keymap map; { char *keys; int keys_len; register int i; /* If no keys to bind to, exit right away. */ if (!keyseq || !*keyseq) { if (type == ISMACR) free (data); return -1; } keys = xmalloc (1 + (2 * strlen (keyseq))); /* Translate the ASCII representation of KEYSEQ into an array of characters. Stuff the characters into KEYS, and the length of KEYS into KEYS_LEN. */ if (rl_translate_keyseq (keyseq, keys, &keys_len)) { free (keys); return -1; } /* Bind keys, making new keymaps as necessary. */ for (i = 0; i < keys_len; i++) { int ic = (int) ((unsigned char)keys[i]); if (_rl_convert_meta_chars_to_ascii && META_CHAR (ic)) { ic = UNMETA (ic); if (map[ESC].type == ISKMAP) map = (Keymap) map[ESC].function; } if ((i + 1) < keys_len) { if (map[ic].type != ISKMAP) { if (map[ic].type == ISMACR) free ((char *)map[ic].function); map[ic].type = ISKMAP; map[ic].function = (Function *)rl_make_bare_keymap (); } map = (Keymap)map[ic].function; } else { if (map[ic].type == ISMACR) free ((char *)map[ic].function); map[ic].function = (Function *)data; map[ic].type = type; } } free (keys); return 0; } /* Translate the ASCII representation of SEQ, stuffing the values into ARRAY, an array of characters. LEN gets the final length of ARRAY. Return non-zero if there was an error parsing SEQ. */ int rl_translate_keyseq (seq, array, len) char *seq, *array; int *len; { register int i, c, l = 0; for (i = 0; (c = seq[i]) != '\0'; i++) { if (c == '\\') { c = seq[++i]; if (!c) break; if (((c == 'C' || c == 'M') && seq[i + 1] == '-') || (c == 'e')) { /* Handle special case of backwards define. */ if (strncmp (&seq[i], "C-\\M-", 5) == 0) { array[l++] = ESC; i += 5; array[l++] = CTRL (to_upper (seq[i])); if (!seq[i]) i--; continue; } switch (c) { case 'M': i++; array[l++] = ESC; break; case 'C': i += 2; /* Special hack for C-?... */ if (seq[i] == '?') array[l++] = RUBOUT; else array[l++] = CTRL (to_upper (seq[i])); break; case 'e': array[l++] = ESC; } continue; } } array[l++] = c; } *len = l; array[l] = '\0'; return (0); } /* Return a pointer to the function that STRING represents. If STRING doesn't have a matching function, then a NULL pointer is returned. */ Function * rl_named_function (string) char *string; { register int i; rl_initialize_funmap (); for (i = 0; funmap[i]; i++) if (stricmp (funmap[i]->name, string) == 0) return (funmap[i]->function); return ((Function *)NULL); } /* Return the function (or macro) definition which would be invoked via KEYSEQ if executed in MAP. If MAP is NULL, then the current keymap is used. TYPE, if non-NULL, is a pointer to an int which will receive the type of the object pointed to. One of ISFUNC (function), ISKMAP (keymap), or ISMACR (macro). */ Function * rl_function_of_keyseq (keyseq, map, type) char *keyseq; Keymap map; int *type; { register int i; if (!map) map = _rl_keymap; for (i = 0; keyseq && keyseq[i]; i++) { int ic = keyseq[i]; if (META_CHAR (ic) && _rl_convert_meta_chars_to_ascii) { if (map[ESC].type != ISKMAP) { if (type) *type = map[ESC].type; return (map[ESC].function); } else { map = (Keymap)map[ESC].function; ic = UNMETA (ic); } } if (map[ic].type == ISKMAP) { /* If this is the last key in the key sequence, return the map. */ if (!keyseq[i + 1]) { if (type) *type = ISKMAP; return (map[ic].function); } else map = (Keymap)map[ic].function; } else { if (type) *type = map[ic].type; return (map[ic].function); } } return NULL; } /* The last key bindings file read. */ static char *last_readline_init_file = (char *)NULL; /* Re-read the current keybindings file. */ int rl_re_read_init_file (count, ignore) int count, ignore; { return (rl_read_init_file ((char *)NULL)); } /* The final, last-ditch effort file name for an init file. */ #define DEFAULT_INPUTRC "~/.inputrc" /* Do key bindings from a file. If FILENAME is NULL it defaults to `~/.inputrc'. If the file existed and could be opened and read, 0 is returned, otherwise errno is returned. */ int rl_read_init_file (filename) char *filename; { register int i; char *buffer, *openname, *line, *end; struct stat finfo; int file; /* Default the filename. */ if (!filename) { if (last_readline_init_file) filename = last_readline_init_file; else filename = DEFAULT_INPUTRC; } openname = tilde_expand (filename); if ((stat (openname, &finfo) < 0) || (file = open (openname, O_RDONLY, 0666)) < 0) { free (openname); return (errno); } else free (openname); if (last_readline_init_file) free (last_readline_init_file); last_readline_init_file = savestring (filename); /* Read the file into BUFFER. */ buffer = (char *)xmalloc ((int)finfo.st_size + 1); i = read (file, buffer, finfo.st_size); close (file); if (i != finfo.st_size) return (errno); /* Loop over the lines in the file. Lines that start with `#' are comments; all other lines are commands for readline initialization. */ line = buffer; end = buffer + finfo.st_size; while (line < end) { /* Find the end of this line. */ for (i = 0; line + i != end && line[i] != '\n'; i++); /* Mark end of line. */ line[i] = '\0'; /* If the line is not a comment, then parse it. */ if (*line && *line != '#') rl_parse_and_bind (line); /* Move to the next line. */ line += i + 1; } free (buffer); return (0); } /* **************************************************************** */ /* */ /* Parser Directives */ /* */ /* **************************************************************** */ /* Conditionals. */ /* Calling programs set this to have their argv[0]. */ char *rl_readline_name = "other"; /* Stack of previous values of parsing_conditionalized_out. */ static unsigned char *if_stack = (unsigned char *)NULL; static int if_stack_depth = 0; static int if_stack_size = 0; /* Push _rl_parsing_conditionalized_out, and set parser state based on ARGS. */ static int parser_if (args) char *args; { register int i; /* Push parser state. */ if (if_stack_depth + 1 >= if_stack_size) { if (!if_stack) if_stack = (unsigned char *)xmalloc (if_stack_size = 20); else if_stack = (unsigned char *)xrealloc (if_stack, if_stack_size += 20); } if_stack[if_stack_depth++] = _rl_parsing_conditionalized_out; /* If parsing is turned off, then nothing can turn it back on except for finding the matching endif. In that case, return right now. */ if (_rl_parsing_conditionalized_out) return 0; /* Isolate first argument. */ for (i = 0; args[i] && !whitespace (args[i]); i++); if (args[i]) args[i++] = '\0'; /* Handle "if term=foo" and "if mode=emacs" constructs. If this isn't term=foo, or mode=emacs, then check to see if the first word in ARGS is the same as the value stored in rl_readline_name. */ if (rl_terminal_name && strnicmp (args, "term=", 5) == 0) { char *tem, *tname; /* Terminals like "aaa-60" are equivalent to "aaa". */ tname = savestring (rl_terminal_name); tem = strrchr (tname, '-'); if (tem) *tem = '\0'; /* Test the `long' and `short' forms of the terminal name so that if someone has a `sun-cmd' and does not want to have bindings that will be executed if the terminal is a `sun', they can put `$if term=sun-cmd' into their .inputrc. */ if ((stricmp (args + 5, tname) == 0) || (stricmp (args + 5, rl_terminal_name) == 0)) _rl_parsing_conditionalized_out = 0; else _rl_parsing_conditionalized_out = 1; free (tname); } #if defined (VI_MODE) else if (strnicmp (args, "mode=", 5) == 0) { int mode; if (stricmp (args + 5, "emacs") == 0) mode = emacs_mode; else if (stricmp (args + 5, "vi") == 0) mode = vi_mode; else mode = no_mode; if (mode == rl_editing_mode) _rl_parsing_conditionalized_out = 0; else _rl_parsing_conditionalized_out = 1; } #endif /* VI_MODE */ /* Check to see if the first word in ARGS is the same as the value stored in rl_readline_name. */ else if (stricmp (args, rl_readline_name) == 0) _rl_parsing_conditionalized_out = 0; else _rl_parsing_conditionalized_out = 1; return 0; } /* Invert the current parser state if there is anything on the stack. */ static int parser_else (args) char *args; { register int i; if (!if_stack_depth) { /* Error message? */ return 0; } /* Check the previous (n - 1) levels of the stack to make sure that we haven't previously turned off parsing. */ for (i = 0; i < if_stack_depth - 1; i++) if (if_stack[i] == 1) return 0; /* Invert the state of parsing if at top level. */ _rl_parsing_conditionalized_out = !_rl_parsing_conditionalized_out; return 0; } /* Terminate a conditional, popping the value of _rl_parsing_conditionalized_out from the stack. */ static int parser_endif (args) char *args; { if (if_stack_depth) _rl_parsing_conditionalized_out = if_stack[--if_stack_depth]; else { /* *** What, no error message? *** */ } return 0; } /* Associate textual names with actual functions. */ static struct { char *name; Function *function; } parser_directives [] = { { "if", parser_if }, { "endif", parser_endif }, { "else", parser_else }, { (char *)0x0, (Function *)0x0 } }; /* Handle a parser directive. STATEMENT is the line of the directive without any leading `$'. */ static int handle_parser_directive (statement) char *statement; { register int i; char *directive, *args; /* Isolate the actual directive. */ /* Skip whitespace. */ for (i = 0; whitespace (statement[i]); i++); directive = &statement[i]; for (; statement[i] && !whitespace (statement[i]); i++); if (statement[i]) statement[i++] = '\0'; for (; statement[i] && whitespace (statement[i]); i++); args = &statement[i]; /* Lookup the command, and act on it. */ for (i = 0; parser_directives[i].name; i++) if (stricmp (directive, parser_directives[i].name) == 0) { (*parser_directives[i].function) (args); return (0); } /* *** Should an error message be output? */ return (1); } /* Ugly but working hack for binding prefix meta. */ #define PREFIX_META_HACK static int substring_member_of_array (); /* Read the binding command from STRING and perform it. A key binding command looks like: Keyname: function-name\0, a variable binding command looks like: set variable value. A new-style keybinding looks like "\C-x\C-x": exchange-point-and-mark. */ int rl_parse_and_bind (string) char *string; { char *funname, *kname; register int c, i; int key, equivalency; while (string && whitespace (*string)) string++; if (!string || !*string || *string == '#') return 0; /* If this is a parser directive, act on it. */ if (*string == '$') { handle_parser_directive (&string[1]); return 0; } /* If we aren't supposed to be parsing right now, then we're done. */ if (_rl_parsing_conditionalized_out) return 0; i = 0; /* If this keyname is a complex key expression surrounded by quotes, advance to after the matching close quote. This code allows the backslash to quote characters in the key expression. */ if (*string == '"') { int passc = 0; for (i = 1; (c = string[i]) != '\0'; i++) { if (passc) { passc = 0; continue; } if (c == '\\') { passc++; continue; } if (c == '"') break; } } /* Advance to the colon (:) or whitespace which separates the two objects. */ for (; (c = string[i]) && c != ':' && c != ' ' && c != '\t'; i++ ); equivalency = (c == ':' && string[i + 1] == '='); /* Mark the end of the command (or keyname). */ if (string[i]) string[i++] = '\0'; /* If doing assignment, skip the '=' sign as well. */ if (equivalency) string[i++] = '\0'; /* If this is a command to set a variable, then do that. */ if (stricmp (string, "set") == 0) { char *var = string + i; char *value; /* Make VAR point to start of variable name. */ while (*var && whitespace (*var)) var++; /* Make value point to start of value string. */ value = var; while (*value && !whitespace (*value)) value++; if (*value) *value++ = '\0'; while (*value && whitespace (*value)) value++; rl_variable_bind (var, value); return 0; } /* Skip any whitespace between keyname and funname. */ for (; string[i] && whitespace (string[i]); i++); funname = &string[i]; /* Now isolate funname. For straight function names just look for whitespace, since that will signify the end of the string. But this could be a macro definition. In that case, the string is quoted, so skip to the matching delimiter. We allow the backslash to quote the delimiter characters in the macro body. */ /* This code exists to allow whitespace in macro expansions, which would otherwise be gobbled up by the next `for' loop.*/ /* XXX - it may be desirable to allow backslash quoting only if " is the quoted string delimiter, like the shell. */ if (*funname == '\'' || *funname == '"') { int delimiter = string[i++]; int passc = 0; for (; (c = string[i]) != '\0'; i++) { if (passc) { passc = 0; continue; } if (c == '\\') { passc = 1; continue; } if (c == delimiter) break; } if (c) i++; } /* Advance to the end of the string. */ for (; string[i] && !whitespace (string[i]); i++); /* No extra whitespace at the end of the string. */ string[i] = '\0'; /* Handle equivalency bindings here. Make the left-hand side be exactly whatever the right-hand evaluates to, including keymaps. */ if (equivalency) { return 0; } /* If this is a new-style key-binding, then do the binding with rl_set_key (). Otherwise, let the older code deal with it. */ if (*string == '"') { char *seq = xmalloc (1 + strlen (string)); register int j, k = 0; int passc = 0; for (j = 1; string[j]; j++) { /* Allow backslash to quote characters, but leave them in place. This allows a string to end with a backslash quoting another backslash, or with a backslash quoting a double quote. The backslashes are left in place for rl_translate_keyseq (). */ if (passc || (string[j] == '\\')) { seq[k++] = string[j]; passc = !passc; continue; } if (string[j] == '"') break; seq[k++] = string[j]; } seq[k] = '\0'; /* Binding macro? */ if (*funname == '\'' || *funname == '"') { j = strlen (funname); /* Remove the delimiting quotes from each end of FUNNAME. */ if (j && funname[j - 1] == *funname) funname[j - 1] = '\0'; rl_macro_bind (seq, &funname[1], _rl_keymap); } else rl_set_key (seq, rl_named_function (funname), _rl_keymap); free (seq); return 0; } /* Get the actual character we want to deal with. */ kname = strrchr (string, '-'); if (!kname) kname = string; else kname++; key = glean_key_from_name (kname); /* Add in control and meta bits. */ if (substring_member_of_array (string, possible_control_prefixes)) key = CTRL (to_upper (key)); if (substring_member_of_array (string, possible_meta_prefixes)) key = META (key); /* Temporary. Handle old-style keyname with macro-binding. */ if (*funname == '\'' || *funname == '"') { char seq[2]; int fl = strlen (funname); seq[0] = key; seq[1] = '\0'; if (fl && funname[fl - 1] == *funname) funname[fl - 1] = '\0'; rl_macro_bind (seq, &funname[1], _rl_keymap); } #if defined (PREFIX_META_HACK) /* Ugly, but working hack to keep prefix-meta around. */ else if (stricmp (funname, "prefix-meta") == 0) { char seq[2]; seq[0] = key; seq[1] = '\0'; rl_generic_bind (ISKMAP, seq, (char *)emacs_meta_keymap, _rl_keymap); } #endif /* PREFIX_META_HACK */ else rl_bind_key (key, rl_named_function (funname)); return 0; } /* Simple structure for boolean readline variables (i.e., those that can have one of two values; either "On" or 1 for truth, or "Off" or 0 for false. */ static struct { char *name; int *value; } boolean_varlist [] = { { "horizontal-scroll-mode", &_rl_horizontal_scroll_mode }, { "mark-modified-lines", &_rl_mark_modified_lines }, { "prefer-visible-bell", &_rl_prefer_visible_bell }, { "meta-flag", &_rl_meta_flag }, { "blink-matching-paren", &rl_blink_matching_paren }, { "convert-meta", &_rl_convert_meta_chars_to_ascii }, #if defined (VISIBLE_STATS) { "visible-stats", &rl_visible_stats }, #endif /* VISIBLE_STATS */ { "expand-tilde", &rl_complete_with_tilde_expansion }, { (char *)NULL, (int *)NULL } }; int rl_variable_bind (name, value) char *name, *value; { register int i; /* Check for simple variables first. */ for (i = 0; boolean_varlist[i].name; i++) { if (stricmp (name, boolean_varlist[i].name) == 0) { /* A variable is TRUE if the "value" is "on", "1" or "". */ if ((!*value) || (stricmp (value, "On") == 0) || (value[0] == '1' && value[1] == '\0')) *boolean_varlist[i].value = 1; else *boolean_varlist[i].value = 0; return 0; } } /* Not a boolean variable, so check for specials. */ /* Editing mode change? */ if (stricmp (name, "editing-mode") == 0) { if (strnicmp (value, "vi", 2) == 0) { #if defined (VI_MODE) _rl_keymap = vi_insertion_keymap; rl_editing_mode = vi_mode; #else #if defined (NOTDEF) ding (); #endif /* NOTDEF */ #endif /* VI_MODE */ } else if (strnicmp (value, "emacs", 5) == 0) { _rl_keymap = emacs_standard_keymap; rl_editing_mode = emacs_mode; } } /* Comment string change? */ else if (stricmp (name, "comment-begin") == 0) { #if defined (VI_MODE) extern char *rl_vi_comment_begin; if (*value) { if (rl_vi_comment_begin) free (rl_vi_comment_begin); rl_vi_comment_begin = savestring (value); } #endif /* VI_MODE */ } else if (stricmp (name, "completion-query-items") == 0) { int nval = 100; if (*value) { nval = atoi (value); if (nval < 0) nval = 0; } rl_completion_query_items = nval; } return 0; } /* Return the character which matches NAME. For example, `Space' returns ' '. */ typedef struct { char *name; int value; } assoc_list; static assoc_list name_key_alist[] = { { "DEL", 0x7f }, { "ESC", '\033' }, { "Escape", '\033' }, { "LFD", '\n' }, { "Newline", '\n' }, { "RET", '\r' }, { "Return", '\r' }, { "Rubout", 0x7f }, { "SPC", ' ' }, { "Space", ' ' }, { "Tab", 0x09 }, { (char *)0x0, 0 } }; static int glean_key_from_name (name) char *name; { register int i; for (i = 0; name_key_alist[i].name; i++) if (stricmp (name, name_key_alist[i].name) == 0) return (name_key_alist[i].value); return (*(unsigned char *)name); /* XXX was return (*name) */ } /* Auxiliary functions to manage keymaps. */ static struct { char *name; Keymap map; } keymap_names[] = { { "emacs", emacs_standard_keymap }, { "emacs-standard", emacs_standard_keymap }, { "emacs-meta", emacs_meta_keymap }, { "emacs-ctlx", emacs_ctlx_keymap }, #if defined (VI_MODE) { "vi", vi_movement_keymap }, { "vi-move", vi_movement_keymap }, { "vi-command", vi_movement_keymap }, { "vi-insert", vi_insertion_keymap }, #endif /* VI_MODE */ { (char *)0x0, (Keymap)0x0 } }; Keymap rl_get_keymap_by_name (name) char *name; { register int i; for (i = 0; keymap_names[i].name; i++) if (strcmp (name, keymap_names[i].name) == 0) return (keymap_names[i].map); return ((Keymap) NULL); } void rl_set_keymap (map) Keymap map; { if (map) _rl_keymap = map; } Keymap rl_get_keymap () { return (_rl_keymap); } void rl_set_keymap_from_edit_mode () { if (rl_editing_mode == emacs_mode) _rl_keymap = emacs_standard_keymap; #if defined (VI_MODE) else if (rl_editing_mode == vi_mode) _rl_keymap = vi_insertion_keymap; #endif /* VI_MODE */ } /* **************************************************************** */ /* */ /* Key Binding and Function Information */ /* */ /* **************************************************************** */ /* Each of the following functions produces information about the state of keybindings and functions known to Readline. The info is always printed to rl_outstream, and in such a way that it can be read back in (i.e., passed to rl_parse_and_bind (). */ /* Print the names of functions known to Readline. */ void rl_list_funmap_names (ignore) int ignore; { register int i; char **funmap_names; funmap_names = rl_funmap_names (); if (!funmap_names) return; for (i = 0; funmap_names[i]; i++) fprintf (rl_outstream, "%s\n", funmap_names[i]); free (funmap_names); } /* Return a NULL terminated array of strings which represent the key sequences that are used to invoke FUNCTION in MAP. */ static char ** invoking_keyseqs_in_map (function, map) Function *function; Keymap map; { register int key; char **result; int result_index, result_size; result = (char **)NULL; result_index = result_size = 0; for (key = 0; key < 128; key++) { switch (map[key].type) { case ISMACR: /* Macros match, if, and only if, the pointers are identical. Thus, they are treated exactly like functions in here. */ case ISFUNC: /* If the function in the keymap is the one we are looking for, then add the current KEY to the list of invoking keys. */ if (map[key].function == function) { char *keyname = (char *)xmalloc (5); if (CTRL_P (key)) sprintf (keyname, "\\C-%c", to_lower (UNCTRL (key))); else if (key == RUBOUT) sprintf (keyname, "\\C-?"); else if (key == '\\' || key == '"') { keyname[0] = '\\'; keyname[1] = (char) key; keyname[2] = '\0'; } else { keyname[0] = (char) key; keyname[1] = '\0'; } if (result_index + 2 > result_size) result = (char **) xrealloc (result, (result_size += 10) * sizeof (char *)); result[result_index++] = keyname; result[result_index] = (char *)NULL; } break; case ISKMAP: { char **seqs = (char **)NULL; /* Find the list of keyseqs in this map which have FUNCTION as their target. Add the key sequences found to RESULT. */ if (map[key].function) seqs = #if defined (CRAY) invoking_keyseqs_in_map (function, (Keymap)((int)map[key].function)); #else invoking_keyseqs_in_map (function, (Keymap)map[key].function); #endif if (seqs) { register int i; for (i = 0; seqs[i]; i++) { char *keyname = (char *)xmalloc (6 + strlen (seqs[i])); if (key == ESC) sprintf (keyname, "\\e"); else if (CTRL_P (key)) sprintf (keyname, "\\C-%c", to_lower (UNCTRL (key))); else if (key == RUBOUT) sprintf (keyname, "\\C-?"); else if (key == '\\' || key == '"') { keyname[0] = '\\'; keyname[1] = (char) key; keyname[2] = '\0'; } else { keyname[0] = (char) key; keyname[1] = '\0'; } strcat (keyname, seqs[i]); free (seqs[i]); if (result_index + 2 > result_size) result = (char **) xrealloc (result, (result_size += 10) * sizeof (char *)); result[result_index++] = keyname; result[result_index] = (char *)NULL; } free (seqs); } } break; } } return (result); } /* Return a NULL terminated array of strings which represent the key sequences that can be used to invoke FUNCTION using the current keymap. */ char ** rl_invoking_keyseqs (function) Function *function; { return (invoking_keyseqs_in_map (function, _rl_keymap)); } /* Print all of the current functions and their bindings to rl_outstream. If an explicit argument is given, then print the output in such a way that it can be read back in. */ int rl_dump_functions (count) int count; { void rl_function_dumper (); rl_function_dumper (rl_explicit_arg); rl_on_new_line (); return (0); } /* Print all of the functions and their bindings to rl_outstream. If PRINT_READABLY is non-zero, then print the output in such a way that it can be read back in. */ void rl_function_dumper (print_readably) int print_readably; { register int i; char **names; char *name; names = rl_funmap_names (); fprintf (rl_outstream, "\n"); for (i = 0; (name = names[i]) != NULL; i++) { Function *function; char **invokers; function = rl_named_function (name); invokers = invoking_keyseqs_in_map (function, _rl_keymap); if (print_readably) { if (!invokers) fprintf (rl_outstream, "# %s (not bound)\n", name); else { register int j; for (j = 0; invokers[j]; j++) { fprintf (rl_outstream, "\"%s\": %s\n", invokers[j], name); free (invokers[j]); } free (invokers); } } else { if (!invokers) fprintf (rl_outstream, "%s is not bound to any keys\n", name); else { register int j; fprintf (rl_outstream, "%s can be found on ", name); for (j = 0; invokers[j] && j < 5; j++) { fprintf (rl_outstream, "\"%s\"%s", invokers[j], invokers[j + 1] ? ", " : ".\n"); } if (j == 5 && invokers[j]) fprintf (rl_outstream, "...\n"); for (j = 0; invokers[j]; j++) free (invokers[j]); free (invokers); } } } } /* **************************************************************** */ /* */ /* String Utility Functions */ /* */ /* **************************************************************** */ static char *strindex (); /* Return non-zero if any members of ARRAY are a substring in STRING. */ static int substring_member_of_array (string, array) char *string, **array; { while (*array) { if (strindex (string, *array)) return (1); array++; } return (0); } /* Whoops, Unix doesn't have strnicmp. */ /* Compare at most COUNT characters from string1 to string2. Case doesn't matter. */ static int strnicmp (string1, string2, count) char *string1, *string2; int count; { register char ch1, ch2; while (count) { ch1 = *string1++; ch2 = *string2++; if (to_upper(ch1) == to_upper(ch2)) count--; else break; } return (count); } /* strcmp (), but caseless. */ static int stricmp (string1, string2) char *string1, *string2; { register char ch1, ch2; while (*string1 && *string2) { ch1 = *string1++; ch2 = *string2++; if (to_upper(ch1) != to_upper(ch2)) return (1); } return (*string1 | *string2); } /* Determine if s2 occurs in s1. If so, return a pointer to the match in s1. The compare is case insensitive. */ static char * strindex (s1, s2) register char *s1, *s2; { register int i, l = strlen (s2); register int len = strlen (s1); for (i = 0; (len - i) >= l; i++) if (strnicmp (&s1[i], s2, l) == 0) return (s1 + i); return ((char *)NULL); } octave-1.1.0/readline/complete.c100666 415 17 104320 5521547743 14752 0ustar jweusers/* complete.c -- filename completion for readline. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #if !defined (NO_SYS_FILE) # include #endif /* !NO_SYS_FILE */ #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include /* Not all systems declare ERRNO in errno.h... and some systems #define it! */ #if !defined (errno) extern int errno; #endif /* !errno */ /* These next are for filename completion. Perhaps this belongs in a different place. */ #include #if defined (USG) && !defined (isc386) && !defined (sgi) extern struct passwd *getpwuid (), *getpwent (); #endif #if defined (isc386) && !defined (__STDC__) && defined (_POSIX_SOURCE) extern struct passwd *getpwent (); #endif /* #define HACK_TERMCAP_MOTION */ #include "posixstat.h" /* System-specific feature definitions and include files. */ #include "rldefs.h" /* Some standard library routines. */ #include "readline.h" /* Possible values for do_replace in rl_complete_internal. */ #define NO_MATCH 0 #define SINGLE_MATCH 1 #define MULT_MATCH 2 #if !defined (strchr) && !defined (__STDC__) extern char *strchr (), *strrchr (); #endif /* !strchr && !__STDC__ */ extern char *tilde_expand (); extern char *rl_copy_text (); extern Function *rl_last_func; extern int rl_editing_mode; extern int screenwidth; /* Forward declarations for functions defined and used in this file. */ char *filename_completion_function (); char **completion_matches (); int rl_complete_internal (); /* Defined in display.c */ extern int rl_on_new_line (); static int compare_strings (); static char *rl_strpbrk (); #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ /* If non-zero, then this is the address of a function to call when completing on a directory name. The function is called with the address of a string (the current directory name) as an arg. */ Function *rl_symbolic_link_hook = (Function *)NULL; /* Non-zero means readline completion functions perform tilde expansion. */ int rl_complete_with_tilde_expansion = 0; #define VISIBLE_STATS #if defined (VISIBLE_STATS) # if !defined (X_OK) # define X_OK 1 # endif static int stat_char (); /* Non-zero means add an additional character to each filename displayed during listing completion iff rl_filename_completion_desired which helps to indicate the type of file being listed. */ int rl_visible_stats = 0; #endif /* VISIBLE_STATS */ /* **************************************************************** */ /* */ /* Completion matching, from readline's point of view. */ /* */ /* **************************************************************** */ /* Pointer to the generator function for completion_matches (). NULL means to use filename_entry_function (), the default filename completer. */ Function *rl_completion_entry_function = (Function *)NULL; /* Pointer to alternative function to create matches. Function is called with TEXT, START, and END. START and END are indices in RL_LINE_BUFFER saying what the boundaries of TEXT are. If this function exists and returns NULL then call the value of rl_completion_entry_function to try to match, otherwise use the array of strings returned. */ CPPFunction *rl_attempted_completion_function = (CPPFunction *)NULL; /* Local variable states what happened during the last completion attempt. */ static int completion_changed_buffer = 0; /* Complete the word at or before point. You have supplied the function that does the initial simple matching selection algorithm (see completion_matches ()). The default is to do filename completion. */ int rl_complete (ignore, invoking_key) int ignore, invoking_key; { if (rl_last_func == rl_complete && !completion_changed_buffer) rl_complete_internal ('?'); else rl_complete_internal (TAB); return 0; } /* List the possible completions. See description of rl_complete (). */ int rl_possible_completions (ignore, invoking_key) int ignore, invoking_key; { rl_complete_internal ('?'); return 0; } int rl_insert_completions (ignore, invoking_key) int ignore, invoking_key; { rl_complete_internal ('*'); return 0; } /* The user must press "y" or "n". Non-zero return means "y" pressed. */ int get_y_or_n () { int c; for (;;) { c = rl_read_key (); if (c == 'y' || c == 'Y') return (1); if (c == 'n' || c == 'N') return (0); if (c == ABORT_CHAR) rl_abort (); ding (); } return 0; } /* Up to this many items will be displayed in response to a possible-completions call. After that, we ask the user if she is sure she wants to see them all. */ int rl_completion_query_items = 100; /* The basic list of characters that signal a break between words for the completer routine. The contents of this variable is what breaks words in the shell, i.e. " \t\n\"\\'`@$><=" */ char *rl_basic_word_break_characters = " \t\n\"\\'`@$><=;|&{("; /* The list of characters that signal a break between words for rl_complete_internal. The default list is the contents of rl_basic_word_break_characters. */ char *rl_completer_word_break_characters = (char *)NULL; /* List of characters which can be used to quote a substring of the line. Completion occurs on the entire substring, and within the substring rl_completer_word_break_characters are treated as any other character, unless they also appear within this list. */ char *rl_completer_quote_characters = (char *)NULL; /* List of characters that are word break characters, but should be left in TEXT when it is passed to the completion function. The shell uses this to help determine what kind of completing to do. */ char *rl_special_prefixes = (char *)NULL; /* If non-zero, then disallow duplicates in the matches. */ int rl_ignore_completion_duplicates = 1; /* Non-zero means that the results of the matches are to be treated as filenames. This is ALWAYS zero on entry, and can only be changed within a completion entry finder function. */ int rl_filename_completion_desired = 0; /* This function, if defined, is called by the completer when real filename completion is done, after all the matching names have been generated. It is passed a (char**) known as matches in the code below. It consists of a NULL-terminated array of pointers to potential matching strings. The 1st element (matches[0]) is the maximal substring that is common to all matches. This function can re-arrange the list of matches as required, but all elements of the array must be free()'d if they are deleted. The main intent of this function is to implement FIGNORE a la SunOS csh. */ Function *rl_ignore_some_completions_function = (Function *)NULL; #if defined (SHELL) /* A function to strip quotes that are not protected by backquotes. It allows single quotes to appear within double quotes, and vice versa. It should be smarter. It's fairly shell-specific, hence the SHELL definition wrapper. */ static char * _delete_quotes (text) char *text; { char *ret, *p, *r; int l, quoted; l = strlen (text); ret = xmalloc (l + 1); for (quoted = 0, p = text, r = ret; p && *p; p++) { /* Allow backslash-quoted characters to pass through unscathed. */ if (*p == '\\') continue; /* Close quote. */ if (quoted && *p == quoted) { quoted = 0; continue; } /* Open quote. */ if (quoted == 0 && (*p == '\'' || *p == '"')) { quoted = *p; continue; } *r++ = *p; } *r = '\0'; return ret; } #endif /* SHELL */ /* Complete the word at or before point. WHAT_TO_DO says what to do with the completion. `?' means list the possible completions. TAB means do standard completion. `*' means insert all of the possible completions. */ int rl_complete_internal (what_to_do) int what_to_do; { char **matches; Function *our_func; int start, scan, end, delimiter = 0, pass_next; char *text, *saved_line_buffer; char *replacement; char quote_char = '\0'; #if defined (SHELL) int found_quote = 0; #endif if (rl_line_buffer) saved_line_buffer = savestring (rl_line_buffer); else saved_line_buffer = (char *)NULL; if (rl_completion_entry_function) our_func = rl_completion_entry_function; else our_func = (Function *)filename_completion_function; /* Only the completion entry function can change this. */ rl_filename_completion_desired = 0; /* We now look backwards for the start of a filename/variable word. */ end = rl_point; if (rl_point) { if (rl_completer_quote_characters) { /* We have a list of characters which can be used in pairs to quote substrings for the completer. Try to find the start of an unclosed quoted substring. */ /* FOUND_QUOTE is set so we know what kind of quotes we found. */ for (scan = pass_next = 0; scan < end; scan++) { if (pass_next) { pass_next = 0; continue; } if (rl_line_buffer[scan] == '\\') { pass_next = 1; continue; } if (quote_char != '\0') { /* Ignore everything until the matching close quote char. */ if (rl_line_buffer[scan] == quote_char) { /* Found matching close. Abandon this substring. */ quote_char = '\0'; rl_point = end; } } else if (strchr (rl_completer_quote_characters, rl_line_buffer[scan])) { /* Found start of a quoted substring. */ quote_char = rl_line_buffer[scan]; rl_point = scan + 1; #if defined (SHELL) if (quote_char == '\'') found_quote |= 1; else if (quote_char == '"') found_quote |= 2; #endif } } } if (rl_point == end) { int quoted = 0; /* We didn't find an unclosed quoted substring up which to do completion, so use the word break characters to find the substring on which to complete. */ while (--rl_point) { #if defined (SHELL) /* Don't let word break characters in quoted substrings break words for the completer. */ if (found_quote) { if (strchr (rl_completer_quote_characters, rl_line_buffer[rl_point])) { quoted = !quoted; continue; } if (quoted) continue; } #endif /* SHELL */ if (strchr (rl_completer_word_break_characters, rl_line_buffer[rl_point])) break; } } /* If we are at a word break, then advance past it. */ if (strchr (rl_completer_word_break_characters, rl_line_buffer[rl_point])) { /* If the character that caused the word break was a quoting character, then remember it as the delimiter. */ if (strchr ("\"'", rl_line_buffer[rl_point]) && (end - rl_point) > 1) delimiter = rl_line_buffer[rl_point]; /* If the character isn't needed to determine something special about what kind of completion to perform, then advance past it. */ if (!rl_special_prefixes || !strchr (rl_special_prefixes, rl_line_buffer[rl_point])) rl_point++; } } /* At this point, we know we have an open quote if quote_char != '\0'. */ start = rl_point; rl_point = end; text = rl_copy_text (start, end); /* If the user wants to TRY to complete, but then wants to give up and use the default completion function, they set the variable rl_attempted_completion_function. */ if (rl_attempted_completion_function) { matches = (*rl_attempted_completion_function) (text, start, end); if (matches) { /* XXX - This is questionable code. - XXX */ if (matches == (char **)-1) matches = (char **)NULL; our_func = (Function *)NULL; goto after_usual_completion; } } #if defined (SHELL) /* Beware -- we're stripping the quotes here. Do this only if we know we are doing filename completion. */ if (found_quote && our_func == (Function *)filename_completion_function) { /* delete single and double quotes */ replacement = _delete_quotes (text); free (text); text = replacement; replacement = (char *)0; } #endif /* SHELL */ matches = completion_matches (text, our_func); after_usual_completion: free (text); if (!matches) ding (); else { register int i; /* It seems to me that in all the cases we handle we would like to ignore duplicate possiblilities. Scan for the text to insert being identical to the other completions. */ if (rl_ignore_completion_duplicates) { char *lowest_common; int j, newlen = 0; char dead_slot; /* Sort the items. */ /* It is safe to sort this array, because the lowest common denominator found in matches[0] will remain in place. */ for (i = 0; matches[i]; i++); qsort (matches, i, sizeof (char *), compare_strings); /* Remember the lowest common denominator for it may be unique. */ lowest_common = savestring (matches[0]); for (i = 0; matches[i + 1]; i++) { if (strcmp (matches[i], matches[i + 1]) == 0) { free (matches[i]); matches[i] = (char *)&dead_slot; } else newlen++; } /* We have marked all the dead slots with (char *)&dead_slot. Copy all the non-dead entries into a new array. */ { char **temp_array = (char **)xmalloc ((3 + newlen) * sizeof (char *)); for (i = 1, j = 1; matches[i]; i++) { if (matches[i] != (char *)&dead_slot) temp_array[j++] = matches[i]; } temp_array[j] = (char *)NULL; if (matches[0] != (char *)&dead_slot) free (matches[0]); free (matches); matches = temp_array; } /* Place the lowest common denominator back in [0]. */ matches[0] = lowest_common; /* If there is one string left, and it is identical to the lowest common denominator, then the LCD is the string to insert. */ if (j == 2 && strcmp (matches[0], matches[1]) == 0) { free (matches[1]); matches[1] = (char *)NULL; } } switch (what_to_do) { case TAB: /* If we are matching filenames, then here is our chance to do clever processing by re-examining the list. Call the ignore function with the array as a parameter. It can munge the array, deleting matches as it desires. */ if (rl_ignore_some_completions_function && our_func == (Function *)filename_completion_function) (void)(*rl_ignore_some_completions_function)(matches); /* If we are doing completion on quoted substrings, and any matches contain any of the completer_word_break_characters, then auto- matically prepend the substring with a quote character (just pick the first one from the list of such) if it does not already begin with a quote string. FIXME: Need to remove any such automatically inserted quote character when it no longer is necessary, such as if we change the string we are completing on and the new set of matches don't require a quoted substring. */ replacement = matches[0]; if (matches[0] && rl_completer_quote_characters && !quote_char && rl_filename_completion_desired) { int do_replace; do_replace = NO_MATCH; /* If there is a single match, see if we need to quote it. This also checks whether the common prefix of several matches needs to be quoted. If the common prefix should not be checked, add !matches[1] to the if clause. */ if (rl_strpbrk (matches[0], rl_completer_word_break_characters)) do_replace = matches[1] ? MULT_MATCH : SINGLE_MATCH; if (do_replace != NO_MATCH) { #if defined (SHELL) /* XXX - experimental */ /* Quote the replacement, since we found an embedded word break character in a potential match. */ char *rtext, *mtext; int rlen; extern char *double_quote (); /* in builtins/common.c */ /* If DO_REPLACE == MULT_MATCH, it means that there is more than one match. In this case, we do not add the closing quote or attempt to perform tilde expansion. If DO_REPLACE == SINGLE_MATCH, we try to perform tilde expansion, because double quotes inhibit tilde expansion by the shell. */ mtext = matches[0]; if (mtext[0] == '~' && do_replace == SINGLE_MATCH) mtext = tilde_expand (matches[0]); rtext = double_quote (mtext); if (mtext != matches[0]) free (mtext); rlen = strlen (rtext); replacement = (char *)alloca (rlen + 1); strcpy (replacement, rtext); if (do_replace == MULT_MATCH) replacement[rlen - 1] = '\0'; free (rtext); #else /* !SHELL */ /* Found an embedded word break character in a potential match, so we need to prepend a quote character if we are replacing the completion string. */ replacement = (char *)alloca (strlen (matches[0]) + 2); quote_char = *rl_completer_quote_characters; *replacement = quote_char; strcpy (replacement + 1, matches[0]); #endif /* SHELL */ } } if (replacement) { rl_delete_text (start, rl_point); rl_point = start; rl_insert_text (replacement); } /* If there are more matches, ring the bell to indicate. If this was the only match, and we are hacking files, check the file to see if it was a directory. If so, add a '/' to the name. If not, and we are at the end of the line, then add a space. */ if (matches[1]) { if (rl_editing_mode != vi_mode) ding (); /* There are other matches remaining. */ } else { char temp_string[4]; int temp_string_index = 0; if (quote_char) temp_string[temp_string_index++] = quote_char; temp_string[temp_string_index++] = delimiter ? delimiter : ' '; temp_string[temp_string_index++] = '\0'; if (rl_filename_completion_desired) { struct stat finfo; char *filename = tilde_expand (matches[0]); if ((stat (filename, &finfo) == 0) && S_ISDIR (finfo.st_mode)) { if (rl_line_buffer[rl_point] != '/') rl_insert_text ("/"); } else { if (rl_point == rl_end) rl_insert_text (temp_string); } free (filename); } else { if (rl_point == rl_end) rl_insert_text (temp_string); } } break; case '*': { int i = 1; rl_delete_text (start, rl_point); rl_point = start; rl_begin_undo_group (); if (matches[1]) { while (matches[i]) { rl_insert_text (matches[i++]); rl_insert_text (" "); } } else { rl_insert_text (matches[0]); rl_insert_text (" "); } rl_end_undo_group (); } break; case '?': { int len, count, limit, max = 0; int j, k, l; /* Handle simple case first. What if there is only one answer? */ if (!matches[1]) { char *temp = (char *)NULL; if (rl_filename_completion_desired) temp = strrchr (matches[0], '/'); if (!temp) temp = matches[0]; else temp++; crlf (); fprintf (rl_outstream, "%s", temp); #if defined (VISIBLE_STATS) if (rl_filename_completion_desired && rl_visible_stats) { int extension_char; extension_char = stat_char (matches[0]); if (extension_char) putc (extension_char, rl_outstream); } #endif /* VISIBLE_STATS */ crlf (); goto restart; } /* There is more than one answer. Find out how many there are, and find out what the maximum printed length of a single entry is. */ for (i = 1; matches[i]; i++) { char *temp; int name_length; /* If we are hacking filenames, then only count the characters after the last slash in the pathname. */ if (rl_filename_completion_desired) temp = strrchr (matches[i], '/'); else temp = (char *)NULL; if (!temp) temp = matches[i]; else temp++; name_length = strlen (temp); if (name_length > max) max = name_length; } len = i - 1; /* If there are many items, then ask the user if she really wants to see them all. */ if (len >= rl_completion_query_items) { crlf (); fprintf (rl_outstream, "There are %d possibilities. Do you really", len); crlf (); fprintf (rl_outstream, "wish to see them all? (y or n)"); fflush (rl_outstream); if (!get_y_or_n ()) { crlf (); goto restart; } } /* How many items of MAX length can we fit in the screen window? */ max += 2; limit = screenwidth / max; if (limit != 1 && (limit * max == screenwidth)) limit--; /* Avoid a possible floating exception. If max > screenwidth, limit will be 0 and a divide-by-zero fault will result. */ if (limit == 0) limit = 1; /* How many iterations of the printing loop? */ count = (len + (limit - 1)) / limit; /* Watch out for special case. If LEN is less than LIMIT, then just do the inner printing loop. */ if (len < limit) count = 1; /* Sort the items if they are not already sorted. */ if (!rl_ignore_completion_duplicates) qsort (matches, len, sizeof (char *), compare_strings); /* Print the sorted items, up-and-down alphabetically, like ls might. */ crlf (); for (i = 1; i < count + 1; i++) { for (j = 0, l = i; j < limit; j++) { if (l > len || !matches[l]) { break; } else { char *temp = (char *)NULL; int printed_length; if (rl_filename_completion_desired) temp = strrchr (matches[l], '/'); if (!temp) temp = matches[l]; else temp++; printed_length = strlen (temp); fprintf (rl_outstream, "%s", temp); #if defined (VISIBLE_STATS) if (rl_filename_completion_desired && rl_visible_stats) { int extension_char; extension_char = stat_char (matches[l]); if (extension_char) { putc (extension_char, rl_outstream); printed_length++; } } #endif /* VISIBLE_STATS */ if (j + 1 < limit) { for (k = 0; k < max - printed_length; k++) putc (' ', rl_outstream); } } l += count; } crlf (); } restart: rl_on_new_line (); } break; default: fprintf (stderr, "\r\nreadline: bad value for what_to_do in rl_complete\n"); abort (); } for (i = 0; matches[i]; i++) free (matches[i]); free (matches); } /* Check to see if the line has changed through all of this manipulation. */ if (saved_line_buffer) { if (strcmp (rl_line_buffer, saved_line_buffer) != 0) completion_changed_buffer = 1; else completion_changed_buffer = 0; free (saved_line_buffer); } return 0; } #if defined (VISIBLE_STATS) /* Return the character which best describes FILENAME. `@' for symbolic links `/' for directories `*' for executables `=' for sockets */ static int stat_char (filename) char *filename; { struct stat finfo; int character = 0; if (stat (filename, &finfo) == -1) return (character); if (S_ISDIR (finfo.st_mode)) character = '/'; #if defined (S_ISLNK) else if (S_ISLNK (finfo.st_mode)) character = '@'; #endif /* S_ISLNK */ #if defined (S_ISSOCK) else if (S_ISSOCK (finfo.st_mode)) character = '='; #endif /* S_ISSOCK */ else if (S_ISREG (finfo.st_mode)) { if (access (filename, X_OK) == 0) character = '*'; } return (character); } #endif /* VISIBLE_STATS */ /* Stupid comparison routine for qsort () ing strings. */ static int compare_strings (s1, s2) char **s1, **s2; { return (strcmp (*s1, *s2)); } /* A completion function for usernames. TEXT contains a partial username preceded by a random character (usually `~'). */ char * username_completion_function (text, state) int state; char *text; { #if defined (_GO32_) return (char *)NULL; #else /* !_GO32_ */ static char *username = (char *)NULL; static struct passwd *entry; static int namelen, first_char, first_char_loc; if (!state) { if (username) free (username); first_char = *text; if (first_char == '~') first_char_loc = 1; else first_char_loc = 0; username = savestring (&text[first_char_loc]); namelen = strlen (username); setpwent (); } while ((entry = getpwent ()) != NULL) { if (strncmp (username, entry->pw_name, namelen) == 0) break; } if (!entry) { endpwent (); return ((char *)NULL); } else { char *value = (char *)xmalloc (2 + strlen (entry->pw_name)); *value = *text; strcpy (value + first_char_loc, entry->pw_name); if (first_char == '~') rl_filename_completion_desired = 1; return (value); } #endif /* !_GO32_ */ } /* **************************************************************** */ /* */ /* Completion */ /* */ /* **************************************************************** */ /* Non-zero means that case is not significant in completion. */ int completion_case_fold = 0; /* Return an array of (char *) which is a list of completions for TEXT. If there are no completions, return a NULL pointer. The first entry in the returned array is the substitution for TEXT. The remaining entries are the possible completions. The array is terminated with a NULL pointer. ENTRY_FUNCTION is a function of two args, and returns a (char *). The first argument is TEXT. The second is a state argument; it should be zero on the first call, and non-zero on subsequent calls. It returns a NULL pointer to the caller when there are no more matches. */ char ** completion_matches (text, entry_function) char *text; CPFunction *entry_function; { /* Number of slots in match_list. */ int match_list_size; /* The list of matches. */ char **match_list = (char **)xmalloc (((match_list_size = 10) + 1) * sizeof (char *)); /* Number of matches actually found. */ int matches = 0; /* Temporary string binder. */ char *string; match_list[1] = (char *)NULL; while ((string = (*entry_function) (text, matches)) != NULL) { if (matches + 1 == match_list_size) match_list = (char **)xrealloc (match_list, ((match_list_size += 10) + 1) * sizeof (char *)); match_list[++matches] = string; match_list[matches + 1] = (char *)NULL; } /* If there were any matches, then look through them finding out the lowest common denominator. That then becomes match_list[0]. */ if (matches) { register int i = 1; int low = 100000; /* Count of max-matched characters. */ /* If only one match, just use that. */ if (matches == 1) { match_list[0] = match_list[1]; match_list[1] = (char *)NULL; } else { /* Otherwise, compare each member of the list with the next, finding out where they stop matching. */ while (i < matches) { register int c1, c2, si; if (completion_case_fold) { for (si = 0; (c1 = to_lower(match_list[i][si])) && (c2 = to_lower(match_list[i + 1][si])); si++) if (c1 != c2) break; } else { for (si = 0; (c1 = match_list[i][si]) && (c2 = match_list[i + 1][si]); si++) if (c1 != c2) break; } if (low > si) low = si; i++; } match_list[0] = (char *)xmalloc (low + 1); strncpy (match_list[0], match_list[1], low); match_list[0][low] = '\0'; } } else /* There were no matches. */ { free (match_list); match_list = (char **)NULL; } return (match_list); } /* Okay, now we write the entry_function for filename completion. In the general case. Note that completion in the shell is a little different because of all the pathnames that must be followed when looking up the completion for a command. */ char * filename_completion_function (text, state) int state; char *text; { static DIR *directory; static char *filename = (char *)NULL; static char *dirname = (char *)NULL; static char *users_dirname = (char *)NULL; static int filename_len; struct direct *entry = (struct direct *)NULL; /* If we don't have any state, then do some initialization. */ if (!state) { char *temp; if (dirname) free (dirname); if (filename) free (filename); if (users_dirname) free (users_dirname); filename = savestring (text); if (!*text) text = "."; dirname = savestring (text); temp = strrchr (dirname, '/'); if (temp) { strcpy (filename, ++temp); *temp = '\0'; } else strcpy (dirname, "."); /* We aren't done yet. We also support the "~user" syntax. */ /* Save the version of the directory that the user typed. */ users_dirname = savestring (dirname); { char *temp_dirname; temp_dirname = tilde_expand (dirname); free (dirname); dirname = temp_dirname; if (rl_symbolic_link_hook) (*rl_symbolic_link_hook) (&dirname); } directory = opendir (dirname); filename_len = strlen (filename); rl_filename_completion_desired = 1; } /* At this point we should entertain the possibility of hacking wildcarded filenames, like /usr/man/man/te. If the directory name contains globbing characters, then build an array of directories, and then map over that list while completing. */ /* *** UNIMPLEMENTED *** */ /* Now that we have some state, we can read the directory. */ while (directory && (entry = readdir (directory))) { /* Special case for no filename. All entries except "." and ".." match. */ if (!filename_len) { if ((strcmp (entry->d_name, ".") != 0) && (strcmp (entry->d_name, "..") != 0)) break; } else { /* Otherwise, if these match upto the length of filename, then it is a match. */ if (((int)D_NAMLEN (entry)) >= filename_len && (entry->d_name[0] == filename[0]) && (strncmp (filename, entry->d_name, filename_len) == 0)) { break; } } } if (!entry) { if (directory) { closedir (directory); directory = (DIR *)NULL; } if (dirname) { free (dirname); dirname = (char *)NULL; } if (filename) { free (filename); filename = (char *)NULL; } if (users_dirname) { free (users_dirname); users_dirname = (char *)NULL; } return (char *)NULL; } else { char *temp; if (dirname && (strcmp (dirname, ".") != 0)) { if (rl_complete_with_tilde_expansion && *users_dirname == '~') { int dirlen = strlen (dirname); temp = (char *)xmalloc (2 + dirlen + D_NAMLEN (entry)); strcpy (temp, dirname); /* Canonicalization cuts off any final slash present. We need to add it back. */ if (dirname[dirlen - 1] != '/') { temp[dirlen] = '/'; temp[dirlen + 1] = '\0'; } } else { temp = (char *) xmalloc (1 + strlen (users_dirname) + D_NAMLEN (entry)); strcpy (temp, users_dirname); } strcat (temp, entry->d_name); } else { temp = (savestring (entry->d_name)); } return (temp); } } /* A function for simple tilde expansion. */ int rl_tilde_expand (ignore, key) int ignore, key; { register int start, end; char *homedir; end = rl_point; start = end - 1; if (rl_point == rl_end && rl_line_buffer[rl_point] == '~') { homedir = tilde_expand ("~"); goto insert; } else if (rl_line_buffer[start] != '~') { for (; !whitespace (rl_line_buffer[start]) && start >= 0; start--); start++; } end = start; do { end++; } while (!whitespace (rl_line_buffer[end]) && end < rl_end); if (whitespace (rl_line_buffer[end]) || end >= rl_end) end--; /* If the first character of the current word is a tilde, perform tilde expansion and insert the result. If not a tilde, do nothing. */ if (rl_line_buffer[start] == '~') { char *temp; int len; len = end - start + 1; temp = (char *)alloca (len + 1); strncpy (temp, rl_line_buffer + start, len); temp[len] = '\0'; homedir = tilde_expand (temp); insert: rl_begin_undo_group (); rl_delete_text (start, end + 1); rl_point = start; rl_insert_text (homedir); rl_end_undo_group (); } return (0); } /* Find the first occurrence in STRING1 of any character from STRING2. Return a pointer to the character in STRING1. */ static char * rl_strpbrk (string1, string2) char *string1, *string2; { register char *scan; for (; *string1; string1++) { for (scan = string2; *scan; scan++) { if (*string1 == *scan) { return (string1); } } } return ((char *)NULL); } #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ octave-1.1.0/readline/display.c100666 415 17 52762 5521547743 14603 0ustar jweusers/* display.c -- readline redisplay facility. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include "posixstat.h" /* System-specific feature definitions and include files. */ #include "rldefs.h" /* Some standard library routines. */ #include "readline.h" #include "history.h" #if !defined (strchr) && !defined (__STDC__) extern char *strchr (), *strrchr (); #endif /* !strchr && !__STDC__ */ /* Global and pseudo-global variables and functions imported from readline.c. */ extern char *rl_prompt; extern int readline_echoing_p; extern char *term_clreol, *term_im, *term_ic, *term_ei, *term_DC; /* Termcap variables. */ extern char *term_up, *term_dc, *term_cr, *term_IC; extern int screenheight, screenwidth, terminal_can_insert; extern void _rl_output_some_chars (); extern void _rl_output_character_function (); extern int _rl_convert_meta_chars_to_ascii; extern int _rl_horizontal_scroll_mode; extern int _rl_mark_modified_lines; extern int _rl_prefer_visible_bell; /* Pseudo-global functions (local to the readline library) exported by this file. */ void _rl_move_cursor_relative (), _rl_output_some_chars (); void _rl_move_vert (); int rl_on_new_line (); static void update_line (), clear_to_eol (); static void delete_chars (), insert_some_chars (); extern char *xmalloc (), *xrealloc (); /* **************************************************************** */ /* */ /* Display stuff */ /* */ /* **************************************************************** */ /* This is the stuff that is hard for me. I never seem to write good display routines in C. Let's see how I do this time. */ /* (PWP) Well... Good for a simple line updater, but totally ignores the problems of input lines longer than the screen width. update_line and the code that calls it makes a multiple line, automatically wrapping line update. Carefull attention needs to be paid to the vertical position variables. handling of terminals with autowrap on (incl. DEC braindamage) could be improved a bit. Right now I just cheat and decrement screenwidth by one. */ /* Keep two buffers; one which reflects the current contents of the screen, and the other to draw what we think the new contents should be. Then compare the buffers, and make whatever changes to the screen itself that we should. Finally, make the buffer that we just drew into be the one which reflects the current contents of the screen, and place the cursor where it belongs. Commands that want to can fix the display themselves, and then let this function know that the display has been fixed by setting the RL_DISPLAY_FIXED variable. This is good for efficiency. */ /* Global variables declared here. */ /* What YOU turn on when you have handled all redisplay yourself. */ int rl_display_fixed = 0; /* The stuff that gets printed out before the actual text of the line. This is usually pointing to rl_prompt. */ char *rl_display_prompt = (char *)NULL; /* Pseudo-global variables declared here. */ /* The visible cursor position. If you print some text, adjust this. */ int _rl_last_c_pos = 0; int _rl_last_v_pos = 0; /* Number of lines currently on screen minus 1. */ int _rl_vis_botlin = 0; /* Variables used only in this file. */ /* The last left edge of text that was displayed. This is used when doing horizontal scrolling. It shifts in thirds of a screenwidth. */ static int last_lmargin = 0; /* The line display buffers. One is the line currently displayed on the screen. The other is the line about to be displayed. */ static char *visible_line = (char *)NULL; static char *invisible_line = (char *)NULL; /* A buffer for `modeline' messages. */ static char msg_buf[128]; /* Non-zero forces the redisplay even if we thought it was unnecessary. */ static int forced_display = 0; /* Default and initial buffer size. Can grow. */ static int line_size = 1024; /* Basic redisplay algorithm. */ void rl_redisplay () { register int in, out, c, linenum; register char *line = invisible_line; char *prompt_this_line; int c_pos = 0; int inv_botlin = 0; /* Number of lines in newly drawn buffer. */ if (!readline_echoing_p) return; if (!rl_display_prompt) rl_display_prompt = ""; if (!invisible_line) { visible_line = (char *)xmalloc (line_size); invisible_line = (char *)xmalloc (line_size); line = invisible_line; for (in = 0; in < line_size; in++) { visible_line[in] = 0; invisible_line[in] = 1; } rl_on_new_line (); } /* Draw the line into the buffer. */ c_pos = -1; /* Mark the line as modified or not. We only do this for history lines. */ out = 0; if (_rl_mark_modified_lines && current_history () && rl_undo_list) { line[out++] = '*'; line[out] = '\0'; } /* If someone thought that the redisplay was handled, but the currently visible line has a different modification state than the one about to become visible, then correct the caller's misconception. */ if (visible_line[0] != invisible_line[0]) rl_display_fixed = 0; prompt_this_line = strrchr (rl_display_prompt, '\n'); if (!prompt_this_line) prompt_this_line = rl_display_prompt; else { prompt_this_line++; if (forced_display) _rl_output_some_chars (rl_display_prompt, prompt_this_line - rl_display_prompt); } strncpy (line + out, prompt_this_line, strlen (prompt_this_line)); out += strlen (prompt_this_line); line[out] = '\0'; for (in = 0; in < rl_end; in++) { c = (unsigned char)rl_line_buffer[in]; if (out + 8 >= line_size) /* XXX - 8 for \t */ { line_size *= 2; visible_line = (char *)xrealloc (visible_line, line_size); invisible_line = (char *)xrealloc (invisible_line, line_size); line = invisible_line; } if (in == rl_point) c_pos = out; if (META_CHAR (c)) { if (_rl_convert_meta_chars_to_ascii) { sprintf (line + out, "\\%o", c); out += 4; } else line[out++] = c; } #define DISPLAY_TABS #if defined (DISPLAY_TABS) else if (c == '\t') { register int newout = (out | (int)7) + 1; while (out < newout) line[out++] = ' '; } #endif else if (c < ' ') { line[out++] = '^'; line[out++] = UNCTRL (c); /* XXX was c ^ 0x40 */ } else if (c == 127) { line[out++] = '^'; line[out++] = '?'; } else line[out++] = c; } line[out] = '\0'; if (c_pos < 0) c_pos = out; /* PWP: now is when things get a bit hairy. The visible and invisible line buffers are really multiple lines, which would wrap every (screenwidth - 1) characters. Go through each in turn, finding the changed region and updating it. The line order is top to bottom. */ /* If we can move the cursor up and down, then use multiple lines, otherwise, let long lines display in a single terminal line, and horizontally scroll it. */ if (!_rl_horizontal_scroll_mode && term_up && *term_up) { int total_screen_chars = (screenwidth * screenheight); if (!rl_display_fixed || forced_display) { forced_display = 0; /* If we have more than a screenful of material to display, then only display a screenful. We should display the last screen, not the first. I'll fix this in a minute. */ if (out >= total_screen_chars) out = total_screen_chars - 1; /* Number of screen lines to display. */ inv_botlin = out / screenwidth; /* For each line in the buffer, do the updating display. */ for (linenum = 0; linenum <= inv_botlin; linenum++) update_line (linenum > _rl_vis_botlin ? "" : &visible_line[linenum * screenwidth], &invisible_line[linenum * screenwidth], linenum); /* We may have deleted some lines. If so, clear the left over blank ones at the bottom out. */ if (_rl_vis_botlin > inv_botlin) { char *tt; for (; linenum <= _rl_vis_botlin; linenum++) { tt = &visible_line[linenum * screenwidth]; _rl_move_vert (linenum); _rl_move_cursor_relative (0, tt); clear_to_eol ((linenum == _rl_vis_botlin) ? strlen (tt) : screenwidth); } } _rl_vis_botlin = inv_botlin; /* Move the cursor where it should be. */ _rl_move_vert (c_pos / screenwidth); _rl_move_cursor_relative (c_pos % screenwidth, &invisible_line[(c_pos / screenwidth) * screenwidth]); } } else /* Do horizontal scrolling. */ { int lmargin; /* Always at top line. */ _rl_last_v_pos = 0; /* If the display position of the cursor would be off the edge of the screen, start the display of this line at an offset that leaves the cursor on the screen. */ if (c_pos - last_lmargin > screenwidth - 2) lmargin = (c_pos / (screenwidth / 3) - 2) * (screenwidth / 3); else if (c_pos - last_lmargin < 1) lmargin = ((c_pos - 1) / (screenwidth / 3)) * (screenwidth / 3); else lmargin = last_lmargin; /* If the first character on the screen isn't the first character in the display line, indicate this with a special character. */ if (lmargin > 0) line[lmargin] = '<'; if (lmargin + screenwidth < out) line[lmargin + screenwidth - 1] = '>'; if (!rl_display_fixed || forced_display || lmargin != last_lmargin) { forced_display = 0; update_line (&visible_line[last_lmargin], &invisible_line[lmargin], 0); _rl_move_cursor_relative (c_pos - lmargin, &invisible_line[lmargin]); last_lmargin = lmargin; } } fflush (rl_outstream); /* Swap visible and non-visible lines. */ { char *temp = visible_line; visible_line = invisible_line; invisible_line = temp; rl_display_fixed = 0; } } /* PWP: update_line() is based on finding the middle difference of each line on the screen; vis: /old first difference /beginning of line | /old last same /old EOL v v v v old: eddie> Oh, my little gruntle-buggy is to me, as lurgid as new: eddie> Oh, my little buggy says to me, as lurgid as ^ ^ ^ ^ \beginning of line | \new last same \new end of line \new first difference All are character pointers for the sake of speed. Special cases for no differences, as well as for end of line additions must be handeled. Could be made even smarter, but this works well enough */ static void update_line (old, new, current_line) register char *old, *new; int current_line; { register char *ofd, *ols, *oe, *nfd, *nls, *ne; int lendiff, wsatend; /* Find first difference. */ for (ofd = old, nfd = new; (ofd - old < screenwidth) && *ofd && (*ofd == *nfd); ofd++, nfd++) ; /* Move to the end of the screen line. */ for (oe = ofd; ((oe - old) < screenwidth) && *oe; oe++); for (ne = nfd; ((ne - new) < screenwidth) && *ne; ne++); /* If no difference, continue to next line. */ if (ofd == oe && nfd == ne) return; wsatend = 1; /* flag for trailing whitespace */ ols = oe - 1; /* find last same */ nls = ne - 1; while ((ols > ofd) && (nls > nfd) && (*ols == *nls)) { if (*ols != ' ') wsatend = 0; ols--; nls--; } if (wsatend) { ols = oe; nls = ne; } else if (*ols != *nls) { if (*ols) /* don't step past the NUL */ ols++; if (*nls) nls++; } _rl_move_vert (current_line); _rl_move_cursor_relative (ofd - old, old); /* if (len (new) > len (old)) */ lendiff = (nls - nfd) - (ols - ofd); /* Insert (diff (len (old), len (new)) ch. */ if (lendiff > 0) { if (terminal_can_insert) { /* Sometimes it is cheaper to print the characters rather than use the terminal's capabilities. */ if ((2 * (ne - nfd)) < lendiff && !term_IC) { _rl_output_some_chars (nfd, (ne - nfd)); _rl_last_c_pos += (ne - nfd); } else { if (*ols) { insert_some_chars (nfd, lendiff); _rl_last_c_pos += lendiff; } else { /* At the end of a line the characters do not have to be "inserted". They can just be placed on the screen. */ _rl_output_some_chars (nfd, lendiff); _rl_last_c_pos += lendiff; } /* Copy (new) chars to screen from first diff to last match. */ if (((nls - nfd) - lendiff) > 0) { _rl_output_some_chars (&nfd[lendiff], ((nls - nfd) - lendiff)); _rl_last_c_pos += ((nls - nfd) - lendiff); } } } else { /* cannot insert chars, write to EOL */ _rl_output_some_chars (nfd, (ne - nfd)); _rl_last_c_pos += (ne - nfd); } } else /* Delete characters from line. */ { /* If possible and inexpensive to use terminal deletion, then do so. */ if (term_dc && (2 * (ne - nfd)) >= (-lendiff)) { if (lendiff) delete_chars (-lendiff); /* delete (diff) characters */ /* Copy (new) chars to screen from first diff to last match */ if ((nls - nfd) > 0) { _rl_output_some_chars (nfd, (nls - nfd)); _rl_last_c_pos += (nls - nfd); } } /* Otherwise, print over the existing material. */ else { _rl_output_some_chars (nfd, (ne - nfd)); _rl_last_c_pos += (ne - nfd); clear_to_eol ((oe - old) - (ne - new)); } } } /* Tell the update routines that we have moved onto a new (empty) line. */ int rl_on_new_line () { if (visible_line) visible_line[0] = '\0'; _rl_last_c_pos = _rl_last_v_pos = 0; _rl_vis_botlin = last_lmargin = 0; return 0; } /* Actually update the display, period. */ int rl_forced_update_display () { if (visible_line) { register char *temp = visible_line; while (*temp) *temp++ = '\0'; } rl_on_new_line (); forced_display++; rl_redisplay (); return 0; } /* Move the cursor from _rl_last_c_pos to NEW, which are buffer indices. DATA is the contents of the screen line of interest; i.e., where the movement is being done. */ void _rl_move_cursor_relative (new, data) int new; char *data; { register int i; /* It may be faster to output a CR, and then move forwards instead of moving backwards. */ if (new + 1 < _rl_last_c_pos - new) { tputs (term_cr, 1, _rl_output_character_function); _rl_last_c_pos = 0; } if (_rl_last_c_pos == new) return; if (_rl_last_c_pos < new) { /* Move the cursor forward. We do it by printing the command to move the cursor forward if there is one, else print that portion of the output buffer again. Which is cheaper? */ /* The above comment is left here for posterity. It is faster to print one character (non-control) than to print a control sequence telling the terminal to move forward one character. That kind of control is for people who don't know what the data is underneath the cursor. */ #if defined (HACK_TERMCAP_MOTION) extern char *term_forward_char; if (term_forward_char) for (i = _rl_last_c_pos; i < new; i++) tputs (term_forward_char, 1, _rl_output_character_function); else for (i = _rl_last_c_pos; i < new; i++) putc (data[i], rl_outstream); #else for (i = _rl_last_c_pos; i < new; i++) putc (data[i], rl_outstream); #endif /* HACK_TERMCAP_MOTION */ } else backspace (_rl_last_c_pos - new); _rl_last_c_pos = new; } /* PWP: move the cursor up or down. */ void _rl_move_vert (to) int to; { register int delta, i; if (_rl_last_v_pos == to || to > screenheight) return; #if defined (_GO32_) { int row, col; ScreenGetCursor (&row, &col); ScreenSetCursor ((row + to - _rl_last_v_pos), col); } #else /* !_GO32_ */ if ((delta = to - _rl_last_v_pos) > 0) { for (i = 0; i < delta; i++) putc ('\n', rl_outstream); tputs (term_cr, 1, _rl_output_character_function); _rl_last_c_pos = 0; } else { /* delta < 0 */ if (term_up && *term_up) for (i = 0; i < -delta; i++) tputs (term_up, 1, _rl_output_character_function); } #endif /* !_GO32_ */ _rl_last_v_pos = to; /* Now TO is here */ } /* Physically print C on rl_outstream. This is for functions which know how to optimize the display. */ int rl_show_char (c) int c; { if (META_CHAR (c) && _rl_convert_meta_chars_to_ascii) { fprintf (rl_outstream, "M-"); c = UNMETA (c); } #if defined (DISPLAY_TABS) if (c < 32 && c != '\t') #else if (c < 32) #endif /* !DISPLAY_TABS */ { c += 64; } putc (c, rl_outstream); fflush (rl_outstream); return 0; } int rl_character_len (c, pos) register int c, pos; { if (META_CHAR (c)) return (_rl_convert_meta_chars_to_ascii ? 4 : 1); if (c == '\t') { #if defined (DISPLAY_TABS) return (((pos | (int)7) + 1) - pos); #else return (2); #endif /* !DISPLAY_TABS */ } if (isprint (c)) return (1); else return (2); } /* How to print things in the "echo-area". The prompt is treated as a mini-modeline. */ #if defined (HAVE_VARARGS_H) int rl_message (va_alist) va_dcl { char *format; va_list args; va_start (args); format = va_arg (args, char *); vsprintf (msg_buf, format, args); va_end (args); rl_display_prompt = msg_buf; rl_redisplay (); return 0; } #else /* !HAVE_VARARGS_H */ int rl_message (format, arg1, arg2) char *format; { sprintf (msg_buf, format, arg1, arg2); rl_display_prompt = msg_buf; rl_redisplay (); return 0; } #endif /* !HAVE_VARARGS_H */ /* How to clear things from the "echo-area". */ int rl_clear_message () { rl_display_prompt = rl_prompt; rl_redisplay (); return 0; } int rl_reset_line_state () { rl_on_new_line (); rl_display_prompt = rl_prompt ? rl_prompt : ""; forced_display = 1; return 0; } /* Quick redisplay hack when erasing characters at the end of the line. */ void _rl_erase_at_end_of_line (l) int l; { register int i; backspace (l); for (i = 0; i < l; i++) putc (' ', rl_outstream); backspace (l); for (i = 0; i < l; i++) visible_line[--_rl_last_c_pos] = '\0'; rl_display_fixed++; } /* Clear to the end of the line. COUNT is the minimum number of character spaces to clear, */ static void clear_to_eol (count) int count; { #if !defined (_GO32_) if (term_clreol) { tputs (term_clreol, 1, _rl_output_character_function); } else #endif /* !_GO32_ */ { register int i; /* Do one more character space. */ count++; for (i = 0; i < count; i++) putc (' ', rl_outstream); backspace (count); } } /* Insert COUNT characters from STRING to the output stream. */ static void insert_some_chars (string, count) char *string; int count; { #if defined (_GO32_) int row, col, width; char *row_start; ScreenGetCursor (&row, &col); width = ScreenCols (); row_start = ScreenPrimary + (row * width); memcpy (row_start + col + count, row_start + col, width - col - count); /* Place the text on the screen. */ _rl_output_some_chars (string, count); #else /* !_GO32 */ /* If IC is defined, then we do not have to "enter" insert mode. */ if (term_IC) { char *tgoto (), *buffer; buffer = tgoto (term_IC, 0, count); tputs (buffer, 1, _rl_output_character_function); _rl_output_some_chars (string, count); } else { register int i; /* If we have to turn on insert-mode, then do so. */ if (term_im && *term_im) tputs (term_im, 1, _rl_output_character_function); /* If there is a special command for inserting characters, then use that first to open up the space. */ if (term_ic && *term_ic) { for (i = count; i--; ) tputs (term_ic, 1, _rl_output_character_function); } /* Print the text. */ _rl_output_some_chars (string, count); /* If there is a string to turn off insert mode, we had best use it now. */ if (term_ei && *term_ei) tputs (term_ei, 1, _rl_output_character_function); } #endif /* !_GO32_ */ } /* Delete COUNT characters from the display line. */ static void delete_chars (count) int count; { #if defined (_GO32_) int row, col, width; char *row_start; ScreenGetCursor (&row, &col); width = ScreenCols (); row_start = ScreenPrimary + (row * width); memcpy (row_start + col, row_start + col + count, width - col - count); memset (row_start + width - count, 0, count * 2); #else /* !_GO32 */ if (count > screenwidth) return; if (term_DC && *term_DC) { char *tgoto (), *buffer; buffer = tgoto (term_DC, count, count); tputs (buffer, count, _rl_output_character_function); } else { if (term_dc && *term_dc) while (count--) tputs (term_dc, 1, _rl_output_character_function); } #endif /* !_GO32_ */ } octave-1.1.0/readline/emacs_keymap.c100666 415 17 102371 5521547743 15604 0ustar jweusers/* emacs_keymap.c -- the keymap for emacs_mode in readline (). */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (BUFSIZ) #include #endif /* !BUFSIZ */ #include "readline.h" /* An array of function pointers, one for each possible key. If the type byte is ISKMAP, then the pointer is the address of a keymap. */ KEYMAP_ENTRY_ARRAY emacs_standard_keymap = { /* Control keys. */ { ISFUNC, (Function *)0x0 }, /* Control-@ */ { ISFUNC, rl_beg_of_line }, /* Control-a */ { ISFUNC, rl_backward }, /* Control-b */ { ISFUNC, (Function *)0x0 }, /* Control-c */ { ISFUNC, rl_delete }, /* Control-d */ { ISFUNC, rl_end_of_line }, /* Control-e */ { ISFUNC, rl_forward }, /* Control-f */ { ISFUNC, rl_abort }, /* Control-g */ { ISFUNC, rl_rubout }, /* Control-h */ { ISFUNC, rl_complete }, /* Control-i */ { ISFUNC, rl_newline }, /* Control-j */ { ISFUNC, rl_kill_line }, /* Control-k */ { ISFUNC, rl_clear_screen }, /* Control-l */ { ISFUNC, rl_newline }, /* Control-m */ { ISFUNC, rl_get_next_history }, /* Control-n */ { ISFUNC, (Function *)0x0 }, /* Control-o */ { ISFUNC, rl_get_previous_history }, /* Control-p */ { ISFUNC, rl_quoted_insert }, /* Control-q */ { ISFUNC, rl_reverse_search_history }, /* Control-r */ { ISFUNC, rl_forward_search_history }, /* Control-s */ { ISFUNC, rl_transpose_chars }, /* Control-t */ { ISFUNC, rl_unix_line_discard }, /* Control-u */ { ISFUNC, rl_quoted_insert }, /* Control-v */ { ISFUNC, rl_unix_word_rubout }, /* Control-w */ { ISKMAP, (Function *)emacs_ctlx_keymap }, /* Control-x */ { ISFUNC, rl_yank }, /* Control-y */ { ISFUNC, (Function *)0x0 }, /* Control-z */ { ISKMAP, (Function *)emacs_meta_keymap }, /* Control-[ */ { ISFUNC, (Function *)0x0 }, /* Control-\ */ { ISFUNC, (Function *)0x0 }, /* Control-] */ { ISFUNC, (Function *)0x0 }, /* Control-^ */ { ISFUNC, rl_undo_command }, /* Control-_ */ /* The start of printing characters. */ { ISFUNC, rl_insert }, /* SPACE */ { ISFUNC, rl_insert }, /* ! */ { ISFUNC, rl_insert }, /* " */ { ISFUNC, rl_insert }, /* # */ { ISFUNC, rl_insert }, /* $ */ { ISFUNC, rl_insert }, /* % */ { ISFUNC, rl_insert }, /* & */ { ISFUNC, rl_insert }, /* ' */ { ISFUNC, rl_insert }, /* ( */ #if defined (PAREN_MATCHING) { ISFUNC, rl_insert_close }, /* ) */ #else { ISFUNC, rl_insert }, /* ) */ #endif /* !PAREN_MATCHING */ { ISFUNC, rl_insert }, /* * */ { ISFUNC, rl_insert }, /* + */ { ISFUNC, rl_insert }, /* , */ { ISFUNC, rl_insert }, /* - */ { ISFUNC, rl_insert }, /* . */ { ISFUNC, rl_insert }, /* / */ /* Regular digits. */ { ISFUNC, rl_insert }, /* 0 */ { ISFUNC, rl_insert }, /* 1 */ { ISFUNC, rl_insert }, /* 2 */ { ISFUNC, rl_insert }, /* 3 */ { ISFUNC, rl_insert }, /* 4 */ { ISFUNC, rl_insert }, /* 5 */ { ISFUNC, rl_insert }, /* 6 */ { ISFUNC, rl_insert }, /* 7 */ { ISFUNC, rl_insert }, /* 8 */ { ISFUNC, rl_insert }, /* 9 */ /* A little more punctuation. */ { ISFUNC, rl_insert }, /* : */ { ISFUNC, rl_insert }, /* ; */ { ISFUNC, rl_insert }, /* < */ { ISFUNC, rl_insert }, /* = */ { ISFUNC, rl_insert }, /* > */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* @ */ /* Uppercase alphabet. */ { ISFUNC, rl_insert }, /* A */ { ISFUNC, rl_insert }, /* B */ { ISFUNC, rl_insert }, /* C */ { ISFUNC, rl_insert }, /* D */ { ISFUNC, rl_insert }, /* E */ { ISFUNC, rl_insert }, /* F */ { ISFUNC, rl_insert }, /* G */ { ISFUNC, rl_insert }, /* H */ { ISFUNC, rl_insert }, /* I */ { ISFUNC, rl_insert }, /* J */ { ISFUNC, rl_insert }, /* K */ { ISFUNC, rl_insert }, /* L */ { ISFUNC, rl_insert }, /* M */ { ISFUNC, rl_insert }, /* N */ { ISFUNC, rl_insert }, /* O */ { ISFUNC, rl_insert }, /* P */ { ISFUNC, rl_insert }, /* Q */ { ISFUNC, rl_insert }, /* R */ { ISFUNC, rl_insert }, /* S */ { ISFUNC, rl_insert }, /* T */ { ISFUNC, rl_insert }, /* U */ { ISFUNC, rl_insert }, /* V */ { ISFUNC, rl_insert }, /* W */ { ISFUNC, rl_insert }, /* X */ { ISFUNC, rl_insert }, /* Y */ { ISFUNC, rl_insert }, /* Z */ /* Some more punctuation. */ { ISFUNC, rl_insert }, /* [ */ { ISFUNC, rl_insert }, /* \ */ #if defined (PAREN_MATCHING) { ISFUNC, rl_insert_close }, /* ] */ #else { ISFUNC, rl_insert }, /* ] */ #endif /* !PAREN_MATCHING */ { ISFUNC, rl_insert }, /* ^ */ { ISFUNC, rl_insert }, /* _ */ { ISFUNC, rl_insert }, /* ` */ /* Lowercase alphabet. */ { ISFUNC, rl_insert }, /* a */ { ISFUNC, rl_insert }, /* b */ { ISFUNC, rl_insert }, /* c */ { ISFUNC, rl_insert }, /* d */ { ISFUNC, rl_insert }, /* e */ { ISFUNC, rl_insert }, /* f */ { ISFUNC, rl_insert }, /* g */ { ISFUNC, rl_insert }, /* h */ { ISFUNC, rl_insert }, /* i */ { ISFUNC, rl_insert }, /* j */ { ISFUNC, rl_insert }, /* k */ { ISFUNC, rl_insert }, /* l */ { ISFUNC, rl_insert }, /* m */ { ISFUNC, rl_insert }, /* n */ { ISFUNC, rl_insert }, /* o */ { ISFUNC, rl_insert }, /* p */ { ISFUNC, rl_insert }, /* q */ { ISFUNC, rl_insert }, /* r */ { ISFUNC, rl_insert }, /* s */ { ISFUNC, rl_insert }, /* t */ { ISFUNC, rl_insert }, /* u */ { ISFUNC, rl_insert }, /* v */ { ISFUNC, rl_insert }, /* w */ { ISFUNC, rl_insert }, /* x */ { ISFUNC, rl_insert }, /* y */ { ISFUNC, rl_insert }, /* z */ /* Final punctuation. */ { ISFUNC, rl_insert }, /* { */ { ISFUNC, rl_insert }, /* | */ #if defined (PAREN_MATCHING) { ISFUNC, rl_insert_close }, /* } */ #else { ISFUNC, rl_insert }, /* } */ #endif /* !PAREN_MATCHING */ { ISFUNC, rl_insert }, /* ~ */ { ISFUNC, rl_rubout }, /* RUBOUT */ #if KEYMAP_SIZE > 128 /* Pure 8-bit characters (128 - 159). These might be used in some character sets. */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ /* ISO Latin-1 characters (160 - 255) */ { ISFUNC, rl_insert }, /* No-break space */ { ISFUNC, rl_insert }, /* Inverted exclamation mark */ { ISFUNC, rl_insert }, /* Cent sign */ { ISFUNC, rl_insert }, /* Pound sign */ { ISFUNC, rl_insert }, /* Currency sign */ { ISFUNC, rl_insert }, /* Yen sign */ { ISFUNC, rl_insert }, /* Broken bar */ { ISFUNC, rl_insert }, /* Section sign */ { ISFUNC, rl_insert }, /* Diaeresis */ { ISFUNC, rl_insert }, /* Copyright sign */ { ISFUNC, rl_insert }, /* Feminine ordinal indicator */ { ISFUNC, rl_insert }, /* Left pointing double angle quotation mark */ { ISFUNC, rl_insert }, /* Not sign */ { ISFUNC, rl_insert }, /* Soft hyphen */ { ISFUNC, rl_insert }, /* Registered sign */ { ISFUNC, rl_insert }, /* Macron */ { ISFUNC, rl_insert }, /* Degree sign */ { ISFUNC, rl_insert }, /* Plus-minus sign */ { ISFUNC, rl_insert }, /* Superscript two */ { ISFUNC, rl_insert }, /* Superscript three */ { ISFUNC, rl_insert }, /* Acute accent */ { ISFUNC, rl_insert }, /* Micro sign */ { ISFUNC, rl_insert }, /* Pilcrow sign */ { ISFUNC, rl_insert }, /* Middle dot */ { ISFUNC, rl_insert }, /* Cedilla */ { ISFUNC, rl_insert }, /* Superscript one */ { ISFUNC, rl_insert }, /* Masculine ordinal indicator */ { ISFUNC, rl_insert }, /* Right pointing double angle quotation mark */ { ISFUNC, rl_insert }, /* Vulgar fraction one quarter */ { ISFUNC, rl_insert }, /* Vulgar fraction one half */ { ISFUNC, rl_insert }, /* Vulgar fraction three quarters */ { ISFUNC, rl_insert }, /* Inverted questionk mark */ { ISFUNC, rl_insert }, /* Latin capital letter a with grave */ { ISFUNC, rl_insert }, /* Latin capital letter a with acute */ { ISFUNC, rl_insert }, /* Latin capital letter a with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter a with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter a with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter a with ring above */ { ISFUNC, rl_insert }, /* Latin capital letter ae */ { ISFUNC, rl_insert }, /* Latin capital letter c with cedilla */ { ISFUNC, rl_insert }, /* Latin capital letter e with grave */ { ISFUNC, rl_insert }, /* Latin capital letter e with acute */ { ISFUNC, rl_insert }, /* Latin capital letter e with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter e with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter i with grave */ { ISFUNC, rl_insert }, /* Latin capital letter i with acute */ { ISFUNC, rl_insert }, /* Latin capital letter i with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter i with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter eth (Icelandic) */ { ISFUNC, rl_insert }, /* Latin capital letter n with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter o with grave */ { ISFUNC, rl_insert }, /* Latin capital letter o with acute */ { ISFUNC, rl_insert }, /* Latin capital letter o with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter o with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter o with diaeresis */ { ISFUNC, rl_insert }, /* Multiplication sign */ { ISFUNC, rl_insert }, /* Latin capital letter o with stroke */ { ISFUNC, rl_insert }, /* Latin capital letter u with grave */ { ISFUNC, rl_insert }, /* Latin capital letter u with acute */ { ISFUNC, rl_insert }, /* Latin capital letter u with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter u with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter Y with acute */ { ISFUNC, rl_insert }, /* Latin capital letter thorn (Icelandic) */ { ISFUNC, rl_insert }, /* Latin small letter sharp s (German) */ { ISFUNC, rl_insert }, /* Latin small letter a with grave */ { ISFUNC, rl_insert }, /* Latin small letter a with acute */ { ISFUNC, rl_insert }, /* Latin small letter a with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter a with tilde */ { ISFUNC, rl_insert }, /* Latin small letter a with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter a with ring above */ { ISFUNC, rl_insert }, /* Latin small letter ae */ { ISFUNC, rl_insert }, /* Latin small letter c with cedilla */ { ISFUNC, rl_insert }, /* Latin small letter e with grave */ { ISFUNC, rl_insert }, /* Latin small letter e with acute */ { ISFUNC, rl_insert }, /* Latin small letter e with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter e with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter i with grave */ { ISFUNC, rl_insert }, /* Latin small letter i with acute */ { ISFUNC, rl_insert }, /* Latin small letter i with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter i with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter eth (Icelandic) */ { ISFUNC, rl_insert }, /* Latin small letter n with tilde */ { ISFUNC, rl_insert }, /* Latin small letter o with grave */ { ISFUNC, rl_insert }, /* Latin small letter o with acute */ { ISFUNC, rl_insert }, /* Latin small letter o with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter o with tilde */ { ISFUNC, rl_insert }, /* Latin small letter o with diaeresis */ { ISFUNC, rl_insert }, /* Division sign */ { ISFUNC, rl_insert }, /* Latin small letter o with stroke */ { ISFUNC, rl_insert }, /* Latin small letter u with grave */ { ISFUNC, rl_insert }, /* Latin small letter u with acute */ { ISFUNC, rl_insert }, /* Latin small letter u with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter u with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter y with acute */ { ISFUNC, rl_insert }, /* Latin small letter thorn (Icelandic) */ { ISFUNC, rl_insert } /* Latin small letter y with diaeresis */ #endif /* MEYMAP_SIZE > 128 */ }; KEYMAP_ENTRY_ARRAY emacs_meta_keymap = { /* Meta keys. Just like above, but the high bit is set. */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-@ */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-a */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-b */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-c */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-d */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-e */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-f */ { ISFUNC, rl_abort }, /* Meta-Control-g */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-h */ { ISFUNC, rl_tab_insert }, /* Meta-Control-i */ { ISFUNC, rl_vi_editing_mode }, /* Meta-Control-j */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-k */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-l */ { ISFUNC, rl_vi_editing_mode }, /* Meta-Control-m */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-n */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-o */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-p */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-q */ { ISFUNC, rl_revert_line }, /* Meta-Control-r */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-s */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-t */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-u */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-v */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-w */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-x */ { ISFUNC, rl_yank_nth_arg }, /* Meta-Control-y */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-z */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-[ */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-\ */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-] */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-^ */ { ISFUNC, (Function *)0x0 }, /* Meta-Control-_ */ /* The start of printing characters. */ { ISFUNC, (Function *)0x0 }, /* Meta-SPACE */ { ISFUNC, (Function *)0x0 }, /* Meta-! */ { ISFUNC, (Function *)0x0 }, /* Meta-" */ { ISFUNC, (Function *)0x0 }, /* Meta-# */ { ISFUNC, (Function *)0x0 }, /* Meta-$ */ { ISFUNC, (Function *)0x0 }, /* Meta-% */ { ISFUNC, rl_tilde_expand }, /* Meta-& */ { ISFUNC, (Function *)0x0 }, /* Meta-' */ { ISFUNC, (Function *)0x0 }, /* Meta-( */ { ISFUNC, (Function *)0x0 }, /* Meta-) */ { ISFUNC, (Function *)0x0 }, /* Meta-* */ { ISFUNC, (Function *)0x0 }, /* Meta-+ */ { ISFUNC, (Function *)0x0 }, /* Meta-, */ { ISFUNC, rl_digit_argument }, /* Meta-- */ { ISFUNC, (Function *)0x0 }, /* Meta-. */ { ISFUNC, (Function *)0x0 }, /* Meta-/ */ /* Regular digits. */ { ISFUNC, rl_digit_argument }, /* Meta-0 */ { ISFUNC, rl_digit_argument }, /* Meta-1 */ { ISFUNC, rl_digit_argument }, /* Meta-2 */ { ISFUNC, rl_digit_argument }, /* Meta-3 */ { ISFUNC, rl_digit_argument }, /* Meta-4 */ { ISFUNC, rl_digit_argument }, /* Meta-5 */ { ISFUNC, rl_digit_argument }, /* Meta-6 */ { ISFUNC, rl_digit_argument }, /* Meta-7 */ { ISFUNC, rl_digit_argument }, /* Meta-8 */ { ISFUNC, rl_digit_argument }, /* Meta-9 */ /* A little more punctuation. */ { ISFUNC, (Function *)0x0 }, /* Meta-: */ { ISFUNC, (Function *)0x0 }, /* Meta-; */ { ISFUNC, rl_beginning_of_history }, /* Meta-< */ { ISFUNC, (Function *)0x0 }, /* Meta-= */ { ISFUNC, rl_end_of_history }, /* Meta-> */ { ISFUNC, rl_possible_completions }, /* Meta-? */ { ISFUNC, (Function *)0x0 }, /* Meta-@ */ /* Uppercase alphabet. */ { ISFUNC, rl_do_lowercase_version }, /* Meta-A */ { ISFUNC, rl_do_lowercase_version }, /* Meta-B */ { ISFUNC, rl_do_lowercase_version }, /* Meta-C */ { ISFUNC, rl_do_lowercase_version }, /* Meta-D */ { ISFUNC, rl_do_lowercase_version }, /* Meta-E */ { ISFUNC, rl_do_lowercase_version }, /* Meta-F */ { ISFUNC, rl_do_lowercase_version }, /* Meta-G */ { ISFUNC, rl_do_lowercase_version }, /* Meta-H */ { ISFUNC, rl_do_lowercase_version }, /* Meta-I */ { ISFUNC, rl_do_lowercase_version }, /* Meta-J */ { ISFUNC, rl_do_lowercase_version }, /* Meta-K */ { ISFUNC, rl_do_lowercase_version }, /* Meta-L */ { ISFUNC, rl_do_lowercase_version }, /* Meta-M */ { ISFUNC, rl_do_lowercase_version }, /* Meta-N */ { ISFUNC, rl_do_lowercase_version }, /* Meta-O */ { ISFUNC, rl_do_lowercase_version }, /* Meta-P */ { ISFUNC, rl_do_lowercase_version }, /* Meta-Q */ { ISFUNC, rl_do_lowercase_version }, /* Meta-R */ { ISFUNC, rl_do_lowercase_version }, /* Meta-S */ { ISFUNC, rl_do_lowercase_version }, /* Meta-T */ { ISFUNC, rl_do_lowercase_version }, /* Meta-U */ { ISFUNC, rl_do_lowercase_version }, /* Meta-V */ { ISFUNC, rl_do_lowercase_version }, /* Meta-W */ { ISFUNC, rl_do_lowercase_version }, /* Meta-X */ { ISFUNC, rl_do_lowercase_version }, /* Meta-Y */ { ISFUNC, rl_do_lowercase_version }, /* Meta-Z */ /* Some more punctuation. */ { ISFUNC, rl_arrow_keys }, /* Meta-[ */ { ISFUNC, rl_delete_horizontal_space }, /* Meta-\ */ { ISFUNC, (Function *)0x0 }, /* Meta-] */ { ISFUNC, (Function *)0x0 }, /* Meta-^ */ { ISFUNC, (Function *)0x0 }, /* Meta-_ */ { ISFUNC, (Function *)0x0 }, /* Meta-` */ /* Lowercase alphabet. */ { ISFUNC, (Function *)0x0 }, /* Meta-a */ { ISFUNC, rl_backward_word }, /* Meta-b */ { ISFUNC, rl_capitalize_word }, /* Meta-c */ { ISFUNC, rl_kill_word }, /* Meta-d */ { ISFUNC, (Function *)0x0 }, /* Meta-e */ { ISFUNC, rl_forward_word }, /* Meta-f */ { ISFUNC, (Function *)0x0 }, /* Meta-g */ { ISFUNC, (Function *)0x0 }, /* Meta-h */ { ISFUNC, (Function *)0x0 }, /* Meta-i */ { ISFUNC, (Function *)0x0 }, /* Meta-j */ { ISFUNC, (Function *)0x0 }, /* Meta-k */ { ISFUNC, rl_downcase_word }, /* Meta-l */ { ISFUNC, (Function *)0x0 }, /* Meta-m */ { ISFUNC, rl_noninc_forward_search }, /* Meta-n */ { ISFUNC, rl_arrow_keys }, /* Meta-o */ { ISFUNC, rl_noninc_reverse_search }, /* Meta-p */ { ISFUNC, (Function *)0x0 }, /* Meta-q */ { ISFUNC, rl_revert_line }, /* Meta-r */ { ISFUNC, (Function *)0x0 }, /* Meta-s */ { ISFUNC, rl_transpose_words }, /* Meta-t */ { ISFUNC, rl_upcase_word }, /* Meta-u */ { ISFUNC, (Function *)0x0 }, /* Meta-v */ { ISFUNC, (Function *)0x0 }, /* Meta-w */ { ISFUNC, (Function *)0x0 }, /* Meta-x */ { ISFUNC, rl_yank_pop }, /* Meta-y */ { ISFUNC, (Function *)0x0 }, /* Meta-z */ /* Final punctuation. */ { ISFUNC, (Function *)0x0 }, /* Meta-{ */ { ISFUNC, (Function *)0x0 }, /* Meta-| */ { ISFUNC, (Function *)0x0 }, /* Meta-} */ { ISFUNC, (Function *)0x0 }, /* Meta-~ */ { ISFUNC, rl_backward_kill_word }, /* Meta-rubout */ #if KEYMAP_SIZE > 128 /* Undefined keys. */ { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 } #endif /* KEYMAP_SIZE > 128 */ }; KEYMAP_ENTRY_ARRAY emacs_ctlx_keymap = { /* Control keys. */ { ISFUNC, (Function *)0x0 }, /* Control-@ */ { ISFUNC, (Function *)0x0 }, /* Control-a */ { ISFUNC, (Function *)0x0 }, /* Control-b */ { ISFUNC, (Function *)0x0 }, /* Control-c */ { ISFUNC, (Function *)0x0 }, /* Control-d */ { ISFUNC, (Function *)0x0 }, /* Control-e */ { ISFUNC, (Function *)0x0 }, /* Control-f */ { ISFUNC, rl_abort }, /* Control-g */ { ISFUNC, (Function *)0x0 }, /* Control-h */ { ISFUNC, (Function *)0x0 }, /* Control-i */ { ISFUNC, (Function *)0x0 }, /* Control-j */ { ISFUNC, (Function *)0x0 }, /* Control-k */ { ISFUNC, (Function *)0x0 }, /* Control-l */ { ISFUNC, (Function *)0x0 }, /* Control-m */ { ISFUNC, (Function *)0x0 }, /* Control-n */ { ISFUNC, (Function *)0x0 }, /* Control-o */ { ISFUNC, (Function *)0x0 }, /* Control-p */ { ISFUNC, (Function *)0x0 }, /* Control-q */ { ISFUNC, rl_re_read_init_file }, /* Control-r */ { ISFUNC, (Function *)0x0 }, /* Control-s */ { ISFUNC, (Function *)0x0 }, /* Control-t */ { ISFUNC, rl_undo_command }, /* Control-u */ { ISFUNC, (Function *)0x0 }, /* Control-v */ { ISFUNC, (Function *)0x0 }, /* Control-w */ { ISFUNC, (Function *)0x0 }, /* Control-x */ { ISFUNC, (Function *)0x0 }, /* Control-y */ { ISFUNC, (Function *)0x0 }, /* Control-z */ { ISFUNC, (Function *)0x0 }, /* Control-[ */ { ISFUNC, (Function *)0x0 }, /* Control-\ */ { ISFUNC, (Function *)0x0 }, /* Control-] */ { ISFUNC, (Function *)0x0 }, /* Control-^ */ { ISFUNC, (Function *)0x0 }, /* Control-_ */ /* The start of printing characters. */ { ISFUNC, (Function *)0x0 }, /* SPACE */ { ISFUNC, (Function *)0x0 }, /* ! */ { ISFUNC, (Function *)0x0 }, /* " */ { ISFUNC, (Function *)0x0 }, /* # */ { ISFUNC, (Function *)0x0 }, /* $ */ { ISFUNC, (Function *)0x0 }, /* % */ { ISFUNC, (Function *)0x0 }, /* & */ { ISFUNC, (Function *)0x0 }, /* ' */ { ISFUNC, rl_start_kbd_macro }, /* ( */ { ISFUNC, rl_end_kbd_macro }, /* ) */ { ISFUNC, (Function *)0x0 }, /* * */ { ISFUNC, (Function *)0x0 }, /* + */ { ISFUNC, (Function *)0x0 }, /* , */ { ISFUNC, (Function *)0x0 }, /* - */ { ISFUNC, (Function *)0x0 }, /* . */ { ISFUNC, (Function *)0x0 }, /* / */ /* Regular digits. */ { ISFUNC, (Function *)0x0 }, /* 0 */ { ISFUNC, (Function *)0x0 }, /* 1 */ { ISFUNC, (Function *)0x0 }, /* 2 */ { ISFUNC, (Function *)0x0 }, /* 3 */ { ISFUNC, (Function *)0x0 }, /* 4 */ { ISFUNC, (Function *)0x0 }, /* 5 */ { ISFUNC, (Function *)0x0 }, /* 6 */ { ISFUNC, (Function *)0x0 }, /* 7 */ { ISFUNC, (Function *)0x0 }, /* 8 */ { ISFUNC, (Function *)0x0 }, /* 9 */ /* A little more punctuation. */ { ISFUNC, (Function *)0x0 }, /* : */ { ISFUNC, (Function *)0x0 }, /* ; */ { ISFUNC, (Function *)0x0 }, /* < */ { ISFUNC, (Function *)0x0 }, /* = */ { ISFUNC, (Function *)0x0 }, /* > */ { ISFUNC, (Function *)0x0 }, /* ? */ { ISFUNC, (Function *)0x0 }, /* @ */ /* Uppercase alphabet. */ { ISFUNC, rl_do_lowercase_version }, /* A */ { ISFUNC, rl_do_lowercase_version }, /* B */ { ISFUNC, rl_do_lowercase_version }, /* C */ { ISFUNC, rl_do_lowercase_version }, /* D */ { ISFUNC, rl_do_lowercase_version }, /* E */ { ISFUNC, rl_do_lowercase_version }, /* F */ { ISFUNC, rl_do_lowercase_version }, /* G */ { ISFUNC, rl_do_lowercase_version }, /* H */ { ISFUNC, rl_do_lowercase_version }, /* I */ { ISFUNC, rl_do_lowercase_version }, /* J */ { ISFUNC, rl_do_lowercase_version }, /* K */ { ISFUNC, rl_do_lowercase_version }, /* L */ { ISFUNC, rl_do_lowercase_version }, /* M */ { ISFUNC, rl_do_lowercase_version }, /* N */ { ISFUNC, rl_do_lowercase_version }, /* O */ { ISFUNC, rl_do_lowercase_version }, /* P */ { ISFUNC, rl_do_lowercase_version }, /* Q */ { ISFUNC, rl_do_lowercase_version }, /* R */ { ISFUNC, rl_do_lowercase_version }, /* S */ { ISFUNC, rl_do_lowercase_version }, /* T */ { ISFUNC, rl_do_lowercase_version }, /* U */ { ISFUNC, rl_do_lowercase_version }, /* V */ { ISFUNC, rl_do_lowercase_version }, /* W */ { ISFUNC, rl_do_lowercase_version }, /* X */ { ISFUNC, rl_do_lowercase_version }, /* Y */ { ISFUNC, rl_do_lowercase_version }, /* Z */ /* Some more punctuation. */ { ISFUNC, (Function *)0x0 }, /* [ */ { ISFUNC, (Function *)0x0 }, /* \ */ { ISFUNC, (Function *)0x0 }, /* ] */ { ISFUNC, (Function *)0x0 }, /* ^ */ { ISFUNC, (Function *)0x0 }, /* _ */ { ISFUNC, (Function *)0x0 }, /* ` */ /* Lowercase alphabet. */ { ISFUNC, (Function *)0x0 }, /* a */ { ISFUNC, (Function *)0x0 }, /* b */ { ISFUNC, (Function *)0x0 }, /* c */ { ISFUNC, (Function *)0x0 }, /* d */ { ISFUNC, rl_call_last_kbd_macro }, /* e */ { ISFUNC, (Function *)0x0 }, /* f */ { ISFUNC, (Function *)0x0 }, /* g */ { ISFUNC, (Function *)0x0 }, /* h */ { ISFUNC, (Function *)0x0 }, /* i */ { ISFUNC, (Function *)0x0 }, /* j */ { ISFUNC, (Function *)0x0 }, /* k */ { ISFUNC, (Function *)0x0 }, /* l */ { ISFUNC, (Function *)0x0 }, /* m */ { ISFUNC, (Function *)0x0 }, /* n */ { ISFUNC, (Function *)0x0 }, /* o */ { ISFUNC, (Function *)0x0 }, /* p */ { ISFUNC, (Function *)0x0 }, /* q */ { ISFUNC, (Function *)0x0 }, /* r */ { ISFUNC, (Function *)0x0 }, /* s */ { ISFUNC, (Function *)0x0 }, /* t */ { ISFUNC, (Function *)0x0 }, /* u */ { ISFUNC, (Function *)0x0 }, /* v */ { ISFUNC, (Function *)0x0 }, /* w */ { ISFUNC, (Function *)0x0 }, /* x */ { ISFUNC, (Function *)0x0 }, /* y */ { ISFUNC, (Function *)0x0 }, /* z */ /* Final punctuation. */ { ISFUNC, (Function *)0x0 }, /* { */ { ISFUNC, (Function *)0x0 }, /* | */ { ISFUNC, (Function *)0x0 }, /* } */ { ISFUNC, (Function *)0x0 }, /* ~ */ { ISFUNC, rl_backward_kill_line }, /* RUBOUT */ #if KEYMAP_SIZE > 128 /* Undefined keys. */ { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 } #endif /* KEYMAP_SIZE > 128 */ }; octave-1.1.0/readline/funmap.c100666 415 17 20476 5521547743 14421 0ustar jweusers/* funmap.c -- attach names to functions. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ #if !defined (BUFSIZ) #include #endif /* BUFSIZ */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include "readline.h" FUNMAP **funmap = (FUNMAP **)NULL; static int funmap_size = 0; static int funmap_entry = 0; /* After initializing the function map, this is the index of the first program specific function. */ int funmap_program_specific_entry_start; static FUNMAP default_funmap[] = { { "abort", rl_abort }, { "accept-line", rl_newline }, { "arrow-key-prefix", rl_arrow_keys }, { "backward-char", rl_backward }, { "backward-delete-char", rl_rubout }, { "backward-kill-line", rl_backward_kill_line }, { "backward-kill-word", rl_backward_kill_word }, { "backward-word", rl_backward_word }, { "beginning-of-history", rl_beginning_of_history }, { "beginning-of-line", rl_beg_of_line }, { "call-last-kbd-macro", rl_call_last_kbd_macro }, { "capitalize-word", rl_capitalize_word }, { "clear-screen", rl_clear_screen }, { "complete", rl_complete }, { "delete-char", rl_delete }, { "delete-horizontal-space", rl_delete_horizontal_space }, { "digit-argument", rl_digit_argument }, { "do-lowercase-version", rl_do_lowercase_version }, { "downcase-word", rl_downcase_word }, { "dump-functions", rl_dump_functions }, { "end-kbd-macro", rl_end_kbd_macro }, { "end-of-history", rl_end_of_history }, { "end-of-line", rl_end_of_line }, { "forward-char", rl_forward }, { "forward-search-history", rl_forward_search_history }, { "forward-word", rl_forward_word }, { "insert-completions", rl_insert_completions }, { "kill-line", rl_kill_line }, { "kill-word", rl_kill_word }, { "next-history", rl_get_next_history }, { "non-incremental-forward-search-history", rl_noninc_forward_search }, { "non-incremental-reverse-search-history", rl_noninc_reverse_search }, { "possible-completions", rl_possible_completions }, { "previous-history", rl_get_previous_history }, { "quoted-insert", rl_quoted_insert }, { "re-read-init-file", rl_re_read_init_file }, { "redraw-current-line", rl_refresh_line}, { "reverse-search-history", rl_reverse_search_history }, { "revert-line", rl_revert_line }, { "self-insert", rl_insert }, { "start-kbd-macro", rl_start_kbd_macro }, { "tab-insert", rl_tab_insert }, { "transpose-chars", rl_transpose_chars }, { "transpose-words", rl_transpose_words }, { "undo", rl_undo_command }, { "universal-argument", rl_universal_argument }, { "unix-line-discard", rl_unix_line_discard }, { "unix-word-rubout", rl_unix_word_rubout }, { "upcase-word", rl_upcase_word }, { "yank", rl_yank }, { "yank-nth-arg", rl_yank_nth_arg }, { "yank-pop", rl_yank_pop }, #if defined (VI_MODE) { "vi-append-eol", rl_vi_append_eol }, { "vi-append-mode", rl_vi_append_mode }, { "vi-arg-digit", rl_vi_arg_digit }, { "vi-bWord", rl_vi_bWord }, { "vi-bracktype", rl_vi_bracktype }, { "vi-bword", rl_vi_bword }, { "vi-change-case", rl_vi_change_case }, { "vi-change-char", rl_vi_change_char }, { "vi-change-to", rl_vi_change_to }, { "vi-char-search", rl_vi_char_search }, { "vi-column", rl_vi_column }, { "vi-comment", rl_vi_comment }, { "vi-complete", rl_vi_complete }, { "vi-delete", rl_vi_delete }, { "vi-delete-to", rl_vi_delete_to }, { "vi-eWord", rl_vi_eWord }, { "vi-editing-mode", rl_vi_editing_mode }, { "vi-end-word", rl_vi_end_word }, { "vi-eof-maybe", rl_vi_eof_maybe }, { "vi-eword", rl_vi_eword }, { "vi-fWord", rl_vi_fWord }, { "vi-first-print", rl_vi_first_print }, { "vi-fword", rl_vi_fword }, { "vi-insert-beg", rl_vi_insert_beg }, { "vi-insertion-mode", rl_vi_insertion_mode }, { "vi-match", rl_vi_match }, { "vi-movement-mode", rl_vi_movement_mode }, { "vi-next-word", rl_vi_next_word }, { "vi-overstrike", rl_vi_overstrike }, { "vi-overstrike-delete", rl_vi_overstrike_delete }, { "vi-prev-word", rl_vi_prev_word }, { "vi-put", rl_vi_put }, { "vi-replace", rl_vi_replace }, { "vi-search", rl_vi_search }, { "vi-search-again", rl_vi_search_again }, { "vi-subst", rl_vi_subst }, { "vi-yank-arg", rl_vi_yank_arg }, { "vi-yank-to", rl_vi_yank_to }, #endif /* VI_MODE */ {(char *)NULL, (Function *)NULL } }; int rl_add_funmap_entry (name, function) char *name; Function *function; { if (funmap_entry + 2 >= funmap_size) if (!funmap) funmap = (FUNMAP **)xmalloc ((funmap_size = 80) * sizeof (FUNMAP *)); else funmap = (FUNMAP **)xrealloc (funmap, (funmap_size += 80) * sizeof (FUNMAP *)); funmap[funmap_entry] = (FUNMAP *)xmalloc (sizeof (FUNMAP)); funmap[funmap_entry]->name = name; funmap[funmap_entry]->function = function; funmap[++funmap_entry] = (FUNMAP *)NULL; return 0; } static int funmap_initialized = 0; /* Make the funmap contain all of the default entries. */ void rl_initialize_funmap () { register int i; if (funmap_initialized) return; for (i = 0; default_funmap[i].name; i++) rl_add_funmap_entry (default_funmap[i].name, default_funmap[i].function); funmap_initialized = 1; funmap_program_specific_entry_start = i; } /* Stupid comparison routine for qsort () ing strings. */ static int qsort_string_compare (s1, s2) register char **s1, **s2; { int r; r = **s1 - **s2; if (r == 0) r = strcmp (*s1, *s2); return r; } /* Produce a NULL terminated array of known function names. The array is sorted. The array itself is allocated, but not the strings inside. You should free () the array when you done, but not the pointrs. */ char ** rl_funmap_names () { char **result = (char **)NULL; int result_size, result_index; result_size = result_index = 0; /* Make sure that the function map has been initialized. */ rl_initialize_funmap (); for (result_index = 0; funmap[result_index]; result_index++) { if (result_index + 2 > result_size) { if (!result) result = (char **)xmalloc ((result_size = 20) * sizeof (char *)); else result = (char **) xrealloc (result, (result_size += 20) * sizeof (char *)); } result[result_index] = funmap[result_index]->name; result[result_index + 1] = (char *)NULL; } qsort (result, result_index, sizeof (char *), qsort_string_compare); return (result); } /* Things that mean `Control'. */ char *possible_control_prefixes[] = { "Control-", "C-", "CTRL-", (char *)NULL }; char *possible_meta_prefixes[] = { "Meta", "M-", (char *)NULL }; #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "history: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ octave-1.1.0/readline/history.c100666 415 17 126063 5521547743 14653 0ustar jweusers/* History.c -- standalone history library */ /* Copyright (C) 1989, 1992 Free Software Foundation, Inc. This file contains the GNU History Library (the Library), a set of routines for managing the text of previously typed lines. The 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 1, or (at your option) any later version. The 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The goal is to make the implementation transparent, so that you don't have to know what data types are used, just what functions you can call. I think I have done that. */ #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ #include #include #include #include #include #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #if defined (HAVE_UNISTD_H) # include #endif #if defined (HAVE_STRING_H) # include #else # include #endif /* !HAVE_STRING_H */ #include /* Not all systems declare ERRNO in errno.h... and some systems #define it! */ #if !defined (errno) extern int errno; #endif /* !errno */ #if defined (__GNUC__) # undef alloca # define alloca __builtin_alloca #else # if defined (sparc) || defined (HAVE_ALLOCA_H) # include # else extern char *alloca (); # endif /* sparc || HAVE_ALLOCA_H */ #endif /* !__GNU_C__ */ #include "history.h" #ifndef savestring extern char *xmalloc (); # ifndef strcpy extern char *strcpy (); # endif #define savestring(x) strcpy (xmalloc (1 + strlen (x)), (x)) #endif #ifndef whitespace #define whitespace(c) (((c) == ' ') || ((c) == '\t')) #endif #ifndef digit #define digit(c) ((c) >= '0' && (c) <= '9') #endif #ifndef member # ifndef strchr extern char *strchr (); # endif #define member(c, s) ((c) ? ((char *)strchr ((s), (c)) != (char *)NULL) : 0) #endif static char error_pointer; static char *get_history_word_specifier (); /* **************************************************************** */ /* */ /* History Functions */ /* */ /* **************************************************************** */ /* An array of HIST_ENTRY. This is where we store the history. */ static HIST_ENTRY **the_history = (HIST_ENTRY **)NULL; /* Non-zero means that we have enforced a limit on the amount of history that we save. */ int history_stifled = 0; /* If HISTORY_STIFLED is non-zero, then this is the maximum number of entries to remember. */ int max_input_history; /* The current location of the interactive history pointer. Just makes life easier for outside callers. */ static int history_offset = 0; /* The number of strings currently stored in the input_history list. */ int history_length = 0; /* The current number of slots allocated to the input_history. */ static int history_size = 0; /* The number of slots to increase the_history by. */ #define DEFAULT_HISTORY_GROW_SIZE 50 /* The character that represents the start of a history expansion request. This is usually `!'. */ char history_expansion_char = '!'; /* The character that invokes word substitution if found at the start of a line. This is usually `^'. */ char history_subst_char = '^'; /* During tokenization, if this character is seen as the first character of a word, then it, and all subsequent characters upto a newline are ignored. For a Bourne shell, this should be '#'. Bash special cases the interactive comment character to not be a comment delimiter. */ char history_comment_char = '\0'; /* The list of characters which inhibit the expansion of text if found immediately following history_expansion_char. */ char *history_no_expand_chars = " \t\n\r="; /* The logical `base' of the history array. It defaults to 1. */ int history_base = 1; /* Return the current HISTORY_STATE of the history. */ HISTORY_STATE * history_get_history_state () { HISTORY_STATE *state; state = (HISTORY_STATE *)xmalloc (sizeof (HISTORY_STATE)); state->entries = the_history; state->offset = history_offset; state->length = history_length; state->size = history_size; return (state); } /* Set the state of the current history array to STATE. */ void history_set_history_state (state) HISTORY_STATE *state; { the_history = state->entries; history_offset = state->offset; history_length = state->length; history_size = state->size; } /* Begin a session in which the history functions might be used. This initializes interactive variables. */ void using_history () { history_offset = history_length; } /* Return the number of bytes that the primary history entries are using. This just adds up the lengths of the_history->lines. */ int history_total_bytes () { register int i, result; result = 0; for (i = 0; the_history && the_history[i]; i++) result += strlen (the_history[i]->line); return (result); } /* Place STRING at the end of the history list. The data field is set to NULL. */ void add_history (string) char *string; { HIST_ENTRY *temp; if (history_stifled && (history_length == max_input_history)) { register int i; /* If the history is stifled, and history_length is zero, and it equals max_input_history, we don't save items. */ if (!history_length) return; /* If there is something in the slot, then remove it. */ if (the_history[0]) { free (the_history[0]->line); free (the_history[0]); } for (i = 0; i < history_length; i++) the_history[i] = the_history[i + 1]; history_base++; } else { if (!history_size) { the_history = (HIST_ENTRY **) xmalloc ((history_size = DEFAULT_HISTORY_GROW_SIZE) * sizeof (HIST_ENTRY *)); history_length = 1; } else { if (history_length == (history_size - 1)) { the_history = (HIST_ENTRY **) xrealloc (the_history, ((history_size += DEFAULT_HISTORY_GROW_SIZE) * sizeof (HIST_ENTRY *))); } history_length++; } } temp = (HIST_ENTRY *)xmalloc (sizeof (HIST_ENTRY)); temp->line = savestring (string); temp->data = (char *)NULL; the_history[history_length] = (HIST_ENTRY *)NULL; the_history[history_length - 1] = temp; } /* Make the history entry at WHICH have LINE and DATA. This returns the old entry so you can dispose of the data. In the case of an invalid WHICH, a NULL pointer is returned. */ HIST_ENTRY * replace_history_entry (which, line, data) int which; char *line; char *data; { HIST_ENTRY *temp = (HIST_ENTRY *)xmalloc (sizeof (HIST_ENTRY)); HIST_ENTRY *old_value; if (which >= history_length) return ((HIST_ENTRY *)NULL); old_value = the_history[which]; temp->line = savestring (line); temp->data = data; the_history[which] = temp; return (old_value); } /* Returns the magic number which says what history element we are looking at now. In this implementation, it returns history_offset. */ int where_history () { return (history_offset); } /* Search the history for STRING, starting at history_offset. If DIRECTION < 0, then the search is through previous entries, else through subsequent. If ANCHORED is non-zero, the string must appear at the beginning of a history line, otherwise, the string may appear anywhere in the line. If the string is found, then current_history () is the history entry, and the value of this function is the offset in the line of that history entry that the string was found in. Otherwise, nothing is changed, and a -1 is returned. */ #define ANCHORED_SEARCH 1 #define NON_ANCHORED_SEARCH 0 static int history_search_internal (string, direction, anchored) char *string; int direction, anchored; { register int i = history_offset; register int reverse = (direction < 0); register char *line; register int index; int string_len = strlen (string); /* Take care of trivial cases first. */ if (!history_length || ((i == history_length) && !reverse)) return (-1); if (reverse && (i == history_length)) i--; while (1) { /* Search each line in the history list for STRING. */ /* At limit for direction? */ if ((reverse && i < 0) || (!reverse && i == history_length)) return (-1); line = the_history[i]->line; index = strlen (line); /* If STRING is longer than line, no match. */ if (string_len > index) goto next_line; /* Handle anchored searches first. */ if (anchored == ANCHORED_SEARCH) { if (strncmp (string, line, string_len) == 0) { history_offset = i; return (0); } goto next_line; } /* Do substring search. */ if (reverse) { index -= string_len; while (index >= 0) { if (strncmp (string, line + index, string_len) == 0) { history_offset = i; return (index); } index--; } } else { register int limit = index - string_len + 1; index = 0; while (index < limit) { if (strncmp (string, line + index, string_len) == 0) { history_offset = i; return (index); } index++; } } next_line: if (reverse) i--; else i++; } } /* Do a non-anchored search for STRING through the history in DIRECTION. */ int history_search (string, direction) char *string; int direction; { return (history_search_internal (string, direction, NON_ANCHORED_SEARCH)); } /* Do an anchored search for string through the history in DIRECTION. */ int history_search_prefix (string, direction) char *string; int direction; { return (history_search_internal (string, direction, ANCHORED_SEARCH)); } /* Remove history element WHICH from the history. The removed element is returned to you so you can free the line, data, and containing structure. */ HIST_ENTRY * remove_history (which) int which; { HIST_ENTRY *return_value; if (which >= history_length || !history_length) return_value = (HIST_ENTRY *)NULL; else { register int i; return_value = the_history[which]; for (i = which; i < history_length; i++) the_history[i] = the_history[i + 1]; history_length--; } return (return_value); } /* Stifle the history list, remembering only MAX number of lines. */ void stifle_history (max) int max; { if (max < 0) max = 0; if (history_length > max) { register int i, j; /* This loses because we cannot free the data. */ for (i = 0; i < (history_length - max); i++) { free (the_history[i]->line); free (the_history[i]); } history_base = i; for (j = 0, i = history_length - max; j < max; i++, j++) the_history[j] = the_history[i]; the_history[j] = (HIST_ENTRY *)NULL; history_length = j; } history_stifled = 1; max_input_history = max; } /* Stop stifling the history. This returns the previous amount the history was stifled by. The value is positive if the history was stifled, negative if it wasn't. */ int unstifle_history () { int result = max_input_history; if (history_stifled) { result = -result; history_stifled = 0; } return (result); } /* Return the string that should be used in the place of this filename. This only matters when you don't specify the filename to read_history (), or write_history (). */ static char * history_filename (filename) char *filename; { char *return_val = filename ? savestring (filename) : (char *)NULL; if (!return_val) { char *home; home = getenv ("HOME"); if (!home) home = "."; return_val = (char *)xmalloc (2 + strlen (home) + strlen (".history")); sprintf (return_val, "%s/.history", home); } return (return_val); } /* Add the contents of FILENAME to the history list, a line at a time. If FILENAME is NULL, then read from ~/.history. Returns 0 if successful, or errno if not. */ int read_history (filename) char *filename; { return (read_history_range (filename, 0, -1)); } /* Read a range of lines from FILENAME, adding them to the history list. Start reading at the FROM'th line and end at the TO'th. If FROM is zero, start at the beginning. If TO is less than FROM, read until the end of the file. If FILENAME is NULL, then read from ~/.history. Returns 0 if successful, or errno if not. */ int read_history_range (filename, from, to) char *filename; int from, to; { register int line_start, line_end; char *input, *buffer = (char *)NULL; int file, current_line; struct stat finfo; input = history_filename (filename); file = open (input, O_RDONLY, 0666); if ((file < 0) || (stat (input, &finfo) == -1)) goto error_and_exit; buffer = (char *)xmalloc ((int)finfo.st_size + 1); if (read (file, buffer, finfo.st_size) != finfo.st_size) error_and_exit: { if (file >= 0) close (file); if (input) free (input); if (buffer) free (buffer); return (errno); } close (file); /* Set TO to larger than end of file if negative. */ if (to < 0) to = finfo.st_size; /* Start at beginning of file, work to end. */ line_start = line_end = current_line = 0; /* Skip lines until we are at FROM. */ while (line_start < finfo.st_size && current_line < from) { for (line_end = line_start; line_end < finfo.st_size; line_end++) if (buffer[line_end] == '\n') { current_line++; line_start = line_end + 1; if (current_line == from) break; } } /* If there are lines left to gobble, then gobble them now. */ for (line_end = line_start; line_end < finfo.st_size; line_end++) if (buffer[line_end] == '\n') { buffer[line_end] = '\0'; if (buffer[line_start]) add_history (buffer + line_start); current_line++; if (current_line >= to) break; line_start = line_end + 1; } if (input) free (input); if (buffer) free (buffer); return (0); } /* Truncate the history file FNAME, leaving only LINES trailing lines. If FNAME is NULL, then use ~/.history. */ int history_truncate_file (fname, lines) char *fname; register int lines; { register int i; int file, chars_read; char *buffer = (char *)NULL, *filename; struct stat finfo; filename = history_filename (fname); if (stat (filename, &finfo) == -1) goto truncate_exit; file = open (filename, O_RDONLY, 0666); if (file == -1) goto truncate_exit; buffer = (char *)xmalloc ((int)finfo.st_size + 1); chars_read = read (file, buffer, finfo.st_size); close (file); if (chars_read <= 0) goto truncate_exit; /* Count backwards from the end of buffer until we have passed LINES lines. */ for (i = chars_read - 1; lines && i; i--) { if (buffer[i] == '\n') lines--; } /* If there are fewer lines in the file than we want to truncate to, then we are all done. */ if (!i) goto truncate_exit; /* Otherwise, write from the start of this line until the end of the buffer. */ for (--i; i; i--) if (buffer[i] == '\n') { i++; break; } file = open (filename, O_WRONLY | O_TRUNC | O_CREAT, 0666); if (file == -1) goto truncate_exit; write (file, buffer + i, finfo.st_size - i); close (file); truncate_exit: if (buffer) free (buffer); free (filename); return 0; } #define HISTORY_APPEND 0 #define HISTORY_OVERWRITE 1 /* Workhorse function for writing history. Writes NELEMENT entries from the history list to FILENAME. OVERWRITE is non-zero if you wish to replace FILENAME with the entries. */ static int history_do_write (filename, nelements, overwrite) char *filename; int nelements, overwrite; { register int i; char *output = history_filename (filename); int file, mode; if (overwrite) mode = O_WRONLY | O_CREAT | O_TRUNC; else mode = O_WRONLY | O_APPEND; if ((file = open (output, mode, 0666)) == -1) { if (output) free (output); return (errno); } if (nelements > history_length) nelements = history_length; /* Build a buffer of all the lines to write, and write them in one syscall. Suggested by Peter Ho (peter@robosts.oxford.ac.uk). */ { register int j = 0; int buffer_size = 0; char *buffer; /* Calculate the total number of bytes to write. */ for (i = history_length - nelements; i < history_length; i++) buffer_size += 1 + strlen (the_history[i]->line); /* Allocate the buffer, and fill it. */ buffer = (char *)xmalloc (buffer_size); for (i = history_length - nelements; i < history_length; i++) { strcpy (buffer + j, the_history[i]->line); j += strlen (the_history[i]->line); buffer[j++] = '\n'; } write (file, buffer, buffer_size); free (buffer); } close (file); if (output) free (output); return (0); } /* Append NELEMENT entries to FILENAME. The entries appended are from the end of the list minus NELEMENTs up to the end of the list. */ int append_history (nelements, filename) int nelements; char *filename; { return (history_do_write (filename, nelements, HISTORY_APPEND)); } /* Overwrite FILENAME with the current history. If FILENAME is NULL, then write the history list to ~/.history. Values returned are as in read_history ().*/ int write_history (filename) char *filename; { return (history_do_write (filename, history_length, HISTORY_OVERWRITE)); } /* Return the history entry at the current position, as determined by history_offset. If there is no entry there, return a NULL pointer. */ HIST_ENTRY * current_history () { if ((history_offset == history_length) || !the_history) return ((HIST_ENTRY *)NULL); else return (the_history[history_offset]); } /* Back up history_offset to the previous history entry, and return a pointer to that entry. If there is no previous entry then return a NULL pointer. */ HIST_ENTRY * previous_history () { if (!history_offset) return ((HIST_ENTRY *)NULL); else return (the_history[--history_offset]); } /* Move history_offset forward to the next history entry, and return a pointer to that entry. If there is no next entry then return a NULL pointer. */ HIST_ENTRY * next_history () { if (history_offset == history_length) return ((HIST_ENTRY *)NULL); else return (the_history[++history_offset]); } /* Return the current history array. The caller has to be carefull, since this is the actual array of data, and could be bashed or made corrupt easily. The array is terminated with a NULL pointer. */ HIST_ENTRY ** history_list () { return (the_history); } /* Return the history entry which is logically at OFFSET in the history array. OFFSET is relative to history_base. */ HIST_ENTRY * history_get (offset) int offset; { int local_index = offset - history_base; if (local_index >= history_length || local_index < 0 || !the_history) return ((HIST_ENTRY *)NULL); return (the_history[local_index]); } /* Search for STRING in the history list. DIR is < 0 for searching backwards. POS is an absolute index into the history list at which point to begin searching. */ int history_search_pos (string, dir, pos) char *string; int dir, pos; { int ret, old = where_history (); history_set_pos (pos); if (history_search (string, dir) == -1) { history_set_pos (old); return (-1); } ret = where_history (); history_set_pos (old); return ret; } /* Make the current history item be the one at POS, an absolute index. Returns zero if POS is out of range, else non-zero. */ int history_set_pos (pos) int pos; { if (pos > history_length || pos < 0 || !the_history) return (0); history_offset = pos; return (1); } /* **************************************************************** */ /* */ /* History Expansion */ /* */ /* **************************************************************** */ /* Hairy history expansion on text, not tokens. This is of general use, and thus belongs in this library. */ /* The last string searched for in a !?string? search. */ static char *search_string = (char *)NULL; /* Return the event specified at TEXT + OFFSET modifying OFFSET to point to after the event specifier. Just a pointer to the history line is returned; NULL is returned in the event of a bad specifier. You pass STRING with *INDEX equal to the history_expansion_char that begins this specification. DELIMITING_QUOTE is a character that is allowed to end the string specification for what to search for in addition to the normal characters `:', ` ', `\t', `\n', and sometimes `?'. So you might call this function like: line = get_history_event ("!echo:p", &index, 0); */ char * get_history_event (string, caller_index, delimiting_quote) char *string; int *caller_index; int delimiting_quote; { register int i = *caller_index; int which, sign = 1; HIST_ENTRY *entry; /* The event can be specified in a number of ways. !! the previous command !n command line N !-n current command-line minus N !str the most recent command starting with STR !?str[?] the most recent command containing STR All values N are determined via HISTORY_BASE. */ if (string[i] != history_expansion_char) return ((char *)NULL); /* Move on to the specification. */ i++; /* Handle !! case. */ if (string[i] == history_expansion_char) { i++; which = history_base + (history_length - 1); *caller_index = i; goto get_which; } /* Hack case of numeric line specification. */ if (string[i] == '-') { sign = -1; i++; } if (digit (string[i])) { int start = i; /* Get the extent of the digits. */ for (; digit (string[i]); i++); /* Get the digit value. */ sscanf (string + start, "%d", &which); *caller_index = i; if (sign < 0) which = (history_length + history_base) - which; get_which: if ((entry = history_get (which)) != NULL) return (entry->line); return ((char *)NULL); } /* This must be something to search for. If the spec begins with a '?', then the string may be anywhere on the line. Otherwise, the string must be found at the start of a line. */ { int local_index; char *temp; int substring_okay = 0; if (string[i] == '?') { substring_okay++; i++; } for (local_index = i; string[i]; i++) if (whitespace (string[i]) || string[i] == '\n' || string[i] == ':' || (substring_okay && string[i] == '?') || #if defined (SHELL) member (string[i], ";&()|<>") || #endif /* SHELL */ string[i] == delimiting_quote) break; temp = (char *)alloca (1 + (i - local_index)); strncpy (temp, &string[local_index], (i - local_index)); temp[i - local_index] = '\0'; if (string[i] == '?') i++; *caller_index = i; search_again: local_index = history_search_internal (temp, -1, substring_okay ? NON_ANCHORED_SEARCH : ANCHORED_SEARCH); if (local_index < 0) search_lost: { history_offset = history_length; return ((char *)NULL); } if (local_index == 0 || substring_okay) { entry = current_history (); history_offset = history_length; /* If this was a substring search, then remember the string that we matched for word substitution. */ if (substring_okay) { if (search_string) free (search_string); search_string = savestring (temp); } return (entry->line); } if (history_offset) history_offset--; else goto search_lost; goto search_again; } } #if defined (SHELL) /* Function for extracting single-quoted strings. Used for inhibiting history expansion within single quotes. */ /* Extract the contents of STRING as if it is enclosed in single quotes. SINDEX, when passed in, is the offset of the character immediately following the opening single quote; on exit, SINDEX is left pointing to the closing single quote. */ static void rl_string_extract_single_quoted (string, sindex) char *string; int *sindex; { register int i = *sindex; while (string[i] && string[i] != '\'') i++; *sindex = i; } #endif /* SHELL */ /* Expand the string STRING, placing the result into OUTPUT, a pointer to a string. Returns: 0) If no expansions took place (or, if the only change in the text was the de-slashifying of the history expansion character) 1) If expansions did take place -1) If there was an error in expansion. If an error ocurred in expansion, then OUTPUT contains a descriptive error message. */ int history_expand (string, output) char *string; char **output; { register int j, l = strlen (string); int i, word_spec_error = 0; int cc, modified = 0; char *word_spec, *event; int starting_index, only_printing = 0, substitute_globally = 0; /* The output string, and its length. */ int len = 0; char *result = (char *)NULL; /* Used in add_string; */ char *temp, tt[2], tbl[3]; /* Prepare the buffer for printing error messages. */ result = (char *)xmalloc (len = 256); result[0] = tt[1] = tbl[2] = '\0'; tbl[0] = '\\'; tbl[1] = history_expansion_char; /* Grovel the string. Only backslash can quote the history escape character. We also handle arg specifiers. */ /* Before we grovel forever, see if the history_expansion_char appears anywhere within the text. */ /* The quick substitution character is a history expansion all right. That is to say, "^this^that^" is equivalent to "!!:s^this^that^", and in fact, that is the substitution that we do. */ if (string[0] == history_subst_char) { char *format_string = (char *)alloca (10 + strlen (string)); sprintf (format_string, "%c%c:s%s", history_expansion_char, history_expansion_char, string); string = format_string; l += 4; goto grovel; } /* If not quick substitution, still maybe have to do expansion. */ /* `!' followed by one of the characters in history_no_expand_chars is NOT an expansion. */ for (i = 0; string[i]; i++) { if (string[i] == history_expansion_char) { if (!string[i + 1] || member (string[i + 1], history_no_expand_chars)) continue; #if defined (SHELL) /* The shell uses ! as a pattern negation character in globbing [...] expressions, so let those pass without expansion. */ else if (i > 0 && (string[i - 1] == '[') && member (']', string + i)) continue; #endif /* SHELL */ else goto grovel; } #if defined (SHELL) else if (string[i] == '\'') { /* If this is bash, single quotes inhibit history expansion. */ i++; rl_string_extract_single_quoted (string, &i); } else if (string[i] == '\\') { /* If this is bash, allow backslashes to quote single quotes and the history expansion character. */ if (string[i + 1] == '\'' || (string[i + 1] == history_expansion_char)) i++; } #endif /* SHELL */ } free (result); *output = savestring (string); return (0); grovel: for (i = j = 0; i < l; i++) { int passc = 0; int tchar = string[i]; if (tchar == history_expansion_char) tchar = -3; if (passc) { passc = 0; goto add_char; } switch (tchar) { case '\\': if (string[i + 1] == history_expansion_char) { i++; temp = tbl; goto do_add; } else { passc++; goto add_char; } #if defined (SHELL) case '\'': { /* If this is bash, single quotes inhibit history expansion. */ int quote = i, slen; ++i; rl_string_extract_single_quoted (string, &i); slen = i - quote + 2; temp = (char *)alloca (slen); strncpy (temp, string + quote, slen); temp[slen - 1] = '\0'; goto do_add; } #endif /* SHELL */ /* case history_expansion_char: */ case -3: starting_index = i + 1; cc = string[i + 1]; /* If the history_expansion_char is followed by one of the characters in history_no_expand_chars, then it is not a candidate for expansion of any kind. */ if (member (cc, history_no_expand_chars)) goto add_char; /* There is something that is listed as a `word specifier' in csh documentation which means `the expanded text to this point'. That is not a word specifier, it is an event specifier. */ if (cc == '#') goto hack_pound_sign; /* If it is followed by something that starts a word specifier, then !! is implied as the event specifier. */ if (member (cc, ":$*%^")) { char fake_s[3]; int fake_i = 0; i++; fake_s[0] = fake_s[1] = history_expansion_char; fake_s[2] = '\0'; event = get_history_event (fake_s, &fake_i, 0); } else { int quoted_search_delimiter = 0; /* If the character before this `!' is a double or single quote, then this expansion takes place inside of the quoted string. If we have to search for some text ("!foo"), allow the delimiter to end the search string. */ if (i && (string[i - 1] == '\'' || string[i - 1] == '"')) quoted_search_delimiter = string[i - 1]; event = get_history_event (string, &i, quoted_search_delimiter); } if (!event) event_not_found: { int ll = 1 + (i - starting_index); temp = (char *)alloca (1 + ll); strncpy (temp, string + starting_index, ll); temp[ll - 1] = 0; sprintf (result, "%s: %s.", temp, word_spec_error ? "Bad word specifier" : "Event not found"); *output = result; return (-1); } /* If a word specifier is found, then do what that requires. */ starting_index = i; word_spec = get_history_word_specifier (string, event, &i); /* There is no such thing as a `malformed word specifier'. However, it is possible for a specifier that has no match. In that case, we complain. */ if (word_spec == (char *)&error_pointer) { word_spec_error++; goto event_not_found; } /* If no word specifier, than the thing of interest was the event. */ if (!word_spec) temp = event; else { temp = (char *)alloca (1 + strlen (word_spec)); strcpy (temp, word_spec); free (word_spec); } /* Perhaps there are other modifiers involved. Do what they say. */ hack_specials: if (string[i] == ':') { char *tstr; switch (string[i + 1]) { /* :p means make this the last executed line. So we return an error state after adding this line to the history. */ case 'p': only_printing++; goto next_special; /* :t discards all but the last part of the pathname. */ case 't': tstr = strrchr (temp, '/'); if (tstr) temp = ++tstr; goto next_special; /* :h discards the last part of a pathname. */ case 'h': tstr = strrchr (temp, '/'); if (tstr) *tstr = '\0'; goto next_special; /* :r discards the suffix. */ case 'r': tstr = strrchr (temp, '.'); if (tstr) *tstr = '\0'; goto next_special; /* :e discards everything but the suffix. */ case 'e': tstr = strrchr (temp, '.'); if (tstr) temp = tstr; goto next_special; /* :s/this/that substitutes `this' for `that'. */ /* :gs/this/that substitutes `this' for `that' globally. */ case 'g': #ifdef NOTYET /* :g/this/that is equivalent to :gs/this/that */ substitute_globally = 1; if (string[i + 2] == 's') i++; #else if (string[i + 2] == 's') { i++; substitute_globally = 1; goto substitute; } #endif else case 's': substitute: { char *this, *that, *new_event; int delimiter = 0; int si, l_this, l_that, l_temp = strlen (temp); if (i + 2 < (int)strlen (string)) delimiter = string[i + 2]; if (!delimiter) break; i += 3; /* Get THIS. */ for (si = i; string[si] && string[si] != delimiter; si++); l_this = (si - i); this = (char *)alloca (1 + l_this); strncpy (this, string + i, l_this); this[l_this] = '\0'; i = si; if (string[si]) i++; /* Get THAT. */ for (si = i; string[si] && string[si] != delimiter; si++); l_that = (si - i); that = (char *)alloca (1 + l_that); strncpy (that, string + i, l_that); that[l_that] = '\0'; i = si; if (string[si]) i++; /* Ignore impossible cases. */ if (l_this > l_temp) goto cant_substitute; /* Find the first occurrence of THIS in TEMP. */ si = 0; for (; (si + l_this) <= l_temp; si++) if (strncmp (temp + si, this, l_this) == 0) { new_event = (char *)alloca (1 + (l_that - l_this) + l_temp); strncpy (new_event, temp, si); strncpy (new_event + si, that, l_that); strncpy (new_event + si + l_that, temp + si + l_this, l_temp - (si + l_this)); new_event[(l_that - l_this) + l_temp] = '\0'; temp = new_event; if (substitute_globally) { si += l_that; l_temp = strlen (temp); substitute_globally++; continue; } goto hack_specials; } cant_substitute: if (substitute_globally > 1) { substitute_globally = 0; goto hack_specials; } goto event_not_found; } /* :# is the line so far. Note that we have to alloca () it since RESULT could be realloc ()'ed below in add_string. */ case '#': hack_pound_sign: if (result) { temp = (char *)alloca (1 + strlen (result)); strcpy (temp, result); } else temp = ""; next_special: i += 2; goto hack_specials; } } /* Believe it or not, we have to back the pointer up by one. */ --i; goto add_string; /* A regular character. Just add it to the output string. */ default: add_char: tt[0] = string[i]; temp = tt; goto do_add; add_string: modified++; do_add: j += strlen (temp); while (j > (len - 1)) result = (char *)xrealloc (result, (len += 256)); strcpy (result + (j - strlen (temp)), temp); } } *output = result; if (only_printing) { add_history (result); return (-1); } return (modified != 0); } /* Return a consed string which is the word specified in SPEC, and found in FROM. NULL is returned if there is no spec. The address of ERROR_POINTER is returned if the word specified cannot be found. CALLER_INDEX is the offset in SPEC to start looking; it is updated to point to just after the last character parsed. */ static char * get_history_word_specifier (spec, from, caller_index) char *spec, *from; int *caller_index; { register int i = *caller_index; int first, last; int expecting_word_spec = 0; char *history_arg_extract (); /* The range of words to return doesn't exist yet. */ first = last = 0; /* If we found a colon, then this *must* be a word specification. If it isn't, then it is an error. */ if (spec[i] == ':') i++, expecting_word_spec++; /* Handle special cases first. */ /* `%' is the word last searched for. */ if (spec[i] == '%') { *caller_index = i + 1; if (search_string) return (savestring (search_string)); else return (savestring ("")); } /* `*' matches all of the arguments, but not the command. */ if (spec[i] == '*') { char *star_result; *caller_index = i + 1; star_result = history_arg_extract (1, '$', from); if (!star_result) star_result = savestring (""); return (star_result); } /* `$' is last arg. */ if (spec[i] == '$') { *caller_index = i + 1; return (history_arg_extract ('$', '$', from)); } /* Try to get FIRST and LAST figured out. */ if (spec[i] == '-' || spec[i] == '^') { first = 1; goto get_last; } if (digit (spec[i]) && expecting_word_spec) { sscanf (spec + i, "%d", &first); for (; digit (spec[i]); i++); } else return ((char *)NULL); get_last: if (spec[i] == '^') { i++; last = 1; goto get_args; } if (spec[i] != '-') { last = first; goto get_args; } i++; if (digit (spec[i])) { sscanf (spec + i, "%d", &last); for (; digit (spec[i]); i++); } else if (spec[i] == '$') { i++; last = '$'; } get_args: { char *result = (char *)NULL; *caller_index = i; if (last >= first) result = history_arg_extract (first, last, from); if (result) return (result); else return ((char *)&error_pointer); } } /* Extract the args specified, starting at FIRST, and ending at LAST. The args are taken from STRING. If either FIRST or LAST is < 0, then make that arg count from the right (subtract from the number of tokens, so that FIRST = -1 means the next to last token on the line). */ char * history_arg_extract (first, last, string) int first, last; char *string; { register int i, len; char *result = (char *)NULL; int size = 0, offset = 0; char **history_tokenize (), **list; if (!(list = history_tokenize (string))) return ((char *)NULL); for (len = 0; list[len]; len++); if (last < 0) last = len + last - 1; if (first < 0) first = len + first - 1; if (last == '$') last = len - 1; if (first == '$') first = len - 1; last++; if (first > len || last > len || first < 0 || last < 0) result = ((char *)NULL); else { for (i = first; i < last; i++) { int l = strlen (list[i]); if (!result) result = (char *)xmalloc ((size = (2 + l))); else result = (char *)xrealloc (result, (size += (2 + l))); strcpy (result + offset, list[i]); offset += l; if (i + 1 < last) { strcpy (result + offset, " "); offset++; } } } for (i = 0; i < len; i++) free (list[i]); free (list); return (result); } #define slashify_in_quotes "\\`\"$" /* Return an array of tokens, much as the shell might. The tokens are parsed out of STRING. */ char ** history_tokenize (string) char *string; { char **result = (char **)NULL; register int i, start, result_index, size; int len; i = result_index = size = 0; /* Get a token, and stuff it into RESULT. The tokens are split exactly where the shell would split them. */ get_token: /* Skip leading whitespace. */ for (; string[i] && whitespace(string[i]); i++); start = i; if (!string[i] || string[i] == history_comment_char) return (result); if (member (string[i], "()\n")) { i++; goto got_token; } if (member (string[i], "<>;&|$")) { int peek = string[i + 1]; if (peek == string[i] && peek != '$') { if (peek == '<' && string[i + 2] == '-') i++; i += 2; goto got_token; } else { if ((peek == '&' && (string[i] == '>' || string[i] == '<')) || ((peek == '>') && (string[i] == '&')) || ((peek == '(') && (string[i] == '$'))) { i += 2; goto got_token; } } if (string[i] != '$') { i++; goto got_token; } } /* Get word from string + i; */ { int delimiter = 0; if (member (string[i], "\"'`")) delimiter = string[i++]; for (;string[i]; i++) { if (string[i] == '\\') { if (string[i + 1] == '\n') { i++; continue; } else { if (delimiter != '\'') if ((delimiter != '"') || (member (string[i], slashify_in_quotes))) { i++; continue; } } } if (delimiter && string[i] == delimiter) { delimiter = 0; continue; } if (!delimiter && (member (string[i], " \t\n;&()|<>"))) goto got_token; if (!delimiter && member (string[i], "\"'`")) { delimiter = string[i]; continue; } } got_token: len = i - start; if (result_index + 2 >= size) { if (!size) result = (char **)xmalloc ((size = 10) * (sizeof (char *))); else result = (char **)xrealloc (result, ((size += 10) * (sizeof (char *)))); } result[result_index] = (char *)xmalloc (1 + len); strncpy (result[result_index], string + start, len); result[result_index][len] = '\0'; result_index++; result[result_index] = (char *)NULL; } if (string[i]) goto get_token; return (result); } #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)xmalloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "history: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ /* **************************************************************** */ /* */ /* Test Code */ /* */ /* **************************************************************** */ #ifdef TEST main () { char line[1024], *t; int done = 0; line[0] = 0; while (!done) { fprintf (stdout, "history%% "); t = gets (line); if (!t) strcpy (line, "quit"); if (line[0]) { char *expansion; int result; using_history (); result = history_expand (line, &expansion); strcpy (line, expansion); free (expansion); if (result) fprintf (stderr, "%s\n", line); if (result < 0) continue; add_history (line); } if (strcmp (line, "quit") == 0) done = 1; if (strcmp (line, "save") == 0) write_history (0); if (strcmp (line, "read") == 0) read_history (0); if (strcmp (line, "list") == 0) { register HIST_ENTRY **the_list = history_list (); register int i; if (the_list) for (i = 0; the_list[i]; i++) fprintf (stdout, "%d: %s\n", i + history_base, the_list[i]->line); } if (strncmp (line, "delete", strlen ("delete")) == 0) { int which; if ((sscanf (line + strlen ("delete"), "%d", &which)) == 1) { HIST_ENTRY *entry = remove_history (which); if (!entry) fprintf (stderr, "No such entry %d\n", which); else { free (entry->line); free (entry); } } else { fprintf (stderr, "non-numeric arg given to `delete'\n"); } } } } #endif /* TEST */ /* * Local variables: * compile-command: "gcc -g -DTEST -o history history.c" * end: */ octave-1.1.0/readline/isearch.c100666 415 17 22310 5521547744 14537 0ustar jweusers/* **************************************************************** */ /* */ /* I-Search and Searching */ /* */ /* **************************************************************** */ /* Copyright (C) 1987,1989 Free Software Foundation, Inc. This file contains the Readline Library (the Library), a set of routines for providing Emacs style line input to programs that ask for it. The 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 1, or (at your option) any later version. The 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #if defined (__GNUC__) # define alloca __builtin_alloca #else # if defined (sparc) || defined (HAVE_ALLOCA_H) # include # endif #endif #include "readline.h" #include "history.h" extern Keymap _rl_keymap; extern HIST_ENTRY *saved_line_for_history; extern int rl_line_buffer_len; extern int rl_point, rl_end; extern char *rl_prompt, *rl_line_buffer; /* Remove these declarations when we have a complete libgnu.a. */ extern char *xmalloc (), *xrealloc (); static void rl_search_history (); /* Defined in display.c */ extern int rl_message (), rl_clear_message (); extern void rl_redisplay (); /* Search backwards through the history looking for a string which is typed interactively. Start with the current line. */ int rl_reverse_search_history (sign, key) int sign; int key; { rl_search_history (-sign, key); return 0; } /* Search forwards through the history looking for a string which is typed interactively. Start with the current line. */ int rl_forward_search_history (sign, key) int sign; int key; { rl_search_history (sign, key); return 0; } /* Display the current state of the search in the echo-area. SEARCH_STRING contains the string that is being searched for, DIRECTION is zero for forward, or 1 for reverse, WHERE is the history list number of the current line. If it is -1, then this line is the starting one. */ static void rl_display_search (search_string, reverse_p, where) char *search_string; int reverse_p, where; { char *message = (char *)NULL; message = (char *)xmalloc (1 + (search_string ? strlen (search_string) : 0) + 30); *message = '\0'; #if defined (NOTDEF) if (where != -1) sprintf (message, "[%d]", where + history_base); #endif /* NOTDEF */ strcat (message, "("); if (reverse_p) strcat (message, "reverse-"); strcat (message, "i-search)`"); if (search_string) strcat (message, search_string); strcat (message, "': "); rl_message ("%s", message, 0); free (message); rl_redisplay (); } /* Search through the history looking for an interactively typed string. This is analogous to i-search. We start the search in the current line. DIRECTION is which direction to search; >= 0 means forward, < 0 means backwards. */ static void rl_search_history (direction, invoking_key) int direction; int invoking_key; { /* The string that the user types in to search for. */ char *search_string; /* The current length of SEARCH_STRING. */ int search_string_index; /* The amount of space that SEARCH_STRING has allocated to it. */ int search_string_size; /* The list of lines to search through. */ char **lines; /* The length of LINES. */ int hlen; /* Where we get LINES from. */ HIST_ENTRY **hlist = history_list (); register int i = 0; int orig_point = rl_point; int orig_line = where_history (); int last_found_line = orig_line; int c, done = 0; /* The line currently being searched. */ char *sline; /* Offset in that line. */ int index; /* Non-zero if we are doing a reverse search. */ int reverse = (direction < 0); /* Create an arrary of pointers to the lines that we want to search. */ maybe_replace_line (); if (hlist) for (i = 0; hlist[i]; i++); /* Allocate space for this many lines, +1 for the current input line, and remember those lines. */ lines = (char **)alloca ((1 + (hlen = i)) * sizeof (char *)); for (i = 0; i < hlen; i++) lines[i] = hlist[i]->line; if (saved_line_for_history) lines[i] = saved_line_for_history->line; else /* So I have to type it in this way instead. */ { char *alloced_line; /* Keep that MIPS alloca () happy. */ alloced_line = (char *)alloca (1 + strlen (rl_line_buffer)); lines[i] = alloced_line; strcpy (lines[i], &rl_line_buffer[0]); } hlen++; /* The line where we start the search. */ i = orig_line; /* Initialize search parameters. */ search_string = (char *)xmalloc (search_string_size = 128); *search_string = '\0'; search_string_index = 0; /* Normalize DIRECTION into 1 or -1. */ if (direction >= 0) direction = 1; else direction = -1; rl_display_search (search_string, reverse, -1); sline = rl_line_buffer; index = rl_point; while (!done) { c = rl_read_key (); /* Hack C to Do What I Mean. */ { Function *f = (Function *)NULL; if (_rl_keymap[c].type == ISFUNC) { f = _rl_keymap[c].function; if (f == rl_reverse_search_history) c = reverse ? -1 : -2; else if (f == rl_forward_search_history) c = !reverse ? -1 : -2; } } switch (c) { case ESC: done = 1; continue; /* case invoking_key: */ case -1: goto search_again; /* switch directions */ case -2: direction = -direction; reverse = (direction < 0); goto do_search; case CTRL ('G'): strcpy (rl_line_buffer, lines[orig_line]); rl_point = orig_point; rl_end = strlen (rl_line_buffer); rl_clear_message (); return; default: if (c < 32 || c > 126) { rl_execute_next (c); done = 1; continue; } else { if (search_string_index + 2 >= search_string_size) search_string = (char *)xrealloc (search_string, (search_string_size += 128)); search_string[search_string_index++] = c; search_string[search_string_index] = '\0'; goto do_search; search_again: if (!search_string_index) continue; else { if (reverse) --index; else if (index != strlen (sline)) ++index; else ding (); } do_search: while (1) { if (reverse) { while (index >= 0) if (strncmp (search_string, sline + index, search_string_index) == 0) goto string_found; else index--; } else { register int limit = (strlen (sline) - search_string_index) + 1; while (index < limit) { if (strncmp (search_string, sline + index, search_string_index) == 0) goto string_found; index++; } } next_line: i += direction; /* At limit for direction? */ if ((reverse && i < 0) || (!reverse && i == hlen)) goto search_failed; sline = lines[i]; if (reverse) index = strlen (sline); else index = 0; /* If the search string is longer than the current line, no match. */ if (search_string_index > (int)strlen (sline)) goto next_line; /* Start actually searching. */ if (reverse) index -= search_string_index; } search_failed: /* We cannot find the search string. Ding the bell. */ ding (); i = last_found_line; break; string_found: /* We have found the search string. Just display it. But don't actually move there in the history list until the user accepts the location. */ { int line_len; line_len = strlen (lines[i]); if (line_len >= rl_line_buffer_len) rl_extend_line_buffer (line_len); strcpy (rl_line_buffer, lines[i]); rl_point = index; rl_end = line_len; last_found_line = i; rl_display_search (search_string, reverse, (i == orig_line) ? -1 : i); } } } } /* The searching is over. The user may have found the string that she was looking for, or else she may have exited a failing search. If INDEX is -1, then that shows that the string searched for was not found. We use this to determine where to place rl_point. */ { int now = last_found_line; /* First put back the original state. */ strcpy (rl_line_buffer, lines[orig_line]); /* Free the search string. */ free (search_string); if (now < orig_line) rl_get_previous_history (orig_line - now); else rl_get_next_history (now - orig_line); /* If the index of the "matched" string is less than zero, then the final search string was never matched, so put point somewhere reasonable. */ if (index < 0) index = strlen (rl_line_buffer); rl_point = index; rl_clear_message (); } } octave-1.1.0/readline/keymaps.c100666 415 17 10530 5521547744 14573 0ustar jweusers/* keymaps.c -- Functions and keymaps for the GNU Readline library. */ /* Copyright (C) 1988,1989 Free Software Foundation, Inc. This file is part of GNU Readline, a library for reading lines of text with interactive input and history editing. Readline 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 1, or (at your option) any later version. Readline 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 Readline; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include "keymaps.h" #include "emacs_keymap.c" #ifdef VI_MODE #include "vi_keymap.c" #endif #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ /* **************************************************************** */ /* */ /* Functions for manipulating Keymaps. */ /* */ /* **************************************************************** */ /* Return a new, empty keymap. Free it with free() when you are done. */ Keymap rl_make_bare_keymap () { register int i; Keymap keymap = (Keymap)xmalloc (KEYMAP_SIZE * sizeof (KEYMAP_ENTRY)); for (i = 0; i < KEYMAP_SIZE; i++) { keymap[i].type = ISFUNC; keymap[i].function = (Function *)NULL; } for (i = 'A'; i < ('Z' + 1); i++) { keymap[i].type = ISFUNC; keymap[i].function = rl_do_lowercase_version; } return (keymap); } /* Return a new keymap which is a copy of MAP. */ Keymap rl_copy_keymap (map) Keymap map; { register int i; Keymap temp = rl_make_bare_keymap (); for (i = 0; i < KEYMAP_SIZE; i++) { temp[i].type = map[i].type; temp[i].function = map[i].function; } return (temp); } /* Return a new keymap with the printing characters bound to rl_insert, the uppercase Meta characters bound to run their lowercase equivalents, and the Meta digits bound to produce numeric arguments. */ Keymap rl_make_keymap () { extern int rl_insert (), rl_rubout (); register int i; Keymap newmap; newmap = rl_make_bare_keymap (); /* All ASCII printing characters are self-inserting. */ for (i = ' '; i < 126; i++) newmap[i].function = rl_insert; newmap[TAB].function = rl_insert; newmap[RUBOUT].function = rl_rubout; newmap[CTRL('H')].function = rl_rubout; #if KEYMAP_SIZE > 128 /* Printing characters in some 8-bit character sets. */ for (i = 128; i < 160; i++) newmap[i].function = rl_insert; /* ISO Latin-1 printing characters should self-insert. */ for (i = 160; i < 256; i++) newmap[i].function = rl_insert; #endif /* KEYMAP_SIZE > 128 */ return (newmap); } /* Free the storage associated with MAP. */ int rl_discard_keymap (map) Keymap (map); { int i; if (!map) return 0; for (i = 0; i < KEYMAP_SIZE; i++) { switch (map[i].type) { case ISFUNC: break; case ISKMAP: rl_discard_keymap ((Keymap)map[i].function); break; case ISMACR: free ((char *)map[i].function); break; } } return 0; } #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ octave-1.1.0/readline/parens.c100666 415 17 7320 5521547744 14375 0ustar jweusers/* parens.c -- Implemenation of matching parenthesis feature. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include /* With SunOS 4.1.x at least, and Ultrix 4.x, sys/types.h won't define the FD_XXX macros if _POSIX_SOURCE is defined */ #if defined (_POSIX_SOURCE) && (defined (sun) || defined (ultrix)) #undef _POSIX_SOURCE #endif /* On the Alpha, we have to have _OSF_SOURCE defined for sys/types.h to define the FD_XXX macros. */ #if defined (__alpha__) && ! defined (_OSF_SOURCE) #define _OSF_SOURCE #endif #include /* AIX (any others?) defines the FD_XXX macros in sys/select.h */ #if defined (HAVE_SYS_SELECT_H) #include #endif #if defined (FD_SET) #include #endif #include "readline.h" /* Non-zero means try to blink the matching open parenthesis when the close parenthesis is inserted. */ #if defined (FD_SET) int rl_blink_matching_paren = 1; #else /* !FD_SET */ int rl_blink_matching_paren = 0; #endif /* !FD_SET */ /* Defined in display.c */ extern void rl_redisplay (); static int find_matching_open (); int rl_insert_close (count, invoking_key) int count, invoking_key; { extern int rl_explicit_arg; if (rl_explicit_arg || !rl_blink_matching_paren) rl_insert (count, invoking_key); else { #if defined (FD_SET) int orig_point, match_point, ready; struct timeval timer; fd_set readfds; rl_insert (1, invoking_key); rl_redisplay (); match_point = find_matching_open (rl_line_buffer, rl_point - 2, invoking_key); /* Emacs might message or ring the bell here, but I don't. */ if (match_point < 0) return 0; FD_ZERO (&readfds); FD_SET (fileno (rl_instream), &readfds); timer.tv_sec = 1; timer.tv_usec = 500; orig_point = rl_point; rl_point = match_point; rl_redisplay (); ready = select (1, &readfds, (fd_set *)NULL, (fd_set *)NULL, &timer); rl_point = orig_point; #else /* !FD_SET */ rl_insert (count, invoking_key); #endif /* !FD_SET */ } return 0; } static int find_matching_open (string, from, closer) char *string; int from, closer; { register int i; int opener, level, delimiter; switch (closer) { case ']': opener = '['; break; case '}': opener = '{'; break; case ')': opener = '('; break; default: return (-1); } level = 1; /* The closer passed in counts as 1. */ delimiter = 0; /* Delimited state unknown. */ for (i = from; i > -1; i--) { if (delimiter && (string[i] == delimiter)) delimiter = 0; else if ((string[i] == '\'') || (string[i] == '"')) delimiter = rl_line_buffer[i]; else if (!delimiter && (string[i] == closer)) level++; else if (!delimiter && (string[i] == opener)) level--; if (!level) break; } return (i); } octave-1.1.0/readline/readline.c100666 415 17 223111 5521547744 14726 0ustar jweusers/* readline.c -- a general facility for reading lines of input with emacs style editing and completion. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #if !defined (NO_SYS_FILE) # include #endif /* !NO_SYS_FILE */ #include /* This is needed to include support for TIOCGWINSZ and window resizing. */ #if defined (OSF1) || defined (BSD386) || defined (_386BSD) || defined (AIX) # include #endif /* OSF1 */ #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include /* Not all systems declare ERRNO in errno.h... and some systems #define it! */ #if !defined (errno) extern int errno; #endif /* !errno */ #include /* #define HACK_TERMCAP_MOTION */ #include "posixstat.h" /* System-specific feature definitions and include files. */ #include "rldefs.h" /* Some standard library routines. */ #include "readline.h" #include "history.h" /* NOTE: Functions and variables prefixed with `_rl_' are pseudo-global: they are global so they can be shared between files in the readline library, but are not intended to be visible to readline callers. */ /* Functions imported from other files in the library. */ extern char *tgetstr (); extern void rl_prep_terminal (), rl_deprep_terminal (); extern void rl_vi_set_last (); extern Function *rl_function_of_keyseq (); extern char *tilde_expand (); /* External redisplay functions and variables from display.c */ extern void rl_redisplay (); extern void _rl_move_vert (); extern void _rl_erase_at_end_of_line (); extern void _rl_move_cursor_relative (); extern int _rl_vis_botlin; extern int _rl_last_c_pos; extern int rl_display_fixed; /* Variables imported from complete.c. */ extern char *rl_completer_word_break_characters; extern char *rl_basic_word_break_characters; extern Function *rl_symbolic_link_hook; extern int rl_completion_query_items; extern int rl_complete_with_tilde_expansion; /* Forward declarations used in this file. */ void rl_dispatch (); void free_history_entry (); void _rl_output_character_function (); void _rl_set_screen_size (); void free_undo_list (), rl_add_undo (); int rl_initialize (), readline_initialize_everything (); int start_using_history (), init_terminal_io (), rl_digit_loop (); int rl_modifying (); /* Defined in display.c */ extern int rl_on_new_line (), rl_message (), rl_clear_message (), rl_character_len (), rl_forced_update_display (); /* Defined in signals.c */ extern int rl_set_signals (), rl_clear_signals (), rl_reset_line_state (); /* Defined in vi_mode.c */ extern int rl_vi_check (), rl_vi_textmod_command (); /* Defined in bind.c */ extern int rl_set_key (), rl_read_init_file (); /* Defined in funmap.c */ extern void rl_initialize_funmap (); /* Defined in rltty.c */ extern void rltty_set_default_bindings (); #if !defined (_GO32_) static void readline_default_bindings (); #endif /* !_GO32_ */ #if defined (_GO32_) # include # undef HANDLE_SIGNALS #endif /* _GO32_ */ #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ /* **************************************************************** */ /* */ /* Line editing input utility */ /* */ /* **************************************************************** */ static char *LibraryVersion = "2.0"; /* A pointer to the keymap that is currently in use. By default, it is the standard emacs keymap. */ Keymap _rl_keymap = emacs_standard_keymap; /* The current style of editing. */ int rl_editing_mode = emacs_mode; /* Non-zero if the previous command was a kill command. */ static int last_command_was_kill = 0; /* The current value of the numeric argument specified by the user. */ int rl_numeric_arg = 1; /* Non-zero if an argument was typed. */ int rl_explicit_arg = 0; /* Temporary value used while generating the argument. */ int rl_arg_sign = 1; /* Non-zero means we have been called at least once before. */ static int rl_initialized = 0; /* If non-zero, this program is running in an EMACS buffer. */ static char *running_in_emacs = (char *)NULL; /* The current offset in the current input line. */ int rl_point; /* Mark in the current input line. */ int rl_mark; /* Length of the current input line. */ int rl_end; /* Make this non-zero to return the current input_line. */ int rl_done; /* The last function executed by readline. */ Function *rl_last_func = (Function *)NULL; /* Top level environment for readline_internal (). */ static jmp_buf readline_top_level; /* The streams we interact with. */ static FILE *in_stream, *out_stream; /* The names of the streams that we do input and output to. */ FILE *rl_instream = (FILE *)NULL; FILE *rl_outstream = (FILE *)NULL; /* Non-zero means echo characters as they are read. */ int readline_echoing_p = 1; /* Current prompt. */ char *rl_prompt; /* The number of characters read in order to type this complete command. */ int rl_key_sequence_length = 0; /* If non-zero, then this is the address of a function to call just before readline_internal () prints the first prompt. */ Function *rl_startup_hook = (Function *)NULL; /* What we use internally. You should always refer to RL_LINE_BUFFER. */ static char *the_line; /* The character that can generate an EOF. Really read from the terminal driver... just defaulted here. */ int _rl_eof_char = CTRL ('D'); /* Non-zero makes this the next keystroke to read. */ int rl_pending_input = 0; /* Pointer to a useful terminal name. */ char *rl_terminal_name = (char *)NULL; /* Non-zero means to always use horizontal scrolling in line display. */ int _rl_horizontal_scroll_mode = 0; /* Non-zero means to display an asterisk at the starts of history lines which have been modified. */ int _rl_mark_modified_lines = 0; /* Non-zero means to use a visible bell if one is available rather than simply ringing the terminal bell. */ int _rl_prefer_visible_bell = 0; /* Line buffer and maintenence. */ char *rl_line_buffer = (char *)NULL; int rl_line_buffer_len = 0; #define DEFAULT_BUFFER_SIZE 256 /* **************************************************************** */ /* */ /* `Forward' declarations */ /* */ /* **************************************************************** */ /* Non-zero means do not parse any lines other than comments and parser directives. */ unsigned char _rl_parsing_conditionalized_out = 0; /* Non-zero means to save keys that we dispatch on in a kbd macro. */ static int defining_kbd_macro = 0; /* Non-zero means to convert characters with the meta bit set to escape-prefixed characters so we can indirect through emacs_meta_keymap or vi_escape_keymap. */ int _rl_convert_meta_chars_to_ascii = 1; /* Non-zero tells rl_delete_text and rl_insert_text to not add to the undo list. */ static int doing_an_undo = 0; /* **************************************************************** */ /* */ /* Top Level Functions */ /* */ /* **************************************************************** */ /* Non-zero means treat 0200 bit in terminal input as Meta bit. */ int _rl_meta_flag = 0; /* Forward declaration */ /* Read a line of input. Prompt with PROMPT. A NULL PROMPT means none. A return value of NULL means that EOF was encountered. */ char * readline (prompt) char *prompt; { char *readline_internal (); char *value; rl_prompt = prompt; /* If we are at EOF return a NULL string. */ if (rl_pending_input == EOF) { rl_pending_input = 0; return ((char *)NULL); } rl_initialize (); rl_prep_terminal (_rl_meta_flag); #if defined (HANDLE_SIGNALS) rl_set_signals (); #endif value = readline_internal (); rl_deprep_terminal (); #if defined (HANDLE_SIGNALS) rl_clear_signals (); #endif return (value); } /* Read a line of input from the global rl_instream, doing output on the global rl_outstream. If rl_prompt is non-null, then that is our prompt. */ char * readline_internal () { int lastc, c, eof_found; in_stream = rl_instream; out_stream = rl_outstream; lastc = -1; eof_found = 0; if (rl_startup_hook) (*rl_startup_hook) (); if (!readline_echoing_p) { if (rl_prompt) { fprintf (out_stream, "%s", rl_prompt); fflush (out_stream); } } else { rl_on_new_line (); rl_redisplay (); #if defined (VI_MODE) if (rl_editing_mode == vi_mode) rl_vi_insertion_mode (); #endif /* VI_MODE */ } while (!rl_done) { int lk = last_command_was_kill; int code; code = setjmp (readline_top_level); if (code) rl_redisplay (); if (!rl_pending_input) { /* Then initialize the argument and number of keys read. */ rl_init_argument (); rl_key_sequence_length = 0; } c = rl_read_key (); /* EOF typed to a non-blank line is a . */ if (c == EOF && rl_end) c = NEWLINE; /* The character _rl_eof_char typed to blank line, and not as the previous character is interpreted as EOF. */ if (((c == _rl_eof_char && lastc != c) || c == EOF) && !rl_end) { eof_found = 1; break; } lastc = c; rl_dispatch (c, _rl_keymap); /* If there was no change in last_command_was_kill, then no kill has taken place. Note that if input is pending we are reading a prefix command, so nothing has changed yet. */ if (!rl_pending_input) { if (lk == last_command_was_kill) last_command_was_kill = 0; } #if defined (VI_MODE) /* In vi mode, when you exit insert mode, the cursor moves back over the previous character. We explicitly check for that here. */ if (rl_editing_mode == vi_mode && _rl_keymap == vi_movement_keymap) rl_vi_check (); #endif /* VI_MODE */ if (!rl_done) rl_redisplay (); } /* Restore the original of this history line, iff the line that we are editing was originally in the history, AND the line has changed. */ { HIST_ENTRY *entry = current_history (); if (entry && rl_undo_list) { char *temp = savestring (the_line); rl_revert_line (); entry = replace_history_entry (where_history (), the_line, (HIST_ENTRY *)NULL); free_history_entry (entry); strcpy (the_line, temp); free (temp); } } /* At any rate, it is highly likely that this line has an undo list. Get rid of it now. */ if (rl_undo_list) free_undo_list (); if (eof_found) return (char *)NULL; else return (savestring (the_line)); } /* **************************************************************** */ /* */ /* Character Input Buffering */ /* */ /* **************************************************************** */ static int pop_index = 0, push_index = 0, ibuffer_len = 511; static unsigned char ibuffer[512]; /* Non-null means it is a pointer to a function to run while waiting for character input. */ Function *rl_event_hook = (Function *)NULL; #define any_typein (push_index != pop_index) /* Add KEY to the buffer of characters to be read. */ int rl_stuff_char (key) int key; { if (key == EOF) { key = NEWLINE; rl_pending_input = EOF; } ibuffer[push_index++] = key; if (push_index >= ibuffer_len) push_index = 0; return 0; } /* Return the amount of space available in the buffer for stuffing characters. */ int ibuffer_space () { if (pop_index > push_index) return (pop_index - push_index); else return (ibuffer_len - (push_index - pop_index)); } /* Get a key from the buffer of characters to be read. Return the key in KEY. Result is KEY if there was a key, or 0 if there wasn't. */ int rl_get_char (key) int *key; { if (push_index == pop_index) return (0); *key = ibuffer[pop_index++]; if (pop_index >= ibuffer_len) pop_index = 0; return (1); } /* Stuff KEY into the *front* of the input buffer. Returns non-zero if successful, zero if there is no space left in the buffer. */ int rl_unget_char (key) int key; { if (ibuffer_space ()) { pop_index--; if (pop_index < 0) pop_index = ibuffer_len - 1; ibuffer[pop_index] = key; return (1); } return (0); } /* If a character is available to be read, then read it and stuff it into IBUFFER. Otherwise, just return. */ void rl_gather_tyi () { #if defined (_GO32_) char input; if (isatty (0)) { int i = rl_getc (); if (i != EOF) rl_stuff_char (i); } else if (kbhit () && ibuffer_space ()) rl_stuff_char (getkey ()); #else /* !_GO32_ */ int tty = fileno (in_stream); register int tem, result = -1; int chars_avail; char input; #if defined (FIONREAD) result = ioctl (tty, FIONREAD, &chars_avail); #endif #if defined (O_NDELAY) if (result == -1) { int flags; flags = fcntl (tty, F_GETFL, 0); fcntl (tty, F_SETFL, (flags | O_NDELAY)); chars_avail = read (tty, &input, 1); fcntl (tty, F_SETFL, flags); if (chars_avail == -1 && errno == EAGAIN) return; } #endif /* O_NDELAY */ /* If there's nothing available, don't waste time trying to read something. */ if (chars_avail == 0) return; tem = ibuffer_space (); if (chars_avail > tem) chars_avail = tem; /* One cannot read all of the available input. I can only read a single character at a time, or else programs which require input can be thwarted. If the buffer is larger than one character, I lose. Damn! */ if (tem < ibuffer_len) chars_avail = 0; if (result != -1) { while (chars_avail--) rl_stuff_char (rl_getc (in_stream)); } else { if (chars_avail) rl_stuff_char (input); } #endif /* !_GO32_ */ } static int next_macro_key (); /* Read a key, including pending input. */ int rl_read_key () { int c; rl_key_sequence_length++; if (rl_pending_input) { c = rl_pending_input; rl_pending_input = 0; } else { /* If input is coming from a macro, then use that. */ if ((c = next_macro_key ()) != '\0') return (c); /* If the user has an event function, then call it periodically. */ if (rl_event_hook) { while (rl_event_hook && !rl_get_char (&c)) { (*rl_event_hook) (); rl_gather_tyi (); } } else { if (!rl_get_char (&c)) c = rl_getc (in_stream); } } return (c); } /* Found later in this file. */ static void add_macro_char (), with_macro_input (); /* Do the command associated with KEY in MAP. If the associated command is really a keymap, then read another key, and dispatch into that map. */ void rl_dispatch (key, map) register int key; Keymap map; { #if defined (VI_MODE) extern int _rl_vi_last_command, _rl_vi_last_repeat, _rl_vi_last_arg_sign; #endif if (defining_kbd_macro) add_macro_char (key); if (META_CHAR (key) && _rl_convert_meta_chars_to_ascii) { if (map[ESC].type == ISKMAP) { #if defined (CRAY) map = (Keymap)((int)map[ESC].function); #else map = (Keymap)map[ESC].function; #endif key = UNMETA (key); rl_key_sequence_length += 2; rl_dispatch (key, map); } else ding (); return; } switch (map[key].type) { case ISFUNC: { Function *func = map[key].function; if (func != (Function *)NULL) { /* Special case rl_do_lowercase_version (). */ if (func == rl_do_lowercase_version) { rl_dispatch (to_lower (key), map); return; } (*map[key].function)(rl_numeric_arg * rl_arg_sign, key); /* If we have input pending, then the last command was a prefix command. Don't change the state of rl_last_func. Otherwise, remember the last command executed in this variable. */ if (!rl_pending_input) rl_last_func = map[key].function; } else { rl_abort (); return; } } break; case ISKMAP: if (map[key].function != (Function *)NULL) { int newkey; rl_key_sequence_length++; newkey = rl_read_key (); #if defined (CRAY) /* If you cast map[key].function to type (Keymap) on a Cray, the compiler takes the value of may[key].function and divides it by 4 to convert between pointer types (pointers to functions and pointers to structs are different sizes). This is not what is wanted. */ rl_dispatch (newkey, (Keymap)((int)map[key].function)); #else rl_dispatch (newkey, (Keymap)map[key].function); #endif /* !CRAY */ } else { rl_abort (); return; } break; case ISMACR: if (map[key].function != (Function *)NULL) { char *macro; macro = savestring ((char *)map[key].function); with_macro_input (macro); return; } break; } #if defined (VI_MODE) if (rl_editing_mode == vi_mode && _rl_keymap == vi_movement_keymap && rl_vi_textmod_command (key)) { _rl_vi_last_command = key; _rl_vi_last_repeat = rl_numeric_arg; _rl_vi_last_arg_sign = rl_arg_sign; } #endif } /* **************************************************************** */ /* */ /* Hacking Keyboard Macros */ /* */ /* **************************************************************** */ /* The currently executing macro string. If this is non-zero, then it is a malloc ()'ed string where input is coming from. */ static char *executing_macro = (char *)NULL; /* The offset in the above string to the next character to be read. */ static int executing_macro_index = 0; /* The current macro string being built. Characters get stuffed in here by add_macro_char (). */ static char *current_macro = (char *)NULL; /* The size of the buffer allocated to current_macro. */ static int current_macro_size = 0; /* The index at which characters are being added to current_macro. */ static int current_macro_index = 0; /* A structure used to save nested macro strings. It is a linked list of string/index for each saved macro. */ struct saved_macro { struct saved_macro *next; char *string; int index; }; /* The list of saved macros. */ struct saved_macro *macro_list = (struct saved_macro *)NULL; /* Forward declarations of static functions. Thank you C. */ static void push_executing_macro (), pop_executing_macro (); /* This one has to be declared earlier in the file. */ /* static void add_macro_char (); */ /* Set up to read subsequent input from STRING. STRING is free ()'ed when we are done with it. */ static void with_macro_input (string) char *string; { push_executing_macro (); executing_macro = string; executing_macro_index = 0; } /* Return the next character available from a macro, or 0 if there are no macro characters. */ static int next_macro_key () { if (!executing_macro) return (0); if (!executing_macro[executing_macro_index]) { pop_executing_macro (); return (next_macro_key ()); } return (executing_macro[executing_macro_index++]); } /* Save the currently executing macro on a stack of saved macros. */ static void push_executing_macro () { struct saved_macro *saver; saver = (struct saved_macro *)xmalloc (sizeof (struct saved_macro)); saver->next = macro_list; saver->index = executing_macro_index; saver->string = executing_macro; macro_list = saver; } /* Discard the current macro, replacing it with the one on the top of the stack of saved macros. */ static void pop_executing_macro () { if (executing_macro) free (executing_macro); executing_macro = (char *)NULL; executing_macro_index = 0; if (macro_list) { struct saved_macro *disposer = macro_list; executing_macro = macro_list->string; executing_macro_index = macro_list->index; macro_list = macro_list->next; free (disposer); } } /* Add a character to the macro being built. */ static void add_macro_char (c) int c; { if (current_macro_index + 1 >= current_macro_size) { if (!current_macro) current_macro = (char *)xmalloc (current_macro_size = 25); else current_macro = (char *)xrealloc (current_macro, current_macro_size += 25); } current_macro[current_macro_index++] = c; current_macro[current_macro_index] = '\0'; } /* Begin defining a keyboard macro. Keystrokes are recorded as they are executed. End the definition with rl_end_kbd_macro (). If a numeric argument was explicitly typed, then append this definition to the end of the existing macro, and start by re-executing the existing macro. */ int rl_start_kbd_macro (ignore1, ignore2) int ignore1, ignore2; { if (defining_kbd_macro) rl_abort (); if (rl_explicit_arg) { if (current_macro) with_macro_input (savestring (current_macro)); } else current_macro_index = 0; defining_kbd_macro = 1; return 0; } /* Stop defining a keyboard macro. A numeric argument says to execute the macro right now, that many times, counting the definition as the first time. */ int rl_end_kbd_macro (count, ignore) int count, ignore; { if (!defining_kbd_macro) rl_abort (); current_macro_index -= (rl_key_sequence_length - 1); current_macro[current_macro_index] = '\0'; defining_kbd_macro = 0; rl_call_last_kbd_macro (--count, 0); return 0; } /* Execute the most recently defined keyboard macro. COUNT says how many times to execute it. */ int rl_call_last_kbd_macro (count, ignore) int count, ignore; { if (!current_macro) rl_abort (); if (defining_kbd_macro) { ding (); /* no recursive macros */ current_macro[--current_macro_index] = '\0'; /* erase this char */ return 0; } while (count--) with_macro_input (savestring (current_macro)); return 0; } void _rl_kill_kbd_macro () { if (current_macro) { free (current_macro); current_macro = (char *) NULL; } current_macro_size = current_macro_index = 0; if (executing_macro) { free (executing_macro); executing_macro = (char *) NULL; } executing_macro_index = 0; defining_kbd_macro = 0; } /* **************************************************************** */ /* */ /* Initializations */ /* */ /* **************************************************************** */ /* Initliaze readline (and terminal if not already). */ int rl_initialize () { /* If we have never been called before, initialize the terminal and data structures. */ if (!rl_initialized) { readline_initialize_everything (); rl_initialized++; } /* Initalize the current line information. */ rl_point = rl_end = 0; the_line = rl_line_buffer; the_line[0] = 0; /* We aren't done yet. We haven't even gotten started yet! */ rl_done = 0; /* Tell the history routines what is going on. */ start_using_history (); /* Make the display buffer match the state of the line. */ rl_reset_line_state (); /* No such function typed yet. */ rl_last_func = (Function *)NULL; /* Parsing of key-bindings begins in an enabled state. */ _rl_parsing_conditionalized_out = 0; return 0; } /* Initialize the entire state of the world. */ int readline_initialize_everything () { /* Find out if we are running in Emacs. */ running_in_emacs = getenv ("EMACS"); /* Set up input and output if they are not already set up. */ if (!rl_instream) rl_instream = stdin; if (!rl_outstream) rl_outstream = stdout; /* Bind in_stream and out_stream immediately. These values may change, but they may also be used before readline_internal () is called. */ in_stream = rl_instream; out_stream = rl_outstream; /* Allocate data structures. */ if (!rl_line_buffer) rl_line_buffer = (char *)xmalloc (rl_line_buffer_len = DEFAULT_BUFFER_SIZE); /* Initialize the terminal interface. */ init_terminal_io ((char *)NULL); #if !defined (_GO32_) /* Bind tty characters to readline functions. */ readline_default_bindings (); #endif /* !_GO32_ */ /* Initialize the function names. */ rl_initialize_funmap (); /* Read in the init file. */ rl_read_init_file ((char *)NULL); /* If the completion parser's default word break characters haven't been set yet, then do so now. */ { if (rl_completer_word_break_characters == (char *)NULL) rl_completer_word_break_characters = rl_basic_word_break_characters; } return 0; } /* If this system allows us to look at the values of the regular input editing characters, then bind them to their readline equivalents, iff the characters are not bound to keymaps. */ static void readline_default_bindings () { rltty_set_default_bindings (_rl_keymap); } /* **************************************************************** */ /* */ /* Numeric Arguments */ /* */ /* **************************************************************** */ /* Handle C-u style numeric args, as well as M--, and M-digits. */ /* Add the current digit to the argument in progress. */ int rl_digit_argument (ignore, key) int ignore, key; { rl_pending_input = key; rl_digit_loop (); return 0; } /* What to do when you abort reading an argument. */ int rl_discard_argument () { ding (); rl_clear_message (); rl_init_argument (); return 0; } /* Create a default argument. */ int rl_init_argument () { rl_numeric_arg = rl_arg_sign = 1; rl_explicit_arg = 0; return 0; } /* C-u, universal argument. Multiply the current argument by 4. Read a key. If the key has nothing to do with arguments, then dispatch on it. If the key is the abort character then abort. */ int rl_universal_argument () { rl_numeric_arg *= 4; rl_digit_loop (); return 0; } int rl_digit_loop () { int key, c; while (1) { rl_message ("(arg: %d) ", rl_arg_sign * rl_numeric_arg); key = c = rl_read_key (); if (_rl_keymap[c].type == ISFUNC && _rl_keymap[c].function == rl_universal_argument) { rl_numeric_arg *= 4; continue; } c = UNMETA (c); if (numeric (c)) { if (rl_explicit_arg) rl_numeric_arg = (rl_numeric_arg * 10) + (c - '0'); else rl_numeric_arg = (c - '0'); rl_explicit_arg = 1; } else { if (c == '-' && !rl_explicit_arg) { rl_numeric_arg = 1; rl_arg_sign = -1; } else { rl_clear_message (); rl_dispatch (key, _rl_keymap); return 0; } } } return 0; } /* **************************************************************** */ /* */ /* Terminal and Termcap */ /* */ /* **************************************************************** */ static char *term_buffer = (char *)NULL; static char *term_string_buffer = (char *)NULL; /* Non-zero means this terminal can't really do anything. */ int dumb_term = 0; /* On Solaris2, sys/types.h #includes sys/reg.h, which #defines PC. Unfortunately, PC is a global variable used by the termcap library. */ #undef PC #if !defined (__linux__) char PC; char *BC, *UP; #endif /* __linux__ */ /* Some strings to control terminal actions. These are output by tputs (). */ char *term_goto, *term_clreol, *term_cr, *term_clrpag, *term_backspace; int screenwidth, screenheight; /* Non-zero if we determine that the terminal can do character insertion. */ int terminal_can_insert = 0; /* How to insert characters. */ char *term_im, *term_ei, *term_ic, *term_ip, *term_IC; /* How to delete characters. */ char *term_dc, *term_DC; #if defined (HACK_TERMCAP_MOTION) char *term_forward_char; #endif /* HACK_TERMCAP_MOTION */ /* How to go up a line. */ char *term_up; /* A visible bell, if the terminal can be made to flash the screen. */ char *visible_bell; /* Non-zero means that this terminal has a meta key. */ int term_has_meta; /* The string to write to turn on the meta key, if this term has one. */ char *term_mm; /* The string to write to turn off the meta key, if this term has one. */ char *term_mo; /* The key sequences output by the arrow keys, if this terminal has any. */ char *term_ku, *term_kd, *term_kr, *term_kl; /* Re-initialize the terminal considering that the TERM/TERMCAP variable has changed. */ int rl_reset_terminal (terminal_name) char *terminal_name; { init_terminal_io (terminal_name); return 0; } /* Set readline's idea of the screen size. TTY is a file descriptor open to the terminal. If IGNORE_ENV is true, we do not pay attention to the values of $LINES and $COLUMNS. The tests for TERM_STRING_BUFFER being non-null serve to check whether or not we have initialized termcap. */ void _rl_set_screen_size (tty, ignore_env) int tty, ignore_env; { #if defined (TIOCGWINSZ) struct winsize window_size; #endif /* TIOCGWINSZ */ #if defined (TIOCGWINSZ) if (ioctl (tty, TIOCGWINSZ, &window_size) == 0) { screenwidth = (int) window_size.ws_col; screenheight = (int) window_size.ws_row; } #endif /* TIOCGWINSZ */ /* Environment variable COLUMNS overrides setting of "co" if IGNORE_ENV is unset. */ if (screenwidth <= 0) { char *sw; if (!ignore_env && (sw = getenv ("COLUMNS"))) screenwidth = atoi (sw); if (screenwidth <= 0 && term_string_buffer) screenwidth = tgetnum ("co"); } /* Environment variable LINES overrides setting of "li" if IGNORE_ENV is unset. */ if (screenheight <= 0) { char *sh; if (!ignore_env && (sh = getenv ("LINES"))) screenheight = atoi (sh); if (screenheight <= 0 && term_string_buffer) screenheight = tgetnum ("li"); } /* If all else fails, default to 80x24 terminal. */ if (screenwidth <= 0) screenwidth = 80; if (screenheight <= 0) screenheight = 24; #if defined (SHELL) /* If we're being compiled as part of bash, set the environment variables $LINES and $COLUMNS to new values. */ set_lines_and_columns (screenheight, screenwidth); #endif screenwidth--; } int init_terminal_io (terminal_name) char *terminal_name; { #if defined (_GO32_) screenwidth = ScreenCols (); screenheight = ScreenRows (); term_cr = "\r"; term_im = term_ei = term_ic = term_IC = (char *)NULL; term_up = term_dc = term_DC = visible_bell = (char *)NULL; /* Does the _GO32_ have a meta key? I don't know. */ term_has_meta = 0; term_mm = term_mo = (char *)NULL; /* It probably has arrow keys, but I don't know what they are. */ term_ku = term_kd = term_kr = term_kl = (char *)NULL; #if defined (HACK_TERMCAP_MOTION) term_forward_char = (char *)NULL; #endif /* HACK_TERMCAP_MOTION */ terminal_can_insert = 0; return 0; #else /* !_GO32_ */ char *term, *buffer; int tty; term = terminal_name ? terminal_name : getenv ("TERM"); if (!term_string_buffer) term_string_buffer = (char *)xmalloc (2048); if (!term_buffer) term_buffer = (char *)xmalloc (2048); buffer = term_string_buffer; term_clrpag = term_cr = term_clreol = (char *)NULL; if (!term) term = "dumb"; if (tgetent (term_buffer, term) <= 0) { dumb_term = 1; screenwidth = 79; screenheight = 24; term_cr = "\r"; term_im = term_ei = term_ic = term_IC = (char *)NULL; term_up = term_dc = term_DC = visible_bell = (char *)NULL; term_ku = term_kd = term_kl = term_kr = (char *)NULL; #if defined (HACK_TERMCAP_MOTION) term_forward_char = (char *)NULL; #endif terminal_can_insert = 0; return 0; } BC = tgetstr ("pc", &buffer); PC = buffer ? *buffer : 0; term_backspace = tgetstr ("le", &buffer); term_cr = tgetstr ("cr", &buffer); term_clreol = tgetstr ("ce", &buffer); term_clrpag = tgetstr ("cl", &buffer); if (!term_cr) term_cr = "\r"; #if defined (HACK_TERMCAP_MOTION) term_forward_char = tgetstr ("nd", &buffer); #endif /* HACK_TERMCAP_MOTION */ if (rl_instream) tty = fileno (rl_instream); else tty = 0; screenwidth = screenheight = 0; _rl_set_screen_size (tty, 0); term_im = tgetstr ("im", &buffer); term_ei = tgetstr ("ei", &buffer); term_IC = tgetstr ("IC", &buffer); term_ic = tgetstr ("ic", &buffer); /* "An application program can assume that the terminal can do character insertion if *any one of* the capabilities `IC', `im', `ic' or `ip' is provided." But we can't do anything if only `ip' is provided, so... */ terminal_can_insert = (term_IC || term_im || term_ic); term_up = tgetstr ("up", &buffer); term_dc = tgetstr ("dc", &buffer); term_DC = tgetstr ("DC", &buffer); visible_bell = tgetstr ("vb", &buffer); /* Check to see if this terminal has a meta key. */ term_has_meta = (tgetflag ("km") || tgetflag ("MT")); if (term_has_meta) { term_mm = tgetstr ("mm", &buffer); term_mo = tgetstr ("mo", &buffer); } else { term_mm = (char *)NULL; term_mo = (char *)NULL; } /* Attempt to find and bind the arrow keys. Do not override already bound keys in an overzealous attempt, however. */ term_ku = tgetstr ("ku", &buffer); term_kd = tgetstr ("kd", &buffer); term_kr = tgetstr ("kr", &buffer); term_kl = tgetstr ("kl", &buffer); if (term_ku) { Function *func; func = rl_function_of_keyseq (term_ku, _rl_keymap, (int *)NULL); if (!func || func == rl_do_lowercase_version) rl_set_key (term_ku, rl_get_previous_history, _rl_keymap); } if (term_kd) { Function *func; func = rl_function_of_keyseq (term_kd, _rl_keymap, (int *)NULL); if (!func || func == rl_do_lowercase_version) rl_set_key (term_kd, rl_get_next_history, _rl_keymap); } if (term_kr) { Function *func; func = rl_function_of_keyseq (term_kr, _rl_keymap, (int *)NULL); if (!func || func == rl_do_lowercase_version) rl_set_key (term_kr, rl_forward, _rl_keymap); } if (term_kl) { Function *func; func = rl_function_of_keyseq (term_kl, _rl_keymap, (int *)NULL); if (!func || func == rl_do_lowercase_version) rl_set_key (term_kl, rl_backward, _rl_keymap); } #endif /* !_GO32_ */ return 0; } /* A function for the use of tputs () */ void _rl_output_character_function (c) int c; { putc (c, out_stream); } /* Write COUNT characters from STRING to the output stream. */ void _rl_output_some_chars (string, count) char *string; int count; { fwrite (string, 1, count, out_stream); } /* Move the cursor back. */ int backspace (count) int count; { register int i; #if !defined (_GO32_) if (term_backspace) for (i = 0; i < count; i++) tputs (term_backspace, 1, _rl_output_character_function); else #endif /* !_GO32_ */ for (i = 0; i < count; i++) putc ('\b', out_stream); return 0; } /* Move to the start of the next line. */ int crlf () { #if defined (NEW_TTY_DRIVER) tputs (term_cr, 1, _rl_output_character_function); #endif /* NEW_TTY_DRIVER */ putc ('\n', out_stream); return 0; } /* **************************************************************** */ /* */ /* Utility Functions */ /* */ /* **************************************************************** */ /* Return 0 if C is not a member of the class of characters that belong in words, or 1 if it is. */ int allow_pathname_alphabetic_chars = 0; char *pathname_alphabetic_chars = "/-_=~.#$"; int alphabetic (c) int c; { if (pure_alphabetic (c) || (numeric (c))) return (1); if (allow_pathname_alphabetic_chars) return (strchr (pathname_alphabetic_chars, c) != NULL); else return (0); } /* Return non-zero if C is a numeric character. */ int numeric (c) int c; { return (c >= '0' && c <= '9'); } /* Ring the terminal bell. */ int ding () { if (readline_echoing_p) { #if !defined (_GO32_) if (_rl_prefer_visible_bell && visible_bell) tputs (visible_bell, 1, _rl_output_character_function); else #endif /* !_GO32_ */ { fprintf (stderr, "\007"); fflush (stderr); } } return (-1); } /* How to abort things. */ int rl_abort () { ding (); rl_clear_message (); rl_init_argument (); rl_pending_input = 0; defining_kbd_macro = 0; while (executing_macro) pop_executing_macro (); rl_last_func = (Function *)NULL; longjmp (readline_top_level, 1); return 0; } /* Return a copy of the string between FROM and TO. FROM is inclusive, TO is not. */ char * rl_copy_text (from, to) int from, to; { register int length; char *copy; /* Fix it if the caller is confused. */ if (from > to) { int t = from; from = to; to = t; } length = to - from; copy = (char *)xmalloc (1 + length); strncpy (copy, the_line + from, length); copy[length] = '\0'; return (copy); } /* Increase the size of RL_LINE_BUFFER until it has enough space to hold LEN characters. */ void rl_extend_line_buffer (len) int len; { while (len >= rl_line_buffer_len) rl_line_buffer = (char *)xrealloc (rl_line_buffer, rl_line_buffer_len += DEFAULT_BUFFER_SIZE); the_line = rl_line_buffer; } /* **************************************************************** */ /* */ /* Insert and Delete */ /* */ /* **************************************************************** */ /* Insert a string of text into the line at point. This is the only way that you should do insertion. rl_insert () calls this function. */ int rl_insert_text (string) char *string; { register int i, l = strlen (string); if (rl_end + l >= rl_line_buffer_len) rl_extend_line_buffer (rl_end + l); for (i = rl_end; i >= rl_point; i--) the_line[i + l] = the_line[i]; strncpy (the_line + rl_point, string, l); /* Remember how to undo this if we aren't undoing something. */ if (!doing_an_undo) { /* If possible and desirable, concatenate the undos. */ if ((strlen (string) == 1) && rl_undo_list && (rl_undo_list->what == UNDO_INSERT) && (rl_undo_list->end == rl_point) && (rl_undo_list->end - rl_undo_list->start < 20)) rl_undo_list->end++; else rl_add_undo (UNDO_INSERT, rl_point, rl_point + l, (char *)NULL); } rl_point += l; rl_end += l; the_line[rl_end] = '\0'; return 0; } /* Delete the string between FROM and TO. FROM is inclusive, TO is not. */ int rl_delete_text (from, to) int from, to; { register char *text; /* Fix it if the caller is confused. */ if (from > to) { int t = from; from = to; to = t; } text = rl_copy_text (from, to); strncpy (the_line + from, the_line + to, rl_end - to); /* Remember how to undo this delete. */ if (!doing_an_undo) rl_add_undo (UNDO_DELETE, from, to, text); else free (text); rl_end -= (to - from); the_line[rl_end] = '\0'; return 0; } /* **************************************************************** */ /* */ /* Readline character functions */ /* */ /* **************************************************************** */ /* This is not a gap editor, just a stupid line input routine. No hair is involved in writing any of the functions, and none should be. */ /* Note that: rl_end is the place in the string that we would place '\0'; i.e., it is always safe to place '\0' there. rl_point is the place in the string where the cursor is. Sometimes this is the same as rl_end. Any command that is called interactively receives two arguments. The first is a count: the numeric arg pased to this command. The second is the key which invoked this command. */ /* **************************************************************** */ /* */ /* Movement Commands */ /* */ /* **************************************************************** */ /* Note that if you `optimize' the display for these functions, you cannot use said functions in other functions which do not do optimizing display. I.e., you will have to update the data base for rl_redisplay, and you might as well let rl_redisplay do that job. */ /* Move forward COUNT characters. */ int rl_forward (count) int count; { if (count < 0) rl_backward (-count); else while (count) { #if defined (VI_MODE) if (rl_point >= (rl_end - (rl_editing_mode == vi_mode))) #else if (rl_point == rl_end) #endif /* VI_MODE */ { ding (); return 0; } else rl_point++; --count; } return 0; } /* Move backward COUNT characters. */ int rl_backward (count) int count; { if (count < 0) rl_forward (-count); else while (count) { if (!rl_point) { ding (); return 0; } else --rl_point; --count; } return 0; } /* Move to the beginning of the line. */ int rl_beg_of_line () { rl_point = 0; return 0; } /* Move to the end of the line. */ int rl_end_of_line () { rl_point = rl_end; return 0; } /* Move forward a word. We do what Emacs does. */ int rl_forward_word (count) int count; { int c; if (count < 0) { rl_backward_word (-count); return 0; } while (count) { if (rl_point == rl_end) return 0; /* If we are not in a word, move forward until we are in one. Then, move forward until we hit a non-alphabetic character. */ c = the_line[rl_point]; if (!alphabetic (c)) { while (++rl_point < rl_end) { c = the_line[rl_point]; if (alphabetic (c)) break; } } if (rl_point == rl_end) return 0; while (++rl_point < rl_end) { c = the_line[rl_point]; if (!alphabetic (c)) break; } --count; } return 0; } /* Move backward a word. We do what Emacs does. */ int rl_backward_word (count) int count; { int c; if (count < 0) { rl_forward_word (-count); return 0; } while (count) { if (!rl_point) return 0; /* Like rl_forward_word (), except that we look at the characters just before point. */ c = the_line[rl_point - 1]; if (!alphabetic (c)) { while (--rl_point) { c = the_line[rl_point - 1]; if (alphabetic (c)) break; } } while (rl_point) { c = the_line[rl_point - 1]; if (!alphabetic (c)) break; else --rl_point; } --count; } return 0; } /* Clear the current line. Numeric argument to C-l does this. */ int rl_refresh_line () { int curr_line = _rl_last_c_pos / screenwidth; _rl_move_vert (curr_line); _rl_move_cursor_relative (0, the_line); /* XXX is this right */ #if defined (_GO32_) { int row, col, width, row_start; ScreenGetCursor (&row, &col); width = ScreenCols (); row_start = ScreenPrimary + (row * width); memset (row_start + col, 0, (width - col) * 2); } #else /* !_GO32_ */ if (term_clreol) tputs (term_clreol, 1, _rl_output_character_function); #endif /* !_GO32_ */ rl_forced_update_display (); rl_display_fixed = 1; return 0; } /* C-l typed to a line without quoting clears the screen, and then reprints the prompt and the current input line. Given a numeric arg, redraw only the current line. */ int rl_clear_screen () { if (rl_explicit_arg) { rl_refresh_line (); return 0; } #if !defined (_GO32_) if (term_clrpag) tputs (term_clrpag, 1, _rl_output_character_function); else #endif /* !_GO32_ */ crlf (); rl_forced_update_display (); rl_display_fixed = 1; return 0; } int rl_arrow_keys (count, c) int count, c; { int ch; ch = rl_read_key (); switch (to_upper (ch)) { case 'A': rl_get_previous_history (count); break; case 'B': rl_get_next_history (count); break; case 'C': rl_forward (count); break; case 'D': rl_backward (count); break; default: ding (); } return 0; } /* **************************************************************** */ /* */ /* Text commands */ /* */ /* **************************************************************** */ /* Insert the character C at the current location, moving point forward. */ int rl_insert (count, c) int count, c; { register int i; char *string; if (count <= 0) return 0; /* If we can optimize, then do it. But don't let people crash readline because of extra large arguments. */ if (count > 1 && count < 1024) { string = (char *)alloca (1 + count); for (i = 0; i < count; i++) string[i] = c; string[i] = '\0'; rl_insert_text (string); return 0; } if (count > 1024) { int decreaser; string = (char *)alloca (1024 + 1); for (i = 0; i < 1024; i++) string[i] = c; while (count) { decreaser = (count > 1024 ? 1024 : count); string[decreaser] = '\0'; rl_insert_text (string); count -= decreaser; } return 0; } /* We are inserting a single character. If there is pending input, then make a string of all of the pending characters that are bound to rl_insert, and insert them all. */ if (any_typein) { int key = 0, t; i = 0; string = (char *)alloca (ibuffer_len + 1); string[i++] = c; while ((t = rl_get_char (&key)) && (_rl_keymap[key].type == ISFUNC && _rl_keymap[key].function == rl_insert)) string[i++] = key; if (t) rl_unget_char (key); string[i] = '\0'; rl_insert_text (string); } else { /* Inserting a single character. */ string = (char *)alloca (2); string[1] = '\0'; string[0] = c; rl_insert_text (string); } return 0; } /* Insert the next typed character verbatim. */ int rl_quoted_insert (count) int count; { int c; c = rl_read_key (); return (rl_insert (count, c)); } /* Insert a tab character. */ int rl_tab_insert (count) int count; { return (rl_insert (count, '\t')); } /* What to do when a NEWLINE is pressed. We accept the whole line. KEY is the key that invoked this command. I guess it could have meaning in the future. */ int rl_newline (count, key) int count, key; { rl_done = 1; #if defined (VI_MODE) { extern int _rl_vi_doing_insert; if (_rl_vi_doing_insert) { rl_end_undo_group (); _rl_vi_doing_insert = 0; } } rl_vi_set_last (); #endif /* VI_MODE */ if (readline_echoing_p) { _rl_move_vert (_rl_vis_botlin); _rl_vis_botlin = 0; crlf (); fflush (out_stream); rl_display_fixed++; } return 0; } int rl_clean_up_for_exit () { if (readline_echoing_p) { _rl_move_vert (_rl_vis_botlin); _rl_vis_botlin = 0; fflush (out_stream); rl_restart_output (); } return 0; } /* What to do for some uppercase characters, like meta characters, and some characters appearing in emacs_ctlx_keymap. This function is just a stub, you bind keys to it and the code in rl_dispatch () is special cased. */ int rl_do_lowercase_version (ignore1, ignore2) int ignore1, ignore2; { return 0; } /* Rubout the character behind point. */ int rl_rubout (count) int count; { if (count < 0) { rl_delete (-count); return 0; } if (!rl_point) { ding (); return -1; } if (count > 1 || rl_explicit_arg) { int orig_point = rl_point; rl_backward (count); rl_kill_text (orig_point, rl_point); } else { int c = the_line[--rl_point]; rl_delete_text (rl_point, rl_point + 1); if (rl_point == rl_end && isprint (c) && _rl_last_c_pos) { int l; l = rl_character_len (c, rl_point); _rl_erase_at_end_of_line (l); } } return 0; } /* Delete the character under the cursor. Given a numeric argument, kill that many characters instead. */ int rl_delete (count, invoking_key) int count, invoking_key; { if (count < 0) { return (rl_rubout (-count)); } if (rl_point == rl_end) { ding (); return -1; } if (count > 1 || rl_explicit_arg) { int orig_point = rl_point; rl_forward (count); rl_kill_text (orig_point, rl_point); rl_point = orig_point; return 0; } else return (rl_delete_text (rl_point, rl_point + 1)); } /* Delete all spaces and tabs around point. */ int rl_delete_horizontal_space (count, ignore) int count, ignore; { int start = rl_point; while (rl_point && whitespace (the_line[rl_point - 1])) rl_point--; start = rl_point; while (rl_point < rl_end && whitespace (the_line[rl_point])) rl_point++; if (start != rl_point) { rl_delete_text (start, rl_point); rl_point = start; } return 0; } /* **************************************************************** */ /* */ /* Kill commands */ /* */ /* **************************************************************** */ /* The next two functions mimic unix line editing behaviour, except they save the deleted text on the kill ring. This is safer than not saving it, and since we have a ring, nobody should get screwed. */ /* This does what C-w does in Unix. We can't prevent people from using behaviour that they expect. */ int rl_unix_word_rubout () { if (!rl_point) ding (); else { int orig_point = rl_point; while (rl_point && whitespace (the_line[rl_point - 1])) rl_point--; while (rl_point && !whitespace (the_line[rl_point - 1])) rl_point--; rl_kill_text (rl_point, orig_point); } return 0; } /* Here is C-u doing what Unix does. You don't *have* to use these key-bindings. We have a choice of killing the entire line, or killing from where we are to the start of the line. We choose the latter, because if you are a Unix weenie, then you haven't backspaced into the line at all, and if you aren't, then you know what you are doing. */ int rl_unix_line_discard () { if (!rl_point) ding (); else { rl_kill_text (rl_point, 0); rl_point = 0; } return 0; } /* **************************************************************** */ /* */ /* Commands For Typos */ /* */ /* **************************************************************** */ /* Random and interesting things in here. */ /* **************************************************************** */ /* */ /* Changing Case */ /* */ /* **************************************************************** */ /* The three kinds of things that we know how to do. */ #define UpCase 1 #define DownCase 2 #define CapCase 3 static int rl_change_case (); /* Uppercase the word at point. */ int rl_upcase_word (count) int count; { return (rl_change_case (count, UpCase)); } /* Lowercase the word at point. */ int rl_downcase_word (count) int count; { return (rl_change_case (count, DownCase)); } /* Upcase the first letter, downcase the rest. */ int rl_capitalize_word (count) int count; { return (rl_change_case (count, CapCase)); } /* The meaty function. Change the case of COUNT words, performing OP on them. OP is one of UpCase, DownCase, or CapCase. If a negative argument is given, leave point where it started, otherwise, leave it where it moves to. */ static int rl_change_case (count, op) int count, op; { register int start = rl_point, end; int state = 0; rl_forward_word (count); end = rl_point; if (count < 0) { int temp = start; start = end; end = temp; } /* We are going to modify some text, so let's prepare to undo it. */ rl_modifying (start, end); for (; start < end; start++) { switch (op) { case UpCase: the_line[start] = to_upper (the_line[start]); break; case DownCase: the_line[start] = to_lower (the_line[start]); break; case CapCase: if (state == 0) { the_line[start] = to_upper (the_line[start]); state = 1; } else { the_line[start] = to_lower (the_line[start]); } if (!pure_alphabetic (the_line[start])) state = 0; break; default: abort (); return -1; } } rl_point = end; return 0; } /* **************************************************************** */ /* */ /* Transposition */ /* */ /* **************************************************************** */ /* Transpose the words at point. */ int rl_transpose_words (count) int count; { char *word1, *word2; int w1_beg, w1_end, w2_beg, w2_end; int orig_point = rl_point; if (!count) return 0; /* Find the two words. */ rl_forward_word (count); w2_end = rl_point; rl_backward_word (1); w2_beg = rl_point; rl_backward_word (count); w1_beg = rl_point; rl_forward_word (1); w1_end = rl_point; /* Do some check to make sure that there really are two words. */ if ((w1_beg == w2_beg) || (w2_beg < w1_end)) { ding (); rl_point = orig_point; return -1; } /* Get the text of the words. */ word1 = rl_copy_text (w1_beg, w1_end); word2 = rl_copy_text (w2_beg, w2_end); /* We are about to do many insertions and deletions. Remember them as one operation. */ rl_begin_undo_group (); /* Do the stuff at word2 first, so that we don't have to worry about word1 moving. */ rl_point = w2_beg; rl_delete_text (w2_beg, w2_end); rl_insert_text (word1); rl_point = w1_beg; rl_delete_text (w1_beg, w1_end); rl_insert_text (word2); /* This is exactly correct since the text before this point has not changed in length. */ rl_point = w2_end; /* I think that does it. */ rl_end_undo_group (); free (word1); free (word2); return 0; } /* Transpose the characters at point. If point is at the end of the line, then transpose the characters before point. */ int rl_transpose_chars (count) int count; { char dummy[2]; if (!count) return 0; if (!rl_point || rl_end < 2) { ding (); return -1; } rl_begin_undo_group (); if (rl_point == rl_end) { --rl_point; count = 1; } rl_point--; dummy[0] = the_line[rl_point]; dummy[1] = '\0'; rl_delete_text (rl_point, rl_point + 1); rl_point += count; if (rl_point > rl_end) rl_point = rl_end; else if (rl_point < 0) rl_point = 0; rl_insert_text (dummy); rl_end_undo_group (); return 0; } /* **************************************************************** */ /* */ /* Undo, and Undoing */ /* */ /* **************************************************************** */ /* The current undo list for THE_LINE. */ UNDO_LIST *rl_undo_list = (UNDO_LIST *)NULL; /* Remember how to undo something. Concatenate some undos if that seems right. */ void rl_add_undo (what, start, end, text) enum undo_code what; int start, end; char *text; { UNDO_LIST *temp = (UNDO_LIST *)xmalloc (sizeof (UNDO_LIST)); temp->what = what; temp->start = start; temp->end = end; temp->text = text; temp->next = rl_undo_list; rl_undo_list = temp; } /* Free the existing undo list. */ void free_undo_list () { while (rl_undo_list) { UNDO_LIST *release = rl_undo_list; rl_undo_list = rl_undo_list->next; if (release->what == UNDO_DELETE) free (release->text); free (release); } rl_undo_list = (UNDO_LIST *)NULL; } /* Undo the next thing in the list. Return 0 if there is nothing to undo, or non-zero if there was. */ int rl_do_undo () { UNDO_LIST *release; int waiting_for_begin = 0; undo_thing: if (!rl_undo_list) return (0); doing_an_undo = 1; switch (rl_undo_list->what) { /* Undoing deletes means inserting some text. */ case UNDO_DELETE: rl_point = rl_undo_list->start; rl_insert_text (rl_undo_list->text); free (rl_undo_list->text); break; /* Undoing inserts means deleting some text. */ case UNDO_INSERT: rl_delete_text (rl_undo_list->start, rl_undo_list->end); rl_point = rl_undo_list->start; break; /* Undoing an END means undoing everything 'til we get to a BEGIN. */ case UNDO_END: waiting_for_begin++; break; /* Undoing a BEGIN means that we are done with this group. */ case UNDO_BEGIN: if (waiting_for_begin) waiting_for_begin--; else #if 0 abort (); #else ding (); #endif break; } doing_an_undo = 0; release = rl_undo_list; rl_undo_list = rl_undo_list->next; free (release); if (waiting_for_begin) goto undo_thing; return (1); } /* Begin a group. Subsequent undos are undone as an atomic operation. */ int rl_begin_undo_group () { rl_add_undo (UNDO_BEGIN, 0, 0, 0); return 0; } /* End an undo group started with rl_begin_undo_group (). */ int rl_end_undo_group () { rl_add_undo (UNDO_END, 0, 0, 0); return 0; } /* Save an undo entry for the text from START to END. */ int rl_modifying (start, end) int start, end; { if (start > end) { int t = start; start = end; end = t; } if (start != end) { char *temp = rl_copy_text (start, end); rl_begin_undo_group (); rl_add_undo (UNDO_DELETE, start, end, temp); rl_add_undo (UNDO_INSERT, start, end, (char *)NULL); rl_end_undo_group (); } return 0; } /* Revert the current line to its previous state. */ int rl_revert_line () { if (!rl_undo_list) ding (); else { while (rl_undo_list) rl_do_undo (); } return 0; } /* Do some undoing of things that were done. */ int rl_undo_command (count) int count; { if (count < 0) return 0; /* Nothing to do. */ while (count) { if (rl_do_undo ()) count--; else { ding (); break; } } return 0; } /* **************************************************************** */ /* */ /* History Utilities */ /* */ /* **************************************************************** */ /* We already have a history library, and that is what we use to control the history features of readline. However, this is our local interface to the history mechanism. */ /* While we are editing the history, this is the saved version of the original line. */ HIST_ENTRY *saved_line_for_history = (HIST_ENTRY *)NULL; /* Set the history pointer back to the last entry in the history. */ int start_using_history () { using_history (); if (saved_line_for_history) free_history_entry (saved_line_for_history); saved_line_for_history = (HIST_ENTRY *)NULL; return 0; } /* Free the contents (and containing structure) of a HIST_ENTRY. */ void free_history_entry (entry) HIST_ENTRY *entry; { if (!entry) return; if (entry->line) free (entry->line); free (entry); } /* Perhaps put back the current line if it has changed. */ int maybe_replace_line () { HIST_ENTRY *temp = current_history (); /* If the current line has changed, save the changes. */ if (temp && ((UNDO_LIST *)(temp->data) != rl_undo_list)) { temp = replace_history_entry (where_history (), the_line, rl_undo_list); free (temp->line); free (temp); } return 0; } /* Put back the saved_line_for_history if there is one. */ int maybe_unsave_line () { if (saved_line_for_history) { int line_len; line_len = strlen (saved_line_for_history->line); if (line_len >= rl_line_buffer_len) rl_extend_line_buffer (line_len); strcpy (the_line, saved_line_for_history->line); rl_undo_list = (UNDO_LIST *)saved_line_for_history->data; free_history_entry (saved_line_for_history); saved_line_for_history = (HIST_ENTRY *)NULL; rl_end = rl_point = strlen (the_line); } else ding (); return 0; } /* Save the current line in saved_line_for_history. */ int maybe_save_line () { if (!saved_line_for_history) { saved_line_for_history = (HIST_ENTRY *)xmalloc (sizeof (HIST_ENTRY)); saved_line_for_history->line = savestring (the_line); saved_line_for_history->data = (char *)rl_undo_list; } return 0; } /* **************************************************************** */ /* */ /* History Commands */ /* */ /* **************************************************************** */ /* Meta-< goes to the start of the history. */ int rl_beginning_of_history () { return (rl_get_previous_history (1 + where_history ())); } /* Meta-> goes to the end of the history. (The current line). */ int rl_end_of_history () { maybe_replace_line (); using_history (); maybe_unsave_line (); return 0; } /* Move down to the next history line. */ int rl_get_next_history (count) int count; { HIST_ENTRY *temp = (HIST_ENTRY *)NULL; if (count < 0) return (rl_get_previous_history (-count)); if (!count) return 0; maybe_replace_line (); while (count) { temp = next_history (); if (!temp) break; --count; } if (!temp) maybe_unsave_line (); else { int line_len; line_len = strlen (temp->line); if (line_len >= rl_line_buffer_len) rl_extend_line_buffer (line_len); strcpy (the_line, temp->line); rl_undo_list = (UNDO_LIST *)temp->data; rl_end = rl_point = strlen (the_line); #if defined (VI_MODE) if (rl_editing_mode == vi_mode) rl_point = 0; #endif /* VI_MODE */ } return 0; } /* Get the previous item out of our interactive history, making it the current line. If there is no previous history, just ding. */ int rl_get_previous_history (count) int count; { HIST_ENTRY *old_temp = (HIST_ENTRY *)NULL; HIST_ENTRY *temp = (HIST_ENTRY *)NULL; if (count < 0) return (rl_get_next_history (-count)); if (!count) return 0; /* If we don't have a line saved, then save this one. */ maybe_save_line (); /* If the current line has changed, save the changes. */ maybe_replace_line (); while (count) { temp = previous_history (); if (!temp) break; else old_temp = temp; --count; } /* If there was a large argument, and we moved back to the start of the history, that is not an error. So use the last value found. */ if (!temp && old_temp) temp = old_temp; if (!temp) ding (); else { int line_len; line_len = strlen (temp->line); if (line_len >= rl_line_buffer_len) rl_extend_line_buffer (line_len); strcpy (the_line, temp->line); rl_undo_list = (UNDO_LIST *)temp->data; rl_end = rl_point = line_len; #if defined (VI_MODE) if (rl_editing_mode == vi_mode) rl_point = 0; #endif /* VI_MODE */ } return 0; } /* Make C be the next command to be executed. */ int rl_execute_next (c) int c; { rl_pending_input = c; return 0; } /* **************************************************************** */ /* */ /* The Mark and the Region. */ /* */ /* **************************************************************** */ /* Set the mark at POSITION. */ int rl_set_mark (position) int position; { if (position > rl_end) return -1; rl_mark = position; return 0; } /* Exchange the position of mark and point. */ int rl_exchange_mark_and_point () { if (rl_mark > rl_end) rl_mark = -1; if (rl_mark == -1) { ding (); return -1; } else { int temp = rl_point; rl_point = rl_mark; rl_mark = temp; } return 0; } /* **************************************************************** */ /* */ /* Killing Mechanism */ /* */ /* **************************************************************** */ /* What we assume for a max number of kills. */ #define DEFAULT_MAX_KILLS 10 /* The real variable to look at to find out when to flush kills. */ int rl_max_kills = DEFAULT_MAX_KILLS; /* Where to store killed text. */ char **rl_kill_ring = (char **)NULL; /* Where we are in the kill ring. */ int rl_kill_index = 0; /* How many slots we have in the kill ring. */ int rl_kill_ring_length = 0; /* How to say that you only want to save a certain amount of kill material. */ int rl_set_retained_kills (num) int num; { return 0; } /* The way to kill something. This appends or prepends to the last kill, if the last command was a kill command. if FROM is less than TO, then the text is appended, otherwise prepended. If the last command was not a kill command, then a new slot is made for this kill. */ int rl_kill_text (from, to) int from, to; { int slot; char *text = rl_copy_text (from, to); /* Is there anything to kill? */ if (from == to) { free (text); last_command_was_kill++; return 0; } /* Delete the copied text from the line. */ rl_delete_text (from, to); /* First, find the slot to work with. */ if (!last_command_was_kill) { /* Get a new slot. */ if (!rl_kill_ring) { /* If we don't have any defined, then make one. */ rl_kill_ring = (char **) xmalloc (((rl_kill_ring_length = 1) + 1) * sizeof (char *)); slot = 1; } else { /* We have to add a new slot on the end, unless we have exceeded the max limit for remembering kills. */ slot = rl_kill_ring_length; if (slot == rl_max_kills) { register int i; free (rl_kill_ring[0]); for (i = 0; i < slot; i++) rl_kill_ring[i] = rl_kill_ring[i + 1]; } else { rl_kill_ring = (char **) xrealloc (rl_kill_ring, ((slot = (rl_kill_ring_length += 1)) + 1) * sizeof (char *)); } } slot--; } else { slot = rl_kill_ring_length - 1; } /* If the last command was a kill, prepend or append. */ if (last_command_was_kill && rl_editing_mode != vi_mode) { char *old = rl_kill_ring[slot]; char *new = (char *)xmalloc (1 + strlen (old) + strlen (text)); if (from < to) { strcpy (new, old); strcat (new, text); } else { strcpy (new, text); strcat (new, old); } free (old); free (text); rl_kill_ring[slot] = new; } else { rl_kill_ring[slot] = text; } rl_kill_index = slot; last_command_was_kill++; return 0; } /* Now REMEMBER! In order to do prepending or appending correctly, kill commands always make rl_point's original position be the FROM argument, and rl_point's extent be the TO argument. */ /* **************************************************************** */ /* */ /* Killing Commands */ /* */ /* **************************************************************** */ /* Delete the word at point, saving the text in the kill ring. */ int rl_kill_word (count) int count; { int orig_point = rl_point; if (count < 0) return (rl_backward_kill_word (-count)); else { rl_forward_word (count); if (rl_point != orig_point) rl_kill_text (orig_point, rl_point); rl_point = orig_point; } return 0; } /* Rubout the word before point, placing it on the kill ring. */ int rl_backward_kill_word (count) int count; { int orig_point = rl_point; if (count < 0) return (rl_kill_word (-count)); else { rl_backward_word (count); if (rl_point != orig_point) rl_kill_text (orig_point, rl_point); } return 0; } /* Kill from here to the end of the line. If DIRECTION is negative, kill back to the line start instead. */ int rl_kill_line (direction) int direction; { int orig_point = rl_point; if (direction < 0) return (rl_backward_kill_line (1)); else { rl_end_of_line (); if (orig_point != rl_point) rl_kill_text (orig_point, rl_point); rl_point = orig_point; } return 0; } /* Kill backwards to the start of the line. If DIRECTION is negative, kill forwards to the line end instead. */ int rl_backward_kill_line (direction) int direction; { int orig_point = rl_point; if (direction < 0) return (rl_kill_line (1)); else { if (!rl_point) ding (); else { rl_beg_of_line (); rl_kill_text (orig_point, rl_point); } } return 0; } /* Yank back the last killed text. This ignores arguments. */ int rl_yank () { if (!rl_kill_ring) { rl_abort (); return -1; } rl_set_mark (rl_point); rl_insert_text (rl_kill_ring[rl_kill_index]); return 0; } /* If the last command was yank, or yank_pop, and the text just before point is identical to the current kill item, then delete that text from the line, rotate the index down, and yank back some other text. */ int rl_yank_pop () { int l; if (((rl_last_func != rl_yank_pop) && (rl_last_func != rl_yank)) || !rl_kill_ring) { rl_abort (); return -1; } l = strlen (rl_kill_ring[rl_kill_index]); if (((rl_point - l) >= 0) && (strncmp (the_line + (rl_point - l), rl_kill_ring[rl_kill_index], l) == 0)) { rl_delete_text ((rl_point - l), rl_point); rl_point -= l; rl_kill_index--; if (rl_kill_index < 0) rl_kill_index = rl_kill_ring_length - 1; rl_yank (); return 0; } else { rl_abort (); return -1; } } /* Yank the COUNTth argument from the previous history line. */ int rl_yank_nth_arg (count, ignore) int count, ignore; { register HIST_ENTRY *entry = previous_history (); char *arg; if (entry) next_history (); else { ding (); return -1; } arg = history_arg_extract (count, count, entry->line); if (!arg || !*arg) { ding (); return -1; } rl_begin_undo_group (); #if defined (VI_MODE) /* Vi mode always inserts a space before yanking the argument, and it inserts it right *after* rl_point. */ if (rl_editing_mode == vi_mode) rl_point++; #endif /* VI_MODE */ #if 0 if (rl_point && the_line[rl_point - 1] != ' ') rl_insert_text (" "); #endif rl_insert_text (arg); free (arg); rl_end_undo_group (); return 0; } /* How to toggle back and forth between editing modes. */ int rl_vi_editing_mode () { #if defined (VI_MODE) rl_editing_mode = vi_mode; rl_vi_insertion_mode (); return 0; #endif /* VI_MODE */ } int rl_emacs_editing_mode () { rl_editing_mode = emacs_mode; _rl_keymap = emacs_standard_keymap; return 0; } /* **************************************************************** */ /* */ /* USG (System V) Support */ /* */ /* **************************************************************** */ int rl_getc (stream) FILE *stream; { int result; unsigned char c; #if defined (_GO32_) if (isatty (0)) return (getkey ()); #endif /* _GO32_ */ while (1) { result = read (fileno (stream), &c, sizeof (unsigned char)); if (result == sizeof (unsigned char)) return (c); /* If zero characters are returned, then the file that we are reading from is empty! Return EOF in that case. */ if (result == 0) return (EOF); #if defined (EWOULDBLOCK) if (errno == EWOULDBLOCK) { int flags; if ((flags = fcntl (fileno (stream), F_GETFL, 0)) < 0) return (EOF); if (flags & O_NDELAY) { flags &= ~O_NDELAY; fcntl (fileno (stream), F_SETFL, flags); continue; } continue; } #endif /* EWOULDBLOCK */ #if defined (_POSIX_VERSION) && defined (EAGAIN) && defined (O_NONBLOCK) if (errno == EAGAIN) { int flags; if ((flags = fcntl (fileno (stream), F_GETFL, 0)) < 0) return (EOF); if (flags & O_NONBLOCK) { flags &= ~O_NONBLOCK; fcntl (fileno (stream), F_SETFL, flags); continue; } } #endif /* _POSIX_VERSION && EAGAIN && O_NONBLOCK */ #if !defined (_GO32_) /* If the error that we received was SIGINT, then try again, this is simply an interrupted system call to read (). Otherwise, some error ocurred, also signifying EOF. */ if (errno != EINTR) return (EOF); #endif /* !_GO32_ */ } } #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ /* **************************************************************** */ /* */ /* Testing Readline */ /* */ /* **************************************************************** */ #if defined (TEST) main () { HIST_ENTRY **history_list (); char *temp = (char *)NULL; char *prompt = "readline% "; int done = 0; while (!done) { temp = readline (prompt); /* Test for EOF. */ if (!temp) exit (1); /* If there is anything on the line, print it and remember it. */ if (*temp) { fprintf (stderr, "%s\r\n", temp); add_history (temp); } /* Check for `command' that we handle. */ if (strcmp (temp, "quit") == 0) done = 1; if (strcmp (temp, "list") == 0) { HIST_ENTRY **list = history_list (); register int i; if (list) { for (i = 0; list[i]; i++) { fprintf (stderr, "%d: %s\r\n", i, list[i]->line); free (list[i]->line); } free (list); } } free (temp); } } #endif /* TEST */ /* * Local variables: * compile-command: "gcc -g -traditional -I. -I.. -DTEST -o readline readline.c keymaps.o funmap.o history.o -ltermcap" * end: */ octave-1.1.0/readline/rltty.c100666 415 17 36551 5521547744 14313 0ustar jweusers/* rltty.c -- functions to prepare and restore the terminal for readline's use. */ /* Copyright (C) 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #include #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #include "rldefs.h" #include "readline.h" #if !defined (errno) extern int errno; #endif /* !errno */ extern int readline_echoing_p; extern int _rl_eof_char; #if defined (_GO32_) # include # undef HANDLE_SIGNALS #endif /* _GO32_ */ /* **************************************************************** */ /* */ /* Signal Management */ /* */ /* **************************************************************** */ #if defined (HAVE_POSIX_SIGNALS) static sigset_t sigint_set, sigint_oset; #else /* !HAVE_POSIX_SIGNALS */ # if defined (HAVE_BSD_SIGNALS) static int sigint_oldmask; # endif /* HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ static int sigint_blocked = 0; /* Cause SIGINT to not be delivered until the corresponding call to release_sigint(). */ static void block_sigint () { if (sigint_blocked) return; #if defined (HAVE_POSIX_SIGNALS) sigemptyset (&sigint_set); sigemptyset (&sigint_oset); sigaddset (&sigint_set, SIGINT); sigprocmask (SIG_BLOCK, &sigint_set, &sigint_oset); #else /* !HAVE_POSIX_SIGNALS */ # if defined (HAVE_BSD_SIGNALS) sigint_oldmask = sigblock (sigmask (SIGINT)); # else /* !HAVE_BSD_SIGNALS */ # if defined (HAVE_USG_SIGHOLD) sighold (SIGINT); # endif /* HAVE_USG_SIGHOLD */ # endif /* !HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ sigint_blocked = 1; } /* Allow SIGINT to be delivered. */ static void release_sigint () { if (!sigint_blocked) return; #if defined (HAVE_POSIX_SIGNALS) sigprocmask (SIG_SETMASK, &sigint_oset, (sigset_t *)NULL); #else # if defined (HAVE_BSD_SIGNALS) sigsetmask (sigint_oldmask); # else /* !HAVE_BSD_SIGNALS */ # if defined (HAVE_USG_SIGHOLD) sigrelse (SIGINT); # endif /* HAVE_USG_SIGHOLD */ # endif /* !HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ sigint_blocked = 0; } /* **************************************************************** */ /* */ /* Controlling the Meta Key */ /* */ /* **************************************************************** */ extern int term_has_meta; extern char *term_mm; extern char *term_mo; static void outchar (c) int c; { putc (c, rl_outstream); } /* Turn on/off the meta key depending on ON. */ static void control_meta_key (on) int on; { if (term_has_meta) { if (on && term_mm) tputs (term_mm, 1, outchar); else if (!on && term_mo) tputs (term_mo, 1, outchar); } } /* **************************************************************** */ /* */ /* Saving and Restoring the TTY */ /* */ /* **************************************************************** */ /* Non-zero means that the terminal is in a prepped state. */ static int terminal_prepped = 0; /* If non-zero, means that this process has called tcflow(fd, TCOOFF) and output is suspended. */ #if defined (__ksr1__) static int ksrflow = 0; #endif #if defined (NEW_TTY_DRIVER) /* Values for the `flags' field of a struct bsdtty. This tells which elements of the struct bsdtty have been fetched from the system and are valid. */ #define SGTTY_SET 0x01 #define LFLAG_SET 0x02 #define TCHARS_SET 0x04 #define LTCHARS_SET 0x08 struct bsdtty { struct sgttyb sgttyb; /* Basic BSD tty driver information. */ int lflag; /* Local mode flags, like LPASS8. */ #if defined (TIOCGETC) struct tchars tchars; /* Terminal special characters, including ^S and ^Q. */ #endif #if defined (TIOCGLTC) struct ltchars ltchars; /* 4.2 BSD editing characters */ #endif int flags; /* Bitmap saying which parts of the struct are valid. */ }; #define TIOTYPE struct bsdtty static TIOTYPE otio; static int get_tty_settings (tty, tiop) int tty; TIOTYPE *tiop; { tiop->flags = tiop->lflag = 0; ioctl (tty, TIOCGETP, &(tiop->sgttyb)); tiop->flags |= SGTTY_SET; #if defined (TIOCLGET) ioctl (tty, TIOCLGET, &(tiop->lflag)); tiop->flags |= LFLAG_SET; #endif #if defined (TIOCGETC) ioctl (tty, TIOCGETC, &(tiop->tchars)); tiop->flags |= TCHARS_SET; #endif #if defined (TIOCGLTC) ioctl (tty, TIOCGLTC, &(tiop->ltchars)); tiop->flags |= LTCHARS_SET; #endif return 0; } set_tty_settings (tty, tiop) int tty; TIOTYPE *tiop; { if (tiop->flags & SGTTY_SET) { ioctl (tty, TIOCSETN, &(tiop->sgttyb)); tiop->flags &= ~SGTTY_SET; } readline_echoing_p = 1; #if defined (TIOCLSET) if (tiop->flags & LFLAG_SET) { ioctl (tty, TIOCLSET, &(tiop->lflag)); tiop->flags &= ~LFLAG_SET; } #endif #if defined (TIOCSETC) if (tiop->flags & TCHARS_SET) { ioctl (tty, TIOCSETC, &(tiop->tchars)); tiop->flags &= ~TCHARS_SET; } #endif #if defined (TIOCSLTC) if (tiop->flags & LTCHARS_SET) { ioctl (tty, TIOCSLTC, &(tiop->ltchars)); tiop->flags &= ~LTCHARS_SET; } #endif return 0; } static void prepare_terminal_settings (meta_flag, otio, tiop) int meta_flag; TIOTYPE otio, *tiop; { #if !defined (_GO32_) readline_echoing_p = (otio.sgttyb.sg_flags & ECHO); /* Copy the original settings to the structure we're going to use for our settings. */ tiop->sgttyb = otio.sgttyb; tiop->lflag = otio.lflag; #if defined (TIOCGETC) tiop->tchars = otio.tchars; #endif #if defined (TIOCGLTC) tiop->ltchars = otio.ltchars; #endif tiop->flags = otio.flags; /* First, the basic settings to put us into character-at-a-time, no-echo input mode. */ tiop->sgttyb.sg_flags &= ~(ECHO | CRMOD); tiop->sgttyb.sg_flags |= CBREAK; /* If this terminal doesn't care how the 8th bit is used, then we can use it for the meta-key. If only one of even or odd parity is specified, then the terminal is using parity, and we cannot. */ #if !defined (ANYP) # define ANYP (EVENP | ODDP) #endif if (((otio.sgttyb.sg_flags & ANYP) == ANYP) || ((otio.sgttyb.sg_flags & ANYP) == 0)) { tiop->sgttyb.sg_flags |= ANYP; /* Hack on local mode flags if we can. */ #if defined (TIOCLGET) # if defined (LPASS8) tiop->lflag |= LPASS8; # endif /* LPASS8 */ #endif /* TIOCLGET */ } #if defined (TIOCGETC) # if defined (USE_XON_XOFF) /* Get rid of terminal output start and stop characters. */ tiop->tchars.t_stopc = -1; /* C-s */ tiop->tchars.t_startc = -1; /* C-q */ /* If there is an XON character, bind it to restart the output. */ if (otio.tchars.t_startc != -1) rl_bind_key (otio.tchars.t_startc, rl_restart_output); # endif /* USE_XON_XOFF */ /* If there is an EOF char, bind _rl_eof_char to it. */ if (otio.tchars.t_eofc != -1) _rl_eof_char = otio.tchars.t_eofc; # if defined (NO_KILL_INTR) /* Get rid of terminal-generated SIGQUIT and SIGINT. */ tiop->tchars.t_quitc = -1; /* C-\ */ tiop->tchars.t_intrc = -1; /* C-c */ # endif /* NO_KILL_INTR */ #endif /* TIOCGETC */ #if defined (TIOCGLTC) /* Make the interrupt keys go away. Just enough to make people happy. */ tiop->ltchars.t_dsuspc = -1; /* C-y */ tiop->ltchars.t_lnextc = -1; /* C-v */ #endif /* TIOCGLTC */ #endif /* !_GO32_ */ } #else /* !defined (NEW_TTY_DRIVER) */ #if !defined (VMIN) # define VMIN VEOF #endif #if !defined (VTIME) # define VTIME VEOL #endif #if defined (TERMIOS_TTY_DRIVER) # define TIOTYPE struct termios # define DRAIN_OUTPUT(fd) tcdrain (fd) # define GETATTR(tty, tiop) (tcgetattr (tty, tiop)) # define SETATTR(tty, tiop) (tcsetattr (tty, TCSANOW, tiop)) #else # define TIOTYPE struct termio # define DRAIN_OUTPUT(fd) # define GETATTR(tty, tiop) (ioctl (tty, TCGETA, tiop)) # define SETATTR(tty, tiop) (ioctl (tty, TCSETA, tiop)) #endif /* !TERMIOS_TTY_DRIVER */ static TIOTYPE otio; static int get_tty_settings (tty, tiop) int tty; TIOTYPE *tiop; { while (GETATTR (tty, tiop) < 0) { if (errno != EINTR) return -1; errno = 0; } return 0; } static int set_tty_settings (tty, tiop) int tty; TIOTYPE *tiop; { while (SETATTR (tty, tiop) < 0) { if (errno != EINTR) return -1; errno = 0; } #if 0 #if defined (TERMIOS_TTY_DRIVER) # if defined (__ksr1__) if (ksrflow) { ksrflow = 0; tcflow (tty, TCOON); } # else /* !ksr1 */ tcflow (tty, TCOON); /* Simulate a ^Q. */ # endif /* !ksr1 */ #else ioctl (tty, TCXONC, 1); /* Simulate a ^Q. */ #endif /* !TERMIOS_TTY_DRIVER */ #endif return 0; } static void prepare_terminal_settings (meta_flag, otio, tiop) int meta_flag; TIOTYPE otio, *tiop; { readline_echoing_p = (otio.c_lflag & ECHO); tiop->c_lflag &= ~(ICANON | ECHO); if ((unsigned char) otio.c_cc[VEOF] != (unsigned char) _POSIX_VDISABLE) _rl_eof_char = otio.c_cc[VEOF]; #if defined (USE_XON_XOFF) #if defined (IXANY) tiop->c_iflag &= ~(IXON | IXOFF | IXANY); #else /* `strict' Posix systems do not define IXANY. */ tiop->c_iflag &= ~(IXON | IXOFF); #endif /* IXANY */ #endif /* USE_XON_XOFF */ /* Only turn this off if we are using all 8 bits. */ if (((tiop->c_cflag & CSIZE) == CS8) || meta_flag) tiop->c_iflag &= ~(ISTRIP | INPCK); /* Make sure we differentiate between CR and NL on input. */ tiop->c_iflag &= ~(ICRNL | INLCR); #if !defined (HANDLE_SIGNALS) tiop->c_lflag &= ~ISIG; #else tiop->c_lflag |= ISIG; #endif tiop->c_cc[VMIN] = 1; tiop->c_cc[VTIME] = 0; /* Turn off characters that we need on Posix systems with job control, just to be sure. This includes ^Y and ^V. This should not really be necessary. */ #if defined (TERMIOS_TTY_DRIVER) && defined (_POSIX_VDISABLE) #if defined (VLNEXT) tiop->c_cc[VLNEXT] = _POSIX_VDISABLE; #endif #if defined (VDSUSP) tiop->c_cc[VDSUSP] = _POSIX_VDISABLE; #endif #endif /* TERMIOS_TTY_DRIVER && _POSIX_VDISABLE */ } #endif /* NEW_TTY_DRIVER */ /* Put the terminal in CBREAK mode so that we can detect key presses. */ void rl_prep_terminal (meta_flag) int meta_flag; { #if !defined (_GO32_) int tty = fileno (rl_instream); TIOTYPE tio; if (terminal_prepped) return; /* Try to keep this function from being INTerrupted. */ block_sigint (); if (get_tty_settings (tty, &tio) < 0) { release_sigint (); return; } otio = tio; prepare_terminal_settings (meta_flag, otio, &tio); if (set_tty_settings (tty, &tio) < 0) { release_sigint (); return; } control_meta_key (1); terminal_prepped = 1; release_sigint (); #endif /* !_GO32_ */ } /* Restore the terminal's normal settings and modes. */ void rl_deprep_terminal () { #if !defined (_GO32_) int tty = fileno (rl_instream); if (!terminal_prepped) return; /* Try to keep this function from being INTerrupted. */ block_sigint (); if (set_tty_settings (tty, &otio) < 0) { release_sigint (); return; } control_meta_key (0); terminal_prepped = 0; release_sigint (); #endif /* !_GO32_ */ } /* **************************************************************** */ /* */ /* Bogus Flow Control */ /* */ /* **************************************************************** */ int rl_restart_output (count, key) int count, key; { int fildes = fileno (rl_outstream); #if defined (TIOCSTART) #if defined (apollo) ioctl (&fildes, TIOCSTART, 0); #else ioctl (fildes, TIOCSTART, 0); #endif /* apollo */ #else /* !TIOCSTART */ # if defined (TERMIOS_TTY_DRIVER) # if defined (__ksr1__) if (ksrflow) { ksrflow = 0; tcflow (fildes, TCOON); } # else /* !ksr1 */ tcflow (fildes, TCOON); /* Simulate a ^Q. */ # endif /* !ksr1 */ # else /* !TERMIOS_TTY_DRIVER */ # if defined (TCXONC) ioctl (fildes, TCXONC, TCOON); # endif /* TCXONC */ # endif /* !TERMIOS_TTY_DRIVER */ #endif /* !TIOCSTART */ return 0; } int rl_stop_output (count, key) int count, key; { int fildes = fileno (rl_instream); #if defined (TIOCSTOP) # if defined (apollo) ioctl (&fildes, TIOCSTOP, 0); # else ioctl (fildes, TIOCSTOP, 0); # endif /* apollo */ #else /* !TIOCSTOP */ # if defined (TERMIOS_TTY_DRIVER) # if defined (__ksr1__) ksrflow = 1; # endif /* ksr1 */ tcflow (fildes, TCOOFF); # else # if defined (TCXONC) ioctl (fildes, TCXONC, TCOON); # endif /* TCXONC */ # endif /* !TERMIOS_TTY_DRIVER */ #endif /* !TIOCSTOP */ return 0; } /* **************************************************************** */ /* */ /* Default Key Bindings */ /* */ /* **************************************************************** */ void rltty_set_default_bindings (kmap) Keymap kmap; { TIOTYPE ttybuff; int tty = fileno (rl_instream); #if defined (NEW_TTY_DRIVER) if (get_tty_settings (tty, &ttybuff) == 0) { if (ttybuff.flags & SGTTY_SET) { int erase, kill; erase = ttybuff.sgttyb.sg_erase; kill = ttybuff.sgttyb.sg_kill; if (erase != -1 && kmap[erase].type == ISFUNC) kmap[erase].function = rl_rubout; if (kill != -1 && kmap[kill].type == ISFUNC) kmap[kill].function = rl_unix_line_discard; } # if defined (TIOCGLTC) if (ttybuff.flags & LTCHARS_SET) { int werase, nextc; werase = ttybuff.ltchars.t_werasc; nextc = ttybuff.ltchars.t_lnextc; if (werase != -1 && kmap[werase].type == ISFUNC) kmap[werase].function = rl_unix_word_rubout; if (nextc != -1 && kmap[nextc].type == ISFUNC) kmap[nextc].function = rl_quoted_insert; } } # endif /* TIOCGLTC */ #else /* !NEW_TTY_DRIVER */ if (get_tty_settings (tty, &ttybuff) == 0) { unsigned char erase, kill; erase = ttybuff.c_cc[VERASE]; kill = ttybuff.c_cc[VKILL]; if (erase != (unsigned char)_POSIX_VDISABLE && kmap[erase].type == ISFUNC) kmap[erase].function = rl_rubout; if (kill != (unsigned char)_POSIX_VDISABLE && kmap[kill].type == ISFUNC) kmap[kill].function = rl_unix_line_discard; # if defined (VLNEXT) && defined (TERMIOS_TTY_DRIVER) { unsigned char nextc; nextc = ttybuff.c_cc[VLNEXT]; if (nextc != (unsigned char)_POSIX_VDISABLE && kmap[nextc].type == ISFUNC) kmap[nextc].function = rl_quoted_insert; } # endif /* VLNEXT && TERMIOS_TTY_DRIVER */ # if defined (VWERASE) && defined (TERMIOS_TTY_DRIVER) { unsigned char werase; werase = ttybuff.c_cc[VWERASE]; if (werase != (unsigned char)_POSIX_VDISABLE && kmap[werase].type == ISFUNC) kmap[werase].function = rl_unix_word_rubout; } # endif /* VWERASE && TERMIOS_TTY_DRIVER */ } #endif /* !NEW_TTY_DRIVER */ } octave-1.1.0/readline/search.c100666 415 17 15430 5521547744 14373 0ustar jweusers/* search.c - code for non-incremental searching in emacs and vi modes. */ /* Copyright (C) 1992 Free Software Foundation, Inc. This file is part of the Readline Library (the Library), a set of routines for providing Emacs style line input to programs that ask for it. The 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 1, or (at your option) any later version. The 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #if defined (__GNUC__) # define alloca __builtin_alloca #else # if defined (sparc) || defined (HAVE_ALLOCA_H) # include # endif #endif #include "readline.h" #include "history.h" extern char *xmalloc (), *xrealloc (); /* Variables imported from readline.c */ extern int rl_point, rl_end, rl_line_buffer_len; extern Keymap _rl_keymap; extern char *rl_prompt; extern char *rl_line_buffer; extern HIST_ENTRY *saved_line_for_history; /* Defined in display.c */ extern int rl_message (), rl_clear_message (); extern void rl_redisplay (); static char *noninc_search_string = (char *) NULL; static int noninc_history_pos = 0; /* Search the history list for STRING starting at absolute history position POS. If STRING begins with `^', the search must match STRING at the beginning of a history line, otherwise a full substring match is performed for STRING. DIR < 0 means to search backwards through the history list, DIR >= 0 means to search forward. */ static int noninc_search_from_pos (string, pos, dir) char *string; int pos, dir; { int ret, old; old = where_history (); history_set_pos (pos); if (*string == '^') ret = history_search_prefix (string + 1, dir); else ret = history_search (string, dir); if (ret != -1) ret = where_history (); history_set_pos (old); return (ret); } /* Search for a line in the history containing STRING. If DIR is < 0, the search is backwards through previous entries, else through subsequent entries. */ static void noninc_dosearch (string, dir) char *string; int dir; { int oldpos, pos; HIST_ENTRY *entry; if (string == 0 || *string == 0 || noninc_history_pos < 0) { ding (); return; } pos = noninc_search_from_pos (string, noninc_history_pos + dir, dir); if (pos == -1) { /* Search failed, current history position unchanged. */ maybe_unsave_line (); rl_clear_message (); rl_point = 0; ding (); return; } noninc_history_pos = pos; oldpos = where_history (); history_set_pos (noninc_history_pos); entry = current_history (); history_set_pos (oldpos); { int line_len; line_len = strlen (entry->line); if (line_len >= rl_line_buffer_len) rl_extend_line_buffer (line_len); strcpy (rl_line_buffer, entry->line); } rl_undo_list = (UNDO_LIST *)entry->data; rl_end = strlen (rl_line_buffer); rl_point = 0; rl_clear_message (); if (saved_line_for_history) free_history_entry (saved_line_for_history); saved_line_for_history = (HIST_ENTRY *)NULL; } /* Search non-interactively through the history list. DIR < 0 means to search backwards through the history of previous commands; otherwise the search is for commands subsequent to the current position in the history list. PCHAR is the character to use for prompting when reading the search string; if not specified (0), it defaults to `:'. */ static void noninc_search (dir, pchar) int dir; int pchar; { int saved_point, c, pmtlen; char *p; maybe_save_line (); saved_point = rl_point; /* Use the line buffer to read the search string. */ rl_line_buffer[0] = 0; rl_end = rl_point = 0; pmtlen = (rl_prompt && *rl_prompt) ? strlen (rl_prompt) : 0; p = (char *)alloca (2 + pmtlen); if (pmtlen) strcpy (p, rl_prompt); p[pmtlen] = pchar ? pchar : ':'; p[pmtlen + 1] = '\0'; rl_message (p, 0, 0); /* Read the search string. */ while ((c = rl_read_key ()) != '\0') { switch (c) { case CTRL('H'): case RUBOUT: if (rl_point == 0) { maybe_unsave_line (); rl_clear_message (); rl_point = saved_point; return; } /* FALLTHROUGH */ case CTRL('W'): case CTRL('U'): rl_dispatch (c, _rl_keymap); break; case RETURN: case NEWLINE: goto dosearch; /* NOTREACHED */ break; case CTRL('C'): case CTRL('G'): maybe_unsave_line (); rl_clear_message (); rl_point = saved_point; ding (); return; default: rl_insert (1, c); break; } rl_redisplay (); } dosearch: /* If rl_point == 0, we want to re-use the previous search string and start from the saved history position. If there's no previous search string, punt. */ if (rl_point == 0) { if (!noninc_search_string) { ding (); return; } } else { /* We want to start the search from the current history position. */ noninc_history_pos = where_history (); if (noninc_search_string) free (noninc_search_string); noninc_search_string = savestring (rl_line_buffer); } noninc_dosearch (noninc_search_string, dir); } /* Search forward through the history list for a string. If the vi-mode code calls this, KEY will be `?'. */ int rl_noninc_forward_search (count, key) int count, key; { if (key == '?') noninc_search (1, '?'); else noninc_search (1, 0); return 0; } /* Reverse search the history list for a string. If the vi-mode code calls this, KEY will be `/'. */ int rl_noninc_reverse_search (count, key) int count, key; { if (key == '/') noninc_search (-1, '/'); else noninc_search (-1, 0); return 0; } /* Search forward through the history list for the last string searched for. If there is no saved search string, abort. */ int rl_noninc_forward_search_again (count, key) int count, key; { if (!noninc_search_string) { ding (); return (-1); } noninc_dosearch (noninc_search_string, 1); return 0; } /* Reverse search in the history list for the last string searched for. If there is no saved search string, abort. */ int rl_noninc_reverse_search_again (count, key) int count, key; { if (!noninc_search_string) { ding (); return (-1); } noninc_dosearch (noninc_search_string, -1); return 0; } octave-1.1.0/readline/signals.c100666 415 17 17303 5521547744 14567 0ustar jweusers/* signals.c -- signal handling support for readline. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include #include #if !defined (NO_SYS_FILE) # include #endif /* !NO_SYS_FILE */ #include /* This is needed to include support for TIOCGWINSZ and window resizing. */ #if defined (OSF1) || defined (BSD386) || defined (_386BSD) || defined (__BSD_4_4__) || defined (AIX) # include #endif /* OSF1 || BSD386 || _386BSD || __BSD_4_4__ || AIX */ #if defined (HAVE_UNISTD_H) # include #endif /* HAVE_UNISTD_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #include /* Not all systems declare ERRNO in errno.h... and some systems #define it! */ #if !defined (errno) extern int errno; #endif /* !errno */ #include "posixstat.h" /* System-specific feature definitions and include files. */ #include "rldefs.h" /* Some standard library routines. */ #include "readline.h" #include "history.h" static void cr (); extern int readline_echoing_p; extern int rl_pending_input; extern int _rl_meta_flag; extern void _rl_output_character_function (); extern void free_undo_list (); #if defined (VOID_SIGHANDLER) # define sighandler void #else # define sighandler int #endif /* VOID_SIGHANDLER */ /* This typedef is equivalant to the one for Function; it allows us to say SigHandler *foo = signal (SIGKILL, SIG_IGN); */ typedef sighandler SigHandler (); #if defined (_GO32_) # undef HANDLE_SIGNALS #endif /* _GO32_ */ #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ /* Defined in this file */ int rl_set_signals (), rl_clear_signals (); /* Defined in display.c */ extern int rl_clear_message (), rl_forced_update_display (); /* Defined in rltty.c */ extern void rl_prep_terminal (), rl_deprep_terminal (); /* **************************************************************** */ /* */ /* Signal Handling */ /* */ /* **************************************************************** */ #if defined (SIGWINCH) static SigHandler *old_sigwinch = (SigHandler *)NULL; static sighandler rl_handle_sigwinch (sig) int sig; { if (readline_echoing_p) { _rl_set_screen_size (fileno (rl_instream), 1); cr (); /* was crlf () */ rl_forced_update_display (); } if (old_sigwinch && old_sigwinch != (SigHandler *)SIG_IGN && old_sigwinch != (SigHandler *)SIG_DFL) (*old_sigwinch) (sig); #if !defined (VOID_SIGHANDLER) return (0); #endif /* VOID_SIGHANDLER */ } #endif /* SIGWINCH */ #if defined (HANDLE_SIGNALS) /* Interrupt handling. */ static SigHandler *old_int = (SigHandler *)NULL, *old_tstp = (SigHandler *)NULL, *old_ttou = (SigHandler *)NULL, *old_ttin = (SigHandler *)NULL, *old_cont = (SigHandler *)NULL, *old_alrm = (SigHandler *)NULL; /* Handle an interrupt character. */ static sighandler rl_signal_handler (sig) int sig; { #if defined (HAVE_POSIX_SIGNALS) sigset_t set; #else /* !HAVE_POSIX_SIGNALS */ # if defined (HAVE_BSD_SIGNALS) long omask; # endif /* HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ #if !defined (HAVE_BSD_SIGNALS) && !defined (HAVE_POSIX_SIGNALS) /* Since the signal will not be blocked while we are in the signal handler, ignore it until rl_clear_signals resets the catcher. */ if (sig == SIGINT) signal (sig, SIG_IGN); #endif /* !HAVE_BSD_SIGNALS */ switch (sig) { case SIGINT: { register HIST_ENTRY *entry; free_undo_list (); entry = current_history (); if (entry) entry->data = (char *)NULL; } _rl_kill_kbd_macro (); rl_clear_message (); rl_init_argument (); #if defined (SIGTSTP) case SIGTSTP: case SIGTTOU: case SIGTTIN: #endif /* SIGTSTP */ case SIGALRM: rl_clean_up_for_exit (); rl_deprep_terminal (); rl_clear_signals (); rl_pending_input = 0; #if defined (HAVE_POSIX_SIGNALS) sigprocmask (SIG_BLOCK, (sigset_t *)NULL, &set); sigdelset (&set, sig); #else /* !HAVE_POSIX_SIGNALS */ # if defined (HAVE_BSD_SIGNALS) omask = sigblock (0); # endif /* HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ kill (getpid (), sig); /* Let the signal that we just sent through. */ #if defined (HAVE_POSIX_SIGNALS) sigprocmask (SIG_SETMASK, &set, (sigset_t *)NULL); #else /* !HAVE_POSIX_SIGNALS */ # if defined (HAVE_BSD_SIGNALS) sigsetmask (omask & ~(sigmask (sig))); # endif /* HAVE_BSD_SIGNALS */ #endif /* !HAVE_POSIX_SIGNALS */ rl_prep_terminal (_rl_meta_flag); rl_set_signals (); } #if !defined (VOID_SIGHANDLER) return (0); #endif /* !VOID_SIGHANDLER */ } #if defined (HAVE_POSIX_SIGNALS) static SigHandler * rl_set_sighandler (sig, handler) int sig; SigHandler *handler; { struct sigaction act, oact; act.sa_handler = handler; act.sa_flags = 0; sigemptyset (&act.sa_mask); sigemptyset (&oact.sa_mask); sigaction (sig, &act, &oact); return (oact.sa_handler); } #else /* !HAVE_POSIX_SIGNALS */ # define rl_set_sighandler(sig, handler) (SigHandler *)signal (sig, handler) #endif /* !HAVE_POSIX_SIGNALS */ int rl_set_signals () { old_int = (SigHandler *)rl_set_sighandler (SIGINT, rl_signal_handler); if (old_int == (SigHandler *)SIG_IGN) signal (SIGINT, SIG_IGN); old_alrm = (SigHandler *)rl_set_sighandler (SIGALRM, rl_signal_handler); if (old_alrm == (SigHandler *)SIG_IGN) signal (SIGALRM, SIG_IGN); #if !defined (SHELL) #if defined (SIGTSTP) old_tstp = (SigHandler *)rl_set_sighandler (SIGTSTP, rl_signal_handler); if (old_tstp == (SigHandler *)SIG_IGN) signal (SIGTSTP, SIG_IGN); #endif /* SIGTSTP */ #if defined (SIGTTOU) old_ttou = (SigHandler *)rl_set_sighandler (SIGTTOU, rl_signal_handler); old_ttin = (SigHandler *)rl_set_sighandler (SIGTTIN, rl_signal_handler); if (old_tstp == (SigHandler *)SIG_IGN) { signal (SIGTTOU, SIG_IGN); signal (SIGTTIN, SIG_IGN); } #endif /* SIGTTOU */ #endif /* !SHELL */ #if defined (SIGWINCH) old_sigwinch = (SigHandler *) rl_set_sighandler (SIGWINCH, rl_handle_sigwinch); #endif /* SIGWINCH */ return 0; } int rl_clear_signals () { rl_set_sighandler (SIGINT, old_int); rl_set_sighandler (SIGALRM, old_alrm); #if !defined (SHELL) #if defined (SIGTSTP) signal (SIGTSTP, old_tstp); #endif #if defined (SIGTTOU) signal (SIGTTOU, old_ttou); signal (SIGTTIN, old_ttin); #endif /* SIGTTOU */ #endif /* !SHELL */ #if defined (SIGWINCH) signal (SIGWINCH, old_sigwinch); #endif return 0; } /* Move to the start of the current line. */ static void cr () { extern char *term_cr; if (term_cr) tputs (term_cr, 1, _rl_output_character_function); } #endif /* HANDLE_SIGNALS */ octave-1.1.0/readline/tilde.c100666 415 17 23514 5555150446 14225 0ustar jweusers/* tilde.c -- Tilde expansion code (~/foo := $HOME/foo). */ /* Copyright (C) 1988,1989 Free Software Foundation, Inc. This file is part of GNU Readline, a library for reading lines of text with interactive input and history editing. Readline 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 1, or (at your option) any later version. Readline 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 Readline; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if defined (__GNUC__) # undef alloca # define alloca __builtin_alloca #else /* !__GNUC__ */ # if defined (_AIX) #pragma alloca # else /* !_AIX */ # if defined (HAVE_ALLOCA_H) # include # endif /* HAVE_ALLOCA_H */ # endif /* !AIX */ #endif /* !__GNUC__ */ #if defined (HAVE_STRING_H) # include #else /* !HAVE_STRING_H */ # include #endif /* !HAVE_STRING_H */ #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #if defined (HAVE_UNISTD_H) # include #endif #include #include #if defined (USG) && !defined (isc386) && !defined (sgi) extern struct passwd *getpwuid (), *getpwent (); #endif #if defined (isc386) && !defined (__STDC__) && defined (_POSIX_SOURCE) extern struct passwd *getpwent (); #endif #if !defined (savestring) extern char *xmalloc (); # ifndef strcpy extern char *strcpy (); # endif #define savestring(x) strcpy (xmalloc (1 + strlen (x)), (x)) #endif /* !savestring */ #if !defined (NULL) # if defined (__STDC__) # define NULL ((void *) 0) # else # define NULL 0x0 # endif /* !__STDC__ */ #endif /* !NULL */ #if defined (TEST) || defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* TEST || STATIC_MALLOC */ /* The default value of tilde_additional_prefixes. This is set to whitespace preceding a tilde so that simple programs which do not perform any word separation get desired behaviour. */ static char *default_prefixes[] = { " ~", "\t~", (char *)NULL }; /* The default value of tilde_additional_suffixes. This is set to whitespace or newline so that simple programs which do not perform any word separation get desired behaviour. */ static char *default_suffixes[] = { " ", "\n", (char *)NULL }; /* If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text (sans tilde, as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. */ CPFunction *tilde_expansion_failure_hook = (CPFunction *)NULL; /* When non-null, this is a NULL terminated array of strings which are duplicates for a tilde prefix. Bash uses this to expand `=~' and `:~'. */ char **tilde_additional_prefixes = default_prefixes; /* When non-null, this is a NULL terminated array of strings which match the end of a username, instead of just "/". Bash sets this to `:' and `=~'. */ char **tilde_additional_suffixes = default_suffixes; /* Find the start of a tilde expansion in STRING, and return the index of the tilde which starts the expansion. Place the length of the text which identified this tilde starter in LEN, excluding the tilde itself. */ static int tilde_find_prefix (string, len) char *string; int *len; { register int i, j, string_len; register char **prefixes = tilde_additional_prefixes; string_len = strlen (string); *len = 0; if (!*string || *string == '~') return (0); if (prefixes) { for (i = 0; i < string_len; i++) { for (j = 0; prefixes[j]; j++) { if (strncmp (string + i, prefixes[j], strlen (prefixes[j])) == 0) { *len = strlen (prefixes[j]) - 1; return (i + *len); } } } } return (string_len); } /* Find the end of a tilde expansion in STRING, and return the index of the character which ends the tilde definition. */ static int tilde_find_suffix (string) char *string; { register int i, j, string_len; register char **suffixes = tilde_additional_suffixes; string_len = strlen (string); for (i = 0; i < string_len; i++) { if (string[i] == '/' || !string[i]) break; for (j = 0; suffixes && suffixes[j]; j++) { if (strncmp (string + i, suffixes[j], strlen (suffixes[j])) == 0) return (i); } } return (i); } /* Return a new string which is the result of tilde expanding STRING. */ char * tilde_expand (string) char *string; { char *result, *tilde_expand_word (); int result_size, result_index; result_size = result_index = 0; result = (char *)NULL; /* Scan through STRING expanding tildes as we come to them. */ while (1) { register int start, end; char *tilde_word, *expansion; int len; /* Make START point to the tilde which starts the expansion. */ start = tilde_find_prefix (string, &len); /* Copy the skipped text into the result. */ if ((result_index + start + 1) > result_size) result = (char *)xrealloc (result, 1 + (result_size += (start + 20))); strncpy (result + result_index, string, start); result_index += start; /* Advance STRING to the starting tilde. */ string += start; /* Make END be the index of one after the last character of the username. */ end = tilde_find_suffix (string); /* If both START and END are zero, we are all done. */ if (!start && !end) break; /* Expand the entire tilde word, and copy it into RESULT. */ tilde_word = (char *)xmalloc (1 + end); strncpy (tilde_word, string, end); tilde_word[end] = '\0'; string += end; expansion = tilde_expand_word (tilde_word); free (tilde_word); len = strlen (expansion); if ((result_index + len + 1) > result_size) result = (char *)xrealloc (result, 1 + (result_size += (len + 20))); strcpy (result + result_index, expansion); result_index += len; free (expansion); } result[result_index] = '\0'; return (result); } /* Do the work of tilde expansion on FILENAME. FILENAME starts with a tilde. If there is no expansion, call tilde_expansion_failure_hook. */ char * tilde_expand_word (filename) char *filename; { char *dirname; dirname = filename ? savestring (filename) : (char *)NULL; if (dirname && *dirname == '~') { char *temp_name; if (!dirname[1] || dirname[1] == '/') { /* Prepend $HOME to the rest of the string. */ char *temp_home = (char *)getenv ("HOME"); /* If there is no HOME variable, look up the directory in the password database. */ if (!temp_home) { struct passwd *entry; entry = getpwuid (getuid ()); if (entry) temp_home = entry->pw_dir; } temp_name = (char *)alloca (1 + strlen (&dirname[1]) + (temp_home ? strlen (temp_home) : 0)); temp_name[0] = '\0'; if (temp_home) strcpy (temp_name, temp_home); strcat (temp_name, &dirname[1]); free (dirname); dirname = savestring (temp_name); } else { struct passwd *user_entry; char *username = (char *)alloca (257); int i, c; for (i = 1; (c = dirname[i]) != '\0'; i++) { if (c == '/') break; else username[i - 1] = c; } username[i - 1] = '\0'; if (!(user_entry = getpwnam (username))) { /* If the calling program has a special syntax for expanding tildes, and we couldn't find a standard expansion, then let them try. */ if (tilde_expansion_failure_hook) { char *expansion; expansion = (*tilde_expansion_failure_hook) (username); if (expansion) { temp_name = (char *)alloca (1 + strlen (expansion) + strlen (&dirname[i])); strcpy (temp_name, expansion); strcat (temp_name, &dirname[i]); free (expansion); goto return_name; } } /* We shouldn't report errors. */ } else { temp_name = (char *)alloca (1 + strlen (user_entry->pw_dir) + strlen (&dirname[i])); strcpy (temp_name, user_entry->pw_dir); strcat (temp_name, &dirname[i]); return_name: free (dirname); dirname = savestring (temp_name); } endpwent (); } } return (dirname); } #if defined (TEST) #undef NULL #include main (argc, argv) int argc; char **argv; { char *result, line[512]; int done = 0; while (!done) { printf ("~expand: "); fflush (stdout); if (!gets (line)) strcpy (line, "done"); if ((strcmp (line, "done") == 0) || (strcmp (line, "quit") == 0) || (strcmp (line, "exit") == 0)) { done = 1; break; } result = tilde_expand (line); printf (" --> %s\n", result); free (result); } exit (0); } static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } /* * Local variables: * compile-command: "gcc -g -DTEST -o tilde tilde.c" * end: */ #endif /* TEST */ octave-1.1.0/readline/vi_keymap.c100666 415 17 100135 5521547745 15130 0ustar jweusers/* vi_keymap.c -- the keymap for vi_mode in readline (). */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (BUFSIZ) #include #endif /* !BUFSIZ */ #include "readline.h" extern KEYMAP_ENTRY_ARRAY vi_escape_keymap; /* The keymap arrays for handling vi mode. */ KEYMAP_ENTRY_ARRAY vi_movement_keymap = { /* The regular control keys come first. */ { ISFUNC, (Function *)0x0 }, /* Control-@ */ { ISFUNC, (Function *)0x0 }, /* Control-a */ { ISFUNC, (Function *)0x0 }, /* Control-b */ { ISFUNC, (Function *)0x0 }, /* Control-c */ { ISFUNC, rl_vi_eof_maybe }, /* Control-d */ { ISFUNC, rl_emacs_editing_mode }, /* Control-e */ { ISFUNC, (Function *)0x0 }, /* Control-f */ { ISFUNC, rl_abort }, /* Control-g */ { ISFUNC, rl_backward }, /* Control-h */ { ISFUNC, (Function *)0x0 }, /* Control-i */ { ISFUNC, rl_newline }, /* Control-j */ { ISFUNC, rl_kill_line }, /* Control-k */ { ISFUNC, rl_clear_screen }, /* Control-l */ { ISFUNC, rl_newline }, /* Control-m */ { ISFUNC, rl_get_next_history }, /* Control-n */ { ISFUNC, (Function *)0x0 }, /* Control-o */ { ISFUNC, rl_get_previous_history }, /* Control-p */ { ISFUNC, rl_quoted_insert }, /* Control-q */ { ISFUNC, rl_reverse_search_history }, /* Control-r */ { ISFUNC, rl_forward_search_history }, /* Control-s */ { ISFUNC, rl_transpose_chars }, /* Control-t */ { ISFUNC, rl_unix_line_discard }, /* Control-u */ { ISFUNC, rl_quoted_insert }, /* Control-v */ { ISFUNC, rl_unix_word_rubout }, /* Control-w */ { ISFUNC, (Function *)0x0 }, /* Control-x */ { ISFUNC, rl_yank }, /* Control-y */ { ISFUNC, (Function *)0x0 }, /* Control-z */ { ISFUNC, rl_abort }, /* Control-[ */ { ISFUNC, (Function *)0x0 }, /* Control-\ */ { ISFUNC, (Function *)0x0 }, /* Control-] */ { ISFUNC, (Function *)0x0 }, /* Control-^ */ { ISFUNC, rl_undo_command }, /* Control-_ */ /* The start of printing characters. */ { ISFUNC, rl_forward }, /* SPACE */ { ISFUNC, (Function *)0x0 }, /* ! */ { ISFUNC, (Function *)0x0 }, /* " */ { ISFUNC, rl_vi_comment }, /* # */ { ISFUNC, rl_end_of_line }, /* $ */ { ISFUNC, rl_vi_match }, /* % */ { ISFUNC, rl_vi_tilde_expand }, /* & */ { ISFUNC, (Function *)0x0 }, /* ' */ { ISFUNC, (Function *)0x0 }, /* ( */ { ISFUNC, (Function *)0x0 }, /* ) */ { ISFUNC, rl_vi_complete }, /* * */ { ISFUNC, rl_get_next_history}, /* + */ { ISFUNC, rl_vi_char_search }, /* , */ { ISFUNC, rl_get_previous_history }, /* - */ { ISFUNC, rl_vi_redo }, /* . */ { ISFUNC, rl_vi_search }, /* / */ /* Regular digits. */ { ISFUNC, rl_vi_arg_digit }, /* 0 */ { ISFUNC, rl_vi_arg_digit }, /* 1 */ { ISFUNC, rl_vi_arg_digit }, /* 2 */ { ISFUNC, rl_vi_arg_digit }, /* 3 */ { ISFUNC, rl_vi_arg_digit }, /* 4 */ { ISFUNC, rl_vi_arg_digit }, /* 5 */ { ISFUNC, rl_vi_arg_digit }, /* 6 */ { ISFUNC, rl_vi_arg_digit }, /* 7 */ { ISFUNC, rl_vi_arg_digit }, /* 8 */ { ISFUNC, rl_vi_arg_digit }, /* 9 */ /* A little more punctuation. */ { ISFUNC, (Function *)0x0 }, /* : */ { ISFUNC, rl_vi_char_search }, /* ; */ { ISFUNC, (Function *)0x0 }, /* < */ { ISFUNC, rl_vi_complete }, /* = */ { ISFUNC, (Function *)0x0 }, /* > */ { ISFUNC, rl_vi_search }, /* ? */ { ISFUNC, (Function *)0x0 }, /* @ */ /* Uppercase alphabet. */ { ISFUNC, rl_vi_append_eol }, /* A */ { ISFUNC, rl_vi_prev_word}, /* B */ { ISFUNC, rl_vi_change_to }, /* C */ { ISFUNC, rl_vi_delete_to }, /* D */ { ISFUNC, rl_vi_end_word }, /* E */ { ISFUNC, rl_vi_char_search }, /* F */ { ISFUNC, rl_vi_fetch_history }, /* G */ { ISFUNC, (Function *)0x0 }, /* H */ { ISFUNC, rl_vi_insert_beg }, /* I */ { ISFUNC, (Function *)0x0 }, /* J */ { ISFUNC, (Function *)0x0 }, /* K */ { ISFUNC, (Function *)0x0 }, /* L */ { ISFUNC, (Function *)0x0 }, /* M */ { ISFUNC, rl_vi_search_again }, /* N */ { ISFUNC, (Function *)0x0 }, /* O */ { ISFUNC, rl_vi_put }, /* P */ { ISFUNC, (Function *)0x0 }, /* Q */ { ISFUNC, rl_vi_replace }, /* R */ { ISFUNC, rl_vi_subst }, /* S */ { ISFUNC, rl_vi_char_search }, /* T */ { ISFUNC, rl_revert_line }, /* U */ { ISFUNC, (Function *)0x0 }, /* V */ { ISFUNC, rl_vi_next_word }, /* W */ { ISFUNC, rl_rubout }, /* X */ { ISFUNC, rl_vi_yank_to }, /* Y */ { ISFUNC, (Function *)0x0 }, /* Z */ /* Some more punctuation. */ { ISFUNC, (Function *)0x0 }, /* [ */ { ISFUNC, rl_vi_complete }, /* \ */ { ISFUNC, (Function *)0x0 }, /* ] */ { ISFUNC, rl_vi_first_print }, /* ^ */ { ISFUNC, rl_vi_yank_arg }, /* _ */ { ISFUNC, (Function *)0x0 }, /* ` */ /* Lowercase alphabet. */ { ISFUNC, rl_vi_append_mode }, /* a */ { ISFUNC, rl_vi_prev_word }, /* b */ { ISFUNC, rl_vi_change_to }, /* c */ { ISFUNC, rl_vi_delete_to }, /* d */ { ISFUNC, rl_vi_end_word }, /* e */ { ISFUNC, rl_vi_char_search }, /* f */ { ISFUNC, (Function *)0x0 }, /* g */ { ISFUNC, rl_backward }, /* h */ { ISFUNC, rl_vi_insertion_mode }, /* i */ { ISFUNC, rl_get_next_history }, /* j */ { ISFUNC, rl_get_previous_history }, /* k */ { ISFUNC, rl_forward }, /* l */ { ISFUNC, (Function *)0x0 }, /* m */ { ISFUNC, rl_vi_search_again }, /* n */ { ISFUNC, (Function *)0x0 }, /* o */ { ISFUNC, rl_vi_put }, /* p */ { ISFUNC, (Function *)0x0 }, /* q */ { ISFUNC, rl_vi_change_char }, /* r */ { ISFUNC, rl_vi_subst }, /* s */ { ISFUNC, rl_vi_char_search }, /* t */ { ISFUNC, rl_undo_command }, /* u */ { ISFUNC, (Function *)0x0 }, /* v */ { ISFUNC, rl_vi_next_word }, /* w */ { ISFUNC, rl_vi_delete }, /* x */ { ISFUNC, rl_vi_yank_to }, /* y */ { ISFUNC, (Function *)0x0 }, /* z */ /* Final punctuation. */ { ISFUNC, (Function *)0x0 }, /* { */ { ISFUNC, rl_vi_column }, /* | */ { ISFUNC, (Function *)0x0 }, /* } */ { ISFUNC, rl_vi_change_case }, /* ~ */ { ISFUNC, (Function *)0x0 }, /* RUBOUT */ #if KEYMAP_SIZE > 128 /* Undefined keys. */ { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 } #endif /* KEYMAP_SIZE > 128 */ }; KEYMAP_ENTRY_ARRAY vi_insertion_keymap = { /* The regular control keys come first. */ { ISFUNC, (Function *)0x0 }, /* Control-@ */ { ISFUNC, rl_insert }, /* Control-a */ { ISFUNC, rl_insert }, /* Control-b */ { ISFUNC, rl_insert }, /* Control-c */ { ISFUNC, rl_vi_eof_maybe }, /* Control-d */ { ISFUNC, rl_insert }, /* Control-e */ { ISFUNC, rl_insert }, /* Control-f */ { ISFUNC, rl_insert }, /* Control-g */ { ISFUNC, rl_rubout }, /* Control-h */ { ISFUNC, rl_complete }, /* Control-i */ { ISFUNC, rl_newline }, /* Control-j */ { ISFUNC, rl_insert }, /* Control-k */ { ISFUNC, rl_insert }, /* Control-l */ { ISFUNC, rl_newline }, /* Control-m */ { ISFUNC, rl_insert }, /* Control-n */ { ISFUNC, rl_insert }, /* Control-o */ { ISFUNC, rl_insert }, /* Control-p */ { ISFUNC, rl_insert }, /* Control-q */ { ISFUNC, rl_reverse_search_history }, /* Control-r */ { ISFUNC, rl_forward_search_history }, /* Control-s */ { ISFUNC, rl_transpose_chars }, /* Control-t */ { ISFUNC, rl_unix_line_discard }, /* Control-u */ { ISFUNC, rl_quoted_insert }, /* Control-v */ { ISFUNC, rl_unix_word_rubout }, /* Control-w */ { ISFUNC, rl_insert }, /* Control-x */ { ISFUNC, rl_yank }, /* Control-y */ { ISFUNC, rl_insert }, /* Control-z */ { ISFUNC, rl_vi_movement_mode }, /* Control-[ */ { ISFUNC, rl_insert }, /* Control-\ */ { ISFUNC, rl_insert }, /* Control-] */ { ISFUNC, rl_insert }, /* Control-^ */ { ISFUNC, rl_undo_command }, /* Control-_ */ /* The start of printing characters. */ { ISFUNC, rl_insert }, /* SPACE */ { ISFUNC, rl_insert }, /* ! */ { ISFUNC, rl_insert }, /* " */ { ISFUNC, rl_insert }, /* # */ { ISFUNC, rl_insert }, /* $ */ { ISFUNC, rl_insert }, /* % */ { ISFUNC, rl_insert }, /* & */ { ISFUNC, rl_insert }, /* ' */ { ISFUNC, rl_insert }, /* ( */ { ISFUNC, rl_insert }, /* ) */ { ISFUNC, rl_insert }, /* * */ { ISFUNC, rl_insert }, /* + */ { ISFUNC, rl_insert }, /* , */ { ISFUNC, rl_insert }, /* - */ { ISFUNC, rl_insert }, /* . */ { ISFUNC, rl_insert }, /* / */ /* Regular digits. */ { ISFUNC, rl_insert }, /* 0 */ { ISFUNC, rl_insert }, /* 1 */ { ISFUNC, rl_insert }, /* 2 */ { ISFUNC, rl_insert }, /* 3 */ { ISFUNC, rl_insert }, /* 4 */ { ISFUNC, rl_insert }, /* 5 */ { ISFUNC, rl_insert }, /* 6 */ { ISFUNC, rl_insert }, /* 7 */ { ISFUNC, rl_insert }, /* 8 */ { ISFUNC, rl_insert }, /* 9 */ /* A little more punctuation. */ { ISFUNC, rl_insert }, /* : */ { ISFUNC, rl_insert }, /* ; */ { ISFUNC, rl_insert }, /* < */ { ISFUNC, rl_insert }, /* = */ { ISFUNC, rl_insert }, /* > */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* @ */ /* Uppercase alphabet. */ { ISFUNC, rl_insert }, /* A */ { ISFUNC, rl_insert }, /* B */ { ISFUNC, rl_insert }, /* C */ { ISFUNC, rl_insert }, /* D */ { ISFUNC, rl_insert }, /* E */ { ISFUNC, rl_insert }, /* F */ { ISFUNC, rl_insert }, /* G */ { ISFUNC, rl_insert }, /* H */ { ISFUNC, rl_insert }, /* I */ { ISFUNC, rl_insert }, /* J */ { ISFUNC, rl_insert }, /* K */ { ISFUNC, rl_insert }, /* L */ { ISFUNC, rl_insert }, /* M */ { ISFUNC, rl_insert }, /* N */ { ISFUNC, rl_insert }, /* O */ { ISFUNC, rl_insert }, /* P */ { ISFUNC, rl_insert }, /* Q */ { ISFUNC, rl_insert }, /* R */ { ISFUNC, rl_insert }, /* S */ { ISFUNC, rl_insert }, /* T */ { ISFUNC, rl_insert }, /* U */ { ISFUNC, rl_insert }, /* V */ { ISFUNC, rl_insert }, /* W */ { ISFUNC, rl_insert }, /* X */ { ISFUNC, rl_insert }, /* Y */ { ISFUNC, rl_insert }, /* Z */ /* Some more punctuation. */ { ISFUNC, rl_insert }, /* [ */ { ISFUNC, rl_insert }, /* \ */ { ISFUNC, rl_insert }, /* ] */ { ISFUNC, rl_insert }, /* ^ */ { ISFUNC, rl_insert }, /* _ */ { ISFUNC, rl_insert }, /* ` */ /* Lowercase alphabet. */ { ISFUNC, rl_insert }, /* a */ { ISFUNC, rl_insert }, /* b */ { ISFUNC, rl_insert }, /* c */ { ISFUNC, rl_insert }, /* d */ { ISFUNC, rl_insert }, /* e */ { ISFUNC, rl_insert }, /* f */ { ISFUNC, rl_insert }, /* g */ { ISFUNC, rl_insert }, /* h */ { ISFUNC, rl_insert }, /* i */ { ISFUNC, rl_insert }, /* j */ { ISFUNC, rl_insert }, /* k */ { ISFUNC, rl_insert }, /* l */ { ISFUNC, rl_insert }, /* m */ { ISFUNC, rl_insert }, /* n */ { ISFUNC, rl_insert }, /* o */ { ISFUNC, rl_insert }, /* p */ { ISFUNC, rl_insert }, /* q */ { ISFUNC, rl_insert }, /* r */ { ISFUNC, rl_insert }, /* s */ { ISFUNC, rl_insert }, /* t */ { ISFUNC, rl_insert }, /* u */ { ISFUNC, rl_insert }, /* v */ { ISFUNC, rl_insert }, /* w */ { ISFUNC, rl_insert }, /* x */ { ISFUNC, rl_insert }, /* y */ { ISFUNC, rl_insert }, /* z */ /* Final punctuation. */ { ISFUNC, rl_insert }, /* { */ { ISFUNC, rl_insert }, /* | */ { ISFUNC, rl_insert }, /* } */ { ISFUNC, rl_insert }, /* ~ */ { ISFUNC, rl_rubout }, /* RUBOUT */ #if KEYMAP_SIZE > 128 /* Pure 8-bit characters (128 - 159). These might be used in some character sets. */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ { ISFUNC, rl_insert }, /* ? */ /* ISO Latin-1 characters (160 - 255) */ { ISFUNC, rl_insert }, /* No-break space */ { ISFUNC, rl_insert }, /* Inverted exclamation mark */ { ISFUNC, rl_insert }, /* Cent sign */ { ISFUNC, rl_insert }, /* Pound sign */ { ISFUNC, rl_insert }, /* Currency sign */ { ISFUNC, rl_insert }, /* Yen sign */ { ISFUNC, rl_insert }, /* Broken bar */ { ISFUNC, rl_insert }, /* Section sign */ { ISFUNC, rl_insert }, /* Diaeresis */ { ISFUNC, rl_insert }, /* Copyright sign */ { ISFUNC, rl_insert }, /* Feminine ordinal indicator */ { ISFUNC, rl_insert }, /* Left pointing double angle quotation mark */ { ISFUNC, rl_insert }, /* Not sign */ { ISFUNC, rl_insert }, /* Soft hyphen */ { ISFUNC, rl_insert }, /* Registered sign */ { ISFUNC, rl_insert }, /* Macron */ { ISFUNC, rl_insert }, /* Degree sign */ { ISFUNC, rl_insert }, /* Plus-minus sign */ { ISFUNC, rl_insert }, /* Superscript two */ { ISFUNC, rl_insert }, /* Superscript three */ { ISFUNC, rl_insert }, /* Acute accent */ { ISFUNC, rl_insert }, /* Micro sign */ { ISFUNC, rl_insert }, /* Pilcrow sign */ { ISFUNC, rl_insert }, /* Middle dot */ { ISFUNC, rl_insert }, /* Cedilla */ { ISFUNC, rl_insert }, /* Superscript one */ { ISFUNC, rl_insert }, /* Masculine ordinal indicator */ { ISFUNC, rl_insert }, /* Right pointing double angle quotation mark */ { ISFUNC, rl_insert }, /* Vulgar fraction one quarter */ { ISFUNC, rl_insert }, /* Vulgar fraction one half */ { ISFUNC, rl_insert }, /* Vulgar fraction three quarters */ { ISFUNC, rl_insert }, /* Inverted questionk mark */ { ISFUNC, rl_insert }, /* Latin capital letter a with grave */ { ISFUNC, rl_insert }, /* Latin capital letter a with acute */ { ISFUNC, rl_insert }, /* Latin capital letter a with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter a with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter a with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter a with ring above */ { ISFUNC, rl_insert }, /* Latin capital letter ae */ { ISFUNC, rl_insert }, /* Latin capital letter c with cedilla */ { ISFUNC, rl_insert }, /* Latin capital letter e with grave */ { ISFUNC, rl_insert }, /* Latin capital letter e with acute */ { ISFUNC, rl_insert }, /* Latin capital letter e with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter e with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter i with grave */ { ISFUNC, rl_insert }, /* Latin capital letter i with acute */ { ISFUNC, rl_insert }, /* Latin capital letter i with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter i with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter eth (Icelandic) */ { ISFUNC, rl_insert }, /* Latin capital letter n with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter o with grave */ { ISFUNC, rl_insert }, /* Latin capital letter o with acute */ { ISFUNC, rl_insert }, /* Latin capital letter o with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter o with tilde */ { ISFUNC, rl_insert }, /* Latin capital letter o with diaeresis */ { ISFUNC, rl_insert }, /* Multiplication sign */ { ISFUNC, rl_insert }, /* Latin capital letter o with stroke */ { ISFUNC, rl_insert }, /* Latin capital letter u with grave */ { ISFUNC, rl_insert }, /* Latin capital letter u with acute */ { ISFUNC, rl_insert }, /* Latin capital letter u with circumflex */ { ISFUNC, rl_insert }, /* Latin capital letter u with diaeresis */ { ISFUNC, rl_insert }, /* Latin capital letter Y with acute */ { ISFUNC, rl_insert }, /* Latin capital letter thorn (Icelandic) */ { ISFUNC, rl_insert }, /* Latin small letter sharp s (German) */ { ISFUNC, rl_insert }, /* Latin small letter a with grave */ { ISFUNC, rl_insert }, /* Latin small letter a with acute */ { ISFUNC, rl_insert }, /* Latin small letter a with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter a with tilde */ { ISFUNC, rl_insert }, /* Latin small letter a with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter a with ring above */ { ISFUNC, rl_insert }, /* Latin small letter ae */ { ISFUNC, rl_insert }, /* Latin small letter c with cedilla */ { ISFUNC, rl_insert }, /* Latin small letter e with grave */ { ISFUNC, rl_insert }, /* Latin small letter e with acute */ { ISFUNC, rl_insert }, /* Latin small letter e with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter e with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter i with grave */ { ISFUNC, rl_insert }, /* Latin small letter i with acute */ { ISFUNC, rl_insert }, /* Latin small letter i with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter i with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter eth (Icelandic) */ { ISFUNC, rl_insert }, /* Latin small letter n with tilde */ { ISFUNC, rl_insert }, /* Latin small letter o with grave */ { ISFUNC, rl_insert }, /* Latin small letter o with acute */ { ISFUNC, rl_insert }, /* Latin small letter o with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter o with tilde */ { ISFUNC, rl_insert }, /* Latin small letter o with diaeresis */ { ISFUNC, rl_insert }, /* Division sign */ { ISFUNC, rl_insert }, /* Latin small letter o with stroke */ { ISFUNC, rl_insert }, /* Latin small letter u with grave */ { ISFUNC, rl_insert }, /* Latin small letter u with acute */ { ISFUNC, rl_insert }, /* Latin small letter u with circumflex */ { ISFUNC, rl_insert }, /* Latin small letter u with diaeresis */ { ISFUNC, rl_insert }, /* Latin small letter y with acute */ { ISFUNC, rl_insert }, /* Latin small letter thorn (Icelandic) */ { ISFUNC, rl_insert } /* Latin small letter y with diaeresis */ #endif /* KEYMAP_SIZE > 128 */ }; KEYMAP_ENTRY_ARRAY vi_escape_keymap = { /* The regular control keys come first. */ { ISFUNC, (Function *)0x0 }, /* Control-@ */ { ISFUNC, (Function *)0x0 }, /* Control-a */ { ISFUNC, (Function *)0x0 }, /* Control-b */ { ISFUNC, (Function *)0x0 }, /* Control-c */ { ISFUNC, (Function *)0x0 }, /* Control-d */ { ISFUNC, (Function *)0x0 }, /* Control-e */ { ISFUNC, (Function *)0x0 }, /* Control-f */ { ISFUNC, (Function *)0x0 }, /* Control-g */ { ISFUNC, (Function *)0x0 }, /* Control-h */ { ISFUNC, rl_tab_insert}, /* Control-i */ { ISFUNC, rl_emacs_editing_mode}, /* Control-j */ { ISFUNC, rl_kill_line }, /* Control-k */ { ISFUNC, (Function *)0x0 }, /* Control-l */ { ISFUNC, rl_emacs_editing_mode}, /* Control-m */ { ISFUNC, (Function *)0x0 }, /* Control-n */ { ISFUNC, (Function *)0x0 }, /* Control-o */ { ISFUNC, (Function *)0x0 }, /* Control-p */ { ISFUNC, (Function *)0x0 }, /* Control-q */ { ISFUNC, (Function *)0x0 }, /* Control-r */ { ISFUNC, (Function *)0x0 }, /* Control-s */ { ISFUNC, (Function *)0x0 }, /* Control-t */ { ISFUNC, (Function *)0x0 }, /* Control-u */ { ISFUNC, (Function *)0x0 }, /* Control-v */ { ISFUNC, (Function *)0x0 }, /* Control-w */ { ISFUNC, (Function *)0x0 }, /* Control-x */ { ISFUNC, (Function *)0x0 }, /* Control-y */ { ISFUNC, (Function *)0x0 }, /* Control-z */ { ISFUNC, rl_vi_movement_mode }, /* Control-[ */ { ISFUNC, (Function *)0x0 }, /* Control-\ */ { ISFUNC, (Function *)0x0 }, /* Control-] */ { ISFUNC, (Function *)0x0 }, /* Control-^ */ { ISFUNC, rl_undo_command }, /* Control-_ */ /* The start of printing characters. */ { ISFUNC, (Function *)0x0 }, /* SPACE */ { ISFUNC, (Function *)0x0 }, /* ! */ { ISFUNC, (Function *)0x0 }, /* " */ { ISFUNC, (Function *)0x0 }, /* # */ { ISFUNC, (Function *)0x0 }, /* $ */ { ISFUNC, (Function *)0x0 }, /* % */ { ISFUNC, (Function *)0x0 }, /* & */ { ISFUNC, (Function *)0x0 }, /* ' */ { ISFUNC, (Function *)0x0 }, /* ( */ { ISFUNC, (Function *)0x0 }, /* ) */ { ISFUNC, (Function *)0x0 }, /* * */ { ISFUNC, (Function *)0x0 }, /* + */ { ISFUNC, (Function *)0x0 }, /* , */ { ISFUNC, (Function *)0x0 }, /* - */ { ISFUNC, (Function *)0x0 }, /* . */ { ISFUNC, (Function *)0x0 }, /* / */ /* Regular digits. */ { ISFUNC, rl_vi_arg_digit }, /* 0 */ { ISFUNC, rl_vi_arg_digit }, /* 1 */ { ISFUNC, rl_vi_arg_digit }, /* 2 */ { ISFUNC, rl_vi_arg_digit }, /* 3 */ { ISFUNC, rl_vi_arg_digit }, /* 4 */ { ISFUNC, rl_vi_arg_digit }, /* 5 */ { ISFUNC, rl_vi_arg_digit }, /* 6 */ { ISFUNC, rl_vi_arg_digit }, /* 7 */ { ISFUNC, rl_vi_arg_digit }, /* 8 */ { ISFUNC, rl_vi_arg_digit }, /* 9 */ /* A little more punctuation. */ { ISFUNC, (Function *)0x0 }, /* : */ { ISFUNC, (Function *)0x0 }, /* ; */ { ISFUNC, (Function *)0x0 }, /* < */ { ISFUNC, (Function *)0x0 }, /* = */ { ISFUNC, (Function *)0x0 }, /* > */ { ISFUNC, (Function *)0x0 }, /* ? */ { ISFUNC, (Function *)0x0 }, /* @ */ /* Uppercase alphabet. */ { ISFUNC, rl_do_lowercase_version }, /* A */ { ISFUNC, rl_do_lowercase_version }, /* B */ { ISFUNC, rl_do_lowercase_version }, /* C */ { ISFUNC, rl_do_lowercase_version }, /* D */ { ISFUNC, rl_do_lowercase_version }, /* E */ { ISFUNC, rl_do_lowercase_version }, /* F */ { ISFUNC, rl_do_lowercase_version }, /* G */ { ISFUNC, rl_do_lowercase_version }, /* H */ { ISFUNC, rl_do_lowercase_version }, /* I */ { ISFUNC, rl_do_lowercase_version }, /* J */ { ISFUNC, rl_do_lowercase_version }, /* K */ { ISFUNC, rl_do_lowercase_version }, /* L */ { ISFUNC, rl_do_lowercase_version }, /* M */ { ISFUNC, rl_do_lowercase_version }, /* N */ { ISFUNC, rl_do_lowercase_version }, /* O */ { ISFUNC, rl_do_lowercase_version }, /* P */ { ISFUNC, rl_do_lowercase_version }, /* Q */ { ISFUNC, rl_do_lowercase_version }, /* R */ { ISFUNC, rl_do_lowercase_version }, /* S */ { ISFUNC, rl_do_lowercase_version }, /* T */ { ISFUNC, rl_do_lowercase_version }, /* U */ { ISFUNC, rl_do_lowercase_version }, /* V */ { ISFUNC, rl_do_lowercase_version }, /* W */ { ISFUNC, rl_do_lowercase_version }, /* X */ { ISFUNC, rl_do_lowercase_version }, /* Y */ { ISFUNC, rl_do_lowercase_version }, /* Z */ /* Some more punctuation. */ { ISFUNC, rl_arrow_keys }, /* [ */ { ISFUNC, (Function *)0x0 }, /* \ */ { ISFUNC, (Function *)0x0 }, /* ] */ { ISFUNC, (Function *)0x0 }, /* ^ */ { ISFUNC, (Function *)0x0 }, /* _ */ { ISFUNC, (Function *)0x0 }, /* ` */ /* Lowercase alphabet. */ { ISFUNC, (Function *)0x0 }, /* a */ { ISFUNC, (Function *)0x0 }, /* b */ { ISFUNC, (Function *)0x0 }, /* c */ { ISFUNC, (Function *)0x0 }, /* d */ { ISFUNC, (Function *)0x0 }, /* e */ { ISFUNC, (Function *)0x0 }, /* f */ { ISFUNC, (Function *)0x0 }, /* g */ { ISFUNC, (Function *)0x0 }, /* h */ { ISFUNC, (Function *)0x0 }, /* i */ { ISFUNC, (Function *)0x0 }, /* j */ { ISFUNC, (Function *)0x0 }, /* k */ { ISFUNC, (Function *)0x0 }, /* l */ { ISFUNC, (Function *)0x0 }, /* m */ { ISFUNC, (Function *)0x0 }, /* n */ { ISFUNC, rl_arrow_keys }, /* o */ { ISFUNC, (Function *)0x0 }, /* p */ { ISFUNC, (Function *)0x0 }, /* q */ { ISFUNC, (Function *)0x0 }, /* r */ { ISFUNC, (Function *)0x0 }, /* s */ { ISFUNC, (Function *)0x0 }, /* t */ { ISFUNC, (Function *)0x0 }, /* u */ { ISFUNC, (Function *)0x0 }, /* v */ { ISFUNC, (Function *)0x0 }, /* w */ { ISFUNC, (Function *)0x0 }, /* x */ { ISFUNC, (Function *)0x0 }, /* y */ { ISFUNC, (Function *)0x0 }, /* z */ /* Final punctuation. */ { ISFUNC, (Function *)0x0 }, /* { */ { ISFUNC, (Function *)0x0 }, /* | */ { ISFUNC, (Function *)0x0 }, /* } */ { ISFUNC, (Function *)0x0 }, /* ~ */ { ISFUNC, rl_backward_kill_word }, /* RUBOUT */ #if KEYMAP_SIZE > 128 /* Undefined keys. */ { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 }, { ISFUNC, (Function *)0x0 } #endif /* KEYMAP_SIZE > 128 */ }; octave-1.1.0/readline/vi_mode.c100666 415 17 64243 5521547745 14557 0ustar jweusers/* vi_mode.c -- A vi emulation mode for Bash. Derived from code written by Jeff Sparkes (jsparkes@bnr.ca). */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* **************************************************************** */ /* */ /* VI Emulation Mode */ /* */ /* **************************************************************** */ #if defined (VI_MODE) #include #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ #if defined (STATIC_MALLOC) static char *xmalloc (), *xrealloc (); #else extern char *xmalloc (), *xrealloc (); #endif /* STATIC_MALLOC */ #include /* Some standard library routines. */ #include "rldefs.h" #include "readline.h" #include "history.h" #ifndef digit #define digit(c) ((c) >= '0' && (c) <= '9') #endif #ifndef isletter #define isletter(c) (((c) >= 'A' && (c) <= 'Z') || ((c) >= 'a' && (c) <= 'z')) #endif #ifndef digit_value #define digit_value(c) ((c) - '0') #endif #ifndef member #define member(c, s) ((c) ? (char *)strchr ((s), (c)) : 0) #endif #ifndef isident #define isident(c) ((isletter(c) || digit(c) || c == '_')) #endif #ifndef exchange #define exchange(x, y) {int temp = x; x = y; y = temp;} #endif #ifndef VI_COMMENT_BEGIN_DEFAULT #define VI_COMMENT_BEGIN_DEFAULT "#" #endif /* Variables imported from readline.c */ extern int rl_point, rl_end, rl_mark, rl_done; extern FILE *rl_instream; extern int rl_line_buffer_len, rl_explicit_arg, rl_numeric_arg; extern Keymap _rl_keymap; extern char *rl_prompt; extern char *rl_line_buffer; extern int rl_arg_sign; extern void rl_extend_line_buffer (); extern int rl_vi_check (), rl_digit_loop1 (); /* Non-zero means enter insertion mode. */ int _rl_vi_doing_insert = 0; /* String inserted into the line by rl_vi_comment (). */ char *rl_vi_comment_begin = (char *)NULL; /* *** UNCLEAN *** */ /* Command keys which do movement for xxx_to commands. */ static char *vi_motion = " hl^$0ftFt;,%wbeWBE|"; /* Keymap used for vi replace characters. Created dynamically since rarely used. */ static Keymap vi_replace_map = (Keymap)NULL; /* The number of characters inserted in the last replace operation. */ static int vi_replace_count = 0; /* Defined in this file */ int rl_vi_char_search (); /* Defined in display.c */ extern int rl_message (), rl_clear_message (); extern void rl_redisplay (); /* Defined in complete.c */ extern int rl_complete_internal (); int _rl_vi_last_command = 'i'; /* default `.' puts you in insert mode */ int _rl_vi_last_repeat = 1; int _rl_vi_last_arg_sign = 1; static int _rl_vi_last_motion = 0; static int _rl_vi_last_search_char = 0; static int _rl_vi_last_replacement = 0; static int vi_redoing = 0; /* Text modification commands. These are the `redoable' commands. */ static char *vi_textmod = "_*\\AaIiCcDdPpYyRrSsXx~"; void rl_vi_set_last () { _rl_vi_last_command = 'i'; _rl_vi_last_repeat = 1; _rl_vi_last_arg_sign = 1; _rl_vi_last_motion = 0; } /* Is the command C a VI mode text modification command? */ int rl_vi_textmod_command (c) int c; { return (member (c, vi_textmod) != (char *)NULL); } /* Bound to `.'. Called from command mode, so we know that we have to redo a text modification command. The default for _rl_vi_last_command puts you back into insert mode. */ int rl_vi_redo (count, c) int count, c; { if (!rl_explicit_arg) { rl_numeric_arg = _rl_vi_last_repeat; rl_arg_sign = _rl_vi_last_arg_sign; } vi_redoing = 1; rl_dispatch (_rl_vi_last_command, _rl_keymap); vi_redoing = 0; return (0); } /* Yank the nth arg from the previous line into this line at point. */ int rl_vi_yank_arg (count) int count; { /* vi mode is defined to insert a space before the last argument. */ rl_insert (1, ' '); /* Readline thinks that the first word on a line is the 0th, while vi thinks the first word on a line is the 1st. Compensate. */ if (rl_explicit_arg) rl_yank_nth_arg (count - 1, 0); else rl_yank_nth_arg ('$', 0); rl_vi_insertion_mode (); return (0); } /* With an argument, move back that many history lines, else move to the beginning of history. */ int rl_vi_fetch_history (count, c) int count, c; { int current = where_history (); /* Giving an argument of n means we want the nth command in the history file. The command number is interpreted the same way that the bash `history' command does it -- that is, giving an argument count of 450 to this command would get the command listed as number 450 in the output of `history'. */ if (rl_explicit_arg) { int wanted = history_base + current - count; if (wanted <= 0) rl_beginning_of_history (0, 0); else rl_get_previous_history (wanted); } else rl_beginning_of_history (count, 0); return (0); } /* Search again for the last thing searched for. */ int rl_vi_search_again (count, key) int count, key; { switch (key) { case 'n': rl_noninc_reverse_search_again (count, key); break; case 'N': rl_noninc_forward_search_again (count, key); break; } return (0); } /* Do a vi style search. */ int rl_vi_search (count, key) int count, key; { switch (key) { case '?': rl_noninc_forward_search (count, key); break; case '/': rl_noninc_reverse_search (count, key); break; default: ding (); break; } return (0); } /* Completion, from vi's point of view. */ int rl_vi_complete (ignore, key) int ignore, key; { if ((rl_point < rl_end) && (!whitespace (rl_line_buffer[rl_point]))) { if (!whitespace (rl_line_buffer[rl_point + 1])) rl_vi_end_word (1, 'E'); rl_point++; } if (key == '*') rl_complete_internal ('*'); /* Expansion and replacement. */ else if (key == '=') rl_complete_internal ('?'); /* List possible completions. */ else if (key == '\\') rl_complete_internal (TAB); /* Standard Readline completion. */ else rl_complete (0, key); if (key == '*' || key == '\\') rl_vi_insertion_mode (); return (0); } /* Tilde expansion for vi mode. */ int rl_vi_tilde_expand (ignore, key) int ignore, key; { rl_tilde_expand (0, key); rl_vi_insertion_mode (); return (0); } /* Previous word in vi mode. */ int rl_vi_prev_word (count, key) int count, key; { if (count < 0) return (rl_vi_next_word (-count, key)); if (rl_point == 0) { ding (); return (0); } if (uppercase_p (key)) rl_vi_bWord (count); else rl_vi_bword (count); return (0); } /* Next word in vi mode. */ int rl_vi_next_word (count, key) int count, key; { if (count < 0) return (rl_vi_prev_word (-count, key)); if (rl_point >= (rl_end - 1)) { ding (); return (0); } if (uppercase_p (key)) rl_vi_fWord (count); else rl_vi_fword (count); return (0); } /* Move to the end of the ?next? word. */ int rl_vi_end_word (count, key) int count, key; { if (count < 0) { ding (); return -1; } if (uppercase_p (key)) rl_vi_eWord (count); else rl_vi_eword (count); return (0); } /* Move forward a word the way that 'W' does. */ int rl_vi_fWord (count) int count; { while (count-- && rl_point < (rl_end - 1)) { /* Skip until whitespace. */ while (!whitespace (rl_line_buffer[rl_point]) && rl_point < rl_end) rl_point++; /* Now skip whitespace. */ while (whitespace (rl_line_buffer[rl_point]) && rl_point < rl_end) rl_point++; } return (0); } int rl_vi_bWord (count) int count; { while (count-- && rl_point > 0) { /* If we are at the start of a word, move back to whitespace so we will go back to the start of the previous word. */ if (!whitespace (rl_line_buffer[rl_point]) && whitespace (rl_line_buffer[rl_point - 1])) rl_point--; while (rl_point > 0 && whitespace (rl_line_buffer[rl_point])) rl_point--; if (rl_point > 0) { while (--rl_point >= 0 && !whitespace (rl_line_buffer[rl_point])); rl_point++; } } return (0); } int rl_vi_eWord (count) int count; { while (count-- && rl_point < (rl_end - 1)) { if (!whitespace (rl_line_buffer[rl_point])) rl_point++; /* Move to the next non-whitespace character (to the start of the next word). */ while (++rl_point < rl_end && whitespace (rl_line_buffer[rl_point])); if (rl_point && rl_point < rl_end) { /* Skip whitespace. */ while (rl_point < rl_end && whitespace (rl_line_buffer[rl_point])) rl_point++; /* Skip until whitespace. */ while (rl_point < rl_end && !whitespace (rl_line_buffer[rl_point])) rl_point++; /* Move back to the last character of the word. */ rl_point--; } } return (0); } int rl_vi_fword (count) int count; { while (count-- && rl_point < (rl_end - 1)) { /* Move to white space (really non-identifer). */ if (isident (rl_line_buffer[rl_point])) { while (isident (rl_line_buffer[rl_point]) && rl_point < rl_end) rl_point++; } else /* if (!whitespace (rl_line_buffer[rl_point])) */ { while (!isident (rl_line_buffer[rl_point]) && !whitespace (rl_line_buffer[rl_point]) && rl_point < rl_end) rl_point++; } /* Move past whitespace. */ while (whitespace (rl_line_buffer[rl_point]) && rl_point < rl_end) rl_point++; } return (0); } int rl_vi_bword (count) int count; { while (count-- && rl_point > 0) { int last_is_ident; /* If we are at the start of a word, move back to whitespace so we will go back to the start of the previous word. */ if (!whitespace (rl_line_buffer[rl_point]) && whitespace (rl_line_buffer[rl_point - 1])) rl_point--; /* If this character and the previous character are `opposite', move back so we don't get messed up by the rl_point++ down there in the while loop. Without this code, words like `l;' screw up the function. */ last_is_ident = isident (rl_line_buffer[rl_point - 1]); if ((isident (rl_line_buffer[rl_point]) && !last_is_ident) || (!isident (rl_line_buffer[rl_point]) && last_is_ident)) rl_point--; while (rl_point > 0 && whitespace (rl_line_buffer[rl_point])) rl_point--; if (rl_point > 0) { if (isident (rl_line_buffer[rl_point])) while (--rl_point >= 0 && isident (rl_line_buffer[rl_point])); else while (--rl_point >= 0 && !isident (rl_line_buffer[rl_point]) && !whitespace (rl_line_buffer[rl_point])); rl_point++; } } return (0); } int rl_vi_eword (count) int count; { while (count-- && rl_point < rl_end - 1) { if (!whitespace (rl_line_buffer[rl_point])) rl_point++; while (rl_point < rl_end && whitespace (rl_line_buffer[rl_point])) rl_point++; if (rl_point < rl_end) { if (isident (rl_line_buffer[rl_point])) while (++rl_point < rl_end && isident (rl_line_buffer[rl_point])); else while (++rl_point < rl_end && !isident (rl_line_buffer[rl_point]) && !whitespace (rl_line_buffer[rl_point])); } rl_point--; } return (0); } int rl_vi_insert_beg () { rl_beg_of_line (); rl_vi_insertion_mode (); return (0); } int rl_vi_append_mode () { if (rl_point < rl_end) rl_point += 1; rl_vi_insertion_mode (); return (0); } int rl_vi_append_eol () { rl_end_of_line (); rl_vi_append_mode (); return (0); } /* What to do in the case of C-d. */ int rl_vi_eof_maybe (count, c) int count, c; { return (rl_newline (1, '\n')); } /* Insertion mode stuff. */ /* Switching from one mode to the other really just involves switching keymaps. */ int rl_vi_insertion_mode () { _rl_keymap = vi_insertion_keymap; return (0); } int vi_done_inserting () { if (_rl_vi_doing_insert) { rl_end_undo_group (); _rl_vi_doing_insert = 0; } return (0); } int rl_vi_movement_mode () { if (rl_point > 0) rl_backward (1); rl_vi_set_last (); _rl_keymap = vi_movement_keymap; vi_done_inserting (); return (0); } int rl_vi_arg_digit (count, c) int count, c; { if (c == '0' && rl_numeric_arg == 1 && !rl_explicit_arg) return (rl_beg_of_line ()); else return (rl_digit_argument (count, c)); } int rl_vi_change_case (count, ignore) int count, ignore; { char c = 0; /* Don't try this on an empty line. */ if (rl_point >= rl_end) return (0); while (count-- && rl_point < rl_end) { if (uppercase_p (rl_line_buffer[rl_point])) c = to_lower (rl_line_buffer[rl_point]); else if (lowercase_p (rl_line_buffer[rl_point])) c = to_upper (rl_line_buffer[rl_point]); else { /* Just skip over characters neither upper nor lower case. */ rl_forward (1); continue; } /* Vi is kind of strange here. */ if (c) { rl_begin_undo_group (); rl_delete (1, c); rl_insert (1, c); rl_end_undo_group (); rl_vi_check (); } else rl_forward (1); } return (0); } int rl_vi_put (count, key) int count, key; { if (!uppercase_p (key) && (rl_point + 1 <= rl_end)) rl_point++; rl_yank (); rl_backward (1); return (0); } int rl_vi_check () { if (rl_point && rl_point == rl_end) rl_point--; return (0); } int rl_vi_column (count) int count; { if (count > rl_end) rl_end_of_line (); else rl_point = count - 1; return (0); } int rl_vi_domove (key, nextkey) int key, *nextkey; { int c, save; int old_end; rl_mark = rl_point; c = rl_read_key (); *nextkey = c; if (!member (c, vi_motion)) { if (digit (c)) { save = rl_numeric_arg; rl_numeric_arg = digit_value (c); rl_digit_loop1 (); rl_numeric_arg *= save; c = rl_read_key (); /* real command */ *nextkey = c; } else if ((key == 'd' && c == 'd') || (key == 'y' && c == 'y') || (key == 'c' && c == 'c')) { rl_mark = rl_end; rl_beg_of_line (); _rl_vi_last_motion = c; return (0); } else return (-1); } _rl_vi_last_motion = c; /* Append a blank character temporarily so that the motion routines work right at the end of the line. */ old_end = rl_end; rl_line_buffer[rl_end++] = ' '; rl_line_buffer[rl_end] = '\0'; rl_dispatch (c, _rl_keymap); /* Remove the blank that we added. */ rl_end = old_end; rl_line_buffer[rl_end] = '\0'; if (rl_point > rl_end) rl_point = rl_end; /* No change in position means the command failed. */ if (rl_mark == rl_point) return (-1); /* rl_vi_f[wW]ord () leaves the cursor on the first character of the next word. If we are not at the end of the line, and we are on a non-whitespace character, move back one (presumably to whitespace). */ if ((c == 'w' || c == 'W') && (rl_point < rl_end) && !whitespace (rl_line_buffer[rl_point])) rl_point--; /* If cw or cW, back up to the end of a word, so the behaviour of ce or cE is the actual result. Brute-force, no subtlety. */ if (key == 'c' && (to_upper (c) == 'W')) { while (rl_point && whitespace (rl_line_buffer[rl_point])) rl_point--; /* Move past the end of the word so that the kill doesn't remove the last letter of the previous word. Only do this if we are not at the end of the line. */ if ((rl_point >= 0) && (rl_point < (rl_end - 1)) && !whitespace (rl_line_buffer[rl_point])) rl_point++; } if (rl_mark < rl_point) exchange (rl_point, rl_mark); return (0); } /* A simplified loop for vi. Don't dispatch key at end. Don't recognize minus sign? */ int rl_digit_loop1 () { int key, c; while (1) { rl_message ("(arg: %d) ", rl_arg_sign * rl_numeric_arg, 0); key = c = rl_read_key (); if (_rl_keymap[c].type == ISFUNC && _rl_keymap[c].function == rl_universal_argument) { rl_numeric_arg *= 4; continue; } c = UNMETA (c); if (numeric (c)) { if (rl_explicit_arg) rl_numeric_arg = (rl_numeric_arg * 10) + digit_value (c); else rl_numeric_arg = digit_value (c); rl_explicit_arg = 1; } else { rl_clear_message (); rl_stuff_char (key); break; } } return (0); } int rl_vi_delete_to (count, key) int count, key; { int c; if (uppercase_p (key)) rl_stuff_char ('$'); else if (vi_redoing) rl_stuff_char (_rl_vi_last_motion); if (rl_vi_domove (key, &c)) { ding (); return -1; } /* These are the motion commands that do not require adjusting the mark. */ if ((strchr (" l|h^0%bB", c) == 0) && (rl_mark < rl_end)) rl_mark++; rl_kill_text (rl_point, rl_mark); return (0); } int rl_vi_change_to (count, key) int count, key; { int c, start_pos; if (uppercase_p (key)) rl_stuff_char ('$'); else if (vi_redoing) rl_stuff_char (_rl_vi_last_motion); start_pos = rl_point; if (rl_vi_domove (key, &c)) { ding (); return -1; } /* These are the motion commands that do not require adjusting the mark. c[wW] are handled by special-case code in rl_vi_domove(), and already leave the mark at the correct location. */ if ((strchr (" l|hwW^0%bB", c) == 0) && (rl_mark < rl_end)) rl_mark++; /* The cursor never moves with c[wW]. */ if ((to_upper (c) == 'W') && rl_point < start_pos) rl_point = start_pos; rl_begin_undo_group (); _rl_vi_doing_insert = 1; rl_kill_text (rl_point, rl_mark); rl_vi_insertion_mode (); return (0); } int rl_vi_yank_to (count, key) int count, key; { int c, save = rl_point; if (uppercase_p (key)) rl_stuff_char ('$'); if (rl_vi_domove (key, &c)) { ding (); return -1; } /* These are the motion commands that do not require adjusting the mark. */ if ((strchr (" l|h^0%bB", c) == 0) && (rl_mark < rl_end)) rl_mark++; rl_begin_undo_group (); rl_kill_text (rl_point, rl_mark); rl_end_undo_group (); rl_do_undo (); rl_point = save; return (0); } int rl_vi_delete (count) int count; { int end; if (rl_end == 0) { ding (); return -1; } end = rl_point + count; if (end >= rl_end) end = rl_end; rl_kill_text (rl_point, end); if (rl_point > 0 && rl_point == rl_end) rl_backward (1); return (0); } /* Turn the current line into a comment in shell history. A K*rn shell style function. */ int rl_vi_comment () { rl_beg_of_line (); if (rl_vi_comment_begin != (char *)NULL) rl_insert_text (rl_vi_comment_begin); else rl_insert_text (VI_COMMENT_BEGIN_DEFAULT); /* Default. */ rl_redisplay (); rl_newline (1, '\010'); return (0); } int rl_back_to_indent (ignore1, ignore2) int ignore1, ignore2; { rl_beg_of_line (); while (rl_point < rl_end && whitespace (rl_line_buffer[rl_point])) rl_point++; return (0); } int rl_vi_first_print () { return (rl_back_to_indent ()); } /* NOTE: it is necessary that opposite directions are inverses */ #define FTO 1 /* forward to */ #define BTO -1 /* backward to */ #define FFIND 2 /* forward find */ #define BFIND -2 /* backward find */ int rl_vi_char_search (count, key) int count, key; { static char target; static int orig_dir, dir; int pos; if (key == ';' || key == ',') dir = (key == ';' ? orig_dir : -orig_dir); else { if (vi_redoing) target = _rl_vi_last_search_char; else _rl_vi_last_search_char = target = rl_getc (rl_instream); switch (key) { case 't': orig_dir = dir = FTO; break; case 'T': orig_dir = dir = BTO; break; case 'f': orig_dir = dir = FFIND; break; case 'F': orig_dir = dir = BFIND; break; } } pos = rl_point; while (count--) { if (dir < 0) { if (pos == 0) { ding (); return 0; } pos--; do { if (rl_line_buffer[pos] == target) { if (dir == BTO) rl_point = pos + 1; else rl_point = pos; break; } } while (pos--); if (pos < 0) { ding (); return -1; } } else { /* dir > 0 */ if (pos >= rl_end) { ding (); return -1; } pos++; do { if (rl_line_buffer[pos] == target) { if (dir == FTO) rl_point = pos - 1; else rl_point = pos; break; } } while (++pos < rl_end); if (pos >= (rl_end - 1)) { ding (); return -1; } } } return (0); } /* Match brackets */ int rl_vi_match () { int count = 1, brack, pos; pos = rl_point; if ((brack = rl_vi_bracktype (rl_line_buffer[rl_point])) == 0) { while ((brack = rl_vi_bracktype (rl_line_buffer[rl_point])) == 0 && rl_point < rl_end - 1) rl_forward (1); if (brack <= 0) { rl_point = pos; ding (); return -1; } } pos = rl_point; if (brack < 0) { while (count) { if (--pos >= 0) { int b = rl_vi_bracktype (rl_line_buffer[pos]); if (b == -brack) count--; else if (b == brack) count++; } else { ding (); return -1; } } } else { /* brack > 0 */ while (count) { if (++pos < rl_end) { int b = rl_vi_bracktype (rl_line_buffer[pos]); if (b == -brack) count--; else if (b == brack) count++; } else { ding (); return -1; } } } rl_point = pos; return (0); } int rl_vi_bracktype (c) int c; { switch (c) { case '(': return 1; case ')': return -1; case '[': return 2; case ']': return -2; case '{': return 3; case '}': return -3; default: return 0; } } int rl_vi_change_char (count, key) int count, key; { int c; if (vi_redoing) c = _rl_vi_last_replacement; else _rl_vi_last_replacement = c = rl_getc (rl_instream); if (c == '\033' || c == CTRL ('C')) return -1; while (count-- && rl_point < rl_end) { rl_begin_undo_group (); rl_delete (1, c); rl_insert (1, c); if (count == 0) rl_backward (1); rl_end_undo_group (); } return (0); } int rl_vi_subst (count, key) int count, key; { rl_begin_undo_group (); _rl_vi_doing_insert = 1; if (uppercase_p (key)) { rl_beg_of_line (); rl_kill_line (1); } else rl_delete (count, key); rl_end_undo_group (); rl_vi_insertion_mode (); return (0); } int rl_vi_overstrike (count, key) int count, key; { int i; if (_rl_vi_doing_insert == 0) { _rl_vi_doing_insert = 1; rl_begin_undo_group (); } for (i = 0; i < count; i++) { vi_replace_count++; rl_begin_undo_group (); if (rl_point < rl_end) { rl_delete (1, key); rl_insert (1, key); } else rl_insert (1, key); rl_end_undo_group (); } return (0); } int rl_vi_overstrike_delete (count) int count; { int i, s; for (i = 0; i < count; i++) { if (vi_replace_count == 0) { ding (); break; } s = rl_point; if (rl_do_undo ()) vi_replace_count--; if (rl_point == s) rl_backward (1); } if (vi_replace_count == 0 && _rl_vi_doing_insert) { rl_end_undo_group (); rl_do_undo (); _rl_vi_doing_insert = 0; } return (0); } int rl_vi_replace (count, key) int count, key; { int i; vi_replace_count = 0; if (!vi_replace_map) { vi_replace_map = rl_make_bare_keymap (); for (i = ' '; i < 127; i++) vi_replace_map[i].function = rl_vi_overstrike; vi_replace_map[RUBOUT].function = rl_vi_overstrike_delete; vi_replace_map[ESC].function = rl_vi_movement_mode; vi_replace_map[RETURN].function = rl_newline; vi_replace_map[NEWLINE].function = rl_newline; /* If the normal vi insertion keymap has ^H bound to erase, do the same here. Probably should remove the assignment to RUBOUT up there, but I don't think it will make a difference in real life. */ if (vi_insertion_keymap[CTRL ('H')].type == ISFUNC && vi_insertion_keymap[CTRL ('H')].function == rl_rubout) vi_replace_map[CTRL ('H')].function = rl_vi_overstrike_delete; } _rl_keymap = vi_replace_map; return (0); } /* Try to complete the word we are standing on or the word that ends with the previous character. A space matches everything. Word delimiters are space and ;. */ int rl_vi_possible_completions () { int save_pos = rl_point; if (rl_line_buffer[rl_point] != ' ' && rl_line_buffer[rl_point] != ';') { while (rl_line_buffer[rl_point] != ' ' && rl_line_buffer[rl_point] != ';') ; } else if (rl_line_buffer[rl_point - 1] == ';') { ding (); return (0); } rl_possible_completions (); rl_point = save_pos; return (0); } #if defined (STATIC_MALLOC) /* **************************************************************** */ /* */ /* xmalloc and xrealloc () */ /* */ /* **************************************************************** */ static void memory_error_and_abort (); static char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort (); return (temp); } static char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)xmalloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort (); return (temp); } static void memory_error_and_abort () { fprintf (stderr, "readline: Out of virtual memory!\n"); abort (); } #endif /* STATIC_MALLOC */ #endif /* VI_MODE */ octave-1.1.0/readline/xmalloc.c100666 415 17 4111 5521547745 14540 0ustar jweusers/* xmalloc.c -- safe versions of malloc and realloc */ /* Copyright (C) 1991 Free Software Foundation, Inc. This file is part of GNU Readline, a library for reading lines of text with interactive input and history editing. Readline 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 1, or (at your option) any later version. Readline 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 Readline; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if defined (ALREADY_HAVE_XMALLOC) #else #include #if defined (HAVE_STDLIB_H) # include #else # include "ansi_stdlib.h" #endif /* HAVE_STDLIB_H */ static void memory_error_and_abort (); /* **************************************************************** */ /* */ /* Memory Allocation and Deallocation. */ /* */ /* **************************************************************** */ /* Return a pointer to free()able block of memory large enough to hold BYTES number of bytes. If the memory cannot be allocated, print an error message and abort. */ char * xmalloc (bytes) int bytes; { char *temp = (char *)malloc (bytes); if (!temp) memory_error_and_abort ("xmalloc"); return (temp); } char * xrealloc (pointer, bytes) char *pointer; int bytes; { char *temp; if (!pointer) temp = (char *)malloc (bytes); else temp = (char *)realloc (pointer, bytes); if (!temp) memory_error_and_abort ("xrealloc"); return (temp); } static void memory_error_and_abort (fname) char *fname; { fprintf (stderr, "%s: Out of virtual memory!\n", fname); abort (); } #endif /* !ALREADY_HAVE_XMALLOC */ octave-1.1.0/readline/ansi_stdlib.h100666 415 17 1025 5521547743 15400 0ustar jweusers/* ansi_stdlib.h -- An ANSI Standard stdlib.h. */ /* A minimal stdlib.h containing extern declarations for those functions that bash uses. */ #if !defined (_STDLIB_H_) #define _STDLIB_H_ 1 /* String conversion functions. */ extern int atoi (); extern long int atol (); /* Memory allocation functions. */ extern char *malloc (); extern char *realloc (); extern void free (); /* Other miscellaneous functions. */ extern void abort (); extern void exit (); extern char *getenv (); extern void qsort (); #endif /* _STDLIB_H */ octave-1.1.0/readline/tilde.h100666 415 17 2627 5521547745 14221 0ustar jweusers/* tilde.h: Externally available variables and function in libtilde.a. */ #if !defined (__TILDE_H__) # define __TILDE_H__ /* Function pointers can be declared as (Function *)foo. */ #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); typedef char *CPFunction (); typedef char **CPPFunction (); #endif /* _FUNCTION_DEF */ /* If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text (sans tilde, as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. */ extern CPFunction *tilde_expansion_failure_hook; /* When non-null, this is a NULL terminated array of strings which are duplicates for a tilde prefix. Bash uses this to expand `=~' and `:~'. */ extern char **tilde_additional_prefixes; /* When non-null, this is a NULL terminated array of strings which match the end of a username, instead of just "/". Bash sets this to `:' and `=~'. */ extern char **tilde_additional_suffixes; /* Return a new string which is the result of tilde expanding STRING. */ extern char *tilde_expand (); /* Do the work of tilde expansion on FILENAME. FILENAME starts with a tilde. If there is no expansion, call tilde_expansion_failure_hook. */ extern char *tilde_expand_word (); #endif /* __TILDE_H__ */ octave-1.1.0/readline/chardefs.h100666 415 17 3740 5521547743 14672 0ustar jweusers/* chardefs.h -- Character definitions for readline. */ #ifndef _CHARDEFS_ #define _CHARDEFS_ #include #if defined (HAVE_STRING_H) # include #else # include #endif /* HAVE_STRING_H */ #ifndef savestring extern char *xmalloc (); # ifndef strcpy extern char *strcpy (); # endif #define savestring(x) strcpy (xmalloc (1 + strlen (x)), (x)) #endif #ifndef whitespace #define whitespace(c) (((c) == ' ') || ((c) == '\t')) #endif #ifdef CTRL #undef CTRL #endif /* Some character stuff. */ #define control_character_threshold 0x020 /* Smaller than this is control. */ #define meta_character_threshold 0x07f /* Larger than this is Meta. */ #define control_character_bit 0x40 /* 0x000000, must be off. */ #define meta_character_bit 0x080 /* x0000000, must be on. */ #define largest_char 255 /* Largest character value. */ #define META_CHAR(c) ((c) > meta_character_threshold && (c) <= largest_char) #define CTRL(c) ((c) & (~control_character_bit)) #define META(c) ((c) | meta_character_bit) #define UNMETA(c) ((c) & (~meta_character_bit)) #define UNCTRL(c) to_upper(((c)|control_character_bit)) #define lowercase_p(c) (((c) > ('a' - 1) && (c) < ('z' + 1))) #define uppercase_p(c) (((c) > ('A' - 1) && (c) < ('Z' + 1))) #define pure_alphabetic(c) (lowercase_p(c) || uppercase_p(c)) #ifndef to_upper #define to_upper(c) (lowercase_p(c) ? ((c) - 32) : (c)) #define to_lower(c) (uppercase_p(c) ? ((c) + 32) : (c)) #endif #define CTRL_P(c) ((c) < control_character_threshold) #define META_P(c) ((c) > meta_character_threshold) #ifndef NEWLINE #define NEWLINE '\n' #endif #ifndef RETURN #define RETURN CTRL('M') #endif #ifndef RUBOUT #define RUBOUT 0x07f #endif #ifndef TAB #define TAB '\t' #endif #ifdef ABORT_CHAR #undef ABORT_CHAR #endif #define ABORT_CHAR CTRL('G') #ifdef PAGE #undef PAGE #endif #define PAGE CTRL('L') #ifdef SPACE #undef SPACE #endif #define SPACE 0x020 #ifdef ESC #undef ESC #endif #define ESC CTRL('[') #endif /* _CHARDEFS_ */ octave-1.1.0/readline/history.h100666 415 17 12742 5521547743 14636 0ustar jweusers/* History.h -- the names of functions that you can call in history. */ /* The structure used to store a history entry. */ typedef struct { char *line; char *data; } HIST_ENTRY; /* A structure used to pass the current state of the history stuff around. */ typedef struct _hist_entry { HIST_ENTRY **entries; /* Pointer to the entries themselves. */ int offset; /* The location pointer within this array. */ int length; /* Number of elements within this array. */ int size; /* Number of slots allocated to this array. */ } HISTORY_STATE; /* For convenience only. You set this when interpreting history commands. It is the logical offset of the first history element. */ extern int history_base; /* Begin a session in which the history functions might be used. This just initializes the interactive variables. */ extern void using_history (); /* Return the current HISTORY_STATE of the history. */ extern HISTORY_STATE *history_get_history_state (); /* Set the state of the current history array to STATE. */ extern void history_set_history_state (); /* Place STRING at the end of the history list. The associated data field (if any) is set to NULL. */ extern void add_history (); /* Returns the number which says what history element we are now looking at. */ extern int where_history (); /* Set the position in the history list to POS. */ int history_set_pos (); /* Search for STRING in the history list, starting at POS, an absolute index into the list. DIR, if negative, says to search backwards from POS, else forwards. Returns the absolute index of the history element where STRING was found, or -1 otherwise. */ extern int history_search_pos (); /* A reasonably useless function, only here for completeness. WHICH is the magic number that tells us which element to delete. The elements are numbered from 0. */ extern HIST_ENTRY *remove_history (); /* Stifle the history list, remembering only MAX number of entries. */ extern void stifle_history (); /* Stop stifling the history. This returns the previous amount the history was stifled by. The value is positive if the history was stifled, negative if it wasn't. */ extern int unstifle_history (); /* Add the contents of FILENAME to the history list, a line at a time. If FILENAME is NULL, then read from ~/.history. Returns 0 if successful, or errno if not. */ extern int read_history (); /* Read a range of lines from FILENAME, adding them to the history list. Start reading at the FROM'th line and end at the TO'th. If FROM is zero, start at the beginning. If TO is less than FROM, read until the end of the file. If FILENAME is NULL, then read from ~/.history. Returns 0 if successful, or errno if not. */ extern int read_history_range (); /* Append the current history to FILENAME. If FILENAME is NULL, then append the history list to ~/.history. Values returned are as in read_history (). */ extern int write_history (); /* Append NELEMENT entries to FILENAME. The entries appended are from the end of the list minus NELEMENTs up to the end of the list. */ int append_history (); /* Make the history entry at WHICH have LINE and DATA. This returns the old entry so you can dispose of the data. In the case of an invalid WHICH, a NULL pointer is returned. */ extern HIST_ENTRY *replace_history_entry (); /* Return the history entry at the current position, as determined by history_offset. If there is no entry there, return a NULL pointer. */ HIST_ENTRY *current_history (); /* Back up history_offset to the previous history entry, and return a pointer to that entry. If there is no previous entry, return a NULL pointer. */ extern HIST_ENTRY *previous_history (); /* Move history_offset forward to the next item in the input_history, and return the a pointer to that entry. If there is no next entry, return a NULL pointer. */ extern HIST_ENTRY *next_history (); /* Return a NULL terminated array of HIST_ENTRY which is the current input history. Element 0 of this list is the beginning of time. If there is no history, return NULL. */ extern HIST_ENTRY **history_list (); /* Search the history for STRING, starting at history_offset. If DIRECTION < 0, then the search is through previous entries, else through subsequent. If the string is found, then current_history () is the history entry, and the value of this function is the offset in the line of that history entry that the string was found in. Otherwise, nothing is changed, and a -1 is returned. */ extern int history_search (); /* Expand the string STRING, placing the result into OUTPUT, a pointer to a string. Returns: 0) If no expansions took place (or, if the only change in the text was the de-slashifying of the history expansion character) 1) If expansions did take place -1) If there was an error in expansion. If an error ocurred in expansion, then OUTPUT contains a descriptive error message. */ extern int history_expand (); /* Extract a string segment consisting of the FIRST through LAST arguments present in STRING. Arguments are broken up as in the shell. */ extern char *history_arg_extract (); /* Return the number of bytes that the primary history entries are using. This just adds up the lengths of the_history->lines. */ extern int history_total_bytes (); /* Some more functions that we use internally, but across files. If they aren't going to be static, they might as well be declared here. */ extern int history_search_prefix (); octave-1.1.0/readline/keymaps.h100666 415 17 6007 5555150611 14552 0ustar jweusers/* keymaps.h -- Manipulation of readline keymaps. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _KEYMAPS_H_ #define _KEYMAPS_H_ #include #if !defined (__FUNCTION_DEF) # define __FUNCTION_DEF typedef int Function (); typedef void VFunction (); typedef char *CPFunction (); typedef char **CPPFunction (); #endif /* A keymap contains one entry for each key in the ASCII set. Each entry consists of a type and a pointer. POINTER is the address of a function to run, or the address of a keymap to indirect through. TYPE says which kind of thing POINTER is. */ typedef struct _keymap_entry { char type; Function *function; } KEYMAP_ENTRY; /* This must be large enough to hold bindings for all of the characters in a desired character set (e.g, 128 for ASCII, 256 for ISO Latin-x, and so on). */ #define KEYMAP_SIZE 256 /* I wanted to make the above structure contain a union of: union { Function *function; struct _keymap_entry *keymap; } value; but this made it impossible for me to create a static array. Maybe I need C lessons. */ typedef KEYMAP_ENTRY KEYMAP_ENTRY_ARRAY[KEYMAP_SIZE]; typedef KEYMAP_ENTRY *Keymap; /* The values that TYPE can have in a keymap entry. */ #define ISFUNC 0 #define ISKMAP 1 #define ISMACR 2 extern KEYMAP_ENTRY_ARRAY emacs_standard_keymap, emacs_meta_keymap, emacs_ctlx_keymap; extern KEYMAP_ENTRY_ARRAY vi_insertion_keymap, vi_movement_keymap; /* Return a new, empty keymap. Free it with free() when you are done. */ Keymap rl_make_bare_keymap (); /* Return a new keymap which is a copy of MAP. */ Keymap rl_copy_keymap (); /* Return a new keymap with the printing characters bound to rl_insert, the lowercase Meta characters bound to run their equivalents, and the Meta digits bound to produce numeric arguments. */ Keymap rl_make_keymap (); /* Return the keymap corresponding to a given name. Names look like `emacs' or `emacs-meta' or `vi-insert'. */ Keymap rl_get_keymap_by_name (); /* Return the current keymap. */ Keymap rl_get_keymap (); /* Set the current keymap to MAP. */ void rl_set_keymap (); #endif /* _KEYMAPS_H_ */ octave-1.1.0/readline/posixstat.h100666 415 17 10741 5521547744 15171 0ustar jweusers/* posixstat.h -- Posix stat(2) definitions for systems that don't have them. */ /* Copyright (C) 1987,1991 Free Software Foundation, Inc. This file is part of GNU Bash, the Bourne Again SHell. Bash 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 1, or (at your option) any later version. Bash 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 Bash; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* This file should be included instead of . It relies on the local sys/stat.h to work though. */ #if !defined (_POSIXSTAT_H) #define _POSIXSTAT_H #include #if defined (isc386) # if !defined (S_IFDIR) # define S_IFDIR 0040000 # endif /* !S_IFDIR */ # if !defined (S_IFMT) # define S_IFMT 0170000 # endif /* !S_IFMT */ #endif /* isc386 */ /* This text is taken directly from the Cadmus I was trying to compile on: the following MACROs are defined for X/OPEN compatibility however, is the param correct ?? #define S_ISBLK(s) ((s.st_mode & S_IFMT) == S_IFBLK) Well, the answer is no. Thus... */ #if defined (BrainDeath) # undef S_ISBLK # undef S_ISCHR # undef S_ISDIR # undef S_ISFIFO # undef S_ISREG #endif /* BrainDeath */ /* Posix 1003.1 5.6.1.1 file types */ /* Some Posix-wannabe systems define _S_IF* macros instead of S_IF*, but do not provide the S_IS* macros that Posix requires. */ #if defined (_S_IFMT) && !defined (S_IFMT) #define S_IFMT _S_IFMT #endif #if defined (_S_IFIFO) && !defined (S_IFIFO) #define S_IFIFO _S_IFIFO #endif #if defined (_S_IFCHR) && !defined (S_IFCHR) #define S_IFCHR _S_IFCHR #endif #if defined (_S_IFDIR) && !defined (S_IFDIR) #define S_IFDIR _S_IFDIR #endif #if defined (_S_IFBLK) && !defined (S_IFBLK) #define S_IFBLK _S_IFBLK #endif #if defined (_S_IFREG) && !defined (S_IFREG) #define S_IFREG _S_IFREG #endif #if defined (_S_IFLNK) && !defined (S_IFLNK) #define S_IFLNK _S_IFLNK #endif #if defined (_S_IFSOCK) && !defined (S_IFSOCK) #define S_IFSOCK _S_IFSOCK #endif /* Test for each symbol individually and define the ones necessary (some systems claiming Posix compatibility define some but not all). */ #if defined (S_IFBLK) && !defined (S_ISBLK) #define S_ISBLK(m) (((m)&S_IFMT) == S_IFBLK) /* block device */ #endif #if defined (S_IFCHR) && !defined (S_ISCHR) #define S_ISCHR(m) (((m)&S_IFMT) == S_IFCHR) /* character device */ #endif #if defined (S_IFDIR) && !defined (S_ISDIR) #define S_ISDIR(m) (((m)&S_IFMT) == S_IFDIR) /* directory */ #endif #if defined (S_IFREG) && !defined (S_ISREG) #define S_ISREG(m) (((m)&S_IFMT) == S_IFREG) /* file */ #endif #if defined (S_IFIFO) && !defined (S_ISFIFO) #define S_ISFIFO(m) (((m)&S_IFMT) == S_IFIFO) /* fifo - named pipe */ #endif #if defined (S_IFLNK) && !defined (S_ISLNK) #define S_ISLNK(m) (((m)&S_IFMT) == S_IFLNK) /* symbolic link */ #endif #if defined (S_IFSOCK) && !defined (S_ISSOCK) #define S_ISSOCK(m) (((m)&S_IFMT) == S_IFSOCK) /* socket */ #endif /* * POSIX 1003.1 5.6.1.2 File Modes */ #if !defined (S_IRWXU) # if !defined (S_IREAD) # define S_IREAD 00400 # define S_IWRITE 00200 # define S_IEXEC 00100 # endif /* S_IREAD */ # if !defined (S_IRUSR) # define S_IRUSR S_IREAD /* read, owner */ # define S_IWUSR S_IWRITE /* write, owner */ # define S_IXUSR S_IEXEC /* execute, owner */ # define S_IRGRP (S_IREAD >> 3) /* read, group */ # define S_IWGRP (S_IWRITE >> 3) /* write, group */ # define S_IXGRP (S_IEXEC >> 3) /* execute, group */ # define S_IROTH (S_IREAD >> 6) /* read, other */ # define S_IWOTH (S_IWRITE >> 6) /* write, other */ # define S_IXOTH (S_IEXEC >> 6) /* execute, other */ # endif /* !S_IRUSR */ # define S_IRWXU (S_IRUSR | S_IWUSR | S_IXUSR) # define S_IRWXG (S_IRGRP | S_IWGRP | S_IXGRP) # define S_IRWXO (S_IROTH | S_IWOTH | S_IXOTH) #endif /* !S_IRWXU */ /* These are non-standard, but are used in builtins.c$symbolic_umask() */ #define S_IRUGO (S_IRUSR | S_IRGRP | S_IROTH) #define S_IWUGO (S_IWUSR | S_IWGRP | S_IWOTH) #define S_IXUGO (S_IXUSR | S_IXGRP | S_IXOTH) #endif /* _POSIXSTAT_H */ octave-1.1.0/readline/readline.h100666 415 17 24016 5620531352 14702 0ustar jweusers/* Readline.h -- the names of functions callable from within readline. */ /* Copyright (C) 1987, 1989, 1992 Free Software Foundation, Inc. This file is part of the GNU Readline Library, a library for reading lines of text with interactive input and history editing. The GNU Readline 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 1, or (at your option) any later version. The GNU Readline 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (_READLINE_H_) #define _READLINE_H_ #include /* The functions for manipulating the text of the line within readline. Most of these functions are bound to keys by default. */ extern int rl_tilde_expand (), rl_beg_of_line (), rl_backward (), rl_delete (), rl_end_of_line (), rl_forward (), ding (), rl_backward (), rl_newline (), rl_kill_line (), rl_clear_screen (), rl_get_next_history (), rl_get_previous_history (), rl_quoted_insert (), rl_reverse_search_history (), rl_transpose_chars (), rl_unix_line_discard (), rl_quoted_insert (), rl_unix_word_rubout (), rl_yank (), rl_rubout (), rl_backward_word (), rl_kill_word (), rl_forward_word (), rl_tab_insert (), rl_yank_pop (), rl_yank_nth_arg (), rl_backward_kill_word (), rl_backward_kill_line (), rl_transpose_words (), rl_complete (), rl_possible_completions (), rl_insert_completions (), rl_do_lowercase_version (), rl_digit_argument (), rl_universal_argument (), rl_abort (), rl_undo_command (), rl_revert_line (), rl_beginning_of_history (), rl_end_of_history (), rl_forward_search_history (), rl_insert (), rl_upcase_word (), rl_downcase_word (), rl_capitalize_word (), rl_restart_output (), rl_re_read_init_file (), rl_dump_functions (), rl_delete_horizontal_space (); /* Some more functions that we use internally, but across files. If they aren't going to be static, they might as well be declared here. */ extern int maybe_unsave_line (), maybe_save_line (), maybe_replace_line (), rl_read_key (), rl_execute_next (), rl_delete_text (), rl_insert_text (), rl_begin_undo_group (), rl_end_undo_group (), rl_kill_text (), rl_stuff_char (), rl_do_undo (), rl_getc (), rl_init_argument (), rl_clean_up_for_exit (), numeric (), crlf (), backspace (); extern void free_history_entry (), rl_dispatch (), rl_extend_line_buffer (), _rl_kill_kbd_macro (), _rl_set_screen_size (); /* #define PAREN_MATCHING */ #if defined (PAREN_MATCHING) extern int rl_insert_close (); #endif /* PAREN_MATCHING */ /* These are *both* defined even when VI_MODE is not. */ extern int rl_vi_editing_mode (), rl_emacs_editing_mode (); /* Non incremental history searching. */ extern int rl_noninc_forward_search (), rl_noninc_reverse_search (), rl_noninc_forward_search_again (), rl_noninc_reverse_search_again (); #if defined (VI_MODE) /* Things for vi mode. */ extern int rl_vi_redo (), rl_vi_tilde_expand (), rl_vi_movement_mode (), rl_vi_insertion_mode (), rl_vi_arg_digit (), rl_vi_prev_word (), rl_vi_next_word (), rl_vi_char_search (), rl_vi_eof_maybe (), rl_vi_append_mode (), rl_vi_put (), rl_vi_append_eol (), rl_vi_insert_beg (), rl_vi_delete (), rl_vi_comment (), rl_vi_first_print (), rl_vi_fword (), rl_vi_fWord (), rl_vi_bword (), rl_vi_bWord (), rl_vi_eword (), rl_vi_eWord (), rl_vi_end_word (), rl_vi_change_case (), rl_vi_match (), rl_vi_bracktype (), rl_vi_change_char (), rl_vi_yank_arg (), rl_vi_search (), rl_vi_search_again (), rl_vi_subst (), rl_vi_overstrike (), rl_vi_overstrike_delete (), rl_vi_replace(), rl_vi_column (), rl_vi_delete_to (), rl_vi_change_to (), rl_vi_yank_to (), rl_vi_complete (), rl_vi_fetch_history (); #endif /* VI_MODE */ /* Keyboard macro commands. */ extern int rl_start_kbd_macro (), rl_end_kbd_macro (), rl_call_last_kbd_macro (); extern int rl_arrow_keys(), rl_refresh_line (); /* Maintaining the state of undo. We remember individual deletes and inserts on a chain of things to do. */ /* The actions that undo knows how to undo. Notice that UNDO_DELETE means to insert some text, and UNDO_INSERT means to delete some text. I.e., the code tells undo what to undo, not how to undo it. */ enum undo_code { UNDO_DELETE, UNDO_INSERT, UNDO_BEGIN, UNDO_END }; /* What an element of THE_UNDO_LIST looks like. */ typedef struct undo_list { struct undo_list *next; int start, end; /* Where the change took place. */ char *text; /* The text to insert, if undoing a delete. */ enum undo_code what; /* Delete, Insert, Begin, End. */ } UNDO_LIST; /* The current undo list for RL_LINE_BUFFER. */ extern UNDO_LIST *rl_undo_list; /* The data structure for mapping textual names to code addresses. */ typedef struct { char *name; Function *function; } FUNMAP; extern FUNMAP **funmap; /* **************************************************************** */ /* */ /* Well Published Variables */ /* */ /* **************************************************************** */ /* The name of the calling program. You should initialize this to whatever was in argv[0]. It is used when parsing conditionals. */ extern char *rl_readline_name; /* The line buffer that is in use. */ extern char *rl_line_buffer; /* The location of point, and end. */ extern int rl_point, rl_end; /* The name of the terminal to use. */ extern char *rl_terminal_name; /* The input and output streams. */ extern FILE *rl_instream, *rl_outstream; /* The basic list of characters that signal a break between words for the completer routine. The initial contents of this variable is what breaks words in the shell, i.e. "n\"\\'`@$>". */ extern char *rl_basic_word_break_characters; /* The list of characters that signal a break between words for rl_complete_internal. The default list is the contents of rl_basic_word_break_characters. */ extern char *rl_completer_word_break_characters; /* List of characters that are word break characters, but should be left in TEXT when it is passed to the completion function. The shell uses this to help determine what kind of completing to do. */ extern char *rl_special_prefixes; /* Pointer to the generator function for completion_matches (). NULL means to use filename_entry_function (), the default filename completer. */ extern Function *rl_completion_entry_function; /* If rl_ignore_some_completions_function is non-NULL it is the address of a function to call after all of the possible matches have been generated, but before the actual completion is done to the input line. The function is called with one argument; a NULL terminated array of (char *). If your function removes any of the elements, they must be free()'ed. */ extern Function *rl_ignore_some_completions_function; /* Pointer to alternative function to create matches. Function is called with TEXT, START, and END. START and END are indices in RL_LINE_BUFFER saying what the boundaries of TEXT are. If this function exists and returns NULL then call the value of rl_completion_entry_function to try to match, otherwise use the array of strings returned. */ extern CPPFunction *rl_attempted_completion_function; /* If non-zero, then this is the address of a function to call just before readline_internal () prints the first prompt. */ extern Function *rl_startup_hook; /* If non-zero, then this is the address of a function to call when completing on a directory name. The function is called with the address of a string (the current directory name) as an arg. */ extern Function *rl_symbolic_link_hook; /* The address of a function to call periodically while Readline is awaiting character input, or NULL, for no event handling. */ extern Function *rl_event_hook; /* Non-zero means that modified history lines are preceded with an asterisk. */ extern int rl_show_star; /* **************************************************************** */ /* */ /* Tilde Variables That Can be Externally Set */ /* */ /* **************************************************************** */ /* If non-null, this contains the address of a function to call if the standard meaning for expanding a tilde fails. The function is called with the text (sans tilde, as in "foo"), and returns a malloc()'ed string which is the expansion, or a NULL pointer if there is no expansion. */ extern CPFunction *tilde_expansion_failure_hook; /* When non-null, this is a NULL terminated array of strings which are duplicates for a tilde prefix. Bash uses this to expand `=~' and `:~'. */ extern char **tilde_additional_prefixes; /* When non-null, this is a NULL terminated array of strings which match the end of a username, instead of just "/". Bash sets this to `/' and `:'. */ extern char **tilde_additional_suffixes; /* **************************************************************** */ /* */ /* Well Published Functions */ /* */ /* **************************************************************** */ /* Read a line of input. Prompt with PROMPT. A NULL PROMPT means none. */ extern char *readline (); /* Return an array of strings which are the result of repeatadly calling FUNC with TEXT. */ extern char **completion_matches (); /* rl_add_defun (char *name, Function *function, int key) Add NAME to the list of named functions. Make FUNCTION be the function that gets called. If KEY is not -1, then bind it. */ extern int rl_add_defun (); #endif /* _READLINE_H_ */ octave-1.1.0/readline/rldefs.h100666 415 17 12371 5526351366 14411 0ustar jweusers/* rldefs.h -- an attempt to isolate some of the system-specific defines for readline. This should be included after any files that define system-specific constants like _POSIX_VERSION or USG. */ /* Copyright (C) 1987,1989 Free Software Foundation, Inc. This file contains the Readline Library (the Library), a set of routines for providing Emacs style line input to programs that ask for it. The 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, or (at your option) any later version. The 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. The GNU General Public License is often shipped with GNU software, and is generally kept in a file called COPYING or LICENSE. If you do not have a copy of the license, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (_RLDEFS_H) #define _RLDEFS_H #ifdef HAVE_UNISTD_H # include # include #endif #if defined (__GNUC__) # undef alloca # define alloca __builtin_alloca #else # if defined (sparc) || defined (HAVE_ALLOCA_H) # include # endif #endif #define NEW_TTY_DRIVER #define HAVE_BSD_SIGNALS /* #define USE_XON_XOFF */ #if defined (__linux__) # include #endif /* __linux__ */ /* Some USG machines have BSD signal handling (sigblock, sigsetmask, etc.) */ #if defined (USG) && !defined (hpux) # undef HAVE_BSD_SIGNALS #endif #if defined (_POSIX_VERSION) # define HAVE_POSIX_SIGNALS # if !defined (O_NDELAY) # define O_NDELAY O_NONBLOCK /* Posix-style non-blocking i/o */ # endif /* O_NDELAY */ #endif #if defined (HAVE_TERMIOS_H) # undef NEW_TTY_DRIVER # define TERMIOS_TTY_DRIVER # include #elif defined (HAVE_TERMIO_H) # undef NEW_TTY_DRIVER # define TERMIO_TTY_DRIVER # include # if !defined (TCOON) # define TCOON 1 # endif #elif defined (HAVE_SGTTY_H) # include #endif /* System V.3 machines have the old 4.1 BSD `reliable' signal interface. */ #if !defined (HAVE_BSD_SIGNALS) && !defined (HAVE_POSIX_SIGNALS) # if defined (USGr3) # if !defined (HAVE_USG_SIGHOLD) # define HAVE_USG_SIGHOLD # endif /* !HAVE_USG_SIGHOLD */ # endif /* USGr3 */ #endif /* !HAVE_BSD_SIGNALS && !HAVE_POSIX_SIGNALS */ /* Define _POSIX_VDISABLE if we are not using the `new' tty driver and it is not already defined. It is used both to determine if a special character is disabled and to disable certain special characters. Posix systems should set to 0, USG systems to -1. */ #if !defined (NEW_TTY_DRIVER) && !defined (_POSIX_VDISABLE) # if defined (_POSIX_VERSION) # define _POSIX_VDISABLE 0 # else /* !_POSIX_VERSION */ # define _POSIX_VDISABLE -1 # endif /* !_POSIX_VERSION */ #endif /* !NEW_TTY_DRIVER && !_POSIX_VDISABLE */ /* unistd.h defines _POSIX_VERSION on POSIX.1 systems. */ #if defined(DIRENT) || defined(_POSIX_VERSION) # include # if !defined (direct) # define direct dirent # endif /* !direct */ # define D_NAMLEN(dirent) (strlen((dirent)->d_name)) # else /* not (DIRENT or _POSIX_VERSION) */ # define D_NAMLEN(dirent) ((dirent)->d_namlen) # ifdef SYSNDIR # include # endif /* SYSNDIR */ # ifdef SYSDIR # include # endif /* SYSDIR */ # ifdef NDIR # include # endif /* NDIR */ #endif /* not (DIRENT or _POSIX_VERSION) */ #if defined (USG) && defined (TIOCGWINSZ) && !defined (Linux) # include # if defined (HAVE_SYS_PTEM_H) # include # endif /* HAVE_SYS_PTEM_H */ # if defined (HAVE_SYS_PTE_H) # include # endif /* HAVE_SYS_PTE_H */ #endif /* USG && TIOCGWINSZ && !Linux */ /* Posix macro to check file in statbuf for directory-ness. This requires that be included before this test. */ #if defined (S_IFDIR) && !defined (S_ISDIR) #define S_ISDIR(m) (((m)&S_IFMT) == S_IFDIR) #endif /* Decide which flavor of the header file describing the C library string functions to include and include it. */ #if defined (STDC_HEADERS) || defined (HAVE_STRING_H) # include /* An ANSI string.h and pre-ANSI memory.h might conflict. */ # if !defined (STDC_HEADERS) && defined (HAVE_MEMORY_H) # include # endif /* not STDC_HEADERS and HAVE_MEMORY_H */ # define index strchr # define rindex strrchr # define bcopy(s, d, n) memcpy ((d), (s), (n)) # define bcmp(s1, s2, n) memcmp ((s1), (s2), (n)) # define bzero(s, n) memset ((s), 0, (n)) #else /* not STDC_HEADERS and not HAVE_STRING_H */ # include /* memory.h and strings.h conflict on some systems. */ #endif /* not STDC_HEADERS and not HAVE_STRING_H */ #if defined (HAVE_VARARGS_H) # include #endif /* HAVE_VARARGS_H */ /* This definition is needed by readline.c, rltty.c, and signals.c. */ /* If on, then readline handles signals in a way that doesn't screw. */ #define HANDLE_SIGNALS #if !defined (emacs_mode) # define no_mode -1 # define vi_mode 0 # define emacs_mode 1 #endif #endif /* !_RLDEFS_H */ octave-1.1.0/src/ 40777 415 17 0 5705522343 11636 5ustar jweusersoctave-1.1.0/src/Makefile.in100666 415 17 15723 5662227006 14030 0ustar jweusers# # Makefile for octave's src directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@:@srcdir@/../bsd-math include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ LIBOBJS = @LIBOBJS@ # Cancel default rule for .c from .y and make .cc from .y instead. %.c : %.y %.cc : %.y $(YACC) $(YFLAGS) $< @$(top_srcdir)/move-if-change y.tab.c $(@F) # Likewise for .c from .l. %.c : %.l %.cc : %.l $(LEX) $(LFLAGS) $< > $(@F) XALL_CXXFLAGS_1 = $(subst -fexternal-templates, , $(ALL_CXXFLAGS)) XALL_CXXFLAGS = $(subst -fno-implicit-templates, , $(XALL_CXXFLAGS_1)) %.def : %.cc @echo making $@ from $< @$(CXXCPP) -c $(CPPFLAGS) $(XALL_CXXFLAGS) -DMAKE_BUILTINS $< \ | $(srcdir)/mkdefs > $@.tmp @if test `wc $@.tmp | sed 's%[^0-9]*\([0-9]*\).*%\1%'` -ne 0 ; then \ mv $@.tmp $@ ; \ else \ echo "error: $@ is empty!" 1>&2 ; \ rm -f $@.tmp ; \ exit 1 ; \ fi DLD_SRC := f-balance.cc f-chol.cc f-colloc.cc f-dassl.cc f-det.cc \ f-eig.cc f-expm.cc f-fft.cc f-fft2.cc f-find.cc \ f-fsolve.cc f-fsqp.cc f-givens.cc f-hess.cc f-ifft.cc \ f-ifft2.cc f-inv.cc f-log.cc f-lpsolve.cc f-lsode.cc f-lu.cc \ f-minmax.cc f-npsol.cc f-pinv.cc f-qpsol.cc f-qr.cc f-quad.cc \ f-qzval.cc f-rand.cc f-schur.cc f-sort.cc f-svd.cc f-syl.cc DLD_OBJ := $(patsubst %.cc, %.o, $(DLD_SRC)) INCLUDES := arith-ops.h builtins.h defaults.h.in defun.h defun-dld.h \ defun-int.h dirfns.h dynamic-ld.h error.h file-io.h fnmatch.h \ getopt.h gripes.h help.h idx-vector.h input.h lex.h \ load-save.h mappers.h missing-math.h octave.h octave-hist.h \ oct-map.h oct-obj.h pager.h parse.h pr-output.h procstream.h \ sighandlers.h statdefs.h symtab.h sysdep.h systime.h token.h \ tree-base.h tree-cmd.h tree-const.h tree-expr.h tree-misc.h \ tree-plot.h tc-inlines.h tc-rep.h unwind-prot.h user-prefs.h \ utils.h variables.h version.h xdiv.h xpow.h Map.h SLStack.h \ Stack.h TI_SRC := Array-tc.cc Map-tc.cc DLList-fi.cc \ SLList-expr.cc SLList-misc.cc SLList-plot.cc SLList-tc.cc \ SLStack-i.cc SLStack-pc.cc SLStack-sym.cc SLStack-tok.cc \ SLStack-tm.cc SLStack-ue.cc SLStack-ui.cc TI_OBJ := $(patsubst %.cc, %.o, $(TI_SRC)) SOURCES := arith-ops.cc data.cc dirfns.cc dynamic-ld.cc \ error.cc file-io.cc fnmatch.c getopt.c getopt1.c gripes.cc \ help.cc idx-vector.cc input.cc lex.l load-save.cc mappers.cc \ octave.cc octave-hist.cc oct-obj.cc pager.cc parse.y \ pr-output.cc procstream.cc sighandlers.cc strcasecmp.c \ strncase.c strfns.cc symtab.cc sysdep.cc tc-rep.cc \ tc-rep-ass.cc tc-rep-idx.cc tempname.c timefns.cc tmpnam.c \ token.cc tree-base.cc tree-cmd.cc tree-const.cc tree-expr.cc \ tree-misc.cc tree-plot.cc unwind-prot.cc user-prefs.cc \ utils.cc variables.cc xdiv.cc xpow.cc Map.cc SLStack.cc OBJECTS_4 := $(SOURCES) builtins.o OBJECTS_3 := $(patsubst %.l, %.o, $(OBJECTS_4)) OBJECTS_2 := $(patsubst %.y, %.o, $(OBJECTS_3)) OBJECTS_1 := $(patsubst %.c, %.o, $(OBJECTS_2)) OBJECTS := $(patsubst %.cc, %.o, $(OBJECTS_1)) # Ugh. DEP_SOURCES_3 := $(SOURCES) $(TI_SOURCES) builtins.cc DEP_SOURCES_2 := $(patsubst %.l, %.cc, $(DEP_SOURCES_3)) DEP_SOURCES_1 := $(patsubst %.y, %.cc, $(DEP_SOURCES_2)) DEP_SOURCES := $(patsubst %.c, %.d, $(DEP_SOURCES_1)) MAKEDEPS := $(patsubst %.cc, %.d, $(DEP_SOURCES)) DEF_FILES_5 := $(SOURCES) $(DLD_SRC) DEF_FILES_4 := $(addprefix $(srcdir)/, $(DEF_FILES_5)) DEF_FILES_3 := $(notdir $(shell grep -l "^DEFUN" $(DEF_FILES_4))) DEF_FILES_2 := $(patsubst %.y, %.def, $(DEF_FILES_3)) DEF_FILES_1 := $(patsubst %.l, %.def, $(DEF_FILES_2)) DEF_FILES := $(patsubst %.cc, %.def, $(DEF_FILES_1)) OCTAVE_LIBS = @LIBOCTDLD@ ../liboctave/liboctave.a libtinst.a \ ../libcruft/libcruft.a ../info/libinfo.a \ ../readline/libreadline.a ../kpathsea/libkpathsea.a \ @LIBDLD@ DISTFILES = Makefile.in mkdefs mkbuiltins \ parse.cc lex.cc y.tab.h $(INCLUDES) $(DLD_SRC) $(SOURCES) \ $(TI_SRC) all: defaults.h octave .PHONY: all octave: $(OBJECTS) $(DLD_OBJ) $(LIBOBJS) $(OCTAVE_LIBS) liboctdld.a $(CXX) $(CPPFLAGS) $(ALL_CXXFLAGS) $(ALL_LDFLAGS) -o octave \ $(OBJECTS) \ $(OCTAVE_LIBS) \ $(LIBOBJS) \ $(FLIBS) $(LEXLIB) -ltermcap -lm -lg++ liboctdld.a: $(DLD_OBJ) $(AR) $(ARFLAGS) liboctdld.a $(DLD_OBJ) $(RANLIB) liboctdld.a libtinst.a: $(TI_OBJ) $(AR) $(ARFLAGS) libtinst.a $(TI_OBJ) $(RANLIB) libtinst.a builtins.cc: $(DEF_FILES) mkbuiltins @echo making $@ from $(DEF_FILES) @$(srcdir)/mkbuiltins $(DEF_FILES) > $@.tmp @$(top_srcdir)/move-if-change $@.tmp $@ $(DEF_FILES): mkdefs defun-int.h defun-dld.h defun.h defaults.h $(MAKEDEPS): defaults.h check: all .PHONY: check install: all $(top_srcdir)/mkinstalldirs $(bindir) $(libdir) rm -f $(bindir)/octave $(INSTALL) octave $(bindir)/octave-$(version) ln $(bindir)/octave-$(version) $(bindir)/octave if $(OCTAVE_LITE) && $(WITH_DLD) ; then \ $(INSTALL_DATA) liboctdld.a $(libdir)/liboctdld.a ; \ fi .PHONY: install uninstall: rm -f $(bindir)/octave .PHONY: uninstall tags: $(SOURCES) $(DLD_SRC) $(TI_SRC) ctags $(SOURCES) $(DLD_SRC) $(TI_SRC) TAGS: $(SOURCES) $(DLD_SRC) $(TI_SRC) etags $(SOURCES) $(DLD_SRC) $(TI_SRC) clean: rm -f *.a *.o builtins.cc .PHONY: clean mostlyclean: rm -f *.o .PHONY: mostlyclean distclean: clean rm -f Makefile octave .fname *.d *.def .PHONY: distclean realclean: distclean rm -f tags TAGS y.tab.c y.tab.h y.output yy.lex.c \ lex.cc parse.cc defaults.h *.d *.def .PHONY: realclean local-dist: parse.cc lex.cc ln $(DISTFILES) ../`cat ../.fname`/src rm -f parse.cc lex.cc y.tab.h y.output yy.lex.c rm -f lex.cc parse.cc defaults.h *.d *.def .PHONY: local-dist dist: parse.cc lex.cc ln $(DISTFILES) ../`cat ../.fname`/src rm -f parse.cc lex.cc y.tab.h y.output yy.lex.c rm -f lex.cc parse.cc defaults.h *.d *.def builtins.cc .PHONY: dist # Special rules -- these files need special things to be defined. defaults.h: defaults.h.in ../Makeconf Makefile @echo "making defaults.h from defaults.h.in" @(sed < $< > $@.tmp \ -e "s;%DEFAULT_PAGER%;\"${DEFAULT_PAGER}\";" \ -e "s;%OCTAVE_PREFIX%;\"${prefix}\";" \ -e "s;%OCTAVE_EXEC_PREFIX%;\"${exec_prefix}\";" \ -e "s;%OCTAVE_DATADIR%;\"${datadir}\";" \ -e "s;%OCTAVE_BINDIR%;\"${bindir}\";" \ -e "s;%OCTAVE_LIBDIR%;\"${libdir}\";" \ -e "s;%OCTAVE_INFODIR%;\"${infodir}\";" \ -e "s;%OCTAVE_FCNFILEDIR%;\"${fcnfiledir}\";" \ -e "s;%OCTAVE_LOCALFCNFILEPATH%;\"${localfcnfilepath}\";" \ -e "s;%OCTAVE_ARCHLIBDIR%;\"${archlibdir}\";" \ -e "s;%OCTAVE_OCTFILEDIR%;\"${octfiledir}\";" \ -e "s;%OCTAVE_LOCALOCTFILEPATH%;\"${localoctfilepath}\";" \ -e "s;%OCTAVE_FCNFILEPATH%;\"${fcnfilepath}\";" \ -e "s;%OCTAVE_IMAGEPATH%;\"${imagepath}\";" \ -e "s;%TARGET_HOST_TYPE%;\"${target_host_type}\";" \ -e "s;%FLIB_LIST%;\"${FLIB_LIST}\";" \ -e "s;%FLIB_PATH%;\"${FLIB_PATH}\";" \ -e "s;%CXXLIB_LIST%;\"${CXXLIB_LIST}\";" \ -e "s;%CXXLIB_PATH%;\"${CXXLIB_PATH}\";") @$(top_srcdir)/move-if-change $@.tmp $@ check: all .PHONY: check -include $(MAKEDEPS) octave-1.1.0/src/mkdefs100777 415 17 252 5612126306 13105 0ustar jweusers#!/bin/sh sed -n -e '/^BEGIN_INSTALL_BUILTIN/{ : loop N /END_INSTALL_BUILTIN/b done b loop : done s/BEGIN_INSTALL_BUILTIN// s/END_INSTALL_BUILTIN// p }' octave-1.1.0/src/mkbuiltins100777 415 17 662 5613766325 14036 0ustar jweusers#!/bin/sh cat << \EOF // DO NOT EDIT! Generated automatically by mkbuiltins. #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "mappers.h" #include "variables.h" #include "builtins.h" #include "oct-obj.h" static void install_builtin_functions (void) { EOF cat "$@" cat << \EOF } void install_builtins (void) { install_builtin_variables (); install_mapper_functions (); install_builtin_functions (); } EOF exit 0 octave-1.1.0/src/parse.cc100666 415 17 276750 5705522255 13437 0ustar jweusers /* A Bison parser, made from parse.y with Bison version GNU Bison version 1.22 */ #define YYBISON 1 /* Identify Bison output. */ #define EXPR_AND_AND 258 #define EXPR_OR_OR 259 #define EXPR_AND 260 #define EXPR_OR 261 #define EXPR_NOT 262 #define EXPR_LT 263 #define EXPR_LE 264 #define EXPR_EQ 265 #define EXPR_NE 266 #define EXPR_GE 267 #define EXPR_GT 268 #define LEFTDIV 269 #define EMUL 270 #define EDIV 271 #define ELEFTDIV 272 #define QUOTE 273 #define TRANSPOSE 274 #define PLUS_PLUS 275 #define MINUS_MINUS 276 #define POW 277 #define EPOW 278 #define NUM 279 #define IMAG_NUM 280 #define NAME 281 #define SCREW 282 #define END 283 #define PLOT 284 #define TEXT 285 #define STYLE 286 #define FOR 287 #define WHILE 288 #define IF 289 #define ELSEIF 290 #define ELSE 291 #define BREAK 292 #define CONTINUE 293 #define FUNC_RET 294 #define UNWIND 295 #define CLEANUP 296 #define GLOBAL 297 #define TEXT_ID 298 #define LEXICAL_ERROR 299 #define FCN 300 #define SCREW_TWO 301 #define ELLIPSIS 302 #define ALL_VA_ARGS 303 #define END_OF_INPUT 304 #define USING 305 #define TITLE 306 #define WITH 307 #define COLON 308 #define OPEN_BRACE 309 #define CLOSE_BRACE 310 #define CLEAR 311 #define UNARY 312 #line 27 "parse.y" #define YYDEBUG 1 #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "SLStack.h" #include "Matrix.h" #include "octave-hist.h" #include "user-prefs.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-const.h" #include "tree-misc.h" #include "variables.h" #include "tree-plot.h" #include "octave.h" #include "symtab.h" #include "parse.h" #include "token.h" #include "error.h" #include "pager.h" #include "input.h" #include "utils.h" #include "lex.h" // Nonzero means we're in the middle of defining a function. int defining_func = 0; // Nonzero means we're in the middle of defining a loop. int looping = 0; // Nonzero means we're in the middle of defining a conditional expression. int iffing = 0; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. int maybe_screwed = 0; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. int maybe_screwed_again = 0; // Temporary symbol table pointer used to cope with bogus function syntax. symbol_table *tmp_local_sym_tab = 0; // Stack to hold list of literal matrices. SLStack ml; // A nonzero element corresponding to an element of ml means we just // started reading a new matrix. This should probably be part of a // new struct for matrix lists... SLStack mlnm; // The current input line number. int input_line_number = 0; // The column of the current token. int current_input_column = 1; // Buffer for help text snagged from function files. char *help_buf = 0; // Nonzero means we're working on a plot command. int plotting = 0; // Nonzero means we've seen something that means we must be past the // range part of a plot command. int past_plot_range = 0; // Nonzero means we're looking at the range part of a plot command. int in_plot_range = 0; // Nonzero means we're looking at the using part of a plot command. int in_plot_using = 0; // Nonzero means we're looking at the style part of a plot command. int in_plot_style = 0; // Nonzero means we're looking at an indirect reference to a structure // element. int looking_at_indirect_ref = 0; // Forward declarations for some functions defined at the bottom of // the file. // Generic error messages. static void yyerror (char *s); // Error mesages for mismatched end tokens. static void end_error (char *type, token::end_tok_type ettype, int l, int c); // Check to see that end tokens are properly matched. static int check_end (token *tok, token::end_tok_type expected); // Try to figure out early if an expression should become an // assignment to the builtin variable ans. static tree_expression *maybe_convert_to_ans_assign (tree_expression *expr); // Maybe print a warning if an assignment expression is used as the // test in a logical expression. static void maybe_warn_assign_as_truth_value (tree_expression *expr); // Build a binary expression. static tree_expression *make_binary_op (int op, tree_expression *op1, token *tok_val, tree_expression *op2); // Build a prefix expression. static tree_expression *make_prefix_op (int op, tree_identifier *op1, token *tok_val); // Build a postfix expression. static tree_expression *make_postfix_op (int op, tree_identifier *op1, token *tok_val); // Build a binary expression. static tree_expression *make_unary_op (int op, tree_expression *op1, token *tok_val); // Make an expression that handles assignment of multiple values. static tree_expression *make_multi_val_ret (tree_expression *rhs, int l = -1, int c = -1); // Make an index expression. static tree_index_expression *make_index_expression (tree_indirect_ref *indir, tree_argument_list *args); #define ABORT_PARSE \ do \ { \ global_command = 0; \ yyerrok; \ if (interactive) \ YYACCEPT; \ else \ YYABORT; \ } \ while (0) #line 176 "parse.y" typedef union { // The type of the basic tokens returned by the lexer. token *tok_val; // Types for the nonterminals we generate. tree *tree_type; tree_expression *tree_expression_type; tree_constant *tree_constant_type; tree_matrix *tree_matrix_type; tree_identifier *tree_identifier_type; tree_indirect_ref *tree_indirect_ref_type; tree_function *tree_function_type; tree_index_expression *tree_index_expression_type; tree_colon_expression *tree_colon_expression_type; tree_argument_list *tree_argument_list_type; tree_parameter_list *tree_parameter_list_type; tree_command *tree_command_type; tree_if_command *tree_if_command_type; tree_if_clause *tree_if_clause_type; tree_if_command_list *tree_if_command_list_type; tree_global *tree_global_type; tree_global_init_list *tree_global_init_list_type; tree_global_command *tree_global_command_type; tree_statement *tree_statement_type; tree_statement_list *tree_statement_list_type; tree_plot_command *tree_plot_command_type; subplot *subplot_type; subplot_list *subplot_list_type; plot_limits *plot_limits_type; plot_range *plot_range_type; subplot_using *subplot_using_type; subplot_style *subplot_style_type; } YYSTYPE; #ifndef YYLTYPE typedef struct yyltype { int timestamp; int first_line; int first_column; int last_line; int last_column; char *text; } yyltype; #define YYLTYPE yyltype #endif #include #ifndef __cplusplus #ifndef __STDC__ #define const #endif #endif #define YYFINAL 328 #define YYFLAG -32768 #define YYNTBASE 72 #define YYTRANSLATE(x) ((unsigned)(x) <= 312 ? yytranslate[x] : 139) static const char yytranslate[] = { 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 65, 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, 68, 69, 7, 6, 64, 5, 71, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 63, 2, 3, 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, 67, 2, 70, 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, 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, 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, 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, 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, 2, 2, 1, 2, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 66 }; #if YYDEBUG != 0 static const short yyprhs[] = { 0, 0, 2, 4, 7, 9, 11, 13, 16, 19, 21, 23, 25, 27, 29, 32, 35, 37, 40, 43, 47, 51, 53, 56, 59, 61, 64, 67, 69, 71, 74, 76, 79, 80, 82, 84, 87, 90, 92, 96, 100, 102, 104, 107, 110, 114, 116, 119, 123, 129, 134, 139, 143, 146, 147, 149, 153, 155, 158, 160, 162, 164, 167, 170, 173, 176, 179, 182, 186, 190, 194, 198, 202, 206, 208, 211, 214, 218, 221, 224, 228, 234, 235, 237, 240, 242, 246, 248, 252, 253, 255, 257, 259, 261, 263, 271, 277, 285, 287, 289, 291, 295, 297, 300, 304, 307, 313, 317, 318, 320, 322, 324, 326, 329, 332, 335, 336, 340, 344, 351, 353, 355, 358, 361, 364, 367, 371, 375, 379, 383, 387, 391, 395, 399, 403, 407, 411, 415, 419, 423, 427, 431, 435, 439, 443, 447, 449, 451, 453, 457, 459, 461, 463, 466, 470, 472, 475, 478, 481, 484, 487, 491, 495, 498, 500, 503, 504, 505, 506, 507, 512, 517, 523, 528, 532, 535, 539, 542, 547, 550, 553, 557, 562, 567, 571, 573, 575, 577, 579, 580, 585, 587, 591, 596, 599, 602, 606, 609, 614, 617, 621, 624, 628, 630, 632, 634, 636, 640, 644, 648, 653, 655, 658, 662, 664, 667 }; static const short yyrhs[] = { 73, 0, 55, 0, 75, 74, 0, 74, 0, 65, 0, 75, 0, 75, 65, 0, 75, 55, 0, 50, 0, 1, 0, 77, 0, 78, 0, 76, 0, 76, 77, 0, 76, 78, 0, 84, 0, 77, 84, 0, 78, 84, 0, 76, 77, 84, 0, 76, 78, 84, 0, 63, 0, 77, 64, 0, 77, 63, 0, 64, 0, 78, 63, 0, 78, 64, 0, 64, 0, 65, 0, 79, 108, 0, 63, 0, 80, 108, 0, 0, 82, 0, 83, 0, 83, 79, 0, 83, 80, 0, 84, 0, 83, 79, 84, 0, 83, 80, 84, 0, 101, 0, 96, 0, 35, 62, 0, 35, 88, 0, 35, 86, 88, 0, 87, 0, 87, 87, 0, 87, 87, 87, 0, 60, 110, 59, 110, 61, 0, 60, 59, 110, 61, 0, 60, 110, 59, 61, 0, 60, 59, 61, 0, 60, 61, 0, 0, 89, 0, 88, 64, 89, 0, 110, 0, 110, 90, 0, 91, 0, 93, 0, 94, 0, 91, 93, 0, 93, 91, 0, 91, 94, 0, 94, 91, 0, 93, 94, 0, 94, 93, 0, 91, 93, 94, 0, 91, 94, 93, 0, 93, 91, 94, 0, 93, 94, 91, 0, 94, 91, 93, 0, 94, 93, 91, 0, 92, 0, 92, 110, 0, 56, 110, 0, 92, 59, 110, 0, 57, 110, 0, 58, 37, 0, 58, 37, 110, 0, 58, 37, 110, 95, 110, 0, 0, 110, 0, 48, 98, 0, 99, 0, 98, 100, 99, 0, 134, 0, 134, 3, 110, 0, 0, 64, 0, 85, 0, 120, 0, 97, 0, 102, 0, 46, 107, 81, 47, 107, 81, 34, 0, 39, 110, 107, 81, 34, 0, 38, 131, 3, 110, 107, 81, 34, 0, 43, 0, 44, 0, 45, 0, 40, 103, 34, 0, 104, 0, 104, 106, 0, 110, 107, 81, 0, 104, 105, 0, 41, 107, 110, 107, 81, 0, 42, 107, 81, 0, 0, 108, 0, 64, 0, 63, 0, 65, 0, 108, 64, 0, 108, 63, 0, 108, 65, 0, 0, 131, 3, 110, 0, 30, 3, 110, 0, 67, 109, 138, 52, 3, 110, 0, 111, 0, 112, 0, 134, 26, 0, 134, 27, 0, 111, 24, 0, 111, 25, 0, 111, 28, 111, 0, 111, 29, 111, 0, 111, 6, 111, 0, 111, 5, 111, 0, 111, 7, 111, 0, 111, 8, 111, 0, 111, 21, 111, 0, 111, 22, 111, 0, 111, 20, 111, 0, 111, 23, 111, 0, 111, 14, 111, 0, 111, 15, 111, 0, 111, 16, 111, 0, 111, 18, 111, 0, 111, 19, 111, 0, 111, 17, 111, 0, 111, 9, 111, 0, 111, 10, 111, 0, 111, 11, 111, 0, 111, 12, 111, 0, 30, 0, 31, 0, 36, 0, 68, 110, 69, 0, 114, 0, 131, 0, 136, 0, 67, 70, 0, 67, 63, 70, 0, 113, 0, 26, 134, 0, 27, 134, 0, 13, 111, 0, 6, 111, 0, 5, 111, 0, 111, 4, 111, 0, 113, 4, 111, 0, 134, 115, 0, 36, 0, 115, 36, 0, 0, 0, 0, 0, 51, 116, 119, 121, 0, 51, 116, 119, 125, 0, 33, 118, 116, 3, 125, 0, 123, 116, 3, 125, 0, 67, 118, 117, 0, 122, 70, 0, 122, 53, 70, 0, 124, 70, 0, 124, 64, 53, 70, 0, 122, 134, 0, 122, 1, 0, 124, 64, 134, 0, 134, 118, 117, 126, 0, 132, 107, 81, 127, 0, 107, 81, 127, 0, 34, 0, 55, 0, 129, 0, 134, 0, 0, 129, 71, 130, 49, 0, 128, 0, 128, 68, 69, 0, 128, 68, 135, 69, 0, 128, 67, 0, 68, 69, 0, 68, 53, 69, 0, 133, 69, 0, 133, 64, 53, 69, 0, 68, 134, 0, 133, 64, 134, 0, 68, 1, 0, 133, 64, 1, 0, 32, 0, 4, 0, 110, 0, 54, 0, 135, 64, 4, 0, 135, 64, 110, 0, 135, 64, 54, 0, 67, 109, 137, 70, 0, 138, 0, 137, 63, 0, 137, 63, 138, 0, 110, 0, 138, 64, 0, 138, 64, 110, 0 }; #endif #if YYDEBUG != 0 static const short yyrline[] = { 0, 290, 296, 302, 304, 308, 310, 312, 314, 318, 319, 322, 324, 326, 328, 333, 337, 339, 341, 343, 349, 353, 354, 355, 358, 359, 360, 363, 364, 365, 368, 369, 372, 374, 378, 380, 382, 389, 394, 396, 404, 406, 408, 416, 433, 452, 454, 456, 460, 462, 464, 466, 468, 472, 474, 476, 480, 482, 489, 491, 493, 495, 497, 499, 501, 503, 505, 507, 509, 511, 513, 515, 517, 521, 526, 533, 538, 542, 546, 548, 550, 554, 557, 561, 568, 570, 573, 575, 584, 585, 593, 595, 597, 599, 605, 613, 622, 630, 640, 651, 662, 670, 672, 676, 682, 686, 693, 697, 698, 701, 702, 703, 704, 705, 706, 709, 713, 716, 722, 729, 733, 735, 737, 739, 741, 743, 745, 747, 749, 751, 753, 755, 757, 759, 761, 763, 765, 767, 769, 771, 773, 775, 777, 779, 781, 785, 791, 798, 800, 805, 807, 809, 811, 816, 821, 823, 825, 827, 829, 831, 835, 838, 846, 853, 858, 867, 871, 875, 879, 883, 889, 897, 905, 912, 915, 917, 923, 925, 932, 934, 939, 943, 997, 1002, 1006, 1014, 1021, 1027, 1032, 1033, 1036, 1038, 1040, 1042, 1051, 1056, 1063, 1068, 1076, 1078, 1080, 1085, 1092, 1099, 1106, 1108, 1115, 1122, 1124, 1133, 1142, 1143, 1144, 1147, 1164, 1165 }; static const char * const yytname[] = { "$","error","$illegal.","'='","':'", "'-'","'+'","'*'","'/'","EXPR_AND_AND","EXPR_OR_OR","EXPR_AND","EXPR_OR","EXPR_NOT", "EXPR_LT","EXPR_LE","EXPR_EQ","EXPR_NE","EXPR_GE","EXPR_GT","LEFTDIV","EMUL", "EDIV","ELEFTDIV","QUOTE","TRANSPOSE","PLUS_PLUS","MINUS_MINUS","POW","EPOW", "NUM","IMAG_NUM","NAME","SCREW","END","PLOT","TEXT","STYLE","FOR","WHILE","IF", "ELSEIF","ELSE","BREAK","CONTINUE","FUNC_RET","UNWIND","CLEANUP","GLOBAL","TEXT_ID", "LEXICAL_ERROR","FCN","SCREW_TWO","ELLIPSIS","ALL_VA_ARGS","END_OF_INPUT","USING", "TITLE","WITH","COLON","OPEN_BRACE","CLOSE_BRACE","CLEAR","';'","','","'\\n'", "UNARY","'['","'('","')'","']'","'.'","input","input1","parse_error","simple_list", "simple_list1","semi_comma","comma_semi","comma_nl_sep","semi_sep","opt_list", "list","list1","statement","plot_command","ranges","ranges1","plot_command1", "plot_command2","plot_options","using","using1","title","style","bogus_syntax", "ans_expression","global_decl","global_decl1","global_decl2","optcomma","command", "if_command","if_cmd_list","if_cmd_list1","elseif_clause","else_clause","optsep", "sep","screwed_again","expression","simple_expr","simple_expr1","colon_expr", "word_list_cmd","word_list","g_symtab","local_symtab","safe","are_we_screwed", "func_def","func_def1","return_list_x","return_list","return_list1","func_def2", "func_def3","fcn_end_or_eof","indirect_ref","indirect_ref1","@1","variable", "param_list","param_list1","identifier","arg_list","matrix","rows","matrix_row", "" }; #endif static const short yyr1[] = { 0, 72, 72, 72, 72, 73, 73, 73, 73, 74, 74, 75, 75, 75, 75, 75, 76, 76, 76, 76, 76, 77, 77, 77, 78, 78, 78, 79, 79, 79, 80, 80, 81, 81, 82, 82, 82, 83, 83, 83, 84, 84, 84, 85, 85, 86, 86, 86, 87, 87, 87, 87, 87, 88, 88, 88, 89, 89, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 91, 91, 92, 92, 93, 94, 94, 94, 95, 96, 97, 98, 98, 99, 99, 100, 100, 101, 101, 101, 101, 101, 101, 101, 101, 101, 101, 102, 103, 103, 104, 104, 105, 106, 107, 107, 108, 108, 108, 108, 108, 108, 109, 110, 110, 110, 110, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 111, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 112, 113, 113, 114, 115, 115, 116, 117, 118, 119, 120, 120, 121, 121, 122, 123, 123, 123, 123, 124, 124, 124, 125, 126, 126, 127, 127, 128, 129, 130, 129, 131, 131, 131, 131, 132, 132, 132, 132, 133, 133, 133, 133, 134, 135, 135, 135, 135, 135, 135, 136, 137, 137, 137, 138, 138, 138 }; static const short yyr2[] = { 0, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 3, 3, 1, 2, 2, 1, 2, 2, 1, 1, 2, 1, 2, 0, 1, 1, 2, 2, 1, 3, 3, 1, 1, 2, 2, 3, 1, 2, 3, 5, 4, 4, 3, 2, 0, 1, 3, 1, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 1, 2, 2, 3, 2, 2, 3, 5, 0, 1, 2, 1, 3, 1, 3, 0, 1, 1, 1, 1, 1, 7, 5, 7, 1, 1, 1, 3, 1, 2, 3, 2, 5, 3, 0, 1, 1, 1, 1, 2, 2, 2, 0, 3, 3, 6, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 3, 1, 1, 1, 2, 3, 1, 2, 2, 2, 2, 2, 3, 3, 2, 1, 2, 0, 0, 0, 0, 4, 4, 5, 4, 3, 2, 3, 2, 4, 2, 2, 3, 4, 4, 3, 1, 1, 1, 1, 0, 4, 1, 3, 4, 2, 2, 3, 2, 4, 2, 3, 2, 3, 1, 1, 1, 1, 3, 3, 3, 4, 1, 2, 3, 1, 2, 3 }; static const short yydefact[] = { 0, 10, 0, 0, 0, 0, 0, 145, 146, 202, 53, 147, 0, 0, 0, 97, 98, 99, 107, 0, 9, 165, 2, 21, 24, 5, 115, 0, 1, 4, 0, 13, 11, 12, 16, 90, 41, 92, 40, 93, 82, 119, 120, 154, 149, 91, 190, 186, 150, 187, 151, 145, 115, 159, 150, 158, 157, 155, 156, 0, 0, 42, 53, 45, 43, 54, 56, 0, 187, 107, 0, 101, 107, 110, 109, 111, 32, 108, 83, 84, 86, 168, 0, 152, 0, 0, 8, 7, 3, 14, 15, 23, 22, 17, 25, 26, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 123, 124, 0, 0, 0, 193, 0, 188, 0, 121, 122, 163, 162, 0, 117, 0, 52, 0, 44, 46, 0, 0, 0, 0, 57, 58, 73, 59, 60, 0, 32, 100, 107, 107, 104, 102, 32, 0, 33, 34, 37, 113, 112, 114, 89, 0, 0, 0, 153, 213, 0, 210, 148, 19, 20, 160, 128, 127, 129, 130, 141, 142, 143, 144, 135, 136, 137, 140, 138, 139, 133, 131, 132, 134, 125, 126, 161, 203, 205, 191, 204, 0, 0, 116, 164, 210, 51, 0, 0, 47, 55, 75, 77, 78, 61, 63, 0, 74, 62, 65, 64, 66, 107, 0, 0, 32, 103, 107, 30, 27, 28, 35, 36, 85, 87, 167, 167, 169, 0, 165, 0, 170, 167, 211, 209, 0, 214, 0, 192, 189, 49, 50, 0, 79, 67, 68, 76, 69, 70, 71, 72, 32, 95, 107, 106, 32, 38, 29, 39, 31, 165, 166, 179, 0, 174, 178, 0, 0, 176, 166, 212, 0, 215, 206, 208, 207, 48, 0, 0, 32, 0, 0, 173, 175, 0, 0, 180, 107, 118, 80, 96, 105, 94, 0, 172, 177, 0, 32, 181, 107, 0, 171, 200, 0, 194, 198, 0, 32, 0, 196, 195, 184, 185, 183, 0, 201, 0, 199, 182, 197, 0, 0, 0 }; static const short yydefgoto[] = { 326, 28, 29, 30, 31, 32, 33, 227, 228, 153, 154, 155, 156, 35, 62, 63, 64, 65, 140, 141, 142, 143, 144, 283, 36, 37, 78, 79, 161, 38, 39, 70, 71, 150, 151, 76, 77, 84, 40, 41, 42, 43, 44, 128, 81, 288, 266, 163, 45, 233, 234, 235, 236, 237, 304, 319, 46, 47, 198, 48, 305, 306, 49, 197, 50, 166, 167 }; static const short yypact[] = { 353, -32768, 662, 662, 662, 13, 13, 56,-32768,-32768, 34, -32768, 13, 690, 690,-32768,-32768,-32768, -33, 13,-32768, -32768,-32768,-32768,-32768,-32768, -27, 690,-32768,-32768, 27, 54, 479, 523,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 766,-32768, 76,-32768,-32768, 74, 7, 97, 36,-32768, -32768, -27, 107,-32768, 107, 107,-32768,-32768, 690, 240, -32768, 690, 50, 58,-32768, 68, 117,-32768, -33, 93, 109, -33,-32768,-32768,-32768, 567, 75, -7,-32768, 130, -32768, 85,-32768, 690, 112,-32768,-32768,-32768, 479, 523, -32768,-32768,-32768,-32768,-32768,-32768, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662, 662,-32768,-32768, 662, 662, 662, -32768, 159,-32768, 690,-32768,-32768,-32768, 143, 690,-32768, 595,-32768, 121, 58, 50, 690, 690, 690, 145,-32768, 102, 611, 15, 110, 690, 567,-32768, -33, -33,-32768, -32768, 567, 136,-32768, 111,-32768,-32768,-32768,-32768,-32768, 13, 690, 1,-32768,-32768, -14, -26,-32768,-32768,-32768, 854, 124, 124, 80, 80, 792, 792, 818, 818, 844, 844, 844, 844, 844, 844, 80, 80, 80, 80, 107, 107, 854,-32768,-32768,-32768,-32768, 42, 135,-32768,-32768, 123,-32768, 127, 623,-32768,-32768,-32768,-32768, 690, 134, 137, 690,-32768, 134, 141, 137, 141, -33, 165, 690, 567,-32768, -33,-32768,-32768,-32768, 435, 435,-32768,-32768, -32768,-32768,-32768, 21,-32768, 11,-32768,-32768, 690,-32768, 190, 690, 401,-32768,-32768,-32768,-32768, 139, 701,-32768, -32768,-32768,-32768,-32768,-32768,-32768, 567,-32768, -33,-32768, 567,-32768, 75,-32768, 75,-32768,-32768,-32768, 132,-32768, -32768, 200, -3,-32768,-32768, 123, 690,-32768,-32768,-32768, -32768,-32768, 690, 171, 567, 172, 204,-32768,-32768, 13, 138,-32768, 105,-32768,-32768,-32768,-32768,-32768, 13,-32768, -32768, 14, 567,-32768, -33, 43,-32768,-32768, 140,-32768, -32768, 3, 567, 16,-32768,-32768,-32768,-32768,-32768, 3, -32768, 142,-32768,-32768,-32768, 210, 214,-32768 }; static const short yypgoto[] = {-32768, -32768, 188,-32768,-32768, 189, 191,-32768,-32768, -142,-32768, -32768, 9,-32768,-32768, -42, 157, 87,-32768, -131,-32768, -121, -125,-32768,-32768,-32768,-32768, 60,-32768,-32768,-32768, -32768,-32768,-32768,-32768, -61, -50, 178, -8, 237,-32768, -32768,-32768,-32768, -211, -51, -135,-32768,-32768,-32768,-32768, -32768,-32768, -255,-32768, -87,-32768,-32768,-32768, 213,-32768, -32768, -5,-32768,-32768,-32768, -126 }; #define YYLAST 883 static const short yytable[] = { 57, 58, 66, 201, 219, 69, 72, 68, 146, 34, 222, 152, 214, 216, 80, 308, 211, 321, 215, 85, 210, 135, 268, 217, 272, -88, 241, -6, 1, 9, 73, 74, 75, 9, 231, 300, 82, 317, 242, 2, 3, 93, 96, 83, 307, 9, 9, 4, 9, 239, 291, 130, 133, 9, 66, 287, 240, 160, 318, 59, 5, 6, 125, 126, 7, 8, 9, 309, 232, 322, 11, 137, 127, 139, 269, 273, 165, 20, 123, 260, 120, 274, 86, 310, 254, 250, 256, 220, 221, 253, 251, 270, 87, 205, 60, 255, 61, 267, 169, 170, 124, 26, 27, 275, 116, 117, 243, 314, 118, 119, 60, 244, 315, 276, 196, 284, 199, 23, 24, 286, 145, 165, 136, 203, 137, 138, 139, 147, 66, 207, 208, 100, 101, 162, 213, 118, 119, 218, 157, 158, 159, 121, 122, 297, 112, 113, 114, 115, 116, 117, 148, 149, 118, 119, 230, 164, 80, 257, 238, 138, 139, 312, 261, 193, 2, 3, 137, 138, 73, 74, 75, 320, 4, 302, 224, 225, 226, 263, 265, 200, 204, 168, 209, 223, 245, 5, 6, 242, 246, 7, 8, 9, 139, 277, 138, 11, 248, 137, 285, 258, 282, 249, 289, 290, 252, 296, 298, 299, 301, 316, 327, 325, 259, 194, 328, 54, 54, 54, 88, 134, 89, 229, 90, 206, 293, 67, 26, 27, 195, 271, 129, 165, 303, 324, 278, 281, 262, 264, 0, 53, 55, 56, 0, 0, 313, 2, 3, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 6, 292, 294, 7, 8, 9, 0, 0, 295, 11, 0, 0, 0, 0, 0, 0, 0, 0, 238, 0, 0, 0, 0, 0, 0, 0, 0, 238, 0, 0, 311, 0, 131, 0, 132, 0, 0, 0, 0, 0, 26, 27, 323, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 0, 0, 54, 54, 54, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 0, 1, 190, 191, 192, 2, 3, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 6, 0, 0, 7, 8, 9, 0, 0, 10, 11, 0, 12, 13, 14, 0, 0, 15, 16, 17, 18, 0, 19, 0, 20, 21, 279, 2, 3, 22, 0, 0, 0, 0, 0, 4, 0, 23, 24, 25, 0, 26, 27, 0, 0, 0, 0, 0, 5, 6, 0, 0, 7, 8, 9, 0, 0, 0, 11, 0, 0, 2, 3, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 280, 0, 0, 0, 0, 0, 5, 6, 0, 0, 7, 8, 9, 26, 27, 10, 11, 0, 12, 13, 14, 0, 0, 15, 16, 17, 18, 0, 19, 2, 3, 21, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 73, 74, 75, 0, 26, 27, 0, 5, 6, 0, 0, 7, 8, 9, 0, 0, 10, 11, 0, 12, 13, 14, 0, 0, 15, 16, 17, 18, 0, 19, 2, 3, 21, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 91, 92, 0, 0, 26, 27, 0, 5, 6, 0, 0, 7, 8, 9, 0, 0, 10, 11, 0, 12, 13, 14, 0, 0, 15, 16, 17, 18, 0, 19, 2, 3, 21, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 94, 95, 0, 0, 26, 27, 0, 5, 6, 0, 0, 7, 8, 9, 2, 3, 10, 11, 0, 12, 13, 14, 4, 0, 15, 16, 17, 18, 0, 19, 2, 3, 21, 0, 0, 5, 6, 0, 4, 7, 8, 9, 2, 3, 0, 11, 0, 0, 26, 27, 4, 5, 6, 0, 0, 7, 8, 9, 0, 0, 0, 11, 0, 5, 6, 0, 0, 7, 8, 9, 202, 0, 0, 11, 0, 0, 26, 27, 0, 0, 0, 2, 3, 0, 212, 0, 0, 0, 0, 4, 0, 0, 26, 27, 0, 0, 0, 0, 247, 0, 0, 0, 5, 6, 26, 27, 51, 8, 9, 2, 3, 0, 11, 0, 0, 0, 0, 4, 0, 0, -81, -81, 0, 0, 0, 0, 0, 0, -81, 0, 5, 6, 0, 0, 7, 8, 9, 0, 0, 0, 11, -81, -81, 52, 27, -81, -81, -81, 0, 0, 0, -81, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 26, 27, 0, 0, 0, 0, 0, 0, 0, 0, 0, -81, -81, 97, 98, 99, 100, 101, 102, 103, 104, 105, 0, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 0, 0, 118, 119, 97, 98, 99, 100, 101, 0, 0, 104, 105, 0, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 0, 0, 118, 119, 97, 98, 99, 100, 101, 0, 0, 0, 0, 0, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 0, 0, 118, 119, 97, 98, 99, 100, 101, 0, 0, 0, 0, 0, 0, 98, 99, 100, 101, 0, 112, 113, 114, 115, 116, 117, 0, 0, 118, 119, 112, 113, 114, 115, 116, 117, 0, 0, 118, 119 }; static const short yycheck[] = { 5, 6, 10, 129, 146, 13, 14, 12, 69, 0, 152, 72, 143, 144, 19, 1, 141, 1, 143, 27, 141, 63, 1, 144, 235, 32, 52, 0, 1, 32, 63, 64, 65, 32, 33, 290, 63, 34, 64, 5, 6, 32, 33, 70, 299, 32, 32, 13, 32, 63, 53, 59, 60, 32, 62, 266, 70, 64, 55, 3, 26, 27, 26, 27, 30, 31, 32, 53, 67, 53, 36, 56, 36, 58, 53, 64, 84, 50, 71, 221, 4, 70, 55, 69, 215, 210, 217, 148, 149, 214, 211, 70, 65, 135, 60, 216, 62, 232, 89, 90, 3, 67, 68, 238, 24, 25, 64, 64, 28, 29, 60, 69, 69, 239, 122, 257, 124, 63, 64, 261, 3, 129, 64, 131, 56, 57, 58, 34, 136, 137, 138, 7, 8, 3, 142, 28, 29, 145, 63, 64, 65, 67, 68, 285, 20, 21, 22, 23, 24, 25, 41, 42, 28, 29, 162, 70, 161, 218, 163, 57, 58, 303, 223, 4, 5, 6, 56, 57, 63, 64, 65, 313, 13, 68, 63, 64, 65, 227, 228, 36, 59, 69, 37, 47, 49, 26, 27, 64, 61, 30, 31, 32, 58, 3, 57, 36, 204, 56, 259, 34, 61, 209, 70, 3, 212, 34, 34, 3, 70, 69, 0, 69, 220, 54, 0, 2, 3, 4, 30, 62, 31, 161, 31, 136, 275, 12, 67, 68, 69, 234, 52, 239, 293, 320, 242, 243, 227, 228, -1, 2, 3, 4, -1, -1, 305, 5, 6, -1, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 26, 27, 273, 277, 30, 31, 32, -1, -1, 283, 36, -1, -1, -1, -1, -1, -1, -1, -1, 290, -1, -1, -1, -1, -1, -1, -1, -1, 299, -1, -1, 302, -1, 59, -1, 61, -1, -1, -1, -1, -1, 67, 68, 314, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, -1, -1, 118, 119, 120, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, -1, 1, 118, 119, 120, 5, 6, -1, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 26, 27, -1, -1, 30, 31, 32, -1, -1, 35, 36, -1, 38, 39, 40, -1, -1, 43, 44, 45, 46, -1, 48, -1, 50, 51, 4, 5, 6, 55, -1, -1, -1, -1, -1, 13, -1, 63, 64, 65, -1, 67, 68, -1, -1, -1, -1, -1, 26, 27, -1, -1, 30, 31, 32, -1, -1, -1, 36, -1, -1, 5, 6, -1, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, -1, 54, -1, -1, -1, -1, -1, 26, 27, -1, -1, 30, 31, 32, 67, 68, 35, 36, -1, 38, 39, 40, -1, -1, 43, 44, 45, 46, -1, 48, 5, 6, 51, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, 63, 64, 65, -1, 67, 68, -1, 26, 27, -1, -1, 30, 31, 32, -1, -1, 35, 36, -1, 38, 39, 40, -1, -1, 43, 44, 45, 46, -1, 48, 5, 6, 51, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, 63, 64, -1, -1, 67, 68, -1, 26, 27, -1, -1, 30, 31, 32, -1, -1, 35, 36, -1, 38, 39, 40, -1, -1, 43, 44, 45, 46, -1, 48, 5, 6, 51, -1, -1, -1, -1, -1, 13, -1, -1, -1, -1, -1, 63, 64, -1, -1, 67, 68, -1, 26, 27, -1, -1, 30, 31, 32, 5, 6, 35, 36, -1, 38, 39, 40, 13, -1, 43, 44, 45, 46, -1, 48, 5, 6, 51, -1, -1, 26, 27, -1, 13, 30, 31, 32, 5, 6, -1, 36, -1, -1, 67, 68, 13, 26, 27, -1, -1, 30, 31, 32, -1, -1, -1, 36, -1, 26, 27, -1, -1, 30, 31, 32, 61, -1, -1, 36, -1, -1, 67, 68, -1, -1, -1, 5, 6, -1, 59, -1, -1, -1, -1, 13, -1, -1, 67, 68, -1, -1, -1, -1, 61, -1, -1, -1, 26, 27, 67, 68, 30, 31, 32, 5, 6, -1, 36, -1, -1, -1, -1, 13, -1, -1, 5, 6, -1, -1, -1, -1, -1, -1, 13, -1, 26, 27, -1, -1, 30, 31, 32, -1, -1, -1, 36, 26, 27, 67, 68, 30, 31, 32, -1, -1, -1, 36, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 67, 68, -1, -1, -1, -1, -1, -1, -1, -1, -1, 67, 68, 4, 5, 6, 7, 8, 9, 10, 11, 12, -1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, 28, 29, 4, 5, 6, 7, 8, -1, -1, 11, 12, -1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, 28, 29, 4, 5, 6, 7, 8, -1, -1, -1, -1, -1, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, 28, 29, 4, 5, 6, 7, 8, -1, -1, -1, -1, -1, -1, 5, 6, 7, 8, -1, 20, 21, 22, 23, 24, 25, -1, -1, 28, 29, 20, 21, 22, 23, 24, 25, -1, -1, 28, 29 }; /* -*-C-*- Note some compilers choke on comments on `#line' lines. */ #line 3 "/usr/local/gnu/lib/bison.simple" /* Skeleton output parser for bison, Copyright (C) 1984, 1989, 1990 Bob Corbett and Richard Stallman 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef alloca #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not GNU C. */ #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) #include #else /* not sparc */ #if defined (MSDOS) && !defined (__TURBOC__) #include #else /* not MSDOS, or __TURBOC__ */ #if defined(_AIX) #include #pragma alloca #else /* not MSDOS, __TURBOC__, or _AIX */ #ifdef __hpux #ifdef __cplusplus extern "C" { void *alloca (unsigned int); }; #else /* not __cplusplus */ void *alloca (); #endif /* not __cplusplus */ #endif /* __hpux */ #endif /* not _AIX */ #endif /* not MSDOS, or __TURBOC__ */ #endif /* not sparc. */ #endif /* not GNU C. */ #endif /* alloca not defined. */ /* This is the parser code that is written into each bison parser when the %semantic_parser declaration is not specified in the grammar. It was written by Richard Stallman by simplifying the hairy parser used when %semantic_parser is specified. */ /* Note: there must be only one dollar sign in this file. It is replaced by the list of actions, each action as one case of the switch. */ #define yyerrok (yyerrstatus = 0) #define yyclearin (yychar = YYEMPTY) #define YYEMPTY -2 #define YYEOF 0 #define YYACCEPT return(0) #define YYABORT return(1) #define YYERROR goto yyerrlab1 /* Like YYERROR except do call yyerror. This remains here temporarily to ease the transition to the new meaning of YYERROR, for GCC. Once GCC version 2 has supplanted version 1, this can go. */ #define YYFAIL goto yyerrlab #define YYRECOVERING() (!!yyerrstatus) #define YYBACKUP(token, value) \ do \ if (yychar == YYEMPTY && yylen == 1) \ { yychar = (token), yylval = (value); \ yychar1 = YYTRANSLATE (yychar); \ YYPOPSTACK; \ goto yybackup; \ } \ else \ { yyerror ("syntax error: cannot back up"); YYERROR; } \ while (0) #define YYTERROR 1 #define YYERRCODE 256 #ifndef YYPURE #define YYLEX yylex() #endif #ifdef YYPURE #ifdef YYLSP_NEEDED #define YYLEX yylex(&yylval, &yylloc) #else #define YYLEX yylex(&yylval) #endif #endif /* If nonreentrant, generate the variables here */ #ifndef YYPURE int yychar; /* the lookahead symbol */ YYSTYPE yylval; /* the semantic value of the */ /* lookahead symbol */ #ifdef YYLSP_NEEDED YYLTYPE yylloc; /* location data for the lookahead */ /* symbol */ #endif int yynerrs; /* number of parse errors so far */ #endif /* not YYPURE */ #if YYDEBUG != 0 int yydebug; /* nonzero means print parse trace */ /* Since this is uninitialized, it does not stop multiple parsers from coexisting. */ #endif /* YYINITDEPTH indicates the initial size of the parser's stacks */ #ifndef YYINITDEPTH #define YYINITDEPTH 200 #endif /* YYMAXDEPTH is the maximum size the stacks can grow to (effective only if the built-in stack extension method is used). */ #if YYMAXDEPTH == 0 #undef YYMAXDEPTH #endif #ifndef YYMAXDEPTH #define YYMAXDEPTH 10000 #endif /* Prevent warning if -Wstrict-prototypes. */ #ifdef __GNUC__ int yyparse (void); #endif #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ #define __yy_bcopy(FROM,TO,COUNT) __builtin_memcpy(TO,FROM,COUNT) #else /* not GNU C or C++ */ #ifndef __cplusplus /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (from, to, count) char *from; char *to; int count; { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #else /* __cplusplus */ /* This is the most reliable way to avoid incompatibilities in available built-in functions on various systems. */ static void __yy_bcopy (char *from, char *to, int count) { register char *f = from; register char *t = to; register int i = count; while (i-- > 0) *t++ = *f++; } #endif #endif #line 184 "/usr/local/gnu/lib/bison.simple" int yyparse() { register int yystate; register int yyn; register short *yyssp; register YYSTYPE *yyvsp; int yyerrstatus; /* number of tokens to shift before error messages enabled */ int yychar1 = 0; /* lookahead token as an internal (translated) token number */ short yyssa[YYINITDEPTH]; /* the state stack */ YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ short *yyss = yyssa; /* refer to the stacks thru separate pointers */ YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ #ifdef YYLSP_NEEDED YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ YYLTYPE *yyls = yylsa; YYLTYPE *yylsp; #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) #else #define YYPOPSTACK (yyvsp--, yyssp--) #endif int yystacksize = YYINITDEPTH; #ifdef YYPURE int yychar; YYSTYPE yylval; int yynerrs; #ifdef YYLSP_NEEDED YYLTYPE yylloc; #endif #endif YYSTYPE yyval; /* the variable used to return */ /* semantic values from the action */ /* routines */ int yylen; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Starting parse\n"); #endif yystate = 0; yyerrstatus = 0; yynerrs = 0; yychar = YYEMPTY; /* Cause a token to be read. */ /* Initialize stack pointers. Waste one element of value and location stack so that they stay on the same level as the state stack. The wasted elements are never initialized. */ yyssp = yyss - 1; yyvsp = yyvs; #ifdef YYLSP_NEEDED yylsp = yyls; #endif /* Push a new state, which is found in yystate . */ /* In all cases, when you get here, the value and location stacks have just been pushed. so pushing a state here evens the stacks. */ yynewstate: *++yyssp = yystate; if (yyssp >= yyss + yystacksize - 1) { /* Give user a chance to reallocate the stack */ /* Use copies of these so that the &'s don't force the real ones into memory. */ YYSTYPE *yyvs1 = yyvs; short *yyss1 = yyss; #ifdef YYLSP_NEEDED YYLTYPE *yyls1 = yyls; #endif /* Get the current used size of the three stacks, in elements. */ int size = yyssp - yyss + 1; #ifdef yyoverflow /* Each stack pointer address is followed by the size of the data in use in that stack, in bytes. */ #ifdef YYLSP_NEEDED /* This used to be a conditional around just the two extra args, but that might be undefined if yyoverflow is a macro. */ yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yyls1, size * sizeof (*yylsp), &yystacksize); #else yyoverflow("parser stack overflow", &yyss1, size * sizeof (*yyssp), &yyvs1, size * sizeof (*yyvsp), &yystacksize); #endif yyss = yyss1; yyvs = yyvs1; #ifdef YYLSP_NEEDED yyls = yyls1; #endif #else /* no yyoverflow */ /* Extend the stack our own way. */ if (yystacksize >= YYMAXDEPTH) { yyerror("parser stack overflow"); return 2; } yystacksize *= 2; if (yystacksize > YYMAXDEPTH) yystacksize = YYMAXDEPTH; yyss = (short *) alloca (yystacksize * sizeof (*yyssp)); __yy_bcopy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp)); yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp)); __yy_bcopy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp)); #ifdef YYLSP_NEEDED yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp)); __yy_bcopy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp)); #endif #endif /* no yyoverflow */ yyssp = yyss + size - 1; yyvsp = yyvs + size - 1; #ifdef YYLSP_NEEDED yylsp = yyls + size - 1; #endif #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Stack size increased to %d\n", yystacksize); #endif if (yyssp >= yyss + yystacksize - 1) YYABORT; } #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Entering state %d\n", yystate); #endif goto yybackup; yybackup: /* Do appropriate processing given the current state. */ /* Read a lookahead token if we need one and don't already have one. */ /* yyresume: */ /* First try to decide what to do without reference to lookahead token. */ yyn = yypact[yystate]; if (yyn == YYFLAG) goto yydefault; /* Not known => get a lookahead token if don't already have one. */ /* yychar is either YYEMPTY or YYEOF or a valid token in external form. */ if (yychar == YYEMPTY) { #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Reading a token: "); #endif yychar = YYLEX; } /* Convert token to internal form (in yychar1) for indexing tables with */ if (yychar <= 0) /* This means end of input. */ { yychar1 = 0; yychar = YYEOF; /* Don't call YYLEX any more */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Now at end of input.\n"); #endif } else { yychar1 = YYTRANSLATE(yychar); #if YYDEBUG != 0 if (yydebug) { fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); /* Give the individual parser a way to print the precise meaning of a token, for further debugging info. */ #ifdef YYPRINT YYPRINT (stderr, yychar, yylval); #endif fprintf (stderr, ")\n"); } #endif } yyn += yychar1; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) goto yydefault; yyn = yytable[yyn]; /* yyn is what to do for this token type in this state. Negative => reduce, -yyn is rule number. Positive => shift, yyn is new state. New state is final state => don't bother to shift, just return success. 0, or most negative number => error. */ if (yyn < 0) { if (yyn == YYFLAG) goto yyerrlab; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrlab; if (yyn == YYFINAL) YYACCEPT; /* Shift the lookahead token. */ #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); #endif /* Discard the token being shifted unless it is eof. */ if (yychar != YYEOF) yychar = YYEMPTY; *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif /* count tokens shifted since error; after three, turn off error status. */ if (yyerrstatus) yyerrstatus--; yystate = yyn; goto yynewstate; /* Do the default action for the current state. */ yydefault: yyn = yydefact[yystate]; if (yyn == 0) goto yyerrlab; /* Do a reduction. yyn is the number of a rule to reduce with. */ yyreduce: yylen = yyr2[yyn]; if (yylen > 0) yyval = yyvsp[1-yylen]; /* implement default value of the action */ #if YYDEBUG != 0 if (yydebug) { int i; fprintf (stderr, "Reducing via rule %d (line %d), ", yyn, yyrline[yyn]); /* Print the symbols being reduced, and their result. */ for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) fprintf (stderr, "%s ", yytname[yyrhs[i]]); fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); } #endif switch (yyn) { case 1: #line 291 "parse.y" { global_command = yyvsp[0].tree_statement_list_type; promptflag = 1; YYACCEPT; ; break;} case 2: #line 297 "parse.y" { global_command = 0; promptflag = 1; YYABORT; ; break;} case 3: #line 303 "parse.y" { ABORT_PARSE; ; break;} case 4: #line 305 "parse.y" { ABORT_PARSE; ; break;} case 5: #line 309 "parse.y" { yyval.tree_statement_list_type = 0; ; break;} case 6: #line 311 "parse.y" { yyval.tree_statement_list_type = yyvsp[0].tree_statement_list_type; ; break;} case 7: #line 313 "parse.y" { yyval.tree_statement_list_type = yyvsp[-1].tree_statement_list_type; ; break;} case 8: #line 315 "parse.y" { yyval.tree_statement_list_type = yyvsp[-1].tree_statement_list_type; ; break;} case 11: #line 323 "parse.y" { yyval.tree_statement_list_type = 0; ; break;} case 12: #line 325 "parse.y" { yyval.tree_statement_list_type = 0; ; break;} case 13: #line 327 "parse.y" { yyval.tree_statement_list_type = yyvsp[0].tree_statement_list_type; ; break;} case 14: #line 329 "parse.y" { tree_statement *tmp = yyvsp[-1].tree_statement_list_type->rear (); tmp->set_print_flag (0); ; break;} case 15: #line 334 "parse.y" { yyval.tree_statement_list_type = yyvsp[-1].tree_statement_list_type; ; break;} case 16: #line 338 "parse.y" { yyval.tree_statement_list_type = new tree_statement_list (yyvsp[0].tree_statement_type); ; break;} case 17: #line 340 "parse.y" { yyval.tree_statement_list_type = new tree_statement_list (yyvsp[0].tree_statement_type); ; break;} case 18: #line 342 "parse.y" { yyval.tree_statement_list_type = new tree_statement_list (yyvsp[0].tree_statement_type); ; break;} case 19: #line 344 "parse.y" { tree_statement *tmp = yyvsp[-2].tree_statement_list_type->rear (); tmp->set_print_flag (0); yyvsp[-2].tree_statement_list_type->append (yyvsp[0].tree_statement_type); ; break;} case 20: #line 350 "parse.y" { yyvsp[-2].tree_statement_list_type->append (yyvsp[0].tree_statement_type); ; break;} case 32: #line 373 "parse.y" { yyval.tree_statement_list_type = new tree_statement_list (); ; break;} case 33: #line 375 "parse.y" { yyval.tree_statement_list_type = yyvsp[0].tree_statement_list_type; ; break;} case 34: #line 379 "parse.y" { yyval.tree_statement_list_type = yyvsp[0].tree_statement_list_type; ; break;} case 35: #line 381 "parse.y" { yyval.tree_statement_list_type = yyvsp[-1].tree_statement_list_type; ; break;} case 36: #line 383 "parse.y" { tree_statement *tmp = yyvsp[-1].tree_statement_list_type->rear (); tmp->set_print_flag (0); ; break;} case 37: #line 390 "parse.y" { beginning_of_function = 0; yyval.tree_statement_list_type = new tree_statement_list (yyvsp[0].tree_statement_type); ; break;} case 38: #line 395 "parse.y" { yyvsp[-2].tree_statement_list_type->append (yyvsp[0].tree_statement_type); ; break;} case 39: #line 397 "parse.y" { tree_statement *tmp = yyvsp[-2].tree_statement_list_type->rear (); tmp->set_print_flag (0); yyvsp[-2].tree_statement_list_type->append (yyvsp[0].tree_statement_type); ; break;} case 40: #line 405 "parse.y" { yyval.tree_statement_type = new tree_statement (yyvsp[0].tree_command_type); ; break;} case 41: #line 407 "parse.y" { yyval.tree_statement_type = new tree_statement (yyvsp[0].tree_expression_type); ; break;} case 42: #line 409 "parse.y" { symbol_record *sr = lookup_by_name ("clearplot", 0); tree_identifier *id = new tree_identifier (sr); yyval.tree_statement_type = new tree_statement (id); ; break;} case 43: #line 417 "parse.y" { if (! yyvsp[0].subplot_list_type && yyvsp[-1].tok_val->pttype () != token::replot) { yyerror ("must have something to plot"); ABORT_PARSE; } else { yyval.tree_plot_command_type = new tree_plot_command (yyvsp[0].subplot_list_type, yyvsp[-1].tok_val->pttype ()); plotting = 0; past_plot_range = 0; in_plot_range = 0; in_plot_using = 0; in_plot_style = 0; } ; break;} case 44: #line 434 "parse.y" { if (yyvsp[-2].tok_val->pttype () == token::replot) { yyerror ("cannot specify new ranges with replot"); ABORT_PARSE; } else { yyval.tree_plot_command_type = new tree_plot_command (yyvsp[0].subplot_list_type, yyvsp[-1].plot_limits_type, yyvsp[-2].tok_val->pttype ()); plotting = 0; past_plot_range = 0; in_plot_range = 0; in_plot_using = 0; in_plot_style = 0; } ; break;} case 45: #line 453 "parse.y" { yyval.plot_limits_type = new plot_limits (yyvsp[0].plot_range_type); ; break;} case 46: #line 455 "parse.y" { yyval.plot_limits_type = new plot_limits (yyvsp[-1].plot_range_type, yyvsp[0].plot_range_type); ; break;} case 47: #line 457 "parse.y" { yyval.plot_limits_type = new plot_limits (yyvsp[-2].plot_range_type, yyvsp[-1].plot_range_type, yyvsp[0].plot_range_type); ; break;} case 48: #line 461 "parse.y" { yyval.plot_range_type = new plot_range (yyvsp[-3].tree_expression_type, yyvsp[-1].tree_expression_type); ; break;} case 49: #line 463 "parse.y" { yyval.plot_range_type = new plot_range (0, yyvsp[-1].tree_expression_type); ; break;} case 50: #line 465 "parse.y" { yyval.plot_range_type = new plot_range (yyvsp[-2].tree_expression_type, 0); ; break;} case 51: #line 467 "parse.y" { yyval.plot_range_type = new plot_range (); ; break;} case 52: #line 469 "parse.y" { yyval.plot_range_type = new plot_range (); ; break;} case 53: #line 473 "parse.y" { yyval.subplot_list_type = 0; ; break;} case 54: #line 475 "parse.y" { yyval.subplot_list_type = new subplot_list (yyvsp[0].subplot_type); ; break;} case 55: #line 477 "parse.y" { yyvsp[-2].subplot_list_type->append (yyvsp[0].subplot_type); ; break;} case 56: #line 481 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].tree_expression_type); ; break;} case 57: #line 483 "parse.y" { yyvsp[0].subplot_type->set_data (yyvsp[-1].tree_expression_type); yyval.subplot_type = yyvsp[0].subplot_type; ; break;} case 58: #line 490 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].subplot_using_type, 0, 0); ; break;} case 59: #line 492 "parse.y" { yyval.subplot_type = new subplot (0, yyvsp[0].tree_expression_type, 0); ; break;} case 60: #line 494 "parse.y" { yyval.subplot_type = new subplot (0, 0, yyvsp[0].subplot_style_type); ; break;} case 61: #line 496 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-1].subplot_using_type, yyvsp[0].tree_expression_type, 0); ; break;} case 62: #line 498 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].subplot_using_type, yyvsp[-1].tree_expression_type, 0); ; break;} case 63: #line 500 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-1].subplot_using_type, 0, yyvsp[0].subplot_style_type); ; break;} case 64: #line 502 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].subplot_using_type, 0, yyvsp[-1].subplot_style_type); ; break;} case 65: #line 504 "parse.y" { yyval.subplot_type = new subplot (0, yyvsp[-1].tree_expression_type, yyvsp[0].subplot_style_type); ; break;} case 66: #line 506 "parse.y" { yyval.subplot_type = new subplot (0, yyvsp[0].tree_expression_type, yyvsp[-1].subplot_style_type); ; break;} case 67: #line 508 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-2].subplot_using_type, yyvsp[-1].tree_expression_type, yyvsp[0].subplot_style_type); ; break;} case 68: #line 510 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-2].subplot_using_type, yyvsp[0].tree_expression_type, yyvsp[-1].subplot_style_type); ; break;} case 69: #line 512 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-1].subplot_using_type, yyvsp[-2].tree_expression_type, yyvsp[0].subplot_style_type); ; break;} case 70: #line 514 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].subplot_using_type, yyvsp[-2].tree_expression_type, yyvsp[-1].subplot_style_type); ; break;} case 71: #line 516 "parse.y" { yyval.subplot_type = new subplot (yyvsp[-1].subplot_using_type, yyvsp[0].tree_expression_type, yyvsp[-2].subplot_style_type); ; break;} case 72: #line 518 "parse.y" { yyval.subplot_type = new subplot (yyvsp[0].subplot_using_type, yyvsp[-1].tree_expression_type, yyvsp[-2].subplot_style_type); ; break;} case 73: #line 522 "parse.y" { in_plot_using = 0; yyval.subplot_using_type = yyvsp[0].subplot_using_type; ; break;} case 74: #line 527 "parse.y" { in_plot_using = 0; yyval.subplot_using_type = yyvsp[-1].subplot_using_type->set_format (yyvsp[0].tree_expression_type); ; break;} case 75: #line 534 "parse.y" { subplot_using *tmp = new subplot_using (); yyval.subplot_using_type = tmp->add_qualifier (yyvsp[0].tree_expression_type); ; break;} case 76: #line 539 "parse.y" { yyval.subplot_using_type = yyvsp[-2].subplot_using_type->add_qualifier (yyvsp[0].tree_expression_type); ; break;} case 77: #line 543 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_expression_type; ; break;} case 78: #line 547 "parse.y" { yyval.subplot_style_type = new subplot_style (yyvsp[0].tok_val->string ()); ; break;} case 79: #line 549 "parse.y" { yyval.subplot_style_type = new subplot_style (yyvsp[-1].tok_val->string (), yyvsp[0].tree_expression_type); ; break;} case 80: #line 551 "parse.y" { yyval.subplot_style_type = new subplot_style (yyvsp[-3].tok_val->string (), yyvsp[-2].tree_expression_type, yyvsp[0].tree_expression_type); ; break;} case 82: #line 558 "parse.y" { yyval.tree_expression_type = maybe_convert_to_ans_assign (yyvsp[0].tree_expression_type); ; break;} case 83: #line 562 "parse.y" { yyval.tree_global_command_type = new tree_global_command (yyvsp[0].tree_global_init_list_type, yyvsp[-1].tok_val->line (), yyvsp[-1].tok_val->column ()); ; break;} case 84: #line 569 "parse.y" { yyval.tree_global_init_list_type = new tree_global_init_list (yyvsp[0].tree_global_type); ; break;} case 85: #line 571 "parse.y" { yyvsp[-2].tree_global_init_list_type->append (yyvsp[0].tree_global_type); ; break;} case 86: #line 574 "parse.y" { yyval.tree_global_type = new tree_global (yyvsp[0].tree_identifier_type); ; break;} case 87: #line 576 "parse.y" { tree_simple_assignment_expression *tmp_ass; tmp_ass = new tree_simple_assignment_expression (yyvsp[-2].tree_identifier_type, yyvsp[0].tree_expression_type, 0, 0, yyvsp[-1].tok_val->line (), yyvsp[-1].tok_val->column ()); yyval.tree_global_type = new tree_global (tmp_ass); ; break;} case 89: #line 586 "parse.y" { if (user_pref.warn_comma_in_global_decl) warning ("comma in global declaration not\ interpreted as a command separator"); ; break;} case 90: #line 594 "parse.y" { yyval.tree_command_type = yyvsp[0].tree_plot_command_type; ; break;} case 91: #line 596 "parse.y" { yyval.tree_command_type = yyvsp[0].tree_command_type; ; break;} case 92: #line 598 "parse.y" { yyval.tree_command_type = yyvsp[0].tree_global_command_type; ; break;} case 93: #line 600 "parse.y" { iffing--; yyval.tree_command_type = yyvsp[0].tree_if_command_type; ; break;} case 94: #line 606 "parse.y" { if (check_end (yyvsp[0].tok_val, token::unwind_protect_end)) ABORT_PARSE; yyval.tree_command_type = new tree_unwind_protect_command (yyvsp[-4].tree_statement_list_type, yyvsp[-1].tree_statement_list_type, yyvsp[-6].tok_val->line (), yyvsp[-6].tok_val->column ()); ; break;} case 95: #line 614 "parse.y" { maybe_warn_assign_as_truth_value (yyvsp[-3].tree_expression_type); if (check_end (yyvsp[0].tok_val, token::while_end)) ABORT_PARSE; looping--; yyval.tree_command_type = new tree_while_command (yyvsp[-3].tree_expression_type, yyvsp[-1].tree_statement_list_type, yyvsp[-4].tok_val->line (), yyvsp[-4].tok_val->column ()); ; break;} case 96: #line 623 "parse.y" { if (check_end (yyvsp[0].tok_val, token::for_end)) ABORT_PARSE; looping--; yyval.tree_command_type = new tree_for_command (yyvsp[-5].tree_index_expression_type, yyvsp[-3].tree_expression_type, yyvsp[-1].tree_statement_list_type, yyvsp[-6].tok_val->line (), yyvsp[-6].tok_val->column ()); ; break;} case 97: #line 631 "parse.y" { if (!looping) { yyerror ("break: only meaningful within a `for'\ or `while' loop"); ABORT_PARSE; } yyval.tree_command_type = new tree_break_command (yyvsp[0].tok_val->line (), yyvsp[0].tok_val->column ()); ; break;} case 98: #line 641 "parse.y" { if (!looping) { yyerror ("continue: only meaningful within a\ `for' or `while' loop"); ABORT_PARSE; } yyval.tree_command_type = new tree_continue_command (yyvsp[0].tok_val->line (), yyvsp[0].tok_val->column ()); ; break;} case 99: #line 652 "parse.y" { if (!defining_func) { yyerror ("return: only meaningful within a function"); ABORT_PARSE; } yyval.tree_command_type = new tree_return_command (yyvsp[0].tok_val->line (), yyvsp[0].tok_val->column ()); ; break;} case 100: #line 663 "parse.y" { if (check_end (yyvsp[0].tok_val, token::if_end)) ABORT_PARSE; yyval.tree_if_command_type = new tree_if_command (yyvsp[-1].tree_if_command_list_type, yyvsp[-2].tok_val->line (), yyvsp[-2].tok_val->column ()); ; break;} case 101: #line 671 "parse.y" { yyval.tree_if_command_list_type = yyvsp[0].tree_if_command_list_type ; break;} case 102: #line 673 "parse.y" { yyvsp[-1].tree_if_command_list_type->append (yyvsp[0].tree_if_clause_type); ; break;} case 103: #line 677 "parse.y" { maybe_warn_assign_as_truth_value (yyvsp[-2].tree_expression_type); tree_if_clause *t = new tree_if_clause (yyvsp[-2].tree_expression_type, yyvsp[0].tree_statement_list_type); yyval.tree_if_command_list_type = new tree_if_command_list (t); ; break;} case 104: #line 683 "parse.y" { yyvsp[-1].tree_if_command_list_type->append (yyvsp[0].tree_if_clause_type); ; break;} case 105: #line 687 "parse.y" { maybe_warn_assign_as_truth_value (yyvsp[-2].tree_expression_type); yyval.tree_if_clause_type = new tree_if_clause (yyvsp[-2].tree_expression_type, yyvsp[0].tree_statement_list_type); ; break;} case 106: #line 694 "parse.y" { yyval.tree_if_clause_type = new tree_if_clause (yyvsp[0].tree_statement_list_type); ; break;} case 115: #line 710 "parse.y" { maybe_screwed_again++; ; break;} case 116: #line 714 "parse.y" { yyval.tree_expression_type = new tree_simple_assignment_expression (yyvsp[-2].tree_index_expression_type, yyvsp[0].tree_expression_type, 0, 0, yyvsp[-1].tok_val->line (), yyvsp[-1].tok_val->column ()); ; break;} case 117: #line 717 "parse.y" { yyerror ("invalid assignment to a number"); yyval.tree_expression_type = 0; ABORT_PARSE; ; break;} case 118: #line 723 "parse.y" { yyval.tree_expression_type = make_multi_val_ret (yyvsp[0].tree_expression_type, yyvsp[-1].tok_val->line (), yyvsp[-1].tok_val->column ()); if (! yyval.tree_expression_type) ABORT_PARSE; ; break;} case 119: #line 730 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_expression_type; ; break;} case 120: #line 734 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_expression_type; ; break;} case 121: #line 736 "parse.y" { yyval.tree_expression_type = make_postfix_op (PLUS_PLUS, yyvsp[-1].tree_identifier_type, yyvsp[0].tok_val); ; break;} case 122: #line 738 "parse.y" { yyval.tree_expression_type = make_postfix_op (MINUS_MINUS, yyvsp[-1].tree_identifier_type, yyvsp[0].tok_val); ; break;} case 123: #line 740 "parse.y" { yyval.tree_expression_type = make_unary_op (QUOTE, yyvsp[-1].tree_expression_type, yyvsp[0].tok_val); ; break;} case 124: #line 742 "parse.y" { yyval.tree_expression_type = make_unary_op (TRANSPOSE, yyvsp[-1].tree_expression_type, yyvsp[0].tok_val); ; break;} case 125: #line 744 "parse.y" { yyval.tree_expression_type = make_binary_op (POW, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 126: #line 746 "parse.y" { yyval.tree_expression_type = make_binary_op (EPOW, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 127: #line 748 "parse.y" { yyval.tree_expression_type = make_binary_op ('+', yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 128: #line 750 "parse.y" { yyval.tree_expression_type = make_binary_op ('-', yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 129: #line 752 "parse.y" { yyval.tree_expression_type = make_binary_op ('*', yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 130: #line 754 "parse.y" { yyval.tree_expression_type = make_binary_op ('/', yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 131: #line 756 "parse.y" { yyval.tree_expression_type = make_binary_op (EMUL, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 132: #line 758 "parse.y" { yyval.tree_expression_type = make_binary_op (EDIV, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 133: #line 760 "parse.y" { yyval.tree_expression_type = make_binary_op (LEFTDIV, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 134: #line 762 "parse.y" { yyval.tree_expression_type = make_binary_op (ELEFTDIV, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 135: #line 764 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_LT, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 136: #line 766 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_LE, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 137: #line 768 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_EQ, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 138: #line 770 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_GE, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 139: #line 772 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_GT, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 140: #line 774 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_NE, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 141: #line 776 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_AND_AND, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 142: #line 778 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_OR_OR, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 143: #line 780 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_AND, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 144: #line 782 "parse.y" { yyval.tree_expression_type = make_binary_op (EXPR_OR, yyvsp[-2].tree_expression_type, yyvsp[-1].tok_val, yyvsp[0].tree_expression_type); ; break;} case 145: #line 786 "parse.y" { tree_constant *tmp = new tree_constant (yyvsp[0].tok_val->number ()); tmp->stash_original_text (yyvsp[0].tok_val->text_rep ()); yyval.tree_expression_type = tmp; ; break;} case 146: #line 792 "parse.y" { Complex c (0.0, yyvsp[0].tok_val->number ()); tree_constant *tmp = new tree_constant (c); tmp->stash_original_text (yyvsp[0].tok_val->text_rep ()); yyval.tree_expression_type = tmp; ; break;} case 147: #line 799 "parse.y" { yyval.tree_expression_type = new tree_constant (yyvsp[0].tok_val->string ()); ; break;} case 148: #line 801 "parse.y" { yyvsp[-1].tree_expression_type->in_parens++; yyval.tree_expression_type = yyvsp[-1].tree_expression_type; ; break;} case 149: #line 806 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_index_expression_type; ; break;} case 150: #line 808 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_index_expression_type; ; break;} case 151: #line 810 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_matrix_type; ; break;} case 152: #line 812 "parse.y" { mlnm.pop (); yyval.tree_expression_type = new tree_constant (Matrix ()); ; break;} case 153: #line 817 "parse.y" { mlnm.pop (); yyval.tree_expression_type = new tree_constant (Matrix ()); ; break;} case 154: #line 822 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_colon_expression_type; ; break;} case 155: #line 824 "parse.y" { yyval.tree_expression_type = make_prefix_op (PLUS_PLUS, yyvsp[0].tree_identifier_type, yyvsp[-1].tok_val); ; break;} case 156: #line 826 "parse.y" { yyval.tree_expression_type = make_prefix_op (MINUS_MINUS, yyvsp[0].tree_identifier_type, yyvsp[-1].tok_val); ; break;} case 157: #line 828 "parse.y" { yyval.tree_expression_type = make_unary_op (EXPR_NOT, yyvsp[0].tree_expression_type, yyvsp[-1].tok_val); ; break;} case 158: #line 830 "parse.y" { yyval.tree_expression_type = yyvsp[0].tree_expression_type; ; break;} case 159: #line 832 "parse.y" { yyval.tree_expression_type = make_unary_op ('-', yyvsp[0].tree_expression_type, yyvsp[-1].tok_val); ; break;} case 160: #line 836 "parse.y" { yyval.tree_colon_expression_type = new tree_colon_expression (yyvsp[-2].tree_expression_type, yyvsp[0].tree_expression_type, yyvsp[-1].tok_val->line (), yyvsp[-1].tok_val->column ()); ; break;} case 161: #line 839 "parse.y" { yyval.tree_colon_expression_type = yyvsp[-2].tree_colon_expression_type->chain (yyvsp[0].tree_expression_type); if (! yyval.tree_colon_expression_type) ABORT_PARSE; ; break;} case 162: #line 847 "parse.y" { yyval.tree_index_expression_type = new tree_index_expression (yyvsp[-1].tree_identifier_type, yyvsp[0].tree_argument_list_type, yyvsp[-1].tree_identifier_type->line (), yyvsp[-1].tree_identifier_type->column ()); ; break;} case 163: #line 854 "parse.y" { tree_constant *tmp = new tree_constant (yyvsp[0].tok_val->string ()); yyval.tree_argument_list_type = new tree_argument_list (tmp); ; break;} case 164: #line 859 "parse.y" { tree_constant *tmp = new tree_constant (yyvsp[0].tok_val->string ()); yyvsp[-1].tree_argument_list_type->append (tmp); ; break;} case 165: #line 868 "parse.y" { curr_sym_tab = global_sym_tab; ; break;} case 166: #line 872 "parse.y" { curr_sym_tab = tmp_local_sym_tab; ; break;} case 167: #line 876 "parse.y" { maybe_screwed = 0; ; break;} case 168: #line 880 "parse.y" { maybe_screwed = 1; ; break;} case 169: #line 884 "parse.y" { curr_sym_tab = top_level_sym_tab; defining_func = 0; yyval.tree_command_type = 0; ; break;} case 170: #line 890 "parse.y" { curr_sym_tab = top_level_sym_tab; defining_func = 0; yyval.tree_command_type = 0; ; break;} case 171: #line 898 "parse.y" { tree_identifier *tmp = new tree_identifier (yyvsp[-4].tok_val->sym_rec (), yyvsp[-4].tok_val->line (), yyvsp[-4].tok_val->column ()); tree_parameter_list *tpl = new tree_parameter_list (tmp); tpl->mark_as_formal_parameters (); yyval.tree_function_type = yyvsp[0].tree_function_type->define_ret_list (tpl); ; break;} case 172: #line 906 "parse.y" { yyvsp[-3].tree_parameter_list_type->mark_as_formal_parameters (); yyval.tree_function_type = yyvsp[0].tree_function_type->define_ret_list (yyvsp[-3].tree_parameter_list_type); ; break;} case 174: #line 916 "parse.y" { yyval.tree_parameter_list_type = new tree_parameter_list (); ; break;} case 175: #line 918 "parse.y" { tree_parameter_list *tmp = new tree_parameter_list (); tmp->mark_varargs_only (); yyval.tree_parameter_list_type = tmp; ; break;} case 176: #line 924 "parse.y" { yyval.tree_parameter_list_type = yyvsp[-1].tree_parameter_list_type; ; break;} case 177: #line 926 "parse.y" { yyvsp[-3].tree_parameter_list_type->mark_varargs (); yyval.tree_parameter_list_type = yyvsp[-3].tree_parameter_list_type; ; break;} case 178: #line 933 "parse.y" { yyval.tree_parameter_list_type = new tree_parameter_list (yyvsp[0].tree_identifier_type); ; break;} case 179: #line 935 "parse.y" { yyerror ("invalid function return list"); ABORT_PARSE; ; break;} case 180: #line 940 "parse.y" { yyvsp[-2].tree_parameter_list_type->append (yyvsp[0].tree_identifier_type); ; break;} case 181: #line 944 "parse.y" { char *id_name = yyvsp[-3].tree_identifier_type->name (); // if (is_text_function_name (id_name)) // { // yyerror ("invalid use of reserved word %s", id_name); // ABORT_PARSE; // } // If input is coming from a file, issue a warning if the name of the // file does not match the name of the function stated in the file. // Matlab doesn't provide a diagnostic (it ignores the stated name). yyvsp[0].tree_function_type->stash_function_name (id_name); if (reading_fcn_file) { if (strcmp (curr_fcn_file_name, id_name) != 0) { warning ("function name `%s' does not agree\ with function file name `%s.m'", id_name, curr_fcn_file_name); global_sym_tab->rename (id_name, curr_fcn_file_name); if (error_state) ABORT_PARSE; id_name = yyvsp[-3].tree_identifier_type->name (); } yyvsp[0].tree_function_type->stash_function_name (id_name); yyvsp[0].tree_function_type->stash_fcn_file_name (); yyvsp[0].tree_function_type->stash_fcn_file_time (time (0)); yyvsp[0].tree_function_type->mark_as_system_fcn_file (); } else if (! (input_from_tmp_history_file || input_from_startup_file) && reading_script_file && strcmp (curr_fcn_file_name, id_name) == 0) { warning ("function `%s' defined within\ script file `%s.m'", id_name, curr_fcn_file_name); } top_level_sym_tab->clear (id_name); yyvsp[-3].tree_identifier_type->define (yyvsp[0].tree_function_type); yyvsp[-3].tree_identifier_type->document (help_buf); yyval.tree_function_type = yyvsp[0].tree_function_type; ; break;} case 182: #line 998 "parse.y" { tree_function *fcn = new tree_function (yyvsp[-1].tree_statement_list_type, curr_sym_tab); yyval.tree_function_type = fcn->define_param_list (yyvsp[-3].tree_parameter_list_type); ; break;} case 183: #line 1003 "parse.y" { yyval.tree_function_type = new tree_function (yyvsp[-1].tree_statement_list_type, curr_sym_tab); ; break;} case 184: #line 1007 "parse.y" { if (check_end (yyvsp[0].tok_val, token::function_end)) ABORT_PARSE; if (reading_fcn_file) check_for_garbage_after_fcn_def (); ; break;} case 185: #line 1015 "parse.y" { if (! (reading_fcn_file || reading_script_file)) YYABORT; ; break;} case 186: #line 1022 "parse.y" { looking_at_indirect_ref = 0; yyval.tree_indirect_ref_type = yyvsp[0].tree_indirect_ref_type; ; break;} case 187: #line 1028 "parse.y" { yyval.tree_indirect_ref_type = new tree_indirect_ref (yyvsp[0].tree_identifier_type, yyvsp[0].tree_identifier_type->line (), yyvsp[0].tree_identifier_type->column ()); ; break;} case 188: #line 1032 "parse.y" { looking_at_indirect_ref = 1; ; break;} case 189: #line 1033 "parse.y" { yyval.tree_indirect_ref_type = yyvsp[-3].tree_indirect_ref_type->chain (yyvsp[0].tok_val->string ()); ; break;} case 190: #line 1037 "parse.y" { yyval.tree_index_expression_type = make_index_expression (yyvsp[0].tree_indirect_ref_type, 0); ; break;} case 191: #line 1039 "parse.y" { yyval.tree_index_expression_type = make_index_expression (yyvsp[-2].tree_indirect_ref_type, 0); ; break;} case 192: #line 1041 "parse.y" { yyval.tree_index_expression_type = make_index_expression (yyvsp[-3].tree_indirect_ref_type, yyvsp[-1].tree_argument_list_type); ; break;} case 193: #line 1043 "parse.y" { yyerror ("use `(\' and `)\' as index operators, not\ `[\' and `]\'"); yyval.tree_index_expression_type = 0; ABORT_PARSE; ; break;} case 194: #line 1052 "parse.y" { quote_is_transpose = 0; yyval.tree_parameter_list_type = 0; ; break;} case 195: #line 1057 "parse.y" { quote_is_transpose = 0; tree_parameter_list *tmp = new tree_parameter_list (); tmp->mark_varargs_only (); yyval.tree_parameter_list_type = tmp; ; break;} case 196: #line 1064 "parse.y" { quote_is_transpose = 0; yyvsp[-1].tree_parameter_list_type->mark_as_formal_parameters (); ; break;} case 197: #line 1069 "parse.y" { quote_is_transpose = 0; yyvsp[-3].tree_parameter_list_type->mark_as_formal_parameters (); yyvsp[-3].tree_parameter_list_type->mark_varargs (); ; break;} case 198: #line 1077 "parse.y" { yyval.tree_parameter_list_type = new tree_parameter_list (yyvsp[0].tree_identifier_type); ; break;} case 199: #line 1079 "parse.y" { yyvsp[-2].tree_parameter_list_type->append (yyvsp[0].tree_identifier_type); ; break;} case 200: #line 1081 "parse.y" { yyerror ("invalid parameter list"); ABORT_PARSE; ; break;} case 201: #line 1086 "parse.y" { yyerror ("invalid parameter list"); ABORT_PARSE; ; break;} case 202: #line 1093 "parse.y" { yyval.tree_identifier_type = new tree_identifier (yyvsp[0].tok_val->sym_rec (), yyvsp[0].tok_val->line (), yyvsp[0].tok_val->column ()); ; break;} case 203: #line 1100 "parse.y" { tree_constant *colon; tree_constant::magic_colon t; colon = new tree_constant (t); yyval.tree_argument_list_type = new tree_argument_list (colon); ; break;} case 204: #line 1107 "parse.y" { yyval.tree_argument_list_type = new tree_argument_list (yyvsp[0].tree_expression_type); ; break;} case 205: #line 1109 "parse.y" { tree_constant *all_va_args; tree_constant::all_va_args t; all_va_args = new tree_constant (t); yyval.tree_argument_list_type = new tree_argument_list (all_va_args); ; break;} case 206: #line 1116 "parse.y" { tree_constant *colon; tree_constant::magic_colon t; colon = new tree_constant (t); yyvsp[-2].tree_argument_list_type->append (colon); ; break;} case 207: #line 1123 "parse.y" { yyvsp[-2].tree_argument_list_type->append (yyvsp[0].tree_expression_type); ; break;} case 208: #line 1125 "parse.y" { tree_constant *all_va_args; tree_constant::all_va_args t; all_va_args = new tree_constant (t); yyvsp[-2].tree_argument_list_type->append (all_va_args); ; break;} case 209: #line 1134 "parse.y" { mlnm.pop (); maybe_screwed_again--; tree_matrix *tmp = ml.pop (); yyval.tree_matrix_type = tmp->reverse (); ; break;} case 213: #line 1148 "parse.y" { if (mlnm.top ()) { mlnm.pop (); mlnm.push (0); tree_matrix *tmp = new tree_matrix (yyvsp[0].tree_expression_type, tree_matrix::md_none); ml.push (tmp); } else { tree_matrix *tmp = ml.pop (); tmp = tmp->chain (yyvsp[0].tree_expression_type, tree_matrix::md_down); ml.push (tmp); } ; break;} case 215: #line 1166 "parse.y" { tree_matrix *tmp = ml.pop (); tmp = tmp->chain (yyvsp[0].tree_expression_type, tree_matrix::md_right); ml.push (tmp); ; break;} } /* the action file gets copied in in place of this dollarsign */ #line 465 "/usr/local/gnu/lib/bison.simple" yyvsp -= yylen; yyssp -= yylen; #ifdef YYLSP_NEEDED yylsp -= yylen; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif *++yyvsp = yyval; #ifdef YYLSP_NEEDED yylsp++; if (yylen == 0) { yylsp->first_line = yylloc.first_line; yylsp->first_column = yylloc.first_column; yylsp->last_line = (yylsp-1)->last_line; yylsp->last_column = (yylsp-1)->last_column; yylsp->text = 0; } else { yylsp->last_line = (yylsp+yylen-1)->last_line; yylsp->last_column = (yylsp+yylen-1)->last_column; } #endif /* Now "shift" the result of the reduction. Determine what state that goes to, based on the state we popped back to and the rule number reduced by. */ yyn = yyr1[yyn]; yystate = yypgoto[yyn - YYNTBASE] + *yyssp; if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) yystate = yytable[yystate]; else yystate = yydefgoto[yyn - YYNTBASE]; goto yynewstate; yyerrlab: /* here on detecting error */ if (! yyerrstatus) /* If not already recovering from an error, report this error. */ { ++yynerrs; #ifdef YYERROR_VERBOSE yyn = yypact[yystate]; if (yyn > YYFLAG && yyn < YYLAST) { int size = 0; char *msg; int x, count; count = 0; /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) size += strlen(yytname[x]) + 15, count++; msg = (char *) malloc(size + 15); if (msg != 0) { strcpy(msg, "parse error"); if (count < 5) { count = 0; for (x = (yyn < 0 ? -yyn : 0); x < (sizeof(yytname) / sizeof(char *)); x++) if (yycheck[x + yyn] == x) { strcat(msg, count == 0 ? ", expecting `" : " or `"); strcat(msg, yytname[x]); strcat(msg, "'"); count++; } } yyerror(msg); free(msg); } else yyerror ("parse error; also virtual memory exceeded"); } else #endif /* YYERROR_VERBOSE */ yyerror("parse error"); } goto yyerrlab1; yyerrlab1: /* here on error raised explicitly by an action */ if (yyerrstatus == 3) { /* if just tried and failed to reuse lookahead token after an error, discard it. */ /* return failure if at end of input */ if (yychar == YYEOF) YYABORT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); #endif yychar = YYEMPTY; } /* Else will try to reuse lookahead token after shifting the error token. */ yyerrstatus = 3; /* Each real token shifted decrements this */ goto yyerrhandle; yyerrdefault: /* current state does not do anything special for the error token. */ #if 0 /* This is wrong; only states that explicitly want error tokens should shift them. */ yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ if (yyn) goto yydefault; #endif yyerrpop: /* pop the current state because it cannot handle the error token */ if (yyssp == yyss) YYABORT; yyvsp--; yystate = *--yyssp; #ifdef YYLSP_NEEDED yylsp--; #endif #if YYDEBUG != 0 if (yydebug) { short *ssp1 = yyss - 1; fprintf (stderr, "Error: state stack now"); while (ssp1 != yyssp) fprintf (stderr, " %d", *++ssp1); fprintf (stderr, "\n"); } #endif yyerrhandle: yyn = yypact[yystate]; if (yyn == YYFLAG) goto yyerrdefault; yyn += YYTERROR; if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) goto yyerrdefault; yyn = yytable[yyn]; if (yyn < 0) { if (yyn == YYFLAG) goto yyerrpop; yyn = -yyn; goto yyreduce; } else if (yyn == 0) goto yyerrpop; if (yyn == YYFINAL) YYACCEPT; #if YYDEBUG != 0 if (yydebug) fprintf(stderr, "Shifting error token, "); #endif *++yyvsp = yylval; #ifdef YYLSP_NEEDED *++yylsp = yylloc; #endif yystate = yyn; goto yynewstate; } #line 1173 "parse.y" // Generic error messages. static void yyerror (char *s) { char *line = current_input_line; int err_col = current_input_column - 1; if (err_col == 0 && line) err_col = strlen (line) + 1; ostrstream output_buf; if (reading_fcn_file || reading_script_file) output_buf << "parse error near line " << input_line_number << " of file " << curr_fcn_file_name << ".m:"; else output_buf << "parse error:"; if (s && strcmp (s, "parse error") != 0) output_buf << "\n\n " << s; output_buf << "\n\n"; if (line) { int len = strlen (line); if (line[len-1] == '\n') { len--; line[len] = '\0'; } // Print the line, maybe with a pointer near the error token. output_buf << " " << line << "\n"; if (err_col <= len) { for (int i = 0; i < err_col + 1; i++) output_buf << " "; output_buf << "^"; } } output_buf << "\n" << ends; char *msg = output_buf.str (); parse_error (msg); delete [] msg; } // Error mesages for mismatched end tokens. static void end_error (char *type, token::end_tok_type ettype, int l, int c) { static char *fmt = "`%s' command matched by `%s' near line %d column %d"; switch (ettype) { case token::simple_end: error (fmt, type, "end", l, c); break; case token::for_end: error (fmt, type, "endfor", l, c); break; case token::function_end: error (fmt, type, "endfunction", l, c); break; case token::if_end: error (fmt, type, "endif", l, c); break; case token::while_end: error (fmt, type, "endwhile", l, c); break; default: panic_impossible (); break; } } // Check to see that end tokens are properly matched. static int check_end (token *tok, token::end_tok_type expected) { token::end_tok_type ettype = tok->ettype (); if (ettype != expected && ettype != token::simple_end) { yyerror ("parse error"); int l = tok->line (); int c = tok->column (); switch (expected) { case token::for_end: end_error ("for", ettype, l, c); break; case token::function_end: end_error ("function", ettype, l, c); break; case token::if_end: end_error ("if", ettype, l, c); break; case token::while_end: end_error ("while", ettype, l, c); break; default: panic_impossible (); break; } return 1; } else return 0; } // Try to figure out early if an expression should become an // assignment to the builtin variable ans. // // Need to make sure that the expression isn't already an identifier // that has a name, or an assignment expression. // // Note that an expression can't be just an identifier anymore -- it // must at least be an index expression (see the definition of the // non-terminal `variable' above). // // XXX FIXME XXX. This isn't quite sufficient. For example, try the // command `x = 4, x' for `x' previously undefined. // // XXX FIXME XXX -- we should probably delay doing this until eval-time. static tree_expression * maybe_convert_to_ans_assign (tree_expression *expr) { if (expr->is_index_expression ()) { expr->mark_for_possible_ans_assign (); return expr; } else if (expr->is_assignment_expression () || expr->is_prefix_expression ()) { return expr; } else { symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); assert (sr); tree_identifier *ans = new tree_identifier (sr); return new tree_simple_assignment_expression (ans, expr, 0, 1); } } // Maybe print a warning if an assignment expression is used as the // test in a logical expression. static void maybe_warn_assign_as_truth_value (tree_expression *expr) { if (user_pref.warn_assign_as_truth_value && expr->is_assignment_expression () && expr->in_parens < 2) { warning ("suggest parenthesis around assignment used as truth value"); } } // Build a binary expression. static tree_expression * make_binary_op (int op, tree_expression *op1, token *tok_val, tree_expression *op2) { tree_expression::type t; switch (op) { case POW: t = tree_expression::power; break; case EPOW: t = tree_expression::elem_pow; break; case '+': t = tree_expression::add; break; case '-': t = tree_expression::subtract; break; case '*': t = tree_expression::multiply; break; case '/': t = tree_expression::divide; break; case EMUL: t = tree_expression::el_mul; break; case EDIV: t = tree_expression::el_div; break; case LEFTDIV: t = tree_expression::leftdiv; break; case ELEFTDIV: t = tree_expression::el_leftdiv; break; case EXPR_LT: t = tree_expression::cmp_lt; break; case EXPR_LE: t = tree_expression::cmp_le; break; case EXPR_EQ: t = tree_expression::cmp_eq; break; case EXPR_GE: t = tree_expression::cmp_ge; break; case EXPR_GT: t = tree_expression::cmp_gt; break; case EXPR_NE: t = tree_expression::cmp_ne; break; case EXPR_AND_AND: t = tree_expression::and_and; break; case EXPR_OR_OR: t = tree_expression::or_or; break; case EXPR_AND: t = tree_expression::and; break; case EXPR_OR: t = tree_expression::or; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_binary_expression (op1, op2, t, l, c); } // Build a prefix expression. static tree_expression * make_prefix_op (int op, tree_identifier *op1, token *tok_val) { tree_expression::type t; switch (op) { case PLUS_PLUS: t = tree_expression::increment; break; case MINUS_MINUS: t = tree_expression::decrement; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_prefix_expression (op1, t, l, c); } // Build a postfix expression. static tree_expression * make_postfix_op (int op, tree_identifier *op1, token *tok_val) { tree_expression::type t; switch (op) { case PLUS_PLUS: t = tree_expression::increment; break; case MINUS_MINUS: t = tree_expression::decrement; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_postfix_expression (op1, t, l, c); } // Build a unary expression. static tree_expression * make_unary_op (int op, tree_expression *op1, token *tok_val) { tree_expression::type t; switch (op) { case QUOTE: t = tree_expression::hermitian; break; case TRANSPOSE: t = tree_expression::transpose; break; case EXPR_NOT: t = tree_expression::not; break; case '-': t = tree_expression::uminus; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_unary_expression (op1, t, l, c); } // Make an expression that handles assignment of multiple values. static tree_expression * make_multi_val_ret (tree_expression *rhs, int l, int c) { // Convert the matrix list to a list of identifiers. If that fails, // we can abort here, without losing anything -- no other possible // syntax is valid if we've seen the equals sign as the next token // after the `]'. tree_expression *retval = 0; maybe_screwed_again--; tree_matrix *tmp = ml.pop (); tmp = tmp->reverse (); tree_return_list *id_list = tmp->to_return_list (); if (id_list) { int list_len = id_list->length (); if (list_len == 1) { tree_index_expression *lhs = id_list->remove_front (); retval = new tree_simple_assignment_expression (lhs, rhs, 0, 0, l, c); } else if (list_len > 1) { if (rhs->is_multi_val_ret_expression ()) { tree_multi_val_ret *t = (tree_multi_val_ret *) rhs; retval = new tree_multi_assignment_expression (id_list, t, l, c); } else yyerror ("RHS must be an expression that returns multiple values"); } else panic_impossible (); } else yyerror ("invalid identifier list for assignment"); return retval; } static tree_index_expression * make_index_expression (tree_indirect_ref *indir, tree_argument_list *args) { tree_index_expression *retval = 0; int l = indir->line (); int c = indir->column (); if (indir->is_identifier_only ()) { indir->preserve_identifier (); retval = new tree_index_expression (indir->ident (), args, l, c); delete indir; } else retval = new tree_index_expression (indir, args, l, c); return retval; } octave-1.1.0/src/lex.cc100666 415 17 231626 5705522274 13107 0ustar jweusers/* A lexical scanner generated by flex */ /* Scanner skeleton version: * $Header: flex.skl,v 1.2 94/01/04 14:33:15 vern Exp $ */ #define FLEX_SCANNER #include /* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ #ifdef c_plusplus #ifndef __cplusplus #define __cplusplus #endif #endif #ifdef __cplusplus #include #include /* Use prototypes in function declarations. */ #define YY_USE_PROTOS /* The "const" storage-class-modifier is valid. */ #define YY_USE_CONST #else /* ! __cplusplus */ #ifdef __STDC__ #define YY_USE_PROTOS #define YY_USE_CONST #endif /* __STDC__ */ #endif /* ! __cplusplus */ #ifdef __TURBOC__ #define YY_USE_CONST #endif #ifndef YY_USE_CONST #ifndef const #define const #endif #endif #ifdef YY_USE_PROTOS #define YY_PROTO(proto) proto #else #define YY_PROTO(proto) () #endif /* Returned upon end-of-file. */ #define YY_NULL 0 /* Promotes a possibly negative, possibly signed char to an unsigned * integer for use as an array index. If the signed char is negative, * we want to instead treat it as an 8-bit unsigned char, hence the * double cast. */ #define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) /* Enter a start condition. This macro really ought to take a parameter, * but we do it the disgusting crufty way forced on us by the ()-less * definition of BEGIN. */ #define BEGIN yy_start = 1 + 2 * /* Translate the current start state into a value that can be later handed * to BEGIN to return to the state. */ #define YY_START ((yy_start - 1) / 2) /* Action number for EOF rule of a given start state. */ #define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) /* Special action meaning "start processing a new file". Now included * only for backward compatibility with previous versions of flex. */ #define YY_NEW_FILE yyrestart( yyin ) #define YY_END_OF_BUFFER_CHAR 0 /* Size of default input buffer. */ #define YY_BUF_SIZE 16384 typedef struct yy_buffer_state *YY_BUFFER_STATE; extern int yyleng; extern FILE *yyin, *yyout; #ifdef __cplusplus extern "C" { #endif extern int yywrap YY_PROTO(( void )); #ifdef __cplusplus } #endif #define EOB_ACT_CONTINUE_SCAN 0 #define EOB_ACT_END_OF_FILE 1 #define EOB_ACT_LAST_MATCH 2 /* The funky do-while in the following #define is used to turn the definition * int a single C statement (which needs a semi-colon terminator). This * avoids problems with code like: * * if ( condition_holds ) * yyless( 5 ); * else * do_something_else(); * * Prior to using the do-while the compiler would get upset at the * "else" because it interpreted the "if" statement as being all * done when it reached the ';' after the yyless() call. */ /* Return all but the first 'n' matched characters back to the input stream. */ #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ *yy_cp = yy_hold_char; \ yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ YY_DO_BEFORE_ACTION; /* set up yytext again */ \ } \ while ( 0 ) #define unput(c) yyunput( c, yytext_ptr ) struct yy_buffer_state { FILE *yy_input_file; char *yy_ch_buf; /* input buffer */ char *yy_buf_pos; /* current position in input buffer */ /* Size of input buffer in bytes, not including room for EOB * characters. */ int yy_buf_size; /* Number of characters read into yy_ch_buf, not including EOB * characters. */ int yy_n_chars; /* Whether this is an "interactive" input source; if so, and * if we're using stdio for input, then we want to use getc() * instead of fread(), to make sure we stop fetching input after * each newline. */ int yy_is_interactive; /* Whether to try to fill the input buffer when we reach the * end of it. */ int yy_fill_buffer; /* Whether we've seen an EOF on this buffer. */ int yy_eof_status; #define EOF_NOT_SEEN 0 /* "Pending" happens when the EOF has been seen but there's still * some text to process. Note that when we actually see the EOF, * we switch the status back to "not seen" (via yyrestart()), so * that the user can continue scanning by just pointing yyin at * a new input file. */ #define EOF_PENDING 1 }; static YY_BUFFER_STATE yy_current_buffer = 0; /* We provide macros for accessing buffer states in case in the * future we want to put the buffer states in a more general * "scanner state". */ #define YY_CURRENT_BUFFER yy_current_buffer /* yy_hold_char holds the character lost when yytext is formed. */ static char yy_hold_char; static int yy_n_chars; /* number of characters read into yy_ch_buf */ int yyleng; /* Points to current character in buffer. */ static char *yy_c_buf_p = (char *) 0; static int yy_init = 1; /* whether we need to initialize */ static int yy_start = 0; /* start state number */ /* Flag which is used to allow yywrap()'s to do buffer switches * instead of setting up a fresh yyin. A bit of a hack ... */ static int yy_did_buffer_switch_on_eof; static void yyunput YY_PROTO(( int c, char *buf_ptr )); void yyrestart YY_PROTO(( FILE *input_file )); void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); void yy_load_buffer_state YY_PROTO(( void )); YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); static int yy_start_stack_ptr = 0; static int yy_start_stack_depth = 0; static int *yy_start_stack = 0; static void yy_push_state YY_PROTO(( int new_state )); static void yy_pop_state YY_PROTO(( void )); static int yy_top_state YY_PROTO(( void )); #ifndef yytext_ptr static void yy_flex_strcpy YY_PROTO(( char *, const char * )); #endif static void *yy_flex_alloc YY_PROTO(( unsigned int )); static void *yy_flex_realloc YY_PROTO(( void *ptr, unsigned int )); static void yy_flex_free YY_PROTO(( void * )); #define yy_new_buffer yy_create_buffer #define INITIAL 0 #define HELP_FCN 1 #define TEXT_FCN 2 #define MATRIX 3 typedef unsigned char YY_CHAR; typedef int yy_state_type; FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; extern char *yytext; #define yytext_ptr yytext #ifdef __cplusplus static int yyinput YY_PROTO(( void )); #else static int input YY_PROTO(( void )); #endif static yy_state_type yy_get_previous_state YY_PROTO(( void )); static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); static int yy_get_next_buffer YY_PROTO(( void )); static void yy_fatal_error YY_PROTO(( const char msg[] )); /* Done after the current pattern has been matched and before the * corresponding action - sets up yytext. */ #define YY_DO_BEFORE_ACTION \ yytext_ptr = yy_bp; \ yyleng = yy_cp - yy_bp; \ yy_hold_char = *yy_cp; \ *yy_cp = '\0'; \ yy_c_buf_p = yy_cp; #define YY_END_OF_BUFFER 58 static const short int yy_accept[179] = { 0, 17, 17, 5, 5, 6, 6, 17, 17, 58, 56, 17, 22, 51, 24, 26, 39, 23, 54, 55, 42, 52, 46, 53, 56, 43, 16, 25, 45, 40, 48, 41, 21, 12, 44, 13, 47, 38, 51, 5, 5, 1, 6, 6, 2, 6, 4, 6, 6, 4, 6, 6, 6, 6, 3, 6, 6, 6, 6, 6, 3, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 9, 11, 26, 8, 10, 7, 17, 36, 50, 47, 32, 33, 31, 27, 52, 53, 0, 28, 16, 29, 30, 16, 16, 0, 14, 34, 35, 37, 21, 21, 12, 0, 18, 0, 49, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 9, 11, 0, 8, 10, 7, 11, 11, 0, 0, 0, 8, 10, 0, 7, 20, 0, 15, 16, 0, 16, 0, 19, 6, 6, 6, 6, 6, 6, 6, 6, 0, 11, 11, 0, 0, 16, 6, 6, 11, 0 } ; static const int yy_ec[256] = { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 5, 6, 1, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 18, 19, 20, 21, 22, 1, 1, 23, 23, 23, 24, 24, 23, 23, 23, 25, 25, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 26, 27, 28, 29, 23, 1, 23, 23, 23, 24, 24, 23, 23, 23, 25, 25, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 30, 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, 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, 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 } ; static const int yy_meta[32] = { 0, 1, 2, 3, 1, 1, 1, 1, 4, 1, 1, 4, 1, 5, 1, 1, 4, 6, 1, 5, 1, 1, 1, 2, 6, 6, 1, 4, 1, 4, 1, 1 } ; static const short int yy_base[189] = { 0, 0, 0, 30, 32, 35, 0, 65, 92, 341, 405, 337, 405, 317, 405, 405, 330, 405, 405, 405, 325, 323, 405, 320, 113, 405, 55, 405, 405, 52, 312, 311, 329, 328, 79, 405, 405, 299, 307, 325, 324, 405, 320, 319, 405, 67, 318, 317, 84, 316, 315, 313, 81, 75, 405, 87, 141, 311, 169, 310, 405, 88, 94, 95, 193, 309, 97, 308, 307, 74, 105, 217, 244, 305, 305, 111, 304, 303, 405, 405, 405, 405, 405, 405, 293, 405, 405, 288, 405, 114, 405, 405, 120, 148, 134, 405, 405, 405, 405, 300, 297, 295, 116, 405, 291, 405, 291, 290, 289, 288, 287, 284, 283, 282, 281, 279, 278, 121, 275, 274, 132, 272, 152, 269, 266, 271, 299, 173, 265, 264, 263, 262, 259, 323, 258, 158, 178, 247, 0, 0, 230, 211, 176, 207, 0, 0, 200, 193, 186, 181, 196, 171, 160, 198, 194, 405, 142, 119, 116, 109, 405, 219, 212, 106, 210, 133, 226, 229, 235, 103, 238, 250, 99, 58, 190, 237, 253, 256, 405, 348, 353, 359, 365, 371, 374, 380, 386, 392, 398 } ; static const short int yy_def[189] = { 0, 178, 1, 179, 179, 178, 5, 1, 1, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 180, 178, 178, 178, 178, 178, 178, 181, 178, 178, 182, 178, 178, 182, 182, 182, 182, 182, 182, 182, 182, 182, 178, 182, 182, 182, 182, 182, 178, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 178, 178, 183, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 184, 178, 178, 178, 178, 178, 178, 178, 180, 178, 178, 178, 185, 178, 181, 178, 182, 178, 178, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 182, 178, 182, 178, 178, 186, 182, 71, 72, 183, 178, 178, 178, 72, 72, 187, 183, 178, 178, 178, 188, 178, 178, 178, 178, 178, 178, 178, 185, 178, 182, 182, 182, 182, 182, 182, 186, 185, 187, 178, 178, 188, 178, 178, 182, 182, 178, 0, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178 } ; static const short int yy_nxt[437] = { 0, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 32, 32, 33, 34, 35, 36, 37, 38, 40, 41, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 64, 64, 65, 66, 67, 68, 69, 70, 71, 72, 109, 92, 73, 93, 96, 78, 174, 109, 109, 74, 94, 95, 102, 103, 109, 75, 104, 109, 114, 111, 109, 109, 112, 113, 76, 71, 72, 109, 109, 73, 135, 103, 115, 150, 136, 137, 74, 170, 109, 109, 129, 111, 75, 160, 150, 150, 130, 131, 151, 102, 103, 76, 83, 104, 109, 84, 85, 111, 86, 87, 88, 89, 89, 124, 158, 109, 109, 158, 156, 154, 95, 90, 95, 91, 109, 94, 95, 157, 161, 157, 116, 166, 158, 117, 118, 109, 119, 120, 121, 122, 156, 135, 103, 152, 92, 104, 93, 94, 95, 123, 122, 124, 109, 94, 95, 150, 109, 162, 128, 150, 150, 168, 160, 151, 149, 125, 165, 126, 165, 148, 171, 166, 159, 140, 127, 128, 132, 148, 159, 150, 150, 102, 103, 151, 170, 104, 142, 173, 174, 173, 152, 133, 174, 109, 149, 109, 95, 133, 133, 133, 138, 139, 135, 103, 140, 175, 136, 175, 164, 109, 176, 141, 168, 160, 148, 127, 128, 142, 168, 160, 109, 170, 177, 159, 166, 146, 143, 144, 145, 159, 109, 146, 128, 170, 177, 176, 109, 146, 142, 170, 177, 134, 132, 146, 142, 109, 109, 109, 109, 109, 142, 176, 109, 143, 109, 109, 142, 109, 109, 128, 163, 109, 109, 163, 109, 109, 109, 109, 163, 164, 110, 109, 109, 107, 107, 160, 127, 128, 101, 163, 99, 163, 109, 99, 153, 91, 77, 152, 149, 148, 109, 109, 134, 109, 109, 125, 109, 126, 109, 109, 109, 109, 110, 109, 127, 128, 132, 107, 107, 78, 105, 101, 99, 98, 97, 82, 81, 80, 79, 78, 77, 133, 178, 178, 178, 178, 178, 133, 133, 133, 39, 39, 39, 39, 39, 39, 100, 178, 178, 178, 100, 106, 106, 178, 106, 106, 106, 108, 108, 178, 108, 178, 108, 147, 147, 147, 147, 147, 147, 155, 178, 155, 159, 159, 159, 159, 159, 159, 167, 167, 167, 167, 167, 167, 169, 169, 169, 169, 169, 169, 172, 172, 172, 172, 172, 172, 9, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178 } ; static const short int yy_chk[437] = { 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, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 45, 26, 7, 26, 29, 29, 173, 69, 53, 7, 26, 26, 34, 34, 52, 7, 34, 48, 53, 45, 55, 61, 48, 52, 7, 8, 8, 62, 63, 8, 66, 66, 55, 172, 66, 69, 8, 169, 70, 163, 61, 61, 8, 159, 75, 75, 62, 63, 75, 102, 102, 8, 24, 102, 117, 24, 24, 70, 24, 24, 24, 24, 89, 117, 158, 120, 165, 157, 92, 89, 89, 24, 158, 24, 56, 92, 92, 94, 120, 94, 56, 165, 94, 56, 56, 122, 56, 56, 56, 56, 156, 135, 135, 152, 93, 135, 93, 156, 156, 56, 122, 56, 58, 93, 93, 151, 127, 122, 122, 142, 142, 136, 136, 142, 149, 58, 127, 58, 127, 148, 148, 127, 136, 148, 58, 58, 64, 147, 136, 150, 150, 153, 153, 150, 146, 153, 148, 154, 174, 154, 143, 64, 154, 164, 141, 162, 174, 64, 64, 64, 71, 71, 161, 161, 71, 162, 161, 162, 164, 166, 162, 71, 167, 167, 140, 164, 164, 71, 168, 168, 175, 170, 170, 167, 166, 170, 71, 72, 72, 167, 137, 72, 166, 171, 171, 175, 176, 171, 170, 177, 177, 134, 132, 177, 72, 131, 130, 129, 128, 124, 171, 176, 123, 72, 125, 121, 177, 119, 118, 176, 125, 116, 115, 125, 114, 113, 112, 111, 125, 125, 110, 109, 108, 107, 106, 104, 125, 125, 101, 125, 100, 125, 126, 99, 87, 84, 77, 76, 74, 73, 68, 67, 65, 59, 57, 126, 51, 126, 50, 49, 47, 46, 43, 42, 126, 126, 133, 40, 39, 38, 37, 33, 32, 31, 30, 23, 21, 20, 16, 13, 11, 133, 9, 0, 0, 0, 0, 133, 133, 133, 179, 179, 179, 179, 179, 179, 180, 0, 0, 0, 180, 181, 181, 0, 181, 181, 181, 182, 182, 0, 182, 0, 182, 183, 183, 183, 183, 183, 183, 184, 0, 184, 185, 185, 185, 185, 185, 185, 186, 186, 186, 186, 186, 186, 187, 187, 187, 187, 187, 187, 188, 188, 188, 188, 188, 188, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178, 178 } ; static yy_state_type yy_last_accepting_state; static char *yy_last_accepting_cpos; /* The intent behind this definition is that it'll catch * any uses of REJECT which flex missed. */ #define REJECT reject_used_but_not_detected #define yymore() yymore_used_but_not_detected #define YY_MORE_ADJ 0 char *yytext; # line 1 "lex.l" /* lex.l -*- C++ -*- Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 GNU CC; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ # line 28 "lex.l" #define SHORT_CIRCUIT_LOGICALS 1 #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "input.h" #include "token.h" #include "SLStack.h" // Stack to hold tokens so that we can delete them when the parser is // reset and avoid growing forever just because we are stashing some // information. This has to appear before lex.h is included, because // one of the macros defined there uses token_stack. static SLStack token_stack; #include "user-prefs.h" #include "variables.h" #include "octave.h" #include "symtab.h" #include "error.h" #include "utils.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-misc.h" #include "tree-plot.h" #include "tree-const.h" #include "y.tab.h" #include "parse.h" #include "lex.h" // Nonzero means we think we are looking at a set command. static int doing_set = 0; // GAG. Stupid kludge so that [[1,2][3,4]] will work. static do_comma_insert = 0; // Brace level count. static int braceflag = 0; // Return transpose or start a string? int quote_is_transpose = 0; // Nonzero means we thing we are looking at the beginning of a // function definition. int beginning_of_function = 0; // Nonzero means that we should convert spaces to a comma inside a // matrix definition. static int convert_spaces_to_comma = 1; // Another context hack, this time for the plot command's `using', // `title', and `with' keywords. static int cant_be_identifier = 0; #define BRACE 1 #define PAREN 2 // Is the closest nesting level a square brace or a paren? // // BRACE -> spaces are important (they can turn into commas) // new lines are important (they can turn into semicolons) // // PAREN -> spaces and new lines are not important static SLStack nesting_level; // Forward declarations for functions defined at the bottom of this // file. static void do_string_escapes (char *s); static void fixup_column_count (char *s); static void do_comma_insert_check (void); static int is_plot_keyword (char *s); static int is_keyword (char *s); static char *plot_style_token (char *s); static symbol_record *lookup_identifier (char *s); static void grab_help_text (void); static int match_any (char c, char *s); static int next_token_is_bin_op (int spc_prev, char *yytext); static int next_token_is_postfix_unary_op (int spc_prev, char *yytext); static char *strip_trailing_whitespace (char *s); static void handle_number (char *yytext); static int handle_string (char delim, int text_style = 0); static int handle_close_brace (int spc_gobbled); static int handle_identifier (char *tok, int spc_gobbled); static int have_continuation (void); static int have_ellipsis_continuation (void); static int eat_whitespace (void); static int eat_continuation (void); /* Macros after this point can all be overridden by user definitions in * section 1. */ #ifdef YY_MALLOC_DECL YY_MALLOC_DECL #else #if __STDC__ #ifndef __cplusplus #include #endif #else /* Just try to get by without declaring the routines. This will fail * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) * or sizeof(void*) != sizeof(int). */ #endif #endif /* Amount of stuff to slurp up with each read. */ #ifndef YY_READ_BUF_SIZE #define YY_READ_BUF_SIZE 8192 #endif /* Copy whatever the last rule matched to the standard output. */ #ifndef ECHO /* This used to be an fputs(), but since the string might contain NUL's, * we now use fwrite(). */ #define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) #endif /* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, * is returned in "result". */ #ifndef YY_INPUT #define YY_INPUT(buf,result,max_size) \ if ( yy_current_buffer->yy_is_interactive ) \ { \ int c = getc( yyin ); \ result = c == EOF ? 0 : 1; \ buf[0] = (char) c; \ } \ else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ && ferror( yyin ) ) \ YY_FATAL_ERROR( "input in flex scanner failed" ); #endif /* No semi-colon after return; correct usage is to write "yyterminate();" - * we don't want an extra ';' after the "return" because that will cause * some compilers to complain about unreachable statements. */ #ifndef yyterminate #define yyterminate() return YY_NULL #endif /* Number of entries by which start-condition stack grows. */ #ifndef YY_START_STACK_INCR #define YY_START_STACK_INCR 25 #endif /* Report a fatal error. */ #ifndef YY_FATAL_ERROR #define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) #endif /* Default declaration of generated scanner - a define so the user can * easily add parameters. */ #ifndef YY_DECL #define YY_DECL int yylex YY_PROTO(( void )) #endif /* Code executed at the beginning of each rule, after yytext and yyleng * have been set up. */ #ifndef YY_USER_ACTION #define YY_USER_ACTION #endif /* Code executed at the end of each rule. */ #ifndef YY_BREAK #define YY_BREAK break; #endif YY_DECL { register yy_state_type yy_current_state; register char *yy_cp, *yy_bp; register int yy_act; # line 146 "lex.l" // Help and other text-style functions are a pain in the ass. This // stuff needs to be simplified. May require some changes in the // parser too. if ( yy_init ) { #ifdef YY_USER_INIT YY_USER_INIT; #endif if ( ! yy_start ) yy_start = 1; /* first start state */ if ( ! yyin ) yyin = stdin; if ( ! yyout ) yyout = stdout; if ( yy_current_buffer ) yy_init_buffer( yy_current_buffer, yyin ); else yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_load_buffer_state(); yy_init = 0; } while ( 1 ) /* loops until end-of-file is reached */ { yy_cp = yy_c_buf_p; /* Support of yytext. */ *yy_cp = yy_hold_char; /* yy_bp points to the position in yy_ch_buf of the start of * the current run. */ yy_bp = yy_cp; yy_current_state = yy_start; yy_match: do { register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 179 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; ++yy_cp; } while ( yy_base[yy_current_state] != 405 ); yy_find_action: yy_act = yy_accept[yy_current_state]; YY_DO_BEFORE_ACTION; do_action: /* This label is used only to access EOF actions. */ switch ( yy_act ) { /* beginning of action switch */ case 0: /* must back up */ /* undo the effects of YY_DO_BEFORE_ACTION */ *yy_cp = yy_hold_char; yy_cp = yy_last_accepting_cpos; yy_current_state = yy_last_accepting_state; goto yy_find_action; case 1: YY_USER_ACTION # line 155 "lex.l" case 2: YY_USER_ACTION # line 155 "lex.l" { BEGIN 0; current_input_column = 1; quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; return '\n'; } YY_BREAK case 3: YY_USER_ACTION # line 164 "lex.l" { if (doing_set && strcmp (yytext, ",") == 0) { yylval.tok_val = new token (yytext); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT); } else { BEGIN 0; if (strcmp (yytext, ",") == 0) TOK_RETURN (','); else TOK_RETURN (';'); } } YY_BREAK case 4: YY_USER_ACTION # line 181 "lex.l" { current_input_column++; return handle_string (yytext[0], 1); } YY_BREAK case 5: YY_USER_ACTION # line 187 "lex.l" case 6: YY_USER_ACTION # line 187 "lex.l" { static char *tok = 0; delete [] tok; tok = strip_trailing_whitespace (yytext); yylval.tok_val = new token (tok); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT); } YY_BREAK // For this and the next two rules, we're looking at ']', and we // need to know if the next token is `=' or `=='. // // It would have been so much easier if the delimiters were simply // different for the expression on the left hand side of the equals // operator. // // It's also a pain in the ass to decide whether to insert a comma // after seeing a ']' character... case 7: YY_USER_ACTION # line 208 "lex.l" { fixup_column_count (yytext); int c = yytext[yyleng-1]; int cont_is_spc = eat_continuation (); int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); return handle_close_brace (spc_gobbled); } YY_BREAK // Commas are element separators in matrix constants. case 8: YY_USER_ACTION # line 220 "lex.l" { TOK_RETURN (','); } YY_BREAK // In some cases, spaces in matrix constants can turn into commas. // If commas are required, spaces are not important in matrix // constants so we just eat them. case 9: YY_USER_ACTION # line 230 "lex.l" { if (user_pref.whitespace_in_literal_matrix != 2) { int bin_op = next_token_is_bin_op (1, yytext); int postfix_un_op = next_token_is_postfix_unary_op (1, yytext); if (! (postfix_un_op || bin_op || nesting_level.empty ()) && nesting_level.top () == BRACE && convert_spaces_to_comma) TOK_RETURN (','); } } YY_BREAK // Semicolons are handled as row seprators in matrix constants. case 10: YY_USER_ACTION # line 247 "lex.l" { fixup_column_count (yytext); eat_whitespace (); quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; return ';'; } YY_BREAK // In some cases, new lines can also become row separators. case 11: YY_USER_ACTION # line 260 "lex.l" { if (user_pref.whitespace_in_literal_matrix != 2) { fixup_column_count (yytext); quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; if (nesting_level.empty ()) return LEXICAL_ERROR; if (nesting_level.top () == BRACE) return ';'; } } YY_BREAK // Open and close brace are handled differently if we are in the range // part of a plot command. // case 12: YY_USER_ACTION # line 282 "lex.l" { fixup_column_count (yytext); nesting_level.push (BRACE); promptflag--; eat_whitespace (); if (plotting && ! past_plot_range) { in_plot_range = 1; TOK_RETURN (OPEN_BRACE); } else { mlnm.push (1); braceflag++; BEGIN MATRIX; TOK_RETURN ('['); } } YY_BREAK case 13: YY_USER_ACTION # line 304 "lex.l" { if (! nesting_level.empty ()) nesting_level.pop (); if (plotting && ! past_plot_range) { in_plot_range = 0; TOK_RETURN (CLOSE_BRACE); } else TOK_RETURN (']'); } YY_BREAK // Imaginary numbers. case 14: YY_USER_ACTION # line 321 "lex.l" { handle_number (yytext); return IMAG_NUM; } YY_BREAK // Real numbers. Don't grab the `.' part of a dot operator as part of // the constant. case 15: *yy_cp = yy_hold_char; /* undo effects of setting up yytext */ yy_c_buf_p = yy_cp -= 2; YY_DO_BEFORE_ACTION; /* set up yytext again */ YY_USER_ACTION # line 332 "lex.l" case 16: YY_USER_ACTION # line 332 "lex.l" { handle_number (yytext); return NUM; } YY_BREAK // Eat whitespace. Whitespace inside matrix constants is handled by // the start state code above. case 17: YY_USER_ACTION # line 342 "lex.l" { current_input_column += yyleng; } YY_BREAK // Continuation lines. Allow comments after continuations. case 18: YY_USER_ACTION # line 351 "lex.l" case 19: YY_USER_ACTION # line 351 "lex.l" { promptflag--; current_input_column = 1; } YY_BREAK // An ellipsis not at the end of a line is not a continuation, but // does have another meaning. case 20: YY_USER_ACTION # line 361 "lex.l" { return ELLIPSIS; } YY_BREAK // End of file. case YY_STATE_EOF(INITIAL): case YY_STATE_EOF(HELP_FCN): case YY_STATE_EOF(TEXT_FCN): case YY_STATE_EOF(MATRIX): # line 369 "lex.l" { TOK_RETURN (END_OF_INPUT); } YY_BREAK // Identifiers. Truncate the token at the first space or tab but // don't write directly on yytext. case 21: YY_USER_ACTION # line 378 "lex.l" { static char *tok = 0; delete [] tok; tok = strip_trailing_whitespace (yytext); current_input_column += yyleng; int c = yytext[yyleng-1]; int cont_is_spc = eat_continuation (); int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); return handle_identifier (tok, spc_gobbled); } YY_BREAK // A new line character. New line characters inside matrix constants // are handled by the start state code above. If closest // nesting is inside parentheses, don't return a row separator. case 22: YY_USER_ACTION # line 395 "lex.l" { quote_is_transpose = 0; cant_be_identifier = 0; current_input_column = 1; convert_spaces_to_comma = 1; if (nesting_level.empty ()) return '\n'; if (nesting_level.top () == BRACE) return LEXICAL_ERROR; } YY_BREAK // Single quote can either be the beginning of a string or a transpose // operator. case 23: YY_USER_ACTION # line 413 "lex.l" { current_input_column++; convert_spaces_to_comma = 1; if (quote_is_transpose) { do_comma_insert_check (); return QUOTE; } else return handle_string ('\''); } YY_BREAK // Double quotes always begin strings. case 24: YY_USER_ACTION # line 430 "lex.l" { current_input_column++; return handle_string ('"'); } YY_BREAK // The colon operator is handled differently if we are in the range // part of a plot command. case 25: YY_USER_ACTION # line 440 "lex.l" { if (plotting && (in_plot_range || in_plot_using)) BIN_OP_RETURN (COLON, 1); else BIN_OP_RETURN (':', 0); } YY_BREAK // Gobble comments. If closest nesting is inside parentheses, don't // return a new line. case 26: YY_USER_ACTION # line 452 "lex.l" { if (! help_buf && beginning_of_function && nesting_level.empty ()) { grab_help_text (); beginning_of_function = 0; } else { int c; while ((c = yyinput ()) != EOF && c != '\n') ; // Eat comment. } quote_is_transpose = 0; cant_be_identifier = 0; current_input_column = 1; convert_spaces_to_comma = 1; if (nesting_level.empty () || nesting_level.top () == BRACE) return '\n'; } YY_BREAK // Other operators. case 27: YY_USER_ACTION # line 478 "lex.l" { BIN_OP_RETURN (EMUL, 0); } YY_BREAK case 28: YY_USER_ACTION # line 479 "lex.l" { BIN_OP_RETURN (EDIV, 0); } YY_BREAK case 29: YY_USER_ACTION # line 480 "lex.l" { BIN_OP_RETURN (ELEFTDIV, 0); } YY_BREAK case 30: YY_USER_ACTION # line 481 "lex.l" { BIN_OP_RETURN (EPOW, 0); } YY_BREAK case 31: YY_USER_ACTION # line 482 "lex.l" { do_comma_insert_check (); BIN_OP_RETURN (TRANSPOSE, 1); } YY_BREAK case 32: YY_USER_ACTION # line 483 "lex.l" { do_comma_insert_check (); BIN_OP_RETURN (PLUS_PLUS, 1); } YY_BREAK case 33: YY_USER_ACTION # line 484 "lex.l" { do_comma_insert_check (); BIN_OP_RETURN (MINUS_MINUS, 1); } YY_BREAK case 34: YY_USER_ACTION # line 485 "lex.l" { BIN_OP_RETURN (EXPR_LE, 0); } YY_BREAK case 35: YY_USER_ACTION # line 486 "lex.l" { BIN_OP_RETURN (EXPR_EQ, 0); } YY_BREAK case 36: YY_USER_ACTION # line 487 "lex.l" { BIN_OP_RETURN (EXPR_NE, 0); } YY_BREAK case 37: YY_USER_ACTION # line 488 "lex.l" { BIN_OP_RETURN (EXPR_GE, 0); } YY_BREAK case 38: YY_USER_ACTION # line 489 "lex.l" { BIN_OP_RETURN (EXPR_OR, 0); } YY_BREAK case 39: YY_USER_ACTION # line 490 "lex.l" { BIN_OP_RETURN (EXPR_AND, 0); } YY_BREAK case 40: YY_USER_ACTION # line 491 "lex.l" { BIN_OP_RETURN (EXPR_LT, 0); } YY_BREAK case 41: YY_USER_ACTION # line 492 "lex.l" { BIN_OP_RETURN (EXPR_GT, 0); } YY_BREAK case 42: YY_USER_ACTION # line 493 "lex.l" { BIN_OP_RETURN ('*', 0); } YY_BREAK case 43: YY_USER_ACTION # line 494 "lex.l" { BIN_OP_RETURN ('/', 0); } YY_BREAK case 44: YY_USER_ACTION # line 495 "lex.l" { BIN_OP_RETURN (LEFTDIV, 0); } YY_BREAK case 45: YY_USER_ACTION # line 496 "lex.l" { BIN_OP_RETURN (';', 1); } YY_BREAK case 46: YY_USER_ACTION # line 497 "lex.l" { BIN_OP_RETURN (',', 1); } YY_BREAK case 47: YY_USER_ACTION # line 498 "lex.l" { BIN_OP_RETURN (POW, 0); } YY_BREAK case 48: YY_USER_ACTION # line 499 "lex.l" { BIN_OP_RETURN ('=', 1); } YY_BREAK case 49: YY_USER_ACTION # line 501 "lex.l" { #ifdef SHORT_CIRCUIT_LOGICALS BIN_OP_RETURN (EXPR_OR_OR, 0); #else BIN_OP_RETURN (EXPR_OR, 0); #endif } YY_BREAK case 50: YY_USER_ACTION # line 509 "lex.l" { #ifdef SHORT_CIRCUIT_LOGICALS BIN_OP_RETURN (EXPR_AND_AND, 0); #else BIN_OP_RETURN (EXPR_AND, 0); #endif } YY_BREAK case 51: YY_USER_ACTION # line 517 "lex.l" { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN (EXPR_NOT, 0); } YY_BREAK case 52: YY_USER_ACTION # line 523 "lex.l" { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN ('+', 0); } YY_BREAK case 53: YY_USER_ACTION # line 529 "lex.l" { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN ('-', 0); } YY_BREAK case 54: YY_USER_ACTION # line 535 "lex.l" { if (plotting && ! in_plot_range) past_plot_range = 1; nesting_level.push (PAREN); promptflag--; TOK_RETURN ('('); } YY_BREAK case 55: YY_USER_ACTION # line 543 "lex.l" { if (! nesting_level.empty ()) nesting_level.pop (); current_input_column++; cant_be_identifier = 1; quote_is_transpose = 1; convert_spaces_to_comma = (! nesting_level.empty () && nesting_level.top () == BRACE); do_comma_insert_check (); return ')'; } YY_BREAK // We return everything else as single character tokens, which should // eventually result in a parse error. case 56: YY_USER_ACTION # line 561 "lex.l" { TOK_RETURN (yytext[0]); } YY_BREAK case 57: YY_USER_ACTION # line 563 "lex.l" ECHO; YY_BREAK case YY_END_OF_BUFFER: { /* Amount of text matched not including the EOB char. */ int yy_amount_of_matched_text = yy_cp - yytext_ptr - 1; /* Undo the effects of YY_DO_BEFORE_ACTION. */ *yy_cp = yy_hold_char; if ( yy_current_buffer->yy_input_file != yyin ) { /* This can happen if we scan a file, yywrap() returns * 1, and then later the user points yyin at a new * file to resume scanning. We have to assure * consistency between yy_current_buffer and our * globals. Here is the right place to do so, because * this is the first action (other than possibly a * back-up) that will match for the new input file. */ yy_current_buffer->yy_input_file = yyin; yy_n_chars = yy_current_buffer->yy_n_chars; } /* Note that here we test for yy_c_buf_p "<=" to the position * of the first EOB in the buffer, since yy_c_buf_p will * already have been incremented past the NUL character * (since all states make transitions on EOB to the * end-of-buffer state). Contrast this with the test * in input(). */ if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) { /* This was really a NUL. */ yy_state_type yy_next_state; yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); /* Okay, we're now positioned to make the NUL * transition. We couldn't have * yy_get_previous_state() go ahead and do it * for us because it doesn't know how to deal * with the possibility of jamming (and we don't * want to build jamming into it because then it * will run more slowly). */ yy_next_state = yy_try_NUL_trans( yy_current_state ); yy_bp = yytext_ptr + YY_MORE_ADJ; if ( yy_next_state ) { /* Consume the NUL. */ yy_cp = ++yy_c_buf_p; yy_current_state = yy_next_state; goto yy_match; } else { goto yy_find_action; } } else switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { yy_did_buffer_switch_on_eof = 0; if ( yywrap() ) { /* Note: because we've taken care in * yy_get_next_buffer() to have set up * yytext, we can now set up * yy_c_buf_p so that if some total * hoser (like flex itself) wants to * call the scanner after we return the * YY_NULL, it'll still work - another * YY_NULL will get returned. */ yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; yy_act = YY_STATE_EOF(YY_START); goto do_action; } else { if ( ! yy_did_buffer_switch_on_eof ) YY_NEW_FILE; } break; } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_match; case EOB_ACT_LAST_MATCH: yy_c_buf_p = &yy_current_buffer->yy_ch_buf[yy_n_chars]; yy_current_state = yy_get_previous_state(); yy_cp = yy_c_buf_p; yy_bp = yytext_ptr + YY_MORE_ADJ; goto yy_find_action; } break; } default: YY_FATAL_ERROR( "fatal flex scanner internal error--no action found" ); } /* end of action switch */ } /* end of scanning one token */ } /* end of yylex */ /* yy_get_next_buffer - try to read in a new buffer * * Returns a code representing an action: * EOB_ACT_LAST_MATCH - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position * EOB_ACT_END_OF_FILE - end of file */ static int yy_get_next_buffer() { register char *dest = yy_current_buffer->yy_ch_buf; register char *source = yytext_ptr - 1; /* copy prev. char, too */ register int number_to_move, i; int ret_val; if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) YY_FATAL_ERROR( "fatal flex scanner internal error--end of buffer missed" ); if ( yy_current_buffer->yy_fill_buffer == 0 ) { /* Don't try to fill the buffer, so this is an EOF. */ if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) { /* We matched a singled characater, the EOB, so * treat this as a final EOF. */ return EOB_ACT_END_OF_FILE; } else { /* We matched some text prior to the EOB, first * process it. */ return EOB_ACT_LAST_MATCH; } } /* Try to read more data. */ /* First move last chars to start of buffer. */ number_to_move = yy_c_buf_p - yytext_ptr; for ( i = 0; i < number_to_move; ++i ) *(dest++) = *(source++); if ( yy_current_buffer->yy_eof_status != EOF_NOT_SEEN ) /* don't do the read, it's not guaranteed to return an EOF, * just force an EOF */ yy_n_chars = 0; else { int num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; while ( num_to_read <= 0 ) { /* Not enough room in the buffer - grow it. */ #ifdef YY_USES_REJECT YY_FATAL_ERROR( "input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); #else /* just a shorter name for the current buffer */ YY_BUFFER_STATE b = yy_current_buffer; int yy_c_buf_p_offset = yy_c_buf_p - b->yy_ch_buf; b->yy_buf_size *= 2; b->yy_ch_buf = (char *) yy_flex_realloc( (void *) b->yy_ch_buf, b->yy_buf_size ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "fatal error - scanner input buffer overflow" ); yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; num_to_read = yy_current_buffer->yy_buf_size - number_to_move - 1; #endif } if ( num_to_read > YY_READ_BUF_SIZE ) num_to_read = YY_READ_BUF_SIZE; /* Read in more data. */ YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), yy_n_chars, num_to_read ); } if ( yy_n_chars == 0 ) { if ( number_to_move - YY_MORE_ADJ == 1 ) { ret_val = EOB_ACT_END_OF_FILE; yyrestart( yyin ); } else { ret_val = EOB_ACT_LAST_MATCH; yy_current_buffer->yy_eof_status = EOF_PENDING; } } else ret_val = EOB_ACT_CONTINUE_SCAN; yy_n_chars += number_to_move; yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; /* yytext begins at the second character in yy_ch_buf; the first * character is the one which preceded it before reading in the latest * buffer; it needs to be kept around in case it's a newline, so * yy_get_previous_state() will have with '^' rules active. */ yytext_ptr = &yy_current_buffer->yy_ch_buf[1]; return ret_val; } /* yy_get_previous_state - get the state just before the EOB char was reached */ static yy_state_type yy_get_previous_state() { register yy_state_type yy_current_state; register char *yy_cp; yy_current_state = yy_start; for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) { register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 179 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; } return yy_current_state; } /* yy_try_NUL_trans - try to make a transition on the NUL character * * synopsis * next_state = yy_try_NUL_trans( current_state ); */ #ifdef YY_USE_PROTOS static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) #else static yy_state_type yy_try_NUL_trans( yy_current_state ) yy_state_type yy_current_state; #endif { register int yy_is_jam; register char *yy_cp = yy_c_buf_p; register YY_CHAR yy_c = 1; if ( yy_accept[yy_current_state] ) { yy_last_accepting_state = yy_current_state; yy_last_accepting_cpos = yy_cp; } while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; if ( yy_current_state >= 179 ) yy_c = yy_meta[(unsigned int) yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; yy_is_jam = (yy_current_state == 178); return yy_is_jam ? 0 : yy_current_state; } #ifdef YY_USE_PROTOS static void yyunput( int c, register char *yy_bp ) #else static void yyunput( c, yy_bp ) int c; register char *yy_bp; #endif { register char *yy_cp = yy_c_buf_p; /* undo effects of setting up yytext */ *yy_cp = yy_hold_char; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) { /* need to shift things up to make room */ /* +2 for EOB chars. */ register int number_to_move = yy_n_chars + 2; register char *dest = &yy_current_buffer->yy_ch_buf[ yy_current_buffer->yy_buf_size + 2]; register char *source = &yy_current_buffer->yy_ch_buf[number_to_move]; while ( source > yy_current_buffer->yy_ch_buf ) *--dest = *--source; yy_cp += dest - source; yy_bp += dest - source; yy_n_chars = yy_current_buffer->yy_buf_size; if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) YY_FATAL_ERROR( "flex scanner push-back overflow" ); } if ( yy_cp > yy_bp && yy_cp[-1] == '\n' ) yy_cp[-2] = '\n'; *--yy_cp = (char) c; /* Note: the formal parameter *must* be called "yy_bp" for this * macro to now work correctly. */ YY_DO_BEFORE_ACTION; /* set up yytext again */ } #ifdef __cplusplus static int yyinput() #else static int input() #endif { int c; *yy_c_buf_p = yy_hold_char; if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) { /* yy_c_buf_p now points to the character we want to return. * If this occurs *before* the EOB characters, then it's a * valid NUL; if not, then we've hit the end of the buffer. */ if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) /* This was really a NUL. */ *yy_c_buf_p = '\0'; else { /* need more input */ yytext_ptr = yy_c_buf_p; ++yy_c_buf_p; switch ( yy_get_next_buffer() ) { case EOB_ACT_END_OF_FILE: { if ( yywrap() ) { yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; return EOF; } YY_NEW_FILE; #ifdef __cplusplus return yyinput(); #else return input(); #endif } case EOB_ACT_CONTINUE_SCAN: yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; break; case EOB_ACT_LAST_MATCH: #ifdef __cplusplus YY_FATAL_ERROR( "unexpected last match in yyinput()" ); #else YY_FATAL_ERROR( "unexpected last match in input()" ); #endif } } } c = *yy_c_buf_p; *yy_c_buf_p = '\0'; /* preserve yytext */ yy_hold_char = *++yy_c_buf_p; return c; } #ifdef YY_USE_PROTOS void yyrestart( FILE *input_file ) #else void yyrestart( input_file ) FILE *input_file; #endif { if ( ! yy_current_buffer ) yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); yy_init_buffer( yy_current_buffer, input_file ); yy_load_buffer_state(); } #ifdef YY_USE_PROTOS void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) #else void yy_switch_to_buffer( new_buffer ) YY_BUFFER_STATE new_buffer; #endif { if ( yy_current_buffer == new_buffer ) return; if ( yy_current_buffer ) { /* Flush out information for old buffer. */ *yy_c_buf_p = yy_hold_char; yy_current_buffer->yy_buf_pos = yy_c_buf_p; yy_current_buffer->yy_n_chars = yy_n_chars; } yy_current_buffer = new_buffer; yy_load_buffer_state(); /* We don't actually know whether we did this switch during * EOF (yywrap()) processing, but the only time this flag * is looked at is after yywrap() is called, so it's safe * to go ahead and always set it. */ yy_did_buffer_switch_on_eof = 1; } #ifdef YY_USE_PROTOS void yy_load_buffer_state( void ) #else void yy_load_buffer_state() #endif { yy_n_chars = yy_current_buffer->yy_n_chars; yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; yyin = yy_current_buffer->yy_input_file; yy_hold_char = *yy_c_buf_p; } #ifdef YY_USE_PROTOS YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) #else YY_BUFFER_STATE yy_create_buffer( file, size ) FILE *file; int size; #endif { YY_BUFFER_STATE b; b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); if ( ! b ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); b->yy_buf_size = size; /* yy_ch_buf has to be 2 characters longer than the size given because * we need to put in 2 end-of-buffer characters. */ b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); if ( ! b->yy_ch_buf ) YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); yy_init_buffer( b, file ); return b; } #ifdef YY_USE_PROTOS void yy_delete_buffer( YY_BUFFER_STATE b ) #else void yy_delete_buffer( b ) YY_BUFFER_STATE b; #endif { if ( b == yy_current_buffer ) yy_current_buffer = (YY_BUFFER_STATE) 0; yy_flex_free( (void *) b->yy_ch_buf ); yy_flex_free( (void *) b ); } #ifdef YY_USE_PROTOS void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) #else void yy_init_buffer( b, file ) YY_BUFFER_STATE b; FILE *file; #endif { b->yy_input_file = file; /* We put in the '\n' and start reading from [1] so that an * initial match-at-newline will be true. */ b->yy_ch_buf[0] = '\n'; b->yy_n_chars = 1; /* We always need two end-of-buffer characters. The first causes * a transition to the end-of-buffer state. The second causes * a jam in that state. */ b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; b->yy_ch_buf[2] = YY_END_OF_BUFFER_CHAR; b->yy_buf_pos = &b->yy_ch_buf[1]; b->yy_is_interactive = file ? isatty( fileno(file) ) : 0; b->yy_fill_buffer = 1; b->yy_eof_status = EOF_NOT_SEEN; } #ifdef YY_USE_PROTOS static void yy_push_state( int new_state ) #else static void yy_push_state( new_state ) int new_state; #endif { if ( yy_start_stack_ptr >= yy_start_stack_depth ) { int new_size; yy_start_stack_depth += YY_START_STACK_INCR; new_size = yy_start_stack_depth * sizeof( int ); if ( ! yy_start_stack ) yy_start_stack = (int *) yy_flex_alloc( new_size ); else yy_start_stack = (int *) yy_flex_realloc( (void *) yy_start_stack, new_size ); if ( ! yy_start_stack ) YY_FATAL_ERROR( "out of memory expanding start-condition stack" ); } yy_start_stack[yy_start_stack_ptr++] = YY_START; BEGIN(new_state); } static void yy_pop_state() { if ( --yy_start_stack_ptr < 0 ) YY_FATAL_ERROR( "start-condition stack underflow" ); BEGIN(yy_start_stack[yy_start_stack_ptr]); } static int yy_top_state() { return yy_start_stack[yy_start_stack_ptr - 1]; } #ifdef YY_USE_PROTOS static void yy_fatal_error( const char msg[] ) #else static void yy_fatal_error( msg ) char msg[]; #endif { (void) fprintf( stderr, "%s\n", msg ); exit( 1 ); } /* Redefine yyless() so it works in section 3 code. */ #undef yyless #define yyless(n) \ do \ { \ /* Undo effects of setting up yytext. */ \ yytext[yyleng] = yy_hold_char; \ yy_c_buf_p = yytext + n - YY_MORE_ADJ; \ yy_hold_char = *yy_c_buf_p; \ *yy_c_buf_p = '\0'; \ yyleng = n; \ } \ while ( 0 ) /* Internal utility routines. */ #ifndef yytext_ptr #ifdef YY_USE_PROTOS static void yy_flex_strcpy( char *s1, const char *s2 ) #else static void yy_flex_strcpy( s1, s2 ) char *s1; const char *s2; #endif { while ( (*(s1++) = *(s2++)) ) ; } #endif #ifdef YY_USE_PROTOS static void *yy_flex_alloc( unsigned int size ) #else static void *yy_flex_alloc( size ) unsigned int size; #endif { return (void *) malloc( size ); } #ifdef YY_USE_PROTOS static void *yy_flex_realloc( void *ptr, unsigned int size ) #else static void *yy_flex_realloc( ptr, size ) void *ptr; unsigned int size; #endif { return (void *) realloc( ptr, size ); } #ifdef YY_USE_PROTOS static void yy_flex_free( void *ptr ) #else static void yy_flex_free( ptr ) void *ptr; #endif { free( ptr ); } # line 563 "lex.l" // GAG. // // If we're reading a matrix and the next character is '[', make sure // that we insert a comma ahead of it. void do_comma_insert_check (void) { int spc_gobbled = eat_continuation (); int c = yyinput (); yyunput (c, yytext); if (spc_gobbled) yyunput (' ', yytext); do_comma_insert = (braceflag && c == '['); } // Fix things up for errors or interrupts. The parser is never called // recursively, so it is always safe to reinitialize its state before // doing any parsing. void reset_parser (void) { // Start off on the right foot. BEGIN 0; error_state = 0; // We do want a prompt by default. promptflag = 1; // Not initially screwed by `function [...] = f (...)' syntax. maybe_screwed = 0; maybe_screwed_again = 0; // Not initially inside a loop or if statement. looping = 0; iffing = 0; // Quote marks strings intially. quote_is_transpose = 0; // Next token can be identifier. cant_be_identifier = 0; // No need to do comma insert or convert spaces to comma at beginning // of input. do_comma_insert = 0; convert_spaces_to_comma = 1; // Not initially defining a function. beginning_of_function = 0; defining_func = 0; // Not initially doing any plotting or setting of plot attributes. plotting = 0; in_plot_range = 0; past_plot_range = 0; in_plot_using = 0; in_plot_style = 0; doing_set = 0; // Not initially looking at indirect references. looking_at_indirect_ref = 0; // Error may have occurred inside some parentheses or braces. nesting_level.clear (); // Not initially defining a matrix list. braceflag = 0; ml.clear (); mlnm.clear (); // Clear out the stack of token info used to track line and column // numbers. while (! token_stack.empty ()) delete token_stack.pop (); // Can be reset by defining a function. if (! (reading_script_file || reading_fcn_file)) { current_input_column = 1; input_line_number = current_command_number - 1; } // Only ask for input from stdin if we are expecting interactive // input. if (interactive && ! (reading_fcn_file || get_input_from_eval_string)) yyrestart (stdin); // Delete the buffer for help text. delete [] help_buf; help_buf = 0; } // Replace backslash escapes in a string with the real values. static void do_string_escapes (char *s) { char *p1 = s; char *p2 = s; while (*p2 != '\0') { if (*p2 == '\\' && *(p2+1) != '\0') { switch (*++p2) { case 'a': *p1 = '\a'; break; case 'b': // backspace *p1 = '\b'; break; case 'f': // formfeed *p1 = '\f'; break; case 'n': // newline *p1 = '\n'; break; case 'r': // carriage return *p1 = '\r'; break; case 't': // horizontal tab *p1 = '\t'; break; case 'v': // vertical tab *p1 = '\v'; break; case '\\': // backslash *p1 = '\\'; break; case '\'': // quote *p1 = '\''; break; case '"': // double quote *p1 = '"'; break; default: warning ("unrecognized escape sequence `\\%c' --\ converting to `%c'", *p2, *p2); *p1 = *p2; break; } } else { *p1 = *p2; } p1++; p2++; } *p1 = '\0'; } // If we read some newlines, we need figure out what column we're // really looking at. static void fixup_column_count (char *s) { char c; while ((c = *s++) != '\0') { if (c == '\n') current_input_column = 1; else current_input_column++; } } // Include these so that we don't have to link to libfl.a. #ifdef yywrap #undef yywrap #endif static int yywrap (void) { return 1; } // These are not needed with flex-2.4.6, but may be needed with // earlier 2.4.x versions. #if 0 static void * yy_flex_alloc (int size) { return (void *) malloc ((unsigned) size); } static void * yy_flex_realloc (void *ptr, int size) { return (void *) realloc (ptr, (unsigned) size); } static void yy_flex_free (void *ptr) { free (ptr); } #endif // Tell us all what the current buffer is. YY_BUFFER_STATE current_buffer (void) { return YY_CURRENT_BUFFER; } // Create a new buffer. YY_BUFFER_STATE create_buffer (FILE *f) { return yy_create_buffer (f, YY_BUF_SIZE); } // Start reading a new buffer. void switch_to_buffer (YY_BUFFER_STATE buf) { yy_switch_to_buffer (buf); } // Delete a buffer. void delete_buffer (YY_BUFFER_STATE buf) { yy_delete_buffer (buf); } // Restore a buffer (for unwind-prot). void restore_input_buffer (void *buf) { switch_to_buffer ((YY_BUFFER_STATE) buf); } // Delete a buffer (for unwind-prot). void delete_input_buffer (void *buf) { delete_buffer ((YY_BUFFER_STATE) buf); } // Check to see if a character string matches any of the possible line // styles for plots. static char * plot_style_token (char *s) { static char *plot_styles[] = { "boxes", "boxerrorbars", "dots", "errorbars", "impulses", "lines", "linespoints", "points", "steps", 0, }; char **tmp = plot_styles; while (*tmp) { if (almost_match (*tmp, s)) return *tmp; tmp++; } return 0; } // Check to see if a character string matches any one of the plot // option keywords. Don't match abbreviations for clear, since that's // not a gnuplot keyword (users will probably only expect to be able // to abbreviate actual gnuplot keywords). static int is_plot_keyword (char *s) { if (almost_match ("title", s)) { return TITLE; } else if (almost_match ("using", s)) { in_plot_using = 1; return USING; } else if (almost_match ("with", s)) { in_plot_style = 1; return WITH; } else if (strcmp ("clear", s) == 0) { return CLEAR; } else { return 0; } } // Handle keywords. Could probably be more efficient... static int is_keyword (char *s) { if (plotting && in_plot_style) { char *sty = plot_style_token (s); if (sty) { in_plot_style = 0; yylval.tok_val = new token (sty); token_stack.push (yylval.tok_val); return STYLE; } } int l = input_line_number; int c = current_input_column; // XXX FIXME XXX -- this has really become too large a list to search // like this... int end_found = 0; if (strcmp ("break", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return BREAK; } else if (strcmp ("continue", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return CONTINUE; } else if (strcmp ("else", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ELSE; } else if (strcmp ("elseif", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ELSEIF; } else if (strcmp ("end", s) == 0) { end_found = 1; yylval.tok_val = new token (token::simple_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endfor", s) == 0) { end_found = 1; yylval.tok_val = new token (token::for_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endfunction", s) == 0) { end_found = 1; yylval.tok_val = new token (token::function_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endif", s) == 0) { end_found = 1; yylval.tok_val = new token (token::if_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endwhile", s) == 0) { end_found = 1; yylval.tok_val = new token (token::while_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("for", s) == 0) { promptflag--; looping++; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return FOR; } else if (strcmp ("function", s) == 0) { if (defining_func) { error ("function keyword invalid within a function body"); if ((reading_fcn_file || reading_script_file) && curr_fcn_file_name) error ("defining new function near line %d of file `%s.m'", input_line_number, curr_fcn_file_name); else error ("defining new function near line %d", input_line_number); return LEXICAL_ERROR; } else { tmp_local_sym_tab = new symbol_table (); curr_sym_tab = tmp_local_sym_tab; defining_func = 1; promptflag--; beginning_of_function = 1; if (! (reading_fcn_file || reading_script_file)) input_line_number = 1; return FCN; } } else if (strcmp ("global", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return GLOBAL; } else if (strcmp ("gplot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::two_dee, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("gsplot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::three_dee, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("replot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::replot, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("if", s) == 0) { iffing++; promptflag--; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return IF; } else if (strcmp ("return", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return FUNC_RET; } else if (strcmp ("while", s) == 0) { promptflag--; looping++; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return WHILE; } else if (strcmp ("unwind_protect", s) == 0) { promptflag--; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return UNWIND; } else if (strcmp ("unwind_protect_cleanup", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return CLEANUP; } else if (strcmp ("end_unwind_protect", s) == 0) { end_found = 1; yylval.tok_val = new token (token::unwind_protect_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("all_va_args", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ALL_VA_ARGS; } if (end_found) return END; return 0; } // Try to find an identifier. All binding to global or builtin // variables occurs when expressions are evaluated. static symbol_record * lookup_identifier (char *name) { return curr_sym_tab->lookup (name, 1, 0); } // Grab the help text from an function file. Always overwrites the // current contents of help_buf. static void grab_help_text (void) { delete [] help_buf; help_buf = 0; ostrstream buf; int in_comment = 1; int c = 0; while ((c = yyinput ()) != EOF) { if (in_comment) { buf << (char) c; if (c == '\n') in_comment = 0; } else { switch (c) { case '%': case '#': in_comment = 1; break; case ' ': case '\t': break; default: goto done; } } } done: if (c) yyunput (c, yytext); buf << ends; help_buf = buf.str (); if (! help_buf || ! *help_buf) { delete [] help_buf; help_buf = 0; } } // Return 1 if the given character matches any character in the given // string. static int match_any (char c, char *s) { char tmp; while ((tmp = *s++) != '\0') { if (c == tmp) return 1; } return 0; } // Given information about the spacing surrounding an operator, // return 1 if it looks like it should be treated as a binary // operator. For example, // // [ 1 + 2 ] or [ 1+ 2] or [ 1+2 ] ==> binary static int looks_like_bin_op (int spc_prev, int spc_next) { return ((spc_prev && spc_next) || ! spc_prev); } // Duh. static int next_char_is_space (void) { int c = yyinput (); yyunput (c, yytext); return (c == ' ' || c == '\t'); } // Try to determine if the next token should be treated as a postfix // unary operator. This is ugly, but it seems to do the right thing. static int next_token_is_postfix_unary_op (int spc_prev, char *yytext) { int un_op = 0; int c0 = yyinput (); int c1 = yyinput (); yyunput (c1, yytext); yyunput (c0, yytext); int transpose = (c0 == '.' && c1 == '\''); int hermitian = (c0 == '\''); un_op = (transpose || (hermitian && ! spc_prev)); return un_op; } // Try to determine if the next token should be treated as a binary // operator. This is even uglier, but it also seems to do the right // thing. static int next_token_is_bin_op (int spc_prev, char *yytext) { int bin_op = 0; int spc_next = 0; int c0 = yyinput (); int c1 = yyinput (); switch (c0) { case '+': case '-': case '/': case ':': case '\\': case '^': spc_next = (c1 == ' ' || c1 == '\t'); break; case '&': if (c1 == '&') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '*': if (c1 == '*') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '|': if (c1 == '|') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '<': if (c1 == '=' || c1 == '>') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '>': if (c1 == '=') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '~': case '!': case '=': if (c1 == '=') spc_next = next_char_is_space (); else goto done; break; case '.': if (c1 == '*') { int c2 = yyinput (); if (c2 == '*') spc_next = next_char_is_space (); else spc_next = (c2 == ' ' || c2 == '\t'); yyunput (c2, yytext); } else if (c1 == '/' || c1 == '\\' || c1 == '^') spc_next = next_char_is_space (); else goto done; break; default: goto done; } bin_op = looks_like_bin_op (spc_prev, spc_next); done: yyunput (c1, yytext); yyunput (c0, yytext); return bin_op; } // Used to delete trailing white space from tokens. static char * strip_trailing_whitespace (char *s) { char *retval = strsave (s); char *t = strchr (retval, ' '); if (t) *t = '\0'; t = strchr (retval, '\t'); if (t) *t = '\0'; return retval; } // Discard whitespace, including comments and continuations. // Return 1 if whitespace appeared in the input, 0 otherwise. static int eat_whitespace (void) { int retval = 0; int in_comment = 0; int c; while ((c = yyinput ()) != EOF) { current_input_column++; switch (c) { case ' ': case '\t': retval = 1; break; case '\n': retval = 1; in_comment = 0; current_input_column = 0; break; case '#': case '%': in_comment = 1; break; case '.': if (in_comment) break; else { if (have_ellipsis_continuation ()) break; else goto done; } case '\\': if (in_comment) break; else { if (have_continuation ()) break; else goto done; } default: if (in_comment) break; else goto done; } } done: yyunput (c, yytext); return retval; } static void handle_number (char *yytext) { double value; int nread = sscanf (yytext, "%lf", &value); // If yytext doesn't contain a valid number, we are in deep doo doo. assert (nread == 1); quote_is_transpose = 1; cant_be_identifier = 1; convert_spaces_to_comma = 1; if (plotting && ! in_plot_range) past_plot_range = 1; yylval.tok_val = new token (value, yytext, input_line_number, current_input_column); token_stack.push (yylval.tok_val); current_input_column += yyleng; do_comma_insert_check (); } // We have seen a backslash and need to find out if it should be // treated as a continuation character. If so, this eats it, up to // and including the new line character. // // Match whitespace only, followed by a comment character or newline. // Once a comment character is found, discard all input until newline. // If non-whitespace characters are found before comment // characters, return 0. Otherwise, return 1. static int have_continuation (void) { ostrstream buf; int in_comment = 0; char c; while ((c = yyinput ()) != EOF) { buf << (char) c; switch (c) { case ' ': case '\t': break; case '%': case '#': in_comment = 1; break; case '\n': current_input_column = 0; promptflag--; return 1; default: if (in_comment) break; else { buf << ends; char *s = buf.str (); if (s) { int len = strlen (s); while (len--) yyunput (s[len], yytext); } delete [] s; return 0; } } } yyunput (c, yytext); return 0; } // We have seen a `.' and need to see if it is the start of a // continuation. If so, this eats it, up to and including the new // line character. static int have_ellipsis_continuation (void) { char c1 = yyinput (); if (c1 == '.') { char c2 = yyinput (); if (c2 == '.' && have_continuation ()) return 1; else { yyunput (c2, yytext); yyunput (c1, yytext); } } else yyunput (c1, yytext); return 0; } // See if we have a continuation line. If so, eat it and the leading // whitespace on the next line. // Return 1 if whitespace appeared in the input, 0 otherwise. static int eat_continuation (void) { int retval = 0; int c = yyinput (); if ((c == '.' && have_ellipsis_continuation ()) || (c == '\\' && have_continuation ())) retval = eat_whitespace (); else yyunput (c, yytext); return retval; } static int handle_string (char delim, int text_style) { ostrstream buf; int c; int prev = 0; while ((c = yyinput ()) != EOF) { current_input_column++; if (c == '\\') { if (! have_continuation ()) buf << (char) c; goto next; } else if (c == '.') { if (! have_ellipsis_continuation ()) buf << (char) c; goto next; } else if (c == '\n') { break; } else if (c == delim) { if (prev == '\\') buf << (char) c; else { c = yyinput (); if (c == delim) buf << (char) c; else { yyunput (c, yytext); buf << ends; char *tok = buf.str (); do_string_escapes (tok); if (text_style && doing_set) { if (tok) { int len = strlen (tok) + 3; char *tmp = tok; tok = new char [len]; tok[0] = delim; strcpy (tok+1, tmp); tok[len-2] = delim; tok[len-1] = '\0'; delete [] tmp; } } else { quote_is_transpose = 1; cant_be_identifier = 1; convert_spaces_to_comma = 1; } yylval.tok_val = new token (tok); delete [] tok; token_stack.push (yylval.tok_val); return TEXT; } } } else { buf << (char) c; } next: prev = c; } return LEXICAL_ERROR; } static int handle_close_brace (int spc_gobbled) { if (! nesting_level.empty ()) { nesting_level.pop (); braceflag--; } if (braceflag == 0) BEGIN 0; int c1 = yyinput (); if (c1 == '=') { quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; int c2 = yyinput (); unput (c2); unput (c1); if (c2 != '=' && maybe_screwed_again) return SCREW_TWO; else return ']'; } else { unput (c1); if (braceflag && user_pref.whitespace_in_literal_matrix != 2) { int bin_op = next_token_is_bin_op (spc_gobbled, yytext); int postfix_un_op = next_token_is_postfix_unary_op (spc_gobbled, yytext); int other_op = match_any (c1, ",;\n]"); if (! (postfix_un_op || bin_op || other_op || nesting_level.empty ()) && nesting_level.top () == BRACE && convert_spaces_to_comma) { unput (','); return ']'; } } } quote_is_transpose = 1; cant_be_identifier = 0; convert_spaces_to_comma = 1; return ']'; } // Figure out exactly what kind of token to return when we have seen // an identifier. Handles keywords. static int handle_identifier (char *tok, int spc_gobbled) { // It is almost always an error for an identifier to be followed // directly by another identifier. Special cases are handled below. cant_be_identifier = 1; // If we are expecting a structure element, we just want to return // TEXT_ID, which is a string that is also a valid identifier. if (looking_at_indirect_ref) { yylval.tok_val = new token (tok); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT_ID); } // If we have a regular keyword, or a plot STYLE, return it. Keywords // can be followed by identifiers (TOK_RETURN handles that). int kw_token = is_keyword (tok); if (kw_token) { if (kw_token == STYLE) { quote_is_transpose = 0; convert_spaces_to_comma = 1; return kw_token; } else TOK_RETURN (kw_token); } // See if we have a plot keyword (title, using, with, or clear). if (plotting) { // Yes, we really do need both of these plot_range variables. One // is used to mark when we are past all possiblity of a plot range, // the other is used to mark when we are actually between the square // brackets that surround the range. if (! in_plot_range) past_plot_range = 1; int plot_option_kw = is_plot_keyword (tok); if (cant_be_identifier && plot_option_kw) TOK_RETURN (plot_option_kw); } // If we are looking at a text style function, set up to gobble its // arguments. These are also reserved words, but only because it // would be very difficult to do anything intelligent with them if // they were not reserved. if (is_text_function_name (tok)) { BEGIN TEXT_FCN; if (strcmp (tok, "help") == 0) BEGIN HELP_FCN; else if (strcmp (tok, "set") == 0) doing_set = 1; } int c = yyinput (); yyunput (c, yytext); int next_tok_is_eq = (c == '='); // Make sure we put the return values of a function in the symbol // table that is local to the function. if (next_tok_is_eq && defining_func && maybe_screwed) curr_sym_tab = tmp_local_sym_tab; // Find the token in the symbol table. yylval.tok_val = new token (lookup_identifier (tok), input_line_number, current_input_column); token_stack.push (yylval.tok_val); // After seeing an identifer, it is ok to convert spaces to a comma // (if needed). convert_spaces_to_comma = 1; // If we are defining a function and we have not seen the parameter // list yet and the next token is `=', return a token that represents // the only return value for the function. For example, // // function SCREW = f (args); // // The variable maybe_screwed is reset in parse.y. if (next_tok_is_eq) { if (defining_func && maybe_screwed) return SCREW; else return NAME; } // At this point, we are only dealing with identifiers that are not // followed by `=' (if the next token is `=', there is no need to // check to see if we should insert a comma (invalid syntax), or allow // a following `'' to be treated as a transpose (the next token is // `=', so it can't be `''. quote_is_transpose = 1; do_comma_insert_check (); // Check to see if we should insert a comma. if (user_pref.whitespace_in_literal_matrix != 2 && ! nesting_level.empty () && nesting_level.top () == BRACE) { int bin_op = next_token_is_bin_op (spc_gobbled, yytext); int postfix_un_op = next_token_is_postfix_unary_op (spc_gobbled, yytext); int c1 = yyinput (); unput (c1); int other_op = match_any (c1, ".,;\n]"); int index_op = (c1 == '(' && (user_pref.whitespace_in_literal_matrix == 0 || ! spc_gobbled)); if (! (postfix_un_op || bin_op || other_op || index_op)) unput (','); } return NAME; } // Print a warning if a function file that defines a function has // anything other than comments and whitespace following the END token // that matches the FUNCTION statement. void check_for_garbage_after_fcn_def (void) { // By making a newline be the next character to be read, we will force // the parser to return after reading the function. Calling yyunput // with EOF seems not to work... int in_comment = 0; int lineno = input_line_number; int c; while ((c = yyinput ()) != EOF) { switch (c) { case ' ': case '\t': case ';': case ',': break; case '\n': if (in_comment) in_comment = 0; break; case '%': case '#': in_comment = 1; break; default: if (in_comment) break; else { warning ("ignoring trailing garbage after end of function\n\ near line %d of file `%s.m'", lineno, curr_fcn_file_name); yyunput ('\n', yytext); return; } } } yyunput ('\n', yytext); } /* Maybe someday... "+=" return ADD_EQ; "-=" return SUB_EQ; "*=" return MUL_EQ; "/=" return DIV_EQ; "\\=" return LEFTDIV_EQ; ".+=" return ADD_EQ; ".-=" return SUB_EQ; ".*=" return EMUL_EQ; "./=" return EDIV_EQ; ".\\=" return ELEFTDIV_EQ; */ octave-1.1.0/src/y.tab.h100666 415 17 4433 5705522255 13127 0ustar jweuserstypedef union { // The type of the basic tokens returned by the lexer. token *tok_val; // Types for the nonterminals we generate. tree *tree_type; tree_expression *tree_expression_type; tree_constant *tree_constant_type; tree_matrix *tree_matrix_type; tree_identifier *tree_identifier_type; tree_indirect_ref *tree_indirect_ref_type; tree_function *tree_function_type; tree_index_expression *tree_index_expression_type; tree_colon_expression *tree_colon_expression_type; tree_argument_list *tree_argument_list_type; tree_parameter_list *tree_parameter_list_type; tree_command *tree_command_type; tree_if_command *tree_if_command_type; tree_if_clause *tree_if_clause_type; tree_if_command_list *tree_if_command_list_type; tree_global *tree_global_type; tree_global_init_list *tree_global_init_list_type; tree_global_command *tree_global_command_type; tree_statement *tree_statement_type; tree_statement_list *tree_statement_list_type; tree_plot_command *tree_plot_command_type; subplot *subplot_type; subplot_list *subplot_list_type; plot_limits *plot_limits_type; plot_range *plot_range_type; subplot_using *subplot_using_type; subplot_style *subplot_style_type; } YYSTYPE; #define EXPR_AND_AND 258 #define EXPR_OR_OR 259 #define EXPR_AND 260 #define EXPR_OR 261 #define EXPR_NOT 262 #define EXPR_LT 263 #define EXPR_LE 264 #define EXPR_EQ 265 #define EXPR_NE 266 #define EXPR_GE 267 #define EXPR_GT 268 #define LEFTDIV 269 #define EMUL 270 #define EDIV 271 #define ELEFTDIV 272 #define QUOTE 273 #define TRANSPOSE 274 #define PLUS_PLUS 275 #define MINUS_MINUS 276 #define POW 277 #define EPOW 278 #define NUM 279 #define IMAG_NUM 280 #define NAME 281 #define SCREW 282 #define END 283 #define PLOT 284 #define TEXT 285 #define STYLE 286 #define FOR 287 #define WHILE 288 #define IF 289 #define ELSEIF 290 #define ELSE 291 #define BREAK 292 #define CONTINUE 293 #define FUNC_RET 294 #define UNWIND 295 #define CLEANUP 296 #define GLOBAL 297 #define TEXT_ID 298 #define LEXICAL_ERROR 299 #define FCN 300 #define SCREW_TWO 301 #define ELLIPSIS 302 #define ALL_VA_ARGS 303 #define END_OF_INPUT 304 #define USING 305 #define TITLE 306 #define WITH 307 #define COLON 308 #define OPEN_BRACE 309 #define CLOSE_BRACE 310 #define CLEAR 311 #define UNARY 312 extern YYSTYPE yylval; octave-1.1.0/src/arith-ops.h100666 415 17 5750 5702416757 14031 0ustar jweusers// arith-ops.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_arith_ops_h) #define octave_arith_ops_h 1 #include "tree-expr.h" class Complex; class Matrix; class ComplexMatrix; class tree_constant; extern tree_constant do_unary_op (double d, tree_expression::type t); extern tree_constant do_unary_op (const Matrix& a, tree_expression::type t); extern tree_constant do_unary_op (const Complex& c, tree_expression::type t); extern tree_constant do_unary_op (const ComplexMatrix& a, tree_expression::type t); extern tree_constant do_binary_op (double a, double b, tree_expression::type t); extern tree_constant do_binary_op (double a, const Matrix& b, tree_expression::type t); extern tree_constant do_binary_op (double a, const Complex& b, tree_expression::type t); extern tree_constant do_binary_op (double a, const ComplexMatrix& b, tree_expression::type t); extern tree_constant do_binary_op (const Matrix& a, double b, tree_expression::type t); extern tree_constant do_binary_op (const Matrix& a, const Matrix& b, tree_expression::type t); extern tree_constant do_binary_op (const Matrix& a, const Complex& b, tree_expression::type t); extern tree_constant do_binary_op (const Matrix& a, const ComplexMatrix& b, tree_expression::type t); extern tree_constant do_binary_op (const Complex& a, double b, tree_expression::type t); extern tree_constant do_binary_op (const Complex& a, const Matrix& b, tree_expression::type t); extern tree_constant do_binary_op (const Complex& a, const Complex& b, tree_expression::type t); extern tree_constant do_binary_op (const Complex& a, const ComplexMatrix& b, tree_expression::type t); extern tree_constant do_binary_op (const ComplexMatrix& a, double b, tree_expression::type t); extern tree_constant do_binary_op (const ComplexMatrix& a, const Matrix& b, tree_expression::type t); extern tree_constant do_binary_op (const ComplexMatrix& a, const Complex& b, tree_expression::type t); extern tree_constant do_binary_op (const ComplexMatrix& a, const ComplexMatrix& b, tree_expression::type t); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/builtins.h100666 415 17 1754 5702416756 13753 0ustar jweusers// builtins.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_builtins_h) #define octave_builtins_h 1 extern void install_builtins (void); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/defaults.h.in100666 415 17 4652 5702420713 14322 0ustar jweusers// defaults.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_defaults_h) #define octave_defaults_h 1 #ifndef DEFAULT_PAGER #define DEFAULT_PAGER %DEFAULT_PAGER% #endif #ifndef OCTAVE_PREFIX #define OCTAVE_PREFIX %OCTAVE_PREFIX% #endif #ifndef OCTAVE_EXEC_PREFIX #define OCTAVE_EXEC_PREFIX %OCTAVE_EXEC_PREFIX% #endif #ifndef OCTAVE_DATADIR #define OCTAVE_DATADIR %OCTAVE_DATADIR% #endif #ifndef OCTAVE_LIBDIR #define OCTAVE_LIBDIR %OCTAVE_LIBDIR% #endif #ifndef OCTAVE_BINDIR #define OCTAVE_BINDIR %OCTAVE_BINDIR% #endif #ifndef OCTAVE_INFODIR #define OCTAVE_INFODIR %OCTAVE_INFODIR% #endif #ifndef OCTAVE_FCNFILEDIR #define OCTAVE_FCNFILEDIR %OCTAVE_FCNFILEDIR% #endif #ifndef OCTAVE_STARTUPFILEDIR #define OCTAVE_STARTUPFILEDIR OCTAVE_FCNFILEDIR "/startup" #endif #ifndef OCTAVE_LOCALFCNFILEPATH #define OCTAVE_LOCALFCNFILEPATH %OCTAVE_LOCALFCNFILEPATH% #endif #ifndef OCTAVE_ARCHLIBDIR #define OCTAVE_ARCHLIBDIR %OCTAVE_ARCHLIBDIR% #endif #ifndef OCTAVE_OCTFILEDIR #define OCTAVE_OCTFILEDIR %OCTAVE_OCTFILEDIR% #endif #ifndef OCTAVE_LOCALOCTFILEPATH #define OCTAVE_LOCALOCTFILEPATH %OCTAVE_LOCALOCTFILEPATH% #endif #ifndef OCTAVE_FCNFILEPATH #define OCTAVE_FCNFILEPATH %OCTAVE_FCNFILEPATH% #endif #ifndef OCTAVE_IMAGEPATH #define OCTAVE_IMAGEPATH %OCTAVE_IMAGEPATH% #endif #ifndef TARGET_HOST_TYPE #define TARGET_HOST_TYPE %TARGET_HOST_TYPE% #endif #ifndef FLIB_LIST #define FLIB_LIST %FLIB_LIST% #endif #ifndef FLIB_PATH #define FLIB_PATH %FLIB_PATH% #endif #ifndef CXXLIB_LIST #define CXXLIB_LIST %CXXLIB_LIST% #endif #ifndef CXXLIB_PATH #define CXXLIB_PATH %CXXLIB_PATH% #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/defun.h100666 415 17 12645 5702416752 13240 0ustar jweusers// defun.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_defun_h) #define octave_defun_h 1 #if defined (octave_defun_dld_h) #error defun.h and defun-dld.h both included in same file! #endif #include "defun-int.h" // Define a builtin variable. // // name is the name of the variable, as a string. // // sname is the name of the structure that is used to hold // information about the variable, and that is passed to // install_builtin_variable to register it in the symbol table. // By convention, it is constructed by prefixing name with the // character S. // // ins_as_fcn is a flag that says whether to install the variable as // if it were a function (allowing the name to also be used as a // variable by users, but recover its original definition if cleared). // // eternal is a flag that says whether it should be possible to // clear the variable. Most builtin variables are eternal, and // cannot be cleared. // // sv_fcn is a pointer to a function that should be called whenever // this variable is given a new value. It can be 0 if there is no // function to call. See also the code in user-prefs.cc. // // doc is the simple help text for this variable. #define DEFVAR(name, sname, defn, inst_as_fcn, protect, \ eternal, sv_fcn, doc) \ do \ { \ builtin_variable sname = \ { \ name, \ new tree_constant (defn), \ inst_as_fcn, \ protect, \ eternal, \ sv_fcn, \ doc, \ }; \ install_builtin_variable (&sname); \ } \ while (0) // Define a builtin function. // // name is the name of the function, as a string. // // fname is the name of the C++ function. By convention, it is // constructed by prefixing name with the character F. // // sname is the name of the structure that is used to hold // information about the function, and that is passed to // install_builtin_function to register the function in the symbol // table. By convention, it is constructed by prefixing name with // the character S. // // nargin_max is the maximum number of arguments this function can // accept. XXX FIXME XXX -- is this really used now? // // nargout_max is the maximum number of outputs this function can // produce. XXX FIXME XXX -- is this really used now? // // doc is the simple help text for the function. #define DEFUN(name, fname, sname, nargin_max, nargout_max, doc) \ DEFUN_INTERNAL (name, fname, sname, nargin_max, nargout_max, 0, doc) // Define a builtin text-style function. // // This is like DEFUN, except that it defines a function that can be // called from the Octave language without using parenthesis to // surround the arguments). #define DEFUN_TEXT(name, fname, sname, nargin_max, nargout_max, doc) \ DEFUN_INTERNAL (name, fname, sname, nargin_max, nargout_max, 1, doc) // Define a mapper function. // // name is the name of the function as a string // // sname is the name of the structure that is used to hold // information about the function, and that is passed to // install_builtin_mapper to register the function in the symbol // table. By convention, it is constructed by prefixing name with // the character S. // // can_ret_cmplx_for_real is a flag that says whether this function // can create a complex number given a real-valued argument // (e.g., sqrt (-1)). // // lo is the lower bound of the range for which real arguments can // become complex. (e.g., lo == -Inf for sqrt). // // hi is the upper bound of the range for which real arguments can // become complex. (e.g., hi == 0 for sqrt). // // d_d_map is a pointer to a function that should be called for real // arguments that are expected to create real results. // // d_c_map is a pointer to a function that should be called for real // arguments that are expected to create complex results. // // c_c_map is a pointer to a function that should be called for // complex arguments that are expected to create complex results. // // doc is the simple help text for the function. #define DEFUN_MAPPER(name, sname, can_ret_cmplx_for_real, lo, hi, \ d_d_map, d_c_map, c_c_map, doc) \ do \ { \ builtin_mapper_function sname = \ { \ name, \ can_ret_cmplx_for_real, \ lo, \ hi, \ d_d_map, \ d_c_map, \ c_c_map, \ doc, \ }; \ install_builtin_mapper (&sname); \ } \ while (0) // Make alias another name for the existing function name. This macro // must be used in the same file where name is defined, after the // definition for name. #define DEFALIAS(name, alias) DEFALIAS_INTERNAL (name, alias) #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/defun-dld.h100666 415 17 4412 5702416754 13754 0ustar jweusers// defun-dld.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_defun_dld_h) #define octave_defun_dld_h 1 #if defined (octave_defun_h) #error defun.h and defun-dld.h both included in same file! #endif #include "defun-int.h" // Define a builtin function that may be loaded dynamically at run // time. // // If Octave is not configured for dynamic linking of builtin // functions, this is exactly like DEFUN. #if defined (WITH_DLD) && defined (OCTAVE_LITE) && defined (MAKE_BUILTINS) #define DEFUN_DLD_BUILTIN(name, fname, sname, nargin_max, nargout_max, doc) \ BEGIN_INSTALL_BUILTIN \ DEFINE_FUN_STRUCT (name, 0, sname, nargin_max, nargout_max, 0, doc); \ install_builtin_function (&sname); \ END_INSTALL_BUILTIN #else #define DEFUN_DLD_BUILTIN(name, fname, sname, nargin_max, nargout_max, doc) \ DEFUN_INTERNAL (name, fname, sname, nargin_max, nargout_max, 0, doc) #endif // Define a function that may be loaded dynamically at run time. // // If Octave is not configured for dynamic linking of builtin // functions, this won't do anything useful. // // The forward declaration is for the struct, the second is for the // definition of the function. #if ! defined (MAKE_BUILTINS) #define DEFUN_DLD(name, fname, sname, fsname, nargin_max, nargout_max, doc) \ DECLARE_FUN (fname); \ DEFINE_FUN_STRUCT (name, fname, sname, nargin_max, nargout_max, 0, doc); \ DEFINE_FUN_STRUCT_FUN (sname, fsname) \ DECLARE_FUN (fname) #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/defun-int.h100666 415 17 6436 5702416753 14012 0ustar jweusers// defun-int.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_defun_int_h) #define octave_defun_int_h 1 // MAKE_BUILTINS is defined to extract function names and related // information and create the *.def files that are eventually used to // create the buitlins.cc file. #ifdef MAKE_BUILTINS // Generate code to install name in the symbol table. The script // mkdefs will create a .def file for every .cc file that uses DEFUN, // DEFUN_TEXT, or DEFUN_DLD. #define DEFUN_INTERNAL(name, fname, sname, nargin_max, nargout_max, \ is_text_fcn, doc) \ BEGIN_INSTALL_BUILTIN \ extern DECLARE_FUN (fname); \ DEFINE_FUN_STRUCT (name, fname, sname, nargin_max, nargout_max, \ is_text_fcn, doc); \ install_builtin_function (&sname); \ END_INSTALL_BUILTIN // Generate code for making another name for an existing function. #define DEFALIAS_INTERNAL(alias, name) \ BEGIN_INSTALL_BUILTIN \ alias_builtin (#alias, #name); \ END_INSTALL_BUILTIN #else /* ! MAKE_BUILTINS */ // Generate the first line of the function definition. This ensures // that the internal functions all have the same signature. #define DEFUN_INTERNAL(name, fname, sname, nargin_max, nargout_max, \ is_text_fcn, doc) \ DECLARE_FUN (fname) // No definition is required for an alias. #define DEFALIAS_INTERNAL(name, alias) #endif /* ! MAKE_BUILTINS */ // Define the structure that will be used to insert this function into // the symbol table. #define DEFINE_FUN_STRUCT(name, fname, sname, nargin_max, \ nargout_max, is_text_fcn, doc) \ static builtin_function sname = \ { name, nargin_max, nargout_max, is_text_fcn, fname, doc } #define DEFINE_FUN_STRUCT_FUN(sname, fsname) \ builtin_function * \ fsname (void) \ { \ return &sname; \ } // Declare an internal function named fname. This is the interface // used by all internal functions in Octave that are also callable // from the Octave language. #define DECLARE_FUN(fname) \ Octave_object \ fname (const Octave_object& args, int nargout) // XXX FIXME XXX -- eliminate the need for these in the functions that // use them? #define DEFINE_ARGV(fcn_name) \ int argc = args.length () + 1; \ int save_argc = argc; \ char **argv = make_argv (args, fcn_name); \ char **save_argv = argv; \ if (error_state) \ return retval #define DELETE_ARGV \ do \ { \ while (--save_argc >= 0) \ delete [] save_argv[save_argc]; \ delete [] save_argv; \ } \ while (0) #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/dirfns.h100666 415 17 2465 5702416751 13402 0ustar jweusers// dirfns.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_dirfns_h) #define octave_dirfns_h 1 extern char *polite_directory_format (char *); extern int absolute_pathname (const char *); extern int absolute_program (const char *); extern char *base_pathname (char *); extern void pathname_backup (char *, int); extern char *make_absolute (const char *, const char *); extern int is_newer (const char *, time_t); extern char *get_working_directory (const char *); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/dynamic-ld.h100666 415 17 2565 5702416750 14136 0ustar jweusers// dynamic-ld.h -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_dynamic_ld_h) #define octave_dynamic_ld_h 1 #include "oct-obj.h" typedef Octave_object (*Octave_builtin_fcn)(const Octave_object&, int); extern Octave_builtin_fcn load_octave_builtin (const char *name); extern int load_octave_oct_file (const char *name); extern void init_dynamic_linker (void); // OLD: #if 0 extern void octave_dld_tc2_unlink_by_symbol (const char *name, int hard = 1); extern void octave_dld_tc2_unlink_by_file (const char *name, int hard = 1); #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/error.h100666 415 17 3105 5702416747 13243 0ustar jweusers// error.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_error_h) #define octave_error_h 1 #define panic_impossible() \ panic ("impossible state reached in file `%s' at line %d", \ __FILE__, __LINE__) // Tell g++ that panic doesn't return; #ifdef __GNUG__ typedef void v_fcn_cpc_x (const char *, ...); volatile v_fcn_cpc_x panic; #endif extern void message (const char *name, const char *fmt, ...); extern void usage (const char *fmt, ...); extern void warning (const char *fmt, ...); extern void error (const char *fmt, ...); extern void parse_error (const char *fmt, ...); extern void panic (const char *fmt, ...); // Current error state. extern int error_state; // XXX FIXME XXX extern int suppress_octave_error_messages; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/file-io.h100666 415 17 5176 5702416746 13447 0ustar jweusers// file-io.h -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by John C. Campbell . #if !defined (octave_files_h) #define octave_files_h 1 #include #include "oct-obj.h" extern Pix return_valid_file (const tree_constant& arg); extern Octave_object fclose_internal (const Octave_object& args); extern Octave_object feof_internal (const Octave_object& args, int nargout); extern Octave_object ferror_internal (const Octave_object& args, int nargout); extern Octave_object fflush_internal (const Octave_object& args); extern Octave_object fgets_internal (const Octave_object& args, int nargout); extern Octave_object fopen_internal (const Octave_object& args); extern Octave_object fread_internal (const Octave_object& args, int nargout); extern Octave_object freport_internal (void); extern Octave_object frewind_internal (const Octave_object& args); extern Octave_object fseek_internal (const Octave_object& args); extern Octave_object ftell_internal (const Octave_object& args); extern Octave_object fwrite_internal (const Octave_object& args, int nargout); extern void initialize_file_io (void); extern void close_files (void); extern Octave_object do_printf (const char *type, const Octave_object& args, int nargout); extern Octave_object do_scanf (const char *type, const Octave_object& args, int nargout); class file_info { public: file_info (void); file_info (int num, const char *nm, FILE *t, const char *md); file_info (const file_info& f); file_info& operator = (const file_info& f); ~file_info (void); int number (void) const; const char *name (void) const; FILE *fptr (void) const; const char *mode (void) const; int eof (void) const; int error (void) const; private: int file_number; char *file_name; FILE *file_fptr; char *file_mode; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/fnmatch.h100666 415 17 2610 5702416111 13513 0ustar jweusers/* Copyright (C) 1991 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _FNMATCH_H #define _FNMATCH_H 1 /* Bits set in the FLAGS argument to `fnmatch'. */ #define FNM_PATHNAME (1 << 0)/* No wildcard can ever match `/'. */ #define FNM_NOESCAPE (1 << 1)/* Backslashes don't quote special chars. */ #define FNM_PERIOD (1 << 2)/* Leading `.' is matched only explicitly. */ #define __FNM_FLAGS (FNM_PATHNAME|FNM_NOESCAPE|FNM_PERIOD) /* Value returned by `fnmatch' if STRING does not match PATTERN. */ #define FNM_NOMATCH 1 /* Match STRING against the filename pattern PATTERN, returning zero if it matches, FNM_NOMATCH if not. */ extern int fnmatch(); #endif /* fnmatch.h */ octave-1.1.0/src/getopt.h100666 415 17 10474 5702416111 13424 0ustar jweusers/* Declarations for getopt. Copyright (C) 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc. 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, 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, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifndef _GETOPT_H #define _GETOPT_H 1 #ifdef __cplusplus extern "C" { #endif /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ extern char *optarg; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ extern int optind; /* Callers store zero here to inhibit the error message `getopt' prints for unrecognized options. */ extern int opterr; /* Set to an option character which was unrecognized. */ extern int optopt; /* Describe the long-named options requested by the application. The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector of `struct option' terminated by an element containing a name which is zero. The field `has_arg' is: no_argument (or 0) if the option does not take an argument, required_argument (or 1) if the option requires an argument, optional_argument (or 2) if the option takes an optional argument. If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ struct option { #if __STDC__ const char *name; #else char *name; #endif /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* Names for the values of the `has_arg' field of `struct option'. */ #define no_argument 0 #define required_argument 1 #define optional_argument 2 #if __STDC__ #if defined(__GNU_LIBRARY__) /* Many other libraries have conflicting prototypes for getopt, with differences in the consts, in stdlib.h. To avoid compilation errors, only prototype getopt for the GNU C library. */ extern int getopt (int argc, char *const *argv, const char *shortopts); #else /* not __GNU_LIBRARY__ */ extern int getopt (); #endif /* not __GNU_LIBRARY__ */ extern int getopt_long (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); extern int getopt_long_only (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind); /* Internal only. Users should not call this directly. */ extern int _getopt_internal (int argc, char *const *argv, const char *shortopts, const struct option *longopts, int *longind, int long_only); #else /* not __STDC__ */ extern int getopt (); extern int getopt_long (); extern int getopt_long_only (); extern int _getopt_internal (); #endif /* not __STDC__ */ #ifdef __cplusplus } #endif #endif /* _GETOPT_H */ octave-1.1.0/src/gripes.h100666 415 17 3621 5702416733 13401 0ustar jweusers// gripes.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_gripes_h) #define octave_gripes_h 1 class tree_constant; extern void gripe_string_invalid (void); extern void gripe_range_invalid (void); extern void gripe_nonconformant (void); extern void gripe_nonconformant (int r1, int c1, int r2, int c2); extern void gripe_empty_arg (const char *name, int is_error); extern void gripe_square_matrix_required (const char *name); extern void gripe_user_supplied_eval (const char *name); extern void gripe_user_returned_invalid (const char *name); extern void gripe_invalid_conversion (const char *from, const char *to); extern void gripe_2_or_3_dim_plot (void); extern void gripe_unrecognized_float_fmt (void); extern void gripe_unrecognized_data_fmt (const char *warn_for); extern void gripe_data_conversion (const char *from, const char *to); extern void gripe_wrong_type_arg (const char *name, const tree_constant& tc); extern void gripe_wrong_type_arg_for_unary_op (const tree_constant& op); extern void gripe_wrong_type_arg_for_binary_op (const tree_constant& op); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/help.h100666 415 17 2501 5702416732 13033 0ustar jweusers// help.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_help_h) #define octave_help_h 1 class ostrstream; typedef struct help_list { char *name; char *help; }; extern char **names (help_list *l, int& count); extern help_list *operator_help (void); extern help_list *keyword_help (void); extern int help_from_list (ostrstream& output_buf, const help_list *list, const char *string, int usage); extern void print_usage (const char *s, int just_usage = 0); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/idx-vector.h100666 415 17 5725 5702416731 14201 0ustar jweusers// idx-vector.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_idx_vector_h) #define octave_idx_vector_h 1 class ostream; class Matrix; class Range; class idx_vector { public: idx_vector (void); idx_vector (const idx_vector& a); idx_vector (const Matrix& m, int do_ftn_idx, const char *rc = 0, int z_len = 0); idx_vector (const Range& r); ~idx_vector (void); idx_vector& operator = (const idx_vector& a); operator void * () const; int capacity (void) const; int length (void) const; int elem (int n) const; int checkelem (int n) const; int operator () (int n) const; // other stuff int max (void) const; int min (void) const; int one_zero_only (void) const; int zeros_count (void) const; int ones_count (void) const; void sort (void); void sort_uniq (void); void shorten (int n); // Unsafe. Avoid at all cost. // i/o friend ostream& operator << (ostream& os, const idx_vector& a); private: int len; int one_zero; int num_zeros; int num_ones; int max_val; int min_val; int initialized; int *data; void init_state (const char *rc = 0, int z_len = 0); void convert_one_zero_to_idx (void); }; inline idx_vector::idx_vector (void) { len = 0; data = (int *) 0; num_zeros = 0; num_ones = 0; one_zero = 0; initialized = 0; } inline idx_vector::~idx_vector (void) { delete [] data; data = (int *) 0; num_zeros = 0; num_ones = 0; len = 0; one_zero = 0; initialized = 0; } inline idx_vector::operator void * () const { return initialized ? (void *) 1 : (void *) 0; } inline int idx_vector::capacity (void) const { return len; } inline int idx_vector::length (void) const { return len; } inline int idx_vector::elem (int n) const { return data[n]; } inline int idx_vector::operator () (int n) const { return checkelem (n); } inline int idx_vector::max (void) const { return max_val; } inline int idx_vector::min (void) const { return min_val; } inline int idx_vector::one_zero_only (void) const { return one_zero; } inline int idx_vector::zeros_count (void) const { return num_zeros; } inline int idx_vector::ones_count (void) const { return num_ones; } #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/input.h100666 415 17 4226 5702416730 13246 0ustar jweusers// input.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Use the GNU readline library for command line editing and hisory. #if !defined (octave_input_h) #define octave_input_h 1 #include extern int octave_read (char *buf, int max_size); extern FILE *get_input_from_file (char *name, int warn = 1); extern FILE *get_input_from_stdin (void); extern void initialize_readline (void); // Global pointer for eval(). extern const char *current_eval_string; // Nonzero means get input from current_eval_string. extern int get_input_from_eval_string; // Nonzero means we're parsing a function file. extern int reading_fcn_file; // Simple name of M-file we are reading. extern char *curr_fcn_file_name; // Nonzero means we're parsing a script file. extern int reading_script_file; // If we are reading from an M-file, this is it. extern FILE *ff_instream; // Nonzero means we are using readline. extern int using_readline; // Nonzero means commands are echoed as they are executed (-x). extern int echo_input; // Nonzero means this is an interactive shell. extern int interactive; // Nonzero means the user forced this shell to be interactive (-i). extern int forced_interactive; // Should we issue a prompt? extern int promptflag; // A line of input. extern char *current_input_line; extern "C" { char *gnu_readline (char *s); } #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/lex.h100666 415 17 5475 5702416727 12714 0ustar jweusers// lex.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_lex_h) #define octave_lex_h 1 // Arrange to get input via readline. #ifdef YY_INPUT #undef YY_INPUT #endif #define YY_INPUT(buf,result,max_size) \ if ((result = octave_read (buf, max_size)) < 0) \ YY_FATAL_ERROR ("octave_read () in flex scanner failed"); // Try to avoid crashing out completely on fatal scanner errors. #ifdef YY_FATAL_ERROR #undef YY_FATAL_ERROR #endif #define YY_FATAL_ERROR(msg) \ do \ { \ error (msg); \ jump_to_top_level (); \ } \ while (0) #define TOK_RETURN(tok) \ do \ { \ current_input_column += yyleng; \ quote_is_transpose = 0; \ cant_be_identifier = 0; \ convert_spaces_to_comma = 1; \ return (tok); \ } \ while (0) #define BIN_OP_RETURN(tok,convert) \ do \ { \ yylval.tok_val = new token (input_line_number, current_input_column); \ token_stack.push (yylval.tok_val); \ current_input_column += yyleng; \ quote_is_transpose = 0; \ cant_be_identifier = 0; \ convert_spaces_to_comma = convert; \ return (tok); \ } \ while (0) typedef struct yy_buffer_state *YY_BUFFER_STATE; // Associate a buffer with a new file to read. extern YY_BUFFER_STATE create_buffer (FILE *f); // Report the current buffer. extern YY_BUFFER_STATE current_buffer (void); // Connect to new buffer buffer. extern void switch_to_buffer (YY_BUFFER_STATE buf); // Delete a buffer. extern void delete_buffer (YY_BUFFER_STATE buf); // Restore a buffer (for unwind-prot). extern void restore_input_buffer (void *buf); // Delete a buffer (for unwind-prot). extern void delete_input_buffer (void *buf); // See if a function file has extra garbage after the end statement. extern void check_for_garbage_after_fcn_def (void); // Return transpose or start a string? extern int quote_is_transpose; // Nonzero means we thing we are looking at the beginning of a // function definition. extern int beginning_of_function; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/load-save.h100666 415 17 2361 5702416725 13764 0ustar jweusers// load-save.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_load_save_h) #define octave_load_save_h 1 class tree_constant; class ostream; extern int save_ascii_data (ostream& os, const tree_constant& t, char *name = 0, int strip_nan_and_inf = 0, int mark_as_global = 0, int precision = 0); extern int save_three_d (ostream& os, const tree_constant& t, int parametric = 0); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/mappers.h100666 415 17 5566 5702416724 13571 0ustar jweusers// mappers.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_mappers_h) #define octave_mappers_h 1 class Complex; typedef double (*d_d_Mapper)(double); typedef double (*d_c_Mapper)(const Complex&); typedef Complex (*c_c_Mapper)(const Complex&); // If can_return_complex_for_real_arg is 1, lower_limit and // upper_limit specify the range of values for which a real arg // returns a real value. Outside that range, we have to convert args // to complex, and call the complex valued function. // // If can_return_complex_for_real_arg is 0, lower_limit and // upper_limit are ignored. struct Mapper_fcn { char *name; int can_return_complex_for_real_arg; double lower_limit; double upper_limit; d_d_Mapper d_d_mapper; d_c_Mapper d_c_mapper; c_c_Mapper c_c_mapper; }; struct builtin_mapper_function { char *name; int can_return_complex_for_real_arg; double lower_limit; double upper_limit; d_d_Mapper d_d_mapper; d_c_Mapper d_c_mapper; c_c_Mapper c_c_mapper; char *help_string; }; extern double arg (double x); extern double conj (double x); extern double fix (double x); extern double imag (double x); extern double real (double x); extern double round (double x); extern double signum (double x); extern double xisnan (double x); extern double xfinite (double x); extern double xisinf (double x); extern double xisnan (const Complex& x); extern double xfinite (const Complex& x); extern double xisinf (const Complex& x); extern Complex acos (const Complex& x); extern Complex acosh (const Complex& x); extern Complex asin (const Complex& x); extern Complex asinh (const Complex& x); extern Complex atan (const Complex& x); extern Complex atanh (const Complex& x); extern Complex ceil (const Complex& x); extern Complex fix (const Complex& x); extern Complex floor (const Complex& x); extern Complex log10 (const Complex& x); extern Complex round (const Complex& x); extern Complex signum (const Complex& x); extern Complex tan (const Complex& x); extern Complex tanh (const Complex& x); extern void install_mapper_functions (void); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/missing-math.h100666 415 17 2255 5702416723 14511 0ustar jweusers/* missing-math.h -*- C -*- */ /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_missing_math_h) #define octave_missing_math_h 1 // Provide declarations for these whether they are actually missing or // not, because they are not part of the standard math.h, and the // g++/libg++ installation no longer provides declarations for them. extern "C" { extern double acosh (); extern double asinh (); extern double atanh (); extern double gamma (); } #endif octave-1.1.0/src/octave.h100666 415 17 5031 5702416711 13362 0ustar jweusers// octave.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_octave_h) #define octave_octave_h 1 #include class tree_statement_list; class tree_function; // Tell g++ that clean_up_and_exit doesn't return; #ifdef __GNUG__ typedef void v_fcn_i (int); volatile v_fcn_i clean_up_and_exit; #endif extern void clean_up_and_exit (int); extern void parse_and_execute (FILE *f, int print = 0); extern void parse_and_execute (char *s, int print = 0, int verbose = 0); // argv[0] for this program. extern char *raw_prog_name; // Cleaned-up name of this program, not including path information. extern char *prog_name; // Login name for user running this program. extern char *user_name; // Name of the host we are running on. extern char *host_name; // User's home directory. extern char *home_directory; // Guess what? extern char *the_current_working_directory; // Load path specified on command line. extern char *load_path; // Name of the info file specified on command line. extern char *info_file; // Name of the editor to be invoked by the edit_history command. extern char *editor; // If nonzero, don't do fancy line editing. extern int no_line_editing; // If nonzero, print verbose info in some cases. extern int verbose_flag; // Command number, counting from the beginning of this session. extern int current_command_number; // Nonzero means we are exiting via the builtin exit or quit functions. extern int quitting_gracefully; // Current command to execute. extern tree_statement_list *global_command; // Pointer to function that is currently being evaluated. extern tree_function *curr_function; // Nonzero means input is coming from startup file. extern int input_from_startup_file; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/octave-hist.h100666 415 17 2630 5702416712 14332 0ustar jweusers// octave-hist.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_octave_hist_h) #define octave_octave_hist_h 1 extern void initialize_history (void); extern void clean_up_history (void); extern void maybe_save_history (char*); extern void do_history (int, char**); extern void do_edit_history (int, char**); extern void do_run_history (int, char**); extern int current_history_number (void); // Nonzero means input is coming from temporary history file. extern int input_from_tmp_history_file; // Nonzero means we are saving history lines. extern int saving_history; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/oct-map.h100666 415 17 2553 5702416721 13450 0ustar jweusers// oct-map.h -*- C -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_oct_map_h) #define octave_oct_map_h 1 #include "Map.h" #include "tree-const.h" class Octave_map : public CHMap { public: Octave_map (void) : CHMap (tree_constant ()) { } Octave_map (const char *key, const tree_constant& value) : CHMap (tree_constant ()) { CHMap::operator [] (key) = value; } Octave_map (const Octave_map& m) : CHMap (m) { } ~Octave_map (void) { } }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/oct-obj.h100666 415 17 5631 5702416714 13447 0ustar jweusers// oct-obj.h -*- C -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_oct_obj_h) #define octave_oct_obj_h 1 #include "Array.h" #include "mx-base.h" class tree_constant; class Matrix; class RowVector; class ColumnVector; class DiagMatrix; class ComplexMatrix; class ComplexRowVector; class ComplexColumnVector; class ComplexDiagMatrix; class Range; class Octave_object : public Array { public: Octave_object (void) : Array () { } Octave_object (int n, const tree_constant& val) : Array (n, val) { } Octave_object (const tree_constant& tc) : Array (1, tc) { } Octave_object (double d); Octave_object (const Matrix& m); Octave_object (const DiagMatrix& d); Octave_object (const RowVector& v, int pcv = -1); Octave_object (const ColumnVector& v, int pcv = -1); Octave_object (const Complex& c); Octave_object (const ComplexMatrix& m); Octave_object (const ComplexDiagMatrix& d); Octave_object (const ComplexRowVector& v, int pcv = -1); Octave_object (const ComplexColumnVector& v, int pcv = -1); Octave_object (const char *s); Octave_object (double base, double limit, double inc); Octave_object (const Range& r); Octave_object (const Octave_object& obj) : Array (obj) { } Octave_object& operator = (const Octave_object& obj) { Array::operator = (obj); return *this; } // Assignment will resize on range errors. tree_constant& operator () (int n); tree_constant operator () (int n) const; private: // This constructor is private with no definition to keep statements // like // // Octave_object foo = 5; // Octave_object foo = 5.0; // // from doing different things. Instead, you have to use the // constructor // // Octave_object (n, val); // // and supply a default value to create a vector-valued Octave_object. Octave_object (int n); void maybe_resize (int n); tree_constant& elem (int n); tree_constant& checkelem (int n); tree_constant& xelem (int n); tree_constant elem (int n) const; tree_constant checkelem (int n) const; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/pager.h100666 415 17 2433 5702416711 13202 0ustar jweusers// pager.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_pager_h) #define octave_pager_h 1 class ostrstream; extern char *get_pager (void); extern int terminal_columns (void); extern int terminal_rows (void); extern void initialize_pager (void); extern void maybe_page_output (ostrstream& msg_buf); extern void flush_output_to_pager (void); extern void close_diary_file (void); extern void maybe_write_to_diary_file (const char *s); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/parse.h100666 415 17 5666 5702416710 13230 0ustar jweusers// parse.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_parse_h) #define octave_parse_h 1 #include "SLStack.h" extern void discard_until (char c); extern void reset_parser (void); extern int yylex (void); extern int yyparse (void); class tree; class tree_matrix; class tree_identifier; class symbol_table; // Nonzero means we're in the middle of defining a function. extern int defining_func; // Nonzero means we're in the middle of defining a loop. extern int looping; // Nonzero means we're in the middle of defining a conditional expression. extern int iffing; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. extern int maybe_screwed; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. extern int maybe_screwed_again; // Temporary symbol table pointer used to cope with bogus function syntax. extern symbol_table *tmp_local_sym_tab; // Stack to hold list of literal matrices. extern SLStack ml; // A nonzero element corresponding to an element of ml means we just // started reading a new matrix. This should probably be part of a // new struct for matrix lists... extern SLStack mlnm; // Nonzero means print parser debugging info (-d). extern int yydebug; // The current input line number. extern int input_line_number; // The column of the current token. extern int current_input_column; // Buffer for help text snagged from function files. extern char *help_buf; // Nonzero means we're working on a plot command. extern int plotting; // Nonzero means we've seen something that means we must be past the // range part of a plot command. extern int past_plot_range; // Nonzero means we're looking at the range part of a plot command. extern int in_plot_range; // Nonzero means we're looking at the using part of a plot command. extern int in_plot_using; // Nonzero means we're looking at the style part of a plot command. extern int in_plot_style; // Nonzero means we're looking at an indirect reference to a structure // element. extern int looking_at_indirect_ref; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/pr-output.h100666 415 17 3117 5702416707 14070 0ustar jweusers// pr-output.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_pr_output_h) #define octave_pr_output_h 1 class ostream; class Matrix; class Complex; class ComplexMatrix; class Range; extern void octave_print_internal (ostream& os, double d, int pr_as_read_syntax = 0); extern void octave_print_internal (ostream& os, const Matrix& m, int pr_as_read_syntax = 0); extern void octave_print_internal (ostream& os, const Complex& c, int pr_as_read_syntax = 0); extern void octave_print_internal (ostream& os, const ComplexMatrix& cm, int pr_as_read_syntax = 0); extern void octave_print_internal (ostream& os, const Range& r, int pr_as_read_syntax = 0); extern void set_format_style (int argc, char **argv); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/procstream.h100666 415 17 3554 5702416706 14274 0ustar jweusers// procstream.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_procstream_h) #define octave_procstream_h 1 #include #include class procstreambase : virtual public ios { public: procstreambase (void); procstreambase (const char *command, int mode = ios::out); procbuf *rdbuf (void) const { return (procbuf *) _strbuf; } void open (const char *command, int mode = ios::out); int is_open (void) { return rdbuf()->is_open (); } int close (void); }; class iprocstream : public procstreambase, public istream { public: iprocstream (void) : procstreambase () {} iprocstream (const char *command) : procstreambase (command, ios::in) {} void open (const char *command) { procstreambase::open (command, ios::in); } }; class oprocstream : public procstreambase, public ostream { public: oprocstream (void) : procstreambase () {} oprocstream (const char *command) : procstreambase (command, ios::out) {} void open (const char *command) { procstreambase::open (command, ios::out); } }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/sighandlers.h100666 415 17 3112 5702416706 14406 0ustar jweusers// sighandlers.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // This file should always be included after config.h! #if !defined (octave_sighandlers_h) #define octave_sighandlers_h 1 // Signal handler return type. #ifndef RETSIGTYPE #define RETSIGTYPE void #endif #ifndef BADSIG #define BADSIG (RETSIGTYPE (*)(int))-1 #endif typedef RETSIGTYPE sig_handler (int); // Nonzero means we have already printed a message for this series of // SIGPIPES. We assume that the writer will eventually give up. extern int pipe_handler_error_count; // Nonzero means we can be interrupted. extern int can_interrupt; extern void install_signal_handlers (void); // This is taken directly from Emacs 19: #ifndef SYS_SIGLIST_DECLARED extern char *sys_siglist[]; #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/statdefs.h100666 415 17 4055 5702416705 13726 0ustar jweusers// statdefs.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_statdefs_h) #define octave_statdefs_h 1 #include #include #ifndef S_ISREG /* Doesn't have POSIX.1 stat stuff. */ #define mode_t unsigned short #endif #if !defined(S_ISBLK) && defined(S_IFBLK) #define S_ISBLK(m) (((m) & S_IFMT) == S_IFBLK) #endif #if !defined(S_ISCHR) && defined(S_IFCHR) #define S_ISCHR(m) (((m) & S_IFMT) == S_IFCHR) #endif #if !defined(S_ISDIR) && defined(S_IFDIR) #define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) #endif #if !defined(S_ISREG) && defined(S_IFREG) #define S_ISREG(m) (((m) & S_IFMT) == S_IFREG) #endif #if !defined(S_ISFIFO) && defined(S_IFIFO) #define S_ISFIFO(m) (((m) & S_IFMT) == S_IFIFO) #endif #if !defined(S_ISLNK) && defined(S_IFLNK) #define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK) #endif #if !defined(S_ISSOCK) && defined(S_IFSOCK) #define S_ISSOCK(m) (((m) & S_IFMT) == S_IFSOCK) #endif #if !defined(S_ISMPB) && defined(S_IFMPB) /* V7 */ #define S_ISMPB(m) (((m) & S_IFMT) == S_IFMPB) #define S_ISMPC(m) (((m) & S_IFMT) == S_IFMPC) #endif #if !defined(S_ISNWK) && defined(S_IFNWK) /* HP/UX */ #define S_ISNWK(m) (((m) & S_IFMT) == S_IFNWK) #endif #ifndef S_ISLNK #define lstat stat #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/symtab.h100666 415 17 16243 5702416705 13432 0ustar jweusers// symtab.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_symtab_h) #define octave_symtab_h 1 #include "SLStack.h" #include "variables.h" class ostream; // Must be multiple of 2. #define HASH_TABLE_SIZE 1024 #define HASH_MASK (HASH_TABLE_SIZE - 1) class tree; class tree_fvc; class tree_builtin; class tree_constant; class tree_function; class symbol_def; class symbol_record; class symbol_record_info; class symbol_table; // Variables or functions. class symbol_def { friend class symbol_record; friend class symbol_record_info; public: symbol_def (void); symbol_def (tree_constant *t); symbol_def (tree_builtin *t, unsigned fcn_type = 0); symbol_def (tree_function *t, unsigned fcn_type = 0); ~symbol_def (void); int is_variable (void) const; int is_function (void) const; int is_text_function (void) const; int is_mapper_function (void) const; int is_user_variable (void) const; int is_user_function (void) const; int is_builtin_variable (void) const; int is_builtin_function (void) const; void define (tree_constant *t); void define (tree_builtin *t, unsigned fcn_type = 0); void define (tree_function *t, unsigned fcn_type = 0); void protect (void); void unprotect (void); void make_eternal (void); tree_fvc *def (void) const; char *help (void) const; void document (const char *h); enum TYPE { UNKNOWN = 0, USER_FUNCTION = 1, USER_VARIABLE = 2, BUILTIN_FUNCTION = 4, TEXT_FUNCTION = 8, MAPPER_FUNCTION = 16, BUILTIN_VARIABLE = 32 }; friend maybe_delete (symbol_def *def); private: unsigned type : 6; unsigned eternal : 1; unsigned read_only : 1; char *help_string; tree_fvc *definition; symbol_def *next_elem; int count; void init_state (void); symbol_def (const symbol_def& sd); symbol_def& operator = (const symbol_def& sd); }; // Individual records in a symbol table. class symbol_record { friend class symbol_record_info; public: symbol_record (void); symbol_record (const char *n, symbol_record *nxt = 0); ~symbol_record (void); char *name (void) const; char *help (void) const; tree_fvc *def (void) const; void rename (const char *new_name); int is_function (void) const; int is_user_function (void) const; int is_text_function (void) const; int is_mapper_function (void) const; int is_builtin_function (void) const; int is_variable (void) const; int is_user_variable (void) const; int is_builtin_variable (void) const; unsigned type (void) const; int is_defined (void) const; int is_read_only (void) const; int is_eternal (void) const; void protect (void); void unprotect (void); void make_eternal (void); void set_sv_function (sv_Function f); int define (tree_constant *t); int define (tree_builtin *t, int text_fcn = 0); int define (tree_function *t, int text_fcn = 0); int define_as_fcn (tree_constant *t); int define_builtin_var (tree_constant *t); void document (const char *h); int clear (void); void alias (symbol_record *s, int force = 0); void mark_as_formal_parameter (void); int is_formal_parameter (void) const; void mark_as_linked_to_global (void); int is_linked_to_global (void) const; symbol_record *next (void) const; void chain (symbol_record *s); void push_context (void); void pop_context (void); private: unsigned formal_param : 1; unsigned linked_to_global : 1; char *nm; sv_Function sv_fcn; symbol_def *definition; symbol_record *next_elem; // This should maybe be one stack with a structure containing all the // items we need to save for recursive calls... SLStack context; SLStack global_link_context; void init_state (void); int read_only_error (void); void push_def (symbol_def *sd); symbol_def *pop_def (void); symbol_record& operator = (const symbol_record& s); }; // A structure for handling verbose information about a symbol_record. class symbol_record_info { public: symbol_record_info (void); symbol_record_info (const symbol_record& s); symbol_record_info (const symbol_record_info& s); ~symbol_record_info (void); symbol_record_info& operator = (const symbol_record_info& s); int is_defined (void) const; int is_read_only (void) const; int is_eternal (void) const; int hides_fcn (void) const; int hides_builtin (void) const; char *type_as_string (void) const; int is_function (void) const; int rows (void) const; int columns (void) const; char *name (void) const; enum HIDES { SR_INFO_NONE = 0, SR_INFO_USER_FUNCTION = 1, SR_INFO_BUILTIN_FUNCTION = 2 }; enum CONST_TYPE { SR_INFO_UNKNOWN = 0, SR_INFO_SCALAR = 1, SR_INFO_COMPLEX_SCALAR = 2, SR_INFO_MATRIX = 4, SR_INFO_COMPLEX_MATRIX = 8, SR_INFO_RANGE = 16, SR_INFO_STRING = 32 }; private: void init_state (void); unsigned type : 4; unsigned const_type : 6; unsigned hides : 2; unsigned eternal : 1; unsigned read_only : 1; int nr; int nc; char *nm; int initialized; }; // A symbol table. #define SYMTAB_LOCAL_SCOPE 1 #define SYMTAB_GLOBAL_SCOPE 2 #define SYMTAB_ALL_SCOPES (SYMTAB_LOCAL_SCOPE | SYMTAB_GLOBAL_SCOPE) #define SYMTAB_ALL_TYPES (symbol_def::USER_FUNCTION \ | symbol_def::USER_VARIABLE \ | symbol_def::BUILTIN_FUNCTION \ | symbol_def::TEXT_FUNCTION \ | symbol_def::MAPPER_FUNCTION \ | symbol_def::BUILTIN_VARIABLE) class symbol_table { public: symbol_table (void); symbol_record *lookup (const char *nm, int insert = 0, int warn = 0); void rename (const char *old_name, const char *new_name); void clear (int clear_user_functions = 1); int clear (const char *nm, int clear_user_functions = 1); int size (void) const; symbol_record_info *long_list (int& count, char **pats = 0, int npats = 0, int sort = 0, unsigned type = SYMTAB_ALL_TYPES, unsigned scope = SYMTAB_ALL_SCOPES) const; char **list (int& count, char **pats = 0, int npats = 0, int sort = 0, unsigned type = SYMTAB_ALL_TYPES, unsigned scope = SYMTAB_ALL_SCOPES) const; symbol_record **glob (int& count, char *pat = "*", unsigned type = SYMTAB_ALL_TYPES, unsigned scope = SYMTAB_ALL_SCOPES) const; void push_context (void); void pop_context (void); private: unsigned int hash (const char *s); symbol_record table[HASH_TABLE_SIZE]; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/sysdep.h100666 415 17 2275 5702416704 13421 0ustar jweusers// sysdep.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_sysdep_h) #define octave_sysdep_h 1 extern void sysdep_init (void); extern void raw_mode (int); extern int kbhit (void); extern "C" { extern int gethostname (); } // Octave's idea of infinity. extern double octave_Inf; // Octave's idea of not a number. extern double octave_NaN; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/systime.h100666 415 17 2143 5702416703 13600 0ustar jweusers// systime.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_systime_h) #define octave_systime_h 1 #ifdef TIME_WITH_SYS_TIME #include #include #else #ifdef HAVE_SYS_TIME_H #include #else #include #endif #endif #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/token.h100666 415 17 4120 5702416700 13215 0ustar jweusers// token.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_token_h) #define octave_token_h 1 class symbol_record; class token { public: enum token_type { generic_token, string_token, double_token, ettype_token, pttype_token, sym_rec_token, }; enum end_tok_type { simple_end, for_end, function_end, if_end, while_end, unwind_protect_end, }; enum plot_tok_type { replot = 1, two_dee = 2, three_dee = 3, }; token (int l = -1, int c = -1); token (char *s, int l = -1, int c = -1); token (double d, char *s = 0, int l = -1, int c = -1); token (end_tok_type t, int l = -1, int c = -1); token (plot_tok_type t, int l = -1, int c = -1); token (symbol_record *s, int l = -1, int c = -1); ~token (void); int line (void); int column (void); char *string (void); double number (void); end_tok_type ettype (void); plot_tok_type pttype (void); symbol_record *sym_rec (void); char *text_rep (void); private: int line_num; int column_num; token_type type_tag; union { char *str; double num; end_tok_type et; plot_tok_type pt; symbol_record *sr; }; char *orig_text; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-base.h100666 415 17 3571 5702416700 13755 0ustar jweusers// tree-base.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_base_h) #define octave_tree_base_h 1 class ostream; // How to print the code that the trees represent. class tree_print_code { public: virtual ~tree_print_code (void) { } virtual void print_code (ostream& os) = 0; void reset_indent_level (void) { curr_print_indent_level = 0; } void increment_indent_level (void) { curr_print_indent_level += 2; } void decrement_indent_level (void) { curr_print_indent_level -= 2; } void print_code_new_line (ostream& os); void print_code_indent (ostream& os); void print_code_reset (void); private: static int curr_print_indent_level; static int beginning_of_line; }; // Base class for the parse tree. class tree : public tree_print_code { public: tree (int l = -1, int c = -1) { line_num = l; column_num = c; } virtual int line (void) const { return line_num; } virtual int column (void) const { return column_num; } private: int line_num; int column_num; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-cmd.h100666 415 17 12200 5702416677 13630 0ustar jweusers// tree-cmd.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_cmd_h) #define octave_tree_cmd_h 1 #include class tree_statement_list; class tree_global_init_list; class tree_if_command_list; class tree_expression; class tree_index_expression; class tree_constant; class symbol_record; class tree_command; class tree_global_command; class tree_while_command; class tree_for_command; class tree_if_command; class tree_unwind_protect_command; class tree_break_command; class tree_continue_command; class tree_return_command; #include "tree-base.h" // A base class for commands. class tree_command : public tree { public: tree_command (int l = -1, int c = -1) : tree (l, c) { } virtual void eval (void) = 0; }; class tree_global_command : public tree_command { public: tree_global_command (int l = -1, int c = -1) : tree_command (l, c) { init_list = 0; } tree_global_command (tree_global_init_list *t, int l = -1, int c = -1) : tree_command (l, c) { init_list = t; } ~tree_global_command (void); void eval (void); void print_code (ostream& os); private: tree_global_init_list *init_list; }; // While. class tree_while_command : public tree_command { public: tree_while_command (int l = -1, int c = -1) : tree_command (l, c) { expr = 0; list = 0; } tree_while_command (tree_expression *e, int l = -1, int c = -1) : tree_command (l, c) { expr = e; list = 0; } tree_while_command (tree_expression *e, tree_statement_list *lst, int l = -1, int c = -1) : tree_command (l, c) { expr = e; list = lst; } ~tree_while_command (void); void eval (void); void eval_error (void); void print_code (ostream& os); private: tree_expression *expr; // Expression to test. tree_statement_list *list; // List of commands to execute. }; // For. class tree_for_command : public tree_command { public: tree_for_command (int l = -1, int c = -1) : tree_command (l, c) { id = 0; expr = 0; list = 0; } tree_for_command (tree_index_expression *ident, tree_expression *e, tree_statement_list *lst, int l = -1, int c = -1) : tree_command (l, c) { id = ident; expr = e; list = lst; } ~tree_for_command (void); void eval (void); void eval_error (void); void print_code (ostream& os); private: void do_for_loop_once (tree_constant *rhs, int& quit); tree_index_expression *id; // Identifier to modify. tree_expression *expr; // Expression to evaluate. tree_statement_list *list; // List of commands to execute. }; // If. class tree_if_command : public tree_command { public: tree_if_command (int l = -1, int c = -1) : tree_command (l, c) { list = 0; } tree_if_command (tree_if_command_list *lst, int l = -1, int c = -1) : tree_command (l, c) { list = lst; } ~tree_if_command (void); void eval (void); void eval_error (void); void print_code (ostream& os); private: tree_if_command_list *list; }; // Simple exception handling. class tree_unwind_protect_command : public tree_command { public: tree_unwind_protect_command (int l = -1, int c = -1) : tree_command (l, c) { unwind_protect_code = 0; cleanup_code = 0; } tree_unwind_protect_command (tree_statement_list *tc, tree_statement_list *cc, int l = -1, int c = -1) : tree_command (l, c) { unwind_protect_code = tc; cleanup_code = cc; } ~tree_unwind_protect_command (void); void eval (void); void print_code (ostream& os); private: tree_statement_list *unwind_protect_code; tree_statement_list *cleanup_code; }; // Break. class tree_break_command : public tree_command { public: tree_break_command (int l = -1, int c = -1) : tree_command (l, c) { } ~tree_break_command (void) { } void eval (void); void print_code (ostream& os); }; // Continue. class tree_continue_command : public tree_command { public: tree_continue_command (int l = -1, int c = -1) : tree_command (l, c) { } ~tree_continue_command (void) { } void eval (void); void print_code (ostream& os); }; // Return. class tree_return_command : public tree_command { public: tree_return_command (int l = -1, int c = -1) : tree_command (l, c) { } ~tree_return_command (void) { } void eval (void); void print_code (ostream& os); }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-const.h100666 415 17 27312 5702416676 14224 0ustar jweusers// tree-const.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_const_h) #define octave_tree_const_h 1 #include #include #include "mx-base.h" #include "Range.h" #include "tree-base.h" #include "tree-expr.h" #include "oct-obj.h" class idx_vector; class Octave_map; struct Mapper_fcn; // Constants. class tree_constant : public tree_fvc { private: #include "tc-rep.h" // The real representation of a constant, declared in tc-rep.h tree_constant_rep *rep; public: enum magic_colon { magic_colon_t }; enum all_va_args { all_va_args_t }; // Constructors. It is possible to create the following types of // constants: // // constant type constructor arguments // ------------- --------------------- // unknown none // real scalar double // real matrix Matrix // DiagMatrix // RowVector // ColumnVector // complex scalar Complex // complex matrix ComplexMatrix // ComplexDiagMatrix // ComplexRowVector // ComplexColumnVector // string char* (null terminated) // range double, double, dobule // Range // magic colon tree_constant::magic_colon // all_va_args tree_constant::all_va_args tree_constant (void) : tree_fvc () { rep = new tree_constant_rep (); rep->count = 1; } tree_constant (double d) : tree_fvc () { rep = new tree_constant_rep (d); rep->count = 1; } tree_constant (const Matrix& m) : tree_fvc () { rep = new tree_constant_rep (m); rep->count = 1; } tree_constant (const DiagMatrix& d) : tree_fvc () { rep = new tree_constant_rep (d); rep->count = 1; } tree_constant (const RowVector& v, int pcv = -1) : tree_fvc () { rep = new tree_constant_rep (v, pcv); rep->count = 1; } tree_constant (const ColumnVector& v, int pcv = -1) : tree_fvc () { rep = new tree_constant_rep (v, pcv); rep->count = 1; } tree_constant (const Complex& c) : tree_fvc () { rep = new tree_constant_rep (c); rep->count = 1; } tree_constant (const ComplexMatrix& m) : tree_fvc () { rep = new tree_constant_rep (m); rep->count = 1; } tree_constant (const ComplexDiagMatrix& d) : tree_fvc () { rep = new tree_constant_rep (d); rep->count = 1; } tree_constant (const ComplexRowVector& v, int pcv = -1) : tree_fvc () { rep = new tree_constant_rep (v, pcv); rep->count = 1; } tree_constant (const ComplexColumnVector& v, int pcv = -1) : tree_fvc () { rep = new tree_constant_rep (v, pcv); rep->count = 1; } tree_constant (const char *s) : tree_fvc () { rep = new tree_constant_rep (s); rep->count = 1; } tree_constant (double base, double limit, double inc) : tree_fvc () { rep = new tree_constant_rep (base, limit, inc); rep->count = 1; } tree_constant (const Range& r) : tree_fvc () { rep = new tree_constant_rep (r); rep->count = 1; } tree_constant (const Octave_map& m) : tree_fvc () { rep = new tree_constant_rep (m); rep->count = 1; } tree_constant (tree_constant::magic_colon t) : tree_fvc () { tree_constant_rep::constant_type tmp; tmp = tree_constant_rep::magic_colon; rep = new tree_constant_rep (tmp); rep->count = 1; } tree_constant (tree_constant::all_va_args t) : tree_fvc () { tree_constant_rep::constant_type tmp; tmp = tree_constant_rep::all_va_args; rep = new tree_constant_rep (tmp); rep->count = 1; } // Copy constructor. tree_constant (const tree_constant& a) : tree_fvc () { rep = a.rep; rep->count++; } // Delete the representation of this constant if the count drops to // zero. ~tree_constant (void); #if defined (MDEBUG) void *operator new (size_t size); void operator delete (void *p, size_t size); #endif // Simple assignment. tree_constant operator = (const tree_constant& a); // Indexed assignment. tree_constant assign (tree_constant& rhs, const Octave_object& args) { if (rep->count > 1) { --rep->count; rep = new tree_constant_rep (*rep); rep->count = 1; } rep->assign (rhs, args); return *this; } // Simple structure assignment. tree_constant assign_map_element (SLList& list, tree_constant& rhs); // Indexed structure assignment. tree_constant assign_map_element (SLList& list, tree_constant& rhs, const Octave_object& args); // Type. It would be nice to eliminate the need for this. int is_constant (void) const { return 1; } // Size. int rows (void) const { return rep->rows (); } int columns (void) const { return rep->columns (); } // Does this constant have a type? Both of these are provided since // it is sometimes more natural to write is_undefined() instead of // ! is_defined(). int is_defined (void) const { return rep->is_defined (); } int is_undefined (void) const { return rep->is_undefined (); } // What type is this constant? int is_unknown (void) const { return rep->is_unknown (); } int is_real_scalar (void) const { return rep->is_real_scalar (); } int is_real_matrix (void) const { return rep->is_real_matrix (); } int is_complex_scalar (void) const { return rep->is_complex_scalar (); } int is_complex_matrix (void) const { return rep->is_complex_matrix (); } int is_string (void) const { return rep->is_string (); } int is_range (void) const { return rep->is_range (); } int is_map (void) const { return rep->is_map (); } int is_magic_colon (void) const { return rep->is_magic_colon (); } int is_all_va_args (void) const { return rep->is_all_va_args (); } // Are any or all of the elements in this constant nonzero? tree_constant all (void) const { return rep->all (); } tree_constant any (void) const { return rep->any (); } int is_real_type (void) const { return rep->is_real_type (); } int is_complex_type (void) const { return rep->is_complex_type (); } // Would be nice to get rid of the next four functions: int is_scalar_type (void) const { return rep->is_scalar_type (); } int is_matrix_type (void) const { return rep->is_matrix_type (); } int is_numeric_type (void) const { return rep->is_numeric_type (); } int is_numeric_or_range_type (void) const { return rep->is_numeric_or_range_type (); } // Is this constant valid as a scalar index? int valid_as_scalar_index (void) const { return rep->valid_as_scalar_index (); } // Does this constant correspond to a truth value? int is_true (void) const { return rep->is_true (); } // Is at least one of the dimensions of this constant zero? int is_empty (void) const { return ((! (is_magic_colon () || is_all_va_args () || is_unknown ())) && (rows () == 0 || columns () == 0)); } // Are the dimensions of this constant zero by zero? int is_zero_by_zero (void) const { return ((! (is_magic_colon () || is_all_va_args () || is_unknown ())) && rows () == 0 && columns () == 0); } // Values. double double_value (int force_string_conversion = 0) const { return rep->double_value (force_string_conversion); } Matrix matrix_value (int force_string_conversion = 0) const { return rep->matrix_value (force_string_conversion); } Complex complex_value (int force_string_conversion = 0) const { return rep->complex_value (force_string_conversion); } ComplexMatrix complex_matrix_value (int force_string_conversion = 0) const { return rep->complex_matrix_value (force_string_conversion); } char *string_value (void) const { return rep->string_value (); } Range range_value (void) const { return rep->range_value (); } Octave_map map_value (void) const; tree_constant lookup_map_element (SLList& list); ColumnVector vector_value (int force_string_conversion = 0, int force_vector_conversion = 0) const { return rep->vector_value (); } ComplexColumnVector complex_vector_value (int force_string_conv = 0, int force_vec_conv = 0) const { return rep->complex_vector_value (); } // Conversions. These should probably be private. If a user of this // class wants a certain kind of constant, he should simply ask for // it, and we should convert it if possible. tree_constant convert_to_str (void) { return rep->convert_to_str (); } void convert_to_row_or_column_vector (void) { rep->convert_to_row_or_column_vector (); } // Increment or decrement this constant. void bump_value (tree_expression::type et) { if (rep->count > 1) { --rep->count; rep = new tree_constant_rep (*rep); rep->count = 1; } rep->bump_value (et); } // Evaluate this constant, possibly converting complex to real, or // matrix to scalar, etc. tree_constant eval (int print) { if (! is_scalar_type ()) rep->maybe_mutate (); if (print) rep->print (); return *this; } Octave_object eval (int print, int nargout, const Octave_object& args) { Octave_object retval; // XXX FIXME XXX -- make it safe to call do_index() with // args.length () == 0 if (args.length () > 0) retval(0) = rep->do_index (args); else retval(0) = *this; if (retval(0).is_defined ()) retval(0).eval (print); return retval; } // Store the original text corresponding to this constant for later // pretty printing. void stash_original_text (char *s) { rep->stash_original_text (s); } // Pretty print this constant. void print_code (ostream& os); char *type_as_string (void) const { return rep->type_as_string (); } // We really do need this, and it should be private: private: void make_unique (void); tree_constant_rep *make_unique_map (void); public: // ------------------------------------------------------------------- // We want to eliminate this, or at least make it private. tree_constant_rep::constant_type const_type (void) const { return rep->const_type (); } private: // Can we make these go away? // These need better names, since a range really is a numeric type. void force_numeric (int force_str_conv = 0) { rep->force_numeric (force_str_conv); } tree_constant make_numeric (int force_str_conv = 0) const { if (is_numeric_type ()) return *this; else return rep->make_numeric (force_str_conv); } #if 0 tree_constant make_numeric_or_range (void) const { if (is_numeric_type () || is_range ()) return *this; else return rep->make_numeric (); } #endif tree_constant make_numeric_or_magic (void) const { if (is_numeric_type () || is_all_va_args () || is_magic_colon ()) return *this; else return rep->make_numeric (); } tree_constant make_numeric_or_range_or_magic (void) const { if (is_numeric_type () || is_range () || is_all_va_args () || is_magic_colon ()) return *this; else return rep->make_numeric (); } }; // XXX FIXME XXX -- this is not used very much now. Perhaps it can be // eliminated. extern Octave_object vector_of_empties (int nargout, const char *fcn_name); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-expr.h100666 415 17 43703 5702416676 14056 0ustar jweusers// tree-expr.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_expr_h) #define octave_tree_expr_h 1 #include #include #include #include "SLList.h" #include "variables.h" #include "mappers.h" #include "error.h" #include "oct-obj.h" class tree_constant; class tree_statement_list; class tree_argument_list; class tree_parameter_list; class tree_return_list; class tree_va_return_list; class symbol_record; class symbol_table; class tree_matrix; class tree_builtin; class tree_identifier; class tree_indirect_ref; class tree_function; class tree_expression; class tree_prefix_expression; class tree_postfix_expression; class tree_unary_expression; class tree_binary_expression; class tree_assignment_expression; class tree_simple_assignment_expression; class tree_multi_assignment_expression; class tree_colon_expression; class tree_index_expression; #include "tree-base.h" // A base class for expressions. class tree_expression : public tree { public: int in_parens; enum type { unknown, assignment, simple_assignment, multi_assignment, add, subtract, multiply, el_mul, divide, el_div, leftdiv, el_leftdiv, power, elem_pow, cmp_lt, cmp_le, cmp_eq, cmp_ge, cmp_gt, cmp_ne, and_and, or_or, and, or, not, unot, uminus, hermitian, transpose, colon, index, increment, decrement, }; tree_expression (int l = -1, int c = -1) : tree (l, c) { in_parens = 0; etype = unknown; } virtual ~tree_expression (void) { } virtual int is_multi_val_ret_expression (void) const { return 0; } virtual int is_identifier (void) const { return 0; } virtual int is_indirect_ref (void) const { return 0; } virtual int is_index_expression (void) const { return 0; } virtual int is_assignment_expression (void) const { return 0; } virtual int is_prefix_expression (void) const { return 0; } virtual void mark_for_possible_ans_assign (void) { panic_impossible (); } virtual tree_constant eval (int print) = 0; protected: type etype; }; // General matrices. This allows us to construct matrices from // other matrices, variables, and functions. class tree_matrix : public tree_expression { public: enum dir { md_none, md_right, md_down, }; tree_matrix (void) { direction = tree_matrix::md_none; element = 0; next = 0; } tree_matrix (tree_expression *e, tree_matrix::dir d) { direction = d; element = e; next = 0; } ~tree_matrix (void); tree_matrix *chain (tree_expression *e, tree_matrix::dir d); tree_matrix *reverse (void); int length (void); tree_return_list *to_return_list (void); tree_constant eval (int print); void print_code (ostream& os); private: tree_matrix::dir direction; // Direction from the previous element. tree_expression *element; tree_matrix *next; }; // A base class for objects that can be return multiple values class tree_multi_val_ret : public tree_expression { public: tree_multi_val_ret (int l = -1, int c = -1) : tree_expression (l, c) { } int is_multi_val_ret_expression (void) const { return 1; } tree_constant eval (int print); virtual Octave_object eval (int print, int nargout, const Octave_object& args) = 0; }; // A base class for objects that can be evaluated with argument lists. class tree_fvc : public tree_multi_val_ret { public: tree_fvc (int l = -1, int c = -1) : tree_multi_val_ret (l, c) { } virtual int is_constant (void) const { return 0; } virtual tree_constant assign (tree_constant& t, const Octave_object& args); virtual char *name (void) const { panic_impossible (); return 0; } virtual void bump_value (tree_expression::type) { panic_impossible (); } virtual tree_constant lookup_map_element (SLList& list); virtual int max_expected_args (void) { panic_impossible (); return 0; } virtual char *fcn_file_name (void) { return 0; } virtual time_t time_parsed (void) { panic_impossible (); return 0; } virtual int is_system_fcn_file (void) const { return 0; } virtual int save (ostream& os, int mark_as_global = 0, int precision = 17) { panic_impossible (); return 0; } }; // Symbols from the symbol table. class tree_identifier : public tree_fvc { friend class tree_index_expression; public: tree_identifier (int l = -1, int c = -1) : tree_fvc (l, c) { sym = 0; maybe_do_ans_assign = 0; } tree_identifier (symbol_record *s, int l = -1, int c = -1) : tree_fvc (l, c) { sym = s; maybe_do_ans_assign = 0; } int is_identifier (void) const { return 1; } char *name (void) const; tree_identifier *define (tree_constant *t); tree_identifier *define (tree_function *t); void document (char *s); tree_constant assign (tree_constant& t); tree_constant assign (tree_constant& t, const Octave_object& args); tree_constant assign (SLList list, tree_constant& t); tree_constant assign (SLList list, tree_constant& t, const Octave_object& args); int is_defined (void); void bump_value (tree_expression::type); tree_fvc *do_lookup (int& script_file_executed, int exec_script = 1); void link_to_global (void); void mark_as_formal_parameter (void); void mark_for_possible_ans_assign (void) { maybe_do_ans_assign = 1; } tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); void eval_undefined_error (void); void print_code (ostream& os); private: symbol_record *sym; int maybe_do_ans_assign; }; // Indirect references to values (structure references). class tree_indirect_ref : public tree_fvc { public: tree_indirect_ref (int l = -1, int c = -1) : tree_fvc (l, c) { id = 0; preserve_ident = 0; } tree_indirect_ref (tree_identifier *i, int l = -1, int c = -1) : tree_fvc (l, c) { id = i; preserve_ident = 0; } ~tree_indirect_ref (void); tree_indirect_ref *chain (const char *s); int is_indirect_ref (void) const { return 1; } int is_identifier_only (void) const { return (id && refs.empty ()); } tree_identifier *ident (void) { return id; } void preserve_identifier (void) { preserve_ident = 1; } char *name (void); tree_constant assign (tree_constant& t); tree_constant assign (tree_constant& t, const Octave_object& args); void mark_for_possible_ans_assign (void) { id->mark_for_possible_ans_assign (); } tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); void print_code (ostream& os); private: tree_identifier *id; SLList refs; int preserve_ident; }; // Index expressions. class tree_index_expression : public tree_multi_val_ret { public: tree_index_expression (int l = -1, int c = -1) : tree_multi_val_ret (l, c) { id = 0; list = 0; } tree_index_expression (tree_identifier *i, int l = -1, int c = -1) : tree_multi_val_ret (l, c) { id = new tree_indirect_ref (i); list = 0; } tree_index_expression (tree_identifier *i, tree_argument_list *lst, int l = -1, int c = -1) : tree_multi_val_ret (l, c) { id = new tree_indirect_ref (i); list = lst; } tree_index_expression (tree_indirect_ref *i, int l = -1, int c = -1) : tree_multi_val_ret (l, c) { id = i; list = 0; } tree_index_expression (tree_indirect_ref *i, tree_argument_list *lst, int l = -1, int c = -1) : tree_multi_val_ret (l, c) { id = i; list = lst; } ~tree_index_expression (void); int is_index_expression (void) const { return 1; } tree_indirect_ref *ident (void) { return id; } char *name (void) { return id->name (); } tree_argument_list *arg_list (void) { return list; } void mark_for_possible_ans_assign (void) { if (id) id->mark_for_possible_ans_assign (); } tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); void eval_error (void); void print_code (ostream& os); private: tree_indirect_ref *id; tree_argument_list *list; }; // Prefix expressions. class tree_prefix_expression : public tree_expression { public: tree_prefix_expression (int l = -1, int c = -1) : tree_expression (l, c) { id = 0; etype = unknown; } tree_prefix_expression (tree_identifier *t, tree_expression::type et, int l = -1, int c = -1) : tree_expression (l, c) { id = t; etype = et; } ~tree_prefix_expression (void) { delete id; } tree_constant eval (int print); void eval_error (void); int is_prefix_expression (void) const { return 1; } char *oper (void) const; void print_code (ostream& os); private: tree_identifier *id; }; // Postfix expressions. class tree_postfix_expression : public tree_expression { public: tree_postfix_expression (int l = -1, int c = -1) : tree_expression (l, c) { id = 0; etype = unknown; } tree_postfix_expression (tree_identifier *t, tree_expression::type et, int l = -1, int c = -1) : tree_expression (l, c) { id = t; etype = et; } ~tree_postfix_expression (void) { delete id; } tree_constant eval (int print); void eval_error (void); char *oper (void) const; void print_code (ostream& os); private: tree_identifier *id; }; // Unary expressions. class tree_unary_expression : public tree_expression { public: tree_unary_expression (int l = -1, int c = -1) : tree_expression (l, c) { etype = tree_expression::unknown; op = 0; } tree_unary_expression (tree_expression *a, tree_expression::type t, int l = -1, int c = -1) : tree_expression (l, c) { etype = t; op = a; } ~tree_unary_expression (void) { delete op; } tree_constant eval (int print); void eval_error (void); char *oper (void) const; void print_code (ostream& os); private: tree_expression *op; }; // Binary expressions. class tree_binary_expression : public tree_expression { public: tree_binary_expression (int l = -1, int c = -1) : tree_expression (l, c) { etype = tree_expression::unknown; op1 = 0; op2 = 0; } tree_binary_expression (tree_expression *a, tree_expression *b, tree_expression::type t, int l = -1, int c = -1) : tree_expression (l, c) { etype = t; op1 = a; op2 = b; } ~tree_binary_expression (void) { delete op1; delete op2; } tree_constant eval (int print); void eval_error (void); char *oper (void) const; void print_code (ostream& os); private: tree_expression *op1; tree_expression *op2; }; // Simple assignment expressions. class tree_simple_assignment_expression : public tree_expression { private: void init (int plhs, int ans_assign) { etype = tree_expression::assignment; lhs = 0; index = 0; rhs = 0; preserve = plhs; ans_ass = ans_assign; } public: tree_simple_assignment_expression (int plhs = 0, int ans_assign = 0, int l = -1, int c = -1) : tree_expression (l, c) { init (plhs, ans_assign); } tree_simple_assignment_expression (tree_identifier *i, tree_expression *r, int plhs = 0, int ans_assign = 0, int l = -1, int c = -1) : tree_expression (l, c) { init (plhs, ans_assign); lhs = new tree_indirect_ref (i); rhs = r; } tree_simple_assignment_expression (tree_indirect_ref *i, tree_expression *r, int plhs = 0, int ans_assign = 0, int l = -1, int c = -1) : tree_expression (l, c) { init (plhs, ans_assign); lhs = i; rhs = r; } tree_simple_assignment_expression (tree_index_expression *idx_expr, tree_expression *r, int plhs = 0, int ans_assign = 0, int l = -1, int c = -1) : tree_expression (l, c) { init (plhs, ans_assign); lhs = idx_expr->ident (); index = idx_expr->arg_list (); rhs = r; } ~tree_simple_assignment_expression (void); int left_hand_side_is_identifier_only (void) { return lhs->is_identifier_only (); } tree_identifier *left_hand_side_id (void) { return lhs->ident (); } int is_ans_assign (void) { return ans_ass; } tree_constant eval (int print); int is_assignment_expression (void) const { return 1; } void eval_error (void); void print_code (ostream& os); private: tree_indirect_ref *lhs; tree_argument_list *index; tree_expression *rhs; int preserve; int ans_ass; }; // Multi-valued assignment expressions. class tree_multi_assignment_expression : public tree_multi_val_ret { public: tree_multi_assignment_expression (int l = -1, int c = -1) : tree_multi_val_ret (l, c) { etype = tree_expression::multi_assignment; lhs = 0; rhs = 0; } tree_multi_assignment_expression (tree_return_list *lst, tree_multi_val_ret *r, int l = -1, int c = -1) : tree_multi_val_ret (l, c) { etype = tree_expression::multi_assignment; lhs = lst; rhs = r; } ~tree_multi_assignment_expression (void); tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); int is_assignment_expression (void) const { return 1; } void eval_error (void); void print_code (ostream& os); private: tree_return_list *lhs; tree_multi_val_ret *rhs; }; // Colon expressions. class tree_colon_expression : public tree_expression { public: tree_colon_expression (int l = -1, int c = -1) : tree_expression (l, c) { etype = tree_expression::colon; op1 = 0; op2 = 0; op3 = 0; } tree_colon_expression (tree_expression *a, tree_expression *b, int l = -1, int c = -1) : tree_expression (l, c) { etype = tree_expression::colon; op1 = a; op2 = b; op3 = 0; } ~tree_colon_expression (void) { delete op1; delete op2; delete op3; } tree_colon_expression *chain (tree_expression *t); tree_constant eval (int print); void eval_error (const char *s); void print_code (ostream& os); private: tree_expression *op1; tree_expression *op2; tree_expression *op3; }; // Builtin functions. class tree_builtin : public tree_fvc { public: tree_builtin (const char *nm = 0); tree_builtin (int i_max, int o_max, Mapper_fcn& m_fcn, const char *nm = 0); tree_builtin (int i_max, int o_max, Octave_builtin_fcn f, const char *nm = 0); // int is_builtin (void) const; int is_mapper_function (void) const { return is_mapper; } tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); char *name (void) const { return my_name; } int max_expected_args (void); void print_code (ostream& os) { os << my_name << " can't be printed because it is a builtin function\n"; } private: int nargin_max; int nargout_max; int is_mapper; Mapper_fcn mapper_fcn; Octave_builtin_fcn fcn; char *my_name; }; // User defined functions. class tree_function : public tree_fvc { private: void init (void) { call_depth = 0; param_list = 0; ret_list = 0; sym_tab = 0; cmd_list = 0; file_name = 0; fcn_name = 0; t_parsed = 0; system_fcn_file = 0; num_named_args = 0; num_args_passed = 0; curr_va_arg_number = 0; vr_list = 0; } public: tree_function (int l = -1, int c = -1) : tree_fvc (l, c) { init (); } tree_function (tree_statement_list *cl, symbol_table *st, int l = -1, int c = -1) : tree_fvc (l, c) { init (); sym_tab = st; cmd_list = cl; } // tree_function *define (tree_statement_list *t); tree_function *define_param_list (tree_parameter_list *t); tree_function *define_ret_list (tree_parameter_list *t); void stash_fcn_file_name (void); void stash_fcn_file_time (time_t t) { t_parsed = t; } char *fcn_file_name (void) { return file_name; } time_t time_parsed (void) { return t_parsed; } void mark_as_system_fcn_file (void); int is_system_fcn_file (void) const { return system_fcn_file; } int takes_varargs (void) const; void octave_va_start (void) { curr_va_arg_number = num_named_args; } tree_constant octave_va_arg (void); Octave_object octave_all_va_args (void); int takes_var_return (void) const; void octave_vr_val (const tree_constant& val); void stash_function_name (char *s); char *function_name (void) { return fcn_name; } tree_constant eval (int print); Octave_object eval (int print, int nargout, const Octave_object& args); int max_expected_args (void); void traceback_error (void); void print_code (ostream& os); private: int call_depth; tree_parameter_list *param_list; tree_parameter_list *ret_list; symbol_table *sym_tab; tree_statement_list *cmd_list; char *file_name; char *fcn_name; time_t t_parsed; int system_fcn_file; int num_named_args; Octave_object args_passed; int num_args_passed; int curr_va_arg_number; tree_va_return_list *vr_list; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-misc.h100666 415 17 15771 5702416675 14036 0ustar jweusers// tree-misc.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_misc_h) #define octave_tree_misc_h 1 class ostream; class Octave_object; class tree_constant; class tree_command; class tree_expression; class tree_simple_assignment_expression; class tree_identifier; class symbol_record; class symbol_table; class tree_statement; class tree_statement_list; class tree_argument_list; class tree_parameter_list; class tree_return_list; class tree_va_return_list; class tree_global; class tree_global_init_list; #include #include "tree-base.h" #include "tree-expr.h" #include "tree-const.h" #include "tree-cmd.h" // A list of expressions and commands to be executed. class tree_statement : public tree_print_code { friend class tree_statement_list; public: tree_statement (void) { command = 0; expression = 0; print_flag = 1; } tree_statement (tree_command *c) { command = c; expression = 0; print_flag = 1; } tree_statement (tree_expression *e) { command = 0; expression = e; print_flag = 1; } ~tree_statement (void); void set_print_flag (int print) { print_flag = print; } void print_code (ostream& os); private: tree_command *command; // Command to execute. tree_expression *expression; // Command to execute. int print_flag; // Print result of eval for this command? }; class tree_statement_list : public SLList, public tree_print_code { public: tree_statement_list (void) : SLList () { } tree_statement_list (tree_statement *s) : SLList () { append (s); } ~tree_statement_list (void) { while (! empty ()) { tree_statement *t = remove_front (); delete t; } } tree_constant eval (int print); Octave_object eval (int print, int nargout); void print_code (ostream& os); }; // Argument lists. Used to hold the list of expressions that are the // arguments in a function call or index expression. class tree_argument_list : public SLList, public tree_print_code { public: tree_argument_list (void) : SLList () { } tree_argument_list (tree_expression *t) : SLList () { append (t); } ~tree_argument_list (void) { while (! empty ()) { tree_expression *t = remove_front (); delete t; } } Octave_object convert_to_const_vector (void); void print_code (ostream& os); }; // Parameter lists. Used to hold the list of input and output // parameters in a function definition. Elements are identifiers // only. class tree_parameter_list : public SLList, public tree_print_code { public: tree_parameter_list (void) : SLList () { marked_for_varargs = 0; } tree_parameter_list (tree_identifier *t) : SLList () { marked_for_varargs = 0; append (t); } ~tree_parameter_list (void) { while (! empty ()) { tree_identifier *t = remove_front (); delete t; } } // char *name (void) const; void mark_as_formal_parameters (void); void mark_varargs (void) { marked_for_varargs = 1; } int takes_varargs (void) const { return marked_for_varargs; } void mark_varargs_only (void) { marked_for_varargs = -1; } int varargs_only (void) { return (marked_for_varargs < 0); } void define_from_arg_vector (const Octave_object& args); int is_defined (void); Octave_object convert_to_const_vector (tree_va_return_list *vr_list); void print_code (ostream& os); private: int marked_for_varargs; }; // Return lists. Used to hold the right hand sides of multiple // assignment expressions. class tree_return_list : public SLList, public tree_print_code { public: tree_return_list (void) : SLList () { } tree_return_list (tree_index_expression *t) : SLList () { append (t); } ~tree_return_list (void) { while (! empty ()) { tree_index_expression *t = remove_front (); delete t; } } void print_code (ostream& os); }; class tree_va_return_list : public SLList { public: tree_va_return_list (void) : SLList () { } }; // List of expressions that make up a global statement. class tree_global : public tree_print_code { public: tree_global (void) { ident = 0; assign_expr = 0; } tree_global (tree_identifier *id) { ident = id; assign_expr = 0; } tree_global (tree_simple_assignment_expression *ass) { ident = 0; assign_expr = ass; } ~tree_global (void) { delete ident; delete assign_expr; } void eval (void); void print_code (ostream& os); private: tree_identifier *ident; tree_simple_assignment_expression *assign_expr; }; class tree_global_init_list : public SLList, public tree_print_code { public: tree_global_init_list (void) : SLList () { } tree_global_init_list (tree_global *t) : SLList () { append (t); } ~tree_global_init_list (void) { while (! empty ()) { tree_global *t = remove_front (); delete t; } } void eval (void); void print_code (ostream& os); }; class tree_if_clause : public tree_print_code { public: tree_if_clause (void) { expr = 0; list = 0; } tree_if_clause (tree_statement_list *l) { expr = 0; list = l; } tree_if_clause (tree_expression *e, tree_statement_list *l) { expr = e; list = l; } ~tree_if_clause (void) { delete expr; delete list; } int eval (void); void print_code (ostream& os); private: tree_expression *expr; tree_statement_list *list; }; class tree_if_command_list : public SLList, public tree_print_code { public: tree_if_command_list (void) : SLList () { } tree_if_command_list (tree_if_clause *t) : SLList () { append (t); } ~tree_if_command_list (void) { while (! empty ()) { tree_if_clause *t = remove_front (); delete t; } } void eval (void); void print_code (ostream& os); }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-plot.h100666 415 17 10676 5702416674 14057 0ustar jweusers// tree-plot.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_plot_h) #define octave_tree_plot_h 1 #include class tree_command; class tree_plot_command; class plot_limits; class plot_range; class subplot_using; class subplot_style; class subplot; class subplot_list; #include #include "dColVector.h" #include "idx-vector.h" #include "tree-cmd.h" #include "tree-expr.h" class tree_plot_command : public tree_command { public: tree_plot_command (void); tree_plot_command (subplot_list *plt, int nd); tree_plot_command (subplot_list *plt, plot_limits *rng, int nd); ~tree_plot_command (void); void eval (void); void print_code (ostream& os); private: int ndim; plot_limits *range; subplot_list *plot_list; }; class plot_limits : public tree_print_code { public: plot_limits (void); plot_limits (plot_range *xlim); plot_limits (plot_range *xlim, plot_range *ylim); plot_limits (plot_range *xlim, plot_range *ylim, plot_range *zlim); ~plot_limits (void); void print (int print, ostrstream& plot_buf); void print_code (ostream& os); private: plot_range *x_range; plot_range *y_range; plot_range *z_range; }; class plot_range : public tree_print_code { public: plot_range (void); plot_range (tree_expression *l, tree_expression *u); ~plot_range (void); void print (ostrstream& plot_buf); void print_code (ostream& os); private: tree_expression *lower; tree_expression *upper; }; class subplot_using : public tree_print_code { public: subplot_using (void); subplot_using (tree_expression *fmt); ~subplot_using (void); subplot_using *set_format (tree_expression *fmt); subplot_using *add_qualifier (tree_expression *t); int eval (int ndim, int n_max); ColumnVector values (int ndim, int n_max = 0); int print (int ndim, int n_max, ostrstream& plot_buf); void print_code (ostream& os); private: int qualifier_count; tree_expression *x[4]; tree_expression *scanf_fmt; int have_values; ColumnVector val; }; class subplot_style : public tree_print_code { public: subplot_style (void); subplot_style (char *s); subplot_style (char *s, tree_expression *lt); subplot_style (char *s, tree_expression *lt, tree_expression *pt); ~subplot_style (void); int print (ostrstream& plot_buf); int errorbars (void); void print_code (ostream& os); private: char *style; tree_expression *linetype; tree_expression *pointtype; }; class subplot : public tree_print_code { public: subplot (void); subplot (tree_expression *data); subplot (subplot_using *u, tree_expression *t, subplot_style *s); ~subplot (void); void set_data (tree_expression *data); tree_constant extract_plot_data (int ndim, tree_constant& data); int handle_plot_data (int ndim, ostrstream& plot_buf); int print (int ndim, ostrstream& plot_buf); void print_code (ostream& os); private: tree_expression *plot_data; subplot_using *using_clause; tree_expression *title_clause; subplot_style *style_clause; }; class subplot_list : public SLList, public tree_print_code { public: subplot_list (void) : SLList () { } subplot_list (subplot *t) : SLList () { append (t); } ~subplot_list (void) { while (! empty ()) { subplot *t = remove_front (); delete t; } } int print (int ndim, ostrstream& plot_buf); void print_code (ostream& os); }; extern char *save_in_tmp_file (tree_constant& t, int ndim = 2, int parametric = 0); extern void mark_for_deletion (const char *filename); extern void cleanup_tmp_files (void); extern void close_plot_stream (void); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tc-inlines.h100666 415 17 15715 5702416702 14200 0ustar jweusers// tc-inlines.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Just a coupla more helper functions. static inline int tree_to_mat_idx (double x) { if (x > 0) return ((int) (x + 0.5) - 1); else return ((int) (x - 0.5) - 1); } static inline int range_max_check (int i, int imax) { i++; if (i > imax) { error ("matrix index = %d exceeds maximum dimension = %d", i, imax); return -1; } return 0; } static inline int range_max_check (int i, int j, int nr, int nc) { int status = 0; i++; if (i > nr) { error ("matrix row index = %d exceeds maximum row dimension = %d", i, nr); status = -1; } j++; if (j > nc) { error ("matrix column index = %d exceeds maximum column dimension = %d", j, nc); status = -1; } return status; } static inline int indexed_assign_conforms (int lhs_nr, int lhs_nc, int rhs_nr, int rhs_nc) { return (lhs_nr == rhs_nr && lhs_nc == rhs_nc); } static inline int is_one_zero (const Range& r) { double b = r.base (); double l = r.limit (); return (r.nelem () == 2 && NINT (b) == 1 && NINT (l) == 0); } static inline int is_zero_one (const Range& r) { double b = r.base (); double l = r.limit (); return (r.nelem () == 2 && NINT (b) == 0 && NINT (l) == 1); } static inline int index_check (int i, char *rc) { if (i < 0) { error ("invalid %s index = %d", rc, i+1); return -1; } return 0; } static inline int index_check (const Range& r, char *rc) { if (r.nelem () < 1) { error ("range invalid as %s index", rc); return -1; } int imin = tree_to_mat_idx (r.min ()); if (imin < 0) { error ("invalid %s index = %d", rc, imin+1); return -1; } return 0; } static inline int fortran_row (int i, int nr) { int r; r = i % nr; if (r == 0) r = nr; return r; } static inline int fortran_column (int i, int nr) { int c; int r; r = fortran_row (i, nr); c = (i - r) / nr + 1; return c; } // How about a few macros? #define TC_REP tree_constant::tree_constant_rep #ifndef MAX #define MAX(a,b) ((a) > (b) ? (a) : (b)) #endif #ifndef MIN #define MIN(a,b) ((a) < (b) ? (a) : (b)) #endif #ifndef ABS #define ABS(x) (((x) < 0) ? (-x) : (x)) #endif // The following are used by some of the functions in the // tree_constant_rep class that must deal with real and complex // matrices. This was not done with overloaded or virtual functions // from the Matrix class because there is no clean way to do that -- // the necessary functions (like elem) need to return values of // different types... // Given a tree_constant, and the names to be used for the real and // complex matrix and their dimensions, declare a real or complex // matrix, and initialize it from the tree_constant. Note that m, cm, // nr, and nc must not be previously declared, and they must not be // expressions. Since only one of the matrices will be defined after // this macro is used, only one set of dimesions is declared. // This macro only makes sense inside a friend or member function of // the tree_constant_rep class #define REP_RHS_MATRIX(tc,m,cm,nr,nc) \ int nr = 0; \ int nc = 0; \ Matrix m; \ ComplexMatrix cm; \ if ((tc).const_type () == TC_REP::complex_matrix_constant) \ { \ cm = (tc).complex_matrix_value (); \ nr = (cm).rows (); \ nc = (cm).columns (); \ } \ else if ((tc).const_type () == TC_REP::matrix_constant) \ { \ m = (tc).matrix_value (); \ nr = (m).rows (); \ nc = (m).columns (); \ } \ else \ panic_impossible (); // Assign a real or complex value to a tree_constant. // // This macro only makes sense inside a friend or member function of // the tree_constant_rep class. #define REP_ELEM_ASSIGN(i,j,rval,cval,real_type) \ do \ { \ if (type_tag == TC_REP::matrix_constant) \ { \ if (real_type) \ matrix->elem ((i), (j)) = (rval); \ else \ panic_impossible (); \ } \ else \ { \ if (real_type) \ complex_matrix->elem ((i), (j)) = (rval); \ else \ complex_matrix->elem ((i), (j)) = (cval); \ } \ } \ while (0) // Given a real and complex matrix and row and column dimensions, // declare both and size one of them. Only one of the matrices should // be used after this macro has been used. // This macro only makes sense inside a friend or member function of // the tree_constant_rep class. #define CRMATRIX(m,cm,nr,nc) \ Matrix m; \ ComplexMatrix cm; \ if (type_tag == TC_REP::matrix_constant) \ (m).resize ((nr), (nc)); \ else if (type_tag == complex_matrix_constant) \ (cm).resize ((nr), (nc)); \ else \ panic_impossible (); \ // Assign a real or complex matrix to a tree constant. // This macro only makes sense inside a friend or member function of // the tree_constant_rep class. #define ASSIGN_CRMATRIX_TO(tc,m,cm) \ do \ { \ if (type_tag == matrix_constant) \ tc = tree_constant (m); \ else \ tc = tree_constant (cm); \ } \ while (0) // Assign an element of this tree_constant_rep's real or complex // matrix to another real or complex matrix. // This macro only makes sense inside a friend or member function of // the tree_constant_rep class. #define CRMATRIX_ASSIGN_REP_ELEM(m,cm,i1,j1,i2,j2) \ do \ { \ if (type_tag == matrix_constant) \ (m).elem ((i1), (j1)) = matrix->elem ((i2), (j2)); \ else \ (cm).elem ((i1), (j1)) = complex_matrix->elem ((i2), (j2)); \ } \ while (0) // Assign a value to an element of a real or complex matrix. Assumes // that the lhs and rhs are either both real or both complex types. #define CRMATRIX_ASSIGN_ELEM(m,cm,i,j,rval,cval,real_type) \ do \ { \ if (real_type) \ (m).elem ((i), (j)) = (rval); \ else \ (cm).elem ((i), (j)) = (cval); \ } \ while (0) // One more... static inline int valid_scalar_indices (const Octave_object& args) { int nargin = args.length (); return ((nargin == 2 && args(1).valid_as_scalar_index () && args(0).valid_as_scalar_index ()) || (nargin == 1 && args(0).valid_as_scalar_index ())); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tc-rep.h100666 415 17 30256 5702416701 13321 0ustar jweusers// tc-rep.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_tree_const_rep_h) #define octave_tree_const_rep_h 1 // The actual representation of the tree_constant. class tree_constant_rep { friend class tree_constant; private: enum constant_type { unknown_constant, scalar_constant, matrix_constant, complex_scalar_constant, complex_matrix_constant, string_constant, range_constant, map_constant, magic_colon, all_va_args, }; enum force_orient { no_orient, row_orient, column_orient, }; tree_constant_rep (void); tree_constant_rep (double d); tree_constant_rep (const Matrix& m); tree_constant_rep (const DiagMatrix& d); tree_constant_rep (const RowVector& v, int pcv); tree_constant_rep (const ColumnVector& v, int pcv); tree_constant_rep (const Complex& c); tree_constant_rep (const ComplexMatrix& m); tree_constant_rep (const ComplexDiagMatrix& d); tree_constant_rep (const ComplexRowVector& v, int pcv); tree_constant_rep (const ComplexColumnVector& v, int pcv); tree_constant_rep (const char *s); tree_constant_rep (double base, double limit, double inc); tree_constant_rep (const Range& r); tree_constant_rep (const Octave_map& m); tree_constant_rep (tree_constant_rep::constant_type t); tree_constant_rep (const tree_constant_rep& t); ~tree_constant_rep (void); #if defined (MDEBUG) void *operator new (size_t size); void operator delete (void *p, size_t size); #endif int rows (void) const; int columns (void) const; int is_defined (void) const { return type_tag != tree_constant_rep::unknown_constant; } int is_undefined (void) const { return type_tag == tree_constant_rep::unknown_constant; } int is_unknown (void) const { return type_tag == tree_constant_rep::unknown_constant; } int is_real_scalar (void) const { return type_tag == tree_constant_rep::scalar_constant; } int is_real_matrix (void) const { return type_tag == tree_constant_rep::matrix_constant; } int is_complex_scalar (void) const { return type_tag == tree_constant_rep::complex_scalar_constant; } int is_complex_matrix (void) const { return type_tag == tree_constant_rep::complex_matrix_constant; } int is_string (void) const { return type_tag == tree_constant_rep::string_constant; } int is_range (void) const { return type_tag == tree_constant_rep::range_constant; } int is_map (void) const { return type_tag == tree_constant_rep::map_constant; } int is_magic_colon (void) const { return type_tag == tree_constant_rep::magic_colon; } int is_all_va_args (void) const { return type_tag == tree_constant_rep::all_va_args; } tree_constant all (void) const; tree_constant any (void) const; int is_real_type (void) const { return (type_tag == scalar_constant || type_tag == matrix_constant || type_tag == range_constant || type_tag == string_constant); } int is_complex_type (void) const { return (type_tag == complex_matrix_constant || type_tag == complex_scalar_constant); } // Would be nice to get rid of the next four functions: int is_scalar_type (void) const { return (type_tag == scalar_constant || type_tag == complex_scalar_constant); } int is_matrix_type (void) const { return (type_tag == matrix_constant || type_tag == complex_matrix_constant); } int is_numeric_type (void) const { return (type_tag == scalar_constant || type_tag == matrix_constant || type_tag == complex_matrix_constant || type_tag == complex_scalar_constant); } int is_numeric_or_range_type (void) const { return (type_tag == scalar_constant || type_tag == matrix_constant || type_tag == complex_matrix_constant || type_tag == complex_scalar_constant || type_tag == range_constant); } int valid_as_scalar_index (void) const; int is_true (void) const; double double_value (int force_string_conversion = 0) const; Matrix matrix_value (int force_string_conversion = 0) const; Complex complex_value (int force_string_conversion = 0) const; ComplexMatrix complex_matrix_value (int force_string_conversion = 0) const; char *string_value (void) const; Range range_value (void) const; Octave_map map_value (void) const; tree_constant& lookup_map_element (const char *name, int insert = 0); ColumnVector vector_value (int force_string_conversion = 0, int force_vector_conversion = 0) const; ComplexColumnVector complex_vector_value (int force_string_conv = 0, int force_vec_conv = 0) const; tree_constant convert_to_str (void) const; void convert_to_row_or_column_vector (void); void bump_value (tree_expression::type); void resize (int i, int j); void resize (int i, int j, double val); void maybe_resize (int imax, force_orient fo = no_orient); void maybe_resize (int imax, int jmax); void stash_original_text (char *s); void maybe_mutate (void); void print (void); void print_code (ostream& os); void gripe_wrong_type_arg (const char *name, const tree_constant_rep& tcr) const; char *type_as_string (void) const; // Binary and unary operations. friend tree_constant do_binary_op (tree_constant& a, tree_constant& b, tree_expression::type t); friend tree_constant do_unary_op (tree_constant& a, tree_expression::type t); // ------------------------------------------------------------------- // We want to eliminate this. constant_type const_type (void) const { return type_tag; } // We want to get rid of these too: void force_numeric (int force_str_conv = 0); tree_constant make_numeric (int force_str_conv = 0) const; // Indexing. tree_constant do_index (const Octave_object& args); tree_constant do_scalar_index (const Octave_object& args) const; tree_constant do_matrix_index (const Octave_object& args) const; tree_constant do_matrix_index (const tree_constant& i_arg) const; tree_constant do_matrix_index (const tree_constant& i_arg, const tree_constant& j_arg) const; tree_constant do_matrix_index (constant_type i) const; tree_constant fortran_style_matrix_index (const tree_constant& i_arg) const; tree_constant fortran_style_matrix_index (const Matrix& mi) const; tree_constant do_vector_index (const tree_constant& i_arg) const; tree_constant do_matrix_index (int i, const tree_constant& i_arg) const; tree_constant do_matrix_index (const idx_vector& i, const tree_constant& i_arg) const; tree_constant do_matrix_index (const Range& i, const tree_constant& i_arg) const; tree_constant do_matrix_index (constant_type i, const tree_constant& i_arg) const; tree_constant do_matrix_index (int i, int j) const; tree_constant do_matrix_index (int i, const idx_vector& j) const; tree_constant do_matrix_index (int i, const Range& j) const; tree_constant do_matrix_index (int i, constant_type cj) const; tree_constant do_matrix_index (const idx_vector& i, int j) const; tree_constant do_matrix_index (const idx_vector& i, const idx_vector& j) const; tree_constant do_matrix_index (const idx_vector& i, const Range& j) const; tree_constant do_matrix_index (const idx_vector& i, constant_type j) const; tree_constant do_matrix_index (const Range& i, int j) const; tree_constant do_matrix_index (const Range& i, const idx_vector& j) const; tree_constant do_matrix_index (const Range& i, const Range& j) const; tree_constant do_matrix_index (const Range& i, constant_type j) const; tree_constant do_matrix_index (constant_type i, int j) const; tree_constant do_matrix_index (constant_type i, const idx_vector& j) const; tree_constant do_matrix_index (constant_type i, const Range& j) const; tree_constant do_matrix_index (constant_type i, constant_type j) const; // Assignment. void assign (tree_constant& rhs, const Octave_object& args); void do_scalar_assignment (const tree_constant& rhs, const Octave_object& args); void do_matrix_assignment (const tree_constant& rhs, const Octave_object& args); void do_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg); void fortran_style_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg); void fortran_style_matrix_assignment (const tree_constant& rhs, constant_type ci); void fortran_style_matrix_assignment (const tree_constant& rhs, idx_vector& i); void vector_assignment (const tree_constant& rhs, const tree_constant& i_arg); void check_vector_assign (int rhs_nr, int rhs_nc, int ilen, const char *rm); void do_vector_assign (const tree_constant& rhs, int i); void do_vector_assign (const tree_constant& rhs, idx_vector& i); void do_vector_assign (const tree_constant& rhs, Range& i); void do_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg, const tree_constant& j_arg); void do_matrix_assignment (const tree_constant& rhs, int i, const tree_constant& j_arg); void do_matrix_assignment (const tree_constant& rhs, idx_vector& i, const tree_constant& j_arg); void do_matrix_assignment (const tree_constant& rhs, Range& i, const tree_constant& j_arg); void do_matrix_assignment (const tree_constant& rhs, constant_type i, const tree_constant& j_arg); void do_matrix_assignment (const tree_constant& rhs, int i, int j); void do_matrix_assignment (const tree_constant& rhs, int i, idx_vector& jv); void do_matrix_assignment (const tree_constant& rhs, int i, Range& j); void do_matrix_assignment (const tree_constant& rhs, int i, constant_type cj); void do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, int j); void do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, idx_vector& jv); void do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, Range& j); void do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, constant_type j); void do_matrix_assignment (const tree_constant& rhs, Range& i, int j); void do_matrix_assignment (const tree_constant& rhs, Range& i, idx_vector& jv); void do_matrix_assignment (const tree_constant& rhs, Range& i, Range& j); void do_matrix_assignment (const tree_constant& rhs, Range& i, constant_type j); void do_matrix_assignment (const tree_constant& rhs, constant_type i, int j); void do_matrix_assignment (const tree_constant& rhs, constant_type i, idx_vector& jv); void do_matrix_assignment (const tree_constant& rhs, constant_type i, Range& j); void do_matrix_assignment (const tree_constant& rhs, const constant_type i, constant_type j); void delete_row (int); void delete_rows (idx_vector& i); void delete_rows (Range& i); void delete_column (int); void delete_columns (idx_vector& j); void delete_columns (Range& j); // Data. int count; constant_type type_tag; union { double scalar; // A real scalar constant. Matrix *matrix; // A real matrix constant. Complex *complex_scalar; // A real scalar constant. ComplexMatrix *complex_matrix; // A real matrix constant. char *string; // A character string constant. Range *range; // A set of evenly spaced values. Octave_map *a_map; // An associative array. }; char *orig_text; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/unwind-prot.h100666 415 17 4364 5702416672 14405 0ustar jweusers// unwind-prot.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_unwind_prot_h) #define octave_unwind_prot_h 1 #include typedef void (*cleanup_func)(void *ptr); void add_unwind_protect (cleanup_func fptr, void *ptr); void run_unwind_protect (void); void discard_unwind_protect (void); void begin_unwind_frame (char *tag); void run_unwind_frame (char *tag); void discard_unwind_frame (char *tag); void run_all_unwind_protects (void); void discard_all_unwind_protects (void); void matrix_cleanup (void *m); void complex_matrix_cleanup (void *cm); void unwind_protect_int_internal (int *ptr, int value); void unwind_protect_ptr_internal (void **ptr, void *value); void unwind_protect_var_internal (void *ptr, void *value, size_t size); #define unwind_protect_int(i) \ unwind_protect_int_internal (&(i), (i)) #define unwind_protect_ptr(p) \ unwind_protect_ptr_internal ((void **) &(p), (void *) (p)) #define unwind_protect_var(i) \ unwind_protect_var_internal ((void *) &(i), (void *) &(i), sizeof (int)) class unwind_elem { public: unwind_elem (void); unwind_elem (char *t); unwind_elem (cleanup_func f, void *p); unwind_elem (const unwind_elem& el); ~unwind_elem (void); unwind_elem& operator = (const unwind_elem& el); char *tag (void); cleanup_func fptr (void); void *ptr (void); private: char *unwind_elem_tag; cleanup_func unwind_elem_fptr; void *unwind_elem_ptr; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/utils.h100666 415 17 4632 5702416670 13253 0ustar jweusers// utils.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_utils_h) #define octave_utils_h 1 class istream; class ostrstream; class tree_constant; class Octave_object; // Tell g++ that jump_to_top_level doesn't return; #ifdef __GNUG__ typedef void v_fcn_v (void); volatile v_fcn_v jump_to_top_level; #endif extern char *strsave (const char *); extern char *strconcat (const char *, const char *); extern void discard_until (istream&, char); #if 0 extern char *read_until (istream&, char); #endif extern char *search_path_for_file (const char *, const char *); extern char *file_in_path (const char *, const char *); extern char *fcn_file_in_path (const char *); extern char *oct_file_in_path (const char *); extern char *octave_tmp_file_name (void); extern char **pathstring_to_vector (char *pathstring); extern void jump_to_top_level (void); extern int almost_match (const char *std, const char *s, int min_match_len = 1, int case_sens = 1); extern int keyword_almost_match (const char **std, int *min_len, const char *s, int min_toks_to_match, int max_toks); extern char **get_fcn_file_names (int& ffl_len, const char *dir, int no_suffix); extern char **get_fcn_file_names (int& ffl_len, int no_suffix); extern int NINT (double x); extern double D_NINT (double x); extern char **make_argv (const Octave_object& args, const char *fcn_name); extern int empty_arg (const char *name, int nr, int nc); extern ostrstream& list_in_columns (ostrstream& os, char **list); extern char *undo_string_escape (char c); extern char *undo_string_escapes (char *s); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/user-prefs.h100666 415 17 6325 5702416671 14210 0ustar jweusers// user-prefs.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_user_prefs_h) #define octave_user_prefs_h 1 struct user_preferences { int automatic_replot; int whitespace_in_literal_matrix; int do_fortran_indexing; int empty_list_elements_ok; int ignore_function_time_stamp; int implicit_str_to_num_ok; int ok_to_lose_imaginary_part; int output_max_field_width; int output_precision; int page_screen_output; int prefer_column_vectors; int prefer_zero_one_indexing; int print_answer_id_name; int print_empty_dimensions; int propagate_empty_matrices; int resize_on_range_error; int return_last_computed_value; int save_precision; int silent_functions; int split_long_rows; int treat_neg_dim_as_zero; int warn_assign_as_truth_value; int warn_comma_in_global_decl; int warn_divide_by_zero; char *default_save_format; char *editor; char *gnuplot_binary; char *imagepath; char *info_file; char *loadpath; char *pager_binary; char *ps1; char *ps2; char *pwd; }; extern user_preferences user_pref; extern void init_user_prefs (void); extern int automatic_replot (void); extern int whitespace_in_literal_matrix (void); extern int do_fortran_indexing (void); extern int empty_list_elements_ok (void); extern int ignore_function_time_stamp (void); extern int implicit_str_to_num_ok (void); extern int ok_to_lose_imaginary_part (void); extern int page_screen_output (void); extern int prefer_column_vectors (void); extern int prefer_zero_one_indexing (void); extern int print_answer_id_name (void); extern int print_empty_dimensions (void); extern int propagate_empty_matrices (void); extern int resize_on_range_error (void); extern int return_last_computed_value (void); extern int silent_functions (void); extern int split_long_rows (void); extern int treat_neg_dim_as_zero (void); extern int warn_assign_as_truth_value (void); extern int warn_comma_in_global_decl (void); extern int warn_divide_by_zero (void); extern int set_output_max_field_width (void); extern int set_output_precision (void); extern int set_save_precision (void); extern int sv_default_save_format (void); extern int sv_editor (void); extern int sv_gnuplot_binary (void); extern int sv_imagepath (void); extern int sv_info_file (void); extern int sv_loadpath (void); extern int sv_pager_binary (void); extern int sv_ps1 (void); extern int sv_ps2 (void); extern int sv_pwd (void); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/variables.h100666 415 17 7355 5702416667 14076 0ustar jweusers// variables.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_variables_h) #define octave_variables_h 1 class istream; class ostrstream; class symbol_record; class symbol_table; class tree; class tree_fvc; class tree_constant; class Octave_object; struct builtin_mapper_function; struct builtin_function; struct builtin_variable; typedef int (*sv_Function)(void); struct builtin_variable { char *name; tree_constant *value; int install_as_function; int protect; int eternal; sv_Function sv_function; char *help_string; }; typedef Octave_object (*Octave_builtin_fcn)(const Octave_object&, int); struct builtin_function { char *name; int nargin_max; int nargout_max; int is_text_fcn; Octave_builtin_fcn fcn; char *help_string; }; extern void initialize_symbol_tables (void); extern int lookup (symbol_record *s, int exec_script = 1); extern symbol_record *lookup_by_name (const char *nm, int exec_script = 1); extern char *get_help_from_file (const char *f); extern char *builtin_string_variable (const char *); extern int builtin_real_scalar_variable (const char *, double&); extern void link_to_global_variable (symbol_record *sr); extern void link_to_builtin_variable (symbol_record *sr); extern void link_to_builtin_or_function (symbol_record *sr); extern void force_link_to_function (const char *s); extern int is_builtin_variable (const char *name); extern int is_text_function_name (const char *name); extern int is_globally_visible (const char *name); extern tree_fvc *is_valid_function (const tree_constant&, char *, int warn = 0); extern int takes_correct_nargs (tree_fvc *, int, char *, int warn = 0); extern char **make_name_list (void); extern void install_builtin_mapper (builtin_mapper_function *mf); extern void install_builtin_function (builtin_function *gf); extern void install_builtin_variable (builtin_variable *v); extern void install_builtin_variable_as_function (const char *name, tree_constant *val, int protect = 0, int eternal = 0, const char *help = 0); extern void alias_builtin (const char *alias, const char *name); extern void bind_nargin_and_nargout (symbol_table *sym_tab, int nargin, int nargout); extern void bind_builtin_variable (const char *, tree_constant *, int protect = 0, int eternal = 0, sv_Function f = (sv_Function) 0, const char *help = 0); extern void install_builtin_variables (void); extern char *octave_lib_dir (void); extern char *octave_arch_lib_dir (void); extern char *octave_bin_dir (void); extern char *default_path (void); extern char *default_info_file (void); extern char *default_editor (void); extern char *get_site_defaults (void); // Symbol table for symbols at the top level. extern symbol_table *top_level_sym_tab; // Symbol table for the current scope. extern symbol_table *curr_sym_tab; // Symbol table for global symbols. extern symbol_table *global_sym_tab; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/version.h100666 415 17 1650 5705271074 13575 0ustar jweusers// version.h -*- C -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ static char version_string[] = "1.1.0"; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/xdiv.h100666 415 17 3512 5702416631 13056 0ustar jweusers// xdiv.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_xdiv_h) #define octave_xdiv_h 1 class Complex; class Matrix; class ComplexMatrix; class tree_constant; extern tree_constant xdiv (const Matrix& a, const Matrix& b); extern tree_constant xdiv (const Matrix& a, const ComplexMatrix& b); extern tree_constant xdiv (const ComplexMatrix& a, const Matrix& b); extern tree_constant xdiv (const ComplexMatrix& a, const ComplexMatrix& b); extern tree_constant x_el_div (double a, const Matrix& b); extern tree_constant x_el_div (double a, const ComplexMatrix& b); extern tree_constant x_el_div (const Complex a, const Matrix& b); extern tree_constant x_el_div (const Complex a, const ComplexMatrix& b); extern tree_constant xleftdiv (const Matrix& a, const Matrix& b); extern tree_constant xleftdiv (const Matrix& a, const ComplexMatrix& b); extern tree_constant xleftdiv (const ComplexMatrix& a, const Matrix& b); extern tree_constant xleftdiv (const ComplexMatrix& a, const ComplexMatrix& b); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/xpow.h100666 415 17 5053 5702416630 13102 0ustar jweusers// xpow.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #if !defined (octave_xpow_h) #define octave_xpow_h 1 class Complex; class Matrix; class ComplexMatrix; class tree_constant; extern tree_constant xpow (double a, double b); extern tree_constant xpow (double a, const Matrix& b); extern tree_constant xpow (double a, const Complex& b); extern tree_constant xpow (double a, const ComplexMatrix& b); extern tree_constant xpow (const Matrix& a, double b); extern tree_constant xpow (const Matrix& a, const Complex& b); extern tree_constant xpow (const Complex& a, double b); extern tree_constant xpow (const Complex& a, const Matrix& b); extern tree_constant xpow (const Complex& a, const Complex& b); extern tree_constant xpow (const Complex& a, const ComplexMatrix& b); extern tree_constant xpow (const ComplexMatrix& a, double b); extern tree_constant xpow (const ComplexMatrix& a, const Complex& b); extern tree_constant elem_xpow (double a, const Matrix& b); extern tree_constant elem_xpow (double a, const ComplexMatrix& b); extern tree_constant elem_xpow (const Matrix& a, double b); extern tree_constant elem_xpow (const Matrix& a, const Matrix& b); extern tree_constant elem_xpow (const Matrix& a, const Complex& b); extern tree_constant elem_xpow (const Matrix& a, const ComplexMatrix& b); extern tree_constant elem_xpow (const Complex& a, const Matrix& b); extern tree_constant elem_xpow (const Complex& a, const ComplexMatrix& b); extern tree_constant elem_xpow (const ComplexMatrix& a, double b); extern tree_constant elem_xpow (const ComplexMatrix& a, const Matrix& b); extern tree_constant elem_xpow (const ComplexMatrix& a, const Complex& b); extern tree_constant elem_xpow (const ComplexMatrix& a, const ComplexMatrix& b); #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/Map.h100666 415 17 6723 5702416763 12636 0ustar jweusers// Map.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The classes in this file are derived from the old `genclass' versions of Map and CHMap from libg++, originally: Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@rocky.oswego.edu) and distributed under the terms of the GNU Library General Public License as published by the Free Software Foundation. */ #if ! defined (octave_Map_h) #define octave_Map_h 1 #include #include "utils.h" template class Map { protected: int count; C def; public: Map (const C& dflt) : def (dflt) { count = 0; } virtual ~Map (void) { } int length (void) const { return count; } // current number of items int empty (void) const { return count == 0; } virtual int contains (const char *key) const; // is key mapped? virtual void clear (void); // delete all items virtual C& operator [] (const char *key) = 0; // access contents by key virtual void del (const char *key) = 0; // delete entry virtual Pix first (void) const = 0; // Pix of first item or 0 virtual void next (Pix& i) const = 0; // advance to next or 0 virtual const char *key (Pix i) const = 0; // access key at i virtual C& contents (Pix i) const = 0; // access contents at i virtual int owns (Pix i) const; // is i a valid Pix ? virtual Pix seek (const char *key) const; // Pix of key C& dflt (void) { return def; } // access default val void error (const char* msg) const; virtual int OK (void) const = 0; // rep invariant }; template struct CHNode { CHNode *tl; char *hd; C cont; CHNode (void) : tl (0), hd (0) { } CHNode (const char *h, const C& c, CHNode *t = 0) : tl (t), cont (c) { hd = strsave (h); } ~CHNode (void) { delete [] hd; } }; #ifndef DEFAULT_INITIAL_CAPACITY #define DEFAULT_INITIAL_CAPACITY 8 #endif template class CHMap : public Map { protected: CHNode **tab; unsigned int size; public: CHMap (const C& dflt, unsigned int sz = DEFAULT_INITIAL_CAPACITY); CHMap (const CHMap& a); ~CHMap (void) { clear (); delete tab; } C& operator [] (const char *key); void del (const char *key); Pix first (void) const; void next (Pix& i) const; const char *key (Pix p) const { if (p == 0) error ("null Pix"); return ((CHNode *) p)->hd; } C& contents (Pix p) const { if (p == 0) error ("null Pix"); return ((CHNode *) p)->cont; } Pix seek (const char *key) const; int contains (const char *key) const { return seek (key) != 0; } void clear (void); int OK (void) const; }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack.h100666 415 17 3267 5702416762 13424 0ustar jweusers// SLStack.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The classes in this file are derived from the old `genclass' version of SLStack from libg++, originally: Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@rocky.oswego.edu) and distributed under the terms of the GNU Library General Public License as published by the Free Software Foundation. */ #if !defined (_SLStack_h) #define _SLStack_h 1 #include "SLList.h" #include "Stack.h" template class SLStack : public Stack { private: SLList p; public: SLStack (void); SLStack (const SLStack& s); ~SLStack (void); SLStack& operator = (const SLStack&); void push (const T& item); T pop (void); T& top (void); void del_top (void); int empty (void); int full (void); int length (void); void clear (void); int OK (void); }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/Stack.h100666 415 17 3123 5702416761 13153 0ustar jweusers// Stack.h -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The classes in this file are derived from the old `genclass' version of Stack from libg++, originally: Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@rocky.oswego.edu) and distributed under the terms of the GNU Library General Public License as published by the Free Software Foundation. */ #if !defined (_Stack_h) #define _Stack_h 1 template class Stack { public: inline Stack (void) { } inline virtual ~Stack (void) { } virtual void push (const T& item) = 0; virtual T pop (void) = 0; virtual T& top (void) = 0; virtual void del_top (void) = 0; virtual int empty (void) = 0; virtual int full (void) = 0; virtual int length (void) = 0; virtual void clear (void) = 0; void error (const char *msg); virtual int OK (void) = 0; }; #endif octave-1.1.0/src/f-balance.cc100666 415 17 14621 5702417114 14072 0ustar jweusers// f-balance.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by A. S. Hodel #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "dbleAEPBAL.h" #include "CmplxAEPBAL.h" #include "dbleAEPBAL.h" #include "CmplxAEPBAL.h" #include "dbleGEPBAL.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("balance", Fbalance, Sbalance, 4, 4, "AA = balance (A [, OPT]) or [[DD,] AA] = balance (A [, OPT])\n\ \n\ generalized eigenvalue problem:\n\ \n\ [cc, dd, aa, bb] = balance (a, b [, opt])\n\ \n\ where OPT is an optional single character argument as follows: \n\ \n\ N: no balancing; arguments copied, transformation(s) set to identity\n\ P: permute argument(s) to isolate eigenvalues where possible\n\ S: scale to improve accuracy of computed eigenvalues\n\ B: (default) permute and scale, in that order. Rows/columns\n\ of a (and b) that are isolated by permutation are not scaled\n\ \n\ [DD, AA] = balance (A, OPT) returns aa = dd\a*dd,\n\ \n\ [CC, DD, AA, BB] = balance (A, B, OPT) returns AA (BB) = CC*A*DD (CC*B*DD)") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 3 || nargout < 0 || nargout > 4) { print_usage ("balance"); return retval; } char *bal_job; int my_nargin; // # args w/o optional string arg // Determine if balancing option is listed. Set my_nargin to the // number of matrix inputs. if (args(nargin-1).is_string ()) { bal_job = args(nargin-1).string_value (); my_nargin = nargin-1; } else { bal_job = "B"; my_nargin = nargin; } tree_constant arg_a = args(0); int a_nr = arg_a.rows (); int a_nc = arg_a.columns (); // Check argument 1 dimensions. int arg_is_empty = empty_arg ("balance", a_nr, a_nc); if (arg_is_empty < 0) return retval; if (arg_is_empty > 0) return Octave_object (2, Matrix ()); if (a_nr != a_nc) { gripe_square_matrix_required ("balance"); return retval; } // Extract argument 1 parameter for both AEP and GEP. Matrix aa; ComplexMatrix caa; if (arg_a.is_complex_type ()) caa = arg_a.complex_matrix_value (); else aa = arg_a.matrix_value (); if (error_state) return retval; // Treat AEP/ GEP cases. switch (my_nargin) { case 1: // Algebraic eigenvalue problem. if (arg_a.is_complex_type ()) { ComplexAEPBALANCE result (caa, bal_job); if (nargout == 0 || nargout == 1) retval(0) = result.balanced_matrix (); else { retval(1) = result.balanced_matrix (); retval(0) = result.balancing_matrix (); } } else { AEPBALANCE result (aa, bal_job); if (nargout == 0 || nargout == 1) retval(0) = result.balanced_matrix (); else { retval(1) = result.balanced_matrix (); retval(0) = result.balancing_matrix (); } } break; case 2: { // Generalized eigenvalue problem. // 1st we have to check argument 2 dimensions and type... tree_constant arg_b = args(1); int b_nr = arg_b.rows (); int b_nc = arg_b.columns (); // Check argument 2 dimensions -- must match arg 1. if (b_nr != b_nc || b_nr != a_nr) { gripe_nonconformant (); return retval; } // Now, extract the second matrix... // Extract argument 1 parameter for both AEP and GEP. Matrix bb; ComplexMatrix cbb; if (arg_b.is_complex_type ()) cbb = arg_b.complex_matrix_value (); else bb = arg_b.matrix_value (); if (error_state) return retval; // Both matrices loaded, now let's check what kind of arithmetic: if (arg_a.is_complex_type () || arg_b.is_complex_type ()) { if (arg_a.is_real_type ()) caa = aa; if (arg_b.is_real_type ()) cbb = bb; // Compute magnitudes of elements for balancing purposes. // Surely there's a function I can call someplace! for (int i = 0; i < a_nr; i++) for (int j = 0; j < a_nc; j++) { aa.elem (i, j) = abs (caa.elem (i, j)); bb.elem (i, j) = abs (cbb.elem (i, j)); } } GEPBALANCE result (aa, bb, bal_job); if (arg_a.is_complex_type () || arg_b.is_complex_type ()) { caa = result.left_balancing_matrix () * caa * result.right_balancing_matrix (); cbb = result.left_balancing_matrix () * cbb * result.right_balancing_matrix (); switch (nargout) { case 0: case 1: warning ("balance: should use two output arguments"); retval(0) = caa; break; case 2: retval(1) = cbb; retval(0) = caa; break; case 4: retval(3) = cbb; retval(2) = caa; retval(1) = result.right_balancing_matrix (); retval(0) = result.left_balancing_matrix (); break; default: error ("balance: invalid number of output arguments"); break; } } else { switch (nargout) { case 0: case 1: warning ("balance: should use two output arguments"); retval(0) = result.balanced_a_matrix (); break; case 2: retval(1) = result.balanced_b_matrix (); retval(0) = result.balanced_a_matrix (); break; case 4: retval(3) = result.balanced_b_matrix (); retval(2) = result.balanced_a_matrix (); retval(1) = result.right_balancing_matrix (); retval(0) = result.left_balancing_matrix (); break; default: error ("balance: invalid number of output arguments"); break; } } } break; default: error ("balance requires one (AEP) or two (GEP) numeric arguments"); break; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-chol.cc100666 415 17 4272 5702417113 13412 0ustar jweusers// f-chol.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleCHOL.h" #include "CmplxCHOL.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("chol", Fchol, Schol, 2, 1, "R = chol (X): cholesky factorization") { Octave_object retval; int nargin = args.length (); if (nargin != 1 || nargout > 1) { print_usage ("chol"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("chol", nr, nc); if (arg_is_empty < 0) return retval; if (arg_is_empty > 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int info; CHOL fact (m, info); if (info != 0) error ("chol: matrix not positive definite"); else retval = fact.chol_matrix (); } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { int info; ComplexCHOL fact (m, info); if (info != 0) error ("chol: matrix not positive definite"); else retval = fact.chol_matrix (); } } else { gripe_wrong_type_arg ("chol", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-colloc.cc100666 415 17 5411 5702417113 13734 0ustar jweusers// f-colloc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "CollocWt.h" #include "tree-const.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("colloc", Fcolloc, Scolloc, 7, 4, "[R, A, B, Q] = colloc (N [, \"left\"] [, \"right\"]): collocation weights") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 3) { print_usage ("colloc"); return retval; } if (! args(0).is_scalar_type ()) { error ("colloc: first argument must be a scalar"); return retval; } double tmp = args(0).double_value (); if (error_state) return retval; int ncol = NINT (tmp); if (ncol < 0) { error ("colloc: first argument must be non-negative"); return retval; } int ntot = ncol; int left = 0; int right = 0; for (int i = 1; i < nargin; i++) { if (args(i).is_defined ()) { if (! args(i).is_string ()) { error ("colloc: expecting string argument"); return retval; } char *s = args(i).string_value (); if (s && (((*s == 'R' || *s == 'r') && strlen (s) == 1) || strcmp (s, "right") == 0)) { right = 1; } else if (s && (((*s == 'L' || *s == 'l') && strlen (s) == 1) || strcmp (s, "left") == 0)) { left = 1; } else { error ("colloc: unrecognized argument"); return retval; } } else { error ("colloc: unexpected NULL argument"); return retval; } } ntot += left + right; if (ntot < 1) { error ("colloc: the total number of roots must be positive"); return retval; } CollocWt wts (ncol, left, right); ColumnVector r = wts.roots (); Matrix A = wts.first (); Matrix B = wts.second (); ColumnVector q = wts.quad_weights (); retval(3) = q; retval(2) = B; retval(1) = A; retval(0) = r; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-dassl.cc100666 415 17 16224 5702417112 13612 0ustar jweusers// f-dassl.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "DAE.h" #include "tree-const.h" #include "variables.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "pager.h" #include "help.h" #include "defun-dld.h" // Global pointer for user defined function required by dassl. static tree_fvc *dassl_fcn; static ODE_options dassl_opts; ColumnVector dassl_user_function (const ColumnVector& x, const ColumnVector& xdot, double t) { ColumnVector retval; int nstates = x.capacity (); assert (nstates == xdot.capacity ()); Octave_object args; args(2) = t; if (nstates > 1) { Matrix m1 (nstates, 1); Matrix m2 (nstates, 1); for (int i = 0; i < nstates; i++) { m1 (i, 0) = x.elem (i); m2 (i, 0) = xdot.elem (i); } tree_constant state (m1); tree_constant deriv (m2); args(1) = deriv; args(0) = state; } else { double d1 = x.elem (0); double d2 = xdot.elem (0); tree_constant state (d1); tree_constant deriv (d2); args(1) = deriv; args(0) = state; } if (dassl_fcn) { Octave_object tmp = dassl_fcn->eval (0, 1, args); if (error_state) { gripe_user_supplied_eval ("dassl"); return retval; } if (tmp.length () > 0 && tmp(0).is_defined ()) { retval = tmp(0).vector_value (); if (error_state || retval.length () == 0) gripe_user_supplied_eval ("dassl"); } else gripe_user_supplied_eval ("dassl"); } return retval; } DEFUN_DLD_BUILTIN ("dassl", Fdassl, Sdassl, 5, 2, "dassl (\"function_name\", x_0, xdot_0, t_out)\n\ dassl (F, X_0, XDOT_0, T_OUT, T_CRIT)\n\ \n\ The first argument is the name of the function to call to\n\ compute the vector of residuals. It must have the form\n\ \n\ res = f (x, xdot, t)\n\ \n\ where x, xdot, and res are vectors, and t is a scalar.") { Octave_object retval; int nargin = args.length (); if (nargin < 4 || nargin > 5) { print_usage ("dassl"); return retval; } dassl_fcn = is_valid_function (args(0), "dassl", 1); if (! dassl_fcn || takes_correct_nargs (dassl_fcn, 3, "dassl", 1) != 1) return retval; ColumnVector state = args(1).vector_value (); if (error_state) { error ("dassl: expecting state vector as second argument"); return retval; } ColumnVector deriv = args(2).vector_value (); if (error_state) { error ("dassl: expecting derivative vector as third argument"); return retval; } ColumnVector out_times = args(3).vector_value (); if (error_state) { error ("dassl: expecting output time vector as fourth argument"); return retval; } ColumnVector crit_times; int crit_times_set = 0; if (nargin > 4) { crit_times = args(4).vector_value (); if (error_state) { error ("dassl: expecting critical time vector as fifth argument"); return retval; } crit_times_set = 1; } if (state.capacity () != deriv.capacity ()) { error ("dassl: x and xdot must have the same size"); return retval; } double tzero = out_times.elem (0); DAEFunc func (dassl_user_function); DAE dae (state, deriv, tzero, func); dae.copy (dassl_opts); Matrix output; Matrix deriv_output; if (crit_times_set) output = dae.integrate (out_times, deriv_output, crit_times); else output = dae.integrate (out_times, deriv_output); retval.resize (2); retval(0) = output; retval(1) = deriv_output; return retval; } typedef void (ODE_options::*d_set_opt_mf) (double); typedef double (ODE_options::*d_get_opt_mf) (void); #define MAX_TOKENS 3 struct DAE_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; d_get_opt_mf d_get_fcn; }; static DAE_OPTIONS dassl_option_table [] = { { "absolute tolerance", { "absolute", "tolerance", 0, 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_absolute_tolerance, ODE_options::absolute_tolerance, }, { "initial step size", { "initial", "step", "size", 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_initial_step_size, ODE_options::initial_step_size, }, { "maximum step size", { "maximum", "step", "size", 0, }, { 2, 0, 0, 0, }, 1, ODE_options::set_maximum_step_size, ODE_options::maximum_step_size, }, { "relative tolerance", { "relative", "tolerance", 0, 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_relative_tolerance, ODE_options::relative_tolerance, }, { 0, { 0, 0, 0, 0, }, { 0, 0, 0, 0, }, 0, 0, 0, }, }; static void print_dassl_option_list (void) { ostrstream output_buf; print_usage ("dassl_options", 1); output_buf << "\n" << "Options for dassl include:\n\n" << " keyword value\n" << " ------- -----\n\n"; DAE_OPTIONS *list = dassl_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); double val = (dassl_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_dassl_option (char *keyword, double val) { DAE_OPTIONS *list = dassl_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { (dassl_opts.*list->d_set_fcn) (val); return; } list++; } warning ("dassl_options: no match for `%s'", keyword); } DEFUN_DLD_BUILTIN ("dassl_options", Fdassl_options, Sdassl_options, -1, 1, "dassl_options (KEYWORD, VALUE)\n\ \n\ Set or show options for dassl. Keywords may be abbreviated\n\ to the shortest match.") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { print_dassl_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_dassl_option (keyword, val); return retval; } } } print_usage ("dassl_options"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-det.cc100666 415 17 5051 5702417111 13233 0ustar jweusers// f-det.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleDET.h" #include "CmplxDET.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("det", Fdet, Sdet, 2, 1, "det (X): determinant of a square matrix") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("det"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); if (nr == 0 && nc == 0) { retval = 1.0; return retval; } int arg_is_empty = empty_arg ("det", nr, nc); if (arg_is_empty < 0) return retval; if (arg_is_empty > 0) return Matrix (1, 1, 1.0); if (nr != nc) { gripe_square_matrix_required ("det"); return retval; } if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int info; double rcond = 0.0; DET det = m.determinant (info, rcond); double d = 0.0; if (info == -1) warning ("det: matrix singular to machine precision, rcond = %g", rcond); else d = det.value (); retval = d; } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { int info; double rcond = 0.0; ComplexDET det = m.determinant (info, rcond); Complex c = 0.0; if (info == -1) warning ("det: matrix singular to machine precision, rcond = %g", rcond); else c = det.value (); retval = c; } } else { gripe_wrong_type_arg ("det", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-eig.cc100666 415 17 4574 5702417110 13233 0ustar jweusers// f-eig.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "EIG.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("eig", Feig, Seig, 2, 1, "eig (X) or [V, D] = eig (X): compute eigenvalues and eigenvectors of X") { Octave_object retval; int nargin = args.length (); if (nargin != 1 || nargout > 2) { print_usage ("eig"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("eig", nr, nc); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (2, Matrix ()); if (nr != nc) { gripe_square_matrix_required ("eig"); return retval; } Matrix tmp; ComplexMatrix ctmp; EIG result; if (arg.is_real_type ()) { tmp = arg.matrix_value (); if (error_state) return retval; else result = EIG (tmp); } else if (arg.is_complex_type ()) { ctmp = arg.complex_matrix_value (); if (error_state) return retval; else result = EIG (ctmp); } else { gripe_wrong_type_arg ("eig", tmp); return retval; } if (nargout == 0 || nargout == 1) { retval(0) = result.eigenvalues (), 1; } else { // Blame it on Matlab. ComplexDiagMatrix d (result.eigenvalues ()); retval(1) = d; retval(0) = result.eigenvectors (); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-expm.cc100666 415 17 15106 5702417110 13451 0ustar jweusers// f-expm.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by A. S. Hodel #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "dMatrix.h" #include "CMatrix.h" #include "CColVector.h" #include "dbleAEPBAL.h" #include "CmplxAEPBAL.h" #include "f77-uscore.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" extern "C" { double F77_FCN (dlange) (const char*, const int*, const int*, const double*, const int*, double*); double F77_FCN (zlange) (const char*, const int*, const int*, const Complex*, const int*, double*); } DEFUN_DLD_BUILTIN ("expm", Fexpm, Sexpm, 2, 1, "expm (X): matrix exponential, e^A") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("expm"); return retval; } tree_constant arg = args(0); // Constants for matrix exponential calculation. static double padec [] = { 5.0000000000000000e-1, 1.1666666666666667e-1, 1.6666666666666667e-2, 1.6025641025641026e-3, 1.0683760683760684e-4, 4.8562548562548563e-6, 1.3875013875013875e-7, 1.9270852604185938e-9, }; int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("expm", nr, nc); if (arg_is_empty < 0) return retval; if (arg_is_empty > 0) return Matrix (); if (nr != nc) { gripe_square_matrix_required ("expm"); return retval; } int i, j; char* balance_job = "B"; // variables for balancing int sqpow; // power for scaling and squaring double inf_norm; // norm of preconditioned matrix int minus_one_j; // used in computing pade approx if (arg.is_real_type ()) { // Compute the exponential. Matrix m = arg.matrix_value (); if (error_state) return retval; double trshift = 0; // trace shift value // Preconditioning step 1: trace normalization. for (i = 0; i < nc; i++) trshift += m.elem (i, i); trshift /= nc; for (i = 0; i < nc; i++) m.elem (i, i) -= trshift; // Preconditioning step 2: balancing. AEPBALANCE mbal (m, balance_job); m = mbal.balanced_matrix (); Matrix d = mbal.balancing_matrix (); // Preconditioning step 3: scaling. ColumnVector work(nc); inf_norm = F77_FCN (dlange) ("I", &nc, &nc, m.fortran_vec (), &nc, work.fortran_vec ()); sqpow = (int) (1.0 + log (inf_norm) / log (2.0)); // Check whether we need to square at all. if (sqpow < 0) sqpow = 0; else { for (inf_norm = 1.0, i = 0; i < sqpow; i++) inf_norm *= 2.0; m = m / inf_norm; } // npp, dpp: pade' approx polynomial matrices. Matrix npp (nc, nc, 0.0); Matrix dpp = npp; // now powers a^8 ... a^1. minus_one_j = -1; for (j = 7; j >= 0; j--) { npp = m * npp + m * padec[j]; dpp = m * dpp + m * (minus_one_j * padec[j]); minus_one_j *= -1; } // Zero power. dpp = -dpp; for(j = 0; j < nc; j++) { npp.elem (j, j) += 1.0; dpp.elem (j, j) += 1.0; } // Compute pade approximation = inverse (dpp) * npp. Matrix result = dpp.solve (npp); // Reverse preconditioning step 3: repeated squaring. while (sqpow) { result = result * result; sqpow--; } // Reverse preconditioning step 2: inverse balancing. result = result.transpose(); d = d.transpose (); result = result * d; result = d.solve (result); result = result.transpose (); // Reverse preconditioning step 1: fix trace normalization. result = result * exp (trshift); retval = result; } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (error_state) return retval; Complex trshift = 0.0; // trace shift value // Preconditioning step 1: trace normalization. for (i = 0; i < nc; i++) trshift += m.elem (i, i); trshift /= nc; for (i = 0; i < nc; i++) m.elem (i, i) -= trshift; // Preconditioning step 2: eigenvalue balancing. ComplexAEPBALANCE mbal (m, balance_job); m = mbal.balanced_matrix (); ComplexMatrix d = mbal.balancing_matrix (); // Preconditioning step 3: scaling. ColumnVector work (nc); inf_norm = F77_FCN (zlange) ("I", &nc, &nc, m. fortran_vec (), &nc, work.fortran_vec ()); sqpow = (int) (1.0 + log (inf_norm) / log (2.0)); // Check whether we need to square at all. if (sqpow < 0) sqpow = 0; else { for (inf_norm = 1.0, i = 0; i < sqpow; i++) inf_norm *= 2.0; m = m / inf_norm; } // npp, dpp: pade' approx polynomial matrices. ComplexMatrix npp (nc, nc, 0.0); ComplexMatrix dpp = npp; // Now powers a^8 ... a^1. minus_one_j = -1; for (j = 7; j >= 0; j--) { npp = m * npp + m * padec[j]; dpp = m * dpp + m * (minus_one_j * padec[j]); minus_one_j *= -1; } // Zero power. dpp = -dpp; for (j = 0; j < nc; j++) { npp.elem (j, j) += 1.0; dpp.elem (j, j) += 1.0; } // Compute pade approximation = inverse (dpp) * npp. ComplexMatrix result = dpp.solve (npp); // Reverse preconditioning step 3: repeated squaring. while (sqpow) { result = result * result; sqpow--; } // reverse preconditioning step 2: inverse balancing XXX FIXME XXX: // should probably do this with lapack calls instead of a complete // matrix inversion. result = result.transpose (); d = d.transpose (); result = result * d; result = d.solve (result); result = result.transpose (); // Reverse preconditioning step 1: fix trace normalization. result = result * exp (trshift); retval = result; } else { gripe_wrong_type_arg ("expm", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-fft.cc100666 415 17 4753 5702417106 13252 0ustar jweusers// f-fft.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // This function should be merged with Fifft. DEFUN_DLD_BUILTIN ("fft", Ffft, Sfft, 3, 1, "fft (X [, N]): fast fourier transform of a vector") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2) { print_usage ("fft"); return retval; } tree_constant arg = args(0); int n_points = arg.rows (); if (n_points == 1) n_points = arg.columns (); if (nargin == 2) n_points = NINT (args(1).double_value ()); if (error_state) return retval; if (n_points < 0) { error ("fft: number of points must be greater than zero"); return retval; } int arg_is_empty = empty_arg ("fft", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty || n_points == 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { if (m.rows () == 1) m.resize (1, n_points, 0.0); else m.resize (n_points, m.columns (), 0.0); retval = m.fourier (); } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) m.resize (1, n_points, 0.0); else m.resize (n_points, m.columns (), 0.0); retval = m.fourier (); } } else { gripe_wrong_type_arg ("fft", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-fft2.cc100666 415 17 4736 5702417106 13335 0ustar jweusers// f-fft2.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // This function should be merged with Fifft2. DEFUN_DLD_BUILTIN ("fft2", Ffft2, Sfft2, 3, 1, "fft2 (X [, N] [, M])\n\ \n\ two dimensional fast fourier transform of a vector") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 3) { print_usage ("fft2"); return retval; } tree_constant arg = args(0); int n_rows = arg.rows (); if (nargin > 1) n_rows = NINT (args(1).double_value ()); if (error_state) return retval; int n_cols = arg.columns (); if (nargin > 2) n_cols = NINT (args(2).double_value ()); if (error_state) return retval; if (n_rows < 0 || n_cols < 0) { error ("fft2: number of points must be greater than zero"); return retval; } int arg_is_empty = empty_arg ("fft2", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty || n_rows == 0 || n_cols == 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { m.resize (n_rows, n_cols, 0.0); retval = m.fourier2d (); } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { m.resize (n_rows, n_cols, 0.0); retval = m.fourier2d (); } } else { gripe_wrong_type_arg ("fft2", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-find.cc100666 415 17 10263 5704563622 13433 0ustar jweusers// f-find.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "tree-const.h" #include "error.h" #include "gripes.h" #include "help.h" #include "defun-dld.h" static Octave_object find_to_fortran_idx (const ColumnVector i_idx, const ColumnVector j_idx, const tree_constant& val, int nr, int nc, int nargout) { Octave_object retval; switch (nargout) { case 0: case 1: { int count = i_idx.length (); ColumnVector tmp (count); for (int i = 0; i < count; i++) tmp (i) = nr * (j_idx (i) - 1.0) + i_idx (i); // If the original argument was a row vector, force a row vector of // indices to be returned. retval(0) = tree_constant (tmp, (nr != 1)); } break; case 3: retval(2) = val; // Fall through! case 2: retval(1) = tree_constant (j_idx, 1); retval(0) = tree_constant (i_idx, 1); // If you want this to work more like Matlab, use the following line // instead of the previous one. // retval(0) = tree_constant (i_idx, (nr != 1)); break; default: panic_impossible (); break; } return retval; } static Octave_object find_nonzero_elem_idx (const Matrix& m, int nargout) { int count = 0; int m_nr = m.rows (); int m_nc = m.columns (); int i, j; for (j = 0; j < m_nc; j++) for (i = 0; i < m_nr; i++) if (m.elem (i, j) != 0.0) count++; Octave_object retval (((nargout == 0) ? 1 : nargout), Matrix ()); if (count == 0) return retval; ColumnVector i_idx (count); ColumnVector j_idx (count); ColumnVector v (count); count = 0; for (j = 0; j < m_nc; j++) for (i = 0; i < m_nr; i++) { double d = m.elem (i, j); if (d != 0.0) { i_idx (count) = i + 1; j_idx (count) = j + 1; v (count) = d; count++; } } tree_constant tmp (v, 1); return find_to_fortran_idx (i_idx, j_idx, tmp, m_nr, m_nc, nargout); } static Octave_object find_nonzero_elem_idx (const ComplexMatrix& m, int nargout) { int count = 0; int m_nr = m.rows (); int m_nc = m.columns (); int i, j; for (j = 0; j < m_nc; j++) for (i = 0; i < m_nr; i++) if (m.elem (i, j) != 0.0) count++; Octave_object retval (((nargout == 0) ? 1 : nargout), Matrix ()); if (count == 0) return retval; ColumnVector i_idx (count); ColumnVector j_idx (count); ComplexColumnVector v (count); count = 0; for (j = 0; j < m_nc; j++) for (i = 0; i < m_nr; i++) { Complex c = m.elem (i, j); if (c != 0.0) { i_idx (count) = i; j_idx (count) = j; v (count) = c; count++; } } tree_constant tmp (v, 1); return find_to_fortran_idx (i_idx, j_idx, tmp, m_nr, m_nc, nargout); } DEFUN_DLD_BUILTIN ("find", Ffind, Sfind, 2, 3, "find (X) or [I, J, V] = find (X): Return indices of nonzero elements") { Octave_object retval; int nargin = args.length (); if (nargin != 1 || nargout > 3) { print_usage ("find"); return retval; } tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) retval = find_nonzero_elem_idx (m, nargout); } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) retval = find_nonzero_elem_idx (m, nargout); } else { gripe_wrong_type_arg ("find", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-fsolve.cc100666 415 17 13573 5702417104 14007 0ustar jweusers// f-fsolve.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "NLEqn.h" #include "tree-const.h" #include "variables.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "pager.h" #include "help.h" #include "defun-dld.h" // Global pointer for user defined function required by hybrd1. static tree_fvc *fsolve_fcn; static NLEqn_options fsolve_opts; int hybrd_info_to_fsolve_info (int info) { switch (info) { case -1: info = -2; break; case 0: info = -1; break; case 1: break; case 2: info = 4; break; case 3: case 4: case 5: info = 3; break; default: panic_impossible (); break; } return info; } ColumnVector fsolve_user_function (const ColumnVector& x) { ColumnVector retval; int n = x.capacity (); Octave_object args; args.resize (1); if (n > 1) { Matrix m (n, 1); for (int i = 0; i < n; i++) m (i, 0) = x.elem (i); tree_constant vars (m); args(0) = vars; } else { double d = x.elem (0); tree_constant vars (d); args(0) = vars; } if (fsolve_fcn) { Octave_object tmp = fsolve_fcn->eval (0, 1, args); if (tmp.length () > 0 && tmp(0).is_defined ()) { retval = tmp(0).vector_value (); if (error_state || retval.length () <= 0) gripe_user_supplied_eval ("fsolve"); } else gripe_user_supplied_eval ("fsolve"); } return retval; } DEFUN_DLD_BUILTIN ("fsolve", Ffsolve, Sfsolve, 2, 1, "Solve nonlinear equations using Minpack. Usage:\n\ \n\ [X, INFO] = fsolve (F, X0)\n\ \n\ Where the first argument is the name of the function to call to\n\ compute the vector of function values. It must have the form\n\ \n\ y = f (x) \n\ where y and x are vectors.") { Octave_object retval; int nargin = args.length (); if (nargin != 2 || nargout > 3) { print_usage ("fsolve"); return retval; } fsolve_fcn = is_valid_function (args(0), "fsolve", 1); if (! fsolve_fcn || takes_correct_nargs (fsolve_fcn, 1, "fsolve", 1) != 1) return retval; ColumnVector x = args(1).vector_value (); if (error_state) { error ("fsolve: expecting vector as second argument"); return retval; } if (nargin > 2) warning ("fsolve: ignoring extra arguments"); if (nargout > 2) warning ("fsolve: can't compute path output yet"); NLFunc foo_fcn (fsolve_user_function); NLEqn foo (x, foo_fcn); foo.copy (fsolve_opts); int info; ColumnVector soln = foo.solve (info); info = hybrd_info_to_fsolve_info (info); retval.resize (nargout ? nargout : 1); retval(0) = soln, 1; if (nargout > 1) retval(1) = (double) info; return retval; } typedef void (NLEqn_options::*d_set_opt_mf) (double); typedef double (NLEqn_options::*d_get_opt_mf) (void); #define MAX_TOKENS 1 struct NLEQN_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; d_get_opt_mf d_get_fcn; }; static NLEQN_OPTIONS fsolve_option_table [] = { { "tolerance", { "tolerance", 0, }, { 1, 0, }, 1, NLEqn_options::set_tolerance, NLEqn_options::tolerance, }, { 0, { 0, 0, }, { 0, 0, }, 0, 0, 0, }, }; static void print_fsolve_option_list (void) { ostrstream output_buf; print_usage ("fsolve_options", 1); output_buf << "\n" << "Options for fsolve include:\n\n" << " keyword value\n" << " ------- -----\n\n"; NLEQN_OPTIONS *list = fsolve_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); double val = (fsolve_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_fsolve_option (char *keyword, double val) { NLEQN_OPTIONS *list = fsolve_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { (fsolve_opts.*list->d_set_fcn) (val); return; } list++; } warning ("fsolve_options: no match for `%s'", keyword); } DEFUN_DLD_BUILTIN ("fsolve_options", Ffsolve_options, Sfsolve_options, -1, 1, "fsolve_options (KEYWORD, VALUE)\n\ \n\ Set or show options for fsolve. Keywords may be abbreviated\n\ to the shortest match.") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { print_fsolve_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_fsolve_option (keyword, val); return retval; } } } print_usage ("fsolve_options"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-fsqp.cc100666 415 17 5561 5702417103 13437 0ustar jweusers// f-fsqp.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "FSQP.h" #include "tree-const.h" #include "error.h" #include "help.h" #include "defun-dld.h" #ifndef FSQP_MISSING // Global pointers for user defined functions required by fsqp. // static tree *fsqp_objective; // static tree *fsqp_constraints; double fsqp_objective_function (const ColumnVector& x) { return 0.0; } ColumnVector fsqp_constraint_function (const ColumnVector& x) { ColumnVector retval; return retval; } #endif #if defined (FSQP_MISSING) DEFUN_DLD_BUILTIN ("fsqp", Ffsqp, Sfsqp, 11, 3, "This function requires FSQP, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/fsqp/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("fsqp", Ffsqp, Sfsqp, 11, 3, "[X, PHI] = fsqp (X, PHI [, LB, UB] [, LB, A, UB] [, LB, G, UB])\n\ \n\ Groups of arguments surrounded in `[]' are optional, but\n\ must appear in the same relative order shown above.") #endif { /* Handle all of the following: 1. fsqp (x, phi) 2. fsqp (x, phi, lb, ub) 3. fsqp (x, phi, lb, ub, llb, c, lub) 4. fsqp (x, phi, lb, ub, llb, c, lub, nllb, g, nlub) 5. fsqp (x, phi, lb, ub, nllb, g, nlub) 6. fsqp (x, phi, llb, c, lub, nllb, g, nlub) 7. fsqp (x, phi, llb, c, lub) 8. fsqp (x, phi, nllb, g, nlub) */ Octave_object retval; error ("fsqp: not implemented yet"); return retval; } #if defined (FSQP_MISSING) DEFUN_DLD_BUILTIN ("fsqp_options", Ffsqp_options, Sfsqp_options, -1, 1, "This function requires FSQP, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/fsqp/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("fsqp_options", Ffsqp_options, Sfsqp_options, -1, 1, "fsqp_options (KEYWORD, VALUE)\n\ \n\ Set or show options for fsqp. Keywords may be abbreviated\n\ to the shortest match.") #endif { Octave_object retval; error ("fsqp_options: not implemented yet"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-givens.cc100666 415 17 7134 5702417103 13757 0ustar jweusers// f-givens.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by A. S. Hodel #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "f77-uscore.h" #include "tree-const.h" #include "user-prefs.h" #include "error.h" #include "gripes.h" #include "help.h" #include "defun-dld.h" extern "C" { int F77_FCN (dlartg) (const double*, const double*, double*, double*, double*); int F77_FCN (zlartg) (const Complex*, const Complex*, double*, Complex*, Complex*); } DEFUN_DLD_BUILTIN ("givens", Fgivens, Sgivens, 3, 2, "G = givens (X, Y)\n\ \n\ compute orthogonal matrix G = [c s; -conj (s) c]\n\ such that G [x; y] = [*; 0] (x, y scalars)\n\ \n\ [c, s] = givens (x, y) returns the (c, s) values themselves.") { Octave_object retval; int nargin = args.length (); if (nargin != 2 || nargout > 2) { print_usage ("givens"); return retval; } tree_constant arg_a = args(0); tree_constant arg_b = args(1); if (! arg_a.is_scalar_type () && arg_b.is_scalar_type ()) { error("givens: requires two scalar arguments"); return retval; } Complex cx, cy; double x, y; if (arg_a.is_complex_type ()) { cx = arg_a.complex_value (); if (error_state) return retval; } else { x = arg_a.double_value (); if (error_state) return retval; cx = x; // copy to complex just in case } if (arg_b.is_complex_type ()) { cy = arg_b.complex_value (); if (error_state) return retval; } else { y = arg_b.double_value (); if (error_state) return retval; cy = y; // copy to complex just in case } // Now compute the rotation. double cc; if (arg_a.is_complex_type () || arg_b.is_complex_type ()) { Complex cs, temp_r; F77_FCN (zlartg) (&cx, &cy, &cc, &cs, &temp_r); switch (nargout) { case 0: // output a matrix case 1: { ComplexMatrix g (2, 2); g.elem (0, 0) = cc; g.elem (1, 1) = cc; g.elem (0, 1) = cs; g.elem (1, 0) = -conj (cs); retval(0) = g; } break; case 2: // output scalar values retval(0) = cc; retval(1) = cs; break; default: error ("givens: invalid number of output arguments"); break; } } else { double s, temp_r; F77_FCN (dlartg) (&x, &y, &cc, &s, &temp_r); switch (nargout) { case 0: // output a matrix case 1: { Matrix g (2, 2); g.elem (0, 0) = cc; g.elem (1, 1) = cc; g.elem (0, 1) = s; g.elem (1, 0) = -s; retval(0) = g; } break; case 2: // output scalar values retval(0) = cc; retval(1) = s; break; default: error ("givens: invalid number of output arguments"); break; } } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-hess.cc100666 415 17 5123 5702417102 13421 0ustar jweusers// f-hess.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleHESS.h" #include "CmplxHESS.h" #include "tree-const.h" #include "user-prefs.h" #include "error.h" #include "gripes.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("hess", Fhess, Shess, 2, 2, "[P, H] = hess (A) or H = hess (A): Hessenberg decomposition") { Octave_object retval; int nargin = args.length (); if (nargin != 1 || nargout > 2) { print_usage ("hess"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("hess", nr, nc); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (2, Matrix ()); if (nr != nc) { gripe_square_matrix_required ("hess"); return retval; } if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) { HESS result (tmp); if (nargout == 0 || nargout == 1) { retval.resize (1); retval(0) = result.hess_matrix (); } else { retval.resize (2); retval(0) = result.unitary_hess_matrix (); retval(1) = result.hess_matrix (); } } } else if (arg.is_complex_type ()) { ComplexMatrix ctmp = arg.complex_matrix_value (); if (! error_state) { ComplexHESS result (ctmp); if (nargout == 0 || nargout == 1) { retval.resize (1); retval(0) = result.hess_matrix (); } else { retval.resize (2); retval(0) = result.unitary_hess_matrix (); retval(1) = result.hess_matrix (); } } } else { gripe_wrong_type_arg ("hess", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-ifft.cc100666 415 17 5001 5702417101 13401 0ustar jweusers// f-ifft.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // This function should be merged with Ffft. DEFUN_DLD_BUILTIN ("ifft", Fifft, Sifft, 3, 1, "ifft (X [, N]): inverse fast fourier transform of a vector") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2) { print_usage ("ifft"); return retval; } tree_constant arg = args(0); int n_points = arg.rows (); if (n_points == 1) n_points = arg.columns (); if (nargin == 2) n_points = NINT (args(1).double_value ()); if (error_state) return retval; if (n_points < 0) { error ("ifft: number of points must be greater than zero"); return retval; } int arg_is_empty = empty_arg ("ifft", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty || n_points == 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { if (m.rows () == 1) m.resize (1, n_points, 0.0); else m.resize (n_points, m.columns (), 0.0); retval = m.ifourier (); } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) m.resize (1, n_points, 0.0); else m.resize (n_points, m.columns (), 0.0); retval = m.ifourier (); } } else { gripe_wrong_type_arg ("ifft", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-ifft2.cc100666 415 17 4761 5702417100 13476 0ustar jweusers// f-ifft2.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // This function should be merged with Ffft2. DEFUN_DLD_BUILTIN ("ifft2", Fifft2, Sifft2, 3, 1, "ifft2 (X [, N] [, M])\n\ \n\ two dimensional inverse fast fourier transform of a vector") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 3) { print_usage ("ifft2"); return retval; } tree_constant arg = args(0); int n_rows = arg.rows (); if (nargin > 1) n_rows = NINT (args(1).double_value ()); if (error_state) return retval; int n_cols = arg.columns (); if (nargin > 2) n_cols = NINT (args(2).double_value ()); if (error_state) return retval; if (n_rows < 0 || n_cols < 0) { error ("ifft2: number of points must be greater than zero"); return retval; } int arg_is_empty = empty_arg ("ifft2", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty || n_rows == 0 || n_cols == 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { m.resize (n_rows, n_cols, 0.0); retval = m.ifourier2d (); } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { m.resize (n_rows, n_cols, 0.0); retval = m.ifourier2d (); } } else { gripe_wrong_type_arg ("ifft2", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-inv.cc100666 415 17 5251 5702417077 13270 0ustar jweusers// f-inv.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("inv", Finv, Sinv, 2, 1, "inv (X): inverse of a square matrix") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("inv"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("inverse", nr, nc); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Matrix (); if (nr != nc) { gripe_square_matrix_required ("inverse"); return retval; } if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int info; double rcond = 0.0; Matrix minv = m.inverse (info, rcond); if (info == -1) warning ("inverse: matrix singular to machine precision,\ rcond = %g", rcond); else retval = minv; } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { int info; double rcond = 0.0; ComplexMatrix minv = m.inverse (info, rcond); if (info == -1) warning ("inverse: matrix singular to machine precision,\ rcond = %g", rcond); else retval = minv; } } else { gripe_wrong_type_arg ("inv", arg); } return retval; } // XXX FIXME XXX -- this should really be done with an alias, but // alias_builtin() won't do the right thing if we are actually using // dynamic linking. DEFUN_DLD_BUILTIN ("inverse", Finverse, Sinverse, 2, 1, "inverse (X): inverse of a square matrix") { return Finv (args, nargout); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-log.cc100666 415 17 13140 5702417076 13270 0ustar jweusers// f-log.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "EIG.h" #include "tree-const.h" #include "user-prefs.h" #include "error.h" #include "gripes.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // XXX FIXME XXX -- the next two functions should really be just one... DEFUN_DLD_BUILTIN ("logm", Flogm, Slogm, 2, 1, "logm (X): matrix logarithm") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("logm"); return retval; } tree_constant arg = args(0); int arg_is_empty = empty_arg ("logm", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Matrix (); if (arg.is_real_scalar ()) { double d = arg.double_value (); if (d > 0.0) retval(0) = log (d); else { Complex dtmp (d); retval(0) = log (dtmp); } } else if (arg.is_complex_scalar ()) { Complex c = arg.complex_value (); retval(0) = log (c); } else if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0 || nr != nc) gripe_square_matrix_required ("logm"); else { EIG m_eig (m); ComplexColumnVector lambda (m_eig.eigenvalues ()); ComplexMatrix Q (m_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0 && real (elt) > 0.0) lambda.elem (i) = log (real (elt)); else lambda.elem (i) = log (elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval(0) = result; } } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0 || nr != nc) gripe_square_matrix_required ("logm"); else { EIG m_eig (m); ComplexColumnVector lambda (m_eig.eigenvalues ()); ComplexMatrix Q (m_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0 && real (elt) > 0.0) lambda.elem (i) = log (real (elt)); else lambda.elem (i) = log (elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval(0) = result; } } } else { gripe_wrong_type_arg ("logm", arg); } return retval; } DEFUN_DLD_BUILTIN ("sqrtm", Fsqrtm, Ssqrtm, 2, 1, "sqrtm (X): matrix sqrt") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("sqrtm"); return retval; } tree_constant arg = args(0); int arg_is_empty = empty_arg ("sqrtm", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Matrix (); if (arg.is_real_scalar ()) { double d = arg.double_value (); if (d > 0.0) retval(0) = sqrt (d); else { Complex dtmp (d); retval(0) = sqrt (dtmp); } } else if (arg.is_complex_scalar ()) { Complex c = arg.complex_value (); retval(0) = log (c); } else if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0 || nr != nc) gripe_square_matrix_required ("sqrtm"); else { EIG m_eig (m); ComplexColumnVector lambda (m_eig.eigenvalues ()); ComplexMatrix Q (m_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0 && real (elt) > 0.0) lambda.elem (i) = sqrt (real (elt)); else lambda.elem (i) = sqrt (elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval(0) = result; } } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0 || nr != nc) gripe_square_matrix_required ("sqrtm"); else { EIG m_eig (m); ComplexColumnVector lambda (m_eig.eigenvalues ()); ComplexMatrix Q (m_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0 && real (elt) > 0.0) lambda.elem (i) = sqrt (real (elt)); else lambda.elem (i) = sqrt (elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval(0) = result; } } } else { gripe_wrong_type_arg ("sqrtm", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-lpsolve.cc100666 415 17 3260 5702417075 14154 0ustar jweusers// f-lpsolve.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "LPsolve.h" #include "tree-const.h" #include "error.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("lp_solve", Flp_solve, Slp_solve, 11, 3, "lp_solve (): solve linear programs using lp_solve.") { Octave_object retval; // Force a bad value of inform, and empty matrices for x and phi. Matrix m; retval(2) = -1.0; retval(1) = m; retval(0) = m; error ("lp_solve: not implemented yet"); return retval; } DEFUN_DLD_BUILTIN ("lp_solve_options", Flp_solve_options, Slp_solve_options, -1, 1, "lp_solve_options (KEYWORD, VALUE)\n\ \n\ Set or show options for lp_solve. Keywords may be abbreviated\n\ to the shortest match.") { Octave_object retval; error ("lp_solve_options: not implemented yet"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-lsode.cc100666 415 17 15306 5702417074 13621 0ustar jweusers// f-lsode.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "ODE.h" #include "tree-const.h" #include "variables.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "pager.h" #include "help.h" #include "defun-dld.h" // Global pointer for user defined function required by lsode. static tree_fvc *lsode_fcn; static ODE_options lsode_opts; ColumnVector lsode_user_function (const ColumnVector& x, double t) { ColumnVector retval; int nstates = x.capacity (); Octave_object args; args(1) = t; if (nstates > 1) { Matrix m (nstates, 1); for (int i = 0; i < nstates; i++) m (i, 0) = x.elem (i); tree_constant state (m); args(0) = state; } else { double d = x.elem (0); tree_constant state (d); args(0) = state; } if (lsode_fcn) { Octave_object tmp = lsode_fcn->eval (0, 1, args); if (error_state) { gripe_user_supplied_eval ("lsode"); return retval; } if (tmp.length () > 0 && tmp(0).is_defined ()) { retval = tmp(0).vector_value (); if (error_state || retval.length () == 0) gripe_user_supplied_eval ("lsode"); } else gripe_user_supplied_eval ("lsode"); } return retval; } DEFUN_DLD_BUILTIN ("lsode", Flsode, Slsode, 4, 1, "lsode (F, X0, T_OUT, T_CRIT)\n\ \n\ The first argument is the name of the function to call to\n\ compute the vector of right hand sides. It must have the form\n\ \n\ xdot = f (x, t)\n\ \n\ where xdot and x are vectors and t is a scalar.\n") { Octave_object retval; int nargin = args.length (); if (nargin < 3 || nargin > 4 || nargout > 1) { print_usage ("lsode"); return retval; } lsode_fcn = is_valid_function (args(0), "lsode", 1); if (! lsode_fcn || takes_correct_nargs (lsode_fcn, 2, "lsode", 1) != 1) return retval; ColumnVector state = args(1).vector_value (); if (error_state) { error ("lsode: expecting state vector as second argument"); return retval; } ColumnVector out_times = args(2).vector_value (); if (error_state) { error ("lsode: expecting output time vector as third argument"); return retval; } ColumnVector crit_times; int crit_times_set = 0; if (nargin > 3) { crit_times = args(3).vector_value (); if (error_state) { error ("lsode: expecting critical time vector as fourth argument"); return retval; } crit_times_set = 1; } double tzero = out_times.elem (0); int nsteps = out_times.capacity (); ODEFunc func (lsode_user_function); ODE ode (state, tzero, func); ode.copy (lsode_opts); int nstates = state.capacity (); Matrix output (nsteps, nstates + 1); if (crit_times_set) output = ode.integrate (out_times, crit_times); else output = ode.integrate (out_times); retval.resize (1); retval(0) = output; return retval; } typedef void (ODE_options::*d_set_opt_mf) (double); typedef double (ODE_options::*d_get_opt_mf) (void); #define MAX_TOKENS 3 struct ODE_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; d_get_opt_mf d_get_fcn; }; static ODE_OPTIONS lsode_option_table [] = { { "absolute tolerance", { "absolute", "tolerance", 0, 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_absolute_tolerance, ODE_options::absolute_tolerance, }, { "initial step size", { "initial", "step", "size", 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_initial_step_size, ODE_options::initial_step_size, }, { "maximum step size", { "maximum", "step", "size", 0, }, { 2, 0, 0, 0, }, 1, ODE_options::set_maximum_step_size, ODE_options::maximum_step_size, }, { "minimum step size", { "minimum", "step", "size", 0, }, { 2, 0, 0, 0, }, 1, ODE_options::set_minimum_step_size, ODE_options::minimum_step_size, }, { "relative tolerance", { "relative", "tolerance", 0, 0, }, { 1, 0, 0, 0, }, 1, ODE_options::set_relative_tolerance, ODE_options::relative_tolerance, }, { 0, { 0, 0, 0, 0, }, { 0, 0, 0, 0, }, 0, 0, 0, }, }; static void print_lsode_option_list (void) { ostrstream output_buf; print_usage ("lsode_options", 1); output_buf << "\n" << "Options for lsode include:\n\n" << " keyword value\n" << " ------- -----\n\n"; ODE_OPTIONS *list = lsode_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); double val = (lsode_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_lsode_option (char *keyword, double val) { ODE_OPTIONS *list = lsode_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { (lsode_opts.*list->d_set_fcn) (val); return; } list++; } warning ("lsode_options: no match for `%s'", keyword); } DEFUN_DLD_BUILTIN ("lsode_options", Flsode_options, Slsode_options, -1, 1, "lsode_options (KEYWORD, VALUE)\n\ \n\ Set or show options for lsode. Keywords may be abbreviated\n\ to the shortest match.") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { print_lsode_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_lsode_option (keyword, val); return retval; } } } print_usage ("lsode_options"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-lu.cc100666 415 17 5273 5702417071 13112 0ustar jweusers// f-lu.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleLU.h" #include "CmplxLU.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("lu", Flu, Slu, 2, 3, "[L, U, P] = lu (A): LU factorization") { Octave_object retval; int nargin = args.length (); if (nargin != 1 || nargout > 3) { print_usage ("lu"); return retval; } tree_constant arg = args(0); int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("lu", nr, nc); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (3, Matrix ()); if (nr != nc) { gripe_square_matrix_required ("lu"); return retval; } if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { LU fact (m); switch (nargout) { case 0: case 1: case 2: { Matrix P = fact.P (); Matrix L = P.transpose () * fact.L (); retval(1) = fact.U (); retval(0) = L; } break; case 3: default: retval(2) = fact.P (); retval(1) = fact.U (); retval(0) = fact.L (); break; } } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { ComplexLU fact (m); switch (nargout) { case 0: case 1: case 2: { ComplexMatrix P = fact.P (); ComplexMatrix L = P.transpose () * fact.L (); retval(1) = fact.U (); retval(0) = L; } break; case 3: default: retval(2) = fact.P (); retval(1) = fact.U (); retval(0) = fact.L (); break; } } } else { gripe_wrong_type_arg ("lu", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-minmax.cc100666 415 17 37013 5702417047 14003 0ustar jweusers// f-minmax.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "tree-const.h" #include "error.h" #include "gripes.h" #include "help.h" #include "defun-dld.h" #ifndef MAX #define MAX(a,b) ((a) > (b) ? (a) : (b)) #endif #ifndef MIN #define MIN(a,b) ((a) < (b) ? (a) : (b)) #endif // XXX FIXME XXX -- it would be nice to share code among the min/max // functions below. static Matrix min (double d, const Matrix& m) { int nr = m.rows (); int nc = m.columns (); Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double m_elem = m.elem (i, j); result.elem (i, j) = MIN (d, m_elem); } return result; } static Matrix min (const Matrix& m, double d) { int nr = m.rows (); int nc = m.columns (); Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double m_elem = m.elem (i, j); result.elem (i, j) = MIN (m_elem, d); } return result; } static ComplexMatrix min (const Complex& c, const ComplexMatrix& m) { int nr = m.rows (); int nc = m.columns (); ComplexMatrix result (nr, nc); double abs_c = abs (c); for (int j = 0; j < nc; j++) { for (int i = 0; i < nr; i++) { double abs_m_elem = abs (m.elem (i, j)); if (abs_c < abs_m_elem) result.elem (i, j) = c; else result.elem (i, j) = m.elem (i, j); } } return result; } static ComplexMatrix min (const ComplexMatrix& m, const Complex& c) { int nr = m.rows (); int nc = m.columns (); ComplexMatrix result (nr, nc); double abs_c = abs (c); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double abs_m_elem = abs (m.elem (i, j)); if (abs_m_elem < abs_c) result.elem (i, j) = m.elem (i, j); else result.elem (i, j) = c; } return result; } static Matrix min (const Matrix& a, const Matrix& b) { int nr = a.rows (); int nc = a.columns (); if (nr != b.rows () || nc != b.columns ()) { error ("two-arg min expecting args of same size"); return Matrix (); } Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double a_elem = a.elem (i, j); double b_elem = b.elem (i, j); result.elem (i, j) = MIN (a_elem, b_elem); } return result; } static ComplexMatrix min (const ComplexMatrix& a, const ComplexMatrix& b) { int nr = a.rows (); int nc = a.columns (); if (nr != b.rows () || nc != b.columns ()) { error ("two-arg min expecting args of same size"); return ComplexMatrix (); } ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) { int columns_are_real_only = 1; for (int i = 0; i < nr; i++) if (imag (a.elem (i, j)) != 0.0 && imag (b.elem (i, j)) != 0.0) { columns_are_real_only = 0; break; } if (columns_are_real_only) { for (int i = 0; i < nr; i++) { double a_elem = real (a.elem (i, j)); double b_elem = real (b.elem (i, j)); if (a_elem < b_elem) result.elem (i, j) = a_elem; else result.elem (i, j) = b_elem; } } else { for (int i = 0; i < nr; i++) { double abs_a_elem = abs (a.elem (i, j)); double abs_b_elem = abs (b.elem (i, j)); if (abs_a_elem < abs_b_elem) result.elem (i, j) = a.elem (i, j); else result.elem (i, j) = b.elem (i, j); } } } return result; } static Matrix max (double d, const Matrix& m) { int nr = m.rows (); int nc = m.columns (); Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double m_elem = m.elem (i, j); result.elem (i, j) = MAX (d, m_elem); } return result; } static Matrix max (const Matrix& m, double d) { int nr = m.rows (); int nc = m.columns (); Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double m_elem = m.elem (i, j); result.elem (i, j) = MAX (m_elem, d); } return result; } static ComplexMatrix max (const Complex& c, const ComplexMatrix& m) { int nr = m.rows (); int nc = m.columns (); ComplexMatrix result (nr, nc); double abs_c = abs (c); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double abs_m_elem = abs (m.elem (i, j)); if (abs_c > abs_m_elem) result.elem (i, j) = c; else result.elem (i, j) = m.elem (i, j); } return result; } static ComplexMatrix max (const ComplexMatrix& m, const Complex& c) { int nr = m.rows (); int nc = m.columns (); ComplexMatrix result (nr, nc); double abs_c = abs (c); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double abs_m_elem = abs (m.elem (i, j)); if (abs_m_elem > abs_c) result.elem (i, j) = m.elem (i, j); else result.elem (i, j) = c; } return result; } static Matrix max (const Matrix& a, const Matrix& b) { int nr = a.rows (); int nc = a.columns (); if (nr != b.rows () || nc != b.columns ()) { error ("two-arg max expecting args of same size"); return Matrix (); } Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double a_elem = a.elem (i, j); double b_elem = b.elem (i, j); result.elem (i, j) = MAX (a_elem, b_elem); } return result; } static ComplexMatrix max (const ComplexMatrix& a, const ComplexMatrix& b) { int nr = a.rows (); int nc = a.columns (); if (nr != b.rows () || nc != b.columns ()) { error ("two-arg max expecting args of same size"); return ComplexMatrix (); } ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) { int columns_are_real_only = 1; for (int i = 0; i < nr; i++) if (imag (a.elem (i, j)) != 0.0 && imag (b.elem (i, j)) != 0.0) { columns_are_real_only = 0; break; } if (columns_are_real_only) { for (int i = 0; i < nr; i++) { double a_elem = real (a.elem (i, j)); double b_elem = real (b.elem (i, j)); if (a_elem > b_elem) result.elem (i, j) = a_elem; else result.elem (i, j) = b_elem; } } else { for (int i = 0; i < nr; i++) { double abs_a_elem = abs (a.elem (i, j)); double abs_b_elem = abs (b.elem (i, j)); if (abs_a_elem > abs_b_elem) result.elem (i, j) = a.elem (i, j); else result.elem (i, j) = b.elem (i, j); } } } return result; } DEFUN_DLD_BUILTIN ("min", Fmin, Smin, 3, 2, "min (X): minimum value(s) of a vector (matrix)") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2 || nargout > 2) { print_usage ("min"); return retval; } tree_constant arg1; tree_constant arg2; switch (nargin) { case 2: arg2 = args(1); // Fall through... case 1: arg1 = args(0); break; default: panic_impossible (); break; } if (nargin == 1 && (nargout == 1 || nargout == 0)) { if (arg1.is_real_scalar ()) { retval(0) = arg1.double_value (); } else if (arg1.is_complex_scalar ()) { retval(0) = arg1.complex_value (); } else if (arg1.is_real_type ()) { Matrix m = arg1.matrix_value (); if (! error_state) { if (m.rows () == 1) retval(0) = m.row_min (); else retval(0) = tree_constant (m.column_min (), 0); } } else if (arg1.is_complex_type ()) { ComplexMatrix m = arg1.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) retval(0) = m.row_min (); else retval(0) = tree_constant (m.column_min (), 0); } } else { gripe_wrong_type_arg ("min", arg1); return retval; } } else if (nargin == 1 && nargout == 2) { if (arg1.is_real_scalar ()) { retval(1) = 1; retval(0) = arg1.double_value (); } else if (arg1.is_complex_scalar ()) { retval(1) = 1; retval(0) = arg1.complex_value (); } else if (arg1.is_real_type ()) { Matrix m = arg1.matrix_value (); if (! error_state) { if (m.rows () == 1) { retval(1) = m.row_min_loc (); retval(0) = m.row_min (); } else { retval(1) = tree_constant (m.column_min_loc (), 0); retval(0) = tree_constant (m.column_min (), 0); } } } else if (arg1.is_complex_type ()) { ComplexMatrix m = arg1.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) { retval(1) = m.row_min_loc (); retval(0) = m.row_min (); } else { retval(1) = tree_constant (m.column_min_loc (), 0); retval(0) = tree_constant (m.column_min (), 0); } } } else { gripe_wrong_type_arg ("min", arg1); return retval; } } else if (nargin == 2) { int arg1_is_scalar = arg1.is_scalar_type (); int arg2_is_scalar = arg2.is_scalar_type (); int arg1_is_complex = arg1.is_complex_type (); int arg2_is_complex = arg2.is_complex_type (); if (arg1_is_scalar) { if (arg1_is_complex || arg2_is_complex) { Complex c1 = arg1.complex_value (); ComplexMatrix m2 = arg2.complex_matrix_value (); if (! error_state) { ComplexMatrix result = min (c1, m2); if (! error_state) retval(0) = result; } } else { double d1 = arg1.double_value (); Matrix m2 = arg2.matrix_value (); if (! error_state) { Matrix result = min (d1, m2); if (! error_state) retval(0) = result; } } } else if (arg2_is_scalar) { if (arg1_is_complex || arg2_is_complex) { ComplexMatrix m1 = arg1.complex_matrix_value (); if (! error_state) { Complex c2 = arg2.complex_value (); ComplexMatrix result = min (m1, c2); if (! error_state) retval(0) = result; } } else { Matrix m1 = arg1.matrix_value (); if (! error_state) { double d2 = arg2.double_value (); Matrix result = min (m1, d2); if (! error_state) retval(0) = result; } } } else { if (arg1_is_complex || arg2_is_complex) { ComplexMatrix m1 = arg1.complex_matrix_value (); if (! error_state) { ComplexMatrix m2 = arg2.complex_matrix_value (); if (! error_state) { ComplexMatrix result = min (m1, m2); if (! error_state) retval(0) = result; } } } else { Matrix m1 = arg1.matrix_value (); if (! error_state) { Matrix m2 = arg2.matrix_value (); if (! error_state) { Matrix result = min (m1, m2); if (! error_state) retval(0) = result; } } } } } else panic_impossible (); return retval; } DEFUN_DLD_BUILTIN ("max", Fmax, Smax, 3, 2, "max (X): maximum value(s) of a vector (matrix)") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2 || nargout > 2) { print_usage ("max"); return retval; } tree_constant arg1; tree_constant arg2; switch (nargin) { case 2: arg2 = args(1); // Fall through... case 1: arg1 = args(0); break; default: panic_impossible (); break; } if (nargin == 1 && (nargout == 1 || nargout == 0)) { if (arg1.is_real_scalar ()) { retval(0) = arg1.double_value (); } else if (arg1.is_complex_scalar ()) { retval(0) = arg1.complex_value (); } else if (arg1.is_real_type ()) { Matrix m = arg1.matrix_value (); if (! error_state) { if (m.rows () == 1) retval(0) = m.row_max (); else retval(0) = tree_constant (m.column_max (), 0); } } else if (arg1.is_complex_type ()) { ComplexMatrix m = arg1.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) retval(0) = m.row_max (); else retval(0) = tree_constant (m.column_max (), 0); } } else { gripe_wrong_type_arg ("max", arg1); return retval; } } else if (nargin == 1 && nargout == 2) { if (arg1.is_real_scalar ()) { retval(1) = 1; retval(0) = arg1.double_value (); } else if (arg1.is_complex_scalar ()) { retval(1) = 1; retval(0) = arg1.complex_value (); } else if (arg1.is_real_type ()) { Matrix m = arg1.matrix_value (); if (! error_state) { if (m.rows () == 1) { retval(1) = m.row_max_loc (); retval(0) = m.row_max (); } else { retval(1) = tree_constant (m.column_max_loc (), 0); retval(0) = tree_constant (m.column_max (), 0); } } } else if (arg1.is_complex_type ()) { ComplexMatrix m = arg1.complex_matrix_value (); if (! error_state) { if (m.rows () == 1) { retval(1) = m.row_max_loc (); retval(0) = m.row_max (); } else { retval(1) = tree_constant (m.column_max_loc (), 0); retval(0) = tree_constant (m.column_max (), 0); } } } else { gripe_wrong_type_arg ("max", arg1); return retval; } } else if (nargin == 2) { int arg1_is_scalar = arg1.is_scalar_type (); int arg2_is_scalar = arg2.is_scalar_type (); int arg1_is_complex = arg1.is_complex_type (); int arg2_is_complex = arg2.is_complex_type (); if (arg1_is_scalar) { if (arg1_is_complex || arg2_is_complex) { Complex c1 = arg1.complex_value (); ComplexMatrix m2 = arg2.complex_matrix_value (); if (! error_state) { ComplexMatrix result = max (c1, m2); if (! error_state) retval(0) = result; } } else { double d1 = arg1.double_value (); Matrix m2 = arg2.matrix_value (); if (! error_state) { Matrix result = max (d1, m2); if (! error_state) retval(0) = result; } } } else if (arg2_is_scalar) { if (arg1_is_complex || arg2_is_complex) { ComplexMatrix m1 = arg1.complex_matrix_value (); if (! error_state) { Complex c2 = arg2.complex_value (); ComplexMatrix result = max (m1, c2); if (! error_state) retval(0) = result; } } else { Matrix m1 = arg1.matrix_value (); if (! error_state) { double d2 = arg2.double_value (); Matrix result = max (m1, d2); if (! error_state) retval(0) = result; } } } else { if (arg1_is_complex || arg2_is_complex) { ComplexMatrix m1 = arg1.complex_matrix_value (); if (! error_state) { ComplexMatrix m2 = arg2.complex_matrix_value (); if (! error_state) { ComplexMatrix result = max (m1, m2); if (! error_state) retval(0) = result; } } } else { Matrix m1 = arg1.matrix_value (); if (! error_state) { Matrix m2 = arg2.matrix_value (); if (! error_state) { Matrix result = max (m1, m2); if (! error_state) retval(0) = result; } } } } } else panic_impossible (); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-npsol.cc100666 415 17 46054 5702417046 13651 0ustar jweusers// f-npsol.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "NPSOL.h" #include "tree-const.h" #include "variables.h" #include "gripes.h" #include "error.h" #include "pager.h" #include "utils.h" #include "help.h" #include "defun-dld.h" #ifndef NPSOL_MISSING // Global pointers for user defined functions required by npsol. static tree_fvc *npsol_objective; static tree_fvc *npsol_constraints; static NPSOL_options npsol_opts; double npsol_objective_function (const ColumnVector& x) { int n = x.capacity (); tree_constant decision_vars; if (n > 1) { Matrix m (n, 1); for (int i = 0; i < n; i++) m (i, 0) = x.elem (i); decision_vars = m; } else { double d = x.elem (0); decision_vars = d; } Octave_object args; args(0) = decision_vars; static double retval; retval = 0.0; tree_constant objective_value; if (npsol_objective) { Octave_object tmp = npsol_objective->eval (0, 1, args); if (error_state) { error ("npsol: error evaluating objective function"); npsol_objective_error = 1; // XXX FIXME XXX return retval; } if (tmp.length () > 0 && tmp(0).is_defined ()) objective_value = tmp(0); else { error ("npsol: error evaluating objective function"); npsol_objective_error = 1; // XXX FIXME XXX return retval; } } if (objective_value.is_real_matrix ()) { Matrix m = objective_value.matrix_value (); if (m.rows () == 1 && m.columns () == 1) retval = m.elem (0, 0); else { gripe_user_returned_invalid ("npsol_objective"); npsol_objective_error = 1; // XXX FIXME XXX } } else if (objective_value.is_real_scalar ()) { retval = objective_value.double_value (); } else { gripe_user_returned_invalid ("npsol_objective"); npsol_objective_error = 1; // XXX FIXME XXX } return retval; } ColumnVector npsol_constraint_function (const ColumnVector& x) { ColumnVector retval; int n = x.capacity (); tree_constant decision_vars; if (n > 1) { Matrix m (n, 1); for (int i = 0; i < n; i++) m (i, 0) = x.elem (i); decision_vars = m; } else { double d = x.elem (0); decision_vars = d; } Octave_object args; args(0) = decision_vars; if (npsol_constraints) { Octave_object tmp = npsol_constraints->eval (0, 1, args); if (error_state) { error ("npsol: error evaluating constraints"); return retval; } if (tmp.length () > 0 && tmp(0).is_defined ()) { retval = tmp(0).vector_value (); if (error_state || retval.length () <= 0) error ("npsol: error evaluating constraints"); } else error ("npsol: error evaluating constraints"); } return retval; } int linear_constraints_ok (const ColumnVector& x, const ColumnVector& llb, const Matrix& c, const ColumnVector& lub, char *warn_for, int warn) { int x_len = x.capacity (); int llb_len = llb.capacity (); int lub_len = lub.capacity (); int c_rows = c.rows (); int c_cols = c.columns (); int ok = 1; if (warn) { if (c_rows == 0 || c_cols == 0 || llb_len == 0 || lub_len == 0) { ok = 0; error ("%s: linear constraints must have nonzero dimensions", warn_for); } else if (x_len != c_cols || llb_len != lub_len || llb_len != c_rows) { ok = 0; error ("%s: linear constraints have inconsistent dimensions", warn_for); } } return ok; } int nonlinear_constraints_ok (const ColumnVector& x, const ColumnVector& nllb, nonlinear_fcn g, const ColumnVector& nlub, char *warn_for, int warn) { int nllb_len = nllb.capacity (); int nlub_len = nlub.capacity (); ColumnVector c = (*g) (x); int c_len = c.capacity (); int ok = 1; if (warn) { if (nllb_len == 0 || nlub_len == 0 || c_len == 0) { ok = 0; error ("%s: nonlinear constraints have nonzero dimensions", warn_for); } else if (nllb_len != nlub_len || nllb_len != c_len) { ok = 0; error ("%s: nonlinear constraints have inconsistent dimensions", warn_for); } } return ok; } #endif #if defined (NPSOL_MISSING) DEFUN_DLD_BUILTIN ("npsol", Fnpsol, Snpsol, 10, 4, "This function requires NPSOL, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/npsol/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("npsol", Fnpsol, Snpsol, 10, 4, "[X, OBJ, INFO, LAMBDA] = npsol (X, PHI [, LB, UB] [, LB, A, UB] [, LB, G, UB])\n\ \n\ Groups of arguments surrounded in `[]' are optional, but\n\ must appear in the same relative order shown above.\n\ \n\ The second argument is a string containing the name of the objective\n\ function to call. The objective function must be of the form\n\ \n\ y = phi (x)\n\ \n\ where x is a vector and y is a scalar.\n\ \n\ The argument G is a string containing the name of the function that defines the nonlinear constraints. It must be of the form\n\ \n\ y = g (x)\n\ \n\ where x is a vector and y is a vector.") #endif { /* Handle all of the following: 1. npsol (x, phi) 2. npsol (x, phi, lb, ub) 3. npsol (x, phi, lb, ub, llb, c, lub) 4. npsol (x, phi, lb, ub, llb, c, lub, nllb, g, nlub) 5. npsol (x, phi, lb, ub, nllb, g, nlub) 6. npsol (x, phi, llb, c, lub, nllb, g, nlub) 7. npsol (x, phi, llb, c, lub) 8. npsol (x, phi, nllb, g, nlub) */ Octave_object retval; #if defined (NPSOL_MISSING) // Force a bad value of inform, and empty matrices for x, phi, and lambda. retval.resize (4, Matrix ()); retval(2) = -1.0; print_usage ("npsol"); #else int nargin = args.length (); if (nargin < 2 || nargin == 3 || nargin == 6 || nargin == 9 || nargin > 10 || nargout > 4) { print_usage ("npsol"); return retval; } ColumnVector x = args(0).vector_value (); if (error_state || x.capacity () == 0) { error ("npsol: expecting vector as first argument"); return retval; } npsol_objective = is_valid_function (args(1), "npsol", 1); if (! npsol_objective || takes_correct_nargs (npsol_objective, 1, "npsol", 1) != 1) return retval; Objective func (npsol_objective_function); ColumnVector soln; Bounds bounds; if (nargin == 4 || nargin == 7 || nargin == 10) { ColumnVector lb = args(2).vector_value (); ColumnVector ub = args(3).vector_value (); int lb_len = lb.capacity (); int ub_len = ub.capacity (); if (error_state || lb_len != ub_len || lb_len != x.capacity ()) { error ("npsol: lower and upper bounds and decision variable vector"); error ("must all have the same number of elements"); return retval; } bounds.resize (lb_len); bounds.set_lower_bounds (lb); bounds.set_upper_bounds (ub); } double objf; ColumnVector lambda; int inform; if (nargin == 2) { // 1. npsol (x, phi) NPSOL nlp (x, func); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); goto solved; } if (nargin == 4) { // 2. npsol (x, phi, lb, ub) NPSOL nlp (x, func, bounds); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); goto solved; } npsol_constraints = 0; if (nargin == 5 || nargin == 7 || nargin == 8 || nargin == 10) npsol_constraints = is_valid_function (args(nargin-2), "npsol", 0); if (nargin == 7 || nargin == 5) { if (! npsol_constraints) { ColumnVector lub = args(nargin-1).vector_value (); ColumnVector llb = args(nargin-3).vector_value (); if (error_state || llb.capacity () == 0 || lub.capacity () == 0) { error ("npsol: bounds for linear constraints must be vectors"); return retval; } Matrix c = args(nargin-2).matrix_value (); if (error_state) { error ("npsol: invalid linear constraint matrix"); return retval; } if (! linear_constraints_ok (x, llb, c, lub, "npsol", 1)) return retval; LinConst linear_constraints (llb, c, lub); if (nargin == 5) { // 7. npsol (x, phi, llb, c, lub) NPSOL nlp (x, func, linear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } else { // 3. npsol (x, phi, lb, ub, llb, c, lub) NPSOL nlp (x, func, bounds, linear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } goto solved; } else { if (takes_correct_nargs (npsol_constraints, 1, "npsol", 1)) { ColumnVector nlub = args(nargin-1).vector_value (); ColumnVector nllb = args(nargin-3).vector_value (); if (error_state || (! nonlinear_constraints_ok (x, nllb, npsol_constraint_function, nlub, "npsol", 1))) return retval; NLFunc const_func (npsol_constraint_function); NLConst nonlinear_constraints (nllb, const_func, nlub); if (nargin == 5) { // 8. npsol (x, phi, nllb, g, nlub) NPSOL nlp (x, func, nonlinear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } else { // 5. npsol (x, phi, lb, ub, nllb, g, nlub) NPSOL nlp (x, func, bounds, nonlinear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } goto solved; } } } if (nargin == 8 || nargin == 10) { if (! npsol_constraints) { // Produce error message. is_valid_function (args(nargin-2), "npsol", 1); } else { if (takes_correct_nargs (npsol_constraints, 1, "npsol", 1)) { ColumnVector nlub = args(nargin-1).vector_value (); ColumnVector nllb = args(nargin-3).vector_value (); if (error_state || (! nonlinear_constraints_ok (x, nllb, npsol_constraint_function, nlub, "npsol", 1))) return retval; NLFunc const_func (npsol_constraint_function); NLConst nonlinear_constraints (nllb, const_func, nlub); ColumnVector lub = args(nargin-4).vector_value (); ColumnVector llb = args(nargin-6).vector_value (); if (error_state || llb.capacity () == 0 || lub.capacity () == 0) { error ("npsol: bounds for linear constraints must be vectors"); return retval; } Matrix c = args(nargin-5).matrix_value (); if (error_state) { error ("npsol: invalid linear constraint matrix"); return retval; } if (! linear_constraints_ok (x, llb, c, lub, "npsol", 1)) return retval; LinConst linear_constraints (llb, c, lub); if (nargin == 8) { // 6. npsol (x, phi, llb, c, lub, nllb, g, nlub) NPSOL nlp (x, func, linear_constraints, nonlinear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } else { // 4. npsol (x, phi, lb, ub, llb, c, lub, nllb, g, nlub) NPSOL nlp (x, func, bounds, linear_constraints, nonlinear_constraints); nlp.copy (npsol_opts); soln = nlp.minimize (objf, inform, lambda); } goto solved; } } } return retval; solved: retval.resize (nargout ? nargout : 1); retval(0) = soln, 1; if (nargout > 1) retval(1) = objf; if (nargout > 2) retval(2) = (double) inform; if (nargout > 3) retval(3) = lambda; #endif return retval; } #ifndef NPSOL_MISSING typedef void (NPSOL_options::*d_set_opt_mf) (double); typedef void (NPSOL_options::*i_set_opt_mf) (int); typedef double (NPSOL_options::*d_get_opt_mf) (void); typedef int (NPSOL_options::*i_get_opt_mf) (void); #define MAX_TOKENS 5 struct NPSOL_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; i_set_opt_mf i_set_fcn; d_get_opt_mf d_get_fcn; i_get_opt_mf i_get_fcn; }; static NPSOL_OPTIONS npsol_option_table [] = { { "central difference interval", { "central", "difference", "interval", 0, 0, 0, }, { 2, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_central_difference_interval, 0, NPSOL_options::central_difference_interval, 0, }, { "crash tolerance", { "crash", "tolerance", 0, 0, 0, 0, }, { 2, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_crash_tolerance, 0, NPSOL_options::crash_tolerance, 0, }, { "derivative level", { "derivative", "level", 0, 0, 0, 0, }, { 1, 0, 0, 0, 0, 0, }, 1, 0, NPSOL_options::set_derivative_level, 0, NPSOL_options::derivative_level, }, { "difference interval", { "difference", "interval", 0, 0, 0, 0, }, { 3, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_difference_interval, 0, NPSOL_options::difference_interval, 0, }, { "function precision", { "function", "precision", 0, 0, 0, 0, }, { 2, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_function_precision, 0, NPSOL_options::function_precision, 0, }, { "infinite bound size", { "infinite", "bound", "size", 0, 0, 0, }, { 1, 1, 0, 0, 0, 0, }, 2, NPSOL_options::set_infinite_bound, 0, NPSOL_options::infinite_bound, 0, }, { "infinite step size", { "infinite", "step", "size", 0, 0, 0, }, { 1, 1, 0, 0, 0, 0, }, 2, NPSOL_options::set_infinite_step, 0, NPSOL_options::infinite_step, 0, }, { "linear feasibility tolerance", { "linear", "feasibility", "tolerance", 0, 0, 0, }, { 5, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_linear_feasibility_tolerance, 0, NPSOL_options::linear_feasibility_tolerance, 0, }, { "linesearch tolerance", { "linesearch", "tolerance", 0, 0, 0, 0, }, { 5, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_linesearch_tolerance, 0, NPSOL_options::linesearch_tolerance, 0, }, { "major iteration limit", { "major", "iteration", "limit", 0, 0, 0, }, { 2, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_major_iteration_limit, 0, NPSOL_options::major_iteration_limit, }, { "minor iteration limit", { "minor", "iteration", "limit", 0, 0, 0, }, { 2, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_minor_iteration_limit, 0, NPSOL_options::minor_iteration_limit, }, { "major print level", { "major", "print", "level", 0, 0, 0, }, { 2, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_major_print_level, 0, NPSOL_options::major_print_level, }, { "minor print level", { "minor", "print", "level", 0, 0, 0, }, { 2, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_minor_print_level, 0, NPSOL_options::minor_print_level, }, { "nonlinear feasibility tolerance", { "nonlinear", "feasibility", "tolerance", 0, 0, }, { 1, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_nonlinear_feasibility_tolerance, 0, NPSOL_options::nonlinear_feasibility_tolerance, 0, }, { "optimality tolerance", { "optimality", "tolerance", 0, 0, 0, 0, }, { 1, 0, 0, 0, 0, 0, }, 1, NPSOL_options::set_optimality_tolerance, 0, NPSOL_options::optimality_tolerance, 0, }, { "start objective check at variable", { "start", "objective", "check", "at", "variable", 0, }, { 3, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_start_objective_check, 0, NPSOL_options::start_objective_check, }, { "start constraint check at variable", { "start", "constraint", "check", "at", "variable", 0, }, { 3, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_start_constraint_check, 0, NPSOL_options::start_constraint_check, }, { "stop objective check at variable", { "stop", "objective", "check", "at", "variable", 0, }, { 3, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_stop_objective_check, 0, NPSOL_options::stop_objective_check, }, { "stop constraint check at variable", { "stop", "constraint", "check", "at", "variable", 0, }, { 3, 1, 0, 0, 0, 0, }, 2, 0, NPSOL_options::set_stop_constraint_check, 0, NPSOL_options::stop_constraint_check, }, { "verify level", { "verify", "level", 0, 0, 0, 0, }, { 1, 0, 0, 0, 0, 0, }, 1, 0, NPSOL_options::set_verify_level, 0, NPSOL_options::verify_level, }, { 0, { 0, 0, 0, 0, 0, 0, }, { 0, 0, 0, 0, 0, 0, }, 0, 0, 0, 0, 0, }, }; static void print_npsol_option_list (void) { ostrstream output_buf; print_usage ("npsol_options", 1); output_buf << "\n" << "Options for npsol include:\n\n" << " keyword value\n" << " ------- -----\n\n"; NPSOL_OPTIONS *list = npsol_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); if (list->d_get_fcn) { double val = (npsol_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; } else { int val = (npsol_opts.*list->i_get_fcn) (); if (val < 0) output_buf << "depends on problem size"; else output_buf << val; } output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_npsol_option (char *keyword, double val) { NPSOL_OPTIONS *list = npsol_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { if (list->d_set_fcn) (npsol_opts.*list->d_set_fcn) (val); else (npsol_opts.*list->i_set_fcn) (NINT (val)); return; } list++; } warning ("npsol_options: no match for `%s'", keyword); } #endif #if defined (NPSOL_MISSING) DEFUN_DLD_BUILTIN ("npsol_options", Fnpsol_options, Snpsol_options, -1, 1, "This function requires NPSOL, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/npsol/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("npsol_options", Fnpsol_options, Snpsol_options, -1, 1, "npsol_options (KEYWORD, VALUE)\n\ \n\ Set or show options for npsol. Keywords may be abbreviated\n\ to the shortest match.") #endif { Octave_object retval; #if defined (NPSOL_MISSING) print_usage ("npsol_options"); #else int nargin = args.length (); if (nargin == 0) { print_npsol_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_npsol_option (keyword, val); return retval; } } } print_usage ("npsol_options"); #endif return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-pinv.cc100666 415 17 4252 5702417045 13443 0ustar jweusers// f-pinv.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("pinv", Fpinv, Spinv, 3, 1, "pinv ( [, tol])\n\ Returns the pseudoinverse of X; singular values less than tol are ignored.") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2) { print_usage ("pinv"); return retval; } tree_constant arg = args(0); double tol = 0.0; if (nargin == 2) tol = args(1).double_value (); if (error_state) return retval; if (tol < 0.0) { error ("pinv: tol must be greater than zero"); return retval; } int arg_is_empty = empty_arg ("pinv", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Matrix (); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) retval = m.pseudo_inverse (tol); } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) retval = m.pseudo_inverse (tol); } else { gripe_wrong_type_arg ("pinv", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-qpsol.cc100666 415 17 21641 5702417044 13645 0ustar jweusers// f-qpsol.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "QPSOL.h" #include "tree-const.h" #include "variables.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "pager.h" #include "help.h" #include "defun-dld.h" #ifndef QPSOL_MISSING // This should probably be defined in some shared file and declared in // a header file... extern int linear_constraints_ok (const ColumnVector& x, const ColumnVector& llb, const Matrix& c, const ColumnVector& lub, char *warn_for, int warn); static QPSOL_options qpsol_opts; #endif #if defined (QPSOL_MISSING) DEFUN_DLD_BUILTIN ("qpsol", Fqpsol, Sqpsol, 9, 3, "This function requires QPSOL, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/qpsol/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("qpsol", Fqpsol, Sqpsol, 9, 3, "[X, OBJ, INFO, LAMBDA] = qpsol (X, H, C [, LB, UB] [, LB, A, UB])\n\ \n\ Groups of arguments surrounded in `[]' are optional, but\n\ must appear in the same relative order shown above.") #endif { /* Handle all of the following: 1. qpsol (x, H, c) 2. qpsol (x, H, c, lb, ub) 3. qpsol (x, H, c, lb, ub, llb, A, lub) 4. qpsol (x, H, c, llb, A, lub) */ Octave_object retval; #if defined (QPSOL_MISSING) // Force a bad value of inform, and empty matrices for x, phi, and lambda. retval.resize (4, Matrix ()); retval(2) = -1.0; print_usage ("qpsol"); #else int nargin = args.length (); if (nargin < 3 || nargin == 4 || nargin == 7 || nargin > 8 || nargout > 4) { print_usage ("qpsol"); return retval; } ColumnVector x = args(0).vector_value (); if (error_state || x.capacity () == 0) { error ("qpsol: expecting vector as first argument"); return retval; } Matrix H = args(1).matrix_value (); if (error_state || H.rows () != H.columns () || H.rows () != x.capacity ()) { error ("qpsol: H must be a square matrix consistent with the size of x"); return retval; } ColumnVector c = args(2).vector_value (); if (error_state || c.capacity () != x.capacity ()) { error ("qpsol: c must be a vector the same size as x"); return retval; } Bounds bounds; if (nargin == 5 || nargin == 8) { ColumnVector lb = args(3).vector_value (); ColumnVector ub = args(4).vector_value (); int lb_len = lb.capacity (); int ub_len = ub.capacity (); if (error_state || lb_len != ub_len || lb_len != x.capacity ()) { error ("qpsol: lower and upper bounds and decision variable vector"); error ("must all have the same number of elements"); return retval; } bounds.resize (lb_len); bounds.set_lower_bounds (lb); bounds.set_upper_bounds (ub); } ColumnVector soln; double objf; ColumnVector lambda; int inform; if (nargin == 3) { // 1. qpsol (x, H, c) QPSOL qp (x, H, c); qp.copy (qpsol_opts); soln = qp.minimize (objf, inform, lambda); goto solved; } if (nargin == 5) { // 2. qpsol (x, H, c, lb, ub) QPSOL qp (x, H, c, bounds); qp.copy (qpsol_opts); soln = qp.minimize (objf, inform, lambda); goto solved; } if (nargin == 6 || nargin == 8) { ColumnVector lub = args(nargin-1).vector_value (); ColumnVector llb = args(nargin-3).vector_value (); if (error_state || llb.capacity () == 0 || lub.capacity () == 0) { error ("qpsol: bounds for linear constraints must be vectors"); return retval; } Matrix A = args(nargin-2).matrix_value (); if (error_state) { error ("qpsol: invalid linear constraint matrix"); return retval; } if (! linear_constraints_ok (x, llb, A, lub, "qpsol", 1)) return retval; LinConst linear_constraints (llb, A, lub); if (nargin == 8) { // 3. qpsol (x, H, c, lb, ub, llb, A, lub) QPSOL qp (x, H, c, bounds, linear_constraints); qp.copy (qpsol_opts); soln = qp.minimize (objf, inform, lambda); } else { // 4. qpsol (x, H, c, llb, A, lub) QPSOL qp (x, H, c, linear_constraints); qp.copy (qpsol_opts); soln = qp.minimize (objf, inform, lambda); } goto solved; } return retval; solved: retval.resize (nargout ? nargout : 1); retval(0) = soln, 1; if (nargout > 1) retval(1) = objf; if (nargout > 2) retval(2) = (double) inform; if (nargout > 3) retval(3) = lambda; #endif return retval; } #ifndef QPSOL_MISSING typedef void (QPSOL_options::*d_set_opt_mf) (double); typedef void (QPSOL_options::*i_set_opt_mf) (int); typedef double (QPSOL_options::*d_get_opt_mf) (void); typedef int (QPSOL_options::*i_get_opt_mf) (void); #define MAX_TOKENS 2 struct QPSOL_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; i_set_opt_mf i_set_fcn; d_get_opt_mf d_get_fcn; i_get_opt_mf i_get_fcn; }; static QPSOL_OPTIONS qpsol_option_table [] = { { "feasibility tolerance", { "feasibility", "tolerance", 0, }, { 1, 0, 0, }, 1, QPSOL_options::set_feasibility_tolerance, 0, QPSOL_options::feasibility_tolerance, 0, }, { "infinite bound", { "infinite", "bound", 0, }, { 2, 0, 0, }, 1, QPSOL_options::set_infinite_bound, 0, QPSOL_options::infinite_bound, 0, }, { "iteration limit", { "iteration", "limit", 0, }, { 2, 0, 0, }, 1, 0, QPSOL_options::set_iteration_limit, 0, QPSOL_options::iteration_limit, }, { "print level", { "print", "level", 0, }, { 1, 0, 0, }, 1, 0, QPSOL_options::set_print_level, 0, QPSOL_options::print_level, }, { 0, { 0, 0, 0, }, { 0, 0, 0, }, 0, 0, 0, 0, 0, }, }; static void print_qpsol_option_list (void) { ostrstream output_buf; print_usage ("qpsol_options", 1); output_buf << "\n" << "Options for qpsol include:\n\n" << " keyword value\n" << " ------- -----\n\n"; QPSOL_OPTIONS *list = qpsol_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); if (list->d_get_fcn) { double val = (qpsol_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; } else { int val = (qpsol_opts.*list->i_get_fcn) (); if (val < 0) output_buf << "depends on problem size"; else output_buf << val; } output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_qpsol_option (char *keyword, double val) { QPSOL_OPTIONS *list = qpsol_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { if (list->d_set_fcn) (qpsol_opts.*list->d_set_fcn) (val); else (qpsol_opts.*list->i_set_fcn) (NINT (val)); return; } list++; } warning ("qpsol_options: no match for `%s'", keyword); } #endif #if defined (QPSOL_MISSING) DEFUN_DLD_BUILTIN ("qpsol_options", Fqpsol_options, Sqpsol_options, -1, 1, "This function requires QPSOL, which is not freely\n\ redistributable. For more information, read the file\n\ libcruft/qpsol/README.MISSING in the source distribution.") #else DEFUN_DLD_BUILTIN ("qpsol_options", Fqpsol_options, Sqpsol_options, -1, 1, "qpsol_options (KEYWORD, VALUE)\n \n\ Set or show options for qpsol. Keywords may be abbreviated\n\ to the shortest match.") #endif { Octave_object retval; #if defined (QPSOL_MISSING) print_usage ("qpsol"); #else int nargin = args.length (); if (nargin == 0) { print_qpsol_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_qpsol_option (keyword, val); return retval; } } } print_usage ("qpsol_options"); #endif return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-qr.cc100666 415 17 6235 5702417044 13113 0ustar jweusers// f-qr.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleQR.h" #include "CmplxQR.h" #include "dbleQRP.h" #include "CmplxQRP.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("qr", Fqr, Sqr, 2, 2, "[Q, R] = qr (X): form Q unitary and R upper triangular such\n\ that Q * R = X\n\ \n\ [Q, R] = qr (X, 0): form the economy decomposition such that if X is\n\ if X is m by n then only the first n columns of Q\n\ are computed.\n\ \n\ [Q, R, P] = qr (X): form QRP factorization of X where\n\ P is a permutation matrix such that\n\ A * P = Q * R\n\ \n\ [Q, R, P] = qr (X, 0): form the economy decomposition with \n\ permutation vector P such that Q * R = X (:, P)\n\ \n\ qr (X) alone returns the output of the LAPACK routine dgeqrf, such\n\ that R = triu (qr (X))") { Octave_object retval; int nargin = args.length (); if (nargin != 1 && nargin != 2 || nargout > 3) { print_usage ("qr"); return retval; } tree_constant arg = args(0); int arg_is_empty = empty_arg ("qr", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (3, Matrix ()); QR::type type = nargout == 1 ? QR::raw : (nargin == 2 ? QR::economy : QR::std); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { if (nargout < 3) { QR fact (m, type); retval(1) = fact.R (); retval(0) = fact.Q (); } else { QRP fact (m, type); retval(2) = fact.P (); retval(1) = fact.R (); retval(0) = fact.Q (); } } } else if (arg.is_complex_type ()) { ComplexMatrix m = arg.complex_matrix_value (); if (! error_state) { if (nargout < 3) { ComplexQR fact (m, type); retval(1) = fact.R (); retval(0) = fact.Q (); } else { ComplexQRP fact (m, type); retval(2) = fact.P (); retval(1) = fact.R (); retval(0) = fact.Q (); } } } else { gripe_wrong_type_arg ("qr", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-quad.cc100666 415 17 17100 5702417043 13433 0ustar jweusers// f-quad.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "Quad.h" #include "tree-const.h" #include "variables.h" #include "mappers.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "pager.h" #include "help.h" #include "defun-dld.h" // Global pointer for user defined function required by quadrature functions. static tree_fvc *quad_fcn; static Quad_options quad_opts; double quad_user_function (double x) { double retval = 0.0; Octave_object args; args(0) = x; if (quad_fcn) { Octave_object tmp = quad_fcn->eval (0, 1, args); if (error_state) { quad_integration_error = 1; // XXX FIXME XXX gripe_user_supplied_eval ("quad"); return retval; } if (tmp.length () && tmp(0).is_defined ()) { retval = tmp(0).double_value (); if (error_state) { quad_integration_error = 1; // XXX FIXME XXX gripe_user_supplied_eval ("quad"); } } else { quad_integration_error = 1; // XXX FIXME XXX gripe_user_supplied_eval ("quad"); } } return retval; } DEFUN_DLD_BUILTIN ("quad", Fquad, Squad, 5, 3, "[V, IER, NFUN] = quad (F, A, B [, TOL] [, SING])\n\ \n\ Where the first argument is the name of the function to call to\n\ compute the value of the integrand. It must have the form\n\ \n\ y = f (x) \n\ where y and x are scalars.\n\ \n\ The second and third arguments are limits of integration. Either or\n\ both may be infinite. The optional argument TOL specifies the desired\n\ accuracy of the result. The optional argument SING is a vector of\n\ at which the integrand is singular.") { Octave_object retval; int nargin = args.length (); if (nargin < 3 || nargin > 5 || nargout > 4) { print_usage ("quad"); return retval; } quad_fcn = is_valid_function (args(0), "quad", 1); if (! quad_fcn || takes_correct_nargs (quad_fcn, 1, "quad", 1) != 1) return retval; double a = args(1).double_value (); if (error_state) { error ("quad: expecting second argument to be a scalar"); return retval; } double b = args(2).double_value (); if (error_state) { error ("quad: expecting third argument to be a scalar"); return retval; } int indefinite = 0; IndefQuad::IntegralType indef_type = IndefQuad::doubly_infinite; double bound = 0.0; if ((int) xisinf (a) && (int) xisinf (b)) { indefinite = 1; indef_type = IndefQuad::doubly_infinite; } else if ((int) xisinf (a)) { indefinite = 1; bound = b; indef_type = IndefQuad::neg_inf_to_bound; } else if ((int) xisinf (b)) { indefinite = 1; bound = a; indef_type = IndefQuad::bound_to_inf; } int ier = 0; int nfun = 0; double abserr = 0.0; double val = 0.0; double abstol = 1e-6; double reltol = 1e-6; Vector tol (2); Vector sing; int have_sing = 0; switch (nargin) { case 5: if (indefinite) { error("quad: singularities not allowed on infinite intervals"); return retval; } have_sing = 1; sing = args(4).vector_value (); if (error_state) { error ("quad: expecting vector of singularities as fourth argument"); return retval; } case 4: tol = args(3).vector_value (); if (error_state) { error ("quad: expecting vector of tolerances as fifth argument"); return retval; } switch (tol.capacity ()) { case 2: reltol = tol.elem (1); case 1: abstol = tol.elem (0); break; default: error ("quad: expecting tol to contain no more than two values"); return retval; } case 3: if (indefinite) { IndefQuad iq (quad_user_function, bound, indef_type, abstol, reltol); iq.copy (quad_opts); val = iq.integrate (ier, nfun, abserr); } else { if (have_sing) { DefQuad dq (quad_user_function, a, b, sing, abstol, reltol); dq.copy (quad_opts); val = dq.integrate (ier, nfun, abserr); } else { DefQuad dq (quad_user_function, a, b, abstol, reltol); dq.copy (quad_opts); val = dq.integrate (ier, nfun, abserr); } } break; default: panic_impossible (); break; } retval(3) = abserr; retval(2) = nfun; retval(1) = ier; retval(0) = val; return retval; } typedef void (Quad_options::*d_set_opt_mf) (double); typedef double (Quad_options::*d_get_opt_mf) (void); #define MAX_TOKENS 2 struct QUAD_OPTIONS { const char *keyword; const char *kw_tok[MAX_TOKENS + 1]; int min_len[MAX_TOKENS + 1]; int min_toks_to_match; d_set_opt_mf d_set_fcn; d_get_opt_mf d_get_fcn; }; static QUAD_OPTIONS quad_option_table [] = { { "absolute tolerance", { "absolute", "tolerance", 0, }, { 1, 0, 0, }, 1, Quad_options::set_absolute_tolerance, Quad_options::absolute_tolerance, }, { "relative tolerance", { "relative", "tolerance", 0, }, { 1, 0, 0, }, 1, Quad_options::set_relative_tolerance, Quad_options::relative_tolerance, }, { 0, { 0, 0, 0, }, { 0, 0, 0, }, 0, 0, 0, }, }; static void print_quad_option_list (void) { ostrstream output_buf; print_usage ("quad_options", 1); output_buf << "\n" << "Options for quad include:\n\n" << " keyword value\n" << " ------- -----\n\n"; QUAD_OPTIONS *list = quad_option_table; const char *keyword; while ((keyword = list->keyword) != 0) { output_buf.form (" %-40s ", keyword); double val = (quad_opts.*list->d_get_fcn) (); if (val < 0.0) output_buf << "computed automatically"; else output_buf << val; output_buf << "\n"; list++; } output_buf << "\n" << ends; maybe_page_output (output_buf); } static void do_quad_option (char *keyword, double val) { QUAD_OPTIONS *list = quad_option_table; while (list->keyword != 0) { if (keyword_almost_match (list->kw_tok, list->min_len, keyword, list->min_toks_to_match, MAX_TOKENS)) { (quad_opts.*list->d_set_fcn) (val); return; } list++; } warning ("quad_options: no match for `%s'", keyword); } DEFUN_DLD_BUILTIN ("quad_options", Fquad_options, Squad_options, -1, 1, "quad_options (KEYWORD, VALUE)\n\ \n\ Set or show options for quad. Keywords may be abbreviated\n\ to the shortest match.") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { print_quad_option_list (); return retval; } else if (nargin == 2) { char *keyword = args(0).string_value (); if (! error_state) { double val = args(1).double_value (); if (! error_state) { do_quad_option (keyword, val); return retval; } } } print_usage ("quad_options"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-qzval.cc100666 415 17 10126 5702417042 13636 0ustar jweusers// f-qzval.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by A. S. Hodel #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "dMatrix.h" #include "dColVector.h" #include "CColVector.h" #include "f77-uscore.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" extern "C" { int F77_FCN (qzhes) (const int*, const int*, double*, double*, const long*, double*); int F77_FCN (qzit) (const int*, const int*, double*, double*, const double*, const long*, double*, int*); int F77_FCN (qzval) (const int*, const int*, double*, double*, double*, double*, double*, const long*, double*); } DEFUN_DLD_BUILTIN ("qzval", Fqzval, Sqzval, 3, 1, "X = qzval (A, B)\n\ \n\ compute generalized eigenvalues of the matrix pencil (A - lambda B).\n\ A and B must be real matrices.") { Octave_object retval; int nargin = args.length (); if (nargin != 2 || nargout > 1) { print_usage ("qzval"); return retval; } tree_constant arg_a = args(0); tree_constant arg_b = args(1); int a_nr = arg_a.rows(); int a_nc = arg_a.columns(); int b_nr = arg_b.rows(); int b_nc = arg_b.columns(); int arg_a_is_empty = empty_arg ("qzval", a_nr, a_nc); int arg_b_is_empty = empty_arg ("qzval", b_nr, b_nc); if (arg_a_is_empty > 0 && arg_b_is_empty > 0) return Matrix (); else if (arg_a_is_empty || arg_b_is_empty) return retval; // Arguments are not empty, so check for correct dimensions. if (a_nr != a_nc || b_nr != b_nc) { gripe_square_matrix_required ("qzval: first two parameters:"); return retval; } if (a_nr != b_nr) { gripe_nonconformant (); return retval; } // Dimensions look o.k., let's solve the problem. if (arg_a.is_complex_type () || arg_b.is_complex_type ()) { error ("qzval: cannot yet do complex matrix arguments\n"); return retval; } // Do everything in real arithmetic. Matrix jnk (a_nr, a_nr, 0.0); ColumnVector alfr (a_nr); ColumnVector alfi (a_nr); ColumnVector beta (a_nr); long matz = 0; int info; // XXX FIXME ??? XXX double eps = DBL_EPSILON; Matrix ca = arg_a.matrix_value (); if (error_state) return retval; Matrix cb = arg_b.matrix_value (); if (error_state) return retval; // Use EISPACK qz functions. F77_FCN (qzhes) (&a_nr, &a_nr, ca.fortran_vec (), cb.fortran_vec (), &matz, jnk.fortran_vec ()); F77_FCN (qzit) (&a_nr, &a_nr, ca.fortran_vec (), cb.fortran_vec (), &eps, &matz, jnk.fortran_vec (), &info); if (info) error ("qzval: trouble in qzit, info = %d", info); F77_FCN (qzval) (&a_nr, &a_nr, ca.fortran_vec (), cb.fortran_vec (), alfr.fortran_vec (), alfi.fortran_vec (), beta.fortran_vec (), &matz, jnk.fortran_vec ()); // Count and extract finite generalized eigenvalues. int i; int cnt = 0; Complex Im (0, 1); for (i = 0; i < a_nr; i++) if (beta (i) != 0) cnt++; ComplexColumnVector cx (cnt, 0.0); for (i = 0; i < a_nr; i++) { if (beta (i) != 0) { // Finite generalized eigenvalue. cnt--; cx (cnt) = (alfr (i) + Im * alfi (i)) / beta (i); } } retval = cx; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-rand.cc100666 415 17 13340 5702417041 13425 0ustar jweusers// f-rand.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "tree-const.h" #include "f77-uscore.h" #include "error.h" #include "gripes.h" #include "utils.h" #include "help.h" #include "defun-dld.h" // Possible distributions of random numbers. enum rand_dist { uniform, normal }; // Current distribution of random numbers. static rand_dist current_distribution = uniform; extern "C" { int *F77_FCN (dgennor) (double*, double*, double*); int *F77_FCN (dgenunf) (double*, double*, double*); int *F77_FCN (setall) (int*, int*); int *F77_FCN (getsd) (int*, int*); } static double curr_rand_seed (void) { union d2i { double d; int i[2]; }; union d2i u; F77_FCN (getsd) (&(u.i[0]), &(u.i[1])); return u.d; } static int force_to_fit_range (int i, int lo, int hi) { assert (hi > lo && lo >= 0 && hi > lo); i = i > 0 ? i : -i; if (i < lo) i = lo; else if (i > hi) i = i % hi; return i; } static void set_rand_seed (double val) { union d2i { double d; int i[2]; }; union d2i u; u.d = val; int i0 = force_to_fit_range (u.i[0], 1, 2147483563); int i1 = force_to_fit_range (u.i[1], 1, 2147483399); F77_FCN (setall) (&i0, &i1); } static char * curr_rand_dist (void) { if (current_distribution == uniform) return "uniform"; else if (current_distribution == normal) return "normal"; else { panic_impossible (); return 0; } } DEFUN_DLD_BUILTIN ("rand", Frand, Srand, 2, 1, "rand -- generate a random value\n\ \n\ rand (N) -- generate N x N matrix\n\ rand (A) -- generate matrix the size of A\n\ rand (N, M) -- generate N x M matrix\n\ rand (\"dist\") -- get current distribution\n\ rand (DISTRIBUTION) -- set distribution type (\"normal\" or \"uniform\"\n\ rand (SEED) -- get current seed\n\ rand (SEED, N) -- set seed") { Octave_object retval; int nargin = args.length (); if (nargin > 2 || nargout > 1) { print_usage ("rand"); return retval; } static int initialized = 0; if (! initialized) { // Make the random number generator give us a different sequence every // time we start octave unless we specifically set the seed. #if 0 int s0 = 1234567890; int s1 = 123456789; #else time_t now; struct tm *tm; time (&now); tm = localtime (&now); int s0 = tm->tm_min * 60 + tm->tm_sec; int s1 = (tm->tm_mday - 1) * 24 * 3600 + tm->tm_hour * 3600 + s0; #endif s0 = force_to_fit_range (s0, 1, 2147483563); s1 = force_to_fit_range (s1, 1, 2147483399); F77_FCN (setall) (&s0, &s1); initialized = 1; } int n = 0; int m = 0; if (nargin == 0) { n = 1; m = 1; goto gen_matrix; } else if (nargin == 1) { tree_constant tmp = args(0); if (tmp.is_string ()) { char *s_arg = tmp.string_value (); if (strcmp (s_arg, "dist") == 0) { char *s = curr_rand_dist (); retval(0) = s; } else if (strcmp (s_arg, "seed") == 0) { double d = curr_rand_seed (); retval(0) = d; } else if (strcmp (s_arg, "uniform") == 0) current_distribution = uniform; else if (strcmp (s_arg, "normal") == 0) current_distribution = normal; else error ("rand: unrecognized string argument"); } else if (tmp.is_scalar_type ()) { m = n = NINT (tmp.double_value ()); if (! error_state) goto gen_matrix; } else if (tmp.is_range ()) { Range r = tmp.range_value (); n = 1; m = NINT (r.nelem ()); goto gen_matrix; } else if (tmp.is_matrix_type ()) { n = NINT (args(0).rows ()); m = NINT (args(0).columns ()); goto gen_matrix; } else { gripe_wrong_type_arg ("rand", tmp); return retval; } } else if (nargin == 2) { if (args(0).is_string () && strcmp (args(0).string_value (), "seed") == 0) { double d = args(1).double_value (); if (! error_state) set_rand_seed (d); } else { n = NINT (args(0).double_value ()); if (! error_state) { m = NINT (args(1).double_value ()); if (! error_state) goto gen_matrix; } } } return retval; gen_matrix: if (n == 0 || m == 0) { Matrix m; retval.resize (1, m); } else if (n > 0 && m > 0) { Matrix rand_mat (n, m); for (int j = 0; j < m; j++) for (int i = 0; i < n; i++) { double d_zero = 0.0; double d_one = 1.0; double val; switch (current_distribution) { case uniform: F77_FCN (dgenunf) (&d_zero, &d_one, &val); rand_mat.elem (i, j) = val; break; case normal: F77_FCN (dgennor) (&d_zero, &d_one, &val); rand_mat.elem (i, j) = val; break; default: panic_impossible (); break; } } retval(0) = rand_mat; } else error ("rand: invalid negative argument"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-schur.cc100666 415 17 6213 5702417040 13605 0ustar jweusers// f-schur.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleSCHUR.h" #include "CmplxSCHUR.h" #include "tree-const.h" #include "user-prefs.h" #include "utils.h" #include "error.h" #include "gripes.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("schur", Fschur, Sschur, 3, 2, "[U, S] = schur (A) or S = schur (A)\n\ \n\ or, for ordered Schur:\n\ \n\ [U, S] = schur (A, TYPE) or S = schur (A, TYPE)\n\ where TYPE is a string that begins with one of the following\n\ characters:\n\ \n\ A = continuous time poles\n\ D = discrete time poles\n\ U = unordered schur (default)") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2 || nargout > 2) { print_usage ("schur"); return retval; } tree_constant arg = args(0); char *ord = "U"; if (nargin == 2) { ord = args(1).string_value (); if (error_state) { error ("schur: expecting string as second argument"); return retval; } } if (*ord != 'U' && *ord != 'A' && *ord != 'D' && *ord != 'u' && *ord != 'a' && *ord != 'd') { warning ("schur: incorrect ordered schur argument `%c'", *ord); return retval; } int nr = arg.rows (); int nc = arg.columns (); int arg_is_empty = empty_arg ("schur", nr, nc); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (2, Matrix ()); if (nr != nc) { gripe_square_matrix_required ("schur"); return retval; } if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) { SCHUR result (tmp,ord); if (nargout == 0 || nargout == 1) { retval(0) = result.schur_matrix (); } else { retval(1) = result.schur_matrix (); retval(0) = result.unitary_matrix (); } } } else if (arg.is_complex_type ()) { ComplexMatrix ctmp = arg.complex_matrix_value (); if (! error_state) { ComplexSCHUR result (ctmp,ord); if (nargout == 0 || nargout == 1) { retval(0) = result.schur_matrix (); } else { retval(1) = result.schur_matrix (); retval(0) = result.unitary_matrix (); } } } else { gripe_wrong_type_arg ("schur", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-sort.cc100666 415 17 12615 5702417037 13501 0ustar jweusers// f-sort.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "tree-const.h" #include "error.h" #include "gripes.h" #include "help.h" #include "defun-dld.h" static void mx_sort (Matrix& m, Matrix& idx, int return_idx) { int nr = m.rows (); int nc = m.columns (); idx.resize (nr, nc); int i, j; if (return_idx) { for (j = 0; j < nc; j++) for (i = 0; i < nr; i++) idx.elem (i, j) = i+1; } for (j = 0; j < nc; j++) { for (int gap = nr/2; gap > 0; gap /= 2) for (i = gap; i < nr; i++) for (int k = i - gap; k >= 0 && m.elem (k, j) > m.elem (k+gap, j); k -= gap) { double tmp = m.elem (k, j); m.elem (k, j) = m.elem (k+gap, j); m.elem (k+gap, j) = tmp; if (return_idx) { double tmp = idx.elem (k, j); idx.elem (k, j) = idx.elem (k+gap, j); idx.elem (k+gap, j) = tmp; } } } } static void mx_sort (RowVector& v, RowVector& idx, int return_idx) { int n = v.capacity (); idx.resize (n); int i; if (return_idx) for (i = 0; i < n; i++) idx.elem (i) = i+1; for (int gap = n/2; gap > 0; gap /= 2) for (i = gap; i < n; i++) for (int k = i - gap; k >= 0 && v.elem (k) > v.elem (k+gap); k -= gap) { double tmp = v.elem (k); v.elem (k) = v.elem (k+gap); v.elem (k+gap) = tmp; if (return_idx) { double tmp = idx.elem (k); idx.elem (k) = idx.elem (k+gap); idx.elem (k+gap) = tmp; } } } static void mx_sort (ComplexMatrix& cm, Matrix& idx, int return_idx) { int nr = cm.rows (); int nc = cm.columns (); idx.resize (nr, nc); int i, j; if (return_idx) { for (j = 0; j < nc; j++) for (i = 0; i < nr; i++) idx.elem (i, j) = i+1; } for (j = 0; j < nc; j++) { for (int gap = nr/2; gap > 0; gap /= 2) for (i = gap; i < nr; i++) for (int k = i - gap; k >= 0 && abs (cm.elem (k, j)) > abs (cm.elem (k+gap, j)); k -= gap) { Complex ctmp = cm.elem (k, j); cm.elem (k, j) = cm.elem (k+gap, j); cm.elem (k+gap, j) = ctmp; if (return_idx) { double tmp = idx.elem (k, j); idx.elem (k, j) = idx.elem (k+gap, j); idx.elem (k+gap, j) = tmp; } } } } static void mx_sort (ComplexRowVector& cv, RowVector& idx, int return_idx) { int n = cv.capacity (); idx.resize (n); int i; if (return_idx) for (i = 0; i < n; i++) idx.elem (i) = i+1; for (int gap = n/2; gap > 0; gap /= 2) for (i = gap; i < n; i++) for (int k = i - gap; k >= 0 && abs (cv.elem (k)) > abs (cv.elem (k+gap)); k -= gap) { Complex tmp = cv.elem (k); cv.elem (k) = cv.elem (k+gap); cv.elem (k+gap) = tmp; if (return_idx) { double tmp = idx.elem (k); idx.elem (k) = idx.elem (k+gap); idx.elem (k+gap) = tmp; } } } DEFUN_DLD_BUILTIN ("sort", Fsort, Ssort, 2, 2, "[S, I] = sort (X)\n\ \n\ sort the columns of X, optionally return sort index") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("sort"); return retval; } int return_idx = nargout > 1; if (return_idx) retval.resize (2); else retval.resize (1); tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { if (m.rows () == 1) { int nc = m.columns (); RowVector v (nc); for (int i = 0; i < nc; i++) v.elem (i) = m.elem (0, i); RowVector idx; mx_sort (v, idx, return_idx); retval(0) = tree_constant (v, 0); if (return_idx) retval(1) = tree_constant (idx, 0); } else { // Sorts m in place, optionally computes index Matrix. Matrix idx; mx_sort (m, idx, return_idx); retval(0) = m; if (return_idx) retval(1) = idx; } } } else if (arg.is_complex_type ()) { ComplexMatrix cm = arg.complex_matrix_value (); if (! error_state) { if (cm.rows () == 1) { int nc = cm.columns (); ComplexRowVector cv (nc); for (int i = 0; i < nc; i++) cv.elem (i) = cm.elem (0, i); RowVector idx; mx_sort (cv, idx, return_idx); retval(0) = tree_constant (cv, 0); if (return_idx) retval(1) = tree_constant (idx, 0); } else { // Sorts cm in place, optionally computes index Matrix. Matrix idx; mx_sort (cm, idx, return_idx); retval(0) = cm; if (return_idx) retval(1) = idx; } } } else { gripe_wrong_type_arg ("sort", arg); } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-svd.cc100666 415 17 5512 5702417036 13263 0ustar jweusers// f-svd.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dbleSVD.h" #include "CmplxSVD.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" DEFUN_DLD_BUILTIN ("svd", Fsvd, Ssvd, 2, 3, "S = svd (X) or [U, S, V] = svd (X [, 0])\n\ \n\ Compute the singular value decomposition of X. Given a second input\n\ argument, an `economy' sized factorization is computed that omits\n\ unnecessary rows and columns of U and V") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2 || nargout == 2 || nargout > 3) { print_usage ("svd"); return retval; } tree_constant arg = args(0); int arg_is_empty = empty_arg ("svd", arg.rows (), arg.columns ()); if (arg_is_empty < 0) return retval; else if (arg_is_empty > 0) return Octave_object (3, Matrix ()); SVD::type type = (nargin == 2) ? SVD::economy : SVD::std; if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) { SVD result (tmp, type); DiagMatrix sigma = result.singular_values (); if (nargout == 0 || nargout == 1) { retval(0) = tree_constant (sigma.diag (), 1); } else { retval(2) = result.right_singular_matrix (); retval(1) = sigma; retval(0) = result.left_singular_matrix (); } } } else if (arg.is_complex_type ()) { ComplexMatrix ctmp = arg.complex_matrix_value (); if (! error_state) { ComplexSVD result (ctmp, type); DiagMatrix sigma = result.singular_values (); if (nargout == 0 || nargout == 1) { retval(0) = tree_constant (sigma.diag (), 1); } else { retval(2) = result.right_singular_matrix (); retval(1) = sigma; retval(0) = result.left_singular_matrix (); } } } else { gripe_wrong_type_arg ("svd", arg); return retval; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/f-syl.cc100666 415 17 11715 5702417035 13317 0ustar jweusers// f-syl.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by A. S. Hodel #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "CMatrix.h" #include "dbleSCHUR.h" #include "CmplxSCHUR.h" #include "f77-uscore.h" #include "tree-const.h" #include "user-prefs.h" #include "gripes.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun-dld.h" extern "C" { int F77_FCN (dtrsyl) (const char*, const char*, const int*, const int*, const int*, const double*, const int*, const double*, const int*, const double*, const int*, double*, int*, long, long); int F77_FCN (ztrsyl) (const char*, const char*, const int*, const int*, const int*, const Complex*, const int*, const Complex*, const int*, const Complex*, const int*, double*, int*, long, long); } DEFUN_DLD_BUILTIN ("syl", Fsyl, Ssyl, 4, 1, "X = syl (A, B, C): solve the Sylvester equation A X + X B + C = 0") { Octave_object retval; int nargin = args.length (); if (nargin != 3 || nargout > 1) { print_usage ("syl"); return retval; } tree_constant arg_a = args(0); tree_constant arg_b = args(1); tree_constant arg_c = args(2); int a_nr = arg_a.rows (); int a_nc = arg_a.columns (); int b_nr = arg_b.rows (); int b_nc = arg_b.columns (); int c_nr = arg_c.rows (); int c_nc = arg_c.columns (); int arg_a_is_empty = empty_arg ("syl", a_nr, a_nc); int arg_b_is_empty = empty_arg ("syl", b_nr, b_nc); int arg_c_is_empty = empty_arg ("syl", c_nr, c_nc); if (arg_a_is_empty > 0 && arg_b_is_empty > 0 && arg_c_is_empty > 0) return Matrix (); else if (arg_a_is_empty || arg_b_is_empty || arg_c_is_empty) return retval; // Arguments are not empty, so check for correct dimensions. if (a_nr != a_nc || b_nr != b_nc) { gripe_square_matrix_required ("syl: first two parameters:"); return retval; } else if (a_nr != c_nr || b_nr != c_nc) { gripe_nonconformant (); return retval; } // Dimensions look o.k., let's solve the problem. if (arg_a.is_complex_type () || arg_b.is_complex_type () || arg_c.is_complex_type ()) { // Do everything in complex arithmetic; ComplexMatrix ca = arg_a.complex_matrix_value (); if (error_state) return retval; ComplexMatrix cb = arg_b.complex_matrix_value (); if (error_state) return retval; ComplexMatrix cc = arg_c.complex_matrix_value (); if (error_state) return retval; // Compute Schur decompositions ComplexSCHUR as (ca, "U"); ComplexSCHUR bs (cb, "U"); // Transform cc to new coordinates. ComplexMatrix ua = as.unitary_matrix (); ComplexMatrix sch_a = as.schur_matrix (); ComplexMatrix ub = bs.unitary_matrix (); ComplexMatrix sch_b = bs.schur_matrix (); ComplexMatrix cx = ua.hermitian () * cc * ub; // Solve the sylvester equation, back-transform, and return the solution. double scale; int info; int one = 1; F77_FCN (ztrsyl) ("N", "N", &one, &a_nr, &b_nr, sch_a.fortran_vec (), &a_nr, sch_b.fortran_vec (), &b_nr, cx.fortran_vec (), &a_nr, &scale, &info, 1L, 1L); cx = -ua * cx * ub.hermitian (); retval = cx; } else { // Do everything in real arithmetic; Matrix ca = arg_a.matrix_value (); if (error_state) return retval; Matrix cb = arg_b.matrix_value (); if (error_state) return retval; Matrix cc = arg_c.matrix_value (); if (error_state) return retval; // Compute Schur decompositions. SCHUR as (ca, "U"); SCHUR bs (cb, "U"); // Transform cc to new coordinates. Matrix ua = as.unitary_matrix (); Matrix sch_a = as.schur_matrix (); Matrix ub = bs.unitary_matrix (); Matrix sch_b = bs.schur_matrix (); Matrix cx = ua.transpose () * cc * ub; // Solve the sylvester equation, back-transform, and return the solution. double scale; int info; int one = 1; F77_FCN (dtrsyl) ("N", "N", &one, &a_nr, &b_nr, sch_a.fortran_vec (), &a_nr, sch_b.fortran_vec (), &b_nr, cx.fortran_vec (), &a_nr, &scale, &info, 1L, 1L); if (info) error ("syl: trouble in dtrsyl info = %d", info); cx = -ua*cx*ub.transpose (); retval = cx; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/arith-ops.cc100666 415 17 162663 5702417121 14220 0ustar jweusers// arith-ops.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include "error.h" #include "gripes.h" #include "utils.h" #include "mappers.h" #include "user-prefs.h" #include "tree-const.h" #include "arith-ops.h" #include "unwind-prot.h" #include "xpow.h" #include "xdiv.h" #if defined (HAVE_ISINF) || (defined (HAVE_FINITE) && defined (HAVE_ISNAN)) #define DIVIDE_BY_ZERO_ERROR \ do \ { \ if (user_pref.warn_divide_by_zero) \ warning ("division by zero"); \ } \ while (0) #else #define DIVIDE_BY_ZERO_ERROR \ do \ { \ error ("division by zero attempted"); \ return tree_constant (); \ } \ while (0) #endif // But first, some stupid functions that don\'t deserve to be in the // Matrix class... enum Matrix_bool_op { Matrix_LT, Matrix_LE, Matrix_EQ, Matrix_GE, Matrix_GT, Matrix_NE, Matrix_AND, Matrix_OR, }; // Check row and column dimensions for binary matrix operations. static inline int m_add_conform (const Matrix& a, const Matrix& b, int warn) { int ar = a.rows (); int ac = a.columns (); int br = b.rows (); int bc = b.columns (); int ok = (ar == br && ac == bc); if (! ok && warn) gripe_nonconformant (ar, ac, br, bc); return ok; } static inline int m_add_conform (const Matrix& a, const ComplexMatrix& b, int warn) { int ar = a.rows (); int ac = a.columns (); int br = b.rows (); int bc = b.columns (); int ok = (ar == br && ac == bc); if (! ok && warn) gripe_nonconformant (ar, ac, br, bc); return ok; } static inline int m_add_conform (const ComplexMatrix& a, const Matrix& b, int warn) { int ar = a.rows (); int ac = a.columns (); int br = b.rows (); int bc = b.columns (); int ok = (ar == br && ac == bc); if (! ok && warn) gripe_nonconformant (ar, ac, br, bc); return ok; } static inline int m_add_conform (const ComplexMatrix& a, const ComplexMatrix& b, int warn) { int ar = a.rows (); int ac = a.columns (); int br = b.rows (); int bc = b.columns (); int ok = (ar == br && ac == bc); if (! ok && warn) gripe_nonconformant (ar, ac, br, bc); return ok; } static inline int m_mul_conform (const Matrix& a, const Matrix& b, int warn) { int ac = a.columns (); int br = b.rows (); int ok = (ac == br); if (! ok && warn) gripe_nonconformant (a.rows (), ac, br, b.columns ()); return ok; } static inline int m_mul_conform (const Matrix& a, const ComplexMatrix& b, int warn) { int ac = a.columns (); int br = b.rows (); int ok = (ac == br); if (! ok && warn) gripe_nonconformant (a.rows (), ac, br, b.columns ()); return ok; } static inline int m_mul_conform (const ComplexMatrix& a, const Matrix& b, int warn) { int ac = a.columns (); int br = b.rows (); int ok = (ac == br); if (! ok && warn) gripe_nonconformant (a.rows (), ac, br, b.columns ()); return ok; } static inline int m_mul_conform (const ComplexMatrix& a, const ComplexMatrix& b, int warn) { int ac = a.columns (); int br = b.rows (); int ok = (a.columns () == br); if (! ok && warn) gripe_nonconformant (a.rows (), ac, br, b.columns ()); return ok; } // Stupid binary comparison operations like the ones Matlab provides. // One for each type combination, in the order given here: // // op2 \ op1: s m cs cm // +-- +---+---+----+----+ // scalar | | * | 3 | * | 9 | // +---+---+----+----+ // matrix | 1 | 4 | 7 | 10 | // +---+---+----+----+ // complex_scalar | * | 5 | * | 11 | // +---+---+----+----+ // complex_matrix | 2 | 6 | 8 | 12 | // +---+---+----+----+ // -*- 1 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, double s, const Matrix& a) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = s < a.elem (i,j); break; case Matrix_LE: t.elem (i,j) = s <= a.elem (i,j); break; case Matrix_EQ: t.elem (i,j) = s == a.elem (i,j); break; case Matrix_GE: t.elem (i,j) = s >= a.elem (i,j); break; case Matrix_GT: t.elem (i,j) = s > a.elem (i,j); break; case Matrix_NE: t.elem (i,j) = s != a.elem (i,j); break; case Matrix_AND: t.elem (i,j) = s && a.elem (i,j); break; case Matrix_OR: t.elem (i,j) = s || a.elem (i,j); break; default: panic_impossible (); break; } } return t; } // -*- 2 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, double s, const ComplexMatrix& a) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = s < real (a.elem (i,j)); break; case Matrix_LE: t.elem (i,j) = s <= real (a.elem (i,j)); break; case Matrix_EQ: t.elem (i,j) = s == a.elem (i,j); break; case Matrix_GE: t.elem (i,j) = s >= real (a.elem (i,j)); break; case Matrix_GT: t.elem (i,j) = s > real (a.elem (i,j)); break; case Matrix_NE: t.elem (i,j) = s != a.elem (i,j); break; case Matrix_AND: t.elem (i,j) = s && (a.elem (i,j) != 0.0); break; case Matrix_OR: t.elem (i,j) = s || (a.elem (i,j) != 0.0); break; default: panic_impossible (); break; } } return t; } // -*- 3 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Matrix& a, double s) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = a.elem (i,j) < s; break; case Matrix_LE: t.elem (i,j) = a.elem (i,j) <= s; break; case Matrix_EQ: t.elem (i,j) = a.elem (i,j) == s; break; case Matrix_GE: t.elem (i,j) = a.elem (i,j) >= s; break; case Matrix_GT: t.elem (i,j) = a.elem (i,j) > s; break; case Matrix_NE: t.elem (i,j) = a.elem (i,j) != s; break; case Matrix_AND: t.elem (i,j) = a.elem (i,j) && s; break; case Matrix_OR: t.elem (i,j) = a.elem (i,j) || s; break; default: panic_impossible (); break; } } return t; } // -*- 4 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Matrix& a, const Complex& s) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = a.elem (i,j) < real (s); break; case Matrix_LE: t.elem (i,j) = a.elem (i,j) <= real (s); break; case Matrix_EQ: t.elem (i,j) = a.elem (i,j) == s; break; case Matrix_GE: t.elem (i,j) = a.elem (i,j) >= real (s); break; case Matrix_GT: t.elem (i,j) = a.elem (i,j) > real (s); break; case Matrix_NE: t.elem (i,j) = a.elem (i,j) != s; break; case Matrix_AND: t.elem (i,j) = a.elem (i,j) && (s != 0.0); break; case Matrix_OR: t.elem (i,j) = a.elem (i,j) || (s != 0.0); break; default: panic_impossible (); break; } } return t; } // -*- 5 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Matrix& a, const Matrix& b) { if (! m_add_conform (a, b, 1)) return Matrix (); int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 1.0); else if (op == Matrix_NE) return Matrix (1, 1, 0.0); } Matrix c (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: c.elem (i, j) = a.elem (i, j) < b.elem (i, j); break; case Matrix_LE: c.elem (i, j) = a.elem (i, j) <= b.elem (i, j); break; case Matrix_EQ: c.elem (i, j) = a.elem (i, j) == b.elem (i, j); break; case Matrix_GE: c.elem (i, j) = a.elem (i, j) >= b.elem (i, j); break; case Matrix_GT: c.elem (i, j) = a.elem (i, j) > b.elem (i, j); break; case Matrix_NE: c.elem (i, j) = a.elem (i, j) != b.elem (i, j); break; case Matrix_AND: c.elem (i, j) = a.elem (i, j) && b.elem (i, j); break; case Matrix_OR: c.elem (i, j) = a.elem (i, j) || b.elem (i, j); break; default: panic_impossible (); break; } } return c; } // -*- 6 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Matrix& a, const ComplexMatrix& b) { if (! m_add_conform (a, b, 1)) return Matrix (); int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 1.0); else if (op == Matrix_NE) return Matrix (1, 1, 0.0); } Matrix c (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: c.elem (i, j) = a.elem (i, j) < real (b.elem (i, j)); break; case Matrix_LE: c.elem (i, j) = a.elem (i, j) <= real (b.elem (i, j)); break; case Matrix_EQ: c.elem (i, j) = a.elem (i, j) == b.elem (i, j); break; case Matrix_GE: c.elem (i, j) = a.elem (i, j) >= real (b.elem (i, j)); break; case Matrix_GT: c.elem (i, j) = a.elem (i, j) > real (b.elem (i, j)); break; case Matrix_NE: c.elem (i, j) = a.elem (i, j) != b.elem (i, j); break; case Matrix_AND: c.elem (i, j) = a.elem (i, j) && (b.elem (i, j) != 0.0); break; case Matrix_OR: c.elem (i, j) = a.elem (i, j) || (b.elem (i, j) != 0.0); break; default: panic_impossible (); break; } } return c; } // -*- 7 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Complex& s, const Matrix& a) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = real (s) < a.elem (i,j); break; case Matrix_LE: t.elem (i,j) = real (s) <= a.elem (i,j); break; case Matrix_EQ: t.elem (i,j) = s == a.elem (i,j); break; case Matrix_GE: t.elem (i,j) = real (s) >= a.elem (i,j); break; case Matrix_GT: t.elem (i,j) = real (s) > a.elem (i,j); break; case Matrix_NE: t.elem (i,j) = s != a.elem (i,j); break; case Matrix_AND: t.elem (i,j) = (s != 0.0) && a.elem (i,j); break; case Matrix_OR: t.elem (i,j) = (s != 0.0) || a.elem (i,j); break; default: panic_impossible (); break; } } return t; } // -*- 8 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const Complex& s, const ComplexMatrix& a) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = real (s) < real (a.elem (i,j)); break; case Matrix_LE: t.elem (i,j) = real (s) <= real (a.elem (i,j)); break; case Matrix_EQ: t.elem (i,j) = s == a.elem (i,j); break; case Matrix_GE: t.elem (i,j) = real (s) >= real (a.elem (i,j)); break; case Matrix_GT: t.elem (i,j) = real (s) > real (a.elem (i,j)); break; case Matrix_NE: t.elem (i,j) = s != a.elem (i,j); break; case Matrix_AND: t.elem (i,j) = (s != 0.0) && (a.elem (i,j) != 0.0); break; case Matrix_OR: t.elem (i,j) = (s != 0.0) || (a.elem (i,j) != 0.0); break; default: panic_impossible (); break; } } return t; } // -*- 9 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const ComplexMatrix& a, double s) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = real (a.elem (i,j)) < s; break; case Matrix_LE: t.elem (i,j) = real (a.elem (i,j)) <= s; break; case Matrix_EQ: t.elem (i,j) = a.elem (i,j) == s; break; case Matrix_GE: t.elem (i,j) = real (a.elem (i,j)) >= s; break; case Matrix_GT: t.elem (i,j) = real (a.elem (i,j)) > s; break; case Matrix_NE: t.elem (i,j) = a.elem (i,j) != s; break; case Matrix_AND: t.elem (i,j) = (a.elem (i,j) != 0.0) && s; break; case Matrix_OR: t.elem (i,j) = (a.elem (i,j) != 0.0) || s; break; default: panic_impossible (); break; } } return t; } // -*- 10 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const ComplexMatrix& a, const Complex& s) { int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 0.0); else if (op == Matrix_NE) return Matrix (1, 1, 1.0); } Matrix t (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: t.elem (i,j) = real (a.elem (i,j)) < real (s); break; case Matrix_LE: t.elem (i,j) = real (a.elem (i,j)) <= real (s); break; case Matrix_EQ: t.elem (i,j) = a.elem (i,j) == s; break; case Matrix_GE: t.elem (i,j) = real (a.elem (i,j)) >= real (s); break; case Matrix_GT: t.elem (i,j) = real (a.elem (i,j)) > real (s); break; case Matrix_NE: t.elem (i,j) = a.elem (i,j) != s; break; case Matrix_AND: t.elem (i,j) = (a.elem (i,j) != 0.0) && (s != 0.0); break; case Matrix_OR: t.elem (i,j) = (a.elem (i,j) != 0.0) || (s != 0.0); break; default: panic_impossible (); break; } } return t; } // -*- 11 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const ComplexMatrix& a, const Matrix& b) { if (! m_add_conform (a, b, 1)) return Matrix (); int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 1.0); else if (op == Matrix_NE) return Matrix (1, 1, 0.0); } Matrix c (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: c.elem (i, j) = real (a.elem (i, j)) < b.elem (i, j); break; case Matrix_LE: c.elem (i, j) = real (a.elem (i, j)) <= b.elem (i, j); break; case Matrix_EQ: c.elem (i, j) = a.elem (i, j) == b.elem (i, j); break; case Matrix_GE: c.elem (i, j) = real (a.elem (i, j)) >= b.elem (i, j); break; case Matrix_GT: c.elem (i, j) = real (a.elem (i, j)) > b.elem (i, j); break; case Matrix_NE: c.elem (i, j) = a.elem (i, j) != b.elem (i, j); break; case Matrix_AND: c.elem (i, j) = (a.elem (i, j) != 0.0) && b.elem (i, j); break; case Matrix_OR: c.elem (i, j) = (a.elem (i, j) != 0.0) || b.elem (i, j); break; default: panic_impossible (); break; } } return c; } // -*- 12 -*- static Matrix mx_stupid_bool_op (Matrix_bool_op op, const ComplexMatrix& a, const ComplexMatrix& b) { if (! m_add_conform (a, b, 1)) return Matrix (); int ar = a.rows (); int ac = a.columns (); if (ar == 0 || ac == 0) { if (op == Matrix_EQ) return Matrix (1, 1, 1.0); else if (op == Matrix_NE) return Matrix (1, 1, 0.0); } Matrix c (ar, ac); for (int j = 0; j < ac; j++) for (int i = 0; i < ar; i++) { switch (op) { case Matrix_LT: c.elem (i, j) = real (a.elem (i, j)) < real (b.elem (i, j)); break; case Matrix_LE: c.elem (i, j) = real (a.elem (i, j)) <= real (b.elem (i, j)); break; case Matrix_EQ: c.elem (i, j) = a.elem (i, j) == b.elem (i, j); break; case Matrix_GE: c.elem (i, j) = real (a.elem (i, j)) >= real (b.elem (i, j)); break; case Matrix_GT: c.elem (i, j) = real (a.elem (i, j)) > real (b.elem (i, j)); break; case Matrix_NE: c.elem (i, j) = a.elem (i, j) != b.elem (i, j); break; case Matrix_AND: c.elem (i, j) = (a.elem (i, j) != 0.0) && (b.elem (i, j) != 0.0); break; case Matrix_OR: c.elem (i, j) = (a.elem (i, j) != 0.0) || (b.elem (i, j) != 0.0); break; default: panic_impossible (); break; } } return c; } // Unary operations. One for each numeric data type: // // scalar // complex_scalar // matrix // complex_matrix tree_constant do_unary_op (double d, tree_expression::type t) { double result = 0.0; switch (t) { case tree_expression::not: result = (! d); break; case tree_expression::uminus: result = -d; break; case tree_expression::hermitian: case tree_expression::transpose: result = d; break; default: panic_impossible (); break; } return tree_constant (result); } tree_constant do_unary_op (const Matrix& a, tree_expression::type t) { Matrix result; switch (t) { case tree_expression::not: result = (! a); break; case tree_expression::uminus: result = -a; break; case tree_expression::hermitian: case tree_expression::transpose: result = a.transpose (); break; default: panic_impossible (); break; } return tree_constant (result); } tree_constant do_unary_op (const Complex& c, tree_expression::type t) { Complex result = 0.0; switch (t) { case tree_expression::not: result = (c == 0.0); break; case tree_expression::uminus: result = -c; break; case tree_expression::hermitian: result = conj (c); break; case tree_expression::transpose: result = c; break; default: panic_impossible (); break; } return tree_constant (result); } tree_constant do_unary_op (const ComplexMatrix& a, tree_expression::type t) { ComplexMatrix result; switch (t) { case tree_expression::not: result = (! a); break; case tree_expression::uminus: result = -a; break; case tree_expression::hermitian: result = a.hermitian (); break; case tree_expression::transpose: result = a.transpose (); break; default: panic_impossible (); break; } return tree_constant (result); } // Binary operations. One for each type combination, in the order // given here: // // op2 \ op1: s m cs cm // +-- +---+---+----+----+ // scalar | | 1 | 5 | 9 | 13 | // +---+---+----+----+ // matrix | 2 | 6 | 10 | 14 | // +---+---+----+----+ // complex_scalar | 3 | 7 | 11 | 15 | // +---+---+----+----+ // complex_matrix | 4 | 8 | 12 | 16 | // +---+---+----+----+ // -*- 1 -*- tree_constant do_binary_op (double a, double b, tree_expression::type t) { double result = 0.0; switch (t) { case tree_expression::add: result = a + b; break; case tree_expression::subtract: result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result = a * b; break; case tree_expression::divide: case tree_expression::el_div: if (b == 0.0) DIVIDE_BY_ZERO_ERROR; result = a / b; break; case tree_expression::leftdiv: case tree_expression::el_leftdiv: if (a == 0.0) DIVIDE_BY_ZERO_ERROR; result = b / a; break; case tree_expression::power: case tree_expression::elem_pow: return xpow (a, b); break; case tree_expression::cmp_lt: result = a < b; break; case tree_expression::cmp_le: result = a <= b; break; case tree_expression::cmp_eq: result = a == b; break; case tree_expression::cmp_ge: result = a >= b; break; case tree_expression::cmp_gt: result = a > b; break; case tree_expression::cmp_ne: result = a != b; break; case tree_expression::and: result = (a && b); break; case tree_expression::or: result = (a || b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); return tree_constant (result); } // -*- 2 -*- tree_constant do_binary_op (double a, const Matrix& b, tree_expression::type t) { Matrix result; switch (t) { case tree_expression::add: result = a + b; break; case tree_expression::subtract: result = a - b; break; case tree_expression::el_leftdiv: case tree_expression::leftdiv: if (a == 0.0) DIVIDE_BY_ZERO_ERROR; a = 1.0 / a; // fall through... case tree_expression::multiply: case tree_expression::el_mul: result = a * b; break; case tree_expression::el_div: return x_el_div (a, b); break; case tree_expression::divide: gripe_nonconformant (1, 1, b.rows (), b.columns ()); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); return tree_constant (result); } // -*- 3 -*- tree_constant do_binary_op (double a, const Complex& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; double result = 0.0; Complex complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; if (b == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = a / b; break; case tree_expression::leftdiv: case tree_expression::el_leftdiv: result_type = RT_complex; if (a == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = b / a; break; case tree_expression::power: case tree_expression::elem_pow: return xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = a < real (b); break; case tree_expression::cmp_le: result_type = RT_real; result = a <= real (b); break; case tree_expression::cmp_eq: result_type = RT_real; result = a == b; break; case tree_expression::cmp_ge: result_type = RT_real; result = a >= real (b); break; case tree_expression::cmp_gt: result_type = RT_real; result = a > real (b); break; case tree_expression::cmp_ne: result_type = RT_real; result = a != b; break; case tree_expression::and: result_type = RT_real; result = (a && (b != 0.0)); break; case tree_expression::or: result_type = RT_real; result = (a || (b != 0.0)); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 4 -*- tree_constant do_binary_op (double a, const ComplexMatrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::el_leftdiv: case tree_expression::leftdiv: if (a == 0.0) DIVIDE_BY_ZERO_ERROR; a = 1.0 / a; // fall through... case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::el_div: return x_el_div (a, b); break; case tree_expression::divide: gripe_nonconformant (1, 1, b.rows (), b.columns ()); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 5 -*- tree_constant do_binary_op (const Matrix& a, double b, tree_expression::type t) { Matrix result; switch (t) { case tree_expression::add: result = a + b; break; case tree_expression::subtract: result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result = a / b; break; case tree_expression::el_leftdiv: return x_el_div (b, a); break; case tree_expression::leftdiv: gripe_nonconformant (a.rows (), a.columns (), 1, 1); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); return tree_constant (result); } // -*- 6 -*- tree_constant do_binary_op (const Matrix& a, const Matrix& b, tree_expression::type t) { Matrix result; switch (t) { case tree_expression::add: if (m_add_conform (a, b, 1)) result = a + b; break; case tree_expression::subtract: if (m_add_conform (a, b, 1)) result = a - b; break; case tree_expression::el_mul: if (m_add_conform (a, b, 1)) result = product (a, b); break; case tree_expression::multiply: if (m_mul_conform (a, b, 1)) result = a * b; break; case tree_expression::el_div: if (m_add_conform (a, b, 1)) result = quotient (a, b); break; case tree_expression::el_leftdiv: if (m_add_conform (a, b, 1)) result = quotient (b, a); break; case tree_expression::leftdiv: return xleftdiv (a, b); break; case tree_expression::divide: return xdiv (a, b); break; case tree_expression::power: error ("can't do A ^ B for A and B both matrices"); break; case tree_expression::elem_pow: if (m_add_conform (a, b, 1)) return elem_xpow (a, b); break; case tree_expression::cmp_lt: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); return tree_constant (result); } // -*- 7 -*- tree_constant do_binary_op (const Matrix& a, const Complex& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; complex_result = a / b; break; case tree_expression::el_leftdiv: return x_el_div (b, a); break; case tree_expression::leftdiv: gripe_nonconformant (a.rows (), a.columns (), 1, 1); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 8 -*- tree_constant do_binary_op (const Matrix& a, const ComplexMatrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a - b; break; case tree_expression::el_mul: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = product (a, b); break; case tree_expression::multiply: result_type = RT_complex; if (m_mul_conform (a, b, 1)) complex_result = a * b; break; case tree_expression::el_div: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (a, b); break; case tree_expression::el_leftdiv: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (b, a); break; case tree_expression::leftdiv: return xleftdiv (a, b); break; case tree_expression::divide: return xdiv (a, b); break; case tree_expression::power: error ("can't do A ^ B for A and B both matrices"); break; case tree_expression::elem_pow: if (m_add_conform (a, b, 1)) return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 9 -*- tree_constant do_binary_op (const Complex& a, double b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; double result = 0.0; Complex complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; if (b == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = a / b; break; case tree_expression::leftdiv: case tree_expression::el_leftdiv: result_type = RT_complex; if (a == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = b / a; break; case tree_expression::power: case tree_expression::elem_pow: return xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = real (a) < b; break; case tree_expression::cmp_le: result_type = RT_real; result = real (a) <= b; break; case tree_expression::cmp_eq: result_type = RT_real; result = a == b; break; case tree_expression::cmp_ge: result_type = RT_real; result = real (a) >= b; break; case tree_expression::cmp_gt: result_type = RT_real; result = real (a) > b; break; case tree_expression::cmp_ne: result_type = RT_real; result = a != b; break; case tree_expression::and: result_type = RT_real; result = ((a != 0.0) && b); break; case tree_expression::or: result_type = RT_real; result = ((a != 0.0) || b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 10 -*- tree_constant do_binary_op (const Complex& a, const Matrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::el_leftdiv: case tree_expression::leftdiv: if (a == 0.0) DIVIDE_BY_ZERO_ERROR; result_type = RT_complex; complex_result = b / a; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::el_div: return x_el_div (a, b); break; case tree_expression::divide: gripe_nonconformant (1, 1, b.rows (), b.columns ()); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 11 -*- tree_constant do_binary_op (const Complex& a, const Complex& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; double result = 0.0; Complex complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; if (b == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = a / b; break; case tree_expression::leftdiv: case tree_expression::el_leftdiv: result_type = RT_complex; if (a == 0.0) DIVIDE_BY_ZERO_ERROR; complex_result = b / a; break; case tree_expression::power: case tree_expression::elem_pow: return xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = real (a) < real (b); break; case tree_expression::cmp_le: result_type = RT_real; result = real (a) <= real (b); break; case tree_expression::cmp_eq: result_type = RT_real; result = a == b; break; case tree_expression::cmp_ge: result_type = RT_real; result = real (a) >= real (b); break; case tree_expression::cmp_gt: result_type = RT_real; result = real (a) > real (b); break; case tree_expression::cmp_ne: result_type = RT_real; result = a != b; break; case tree_expression::and: result_type = RT_real; result = ((a != 0.0) && (b != 0.0)); break; case tree_expression::or: result_type = RT_real; result = ((a != 0.0) || (b != 0.0)); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 12 -*- tree_constant do_binary_op (const Complex& a, const ComplexMatrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::el_leftdiv: case tree_expression::leftdiv: if (a == 0.0) DIVIDE_BY_ZERO_ERROR; result_type = RT_complex; complex_result = b / a; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::el_div: return x_el_div (a, b); break; case tree_expression::divide: gripe_nonconformant (1, 1, b.rows (), b.columns ()); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 13 -*- tree_constant do_binary_op (const ComplexMatrix& a, double b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; complex_result = a / b; break; case tree_expression::el_leftdiv: return x_el_div (b, a); break; case tree_expression::leftdiv: gripe_nonconformant (a.rows (), a.columns (), 1, 1); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 14 -*- tree_constant do_binary_op (const ComplexMatrix& a, const Matrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a - b; break; case tree_expression::el_mul: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = product (a, b); break; case tree_expression::multiply: result_type = RT_complex; if (m_mul_conform (a, b, 1)) complex_result = a * b; break; case tree_expression::el_div: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (a, b); break; case tree_expression::el_leftdiv: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (b, a); break; case tree_expression::leftdiv: return xleftdiv (a, b); break; case tree_expression::divide: return xdiv (a, b); break; case tree_expression::power: error ("can't do A ^ B for A and B both matrices"); break; case tree_expression::elem_pow: if (m_add_conform (a, b, 1)) return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 15 -*- tree_constant do_binary_op (const ComplexMatrix& a, const Complex& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; complex_result = a - b; break; case tree_expression::multiply: case tree_expression::el_mul: result_type = RT_complex; complex_result = a * b; break; case tree_expression::divide: case tree_expression::el_div: result_type = RT_complex; complex_result = a / b; break; case tree_expression::el_leftdiv: return x_el_div (b, a); break; case tree_expression::leftdiv: gripe_nonconformant (a.rows (), a.columns (), 1, 1); break; case tree_expression::power: return xpow (a, b); break; case tree_expression::elem_pow: return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } // -*- 16 -*- tree_constant do_binary_op (const ComplexMatrix& a, const ComplexMatrix& b, tree_expression::type t) { enum RT { RT_unknown, RT_real, RT_complex }; RT result_type = RT_unknown; Matrix result; ComplexMatrix complex_result; switch (t) { case tree_expression::add: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a + b; break; case tree_expression::subtract: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = a - b; break; case tree_expression::el_mul: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = product (a, b); break; case tree_expression::multiply: result_type = RT_complex; if (m_mul_conform (a, b, 1)) complex_result = a * b; break; case tree_expression::el_div: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (a, b); break; case tree_expression::el_leftdiv: result_type = RT_complex; if (m_add_conform (a, b, 1)) complex_result = quotient (b, a); break; case tree_expression::leftdiv: return xleftdiv (a, b); break; case tree_expression::divide: return xdiv (a, b); break; case tree_expression::power: error ("can't do A ^ B for A and B both matrices"); break; case tree_expression::elem_pow: if (m_add_conform (a, b, 1)) return elem_xpow (a, b); break; case tree_expression::cmp_lt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LT, a, b); break; case tree_expression::cmp_le: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_LE, a, b); break; case tree_expression::cmp_eq: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_EQ, a, b); break; case tree_expression::cmp_ge: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GE, a, b); break; case tree_expression::cmp_gt: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_GT, a, b); break; case tree_expression::cmp_ne: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_NE, a, b); break; case tree_expression::and: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_AND, a, b); break; case tree_expression::or: result_type = RT_real; if (m_add_conform (a, b, 1)) result = mx_stupid_bool_op (Matrix_OR, a, b); break; default: panic_impossible (); break; } if (error_state) return tree_constant (); assert (result_type != RT_unknown); if (result_type == RT_real) return tree_constant (result); else return tree_constant (complex_result); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/data.cc100666 415 17 41623 5702417120 13172 0ustar jweusers// data.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The function builtin_pwd adapted from a similar function from GNU Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "tree-const.h" #include "user-prefs.h" #include "help.h" #include "utils.h" #include "error.h" #include "gripes.h" #include "defun.h" #ifndef MIN #define MIN(a,b) ((a) < (b) ? (a) : (b)) #endif #ifndef ABS #define ABS(x) (((x) < 0) ? (-x) : (x)) #endif DEFUN ("all", Fall, Sall, 1, 1, "all (X): are all elements of X nonzero?") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) retval = args(0).all (); else print_usage ("all"); return retval; } DEFUN ("any", Fany, Sany, 1, 1, "any (X): are any elements of X nonzero?") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) retval = args(0).any (); else print_usage ("any"); return retval; } // These mapping functions may also be useful in other places, eh? typedef double (*d_dd_fcn) (double, double); static Matrix map (d_dd_fcn f, double x, const Matrix& y) { int nr = y.rows (); int nc = y.columns (); Matrix retval (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) retval.elem (i, j) = f (x, y.elem (i, j)); return retval; } static Matrix map (d_dd_fcn f, const Matrix& x, double y) { int nr = x.rows (); int nc = x.columns (); Matrix retval (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) retval.elem (i, j) = f (x.elem (i, j), y); return retval; } static Matrix map (d_dd_fcn f, const Matrix& x, const Matrix& y) { int x_nr = x.rows (); int x_nc = x.columns (); int y_nr = y.rows (); int y_nc = y.columns (); assert (x_nr == y_nr && x_nc == y_nc); Matrix retval (x_nr, x_nc); for (int j = 0; j < x_nc; j++) for (int i = 0; i < x_nr; i++) retval.elem (i, j) = f (x.elem (i, j), y.elem (i, j)); return retval; } DEFUN ("atan2", Fatan2, Satan2, 2, 1, "atan2 (Y, X): atan (Y / X) in range -pi to pi") { Octave_object retval; int nargin = args.length (); if (nargin == 2 && args(0).is_defined () && args(1).is_defined ()) { tree_constant arg_y = args(0); tree_constant arg_x = args(1); int y_nr = arg_y.rows (); int y_nc = arg_y.columns (); int x_nr = arg_x.rows (); int x_nc = arg_x.columns (); int arg_y_empty = empty_arg ("atan2", y_nr, y_nc); int arg_x_empty = empty_arg ("atan2", x_nr, x_nc); if (arg_y_empty > 0 && arg_x_empty > 0) return Matrix (); else if (arg_y_empty || arg_x_empty) return retval; int y_is_scalar = (y_nr == 1 && y_nc == 1); int x_is_scalar = (x_nr == 1 && x_nc == 1); if (y_is_scalar && x_is_scalar) { double y = arg_y.double_value (); if (! error_state) { double x = arg_x.double_value (); if (! error_state) retval = atan2 (y, x); } } else if (y_is_scalar) { double y = arg_y.double_value (); if (! error_state) { Matrix x = arg_x.matrix_value (); if (! error_state) retval = map (atan2, y, x); } } else if (x_is_scalar) { Matrix y = arg_y.matrix_value (); if (! error_state) { double x = arg_x.double_value (); if (! error_state) retval = map (atan2, y, x); } } else if (y_nr == x_nr && y_nc == x_nc) { Matrix y = arg_y.matrix_value (); if (! error_state) { Matrix x = arg_x.matrix_value (); if (! error_state) retval = map (atan2, y, x); } } else error ("atan2: nonconformant matrices"); } else print_usage ("atan2"); return retval; } DEFUN ("cumprod", Fcumprod, Scumprod, 1, 1, "cumprod (X): cumulative products") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) retval(0) = tmp.cumprod (); } else if (arg.is_complex_type ()) { ComplexMatrix tmp = arg.complex_matrix_value (); if (! error_state) retval(0) = tmp.cumprod (); } else { gripe_wrong_type_arg ("cumprod", arg); return retval; } } else print_usage ("cumprod"); return retval; } DEFUN ("cumsum", Fcumsum, Scumsum, 1, 1, "cumsum (X): cumulative sums") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) retval(0) = tmp.cumsum (); } else if (arg.is_complex_type ()) { ComplexMatrix tmp = arg.complex_matrix_value (); if (! error_state) retval(0) = tmp.cumsum (); } else { gripe_wrong_type_arg ("cumsum", arg); return retval; } } else print_usage ("cumsum"); return retval; } static tree_constant make_diag (const Matrix& v, int k) { int nr = v.rows (); int nc = v.columns (); assert (nc == 1 || nr == 1); tree_constant retval; int roff = 0; int coff = 0; if (k > 0) { roff = 0; coff = k; } else if (k < 0) { roff = -k; coff = 0; } if (nr == 1) { int n = nc + ABS (k); Matrix m (n, n, 0.0); for (int i = 0; i < nc; i++) m.elem (i+roff, i+coff) = v.elem (0, i); retval = tree_constant (m); } else { int n = nr + ABS (k); Matrix m (n, n, 0.0); for (int i = 0; i < nr; i++) m.elem (i+roff, i+coff) = v.elem (i, 0); retval = tree_constant (m); } return retval; } static tree_constant make_diag (const ComplexMatrix& v, int k) { int nr = v.rows (); int nc = v.columns (); assert (nc == 1 || nr == 1); tree_constant retval; int roff = 0; int coff = 0; if (k > 0) { roff = 0; coff = k; } else if (k < 0) { roff = -k; coff = 0; } if (nr == 1) { int n = nc + ABS (k); ComplexMatrix m (n, n, 0.0); for (int i = 0; i < nc; i++) m.elem (i+roff, i+coff) = v.elem (0, i); retval = tree_constant (m); } else { int n = nr + ABS (k); ComplexMatrix m (n, n, 0.0); for (int i = 0; i < nr; i++) m.elem (i+roff, i+coff) = v.elem (i, 0); retval = tree_constant (m); } return retval; } static tree_constant make_diag (const tree_constant& arg) { tree_constant retval; if (arg.is_real_type ()) { Matrix m = arg.matrix_value (); if (! error_state) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0) retval = Matrix (); else if (nr == 1 || nc == 1) retval = make_diag (m, 0); else { ColumnVector v = m.diag (); if (v.capacity () > 0) retval = v; } } else gripe_wrong_type_arg ("diag", arg); } else if (arg.is_complex_type ()) { ComplexMatrix cm = arg.complex_matrix_value (); if (! error_state) { int nr = cm.rows (); int nc = cm.columns (); if (nr == 0 || nc == 0) retval = Matrix (); else if (nr == 1 || nc == 1) retval = make_diag (cm, 0); else { ComplexColumnVector v = cm.diag (); if (v.capacity () > 0) retval = v; } } else gripe_wrong_type_arg ("diag", arg); } else gripe_wrong_type_arg ("diag", arg); return retval; } static tree_constant make_diag (const tree_constant& a, const tree_constant& b) { tree_constant retval; double tmp = b.double_value (); if (error_state) { error ("diag: invalid second argument"); return retval; } int k = NINT (tmp); int n = ABS (k) + 1; if (a.is_real_type ()) { if (a.is_scalar_type ()) { double d = a.double_value (); if (k == 0) retval = d; else if (k > 0) { Matrix m (n, n, 0.0); m.elem (0, k) = d; retval = m; } else if (k < 0) { Matrix m (n, n, 0.0); m.elem (-k, 0) = d; retval = m; } } else if (a.is_matrix_type ()) { Matrix m = a.matrix_value (); int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0) retval = Matrix (); else if (nr == 1 || nc == 1) retval = make_diag (m, k); else { ColumnVector d = m.diag (k); retval = d; } } else gripe_wrong_type_arg ("diag", a); } else if (a.is_complex_type ()) { if (a.is_scalar_type ()) { Complex c = a.complex_value (); if (k == 0) retval = c; else if (k > 0) { ComplexMatrix m (n, n, 0.0); m.elem (0, k) = c; retval = m; } else if (k < 0) { ComplexMatrix m (n, n, 0.0); m.elem (-k, 0) = c; retval = m; } } else if (a.is_matrix_type ()) { ComplexMatrix cm = a.complex_matrix_value (); int nr = cm.rows (); int nc = cm.columns (); if (nr == 0 || nc == 0) retval = Matrix (); else if (nr == 1 || nc == 1) retval = make_diag (cm, k); else { ComplexColumnVector d = cm.diag (k); retval = d; } } else gripe_wrong_type_arg ("diag", a); } else gripe_wrong_type_arg ("diag", a); return retval; } DEFUN ("diag", Fdiag, Sdiag, 2, 1, "diag (X [,k]): form/extract diagonals") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) retval = make_diag (args(0)); else if (nargin == 2 && args(0).is_defined () && args(1).is_defined ()) retval = make_diag (args(0), args(1)); else print_usage ("diag"); return retval; } DEFUN ("prod", Fprod, Sprod, 1, 1, "prod (X): products") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) retval(0) = tmp.prod (); } else if (arg.is_complex_type ()) { ComplexMatrix tmp = arg.complex_matrix_value (); if (! error_state) retval(0) = tmp.prod (); } else { gripe_wrong_type_arg ("prod", arg); return retval; } } else print_usage ("prod"); return retval; } DEFUN ("size", Fsize, Ssize, 1, 1, "[m, n] = size (x): return rows and columns of X") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) { int nr = args(0).rows (); int nc = args(0).columns (); if (nargout == 0 || nargout == 1) { Matrix m (1, 2); m.elem (0, 0) = nr; m.elem (0, 1) = nc; retval = m; } else if (nargout == 2) { retval(1) = (double) nc; retval(0) = (double) nr; } else print_usage ("size"); } else print_usage ("size"); return retval; } DEFUN ("sum", Fsum, Ssum, 1, 1, "sum (X): sum of elements") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) retval(0) = tmp.sum (); } else if (arg.is_complex_type ()) { ComplexMatrix tmp = arg.complex_matrix_value (); if (! error_state) retval(0) = tmp.sum (); } else { gripe_wrong_type_arg ("sum", arg); return retval; } } else print_usage ("sum"); return retval; } DEFUN ("sumsq", Fsumsq, Ssumsq, 1, 1, "sumsq (X): sum of squares of elements") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_real_type ()) { Matrix tmp = arg.matrix_value (); if (! error_state) retval(0) = tmp.sumsq (); } else if (arg.is_complex_type ()) { ComplexMatrix tmp = arg.complex_matrix_value (); if (! error_state) retval(0) = tmp.sumsq (); } else { gripe_wrong_type_arg ("sumsq", arg); return retval; } } else print_usage ("sumsq"); return retval; } DEFUN ("is_struct", Fis_struct, Sis_struct, 1, 1, "is_struct (x): return nonzero if x is a structure") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_map ()) retval = 1.0; else retval = 0.0; } else print_usage ("is_struct"); return retval; } static void check_dimensions (int& nr, int& nc, const char *warnfor) { if (nr < 0 || nc < 0) { if (user_pref.treat_neg_dim_as_zero) { nr = (nr < 0) ? 0 : nr; nc = (nc < 0) ? 0 : nc; } else error ("%s: can't create a matrix with negative dimensions", warnfor); } } static void get_dimensions (const tree_constant& a, const char *warn_for, int& nr, int& nc) { if (a.is_scalar_type ()) { double tmp = a.double_value (); nr = nc = NINT (tmp); } else { nr = a.rows (); nc = a.columns (); if ((nr == 1 && nc == 2) || (nr == 2 && nc == 1)) { ColumnVector v = a.vector_value (); if (error_state) return; nr = NINT (v.elem (0)); nc = NINT (v.elem (1)); } else warning ("%s (A): use %s (size (A)) instead", warn_for, warn_for); } check_dimensions (nr, nc, warn_for); // May set error_state. } static void get_dimensions (const tree_constant& a, const tree_constant& b, const char *warn_for, int& nr, int& nc) { nr = NINT (a.double_value ()); nc = NINT (b.double_value ()); if (error_state) error ("%s: expecting two scalar arguments", warn_for); else check_dimensions (nr, nc, warn_for); // May set error_state. } static tree_constant fill_matrix (const tree_constant& a, double val, const char *warn_for) { int nr, nc; get_dimensions (a, warn_for, nr, nc); if (error_state) return tree_constant (); Matrix m (nr, nc, val); return m; } static tree_constant fill_matrix (const tree_constant& a, const tree_constant& b, double val, const char *warn_for) { int nr, nc; get_dimensions (a, b, warn_for, nr, nc); // May set error_state. if (error_state) return tree_constant (); Matrix m (nr, nc, val); return m; } DEFUN ("ones", Fones, Sones, 2, 1, "ones (N), ones (N, M), ones (X): create a matrix of all ones") { Octave_object retval; int nargin = args.length (); switch (nargin) { case 0: retval = 1.0; break; case 1: retval = fill_matrix (args(0), 1.0, "ones"); break; case 2: retval = fill_matrix (args(0), args(1), 1.0, "ones"); break; default: print_usage ("ones"); break; } return retval; } DEFUN ("zeros", Fzeros, Szeros, 2, 1, "zeros (N), zeros (N, M), zeros (X): create a matrix of all zeros") { Octave_object retval; int nargin = args.length (); switch (nargin) { case 0: retval = 0.0; break; case 1: retval = fill_matrix (args(0), 0.0, "zeros"); break; case 2: retval = fill_matrix (args(0), args(1), 0.0, "zeros"); break; default: print_usage ("zeros"); break; } return retval; } static tree_constant identity_matrix (const tree_constant& a) { int nr, nc; get_dimensions (a, "eye", nr, nc); // May set error_state. if (error_state) return tree_constant (); Matrix m (nr, nc, 0.0); if (nr > 0 && nc > 0) { int n = MIN (nr, nc); for (int i = 0; i < n; i++) m.elem (i, i) = 1.0; } return m; } static tree_constant identity_matrix (const tree_constant& a, const tree_constant& b) { int nr, nc; get_dimensions (a, b, "eye", nr, nc); // May set error_state. if (error_state) return tree_constant (); Matrix m (nr, nc, 0.0); if (nr > 0 && nc > 0) { int n = MIN (nr, nc); for (int i = 0; i < n; i++) m.elem (i, i) = 1.0; } return m; } DEFUN ("eye", Feye, Seye, 2, 1, "eye (N), eye (N, M), eye (X): create an identity matrix") { Octave_object retval; int nargin = args.length (); switch (nargin) { case 0: retval = 1.0; break; case 1: retval = identity_matrix (args(0)); break; case 2: retval = identity_matrix (args(0), args(1)); break; default: print_usage ("eye"); break; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/dirfns.cc100666 415 17 23117 5702417117 13552 0ustar jweusers// dirfns.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The functions listed below were adapted from a similar functions from GNU Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc. polite_directory_format absolute_pathname absolute_program base_pathname make_absolute pathname_backup change_to_directory get_working_directory */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include // This mess suggested by the autoconf manual. // unistd.h defines _POSIX_VERSION on POSIX.1 systems. #if defined (HAVE_DIRENT_H) || defined (_POSIX_VERSION) #include #define NLENGTH(dirent) (strlen((dirent)->d_name)) #else #define dirent direct #define NLENGTH(dirent) ((dirent)->d_namlen) #if defined (HAVE_SYS_NDIR_H) #include #endif #if defined (HAVE_SYS_DIR_H) #include #endif #if defined (HAVE_NDIR_H) #include #endif #endif #include "statdefs.h" #include "procstream.h" #include "tree-const.h" #include "oct-obj.h" #include "octave.h" #include "dirfns.h" #include "pager.h" #include "error.h" #include "utils.h" #include "defun.h" extern "C" { #include extern char *strerror (int); } #ifndef MAXPATHLEN #define MAXPATHLEN 1024 #endif // Temp storage for a path. static char tdir[MAXPATHLEN]; // Non-zero means follow symbolic links that point to directories just // as if they are real directories. static int follow_symbolic_links = 1; // Non-zero means that pwd always give verbatim directory, regardless // of symbolic link following. static int verbatim_pwd = 1; // Remove the last N directories from PATH. Do not PATH blank. // PATH must contain enough space for MAXPATHLEN characters. void pathname_backup (char *path, int n) { register char *p; if (! *path) return; p = path + (strlen (path) - 1); while (n--) { while (*p == '/' && p != path) p--; while (*p != '/' && p != path) p--; *++p = '\0'; } } // Return a pretty pathname. If the first part of the pathname is the // same as $HOME, then replace that with `~'. char * polite_directory_format (char *name) { int l = home_directory ? strlen (home_directory) : 0; if (l > 1 && strncmp (home_directory, name, l) == 0 && (! name[l] || name[l] == '/')) { strcpy (tdir + 1, name + l); tdir[0] = '~'; return (tdir); } else return name; } // Return 1 if STRING contains an absolute pathname, else 0. int absolute_pathname (const char *string) { if (! string || ! *string) return 0; if (*string == '/') return 1; if (*string++ == '.') { if ((! *string) || *string == '/') return 1; if (*string++ == '.') if (! *string || *string == '/') return 1; } return 0; } // Return 1 if STRING is an absolute program name; it is absolute if // it contains any slashes. This is used to decide whether or not to // look up through $PATH. int absolute_program (const char *string) { return (strchr (string, '/') != 0); } // Return the `basename' of the pathname in STRING (the stuff after // the last '/'). If STRING is not a full pathname, simply return it. char * base_pathname (char *string) { char *p = strrchr (string, '/'); if (! absolute_pathname (string)) return (string); if (p) return (++p); else return (string); } // Turn STRING (a pathname) into an absolute pathname, assuming that // DOT_PATH contains the symbolic location of '.'. This always // returns a new string, even if STRING was an absolute pathname to // begin with. char * make_absolute (const char *string, const char *dot_path) { static char current_path[MAXPATHLEN]; register char *cp; if (! dot_path || *string == '/') return strsave (string); strcpy (current_path, dot_path); if (! current_path[0]) strcpy (current_path, "./"); cp = current_path + (strlen (current_path) - 1); if (*cp++ != '/') *cp++ = '/'; *cp = '\0'; while (*string) { if (*string == '.') { if (! string[1]) return strsave (current_path); if (string[1] == '/') { string += 2; continue; } if (string[1] == '.' && (string[2] == '/' || ! string[2])) { string += 2; if (*string) string++; pathname_backup (current_path, 1); cp = current_path + strlen (current_path); continue; } } while (*string && *string != '/') *cp++ = *string++; if (*string) *cp++ = *string++; *cp = '\0'; } return strsave (current_path); } // Has file `A' been modified after time `T'? // // case: // // a newer than t returns 1 // a older than t returns 0 // stat on a fails returns -1 int is_newer (const char *fa, time_t t) { struct stat fa_sb; register int fa_stat; register int status = 0; fa_stat = stat (fa, &fa_sb); if (fa_stat != 0) status = -1; if (status != 0) return status; return (fa_sb.st_mtime > t); } // Return a consed string which is the current working directory. // FOR_WHOM is the name of the caller for error printing. char * get_working_directory (const char *for_whom) { if (! follow_symbolic_links) { if (the_current_working_directory) delete [] the_current_working_directory; the_current_working_directory = 0; } if (! the_current_working_directory) { char *directory; the_current_working_directory = new char [MAXPATHLEN]; directory = getcwd (the_current_working_directory, MAXPATHLEN); if (! directory) { message (for_whom, the_current_working_directory); delete [] the_current_working_directory; the_current_working_directory = 0; return 0; } } return the_current_working_directory; } // Do the work of changing to the directory NEWDIR. Handle symbolic // link following, etc. static int change_to_directory (const char *newdir) { char *t; if (follow_symbolic_links) { if (! the_current_working_directory) get_working_directory ("cd_links"); if (the_current_working_directory) t = make_absolute (newdir, the_current_working_directory); else t = strsave (newdir); // Get rid of trailing `/'. { register int len_t = strlen (t); if (len_t > 1) { --len_t; if (t[len_t] == '/') t[len_t] = '\0'; } } if (chdir (t) < 0) { delete [] t; return 0; } if (the_current_working_directory) strcpy (the_current_working_directory, t); delete [] t; return 1; } else { if (chdir (newdir) < 0) return 0; else return 1; } } DEFUN_TEXT ("cd", Fcd, Scd, 2, 1, "cd [dir]\n\ \n\ change current working directory\n\ if no arguments are given, the current directory is changed to the\n\ users home directory") { Octave_object retval; DEFINE_ARGV("cd"); if (argc > 1) { static char *dirname = 0; if (dirname) free (dirname); dirname = tilde_expand (argv[1]); if (dirname && ! change_to_directory (dirname)) { error ("%s: %s", dirname, strerror (errno)); DELETE_ARGV; return retval; } } else { if (!home_directory) { DELETE_ARGV; return retval; } if (!change_to_directory (home_directory)) { error ("%s: %s", home_directory, strerror (errno)); DELETE_ARGV; return retval; } } char *directory = get_working_directory ("cd"); tree_constant *dir = new tree_constant (directory); bind_builtin_variable ("PWD", dir, 1); DELETE_ARGV; return retval; } DEFALIAS (chdir, cd); // Get a directory listing. DEFUN_TEXT ("ls", Fls, Sls, -1, 1, "ls [options]\n\ \n\ print a directory listing") { Octave_object retval; DEFINE_ARGV("ls"); ostrstream ls_buf; ls_buf << "ls -C "; for (int i = 1; i < argc; i++) ls_buf << tilde_expand (argv[i]) << " "; ls_buf << ends; char *ls_command = ls_buf.str (); iprocstream cmd (ls_command); char ch; ostrstream output_buf; while (cmd.get (ch)) output_buf.put (ch); output_buf << ends; maybe_page_output (output_buf); delete [] ls_command; DELETE_ARGV; return retval; } DEFALIAS (dir, ls); DEFUN ("pwd", Fpwd, Spwd, 1, 0, "pwd (): print current working directory") { Octave_object retval; char *directory; if (verbatim_pwd) { char *buffer = new char [MAXPATHLEN]; directory = getcwd (buffer, MAXPATHLEN); if (!directory) { warning ("pwd: can't find working directory!"); delete buffer; } } else { directory = get_working_directory ("pwd"); } if (directory) { char *s = strconcat (directory, "\n"); retval = s; delete [] s; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/dynamic-ld.cc100666 415 17 14524 5702417116 14307 0ustar jweusers// dynamic-ld.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include extern "C" { #include #define boolean kpathsea_boolean #define false kpathsea_false #define true kpathsea_true #include #undef true #undef false #undef boolean } #include "dynamic-ld.h" #include "tree-const.h" #include "user-prefs.h" #include "variables.h" #include "defaults.h" #include "dirfns.h" #include "octave.h" #include "utils.h" #include "error.h" typedef builtin_function * (*Octave_builtin_fcn_struct_fcn)(void); // XXX FIXME XXX -- should this list be in a user-level variable, // with default taken from the environment? #ifdef WITH_DLD #ifndef STD_LIB_PATH #define STD_LIB_PATH "/lib:/usr/lib:/usr/local/lib" #endif #ifndef OCTAVE_LIB_PATH #define OCTAVE_LIB_PATH OCTAVE_LIBDIR ":" FLIB_PATH ":" CXXLIB_PATH #endif static char *lib_dir_path = OCTAVE_LIB_PATH ":" STD_LIB_PATH; // This is the list of interesting libraries that Octave is linked // with. Maybe it should include the readline, info, and kpathsea // libraries. Would there ever be a time that they would really be // needed? #ifndef SYSTEM_LIB_LIST #define SYSTEM_LIB_LIST "libtermcap.a:libm.a" ":" CXXLIB_LIST #endif #ifndef OCTAVE_LIB_LIST #define OCTAVE_LIB_LIST "liboctdld.a:liboctave.a:libcruft.a:libdld.a" #endif static char *lib_list = OCTAVE_LIB_LIST ":" FLIB_LIST ":" SYSTEM_LIB_LIST; static char * mangle_octave_builtin_name (const char *name) { char *tmp = strconcat (name, "__FRC13Octave_objecti"); char *retval = strconcat ("F", tmp); delete [] tmp; return retval; } static char * mangle_octave_oct_file_name (const char *name) { char *tmp = strconcat (name, "__Fv"); char *retval = strconcat ("FS", tmp); delete [] tmp; return retval; } static void octave_dld_init (void) { static int initialized = 0; if (! initialized) { char *full_path = 0; char *tmp = dld_find_executable (raw_prog_name); if (tmp) { full_path = make_absolute (tmp, the_current_working_directory); free (tmp); } if (full_path) { int status = dld_init (full_path); if (status != 0) error ("failed to load symbols from `%s'", full_path); else initialized = 1; } else { error ("octave_dld_init: can't find full path to `%s'", raw_prog_name); } } } static void octave_list_undefined_symbols (ostream& os) { char **list = dld_list_undefined_sym (); if (list) { os << "undefined symbols:\n\n"; for (int i = 0; i < dld_undefined_sym_count; i++) os << list[i] << "\n"; os << "\n"; } } static void * dld_octave_resolve_reference (const char *name, const char *file = 0) { dld_create_reference (name); if (file) { if (dld_link (file) != 0) { error ("failed to link file %s", file); return 0; } if (dld_function_executable_p (name)) return (void *) dld_get_func (name); } // For each library, try to find it in a list of directories, then // link to it. It would have been nice to use the kpathsea functions // here too, but calls to them can't be nested as they would need to // be here... char **libs = pathstring_to_vector (lib_list); char **ptr = libs; char *lib_list_elt; while ((lib_list_elt = *ptr++)) { char *lib = kpse_path_search (lib_dir_path, lib_list_elt, kpathsea_true); if (lib && dld_link (lib) != 0) { error ("failed to link library %s", lib); return 0; } if (dld_function_executable_p (name)) return (void *) dld_get_func (name); } // If we get here, there was a problem. ostrstream output_buf; octave_list_undefined_symbols (output_buf); char *msg = output_buf.str (); error (msg); delete [] msg; return 0; } static Octave_builtin_fcn dld_octave_builtin (const char *name) { Octave_builtin_fcn retval = 0; char *mangled_name = mangle_octave_builtin_name (name); retval = (Octave_builtin_fcn) dld_octave_resolve_reference (mangled_name); delete [] mangled_name; return retval; } static int dld_octave_oct_file (const char *name) { char *oct_file = oct_file_in_path (name); if (oct_file) { char *mangled_name = mangle_octave_oct_file_name (name); Octave_builtin_fcn_struct_fcn f = (Octave_builtin_fcn_struct_fcn) dld_octave_resolve_reference (mangled_name, oct_file); if (f) { builtin_function *s = f (); if (s) { install_builtin_function (s); return 1; } } delete [] oct_file; } return 0; } #endif Octave_builtin_fcn load_octave_builtin (const char *name) { #ifdef WITH_DLD return dld_octave_builtin (name); #else return 0; #endif } int load_octave_oct_file (const char *name) { #ifdef WITH_DLD return dld_octave_oct_file (name); #endif return 0; } void init_dynamic_linker (void) { #ifdef WITH_DLD octave_dld_init (); #endif } // OLD: #if 0 void octave_dld_tc2_unlink_by_symbol (const char *name, int hard) { // XXX FIXME XXX -- need to determine the name mangling scheme // automatically, in case it changes, or is different on different // systems, even if they have g++. char *mangled_fcn_name = strconcat (name, "__FRC13Octave_objecti"); int status = dld_unlink_by_symbol (mangled_fcn_name, hard); if (status != 0) error ("octave_dld_tc2_unlink_by_symbol: %s", dld_strerror (0)); delete [] mangled_fcn_name; } void octave_dld_tc2_unlink_by_file (const char *name, int hard) { int status = dld_unlink_by_file (name, hard); if (status != 0) error ("octave_dld_tc2_unlink_by_file: %s", dld_strerror (0)); } #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/error.cc100666 415 17 10662 5702417115 13415 0ustar jweusers// error.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "utils.h" #include "error.h" #include "pager.h" #include "oct-obj.h" #include "tree-const.h" #include "defun.h" // Current error state. int error_state = 0; // XXX FIXME XXX int suppress_octave_error_messages = 0; static void verror (const char *name, const char *fmt, va_list args) { flush_output_to_pager (); if (name) cerr << name << ": "; cerr.vform (fmt, args); cerr << endl; ostrstream output_buf; if (name) output_buf << name << ": "; output_buf.vform (fmt, args); output_buf << endl; char *msg = output_buf.str (); maybe_write_to_diary_file (msg); delete [] msg; } static void error_1 (const char *name, const char *fmt, va_list args) { if (error_state != -2) { if (! error_state) error_state = 1; if (! suppress_octave_error_messages) { int len = 0; if (fmt && *fmt && fmt[(len = strlen (fmt)) - 1] == '\n') { error_state = -2; char *tmp_fmt = strsave (fmt); tmp_fmt[len - 1] = '\0'; verror (name, tmp_fmt, args); delete [] tmp_fmt; } else verror (name, fmt, args); } } } void message (const char *name, const char *fmt, ...) { va_list args; va_start (args, fmt); verror (name, fmt, args); va_end (args); } void usage (const char *fmt, ...) { va_list args; va_start (args, fmt); error_state = -1; verror ("usage", fmt, args); va_end (args); } void warning (const char *fmt, ...) { va_list args; va_start (args, fmt); verror ("warning", fmt, args); va_end (args); } void error (const char *fmt, ...) { va_list args; va_start (args, fmt); error_1 ("error", fmt, args); va_end (args); } void parse_error (const char *fmt, ...) { va_list args; va_start (args, fmt); error_1 (0, fmt, args); va_end (args); } void panic (const char *fmt, ...) { flush_output_to_pager (); va_list args; va_start (args, fmt); verror ("panic", fmt, args); va_end (args); abort (); } DEFUN ("error", Ferror, Serror, 1, 1, "error (MESSAGE): print MESSAGE and set the error state.\n\ This should eventually take us up to the top level, possibly\n\ printing traceback messages as we go.\n\ \n\ If MESSAGE ends in a newline character, traceback messages are not\n\ printed.") { Octave_object retval; char *msg = "unspecified error"; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) { if (args(0).is_string ()) { msg = args(0).string_value (); if (! msg || ! *msg) return retval; } else if (args(0).is_empty ()) return retval; } error (msg); return retval; } DEFUN ("warning", Fwarning, Swarning, 1, 1, "warning (MESSAGE): print a warning MESSAGE.\n\ \n\ See also: error") { Octave_object retval; char *msg = "unspecified warning"; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) { if (args(0).is_string ()) { msg = args(0).string_value (); if (! msg || ! *msg) return retval; } else if (args(0).is_empty ()) return retval; } warning (msg); return retval; } DEFUN ("usage", Fusage, Susage, 1, 1, "usage (MESSAGE): print a usage MESSAGE.\n\ \n\ See also: error") { Octave_object retval; char *msg = "unknown"; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) { if (args(0).is_string ()) { msg = args(0).string_value (); if (! msg || ! *msg) return retval; } else if (args(0).is_empty ()) return retval; } usage (msg); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/file-io.cc100666 415 17 106275 5702417034 13636 0ustar jweusers// file-io.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Written by John C. Campbell . #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include #include #include #include "dMatrix.h" #include "statdefs.h" #include "file-io.h" #include "input.h" #include "octave-hist.h" #include "tree-const.h" #include "error.h" #include "help.h" #include "utils.h" #include "pager.h" #include "defun.h" #include "sysdep.h" #include "mappers.h" #include "variables.h" // keeps a count of args sent to printf or scanf static int fmt_arg_count = 0; // double linked list containing relevant information about open files static DLList file_list; file_info::file_info (void) { file_number = -1; file_name = 0; file_fptr = 0; file_mode = 0; } file_info::file_info (int n, const char *nm, FILE *t, const char *md) { file_number = n; file_name = strsave (nm); file_fptr = t; file_mode = strsave (md); } file_info::file_info (const file_info& f) { file_number = f.file_number; file_name = strsave (f.file_name); file_fptr = f.file_fptr; file_mode = strsave (f.file_mode); } file_info& file_info::operator = (const file_info& f) { if (this != & f) { file_number = f.file_number; delete [] file_name; file_name = strsave (f.file_name); file_fptr = f.file_fptr; delete [] file_mode; file_mode = strsave (f.file_mode); } return *this; } file_info::~file_info (void) { delete [] file_name; delete [] file_mode; } int file_info::number (void) const { return file_number; } const char * file_info::name (void) const { return file_name; } FILE * file_info::fptr (void) const { return file_fptr; } const char * file_info::mode (void) const { return file_mode; } void initialize_file_io (void) { file_info octave_stdin (0, "stdin", stdin, "r"); file_info octave_stdout (1, "stdout", stdout, "w"); file_info octave_stderr (2, "stderr", stderr, "w"); file_list.append (octave_stdin); file_list.append (octave_stdout); file_list.append (octave_stderr); } // Given a file name or number, return a pointer to the corresponding // open file. If the file has not already been opened, return NULL. Pix return_valid_file (const tree_constant& arg) { if (arg.is_string ()) { Pix p = file_list.first (); file_info file; int file_count = file_list.length (); for (int i = 0; i < file_count; i++) { char *file_name = arg.string_value (); file = file_list (p); if (strcmp (file.name (), file_name) == 0) return p; file_list.next (p); } } else { double file_num = arg.double_value (); if (! error_state) { if ((double) NINT (file_num) != file_num) error ("file number not an integer value"); else { Pix p = file_list.first (); file_info file; int file_count = file_list.length (); for (int i = 0; i < file_count; i++) { file = file_list (p); if (file.number () == file_num) return p; file_list.next (p); } error ("no file with that number"); } } else error ("inapproriate file specifier"); } return 0; } static Pix fopen_file_for_user (const char *name, const char *mode, const char *warn_for) { FILE *file_ptr = fopen (name, mode); if (file_ptr) { int file_number = file_list.length () + 1; file_info file (file_number, name, file_ptr, mode); file_list.append (file); Pix p = file_list.first (); file_info file_from_list; int file_count = file_list.length (); for (int i = 0; i < file_count; i++) { file_from_list = file_list (p); if (strcmp (file_from_list.name (), name) == 0) return p; file_list.next (p); } } error ("%s: unable to open file `%s'", warn_for, name); return 0; } static Pix file_io_get_file (const tree_constant& arg, const char *mode, const char *warn_for) { Pix p = return_valid_file (arg); if (! p) { if (arg.is_string ()) { char *name = arg.string_value (); struct stat buffer; int status = stat (name, &buffer); if (status == 0) { if ((buffer.st_mode & S_IFREG) == S_IFREG) p = fopen_file_for_user (name, mode, warn_for); else error ("%s: invalid file type", warn_for); } else if (status < 0 && *mode != 'r') p = fopen_file_for_user (name, mode, warn_for); else error ("%s: can't stat file `%s'", warn_for, name); } else error ("%s: invalid file specifier", warn_for); } return p; } DEFUN ("fclose", Ffclose, Sfclose, 1, 1, "fclose (FILENAME or FILENUM): close a file") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("fclose"); else retval = fclose_internal (args); return retval; } Octave_object fclose_internal (const Octave_object& args) { Octave_object retval; Pix p = return_valid_file (args(0)); if (! p) return retval; file_info file = file_list (p); if (file.number () < 3) { warning ("fclose: can't close stdin, stdout, or stderr!"); return retval; } int success = fclose (file.fptr ()); file_list.del (p); if (success == 0) retval(0) = 1.0; // succeeded else { error ("fclose: error on closing file"); retval(0) = 0.0; // failed } return retval; } DEFUN ("fflush", Ffflush, Sfflush, 1, 1, "fflush (FILENAME or FILENUM): flush buffered data to output file") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("fflush"); else retval = fflush_internal (args); return retval; } Octave_object fflush_internal (const Octave_object& args) { Octave_object retval; Pix p = return_valid_file (args(0)); if (! p) return retval; file_info file = file_list (p); if (strcmp (file.mode (), "r") == 0) { warning ("can't flush an input stream"); return retval; } int success = 0; if (file.number () == 1) flush_output_to_pager (); else success = fflush (file.fptr ()); if (success == 0) retval(0) = 1.0; // succeeded else { error ("fflush: write error"); retval(0) = 0.0; // failed } return retval; } static int valid_mode (const char *mode) { if (mode) { char m = mode[0]; if (m == 'r' || m == 'w' || m == 'a') { m = mode[1]; return (m == '\0' || (m == '+' && mode[2] == '\0')); } } return 0; } DEFUN ("fgets", Ffgets, Sfgets, 2, 2, "[STRING, LENGTH] = fgets (FILENAME or FILENUM, LENGTH)\n\ \n\ read a string from a file") { Octave_object retval; int nargin = args.length (); if (nargin != 2) print_usage ("fgets"); else retval = fgets_internal (args, nargout); return retval; } Octave_object fgets_internal (const Octave_object& args, int nargout) { Octave_object retval; Pix p = file_io_get_file (args(0), "r", "fgets"); if (! p) return retval; double dlen = args(1).double_value (); if (error_state) return retval; int length = NINT (dlen); if ((double) length != dlen) { error ("fgets: length not an integer value"); return retval; } file_info file = file_list (p); char string [length+1]; char *success = fgets (string, length+1, file.fptr ()); if (! success) { retval(0) = -1.0; return retval; } if (nargout == 2) retval(1) = (double) strlen (string); retval(0) = string; return retval; } DEFUN ("fopen", Ffopen, Sfopen, 2, 1, "FILENUM = fopen (FILENAME, MODE): open a file\n\ \n\ Valid values for mode include:\n\ \n\ r : open text file for reading\n\ w : open text file for writing; discard previous contents if any\n\ a : append; open or create text file for writing at end of file\n\ r+ : open text file for update (i.e., reading and writing)\n\ w+ : create text file for update; discard previous contents if any\n\ a+ : append; open or create text file for update, writing at end\n\n\ Update mode permits reading from and writing to the same file.") { Octave_object retval; int nargin = args.length (); if (nargin != 2) print_usage ("fopen"); else retval = fopen_internal (args); return retval; } Octave_object fopen_internal (const Octave_object& args) { Octave_object retval; Pix p; if (! args(0).is_string ()) { error ("fopen: file name must be a string"); return retval; } p = return_valid_file (args(0)); if (p) { file_info file = file_list (p); retval(0) = (double) file.number (); return retval; } if (! args(1).is_string ()) { error ("fopen: file mode must be a string"); return retval; } char *name = args(0).string_value (); char *mode = args(1).string_value (); if (! valid_mode (mode)) { error ("fopen: invalid mode"); return retval; } struct stat buffer; if (stat (name, &buffer) == 0 && (buffer.st_mode & S_IFDIR) == S_IFDIR) { error ("fopen: can't open directory"); return retval; } FILE *file_ptr = fopen (name, mode); if (! file_ptr) { error ("fopen: unable to open file `%s'", name); return retval; } int file_number = file_list.length () + 1; file_info file (file_number, name, file_ptr, mode); file_list.append (file); retval(0) = (double) file_number; return retval; } DEFUN ("freport", Ffreport, Sfreport, 0, 1, "freport (): list open files and their status") { Octave_object retval; int nargin = args.length (); if (nargin > 0) warning ("freport: ignoring extra arguments"); retval = freport_internal (); return retval; } Octave_object freport_internal (void) { Octave_object retval; Pix p = file_list.first (); ostrstream output_buf; output_buf << "\n number mode name\n\n"; int file_count = file_list.length (); for (int i = 0; i < file_count; i++) { file_info file = file_list (p); output_buf.form ("%7d%6s %s\n", file.number (), file.mode (), file.name ()); file_list.next (p); } output_buf << "\n" << ends; maybe_page_output (output_buf); return retval; } DEFUN ("frewind", Ffrewind, Sfrewind, 1, 1, "frewind (FILENAME or FILENUM): set file position at beginning of file") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("frewind"); else retval = frewind_internal (args); return retval; } Octave_object frewind_internal (const Octave_object& args) { Octave_object retval; Pix p = file_io_get_file (args(0), "a+", "frewind"); if (p) { file_info file = file_list (p); rewind (file.fptr ()); } return retval; } DEFUN ("fseek", Ffseek, Sfseek, 3, 1, "fseek (FILENAME or FILENUM, OFFSET [, ORIGIN])\n\ \n\ set file position for reading or writing") { Octave_object retval; int nargin = args.length (); if (nargin != 2 && nargin != 3) print_usage ("fseek"); else retval = fseek_internal (args); return retval; } Octave_object fseek_internal (const Octave_object& args) { Octave_object retval; int nargin = args.length (); Pix p = file_io_get_file (args(0), "a+", "fseek"); if (! p) return retval; long origin = SEEK_SET; double doff = args(1).double_value (); if (error_state) return retval; long offset = NINT (doff); if ((double) offset != doff) { error ("fseek: offset not an integer value"); return retval; } if (nargin == 3) { double dorig = args(2).double_value (); if (error_state) return retval; origin = NINT (dorig); if ((double) dorig != origin) { error ("fseek: origin not an integer value"); return retval; } if (origin == 0) origin = SEEK_SET; else if (origin == 1) origin = SEEK_CUR; else if (origin == 2) origin = SEEK_END; else { error ("fseek: invalid value for origin"); return retval; } } file_info file = file_list (p); int success = fseek (file.fptr (), offset, origin); if (success == 0) retval(0) = 1.0; // succeeded else { error ("fseek: file error"); retval(0) = 0.0; // failed } return retval; } // Tell current position of file. DEFUN ("ftell", Fftell, Sftell, 1, 1, "POSITION = ftell (FILENAME or FILENUM): returns the current file position") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("ftell"); else retval = ftell_internal (args); return retval; } Octave_object ftell_internal (const Octave_object& args) { Octave_object retval; Pix p = file_io_get_file (args(0), "a+", "ftell"); if (p) { file_info file = file_list (p); long offset = ftell (file.fptr ()); retval(0) = (double) offset; if (offset == -1L) error ("ftell: write error"); } return retval; } void close_files (void) { Pix p = file_list.first (); int file_count = file_list.length (); for (int i = 0; i < file_count; i++) { if (p) { file_info file = file_list (p); if (i > 2) // do not close stdin, stdout, stderr! { int success = fclose (file.fptr ()); if (success != 0) error ("closing %s", file.name ()); } file_list.del (p); } else { error ("inconsistent state for internal file list!"); break; } } } static int process_printf_format (const char *s, const Octave_object& args, ostrstream& sb, const char *type) { ostrstream fmt; int nargin = args.length (); fmt << "%"; // do_printf() already blew past this one... int chars_from_fmt_str = 0; again: switch (*s) { case '+': case '-': case ' ': case '0': case '#': chars_from_fmt_str++; fmt << *s++; goto again; case '\0': goto invalid_format; default: break; } if (*s == '*') { if (fmt_arg_count > nargin) { error ("%s: not enough arguments", type); return -1; } double tmp_len = args(fmt_arg_count++).double_value (); if (error_state) { error ("%s: `*' must be replaced by an integer", type); return -1; } fmt << NINT (tmp_len); s++; chars_from_fmt_str++; } else { while (*s != '\0' && isdigit (*s)) { chars_from_fmt_str++; fmt << *s++; } } if (*s == '\0') goto invalid_format; if (*s == '.') { chars_from_fmt_str++; fmt << *s++; } if (*s == '*') { if (*(s-1) == '*') goto invalid_format; if (fmt_arg_count > nargin) { error ("%s: not enough arguments", type); return -1; } double tmp_len = args(fmt_arg_count++).double_value (); if (error_state) { error ("%s: `*' must be replaced by an integer", type); return -1; } fmt << NINT (tmp_len); s++; chars_from_fmt_str++; } else { while (*s != '\0' && isdigit (*s)) { chars_from_fmt_str++; fmt << *s++; } } if (*s == '\0') goto invalid_format; if (*s != '\0' && (*s == 'h' || *s == 'l' || *s == 'L')) { chars_from_fmt_str++; fmt << *s++; } if (*s == '\0') goto invalid_format; if (fmt_arg_count > nargin) { error ("%s: not enough arguments", type); return -1; } switch (*s) { case 'd': case 'i': case 'o': case 'u': case 'x': case 'X': { double d = args(fmt_arg_count++).double_value (); int val = NINT (d); if (error_state || (double) val != d) goto invalid_conversion; else { chars_from_fmt_str++; fmt << *s << ends; char *tmp_fmt = fmt.str (); sb.form (tmp_fmt, val); delete [] tmp_fmt; return chars_from_fmt_str; } } case 'e': case 'E': case 'f': case 'g': case 'G': { double val = args(fmt_arg_count++).double_value (); if (error_state) goto invalid_conversion; else { chars_from_fmt_str++; fmt << *s << ends; char *tmp_fmt = fmt.str (); sb.form (tmp_fmt, val); delete [] tmp_fmt; return chars_from_fmt_str; } } case 's': { char *val = args(fmt_arg_count++).string_value (); if (error_state) goto invalid_conversion; else { chars_from_fmt_str++; fmt << *s << ends; char *tmp_fmt = fmt.str (); sb.form (tmp_fmt, val); delete [] tmp_fmt; return chars_from_fmt_str; } } case 'c': { char *val = args(fmt_arg_count++).string_value (); if (error_state || strlen (val) != 1) goto invalid_conversion; else { chars_from_fmt_str++; fmt << *s << ends; char *tmp_fmt = fmt.str (); sb.form (tmp_fmt, *val); delete [] tmp_fmt; return chars_from_fmt_str; } } default: goto invalid_format; } invalid_conversion: error ("%s: invalid conversion", type); return -1; invalid_format: error ("%s: invalid format", type); return -1; } // Formatted printing to a file. DEFUN ("fprintf", Ffprintf, Sfprintf, -1, 1, "fprintf (FILENAME or FILENUM, FORMAT, ...)") { Octave_object retval; int nargin = args.length (); if (nargin < 2) print_usage ("fprintf"); else retval = do_printf ("fprintf", args, nargout); return retval; } // Formatted printing. DEFUN ("printf", Fprintf, Sprintf, -1, 1, "printf (FORMAT, ...)") { Octave_object retval; int nargin = args.length (); if (nargin < 1) print_usage ("printf"); else retval = do_printf ("printf", args, nargout); return retval; } // Formatted printing to a string. DEFUN ("sprintf", Fsprintf, Ssprintf, -1, 1, "s = sprintf (FORMAT, ...)") { Octave_object retval; int nargin = args.length (); if (nargin < 1) print_usage ("sprintf"); else retval = do_printf ("sprintf", args, nargout); return retval; } Octave_object do_printf (const char *type, const Octave_object& args, int nargout) { Octave_object retval; fmt_arg_count = 0; char *fmt; file_info file; if (strcmp (type, "fprintf") == 0) { Pix p = file_io_get_file (args(0), "a+", type); if (! p) return retval; file = file_list (p); if (file.mode () == "r") { error ("%s: file is read only", type); return retval; } fmt = args(1).string_value (); if (error_state) { error ("%s: format must be a string", type); return retval; } fmt_arg_count += 2; } else { fmt = args(0).string_value (); if (error_state) { error ("%s: invalid format string", type); return retval; } fmt_arg_count++; } // Scan fmt for % escapes and print out the arguments. ostrstream output_buf; char *ptr = fmt; for (;;) { char c; while ((c = *ptr++) != '\0' && c != '%') output_buf << c; if (c == '\0') break; if (*ptr == '%') { ptr++; output_buf << c; continue; } // We must be looking at a format specifier. Extract it or fail. int status = process_printf_format (ptr, args, output_buf, type); if (status < 0) return retval; ptr += status; } output_buf << ends; if (strcmp (type, "printf") == 0 || (strcmp (type, "fprintf") == 0 && file.number () == 1)) { maybe_page_output (output_buf); } else if (strcmp (type, "fprintf") == 0) { char *msg = output_buf.str (); int success = fputs (msg, file.fptr ()); if (success == EOF) warning ("%s: unknown failure writing to file", type); delete [] msg; } else if (strcmp (type, "sprintf") == 0) { char *msg = output_buf.str (); retval(0) = msg; delete [] msg; } return retval; } static int process_scanf_format (const char *s, ostrstream& fmt, const char *type, int nargout, FILE* fptr, Octave_object& values) { fmt << "%"; int chars_from_fmt_str = 0; int store_value = 1; int string_width = 0; int success = 1; if (*s == '*') { store_value = 0; s++; chars_from_fmt_str++; } if (isdigit (*s)) { ostrstream str_number; while (*s != '\0' && isdigit (*s)) { chars_from_fmt_str++; str_number << *s; fmt << *s++; } str_number << ends; char *number = str_number.str (); string_width = atoi (number); delete [] number; } if (*s == '\0') goto invalid_format; if (*s != '\0' && (*s == 'h' || *s == 'l' || *s == 'L')) { chars_from_fmt_str++; s++; } if (*s == '\0') goto invalid_format; // Even if we don't have a place to store them, attempt to convert // everything specified by the format string. if (fmt_arg_count > (nargout ? nargout : 1)) store_value = 0; switch (*s) { case 'd': case 'i': case 'o': case 'u': case 'x': case 'X': { chars_from_fmt_str++; fmt << *s << ends; int temp; char *str = fmt.str (); success = fscanf (fptr, str, &temp); delete [] str; if (success > 0 && store_value) values(fmt_arg_count++) = (double) temp; } break; case 'e': case 'E': case 'f': case 'g': case 'G': { chars_from_fmt_str++; fmt << 'l' << *s << ends; double temp; char *str = fmt.str (); success = fscanf (fptr, str, &temp); delete [] str; if (success > 0 && store_value) values(fmt_arg_count++) = temp; } break; case 's': { if (string_width < 1) { // XXX FIXME XXX -- The code below is miscompiled on the Alpha with // gcc 2.6.0, so that string_width is never incremented, even though // reading the data works correctly. One fix is to use a fixed-size // buffer... // string_width = 8192; string_width = 0; long original_position = ftell (fptr); int c; while ((c = getc (fptr)) != EOF && isspace (c)) ; // Don't count leading whitespace. if (c != EOF) string_width++; for (;;) { c = getc (fptr); if (c != EOF && ! isspace (c)) string_width++; else break; } fseek (fptr, original_position, SEEK_SET); } chars_from_fmt_str++; char temp [string_width+1]; fmt << *s << ends; char *str = fmt.str (); success = fscanf (fptr, str, temp); delete [] str; temp[string_width] = '\0'; if (success > 0 && store_value) values(fmt_arg_count++) = temp; } break; case 'c': { if (string_width < 1) string_width = 1; chars_from_fmt_str++; char temp [string_width+1]; memset (temp, '\0', string_width+1); fmt << *s << ends; char *str = fmt.str (); success = fscanf (fptr, str, temp); delete [] str; temp[string_width] = '\0'; if (success > 0 && store_value) values(fmt_arg_count++) = temp; } break; default: goto invalid_format; } if (success > 0) return chars_from_fmt_str; else if (success == 0) warning ("%s: invalid conversion", type); else if (success == EOF) { if (strcmp (type, "fscanf") == 0) warning ("%s: end of file reached before final conversion", type); else if (strcmp (type, "sscanf") == 0) warning ("%s: end of string reached before final conversion", type); else if (strcmp (type, "scanf") == 0) warning ("%s: end of input reached before final conversion", type); } else { invalid_format: warning ("%s: invalid format", type); } return -1; } // Formatted reading from a file. DEFUN ("fscanf", Ffscanf, Sfscanf, 2, -1, "[A, B, C, ...] = fscanf (FILENAME or FILENUM, FORMAT)") { Octave_object retval; int nargin = args.length (); if (nargin != 1 && nargin != 2) print_usage ("fscanf"); else retval = do_scanf ("fscanf", args, nargout); return retval; } // Formatted reading. DEFUN ("scanf", Fscanf, Sscanf, 1, -1, "[A, B, C, ...] = scanf (FORMAT)") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("scanf"); else retval = do_scanf ("scanf", args, nargout); return retval; } // Formatted reading from a string. DEFUN ("sscanf", Fsscanf, Ssscanf, 2, -1, "[A, B, C, ...] = sscanf (STRING, FORMAT)") { Octave_object retval; int nargin = args.length (); if (nargin != 2) print_usage ("sscanf"); else retval = do_scanf ("sscanf", args, nargout); return retval; } Octave_object do_scanf (const char *type, const Octave_object& args, int nargout) { Octave_object retval; char *scanf_fmt = 0; char *tmp_file = 0; int tmp_file_open = 0; FILE *fptr = 0; file_info file; fmt_arg_count = 0; if (strcmp (type, "scanf") != 0) { scanf_fmt = args(1).string_value (); if (error_state) { error ("%s: format must be a string", type); return retval; } } int doing_fscanf = (strcmp (type, "fscanf") == 0); if (doing_fscanf) { Pix p = file_io_get_file (args(0), "r", type); if (! p) return retval; file = file_list (p); if (strcmp (file.mode (), "w") == 0 || strcmp (file.mode (), "a") == 0) { error ("%s: this file is opened for writing only", type); return retval; } fptr = file.fptr (); } if ((! fptr && args(0).is_string ()) || (doing_fscanf && file.number () == 0)) { char *string; if (strcmp (type, "scanf") == 0) scanf_fmt = args(0).string_value (); if (strcmp (type, "scanf") == 0 || (doing_fscanf && file.number () == 0)) { // XXX FIXME XXX -- this should probably be possible for more than // just stdin/stdout pairs, using a list of output streams to flush. // The list could be created with a function like iostream's tie(). flush_output_to_pager (); string = gnu_readline (""); if (string && *string) maybe_save_history (string); } else string = args(0).string_value (); tmp_file = octave_tmp_file_name (); fptr = fopen (tmp_file, "w+"); if (! fptr) { error ("%s: error opening temporary file", type); return retval; } tmp_file_open = 1; unlink (tmp_file); if (! string) { error ("%s: no string to scan", type); return retval; } int success = fputs (string, fptr); fflush (fptr); rewind (fptr); if (success < 0) { error ("%s: trouble writing temporary file", type); fclose (fptr); return retval; } } else if (! doing_fscanf) { error ("%s: first argument must be a string", type); return retval; } // Scan scanf_fmt for % escapes and assign the arguments. retval.resize (nargout); char *ptr = scanf_fmt; for (;;) { ostrstream fmt; char c; while ((c = *ptr++) != '\0' && c != '%') fmt << c; if (c == '\0') break; if (*ptr == '%') { ptr++; fmt << c; continue; } // We must be looking at a format specifier. Extract it or fail. int status = process_scanf_format (ptr, fmt, type, nargout, fptr, retval); if (status < 0) { if (fmt_arg_count == 0) retval.resize (0); break; } ptr += status; } if (tmp_file_open) fclose (fptr); return retval; } // Find out how many elements are left to read. static long num_items_remaining (FILE *fptr, char *type) { size_t size; if (strcasecmp (type, "uchar") == 0) size = sizeof (u_char); else if (strcasecmp (type, "char") == 0) size = sizeof (char); else if (strcasecmp (type, "short") == 0) size = sizeof (short); else if (strcasecmp (type, "ushort") == 0) size = sizeof (u_short); else if (strcasecmp (type, "int") == 0) size = sizeof (int); else if (strcasecmp (type, "uint") == 0) size = sizeof (u_int); else if (strcasecmp (type, "long") == 0) size = sizeof (long); else if (strcasecmp (type, "ulong") == 0) size = sizeof (u_long); else if (strcasecmp (type, "float") == 0) size = sizeof (float); else if (strcasecmp (type, "double") == 0) size = sizeof (double); else return 0; long curr_pos = ftell (fptr); fseek (fptr, 0, SEEK_END); long end_of_file = ftell (fptr); fseek (fptr, curr_pos, SEEK_SET); long len = end_of_file - curr_pos; return len / size; } DEFUN ("fread", Ffread, Sfread, 3, 2, "[DATA, COUNT] = fread (FILENUM, SIZE, PRECISION)\n\ \n\ Reads data in binary form of type PRECISION from a file.\n\ \n\ FILENUM : file number from fopen\n\ SIZE : size specification for the Data matrix\n\ PRECISION : type of data to read, valid types are\n\ \n\ 'char', 'schar', 'short', 'int', 'long', 'float'\n\ 'double', 'uchar', 'ushort', 'uint', 'ulong'\n\ \n\ DATA : matrix in which the data is stored\n\ COUNT : number of elements read") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 3) print_usage ("fread"); else retval = fread_internal (args, nargout); return retval; } // Read binary data from a file. // // [data, count] = fread (fid, size, 'precision') // // fid : the file id from fopen // size : the size of the matrix or vector or scaler to read // // n : reads n elements of a column vector // inf : reads to the end of file (default) // [m, n] : reads enough elements to fill the matrix // the number of columns can be inf // // precision : type of the element. Can be: // // char, uchar, schar, short, ushort, int, uint, // long, ulong, float, double // // Default is uchar. // // data : output data // count : number of elements read Octave_object fread_internal (const Octave_object& args, int nargout) { Octave_object retval; int nargin = args.length (); Pix p = file_io_get_file (args(0), "r", "fread"); if (! p) return retval; // Get type and number of bytes per element to read. char *prec = "uchar"; if (nargin > 2) { prec = args(2).string_value (); if (error_state) { error ("fread: precision must be a specified as a string"); return retval; } } // Get file info. file_info file = file_list (p); FILE *fptr = file.fptr (); // Set up matrix to read into. If specified in arguments use that // number, otherwise read everyting left in file. double dnr = 0.0; double dnc = 0.0; int nr; int nc; if (nargin > 1) { if (args(1).is_scalar_type ()) { dnr = args(1).double_value (); if (error_state) return retval; dnc = 1.0; } else { ColumnVector tmp = args(1).vector_value (); if (error_state || tmp.length () != 2) { error ("fread: invalid size specification\n"); return retval; } dnr = tmp.elem (0); dnc = tmp.elem (1); } if ((xisinf (dnr)) && (xisinf (dnc))) { error ("fread: number of rows and columns cannot both be infinite"); return retval; } if (xisinf (dnr)) { nc = NINT (dnc); int n = num_items_remaining (fptr, prec); nr = n / nc; if (n > nr * nc) nr++; } else if (xisinf (dnc)) { nr = NINT (dnr); int n = num_items_remaining (fptr, prec); nc = n / nr; if (n > nc * nr) nc++; } else { nr = NINT (dnr); nc = NINT (dnc); } } else { // No size parameter, read what's left of the file. nc = 1; int n = num_items_remaining (fptr, prec); nr = n / nc; if (n > nr * nc) nr++; } Matrix m (nr, nc, octave_NaN); // Read data. int count = m.read (fptr, prec); if (nargout > 1) retval(1) = (double) count; retval(0) = m; return retval; } DEFUN ("fwrite", Ffwrite, Sfwrite, 3, 1, "COUNT = fwrite (FILENUM, DATA, PRECISION)\n\ \n\ Writes data to a file in binary form of size PRECISION\n\ \n\ FILENUM : file number from fopen\n\ DATA : matrix of elements to be written\n\ PRECISION : type of data to read, valid types are\n\ \n\ 'char', 'schar', 'short', 'int', 'long', 'float'\n\ 'double', 'uchar', 'ushort', 'uint', 'ulong'\n\ \n\ COUNT : number of elements written") { Octave_object retval; int nargin = args.length (); if (nargin < 2 || nargin > 3) print_usage ("fwrite"); else retval = fwrite_internal (args, nargout); return retval; } // Write binary data to a file. // // count = fwrite (fid, data, 'precision') // // fid : file id from fopen // Data : data to be written // precision : type of output element. Can be: // // char, uchar, schar, short, ushort, int, uint, // long, float, double // // Default is uchar. // // count : the number of elements written Octave_object fwrite_internal (const Octave_object& args, int nargout) { Octave_object retval; int nargin = args.length (); Pix p = file_io_get_file (args(0), "a+", "fwrite"); if (! p) return retval; // Get type and number of bytes per element to read. char *prec = "uchar"; if (nargin > 2) { prec = args(2).string_value (); if (error_state) { error ("fwrite: precision must be a specified as a string"); return retval; } } file_info file = file_list (p); Matrix m = args(1).matrix_value (); if (! error_state) { int count = m.write (file.fptr (), prec); retval(0) = (double) count; } return retval; } DEFUN ("feof", Ffeof, Sfeof, 1, 1, "ERROR = feof (FILENAME or FILENUM)\n\ \n\ Returns a non zero value for an end of file condition for the\n\ file specified by FILENAME or FILENUM from fopen") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("feof"); else retval = feof_internal (args, nargout); return retval; } // Check for an EOF condition on a file opened by fopen. // // eof = feof (fid) // // fid : file id from fopen // eof : non zero for an end of file condition Octave_object feof_internal (const Octave_object& args, int nargout) { Octave_object retval; // Get file info. Pix p = return_valid_file (args(1)); if (! p) return retval; file_info file = file_list (p); retval(0) = (double) feof (file.fptr ()); return retval; } DEFUN ("ferror", Fferror, Sferror, 1, 1, "ERROR = ferror (FILENAME or FILENUM)\n\ \n\ Returns a non zero value for an error condition on the\n\ file specified by FILENAME or FILENUM from fopen") { Octave_object retval; int nargin = args.length (); if (nargin != 1) print_usage ("ferror"); else retval = ferror_internal (args, nargout); return retval; } // Check for an error condition on a file opened by fopen. // // [message, errnum] = ferror (fid) // // fid : file id from fopen // message : system error message // errnum : error number Octave_object ferror_internal (const Octave_object& args, int nargout) { Octave_object retval; // Get file info. Pix p = return_valid_file (args(0)); if (! p) return retval; file_info file = file_list (p); int ierr = ferror (file.fptr ()); if (nargout > 1) retval(1) = (double) ierr; retval(0) = strsave (strerror (ierr)); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/fnmatch.c100666 415 17 10223 5650373516 13542 0ustar jweusers/* Copyright (C) 1991 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include #include "fnmatch.h" #if !defined (__GNU_LIBRARY__) && !defined (STDC_HEADERS) # if !defined (errno) extern int errno; # endif /* !errno */ #endif /* Match STRING against the filename pattern PATTERN, returning zero if it matches, FNM_NOMATCH if not. */ int fnmatch (pattern, string, flags) char *pattern; char *string; int flags; { register char *p = pattern, *n = string; register char c; if ((flags & ~__FNM_FLAGS) != 0) { errno = EINVAL; return (-1); } while ((c = *p++) != '\0') { switch (c) { case '?': if (*n == '\0') return (FNM_NOMATCH); else if ((flags & FNM_PATHNAME) && *n == '/') return (FNM_NOMATCH); else if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); break; case '\\': if (!(flags & FNM_NOESCAPE)) c = *p++; if (*n != c) return (FNM_NOMATCH); break; case '*': if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); for (c = *p++; c == '?' || c == '*'; c = *p++, ++n) if (((flags & FNM_PATHNAME) && *n == '/') || (c == '?' && *n == '\0')) return (FNM_NOMATCH); if (c == '\0') return (0); { char c1 = (!(flags & FNM_NOESCAPE) && c == '\\') ? *p : c; for (--p; *n != '\0'; ++n) if ((c == '[' || *n == c1) && fnmatch (p, n, flags & ~FNM_PERIOD) == 0) return (0); return (FNM_NOMATCH); } case '[': { /* Nonzero if the sense of the character class is inverted. */ register int not; if (*n == '\0') return (FNM_NOMATCH); if ((flags & FNM_PERIOD) && *n == '.' && (n == string || ((flags & FNM_PATHNAME) && n[-1] == '/'))) return (FNM_NOMATCH); /* Make sure there is a closing `]'. If there isn't, the `[' is just a character to be matched. */ { register char *np; for (np = p; np && *np && *np != ']'; np++); if (np && !*np) { if (*n != '[') return (FNM_NOMATCH); goto next_char; } } not = (*p == '!' || *p == '^'); if (not) ++p; c = *p++; for (;;) { register char cstart = c, cend = c; if (!(flags & FNM_NOESCAPE) && c == '\\') cstart = cend = *p++; if (c == '\0') /* [ (unterminated) loses. */ return (FNM_NOMATCH); c = *p++; if ((flags & FNM_PATHNAME) && c == '/') /* [/] can never match. */ return (FNM_NOMATCH); if (c == '-' && *p != ']') { cend = *p++; if (!(flags & FNM_NOESCAPE) && cend == '\\') cend = *p++; if (cend == '\0') return (FNM_NOMATCH); c = *p++; } if (*n >= cstart && *n <= cend) goto matched; if (c == ']') break; } if (!not) return (FNM_NOMATCH); next_char: break; matched: /* Skip the rest of the [...] that already matched. */ while (c != ']') { if (c == '\0') /* [... (unterminated) loses. */ return (FNM_NOMATCH); c = *p++; if (!(flags & FNM_NOESCAPE) && c == '\\') /* 1003.2d11 is unclear if this is right. %%% */ ++p; } if (not) return (FNM_NOMATCH); } break; default: if (c != *n) return (FNM_NOMATCH); } ++n; } if (*n == '\0') return (0); return (FNM_NOMATCH); } octave-1.1.0/src/getopt.c100666 415 17 50614 5452411734 13427 0ustar jweusers/* Getopt for GNU. NOTE: getopt is now part of the C library, so if you don't know what "Keep this file name-space clean" means, talk to roland@gnu.ai.mit.edu before changing it! Copyright (C) 1987, 88, 89, 90, 91, 92, 1993 Free Software Foundation, Inc. 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, 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, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* NOTE!!! AIX requires this to be the first thing in the file. Do not put ANYTHING before it! */ #if !defined (__GNUC__) && defined (_AIX) #pragma alloca #endif #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifdef __GNUC__ #define alloca __builtin_alloca #else /* not __GNUC__ */ #if defined (HAVE_ALLOCA_H) || (defined(sparc) && (defined(sun) || (!defined(USG) && !defined(SVR4) && !defined(__svr4__)))) #include #else #ifndef _AIX char *alloca (); #endif #endif /* alloca.h */ #endif /* not __GNUC__ */ #if !__STDC__ && !defined(const) && IN_GCC #define const #endif /* This tells Alpha OSF/1 not to define a getopt prototype in . */ #ifndef _NO_PROTO #define _NO_PROTO #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #if defined (_LIBC) || !defined (__GNU_LIBRARY__) /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ #undef alloca /* Don't include stdlib.h for non-GNU C libraries because some of them contain conflicting prototypes for getopt. */ #include #else /* Not GNU C library. */ #define __alloca alloca #endif /* GNU C library. */ /* If GETOPT_COMPAT is defined, `+' as well as `--' can introduce a long-named option. Because this is not POSIX.2 compliant, it is being phased out. */ /* #define GETOPT_COMPAT */ /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. Setting the environment variable POSIXLY_CORRECT disables permutation. Then the behavior is completely standard. GNU application programs can use a third alternative mode in which they can distinguish the relative order of options and other arguments. */ #include "getopt.h" /* For communication from `getopt' to the caller. When `getopt' finds an option that takes an argument, the argument value is returned here. Also, when `ordering' is RETURN_IN_ORDER, each non-option ARGV-element is returned here. */ char *optarg = 0; /* Index in ARGV of the next element to be scanned. This is used for communication to and from the caller and for communication between successive calls to `getopt'. On entry to `getopt', zero means this is the first call; initialize. When `getopt' returns EOF, this is the index of the first of the non-option elements that the caller should itself scan. Otherwise, `optind' communicates from one call to the next how much of ARGV has been scanned so far. */ /* XXX 1003.2 says this must be 1 before any call. */ int optind = 0; /* The next char to be scanned in the option-element in which the last option character we returned was found. This allows us to pick up the scan where we left off. If this is zero, or a null string, it means resume the scan by advancing to the next ARGV-element. */ static char *nextchar; /* Callers store zero here to inhibit the error message for unrecognized options. */ int opterr = 1; /* Set to an option character which was unrecognized. This must be initialized on some systems to avoid linking in the system's own getopt implementation. */ int optopt = '?'; /* Describe how to deal with options that follow non-option ARGV-elements. If the caller did not specify anything, the default is REQUIRE_ORDER if the environment variable POSIXLY_CORRECT is defined, PERMUTE otherwise. REQUIRE_ORDER means don't recognize them as options; stop option processing when the first non-option is seen. This is what Unix does. This mode of operation is selected by either setting the environment variable POSIXLY_CORRECT, or using `+' as the first character of the list of option characters. PERMUTE is the default. We permute the contents of ARGV as we scan, so that eventually all the non-options are at the end. This allows options to be given in any order, even with programs that were not written to expect this. RETURN_IN_ORDER is an option available to programs that were written to expect options and other ARGV-elements in any order and that care about the ordering of the two. We describe each non-option ARGV-element as if it were the argument of an option with character code 1. Using `-' as the first character of the list of option characters selects this mode of operation. The special argument `--' forces an end of option-scanning regardless of the value of `ordering'. In the case of RETURN_IN_ORDER, only `--' can cause `getopt' to return EOF with `optind' != ARGC. */ static enum { REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER } ordering; #ifdef __GNU_LIBRARY__ /* We want to avoid inclusion of string.h with non-GNU libraries because there are many ways it can cause trouble. On some systems, it contains special magic macros that don't work in GCC. */ #include #define my_index strchr #define my_bcopy(src, dst, n) memcpy ((dst), (src), (n)) #else /* Avoid depending on library functions or files whose names are inconsistent. */ char *getenv (); static char * my_index (str, chr) const char *str; int chr; { while (*str) { if (*str == chr) return (char *) str; str++; } return 0; } static void my_bcopy (from, to, size) const char *from; char *to; int size; { int i; for (i = 0; i < size; i++) to[i] = from[i]; } #endif /* GNU C library. */ /* Handle permutation of arguments. */ /* Describe the part of ARGV that contains non-options that have been skipped. `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is the index after the last of them. */ static int first_nonopt; static int last_nonopt; /* Exchange two adjacent subsequences of ARGV. One subsequence is elements [first_nonopt,last_nonopt) which contains all the non-options that have been skipped so far. The other is elements [last_nonopt,optind), which contains all the options processed since those non-options were skipped. `first_nonopt' and `last_nonopt' are relocated so that they describe the new indices of the non-options in ARGV after they are moved. */ static void exchange (argv) char **argv; { int nonopts_size = (last_nonopt - first_nonopt) * sizeof (char *); char **temp = (char **) __alloca (nonopts_size); /* Interchange the two blocks of data in ARGV. */ my_bcopy ((char *) &argv[first_nonopt], (char *) temp, nonopts_size); my_bcopy ((char *) &argv[last_nonopt], (char *) &argv[first_nonopt], (optind - last_nonopt) * sizeof (char *)); my_bcopy ((char *) temp, (char *) &argv[first_nonopt + optind - last_nonopt], nonopts_size); /* Update records for the slots the non-options now occupy. */ first_nonopt += (optind - last_nonopt); last_nonopt = optind; } /* Scan elements of ARGV (whose length is ARGC) for option characters given in OPTSTRING. If an element of ARGV starts with '-', and is not exactly "-" or "--", then it is an option element. The characters of this element (aside from the initial '-') are option characters. If `getopt' is called repeatedly, it returns successively each of the option characters from each of the option elements. If `getopt' finds another option character, it returns that character, updating `optind' and `nextchar' so that the next call to `getopt' can resume the scan with the following option character or ARGV-element. If there are no more option characters, `getopt' returns `EOF'. Then `optind' is the index in ARGV of the first ARGV-element that is not an option. (The ARGV-elements have been permuted so that those that are not options now come last.) OPTSTRING is a string containing the legitimate option characters. If an option character is seen that is not listed in OPTSTRING, return '?' after printing an error message. If you set `opterr' to zero, the error message is suppressed but we still return '?'. If a char in OPTSTRING is followed by a colon, that means it wants an arg, so the following text in the same ARGV-element, or the text of the following ARGV-element, is returned in `optarg'. Two colons mean an option that wants an optional arg; if there is text in the current ARGV-element, it is returned in `optarg', otherwise `optarg' is set to zero. If OPTSTRING starts with `-' or `+', it requests different methods of handling the non-option ARGV-elements. See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. Long-named options begin with `--' instead of `-'. Their names may be abbreviated as long as the abbreviation is unique or is an exact match for some defined option. If they have an argument, it follows the option name in the same ARGV-element, separated from the option name by a `=', or else the in next ARGV-element. When `getopt' finds a long-named option, it returns 0 if that option's `flag' field is nonzero, the value of the option's `val' field if the `flag' field is zero. The elements of ARGV aren't really const, because we permute them. But we pretend they're const in the prototype to be compatible with other systems. LONGOPTS is a vector of `struct option' terminated by an element containing a name which is zero. LONGIND returns the index in LONGOPT of the long-named option found. It is only valid when a long-named option has been found by the most recent call. If LONG_ONLY is nonzero, '-' as well as '--' can introduce long-named options. */ int _getopt_internal (argc, argv, optstring, longopts, longind, long_only) int argc; char *const *argv; const char *optstring; const struct option *longopts; int *longind; int long_only; { int option_index; optarg = 0; /* Initialize the internal data when the first call is made. Start processing options with ARGV-element 1 (since ARGV-element 0 is the program name); the sequence of previously skipped non-option ARGV-elements is empty. */ if (optind == 0) { first_nonopt = last_nonopt = optind = 1; nextchar = NULL; /* Determine how to handle the ordering of options and nonoptions. */ if (optstring[0] == '-') { ordering = RETURN_IN_ORDER; ++optstring; } else if (optstring[0] == '+') { ordering = REQUIRE_ORDER; ++optstring; } else if (getenv ("POSIXLY_CORRECT") != NULL) ordering = REQUIRE_ORDER; else ordering = PERMUTE; } if (nextchar == NULL || *nextchar == '\0') { if (ordering == PERMUTE) { /* If we have just processed some options following some non-options, exchange them so that the options come first. */ if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (last_nonopt != optind) first_nonopt = optind; /* Now skip any additional non-options and extend the range of non-options previously skipped. */ while (optind < argc && (argv[optind][0] != '-' || argv[optind][1] == '\0') #ifdef GETOPT_COMPAT && (longopts == NULL || argv[optind][0] != '+' || argv[optind][1] == '\0') #endif /* GETOPT_COMPAT */ ) optind++; last_nonopt = optind; } /* Special ARGV-element `--' means premature end of options. Skip it like a null option, then exchange with previous non-options as if it were an option, then skip everything else like a non-option. */ if (optind != argc && !strcmp (argv[optind], "--")) { optind++; if (first_nonopt != last_nonopt && last_nonopt != optind) exchange ((char **) argv); else if (first_nonopt == last_nonopt) first_nonopt = optind; last_nonopt = argc; optind = argc; } /* If we have done all the ARGV-elements, stop the scan and back over any non-options that we skipped and permuted. */ if (optind == argc) { /* Set the next-arg-index to point at the non-options that we previously skipped, so the caller will digest them. */ if (first_nonopt != last_nonopt) optind = first_nonopt; return EOF; } /* If we have come to a non-option and did not permute it, either stop the scan or describe it to the caller and pass it by. */ if ((argv[optind][0] != '-' || argv[optind][1] == '\0') #ifdef GETOPT_COMPAT && (longopts == NULL || argv[optind][0] != '+' || argv[optind][1] == '\0') #endif /* GETOPT_COMPAT */ ) { if (ordering == REQUIRE_ORDER) return EOF; optarg = argv[optind++]; return 1; } /* We have found another option-ARGV-element. Start decoding its characters. */ nextchar = (argv[optind] + 1 + (longopts != NULL && argv[optind][1] == '-')); } if (longopts != NULL && ((argv[optind][0] == '-' && (argv[optind][1] == '-' || long_only)) #ifdef GETOPT_COMPAT || argv[optind][0] == '+' #endif /* GETOPT_COMPAT */ )) { const struct option *p; char *s = nextchar; int exact = 0; int ambig = 0; const struct option *pfound = NULL; int indfound; while (*s && *s != '=') s++; /* Test all options for either exact match or abbreviated matches. */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp (p->name, nextchar, s - nextchar)) { if (s - nextchar == strlen (p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else /* Second nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (opterr) fprintf (stderr, "%s: option `%s' is ambiguous\n", argv[0], argv[optind]); nextchar += strlen (nextchar); optind++; return '?'; } if (pfound != NULL) { option_index = indfound; optind++; if (*s) { /* Don't test has_arg with >, because some C compilers don't allow it to be used on enums. */ if (pfound->has_arg) optarg = s + 1; else { if (opterr) { if (argv[optind - 1][1] == '-') /* --option */ fprintf (stderr, "%s: option `--%s' doesn't allow an argument\n", argv[0], pfound->name); else /* +option or -option */ fprintf (stderr, "%s: option `%c%s' doesn't allow an argument\n", argv[0], argv[optind - 1][0], pfound->name); } nextchar += strlen (nextchar); return '?'; } } else if (pfound->has_arg == 1) { if (optind < argc) optarg = argv[optind++]; else { if (opterr) fprintf (stderr, "%s: option `%s' requires an argument\n", argv[0], argv[optind - 1]); nextchar += strlen (nextchar); return optstring[0] == ':' ? ':' : '?'; } } nextchar += strlen (nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* Can't find it as a long option. If this is not getopt_long_only, or the option starts with '--' or is not a valid short option, then it's an error. Otherwise interpret it as a short option. */ if (!long_only || argv[optind][1] == '-' #ifdef GETOPT_COMPAT || argv[optind][0] == '+' #endif /* GETOPT_COMPAT */ || my_index (optstring, *nextchar) == NULL) { if (opterr) { if (argv[optind][1] == '-') /* --option */ fprintf (stderr, "%s: unrecognized option `--%s'\n", argv[0], nextchar); else /* +option or -option */ fprintf (stderr, "%s: unrecognized option `%c%s'\n", argv[0], argv[optind][0], nextchar); } nextchar = (char *) ""; optind++; return '?'; } } /* Look at and handle the next option-character. */ { char c = *nextchar++; char *temp = my_index (optstring, c); /* Increment `optind' when we start to process its last character. */ if (*nextchar == '\0') ++optind; if (temp == NULL || c == ':') { if (opterr) { #if 0 if (c < 040 || c >= 0177) fprintf (stderr, "%s: unrecognized option, character code 0%o\n", argv[0], c); else fprintf (stderr, "%s: unrecognized option `-%c'\n", argv[0], c); #else /* 1003.2 specifies the format of this message. */ fprintf (stderr, "%s: illegal option -- %c\n", argv[0], c); #endif } optopt = c; return '?'; } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*nextchar != '\0') { optarg = nextchar; optind++; } else optarg = 0; nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*nextchar != '\0') { optarg = nextchar; /* If we end this ARGV-element by taking the rest as an arg, we must advance to the next element now. */ optind++; } else if (optind == argc) { if (opterr) { #if 0 fprintf (stderr, "%s: option `-%c' requires an argument\n", argv[0], c); #else /* 1003.2 specifies the format of this message. */ fprintf (stderr, "%s: option requires an argument -- %c\n", argv[0], c); #endif } optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; } else /* We already incremented `optind' once; increment it again when taking next ARGV-elt as argument. */ optarg = argv[optind++]; nextchar = NULL; } } return c; } } int getopt (argc, argv, optstring) int argc; char *const *argv; const char *optstring; { return _getopt_internal (argc, argv, optstring, (const struct option *) 0, (int *) 0, 0); } #endif /* _LIBC or not __GNU_LIBRARY__. */ #ifdef TEST /* Compile with -DTEST to make an executable for use in testing the above definition of `getopt'. */ int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; c = getopt (argc, argv, "abc:d:0123456789"); if (c == EOF) break; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ octave-1.1.0/src/getopt1.c100666 415 17 10056 5452411735 13505 0ustar jweusers/* getopt_long and getopt_long_only entry points for GNU getopt. Copyright (C) 1987, 88, 89, 90, 91, 92, 1993 Free Software Foundation, Inc. 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, 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, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "getopt.h" #if !__STDC__ && !defined(const) && IN_GCC #define const #endif #include /* Comment out all this code if we are using the GNU C Library, and are not actually compiling the library itself. This code is part of the GNU C Library, but also included in many other GNU distributions. Compiling and linking in this code is a waste when using the GNU C library (especially if it is a shared library). Rather than having every GNU program understand `configure --with-gnu-libc' and omit the object files, it is simpler to just do this in the source for each such file. */ #if defined (_LIBC) || !defined (__GNU_LIBRARY__) /* This needs to come after some library #include to get __GNU_LIBRARY__ defined. */ #ifdef __GNU_LIBRARY__ #include #else char *getenv (); #endif #ifndef NULL #define NULL 0 #endif int getopt_long (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 0); } /* Like getopt_long, but '-' as well as '--' can indicate a long option. If an option that starts with '-' (not '--') doesn't match a long option, but does match a short option, it is parsed as a short option instead. */ int getopt_long_only (argc, argv, options, long_options, opt_index) int argc; char *const *argv; const char *options; const struct option *long_options; int *opt_index; { return _getopt_internal (argc, argv, options, long_options, opt_index, 1); } #endif /* _LIBC or not __GNU_LIBRARY__. */ #ifdef TEST #include int main (argc, argv) int argc; char **argv; { int c; int digit_optind = 0; while (1) { int this_option_optind = optind ? optind : 1; int option_index = 0; static struct option long_options[] = { {"add", 1, 0, 0}, {"append", 0, 0, 0}, {"delete", 1, 0, 0}, {"verbose", 0, 0, 0}, {"create", 0, 0, 0}, {"file", 1, 0, 0}, {0, 0, 0, 0} }; c = getopt_long (argc, argv, "abc:d:0123456789", long_options, &option_index); if (c == EOF) break; switch (c) { case 0: printf ("option %s", long_options[option_index].name); if (optarg) printf (" with arg %s", optarg); printf ("\n"); break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (digit_optind != 0 && digit_optind != this_option_optind) printf ("digits occur in two different argv-elements.\n"); digit_optind = this_option_optind; printf ("option %c\n", c); break; case 'a': printf ("option a\n"); break; case 'b': printf ("option b\n"); break; case 'c': printf ("option c with value `%s'\n", optarg); break; case 'd': printf ("option d with value `%s'\n", optarg); break; case '?': break; default: printf ("?? getopt returned character code 0%o ??\n", c); } } if (optind < argc) { printf ("non-option ARGV-elements: "); while (optind < argc) printf ("%s ", argv[optind++]); printf ("\n"); } exit (0); } #endif /* TEST */ octave-1.1.0/src/gripes.cc100666 415 17 5645 5702417033 13541 0ustar jweusers// gripes.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "tree-const.h" #include "gripes.h" #include "error.h" void gripe_string_invalid (void) { error ("string constant used in invalid context"); } void gripe_range_invalid (void) { error ("range constant used in invalid context"); } void gripe_nonconformant (void) { error ("nonconformant matrices"); } void gripe_nonconformant (int r1, int c1, int r2, int c2) { error ("nonconformant matrices (op1 is %dx%d, op2 is %dx%d)", r1, c1, r2, c2); } void gripe_empty_arg (const char *name, int is_error) { if (is_error) error ("%s: empty matrix is invalid as an argument", name); else warning ("%s: argument is empty matrix", name); } void gripe_square_matrix_required (const char *name) { error ("%s: argument must be a square matrix", name); } void gripe_user_supplied_eval (const char *name) { error ("%s: evaluation of user-supplied function failed", name); } void gripe_user_returned_invalid (const char *name) { error ("%s: user-supplied function returned invalid value", name); } void gripe_invalid_conversion (const char *from, const char *to) { error ("invalid conversion from %s to %s", from, to); } void gripe_2_or_3_dim_plot (void) { error ("plot: can only plot in 2 or 3 dimensions"); } void gripe_unrecognized_float_fmt (void) { error ("unrecognized floating point format requested"); } void gripe_unrecognized_data_fmt (const char *warn_for) { error ("%s: unrecognized data format requested", warn_for); } void gripe_data_conversion (const char *from, const char *to) { error ("unable to convert from %s to %s format", from, to); } void gripe_wrong_type_arg (const char *name, const tree_constant& tc) { error ("%s: wrong type argument `%s'", name, tc.type_as_string ()); } void gripe_wrong_type_arg_for_unary_op (const tree_constant& op) { error ("invalid operand `%s' for unary operator", op.type_as_string ()); } void gripe_wrong_type_arg_for_binary_op (const tree_constant& op) { error ("invalid operand `%s' for binary operator", op.type_as_string ()); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/help.cc100666 415 17 43166 5704644277 13236 0ustar jweusers// help.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include "tree-expr.h" #include "tree-const.h" #include "sighandlers.h" #include "user-prefs.h" #include "tree-expr.h" #include "variables.h" #include "oct-obj.h" #include "symtab.h" #include "octave.h" #include "dirfns.h" #include "pager.h" #include "error.h" #include "utils.h" #include "help.h" #include "defun.h" extern "C" { #include "info/info.h" #include "info/dribble.h" #include "info/terminal.h" extern int initialize_info_session (); extern int index_entry_exists (); extern int do_info_index_search (); extern void finish_info_session (); extern char *replace_in_documentation (); // XXX FIXME XXX #undef __FUNCTION_DEF #include #define boolean kpathsea_boolean #define false kpathsea_false #define true kpathsea_true #include } static help_list operators[] = { { "!", "Logical not operator. See also `~'.\n", }, { "!=", "Logical not equals operator. See also `~' and `<>'.\n", }, { "\"", "String delimiter.\n", }, { "#", "Begin comment character. See also `%'.", }, { "%", "Begin comment charcter. See also `#'.", }, { "&", "Logical and operator. See also `&&'.", }, { "&&", "Logical and operator. See also `&'.", }, { "'", "Matrix transpose operator. For complex matrices, computes the\n\ complex conjugate (Hermitian) transpose. See also `.''\n\ \n\ The single quote character may also be used to delimit strings, but\n\ it is better to use the double quote character, since that is never\n\ ambiguous", }, { "(", "Array index or function argument delimiter.", }, { ")", "Array index or function argument delimiter.", }, { "*", "Multiplication operator. See also `.*'", }, { "**", "Power operator. See also `^', `.**', and `.^'", }, { "+", "Addition operator.", }, { "++", "Increment operator. As in C, may be applied as a prefix or postfix operator.", }, { ",", "Array index, function argument, or command separator.", }, { "-", "Subtraction or unary negation operator.", }, { "--", "Decrement operator. As in C, may be applied as a prefix or postfix operator.", }, { ".'", "Matrix transpose operator. For complex matrices, computes the\n\ transpose, *not* the complex conjugate transpose. See also `''.", }, { ".*", "Element by element multiplication operator. See also `*'.", }, { ".**", "Element by element power operator. See also `**', `^', and `.^'.", }, { "./", "Element by element division operator. See also `/' and `\\'.", }, { ".^", "Element by element power operator. See also `**', `^', and `.^'.", }, { "/", "Right division. See also `\\' and `./'.", }, { ":", "Select entire rows or columns of matrices.", }, { ";", "Array row or command separator. See also `,'.", }, { "<", "Less than operator.", }, { "<=", "Less than or equals operator.", }, { "<>", "Logical not equals operator. See also `!=' and `~='.", }, { "=", "Assignment operator.", }, { "==", "Equality test operator.", }, { ">", "Greater than operator.", }, { ">=", "Greater than or equals operator.", }, { "[", "Return list delimiter. See also `]'.", }, { "\\", "Left division operator. See also `/' and `./'.", }, { "]", "Return list delimiter. See also `['.", }, { "^", "Power operator. See also `**', `.^', and `.**.'", }, { "|", "Logical or operator. See also `||'.", }, { "||", "Logical or operator. See also `|'.", }, { "~", "Logical not operator. See also `!' and `~'.", }, { "~=", "Logical not equals operator. See also `<>' and `!='.", }, { 0, 0, }, }; static help_list keywords[] = { { "all_va_args", "Pass all unnamed arguments to another function call.", }, { "break", "Exit the innermost enclosing while or for loop.", }, { "continue", "Jump to the end of the innermost enclosing while or for loop.", }, { "else", "Alternate action for an if block.", }, { "elseif", "Alternate conditional test for an if block.", }, { "end", "Mark the end of any for, if, while, or function block.", }, { "end_unwind_protect", "Mark the end of an unwind_protect block.", }, { "endfor", "Mark the end of a for loop.", }, { "endfunction", "Mark the end of a function.", }, { "endif", "Mark the end of an if block.", }, { "endwhile", "Mark the end of a while loop.", }, { "for", "Begin a for loop.", }, { "function", "Begin a function body.", }, { "global", "Declare variables to have global scope.", }, { "gplot", "Produce 2-D plots using gnuplot-like command syntax.", }, { "gsplot", "Produce 3-D plots using gnuplot-like command syntax.", }, { "if", "Begin an if block.", }, { "return", "Return from a function.", }, { "unwind_protect", "Begin an unwind_protect block.", }, { "unwind_protect_cleanup", "Begin the cleanup section of an unwind_protect block.", }, { "while", "Begin a while loop.", }, { 0, 0, }, }; // Return a copy of the operator or keyword names. char ** names (help_list *lst, int& count) { count = 0; help_list *ptr = lst; while (ptr->name) { count++; ptr++; } if (count == 0) return 0; char **name_list = new char * [count+1]; ptr = lst; int i = 0; while (ptr->name) { name_list[i++] = strsave (ptr->name); ptr++; } name_list[i] = 0; return name_list; } help_list * operator_help (void) { return operators; } help_list * keyword_help (void) { return keywords; } void additional_help_message (ostrstream& output_buf) { output_buf << "\n" << "Additional help for builtin functions, operators, and variables\n" << "is available in the on-line version of the manual.\n" << "\n" << "Use the command `help -i ' to search the manual index.\n"; } void print_usage (const char *string, int just_usage) { ostrstream output_buf; symbol_record *sym_rec = global_sym_tab->lookup (string, 0, 0); if (sym_rec) { char *h = sym_rec->help (); if (h && *h) { output_buf << "\n*** " << string << ":\n\n" << h << "\n"; if (! just_usage) additional_help_message (output_buf); output_buf << ends; maybe_page_output (output_buf); } } else warning ("no usage message found for `%s'", string); } static void display_names_from_help_list (ostrstream& output_buf, help_list *list, const char *desc) { int count = 0; char **symbols = names (list, count); output_buf << "\n*** " << desc << ":\n\n"; if (symbols && count > 0) list_in_columns (output_buf, symbols); delete [] symbols; } static char * print_symbol_type (ostrstream& output_buf, symbol_record *sym_rec, char *name, int print) { char *retval = 0; if (sym_rec->is_user_function ()) { tree_fvc *defn = sym_rec->def (); char *fn = defn->fcn_file_name (); if (fn) { char *ff = fcn_file_in_path (fn); ff = ff ? ff : fn; if (print) output_buf << name << " is the function defined from:\n" << ff << "\n"; else retval = ff; } else { if (print) output_buf << name << " is a user-defined function\n"; else retval = "user-defined function"; } } else if (sym_rec->is_text_function ()) { if (print) output_buf << name << " is a builtin text-function\n"; else retval = "builtin text-function"; } else if (sym_rec->is_builtin_function ()) { if (print) output_buf << name << " is a builtin function\n"; else retval = "builtin function"; } else if (sym_rec->is_user_variable ()) { if (print) output_buf << name << " is a user-defined variable\n"; else retval = "user-defined variable"; } else if (sym_rec->is_builtin_variable ()) { if (print) output_buf << name << " is a builtin variable\n"; else retval = "builtin variable"; } else { if (print) output_buf << "which: `" << name << "' has unknown type\n"; else retval = "unknown type"; } return retval; } static void display_symtab_names (ostrstream& output_buf, char **names, int count, const char *desc) { output_buf << "\n*** " << desc << ":\n\n"; if (names && count > 0) list_in_columns (output_buf, names); } static void simple_help (void) { ostrstream output_buf; display_names_from_help_list (output_buf, operator_help (), "operators"); display_names_from_help_list (output_buf, keyword_help (), "reserved words"); #ifdef LIST_SYMBOLS #undef LIST_SYMBOLS #endif #define LIST_SYMBOLS(type, msg) \ do \ { \ int count; \ char **names = global_sym_tab->list (count, 0, 0, 1, type); \ display_symtab_names (output_buf, names, count, msg); \ char **ptr = names; \ while (*ptr) \ delete [] *ptr++; \ delete [] names; \ } \ while (0) // XXX FIXME XXX -- is this distinction needed? LIST_SYMBOLS (symbol_def::TEXT_FUNCTION, "text functions (these names are also reserved)"); LIST_SYMBOLS (symbol_def::MAPPER_FUNCTION, "mapper functions"); LIST_SYMBOLS (symbol_def::BUILTIN_FUNCTION, "general functions"); LIST_SYMBOLS (symbol_def::BUILTIN_VARIABLE, "builtin variables"); // Also need to list variables and currently compiled functions from // the symbol table, if there are any. // Also need to search octave_path for script files. char *path_elt = kpse_path_element (user_pref.loadpath); while (path_elt) { str_llist_type *elt_dirs = kpse_element_dirs (path_elt); str_llist_elt_type *dir; for (dir = *elt_dirs; dir; dir = STR_LLIST_NEXT (*dir)) { char *elt_dir = STR_LLIST (*dir); if (elt_dir) { int count; char **names = get_fcn_file_names (count, elt_dir, 0); output_buf << "\n*** function files in " << make_absolute (elt_dir, the_current_working_directory) << ":\n\n"; if (names && count > 0) list_in_columns (output_buf, names); delete [] names; } } path_elt = kpse_path_element (0); } additional_help_message (output_buf); output_buf << ends; maybe_page_output (output_buf); } static int try_info (const char *string, int force = 0) { int status = 0; char *directory_name = strsave (user_pref.info_file); char *temp = filename_non_directory (directory_name); if (temp != directory_name) { *temp = 0; info_add_path (directory_name, INFOPATH_PREPEND); } delete [] directory_name; NODE *initial_node = info_get_node (user_pref.info_file, 0); if (! initial_node) { warning ("can't find info file!\n"); status = -1; } else { status = initialize_info_session (initial_node, 0); if (status == 0 && (force || index_entry_exists (windows, string))) { terminal_clear_screen (); terminal_prep_terminal (); display_update_display (windows); info_last_executed_command = 0; if (! force) do_info_index_search (windows, 0, string); char *format = replace_in_documentation ("Type \"\\[quit]\" to quit, \"\\[get-help-window]\" for help."); window_message_in_echo_area (format); info_read_and_dispatch (); terminal_goto_xy (0, screenheight - 1); terminal_clear_to_eol (); terminal_unprep_terminal (); status = 1; } finish_info_session (initial_node, 0); } return status; } int help_from_list (ostrstream& output_buf, const help_list *list, const char *string, int usage) { char *name; while ((name = list->name) != 0) { if (strcmp (name, string) == 0) { if (usage) output_buf << "\nusage: "; else { output_buf << "\n*** " << string << ":\n\n"; } output_buf << list->help << "\n"; return 1; } list++; } return 0; } DEFUN_TEXT ("help", Fhelp, Shelp, -1, 1, "help [-i] [topic ...]\n\ \n\ print cryptic yet witty messages") { Octave_object retval; DEFINE_ARGV("help"); if (argc == 1) { simple_help (); } else { if (argv[1] && strcmp (argv[1], "-i") == 0) { argc--; argv++; if (argc == 1) { volatile sig_handler *old_sigint_handler; old_sigint_handler = signal (SIGINT, SIG_IGN); try_info (0, 1); signal (SIGINT, old_sigint_handler); } else { while (--argc > 0) { argv++; if (! *argv || ! **argv) continue; volatile sig_handler *old_sigint_handler; old_sigint_handler = signal (SIGINT, SIG_IGN); if (! try_info (*argv)) { message ("help", "sorry, `%s' is not indexed in the manual", *argv); sleep (2); } signal (SIGINT, old_sigint_handler); } } } else { ostrstream output_buf; help_list *op_help_list = operator_help (); help_list *kw_help_list = keyword_help (); while (--argc > 0) { argv++; if (! *argv || ! **argv) continue; if (help_from_list (output_buf, op_help_list, *argv, 0)) continue; if (help_from_list (output_buf, kw_help_list, *argv, 0)) continue; symbol_record *sym_rec = lookup_by_name (*argv, 0); if (sym_rec && sym_rec->is_defined ()) { char *h = sym_rec->help (); if (h && *h) { print_symbol_type (output_buf, sym_rec, *argv, 1); output_buf << "\n" << h << "\n"; continue; } } char *path = fcn_file_in_path (*argv); char *h = get_help_from_file (path); if (h && *h) { output_buf << *argv << " is the file:\n" << path << "\n\n" << h << "\n"; delete [] h; delete [] path; continue; } delete [] path; output_buf << "\nhelp: sorry, `" << *argv << "' is not documented\n"; } additional_help_message (output_buf); output_buf << ends; maybe_page_output (output_buf); } } DELETE_ARGV; return retval; } DEFUN_TEXT ("type", Ftype, Stype, -1, 1, "type NAME ...]\n\ \n\ display the definition of each NAME that refers to a function") { Octave_object retval; DEFINE_ARGV("type"); if (argc > 1) { // XXX FIXME XXX -- we should really use getopt () int quiet = 0; if (argv[1] && strcmp (argv[1], "-q") == 0) { quiet = 1; argc--; argv++; } ostrstream output_buf; while (--argc > 0) { argv++; if (! *argv || ! **argv) continue; symbol_record *sym_rec = lookup_by_name (*argv, 0); if (sym_rec) { if (sym_rec->is_user_function ()) { tree_fvc *defn = sym_rec->def (); if (nargout == 0 && ! quiet) output_buf << *argv << " is a user-defined function\n"; defn->print_code (output_buf); } // XXX FIXME XXX -- this code should be shared with Fwhich else if (sym_rec->is_text_function ()) output_buf << *argv << " is a builtin text-function\n"; else if (sym_rec->is_builtin_function ()) output_buf << *argv << " is a builtin function\n"; else if (sym_rec->is_user_variable ()) { tree_fvc *defn = sym_rec->def (); if (nargout == 0 && ! quiet) output_buf << *argv << " is a user-defined variable\n"; defn->print_code (output_buf); if (nargout == 0) output_buf << "\n"; } else if (sym_rec->is_builtin_variable ()) { tree_fvc *defn = sym_rec->def (); if (nargout == 0 && ! quiet) output_buf << *argv << " is a builtin variable\n"; defn->print_code (output_buf); if (nargout == 0) output_buf << "\n"; } else output_buf << "type: `" << *argv << "' has unknown type!\n"; } else output_buf << "type: `" << *argv << "' undefined\n"; } output_buf << ends; if (nargout == 0) maybe_page_output (output_buf); else { char *s = output_buf.str (); retval = s; delete s; } } else print_usage ("type"); DELETE_ARGV; return retval; } DEFUN_TEXT ("which", Fwhich, Swhich, -1, 1, "which NAME ...]\n\ \n\ display the type of each NAME. If NAME is defined from an function\n\ file, print the full name of the file.") { Octave_object retval; DEFINE_ARGV("which"); if (argc > 1) { if (nargout > 0) retval.resize (argc-1, Matrix ()); ostrstream output_buf; for (int i = 0; i < argc-1; i++) { argv++; if (! *argv || ! **argv) continue; symbol_record *sym_rec = lookup_by_name (*argv, 0); if (sym_rec) { int print = (nargout == 0); char *tmp = print_symbol_type (output_buf, sym_rec, *argv, print); if (! print) retval(i) = tmp; } else { if (nargout == 0) output_buf << "which: `" << *argv << "' is undefined\n"; else retval(i) = "undefined"; } } output_buf << ends; maybe_page_output (output_buf); } else print_usage ("which"); DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/idx-vector.cc100666 415 17 14330 5702417031 14341 0ustar jweusers// idx-vector.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "dMatrix.h" #include "Range.h" #include "idx-vector.h" #include "user-prefs.h" #include "error.h" #include "utils.h" idx_vector::idx_vector (const idx_vector& a) { initialized = a.initialized; len = a.len; if (len > 0) { data = new int [len]; for (int i = 0; i < len; i++) data[i] = a.data[i]; num_zeros = a.num_zeros; num_ones = a.num_ones; one_zero = a.one_zero; max_val = a.max_val; min_val = a.min_val; } else data = (int *) 0; } static inline int tree_to_mat_idx (double x) { if (x > 0) return ((int) (x + 0.5) - 1); else return ((int) (x - 0.5) - 1); } idx_vector::idx_vector (const Matrix& m, int do_ftn_idx, const char *rc, int z_len) { initialized = 0; int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0) { len = 0; data = (int *) 0; num_zeros = 0; num_ones = 0; one_zero = 0; initialized = 1; return; } else if (nr > 1 && nc > 1 && do_ftn_idx) { const double *cop_out = m.data (); len = nr * nc; data = new int [len]; for (int i = 0; i < len; i++) data[i] = tree_to_mat_idx (*cop_out++); } else if (nr == 1 && nc > 0) { len = nc; data = new int [len]; for (int i = 0; i < len; i++) data[i] = tree_to_mat_idx (m.elem (0, i)); } else if (nc == 1 && nr > 0) { len = nr; data = new int [len]; for (int i = 0; i < len; i++) data[i] = tree_to_mat_idx (m.elem (i, 0)); } else { ::error ("invalid matrix used as index"); return; } init_state (rc, z_len); } idx_vector::idx_vector (const Range& r) { initialized = 0; len = r.nelem (); if (len < 0) { ::error ("invalid range used as index"); return; } else if (len == 0) { data = (int *) 0; num_zeros = 0; num_ones = 0; one_zero = 0; initialized = 1; return; } double b = r.base (); double step = r.inc (); data = new int [len]; for (int i = 0; i < len; i++) { double val = b + i * step; data[i] = tree_to_mat_idx (val); } init_state (); } idx_vector& idx_vector::operator = (const idx_vector& a) { if (this != &a) { initialized = a.initialized; delete [] data; len = a.len; data = new int [len]; for (int i = 0; i < len; i++) data[i] = a.data[i]; num_zeros = a.num_zeros; num_ones = a.num_ones; one_zero = a.one_zero; max_val = a.max_val; min_val = a.min_val; } return *this; } void idx_vector::init_state (const char *rc, int z_len) { one_zero = 1; num_zeros = 0; num_ones = 0; min_val = max_val = data[0]; int i = 0; do { if (data[i] == -1) num_zeros++; else if (data[i] == 0) num_ones++; if (one_zero && data[i] != -1 && data[i] != 0) one_zero = 0; if (data[i] > max_val) max_val = data[i]; if (data[i] < min_val) min_val = data[i]; } while (++i < len); if (one_zero && z_len == len) { if (num_zeros == len) { delete [] data; len = 0; data = (int *) 0; num_zeros = 0; num_ones = 0; one_zero = 0; } else if (num_ones != len || user_pref.prefer_zero_one_indexing) convert_one_zero_to_idx (); } else if (min_val < 0) { ::error ("%s index %d out of range", rc, min_val+1); initialized = 0; return; } #if 0 // Checking max index against size won't work right here unless we // also look at resize on range error, and we have to do that later // on anyway. else if (max_val >= z_len) { ::error ("%s index %d out of range", rc, max_val+1); initialized = 0; return; } #endif initialized = 1; } void idx_vector::convert_one_zero_to_idx (void) { if (num_ones == 0) { len = 0; max_val = 0; min_val = 0; delete [] data; } else { assert (num_ones + num_zeros == len); int *new_data = new int [num_ones]; int count = 0; for (int i = 0; i < len; i++) if (data[i] == 0) new_data[count++] = i; delete [] data; len = num_ones; data = new_data; min_val = max_val = data[0]; i = 0; do { if (data[i] > max_val) max_val = data[i]; if (data[i] < min_val) min_val = data[i]; } while (++i < len); } } static inline int intcmp (int *i, int *j) { return (*i - *j); } int idx_vector::checkelem (int n) const { if (n < 0 || n >= len) { ::error ("idx-vector: index out of range"); return 0; } return elem (n); } void idx_vector::sort (void) { qsort ((void *) data, len, sizeof (int), (int (*)(const void*, const void*)) intcmp); } void idx_vector::sort_uniq (void) { if (len > 0) { sort (); int *new_data = new int [len]; new_data[0] = data[0]; int k = 0; for (int i = 1; i < len; i++) { if (data[i] != new_data[k]) { k++; new_data[k] = data[i]; } } delete [] data; len = k+1; data = new_data; } } void idx_vector::shorten (int n) { if (n > 0 && n <= len) len = n; else panic_impossible (); } ostream& operator << (ostream& os, const idx_vector& a) { for (int i = 0; i < a.len; i++) os << a.data[i] << "\n"; return os; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/input.cc100666 415 17 42001 5702417030 13407 0ustar jweusers// input.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The 3 functions listed below were adapted from similar functions from GNU Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc. read_octal sub_append_string decode_prompt_string */ // Use the GNU readline library for command line editing and hisory. #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include // This must come before anything that includes iostream.h... extern "C" { #include "readline/readline.h" #include "readline/history.h" extern void free_undo_list (); extern char *xmalloc (); // Yes, this sucks, but it avoids a conflict with another readline // function declared in iostream.h. #if 0 #define LINE_SIZE 8192 static int no_line_editing = 0; #endif char * gnu_readline (char *s) { #if 0 static int state = 0; static char *line_from_stdin = 0; if (no_line_editing) { if (! state) { line_from_stdin = (char *) malloc (LINE_SIZE); state = 1; } fputs ("octave> ", stdout); fgets (line_from_stdin, LINE_SIZE, stdin); return line_from_stdin; } else #endif return readline (s); } } #include "help.h" #include "error.h" #include "utils.h" #include "input.h" #include "pager.h" #include "parse.h" #include "dirfns.h" #include "octave.h" #include "variables.h" #include "tree-const.h" #include "octave-hist.h" #include "sighandlers.h" #include "user-prefs.h" #include "oct-obj.h" #include "defun.h" #ifndef MAXPATHLEN #define MAXPATHLEN 1024 #endif // The size that strings change by. #ifndef DEFAULT_ARRAY_SIZE #define DEFAULT_ARRAY_SIZE 512 #endif // The growth rate for the prompt string. #ifndef PROMPT_GROWTH #define PROMPT_GROWTH 50 #endif // Global pointer for eval(). const char *current_eval_string = 0; // Nonzero means get input from current_eval_string. int get_input_from_eval_string = 0; // Nonzero means we're parsing a function file. int reading_fcn_file = 0; // Simple name of function file we are reading. char *curr_fcn_file_name = 0; // Nonzero means we're parsing a script file. int reading_script_file = 0; // If we are reading from an M-file, this is it. FILE *ff_instream = 0; // Nonzero means we are using readline. int using_readline = 1; // Nonzero means commands are echoed as they are executed. // (--echo-commands; -x). int echo_input = 0; // Nonzero means this is an interactive shell. int interactive = 0; // Nonzero means the user forced this shell to be interactive (-i). int forced_interactive = 0; // Should we issue a prompt? int promptflag = 1; // The current line of input, from wherever. char *current_input_line = 0; // A line of input from readline. static char *octave_gets_line = 0; extern tree_constant eval_string (const char *string, int print, int ans_assign, int& parse_status); // Append SOURCE to TARGET at INDEX. SIZE is the current amount of // space allocated to TARGET. SOURCE can be NULL, in which case // nothing happens. Gets rid of SOURCE by free ()ing it. Returns // TARGET in case the location has changed. static char * sub_append_string (char *source, char *target, int *index, int *size) { if (source) { while ((int)strlen (source) >= (int)(*size - *index)) { char *tmp = new char [*size += DEFAULT_ARRAY_SIZE]; strcpy (tmp, target); delete [] target; target = tmp; } strcat (target, source); *index += strlen (source); delete [] source; } return target; } // Return the octal number parsed from STRING, or -1 to indicate that // the string contained a bad number. int read_octal (const char *string) { int result = 0; int digits = 0; while (*string && *string >= '0' && *string < '8') { digits++; result = (result * 8) + *string++ - '0'; } if (! digits || result > 0777 || *string) result = -1; return result; } // Return a string which will be printed as a prompt. The string may // contain special characters which are decoded as follows: // // \t the time // \d the date // \n CRLF // \s the name of the shell (program) // \w the current working directory // \W the last element of PWD // \u your username // \h the hostname // \# the command number of this command // \! the history number of this command // \$ a $ or a # if you are root // \ character code in octal // \\ a backslash static char * decode_prompt_string (const char *string) { int result_size = PROMPT_GROWTH; int result_index = 0; char *result = new char [PROMPT_GROWTH]; int c; char *temp = 0; result[0] = 0; while (c = *string++) { if (c == '\\') { c = *string; switch (c) { case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': { char octal_string[4]; int n; strncpy (octal_string, string, 3); octal_string[3] = '\0'; n = read_octal (octal_string); temp = strsave ("\\"); if (n != -1) { string += 3; temp[0] = n; } c = 0; goto add_string; } case 't': case 'd': /* Make the current time/date into a string. */ { time_t the_time = time (0); char *ttemp = ctime (&the_time); temp = strsave (ttemp); if (c == 't') { strcpy (temp, temp + 11); temp[8] = '\0'; } else temp[10] = '\0'; goto add_string; } case 'n': if (! no_line_editing) temp = strsave ("\r\n"); else temp = strsave ("\n"); goto add_string; case 's': { temp = base_pathname (prog_name); temp = strsave (temp); goto add_string; } case 'w': case 'W': { char t_string[MAXPATHLEN]; #define EFFICIENT #ifdef EFFICIENT // Use the value of PWD because it is much more effecient. temp = user_pref.pwd; if (! temp) getcwd (t_string, MAXPATHLEN); else strcpy (t_string, temp); #else getcwd (t_string, MAXPATHLEN); #endif /* EFFICIENT */ if (c == 'W') { char *dir = strrchr (t_string, '/'); if (dir && dir != t_string) strcpy (t_string, dir + 1); temp = strsave (t_string); } else temp = strsave (polite_directory_format (t_string)); goto add_string; } case 'u': { temp = strsave (user_name); goto add_string; } case 'h': { char *t_string; temp = strsave (host_name); if (t_string = strchr (temp, '.')) *t_string = '\0'; goto add_string; } case '#': { char number_buffer[128]; sprintf (number_buffer, "%d", current_command_number); temp = strsave (number_buffer); goto add_string; } case '!': { char number_buffer[128]; int num = current_history_number (); if (num > 0) sprintf (number_buffer, "%d", num); else strcpy (number_buffer, "!"); temp = strsave (number_buffer); goto add_string; } case '$': temp = strsave (geteuid () == 0 ? "#" : "$"); goto add_string; case '\\': temp = strsave ("\\"); goto add_string; default: temp = strsave ("\\ "); temp[1] = c; add_string: if (c) string++; result = (char *)sub_append_string (temp, result, &result_index, &result_size); temp = 0; // Free ()'ed in sub_append_string (). result[result_index] = '\0'; break; } } else { while (3 + result_index > result_size) { char *tmp = new char [result_size += PROMPT_GROWTH]; strcpy (tmp, result); delete [] result; result = tmp; } result[result_index++] = c; result[result_index] = '\0'; } } #if 0 // I don't really think that this is a good idea. Do you? if (! find_variable ("NO_PROMPT_VARS")) { WORD_LIST *expand_string (), *list; char *string_list (); list = expand_string (result, 1); free (result); result = string_list (list); dispose_words (list); } #endif return result; } // Use GNU readline to get an input line and store it in the history // list. static char * octave_gets (void) { if (octave_gets_line) { free (octave_gets_line); octave_gets_line = 0; } if (interactive || forced_interactive) { char *ps = (promptflag > 0) ? user_pref.ps1 : user_pref.ps2; char *prompt = decode_prompt_string (ps); if (interactive) { pipe_handler_error_count = 0; flush_output_to_pager (); } maybe_write_to_diary_file (prompt); octave_gets_line = gnu_readline (prompt); delete [] prompt; } else octave_gets_line = gnu_readline (""); current_input_line = octave_gets_line; if (octave_gets_line && *octave_gets_line) { maybe_save_history (octave_gets_line); maybe_write_to_diary_file (octave_gets_line); if (echo_input) { if (! forced_interactive) cout << "+ "; cout << octave_gets_line << "\n"; } } maybe_write_to_diary_file ("\n"); return octave_gets_line; } // Read a line from the input stream. int octave_read (char *buf, int max_size) { int status = 0; static char *stashed_line = 0; if (get_input_from_eval_string) { int len = strlen (current_eval_string); if (len < max_size - 1) { strcpy (buf, current_eval_string); buf[len++] = '\n'; buf[len] = '\0'; // Paranoia. status = len; } else status = -1; if (stashed_line) delete [] stashed_line; stashed_line = strsave (buf); current_input_line = stashed_line; } else if (using_readline) { char *cp = octave_gets (); if (cp) { int len = strlen (cp); if (len >= max_size) status = -1; else { strcpy (buf, cp); buf[len++] = '\n'; buf[len] = '\0'; // Paranoia. status = len; } } current_input_line = cp; } else { FILE *curr_stream = rl_instream; if (reading_fcn_file || reading_script_file) curr_stream = ff_instream; assert (curr_stream); // Why is this required? buf[0] = '\0'; if (fgets (buf, max_size, curr_stream)) { int len = strlen (buf); if (len > max_size - 2) status = -1; else { if (buf[len-1] != '\n') { buf[len++] = '\n'; buf[len] = '\0'; } status = len; } } else status = 0; // Tell yylex that we found EOF. if (stashed_line) delete [] stashed_line; stashed_line = strsave (buf); current_input_line = stashed_line; if (echo_input && current_input_line && *current_input_line) { if (! forced_interactive) cout << "+ "; cout << current_input_line << "\n"; } } input_line_number++; return status; } // Fix things up so that input can come from file `name', printing a // warning if the file doesn't exist. FILE * get_input_from_file (char *name, int warn) { FILE *instream = 0; if (name && *name) instream = fopen (name, "r"); if (! instream && warn) warning ("%s: no such file or directory", name); if (reading_fcn_file || reading_script_file) ff_instream = instream; else rl_instream = instream; return instream; } // Fix things up so that input can come from the standard input. This // may need to become much more complicated, which is why it's in a // separate function. FILE * get_input_from_stdin (void) { rl_instream = stdin; return rl_instream; } static char * command_generator (char *text, int state) { static int len = 0; static int list_index = 0; static char **name_list = 0; if (state == 0) { list_index = 0; len = strlen (text); if (name_list) { char **ptr = name_list; while (ptr && *ptr) delete [] *ptr++; delete [] name_list; } name_list = make_name_list (); } char *name; while ((name = name_list[list_index]) != 0) { list_index++; if (strncmp (name, text, len) == 0) { char *buf = xmalloc (1 + strlen (name)); strcpy (buf, name); return buf; } } return 0; } static char ** command_completer (char *text, int start, int end) { char **matches = 0; matches = completion_matches (text, command_generator); return matches; } // The next two functions implement the equivalent of the K*rn shell // C-o operate-and-get-next-history-line editing command. Stolen from // the GNU Bourne Again SHell. // ?? static int saved_history_line_to_use = 0; // ?? static Function *old_rl_startup_hook = 0; static void set_saved_history (void) { HIST_ENTRY *h; if (saved_history_line_to_use) { if (history_set_pos (saved_history_line_to_use)) { h = current_history (); if (h) { rl_insert_text (h->line); // Get rid of any undo list created by the previous insert, so the // line won't totally be erased when the edits are undone (they will // be normally, because this is a history line -- cf. readline.c: // line 380 or so). if (rl_undo_list) { free_undo_list (); rl_undo_list = 0; } } } } saved_history_line_to_use = 0; rl_startup_hook = old_rl_startup_hook; } static void operate_and_get_next (int count, int c) { int where; extern int history_stifled, history_length, max_input_history; // Accept the current line. rl_newline (); // Find the current line, and find the next line to use. where = where_history (); if (history_stifled && (history_length >= max_input_history)) saved_history_line_to_use = where; else saved_history_line_to_use = where + 1; old_rl_startup_hook = rl_startup_hook; rl_startup_hook = (Function *) set_saved_history; } void initialize_readline (void) { // Allow conditional parsing of the ~/.inputrc file rl_readline_name = "Octave"; // Tell the completer that we want to try first. rl_attempted_completion_function = (CPPFunction *) command_completer; // Bind operate-and-get-next. rl_add_defun ("operate-and-get-next", (Function *) operate_and_get_next, CTRL ('O')); } static int match_sans_spaces (const char *standard, const char *test) { const char *tp = test; while (*tp == ' ' || *tp == '\t') tp++; const char *ep = test + strlen (test) - 1; while (*ep == ' ' || *ep == '\t') ep--; int len = ep - tp + 1; return (strncmp (standard, tp, len) == 0); } // If the user simply hits return, this will produce an empty matrix. static Octave_object get_user_input (const Octave_object& args, int nargout, int debug = 0) { tree_constant retval; int nargin = args.length (); int read_as_string = 0; if (nargin == 2) read_as_string++; char *prompt = "debug> "; if (nargin > 0) { prompt = args(0).string_value (); if (error_state) { error ("input: unrecognized argument"); return retval; } } again: flush_output_to_pager (); char *input_buf = gnu_readline (prompt); if (input_buf) { maybe_save_history (input_buf); int len = strlen (input_buf); if (len < 1) { if (debug) goto again; else { if (read_as_string) return ""; else return Matrix (); } } if (match_sans_spaces ("exit", input_buf) || match_sans_spaces ("quit", input_buf) || match_sans_spaces ("return", input_buf)) { return retval; } else if (read_as_string) { retval = input_buf; } else { int parse_status = 0; retval = eval_string (input_buf, 0, 0, parse_status); if (retval.is_defined ()) { if (debug) retval.eval (1); } else retval = Matrix (); } } else error ("input: reading user-input failed!"); if (debug) goto again; return retval; } DEFUN ("input", Finput, Sinput, 2, 1, "input (PROMPT [, S])\n\ \n\ Prompt user for input. If the second argument is present, return value as a string.") { Octave_object retval; int nargin = args.length (); if (nargin == 1 || nargin == 2) retval = get_user_input (args, nargout); else print_usage ("input"); return retval; } DEFUN ("keyboard", Fkeyboard, Skeyboard, 1, 1, "keyboard (PROMPT)\n\ \n\ maybe help in debugging function files") { Octave_object retval; int nargin = args.length (); if (nargin == 0 || nargin == 1) retval = get_user_input (args, nargout, 1); else print_usage ("keyboard"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/lex.l100666 415 17 112471 5704303324 12741 0ustar jweusers/* lex.l -*- C++ -*- Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 GNU CC; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ %x HELP_FCN %s TEXT_FCN %s MATRIX %{ #define SHORT_CIRCUIT_LOGICALS 1 #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "input.h" #include "token.h" #include "SLStack.h" // Stack to hold tokens so that we can delete them when the parser is // reset and avoid growing forever just because we are stashing some // information. This has to appear before lex.h is included, because // one of the macros defined there uses token_stack. static SLStack token_stack; #include "user-prefs.h" #include "variables.h" #include "octave.h" #include "symtab.h" #include "error.h" #include "utils.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-misc.h" #include "tree-plot.h" #include "tree-const.h" #include "y.tab.h" #include "parse.h" #include "lex.h" // Nonzero means we think we are looking at a set command. static int doing_set = 0; // GAG. Stupid kludge so that [[1,2][3,4]] will work. static do_comma_insert = 0; // Brace level count. static int braceflag = 0; // Return transpose or start a string? int quote_is_transpose = 0; // Nonzero means we thing we are looking at the beginning of a // function definition. int beginning_of_function = 0; // Nonzero means that we should convert spaces to a comma inside a // matrix definition. static int convert_spaces_to_comma = 1; // Another context hack, this time for the plot command's `using', // `title', and `with' keywords. static int cant_be_identifier = 0; #define BRACE 1 #define PAREN 2 // Is the closest nesting level a square brace or a paren? // // BRACE -> spaces are important (they can turn into commas) // new lines are important (they can turn into semicolons) // // PAREN -> spaces and new lines are not important static SLStack nesting_level; // Forward declarations for functions defined at the bottom of this // file. static void do_string_escapes (char *s); static void fixup_column_count (char *s); static void do_comma_insert_check (void); static int is_plot_keyword (char *s); static int is_keyword (char *s); static char *plot_style_token (char *s); static symbol_record *lookup_identifier (char *s); static void grab_help_text (void); static int match_any (char c, char *s); static int next_token_is_bin_op (int spc_prev, char *yytext); static int next_token_is_postfix_unary_op (int spc_prev, char *yytext); static char *strip_trailing_whitespace (char *s); static void handle_number (char *yytext); static int handle_string (char delim, int text_style = 0); static int handle_close_brace (int spc_gobbled); static int handle_identifier (char *tok, int spc_gobbled); static int have_continuation (void); static int have_ellipsis_continuation (void); static int eat_whitespace (void); static int eat_continuation (void); %} D [0-9] S [ \t] NL [\n] SNL [ \t\n] EL (\.\.\.) BS (\\) CONT ({EL}|{BS}) Im [iIjJ] CCHAR [#%] COMMENT ({CCHAR}.*{NL}) SNLCMT ({SNL}|{COMMENT}) NOTEQ ((~=)|(!=)|(<>)) POW ((\*\*)|(\^)) EPOW (\.{POW}) PLUS ((\+)|(\.\+)) MINUS ((\-)|(\.\-)) NOT ((\~)|(\!)) IDENT ([_a-zA-Z][_a-zA-Z0-9]*) EXPON ([DdEe][+-]?{D}+) NUMBER (({D}+\.?{D}*{EXPON}?)|(\.{D}+{EXPON}?)) %% %{ // Help and other text-style functions are a pain in the ass. This // stuff needs to be simplified. May require some changes in the // parser too. %} {NL} | {NL} { BEGIN 0; current_input_column = 1; quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; return '\n'; } [\;\,] { if (doing_set && strcmp (yytext, ",") == 0) { yylval.tok_val = new token (yytext); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT); } else { BEGIN 0; if (strcmp (yytext, ",") == 0) TOK_RETURN (','); else TOK_RETURN (';'); } } [\"\'] { current_input_column++; return handle_string (yytext[0], 1); } [^ \t\n]*{S}* | [^ \t\n\;\,]*{S}* { static char *tok = 0; delete [] tok; tok = strip_trailing_whitespace (yytext); yylval.tok_val = new token (tok); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT); } %{ // For this and the next two rules, we're looking at ']', and we // need to know if the next token is `=' or `=='. // // It would have been so much easier if the delimiters were simply // different for the expression on the left hand side of the equals // operator. // // It's also a pain in the ass to decide whether to insert a comma // after seeing a ']' character... %} {SNL}*\]{S}* { fixup_column_count (yytext); int c = yytext[yyleng-1]; int cont_is_spc = eat_continuation (); int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); return handle_close_brace (spc_gobbled); } %{ // Commas are element separators in matrix constants. %} {S}*\,{S}* { TOK_RETURN (','); } %{ // In some cases, spaces in matrix constants can turn into commas. // If commas are required, spaces are not important in matrix // constants so we just eat them. %} {S}+ { if (user_pref.whitespace_in_literal_matrix != 2) { int bin_op = next_token_is_bin_op (1, yytext); int postfix_un_op = next_token_is_postfix_unary_op (1, yytext); if (! (postfix_un_op || bin_op || nesting_level.empty ()) && nesting_level.top () == BRACE && convert_spaces_to_comma) TOK_RETURN (','); } } %{ // Semicolons are handled as row seprators in matrix constants. %} {SNLCMT}*;{SNLCMT}* { fixup_column_count (yytext); eat_whitespace (); quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; return ';'; } %{ // In some cases, new lines can also become row separators. %} {SNLCMT}*\n{SNLCMT}* { if (user_pref.whitespace_in_literal_matrix != 2) { fixup_column_count (yytext); quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; if (nesting_level.empty ()) return LEXICAL_ERROR; if (nesting_level.top () == BRACE) return ';'; } } %{ // Open and close brace are handled differently if we are in the range // part of a plot command. // %} \[{S}* { fixup_column_count (yytext); nesting_level.push (BRACE); promptflag--; eat_whitespace (); if (plotting && ! past_plot_range) { in_plot_range = 1; TOK_RETURN (OPEN_BRACE); } else { mlnm.push (1); braceflag++; BEGIN MATRIX; TOK_RETURN ('['); } } \] { if (! nesting_level.empty ()) nesting_level.pop (); if (plotting && ! past_plot_range) { in_plot_range = 0; TOK_RETURN (CLOSE_BRACE); } else TOK_RETURN (']'); } %{ // Imaginary numbers. %} {NUMBER}{Im} { handle_number (yytext); return IMAG_NUM; } %{ // Real numbers. Don't grab the `.' part of a dot operator as part of // the constant. %} {D}+/\.[\*/\\^'] | {NUMBER} { handle_number (yytext); return NUM; } %{ // Eat whitespace. Whitespace inside matrix constants is handled by // the start state code above. %} {S}* { current_input_column += yyleng; } %{ // Continuation lines. Allow comments after continuations. %} {CONT}{S}*{NL} | {CONT}{S}*{COMMENT} { promptflag--; current_input_column = 1; } %{ // An ellipsis not at the end of a line is not a continuation, but // does have another meaning. %} {EL} { return ELLIPSIS; } %{ // End of file. %} <> { TOK_RETURN (END_OF_INPUT); } %{ // Identifiers. Truncate the token at the first space or tab but // don't write directly on yytext. %} {IDENT}{S}* { static char *tok = 0; delete [] tok; tok = strip_trailing_whitespace (yytext); current_input_column += yyleng; int c = yytext[yyleng-1]; int cont_is_spc = eat_continuation (); int spc_gobbled = (cont_is_spc || c == ' ' || c == '\t'); return handle_identifier (tok, spc_gobbled); } %{ // A new line character. New line characters inside matrix constants // are handled by the start state code above. If closest // nesting is inside parentheses, don't return a row separator. %} {NL} { quote_is_transpose = 0; cant_be_identifier = 0; current_input_column = 1; convert_spaces_to_comma = 1; if (nesting_level.empty ()) return '\n'; if (nesting_level.top () == BRACE) return LEXICAL_ERROR; } %{ // Single quote can either be the beginning of a string or a transpose // operator. %} "'" { current_input_column++; convert_spaces_to_comma = 1; if (quote_is_transpose) { do_comma_insert_check (); return QUOTE; } else return handle_string ('\''); } %{ // Double quotes always begin strings. %} \" { current_input_column++; return handle_string ('"'); } %{ // The colon operator is handled differently if we are in the range // part of a plot command. %} ":" { if (plotting && (in_plot_range || in_plot_using)) BIN_OP_RETURN (COLON, 1); else BIN_OP_RETURN (':', 0); } %{ // Gobble comments. If closest nesting is inside parentheses, don't // return a new line. %} {CCHAR} { if (! help_buf && beginning_of_function && nesting_level.empty ()) { grab_help_text (); beginning_of_function = 0; } else { int c; while ((c = yyinput ()) != EOF && c != '\n') ; // Eat comment. } quote_is_transpose = 0; cant_be_identifier = 0; current_input_column = 1; convert_spaces_to_comma = 1; if (nesting_level.empty () || nesting_level.top () == BRACE) return '\n'; } %{ // Other operators. %} ".*" { BIN_OP_RETURN (EMUL, 0); } "./" { BIN_OP_RETURN (EDIV, 0); } ".\\" { BIN_OP_RETURN (ELEFTDIV, 0); } {EPOW} { BIN_OP_RETURN (EPOW, 0); } ".'" { do_comma_insert_check (); BIN_OP_RETURN (TRANSPOSE, 1); } "++" { do_comma_insert_check (); BIN_OP_RETURN (PLUS_PLUS, 1); } "--" { do_comma_insert_check (); BIN_OP_RETURN (MINUS_MINUS, 1); } "<=" { BIN_OP_RETURN (EXPR_LE, 0); } "==" { BIN_OP_RETURN (EXPR_EQ, 0); } {NOTEQ} { BIN_OP_RETURN (EXPR_NE, 0); } ">=" { BIN_OP_RETURN (EXPR_GE, 0); } "|" { BIN_OP_RETURN (EXPR_OR, 0); } "&" { BIN_OP_RETURN (EXPR_AND, 0); } "<" { BIN_OP_RETURN (EXPR_LT, 0); } ">" { BIN_OP_RETURN (EXPR_GT, 0); } "*" { BIN_OP_RETURN ('*', 0); } "/" { BIN_OP_RETURN ('/', 0); } "\\" { BIN_OP_RETURN (LEFTDIV, 0); } ";" { BIN_OP_RETURN (';', 1); } "," { BIN_OP_RETURN (',', 1); } {POW} { BIN_OP_RETURN (POW, 0); } "=" { BIN_OP_RETURN ('=', 1); } "||" { #ifdef SHORT_CIRCUIT_LOGICALS BIN_OP_RETURN (EXPR_OR_OR, 0); #else BIN_OP_RETURN (EXPR_OR, 0); #endif } "&&" { #ifdef SHORT_CIRCUIT_LOGICALS BIN_OP_RETURN (EXPR_AND_AND, 0); #else BIN_OP_RETURN (EXPR_AND, 0); #endif } {NOT} { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN (EXPR_NOT, 0); } {PLUS} { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN ('+', 0); } {MINUS} { if (plotting && ! in_plot_range) past_plot_range = 1; BIN_OP_RETURN ('-', 0); } "(" { if (plotting && ! in_plot_range) past_plot_range = 1; nesting_level.push (PAREN); promptflag--; TOK_RETURN ('('); } ")" { if (! nesting_level.empty ()) nesting_level.pop (); current_input_column++; cant_be_identifier = 1; quote_is_transpose = 1; convert_spaces_to_comma = (! nesting_level.empty () && nesting_level.top () == BRACE); do_comma_insert_check (); return ')'; } %{ // We return everything else as single character tokens, which should // eventually result in a parse error. %} . { TOK_RETURN (yytext[0]); } %% // GAG. // // If we're reading a matrix and the next character is '[', make sure // that we insert a comma ahead of it. void do_comma_insert_check (void) { int spc_gobbled = eat_continuation (); int c = yyinput (); yyunput (c, yytext); if (spc_gobbled) yyunput (' ', yytext); do_comma_insert = (braceflag && c == '['); } // Fix things up for errors or interrupts. The parser is never called // recursively, so it is always safe to reinitialize its state before // doing any parsing. void reset_parser (void) { // Start off on the right foot. BEGIN 0; error_state = 0; // We do want a prompt by default. promptflag = 1; // Not initially screwed by `function [...] = f (...)' syntax. maybe_screwed = 0; maybe_screwed_again = 0; // Not initially inside a loop or if statement. looping = 0; iffing = 0; // Quote marks strings intially. quote_is_transpose = 0; // Next token can be identifier. cant_be_identifier = 0; // No need to do comma insert or convert spaces to comma at beginning // of input. do_comma_insert = 0; convert_spaces_to_comma = 1; // Not initially defining a function. beginning_of_function = 0; defining_func = 0; // Not initially doing any plotting or setting of plot attributes. plotting = 0; in_plot_range = 0; past_plot_range = 0; in_plot_using = 0; in_plot_style = 0; doing_set = 0; // Not initially looking at indirect references. looking_at_indirect_ref = 0; // Error may have occurred inside some parentheses or braces. nesting_level.clear (); // Not initially defining a matrix list. braceflag = 0; ml.clear (); mlnm.clear (); // Clear out the stack of token info used to track line and column // numbers. while (! token_stack.empty ()) delete token_stack.pop (); // Can be reset by defining a function. if (! (reading_script_file || reading_fcn_file)) { current_input_column = 1; input_line_number = current_command_number - 1; } // Only ask for input from stdin if we are expecting interactive // input. if (interactive && ! (reading_fcn_file || get_input_from_eval_string)) yyrestart (stdin); // Delete the buffer for help text. delete [] help_buf; help_buf = 0; } // Replace backslash escapes in a string with the real values. static void do_string_escapes (char *s) { char *p1 = s; char *p2 = s; while (*p2 != '\0') { if (*p2 == '\\' && *(p2+1) != '\0') { switch (*++p2) { case 'a': *p1 = '\a'; break; case 'b': // backspace *p1 = '\b'; break; case 'f': // formfeed *p1 = '\f'; break; case 'n': // newline *p1 = '\n'; break; case 'r': // carriage return *p1 = '\r'; break; case 't': // horizontal tab *p1 = '\t'; break; case 'v': // vertical tab *p1 = '\v'; break; case '\\': // backslash *p1 = '\\'; break; case '\'': // quote *p1 = '\''; break; case '"': // double quote *p1 = '"'; break; default: warning ("unrecognized escape sequence `\\%c' --\ converting to `%c'", *p2, *p2); *p1 = *p2; break; } } else { *p1 = *p2; } p1++; p2++; } *p1 = '\0'; } // If we read some newlines, we need figure out what column we're // really looking at. static void fixup_column_count (char *s) { char c; while ((c = *s++) != '\0') { if (c == '\n') current_input_column = 1; else current_input_column++; } } // Include these so that we don't have to link to libfl.a. #ifdef yywrap #undef yywrap #endif static int yywrap (void) { return 1; } // These are not needed with flex-2.4.6, but may be needed with // earlier 2.4.x versions. #if 0 static void * yy_flex_alloc (int size) { return (void *) malloc ((unsigned) size); } static void * yy_flex_realloc (void *ptr, int size) { return (void *) realloc (ptr, (unsigned) size); } static void yy_flex_free (void *ptr) { free (ptr); } #endif // Tell us all what the current buffer is. YY_BUFFER_STATE current_buffer (void) { return YY_CURRENT_BUFFER; } // Create a new buffer. YY_BUFFER_STATE create_buffer (FILE *f) { return yy_create_buffer (f, YY_BUF_SIZE); } // Start reading a new buffer. void switch_to_buffer (YY_BUFFER_STATE buf) { yy_switch_to_buffer (buf); } // Delete a buffer. void delete_buffer (YY_BUFFER_STATE buf) { yy_delete_buffer (buf); } // Restore a buffer (for unwind-prot). void restore_input_buffer (void *buf) { switch_to_buffer ((YY_BUFFER_STATE) buf); } // Delete a buffer (for unwind-prot). void delete_input_buffer (void *buf) { delete_buffer ((YY_BUFFER_STATE) buf); } // Check to see if a character string matches any of the possible line // styles for plots. static char * plot_style_token (char *s) { static char *plot_styles[] = { "boxes", "boxerrorbars", "dots", "errorbars", "impulses", "lines", "linespoints", "points", "steps", 0, }; char **tmp = plot_styles; while (*tmp) { if (almost_match (*tmp, s)) return *tmp; tmp++; } return 0; } // Check to see if a character string matches any one of the plot // option keywords. Don't match abbreviations for clear, since that's // not a gnuplot keyword (users will probably only expect to be able // to abbreviate actual gnuplot keywords). static int is_plot_keyword (char *s) { if (almost_match ("title", s)) { return TITLE; } else if (almost_match ("using", s)) { in_plot_using = 1; return USING; } else if (almost_match ("with", s)) { in_plot_style = 1; return WITH; } else if (strcmp ("clear", s) == 0) { return CLEAR; } else { return 0; } } // Handle keywords. Could probably be more efficient... static int is_keyword (char *s) { if (plotting && in_plot_style) { char *sty = plot_style_token (s); if (sty) { in_plot_style = 0; yylval.tok_val = new token (sty); token_stack.push (yylval.tok_val); return STYLE; } } int l = input_line_number; int c = current_input_column; // XXX FIXME XXX -- this has really become too large a list to search // like this... int end_found = 0; if (strcmp ("break", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return BREAK; } else if (strcmp ("continue", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return CONTINUE; } else if (strcmp ("else", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ELSE; } else if (strcmp ("elseif", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ELSEIF; } else if (strcmp ("end", s) == 0) { end_found = 1; yylval.tok_val = new token (token::simple_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endfor", s) == 0) { end_found = 1; yylval.tok_val = new token (token::for_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endfunction", s) == 0) { end_found = 1; yylval.tok_val = new token (token::function_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endif", s) == 0) { end_found = 1; yylval.tok_val = new token (token::if_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("endwhile", s) == 0) { end_found = 1; yylval.tok_val = new token (token::while_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("for", s) == 0) { promptflag--; looping++; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return FOR; } else if (strcmp ("function", s) == 0) { if (defining_func) { error ("function keyword invalid within a function body"); if ((reading_fcn_file || reading_script_file) && curr_fcn_file_name) error ("defining new function near line %d of file `%s.m'", input_line_number, curr_fcn_file_name); else error ("defining new function near line %d", input_line_number); return LEXICAL_ERROR; } else { tmp_local_sym_tab = new symbol_table (); curr_sym_tab = tmp_local_sym_tab; defining_func = 1; promptflag--; beginning_of_function = 1; if (! (reading_fcn_file || reading_script_file)) input_line_number = 1; return FCN; } } else if (strcmp ("global", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return GLOBAL; } else if (strcmp ("gplot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::two_dee, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("gsplot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::three_dee, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("replot", s) == 0) { plotting = 1; yylval.tok_val = new token (token::replot, l, c); token_stack.push (yylval.tok_val); return PLOT; } else if (strcmp ("if", s) == 0) { iffing++; promptflag--; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return IF; } else if (strcmp ("return", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return FUNC_RET; } else if (strcmp ("while", s) == 0) { promptflag--; looping++; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return WHILE; } else if (strcmp ("unwind_protect", s) == 0) { promptflag--; yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return UNWIND; } else if (strcmp ("unwind_protect_cleanup", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return CLEANUP; } else if (strcmp ("end_unwind_protect", s) == 0) { end_found = 1; yylval.tok_val = new token (token::unwind_protect_end, l, c); token_stack.push (yylval.tok_val); } else if (strcmp ("all_va_args", s) == 0) { yylval.tok_val = new token (l, c); token_stack.push (yylval.tok_val); return ALL_VA_ARGS; } if (end_found) return END; return 0; } // Try to find an identifier. All binding to global or builtin // variables occurs when expressions are evaluated. static symbol_record * lookup_identifier (char *name) { return curr_sym_tab->lookup (name, 1, 0); } // Grab the help text from an function file. Always overwrites the // current contents of help_buf. static void grab_help_text (void) { delete [] help_buf; help_buf = 0; ostrstream buf; int in_comment = 1; int c = 0; while ((c = yyinput ()) != EOF) { if (in_comment) { buf << (char) c; if (c == '\n') in_comment = 0; } else { switch (c) { case '%': case '#': in_comment = 1; break; case ' ': case '\t': break; default: goto done; } } } done: if (c) yyunput (c, yytext); buf << ends; help_buf = buf.str (); if (! help_buf || ! *help_buf) { delete [] help_buf; help_buf = 0; } } // Return 1 if the given character matches any character in the given // string. static int match_any (char c, char *s) { char tmp; while ((tmp = *s++) != '\0') { if (c == tmp) return 1; } return 0; } // Given information about the spacing surrounding an operator, // return 1 if it looks like it should be treated as a binary // operator. For example, // // [ 1 + 2 ] or [ 1+ 2] or [ 1+2 ] ==> binary static int looks_like_bin_op (int spc_prev, int spc_next) { return ((spc_prev && spc_next) || ! spc_prev); } // Duh. static int next_char_is_space (void) { int c = yyinput (); yyunput (c, yytext); return (c == ' ' || c == '\t'); } // Try to determine if the next token should be treated as a postfix // unary operator. This is ugly, but it seems to do the right thing. static int next_token_is_postfix_unary_op (int spc_prev, char *yytext) { int un_op = 0; int c0 = yyinput (); int c1 = yyinput (); yyunput (c1, yytext); yyunput (c0, yytext); int transpose = (c0 == '.' && c1 == '\''); int hermitian = (c0 == '\''); un_op = (transpose || (hermitian && ! spc_prev)); return un_op; } // Try to determine if the next token should be treated as a binary // operator. This is even uglier, but it also seems to do the right // thing. static int next_token_is_bin_op (int spc_prev, char *yytext) { int bin_op = 0; int spc_next = 0; int c0 = yyinput (); int c1 = yyinput (); switch (c0) { case '+': case '-': case '/': case ':': case '\\': case '^': spc_next = (c1 == ' ' || c1 == '\t'); break; case '&': if (c1 == '&') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '*': if (c1 == '*') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '|': if (c1 == '|') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '<': if (c1 == '=' || c1 == '>') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '>': if (c1 == '=') spc_next = next_char_is_space (); else spc_next = (c1 == ' ' || c1 == '\t'); break; case '~': case '!': case '=': if (c1 == '=') spc_next = next_char_is_space (); else goto done; break; case '.': if (c1 == '*') { int c2 = yyinput (); if (c2 == '*') spc_next = next_char_is_space (); else spc_next = (c2 == ' ' || c2 == '\t'); yyunput (c2, yytext); } else if (c1 == '/' || c1 == '\\' || c1 == '^') spc_next = next_char_is_space (); else goto done; break; default: goto done; } bin_op = looks_like_bin_op (spc_prev, spc_next); done: yyunput (c1, yytext); yyunput (c0, yytext); return bin_op; } // Used to delete trailing white space from tokens. static char * strip_trailing_whitespace (char *s) { char *retval = strsave (s); char *t = strchr (retval, ' '); if (t) *t = '\0'; t = strchr (retval, '\t'); if (t) *t = '\0'; return retval; } // Discard whitespace, including comments and continuations. // Return 1 if whitespace appeared in the input, 0 otherwise. static int eat_whitespace (void) { int retval = 0; int in_comment = 0; int c; while ((c = yyinput ()) != EOF) { current_input_column++; switch (c) { case ' ': case '\t': retval = 1; break; case '\n': retval = 1; in_comment = 0; current_input_column = 0; break; case '#': case '%': in_comment = 1; break; case '.': if (in_comment) break; else { if (have_ellipsis_continuation ()) break; else goto done; } case '\\': if (in_comment) break; else { if (have_continuation ()) break; else goto done; } default: if (in_comment) break; else goto done; } } done: yyunput (c, yytext); return retval; } static void handle_number (char *yytext) { double value; int nread = sscanf (yytext, "%lf", &value); // If yytext doesn't contain a valid number, we are in deep doo doo. assert (nread == 1); quote_is_transpose = 1; cant_be_identifier = 1; convert_spaces_to_comma = 1; if (plotting && ! in_plot_range) past_plot_range = 1; yylval.tok_val = new token (value, yytext, input_line_number, current_input_column); token_stack.push (yylval.tok_val); current_input_column += yyleng; do_comma_insert_check (); } // We have seen a backslash and need to find out if it should be // treated as a continuation character. If so, this eats it, up to // and including the new line character. // // Match whitespace only, followed by a comment character or newline. // Once a comment character is found, discard all input until newline. // If non-whitespace characters are found before comment // characters, return 0. Otherwise, return 1. static int have_continuation (void) { ostrstream buf; int in_comment = 0; char c; while ((c = yyinput ()) != EOF) { buf << (char) c; switch (c) { case ' ': case '\t': break; case '%': case '#': in_comment = 1; break; case '\n': current_input_column = 0; promptflag--; return 1; default: if (in_comment) break; else { buf << ends; char *s = buf.str (); if (s) { int len = strlen (s); while (len--) yyunput (s[len], yytext); } delete [] s; return 0; } } } yyunput (c, yytext); return 0; } // We have seen a `.' and need to see if it is the start of a // continuation. If so, this eats it, up to and including the new // line character. static int have_ellipsis_continuation (void) { char c1 = yyinput (); if (c1 == '.') { char c2 = yyinput (); if (c2 == '.' && have_continuation ()) return 1; else { yyunput (c2, yytext); yyunput (c1, yytext); } } else yyunput (c1, yytext); return 0; } // See if we have a continuation line. If so, eat it and the leading // whitespace on the next line. // Return 1 if whitespace appeared in the input, 0 otherwise. static int eat_continuation (void) { int retval = 0; int c = yyinput (); if ((c == '.' && have_ellipsis_continuation ()) || (c == '\\' && have_continuation ())) retval = eat_whitespace (); else yyunput (c, yytext); return retval; } static int handle_string (char delim, int text_style) { ostrstream buf; int c; int prev = 0; while ((c = yyinput ()) != EOF) { current_input_column++; if (c == '\\') { if (! have_continuation ()) buf << (char) c; goto next; } else if (c == '.') { if (! have_ellipsis_continuation ()) buf << (char) c; goto next; } else if (c == '\n') { break; } else if (c == delim) { if (prev == '\\') buf << (char) c; else { c = yyinput (); if (c == delim) buf << (char) c; else { yyunput (c, yytext); buf << ends; char *tok = buf.str (); do_string_escapes (tok); if (text_style && doing_set) { if (tok) { int len = strlen (tok) + 3; char *tmp = tok; tok = new char [len]; tok[0] = delim; strcpy (tok+1, tmp); tok[len-2] = delim; tok[len-1] = '\0'; delete [] tmp; } } else { quote_is_transpose = 1; cant_be_identifier = 1; convert_spaces_to_comma = 1; } yylval.tok_val = new token (tok); delete [] tok; token_stack.push (yylval.tok_val); return TEXT; } } } else { buf << (char) c; } next: prev = c; } return LEXICAL_ERROR; } static int handle_close_brace (int spc_gobbled) { if (! nesting_level.empty ()) { nesting_level.pop (); braceflag--; } if (braceflag == 0) BEGIN 0; int c1 = yyinput (); if (c1 == '=') { quote_is_transpose = 0; cant_be_identifier = 0; convert_spaces_to_comma = 1; int c2 = yyinput (); unput (c2); unput (c1); if (c2 != '=' && maybe_screwed_again) return SCREW_TWO; else return ']'; } else { unput (c1); if (braceflag && user_pref.whitespace_in_literal_matrix != 2) { int bin_op = next_token_is_bin_op (spc_gobbled, yytext); int postfix_un_op = next_token_is_postfix_unary_op (spc_gobbled, yytext); int other_op = match_any (c1, ",;\n]"); if (! (postfix_un_op || bin_op || other_op || nesting_level.empty ()) && nesting_level.top () == BRACE && convert_spaces_to_comma) { unput (','); return ']'; } } } quote_is_transpose = 1; cant_be_identifier = 0; convert_spaces_to_comma = 1; return ']'; } // Figure out exactly what kind of token to return when we have seen // an identifier. Handles keywords. static int handle_identifier (char *tok, int spc_gobbled) { // It is almost always an error for an identifier to be followed // directly by another identifier. Special cases are handled below. cant_be_identifier = 1; // If we are expecting a structure element, we just want to return // TEXT_ID, which is a string that is also a valid identifier. if (looking_at_indirect_ref) { yylval.tok_val = new token (tok); token_stack.push (yylval.tok_val); TOK_RETURN (TEXT_ID); } // If we have a regular keyword, or a plot STYLE, return it. Keywords // can be followed by identifiers (TOK_RETURN handles that). int kw_token = is_keyword (tok); if (kw_token) { if (kw_token == STYLE) { quote_is_transpose = 0; convert_spaces_to_comma = 1; return kw_token; } else TOK_RETURN (kw_token); } // See if we have a plot keyword (title, using, with, or clear). if (plotting) { // Yes, we really do need both of these plot_range variables. One // is used to mark when we are past all possiblity of a plot range, // the other is used to mark when we are actually between the square // brackets that surround the range. if (! in_plot_range) past_plot_range = 1; int plot_option_kw = is_plot_keyword (tok); if (cant_be_identifier && plot_option_kw) TOK_RETURN (plot_option_kw); } // If we are looking at a text style function, set up to gobble its // arguments. These are also reserved words, but only because it // would be very difficult to do anything intelligent with them if // they were not reserved. if (is_text_function_name (tok)) { BEGIN TEXT_FCN; if (strcmp (tok, "help") == 0) BEGIN HELP_FCN; else if (strcmp (tok, "set") == 0) doing_set = 1; } int c = yyinput (); yyunput (c, yytext); int next_tok_is_eq = (c == '='); // Make sure we put the return values of a function in the symbol // table that is local to the function. if (next_tok_is_eq && defining_func && maybe_screwed) curr_sym_tab = tmp_local_sym_tab; // Find the token in the symbol table. yylval.tok_val = new token (lookup_identifier (tok), input_line_number, current_input_column); token_stack.push (yylval.tok_val); // After seeing an identifer, it is ok to convert spaces to a comma // (if needed). convert_spaces_to_comma = 1; // If we are defining a function and we have not seen the parameter // list yet and the next token is `=', return a token that represents // the only return value for the function. For example, // // function SCREW = f (args); // // The variable maybe_screwed is reset in parse.y. if (next_tok_is_eq) { if (defining_func && maybe_screwed) return SCREW; else return NAME; } // At this point, we are only dealing with identifiers that are not // followed by `=' (if the next token is `=', there is no need to // check to see if we should insert a comma (invalid syntax), or allow // a following `'' to be treated as a transpose (the next token is // `=', so it can't be `''. quote_is_transpose = 1; do_comma_insert_check (); // Check to see if we should insert a comma. if (user_pref.whitespace_in_literal_matrix != 2 && ! nesting_level.empty () && nesting_level.top () == BRACE) { int bin_op = next_token_is_bin_op (spc_gobbled, yytext); int postfix_un_op = next_token_is_postfix_unary_op (spc_gobbled, yytext); int c1 = yyinput (); unput (c1); int other_op = match_any (c1, ".,;\n]"); int index_op = (c1 == '(' && (user_pref.whitespace_in_literal_matrix == 0 || ! spc_gobbled)); if (! (postfix_un_op || bin_op || other_op || index_op)) unput (','); } return NAME; } // Print a warning if a function file that defines a function has // anything other than comments and whitespace following the END token // that matches the FUNCTION statement. void check_for_garbage_after_fcn_def (void) { // By making a newline be the next character to be read, we will force // the parser to return after reading the function. Calling yyunput // with EOF seems not to work... int in_comment = 0; int lineno = input_line_number; int c; while ((c = yyinput ()) != EOF) { switch (c) { case ' ': case '\t': case ';': case ',': break; case '\n': if (in_comment) in_comment = 0; break; case '%': case '#': in_comment = 1; break; default: if (in_comment) break; else { warning ("ignoring trailing garbage after end of function\n\ near line %d of file `%s.m'", lineno, curr_fcn_file_name); yyunput ('\n', yytext); return; } } } yyunput ('\n', yytext); } /* Maybe someday... "+=" return ADD_EQ; "-=" return SUB_EQ; "*=" return MUL_EQ; "/=" return DIV_EQ; "\\=" return LEFTDIV_EQ; ".+=" return ADD_EQ; ".-=" return SUB_EQ; ".*=" return EMUL_EQ; "./=" return EDIV_EQ; ".\\=" return ELEFTDIV_EQ; */ octave-1.1.0/src/load-save.cc100666 415 17 173427 5702417026 14171 0ustar jweusers// load-save.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include #include #include "tree-base.h" #include "tree-expr.h" #include "tree-const.h" #include "user-prefs.h" #include "unwind-prot.h" #include "load-save.h" #include "symtab.h" #include "pager.h" #include "error.h" #include "gripes.h" #include "defun.h" #include "utils.h" #include "help.h" extern "C" { #include #include "fnmatch.h" } #if CHAR_BIT != 8 LOSE! LOSE! #endif #if SIZEOF_SHORT == 2 #define TWO_BYTE_INT short #elif SIZEOF_INT == 2 #define TWO_BYTE_INT int #else LOSE! LOSE! #endif #if SIZEOF_INT == 4 #define FOUR_BYTE_INT int #elif SIZEOF_LONG == 4 #define FOUR_BYTE_INT long #else LOSE! LOSE! #endif // Used when converting Inf to something that gnuplot can read. #ifndef OCT_RBV #define OCT_RBV DBL_MAX / 100.0 #endif enum load_save_format { LS_ASCII, LS_BINARY, LS_MAT_BINARY, LS_UNKNOWN, }; enum floating_point_format { LS_IEEE_LITTLE, LS_IEEE_BIG, LS_VAX_D, LS_VAX_G, LS_CRAY, LS_UNKNOWN_FLT_FMT, }; // Not all of the following are currently used. enum save_type { LS_U_CHAR, LS_U_SHORT, LS_U_INT, LS_CHAR, LS_SHORT, LS_INT, LS_FLOAT, LS_DOUBLE, }; #if defined (IEEE_LITTLE_ENDIAN) #define NATIVE_FLOAT_FORMAT LS_IEEE_LITTLE #elif defined (IEEE_BIG_ENDIAN) #define NATIVE_FLOAT_FORMAT LS_IEEE_BIG #elif defined (VAX_D_FLOAT) #define NATIVE_FLOAT_FORMAT LS_VAX_D #elif defined (VAX_G_FLOAT) #define NATIVE_FLOAT_FORMAT LS_VAX_G #else LOSE! LOSE! #endif #define swap_1_bytes(x,y) #define LS_DO_READ(TYPE,swap,data,size,len,stream) \ do \ { \ volatile TYPE *ptr = (TYPE *) data; \ stream.read ((TYPE *) ptr, size * len); \ if (swap) \ swap_ ## size ## _bytes ((char *) ptr, len); \ TYPE tmp = ptr[0]; \ for (int i = len - 1; i > 0; i--) \ data[i] = ptr[i]; \ data[0] = tmp; \ } \ while (0) // Have to use copy here to avoid writing over data accessed via // Matrix::data(). #define LS_DO_WRITE(TYPE,data,size,len,stream) \ do \ { \ char tmp_type = (char) type; \ stream.write (&tmp_type, 1); \ TYPE *ptr = new TYPE [len]; \ for (int i = 0; i < len; i++) \ ptr[i] = (TYPE) data[i]; \ stream.write ((TYPE *) ptr, size * len); \ delete [] ptr ; \ } \ while (0) // Loading variables from files. // But first, some data conversion routines. // Currently, we only handle conversions for the IEEE types. To fix // that, make more of the following routines work. #define LS_SWAP_BYTES(i,j) \ tmp = t[i]; \ t[i] = t[j]; \ t[j] = tmp; \ static inline void swap_2_bytes (char *t) { char tmp; LS_SWAP_BYTES (0, 1); } static inline void swap_4_bytes (char *t) { char tmp; LS_SWAP_BYTES (0, 3); LS_SWAP_BYTES (1, 2); } static inline void swap_8_bytes (char *t) { char tmp; LS_SWAP_BYTES (0, 7); LS_SWAP_BYTES (1, 6); LS_SWAP_BYTES (2, 5); LS_SWAP_BYTES (3, 4); } static inline void swap_2_bytes (char *t, int len) { char *ptr = t; for (int i = 0; i < len; i++) { swap_2_bytes (ptr); ptr += 2; } } static inline void swap_4_bytes (char *t, int len) { char *ptr = t; for (int i = 0; i < len; i++) { swap_4_bytes (ptr); ptr += 4; } } static inline void swap_8_bytes (char *t, int len) { char *ptr = t; for (int i = 0; i < len; i++) { swap_8_bytes (ptr); ptr += 8; } } // XXX FIXME XXX -- assumes sizeof (Complex) == 8 // XXX FIXME XXX -- assumes sizeof (double) == 8 // XXX FIXME XXX -- assumes sizeof (float) == 4 #if defined (IEEE_LITTLE_ENDIAN) static void IEEE_big_double_to_IEEE_little_double (double *d, int len) { swap_8_bytes ((char *) d, len); } static void VAX_D_double_to_IEEE_little_double (double *d, int len) { gripe_data_conversion ("VAX D float", "IEEE little endian format"); } static void VAX_G_double_to_IEEE_little_double (double *d, int len) { gripe_data_conversion ("VAX G float", "IEEE little endian format"); } static void Cray_to_IEEE_little_double (double *d, int len) { gripe_data_conversion ("Cray", "IEEE little endian format"); } static void IEEE_big_float_to_IEEE_little_float (float *d, int len) { swap_4_bytes ((char *) d, len); } static void VAX_D_float_to_IEEE_little_float (float *d, int len) { gripe_data_conversion ("VAX D float", "IEEE little endian format"); } static void VAX_G_float_to_IEEE_little_float (float *d, int len) { gripe_data_conversion ("VAX G float", "IEEE little endian format"); } static void Cray_to_IEEE_little_float (float *d, int len) { gripe_data_conversion ("Cray", "IEEE little endian format"); } #elif defined (IEEE_BIG_ENDIAN) static void IEEE_little_double_to_IEEE_big_double (double *d, int len) { swap_8_bytes ((char *) d, len); } static void VAX_D_double_to_IEEE_big_double (double *d, int len) { gripe_data_conversion ("VAX D float", "IEEE big endian format"); } static void VAX_G_double_to_IEEE_big_double (double *d, int len) { gripe_data_conversion ("VAX G float", "IEEE big endian format"); } static void Cray_to_IEEE_big_double (double *d, int len) { gripe_data_conversion ("Cray", "IEEE big endian format"); } static void IEEE_little_float_to_IEEE_big_float (float *d, int len) { swap_4_bytes ((char *) d, len); } static void VAX_D_float_to_IEEE_big_float (float *d, int len) { gripe_data_conversion ("VAX D float", "IEEE big endian format"); } static void VAX_G_float_to_IEEE_big_float (float *d, int len) { gripe_data_conversion ("VAX G float", "IEEE big endian format"); } static void Cray_to_IEEE_big_float (float *d, int len) { gripe_data_conversion ("Cray", "IEEE big endian format"); } #elif defined (VAX_D_FLOAT) static void IEEE_little_double_to_VAX_D_double (double *d, int len) { gripe_data_conversion ("IEEE little endian", "VAX D"); } static void IEEE_big_double_to_VAX_D_double (double *d, int len) { gripe_data_conversion ("IEEE big endian", "VAX D"); } static void VAX_G_double_to_VAX_D_double (double *d, int len) { gripe_data_conversion ("VAX G float", "VAX D"); } static void Cray_to_VAX_D_double (double *d, int len) { gripe_data_conversion ("Cray", "VAX D"); } static void IEEE_little_float_to_VAX_D_float (float *d, int len) { gripe_data_conversion ("IEEE little endian", "VAX D"); } static void IEEE_big_float_to_VAX_D_float (float *d, int len) { gripe_data_conversion ("IEEE big endian", "VAX D"); } static void VAX_G_float_to_VAX_D_float (float *d, int len) { gripe_data_conversion ("VAX G float", "VAX D"); } static void Cray_to_VAX_D_float (float *d, int len) { gripe_data_conversion ("Cray", "VAX D"); } #elif defined (VAX_G_FLOAT) static void IEEE_little_double_to_VAX_G_double (double *d, int len) { gripe_data_conversion ("IEEE little endian", "VAX G"); } static void IEEE_big_double_to_VAX_G_double (double *d, int len) { gripe_data_conversion ("IEEE big endian", "VAX G"); } static void VAX_D_double_to_VAX_G_double (double *d, int len) { gripe_data_conversion ("VAX D float", "VAX G"); } static void Cray_to_VAX_G_double (double *d, int len) { gripe_data_conversion ("VAX G float", "VAX G"); } static void IEEE_little_float_to_VAX_G_float (float *d, int len) { gripe_data_conversion ("IEEE little endian", "VAX G"); } static void IEEE_big_float_to_VAX_G_float (float *d, int len) { gripe_data_conversion ("IEEE big endian", "VAX G"); } static void VAX_D_float_to_VAX_G_float (float *d, int len) { gripe_data_conversion ("VAX D float", "VAX G"); } static void Cray_to_VAX_G_float (float *d, int len) { gripe_data_conversion ("VAX G float", "VAX G"); } #endif static void do_double_format_conversion (double *data, int len, floating_point_format fmt) { switch (fmt) { #if defined (IEEE_LITTLE_ENDIAN) case LS_IEEE_LITTLE: break; case LS_IEEE_BIG: IEEE_big_double_to_IEEE_little_double (data, len); break; case LS_VAX_D: VAX_D_double_to_IEEE_little_double (data, len); break; case LS_VAX_G: VAX_G_double_to_IEEE_little_double (data, len); break; case LS_CRAY: Cray_to_IEEE_little_double (data, len); break; #elif defined (IEEE_BIG_ENDIAN) case LS_IEEE_LITTLE: IEEE_little_double_to_IEEE_big_double (data, len); break; case LS_IEEE_BIG: break; case LS_VAX_D: VAX_D_double_to_IEEE_big_double (data, len); break; case LS_VAX_G: VAX_G_double_to_IEEE_big_double (data, len); break; case LS_CRAY: Cray_to_IEEE_big_double (data, len); break; #elif defined (VAX_D_FLOAT) case LS_IEEE_LITTLE: IEEE_little_double_to_VAX_D_double (data, len); break; case LS_IEEE_BIG: IEEE_big_double_to_VAX_D_double (data, len); break; case LS_VAX_D: break; case LS_VAX_G: VAX_G_double_to_VAX_D_double (data, len); break; case LS_CRAY: Cray_to_VAX_D_double (data, len); break; #elif defined (VAX_G_FLOAT) case LS_IEEE_LITTLE: IEEE_little_double_to_VAX_G_double (data, len); break; case LS_IEEE_BIG: IEEE_big_double_to_VAX_G_double (data, len); break; case LS_VAX_D: VAX_D_double_to_VAX_G_double (data, len); break; case LS_VAX_G: break; case LS_CRAY: Cray_to_VAX_G_double (data, len); break; #else LOSE! LOSE! #endif default: gripe_unrecognized_float_fmt (); break; } } static void do_float_format_conversion (float *data, int len, floating_point_format fmt) { switch (fmt) { #if defined (IEEE_LITTLE_ENDIAN) case LS_IEEE_LITTLE: break; case LS_IEEE_BIG: IEEE_big_float_to_IEEE_little_float (data, len); break; case LS_VAX_D: VAX_D_float_to_IEEE_little_float (data, len); break; case LS_VAX_G: VAX_G_float_to_IEEE_little_float (data, len); break; case LS_CRAY: Cray_to_IEEE_little_float (data, len); break; #elif defined (IEEE_BIG_ENDIAN) case LS_IEEE_LITTLE: IEEE_little_float_to_IEEE_big_float (data, len); break; case LS_IEEE_BIG: break; case LS_VAX_D: VAX_D_float_to_IEEE_big_float (data, len); break; case LS_VAX_G: VAX_G_float_to_IEEE_big_float (data, len); break; case LS_CRAY: Cray_to_IEEE_big_float (data, len); break; #elif defined (VAX_D_FLOAT) case LS_IEEE_LITTLE: IEEE_little_float_to_VAX_D_float (data, len); break; case LS_IEEE_BIG: IEEE_big_float_to_VAX_D_float (data, len); break; case LS_VAX_D: break; case LS_VAX_G: VAX_G_float_to_VAX_D_float (data, len); break; case LS_CRAY: Cray_to_VAX_D_float (data, len); break; #elif defined (VAX_G_FLOAT) case LS_IEEE_LITTLE: IEEE_little_float_to_VAX_G_float (data, len); break; case LS_IEEE_BIG: IEEE_big_float_to_VAX_G_float (data, len); break; case LS_VAX_D: VAX_D_float_to_VAX_G_float (data, len); break; case LS_VAX_G: break; case LS_CRAY: Cray_to_VAX_G_float (data, len); break; #else LOSE! LOSE! #endif default: gripe_unrecognized_float_fmt (); break; } } static void read_doubles (istream& is, double *data, save_type type, int len, int swap, floating_point_format fmt) { switch (type) { case LS_U_CHAR: LS_DO_READ (unsigned char, swap, data, 1, len, is); break; case LS_U_SHORT: LS_DO_READ (unsigned TWO_BYTE_INT, swap, data, 2, len, is); break; case LS_U_INT: LS_DO_READ (unsigned FOUR_BYTE_INT, swap, data, 4, len, is); break; case LS_CHAR: LS_DO_READ (signed char, swap, data, 1, len, is); break; case LS_SHORT: LS_DO_READ (TWO_BYTE_INT, swap, data, 2, len, is); break; case LS_INT: LS_DO_READ (FOUR_BYTE_INT, swap, data, 4, len, is); break; case LS_FLOAT: { volatile float *ptr = (float *) data; is.read (data, 4 * len); do_float_format_conversion ((float *) data, len, fmt); float tmp = ptr[0]; for (int i = len - 1; i > 0; i--) data[i] = ptr[i]; data[0] = tmp; } break; case LS_DOUBLE: is.read (data, 8 * len); do_double_format_conversion (data, len, fmt); break; default: is.clear (ios::failbit|is.rdstate ()); break; } } static void write_doubles (ostream& os, const double *data, save_type type, int len) { switch (type) { case LS_U_CHAR: LS_DO_WRITE (unsigned char, data, 1, len, os); break; case LS_U_SHORT: LS_DO_WRITE (unsigned TWO_BYTE_INT, data, 2, len, os); break; case LS_U_INT: LS_DO_WRITE (unsigned FOUR_BYTE_INT, data, 4, len, os); break; case LS_CHAR: LS_DO_WRITE (signed char, data, 1, len, os); break; case LS_SHORT: LS_DO_WRITE (TWO_BYTE_INT, data, 2, len, os); break; case LS_INT: LS_DO_WRITE (FOUR_BYTE_INT, data, 4, len, os); break; case LS_FLOAT: LS_DO_WRITE (float, data, 4, len, os); break; case LS_DOUBLE: { char tmp_type = (char) type; os.write (&tmp_type, 1); os.write (data, 8 * len); } break; default: error ("unrecognized data format requested"); break; } } // Return nonzero if S is a valid identifier. static int valid_identifier (char *s) { if (! s || ! (isalnum (*s) || *s == '_')) return 0; while (*++s != '\0') if (! (isalnum (*s) || *s == '_')) return 0; return 1; } // Return nonzero if any element of M is not an integer. Also extract // the largest and smallest values and return them in MAX_VAL and MIN_VAL. static int all_parts_int (const Matrix& m, double& max_val, double& min_val) { int nr = m.rows (); int nc = m.columns (); if (nr > 0 && nc > 0) { max_val = m.elem (0, 0); min_val = m.elem (0, 0); } else return 0; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double val = m.elem (i, j); if (val > max_val) max_val = val; if (val < min_val) min_val = val; if (D_NINT (val) != val) return 0; } return 1; } // Return nonzero if any element of CM has a non-integer real or // imaginary part. Also extract the largest and smallest (real or // imaginary) values and return them in MAX_VAL and MIN_VAL. static int all_parts_int (const ComplexMatrix& m, double& max_val, double& min_val) { int nr = m.rows (); int nc = m.columns (); if (nr > 0 && nc > 0) { Complex val = m.elem (0, 0); double r_val = real (val); double i_val = imag (val); max_val = r_val; min_val = r_val; if (i_val > max_val) max_val = i_val; if (i_val < max_val) min_val = i_val; } else return 0; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { Complex val = m.elem (i, j); double r_val = real (val); double i_val = imag (val); if (r_val > max_val) max_val = r_val; if (i_val > max_val) max_val = i_val; if (r_val < min_val) min_val = r_val; if (i_val < min_val) min_val = i_val; if (D_NINT (r_val) != r_val || D_NINT (i_val) != i_val) return 0; } return 1; } static int too_large_for_float (const Matrix& m) { int nr = m.rows (); int nc = m.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { Complex val = m.elem (i, j); double r_val = real (val); double i_val = imag (val); if (r_val > FLT_MAX || i_val > FLT_MAX || r_val < FLT_MIN || i_val < FLT_MIN) return 1; } return 0; } static int too_large_for_float (const ComplexMatrix& m) { int nr = m.rows (); int nc = m.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { Complex val = m.elem (i, j); double r_val = real (val); double i_val = imag (val); if (r_val > FLT_MAX || i_val > FLT_MAX || r_val < FLT_MIN || i_val < FLT_MIN) return 1; } return 0; } // XXX FIXME XXX -- shouldn't this be implemented in terms of other // functions that are already available? // Install a variable with name NAME and the value specified TC in the // symbol table. If FORCE is nonzero, replace any existing definition // for NAME. If GLOBAL is nonzero, make the variable global. // // Assumes TC is defined. static void install_loaded_variable (int force, char *name, const tree_constant& tc, int global, char *doc) { // Is there already a symbol by this name? If so, what is it? symbol_record *lsr = curr_sym_tab->lookup (name, 0, 0); int is_undefined = 1; int is_variable = 0; int is_function = 0; int is_global = 0; if (lsr) { is_undefined = ! lsr->is_defined (); is_variable = lsr->is_variable (); is_function = lsr->is_function (); is_global = lsr->is_linked_to_global (); } symbol_record *sr = 0; if (global) { if (is_global || is_undefined) { if (force || is_undefined) { lsr = curr_sym_tab->lookup (name, 1, 0); link_to_global_variable (lsr); sr = lsr; } else { warning ("load: global variable name `%s' exists.", name); warning ("use `load -force' to overwrite"); } } else if (is_function) { if (force) { lsr = curr_sym_tab->lookup (name, 1, 0); link_to_global_variable (lsr); sr = lsr; } else { warning ("load: `%s' is currently a function in this scope", name); warning ("`load -force' will load variable and hide function"); } } else if (is_variable) { if (force) { lsr = curr_sym_tab->lookup (name, 1, 0); link_to_global_variable (lsr); sr = lsr; } else { warning ("load: local variable name `%s' exists.", name); warning ("use `load -force' to overwrite"); } } else error ("load: unable to load data for unknown symbol type"); } else { if (is_global) { if (force || is_undefined) { lsr = curr_sym_tab->lookup (name, 1, 0); link_to_global_variable (lsr); sr = lsr; } else { warning ("load: global variable name `%s' exists.", name); warning ("use `load -force' to overwrite"); } } else if (is_function) { if (force) { lsr = curr_sym_tab->lookup (name, 1, 0); link_to_global_variable (lsr); sr = lsr; } else { warning ("load: `%s' is currently a function in this scope", name); warning ("`load -force' will load variable and hide function"); } } else if (is_variable || is_undefined) { if (force || is_undefined) { lsr = curr_sym_tab->lookup (name, 1, 0); sr = lsr; } else { warning ("load: local variable name `%s' exists.", name); warning ("use `load -force' to overwrite"); } } else error ("load: unable to load data for unknown symbol type"); } if (sr) { tree_constant *tmp_tc = new tree_constant (tc); sr->define (tmp_tc); if (doc) sr->document (doc); return; } else error ("load: unable to load variable `%s'", name); return; } // Functions for reading ascii data. // Skip white space and comments on stream IS. static void skip_comments (istream& is) { char c = '\0'; while (is.get (c)) { if (c == ' ' || c == '\t' || c == '\n') ; // Skip whitespace on way to beginning of next line. else break; } for (;;) { if (is && c == '#') while (is.get (c) && c != '\n') ; // Skip to beginning of next line, ignoring everything. else break; } } // Extract a KEYWORD and its value from stream IS, returning the // associated value in a new string. // // Input should look something like: // // #[ \t]*keyword[ \t]*:[ \t]*string-value[ \t]*\n static char * extract_keyword (istream& is, char *keyword) { ostrstream buf; char *retval = 0; char c; while (is.get (c)) { if (c == '#') { while (is.get (c) && (c == ' ' || c == '\t' || c == '#')) ; // Skip whitespace and comment characters. if (isalpha (c)) buf << c; while (is.get (c) && isalpha (c)) buf << c; buf << ends; char *tmp = buf.str (); int match = (strncmp (tmp, keyword, strlen (keyword)) == 0); delete [] tmp; if (match) { ostrstream value; while (is.get (c) && (c == ' ' || c == '\t' || c == ':')) ; // Skip whitespace and the colon. if (c != '\n') { value << c; while (is.get (c) && c != '\n') value << c; } value << ends; retval = value.str (); break; } } } if (retval) { int len = strlen (retval); if (len > 0) { char *ptr = retval + len - 1; while (*ptr == ' ' || *ptr == '\t') ptr--; *(ptr+1) = '\0'; } } return retval; } // Match KEYWORD on stream IS, placing the associated value in VALUE, // returning 1 if successful and 0 otherwise. // // Input should look something like: // // [ \t]*keyword[ \t]*int-value.*\n static int extract_keyword (istream& is, char *keyword, int& value) { ostrstream buf; int status = 0; value = 0; char c; while (is.get (c)) { if (c == '#') { while (is.get (c) && (c == ' ' || c == '\t' || c == '#')) ; // Skip whitespace and comment characters. if (isalpha (c)) buf << c; while (is.get (c) && isalpha (c)) buf << c; buf << ends; char *tmp = buf.str (); int match = (strncmp (tmp, keyword, strlen (keyword)) == 0); delete [] tmp; if (match) { while (is.get (c) && (c == ' ' || c == '\t' || c == ':')) ; // Skip whitespace and the colon. is.putback (c); if (c != '\n') is >> value; if (is) status = 1; while (is.get (c) && c != '\n') ; // Skip to beginning of next line; break; } } } return status; } // Extract one value (scalar, matrix, string, etc.) from stream IS and // place it in TC, returning the name of the variable. If the value // is tagged as global in the file, return nonzero in GLOBAL. // // FILENAME is used for error messages. // // The data is expected to be in the following format: // // The input file must have a header followed by some data. // // All lines in the header must begin with a `#' character. // // The header must contain a list of keyword and value pairs with the // keyword and value separated by a colon. // // Keywords must appear in the following order: // // # name: // # type: // # // // Where: // // : a valid identifier // // : // | global // // : scalar // | complex scalar // | matrix // | complex matrix // | string // | range // // : // | // // : # rows: // | # columns: // // : # len: // // Formatted ASCII data follows the header. // // Example: // // # name: foo // # type: matrix // # rows: 2 // # columns: 2 // 2 4 // 1 3 // // XXX FIXME XXX -- this format is fairly rigid, and doesn't allow for // arbitrary comments, etc. Someone should fix that. static char * read_ascii_data (istream& is, const char *filename, int& global, tree_constant& tc) { // Read name for this entry or break on EOF. char *name = extract_keyword (is, "name"); if (! name) return 0; if (! *name) { error ("load: empty name keyword found in file `%s'", filename); delete [] name; return 0; } if (! valid_identifier (name)) { error ("load: bogus identifier `%s' found in file `%s'", name, filename); delete [] name; return 0; } // Look for type keyword char *tag = extract_keyword (is, "type"); if (tag && *tag) { char *ptr = strchr (tag, ' '); if (ptr) { *ptr = '\0'; global = (strncmp (tag, "global", 6) == 0); *ptr = ' '; if (global) ptr++; else ptr = tag; } else ptr = tag; if (strncmp (ptr, "scalar", 6) == 0) { double tmp; is >> tmp; if (is) tc = tmp; else error ("load: failed to load scalar constant"); } else if (strncmp (ptr, "matrix", 6) == 0) { int nr = 0, nc = 0; if (extract_keyword (is, "rows", nr) && nr > 0 && extract_keyword (is, "columns", nc) && nc > 0) { Matrix tmp (nr, nc); is >> tmp; if (is) tc = tmp; else error ("load: failed to load matrix constant"); } else error ("load: failed to extract number of rows and columns"); } else if (strncmp (ptr, "complex scalar", 14) == 0) { Complex tmp; is >> tmp; if (is) tc = tmp; else error ("load: failed to load complex scalar constant"); } else if (strncmp (ptr, "complex matrix", 14) == 0) { int nr = 0, nc = 0; if (extract_keyword (is, "rows", nr) && nr > 0 && extract_keyword (is, "columns", nc) && nc > 0) { ComplexMatrix tmp (nr, nc); is >> tmp; if (is) tc = tmp; else error ("load: failed to load complex matrix constant"); } else error ("load: failed to extract number of rows and columns"); } else if (strncmp (ptr, "string", 6) == 0) { int len; if (extract_keyword (is, "length", len) && len > 0) { char *tmp = new char [len+1]; is.get (tmp, len+1, EOF); if (is) tc = tmp; else error ("load: failed to load string constant"); } else error ("load: failed to extract string length"); } else if (strncmp (ptr, "range", 5) == 0) { // # base, limit, range comment added by save(). skip_comments (is); Range tmp; is >> tmp; if (is) tc = tmp; else error ("load: failed to load range constant"); } else error ("load: unknown constant type `%s'", tag); } else error ("load: failed to extract keyword specifying value type"); delete [] tag; if (error_state) { error ("load: reading file %s", filename); return 0; } return name; } // Extract one value (scalar, matrix, string, etc.) from stream IS and // place it in TC, returning the name of the variable. If the value // is tagged as global in the file, return nonzero in GLOBAL. If SWAP // is nonzero, swap bytes after reading. // // The data is expected to be in the following format: // // Header (one per file): // ===================== // // object type bytes // ------ ---- ----- // magic number string 10 // // float format integer 1 // // // Data (one set for each item): // ============================ // // object type bytes // ------ ---- ----- // name_length integer 4 // // name string name_length // // doc_length integer 4 // // doc string doc_length // // global flag integer 1 // // data type integer 1 // // data (one of): // // scalar: // data real 8 // // complex scalar: // data complex 16 // // matrix: // rows integer 4 // columns integer 4 // data real r*c*8 // // complex matrix: // rows integer 4 // columns integer 4 // data complex r*c*16 // // string: // length int 4 // data string length // // range: // base real 8 // limit real 8 // increment real 8 // // FILENAME is used for error messages. static char * read_binary_data (istream& is, int swap, floating_point_format fmt, const char *filename, int& global, tree_constant& tc, char *&doc) { char tmp = 0; FOUR_BYTE_INT name_len = 0, doc_len = 0; char *name = 0; doc = 0; // We expect to fail here, at the beginning of a record, so not being // able to read another name should not result in an error. is.read (&name_len, 4); if (! is) return 0; if (swap) swap_4_bytes ((char *) &name_len); name = new char [name_len+1]; name[name_len] = '\0'; if (! is.read (name, name_len)) goto data_read_error; is.read (&doc_len, 4); if (! is) goto data_read_error; if (swap) swap_4_bytes ((char *) &doc_len); doc = new char [doc_len+1]; doc[doc_len] = '\0'; if (! is.read (doc, doc_len)) goto data_read_error; if (! is.read (&tmp, 1)) goto data_read_error; global = tmp ? 1 : 0; tmp = 0; if (! is.read (&tmp, 1)) goto data_read_error; switch (tmp) { case 1: { if (! is.read (&tmp, 1)) goto data_read_error; double dtmp; read_doubles (is, &dtmp, (save_type) tmp, 1, swap, fmt); if (error_state || ! is) goto data_read_error; tc = dtmp; } break; case 2: { FOUR_BYTE_INT nr, nc; if (! is.read (&nr, 4)) goto data_read_error; if (swap) swap_4_bytes ((char *) &nr); if (! is.read (&nc, 4)) goto data_read_error; if (swap) swap_4_bytes ((char *) &nc); if (! is.read (&tmp, 1)) goto data_read_error; Matrix m (nr, nc); double *re = m.fortran_vec (); int len = nr * nc; read_doubles (is, re, (save_type) tmp, len, swap, fmt); if (error_state || ! is) goto data_read_error; tc = m; } break; case 3: { if (! is.read (&tmp, 1)) goto data_read_error; Complex ctmp; read_doubles (is, (double *) &ctmp, (save_type) tmp, 2, swap, fmt); if (error_state || ! is) goto data_read_error; tc = ctmp; } break; case 4: { FOUR_BYTE_INT nr, nc; if (! is.read (&nr, 4)) goto data_read_error; if (swap) swap_4_bytes ((char *) &nr); if (! is.read (&nc, 4)) goto data_read_error; if (swap) swap_4_bytes ((char *) &nc); if (! is.read (&tmp, 1)) goto data_read_error; ComplexMatrix m (nr, nc); Complex *im = m.fortran_vec (); int len = nr * nc; read_doubles (is, (double *) im, (save_type) tmp, 2*len, swap, fmt); if (error_state || ! is) goto data_read_error; tc = m; } break; case 5: { int nr = tc.rows (); int nc = tc.columns (); FOUR_BYTE_INT len = nr * nc; if (! is.read (&len, 4)) goto data_read_error; if (swap) swap_4_bytes ((char *) &len); char *s = new char [len+1]; if (! is.read (s, len)) { delete [] s; goto data_read_error; } s[len] = '\0'; tc = s; } break; case 6: { if (! is.read (&tmp, 1)) goto data_read_error; double bas, lim, inc; if (! is.read (&bas, 8)) goto data_read_error; if (swap) swap_8_bytes ((char *) &bas); if (! is.read (&lim, 8)) goto data_read_error; if (swap) swap_8_bytes ((char *) &lim); if (! is.read (&inc, 8)) goto data_read_error; if (swap) swap_8_bytes ((char *) &inc); Range r (bas, lim, inc); tc = r; } break; default: data_read_error: error ("load: trouble reading binary file `%s'", filename); delete [] name; name = 0; break; } return name; } // Read LEN elements of data from IS in the format specified by // PRECISION, placing the result in DATA. If SWAP is nonzero, swap // the bytes of each element before copying to DATA. FLT_FMT // specifies the format of the data if we are reading floating point // numbers. static void read_mat_binary_data (istream& is, double *data, int precision, int len, int swap, floating_point_format flt_fmt) { switch (precision) { case 0: read_doubles (is, data, LS_DOUBLE, len, swap, flt_fmt); break; case 1: read_doubles (is, data, LS_FLOAT, len, swap, flt_fmt); break; case 2: read_doubles (is, data, LS_INT, len, swap, flt_fmt); break; case 3: read_doubles (is, data, LS_SHORT, len, swap, flt_fmt); break; case 4: read_doubles (is, data, LS_U_SHORT, len, swap, flt_fmt); break; case 5: read_doubles (is, data, LS_U_CHAR, len, swap, flt_fmt); break; default: break; } } static int read_mat_file_header (istream& is, int& swap, FOUR_BYTE_INT& mopt, FOUR_BYTE_INT& nr, FOUR_BYTE_INT& nc, FOUR_BYTE_INT& imag, FOUR_BYTE_INT& len, int quiet = 0) { swap = 0; // We expect to fail here, at the beginning of a record, so not being // able to read another mopt value should not result in an error. is.read (&mopt, 4); if (! is) return 1; if (! is.read (&nr, 4)) goto data_read_error; if (! is.read (&nc, 4)) goto data_read_error; if (! is.read (&imag, 4)) goto data_read_error; if (! is.read (&len, 4)) goto data_read_error; // If mopt is nonzero and the byte order is swapped, mopt will be // bigger than we expect, so we swap bytes. // // If mopt is zero, it means the file was written on a little endian // machine, and we only need to swap if we are running on a big endian // machine. // // Gag me. #if defined (WORDS_BIGENDIAN) if (mopt == 0) swap = 1; #endif // mopt is signed, therefore byte swap may result in negative value. if (mopt > 9999 || mopt < 0) swap = 1; if (swap) { swap_4_bytes ((char *) &mopt); swap_4_bytes ((char *) &nr); swap_4_bytes ((char *) &nc); swap_4_bytes ((char *) &imag); swap_4_bytes ((char *) &len); } if (mopt > 9999 || mopt < 0 || imag > 1 || imag < 0) { if (! quiet) error ("load: can't read binary file"); return -1; } return 0; data_read_error: return -1; } // We don't just use a cast here, because we need to be able to detect // possible errors. static floating_point_format get_floating_point_format (int mach) { floating_point_format flt_fmt = LS_UNKNOWN_FLT_FMT; switch (mach) { case 0: flt_fmt = LS_IEEE_LITTLE; break; case 1: flt_fmt = LS_IEEE_BIG; break; case 2: flt_fmt = LS_VAX_D; break; case 3: flt_fmt = LS_VAX_G; break; case 4: flt_fmt = LS_CRAY; break; default: flt_fmt = LS_UNKNOWN_FLT_FMT; break; } return flt_fmt; } // Extract one value (scalar, matrix, string, etc.) from stream IS and // place it in TC, returning the name of the variable. // // The data is expected to be in Matlab's .mat format, though not all // the features of that format are supported. // // FILENAME is used for error messages. // // This format provides no way to tag the data as global. static char * read_mat_binary_data (istream& is, const char *filename, tree_constant& tc) { // These are initialized here instead of closer to where they are // first used to avoid errors from gcc about goto crossing // initialization of variable. Matrix re; floating_point_format flt_fmt = LS_UNKNOWN_FLT_FMT; char *name = 0; int swap = 0, type = 0, prec = 0, mach = 0, dlen = 0; FOUR_BYTE_INT mopt, nr, nc, imag, len; int err = read_mat_file_header (is, swap, mopt, nr, nc, imag, len); if (err) { if (err < 0) goto data_read_error; else return 0; } type = mopt % 10; // Full, sparse, etc. mopt /= 10; // Eliminate first digit. prec = mopt % 10; // double, float, int, etc. mopt /= 100; // Skip unused third digit too. mach = mopt % 10; // IEEE, VAX, etc. flt_fmt = get_floating_point_format (mach); if (flt_fmt == LS_UNKNOWN_FLT_FMT) { error ("load: unrecognized binary format!"); return 0; } if (type != 0 && type != 1) { error ("load: can't read sparse matrices"); return 0; } if (imag && type == 1) { error ("load: encountered complex matrix with string flag set!"); return 0; } name = new char [len]; if (! is.read (name, len)) goto data_read_error; dlen = nr * nc; if (dlen < 0) goto data_read_error; re.resize (nr, nc); read_mat_binary_data (is, re.fortran_vec (), prec, dlen, swap, flt_fmt); if (! is || error_state) { error ("load: reading matrix data for `%s'", name); goto data_read_error; } if (imag) { Matrix im (nr, nc); read_mat_binary_data (is, im.fortran_vec (), prec, dlen, swap, flt_fmt); if (! is || error_state) { error ("load: reading imaginary matrix data for `%s'", name); goto data_read_error; } ComplexMatrix ctmp (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) ctmp.elem (i, j) = Complex (re.elem (i, j), im.elem (i, j)); tc = ctmp; } else tc = re; if (type == 1) tc = tc.convert_to_str (); return name; data_read_error: error ("load: trouble reading binary file `%s'", filename); delete [] name; return 0; } // Return nonzero if NAME matches one of the given globbing PATTERNS. static int matches_patterns (char **patterns, int num_pat, char *name) { while (num_pat-- > 0) { if (fnmatch (*patterns++, name, __FNM_FLAGS) == 0) return 1; } return 0; } static int read_binary_file_header (istream& is, int& swap, floating_point_format& flt_fmt, int quiet = 0) { int magic_len = 10; char magic [magic_len+1]; is.read (magic, magic_len); magic[magic_len] = '\0'; if (strncmp (magic, "Octave-1-L", magic_len) == 0) { #if defined (WORDS_BIGENDIAN) swap = 1; #else swap = 0; #endif } else if (strncmp (magic, "Octave-1-B", magic_len) == 0) { #if defined (WORDS_BIGENDIAN) swap = 0; #else swap = 1; #endif } else { if (! quiet) error ("load: can't read binary file"); return -1; } char tmp = 0; is.read (&tmp, 1); flt_fmt = get_floating_point_format (tmp); if (flt_fmt == LS_UNKNOWN_FLT_FMT) { if (! quiet) error ("load: unrecognized binary format!"); return -1; } return 0; } static load_save_format get_file_format (const char *fname, const char *orig_fname) { load_save_format retval = LS_UNKNOWN; ifstream file (fname); if (! file) { error ("load: couldn't open input file `%s'", orig_fname); return retval; } int swap; floating_point_format flt_fmt = LS_UNKNOWN_FLT_FMT; if (read_binary_file_header (file, swap, flt_fmt, 1) == 0) retval = LS_BINARY; else { file.seekg (0, ios::beg); FOUR_BYTE_INT mopt, nr, nc, imag, len; int swap; if (read_mat_file_header (file, swap, mopt, nr, nc, imag, len, 1) == 0) retval = LS_MAT_BINARY; else { file.seekg (0, ios::beg); char *tmp = extract_keyword (file, "name"); if (tmp) retval = LS_ASCII; delete [] tmp; } } file.close (); if (retval == LS_UNKNOWN) error ("load: unable to determine file format for `%s'", orig_fname); return retval; } static Octave_object do_load (istream& stream, const char *orig_fname, int force, load_save_format format, floating_point_format flt_fmt, int list_only, int swap, int verbose, char **argv, int argc, int nargout) { Octave_object retval; ostrstream output_buf; int count = 0; for (;;) { int global = 0; tree_constant tc; char *name = 0; char *doc = 0; switch (format) { case LS_ASCII: name = read_ascii_data (stream, orig_fname, global, tc); break; case LS_BINARY: name = read_binary_data (stream, swap, flt_fmt, orig_fname, global, tc, doc); break; case LS_MAT_BINARY: name = read_mat_binary_data (stream, orig_fname, tc); break; default: gripe_unrecognized_data_fmt ("load"); break; } if (error_state || stream.eof () || ! name) { delete [] name; delete [] doc; break; } else if (! error_state && name) { if (tc.is_defined ()) { if (argc == 0 || matches_patterns (argv, argc, name)) { count++; if (list_only) { if (verbose) { if (count == 1) output_buf << "type rows cols name\n" << "==== ==== ==== ====\n"; output_buf.form ("%-16s", tc.type_as_string ()); output_buf.form ("%7d", tc.rows ()); output_buf.form ("%7d", tc.columns ()); output_buf << " "; } output_buf << name << "\n"; } else { install_loaded_variable (force, name, tc, global, doc); } } } else error ("load: unable to load variable `%s'", name); } else { if (count == 0) error ("load: are you sure `%s' is an Octave data file?", orig_fname); delete [] name; delete [] doc; break; } delete [] name; delete [] doc; } if (list_only && count) { if (nargout > 0) { output_buf << ends; char *msg = output_buf.str (); retval = msg; delete [] msg; } else maybe_page_output (output_buf); } return retval; } DEFUN_TEXT ("load", Fload, Sload, -1, 1, "load [-force] [-ascii] [-binary] [-mat-binary] file [pattern ...]\n\ \n\ Load variables from a file.\n\ \n\ If no argument is supplied to select a format, load tries to read the named file as an Octave binary, then as a .mat file, and then as an Octave text file.\n\ \n\ If the option -force is given, variables with the same names as those found in the file will be replaced with the values read from the file.") { Octave_object retval; DEFINE_ARGV ("load"); argc--; argv++; int force = 0; // It isn't necessary to have the default load format stored in a user // preference variable since we can determine the type of file as we // are reading. load_save_format format = LS_UNKNOWN; int list_only = 0; int verbose = 0; while (argc > 0) { if (strcmp (*argv, "-force") == 0 || strcmp (*argv, "-f") == 0) { force++; argc--; argv++; } else if (strcmp (*argv, "-list") == 0 || strcmp (*argv, "-l") == 0) { list_only = 1; argc--; argv++; } else if (strcmp (*argv, "-verbose") == 0 || strcmp (*argv, "-v") == 0) { verbose = 1; argc--; argv++; } else if (strcmp (*argv, "-ascii") == 0 || strcmp (*argv, "-a") == 0) { format = LS_ASCII; argc--; argv++; } else if (strcmp (*argv, "-binary") == 0 || strcmp (*argv, "-b") == 0) { format = LS_BINARY; argc--; argv++; } else if (strcmp (*argv, "-mat-binary") == 0 || strcmp (*argv, "-m") == 0) { format = LS_MAT_BINARY; argc--; argv++; } else break; } if (argc < 1) { error ("load: you must specify a single file to read"); DELETE_ARGV; return retval; } char *orig_fname = *argv; floating_point_format flt_fmt = LS_UNKNOWN_FLT_FMT; int swap = 0; if (strcmp (*argv, "-") == 0) { argc--; argv++; if (format != LS_UNKNOWN) { // XXX FIXME XXX -- if we have already seen EOF on a previous call, // how do we fix up the state of cin so that we can get additional // input? I'm afraid that we can't fix this using cin only. retval = do_load (cin, orig_fname, force, format, flt_fmt, list_only, swap, verbose, argv, argc, nargout); } else error ("load: must specify file format if reading from stdin"); } else { char *fname = tilde_expand (*argv); if (format == LS_UNKNOWN) format = get_file_format (fname, orig_fname); if (format != LS_UNKNOWN) { argv++; argc--; unsigned mode = ios::in; if (format == LS_BINARY || format == LS_MAT_BINARY) mode |= ios::bin; ifstream file (fname, mode); if (file) { if (format == LS_BINARY) { if (read_binary_file_header (file, swap, flt_fmt) < 0) { file.close (); DELETE_ARGV; return retval; } } retval = do_load (file, orig_fname, force, format, flt_fmt, list_only, swap, verbose, argv, argc, nargout); file.close (); } else error ("load: couldn't open input file `%s'", orig_fname); } } DELETE_ARGV; return retval; } // Return nonzero if PATTERN has any special globbing chars in it. static int glob_pattern_p (char *pattern) { char *p = pattern; char c; int open = 0; while ((c = *p++) != '\0') { switch (c) { case '?': case '*': return 1; case '[': // Only accept an open brace if there is a close open++; // brace to match it. Bracket expressions must be continue; // complete, according to Posix.2 case ']': if (open) return 1; continue; case '\\': if (*p++ == '\0') return 0; default: continue; } } return 0; } // MAX_VAL and MIN_VAL are assumed to have integral values even though // they are stored in doubles. static save_type get_save_type (double max_val, double min_val) { save_type st = LS_DOUBLE; if (max_val < 256 && min_val > -1) st = LS_U_CHAR; else if (max_val < 65536 && min_val > -1) st = LS_U_SHORT; else if (max_val < 4294967295 && min_val > -1) st = LS_U_INT; else if (max_val < 128 && min_val >= -128) st = LS_CHAR; else if (max_val < 32768 && min_val >= -32768) st = LS_SHORT; else if (max_val < 2147483648 && min_val > -2147483648) st = LS_INT; return st; } // Save the data from TC along with the corresponding NAME, help // string DOC, and global flag MARK_AS_GLOBAL on stream OS in the // binary format described above for load_binary_data. static int save_binary_data (ostream& os, const tree_constant& tc, char *name, char *doc, int mark_as_global, int save_as_floats) { int fail = 0; FOUR_BYTE_INT name_len = 0; if (name) name_len = strlen (name); os.write (&name_len, 4); os.write (name, name_len); FOUR_BYTE_INT doc_len = 0; if (doc) doc_len = strlen (doc); os.write (&doc_len, 4); os.write (doc, doc_len); char tmp; tmp = mark_as_global; os.write (&tmp, 1); if (tc.is_real_scalar ()) { tmp = 1; os.write (&tmp, 1); tmp = (char) LS_DOUBLE; os.write (&tmp, 1); double tmp = tc.double_value (); os.write (&tmp, 8); } else if (tc.is_real_matrix ()) { tmp = 2; os.write (&tmp, 1); Matrix m = tc.matrix_value (); FOUR_BYTE_INT nr = m.rows (); FOUR_BYTE_INT nc = m.columns (); os.write (&nr, 4); os.write (&nc, 4); int len = nr * nc; save_type st = LS_DOUBLE; if (save_as_floats) { if (too_large_for_float (m)) { warning ("save: some values too large to save as floats --"); warning ("save: saving as doubles instead"); } else st = LS_FLOAT; } else if (len > 8192) // XXX FIXME XXX -- make this configurable. { double max_val, min_val; if (all_parts_int (m, max_val, min_val)) st = get_save_type (max_val, min_val); } const double *mtmp = m.data (); write_doubles (os, mtmp, st, len); } else if (tc.is_complex_scalar ()) { tmp = 3; os.write (&tmp, 1); tmp = (char) LS_DOUBLE; os.write (&tmp, 1); Complex tmp = tc.complex_value (); os.write (&tmp, 16); } else if (tc.is_complex_matrix ()) { tmp = 4; os.write (&tmp, 1); ComplexMatrix m = tc.complex_matrix_value (); FOUR_BYTE_INT nr = m.rows (); FOUR_BYTE_INT nc = m.columns (); os.write (&nr, 4); os.write (&nc, 4); int len = nr * nc; save_type st = LS_DOUBLE; if (save_as_floats) { if (too_large_for_float (m)) { warning ("save: some values too large to save as floats --"); warning ("save: saving as doubles instead"); } else st = LS_FLOAT; } else if (len > 4096) // XXX FIXME XXX -- make this configurable. { double max_val, min_val; if (all_parts_int (m, max_val, min_val)) st = get_save_type (max_val, min_val); } const Complex *mtmp = m.data (); write_doubles (os, (const double *) mtmp, st, 2*len); } else if (tc.is_string ()) { tmp = 5; os.write (&tmp, 1); int nr = tc.rows (); int nc = tc.columns (); FOUR_BYTE_INT len = nr * nc; os.write (&len, 4); char *s = tc.string_value (); os.write (s, len); } else if (tc.is_range ()) { tmp = 6; os.write (&tmp, 1); tmp = (char) LS_DOUBLE; os.write (&tmp, 1); Range r = tc.range_value (); double bas = r.base (); double lim = r.limit (); double inc = r.inc (); os.write (&bas, 8); os.write (&lim, 8); os.write (&inc, 8); } else { gripe_wrong_type_arg ("save", tc); fail = 1; } return (os && ! fail); } // Save the data from TC along with the corresponding NAME on stream OS // in the MatLab binary format. static int save_mat_binary_data (ostream& os, const tree_constant& tc, char *name) { int fail = 0; FOUR_BYTE_INT mopt = 0; mopt += tc.is_string () ? 1 : 0; mopt += 1000 * get_floating_point_format (NATIVE_FLOAT_FORMAT); os.write (&mopt, 4); FOUR_BYTE_INT nr = tc.rows (); os.write (&nr, 4); FOUR_BYTE_INT nc = tc.columns (); os.write (&nc, 4); int len = nr * nc; FOUR_BYTE_INT imag = tc.is_complex_type () ? 1 : 0; os.write (&imag, 4); FOUR_BYTE_INT name_len = name ? strlen (name) + 1 : 0; os.write (&name_len, 4); os.write (name, name_len); if (tc.is_real_scalar ()) { double tmp = tc.double_value (); os.write (&tmp, 8); } else if (tc.is_real_matrix ()) { Matrix m = tc.matrix_value (); os.write (m.data (), 8 * len); } else if (tc.is_complex_scalar ()) { Complex tmp = tc.complex_value (); os.write (&tmp, 16); } else if (tc.is_complex_matrix ()) { ComplexMatrix m_cmplx = tc.complex_matrix_value (); Matrix m = ::real(m_cmplx); os.write (m.data (), 8 * len); m = ::imag(m_cmplx); os.write (m.data (), 8 * len); } else if (tc.is_string ()) { begin_unwind_frame ("save_mat_binary_data"); unwind_protect_int (user_pref.implicit_str_to_num_ok); user_pref.implicit_str_to_num_ok = 1; Matrix m = tc.matrix_value (); os.write (m.data (), 8 * len); run_unwind_frame ("save_mat_binary_data"); } else if (tc.is_range ()) { Range r = tc.range_value (); double base = r.base (); double inc = r.inc (); int nel = r.nelem (); for (int i = 0; i < nel; i++) { double x = base + i * inc; os.write (&x, 8); } } else { gripe_wrong_type_arg ("save", tc); fail = 1; } return (os && ! fail); } static void ascii_save_type (ostream& os, char *type, int mark_as_global) { if (mark_as_global) os << "# type: global "; else os << "# type: "; os << type << "\n"; } static Matrix strip_infnan (const Matrix& m) { int nr = m.rows (); int nc = m.columns (); Matrix retval (nr, nc); int k = 0; for (int i = 0; i < nr; i++) { for (int j = 0; j < nc; j++) { double d = m.elem (i, j); if (xisnan (d)) goto next_row; else retval.elem (k, j) = xisinf (d) ? (d > 0 ? OCT_RBV : -OCT_RBV) : d; } k++; next_row: continue; } if (k > 0) retval.resize (k, nc); return retval; } static ComplexMatrix strip_infnan (const ComplexMatrix& m) { int nr = m.rows (); int nc = m.columns (); ComplexMatrix retval (nr, nc); int k = 0; for (int i = 0; i < nr; i++) { for (int j = 0; j < nc; j++) { Complex c = m.elem (i, j); if (xisnan (c)) goto next_row; else { double re = real (c); double im = imag (c); re = xisinf (re) ? (re > 0 ? OCT_RBV : -OCT_RBV) : re; im = xisinf (im) ? (im > 0 ? OCT_RBV : -OCT_RBV) : im; retval.elem (k, j) = Complex (re, im); } } k++; next_row: continue; } if (k > 0) retval.resize (k, nc); return retval; } // Save the data from TC along with the corresponding NAME, and global // flag MARK_AS_GLOBAL on stream OS in the plain text format described // above for load_ascii_data. If NAME is null, the name: line is not // generated. PRECISION specifies the number of decimal digits to print. // If STRIP_NAN_AND_INF is nonzero, rows containing NaNs are deleted, // and Infinite values are converted to +/-OCT_RBV (A Real Big Value, // but not so big that gnuplot can't handle it when trying to compute // axis ranges, etc.). // // Assumes ranges and strings cannot contain Inf or NaN values. // // Returns 1 for success and 0 for failure. // XXX FIXME XXX -- should probably write the help string here too. int save_ascii_data (ostream& os, const tree_constant& tc, char *name, int strip_nan_and_inf, int mark_as_global, int precision) { int success = 1; if (! precision) precision = user_pref.save_precision; if (name) os << "# name: " << name << "\n"; long old_precision = os.precision (); os.precision (precision); if (tc.is_real_scalar ()) { ascii_save_type (os, "scalar", mark_as_global); double d = tc.double_value (); if (strip_nan_and_inf) { if (xisnan (d)) { error ("only value to plot is NaN"); success = 0; } else { d = xisinf (d) ? (d > 0 ? OCT_RBV : -OCT_RBV) : d; os << d << "\n"; } } else os << d << "\n"; } else if (tc.is_real_matrix ()) { ascii_save_type (os, "matrix", mark_as_global); os << "# rows: " << tc.rows () << "\n" << "# columns: " << tc.columns () << "\n"; Matrix tmp = tc.matrix_value (); if (strip_nan_and_inf) tmp = strip_infnan (tmp); os << tmp; } else if (tc.is_complex_scalar ()) { ascii_save_type (os, "complex scalar", mark_as_global); Complex c = tc.complex_value (); if (strip_nan_and_inf) { if (xisnan (c)) { error ("only value to plot is NaN"); success = 0; } else { double re = real (c); double im = imag (c); re = xisinf (re) ? (re > 0 ? OCT_RBV : -OCT_RBV) : re; im = xisinf (im) ? (im > 0 ? OCT_RBV : -OCT_RBV) : im; c = Complex (re, im); os << c << "\n"; } } else os << c << "\n"; } else if (tc.is_complex_matrix ()) { ascii_save_type (os, "complex matrix", mark_as_global); os << "# rows: " << tc.rows () << "\n" << "# columns: " << tc.columns () << "\n"; ComplexMatrix tmp = tc.complex_matrix_value (); if (strip_nan_and_inf) tmp = strip_infnan (tmp); os << tmp; } else if (tc.is_string ()) { ascii_save_type (os, "string", mark_as_global); char *tmp = tc.string_value (); os << "# length: " << strlen (tmp) << "\n" << tmp << "\n"; } else if (tc.is_range ()) { ascii_save_type (os, "range", mark_as_global); Range tmp = tc.range_value (); os << "# base, limit, increment\n" << tmp.base () << " " << tmp.limit () << " " << tmp.inc () << "\n"; } else { gripe_wrong_type_arg ("save", tc); success = 0; } os.precision (old_precision); return (os && success); } // Save the info from sr on stream os in the format specified by fmt. static void do_save (ostream& os, symbol_record *sr, load_save_format fmt, int save_as_floats) { if (! sr->is_variable ()) { error ("save: can only save variables, not functions"); return; } char *name = sr->name (); char *help = sr->help (); int global = sr->is_linked_to_global (); tree_constant tc = *((tree_constant *) sr->def ()); if (! name || ! tc.is_defined ()) return; switch (fmt) { case LS_ASCII: save_ascii_data (os, tc, name, 0, global); break; case LS_BINARY: save_binary_data (os, tc, name, help, global, save_as_floats); break; case LS_MAT_BINARY: save_mat_binary_data (os, tc, name); break; default: gripe_unrecognized_data_fmt ("save"); break; } } // Save variables with names matching PATTERN on stream OS in the // format specified by FMT. If SAVE_BUILTINS is nonzero, also save // builtin variables with names that match PATTERN. static int save_vars (ostream& os, char *pattern, int save_builtins, load_save_format fmt, int save_as_floats) { int count; symbol_record **vars = curr_sym_tab->glob (count, pattern, symbol_def::USER_VARIABLE, SYMTAB_ALL_SCOPES); int saved = count; int i; for (i = 0; i < count; i++) { do_save (os, vars[i], fmt, save_as_floats); if (error_state) break; } delete [] vars; if (! error_state && save_builtins) { symbol_record **vars = global_sym_tab->glob (count, pattern, symbol_def::BUILTIN_VARIABLE, SYMTAB_ALL_SCOPES); saved += count; for (i = 0; i < count; i++) { do_save (os, vars[i], fmt, save_as_floats); if (error_state) break; } delete [] vars; } return saved; } static load_save_format get_default_save_format (void) { load_save_format retval = LS_ASCII; char *fmt = user_pref.default_save_format; if (strcasecmp (fmt, "binary") == 0) retval = LS_BINARY; else if (strcasecmp (fmt, "mat-binary") == 0 || strcasecmp (fmt, "mat_binary") == 0) retval = LS_MAT_BINARY; return retval; } static void write_binary_header (ostream& stream, load_save_format format) { if (format == LS_BINARY) { #if defined (WORDS_BIGENDIAN) stream << "Octave-1-B"; #else stream << "Octave-1-L"; #endif char tmp = (char) NATIVE_FLOAT_FORMAT; stream.write (&tmp, 1); } } static void save_vars (char **argv, int argc, ostream& os, int save_builtins, load_save_format fmt, int save_as_floats) { write_binary_header (os, fmt); if (argc == 0) { save_vars (os, "*", save_builtins, fmt, save_as_floats); } else { while (argc-- > 0) { if (! save_vars (os, *argv, save_builtins, fmt, save_as_floats)) { warning ("save: no such variable `%s'", *argv); } argv++; } } } DEFUN_TEXT ("save", Fsave, Ssave, -1, 1, "save [-ascii] [-binary] [-float-binary] [-mat-binary] \n\ [-save-builtins] file [pattern ...]\n\ \n\ save variables in a file") { Octave_object retval; DEFINE_ARGV ("save"); argc--; argv++; // Here is where we would get the default save format if it were // stored in a user preference variable. int save_builtins = 0; int save_as_floats = 0; load_save_format format = get_default_save_format (); while (argc > 0) { if (strcmp (*argv, "-ascii") == 0 || strcmp (*argv, "-a") == 0) { format = LS_ASCII; argc--; argv++; } else if (strcmp (*argv, "-binary") == 0 || strcmp (*argv, "-b") == 0) { format = LS_BINARY; argc--; argv++; } else if (strcmp (*argv, "-mat-binary") == 0 || strcmp (*argv, "-m") == 0) { format = LS_MAT_BINARY; argc--; argv++; } else if (strcmp (*argv, "-float-binary") == 0 || strcmp (*argv, "-f") == 0) { format = LS_BINARY; save_as_floats = 1; argc--; argv++; } else if (strcmp (*argv, "-save-builtins") == 0) { save_builtins = 1; argc--; argv++; } else break; } if (argc < 1) { print_usage ("save"); DELETE_ARGV; return retval; } if (save_as_floats && format == LS_ASCII) { error ("save: cannot specify both -ascii and -float-binary"); DELETE_ARGV; return retval; } if (strcmp (*argv, "-") == 0) { argc--; argv++; // XXX FIXME XXX -- should things intended for the screen end up in a // tree_constant (string)? save_vars (argv, argc, cout, save_builtins, format, save_as_floats); } else if (argc == 1 && glob_pattern_p (*argv)) // Guard against things { // like `save a*', print_usage ("save"); // which are probably DELETE_ARGV; // mistakes... return retval; } else { char *fname = tilde_expand (*argv); argc--; argv++; unsigned mode = ios::out|ios::trunc; if (format == LS_BINARY || format == LS_MAT_BINARY) mode |= ios::bin; ofstream file (fname, mode); if (file) { save_vars (argv, argc, file, save_builtins, format, save_as_floats); } else { error ("save: couldn't open output file `%s'", *argv); DELETE_ARGV; return retval; } } DELETE_ARGV; return retval; } // Maybe this should be a static function in tree-plot.cc? // If TC is matrix, save it on stream OS in a format useful for // making a 3-dimensional plot with gnuplot. If PARAMETRIC is // nonzero, assume a parametric 3-dimensional plot will be generated. int save_three_d (ostream& os, const tree_constant& tc, int parametric) { int fail = 0; int nr = tc.rows (); int nc = tc.columns (); if (tc.is_real_matrix ()) { os << "# 3D data...\n" << "# type: matrix\n" << "# total rows: " << nr << "\n" << "# total columns: " << nc << "\n"; if (parametric) { int extras = nc % 3; if (extras) warning ("ignoring last %d columns", extras); Matrix tmp = tc.matrix_value (); tmp = strip_infnan (tmp); nr = tmp.rows (); for (int i = 0; i < nc-extras; i += 3) { os << tmp.extract (0, i, nr-1, i+2); if (i+3 < nc-extras) os << "\n"; } } else { Matrix tmp = tc.matrix_value (); tmp = strip_infnan (tmp); nr = tmp.rows (); for (int i = 0; i < nc; i++) { os << tmp.extract (0, i, nr-1, i); if (i+1 < nc) os << "\n"; } } } else { ::error ("for now, I can only save real matrices in 3D format"); fail = 1; } return (os && ! fail); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/mappers.cc100666 415 17 21777 5702416071 13744 0ustar jweusers// mappers.cc -*- C++ -*- /* Copyright (C) 1992, 1993 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include "missing-math.h" #include "variables.h" #include "mappers.h" #include "error.h" #include "utils.h" #include "defun.h" #if defined (_AIX) && defined (__GNUG__) #undef finite #define finite(x) ((x) < DBL_MAX && (x) > -DBL_MAX) #endif #ifndef M_LOG10E #define M_LOG10E 0.43429448190325182765 #endif #ifndef M_PI #define M_PI 3.14159265358979323846 #endif #if defined (HAVE_LGAMMA) && ! defined (SIGNGAM_DECLARED) extern int signgam; #endif // Double -> double mappers. double arg (double x) { if (x < 0.0) return M_PI; else return 0.0; } double conj (double x) { return x; } double fix (double x) { int tmp; tmp = (int) x; return (double) tmp; } double imag (double x) { return 0.0; } double real (double x) { return x; } double round (double x) { return D_NINT (x); } double signum (double x) { double tmp = 0.0; if (x < 0.0) tmp = -1.0; else if (x > 0.0) tmp = 1.0; return tmp; } double xerf (double x) { #if defined (HAVE_ERF) return erf (x); #else error ("erf(x) not available on this system"); #endif } double xerfc (double x) { #if defined (HAVE_ERFC) return erfc (x); #else error ("erfc(x) not available on this system"); #endif } double xisnan (double x) { #if defined (HAVE_ISNAN) return (double) isnan (x); #else return 0; #endif } double xfinite (double x) { #if defined (HAVE_FINITE) return (double) finite (x); #elif defined (HAVE_ISINF) && defined (HAVE_ISNAN) return (double) (! isinf (x) && ! isnan (x)); #else return (double) (x > -DBL_MAX && x < DBL_MAX); #endif } double xgamma (double x) { #if defined (HAVE_LGAMMA) double y = lgamma (x); return signgam * exp (y); #else error ("gamma(x) not available on this system"); #endif } double xisinf (double x) { #if defined (HAVE_ISINF) return (double) isinf (x); #elif defined (HAVE_FINITE) && defined (HAVE_ISNAN) return (double) (! (finite (x) || isnan (x))); #else return (double) (x == DBL_MAX || x == -DBL_MAX); #endif } double xlgamma (double x) { #if defined (HAVE_LGAMMA) return lgamma (x); #else error ("lgamma (x) not available on this system"); #endif } // Complex -> double mappers. double xisnan (const Complex& x) { #if defined (HAVE_ISNAN) double rx = real (x); double ix = imag (x); return (double) (isnan (rx) || isnan (ix)); #else return 0; #endif } double xfinite (const Complex& x) { double rx = real (x); double ix = imag (x); return (double) (! ((int) xisinf (rx) || (int) xisinf (ix))); } double xisinf (const Complex& x) { return (double) (! (int) xfinite (x)); } // Complex -> complex mappers. Complex acos (const Complex& x) { static Complex i (0, 1); Complex retval = -i * log (x + sqrt (x*x - 1.0)); return retval; } Complex acosh (const Complex& x) { Complex retval = log (x + sqrt (x*x - 1.0)); return retval; } Complex asin (const Complex& x) { static Complex i (0, 1); Complex retval = -i * log (i*x + sqrt (1.0 - x*x)); return retval; } Complex asinh (const Complex& x) { Complex retval = log (x + sqrt (x*x + 1.0)); return retval; } Complex atan (const Complex& x) { static Complex i (0, 1); Complex retval = i * log ((i + x) / (i - x)) / 2.0; return retval; } Complex atanh (const Complex& x) { static Complex i (0, 1); Complex retval = log ((1 + x) / (1 - x)) / 2.0; return retval; } Complex ceil (const Complex& x) { int re = (int) ceil (real (x)); int im = (int) ceil (imag (x)); return Complex (re, im); } Complex fix (const Complex& x) { int re = (int) real (x); int im = (int) imag (x); return Complex (re, im); } Complex floor (const Complex& x) { int re = (int) floor (real (x)); int im = (int) floor (imag (x)); return Complex (re, im); } Complex log10 (const Complex& x) { return M_LOG10E * log (x); } Complex round (const Complex& x) { double re = D_NINT (real (x)); double im = D_NINT (imag (x)); return Complex (re, im); } Complex signum (const Complex& x) { return x / abs (x); } Complex tan (const Complex& x) { Complex retval = sin (x) / cos (x); return retval; } Complex tanh (const Complex& x) { Complex retval = sinh (x) / cosh (x); return retval; } void install_mapper_functions (void) { DEFUN_MAPPER ("abs", Sabs, 0, 0.0, 0.0, fabs, abs, 0, "abs (X): compute abs (X) for each element of X"); DEFUN_MAPPER ("acos", Sacos, 1, -1.0, 1.0, acos, 0, acos, "acos (X): compute acos (X) for each element of X"); DEFUN_MAPPER ("acosh", Sacosh, 1, 1.0, DBL_MAX, acosh, 0, acosh, "acosh (X): compute acosh (X) for each element of X"); DEFUN_MAPPER ("angle", Sangle, 0, 0.0, 0.0, arg, arg, 0, "angle (X): compute arg (X) for each element of X"); DEFUN_MAPPER ("arg", Sarg, 0, 0.0, 0.0, arg, arg, 0, "arg (X): compute arg (X) for each element of X"); DEFUN_MAPPER ("asin", Sasin, 1, -1.0, 1.0, asin, 0, asin, "asin (X): compute asin (X) for each element of X"); DEFUN_MAPPER ("asinh", Sasinh, 0, 0.0, 0.0, asinh, 0, asinh, "asinh (X): compute asinh (X) for each element of X"); DEFUN_MAPPER ("atan", Satan, 0, 0.0, 0.0, atan, 0, atan, "atan (X): compute atan (X) for each element of X"); DEFUN_MAPPER ("atanh", Satanh, 1, -1.0, 1.0, atanh, 0, atanh, "atanh (X): compute atanh (X) for each element of X"); DEFUN_MAPPER ("ceil", Sceil, 0, 0.0, 0.0, ceil, 0, ceil, "ceil (X): round elements of X toward +Inf"); DEFUN_MAPPER ("conj", Sconj, 0, 0.0, 0.0, conj, 0, conj, "conj (X): compute complex conjugate for each element of X"); DEFUN_MAPPER ("cos", Scos, 0, 0.0, 0.0, cos, 0, cos, "cos (X): compute cos (X) for each element of X"); DEFUN_MAPPER ("cosh", Scosh, 0, 0.0, 0.0, cosh, 0, cosh, "cosh (X): compute cosh (X) for each element of X"); DEFUN_MAPPER ("erf", Serf, 0, 0.0, 0.0, xerf, 0, 0, "erf (X): compute erf (X) for each element of X"); DEFUN_MAPPER ("erfc", Serfc, 0, 0.0, 0.0, xerfc, 0, 0, "erfc (X): compute erfc (X) for each element of X"); DEFUN_MAPPER ("exp", Sexp, 0, 0.0, 0.0, exp, 0, exp, "exp (X): compute exp (X) for each element of X"); DEFUN_MAPPER ("finite", Sfinite, 0, 0.0, 0.0, xfinite, xfinite, 0, "finite (X): return 1 for finite elements of X"); DEFUN_MAPPER ("fix", Sfix, 0, 0.0, 0.0, fix, 0, fix, "fix (X): round elements of X toward zero"); DEFUN_MAPPER ("floor", Sfloor, 0, 0.0, 0.0, floor, 0, floor, "floor (X): round elements of X toward -Inf"); DEFUN_MAPPER ("gamma", Sgamma, 0, 0.0, 0.0, xgamma, 0, 0, "gamma (X): compute gamma (X) for each element of X"); DEFUN_MAPPER ("isinf", Sisinf, 0, 0.0, 0.0, xisinf, xisinf, 0, "isinf (X): return 1 for elements of X infinite"); DEFUN_MAPPER ("imag", Simag, 0, 0.0, 0.0, imag, imag, 0, "imag (X): return imaginary part for each elements of X"); DEFUN_MAPPER ("isnan", Sisnan, 0, 0.0, 0.0, xisnan, xisnan, 0, "isnan (X): return 1 where elements of X are NaNs"); DEFUN_MAPPER ("lgamma", Slgamma, 0, 0.0, 0.0, xlgamma, 0, 0, "lgamma (X): compute log gamma (X) for each element of X"); DEFUN_MAPPER ("log", Slog, 1, 0.0, DBL_MAX, log, 0, log, "log (X): compute log (X) for each element of X"); DEFUN_MAPPER ("log10", Slog10, 1, 0.0, DBL_MAX, log10, 0, log10, "log10 (X): compute log10 (X) for each element of X"); DEFUN_MAPPER ("real", Sreal, 0, 0.0, 0.0, real, real, 0, "real (X): return real part for each element of X"); DEFUN_MAPPER ("round", Sround, 0, 0.0, 0.0, round, 0, round, "round (X): round elements of X to nearest integer"); DEFUN_MAPPER ("sign", Ssign, 0, 0.0, 0.0, signum, 0, signum, "sign (X): apply signum function to elements of X"); DEFUN_MAPPER ("sin", Ssin, 0, 0.0, 0.0, sin, 0, sin, "sin (X): compute sin (X) for each element of X"); DEFUN_MAPPER ("sinh", Ssinh, 0, 0.0, 0.0, sinh, 0, sinh, "sinh (X): compute sinh (X) for each element of X"); DEFUN_MAPPER ("sqrt", Ssqrt, 1, 0.0, DBL_MAX, sqrt, 0, sqrt, "sqrt (X): compute sqrt (X) for each element of X"); DEFUN_MAPPER ("tan", Stan, 0, 0.0, 0.0, tan, 0, tan, "tan (X): compute tan (X) for each element of X"); DEFUN_MAPPER ("tanh", Stanh, 0, 0.0, 0.0, tanh, 0, tanh, "tanh (X): compute tanh (X) for each element of X"); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/octave.cc100666 415 17 51455 5705364234 13560 0ustar jweusers// octave.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Born February 20, 1992. #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include #include #include #include extern "C" { #include } #include "getopt.h" #include "lo-error.h" #include "sighandlers.h" #include "variables.h" #include "error.h" #include "dynamic-ld.h" #include "tree-misc.h" #include "tree-const.h" #include "tree-plot.h" #include "utils.h" #include "input.h" #include "pager.h" #include "lex.h" #include "help.h" #include "octave.h" #include "parse.h" #include "defaults.h" #include "user-prefs.h" #include "procstream.h" #include "unwind-prot.h" #include "octave-hist.h" #include "builtins.h" #include "version.h" #include "file-io.h" #include "sysdep.h" #include "defun.h" #if !defined (HAVE_ATEXIT) && defined (HAVE_ON_EXIT) extern "C" { int on_exit (); } #define atexit on_exit #endif // argv[0] for this program. char *raw_prog_name = 0; // Cleaned-up name of this program, not including path information. char *prog_name = 0; // Login name for user running this program. char *user_name = 0; // Name of the host we are running on. char *host_name = 0; // User's home directory. char *home_directory = 0; // Guess what? char *the_current_working_directory = 0; // Load path specified on command line. (--path path; -p path) char *load_path = 0; // Name of the info file specified on command line. // (--info-file file; -i file) char *info_file = 0; // Name of the editor to be invoked by the edit_history command. char *editor = 0; // If nonzero, don't do fancy line editing. int no_line_editing = 0; // If nonzero, print verbose info in some cases. // (--verbose; -V) int verbose_flag = 0; // Command number, counting from the beginning of this session. int current_command_number = 1; // Nonzero means we are exiting via the builtin exit or quit functions. int quitting_gracefully = 0; // Current command to execute. tree_statement_list *global_command = 0; // Pointer to function that is currently being evaluated. tree_function *curr_function = 0; // Nonzero means input is coming from startup file. int input_from_startup_file = 0; // Top level context (?) jmp_buf toplevel; // This is not really the right place to do this... typedef void (*one_arg_error_handler_t) (const char*); extern one_arg_error_handler_t set_Complex_error_handler (one_arg_error_handler_t f); // This is from readline's paren.c: extern int rl_blink_matching_paren; static void octave_Complex_error_handler (const char* msg) { warning (msg); } // Nonzero means we read ~/.octaverc and ./.octaverc. // (--norc; --ignore-init-file; -f) static int read_init_files = 1; // Nonzero means we printed messages about reading startup files. static int reading_startup_message_printed = 0; // Nonzero means we don\'t print the usual startup message. // (--quiet; --silent; -q) static int inhibit_startup_message = 0; // Usage message static const char *usage_string = "octave [-?Vdfhiqvx] [-p path] [--debug] [--help] [--ignore-init-file]\n\ [--info-file file] [--interactive] [--path path] [--silent]\n\ [--verbose] [--version] [--echo-commands] [file]"; // This is here so that it\'s more likely that the usage message and // the real set of options will agree. static const char *short_opts = "?Vdfhip:qvx"; // Long options. #define INFO_FILE_OPTION 1 static struct option long_opts[] = { { "debug", 0, 0, 'd' }, { "help", 0, 0, 'h' }, { "interactive", 0, 0, 'i' }, { "info-file", 1, 0, INFO_FILE_OPTION }, { "norc", 0, 0, 'f' }, { "ignore-init-file", 0, 0, 'f' }, { "path", 1, 0, 'p' }, { "quiet", 0, 0, 'q' }, { "silent", 0, 0, 'q' }, { "verbose", 0, 0, 'V' }, { "version", 0, 0, 'v' }, { "echo-commands", 0, 0, 'x' }, { 0, 0, 0, 0 } }; // Initialize some global variables for later use. static void initialize_globals (char *name) { struct passwd *entry = getpwuid (getuid ()); if (entry) user_name = strsave (entry->pw_name); else user_name = strsave ("I have no name!"); endpwent (); char hostname[256]; if (gethostname (hostname, 255) < 0) host_name = strsave ("I have no host!"); else host_name = strsave (hostname); char *hd = getenv ("HOME"); if (hd) home_directory = strsave (hd); else home_directory = strsave ("I have no home!"); char *shell_path = getenv ("PATH"); char *arch_dir = octave_arch_lib_dir (); char *bin_dir = octave_bin_dir (); int len = strlen (arch_dir) + strlen (bin_dir) + 7; char *putenv_cmd = 0; if (shell_path) { len += strlen (shell_path) + 1; putenv_cmd = new char [len]; sprintf (putenv_cmd, "PATH=%s:%s:%s", shell_path, arch_dir, bin_dir); } else { putenv_cmd = new char [len]; sprintf (putenv_cmd, "PATH=%s:%s", arch_dir, bin_dir); } putenv (putenv_cmd); raw_prog_name = strsave (name); prog_name = strsave ("octave"); load_path = default_path (); info_file = default_info_file (); editor = default_editor (); } void parse_and_execute (FILE *f, int print) { begin_unwind_frame ("parse_and_execute"); YY_BUFFER_STATE old_buf = current_buffer (); YY_BUFFER_STATE new_buf = create_buffer (f); add_unwind_protect (restore_input_buffer, (void *) old_buf); add_unwind_protect (delete_input_buffer, (void *) new_buf); switch_to_buffer (new_buf); unwind_protect_int (echo_input); unwind_protect_int (using_readline); unwind_protect_int (saving_history); echo_input = 0; using_readline = 0; saving_history = 0; unwind_protect_ptr (curr_sym_tab); int retval; do { reset_parser (); retval = yyparse (); if (retval == 0 && global_command) { global_command->eval (print); delete global_command; } } while (retval == 0); run_unwind_frame ("parse_and_execute"); } void parse_and_execute (char *s, int print, int verbose) { begin_unwind_frame ("parse_and_execute_2"); unwind_protect_int (reading_script_file); reading_script_file = 1; FILE *f = get_input_from_file (s, 0); if (f) { unwind_protect_int (input_line_number); unwind_protect_int (current_input_column); unwind_protect_int (echo_input); input_line_number = 0; current_input_column = 1; echo_input = 0; if (verbose) { cout << "reading commands from " << s << " ... "; reading_startup_message_printed = 1; cout.flush (); } parse_and_execute (f, print); if (verbose) cout << "done." << endl; } run_unwind_frame ("parse_and_execute_2"); } // Initialize by reading startup files. static void execute_startup_files (void) { begin_unwind_frame ("execute_startup_files"); unwind_protect_int (input_from_startup_file); input_from_startup_file = 1; int verbose = (verbose_flag && ! inhibit_startup_message); // Execute commands from the site-wide configuration file. char *sd = get_site_defaults (); parse_and_execute (sd, 0, verbose); // Try to execute commands from $HOME/.octaverc and ./.octaverc. char *home_rc = 0; if (home_directory) { home_rc = strconcat (home_directory, "/.octaverc"); parse_and_execute (home_rc, 0, verbose); } // Names alone are not enough. struct stat home_rc_statbuf; stat (home_rc, &home_rc_statbuf); delete [] home_rc; struct stat dot_rc_statbuf; stat ("./.octaverc", &dot_rc_statbuf); if (home_rc_statbuf.st_ino != dot_rc_statbuf.st_ino) parse_and_execute ("./.octaverc", 0, verbose); run_unwind_frame ("execute_startup_files"); } // Usage message with extra help. static void verbose_usage (void) { cout << "\n" << " Octave, version " << version_string << ". Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton.\n" << " This is free software with ABSOLUTELY NO WARRANTY.\n" << "\n" << " usage: " << usage_string << "\n\n" << " V : enable verbose output in some cases\n" << " d : enter parser debugging mode\n" << " f : don't read ~/.octaverc or .octaverc at startup\n" << " h|? : print short help message and exit\n" << " i : force interactive behavior\n" << " q : don't print message at startup\n" << " v : print version number and exit\n" << " x : echo commands as they are executed\n" << "\n" << " file : execute commands from named file\n" << "\n"; exit (0); } // Terse usage messsage. static void usage (void) { cerr << "usage: " << usage_string << "\n"; exit (1); } // Fix up things before exiting. void clean_up_and_exit (int retval) { raw_mode (0); clean_up_history (); close_plot_stream (); close_diary_file (); close_files (); cleanup_tmp_files (); if (!quitting_gracefully && (interactive || forced_interactive)) cout << "\n"; if (retval == EOF) retval = 0; exit (retval); // This is bogus but should prevent g++ from giving a warning saying // that this volatile function does return. panic_impossible (); } static void print_version_and_exit (void) { cout << "octave, version " << version_string << "\n"; exit (0); } static void initialize_error_handlers () { set_Complex_error_handler (octave_Complex_error_handler); set_liboctave_error_handler (error); } // You guessed it. int main (int argc, char **argv) { // The order of these calls is important, and initialize globals must // come before the options are processed because some command line // options override defaults. init_user_prefs (); initialize_pager (); sysdep_init (); initialize_error_handlers (); initialize_globals (argv[0]); int optc; while ((optc = getopt_long (argc, argv, short_opts, long_opts, 0)) != EOF) { switch (optc) { case 'V': verbose_flag++; break; case 'd': yydebug++; break; case 'f': read_init_files = 0; break; case 'h': case '?': verbose_usage (); break; case 'i': forced_interactive = 1; break; case 'p': if (optarg) load_path = strsave (optarg); break; case 'q': inhibit_startup_message = 1; break; case 'x': echo_input = 1; break; case 'v': print_version_and_exit (); break; case INFO_FILE_OPTION: if (optarg) info_file = strsave (optarg); break; default: usage (); break; } } #if defined (HAVE_ATEXIT) || (HAVE_ON_EXIT) // Make sure we clean up when we exit. If we don't have atexit or // on_exit, we're going to leave some junk files around if we exit // abnormally. atexit (cleanup_tmp_files); #endif // These can come after command line args since none of them set any // defaults that might be changed by command line options. install_signal_handlers (); initialize_history (); initialize_file_io (); initialize_symbol_tables (); install_builtins (); initialize_readline (); init_dynamic_linker (); if (! inhibit_startup_message) cout << "Octave, version " << version_string << ". Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton.\n" << "This is free software with ABSOLUTELY NO WARRANTY.\n" << "For details, type `warranty'.\n" << endl; if (read_init_files) { saving_history = 0; execute_startup_files (); saving_history = 1; } if (! inhibit_startup_message && reading_startup_message_printed) cout << endl; // Avoid counting commands executed from startup files. current_command_number = 1; // If there is an extra argument, see if it names a file to read. int remaining_args = argc - optind; if (remaining_args > 1) { usage (); } else if (remaining_args == 1) { reading_script_file = 1; curr_fcn_file_name = argv[optind]; FILE *infile = get_input_from_file (curr_fcn_file_name); if (infile) { rl_blink_matching_paren = 0; switch_to_buffer (create_buffer (infile)); } else clean_up_and_exit (1); } else { switch_to_buffer (create_buffer (get_input_from_stdin ())); // Is input coming from a terminal? If so, we are probably // interactive. interactive = (isatty (fileno (stdin)) && isatty (fileno (stdout))); } // Force input to be echoed if not really interactive, but the user // has forced interactive behavior. if (!interactive && forced_interactive) { rl_blink_matching_paren = 0; echo_input = 1; } if (! (interactive || forced_interactive)) using_readline = 0; // Allow the user to interrupt us without exiting. volatile sig_handler *saved_sigint_handler = signal (SIGINT, SIG_IGN); if (setjmp (toplevel) != 0) { raw_mode (0); cout << "\n"; } can_interrupt = 1; signal (SIGINT, saved_sigint_handler); // The big loop. int retval; do { curr_sym_tab = top_level_sym_tab; reset_parser (); retval = yyparse (); if (retval == 0 && global_command) { global_command->eval (1); delete global_command; current_command_number++; } } while (retval == 0); if (retval == 1 && ! error_state) retval = 0; clean_up_and_exit (retval); } DEFUN_TEXT ("casesen", Fcasesen, Scasesen, 2, 1, "casesen [on|off]") { Octave_object retval; DEFINE_ARGV("casesen"); if (argc == 1 || (argc > 1 && strcmp (argv[1], "off") == 0)) warning ("casesen: sorry, Octave is always case sensitive"); else if (argc > 1 && strcmp (argv[1], "on") == 0) ; // ok. else print_usage ("casesen"); DELETE_ARGV; return retval; } DEFUN ("computer", Fcomputer, Scomputer, 1, 0, "computer ():\n\ \n\ Have Octave ask the system, \"What kind of computer are you?\"") { Octave_object retval; int nargin = args.length (); if (nargin != 0) warning ("computer: ignoring extra arguments"); ostrstream output_buf; if (strcmp (TARGET_HOST_TYPE, "unknown") == 0) output_buf << "Hi Dave, I'm a HAL-9000"; else output_buf << TARGET_HOST_TYPE; if (nargout == 0) { output_buf << "\n" << ends; maybe_page_output (output_buf); } else { output_buf << ends; char *msg = output_buf.str (); retval = msg; delete [] msg; } return retval; } DEFUN ("flops", Fflops, Sflops, 0, 1, "flops (): count floating point operations") { int nargin = args.length (); if (nargin > 0) print_usage ("flops"); warning ("flops is a flop, always returning zero"); return 0.0; } DEFUN ("quit", Fquit, Squit, 0, 0, "quit (): exit Octave gracefully") { Octave_object retval; quitting_gracefully = 1; clean_up_and_exit (0); return retval; } DEFALIAS (exit, quit); DEFUN ("warranty", Fwarranty, Swarranty, 0, 0, "warranty (): describe copying conditions") { Octave_object retval; ostrstream output_buf; output_buf << "\n Octave, version " << version_string << ". Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton\n" << "\n\ This program is free software; you can redistribute it and/or modify\n\ it under the terms of the GNU General Public License as published by\n\ the Free Software Foundation; either version 2 of the License, or\n\ (at your option) any later version.\n\ \n\ This program is distributed in the hope that it will be useful,\n\ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\ GNU General Public License for more details.\n\ \n\ You should have received a copy of the GNU General Public License\n\ along with this program. If not, write to the Free Software\n\ Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.\n\ \n"; output_buf << ends; maybe_page_output (output_buf); return retval; } // XXX FIXME XXX -- this may not be the best place for these... Octave_object feval (const Octave_object& args, int nargout) { Octave_object retval; tree_fvc *fcn = is_valid_function (args(0), "feval", 1); if (fcn) { int tmp_nargin = args.length () - 1; Octave_object tmp_args; tmp_args.resize (tmp_nargin); for (int i = 0; i < tmp_nargin; i++) tmp_args(i) = args(i+1); retval = fcn->eval (0, nargout, tmp_args); } return retval; } DEFUN ("feval", Ffeval, Sfeval, -1, 1, "feval (NAME, ARGS, ...)\n\ \n\ evaluate NAME as a function, passing ARGS as its arguments") { Octave_object retval; int nargin = args.length (); if (nargin > 0) retval = feval (args, nargout); else print_usage ("feval"); return retval; } static Octave_object eval_string (const char *string, int print, int ans_assign, int& parse_status, int nargout) { begin_unwind_frame ("eval_string"); unwind_protect_int (get_input_from_eval_string); unwind_protect_ptr (global_command); unwind_protect_ptr (current_eval_string); get_input_from_eval_string = 1; current_eval_string = string; YY_BUFFER_STATE old_buf = current_buffer (); YY_BUFFER_STATE new_buf = create_buffer (0); add_unwind_protect (restore_input_buffer, (void *) old_buf); add_unwind_protect (delete_input_buffer, (void *) new_buf); switch_to_buffer (new_buf); unwind_protect_ptr (curr_sym_tab); reset_parser (); parse_status = yyparse (); // Important to reset the idea of where input is coming from before // trying to eval the command we just parsed -- it might contain the // name of an function file that still needs to be parsed! tree_statement_list *command = global_command; run_unwind_frame ("eval_string"); Octave_object retval; if (parse_status == 0 && command) { retval = command->eval (print, nargout); delete command; } return retval; } tree_constant eval_string (const char *string, int print, int ans_assign, int& parse_status) { tree_constant retval; Octave_object tmp = eval_string (string, print, ans_assign, parse_status, 1); retval = tmp(0); return retval; } static Octave_object eval_string (const tree_constant& arg, int& parse_status, int nargout) { char *string = arg.string_value (); if (error_state) { error ("eval: expecting string argument"); return -1.0; } // Yes Virginia, we always print here... return eval_string (string, 1, 1, parse_status, nargout); } DEFUN ("eval", Feval, Seval, 2, 1, "eval (TRY, CATCH)\n\ \n\ Evaluate the string TRY as octave code. If that fails, evaluate the\n\ string CATCH.") { Octave_object retval; int nargin = args.length (); if (nargin > 0) { begin_unwind_frame ("Feval"); if (nargin > 1) { unwind_protect_int (suppress_octave_error_messages); suppress_octave_error_messages = 1; } int parse_status = 0; retval = eval_string (args(0), parse_status, nargout); if (nargin > 1 && (parse_status != 0 || error_state)) { error_state = 0; eval_string (args(1), parse_status, nargout); retval = Octave_object (); } run_unwind_frame ("Feval"); } else print_usage ("eval"); return retval; } // Execute a shell command. DEFUN ("system", Fsystem, Ssystem, 2, 1, "system (string [, return_output]): execute shell commands") { Octave_object retval; int nargin = args.length (); if (nargin < 1 || nargin > 2) { print_usage ("system"); return retval; } tree_constant tc_command = args(0); char *tmp_str = tc_command.string_value (); if (error_state) { error ("system: expecting string as first argument"); } else { iprocstream cmd (tmp_str); ostrstream output_buf; char ch; while (cmd.get (ch)) output_buf.put (ch); output_buf << ends; int status = cmd.close (); // The value in status is as returned by waitpid. If the process // exited normally, extract the actual exit status of the command. // Otherwise, return 127 as a failure code. if ((status & 0xff) == 0) status = (status & 0xff00) >> 8; else status = 127; if (nargout > 0 || nargin > 1) { char *msg = output_buf.str (); retval(1) = (double) status; retval(0) = msg; delete [] msg; } else maybe_page_output (output_buf); } return retval; } DEFALIAS (shell_cmd, system); /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/octave-hist.cc100666 415 17 32416 5702417022 14510 0ustar jweusers// octave-hist.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. The functions listed below were adapted from similar functions from GNU Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc. do_history edit_history_readline do_edit_history edit_history_add_hist */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include "statdefs.h" #include "utils.h" #include "error.h" #include "input.h" #include "pager.h" #include "octave.h" #include "oct-obj.h" #include "user-prefs.h" #include "unwind-prot.h" #include "octave-hist.h" #include "sighandlers.h" #include "defun.h" extern "C" { #include } // Nonzero means input is coming from temporary history file. int input_from_tmp_history_file = 0; // Nonzero means we are saving history lines. int saving_history = 1; // The number of lines to save in the history file. static int octave_hist_size = 1024; // The name of the history file. static char *octave_hist_file; // The number of hisory lines we read from the history file. static int history_lines_in_file = 0; // The number of history lines we've saved so far. static int history_lines_this_session = 0; // Get some default values, possibly reading them from the // environment. static int default_history_size (void) { int size = 1024; char *env_size = getenv ("OCTAVE_HISTSIZE"); if (env_size) { int val; if (sscanf (env_size, "%d", &val) == 1) size = val > 0 ? val : 0; } return size; } static char * default_history_file (void) { char *file = 0; char *env_file = getenv ("OCTAVE_HISTFILE"); if (env_file) { fstream f (env_file, (ios::in | ios::out)); if (f) { file = strsave (env_file); f.close (); } } if (! file && home_directory) file = strconcat (home_directory, "/.octave_hist"); return file; } // Prime the history list. void initialize_history (void) { octave_hist_file = default_history_file (); octave_hist_size = default_history_size (); read_history (octave_hist_file); using_history (); history_lines_in_file = where_history (); } void clean_up_history (void) { stifle_history (octave_hist_size); write_history (octave_hist_file); } void maybe_save_history (char *s) { if (saving_history) { add_history (s); history_lines_this_session++; } } // Display, save, or load history. Stolen and modified from bash. // // Arg of -w FILENAME means write file, arg of -r FILENAME // means read file, arg of -q means don't number lines. Arg of N // means only display that many items. void do_history (int argc, char **argv) { HIST_ENTRY **hlist; int numbered_output = 1; while (--argc > 0) { argv++; if (*argv[0] == '-' && strlen (*argv) == 2 && ((*argv)[1] == 'r' || (*argv)[1] == 'w' || (*argv)[1] == 'a' || (*argv)[1] == 'n')) { char *file; int result = 0; if (argc > 1) file = *(argv+1); else file = octave_hist_file; switch ((*argv)[1]) { case 'a': // Append `new' lines to file. { if (history_lines_this_session) { if (history_lines_this_session < where_history ()) { // If the filename was supplied, then create it if it doesn't already // exist. if (file) { struct stat buf; if (stat (file, &buf) == -1) { int tem; tem = open (file, O_CREAT, 0666); close (tem); } } result = append_history (history_lines_this_session, file); history_lines_in_file += history_lines_this_session; history_lines_this_session = 0; } } } break; case 'w': // Write entire history. result = write_history (file); break; case 'r': // Read entire file. result = read_history (file); break; case 'n': // Read `new' history from file. // Read all of the lines in the file that we haven't already read. using_history (); result = read_history_range (file, history_lines_in_file, -1); using_history (); history_lines_in_file = where_history (); break; } return; } else if (strcmp (*argv, "-q") == 0) numbered_output = 0; else if (strcmp (*argv, "--") == 0) { argc--; argv++; break; } else break; } int limited = 0; int limit = 0; if (argc > 0) { limited = 1; if (sscanf (*argv, "%d", &limit) != 1) { if (*argv[0] == '-') error ("history: unrecognized option `%s'", *argv); else error ("history: bad non-numeric arg `%s'", *argv); return; } } hlist = history_list (); if (hlist) { for (int i = 0; hlist[i]; i++) ; // Do nothing. if (limit < 0) limit = -limit; if (!limited) i = 0; else if ((i -= limit) < 0) i = 0; ostrstream output_buf; while (hlist[i]) { // QUIT; // in bash: (interrupt_state) throw_to_top_level (); if (numbered_output) output_buf.form ("%5d%c", i + history_base, hlist[i]->data ? '*' : ' '); output_buf << hlist[i]->line << "\n"; i++; } output_buf << ends; maybe_page_output (output_buf); } } // Read the edited history lines from STREAM and return them // one at a time. This can read unlimited length lines. The // caller should free the storage. static char * edit_history_readline (fstream& stream) { char c; int line_len = 128; int lindex = 0; char *line = new char [line_len]; line[0] = '\0'; while (stream.get (c)) { if (lindex + 2 >= line_len) { char *tmp_line = new char [line_len += 128]; strcpy (tmp_line, line); delete [] line; line = tmp_line; } if (c == '\n') { line[lindex++] = '\n'; line[lindex++] = '\0'; return line; } else line[lindex++] = c; } if (! lindex) { delete [] line; return 0; } if (lindex + 2 >= line_len) { char *tmp_line = new char [lindex+3]; strcpy (tmp_line, line); delete [] line; line = tmp_line; } // Finish with newline if none in file. line[lindex++] = '\n'; line[lindex++] = '\0'; return line; } extern "C" { HIST_ENTRY *history_get (); } // Use `command' to replace the last entry in the history list, which, // by this time, is `run_history blah...'. The intent is that the // new command become the history entry, and that `fc' should never // appear in the history list. This way you can do `run_history' to // your heart's content. static void edit_history_repl_hist (char *command) { if (! command || ! *command) return; HIST_ENTRY **hlist = history_list (); if (! hlist) return; for (int i = 0; hlist[i]; i++) ; // Count 'em. i--; // History_get () takes a parameter that should be offset by history_base. // Don't free this. HIST_ENTRY *histent = history_get (history_base + i); if (! histent) return; char *data = 0; if (histent->data) { int len = strlen (histent->data); data = (char *) malloc (len); strcpy (data, histent->data); } int n = strlen (command); if (command[n - 1] == '\n') command[n - 1] = '\0'; if (command && *command) { HIST_ENTRY *discard = replace_history_entry (i, command, data); if (discard) { if (discard->line) free (discard->line); free ((char *) discard); } } } static void edit_history_add_hist (char *line) { if (line) { int len = strlen (line); if (len > 0 && line[len-1] == '\n') line[len-1] = '\0'; if (line[0] != '\0') add_history (line); } } #define histline(i) (hlist[(i)]->line) static char * mk_tmp_hist_file (int argc, char **argv, int insert_curr, char *warn_for) { HIST_ENTRY **hlist; hlist = history_list (); int hist_count = 0; while (hlist[hist_count++]) ; // Find the number of items in the history list. // The current command line is already part of the history list by the // time we get to this point. Delete it from the list. hist_count -= 2; if (! insert_curr) remove_history (hist_count); hist_count--; // If no numbers have been specified, the default is to edit the last // command in the history list. int hist_end = hist_count; int hist_beg = hist_count; int reverse = 0; // Process options int usage_error = 0; if (argc == 3) { argv++; if (sscanf (*argv++, "%d", &hist_beg) != 1 || sscanf (*argv, "%d", &hist_end) != 1) usage_error = 1; else { hist_beg--; hist_end--; } } else if (argc == 2) { argv++; if (sscanf (*argv++, "%d", &hist_beg) != 1) usage_error = 1; else { hist_beg--; hist_end = hist_beg; } } if (hist_beg < 0 || hist_end < 0 || hist_beg > hist_count || hist_end > hist_count) { error ("%s: history specification out of range", warn_for); return 0; } if (usage_error) { usage ("%s [first] [last]", warn_for); return 0; } if (hist_end < hist_beg) { int t = hist_end; hist_end = hist_beg; hist_beg = t; reverse = 1; } char *name = octave_tmp_file_name (); fstream file (name, ios::out); if (! file) { error ("%s: couldn't open temporary file `%s'", warn_for, name); return 0; } if (reverse) { for (int i = hist_end; i >= hist_beg; i--) file << histline (i) << "\n"; } else { for (int i = hist_beg; i <= hist_end; i++) file << histline (i) << "\n"; } file.close (); return strsave (name); } void do_edit_history (int argc, char **argv) { char *name = mk_tmp_hist_file (argc, argv, 0, "edit_history"); if (! name) return; // Call up our favorite editor on the file of commands. ostrstream buf; buf << user_pref.editor << " " << name << ends; char *cmd = buf.str (); // Ignore interrupts while we are off editing commands. Should we // maybe avoid using system()? volatile sig_handler *saved_sigint_handler = signal (SIGINT, SIG_IGN); system (cmd); signal (SIGINT, saved_sigint_handler); // Write the commands to the history file since parse_and_execute // disables command line history while it executes. fstream file (name, ios::in); char *line; int first = 1; while ((line = edit_history_readline (file)) != 0) { // Skip blank lines if (line[0] == '\n') { delete [] line; continue; } if (first) { first = 0; edit_history_repl_hist (line); } else edit_history_add_hist (line); } file.close (); // Turn on command echo, so the output from this will make better sense. begin_unwind_frame ("do_edit_history"); unwind_protect_int (echo_input); unwind_protect_int (input_from_tmp_history_file); echo_input = 1; input_from_tmp_history_file = 1; parse_and_execute (name, 1); run_unwind_frame ("do_edit_history"); // Delete the temporary file. Should probably be done with an // unwind_protect. unlink (name); delete [] name; } void do_run_history (int argc, char **argv) { char *name = mk_tmp_hist_file (argc, argv, 1, "run_history"); if (! name) return; // Turn on command echo, so the output from this will make better sense. begin_unwind_frame ("do_run_history"); unwind_protect_int (echo_input); unwind_protect_int (input_from_tmp_history_file); echo_input = 1; input_from_tmp_history_file = 1; parse_and_execute (name, 1); run_unwind_frame ("do_run_history"); // Delete the temporary file. Should probably be done with an // unwind_protect. unlink (name); delete [] name; } int current_history_number (void) { using_history (); if (octave_hist_size > 0) return history_base + where_history (); else return -1; } DEFUN_TEXT ("edit_history", Fedit_history, Sedit_history, -1, 1, "edit_history [first] [last]\n\ \n\ edit commands from the history list") { Octave_object retval; DEFINE_ARGV("edit_history"); do_edit_history (argc, argv); DELETE_ARGV; return retval; } DEFUN_TEXT ("history", Fhistory, Shistory, -1, 1, "history [N] [-w file] [-r file] [-q]\n\ \n\ display, save, or load command history") { Octave_object retval; DEFINE_ARGV("history"); do_history (argc, argv); DELETE_ARGV; return retval; } DEFUN_TEXT ("run_history", Frun_history, Srun_history, -1, 1, "run_history [first] [last]\n\ \n\ run commands from the history list") { Octave_object retval; DEFINE_ARGV("run_history"); do_run_history (argc, argv); DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/oct-obj.cc100666 415 17 6101 5702417024 13571 0ustar jweusers// oct-obj.cc -*- C++ -*- /* Copyright (C) 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "Array.h" #include "mx-base.h" #include "Range.h" #include "tree-const.h" #include "oct-obj.h" // We can't put these functions in oct-obj.h without including // tree-const.h there too, and that causes trouble... Octave_object::Octave_object (double d) : Array (1, tree_constant (d)) { } Octave_object::Octave_object (const Matrix& m) : Array (1, tree_constant (m)) { } Octave_object::Octave_object (const DiagMatrix& d) : Array (1, tree_constant (d)) { } Octave_object::Octave_object (const RowVector& v, int pcv) : Array (1, tree_constant (v, pcv)) { } Octave_object::Octave_object (const ColumnVector& v, int pcv) : Array (1, tree_constant (v, pcv)) { } Octave_object::Octave_object (const Complex& c) : Array (1, tree_constant (c)) { } Octave_object::Octave_object (const ComplexMatrix& m) : Array (1, tree_constant (m)) { } Octave_object::Octave_object (const ComplexDiagMatrix& d) : Array (1, tree_constant (d)) { } Octave_object::Octave_object (const ComplexRowVector& v, int pcv) : Array (1, tree_constant (v, pcv)) { } Octave_object::Octave_object (const ComplexColumnVector& v, int pcv) : Array (1, tree_constant (v, pcv)) { } Octave_object::Octave_object (const char *s) : Array (1, tree_constant (s)) { } Octave_object::Octave_object (double base, double limit, double inc) : Array (1, tree_constant (base, limit, inc)) { } Octave_object::Octave_object (const Range& r) : Array (1, tree_constant (r)) { } tree_constant& Octave_object::operator () (int n) { maybe_resize (n); return Array::operator () (n); } tree_constant Octave_object::operator () (int n) const { return Array::operator () (n); } tree_constant& Octave_object::elem (int n) { maybe_resize (n); return Array::elem (n); } tree_constant Octave_object::elem (int n) const { return Array::operator () (n); } void Octave_object::maybe_resize (int n) { if (n >= length ()) resize (n + 1, Matrix ()); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/pager.cc100666 415 17 11232 5702417021 13350 0ustar jweusers// pager.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include "procstream.h" #include "sighandlers.h" #include "user-prefs.h" #include "oct-obj.h" #include "error.h" #include "defun.h" #include "input.h" #include "pager.h" #include "utils.h" #include "help.h" // Where we stash output headed for the screen. static ostrstream *pager_buf = 0; // Nonzero means we write to the diary file. static int write_to_diary_file = 0; // The name of the current diary file. static char *diary_file = "diary"; // The diary file. static ofstream diary_stream; static int line_count (char *s) { int count = 0; if (s) { char c; while ((c = *s++) != '\0') if (c == '\n') count++; } return count; } // For now, use the variables from readline. It already handles // SIGWINCH, so these values have a good chance of being correct even // if the window changes size (they will be wrong if, for example, the // luser changes the window size while the pager is running, and the // signal is handled by the pager instead of us. int terminal_columns (void) { extern int screenwidth; return screenwidth > 0 ? screenwidth : 80; } int terminal_rows (void) { extern int screenheight; return screenheight > 0 ? screenheight : 24; } void initialize_pager (void) { delete pager_buf; pager_buf = new ostrstream (); } void maybe_page_output (ostrstream& msg_buf) { msg_buf << ends; char *message = msg_buf.str (); if (interactive && user_pref.page_screen_output && user_pref.pager_binary) { *pager_buf << message; delete [] message; } else { cout << message; cout.flush (); delete [] message; } } void flush_output_to_pager (void) { // Extract message from buffer, then delete the buffer so that any // new messages get sent separately. *pager_buf << ends; char *message = pager_buf->str (); initialize_pager (); if (! message || ! *message) { delete [] message; return; } maybe_write_to_diary_file (message); int nlines = line_count (message); if (nlines > terminal_rows () - 2) { char *pgr = user_pref.pager_binary; if (pgr) { oprocstream pager_stream (pgr); if (pager_stream) { volatile sig_handler *old_sigint_handler; old_sigint_handler = signal (SIGINT, SIG_IGN); pager_stream << message; delete [] message; pager_stream.flush (); pager_stream.close (); signal (SIGINT, old_sigint_handler); return; } } } cout << message; delete [] message; cout.flush (); } static void open_diary_file (void) { if (diary_stream.is_open ()) diary_stream.close (); diary_stream.open (diary_file, ios::app); if (! diary_stream) error ("diary: can't open diary file `%s'", diary_file); } void close_diary_file (void) { if (diary_stream) diary_stream.close (); } void maybe_write_to_diary_file (const char *s) { if (write_to_diary_file && diary_stream) diary_stream << s; } DEFUN_TEXT ("diary", Fdiary, Sdiary, -1, 1, "diary [on|off]\n\ diary [file]\n\ \n\ redirect all input and screen output to a file.") { Octave_object retval; DEFINE_ARGV("diary"); switch (argc) { case 1: write_to_diary_file = ! write_to_diary_file; open_diary_file (); break; case 2: { char *arg = argv[1]; if (strcmp (arg, "on") == 0) { write_to_diary_file = 1; open_diary_file (); } else if (strcmp (arg, "off") == 0) write_to_diary_file = 0; else { delete [] diary_file; diary_file = strsave (arg); open_diary_file (); } } break; default: print_usage ("diary"); break; } DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/parse.y100666 415 17 110747 5702416624 13312 0ustar jweusers/* parse.y -*- text -*- Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Parser for Octave. // C decarations. %{ #define YYDEBUG 1 #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "SLStack.h" #include "Matrix.h" #include "octave-hist.h" #include "user-prefs.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-const.h" #include "tree-misc.h" #include "variables.h" #include "tree-plot.h" #include "octave.h" #include "symtab.h" #include "parse.h" #include "token.h" #include "error.h" #include "pager.h" #include "input.h" #include "utils.h" #include "lex.h" // Nonzero means we're in the middle of defining a function. int defining_func = 0; // Nonzero means we're in the middle of defining a loop. int looping = 0; // Nonzero means we're in the middle of defining a conditional expression. int iffing = 0; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. int maybe_screwed = 0; // Nonzero means we need to do some extra lookahead to avoid being // screwed by bogus function syntax. int maybe_screwed_again = 0; // Temporary symbol table pointer used to cope with bogus function syntax. symbol_table *tmp_local_sym_tab = 0; // Stack to hold list of literal matrices. SLStack ml; // A nonzero element corresponding to an element of ml means we just // started reading a new matrix. This should probably be part of a // new struct for matrix lists... SLStack mlnm; // The current input line number. int input_line_number = 0; // The column of the current token. int current_input_column = 1; // Buffer for help text snagged from function files. char *help_buf = 0; // Nonzero means we're working on a plot command. int plotting = 0; // Nonzero means we've seen something that means we must be past the // range part of a plot command. int past_plot_range = 0; // Nonzero means we're looking at the range part of a plot command. int in_plot_range = 0; // Nonzero means we're looking at the using part of a plot command. int in_plot_using = 0; // Nonzero means we're looking at the style part of a plot command. int in_plot_style = 0; // Nonzero means we're looking at an indirect reference to a structure // element. int looking_at_indirect_ref = 0; // Forward declarations for some functions defined at the bottom of // the file. // Generic error messages. static void yyerror (char *s); // Error mesages for mismatched end tokens. static void end_error (char *type, token::end_tok_type ettype, int l, int c); // Check to see that end tokens are properly matched. static int check_end (token *tok, token::end_tok_type expected); // Try to figure out early if an expression should become an // assignment to the builtin variable ans. static tree_expression *maybe_convert_to_ans_assign (tree_expression *expr); // Maybe print a warning if an assignment expression is used as the // test in a logical expression. static void maybe_warn_assign_as_truth_value (tree_expression *expr); // Build a binary expression. static tree_expression *make_binary_op (int op, tree_expression *op1, token *tok_val, tree_expression *op2); // Build a prefix expression. static tree_expression *make_prefix_op (int op, tree_identifier *op1, token *tok_val); // Build a postfix expression. static tree_expression *make_postfix_op (int op, tree_identifier *op1, token *tok_val); // Build a binary expression. static tree_expression *make_unary_op (int op, tree_expression *op1, token *tok_val); // Make an expression that handles assignment of multiple values. static tree_expression *make_multi_val_ret (tree_expression *rhs, int l = -1, int c = -1); // Make an index expression. static tree_index_expression *make_index_expression (tree_indirect_ref *indir, tree_argument_list *args); #define ABORT_PARSE \ do \ { \ global_command = 0; \ yyerrok; \ if (interactive) \ YYACCEPT; \ else \ YYABORT; \ } \ while (0) %} // Bison declarations. %union { // The type of the basic tokens returned by the lexer. token *tok_val; // Types for the nonterminals we generate. tree *tree_type; tree_expression *tree_expression_type; tree_constant *tree_constant_type; tree_matrix *tree_matrix_type; tree_identifier *tree_identifier_type; tree_indirect_ref *tree_indirect_ref_type; tree_function *tree_function_type; tree_index_expression *tree_index_expression_type; tree_colon_expression *tree_colon_expression_type; tree_argument_list *tree_argument_list_type; tree_parameter_list *tree_parameter_list_type; tree_command *tree_command_type; tree_if_command *tree_if_command_type; tree_if_clause *tree_if_clause_type; tree_if_command_list *tree_if_command_list_type; tree_global *tree_global_type; tree_global_init_list *tree_global_init_list_type; tree_global_command *tree_global_command_type; tree_statement *tree_statement_type; tree_statement_list *tree_statement_list_type; tree_plot_command *tree_plot_command_type; subplot *subplot_type; subplot_list *subplot_list_type; plot_limits *plot_limits_type; plot_range *plot_range_type; subplot_using *subplot_using_type; subplot_style *subplot_style_type; } // Tokens with line and column information. %token '=' ':' '-' '+' '*' '/' %token EXPR_AND_AND EXPR_OR_OR %token EXPR_AND EXPR_OR EXPR_NOT %token EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT %token LEFTDIV EMUL EDIV ELEFTDIV QUOTE TRANSPOSE %token PLUS_PLUS MINUS_MINUS POW EPOW %token NUM IMAG_NUM %token NAME SCREW %token END %token PLOT %token TEXT STYLE %token FOR WHILE IF ELSEIF ELSE BREAK CONTINUE FUNC_RET %token UNWIND CLEANUP %token GLOBAL %token TEXT_ID // Other tokens. %token LEXICAL_ERROR %token FCN SCREW_TWO %token ELLIPSIS %token ALL_VA_ARGS %token END_OF_INPUT %token USING TITLE WITH COLON OPEN_BRACE CLOSE_BRACE CLEAR // Nonterminals we construct. %type input %type expression simple_expr simple_expr1 %type ans_expression title %type matrix %type identifier %type indirect_ref indirect_ref1 %type func_def1 func_def2 func_def3 %type variable word_list_cmd %type colon_expr %type arg_list word_list %type param_list param_list1 %type return_list return_list1 %type command func_def %type if_command %type elseif_clause else_clause %type if_cmd_list1 if_cmd_list %type global_decl2 %type global_decl1 %type global_decl %type statement %type simple_list simple_list1 list list1 %type opt_list input1 %type plot_command %type plot_command2 plot_options %type plot_command1 %type ranges %type ranges1 %type using using1 %type style // Precedence and associativity. %left ';' ',' '\n' %right '=' %left EXPR_AND_AND EXPR_OR_OR %left EXPR_AND EXPR_OR %left EXPR_LT EXPR_LE EXPR_EQ EXPR_NE EXPR_GE EXPR_GT %left ':' %left '-' '+' %left '*' '/' LEFTDIV EMUL EDIV ELEFTDIV %left QUOTE TRANSPOSE %left UNARY PLUS_PLUS MINUS_MINUS EXPR_NOT %right POW EPOW // There are 19 shift/reduce conflicts, ok? %expect 19 // Where to start. %start input // Grammar rules. %% input : input1 { global_command = $1; promptflag = 1; YYACCEPT; } | END_OF_INPUT { global_command = 0; promptflag = 1; YYABORT; } | simple_list parse_error { ABORT_PARSE; } | parse_error { ABORT_PARSE; } ; input1 : '\n' { $$ = 0; } | simple_list { $$ = $1; } | simple_list '\n' { $$ = $1; } | simple_list END_OF_INPUT { $$ = $1; } ; parse_error : LEXICAL_ERROR | error ; simple_list : semi_comma { $$ = 0; } | comma_semi { $$ = 0; } | simple_list1 { $$ = $1; } | simple_list1 semi_comma { tree_statement *tmp = $1->rear (); tmp->set_print_flag (0); } | simple_list1 comma_semi { $$ = $1; } ; simple_list1 : statement { $$ = new tree_statement_list ($1); } | semi_comma statement { $$ = new tree_statement_list ($2); } | comma_semi statement { $$ = new tree_statement_list ($2); } | simple_list1 semi_comma statement { tree_statement *tmp = $1->rear (); tmp->set_print_flag (0); $1->append ($3); } | simple_list1 comma_semi statement { $1->append ($3); } ; semi_comma : ';' | semi_comma ',' | semi_comma ';' ; comma_semi : ',' | comma_semi ';' | comma_semi ',' ; comma_nl_sep : ',' | '\n' | comma_nl_sep sep ; semi_sep : ';' | semi_sep sep ; opt_list : // empty { $$ = new tree_statement_list (); } | list { $$ = $1; } ; list : list1 { $$ = $1; } | list1 comma_nl_sep { $$ = $1; } | list1 semi_sep { tree_statement *tmp = $1->rear (); tmp->set_print_flag (0); } ; list1 : statement { beginning_of_function = 0; $$ = new tree_statement_list ($1); } | list1 comma_nl_sep statement { $1->append ($3); } | list1 semi_sep statement { tree_statement *tmp = $1->rear (); tmp->set_print_flag (0); $1->append ($3); } ; statement : command { $$ = new tree_statement ($1); } | ans_expression { $$ = new tree_statement ($1); } | PLOT CLEAR { symbol_record *sr = lookup_by_name ("clearplot", 0); tree_identifier *id = new tree_identifier (sr); $$ = new tree_statement (id); } ; plot_command : PLOT plot_command1 { if (! $2 && $1->pttype () != token::replot) { yyerror ("must have something to plot"); ABORT_PARSE; } else { $$ = new tree_plot_command ($2, $1->pttype ()); plotting = 0; past_plot_range = 0; in_plot_range = 0; in_plot_using = 0; in_plot_style = 0; } } | PLOT ranges plot_command1 { if ($1->pttype () == token::replot) { yyerror ("cannot specify new ranges with replot"); ABORT_PARSE; } else { $$ = new tree_plot_command ($3, $2, $1->pttype ()); plotting = 0; past_plot_range = 0; in_plot_range = 0; in_plot_using = 0; in_plot_style = 0; } } ; ranges : ranges1 { $$ = new plot_limits ($1); } | ranges1 ranges1 { $$ = new plot_limits ($1, $2); } | ranges1 ranges1 ranges1 { $$ = new plot_limits ($1, $2, $3); } ; ranges1 : OPEN_BRACE expression COLON expression CLOSE_BRACE { $$ = new plot_range ($2, $4); } | OPEN_BRACE COLON expression CLOSE_BRACE { $$ = new plot_range (0, $3); } | OPEN_BRACE expression COLON CLOSE_BRACE { $$ = new plot_range ($2, 0); } | OPEN_BRACE COLON CLOSE_BRACE { $$ = new plot_range (); } | OPEN_BRACE CLOSE_BRACE { $$ = new plot_range (); } ; plot_command1 : // empty { $$ = 0; } | plot_command2 { $$ = new subplot_list ($1); } | plot_command1 ',' plot_command2 { $1->append ($3); } ; plot_command2 : expression { $$ = new subplot ($1); } | expression plot_options { $2->set_data ($1); $$ = $2; } ; plot_options : using { $$ = new subplot ($1, 0, 0); } | title { $$ = new subplot (0, $1, 0); } | style { $$ = new subplot (0, 0, $1); } | using title { $$ = new subplot ($1, $2, 0); } | title using { $$ = new subplot ($2, $1, 0); } | using style { $$ = new subplot ($1, 0, $2); } | style using { $$ = new subplot ($2, 0, $1); } | title style { $$ = new subplot (0, $1, $2); } | style title { $$ = new subplot (0, $2, $1); } | using title style { $$ = new subplot ($1, $2, $3); } | using style title { $$ = new subplot ($1, $3, $2); } | title using style { $$ = new subplot ($2, $1, $3); } | title style using { $$ = new subplot ($3, $1, $2); } | style using title { $$ = new subplot ($2, $3, $1); } | style title using { $$ = new subplot ($3, $2, $1); } ; using : using1 { in_plot_using = 0; $$ = $1; } | using1 expression { in_plot_using = 0; $$ = $1->set_format ($2); } ; using1 : USING expression { subplot_using *tmp = new subplot_using (); $$ = tmp->add_qualifier ($2); } | using1 COLON expression { $$ = $1->add_qualifier ($3); } ; title : TITLE expression { $$ = $2; } ; style : WITH STYLE { $$ = new subplot_style ($2->string ()); } | WITH STYLE expression { $$ = new subplot_style ($2->string (), $3); } | WITH STYLE expression bogus_syntax expression { $$ = new subplot_style ($2->string (), $3, $5); } ; bogus_syntax : // empty ; ans_expression : expression { $$ = maybe_convert_to_ans_assign ($1); } ; global_decl : GLOBAL global_decl1 { $$ = new tree_global_command ($2, $1->line (), $1->column ()); } ; global_decl1 : global_decl2 { $$ = new tree_global_init_list ($1); } | global_decl1 optcomma global_decl2 { $1->append ($3); } global_decl2 : identifier { $$ = new tree_global ($1); } | identifier '=' expression { tree_simple_assignment_expression *tmp_ass; tmp_ass = new tree_simple_assignment_expression ($1, $3, 0, 0, $2->line (), $2->column ()); $$ = new tree_global (tmp_ass); } ; optcomma : // empty | ',' { if (user_pref.warn_comma_in_global_decl) warning ("comma in global declaration not\ interpreted as a command separator"); } ; command : plot_command { $$ = $1; } | func_def { $$ = $1; } | global_decl { $$ = $1; } | if_command { iffing--; $$ = $1; } | UNWIND optsep opt_list CLEANUP optsep opt_list END { if (check_end ($7, token::unwind_protect_end)) ABORT_PARSE; $$ = new tree_unwind_protect_command ($3, $6, $1->line (), $1->column ()); } | WHILE expression optsep opt_list END { maybe_warn_assign_as_truth_value ($2); if (check_end ($5, token::while_end)) ABORT_PARSE; looping--; $$ = new tree_while_command ($2, $4, $1->line (), $1->column ()); } | FOR variable '=' expression optsep opt_list END { if (check_end ($7, token::for_end)) ABORT_PARSE; looping--; $$ = new tree_for_command ($2, $4, $6, $1->line (), $1->column ()); } | BREAK { if (!looping) { yyerror ("break: only meaningful within a `for'\ or `while' loop"); ABORT_PARSE; } $$ = new tree_break_command ($1->line (), $1->column ()); } | CONTINUE { if (!looping) { yyerror ("continue: only meaningful within a\ `for' or `while' loop"); ABORT_PARSE; } $$ = new tree_continue_command ($1->line (), $1->column ()); } | FUNC_RET { if (!defining_func) { yyerror ("return: only meaningful within a function"); ABORT_PARSE; } $$ = new tree_return_command ($1->line (), $1->column ()); } ; if_command : IF if_cmd_list END { if (check_end ($3, token::if_end)) ABORT_PARSE; $$ = new tree_if_command ($2, $1->line (), $1->column ()); } ; if_cmd_list : if_cmd_list1 { $$ = $1 } | if_cmd_list1 else_clause { $1->append ($2); } ; if_cmd_list1 : expression optsep opt_list { maybe_warn_assign_as_truth_value ($1); tree_if_clause *t = new tree_if_clause ($1, $3); $$ = new tree_if_command_list (t); } | if_cmd_list1 elseif_clause { $1->append ($2); } ; elseif_clause : ELSEIF optsep expression optsep opt_list { maybe_warn_assign_as_truth_value ($3); $$ = new tree_if_clause ($3, $5); } ; else_clause : ELSE optsep opt_list { $$ = new tree_if_clause ($3); } ; optsep : // empty | sep ; sep : ',' | ';' | '\n' | sep ',' | sep ';' | sep '\n' ; screwed_again : // empty { maybe_screwed_again++; } ; expression : variable '=' expression { $$ = new tree_simple_assignment_expression ($1, $3, 0, 0, $2->line (), $2->column ()); } | NUM '=' expression { yyerror ("invalid assignment to a number"); $$ = 0; ABORT_PARSE; } | '[' screwed_again matrix_row SCREW_TWO '=' expression { $$ = make_multi_val_ret ($6, $5->line (), $5->column ()); if (! $$) ABORT_PARSE; } | simple_expr { $$ = $1; } ; simple_expr : simple_expr1 { $$ = $1; } | identifier PLUS_PLUS { $$ = make_postfix_op (PLUS_PLUS, $1, $2); } | identifier MINUS_MINUS { $$ = make_postfix_op (MINUS_MINUS, $1, $2); } | simple_expr QUOTE { $$ = make_unary_op (QUOTE, $1, $2); } | simple_expr TRANSPOSE { $$ = make_unary_op (TRANSPOSE, $1, $2); } | simple_expr POW simple_expr { $$ = make_binary_op (POW, $1, $2, $3); } | simple_expr EPOW simple_expr { $$ = make_binary_op (EPOW, $1, $2, $3); } | simple_expr '+' simple_expr { $$ = make_binary_op ('+', $1, $2, $3); } | simple_expr '-' simple_expr { $$ = make_binary_op ('-', $1, $2, $3); } | simple_expr '*' simple_expr { $$ = make_binary_op ('*', $1, $2, $3); } | simple_expr '/' simple_expr { $$ = make_binary_op ('/', $1, $2, $3); } | simple_expr EMUL simple_expr { $$ = make_binary_op (EMUL, $1, $2, $3); } | simple_expr EDIV simple_expr { $$ = make_binary_op (EDIV, $1, $2, $3); } | simple_expr LEFTDIV simple_expr { $$ = make_binary_op (LEFTDIV, $1, $2, $3); } | simple_expr ELEFTDIV simple_expr { $$ = make_binary_op (ELEFTDIV, $1, $2, $3); } | simple_expr EXPR_LT simple_expr { $$ = make_binary_op (EXPR_LT, $1, $2, $3); } | simple_expr EXPR_LE simple_expr { $$ = make_binary_op (EXPR_LE, $1, $2, $3); } | simple_expr EXPR_EQ simple_expr { $$ = make_binary_op (EXPR_EQ, $1, $2, $3); } | simple_expr EXPR_GE simple_expr { $$ = make_binary_op (EXPR_GE, $1, $2, $3); } | simple_expr EXPR_GT simple_expr { $$ = make_binary_op (EXPR_GT, $1, $2, $3); } | simple_expr EXPR_NE simple_expr { $$ = make_binary_op (EXPR_NE, $1, $2, $3); } | simple_expr EXPR_AND_AND simple_expr { $$ = make_binary_op (EXPR_AND_AND, $1, $2, $3); } | simple_expr EXPR_OR_OR simple_expr { $$ = make_binary_op (EXPR_OR_OR, $1, $2, $3); } | simple_expr EXPR_AND simple_expr { $$ = make_binary_op (EXPR_AND, $1, $2, $3); } | simple_expr EXPR_OR simple_expr { $$ = make_binary_op (EXPR_OR, $1, $2, $3); } ; simple_expr1 : NUM { tree_constant *tmp = new tree_constant ($1->number ()); tmp->stash_original_text ($1->text_rep ()); $$ = tmp; } | IMAG_NUM { Complex c (0.0, $1->number ()); tree_constant *tmp = new tree_constant (c); tmp->stash_original_text ($1->text_rep ()); $$ = tmp; } | TEXT { $$ = new tree_constant ($1->string ()); } | '(' expression ')' { $2->in_parens++; $$ = $2; } | word_list_cmd { $$ = $1; } | variable { $$ = $1; } | matrix { $$ = $1; } | '[' ']' { mlnm.pop (); $$ = new tree_constant (Matrix ()); } | '[' ';' ']' { mlnm.pop (); $$ = new tree_constant (Matrix ()); } | colon_expr { $$ = $1; } | PLUS_PLUS identifier %prec UNARY { $$ = make_prefix_op (PLUS_PLUS, $2, $1); } | MINUS_MINUS identifier %prec UNARY { $$ = make_prefix_op (MINUS_MINUS, $2, $1); } | EXPR_NOT simple_expr { $$ = make_unary_op (EXPR_NOT, $2, $1); } | '+' simple_expr %prec UNARY { $$ = $2; } | '-' simple_expr %prec UNARY { $$ = make_unary_op ('-', $2, $1); } ; colon_expr : simple_expr ':' simple_expr { $$ = new tree_colon_expression ($1, $3, $2->line (), $2->column ()); } | colon_expr ':' simple_expr { $$ = $1->chain ($3); if (! $$) ABORT_PARSE; } ; word_list_cmd : identifier word_list { $$ = new tree_index_expression ($1, $2, $1->line (), $1->column ()); } ; word_list : TEXT { tree_constant *tmp = new tree_constant ($1->string ()); $$ = new tree_argument_list (tmp); } | word_list TEXT { tree_constant *tmp = new tree_constant ($2->string ()); $1->append (tmp); } ; // This is truly disgusting. g_symtab : // empty { curr_sym_tab = global_sym_tab; } ; local_symtab : // empty { curr_sym_tab = tmp_local_sym_tab; } ; safe : // empty { maybe_screwed = 0; } ; are_we_screwed : // empty { maybe_screwed = 1; } ; func_def : FCN g_symtab are_we_screwed func_def1 { curr_sym_tab = top_level_sym_tab; defining_func = 0; $$ = 0; } | FCN g_symtab are_we_screwed func_def2 { curr_sym_tab = top_level_sym_tab; defining_func = 0; $$ = 0; } ; func_def1 : SCREW safe g_symtab '=' func_def2 { tree_identifier *tmp = new tree_identifier ($1->sym_rec (), $1->line (), $1->column ()); tree_parameter_list *tpl = new tree_parameter_list (tmp); tpl->mark_as_formal_parameters (); $$ = $5->define_ret_list (tpl); } | return_list g_symtab '=' func_def2 { $1->mark_as_formal_parameters (); $$ = $4->define_ret_list ($1); } ; return_list_x : '[' safe local_symtab ; return_list : return_list_x ']' { $$ = new tree_parameter_list (); } | return_list_x ELLIPSIS ']' { tree_parameter_list *tmp = new tree_parameter_list (); tmp->mark_varargs_only (); $$ = tmp; } | return_list1 ']' { $$ = $1; } | return_list1 ',' ELLIPSIS ']' { $1->mark_varargs (); $$ = $1; } ; return_list1 : return_list_x identifier { $$ = new tree_parameter_list ($2); } | return_list_x error { yyerror ("invalid function return list"); ABORT_PARSE; } | return_list1 ',' identifier { $1->append ($3); } ; func_def2 : identifier safe local_symtab func_def3 { char *id_name = $1->name (); // if (is_text_function_name (id_name)) // { // yyerror ("invalid use of reserved word %s", id_name); // ABORT_PARSE; // } // If input is coming from a file, issue a warning if the name of the // file does not match the name of the function stated in the file. // Matlab doesn't provide a diagnostic (it ignores the stated name). $4->stash_function_name (id_name); if (reading_fcn_file) { if (strcmp (curr_fcn_file_name, id_name) != 0) { warning ("function name `%s' does not agree\ with function file name `%s.m'", id_name, curr_fcn_file_name); global_sym_tab->rename (id_name, curr_fcn_file_name); if (error_state) ABORT_PARSE; id_name = $1->name (); } $4->stash_function_name (id_name); $4->stash_fcn_file_name (); $4->stash_fcn_file_time (time (0)); $4->mark_as_system_fcn_file (); } else if (! (input_from_tmp_history_file || input_from_startup_file) && reading_script_file && strcmp (curr_fcn_file_name, id_name) == 0) { warning ("function `%s' defined within\ script file `%s.m'", id_name, curr_fcn_file_name); } top_level_sym_tab->clear (id_name); $1->define ($4); $1->document (help_buf); $$ = $4; } ; func_def3 : param_list optsep opt_list fcn_end_or_eof { tree_function *fcn = new tree_function ($3, curr_sym_tab); $$ = fcn->define_param_list ($1); } | optsep opt_list fcn_end_or_eof { $$ = new tree_function ($2, curr_sym_tab); } ; fcn_end_or_eof : END { if (check_end ($1, token::function_end)) ABORT_PARSE; if (reading_fcn_file) check_for_garbage_after_fcn_def (); } | END_OF_INPUT { if (! (reading_fcn_file || reading_script_file)) YYABORT; } ; indirect_ref : indirect_ref1 { looking_at_indirect_ref = 0; $$ = $1; } indirect_ref1 : identifier { $$ = new tree_indirect_ref ($1, $1->line (), $1->column ()); } | indirect_ref1 '.' { looking_at_indirect_ref = 1; } TEXT_ID { $$ = $1->chain ($4->string ()); } ; variable : indirect_ref { $$ = make_index_expression ($1, 0); } | indirect_ref '(' ')' { $$ = make_index_expression ($1, 0); } | indirect_ref '(' arg_list ')' { $$ = make_index_expression ($1, $3); } | indirect_ref '[' { yyerror ("use `(\' and `)\' as index operators, not\ `[\' and `]\'"); $$ = 0; ABORT_PARSE; } ; param_list : '(' ')' { quote_is_transpose = 0; $$ = 0; } | '(' ELLIPSIS ')' { quote_is_transpose = 0; tree_parameter_list *tmp = new tree_parameter_list (); tmp->mark_varargs_only (); $$ = tmp; } | param_list1 ')' { quote_is_transpose = 0; $1->mark_as_formal_parameters (); } | param_list1 ',' ELLIPSIS ')' { quote_is_transpose = 0; $1->mark_as_formal_parameters (); $1->mark_varargs (); } ; param_list1 : '(' identifier { $$ = new tree_parameter_list ($2); } | param_list1 ',' identifier { $1->append ($3); } | '(' error { yyerror ("invalid parameter list"); ABORT_PARSE; } | param_list1 ',' error { yyerror ("invalid parameter list"); ABORT_PARSE; } ; identifier : NAME { $$ = new tree_identifier ($1->sym_rec (), $1->line (), $1->column ()); } ; arg_list : ':' { tree_constant *colon; tree_constant::magic_colon t; colon = new tree_constant (t); $$ = new tree_argument_list (colon); } | expression { $$ = new tree_argument_list ($1); } | ALL_VA_ARGS { tree_constant *all_va_args; tree_constant::all_va_args t; all_va_args = new tree_constant (t); $$ = new tree_argument_list (all_va_args); } | arg_list ',' ':' { tree_constant *colon; tree_constant::magic_colon t; colon = new tree_constant (t); $1->append (colon); } | arg_list ',' expression { $1->append ($3); } | arg_list ',' ALL_VA_ARGS { tree_constant *all_va_args; tree_constant::all_va_args t; all_va_args = new tree_constant (t); $1->append (all_va_args); } ; matrix : '[' screwed_again rows ']' { mlnm.pop (); maybe_screwed_again--; tree_matrix *tmp = ml.pop (); $$ = tmp->reverse (); } ; rows : matrix_row | rows ';' // Ignore trailing semicolon. | rows ';' matrix_row ; matrix_row : expression // First element on row. { if (mlnm.top ()) { mlnm.pop (); mlnm.push (0); tree_matrix *tmp = new tree_matrix ($1, tree_matrix::md_none); ml.push (tmp); } else { tree_matrix *tmp = ml.pop (); tmp = tmp->chain ($1, tree_matrix::md_down); ml.push (tmp); } } | matrix_row ',' // Ignore trailing comma. | matrix_row ',' expression { tree_matrix *tmp = ml.pop (); tmp = tmp->chain ($3, tree_matrix::md_right); ml.push (tmp); } ; %% // Generic error messages. static void yyerror (char *s) { char *line = current_input_line; int err_col = current_input_column - 1; if (err_col == 0 && line) err_col = strlen (line) + 1; ostrstream output_buf; if (reading_fcn_file || reading_script_file) output_buf << "parse error near line " << input_line_number << " of file " << curr_fcn_file_name << ".m:"; else output_buf << "parse error:"; if (s && strcmp (s, "parse error") != 0) output_buf << "\n\n " << s; output_buf << "\n\n"; if (line) { int len = strlen (line); if (line[len-1] == '\n') { len--; line[len] = '\0'; } // Print the line, maybe with a pointer near the error token. output_buf << " " << line << "\n"; if (err_col <= len) { for (int i = 0; i < err_col + 1; i++) output_buf << " "; output_buf << "^"; } } output_buf << "\n" << ends; char *msg = output_buf.str (); parse_error (msg); delete [] msg; } // Error mesages for mismatched end tokens. static void end_error (char *type, token::end_tok_type ettype, int l, int c) { static char *fmt = "`%s' command matched by `%s' near line %d column %d"; switch (ettype) { case token::simple_end: error (fmt, type, "end", l, c); break; case token::for_end: error (fmt, type, "endfor", l, c); break; case token::function_end: error (fmt, type, "endfunction", l, c); break; case token::if_end: error (fmt, type, "endif", l, c); break; case token::while_end: error (fmt, type, "endwhile", l, c); break; default: panic_impossible (); break; } } // Check to see that end tokens are properly matched. static int check_end (token *tok, token::end_tok_type expected) { token::end_tok_type ettype = tok->ettype (); if (ettype != expected && ettype != token::simple_end) { yyerror ("parse error"); int l = tok->line (); int c = tok->column (); switch (expected) { case token::for_end: end_error ("for", ettype, l, c); break; case token::function_end: end_error ("function", ettype, l, c); break; case token::if_end: end_error ("if", ettype, l, c); break; case token::while_end: end_error ("while", ettype, l, c); break; default: panic_impossible (); break; } return 1; } else return 0; } // Try to figure out early if an expression should become an // assignment to the builtin variable ans. // // Need to make sure that the expression isn't already an identifier // that has a name, or an assignment expression. // // Note that an expression can't be just an identifier anymore -- it // must at least be an index expression (see the definition of the // non-terminal `variable' above). // // XXX FIXME XXX. This isn't quite sufficient. For example, try the // command `x = 4, x' for `x' previously undefined. // // XXX FIXME XXX -- we should probably delay doing this until eval-time. static tree_expression * maybe_convert_to_ans_assign (tree_expression *expr) { if (expr->is_index_expression ()) { expr->mark_for_possible_ans_assign (); return expr; } else if (expr->is_assignment_expression () || expr->is_prefix_expression ()) { return expr; } else { symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); assert (sr); tree_identifier *ans = new tree_identifier (sr); return new tree_simple_assignment_expression (ans, expr, 0, 1); } } // Maybe print a warning if an assignment expression is used as the // test in a logical expression. static void maybe_warn_assign_as_truth_value (tree_expression *expr) { if (user_pref.warn_assign_as_truth_value && expr->is_assignment_expression () && expr->in_parens < 2) { warning ("suggest parenthesis around assignment used as truth value"); } } // Build a binary expression. static tree_expression * make_binary_op (int op, tree_expression *op1, token *tok_val, tree_expression *op2) { tree_expression::type t; switch (op) { case POW: t = tree_expression::power; break; case EPOW: t = tree_expression::elem_pow; break; case '+': t = tree_expression::add; break; case '-': t = tree_expression::subtract; break; case '*': t = tree_expression::multiply; break; case '/': t = tree_expression::divide; break; case EMUL: t = tree_expression::el_mul; break; case EDIV: t = tree_expression::el_div; break; case LEFTDIV: t = tree_expression::leftdiv; break; case ELEFTDIV: t = tree_expression::el_leftdiv; break; case EXPR_LT: t = tree_expression::cmp_lt; break; case EXPR_LE: t = tree_expression::cmp_le; break; case EXPR_EQ: t = tree_expression::cmp_eq; break; case EXPR_GE: t = tree_expression::cmp_ge; break; case EXPR_GT: t = tree_expression::cmp_gt; break; case EXPR_NE: t = tree_expression::cmp_ne; break; case EXPR_AND_AND: t = tree_expression::and_and; break; case EXPR_OR_OR: t = tree_expression::or_or; break; case EXPR_AND: t = tree_expression::and; break; case EXPR_OR: t = tree_expression::or; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_binary_expression (op1, op2, t, l, c); } // Build a prefix expression. static tree_expression * make_prefix_op (int op, tree_identifier *op1, token *tok_val) { tree_expression::type t; switch (op) { case PLUS_PLUS: t = tree_expression::increment; break; case MINUS_MINUS: t = tree_expression::decrement; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_prefix_expression (op1, t, l, c); } // Build a postfix expression. static tree_expression * make_postfix_op (int op, tree_identifier *op1, token *tok_val) { tree_expression::type t; switch (op) { case PLUS_PLUS: t = tree_expression::increment; break; case MINUS_MINUS: t = tree_expression::decrement; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_postfix_expression (op1, t, l, c); } // Build a unary expression. static tree_expression * make_unary_op (int op, tree_expression *op1, token *tok_val) { tree_expression::type t; switch (op) { case QUOTE: t = tree_expression::hermitian; break; case TRANSPOSE: t = tree_expression::transpose; break; case EXPR_NOT: t = tree_expression::not; break; case '-': t = tree_expression::uminus; break; default: panic_impossible (); break; } int l = tok_val->line (); int c = tok_val->column (); return new tree_unary_expression (op1, t, l, c); } // Make an expression that handles assignment of multiple values. static tree_expression * make_multi_val_ret (tree_expression *rhs, int l, int c) { // Convert the matrix list to a list of identifiers. If that fails, // we can abort here, without losing anything -- no other possible // syntax is valid if we've seen the equals sign as the next token // after the `]'. tree_expression *retval = 0; maybe_screwed_again--; tree_matrix *tmp = ml.pop (); tmp = tmp->reverse (); tree_return_list *id_list = tmp->to_return_list (); if (id_list) { int list_len = id_list->length (); if (list_len == 1) { tree_index_expression *lhs = id_list->remove_front (); retval = new tree_simple_assignment_expression (lhs, rhs, 0, 0, l, c); } else if (list_len > 1) { if (rhs->is_multi_val_ret_expression ()) { tree_multi_val_ret *t = (tree_multi_val_ret *) rhs; retval = new tree_multi_assignment_expression (id_list, t, l, c); } else yyerror ("RHS must be an expression that returns multiple values"); } else panic_impossible (); } else yyerror ("invalid identifier list for assignment"); return retval; } static tree_index_expression * make_index_expression (tree_indirect_ref *indir, tree_argument_list *args) { tree_index_expression *retval = 0; int l = indir->line (); int c = indir->column (); if (indir->is_identifier_only ()) { indir->preserve_identifier (); retval = new tree_index_expression (indir->ident (), args, l, c); delete indir; } else retval = new tree_index_expression (indir, args, l, c); return retval; } octave-1.1.0/src/pr-output.cc100666 415 17 65020 5702417020 14234 0ustar jweusers// pr-output.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include #include "dMatrix.h" #include "CMatrix.h" #include "Range.h" #include "tree-const.h" #include "variables.h" #include "user-prefs.h" #include "pr-output.h" #include "mappers.h" #include "pager.h" #include "help.h" #include "error.h" #include "utils.h" #include "defun.h" // Current format string for real numbers and the real part of complex // numbers. static char *curr_real_fmt = 0; // Current format string for the imaginary part of complex numbers. static char *curr_imag_fmt = 0; // Nonzero means don\'t do any fancy formatting. static int free_format = 0; // Nonzero means print plus sign for nonzero, blank for zero. static int plus_format = 0; // Nonzero means always print like dollars and cents. static int bank_format = 0; // Nonzero means use an e format. static int print_e = 0; // Nonzero means print E instead of e for exponent field. static int print_big_e = 0; static int any_element_is_negative (const Matrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) if (a.elem (i, j) < 0.0) return 1; return 0; } static int any_element_is_inf_or_nan (const Matrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double val = a.elem (i, j); if (xisinf (val) || xisnan (val)) return 1; } return 0; } static int any_element_is_inf_or_nan (const ComplexMatrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { Complex val = a.elem (i, j); if (xisinf (val) || xisnan (val)) return 1; } return 0; } static int all_elements_are_int_or_inf_or_nan (const Matrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double val = a.elem (i, j); if (xisnan (val) || D_NINT (val) == val) continue; else return 0; } return 1; } static Matrix abs (const Matrix& a) { int nr = a.rows (); int nc = a.columns (); Matrix retval (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) retval.elem (i, j) = fabs (a.elem (i, j)); return retval; } static double pr_max_internal (const Matrix& m) { int nr = m.rows (); int nc = m.columns (); double result = DBL_MIN; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double val = m.elem (i, j); if (xisinf (val) || xisnan (val)) continue; if (val > result) result = val; } return result; } static double pr_min_internal (const Matrix& m) { int nr = m.rows (); int nc = m.columns (); double result = DBL_MAX; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { double val = m.elem (i, j); if (xisinf (val) || xisnan (val)) continue; if (val < result) result = val; } return result; } static void set_format (double d, int& fw) { curr_real_fmt = 0; curr_imag_fmt = 0; if (free_format) return; static char fmt_buf[128]; int sign = (d < 0.0); int inf_or_nan = (xisinf (d) || xisnan (d)); double d_abs = d < 0.0 ? -d : d; int digits = (inf_or_nan || d_abs == 0.0) ? 0 : (int) floor (log10 (d_abs) + 1.0); int prec = user_pref.output_precision; int ld, rd; if (bank_format) { fw = digits < 0 ? 4 : digits + 3; if (inf_or_nan && fw < 3) fw = 3; fw += sign; rd = 2; } else if (xisnan (d) || D_NINT (d) == d) { fw = digits; if (inf_or_nan && fw < 3) fw = 3; fw += sign; rd = 0; } else { if (digits > 0) { ld = digits; rd = prec - digits; digits++; } else { ld = 1; rd = prec - digits; digits = -digits + 1; } fw = ld + 1 + rd; if (inf_or_nan && fw < 3) fw = 3; fw += sign; } if (! bank_format && (fw > user_pref.output_max_field_width || print_e)) { int exp_field = 4; if (digits > 100) exp_field++; fw = 2 + prec + exp_field; if (inf_or_nan && fw < 3) fw = 3; fw += sign; if (print_big_e) sprintf (fmt_buf, "%%%d.%dE", fw, prec - 1); else sprintf (fmt_buf, "%%%d.%de", fw, prec - 1); } else { sprintf (fmt_buf, "%%%d.%df", fw, rd); } curr_real_fmt = &fmt_buf[0]; } static inline void set_format (double d) { int fw; set_format (d, fw); } static void set_format (const Matrix& m, int& fw) { curr_real_fmt = 0; curr_imag_fmt = 0; if (free_format) return; static char fmt_buf[128]; int sign = any_element_is_negative (m); int inf_or_nan = any_element_is_inf_or_nan (m); Matrix m_abs = abs (m); double max_abs = pr_max_internal (m_abs); double min_abs = pr_min_internal (m_abs); int x_max = max_abs == 0.0 ? 0 : (int) floor (log10 (max_abs) + 1.0); int x_min = min_abs == 0.0 ? 0 : (int) floor (log10 (min_abs) + 1.0); int prec = user_pref.output_precision; int ld, rd; if (bank_format) { int digits = x_max > x_min ? x_max : x_min; fw = digits <= 0 ? 4 : digits + 3; if (inf_or_nan && fw < 3) fw = 3; fw += sign; rd = 2; } else if (all_elements_are_int_or_inf_or_nan (m)) { int digits = x_max > x_min ? x_max : x_min; fw = digits <= 0 ? 1 : digits; if (inf_or_nan && fw < 3) fw = 3; fw += sign; rd = 0; } else { int ld_max, rd_max; if (x_max > 0) { ld_max = x_max; rd_max = prec - x_max; x_max++; } else { ld_max = 1; rd_max = prec - x_max; x_max = -x_max + 1; } int ld_min, rd_min; if (x_min > 0) { ld_min = x_min; rd_min = prec - x_min; x_min++; } else { ld_min = 1; rd_min = prec - x_min; x_min = -x_min + 1; } ld = ld_max > ld_min ? ld_max : ld_min; rd = rd_max > rd_min ? rd_max : rd_min; fw = ld + 1 + rd; if (inf_or_nan && fw < 3) fw = 3; fw += sign; } if (! bank_format && (fw > user_pref.output_max_field_width || print_e)) { int exp_field = 4; if (x_max > 100 || x_min > 100) exp_field++; fw = 2 + prec + exp_field; if (inf_or_nan && fw < 3) fw = 3; fw += sign; if (print_big_e) sprintf (fmt_buf, "%%%d.%dE", fw, prec - 1); else sprintf (fmt_buf, "%%%d.%de", fw, prec - 1); } else { sprintf (fmt_buf, "%%%d.%df", fw, rd); } curr_real_fmt = &fmt_buf[0]; } static inline void set_format (const Matrix& m) { int fw; set_format (m, fw); } static void set_format (const Complex& c, int& r_fw, int& i_fw) { curr_real_fmt = 0; curr_imag_fmt = 0; if (free_format) return; static char r_fmt_buf[128]; static char i_fmt_buf[128]; double rp = c.real (); double ip = c.imag (); int sign = (rp < 0.0); int inf_or_nan = (xisinf (c) || xisnan (c)); double r_abs = rp < 0.0 ? -rp : rp; double i_abs = ip < 0.0 ? -ip : ip; int r_x = r_abs == 0.0 ? 0 : (int) floor (log10 (r_abs) + 1.0); int i_x = i_abs == 0.0 ? 0 : (int) floor (log10 (i_abs) + 1.0); int x_max, x_min; if (r_x > i_x) { x_max = r_x; x_min = i_x; } else { x_max = i_x; x_min = r_x; } int prec = user_pref.output_precision; int ld, rd; if (bank_format) { int digits = r_x; i_fw = 0; r_fw = digits <= 0 ? 4 : digits + 3; if (inf_or_nan && r_fw < 3) r_fw = 3; r_fw += sign; rd = 2; } else if (inf_or_nan || (D_NINT (rp) == rp && D_NINT (ip) == ip)) { int digits = x_max > x_min ? x_max : x_min; i_fw = r_fw = digits <= 0 ? 1 : digits; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; rd = 0; } else { int ld_max, rd_max; if (x_max > 0) { ld_max = x_max; rd_max = prec - x_max; x_max++; } else { ld_max = 1; rd_max = prec - x_max; x_max = -x_max + 1; } int ld_min, rd_min; if (x_min > 0) { ld_min = x_min; rd_min = prec - x_min; x_min++; } else { ld_min = 1; rd_min = prec - x_min; x_min = -x_min + 1; } ld = ld_max > ld_min ? ld_max : ld_min; rd = rd_max > rd_min ? rd_max : rd_min; i_fw = r_fw = ld + 1 + rd; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; } if (! bank_format && (r_fw > user_pref.output_max_field_width || print_e)) { int exp_field = 4; if (x_max > 100 || x_min > 100) exp_field++; i_fw = r_fw = 1 + prec + exp_field; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; if (print_big_e) { sprintf (r_fmt_buf, "%%%d.%dE", r_fw, prec - 1); sprintf (i_fmt_buf, "%%%d.%dE", i_fw, prec - 1); } else { sprintf (r_fmt_buf, "%%%d.%de", r_fw, prec - 1); sprintf (i_fmt_buf, "%%%d.%de", i_fw, prec - 1); } } else { sprintf (r_fmt_buf, "%%%d.%df", r_fw, rd); sprintf (i_fmt_buf, "%%%d.%df", i_fw, rd); } curr_real_fmt = &r_fmt_buf[0]; curr_imag_fmt = &i_fmt_buf[0]; } static inline void set_format (const Complex& c) { int r_fw, i_fw; set_format (c, r_fw, i_fw); } static void set_format (const ComplexMatrix& cm, int& r_fw, int& i_fw) { curr_real_fmt = 0; curr_imag_fmt = 0; if (free_format) return; static char r_fmt_buf[128]; static char i_fmt_buf[128]; Matrix rp = real (cm); Matrix ip = imag (cm); int sign = any_element_is_negative (rp); int inf_or_nan = any_element_is_inf_or_nan (cm); Matrix r_m_abs = abs (rp); double r_max_abs = pr_max_internal (r_m_abs); double r_min_abs = pr_min_internal (r_m_abs); Matrix i_m_abs = abs (ip); double i_max_abs = pr_max_internal (i_m_abs); double i_min_abs = pr_min_internal (i_m_abs); int r_x_max = r_max_abs == 0.0 ? 0 : (int) floor (log10 (r_max_abs) + 1.0); int r_x_min = r_min_abs == 0.0 ? 0 : (int) floor (log10 (r_min_abs) + 1.0); int i_x_max = i_max_abs == 0.0 ? 0 : (int) floor (log10 (i_max_abs) + 1.0); int i_x_min = i_min_abs == 0.0 ? 0 : (int) floor (log10 (i_min_abs) + 1.0); int x_max = r_x_max > i_x_max ? r_x_max : i_x_max; int x_min = r_x_min > i_x_min ? r_x_min : i_x_min; int prec = user_pref.output_precision; int ld, rd; if (bank_format) { int digits = r_x_max > r_x_min ? r_x_max : r_x_min; i_fw = 0; r_fw = digits <= 0 ? 4 : digits + 3; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; rd = 2; } else if (all_elements_are_int_or_inf_or_nan (rp) && all_elements_are_int_or_inf_or_nan (ip)) { int digits = x_max > x_min ? x_max : x_min; i_fw = r_fw = digits <= 0 ? 1 : digits; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; rd = 0; } else { int ld_max, rd_max; if (x_max > 0) { ld_max = x_max; rd_max = prec - x_max; x_max++; } else { ld_max = 1; rd_max = prec - x_max; x_max = -x_max + 1; } int ld_min, rd_min; if (x_min > 0) { ld_min = x_min; rd_min = prec - x_min; x_min++; } else { ld_min = 1; rd_min = prec - x_min; x_min = -x_min + 1; } ld = ld_max > ld_min ? ld_max : ld_min; rd = rd_max > rd_min ? rd_max : rd_min; i_fw = r_fw = ld + 1 + rd; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; } if (! bank_format && (r_fw > user_pref.output_max_field_width || print_e)) { int exp_field = 4; if (x_max > 100 || x_min > 100) exp_field++; i_fw = r_fw = 1 + prec + exp_field; if (inf_or_nan && i_fw < 3) i_fw = r_fw = 3; r_fw += sign; if (print_big_e) { sprintf (r_fmt_buf, "%%%d.%dE", r_fw, prec - 1); sprintf (i_fmt_buf, "%%%d.%dE", i_fw, prec - 1); } else { sprintf (r_fmt_buf, "%%%d.%de", r_fw, prec - 1); sprintf (i_fmt_buf, "%%%d.%de", i_fw, prec - 1); } } else { sprintf (r_fmt_buf, "%%%d.%df", r_fw, rd); sprintf (i_fmt_buf, "%%%d.%df", i_fw, rd); } curr_real_fmt = &r_fmt_buf[0]; curr_imag_fmt = &i_fmt_buf[0]; } static int all_elements_are_ints (const Range& r) { // If the base and increment are ints, the final value in the range // will also be an integer, even if the limit is not. double b = r.base (); double i = r.inc (); return ((double) NINT (b) == b && (double) NINT (i) == i); } static inline void set_format (const ComplexMatrix& cm) { int r_fw, i_fw; set_format (cm, r_fw, i_fw); } static void set_format (const Range& r, int& fw) { curr_real_fmt = 0; curr_imag_fmt = 0; if (free_format) return; static char fmt_buf[128]; double r_min = r.base (); double r_max = r.limit (); if (r_max < r_min) { double tmp = r_max; r_max = r_min; r_min = tmp; } int sign = (r_min < 0.0); double max_abs = r_max < 0.0 ? -r_max : r_max; double min_abs = r_min < 0.0 ? -r_min : r_min; int x_max = max_abs == 0.0 ? 0 : (int) floor (log10 (max_abs) + 1.0); int x_min = min_abs == 0.0 ? 0 : (int) floor (log10 (min_abs) + 1.0); int prec = user_pref.output_precision; int ld, rd; if (bank_format) { int digits = x_max > x_min ? x_max : x_min; fw = sign + digits < 0 ? 4 : digits + 3; rd = 2; } else if (all_elements_are_ints (r)) { int digits = x_max > x_min ? x_max : x_min; fw = sign + digits; rd = 0; } else { int ld_max, rd_max; if (x_max > 0) { ld_max = x_max; rd_max = prec - x_max; x_max++; } else { ld_max = 1; rd_max = prec - x_max; x_max = -x_max + 1; } int ld_min, rd_min; if (x_min > 0) { ld_min = x_min; rd_min = prec - x_min; x_min++; } else { ld_min = 1; rd_min = prec - x_min; x_min = -x_min + 1; } ld = ld_max > ld_min ? ld_max : ld_min; rd = rd_max > rd_min ? rd_max : rd_min; fw = sign + ld + 1 + rd; } if (! bank_format && (fw > user_pref.output_max_field_width || print_e)) { int exp_field = 4; if (x_max > 100 || x_min > 100) exp_field++; fw = sign + 2 + prec + exp_field; if (print_big_e) sprintf (fmt_buf, "%%%d.%dE", fw, prec - 1); else sprintf (fmt_buf, "%%%d.%de", fw, prec - 1); } else { sprintf (fmt_buf, "%%%d.%df", fw, rd); } curr_real_fmt = &fmt_buf[0]; } static inline void set_format (const Range& r) { int fw; set_format (r, fw); } static inline void pr_any_float (const char *fmt, ostream& os, double d, int fw = 0) { if (d == -0.0) d = 0.0; if (fmt) { if (xisinf (d)) { char *s; if (d < 0.0) s = "-Inf"; else s = "Inf"; if (fw > 0) os.form ("%*s", fw, s); else os << s; } else if (xisnan (d)) { if (fw > 0) os.form ("%*s", fw, "NaN"); else os << "NaN"; } else os.form (fmt, d); } else os << d; } static inline void pr_float (ostream& os, double d, int fw = 0) { pr_any_float (curr_real_fmt, os, d, fw); } static inline void pr_imag_float (ostream& os, double d, int fw = 0) { pr_any_float (curr_imag_fmt, os, d, fw); } static inline void pr_complex (ostream& os, const Complex& c, int r_fw = 0, int i_fw = 0) { double r = c.real (); pr_float (os, r, r_fw); if (! bank_format) { double i = c.imag (); if (i < 0) { os << " - "; i = -i; pr_imag_float (os, i, i_fw); } else { os << " + "; pr_imag_float (os, i, i_fw); } os << "i"; } } static void print_empty_matrix (ostream& os, int nr, int nc, int pr_as_read_syntax) { assert (nr == 0 || nc == 0); if (pr_as_read_syntax) { if (nr == 0 && nc == 0) os << "[]"; else os << "zeros (" << nr << ", " << nc << ")"; } else { os << "[]"; if (user_pref.print_empty_dimensions) os << "(" << nr << "x" << nc << ")"; os << "\n"; } } void octave_print_internal (ostream& os, double d, int pr_as_read_syntax) { if (plus_format) { if (d == 0.0) os << " "; else os << "+"; } else { set_format (d); if (free_format) os << d; else pr_float (os, d); } if (! pr_as_read_syntax) os << "\n"; } void octave_print_internal (ostream& os, const Matrix& m, int pr_as_read_syntax) { int nr = m.rows (); int nc = m.columns (); if (nr == 0 || nc == 0) print_empty_matrix (os, nr, nc, pr_as_read_syntax); else if (plus_format && ! pr_as_read_syntax) { for (int i = 0; i < nr; i++) { for (int j = 0; j < nc; j++) { if (j == 0) os << " "; if (m.elem (i, j) == 0.0) os << " "; else os << "+"; } os << "\n"; } } else { int fw; set_format (m, fw); int column_width = fw + 2; int total_width = nc * column_width; int max_width = terminal_columns (); if (pr_as_read_syntax) max_width -= 4; if (free_format) { if (pr_as_read_syntax) os << "[\n"; os << m; if (pr_as_read_syntax) os << "]"; return; } int inc = nc; if (total_width > max_width && user_pref.split_long_rows) { inc = max_width / column_width; if (inc == 0) inc++; } if (pr_as_read_syntax) { for (int i = 0; i < nr; i++) { int col = 0; while (col < nc) { int lim = col + inc < nc ? col + inc : nc; for (int j = col; j < lim; j++) { if (i == 0 && j == 0) os << "[ "; else { if (j > col && j < lim) os << ", "; else os << " "; } pr_float (os, m.elem (i, j)); } col += inc; if (col >= nc) { if (i == nr - 1) os << " ]"; else os << ";\n"; } else os << " ...\n"; } } } else { for (int col = 0; col < nc; col += inc) { int lim = col + inc < nc ? col + inc : nc; if (total_width > max_width && user_pref.split_long_rows) { if (col != 0) os << "\n"; int num_cols = lim - col; if (num_cols == 1) os << " Column " << col + 1 << ":\n\n"; else if (num_cols == 2) os << " Columns " << col + 1 << " and " << lim << ":\n\n"; else os << " Columns " << col + 1 << " through " << lim << ":\n\n"; } for (int i = 0; i < nr; i++) { for (int j = col; j < lim; j++) { os << " "; pr_float (os, m.elem (i, j), fw); } os << "\n"; } } } } } void octave_print_internal (ostream& os, const Complex& c, int pr_as_read_syntax) { if (plus_format) { if (c == 0.0) os << " "; else os << "+"; } else { set_format (c); if (free_format) os << c; else pr_complex (os, c); } if (! pr_as_read_syntax) os << "\n"; } void octave_print_internal (ostream& os, const ComplexMatrix& cm, int pr_as_read_syntax) { int nr = cm.rows (); int nc = cm.columns (); if (nr == 0 || nc == 0) print_empty_matrix (os, nr, nc, pr_as_read_syntax); else if (plus_format && ! pr_as_read_syntax) { for (int i = 0; i < nr; i++) { for (int j = 0; j < nc; j++) { if (j == 0) os << " "; if (cm.elem (i, j) == 0.0) os << " "; else os << "+"; } os << "\n"; } } else { int r_fw, i_fw; set_format (cm, r_fw, i_fw); int column_width = i_fw + r_fw; column_width += bank_format ? 2 : 7; int total_width = nc * column_width; int max_width = terminal_columns (); if (pr_as_read_syntax) max_width -= 4; if (free_format) { if (pr_as_read_syntax) os << "[\n"; os << cm; if (pr_as_read_syntax) os << "]"; return; } int inc = nc; if (total_width > max_width && user_pref.split_long_rows) { inc = max_width / column_width; if (inc == 0) inc++; } if (pr_as_read_syntax) { for (int i = 0; i < nr; i++) { int col = 0; while (col < nc) { int lim = col + inc < nc ? col + inc : nc; for (int j = col; j < lim; j++) { if (i == 0 && j == 0) os << "[ "; else { if (j > col && j < lim) os << ", "; else os << " "; } pr_complex (os, cm.elem (i, j)); } col += inc; if (col >= nc) { if (i == nr - 1) os << " ]"; else os << ";\n"; } else os << " ...\n"; } } } else { for (int col = 0; col < nc; col += inc) { int lim = col + inc < nc ? col + inc : nc; if (total_width > max_width && user_pref.split_long_rows) { if (col != 0) os << "\n"; int num_cols = lim - col; if (num_cols == 1) os << " Column " << col + 1 << ":\n\n"; else if (num_cols == 2) os << " Columns " << col + 1 << " and " << lim << ":\n\n"; else os << " Columns " << col + 1 << " through " << lim << ":\n\n"; } for (int i = 0; i < nr; i++) { for (int j = col; j < lim; j++) { os << " "; pr_complex (os, cm.elem (i, j)); } os << "\n"; } } } } } void octave_print_internal (ostream& os, const Range& r, int pr_as_read_syntax) { double base = r.base (); double increment = r.inc (); double limit = r.limit (); int num_elem = r.nelem (); if (plus_format && ! pr_as_read_syntax) { os << " "; for (int i = 0; i < num_elem; i++) { double val = base + i * increment; if (val == 0.0) os << " "; else os << "+"; } } else { int fw; set_format (r, fw); if (pr_as_read_syntax) { if (free_format) { os << base << " : "; if (increment != 1.0) os << increment << " : "; os << limit; } else { pr_float (os, base, fw); os << " : "; if (increment != 1.0) { pr_float (os, increment, fw); os << " : "; } pr_float (os, limit, fw); } } else { int column_width = fw + 2; int total_width = num_elem * column_width; int max_width = terminal_columns (); if (free_format) { os << r; return; } int inc = num_elem; if (total_width > max_width && user_pref.split_long_rows) { inc = max_width / column_width; if (inc == 0) inc++; } int col = 0; while (col < num_elem) { int lim = col + inc < num_elem ? col + inc : num_elem; if (total_width > max_width && user_pref.split_long_rows) { if (col != 0) os << "\n"; int num_cols = lim - col; if (num_cols == 1) os << " Column " << col + 1 << ":\n\n"; else if (num_cols == 2) os << " Columns " << col + 1 << " and " << lim << ":\n\n"; else os << " Columns " << col + 1 << " through " << lim << ":\n\n"; } for (int i = col; i < lim; i++) { double val = base + i * increment; os << " "; pr_float (os, val, fw); } os << "\n"; col += inc; } } } } DEFUN ("disp", Fdisp, Sdisp, 1, 1, "disp (X): display value without name tag") { Octave_object retval; int nargin = args.length (); if (nargin == 1) args(0).eval (1); else print_usage ("disp"); return retval; } static void init_format_state (void) { free_format = 0; plus_format = 0; bank_format = 0; print_e = 0; print_big_e = 0; } static void set_output_prec_and_fw (int prec, int fw) { tree_constant *tmp = 0; tmp = new tree_constant ((double) prec); bind_builtin_variable ("output_precision", tmp); tmp = new tree_constant ((double) fw); bind_builtin_variable ("output_max_field_width", tmp); } void set_format_style (int argc, char **argv) { if (--argc > 0) { argv++; if (*argv[0]) { if (strcmp (*argv, "short") == 0) { if (--argc > 0) { argv++; if (strcmp (*argv, "e") == 0) { init_format_state (); print_e = 1; } else if (strcmp (*argv, "E") == 0) { init_format_state (); print_e = 1; print_big_e = 1; } else { error ("format: unrecognized option `short %s'", *argv); return; } } else init_format_state (); set_output_prec_and_fw (3, 8); } else if (strcmp (*argv, "long") == 0) { if (--argc > 0) { argv++; if (strcmp (*argv, "e") == 0) { init_format_state (); print_e = 1; } else if (strcmp (*argv, "E") == 0) { init_format_state (); print_e = 1; print_big_e = 1; } else { error ("format: unrecognized option `long %s'", *argv); return; } } else init_format_state (); set_output_prec_and_fw (15, 24); } else if (strcmp (*argv, "hex") == 0) error ("format: format state `hex' not implemented yet"); else if (strcmp (*argv, "+") == 0) { init_format_state (); plus_format = 1; } else if (strcmp (*argv, "bank") == 0) { init_format_state (); bank_format = 1; } else if (strcmp (*argv, "free") == 0) { init_format_state (); free_format = 1; } else if (strcmp (*argv, "none") == 0) { init_format_state (); free_format = 1; } else if (strcmp (*argv, "compact") == 0) error ("format: format state `compact' not implemented yet"); else if (strcmp (*argv, "loose") == 0) error ("format: format state `loose' not implemented yet"); else error ("format: unrecognized format state `%s'", *argv); } else usage ("format [format_state]"); } else { init_format_state (); set_output_prec_and_fw (5, 10); } } DEFUN_TEXT ("format", Fformat, Sformat, -1, 1, "format [style]\n\ \n\ set output formatting style") { Octave_object retval; DEFINE_ARGV("format"); set_format_style (argc, argv); DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/procstream.cc100666 415 17 2705 5702417016 14422 0ustar jweusers// procstream.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "procstream.h" procstreambase::procstreambase (void) { init (new procbuf ()); } procstreambase::procstreambase (const char *command, int mode) { init (new procbuf ()); if (! rdbuf()->open (command, mode)) set (ios::badbit); } void procstreambase::open (const char *command, int mode) { clear (); if (! rdbuf()->open (command, mode)) set (ios::badbit); } int procstreambase::close (void) { int status = rdbuf()->sys_close (); if (! rdbuf()->close ()) set (ios::failbit); return status; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/sighandlers.cc100666 415 17 16571 5702417015 14573 0ustar jweusers// sighandlers.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include "sighandlers.h" #include "octave.h" #include "error.h" #include "utils.h" // Nonzero means we have already printed a message for this series of // SIGPIPES. We assume that the writer will eventually give up. int pipe_handler_error_count = 0; // Nonzero means we can be interrupted. int can_interrupt = 0; static void my_friendly_exit (const char *sig_name, int sig_number) { error ("%s -- stopping myself...", sig_name); clean_up_and_exit (sig_number); } // I know, not really a signal handler. static void octave_new_handler (void) { error ("new: virtual memory exhausted -- stopping myself"); clean_up_and_exit (1); } static RETSIGTYPE generic_sig_handler (int i) { my_friendly_exit (sys_siglist[i], i); #if RETSIGTYPE == void return; #else return 0; #endif } // Handle SIGINT by restarting the parser (see octave.cc). // XXX FIXME XXX -- it would probably be good to try to use POSIX // signal interface if it is available. static RETSIGTYPE sigint_handler (int i) { // Can this ever cause trouble on systems that don't forget signal // handlers when they are invoked? signal (SIGINT, sigint_handler); if (can_interrupt) { jump_to_top_level (); panic_impossible (); } #if RETSIGTYPE == void return; #else return 0; #endif } static RETSIGTYPE sigpipe_handler (int i) { // Can this ever cause trouble on systems that don't forget signal // handlers when they are invoked? signal (SIGPIPE, sigpipe_handler); if (pipe_handler_error_count++ == 0) message (0, "broken pipe"); // Don\'t loop forever on account of this. if (pipe_handler_error_count > 100) jump_to_top_level (); #if RETSIGTYPE == void return; #else return 0; #endif } // Install all the handlers for the signals we might care about. void install_signal_handlers (void) { set_new_handler (octave_new_handler); #ifdef SIGABRT signal (SIGABRT, generic_sig_handler); #endif #ifdef SIGALRM signal (SIGALRM, generic_sig_handler); #endif #ifdef SIGBUS signal (SIGBUS, generic_sig_handler); #endif #ifdef SIGEMT signal (SIGEMT, generic_sig_handler); #endif #ifdef SIGFPE signal (SIGFPE, generic_sig_handler); #endif #ifdef SIGHUP signal (SIGHUP, generic_sig_handler); #endif #ifdef SIGILL signal (SIGILL, generic_sig_handler); #endif #ifdef SIGINT signal (SIGINT, sigint_handler); #endif #ifdef SIGIOT signal (SIGIOT, generic_sig_handler); #endif #ifdef SIGLOST signal (SIGLOST, generic_sig_handler); #endif #ifdef SIGPIPE signal (SIGPIPE, sigpipe_handler); #endif #ifdef SIGPOLL signal (SIGPOLL, SIG_IGN); #endif #ifdef SIGPROF signal (SIGPROF, generic_sig_handler); #endif #ifdef SIGQUIT signal (SIGQUIT, generic_sig_handler); #endif #ifdef SIGSEGV signal (SIGSEGV, generic_sig_handler); #endif #ifdef SIGSYS signal (SIGSYS, generic_sig_handler); #endif #ifdef SIGTERM signal (SIGTERM, generic_sig_handler); #endif #ifdef SIGTRAP signal (SIGTRAP, generic_sig_handler); #endif #ifdef SIGUSR1 signal (SIGUSR1, generic_sig_handler); #endif #ifdef SIGUSR2 signal (SIGUSR2, generic_sig_handler); #endif #ifdef SIGVTALRM signal (SIGVTALRM, generic_sig_handler); #endif #ifdef SIGIO signal (SIGIO, SIG_IGN); #endif #ifdef SIGXCPU signal (SIGXCPU, generic_sig_handler); #endif #ifdef SIGXFSZ signal (SIGXFSZ, generic_sig_handler); #endif } #ifndef HAVE_SYS_SIGLIST char *sys_siglist[NSIG + 1] = { #ifdef AIX /* AIX has changed the signals a bit */ "bogus signal", /* 0 */ "hangup", /* 1 SIGHUP */ "interrupt", /* 2 SIGINT */ "quit", /* 3 SIGQUIT */ "illegal instruction", /* 4 SIGILL */ "trace trap", /* 5 SIGTRAP */ "IOT instruction", /* 6 SIGIOT */ "crash likely", /* 7 SIGDANGER */ "floating point exception", /* 8 SIGFPE */ "kill", /* 9 SIGKILL */ "bus error", /* 10 SIGBUS */ "segmentation violation", /* 11 SIGSEGV */ "bad argument to system call", /* 12 SIGSYS */ "write on a pipe with no one to read it", /* 13 SIGPIPE */ "alarm clock", /* 14 SIGALRM */ "software termination signum", /* 15 SIGTERM */ "user defined signal 1", /* 16 SIGUSR1 */ "user defined signal 2", /* 17 SIGUSR2 */ "death of a child", /* 18 SIGCLD */ "power-fail restart", /* 19 SIGPWR */ "bogus signal", /* 20 */ "bogus signal", /* 21 */ "bogus signal", /* 22 */ "bogus signal", /* 23 */ "bogus signal", /* 24 */ "LAN I/O interrupt", /* 25 SIGAIO */ "PTY I/O interrupt", /* 26 SIGPTY */ "I/O intervention required", /* 27 SIGIOINT */ "HFT grant", /* 28 SIGGRANT */ "HFT retract", /* 29 SIGRETRACT */ "HFT sound done", /* 30 SIGSOUND */ "HFT input ready", /* 31 SIGMSG */ #else /* not AIX */ "bogus signal", /* 0 */ "hangup", /* 1 SIGHUP */ "interrupt", /* 2 SIGINT */ "quit", /* 3 SIGQUIT */ "illegal instruction", /* 4 SIGILL */ "trace trap", /* 5 SIGTRAP */ "IOT instruction", /* 6 SIGIOT */ "EMT instruction", /* 7 SIGEMT */ "floating point exception", /* 8 SIGFPE */ "kill", /* 9 SIGKILL */ "bus error", /* 10 SIGBUS */ "segmentation violation", /* 11 SIGSEGV */ "bad argument to system call", /* 12 SIGSYS */ "write on a pipe with no one to read it", /* 13 SIGPIPE */ "alarm clock", /* 14 SIGALRM */ "software termination signum", /* 15 SIGTERM */ "user defined signal 1", /* 16 SIGUSR1 */ "user defined signal 2", /* 17 SIGUSR2 */ "death of a child", /* 18 SIGCLD */ "power-fail restart", /* 19 SIGPWR */ #ifdef sun "window size change", /* 20 SIGWINCH */ "urgent socket condition", /* 21 SIGURG */ "pollable event occured", /* 22 SIGPOLL */ "stop (cannot be caught or ignored)", /* 23 SIGSTOP */ "user stop requested from tty", /* 24 SIGTSTP */ "stopped process has been continued", /* 25 SIGCONT */ "background tty read attempted", /* 26 SIGTTIN */ "background tty write attempted", /* 27 SIGTTOU */ "virtual timer expired", /* 28 SIGVTALRM */ "profiling timer expired", /* 29 SIGPROF */ "exceeded cpu limit", /* 30 SIGXCPU */ "exceeded file size limit", /* 31 SIGXFSZ */ "process's lwps are blocked", /* 32 SIGWAITING */ "special signal used by thread library", /* 33 SIGLWP */ #ifdef SIGFREEZE "Special Signal Used By CPR", /* 34 SIGFREEZE */ #endif #ifdef SIGTHAW "Special Signal Used By CPR", /* 35 SIGTHAW */ #endif #endif /* sun */ #endif /* not AIX */ 0 }; #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/strcasecmp.c100666 415 17 2675 5650371036 14255 0ustar jweusers/* Copyright (C) 1991, 1992 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef HAVE_STRCASECMP #include #include /* Compare S1 and S2, ignoring case, returning less than, equal to or greater than zero if S1 is lexiographically less than, equal to or greater than S2. */ int strcasecmp (const char *s1, const char *s2) { register const unsigned char *p1 = (const unsigned char *) s1; register const unsigned char *p2 = (const unsigned char *) s2; unsigned char c1, c2; if (p1 == p2) return 0; do { c1 = tolower (*p1++); c2 = tolower (*p2++); if (c1 == '\0') break; } while (c1 == c2); return c1 - c2; } #endif octave-1.1.0/src/strncase.c100666 415 17 3000 5650370773 13721 0ustar jweusers/* Copyright (C) 1992 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef HAVE_STRNCASECMP #include #include /* Compare no more than N characters of S1 and S2, ignoring case, returning less than, equal to or greater than zero if S1 is lexicographically less than, equal to or greater than S2. */ int strncasecmp (const char *s1, const char *s2, size_t n) { register const unsigned char *p1 = (const unsigned char *) s1; register const unsigned char *p2 = (const unsigned char *) s2; unsigned char c1, c2; if (p1 == p2 || n == 0) return 0; do { c1 = tolower (*p1++); c2 = tolower (*p2++); if (c1 == '\0' || c1 != c2) return c1 - c2; } while (--n > 0); return c1 - c2; } #endif octave-1.1.0/src/strfns.cc100666 415 17 4361 5702417014 13560 0ustar jweusers// strfns.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "dMatrix.h" #include "tree-const.h" #include "oct-obj.h" #include "error.h" #include "gripes.h" #include "defun.h" #include "utils.h" #include "help.h" DEFUN ("isstr", Fisstr, Sisstr, 1, 1, "isstr (X): return 1 if X is a string, 0 otherwise") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) retval = (double) args(0).is_string (); else print_usage ("isstr"); return retval; } DEFUN ("setstr", Fsetstr, Ssetstr, 1, 1, "setstr (V): convert a vector to a string") { Octave_object retval; int nargin = args.length (); if (nargin == 1 && args(0).is_defined ()) retval = args(0).convert_to_str (); else print_usage ("setstr"); return retval; } DEFUN ("toascii", Ftoascii, Stoascii, 1, 1, "toascii (STRING): return ASCII representation of STRING in a matrix") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { tree_constant arg = args(0); if (arg.is_string ()) { char *str = args(0).string_value (); int len = strlen (str); Matrix m (1, len); for (int i = 0; i < len; i++) m (0, i) = toascii (str[i]); retval = m; } else gripe_wrong_type_arg ("toascii", arg); } else print_usage ("toascii"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/symtab.cc100666 415 17 47564 5702417013 13573 0ustar jweusers// symtab.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "symtab.h" #include "error.h" #include "variables.h" #include "utils.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-const.h" extern "C" { #include "fnmatch.h" } // Variables and functions. symbol_def::symbol_def (void) { init_state (); } symbol_def::symbol_def (tree_constant *t) { init_state (); definition = t; type = USER_VARIABLE; } symbol_def::symbol_def (tree_builtin *t, unsigned fcn_type) { init_state (); definition = t; type = BUILTIN_FUNCTION | fcn_type; } symbol_def::symbol_def (tree_function *t, unsigned fcn_type) { init_state (); definition = t; type = USER_FUNCTION | fcn_type; } void symbol_def::init_state (void) { type = UNKNOWN; eternal = 0; read_only = 0; help_string = 0; definition = 0; next_elem = 0; count = 0; } symbol_def::~symbol_def (void) { delete [] help_string; delete definition; } int symbol_def::is_variable (void) const { return (type & USER_VARIABLE || type & BUILTIN_VARIABLE); } int symbol_def::is_function (void) const { return (type & USER_FUNCTION || type & BUILTIN_FUNCTION); } int symbol_def::is_user_variable (void) const { return (type & USER_VARIABLE); } int symbol_def::is_text_function (void) const { return (type & TEXT_FUNCTION); } int symbol_def::is_mapper_function (void) const { return (type & MAPPER_FUNCTION); } int symbol_def::is_user_function (void) const { return (type & USER_FUNCTION); } int symbol_def::is_builtin_variable (void) const { return (type & BUILTIN_VARIABLE); } int symbol_def::is_builtin_function (void) const { return (type & BUILTIN_FUNCTION); } void symbol_def::define (tree_constant *t) { definition = t; if (! is_builtin_variable ()) type = USER_VARIABLE; } void symbol_def::define (tree_builtin *t, unsigned fcn_type) { definition = t; type = BUILTIN_FUNCTION | fcn_type; } void symbol_def::define (tree_function *t, unsigned fcn_type) { definition = t; type = USER_FUNCTION | fcn_type; } void symbol_def::protect (void) { read_only = 1; } void symbol_def::unprotect (void) { read_only = 0; } void symbol_def::make_eternal (void) { eternal = 1; } tree_fvc * symbol_def::def (void) const { return definition; } char * symbol_def::help (void) const { return help_string; } void symbol_def::document (const char *h) { delete [] help_string; help_string = strsave (h); } int maybe_delete (symbol_def *def) { int count = 0; if (def && def->count > 0) { def->count--; count = def->count; if (def->count == 0) delete def; } return count; } // Individual records in a symbol table. symbol_record::symbol_record (void) { init_state (); } symbol_record::symbol_record (const char *n, symbol_record *nxt) { init_state (); nm = strsave (n); next_elem = nxt; } void symbol_record::init_state (void) { formal_param = 0; linked_to_global = 0; nm = 0; sv_fcn = 0; definition = 0; next_elem = 0; } symbol_record::~symbol_record (void) { delete [] nm; } char * symbol_record::name (void) const { return nm; } char * symbol_record::help (void) const { return definition ? definition->help () : 0; } tree_fvc * symbol_record::def (void) const { return definition ? definition->def () : 0; } void symbol_record::rename (const char *new_name) { delete [] nm; nm = strsave (new_name); } int symbol_record::is_function (void) const { return definition ? definition->is_function () : 0; } int symbol_record::is_text_function (void) const { return definition ? definition->is_text_function () : 0; } int symbol_record::is_mapper_function (void) const { return definition ? definition->is_mapper_function () : 0; } int symbol_record::is_user_function (void) const { return definition ? definition->is_user_function () : 0; } int symbol_record::is_builtin_function (void) const { return definition ? definition->is_builtin_function () : 0; } int symbol_record::is_variable (void) const { return definition ? definition->is_variable () : 0; } int symbol_record::is_user_variable (void) const { return definition ? definition->is_user_variable () : 0; } int symbol_record::is_builtin_variable (void) const { return definition ? definition->is_builtin_variable () : 0; } unsigned symbol_record::type (void) const { return definition ? definition->type : 0; } int symbol_record::is_defined (void) const { return definition ? (definition->def () != 0) : 0; } int symbol_record::is_read_only (void) const { return definition ? definition->read_only : 0; } int symbol_record::is_eternal (void) const { return definition ? definition->eternal : 0; } void symbol_record::protect (void) { if (definition) { definition->protect (); if (! is_defined ()) warning ("protecting undefined variable `%s'", nm); } } void symbol_record::unprotect (void) { if (definition) definition->unprotect (); } void symbol_record::make_eternal (void) { if (definition) { definition->make_eternal (); if (! is_defined ()) warning ("giving eternal life to undefined variable `%s'", nm); } } void symbol_record::set_sv_function (sv_Function f) { sv_fcn = f; } int symbol_record::define (tree_constant *t) { if (is_variable () && read_only_error ()) return 0; tree_fvc *saved_def = 0; if (! definition) { definition = new symbol_def (); definition->count = 1; } else if (is_function ()) { symbol_def *new_def = new symbol_def (); push_def (new_def); definition->count = 1; } else if (is_variable ()) { saved_def = definition->def (); } definition->define (t); if (sv_fcn && sv_fcn () < 0) { // Would be nice to be able to avoid this cast. XXX FIXME XXX definition->define ((tree_constant *) saved_def); delete t; return 0; } delete saved_def; return 1; } int symbol_record::define (tree_builtin *t, int text_fcn) { if (read_only_error ()) return 0; if (is_variable ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } if (is_function ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } unsigned fcn_type = text_fcn ? symbol_def::TEXT_FUNCTION : ((t && t->is_mapper_function ()) ? symbol_def::MAPPER_FUNCTION : symbol_def::UNKNOWN); symbol_def *new_def = new symbol_def (t, fcn_type); push_def (new_def); definition->count = 1; return 1; } int symbol_record::define (tree_function *t, int text_fcn) { if (read_only_error ()) return 0; if (is_variable ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } if (is_function ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } unsigned fcn_type = text_fcn ? symbol_def::TEXT_FUNCTION : symbol_def::UNKNOWN; symbol_def *new_def = new symbol_def (t, fcn_type); push_def (new_def); definition->count = 1; return 1; } int symbol_record::define_as_fcn (tree_constant *t) { if (is_variable () && read_only_error ()) return 0; if (is_variable ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } if (is_function ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } symbol_def *new_def = new symbol_def (t); push_def (new_def); definition->count = 1; definition->type = symbol_def::BUILTIN_FUNCTION; return 1; } int symbol_record::define_builtin_var (tree_constant *t) { define (t); if (is_variable ()) definition->type = symbol_def::BUILTIN_VARIABLE; return 1; } void symbol_record::document (const char *h) { if (definition) { definition->document (h); if (! is_defined ()) warning ("documenting undefined variable `%s'", nm); } } int symbol_record::clear (void) { int count = 0; if (linked_to_global) { count = maybe_delete (definition); definition = 0; linked_to_global = 0; } else { symbol_def *old_def = pop_def (); count = maybe_delete (old_def); } return count; } void symbol_record::alias (symbol_record *s, int force) { sv_fcn = s->sv_fcn; if (force && ! s->definition) { s->definition = new symbol_def (); definition = s->definition; definition->count = 2; // Yes, this is correct. } else if (s->definition) { definition = s->definition; definition->count++; } } void symbol_record::mark_as_formal_parameter (void) { formal_param = 1; } int symbol_record::is_formal_parameter (void) const { return formal_param; } void symbol_record::mark_as_linked_to_global (void) { linked_to_global = 1; } int symbol_record::is_linked_to_global (void) const { return linked_to_global; } symbol_record * symbol_record::next (void) const { return next_elem; } void symbol_record::chain (symbol_record *s) { next_elem = s; } void symbol_record::push_context (void) { context.push (definition); definition = 0; global_link_context.push ((unsigned) linked_to_global); linked_to_global = 0; } void symbol_record::pop_context (void) { assert (! context.empty ()); if (is_variable ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } if (is_function ()) { symbol_def *old_def = pop_def (); maybe_delete (old_def); } definition = context.pop (); linked_to_global = global_link_context.pop (); } int symbol_record::read_only_error (void) { if (is_read_only ()) { char *tag = "symbol"; if (is_variable ()) tag = "variable"; else if (is_function ()) tag = "function"; ::error ("can't redefine read-only %s `%s'", tag, nm); return 1; } else return 0; } void symbol_record::push_def (symbol_def *sd) { if (! sd) return; sd->next_elem = definition; definition = sd; } symbol_def * symbol_record::pop_def (void) { symbol_def *top = definition; if (definition) definition = definition->next_elem; return top; } // A structure for handling verbose information about a symbol_record. symbol_record_info::symbol_record_info (void) { init_state (); } symbol_record_info::symbol_record_info (const symbol_record& sr) { init_state (); type = sr.type (); if (sr.is_variable () && sr.is_defined ()) { // Would be nice to avoid this cast. XXX FIXME XXX tree_constant *tmp = (tree_constant *) sr.def (); if (tmp->is_real_scalar ()) const_type = SR_INFO_SCALAR; else if (tmp->is_complex_scalar ()) const_type = SR_INFO_COMPLEX_SCALAR; else if (tmp->is_real_matrix ()) const_type = SR_INFO_MATRIX; else if (tmp->is_complex_matrix ()) const_type = SR_INFO_COMPLEX_MATRIX; else if (tmp->is_range ()) const_type = SR_INFO_RANGE; else if (tmp->is_string ()) const_type = SR_INFO_STRING; nr = tmp->rows (); nc = tmp->columns (); symbol_def *sr_def = sr.definition; symbol_def *hidden_def = sr_def->next_elem; if (hidden_def) { if (hidden_def->is_user_function ()) hides = SR_INFO_USER_FUNCTION; else if (hidden_def->is_builtin_function ()) hides = SR_INFO_BUILTIN_FUNCTION; } } eternal = sr.is_eternal (); read_only = sr.is_read_only (); nm = strsave (sr.name ()); initialized = 1; } symbol_record_info::symbol_record_info (const symbol_record_info& s) { type = s.type; const_type = s.const_type; hides = s.hides; eternal = s.eternal; read_only = s.read_only; nr = s.nr; nc = s.nc; nm = strsave (s.nm); initialized = s.initialized; } symbol_record_info::~symbol_record_info (void) { delete nm; } symbol_record_info& symbol_record_info::operator = (const symbol_record_info& s) { if (this != &s) { delete nm; type = s.type; const_type = s.const_type; hides = s.hides; eternal = s.eternal; read_only = s.read_only; nr = s.nr; nc = s.nc; nm = strsave (s.nm); initialized = s.initialized; } return *this; } int symbol_record_info::is_defined (void) const { return initialized; } int symbol_record_info::is_read_only (void) const { return read_only; } int symbol_record_info::is_eternal (void) const { return eternal; } int symbol_record_info::hides_fcn (void) const { return (hides & SR_INFO_USER_FUNCTION); } int symbol_record_info::hides_builtin (void) const { return (hides & SR_INFO_BUILTIN_FUNCTION); } char * symbol_record_info::type_as_string (void) const { if (type == symbol_def::USER_FUNCTION) return "user function"; else if (type == symbol_def::BUILTIN_FUNCTION) return "builtin function"; else { if (const_type == SR_INFO_SCALAR) return "real scalar"; else if (const_type == SR_INFO_COMPLEX_SCALAR) return "complex scalar"; else if (const_type == SR_INFO_MATRIX) return "real matrix"; else if (const_type == SR_INFO_COMPLEX_MATRIX) return "complex matrix"; else if (const_type == SR_INFO_RANGE) return "range"; else if (const_type == SR_INFO_STRING) return "string"; else return ""; } } int symbol_record_info::is_function (void) const { return (type == symbol_def::USER_FUNCTION || type == symbol_def::BUILTIN_FUNCTION); } int symbol_record_info::rows (void) const { return nr; } int symbol_record_info::columns (void) const { return nc; } char * symbol_record_info::name (void) const { return nm; } void symbol_record_info::init_state (void) { initialized = 0; type = symbol_def::UNKNOWN; const_type = SR_INFO_UNKNOWN; hides = SR_INFO_NONE; eternal = 0; read_only = 0; nr = -1; nc = -1; nm = 0; } // A symbol table. symbol_table::symbol_table (void) { } symbol_record * symbol_table::lookup (const char *nm, int insert, int warn) { int index = hash (nm) & HASH_MASK; symbol_record *ptr = table[index].next (); while (ptr) { if (strcmp (ptr->name (), nm) == 0) return ptr; ptr = ptr->next (); } if (insert) { symbol_record *new_sym; new_sym = new symbol_record (nm, table[index].next ()); table[index].chain (new_sym); return new_sym; } else if (warn) warning ("lookup: symbol`%s' not found", nm); return 0; } void symbol_table::rename (const char *old_name, const char *new_name) { int index = hash (old_name) & HASH_MASK; symbol_record *prev = &table[index]; symbol_record *ptr = prev->next (); while (ptr) { if (strcmp (ptr->name (), old_name) == 0) { prev->chain (ptr->next ()); index = hash (new_name) & HASH_MASK; table[index].chain (ptr); ptr->rename (new_name); return; } prev = ptr; ptr = ptr->next (); } error ("unable to rename `%s' to `%s', old_name, new_name"); } void symbol_table::clear (int clear_user_functions) { for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { if (ptr->is_user_variable () || (clear_user_functions && ptr->is_user_function ())) { ptr->clear (); } ptr = ptr->next (); } } } int symbol_table::clear (const char *nm, int clear_user_functions) { int index = hash (nm) & HASH_MASK; symbol_record *ptr = table[index].next (); while (ptr) { if (strcmp (ptr->name (), nm) == 0 && (ptr->is_user_variable () || (clear_user_functions && ptr->is_user_function ()))) { ptr->clear (); return 1; } ptr = ptr->next (); } return 0; } int symbol_table::size (void) const { int count = 0; for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { count++; ptr = ptr->next (); } } return count; } static inline int pstrcmp (char **a, char **b) { return strcmp (*a, *b); } static inline int symbol_record_info_cmp (symbol_record_info *a, symbol_record_info *b) { return strcmp (a->name (), b->name ()); } static int matches_patterns (const char *name, char **pats, int npats) { while (npats-- > 0) { if (fnmatch (*pats, name, __FNM_FLAGS) == 0) return 1; pats++; } return 0; } // This function should probably share code with symbol_table::list. // XXX FIXME XXX symbol_record_info * symbol_table::long_list (int& count, char **pats, int npats, int sort, unsigned type, unsigned scope) const { count = 0; int n = size (); if (n == 0) return 0; symbol_record_info *symbols = new symbol_record_info [n+1]; for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { assert (count < n); unsigned my_scope = ptr->is_linked_to_global () + 1; // Tricky... unsigned my_type = ptr->type (); char *my_name = ptr->name (); if ((type & my_type) && (scope & my_scope) && (npats == 0 || matches_patterns (my_name, pats, npats))) symbols[count++] = symbol_record_info (*ptr); ptr = ptr->next (); } } symbols[count] = symbol_record_info (); if (sort && symbols) qsort ((void *) symbols, count, sizeof (symbol_record_info), (int (*)(const void*, const void*)) symbol_record_info_cmp); return symbols; } char ** symbol_table::list (int& count, char **pats, int npats, int sort, unsigned type, unsigned scope) const { count = 0; int n = size (); if (n == 0) return 0; char **symbols = new char * [n+1]; for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { assert (count < n); unsigned my_scope = ptr->is_linked_to_global () + 1; // Tricky... unsigned my_type = ptr->type (); char *my_name = ptr->name (); if ((type & my_type) && (scope & my_scope) && (npats == 0 || matches_patterns (my_name, pats, npats))) symbols[count++] = strsave (ptr->name ()); ptr = ptr->next (); } } symbols[count] = 0; if (sort && symbols) qsort ((void **) symbols, count, sizeof (char *), (int (*)(const void*, const void*)) pstrcmp); return symbols; } symbol_record ** symbol_table::glob (int& count, char *pat, unsigned type, unsigned scope) const { count = 0; int n = size (); if (n == 0) return 0; symbol_record **symbols = new symbol_record * [n+1]; for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { assert (count < n); unsigned my_scope = ptr->is_linked_to_global () + 1; // Tricky... unsigned my_type = ptr->type (); if ((type & my_type) && (scope & my_scope) && fnmatch (pat, ptr->name (), __FNM_FLAGS) == 0) { symbols[count++] = ptr; } ptr = ptr->next (); } } symbols[count] = 0; return symbols; } void symbol_table::push_context (void) { for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { ptr->push_context (); ptr = ptr->next (); } } } void symbol_table::pop_context (void) { for (int i = 0; i < HASH_TABLE_SIZE; i++) { symbol_record *ptr = table[i].next (); while (ptr) { ptr->pop_context (); ptr = ptr->next (); } } } // Chris Torek's fave hash function. unsigned int symbol_table::hash (const char *str) { unsigned h = 0; while (*str) h = h * 33 + *str++; return h; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/sysdep.cc100666 415 17 22336 5702417012 13570 0ustar jweusers// sysdep.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The function gethostname was adapted from a similar function from GNU Bash, the Bourne Again SHell, copyright (C) 1987, 1989, 1991 Free Software Foundation, Inc. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include "tree-const.h" #include "octave.h" #include "help.h" #include "input.h" #include "utils.h" #include "oct-obj.h" #include "error.h" #include "sysdep.h" #include "defun.h" extern "C" { #include extern char *term_clrpag; extern void _rl_output_character_function (); #if defined (HAVE_TERMIOS_H) #include #elif defined (HAVE_TERMIO_H) #include #elif defined (HAVE_SGTTY_H) #include #else LOSE! LOSE! #endif } #ifndef STDIN_FILENO #define STDIN_FILENO 1 #endif // Octave's idea of infinity. double octave_Inf; // Octave's idea of not a number. double octave_NaN; #if defined (HAVE_FLOATINGPOINT_H) #include #endif #ifdef NeXT extern "C" { typedef void (*_cplus_fcn_int) (int); extern void (*malloc_error (_cplus_fcn_int)) (int); } static void malloc_handler (int code) { if (code == 5) warning ("hopefully recoverable malloc error: freeing wild pointer"); else { panic ("probably irrecoverable malloc error: code %d", code); } } static void NeXT_init (void) { malloc_error (malloc_handler); } #endif static void octave_ieee_init (void) { #if defined (HAVE_ISINF) || defined (HAVE_FINITE) // Some version of gcc on some old version of Linux used to crash when // trying to make Inf and NaN. #if defined (HAVE_INFINITY) octave_Inf = (double) infinity (); #elif defined (linux) octave_Inf = HUGE_VAL; #elif defined (__alpha__) extern unsigned int DINFINITY[2]; octave_Inf = (*((double *) (DINFINITY))); #else double tmp = 1e+10; octave_Inf = tmp; for (;;) { octave_Inf *= 1e+10; if (octave_Inf == tmp) break; tmp = octave_Inf; } #endif #if defined (HAVE_QUIET_NAN) octave_NaN = (double) quiet_nan (); #elif defined (linux) octave_NaN = NAN; #elif defined (__alpha__) extern unsigned int DQNAN[2]; octave_NaN = (*((double *) (DQNAN))); #else octave_NaN = octave_Inf / octave_Inf; #endif #else // This is sort of cheesy, but what can we do, other than blowing it // off completely, or writing an entire IEEE emulation package? octave_Inf = DBL_MAX; octave_NaN = DBL_MAX; #endif } #if defined (EXCEPTION_IN_MATH) extern "C" { int matherr (struct exception *x) { // Possibly print our own message someday. Should probably be // user-switchable. switch (x->type) { case DOMAIN: case SING: case OVERFLOW: case UNDERFLOW: case TLOSS: case PLOSS: default: break; } // But don't print the system message. return 1; } } #endif void sysdep_init (void) { #if defined (__386BSD__) || defined (__FreeBSD__) #if defined (HAVE_FLOATINGPOINT_H) // Disable trapping on common exceptions. fpsetmask (~(FP_X_OFL|FP_X_INV|FP_X_DZ|FP_X_DNML|FP_X_UFL|FP_X_IMP)); #endif #endif #ifdef NeXT NeXT_init (); #endif octave_ieee_init (); } // Set terminal in raw mode. From less-177. // // Change terminal to "raw mode", or restore to "normal" mode. // "Raw mode" means // 1. An outstanding read will complete on receipt of a single keystroke. // 2. Input is not echoed. // 3. On output, \n is mapped to \r\n. // 4. \t is NOT expanded into spaces. // 5. Signal-causing characters such as ctrl-C (interrupt), // etc. are NOT disabled. // It doesn't matter whether an input \n is mapped to \r, or vice versa. void raw_mode (int on) { static int curr_on = 0; int tty_fd = STDIN_FILENO; if (! isatty (tty_fd)) { if (interactive) error ("stdin is not a tty!"); return; } if (on == curr_on) return; #if defined (HAVE_TERMIOS_H) { struct termios s; static struct termios save_term; if (on) { // Get terminal modes. tcgetattr (tty_fd, &s); // Save modes and set certain variables dependent on modes. save_term = s; // ospeed = s.c_cflag & CBAUD; // erase_char = s.c_cc[VERASE]; // kill_char = s.c_cc[VKILL]; // Set the modes to the way we want them. s.c_lflag &= ~(ICANON|ECHO|ECHOE|ECHOK|ECHONL); s.c_oflag |= (OPOST|ONLCR); #if defined (OCRNL) s.c_oflag &= ~(OCRNL); #endif #if defined (ONOCR) s.c_oflag &= ~(ONOCR); #endif #if defined (ONLRET) s.c_oflag &= ~(ONLRET); #endif s.c_cc[VMIN] = 1; s.c_cc[VTIME] = 0; } else { // Restore saved modes. s = save_term; } tcsetattr (tty_fd, TCSAFLUSH, &s); } #elif defined (HAVE_TERMIO_H) { struct termio s; static struct termio save_term; if (on) { // Get terminal modes. ioctl (tty_fd, TCGETA, &s); // Save modes and set certain variables dependent on modes. save_term = s; // ospeed = s.c_cflag & CBAUD; // erase_char = s.c_cc[VERASE]; // kill_char = s.c_cc[VKILL]; // Set the modes to the way we want them. s.c_lflag &= ~(ICANON|ECHO|ECHOE|ECHOK|ECHONL); s.c_oflag |= (OPOST|ONLCR); #if defined (OCRNL) s.c_oflag &= ~(OCRNL); #endif #if defined (ONOCR) s.c_oflag &= ~(ONOCR); #endif #if defined (ONLRET) s.c_oflag &= ~(ONLRET); #endif s.c_cc[VMIN] = 1; s.c_cc[VTIME] = 0; } else { // Restore saved modes. s = save_term; } ioctl (tty_fd, TCSETAW, &s); } #elif defined (HAVE_SGTTY_H) { struct sgttyb s; static struct sgttyb save_term; if (on) { // Get terminal modes. ioctl (tty_fd, TIOCGETP, &s); // Save modes and set certain variables dependent on modes. save_term = s; // ospeed = s.sg_ospeed; // erase_char = s.sg_erase; // kill_char = s.sg_kill; // Set the modes to the way we want them. s.sg_flags |= CBREAK; s.sg_flags &= ~(ECHO); } else { // Restore saved modes. s = save_term; } ioctl (tty_fd, TIOCSETN, &s); } #else LOSE! LOSE! #endif curr_on = on; } // Read one character from the terminal. int kbhit (void) { int c; raw_mode (1); c = cin.get (); raw_mode (0); return c; } DEFUN ("clc", Fclc, Sclc, 0, 0, "clc (): clear screen") { Octave_object retval; rl_beg_of_line (); rl_kill_line (1); #if ! defined (_GO32_) if (term_clrpag) tputs (term_clrpag, 1, _rl_output_character_function); else crlf (); #else crlf (); #endif fflush (rl_outstream); return retval; } DEFALIAS (home, clc); DEFUN ("getenv", Fgetenv, Sgetenv, 1, 1, "getenv (STRING): get environment variable values") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { char *name = args(0).string_value (); if (! error_state) { char *value = getenv (name); if (value) retval = value; else retval = ""; } } else print_usage ("getenv"); return retval; } DEFUN ("kbhit", Fkbhit, Skbhit, 0, 1, "kbhit: get a single character from the terminal") { Octave_object retval; // XXX FIXME XXX -- add timeout and default value args? if (interactive) { int c = kbhit (); char *s = new char [2]; s[0] = c; s[1] = '\0'; retval = s; } return retval; } DEFUN ("pause", Fpause, Spause, 1, 1, "pause (seconds): suspend program execution") { Octave_object retval; int nargin = args.length (); if (! (nargin == 0 || nargin == 1)) { print_usage ("pause"); return retval; } if (interactive) { switch (nargin) { case 1: { double dval = args(0).double_value (); if (! error_state) { int delay = NINT (dval); if (delay > 0) sleep (delay); } } break; default: if (kbhit () == EOF) clean_up_and_exit (0); break; } } return retval; } // XXX FIXME XXX -- maybe this should only return 1 if IEEE floating // point functions really work. DEFUN ("isieee", Fisieee, Sisieee, 1, 1, "isieee (): return 1 if host uses IEEE floating point") { Octave_object retval; #if defined (IEEE_BIG_ENDIAN) || defined (IEEE_LITTLE_ENDIAN) retval = 1.0; #else retval = 0.0; #endif return retval; } #if !defined (HAVE_GETHOSTNAME) && defined (HAVE_SYS_UTSNAME_H) extern "C" { #include int gethostname (char *name, int namelen) { int i; struct utsname ut; --namelen; uname (&ut); i = strlen (ut.nodename) + 1; strncpy (name, ut.nodename, i < namelen ? i : namelen); name[namelen] = '\0'; return 0; } } #endif /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tc-rep.cc100666 415 17 116501 5702417010 13467 0ustar jweusers// tc-rep.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include "mx-base.h" #include "Range.h" #include "arith-ops.h" #include "variables.h" #include "sysdep.h" #include "error.h" #include "gripes.h" #include "user-prefs.h" #include "utils.h" #include "pager.h" #include "pr-output.h" #include "tree-const.h" #include "idx-vector.h" #include "oct-map.h" #include "tc-inlines.h" static int any_element_is_complex (const ComplexMatrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) if (imag (a.elem (i, j)) != 0.0) return 1; return 0; } // The real representation of constants. TC_REP::tree_constant_rep (void) { type_tag = unknown_constant; orig_text = 0; } TC_REP::tree_constant_rep (double d) { scalar = d; type_tag = scalar_constant; orig_text = 0; } TC_REP::tree_constant_rep (const Matrix& m) { if (m.rows () == 1 && m.columns () == 1) { scalar = m.elem (0, 0); type_tag = scalar_constant; } else { matrix = new Matrix (m); type_tag = matrix_constant; } orig_text = 0; } TC_REP::tree_constant_rep (const DiagMatrix& d) { if (d.rows () == 1 && d.columns () == 1) { scalar = d.elem (0, 0); type_tag = scalar_constant; } else { matrix = new Matrix (d); type_tag = matrix_constant; } orig_text = 0; } TC_REP::tree_constant_rep (const RowVector& v, int prefer_column_vector) { int len = v.capacity (); if (len == 1) { scalar = v.elem (0); type_tag = scalar_constant; } else { int pcv = (prefer_column_vector < 0) ? user_pref.prefer_column_vectors : prefer_column_vector; if (pcv) { Matrix m (len, 1); for (int i = 0; i < len; i++) m.elem (i, 0) = v.elem (i); matrix = new Matrix (m); type_tag = matrix_constant; } else { Matrix m (1, len); for (int i = 0; i < len; i++) m.elem (0, i) = v.elem (i); matrix = new Matrix (m); type_tag = matrix_constant; } } orig_text = 0; } TC_REP::tree_constant_rep (const ColumnVector& v, int prefer_column_vector) { int len = v.capacity (); if (len == 1) { scalar = v.elem (0); type_tag = scalar_constant; } else { int pcv = (prefer_column_vector < 0) ? user_pref.prefer_column_vectors : prefer_column_vector; if (pcv) { Matrix m (len, 1); for (int i = 0; i < len; i++) m.elem (i, 0) = v.elem (i); matrix = new Matrix (m); type_tag = matrix_constant; } else { Matrix m (1, len); for (int i = 0; i < len; i++) m.elem (0, i) = v.elem (i); matrix = new Matrix (m); type_tag = matrix_constant; } } orig_text = 0; } TC_REP::tree_constant_rep (const Complex& c) { complex_scalar = new Complex (c); type_tag = complex_scalar_constant; orig_text = 0; } TC_REP::tree_constant_rep (const ComplexMatrix& m) { if (m.rows () == 1 && m.columns () == 1) { complex_scalar = new Complex (m.elem (0, 0)); type_tag = complex_scalar_constant; } else { complex_matrix = new ComplexMatrix (m); type_tag = complex_matrix_constant; } orig_text = 0; } TC_REP::tree_constant_rep (const ComplexDiagMatrix& d) { if (d.rows () == 1 && d.columns () == 1) { complex_scalar = new Complex (d.elem (0, 0)); type_tag = complex_scalar_constant; } else { complex_matrix = new ComplexMatrix (d); type_tag = complex_matrix_constant; } orig_text = 0; } TC_REP::tree_constant_rep (const ComplexRowVector& v, int prefer_column_vector) { int len = v.capacity (); if (len == 1) { complex_scalar = new Complex (v.elem (0)); type_tag = complex_scalar_constant; } else { int pcv = (prefer_column_vector < 0) ? user_pref.prefer_column_vectors : prefer_column_vector; if (pcv) { ComplexMatrix m (len, 1); for (int i = 0; i < len; i++) m.elem (i, 0) = v.elem (i); complex_matrix = new ComplexMatrix (m); type_tag = complex_matrix_constant; } else { ComplexMatrix m (1, len); for (int i = 0; i < len; i++) m.elem (0, i) = v.elem (i); complex_matrix = new ComplexMatrix (m); type_tag = complex_matrix_constant; } } orig_text = 0; } TC_REP::tree_constant_rep (const ComplexColumnVector& v, int prefer_column_vector) { int len = v.capacity (); if (len == 1) { complex_scalar = new Complex (v.elem (0)); type_tag = complex_scalar_constant; } else { int pcv = (prefer_column_vector < 0) ? user_pref.prefer_column_vectors : prefer_column_vector; if (pcv) { ComplexMatrix m (len, 1); for (int i = 0; i < len; i++) m.elem (i, 0) = v.elem (i); complex_matrix = new ComplexMatrix (m); type_tag = complex_matrix_constant; } else { ComplexMatrix m (1, len); for (int i = 0; i < len; i++) m.elem (0, i) = v.elem (i); complex_matrix = new ComplexMatrix (m); type_tag = complex_matrix_constant; } } orig_text = 0; } TC_REP::tree_constant_rep (const char *s) { string = strsave (s); type_tag = string_constant; orig_text = 0; } TC_REP::tree_constant_rep (double b, double l, double i) { range = new Range (b, l, i); int nel = range->nelem (); if (nel > 1) type_tag = range_constant; else { delete range; if (nel == 1) { scalar = b; type_tag = scalar_constant; } else if (nel == 0) { matrix = new Matrix (); type_tag = matrix_constant; } else { type_tag = unknown_constant; if (nel == -1) ::error ("number of elements in range exceeds INT_MAX"); else ::error ("invalid range"); } } orig_text = 0; } TC_REP::tree_constant_rep (const Range& r) { int nel = r.nelem (); if (nel > 1) { range = new Range (r); type_tag = range_constant; } else if (nel == 1) { scalar = r.base (); type_tag = scalar_constant; } else if (nel == 0) { matrix = new Matrix (); type_tag = matrix_constant; } else { type_tag = unknown_constant; if (nel == -1) ::error ("number of elements in range exceeds INT_MAX"); else ::error ("invalid range"); } orig_text = 0; } TC_REP::tree_constant_rep (const Octave_map& m) { a_map = new Octave_map (m); type_tag = map_constant; orig_text = 0; } TC_REP::tree_constant_rep (TC_REP::constant_type t) { assert (t == magic_colon || t == all_va_args); type_tag = t; orig_text = 0; } TC_REP::tree_constant_rep (const tree_constant_rep& t) { type_tag = t.type_tag; switch (t.type_tag) { case unknown_constant: break; case scalar_constant: scalar = t.scalar; break; case matrix_constant: matrix = new Matrix (*(t.matrix)); break; case string_constant: string = strsave (t.string); break; case complex_matrix_constant: complex_matrix = new ComplexMatrix (*(t.complex_matrix)); break; case complex_scalar_constant: complex_scalar = new Complex (*(t.complex_scalar)); break; case range_constant: range = new Range (*(t.range)); break; case map_constant: a_map = new Octave_map (*(t.a_map)); break; case magic_colon: case all_va_args: break; } orig_text = strsave (t.orig_text); } TC_REP::~tree_constant_rep (void) { switch (type_tag) { case matrix_constant: delete matrix; break; case complex_scalar_constant: delete complex_scalar; break; case complex_matrix_constant: delete complex_matrix; break; case string_constant: delete [] string; break; case range_constant: delete range; break; case map_constant: delete a_map; break; case unknown_constant: case scalar_constant: case magic_colon: case all_va_args: break; } delete [] orig_text; } #if defined (MDEBUG) void * TC_REP::operator new (size_t size) { tree_constant_rep *p = ::new tree_constant_rep; cerr << "TC_REP::new(): " << p << "\n"; return p; } void TC_REP::operator delete (void *p, size_t size) { cerr << "TC_REP::delete(): " << p << "\n"; ::delete p; } #endif int TC_REP::rows (void) const { int retval = -1; switch (type_tag) { case scalar_constant: case complex_scalar_constant: retval = 1; break; case string_constant: case range_constant: retval = (columns () > 0); break; case matrix_constant: retval = matrix->rows (); break; case complex_matrix_constant: retval = complex_matrix->rows (); break; default: break; } return retval; } int TC_REP::columns (void) const { int retval = -1; switch (type_tag) { case scalar_constant: case complex_scalar_constant: retval = 1; break; case matrix_constant: retval = matrix->columns (); break; case complex_matrix_constant: retval = complex_matrix->columns (); break; case string_constant: retval = strlen (string); break; case range_constant: retval = range->nelem (); break; default: break; } return retval; } tree_constant TC_REP::all (void) const { tree_constant retval; if (error_state) return retval; if (! is_numeric_type ()) { tree_constant tmp = make_numeric (); if (error_state) return retval; return tmp.all (); } switch (type_tag) { case scalar_constant: { double status = (scalar != 0.0); retval = tree_constant (status); } break; case matrix_constant: { Matrix m = matrix->all (); retval = tree_constant (m); } break; case complex_scalar_constant: { double status = (*complex_scalar != 0.0); retval = tree_constant (status); } break; case complex_matrix_constant: { Matrix m = complex_matrix->all (); retval = tree_constant (m); } break; default: gripe_wrong_type_arg ("all", *this); break; } return retval; } tree_constant TC_REP::any (void) const { tree_constant retval; if (error_state) return retval; if (! is_numeric_type ()) { tree_constant tmp = make_numeric (); if (error_state) return retval; return tmp.any (); } switch (type_tag) { case scalar_constant: { double status = (scalar != 0.0); retval = tree_constant (status); } break; case matrix_constant: { Matrix m = matrix->any (); retval = tree_constant (m); } break; case complex_scalar_constant: { double status = (*complex_scalar != 0.0); retval = tree_constant (status); } break; case complex_matrix_constant: { Matrix m = complex_matrix->any (); retval = tree_constant (m); } break; default: gripe_wrong_type_arg ("any", *this); break; } return retval; } int TC_REP::valid_as_scalar_index (void) const { return (type_tag == magic_colon || (type_tag == scalar_constant && NINT (scalar) == 1) || (type_tag == range_constant && range->nelem () == 1 && NINT (range->base ()) == 1)); } int TC_REP::is_true (void) const { int retval = 0; if (error_state) return retval; if (! is_numeric_type ()) { tree_constant tmp = make_numeric (); if (error_state) return retval; return tmp.is_true (); } switch (type_tag) { case scalar_constant: retval = (scalar != 0.0); break; case matrix_constant: { Matrix m = (matrix->all ()) . all (); retval = (m.rows () == 1 && m.columns () == 1 && m.elem (0, 0) != 0.0); } break; case complex_scalar_constant: retval = (*complex_scalar != 0.0); break; case complex_matrix_constant: { Matrix m = (complex_matrix->all ()) . all (); retval = (m.rows () == 1 && m.columns () == 1 && m.elem (0, 0) != 0.0); } break; default: gripe_wrong_type_arg (0, *this); break; } return retval; } static void warn_implicit_conversion (const char *from, const char *to) { warning ("implicit conversion from %s to %s", from, to); } double TC_REP::double_value (int force_string_conversion) const { double retval = octave_NaN; switch (type_tag) { case scalar_constant: retval = scalar; break; case matrix_constant: { if (user_pref.do_fortran_indexing && rows () > 0 && columns () > 0) retval = matrix->elem (0, 0); else gripe_invalid_conversion ("real matrix", "real scalar"); } break; case complex_matrix_constant: case complex_scalar_constant: { int flag = user_pref.ok_to_lose_imaginary_part; if (flag < 0) warn_implicit_conversion ("complex scalar", "real scalar"); if (flag) { if (type_tag == complex_scalar_constant) retval = ::real (*complex_scalar); else if (type_tag == complex_matrix_constant) { if (user_pref.do_fortran_indexing && rows () > 0 && columns () > 0) retval = ::real (complex_matrix->elem (0, 0)); else gripe_invalid_conversion ("complex matrix", "real scalar"); } else panic_impossible (); } else gripe_invalid_conversion ("complex scalar", "real scalar"); } break; case string_constant: { int flag = force_string_conversion; if (! flag) flag = user_pref.implicit_str_to_num_ok; if (flag < 0) warn_implicit_conversion ("string", "real scalar"); int len = strlen (string); if (flag && (len == 1 || (len > 1 && user_pref.do_fortran_indexing))) retval = toascii ((int) string[0]); else gripe_invalid_conversion ("string", "real scalar"); } break; case range_constant: { int nel = range->nelem (); if (nel == 1 || (nel > 1 && user_pref.do_fortran_indexing)) retval = range->base (); else gripe_invalid_conversion ("range", "real scalar"); } break; default: gripe_invalid_conversion (type_as_string (), "real scalar"); break; } return retval; } Matrix TC_REP::matrix_value (int force_string_conversion) const { Matrix retval; switch (type_tag) { case scalar_constant: retval = Matrix (1, 1, scalar); break; case matrix_constant: retval = *matrix; break; case complex_scalar_constant: case complex_matrix_constant: { int flag = user_pref.ok_to_lose_imaginary_part; if (flag < 0) warn_implicit_conversion ("complex matrix", "real matrix"); if (flag) { if (type_tag == complex_scalar_constant) retval = Matrix (1, 1, ::real (*complex_scalar)); else if (type_tag == complex_matrix_constant) retval = ::real (*complex_matrix); else panic_impossible (); } else gripe_invalid_conversion ("complex matrix", "real matrix"); } break; case string_constant: { int flag = force_string_conversion; if (! flag) flag = user_pref.implicit_str_to_num_ok; if (flag < 0) warn_implicit_conversion ("string", "real matrix"); if (flag) { int len = strlen (string); if (len > 0) { retval.resize (1, len); for (int i = 0; i < len; i++) retval.elem (0, i) = toascii ((int) string[i]); } else retval = Matrix (); } else gripe_invalid_conversion ("string", "real matrix"); } break; case range_constant: retval = range->matrix_value (); break; default: gripe_invalid_conversion (type_as_string (), "real matrix"); break; } return retval; } Complex TC_REP::complex_value (int force_string_conversion) const { Complex retval (octave_NaN, octave_NaN); switch (type_tag) { case complex_scalar_constant: retval = *complex_scalar; break; case scalar_constant: retval = scalar; break; case complex_matrix_constant: case matrix_constant: { if (user_pref.do_fortran_indexing && rows () > 0 && columns () > 0) { if (type_tag == complex_matrix_constant) retval = complex_matrix->elem (0, 0); else retval = matrix->elem (0, 0); } else gripe_invalid_conversion ("real matrix", "real scalar"); } break; case string_constant: { int flag = force_string_conversion; if (! flag) flag = user_pref.implicit_str_to_num_ok; if (flag < 0) warn_implicit_conversion ("string", "complex scalar"); int len = strlen (string); if (flag && (len == 1 || (len > 1 && user_pref.do_fortran_indexing))) retval = toascii ((int) string[0]); else gripe_invalid_conversion ("string", "complex scalar"); } break; case range_constant: { int nel = range->nelem (); if (nel == 1 || (nel > 1 && user_pref.do_fortran_indexing)) retval = range->base (); else gripe_invalid_conversion ("range", "complex scalar"); } break; default: gripe_invalid_conversion (type_as_string (), "complex scalar"); break; } return retval; } ComplexMatrix TC_REP::complex_matrix_value (int force_string_conversion) const { ComplexMatrix retval; switch (type_tag) { case scalar_constant: retval = ComplexMatrix (1, 1, Complex (scalar)); break; case complex_scalar_constant: retval = ComplexMatrix (1, 1, *complex_scalar); break; case matrix_constant: retval = ComplexMatrix (*matrix); break; case complex_matrix_constant: retval = *complex_matrix; break; case string_constant: { int flag = force_string_conversion; if (! flag) flag = user_pref.implicit_str_to_num_ok; if (flag < 0) warn_implicit_conversion ("string", "complex matrix"); if (flag) { int len = strlen (string); retval.resize (1, len); if (len > 1) { for (int i = 0; i < len; i++) retval.elem (0, i) = toascii ((int) string[i]); } else if (len == 1) retval.elem (0, 0) = toascii ((int) string[0]); else panic_impossible (); } else gripe_invalid_conversion ("string", "real matrix"); } break; case range_constant: retval = range->matrix_value (); break; default: gripe_invalid_conversion (type_as_string (), "complex matrix"); break; } return retval; } char * TC_REP::string_value (void) const { if (type_tag == string_constant) return string; else { gripe_invalid_conversion (type_as_string (), "string"); return 0; } } Range TC_REP::range_value (void) const { assert (type_tag == range_constant); return *range; } Octave_map TC_REP::map_value (void) const { assert (type_tag == map_constant); return *a_map; } tree_constant& TC_REP::lookup_map_element (const char *name, int insert) { static tree_constant retval; if (type_tag == map_constant) { Pix idx = a_map->seek (name); if (idx) return a_map->contents (idx); else if (insert) return (*a_map) [name]; else error ("structure has no member `%s'", name); } else error ("invalid structure access attempted"); return retval; } // This could be made more efficient by doing all the work here rather // than relying on matrix_value() to do any possible type conversions. ColumnVector TC_REP::vector_value (int force_string_conversion, int force_vector_conversion) const { ColumnVector retval; Matrix m = matrix_value (force_string_conversion); if (error_state) return retval; int nr = m.rows (); int nc = m.columns (); if (nr == 1) { retval.resize (nc); for (int i = 0; i < nc; i++) retval.elem (i) = m (0, i); } else if (nc == 1) { retval.resize (nr); for (int i = 0; i < nr; i++) retval.elem (i) = m.elem (i, 0); } else if (nr > 0 && nc > 0 && (user_pref.do_fortran_indexing || force_vector_conversion)) { retval.resize (nr * nc); int k = 0; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) retval.elem (k++) = m.elem (i, j); } else gripe_invalid_conversion ("real matrix", "real vector"); return retval; } // This could be made more efficient by doing all the work here rather // than relying on complex_matrix_value() to do any possible type // conversions. ComplexColumnVector TC_REP::complex_vector_value (int force_string_conversion, int force_vector_conversion) const { ComplexColumnVector retval; ComplexMatrix m = complex_matrix_value (force_string_conversion); if (error_state) return retval; int nr = m.rows (); int nc = m.columns (); if (nr == 1) { retval.resize (nc); for (int i = 0; i < nc; i++) retval.elem (i) = m (0, i); } else if (nc == 1) { retval.resize (nr); for (int i = 0; i < nr; i++) retval.elem (i) = m.elem (i, 0); } else if (nr > 0 && nc > 0 && (user_pref.do_fortran_indexing || force_vector_conversion)) { retval.resize (nr * nc); int k = 0; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) retval.elem (k++) = m.elem (i, j); } else gripe_invalid_conversion ("complex matrix", "complex vector"); return retval; } tree_constant TC_REP::convert_to_str (void) const { tree_constant retval; switch (type_tag) { case complex_scalar_constant: case scalar_constant: { double d = double_value (); int i = NINT (d); // Warn about out of range conversions? char s[2]; s[0] = (char) i; s[1] = '\0'; retval = tree_constant (s); } break; case complex_matrix_constant: case matrix_constant: { if (rows () == 0 && columns () == 0) { char s = '\0'; retval = tree_constant (&s); } else { ColumnVector v = vector_value (); int len = v.length (); if (len == 0) { char s = '\0'; retval = tree_constant (&s); } else { char *s = new char [len+1]; s[len] = '\0'; for (int i = 0; i < len; i++) { double d = v.elem (i); int ival = NINT (d); // Warn about out of range conversions? s[i] = (char) ival; } retval = tree_constant (s); delete [] s; } } } break; case range_constant: { Range r = range_value (); double b = r.base (); double incr = r.inc (); int nel = r.nelem (); char *s = new char [nel+1]; s[nel] = '\0'; for (int i = 0; i < nel; i++) { double d = b + i * incr; int ival = NINT (d); // Warn about out of range conversions? s[i] = (char) ival; } retval = tree_constant (s); delete [] s; } break; case string_constant: retval = string; break; default: gripe_invalid_conversion (type_as_string (), "string"); break; } return retval; } void TC_REP::convert_to_row_or_column_vector (void) { assert (type_tag == matrix_constant || type_tag == complex_matrix_constant); int nr = rows (); int nc = columns (); if (nr == 1 || nc == 1) return; int len = nr * nc; assert (len > 0); int new_nr = 1; int new_nc = 1; if (user_pref.prefer_column_vectors) new_nr = len; else new_nc = len; if (type_tag == matrix_constant) { Matrix *m = new Matrix (new_nr, new_nc); double *cop_out = matrix->fortran_vec (); for (int i = 0; i < len; i++) { if (new_nr == 1) m->elem (0, i) = *cop_out++; else m->elem (i, 0) = *cop_out++; } delete matrix; matrix = m; } else { ComplexMatrix *cm = new ComplexMatrix (new_nr, new_nc); Complex *cop_out = complex_matrix->fortran_vec (); for (int i = 0; i < len; i++) { if (new_nr == 1) cm->elem (0, i) = *cop_out++; else cm->elem (i, 0) = *cop_out++; } delete complex_matrix; complex_matrix = cm; } } void TC_REP::force_numeric (int force_str_conv) { switch (type_tag) { case scalar_constant: case matrix_constant: case complex_scalar_constant: case complex_matrix_constant: break; case string_constant: { if (! force_str_conv && ! user_pref.implicit_str_to_num_ok) { ::error ("failed to convert `%s' to a numeric type --", string); ::error ("default conversion turned off"); return; } int len = strlen (string); if (len > 1) { type_tag = matrix_constant; Matrix *tm = new Matrix (1, len); for (int i = 0; i < len; i++) tm->elem (0, i) = toascii ((int) string[i]); matrix = tm; } else if (len == 1) { type_tag = scalar_constant; scalar = toascii ((int) string[0]); } else if (len == 0) { type_tag = matrix_constant; matrix = new Matrix (0, 0); } else panic_impossible (); } break; case range_constant: { int len = range->nelem (); if (len > 1) { type_tag = matrix_constant; Matrix *tm = new Matrix (1, len); double b = range->base (); double increment = range->inc (); for (int i = 0; i < len; i++) tm->elem (0, i) = b + i * increment; matrix = tm; } else if (len == 1) { type_tag = scalar_constant; scalar = range->base (); } } break; default: gripe_invalid_conversion (type_as_string (), "numeric type"); break; } } tree_constant TC_REP::make_numeric (int force_str_conv) const { tree_constant retval; switch (type_tag) { case scalar_constant: retval = tree_constant (scalar); break; case matrix_constant: retval = tree_constant (*matrix); break; case complex_scalar_constant: retval = tree_constant (*complex_scalar); break; case complex_matrix_constant: retval = tree_constant (*complex_matrix); break; case string_constant: retval = tree_constant (string); retval.force_numeric (force_str_conv); break; case range_constant: retval = tree_constant (*range); retval.force_numeric (force_str_conv); break; default: gripe_invalid_conversion (type_as_string (), "numeric value"); break; } return retval; } void TC_REP::bump_value (tree_expression::type etype) { switch (etype) { case tree_expression::increment: switch (type_tag) { case scalar_constant: scalar++; break; case matrix_constant: *matrix = *matrix + 1.0; break; case complex_scalar_constant: *complex_scalar = *complex_scalar + 1.0; break; case complex_matrix_constant: *complex_matrix = *complex_matrix + 1.0; break; case range_constant: range->set_base (range->base () + 1.0); range->set_limit (range->limit () + 1.0); break; default: gripe_wrong_type_arg ("operator ++", type_as_string ()); break; } break; case tree_expression::decrement: switch (type_tag) { case scalar_constant: scalar--; break; case matrix_constant: *matrix = *matrix - 1.0; break; case range_constant: range->set_base (range->base () - 1.0); range->set_limit (range->limit () - 1.0); break; default: gripe_wrong_type_arg ("operator --", type_as_string ()); break; } break; default: panic_impossible (); break; } } void TC_REP::resize (int i, int j) { switch (type_tag) { case matrix_constant: matrix->resize (i, j); break; case complex_matrix_constant: complex_matrix->resize (i, j); break; default: gripe_wrong_type_arg ("resize", type_as_string ()); break; } } void TC_REP::resize (int i, int j, double val) { switch (type_tag) { case matrix_constant: matrix->resize (i, j, val); break; case complex_matrix_constant: complex_matrix->resize (i, j, val); break; default: gripe_wrong_type_arg ("resize", type_as_string ()); break; } } void TC_REP::maybe_resize (int i, int j) { int nr = rows (); int nc = columns (); i++; j++; assert (i > 0 && j > 0); if (i > nr || j > nc) { if (user_pref.resize_on_range_error) resize (MAX (i, nr), MAX (j, nc), 0.0); else { if (i > nr) ::error ("row index = %d exceeds max row dimension = %d", i, nr); if (j > nc) ::error ("column index = %d exceeds max column dimension = %d", j, nc); } } } void TC_REP::maybe_resize (int i, force_orient f_orient) { int nr = rows (); int nc = columns (); i++; assert (i >= 0 && (nr <= 1 || nc <= 1)); // This function never reduces the size of a vector, and all vectors // have dimensions of at least 0x0. If i is 0, it is either because // a vector has been indexed with a vector of all zeros (in which case // the index vector is empty and nothing will happen) or a vector has // been indexed with 0 (an error which will be caught elsewhere). if (i == 0) return; if (nr <= 1 && nc <= 1 && i >= 1) { if (user_pref.resize_on_range_error) { if (f_orient == row_orient) resize (1, i, 0.0); else if (f_orient == column_orient) resize (i, 1, 0.0); else if (user_pref.prefer_column_vectors) resize (i, 1, 0.0); else resize (1, i, 0.0); } else ::error ("matrix index = %d exceeds max dimension = %d", i, nc); } else if (nr == 1 && i > nc) { if (user_pref.resize_on_range_error) resize (1, i, 0.0); else ::error ("matrix index = %d exceeds max dimension = %d", i, nc); } else if (nc == 1 && i > nr) { if (user_pref.resize_on_range_error) resize (i, 1, 0.0); else ::error ("matrix index = %d exceeds max dimension = ", i, nc); } } void TC_REP::stash_original_text (char *s) { orig_text = strsave (s); } void TC_REP::maybe_mutate (void) { if (error_state) return; switch (type_tag) { case complex_scalar_constant: if (::imag (*complex_scalar) == 0.0) { double d = ::real (*complex_scalar); delete complex_scalar; scalar = d; type_tag = scalar_constant; } break; case complex_matrix_constant: if (! any_element_is_complex (*complex_matrix)) { Matrix *m = new Matrix (::real (*complex_matrix)); delete complex_matrix; matrix = m; type_tag = matrix_constant; } break; default: break; } // Avoid calling rows() and columns() for things like magic_colon. int nr = 1; int nc = 1; if (type_tag == matrix_constant || type_tag == complex_matrix_constant || type_tag == range_constant) { nr = rows (); nc = columns (); } switch (type_tag) { case matrix_constant: if (nr == 1 && nc == 1) { double d = matrix->elem (0, 0); delete matrix; scalar = d; type_tag = scalar_constant; } break; case complex_matrix_constant: if (nr == 1 && nc == 1) { Complex c = complex_matrix->elem (0, 0); delete complex_matrix; complex_scalar = new Complex (c); type_tag = complex_scalar_constant; } break; case range_constant: if (nr == 1 && nc == 1) { double d = range->base (); delete range; scalar = d; type_tag = scalar_constant; } break; default: break; } } void TC_REP::print (void) { if (error_state) return; ostrstream output_buf; switch (type_tag) { case scalar_constant: octave_print_internal (output_buf, scalar); break; case matrix_constant: octave_print_internal (output_buf, *matrix); break; case complex_scalar_constant: octave_print_internal (output_buf, *complex_scalar); break; case complex_matrix_constant: octave_print_internal (output_buf, *complex_matrix); break; case string_constant: output_buf << string << "\n"; break; case range_constant: octave_print_internal (output_buf, *range); break; case map_constant: { output_buf << "first (); p != 0; a_map->next (p)) { if (first) { output_buf << ":"; first = 0; } output_buf << " " << a_map->key (p); } output_buf << ">\n"; } break; case unknown_constant: case magic_colon: case all_va_args: panic_impossible (); break; } output_buf << ends; maybe_page_output (output_buf); } void TC_REP::print_code (ostream& os) { switch (type_tag) { case scalar_constant: if (orig_text) os << orig_text; else octave_print_internal (os, scalar, 1); break; case matrix_constant: octave_print_internal (os, *matrix, 1); break; case complex_scalar_constant: { double re = complex_scalar->real (); double im = complex_scalar->imag (); // If we have the original text and a pure imaginary, just print the // original text, because this must be a constant that was parsed as // part of a function. if (orig_text && re == 0.0 && im > 0.0) os << orig_text; else octave_print_internal (os, *complex_scalar, 1); } break; case complex_matrix_constant: octave_print_internal (os, *complex_matrix, 1); break; case string_constant: { os << "\""; char *s, *t = string; while (s = undo_string_escape (*t++)) os << s; os << "\""; } break; case range_constant: octave_print_internal (os, *range, 1); break; case magic_colon: os << ":"; break; case all_va_args: os << "all_va_args"; break; case map_constant: case unknown_constant: panic_impossible (); break; } } void TC_REP::gripe_wrong_type_arg (const char *name, const tree_constant_rep& tcr) const { if (name) ::error ("%s: wrong type argument `%s'", name, tcr.type_as_string ()); else ::error ("wrong type argument `%s'", name, tcr.type_as_string ()); } char * TC_REP::type_as_string (void) const { switch (type_tag) { case scalar_constant: return "real scalar"; case matrix_constant: return "real matrix"; case complex_scalar_constant: return "complex scalar"; case complex_matrix_constant: return "complex matrix"; case string_constant: return "string"; case range_constant: return "range"; case map_constant: return "structure"; default: return ""; } } tree_constant do_binary_op (tree_constant& a, tree_constant& b, tree_expression::type t) { tree_constant retval; int first_empty = (a.rows () == 0 || a.columns () == 0); int second_empty = (b.rows () == 0 || b.columns () == 0); if (first_empty || second_empty) { int flag = user_pref.propagate_empty_matrices; if (flag < 0) warning ("binary operation on empty matrix"); else if (flag == 0) { ::error ("invalid binary operation on empty matrix"); return retval; } } tree_constant tmp_a = a.make_numeric (); if (error_state) return retval; tree_constant tmp_b = b.make_numeric (); if (error_state) return retval; TC_REP::constant_type a_type = tmp_a.const_type (); TC_REP::constant_type b_type = tmp_b.const_type (); double d1, d2; Matrix m1, m2; Complex c1, c2; ComplexMatrix cm1, cm2; switch (a_type) { case TC_REP::scalar_constant: d1 = tmp_a.double_value (); switch (b_type) { case TC_REP::scalar_constant: d2 = tmp_b.double_value (); retval = do_binary_op (d1, d2, t); break; case TC_REP::matrix_constant: m2 = tmp_b.matrix_value (); retval = do_binary_op (d1, m2, t); break; case TC_REP::complex_scalar_constant: c2 = tmp_b.complex_value (); retval = do_binary_op (d1, c2, t); break; case TC_REP::complex_matrix_constant: cm2 = tmp_b.complex_matrix_value (); retval = do_binary_op (d1, cm2, t); break; default: gripe_wrong_type_arg_for_binary_op (tmp_b); break; } break; case TC_REP::matrix_constant: m1 = tmp_a.matrix_value (); switch (b_type) { case TC_REP::scalar_constant: d2 = tmp_b.double_value (); retval = do_binary_op (m1, d2, t); break; case TC_REP::matrix_constant: m2 = tmp_b.matrix_value (); retval = do_binary_op (m1, m2, t); break; case TC_REP::complex_scalar_constant: c2 = tmp_b.complex_value (); retval = do_binary_op (m1, c2, t); break; case TC_REP::complex_matrix_constant: cm2 = tmp_b.complex_matrix_value (); retval = do_binary_op (m1, cm2, t); break; default: gripe_wrong_type_arg_for_binary_op (tmp_b); break; } break; case TC_REP::complex_scalar_constant: c1 = tmp_a.complex_value (); switch (b_type) { case TC_REP::scalar_constant: d2 = tmp_b.double_value (); retval = do_binary_op (c1, d2, t); break; case TC_REP::matrix_constant: m2 = tmp_b.matrix_value (); retval = do_binary_op (c1, m2, t); break; case TC_REP::complex_scalar_constant: c2 = tmp_b.complex_value (); retval = do_binary_op (c1, c2, t); break; case TC_REP::complex_matrix_constant: cm2 = tmp_b.complex_matrix_value (); retval = do_binary_op (c1, cm2, t); break; default: gripe_wrong_type_arg_for_binary_op (tmp_b); break; } break; case TC_REP::complex_matrix_constant: cm1 = tmp_a.complex_matrix_value (); switch (b_type) { case TC_REP::scalar_constant: d2 = tmp_b.double_value (); retval = do_binary_op (cm1, d2, t); break; case TC_REP::matrix_constant: m2 = tmp_b.matrix_value (); retval = do_binary_op (cm1, m2, t); break; case TC_REP::complex_scalar_constant: c2 = tmp_b.complex_value (); retval = do_binary_op (cm1, c2, t); break; case TC_REP::complex_matrix_constant: cm2 = tmp_b.complex_matrix_value (); retval = do_binary_op (cm1, cm2, t); break; default: gripe_wrong_type_arg_for_binary_op (tmp_b); break; } break; default: gripe_wrong_type_arg_for_binary_op (tmp_a); break; } return retval; } tree_constant do_unary_op (tree_constant& a, tree_expression::type t) { tree_constant retval; if (a.rows () == 0 || a.columns () == 0) { int flag = user_pref.propagate_empty_matrices; if (flag < 0) warning ("unary operation on empty matrix"); else if (flag == 0) { ::error ("invalid unary operation on empty matrix"); return retval; } } tree_constant tmp_a = a.make_numeric (); if (error_state) return retval; switch (tmp_a.const_type ()) { case TC_REP::scalar_constant: retval = do_unary_op (tmp_a.double_value (), t); break; case TC_REP::matrix_constant: { Matrix m = tmp_a.matrix_value (); retval = do_unary_op (m, t); } break; case TC_REP::complex_scalar_constant: retval = do_unary_op (tmp_a.complex_value (), t); break; case TC_REP::complex_matrix_constant: { ComplexMatrix m = tmp_a.complex_matrix_value (); retval = do_unary_op (m, t); } break; default: gripe_wrong_type_arg_for_unary_op (tmp_a); break; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tc-rep-ass.cc100666 415 17 153523 5702417011 14261 0ustar jweusers// tc-rep-ass.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include "mx-base.h" #include "Range.h" #include "arith-ops.h" #include "variables.h" #include "sysdep.h" #include "error.h" #include "gripes.h" #include "user-prefs.h" #include "utils.h" #include "pager.h" #include "pr-output.h" #include "tree-const.h" #include "idx-vector.h" #include "oct-map.h" #include "tc-inlines.h" // Top-level tree-constant function that handles assignments. Only // decide if the left-hand side is currently a scalar or a matrix and // hand off to other functions to do the real work. void TC_REP::assign (tree_constant& rhs, const Octave_object& args) { tree_constant rhs_tmp = rhs.make_numeric (); if (error_state) return; // This is easier than actually handling assignments to strings. // An assignment to a range will normally require a conversion to a // vector since it will normally destroy the equally-spaced property // of the range elements. if (is_defined () && ! is_numeric_type ()) force_numeric (); if (error_state) return; switch (type_tag) { case complex_scalar_constant: case scalar_constant: case unknown_constant: do_scalar_assignment (rhs_tmp, args); break; case complex_matrix_constant: case matrix_constant: do_matrix_assignment (rhs_tmp, args); break; default: ::error ("invalid assignment to %s", type_as_string ()); break; } } // Assignments to scalars. If resize_on_range_error is true, // this can convert the left-hand side to a matrix. void TC_REP::do_scalar_assignment (const tree_constant& rhs, const Octave_object& args) { assert (type_tag == unknown_constant || type_tag == scalar_constant || type_tag == complex_scalar_constant); int nargin = args.length (); if ((rhs.is_scalar_type () || rhs.is_zero_by_zero ()) && valid_scalar_indices (args)) { if (rhs.is_zero_by_zero ()) { if (type_tag == complex_scalar_constant) delete complex_scalar; matrix = new Matrix (0, 0); type_tag = matrix_constant; } else if (type_tag == unknown_constant || type_tag == scalar_constant) { if (rhs.const_type () == scalar_constant) { scalar = rhs.double_value (); type_tag = scalar_constant; } else if (rhs.const_type () == complex_scalar_constant) { complex_scalar = new Complex (rhs.complex_value ()); type_tag = complex_scalar_constant; } else { ::error ("invalid assignment to scalar"); return; } } else { if (rhs.const_type () == scalar_constant) { delete complex_scalar; scalar = rhs.double_value (); type_tag = scalar_constant; } else if (rhs.const_type () == complex_scalar_constant) { *complex_scalar = rhs.complex_value (); type_tag = complex_scalar_constant; } else { ::error ("invalid assignment to scalar"); return; } } } else if (user_pref.resize_on_range_error) { TC_REP::constant_type old_type_tag = type_tag; if (type_tag == complex_scalar_constant) { Complex *old_complex = complex_scalar; complex_matrix = new ComplexMatrix (1, 1, *complex_scalar); type_tag = complex_matrix_constant; delete old_complex; } else if (type_tag == scalar_constant) { matrix = new Matrix (1, 1, scalar); type_tag = matrix_constant; } // If there is an error, the call to do_matrix_assignment should not // destroy the current value. // TC_REP::eval(int) will take // care of converting single element matrices back to scalars. do_matrix_assignment (rhs, args); // I don't think there's any other way to revert back to unknown // constant types, so here it is. if (old_type_tag == unknown_constant && error_state) { if (type_tag == matrix_constant) delete matrix; else if (type_tag == complex_matrix_constant) delete complex_matrix; type_tag = unknown_constant; } } else if (nargin > 2 || nargin < 1) ::error ("invalid index expression for scalar type"); else ::error ("index invalid or out of range for scalar type"); } // Assignments to matrices (and vectors). // // For compatibility with Matlab, we allow assignment of an empty // matrix to an expression with empty indices to do nothing. void TC_REP::do_matrix_assignment (const tree_constant& rhs, const Octave_object& args) { assert (type_tag == unknown_constant || type_tag == matrix_constant || type_tag == complex_matrix_constant); if (type_tag == matrix_constant && rhs.is_complex_type ()) { Matrix *old_matrix = matrix; complex_matrix = new ComplexMatrix (*matrix); type_tag = complex_matrix_constant; delete old_matrix; } else if (type_tag == unknown_constant) { if (rhs.is_complex_type ()) { complex_matrix = new ComplexMatrix (); type_tag = complex_matrix_constant; } else { matrix = new Matrix (); type_tag = matrix_constant; } } int nargin = args.length (); // The do_matrix_assignment functions can't handle empty matrices, so // don't let any pass through here. switch (nargin) { case 1: { tree_constant arg = args(0); if (arg.is_undefined ()) ::error ("matrix index is undefined"); else do_matrix_assignment (rhs, arg); } break; case 2: { tree_constant arg_a = args(0); tree_constant arg_b = args(1); if (arg_a.is_undefined ()) ::error ("first matrix index is undefined"); else if (arg_b.is_undefined ()) ::error ("second matrix index is undefined"); else if (arg_a.is_empty () || arg_b.is_empty ()) { if (! rhs.is_empty ()) { ::error ("in assignment expression, a matrix index is empty"); ::error ("but the right hand side is not an empty matrix"); } // XXX FIXME XXX -- to really be correct here, we should probably // check to see if the assignment conforms, but that seems like more // work than it's worth right now... } else do_matrix_assignment (rhs, arg_a, arg_b); } break; default: if (nargin == 0) ::error ("matrix indices expected, but none provided"); else ::error ("too many indices for matrix expression"); break; } } // Matrix assignments indexed by a single value. void TC_REP::do_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg) { int nr = rows (); int nc = columns (); if (user_pref.do_fortran_indexing || nr <= 1 || nc <= 1) { if (i_arg.is_empty ()) { if (! rhs.is_empty ()) { ::error ("in assignment expression, matrix index is empty but"); ::error ("right hand side is not an empty matrix"); } // XXX FIXME XXX -- to really be correct here, we should probably // check to see if the assignment conforms, but that seems like more // work than it's worth right now... // The assignment functions can't handle empty matrices, so don't let // any pass through here. return; } // We can't handle the case of assigning to a vector first, since even // then, the two operations are not equivalent. For example, the // expression V(:) = M is handled differently depending on whether the // user specified do_fortran_indexing = "true". if (user_pref.do_fortran_indexing) fortran_style_matrix_assignment (rhs, i_arg); else if (nr <= 1 || nc <= 1) vector_assignment (rhs, i_arg); else panic_impossible (); } else ::error ("single index only valid for row or column vector"); } // Fortran-style assignments. Matrices are assumed to be stored in // column-major order and it is ok to use a single index for // multi-dimensional matrices. void TC_REP::fortran_style_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg) { tree_constant tmp_i = i_arg.make_numeric_or_magic (); if (error_state) return; TC_REP::constant_type itype = tmp_i.const_type (); int nr = rows (); int nc = columns (); int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = NINT (tmp_i.double_value ()); int idx = i - 1; if (rhs_nr == 0 && rhs_nc == 0) { if (idx < nr * nc) { convert_to_row_or_column_vector (); nr = rows (); nc = columns (); if (nr == 1) delete_column (idx); else if (nc == 1) delete_row (idx); else panic_impossible (); } return; } if (index_check (idx, "") < 0) return; if (nr <= 1 || nc <= 1) { maybe_resize (idx); if (error_state) return; } else if (range_max_check (idx, nr * nc) < 0) return; nr = rows (); nc = columns (); if (! indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) { ::error ("for A(int) = X: X must be a scalar"); return; } int ii = fortran_row (i, nr) - 1; int jj = fortran_column (i, nr) - 1; do_matrix_assignment (rhs, ii, jj); } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); int len = nr * nc; idx_vector ii (mi, 1, "", len); // Always do fortran indexing here... if (! ii) return; if (rhs_nr == 0 && rhs_nc == 0) { ii.sort_uniq (); int num_to_delete = 0; for (int i = 0; i < ii.length (); i++) { if (ii.elem (i) < len) num_to_delete++; else break; } if (num_to_delete > 0) { if (num_to_delete != ii.length ()) ii.shorten (num_to_delete); convert_to_row_or_column_vector (); nr = rows (); nc = columns (); if (nr == 1) delete_columns (ii); else if (nc == 1) delete_rows (ii); else panic_impossible (); } return; } if (nr <= 1 || nc <= 1) { maybe_resize (ii.max ()); if (error_state) return; } else if (range_max_check (ii.max (), len) < 0) return; int ilen = ii.capacity (); if (ilen != rhs_nr * rhs_nc) { ::error ("A(matrix) = X: X and matrix must have the same number"); ::error ("of elements"); } else if (ilen == 1 && rhs.is_scalar_type ()) { int nr = rows (); int idx = ii.elem (0); int ii = fortran_row (idx + 1, nr) - 1; int jj = fortran_column (idx + 1, nr) - 1; if (rhs.const_type () == scalar_constant) matrix->elem (ii, jj) = rhs.double_value (); else if (rhs.const_type () == complex_scalar_constant) complex_matrix->elem (ii, jj) = rhs.complex_value (); else panic_impossible (); } else fortran_style_matrix_assignment (rhs, ii); } break; case string_constant: gripe_string_invalid (); break; case range_constant: gripe_range_invalid (); break; case magic_colon: // a(:) = [] is equivalent to a(:,:) = []. if (rhs_nr == 0 && rhs_nc == 0) do_matrix_assignment (rhs, magic_colon, magic_colon); else fortran_style_matrix_assignment (rhs, magic_colon); break; default: panic_impossible (); break; } } // Fortran-style assignment for vector index. void TC_REP::fortran_style_matrix_assignment (const tree_constant& rhs, idx_vector& i) { assert (rhs.is_matrix_type ()); int ilen = i.capacity (); REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int len = rhs_nr * rhs_nc; if (len == ilen) { int nr = rows (); if (rhs.const_type () == matrix_constant) { double *cop_out = rhs_m.fortran_vec (); for (int k = 0; k < len; k++) { int ii = fortran_row (i.elem (k) + 1, nr) - 1; int jj = fortran_column (i.elem (k) + 1, nr) - 1; matrix->elem (ii, jj) = *cop_out++; } } else { Complex *cop_out = rhs_cm.fortran_vec (); for (int k = 0; k < len; k++) { int ii = fortran_row (i.elem (k) + 1, nr) - 1; int jj = fortran_column (i.elem (k) + 1, nr) - 1; complex_matrix->elem (ii, jj) = *cop_out++; } } } else ::error ("number of rows and columns must match for indexed assignment"); } // Fortran-style assignment for colon index. void TC_REP::fortran_style_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type mci) { assert (rhs.is_matrix_type () && mci == TC_REP::magic_colon); int nr = rows (); int nc = columns (); REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int rhs_size = rhs_nr * rhs_nc; if (rhs_size == 0) { if (rhs.const_type () == matrix_constant) { delete matrix; matrix = new Matrix (0, 0); return; } else panic_impossible (); } else if (nr*nc != rhs_size) { ::error ("A(:) = X: X and A must have the same number of elements"); return; } if (rhs.const_type () == matrix_constant) { double *cop_out = rhs_m.fortran_vec (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) matrix->elem (i, j) = *cop_out++; } else { Complex *cop_out = rhs_cm.fortran_vec (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) complex_matrix->elem (i, j) = *cop_out++; } } // Assignments to vectors. Hand off to other functions once we know // what kind of index we have. For a colon, it is the same as // assignment to a matrix indexed by two colons. void TC_REP::vector_assignment (const tree_constant& rhs, const tree_constant& i_arg) { int nr = rows (); int nc = columns (); assert ((nr == 1 || nc == 1 || (nr == 0 && nc == 0)) && ! user_pref.do_fortran_indexing); tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type itype = tmp_i.const_type (); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = tree_to_mat_idx (tmp_i.double_value ()); if (index_check (i, "") < 0) return; do_vector_assign (rhs, i); } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); int len = nr * nc; idx_vector iv (mi, user_pref.do_fortran_indexing, "", len); if (! iv) return; do_vector_assign (rhs, iv); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range ri = tmp_i.range_value (); int len = nr * nc; if (len == 2 && is_zero_one (ri)) { do_vector_assign (rhs, 1); } else if (len == 2 && is_one_zero (ri)) { do_vector_assign (rhs, 0); } else { if (index_check (ri, "") < 0) return; do_vector_assign (rhs, ri); } } break; case magic_colon: { int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); if (! indexed_assign_conforms (nr, nc, rhs_nr, rhs_nc)) { ::error ("A(:) = X: X and A must have the same dimensions"); return; } do_matrix_assignment (rhs, magic_colon, magic_colon); } break; default: panic_impossible (); break; } } // Check whether an indexed assignment to a vector is valid. void TC_REP::check_vector_assign (int rhs_nr, int rhs_nc, int ilen, const char *rm) { int nr = rows (); int nc = columns (); if ((nr == 1 && nc == 1) || nr == 0 || nc == 0) // No orientation. { if (! (ilen == rhs_nr || ilen == rhs_nc)) { ::error ("A(%s) = X: X and %s must have the same number of elements", rm, rm); } } else if (nr == 1) // Preserve current row orientation. { if (! (rhs_nr == 1 && rhs_nc == ilen)) { ::error ("A(%s) = X: where A is a row vector, X must also be a", rm); ::error ("row vector with the same number of elements as %s", rm); } } else if (nc == 1) // Preserve current column orientation. { if (! (rhs_nc == 1 && rhs_nr == ilen)) { ::error ("A(%s) = X: where A is a column vector, X must also be", rm); ::error ("a column vector with the same number of elements as %s", rm); } } else panic_impossible (); } // Assignment to a vector with an integer index. void TC_REP::do_vector_assign (const tree_constant& rhs, int i) { int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); if (indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) { maybe_resize (i); if (error_state) return; int nr = rows (); int nc = columns (); if (nr == 1) { REP_ELEM_ASSIGN (0, i, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else if (nc == 1) { REP_ELEM_ASSIGN (i, 0, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else panic_impossible (); } else if (rhs_nr == 0 && rhs_nc == 0) { int nr = rows (); int nc = columns (); int len = MAX (nr, nc); if (i < 0 || i >= len) { ::error ("A(int) = []: index out of range"); return; } if (nr == 1) delete_column (i); else if (nc == 1) delete_row (i); else panic_impossible (); } else { ::error ("for A(int) = X: X must be a scalar"); return; } } // Assignment to a vector with a vector index. void TC_REP::do_vector_assign (const tree_constant& rhs, idx_vector& iv) { if (rhs.is_zero_by_zero ()) { int nr = rows (); int nc = columns (); int len = MAX (nr, nc); if (iv.max () >= len) { ::error ("A(matrix) = []: index out of range"); return; } if (nr == 1) delete_columns (iv); else if (nc == 1) delete_rows (iv); else panic_impossible (); } else if (rhs.is_scalar_type ()) { int nr = rows (); int nc = columns (); if (iv.capacity () == 1) { int idx = iv.elem (0); if (nr == 1) { REP_ELEM_ASSIGN (0, idx, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else if (nc == 1) { REP_ELEM_ASSIGN (idx, 0, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else panic_impossible (); } else { if (nr == 1) { ::error ("A(matrix) = X: where A is a row vector, X must also be a"); ::error ("row vector with the same number of elements as matrix"); } else if (nc == 1) { ::error ("A(matrix) = X: where A is a column vector, X must also be a"); ::error ("column vector with the same number of elements as matrix"); } else panic_impossible (); } } else if (rhs.is_matrix_type ()) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int ilen = iv.capacity (); check_vector_assign (rhs_nr, rhs_nc, ilen, "matrix"); if (error_state) return; force_orient f_orient = no_orient; if (rhs_nr == 1 && rhs_nc != 1) f_orient = row_orient; else if (rhs_nc == 1 && rhs_nr != 1) f_orient = column_orient; maybe_resize (iv.max (), f_orient); if (error_state) return; int nr = rows (); int nc = columns (); if (nr == 1 && rhs_nr == 1) { for (int i = 0; i < iv.capacity (); i++) REP_ELEM_ASSIGN (0, iv.elem (i), rhs_m.elem (0, i), rhs_cm.elem (0, i), rhs.is_real_type ()); } else if (nc == 1 && rhs_nc == 1) { for (int i = 0; i < iv.capacity (); i++) REP_ELEM_ASSIGN (iv.elem (i), 0, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), rhs.is_real_type ()); } else ::error ("A(vector) = X: X must be the same size as vector"); } else panic_impossible (); } // Assignment to a vector with a range index. void TC_REP::do_vector_assign (const tree_constant& rhs, Range& ri) { if (rhs.is_zero_by_zero ()) { int nr = rows (); int nc = columns (); int len = MAX (nr, nc); int b = tree_to_mat_idx (ri.min ()); int l = tree_to_mat_idx (ri.max ()); if (b < 0 || l >= len) { ::error ("A(range) = []: index out of range"); return; } if (nr == 1) delete_columns (ri); else if (nc == 1) delete_rows (ri); else panic_impossible (); } else if (rhs.is_scalar_type ()) { int nr = rows (); int nc = columns (); if (nr == 1) { ::error ("A(range) = X: where A is a row vector, X must also be a"); ::error ("row vector with the same number of elements as range"); } else if (nc == 1) { ::error ("A(range) = X: where A is a column vector, X must also be a"); ::error ("column vector with the same number of elements as range"); } else panic_impossible (); } else if (rhs.is_matrix_type ()) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int ilen = ri.nelem (); check_vector_assign (rhs_nr, rhs_nc, ilen, "range"); if (error_state) return; force_orient f_orient = no_orient; if (rhs_nr == 1 && rhs_nc != 1) f_orient = row_orient; else if (rhs_nc == 1 && rhs_nr != 1) f_orient = column_orient; maybe_resize (tree_to_mat_idx (ri.max ()), f_orient); if (error_state) return; int nr = rows (); int nc = columns (); double b = ri.base (); double increment = ri.inc (); if (nr == 1) { for (int i = 0; i < ri.nelem (); i++) { double tmp = b + i * increment; int col = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (0, col, rhs_m.elem (0, i), rhs_cm.elem (0, i), rhs.is_real_type ()); } } else if (nc == 1) { for (int i = 0; i < ri.nelem (); i++) { double tmp = b + i * increment; int row = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (row, 0, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), rhs.is_real_type ()); } } else panic_impossible (); } else panic_impossible (); } // Matrix assignment indexed by two values. This function determines // the type of the first arugment, checks as much as possible, and // then calls one of a set of functions to handle the specific cases: // // M (integer, arg2) = RHS (MA1) // M (vector, arg2) = RHS (MA2) // M (range, arg2) = RHS (MA3) // M (colon, arg2) = RHS (MA4) // // Each of those functions determines the type of the second argument // and calls another function to handle the real work of doing the // assignment. void TC_REP::do_matrix_assignment (const tree_constant& rhs, const tree_constant& i_arg, const tree_constant& j_arg) { tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type itype = tmp_i.const_type (); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = tree_to_mat_idx (tmp_i.double_value ()); do_matrix_assignment (rhs, i, j_arg); } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); idx_vector iv (mi, user_pref.do_fortran_indexing, "row", rows ()); if (! iv) return; do_matrix_assignment (rhs, iv, j_arg); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range ri = tmp_i.range_value (); int nr = rows (); if (nr == 2 && is_zero_one (ri)) { do_matrix_assignment (rhs, 1, j_arg); } else if (nr == 2 && is_one_zero (ri)) { do_matrix_assignment (rhs, 0, j_arg); } else { if (index_check (ri, "row") < 0) return; do_matrix_assignment (rhs, ri, j_arg); } } break; case magic_colon: do_matrix_assignment (rhs, magic_colon, j_arg); break; default: panic_impossible (); break; } } /* MA1 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, int i, const tree_constant& j_arg) { tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type jtype = tmp_j.const_type (); int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { if (index_check (i, "row") < 0) return; int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return; if (! indexed_assign_conforms (1, 1, rhs_nr, rhs_nc)) { ::error ("A(int,int) = X, X must be a scalar"); return; } maybe_resize (i, j); if (error_state) return; do_matrix_assignment (rhs, i, j); } break; case complex_matrix_constant: case matrix_constant: { if (index_check (i, "row") < 0) return; Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", columns ()); if (! jv) return; if (! indexed_assign_conforms (1, jv.capacity (), rhs_nr, rhs_nc)) { ::error ("A(int,matrix) = X: X must be a row vector with the same"); ::error ("number of elements as matrix"); return; } maybe_resize (i, jv.max ()); if (error_state) return; do_matrix_assignment (rhs, i, jv); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { if (index_check (i, "row") < 0) return; Range rj = tmp_j.range_value (); if (! indexed_assign_conforms (1, rj.nelem (), rhs_nr, rhs_nc)) { ::error ("A(int,range) = X: X must be a row vector with the same"); ::error ("number of elements as range"); return; } int nc = columns (); if (nc == 2 && is_zero_one (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, i, 1); } else if (nc == 2 && is_one_zero (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, i, 0); } else { if (index_check (rj, "column") < 0) return; maybe_resize (i, tree_to_mat_idx (rj.max ())); if (error_state) return; do_matrix_assignment (rhs, i, rj); } } break; case magic_colon: { int nc = columns (); int nr = rows (); if (i == -1 && nr == 1 && rhs_nr == 0 && rhs_nc == 0 || index_check (i, "row") < 0) return; else if (nc == 0 && nr == 0 && rhs_nr == 1) { if (rhs.is_complex_type ()) { complex_matrix = new ComplexMatrix (); type_tag = complex_matrix_constant; } else { matrix = new Matrix (); type_tag = matrix_constant; } maybe_resize (i, rhs_nc-1); if (error_state) return; } else if (indexed_assign_conforms (1, nc, rhs_nr, rhs_nc)) { maybe_resize (i, nc-1); if (error_state) return; } else if (rhs_nr == 0 && rhs_nc == 0) { if (i < 0 || i >= nr) { ::error ("A(int,:) = []: row index out of range"); return; } } else { ::error ("A(int,:) = X: X must be a row vector with the same"); ::error ("number of columns as A"); return; } do_matrix_assignment (rhs, i, magic_colon); } break; default: panic_impossible (); break; } } /* MA2 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, const tree_constant& j_arg) { tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type jtype = tmp_j.const_type (); int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return; if (! indexed_assign_conforms (iv.capacity (), 1, rhs_nr, rhs_nc)) { ::error ("A(matrix,int) = X: X must be a column vector with the"); ::error ("same number of elements as matrix"); return; } maybe_resize (iv.max (), j); if (error_state) return; do_matrix_assignment (rhs, iv, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", columns ()); if (! jv) return; if (! indexed_assign_conforms (iv.capacity (), jv.capacity (), rhs_nr, rhs_nc)) { ::error ("A(r_mat,c_mat) = X: the number of rows in X must match"); ::error ("the number of elements in r_mat and the number of"); ::error ("columns in X must match the number of elements in c_mat"); return; } maybe_resize (iv.max (), jv.max ()); if (error_state) return; do_matrix_assignment (rhs, iv, jv); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); if (! indexed_assign_conforms (iv.capacity (), rj.nelem (), rhs_nr, rhs_nc)) { ::error ("A(matrix,range) = X: the number of rows in X must match"); ::error ("the number of elements in matrix and the number of"); ::error ("columns in X must match the number of elements in range"); return; } int nc = columns (); if (nc == 2 && is_zero_one (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, iv, 1); } else if (nc == 2 && is_one_zero (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, iv, 0); } else { if (index_check (rj, "column") < 0) return; maybe_resize (iv.max (), tree_to_mat_idx (rj.max ())); if (error_state) return; do_matrix_assignment (rhs, iv, rj); } } break; case magic_colon: { int nc = columns (); int new_nc = nc; if (nc == 0) new_nc = rhs_nc; if (indexed_assign_conforms (iv.capacity (), new_nc, rhs_nr, rhs_nc)) { maybe_resize (iv.max (), new_nc-1); if (error_state) return; } else if (rhs_nr == 0 && rhs_nc == 0) { if (iv.max () >= rows ()) { ::error ("A(matrix,:) = []: row index out of range"); return; } } else { ::error ("A(matrix,:) = X: the number of rows in X must match the"); ::error ("number of elements in matrix, and the number of columns"); ::error ("in X must match the number of columns in A"); return; } do_matrix_assignment (rhs, iv, magic_colon); } break; default: panic_impossible (); break; } } /* MA3 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, Range& ri, const tree_constant& j_arg) { tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type jtype = tmp_j.const_type (); int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return; if (! indexed_assign_conforms (ri.nelem (), 1, rhs_nr, rhs_nc)) { ::error ("A(range,int) = X: X must be a column vector with the"); ::error ("same number of elements as range"); return; } maybe_resize (tree_to_mat_idx (ri.max ()), j); if (error_state) return; do_matrix_assignment (rhs, ri, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", columns ()); if (! jv) return; if (! indexed_assign_conforms (ri.nelem (), jv.capacity (), rhs_nr, rhs_nc)) { ::error ("A(range,matrix) = X: the number of rows in X must match"); ::error ("the number of elements in range and the number of"); ::error ("columns in X must match the number of elements in matrix"); return; } maybe_resize (tree_to_mat_idx (ri.max ()), jv.max ()); if (error_state) return; do_matrix_assignment (rhs, ri, jv); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); if (! indexed_assign_conforms (ri.nelem (), rj.nelem (), rhs_nr, rhs_nc)) { ::error ("A(r_range,c_range) = X: the number of rows in X must"); ::error ("match the number of elements in r_range and the number"); ::error ("of columns in X must match the number of elements in"); ::error ("c_range"); return; } int nc = columns (); if (nc == 2 && is_zero_one (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, ri, 1); } else if (nc == 2 && is_one_zero (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, ri, 0); } else { if (index_check (rj, "column") < 0) return; maybe_resize (tree_to_mat_idx (ri.max ()), tree_to_mat_idx (rj.max ())); if (error_state) return; do_matrix_assignment (rhs, ri, rj); } } break; case magic_colon: { int nc = columns (); int new_nc = nc; if (nc == 0) new_nc = rhs_nc; if (indexed_assign_conforms (ri.nelem (), new_nc, rhs_nr, rhs_nc)) { maybe_resize (tree_to_mat_idx (ri.max ()), new_nc-1); if (error_state) return; } else if (rhs_nr == 0 && rhs_nc == 0) { int b = tree_to_mat_idx (ri.min ()); int l = tree_to_mat_idx (ri.max ()); if (b < 0 || l >= rows ()) { ::error ("A(range,:) = []: row index out of range"); return; } } else { ::error ("A(range,:) = X: the number of rows in X must match the"); ::error ("number of elements in range, and the number of columns"); ::error ("in X must match the number of columns in A"); return; } do_matrix_assignment (rhs, ri, magic_colon); } break; default: panic_impossible (); break; } } /* MA4 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type i, const tree_constant& j_arg) { tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return; TC_REP::constant_type jtype = tmp_j.const_type (); int rhs_nr = rhs.rows (); int rhs_nc = rhs.columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); int nr = rows (); int nc = columns (); if (j == -1 && nc == 1 && rhs_nr == 0 && rhs_nc == 0 || index_check (j, "column") < 0) return; if (nr == 0 && nc == 0 && rhs_nc == 1) { if (rhs.is_complex_type ()) { complex_matrix = new ComplexMatrix (); type_tag = complex_matrix_constant; } else { matrix = new Matrix (); type_tag = matrix_constant; } maybe_resize (rhs_nr-1, j); if (error_state) return; } else if (indexed_assign_conforms (nr, 1, rhs_nr, rhs_nc)) { maybe_resize (nr-1, j); if (error_state) return; } else if (rhs_nr == 0 && rhs_nc == 0) { if (j < 0 || j >= nc) { ::error ("A(:,int) = []: column index out of range"); return; } } else { ::error ("A(:,int) = X: X must be a column vector with the same"); ::error ("number of rows as A"); return; } do_matrix_assignment (rhs, magic_colon, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", columns ()); if (! jv) return; int nr = rows (); int new_nr = nr; if (nr == 0) new_nr = rhs_nr; if (indexed_assign_conforms (new_nr, jv.capacity (), rhs_nr, rhs_nc)) { maybe_resize (new_nr-1, jv.max ()); if (error_state) return; } else if (rhs_nr == 0 && rhs_nc == 0) { if (jv.max () >= columns ()) { ::error ("A(:,matrix) = []: column index out of range"); return; } } else { ::error ("A(:,matrix) = X: the number of rows in X must match the"); ::error ("number of rows in A, and the number of columns in X must"); ::error ("match the number of elements in matrix"); return; } do_matrix_assignment (rhs, magic_colon, jv); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); int nr = rows (); int new_nr = nr; if (nr == 0) new_nr = rhs_nr; if (indexed_assign_conforms (new_nr, rj.nelem (), rhs_nr, rhs_nc)) { int nc = columns (); if (nc == 2 && is_zero_one (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, magic_colon, 1); } else if (nc == 2 && is_one_zero (rj) && rhs_nc == 1) { do_matrix_assignment (rhs, magic_colon, 0); } else { if (index_check (rj, "column") < 0) return; maybe_resize (new_nr-1, tree_to_mat_idx (rj.max ())); if (error_state) return; } } else if (rhs_nr == 0 && rhs_nc == 0) { int b = tree_to_mat_idx (rj.min ()); int l = tree_to_mat_idx (rj.max ()); if (b < 0 || l >= columns ()) { ::error ("A(:,range) = []: column index out of range"); return; } } else { ::error ("A(:,range) = X: the number of rows in X must match the"); ::error ("number of rows in A, and the number of columns in X"); ::error ("must match the number of elements in range"); return; } do_matrix_assignment (rhs, magic_colon, rj); } break; case magic_colon: // a(:,:) = foo is equivalent to a = foo. do_matrix_assignment (rhs, magic_colon, magic_colon); break; default: panic_impossible (); break; } } // Functions that actually handle assignment to a matrix using two // index values. // // idx2 // +---+---+----+----+ // idx1 | i | v | r | c | // ---------+---+---+----+----+ // integer | 1 | 5 | 9 | 13 | // ---------+---+---+----+----+ // vector | 2 | 6 | 10 | 14 | // ---------+---+---+----+----+ // range | 3 | 7 | 11 | 15 | // ---------+---+---+----+----+ // colon | 4 | 8 | 12 | 16 | // ---------+---+---+----+----+ /* 1 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, int i, int j) { REP_ELEM_ASSIGN (i, j, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } /* 2 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, int i, idx_vector& jv) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int j = 0; j < jv.capacity (); j++) REP_ELEM_ASSIGN (i, jv.elem (j), rhs_m.elem (0, j), rhs_cm.elem (0, j), rhs.is_real_type ()); } /* 3 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, int i, Range& rj) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); double b = rj.base (); double increment = rj.inc (); for (int j = 0; j < rj.nelem (); j++) { double tmp = b + j * increment; int col = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (i, col, rhs_m.elem (0, j), rhs_cm.elem (0, j), rhs.is_real_type ()); } } /* 4 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, int i, TC_REP::constant_type mcj) { assert (mcj == magic_colon); int nc = columns (); if (rhs.is_zero_by_zero ()) { delete_row (i); } else if (rhs.is_matrix_type ()) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int j = 0; j < nc; j++) REP_ELEM_ASSIGN (i, j, rhs_m.elem (0, j), rhs_cm.elem (0, j), rhs.is_real_type ()); } else if (rhs.is_scalar_type () && nc == 1) { REP_ELEM_ASSIGN (i, 0, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else panic_impossible (); } /* 5 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, int j) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int i = 0; i < iv.capacity (); i++) { int row = iv.elem (i); REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), rhs.is_real_type ()); } } /* 6 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, idx_vector& jv) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int i = 0; i < iv.capacity (); i++) { int row = iv.elem (i); for (int j = 0; j < jv.capacity (); j++) { int col = jv.elem (j); REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } /* 7 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, Range& rj) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); double b = rj.base (); double increment = rj.inc (); for (int i = 0; i < iv.capacity (); i++) { int row = iv.elem (i); for (int j = 0; j < rj.nelem (); j++) { double tmp = b + j * increment; int col = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } /* 8 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, idx_vector& iv, TC_REP::constant_type mcj) { assert (mcj == magic_colon); if (rhs.is_zero_by_zero ()) { delete_rows (iv); } else { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int nc = columns (); for (int j = 0; j < nc; j++) { for (int i = 0; i < iv.capacity (); i++) { int row = iv.elem (i); REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } } /* 9 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, Range& ri, int j) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); double b = ri.base (); double increment = ri.inc (); for (int i = 0; i < ri.nelem (); i++) { double tmp = b + i * increment; int row = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), rhs.is_real_type ()); } } /* 10 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, Range& ri, idx_vector& jv) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); double b = ri.base (); double increment = ri.inc (); for (int j = 0; j < jv.capacity (); j++) { int col = jv.elem (j); for (int i = 0; i < ri.nelem (); i++) { double tmp = b + i * increment; int row = tree_to_mat_idx (tmp); REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), rhs_m.elem (i, j), rhs.is_real_type ()); } } } /* 11 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, Range& ri, Range& rj) { double ib = ri.base (); double iinc = ri.inc (); double jb = rj.base (); double jinc = rj.inc (); REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int i = 0; i < ri.nelem (); i++) { double itmp = ib + i * iinc; int row = tree_to_mat_idx (itmp); for (int j = 0; j < rj.nelem (); j++) { double jtmp = jb + j * jinc; int col = tree_to_mat_idx (jtmp); REP_ELEM_ASSIGN (row, col, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } /* 12 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, Range& ri, TC_REP::constant_type mcj) { assert (mcj == magic_colon); if (rhs.is_zero_by_zero ()) { delete_rows (ri); } else { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); double ib = ri.base (); double iinc = ri.inc (); int nc = columns (); for (int i = 0; i < ri.nelem (); i++) { double itmp = ib + i * iinc; int row = tree_to_mat_idx (itmp); for (int j = 0; j < nc; j++) REP_ELEM_ASSIGN (row, j, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } /* 13 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type mci, int j) { assert (mci == magic_colon); int nr = rows (); if (rhs.is_zero_by_zero ()) { delete_column (j); } else if (rhs.is_matrix_type ()) { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); for (int i = 0; i < nr; i++) REP_ELEM_ASSIGN (i, j, rhs_m.elem (i, 0), rhs_cm.elem (i, 0), rhs.is_real_type ()); } else if (rhs.is_scalar_type () && nr == 1) { REP_ELEM_ASSIGN (0, j, rhs.double_value (), rhs.complex_value (), rhs.is_real_type ()); } else panic_impossible (); } /* 14 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type mci, idx_vector& jv) { assert (mci == magic_colon); if (rhs.is_zero_by_zero ()) { delete_columns (jv); } else { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int nr = rows (); for (int i = 0; i < nr; i++) { for (int j = 0; j < jv.capacity (); j++) { int col = jv.elem (j); REP_ELEM_ASSIGN (i, col, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } } /* 15 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type mci, Range& rj) { assert (mci == magic_colon); if (rhs.is_zero_by_zero ()) { delete_columns (rj); } else { REP_RHS_MATRIX (rhs, rhs_m, rhs_cm, rhs_nr, rhs_nc); int nr = rows (); double jb = rj.base (); double jinc = rj.inc (); for (int j = 0; j < rj.nelem (); j++) { double jtmp = jb + j * jinc; int col = tree_to_mat_idx (jtmp); for (int i = 0; i < nr; i++) { REP_ELEM_ASSIGN (i, col, rhs_m.elem (i, j), rhs_cm.elem (i, j), rhs.is_real_type ()); } } } } /* 16 */ void TC_REP::do_matrix_assignment (const tree_constant& rhs, TC_REP::constant_type mci, TC_REP::constant_type mcj) { assert (mci == magic_colon && mcj == magic_colon); switch (type_tag) { case scalar_constant: break; case matrix_constant: delete matrix; break; case complex_scalar_constant: delete complex_scalar; break; case complex_matrix_constant: delete complex_matrix; break; case string_constant: delete [] string; break; case range_constant: delete range; break; case magic_colon: default: panic_impossible (); break; } type_tag = rhs.const_type (); switch (type_tag) { case scalar_constant: scalar = rhs.double_value (); break; case matrix_constant: matrix = new Matrix (rhs.matrix_value ()); break; case string_constant: string = strsave (rhs.string_value ()); break; case complex_matrix_constant: complex_matrix = new ComplexMatrix (rhs.complex_matrix_value ()); break; case complex_scalar_constant: complex_scalar = new Complex (rhs.complex_value ()); break; case range_constant: range = new Range (rhs.range_value ()); break; case magic_colon: default: panic_impossible (); break; } } // Functions for deleting rows or columns of a matrix. These are used // to handle statements like // // M (i, j) = [] void TC_REP::delete_row (int idx) { if (type_tag == matrix_constant) { int nr = matrix->rows (); int nc = matrix->columns (); Matrix *new_matrix = new Matrix (nr-1, nc); int ii = 0; for (int i = 0; i < nr; i++) { if (i != idx) { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = matrix->elem (i, j); ii++; } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { int nr = complex_matrix->rows (); int nc = complex_matrix->columns (); ComplexMatrix *new_matrix = new ComplexMatrix (nr-1, nc); int ii = 0; for (int i = 0; i < nr; i++) { if (i != idx) { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = complex_matrix->elem (i, j); ii++; } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } void TC_REP::delete_rows (idx_vector& iv) { iv.sort_uniq (); int num_to_delete = iv.length (); int nr = rows (); int nc = columns (); // If deleting all rows of a column vector, make result 0x0. if (nc == 1 && num_to_delete == nr) nc = 0; if (type_tag == matrix_constant) { Matrix *new_matrix = new Matrix (nr-num_to_delete, nc); if (nr > num_to_delete) { int ii = 0; int idx = 0; for (int i = 0; i < nr; i++) { if (i == iv.elem (idx)) idx++; else { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = matrix->elem (i, j); ii++; } } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { ComplexMatrix *new_matrix = new ComplexMatrix (nr-num_to_delete, nc); if (nr > num_to_delete) { int ii = 0; int idx = 0; for (int i = 0; i < nr; i++) { if (i == iv.elem (idx)) idx++; else { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = complex_matrix->elem (i, j); ii++; } } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } void TC_REP::delete_rows (Range& ri) { ri.sort (); int num_to_delete = ri.nelem (); int nr = rows (); int nc = columns (); // If deleting all rows of a column vector, make result 0x0. if (nc == 1 && num_to_delete == nr) nc = 0; double ib = ri.base (); double iinc = ri.inc (); int max_idx = tree_to_mat_idx (ri.max ()); if (type_tag == matrix_constant) { Matrix *new_matrix = new Matrix (nr-num_to_delete, nc); if (nr > num_to_delete) { int ii = 0; int idx = 0; for (int i = 0; i < nr; i++) { double itmp = ib + idx * iinc; int row = tree_to_mat_idx (itmp); if (i == row && row <= max_idx) idx++; else { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = matrix->elem (i, j); ii++; } } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { ComplexMatrix *new_matrix = new ComplexMatrix (nr-num_to_delete, nc); if (nr > num_to_delete) { int ii = 0; int idx = 0; for (int i = 0; i < nr; i++) { double itmp = ib + idx * iinc; int row = tree_to_mat_idx (itmp); if (i == row && row <= max_idx) idx++; else { for (int j = 0; j < nc; j++) new_matrix->elem (ii, j) = complex_matrix->elem (i, j); ii++; } } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } void TC_REP::delete_column (int idx) { if (type_tag == matrix_constant) { int nr = matrix->rows (); int nc = matrix->columns (); Matrix *new_matrix = new Matrix (nr, nc-1); int jj = 0; for (int j = 0; j < nc; j++) { if (j != idx) { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = matrix->elem (i, j); jj++; } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { int nr = complex_matrix->rows (); int nc = complex_matrix->columns (); ComplexMatrix *new_matrix = new ComplexMatrix (nr, nc-1); int jj = 0; for (int j = 0; j < nc; j++) { if (j != idx) { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = complex_matrix->elem (i, j); jj++; } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } void TC_REP::delete_columns (idx_vector& jv) { jv.sort_uniq (); int num_to_delete = jv.length (); int nr = rows (); int nc = columns (); // If deleting all columns of a row vector, make result 0x0. if (nr == 1 && num_to_delete == nc) nr = 0; if (type_tag == matrix_constant) { Matrix *new_matrix = new Matrix (nr, nc-num_to_delete); if (nc > num_to_delete) { int jj = 0; int idx = 0; for (int j = 0; j < nc; j++) { if (j == jv.elem (idx)) idx++; else { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = matrix->elem (i, j); jj++; } } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { ComplexMatrix *new_matrix = new ComplexMatrix (nr, nc-num_to_delete); if (nc > num_to_delete) { int jj = 0; int idx = 0; for (int j = 0; j < nc; j++) { if (j == jv.elem (idx)) idx++; else { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = complex_matrix->elem (i, j); jj++; } } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } void TC_REP::delete_columns (Range& rj) { rj.sort (); int num_to_delete = rj.nelem (); int nr = rows (); int nc = columns (); // If deleting all columns of a row vector, make result 0x0. if (nr == 1 && num_to_delete == nc) nr = 0; double jb = rj.base (); double jinc = rj.inc (); int max_idx = tree_to_mat_idx (rj.max ()); if (type_tag == matrix_constant) { Matrix *new_matrix = new Matrix (nr, nc-num_to_delete); if (nc > num_to_delete) { int jj = 0; int idx = 0; for (int j = 0; j < nc; j++) { double jtmp = jb + idx * jinc; int col = tree_to_mat_idx (jtmp); if (j == col && col <= max_idx) idx++; else { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = matrix->elem (i, j); jj++; } } } delete matrix; matrix = new_matrix; } else if (type_tag == complex_matrix_constant) { ComplexMatrix *new_matrix = new ComplexMatrix (nr, nc-num_to_delete); if (nc > num_to_delete) { int jj = 0; int idx = 0; for (int j = 0; j < nc; j++) { double jtmp = jb + idx * jinc; int col = tree_to_mat_idx (jtmp); if (j == col && col <= max_idx) idx++; else { for (int i = 0; i < nr; i++) new_matrix->elem (i, jj) = complex_matrix->elem (i, j); jj++; } } } delete complex_matrix; complex_matrix = new_matrix; } else panic_impossible (); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tc-rep-idx.cc100666 415 17 72414 5702417011 14236 0ustar jweusers// tc-rep-idx.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include #include #include #include "mx-base.h" #include "Range.h" #include "arith-ops.h" #include "variables.h" #include "sysdep.h" #include "error.h" #include "gripes.h" #include "user-prefs.h" #include "utils.h" #include "pager.h" #include "pr-output.h" #include "tree-const.h" #include "idx-vector.h" #include "oct-map.h" #include "tc-inlines.h" // Indexing functions. // This is the top-level indexing function. tree_constant TC_REP::do_index (const Octave_object& args) { tree_constant retval; if (error_state) return retval; if (rows () == 0 || columns () == 0) { switch (args.length ()) { case 2: if (! args(1).is_magic_colon () && args(1).rows () != 0 && args(1).columns () != 0) goto index_error; case 1: if (! args(0).is_magic_colon () && args(0).rows () != 0 && args(0).columns () != 0) goto index_error; return Matrix (); default: index_error: ::error ("attempt to index empty matrix"); return retval; } } switch (type_tag) { case complex_scalar_constant: case scalar_constant: retval = do_scalar_index (args); break; case complex_matrix_constant: case matrix_constant: retval = do_matrix_index (args); break; case string_constant: gripe_string_invalid (); // retval = do_string_index (args); break; default: // This isn\'t great, but it\'s easier than implementing a lot of // other special indexing functions. force_numeric (); if (! error_state && is_numeric_type ()) retval = do_index (args); break; } return retval; } tree_constant TC_REP::do_scalar_index (const Octave_object& args) const { tree_constant retval; if (valid_scalar_indices (args)) { if (type_tag == scalar_constant) retval = scalar; else if (type_tag == complex_scalar_constant) retval = *complex_scalar; else panic_impossible (); return retval; } else { int rows = 0; int cols = 0; int nargin = args.length (); switch (nargin) { case 2: { tree_constant arg = args(1); if (arg.is_matrix_type ()) { Matrix mj = arg.matrix_value (); idx_vector j (mj, user_pref.do_fortran_indexing, "", 1); if (! j) return retval; int jmax = j.max (); int len = j.length (); if (len == j.ones_count ()) cols = len; else if (jmax > 0) { error ("invalid scalar index = %d", jmax+1); return retval; } } else if (arg.const_type () == magic_colon || (arg.is_scalar_type () && NINT (arg.double_value ()) == 1)) { cols = 1; } else break; } // Fall through... case 1: { tree_constant arg = args(0); if (arg.is_matrix_type ()) { Matrix mi = arg.matrix_value (); idx_vector i (mi, user_pref.do_fortran_indexing, "", 1); if (! i) return retval; int imax = i.max (); int len = i.length (); if (len == i.ones_count ()) rows = len; else if (imax > 0) { error ("invalid scalar index = %d", imax+1); return retval; } } else if (arg.const_type () == magic_colon || (arg.is_scalar_type () && NINT (arg.double_value ()) == 1)) { rows = 1; } else if (arg.is_scalar_type () && NINT (arg.double_value ()) == 0) { return Matrix (); } else break; // If only one index, cols will not be set. if (cols == 0) { if (user_pref.prefer_column_vectors) cols = 1; else { cols = rows; rows = 1; } } if (type_tag == scalar_constant) { return Matrix (rows, cols, scalar); } else if (type_tag == complex_scalar_constant) { return ComplexMatrix (rows, cols, *complex_scalar); } else panic_impossible (); } break; default: ::error ("invalid number of arguments for scalar type"); return tree_constant (); break; } } ::error ("index invalid or out of range for scalar type"); return tree_constant (); } tree_constant TC_REP::do_matrix_index (const Octave_object& args) const { tree_constant retval; int nargin = args.length (); switch (nargin) { case 1: { tree_constant arg = args(0); if (arg.is_undefined ()) ::error ("matrix index is a null expression"); else retval = do_matrix_index (arg); } break; case 2: { tree_constant arg_a = args(0); tree_constant arg_b = args(1); if (arg_a.is_undefined ()) ::error ("first matrix index is a null expression"); else if (arg_b.is_undefined ()) ::error ("second matrix index is a null expression"); else retval = do_matrix_index (arg_a, arg_b); } break; default: if (nargin == 0) ::error ("matrix indices expected, but none provided"); else ::error ("too many indices for matrix expression"); break; } return retval; } tree_constant TC_REP::do_matrix_index (const tree_constant& i_arg) const { tree_constant retval; int nr = rows (); int nc = columns (); if (user_pref.do_fortran_indexing) retval = fortran_style_matrix_index (i_arg); else if (nr <= 1 || nc <= 1) retval = do_vector_index (i_arg); else ::error ("single index only valid for row or column vector"); return retval; } tree_constant TC_REP::do_matrix_index (const tree_constant& i_arg, const tree_constant& j_arg) const { tree_constant retval; tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type itype = tmp_i.const_type (); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = tree_to_mat_idx (tmp_i.double_value ()); retval = do_matrix_index (i, j_arg); } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); idx_vector iv (mi, user_pref.do_fortran_indexing, "row", rows ()); if (! iv) return tree_constant (); if (iv.length () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else retval = do_matrix_index (iv, j_arg); } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range ri = tmp_i.range_value (); int nr = rows (); if (nr == 2 && is_zero_one (ri)) { retval = do_matrix_index (1, j_arg); } else if (nr == 2 && is_one_zero (ri)) { retval = do_matrix_index (0, j_arg); } else { if (index_check (ri, "row") < 0) return tree_constant (); retval = do_matrix_index (ri, j_arg); } } break; case magic_colon: retval = do_matrix_index (magic_colon, j_arg); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci) const { assert (mci == magic_colon); tree_constant retval; int nr = rows (); int nc = columns (); int size = nr * nc; if (size > 0) { CRMATRIX (m, cm, size, 1); int idx = 0; for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { CRMATRIX_ASSIGN_REP_ELEM (m, cm, idx, 0, i, j); idx++; } ASSIGN_CRMATRIX_TO (retval, m, cm); } return retval; } tree_constant TC_REP::fortran_style_matrix_index (const tree_constant& i_arg) const { tree_constant retval; tree_constant tmp_i = i_arg.make_numeric_or_magic (); if (error_state) return retval; TC_REP::constant_type itype = tmp_i.const_type (); int nr = rows (); int nc = columns (); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = NINT (tmp_i.double_value ()); int ii = fortran_row (i, nr) - 1; int jj = fortran_column (i, nr) - 1; if (index_check (i-1, "") < 0) return tree_constant (); if (range_max_check (i-1, nr * nc) < 0) return tree_constant (); retval = do_matrix_index (ii, jj); } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); if (mi.rows () == 0 || mi.columns () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { // Yes, we really do want to call this with mi. retval = fortran_style_matrix_index (mi); } } break; case string_constant: gripe_string_invalid (); break; case range_constant: gripe_range_invalid (); break; case magic_colon: retval = do_matrix_index (magic_colon); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::fortran_style_matrix_index (const Matrix& mi) const { assert (is_matrix_type ()); tree_constant retval; int nr = rows (); int nc = columns (); int len = nr * nc; int index_nr = mi.rows (); int index_nc = mi.columns (); if (index_nr >= 1 && index_nc >= 1) { const double *cop_out = 0; const Complex *c_cop_out = 0; int real_type = type_tag == matrix_constant; if (real_type) cop_out = matrix->data (); else c_cop_out = complex_matrix->data (); const double *cop_out_index = mi.data (); idx_vector iv (mi, 1, "", len); if (! iv) return retval; int result_size = iv.length (); if (nc == 1 || (nr != 1 && iv.one_zero_only ())) { CRMATRIX (m, cm, result_size, 1); for (int i = 0; i < result_size; i++) { int idx = iv.elem (i); CRMATRIX_ASSIGN_ELEM (m, cm, i, 0, cop_out [idx], c_cop_out [idx], real_type); } ASSIGN_CRMATRIX_TO (retval, m, cm); } else if (nr == 1) { CRMATRIX (m, cm, 1, result_size); for (int i = 0; i < result_size; i++) { int idx = iv.elem (i); CRMATRIX_ASSIGN_ELEM (m, cm, 0, i, cop_out [idx], c_cop_out [idx], real_type); } ASSIGN_CRMATRIX_TO (retval, m, cm); } else { CRMATRIX (m, cm, index_nr, index_nc); for (int j = 0; j < index_nc; j++) for (int i = 0; i < index_nr; i++) { double tmp = *cop_out_index++; int idx = tree_to_mat_idx (tmp); CRMATRIX_ASSIGN_ELEM (m, cm, i, j, cop_out [idx], c_cop_out [idx], real_type); } ASSIGN_CRMATRIX_TO (retval, m, cm); } } else { if (index_nr == 0 || index_nc == 0) ::error ("empty matrix invalid as index"); else ::error ("invalid matrix index"); return tree_constant (); } return retval; } tree_constant TC_REP::do_vector_index (const tree_constant& i_arg) const { tree_constant retval; tree_constant tmp_i = i_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type itype = tmp_i.const_type (); int nr = rows (); int nc = columns (); int len = MAX (nr, nc); assert ((nr == 1 || nc == 1) && ! user_pref.do_fortran_indexing); int swap_indices = (nr == 1); switch (itype) { case complex_scalar_constant: case scalar_constant: { int i = tree_to_mat_idx (tmp_i.double_value ()); if (index_check (i, "") < 0) return tree_constant (); if (swap_indices) { if (range_max_check (i, nc) < 0) return tree_constant (); retval = do_matrix_index (0, i); } else { if (range_max_check (i, nr) < 0) return tree_constant (); retval = do_matrix_index (i, 0); } } break; case complex_matrix_constant: case matrix_constant: { Matrix mi = tmp_i.matrix_value (); if (mi.rows () == 0 || mi.columns () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { idx_vector iv (mi, user_pref.do_fortran_indexing, "", len); if (! iv) return tree_constant (); if (swap_indices) { if (range_max_check (iv.max (), nc) < 0) return tree_constant (); retval = do_matrix_index (0, iv); } else { if (range_max_check (iv.max (), nr) < 0) return tree_constant (); retval = do_matrix_index (iv, 0); } } } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range ri = tmp_i.range_value (); if (len == 2 && is_zero_one (ri)) { if (swap_indices) retval = do_matrix_index (0, 1); else retval = do_matrix_index (1, 0); } else if (len == 2 && is_one_zero (ri)) { retval = do_matrix_index (0, 0); } else { if (index_check (ri, "") < 0) return tree_constant (); if (swap_indices) { if (range_max_check (tree_to_mat_idx (ri.max ()), nc) < 0) return tree_constant (); retval = do_matrix_index (0, ri); } else { if (range_max_check (tree_to_mat_idx (ri.max ()), nr) < 0) return tree_constant (); retval = do_matrix_index (ri, 0); } } } break; case magic_colon: if (swap_indices) retval = do_matrix_index (0, magic_colon); else retval = do_matrix_index (magic_colon, 0); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (int i, const tree_constant& j_arg) const { tree_constant retval; tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type jtype = tmp_j.const_type (); int nr = rows (); int nc = columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { if (index_check (i, "row") < 0) return tree_constant (); int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return tree_constant (); if (range_max_check (i, j, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (i, j); } break; case complex_matrix_constant: case matrix_constant: { if (index_check (i, "row") < 0) return tree_constant (); Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", nc); if (! jv) return tree_constant (); if (jv.length () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { if (range_max_check (i, jv.max (), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (i, jv); } } break; case string_constant: gripe_string_invalid (); break; case range_constant: { if (index_check (i, "row") < 0) return tree_constant (); Range rj = tmp_j.range_value (); if (nc == 2 && is_zero_one (rj)) { retval = do_matrix_index (i, 1); } else if (nc == 2 && is_one_zero (rj)) { retval = do_matrix_index (i, 0); } else { if (index_check (rj, "column") < 0) return tree_constant (); if (range_max_check (i, tree_to_mat_idx (rj.max ()), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (i, rj); } } break; case magic_colon: if (i == -1 && nr == 1) return Matrix (); if (index_check (i, "row") < 0 || range_max_check (i, 0, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (i, magic_colon); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (const idx_vector& iv, const tree_constant& j_arg) const { tree_constant retval; tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type jtype = tmp_j.const_type (); int nr = rows (); int nc = columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return tree_constant (); if (range_max_check (iv.max (), j, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (iv, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", nc); if (! jv) return tree_constant (); if (jv.length () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { if (range_max_check (iv.max (), jv.max (), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (iv, jv); } } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); if (nc == 2 && is_zero_one (rj)) { retval = do_matrix_index (iv, 1); } else if (nc == 2 && is_one_zero (rj)) { retval = do_matrix_index (iv, 0); } else { if (index_check (rj, "column") < 0) return tree_constant (); if (range_max_check (iv.max (), tree_to_mat_idx (rj.max ()), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (iv, rj); } } break; case magic_colon: if (range_max_check (iv.max (), 0, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (iv, magic_colon); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (const Range& ri, const tree_constant& j_arg) const { tree_constant retval; tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type jtype = tmp_j.const_type (); int nr = rows (); int nc = columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); if (index_check (j, "column") < 0) return tree_constant (); if (range_max_check (tree_to_mat_idx (ri.max ()), j, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (ri, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", nc); if (! jv) return tree_constant (); if (jv.length () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { if (range_max_check (tree_to_mat_idx (ri.max ()), jv.max (), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (ri, jv); } } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); if (nc == 2 && is_zero_one (rj)) { retval = do_matrix_index (ri, 1); } else if (nc == 2 && is_one_zero (rj)) { retval = do_matrix_index (ri, 0); } else { if (index_check (rj, "column") < 0) return tree_constant (); if (range_max_check (tree_to_mat_idx (ri.max ()), tree_to_mat_idx (rj.max ()), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (ri, rj); } } break; case magic_colon: { if (index_check (ri, "row") < 0) return tree_constant (); if (range_max_check (tree_to_mat_idx (ri.max ()), 0, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (ri, magic_colon); } break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci, const tree_constant& j_arg) const { tree_constant retval; tree_constant tmp_j = j_arg.make_numeric_or_range_or_magic (); if (error_state) return retval; TC_REP::constant_type jtype = tmp_j.const_type (); int nr = rows (); int nc = columns (); switch (jtype) { case complex_scalar_constant: case scalar_constant: { int j = tree_to_mat_idx (tmp_j.double_value ()); if (j == -1 && nc == 1) return Matrix (); if (index_check (j, "column") < 0) return tree_constant (); if (range_max_check (0, j, nr, nc) < 0) return tree_constant (); retval = do_matrix_index (magic_colon, j); } break; case complex_matrix_constant: case matrix_constant: { Matrix mj = tmp_j.matrix_value (); idx_vector jv (mj, user_pref.do_fortran_indexing, "column", nc); if (! jv) return tree_constant (); if (jv.length () == 0) { Matrix mtmp; retval = tree_constant (mtmp); } else { if (range_max_check (0, jv.max (), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (magic_colon, jv); } } break; case string_constant: gripe_string_invalid (); break; case range_constant: { Range rj = tmp_j.range_value (); if (nc == 2 && is_zero_one (rj)) { retval = do_matrix_index (magic_colon, 1); } else if (nc == 2 && is_one_zero (rj)) { retval = do_matrix_index (magic_colon, 0); } else { if (index_check (rj, "column") < 0) return tree_constant (); if (range_max_check (0, tree_to_mat_idx (rj.max ()), nr, nc) < 0) return tree_constant (); retval = do_matrix_index (magic_colon, rj); } } break; case magic_colon: retval = do_matrix_index (magic_colon, magic_colon); break; default: panic_impossible (); break; } return retval; } tree_constant TC_REP::do_matrix_index (int i, int j) const { tree_constant retval; if (type_tag == matrix_constant) retval = tree_constant (matrix->elem (i, j)); else retval = tree_constant (complex_matrix->elem (i, j)); return retval; } tree_constant TC_REP::do_matrix_index (int i, const idx_vector& jv) const { tree_constant retval; int jlen = jv.capacity (); CRMATRIX (m, cm, 1, jlen); for (int j = 0; j < jlen; j++) { int col = jv.elem (j); CRMATRIX_ASSIGN_REP_ELEM (m, cm, 0, j, i, col); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (int i, const Range& rj) const { tree_constant retval; int jlen = rj.nelem (); CRMATRIX (m, cm, 1, jlen); double b = rj.base (); double increment = rj.inc (); for (int j = 0; j < jlen; j++) { double tmp = b + j * increment; int col = tree_to_mat_idx (tmp); CRMATRIX_ASSIGN_REP_ELEM (m, cm, 0, j, i, col); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (int i, TC_REP::constant_type mcj) const { assert (mcj == magic_colon); tree_constant retval; int nc = columns (); CRMATRIX (m, cm, 1, nc); for (int j = 0; j < nc; j++) { CRMATRIX_ASSIGN_REP_ELEM (m, cm, 0, j, i, j); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const idx_vector& iv, int j) const { tree_constant retval; int ilen = iv.capacity (); CRMATRIX (m, cm, ilen, 1); for (int i = 0; i < ilen; i++) { int row = iv.elem (i); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, 0, row, j); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const idx_vector& iv, const idx_vector& jv) const { tree_constant retval; int ilen = iv.capacity (); int jlen = jv.capacity (); CRMATRIX (m, cm, ilen, jlen); for (int i = 0; i < ilen; i++) { int row = iv.elem (i); for (int j = 0; j < jlen; j++) { int col = jv.elem (j); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const idx_vector& iv, const Range& rj) const { tree_constant retval; int ilen = iv.capacity (); int jlen = rj.nelem (); CRMATRIX (m, cm, ilen, jlen); double b = rj.base (); double increment = rj.inc (); for (int i = 0; i < ilen; i++) { int row = iv.elem (i); for (int j = 0; j < jlen; j++) { double tmp = b + j * increment; int col = tree_to_mat_idx (tmp); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const idx_vector& iv, TC_REP::constant_type mcj) const { assert (mcj == magic_colon); tree_constant retval; int nc = columns (); int ilen = iv.capacity (); CRMATRIX (m, cm, ilen, nc); for (int j = 0; j < nc; j++) { for (int i = 0; i < ilen; i++) { int row = iv.elem (i); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, j); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const Range& ri, int j) const { tree_constant retval; int ilen = ri.nelem (); CRMATRIX (m, cm, ilen, 1); double b = ri.base (); double increment = ri.inc (); for (int i = 0; i < ilen; i++) { double tmp = b + i * increment; int row = tree_to_mat_idx (tmp); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, 0, row, j); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const Range& ri, const idx_vector& jv) const { tree_constant retval; int ilen = ri.nelem (); int jlen = jv.capacity (); CRMATRIX (m, cm, ilen, jlen); double b = ri.base (); double increment = ri.inc (); for (int i = 0; i < ilen; i++) { double tmp = b + i * increment; int row = tree_to_mat_idx (tmp); for (int j = 0; j < jlen; j++) { int col = jv.elem (j); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const Range& ri, const Range& rj) const { tree_constant retval; int ilen = ri.nelem (); int jlen = rj.nelem (); CRMATRIX (m, cm, ilen, jlen); double ib = ri.base (); double iinc = ri.inc (); double jb = rj.base (); double jinc = rj.inc (); for (int i = 0; i < ilen; i++) { double itmp = ib + i * iinc; int row = tree_to_mat_idx (itmp); for (int j = 0; j < jlen; j++) { double jtmp = jb + j * jinc; int col = tree_to_mat_idx (jtmp); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (const Range& ri, TC_REP::constant_type mcj) const { assert (mcj == magic_colon); tree_constant retval; int nc = columns (); int ilen = ri.nelem (); CRMATRIX (m, cm, ilen, nc); double ib = ri.base (); double iinc = ri.inc (); for (int i = 0; i < ilen; i++) { double itmp = ib + i * iinc; int row = tree_to_mat_idx (itmp); for (int j = 0; j < nc; j++) { CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, row, j); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci, int j) const { assert (mci == magic_colon); tree_constant retval; int nr = rows (); CRMATRIX (m, cm, nr, 1); for (int i = 0; i < nr; i++) { CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, 0, i, j); } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci, const idx_vector& jv) const { assert (mci == magic_colon); tree_constant retval; int nr = rows (); int jlen = jv.capacity (); CRMATRIX (m, cm, nr, jlen); for (int i = 0; i < nr; i++) { for (int j = 0; j < jlen; j++) { int col = jv.elem (j); CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, i, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci, const Range& rj) const { assert (mci == magic_colon); tree_constant retval; int nr = rows (); int jlen = rj.nelem (); CRMATRIX (m, cm, nr, jlen); double jb = rj.base (); double jinc = rj.inc (); for (int j = 0; j < jlen; j++) { double jtmp = jb + j * jinc; int col = tree_to_mat_idx (jtmp); for (int i = 0; i < nr; i++) { CRMATRIX_ASSIGN_REP_ELEM (m, cm, i, j, i, col); } } ASSIGN_CRMATRIX_TO (retval, m, cm); return retval; } tree_constant TC_REP::do_matrix_index (TC_REP::constant_type mci, TC_REP::constant_type mcj) const { tree_constant retval; assert (mci == magic_colon && mcj == magic_colon); switch (type_tag) { case complex_scalar_constant: retval = *complex_scalar; break; case scalar_constant: retval = scalar; break; case complex_matrix_constant: retval = *complex_matrix; break; case matrix_constant: retval = *matrix; break; case range_constant: retval = *range; break; case string_constant: retval = string; break; case magic_colon: default: panic_impossible (); break; } return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tempname.c100666 415 17 13147 5650373173 13737 0ustar jweusers/* Copyright (C) 1991, 1992, 1993 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef HAVE_TEMPNAM #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include #ifndef FILENAME_MAX #ifdef MAXPATHLEN #define FILENAME_MAX MAXPATHLEN #else #define FILENAME_MAX 1024 #endif #endif #ifndef P_tmpdir #define P_tmpdir "/usr/tmp/" #endif /* Return nonzero if DIR is an existent directory. */ static int diraccess (const char *dir) { struct stat buf; return stat (dir, &buf) == 0 && S_ISDIR (buf.st_mode); } /* Return nonzero if FILE exists. */ static int exists (const char *file) { /* We can stat the file even if we can't read its data. */ struct stat st; int save = errno; if (stat (file, &st) == 0) return 1; else { /* We report that the file exists if stat failed for a reason other than nonexistence. In this case, it may or may not exist, and we don't know; but reporting that it does exist will never cause any trouble, while reporting that it doesn't exist when it does would violate the interface of __stdio_gen_tempname. */ int exists = errno != ENOENT; errno = save; return exists; } } /* These are the characters used in temporary filenames. */ static const char letters[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"; /* Generate a temporary filename and return it (in a static buffer). If STREAMPTR is not NULL, open a stream "w+b" on the file and set *STREAMPTR to it. If DIR_SEARCH is nonzero, DIR and PFX are used as described for tempnam. If not, a temporary filename in P_tmpdir with no special prefix is generated. If LENPTR is not NULL, *LENPTR is set the to length (including the terminating '\0') of the resultant filename, which is returned. This goes through a cyclic pattern of all possible filenames consisting of five decimal digits of the current pid and three of the characters in `letters'. Data for tempnam and tmpnam is kept separate, but when tempnam is using P_tmpdir and no prefix (i.e, it is identical to tmpnam), the same data is used. Each potential filename is tested for an already-existing file of the same name, and no name of an existing file will be returned. When the cycle reaches its end (12345ZZZ), NULL is returned. */ char * __stdio_gen_tempname (const char *dir, const char *pfx, int dir_search, size_t *lenptr, FILE **streamptr) { int saverrno = errno; static const char tmpdir[] = P_tmpdir; static size_t indices[2]; size_t *idx; static char buf[FILENAME_MAX]; static pid_t oldpid = (pid_t) 0; pid_t pid = getpid(); register size_t len, plen, dlen; if (dir_search) { register const char *d = getenv("TMPDIR"); if (d != NULL && !diraccess(d)) d = NULL; if (d == NULL && dir != NULL && diraccess(dir)) d = dir; if (d == NULL && diraccess(tmpdir)) d = tmpdir; if (d == NULL && diraccess("/tmp")) d = "/tmp"; if (d == NULL) { errno = ENOENT; return NULL; } dir = d; } else dir = tmpdir; dlen = strlen (dir); /* Remove trailing slashes from the directory name. */ while (dlen > 1 && dir[dlen - 1] == '/') --dlen; if (pfx != NULL && *pfx != '\0') { plen = strlen(pfx); if (plen > 5) plen = 5; } else plen = 0; if (dir != tmpdir && !strcmp(dir, tmpdir)) dir = tmpdir; idx = &indices[(plen == 0 && dir == tmpdir) ? 1 : 0]; if (pid != oldpid) { oldpid = pid; indices[0] = indices[1] = 0; } len = dlen + 1 + plen + 5 + 3; for (; *idx < ((sizeof (letters) - 1) * (sizeof (letters) - 1) * (sizeof (letters) - 1)); ++*idx) { /* Construct a file name and see if it already exists. We use a single counter in *IDX to cycle each of three character positions through each of 62 possible letters. */ if (sizeof (buf) < len) return NULL; sprintf (buf, "%.*s/%.*s%.5d%c%c%c", (int) dlen, dir, (int) plen, pfx, pid % 100000, letters[*idx % (sizeof (letters) - 1)], letters[(*idx / (sizeof (letters) - 1)) % (sizeof (letters) - 1)], letters[(*idx / ((sizeof (letters) - 1) * (sizeof (letters) - 1))) % (sizeof (letters) - 1)] ); if (! buf || strlen (buf) != (int) len) return NULL; if (streamptr != NULL) abort (); else if (exists (buf)) continue; /* If the file already existed we have continued the loop above, so we only get here when we have a winning name to return. */ errno = saverrno; if (lenptr != NULL) *lenptr = len + 1; return buf; } /* We got out of the loop because we ran out of combinations to try. */ errno = EEXIST; /* ? */ return NULL; } #endif octave-1.1.0/src/timefns.cc100666 415 17 5272 5702417006 13711 0ustar jweusers// timefns.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "dMatrix.h" #include "tree-const.h" #include "oct-obj.h" #include "systime.h" #include "defun.h" #ifdef HAVE_SYS_RESOURCE_H extern "C" { #include } #endif #ifndef RUSAGE_SELF #define RUSAGE_SELF 0 #endif DEFUN ("clock", Fclock, Sclock, 1, 0, "clock (): return current date and time in vector with elements\n\ \n\ [ year, month, day-of-month, hour, minute, second ]") { time_t now; double fraction = 0.0; #ifdef HAVE_GETTIMEOFDAY struct timeval tp; gettimeofday (&tp, 0); now = tp.tv_sec; fraction = tp.tv_usec / 1e6; #else time (&now); #endif struct tm *tm = localtime (&now); Matrix m (1, 6); m.elem (0, 0) = tm->tm_year + 1900; m.elem (0, 1) = tm->tm_mon + 1; m.elem (0, 2) = tm->tm_mday; m.elem (0, 3) = tm->tm_hour; m.elem (0, 4) = tm->tm_min; m.elem (0, 5) = tm->tm_sec + fraction; return m; } DEFUN ("cputime", Fcputime, Scputime, 0, 0, "[total, user, system] = cputime ()\n\ \n\ Return CPU time statistics.") { Octave_object retval (3, Matrix (1, 1, 0.0)); #if defined (HAVE_GETRUSAGE) struct rusage resource_stats; getrusage (RUSAGE_SELF, &resource_stats); struct timeval usr = resource_stats.ru_utime; struct timeval sys = resource_stats.ru_stime; double usr_time = usr.tv_sec + usr.tv_usec / 1e6; double sys_time = sys.tv_sec + sys.tv_usec / 1e6; retval (2) = sys_time; retval (1) = usr_time; retval (0) = usr_time + sys_time; #endif return retval; } DEFUN ("date", Fdate, Sdate, 1, 0, "date (): return current date in a string, in the form `18-Jul-94'") { Octave_object retval; time_t now; struct tm *tm; time (&now); tm = localtime (&now); char date[32]; int len = strftime (date, 31, "%d-%b-%y", tm); if (len > 0) retval = date; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tmpnam.c100666 415 17 2575 5650373154 13407 0ustar jweusers/* Copyright (C) 1991, 1993 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 GNU C 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 the GNU C Library; see the file COPYING. If not, write to the Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef HAVE_TEMPNAM #include #include #include extern char *__stdio_gen_tempname (const char *dir, const char *pfx, int dir_search, size_t *lenptr, FILE **streamptr); /* Generate a unique filename in P_tmpdir. */ char * tmpnam (register char *s) { register char *t = __stdio_gen_tempname((const char *) NULL, (const char *) NULL, 0, (size_t *) NULL, (FILE **) NULL); if (t == NULL) return NULL; if (s != NULL) (void) strcpy(s, t); else s = t; return s; } #endif octave-1.1.0/src/token.cc100666 415 17 4772 5702417005 13367 0ustar jweusers// token.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "token.h" #include "utils.h" #include "symtab.h" token::token (int l, int c) { line_num = l; column_num = c; type_tag = generic_token; orig_text = 0; } token::token (char *s, int l, int c) { line_num = l; column_num = c; type_tag = string_token; str = strsave (s); orig_text = 0; } token::token (double d, char *s, int l, int c) { line_num = l; column_num = c; type_tag = double_token; num = d; orig_text = strsave (s); } token::token (end_tok_type t, int l, int c) { line_num = l; column_num = c; type_tag = ettype_token; et = t; orig_text = 0; } token::token (plot_tok_type t, int l, int c) { line_num = l; column_num = c; type_tag = pttype_token; pt = t; orig_text = 0; } token::token (symbol_record *s, int l, int c) { line_num = l; column_num = c; type_tag = sym_rec_token; sr = s; orig_text = 0; } token::~token (void) { if (type_tag == string_token) delete [] str; delete [] orig_text; } int token::line (void) { return line_num; } int token::column (void) { return column_num; } char * token::string (void) { assert (type_tag == string_token); return str; } double token::number (void) { assert (type_tag == double_token); return num; } token::end_tok_type token::ettype (void) { assert (type_tag == ettype_token); return et; } token::plot_tok_type token::pttype (void) { assert (type_tag == pttype_token); return pt; } symbol_record * token::sym_rec (void) { assert (type_tag == sym_rec_token); return sr; } char * token::text_rep (void) { return orig_text; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-base.cc100666 415 17 3506 5702417004 14107 0ustar jweusers// tree-base.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "tree-base.h" // Current indentation. int tree_print_code::curr_print_indent_level = 0; // Nonzero means we are at the beginning of a line. int tree_print_code::beginning_of_line = 1; // All print_code() functions should use this to print new lines. void tree_print_code::print_code_new_line (ostream& os) { os << "\n"; beginning_of_line = 1; } // Each print_code() function should call this before printing // anything. // // This doesn't need to be fast, but isn't there a better way? void tree_print_code::print_code_indent (ostream& os) { assert (curr_print_indent_level >= 0); if (beginning_of_line) { os.form ("%*s", curr_print_indent_level, ""); beginning_of_line = 0; } } // For ressetting print_code state. void tree_print_code::print_code_reset (void) { beginning_of_line = 1; curr_print_indent_level = 0; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-cmd.cc100666 415 17 23574 5702417002 13765 0ustar jweusers// tree-cmd.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include // Nonzero means we're breaking out of a loop. int breaking = 0; // Nonzero means we're jumping to the end of a loop. int continuing = 0; // Nonzero means we're returning from a function. Global because it // is also needed in tree-expr.cc. int returning = 0; #include "user-prefs.h" #include "variables.h" #include "symtab.h" #include "error.h" #include "gripes.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-misc.h" #include "tree-const.h" #include "unwind-prot.h" // Decide if it's time to quit a for or while loop. static int quit_loop_now (void) { // Maybe handle `continue N' someday... if (continuing) continuing--; int quit = (returning || breaking || continuing); if (breaking) breaking--; return quit; } // But first, some extra functions used by the tree classes. // We seem to have no use for this now. Maybe it will be needed at // some future date, so here it is. #if 0 // Convert a linked list of trees to a vector of pointers to trees. static tree ** list_to_vector (tree *list, int& len) { len = list->length () + 1; tree **args = new tree * [len]; // args[0] may eventually hold something useful, like the function // name. tree *tmp_list = list; for (int k = 1; k < len; k++) { args[k] = tmp_list; tmp_list = tmp_list->next_elem (); } return args; } #endif // Global. tree_global_command::~tree_global_command (void) { delete init_list; } void tree_global_command::eval (void) { if (init_list) init_list->eval (); if (error_state > 0) ::error ("evaluating global command near line %d, column %d", line (), column ()); } void tree_global_command::print_code (ostream& os) { print_code_indent (os); os << "global "; if (init_list) init_list->print_code (os); } // While. tree_while_command::~tree_while_command (void) { delete expr; delete list; } void tree_while_command::eval (void) { if (error_state) return; for (;;) { int expr_value = 0; if (! expr) return; tree_constant t1 = expr->eval (0); if (error_state) { eval_error (); return; } if (t1.rows () == 0 || t1.columns () == 0) { int flag = user_pref.propagate_empty_matrices; if (flag < 0) warning ("while: empty matrix used in conditional"); else if (flag == 0) { ::error ("empty matrix used in while condition near line\ %d, column %d", line (), column ()); return; } t1 = tree_constant (0.0); } else if (! t1.is_scalar_type ()) { tree_constant t2 = t1.all (); t1 = t2.all (); } if (t1.is_real_scalar ()) expr_value = (int) t1.double_value (); else if (t1.is_complex_scalar ()) expr_value = t1.complex_value () != 0.0; else { ::error ("invalid type used in while condition near line %d,\ column %d", line (), column ()); return; } if (expr_value) { if (list) { list->eval (1); if (error_state) { eval_error (); return; } } if (quit_loop_now ()) break; } else break; } } void tree_while_command::eval_error (void) { if (error_state > 0) ::error ("evaluating while command near line %d, column %d", line (), column ()); } void tree_while_command::print_code (ostream& os) { print_code_indent (os); os << "while "; if (expr) expr->print_code (os); print_code_new_line (os); if (list) { increment_indent_level (); list->print_code (os); decrement_indent_level (); } print_code_indent (os); os << "endwhile"; } // For. tree_for_command::~tree_for_command (void) { delete id; delete expr; delete list; } void tree_for_command::eval (void) { if (error_state || ! expr) return; tree_constant tmp_expr = expr->eval (0); if (error_state || tmp_expr.is_undefined ()) { eval_error (); return; } if (tmp_expr.is_scalar_type ()) { tree_constant *rhs = new tree_constant (tmp_expr); int quit = 0; do_for_loop_once (rhs, quit); } else if (tmp_expr.is_matrix_type ()) { Matrix m_tmp; ComplexMatrix cm_tmp; int nr; int steps; if (tmp_expr.is_real_matrix ()) { m_tmp = tmp_expr.matrix_value (); nr = m_tmp.rows (); steps = m_tmp.columns (); } else { cm_tmp = tmp_expr.complex_matrix_value (); nr = cm_tmp.rows (); steps = cm_tmp.columns (); } for (int i = 0; i < steps; i++) { tree_constant *rhs = 0; if (nr == 1) { if (tmp_expr.is_real_matrix ()) rhs = new tree_constant (m_tmp (0, i)); else rhs = new tree_constant (cm_tmp (0, i)); } else { if (tmp_expr.is_real_matrix ()) rhs = new tree_constant (m_tmp.extract (0, i, nr-1, i)); else rhs = new tree_constant (cm_tmp.extract (0, i, nr-1, i)); } int quit = 0; do_for_loop_once (rhs, quit); if (quit) break; } } else if (tmp_expr.is_string ()) { gripe_string_invalid (); } else if (tmp_expr.is_range ()) { Range rng = tmp_expr.range_value (); int steps = rng.nelem (); double b = rng.base (); double increment = rng.inc (); for (int i = 0; i < steps; i++) { double tmp_val = b + i * increment; tree_constant *rhs = new tree_constant (tmp_val); int quit = 0; do_for_loop_once (rhs, quit); if (quit) break; } } else { ::error ("invalid type in for loop expression near line %d, column %d", line (), column ()); } } void tree_for_command::eval_error (void) { if (error_state > 0) ::error ("evaluating for command near line %d, column %d", line (), column ()); } void tree_for_command::do_for_loop_once (tree_constant *rhs, int& quit) { quit = 0; tree_simple_assignment_expression tmp_ass (id, rhs, 1); tmp_ass.eval (0); if (error_state) { eval_error (); return; } if (list) { list->eval (1); if (error_state) { eval_error (); quit = 1; return; } } quit = quit_loop_now (); } void tree_for_command::print_code (ostream& os) { print_code_indent (os); os << "for "; if (id) id->print_code (os); os << " = "; if (expr) expr->print_code (os); print_code_new_line (os); if (list) { increment_indent_level (); list->print_code (os); decrement_indent_level (); } print_code_indent (os); os << "endfor"; } // If. tree_if_command::~tree_if_command (void) { delete list; } void tree_if_command::eval (void) { if (list) list->eval (); if (error_state > 0) ::error ("evaluating if command near line %d, column %d", line (), column ()); } void tree_if_command::print_code (ostream& os) { print_code_indent (os); os << "if "; if (list) list->print_code (os); print_code_indent (os); os << "endif"; } // Simple exception handling. tree_unwind_protect_command::~tree_unwind_protect_command (void) { delete unwind_protect_code; delete cleanup_code; } static void do_unwind_protect_cleanup_code (void *ptr) { tree_statement_list *list = (tree_statement_list *) ptr; // We want to run the cleanup code without error_state being set, but // we need to restore its value, so that any errors encountered in // the first part of the unwind_protect are not completely ignored. unwind_protect_int (error_state); error_state = 0; if (list) list->eval (1); // We don't want to ignore errors that occur in the cleanup code, so // if an error is encountered there, leave error_state alone. // Otherwise, set it back to what it was before. if (error_state) discard_unwind_protect (); else run_unwind_protect (); } void tree_unwind_protect_command::eval (void) { add_unwind_protect (do_unwind_protect_cleanup_code, cleanup_code); if (unwind_protect_code) unwind_protect_code->eval (1); run_unwind_protect (); } void tree_unwind_protect_command::print_code (ostream& os) { print_code_indent (os); os << "unwind_protect"; print_code_new_line (os); if (unwind_protect_code) { increment_indent_level (); unwind_protect_code->print_code (os); decrement_indent_level (); } print_code_indent (os); os << "cleanup_code"; print_code_new_line (os); if (cleanup_code) { increment_indent_level (); cleanup_code->print_code (os); decrement_indent_level (); } print_code_indent (os); os << "end_unwind_protect"; } // Break. void tree_break_command::eval (void) { if (! error_state) breaking = 1; } void tree_break_command::print_code (ostream& os) { print_code_indent (os); os << "break"; } // Continue. void tree_continue_command::eval (void) { if (! error_state) continuing = 1; } void tree_continue_command::print_code (ostream& os) { print_code_indent (os); os << "continue"; } // Return. void tree_return_command::eval (void) { if (! error_state) returning = 1; } void tree_return_command::print_code (ostream& os) { print_code_indent (os); os << "return"; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-const.cc100666 415 17 11244 5702417001 14336 0ustar jweusers// tree-const.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "tree-const.h" #include "error.h" #include "gripes.h" #include "user-prefs.h" #include "oct-map.h" Octave_map tree_constant::map_value (void) const { return rep->map_value (); } tree_constant::~tree_constant (void) { #if defined (MDEBUG) cerr << "~tree_constant: rep: " << rep << " rep->count: " << rep->count << "\n"; #endif if (--rep->count <= 0) { delete rep; rep = 0; } } #if defined (MDEBUG) void * tree_constant::operator new (size_t size) { tree_constant *p = ::new tree_constant; cerr << "tree_constant::new(): " << p << "\n"; return p; } void tree_constant::operator delete (void *p, size_t size) { cerr << "tree_constant::delete(): " << p << "\n"; ::delete p; } #endif // Simple assignment. tree_constant tree_constant::operator = (const tree_constant& a) { if (rep != a.rep) { if (--rep->count <= 0) delete rep; rep = a.rep; rep->count++; } return *this; } tree_constant tree_constant::lookup_map_element (SLList& list) { tree_constant retval; tree_constant_rep *tmp_rep = rep; Pix p = list.first (); while (p) { char *elt = list (p); list.next (p); tree_constant tmp = tmp_rep->lookup_map_element (elt); if (error_state) break; tmp_rep = tmp.rep; if (! p) retval = tmp; } return retval; } // Simple structure assignment. void tree_constant::make_unique (void) { if (rep->count > 1) { --rep->count; rep = new tree_constant_rep (*rep); rep->count = 1; } if (rep->is_map ()) { for (Pix p = rep->a_map->first (); p != 0; rep->a_map->next (p)) { rep->a_map->contents (p) . make_unique (); } } } tree_constant::tree_constant_rep * tree_constant::make_unique_map (void) { if (! rep->is_map ()) { if (--rep->count <= 0) delete rep; Octave_map m; rep = new tree_constant_rep (m); rep->count = 1; } make_unique (); return rep; } tree_constant tree_constant::assign_map_element (SLList& list, tree_constant& rhs) { tree_constant_rep *tmp_rep = make_unique_map (); if (rhs.is_map ()) rhs.make_unique (); Pix p = list.first (); while (p) { char *elt = list (p); list.next (p); tree_constant& tmp = tmp_rep->lookup_map_element (elt, 1); if (! p) { tmp = rhs; return tmp; } tmp_rep = tmp.make_unique_map (); } return tree_constant (); } // Indexed structure assignment. tree_constant tree_constant::assign_map_element (SLList& list, tree_constant& rhs, const Octave_object& args) { tree_constant_rep *tmp_rep = make_unique_map (); if (rhs.is_map ()) rhs.make_unique (); Pix p = list.first (); while (p) { char *elt = list (p); list.next (p); tree_constant& tmp = tmp_rep->lookup_map_element (elt, 1); if (! p) { tmp.assign (rhs, args); return tmp; } tmp_rep = tmp.make_unique_map (); } return tree_constant (); } void tree_constant::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (rep) rep->print_code (os); if (in_parens) os << ")"; } // Construct return vector of empty matrices. Return empty matrices // and/or gripe when appropriate. Octave_object vector_of_empties (int nargout, const char *fcn_name) { Octave_object retval; // Got an empty argument, check if should gripe/return empty values. int flag = user_pref.propagate_empty_matrices; if (flag != 0) { if (flag < 0) gripe_empty_arg (fcn_name, 0); Matrix m; retval.resize (nargout ? nargout : 1); for (int i = 0; i < nargout; i++) retval(i) = m; } else gripe_empty_arg (fcn_name, 1); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-expr.cc100666 415 17 150542 5705367472 14236 0ustar jweusers// tree-expr.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include "variables.h" #include "user-prefs.h" #include "dynamic-ld.h" #include "help.h" #include "error.h" #include "gripes.h" #include "pager.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-misc.h" #include "tree-const.h" #include "input.h" #include "symtab.h" #include "utils.h" #include "octave.h" #include "octave-hist.h" #include "unwind-prot.h" #include "parse.h" #include "lex.h" #include "defun.h" // Nonzero means we're returning from a function. extern int returning; // But first, some extra functions used by the tree classes. // We seem to have no use for this now. Maybe it will be needed at // some future date, so here it is. #if 0 // Convert a linked list of trees to a vector of pointers to trees. static tree ** list_to_vector (tree *list, int& len) { len = list->length () + 1; tree **args = new tree * [len]; // args[0] may eventually hold something useful, like the function // name. tree *tmp_list = list; for (int k = 1; k < len; k++) { args[k] = tmp_list; tmp_list = tmp_list->next_elem (); } return args; } #endif static int any_element_less_than (const Matrix& a, double val) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) if (a.elem (i, j) < val) return 1; return 0; } static int any_element_greater_than (const Matrix& a, double val) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) if (a.elem (i, j) > val) return 1; return 0; } static int print_as_scalar (const tree_constant& val) { int nr = val.rows (); int nc = val.columns (); return (val.is_scalar_type () || val.is_string () || (val.is_matrix_type () && ((nr == 1 && nc == 1) || nr == 0 || nc == 0))); } static void print_constant (tree_constant& tc, char *name) { int pad_after = 0; if (user_pref.print_answer_id_name) { if (print_as_scalar (tc)) { ostrstream output_buf; output_buf << name << " = " << ends; maybe_page_output (output_buf); } else { pad_after = 1; ostrstream output_buf; output_buf << name << " =\n\n" << ends; maybe_page_output (output_buf); } } tc.eval (1); if (pad_after) { ostrstream output_buf; output_buf << "\n" << ends; maybe_page_output (output_buf); } } // Make sure that all arguments have values. static int all_args_defined (const Octave_object& args) { int nargin = args.length (); for (int i = 0; i < nargin; i++) if (args(i).is_undefined ()) return 0; return 1; } // Are any of the arguments `:'? static int any_arg_is_magic_colon (const Octave_object& args) { int nargin = args.length (); for (int i = 0; i < nargin; i++) if (args(i).is_magic_colon ()) return 1; return 0; } // Expressions. tree_constant tree_expression::eval (int print) { panic ("invalid evaluation of generic expression"); return tree_constant (); } // General matrices. This list type is much more work to handle than // constant matrices, but it allows us to construct matrices from // other matrices, variables, and functions. tree_matrix::~tree_matrix (void) { delete element; delete next; } tree_matrix * tree_matrix::chain (tree_expression *t, tree_matrix::dir d) { tree_matrix *tmp = new tree_matrix (t, d); tmp->next = this; return tmp; } tree_matrix * tree_matrix::reverse (void) { tree_matrix *list = this; tree_matrix *next; tree_matrix *prev = 0; while (list) { next = list->next; list->next = prev; prev = list; list = next; } return prev; } int tree_matrix::length (void) { tree_matrix *list = this; int len = 0; while (list) { len++; list = list->next; } return len; } tree_return_list * tree_matrix::to_return_list (void) { tree_return_list *retval = 0; tree_matrix *list; for (list = this; list; list = list->next) { tree_expression *elem = list->element; int is_id = elem->is_identifier (); int is_idx_expr = elem->is_index_expression (); if (is_id || is_idx_expr) { tree_index_expression *idx_expr; if (is_id) { tree_identifier *id = (tree_identifier *) elem; idx_expr = new tree_index_expression (id); } else idx_expr = (tree_index_expression *) elem; if (list == this) retval = new tree_return_list (idx_expr); else retval->append (idx_expr); } else { delete retval; retval = 0; break; } } return retval; } // Just about as ugly as it gets. struct const_matrix_list { tree_matrix::dir direction; tree_constant elem; int nr; int nc; }; // Less ugly than before, anyway. tree_constant tree_matrix::eval (int print) { tree_constant retval; if (error_state) return retval; // Just count the elements without looking at them. int total_len = length (); // Easier to deal with this later instead of a tree_matrix structure. const_matrix_list *list = new const_matrix_list [total_len]; // Stats we want to keep track of. int all_strings = 1; int found_complex = 0; int row_total = 0; int col_total = 0; int row_height = 0; int cols_this_row = 0; int first_row = 1; int empties_ok = user_pref.empty_list_elements_ok; tree_matrix *ptr = this; // Stuff for the result matrix or string. Declared here so that we // don't get warnings from gcc about the goto crossing the // initialization of these values. int put_row = 0; int put_col = 0; int prev_nr = 0; int prev_nc = 0; Matrix m; ComplexMatrix cm; char *string = 0; char *str_ptr = 0; // Eliminate empties and gather stats. int found_new_row_in_empties = 0; int len = 0; for (int i = 0; i < total_len; i++) { tree_expression *elem = ptr->element; if (! elem) { retval = tree_constant (Matrix ()); goto done; } tree_constant tmp = elem->eval (0); if (error_state || tmp.is_undefined ()) { retval = tree_constant (); goto done; } int nr = tmp.rows (); int nc = tmp.columns (); dir direct = ptr->direction; if (nr == 0 || nc == 0) { if (empties_ok < 0) warning ("empty matrix found in matrix list"); else if (empties_ok == 0) { ::error ("empty matrix found in matrix list"); retval = tree_constant (); goto done; } if (direct == md_down) found_new_row_in_empties = 1; goto next; } if (found_new_row_in_empties) { found_new_row_in_empties = 0; list[len].direction = md_down; } else list[len].direction = direct; list[len].elem = tmp; list[len].nr = nr; list[len].nc = nc; if (all_strings && ! tmp.is_string ()) all_strings = 0; if (! found_complex && tmp.is_complex_type ()) found_complex = 1; len++; next: ptr = ptr->next; } // if (all_strings) // cerr << "all strings\n"; // Compute size of result matrix, and check to see that the dimensions // of all the elements will match up properly. for (i = 0; i < len; i++) { dir direct = list[i].direction; int nr = list[i].nr; int nc = list[i].nc; if (i == 0) { row_total = nr; col_total = nc; row_height = nr; cols_this_row = nc; } else { switch (direct) { case md_right: { if (nr != row_height) { ::error ("number of rows must match"); goto done; } else { cols_this_row += nc; if (first_row) col_total = cols_this_row; } } break; case md_down: { if (cols_this_row != col_total) { ::error ("number of columns must match"); goto done; } first_row = 0; row_total += nr; row_height = nr; cols_this_row = nc; } break; default: panic_impossible (); break; } } } // Don\'t forget to check to see if the last element will fit. if (cols_this_row != col_total) { ::error ("number of columns must match"); goto done; } // Now, extract the values from the individual elements and insert // them in the result matrix. if (all_strings && row_total == 1 && col_total > 0) { string = str_ptr = new char [col_total + 1]; string[col_total] = '\0'; } else if (found_complex) cm.resize (row_total, col_total, 0.0); else m.resize (row_total, col_total, 0.0); for (i = 0; i < len; i++) { tree_constant tmp = list[i].elem; int nr = list[i].nr; int nc = list[i].nc; if (nr == 0 || nc == 0) continue; if (i == 0) { put_row = 0; put_col = 0; } else { switch (list[i].direction) { case md_right: put_col += prev_nc; break; case md_down: put_row += prev_nr; put_col = 0; break; default: panic_impossible (); break; } } if (found_complex) { if (tmp.is_real_scalar ()) { cm (put_row, put_col) = tmp.double_value (); } else if (tmp.is_real_matrix () || tmp.is_range ()) { cm.insert (tmp.matrix_value (), put_row, put_col); } else if (tmp.is_complex_scalar ()) { cm (put_row, put_col) = tmp.complex_value (); } else { ComplexMatrix cm_tmp = tmp.complex_matrix_value (); if (error_state) goto done; cm.insert (cm_tmp, put_row, put_col); } } else { if (tmp.is_real_scalar ()) { m (put_row, put_col) = tmp.double_value (); } else if (tmp.is_string () && all_strings && str_ptr) { memcpy (str_ptr, tmp.string_value (), nc); str_ptr += nc; } else { Matrix m_tmp = tmp.matrix_value (); if (error_state) goto done; m.insert (m_tmp, put_row, put_col); } } prev_nr = nr; prev_nc = nc; } if (all_strings && string) retval = tree_constant (string); else if (found_complex) retval = tree_constant (cm); else retval = tree_constant (m); done: delete [] list; return retval; } void tree_matrix::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; os << "["; tree_matrix *list = this; while (list) { list->element->print_code (os); list = list->next; if (list) { switch (list->direction) { case md_right: os << ", "; break; case md_down: os << "; "; break; default: break; } } } os << "]"; if (in_parens) os << ")"; } // A base class for objects that can be return multiple values tree_constant tree_multi_val_ret::eval (int print) { panic ("invalid evaluation of generic expression"); return tree_constant (); } // A base class for objects that can be evaluated with argument lists. tree_constant tree_fvc::assign (tree_constant& t, const Octave_object& args) { panic_impossible (); return tree_constant (); } tree_constant tree_fvc::lookup_map_element (SLList& list) { static tree_constant retval; return retval; } // Symbols from the symbol table. char * tree_identifier::name (void) const { return sym ? sym->name () : 0; } tree_identifier * tree_identifier::define (tree_constant *t) { int status = sym->define (t); return status ? this : 0; } tree_identifier * tree_identifier::define (tree_function *t) { int status = sym->define (t); return status ? this : 0; } void tree_identifier::document (char *s) { if (sym && s) sym->document (strsave (s)); } tree_constant tree_identifier::assign (tree_constant& rhs) { tree_constant retval; if (rhs.is_defined ()) { if (! sym->is_defined ()) { if (! (sym->is_formal_parameter () || sym->is_linked_to_global ())) { link_to_builtin_variable (sym); } } else if (sym->is_function ()) { sym->clear (); } tree_constant *tmp = new tree_constant (rhs); if (sym->define (tmp)) retval = rhs; else delete tmp; } return retval; } tree_constant tree_identifier::assign (tree_constant& rhs, const Octave_object& args) { tree_constant retval; if (rhs.is_defined ()) { if (! sym->is_defined ()) { if (! (sym->is_formal_parameter () || sym->is_linked_to_global ())) { link_to_builtin_variable (sym); } } else if (sym->is_function ()) { sym->clear (); } if (sym->is_variable () && sym->is_defined ()) { tree_fvc *tmp = sym->def (); retval = tmp->assign (rhs, args); } else { assert (! sym->is_defined ()); if (! user_pref.resize_on_range_error) { ::error ("indexed assignment to previously undefined variables"); ::error ("is only possible when resize_on_range_error is true"); } else { tree_constant *tmp = new tree_constant (); retval = tmp->assign (rhs, args); if (retval.is_defined ()) sym->define (tmp); } } } return retval; } tree_constant tree_identifier::assign (SLList list, tree_constant& rhs) { tree_constant retval; if (rhs.is_defined ()) { if (sym->is_function ()) sym->clear (); tree_fvc *curr_val = sym->def (); tree_constant *tmp = 0; if (curr_val && curr_val->is_constant ()) tmp = (tree_constant *) curr_val; else { tmp = new tree_constant (); if (! sym->define (tmp)) { delete tmp; tmp = 0; } } if (tmp) retval = tmp->assign_map_element (list, rhs); } return retval; } tree_constant tree_identifier::assign (SLList list, tree_constant& rhs, const Octave_object& args) { tree_constant retval; if (rhs.is_defined ()) { if (sym->is_function ()) sym->clear (); if (sym->is_variable () && sym->is_defined ()) { tree_fvc *curr_val = sym->def (); tree_constant *tmp; if (curr_val && curr_val->is_constant ()) tmp = (tree_constant *) curr_val; else panic_impossible (); retval = tmp->assign_map_element (list, rhs, args); } else { assert (! sym->is_defined ()); if (! user_pref.resize_on_range_error) { ::error ("indexed assignment to previously undefined variables"); ::error ("is only possible when resize_on_range_error is true"); } else { tree_constant *tmp = new tree_constant (); retval = tmp->assign_map_element (list, rhs, args); if (retval.is_defined ()) sym->define (tmp); } } } return retval; } int tree_identifier::is_defined (void) { return (sym && sym->is_defined ()); } void tree_identifier::bump_value (tree_expression::type etype) { if (sym) { if (sym->is_read_only ()) { ::error ("can't redefined read-only variable `%s'", name ()); } else { tree_fvc *tmp = sym->def (); if (tmp) tmp->bump_value (etype); } } } void tree_identifier::eval_undefined_error (void) { char *nm = name (); int l = line (); int c = column (); if (l == -1 && c == -1) ::error ("`%s' undefined", nm); else ::error ("`%s' undefined near line %d column %d", nm, l, c); } // Try to find a definition for an identifier. Here's how: // // * If the identifier is already defined and is a function defined // in an function file that has been modified since the last time // we parsed it, parse it again. // // * If the identifier is not defined, try to find a builtin // variable or an already compiled function with the same name. // // * If the identifier is still undefined, try looking for an // function file to parse. // // * On systems that support dynamic linking, we prefer .oct files // over .m files. tree_fvc * tree_identifier::do_lookup (int& script_file_executed, int exec_script) { script_file_executed = lookup (sym, exec_script); tree_fvc *retval = 0; if (! script_file_executed) retval = sym->def (); return retval; } void tree_identifier::link_to_global (void) { if (sym) link_to_global_variable (sym); } void tree_identifier::mark_as_formal_parameter (void) { if (sym) sym->mark_as_formal_parameter (); } tree_constant tree_identifier::eval (int print) { tree_constant retval; if (error_state) return retval; int script_file_executed = 0; tree_fvc *object_to_eval = do_lookup (script_file_executed); if (! script_file_executed) { if (object_to_eval) { int nargout = maybe_do_ans_assign ? 0 : 1; if (nargout) { Octave_object tmp_args; Octave_object tmp = object_to_eval->eval (0, nargout, tmp_args); if (tmp.length () > 0) retval = tmp(0); } else retval = object_to_eval->eval (0); } else eval_undefined_error (); } if (! error_state && retval.is_defined ()) { if (maybe_do_ans_assign && ! object_to_eval->is_constant ()) { // XXX FIXME XXX -- need a procedure to do this, probably in // variables.cc, to isolate the code that does lookups... symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); assert (sr); tree_identifier *ans_id = new tree_identifier (sr); tree_constant *tmp = new tree_constant (retval); tree_simple_assignment_expression tmp_ass (ans_id, tmp, 0, 1); tmp_ass.eval (print); } else { if (print) print_constant (retval, name ()); } } return retval; } Octave_object tree_identifier::eval (int print, int nargout, const Octave_object& args) { Octave_object retval; if (error_state) return retval; int script_file_executed = 0; tree_fvc *object_to_eval = do_lookup (script_file_executed); if (! script_file_executed) { if (object_to_eval) { if (maybe_do_ans_assign && nargout == 1) { // Don't count the output arguments that we create automatically. nargout = 0; retval = object_to_eval->eval (0, nargout, args); if (retval.length () > 0 && retval(0).is_defined ()) { // XXX FIXME XXX -- need a procedure to do this, probably in // variables.cc, to isolate the code that does lookups... symbol_record *sr = global_sym_tab->lookup ("ans", 1, 0); assert (sr); tree_identifier *ans_id = new tree_identifier (sr); tree_constant *tmp = new tree_constant (retval(0)); tree_simple_assignment_expression tmp_ass (ans_id, tmp, 0, 1); tmp_ass.eval (print); } } else retval = object_to_eval->eval (print, nargout, args); } else eval_undefined_error (); } return retval; } void tree_identifier::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; char *nm = name (); os << (nm) ? nm : "(null)"; if (in_parens) os << ")"; } // Indirect references to values (structure elements). tree_indirect_ref::~tree_indirect_ref (void) { while (! refs.empty ()) { char *t = refs.remove_front (); delete [] t; } if (! preserve_ident) delete id; } tree_indirect_ref * tree_indirect_ref::chain (const char *elt) { refs.append (strsave (elt)); return this; } char * tree_indirect_ref::name (void) { char *id_nm = id->name (); if (refs.empty ()) return id_nm; else { static char *nm = 0; delete [] nm; ostrstream tmp; tmp << id_nm; for (Pix p = refs.first (); p != 0; refs.next (p)) { char *elt = refs (p); if (elt) tmp << "." << elt; } tmp << ends; nm = tmp.str (); return nm; } } tree_constant tree_indirect_ref::assign (tree_constant& t) { tree_constant retval; if (refs.empty ()) retval = id->assign (t); else retval = id->assign (refs, t); return retval; } tree_constant tree_indirect_ref::assign (tree_constant& t, const Octave_object& args) { tree_constant retval; if (refs.empty ()) retval = id->assign (t, args); else retval = id->assign (refs, t, args); return retval; } tree_constant tree_indirect_ref::eval (int print) { tree_constant retval; if (error_state) return retval; if (refs.empty ()) { retval = id->eval (print); } else { int script_file_executed; tree_fvc *object_to_eval = id->do_lookup (script_file_executed, 0); if (object_to_eval) { retval = object_to_eval->lookup_map_element (refs); if (! error_state && print) print_constant (retval, name ()); } else id->eval_undefined_error (); } return retval; } Octave_object tree_indirect_ref::eval (int print, int nargout, const Octave_object& args) { Octave_object retval; if (error_state) return retval; if (refs.empty ()) { retval = id->eval (print, nargout, args); } else { int script_file_executed; tree_fvc *object_to_eval = id->do_lookup (script_file_executed, 0); if (object_to_eval) { tree_constant tmp = object_to_eval->lookup_map_element (refs); if (! error_state) { retval = tmp.eval (0, nargout, args); if (! error_state && print) { tmp = retval (0); if (tmp.is_defined ()) print_constant (tmp, name ()); } } } else id->eval_undefined_error (); } return retval; } void tree_indirect_ref::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; char *nm = id ? id->name () : "(null)"; os << (nm) ? nm : "(null)"; for (Pix p = refs.first (); p != 0; refs.next (p)) { char *elt = refs (p); if (elt) os << "." << elt; } if (in_parens) os << ")"; } // Index expressions. tree_index_expression::~tree_index_expression (void) { delete id; delete list; } tree_constant tree_index_expression::eval (int print) { tree_constant retval; if (error_state) return retval; if (list) { // Extract the arguments into a simple vector. Don't pass null args. Octave_object args = list->convert_to_const_vector (); if (error_state) eval_error (); else { int nargin = args.length (); if (error_state) eval_error (); else if (nargin > 0 && all_args_defined (args)) { Octave_object tmp = id->eval (print, 1, args); if (error_state) eval_error (); else if (tmp.length () > 0) retval = tmp(0); } } } else { retval = id->eval (print); if (error_state) eval_error (); } return retval; } Octave_object tree_index_expression::eval (int print, int nargout, const Octave_object& args) { Octave_object retval; if (error_state) return retval; if (list) { // Extract the arguments into a simple vector. Don't pass null args. Octave_object args = list->convert_to_const_vector (); if (error_state) eval_error (); else { int nargin = args.length (); if (error_state) eval_error (); else if (nargin > 0 && all_args_defined (args)) { retval = id->eval (print, nargout, args); if (error_state) eval_error (); } } } else { Octave_object tmp_args; retval = id->eval (print, nargout, tmp_args); if (error_state) eval_error (); } return retval; } void tree_index_expression::eval_error (void) { if (error_state > 0) { int l = line (); int c = column (); char *fmt; if (l != -1 && c != -1) { if (list) fmt = "evaluating index expression near line %d, column %d"; else fmt = "evaluating expression near line %d, column %d"; ::error (fmt, l, c); } else { if (list) ::error ("evaluating index expression"); else ::error ("evaluating expression"); } } } void tree_index_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (id) id->print_code (os); if (list) { os << " ("; list->print_code (os); os << ")"; } if (in_parens) os << ")"; } // Prefix expressions. tree_constant tree_prefix_expression::eval (int print) { tree_constant retval; if (error_state) return retval; if (id) { id->bump_value (etype); if (error_state) eval_error (); else { retval = id->eval (print); if (error_state) { retval = tree_constant (); if (error_state) eval_error (); } } } return retval; } char * tree_prefix_expression::oper (void) const { static char *op; switch (etype) { case tree_expression::increment: op = "++"; break; case tree_expression::decrement: op = "--"; break; default: op = ""; break; } return op; } void tree_prefix_expression::eval_error (void) { if (error_state > 0) { char *op = oper (); ::error ("evaluating prefix operator `%s' near line %d, column %d", op, line (), column ()); } } void tree_prefix_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; os << oper (); if (id) id->print_code (os); if (in_parens) os << ")"; } // Postfix expressions. tree_constant tree_postfix_expression::eval (int print) { tree_constant retval; if (error_state) return retval; if (id) { retval = id->eval (print); id->bump_value (etype); if (error_state) { retval = tree_constant (); if (error_state) eval_error (); } } return retval; } char * tree_postfix_expression::oper (void) const { static char *op; switch (etype) { case tree_expression::increment: op = "++"; break; case tree_expression::decrement: op = "--"; break; default: op = ""; break; } return op; } void tree_postfix_expression::eval_error (void) { if (error_state > 0) { char *op = oper (); ::error ("evaluating postfix operator `%s' near line %d, column %d", op, line (), column ()); } } void tree_postfix_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (id) id->print_code (os); os << oper (); if (in_parens) os << ")"; } // Unary expressions. tree_constant tree_unary_expression::eval (int print) { if (error_state) return tree_constant (); tree_constant retval; switch (etype) { case tree_expression::not: case tree_expression::uminus: case tree_expression::hermitian: case tree_expression::transpose: if (op) { tree_constant u = op->eval (0); if (error_state) eval_error (); else if (u.is_defined ()) { retval = do_unary_op (u, etype); if (error_state) { retval = tree_constant (); if (error_state) eval_error (); } } } break; default: ::error ("unary operator %d not implemented", etype); break; } return retval; } char * tree_unary_expression::oper (void) const { static char *op; switch (etype) { case tree_expression::not: op = "!"; break; case tree_expression::uminus: op = "-"; break; case tree_expression::hermitian: op = "'"; break; case tree_expression::transpose: op = ".'"; break; default: op = ""; break; } return op; } void tree_unary_expression::eval_error (void) { if (error_state > 0) { char *op = oper (); ::error ("evaluating unary operator `%s' near line %d, column %d", op, line (), column ()); } } void tree_unary_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; switch (etype) { case tree_expression::not: case tree_expression::uminus: os << oper (); if (op) op->print_code (os); break; case tree_expression::hermitian: case tree_expression::transpose: if (op) op->print_code (os); os << oper (); break; default: os << oper (); if (op) op->print_code (os); break; } if (in_parens) os << ")"; } // Binary expressions. tree_constant tree_binary_expression::eval (int print) { if (error_state) return tree_constant (); tree_constant retval; switch (etype) { case tree_expression::add: case tree_expression::subtract: case tree_expression::multiply: case tree_expression::el_mul: case tree_expression::divide: case tree_expression::el_div: case tree_expression::leftdiv: case tree_expression::el_leftdiv: case tree_expression::power: case tree_expression::elem_pow: case tree_expression::cmp_lt: case tree_expression::cmp_le: case tree_expression::cmp_eq: case tree_expression::cmp_ge: case tree_expression::cmp_gt: case tree_expression::cmp_ne: case tree_expression::and: case tree_expression::or: if (op1) { tree_constant a = op1->eval (0); if (error_state) eval_error (); else if (a.is_defined () && op2) { tree_constant b = op2->eval (0); if (error_state) eval_error (); else if (b.is_defined ()) { retval = do_binary_op (a, b, etype); if (error_state) { retval = tree_constant (); if (error_state) eval_error (); } } } } break; case tree_expression::and_and: case tree_expression::or_or: { int result = 0; if (op1) { tree_constant a = op1->eval (0); if (error_state) { eval_error (); break; } int a_true = a.is_true (); if (error_state) { eval_error (); break; } if (a_true) { if (etype == tree_expression::or_or) { result = 1; goto done; } } else { if (etype == tree_expression::and_and) { result = 0; goto done; } } if (op2) { tree_constant b = op2->eval (0); if (error_state) { eval_error (); break; } result = b.is_true (); if (error_state) { eval_error (); break; } } } done: retval = tree_constant ((double) result); } break; default: ::error ("binary operator %d not implemented", etype); break; } return retval; } char * tree_binary_expression::oper (void) const { static char *op; switch (etype) { case tree_expression::add: op = "+"; break; case tree_expression::subtract: op = "-"; break; case tree_expression::multiply: op = "*"; break; case tree_expression::el_mul: op = ".*"; break; case tree_expression::divide: op = "/"; break; case tree_expression::el_div: op = "./"; break; case tree_expression::leftdiv: op = "\\"; break; case tree_expression::el_leftdiv: op = ".\\"; break; case tree_expression::power: op = "^"; break; case tree_expression::elem_pow: op = ".^"; break; case tree_expression::cmp_lt: op = "<"; break; case tree_expression::cmp_le: op = "<="; break; case tree_expression::cmp_eq: op = "=="; break; case tree_expression::cmp_ge: op = ">="; break; case tree_expression::cmp_gt: op = ">"; break; case tree_expression::cmp_ne: op = "!="; break; case tree_expression::and_and: op = "&&"; break; case tree_expression::or_or: op = "||"; break; case tree_expression::and: op = "&"; break; case tree_expression::or: op = "|"; break; default: op = ""; break; } return op; } void tree_binary_expression::eval_error (void) { if (error_state > 0) { char *op = oper (); ::error ("evaluating binary operator `%s' near line %d, column %d", op, line (), column ()); } } void tree_binary_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (op1) op1->print_code (os); os << " " << oper () << " "; if (op2) op2->print_code (os); if (in_parens) os << ")"; } // Simple assignment expressions. tree_simple_assignment_expression::~tree_simple_assignment_expression (void) { if (! preserve) { delete lhs; delete index; } delete rhs; } tree_constant tree_simple_assignment_expression::eval (int print) { assert (etype == tree_expression::assignment); tree_constant retval; if (error_state) return retval; if (rhs) { tree_constant rhs_val = rhs->eval (0); if (error_state) { if (error_state) eval_error (); } else if (! index) { retval = lhs->assign (rhs_val); if (error_state) eval_error (); } else { // Extract the arguments into a simple vector. Octave_object args = index->convert_to_const_vector (); if (error_state) eval_error (); else { int nargin = args.length (); if (error_state) eval_error (); else if (nargin > 0) { retval = lhs->assign (rhs_val, args); if (error_state) eval_error (); } } } } if (! error_state && retval.is_defined ()) { int pad_after = 0; if (print && user_pref.print_answer_id_name) { if (print_as_scalar (retval)) { ostrstream output_buf; output_buf << lhs->name () << " = " << ends; maybe_page_output (output_buf); } else { pad_after = 1; ostrstream output_buf; output_buf << lhs->name () << " =\n\n" << ends; maybe_page_output (output_buf); } } retval.eval (print); if (print && pad_after) { ostrstream output_buf; output_buf << "\n" << ends; maybe_page_output (output_buf); } } return retval; } void tree_simple_assignment_expression::eval_error (void) { if (error_state > 0) { int l = line (); int c = column (); if (l != -1 && c != -1) ::error ("evaluating assignment expression near line %d, column %d", l, c); // else // ::error ("evaluating assignment expression"); } } void tree_simple_assignment_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (! is_ans_assign ()) { if (lhs) lhs->print_code (os); if (index) { os << " ("; index->print_code (os); os << ")"; } os << " = "; } if (rhs) rhs->print_code (os); if (in_parens) os << ")"; } // Multi-valued assignmnt expressions. tree_multi_assignment_expression::~tree_multi_assignment_expression (void) { delete lhs; delete rhs; } tree_constant tree_multi_assignment_expression::eval (int print) { tree_constant retval; if (error_state) return retval; Octave_object tmp_args; Octave_object result = eval (print, 1, tmp_args); if (result.length () > 0) retval = result(0); return retval; } Octave_object tree_multi_assignment_expression::eval (int print, int nargout, const Octave_object& args) { assert (etype == tree_expression::multi_assignment); if (error_state || ! rhs) return Octave_object (); nargout = lhs->length (); Octave_object tmp_args; Octave_object results = rhs->eval (0, nargout, tmp_args); if (error_state) eval_error (); int ma_line = line (); int ma_column = column (); if (results.length () > 0) { int i = 0; int pad_after = 0; int last_was_scalar_type = 0; for (Pix p = lhs->first (); p != 0; lhs->next (p)) { tree_index_expression *lhs_expr = (*lhs) (p); if (i < nargout) { // XXX FIXME? XXX -- this is apparently the way Matlab works, but // maybe we should have the option of skipping the assignment instead. tree_constant *tmp = 0; if (results(i).is_undefined ()) { Matrix m; tmp = new tree_constant (m); } else tmp = new tree_constant (results(i)); tree_simple_assignment_expression tmp_expr (lhs_expr, tmp, 1, 0, ma_line, ma_column); results(i) = tmp_expr.eval (0); // May change if (error_state) break; if (print && pad_after) { ostrstream output_buf; output_buf << "\n" << '\0'; maybe_page_output (output_buf); } if (print && user_pref.print_answer_id_name) { char *tmp_nm = lhs_expr->name (); if (print_as_scalar (results(i))) { ostrstream output_buf; output_buf << tmp_nm << " = " << '\0'; maybe_page_output (output_buf); last_was_scalar_type = 1; } else { ostrstream output_buf; output_buf << tmp_nm << " =\n\n" << '\0'; maybe_page_output (output_buf); last_was_scalar_type = 0; } } results(i).eval (print); pad_after++; i++; } else { tree_simple_assignment_expression tmp_expr (lhs_expr, 0, 1, 0, ma_line, ma_column); tmp_expr.eval (0); if (error_state) break; if (last_was_scalar_type && i == 1) pad_after = 0; break; } } if (print && pad_after) { ostrstream output_buf; output_buf << "\n" << '\0'; maybe_page_output (output_buf); } } return results; } void tree_multi_assignment_expression::eval_error (void) { if (error_state > 0) ::error ("evaluating assignment expression near line %d, column %d", line (), column ()); } void tree_multi_assignment_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (lhs) { int len = lhs->length (); if (len > 1) os << "["; lhs->print_code (os); if (len > 1) os << "]"; } os << " = "; if (rhs) rhs->print_code (os); if (in_parens) os << ")"; } // Colon expressions. tree_colon_expression * tree_colon_expression::chain (tree_expression *t) { tree_colon_expression *retval = 0; if (! op1 || op3) ::error ("invalid colon expression"); else { op3 = op2; // Stupid syntax. op2 = t; retval = this; } return retval; } tree_constant tree_colon_expression::eval (int print) { tree_constant retval; if (error_state || ! op1 || ! op2) return retval; tree_constant tmp = op1->eval (0); if (tmp.is_undefined ()) { eval_error ("invalid null value in colon expression"); return retval; } double base = tmp.double_value (); if (error_state) { eval_error ("evaluating colon expression"); return retval; } tmp = op2->eval (0); if (tmp.is_undefined ()) { eval_error ("invalid null value in colon expression"); return retval; } double limit = tmp.double_value (); if (error_state) { eval_error ("evaluating colon expression"); return retval; } double inc = 1.0; if (op3) { tmp = op3->eval (0); if (tmp.is_undefined ()) { eval_error ("invalid null value in colon expression"); return retval; } inc = tmp.double_value (); if (error_state) { eval_error ("evaluating colon expression"); return retval; } } retval = tree_constant (base, limit, inc); if (error_state) { if (error_state) eval_error ("evaluating colon expression"); return tree_constant (); } return retval; } void tree_colon_expression::eval_error (const char *s) { if (error_state > 0) ::error ("%s near line %d column %d", s, line (), column ()); } void tree_colon_expression::print_code (ostream& os) { print_code_indent (os); if (in_parens) os << "("; if (op1) op1->print_code (os); // Stupid syntax. if (op3) { os << ":"; op3->print_code (os); } if (op2) { os << ":"; op2->print_code (os); } if (in_parens) os << ")"; } // Builtin functions. tree_builtin::tree_builtin (const char *nm) { nargin_max = -1; nargout_max = -1; is_mapper = 0; fcn = 0; if (nm) my_name = strsave (nm); } tree_builtin::tree_builtin (int i_max, int o_max, Mapper_fcn& m_fcn, const char *nm) { nargin_max = i_max; nargout_max = o_max; mapper_fcn = m_fcn; is_mapper = 1; fcn = 0; my_name = nm ? strsave (nm) : 0; } tree_builtin::tree_builtin (int i_max, int o_max, Octave_builtin_fcn g_fcn, const char *nm) { nargin_max = i_max; nargout_max = o_max; is_mapper = 0; fcn = g_fcn; my_name = nm ? strsave (nm) : 0; } tree_constant tree_builtin::eval (int print) { tree_constant retval; if (error_state) return retval; if (fcn) { eval_fcn: Octave_object args; Octave_object tmp = (*fcn) (args, 0); if (tmp.length () > 0) retval = tmp(0); } else { fcn = load_octave_builtin (my_name); if (fcn) goto eval_fcn; else ::error ("unable to load builtin function %s", my_name); } return retval; } static tree_constant apply_mapper_fcn (const tree_constant& arg, Mapper_fcn& m_fcn, int print) { tree_constant retval; if (arg.is_real_type ()) { if (arg.is_scalar_type ()) { double d = arg.double_value (); if (m_fcn.can_return_complex_for_real_arg && (d < m_fcn.lower_limit || d > m_fcn.upper_limit)) { if (m_fcn.c_c_mapper) retval = m_fcn.c_c_mapper (Complex (d)); else error ("%s: unable to handle real arguments", m_fcn.name); } else if (m_fcn.d_d_mapper) retval = m_fcn.d_d_mapper (d); else error ("%s: unable to handle real arguments", m_fcn.name); } else { Matrix m = arg.matrix_value (); if (error_state) return retval; if (m_fcn.can_return_complex_for_real_arg && (any_element_less_than (m, m_fcn.lower_limit) || any_element_greater_than (m, m_fcn.upper_limit))) { if (m_fcn.c_c_mapper) retval = map (m_fcn.c_c_mapper, ComplexMatrix (m)); else error ("%s: unable to handle real arguments", m_fcn.name); } else if (m_fcn.d_d_mapper) retval = map (m_fcn.d_d_mapper, m); else error ("%s: unable to handle real arguments", m_fcn.name); } } else if (arg.is_complex_type ()) { if (arg.is_scalar_type ()) { Complex c = arg.complex_value (); if (m_fcn.d_c_mapper) retval = m_fcn.d_c_mapper (c); else if (m_fcn.c_c_mapper) retval = m_fcn.c_c_mapper (c); else error ("%s: unable to handle complex arguments", m_fcn.name); } else { ComplexMatrix cm = arg.complex_matrix_value (); if (error_state) return retval; if (m_fcn.d_c_mapper) retval = map (m_fcn.d_c_mapper, cm); else if (m_fcn.c_c_mapper) retval = map (m_fcn.c_c_mapper, cm); else error ("%s: unable to handle complex arguments", m_fcn.name); } } else gripe_wrong_type_arg ("mapper", arg); return retval; } Octave_object tree_builtin::eval (int print, int nargout, const Octave_object& args) { Octave_object retval; if (error_state) return retval; int nargin = args.length (); if (fcn) { eval_fcn: if (any_arg_is_magic_colon (args)) ::error ("invalid use of colon in function argument list"); else retval = (*fcn) (args, nargout); } else if (is_mapper) { if (nargin > nargin_max) ::error ("%s: too many arguments", my_name); else if (nargin > 0 && args(0).is_defined ()) { tree_constant tmp = apply_mapper_fcn (args(0), mapper_fcn, 0); retval(0) = tmp; } } else { fcn = load_octave_builtin (my_name); if (fcn) goto eval_fcn; else ::error ("unable to load builtin function %s", my_name); } return retval; } int tree_builtin::max_expected_args (void) { int ea = nargin_max; if (nargin_max < 0) ea = INT_MAX; else ea = nargin_max; return ea; } // User defined functions. #if 0 tree_function * tree_function::define (tree statement_list *t) { cmd_list = t; return this; } #endif tree_function * tree_function::define_param_list (tree_parameter_list *t) { param_list = t; if (param_list) { num_named_args = param_list->length (); curr_va_arg_number = num_named_args; } return this; } tree_function * tree_function::define_ret_list (tree_parameter_list *t) { ret_list = t; if (ret_list && ret_list->takes_varargs ()) vr_list = new tree_va_return_list; return this; } void tree_function::stash_fcn_file_name (void) { delete [] file_name; file_name = fcn_name ? fcn_file_in_path (fcn_name) : 0; } void tree_function::mark_as_system_fcn_file (void) { if (file_name) { // We really should stash the whole path to the file we found, when we // looked it up, to avoid possible race conditions... XXX FIXME XXX // // We probably also don't need to get the library directory every // time, but since this function is only called when the function file // is parsed, it probably doesn't matter that much. char *oct_lib = octave_lib_dir (); int len = strlen (oct_lib); char *ff_name = fcn_file_in_path (file_name); if (strncmp (oct_lib, ff_name, len) == 0) system_fcn_file = 1; delete [] ff_name; } else system_fcn_file = 0; } int tree_function::takes_varargs (void) const { return (param_list && param_list->takes_varargs ()); } tree_constant tree_function::octave_va_arg (void) { tree_constant retval; if (curr_va_arg_number < num_args_passed) retval = args_passed (curr_va_arg_number++); else ::error ("va_arg: error getting arg number %d -- only %d provided", curr_va_arg_number + 1, num_args_passed); return retval; } Octave_object tree_function::octave_all_va_args (void) { Octave_object retval; retval.resize (num_args_passed - num_named_args); int k = 0; for (int i = num_named_args; i < num_args_passed; i++) retval(k++) = args_passed(i); return retval; } int tree_function::takes_var_return (void) const { return (ret_list && ret_list->takes_varargs ()); } void tree_function::octave_vr_val (const tree_constant& val) { assert (vr_list); vr_list->append (val); } void tree_function::stash_function_name (char *s) { delete [] fcn_name; fcn_name = strsave (s); } tree_constant tree_function::eval (int print) { tree_constant retval; if (error_state || ! cmd_list) return retval; Octave_object tmp_args; tmp_args.resize (1); Octave_object tmp = eval (print, 1, tmp_args); if (! error_state && tmp.length () > 0) retval = tmp(0); return retval; } // For unwind protect. static void pop_symbol_table_context (void *table) { symbol_table *tmp = (symbol_table *) table; tmp->pop_context (); } static void delete_vr_list (void *list) { tree_va_return_list *tmp = (tree_va_return_list *) list; tmp->clear (); delete tmp; } static void clear_symbol_table (void *table) { symbol_table *tmp = (symbol_table *) table; tmp->clear (); } Octave_object tree_function::eval (int print, int nargout, const Octave_object& args) { Octave_object retval; if (error_state) return retval; if (! cmd_list) return retval; int nargin = args.length (); begin_unwind_frame ("func_eval"); unwind_protect_int (call_depth); call_depth++; if (call_depth > 1) { sym_tab->push_context (); add_unwind_protect (pop_symbol_table_context, (void *) sym_tab); if (vr_list) { // Push new vr_list. unwind_protect_ptr (vr_list); vr_list = new tree_va_return_list; // Clear and delete the new one before restoring the old one. add_unwind_protect (delete_vr_list, (void *) vr_list); } } if (vr_list) vr_list->clear (); // Force symbols to be undefined again when this function exits. add_unwind_protect (clear_symbol_table, (void *) sym_tab); // Save old and set current symbol table context, for eval_undefined_error(). unwind_protect_ptr (curr_sym_tab); curr_sym_tab = sym_tab; unwind_protect_ptr (curr_function); curr_function = this; // unwind_protect_ptr (args_passed); args_passed = args; unwind_protect_int (num_args_passed); num_args_passed = nargin; unwind_protect_int (num_named_args); unwind_protect_int (curr_va_arg_number); if (param_list && ! param_list->varargs_only ()) { param_list->define_from_arg_vector (args); if (error_state) goto abort; } // The following code is in a separate scope to avoid warnings from // G++ about `goto abort' crossing the initialization of some // variables. { bind_nargin_and_nargout (sym_tab, nargin, nargout); // Evaluate the commands that make up the function. Always turn on // printing for commands inside functions. Maybe this should be // toggled by a user-leval variable? int pf = ! user_pref.silent_functions; tree_constant last_computed_value = cmd_list->eval (pf); if (returning) returning = 0; if (error_state) { traceback_error (); goto abort; } // Copy return values out. if (ret_list) retval = ret_list->convert_to_const_vector (vr_list); else if (user_pref.return_last_computed_value) retval(0) = last_computed_value; } abort: run_unwind_frame ("func_eval"); return retval; } int tree_function::max_expected_args (void) { if (param_list) { if (param_list->takes_varargs ()) return -1; else return param_list->length (); } else return 1; } void tree_function::traceback_error (void) { if (error_state >= 0) error_state = -1; if (fcn_name) { if (file_name) ::error ("called from `%s' in file `%s'", fcn_name, file_name); else ::error ("called from `%s'", fcn_name); } else { if (file_name) ::error ("called from file `%s'", file_name); else ::error ("called from `?unknown?'"); } } void tree_function::print_code (ostream& os) { print_code_reset (); print_code_indent (os); os << "function "; if (ret_list) { int len = ret_list->length (); if (len > 1) os << "["; ret_list->print_code (os); if (len > 1) os << "]"; os << " = "; } os << (fcn_name ? fcn_name : "(null)") << " "; if (param_list) { int len = param_list->length (); if (len > 0) os << "("; param_list->print_code (os); if (len > 0) { os << ")"; print_code_new_line (os); } } else { os << "()"; print_code_new_line (os); } if (cmd_list) { increment_indent_level (); cmd_list->print_code (os); } os << "endfunction"; print_code_new_line (os); } DEFUN ("va_arg", Fva_arg, Sva_arg, 0, 1, "va_arg (): return next argument in a function that takes a\n\ variable number of parameters") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { if (curr_function) { if (curr_function->takes_varargs ()) retval = curr_function->octave_va_arg (); else { ::error ("va_arg only valid within function taking variable"); ::error ("number of arguments"); } } else ::error ("va_arg only valid within function body"); } else print_usage ("va_arg"); return retval; } DEFUN ("va_start", Fva_start, Sva_start, 0, 0, "va_start (): reset the pointer to the list of optional arguments\n\ to the beginning") { Octave_object retval; int nargin = args.length (); if (nargin == 0) { if (curr_function) { if (curr_function->takes_varargs ()) curr_function->octave_va_start (); else { ::error ("va_start only valid within function taking variable"); ::error ("number of arguments"); } } else ::error ("va_start only valid within function body"); } else print_usage ("va_start"); return retval; } DEFUN ("vr_val", Fvr_val, Svr_val, 1, 0, "vr_val (X): append X to the list of optional return values for a function that allows a variable number of return values") { Octave_object retval; int nargin = args.length (); if (nargin == 1) { if (curr_function) { if (curr_function->takes_var_return ()) curr_function->octave_vr_val (args(0)); else { ::error ("vr_val only valid within function declared to"); ::error ("produce a variable number of values"); } } else ::error ("vr_val only valid within function body"); } else print_usage ("vr_val"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-misc.cc100666 415 17 24145 5702416776 14171 0ustar jweusers// tree-misc.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include "error.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "octave.h" #include "tree-misc.h" #include "tree-const.h" #include "user-prefs.h" #include "oct-obj.h" // Nonzero means we're breaking out of a loop. extern int breaking; // Nonzero means we're jumping to the end of a loop. extern int continuing; // Nonzero means we're returning from a function. extern int returning; // A list of commands to be executed. tree_statement::~tree_statement (void) { delete command; delete expression; } void tree_statement::print_code (ostream& os) { if (command) { command->print_code (os); if (! print_flag) os << ";"; command->print_code_new_line (os); } else if (expression) { expression->print_code (os); if (! print_flag) os << ";"; expression->print_code_new_line (os); } } tree_constant tree_statement_list::eval (int print) { int pf; tree_constant retval; if (error_state) return retval; for (Pix p = first (); p != 0; next (p)) { tree_statement *elt = this->operator () (p); if (print == 0) pf = 0; else pf = elt->print_flag; tree_command *cmd = elt->command; tree_expression *expr = elt->expression; if (cmd || expr) { if (cmd) cmd->eval (); else retval = expr->eval (pf); if (error_state) return tree_constant (); if (breaking || continuing) break; if (returning) break; } else retval = tree_constant (); } return retval; } Octave_object tree_statement_list::eval (int print, int nargout) { Octave_object retval; if (nargout > 1) { int pf; if (error_state) return retval; for (Pix p = first (); p != 0; next (p)) { tree_statement *elt = this->operator () (p); if (print == 0) pf = 0; else pf = elt->print_flag; tree_command *cmd = elt->command; tree_expression *expr = elt->expression; if (cmd || expr) { if (cmd) cmd->eval (); else { if (expr->is_multi_val_ret_expression ()) { Octave_object args; tree_multi_val_ret *t = (tree_multi_val_ret *) expr; retval = t->eval (pf, nargout, args); } else retval = expr->eval (pf); } if (error_state) return tree_constant (); if (breaking || continuing) break; if (returning) break; } else retval = Octave_object (); } return retval; } else retval = eval (print); return retval; } void tree_statement_list::print_code (ostream& os) { for (Pix p = first (); p != 0; next (p)) { tree_statement *elt = this->operator () (p); if (elt) elt->print_code (os); } } Octave_object tree_argument_list::convert_to_const_vector (void) { int len = length (); // XXX FIXME XXX -- would be nice to know in advance how largs args // needs to be even when we have a list containing an all_va_args // token. Octave_object args; args.resize (len); Pix p = first (); int j = 0; for (int k = 0; k < len; k++) { tree_expression *elt = this->operator () (p); if (elt) { tree_constant tmp = elt->eval (0); if (error_state) { ::error ("evaluating argument list element number %d", k); args = Octave_object (); break; } else { if (tmp.is_all_va_args ()) { if (curr_function) { Octave_object tva; tva = curr_function->octave_all_va_args (); int n = tva.length (); for (int i = 0; i < n; i++) args(j++) = tva(i); } else { ::error ("all_va_args is only valid inside functions"); args = Octave_object (); break; } } else args(j++) = tmp; } next (p); } else { args(j++) = tree_constant (); break; } } args.resize (j); return args; } void tree_argument_list::print_code (ostream& os) { Pix p = first (); while (p) { tree_expression *elt = this->operator () (p); next (p); if (elt) { elt->print_code (os); if (p) os << ", "; } } } // Parameter lists. void tree_parameter_list::mark_as_formal_parameters (void) { for (Pix p = first (); p != 0; next (p)) { tree_identifier *elt = this->operator () (p); elt->mark_as_formal_parameter (); } } void tree_parameter_list::define_from_arg_vector (const Octave_object& args) { int nargin = args.length (); if (nargin <= 0) return; int expected_nargin = length (); Pix p = first (); for (int i = 0; i < expected_nargin; i++) { tree_identifier *elt = this->operator () (p); tree_constant *tmp = 0; if (i < nargin) { if (args(i).is_defined () && args(i).is_magic_colon ()) { ::error ("invalid use of colon in function argument list"); return; } tmp = new tree_constant (args(i)); } elt->define (tmp); next (p); } } Octave_object tree_parameter_list::convert_to_const_vector (tree_va_return_list *vr_list) { int nout = length (); if (vr_list) nout += vr_list->length (); Octave_object retval; retval.resize (nout); int i = 0; for (Pix p = first (); p != 0; next (p)) { tree_identifier *elt = this->operator () (p); if (elt->is_defined ()) retval(i) = elt->eval (0); i++; } if (vr_list) { for (p = vr_list->first (); p != 0; vr_list->next (p)) { retval(i) = vr_list->operator () (p); i++; } } return retval; } int tree_parameter_list::is_defined (void) { int status = 1; for (Pix p = first (); p != 0; next (p)) { tree_identifier *elt = this->operator () (p); if (! elt->is_defined ()) { status = 0; break; } } return status; } void tree_parameter_list::print_code (ostream& os) { Pix p = first (); while (p) { tree_identifier *elt = this->operator () (p); next (p); if (elt) { elt->print_code (os); if (p) os << ", "; } } } // Return lists. void tree_return_list::print_code (ostream& os) { Pix p = first (); while (p) { tree_index_expression *elt = this->operator () (p); next (p); if (elt) { elt->print_code (os); if (p) os << ", "; } } } // Global. void tree_global::eval (void) { if (ident) { ident->link_to_global (); } else if (assign_expr) { tree_identifier *id = 0; if (assign_expr->left_hand_side_is_identifier_only () && (id = assign_expr->left_hand_side_id ())) { id->link_to_global (); assign_expr->eval (0); } else error ("global: unable to make individual structure elements global"); } } void tree_global::print_code (ostream& os) { if (ident) ident->print_code (os); if (assign_expr) assign_expr->print_code (os); } // Global initializer lists. void tree_global_init_list::eval (void) { for (Pix p = first (); p != 0; next (p)) { tree_global *t = this->operator () (p); t->eval (); } } void tree_global_init_list::print_code (ostream& os) { Pix p = first (); while (p) { tree_global *elt = this->operator () (p); next (p); if (elt) { elt->print_code (os); if (p) os << ", "; } } } // If. int tree_if_clause::eval (void) { if (expr) { tree_constant t1 = expr->eval (0); if (error_state || t1.is_undefined ()) return 0; if (t1.rows () == 0 || t1.columns () == 0) { int flag = user_pref.propagate_empty_matrices; if (flag < 0) warning ("if: empty matrix used in conditional"); else if (flag == 0) { ::error ("if: empty matrix used in conditional"); return 0; } t1 = tree_constant (0.0); } else if (! t1.is_scalar_type ()) { tree_constant t2 = t1.all (); t1 = t2.all (); } int expr_value = 0; if (t1.is_real_scalar ()) expr_value = (int) t1.double_value (); else if (t1.is_complex_scalar ()) expr_value = t1.complex_value () != 0.0; else error ("if: all (all (cond)) is not a scalar"); if (expr_value) { if (list) list->eval (1); return 1; } } else { if (list) list->eval (1); return 1; } return 0; } void tree_if_clause::print_code (ostream& os) { if (expr) { expr->print_code (os); print_code_new_line (os); increment_indent_level (); } else { print_code_indent (os); os << "else"; print_code_new_line (os); increment_indent_level (); } if (list) { list->print_code (os); decrement_indent_level (); } } // List of if commands. void tree_if_command_list::eval (void) { for (Pix p = first (); p != 0; next (p)) { tree_if_clause *t = this->operator () (p); if (t->eval () || error_state) break; } } void tree_if_command_list::print_code (ostream& os) { Pix p = first (); int first_elt = 1; while (p) { tree_if_clause *elt = this->operator () (p); next (p); if (elt) { if (p && ! first_elt) { print_code_indent (os); os << "elseif "; } elt->print_code (os); } first_elt = 0; } } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/tree-plot.cc100666 415 17 52127 5702416775 14214 0ustar jweusers// tree-plot.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include "SLStack.h" #include "procstream.h" #include "user-prefs.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-cmd.h" #include "tree-const.h" #include "tree-plot.h" #include "load-save.h" #include "help.h" #include "error.h" #include "gripes.h" #include "utils.h" #include "defun.h" extern "C" { #include } // The number of lines we\'ve plotted so far. static int plot_line_count = 0; // Is this a parametric plot? Makes a difference for 3D plotting. static int parametric_plot = 0; // The gnuplot terminal type. static char *gnuplot_terminal_type = 0; // Should the graph window be cleared before plotting the next line? static int clear_before_plotting = 1; // List of files to delete when we exit or crash. static SLStack tmp_files; // Pipe to gnuplot. static oprocstream plot_stream; // Use shortest possible abbreviations to minimize trouble caused by // gnuplot's fixed-length command line buffer. #ifndef GNUPLOT_COMMAND_PLOT #define GNUPLOT_COMMAND_PLOT "pl" #endif #ifndef GNUPLOT_COMMAND_REPLOT #define GNUPLOT_COMMAND_REPLOT "rep" #endif #ifndef GNUPLOT_COMMAND_SPLOT #define GNUPLOT_COMMAND_SPLOT "sp" #endif #ifndef GNUPLOT_COMMAND_USING #define GNUPLOT_COMMAND_USING "u" #endif #ifndef GNUPLOT_COMMAND_WITH #define GNUPLOT_COMMAND_WITH "w" #endif #ifndef GNUPLOT_COMMAND_TITLE #define GNUPLOT_COMMAND_TITLE "t" #endif static void open_plot_stream (void) { static int initialized = 0; if (! plot_stream.is_open ()) { initialized = 0; plot_line_count = 0; char *plot_prog = user_pref.gnuplot_binary; if (plot_prog) { plot_stream.open (plot_prog); if (! plot_stream.is_open ()) { warning ("plot: unable to open pipe to `%s'", plot_prog); if (strcmp (plot_prog, "gnuplot") != 0) { warning ("having trouble finding plotting program."); warning ("trying again with `gnuplot'"); goto last_chance; } } } else { last_chance: plot_stream.open ("gnuplot"); if (! plot_stream.is_open ()) error ("plot: unable to open pipe to `%s'", plot_prog); } } if (! initialized) { initialized = 1; plot_stream << "set data style lines\n"; if (gnuplot_terminal_type) plot_stream << "set term " << gnuplot_terminal_type << "\n"; } } static int send_to_plot_stream (const char *cmd) { // From sighandlers.cc: extern int pipe_handler_error_count; if (! plot_stream.is_open ()) { open_plot_stream (); if (error_state) return -1; } int replot_len = strlen (GNUPLOT_COMMAND_REPLOT); int splot_len = strlen (GNUPLOT_COMMAND_SPLOT); int plot_len = strlen (GNUPLOT_COMMAND_PLOT); int is_replot = (strncmp (cmd, GNUPLOT_COMMAND_REPLOT, replot_len) == 0); int is_splot = (strncmp (cmd, GNUPLOT_COMMAND_SPLOT, splot_len) == 0); int is_plot = (strncmp (cmd, GNUPLOT_COMMAND_PLOT, plot_len) == 0); if (plot_line_count == 0 && is_replot) error ("replot: no previous plot"); else { plot_stream << cmd; if (! (is_replot || is_splot || is_plot) && plot_line_count > 0 && user_pref.automatic_replot) plot_stream << GNUPLOT_COMMAND_REPLOT << "\n"; plot_stream.flush (); pipe_handler_error_count = 0; } return 0; } // Plotting, eh? tree_plot_command::tree_plot_command (void) : tree_command () { range = 0; plot_list = 0; ndim = 0; } tree_plot_command::tree_plot_command (subplot_list *plt, int nd) : tree_command () { range = 0; plot_list = plt; ndim = nd; } tree_plot_command::tree_plot_command (subplot_list *plt, plot_limits *rng, int nd) : tree_command () { range = rng; plot_list = plt; ndim = nd; } tree_plot_command::~tree_plot_command (void) { delete range; delete plot_list; } void tree_plot_command::eval (void) { if (error_state) return; open_plot_stream (); ostrstream plot_buf; switch (ndim) { case 1: if (plot_line_count == 0) { if (plot_list) plot_buf << GNUPLOT_COMMAND_PLOT; else { ::error ("replot: must have something to plot"); return; } } else plot_buf << GNUPLOT_COMMAND_REPLOT; break; case 2: if (clear_before_plotting || plot_line_count == 0) { plot_line_count = 0; plot_buf << GNUPLOT_COMMAND_PLOT; } else plot_buf << GNUPLOT_COMMAND_REPLOT; break; case 3: if (clear_before_plotting || plot_line_count == 0) { plot_line_count = 0; plot_buf << GNUPLOT_COMMAND_SPLOT; } else plot_buf << GNUPLOT_COMMAND_REPLOT; break; default: gripe_2_or_3_dim_plot (); return; } if (range) { if (plot_line_count == 0) range->print (ndim, plot_buf); else warning ("can't specify new plot ranges with `replot' or while\ hold is on"); } if (error_state) return; if (plot_list) { int status = plot_list->print (ndim, plot_buf); if (error_state || status < 0) return; } plot_buf << "\n" << ends; // Just testing... // char *message = plot_buf.str (); // cout << "[*]" << message << "[*]\n"; if (parametric_plot && ndim == 2) { warning ("can't make 2D parametric plot -- setting noparametric..."); send_to_plot_stream ("set noparametric\n"); char *message = plot_buf.str (); send_to_plot_stream (message); delete [] message; send_to_plot_stream ("set parametric\n"); } else { char *message = plot_buf.str (); send_to_plot_stream (message); delete [] message; } } void tree_plot_command::print_code (ostream& os) { print_code_indent (os); switch (ndim) { case 1: os << "replot"; break; case 2: os << "gplot"; break; case 3: os << "gsplot"; break; default: os << ""; break; } if (range) range->print_code (os); if (plot_list) plot_list->print_code (os); } plot_limits::plot_limits (void) { x_range = 0; y_range = 0; z_range = 0; } plot_limits::plot_limits (plot_range *xlim) { x_range = xlim; y_range = 0; z_range = 0; } plot_limits::plot_limits (plot_range *xlim, plot_range *ylim) { x_range = xlim; y_range = ylim; z_range = 0; } plot_limits::plot_limits (plot_range *xlim, plot_range *ylim, plot_range *zlim) { x_range = xlim; y_range = ylim; z_range = zlim; } plot_limits::~plot_limits (void) { delete x_range; delete y_range; delete z_range; } void plot_limits::print (int ndim, ostrstream& plot_buf) { if (ndim == 2 || ndim == 3) { if (x_range) x_range->print (plot_buf); else return; if (y_range) y_range->print (plot_buf); else return; } if (ndim == 3 && z_range) z_range->print (plot_buf); } void plot_limits::print_code (ostream& os) { if (x_range) x_range->print_code (os); if (y_range) y_range->print_code (os); if (z_range) z_range->print_code (os); } plot_range::plot_range (void) { lower = 0; upper = 0; } plot_range::plot_range (tree_expression *l, tree_expression *u) { lower = l; upper = u; } plot_range::~plot_range (void) { delete lower; delete upper; } void plot_range::print (ostrstream& plot_buf) { plot_buf << " ["; if (lower) { tree_constant lower_val = lower->eval (0); if (error_state) { ::error ("evaluating lower bound of plot range"); return; } else { double lo = lower_val.double_value (); plot_buf << lo; } } plot_buf << ":"; if (upper) { tree_constant upper_val = upper->eval (0); if (error_state) { ::error ("evaluating upper bound of plot range"); return; } else { double hi = upper_val.double_value (); plot_buf << hi; } } plot_buf << "]"; } void plot_range::print_code (ostream& os) { os << " ["; if (lower) lower->print_code (os); os << ":"; if (upper) upper->print_code (os); os << "]"; } subplot_using::subplot_using (void) { qualifier_count = 0; x[0] = x[1] = x[2] = x[3] = 0; scanf_fmt = 0; have_values = 0; } subplot_using::subplot_using (tree_expression *fmt) : val (4, -1) { qualifier_count = 0; x[0] = x[1] = x[2] = x[3] = 0; scanf_fmt = fmt; have_values = 0; } subplot_using::~subplot_using (void) { delete scanf_fmt; } subplot_using * subplot_using::set_format (tree_expression *fmt) { scanf_fmt = fmt; return this; } subplot_using * subplot_using::add_qualifier (tree_expression *t) { if (qualifier_count < 4) x[qualifier_count] = t; qualifier_count++; return this; } int subplot_using::eval (int ndim, int n_max) { if ((ndim == 2 && qualifier_count > 4) || (ndim == 3 && qualifier_count > 3)) return -1; if (have_values) return 1; if (qualifier_count > 0) val.resize (qualifier_count); for (int i = 0; i < qualifier_count; i++) { if (x[i]) { tree_constant tmp = x[i]->eval (0); if (error_state) { ::error ("evaluating plot using command"); return -1; } double val_tmp; if (tmp.is_defined ()) { val_tmp = tmp.double_value (); if (error_state) return -1; int n = NINT (val_tmp); if (n < 1 || n_max > 0 && n > n_max) { ::error ("using: column %d out of range", n); return -1; } else val.elem (i) = n; } else return -1; } else return -1; } if (scanf_fmt) warning ("ignoring scanf format in plot command"); have_values = 1; return 0; } ColumnVector subplot_using::values (int ndim, int n_max) { int status = eval (ndim, n_max); if (status < 0 || ! have_values) return -1; return val; } int subplot_using::print (int ndim, int n_max, ostrstream& plot_buf) { int status = eval (ndim, n_max); if (status < 0 || ! have_values) return -1; for (int i = 0; i < qualifier_count; i++) { if (i == 0) plot_buf << " " << GNUPLOT_COMMAND_USING << " "; else plot_buf << ":"; plot_buf << val.elem (i); } return 0; } void subplot_using::print_code (ostream& os) { os << " using "; for (int i = 0; i < qualifier_count; i++) { if (i > 0) os << ":"; if (x[i]) x[i]->print_code (os); } } subplot_style::subplot_style (void) { style = 0; linetype = 0; pointtype = 0; } subplot_style::subplot_style (char *s) { style = strsave (s); linetype = 0; pointtype = 0; } subplot_style::subplot_style (char *s, tree_expression *lt) { style = strsave (s); linetype = lt; pointtype = 0; } subplot_style::subplot_style (char *s, tree_expression *lt, tree_expression *pt) { style = strsave (s); linetype = lt; pointtype = pt; } subplot_style::~subplot_style (void) { delete [] style; delete linetype; delete pointtype; } int subplot_style::print (ostrstream& plot_buf) { if (style) { plot_buf << " " << GNUPLOT_COMMAND_WITH << " " << style; if (linetype) { tree_constant tmp = linetype->eval (0); if (! error_state && tmp.is_defined ()) { double val = tmp.double_value (); plot_buf << " " << NINT (val); } else { ::error ("evaluating plot style command"); return -1; } } if (pointtype) { tree_constant tmp = pointtype->eval (0); if (! error_state && tmp.is_defined ()) { double val = tmp.double_value (); plot_buf << " " << NINT (val); } else { ::error ("evaluating plot style command"); return -1; } } } else return -1; return 0; } int subplot_style::errorbars (void) { return (style && (almost_match ("errorbars", style, 1, 0) || almost_match ("boxerrorbars", style, 5, 0))); } void subplot_style::print_code (ostream& os) { os << " with " << style; if (linetype) { os << " "; linetype->print_code (os); } if (pointtype) { os << " "; pointtype->print_code (os); } } subplot::subplot (void) { plot_data = 0; using_clause = 0; title_clause = 0; style_clause = 0; } subplot::subplot (tree_expression *data) { plot_data = data; using_clause = 0; title_clause = 0; style_clause = 0; } subplot::subplot (subplot_using *u, tree_expression *t, subplot_style *s) { plot_data = 0; using_clause = u; title_clause = t; style_clause = s; } subplot::~subplot (void) { delete plot_data; delete using_clause; delete title_clause; delete style_clause; } void subplot::set_data (tree_expression *data) { plot_data = data; } tree_constant subplot::extract_plot_data (int ndim, tree_constant& data) { tree_constant retval; if (using_clause) { ColumnVector val = using_clause->values (ndim); Octave_object args; args(1) = val; args(0) = tree_constant::magic_colon_t; Octave_object tmp = data.eval (0, 1, args); retval = tmp(0); if (error_state) return tree_constant (); } else { retval = data; } if (ndim == 2 && style_clause && style_clause->errorbars ()) { int nc = retval.columns (); if (nc < 3 || nc > 4) { error ("plots with errorbars require 3 or 4 columns of data"); error ("but %d were provided", nc); return tree_constant (); } } return retval; } int subplot::handle_plot_data (int ndim, ostrstream& plot_buf) { if (plot_data) { tree_constant data = plot_data->eval (0); if (! error_state && data.is_defined ()) { char *file = 0; if (data.is_string ()) { // Should really try to look at data file to determine n_max. Can't // do much about other arbitrary gnuplot commands though... int n_max = 0; file = tilde_expand (data.string_value ()); ifstream ftmp (file); if (ftmp) { plot_buf << " \"" << file << '"'; free (file); } else { free (file); file = 0; // Opening as a file failed. Let's try passing it along as a plot // command. plot_buf << " " << data.string_value (); } if (using_clause) { int status = using_clause->print (ndim, n_max, plot_buf); if (status < 0) return -1; } } else { // Eliminate the need for printing a using clause to plot_buf. tree_constant tmp_data = extract_plot_data (ndim, data); if (tmp_data.is_defined ()) { switch (ndim) { case 2: file = save_in_tmp_file (tmp_data, ndim); break; case 3: file = save_in_tmp_file (tmp_data, ndim, parametric_plot); break; default: gripe_2_or_3_dim_plot (); break; } if (file) { mark_for_deletion (file); plot_buf << " \"" << file << '"'; } } } } else return -1; } else return -1; return 0; } int subplot::print (int ndim, ostrstream& plot_buf) { int status = handle_plot_data (ndim, plot_buf); if (status < 0) return -1; if (title_clause) { tree_constant tmp = title_clause->eval (0); if (! error_state && tmp.is_string ()) plot_buf << " " << GNUPLOT_COMMAND_TITLE << " " << '"' << tmp.string_value () << '"'; else { warning ("line title must be a string"); plot_buf << " " << GNUPLOT_COMMAND_TITLE << " " << '"' << "line " << plot_line_count << '"'; } } else plot_buf << " " << GNUPLOT_COMMAND_TITLE << " " << '"' << "line " << plot_line_count << '"'; if (style_clause) { int status = style_clause->print (plot_buf); if (status < 0) return -1; } return 0; } void subplot::print_code (ostream& os) { if (plot_data) { os << " "; plot_data->print_code (os); } if (using_clause) using_clause->print_code (os); if (title_clause) title_clause->print_code (os); if (style_clause) style_clause->print_code (os); } int subplot_list::print (int ndim, ostrstream& plot_buf) { int status = 0; for (Pix p = first (); p != 0; next (p)) { subplot *elt = this->operator () (p); plot_line_count++; if (p != first ()) plot_buf << ",\\\n "; status = elt->print (ndim, plot_buf); if (status < 0) break; } return status; } void subplot_list::print_code (ostream& os) { Pix p = first (); while (p) { subplot *elt = this->operator () (p); next (p); if (elt) { elt->print_code (os); if (p) os << ","; } } } char * save_in_tmp_file (tree_constant& t, int ndim, int parametric) { char *name = octave_tmp_file_name (); if (name) { ofstream file (name); if (file) { switch (ndim) { case 2: save_ascii_data (file, t, 0, 1); break; case 3: save_three_d (file, t, parametric); break; default: gripe_2_or_3_dim_plot (); break; } } else { error ("couldn't open temporary output file `%s'", name); name = 0; } } return name; } void mark_for_deletion (const char *filename) { char *tmp = strsave (filename); tmp_files.push (tmp); } void cleanup_tmp_files (void) { while (! tmp_files.empty ()) { char *filename = tmp_files.pop (); unlink (filename); delete [] filename; } } void close_plot_stream (void) { if (plot_stream.is_open ()) plot_stream.close (); plot_line_count = 0; } DEFUN ("clearplot", Fclearplot, Sclearplot, 0, 0, "clearplot (): clear the plot window") { Octave_object retval; send_to_plot_stream ("clear\n"); // XXX FIXME XXX -- instead of just clearing these things, it would be // nice if we could reset things to a user-specified default state. send_to_plot_stream ("set title\n"); send_to_plot_stream ("set xlabel\n"); send_to_plot_stream ("set ylabel\n"); send_to_plot_stream ("set nogrid\n"); send_to_plot_stream ("set nolabel\n"); // This makes a simple `replot' not work after a `clearplot' command // has been issued. plot_line_count = 0; return retval; } DEFALIAS (clg, clearplot); DEFUN ("closeplot", Fcloseplot, Scloseplot, 0, 0, "closeplot (): close the stream to plotter") { Octave_object retval; close_plot_stream (); return retval; } DEFUN_TEXT ("hold", Fhold, Shold, 1, 0, "hold [on|off]\n\ \n\ determine whether the plot window is cleared before the next line is\n\ drawn. With no argument, toggle the current state.") { Octave_object retval; DEFINE_ARGV("hold"); switch (argc) { case 1: clear_before_plotting = ! clear_before_plotting; break; case 2: if (strcasecmp (argv[1], "on") == 0) clear_before_plotting = 0; else if (strcasecmp (argv[1], "off") == 0) clear_before_plotting = 1; else print_usage ("hold"); break; default: print_usage ("hold"); break; } DELETE_ARGV; return retval; } DEFUN ("ishold", Fishold, Sishold, 0, 1, "ishold\n\ \n\ Return 1 if hold is on, otherwise return 0.") { return (double) (! clear_before_plotting); } DEFUN ("purge_tmp_files", Fpurge_tmp_files, Spurge_tmp_files, 0, 0, "delete temporary data files used for plotting") { Octave_object retval; cleanup_tmp_files (); return retval; } DEFUN_TEXT ("set", Fset, Sset, -1, 0, "set [options]\n\ \n\ set plotting options") { Octave_object retval; DEFINE_ARGV("set"); ostrstream plot_buf; if (argc > 1) { if (almost_match ("parametric", argv[1], 3)) parametric_plot = 1; else if (almost_match ("noparametric", argv[1], 5)) parametric_plot = 0; else if (almost_match ("term", argv[1], 1)) { delete [] gnuplot_terminal_type; ostrstream buf; for (int i = 2; i < argc; i++) buf << argv[i] << " "; buf << "\n" << ends; gnuplot_terminal_type = buf.str (); } } for (int i = 0; i < argc; i++) plot_buf << argv[i] << " "; plot_buf << "\n" << ends; char *plot_command = plot_buf.str (); send_to_plot_stream (plot_command); delete [] plot_command; DELETE_ARGV; return retval; } DEFUN_TEXT ("show", Fshow, Sshow, -1, 0, "show [options]\n\ \n\ show plotting options") { Octave_object retval; DEFINE_ARGV("show"); ostrstream plot_buf; for (int i = 0; i < argc; i++) plot_buf << argv[i] << " "; plot_buf << "\n" << ends; char *plot_command = plot_buf.str (); send_to_plot_stream (plot_command); delete [] plot_command; DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/unwind-prot.cc100666 415 17 13100 5702416774 14552 0ustar jweusers// unwind-prot.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "SLStack.h" #include "CMatrix.h" #include "unwind-prot.h" #include "error.h" #include "utils.h" unwind_elem::unwind_elem (void) { unwind_elem_tag = 0; unwind_elem_fptr = 0; unwind_elem_ptr = 0; } unwind_elem::unwind_elem (char *t) { unwind_elem_tag = strsave (t); unwind_elem_fptr = 0; unwind_elem_ptr = 0; } unwind_elem::unwind_elem (cleanup_func f, void *p) { unwind_elem_tag = 0; unwind_elem_fptr = f; unwind_elem_ptr = p; } unwind_elem::unwind_elem (const unwind_elem& el) { unwind_elem_tag = strsave (el.unwind_elem_tag); unwind_elem_fptr = el.unwind_elem_fptr; unwind_elem_ptr = el.unwind_elem_ptr; } unwind_elem::~unwind_elem (void) { delete [] unwind_elem_tag; } unwind_elem& unwind_elem::operator = (const unwind_elem& el) { unwind_elem_tag = strsave (el.unwind_elem_tag); unwind_elem_fptr = el.unwind_elem_fptr; unwind_elem_ptr = el.unwind_elem_ptr; return *this; } char * unwind_elem::tag (void) { return unwind_elem_tag; } cleanup_func unwind_elem::fptr (void) { return unwind_elem_fptr; } void * unwind_elem::ptr (void) { return unwind_elem_ptr; } static SLStack unwind_protect_list; void add_unwind_protect (cleanup_func fptr, void *ptr) { unwind_elem el (fptr, ptr); unwind_protect_list.push (el); } void run_unwind_protect (void) { unwind_elem el = unwind_protect_list.pop (); cleanup_func f = el.fptr (); if (f) f (el.ptr ()); } void discard_unwind_protect (void) { unwind_protect_list.pop (); } void begin_unwind_frame (char *tag) { unwind_elem elem (tag); unwind_protect_list.push (elem); } void run_unwind_frame (char *tag) { while (! unwind_protect_list.empty ()) { unwind_elem el = unwind_protect_list.pop (); cleanup_func f = el.fptr (); if (f) f (el.ptr ()); char *t = el.tag (); if (t && strcmp (t, tag) == 0) break; } } void discard_unwind_frame (char *tag) { while (! unwind_protect_list.empty ()) { unwind_elem el = unwind_protect_list.pop (); char *t = el.tag (); if (t && strcmp (t, tag) == 0) break; } } void run_all_unwind_protects (void) { while (! unwind_protect_list.empty ()) { unwind_elem el = unwind_protect_list.pop (); cleanup_func f = el.fptr (); if (f) f (el.ptr ()); } } void discard_all_unwind_protects (void) { unwind_protect_list.clear (); } void matrix_cleanup (void *m) { delete [] (double *) m; } void complex_matrix_cleanup (void *cm) { delete [] (ComplexMatrix *) cm; } class saved_variable { public: enum var_type { integer, generic_ptr, generic }; saved_variable (void); saved_variable (int *p, int v); saved_variable (void **p, void *v); saved_variable (void *p, void *v, size_t sz); ~saved_variable (void); void restore_value (void); private: union { int *ptr_to_int; void *gen_ptr; void **ptr_to_gen_ptr; }; union { int int_value; void *gen_ptr_value; }; var_type type_tag; size_t size; }; saved_variable::saved_variable (void) { gen_ptr = 0; gen_ptr_value = 0; type_tag = generic; size = 0; } saved_variable::saved_variable (int *p, int v) { type_tag = integer; ptr_to_int = p; int_value = v; size = sizeof (int); } saved_variable::saved_variable (void **p, void *v) { type_tag = generic_ptr; ptr_to_gen_ptr = p; gen_ptr_value = v; size = sizeof (void *); } saved_variable::saved_variable (void *p, void *v, size_t sz) { gen_ptr = v; gen_ptr_value = new char [sz]; memcpy (gen_ptr_value, v, sz); size = sz; } saved_variable::~saved_variable (void) { if (type_tag == generic) delete [] gen_ptr_value; } void saved_variable::restore_value (void) { switch (type_tag) { case integer: *ptr_to_int = int_value; break; case generic_ptr: *ptr_to_gen_ptr = gen_ptr_value; break; case generic: memcpy (gen_ptr, gen_ptr_value, size); break; default: panic_impossible (); break; } } static void restore_saved_variable (void *s) { saved_variable *sv = (saved_variable *) s; sv->restore_value (); delete sv; } void unwind_protect_int_internal (int *ptr, int value) { saved_variable *s = new saved_variable (ptr, value); add_unwind_protect (restore_saved_variable, (void *) s); } void unwind_protect_ptr_internal (void **ptr, void *value) { saved_variable *s = new saved_variable (ptr, value); add_unwind_protect (restore_saved_variable, (void *) s); } void unwind_protect_var_internal (void *ptr, void *value, size_t size) { saved_variable *s = new saved_variable (ptr, value, size); add_unwind_protect (restore_saved_variable, (void *) s); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/user-prefs.cc100666 415 17 33040 5702416772 14362 0ustar jweusers// user-prefs.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "user-prefs.h" #include "error.h" #include "variables.h" #include "utils.h" // The list of user preferences. Values change when global variables // change, so we don\'t have to do a variable look up every time we // need to check a preference. user_preferences user_pref; // Initialize global user_pref structure. void init_user_prefs (void) { user_pref.automatic_replot = 0; user_pref.whitespace_in_literal_matrix = 0; user_pref.do_fortran_indexing = 0; user_pref.empty_list_elements_ok = 0; user_pref.ignore_function_time_stamp = 0; user_pref.implicit_str_to_num_ok = 0; user_pref.ok_to_lose_imaginary_part = 0; user_pref.output_max_field_width = 0; user_pref.output_precision = 0; user_pref.page_screen_output = 0; user_pref.prefer_column_vectors = 0; user_pref.prefer_zero_one_indexing = 0; user_pref.print_answer_id_name = 0; user_pref.print_empty_dimensions = 0; user_pref.propagate_empty_matrices = 0; user_pref.resize_on_range_error = 0; user_pref.return_last_computed_value = 0; user_pref.save_precision = 0; user_pref.silent_functions = 0; user_pref.split_long_rows = 0; user_pref.treat_neg_dim_as_zero = 0; user_pref.warn_assign_as_truth_value = 0; user_pref.warn_comma_in_global_decl = 0; user_pref.warn_divide_by_zero = 0; user_pref.default_save_format = 0; user_pref.editor = 0; user_pref.gnuplot_binary = 0; user_pref.imagepath = 0; user_pref.info_file = 0; user_pref.loadpath = 0; user_pref.pager_binary = 0; user_pref.ps1 = 0; user_pref.ps2 = 0; user_pref.pwd = 0; } // Check the value of a string variable to see if it it's ok to do // something. // // return of 1 => always ok. // return of 0 => never ok. // return of -1 => ok, but give me warning (default). static int check_str_pref (char *var) { char *val = builtin_string_variable (var); int pref = -1; if (val) { if (strncmp (val, "yes", 3) == 0 || strncmp (val, "true", 4) == 0) pref = 1; else if (strncmp (val, "never", 5) == 0 || strncmp (val, "no", 2) == 0 || strncmp (val, "false", 5) == 0) pref = 0; } return pref; } // Should a replot command be generated automatically each time a plot // changes in some way? int automatic_replot (void) { user_pref.automatic_replot = check_str_pref ("automatic_replot"); return 0; } // Should whitespace in a literal matrix list be automatically // converted to commas and semicolons? // // user specifies value of pref // -------------- ------------- // "ignore" 2 // "traditional" 1 // anything else 0 // // Octave will never insert a comma in a literal matrix list if the // user specifies "ignore". For example, the statement [1 2] will // result in an error instead of being treated the same as [1, 2], and // the statement // // [ 1, 2, // 3, 4 ] // // will result in the vector [1 2 3 4] instead of a matrix. // // Traditional behavior makes Octave convert spaces to a comma between // identifiers and `('. For example, the statement // // [eye (2)] // // will be parsed as // // [eye, (2)] // // and will result in an error since the `eye' function will be // called with no arguments. To get around this, you would have to // omit the space between `eye' and the `('. // // The default value is 0, which results in behavior that is the same // as traditional, except that Octave does not convert spaces to a // comma between identifiers and `('. For example, the statement // // [eye (2)] // // will result in a call to `eye' with the argument `2'. int whitespace_in_literal_matrix (void) { int pref = 0; char *val = builtin_string_variable ("whitespace_in_literal_matrix"); if (val) { if (strncmp (val, "ignore", 6) == 0) pref = 2; else if (strncmp (val, "traditional", 11) == 0) pref = 1; } user_pref.whitespace_in_literal_matrix = pref; return 0; } // Should we allow assignments like: // // octave> A(1) = 3; A(2) = 5 // // for A already defined and a matrix type? int do_fortran_indexing (void) { user_pref.do_fortran_indexing = check_str_pref ("do_fortran_indexing"); return 0; } // Should ignore empty elements in a matrix list (i.e., is an // expression like `[[], 1]' ok? int empty_list_elements_ok (void) { user_pref.empty_list_elements_ok = check_str_pref ("empty_list_elements_ok"); return 0; } // Should Octave always check to see if function files have changed // since they were last compiled? int ignore_function_time_stamp (void) { int pref = 0; char *val = builtin_string_variable ("ignore_function_time_stamp"); if (val) { if (strncmp (val, "all", 3) == 0) pref = 2; if (strncmp (val, "system", 6) == 0) pref = 1; } user_pref.ignore_function_time_stamp = pref; return 0; } // Should we allow things like: // // octave> 'abc' + 0 // 97 98 99 // // to happen? int implicit_str_to_num_ok (void) { user_pref.implicit_str_to_num_ok = check_str_pref ("implicit_str_to_num_ok"); return 0; } // Should we allow silent conversion of complex to real when a real // type is what we\'re really looking for? int ok_to_lose_imaginary_part (void) { user_pref.ok_to_lose_imaginary_part = check_str_pref ("ok_to_lose_imaginary_part"); return 0; } // If possible, send all output intended for the screen through the // pager. int page_screen_output (void) { user_pref.page_screen_output = check_str_pref ("page_screen_output"); return 0; } // When doing assignments like: // // octave> A(1) = 3; A(2) = 5 // // (for A undefined) should we build column vectors? Returning true // only matters when resize_on_range_error is also true. int prefer_column_vectors (void) { user_pref.prefer_column_vectors = check_str_pref ("prefer_column_vectors"); return 0; } // For things like // // a = [2,3]; a([1,1]) // // return [2 3] instead of [2 2]. int prefer_zero_one_indexing (void) { user_pref.prefer_zero_one_indexing = check_str_pref ("prefer_zero_one_indexing"); return 0; } // Should we print things like // // octave> a = [1,2;3,4] // a = // // 1 2 // 3 4 int print_answer_id_name (void) { user_pref.print_answer_id_name = check_str_pref ("print_answer_id_name"); return 0; } // Should we also print the dimensions of empty matrices? int print_empty_dimensions (void) { user_pref.print_empty_dimensions = check_str_pref ("print_empty_dimensions"); return 0; } // Should operations on empty matrices return empty matrices or an // error? int propagate_empty_matrices (void) { user_pref.propagate_empty_matrices = check_str_pref ("propagate_empty_matrices"); return 0; } // When doing assignments, should we resize matrices if the indices // are outside the current bounds? int resize_on_range_error (void) { user_pref.resize_on_range_error = check_str_pref ("resize_on_range_error"); return 0; } // If a function does not return any values explicitly, return the // last computed value. int return_last_computed_value (void) { user_pref.return_last_computed_value = check_str_pref ("return_last_computed_value"); return 0; } // Suppress printing results in called functions. int silent_functions (void) { user_pref.silent_functions = check_str_pref ("silent_functions"); return 0; } // Should should big matrices be split into smaller slices for output? int split_long_rows (void) { user_pref.split_long_rows = check_str_pref ("split_long_rows"); return 0; } // Should things like: // // octave> ones (-1, 5) // // result in an empty matrix or an error? int treat_neg_dim_as_zero (void) { user_pref.treat_neg_dim_as_zero = check_str_pref ("treat_neg_dim_as_zero"); return 0; } // Generate a warning for the assignment in things like // // octave> if (a = 2 < n) // // but not // // octave> if ((a = 2) < n) int warn_assign_as_truth_value (void) { user_pref.warn_assign_as_truth_value = check_str_pref ("warn_assign_as_truth_value"); return 0; } // Generate a warning for the comma in things like // // octave> global a, b = 2 int warn_comma_in_global_decl (void) { user_pref.warn_comma_in_global_decl = check_str_pref ("warn_comma_in_global_decl"); return 0; } // On IEEE machines, allow divide by zero errors to be suppressed. int warn_divide_by_zero (void) { user_pref.warn_divide_by_zero = check_str_pref ("warn_divide_by_zero"); return 0; } int set_output_max_field_width (void) { int status = 0; static int kludge = 0; double val; if (builtin_real_scalar_variable ("output_max_field_width", val) == 0) { int ival = NINT (val); if (ival > 0 && (double) ival == val) { user_pref.output_max_field_width= ival; return status; } } if (kludge == 0) kludge++; else { warning ("invalid value specified for output_max_field_width"); status = -1; } return status; } int set_output_precision (void) { int status = 0; static int kludge = 0; double val; if (builtin_real_scalar_variable ("output_precision", val) == 0) { int ival = NINT (val); if (ival >= 0 && (double) ival == val) { user_pref.output_precision = ival; return status; } } if (kludge == 0) kludge++; else { warning ("invalid value specified for output_precision"); status = -1; } return status; } int set_save_precision (void) { int status = 0; static int kludge = 0; double val; if (builtin_real_scalar_variable ("save_precision", val) == 0) { int ival = NINT (val); if (ival >= 0 && (double) ival == val) { user_pref.save_precision = ival; return status; } } if (kludge == 0) kludge++; else { warning ("invalid value specified for save_precision"); status = -1; } return status; } int sv_editor (void) { int status = 0; char *s = builtin_string_variable ("EDITOR"); if (s) { delete [] user_pref.editor; user_pref.editor = s; } else { warning ("invalid value specified for EDITOR"); status = -1; } return status; } int sv_default_save_format (void) { int status = 0; char *s = builtin_string_variable ("default_save_format"); if (s) { delete [] user_pref.default_save_format; user_pref.default_save_format = s; } else { warning ("invalid value specified for default_save_format"); status = -1; } return status; } int sv_gnuplot_binary (void) { int status = 0; char *s = builtin_string_variable ("gnuplot_binary"); if (s) { delete [] user_pref.gnuplot_binary; user_pref.gnuplot_binary = s; } else { warning ("invalid value specified for gnuplot_binary"); status = -1; } return status; } int sv_imagepath (void) { int status = 0; char *s = builtin_string_variable ("IMAGEPATH"); if (s) { delete [] user_pref.imagepath; user_pref.imagepath = s; } else { warning ("invalid value specified for IMAGEPATH"); status = -1; } return status; } int sv_info_file (void) { int status = 0; char *s = builtin_string_variable ("INFO_FILE"); if (s) { delete [] user_pref.info_file; user_pref.info_file = s; } else { warning ("invalid value specified for INFO_FILE"); status = -1; } return status; } int sv_loadpath (void) { int status = 0; char *s = builtin_string_variable ("LOADPATH"); if (s) { delete [] user_pref.loadpath; user_pref.loadpath = s; } else { warning ("invalid value specified for LOADPATH"); status = -1; } return status; } int sv_pager_binary (void) { int status = 0; char *s = builtin_string_variable ("PAGER"); if (s) { delete [] user_pref.pager_binary; user_pref.pager_binary = s; } else { warning ("invalid value specified for PAGER"); status = -1; } return status; } int sv_ps1 (void) { int status = 0; char *s = builtin_string_variable ("PS1"); if (s) { delete [] user_pref.ps1; user_pref.ps1 = s; } else { warning ("invalid value specified for PS1"); status = -1; } return status; } int sv_ps2 (void) { int status = 0; char *s = builtin_string_variable ("PS2"); if (s) { delete [] user_pref.ps2; user_pref.ps2 = s; } else { warning ("invalid value specified for PS2"); status = -1; } return status; } int sv_pwd (void) { int status = 0; char *s = builtin_string_variable ("PWD"); if (s) { delete [] user_pref.pwd; user_pref.pwd = s; } else { warning ("invalid value specified for PWD"); status = -1; } return status; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/utils.cc100666 415 17 35640 5704644075 13440 0ustar jweusers// utils.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include #include #include #include extern "C" { #include #ifndef HAVE_STRNCASECMP extern int strncasecmp (const char*, const char*, size_t); #endif #define boolean kpathsea_boolean #define false kpathsea_false #define true kpathsea_true #include #if defined (HAVE_TERMIOS_H) #include #elif defined (HAVE_TERMIO_H) #include #elif defined (HAVE_SGTTY_H) #include #else LOSE! LOSE! #endif #include } // This mess suggested by the autoconf manual. // unistd.h defines _POSIX_VERSION on POSIX.1 systems. #if defined (HAVE_DIRENT_H) || defined (_POSIX_VERSION) #include #define NLENGTH(dirent) (strlen((dirent)->d_name)) #else #define dirent direct #define NLENGTH(dirent) ((dirent)->d_namlen) #if defined (HAVE_SYS_NDIR_H) #include #endif #if defined (HAVE_SYS_DIR_H) #include #endif #if defined (HAVE_NDIR_H) #include #endif #endif #include "SLStack.h" #include "procstream.h" #include "user-prefs.h" #include "variables.h" #include "dirfns.h" #include "defun.h" #include "error.h" #include "help.h" #include "gripes.h" #include "pager.h" #include "utils.h" #include "input.h" #include "octave.h" #include "oct-obj.h" #include "mappers.h" #include "tree-const.h" #include "unwind-prot.h" #include "octave-hist.h" // Top level context (?) extern jmp_buf toplevel; // Save a string. char * strsave (const char *s) { if (! s) return 0; int len = strlen (s); char *tmp = new char [len+1]; tmp = strcpy (tmp, s); return tmp; } // Concatenate two strings. char * strconcat (const char *s, const char *t) { int len = strlen (s) + strlen (t); char *tmp = new char [len+1]; strcpy (tmp, s); return strcat (tmp, t); } // Throw away input until a given character is read. void discard_until (istream& stream, char character) { int c; for (;;) { stream >> c; if (c == EOF || c == character) break; } if (c != EOF) stream.putback ((char) c); } #if 0 // XXX UNTESTED XXX // Read input until a given character is read. Returns characters // read in a new string that must be freed by the caller. char * read_until (istream& stream, char character) { int grow_size = 8; int limit = grow_size; char *buf = new char [limit]; char *bp = buf; get_more: is.getline (bp, limit, character); if (is.gcount () == 0) { delete [] buf; return 0; } if (is.gcount () == limit && buf[limit-1] != '\0') { char *tmp = new char [limit + grow_size]; strcpy (tmp, buf); delete [] buf; buf = tmp; bp = tmp + limit - 1; limit += grow_size; grow_size *= 2; goto get_more; } return buf; } #endif // Get a temporary file name. char * octave_tmp_file_name (void) { static char *retval = 0; if (retval) free (retval); retval = tempnam (0, "oct-"); if (! retval) error ("can't open temporary file!"); return retval; } DEFUN ("octave_tmp_file_name", Foctave_tmp_file_name, Soctave_tmp_file_name, 0, 1, "octave_tmp_file_name ()") { tree_constant retval; if (args.length () == 0) retval = octave_tmp_file_name (); else print_usage ("octave_tmp_file_name"); return retval; } char ** pathstring_to_vector (char *pathstring) { static char **path = 0; if (pathstring) { int nelem = 0; char *tmp_path = strsave (pathstring); if (*tmp_path != '\0') { nelem++; char *ptr = tmp_path; while (*ptr != '\0') { if (*ptr == ':') nelem++; ptr++; } } char **foo = path; while (foo && *foo) delete [] *foo++; delete [] path; path = new char * [nelem+1]; path[nelem] = 0; int i = 0; char *ptr = tmp_path; while (i < nelem) { char *end = strchr (ptr, ':'); if (end) *end = '\0'; char *result = tilde_expand (ptr); path[i] = strsave (result); free (result); ptr = end + 1; i++; } delete [] tmp_path; } return path; } // Return to the main command loop in octave.cc. void jump_to_top_level (void) { run_all_unwind_protects (); longjmp (toplevel, 1); } int almost_match (const char *std, const char *s, int min_match_len, int case_sens) { int stdlen = strlen (std); int slen = strlen (s); return (slen <= stdlen && slen >= min_match_len && (case_sens ? (strncmp (std, s, slen) == 0) : (strncasecmp (std, s, slen) == 0))); } // Ugh. int keyword_almost_match (const char **std, int *min_len, const char *s, int min_toks_to_match, int max_toks) { int status = 0; int tok_count = 0; int toks_matched = 0; if (! s || *s == '\0' || max_toks < 1) return status; char *kw = strsave (s); char *t = kw; while (*t != '\0') { if (*t == '\t') *t = ' '; t++; } char *beg = kw; while (*beg == ' ') beg++; if (*beg == '\0') return status; char **to_match = new char * [max_toks + 1]; const char **s1 = std; char **s2 = to_match; if (! s1 || ! s2) goto done; s2[tok_count] = beg; char *end; while ((end = strchr (beg, ' ')) != 0) { *end = '\0'; beg = end + 1; while (*beg == ' ') beg++; if (*beg == '\0') break; tok_count++; if (tok_count >= max_toks) goto done; s2[tok_count] = beg; } s2[tok_count+1] = 0; s2 = to_match; for (;;) { if (! almost_match (*s1, *s2, min_len[toks_matched], 0)) goto done; toks_matched++; s1++; s2++; if (! *s2) { status = (toks_matched >= min_toks_to_match); goto done; } if (! *s1) goto done; } done: delete [] kw; delete [] to_match; return status; } char ** get_fcn_file_names (int& num, const char *dir, int no_suffix) { static int num_max = 256; char **retval = new char * [num_max]; int i = 0; DIR *dirp = opendir (dir); if (dirp) { struct dirent *entry; while ((entry = readdir (dirp)) != 0) { int len = NLENGTH (entry); #ifdef WITH_DLD if ((len > 2 && entry->d_name[len-2] == '.' && entry->d_name[len-1] == 'm') || (len > 4 && entry->d_name[len-4] == '.' && entry->d_name[len-3] == 'o' && entry->d_name[len-2] == 'c' && entry->d_name[len-1] == 't')) #else if (len > 2 && entry->d_name[len-2] == '.' && entry->d_name[len-1] == 'm') #endif { retval[i] = strsave (entry->d_name); if (no_suffix) { if (retval[i][len-1] == 'm') retval[i][len-2] = '\0'; else retval[i][len-4] = '\0'; } i++; if (i == num_max - 1) { // Reallocate the array. Only copy pointers, not the strings they // point to, then only delete the original array of pointers, and not // the strings they point to. num_max += 256; char **tmp = new char * [num_max]; for (int j = 0; j < i; j++) tmp[j] = retval[j]; delete [] retval; retval = tmp; } } } closedir (dirp); } retval[i] = 0; num = i; return retval; } char ** get_fcn_file_names (int& num, int no_suffix) { static int num_max = 1024; char **retval = new char * [num_max]; int i = 0; char *path_elt = kpse_path_element (user_pref.loadpath); while (path_elt) { str_llist_type *elt_dirs = kpse_element_dirs (path_elt); str_llist_elt_type *dir; for (dir = *elt_dirs; dir; dir = STR_LLIST_NEXT (*dir)) { char *elt_dir = STR_LLIST (*dir); if (elt_dir) { int tmp_num; char **names = get_fcn_file_names (tmp_num, elt_dir, no_suffix); if (i + tmp_num >= num_max - 1) { // Reallocate the array. Only copy pointers, not the strings they // point to, then only delete the original array of pointers, and not // the strings they point to. num_max += 1024; char **tmp = new char * [num_max]; for (int j = 0; j < i; j++) tmp[j] = retval[j]; delete [] retval; retval = tmp; } int k = 0; while (k < tmp_num) retval[i++] = names[k++]; } } path_elt = kpse_path_element (0); } retval[i] = 0; num = i; return retval; } int NINT (double x) { if (x > INT_MAX) return INT_MAX; else if (x < INT_MIN) return INT_MIN; else return (x > 0) ? ((int) (x + 0.5)) : ((int) (x - 0.5)); } double D_NINT (double x) { if (xisinf (x) || xisnan (x)) return x; else return floor (x + 0.5); } // XXX FIXME XXX -- put these in some file, and make them extern. static int all_strings (const Octave_object& args) { int n = args.length (); for (int i = 0; i < n; i++) if (! args(i).is_string ()) return 0; return 1; } char ** make_argv (const Octave_object& args, const char *fcn_name) { char **argv = 0; if (all_strings (args)) { int n = args.length (); argv = new char * [n + 1]; argv[0] = strsave (fcn_name); for (int i = 0; i < n; i++) argv[i+1] = strsave (args(i).string_value ()); } else error ("%s: expecting all arguments to be strings", fcn_name); return argv; } // Return non-zero if either NR or NC is zero. Return -1 if this // should be considered fatal; return 1 if this is ok. int empty_arg (const char *name, int nr, int nc) { int is_empty = 0; if (nr == 0 || nc == 0) { int flag = user_pref.propagate_empty_matrices; if (flag < 0) { gripe_empty_arg (name, 0); is_empty = 1; } else if (flag == 0) { gripe_empty_arg (name, 1); is_empty = -1; } else is_empty = 1; } return is_empty; } // Format a list in neat columns. Mostly stolen from GNU ls. This // should maybe be in utils.cc. ostrstream& list_in_columns (ostrstream& os, char **list) { // Compute the maximum name length. int max_name_length = 0; int total_names = 0; for (char **names = list; *names; names++) { total_names++; int name_length = strlen (*names); if (name_length > max_name_length) max_name_length = name_length; } // Allow at least two spaces between names. max_name_length += 2; // Calculate the maximum number of columns that will fit. int line_length = terminal_columns (); int cols = line_length / max_name_length; if (cols == 0) cols = 1; // Calculate the number of rows that will be in each column except // possibly for a short column on the right. int rows = total_names / cols + (total_names % cols != 0); // Recalculate columns based on rows. cols = total_names / rows + (total_names % rows != 0); names = list; int count; for (int row = 0; row < rows; row++) { count = row; int pos = 0; // Print the next row. while (1) { os << *(names + count); int name_length = strlen (*(names + count)); count += rows; if (count >= total_names) break; int spaces_to_pad = max_name_length - name_length; for (int i = 0; i < spaces_to_pad; i++) os << " "; pos += max_name_length; } os << "\n"; } return os; } // See if the given file is in the path. char * search_path_for_file (const char *path, const char *name) { char *retval = 0; char *tmp = kpse_path_search (path, name, kpathsea_true); if (tmp) { retval = make_absolute (tmp, the_current_working_directory); free (tmp); } return retval; } DEFUN ("file_in_path", Ffile_in_path, Sfile_in_path, 3, 1, "file_in_path (PATH, NAME)") { Octave_object retval; DEFINE_ARGV("file_in_path"); if (argc == 3) { char *fname = search_path_for_file (argv[1], argv[2]); if (fname) retval = fname; else retval = Matrix (); } else print_usage ("file_in_path"); DELETE_ARGV; return retval; } char * file_in_path (const char *name, const char *suffix) { char *retval = 0; char *nm = strsave (name); if (suffix) { char *tmp = nm; nm = strconcat (tmp, suffix); delete [] tmp; } if (! the_current_working_directory) get_working_directory ("file_in_path"); retval = search_path_for_file (user_pref.loadpath, nm); delete [] nm; return retval; } // See if there is an function file in the path. If so, return the // full path to the file. char * fcn_file_in_path (const char *name) { if (name) { int len = strlen (name); if (name [len - 2] == '.' && name [len - 1] == 'm') return file_in_path (name, ""); else return file_in_path (name, ".m"); } else return 0; } // See if there is an octave file in the path. If so, return the // full path to the file. char * oct_file_in_path (const char *name) { if (name) { int len = strlen (name); if (name [len - 4] == '.' && name [len - 3] == 'o' && name [len - 2] == 'c' && name [len - 1] == 't') return file_in_path (name, ""); else return file_in_path (name, ".oct"); } else return 0; } char * undo_string_escape (char c) { static char retval[2]; retval[1] = '\0'; if (! c) return 0; switch (c) { case '\a': return "\\a"; case '\b': // backspace return "\\b"; case '\f': // formfeed return "\\f"; case '\n': // newline return "\\n"; case '\r': // carriage return return "\\r"; case '\t': // horizontal tab return "\\t"; case '\v': // vertical tab return "\\v"; case '\\': // backslash return "\\\\"; case '"': // double quote return "\\\""; default: retval[0] = c; return retval; } } char * undo_string_escapes (char *s) { ostrstream buf; char *t; while (t = undo_string_escape (*s++)) buf << t; buf << ends; return buf.str (); } DEFUN ("undo_string_escapes", Fundo_string_escapes, Sundo_string_escapes, 1, 1, "undo_string_escapes (STRING)") { tree_constant retval; int nargin = args.length (); if (nargin == 1 && args(0).is_string ()) { char *str = undo_string_escapes (args(0).string_value ()); retval = str; delete [] str; } else print_usage ("undo_string_escapes"); return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/variables.cc100666 415 17 117244 5702416767 14274 0ustar jweusers// variables.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #if 0 #include #include #include "mappers.h" #endif #include #ifdef HAVE_UNISTD_H #include #endif #include #include #include #include "defaults.h" #include "version.h" #include "dynamic-ld.h" #include "octave-hist.h" #include "unwind-prot.h" #include "variables.h" #include "user-prefs.h" #include "statdefs.h" #include "tree-base.h" #include "tree-expr.h" #include "tree-const.h" #include "dirfns.h" #include "oct-obj.h" #include "sysdep.h" #include "symtab.h" #include "octave.h" #include "pager.h" #include "error.h" #include "defun.h" #include "utils.h" #include "parse.h" #include "input.h" #include "help.h" #include "lex.h" extern "C" { #include #include "fnmatch.h" } // Symbol table for symbols at the top level. symbol_table *top_level_sym_tab = 0; // Symbol table for the current scope. symbol_table *curr_sym_tab = 0; // Symbol table for global symbols. symbol_table *global_sym_tab = 0; // Initialization. // Create the initial symbol tables and set the current scope at the // top level. void initialize_symbol_tables (void) { if (! global_sym_tab) global_sym_tab = new symbol_table (); if (! top_level_sym_tab) top_level_sym_tab = new symbol_table (); curr_sym_tab = top_level_sym_tab; } // Attributes of variables and functions. // Is this variable a builtin? int is_builtin_variable (const char *name) { symbol_record *sr = global_sym_tab->lookup (name, 0, 0); return (sr && sr->is_builtin_variable ()); } // Is this a text-style function? int is_text_function_name (const char *s) { symbol_record *sr = global_sym_tab->lookup (s); return (sr && sr->is_text_function ()); } // Is this function globally in this scope? int is_globally_visible (const char *name) { symbol_record *sr = curr_sym_tab->lookup (name, 0, 0); return (sr && sr->is_linked_to_global ()); } // Is this tree_constant a valid function? tree_fvc * is_valid_function (const tree_constant& arg, char *warn_for, int warn) { tree_fvc *ans = 0; char *fcn_name = arg.string_value (); if (error_state) { if (warn) error ("%s: expecting function name as argument", warn_for); return ans; } symbol_record *sr = 0; if (fcn_name) sr = lookup_by_name (fcn_name); if (sr) ans = sr->def (); if (! sr || ! ans || ! sr->is_function ()) { if (warn) error ("%s: the symbol `%s' is not valid as a function", warn_for, fcn_name); ans = 0; } return ans; } // Does this function take the right number of arguments? int takes_correct_nargs (tree_fvc *fcn, int expected_nargin, char *warn_for, int warn) { int nargin = fcn->max_expected_args (); int e_nargin = expected_nargin; if (nargin != e_nargin) { if (warn) error ("%s: expecting function to take %d argument%s", warn_for, e_nargin, (e_nargin == 1 ? "" : "s")); return 0; } return 1; } DEFUN ("is_global", Fis_global, Sis_global, 1, 1, "is_global (X): return 1 if the string X names a global variable\n\ otherwise, return 0.") { Octave_object retval = 0.0; int nargin = args.length (); if (nargin != 1) { print_usage ("is_global"); return retval; } char *name = args(0).string_value (); if (error_state) { error ("is_global: expecting string argument"); return retval; } symbol_record *sr = curr_sym_tab->lookup (name, 0, 0); retval = (double) (sr && sr->is_linked_to_global ()); return retval; } DEFUN ("exist", Fexist, Sexist, 1, 1, "exist (NAME): check if variable or file exists\n\ \n\ return 0 if NAME is undefined, 1 if it is a variable, or 2 if it is\n\ a function.") { Octave_object retval; int nargin = args.length (); if (nargin != 1) { print_usage ("exist"); return retval; } char *name = args(0).string_value (); if (error_state) { error ("exist: expecting string argument"); return retval; } symbol_record *sr = curr_sym_tab->lookup (name, 0, 0); if (! sr) sr = global_sym_tab->lookup (name, 0, 0); retval = 0.0; if (sr && sr->is_variable () && sr->is_defined ()) retval = 1.0; else if (sr && sr->is_function ()) retval = 2.0; else { char *path = fcn_file_in_path (name); if (path) { delete [] path; retval = 2.0; } else { struct stat buf; if (stat (name, &buf) == 0 && S_ISREG (buf.st_mode)) retval = 2.0; } } return retval; } // XXX FIXME XXX -- should these really be here? static char * octave_home (void) { char *oh = getenv ("OCTAVE_HOME"); return (oh ? oh : OCTAVE_PREFIX); } static char * subst_octave_home (char *s) { char *home = octave_home (); char *prefix = OCTAVE_PREFIX; char *retval; if (strcmp (home, prefix) == 0) retval = strsave (s); else { int len_home = strlen (home); int len_prefix = strlen (prefix); int count = 0; char *ptr = s; char *next = 0; while ((next = strstr (ptr, prefix))) { ptr = next + len_prefix; count++; } int grow_size = count * (len_home - len_prefix); int len_s = strlen (s); int len_retval = len_s + count * grow_size; retval = new char [len_retval+1]; char *p1 = s; char *p2 = p1; char *pdest = retval; // Is this really a good way to do this? while (count >= 0) { p2 = strstr (p1, prefix); if (! p2) { memcpy (pdest, p1, strlen (p1)+1); break; } else if (p1 == p2) { memcpy (pdest, home, len_home); pdest += len_home; p1 += len_prefix; count--; } else { int len = (int) (p2 - p1); memcpy (pdest, p1, len); pdest += len; p1 += len; } } } return retval; } static char * octave_info_dir (void) { static char *retval = subst_octave_home (OCTAVE_INFODIR); return retval; } char * octave_arch_lib_dir (void) { static char *retval = subst_octave_home (OCTAVE_ARCHLIBDIR); return retval; } char * octave_bin_dir (void) { static char *retval = subst_octave_home (OCTAVE_BINDIR); return retval; } static char * default_pager (void) { static char *pager_binary = 0; delete [] pager_binary; char *pgr = getenv ("PAGER"); if (pgr) pager_binary = strsave (pgr); else #ifdef DEFAULT_PAGER pager_binary = strsave (DEFAULT_PAGER); #else pager_binary = strsave (""); #endif return pager_binary; } char * octave_lib_dir (void) { static char *retval = subst_octave_home (OCTAVE_LIBDIR); return retval; } // Handle OCTAVE_PATH from the environment like TeX handles TEXINPUTS. // If the path starts with `:', prepend the standard path. If it ends // with `:' append the standard path. If it begins and ends with // `:', do both (which is useless, but the luser asked for it...). // // This function may eventually be called more than once, so be // careful not to create memory leaks. char * default_path (void) { static char *pathstring = 0; delete [] pathstring; static char *std_path = subst_octave_home (OCTAVE_FCNFILEPATH); char *oct_path = getenv ("OCTAVE_PATH"); if (oct_path) { pathstring = strsave (oct_path); if (pathstring[0] == ':') { char *tmp = pathstring; pathstring = strconcat (std_path, pathstring); delete [] tmp; } int tmp_len = strlen (pathstring); if (pathstring[tmp_len-1] == ':') { char *tmp = pathstring; pathstring = strconcat (pathstring, std_path); delete [] tmp; } } else pathstring = strsave (std_path); return pathstring; } char * default_info_file (void) { static char *info_file_string = 0; delete [] info_file_string; char *oct_info_file = getenv ("OCTAVE_INFO_FILE"); if (oct_info_file) info_file_string = strsave (oct_info_file); else { char *infodir = octave_info_dir (); info_file_string = strconcat (infodir, "/octave.info"); } return info_file_string; } char * default_editor (void) { static char *editor_string = 0; delete [] editor_string; char *env_editor = getenv ("EDITOR"); if (env_editor && *env_editor) editor_string = strsave (env_editor); else editor_string = strsave ("vi"); return editor_string; } char * get_site_defaults (void) { static char *startupdir = subst_octave_home (OCTAVE_STARTUPFILEDIR); static char *sd = strconcat (startupdir, "/octaverc"); return sd; } // Functions for looking up variables and functions. // Is there a corresponding function file that is newer than the // symbol definition? static int symbol_out_of_date (symbol_record *sr) { int ignore = user_pref.ignore_function_time_stamp; if (ignore == 2) return 0; if (sr) { tree_fvc *ans = sr->def (); if (ans) { char *ff = ans->fcn_file_name (); if (ff && ! (ignore && ans->is_system_fcn_file ())) { time_t tp = ans->time_parsed (); char *fname = fcn_file_in_path (ff); int status = is_newer (fname, tp); delete [] fname; if (status > 0) return 1; } } } return 0; } static int looks_like_octave_copyright (char *s) { if (s && strncmp (s, " Copyright (C) ", 15) == 0) { s = strchr (s, '\n'); if (s) { s++; s = strchr (s, '\n'); if (s) { s++; if (strncmp (s, " This file is part of Octave.", 29) == 0) return 1; } } } return 0; } static char * gobble_leading_white_space (FILE *ffile) { ostrstream buf; int first_comments_seen = 0; int have_help_text = 0; int in_comment = 0; int c; while ((c = getc (ffile)) != EOF) { current_input_column++; if (in_comment) { if (! have_help_text) { first_comments_seen = 1; buf << (char) c; } if (c == '\n') { input_line_number++; current_input_column = 0; in_comment = 0; } } else { switch (c) { case ' ': case '\t': if (first_comments_seen) have_help_text = 1; break; case '\n': if (first_comments_seen) have_help_text = 1; input_line_number++; current_input_column = 0; continue; case '%': case '#': in_comment = 1; break; default: current_input_column--; ungetc (c, ffile); goto done; } } } done: buf << ends; char *help_txt = buf.str (); if (! help_txt || ! *help_txt || looks_like_octave_copyright (help_txt)) { delete help_txt; help_txt = 0; } return help_txt; } static int is_function_file (FILE *ffile) { int status = 0; long pos = ftell (ffile); char buf [10]; fgets (buf, 10, ffile); int len = strlen (buf); if (len > 8 && strncmp (buf, "function", 8) == 0 && ! (isalnum (buf[8]) || buf[8] == '_')) status = 1; fseek (ffile, pos, SEEK_SET); return status; } static int parse_fcn_file (int exec_script, char *ff) { begin_unwind_frame ("parse_fcn_file"); int script_file_executed = 0; assert (ff); // Open function file and parse. int old_reading_fcn_file_state = reading_fcn_file; unwind_protect_ptr (rl_instream); unwind_protect_ptr (ff_instream); unwind_protect_int (using_readline); unwind_protect_int (input_line_number); unwind_protect_int (current_input_column); unwind_protect_int (reading_fcn_file); using_readline = 0; reading_fcn_file = 1; input_line_number = 0; current_input_column = 1; FILE *ffile = get_input_from_file (ff, 0); if (ffile) { // Check to see if this file defines a function or is just a list of // commands. char *tmp_help_txt = gobble_leading_white_space (ffile); if (is_function_file (ffile)) { unwind_protect_int (echo_input); unwind_protect_int (saving_history); unwind_protect_int (reading_fcn_file); echo_input = 0; saving_history = 0; reading_fcn_file = 1; YY_BUFFER_STATE old_buf = current_buffer (); YY_BUFFER_STATE new_buf = create_buffer (ffile); add_unwind_protect (restore_input_buffer, (void *) old_buf); add_unwind_protect (delete_input_buffer, (void *) new_buf); switch_to_buffer (new_buf); unwind_protect_ptr (curr_sym_tab); reset_parser (); delete [] help_buf; help_buf = tmp_help_txt; int status = yyparse (); if (status != 0) { error ("parse error while reading function file %s", ff); global_sym_tab->clear (curr_fcn_file_name); } } else if (exec_script) { // The value of `reading_fcn_file' will be restored to the proper value // when we unwind from this frame. reading_fcn_file = old_reading_fcn_file_state; unwind_protect_int (reading_script_file); reading_script_file = 1; parse_and_execute (ffile, 1); script_file_executed = 1; } fclose (ffile); } run_unwind_frame ("parse_fcn_file"); return script_file_executed; } static int load_fcn_from_file (symbol_record *sym_rec, int exec_script) { int script_file_executed = 0; char *nm = sym_rec->name (); // This is needed by yyparse. curr_fcn_file_name = nm; #ifdef WITH_DLD if (load_octave_oct_file (nm)) { force_link_to_function (nm); } else #endif { char *ff = fcn_file_in_path (nm); if (ff) { script_file_executed = parse_fcn_file (exec_script, ff); delete [] ff; } if (! (error_state || script_file_executed)) force_link_to_function (nm); } return script_file_executed; } int lookup (symbol_record *sym_rec, int exec_script) { int script_file_executed = 0; if (! sym_rec->is_linked_to_global ()) { if (sym_rec->is_defined ()) { if (sym_rec->is_function () && symbol_out_of_date (sym_rec)) script_file_executed = load_fcn_from_file (sym_rec, exec_script); } else if (! sym_rec->is_formal_parameter ()) { link_to_builtin_or_function (sym_rec); if (! sym_rec->is_defined ()) script_file_executed = load_fcn_from_file (sym_rec, exec_script); else if (sym_rec->is_function () && symbol_out_of_date (sym_rec)) script_file_executed = load_fcn_from_file (sym_rec, exec_script); } } return script_file_executed; } // Get the symbol record for the given name that is visible in the // current scope. Reread any function definitions that appear to be // out of date. If a function is available in a file but is not // currently loaded, this will load it and insert the name in the // current symbol table. symbol_record * lookup_by_name (const char *nm, int exec_script) { symbol_record *sym_rec = curr_sym_tab->lookup (nm, 1, 0); lookup (sym_rec, exec_script); return sym_rec; } char * get_help_from_file (const char *path) { if (path && *path) { FILE *fptr = fopen (path, "r"); if (fptr) { char *help_txt = gobble_leading_white_space (fptr); fclose (fptr); return help_txt; } } return 0; } // Variable values. // Look for the given name in the global symbol table. If it refers // to a string, return a new copy. If not, return 0; char * builtin_string_variable (const char *name) { symbol_record *sr = global_sym_tab->lookup (name, 0, 0); // It is a prorgramming error to look for builtins that aren't. assert (sr); char *retval = 0; tree_fvc *defn = sr->def (); if (defn) { tree_constant val = defn->eval (0); if (! error_state && val.is_string ()) { char *s = val.string_value (); if (s) retval = strsave (s); } } return retval; } // Look for the given name in the global symbol table. If it refers // to a real scalar, place the value in d and return 0. Otherwise, // return -1. int builtin_real_scalar_variable (const char *name, double& d) { int status = -1; symbol_record *sr = global_sym_tab->lookup (name, 0, 0); // It is a prorgramming error to look for builtins that aren't. assert (sr); tree_fvc *defn = sr->def (); if (defn) { tree_constant val = defn->eval (0); if (! error_state && val.is_scalar_type ()) { d = val.double_value (); status = 0; } } return status; } // Global stuff and links to builtin variables and functions. // Make the definition of the symbol record sr be the same as the // definition of the global variable of the same name, creating it if // it doesn't already exist. void link_to_global_variable (symbol_record *sr) { if (sr->is_linked_to_global ()) return; symbol_record *gsr = global_sym_tab->lookup (sr->name (), 1, 0); if (sr->is_formal_parameter ()) { error ("can't make function parameter `%s' global", sr->name ()); return; } // There must be a better way to do this. XXX FIXME XXX if (sr->is_variable ()) { // Would be nice not to have this cast. XXX FIXME XXX tree_constant *tmp = (tree_constant *) sr->def (); if (tmp) tmp = new tree_constant (*tmp); else tmp = new tree_constant (); gsr->define (tmp); } else sr->clear (); // If the global symbol is currently defined as a function, we need to // hide it with a variable. if (gsr->is_function ()) gsr->define ((tree_constant *) 0); sr->alias (gsr, 1); sr->mark_as_linked_to_global (); } // Make the definition of the symbol record sr be the same as the // definition of the builtin variable of the same name. void link_to_builtin_variable (symbol_record *sr) { symbol_record *tmp_sym = global_sym_tab->lookup (sr->name (), 0, 0); if (tmp_sym && tmp_sym->is_builtin_variable ()) sr->alias (tmp_sym); } // Make the definition of the symbol record sr be the same as the // definition of the builtin variable or function, or user function of // the same name, provided that the name has not been used as a formal // parameter. void link_to_builtin_or_function (symbol_record *sr) { symbol_record *tmp_sym = global_sym_tab->lookup (sr->name (), 0, 0); if (tmp_sym && (tmp_sym->is_builtin_variable () || tmp_sym->is_function ()) && ! tmp_sym->is_formal_parameter ()) sr->alias (tmp_sym); } // Force a link to a function in the current symbol table. This is // used just after defining a function to avoid different behavior // depending on whether or not the function has been evaluated after // being defined. // // Return without doing anything if there isn't a function with the // given name defined in the global symbol table. void force_link_to_function (const char *id_name) { symbol_record *gsr = global_sym_tab->lookup (id_name, 1, 0); if (gsr->is_function ()) { curr_sym_tab->clear (id_name); symbol_record *csr = curr_sym_tab->lookup (id_name, 1, 0); csr->alias (gsr); } } // Help stuff. Shouldn't this go in help.cc? // It's not likely that this does the right thing now. XXX FIXME XXX char ** make_name_list (void) { int key_len = 0; int glb_len = 0; int top_len = 0; int lcl_len = 0; int ffl_len = 0; char **key = 0; char **glb = 0; char **top = 0; char **lcl = 0; char **ffl = 0; // Each of these functions returns a new vector of pointers to new // strings. key = names (keyword_help (), key_len); glb = global_sym_tab->list (glb_len); top = top_level_sym_tab->list (top_len); if (top_level_sym_tab != curr_sym_tab) lcl = curr_sym_tab->list (lcl_len); ffl = get_fcn_file_names (ffl_len, 1); int total_len = key_len + glb_len + top_len + lcl_len + ffl_len; char **list = new char * [total_len+1]; // Put all the symbols in one big list. Only copy pointers, not the // strings they point to, then only delete the original array of // pointers, and not the strings they point to. int j = 0; int i = 0; for (i = 0; i < key_len; i++) list[j++] = key[i]; for (i = 0; i < glb_len; i++) list[j++] = glb[i]; for (i = 0; i < top_len; i++) list[j++] = top[i]; for (i = 0; i < lcl_len; i++) list[j++] = lcl[i]; for (i = 0; i < ffl_len; i++) list[j++] = ffl[i]; list[j] = 0; delete [] key; delete [] glb; delete [] top; delete [] lcl; delete [] ffl; return list; } // List variable names. static void print_symbol_info_line (ostrstream& output_buf, const symbol_record_info& s) { output_buf << (s.is_read_only () ? " -" : " w"); output_buf << (s.is_eternal () ? "- " : "d "); #if 0 output_buf << (s.hides_fcn () ? "f" : (s.hides_builtin () ? "F" : "-")); #endif output_buf.form (" %-16s", s.type_as_string ()); if (s.is_function ()) output_buf << " - -"; else { output_buf.form ("%7d", s.rows ()); output_buf.form ("%7d", s.columns ()); } output_buf << " " << s.name () << "\n"; } static void print_long_listing (ostrstream& output_buf, symbol_record_info *s) { if (! s) return; symbol_record_info *ptr = s; while (ptr->is_defined ()) { print_symbol_info_line (output_buf, *ptr); ptr++; } } static int maybe_list (const char *header, char **argv, int argc, ostrstream& output_buf, int show_verbose, symbol_table *sym_tab, unsigned type, unsigned scope) { int count; int status = 0; if (show_verbose) { symbol_record_info *symbols; symbols = sym_tab->long_list (count, argv, argc, 1, type, scope); if (symbols && count > 0) { output_buf << "\n" << header << "\n\n" << "prot type rows cols name\n" << "==== ==== ==== ==== ====\n"; print_long_listing (output_buf, symbols); status = 1; } delete [] symbols; } else { char **symbols = sym_tab->list (count, argv, argc, 1, type, scope); if (symbols && count > 0) { output_buf << "\n" << header << "\n\n"; list_in_columns (output_buf, symbols); status = 1; } delete [] symbols; } return status; } DEFUN_TEXT ("document", Fdocument, Sdocument, -1, 1, "document symbol string ...\n\ \n\ Associate a cryptic message with a variable name.") { Octave_object retval; DEFINE_ARGV("document"); if (argc == 3) { char *name = argv[1]; char *help = argv[2]; if (is_builtin_variable (name)) error ("sorry, can't redefine help for builtin variables"); else { symbol_record *sym_rec = curr_sym_tab->lookup (name, 0); if (sym_rec) sym_rec->document (help); else error ("document: no such symbol `%s'", name); } } else print_usage ("document"); DELETE_ARGV; return retval; } // XXX FIXME XXX -- this should take a list of regular expressions // naming the variables to look for. static Octave_object do_who (int argc, char **argv, int nargout) { Octave_object retval; int show_builtins = 0; int show_functions = (curr_sym_tab == top_level_sym_tab); int show_variables = 1; int show_verbose = 0; char *my_name = argv[0]; if (argc > 1) { show_functions = 0; show_variables = 0; } while (--argc > 0) { argv++; if (strcmp (*argv, "-all") == 0 || strcmp (*argv, "-a") == 0) { show_builtins++; show_functions++; show_variables++; } else if (strcmp (*argv, "-builtins") == 0 || strcmp (*argv, "-b") == 0) show_builtins++; else if (strcmp (*argv, "-functions") == 0 || strcmp (*argv, "-f") == 0) show_functions++; else if (strcmp (*argv, "-long") == 0 || strcmp (*argv, "-l") == 0) show_verbose++; else if (strcmp (*argv, "-variables") == 0 || strcmp (*argv, "-v") == 0) show_variables++; else if (*argv[0] == '-') warning ("%s: unrecognized option `%s'", my_name, *argv); else break; } // If the user specified -l and nothing else, show variables. If // evaluating this at the top level, also show functions. if (show_verbose && ! (show_builtins || show_functions || show_variables)) { show_functions = (curr_sym_tab == top_level_sym_tab); show_variables = 1; } ostrstream output_buf; int pad_after = 0; if (show_builtins) { pad_after += maybe_list ("*** built-in variables:", argv, argc, output_buf, show_verbose, global_sym_tab, symbol_def::BUILTIN_VARIABLE, SYMTAB_ALL_SCOPES); pad_after += maybe_list ("*** built-in functions:", argv, argc, output_buf, show_verbose, global_sym_tab, symbol_def::BUILTIN_FUNCTION, SYMTAB_ALL_SCOPES); } if (show_functions) { pad_after += maybe_list ("*** currently compiled functions:", argv, argc, output_buf, show_verbose, global_sym_tab, symbol_def::USER_FUNCTION, SYMTAB_ALL_SCOPES); } if (show_variables) { pad_after += maybe_list ("*** local user variables:", argv, argc, output_buf, show_verbose, curr_sym_tab, symbol_def::USER_VARIABLE, SYMTAB_LOCAL_SCOPE); pad_after += maybe_list ("*** globally visible user variables:", argv, argc, output_buf, show_verbose, curr_sym_tab, symbol_def::USER_VARIABLE, SYMTAB_GLOBAL_SCOPE); } if (pad_after) output_buf << "\n"; output_buf << ends; maybe_page_output (output_buf); return retval; } DEFUN_TEXT ("who", Fwho, Swho, -1, 1, "who [-all] [-builtins] [-functions] [-long] [-variables]\n\ \n\ List currently defined symbol(s). Options may be shortened to one\n\ character, but may not be combined.") { Octave_object retval; DEFINE_ARGV("who"); retval = do_who (argc, argv, nargout); DELETE_ARGV; return retval; } DEFUN_TEXT ("whos", Fwhos, Swhos, -1, 1, "whos [-all] [-builtins] [-functions] [-long] [-variables]\n\ \n\ List currently defined symbol(s). Options may be shortened to one\n\ character, but may not be combined.") { Octave_object retval; int nargin = args.length (); Octave_object tmp_args; for (int i = nargin; i > 0; i--) tmp_args(i) = args(i-1); tmp_args(0) = "-long"; int argc = tmp_args.length () + 1; char **argv = make_argv (tmp_args, "whos"); if (error_state) return retval; retval = do_who (argc, argv, nargout); while (--argc >= 0) delete [] argv[argc]; delete [] argv; return retval; } // Install variables and functions in the symbol tables. void install_builtin_mapper (builtin_mapper_function *mf) { symbol_record *sym_rec = global_sym_tab->lookup (mf->name, 1); sym_rec->unprotect (); Mapper_fcn mfcn; mfcn.name = strsave (mf->name); mfcn.can_return_complex_for_real_arg = mf->can_return_complex_for_real_arg; mfcn.lower_limit = mf->lower_limit; mfcn.upper_limit = mf->upper_limit; mfcn.d_d_mapper = mf->d_d_mapper; mfcn.d_c_mapper = mf->d_c_mapper; mfcn.c_c_mapper = mf->c_c_mapper; tree_builtin *def = new tree_builtin (1, 1, mfcn, mf->name); sym_rec->define (def); sym_rec->document (mf->help_string); sym_rec->make_eternal (); sym_rec->protect (); } void install_builtin_function (builtin_function *f) { symbol_record *sym_rec = global_sym_tab->lookup (f->name, 1); sym_rec->unprotect (); tree_builtin *def = new tree_builtin (f->nargin_max, f->nargout_max, f->fcn, f->name); sym_rec->define (def, f->is_text_fcn); sym_rec->document (f->help_string); sym_rec->make_eternal (); sym_rec->protect (); } void install_builtin_variable (builtin_variable *v) { if (v->install_as_function) install_builtin_variable_as_function (v->name, v->value, v->protect, v->eternal, v->help_string); else bind_builtin_variable (v->name, v->value, v->protect, v->eternal, v->sv_function, v->help_string); } void install_builtin_variable_as_function (const char *name, tree_constant *val, int protect, int eternal, const char *help) { symbol_record *sym_rec = global_sym_tab->lookup (name, 1); sym_rec->unprotect (); const char *tmp_help = help; if (! help) tmp_help = sym_rec->help (); sym_rec->define_as_fcn (val); sym_rec->document (tmp_help); if (protect) sym_rec->protect (); if (eternal) sym_rec->make_eternal (); } void alias_builtin (const char *alias, const char *name) { symbol_record *sr_name = global_sym_tab->lookup (name, 0, 0); if (! sr_name) panic ("can't alias to undefined name!"); symbol_record *sr_alias = global_sym_tab->lookup (alias, 1, 0); if (sr_alias) sr_alias->alias (sr_name); else panic ("can't find symbol record for builtin function `%s'", alias); } // Defining variables. void bind_nargin_and_nargout (symbol_table *sym_tab, int nargin, int nargout) { tree_constant *tmp; symbol_record *sr; sr = sym_tab->lookup ("nargin", 1, 0); sr->unprotect (); tmp = new tree_constant (nargin); sr->define (tmp); sr = sym_tab->lookup ("nargout", 1, 0); sr->unprotect (); tmp = new tree_constant (nargout); sr->define (tmp); } // Give a global variable a definition. This will insert the symbol // in the global table if necessary. // How is this different than install_builtin_variable? Are both // functions needed? void bind_builtin_variable (const char *varname, tree_constant *val, int protect, int eternal, sv_Function sv_fcn, const char *help) { symbol_record *sr = global_sym_tab->lookup (varname, 1, 0); // It is a programming error for a builtin symbol to be missing. // Besides, we just inserted it, so it must be there. assert (sr); sr->unprotect (); // Must do this before define, since define will call the special // variable function only if it knows about it, and it needs to, so // that user prefs can be properly initialized. if (sv_fcn) sr->set_sv_function (sv_fcn); sr->define_builtin_var (val); if (protect) sr->protect (); if (eternal) sr->make_eternal (); if (help) sr->document (help); } void install_builtin_variables (void) { // XXX FIXME XX -- these should probably be moved to where they // logically belong instead of being all grouped here. DEFVAR ("EDITOR", SBV_EDITOR, editor, 0, 0, 1, sv_editor, "name of the editor to be invoked by the edit_history command"); DEFVAR ("I", SBV_I, Complex (0.0, 1.0), 0, 1, 1, 0, "sqrt (-1)"); DEFVAR ("Inf", SBV_Inf, octave_Inf, 0, 1, 1, 0, "infinity"); DEFVAR ("INFO_FILE", SBV_INFO_FILE, info_file, 0, 0, 1, sv_info_file, "name of the Octave info file"); DEFVAR ("J", SBV_J, Complex (0.0, 1.0), 0, 1, 1, 0, "sqrt (-1)"); #if defined (HAVE_ISNAN) DEFVAR ("NaN", SBV_NaN, octave_NaN, 0, 1, 1, 0, "not a number"); #endif DEFVAR ("LOADPATH", SBV_LOADPATH, load_path, 0, 0, 1, sv_loadpath, "colon separated list of directories to search for scripts"); DEFVAR ("IMAGEPATH", SBV_IMAGEPATH, OCTAVE_IMAGEPATH, 0, 0, 1, sv_imagepath, "colon separated list of directories to search for image files"); DEFVAR ("OCTAVE_VERSION", SBV_version, version_string, 0, 1, 1, 0, "Octave version"); DEFVAR ("PAGER", SBV_PAGER, default_pager (), 0, 0, 1, sv_pager_binary, "path to pager binary"); DEFVAR ("PS1", SBV_PS1, "\\s:\\#> ", 0, 0, 1, sv_ps1, "primary prompt string"); DEFVAR ("PS2", SBV_PS2, "> ", 0, 0, 1, sv_ps2, "secondary prompt string"); DEFVAR ("PWD", SBV_PWD, get_working_directory ("initialize_globals"), 0, 1, 1, sv_pwd, "current working directory"); DEFVAR ("SEEK_SET", SBV_SEEK_SET, 0.0, 0, 1, 1, 0, "used with fseek to position file relative to the beginning"); DEFVAR ("SEEK_CUR", SBV_SEEK_CUR, 1.0, 0, 1, 1, 0, "used with fseek to position file relative to the current position"); DEFVAR ("SEEK_END", SBV_SEEK_END, 2.0, 0, 1, 1, 0, "used with fseek to position file relative to the end"); DEFVAR ("ans", SBV_ans, , 0, 0, 1, 0, ""); DEFVAR ("automatic_replot", SBV_automatic_replot, "false", 0, 0, 1, automatic_replot, "if true, auto-insert a replot command when a plot changes"); DEFVAR ("whitespace_in_literal_matrix", SBV_whitespace_in_literal_matrix, "", 0, 0, 1, whitespace_in_literal_matrix, "control auto-insertion of commas and semicolons in literal matrices"); DEFVAR ("default_save_format", SBV_default_save_format, "ascii", 0, 0, 1, sv_default_save_format, "default format for files created with save, may be one of\n\ \"binary\", \"text\", or \"mat-binary\""); DEFVAR ("do_fortran_indexing", SBV_do_fortran_indexing, "false", 0, 0, 1, do_fortran_indexing, "allow single indices for matrices"); DEFVAR ("empty_list_elements_ok", SBV_empty_list_elements_ok, "warn", 0, 0, 1, empty_list_elements_ok, "ignore the empty element in expressions like `a = [[], 1]'"); DEFVAR ("eps", SBV_eps, DBL_EPSILON, 0, 1, 1, 0, "machine precision"); DEFVAR ("gnuplot_binary", SBV_gnuplot_binary, "gnuplot", 0, 0, 1, sv_gnuplot_binary, "path to gnuplot binary"); DEFVAR ("i", SBV_i, Complex (0.0, 1.0), 1, 1, 1, 0, "sqrt (-1)"); DEFVAR ("ignore_function_time_stamp", SBV_ignore_function_time_stamp, "system", 0, 0, 1, ignore_function_time_stamp, "don't check to see if function files have changed since they were\n\ last compiled. Possible values are \"system\" and \"all\""); DEFVAR ("implicit_str_to_num_ok", SBV_implicit_str_to_num_ok, "false", 0, 0, 1, implicit_str_to_num_ok, "allow implicit string to number conversion"); DEFVAR ("inf", SBV_inf, octave_Inf, 0, 1, 1, 0, "infinity"); DEFVAR ("j", SBV_j, Complex (0.0, 1.0), 1, 1, 1, 0, "sqrt (-1)"); #if defined (HAVE_ISNAN) DEFVAR ("nan", SBV_nan, octave_NaN, 0, 1, 1, 0, "not a number"); #endif DEFVAR ("ok_to_lose_imaginary_part", SBV_ok_to_lose_imaginary_part, "warn", 0, 0, 1, ok_to_lose_imaginary_part, "silently convert from complex to real by dropping imaginary part"); DEFVAR ("output_max_field_width", SBV_output_max_field_width, 10.0, 0, 0, 1, set_output_max_field_width, "maximum width of an output field for numeric output"); DEFVAR ("output_precision", SBV_output_precision, 5.0, 0, 0, 1, set_output_precision, "number of significant figures to display for numeric output"); DEFVAR ("page_screen_output", SBV_page_screen_output, "true", 0, 0, 1, page_screen_output, "if possible, send output intended for the screen through the pager"); DEFVAR ("pi", SBV_pi, 4.0 * atan (1.0), 0, 1, 1, 0, "ratio of the circumference of a circle to its diameter"); DEFVAR ("prefer_column_vectors", SBV_prefer_column_vectors, "true", 0, 0, 1, prefer_column_vectors, "prefer column/row vectors"); DEFVAR ("prefer_zero_one_indexing", SBV_prefer_zero_one_indexing, "false", 0, 0, 1, prefer_zero_one_indexing, "when there is a conflict, prefer zero-one style indexing"); DEFVAR ("print_answer_id_name", SBV_print_answer_id_name, "true", 0, 0, 1, print_answer_id_name, "set output style to print `var_name = ...'"); DEFVAR ("print_empty_dimensions", SBV_print_empty_dimensions, "true", 0, 0, 1, print_empty_dimensions, "also print dimensions of empty matrices"); DEFVAR ("propagate_empty_matrices", SBV_propagate_empty_matrices, "true", 0, 0, 1, propagate_empty_matrices, "operations on empty matrices return an empty matrix, not an error"); DEFVAR ("realmax", SBV_realmax, DBL_MAX, 1, 1, 1, 0, "realmax (): return largest representable floating point number"); DEFVAR ("realmin", SBV_realmin, DBL_MIN, 1, 1, 1, 0, "realmin (): return smallest representable floating point number"); DEFVAR ("resize_on_range_error", SBV_resize_on_range_error, "true", 0, 0, 1, resize_on_range_error, "enlarge matrices on assignment"); DEFVAR ("return_last_computed_value", SBV_return_last_computed_value, "false", 0, 0, 1, return_last_computed_value, "if a function does not return any values explicitly, return the\n\ last computed value"); DEFVAR ("save_precision", SBV_save_precision, 17.0, 0, 0, 1, set_save_precision, "number of significant figures kept by the ASCII save command"); DEFVAR ("silent_functions", SBV_silent_functions, "false", 0, 0, 1, silent_functions, "suppress printing results in called functions"); DEFVAR ("split_long_rows", SBV_split_long_rows, "true", 0, 0, 1, split_long_rows, "split long matrix rows instead of wrapping"); DEFVAR ("stdin", SBV_stdin, 0.0, 0, 1, 1, 0, "file number of the standard input stream"); DEFVAR ("stdout", SBV_stdout, 1.0, 0, 1, 1, 0, "file number of the standard output stream"); DEFVAR ("stderr", SBV_stderr, 2.0, 0, 1, 1, 0, "file number of the standard error stream"); DEFVAR ("treat_neg_dim_as_zero", SBV_treat_neg_dim_as_zero, "false", 0, 0, 1, treat_neg_dim_as_zero, "convert negative dimensions to zero"); DEFVAR ("warn_assign_as_truth_value", SBV_warn_assign_as_truth_value, "true", 0, 0, 1, warn_assign_as_truth_value, "produce warning for assignments used as truth values"); DEFVAR ("warn_comma_in_global_decl", SBV_warn_comma_in_global_decl, "true", 0, 0, 1, warn_comma_in_global_decl, "produce warning for commas in global declarations"); DEFVAR ("warn_divide_by_zero", SBV_warn_divide_by_zero, "true", 0, 0, 1, warn_divide_by_zero, "on IEEE machines, allow divide by zero errors to be suppressed"); } // Deleting names from the symbol tables. DEFUN_TEXT ("clear", Fclear, Sclear, -1, 1, "clear [-x] [name ...]\n\ \n\ Clear symbol(s) matching a list of globbing patterns.\n\ \n\ If no arguments are given, clear all user-defined variables and functions.\n\ \n\ With -x, exclude the named variables") { Octave_object retval; DEFINE_ARGV("clear"); argc--; argv++; // Always clear the local table, but don't clear currently compiled // functions unless we are at the top level. (Allowing that to happen // inside functions would result in pretty odd behavior...) int clear_user_functions = (curr_sym_tab == top_level_sym_tab); if (argc == 0) { curr_sym_tab->clear (); global_sym_tab->clear (clear_user_functions); } else { int exclusive = 0; if (argc > 0) { if (strcmp (*argv, "-x") == 0) { exclusive = 1; argv++; argc--; } } int lcount = 0; int gcount = 0; int fcount = 0; char **lvars = 0; char **gvars = 0; char **fcns = 0; if (argc > 0) { lvars = curr_sym_tab->list (lcount, 0, 0, 0, symbol_def::USER_VARIABLE, SYMTAB_LOCAL_SCOPE); gvars = curr_sym_tab->list (gcount, 0, 0, 0, symbol_def::USER_VARIABLE, SYMTAB_GLOBAL_SCOPE); fcns = global_sym_tab->list (fcount, 0, 0, 0, symbol_def::USER_FUNCTION, SYMTAB_ALL_SCOPES); } while (argc > 0) { char *pat = *argv; if (pat) { int i; for (i = 0; i < lcount; i++) { char *nm = lvars[i]; int match = (fnmatch (pat, nm, __FNM_FLAGS) == 0); if ((exclusive && ! match) || (! exclusive && match)) curr_sym_tab->clear (nm); } int count; for (i = 0; i < gcount; i++) { char *nm = gvars[i]; int match = (fnmatch (pat, nm, __FNM_FLAGS) == 0); if ((exclusive && ! match) || (! exclusive && match)) { count = curr_sym_tab->clear (nm); if (count > 0) global_sym_tab->clear (nm, clear_user_functions); } } for (i = 0; i < fcount; i++) { char *nm = fcns[i]; int match = (fnmatch (pat, nm, __FNM_FLAGS) == 0); if ((exclusive && ! match) || (! exclusive && match)) { count = curr_sym_tab->clear (nm); global_sym_tab->clear (nm, clear_user_functions); } } } argc--; argv++; } delete [] lvars; delete [] gvars; delete [] fcns; } DELETE_ARGV; return retval; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/xdiv.cc100666 415 17 17407 5702416766 13255 0ustar jweusers// xdiv.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "xdiv.h" #include "dMatrix.h" #include "CMatrix.h" #include "tree-const.h" #include "error.h" static inline int result_ok (int info, double rcond, int warn = 1) { assert (info != -1); if (info == -2) { if (warn) warning ("matrix singular to machine precision, rcond = %g", rcond); else error ("matrix singular to machine precision, rcond = %g", rcond); return 0; } else return 1; } static inline int mx_leftdiv_conform (int a_nr, int a_nc, int b_nr, int warn = 1) { if (a_nr != b_nr) { error ("number of rows must be the same for left division"); return 0; } return 1; } static inline int mx_div_conform (int b_nr, int b_nc, int a_nc, int warn = 1) { if (a_nc != b_nc) { error ("number of columns must be the same for right division"); return 0; } return 1; } // Right division functions. // // op2 / op1: m cm // +-- +---+----+ // matrix | 1 | 3 | // +---+----+ // complex_matrix | 2 | 4 | // +---+----+ // -*- 1 -*- tree_constant xdiv (const Matrix& a, const Matrix& b) { if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) return tree_constant (); Matrix atmp = a.transpose (); Matrix btmp = b.transpose (); int info; if (btmp.rows () == btmp.columns ()) { double rcond = 0.0; Matrix result = btmp.solve (atmp, info, rcond); if (result_ok (info, rcond)) return tree_constant (result.transpose ()); } int rank; Matrix result = btmp.lssolve (atmp, info, rank); return tree_constant (result.transpose ()); } // -*- 2 -*- tree_constant xdiv (const Matrix& a, const ComplexMatrix& b) { if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) return tree_constant (); Matrix atmp = a.transpose (); ComplexMatrix btmp = b.hermitian (); int info; if (btmp.rows () == btmp.columns ()) { double rcond = 0.0; ComplexMatrix result = btmp.solve (atmp, info, rcond); if (result_ok (info, rcond)) return tree_constant (result.hermitian ()); } int rank; ComplexMatrix result = btmp.lssolve (atmp, info, rank); return tree_constant (result.hermitian ()); } // -*- 3 -*- tree_constant xdiv (const ComplexMatrix& a, const Matrix& b) { if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) return tree_constant (); ComplexMatrix atmp = a.hermitian (); Matrix btmp = b.transpose (); int info; if (btmp.rows () == btmp.columns ()) { double rcond = 0.0; ComplexMatrix result = btmp.solve (atmp, info, rcond); if (result_ok (info, rcond)) return tree_constant (result.hermitian ()); } int rank; ComplexMatrix result = btmp.lssolve (atmp, info, rank); return tree_constant (result.hermitian ()); } // -*- 4 -*- tree_constant xdiv (const ComplexMatrix& a, const ComplexMatrix& b) { if (! mx_div_conform (b.rows (), b.columns (), a.columns ())) return tree_constant (); ComplexMatrix atmp = a.hermitian (); ComplexMatrix btmp = b.hermitian (); int info; if (btmp.rows () == btmp.columns ()) { double rcond = 0.0; ComplexMatrix result = btmp.solve (atmp, info, rcond); if (result_ok (info, rcond)) return tree_constant (result.hermitian ()); } int rank; ComplexMatrix result = btmp.lssolve (atmp, info, rank); return tree_constant (result.hermitian ()); } // Funny element by element division operations. // // op2 \ op1: s cs // +-- +---+----+ // matrix | 1 | 3 | // +---+----+ // complex_matrix | 2 | 4 | // +---+----+ tree_constant x_el_div (double a, const Matrix& b) { int nr = b.rows (); int nc = b.columns (); Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = a / b.elem (i, j); return tree_constant (result); } tree_constant x_el_div (double a, const ComplexMatrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = a / b.elem (i, j); return tree_constant (result); } tree_constant x_el_div (const Complex a, const Matrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = a / b.elem (i, j); return tree_constant (result); } tree_constant x_el_div (const Complex a, const ComplexMatrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = a / b.elem (i, j); return tree_constant (result); } // Left division functions. // // op2 \ op1: m cm // +-- +---+----+ // matrix | 1 | 3 | // +---+----+ // complex_matrix | 2 | 4 | // +---+----+ // -*- 1 -*- tree_constant xleftdiv (const Matrix& a, const Matrix& b) { if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) return tree_constant (); int info; if (a.rows () == a.columns ()) { double rcond = 0.0; Matrix result = a.solve (b, info, rcond); if (result_ok (info, rcond)) return tree_constant (result); } int rank; Matrix result = a.lssolve (b, info, rank); return tree_constant (result); } // -*- 2 -*- tree_constant xleftdiv (const Matrix& a, const ComplexMatrix& b) { if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) return tree_constant (); int info; if (a.rows () == a.columns ()) { double rcond = 0.0; ComplexMatrix result = a.solve (b, info, rcond); if (result_ok (info, rcond)) return tree_constant (result); } int rank; ComplexMatrix result = a.lssolve (b, info, rank); return tree_constant (result); } // -*- 3 -*- tree_constant xleftdiv (const ComplexMatrix& a, const Matrix& b) { if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) return tree_constant (); int info; if (a.rows () == a.columns ()) { double rcond = 0.0; ComplexMatrix result = a.solve (b, info, rcond); if (result_ok (info, rcond)) return tree_constant (result); } int rank; ComplexMatrix result = a.lssolve (b, info, rank); return tree_constant (result); } // -*- 4 -*- tree_constant xleftdiv (const ComplexMatrix& a, const ComplexMatrix& b) { if (! mx_leftdiv_conform (a.rows (), a.columns (), b.rows ())) return tree_constant (); int info; if (a.rows () == a.columns ()) { double rcond = 0.0; ComplexMatrix result = a.solve (b, info, rcond); if (result_ok (info, rcond)) return tree_constant (result); } int rank; ComplexMatrix result = a.lssolve (b, info, rank); return tree_constant (result); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/xpow.cc100666 415 17 34410 5702416765 13270 0ustar jweusers// xpow.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include #include "xpow.h" #include "dMatrix.h" #include "CMatrix.h" #include "dDiagMatrix.h" #include "CDiagMatrix.h" #include "CColVector.h" #include "EIG.h" #include "tree-const.h" #include "error.h" // This function also appears in tree-const.cc. Maybe it should be a // member function of the Matrix class. static int any_element_is_negative (const Matrix& a) { int nr = a.rows (); int nc = a.columns (); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) if (a.elem (i, j) < 0.0) return 1; return 0; } // Safer pow functions. // // op2 \ op1: s m cs cm // +-- +---+---+----+----+ // scalar | | 1 | 5 | 7 | 11 | // +---+---+----+----+ // matrix | 2 | E | 8 | E | // +---+---+----+----+ // complex_scalar | 3 | 6 | 9 | 12 | // +---+---+----+----+ // complex_matrix | 4 | E | 10 | E | // +---+---+----+----+ // // E -> error, trapped in arith-ops.cc. // -*- 1 -*- tree_constant xpow (double a, double b) { if (a < 0.0 && (int) b != b) { Complex atmp (a); return tree_constant (pow (atmp, b)); } else return tree_constant (pow (a, b)); } // -*- 2 -*- tree_constant xpow (double a, const Matrix& b) { tree_constant retval; int nr = b.rows (); int nc = b.columns (); if (nr == 0 || nc == 0 || nr != nc) error ("for x^A, A must be square"); else { EIG b_eig (b); ComplexColumnVector lambda (b_eig.eigenvalues ()); ComplexMatrix Q (b_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0) lambda.elem (i) = pow (a, real (elt)); else lambda.elem (i) = pow (a, elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 3 -*- tree_constant xpow (double a, const Complex& b) { Complex result; Complex atmp (a); result = pow (atmp, b); return tree_constant (result); } // -*- 4 -*- tree_constant xpow (double a, const ComplexMatrix& b) { tree_constant retval; int nr = b.rows (); int nc = b.columns (); if (nr == 0 || nc == 0 || nr != nc) error ("for x^A, A must be square"); else { EIG b_eig (b); ComplexColumnVector lambda (b_eig.eigenvalues ()); ComplexMatrix Q (b_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0) lambda.elem (i) = pow (a, real (elt)); else lambda.elem (i) = pow (a, elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 5 -*- tree_constant xpow (const Matrix& a, double b) { tree_constant retval; int nr = a.rows (); int nc = a.columns (); if (nr == 0 || nc == 0 || nr != nc) { error ("for A^b, A must be square"); return retval; } if ((int) b == b) { int btmp = (int) b; if (btmp == 0) { DiagMatrix result (nr, nr, 1.0); retval = tree_constant (result); } else { // Too much copying? // XXX FIXME XXX -- we shouldn\'t do this if the exponent is large... Matrix atmp; if (btmp < 0) { btmp = -btmp; atmp = a.inverse (); } else atmp = a; Matrix result (atmp); for (int i = 1; i < btmp; i++) result = result * atmp; retval = tree_constant (result); } } else { EIG a_eig (a); ComplexColumnVector lambda (a_eig.eigenvalues ()); ComplexMatrix Q (a_eig.eigenvectors ()); for (int i = 0; i < nr; i++) lambda.elem (i) = pow (lambda.elem (i), b); ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 6 -*- tree_constant xpow (const Matrix& a, const Complex& b) { int nr = a.rows (); int nc = a.columns (); if (nr == 0 || nc == 0 || nr != nc) { error ("for A^b, A must be square"); return tree_constant (); } EIG a_eig (a); ComplexColumnVector lambda (a_eig.eigenvalues ()); ComplexMatrix Q (a_eig.eigenvectors ()); for (int i = 0; i < nr; i++) lambda.elem (i) = pow (lambda.elem (i), b); ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); return tree_constant (result); } // -*- 7 -*- tree_constant xpow (const Complex& a, double b) { Complex result; result = pow (a, b); return tree_constant (result); } // -*- 8 -*- tree_constant xpow (const Complex& a, const Matrix& b) { tree_constant retval; int nr = b.rows (); int nc = b.columns (); if (nr == 0 || nc == 0 || nr != nc) { error ("for x^A, A must be square"); } else { EIG b_eig (b); ComplexColumnVector lambda (b_eig.eigenvalues ()); ComplexMatrix Q (b_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0) lambda.elem (i) = pow (a, real (elt)); else lambda.elem (i) = pow (a, elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 9 -*- tree_constant xpow (const Complex& a, const Complex& b) { Complex result; result = pow (a, b); return tree_constant (result); } // -*- 10 -*- tree_constant xpow (const Complex& a, const ComplexMatrix& b) { tree_constant retval; int nr = b.rows (); int nc = b.columns (); if (nr == 0 || nc == 0 || nr != nc) error ("for x^A, A must be square"); else { EIG b_eig (b); ComplexColumnVector lambda (b_eig.eigenvalues ()); ComplexMatrix Q (b_eig.eigenvectors ()); for (int i = 0; i < nr; i++) { Complex elt = lambda.elem (i); if (imag (elt) == 0.0) lambda.elem (i) = pow (a, real (elt)); else lambda.elem (i) = pow (a, elt); } ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 11 -*- tree_constant xpow (const ComplexMatrix& a, double b) { tree_constant retval; int nr = a.rows (); int nc = a.columns (); if (nr == 0 || nc == 0 || nr != nc) { error ("for A^b, A must be square"); return retval; } if ((int) b == b) { int btmp = (int) b; if (btmp == 0) { DiagMatrix result (nr, nr, 1.0); retval = tree_constant (result); } else { // Too much copying? // XXX FIXME XXX -- we shouldn\'t do this if the exponent is large... ComplexMatrix atmp; if (btmp < 0) { btmp = -btmp; atmp = a.inverse (); } else atmp = a; ComplexMatrix result (atmp); for (int i = 1; i < btmp; i++) result = result * atmp; retval = tree_constant (result); } } else { EIG a_eig (a); ComplexColumnVector lambda (a_eig.eigenvalues ()); ComplexMatrix Q (a_eig.eigenvectors ()); for (int i = 0; i < nr; i++) lambda.elem (i) = pow (lambda.elem (i), b); ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); retval = tree_constant (result); } return retval; } // -*- 12 -*- tree_constant xpow (const ComplexMatrix& a, const Complex& b) { int nr = a.rows (); int nc = a.columns (); if (nr == 0 || nc == 0 || nr != nc) { error ("for A^b, A must be square"); return tree_constant (); } EIG a_eig (a); ComplexColumnVector lambda (a_eig.eigenvalues ()); ComplexMatrix Q (a_eig.eigenvectors ()); for (int i = 0; i < nr; i++) lambda.elem (i) = pow (lambda.elem (i), b); ComplexDiagMatrix D (lambda); ComplexMatrix result = Q * D * Q.inverse (); return tree_constant (result); } // Safer pow functions that work elementwise for matrices. // // op2 \ op1: s m cs cm // +-- +---+---+----+----+ // scalar | | * | 3 | * | 9 | // +---+---+----+----+ // matrix | 1 | 4 | 7 | 10 | // +---+---+----+----+ // complex_scalar | * | 5 | * | 11 | // +---+---+----+----+ // complex_matrix | 2 | 6 | 8 | 12 | // +---+---+----+----+ // // * -> not needed. // -*- 1 -*- tree_constant elem_xpow (double a, const Matrix& b) { tree_constant retval; int nr = b.rows (); int nc = b.columns (); // For now, assume the worst. if (a < 0.0) { Complex atmp (a); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (atmp, b.elem (i, j)); retval = tree_constant (result); } else { Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a, b.elem (i, j)); retval = tree_constant (result); } return retval; } // -*- 2 -*- tree_constant elem_xpow (double a, const ComplexMatrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a, b.elem (i, j)); return tree_constant (result); } // -*- 3 -*- tree_constant elem_xpow (const Matrix& a, double b) { tree_constant retval; int nr = a.rows (); int nc = a.columns (); if ((int) b != b && any_element_is_negative (a)) { ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) { Complex atmp (a.elem (i, j)); result.elem (i, j) = pow (atmp, b); } retval = tree_constant (result); } else { Matrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b); retval = tree_constant (result); } return retval; } // -*- 4 -*- tree_constant elem_xpow (const Matrix& a, const Matrix& b) { int nr = a.rows (); int nc = a.columns (); assert (nr == b.rows () && nc == b.columns ()); int convert_to_complex = 0; int i; for (int j = 0; j < nc; j++) for (i = 0; i < nr; i++) { double atmp = a.elem (i, j); double btmp = b.elem (i, j); if (atmp < 0.0 && (int) btmp != btmp) { convert_to_complex = 1; goto done; } } done: if (convert_to_complex) { ComplexMatrix complex_result (nr, nc); for (j = 0; j < nc; j++) for (i = 0; i < nr; i++) { Complex atmp (a.elem (i, j)); Complex btmp (b.elem (i, j)); complex_result.elem (i, j) = pow (atmp, btmp); } return tree_constant (complex_result); } else { Matrix result (nr, nc); for (j = 0; j < nc; j++) for (i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b.elem (i, j)); return tree_constant (result); } } // -*- 5 -*- tree_constant elem_xpow (const Matrix& a, const Complex& b) { int nr = a.rows (); int nc = a.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b); return tree_constant (result); } // -*- 6 -*- tree_constant elem_xpow (const Matrix& a, const ComplexMatrix& b) { int nr = a.rows (); int nc = a.columns (); assert (nr == b.rows () && nc == b.columns ()); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b.elem (i, j)); return tree_constant (result); } // -*- 7 -*- tree_constant elem_xpow (const Complex& a, const Matrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a, b.elem (i, j)); return tree_constant (result); } // -*- 8 -*- tree_constant elem_xpow (const Complex& a, const ComplexMatrix& b) { int nr = b.rows (); int nc = b.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a, b.elem (i, j)); return tree_constant (result); } // -*- 9 -*- tree_constant elem_xpow (const ComplexMatrix& a, double b) { int nr = a.rows (); int nc = a.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b); return tree_constant (result); } // -*- 10 -*- tree_constant elem_xpow (const ComplexMatrix& a, const Matrix& b) { int nr = a.rows (); int nc = a.columns (); assert (nr == b.rows () && nc == b.columns ()); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b.elem (i, j)); return tree_constant (result); } // -*- 11 -*- tree_constant elem_xpow (const ComplexMatrix& a, const Complex& b) { int nr = a.rows (); int nc = a.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b); return tree_constant (result); } // -*- 12 -*- tree_constant elem_xpow (const ComplexMatrix& a, const ComplexMatrix& b) { int nr = a.rows (); int nc = a.columns (); ComplexMatrix result (nr, nc); for (int j = 0; j < nc; j++) for (int i = 0; i < nr; i++) result.elem (i, j) = pow (a.elem (i, j), b.elem (i, j)); return tree_constant (result); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/Map.cc100666 415 17 12162 5702417137 13002 0ustar jweusers// Map.cc -*- C++ -*- /* Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* The classes in this file are derived from the old `genclass' versions of Map and CHMap from libg++, originally: Copyright (C) 1988 Free Software Foundation written by Doug Lea (dl@rocky.oswego.edu) and distributed under the terms of the GNU Library General Public License as published by the Free Software Foundation. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include #include "Map.h" static unsigned int hash (const char *str) { unsigned h = 0; while (*str) h = h * 33 + *str++; return h; } template Pix Map::seek (const char *item) const { for (Pix i = first (); i != 0 && strcmp (key (i), item) != 0; next (i)) ; // Skip items until match found. return i; } template int Map::owns (Pix idx) const { if (idx == 0) return 0; for (Pix i = first (); i != 0; next (i)) if (i == idx) return 1; return 0; } template void Map::clear (void) { Pix i = first (); while (i != 0) { del (key (i)); i = first (); } } template int Map::contains (const char *item) const { return seek (item) != 0; } template void Map::error (const char* msg) const { cerr << "Map: " << msg << "\n"; } // CHMap class. // The nodes are linked together serially via a version of a trick // used in some vtables: odd pointers are actually links to the next // table entry. Not terrible, but not wonderful either. template static int goodCHptr (CHNode *t) { return ((((unsigned) t) & 1) == 0); } // This sucks, but avoids g++ 2.6.0 `type unification failed' errors. static void * index_to_CHptr (int i) { return (void *) ((i << 1) + 1); } template static int CHptr_to_index (CHNode *t) { return ((unsigned) t) >> 1; } template CHMap::CHMap (const C& dflt, unsigned int sz) : Map (dflt) { tab = new CHNode* [size = sz]; for (unsigned int i = 0; i < size; ++i) tab[i] = (CHNode *) index_to_CHptr (i+1); count = 0; } template CHMap::CHMap (const CHMap& a) : Map (a.def) { tab = new CHNode* [size = a.size]; for (unsigned int i = 0; i < size; ++i) tab[i] = (CHNode *) index_to_CHptr (i+1); count = 0; for (Pix p = a.first (); p; a.next (p)) (*this) [a.key (p)] = a.contents (p); } template Pix CHMap::seek (const char *key) const { unsigned int h = hash (key) % size; for (CHNode *t = tab[h]; goodCHptr (t); t = t->tl) if (strcmp (key, t->hd) == 0) return Pix (t); return 0; } template C& CHMap::operator [] (const char *item) { unsigned int h = hash (item) % size; for (CHNode *t = tab[h]; goodCHptr (t); t = t->tl) if (strcmp (item, t->hd) == 0) return t->cont; t = new CHNode (item, def, tab[h]); tab[h] = t; ++count; return t->cont; } template void CHMap::del (const char *key) { unsigned int h = hash (key) % size; CHNode *t = tab[h]; CHNode *trail = t; while (goodCHptr (t)) { if (strcmp (key, t->hd) == 0) { if (trail == t) tab[h] = t->tl; else trail->tl = t->tl; delete t; --count; return; } trail = t; t = t->tl; } } template void CHMap::clear (void) { for (unsigned int i = 0; i < size; ++i) { CHNode *p = tab[i]; tab[i] = (CHNode *) index_to_CHptr (i+1); while (goodCHptr (p)) { CHNode *nxt = p->tl; delete p; p = nxt; } } count = 0; } template Pix CHMap::first (void) const { for (unsigned int i = 0; i < size; ++i) if (goodCHptr (tab[i])) return Pix (tab[i]); return 0; } template void CHMap::next (Pix& p) const { CHNode *t = ((CHNode *) p)->tl; if (goodCHptr (t)) p = Pix (t); else { for (unsigned int i = CHptr_to_index (t); i < size; ++i) { if (goodCHptr (tab[i])) { p = Pix (tab[i]); return; } } p = 0; } } template int CHMap::OK (void) const { int v = tab != 0; int n = 0; for (unsigned int i = 0; i < size; ++i) { for (CHNode *p = tab[i]; goodCHptr (p); p = p->tl) ++n; v &= CHptr_to_index (p) == i + 1; } v &= count == n; if (! v) error ("invariant failure"); return v; } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack.cc100666 415 17 3566 5702417123 13554 0ustar jweusers// SLStack.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "SLStack.h" template SLStack::SLStack (void) : p () { } template SLStack::SLStack (const SLStack& a) : p (a.p) { } template SLStack::~SLStack (void) { } template void SLStack::push (const T& item) { p.prepend (item); } template T SLStack::pop (void) { return p.remove_front (); } template T& SLStack::top (void) { return p.front (); } template void SLStack::del_top (void) { p.del_front (); } template SLStack& SLStack::operator = (const SLStack& s) { p = s.p; return *this; } template int SLStack::empty (void) { return p.empty (); } template int SLStack::full (void) { return 0; } template int SLStack::length (void) { return p.length (); } template int SLStack::OK (void) { return p.OK (); } template void SLStack::clear (void) { p.clear (); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/Array-tc.cc100666 415 17 3005 5703575730 13730 0ustar jweusers// Array-tc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Arrays of tree_constants. #include "Array.h" #include "Array.cc" #include "tree-const.h" extern template class ArrayRep; extern template class Array; extern template class Array2; extern template class DiagArray; extern template class ArrayRep; extern template class Array; extern template class Array2; extern template class DiagArray; extern template class ArrayRep; extern template class Array; extern template class Array2; extern template class DiagArray; template class ArrayRep; template class Array; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/Map-tc.cc100666 415 17 2311 5702417137 13361 0ustar jweusers// Map-tc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Maps of tree_constants. #include "Map.h" #include "Map.cc" #include "tree-const.h" template class Map; template class CHNode; template class CHMap; template static int goodCHptr (CHNode *t); template static int CHptr_to_index (CHNode *t); /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/DLList-fi.cc100666 415 17 2027 5702417140 13765 0ustar jweusers// DLList-fi.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Lists of various values. #include #include "file-io.h" template class DLNode ; template class DLList ; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLList-expr.cc100666 415 17 2337 5702417136 14375 0ustar jweusers// SLList-expr.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Lists of various values. #include #include "tree-expr.h" template class SLNode; template class SLList; template class SLNode; template class SLList; template class SLNode; template class SLList; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLList-misc.cc100666 415 17 2310 5702417135 14340 0ustar jweusers// SLList-misc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Lists of various values. #include #include "tree-misc.h" template class SLNode; template class SLList; template class SLNode; template class SLList; template class SLList; template class SLNode; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLList-plot.cc100666 415 17 2031 5702417134 14362 0ustar jweusers// SLList-plot.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Lists of various values. #include #include "tree-plot.h" template class SLNode; template class SLList; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLList-tc.cc100666 415 17 2040 5702417133 14011 0ustar jweusers// SLList-tc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Lists of various values. #include #include "tree-const.h" template class SLNode; template class SLList; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-i.cc100666 415 17 2077 5702417133 13777 0ustar jweusers// SLStack-i.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of int values. #include "SLStack.h" #include "SLStack.cc" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-pc.cc100666 415 17 2116 5702417132 14142 0ustar jweusers// SLStack-pc.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of char* values. #include "SLStack.h" #include "SLStack.cc" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-sym.cc100666 415 17 2443 5703576415 14366 0ustar jweusers// SLStack-sym.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of symbol_def* values. #include "SLStack.h" #include "SLStack.cc" #include "symtab.h" extern template class SLNode; extern template class SLList; extern template class Stack; extern template class SLStack; template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-tok.cc100666 415 17 2150 5702417130 14331 0ustar jweusers// SLStack-tok.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of token* values. #include "SLStack.h" #include "SLStack.cc" #include "token.h" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-tm.cc100666 415 17 2240 5702417130 14154 0ustar jweusers// SLStack-tm.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of tree_matrix* values. #include "SLStack.h" #include "SLStack.cc" #include "tree-base.h" #include "tree-expr.h" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-ue.cc100666 415 17 2202 5702417126 14150 0ustar jweusers// SLStack-up.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of unwind_elem values. #include "SLStack.h" #include "SLStack.cc" #include "unwind-prot.h" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/src/SLStack-ui.cc100666 415 17 2134 5702417126 14160 0ustar jweusers// SLStack-ui.cc -*- C++ -*- /* Copyright (C) 1993, 1994, 1995 John W. Eaton This file is part of Octave. Octave 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, or (at your option) any later version. Octave 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 Octave; see the file COPYING. If not, write to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ // Instantiate Stacks of symbol_def* values. #include "SLStack.h" #include "SLStack.cc" template class SLNode; template class SLList; template class Stack; template class SLStack; /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; page-delimiter: "^/\\*" *** ;;; End: *** */ octave-1.1.0/scripts/ 40777 415 17 0 5705522406 12536 5ustar jweusersoctave-1.1.0/scripts/Makefile.in100666 415 17 3764 5673222233 14711 0ustar jweusers# # Makefile for octave's scripts directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. script_sub_dir = . srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = # *.m DISTFILES = Makefile.in $(SOURCES) SUBDIRS = control elfun general image linear-algebra miscellaneous \ plot polynomial set signal specfun special-matrix startup \ statistics strings DISTSUBDIRS = $(SUBDIRS) FCN_FILES = # $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = # $(notdir $(FCN_FILES)) all: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: all install: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: install uninstall: for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done ctags $(SOURCES) TAGS: $(SOURCES) for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done etags $(SOURCES) mostlyclean: clean for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: mostlyclean distclean: clean for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done rm -f Makefile .PHONY: distclean realclean: distclean for dir in $(SUBDIRS); do echo making $@ in $$dir; cd $$dir; $(MAKE) $@; cd ..; done rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../`cat ../.fname`/scripts for dir in $(DISTSUBDIRS); do mkdir ../`cat ../.fname`/scripts/$$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: local-dist dist: ln $(DISTFILES) ../`cat ../.fname`/scripts for dir in $(DISTSUBDIRS); do mkdir ../`cat ../.fname`/scripts/$$dir; cd $$dir; $(MAKE) $@; cd ..; done .PHONY: dist octave-1.1.0/scripts/control/ 40777 415 17 0 5705522355 14221 5ustar jweusersoctave-1.1.0/scripts/control/Makefile.in100666 415 17 2446 5673222232 16364 0ustar jweusers# # Makefile for octave's scripts/control directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = control srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/control .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/control .PHONY: dist octave-1.1.0/scripts/control/abcddim.m100666 415 17 3410 5702570261 16051 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [n, m, p] = abcddim (a, b, c, d) # Usage: [n, m, p] = abcddim (a, b, c, d) # # Check for compatibility of the dimensions of the matrices defining # the linear system (a, b, c, d). # # Returns n = number of system states, # m = number of system inputs, # p = number of system outputs. # # Returns n = m = p = -1 if the system is not compatible. # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin != 4) error ("abcddim: invalid number of arguments. need four.") endif n = m = p = -1; [an, am] = size(a); if (an != am) error ("abcddim: a is not square"); endif [bn, bm] = size(b); if (bn != am) error ("abcddim: a and b are not compatible"); endif [cn, cm] = size(c); if (cm != an) error ("abcddim: a and c are not compatible"); endif [dn, dm] = size(d); if (cn != dn) error ("abcddim: c and d are not compatible"); endif if (bm != dm) error ("abcddim: b and d are not compatible"); endif n = an; m = bm; p = cn; endfunction octave-1.1.0/scripts/control/are.m100666 415 17 5117 5702570260 15242 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function x = are (a, b, c, opt) # Usage: x = are (a, b, c {,opt}) # # Solves algebraic riccati equation # # a' x + x a - x b x + c = 0 # # for identically dimensioned square matrices a, b, c. If b (c) is not # square, then the function attempts to use b * b' (c' * c) instead. # # Solution method: apply Laub's Schur method (IEEE Trans. Auto. Contr, # 1979) to the appropriate Hamiltonian matrix. # # opt is an option passed to the eigenvalue balancing routine default is "B". # # See also: balance # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 3 || nargin == 4) if (nargin == 4) if (! (strcmp (opt, "N") || strcmp (opt, "P") ... || strcmp (opt, "S") || strcmp (opt, "B") ... || strcmp (opt, "n") || strcmp (opt, "p") ... || strcmp (opt, "s") || strcmp (opt, "b"))) warning ("are: opt has an invalid value; setting to B"); opt = "B"; endif else opt = "B"; endif if ((n = is_square(a)) == 0) error ("are: a is not square"); endif if (is_controllable(a,b) == 0) warning ("are: a, b are not controllable"); endif if ((m = is_square (b)) == 0) b = b * b'; m = rows (b); endif if (is_observable (a, c) == 0) warning ("are: a,c are not observable"); endif if ((p = is_square (c)) == 0) c = c' * c; p = rows (c); endif if (n != m || n != p) error ("are: a, b, c not conformably dimensioned."); endif # Should check for controllability/observability here # use Boley-Golub (Syst. Contr. Letters, 1984) method, not the # # n-1 # rank ([ B A*B ... A^ *B]) method [d, h] = balance ([a, -b; -c, -a'], opt); [u, s] = schur (h, "A"); u = d * u; n1 = n + 1; n2 = 2 * n; x = u (n1:n2, 1:n) / u (1:n, 1:n); else usage ("x = are (a, b, c)") endif endfunction octave-1.1.0/scripts/control/c2d.m100666 415 17 3010 5702570260 15131 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [Ad, Bd] = c2d (Ac, Bc, T) # Usage: [Ad, Bd] = c2d (Ac, Bc, T) # # converts the continuous time system described by: # . # x = Ac x + Bc u # # into a discrete time equivalent model via the matrix exponential # # x[n+1] = Ad x[n] + Bd u[n] # # assuming a zero-order hold on the input and sample time T. # Written by R.B. Tenison (btenison@eng.auburn.edu) # October 1993 # check args if (nargin != 3) usage ("c2d (Ac, Bc, T)"); endif [ma, na] = size (Ac); [mb, nb] = size (Bc); if (ma != na) error ("c2d: Ac must be square"); endif if (ma != mb) error ("c2d: Ac and Bc must have the same number of rows"); endif matexp = expm ([[Ac, Bc] * T; zeros (nb, na+nb)]); Ad = matexp (1:na, 1:na); Bd = matexp (1:na, na+1:na+nb); endfunction octave-1.1.0/scripts/control/dare.m100666 415 17 5527 5702570504 15414 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function x = dare (a, b, c, r, opt) # Usage: x = dare (a, b, c, r {,opt}) # # Solves discrete-time algebraic riccati equation # # a' x a - x + a' x b (r + b' x b)^{-1} b' x a + c = 0 # # for # # a: nxn # b: nxm # c: nxn, symmetric positive semidefinite # r: mxm, invertible # # If c is not square, then the function attempts to use c'*c instead. # # Solution method: Laub's Schur method (IEEE Trans Auto Contr, 1979) applied # to the appropriate symplectic matrix. # # See also: Ran and Rodman, "Stable Hermitian Solutions of Discrete # Algebraic Riccati Equations," Mathematics of Control, Signals and # Systems, Vol 5, no 2 (1992) pp 165-194. # # opt is an option passed to the eigenvalue balancing routine default # is "B". # # See also: balance, are # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 4 || nargin == 5) if (nargin == 5) if (opt != "N" || opt != "P" || opt != "S" || opt != "B") warning ("dare: opt has an invalid value -- setting to B"); opt = "B"; endif else opt = "B"; endif # Check a matrix dimensions if ((n = is_square (a)) == 0) error ("dare: a is not square"); endif # Check a,b compatibility. [n1, m] = size (b); if (n1 != n) warning ("dare: a,b are not conformable"); endif if (is_controllable (a, b) == 0) warning ("dare: a,b are not controllable"); endif # Check a,c compatibility. if (is_observable (a, c) == 0) warning ("dare: a,c are not observable"); endif if ((p = is_square (c)) == 0) c = c'*c; p = rows (c); endif if (n != p) error ("dare: a,c are not conformable"); endif # Check r dimensions. if ((m1 = is_square (r)) == 0) warning ("dare: r is not square"); elseif (m1 != m) warning ("b,r are not conformable"); endif brb = (b/r)*b'; atc = a'\c; [d, sy] = balance ([a + brb*atc, -brb/(a'); -atc, inv (a')], opt); [u, s] = schur(sy,'D'); u = d*u; n1 = n+1; n2 = 2*n; x = u (n1:n2, 1:n)/u(1:n, 1:n); else usage ("x = dare (a, b, c, r {,opt})"); endif endfunction octave-1.1.0/scripts/control/dgram.m100666 415 17 2222 5702570517 15564 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function gramian = dgram (A, B) # Usage: gramian = dgram (A, B) # # Returns the discrete controllability and observability gramian. # # dgram (A, B) returns the discrete controllability gramian. # dgram (A', C') returns the observability gramian. # Written by R. Bruce Tenison (btenison@eng.auburn.edu) # October 1993 [U, Sig, V] = svd (B); gramian = U * dlyap (U'*A*U, Sig*Sig') * U'; endfunction octave-1.1.0/scripts/control/dlqe.m100666 415 17 4125 5702570257 15424 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [l, m, p, e] = dlqe (a, g, c, sigw, sigv, zz) # Usage: [l, m, p, e] = dlqe (A, G, C, SigW, SigV {,Z}) # # Linear quadratic estimator (Kalman filter) design for the # discrete time system # # x[k+1] = A x[k] + B u[k] + G w[k] # y[k] = C x[k] + D u[k] + w[k] # # where w, v are zero-mean gaussian noise processes with respective # intensities SigW = cov (w, w) and SigV = cov (v, v). # # Z (if specified) is cov(w,v); otherwise cov(w,v) = 0. # # Observer structure is # z[k+1] = A z[k] + B u[k] + k(y[k] - C z[k] - D u[k]). # # Returns: # # l = observer gain, (A - A L C) is stable # m = Ricatti equation solution # p = the estimate error covariance after the measurement update # e = closed loop poles of (A - A L C) # Written by A. S. Hodel (scotte@eng.auburn.edu) August, 1993. # Modified for discrete time by R. Bruce Tenison (btenison@eng.auburn.edu) # October, 1993 if (nargin != 5 && nargin != 6) error ("dlqe: invalid number of arguments"); endif # The problem is dual to the regulator design, so transform to lqr # call. if (nargin == 5) [k, p, e] = dlqr (a', c', g*sigw*g', sigv); m = p'; l = (m*c')/(c*m*c'+sigv); else [k, p, e] = dlqr (a', c', g*sigw*g', sigv, g*zz); m = p'; l = (m*c'+a\g)/(c*m*c'+sigv); a = a-g*t/sigv*c; sigw = sigw-t/sigv; endif p = a\(m-g*sigw*g')/a'; endfunction octave-1.1.0/scripts/control/dlqr.m100666 415 17 5071 5702570256 15441 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [k, p, e] = dlqr (a, b, q, r, zz) # Usage: [k, p, e] = dlqr (A, B, Q, R {,Z}) # # Linear quadratic regulator design for the discrete time system # # x[k+1] = A x[k] + B u[k] # # to minimize the cost functional # # J = Sum { x' Q x + u' R u } Z omitted # # or # # J = Sum { x' Q x + u' R u +2 x' Z u} Z included # # Returns: # # k = state feedback gain, (A - B K) is stable # p = solution of algebraic Riccati equation # e = closed loop poles of (A - B K) # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. # Converted to discrete time by R. B. Tenison # (btenison@eng.auburn.edu) October 1993 if (nargin != 4 && nargin != 5) error ("dlqr: invalid number of arguments"); endif # Check a. if ((n = is_square (a)) == 0) error ("dlqr: requires 1st parameter(a) to be square"); endif # Check b. [n1, m] = size (b); if (n1 != n) error ("dlqr: a,b not conformal"); endif # Check q. if ((n1 = is_square (q)) == 0 || n1 != n) error ("dlqr: q must be square and conformal with a"); endif # Check r. if((m1 = is_square(r)) == 0 || m1 != m) error ("dlqr: r must be square and conformal with column dimension of b"); endif # Check if n is there. if (nargin == 5) [n1, m1] = size (zz); if (n1 != n || m1 != m) error ("dlqr: z must be identically dimensioned with b"); endif # Incorporate cross term into a and q. ao = a - (b/r)*zz'; qo = q - (zz/r)*zz'; else zz = zeros (n, m); ao = a; qo = q; endif # Check that q, (r) are symmetric, positive (semi)definite if (is_symmetric (q) && is_symmetric (r) ... && all (eig (q) >= 0) && all (eig (r) > 0)) p = dare (ao, b, qo, r); k = (r+b'*p*b)\b'*p*a + r\zz'; e = eig (a - b*k); else error ("dlqr: q (r) must be symmetric positive (semi) definite"); endif endfunction octave-1.1.0/scripts/control/dlyap.m100666 415 17 4245 5702570256 15612 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function x = dlyap (a, b) # Usage: x = dlyap (a, b) # # Solve a x a' - x + b = 0 (discrete Lyapunov equation) for square # matrices a and b. If b is not square, then the function attempts # to solve either # # a x a' - x + b b' = 0 # # or # # a' x a - x + b' b = 0 # # whichever is appropriate. Uses Schur decomposition as in Kitagawa # (1977). # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if ((n = is_square (a)) == 0) warning ("dlyap: a must be square"); endif if ((m = is_square (b)) == 0) [n1, m] = size (b); if (n1 == n) b = b*b'; m = n1; else b = b'*b; a = a'; endif endif if (n != m) warning ("dlyap: a,b not conformably dimensioned"); endif # Solve the equation column by column. [u, s] = schur (a); b = u'*b*u; j = n; while (j > 0) j1 = j; # Check for Schur block. if (j == 1) blksiz = 1; elseif (s (j, j-1) != 0) blksiz = 2; j = j - 1; else blksiz = 1; endif Ajj = kron (s (j:j1, j:j1), s) - eye (blksiz*n); rhs = reshape (b (:, j:j1), blksiz*n, 1); if (j1 < n) rhs2 = s*(x (:, (j1+1):n) * s (j:j1, (j1+1):n)'); rhs = rhs + reshape (rhs2, blksiz*n, 1); endif v = - Ajj\rhs; x (:, j) = v (1:n); if(blksiz == 2) x (:, j1) = v ((n+1):blksiz*n); endif j = j - 1; endwhile # Back-transform to original coordinates. x = u*x*u'; endfunction octave-1.1.0/scripts/control/is_controllable.m100666 415 17 4056 5702570256 17654 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_controllable (a, b, tol) # Usage: is_controllable (a, b {,tol}) # # Returns 1 if the pair (a, b) is controllable, or 0 if not. # # See also: size, rows, columns, length, is_matrix, is_scalar, is_vector # # This should really use the method below, but I'm being lazy for now: # # Controllability is determined by applying Arnoldi iteration with # complete re-orthogonalization to obtain an orthogonal basis of the # Krylov subspace. # # (FIX ME... The Krylov subspace approach is not done yet!) # n-1 # span ([b,a*b,...,a^ b]). # # tol is a roundoff paramter, set to 2*eps if omitted. # Written by A. S. Hodel (scotte@eng.auburn.edu) August, 1993. if (nargin == 2 || nargin == 3) n = is_square (a); [nr, nc] = size (b); if (n == 0 || n != nr || nc == 0) retval = 0; else m = b; tmp = b; for ii = 1:(n-1) tmp = a * tmp; m = [m, tmp]; endfor # If n is of any significant size, m will be low rank, so be careful! if (nargin == 3) if (is_scalar (tol)) retval = (rank (m, tol) == n); else error ("is_controllable: tol must be a scalar"); endif else retval = (rank (m) == n); endif endif else usage ("is_controllable (a, b)"); endif endfunction octave-1.1.0/scripts/control/is_observable.m100666 415 17 2320 5702570255 17307 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_observable (a,c,tol) # usage: is_observable (a, c {,tol}) # # Returns 1 if the pair (a, c) is observable, or 0 if not. # # See also: size, rows, columns, length, is_matrix, is_scalar, is_vector. # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 2) retval = is_controllable (a', c'); elseif (nargin == 3) retval = is_controllable (a', c', tol); else usage ("is_observable (a, c {,tol})"); endif endfunction octave-1.1.0/scripts/control/lqe.m100666 415 17 3371 5702570255 15260 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [k, p, e] = lqe (a, g, c, sigw, sigv, zz) # Usage: [k, p, e] = lqe (A, G, C, SigW, SigV {,Z}) # # Linear quadratic estimator (Kalman filter) design for the # continuous time system # # dx/dt = A x + B u + G w # y = C x + D u + v # # where w, v are zero-mean gaussian noise processes with respective # intensities SigW = cov (w, w) and SigV = cov (v, v). # # Z (if specified) is cov(w,v); otherwise cov(w,v) = 0. # # Observer structure is dz/dt = A z + B u + k( y - C z - D u). # # Returns: # # k = observer gain, (A - K C) is stable # p = solution of algebraic Riccati equation # e = closed loop poles of (A - K C) # Written by A. S. Hodel (scotte@eng.auburn.edu) August, 1993. if (nargin != 5 && nargin != 6) error ("lqe: invalid number of arguments"); endif # The problem is dual to the regulator design, so transform to lqr # call. if (nargin == 5) [k, p, e] = lqr (a', c', g*sigw*g', sigv); else [k, p, e] = lqr (a', c', g*sigw*g', sigv, g*zz); endif k = k'; endfunction octave-1.1.0/scripts/control/lqr.m100666 415 17 4734 5702570254 15300 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [k, p, e] = lqr (a, b, q, r, zz) # Usage: [k, p, e] = lqr (A, B, Q, R {,Z}) # # Linear quadratic regulator design for the continuous time system # # dx/dt = A x + B u # # to minimize the cost functional # # J = int_0^\infty{ x' Q x + u' R u } Z omitted # # or # # J = int_0^\infty{ x' Q x + u' R u +2 x' Z u} Z included # # Returns: # # k = state feedback gain, (A - B K) is stable # p = solution of algebraic Riccati equation # e = closed loop poles of (A - B K) # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin != 4 && nargin != 5) error ("lqr: invalid number of arguments"); endif # Check a. if ((n = is_square (a)) == 0) error ("lqr: requires 1st parameter(a) to be square"); endif # Check b. [n1, m] = size (b); if (n1 != n) error ("lqr: a,b not conformal"); endif # Check q. if ((n1 = is_square (q)) == 0 || n1 != n) error ("lqr: q must be square and conformal with a"); endif # Check r. if((m1 = is_square(r)) == 0 || m1 != m) error ("lqr: r must be square and conformal with column dimension of b"); endif # Check if n is there. if (nargin == 5) [n1, m1] = size (zz); if (n1 != n || m1 != m) error ("lqr: z must be identically dimensioned with b"); endif # Incorporate cross term into a and q. ao = a - (b/r)*zz'; qo = q - (zz/r)*zz'; else zz = zeros (n, m); ao = a; qo = q; endif # Check that q, (r) are symmetric, positive (semi)definite if (is_symmetric (q) && is_symmetric (r) ... && all (eig (q) >= 0) && all (eig (r) > 0)) p = are (ao, (b/r)*b', qo); k = r\(b'*p + zz'); e = eig (a - b*k); else error ("lqr: q (r) must be symmetric positive (semi) definite"); endif endfunction octave-1.1.0/scripts/control/lyap.m100666 415 17 4335 5702570254 15444 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function x = lyap (a, b, c) # Usage: x = lyap (a, b {,c}) # # If (a, b, c) are specified, then lyap returns the solution of the # Sylvester equation # # a x + x b + c = 0 # # If only (a, b) are specified, then lyap returns the solution of the # Lyapunov equation # # a' x + x a + b = 0 # # If b is not square, then lyap returns the solution of either # # a' x + x a + b' b = 0 # # or # # a x + x a' + b b' = 0 # # whichever is appropriate. # # Solves by using the Bartels-Stewart algorithm (1972). # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin != 3 && nargin != 2) usage ("lyap (a, b {,c})"); endif if ((n = is_square(a)) == 0) error ("lyap: a is not square"); endif if (nargin == 2) # Transform Lyapunov equation to Sylvester equation form. if ((m = is_square (b)) == 0) if ((m = rows (b)) == n) # solve a x + x a' + b b' = 0 b = b * b'; a = a'; else # Try to solve a'x + x a + b' b = 0. m = columns (b); b = b' * b; endif if (m != n) error ("lyap: a, b not conformably dimensioned"); endif endif # Set up Sylvester equation. c = b; b = a; a = b' else # Check dimensions. if ((m = is_square (b)) == 0) error ("lyap: b must be square in a sylvester equation"); endif [n1, m1] = size(c); if (n != n1 || m != m1) error("lyap: a,b,c not conformably dimensioned"); endif; endif # Call octave built-in function. x = syl (a, b, c); endfunction octave-1.1.0/scripts/control/tzero.m100666 415 17 3560 5702570253 15640 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function zr = tzero (a, b, c, d, bal) # Usage: zr = tzero (a, b, c, d, bal) # # Compute the transmission zeros of a, b, c, d. # # bal = balancing option (see balance); default is "B". # # Needs to incorporate mvzero algorithm to isolate finite zeros. # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 4) bal = "B"; elseif (nargin != 5) error ("tzero: invalid number of arguments"); endif [n, m, p] = abcddim (a, b, c, d); if (n > 0 && m > 0 && p > 0) if (m != p) warning ("tzero: number of inputs,outputs differ. squaring up"); if (p > m) warning (" by padding b and d with zeros."); b = [b, zeros (n, p-m)]; d = [d, zeros (p, p-m)]; m = p; else warning (" by padding c and d with zeros."); c = [c; zeros (m-p, n)]; d = [d; zeros (m-p, m)]; p = m; endif warning ("This is a kludge. Try again with SISO system."); endif ab = [-a, -b; c, d]; bb = [eye (n), zeros (n, m); zeros (p, n), zeros (p, m)]; [ab,bb] = balance (ab, bb); zr = -qzval (ab, bb); else error ("tzero: a, b, c, d not compatible"); endif endfunction octave-1.1.0/scripts/elfun/ 40777 415 17 0 5705522360 13646 5ustar jweusersoctave-1.1.0/scripts/elfun/Makefile.in100666 415 17 2436 5673222232 16014 0ustar jweusers# # Makefile for octave's scripts/elfun directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = elfun srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/elfun .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/elfun .PHONY: dist octave-1.1.0/scripts/elfun/acot.m100666 415 17 257 5702567573 15047 0ustar jweusersfunction w = acot (z) # acot (z): compute the inverse cotangent for each element of z. if (nargin != 1) usage ("acot (z)"); endif w = atan (1 ./ z); endfunctionoctave-1.1.0/scripts/elfun/acoth.m100666 415 17 277 5702567574 15222 0ustar jweusersfunction w = acoth (z) # acoth (z): compute the inverse hyperbolic cotangent for each element of z. if (nargin != 1) usage ("acoth (z)"); endif w = atanh (1 ./ z); endfunctionoctave-1.1.0/scripts/elfun/acsc.m100666 415 17 264 5702567575 15032 0ustar jweusersfunction w = acsc (z) # acsc (z): compute the inverse cosecant for each element of z. if (nargin != 1) usage ("acsc (z)"); endif w = asin (1 ./ z); endfunctionoctave-1.1.0/scripts/elfun/acsch.m100666 415 17 303 5702567575 15174 0ustar jweusersfunction w = acsch (z) # acsch (z): compute the inverse hyperbolic cosecant for each element of z. if (nargin != 1) usage ("acsch (z)"); endif w = asinh (1 ./ z); endfunctionoctave-1.1.0/scripts/elfun/asec.m100666 415 17 262 5702567576 15033 0ustar jweusersfunction w = asec (z) # asec (z): compute the inverse secant for each element of z. if (nargin != 1) usage ("asec (z)"); endif w = acos (1 ./ z); endfunctionoctave-1.1.0/scripts/elfun/asech.m100666 415 17 302 5702567577 15177 0ustar jweusersfunction w = asech (z) # asech (z): compute the inverse hyperbolic secant for each element of z. if (nargin != 1) usage ("acosh (z)"); endif w = acosh (1 ./ z); endfunction octave-1.1.0/scripts/elfun/cot.m100666 415 17 250 5702567577 14703 0ustar jweusersfunction w = cot (z) # cot (z): compute the cotangent for each element of z. if (nargin != 1) usage ("cot (z)"); endif w = 1 ./ tan(z); endfunctionoctave-1.1.0/scripts/elfun/coth.m100666 415 17 267 5702567600 15046 0ustar jweusersfunction w = coth (z) # coth (z): compute the hyperbolic cotangent for each element of z. if (nargin != 1) usage ("coth (z)"); endif w = 1 ./ tanh(z); endfunctionoctave-1.1.0/scripts/elfun/csc.m100666 415 17 250 5702567600 14651 0ustar jweusersfunction w = csc (z) # csc (z): compute the cosecant for each element of z. if (nargin != 1) usage ("csc (z)"); endif w = 1 ./ sin(z); endfunction octave-1.1.0/scripts/elfun/csch.m100666 415 17 267 5702567601 15032 0ustar jweusersfunction w = csch (z) # csch (z): compute the hyperbolic cosecant for each element of z. if (nargin != 1) usage ("csch (z)"); endif w = 1 ./ sinh(z); endfunction octave-1.1.0/scripts/elfun/gcd.m100666 415 17 3076 5705045272 14666 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [g, v] = gcd (a, ...) # usage: gcd (a, ...) # # [g [, v]] = gcd (a) returns the greatest common divisor g of the # entries of the integer vector a, and an integer vector v such that # g = v(1) * a(k) + ... + v(k) * a(k). # # [g [, v]] = gcd (a1, ..., ak) is the same with a = [a1, ..., ak]. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 16, 1994. if (nargin > 1) va_start; for k = 2:nargin; a = [a, va_arg ()]; endfor endif if (round (a) != a) error ("gcd: all arguments must be integer"); endif g = abs (a(1)); v = sign (a(1)); for k = 1:(length (a) - 1) x = [g, 1, 0]; y = [abs (a(k+1)), 0, 1]; while (y(1) > 0) r = x - y * floor (x(1) / y(1)); x = y; y = r; endwhile g = x(1); v = [x(2) * v, x(3) * sign (a(k+1))]; endfor endfunction octave-1.1.0/scripts/elfun/lcm.m100666 415 17 2531 5705045257 14702 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function l = lcm (a, ...) # usage: lcm (a, ...) # # lcm (a) returns the least common multiple of the entries of the # integer vector a. # lcm (a1, ..., ak) is the same as lcm([a1, ..., ak]). # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 16, 1994. if (nargin > 1) va_start; for k = 2:nargin; a = [a, va_arg ()]; endfor endif if (round (a) != a) error ("lcm: all arguments must be integer"); endif if (any (a) == 0) l = 0; else a = abs (a); l = a (1); for k = 1:(length (a) - 1) l = l * a(k+1) / gcd (l, a(k+1)); endfor endif endfunction octave-1.1.0/scripts/elfun/log2.m100666 415 17 266 5702567602 14755 0ustar jweusersfunction w = log2 (z) # log2 (z): compute the logarithm base 2 for each element of z. if (nargin != 1) usage ("log2 (z)"); endif w = log(z) / log(2); endfunctionoctave-1.1.0/scripts/elfun/sec.m100666 415 17 244 5702567602 14660 0ustar jweusersfunction w = sec (z) # sec (z): compute the secant for each element of z. if (nargin != 1) usage ("sec (z)"); endif y = 1 ./ cos(z); endfunctionoctave-1.1.0/scripts/elfun/sech.m100666 415 17 264 5702567603 15033 0ustar jweusersfunction w = sech (z) # sech (z): compute the hyperbolic secant for each element of z. if (nargin != 1) usage ("sech (z)"); endif y = 1 ./ cosh(z); endfunctionoctave-1.1.0/scripts/general/ 40777 415 17 0 5705522365 14157 5ustar jweusersoctave-1.1.0/scripts/general/Makefile.in100666 415 17 2446 5673222231 16320 0ustar jweusers# # Makefile for octave's scripts/general directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = general srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/general .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/general .PHONY: dist octave-1.1.0/scripts/general/columns.m100666 415 17 1754 5702570251 16113 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function nc = columns (x) # usage: columns (x) # # Return the the number of columns in x. # # See also: size, rows, length, is_scalar, is_vector, is_matrix if (nargin != 1) usage ("columns (x)"); endif [nr, nc] = size (x); endfunction octave-1.1.0/scripts/general/fliplr.m100666 415 17 1731 5702570251 15716 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = fliplr (x) # usage: fliplr (x) # # Return x with the columns swapped. # # See also: flipu, rot90 if (nargin != 1) usage ("fliplr (x)"); endif y = x; nc = columns (x); y = x (:, nc:-1:1); endfunction octave-1.1.0/scripts/general/flipud.m100666 415 17 1724 5702570250 15712 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = flipud (x) # usage: flipud (x) # # Return x with the rows swapped. # # See also: fliplr, rot90 if (nargin != 1) usage ("flipud (x)"); endif y = x; nr = rows (x); y = x (nr:-1:1, :); endfunction octave-1.1.0/scripts/general/int2str.m100666 415 17 2243 5702570250 16031 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = int2str (x) # usage: int2str (x) # # Round x to the nearest integer and format as a string. # # See also: sprintf, num2str # XXX FIXME XXX -- this will fail for very large values. if (nargin == 1) if (rows (x) == 1 && columns (x) == 1) retval = sprintf ("%d", round (x)); else error ("int2str: expecting scalar argument"); endif else usage ("int2str (x)"); endif endfunction octave-1.1.0/scripts/general/is_matrix.m100666 415 17 2101 5702570247 16422 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_matrix (x) # usage: is_matrix (x) # # Return 1 if the number of rows and columns of x are both greater # than 1. # # See also: size, rows, columns, length, is_scalar, is_vector if (nargin == 1) [nr, nc] = size (x); retval = (nr > 1 && nc > 1); else usage ("is_matrix (x)"); endif endfunction octave-1.1.0/scripts/general/is_scalar.m100666 415 17 2075 5702570247 16375 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_scalar (x) # usage: is_scalar (x) # # Return 1 if the number of rows and columns of x are both equal to 1. # # See also: size, rows, columns, length, is_scalar, is_matrix if (nargin == 1) [nr, nc] = size (x); retval = (nr == 1 && nc == 1); else usage ("is_scalar (x)"); endif endfunction octave-1.1.0/scripts/general/is_square.m100666 415 17 2305 5702570246 16423 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_square (x) # usage: is_square (x) # # If x is square, then return value is the dimension of x. # otherwise, returns a value of 0 # # See also: size, rows, columns, length, is_matrix, is_scalar, is_vector # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 1) [nr, nc] = size (x); if (nr == nc) retval = nr; else retval = 0; endif else usage ("is_square (x)"); endif endfunction octave-1.1.0/scripts/general/is_symmetric.m100666 415 17 2445 5702570246 17144 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_symmetric (x,tol) # Usage: is_symmetric (x {,tol}) # # If x is symmetric, return the dimension of x, otherwise, return 0. # # See also: size, rows, columns, length, is_matrix, is_scalar, # is_square, is_vector # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin == 1 || nargin == 2) if ((retval = is_square (x))) if (nargin == 1) tol = eps; endif if (norm (x - x') / norm(x) > tol) retval = 0; endif endif else usage ("is_symmetric (x {,tol})"); endif endfunction octave-1.1.0/scripts/general/is_vector.m100666 415 17 2235 5702570245 16426 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_vector (x) # usage: is_vector (x) # # Return 1 if the either the number of rows (columns) of x is 1 and # the number of columns (rows) is greater than one. Otherwise, return 0. # # See also: size, rows, columns, length, is_scalar, is_matrix if (nargin == 1) [nr, nc] = size (x); retval = ((nr == 1 && nc > 1) || (nc == 1 && nr > 1)); else usage ("is_vector (x)"); endif endfunction octave-1.1.0/scripts/general/isempty.m100666 415 17 1753 5702570244 16126 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = isempty (var) # usage: isempty (x) # # Return 1 if the argument is an empty matrix. Otherwise, return 0. if (nargin != 1) usage ("isempty (var)"); endif retval = (rows (var) == 0 || columns (var) == 0); endfunction octave-1.1.0/scripts/general/length.m100666 415 17 2001 5702570243 15677 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function len = length (x) # usage: length (x) # # Return the number of rows or columns, whichever is greater. # # See also: size, rows, columns, is_scalar, is_vector, is_matrix if (nargin != 1) usage ("length (x)"); endif len = max (size (x)); endfunction octave-1.1.0/scripts/general/linspace.m100666 415 17 3001 5702570243 16215 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = linspace (x1, x2, n) # usage: linspace (x1, x2, n) # # Return a vector of n equally spaced points between x1 and x2 # inclusive. # # If the final argument is omitted, n = 100 is assumed. # # All three arguments must be scalars. # # See also: logspace if (nargin == 2) npoints = 100; elseif (nargin == 3) if (length (n) == 1) npoints = fix (n); else error ("linspace: arguments must be scalars"); endif else usage ("linspace (x1, x2 [, n])"); endif if (npoints < 2) error ("linspace: npoints must be greater than 2"); endif if (length (x1) == 1 && length (x2) == 1) delta = (x2 - x1) / (npoints - 1); retval = x1:delta:x2; else error ("linspace: arguments must be scalars"); endif endfunction octave-1.1.0/scripts/general/logspace.m100666 415 17 3551 5702570242 16225 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = logspace (x1, x2, n) # usage: logspace (x1, x2, n) # # Return a vector of n logarithmically equally spaced points between # x1 and x2 inclusive. # # If the final argument is omitted, n = 50 is assumed. # # All three arguments must be scalars. # # Note that if if x2 is pi, the points are between 10^x1 and pi, NOT # 10^x1 and 10^pi. # # Yes, this is pretty stupid, because you could achieve the same # result with logspace (x1, log10 (pi)), but Matlab does this, and # claims that is useful for signal processing applications. # # See also: linspace if (nargin == 2) npoints = 50; elseif (nargin == 3) if (length (n) == 1) npoints = fix (n); else error ("logspace: arguments must be scalars"); endif else usage ("logspace (x1, x2 [, n])"); endif if (npoints < 2) error ("logspace: npoints must be greater than 2"); endif if (length (x1) == 1 && length (x2) == 1) x2_tmp = x2; if (x2 == pi) x2_tmp = log10 (pi); endif retval = 10 .^ (linspace (x1, x2_tmp, npoints)); else error ("logspace: arguments must be scalars"); endif endfunction octave-1.1.0/scripts/general/nargchk.m100666 415 17 2535 5702570242 16046 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = nargchk (nargin_min, nargin_max, n) # usage: nargchk (nargin_min, nargin_max, n) # # If N is in the range NARGIN_MIN to NARGIN_MAX, return the empty # matrix. Otherwise, return a message indicating whether N is too # large or too small. if (nargin != 3) usage ("nargchk (nargin_min, nargin_max, n)"); endif if (nargin_min > nargin_max) error ("nargchk: nargin_min > nargin_max"); endif if (n < nargin_min) retval = "nargchk: N is less than nargin_min"; elseif (n > nargin_max) retval = "nargchk: N is greater than nargin_max"; else retval = []; endif endfunction octave-1.1.0/scripts/general/num2str.m100666 415 17 2077 5702570241 16043 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = num2str (x) # usage: num2str (x) # # Format x as a string. # # See also: sprintf, int2str if (nargin == 1) if (rows (x) == 1 && columns (x) == 1) retval = sprintf ("%g", x); else error ("num2str: expecting scalar argument"); endif else usage ("num2str (x)"); endif endfunction octave-1.1.0/scripts/general/perror.m100666 415 17 6573 5702570241 15747 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function perror (name, err) # usage: perror (name, err) # # Print an error message for error number `err' from function "name". # # Messages correspond to the following subroutine versions: # # npsol : 4.0 # qpsol : 3.2 if (nargin != 2) usage ("perror (name, err)"); endif if (! isstr (name)) error ("perror: first argument must be a string"); endif if (! is_scalar (err)) error ("perror: second argument must be a scalar"); endif if (strcmp (name, "fsolve")) if (err == -2) printf ("input error\n"); elseif (err == -1) printf ("error encountered in user-supplied function\n"); elseif (err == 1) printf ("solution converged to requested tolerance\n"); elseif (err == 4) printf ("iteration limit exceeded\n"); elseif (err == 3) printf ("iteration is not making good progress\n"); else error ("perror: unrecognized error code for fsolve"); endif elseif (strcmp (name, "npsol")) if (err == 0) printf ("optimal solution found\n"); elseif (err == 1) printf ("weak local solution found\n"); elseif (err == 2) printf ("no feasible point for linear constraints and bounds\n"); elseif (err == 3) printf ("no feasible point found for nonlinear constraints\n"); elseif (err == 4) printf ("iteration limit reached\n"); elseif (err == 6) printf ("current point cannot be improved upon\n"); elseif (err == 7) printf ("user-supplied derivatives appear to be incorrect\n"); elseif (err == 9) printf ("internal error: invalid input parameter\n"); else error ("perror: unrecognized error code for npsol"); endif elseif (strcmp (name, "qpsol")) if (err == 0) printf ("optimal solution found\n"); elseif (err == 1) printf ("weak local solution found\n"); elseif (err == 2) printf ("solution appears to be unbounded\n"); elseif (err == 3) printf ("solution appears optimal, but optimality can't be verified\n"); elseif (err == 4) printf ("iterates of the QP phase appear to be cycling\n"); elseif (err == 5) printf ("iteration limit reached during QP phase\n"); elseif (err == 6) printf ("no feasible point found during LP phase\n"); elseif (err == 7) printf ("iterates of the LP phase appear to be cycling\n"); elseif (err == 8) printf ("iteration limit reached during LP phase\n"); elseif (err == 9) printf ("internal error: invalid input parameter\n"); else error ("perror: unrecognized error code for qpsol"); endif else error ("perror: unrecognized function name"); endif endfunction octave-1.1.0/scripts/general/postpad.m100666 415 17 1502 5702567611 16102 0ustar jweusersfunction y = postpad(x,l,c) # postpad(x,l) # Appends zeros to the vector x until it is of length l. # postpad(x,l,c) appends the constant c instead of zero. # # If length(x) > l, elements from the end of x are removed # until a vector of length l is obtained. # Author: # Tony Richardson # amr@mpl.ucsd.edu # June 1994 if(nargin == 2) c = 0; elseif(nargin<2 || nargin>3) usage ("postpad(x,l) or postpad(x,l,c)"); endif if(is_matrix(x)) error("first argument must be a vector"); elseif(!is_scalar(l)) error("second argument must be a scaler"); endif if(l<0) error("second argument must be non-negative"); endif lx = length(x); if(lx >= l) y = x(1:l); else if(rows(x)>1) y = [ x; c*ones(l-lx,1) ]; else y = [ x c*ones(1,l-lx) ]; endif endif endfunction octave-1.1.0/scripts/general/prepad.m100666 415 17 1506 5702567611 15707 0ustar jweusersfunction y = prepad(x,l,c) #prepad(x,l) #Prepends zeros to the vector x until it is of length l. #prepad(x,l,c) prepends the constant c instead of zero. # #If length(x) > l, elements from the beginning of x are removed #until a vector of length l is obtained. # Author: # Tony Richardson # amr@mpl.ucsd.edu # June 1994 if(nargin == 2) c = 0; elseif(nargin<2 || nargin>3) usage ("prepad(x,l) or prepad(x,l,c)"); endif if(is_matrix(x)) error("first argument must be a vector"); elseif(!is_scalar(l)) error("second argument must be a scaler"); endif if(l<0) error("second argument must be non-negative"); endif lx = length(x); if(lx >= l) y = x(lx-l+1:lx); else if(rows(x)>1) y = [ c*ones(l-lx,1); x ]; else y = [ c*ones(1,l-lx) x ]; endif endif endfunction octave-1.1.0/scripts/general/rem.m100666 415 17 2470 5702570237 15216 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = rem (x, y) # usage: rem (x, y) # # Return remainder (x, y). if (nargin != 2) usage ("rem (x, y)"); endif if (any (size (x) != size (y)) && ! (is_scalar (x) || is_scalar (y))) error ("rem: argument sizes must agree"); endif # Matlab allows complex arguments, but as far as I can tell, that's a # bunch of hooey. if (any (any (imag (x))) || any (any (imag (y)))) error ("rem: complex arguments are not allowed"); endif if (nargin == 2) retval = x - y .* fix (x ./ y); else error ("usage: rem (x, y)"); endif endfunction octave-1.1.0/scripts/general/reshape.m100666 415 17 2546 5702570237 16066 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = reshape (a, m, n) # usage: reshape (a, m, n) # # Form an m x n matrix from the elements of a (taken in Fortran's # column major ordering). # # See also: `:', do_fortran_indexing if (nargin != 3) usage ("reshape (a, m, n)"); else [nr, nc] = size (a); if (nr * nc == m * n) tmp = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; retval = zeros (m, n); retval (:) = a; unwind_protect_cleanup do_fortran_indexing = tmp; end_unwind_protect else error ("reshape: sizes must match"); endif endif endfunction octave-1.1.0/scripts/general/rot90.m100666 415 17 2661 5702570236 15411 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = rot90 (x, k) # usage: rot90 (x, k) # # Rotate the matrix x counterclockwise k*90 degrees. # # If the second argument is omitted, k is taken to be 1. # # See also: flipud, fliplr if (nargin < 2) k = 1; endif if (imag (k) != 0 || fix (k) != k) error ("rot90: k must be an integer"); endif if (nargin == 1 || nargin == 2) k = rem (k, 4); if (k < 0) k = k + 4; endif if (k == 0) y = x; elseif (k == 1) y = flipud (x'); elseif (k == 2) y = flipud (fliplr (x)); elseif (k == 3) y = (flipud (x))'; else error ("rot90: internal error!"); endif else usage ("rot90 (x [, k])"); endif endfunction octave-1.1.0/scripts/general/rows.m100666 415 17 1743 5702570236 15426 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function nr = rows (x) # usage: rows (x) # # Return the the number of rows in x. # # See also: size, columns, length, is_scalar, is_vector, is_matrix if (nargin != 1) usage ("rows (x)"); endif [nr, nc] = size (x); endfunction octave-1.1.0/scripts/general/tril.m100666 415 17 2531 5702570236 15402 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = tril (x, k) # usage: triu (x, k) # # Return the lower triangular part of x above the k-th diagonal. If # the second argument is omitted, k = 0 is assumed. # # See also: triu, diag if (nargin > 0) [nr, nc] = size (x); retval = x; endif if (nargin == 1) k = 0; elseif (nargin == 2) max_nr_nc = max (nr, nc); if ((k > 0 && k > nr - 1) || (k < 0 && k < 1 - nc)) error ("tril: requested diagonal out of range") endif else usage ("tril (x [, k])"); endif for i = 1:nr for j = i+1-k:nc retval (i, j) = 0.0; endfor endfor endfunction octave-1.1.0/scripts/general/triu.m100666 415 17 2531 5702570235 15412 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = triu (x, k) # usage: triu (x, k) # # Return the upper triangular part of x above the k-th diagonal. If # the second argument is omitted, k = 0 is assumed. # # See also: tril, diag if (nargin > 0) [nr, nc] = size (x); retval = x; endif if (nargin == 1) k = 0; elseif (nargin == 2) max_nr_nc = max (nr, nc); if ((k > 0 && k > nc - 1) || (k < 0 && k < 1 - nr)) error ("triu: requested diagonal out of range") endif else usage ("triu (x [, k])"); endif for j = 1:nc for i = j+1-k:nr retval (i, j) = 0.0; endfor endfor endfunction octave-1.1.0/scripts/image/ 40777 415 17 0 5705522367 13626 5ustar jweusersoctave-1.1.0/scripts/image/Makefile.in100666 415 17 3550 5673222231 15762 0ustar jweusers# # Makefile for octave's scripts/image directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = image srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m octtopnm.c IMAGES = *.img DISTFILES = Makefile.in $(SOURCES) $(IMAGES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) IMAGE_FILES = $(wildcard $(srcdir)/*.img) IMAGE_FILES_NO_DIR = $(notdir $(IMAGE_FILES)) all: octtopnm .PHONY: all octtopnm: octtopnm.o $(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) octtopnm.o -o octtopnm install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done $(top_srcdir)/mkinstalldirs $(imagedir) for f in $(IMAGE_FILES_NO_DIR) ; do \ rm -f $(imagedir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(imagedir)/$$f ; \ done $(top_srcdir)/mkinstalldirs $(archlibdir) $(INSTALL_PROGRAM) octtopnm $(archlibdir)/octtopnm .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done for f in $(IMAGE_FILES_NO_DIR) ; \ do rm -f $(imagedir)/$$f ; \ done rm -f $(archlibdir)/octtopnm .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/image .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/image .PHONY: dist octave-1.1.0/scripts/image/colormap.m100666 415 17 3520 5705037350 15706 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function cmap = colormap (map) # Set the current colormap. # # colormap (map) sets the current colormap to map. map should be an n # row by 3 column matrix. The columns contain red, green, and blue # intensities respectively. All entries should be between 0 and 1 # inclusive. The new colormap is returned. # # colormap ("default") restores the default colormap (a gray scale # colormap with 64 entries). The default colormap is returned. # # colormap with no arguments returns the current colormap. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. global CURRENT_COLOR_MAP cmap_name = "CURRENT_COLOR_MAP"; if (nargin == 1) if (isstr (map)) if (strcmp (map, "default")) CURRENT_COLOR_MAP = gray; else error ("invalid argument"); endif else # Set the new color map CURRENT_COLOR_MAP = map; endif elseif (nargin == 0 && exist (cmap_name) == 0) # If global color map doesn't exist, create the default map. CURRENT_COLOR_MAP = gray; else usage ("colormap (map)"); endif # Return current color map. cmap = CURRENT_COLOR_MAP; endfunction octave-1.1.0/scripts/image/gray.m100666 415 17 1773 5705037044 15044 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function map = gray (number) # Colormap. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin == 0) number = 64; elseif (nargin > 1) usage ("gray (number)"); endif gr = [0:(number-1)]'; map = [ gr, gr, gr ] / (number - 1); endfunction octave-1.1.0/scripts/image/gray2ind.m100666 415 17 2011 5705037000 15573 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [X, map] = gray2ind (I, n) # Image format conversion # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 1 || nargin > 2) usage ("gray2ind (I, n)"); elseif (nargin == 1) n = 64; endif map = gray (n); X = round (I*(n-1)) + 1; endfunction octave-1.1.0/scripts/image/image.m100666 415 17 3551 5705036731 15162 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function image (x, zoom) # Display an octave image matrix. # # image (x) displays a matrix as a color image. The elements of x are # indices into the current colormap and should have values between 1 # and the length of the colormap. # # image (x, zoom) changes the zoom factor. The default value is 4. # # SEE ALSO: imshow, imagesc, colormap. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin == 0) # Load Bobbie Jo Richardson (Born 3/16/94) x = loadimage ("default.img"); zoom = 2; elseif (nargin == 1) zoom = 4; elseif (nargin > 2) usage ("image (matrix, [zoom])"); endif # XXX FIXME XXX -- we should use octave_tmp_file_name. rnd_str = num2str (fix (rand * 10000)); ppm_name = ["image.", rnd_str, ".ppm" ]; saveimage (ppm_name, x, "ppm"); # Start the viewer. Try xv, then xloadimage. xv = sprintf ("xv -expand %f %s", zoom, ppm_name); xloadimage = sprintf ("xloadimage -zoom %f %s", zoom*100, ppm_name); rm = sprintf ("rm -f %s", ppm_name); command = sprintf ("( %s || %s && %s ) > /dev/null 2>&1 &", ... xv, xloadimage, rm); system (command); endfunction octave-1.1.0/scripts/image/imagesc.m100666 415 17 3217 5705036706 15511 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function x = imagesc (x, zoom) # Scale and display a matrix as an image. # # imagesc(x) displays a scaled version of the matrix x. The matrix is # scaled so that its entries are indices into the current colormap. # The scaled matrix is returned. # # imagesc (x, zoom) sets the magnification, the default value is 4. # # SEE ALSO: image, imshow # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 1 || nargin > 2) usage ("image (matrix, [zoom])"); elseif (nargin == 1) zoom = 4; endif [ high, wide ] = size (x); maxval = max (max (x)); minval = min (min (x)); # Rescale matrix so that all values are in the range 0 to # length (colormap) inclusive. if (maxval == minval) x = ones (high, wide); else # Rescale values to between 1 and length (colormap) inclusive. x = fix ((x - minval) / (maxval - minval) * (length (colormap) - 1)) + 1; endif image (x, zoom); endfunction octave-1.1.0/scripts/image/imshow.m100666 415 17 2647 5705036640 15412 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function imshow (a1, a2, a3) # Display images. # # imshow (X) displays an indexed image using the current colormap. # # imshow (X, map) displays an indexed image using the specified colormap. # # imshow (I, n) displays a gray scale intensity image. # # imshow (R, G, B) displays an RGB image. # # SEE ALSO: image, imagesc, colormap, gray2ind, rgb2ind. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 0 || nargin > 3) usage ("imshow (args)"); elseif (nargin == 2) if (length (a2) == 1) [a1, a2] = gray2ind (a1, a2); endif colormap (a2); elseif (nargin == 3) [a1, a2] = rgb2ind (a1, a2, a3); colormap (a2); endif image (a1); endfunction octave-1.1.0/scripts/image/ind2gray.m100666 415 17 3534 5705036537 15624 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function Y = ind2gray (X, map) # Convert an octave indexed image to a gray scale intensity image. # # Y = ind2gray (X) converts an indexed image to a gray scale intensity # image. The current colormap is used to determine the intensities. # The intensity values lie between 0 and 1 inclusive. # # Y = ind2gray (X, map) uses the specified colormap instead of the # current one in the conversion process. # # SEE ALSO: gray2ind, rgb2ntsc, image, colormap # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 1 || nargin > 2) usage ("ind2gray (X, map)"); elseif (nargin == 1) map = colormap (); endif # Convert colormap to intensity values. yiq = rgb2ntsc (map); y = yiq(:,1); # We need Fortran indexing capability, but be sure to save the user's # preference. pref = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; # Replace indices in the input matrix with indexed values in the output # matrix. [rows, cols] = size (X); Y = y(X(:)); Y = reshape (Y, rows, cols); unwind_protect_cleanup do_fortran_indexing = pref; end_unwind_protect endfunction octave-1.1.0/scripts/image/ind2rgb.m100666 415 17 3136 5705037555 15433 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [R, G, B] = ind2rgb (X, map) # Convert an indexed image to red, green, and blue color components. # # [R G B] = ind2rgb(X) uses the current colormap for the conversion. # # [R G B] = ind2rgb(X,map) uses the specified colormap. # # SEE ALSO: rgb2ind, image, imshow, ind2gray, gray2ind. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 1 || nargin > 2) usage ("ind2rgb (X, map)"); elseif (nargin == 1) map = colormap (); endif [hi, wi] = size (X); # XXX FIXME XXX -- we should check size of X and map. pref = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; R = map (X(:), 1); G = map (X(:), 2); B = map (X(:), 3); R = reshape (R, hi, wi); G = reshape (G, hi, wi); B = reshape (B, hi, wi); unwind_protect_cleanup do_fortran_indexing = pref; end_unwind_protect endfunction octave-1.1.0/scripts/image/loadimage.m100666 415 17 2652 5705036372 16024 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [X, map] = loadimage (filename) # Load an image file. # # [X, map] = loadimage (img_file) loads an image and it's associated # color map from file img_file. The image must be in stored in # octave's image format. # # SEE ALSO: saveimage, load, save # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin != 1) usage ("loadimage (filename)"); elseif (! isstr (filename)) error ("loadimage: expecting filename as a string"); endif file = file_in_path (IMAGEPATH, filename); if (isempty (file)) error ("loadimage: unable to find image file"); endif # XXX FIXME XXX -- file is assumed to have variables X and map. eval (['load ', file]); endfunction octave-1.1.0/scripts/image/ntsc2rgb.m100666 415 17 2063 5705036323 15616 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function rgb = ntsc2rgb (yiq) # Image format conversion. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin != 1) usage ("ntsc2rgb (yiq)"); endif trans = [ 1.0, 1.0, 1.0; 0.95617, -0.27269, -1.10374; 0.62143, -0.64681, 1.70062 ]; rgb = yiq * trans; endfunction octave-1.1.0/scripts/image/ocean.m100666 415 17 2421 5705034632 15156 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function map = ocean (number) # Colormap. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin == 0) number = 64; elseif (nargin == 1) if (! is_scalar (number)) error ("ocean: argument must be a scalar"); endif else usage ("ocean (number)"); endif cutin = fix (number/3); dr = (number - 1) / cutin; r = prepad ([0:dr:(number-1)], number)'; dg = (number - 1) / (2 * cutin); g = prepad([0:dg:(number-1)], number)'; b = [0:(number-1)]'; map = [ r, g, b ] / (number - 1); endfunction octave-1.1.0/scripts/image/rgb2ind.m100666 415 17 3010 5705036261 15413 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [X, map] = rgb2ind (R, G, B) # Convert and RGB image to an octave indexed image. # # [X, map] = rgb2ind (R, G, B) # # SEE ALSO: ind2rgb, rgb2ntsc. # # Bugs: The color map may have duplicate entries. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin != 3) usage ("[X, map] = rgb2ind (R, G, B)"); endif if (size (R) != size (G) || size (R) != size (B)) error ("rgb2ind: arguments must all have the same size"); endif [hi, wi] = size (R); X = zeros (hi, wi); map = zeros (hi*wi, 3); pref = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; map(:,1) = R(:); map(:,2) = G(:); map(:,3) = B(:); X(:) = 1:(hi*wi); unwind_protect_cleanup do_fortran_indexing = pref; end_unwind_protect endfunction octave-1.1.0/scripts/image/rgb2ntsc.m100666 415 17 2046 5705036136 15621 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function yiq = rgb2ntsc (rgb) # Image format conversion. # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin != 1) usage ("rgb2ntsc (rgb)"); endif trans = [ 0.299, 0.596, 0.211; 0.587, -0.274, -0.523; 0.114, -0.322, 0.312 ]; yiq = rgb * trans; endfunction octave-1.1.0/scripts/image/saveimage.m100666 415 17 6576 5705037446 16057 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function saveimage (filename, X, img_form, map) # Save a matrix to disk in image format. # # saveimage (filename, x) saves matrix x to file filename in octave's # image format. The current colormap is saved in the file also. # # saveimage (filename, x, "img") saves the image in the default format # and is the same as saveimage (filename, x). # # saveimage (filename, x, "ppm") saves the image in ppm format instead # of the default octave image format. # # saveimage (filename, x, "ps") saves the image in PostScript format # instead of the default octave image format. (Note: images saved in # PostScript format can not be read back into octave with loadimage.) # # saveimage (filename, x, format, map) saves the image along with the # specified colormap in the specified format. # # Note: If the colormap contains only two entries and these entries # are black and white, the bitmap ppm and PostScript formats are used. # If the image is a gray scale image (the entries within each row of # the colormap are equal) the gray scale ppm and PostScript image # formats are used, otherwise the full color formats are used. # # SEE ALSO: loadimage, save, load, colormap # Written by Tony Richardson (amr@mpl.ucsd.edu) July 1994. if (nargin < 2 || nargin > 4) usage ("saveimage (filename, matrix, [format, [colormap]])"); elseif (nargin == 2) if (! isstr (filename)) error ("file name must be a string"); endif map = colormap; img_form = "img"; elseif (nargin == 3) if (! isstr (img_form)) error ("image format specification must be a string"); endif map = colormap; endif # XXX FIXME XXX -- we should check the remaining args. # XXX FIXME XXX -- we should use octave_tmp_file_name here. if (strcmp (img_form, "img") == 1) oct_file = filename; elseif (strcmp (img_form, "ppm") == 1) oct_file = sprintf ("image.%s.img", num2str (fix (rand * 10000))); ppm_file = filename; elseif (strcmp (img_form, "ps") == 1) oct_file = sprintf ("image.%s.img", num2str (fix (rand *10000))); ps_file = filename; endif # Save image in octave image file format eval (['save ', oct_file, ' map X']); # Convert to another format if requested. if (strcmp (img_form, "ppm") == 1) octtopnm = sprintf ("octtopnm %s > %s", oct_file, filename); rm = sprintf("rm -f %s", oct_file); shell_cmd (octtopnm); shell_cmd (rm); elseif (strcmp (img_form, "ps") == 1) octtopnm = sprintf ("octtopnm %s", oct_file); ppmtops = sprintf ("pnmtops > %s 2> /dev/null", filename); octtops = [ octtopnm, " | ", ppmtops ]; rm = sprintf ("rm -f %s", oct_file); shell_cmd (octtops); shell_cmd (rm); endif endfunction octave-1.1.0/scripts/image/octtopnm.c100666 415 17 15746 5655261656 15774 0ustar jweusers# /* cc -s -o octtopnm octtopnm.c exit */ #include #include #include /* usage: octtopnm [-a] octfile */ static void usage(message) char *message; { if(message != NULL) { fprintf(stderr,"octtopnm: %s\n",message); } fprintf(stderr,"usage: octtopnm [-a] octavefile\n"); exit(1); } static void fatal(message) char *message; { if(message != NULL) { fprintf(stderr,"octtopnm: %s\n",message); } exit(1); } int main(argc, argv) int argc; char **argv; { int rawbits = 1, row, col, index; int cmap_rows, cmap_cols, img_rows, img_cols; int gray, pbm, pgm, ppm; unsigned char **rgb, byte; unsigned short **img; char *oct_file_name; FILE *oct_file; char cmap_name[4], cmap_type[7], img_name[2], img_type[7]; double mat_val; int option; extern char *optarg; extern int optind; if(argc == 1) { usage(NULL); } while((option = getopt(argc,argv,"ha")) != EOF) { switch(option) { case 'h': /* help */ usage(NULL); break; case 'a': rawbits = 0; break; case '?': default: usage("unrecognized option"); } } if(optind+1 != argc) { usage("input file name missing"); } oct_file_name = argv[optind]; if((oct_file = fopen(oct_file_name,"r")) == NULL) { fatal("unable to open input file"); } if(fscanf(oct_file,"# name: %s\n",cmap_name) != 1 || strcmp(cmap_name,"map") != 0) { fatal("not a valid octave image file"); } if(fscanf(oct_file,"# type: %s\n",cmap_type) != 1 || strcmp(cmap_type,"matrix") != 0) { fatal("not a valid octave image file"); } if(fscanf(oct_file,"# rows: %d\n",&cmap_rows) != 1) { fatal("error reading octave image file"); } if(fscanf(oct_file,"# columns: %d\n",&cmap_cols) != 1) { fatal("error reading octave image file"); } if(cmap_cols != 3) { fatal("invalid color map in octave image file"); } if((rgb = (unsigned char **) malloc(cmap_rows*sizeof(unsigned char *))) == NULL) { fatal("out of memory"); } if((rgb[0] = (unsigned char *) malloc(cmap_rows*cmap_cols*sizeof(unsigned char))) == NULL) { fatal("out of memory"); } for(row=1; row 1) mat_val = 1.; rgb[row][col] = mat_val*255; } if(gray) { if(rgb[row][0] != rgb[row][1] || rgb[row][0] != rgb[row][2]) { /* It's a color image. */ gray = 0; } } } if(fscanf(oct_file,"\n# name: %s\n",img_name) != 1 || strcmp(img_name,"X") != 0) { fatal("not a valid octave image file"); } if(fscanf(oct_file,"# type: %s\n",img_type) != 1 || strcmp(img_type,"matrix") != 0) { fatal("not a valid octave image file"); } if(fscanf(oct_file,"# rows: %d\n",&img_rows) != 1) { fatal("error reading octave image file"); } if(fscanf(oct_file,"# columns: %d\n",&img_cols) != 1) { fatal("error reading octave image file"); } if((img = (unsigned short **) malloc(img_rows*sizeof(unsigned short *))) == NULL) { fatal("out of memory"); } if((img[0] = (unsigned short *) malloc(img_rows*img_cols*sizeof(unsigned short))) == NULL) { fatal("out of memory"); } for(row=1; row cmap_rows) mat_val = cmap_rows; img[row][col] = mat_val; } } pbm = pgm = ppm = 0; if(cmap_rows == 2 && gray && ((rgb[0][0] == 0 && rgb[1][0] == 255) || (rgb[0][0] == 255 && rgb[1][0] == 0))) { /* Create a bitmap only if there are two colormap entries and they are black and white. */ pbm = 1; } else if(gray) { /* If not a bitmap, create a gray scale image if the entries within each row of the color map are equal. */ pgm = 1; } else { /* Otherwise create a full color image. */ ppm = 1; } if(rawbits) { if(pbm) { printf("P4\n"); printf("%d %d\n",img_cols,img_rows); index = 0; for(row=0; row 2) error ("usage: norm (x [, p])") endif if (isempty (x)) retval = []; return; endif # Do we have a vector or matrix as the first argument? if (rows (x) == 1 || columns (x) == 1) if (nargin == 2) if (isstr (p)) if (strcmp (p, "fro")) retval = sqrt (sum (diag (x' * x))); else error ("norm: unrecognized norm"); endif else if (p == Inf) retval = max (abs (x)); elseif (p == -Inf) retval = min (abs (x)); else retval = sum (abs (x) .^ p) ^ (1/p); endif endif elseif (nargin == 1) retval = sum (abs (x) .^ 2) ^ 0.5; endif else if (nargin == 2) if (isstr (p)) if (strcmp (p, "fro")) retval = sqrt (sum (diag (x' * x))); else error ("norm: unrecognized norm"); endif else if (p == 1) retval = max (sum (abs (real (x)) + abs (imag (x)))); elseif (p == 2) s = svd (x); retval = s (1); elseif (p == Inf) xp = x'; retval = max (sum (abs (real (xp)) + abs (imag (xp)))); endif endif elseif (nargin == 1) s = svd (x); retval = s (1); endif endif endfunction octave-1.1.0/scripts/linear-algebra/null.m100666 415 17 2727 5705045104 16633 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = null (A, tol) # usage: null (A, tol) # null (A) # # Returns an orthonormal basis of the null space of A. # # The dimension of the null space is taken as the number of singular # values of A not greater than tol; the default for tol is # max (size (A)) * sigma_max (A) * eps, where sigma_max (A) is the # maximal singular value of A. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Dec 24, 1993. [U, S, V] = svd (A); [rows, cols] = size (A); s = diag (S); if (nargin == 1) tol = max (size (A)) * s (1) * eps; else (nargin != 2) usage ("null (A [, tol])"); endif rank = sum (s > tol); if (rank < cols) retval = V (:, rank+1:cols); else retval = zeros (cols, 0); endif endfunction octave-1.1.0/scripts/linear-algebra/orth.m100666 415 17 2710 5705044313 16626 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = orth (A, tol) # usage: orth (A, tol) # orth (A) # # Returns an orthonormal basis of the range of A. # # The dimension of the range space is taken as the number of singular # values of A greater than tol; the default for tol is # max (size (A)) * sigma_max (A) * eps, where sigma_max (A) is the # maximal singular value of A. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Dec 24, 1993. [U, S, V] = svd (A); [rows, cols] = size (A); s = diag (S); if (nargin == 1) tol = max (size (A)) * s (1) * eps; elseif (nargin != 2) usage ("orth (A [, tol])"); endif rank = sum (s > tol); if (rank > 0) retval = -U (:, 1:rank); else retval = zeros (rows, 0); endif endfunction octave-1.1.0/scripts/linear-algebra/qzhess.m100666 415 17 4323 5702570462 17177 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [aa, bb, q, z] = qzhess (a, b) # Usage: [aa, bb, q, z] = qzhess (a, b) # # Compute the qz decomposition of the matrix pencil (a - lambda b) # # result: (for Matlab compatibility): # # aa = q*a*z and bb = q*b*z, with q, z orthogonal, and # v = matrix of generalized eigenvectors. # # This ought to be done in a compiled program # # Algorithm taken from Golub and Van Loan, Matrix Computations, 2nd ed. # Written by A. S. Hodel (scotte@eng.auburn.edu) August 1993. if (nargin != 2) error ("usage: [aa, bb, q, z] = qzhess (a, b)"); endif [na, ma] = size (a); [nb, mb] = size (b); if (na != ma || na != nb || nb != mb) error ("qzhess: incompatible dimensions"); endif # Reduce to hessenberg-triangular form. [q, bb] = qr (b); aa = q' * a; q = q'; z = eye (na); for j = 1:(na-2) for i = na:-1:(j+2) # disp (["zero out aa(", num2str(i), ",", num2str(j), ")"]) rot = givens (aa (i-1, j), aa (i, j)); aa ((i-1):i, :) = rot *aa ((i-1):i, :); bb ((i-1):i, :) = rot *bb ((i-1):i, :); q ((i-1):i, :) = rot *q ((i-1):i, :); # disp (["now zero out bb(", num2str(i), ",", num2str(i-1), ")"]) rot = givens (bb (i, i), bb (i, i-1))'; bb (:, (i-1):i) = bb (:, (i-1):i) * rot'; aa (:, (i-1):i) = aa (:, (i-1):i) * rot'; z (:, (i-1):i) = z (:, (i-1):i) * rot'; endfor endfor bb (2, 1) = 0.0; for i = 3:na bb (i, 1:(i-1)) = zeros (1, i-1); aa (i, 1:(i-2)) = zeros (1, i-2); endfor endfunction octave-1.1.0/scripts/linear-algebra/rank.m100666 415 17 2530 5702570227 16612 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = rank (A, tol) # usage: rank (a, tol) # # Return the rank of the matrix a. The rank is taken to be the number # of singular values of a that are greater than tol. # # If the second argument is omitted, it is taken to be # # tol = max (size (a)) * sigma (1) * eps; # # where eps is machine precision and sigma is the largest singular # value of a. if (nargin == 1) sigma = svd (A); tolerance = max (size (A)) * sigma (1) * eps; elseif (nargin == 2) sigma = svd (A); tolerance = tol; else usage ("rank (A)"); endif retval = sum (sigma > tolerance); endfunction octave-1.1.0/scripts/linear-algebra/trace.m100666 415 17 1666 5702570227 16766 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = trace (x) # usage: trace (x) # # Returns the trace (the sum of the diagonal elements) of x. if (nargin != 1) usage ("trace (x)"); endif y = sum (diag (x)); endfunction octave-1.1.0/scripts/miscellaneous/ 40777 415 17 0 5705522372 15403 5ustar jweusersoctave-1.1.0/scripts/miscellaneous/Makefile.in100666 415 17 2476 5673222230 17550 0ustar jweusers# # Makefile for octave's scripts/miscellaneous directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = miscellaneous srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/miscellaneous .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/miscellaneous .PHONY: dist octave-1.1.0/scripts/miscellaneous/bug_report.m100666 415 17 3361 5702570226 20027 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function bug_report () # usage: bug_report # # Have Octave create a bug report template file, invoke your favorite # editor, and submit the report to the bug-octave mailing list when # you are finished editing. if (nargin != 0) warning ("bug_report: ignoring extra arguments"); endif printf ("Please enter a one-line description of your bug report.\n\n"); fflush (stdout); subject = ""; subject = input ("Subject: ", "s"); # XXX FIXME XXX -- really need a better system command, one that will # automatically send output from the command to stdout... prefs = octave_tmp_file_name (); if (! isempty (prefs)) fopen (prefs, "w"); dump_prefs (prefs); fclose (prefs); endif cmd = "octave-bug"; if (length (subject) > 0) cmd = sprintf ("%s -s \"%s\"", cmd, subject); endif if (! isempty (prefs)) cmd = sprintf ("%s %s", cmd, prefs); endif system (sprintf ("%s > /dev/tty", cmd)); if (! isempty (prefs)) system (sprintf ("rm -f %s", prefs)); endif endfunction octave-1.1.0/scripts/miscellaneous/dump_1_pref.m100666 415 17 2156 5702570226 20061 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function dump_1_pref (file, var) if (nargin != 2) usage ("dump_1_pref (file, var)"); endif eval (sprintf ("tmp = %s;", var)); if (isstr (tmp)) fprintf (file, " %s = \"%s\"\n", var, undo_string_escapes (tmp)); elseif (is_scalar (tmp)) fprintf (file, " %s = %g\n", var, tmp); else fprintf (file, " %s = \"wrong type arg\"\n", var); endif endfunction octave-1.1.0/scripts/miscellaneous/dump_prefs.m100666 415 17 5345 5702567624 20037 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function dump_prefs (file) # usage: dump_prefs (file) # # Have Octave dump all the current user preference variables to FILE # in a format that can be parsed by Octave later. If FILE is omitted, # the listing is printed to stdout. if (nargin == 0) file = stdout; endif # XXX FIXME XXX -- vectors of strings would be really useful here... # XXX FIXME XXX -- maybe this should be a built-in function so that we # wouldn't have to remember to update it each time the list of # preference variables changes dump_1_pref (file, "EDITOR"); dump_1_pref (file, "IMAGEPATH"); dump_1_pref (file, "INFO_FILE"); dump_1_pref (file, "LOADPATH"); dump_1_pref (file, "OCTAVE_VERSION"); dump_1_pref (file, "PAGER"); dump_1_pref (file, "PS1"); dump_1_pref (file, "PS2"); dump_1_pref (file, "automatic_replot"); dump_1_pref (file, "whitespace_in_literal_matrix"); dump_1_pref (file, "default_save_format"); dump_1_pref (file, "do_fortran_indexing"); dump_1_pref (file, "empty_list_elements_ok"); dump_1_pref (file, "eps"); dump_1_pref (file, "gnuplot_binary"); dump_1_pref (file, "ignore_function_time_stamp"); dump_1_pref (file, "implicit_str_to_num_ok"); dump_1_pref (file, "ok_to_lose_imaginary_part"); dump_1_pref (file, "output_max_field_width"); dump_1_pref (file, "output_precision"); dump_1_pref (file, "page_screen_output"); dump_1_pref (file, "prefer_column_vectors"); dump_1_pref (file, "prefer_zero_one_indexing"); dump_1_pref (file, "print_answer_id_name"); dump_1_pref (file, "print_empty_dimensions"); dump_1_pref (file, "propagate_empty_matrices"); dump_1_pref (file, "resize_on_range_error"); dump_1_pref (file, "return_last_computed_value"); dump_1_pref (file, "save_precision"); dump_1_pref (file, "silent_functions"); dump_1_pref (file, "split_long_rows"); dump_1_pref (file, "treat_neg_dim_as_zero"); dump_1_pref (file, "warn_assign_as_truth_value"); dump_1_pref (file, "warn_comma_in_global_decl"); dump_1_pref (file, "warn_divide_by_zero"); endfunction octave-1.1.0/scripts/miscellaneous/etime.m100666 415 17 3462 5704613103 16756 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function secs = etime (t1, t0) # usage: etime (t1, t0) # # Return the difference between t1 and t0 in seconds. The arguments # are expected to be vectors in the form returned by clock (). # # See also: tic, toc, clock, cputime if (nargin != 2) usage ("etime (t1, t0)"); endif if (is_vector (t1) && length (t1) == 6 && is_vector (t0) && length (t0) == 6) if (t1 (1) != t0 (1)) error ("etime: can't handle timings over year boundaries yet") endif # XXX FIXME XXX -- could check here to ensure that t1 and t0 really do # make sense as vectors returned from clock(). days_in_months = [31, 28, 31, 30, 31, 30 31, 31, 30, 31, 30, 31]; if (is_leap_year (t1 (1))) days_in_months (2) = days_in_months (2) + 1; endif d1 = sum (days_in_months (1:(t1 (2) - 1))) + t1 (3); d0 = sum (days_in_months (1:(t0 (2) - 1))) + t0 (3); s1 = 86400 * d1 + 3600 * t1 (4) + 60 * t1 (5) + t1 (6); s0 = 86400 * d0 + 3600 * t0 (4) + 60 * t0 (5) + t0 (6); secs = s1 - s0; else error ("etime: args are not 6-element vectors"); endif endfunction octave-1.1.0/scripts/miscellaneous/is_leap_year.m100666 415 17 2213 5702570224 20304 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = is_leap_year (year) # usage: is_leap_year (year) # # Return 1 if the given year is a leap year; otherwise, return 0. # With no arguments, use the current year. if (nargin > 1) usage ("is_leap_year (year)"); endif if (nargin == 0) t = clock (); year = t (1); endif retval = ((rem (year, 4) == 0 && rem (year, 100) != 0) ... || rem (year, 400) == 0); endfunction octave-1.1.0/scripts/miscellaneous/list_primes.m100666 415 17 3236 5702570447 20217 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = list_primes (n) # usage: list_primes (n) # # List the first n primes. If n is unspecified, the first 30 primes # are listed. # # The algorithm used is from page 218 of the TeXbook. if (nargin > 0) if (! is_scalar (n)) error ("list_primes: argument must be a scalar"); endif endif if (nargin == 0) n = 30; endif if (n == 1) retval = 2; return; endif if (n == 2) retval = [2; 3]; return; endif retval = zeros (1, n); retval (1) = 2; retval (2) = 3; n = n - 2; i = 3; p = 5; while (n > 0) is_prime = 1; is_unknown = 1; d = 3; while (is_unknown) a = fix (p / d); if (a <= d) is_unknown = 0; endif if (a * d == p) is_prime = 0; is_unknown = 0; endif d = d + 2; endwhile if (is_prime) retval (i++) = p; n--; endif p = p + 2; endwhile endfunctionoctave-1.1.0/scripts/miscellaneous/menu.m100666 415 17 3464 5702570224 16625 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function num = menu (t, ...) # usage: menu (title, opt1, ...) # # See also: disp, printf, input if (nargin < 2) usage ("menu (title, opt1, ...)"); endif # Force pending output to appear before the menu. fflush (stdout); # Don't send the menu through the pager since doing that can cause # major confusion. save_page_screen_output = page_screen_output; unwind_protect page_screen_output = "false"; if (! isempty (t)) disp (t); printf ("\n"); endif nopt = nargin - 1; while (1) va_start (); for i = 1:nopt printf (" [%2d] ", i); disp (va_arg ()); endfor printf ("\n"); s = ""; s = input ("pick a number, any number: ", "s"); if (strcmp (s, "")) printf ("\n"); continue; endif eval (sprintf ("num = %s;", s)); if (! is_scalar (num) || num < 1 || num > nopt) printf ("\nerror: input invalid or out of range\n\n"); else break; endif endwhile unwind_protect_cleanup page_screen_output = save_page_screen_output; end_unwind_protect endfunction octave-1.1.0/scripts/miscellaneous/texas_lotto.m100666 415 17 2507 5702570223 20222 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function picks = texas_lotto () # usage: texas_lotto # # Pick 6 unique numbers between 1 and 50 that are guaranteed to win # the Texas Lotto. # # See also: rand if (nargin != 0) warning ("win_texas_lotto: ignoring extra arguments"); endif picks = zeros (1,6); picks (1) = round (50-49*(1-rand)); n = 2; while (n < 7) tmp = round (50-49*(1-rand)); equal = 0; for i = 1:n if (tmp == picks (i)) equal = 1; break; endif endfor if (! equal) picks (n) = tmp; n++; endif endwhile picks = sort (picks); endfunction octave-1.1.0/scripts/miscellaneous/tic.m100666 415 17 1740 5702570222 16431 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function tic () # usage: tic # # Set a wall-clock timer. # # See also: toc, clock, etime, cputime if (nargin != 0) warning ("tic: ignoring extra arguments"); endif global _time_tic_called; _time_tic_called = clock (); endfunction octave-1.1.0/scripts/miscellaneous/toc.m100666 415 17 2313 5702570222 16434 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function secs = toc () # usage: toc # # Return the difference between the current wall-clock time and the # time that the function tic () was last called, in seconds. # # See also: tic, clock, etime, cputime if (nargin != 0) warning ("toc: ignoring extra arguments"); endif global _time_tic_called; if (exist ("_time_tic_called")) secs = etime (clock (), _time_tic_called); else warning ("toc called before timer set"); secs = []; endif endfunction octave-1.1.0/scripts/miscellaneous/version.m100666 415 17 1727 5702570221 17343 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function vs = version () # usage: version # # Return the Octave version number as a string. # # See also: OCTAVE_VERSION if (nargin != 0) warning ("version: ignoring extra arguments"); endif vs = OCTAVE_VERSION; endfunction octave-1.1.0/scripts/plot/ 40777 415 17 0 5705522374 13520 5ustar jweusersoctave-1.1.0/scripts/plot/Makefile.in100666 415 17 2432 5673222227 15661 0ustar jweusers# # Makefile for octave's scripts/plot directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = plot srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/plot .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/plot .PHONY: dist octave-1.1.0/scripts/plot/axis.m100666 415 17 3342 5702570220 14727 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function axis (ax) # usage: axis () # axis ([xmin, xmax]) # axis ([xmin, xmax, ymin, ymax]) # axis ([xmin, xmax, ymin, ymax, zmin, zmax]) # # Sets the axis limits. # # With no arguments, turns autoscaling on. # # If your plot is already drawn, then you need to REPLOT before # the new axis limits will take effect. if (nargin > 1) usage ("axis ([xmin, xmax, ymin, ymax, zmin, zmax])"); endif if (nargin == 0) set autoscale; elseif (is_vector (ax)) len = length (ax); if (len != 2 && len != 4 && len != 6) error ("axis: expecting vector with 2, 4, or 6 elements"); endif if (len > 1) eval (sprintf ("set xrange [%g:%g];", ax (1), ax (2))); endif if (len > 3) eval (sprintf ("set yrange [%g:%g];", ax (3), ax (4))); endif if (len > 5) eval (sprintf ("set zrange [%g:%g];", ax (5), ax (6))); endif else error ("axis: expecting no args, or a vector with 2, 4, or 6 elements"); endif endfunction octave-1.1.0/scripts/plot/bar.m100666 415 17 5457 5702570220 14540 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [xb, yb] = bar (x, y) # usage: [xb, yb] = bar (x, y) # # Given two vectors of x-y data, bar produces a `bar' graph. # # If only one argument is given, it is taken as a vector of y-values # and the x coordinates are taken to be the indices of the elements. # # If two output arguments are specified, the data are generated but # not plotted. For example, # # bar (x, y); # # and # # [xb, yb] = bar (x, y); # plot (xb, yb); # # are equivalent. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # stairs, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 1) if (is_vector (x)) len = 3 * length (x) + 1; tmp_xb = tmp_yb = zeros (len, 1); tmp_xb(1) = 0.5; tmp_yb(1) = 0; k = 1; for i = 2:3:len tmp_xb(i) = k-0.5; tmp_xb(i+1) = k+0.5; tmp_xb(i+2) = k+0.5; tmp_yb(i) = x(k); tmp_yb(i+1) = x(k); tmp_yb(i+2) = 0.0; k++; endfor else error ("bar: argument must be a vector"); endif elseif (nargin == 2) if (is_vector (x) && is_vector (y)) xlen = length (x); ylen = length (y); if (xlen == ylen) len = 3 * xlen + 1; tmp_xb = tmp_yb = zeros (len, 1); delta = (x(2) - x(1)) / 2.0; tmp_xb(1) = x(1) - delta; tmp_yb(1) = 0.0; k = 1; for i = 2:3:len tmp_xb(i) = tmp_xb(i-1); tmp_xb(i+1) = tmp_xb(i) + 2.0 * delta; tmp_xb(i+2) = tmp_xb(i+1); tmp_yb(i) = y(k); tmp_yb(i+1) = y(k); tmp_yb(i+2) = 0.0; if (k < xlen) delta = (x(k+1) - x(k)) / 2.0; if (x(k+1) < x(k)) error ("bar: x vector values must be in ascending order"); endif endif k++; endfor else error ("bar: arguments must be the same length"); endif else error ("bar: arguments must be vectors"); endif else usage ("[xb, yb] = bar (x, y)"); endif if (nargout == 0) plot (tmp_xb, tmp_yb); else xb = tmp_xb; yb = tmp_yb; endif endfunction octave-1.1.0/scripts/plot/contour.m100666 415 17 4512 5702570217 15462 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function contour (z, n, x, y) # usage: contour (z, n, x, y) # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 1) n = 10; endif if (nargin == 1 || nargin == 2) if (is_matrix (z)) set nosurface; set contour; set cntrparam bspline command = sprintf ("set cntrparam levels %d", n); eval (command); set noparametric; set view 0, 0, 1.9, 1 gsplot z w l 1; else error ("mesh: argument must be a matrix"); endif elseif (nargin == 4) if (is_vector (x) && is_vector (y) && is_matrix (z)) xlen = length (x); ylen = length (y); if (xlen == rows (z) && ylen == columns (z)) if (rows (x) == 1) x = x'; endif len = 3 * ylen; zz = zeros (xlen, ylen); k = 1; for i = 1:3:len zz(:,i) = x; zz(:,i+1) = y(k) * ones (xlen, 1); zz(:,i+2) = z(:,k); k++; endfor set nosurface set contour set cntrparam bspline command = sprintf ("set cntrparam levels %d", n); eval (command); set parametric; set view 0, 0, 1.9, 1 gsplot zz w l 1; else msg = "mesh: rows (z) must be the same as length (x) and"; msg = sprintf ("%s\ncolumns (z) must be the same as length (y)", msg); error (msg); endif else error ("mesh: x and y must be vectors and z must be a matrix"); endif else usage ("mesh (z, levels, x, y)"); endif endfunction octave-1.1.0/scripts/plot/grid.m100666 415 17 2610 5702570216 14712 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function grid (x) # usage: grid ("on" | "off") # # Turn grid lines on or off for plotting. # # If the argument is omitted, "on" is assumed. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 0) set grid; elseif (nargin == 1) if (isstr (x)) if (strcmp ("off", x)) set nogrid; elseif (strcmp ("on", x)) set grid; else usage ("grid (\"on\" | \"off\")"); endif else error ("grid: argument must be a string"); endif else error ("usage: grid (\"on\" | \"off\")"); endif endfunction octave-1.1.0/scripts/plot/hist.m100666 415 17 5257 5702570216 14746 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [nn, xx] = hist (y, x) # usage: [NN, XX] = hist (Y, X) or hist (Y, X) # # Produce histogram counts or plots. # # With one vector input argument, plot a histogram of the values with # 10 bins. The range of the histogram bins is determined by the range # of the data. # # Given a second scalar argument, use that as the number of bins. # # Given a second vector argument, use that as the centers of the bins, # with the width of the bins determened from the adjacent values in # the vector. # # Extreme values are lumped in the first and last bins. # # With two output arguments, produce the values NN and XX such that # bar (XX, NN) will plot the histogram. # # See also: bar if (nargin < 1 || nargin > 2) usage ("[nn, xx] = hist (y, x)"); endif if (is_vector (y)) max_val = max (y); min_val = min (y); else error ("hist: first argument must be a vector"); endif if (nargin == 1) n = 10; delta = (max_val - min_val) / n / 2; x = linspace (min_val+delta, max_val-delta, n); cutoff = x + delta; elseif (nargin == 2) if (is_scalar (x)) n = x; if (n <= 0) error ("hist: number of bins must be positive"); endif delta = (max_val - min_val) / n / 2; x = linspace (min_val+delta, max_val-delta, n); cutoff = x + delta; elseif (is_vector (x)) tmp = sort (x); if (any (tmp != x)) warning ("hist: bin values not sorted on input"); x = tmp; endif n = length (x); cutoff = zeros (1, n-1); for i = 1:n-1 cutoff (i) = (x (i) + x (i+1)) / 2; endfor else error ("hist: second argument must be a scalar or a vector"); endif endif freq = zeros (1, n); freq (1) = sum (y < cutoff (1)); for i = 2:n-1 freq (i) = sum (y >= cutoff (i-1) & y < cutoff (i)); endfor freq (n) = sum (y >= cutoff (n-1)); if (nargout == 2) nn = freq; xx = x; else bar (x, freq); endif endfunction octave-1.1.0/scripts/plot/loglog.m100666 415 17 2371 5702570215 15253 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function loglog (...) # usage: loglog (x, y) # loglog (x1, y1, x2, y2, ...) # loglog (x, y, fmt) # # Make a 2D plot of y versus x using a log scale for the x axis. # # See the help message for the plot command for a description of how # the arguments are interpreted. # # See also: plot, semilogy, loglog, polar, mesh, contour, bar, stairs, # gplot, gsplot, replot, xlabel, ylabel, title set logscale x; set logscale y; set nopolar; plot_int ("loglog", all_va_args); endfunction octave-1.1.0/scripts/plot/mesh.m100666 415 17 4174 5702570215 14727 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function mesh (x, y, z) # usage: mesh (x, y, z) # # See also: plot, semilogx, semilogy, loglog, polar, meshdom, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 1) z = x; if (is_matrix (z)) set hidden3d; set data style lines; set surface; set nocontour; set noparametric; set view 60, 30, 1, 1 gsplot (z); else error ("mesh: argument must be a matrix"); endif elseif (nargin == 3) if (is_vector (x) && is_vector (y) && is_matrix (z)) xlen = length (x); ylen = length (y); if (xlen == rows (z) && ylen == columns (z)) if (rows (x) == 1) x = x'; endif len = 3 * ylen; zz = zeros (xlen, ylen); k = 1; for i = 1:3:len zz(:,i) = x; zz(:,i+1) = y(k) * ones (xlen, 1); zz(:,i+2) = z(:,k); k++; endfor set hidden3d; set data style lines; set surface; set nocontour; set parametric; set view 60, 30, 1, 1 gsplot (zz); else msg = "mesh: rows (z) must be the same as length (x) and"; msg = sprintf ("%s\ncolumns (z) must be the same as length (y)", msg); error (msg); endif else error ("mesh: x and y must be vectors and z must be a matrix"); endif else usage ("mesh (z)"); endif endfunction octave-1.1.0/scripts/plot/meshdom.m100666 415 17 3257 5702570214 15427 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [xx, yy] = meshdom (x, y) # usage: [xx, yy] = meshdom (x, y) # # Given vectors of x and y coordinates, return two matrices # corresponding to the x and y coordinates of the mesh. # # See the file sombrero.m for an example of using mesh and meshdom. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 2) if (is_vector (x) && is_vector (y)) xlen = length (x); ylen = length (y); xx = zeros (ylen, xlen); yy = zeros (ylen, xlen); y = y (ylen:-1:1); if (columns (x) == 1) x = x'; endif if (rows (y) == 1) y = y'; endif for i = 1:ylen xx(i,:) = x; endfor for i = 1:xlen yy(:,i) = y; endfor else error ("meshdom: arguments must be vectors"); endif else usage ("[xx, yy] = meshdom (x, y)"); endif endfunction octave-1.1.0/scripts/plot/plot.m100666 415 17 4656 5702570214 14755 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot (...) # usage: plot (x, y) # plot (x1, y1, x2, y2, ...) # plot (x, y, fmt) # # If the first argument is a vector and the second is a matrix, the # the vector is plotted versus the columns (or rows) of the matrix. # (using whichever combination matches, with columns tried first.) # # If the first argument is a matrix and the second is a vector, the # the columns (or rows) of the matrix are plotted versus the vector. # (using whichever combination matches, with columns tried first.) # # If both arguments are vectors, the elements of y are plotted versus # the elements of x. # # If both arguments are matrices, the columns of y are plotted versus # the columns of x. In this case, both matrices must have the same # number of rows and columns and no attempt is made to transpose the # arguments to make the number of rows match. # # If both arguments are scalars, a single point is plotted. # # If only one argument is given, it is taken as the set of y # coordinates and the x coordinates are taken to be the indices of the # elements, starting with 1. # # To see possible options for FMT please see plot_opt. # # Examples: # # plot (x, y, "@12", x, y2, x, y3, "4", x, y4, "+") # # y will be plotted with points of type 2 ("+") and color 1 (red). # y2 will be plotted with lines. # y3 will be plotted with lines of color 4. # y4 will be plotted with points which are "+"s. # # plot (b, "*") # # b will be plotted with points of type "*". # # See also: semilogx, semilogy, loglog, polar, mesh, contour, plot_opt # bar, stairs, gplot, gsplot, replot, xlabel, ylabel, title set nologscale; set nopolar; plot_int ("plot", all_va_args); endfunction octave-1.1.0/scripts/plot/plot_2_m_m.m100666 415 17 2714 5702570213 16016 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_2_m_m (x, y, fmt) if (nargin < 2 || nargin > 3) msg = sprintf ("plot_2_m_m (x, y)\n"); msg = sprintf ("%s plot_2_m_m (x, y, fmt)", msg); usage (msg); elseif (nargin == 2) fmt = ""; endif [x_nr, x_nc] = size (x); [y_nr, y_nc] = size (y); if (x_nr == y_nr && x_nc == y_nc) if (x_nc > 0) tmp = [x, y]; cmd = sprintf ("gplot tmp(:,%d:%d:%d) %s", 1, x_nc, x_nc+1, fmt); for i = 2:x_nc cmd = sprintf ("%s, tmp(:,%d:%d:%d) %s", cmd, i, x_nc, x_nc+i, fmt); endfor eval (cmd); else error ("plot_2_m_m: arguments must be a matrices"); endif else error ("plot_2_m_m: matrix dimensions must match"); endif endfunction octave-1.1.0/scripts/plot/plot_2_m_v.m100666 415 17 3140 5702570213 16021 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_2_m_v (x, y, fmt) if (nargin < 2 || nargin > 3) msg = sprintf ("plot_2_m_v (x, y)\n"); msg = sprintf ("%s plot_2_m_v (x, y, fmt)", msg); usage (msg); elseif (nargin == 2) fmt = ""; endif [x_nr, x_nc] = size (x); [y_nr, y_nc] = size (y); if (y_nr == 1) y = y'; tmp = y_nr; y_nr = y_nc; y_nc = tmp; endif if (x_nr == y_nr) 1; elseif (x_nc == y_nr) x = x'; tmp = x_nr; x_nr = x_nc; x_nc = tmp; else error ("plot_2_m_v: matrix dimensions must match"); endif if (x_nc > 0) tmp = [x, y]; cmd = sprintf ("gplot tmp(:,%d:%d:%d) %s", 1, x_nc, x_nc+1, fmt); for i = 2:x_nc cmd = sprintf ("%s, tmp(:,%d:%d:%d) %s", cmd, i, x_nc-i+1, x_nc+1, fmt); endfor eval (cmd); else error ("plot_2_m_v: arguments must be a matrices"); endif endfunction octave-1.1.0/scripts/plot/plot_2_s_s.m100666 415 17 2360 5702570212 16026 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_2_s_s (x, y, fmt) if (nargin < 2 || nargin > 3) msg = sprintf ("plot_2_s_s (x, y)"); msg = sprintf ("%s plot_2_s_s (x, y, fmt)", msg); usage (msg); elseif (nargin == 2) fmt = ""; endif [x_nr, x_nc] = size (x); [y_nr, y_nc] = size (y); if (x_nr == 1 && x_nr == y_nr && x_nc == 1 && x_nc == y_nc) tmp = [x, y]; cmd = sprintf ("gplot tmp %s", fmt); eval (cmd); else error ("plot_2_s_s: arguments must be scalars"); endif endfunction octave-1.1.0/scripts/plot/plot_2_v_m.m100666 415 17 3126 5702570211 16023 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_2_v_m (x, y, fmt) if (nargin < 2 || nargin > 3) msg = sprintf ("plot_2_v_m (x, y)\n"); msg = sprintf ("%s plot_2_v_m (x, y, fmt)", msg); usage (msg); elseif (nargin == 2) fmt = ""; endif [x_nr, x_nc] = size (x); [y_nr, y_nc] = size (y); if (x_nr == 1) x = x'; tmp = x_nr; x_nr = x_nc; x_nc = tmp; endif if (x_nr == y_nr) 1; elseif (x_nr == y_nc) y = y'; tmp = y_nr; y_nr = y_nc; y_nc = tmp; else error ("plot_2_v_m: matrix dimensions must match"); endif if (y_nc > 0) tmp = [x, y]; cmd = sprintf ("gplot tmp(:,%d:%d:%d) %s", 1, x_nc, x_nc+1, fmt); for i = 2:y_nc cmd = sprintf ("%s, tmp(:,%d:%d:%d) %s", cmd, 1, i, i+1, fmt); endfor eval (cmd); else error ("plot_2_v_m: arguments must be a matrices"); endif endfunction octave-1.1.0/scripts/plot/plot_2_v_v.m100666 415 17 2552 5702570210 16035 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_2_v_v (x, y, fmt) if (nargin < 2 || nargin > 3) msg = sprintf ("plot_2_v_v (x, y)\n"); msg = sprintf ("%s plot_2_v_v (x, y, fmt)", msg); usage (msg); elseif (nargin == 2) fmt = ""; endif [x_nr, x_nc] = size (x); [y_nr, y_nc] = size (y); if (x_nr == 1) x = x'; tmp = x_nr; x_nr = x_nc; x_nc = tmp; endif if (y_nr == 1) y = y'; tmp = y_nr; y_nr = y_nc; y_nc = tmp; endif if (x_nr != y_nr) error ("plot_2_v_v: vector lengths must match"); endif tmp = [x, y]; cmd = sprintf ("gplot tmp %s", fmt); eval (cmd); endfunction octave-1.1.0/scripts/plot/plot_int.m100666 415 17 4042 5702570210 15610 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_int (caller, ...) if (nargin == 2) plot_int_1 (va_arg (), ""); elseif (nargin > 2) first_plot = 1; hold_state = ishold; unwind_protect x = va_arg (); nargin = nargin - 2; x_set = 1; y_set = 0; # Gather arguments, decode format, and plot lines. while (nargin-- > 0) fmt = ""; new = va_arg (); if (isstr (new)) if (! x_set) error ("plot: no data to plot"); endif fmt = plot_opt (caller, new); if (! y_set) plot_int_1 (x, fmt) else plot_int_2 (x, y, fmt) endif hold on x_set = 0; y_set = 0; elseif (x_set) if (y_set) plot_int_2 (x, y, fmt); hold on x = new; y_set = 0; else y = new; y_set = 1; endif else x = new; x_set = 1; endif endwhile # Handle last plot. if (x_set) if (y_set) plot_int_2 (x, y, fmt); else plot_int_1 (x, fmt); endif endif unwind_protect_cleanup if (! hold_state) hold off endif end_unwind_protect else msg = sprintf ("%s (x)\n", caller); msg = sprintf ("%s %s (x, y)\n", msg, caller); msg = sprintf ("%s %s (x2, y1, x2, y2)\n", msg, caller); msg = sprintf ("%s %s (x, y, fmt)", msg, caller); usage (msg); endif endfunction octave-1.1.0/scripts/plot/plot_int_1.m100666 415 17 2336 5702570207 16042 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_int_1 (x1, fmt) if (nargin < 1 || nargin > 2) usage ("plot_int_1 (x1, fmt)"); endif if (nargin == 1) fmt = ""; endif if (! isstr (fmt)) error ("plot_int_1: fmt must be a string"); endif [nr, nc] = size (x1); if (nr == 1) x1 = x1'; tmp = nr; nr = nc; nc = tmp; endif x1_i = imag (x1); if (any (any (x1_i))) x2 = x1_i; x1 = real (x1); else x2 = x1; x1 = (1:nr)'; endif plot_int_2 (x1, x2, fmt); endfunction octave-1.1.0/scripts/plot/plot_int_2.m100666 415 17 2750 5702570207 16043 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function plot_int_2 (x1, x2, fmt) if (nargin < 2 || nargin > 3) usage ("plot_int_2 (x1, x2, fmt)"); endif if (nargin == 2) fmt = ""; endif if (! isstr (fmt)) error ("plot_int_2: fmt must be a string"); endif if (any (any (imag (x1)))) x1 = real (x1); endif if (any (any (imag (x2)))) x2 = real (x2); endif if (is_scalar (x1)) if (is_scalar (x2)) plot_2_s_s (x1, x2, fmt); endif elseif (is_vector (x1)) if (is_vector (x2)) plot_2_v_v (x1, x2, fmt); elseif (is_matrix (x2)) plot_2_v_m (x1, x2, fmt); endif elseif (is_matrix (x1)) if (is_vector (x2)) plot_2_m_v (x1, x2, fmt); elseif (is_matrix (x2)) plot_2_m_m (x1, x2, fmt); endif endif endfunction octave-1.1.0/scripts/plot/plot_opt.m100666 415 17 12757 5702570206 15661 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. # Originally written by Rick Niles . function fmt = plot_opt (caller, opt) # usage: fmt = plot_opt (caller, opt) # # Decode plot option strings. # # If OPT is a valid option string, return a string of the form "w l 2" # ("with lines 2"). Uses abbreviations for the options to avoid # overrunning gnuplot's command line buffer unnecessarily. # # OPT can currently be some combination of the following: # # "-" for lines plot style (default). # "." for dots plot style. # "@" for points plot style. # "-@" for linespoints plot style. # "^" for impulses plot style. # "L" for steps plot style. # "#" for boxes plot style. # "~" for errorbars plot style. # "#~" for boxerrorbars plot style. # "n" with n in 1-6 (wraps at 8), plot color # "nm" with m in 1-6 (wraps at 6), point style (only valid with "@" or "-@") # "c" where c is one of ["r", "g", "b", "m", "c", "w"] colors. # # Special points formats: # # "+", "*", "o", "x" will display points in that style. # # The legend may be fixed to include the name of the variable # plotted in some future version of Octave. # # The color line styles have the following meanings on terminals # that support color. # # Number Gnuplot colors (lines)points style # 1 red "*" # 2 green "+" # 3 blue "o" # 4 magenta "x" # 5 cyan house # 6 brown there exists set_color = 0; set_symbol = 0; set_lines = 0; set_dots = 0; set_points = 0; set_impulses = 0; set_steps = 0; set_boxes = 0; set_errbars = 0; more = 1; WITH = "w"; LINES = "l"; LINESPOINTS = "linesp"; BOXERRORBARS = "boxer"; BOXES = "boxes"; POINTS = "p"; DOTS = "d"; IMPULSES = "i"; STEPS = "s"; ERRORBARS = "e"; if (nargin != 2) usage ("plot_opt (opt)"); endif if (! isstr (opt)) error ("plot_opt: argument must be a string"); endif while (more) # First get next char. if (max (size (opt)) > 1) [char, opt] = sscanf (opt, "%c %s"); else char = opt; more = 0; endif # Now set flags based on char. if (strcmp (char, "-")) set_lines = 1; elseif (strcmp (char, ".")) set_dots = 1; elseif (strcmp (char, "@")) set_points = 1; elseif (strcmp (char, "^")) set_impulses = 1; elseif (strcmp (char, "L")) set_steps = 1; elseif (strcmp (char, "~")) set_errbars = 1; elseif (strcmp (char, "#")) set_boxes = 1; elseif (strcmp (char, "0") || strcmp (char, "1") ... || strcmp (char, "2") || strcmp (char, "3") ... || strcmp (char, "4") || strcmp (char, "5") ... || strcmp (char, "6") || strcmp (char, "7") ... || strcmp (char, "8") || strcmp (char, "9")) if (set_color) set_points = 1; symbol = char; set_symbol = 1; else color = char; set_color = 1; endif elseif (strcmp (char, "r")) set_color = 1; color = "1"; elseif (strcmp (char, "g")) set_color = 1; color = "2"; elseif (strcmp (char, "b")) set_color = 1; color = "3"; elseif (strcmp (char, "m")) set_color = 1; color = "4"; elseif (strcmp (char, "c")) set_color = 1; color = "5"; elseif (strcmp (char, "w")) set_color = 1; color = "6"; elseif (strcmp (char, "*")) set_points = 1; set_symbol = 1; symbol = "1"; elseif (strcmp (char, "+")) set_points = 1; set_symbol = 1; symbol = "2"; elseif (strcmp (char, "o")) set_points = 1; set_symbol = 1; symbol = "3"; elseif (strcmp (char, "x")) set_points = 1; set_symbol = 1; symbol = "4"; else error (sprintf ("%s: unrecognized format character %s", caller, char)); endif endwhile # Now create format string. fmt = WITH; if (set_lines) if (set_points) fmt = strcat (fmt, " ", LINESPOINTS); else fmt = strcat (fmt, " ", LINES); endif elseif (set_boxes) if (set_errbars) fmt = strcat (fmt, " ", BOXERRORBARS); else fmt = strcat (fmt, " ", BOXES); endif elseif (set_points) fmt = strcat (fmt, " ", POINTS); elseif (set_dots) fmt = strcat (fmt, " ", DOTS); elseif (set_impulses) fmt = strcat (fmt, " ", IMPULSES); elseif (set_steps) fmt = strcat (fmt, " ", STEPS); elseif (set_errbars) fmt = strcat (fmt, " ", ERRORBARS); endif if (strcmp (fmt, WITH)) fmt = strcat (fmt, " ", LINES); endif if (set_color) fmt = strcat (fmt, " ", color); if (set_symbol) fmt = strcat (fmt, " ", symbol); endif elseif (set_symbol) fmt = strcat (fmt, " 1 ", symbol); endif endfunction octave-1.1.0/scripts/plot/polar.m100666 415 17 3074 5702570205 15105 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function polar (x1, x2, fmt) # usage: polar (theta, rho, fmt) # # Make a 2D plot given polar the coordinates theta and rho. # # The optional third argument specifies the line type. # # See also: plot, semilogx, semilogy, loglog, mesh, contour, bar, # stairs, gplot, gsplot, replot, xlabel, ylabel, title set nologscale; set nopolar; if (nargin == 3) if (isstr (fmt)) fmt = plot_opt ("polar", fmt); else error ("polar: third argument must be a string"); endif polar_int_2 (x1, x2, fmt); elseif (nargin == 2) if (isstr (x2)) fmt = plot_opt ("polar", x2); polar_int_1 (x1, fmt); else fmt = ""; polar_int_2 (x1, x2, fmt); endif elseif (nargin == 1) fmt = ""; polar_int_1 (x1, fmt); else usage ("polar (theta, rho, fmt)"); endif endfunction octave-1.1.0/scripts/plot/polar_int.m100666 415 17 6411 5702570205 15755 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function polar_int (theta, rho, fmt) if (nargin == 1) [nr, nc] = size (theta); if (nr == 1) theta = theta'; tmp = nr; nr = nc; nc = tmp; endif theta_i = imag (theta); if (any (theta_i)) rho = theta_i; theta = real (theta); else rho = theta; theta = (1:nr)'; endif endif if (nargin <= 2) if (any (imag (theta))) theta = real (theta); endif if (any (imag (rho))) rho = real (rho); endif if (is_scalar (theta)) if (is_scalar (rho)) x = rho * cos (theta); y = rho * sin (theta); plot_2_s_s (x, y, fmt); endif elseif (is_vector (theta)) if (is_vector (rho)) if (length (theta) != length (rho)) error ("polar: vector lengths must match"); endif if (rows (rho) == 1) rho = rho'; endif if (rows (theta) == 1) theta = theta'; endif x = rho .* cos (theta); y = rho .* sin (theta); plot_2_v_v (x, y, fmt); elseif (is_matrix (rho)) [t_nr, t_nc] = size (theta); if (t_nr == 1) theta = theta'; tmp = t_nr; t_nr = t_nc; t_nc = tmp; endif [r_nr, r_nc] = size (rho); if (t_nr != r_nr) rho = rho' tmp = r_nr; r_nr = r_nc; r_nc = tmp; endif if (t_nr != r_nr) error ("polar: vector and matrix sizes must match"); endif x = diag (cos (theta)) * rho; y = diag (sin (theta)) * rho; plot_2_v_m (x, y, fmt); endif elseif (is_matrix (theta)) if (is_vector (rho)) [r_nr, r_nc] = size (rho); if (r_nr == 1) rho = rho'; tmp = r_nr; r_nr = r_nc; r_nc = tmp; endif [t_nr, t_nc] = size (theta); if (r_nr != t_nr) theta = rho' tmp = t_nr; t_nr = t_nc; t_nc = tmp; endif if (r_nr != t_nr) error ("polar: vector and matrix sizes must match"); endif diag_r = diag (r); x = diag_r * cos (theta); y = diag_r * sin (theta); plot_2_m_v (x, y, fmt); elseif (is_matrix (rho)) if (size (rho) != size (theta)) error ("polar: matrix dimensions must match"); endif x = rho .* cos (theta); y = rho .* sin (theta); plot_2_m_m (x, y, fmt); endif endif else usage ("polar_int (x [, y])"); endif endfunction octave-1.1.0/scripts/plot/polar_int_1.m100666 415 17 2211 5702570205 16167 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function polar_int_1 (theta, fmt) if (nargin != 2) usage ("polar_int_1 (theta, fmt)"); endif [nr, nc] = size (theta); if (nr == 1) theta = theta'; tmp = nr; nr = nc; nc = tmp; endif theta_i = imag (theta); if (any (theta_i)) rho = theta_i; theta = real (theta); else rho = theta; theta = (1:nr)'; endif polar_int_2 (theta, rho, fmt); endfunction octave-1.1.0/scripts/plot/polar_int_2.m100666 415 17 5235 5702570204 16200 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function polar_int_2 (theta, rho, fmt) if (nargin != 3) usage ("polar_int_2 (theta, rho, fmt)"); endif if (any (imag (theta))) theta = real (theta); endif if (any (imag (rho))) rho = real (rho); endif if (is_scalar (theta)) if (is_scalar (rho)) x = rho * cos (theta); y = rho * sin (theta); plot_2_s_s (x, y, fmt); endif elseif (is_vector (theta)) if (is_vector (rho)) if (length (theta) != length (rho)) error ("polar: vector lengths must match"); endif if (rows (rho) == 1) rho = rho'; endif if (rows (theta) == 1) theta = theta'; endif x = rho .* cos (theta); y = rho .* sin (theta); plot_2_v_v (x, y, fmt); elseif (is_matrix (rho)) [t_nr, t_nc] = size (theta); if (t_nr == 1) theta = theta'; tmp = t_nr; t_nr = t_nc; t_nc = tmp; endif [r_nr, r_nc] = size (rho); if (t_nr != r_nr) rho = rho' tmp = r_nr; r_nr = r_nc; r_nc = tmp; endif if (t_nr != r_nr) error ("polar: vector and matrix sizes must match"); endif x = diag (cos (theta)) * rho; y = diag (sin (theta)) * rho; plot_2_v_m (x, y, fmt); endif elseif (is_matrix (theta)) if (is_vector (rho)) [r_nr, r_nc] = size (rho); if (r_nr == 1) rho = rho'; tmp = r_nr; r_nr = r_nc; r_nc = tmp; endif [t_nr, t_nc] = size (theta); if (r_nr != t_nr) theta = rho' tmp = t_nr; t_nr = t_nc; t_nc = tmp; endif if (r_nr != t_nr) error ("polar: vector and matrix sizes must match"); endif diag_r = diag (r); x = diag_r * cos (theta); y = diag_r * sin (theta); plot_2_m_v (x, y, fmt); elseif (is_matrix (rho)) if (size (rho) != size (theta)) error ("polar: matrix dimensions must match"); endif x = rho .* cos (theta); y = rho .* sin (theta); plot_2_m_m (x, y, fmt); endif endif endfunction octave-1.1.0/scripts/plot/semilogx.m100666 415 17 2405 5702570204 15613 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function semilogx (...) # usage: semilogx (x, y) # semilogx (x1, y1, x2, y2, ...) # semilogx (x, y, fmt) # # Make a 2D plot of y versus x using a log scale for the x axis. # # See the help message for the plot command for a description of how # the arguments are interpreted. # # See also: plot, semilogy, loglog, polar, mesh, contour, bar, stairs, # gplot, gsplot, replot, xlabel, ylabel, title set logscale x; set nologscale y; set nopolar; plot_int ("semilogx", all_va_args); endfunction octave-1.1.0/scripts/plot/semilogy.m100666 415 17 2405 5702570203 15613 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function semilogy (...) # usage: semilogy (x, y) # semilogy (x1, y1, x2, y2, ...) # semilogy (x, y, fmt) # # Make a 2D plot of y versus x using a log scale for the x axis. # # See the help message for the plot command for a description of how # the arguments are interpreted. # # See also: plot, semilogx, loglog, polar, mesh, contour, bar, stairs, # gplot, gsplot, replot, xlabel, ylabel, title set nologscale x; set logscale y; set nopolar; plot_int ("semilogy", all_va_args); endfunction octave-1.1.0/scripts/plot/shg.m100666 415 17 2135 5702570203 14544 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function shg () # usage: shg # # Show the graph window. Currently, this is the same as executing # replot without any arguments. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel if (nargin != 0) warning ("shg: ignoring extra arguments"); endif replot endfunction octave-1.1.0/scripts/plot/sombrero.m100666 415 17 2162 5702570202 15612 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function sombrero (n) # usage: sombrero (n) # # Draw a `sombrero' in three dimensions using n grid lines. The # function plotted is # # z = sin (x^2 + y^2) / (x^2 + y^2); if (nargin != 1) usage ("sombrero (n)"); endif x = y = linspace (-8, 8, n)'; [xx, yy] = meshdom (x, y); r = sqrt (xx .^ 2 + yy .^ 2) + eps; z = sin (r) ./ r; mesh (x, y, z); endfunction octave-1.1.0/scripts/plot/stairs.m100666 415 17 5167 5702570201 15276 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [xs, ys] = stairs (x, y) # usage: [xs, ys] = stairs (x, y) # # Given two vectors of x-y data, stairs produces a `stairstep' plot. # # If only one argument is given, it is taken as a vector of y-values # and the x coordiates are taken to be the indices of the elements. # # If two output arguments are specified, the data are generated but # not plotted. For example, # # stairs (x, y); # # and # # [xs, ys] = stairs (x, y); # plot (xs, ys); # # are equivalent. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, gplot, gsplot, replot, xlabel, ylabel, title if (nargin == 1) if (is_vector (x)) len = 2 * length (x); tmp_xs = tmp_ys = zeros (len, 1); k = 0; for i = 1:2:len tmp_xs(i) = k++; tmp_ys(i) = x(k); tmp_ys(i+1) = x(k); tmp_xs(i+1) = k; endfor else error ("stairs: argument must be a vector"); endif elseif (nargin == 2) if (is_vector (x) && is_vector (y)) xlen = length (x); ylen = length (y); if (xlen == ylen) len = 2 * xlen; tmp_xs = tmp_ys = zeros (len, 1); k = 1; len_m2 = len - 2; for i = 1:2:len_m2 tmp_xs(i) = x(k); tmp_ys(i) = y(k); tmp_ys(i+1) = y(k); k++; tmp_xs(i+1) = x(k); if (x(k) < x(k-1)) error ("stairs: x vector values must be in ascending order"); endif endfor tmp_xs(len-1) = x(xlen); delta = x(xlen) - x(xlen-1); tmp_xs(len) = x(xlen) + delta; tmp_ys(len-1) = y(ylen); tmp_ys(len) = y(ylen); else error ("stairs: arguments must be the same length"); endif else error ("stairs: arguments must be vectors"); endif else usage ("[xs, ys] = stairs (x, y)"); endif if (nargout == 0) plot (tmp_xs, tmp_ys); else xs = tmp_xs; ys = tmp_ys; endif endfunction octave-1.1.0/scripts/plot/title.m100666 415 17 2335 5702570200 15103 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function title (text) # usage: title (text) # # Defines a title for a plot. The title will appear the next time a # plot is displayed. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, ylabel if (nargin != 1) usage ("title (text)"); endif if (isstr (text)) command = sprintf ("set title \"%s\"", text); eval (command); else error ("title: text must be a string"); endif endfunction octave-1.1.0/scripts/plot/xlabel.m100666 415 17 2356 5702570177 15251 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function xlabel (text) # usage: xlabel (text) # # Defines a label for the x-axis of a plot. The label will appear the # next time a plot is displayed. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, ylabel, title if (nargin != 1) usage ("xlabel (text)"); endif if (isstr (text)) command = sprintf ("set xlabel \"%s\"", text); eval (command); else error ("xlabel: text must be a string"); endif endfunction octave-1.1.0/scripts/plot/ylabel.m100666 415 17 2356 5702570176 15251 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function ylabel (text) # usage: ylabel (text) # # Defines a label for the y-axis of a plot. The label will appear the # next time a plot is displayed. # # See also: plot, semilogx, semilogy, loglog, polar, mesh, contour, # bar, stairs, gplot, gsplot, replot, xlabel, title if (nargin != 1) usage ("ylabel (text)"); endif if (isstr (text)) command = sprintf ("set ylabel \"%s\"", text); eval (command); else error ("ylabel: text must be a string"); endif endfunction octave-1.1.0/scripts/polynomial/ 40777 415 17 0 5705522375 14726 5ustar jweusersoctave-1.1.0/scripts/polynomial/Makefile.in100666 415 17 2462 5673222227 17071 0ustar jweusers# # Makefile for octave's scripts/polynomial directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = polynomial srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/polynomial .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/polynomial .PHONY: dist octave-1.1.0/scripts/polynomial/compan.m100666 415 17 4264 5705042020 16444 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function A = compan (c) # usage: compan (c) # # Compute the companion matrix corresponding to polynomial vector c. # # In octave a polynomial is represented by it's coefficients (arranged # in descending order). For example a vector c of length n+1 corresponds # to the following nth order polynomial # # p(x) = c(1) x^n + ... + c(n) x + c(n+1). # # The corresponding companion matrix is # _ _ # | -c(2)/c(1) -c(3)/c(1) ... -c(n)/c(1) -c(n+1)/c(1) | # | 1 0 ... 0 0 | # | 0 1 ... 0 0 | # A = | . . . . . | # | . . . . . | # | . . . . . | # |_ 0 0 ... 1 0 _| # # The eigenvalues of the companion matrix are equal to the roots of the # polynomial. # # SEE ALSO: poly, roots, residue, conv, deconv, polyval, polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if (nargin != 1) usage ("compan (vector)"); endif if(is_matrix (c)) error("compan: expecting a vector argument."); endif # Ensure that c is a row vector. if(rows(c) > 1) c = c.'; endif n = length (c); A = diag (ones (n-2, 1), -1); A (1, :) = -c (2:n) /c (1); endfunction octave-1.1.0/scripts/polynomial/conv.m100666 415 17 3467 5705042306 16147 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = conv (a, b) # usage: conv (a, b) # # Convolve two vectors. # # y = conv (a, b) returns a vector of length equal to length (a) + # length (b) -1. # # If a and b are polynomial coefficient vectors, conv returns the # coefficients of the product polynomial. # # SEE ALSO: deconv, poly, roots, residue, polyval, polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if (nargin != 2) usage ("conv(a, b)"); endif if (is_matrix (a) || is_matrix (b)) error("conv: both arguments must be vectors"); endif la = length (a); lb = length (b); ly = la + lb - 1; # Ensure that both vectors are row vectors. if (rows (a) > 1) a = reshape (a, 1, la); endif if (rows (b) > 1) b = reshape (b, 1, lb); endif # Use the shortest vector as the coefficent vector to filter. if (la < lb) if (ly > lb) x = [b, zeros (1, ly - lb)]; else x = b; endif y = filter (a, 1, x); else if(ly > la) x = [a, zeros (1, ly - la)]; else x = a; endif y = filter (b, 1, x); endif endfunction octave-1.1.0/scripts/polynomial/deconv.m100666 415 17 3325 5705042271 16452 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [b, r] = deconv (y, a) # usage: deconv (y, a) # # Deconvolve two vectors. # # [b, r] = deconv (y, a) solves for b and r such that # y = conv(a,b) + r # # If y and a are polynomial coefficient vectors, b will contain the # coefficients of the polynomial quotient and r will be a remander # polynomial of lowest order. # # SEE ALSO: conv, poly, roots, residue, polyval, polyderiv, # polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if (nargin != 2) usage ("deconv (y, a)"); endif if (is_matrix (y) || is_matrix (a)) error("conv: both arguments must be vectors"); endif la = length (a); ly = length (y); lb = ly - la + 1; if (ly > la) b = filter (y, a, [1 zeros (1, ly - la)]); elseif (ly == la) b = filter (y, a, 1); else b = 0; endif b = polyreduce (b); lc = la + length (b) - 1; if (ly == lc) r = y - conv (a, b); else r = [ zeros(1, lc - ly) y] - conv (a, b); endif r = polyreduce (r); endfunction octave-1.1.0/scripts/polynomial/poly.m100666 415 17 3017 5705042253 16155 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = poly (x) # usage: poly (x) # # If A is a square n-by-n matrix, poly (A) is the row vector of # the coefficients of det (z * eye(n) - A), the characteristic # polynomial of A. # # If x is a vector, poly (x) is a vector of coefficients of the # polynomial whose roots are the elements of x. # Written by KH (Kurt.Hornik@neuro.tuwien.ac.at) Dec 24, 1993. if (nargin != 1) usage ("poly (x)"); endif m = min (size (x)); n = max (size (x)); if (m == 0) y = 1; elseif (m == 1) v = x; elseif (m == n) v = eig (x); else usage ("poly (x), where x is a vector or a square matrix"); endif y = [1, zeros (1, n)]; for j = 1:n; y(2:(j+1)) = y(2:(j+1)) - v(j) .* y(1:j); endfor if (all (all (imag (x) == 0))) y = real (y); endif endfunction octave-1.1.0/scripts/polynomial/polyderiv.m100666 415 17 2525 5705042240 17206 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function p = polyderiv (p) # usage: polyderiv (p) # # Returns the coefficients of the derivative of the polynomial whose # coefficients are given by vector p. # # SEE ALSO: poly, polyinteg, polyreduce, roots, conv, deconv, residue, # filter, polyval, polyvalm # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if (nargin != 1) usage ("polyderiv (vector)"); endif if (is_matrix (p)) error ("argument must be a vector"); endif lp = length (p); if (lp == 1) p = 0; return; elseif (lp == 0) p = []; return; end p = p (1:(lp-1)) .* [(lp-1):-1:1]; endfunction octave-1.1.0/scripts/polynomial/polyinteg.m100666 415 17 2633 5705041530 17204 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function p = polyinteg (p) # usage: polyinteg (p) # # Returns the coefficients of the integral the polynomial whose coefficients # are represented by the vector p. # # The constant of integration is zero. # # SEE ALSO: poly, polyderiv, polyreduce, roots, conv, deconv, residue, # filter, polyval, polyvalm # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if(nargin != 1) usage ("polyinteg (vector)"); endif if (is_matrix (p)) error ("argument must be a vector"); endif lp = length (p); if (lp == 0) p = []; return; end if (rows (p) > 1) # Convert to column vector p = p.'; endif p = [ p, 0 ] ./ [ lp:-1:1, 1 ]; endfunction octave-1.1.0/scripts/polynomial/polyreduce.m100666 415 17 2460 5705042232 17343 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function p = polyreduce (p) # usage: polyreduce(c) # # Reduces a polynomial coefficient vector to a minimum number of terms, # i.e. it strips off any leading zeros. # # SEE ALSO: poly, roots, conv, deconv, residue, filter, polyval, polyvalm, # polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. index = find (p == 0); index = find (index == 1:length(index)); if (length (index) == 0) return; endif if(length(p)>1) p = p (index (length (index))+1:length(p)); endif if (length (p) == 0) p = 0; endif endfunction octave-1.1.0/scripts/polynomial/polyval.m100666 415 17 3265 5705042223 16662 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = polyval (c, x) # usage: polyval (c, x) # # Evaluate a polynomial. # # In octave, a polynomial is represented by it's coefficients (arranged # in descending order). For example a vector c of length n+1 corresponds # to the following nth order polynomial # # p(x) = c(1) x^n + ... + c(n) x + c(n+1). # # polyval(c,x) will evaluate the polynomial at the specified value of x. # # If x is a vector or matrix, the polynomial is evaluated at each of the # elements of x. # # SEE ALSO: polyvalm, poly, roots, conv, deconv, residue, filter, # polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if (nargin != 2) usage ("polyval (c, x)"); endif if(is_matrix (c)) error ("poly: first argument must be a vector."); endif if (length (c) == 0) y = c; return; endif n = length (c); y = c (1) * ones (rows (x), columns (x)); for index = 2:n y = c (index) + x .* y; endfor endfunction octave-1.1.0/scripts/polynomial/polyvalm.m100666 415 17 3335 5705042205 17035 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = polyvalm (c, x) # usage: polyvalm (c, x) # # Evaluate a polynomial in the matrix sense. # # In octave, a polynomial is represented by it's coefficients (arranged # in descending order). For example a vector c of length n+1 corresponds # to the following nth order polynomial # # p(x) = c(1) x^n + ... + c(n) x + c(n+1). # # polyvalm(c,X) will evaluate the polynomial in the matrix sense, i.e. matrix # multiplication is used instead of element by element multiplication as is # used in polyval. # # X must be a square matrix. # # SEE ALSO: polyval, poly, roots, conv, deconv, residue, filter, # polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. if(nargin != 2) usage ("polyvalm (c, x)"); endif if (is_matrix (c)) error("poly: first argument must be a vector."); endif if(! is_square (x)) error("poly: second argument must be a square matrix."); endif [v, d] = eig(x); y = v * diag (polyval (c, diag (d))) * v'; endfunction octave-1.1.0/scripts/polynomial/residue.m100666 415 17 20202 5705042127 16645 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [r, p, k, e] = residue (b, a, toler) # usage: [r, p, k, e] = residue (b, a) # # If b and a are vectors of polynomial coefficients, then residue # calculates the partial fraction expansion corresponding to the # ratio of the two polynomials. The vector r contains the residue # terms, p contains the pole values, k contains the coefficients of # a direct polynomial term (if it exists) and e is a vector containing # the powers of the denominators in the partial fraction terms. # Assuming b and a represent polynomials P(s) and Q(s) we have: # # P(s) M r(m) N # ---- = # ------------- + # k(n)*s^(N-n) # Q(s) m=1 (s-p(m))^e(m) n=1 # # (# represents summation) where M is the number of poles (the length of # the r, p, and e vectors) and N is the length of the k vector. # # [r p k e] = residue(b,a,tol) # # This form of the function call may be used to set a tolerance value. # The default value is 0.001. The tolerance value is used to determine # whether poles with small imaginary components are declared real. It is # also used to determine if two poles are distinct. If the ratio of the # imaginary part of a pole to the real part is less than tol, the # imaginary part is discarded. If two poles are farther apart than tol # they are distinct. # # Example: # b = [1, 1, 1]; # a = [1, -5, 8, -4]; # # [r, p, k, e] = residue (b, a) # # returns # # r = [-2, 7, 3]; p = [2, 2, 1]; k = []; e = [1, 2, 1]; # # which implies the following partial fraction expansion # # s^2 + s + 1 -2 7 3 # ------------------- = ----- + ------- + ----- # s^3 - 5s^2 + 8s - 4 (s-2) (s-2)^2 (s-1) # # SEE ALSO: poly, roots, conv, deconv, polyval, polyderiv, polyinteg # Written by Tony Richardson (amr@mpl.ucsd.edu) June 1994. # Here's the method used to find the residues. # The partial fraction expansion can be written as: # # # P(s) D M(k) A(k,m) # ---- = # # ------------- # Q(s) k=1 m=1 (s - pr(k))^m # # (# is used to represent a summation) where D is the number of # distinct roots, pr(k) is the kth distinct root, M(k) is the # multiplicity of the root, and A(k,m) is the residue cooresponding # to the kth distinct root with multiplicity m. For example, # # s^2 A(1,1) A(2,1) A(2,2) # ------------------- = ------ + ------ + ------- # s^3 + 4s^2 + 5s + 2 (s+2) (s+1) (s+1)^2 # # In this case there are two distinct roots (D=2 and pr = [-2 -1]), # the first root has multiplicity one and the second multiplicity # two (M = [1 2]) The residues are actually stored in vector format as # r = [ A(1,1) A(2,1) A(2,2) ]. # # We then multiply both sides by Q(s). Continuing the example: # # s^2 = r(1)*(s+1)^2 + r(2)*(s+1)*(s+2) + r(3)*(s+2) # # or # # s^2 = r(1)*(s^2+2s+1) + r(2)*(s^2+3s+2) +r(3)*(s+2) # # The coefficients of the polynomials on the right are stored in a row # vector called rhs, while the coefficients of the polynomial on the # left is stored in a row vector called lhs. If the multiplicity of # any root is greater than one we'll also need derivatives of this # equation of order up to the maximum multiplicity minus one. The # derivative coefficients are stored in successive rows of lhs and # rhs. # # For our example lhs and rhs would be: # # | 1 0 0 | # lhs = | | # | 0 2 0 | # # | 1 2 1 1 3 2 0 1 2 | # rhs = | | # | 0 2 2 0 2 3 0 0 1 | # # We then form a vector B and a matrix A obtained by evaluating the # polynomials in lhs and rhs at the pole values. If a pole has a # multiplicity greater than one we also evaluate the derivative # polynomials (successive rows) at the pole value. # # For our example we would have # # | 4| | 1 0 0 | | r(1) | # | 1| = | 0 0 1 | * | r(2) | # |-2| | 0 1 1 | | r(3) | # # We then solve for the residues using matrix division. if (nargin < 2 || nargin > 3) usage ("residue (b, a [, toler])"); endif if (nargin == 2) toler = .001; endif # Make sure both polynomials are in reduced form. a = polyreduce (a); b = polyreduce (b); b = b / a(1); a = a / a(1); la = length (a); lb = length (b); # Handle special cases here. if (la == 0 || lb == 0) k = r = p = e = []; return; elseif (la == 1) k = b / a; r = p = e = []; return; endif # Find the poles. p = roots (a); lp = length (p); # Determine if the poles are (effectively) real. index = find (abs (imag (p) ./ real (p)) < toler); if (length (index) != 0) p (index) = real (p (index)); endif # Find the direct term if there is one. if (lb >= la) # Also returns the reduced numerator. [k, b] = deconv (b, a); lb = length (b); else k = []; endif if (lp == 1) r = polyval (b, p); e = 1; return; endif # We need to determine the number and multiplicity of the roots. # # D is the number of distinct roots. # M is a vector of length D containing the multiplicity of each root. # pr is a vector of length D containing only the distinct roots. # e is a vector of length lp which indicates the power in the partial # fraction expansion of each term in p. # Set initial values. We'll remove elements from pr as we find # multiplicities. We'll shorten M afterwards. e = ones (lp, 1); M = zeros (lp, 1); pr = p; D = 1; M(1) = 1; old_p_index = 1; new_p_index = 2; M_index = 1; pr_index = 2; while (new_p_index <= lp) if (abs (p (new_p_index) - p (old_p_index)) < toler) # We've found a multiple pole. M (M_index) = M (M_index) + 1; e (new_p_index) = e (new_p_index-1) + 1; # Remove the pole from pr. pr (pr_index) = []; else # It's a different pole. D++; M_index++; M (M_index) = 1; old_p_index = new_p_index; pr_index++; endif new_p_index++; endwhile # Shorten M to it's proper length M = M (1:D); # Now set up the polynomial matrices. MM = max(M); # Left hand side polynomial lhs = zeros (MM, lb); rhs = zeros (MM, lp*lp); lhs (1, :) = b; rhi = 1; dpi = 1; mpi = 1; while (dpi <= D) for ind = 1:M(dpi) if (mpi > 1 && (mpi+ind) <= lp) cp = [p(1:mpi-1); p(mpi+ind:lp)]; elseif (mpi == 1) cp = p (mpi+ind:lp); else cp = p (1:mpi-1); endif rhs (1, rhi:rhi+lp-1) = prepad (poly (cp), lp); rhi = rhi + lp; endfor mpi = mpi + M (dpi); dpi++; endwhile if (MM > 1) for index = 2:MM lhs (index, :) = prepad (polyderiv (lhs (index-1, :)), lb); ind = 1; for rhi = 1:lp cp = rhs (index-1, ind:ind+lp-1); rhs (index, ind:ind+lp-1) = prepad (polyderiv (cp), lp); ind = ind + lp; endfor endfor endif # Now lhs contains the numerator polynomial and as many derivatives as # are required. rhs is a matrix of polynomials, the first row # contains the corresponding polynomial for each residue and # successive rows are derivatives. # Now we need to evaluate the first row of lhs and rhs at each # distinct pole value. If there are multiple poles we will also need # to evaluate the derivatives at the pole value also. B = zeros (lp, 1); A = zeros (lp, lp); dpi = 1; row = 1; while (dpi <= D) for mi = 1:M(dpi) B (row) = polyval (lhs (mi, :), pr (dpi)); ci = 1; for col = 1:lp cp = rhs (mi, ci:ci+lp-1); A (row, col) = polyval (cp, pr(dpi)); ci = ci + lp; endfor row++; endfor dpi++; endwhile # Solve for the residues. r = A \ B; endfunction octave-1.1.0/scripts/polynomial/roots.m100666 415 17 3331 5705042166 16342 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function r = roots (v) # usage: roots (v) # # For a vector v with n components, return the roots of the # polynomial v(1) * z^(n-1) + ... + v(n-1) * z + v(n). # Written by KH (Kurt.Hornik@neuro.tuwien.ac.at) on Dec 24, 1993. [nr, nc] = size (v); if (nr <= 1 && nc <= 1) r = []; return; elseif (! ((nr == 1 && nc > 1) || (nc == 1 && nr > 1))) usage ("roots (v), where v is a nonzero vector"); endif n = nr + nc - 1; v = reshape (v, 1, n); # If v = [ 0 ... 0 v(k+1) ... v(k+l) 0 ... 0 ], we can remove the # leading k zeros and n - k - l roots of the polynomial are zero. f = find (v); m = max (size (f)); if (m > 0) v = v (f(1):f(m)); l = max (size (v)); if (l > 1) A = diag (ones (1, l-2), -1); A (1, :) = -v (2:l) ./ v (1); r = eig (A); if (f(m) < n) r = [r; zeros (n - f (m), 1)]; endif else r = zeros (n - f(m), 1); endif else usage ("roots (v), where v is a nonzero vector"); endif endfunction octave-1.1.0/scripts/set/ 40777 415 17 0 5705522376 13337 5ustar jweusersoctave-1.1.0/scripts/set/Makefile.in100666 415 17 2426 5673222226 15500 0ustar jweusers# # Makefile for octave's scripts/set directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = set srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/set .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/set .PHONY: dist octave-1.1.0/scripts/set/complement.m100666 415 17 1060 5702567657 15762 0ustar jweusersfunction y = complement (a, b) # usage: complement (a, b) # # Returns the elements of set b that are not in set a. # # See - create_set, union, intersection if (nargin != 2) usage ("complement(a,b)"); endif if (isempty (a)) y = create_set(b); elseif (isempty (b)) y = []; else a = create_set (a); b = create_set (b); yindex = 1; y = zeros (1, length (b)); for index = 1:length (b) if (all (a != b (index))) y(yindex++) = b(index); endif endfor y = y(1:(yindex-1)); endif endfunction octave-1.1.0/scripts/set/create_set.m100666 415 17 1166 5702567657 15744 0ustar jweusersfunction y = create_set(x) # usage: create_set(x) # # Returns the unique elements of x, sorted in ascending order. # # See - union, intersection, complement if ( nargin != 1) usage ("create_set(x)"); endif if(isempty(x)) y = []; else [nrx, ncx] = size(x); nelx = nrx*ncx; x = reshape(x,1,nelx); y = zeros(1,nelx); x = sort(x); cur_val = y(1) = x(1); yindex = xindex = 2; while (xindex <= nelx) if(cur_val != x(xindex)) cur_val = x(xindex); y(yindex++) = cur_val; endif xindex++; endwhile y = y(1:(yindex-1)); endif endfunction octave-1.1.0/scripts/set/intersection.m100666 415 17 1302 5702567657 16324 0ustar jweusersfunction y = intersection(a,b) # usage: intersection(a,b) # # Returns the intersection of sets a and b. # # See - create_set, union, complement if (nargin != 2) usage ("intersection(a,b)"); endif if(isempty(a) || isempty(b)) y = []; return; endif a = create_set(a); b = create_set(b); if(length(a) < length(b)) yindex = 1; y = zeros(1,length(a)); for index = 1:length(a) if(any(b == a(index))) y(yindex++) = a(index); endif endfor else yindex = 1; y = zeros(1,length(b)); for index = 1:length(b) if(any(a == b(index))) y(yindex++) = b(index); endif endfor endif y = y(1:(yindex-1)); endfunction octave-1.1.0/scripts/set/union.m100666 415 17 666 5702567660 14734 0ustar jweusersfunction y = union(a,b) # usage: union(a,b) # # Returns the union of sets a and b. # # See - create_set, intersection, complement if (nargin != 2) usage ("union(a,b)"); endif if(isempty(a)) y = create_set(b); elseif(isempty(b)) y = create_set(a); else [nra, nca] = size(a); a = reshape(a,1,nra*nca); [nrb, ncb] = size(b); b = reshape(b,1,nrb*ncb); y = create_set([a, b]); endif endfunction octave-1.1.0/scripts/signal/ 40777 415 17 0 5705522400 14005 5ustar jweusersoctave-1.1.0/scripts/signal/Makefile.in100666 415 17 2442 5673222226 16160 0ustar jweusers# # Makefile for octave's scripts/signal directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = signal srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/signal .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/signal .PHONY: dist octave-1.1.0/scripts/signal/fftconv.m100666 415 17 3343 5705045236 15737 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function c = fftconv (a, b, N) # usage: fftconv (a, b [, N]) # # c = fftconv (a, b) returns the convolution of the vectors a and b, # a vector with length equal to length (a) + length (b) - 1. # If a and b are the coefficient vectors of two polynomials, c is # the coefficient vector of the product polynomial. # # The computation uses the FFT by calling fftfilt. If the optional # argument N is specified, an N-point FFT is used. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 3, 1994. if (nargin < 2 || nargin > 3) usage ("fftconv (b, x [, N])"); endif if (is_matrix (a) || is_matrix (b)) error ("fftconv: both a and b should be vectors"); endif la = length (a); lb = length (b); if ((la == 1) || (lb == 1)) c = a * b; else lc = la + lb - 1; a(lc) = 0; b(lc) = 0; if (nargin == 2) c = fftfilt (a, b); else if !(is_scalar (N)) error ("fftconv: N has to be a scalar"); endif c = fftfilt (a, b, N); endif endif endfunction octave-1.1.0/scripts/signal/fftfilt.m100666 415 17 5464 5705045231 15731 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = fftfilt (b, x, N) # usage: fftfilt (b, x [, N]) # # y = fftfilt (b, x) filters x with the FIR filter b using the FFT. # y = fftfilt (b, x, N) uses the overlap-add method to filter x with # b using an N-point FFT. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Sep 3, 1994 # Reference: Oppenheim & Schafer (1989). Discrete-time Signal # Processing (Chapter 8). Prentice-Hall. # If N is not specified explicitly, we do not use the overlap-add # method at all because loops are really slow. Otherwise, we only # ensure that the number of points in the FFT is the smallest power # of two larger than N and length(b). This could result in length # one blocks, but if the user knows better ... if (nargin < 2 || nargin > 3) usage (" fftfilt (b, x [, N])"); endif [r_x, c_x] = size (x); [r_b, c_b] = size (b); if (! (min ([r_x c_x]) == 1 || min ([r_b c_b]) == 1)) error ("fftfilt: both x and b should be vectors"); endif l_x = r_x * c_x; l_b = r_b * c_b; if ((l_x == 1) && (l_b == 1)) y = b * x; return; endif x = reshape (x, 1, l_x); b = reshape (b, 1, l_b); if (nargin == 2) # Use FFT with the smallest power of 2 which is >= length (x) + # length (b) - 1 as number of points ... N = 2^(ceil (log (l_x + l_b - 1) / log(2))); y = ifft (fft (x, N) .* fft(b, N)); else # Use overlap-add method ... if !(is_scalar (N)) error ("fftfilt: N has to be a scalar"); endif N = 2^(ceil (log (max ([N l_b])) / log(2))); L = N - l_b + 1; B = fft (b, N); R = ceil (l_x / L); y = zeros (1, l_x); for r = 1:R; lo = (r - 1) * L + 1; hi = min (r * L, l_x); tmp = ifft (fft (x(lo:hi), N) .* B); hi = min (lo+N-1, l_x); y(lo:hi) = y(lo:hi) + tmp(1:(hi-lo+1)); endfor endif y = reshape (y(1:l_x), r_x, c_x); # Final cleanups: if both x and b are real respectively integer, y # should also be if (! (any (imag (x)) || any (imag (b)))) y = real (y); endif if (! (any (x - round (x)) || any (b - round (b)))) y = round (y); endif endfunction octave-1.1.0/scripts/signal/filter.m100666 415 17 6716 5702567661 15576 0ustar jweusersfunction [y, w] = filter(b,a,x,w) # Filter a vector. # y = filter(b,a,x) returns the solution to the following linear, # time-invariant difference equation: # # N M # sum a(k+1) y(n-k) + sum b(k+1) x(n-k) = 0 for 1<=n<=length(x) # k=0 k=0 # # where N=length(a)-1 and M=length(b)-1. An equivalent form of this # equation is: # # N M # y(n) = sum c(k+1) y(n-k) + sum d(k+1) x(n-k) for 1<=n<=length(x) # k=1 k=0 # # where c = a/a(1) and d = b/a(1). # # In terms of the z-transform, y is the result of passing the discrete- # time signal x through a system characterized by the following rational # system function: # # M # sum d(k+1) z^(-k) # k=0 # H(z) = ---------------------- # N # 1 + sum c(k+1) z(-k) # k=1 # # [y, sf] = filter(b,a,x,si) sets the initial state of the system, si, # and returns the final state, sf. The state vector is a column vector # whose length is equal to the length of the longest coefficient vector # minus one. If si is not set, the initial state vector is set to all # zeros. # # The particular algorithm employed is known as a transposed Direct # Form II implementation. # # SEE ALSO: poly, roots, conv, deconv, residue, polyval, polyderiv, polyinteg # Written by Tony Richardson June 1994. # Bug fix by FL (Friedrich.Leisch@ci.tuwien.ac.at) on Oct 12, 1994 if(nargin < 3 || nargin > 4) error("usage: [y, sf] = filter(b,a,x[,si])"); endif if(is_matrix(a) || is_matrix(b) || is_matrix(x)) error("Argument must be a vector."); endif N = length(a); M = length(b); L = length(x); MN = max([N M]); lw = MN - 1; # It's convenient to pad the coefficient vectors to the same length. b = postpad(b,MN); # Ensure that all vectors have the assumed dimension. if(columns(a) > 1) a = reshape(a,N,1); endif if(columns(b) > 1) b = reshape(b,MN,1); endif if(nargin == 3) # Set initial state to zero. w = zeros(lw,1); else if(is_matrix(w) || length(w) != lw) error("state vector has the wrong dimensions."); endif if(columns(w) > 1) w = reshape(w,lw,1); endif endif # Allocate space for result. y = zeros(1,L); norm = a(1); if (norm == 0.) error("First element in second argument must be non-zero."); endif if (norm != 1.) b = b/norm; endif # Distinguish between IIR and FIR cases. The IIR code can easily be made # to work for both cases, but the FIR code is slightly faster when it can # be used. if (N > 1) # IIR filter. a = postpad(a,MN); if (norm != 1.) a = a/norm; endif for index = 1:L y(index) = w(1) + b(1)*x(index); # Update state vector if(lw > 1) w(1:(lw-1)) = w(2:lw) - a(2:lw)*y(index) + b(2:lw)*x(index); w(lw) = b(MN)*x(index) - a(MN) * y(index); else w(1) = b(MN)*x(index) - a(MN) * y(index); endif endfor else # FIR filter. if(lw > 0) for index = 1:L y(index) = w(1) + b(1)*x(index); if ( lw > 1) # Update state vector w(1:lw-1) = w(2:lw) + b(2:lw)*x(index); w(lw) = b(MN)*x(index); else w(1) = b(2)*x(index); endif endfor else # Handle special case where there is no delay separately. y = b(1)*x; endif endif endfunction octave-1.1.0/scripts/signal/freqz.m100666 415 17 3210 5702567661 15422 0ustar jweusersfunction [h, w] = freqz(b,...) # Compute the frequency response of a filter. # # [h,w] = resp(b) # returns the complex frequency response h of the FIR filter with # coefficients b. The response is evaluated at 512 angular frequencies # between 0 and pi. w is a vector containing the 512 frequencies. # # [h,w] = resp(b,a) # returns the complex frequency response of the rational IIR filter # whose numerator has coefficients b and denominator coefficients a. # # [h,w] = resp(b,a,n) # returns the response evaluated at n angular frequencies. For fastest # computation n should factor into a small number of small primes. # # [h,w] = freqz(b,a,n,"whole") # evaluates the response at n frequencies between 0 and 2*pi. if (nargin == 1) # Response of an FIR filter. a = 1; n = 512; region = "half"; elseif (nargin == 2) # Response of an IIR filter a = va_arg(); n = 512; region = "half"; elseif (nargin == 3) a = va_arg(); n = va_arg(); region = "half"; elseif (nargin == 4) a = va_arg(); n = va_arg(); region = va_arg(); endif la = length(a); a = reshape(a,1,la); lb = length(b); b = reshape(b,1,lb); k = max([la lb]); if( n >= k) if (strcmp(region,"whole")) h = fft(postpad(b,n)) ./ fft(postpad(a,n)); w = 2*pi*[0:(n-1)]/n; else h = fft(postpad(b,2*n)) ./ fft(postpad(a,2*n)); h = h(1:n); w = pi*[0:(n-1)]/n; endif else if (strcmp(region,"whole")) w = 2*pi*[0:(n-1)]/n; else w = pi*[0:(n-1)]/n; endif h = polyval(postpad(b,k),exp(j*w)) ./ polyval(postpad(a,k),exp(j*w)); endif endfunction octave-1.1.0/scripts/signal/sinc.m100666 415 17 1143 5702567661 15232 0ustar jweusersfunction result = sinc (x) # usage: sinc(x) # # Returns sin(pi*x)/(pi*x). # We either need to set the do_fortran_indexing variable to "true" # or use reshape to convert the input matrix to a vector, so that # we can use find to determine the elements of x that equal zero. # I prefer reshaping. [nr, nc] = size(x); nels = nr*nc; x = reshape(x,nels,1); # Set result to all ones initially. result = ones(nels,1); # Find non-zero elements in the input matrix. i = find(x); if (!isempty(i)) result(i) = sin(pi*x(i))./(pi*x(i)); endif result = reshape(result,nr,nc); endfunction octave-1.1.0/scripts/specfun/ 40777 415 17 0 5705522401 14174 5ustar jweusersoctave-1.1.0/scripts/specfun/Makefile.in100666 415 17 2446 5673222225 16351 0ustar jweusers# # Makefile for octave's scripts/specfun directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = specfun srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/specfun .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/specfun .PHONY: dist octave-1.1.0/scripts/specfun/beta.m100666 415 17 2064 5705045203 15364 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = beta (a, b) # usage: beta (a, b) # # Returns the beta function beta(a,b) = gamma(a) * gamma(b) / gamma(a+b) # of a and b. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Jun 13, 1993 if (nargin != 2) usage ("beta (a, b)"); endif retval = exp (lgamma (a) + lgamma (b) - lgamma (a+b)); endfunction octave-1.1.0/scripts/specfun/betai.m100666 415 17 6742 5705045200 15541 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = betai(a, b, x) # usage: betai(a, b, x) # # Returns the incomplete beta function # betai (a, b, x) = BETA(a,b)^(-1) INT_0^x t^(a-1) (1-t)^(b-1) dt. # If x has more than one component, both a and b must be scalars. # If x is a scalar, a and b must be of compatible dimensions. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Aug 2, 1994. # Computation is based on the series expansion # betai(a, b, x) # = \frac{1}{B(a, b)} x^a # \sum_{k=0}^\infty \frac{(1-b)\cdots(k-b)}{a+k} \frac{x^k}{k!} # for x <= 1/2. For x > 1/2, betai(a, b, x) = 1 - betai(b, a, 1-x). if (nargin <> 3) usage (" betai (a, b, x)"); endif if !((a > 0) && (b > 0)) error("betai: a and b must both be positive."); endif [nr, nc] = size(x); if (min ([nr, nc]) == 0) error ("betai: x must not be empty."); endif if (any (x < 0) || any (x > 1)) error ("betai: all entries of x must be in [0,1]."); endif if ((nr > 1) || (nc > 1)) if (! (is_scalar (a) && is_scalar (b))) error ("betai: if x is not a scalar, a and b must be scalars"); endif n = nr * nc; x = reshape (x, 1, n); y = zeros (1, n); c = exp (lgamma (a+b) - lgamma (a) - lgamma (b)); y (find (x == 1)) = ones (1, sum (x == 1)); # Now do the series computation. The error when truncating at term K # is always less than 2^(-K), hence the following choice of K. K = ceil (-log (eps) / log (2)); k = (1:K)'; ind = find ((x > 0) & (x <= 1/2)); len = length (ind); if (len > 0) tmp = cumprod((1 - b./k) * x(ind)) ./ ((a + k) * ones(1, len)); y(ind) = c * exp(a * log(x(ind))) .* (1/a + sum(tmp)); endif ind = find ((x > 1/2) & (x < 1)); len = length(ind); if (len > 0) tmp = cumprod ((1 - a./k) * (1 - x(ind))) ./ ((b + k) * ones(1, len)); y(ind) = 1 - c * exp (b * log (1-x(ind))) .* (1/b + sum (tmp)); endif y = reshape (y, nr, nc); else [ra, ca] = size (a); [rb, cb] = size (b); if (! (ra == rb && ca == cb)) error ("betai: a and b must have the same size"); endif n = ra * ca; a = reshape (a, 1, n); b = reshape (b, 1, n); c = exp (lgamma (a+b) - lgamma (a) - lgamma (b)); if (x == 0) y = zeros (1, n); elseif (x == 1) y = ones (1, n); else K = ceil (-log (eps) / log (2)); k = (1:K)' * ones (1, n); h = ones (K, 1); if (x > 0 && x <= 1/2) tmp = cumprod ((1 - (h * b) ./ k) * x) ./ ((h * a) + k); y = c .* exp (a * log(x)) .* (1 ./ a + sum (tmp)); else tmp = cumprod ((1 - (h * a) ./ k) * (1-x)) ./ ((h * b) + k); y = 1 - c .* exp (b * log (1-x)) .* (1 ./ b + sum (tmp)); endif endif y = reshape (y, ra, ca); endif endfunction octave-1.1.0/scripts/specfun/gammai.m100666 415 17 6715 5705044165 15721 0ustar jweusers# Copyright (C) 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function y = gammai (a, x) # usage: gammai (a, x) # # Computes the incomplete gamma function # # gammai (a, x) # = (integral from 0 to x of exp(-t) t^(a-1) dt) / gamma(a). # # If a is scalar, then gammai(a, x) is returned for each element of x # and vice versa. # # If neither a nor x is scalar, the sizes of a and x must agree, and # gammai is applied pointwise. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Aug 13, 1994 if (nargin != 2) usage ("gammai (a, x)"); endif [r_a, c_a] = size (a); [r_x, c_x] = size (x); e_a = r_a * c_a; e_x = r_x * c_x; # The following code is rather ugly. We want the function to work # whenever a and x have the same size or a or x is scalar. # We do this by reducing the latter cases to the former. if (e_a == 0 || e_x == 0) error ("gammai: both a and x must be nonempty"); endif if (r_a == r_x && c_a == c_x) n = e_a; a = reshape (a, 1, n); x = reshape (x, 1, n); r_y = r_a; c_y = c_a; elseif (e_a == 1) n = e_x; a = a * ones (1, n); x = reshape (x, 1, n); r_y = r_x; c_y = c_x; elseif (e_x == 1) n = e_a; a = reshape (a, 1, n); x = x * ones (1, n); r_y = r_a; c_y = c_a; else error ("gammai: a and x must have the same size if neither is scalar"); endif # Now we can do sanity checking ... if (any (a <= 0) || any (a == Inf)) error ("gammai: all entries of a must be positive anf finite"); endif if (any (x < 0)) error ("gammai: all entries of x must be nonnegative"); endif y = zeros(1, n); # For x < a + 1, use summation. The below choice of k should ensure # that the overall error is less than eps ... S = find ((x > 0) & (x < a + 1)); s = length (S); if (s > 0) k = ceil (- max ([a(S), x(S)]) * log (eps)); K = (1:k)'; M = ones(k, 1); A = cumprod((M * x(S)) ./ (M * a(S) + K * ones(1, s))); y(S) = exp (-x(S) + a(S) .* log (x(S))) .* (1 + sum (A)) ./ gamma (a(S)+1); endif # For x >= a + 1, use the continued fraction. # Note, however, that this converges MUCH slower than the series # expansion for small a and x not too large! S = find((x >= a + 1) & (x < Inf)); s = length(S); if (s > 0) u = [zeros(1, s); ones(1, s)]; v = [ones(1, s); x(S)]; c_old = 0; c_new = v(1,:) ./ v(2,:); n = 1; while (max (abs (c_old ./ c_new - 1)) > 10 * eps) c_old = c_new; u = v + u .* (ones (2, 1) * (n - a(S))); v = u .* (ones (2, 1) * x(S)) + n * v; c_new = v(1,:) ./ v(2,:); n = n + 1; endwhile y(S) = 1 - exp (-x(S) + a(S) .* log (x(S))) .* c_new ./ gamma (a(S)); endif y (find (x == Inf)) = ones (1, sum (x == Inf)); y = reshape (y, r_y, c_y); endfunctionoctave-1.1.0/scripts/special-matrix/ 40777 415 17 0 5705522402 15454 5ustar jweusersoctave-1.1.0/scripts/special-matrix/Makefile.in100666 415 17 2502 5673222224 17620 0ustar jweusers# # Makefile for octave's scripts/special-matrix directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = special-matrix srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/special-matrix .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/special-matrix .PHONY: dist octave-1.1.0/scripts/special-matrix/hadamard.m100666 415 17 2100 5702570173 17466 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = hadamard (k) # usage: hadamard (k) # # Return the Hadamard matrix of order n = 2^k. # # See also: hankel, vander, hilb, invhilb, toeplitz if (nargin != 1) usage ("hadamard (n)"); endif if (k < 1) retval = 1; else tmp = hadamard (k-1); retval = [tmp, tmp; tmp, -tmp]; endif endfunction octave-1.1.0/scripts/special-matrix/hankel.m100666 415 17 3630 5702570172 17177 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = hankel (c, r) # usage: hankel (c, r) # # Return the Hankel matrix constructed given the first column # c, and (optionally) the last row r. # # If the second argument is omitted, the last row is taken to be the # same as the first column. If the last element of c is not the same # as the first element of r, the last element of c is used. # # See also: vander, hadamard, hilb, invhilb, toeplitz if (nargin == 1) r = c; elseif (nargin != 2) usage ("hankel (c, r)"); endif [c_nr, c_nc] = size (c); [r_nr, r_nc] = size (r); if ((c_nr != 1 && c_nc != 1) || (r_nr != 1 && r_nc != 1)) error ("hankel: expecting vector arguments") endif if (c_nc != 1) c = c'; endif if (r_nr != 1) r = r'; endif if (r (1) != c (1)) warning ("hankel: column wins anti-diagonal conflict"); endif # This should probably be done with the colon operator... nc = length (r); nr = length (c); retval = zeros (nr, nc); for i = 1:min (nr, nc) retval (1:nr-i+1, i) = c (i:nr); endfor tmp = 1; if (nc <= nr) tmp = nr - nc + 2; endif for i = nr:-1:tmp retval (i, 2+nr-i:nc) = r (2:nc-nr+i); endfor endfunction octave-1.1.0/scripts/special-matrix/hilb.m100666 415 17 2411 5702570172 16647 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = hilb (n) # usage: hilb (n) # # Return the Hilbert matrix of order n. The i, j element of a Hilbert # matrix is defined as # # H (i, j) = 1 / (i + j - 1); # # See also: hankel, vander, hadamard, invhilb, toeplitz if (nargin != 1) usage ("hilb (n)"); endif nmax = length (n); if (nmax == 1) retval = zeros (n); tmp = 1:n; for i = 1:n retval (i, :) = 1.0 ./ (tmp + (i - 1)); endfor else error ("hilb: expecting scalar argument, found something else"); endif endfunction octave-1.1.0/scripts/special-matrix/invhilb.m100666 415 17 3262 5702570137 17372 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = invhilb (n) # usage: invhilb (n) # # Return the inverse of a Hilbert matrix of order n. This is slow but # exact. Compare with inv (hilb (n)). # # See also: hankel, vander, hadamard, hilb, toeplitz if (nargin != 1) usage ("invhilb (n)"); endif nmax = length (n); if (nmax == 1) retval = zeros (n); for l = 1:n for k = l:n tmp = 1; for i = 1:n tmp = tmp * (i + k - 1); endfor for i = 1:n if (i != k) tmp = tmp * (l + i - 1); endif endfor for i = 1:n if (i != l) tmp = tmp / (i - l); endif endfor for i = 1:n if (i != k) tmp = tmp / (i - k); endif endfor retval (k, l) = tmp; retval (l, k) = tmp; endfor endfor else error ("hilb: expecting scalar argument, found something else"); endif endfunction octave-1.1.0/scripts/special-matrix/toeplitz.m100666 415 17 4161 5703313567 17613 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = toeplitz (c, r) # usage: toeplitz (c, r) # # Return the Toeplitz matrix constructed given the first column # c, and (optionally) the first row r. # # If the second argument is omitted, the first row is taken to be the # same as the first column. If the first element of c is not the same # as the first element of r, the first element of c is used. # # See also: hankel, vander, hadamard, hilb, invhib if (nargin == 1) r = c; elseif (nargin != 2) usage ("toeplitz (c, r)"); endif [c_nr, c_nc] = size (c); [r_nr, r_nc] = size (r); if ((c_nr != 1 && c_nc != 1) || (r_nr != 1 && r_nc != 1)) error ("toeplitz: expecting vector arguments") endif if (c_nc != 1) c = c.'; endif if (r_nr != 1) r = r.'; endif if (r (1) != c (1)) warning ("toeplitz: column wins diagonal conflict"); endif # If we have a single complex argument, we want to return a # Hermitian-symmetric matrix (actually, this will really only be # Hermitian-symmetric if the first element of the vector is real). if (nargin == 1) c = conj (c); c(1) = conj (c(1)); endif # This should probably be done with the colon operator... nc = length (r); nr = length (c); retval = zeros (nr, nc); for i = 1:min (nc, nr) retval (i:nr, i) = c (1:nr-i+1); endfor for i = 1:min (nr, nc-1) retval (i, i+1:nc) = r (2:nc-i+1); endfor endfunction octave-1.1.0/scripts/special-matrix/vander.m100666 415 17 2531 5702570135 17212 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = vander (c) # usage: vander (c) # # Return the Vandermonde matrix whose next to last column is c. # # See also: hankel, hadamard, hilb, invhilb, toeplitz if (nargin != 1) usage ("vander (c)"); endif nr = rows (c); nc = columns (c); if (nr == 1 && nc == 1) retval = 1; elseif (nr == 1 || nc == 1) n = length (c); if (n > 0) retval = zeros (n, n); for i = 1:n tmp = c(i); for j = 1:n retval (i, j) = tmp ^ (n - j); endfor endfor endif else error ("vander: argument must be a vector"); endif endfunction octave-1.1.0/scripts/startup/ 40777 415 17 0 5705522404 14236 5ustar jweusersoctave-1.1.0/scripts/startup/Makefile.in100666 415 17 2747 5673222223 16412 0ustar jweusers# # Makefile for octave's scripts/startup directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = startup srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = octaverc # *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = # $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = # $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) if test -f $(fcnfiledir)/$(script_sub_dir)/octaverc ; then true ; \ else \ $(INSTALL_DATA) $(srcdir)/octaverc \ $(fcnfiledir)/$(script_sub_dir)/octaverc ; \ fi # for f in $(FCN_FILES_NO_DIR) ; do \ # rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ # $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ # done .PHONY: install uninstall: # for f in $(FCN_FILES_NO_DIR) ; \ # do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ # done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/startup .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/startup .PHONY: dist octave-1.1.0/scripts/startup/octaverc100666 415 17 240 5640356376 16053 0ustar jweusers# System-wide startup file for Octave. # # This file should contain any commands that should be executed each # time Octave starts for every user at this site. octave-1.1.0/scripts/statistics/ 40777 415 17 0 5705522405 14727 5ustar jweusersoctave-1.1.0/scripts/statistics/Makefile.in100666 415 17 2462 5673222173 17100 0ustar jweusers# # Makefile for octave's scripts/statistics directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = statistics srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/statistics .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/statistics .PHONY: dist octave-1.1.0/scripts/statistics/corrcoef.m100666 415 17 2633 5702570134 17007 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = corrcoef (X, Y) # usage: corrcoef (X [, Y]) # # If each row of X and Y is an observation and each column is a variable, # the (i,j)-th entry of corrcoef(X, Y) is the correlation between the # i-th variable in X and the j-th variable in Y. # corrcoef(X) is corrcoef(X, X). # Written by Kurt Hornik (hornik@ci.tuwien.ac.at) March 1993. # Dept of Probability Theory and Statistics TU Wien, Austria. if (nargin < 1 || nargin > 2) usage ("corrcoef (X [, Y])"); endif if (nargin == 2) C = cov (X, Y); S = std (X)' * std (Y); retval = C ./ S; elseif (nargin == 1) C = cov (X); s = diag (C); retval = C ./ sqrt (s*s'); endif endfunction octave-1.1.0/scripts/statistics/cov.m100666 415 17 3113 5702570133 15765 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = cov (X, Y) # usage: cov (X [, Y]) # # If each row of X and Y is an observation and each column is a # variable, the (i,j)-th entry of cov(X, Y) is the covariance # between the i-th variable in X and the j-th variable in Y. # cov(X) is cov(X, X). # Written by Kurt Hornik (hornik@ci.tuwien.ac.at) March 1993. # Dept of Probability Theory and Statistics TU Wien, Austria. if (nargin < 1 || nargin > 2) usage ("cov (X [, Y])"); endif [Tx, kx] = size (X); if (nargin == 2) [Ty, ky] = size (Y); if (Tx != Ty) error ("cov: X and Y must have the same number of rows."); endif X = X - ones (Tx, 1) * sum (X) / Tx; Y = Y - ones (Tx, 1) * sum (Y) / Tx; retval = conj (X' * Y / (Tx - 1)); elseif (nargin == 1) X = X - ones (Tx, 1) * sum (X) / Tx; retval = conj (X' * X / (Tx - 1)); endif endfunction octave-1.1.0/scripts/statistics/gls.m100666 415 17 3623 5702570132 15770 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [BETA, v, R] = gls (Y, X, O) # usage: [BETA, v [,R]] = gls (Y, X, O) # # Generalized Least Squares (GLS) estimation for the multivariate model # # Y = X*B + E, mean(E) = 0, cov(vec(E)) = (s^2)*O # # with Y ... T x p As usual, each row of Y and X is an observation # X ... T x k and each column a variable. # B ... k x p # E ... T x p # O ... Tp x Tp. # # BETA is the GLS estimator for B. # v is the GLS estimator for s^2. # R = Y - X*BETA is the matrix of GLS residuals. # Written by Teresa Twaroch (twaroch@ci.tuwien.ac.at) May 1993. # Dept of Probability Theory and Statistics TU Wien, Austria. if (nargin != 3) usage ("[BETA, v [, R]] = gls (Y, X, O)"); endif [rx, cx] = size (X); [ry, cy] = size (Y); if (rx != ry) error ("gls: incorrect matrix dimensions"); endif O = O^(-1/2); Z = kron (eye (cy), X); Z = O * Z; Y1 = O * reshape (Y, ry*cy, 1); U = Z' * Z; r = rank (U); if (r == cx*cy) B = inv (U) * Z' * Y1; else B = pinv (Z) * Y1; endif BETA = reshape (B, cx, cy); R = Y - X * BETA; v = (reshape (R, ry*cy, 1))' * (O^2) * reshape (R, ry*cy, 1) / (rx*cy - r); endfunction octave-1.1.0/scripts/statistics/kurtosis.m100666 415 17 3120 5705042650 17060 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = kurtosis (x) # usage: kurtosis (x) # # If x is a vector of length N, return the kurtosis # # kurtosis(x) = N^(-1) std(x)^(-4) SUM_i (x(i)-mean(x))^4 - 3 # # of x. # # If x is a matrix, return a row vector containing the kurtosis for each # column. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Jul 29, 1994. if (nargin != 1) usage ("kurtosis (x)"); endif if (is_vector (x)) x = x - mean (x); if (! any (x)) retval = 0; else retval = sum (x .^ 4) / (length (x) * std (x) ^ 4) - 3; endif elseif (is_matrix (x)) [nr, nc] = size (x); x = x - ones (nr, 1) * mean (x); retval = zeros (1, nc); s = std (x); ind = find (s > 0); retval (ind) = sum (x (:, ind) .^ 4) ./ (nr * s (ind) .^ 4) - 3; else error ("kurtosis: x has to be a matrix or a vector."); endif endfunction octave-1.1.0/scripts/statistics/mahalanobis.m100666 415 17 3041 5702570130 17451 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = mahalanobis (X, Y) # usage: mahalanobis (X, Y) # # Returns Mahalanobis' D-square distance between the multivariate # samples X and Y, which must have the same number of components # (columns), but may have a different number of observations (rows). # Written by Friedrich Leisch (leisch@ci.tuwien.ac.at) July 1993. # Dept of Probability Theory and Statistics TU Wien, Austria. if (nargin != 2) usage ("mahalanobis (X, Y)"); endif [xr, xc] = size (X); [yr, yc] = size (Y); if (xc != yc) error ("mahalanobis: X and Y must have the same number of columns."); endif Xm = sum (X) / xr; Ym = sum (Y) / yr; X = X - ones (xr, 1) * Xm; Y = Y - ones (yr, 1) * Ym; W = (X' * X + Y' * Y) / (xr + yr - 2); Winv = inv (W); retval = (Xm - Ym) * Winv * (Xm - Ym)'; endfunction octave-1.1.0/scripts/statistics/mean.m100666 415 17 2317 5702570127 16126 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = mean (a) # usage: mean (a) # # For vector arguments, return the mean the values. # # For matrix arguments, return a row vector containing the mean for # each column. # # See also: median, std if (nargin != 1) usage ("mean (a)"); endif [nr, nc] = size (a); if (nr == 1 || nc == 1) retval = sum (a) / length (a); elseif (nr > 0 && nc > 0) retval = sum (a) / nr; else error ("mean: invalid matrix argument"); endif endfunction octave-1.1.0/scripts/statistics/median.m100666 415 17 2723 5702570127 16444 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = median (a) # usage: median (a) # # For vector arguments, return the median of the values. # # For matrix arguments, return a row vector containing the median for # each column. # # See also: std, mean if (nargin != 1) usage ("medain (a)"); endif [nr, nc] = size (a); s = sort (a); if (nr == 1 && nc > 0) if (rem (nc, 2) == 0) i = nc/2; retval = (s (i) + s (i+1)) / 2; else i = ceil (nc/2); retval = s (i); endif elseif (nr > 0 && nc > 0) if (rem (nr, 2) == 0) i = nr/2; retval = (s (i,:) + s (i+1,:)) / 2; else i = ceil (nr/2); retval = s (i,:); endif else error ("median: invalid matrix argument"); endif endfunction octave-1.1.0/scripts/statistics/ols.m100666 415 17 3563 5702570126 16006 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function [BETA, SIGMA, R] = ols (Y, X) # usage: [BETA, SIGMA [, R]] = ols (Y, X) # # Ordinary Least Squares (OLS) estimation for the multivariate model # # Y = X*B + E, mean(E) = 0, cov(vec(E)) = kron(S,I) # # with Y ... T x p As usual, each row of Y and X is an observation # X ... T x k and each column a variable. # B ... k x p # E ... T x p. # # BETA is the OLS estimator for B, i.e. # # BETA = pinv(X)*Y, # # where pinv(X) denotes the pseudoinverse of X. # SIGMA is the OLS estimator for the matrix S, i.e. # # SIGMA = (Y - X*BETA)'*(Y - X*BETA) / (T - rank(X)). # # R = Y - X*BETA is the matrix of OLS residuals. # Written by Teresa Twaroch (twaroch@ci.tuwien.ac.at) May 1993. # Dept of Probability Theory and Statistics TU Wien, Austria. if (nargin != 2) error("usage : [BETA, SIGMA [, R]] = ols (Y, X)"); endif [nr, nc] = size (X); [ry, cy] = size (Y); if (nr != ry) error ("ols: incorrect matrix dimensions"); endif Z = X' * X; r = rank (Z); if (r == nc) BETA = inv (Z) * X' * Y; else BETA = pinv (X) * Y; endif R = Y - X * BETA; SIGMA = R' * R / (nr - r); endfunction octave-1.1.0/scripts/statistics/skewness.m100666 415 17 3105 5705042655 17047 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = skewness (x) # usage: skewness (x) # # If x is a vector of length N, return the skewness # # skewness (x) = N^(-1) std(x)^(-3) SUM_i (x(i)-mean(x))^3 # # of x. # # If x is a matrix, return a row vector containing the skewness for each # column. # Written by KH (Kurt.Hornik@ci.tuwien.ac.at) on Jul 29, 1994. if (nargin != 1) usage ("skewness (x)"); endif if (is_vector (x)) x = x - mean (x); if (! any (x)) retval = 0; else retval = sum (x .^ 3) / (length (x) * std (x) ^ 3); endif elseif (is_matrix (x)) [nr, nc] = size (x); x = x - ones (nr, 1) * mean (x); retval = zeros (1, nc); s = std (x); ind = find (s > 0); retval (ind) = sum (x (:, ind) .^ 3) ./ (nr * s (ind) .^ 3); else error ("skewness: x has to be a matrix or a vector."); endif endfunction octave-1.1.0/scripts/statistics/std.m100666 415 17 2664 5702570123 16001 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function retval = std (a) # usage: std (a) # # For vector arguments, std returns the standard deviation of the # values. For matrix arguments, std returns a row vector containing # the standard deviation for each column. # # See also: mean, median if (nargin != 1) usage ("std (a)"); endif nr = rows (a); nc = columns (a); if (nc == 1 && nr == 1) retval = 0; elseif (nc == 1 || nr == 1) tmp = sum (a); n = length (a); retval = sqrt ((n * sumsq (a) - tmp .* tmp) / (n * (n - 1))); elseif (nr > 1 && nc > 0) tmp = sum (a); retval = sqrt ((nr * sumsq (a) - tmp .* tmp) / (nr * (nr - 1))); else error ("mean: invalid matrix argument"); endif endfunction octave-1.1.0/scripts/strings/ 40777 415 17 0 5705522407 14230 5ustar jweusersoctave-1.1.0/scripts/strings/Makefile.in100666 415 17 2446 5673222211 16372 0ustar jweusers# # Makefile for octave's scripts/strings directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = ../.. script_sub_dir = strings srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = *.m DISTFILES = Makefile.in $(SOURCES) FCN_FILES = $(wildcard $(srcdir)/*.m) FCN_FILES_NO_DIR = $(notdir $(FCN_FILES)) all: .PHONY: all install: $(top_srcdir)/mkinstalldirs $(fcnfiledir)/$(script_sub_dir) for f in $(FCN_FILES_NO_DIR) ; do \ rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ $(INSTALL_DATA) $(srcdir)/$$f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: install uninstall: for f in $(FCN_FILES_NO_DIR) ; \ do rm -f $(fcnfiledir)/$(script_sub_dir)/$$f ; \ done .PHONY: uninstall clean: .PHONY: clean tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/strings .PHONY: local-dist dist: ln $(DISTFILES) ../../`cat ../../.fname`/scripts/strings .PHONY: dist octave-1.1.0/scripts/strings/strcat.m100666 415 17 2273 5702570115 16003 0ustar jweusers# Copyright (C) 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function st = strcat (s, t, ...) if (nargin > 1) if (isstr (s) && isstr (t)) tmpst = [s, t]; else error ("strcat: all arguments must be strings"); endif n = nargin - 2; while (n--) tmp = va_arg (); if (isstr (tmp)) tmpst = [tmpst, tmp]; else error ("strcat: all arguments must be strings"); endif endwhile else usage ("strcat (s, t, ...)"); endif st = tmpst; endfunction octave-1.1.0/scripts/strings/strcmp.m100666 415 17 2762 5702570122 16014 0ustar jweusers# Copyright (C) 1993, 1994, 1995 John W. Eaton # # This file is part of Octave. # # Octave 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, or (at your option) any # later version. # # Octave 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 Octave; see the file COPYING. If not, write to the Free # Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. function status = strcmp (s1, s2) # usage: strcmp (s1, s2) # # Compare two strings. # # WARNING: Unlike the C function of the same name, this function # returns 1 for equal and zero for not equal. Why? To be compatible # with Matlab, of course. if (nargin != 2) usage ("strcmp (s, t)"); endif status = 0; if (isstr (s1) && isstr(s2)) len_s1 = columns (s1); len_s2 = columns (s2); if (len_s1 == len_s2) if (len_s1 == 0) status = 1; else tmp = implicit_str_to_num_ok; unwind_protect implicit_str_to_num_ok = "true"; status = all (s1 == s2); unwind_protect_cleanup implicit_str_to_num_ok = tmp; end_unwind_protect endif endif endif endfunction octave-1.1.0/dld/ 40777 415 17 0 5705522411 11606 5ustar jweusersoctave-1.1.0/dld/doc/ 40777 415 17 0 5021125747 12355 5ustar jweusersoctave-1.1.0/dld/doc/dld.texinfo100666 415 17 43103 5021125364 14627 0ustar jweusers\input texinfo @c -*- texinfo -*- @c %**start of header @setfilename dld.info @settitle Dld @c %**end of header @iftex @finalout @end iftex @ifinfo This file documents dld, a dynamic link/unlink editor. This is edition 1.2 of the dld documentation. Copyright (C) 1991 W. Wilson Ho. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. @end ifinfo @iftex @titlepage @title Dld @subtitle A Dynamic Link/Unlink Editor @subtitle Version 3.2.3. @subtitle Copyright @copyright{} 1991 W. Wilson Ho. @author by W. Wilson Ho @end titlepage @setchapternewpage off @headings off @everyheading @| @thispage @| @end iftex @node Top, dld_init, (dir), (dir) @comment node-name, next, previous, up @chapter What is dld? @dfn{Dld} is a library package of C functions that performs @dfn{dynamic link editing}. Programs that use dld can add compiled object code to or remove such code from a process anytime during its execution. Loading modules, searching libraries, resolving external references, and allocating storage for global and static data structures are all performed at run time. Dld is now available for VAX, Sun 3, SPARCstation, Sequent Symmetry, and Atari ST. This text describes how the dld functions can be called and some technical details that should be aware of. For the internals of dld and sample applications, please refer to @cite{An Approach to Genuine Dynamic Linking}, Software--Practice and Experirnce, Vol. 21(4), 375-390 (April 1991). An early draft of that paper is included with this distribution. @menu * dld_init:: Initializing Dld * dld_link:: Dynamically Linking in New Modules * dld_unlink:: Unlinking a Module * dld_get_func:: Invoking Dynamically Linked Functions * Executability:: Determining If a Function is Executable * dld_list_undefined_sym:: Listing the Undefined Symbols * dld_create_reference:: Explicitly Referencing a Symbol * Explicit Definition:: Explicitly Defining a Symbol * dld_perror:: Printing out the Error Messages * Error Codes:: Definition of Error Codes @end menu @node dld_init, dld_link, Top, Top @comment node-name, next, previous, up @section Initializing Dld To use any of the dld functions, you must include the header file @code{dld.h} for declaration of the functions and definition of the error code constants. The function @code{dld_init} must be called before any other dld functions. It has the following syntax: @example int dld_init (char *@var{path}) @end example @noindent where @var{path} is a string containing the path name of the executable file of the executing process. This function initializes internal data structures of dld and loads into memory symbol definitions of the executing process. By doing so, other dynamically loaded functions can reference symbols already defined or share functions already exist in the executing process. @code{dld_init} returns 0 when successful; otherwise, it returns an error code that is non-zero (@pxref{Error Codes, , Definition of Error Codes}). @menu * dld_find_executable:: Locating the Executable File @end menu @node dld_find_executable, , dld_init, dld_init @comment node-name, next, previous, up @subsection Locating the Executable File The path name of the executing process as required by @code{dld_init} might not be easily obtained all the time. Not all systems passes the entire path name of the executable file as the first argument (@code{argv[0]}) to @code{main}. In order to obtain the full path of the executable file, the @code{dld_find_executable} function can be used. This function has the following syntax: @example char *dld_find_executable (char *@var{command}) @end example @noindent @code{dld_find_executable} returns the absolute path name of the file that would be executed if @var{command} were given as a command. It looks up the environment variable @var{PATH}, searches in each of the directory listed for @var{command}, and returns the absolute path name for the first occurrence. Thus, it is advisable to invoke @code{dld_init} as: @example main (int argc, char **argv) @{ @dots{} if (dld_init (dld_find_executable (argv[0]))) @{ @dots{} @} @dots{} @} @end example @quotation @strong{Note:} If the current process is executed using the @code{execve} call without passing the correct path name as argument 0, @code{dld_find_executable (argv[0]) } will also fail to locate the executable file. @end quotation @code{dld_find_executable} returns zero if @code{command} is not found in any of the directories listed in @code{PATH}. @node dld_link, dld_unlink, dld_init, Top @comment node-name, next, previous, up @section Dynamically Linking in New Modules The function @code{dld_link} dynamically links in the named relocatable object or library file into memory. It has the following syntax: @example int dld_link (char *@var{filename}) @end example @noindent where @var{filename} is the path name of the file to be linked. Specifically, if the named file is a relocatable object file, it is completely loaded into memory. If it is a library file, only those modules defining an unresolved external reference are loaded. Since a module in the library may itself reference other routines in the library, loading it may generate more unresolved external references. Therefore, a library file is searched repeatedly until a scan through all library members is made without having to load any new modules. Storage for the text and data of the dynamically linked modules is allocated using @code{malloc}. In other words, they are kept in the @emph{heap} of the executing process. After all modules are loaded, @code{dld_link} resolves as many external references as possible. Note that some symbols might still be undefined at this stage, because the modules defining them have not yet been loaded. If the specified module is linked successfully, @code{dld_link} returns 0; otherwise, it returns a non-zero error code (@pxref{Error Codes, , Definition of Error Codes}). @node dld_unlink, dld_get_func, dld_link, Top @comment node-name, next, previous, up @section Unlinking a Module The major difference between dld and other dynamic linker is that dld allows object modules to be removed from the process anytime during execution. Unlinking a module is simply the reverse of the link operation (@pxref{Side Effect, , Important Points in Using Unlink}). The specified module is removed and the memory allocated to it is reclaimed. Additionally, resolution of external references must be undone. There are two unlink functions: @example int dld_unlink_by_file (char *@var{path}, int @var{hard}) int dld_unlink_by_symbol (char *@var{id}, int @var{hard}) @end example @noindent The two unlink functions are basically the same except that @code{dld_unlink_by_file} takes as argument the path name (@var{path}) of a file corresponding to a module previously linked in by @code{dld_link}, but @code{dld_unlink_by_symbol} unlinks the module that defines the specified symbol (@var{id}). Both functions take a second argument @var{hard}. When @var{hard} is non-zero (@dfn{hard unlink}), the specified module is removed from memory unconditionally. On the other hand, if @var{hard} is zero (@dfn{soft unlink}), this module is removed from memory only if it is not referenced by any other modules. Furthermore, if unlinking a module results in leaving some other modules being unreferenced, these unreferenced modules are also removed. Hard unlink is usually used when you want to explicitly remove a module and probably replace it by a different module with the same name. For example, you may want to replace the system's @code{printf} by your own version. When you link in your version of @code{printf}, dld will automatically redirect all references to @code{printf} to the new version. Soft unlink should be used when you are not sure if the specified module is still needed. If you just want to clean up unnecessary functions, it is always safe to use soft unlink. Both unlink functions returns 0 if the specified object file or symbol is previously loaded. Otherwise, they return a non-zero error code (@pxref{Error Codes, , Definition of Error Codes}). @menu * Side Effect:: Important Points in Using Unlink. @end menu @node Side Effect, , dld_unlink, dld_unlink @comment node-name, next, previous, up @subsection Important Points in Using Unlink When a module is being unlinked, dld tries to clean up as much as it can to restore the executing process to a state as if this module has never been linked. This clean up includes removing and reclaiming the memory for storing the text and data segment of the module, and @dfn{un-defining} any global symbols defined by this module. However, side effects---such as modification of global variables, input/output operations, and allocations of new memory blocks---caused by the execution of any function in this module are not reversed. Thus, it is the responsibility of the programmer to explicitly carry out all necessary clean up operations before unlinking a module. @node dld_get_func, Executability, dld_unlink, Top @comment node-name, next, previous, up @section Invoking Dynamically Linked Functions Dynamically linked functions may still be invoked from modules (e.g., @code{main}) that do not contain references to such functions. The function @code{dld_get_func} returns the entry point of the named function. This returned value can later be used as a pointer to the function. Similarly, the address of a global variable can be obtained by the function @code{dld_get_symbol}: @group @example unsigned long dld_get_symbol (char *@var{id}) unsigned long dld_get_func (char *@var{func}) @end example @end group @noindent A typical use of @code{dld_get_func} would be: @group @example @{ void (*func) (); int error_code; @dots{} /* First, link in the object file "my_object_file.o". Proceed only if the link operation is successful, i.e. it returns 0. "my_new_func" is a function defined in "my_object_file.o". Set func to point at the entry point of this function and then Invoke it indirectly through func. */ if ((error_code = dld_link ("my_object_file.o")) == 0) @{ if ((func = (void (*) ()) get_func ("my_new_func")) != 0) (*func) (); @dots{} @} else @{ @dots{} @} @} @end example @end group Both @code{dld_get_func} and @code{dld_get_symbol} return zero if the named function or symbol cannot be found. @node Executability, dld_list_undefined_sym, dld_get_func, Top @comment node-name, next, previous, up @section Determining If a Function is Executable Since dld allows modules to be added to or removed from an executing process dynamically, some global symbols may not be defined. As a result, an invocation of a function might reference an undefined symbol. We say that a function is @dfn{executable} if and only if all its external references have been fully resolved and all functions that it might call are executable. The predicate function @code{dld_function_executable_p} helps solve this problem by tracing the cross references between modules and returns non-zero only if the named function is executable. It has the following syntax: @example int dld_function_executable_p (char *@var{func}) @end example Note that the implementation of @code{dld_function_executable_p} is not complete according to the (recursive) definition of executability. External references through pointers are not traced. That is, @code{dld_function_executable_p} will still return non-zero if the named function uses a pointer to indirectly call another function which has already been unlinked. Furthermore, if one external reference of a object module is unresolved, all functions defined in this module are considered unexecutable. Therefore, @code{dld_function_executable_p} is usually too conservative. However, it is advisable to use @code{dld_function_executable_p} to check if a function is executable before its invocation. In such a dynamic environment where object modules are being added and removed, a function that is executable at one point in time might not be executable at another. Under most circumstances, @code{dld_function_executable_p} is accurate. Also, the implementation of this function has been optimized and it is relatively cheap to use. @node dld_list_undefined_sym, dld_create_reference, Executability, Top @comment node-name, next, previous, up @section Listing the Undefined Symbols The function @code{dld_list_undefined_sym} returns an array of undefined global symbol names. It has the following syntax: @example char **dld_list_undefined_sym () @end example @noindent The list returned contains all the symbols that have been referenced by some modules but have not been defined. This function is designed for debugging, especially in the case when a function is found to be not executable but you do not know what the missing symbols are. The length of the array is given by the global variable @code{dld_undefined_sym_count}, which always holds the current total number of undefined global symbols. Note that all C symbols are listed in their internal representation---i.e., they are prefixed by the underscore character @samp{_}. Storage for the array returned is allocated by @code{malloc}. It is the programmer's responsibility to release this storage by @code{free} when it is not needed anymore. @node dld_create_reference, Explicit Definition, dld_list_undefined_sym, Top @comment node-name, next, previous, up @section Explicitly Referencing a Symbol Normally, a library module is loaded only when it defines one of more symbols that has been referenced. To force a library routine to be loaded, one need to explicitly create a reference to a symbol defined by that library routine. The function @code{dld_create_reference} is designed for this purpose: @example int dld_create_reference (char *@var{name}) @end example @noindent Usually @var{name} is the name of the library routine that should be loaded, but it can be any symbol defined by that routine. After such a reference has been created, linking the appropriate library by @code{dld_link} would cause the required library routine to be loaded. If the call is successful, @code{dld_create_reference} returns 0; otherwise, it returns a non-zero error code (@pxref{Error Codes, , Definition of Error Codes}). The library routine loaded by this method can be unlinked by @code{dld_unlink_by_symbol (@var{name})}. Once it has been unlinked, the corresponding reference created by @code{dld_create_reference} is also removed so that this routine will not be loaded in again by subsequent linking of the library. @node Explicit Definition, dld_perror, dld_create_reference, Top @comment node-name, next, previous, up @section Explicitly Defining a Symbol Dld allows a programmer to explicitly define global symbols. That is, a programmer can force a symbol to have storage assigned for it. This is especially useful in incremental program testing where the function being tested needs to access some global variables which are defined by another function not yet linked in (or even not yet written). There are two functions related to explicit definition: @example int dld_define_sym (char *@var{name}, unsigned int @var{size}) void dld_remove_defined_symbol (char *@var{name}) @end example @noindent @code{dld_define_sym} forces dld to allocate @var{size} bytes for symbol @var{name}. It can be called before or after a reference to @var{name} is made. If references to @var{name} already exist when it is defined, all such references are directed to point to the correct address allocated for @var{name}. @code{dld_define_sym} returns 0 if successful. Otherwise, it returns a non-zero error code (@pxref{Error Codes, , Definition of Error Codes}). The typical error is a multiple definition of @var{name}. When the definition of @var{name} is no longer needed, it can be removed by @code{dld_remove_define_symbol}. @node dld_perror, Error Codes, Explicit Definition, Top @comment node-name, next, previous, up @section Printing out the Error Messages The function @code{dld_perror} prints out a short message explaining the error returns by the last dld functions: @example void dld_perror (char *@var{user_mesg}) @end example @noindent where @var{user_mesg} is a user-supplied string prepended to the error message. @node Error Codes, , dld_perror, Top @comment node-name, next, previous, up @section Definition of Error Codes The dld functions return a non-zero error code when they fail. The definitions of these error codes are: @group @quotation @iftex @tableindent = 1.5in @end iftex @table @code @item DLD_ENOFILE cannot open file. @item DLD_EBADMAGIC bad magic number. @item DLD_EBADHEADER failure reading header. @item DLD_ENOTEXT premature eof in text section. @item DLD_ENOSYMBOLS premature eof in symbols. @item DLD_ENOSTRINGS bad string table. @item DLD_ENOTXTRELOC premature eof in text relocation. @item DLD_ENODATA premature eof in data section. @item DLD_ENODATRELOC premature eof in data relocation. @item DLD_EMULTDEFS multiple definitions of symbol. @item DLD_EBADLIBRARY malformed library archive. @item DLD_EBADCOMMON common block not supported. @item DLD_EBADOBJECT malformed input file (not object file or archive). @item DLD_EBADRELOC bad relocation info. @item DLD_ENOMEMORY virtual memory exhausted. @item DLD_EUNDEFSYM undefined symbol. @end table @end quotation @end group @bye octave-1.1.0/dld/doc/dld.ps100666 415 17 257776 5021125142 13636 0ustar jweusers%!PS-Adobe-2.0 %%Creator: dvips 5.45 Copyright 1986-91 Radical Eye Software %%Title: dld.dvi %%Pages: 9 1 %%BoundingBox: 0 0 612 792 %%EndComments %%BeginProcSet: tex.pro /TeXDict 200 dict def TeXDict begin /N /def load def /B{bind def}N /S /exch load def /X{S N}B /TR /translate load N /isls false N /vsize 10 N /@rigin{ isls{[0 1 -1 0 0 0]concat}if 72 Resolution div 72 VResolution div neg scale Resolution VResolution vsize neg mul TR matrix currentmatrix dup dup 4 get round 4 exch put dup dup 5 get round 5 exch put setmatrix}N /@letter{/vsize 10 N}B /@landscape{/isls true N /vsize -1 N}B /@a4{/vsize 10.6929133858 N}B /@a3{ /vsize 15.5531 N}B /@ledger{/vsize 16 N}B /@legal{/vsize 13 N}B /@manualfeed{ statusdict /manualfeed true put}B /@copies{/#copies X}B /FMat[1 0 0 -1 0 0]N /FBB[0 0 0 0]N /nn 0 N /IE 0 N /ctr 0 N /df-tail{/nn 8 dict N nn begin /FontType 3 N /FontMatrix fntrx N /FontBBox FBB N string /base X array /BitMaps X /BuildChar{CharBuilder}N /Encoding IE N end dup{/foo setfont}2 array copy cvx N load 0 nn put /ctr 0 N[}B /df{/sf 1 N /fntrx FMat N df-tail} B /dfs{div /sf X /fntrx[sf 0 0 sf neg 0 0]N df-tail}B /E{pop nn dup definefont setfont}B /ch-width{ch-data dup length 5 sub get}B /ch-height{ch-data dup length 4 sub get}B /ch-xoff{128 ch-data dup length 3 sub get sub}B /ch-yoff{ ch-data dup length 2 sub get 127 sub}B /ch-dx{ch-data dup length 1 sub get}B /ch-image{ch-data dup type /stringtype ne{ctr get /ctr ctr 1 add N}if}B /id 0 N /rw 0 N /rc 0 N /gp 0 N /cp 0 N /G 0 N /sf 0 N /CharBuilder{save 3 1 roll S dup /base get 2 index get S /BitMaps get S get /ch-data X pop /ctr 0 N ch-dx 0 ch-xoff ch-yoff ch-height sub ch-xoff ch-width add ch-yoff setcachedevice ch-width ch-height true[1 0 0 -1 -.1 ch-xoff sub ch-yoff .1 add]{ch-image} imagemask restore}B /D{/cc X dup type /stringtype ne{]}if nn /base get cc ctr put nn /BitMaps get S ctr S sf 1 ne{dup dup length 1 sub dup 2 index S get sf div put}if put /ctr ctr 1 add N}B /I{cc 1 add D}B /bop{userdict /bop-hook known{bop-hook}if /SI save N @rigin 0 0 moveto}N /eop{clear SI restore showpage userdict /eop-hook known{eop-hook}if}N /@start{userdict /start-hook known{start-hook}if /VResolution X /Resolution X 1000 div /DVImag X /IE 256 array N 0 1 255{IE S 1 string dup 0 3 index put cvn put}for}N /p /show load N /RMat[1 0 0 -1 0 0]N /BDot 260 string N /rulex 0 N /ruley 0 N /v{/ruley X /rulex X V}B /V statusdict begin /product where{pop product 0 7 getinterval (Display)eq}{false}ifelse end{{gsave TR -.1 -.1 TR 1 1 scale rulex ruley false RMat{BDot}imagemask grestore}}{{gsave TR -.1 -.1 TR rulex ruley scale 1 1 false RMat{BDot}imagemask grestore}}ifelse B /a{moveto}B /delta 0 N /tail{dup /delta X 0 rmoveto}B /M{S p delta add tail}B /b{S p tail}B /c{-4 M}B /d{-3 M} B /e{-2 M}B /f{-1 M}B /g{0 M}B /h{1 M}B /i{2 M}B /j{3 M}B /k{4 M}B /w{0 rmoveto}B /l{p -4 w}B /m{p -3 w}B /n{p -2 w}B /o{p -1 w}B /q{p 1 w}B /r{p 2 w} B /s{p 3 w}B /t{p 4 w}B /x{0 S rmoveto}B /y{3 2 roll p a}B /bos{/SS save N}B /eos{clear SS restore}B end %%EndProcSet TeXDict begin 1000 300 300 @start /Fa 5 117 df<387CFEFEFE7C38000000000000387C FEFEFE7C3807147D930D>58 D78 D<03F8000FFE001F0F003E07 803C07807C07C07C07C0FC07C0FFFFC0FFFFC0FC0000FC0000FC00007C00007C00003E00C03E00 C01F038007FF0001FC0012147F9315>101 D<01F8000FFF001F0F803E07C07C03E07C03E07C03 E0FC03F0FC03F0FC03F0FC03F0FC03F0FC03F0FC03F07C03E07C03E03E07C01F0F800FFF0003FC 0014147F9317>111 D<0300030003000300070007000F000F003F00FFF8FFF81F001F001F001F 001F001F001F001F001F001F001F181F181F181F181F180F3007F003E00D1D7F9C12>116 D E /Fb 1 59 df<60F0F06004047C830C>58 D E /Fc 27 121 df<3C7EFFFFFFFF7E3C08087D 870F>46 D<00380000780001F800FFF800FFF800FFF80003F80003F80003F80003F80003F80003 F80003F80003F80003F80003F80003F80003F80003F80003F80003F80003F80003F80003F80003 F80003F80003F80003F80003F80003F80003F80003F8007FFFC07FFFC07FFFC012237CA21B>49 D<01FC0003FF0007FF800F0FC01F0FE03F87F03FC7F03FC7F03FC7F01F87F00F07E0000FE0000F C0000F80001F0001FE0001FF80000FC00007E00007F00003F80003F80803FC3E03FC7F03FCFF83 FCFF83FCFF83FCFF83F87F03F87E07F03E0FE01FFFC00FFF8001FC0016237EA21B>51 D69 DI< FFFFC0FFFFC0FFFFC007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800 07F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800 07F80007F80007F80007F80007F80007F80007F80007F800FFFFC0FFFFC0FFFFC012257EA416> 73 D76 D80 D85 D<07FC001FFF003E0F807F07C07F03E07F03F03E03F01C03F00003F0003FF003FFF00FF3F01F83 F03E03F07E03F0FC03F0FC03F0FC03F0FC03F0FC07F07E07F03E0DFF1FF8FF03F07F18187E971B >97 DI<00FE0003FF800F87C01F0FE03F0FE03F0FE07E07C07E0380FE0000FE0000FE0000 FE0000FE0000FE0000FE0000FE00007E00007E00E03F00E03F01C01F01C00F878003FF0000FC00 13187E9718>I<00FC0007FF000F87801F03C03F03E03E03E07E01E07E01F0FE01F0FE01F0FFFF F0FFFFF0FE0000FE0000FE0000FE00007E00007E00703F00703F00E01F00E00F83C003FF0000FE 0014187E9719>101 D<01FC1C07FF7E0F07FF1F07DF3E03EE7E03F47E03F07E03F07E03F07E03 F07E03F03E03E01F07C00F07801FFF0039FC003800003800003800003C00003FFFC03FFFF01FFF F80FFFFC1FFFFE7C007E78003FF8001FF8001FF8001FF8001F7C003E3C003C1F00F80FFFF001FF 8018247F971B>103 DI<0F001F803FC03FC03FC03FC01F800F0000000000000000000000 00000000FFC0FFC0FFC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00F C00FC00FC00FC0FFF8FFF8FFF80D277FA60F>I107 DIII<00FC0007FF800F87C01F03E03E01F03E01F07E01F87E01F8FE01FCFE 01FCFE01FCFE01FCFE01FCFE01FCFE01FCFE01FC7E01F87E01F87E01F83F03F01F03E00F87C007 FF8001FE0016187E971B>II114 D<07F3001FFF00381F00700F00F00700F00700F00700F80000FF00007FF0007FFC00 3FFE000FFF0003FF00003F80000F80600780E00780E00780F00700F00700FC1E00FFFC00C7F000 11187E9716>I<01C001C001C001C001C003C003C003C007C007C00FC03FFEFFFEFFFE0FC00FC0 0FC00FC00FC00FC00FC00FC00FC00FC00FC00FC70FC70FC70FC70FC70FC707C707EE03FC00F810 237FA215>II120 D E /Fd 61 126 df<70F8F8F8F8F8F8F8F8F8F8F8 F8F8F8F8F870000000000070F8F8F870051C779B18>33 D<4010E038F078E038E038E038E038E0 38E038E038E038E038E03860300D0E7B9C18>I<007000F001E003C007800F001E001C00380038 007000700070007000E000E000E000E000E000E000E000E0007000700070007000380038001C00 1E000F00078003C001F000F000700C24799F18>40 D<6000F00078003C001E000F000780038001 C001C000E000E000E000E00070007000700070007000700070007000E000E000E000E001C001C0 038007800F001E003C007800F00060000C247C9F18>I<01C00001C00001C00001C000C1C180F1 C780F9CF807FFF001FFC0007F00007F0001FFC007FFF00F9CF80F1C780C1C18001C00001C00001 C00001C00011147D9718>I<1C3E7E7F3F1F070E1E7CF860080C788518>44 D<3078FCFC78300606778518>46 D<000300000780000780000F80000F00001F00001E00001E00 003E00003C00007C0000780000780000F80000F00001F00001E00003E00003C00003C00007C000 0780000F80000F00000F00001F00001E00003E00003C00003C00007C0000780000F80000F00000 F0000060000011247D9F18>I<01F00007FC000FFE001F1F001C07003803807803C07001C07001 C0E000E0E000E0E000E0E000E0E000E0E000E0E000E0E000E0E000E0F001E07001C07001C07803 C03803801C07001F1F000FFE0007FC0001F000131C7E9B18>I<183C7E7E3C1800000000000000 00183C7E7E3E1E0E1C3C78F060071A789318>59 D<7FFFC0FFFFE0FFFFE0FFFFE0000000000000 000000000000FFFFE0FFFFE0FFFFE07FFFC0130C7E9318>61 D<00700000F80000F80000D80000 D80001DC0001DC0001DC00018C00038E00038E00038E00038E0003060007070007070007070007 07000FFF800FFF800FFF800E03800E03801C01C01C01C07F07F0FF8FF87F07F0151C7F9B18>65 DI<00F8E003FEE007FFE00F07E01E03E03C01E03800E07000E070 00E0700000E00000E00000E00000E00000E00000E00000E00000E000007000007000E07000E038 00E03C00E01E01C00F07C007FF8003FE0000F800131C7E9B18>I<7FF800FFFE007FFF001C0F80 1C03C01C03C01C01E01C00E01C00E01C00F01C00701C00701C00701C00701C00701C00701C0070 1C00701C00F01C00E01C00E01C01E01C01C01C03C01C0F807FFF00FFFE007FF800141C7F9B18> III<01F1C003FDC00FFFC01F0FC0 1C03C03803C03801C07001C07001C0700000E00000E00000E00000E00000E00000E00FF0E01FF0 E00FF07001C07001C07003C03803C03803C01C07C01F0FC00FFFC003FDC001F1C0141C7E9B18> I<7F07F0FF8FF87F07F01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01FFF C01FFFC01FFFC01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C07F07 F0FF8FF87F07F0151C7F9B18>I<7FFF00FFFF807FFF0001C00001C00001C00001C00001C00001 C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001 C00001C00001C00001C0007FFF00FFFF807FFF00111C7D9B18>I<01FFC003FFC001FFC0000E00 000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00 000E00000E00000E00000E00000E00F00E00F00E00F03C007FFC003FF0000FC000121C7D9B18> I<7FE000FFE0007FE0000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00 000E00000E00000E00000E00000E00000E00000E00000E00700E00700E00700E00700E00707FFF F0FFFFF07FFFF0141C7F9B18>76 DI<7E07F0FF0FF87F07F01D81 C01D81C01D81C01DC1C01CC1C01CC1C01CE1C01CE1C01CE1C01C61C01C71C01C71C01C31C01C39 C01C39C01C39C01C19C01C19C01C1DC01C0DC01C0DC01C0DC07F07C0FF87C07F03C0151C7F9B18 >I<0FF8003FFE007FFF00780F00700700F00780E00380E00380E00380E00380E00380E00380E0 0380E00380E00380E00380E00380E00380E00380E00380E00380E00380F00780700700780F007F FF003FFE000FF800111C7D9B18>II<7FF800FFFE007FFF001C0F 801C03801C03C01C01C01C01C01C01C01C03C01C03801C0F801FFF001FFE001FFE001C0F001C07 001C03801C03801C03801C03801C03801C039C1C039C1C039C7F01F8FF81F87F00F0161C7F9B18 >82 D<03F3801FFF803FFF807C0F80700780E00380E00380E00380E000007000007800003F0000 1FF00007FE0000FF00000F800003C00001C00000E00000E06000E0E000E0E001E0F001C0F80780 FFFF80FFFE00E7F800131C7E9B18>I<7FFFF8FFFFF8FFFFF8E07038E07038E07038E070380070 000070000070000070000070000070000070000070000070000070000070000070000070000070 0000700000700000700000700007FF0007FF0007FF00151C7F9B18>II<7F8FE07F9FE07F8FE00E07000F0700070E00078E00039C0003DC0001F80001F80000F000 00F00000700000F00000F80001F80001DC00039E00038E00070F000707000E07800E03801E03C0 7F07F0FF8FF87F07F0151C7F9B18>88 DI91 D93 D<7FFF00FFFF80FFFF807FFF0011047D7F18>95 D<1FE0003FF8007FFC00781E00300E0000 070000070000FF0007FF001FFF007F0700780700E00700E00700E00700F00F00781F003FFFF01F FBF007E1F014147D9318>97 D<7E0000FE00007E00000E00000E00000E00000E00000E00000E3E 000EFF800FFFC00FC1E00F80E00F00700E00700E00380E00380E00380E00380E00380E00380F00 700F00700F80E00FC1E00FFFC00EFF80063E00151C809B18>I<01FE0007FF001FFF803E078038 0300700000700000E00000E00000E00000E00000E00000E000007000007001C03801C03E03C01F FF8007FF0001FC0012147D9318>I<001F80003F80001F80000380000380000380000380000380 03E3800FFB801FFF803C1F80380F80700780700380E00380E00380E00380E00380E00380E00380 700780700780380F803C1F801FFFF00FFBF803E3F0151C7E9B18>I<01F00007FC001FFE003E0F 00380780700380700380E001C0E001C0FFFFC0FFFFC0FFFFC0E000007000007001C03801C03E03 C01FFF8007FF0001FC0012147D9318>I<001F80007FC000FFE000E1E001C0C001C00001C00001 C0007FFFC0FFFFC0FFFFC001C00001C00001C00001C00001C00001C00001C00001C00001C00001 C00001C00001C00001C00001C0007FFF007FFF007FFF00131C7F9B18>I<01E1F007FFF80FFFF8 1E1E301C0E003807003807003807003807003807001C0E001E1E001FFC001FF80039E000380000 1C00001FFE001FFFC03FFFE07801F0700070E00038E00038E00038E000387800F07E03F01FFFC0 0FFF8001FC00151F7F9318>I<7E0000FE00007E00000E00000E00000E00000E00000E00000E3E 000EFF800FFFC00FC1C00F80E00F00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00 E00E00E00E00E00E00E07FC3FCFFE7FE7FC3FC171C809B18>I<03800007C00007C00007C00003 80000000000000000000000000007FC000FFC0007FC00001C00001C00001C00001C00001C00001 C00001C00001C00001C00001C00001C00001C00001C00001C000FFFF00FFFF80FFFF00111D7C9C 18>I<0038007C007C007C003800000000000000000FFC1FFC0FFC001C001C001C001C001C001C 001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C6038F078FFF07F E03F800E277E9C18>II<7FE000FFE0007FE00000E00000E00000 E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000 E00000E00000E00000E00000E00000E00000E0007FFFC0FFFFE07FFFC0131C7E9B18>I<7CE0E0 00FFFBF8007FFFF8001F1F1C001E1E1C001E1E1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C 1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C007F1F1F00FFBFBF807F1F1F0019 14819318>I<7E3E00FEFF807FFFC00FC1C00F80E00F00E00E00E00E00E00E00E00E00E00E00E0 0E00E00E00E00E00E00E00E00E00E00E00E07FC3FCFFE7FE7FC3FC1714809318>I<01F0000FFE 001FFF003E0F803803807001C07001C0E000E0E000E0E000E0E000E0E000E0F001E07001C07803 C03C07803E0F801FFF000FFE0001F00013147E9318>I<7E3E00FEFF807FFFC00FC1E00F80E00F 00700E00700E00380E00380E00380E00380E00380E00380F00700F00700F80E00FC1E00FFFC00E FF800E3E000E00000E00000E00000E00000E00000E00000E00007FC000FFE0007FC000151E8093 18>I<7F87E0FF9FF07FBFF803F87803F03003E00003C00003C000038000038000038000038000 0380000380000380000380000380007FFE00FFFF007FFE0015147F9318>114 D<07F7003FFF007FFF00780F00E00700E00700E007007C00007FE0001FFC0003FE00001F006007 80E00380E00380F00380F80F00FFFF00FFFC00E7F00011147D9318>I<01800003800003800003 80000380007FFFC0FFFFC0FFFFC003800003800003800003800003800003800003800003800003 80000380400380E00380E00380E001C1C001FFC000FF80003E0013197F9818>I<7E07E0FE0FE0 7E07E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E0 0E01E00F03E007FFFC03FFFE01FCFC1714809318>I<7F8FF0FF8FF87F8FF01E03C00E03800E03 800E0380070700070700070700038E00038E00038E00038E0001DC0001DC0001DC0000F80000F8 0000700015147F9318>II< 7F8FF07F9FF07F8FF0070700078E00039E0001DC0001F80000F80000700000F00000F80001DC00 039E00038E000707000F07807F8FF0FF8FF87F8FF015147F9318>I<7F8FF0FF8FF87F8FF00E01 C00E03800E0380070380070700070700038700038600038E0001CE0001CE0000CC0000CC0000DC 0000780000780000780000700000700000700000F00000E00079E0007BC0007F80003F00001E00 00151E7F9318>I<0007E0001FE0007FE000780000E00000E00000E00000E00000E00000E00000 E00000E00000E00000E00000E00001E0007FC000FF8000FF80007FC00001E00000E00000E00000 E00000E00000E00000E00000E00000E00000E00000E00000E000007800007FE0001FE00007E013 247E9F18>123 D<7C0000FF0000FFC00003C00000E00000E00000E00000E00000E00000E00000 E00000E00000E00000E00000E00000F000007FC0003FE0003FE0007FC000F00000E00000E00000 E00000E00000E00000E00000E00000E00000E00000E00000E00003C000FFC000FF00007C000013 247E9F18>125 D E /Fe 48 123 df<0001FF0000001FFFC000007F80F00000FC00F80001F801 F80003F803FC0007F003FC0007F003FC0007F003FC0007F001F80007F000F00007F000000007F0 00000007F000000007F0000000FFFFFFFC00FFFFFFFC00FFFFFFFC0007F001FC0007F001FC0007 F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC00 07F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC0007F001FC 0007F001FC0007F001FC0007F001FC007FFF1FFFC07FFF1FFFC07FFF1FFFC0222A7FA926>12 D<1C003E007F00FF80FF80FF807F003E001C0009097B8813>46 D<003F800001FFF00007E0FC00 0FC07E001F803F001F803F003F001F803F001F807F001FC07F001FC07F001FC07F001FC0FF001F E0FF001FE0FF001FE0FF001FE0FF001FE0FF001FE0FF001FE0FF001FE0FF001FE0FF001FE0FF00 1FE0FF001FE0FF001FE0FF001FE0FF001FE07F001FC07F001FC07F001FC07F001FC03F001F803F 001F801F803F001F803F000FC07E0007E0FC0001FFF000003F80001B277DA622>48 D<000E00001E00007E0007FE00FFFE00FFFE00F8FE0000FE0000FE0000FE0000FE0000FE0000FE 0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE 0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE007FFFFE7FFFFE7FFF FE17277BA622>I<00FF800003FFF0000FFFFC001F03FE003800FF007C007F80FE003FC0FF003F C0FF003FE0FF001FE0FF001FE07E001FE03C003FE000003FE000003FC000003FC000007F800000 7F000000FE000000FC000001F8000003F0000003E00000078000000F0000001E0000003C00E000 7000E000E000E001C001C0038001C0070001C00FFFFFC01FFFFFC03FFFFFC07FFFFFC0FFFFFF80 FFFFFF80FFFFFF801B277DA622>I<007F800003FFF00007FFFC000F81FE001F00FF003F80FF00 3F807F803F807F803F807F801F807F800F007F800000FF000000FF000000FE000001FC000001F8 000007F00000FFC00000FFF0000001FC0000007E0000007F0000007F8000003FC000003FC00000 3FE000003FE03C003FE07E003FE0FF003FE0FF003FE0FF003FC0FF007FC07E007F807C007F003F 01FE001FFFFC0007FFF00000FF80001B277DA622>I<00000E0000001E0000003E0000007E0000 00FE000000FE000001FE000003FE0000077E00000E7E00000E7E00001C7E0000387E0000707E00 00E07E0000E07E0001C07E0003807E0007007E000E007E000E007E001C007E0038007E0070007E 00E0007E00FFFFFFF8FFFFFFF8FFFFFFF80000FE000000FE000000FE000000FE000000FE000000 FE000000FE000000FE00007FFFF8007FFFF8007FFFF81D277EA622>I<0C0003000F803F000FFF FE000FFFFC000FFFF8000FFFF0000FFFE0000FFFC0000FFE00000E0000000E0000000E0000000E 0000000E0000000E0000000E7FC0000FFFF8000F80FC000E003E000C003F0000001F8000001FC0 00001FC000001FE000001FE018001FE07C001FE0FE001FE0FE001FE0FE001FE0FE001FC0FC001F C078003F8078003F803C007F001F01FE000FFFF80003FFF00000FF80001B277DA622>I<0007F0 00003FFC0000FFFE0001FC0F0003F01F8007E03F800FC03F801FC03F801F803F803F801F003F80 00007F0000007F0000007F000000FF000000FF0FC000FF3FF800FF707C00FFC03E00FFC03F00FF 801F80FF801FC0FF001FC0FF001FE0FF001FE0FF001FE07F001FE07F001FE07F001FE07F001FE0 3F001FE03F001FC01F801FC01F803F800FC03F0007E07E0003FFFC0000FFF000003FC0001B277D A622>I<380000003E0000003FFFFFF03FFFFFF03FFFFFF07FFFFFE07FFFFFC07FFFFF807FFFFF 0070000E0070000E0070001C00E0003800E0007000E000E0000000E0000001C000000380000007 800000078000000F0000000F0000001F0000001F0000003F0000003E0000003E0000007E000000 7E0000007E0000007E000000FE000000FE000000FE000000FE000000FE000000FE000000FE0000 00FE0000007C0000003800001C297CA822>I<003FC00001FFF00003FFFC0007C07E000F003F00 1E001F001E000F803E000F803E000F803F000F803F000F803FC00F003FF01F001FFC1E001FFE3C 000FFFF80007FFE00003FFF80001FFFC0001FFFE0007FFFF000F0FFF801E03FFC03C01FFC07C00 7FE078001FE0F80007E0F80007E0F80003E0F80003E0F80003E0F80003C07C0003C07C0007803F 000F001FC03E000FFFFC0003FFF800007FC0001B277DA622>I<007F800001FFF00007FFF8000F E0FC001F807E003F803F007F003F007F001F80FF001F80FF001FC0FF001FC0FF001FC0FF001FE0 FF001FE0FF001FE0FF001FE07F001FE07F003FE03F003FE01F807FE00F807FE007C1DFE003FF9F E0007E1FE000001FE000001FC000001FC000001FC000003F801F003F803F803F003F803F003F80 7E003F807C001F01F8001E03F0000FFFE00007FF800001FE00001B277DA622>I<00003FF00180 0003FFFE0380000FFFFF8780003FF007DF8000FF8001FF8001FE00007F8003FC00003F8007F000 001F800FF000000F801FE0000007801FE0000007803FC0000007803FC0000003807FC000000380 7F80000003807F8000000000FF8000000000FF8000000000FF8000000000FF8000000000FF8000 000000FF8000000000FF8000000000FF8000000000FF80000000007F80000000007F8000000000 7FC0000003803FC0000003803FC0000003801FE0000003801FE0000007000FF00000070007F000 000E0003FC00001E0001FE00003C0000FF8000F800003FF007E000000FFFFFC0000003FFFF0000 00003FF8000029297CA832>67 DIII73 D76 DII80 D82 D<007F806003FFF0E007FFF9E00F807FE0 1F001FE03E0007E07C0003E07C0001E0FC0001E0FC0001E0FC0000E0FE0000E0FE0000E0FF0000 00FFC000007FFE00007FFFE0003FFFFC001FFFFE000FFFFF8007FFFFC003FFFFE000FFFFE00007 FFF000007FF000000FF8000007F8000003F8600001F8E00001F8E00001F8E00001F8F00001F0F0 0001F0F80003F0FC0003E0FF0007C0FFE01F80F3FFFF00E0FFFE00C01FF0001D297CA826>I85 D<01FF800007FFF0000F81F8001FC07E001FC07E00 1FC03F000F803F8007003F8000003F8000003F8000003F80000FFF8000FFFF8007FC3F800FE03F 803F803F803F003F807F003F80FE003F80FE003F80FE003F80FE003F807E007F807F00DF803F83 9FFC0FFF0FFC01FC03FC1E1B7E9A21>97 D I<001FF80000FFFE0003F01F0007E03F800FC03F801F803F803F801F007F800E007F0000007F00 0000FF000000FF000000FF000000FF000000FF000000FF000000FF0000007F0000007F0000007F 8000003F8001C01F8001C00FC0038007E0070003F01E0000FFFC00001FE0001A1B7E9A1F>I<00 003FF80000003FF80000003FF800000003F800000003F800000003F800000003F800000003F800 000003F800000003F800000003F800000003F800000003F800000003F800000003F800001FE3F8 0000FFFBF80003F03FF80007E00FF8000FC007F8001F8003F8003F8003F8007F0003F8007F0003 F8007F0003F800FF0003F800FF0003F800FF0003F800FF0003F800FF0003F800FF0003F800FF00 03F8007F0003F8007F0003F8007F0003F8003F8003F8001F8003F8000F8007F80007C00FF80003 F03BFF8000FFF3FF80003FC3FF80212A7EA926>I<003FE00001FFF80003F07E0007C01F000F80 1F801F800F803F800FC07F000FC07F0007C07F0007E0FF0007E0FF0007E0FFFFFFE0FFFFFFE0FF 000000FF000000FF0000007F0000007F0000007F0000003F8000E01F8000E00FC001C007E00380 03F81F0000FFFE00001FF0001B1B7E9A20>I<0007F0003FFC00FE3E01F87F03F87F03F07F07F0 7F07F03E07F00007F00007F00007F00007F00007F00007F000FFFFC0FFFFC0FFFFC007F00007F0 0007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F0 0007F00007F00007F00007F00007F00007F0007FFF807FFF807FFF80182A7EA915>I<00FF81F0 03FFE7F80FC1FE7C1F80FC7C1F007C383F007E107F007F007F007F007F007F007F007F007F007F 007F007F003F007E001F007C001F80FC000FC1F8001FFFE00018FF800038000000380000003C00 00003E0000003FFFF8001FFFFF001FFFFF800FFFFFC007FFFFE01FFFFFF03E0007F07C0001F8F8 0000F8F80000F8F80000F8F80000F87C0001F03C0001E01F0007C00FC01F8003FFFE00007FF000 1E287E9A22>II<07000F801FC03FE03FE0 3FE01FC00F8007000000000000000000000000000000FFE0FFE0FFE00FE00FE00FE00FE00FE00F E00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE0FFFEFFFEFFFE0F2B 7DAA14>I107 DI< FFC07F800FF000FFC1FFE03FFC00FFC383F0707E000FC603F8C07F000FCC01F9803F000FD801FF 003F800FF001FE003F800FF001FE003F800FE001FC003F800FE001FC003F800FE001FC003F800F E001FC003F800FE001FC003F800FE001FC003F800FE001FC003F800FE001FC003F800FE001FC00 3F800FE001FC003F800FE001FC003F800FE001FC003F800FE001FC003F800FE001FC003F800FE0 01FC003F800FE001FC003F80FFFE1FFFC3FFF8FFFE1FFFC3FFF8FFFE1FFFC3FFF8351B7D9A3A> II<003FE00001FFFC0003F07E000F C01F801F800FC03F800FE03F0007E07F0007F07F0007F07F0007F0FF0007F8FF0007F8FF0007F8 FF0007F8FF0007F8FF0007F8FF0007F8FF0007F87F0007F07F0007F03F800FE03F800FE01F800F C00FC01F8007F07F0001FFFC00003FE0001D1B7E9A22>II114 D<03FE300FFFF01E03F03800F0700070F00070F00070F80070FC0000FFE0007FFE007FFF 803FFFE01FFFF007FFF800FFF80003FC0000FC60007CE0003CF0003CF00038F80038FC0070FF01 E0F7FFC0C1FF00161B7E9A1B>I<00700000700000700000700000F00000F00000F00001F00003 F00003F00007F0001FFFF0FFFFF0FFFFF007F00007F00007F00007F00007F00007F00007F00007 F00007F00007F00007F00007F00007F00007F03807F03807F03807F03807F03807F03803F03803 F87001F86000FFC0001F8015267FA51B>IIIIII<3FFFFF80 3FFFFF803F007F003C00FE003801FE007803FC007803F8007007F800700FF000700FE000001FC0 00003FC000007F8000007F000000FF000001FE038001FC038003F8038007F803800FF007800FE0 07801FE007003FC00F003F801F007F007F00FFFFFF00FFFFFF00191B7E9A1F>I E /Ff 31 123 df<0003E0001C1800381800703C00E03C00E03801C00001C00001C00001C00001 C0000380007FFFF00380700380700380700380700700E00700E00700E00700E00700E00700E00E 01C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FF0FF816207E9F19>12 D45 D<0000100000001800000038000000380000007800000078000000 FC000001BC0000013C0000033C0000023C0000063C0000043E0000081E0000081E0000101E0000 101E0000201E0000200F0000400F0000400F0000FFFF0000800F0001000F800100078002000780 0200078004000780040007800C0007C03E0007C0FF807FFC1E207E9F22>65 D<07FFFF00007C01E0003C00F0003C00780078003C0078003C0078001E0078001E0078001E0078 001F00F0001F00F0001F00F0001F00F0001F00F0001F00F0001F01E0001E01E0003E01E0003E01 E0003E01E0003C01E0007C03C0007803C000F003C000F003C001E003C003C003C0078007800F00 07803C00FFFFE000201F7E9E23>68 D<0001FC04000F030C003C009C0070007C00E0003C01C000 3803800018078000180F0000181F0000181E0000183E0000103C0000007C0000007C0000007C00 00007C000000F8000000F8000000F8007FFCF80003E0780001E0780001E0780003C0780003C03C 0003C03C0003C01C0003C00E0007C007000B800380118001E06080003F80001E217B9F24>71 D<07FFC7FFC0007C00F800003C007800003C007800007800F000007800F000007800F000007800 F000007800F000007800F00000F001E00000F001E00000F001E00000F001E00000FFFFE00000F0 01E00001E003C00001E003C00001E003C00001E003C00001E003C00001E003C00003C007800003 C007800003C007800003C007800003C007800003C007800007800F000007C00F8000FFF8FFF800 221F7E9E22>I<07FFF000007E0000003C0000003C000000780000007800000078000000780000 007800000078000000F0000000F0000000F0000000F0000000F0000000F0000001E0000001E000 0001E0000001E0000001E0008001E0010003C0010003C0010003C0030003C0020003C0060003C0 060007801E0007807C00FFFFFC00191F7E9E1C>76 D<07FFFF00007C03C0003C01E0003C00F000 7800F0007800F8007800F8007800F8007800F8007800F000F001F000F001E000F003C000F00780 00F00F0000FFF80001E0000001E0000001E0000001E0000001E0000001E0000003C0000003C000 0003C0000003C0000003C0000003C000000780000007C00000FFFC00001D1F7E9E1F>80 D<3FFFFFF03C0780F03007803060078030400F0010400F0010C00F0010800F0010800F0010800F 0010001E0000001E0000001E0000001E0000001E0000001E0000003C0000003C0000003C000000 3C0000003C0000003C000000780000007800000078000000780000007800000078000000F00000 01F800007FFFE0001C1F7A9E21>84 D<07F8000C0C001E06001E07001C07000007000007000007 0000FF0007C7001E07003C0E00780E00F00E10F00E10F00E10F01E10F02E20784F401F87801414 7D9317>97 D<0700003F00000F00000700000700000E00000E00000E00000E00000E00000E0000 1C00001C7C001D87001E03801C01C01C01C03801C03801E03801E03801E03801E03801E07003C0 7003C0700380700780700700700E00E81C00C4380083E00013207B9F19>I<01FC07060E0F1C0F 380E78007000F000F000F000F000E000E000E000E000F0027004300818300FC010147C9314>I< 0000700003F00000F00000700000700000E00000E00000E00000E00000E00000E00001C000F9C0 0305C00E03C01C03C03801C0780380700380F00380F00380F00380F00380E00700E00700E00700 E00700E00700700F00301E00186F000F8FE014207C9F19>I<00F800070E000E07001C07003803 80780380700380F00380F00380FFFF80F00000E00000E00000E00000E00000F001007002003004 001C180007E00011147D9314>I<0007800018C00031E00061E000E1C000C00001C00001C00001 C00001C00001C0000380007FF80003800003800003800003800007000007000007000007000007 00000700000E00000E00000E00000E00000E00000E00001C00001E0000FFE00013207E9F0E>I< 00000E003E1100E1A301C1C20381E00780E00701E00F01E00F01E00F01E00703C0070380078700 04FC000800000800001800001C00000FFF000FFFC007FFE01800F0300030600030C00030C00030 C000306000603000C01C070007FC00181F809417>I<00E00007E00001E00000E00000E00001C0 0001C00001C00001C00001C00001C000038000038F800390E003A0E003C0600380600780E00700 E00700E00700E00700E00700E00E01C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FFCF F815207E9F19>I<01C003E003E003C0018000000000000000000000000003801F800780038003 800700070007000700070007000E000E000E000E000E000E001C001E00FF800B1F7F9E0C>I<00 E00007E00001E00000E00000E00001C00001C00001C00001C00001C00001C0000380000383FC03 80F00380C0038180038100070400070800071800073800077C00071C000E1C000E0E000E0E000E 0F000E07000E07801C03801E07C0FF8FF016207E9F18>107 D<00E007E001E000E000E001C001 C001C001C001C001C00380038003800380038003800700070007000700070007000E000E000E00 0E000E000E001C001E00FFC00B207F9F0C>I<0387C07C001F9861860007A072070003C0340300 03803803000780780700070070070007007007000700700700070070070007007007000E00E00E 000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E001C01C01C001E01E01E00FFCFFC FFC022147E9326>I<038F801F90E007A0E003C0600380600780E00700E00700E00700E00700E0 0700E00E01C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FFCFF815147E9319>I<00FC 000387000E01801C00C03800E03800E07000F0F000F0F000F0F000F0F000F0E001E0E001E0E001 C0E003C0F00380700700380E001C1C0007E00014147D9317>I<00E3E007EC3800F01C00E01E00 E00E01C00E01C00F01C00F01C00F01C00F01C00F03801E03801E03801C03803C03803803807007 40E00721C0071F000700000700000700000E00000E00000E00000E00001E0000FFC000181D8093 19>I<038E001FB38007C78003C7800383000780000700000700000700000700000700000E0000 0E00000E00000E00000E00000E00001C00001E0000FFE00011147E9312>114 D<01F2060E080618061802380438001E001FE00FF003F8003C401C400C400C600C6018E010D060 8FC00F147E9312>I<0080010001000100030007000F001E00FFF80E000E000E000E001C001C00 1C001C001C001C00380038203820382038203840384018800F000D1C7C9B12>I<1C0380FC1F80 3C07801C03801C0380380700380700380700380700380700380700700E00700E00700E00700E00 701E00701E00703C00305E001F9FC012147B9319>I<1FF0FF03C07801C06001C04000E08000E1 80007300007600003C00003C00001C00002E00004E000087000107000203800603800C01C03E03 E0FF07FC18147F9318>120 D<0FF83F8001E00E0001C00C0001C0080000E0180000E0100000E0 200000E0200000F040000070400000708000007080000071000000390000003A0000003E000000 3C00000038000000180000001000000010000000200000002000000040000070C00000F0800000 F1000000E20000007C000000191D809318>I<07FFE00701E00401C00C0380080700080E00101C 0000380000700000700000E00001C0000380800700800E00801C01001C0100380300700E00FFFE 0013147F9314>I E /Fg 11 117 df<1F003F807FC0FFE0FFE0FFE0FFE0FFE07FC03F801F000B 0B7A8A17>46 D<0001E0000003E000000FE000007FE0001FFFE000FFFFE000FFBFE000E03FE000 003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE0 00003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003F E000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE000003FE00000 3FE000003FE000003FE000003FE000003FE000003FE0007FFFFFF07FFFFFF07FFFFFF01C2E7AAD 29>49 D<00FFE00003FFFC000FFFFF001F007F803C003FC07E001FE07F001FE0FF801FF0FF801F F0FF801FF0FF801FF07F001FF03E003FE01C003FC000007F800000FF000001FE000001F8000003 F0000007E0000007C000000F8000000F0000000E0000000E0000001E0000001C0000001C000000 1C0000001C0000001C0000001C0000001C00000000000000000000000000000000000000000000 00000000001C0000007F000000FF800000FF800001FFC00001FFC00001FFC00000FF800000FF80 00007F0000001C00001C327BB127>63 D87 D<007FF8000003FFFF000007FFFFC0000FE01FE0001FF007F0001FF003F8001F F003FC001FF001FE000FE001FE0007C001FE00010001FE00000001FE00000001FE000001FFFE00 003FFFFE0001FFF1FE0007FE01FE000FF001FE001FC001FE003F8001FE007F8001FE00FF0001FE 00FF0001FE00FF0001FE00FF0001FE00FF0003FE007F8003FE007FC00EFE003FF03CFF000FFFF8 7FF807FFF03FF800FF800FF825207E9F28>97 D<00000007E0000003FFE0000003FFE0000003FF E00000003FE00000001FE00000001FE00000001FE00000001FE00000001FE00000001FE0000000 1FE00000001FE00000001FE00000001FE00000001FE00000001FE00000001FE0000FF81FE0007F FF1FE001FFFFDFE003FE03FFE007F800FFE00FE0003FE01FE0001FE03FC0001FE03FC0001FE07F 80001FE07F80001FE07F80001FE0FF80001FE0FF80001FE0FF80001FE0FF80001FE0FF80001FE0 FF80001FE0FF80001FE0FF80001FE07F80001FE07F80001FE07F80001FE03FC0001FE03FC0001F E01FC0003FE00FE0007FE007F001FFE003FC07DFF001FFFF9FFF007FFE1FFF000FF01FFF28327D B12E>100 D<01F800000000FFF800000000FFF800000000FFF8000000000FF80000000007F800 00000007F80000000007F80000000007F80000000007F80000000007F80000000007F800000000 07F80000000007F80000000007F80000000007F80000000007F80000000007F80000000007F807 F8000007F83FFF000007F87FFF800007F8F03FC00007F9C01FE00007FB000FE00007FE000FF000 07FE000FF00007FC000FF00007FC000FF00007F8000FF00007F8000FF00007F8000FF00007F800 0FF00007F8000FF00007F8000FF00007F8000FF00007F8000FF00007F8000FF00007F8000FF000 07F8000FF00007F8000FF00007F8000FF00007F8000FF00007F8000FF00007F8000FF00007F800 0FF00007F8000FF00007F8000FF000FFFFC1FFFF80FFFFC1FFFF80FFFFC1FFFF8029327DB12E> 104 D<01C00007F0000FF8000FF8001FFC001FFC001FFC000FF8000FF80007F00001C000000000 00000000000000000000000000000000000000000001F800FFF800FFF800FFF8000FF80007F800 07F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800 07F80007F80007F80007F80007F80007F80007F80007F80007F80007F800FFFF80FFFF80FFFF80 11337DB217>I<01F800FFF800FFF800FFF8000FF80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800FFFFC0FFFFC0FFFF C012327DB117>108 D<00FF870007FFEF001FFFFF003F007F003C001F0078000F00F8000700F8 000700F8000700FC000700FF000000FFF800007FFFC0003FFFF0003FFFFC000FFFFE0007FFFF00 01FFFF80001FFF800000FFC000001FC060000FC0E00007C0E00007C0F00007C0F8000780F8000F 80FE000F00FF803E00FFFFFC00F3FFF800C07FC0001A207D9F21>115 D<003800003800003800 00380000380000780000780000780000F80000F80001F80003F80007F8001FF800FFFFFEFFFFFE FFFFFE07F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800 07F80007F80007F80007F80007F80707F80707F80707F80707F80707F80707F80703F80E03FC0E 01FE1C00FFF8007FF0000FE0182E7EAD20>I E /Fh 10 122 df<1C007F007F00FF80FF80FF80 7F007F001C0009097B8813>46 D72 D87 D98 D<07000F801FC03FE03FE03FE01FC00F80070000000000000000000000000000 00FFE0FFE0FFE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE0 0FE00FE00FE00FE00FE0FFFEFFFEFFFE0F2B7EAA12>105 D108 D110 D<003FE00001FFFC0003F07E000FC01F801F800FC03F0007E03F0007E07E0003F07E0003F07E00 03F0FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F87E0003F07E 0003F03F0007E03F0007E01F800FC00FC01F8007F07F0001FFFC00003FE0001D1B7E9A22>I<03 FE300FFFF03E03F07800F07000F0F00070F00070F80070FE0000FFE0007FFF007FFFC03FFFE01F FFF007FFF800FFF80007FC0000FCE0007CE0003CF0003CF00038F80038FC0070FF01E0E7FFC0C1 FF00161B7E9A1B>115 D121 D E /Fi 1 14 df<0003FE0000000FFF8000003C 01E00000F000780001C0001C00030000060006000003000C0000018018000000C018000000C030 000000603000000060600000003060000000306000000030C000000018C000000018C000000018 C000000018C000000018C000000018C000000018C000000018C000000018600000003060000000 3060000000303000000060300000006018000000C018000000C00C000001800600000300030000 060001C0001C0000F0007800003C01E000000FFF80000003FE000025277E9D2A>13 D E /Fj 71 125 df<001F83E000F06E3001C078780380F8780300F03007007000070070000700 700007007000070070000700700007007000FFFFFF800700700007007000070070000700700007 007000070070000700700007007000070070000700700007007000070070000700700007007000 070070000700700007007000070070007FE3FF001D20809F1B>11 D<003F0000E0C001C0C00381 E00701E00701E0070000070000070000070000070000070000FFFFE00700E00700E00700E00700 E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700 E00700E07FC3FE1720809F19>I<70F8FCFC74040404080810102040060E7C9F0D>39 D<0020004000800100020006000C000C00180018003000300030007000600060006000E000E000 E000E000E000E000E000E000E000E000E000E0006000600060007000300030003000180018000C 000C000600020001000080004000200B2E7DA112>I<800040002000100008000C000600060003 00030001800180018001C000C000C000C000E000E000E000E000E000E000E000E000E000E000E0 00E000C000C000C001C001800180018003000300060006000C00080010002000400080000B2E7D A112>I<70F8FCFC74040404080810102040060E7C840D>44 DI<70F8F8 F87005057C840D>I<000100030003000600060006000C000C000C001800180018003000300030 00600060006000C000C000C00180018001800300030003000600060006000C000C000C00180018 001800300030003000600060006000C000C000C000102D7DA117>I<03F0000E1C001C0E001806 00380700700380700380700380700380F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003 C0F003C0F003C0F003C0F003C0F003C07003807003807003807807803807001806001C0E000E1C 0003F000121F7E9D17>I<018003800F80F3800380038003800380038003800380038003800380 0380038003800380038003800380038003800380038003800380038007C0FFFE0F1E7C9D17>I< 03F0000C1C00100E00200700400780800780F007C0F803C0F803C0F803C02007C00007C0000780 000780000F00000E00001C0000380000700000600000C0000180000300000600400C0040180040 1000803FFF807FFF80FFFF80121E7E9D17>I<03F0000C1C00100E00200F00780F807807807807 80380F80000F80000F00000F00000E00001C0000380003F000003C00000E00000F000007800007 800007C02007C0F807C0F807C0F807C0F00780400780400F00200E001C3C0003F000121F7E9D17 >I<000600000600000E00000E00001E00002E00002E00004E00008E00008E00010E00020E0002 0E00040E00080E00080E00100E00200E00200E00400E00C00E00FFFFF0000E00000E00000E0000 0E00000E00000E00000E0000FFE0141E7F9D17>I<1803001FFE001FFC001FF8001FE000100000 10000010000010000010000010000011F000161C00180E001007001007800003800003800003C0 0003C00003C07003C0F003C0F003C0E00380400380400700200600100E000C380003E000121F7E 9D17>I<007C000182000701000E03800C07801C0780380300380000780000700000700000F1F0 00F21C00F40600F80700F80380F80380F003C0F003C0F003C0F003C0F003C07003C07003C07003 803803803807001807000C0E00061C0001F000121F7E9D17>I<4000007FFFC07FFF807FFF8040 010080020080020080040000080000080000100000200000200000400000400000C00000C00001 C00001800003800003800003800003800007800007800007800007800007800007800007800003 0000121F7D9D17>I<03F0000C0C00100600300300200180600180600180600180700180780300 3E03003F06001FC8000FF00003F80007FC000C7E00103F00300F806003804001C0C001C0C000C0 C000C0C000C0C000806001802001001002000C0C0003F000121F7E9D17>I<03F0000E18001C0C 00380600380700700700700380F00380F00380F003C0F003C0F003C0F003C0F003C07007C07007 C03807C0180BC00E13C003E3C0000380000380000380000700300700780600780E00700C002018 001070000FC000121F7E9D17>I<70F8F8F8700000000000000000000070F8F8F87005147C930D> I<70F8F8F8700000000000000000000070F0F8F878080808101010202040051D7C930D>I<0001 00000003800000038000000380000007C0000007C0000007C0000009E0000009E0000009E00000 10F0000010F0000010F00000207800002078000020780000403C0000403C0000403C0000801E00 00801E0000FFFE0001000F0001000F0001000F00020007800200078002000780040003C00E0003 C01F0007E0FFC03FFE1F207F9F22>65 DI<000FC040007030C0 01C009C0038005C0070003C00E0001C01E0000C01C0000C03C0000C07C0000407C000040780000 40F8000000F8000000F8000000F8000000F8000000F8000000F8000000F8000000F80000007800 00007C0000407C0000403C0000401C0000401E0000800E000080070001000380020001C0040000 703800000FC0001A217D9F21>IIII72 DI76 D78 D<001F800000F0F00001 C0380007801E000F000F000E0007001E0007803C0003C03C0003C07C0003E0780001E0780001E0 F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0780001 E07C0003E07C0003E03C0003C03C0003C01E0007800E0007000F000F0007801E0001C0380000F0 F000001F80001C217D9F23>II82 D<07E0800C1980100780300380600180600180E00180E00080E00080E00080F000 00F000007800007F00003FF0001FFC000FFE0003FF00001F800007800003C00003C00001C08001 C08001C08001C08001C0C00180C00380E00300F00600CE0C0081F80012217D9F19>I<7FFFFFE0 780F01E0600F0060400F0020400F0020C00F0030800F0010800F0010800F0010800F0010000F00 00000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F 0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000001F800007 FFFE001C1F7E9E21>IIII<7FF83FF80FE00FC007C0070003C0020001E0040001F00C0000F00800 00781000007C1000003C2000003E4000001E4000000F8000000F8000000780000003C0000007E0 000005E0000009F0000018F8000010780000207C0000603C0000401E0000801F0001800F000100 0780020007C0070003C01F8007E0FFE01FFE1F1F7F9E22>I91 D93 D<081020204040808080B8FCFC7C38060E7D9F0D>96 D<1FE000303000781800781C00300E00000E00000E00000E0000FE00078E001E0E00380E00780E 00F00E10F00E10F00E10F01E10781E103867200F83C014147E9317>I<0E0000FE00000E00000E 00000E00000E00000E00000E00000E00000E00000E00000E00000E3E000EC3800F01C00F00E00E 00E00E00700E00700E00780E00780E00780E00780E00780E00780E00700E00700E00E00F00E00D 01C00CC300083E0015207F9F19>I<03F80E0C1C1E381E380C70007000F000F000F000F000F000 F00070007000380138011C020E0C03F010147E9314>I<000380003F8000038000038000038000 038000038000038000038000038000038000038003E380061B801C078038038038038070038070 0380F00380F00380F00380F00380F00380F003807003807003803803803807801C07800E1B8003 E3F815207E9F19>I<03F0000E1C001C0E00380700380700700700700380F00380F00380FFFF80 F00000F00000F000007000007000003800801800800C010007060001F80011147F9314>I<007C 00C6018F038F07060700070007000700070007000700FFF0070007000700070007000700070007 0007000700070007000700070007000700070007007FF01020809F0E>I<0000E003E3300E3C30 1C1C30380E00780F00780F00780F00780F00780F00380E001C1C001E380033E000200000200000 3000003000003FFE001FFF800FFFC03001E0600070C00030C00030C00030C000306000603000C0 1C038003FC00141F7F9417>I<0E0000FE00000E00000E00000E00000E00000E00000E00000E00 000E00000E00000E00000E3E000E43000E81800F01C00F01C00E01C00E01C00E01C00E01C00E01 C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C0FFE7FC16207F9F19>I<1C 003E003E003E001C000000000000000000000000000E007E000E000E000E000E000E000E000E00 0E000E000E000E000E000E000E000E000E000E00FFC00A1F809E0C>I<00E001F001F001F000E0 000000000000000000000000007007F000F0007000700070007000700070007000700070007000 7000700070007000700070007000700070007000706070F060F0C061803F000C28829E0E>I<0E 0000FE00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E0FF00E 03C00E03000E02000E04000E08000E10000E30000E70000EF8000F38000E1C000E1E000E0E000E 07000E07800E03800E03C00E03E0FFCFF815207F9F18>I<0E00FE000E000E000E000E000E000E 000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E00 0E000E000E000E00FFE00B20809F0C>I<0E1F01F000FE618618000E81C81C000F00F00E000F00 F00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E 00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E00FFE7FE7FE0 23147F9326>I<0E3E00FE43000E81800F01C00F01C00E01C00E01C00E01C00E01C00E01C00E01 C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C0FFE7FC16147F9319>I<01F80007 0E001C03803801C03801C07000E07000E0F000F0F000F0F000F0F000F0F000F0F000F07000E070 00E03801C03801C01C0380070E0001F80014147F9317>I<0E3E00FEC3800F01C00F00E00E00E0 0E00F00E00700E00780E00780E00780E00780E00780E00780E00700E00F00E00E00F01E00F01C0 0EC3000E3E000E00000E00000E00000E00000E00000E00000E00000E0000FFE000151D7F9319> I<03E0800619801C05803C0780380380780380700380F00380F00380F00380F00380F00380F003 807003807803803803803807801C0B800E138003E3800003800003800003800003800003800003 80000380000380003FF8151D7E9318>I<0E78FE8C0F1E0F1E0F0C0E000E000E000E000E000E00 0E000E000E000E000E000E000E000E00FFE00F147F9312>I<1F9030704030C010C010C010E000 78007F803FE00FF00070803880188018C018C018E030D0608F800D147E9312>I<020002000200 060006000E000E003E00FFF80E000E000E000E000E000E000E000E000E000E000E000E080E080E 080E080E080610031001E00D1C7F9B12>I<0E01C0FE1FC00E01C00E01C00E01C00E01C00E01C0 0E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E03C00603C0030DC001F1FC 16147F9319>III<7FC3FC0F01E00701C007018003810001C20000E40000EC00007800003800003C0000 7C00004E000087000107000303800201C00601E01E01E0FF07FE1714809318>II<3FFF380E200E201C40384078407000E001E001C00380078007010E011E 011C0338027006700EFFFE10147F9314>II I E /Fk 3 109 df68 D<00000000007FC00000000000FFFF C00000000000FFFFC00000000000FFFFC00000000000FFFFC00000000000FFFFC0000000000003 FFC0000000000001FFC0000000000001FFC0000000000001FFC0000000000001FFC00000000000 01FFC0000000000001FFC0000000000001FFC0000000000001FFC0000000000001FFC000000000 0001FFC0000000000001FFC0000000000001FFC0000000000001FFC0000000000001FFC0000000 000001FFC0000000000001FFC0000000000001FFC0000000000001FFC0000000000001FFC00000 000FFC01FFC0000000FFFF81FFC0000007FFFFE1FFC000001FFFFFF9FFC000007FFC03FFFFC000 00FFF0007FFFC00001FFC0001FFFC00003FF80000FFFC00007FF000007FFC0000FFE000003FFC0 000FFE000003FFC0001FFC000003FFC0001FFC000003FFC0003FFC000003FFC0003FFC000003FF C0007FF8000003FFC0007FF8000003FFC0007FF8000003FFC000FFF8000003FFC000FFF8000003 FFC000FFF8000003FFC000FFF8000003FFC000FFF8000003FFC000FFF8000003FFC000FFF80000 03FFC000FFF8000003FFC000FFF8000003FFC000FFF8000003FFC0007FF8000003FFC0007FF800 0003FFC0007FF8000003FFC0003FF8000003FFC0003FFC000003FFC0003FFC000003FFC0001FFC 000003FFC0001FFC000003FFC0000FFE000007FFC00007FF00000FFFC00003FF00001FFFC00001 FFC0003FFFC00000FFE000FFFFE000007FF807FBFFFF80001FFFFFF3FFFF800007FFFFC3FFFF80 0001FFFF03FFFF8000001FF803FFFF8039487CC742>100 D<007FC000FFFFC000FFFFC000FFFF C000FFFFC000FFFFC00003FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001 FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC000 01FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC0 0001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FF C00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001 FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC00001FFC000 01FFC00001FFC00001FFC00001FFC00001FFC000FFFFFF80FFFFFF80FFFFFF80FFFFFF80FFFFFF 8019487CC720>108 D E end %%EndProlog %%BeginSetup %%Feature: *Resolution 300 TeXDict begin %%EndSetup %%Page: 1 1 bop 0 705 a Fk(Dld)p 0 738 1950 17 v 1319 789 a Fj(A)15 b(Dynamic)h (Link/Unlink)i(Editor)1682 843 y(V)l(ersion)e(3.2.3.)1277 897 y(Cop)o(yrigh)o(t)1501 896 y(c)1490 897 y Fi(\015)f Fj(1991)f(W.)h(Wilson)h (Ho.)0 2534 y Fh(b)n(y)23 b(W.)g(Wilson)h(Ho)p 0 2570 1950 9 v eop %%Page: 1 2 bop 971 -58 a Fj(1)0 183 y Fg(1.)41 b(What)28 b(is)f(dld?)62 354 y Ff(Dld)c Fj(is)e(a)f(library)h(pac)o(k)m(age)f(of)g(C)g(functions)h (that)f(p)q(erforms)g Ff(dynamic)h(link)h(editing)p Fj(.)37 b(Programs)19 b(that)0 416 y(use)j(dld)h(can)f(add)g(compiled)i(ob)s(ject)d (co)q(de)h(to)g(or)f(remo)o(v)o(e)g(suc)o(h)h(co)q(de)h(from)e(a)g(pro)q (cess)h(an)o(ytime)g(during)0 478 y(its)d(execution.)31 b(Loading)20 b(mo)q(dules,)g(searc)o(hing)f(libraries,)i(resolving)e(external)g (references,)h(and)f(allo)q(cating)0 540 y(storage)14 b(for)h(global)g(and)h (static)f(data)f(structures)h(are)g(all)h(p)q(erformed)g(at)e(run)i(time.)62 677 y(Dld)g(is)g(no)o(w)e(a)o(v)m(ailable)j(for)e(V)-5 b(AX,)15 b(Sun)h(3,)e(SP)l(AR)o(Cstation,)h(Sequen)o(t)h(Symmetry)l(,)f(and)g(A)o (tari)g(ST.)62 814 y(This)e(text)e(describ)q(es)j(ho)o(w)d(the)h(dld)h (functions)g(can)f(b)q(e)h(called)g(and)f(some)g(tec)o(hnical)h(details)g (that)e(should)i(b)q(e)0 877 y(a)o(w)o(are)f(of.)19 b(F)l(or)13 b(the)h(in)o(ternals)g(of)f(dld)i(and)f(sample)g(applications,)h(please)f (refer)g(to)f Ff(An)g(Approac)o(h)h(to)f(Gen)o(uine)0 939 y(Dynamic)18 b(Linking)p Fj(,)h(Soft)o(w)o(are{Practice)d(and)h(Exp)q(erirnce,)i(V)l(ol.) 26 b(21\(4\),)16 b(375-390)g(\(April)i(1991\).)24 b(An)18 b(early)0 1001 y(draft)d(of)f(that)h(pap)q(er)g(is)h(included)i(with)d(this)h (distribution.)0 1209 y Fe(1.1)35 b(Initializi)o(ng)20 b(Dld)62 1346 y Fj(T)l(o)d(use)g(an)o(y)g(of)g(the)g(dld)h(functions,)g(y)o(ou)f(m)o (ust)f(include)k(the)d(header)g(\014le)i Fd(dld.h)d Fj(for)g(declaration)i (of)f(the)0 1408 y(functions)f(and)f(de\014nition)i(of)e(the)g(error)g(co)q (de)h(constan)o(ts.)62 1545 y(The)21 b(function)h Fd(dld_init)d Fj(m)o(ust)i(b)q(e)g(called)h(b)q(efore)f(an)o(y)g(other)f(dld)i(functions.) 37 b(It)21 b(has)f(the)h(follo)o(wing)0 1607 y(syn)o(tax:)120 1744 y Fd(int)i(dld_init)g(\(char)g(*)p Ff(path)p Fd(\))0 1881 y Fj(where)15 b Ff(path)h Fj(is)f(a)g(string)g(con)o(taining)h(the)f(path)h (name)f(of)g(the)g(executable)h(\014le)h(of)d(the)i(executing)g(pro)q(cess.) 62 2018 y(This)d(function)f(initialize)q(s)i(in)o(ternal)f(data)e(structures) h(of)f(dld)i(and)f(loads)g(in)o(to)g(memory)f(sym)o(b)q(ol)h(de\014nitions)0 2080 y(of)17 b(the)g(executing)h(pro)q(cess.)27 b(By)17 b(doing)h(so,)f (other)f(dynamically)j(loaded)f(functions)g(can)g(reference)g(sym)o(b)q(ols)0 2143 y(already)d(de\014ned)i(or)e(share)g(functions)h(already)f(exist)h(in)g (the)f(executing)h(pro)q(cess.)62 2280 y Fd(dld_init)i Fj(returns)g(0)g(when) h(successful;)i(otherwise,)e(it)f(returns)h(an)f(error)g(co)q(de)h(that)e(is) i(non-zero)g(\(see)0 2342 y(Section)d(1.10)e([De\014nition)i(of)f(Error)f(Co) q(des],)h(page)g(8\).)0 2533 y Fc(1.1.1)29 b(Lo)r(cating)18 b(the)h(Executable)h(File)62 2670 y Fj(The)c(path)f(name)g(of)g(the)h (executing)g(pro)q(cess)g(as)f(required)h(b)o(y)f Fd(dld_init)g Fj(migh)o(t)g(not)g(b)q(e)h(easily)g(obtained)p eop %%Page: 2 3 bop 971 -58 a Fj(2)0 183 y(all)13 b(the)g(time.)19 b(Not)12 b(all)i(systems)e(passes)g(the)g(en)o(tire)h(path)g(name)f(of)g(the)h (executable)h(\014le)f(as)f(the)h(\014rst)f(argumen)o(t)0 246 y(\()p Fd(argv[0])p Fj(\))d(to)i Fd(main)p Fj(.)18 b(In)11 b(order)g(to)f(obtain)i(the)f(full)h(path)f(of)g(the)g(executable)h(\014le,)g (the)g Fd(dld_find_executable)0 308 y Fj(function)k(can)f(b)q(e)h(used.)21 b(This)15 b(function)i(has)e(the)g(follo)o(wing)h(syn)o(tax:)120 447 y Fd(char)23 b(*dld_find_executable)e(\(char)j(*)p Ff(command)r Fd(\))0 586 y(dld_find_executable)14 b Fj(returns)i(the)h(absolute)f(path)h (name)f(of)g(the)h(\014le)g(that)f(w)o(ould)h(b)q(e)g(executed)g(if)g Ff(com-)0 648 y(mand)k Fj(w)o(ere)e(giv)o(en)h(as)f(a)g(command.)32 b(It)19 b(lo)q(oks)h(up)g(the)f(en)o(vironmen)o(t)h(v)m(ariable)g Ff(P)l(A)l(TH)p Fj(,)g(searc)o(hes)f(in)h(eac)o(h)0 710 y(of)c(the)h (directory)f(listed)i(for)e Ff(command)p Fj(,)g(and)h(returns)f(the)h (absolute)g(path)f(name)h(for)f(the)g(\014rst)g(o)q(ccurrence.)0 772 y(Th)o(us,)f(it)g(is)h(advisable)g(to)f(in)o(v)o(ok)o(e)g Fd(dld_init)f Fj(as:)120 911 y Fd(main)23 b(\(int)h(argc,)f(char)g(**argv\)) 120 961 y({)215 1011 y Fb(:)7 b(:)g(:)215 1061 y Fd(if)24 b(\(dld_init)f (\(dld_find_executable)e(\(argv[0]\)\)\))h({)311 1111 y Fb(:)7 b(:)g(:)215 1161 y Fd(})215 1210 y Fb(:)g(:)g(:)120 1260 y Fd(})120 1399 y Fa(Note:)30 b Fj(If)21 b(the)f(curren)o(t)h(pro)q(cess)g(is)g (executed)g(using)g(the)g Fd(execve)f Fj(call)h(without)g(passing)g(the)120 1449 y(correct)16 b(path)g(name)h(as)f(argumen)o(t)g(0,)g Fd (dld_find_executable)c(\(argv[0]\))31 b Fj(will)18 b(also)e(fail)i(to)120 1499 y(lo)q(cate)e(the)f(executable)h(\014le.)62 1638 y Fd (dld_find_executable)g Fj(returns)i(zero)f(if)i Fd(command)e Fj(is)i(not)e(found)i(in)f(an)o(y)g(of)g(the)g(directories)h(listed)g(in)0 1700 y Fd(PATH)p Fj(.)0 1942 y Fe(1.2)35 b(Dynamically)21 b(Linking)h(in)g (New)g(Mo)r(dules)62 2081 y Fj(The)d(function)h Fd(dld_link)e Fj(dynamically)i(links)h(in)e(the)g(named)g(relo)q(catable)h(ob)s(ject)e(or)h (library)g(\014le)h(in)o(to)0 2143 y(memory)l(.)g(It)15 b(has)g(the)g(follo)o (wing)h(syn)o(tax:)120 2282 y Fd(int)23 b(dld_link)g(\(char)g(*)p Ff(\014lename)s Fd(\))0 2421 y Fj(where)11 b Ff(\014lename)k Fj(is)d(the)f(path)g(name)h(of)e(the)i(\014le)g(to)f(b)q(e)g(link)o(ed.)21 b(Sp)q(eci\014cally)l(,)15 b(if)c(the)h(named)f(\014le)h(is)g(a)f(relo)q (catable)0 2483 y(ob)s(ject)h(\014le,)i(it)f(is)g(completely)h(loaded)f(in)o (to)g(memory)l(.)18 b(If)13 b(it)g(is)g(a)g(library)g(\014le,)h(only)f(those) f(mo)q(dules)i(de\014ning)g(an)0 2545 y(unresolv)o(ed)j(external)g(reference) h(are)e(loaded.)25 b(Since)18 b(a)e(mo)q(dule)i(in)f(the)f(library)i(ma)o(y)e (itself)h(reference)g(other)0 2608 y(routines)g(in)g(the)g(library)l(,)g (loading)h(it)e(ma)o(y)g(generate)g(more)g(unresolv)o(ed)i(external)f (references.)24 b(Therefore,)16 b(a)0 2670 y(library)f(\014le)h(is)f(searc)o (hed)f(rep)q(eatedly)i(un)o(til)f(a)f(scan)h(through)f(all)h(library)g(mem)o (b)q(ers)g(is)g(made)f(without)h(ha)o(ving)p eop %%Page: 3 4 bop 971 -58 a Fj(3)0 183 y(to)15 b(load)g(an)o(y)g(new)g(mo)q(dules.)62 320 y(Storage)g(for)h(the)g(text)g(and)g(data)g(of)f(the)i(dynamically)h (link)o(ed)g(mo)q(dules)f(is)f(allo)q(cated)i(using)e Fd(malloc)p Fj(.)22 b(In)0 382 y(other)15 b(w)o(ords,)f(they)h(are)g(k)o(ept)g(in)h(the)f Ff(heap)i Fj(of)e(the)g(executing)i(pro)q(cess.)62 519 y(After)f(all)i(mo)q (dules)f(are)f(loaded,)h Fd(dld_link)f Fj(resolv)o(es)g(as)g(man)o(y)g (external)h(references)g(as)f(p)q(ossible.)25 b(Note)0 582 y(that)15 b(some)g(sym)o(b)q(ols)g(migh)o(t)g(still)i(b)q(e)f(unde\014ned)h (at)e(this)g(stage,)f(b)q(ecause)j(the)e(mo)q(dules)h(de\014ning)h(them)e(ha) o(v)o(e)0 644 y(not)g(y)o(et)g(b)q(een)h(loaded.)62 781 y(If)c(the)g(sp)q (eci\014ed)h(mo)q(dule)g(is)f(link)o(ed)h(successfully)l(,)h Fd(dld_link)c Fj(returns)h(0;)h(otherwise,)h(it)e(returns)h(a)f(non-zero)0 843 y(error)j(co)q(de)i(\(see)f(Section)i(1.10)d([De\014nition)i(of)e(Error)h (Co)q(des],)f(page)h(8\).)0 1064 y Fe(1.3)35 b(Unlinking)22 b(a)h(Mo)r(dule)62 1201 y Fj(The)14 b(ma)s(jor)e(di\013erence)j(b)q(et)o(w)o (een)e(dld)i(and)e(other)g(dynamic)i(link)o(er)f(is)g(that)f(dld)i(allo)o(ws) e(ob)s(ject)g(mo)q(dules)i(to)0 1263 y(b)q(e)h(remo)o(v)o(ed)g(from)f(the)h (pro)q(cess)g(an)o(ytime)g(during)g(execution.)23 b(Unlinking)18 b(a)e(mo)q(dule)h(is)f(simply)h(the)f(rev)o(erse)0 1325 y(of)f(the)g(link)i (op)q(eration)e(\(see)h(Section)g(1.3.1)d([Imp)q(ortan)o(t)i(P)o(oin)o(ts)f (in)j(Using)e(Unlink],)i(page)e(4\).)k(The)d(sp)q(eci\014ed)0 1387 y(mo)q(dule)e(is)f(remo)o(v)o(ed)f(and)g(the)h(memory)f(allo)q(cated)i (to)d(it)i(is)g(reclaimed.)21 b(Additionally)l(,)15 b(resolution)e(of)g (external)0 1450 y(references)j(m)o(ust)e(b)q(e)i(undone.)62 1587 y(There)g(are)f(t)o(w)o(o)e(unlink)18 b(functions:)120 1724 y Fd(int)23 b(dld_unlink_by_file)f(\(char)h(*)p Ff(path)p Fd(,)h(int)f Ff(hard)r Fd(\))120 1823 y(int)g(dld_unlink_by_symbol)f(\(char)h (*)p Ff(id)p Fd(,)h(int)g Ff(hard)r Fd(\))0 1960 y Fj(The)10 b(t)o(w)o(o)f(unlink)j(functions)f(are)f(basically)i(the)e(same)g(except)h (that)e Fd(dld_unlink_by_file)f Fj(tak)o(es)h(as)h(argumen)o(t)0 2022 y(the)18 b(path)f(name)h(\()p Ff(path)p Fj(\))f(of)g(a)g(\014le)i (corresp)q(onding)g(to)e(a)g(mo)q(dule)i(previously)g(link)o(ed)g(in)f(b)o(y) g Fd(dld_link)p Fj(,)f(but)0 2085 y Fd(dld_unlink_by_symbol)12 b Fj(unlinks)18 b(the)d(mo)q(dule)h(that)f(de\014nes)h(the)f(sp)q(eci\014ed)i (sym)o(b)q(ol)f(\()p Ff(id)r Fj(\).)62 2222 y(Both)c(functions)g(tak)o(e)f(a) h(second)g(argumen)o(t)f Ff(hard)p Fj(.)18 b(When)13 b Ff(hard)g Fj(is)f(non-zero)g(\()p Ff(hard)g(unlink)s Fj(\),)h(the)f(sp)q(eci\014ed)0 2284 y(mo)q(dule)k(is)f(remo)o(v)o(ed)f(from)g(memory)g(unconditionally)l(.) 22 b(On)15 b(the)g(other)f(hand,)h(if)g Ff(hard)h Fj(is)f(zero)g(\()p Ff(soft)e(unlink)s Fj(\),)0 2346 y(this)f(mo)q(dule)g(is)f(remo)o(v)o(ed)g (from)f(memory)h(only)h(if)f(it)g(is)h(not)f(referenced)h(b)o(y)f(an)o(y)g (other)f(mo)q(dules.)20 b(F)l(urthermore,)0 2408 y(if)14 b(unlinking)i(a)d (mo)q(dule)h(results)g(in)g(lea)o(ving)h(some)e(other)g(mo)q(dules)h(b)q (eing)h(unreferenced,)g(these)e(unreferenced)0 2471 y(mo)q(dules)j(are)f (also)g(remo)o(v)o(ed.)62 2608 y(Hard)f(unlink)j(is)e(usually)g(used)g(when)g (y)o(ou)f(w)o(an)o(t)f(to)h(explicitly)j(remo)o(v)o(e)d(a)g(mo)q(dule)h(and)g (probably)g(replace)0 2670 y(it)h(b)o(y)f(a)h(di\013eren)o(t)f(mo)q(dule)i (with)f(the)g(same)f(name.)21 b(F)l(or)15 b(example,)h(y)o(ou)f(ma)o(y)g(w)o (an)o(t)g(to)g(replace)h(the)g(system's)p eop %%Page: 4 5 bop 971 -58 a Fj(4)0 183 y Fd(printf)19 b Fj(b)o(y)h(y)o(our)f(o)o(wn)h(v)o (ersion.)34 b(When)20 b(y)o(ou)f(link)j(in)e(y)o(our)g(v)o(ersion)g(of)f Fd(printf)p Fj(,)h(dld)h(will)h(automatically)0 246 y(redirect)16 b(all)g(references)g(to)e Fd(printf)h Fj(to)f(the)i(new)f(v)o(ersion.)62 393 y(Soft)g(unlink)i(should)g(b)q(e)f(used)f(when)h(y)o(ou)f(are)g(not)g (sure)h(if)f(the)h(sp)q(eci\014ed)h(mo)q(dule)g(is)e(still)i(needed.)22 b(If)15 b(y)o(ou)0 455 y(just)g(w)o(an)o(t)f(to)h(clean)h(up)f(unnecessary)h (functions,)g(it)f(is)h(alw)o(a)o(ys)e(safe)h(to)g(use)g(soft)g(unlink.)62 603 y(Both)g(unlink)i(functions)f(returns)f(0)g(if)h(the)f(sp)q(eci\014ed)j (ob)s(ject)c(\014le)i(or)f(sym)o(b)q(ol)h(is)f(previously)i(loaded.)k(Oth-)0 665 y(erwise,)15 b(they)h(return)f(a)g(non-zero)g(error)g(co)q(de)g(\(see)h (Section)g(1.10)e([De\014nition)i(of)f(Error)f(Co)q(des],)g(page)h(8\).)0 968 y Fc(1.3.1)29 b(Imp)r(ortan)n(t)19 b(P)n(oin)n(ts)h(in)f(Using)g(Unlink) 62 1115 y Fj(When)13 b(a)f(mo)q(dule)h(is)f(b)q(eing)i(unlink)o(ed,)g(dld)f (tries)g(to)e(clean)i(up)g(as)e(m)o(uc)o(h)i(as)e(it)i(can)f(to)f(restore)h (the)g(executing)0 1177 y(pro)q(cess)18 b(to)f(a)h(state)e(as)i(if)g(this)g (mo)q(dule)h(has)f(nev)o(er)g(b)q(een)h(link)o(ed.)29 b(This)18 b(clean)h(up)f(includes)i(remo)o(ving)e(and)0 1240 y(reclaiming)g(the)e (memory)f(for)g(storing)h(the)g(text)f(and)h(data)f(segmen)o(t)h(of)f(the)h (mo)q(dule,)h(and)f Ff(un-de\014ning)22 b Fj(an)o(y)0 1302 y(global)16 b(sym)o(b)q(ols)f(de\014ned)i(b)o(y)e(this)h(mo)q(dule.)62 1450 y(Ho)o(w)o(ev)o(er,)j(side)h(e\013ects|suc)o(h)f(as)g(mo)q(di\014cation) h(of)f(global)g(v)m(ariables,)i(input/output)f(op)q(erations,)g(and)0 1512 y(allo)q(cations)15 b(of)f(new)g(memory)g(blo)q(c)o(ks|caused)i(b)o(y)e (the)g(execution)h(of)f(an)o(y)g(function)h(in)g(this)f(mo)q(dule)i(are)d (not)0 1574 y(rev)o(ersed.)19 b(Th)o(us,)14 b(it)f(is)h(the)f(resp)q (onsibili)q(t)o(y)i(of)e(the)h(programmer)e(to)g(explicitly)k(carry)d(out)g (all)h(necessary)g(clean)0 1636 y(up)i(op)q(erations)f(b)q(efore)g(unlinking) j(a)d(mo)q(dule.)0 1955 y Fe(1.4)35 b(In)n(v)n(oking)24 b(Dynamically)c(Link) n(ed)j(F)-6 b(unctions)62 2103 y Fj(Dynamically)14 b(link)o(ed)g(functions)g (ma)o(y)e(still)i(b)q(e)f(in)o(v)o(ok)o(ed)g(from)e(mo)q(dules)j(\(e.g.,)e Fd(main)p Fj(\))f(that)h(do)h(not)f(con)o(tain)0 2165 y(references)20 b(to)f(suc)o(h)g(functions.)33 b(The)20 b(function)g Fd(dld_get_func)e Fj(returns)h(the)h(en)o(try)e(p)q(oin)o(t)i(of)f(the)h(named)0 2228 y(function.)g(This)15 b(returned)g(v)m(alue)g(can)g(later)f(b)q(e)h (used)g(as)e(a)h(p)q(oin)o(ter)h(to)f(the)g(function.)20 b(Similarly)l(,)d (the)d(address)0 2290 y(of)h(a)g(global)g(v)m(ariable)i(can)e(b)q(e)h (obtained)g(b)o(y)f(the)h(function)g Fd(dld_get_symbol)p Fj(:)120 2423 y Fd(unsigned)23 b(long)g(dld_get_symbol)f(\(char)h(*)p Ff(id)r Fd(\))120 2522 y(unsigned)g(long)g(dld_get_func)f(\(char)h(*)p Ff(func)s Fd(\))0 2670 y Fj(A)15 b(t)o(ypical)h(use)g(of)f Fd(dld_get_func)e Fj(w)o(ould)j(b)q(e:)p eop %%Page: 5 6 bop 971 -58 a Fj(5)120 119 y Fd({)215 169 y(void)24 b(\(*func\))f(\(\);)215 218 y(int)h(error_code;)215 318 y Fb(:)7 b(:)g(:)215 418 y Fd(/*)24 b(First,)f(link)g(in)h(the)f(object)g(file)h("my_object_file.o".)287 467 y(Proceed)f(only)g(if)h(the)f(link)h(operation)e(is)i(successful,)e(i.e.) i(it)f(returns)g(0.)287 517 y("my_new_func")f(is)i(a)f(function)g(defined)g (in)h("my_object_file.o".)287 567 y(Set)f(func)h(to)f(point)h(at)f(the)h (entry)f(point)g(of)h(this)f(function)g(and)g(then)287 617 y(Invoke)g(it)h(indirectly)e(through)h(func.)g(*/)215 716 y(if)h (\(\(error_code)e(=)i(dld_link)f(\("my_object_file.o"\)\))e(==)i(0\))h({)311 766 y(if)f(\(\(func)h(=)f(\(void)g(\(*\))h(\(\)\))f(get_func)g (\("my_new_func"\)\))f(!=)h(0\))406 816 y(\(*func\))g(\(\);)311 866 y Fb(:)7 b(:)g(:)215 916 y Fd(})24 b(else)f({)215 1015 y Fb(:)7 b(:)g(:)215 1065 y Fd(})120 1115 y(})62 1254 y Fj(Both)16 b Fd(dld_get_func)f Fj(and)h Fd(dld_get_symbol)e Fj(return)i(zero)g(if)h(the) f(named)g(function)h(or)f(sym)o(b)q(ol)g(cannot)0 1316 y(b)q(e)g(found.)0 1555 y Fe(1.5)35 b(Determining)20 b(If)j(a)g(F)-6 b(unction)23 b(is)f(Executable)62 1694 y Fj(Since)f(dld)f(allo)o(ws)f(mo)q(dules)h(to)e(b) q(e)i(added)g(to)e(or)g(remo)o(v)o(ed)h(from)f(an)h(executing)h(pro)q(cess)f (dynamically)l(,)0 1756 y(some)d(global)g(sym)o(b)q(ols)g(ma)o(y)f(not)h(b)q (e)h(de\014ned.)23 b(As)16 b(a)f(result,)h(an)g(in)o(v)o(o)q(cation)h(of)e(a) h(function)g(migh)o(t)g(reference)0 1818 y(an)f(unde\014ned)i(sym)o(b)q(ol.)j (W)l(e)15 b(sa)o(y)f(that)h(a)f(function)i(is)f Ff(executable)k Fj(if)d(and)f(only)g(if)h(all)g(its)f(external)g(references)0 1880 y(ha)o(v)o(e)g(b)q(een)h(fully)h(resolv)o(ed)e(and)h(all)g(functions)g (that)e(it)i(migh)o(t)f(call)h(are)f(executable.)62 2019 y(The)k(predicate)h (function)f Fd(dld_function_executable_p)c Fj(helps)20 b(solv)o(e)f(this)g (problem)g(b)o(y)f(tracing)h(the)0 2081 y(cross)13 b(references)i(b)q(et)o(w) o(een)f(mo)q(dules)h(and)e(returns)h(non-zero)g(only)g(if)h(the)e(named)h (function)h(is)f(executable.)21 b(It)0 2144 y(has)15 b(the)g(follo)o(wing)h (syn)o(tax:)120 2282 y Fd(int)23 b(dld_function_executable_p)e(\(char)i(*)p Ff(func)s Fd(\))62 2421 y Fj(Note)13 b(that)e(the)i(implemen)o(tation)h(of)e Fd(dld_function_executable_p)d Fj(is)k(not)g(complete)g(according)g(to)f(the) 0 2483 y(\(recursiv)o(e\))18 b(de\014nition)h(of)e(executabilit)o(y)l(.)29 b(External)17 b(references)i(through)e(p)q(oin)o(ters)h(are)f(not)g(traced.) 27 b(That)0 2545 y(is,)22 b Fd(dld_function_executable)o(_p)17 b Fj(will)22 b(still)g(return)e(non-zero)h(if)f(the)h(named)f(function)h (uses)g(a)e(p)q(oin)o(ter)0 2608 y(to)d(indirectly)j(call)e(another)f (function)i(whic)o(h)f(has)g(already)f(b)q(een)i(unlink)o(ed.)26 b(F)l(urthermore,)16 b(if)h(one)g(external)0 2670 y(reference)22 b(of)f(a)g(ob)s(ject)g(mo)q(dule)h(is)g(unresolv)o(ed,)h(all)f(functions)h (de\014ned)f(in)g(this)g(mo)q(dule)h(are)e(considered)p eop %%Page: 6 7 bop 971 -58 a Fj(6)0 183 y(unexecutable.)22 b(Therefore,)14 b Fd(dld_function_executable_p)e Fj(is)k(usually)g(to)q(o)f(conserv)m(ativ)o (e.)62 320 y(Ho)o(w)o(ev)o(er,)d(it)h(is)g(advisable)h(to)e(use)h Fd(dld_function_executable_p)c Fj(to)j(c)o(hec)o(k)h(if)g(a)f(function)i(is)f (executable)0 382 y(b)q(efore)k(its)f(in)o(v)o(o)q(cation.)24 b(In)17 b(suc)o(h)g(a)f(dynamic)h(en)o(vironmen)o(t)f(where)h(ob)s(ject)f(mo) q(dules)h(are)f(b)q(eing)i(added)f(and)0 445 y(remo)o(v)o(ed,)h(a)f(function) i(that)e(is)h(executable)h(at)f(one)g(p)q(oin)o(t)g(in)h(time)f(migh)o(t)f (not)h(b)q(e)g(executable)i(at)d(another.)0 507 y(Under)d(most)e (circumstances,)j Fd(dld_function_executable_)o(p)c Fj(is)j(accurate.)19 b(Also,)13 b(the)h(implemen)o(tation)g(of)0 569 y(this)i(function)g(has)f(b)q (een)h(optimized)h(and)e(it)g(is)h(relativ)o(ely)h(c)o(heap)e(to)g(use.)0 792 y Fe(1.6)35 b(Listing)22 b(the)g(Unde\014ned)h(Sym)n(b)r(ols)62 928 y Fj(The)15 b(function)h Fd(dld_list_undefined_sym)c Fj(returns)j(an)g (arra)o(y)f(of)g(unde\014ned)j(global)f(sym)o(b)q(ol)f(names.)20 b(It)0 991 y(has)15 b(the)g(follo)o(wing)h(syn)o(tax:)120 1128 y Fd(char)23 b(**dld_list_undefined_sym)e(\(\))0 1265 y Fj(The)e(list)g (returned)g(con)o(tains)f(all)h(the)g(sym)o(b)q(ols)f(that)g(ha)o(v)o(e)g(b)q (een)i(referenced)f(b)o(y)f(some)g(mo)q(dules)i(but)e(ha)o(v)o(e)0 1327 y(not)e(b)q(een)i(de\014ned.)25 b(This)18 b(function)f(is)g(designed)h (for)e(debugging,)i(esp)q(ecially)h(in)e(the)g(case)g(when)g(a)f(function)0 1389 y(is)g(found)f(to)g(b)q(e)h(not)e(executable)j(but)e(y)o(ou)g(do)g(not)g (kno)o(w)g(what)f(the)i(missing)g(sym)o(b)q(ols)f(are.)62 1526 y(The)e(length)f(of)g(the)g(arra)o(y)f(is)h(giv)o(en)h(b)o(y)f(the)g(global)g (v)m(ariable)i Fd(dld_undefined_sym_count)p Fj(,)9 b(whic)o(h)k(alw)o(a)o(ys) 0 1589 y(holds)j(the)g(curren)o(t)g(total)f(n)o(um)o(b)q(er)h(of)f (unde\014ned)j(global)e(sym)o(b)q(ols.)22 b(Note)15 b(that)g(all)h(C)g(sym)o (b)q(ols)g(are)f(listed)i(in)0 1651 y(their)f(in)o(ternal)g(represen)o (tation|i.e.,)f(they)g(are)g(pre\014xed)h(b)o(y)g(the)f(underscore)h(c)o (haracter)e(`)p Fd(_)p Fj('.)62 1788 y(Storage)h(for)h(the)g(arra)o(y)e (returned)j(is)f(allo)q(cated)h(b)o(y)f Fd(malloc)p Fj(.)21 b(It)16 b(is)h(the)f(programmer's)e(resp)q(onsibilit)o(y)19 b(to)0 1850 y(release)d(this)f(storage)f(b)o(y)i Fd(free)e Fj(when)i(it)f(is)h(not)f(needed)h(an)o(ymore.)0 2072 y Fe(1.7)35 b(Explicitly)20 b(Referencing)g(a)k(Sym)n(b)r(ol)62 2209 y Fj(Normally)l(,)19 b(a)e(library)h(mo)q(dule)g(is)g(loaded)h(only)e(when)h (it)g(de\014nes)h(one)e(of)g(more)g(sym)o(b)q(ols)h(that)f(has)g(b)q(een)0 2271 y(referenced.)27 b(T)l(o)17 b(force)g(a)g(library)h(routine)g(to)e(b)q (e)i(loaded,)h(one)e(need)h(to)f(explicitly)j(create)d(a)g(reference)h(to)e (a)0 2334 y(sym)o(b)q(ol)h(de\014ned)h(b)o(y)e(that)g(library)h(routine.)24 b(The)16 b(function)h Fd(dld_create_reference)d Fj(is)j(designed)h(for)e (this)0 2396 y(purp)q(ose:)120 2533 y Fd(int)23 b(dld_create_reference)f (\(char)h(*)p Ff(name)s Fd(\))0 2670 y Fj(Usually)18 b Ff(name)g Fj(is)f(the)g(name)f(of)g(the)g(library)h(routine)g(that)f(should)h(b)q(e)g (loaded,)g(but)g(it)f(can)h(b)q(e)g(an)o(y)f(sym)o(b)q(ol)p eop %%Page: 7 8 bop 971 -58 a Fj(7)0 183 y(de\014ned)15 b(b)o(y)e(that)g(routine.)20 b(After)13 b(suc)o(h)h(a)g(reference)g(has)f(b)q(een)i(created,)f(linking)h (the)f(appropriate)g(library)g(b)o(y)0 246 y Fd(dld_link)g Fj(w)o(ould)i(cause)f(the)g(required)i(library)f(routine)f(to)g(b)q(e)h (loaded.)62 383 y(If)e(the)g(call)g(is)g(successful,)h Fd (dld_create_reference)c Fj(returns)i(0;)h(otherwise,)f(it)h(returns)g(a)f (non-zero)h(error)0 445 y(co)q(de)i(\(see)f(Section)h(1.10)e([De\014nition)i (of)f(Error)f(Co)q(des],)h(page)g(8\).)62 582 y(The)e(library)h(routine)f (loaded)h(b)o(y)f(this)g(metho)q(d)g(can)g(b)q(e)h(unlink)o(ed)h(b)o(y)e Fd(dld_unlink_by_symbol)f(\()p Ff(name)s Fd(\))p Fj(.)0 645 y(Once)17 b(it)e(has)h(b)q(een)h(unlink)o(ed,)g(the)f(corresp)q(onding)g (reference)h(created)e(b)o(y)h Fd(dld_create_reference)d Fj(is)j(also)0 707 y(remo)o(v)o(ed)f(so)f(that)h(this)h(routine)f(will)i(not)e(b)q(e)h (loaded)g(in)g(again)f(b)o(y)g(subsequen)o(t)h(linking)h(of)e(the)g(library)l (.)0 934 y Fe(1.8)35 b(Explicitly)20 b(De\014ning)i(a)h(Sym)n(b)r(ol)62 1071 y Fj(Dld)17 b(allo)o(ws)f(a)g(programmer)f(to)g(explicitly)k(de\014ne)e (global)g(sym)o(b)q(ols.)23 b(That)15 b(is,)h(a)g(programmer)f(can)h(force)0 1133 y(a)g(sym)o(b)q(ol)i(to)e(ha)o(v)o(e)g(storage)g(assigned)h(for)f(it.)25 b(This)17 b(is)h(esp)q(ecially)h(useful)f(in)f(incremen)o(tal)h(program)e (testing)0 1196 y(where)e(the)g(function)g(b)q(eing)h(tested)f(needs)h(to)e (access)h(some)f(global)h(v)m(ariables)i(whic)o(h)e(are)g(de\014ned)h(b)o(y)e (another)0 1258 y(function)19 b(not)f(y)o(et)g(link)o(ed)j(in)e(\(or)e(ev)o (en)i(not)f(y)o(et)g(written\).)30 b(There)19 b(are)f(t)o(w)o(o)f(functions)i (related)g(to)f(explicit)0 1320 y(de\014nition:)120 1458 y Fd(int)23 b(dld_define_sym)f(\(char)i(*)p Ff(name)p Fd(,)f(unsigned)g(int)g Ff(size)s Fd(\))120 1507 y(void)g(dld_remove_defined_symbol)e(\(char)i(*)p Ff(name)s Fd(\))0 1645 y(dld_define_sym)10 b Fj(forces)i(dld)i(to)e(allo)q (cate)h Ff(size)j Fj(b)o(ytes)c(for)f(sym)o(b)q(ol)i Ff(name)p Fj(.)19 b(It)13 b(can)f(b)q(e)h(called)h(b)q(efore)f(or)f(after)f(a)0 1707 y(reference)i(to)f Ff(name)j Fj(is)e(made.)19 b(If)12 b(references)h(to)f Ff(name)j Fj(already)e(exist)g(when)g(it)f(is)h (de\014ned,)h(all)g(suc)o(h)e(references)0 1769 y(are)j(directed)h(to)f(p)q (oin)o(t)g(to)g(the)g(correct)g(address)g(allo)q(cated)i(for)d Ff(name)p Fj(.)62 1907 y Fd(dld_define_sym)i Fj(returns)h(0)h(if)g (successful.)28 b(Otherwise,)19 b(it)f(returns)f(a)h(non-zero)f(error)g(co)q (de)i(\(see)e(Sec-)0 1969 y(tion)e(1.10)f([De\014nition)j(of)d(Error)h(Co)q (des],)f(page)h(8\).)k(The)d(t)o(ypical)g(error)e(is)i(a)f(m)o(ultiple)i (de\014nition)g(of)e Ff(name)p Fj(.)62 2106 y(When)c(the)f(de\014nition)i(of) e Ff(name)i Fj(is)f(no)f(longer)h(needed,)h(it)e(can)g(b)q(e)h(remo)o(v)o(ed) f(b)o(y)g Fd(dld_remove_define_symbol)p Fj(.)0 2333 y Fe(1.9)35 b(Prin)n(ting)22 b(out)h(the)g(Error)h(Messages)62 2470 y Fj(The)19 b(function)g Fd(dld_perror)e Fj(prin)o(ts)i(out)f(a)g(short)f(message)h (explaining)j(the)d(error)g(returns)g(b)o(y)h(the)f(last)0 2533 y(dld)e(functions:)120 2670 y Fd(void)23 b(dld_perror)g(\(char)g(*)p Ff(user)p Fd(_)p Ff(mesg)t Fd(\))p eop %%Page: 8 9 bop 971 -58 a Fj(8)0 183 y(where)15 b Ff(user)p Fd(_)p Ff(mesg)k Fj(is)d(a)f(user-supplied)j(string)d(prep)q(ended)i(to)e(the)g(error)f (message.)0 407 y Fe(1.10)36 b(De\014nition)21 b(of)i(Error)h(Co)r(des)62 544 y Fj(The)19 b(dld)g(functions)g(return)f(a)f(non-zero)i(error)e(co)q(de)i (when)f(they)g(fail.)30 b(The)18 b(de\014nitions)i(of)d(these)i(error)0 607 y(co)q(des)d(are:)120 730 y Fd(DLD_ENOFILE)186 b Fj(cannot)15 b(op)q(en)h(\014le.)120 792 y Fd(DLD_EBADMAGIC)138 b Fj(bad)15 b(magic)h(n)o(um)o(b)q(er.)120 854 y Fd(DLD_EBADHEADER)114 b Fj(failure)16 b(reading)g(header.)120 916 y Fd(DLD_ENOTEXT)186 b Fj(premature)15 b(eof)g(in)h(text)f(section.)120 979 y Fd(DLD_ENOSYMBOLS) 114 b Fj(premature)15 b(eof)g(in)h(sym)o(b)q(ols.)120 1041 y Fd(DLD_ENOSTRINGS)114 b Fj(bad)15 b(string)h(table.)120 1103 y Fd(DLD_ENOTXTRELOC)90 b Fj(premature)15 b(eof)g(in)h(text)f(relo)q(cation.) 120 1165 y Fd(DLD_ENODATA)186 b Fj(premature)15 b(eof)g(in)h(data)e(section.) 120 1228 y Fd(DLD_ENODATRELOC)90 b Fj(premature)15 b(eof)g(in)h(data)e(relo)q (cation.)120 1290 y Fd(DLD_EMULTDEFS)138 b Fj(m)o(ultiple)17 b(de\014nitions)g(of)e(sym)o(b)q(ol.)120 1352 y Fd(DLD_EBADLIBRARY)90 b Fj(malformed)15 b(library)h(arc)o(hiv)o(e.)120 1414 y Fd(DLD_EBADCOMMON)114 b Fj(common)15 b(blo)q(c)o(k)h(not)f(supp)q(orted.)120 1477 y Fd(DLD_EBADOBJECT)114 b Fj(malformed)15 b(input)h(\014le)h(\(not)d(ob)s (ject)h(\014le)h(or)f(arc)o(hiv)o(e\).)120 1539 y Fd(DLD_EBADRELOC)138 b Fj(bad)15 b(relo)q(cation)h(info.)120 1601 y Fd(DLD_ENOMEMORY)138 b Fj(virtual)16 b(memory)e(exhausted.)120 1664 y Fd(DLD_EUNDEFSYM)138 b Fj(unde\014ned)17 b(sym)o(b)q(ol.)p eop %%Trailer end userdict /end-hook known{end-hook}if %%EOF octave-1.1.0/dld/doc/SPE.ps100666 415 17 354403 5021125746 13515 0ustar jweusers%!PS-Adobe-1.0 %%Creator: ivy:how (W. Wilson Ho,4435 Chem Annex,2680,9167584811,Prof. Ron Olsson) %%Title: stdin (ditroff) %%CreationDate: Mon Oct 15 14:10:23 1990 %%EndComments % Start of psdit.pro -- prolog for ditroff translator % Copyright (c) 1985,1987 Adobe Systems Incorporated. All Rights Reserved. % GOVERNMENT END USERS: See Notice file in TranScript library directory % -- probably /usr/lib/ps/Notice % RCS: $Header: psdit.pro,v 2.2 87/11/17 16:40:42 byron Rel $ /$DITroff 140 dict def $DITroff begin /fontnum 1 def /fontsize 10 def /fontheight 10 def /fontslant 0 def /xi {0 72 11 mul translate 72 resolution div dup neg scale 0 0 moveto /fontnum 1 def /fontsize 10 def /fontheight 10 def /fontslant 0 def F /pagesave save def}def /PB{save /psv exch def currentpoint translate resolution 72 div dup neg scale 0 0 moveto}def /PE{psv restore}def /m1 matrix def /m2 matrix def /m3 matrix def /oldmat matrix def /tan{dup sin exch cos div}bind def /point{resolution 72 div mul}bind def /dround {transform round exch round exch itransform}bind def /xT{/devname exch def}def /xr{/mh exch def /my exch def /resolution exch def}def /xp{}def /xs{docsave restore end}def /xt{}def /xf{/fontname exch def /slotno exch def fontnames slotno get fontname eq not {fonts slotno fontname findfont put fontnames slotno fontname put}if}def /xH{/fontheight exch def F}bind def /xS{/fontslant exch def F}bind def /s{/fontsize exch def /fontheight fontsize def F}bind def /f{/fontnum exch def F}bind def /F{fontheight 0 le {/fontheight fontsize def}if fonts fontnum get fontsize point 0 0 fontheight point neg 0 0 m1 astore fontslant 0 ne{1 0 fontslant tan 1 0 0 m2 astore m3 concatmatrix}if makefont setfont .04 fontsize point mul 0 dround pop setlinewidth}bind def /X{exch currentpoint exch pop moveto show}bind def /N{3 1 roll moveto show}bind def /Y{exch currentpoint pop exch moveto show}bind def /S /show load def /ditpush{}def/ditpop{}def /AX{3 -1 roll currentpoint exch pop moveto 0 exch ashow}bind def /AN{4 2 roll moveto 0 exch ashow}bind def /AY{3 -1 roll currentpoint pop exch moveto 0 exch ashow}bind def /AS{0 exch ashow}bind def /MX{currentpoint exch pop moveto}bind def /MY{currentpoint pop exch moveto}bind def /MXY /moveto load def /cb{pop}def % action on unknown char -- nothing for now /n{}def/w{}def /p{pop showpage pagesave restore /pagesave save def}def /abspoint{currentpoint exch pop add exch currentpoint pop add exch}def /dstroke{currentpoint stroke moveto}bind def /Dl{2 copy gsave rlineto stroke grestore rmoveto}bind def /arcellipse{oldmat currentmatrix pop currentpoint translate 1 diamv diamh div scale /rad diamh 2 div def rad 0 rad -180 180 arc oldmat setmatrix}def /Dc{gsave dup /diamv exch def /diamh exch def arcellipse dstroke grestore diamh 0 rmoveto}def /De{gsave /diamv exch def /diamh exch def arcellipse dstroke grestore diamh 0 rmoveto}def /Da{currentpoint /by exch def /bx exch def /fy exch def /fx exch def /cy exch def /cx exch def /rad cx cx mul cy cy mul add sqrt def /ang1 cy neg cx neg atan def /ang2 fy fx atan def cx bx add cy by add 2 copy rad ang1 ang2 arcn stroke exch fx add exch fy add moveto}def /Barray 200 array def % 200 values in a wiggle /D~{mark}def /D~~{counttomark Barray exch 0 exch getinterval astore /Bcontrol exch def pop /Blen Bcontrol length def Blen 4 ge Blen 2 mod 0 eq and {Bcontrol 0 get Bcontrol 1 get abspoint /Ycont exch def /Xcont exch def Bcontrol 0 2 copy get 2 mul put Bcontrol 1 2 copy get 2 mul put Bcontrol Blen 2 sub 2 copy get 2 mul put Bcontrol Blen 1 sub 2 copy get 2 mul put /Ybi /Xbi currentpoint 3 1 roll def def 0 2 Blen 4 sub {/i exch def Bcontrol i get 3 div Bcontrol i 1 add get 3 div Bcontrol i get 3 mul Bcontrol i 2 add get add 6 div Bcontrol i 1 add get 3 mul Bcontrol i 3 add get add 6 div /Xbi Xcont Bcontrol i 2 add get 2 div add def /Ybi Ycont Bcontrol i 3 add get 2 div add def /Xcont Xcont Bcontrol i 2 add get add def /Ycont Ycont Bcontrol i 3 add get add def Xbi currentpoint pop sub Ybi currentpoint exch pop sub rcurveto }for dstroke}if}def end /ditstart{$DITroff begin /nfonts 60 def % NFONTS makedev/ditroff dependent! /fonts[nfonts{0}repeat]def /fontnames[nfonts{()}repeat]def /docsave save def }def % character outcalls /oc {/pswid exch def /cc exch def /name exch def /ditwid pswid fontsize mul resolution mul 72000 div def /ditsiz fontsize resolution mul 72 div def ocprocs name known{ocprocs name get exec}{name cb} ifelse}def /fractm [.65 0 0 .6 0 0] def /fraction {/fden exch def /fnum exch def gsave /cf currentfont def cf fractm makefont setfont 0 .3 dm 2 copy neg rmoveto fnum show rmoveto currentfont cf setfont(\244)show setfont fden show grestore ditwid 0 rmoveto} def /oce {grestore ditwid 0 rmoveto}def /dm {ditsiz mul}def /ocprocs 50 dict def ocprocs begin (14){(1)(4)fraction}def (12){(1)(2)fraction}def (34){(3)(4)fraction}def (13){(1)(3)fraction}def (23){(2)(3)fraction}def (18){(1)(8)fraction}def (38){(3)(8)fraction}def (58){(5)(8)fraction}def (78){(7)(8)fraction}def (sr){gsave .05 dm .16 dm rmoveto(\326)show oce}def (is){gsave 0 .15 dm rmoveto(\362)show oce}def (->){gsave 0 .02 dm rmoveto(\256)show oce}def (<-){gsave 0 .02 dm rmoveto(\254)show oce}def (==){gsave 0 .05 dm rmoveto(\272)show oce}def end % DIThacks fonts for some special chars 50 dict dup begin /FontType 3 def /FontName /DIThacks def /FontMatrix [.001 0.0 0.0 .001 0.0 0.0] def /FontBBox [-220 -280 900 900] def% a lie but ... /Encoding 256 array def 0 1 255{Encoding exch /.notdef put}for Encoding dup 8#040/space put %space dup 8#110/rc put %right ceil dup 8#111/lt put %left top curl dup 8#112/bv put %bold vert dup 8#113/lk put %left mid curl dup 8#114/lb put %left bot curl dup 8#115/rt put %right top curl dup 8#116/rk put %right mid curl dup 8#117/rb put %right bot curl dup 8#120/rf put %right floor dup 8#121/lf put %left floor dup 8#122/lc put %left ceil dup 8#140/sq put %square dup 8#141/bx put %box dup 8#142/ci put %circle dup 8#143/br put %box rule dup 8#144/rn put %root extender dup 8#145/vr put %vertical rule dup 8#146/ob put %outline bullet dup 8#147/bu put %bullet dup 8#150/ru put %rule dup 8#151/ul put %underline pop /DITfd 100 dict def /BuildChar{0 begin /cc exch def /fd exch def /charname fd /Encoding get cc get def /charwid fd /Metrics get charname get def /charproc fd /CharProcs get charname get def charwid 0 fd /FontBBox get aload pop setcachedevice 40 setlinewidth newpath 0 0 moveto gsave charproc grestore end}def /BuildChar load 0 DITfd put %/UniqueID 5 def /CharProcs 50 dict def CharProcs begin /space{}def /.notdef{}def /ru{500 0 rls}def /rn{0 750 moveto 500 0 rls}def /vr{20 800 moveto 0 -770 rls}def /bv{20 800 moveto 0 -1000 rls}def /br{20 770 moveto 0 -1040 rls}def /ul{0 -250 moveto 500 0 rls}def /ob{200 250 rmoveto currentpoint newpath 200 0 360 arc closepath stroke}def /bu{200 250 rmoveto currentpoint newpath 200 0 360 arc closepath fill}def /sq{80 0 rmoveto currentpoint dround newpath moveto 640 0 rlineto 0 640 rlineto -640 0 rlineto closepath stroke}def /bx{80 0 rmoveto currentpoint dround newpath moveto 640 0 rlineto 0 640 rlineto -640 0 rlineto closepath fill}def /ci{355 333 rmoveto currentpoint newpath 333 0 360 arc 50 setlinewidth stroke}def /lt{20 -200 moveto 0 550 rlineto currx 800 2cx s4 add exch s4 a4p stroke}def /lb{20 800 moveto 0 -550 rlineto currx -200 2cx s4 add exch s4 a4p stroke}def /rt{20 -200 moveto 0 550 rlineto currx 800 2cx s4 sub exch s4 a4p stroke}def /rb{20 800 moveto 0 -500 rlineto currx -200 2cx s4 sub exch s4 a4p stroke}def /lk{20 800 moveto 20 300 -280 300 s4 arcto pop pop 1000 sub currentpoint stroke moveto 20 300 4 2 roll s4 a4p 20 -200 lineto stroke}def /rk{20 800 moveto 20 300 320 300 s4 arcto pop pop 1000 sub currentpoint stroke moveto 20 300 4 2 roll s4 a4p 20 -200 lineto stroke}def /lf{20 800 moveto 0 -1000 rlineto s4 0 rls}def /rf{20 800 moveto 0 -1000 rlineto s4 neg 0 rls}def /lc{20 -200 moveto 0 1000 rlineto s4 0 rls}def /rc{20 -200 moveto 0 1000 rlineto s4 neg 0 rls}def end /Metrics 50 dict def Metrics begin /.notdef 0 def /space 500 def /ru 500 def /br 0 def /lt 250 def /lb 250 def /rt 250 def /rb 250 def /lk 250 def /rk 250 def /rc 250 def /lc 250 def /rf 250 def /lf 250 def /bv 250 def /ob 350 def /bu 350 def /ci 750 def /bx 750 def /sq 750 def /rn 500 def /ul 500 def /vr 0 def end DITfd begin /s2 500 def /s4 250 def /s3 333 def /a4p{arcto pop pop pop pop}def /2cx{2 copy exch}def /rls{rlineto stroke}def /currx{currentpoint pop}def /dround{transform round exch round exch itransform} def end end /DIThacks exch definefont pop ditstart (psc)xT 576 1 1 xr 1(Times-Roman)xf 1 f 2(Times-Italic)xf 2 f 3(Times-Bold)xf 3 f 4(Times-BoldItalic)xf 4 f 5(Helvetica)xf 5 f 6(Helvetica-Bold)xf 6 f 7(Courier)xf 7 f 8(Courier-Bold)xf 8 f 9(Symbol)xf 9 f 10(DIThacks)xf 10 f 10 s 1 f xi %%EndProlog 5(Helvetica-Narrow)xf 5 f 1 f %%Page: 1 1 5(Helvetica-Narrow)xf 5 f 10 s 0 xH 0 xS 5 f 8 s 1 f 10 s 32(--)Y 4323(--)X 3 f 16 s 1121 984(An)N 1316(Approach)X 1895(to)X 2034(G)X 2134(enuine)X 2529(Dynam)X 2927(ic)X 3052(Linking)X 2 f 12 s 2036 1464(W.)N 2164(Wilson)X 2455(Ho)X 1 f 719 1644(Division)N 1074(of)X 1178(Computer)X 1587(Science,)X 1935(University)X 2365(of)X 2469(California,)X 2908(Davis,)X 3180(CA)X 3337(95616,)X 3625(U.S.A.)X 1734 1764(Email:)N 2016(how@cs.ucdavis.edu)X 2 f 1966 2004(Ronald)N 2268(A.)X 2375(Olsson)X 1 f 719 2184(Division)N 1074(of)X 1178(Computer)X 1587(Science,)X 1935(University)X 2365(of)X 2469(California,)X 2908(Davis,)X 3180(CA)X 3337(95616,)X 3625(U.S.A.)X 1694 2304(Email:)N 1976(olsson@cs.ucdavis.edu)X 3 f 10 s 2090 2608(SUMMARY)N 1 f 12 s 576 2816(This)N 781(paper)X 1029(describes)X 1421(a)X 1498(new)X 1692(approach)X 2080(to)X 2190(dynamic)X 2557(link/unlink)X 3015(editing.)X 3366(The)X 3551(basis)X 3778(of)X 3893(this)X 576 2968(approach)N 965(is)X 1065(a)X 1144(library)X 1436(of)X 1551(link)X 1736(editing)X 2039(functions)X 2432(that)X 2612(can)X 2781(add)X 2955(compiled)X 3349(object)X 3620(code)X 3837(to)X 2 f 3947(or)X 576 3120(remove)N 1 f 909(such)X 1135(code)X 1367(from)X 1604(a)X 1697(process)X 2035(anytime)X 2396(during)X 2697(its)X 2838(execution.)X 3311(Loading)X 3682(modules,)X 576 3272(searching)N 982(libraries,)X 1359(resolving)X 1754(external)X 2102(references,)X 2559(and)X 2735(allocating)X 3153(storage)X 3468(for)X 3616(global)X 3893(and)X 576 3424(static)N 805(data)X 991(structures)X 1390(are)X 1533(all)X 1655(performed)X 2081(at)X 2176(run)X 2329(time.)X 2575(This)X 2772(approach)X 3151(provides)X 3508(the)X 3652(ef\256ciency)X 576 3576(of)N 688(native)X 956(machine)X 1314(code)X 1527(execution)X 1933(along)X 2178(with)X 2380(the)X 2529(\257exibility)X 2935(to)X 3041(modify)X 3350(a)X 3424(program)X 3781(during)X 576 3728(its)N 693(execution,)X 1118(thereby)X 1433(making)X 1748(many)X 1988(new)X 2174(applications)X 2666(possible.)X 3055(This)X 3252(paper)X 3492(also)X 3674(describes)X 576 3880(three)N 803(sample)X 1110(applications)X 1610(of)X 1724(these)X 1956(dynamic)X 2322(link)X 2506(editing)X 2808(functions:)X 3250(program)X 3609(customiza-)X 576 4032(tion,)N 775(incremental)X 1257(program)X 1609(development,)X 2157(and)X 2322(support)X 2636(for)X 2774(debugging)X 3206(and)X 3371(testing.)X 3702(A)X 3797(proto-)X 576 4184(type)N 770(of)X 878(this)X 1045(approach)X 1426(is)X 1518(implemented)X 2050(under)X 2297(UNIX)X 2563(as)X 2670(a)X 2740(library)X 3024(package)X 3367(called)X 2 f 3625(dld)X 1 f 3775(for)X 3914(the)X 576 4336(C)N 664(programming)X 1212(language)X 1584(and)X 1747(is)X 1835(available)X 2208(for)X 2344(VAX,)X 2599(Sun)X 2772(3,)X 2868(and)X 3031(SPARCstation)X 3615(machines.)X 576 4820(KEY)N 797(WORDS)X 1440(Dynamic)X 1817(Linking)X 1440 4972(Incremental)N 1925(Program)X 2280(Development)X 1440 5124(Program)N 1795(Customization)X 1440 5276(Debugging)N 1891(and)X 2054(Testing)X 1440 5428(UNIX)N 1 p %%Page: 1 2 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(1)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 1942 1016(INTRODUCTION)N 576 1348(Many)N 840(conventional)X 1378(operating)X 1782(systems\320such)X 2399(as)X 2520(UNIX,)X 2824(DOS,)X 3080(and)X 3260(VMS\320assume)X 3887(that)X 576 1500(programs)N 982(are)X 1143(static)X 1390(entities)X 1712(in)X 1830(the)X 1991(sense)X 2242(that)X 2430(construction)X 2949(of)X 3071(a)X 3156(program)X 3524(is)X 3630(completed)X 576 1652(before)N 859(its)X 987(execution.)X 1447(A)X 1554(program's)X 1987(functionality,)X 2542(control)X 2853(structures,)X 3289(number)X 3621(of)X 3739(subrou-)X 576 1804(tines,)N 815(and)X 987(requirement)X 1486(on)X 1615(library)X 1905(functions)X 2296(are)X 2447(all)X 2577(well)X 2776(de\256ned)X 3091(and)X 3262(do)X 3390(not)X 3545(change)X 3850(once)X 576 1956(the)N 731(program)X 1094(begins)X 1382(execution.)X 1842(However,)X 2255(some)X 2495(programming)X 3056(languages,)X 3503(such)X 3717(as)X 3835(LISP)X 576 2108(and)N 745(Prolog,)X 1055(take)X 1246(an)X 1367(alternative)X 1805(approach)X 2188(in)X 2293(which)X 2558(they)X 2754(allow)X 2998(new)X 3188(functions)X 3576(to)X 3681(be)X 3802(added)X 576 2260(during)N 864(the)X 1019(execution)X 1431(of)X 1548(a)X 1628(program.)X 2039(The)X 2226(assumption)X 2702(that)X 2885(programs)X 3286(are)X 3442(static)X 3684(therefore)X 576 2412(makes)N 863(it)X 957(very)X 1168(dif\256cult)X 1513(to)X 1628(translate)X 1995(these)X 2233(languages)X 2658(directly)X 2993(into)X 3183(native)X 3459(machine)X 3826(code.)X 576 2564(Instead,)N 904(they)X 1097(are)X 1242(interpreted)X 1687(by)X 1810(a)X 1880(runtime)X 2207(support)X 2522(system)X 2816(or)X 2923(pseudo-machine,)X 3605(which)X 3867(runs)X 576 2716(more)N 798(slowly)X 1078(than)X 1268(native)X 1528(code)X 1734(on)X 1854(a)X 1921(physical)X 2266(machine.)X 776 2896(This)N 987(paper)X 1241(presents)X 1596(an)X 1727(new)X 1927(approach)X 2320(to)X 2435(program)X 2801(construction)X 3318(that)X 3504(allows)X 3796(object)X 576 3048(modules)N 932(to)X 1037(be)X 1158(dynamically)X 3 f 1664(de\256ned)X 1 f 1991(or)X 3 f 2100(rede\256ned)X 1 f (,)S 2537(and)X 3 f 2705(added)X 1 f 2984(to)X 3088(or)X 3 f 3197(removed)X 1 f 3584(from)X 3800(a)X 3872(pro-)X 576 3200(cess)N 782(during)X 1079(its)X 1216(execution.)X 1686(In)X 1813(other)X 2058(existing)X 2410(systems,)X 2785(object)X 3068(modules)X 3441(can)X 3622(at)X 3739(best)X 3941(be)X 576 3352(dynamically)N 1087(loaded)X 1378(but)X 1535(not)X 1692(removed.)X 2110(Using)X 2372(this)X 2544(approach,)X 2954(the)X 3105(functionalities)X 3690(provided)X 576 3504(by)N 704(a)X 779(program)X 1137(during)X 1421(its)X 1545(execution)X 1953(can)X 2120(therefore)X 2501(change)X 2807(with)X 3011(time)X 3216(or)X 3329(in)X 3437(response)X 3806(to)X 3914(the)X 576 3656(environment.)N 1155(Thus,)X 1415(this)X 1598(approach)X 1995(retains)X 2296(the)X 2458(ef\256ciency)X 2882(of)X 3006(executing)X 3425(native)X 3705(machine)X 576 3808(code)N 782(and)X 945(adds)X 1145(the)X 1287(\257exibility)X 1686(of)X 1790(modifying)X 2215(a)X 2282(program)X 2632(during)X 2907(its)X 3022(execution.)X 776 3988(A)N 895(dynamic)X 1278(link)X 1479(editor,)X 1779(called)X 2 f 2061(dld)X 1 f 2184(,)X 2259(implements)X 2760(this)X 2950(approach)X 3354(under)X 3624(the)X 3793(UNIX)X 576 4140(operating)N 969(system.)X 1313(It)X 1401(integrates)X 1805(or)X 1914(removes)X 2269(object)X 2534(modules)X 2889(at)X 2988(run)X 3145(time.)X 2 f 3394(Dld)X 1 f 3566(differs)X 3845(from)X 576 4292(other)N 804(dynamic)X 1166(linkers)X 1458(in)X 1563(that)X 1738(not)X 1891(only)X 2092(can)X 2256(object)X 2522(modules)X 2878(be)X 2999(added)X 3259(to)X 3364(but)X 3517(they)X 3713(can)X 3877(also)X 576 4444(be)N 695(removed)X 1059(from)X 1273(an)X 1391(executing)X 1793(process.)X 2156(Furthermore,)X 2688(these)X 2913(modules)X 3266(do)X 3389(not)X 3539(even)X 3748(have)X 3957(to)X 576 4596(be)N 742(known)X 1078(or)X 1233(exist)X 1490(when)X 1773(the)X 1966(execution)X 2416(begins.)X 2790(This)X 3036(paper)X 3325(describes)X 3759(several)X 576 4748(applications\320program)N 1510(customization,)X 2121(incremental)X 2622(program)X 2993(development,)X 3560(and)X 3744(support)X 576 4900(for)N 743(advanced)X 1162(debugging)X 1623(and)X 1818(testing)X 2131(features\320that)X 2733(illustrate)X 3127(the)X 3301(usefulness)X 3757(of)X 3893(this)X 576 5052(dynamic)N 932(linking)X 1229(approach.)X 776 5232(The)N 975(major)X 1249(cost)X 1453(of)X 1582(dynamic)X 1963(linking)X 2286(is)X 2400(the)X 2568(onetime)X 2929(overhead)X 3332(in)X 3457(reading)X 3796(object)X 576 5384(modules)N 942(from)X 1169(disk.)X 1417(The)X 1607(processing)X 2057(time)X 2268(spent)X 2510(on)X 2645(link)X 2834(editing)X 3141(is)X 3244(actually)X 3589(very)X 3799(small.)X 576 5536(Once)N 806(the)X 951(modules)X 1304(have)X 1513(been)X 1723(linked,)X 2016(the)X 2162(executing)X 2565(process)X 2881(runs)X 3074(at)X 3172(nearly)X 3441(the)X 3587(same)X 3813(speed)X 576 5688(as)N 687(the)X 836(equivalent)X 1269(statically)X 1649(linked)X 1921(process.)X 2288(In)X 2399(fact,)X 2599(the)X 2747(only)X 2948(signi\256cant)X 3379(drawback)X 3783(of)X 3893(this)X 576 5840(dynamic)N 955(linking)X 1275(approach)X 1675(is)X 1786(that)X 1979(its)X 2118(\257exibility)X 2541(makes)X 2835(it)X 2937(susceptible)X 3413(to)X 3536(misuse.)X 3899(For)X 2 p %%Page: 2 3 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(2)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(example,)N 961(a)X 1038(process)X 1360(might)X 1619(be)X 1744(corrupted)X 2146(by)X 2275(linking)X 2581(in)X 2689(erroneous)X 3101(code,)X 3340(or)X 3453(careless)X 3791(use)X 3952(of)X 576 1168(dynamic)N 939(linking)X 1243(in)X 1349(privileged)X 1771(system)X 2069(programs)X 2464(might)X 2721(create)X 2984(security)X 3321(problems.)X 3759(A)X 3860(later)X 576 1320(section)N 873(discusses)X 1254(these)X 1476(drawbacks)X 1911(and)X 2074(possible)X 2413(remedies)X 2785(in)X 2884(more)X 3106(detail.)X 3 p %%Page: 3 4 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(3)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 1966 1016(BACKGROUND)N 576 1348(This)N 784(section)X 1094(presents)X 1447(some)X 1688(basic)X 1924(concepts)X 2299(of)X 2417(program)X 2781(compilation)X 3280(and)X 3457(link)X 3645(editing;)X 3978(it)X 576 1500(also)N 769(describes)X 1165(the)X 1321(structures)X 1733(of)X 1851(relocatable)X 2313(object)X 2587(\256les)X 2785(and)X 2962(executable)X 3413(\256les)X 3611(in)X 3724(general.)X 576 1652(While)N 839(the)X 984(description)X 1439(of)X 1547(these)X 1773(structures)X 2175(and)X 2342(the)X 2488(example)X 2843(given)X 3085(in)X 3188(this)X 3355(section)X 3656(might)X 3909(not)X 576 1804(directly)N 899(apply)X 1141(to)X 1244(all)X 1368(operating)X 1759(systems,)X 2114(the)X 2259(underlying)X 2703(principles)X 3110(are)X 3255(all)X 3379(similar.)X 3722(Readers)X 576 1956(already)N 889(familiar)X 1224(with)X 1424(these)X 1651(concepts)X 2017(may)X 2212(proceed)X 2546(to)X 2650(the)X 2797(next)X 2992(section.)X 3342(Further)X 3654(details)X 3936(on)X 576 2108(these)N 798(basic)X 1020(concepts)X 1381(can)X 1539(be)X 1654(found)X 1902(in)X 2001(Reference)X 2416(1.)X 776 2288(Most)N 1001(contemporary)X 1564(programming)X 2116(environments)X 2668(do)X 2793(not)X 2945(convert)X 3263(programs)X 3655(written)X 3957(in)X 576 2440(high-level)N 993(programming)X 1543(languages)X 1954(directly)X 2275(into)X 2450(executable)X 2888(machine)X 3240(code.)X 3495(Typically,)X 3914(the)X 576 2592(source)N 855(of)X 963(a)X 1034(program)X 1388(is)X 1480(contained)X 1883(in)X 1986(one)X 2153(or)X 2261(more)X 2487(\256les,)X 2699(or)X 4 f 2808(source)X 3098(modules)X 1 f 3429(,)X 3482(each)X 3688(of)X 3797(which)X 576 2744(contains)N 933(de\256nitions)X 1375(of)X 1490(functions)X 1883(and)X 2057(data)X 2253(structures.)X 2710(These)X 2975(modules)X 3336(are)X 3489(\256rst)X 3673(compiled)X 576 2896(into)N 4 f 771(object)X 1052(modules)X 1 f 1383(,)X 1452(which)X 1732(are)X 1895(then)X 2106(combined)X 2531(together)X 2892(into)X 3087(a)X 3175(single)X 3451(\256le.)X 3668(This)X 3885(\256le,)X 576 3048(known)N 865(as)X 973(the)X 4 f 1119(executable)X 1570(\256le)X 1 f 1693(,)X 1745(has)X 1901(a)X 1972(well-de\256ned)X 2481(format)X 2765(understood)X 3219(by)X 3342(the)X 3487(operating)X 3878(sys-)X 576 3200(tem)N 745(and)X 908(can)X 1066(readily)X 1358(be)X 1473(turned)X 1743(into)X 1917(an)X 2032(executing)X 2431(process.)X 776 3380(An)N 942(object)X 1228(module)X 1567(is)X 1681(the)X 1849(machine)X 2226(code)X 2458(equivalent)X 2910(of)X 3040(its)X 3181(corresponding)X 3781(source)X 576 3532(module.)N 953(It)X 1052(contains)X 1413(a)X 4 f 1496(text)X 1 f 1681(segment)X 2042(\(machine)X 2440(code)X 2661(for)X 2812(functions\))X 3241(and)X 3419(a)X 4 f 3501(data)X 1 f 3711(segment)X 576 3684(\(machine)N 1011(representations)X 1670(of)X 1826(global)X 2143(and)X 2358(static)X 2638(variables,)X 3086(string)X 3381(constants,)X 3839(etc.\).)X 576 3836(Throughout)N 1061(this)X 1231(paper,)X 1500(the)X 1649(term)X 2 f 1857(module)X 1 f 2171(is)X 2266(used)X 2472(whenever)X 2876(there)X 3099(is)X 3193(no)X 3319(ambiguity)X 3740(or)X 3850(need)X 576 3988(to)N 677(distinguish)X 1125(between)X 1472(a)X 1542(source)X 1820(module)X 2136(and)X 2302(an)X 2420(object)X 2683(module.)X 3047(When)X 3304(a)X 3374(source)X 3652(module)X 3968(is)X 576 4140(compiled,)N 989(the)X 1137(compiler)X 1510(generates)X 1904(an)X 4 f 2025(object)X 2290(\256le)X 1 f 2413(,)X 2466(which,)X 2754(in)X 2858(addition)X 3203(to)X 3307(the)X 3454(object)X 3719(module,)X 576 4292(contains)N 930(global)X 1204(symbol)X 1520(de\256nitions)X 1959(and)X 2131(information)X 2619(that)X 2797(enables)X 3120(this)X 3293(module)X 3616(to)X 3725(be)X 3850(relo-)X 576 4444(cated.)N 867(This)X 1077(extra)X 1309(information)X 1803(is)X 1906(necessary)X 2319(because)X 2663(global)X 2943(symbols)X 3302(de\256ned)X 3624(in)X 3737(a)X 3818(given)X 576 4596(module)N 892(might)X 1144(be)X 1262(referenced)X 1696(by)X 1820(other)X 2046(modules,)X 2424(which)X 2687(need)X 2897(to)X 3000(know)X 3241(the)X 3387(location)X 3726(of)X 3834(these)X 576 4748(symbols.)N 988(Furthermore,)X 1537(the)X 1699(compiler)X 2086(or)X 2210(assembler)X 2639(does)X 2859(not)X 3025(know)X 3281(the)X 3442(location)X 3796(in)X 3914(the)X 576 4900(address)N 891(space)X 1132(where)X 1394(the)X 1540(module)X 1857(will)X 2035(be)X 2154(loaded)X 2439(when)X 2675(it)X 2757(is)X 2849(combined)X 3257(with)X 3456(other)X 3682(modules.)X 576 5052(Therefore,)N 1012(relocation)X 1430(information)X 1917(must)X 2135(be)X 2257(recorded)X 2625(with)X 2827(the)X 2976(object)X 3243(\256le.)X 3445(Related)X 3771(groups)X 576 5204(of)N 684(object)X 948(\256les)X 1136(of)X 1244(commonly)X 1684(used)X 1888(source)X 2167(modules\320such)X 2793(as)X 2902(system)X 3198(services,)X 3561(input/output)X 576 5356(operations,)N 1027(and)X 1192 0.3409(mathematical)AX 1739(functions\320are)X 2337(often)X 2561(combined)X 2967(into)X 3142(archive)X 3451(\256les,)X 3660(or)X 4 f 3765(library)X 576 5508(\256les)N 1 f 736(.)X 813(As)X 948(a)X 1020(result,)X 1287(users)X 1513(can)X 1676(specify)X 1983(a)X 2055(large)X 2277(number)X 2600(of)X 2710(related)X 3003(object)X 3269(\256les)X 3459(by)X 3585(giving)X 3861(only)X 576 5660(one)N 739(\256le)X 886(name.)X 4 p %%Page: 4 5 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(4)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 776 1016(The)N 952(activity)X 1268(of)X 1374(loading)X 1690(and)X 1856(relocating)X 2269(object)X 2532(modules)X 2885(into)X 3062(an)X 3180(executable)X 3620(\256le)X 3770(is)X 3861(gen-)X 576 1168(erally)N 825(referred)X 1159(to)X 1263(as)X 4 f 1372(link)X 1556(editing)X 1 f 1858(or)X 1967(simply)X 4 f 2257(linking)X 1 f 2540(.)X 2616(This)X 2815(activity)X 3133(maps)X 3364(each)X 3569(module)X 3886(to)X 3989(a)X 576 1320(section)N 883(of)X 997(the)X 1149(virtual)X 1436(address)X 1759(space,)X 2032(resolves)X 2382(global)X 2658(symbol)X 2976(references)X 3407(across)X 3682(modules,)X 576 1472(and)N 764(allocates)X 1151(storage)X 1478(for)X 1639(the)X 1806(global)X 2095(data)X 2304(structures.)X 2774(Each)X 3015(module)X 3352(is)X 3464(then)X 3678(relocated)X 576 1624(accordingly)N 1055(and)X 1218(the)X 1360(results)X 1635(are)X 1777(written)X 2074(out)X 2221(to)X 2320(a)X 2387(\256le)X 2534(in)X 2633(the)X 2775(executable)X 3212(format.)X 776 1804(Object)N 1068(modules)X 1429(to)X 1539(be)X 1665(linked)X 1941(together)X 2292(can)X 2462(be)X 2589(taken)X 2834(from)X 3057(individual)X 3484(object)X 3756(\256les)X 3952(or)X 576 1956(library)N 860(\256les.)X 1095(A)X 1191(typical)X 1481(link)X 1658(editor)X 1910(usually)X 2215(handle)X 2499(these)X 2724(two)X 2895(types)X 3125(of)X 3232(\256les)X 3418(differently.)X 3899(For)X 576 2108(a)N 653(simple)X 944(object)X 1214(\256le,)X 1395(the)X 1548(object)X 1819(module)X 2143(it)X 2232(contains)X 2588(is)X 2687(always)X 2989(loaded)X 3281(into)X 3466(the)X 3619(executable)X 576 2260(\256le.)N 777(For)X 940(a)X 1013(library)X 1299(\256le,)X 1475(since)X 1702(not)X 1854(all)X 1980(modules)X 2335(it)X 2418(contains)X 2768(are)X 2915(generally)X 3303(needed,)X 3629(only)X 3829(those)X 576 2412(modules)N 938(de\256ning)X 1289(an)X 1416(unresolved)X 1874(external)X 2221(reference)X 2616(are)X 2770(loaded.)X 3111(Since)X 3361(a)X 3440(module)X 3765(from)X 3989(a)X 576 2564(library)N 860(may)X 1053(itself)X 1273(contain)X 1583(references)X 2005(to)X 2106(other)X 2330(modules,)X 2706(loading)X 3021(it)X 3101(may)X 3293(generate)X 3646(additional)X 576 2716(external)N 917(references.)X 1391(Therefore,)X 1825(link)X 2005(editors)X 2297(are)X 2445(responsible)X 2913(to)X 3019(search)X 3296(through)X 3626(the)X 3775(library)X 576 2868(\256les)N 760(to)X 859(ensure)X 1134(all)X 1255(required)X 1600(modules)X 1950(are)X 2092(loaded.)X 776 3048(The)N 958(ability)X 1237(for)X 1381(a)X 1456(linker)X 1713(to)X 1820 0.2812(automatically)AX 2378(select)X 2630(and)X 2801(load)X 2999(only)X 3202(the)X 3352(required)X 3706(modules)X 576 3200(from)N 800(a)X 880(library)X 1174(\256le)X 1334(is)X 1435(very)X 1643(important:)X 2106(it)X 2197(alleviates)X 2599(the)X 2753(need)X 2971(for)X 3119(a)X 3198(user)X 3394(to)X 3505(keep)X 3723(track)X 3952(of)X 576 3352(which)N 842(modules)X 1199(are)X 1348(required.)X 1748(However,)X 2155(the)X 2304(executable)X 2748(\256le)X 2902(might)X 3159(still)X 3336(contain)X 3652(inaccessi-)X 576 3504(ble)N 730(functions)X 1124(or)X 1240(data)X 1437(because)X 1778(even)X 1996(if)X 2091(only)X 2298(one)X 2473(of)X 2589(the)X 2743(functions)X 3137(de\256ned)X 3456(in)X 3566(a)X 3644(module)X 3968(is)X 576 3656(needed,)N 897(the)X 1039(linker)X 1288(loads)X 1515(complete)X 1893(the)X 2035(module.)X 776 3836(Figure)N 1060(1)X 1141(shows)X 1413(an)X 1537(example)X 1898(of)X 2012(linking)X 2319(3)X 2401(\256les:)X 5 f 2644(main.o)X 1 f 2881(,)X 5 f 2937(sub.o)X 1 f 3130(,)X 3188(and)X 5 f 3359(libc.a)X 1 f 3542(.)X 5 f 3622(Main.o)X 1 f 3893(and)X 5 f 576 3988(sub.o)N 1 f 799(are)X 947(object)X 1213(\256les)X 1402(and)X 5 f 1568(libc.a)X 1 f 1780(is)X 1873(a)X 1945(library)X 2231(archive,)X 2568(containing)X 3004(object)X 3269(\256les)X 5 f 3456(lib1.o)X 1 f 3644(,)X 5 f 3695(lib2.o)X 1 f 3883(,)X 3936(...,)X 5 f 576 4140(libn.o)N 1 f 764(.)X 847(As)X 988(shown)X 1273(in)X 1383(the)X 1536(\256gure,)X 5 f 1817(main.o)X 1 f 2089(contains)X 2445(references)X 2876(to)X 5 f 2985(sub.o)X 1 f 3214(and)X 3389(the)X 3543(function)X 5 f 3898(foo)X 1 f 4008(,)X 576 4292(which)N 839(is)X 931(de\256ned)X 1242(in)X 5 f 1343(lib1.o)X 1 f 1531(.)X 1607(Function)X 5 f 1975(goo)X 1 f 2107(,)X 2159(also)X 2342(de\256ned)X 2653(in)X 5 f 2754(lib1.o)X 1 f 2942(,)X 2994(contains)X 3343(a)X 3414(reference)X 3800(to)X 5 f 3900(hoo)X 1 f 576 4444(de\256ned)N 892(in)X 5 f 998(lib2.o)X 1 f 1186(.)X 1267(Since)X 1514(the)X 1665(smallest)X 2014(unit)X 2197(of)X 2310(linking)X 2617(is)X 2715(an)X 2840(object)X 3110(module,)X 5 f 3455(lib1.o)X 1 f 3677(is)X 3775(loaded)X 576 4596(completely)N 1046(into)X 1237(the)X 1396(executable)X 1850(\256le,)X 2038(even)X 2261(though)X 5 f 2567(goo)X 1 f 2740(is)X 2845(actually)X 3191(not)X 3354(referenced)X 3801(at)X 3911(all.)X 576 4748(Furthermore,)N 5 f 1105(lib2.o)X 1 f 1319(is)X 1409(also)X 1590(loaded)X 1874(because)X 2206(it)X 2287(de\256nes)X 5 f 2584(hoo)X 1 f 2716(,)X 2767(which)X 3029(is)X 3120(referenced)X 3554(by)X 5 f 3675(goo)X 1 f 3807(.)X 3882(The)X 576 4900(resultant)N 932(executable)X 1369(\256le)X 1516(generated)X 1915(will)X 2089(contain)X 2397(4)X 2469(modules:)X 5 f 2868(main.o)X 1 f 3105(,)X 5 f 3151(sub.o)X 1 f 3344(,)X 5 f 3390(lib1.o)X 1 f 3578(,)X 3626(and)X 5 f 3787(lib2.o)X 1 f 3975(.)X 5 p %%Page: 5 6 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 2 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(5)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 10 f 576 1168(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)N 20 s 1458 2218 MXY 108 792 Dl 1522 2900 MXY 44 110 Dl 12 -118 Dl 1674 2002 MXY 899 -107 Dl 2463 1937 MXY 110 -42 Dl 2574 1894 MXY -117 -14 Dl 10 s 1458 2794 MXY 0 432 Dl 612 0 Dl 0 -432 Dl -612 0 Dl 1206 1858 MXY 576 0 Dl 0 467 Dl 2326 MY -576 0 Dl 0 -467 Dl 2574 3370 MXY 0 432 Dl 612 0 Dl 0 -432 Dl -612 0 Dl 1822 MY 0 647 Dl 2470 MY 612 0 Dl 0 -647 Dl 1822 MY -612 0 Dl 2650 MY 0 432 Dl 612 0 Dl 0 -432 Dl -612 0 Dl 40 s 2394 1642 MXY 1008 0 Dl 0 2267 Dl 3910 MY -1008 0 Dl 0 -2267 Dl 20 s 3114 2254 MXY D~ 360 323 -468 288 D~~ 3089 2782 MXY -83 84 Dl 113 -35 Dl 7 f 9 s 1286 2038(call)N 1501(foo)X 1365 1822(main.o)N 1603 2758(sub.o)N 2733 3334(libn.o)N 2611 2722(hoo\(\))N 2690 2290(call)N 2905(hoo)X 2733 2614(lib2.o)N 2733 1786(lib1.o)N 2611 2146(goo\(\))N 2611 1930(foo\(\))N 2733 1534(libc.a)N 2841 3118(.)N 2841 3154(.)N 2841 3226(.)N 2 f 12 s 1439 4110(Figure)N 1725(1:)X 1853(Linking)X 2171(of)X 2270(object)X 2530(and)X 2698(library)X 2989(\256les.)X 10 f 576 4414(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)N 6 p %%Page: 6 7 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(6)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 1599 1016(DYNAMIC)N 2080(VS.)X 2250(STATIC)X 2610(LINKING)X 3 f 576 1472(Static)N 835(linking)X 1147(and)X 1325(its)X 1445(limitations)X 1 f 576 1652(Most)N 798(operating)X 1187(systems)X 1516(assume)X 4 f 1824(static)X 2058(linking)X 1 f 2341(.)X 2414(That)X 2616(is,)X 2730(the)X 2874(link)X 3050(editing)X 3344(step)X 3525(is)X 3615(carried)X 3909(out)X 576 1804(only)N 775(once)X 985(to)X 1088(produce)X 1426(an)X 1545(executable)X 1986(\256le,)X 2161(which)X 2424(is)X 2516(loaded)X 2801(directly)X 3124(into)X 3302(memory)X 3651(when)X 3887(it)X 3968(is)X 576 1956(executed.)N 997(During)X 1299(the)X 1447(lifetime)X 1778(of)X 1888(an)X 2009(executing)X 2414(process,)X 2756(the)X 2904(\(virtual\))X 3250(locations)X 3628(of)X 3738(the)X 3887(text)X 576 2108(and)N 748(data)X 942(segments)X 1333(cannot)X 1623(change.)X 1977(As)X 2116(a)X 2192(result,)X 2463(these)X 2694(operating)X 3091(systems)X 3427(can)X 3593(safely)X 3855(allo-)X 576 2260(cate)N 756(the)X 898(remaining)X 1313(address)X 1625(space)X 1863(for)X 1999(the)X 2141(stack)X 2363(and)X 2526(dynamic)X 2882(data)X 3067(storage)X 3369(area.)X 776 2440(Systems)N 1127(that)X 1303(employ)X 1623(static)X 1858(linking)X 2162(require)X 2466(all)X 2594(global)X 2867(symbols)X 3219(to)X 3326(be)X 3449(well)X 3647(de\256ned)X 3962(at)X 576 2592(link)N 753(time.)X 1000(This)X 1198(requirement)X 1690(is)X 1780(a)X 1849(disadvantage)X 2378(because)X 2709(all)X 2832(object)X 3094(and)X 3259(library)X 3542(\256les)X 3728(must)X 3941(be)X 576 2744(available)N 957(during)X 1240(the)X 1390(construction)X 1898(of)X 2010(an)X 2133(executable)X 2578(\256le.)X 2782(As)X 2921(a)X 2997(result,)X 3268(it)X 3355(is)X 3452(dif\256cult)X 3790(to)X 3898(test)X 576 2896(and)N 747(debug)X 1014(portions)X 1361(of)X 1473(a)X 1547(large)X 1771(program)X 2128 0.2604(incrementally)AX 2690(before)X 2967(the)X 3116(whole)X 3382(program)X 3739(is)X 3834(com-)X 576 3048(pletely)N 870(written.)X 10 s 1167 3008(\262)N 12 s 1238 3048(Furthermore,)N 1774(the)X 1924(entire)X 2176(program)X 2534(has)X 2694(to)X 2801(be)X 2924(relinked)X 3272(if)X 3363(any)X 3534(of)X 3646(the)X 3796(object)X 576 3200(modules)N 950(are)X 1116(modi\256ed,)X 1530(or)X 1658(if)X 1765(new)X 1973(modules)X 2347(are)X 2513(to)X 2635(be)X 2773(added.)X 3098(Relinking)X 3525(of)X 3652(all)X 3796(object)X 576 3352(modules)N 938(can)X 1108(be)X 1235(very)X 1442(time)X 1650(consuming.)X 2156(But)X 2331(unfortunately)X 2886(with)X 3094(static)X 3335(linking,)X 3669(it)X 3760(is)X 3861(una-)X 576 3504(voidable)N 932(even)X 1138(in)X 1237(situations)X 1630(where)X 1889(most)X 2100(of)X 2204(the)X 2346(object)X 2606(modules)X 2956(remain)X 3248(unchanged.)X 776 3684(These)N 1033(drawbacks)X 1471(make)X 1707(static)X 1938(linking)X 2238(unsuitable)X 2661(for)X 2800(certain)X 3090(applications.)X 3631(For)X 3791(exam-)X 576 3836(ple,)N 747(a)X 819(graph)X 1066(plotting)X 1394(program)X 1748(may)X 1942(permit)X 2222(users)X 2447(to)X 2550(specify)X 2856(their)X 3061(own)X 3254(arithmetic)X 3674(functions)X 576 3988(to)N 675(be)X 790(plotted.)X 1130(It)X 1213(would)X 1477(be)X 1592(most)X 1803(convenient)X 2250(if)X 2333(users)X 2554(could)X 2792(de\256ne)X 3051(their)X 3252(own)X 3441(functions)X 3824(using)X 576 4140(the)N 735(programming)X 1300(language)X 1689(with)X 1901(which)X 2177(they)X 2384(were)X 2611(most)X 2838(familiar,)X 3208(and)X 3387(then)X 3593(incorporate)X 576 4292(these)N 809(new)X 1004(functions)X 1397(into)X 1582(the)X 1736(plotting)X 2072(program.)X 2482(However,)X 2894(the)X 3048(use)X 3212(of)X 3328(static)X 3568(linking)X 3877(pre-)X 576 4444(cludes)N 852(this)X 1021(obvious)X 1355(approach)X 1738(because)X 2073(the)X 2221(text)X 2395(segment)X 2745(of)X 2854(a)X 2926(program)X 3281(cannot)X 3567(be)X 3687(changed.)X 576 4596(Instead,)N 919(most)X 1147(plotting)X 1488(programs)X 1892(incorporate)X 2372(their)X 2590(own)X 2797(special)X 3107(interpreted)X 3567(language)X 3957(in)X 576 4748(which)N 847(users)X 1079(de\256ne)X 1349(their)X 1561(own)X 1761(functions.)X 2202(Consequently,)X 2790(users)X 3022(are)X 3175(forced)X 3456(to)X 3566(learn)X 3794(a)X 3872(new)X 576 4900(language,)N 979(which)X 1245(might)X 1501(not)X 1655(be)X 1777(as)X 1888(powerful)X 2266(as)X 2377(a)X 2452(general)X 2768(purpose)X 3104(programming)X 3660(language,)X 576 5052(thus)N 769(limiting)X 1108(the)X 1259(expressiveness)X 1863(of)X 1976(the)X 2126(users.)X 2403(Furthermore,)X 2940(the)X 3090(design)X 3373(and)X 3544(implementa-)X 576 5204(tion)N 753(of)X 860(an)X 978(interpreter)X 1407(for)X 1546(such)X 1749(a)X 1819(language)X 2195(increases)X 2576(the)X 2722(complexity)X 3184(and)X 3351(development)X 3877(cost)X 576 5356(of)N 706(the)X 873(originally)X 1297(very)X 1517(simple)X 1823(program.)X 2246(Ef\256ciency)X 2691(of)X 2820(the)X 2987(program)X 3362(is)X 3475(also)X 3679(degraded)X 576 5508(because,)N 929(in)X 1028(general,)X 1360(interpreted)X 1802(code)X 2008(executes)X 2364(more)X 2586(slowly)X 2866(than)X 3056(native)X 3316(machine)X 3667(code.)X 10 s 10 f 576 5604(h)N 592(hhhhhhhhhhhhhh)X 1 f 656 5714(\262)N 736(The)X 881(best)X 1030(a)X 1086(programmer)X 1503(can)X 1635(do)X 1735(is)X 1808(to)X 1890(write)X 2075(dummy)X 2339(routines)X 2617(for)X 2731(the)X 2849(un\256nished)X 3202(part.)X 7 p %%Page: 7 8 5(Helvetica-Narrow)xf 5 f 10 s 0 xH 0 xS 5 f 12 s 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(7)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 3 f 576 1016(Dynamic)N 968(linking)X 1 f 576 1196(Unlike)N 866(static)X 1098(linking,)X 4 f 1424(dynamic)X 1790(linking)X 1 f 2102(allows)X 2382(a)X 2454(process)X 2771(to)X 2875(add,)X 3067(remove,)X 3409(replace,)X 3741(or)X 3850(relo-)X 576 1348(cate)N 766(object)X 1036(modules)X 1396(within)X 1676(its)X 1801(address)X 2123(space)X 2371(during)X 2656(its)X 2781(execution.)X 3237(In)X 3350(other)X 3581(words,)X 3872(pro-)X 576 1500(grams)N 841(are)X 989(allowed)X 1324(to)X 1429(change.)X 1780(During)X 2082(the)X 2230(lifetime)X 2561(of)X 2671(its)X 2792(execution,)X 3222(a)X 3296(program)X 3653(may)X 3850(have)X 576 1652(new)N 773(modules)X 1135(added,)X 1425(old)X 1584(modules)X 1946(removed,)X 2343(or)X 2459(even)X 2677(evolve)X 2970(into)X 3156(a)X 3235(completely)X 3700(different)X 576 1804(program.)N 989(For)X 1161(compiled)X 1559(languages,)X 2007(the)X 2164(traditional)X 2600(concept)X 2939(that)X 3123(the)X 3281(code)X 3503(of)X 3623(a)X 3706(program)X 576 1956(does)N 776(not)X 923(change)X 1220(is)X 1308(no)X 1428(longer)X 1698(valid.)X 776 2136(Some)N 1036(existing)X 1382(systems)X 1727(support)X 2056(what)X 2284(they)X 2491(call)X 2672(dynamic)X 3045(linking)X 3359(but)X 3524(it)X 3620(is)X 3726(actually)X 576 2288(load-time)N 971(linking.)X 1317(For)X 1474(example,)X 1849(in)X 1948(SunOS)X 2243(version)X 2550(4,)X 2646(link)X 2820(editing)X 3112(consists)X 3440(of)X 3544(two)X 3712(phases)X 10 s 2248(2)Y 12 s 2288(.)Y 576 2440(After)N 805(the)X 949(static)X 1179(link)X 1355(phase,)X 1624(the)X 1768(executable)X 2208(\256le)X 2358(created)X 2664(contains)X 3012(only)X 3210(references)X 3633(to,)X 3759(but)X 3909(not)X 576 2592(the)N 723(actual)X 983(code)X 1194(for)X 1334(the)X 1480(library)X 1765(routines.)X 2151(Integration)X 2602(of)X 2710(these)X 2936(routines)X 3274(with)X 3473(the)X 3619(executable)X 576 2744(\256le)N 732(is)X 829(carried)X 1130(out)X 1286(by)X 1415(the)X 1566(load-time)X 1969(link)X 2152(phase,)X 2428(during)X 2712(which)X 2980(a)X 3056(linker)X 3314(is)X 3412(called)X 3677(to)X 3786(search)X 576 2896(and)N 747(load)X 945(the)X 1095(missing)X 1426(routines)X 1768(from)X 1987(the)X 2137(library)X 2426(before)X 2704(control)X 3009(is)X 3105(passed)X 3393(to)X 3499(the)X 3648(main)X 3872(pro-)X 576 3048(cedure.)N 908(This)X 1106(system)X 1400(requires)X 1737(all)X 1862(global)X 2131(symbols)X 2479(to)X 2582(be)X 2701(declared)X 3056(in)X 3159(the)X 3305(library,)X 3614(though)X 3909(not)X 576 3200(necessarily)N 1040(de\256ned,)X 1383(during)X 1670(the)X 1824(static)X 2064(link)X 2250(phase.)X 2552(After)X 2790(execution)X 3200(begins)X 3486(and)X 3660(control)X 3968(is)X 576 3352(passed)N 857(to)X 957(the)X 1100(main)X 1318(procedure,)X 1753(no)X 1875(modules)X 2227(can)X 2387(be)X 2504(added)X 2760(or)X 2866(removed.)X 3277(Furthermore,)X 3808(if)X 3893(any)X 576 3504(external)N 925(symbol)X 1246(reference)X 1642(cannot)X 1936(be)X 2064(resolved,)X 2451(the)X 2606(program)X 2969(will)X 3156(be)X 3284(aborted.)X 3658(A)X 3764(similar)X 576 3656(approach)N 964(is)X 1064(used)X 1276(by)X 1408(HP-UX)X 10 s 1700 3616(3)N 12 s 3656(,)Y 1800(UNIX)X 2075(System)X 2394(V)X 2499(Release)X 2835(4)X 10 s 3616(4)Y 12 s 3656(,)Y 2983(and)X 3158(VMS)X 10 s 3365 3616(5)N 12 s 3656(.)Y 3489(In)X 3605(addition)X 3957(to)X 576 3808(load-time)N 976(linking,)X 1303(OS/2)X 10 s 1500 3768(6)N 12 s 1570 3808(also)N 1755(supports)X 2110(run-time)X 2472(linking.)X 2823(But)X 2992(this)X 3161(scheme)X 3479(requires)X 3818(much)X 576 3960(operating)N 968(system)X 1263(support)X 1580(and)X 1748(dynamically)X 2254(linked)X 2524(modules)X 2879(cannot)X 3165(reference)X 3553(any)X 3721(external)X 576 4112(symbols)N 929(de\256ned)X 1245(by)X 1374(other)X 1605(modules)X 1964(except)X 2249(the)X 2400(module)X 2722(entry)X 2953(point.)X 3232(Old)X 3408(systems)X 3744(such)X 3952(as)X 576 4264(MULTICS)N 10 s 997 4224(7)N 12 s 1101 4264(and)N 1304(languages)X 1753(such)X 1993(as)X 2137(COBOL)X 2526(also)X 2745(support)X 3097(some)X 3364(kind)X 3599(of)X 3743(\257exible)X 576 4416(linking/loading)N 1204(mechanism.)X 1730(However,)X 2145(none)X 2371(of)X 2489(the)X 2645(systems)X 2987(mentioned)X 3432(above)X 3700(allows)X 3989(a)X 576 4568(program)N 926(to)X 1025(dynamically)X 1526(modify)X 1828(its)X 1943(functionality)X 2460(during)X 2735(the)X 2877(execution.)X 776 4748(One)N 964(incremental)X 1448(compilation)X 1937(system)X 10 s 2204 4708(8)N 12 s 2272 4748(uses)N 2466(a)X 2538(different)X 2899(approach:)X 3332(it)X 3415(provides)X 3775(library)X 576 4900(procedures)N 1022(that)X 1191(load)X 1381(additional)X 1791(object)X 2051(modules)X 2401(into)X 2575(the)X 2717(data)X 2902(area)X 3087(of)X 3191(a)X 3258(running)X 3581(process)X 3893(and)X 576 5052(allows)N 858(these)X 1087(modules)X 1444(to)X 1550(be)X 1673(executed.)X 2096(This)X 2299(system)X 2598(does)X 2806(not)X 2961(relocate)X 3299(or)X 3411(resolve)X 3721(external)X 576 5204(symbol)N 886(references.)X 1357(Instead,)X 1686(it)X 1767(locates)X 2062(every)X 2303(symbol)X 2612(indirectly)X 3008(through)X 3333(an)X 3450(on-line)X 3749(symbol)X 576 5356(table)N 799(pointed)X 1123(to)X 1233(by)X 1364(a)X 1442(special)X 1745(reserved)X 2106(register,)X 2454(thus)X 2649(causing)X 2978(a)X 3056(degradation)X 3546(in)X 3657(execution)X 576 5508(speed.)N 872(Furthermore,)X 1406(this)X 1574(system)X 1870(requires)X 2209(extensive)X 2602(modi\256cation)X 3118(to)X 3222(the)X 3369(compiler,)X 3765(assem-)X 576 5660(bler,)N 783(and)X 955(the)X 1106(libraries)X 1455(to)X 1563(accomplish)X 2035(this)X 2207(special)X 2508(addressing)X 2952(scheme.)X 3322(While)X 3592(this)X 3765(system)X 576 5812(allows)N 860(modules)X 1219(to)X 1327(be)X 1451(added)X 1714 0.2604(incrementally)AX 2278(to)X 2386(an)X 2510(executing)X 2918(process,)X 3262(old)X 3417(modules)X 3775(cannot)X 8 p %%Page: 8 9 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(8)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(be)N 695(removed.)X 1108(Consequently,)X 1689(using)X 1925(this)X 2092(system)X 2387(to)X 2490(implement)X 2931(applications)X 3425(such)X 3629(as)X 3737(interac-)X 576 1168(tive)N 760(program)X 1125(development)X 1661(may)X 1865(not)X 2026(be)X 2155(practical)X 2526(because)X 2869(obsolete)X 3228(modules)X 3592(accumulate)X 576 1320(and)N 739(may)X 929(eventually)X 1355(\256ll)X 1486(the)X 1628(memory)X 1973(space.)X 9 p %%Page: 9 10 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2224 616(-)N 2280(9)X 2352(-)X 3362(October)X 3696(15,)X 3840(1990)X 1445 1016(DLD)N 1666(\320)X 1786(A)X 1879(GENUINE)X 2329(DYNAMIC)X 2810(LINKER)X 576 1348(This)N 773(section)X 1072(describes)X 1456(the)X 1600(major)X 1851(design)X 2128(and)X 2293 0.2548(implementation)AX 2925(issues)X 3181(of)X 3288(a)X 3358(software)X 3716(package)X 576 1500(called)N 2 f 838(dld)X 1 f 992(that)X 1168(provides)X 1529(all)X 1656(the)X 1804(functionalities)X 2386(of)X 2496(a)X 2569(dynamic)X 2931(linking)X 3234(system.)X 3579(The)X 3759(current)X 576 1652 0.2548(implementation)AN 10 s 1182 1612(\262)N 12 s 1261 1652(of)N 2 f 1381(dld)X 1 f 1544(is)X 1648(a)X 1731(collection)X 2152(of)X 2272(library)X 2569(routines)X 2919(that)X 3104(are)X 3262(called)X 3533(by)X 3669(programs)X 576 1804(written)N 879(in)X 984(C)X 1078(running)X 1407(under)X 1656(the)X 1804(UNIX)X 2072(operating)X 2465(system.)X 2809(No)X 2955(modi\256cation)X 3471(of)X 3580(the)X 3727(existing)X 576 1956(compiler)N 955(or)X 1071(assembler)X 1492(is)X 1592(necessary.)X 2050(The)X 2236(standard)X 2598(UNIX)X 2873(system)X 3176(linker)X 3437(is)X 3537(used)X 3749(only)X 3957(to)X 576 2108(create)N 837(the)X 985(initial)X 1241(executable)X 1684(\256le.)X 1885(All)X 2038(the)X 2186(dynamic)X 2547(link)X 2726(editing)X 3023(is)X 3116(carried)X 3413(out)X 3565(by)X 3690(invoking)X 576 2260(routines)N 929(provided)X 1314(by)X 2 f 1453(dld)X 1 f 1576(.)X 1667(Although)X 2 f 2073(dld)X 1 f 2239(is)X 2346(targeted)X 2700(for)X 2855(C)X 2963(and)X 3146(UNIX,)X 3453(the)X 3615(underlying)X 576 2412(concept\320the)N 1124(use)X 1286(of)X 1400(library)X 1691(functions)X 2082(to)X 2190(build)X 2421(a)X 2497(dynamic)X 2862(linker\320is)X 3280(applicable)X 3710(to)X 3818(many)X 576 2564(other)N 798(programming)X 1346(languages)X 1755(and)X 1918(operating)X 2306(systems.)X 3 f 576 2868(An)N 722(overview)X 1115(of)X 1219(dld)X 2 f 576 3048(Dld)N 1 f ('s)S 821(two)X 997(basic)X 1227(operations)X 1660(are)X 1810(``link'')X 2120(and)X 2291(``unlink''.)X 2745(It)X 2836(also)X 3023(provides)X 3386(supporting)X 3829(func-)X 576 3200(tions)N 787(for)X 923(looking)X 1241(up)X 1361(the)X 1503(addresses)X 1895(of)X 1999(global)X 2264(symbols)X 2608(and)X 2771(entry)X 2993(points)X 3252(of)X 3356(functions.)X 776 3380(The)N 958(link)X 1140(operation)X 1536(is)X 1632(performed)X 2065(by)X 2193(the)X 2343(function)X 5 f 2694(dlink\(char)X 3056(*\256lename\))X 1 f 3411(,)X 3468(where)X 5 f 3734(\256lename)X 1 f 576 3532(speci\256es)N 934(either)X 1181(a)X 1251(relocatable)X 1702(object)X 1965(\256le)X 2115(or)X 2222(an)X 2340(object)X 2603(library.)X 2935(If)X 3026(the)X 3171(speci\256ed)X 3540(\256le)X 3690(is)X 3781(a)X 3850(relo-)X 576 3684(catable)N 879(object)X 1144(\256le,)X 1320(it)X 1403(is)X 1496(completely)X 1954(loaded)X 2240(into)X 2420(memory.)X 2819(If)X 2913(it)X 2997(is)X 3091(a)X 3164(library)X 3451(\256le,)X 3628(only)X 3829(those)X 576 3836(modules)N 942(de\256ning)X 1297(an)X 1427(unresolved)X 1888(external)X 2238(reference)X 2636(are)X 2793(loaded.)X 3137(Since)X 3390(a)X 3472(module)X 3800(in)X 3914(the)X 576 3988(library)N 868(may)X 1069(itself)X 1297(reference)X 1692(other)X 1926(routines)X 2272(in)X 2383(the)X 2537(library,)X 2854(loading)X 3179(it)X 3269(may)X 3471(generate)X 3834(more)X 576 4140(unresolved)N 1037(external)X 1387(references)X 1822(\(as)X 1973(was)X 2161(seen)X 2371(in)X 2485(the)X 2641(example)X 3006(in)X 3119(\256gure)X 3381(1\).)X 3547(Therefore,)X 3989(a)X 576 4292(library)N 879(\256le)X 1048(is)X 1158(searched)X 1541(repeatedly)X 1989(until)X 2212(a)X 2301(scan)X 2518(through)X 2864(all)X 3008(library)X 3312(members)X 3712(is)X 3823(made)X 576 4444(without)N 901(having)X 1194(to)X 1300(load)X 1497(any)X 1667(new)X 1858(modules.)X 2263(Since)X 2508(a)X 2582(UNIX)X 2852(process)X 3171(cannot)X 3458(expand)X 3766(its)X 3887(text)X 576 4596(segment,)N 5 f 948(dlink)X 1 f 1138(allocates)X 1506(storage)X 1814(for)X 1956(all)X 2083(these)X 2311(new)X 2501(modules)X 2857(from)X 3074(the)X 3222(dynamic)X 3584(data)X 3775(area\320)X 576 4748(the)N 2 f 735(heap)X 1 f 922(\320using)X 5 f 1265(malloc)X 1 f 1492(,)X 1557(UNIX's)X 1906(memory)X 2268(allocator)X 2647(\(assuming)X 3083(the)X 3241(system)X 3548(has)X 3716(writable)X 576 4900(executable)N 1016(memory\).)X 1444(After)X 1674(all)X 1798(modules)X 2151(are)X 2296(loaded,)X 5 f 2602(dlink)X 1 f 2790(resolves)X 3132(as)X 3239(many)X 3480(external)X 3818(refer-)X 576 5052(ences)N 817(as)X 924(possible.)X 1314(Note)X 1528(that)X 1699(some)X 1928(symbols)X 2274(might)X 2525(still)X 2696(be)X 2813(unde\256ned)X 3218(at)X 3314(this)X 3479(stage,)X 3727(because)X 576 5204(the)N 718(modules)X 1068(de\256ning)X 1407(them)X 1624(have)X 1830(not)X 1977(yet)X 2119(been)X 2325(loaded.)X 10 s 10 f 576 5402(h)N 592(hhhhhhhhhhhhhh)X 1 f 656 5512(\262)N 736(A)X 816(number)X 1083(of)X 1172(functions)X 1492(in)X 1577(the)X 1698(current)X 1949(implementation)X 2474(of)X 2 f 2564(dld)X 1 f 2689(are)X 2811(borrowed)X 3142(and)X 3281(modi\256ed)X 3588(from)X 576 5608(the)N 2 f 694(ld)X 1 f 776(link)X 920(editor)X 1127(developed)X 1477(by)X 1577(the)X 1695(GNU)X 1889(project)X 2132(of)X 2219(the)X 2337(Free)X 2500(Software)X 2810(Foundation.)X 10 p %%Page: 10 11 5(Helvetica-Narrow)xf 5 f 10 s 0 xH 0 xS 5 f 12 s 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(10)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 776 1016(Unlinking)N 1212(a)X 1301(module)X 1636(is)X 1746(simply)X 2055(the)X 2220(reverse)X 2545(of)X 2672(the)X 2837(link)X 3034(operation.)X 3493(The)X 3690(speci\256ed)X 576 1168(module)N 892(is)X 983(removed)X 1347(and)X 1513(the)X 1658(memory)X 2006(allocated)X 2382(to)X 2484(it)X 2565(is)X 2655(reclaimed.)X 3110(Additionally,)X 3647(resolution)X 576 1320(of)N 684(external)X 1023(references)X 1447(must)X 1662(be)X 1781(undone.)X 2140(For)X 2301(instance,)X 2669(if)X 2756(the)X 2902(module)X 5 f 3217(foo)X 1 f 3355(is)X 3447(to)X 3551(be)X 3671(unlinked,)X 576 1472(all)N 713(references)X 1149(to)X 1264(any)X 1443(symbols)X 1802(de\256ned)X 2124(in)X 5 f 2236(foo)X 1 f 2385(from)X 2611(other)X 2848(parts)X 3074(of)X 3193(the)X 3350(program)X 3715(must)X 3941(be)X 576 1624(marked)N 953(``unde\256ned''.)X 2 f 1596(Dld)X 1 f 1828(provides)X 2247(two)X 2479(functions)X 2925(for)X 3126(unlinking)X 3584(a)X 3716(module:)X 5 f 576 1776(unlink_by_\256le\(char)N 1253(*\256lename,)X 1626(int)X 1748(hard\))X 1 f 1973(and)X 5 f 2150(unlink_by_symbol\(char)X 2976(*symbol,)X 3300(int)X 3421(hard\))X 1 f 3605(.)X 3693(The)X 3883(\256rst)X 576 1928(function)N 942(requires)X 1297(as)X 1422(a)X 1511(parameter)X 1943(the)X 2107(\256lename)X 2485(corresponding)X 3081(to)X 3202(a)X 3291(module)X 3626(previously)X 576 2080(linked)N 844(in)X 946(by)X 5 f 1067(dlink)X 1 f 1228(,)X 1279(while)X 1520(the)X 1665(second)X 1959(function)X 2307(unlinks)X 2617(the)X 2762(module)X 3077(that)X 3248(de\256nes)X 3546(the)X 3690(speci\256ed)X 576 2232(symbol.)N 776 2412(Figure)N 1058(2)X 1137(shows)X 1407(a)X 1481(simple)X 1770(example)X 2129(illustrating)X 2579(some)X 2814(of)X 2926(the)X 2 f 3076(dld)X 1 f 3231(functions.)X 3669(This)X 3872(pro-)X 576 2564(gram)N 805(repeatedly)X 1238(reads)X 1472(from)X 1690(the)X 1839(standard)X 2195(input)X 2423(the)X 2571(name)X 2810(of)X 2920(an)X 3041(object)X 3307(\256le)X 3460(and)X 3629(that)X 3804(of)X 3914(the)X 576 2716(user)N 763(function)X 1111(to)X 1213(be)X 1331(executed.)X 1749(It)X 1835(then)X 2029(links)X 2244(in)X 2347(the)X 2493(speci\256ed)X 2863(\256le,)X 3038(executes)X 3398(the)X 3544(named)X 3829(func-)X 576 2868(tion,)N 774(and)X 937(\256nally)X 1207(removes)X 1557(it)X 1635(from)X 1846(the)X 1988(memory.)X 776 3048(On)N 920(line)X 1092(13,)X 1239(the)X 1384(function)X 5 f 1730(dld_init\(char)X 2183(*\256lename\))X 1 f 2565(performs)X 2940(the)X 3086(required)X 3435 0.2788(initialization)AX 3952(of)X 576 3200(the)N 2 f 721(dld)X 1 f 871(package.)X 1262(It)X 1348(takes)X 1573(as)X 1680(argument)X 2071(the)X 2216(initial)X 2469(executable)X 2909(\256le)X 3059(of)X 3166(the)X 3311(program)X 3664(and)X 3829(loads)X 576 3352(the)N 731(symbol)X 1051(table)X 1276(information)X 1768(of)X 1885(this)X 2061(\256le)X 2221(into)X 2409(memory.)X 2816(Line)X 3031(24)X 3165(demonstrates)X 3711(how)X 3914(the)X 576 3504(entry)N 815(point)X 1054(of)X 1175(a)X 1259 0.2022(dynamically-linked)AX 2050(function)X 2411(can)X 2585(be)X 2716(obtained.)X 3136(The)X 3326(value)X 3575(returned)X 3936(by)X 5 f 576 3656(get_func\(char)N 1080(*func_name\))X 1 f 1559(can)X 1725(later)X 1929(be)X 2052(used)X 2260(as)X 2372(a)X 2447(pointer)X 2752(to)X 2859(the)X 3009(function,)X 3386(as)X 3498(shown)X 3780(in)X 3887(line)X 576 3808(27.)N 786(The)X 1002(predicate)X 1422(function)X 5 f 1807(function_executable_p\(char)X 2797(*func_name\))X 1 f 3311(tells)X 3538(whether)X 3914(the)X 576 3960(speci\256ed)N 958(function)X 1319(can)X 1493(be)X 1624(safely)X 1894(executed,)X 2301(i.e.,)X 2484(whether)X 2835(the)X 2994(execution)X 3410(of)X 3531(this)X 3711(function)X 576 4112(might)N 827(lead)X 1014(to)X 1115(referencing)X 1580(any)X 1745(unde\256ned)X 2149(symbols.)X 2542(The)X 2717(precise)X 3015(de\256nition)X 3409(of)X 3514(this)X 3678(predicate)X 576 4264(function)N 926(is)X 1019(described)X 1417(later.)X 1666(In)X 1775(this)X 1943(example)X 2299(\(line)X 2505(29\),)X 5 f 2684(unlink_by_symbol)X 1 f 3338(is)X 3432(used)X 3638(to)X 3743(remove)X 576 4416(the)N 718(new)X 902(module.)X 3 f 576 4720(Semantics)N 1016(of)X 1120(unlink)X 1 f 576 4900(As)N 717(seen)X 923(above,)X 1212(the)X 1366(unlink)X 1648(functions)X 2042(actually)X 2384(take)X 2581(two)X 2761(parameters.)X 3268(The)X 3454(\256rst)X 3639(one)X 3814(is)X 3914(the)X 576 5052(name)N 811(of)X 917(a)X 986(symbol)X 1295(or)X 1401(\256le,)X 1574(while)X 1814(the)X 1958(second)X 2251(one)X 2415(is)X 2504(a)X 2572(boolean)X 2902(parameter.)X 3361(When)X 3616(the)X 3759(param-)X 576 5204(eter)N 5 f 745(hard)X 1 f 929(is)X 1019(zero)X 1212(\()X 2 f 1244(soft)X 1410(unlink)X 1 f 1651(\),)X 1734(the)X 1879(speci\256ed)X 2248(module)X 2564(is)X 2655(marked)X 2971(as)X 4 f 3078(removable)X 1 f 3517(but)X 3667(it)X 3748(is)X 3839(actu-)X 576 5356(ally)N 758(removed)X 1132(from)X 1356(memory)X 1714(only)X 1922(if)X 2018(it)X 2108(is)X 2208(not)X 2367(referenced)X 2810(by)X 2942(any)X 3117(other)X 3351(modules.)X 3761(On)X 3914(the)X 576 5508(other)N 802(hand,)X 1041(if)X 1128(the)X 1274(parameter)X 5 f 1686(hard)X 1 f 1872(is)X 1964(non-zero)X 2334(\()X 2 f 2366(hard)X 2575(unlink)X 1 f 2816(\),)X 2900(this)X 3068(module)X 3386(is)X 3479(removed)X 3845(from)X 576 5660(memory)N 930(unconditionally.)X 1616(Since)X 1863(unlinking)X 2265(a)X 2341(module)X 2662(may)X 2860(leave)X 3096(some)X 3331(remaining)X 3754(remov-)X 576 5812(able)N 794(modules)X 1177(unreferenced,)X 1761(a)X 1861(garbage)X 2223(collector)X 2618(is)X 2740(always)X 3065(called)X 3354(to)X 3487(remove)X 3834(these)X 11 p %%Page: 11 12 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(11)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 2 f 10 f 576 1168(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)N 7 f 9 s 842 1448(1)N 971(/*)X 1100(The)X 1272(name)X 1487(of)X 1616(the)X 1788(object)X 2089(file)X 2304(and)X 2476(the)X 2648(function)X 3035(name)X 3250(are)X 3422(read)X 3637(from)X 3852(the)X 842 1528(2)N 1100(stdin.)X 1444(The)X 1616(named)X 1874(function)X 2261(is)X 2390(invoked)X 2734(through)X 3078(a)X 3164(pointer.)X 3594(For)X 842 1608(3)N 1100(illustrative)X 1659(purpose)X 2003(the)X 2175(object)X 2476(file)X 2691(is)X 2820(unlinked)X 3207(right)X 3465(after)X 3723(the)X 842 1688(4)N 1100(invocation.)X 842 1768(5)N 971(*/)X 842 1848(6)N 971(#include)X 1358()X 842 1928(7)N 971(#include)X 1358("dld.h")X 842 2008(8)N 842 2088(9)N 971(main)X 1186(\(int)X 1401(argc,)X 1659(char)X 1874(**argv\))X 2218({)X 799 2168(10)N 799 2248(11)N 1143(char)X 1358(file_name[80],)X 2003(func_name[80];)X 799 2328(12)N 799 2408(13)N 8 f 1143(dld_init)X 7 f 1530(\(argv[0]\);)X 799 2488(14)N 799 2568(15)N 1143(printf)X 1444(\("object)X 1831(file?)X 2089("\);)X 799 2648(16)N 1143(while)X 1401(\(gets\(file_name\))X 2132(!=)X 2261(NULL\))X 2519({)X 799 2728(17)N 1315(register)X 1702(void)X 1917(\(*func\))X 2261(\(\);)X 799 2808(18)N 799 2888(19)N 8 f 1315(dlink)X 7 f 1573(\(file_name\);)X 799 2968(20)N 799 3048(21)N 1315(printf)X 1616(\("function)X 2089(name?)X 2347("\);)X 799 3128(22)N 1315(gets\(func_name\);)X 799 3208(23)N 799 3288(24)N 1315(func)X 1530(=)X 1616(\(void)X 1874(\(*\))X 2046(\(\)\))X 8 f 2218(get_func)X 7 f 2605(\(func_name\);)X 799 3368(25)N 799 3448(26)N 1315(if)X 1444(\()X 8 f 1487 -0.1969(function_executable_p)AX 7 f 2433(\(func_name\)\))X 799 3528(27)N 1487(\(*func\))X 1831(\(\);)X 799 3608(28)N 799 3688(29)N 8 f 1315(unlink_by_symbol)X 7 f 2046(\(func_name,)X 2562(1\);)X 799 3768(30)N 799 3848(31)N 1315(printf)X 1616(\("object)X 2003(file?)X 2261("\);)X 799 3928(32)N 1143(})X 799 4008(33)N 971(})X 2 f 12 s 1345 4208(Figure)N 1631(2:)X 1759(Simple)X 2045(illustration)X 2497(of)X 2596(the)X 2738(dld)X 2885(functions.)X 10 f 576 4512(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)N 1 f 576 4968(unreferenced)N 1107(modules.)X 1509(As)X 1643(a)X 1714(special)X 2010(case,)X 2228(library)X 2513(modules)X 2867(are)X 3013(always)X 3308(considered)X 3754(remov-)X 576 5120(able)N 761(and)X 924(are)X 1066 0.2305(garbage-collected)AX 1776(whenever)X 2174(they)X 2364(are)X 2506(not)X 2653(referenced)X 3084(by)X 3204(other)X 3426(modules.)X 10 s 3776 5080(\262)N 10 f 576 5402(h)N 592(hhhhhhhhhhhhhh)X 1 f 656 5512(\262)N 736(In)X 840(the)X 975(next)X 1150(version)X 1423(of)X 2 f 1527(dld)X 1 f 1629(,)X 1686(users)X 1888(will)X 2049(be)X 2162(allowed)X 2453(to)X 2552(explicitly)X 2891(keep)X 3080(a)X 3153(library)X 3404(module)X 3682(in)X 576 5608(memory)N 863(even)X 1035(if)X 1104(it)X 1168(is)X 1241(not)X 1363 0.3625(referenced.)AX 12 p %%Page: 12 13 5(Helvetica-Narrow)xf 5 f 10 s 0 xH 0 xS 5 f 12 s 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(12)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 2 f 10 f 576 1168(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)N 1 f 2718 2995 MXY 216 216 De 1278 1628 MXY 216 216 De 2034 MX 216 216 De 2034 2204 MXY 216 216 De 2732 MX 259 259 De 2754 1628 MXY 216 216 De 3114 MX 216 216 De 2754 2204 MXY 216 216 De 1566 3571 MXY 216 216 De 1854 2995 MXY 216 216 De 2790 3103 MXY -14 24 Dl 2761 3151 MXY -14 24 Dl 2732 3199 MXY -14 24 Dl 2704 3247 MXY -14 24 Dl 2675 3295 MXY -14 24 Dl 2646 3343 MXY -14 24 Dl 2617 3391 MXY -14 24 Dl 2588 3439 MXY -14 24 Dl 2591 3406 MXY -17 57 Dl 3464 MY 42 -42 Dl 1386 1736 MXY 0 28 Dl 1791 MY 0 28 Dl 1846 MY 0 28 Dl 1901 MY 0 28 Dl 1957 MY 0 28 Dl 2012 MY 0 28 Dl 2067 MY 0 28 Dl 1371 2037 MXY 14 58 Dl 1386 2096 MXY 14 -58 Dl 2142 1736 MXY 0 360 Dl 2113 1980 MXY 28 115 Dl 2142 2096 MXY 28 -115 Dl 2862 1736 MXY 0 360 Dl 2833 1980 MXY 28 115 Dl 2862 2096 MXY 28 -115 Dl 3158 1729 MXY -223 367 Dl 2969 1983 MXY -35 113 Dl 84 -83 Dl 1912 3096 MXY -194 374 Dl 1744 3355 MXY -27 115 Dl 78 -88 Dl 11 s 2490 3936(\(d2\))N 2658(hard)X 2836(unlink)X 1522 3934(\(d1\))N 1690(soft)X 1844(unlink)X 2 f 2799 3031(B)N 2835 1663(A)N 2113 2239(C)N 2833(C)X 2115 1663(A)N 3195(B)X 1359(A)X 1 f 2994 2527(\(c\))N 2091(\(b\))X 1360(\(a\))X 2 f 1645 3607(C)N 1935 3031(B)N 1295 4117(Figure)N 1557(3:)X 1674(Illustration)X 2094(of)X 2185(the)X 2315(two)X 2465(different)X 2787(unlink)X 3030(options.)X 10 f 576 4421(h)N 600(hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh)X 1 f 12 s 776 4725(The)N 953(semantics)X 1360(of)X 1467(these)X 1692(two)X 1863(unlinking)X 2260(options)X 2571(can)X 2733(best)X 2916(be)X 3035(explained)X 3438(by)X 3562(an)X 3681(example.)X 576 4877(Consider)N 951(two)X 1123(modules,)X 2 f 1500(A)X 1 f 1586(and)X 2 f 1752(B)X 1 f 1811(,)X 1862(both)X 2060(containing)X 2494(a)X 2564(call)X 2731(to)X 2833(a)X 2903(function)X 3251(de\256ned)X 3561(in)X 2 f 3663(C)X 1 f 3727(.)X 3802(These)X 576 5029(modules)N 927(are)X 1070(linked)X 1336(and)X 1500(removed)X 1862(in)X 1962(the)X 2105(order)X 2333(as)X 2438(shown)X 2713(in)X 2813(\256gure)X 3062(3.)X 2 f 3183(A)X 1 f 3268(is)X 3358(linked)X 3625(in)X 3726(\256rst)X 3901(\(a\).)X 576 5181(Then)N 2 f 811(C)X 1 f 912(is)X 1013(also)X 1205(linked)X 1483(\(b\).)X 1680(When)X 2 f 1947(B)X 1 f 2043(is)X 2144(linked)X 2421(in,)X 2556(all)X 2689(its)X 2816(external)X 3163(symbol)X 3482(references)X 3914(are)X 576 5333(resolved)N 928(successfully)X 1424(because)X 2 f 1755(C)X 1 f 1845(has)X 1999(already)X 2309(been)X 2517(loaded)X 2800(into)X 2976(memory.)X 3372(Thus,)X 2 f 3615(C)X 1 f 3706(does)X 3909(not)X 576 5485(need)N 782(to)X 881(be)X 996(linked)X 1261(in)X 1360(again.)X 1641(Instead,)X 1967(it)X 2045(is)X 2133(shared)X 2408(by)X 2528(both)X 2 f 2723(A)X 1 f 2806(and)X 2 f 2969(B)X 1 f 3052(\(c\).)X 776 5665(Now,)N 1011(suppose)X 1345(that)X 2 f 1515(A)X 1 f 1599(is)X 1688(unlinked,)X 2075(and)X 2240(in)X 2341(order)X 2570(to)X 2671(clean)X 2901(up)X 3023(any)X 3188(module)X 3503(referenced)X 3936(by)X 2 f 576 5817(A)N 1 f 635(,)X 2 f 691(C)X 1 f 787(is)X 883(being)X 1129(unlinked,)X 1522(too.)X 1725(Should)X 2 f 2029(C)X 1 f 2093(,)X 2149(which)X 2416(is)X 2512(currently)X 2892(referenced)X 3331(by)X 2 f 3459(B)X 1 f 3518(,)X 3573(be)X 3695(removed)X 13 p %%Page: 13 14 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(13)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(from)N 793(memory?)X 1211(Both)X 1428(possible)X 1773(semantics)X 2183(are)X 2331(reasonable.)X 2821(If)X 2 f 2915(unlinking)X 1 f 3309(a)X 3382(module)X 3701(means)X 3978(it)X 576 1168(may)N 779(be)X 907(removed)X 1281(if)X 1377(it)X 1468(is)X 1569(not)X 1729(being)X 1980(referenced)X 2424(anymore,)X 2 f 2821(C)X 1 f 2921(should)X 3213(not)X 3372(be)X 3499(removed)X 3872(\(d1\))X 576 1320(because)N 906(it)X 985(is)X 1074(still)X 1244(referenced)X 1677(by)X 2 f 1799(B)X 1 f 1858(.)X 1932(On)X 2075(the)X 2219(other)X 2443(hand,)X 2680(if)X 2 f 2765(unlinking)X 1 f 3155(literally)X 3482(means)X 3754(remov-)X 576 1472(ing)N 726(the)X 871(speci\256ed)X 1240(module,)X 2 f 1580(C)X 1 f 1671(should)X 1954(be)X 2071(removed,)X 2458(resulting)X 2821(in)X 2 f 2922(B)X 1 f 2981('s)X 3076(reference)X 3461(to)X 2 f 3562(C)X 1 f 3652(becoming)X 576 1624(unresolved)N 1022(\(d2\).)X 776 1804(Applications)N 1302(might)X 1561(require)X 1869(either)X 2124(or)X 2239(both)X 2445(unlink)X 2726(options.)X 3092(Thus,)X 2 f 3343(dld)X 1 f 3501(supports)X 3861(both)X 576 1956(options)N 888(and)X 1056(leaves)X 1326(the)X 1473(decision)X 1823(to)X 1927(the)X 2074(programmer.)X 2627(For)X 2788(example,)X 3167(if)X 3254(the)X 3400(module)X 3717(de\256ning)X 576 2108(a)N 656(commonly)X 1105(used)X 1318(function)X 1676(is)X 1777(to)X 1890(be)X 2019(replaced)X 2384(by)X 2518(an)X 2647(enhanced)X 3049(version,)X 3394(a)X 3475(hard)X 3684(unlink)X 3968(is)X 576 2260(desirable.)N 1000(A)X 1097(new)X 1285(version)X 1596(could)X 1837(then)X 2030(be)X 2148(linked)X 2416(in,)X 2542(and)X 2708(all)X 2832(references)X 3255(to)X 3357(the)X 3502(original)X 3829(func-)X 576 2412(tion)N 755(would)X 1024(be)X 1144(modi\256ed)X 1515(to)X 1619(point)X 1846(to)X 1951(this)X 2120(new)X 2310(function.)X 2709(On)X 2856(the)X 3004(other)X 3232(hand,)X 3473(some)X 3706(modules)X 576 2564(might)N 830(be)X 950(referenced)X 1386(from)X 1602(many)X 1845(different)X 2206(places)X 2476(in)X 2580(the)X 2727(program.)X 3130(It)X 3218(is)X 3311(not)X 3462(easy)X 3661(for)X 3801(a)X 3872(pro-)X 576 2716(grammer)N 951(to)X 1053(keep)X 1263(track)X 1484(whether)X 1822(a)X 1893(module)X 2210(is)X 2302(no)X 2426(longer)X 2700(referenced)X 3135(by)X 3259(others)X 3522(and)X 3689(thus)X 3877(safe)X 576 2868(to)N 689(be)X 818(removed)X 1193(from)X 1418(memory.)X 1825(The)X 2013(programmer)X 2527(might)X 2789(even)X 3008(be)X 3136(unaware)X 3499(of)X 3616(some)X 3856(such)X 576 3020(references.)N 1052(For)X 1217(example,)X 1600(functions)X 1990(such)X 2198(as)X 5 f 2308(strlen)X 1 f 2532(and)X 5 f 2701(malloc)X 1 f 2960(are)X 3110(referenced)X 3549(by)X 3677(at)X 3779(least)X 3989(a)X 576 3172(dozen)N 833(other)X 1058(library)X 1342(functions)X 1727(in)X 1829(the)X 1974(C)X 2065(library)X 2349(of)X 2456(BSD)X 2669(UNIX.)X 2983(Thus,)X 3226(these)X 3450(functions)X 3834(often)X 576 3324(need)N 784(to)X 885(be)X 1002(kept)X 1194(in)X 1295(memory)X 1642(even)X 1850(if)X 1935(the)X 2079(main)X 2298(program)X 2650(does)X 2853(not)X 3003(invoke)X 3292(them)X 3512(explicitly.)X 3952(In)X 576 3476(these)N 801(cases,)X 1055(it)X 1136(is)X 1227(desirable)X 1602(to)X 1703(use)X 1857(soft)X 2027(unlink)X 2299(so)X 2410(that)X 2581(the)X 2725(speci\256ed)X 3093(module)X 3408(is)X 3498(removed)X 3861(only)X 576 3628(when)N 808(it)X 886(is)X 974(no)X 1094(longer)X 1364(needed.)X 3 f 576 3932(Implementation)N 1256(of)X 1360(unlink)X 1 f 576 4112(The)N 761 0.2548(implementation)AX 1402(of)X 1517(the)X 1670(unlink)X 1951(functions)X 2344(is)X 2443(built)X 2655(around)X 2957(a)X 3036(simple)X 3329(garbage)X 3670(collector.)X 576 4264(For)N 740(each)X 948(module)X 2 f 1268(x)X 1 f 1311(,)X 1366(a)X 1440(reference)X 1830(count)X 2075(records)X 2389(the)X 2538(number)X 2863(of)X 2973(modules)X 3329(that)X 3504(reference)X 3893(any)X 576 4416(symbol)N 886(de\256ned)X 1196(in)X 2 f 1298(x)X 1 f 1341(.)X 1416(If)X 2 f 1507(x)X 1 f 1577(is)X 1668(explicitly)X 2060(linked)X 2328(in)X 2430(by)X 5 f 2551(dlink)X 1 f 2739(\(as)X 2878(opposed)X 3225(to)X 3327(implicit)X 3656(linking)X 3957(in)X 576 4568(the)N 724(case)X 919(for)X 1060(library)X 1346(modules\),)X 1757(it)X 1840(is)X 1933(considered)X 2379(being)X 2622(referenced)X 3058(by)X 3183(the)X 3330(process)X 3647(itself,)X 3893(and)X 576 4720(thus)N 762(its)X 879(reference)X 1264(count)X 1504(is)X 1594(at)X 1690(least)X 1893(one.)X 2106(A)X 2201(soft)X 2371(unlink)X 2643(of)X 2 f 2749(x)X 1 f 2818(causes)X 3095(its)X 3212(reference)X 3598(count)X 3839(to)X 3941(be)X 576 4872(decremented)N 1095(by)X 1217(one,)X 1406(while)X 1646(a)X 1715(hard)X 1912(unlink)X 2184(simply)X 2472(resets)X 2717(the)X 2861(count)X 3101(to)X 3202(zero.)X 3442(Furthermore,)X 3973(if)X 2 f 576 5024(x)N 1 f 619('s)X 721(reference)X 1113(count)X 1360(becomes)X 1730(zero,)X 1953(the)X 2104(reference)X 2496(counts)X 2780(of)X 2893(all)X 3023(modules)X 3382(that)X 2 f 3560(x)X 1 f 3636(references)X 576 5176(are)N 732(also)X 925(decremented)X 1456(by)X 1590(one.)X 1815(When)X 2083(all)X 2218(reference)X 2614(counts)X 2902(have)X 3121(been)X 3340(updated,)X 3706(modules)X 576 5328(whose)N 845(reference)X 1228(counts)X 1503(are)X 1645(zero)X 1835(are)X 1977(actually)X 2307(removed)X 2668(by)X 2788(the)X 2930(garbage)X 3259(collector.)X 776 5508(In)N 888(addition)X 1236(to)X 1343(the)X 1493(garbage)X 1830(collector,)X 2 f 2224(dld)X 1 f 2379(maintains)X 2786(data)X 2979(structures)X 3385(to)X 3492(hold)X 3695(informa-)X 576 5660(tion)N 758(necessary)X 1164(to)X 1271(support)X 1591(unlinking.)X 2040(Corresponding)X 2643(to)X 2750(each)X 2959(module)X 3280(is)X 3376(a)X 3451(list)X 3601(of)X 3712(symbols)X 576 5812(that)N 758(it)X 849(references,)X 1306(a)X 1386(list)X 1542(of)X 1660(symbols)X 2018(that)X 2201(it)X 2293(de\256nes,)X 2627(and)X 2804(a)X 2885(list)X 3041(of)X 3159(relocation)X 3583(instructions)X 14 p %%Page: 14 15 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(14)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(\(known)N 905(as)X 1021(an)X 2 f 1148(nlist)X 1 f 1350(in)X 1461(UNIX\).)X 1815(This)X 2021(information)X 2511(is)X 2610(needed)X 2918(to)X 3028(update)X 3320(the)X 3473(online)X 3749(symbol)X 576 1168(table)N 802(in)X 915(order)X 1156(to)X 1269(re\257ect)X 1548(the)X 1704(disappearance)X 2288(of)X 2406(the)X 2562(unlinked)X 2937(modules)X 3301(from)X 3526(the)X 3682(program.)X 576 1320(When)N 832(a)X 901(module)X 2 f 1216(y)X 1 f 1285(is)X 1375(to)X 1476(be)X 1593(removed)X 1956(from)X 2169(memory,)X 2540(its)X 2656(reference)X 3040(list)X 3183(is)X 3272(used)X 3473(to)X 3573(locate)X 3829(those)X 576 1472(modules)N 935(whose)X 1214(reference)X 1607(counts)X 1892(should)X 2182(be)X 2307(decremented.)X 2882(Symbols)X 3252(de\256ned)X 3569(by)X 2 f 3699(y)X 1 f 3776(should)X 576 1624(be)N 694(deleted)X 1000(from)X 1214(the)X 1359(symbol)X 1669(table.)X 1931(Other)X 2176(modules)X 2528(that)X 2699(reference)X 3084(any)X 3249(symbol)X 3558(de\256ned)X 3867(by)X 2 f 3989(y)X 1 f 576 1776(now)N 765(contain)X 1073(unde\256ned)X 1476(references.)X 1944(These)X 2198(modules)X 2549(should)X 2830(be)X 2946(``reversely'')X 3452(patched)X 3777(so)X 3887(that)X 576 1928(instructions)N 1058(pointing)X 1412(to)X 1520(locations)X 1901(previously)X 2340(in)X 2 f 2448(y)X 1 f 2491('s)X 2593(address)X 2914(space)X 3161(are)X 3312(reset.)X 3575(In)X 3687(short,)X 3935(all)X 2 f 576 2080(dld)N 1 f 699('s)X 795(data)X 983(structures)X 1384(have)X 1593(to)X 1695(be)X 1813(set)X 1947(to)X 2049(the)X 2194(state)X 2398(as)X 2505(if)X 2 f 2591(y)X 1 f 2661(had)X 2827(never)X 3069(been)X 3279(linked)X 3548(into)X 3726(the)X 3872(pro-)X 576 2232(gram.)N 776 2412(Finally,)N 1106(side-effects\320such)X 1855(as)X 1968(modi\256cation)X 2488(of)X 2601(global)X 2875(variables,)X 3281(input/output)X 3786(opera-)X 576 2564(tions,)N 812(and)X 976(allocations)X 1418(of)X 1522(new)X 1706(memory)X 2051(blocks\320caused)X 2684(by)X 2804(the)X 2946(execution)X 3345(of)X 3449(any)X 3612(function)X 3957(in)X 576 2716(a)N 648(module)X 966(are)X 1113(not)X 1265(reversed)X 1620(when)X 1857(the)X 2004(module)X 2322(is)X 2415(unlinked.)X 2829(If)X 2922(these)X 3150(side-effects)X 3624(need)X 3836(to)X 3941(be)X 576 2868(undone,)N 907(they)X 1097(must)X 1308(be)X 1423(undone)X 1730(explicitly)X 2119(by)X 2239(the)X 2381(programmers.)X 3 f 576 3172(Deciding)N 963(if)X 1046(a)X 1118(function)X 1483(is)X 1571(executable)X 1 f 576 3352(Since)N 2 f 818(dld)X 1 f 969(allows)X 1248(modules)X 1602(to)X 1705(be)X 1824(added)X 2082(to)X 2185(or)X 2293(removed)X 2658(from)X 2873(an)X 2992(executing)X 3395(process)X 3711(dynami-)X 576 3504(cally,)N 818(some)X 1051(global)X 1322(symbols)X 1672(may)X 1868(not)X 2020(be)X 2140(de\256ned.)X 2500(As)X 2635(a)X 2707(result,)X 2974(an)X 3094(invocation)X 3530(of)X 3639(a)X 3711(function)X 576 3656(might)N 836(reference)X 1230(an)X 1356(unde\256ned)X 1770(symbol.)X 2136(To)X 2278(solve)X 2517(this)X 2692(problem,)X 2 f 3073(dld)X 1 f 3232(provides)X 3599(a)X 3678(predicate)X 576 3808(function)N 5 f 931(function_executable_p)X 1 f 1720(,)X 1780(which,)X 2075(as)X 2191(shown)X 2477(earlier)X 2760(in)X 2871(\256gure)X 3131(2,)X 3239(takes)X 3473(as)X 3589(argument)X 3989(a)X 576 3960(function)N 921(name)X 1154(and)X 1317(returns)X 1608(non-zero)X 1974(only)X 2169(if)X 2252(the)X 2394(named)X 2675(function)X 3020(is)X 3108(executable.)X 776 4140(A)N 882(function)X 1240(is)X 2 f 1341(executable)X 1 f 1791(if)X 1887(and)X 2063(only)X 2271(if)X 2367(all)X 2501(its)X 2629(external)X 2977(references)X 3410(have)X 3630(been)X 3850(fully)X 576 4292(resolved)N 928(and)X 1093(all)X 1216(functions)X 1600(that)X 1771(it)X 1851(might)X 2102(call)X 2268(are)X 2412(executable.)X 2899(This)X 3095(recursive)X 3473(de\256nition)X 3867(sug-)X 576 4444(gests)N 799(that)X 975(determining)X 1472(whether)X 1813(a)X 1887(given)X 2132(function)X 2485(is)X 2581(executable)X 3026(is)X 3122(non-trivial.)X 3609(Since)X 3855(each)X 576 4596(function)N 925(might)X 1178(invoke)X 1468(other)X 1694(functions,)X 2104(the)X 2250(number)X 2572(of)X 2680(functions)X 3066(that)X 3239(can)X 3400(be)X 3518(reached)X 3845(from)X 576 4748(the)N 721(original)X 1048(invocation)X 1482(can)X 1643(be)X 1761(very)X 1959(large.)X 2227(If)X 2319(any)X 2486(of)X 2594(these)X 2820(functions)X 3206(is)X 3298(not)X 3449(executable,)X 3914(the)X 576 4900(original)N 916(invocation)X 1363(is)X 1467(also)X 1662(not)X 1825(executable.)X 2326(Consequently,)X 2919(determining)X 3425(if)X 3524(a)X 3607(function)X 3968(is)X 576 5052(executable)N 1032(could)X 1289(involve)X 1621(the)X 1782(examination)X 2302(of)X 2425(a)X 2511(large)X 2747(number)X 3084(of)X 3207(other)X 3449(functions.)X 3899(For)X 576 5204(example,)N 963(the)X 1117(executable)X 1565(\256le)X 1723(for)X 2 f 1870(gdb)X 1 f (,)S 2073(a)X 2151(popular)X 2480(UNIX)X 2754(debugger,)X 3171(contains)X 3527(174)X 3706(modules)X 576 5356(\(object)N 900(\256les\))X 1148(and)X 1343(635)X 1543(global)X 1840(functions.)X 2302(The)X 2508(ef\256ciency)X 2944(of)X 3080(the)X 3254(algorithm)X 10 s 3629 5316(\262)N 12 s 3725 5356(used)N 3957(to)X 10 s 10 f 576 5452(h)N 592(hhhhhhhhhhhhhh)X 1 f 656 5562(\262)N 736(An)X 858(optimal)X 1126(algorithm)X 1461(with)X 1627(respect)X 1879(to)X 1965(the)X 2087(order)X 2281(of)X 2372(complexity)X 2756(exists,)X 2982(but)X 3108(its)X 3207(detailed)X 3485(descrip-)X 576 5658(tion)N 728(is)X 808(beyond)X 1071(the)X 1196(scope)X 1406(of)X 1500(this)X 1642(paper.)X 1888(Furthermore,)X 2336(the)X 2461(current)X 2716(implementation)X 3245(employs)X 3543(a)X 3606(sub-)X 576 5754(optimal)N 842(but)X 966(much)X 1166(simpler)X 1428(solution.)X 1747(This)X 1911(solution)X 2190(has)X 2319(a)X 2377(very)X 2542(small)X 2737(overhead)X 3054(and)X 3192(thus)X 3347(works)X 3565(faster)X 576 5850(than)N 734(the)X 852(optimal)X 1116(solution)X 1393(as)X 1480(long)X 1642(as)X 1729(the)X 1847(number)X 2112(of)X 2199(modules)X 2490(is)X 2563(not)X 2685(too)X 2807(large.)X 15 p %%Page: 15 16 5(Helvetica-Narrow)xf 5 f 10 s 0 xH 0 xS 5 f 12 s 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(15)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(implement)N 5 f 1011(function_executable_p)X 1 f 1824(is)X 1912(thus)X 2096(of)X 2200(practical)X 2557(concern.)X 776 1196(Several)N 1093(methods)X 1447(can)X 1609(be)X 1728(used)X 1932(to)X 2035(speed)X 2282(up)X 2406(this)X 2573(algorithm.)X 3024(First,)X 3252(the)X 2 f 3398 0.2865(executability)AX 1 f 3920(for)X 576 1348(each)N 778(function)X 1124(could)X 1363(be)X 1479(actually)X 1810(calculated)X 2227(only)X 2423(once,)X 2654(and)X 2818(the)X 2960(results)X 3235(kept)X 3425(in)X 3524(a)X 3591(table.)X 3851(Sub-)X 576 1500(sequent)N 899(calls)X 1105(to)X 5 f 1207(function_executable_p)X 1 f 2025(would)X 2294(then)X 2489(involve)X 2807(only)X 3007(a)X 3080(table)X 3298(lookup.)X 3643(This)X 3844(table)X 576 1652(would)N 842(be)X 959(invalidated)X 1414(whenever)X 1814(a)X 1883(link)X 2059(or)X 2165(unlink)X 2436(operation)X 2825(is)X 2914(performed,)X 3364(and)X 3528(would)X 3793(not)X 3941(be)X 576 1804(updated)N 912(until)X 1120(the)X 1269(next)X 1466(call)X 1637(to)X 5 f 1741(function_executable_p)X 1 f 2530(.)X 2609(As)X 2746(a)X 2821(result,)X 3091(unnecessary)X 3593(recomputa-)X 576 1956(tion)N 779(of)X 912(the)X 1083(table)X 1324(between)X 1698(consecutive)X 2206(link)X 2409(or)X 2542(unlink)X 2841(operations)X 3294(could)X 3560(be)X 3703(avoided.)X 576 2108(Second,)N 912(when)X 1149(new)X 1338(modules)X 1693(are)X 1840(added)X 2099(or)X 2208(removed,)X 2598(minimal)X 2949(changes)X 3288(to)X 3392(the)X 3539(table)X 3756(of)X 3866(exe-)X 576 2260(cutable)N 893(functions)X 1288(should)X 1581(be)X 1709(made.)X 2003(There)X 2265(is)X 2366(no)X 2499(need)X 2718(to)X 2830(rewrite)X 3140(the)X 3295(whole)X 3567(table.)X 3840(Only)X 576 2412(those)N 812(functions)X 1203(affected)X 1547(by)X 1676(the)X 1827(changes)X 2170(should)X 2459(be)X 2583(examined.)X 3039(Lastly,)X 3338(although)X 3709(an)X 3834(algo-)X 576 2564(rithm)N 812(that)X 984(\256nds)X 1197(out)X 1347(the)X 1492 0.2552(executability)AX 2018(of)X 2125(a)X 2195(given)X 2436(function)X 2784(can)X 2945(be)X 3063(used)X 3266(repeatedly)X 3695(on)X 3818(every)X 576 2716(de\256ned)N 887(function,)X 1260(this)X 1427(method)X 1745(is)X 1838(in)X 1942(general)X 2255(very)X 2455(inef\256cient)X 2875(because)X 3209(a)X 3281(lot)X 3412(of)X 3521(the)X 3668(computa-)X 576 2868(tion)N 757(is)X 851(duplicated.)X 1331(Instead,)X 1663(a)X 1736(different)X 2098(algorithm)X 2503(that)X 2678(\256nishes)X 3001(all)X 3128(the)X 3276(computation)X 3788(in)X 3893(one)X 576 3020(single)N 830(pass)X 1019(could)X 1257(be)X 1372(used.)X 16 p %%Page: 16 17 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(16)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 1780 1016(APPLICATIONS)N 2485(OF)X 2631(DLD)X 576 1348(The)N 758(\257exibility)X 1165(provided)X 1539(by)X 2 f 1667(dld)X 1 f 1822(allows)X 2105(a)X 2180(new)X 2372(style)X 2586(in)X 2693(writing)X 3004(programs)X 3400(using)X 3641(compiled-)X 576 1500(based)N 829(programming)X 1387(languages)X 1806(and)X 1979(makes)X 2259(many)X 2507(new)X 2701(kinds)X 2943(of)X 3057(applications)X 3556(possible.)X 3952(In)X 576 1652(particular,)N 1009(dynamic)X 1380(linking)X 1692(combines)X 2100(the)X 2257(ef\256ciency)X 2676(of)X 2795(executing)X 3209(native)X 3484(machine)X 3850(code)X 576 1804(with)N 778(the)X 927(\257exibility)X 1333(of)X 1444(runtime)X 1774(program)X 2130(modi\256cation.)X 2 f 2695(Dld)X 1 f 2869(is)X 2963(especially)X 3379(useful)X 3644(for)X 3786(highly)X 576 1956(interactive)N 1011(programs)X 1401(whose)X 1674(functionalities)X 2254(change)X 2555(in)X 2658(response)X 3022(to)X 3125(their)X 3330(user's)X 3587(input.)X 3861(This)X 576 2108(section)N 873(describes)X 1255(several)X 1552(interesting)X 1983(applications)X 2473(of)X 2 f 2577(dld)X 1 f 2700(.)X 3 f 576 2412(Program)N 969(customization)X 1 f 576 2592(Many)N 829(sophisticated)X 1361(software)X 1722(packages)X 2105(usually)X 2413(allow)X 2657(some)X 2890(form)X 3107(of)X 3217(customization)X 3788(by)X 3914(the)X 576 2744(user.)N 826(Depending)X 1290(on)X 1428(their)X 1647(personal)X 2015(preference,)X 2488(users)X 2727(can)X 2903(specify)X 3223(how)X 3430(these)X 3669(programs)X 576 2896(should)N 863(interact)X 1184(with)X 1387(them.)X 1660(Usually)X 1991(these)X 2221(programs)X 2616(provide)X 2942(a)X 3017(group)X 3273(of)X 3385(different)X 3749(options)X 576 3048(from)N 791(which)X 1054(users)X 1279(can)X 1441(select)X 1689(those)X 1920(that)X 2092(suit)X 2258(their)X 2462(needs.)X 2756(For)X 2916(example,)X 3294(in)X 3396(the)X 3541(UNIX)X 3807(editor)X 2 f 576 3200(vi)N 1 f 10 s 646 3160(9)N 12 s 715 3200(a)N 787(user)X 976(can)X 1139(specify)X 1446(whether)X 1785(the)X 1933(input)X 2161(text)X 2336(should)X 2622(be)X 2743(wrapped)X 3104(around)X 3401 0.2812(automatically)AX 3957(to)X 576 3352(the)N 723(next)X 918(line)X 1092(when)X 1329(input)X 1556(gets)X 1740(past)X 1924(a)X 1995(certain)X 2286(column.)X 2651(As)X 2785(another)X 3102(example,)X 3481(some)X 3712(versions)X 576 3504(of)N 681(the)X 824(UNIX)X 1088(command)X 1493(interpreter)X 2 f 1920(csh)X 1 f 2073(provide)X 2392(an)X 2508(option)X 2779(to)X 2879(log)X 3027(out)X 3176(the)X 3320(user)X 3506 0.2812(automatically)AX 576 3656(when)N 808(it)X 886(has)X 1038(been)X 1244(idle)X 1413(for)X 1549(a)X 1616(user-speci\256ed)X 2174(number)X 2492(of)X 2596(minutes.)X 776 3836(This)N 979(method)X 1300(of)X 1413(providing)X 1820(program)X 2179(customization)X 2753(is)X 2850(limited)X 3157(in)X 3265(the)X 3416(sense)X 3657(that)X 3835(users)X 576 3988(can)N 735(only)X 930(choose)X 1221(their)X 1422(preference)X 1853(from)X 2064(a)X 2131(set)X 2262(of)X 2366(prede\256ned)X 2796(options.)X 3151(Whatever)X 3550(is)X 3638(not)X 3785(antici-)X 576 4140(pated)N 809(will)X 983(not)X 1130(be)X 1245(available.)X 1666(For)X 1823(example,)X 2198(it)X 2277(is)X 2366(not)X 2514(possible)X 2854(to)X 2954(customize)X 2 f 3370(vi)X 1 f 3465(so)X 3575(that)X 3745(when)X 3978(it)X 576 4292(breaks)N 861(up)X 991(a)X 1068(long)X 1273(line,)X 1476(it)X 1564(also)X 1753(right-justi\256es)X 2300(the)X 2452(current)X 2759(line)X 2938(to)X 3047(a)X 3124(speci\256c)X 3452(column.)X 3823(Like-)X 576 4444(wise,)N 802(it)X 882(is)X 972(not)X 1121(possible)X 1462(to)X 1563(tell)X 2 f 1713(csh)X 1 f 1867(to)X 1968 0.2812(automatically)AX 2520(log)X 2669(out)X 2818(at,)X 2938(say,)X 3117(5:30pm)X 3438(simply)X 3727(because)X 576 4596(the)N 732(need)X 952(for)X 1102(this)X 1279(functionality)X 1810(was)X 1997(not)X 2158(anticipated.)X 2668(One)X 2866(possible)X 3219(solution)X 3567(is)X 3668(to)X 3780(let)X 3914(the)X 576 4748(users)N 798(modify)X 1102(these)X 1326(programs)X 1715(according)X 2121(to)X 2222(their)X 2425(own)X 2616(preference)X 3049(and)X 3214(have)X 3422(separate)X 3764(private)X 576 4900(copies)N 853(for)X 996(each)X 1204(of)X 1315(them.)X 1586(Obviously,)X 2040(this)X 2209(method)X 2528(requires)X 2868(a)X 2941(lot)X 3073(of)X 3183(disk)X 3373(space)X 3617(and)X 3786(makes)X 576 5052(system)N 867(software)X 1222(very)X 1417(hard)X 1612(to)X 1711(maintain)X 2073(and)X 2236(upgrade.)X 2 f 776 5232(Dld)N 1 f 948(provides)X 1307(a)X 1378(better)X 1626(solution)X 1964(by)X 2088(allowing)X 2453(users)X 2678(to)X 2781(add)X 2949(or)X 3058(remove)X 3376(new)X 3565(functions)X 3952(or)X 576 5384(modify)N 884(the)X 1032(application)X 1491(programs)X 1883(to)X 1987(suit)X 2155(their)X 2361(own)X 2555(preference.)X 3039(The)X 3218(system)X 3514(then)X 3709(needs)X 3957(to)X 576 5536(keep)N 786(only)X 985(one)X 1152(copy)X 1367(of)X 1475(each)X 1680(program)X 2034(that)X 2207(is)X 2300(loaded)X 2586(with)X 2786(default)X 3083(options.)X 3443(If)X 3536(users)X 3762(are)X 3909(not)X 576 5688(satis\256ed)N 925(with)X 1130(any)X 1303(of)X 1417(the)X 1569(options)X 1886(provided,)X 2286(they)X 2485(can)X 2652(then)X 2851(link)X 3034(in)X 3142(their)X 3352(own)X 3550(routines)X 3893(and)X 576 5840(tell)N 729(the)X 876(program)X 1231(to)X 1335(use)X 1493(these)X 1721(user-de\256ned)X 2226(functions)X 2614(instead)X 2917(of)X 3027(the)X 3175(defaults.)X 3558(Referring)X 3957(to)X 17 p %%Page: 17 18 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(17)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(the)N 722(previous)X 2 f 1081(csh)X 1 f 1237(example,)X 1616(if)X 2 f 1702(dld)X 1 f 1852(is)X 1943(used,)X 2170(a)X 2240(user)X 2427(could)X 2668(perform)X 3005(the)X 3150(following)X 3551(steps)X 3770(to)X 3872(cus-)X 576 1168(tomize)N 863(the)X 1005(autologout)X 1441(feature:)X 10 f 976 1348(g)N 1 f 1176(Use)X 5 f 1347(unlink_by_symbol)X 1 f 1996(to)X 2095(unlink)X 2365(the)X 2507(function)X 2852(that)X 3021(handles)X 3339(autologout.)X 10 f 976 1528(g)N 1 f 1176(Modify)X 1512(the)X 1678(way)X 1887(the)X 2054(autologout)X 2515(function)X 2885(interprets)X 3298(its)X 3438(argument.)X 3899(For)X 1176 1680(example,)N 1553("17:30")X 1876(means)X 2148(logout)X 2420(at)X 2516(5:30pm)X 2836(while)X 3076("17")X 3276(means)X 3548(logout)X 3820(if)X 2 f 3904(csh)X 1 f 1176 1832(has)N 1339(been)X 1556(idle)X 1736(for)X 1883(17)X 2014(minutes.)X 2402(Also)X 2618(make)X 2862(necessary)X 3271(adjustments)X 3766(so)X 3887(that)X 1176 1984(the)N 1318(alarm)X 1562(clock)X 1795(is)X 1883(set)X 2014(correctly.)X 10 f 976 2164(g)N 1 f 1176(Compile)X 1532(this)X 1695(new)X 1879(autologout)X 2315(function.)X 10 f 976 2344(g)N 1 f 1176(Use)X 5 f 1347(dlink)X 1 f 1532(to)X 1631(link)X 1805(this)X 1968(function)X 2313(into)X 2 f 2487(csh)X 1 f (.)S 776 2524(Note)N 996(that)X 1174(this)X 1346(method)X 1669(requires)X 2013(users)X 2244(to)X 2353(have)X 2569(some)X 2806(knowledge)X 3262(on)X 3392(the)X 3544(implementa-)X 576 2676(tion)N 766(of)X 886(the)X 1044(application)X 1513(programs.)X 1964(Alternatively,)X 2537(the)X 2695(application)X 3163(programs)X 3565(can)X 3738(provide)X 576 2828(``hooks'')N 958(or)X 1063(some)X 1291(well-de\256ned,)X 1821(uniform)X 2156(interface)X 2519(to)X 2619(which)X 2880(the)X 3024(users)X 3247(can)X 3407(attach)X 3664(their)X 3867(own)X 576 2980(customized)N 1054(routines.)X 1451(Users)X 1708(should)X 2002(follow)X 2291(the)X 2447(speci\256ed)X 2827(convention)X 3293(when)X 3539(writing)X 3855(their)X 576 3132(own)N 771(functions)X 1159(and)X 1328(the)X 1476(application)X 1935(programs)X 2328(may)X 2524(provide)X 2848(a)X 2921(special)X 3219(routine)X 3522(to)X 3627(handle)X 3914(the)X 576 3284(loading)N 892(of)X 999(the)X 1144(user-de\256ned)X 1646(functions.)X 2079(This)X 2277(routine)X 2577(should)X 2860(hide)X 3053(from)X 3267(the)X 3412(users)X 3636(the)X 3780(details)X 576 3436(of)N 680(invoking)X 2 f 1046(dld)X 1 f 1193(and)X 1356(of)X 1460(setting)X 1741(up)X 1861(the)X 2003(function)X 2348(entry)X 2570(points.)X 3 f 576 3740(Incremental)N 1102(program)X 1489(development)X 1 f 576 3920(Since)N 2 f 823(dld)X 1 f 979(does)X 1188(not)X 1344(require)X 1650(all)X 1780(source)X 2064(modules)X 2423(to)X 2531(be)X 2655(available)X 3037(when)X 3278(creating)X 3623(an)X 3748(execut-)X 576 4072(able)N 776(\256le,)X 962(it)X 1055(makes)X 1340(incremental)X 1835(program)X 2200(development)X 2737(possible.)X 3138(Programmers)X 3694(can)X 3866(start)X 576 4224(testing)N 859(their)X 1062(programs)X 1451(before)X 1723(they)X 1915(\256nish)X 2154(writing)X 2458(the)X 2603(complete)X 2984(program)X 3337(without)X 3658(providing)X 576 4376(dummy)N 905(de\256nitions)X 1346(for)X 1493(the)X 1646(missing)X 1980(procedures.)X 2485(As)X 2626(long)X 2832(as)X 2947(the)X 3100(test)X 3269(input)X 3502(data)X 3698(does)X 3909(not)X 576 4528(cause)N 831(the)X 990(program)X 1357(to)X 1473(reference)X 1873(modules)X 2240(that)X 2426(have)X 2649(not)X 2813(yet)X 2972(been)X 3195(linked)X 3477(\(i.e.,)X 3692(does)X 3909(not)X 576 4680(invoke)N 884(a)X 972(function)X 5 f 1336(f)X 1 f 1403(such)X 1624(that)X 5 f 1812(function_executable_p\(f\))X 1 f 2720(returns)X 3032(zero\),)X 3299(the)X 3462(execution)X 3882(will)X 576 4832(proceed)N 931(smoothly.)X 1388(Programmers)X 1957(can)X 2142(therefore)X 2541(develop)X 2897(programs)X 3311 0.2604(incrementally)AX 3893(and)X 576 4984(carry)N 802(out)X 953(thorough)X 1328(tests)X 1527(on)X 1651(individual)X 2069(modules)X 2422(before)X 2695(working)X 3042(on)X 3165(the)X 3310(next)X 3503(one.)X 3717(Further-)X 576 5136(more,)N 839(when)X 1088(new)X 1289(modules)X 1656(are)X 1815(added)X 2086 0.2404(incrementally,)AX 2682(the)X 2842(dynamic)X 3216(linker)X 3483(needs)X 3744(only)X 3957(to)X 576 5288(resolve)N 892(external)X 1241(symbol)X 1561(references)X 1994(related)X 2294(to)X 2406(these)X 2641(new)X 2838(modules.)X 3249(In)X 3366(contrast,)X 3732(if)X 3828(static)X 576 5440(linking)N 874(is)X 963(used,)X 1188(link)X 1363(editing)X 1656(of)X 1761(the)X 1904(whole)X 2164(program)X 2515(has)X 2668(to)X 2768(be)X 2884(started)X 3167(anew.)X 3444(In)X 3550(other)X 3774(words,)X 576 5592(the)N 718(use)X 870(of)X 974(dynamic)X 1330(linking)X 1627(can)X 1785(in)X 1884(general)X 2192(speed)X 2435(up)X 2555(the)X 2697(program)X 3047(development)X 3569(cycle.)X 18 p %%Page: 18 19 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(18)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 776 1016(Some)N 1046(systems)X 10 s 1350 976(10,)N 1463(11)X 12 s 1594 1016(support)N 1933(incremental)X 2440(program)X 2817(development)X 3367(by)X 3515(providing)X 3941(an)X 576 1168(interactive)N 1021(interpreter)X 1460(for)X 1609(the)X 1764(underlying)X 2218(programming)X 2779(language.)X 3212(These)X 3478(systems)X 3818(allow)X 576 1320(programs)N 978(to)X 1092(be)X 1222(written,)X 1558(tested,)X 1846(and)X 2024(modi\256ed)X 2405 0.2404(interactively.)AX 2976(However,)X 3392(interpreted)X 3850(code)X 576 1472(usually)N 880(runs)X 1070(more)X 1293(slowly)X 1574(than)X 1765(native)X 2026(machine)X 2378(code.)X 2633(The)X 2808(performance)X 3320(of)X 3425(an)X 3541(interpreter)X 3968(is)X 576 1624(often)N 806(unacceptable)X 1342(when)X 1582(executing)X 1989(computationally)X 2649(intensive)X 3030(programs.)X 3474(With)X 3700(dynamic)X 576 1776(linking,)N 900(interpreted)X 1345(and)X 1511(\(possibly)X 1890(optimized\))X 2335(compiled)X 2721(code)X 2930(can)X 3091(be)X 3209(mixed)X 3477(together.)X 3867(Pro-)X 576 1928(grammers)N 987(might)X 1238(use)X 1392(compiled)X 1777(versions)X 2123(of)X 2229(the)X 2374(parts)X 2588(of)X 2695(the)X 2840(program)X 3193(that)X 3365(have)X 3574(been)X 3783(tested,)X 576 2080(while)N 824(at)X 928(the)X 1079(same)X 1310(time)X 1515(they)X 1714(can)X 1881(use)X 2042(interpreted)X 2493(versions)X 2846(of)X 2959(the)X 3110(modules)X 3469(on)X 3598(which)X 3866(they)X 576 2232(are)N 719(currently)X 1092(working.)X 1485(The)X 1660(compiled)X 2044(modules)X 2396(are)X 2540(dynamically)X 3043(linked)X 3310(into)X 3486(the)X 3630(interpreter)X 576 2384(of)N 684(these)X 910(systems.)X 1290(These)X 1548(systems)X 1880(also)X 2063(provide)X 2385(the)X 2531(necessary)X 2933(interface)X 3298(for)X 3437(the)X 3582(interactions)X 576 2536(between)N 921(the)X 1063(interpreted)X 1505(and)X 1668(compiled)X 2051(code.)X 776 2716(As)N 917(an)X 1043(example,)X 1429(suppose)X 1773(a)X 1851(graphical)X 2245(front)X 2467(end)X 2641(is)X 2741(to)X 2852(be)X 2979(added)X 3245(to)X 3356(an)X 3483(existing)X 3824(chess)X 576 2868(playing)N 897(program,)X 1279(which)X 1546(is)X 1642(computationally)X 2301(intensive.)X 2729(During)X 3032(its)X 3154(development,)X 3707(code)X 3920(for)X 576 3020(this)N 745(graphical)X 1134(front)X 1352(end)X 1522(is)X 1617(frequently)X 2044(modi\256ed,)X 2441(and)X 2611(so)X 2727(it)X 2812(is)X 2907(best)X 3093(run)X 3252(under)X 3502(an)X 3624(interactive)X 576 3172(interpreter.)N 1062(However,)X 1473(executing)X 1883(the)X 2036(chess)X 2279(playing)X 2603(routines)X 2948(under)X 3202(the)X 3355(interpreter)X 3792(would)X 576 3324(be)N 710(unreasonably)X 1266(slow.)X 1538(With)X 2 f 1774(dld)X 1 f 1897(,)X 1964(compiled)X 2366(code)X 2591(for)X 2746(the)X 2907(chess)X 3158(program)X 3527(itself)X 3763(can)X 3941(be)X 576 3476(dynamically)N 1089(linked)X 1366(into)X 1552(the)X 1706(interpreter,)X 2168(and)X 2343(can)X 2513(be)X 2640(executed)X 3019(at)X 3125(the)X 3279(same)X 3513(speed)X 3768(as)X 3884(if)X 3978(it)X 576 3628(were)N 799(statically)X 1184(linked.)X 1509(Thus,)X 2 f 1761(dld)X 1 f 1921(combines)X 2327(the)X 2482(ability)X 2766(of)X 2883(an)X 3011(interpreter)X 3450(to)X 3562(\257exibly)X 3893(and)X 576 3780(completely)N 1034(control)X 1336(the)X 1483(execution)X 1887(of)X 1996(the)X 2143(still)X 2317(developing)X 2774(routines)X 3113(with)X 3312(the)X 3458(high)X 3657(execution)X 576 3932(ef\256ciency)N 980(achieved)X 1347(by)X 1467(the)X 1609(optimized)X 2019(machine)X 2370(code.)X 3 f 576 4236(Support)N 935(for)X 1082(debugging)X 1532(and)X 1710(testing)X 1 f 576 4416(A)N 686(dynamic)X 1059(linker)X 1325(also)X 1521(makes)X 1808(possible)X 2164(the)X 2323 0.2548(implementation)AX 2971(of)X 3093(many)X 3349(useful)X 3626(debugging)X 576 4568(features.)N 956(A)X 1052(debugger)X 1437(can)X 1597(be)X 1714(used)X 1916(as)X 2022(an)X 2139(interactive)X 2573(interface)X 2937(to)X 3038(control)X 3337(the)X 3481(reconstruction)X 576 4720(of)N 685(the)X 832(user)X 1021(program)X 1376(and)X 1544(the)X 1691(execution)X 2095(of)X 2205(the)X 2 f 2353(inferior)X 1 f 2677(process,)X 3019(i.e.,)X 3191(the)X 3339(process)X 3657(executing)X 576 4872(the)N 720(program)X 1072(being)X 1312(debugged.)X 1760(For)X 1919(example,)X 2296(a)X 2365(programmer)X 2866(can)X 3025(use)X 3178(a)X 3246(debugger)X 3629(to)X 3729(stop)X 3914(the)X 576 5024(inferior)N 893(process)X 1209(and)X 1376(invoke)X 2 f 1666(dld)X 1 f 1817(to)X 1920(remove)X 2237(the)X 2384(erroneous)X 2792(routines,)X 3155(correct)X 3452(them,)X 3698(and)X 3866(then)X 576 5176(link)N 761(them)X 988(in)X 1097(again.)X 1388(New)X 1603(debugging)X 2043(routines)X 2387(can)X 2555(be)X 2680(linked)X 2955(into)X 3139(the)X 3291(inferior)X 3614(process)X 3936(on)X 576 5328(demand.)N 955(This)X 1152(feature)X 1446(is)X 1536(particularly)X 2007(useful)X 2268(when)X 2502(the)X 2647(need)X 2856(for)X 2995(such)X 3198(debugging)X 3631(routines)X 3968(is)X 576 5480(not)N 733(realized)X 1073(until)X 1284(the)X 1436(program)X 1796(has)X 1958(been)X 2174(executing)X 2583(for)X 2729(a)X 2806(long)X 3011(time)X 3216(and)X 3388(\256nally)X 3667(arrives)X 3962(at)X 576 5632(some)N 803(state)X 1004(of)X 1108(critical)X 1401(importance)X 1859(for)X 1995(debugging.)X 19 p %%Page: 19 20 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(19)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 776 1016(Just)N 962(as)X 1079(incremental)X 1572(program)X 1936(testing)X 2231(is)X 2333(made)X 2580(possible,)X 2 f 2957(dld)X 1 f 3118(allows)X 3407(un\256nished)X 3845(frag-)X 576 1168(ments)N 840(of)X 954(a)X 1030(program)X 1389(to)X 1497(be)X 1621(debugged.)X 2076(For)X 2242(example,)X 2626(a)X 2702(programmer)X 3211(might)X 3469(want)X 3689(to)X 3797(debug)X 576 1320(and)N 740(test)X 899(the)X 1042(symbol)X 1351(table)X 1565(routines)X 1901(of)X 2007(a)X 2076(compiler)X 2445(before)X 2717(moving)X 3037(on)X 3159(to)X 3260(\256nish)X 3499(the)X 3643(rest)X 3808(of)X 3914(the)X 576 1472(program.)N 983(S/he)X 1187(might)X 1445(set)X 1585(up)X 1714(a)X 1790(debugger)X 2181(for)X 2326(the)X 2476(program)X 2834(shown)X 3116(in)X 3223(\256gure)X 3479(2,)X 3583(and)X 3754(specify)X 576 1624(that)N 759(these)X 996(functions)X 1393(are)X 1550(to)X 1664(be)X 1794(linked)X 2074(in)X 2188(and)X 2366(invoked.)X 2763(The)X 2952(programmer)X 3467(could)X 3720(then)X 3925(set)X 576 1776(breakpoints,)N 1081(examine)X 1440(or)X 1551(modify)X 1860(program)X 2217(variables,)X 2620(or)X 2731(single)X 2992(step)X 3178(through)X 3508(the)X 3657(execution)X 576 1928(of)N 680(statements)X 1111(in)X 1210(these)X 1432(functions)X 1814(in)X 1913(the)X 2055(same)X 2278(way)X 2463(as)X 2568(debugging)X 2999(a)X 3067(complete)X 3446(program.)X 3845(Note)X 576 2080(that)N 750(information)X 1234(such)X 1439(as)X 1548(line)X 1722(numbers)X 2081(or)X 2189(variable)X 2528(names)X 2802(of)X 2910(these)X 3136(functions)X 3522(would)X 3790(not)X 3941(be)X 576 2232(known)N 883(by)X 1025(the)X 1189(debugger,)X 1617(and)X 1803(must)X 2037(be)X 2175(loaded)X 2479(explicitly)X 2891(if)X 2997(source-level)X 3515(debugging)X 3968(is)X 576 2384(desired.)N 931(Incremental)X 1421(loading)X 1739(of)X 1847(symbol)X 2158(table)X 2374(information)X 2857(is)X 2949(supported)X 3356(by)X 3480(some)X 3711(state-of-)X 576 2536(the-art)N 852(debuggers,)X 1295(such)X 1495(as)X 1599(Dalek)X 10 s 1829 2496(12)N 12 s 1933 2536(and)N 2 f 2096(gdb)X 1 f 10 s 2496(13)Y 12 s 2536(.)Y 776 2716(Another)N 1119(important)X 1522(debugging)X 1956(application)X 2414(for)X 2 f 2555(dld)X 1 f 2707(is)X 2800(to)X 2904(help)X 3099(speed)X 3347(up)X 3472(the)X 3619(interaction)X 576 2868(between)N 953(the)X 1127(debugger)X 1541(and)X 1736(the)X 1910(inferior)X 2255(process.)X 2647(Under)X 2943(most)X 3186(operating)X 3606(systems,)X 3989(a)X 576 3020(debugger)N 958(can)X 1116(only)X 1311(control)X 1609(the)X 1752(execution)X 2152(or)X 2257(modify)X 2560(the)X 2703(memory)X 3049(image)X 3310(of)X 3415(the)X 3558(inferior)X 3872(pro-)X 576 3172(cess)N 780(through)X 1123(a)X 1210(protected)X 1613(system)X 1924(call,)X 2132(e.g.,)X 5 f 2337(ptrace)X 1 f 2599(in)X 2717(UNIX.)X 3047(This)X 3261(system)X 3571(call)X 3754(usually)X 576 3324(involves)N 933(a)X 1007(considerable)X 1525(amount)X 1845(of)X 1956(overhead.)X 2389(For)X 2554(example,)X 2937(each)X 3146(call)X 3318(to)X 5 f 3423(ptrace)X 1 f 3674(results)X 3957(in)X 576 3476(two)N 756(context)X 1076(switches)X 1443(between)X 1800(the)X 1954(debugger)X 2348(and)X 2522(the)X 2675(inferior)X 2999(processes.)X 3450(However,)X 3861(with)X 576 3628(the)N 727(help)X 926(of)X 1039(dynamic)X 1404(linking,)X 1734(a)X 1810(debugger)X 2201(can)X 2368(inject)X 2616(the)X 2767(most)X 2987(frequently)X 3416(used)X 3626(debugging)X 576 3780(functions)N 982(into)X 1180(the)X 1345(inferior)X 1681(process's)X 2085(address)X 2420(space,)X 2705(insert)X 2966(calls)X 3190(to)X 3312(these)X 3557(functions)X 3962(at)X 576 3932(appropriate)N 1040(locations)X 1413(in)X 1513(the)X 1656(inferior's)X 2039(code,)X 2270(and)X 2434(then)X 2625(allow)X 2864(the)X 3007(inferior)X 3322(process)X 3636(to)X 3737(execute)X 576 4084(without)N 896(any)X 1061(intervention)X 1553(from)X 1765(the)X 1908(debugger.)X 2339(Control)X 2658(is)X 2747(passed)X 3028(back)X 3235(to)X 3335(the)X 3478(debugger)X 3861(only)X 576 4236(when)N 808(necessary.)X 776 4416(For)N 938(example,)X 1318(consider)X 1673(a)X 1745(conditional)X 2209(breakpoint)X 2651(that)X 2826(is)X 2920(put)X 3073(into)X 3253(the)X 3401(inferior)X 3720(process.)X 576 4568(That)N 790(is,)X 915(the)X 1070(inferior)X 1396(process)X 1721(is)X 1822(allowed)X 2164(to)X 2276(execute)X 2608(and)X 2784(the)X 2939(breakpoint)X 3387(is)X 3487(effective)X 3861(only)X 576 4720(when)N 815(some)X 1049(speci\256ed)X 1422(condition)X 1817(is)X 1912(satis\256ed.)X 2306(Evaluation)X 2755(of)X 2866(the)X 3015(condition)X 3411(might)X 3668(involve)X 3989(a)X 576 4872(large)N 795(amount)X 1110(of)X 1216(data,)X 1426(e.g.,)X 1614(checking)X 1987(if)X 2071(an)X 2187(array)X 2410(is)X 2499(sorted.)X 2807(Also,)X 3037(the)X 3180(inferior)X 3494(process)X 3807(might)X 576 5024(hit)N 727(the)X 894(breakpoint)X 1355(many)X 1618(times)X 1876(before)X 2172(the)X 2340(given)X 2604(condition)X 3018(becomes)X 3405(true.)X 3653(If)X 3767(all)X 3914(the)X 576 5176(required)N 928(information)X 1414(is)X 1509(transferred)X 1957(via)X 2105(a)X 2178(system)X 2475(call)X 2645(to)X 2750(the)X 2898(debugger)X 3286(everytime)X 3702(the)X 3850(infe-)X 576 5328(rior)N 745(process)X 1063(hits)X 1232(the)X 1380(breakpoint,)X 1846(the)X 1994(overhead)X 2377(involved)X 2744(would)X 3014(be)X 3135(very)X 3337(high.)X 3587(With)X 2 f 3811(dld)X 1 f 3934(,)X 3989(a)X 576 5480(conditional)N 1047(breakpoint)X 1496(can)X 1667(be)X 1795(implemented)X 2335(by)X 2467(inserting)X 2840(code)X 3058(for)X 3206(the)X 3360(evaluation)X 3798(of)X 3914(the)X 576 5632(condition)N 977(into)X 1164(the)X 1319(inferior)X 1645(process.)X 2018(Only)X 2247(when)X 2492(the)X 2647(speci\256ed)X 3026(condition)X 3427(is)X 3529(satis\256ed)X 3882(will)X 576 5784(control)N 879(be)X 1000(passed)X 1285(back)X 1496(to)X 1600(the)X 1747(debugger.)X 2182(This)X 2382(scheme)X 2700(can)X 2863(be)X 2983(achieved)X 3355(as)X 3464(follows:)X 3832(First,)X 20 p %%Page: 20 21 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(20)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(the)N 722(debugging)X 1156(code)X 1366(is)X 1458(linked)X 1727(into)X 1905(the)X 2051(inferior)X 2368(process's)X 2754(address)X 3071(space.)X 3362(Second,)X 3698(a)X 3770(branch)X 576 1168(instruction)N 1013(is)X 1102(overwritten)X 1571(into)X 1746(the)X 1889(location)X 2225(of)X 2330(the)X 2473(breakpoint)X 2910(so)X 3020(that)X 3190(the)X 3332(debugging)X 3762(code)X 3968(is)X 576 1320(executed)N 955(instead.)X 1312(Lastly,)X 1613(the)X 1767(machine)X 2130(instructions)X 2615(that)X 2797(were)X 3021(originally)X 3433(in)X 3545(this)X 3721(location)X 576 1472(are)N 728(moved)X 1024(to)X 1133(the)X 1285(end)X 1458(of)X 1572(the)X 1724(debugging)X 2164(code.)X 2428(By)X 2574(cleverly)X 2919(rearranging)X 3397(and)X 3570(relocating)X 3989(a)X 576 1624(few)N 757(machine)X 1121(instructions,)X 1631(the)X 1786(insertion)X 2161(of)X 2279(the)X 2435(branch)X 2735(to)X 2848(and)X 3025(from)X 3250(the)X 3406(debugging)X 3850(code)X 576 1776(becomes)N 940(transparent)X 1395(to)X 1496(the)X 1640(original)X 1966(execution.)X 2415(Since)X 2655(many)X 2895(unnecessary)X 3391(context)X 3701(switches)X 576 1928(and)N 742(data)X 930(transfers)X 1288(between)X 1636(the)X 1781(debugger)X 2166(and)X 2332(the)X 2477(inferior)X 2793(are)X 2938(eliminated,)X 3398(the)X 3544(ef\256ciency)X 3952(of)X 576 2080(interactive)N 1008(debugging)X 1438(is)X 1526(greatly)X 1818(improved.)X 776 2260(An)N 917(alternative)X 1349(way)X 1534(dynamic)X 1891(linking)X 2189(can)X 2348(be)X 2464(used)X 2665(to)X 2765(speed)X 3009(up)X 3130(the)X 3273(interaction)X 3711(between)X 576 2412(the)N 735(debugger)X 1134(and)X 1314(the)X 1473(inferior)X 1803(process)X 2132(involves)X 2499(the)X 2658(use)X 2827(of)X 2948(shared)X 3240(memory)X 10 s 3561 2372(14)N 12 s 2412(.)Y 3730(A)X 3839(large)X 576 2564(block)N 819(of)X 928(memory)X 1278(is)X 1371(allocated)X 1749(and)X 1917(shared)X 2197(between)X 2548(the)X 2696(debugger)X 3084(and)X 3253(the)X 3401(inferior)X 3720(process.)X 576 2716(Then)N 817(the)X 978(program)X 1347(to)X 1465(be)X 1599(debugged)X 2016(is)X 2123(dynamically)X 2643(linked)X 2927(and)X 3109(loaded)X 3408(into)X 3600(this)X 3781(shared)X 576 2868(memory.)N 970(Control)X 1289(of)X 1394(the)X 1537(inferior)X 1851(process)X 2164(is)X 2253(then)X 2444(passed)X 2726(to)X 2827(the)X 2971(main)X 3190(procedure)X 3601(of)X 3707(this)X 3872(pro-)X 576 3020(gram.)N 855(As)X 994(a)X 1070(result,)X 1341(any)X 1513(update)X 1803(of)X 1916(data)X 2110(made)X 2352(by)X 2481(this)X 2653(program)X 3011(is)X 3107(readily)X 3407(observed)X 3786(by)X 3914(the)X 576 3172(debugger)N 980(without)X 1320(any)X 1505(system)X 1819(call.)X 2054(Also,)X 2306(instructions)X 2802(of)X 2929(this)X 3115(program)X 3488(can)X 3669(easily)X 3941(be)X 576 3324(modi\256ed)N 943(because)X 1273(they)X 1464(are)X 1607(loaded)X 1889(in)X 1989(the)X 2132(shared)X 2408(memory,)X 2778(to)X 2877(which)X 3136(the)X 3278(debugger)X 3660(has)X 3812(direct)X 576 3476(write)N 798(access.)X 21 p %%Page: 21 22 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(21)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 2022 1016(DISCUSSION)N 576 1348(The)N 765(ability)X 1051(to)X 1165(dynamically)X 1681(link)X 1870(and)X 2048(unlink)X 2333(object)X 2608(modules)X 2973(from)X 3199(an)X 3329(executing)X 3744(process)X 576 1500(provides)N 935(much)X 1177(\257exibility)X 1579(in)X 1681(the)X 1826(construction)X 2329(of)X 2436(a)X 2506(program.)X 2907(This)X 3105(ability)X 3379(allows)X 3657(the)X 3802(build-)X 576 1652(ing)N 737(blocks)X 1026(of)X 1144(a)X 1225(program)X 1589(to)X 1702(change)X 2014(or)X 2133(evolve)X 2429(with)X 2639(time:)X 2901(it)X 2994(turns)X 3225(a)X 3307(``program'')X 3800(into)X 3989(a)X 576 1804(dynamic)N 937(entity.)X 1234(The)X 1413(functionalities)X 1994(of)X 2103(such)X 2308(a)X 2380(program)X 2735(can)X 2898(be)X 3018(changed)X 3368(in)X 3472(response)X 3837(to)X 3941(its)X 576 1956(interactions)N 1070(with)X 1285(the)X 1447(environment.)X 2026(As)X 2176(a)X 2263(result,)X 2545(dynamic)X 2921(link)X 3115(editing)X 3427(makes)X 3717(possible)X 576 2108(many)N 814(new)X 998(kinds)X 1230(of)X 1334(applications)X 1824(that)X 1993(would)X 2257(otherwise)X 2655(be)X 2770(very)X 2965(hard)X 3160(to)X 3259(implement.)X 776 2288(Systems)N 1130(with)X 1335(similar)X 1637(capabilities)X 2111(have)X 2327(been)X 2543(introduced)X 2989(before.)X 3318(For)X 3486(example,)X 3872(pro-)X 576 2440(grams)N 836(written)X 1134(in)X 1234(languages)X 1644(such)X 1845(as)X 1950(LISP)X 2172(or)X 2277(Prolog)X 2558(can)X 2717(load)X 2908(in)X 3008(and)X 3171(execute)X 3490(new)X 3674(functions)X 576 2592(at)N 670(any)X 833(time)X 1029(during)X 1304(their)X 1506(execution.)X 1954(However,)X 2355(with)X 2551(only)X 2747(static)X 2976(linking,)X 3298(these)X 3521(systems)X 3850(have)X 576 2744(to)N 691(be)X 822(built)X 1039(on)X 1175(top)X 1338(of)X 1458(an)X 1588(interpreter)X 2029(or)X 2148(a)X 2230(simulated)X 2644(machine,)X 3034(which)X 3308(always)X 3614(runs)X 3818(many)X 576 2896(times)N 812(slower)X 1096(than)X 1290(real)X 1463(machines.)X 1903(Dynamic)X 2284(link)X 2462(editing,)X 2782(on)X 2906(the)X 3052(other)X 3278(hand,)X 3517(combines)X 3914(the)X 576 3048(high)N 806(execution)X 1240(speed)X 1518(of)X 1657(native)X 1952(machine)X 2338(code)X 2579(with)X 2808(the)X 2984(\257exibility)X 3417(of)X 3555(dynamically)X 576 3200(modi\256able)N 1012(programs.)X 776 3380(As)N 922(a)X 1005(positive)X 1350(side)X 1545(effect,)X 2 f 1829(dld)X 1 f 1992(helps)X 2235(speed)X 2494(up)X 2630(the)X 2788(program)X 3154(development)X 3692(cycle)X 3936(by)X 576 3532(allowing)N 963(incremental)X 1469(program)X 1845(construction)X 2371(and)X 2560(online)X 2851(maintenance.)X 3437(As)X 3592(the)X 3759(sample)X 576 3684(applications)N 1073(illustrate,)X 1466(when)X 1705(new)X 1896(modules)X 2253(are)X 2402(added)X 2663(to)X 2769(a)X 2843(program,)X 3225(only)X 3428(part)X 3610(of)X 3722(the)X 3872(pro-)X 576 3836(gram)N 808(needs)X 1061(to)X 1170(be)X 1295(modi\256ed\320the)X 1884(rest)X 2056(of)X 2169(the)X 2320(program)X 2679(need)X 2894(not)X 3050(be)X 3174(relinked.)X 3571(Incremental)X 576 3988(linking)N 878(can)X 1041(save)X 1241(a)X 1313(considerable)X 1830(amount)X 2149(of)X 2259(time,)X 2485(especially)X 2901(for)X 3043(large)X 3266(programs)X 3659(that)X 3834(often)X 576 4140(take)N 776(many)X 1029(minutes)X 1373(to)X 1487(link.)X 1724(Furthermore,)X 2268(the)X 2425(size)X 2614(of)X 2733(the)X 2890(executable)X 3341(\256les)X 3539(and)X 3716(the)X 3872(disk)X 576 4292(storage)N 880(requirements)X 1409(can)X 1569(be)X 1686(reduced)X 2017(because)X 2348(the)X 2492(system)X 2785(can)X 2945(now)X 3136(keep)X 3344(only)X 3541(one)X 3706(copy)X 3920(for)X 576 4444(the)N 720(commonly)X 1158(used)X 1360(library)X 1643(routines)X 1979(and)X 2144(have)X 2352(them)X 2571(dynamically)X 3073(linked)X 3339(into)X 3514(the)X 3657(executing)X 576 4596(process)N 888(on)X 1008(demand.)X 776 4776(Another)N 1126(potential)X 1499(optimization)X 2022(of)X 2137(storage)X 2450(requirement)X 2951(is)X 3050(to)X 3160(allow)X 3409(commonly)X 3856(used)X 576 4928(library)N 896(routines)X 1269(to)X 1407(be)X 1561(shared)X 1875(among)X 2200(multiple)X 2584(processes.)X 3062(Many)X 3348(new)X 3570(versions)X 3952(of)X 576 5080(UNIX)N 10 s 815 5040(2,)N 888(3,)X 961(4,)X 1034(6)X 12 s 1100 5080(already)N 1410(support)X 1724(shared)X 2002(library.)X 2334(Although)X 2724(the)X 2869(current)X 3169 0.2548(implementation)AX 3802(of)X 2 f 3909(dld)X 1 f 576 5232(allocates)N 949(storage)X 1262(for)X 1409(the)X 1562(dynamically)X 2073(linked)X 2348(library)X 2639(modules)X 2999(in)X 3108(the)X 3260(private)X 3562(data)X 3757(area)X 3952(of)X 576 5384(individual)N 993(process,)X 1331(a)X 1400(simple)X 1683(modi\256cation)X 2197(would)X 2464(allow)X 2705(the)X 2850(process)X 3165(to)X 3267(use)X 3422(the)X 3567(shared)X 3845(copy)X 576 5536(instead.)N 776 5716(The)N 958(price)X 1183(for)X 1328(the)X 1479(\257exibility)X 1887(provided)X 2262(by)X 2 f 2391(dld)X 1 f 2547(is)X 2644(perhaps)X 2976(the)X 3127(overhead)X 3513(in)X 3621(processing)X 576 5868(time)N 776(for)X 916(the)X 1062(link)X 1240(editing)X 1536(and)X 1702(the)X 1847(extra)X 2067(memory)X 2415(required)X 2763(for)X 2902(holding)X 3223(the)X 3368(symbol)X 3678(table)X 3893(and)X 22 p %%Page: 22 23 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(22)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(other)N 808(bookkeeping)X 1339(information.)X 1876(In)X 1990(practice,)X 2354(the)X 2506(time)X 2712(spent)X 2949(in)X 3058(performing)X 3525(both)X 3730(the)X 3882(link)X 576 1168(and)N 746(the)X 895(unlink)X 1172(operations)X 1604(is)X 1699(very)X 1901(small)X 2141(when)X 2380(compared)X 2791(with)X 2993(that)X 3169(spent)X 3403(in)X 3509(executing)X 3914(the)X 576 1320(program)N 932(itself.)X 1203(Once)X 1436(the)X 1584(linking)X 1887(is)X 1981(\256nished,)X 2339(the)X 2487(program)X 2843(can)X 3008(execute)X 3334(at)X 3435(the)X 3584(same)X 3813(speed)X 576 1472(as)N 688(if)X 779(it)X 864(were)X 1082(statically)X 1462(linked.)X 1782(Although)X 2176(a)X 2250(dynamically)X 2758(linked)X 3030(function)X 3382(must)X 3600(be)X 3722(invoked)X 576 1624(indirectly)N 985(through)X 1323(a)X 1405(pointer)X 1717(\(as)X 1868(shown)X 2157(in)X 2271(\256gure)X 2535(2\),)X 2679(this)X 2858(indirection)X 3316(involves)X 3682(only)X 3893(one)X 576 1776(extra)N 795(pointer)X 1094(reference.)X 1527(That)X 1730(extra)X 1948(cost)X 2128(is)X 2217(negligible)X 2628(compared)X 3033(with)X 3229(the)X 3372(cost)X 3552(of)X 3657(executing)X 576 1928(typically)N 939(hundreds)X 1316(of)X 1421(machine)X 1773(instructions)X 2247(in)X 2347(the)X 2490(body)X 2707(of)X 2812(a)X 2881(function.)X 3276(In)X 3382(addition,)X 3748(prelim-)X 576 2080(inary)N 799(studies)X 1091(show)X 1318(that)X 1488(the)X 1631(vast)X 1811(majority)X 2163(of)X 2268(the)X 2411(time)X 2608(spent)X 2835(in)X 5 f 2932(dlink)X 1 f 3117(is)X 3205(for)X 3341(reading)X 3654(the)X 3796(object)X 576 2232(\256les)N 772(or)X 888(libraries)X 1240(from)X 1463(disk.)X 1707(In)X 1823(other)X 2057(words,)X 2351(the)X 2505(overhead)X 2894(in)X 3006(resolving)X 3401(external)X 3749(symbol)X 576 2384(references)N 996(and)X 1159(maintaining)X 1644(the)X 1786(symbol)X 2093(table)X 2305(is)X 2393(insigni\256cant.)X 776 2564(The)N 950(current)X 1247 0.2548(implementation)AX 1877(of)X 5 f 1979(function_executable_p)X 1 f 2793(is)X 2882(not)X 3030(complete)X 3409(according)X 3814(to)X 3914(the)X 576 2716(given)N 832(de\256nition)X 1243(of)X 1365 0.2356(executability.)AX 1953(External)X 2321(references)X 2758(through)X 3098(pointers)X 3449(are)X 3608(not)X 3772(traced.)X 576 2868(That)N 789(is,)X 913(this)X 1089(function)X 1447(will)X 1634(still)X 1816(return)X 2083(non-zero)X 2462(if)X 2558(the)X 2713(named)X 3007(function)X 3365(uses)X 3567(a)X 3647(pointer)X 3957(to)X 576 3020(indirectly)N 993(call)X 1180(another)X 1516(function)X 1883(that)X 2074(has)X 2248(already)X 2578(been)X 2806(unlinked.)X 3237(Furthermore,)X 3788(if)X 3893(one)X 576 3172(external)N 913(reference)X 1298(of)X 1404(an)X 1521(object)X 1783(module)X 2098(is)X 2188(unresolved,)X 2660(all)X 2783(functions)X 3167(de\256ned)X 3476(in)X 3577(this)X 3743(module)X 576 3324(are)N 723(considered)X 1169(unexecutable.)X 1755(This)X 1955(approximation)X 2546(results)X 2826(in)X 2930(a)X 3001(very)X 3200(ef\256cient)X 3544(implementa-)X 576 3476(tion,)N 774(albeit)X 1013(conservative.)X 776 3656(Like)N 979(many)X 1219(other)X 1443(powerful)X 1816(tools,)X 2053(there)X 2272(is)X 2362(always)X 2655(a)X 2724(danger)X 3012(that)X 2 f 3184(dld)X 1 f 3334(could)X 3575(be)X 3693(misused.)X 576 3808(Similar)N 910(to)X 1035(its)X 1176(static)X 1430(counterpart,)X 1943(a)X 2036(dynamic)X 2418(linker)X 2692(simply)X 3003(combines)X 3421(object)X 3706(modules)X 576 3960(together)N 924(and)X 1096(does)X 1305(not)X 1461(provide)X 1788(any)X 1960(extra)X 2186(protection)X 2610(on)X 2739(the)X 2890(existing)X 3228(code)X 3443(against)X 3749(corrup-)X 576 4112(tion.)N 801(For)X 961(example,)X 2 f 1339(dld)X 1 f 1489(does)X 1692(not)X 1842(check)X 2094(if)X 2180(a)X 2250(function)X 2598(to)X 2700(be)X 2818(unlinked)X 3182(is)X 3273(still)X 3445(active)X 3703(\(i.e.,)X 3904(has)X 576 4264(a)N 649(corresponding)X 1229(activation)X 1640(record)X 1917(on)X 2044(the)X 2193(stack\).)X 2502(If)X 2597(such)X 2804(a)X 2878(function)X 3230(is)X 3325(unlinked,)X 3717(the)X 3866(exe-)X 576 4416(cuting)N 848(process)X 1167(might)X 1423(crash)X 1657(when)X 1896(control)X 2200(is)X 2295(passed)X 2582(back)X 2795(to)X 2900(it)X 2984(because)X 3319(the)X 3467(memory)X 3818(origi-)X 576 4568(nally)N 806(holding)X 1137(the)X 1292(code)X 1511(for)X 1660(the)X 1815(function)X 2173(might)X 2435(have)X 2654(been)X 2873(garbage)X 3216(collected)X 3603(and)X 3780(reallo-)X 576 4720(cated.)N 862(Also,)X 1101(a)X 1178(function)X 1533(that)X 1712(was)X 1895(executable)X 2342(at)X 2446(one)X 2619(point)X 2851(in)X 2960(time)X 3166(might)X 3425(not)X 3582(be)X 3706(so)X 3824(when)X 576 4872(other)N 804(routines)X 1144(are)X 1293(removed.)X 1709(Therefore,)X 2144(the)X 2 f 2293 0.2865(executability)AX 1 f 2818(of)X 2929(a)X 3003(function)X 3355(should)X 3642(in)X 3748(general)X 576 5024(be)N 719(veri\256ed)X 1065(everytime)X 1503(before)X 1801(it)X 1907(is)X 2023(called,)X 2329(or)X 2460(everytime)X 2897(after)X 3125(modules)X 3502(are)X 3671(added)X 3952(or)X 576 5176(removed.)N 776 5356(Another)N 1115(potential)X 1477(hazard)X 1758(occurs)X 2033(when)X 2266(a)X 2334(dynamically)X 2836(linked)X 3102(routine)X 3400(is)X 3489(erroneous)X 3893(and)X 576 5508(its)N 693(invocation)X 1126(could)X 1366(crash)X 1595(the)X 1738(executing)X 2138(process.)X 2499(Thus,)X 2740(programs)X 3128(that)X 3298(allow)X 3537(user)X 3722(custom-)X 576 5660(ization)N 872(by)X 1001(means)X 1280(of)X 1393(dynamic)X 1758(linking)X 2064(expose)X 2364(themselves)X 2826(to)X 2935(potential)X 3307(misuse)X 3608(or)X 3722(destruc-)X 576 5812(tion.)N 799(In)X 904(particular,)X 1322(privileged)X 1737(system)X 2028(commands)X 2469(should)X 2749(never)X 2987(allow)X 3225(user)X 3409(modi\256cation)X 3920(for)X 23 p %%Page: 23 24 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(23)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(the)N 721(same)X 946(reason)X 1224(that)X 1396(privileged)X 1814(UNIX)X 2080(commands)X 2524(should)X 2807(not)X 2957(allow)X 3198(shell)X 3407(escapes)X 10 s 3701 976(15)N 12 s 1016(.)Y 3856(Oth-)X 576 1168(erwise,)N 877(an)X 994(intruder)X 1325(can)X 1485(easily)X 1736(gain)X 1928(unauthorized)X 2457(access)X 2729(to)X 2830(system)X 3122(resources)X 3510(by)X 3631(modifying)X 576 1320(an)N 695(existing)X 1029(privileged)X 1449(command.)X 1906(For)X 2068(other)X 2295(application)X 2753(programs,)X 3169(a)X 3241(well-de\256ned,)X 3775(simple)X 576 1472(interface)N 938(should)X 1218(be)X 1333(designed)X 1699(for)X 1835(users)X 2056(to)X 2155(hook-in)X 2478(their)X 2679(own)X 2868(functions.)X 24 p %%Page: 24 25 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(24)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 1995 1016(CONCLUSION)N 576 1348(This)N 778(paper)X 1023(describes)X 1412(a)X 1486(concept)X 1817(of)X 1928(genuine)X 2264(dynamic)X 2627(link)X 2808(editing)X 3107(and)X 3277(the)X 3426 0.2548(implementation)AX 576 1500(of)N 696(a)X 779(working)X 1139(dynamic)X 1511(linker)X 2 f 1776(dld)X 1 f 1899(.)X 1987(This)X 2198(new)X 2398(approach)X 2791(of)X 2911(dynamic)X 3283(link)X 3473(editing)X 3781(allows)X 576 1652(users)N 801(to)X 905(add,)X 1097(remove,)X 1439(or)X 1548(modify)X 1855(compiled)X 2243(object)X 2508(modules)X 2863(of)X 2972(a)X 3044(program)X 3399(while)X 3642(it)X 3725(is)X 3818(being)X 576 1804(executed.)N 1019(As)X 1177(a)X 1272(result,)X 1562(application)X 2043(programs)X 2458(using)X 2718(dynamic)X 3102(linking)X 3427(enjoy)X 3692(both)X 3914(the)X 576 1956(ef\256ciency)N 987(of)X 1099(executing)X 1506(native)X 1774(machine)X 2133(code)X 2347(and)X 2518(the)X 2668(\257exibility)X 3075(of)X 3187(modifying)X 3620(their)X 3829(func-)X 576 2108(tionalities)N 982(in)X 1082(response)X 1443(to)X 1543(the)X 1686(changing)X 2064(environment.)X 2624(A)X 2718(large)X 2936(number)X 3254(of)X 3358(new)X 3542(applications,)X 576 2260(such)N 776(as)X 880(those)X 1107(presented,)X 1524(are)X 1666(thus)X 1850(made)X 2083(possible.)X 2 f 776 2440(Dld)N 1 f 953(has)X 1114(been)X 1329(implemented)X 1866(for)X 2011(VAX)X 2251(machines)X 2648(running)X 2980(Ultrix,)X 3267(and)X 3440(for)X 3586(SUN)X 3811(3)X 3893(and)X 576 2592(SPARC)N 911(workstations)X 1434(running)X 1765(Sun)X 1946(Operating)X 2363(System)X 2678(version)X 2993(3.4)X 3145(or)X 3257(4.0.)X 3457(It)X 3547(is)X 3642(a)X 3716(package)X 576 2744(of)N 704(library)X 1009(functions)X 1415(callable)X 1764(by)X 1908(C)X 2020(programs;)X 2458(it)X 2560(requires)X 2918(no)X 3062(modi\256cation)X 3598(of)X 3727(existing)X 576 2896(software,)N 971(such)X 1187(as)X 1307(the)X 1465(compiler)X 1848(and)X 2027(the)X 2185(assembler.)X 2657(Programs)X 3064(using)X 2 f 3311(dld)X 1 f 3473(suffer)X 3736(a)X 3818(slight)X 576 3048(overhead)N 959(in)X 1064(loading)X 1383(new)X 1573(modules)X 1929(from)X 2146(disk)X 2336(and)X 2506(performing)X 2970(runtime)X 3301(link)X 3482(editing.)X 3829(Once)X 576 3200(these)N 810(steps)X 1038(are)X 1192(completed,)X 1654(statements)X 2097(in)X 2208(the)X 2362(newly)X 2633(added)X 2899(routines)X 3245(execute)X 3576(at)X 3681(the)X 3834(same)X 576 3352(speed)N 835(as)X 956(if)X 1056(they)X 1263(were)X 1491(statically)X 1881(linked.)X 2 f 2211(Dld)X 1 f 2396(can)X 2571(be)X 2703(obtained)X 3076(free)X 3267(of)X 3388(charge)X 3686(from)X 3914(the)X 576 3504(authors.)N 25 p %%Page: 25 26 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(25)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 1824 1016(ACKNOWLEDGMENT)N 576 1348(Many)N 826(thanks)X 1103(to)X 1204(Richard)X 1535(Stallman)X 1904(and)X 2069(others)X 2330(who)X 2521(made)X 2756(the)X 2900(GNU)X 2 f 3133(ld)X 1 f 3234(available)X 3609(to)X 3711(the)X 3856(pub-)X 576 1500(lic.)N 746(A)X 840(number)X 1159(of)X 1264(functions)X 1647(from)X 2 f 1859(ld)X 1 f 1959(are)X 2102(modi\256ed)X 2469(and)X 2633(used)X 2834(as)X 2939(the)X 3082(basis)X 3298(of)X 3402(the)X 3544(implementa-)X 576 1652(tion)N 758(of)X 2 f 870(dld)X 1 f 993(.)X 1073(Rick)X 1287(Crawford,)X 1711(Carole)X 2000(McNamee,)X 2457(Chris)X 2697(Wee,)X 2930(and)X 3101(the)X 3251(anonymous)X 3727(referees)X 576 1804(provided)N 943(very)X 1139(useful)X 1399(comments)X 1820(on)X 1941(earlier)X 2213(drafts)X 2457(of)X 2562(this)X 2726(paper.)X 3013(Various)X 3342(people)X 3623(around)X 3914(the)X 576 1956(world)N 844(who)X 1053(beta-tested)X 2 f 1515(dld)X 1 f 1683(have)X 1910(provided)X 2297(valuable)X 2669(feedback.)X 3110(Their)X 3364(help)X 3575(is)X 3684(sincerely)X 576 2108(appreciated.)N 26 p %%Page: 26 27 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(26)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 3 f 576 1016(References)N 1 f 576 1224(1.)N 776(L.)X 894(L.)X 1012(Beck,)X 2 f 1269(System)X 1571(Software:)X 2004(An)X 2146(Introduction)X 2663(to)X 2774(System)X 3077(Programming,)X 1 f 3675(Addison-)X 776 1376(Wesley)N 1089(Pub.)X 1286(Co.,)X 1470(Reading,)X 1839(Mass.,)X 2113(1985.)X 576 1556(2.)N 776(R.)X 914(A.)X 1057(Gingell,)X 1420(M.)X 1580(Lee,)X 1800(X.)X 1944(T.)X 2078(Dang,)X 2361(and)X 2551(M.)X 2711(S.)X 2839(Weeks,)X 3176(``Shared)X 3558(Libraries)X 3957(in)X 776 1708(SunOS,'')N 1181(in)X 2 f 1302(USENIX)X 1679(Conference)X 2169(Proceedings)X 1 f 2650(,)X 2719(pp.)X 2884(131-145,)X 3273(USENIX,)X 3693(Phoenix,)X 776 1860(AZ,)N 952(Summer)X 1302(1987.)X 576 2040(3.)N 776(M.)X 948(Sabatella,)X 1389(``Issues)X 1750(in)X 1888(Shared)X 2218(Libraries)X 2630(Design,'')X 3054(in)X 2 f 3193(USENIX)X 3588(Conference)X 776 2192(Proceedings)N 1 f 1257(,)X 1305(pp.)X 1449(11-23,)X 1721(USENIX,)X 2120(Anaheim,)X 2521(CA,)X 2702(June)X 2902(1990.)X 576 2372(4.)N 776(AT&T,)X 2 f 1117(ANSI)X 1375(C)X 1494(&)X 1624(Programming)X 2217(Support)X 2576(Tools,)X 1 f 2869(UNIX)X 3164(System)X 3503(V)X 3628(Release)X 3984(4)X 776 2524(Programmer's)N 1350(Guide,)X 1633(Prentice-Hall,)X 2195(Englewood)X 2657(Cliffs,)X 2924(NJ,)X 3078(1990.)X 576 2704(5.)N 776(J.)X 862(Hobbs,)X 1162(``Installed)X 1584(Shareable)X 1990(Images,'')X 2 f 2382(Dec.)X 2587(Professional)X 1 f 3073(,)X 3123(vol.)X 3296(6,)X 3394(no.)X 3540(4,)X 3638(pp.)X 3784(78-82,)X 776 2856(April)N 1003(1987.)X 576 3036(6.)N 776(G.)X 904(Letwin,)X 1236(``Dynamic)X 1688(Linking)X 2028(in)X 2138(OS/2,'')X 2 f 2458(Byte)X 1 f 2630(,)X 2690(vol.)X 2873(13,)X 3029(no.)X 3185(4,)X 3293(pp.)X 3449(273-280,)X 3829(April)X 776 3188(1988.)N 576 3368(7.)N 776(R.)X 896(C.)X 1016(Daley)X 1278(and)X 1449(J.)X 1542(B.)X 1662(Dennis,)X 1990(``Virtual)X 2359(Memory,)X 2746(Processes,)X 3175(and)X 3347(Sharing)X 3679(in)X 3787(MUL-)X 776 3520(TICS,'')N 2 f 1096(Communications)X 1771(of)X 1870(the)X 2012(ACM)X 1 f 2215(,)X 2263(vol.)X 2434(11,)X 2578(no.)X 2722(5,)X 2818(pp.)X 2962(306-312,)X 3330(May)X 3530(1968.)X 576 3700(8.)N 776(M.)X 937(K.)X 1082(Crowe,)X 1414(``Dynamic)X 1883(Compilation)X 2417(in)X 2545(the)X 2716(Unix)X 2961(Environment,'')X 2 f 3605(Software\320)X 776 3852(Practice)N 1127(and)X 1295(Experience)X 1 f 1729(,)X 1777(vol.)X 1948(17,)X 2092(no.)X 2236(7,)X 2332(pp.)X 2476(455-467,)X 2844(July)X 3028(1987.)X 576 4032(9.)N 776(W.)X 926(Joy)X 1094(and)X 1268(M.)X 1412(Horton,)X 2 f 1743(An)X 1885(Introduction)X 2401(to)X 2511(Display)X 2845(Editing)X 3164(with)X 3365(Vi,)X 1 f 3510(University)X 3952(of)X 776 4184(California)N 1191(at)X 1285(Berkeley,)X 1681(Computer)X 2090(Science)X 2414(Division,)X 2793(May)X 2993(1986.)X 576 4364(10.)N 776(S.)X 883(Kaufer,)X 1204(R.)X 1322(Lopez,)X 1617(and)X 1786(S.)X 1893(Pratap,)X 2193(``Saber-C\320An)X 2815(Interpreter-based)X 3503(Programming)X 776 4516(Environment)N 1313(for)X 1459(the)X 1611(C)X 1709(Language,'')X 2211(in)X 2 f 2320(USENIX)X 2685(Conference)X 3163(Proceedings)X 1 f 3644(,)X 3702(pp.)X 3856(161-)X 776 4668(171,)N 968(USENIX,)X 1367(San)X 1535(Francisco,)X 1957(Summer)X 2307(1988.)X 576 4848(11.)N 776(B.)X 891(B.)X 1006(Chase,)X 1292(``Selective)X 1737(Interpretation)X 2289(as)X 2396(a)X 2467(Technique)X 2902(for)X 3042(Debugging)X 3497(Computation-)X 776 5000(ally)N 947(Intensive)X 1326(Programs,'')X 2 f 1808(Proc.)X 2045(of)X 2146(the)X 2290(SIGPLAN)X 2700(87)X 2821(Symposium)X 3283(on)X 3404(Interpreters)X 3888(and)X 776 5152(Interpretive)N 1255(Techniques)X 1 f 1693(,)X 1741(pp.)X 1885(113-124,)X 2253(St.)X 2381(Paul,)X 2600(MN,)X 2802(July)X 2986(87.)X 576 5332(12.)N 776(R.)X 903(A.)X 1035(Olsson,)X 1364(R.)X 1491(H.)X 1623(Crawford,)X 2054(and)X 2233(W.)X 2388(W.)X 2543(Ho,)X 2724(``Dalek:)X 3109(a)X 3192(GNU,)X 3463(improved)X 3872(pro-)X 776 5484(grammable)N 1290(debugger,'')X 1816(in)X 2 f 1971(USENIX)X 2382(Conference)X 2905(Proceedings)X 1 f 3386(,)X 3489(pp.)X 3688(221-231,)X 776 5636(USENIX,)N 1175(Anaheim,)X 1576(CA,)X 1757(June)X 1957(1990.)X 27 p %%Page: 27 28 5(Helvetica-Narrow)xf 5 f 12 s 0 xH 0 xS 5 f 1 f 10 s 0 32(--)N 4323(--)X 12 s 2200 616(-)N 2256(27)X 2376(-)X 3362(October)X 3696(15,)X 3840(1990)X 576 1016(13.)N 776(R.)X 898(M.)X 1042(Stallman,)X 2 f 1444(GDB)X 1676(Manual)X 2010(\(The)X 2221(GNU)X 2458(Source-Level)X 3001(Debugger\),)X 3476(Third)X 3724(Edition,)X 1 f 776 1168(Free)N 971(Software)X 1342(Foundation,)X 1828(Cambridge,)X 2304(MA,)X 2506(Jan.)X 2682(1989.)X 576 1348(14.)N 776(Z.)X 890(Aral)X 1092(and)X 1262(I.)X 1349(Gertner,)X 1698(``High-Level)X 2237(Debugging)X 2695(in)X 2802(Parasight,'')X 2 f 3280(ACM)X 3515(Workshop)X 3936(on)X 776 1500(Parallel)N 1116(and)X 1284(Distributed)X 1746(Debugging)X 1 f 2173(,)X 2221(pp.)X 2365(151-162,)X 2733(Madison,)X 3117(WI,)X 3288(May)X 3488(1988.)X 576 1680(15.)N 776(P.)X 894(H.)X 1028(Wood)X 1304(and)X 1484(S.)X 1602(G.)X 1736(Kochan,)X 2 f 2101(UNIX)X 2367(System)X 2676(Security,)X 1 f 3058(Hayden)X 3399(Book)X 3649(Co.,)X 3851(Has-)X 776 1832(brouck)N 1067(Heights,)X 1414(NJ,)X 1568(1985.)X 10 s 0 6360(--)N 4323(--)X 28 p %%Trailer xt xs octave-1.1.0/dld/test/ 40777 415 17 0 5355256420 12572 5ustar jweusersoctave-1.1.0/dld/test/reload/ 40777 415 17 0 5637136533 14045 5ustar jweusersoctave-1.1.0/dld/test/reload/reload.c100666 415 17 2002 5021123035 15522 0ustar jweusers#include "dld.h" /* Example to unlink the "main" module (the current executable) so that another "main" can be linked in and executed. To execute, type "reload reload-test". */ main (argc, argv) int argc; char *argv[]; { register void (*func) () ; int *new_brk; (void) dld_init(argv[0]); /* unlink itself */ dld_unlink_by_file (argv[0], 1); dld_link (argv[1]); #if defined(sequent) func = (void (*)()) dld_get_func ("main"); (*func) (); #else if (dld_function_executable_p ("main")) { func = (void (*)()) dld_get_func ("main"); /* "curbrk" is a symbol used by sbrk(2) to record the current break of the process. It is initialized to the address of "_end". Since we are loading in a new copy of sbrk, we must set its value to the true current break of the process. Otherwise, the first call to the new sbrk will get a seg. fault */ if (new_brk = (int *) dld_get_bare_symbol ("curbrk")) { *new_brk = sbrk(0); (*func) (); } } #endif } octave-1.1.0/dld/test/reload/reload-test.c100666 415 17 240 5021123035 16461 0ustar jweusers#if defined(sequent) asm (".comm _387_flt,4"); #endif int end; /* required by sbrk() */ main () { printf ("Hello world! -- from reload-test\n"); } octave-1.1.0/dld/test/reload/Makefile100666 415 17 656 5637136440 15566 0ustar jweusersEXEC = reload reload-test LIB = ../../libdld.a INCLUDE = ../../dld.h CC= gcc CFLAGS = -g -I../.. all: ${EXEC} clean: rm -f ${EXEC} *.o ${LIB}: ../../dld.c $(INCLUDE) cd ../..; make .c.o: ${CC} -c ${CFLAGS} $*.c reload: $(LIB) $(INCLUDE) reload.o reload-test ${CC} ${CFLAGS} reload.o $(LIB) -o reload reload-test: reload-test.o # ld -r reload-test.o /lib/libc.a -o reload-test ld -r reload-test.o -o reload-test #linux octave-1.1.0/dld/test/reload/reload-test.s100666 415 17 741 5021123037 16511 0ustar jweusers .file "reload-test.c" .data .comm _387_flt, 4 .align 2 .globl _k _k: .long 1 .text .align 2 .globl _main _main: jmp .L15 .L14: pushl $.L17 call _printf popl %ecx /REGAL 0 NOFPA NODBL .L13: leave ret .L15: pushl %ebp movl %esp,%ebp jmp .L14 /DEF _main; .data .L17: .byte 0x48,0x65,0x6c,0x6c,0x6f,0x20,0x77,0x6f,0x72,0x6c .byte 0x64,0x21,0x20,0x2d,0x2d,0x20,0x66,0x72,0x6f,0x6d .byte 0x20,0x72,0x65,0x6c,0x6f,0x61,0x64,0x2d,0x74,0x65 .byte 0x73,0x74,0x0a,0x00 octave-1.1.0/dld/test/general/ 40777 415 17 0 5637136526 14216 5ustar jweusersoctave-1.1.0/dld/test/general/hello.c100666 415 17 100 5021123040 15477 0ustar jweusers#include hello () { printf ("hello world!\n"); } octave-1.1.0/dld/test/general/read-a.out.c100666 415 17 5421 5637136440 16413 0ustar jweusers#include #include #if defined(sun) && defined(sparc) #define relocation_info reloc_info_sparc #endif read_a_out (argc, argv) int argc; char **argv; { struct exec header; struct relocation_info relo; struct nlist name_list; FILE *objfile; char *string; int str_size; int i; if (argc < 1) exit (); if ((objfile = fopen (argv[1], "r")) == NULL) { perror ("Can't open object file"); exit (); } if (!fread (&header, sizeof(header), 1, objfile)) { perror ("Can't read header"); exit (); } #ifndef linux printf ("Header information:\nmagic = 0%o, text size = %d, data size = %d\n", header.a_magic, header.a_text, header.a_data); #endif printf ("bss size = %d, syms size = %d, entry point = 0x%x, trsize = %d, drsize = %d\n", header.a_bss, header.a_syms, header.a_entry, header.a_trsize, header.a_drsize); fseek (objfile, header.a_text + header.a_data + header.a_bss, 1); if (header.a_trsize != 0) { printf ("\n\nText relocation info\n"); for (i=0; i<(header.a_trsize/sizeof(relo)); i++) { fread (&relo, sizeof(relo), 1, objfile); #if defined(sun) && defined(sparc) printf ("Address = 0x%x, local offset = %d\n", relo.r_address, relo.r_index); printf ("extern = %d, relocation type = %d, addend = %d\n", relo.r_extern, relo.r_type, relo.r_addend); #else printf ("Address = 0x%x, local offset = %d\n", relo.r_address, relo.r_symbolnum); printf ("pc relocated = %d, length = %d, extern = %d\n", relo.r_pcrel, relo.r_length, relo.r_extern); #endif } } if (header.a_drsize != 0) { printf ("\n\nData relocation info\n"); for (i=0; i<(header.a_trsize/sizeof(relo)); i++) { fread (&relo, sizeof(relo), 1, objfile); #if defined(sun) && defined(sparc) printf ("Address = 0x%x, local offset = %d\n", relo.r_address, relo.r_index); printf ("extern = %d, relocation type = %d, addend = %d\n", relo.r_extern, relo.r_type, relo.r_addend); #else printf ("Address = 0x%x, local offset = %d\n", relo.r_address, relo.r_symbolnum); printf ("pc relocated = %d, length = %d, extern = %d\n", relo.r_pcrel, relo.r_length, relo.r_extern); #endif } } fseek (objfile, N_STROFF(header), 0); fread (&str_size, sizeof(str_size), 1, objfile); string = (char *) malloc (str_size); fseek (objfile, N_STROFF(header), 0); fread (string, 1, str_size, objfile); fseek (objfile, N_SYMOFF(header), 0); printf ("\n\n"); for (i=0; i<(header.a_syms/sizeof(struct nlist)); i++) { fread (&name_list, sizeof (struct nlist), 1, objfile); printf ("string = %s\n", string + name_list.n_un.n_strx); printf ("Type = 0x%x, value = 0x%08x\n", name_list.n_type, (int)name_list.n_value); } } octave-1.1.0/dld/test/general/main.c100666 415 17 4447 5021123041 15363 0ustar jweusers#include #include #include "dld.h" int my_argc; char **my_argv; /* * Ask for a object file interactively, then link it in. * User can then enter the function name for execution. * See file "script" for sample inputs. */ main (argc, argv) int argc; char **argv; { char line[80]; /* required initialization. */ (void) dld_init (argv[0]); my_argv = 0; printf ("(dld) "); while (gets(line) != NULL) { printf ("%s\n", line); if (my_argv) free (my_argv); parse (line); execute (my_argc, my_argv); printf ("(dld) "); } } /* parse the user input. Split the arguments into my_argv and put number of arguments in my_argc, in the same way as the shell parse the command line arguments. */ parse (line) char line[]; { register char *p; my_argc = 0; p = line; while (*p) { while (*p == '\t' || *p == ' ') p++; if (!(*p)) break; while (*p != '\t' && *p != ' ' && *p != 0) p++; my_argc++; if (*p) p++; } my_argv = (char **) malloc ((my_argc+1) * sizeof (char **)); { register int i; p = line; for (i=0; i= 3 ? 1 : 0); else if (!strcmp (my_argv[0], "uls")) dld_unlink_by_symbol (my_argv[1], my_argc >= 3 ? 1 : 0); else { func = (int (*) ()) dld_get_func (my_argv[0]); if (func) { register int i; if (dld_function_executable_p (my_argv[0])) { i = (*func) (my_argc, my_argv); if (i) printf ("%d\n", i); } else printf ("Function %s not executable!\n", my_argv[0]); } else printf ("illegal command\n"); } } octave-1.1.0/dld/test/general/print_arg.c100666 415 17 167 5021123042 16400 0ustar jweusers#include print_arg (argc, argv) int argc; char **argv; { while (argc) printf ("%s\n", argv[--argc]); } octave-1.1.0/dld/test/general/Makefile100666 415 17 670 5021123042 15706 0ustar jweusersEXEC = dld-test LIB = ../../libdld.a OBJS = hello.o print_arg.o read-a.out.o list-undefined.o get-sym.o need.o\ test-define.o print_global.o remove.o INCLUDE = ../../dld.h CC= gcc CFLAGS = -g -I../.. all: ${EXEC} ${OBJS} ${LIB} clean: rm -f ${EXEC} ${OBJS} *.o ${LIB}: cd ../..; make hello.o: hello.c ${CC} -c hello.c .c.o: ${CC} -c ${CFLAGS} $*.c dld-test: $(LIB) $(INCLUDE) main.o ${CC} ${CFLAGS} main.o $(LIB) -o dld-test octave-1.1.0/dld/test/general/print_global.c100666 415 17 150 5021123043 17060 0ustar jweusersextern int global_int; print_global () { printf ("the value of global_int is %d\n", global_int); } octave-1.1.0/dld/test/general/list-undefined.c100666 415 17 610 5021123043 17317 0ustar jweusers/* print out all the undefined symbols */ #include list_undefined () { char **list = dld_list_undefined_sym (); if (list) { register int i; printf ("There are a total of %d undefined symbols:\n", dld_undefined_sym_count); for (i = 0; i < dld_undefined_sym_count; i++) printf ("%d: %s\n", i+1, list[i]); } else printf ("No undefined symbols\n"); } octave-1.1.0/dld/test/general/get-sym.c100666 415 17 465 5021123043 16002 0ustar jweusers/* print the address and value of the specified symbols */ get_symbol (argc, argv) int argc; char *argv[]; { register int *value; register int i; for (i=1; i < argc; i++) { value = (int *) dld_get_symbol (argv[i]); printf ("%d: address = 0x%x, value = 0x%x\n", i, value, *value); } } octave-1.1.0/dld/test/general/need.c100666 415 17 1006 5021123044 15341 0ustar jweusers/* explicity reference the given symbol, so that the library routine defining this symbol will be loaded */ #include need (argc, argv) int argc; char *argv[]; { register int i; for (i = 1; i < argc; i++) { register int dld_errno; printf ("%d: %s", i, argv[i]); fflush (stdout); if (dld_errno = dld_create_reference (argv[i])) printf ("--Error: %d\n", dld_errno); else { if (dld_get_symbol (argv[i])) printf ("--Symbol already defined\n"); else printf ("\n"); } } } octave-1.1.0/dld/test/general/EXPECTED-OUTPUT100666 415 17 6544 5021123044 16460 0ustar jweusers(dld) dld hello.o (dld) hello hello world! 1 (dld) dld print_arg.o (dld) print_arg 1 2 arg3 blah blah blah blah blah blah arg3 2 1 print_arg 7 (dld) ul hello.o (dld) hello illegal command (dld) dld list-undefined.o (dld) list_undefined Function list_undefined not executable! (dld) dld ../../libdld.a (dld) list_undefined No undefined symbols 1 (dld) uls list_undefined (dld) dld list-undefined.o (dld) list_undefinded illegal command (dld) dld ../../libdld.a (dld) list_undefined No undefined symbols 1 (dld) dld need.o ../../libdld.a (dld) need random 1: random 2 (dld) random illegal command (dld) list_undefined There are a total of 1 undefined symbols: 1: _random 1 (dld) dld /lib/libc.a (dld) random 2078917053 (dld) random 143302914 (dld) uls random (dld) random illegal command (dld) dld get-sym.o ../../libdld.a (dld) get_symbol dld_undefined_sym_count 1: address = 0x140c8, value = 0x0 2 (dld) dld read-a.out.o (dld) get_symbol dld_undefined_sym_count 1: address = 0x140c8, value = 0x2 2 (dld) list_undefined There are a total of 2 undefined symbols: 1: _perror 2: _fread 1 (dld) dld /lib/libc.a (dld) read_a_out hello.o Header information: magic = 0407, text size = 48, data size = 0 bss size = 0, syms size = 312, entry point = 0x0, trsize = 36, drsize = 0 Text relocation info Address = 0x1c, local offset = 20 extern = 1, relocation type = 6, addend = -28 Address = 0x18, local offset = 4 extern = 0, relocation type = 11, addend = 0 Address = 0x14, local offset = 4 extern = 0, relocation type = 8, addend = 0 string = gcc_compiled. Type = 0x4, value = 0x00000000 string = hello.c Type = 0x64, value = 0x00000000 string = int:t1=r1;-2147483648;2147483647; Type = 0x80, value = 0x00000000 string = char:t2=r2;0;127; Type = 0x80, value = 0x00000000 string = long int:t3=r1;-2147483648;2147483647; Type = 0x80, value = 0x00000000 string = unsigned int:t4=r1;0;-1; Type = 0x80, value = 0x00000000 string = long unsigned int:t5=r1;0;-1; Type = 0x80, value = 0x00000000 string = short int:t6=r1;-32768;32767; Type = 0x80, value = 0x00000000 string = long long int:t7=r1;0;-1; Type = 0x80, value = 0x00000000 string = short unsigned int:t8=r1;0;65535; Type = 0x80, value = 0x00000000 string = long long unsigned int:t9=r1;0;-1; Type = 0x80, value = 0x00000000 string = signed char:t10=r1;-128;127; Type = 0x80, value = 0x00000000 string = unsigned char:t11=r1;0;255; Type = 0x80, value = 0x00000000 string = float:t12=r1;4;0; Type = 0x80, value = 0x00000000 string = double:t13=r1;8;0; Type = 0x80, value = 0x00000000 string = long double:t14=r1;8;0; Type = 0x80, value = 0x00000000 string = void:t15=15 Type = 0x80, value = 0x00000000 string = _hello Type = 0x5, value = 0x00000010 string = Type = 0x44, value = 0x00000010 string = Type = 0x44, value = 0x00000014 string = _printf Type = 0x1, value = 0x00000000 string = Type = 0x44, value = 0x00000024 string = _iobuf:T16=s20_cnt:1,0,32;_ptr:17=*11,32,32;_base:17,64,32;_bufsiz:1,96,32;_flag:6,128,16;_file:2,144,8;; Type = 0x80, value = 0x00000000 string = hello:F1 Type = 0x24, value = 0x00000010 string = Type = 0xc0, value = 0x00000014 string = Type = 0xe0, value = 0x00000024 2 (dld) dld test-define.o ../../libdld.a (dld) test_define print_global should now give 12345 1 (dld) print_global the value of global_int is 12345 1 (dld) dld remove.o ../../libdld.a (dld) test_remove global_int 2 (dld) print_global Function print_global not executable! (dld) octave-1.1.0/dld/test/general/SAMPLE_INPUT100666 415 17 1201 5021123044 16142 0ustar jweusersdld hello.o hello dld print_arg.o print_arg 1 2 arg3 blah blah blah ul hello.o hello dld list-undefined.o list_undefined dld ../../libdld.a list_undefined uls list_undefined dld list-undefined.o list_undefinded dld ../../libdld.a list_undefined dld need.o ../../libdld.a need random random list_undefined dld /lib/libc.a random random uls random random dld get-sym.o ../../libdld.a get_symbol dld_undefined_sym_count dld read-a.out.o get_symbol dld_undefined_sym_count list_undefined dld /lib/libc.a read_a_out hello.o dld test-define.o ../../libdld.a test_define print_global dld remove.o ../../libdld.a test_remove global_int print_global octave-1.1.0/dld/test/general/test-define.c100666 415 17 447 5021123044 16625 0ustar jweusers#include #include test_define () { int *i; dld_link ("print_global.o"); dld_define_sym ("global_int", sizeof(int)); i = (int *) dld_get_symbol ("global_int"); *i = 12345; printf ("print_global should now give 12345\n"); } octave-1.1.0/dld/test/general/remove.c100666 415 17 220 5021123045 15701 0ustar jweuserstest_remove (argc, argv) int argc; char *argv[]; { register int i; for (i = 1; i < argc; i++) dld_remove_defined_symbol (argv[i]); } octave-1.1.0/dld/test/overlay/ 40777 415 17 0 5021123046 14236 5ustar jweusersoctave-1.1.0/dld/test/overlay/overlay.c100666 415 17 2447 5021123045 16166 0ustar jweusers#include #include #include #include "dld.h" /* strings to hold the next object file to be linked. On invocation, the linked-in function will modify this string so that a different file will be loaded next time. */ char *p = "chain1.o"; /* * To show how different modules can be overlayed onto the same memory * sections. */ main (argc, argv) int argc; char *argv[]; { struct rusage rusage; (void) dld_init (argv[0]); /* Use the max. memory allocation to show that all the dynamically linked in modules indeed share the (more or less) same memory sections. Each module contains a large static array. If they are not overlayed, the max. RSS will increase. */ getrusage (RUSAGE_SELF, &rusage); printf ("MAX_RSS = %d page.\n", rusage.ru_maxrss); do { register void (* func) (); register int dld_errno; printf ("Linking %s\n", p); if (dld_errno = dld_link (p)) { fprintf (stderr, "Error linking %s -- code = %d\n", p, dld_errno); exit (); } getrusage (RUSAGE_SELF, &rusage); printf ("MAX_RSS = %d page.\n", rusage.ru_maxrss); if (dld_function_executable_p("chain")) { func = (void (*) ()) dld_get_func ("chain"); (* func) (); } dld_unlink_by_symbol ("chain", 0); } while (p); } octave-1.1.0/dld/test/overlay/chain1.c100666 415 17 336 5021123045 15623 0ustar jweusersextern char *p; static int large[100000]; chain () { bzero (large, 100000 * sizeof (int)); printf ("I am chain1\n"); p[5] = '2'; /* modify the string holding the next file to be loaded. */ } octave-1.1.0/dld/test/overlay/chain2.c100666 415 17 212 5021123046 15616 0ustar jweusersextern char *p; int large[100000]; chain () { bzero (large, 100000 * sizeof (int)); printf ("I am chain2\n"); p[5] = '3'; } octave-1.1.0/dld/test/overlay/chain3.c100666 415 17 205 5021123046 15621 0ustar jweusersextern char *p; int large[100000]; chain () { bzero (large, 100000 * sizeof (int)); printf ("I am chain3\n"); p = 0; } octave-1.1.0/dld/test/overlay/Makefile100666 415 17 523 5021123046 15753 0ustar jweusersEXEC = overlay LIB = ../../libdld.a INCLUDE = ../../dld.h CC= gcc CFLAGS = -g -I../.. all: ${EXEC} clean: rm -f ${EXEC} *.o ${LIB}: ../../dld.c $(INCLUDE) cd ../..; make .c.o: ${CC} -c ${CFLAGS} $*.c overlay: $(LIB) $(INCLUDE) overlay.c chain1.o chain2.o chain3.o ${CC} ${CFLAGS} -fwritable-strings overlay.c $(LIB) -o overlay octave-1.1.0/dld/test/simple/ 40777 415 17 0 5355626052 14065 5ustar jweusersoctave-1.1.0/dld/test/simple/simple.c100666 415 17 417 5021123046 15562 0ustar jweusers#include "dld.h" main (argc, argv) int argc; char *argv[]; { void (*func) (); (void) dld_init (argv[0]); printf ("Hello world from %s\n", argv[0]); func = (void (*) ()) dld_get_func ("printf"); (*func) ("Hello world from %s\n", argv[0]); } octave-1.1.0/dld/test/simple/Makefile100666 415 17 435 5021123047 15566 0ustar jweusersEXEC = simple LIB = ../../libdld.a INCLUDE = ../../dld.h CC= gcc CFLAGS = -g -I../.. all: ${EXEC} clean: rm -f ${EXEC} *.o ${LIB}: ../../dld.c $(INCLUDE) cd ../..; make .c.o: ${CC} -c ${CFLAGS} $*.c simple: $(LIB) $(INCLUDE) simple.c ${CC} ${CFLAGS} simple.c $(LIB) -o simple octave-1.1.0/dld/test/add1/ 40777 415 17 0 5021123047 13367 5ustar jweusersoctave-1.1.0/dld/test/add1/add1.c100666 415 17 43 5021123047 14376 0ustar jweusersextern int x; add1() { x++; } octave-1.1.0/dld/test/add1/call_add1.c100666 415 17 1113 5021123047 15430 0ustar jweusers#include "dld.h" int x; /* * Dynamically link in "add1.o", which defines the function "add1". * Invoke "add1" to increment the global variable "x" defined *here*. */ main (argc, argv) int argc; char *argv[]; { register void (*func) (); /* required initialization. */ (void) dld_init (argv[0]); x = 1; printf ("global variable x = %d\n", x); dld_link ("add1.o"); /* grap the entry point for function "add1" */ func = (void (*) ()) dld_get_func ("add1"); /* invoke "add1" */ (*func) (); printf ("global variable x = %d\n", x); } octave-1.1.0/dld/test/add1/Makefile100666 415 17 503 5021123047 15102 0ustar jweusersEXEC = call_add1 LIB = ../../libdld.a INCLUDE = ../../dld.h CC= gcc CFLAGS = -g -I../.. all: ${EXEC} clean: rm -f ${EXEC} *.o ${LIB}: ../../dld.c $(INCLUDE) cd ../..; make ; cd test/add1 .c.o: ${CC} -c ${CFLAGS} $*.c call_add1: $(LIB) $(INCLUDE) add1.o call_add1.c ${CC} ${CFLAGS} call_add1.c $(LIB) -o call_add1 octave-1.1.0/dld/test/Makefile100666 415 17 334 5021123050 14265 0ustar jweusersTESTS = add1 overlay simple general reload all: cd ..; make for name in ${TESTS}; \ do \ cd $${name}; make; cd .. ;\ done clean: for name in ${TESTS}; \ do \ cd $${name}; make clean; cd ..;\ done octave-1.1.0/dld/test/foo/ 40777 415 17 0 5637135456 13365 5ustar jweusersoctave-1.1.0/dld/test/foo/Makefile100666 415 17 642 5355644255 15103 0ustar jweusersEXEC = call_add1 LIB = ../../libdld.a INCLUDE = ../../dld.h CC= gcc CFLAGS = -I../.. -static all: ${EXEC} clean: rm -f ${EXEC} *.o ${LIB}: ../../dld.c $(INCLUDE) cd ../..; make ; cd test/add1 .c.o: ${CC} -c ${CFLAGS} $*.c add1.a: add1.o ar rcv add1.a add1.o add2.a: add2.o ar rcv add2.a add2.o call_add1: $(LIB) $(INCLUDE) add1.a add2.a call_add1.cc ${CC} ${CFLAGS} call_add1.cc $(LIB) -lg++ -o call_add1 octave-1.1.0/dld/test/foo/add2.cc100666 415 17 103 5355260154 14544 0ustar jweusersextern int x; void add2 (void) { printf ("in add2\n"); x++; } octave-1.1.0/dld/test/foo/add1.cc100666 415 17 171 5355261201 14542 0ustar jweusers#include extern void add2 (void); void add1 (void) { printf ("in add1\n"); fflush (stdout); add2 (); } octave-1.1.0/dld/test/foo/call_add1.cc100666 415 17 2011 5355642152 15560 0ustar jweusers extern "C" { #include "dld.h" } #include int x; void list_undefined (void) { int i; char **undefined_syms = dld_list_undefined_sym (); for (i = 0; i < dld_undefined_sym_count; i++) printf ("%s\n", undefined_syms[i]); } /* * Dynamically link in "add1.o", which defines the function "add1". * Invoke "add1" to increment the global variable "x" defined *here*. */ int main (int argc, char **argv) { register void (*func) (); /* required initialization. */ dld_init (argv[0]); x = 1; printf ("global variable x = %d\n", x); dld_create_reference ("add1__Fv"); list_undefined (); if (dld_link ("add1.a")) dld_perror ("add1.a"); list_undefined (); if (dld_link ("add2.a")) dld_perror ("add2.a"); list_undefined (); /* grap the entry point for function "add1" */ func = (void (*) ()) dld_get_func ("add1__Fv"); /* invoke "add1" */ (*func) (); printf ("global variable x = %d\n", x); fflush (stdout); return 0; } octave-1.1.0/dld/COPYING100666 415 17 30310 5021123055 12743 0ustar jweusers GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our 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. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, 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 a 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 tell them 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. 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 Agreement 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 work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 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 General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual 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 General Public License. d) 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. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 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 Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying 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. 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. 7. 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 the 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 the license, you may choose any version ever published by the Free Software Foundation. 8. 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 9. 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. 10. 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 Appendix: 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 humanity, 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. Copyright (C) 19yy 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, 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) 19xx 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 a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! octave-1.1.0/dld/ChangeLog100666 415 17 22377 5637135277 13526 0ustar jweusersThu May 30 00:15:31 1991 W. Wilson Ho (how at sundrops) * version 3.2.3 released. * update doc/dld.texinfo to reflect changes in 3.2.3. * replace CSE-90-25.ps by the more up-to-date SPE.ps. Thu May 30 00:06:33 1991 Gnu Software Packages (gnu at dudley) * in test/reload: put in hack so that it works on sequent symmetry. * dld.c: add conditionally compiled code for Sequent Symmetry. Wed May 29 22:19:44 1991 W. Wilson Ho (how at sundrops) * begin works for version 3.2.3. Tue Nov 13 11:01:43 1990 W. Wilson Ho (how at ivy) * put in my new email address in README and dld.texinfo. Thu Nov 8 14:23:02 1990 W. Wilson Ho (how at ivy) * merge in patch from Edgar Roeder that port dld to atari. * Version 3.2.2. Mon Oct 1 11:30:14 1990 W. Wilson Ho (how at sundrops) * Version 3.2.1 released. * rename file_executable.c to file_exec.c list_undefined.c to list_undef.c unlink_file.c to ul_file.c unlink_symbol.c to ul_symbol.c * add error.c: dld_perror: * similar to perror, but for the dld error codes. Sat Sep 29 01:01:45 1990 W. Wilson Ho (how at sundrops) * finish updating the texinfo manual. Fri Sep 28 17:25:38 1990 W. Wilson Ho (how at sundrops) * new file remove.c; new function dld_remove_defined_symbol() * rename and export: executable_flags_up_to_date -> _dld_exec_flags_valid patch_all_files () -> _dld_patch_all_files () * problem with explicitly defining and referencing symbols: * the unlink/garbage collection mechanism is based on the assumption that the unit for link and unlink is a module/object file. There is no cross-referencing information in the per symbol basis. * Solution: don't make any reference link between the dummy entry and other entries. don't touch the reference count of the dummy entry. * when a library module defines a symbol explicitly referenced by the user, all connections between this symbol and the dummy entry are removed. This module is then treated as if it is explicitly loaded in by the user. Thu Sep 27 20:32:34 1990 W. Wilson Ho (how at sundrops) * test/general: new test functions: * list-undefined.c, get-sym.c * update script to add calls to these new functions * update Makefile to include the new source files. * put the following function in a separate file: dld_get_func --> get_func.c dld_get_symbol --> get_symbol.c * rename and export the following functions: getsym_soft() --> _dld_getsym_soft() unlink_entry() --> _dld_unlink_entry() Tue Sep 25 00:09:29 1990 W. Wilson Ho (how at sundrops) * new dld error code DLD_EBADNTYPE: invalid n_type value. * dld.h: add declarations for the new functions dld_define() and dld_create_reference(). * new file dld_mk_dymmy.c; new function _dld_create_dummy_entry(): * use internally by dld_create_reference and dld_define to create a dummy file_entry to associate with all the "dangling" symbols. * new file dld_ref.c; new function dld_create_reference(): * allow explicit reference to a symbol so that the library routine defining it can be forced to load. * new file dld_define.c;new function dld_define(): * allow explicit definition of a symbol. * requires the name, n_type and n_value. * dld.c: export the following and rename: env -> _dld_eny latest_entry -> _dld_latest_entry xmalloc -> _dld_malloc getsym -> _dld_getsym enter_global_ref -> _dld_enter_global_ref * create defs.h to hold all the definition of data structures shared among the dld source files. * add call to setjmp() in all exported dld function (if necessary) so that the call to longjmp in fatal() will not fail. Mon Sep 24 12:13:27 1990 W. Wilson Ho (how at sundrops) * rewrite the Makefiles. Fri Sep 21 12:35:27 1990 W. Wilson Ho (how at sundrops) * reliminate all uses of alloca(). For most parts the change are minor, but see "Ugly kludge" in symdef_library(). Fri Sep 21 02:52:24 1990 Edgar Roeder (edgar at megamaster) * added st_read_header to convert TOS file header to unix style file header (requires modified ld to include dbx symbols in TOS executables) Thu Sep 20 14:33:26 1990 W. Wilson Ho (how at sundrops) * Version 3.2.1. * rename undefined_global_sym_count to dld_undefined_sym_count. Also make this variable global and include its decl. in dld.h. * new function dld_list_undefined_sym(): returns an array of (char *), each of which points to the name of an undefined symbols. This array should be freed by the user. (Modified from suggestion by Jan Wielemaker (jan@swi.psy.uva.nl). * clear all common blocks to zero when they are allocated. (Bug reported by Jan Wielemaker). * subfile_wanted_p(): return 1 also for files that only define global variables (commons). (Bug reported by Jan Wielemaker). Tue Sep 18 03:59:22 1990 Edgar Roeder (edgar at megamaster) * added ABSOLUTE_FILENAME_P predicate and relocation code for the Atari ST under TOS (including a consistency check against the current basepage). Fri Sep 14 22:16:14 1990 Edgar Roeder (edgar at megamaster) * added a separate DLDPATH environment variable in dld_find_executable so that users may specify a special path for object modules. Fri Sep 7 02:20:38 1990 W. Wilson Ho (how at sundrops) * finish dld.texinfo. Fri Aug 24 02:01:08 1990 W. Wilson Ho (how at iris) * update the manpages to reflect the changes of function names. * add new function dld_get_bare_symbol() -- same as dld_get_symbol except that no underscore (_) is prepended. Thu Aug 23 00:41:44 1990 W. Wilson Ho (how at sundrops) * put in changes to optimize the memory overhead: * the nlist array is freed after the required entries (external symbol definitions or references) have been inserted into the symtab. * relocation of local symbol references is done only once. Afterwards, only the relocation info of external references are saved and the rest is discarded. * new structure "dld_reloc_info" is defined. "file_entry" uses this. * loading of text and data segments is moved up frond and done in read_file_symbols (). New function read_text_and_data() is added. * relocate_entry_symbols () now takes care of relocating local references also. A call to relocate_local_refs() is added. * New function: relocate_local_refs(). Read in the relocation info, perform the relocation by calling do_local_relocation(), which also recorded the relocation entry for external references. When these are done, free the nlist array. * perform_relocation() now works only on the new dld_reloc_info structure. Wed Aug 22 00:11:08 1990 W. Wilson Ho (how at sundrops) * remove the field "refs" from defintion of symbol. remove the function digest, change enter_global_ref() and relocate_symbol_address() so that they modify sp->value directly. * version 3.2 * rename which() to dld_which(). * rename all extern function to begin with "dld_" * in dld_init, leave the value of {text,data,bss}_start_address of the root module as zero, so that if the root module is unlinked, kill_entry will not attempt to free these (invalid) addresses. * include error handling in dld_init(). (setjmp and clean_up). Tue Aug 21 17:16:08 1990 W. Wilson Ho (how at sundrops) * add the already_unlink flag to struct file_entry so that no module can be (soft) unlinked twice. * fix bug in relocate_symbol_address(): while reading the text and data segments in core, only read in a_text+a_data bytes, do not count the a_bss. The object file does *not* contain the bss segment, only the executing process does. Mon Jun 11 14:24:57 1990 W. Wilson Ho (how at snowball) * version 3.1.1. * rename dld() to dlink() Thu May 3 11:17:53 1990 W. Wilson Ho (how at iris) * relocate_symbol_address(): zero the bss segment read in from the object files. Tue May 1 20:56:20 1990 W. Wilson Ho (how at snowball) * modify get_symbol(), get_func(), unlink_by_symbol() and function_executable_p() so tha a '_' is always prepended to the given named before lookup. * modify the test programs to accomodate the above changes. Tue Apr 24 13:25:21 1990 W. Wilson Ho (how at snowball) * dld susccessfully ported to sunOS4.0. However, programs using dld cannot be linked with the system's shared library. * update test/read-a.out.c to take care of sparc's data structure of relocation info. * merge in the relocation function for sparc, only perform_relocation needs to be modified. Also add in the RELOC_* macros. * attempt to port to Sun OS 4.0. Differences of the two systems includes: : OS4.0 has two more fields (a_dynamic and a_toolversion), both of them can be safely ignored. : same : Compatible between Sun3's running OS3.4 and OS4.0. struct relocation_info is renamed to reloc_info_68k in OS4.0, and the unused bits of the structure in OS3.4 is now used. This has no effect on dld. For sparc, structure of reloc_info_sparc is different, so is the way that addresses should be relocated. This is not compatible with the Sun3's. * History: * in this version, add new function function_executable_p() which returns true if the given function can be safely executed. octave-1.1.0/dld/Makefile.in100666 415 17 3536 5662226344 13767 0ustar jweusers# # Makefile for octave's dld directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = define.c dld.c error.c find_exec.c get_func.c get_symbol.c \ list_undef.c mk_dummy.c ref.c remove.c ul_file.c ul_symbol.c OBJECTS = define.o dld.o error.o find_exec.o get_func.o get_symbol.o \ list_undef.o mk_dummy.o ref.o remove.o ul_file.o ul_symbol.o INCLUDES = dld.h defs.h DISTFILES = COPYING ChangeLog Makefile.in README TAGS TODO \ $(SOURCES) $(INCLUDES) # Complete directory trees to distribute. DISTDIRS = doc test all: libdld.a .PHONY: all libdld.a: $(OBJECTS) $(AR) $(ARFLAGS) libdld.a $(OBJECTS) $(RANLIB) libdld.a all: libdld.a check: all .PHONY: check install: all if test -d $(libdir) ; then true ; else mkdir $(libdir) ; fi rm -f $(libdir)/libdld.a $(INSTALL_DATA) libdld.a $(libdir)/libdld.a if test -d $(includedir) ; then true ; else mkdir $(includedir) ; fi $(INSTALL_DATA) $(srcdir)/dld.h $(includedir)/dld.h .PHONY: install uninstall: rm -f $(libdir)/libdld.a for f in $(INCLUDES) ; do rm -f $(includedir)/$$f ; done .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: rm -f *.a *.o .PHONY: clean mostlyclean: clean .PHONY: mostlyclean distclean: clean rm -f Makefile *.a .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: for dir in $(DISTDIRS); do ln -s ../../dld/$$dir ../`cat ../.fname`/dld; done ln $(DISTFILES) ../`cat ../.fname`/dld .PHONY: local-dist dist: for dir in $(DISTDIRS); do ln -s ../../dld/$$dir ../`cat ../.fname`/dld; done ln $(DISTFILES) ../`cat ../.fname`/dld .PHONY: dist octave-1.1.0/dld/README100666 415 17 1206 5021126477 12565 0ustar jweusersThis is dld version 3.2.3. It currently supports VAX (Ultrix), Sun 3 (SunOS 3.4 and 4.0), SPARCstation (SunOS 4.0), Sequent Symmetry (Dynix), and Atari ST. To compile, type "make". To compile the test programs, cd to "test" and then type "make". Changes from 3.2.1 to 3.2.3 is minimal. Mainly contains the port to Atari and Symmetry. I've received quite a number of suggestions for improvements, new features, and debugging support. I'll incorporate them in release 3.3--whenever I have time to work on it! Wilson Ho (how@cs.ucdavis.edu) Wed May 29 22:21:31 PDT 1991 P.S. Port for Atari is contributed by Edgar Roeder. See ChangeLog. octave-1.1.0/dld/TAGS100666 415 17 5325 5021126605 12365 0ustar jweusers define.c,23 dld_define_sym 28,731 defs.h,36 #define del_link_list_elt(171,5546 dld.c,2122 #define ABSOLUTE_FILENAME_P(1514,43772 #define ABSOLUTE_FILENAME_P(1517,43871 #define N_BSSADDR(96,2839 #define N_DATADDR(83,2482 #define N_DATADDR(88,2655 #define N_TXTADDR(74,2357 #define N_TXTADDR(77,2402 #define RELOC_ADDRESS(163,5594 #define RELOC_ADDRESS(191,6740 #define RELOC_ADDRESS(202,7090 #define RELOC_ADD_EXTRA(167,5807 #define RELOC_EXTERN_P(164,5654 #define RELOC_EXTERN_P(192,6783 #define RELOC_EXTERN_P(203,7133 #define RELOC_MEMORY_SUB_P(166,5774 #define RELOC_MEMORY_SUB_P(194,6871 #define RELOC_MEMORY_SUB_P(205,7221 #define RELOC_PCREL_P(168,5870 #define RELOC_PCREL_P(196,6938 #define RELOC_PCREL_P(207,7277 #define RELOC_SYMBOL(165,5716 #define RELOC_SYMBOL(193,6826 #define RELOC_SYMBOL(204,7176 #define RELOC_TARGET_BITSIZE(172,6130 #define RELOC_TARGET_SIZE(171,6057 #define RELOC_TARGET_SIZE(197,6993 #define RELOC_TARGET_SIZE(208,7318 #define RELOC_VALUE_RIGHTSHIFT(170,5978 _dld_enter_global_ref 643,19457 _dld_getsym 562,16820 _dld_getsym_soft 597,17623 _dld_malloc 289,10004 _dld_patch_all_files 1645,47694 _dld_unlink_entry 2061,57982 clean_up 1860,53243 cleanup_obsolete_entries 1776,51248 cleanup_symtab 756,22625 concat 303,10266 decode_library_subfile 857,25313 dld_function_executable_p 2097,58772 dld_get_bare_symbol 2038,57445 dld_init 1925,54598 dld_link 1987,56238 do_local_relocation 1190,35332 do_unlink 1887,53910 enter_file_symbols 743,22259 fatal 279,9838 file_close 345,11261 file_open 357,11568 find_all_executable_modules 1710,49520 hash_string 543,16500 insert_entry 321,10780 invalidate 1690,49094 kill_entry 1809,52087 linear_library 1066,31684 make_entry 1522,44038 perform_relocation 1423,41646 read_entry_strings 481,14684 read_entry_symbols 444,13736 read_file_symbols 1548,44832 read_header 390,12260 read_text_and_data 1586,45835 reloc_info_ok 507,15456 relocate_entry_symbols 1624,47109 relocate_local_refs 1323,38649 relocate_symbol_address 1147,33863 remove_cross_references 1744,50427 search_library 824,24333 st_read_header 411,12712 subfile_wanted_p 1114,32927 symdef_library 913,26917 dld.h,0 error.c,20 dld_perror 47,1657 find_exec.c,119 #define ABSOLUTE_FILENAME_P(46,1242 #define ABSOLUTE_FILENAME_P(49,1341 copy_of 32,996 dld_find_executable 53,1423 get_func.c,21 dld_get_func 25,735 get_symbol.c,23 dld_get_symbol 26,727 list_undef.c,31 dld_list_undefined_sym 31,873 mk_dummy.c,32 _dld_create_dummy_entry 25,705 ref.c,29 dld_create_reference 29,893 remove.c,34 dld_remove_defined_symbol 28,780 ul_file.c,49 dld_unlink_by_file 48,1171 search_files 24,656 ul_symbol.c,29 dld_unlink_by_symbol 24,654 octave-1.1.0/dld/TODO100666 415 17 3150 5021123034 12357 0ustar jweusersSupport for G++'s constructors? port dld to Decstation. port to systems that use COFF format. function to return the name of a symbol given its address. A "bind-name-to-address" function. That is, the storage for the variable has already been allocated by other (non-dld) functions, and want to enter a symtab entry that points to this location. handle the problem of I-cache: When removing/replacing any functions, the I-cache (if there is one) should be flushed--just in case. make the N_COMM data block contiguous: put down the offset into the N_COMM area as the symbol's value in the first pass, eliminate the linked-list altogether, and add to the symbol's value the starting address of the N_COMM area when I do the relocation of other symbol addresses--because I need to go through the nlists during the relocation phase anyway. autoload option -- defer linking until it is necessary. compile options to specify whether '_' should be prepended to C symbols. separate program to massage the executable file --> remove everything but global symbol definitions. So that dld_init can be speed up and use less memory (esp. for programs with large debugging symtab). higher level interface to the symtab and unlink functions call_func (func, args); add in support to link (mmap) in SunOS 4's shared library. *maybe* : provide support for multiple symbol tables--kind of like the idea of "package" as in Lisp. This allows different package to define the same global symbol and so on. But don't know how this should be intergrate with C's scope rules, or if there is any conflict with them. Need to think about this more. octave-1.1.0/dld/define.c100666 415 17 3300 5637142130 13275 0ustar jweusers/* define.c -- explicitly define a named symbol. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* * explicitly define the value for symbol NAME. * * SIZE is the number of bytes required. */ int dld_define_sym (name, size) char *name; unsigned int size; { register char *p = 0; struct nlist dummy_nlist; /* simulate a nlist entry so that _dld_entery_global_ref can be used. */ register int old_undefined_sym_count; if (name == 0 || size == 0) return 0; if (setjmp (_dld_env)) { if (p) free (p); return dld_errno; } if (_dld_dummy_entry == 0) _dld_create_dummy_entry (); bzero (&dummy_nlist, sizeof (struct nlist)); p = (char *) _dld_malloc (strlen(name) +2); *p = '_'; strcpy (p+1, name); dummy_nlist.n_un.n_name = p; dummy_nlist.n_type = N_UNDF | N_EXT; dummy_nlist.n_value = size; old_undefined_sym_count = dld_undefined_sym_count; _dld_enter_global_ref (_dld_dummy_entry, &dummy_nlist, p); free (p); if (old_undefined_sym_count != dld_undefined_sym_count) { _dld_patch_all_files (_dld_latest_entry); _dld_exec_flags_valid = 0; } return 0; } /* dld_define_sym */ octave-1.1.0/dld/dld.c100666 415 17 167453 5650275223 12677 0ustar jweusers/* dld -- dynamic link/unlink editor for C Copyright (C) 1990 by W. Wilson Ho. Version 3.2.3 The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. This program borrows and modifies a number of functions and data structures from the implementation of the GNU `ld' link editor. The original copyleft notice from the GNU `ld' is also included. */ /* Linker `ld' for GNU Copyright (C) 1988 Free Software Foundation, Inc. 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 1, 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., 675 Mass Ave, Cambridge, MA 02139, USA. */ #include "defs.h" #if 0 /* * This part is taken out after the elimination of use of alloca(). */ /* * Alloca include. */ /* If compiled with GNU C, use the built-in alloca */ #ifdef __GNUC__ #define alloca __builtin_alloca #endif #if defined(sun) && defined(sparc) && !defined(__GNUC__) #include #endif #endif /* System dependencies */ #ifdef atarist #include /* _initial_stack determines the amount of memory available as stack/heap, */ /* if it's negative this is the amount available to the system, 1L means */ /* use a ratio of 1:3 (stack:system), 2L means ratio 1:1, 3L stands for 3:1 */ static char __patch_str[] = "{PatchVar}stack = %ld bytes"; extern long _initial_stack = - 100 * 1024L; #endif /* atarist */ /* Ordinary 4.3 bsd lacks these macros in a.out.h */ #ifndef N_TXTADDR #ifdef vax #define N_TXTADDR(x) 0 #endif #ifdef sequent #define N_TXTADDR(x) (N_ADDRADJ(x)) #endif #endif #ifndef N_DATADDR #ifdef vax #define N_DATADDR(x) \ (((x).a_magic == OMAGIC) ? (N_TXTADDR(x)+(x).a_text) \ : (page_size + ((N_TXTADDR(x)+(x).a_text-1) & ~(page_size-1)))) #endif #ifdef sequent #define N_DATADDR(x) \ (((x).a_magic==OMAGIC)? (N_TXTADDR(x)+(x).a_text) \ : (page_size+(((x).a_text-1) & ~(page_size-1)))) #endif #endif #ifndef N_BSSADDR #ifdef vax #define N_BSSADDR(x) (N_DATADDR(x)+(x).a_data) #endif #endif /* * Ok. Following are the relocation information macros. If your * system cannot use the default set (below), you must define all of these: * relocation_info: This must be typedef'd (or #define'd) to the type * of structure that is stored in the relocation info section of your * a.out files. Often this is defined in the a.out.h for your system. * * RELOC_ADDRESS (rval): Offset into the current section of the * to be relocated. *Must be an lvalue*. * * RELOC_EXTERN_P (rval): Is this relocation entry based on an * external symbol (1), or was it fully resolved upon entering the * loader (0) in which case some combination of the value in memory * (if RELOC_MEMORY_ADD_P) and the extra (if RELOC_ADD_EXTRA) contains * what the value of the relocation actually was. *Must be an lvalue*. * * RELOC_SYMBOL (rval): For an external relocation, this is the * index of its symbol in the symbol table. *Must be an lvalue*. * * RELOC_PCREL_P (rval): True if the relocation value described is * pc relative. * * RELOC_MEMORY_SUB_P (rval): If this is nonzero, the value previously * present in the memory location to be relocated is *subtracted* * from the relocation value, to produce the final result. * By default, this is always 0. * * RELOC_ADD_EXTRA (rval): (Optional) This macro, if defined, gives * an extra value to be added to the relocation value based on the * individual relocation entry. *Must be an lvalue if defined*. * * RELOC_VALUE_RIGHTSHIFT (rval): Number of bits right to shift the * final relocation value before putting it where it belongs. * * RELOC_TARGET_SIZE (rval): log to the base 2 of the number of * bytes of size this relocation entry describes; 1 byte == 0; 2 bytes * == 1; 4 bytes == 2, and etc. This is somewhat redundant (we could * do everything in terms of the bit operators below), but having this * macro could end up producing better code on machines without fancy * bit twiddling. Also, it's easier to understand/code big/little * endian distinctions with this macro. * * RELOC_TARGET_BITSIZE (rval): How many bits are to be replaced * with the bits of the relocation value. It may be assumed by the * code that the relocation value will fit into this many bits. This * may be larger than RELOC_TARGET_SIZE if such be useful. * * * Things I haven't implemented * ---------------------------- * * Values for RELOC_TARGET_SIZE other than 0, 1, or 2. * * Pc relative relocation for External references. * * */ #if defined(sun) && defined(sparc) /* Sparc (Sun 4) macros */ #undef relocation_info #define relocation_info reloc_info_sparc #define RELOC_ADDRESS(r) ((r)->r_address) #define RELOC_EXTERN_P(r) ((r)->r_extern) #define RELOC_SYMBOL(r) ((r)->r_index) #define RELOC_MEMORY_SUB_P(r) 0 #define RELOC_ADD_EXTRA(r) ((r)->r_addend) #define RELOC_PCREL_P(r) \ ((r)->r_type >= RELOC_DISP8 && (r)->r_type <= RELOC_WDISP22) #define RELOC_VALUE_RIGHTSHIFT(r) (reloc_target_rightshift[(r)->r_type]) #define RELOC_TARGET_SIZE(r) (reloc_target_size[(r)->r_type]) #define RELOC_TARGET_BITSIZE(r) (reloc_target_bitsize[(r)->r_type]) /* Note that these are very dependent on the order of the enums in enum reloc_type (in a.out.h); if they change the following must be changed */ /* Also note that the last few may be incorrect; I have no information */ static int reloc_target_rightshift[] = { 0, 0, 0, 0, 0, 0, 2, 2, 10, 0, 0, 0, 0, 0, 0, }; static int reloc_target_size[] = { 0, 1, 2, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, }; static int reloc_target_bitsize[] = { 8, 16, 32, 8, 16, 32, 30, 22, 22, 22, 13, 10, 32, 32, 16, }; #endif #if defined(sequent) #define RELOC_ADDRESS(r) ((r)->r_address) #define RELOC_EXTERN_P(r) ((r)->r_extern) #define RELOC_SYMBOL(r) ((r)->r_symbolnum) #define RELOC_MEMORY_SUB_P(r) ((r)->r_bsr) #undef RELOC_ADD_EXTRA #define RELOC_PCREL_P(r) ((r)->r_pcrel || (r)->r_bsr) #define RELOC_TARGET_SIZE(r) ((r)->r_length) #endif /* Default macros */ #ifndef RELOC_ADDRESS #define RELOC_ADDRESS(r) ((r)->r_address) #define RELOC_EXTERN_P(r) ((r)->r_extern) #define RELOC_SYMBOL(r) ((r)->r_symbolnum) #define RELOC_MEMORY_SUB_P(r) 0 #undef RELOC_ADD_EXTRA #define RELOC_PCREL_P(r) ((r)->r_pcrel) #define RELOC_TARGET_SIZE(r) ((r)->r_length) #endif /* Size of a page; obtained from the operating system. */ static int page_size; /* The symbol hash table: a vector of TABSIZE pointers to struct glosym. */ symbol *_dld_symtab[TABSIZE]; /* Count the number of global symbols referenced and not defined. */ int dld_undefined_sym_count = 0; /* internal format of relocation info entry. */ struct dld_reloc_info { /* corresponding symbol table entry. */ symbol *sp; /* The real relocation info entry. This is an ugly design. In the original relocation_info structure. The corresponding symbol definition is located by an index to the nlist array. This array is not kept online, and so this index must be replace by the address of the corresponding symbol table kept online. However, on most machine this index takes only 24bits, which is not large enough (in general) to hold a pointer. So we need a structure definition with a sp field as shown above. The complete original relocation info entry is kept here. This is not very space economical (24 bits are wasted). But since different system has different format for STRUCT RELOCATION_INFO, I'd rather let the include file take care of the difference, than using a separate definition for each system. */ struct relocation_info reloc_info; }; /* Format of __.SYMDEF: First, a longword containing the size of the 'symdef' data that follows. Second, zero or more 'symdef' structures. Third, a word containing the length of symbol name strings. Fourth, zero or more symbol name strings (each followed by a zero). */ struct symdef { int symbol_name_string_index; int library_member_offset; }; /* variable for saving the environment */ jmp_buf _dld_env; /* pointer to the lastest (newest) file entry */ struct file_entry *_dld_latest_entry = 0; /* dummy file_entry to hold all "dangling" symbols. */ struct file_entry *_dld_dummy_entry = 0; /* To avoid close a file and then open the same file again, the following two variables remember the file that is currently open. Both are zero if no file is open. */ static struct file_entry *input_file = 0; static int input_desc = 0; /* global variables to return the error code to the caller */ int dld_errno; /* true if the executable flags are up-to-date */ char _dld_exec_flags_valid; /* Miscellaneous routines */ /* save the error code in dld_errno */ static void fatal (errno) register int errno; { dld_errno = errno; longjmp (_dld_env, 1); } /* fatal */ /* Like malloc but get fatal error if memory is exhausted. */ int _dld_malloc (size) int size; { register int result = malloc (size); if (!result) fatal (DLD_ENOMEMORY); return result; } /* _dld_malloc */ /* Return a newly-allocated string whose contents concatenate the strings S1, S2, S3. */ static char * concat (s1, s2, s3) char *s1, *s2, *s3; { register int len1 = strlen (s1), len2 = strlen (s2), len3 = strlen (s3); register char *result = (char *) _dld_malloc (len1 + len2 + len3 + 1); strcpy (result, s1); strcpy (result + len1, s2); strcpy (result + len1 + len2, s3); result[len1 + len2 + len3] = 0; return result; } /* concat */ /* Add a new entry to the file chain if it is not already there. Return 0 if no actual insertion is needed, otherwise, return 1. */ static int insert_entry (head, entry) struct file_chain **head; register struct file_entry *entry; { register struct file_chain *fc = *head; while (fc) { if (fc->entry == entry) return 0; else fc = fc->next; } fc = (struct file_chain *) _dld_malloc (sizeof (struct file_chain)); fc->next = *head; fc->entry = entry; *head = fc; return 1; } /* insert_entry */ /* Close the input file that is now open. */ static void file_close () { if (input_desc) close (input_desc); input_desc = 0; input_file = 0; } /* file_close */ /* Open the input file specified by 'entry', and return a descriptor. The open file is remembered; if the same file is opened twice in a row, a new open is not actually done. */ static int file_open (entry) register struct file_entry *entry; { register int desc; if (entry == 0) fatal (DLD_ENOFILE); if (entry->superfile) return file_open (entry->superfile); if (entry == input_file) return input_desc; if (input_file) file_close (); desc = open (entry->filename, O_RDONLY, 0); if (desc > 0) { input_file = entry; input_desc = desc; return desc; } fatal (DLD_ENOFILE); } /* file_open */ /* Medium-level input routines for rel files. */ /* Read a file's header into the proper place in the file_entry. DESC is the descriptor on which the file is open. ENTRY is the file's entry. */ static void read_header (desc, entry) int desc; register struct file_entry *entry; { register int len; struct exec *loc = &entry->header; lseek (desc, entry->starting_offset, 0); len = read (desc, loc, sizeof (struct exec)); if (len != sizeof (struct exec)) fatal (DLD_EBADHEADER); if (N_BADMAG (*loc)) fatal (DLD_EBADMAGIC); entry->header_read_flag = 1; } /* read_header */ #ifdef atarist #include static void st_read_header (desc, entry) int desc; register struct file_entry *entry; { register int len; struct exec *loc = &entry->header; struct aexec file_header; lseek (desc, 0L, 0); len = read (desc, &file_header, sizeof (struct aexec)); if (len != sizeof (struct aexec)) fatal (DLD_EBADHEADER); if (A_BADMAG (file_header)) fatal (DLD_EBADMAGIC); if (!file_header.a_AZero2) fatal (DLD_ENOSTRINGS); bzero (loc, sizeof (struct exec)); loc->a_magic = NMAGIC; /* flag different header size */ loc->a_text = file_header.a_text; loc->a_data = file_header.a_data; loc->a_bss = file_header.a_bss; loc->a_syms = file_header.a_syms - file_header.a_AZero2; entry->header_read_flag = 1; } /* st_read_header */ #endif /* atarist */ /* Read the symbols of file ENTRY into core. Assume it is already open, on descriptor DESC. Also read the length of the string table, which follows the symbol table, but don't read the contents of the string table. */ static void read_entry_symbols (desc, entry) struct file_entry *entry; int desc; { int str_size; if (!entry->header_read_flag) read_header (desc, entry); if (entry->header.a_syms <= 0) fatal (DLD_ENOSYMBOLS); entry->symbols = (struct nlist *) _dld_malloc (entry->header.a_syms); lseek (desc, N_SYMOFF (entry->header) + entry->starting_offset, 0); if (entry->header.a_syms != read (desc, entry->symbols, entry->header.a_syms)) { free (entry->symbols); entry->symbols = 0; fatal (DLD_ENOSYMBOLS); } lseek (desc, N_STROFF (entry->header) + entry->starting_offset, 0); if (sizeof str_size != read (desc, &str_size, sizeof str_size)) { free (entry->symbols); entry->symbols = 0; fatal (DLD_ENOSTRINGS); } entry->string_size = str_size; } /* read_entry_symboles */ /* Read the string table of file ENTRY into core. Assume it is already open, on descriptor DESC. */ static void read_entry_strings (desc, entry) struct file_entry *entry; int desc; { if (!entry->header_read_flag) read_header (desc, entry); entry->strings = (char *) _dld_malloc (entry->string_size); lseek (desc, N_STROFF (entry->header) + entry->starting_offset, 0); if (entry->string_size != read (desc, entry->strings, entry->string_size)) { free (entry->strings); entry->strings = 0; fatal (DLD_ENOSTRINGS); } } /* read_entry_strings */ /* Verify the validity of the relocation information. DATA_SIZE is the length of the contents. RELOC_INFO is the address of the relocation info, in core. RELOC_SIZE is its length in bytes. If everything is ok, return the number of external relocation entry. Otherwise, return -1. */ int reloc_info_ok (data_size, reloc_info, reloc_size, sym_size) register int data_size; register struct relocation_info *reloc_info; register int reloc_size; register int sym_size; { register struct relocation_info *p = reloc_info; register struct relocation_info *end = p + reloc_size / sizeof (struct relocation_info); register int extern_count = 0; /* number of external relocation */ for (; p < end; p++) { register int symbolnum = RELOC_SYMBOL(p); if (RELOC_ADDRESS(p) >= data_size) return -1; if (RELOC_EXTERN_P(p)) { extern_count++; if (symbolnum * sizeof (struct nlist) >= sym_size) return -1; } else if (symbolnum != N_TEXT && symbolnum != (N_TEXT | N_EXT) && symbolnum != N_DATA && symbolnum != (N_DATA | N_EXT) && symbolnum != N_BSS && symbolnum != (N_BSS | N_EXT)) return -1; if (RELOC_TARGET_SIZE(p) > 2) return -1; } return extern_count++; } /* reloc_info_ok */ /* symbol table management */ /* Compute the hash code for symbol name KEY. */ static int hash_string (key) char *key; { register char *cp; register int k; cp = key; k = 0; while (*cp) k = (((k << 1) + (k >> 14)) ^ (*cp++)) & 0x3fff; return k; } /* hash_string */ /* Get the symbol table entry for the global symbol named KEY. Create one if there is none. */ symbol * _dld_getsym (key) char *key; { register int hashval; register symbol *bp; /* Determine the proper bucket. */ hashval = hash_string (key) % TABSIZE; /* Search the bucket. */ for (bp = _dld_symtab[hashval]; bp; bp = bp->link) if (! strcmp (key, bp->name)) return bp; /* Nothing was found; create a new symbol table entry. */ bp = (symbol *) _dld_malloc (sizeof (symbol)); bzero (bp, sizeof (symbol)); bp->name = (char *) _dld_malloc (strlen (key) + 1); strcpy (bp->name, key); /* Add the entry to the bucket. */ bp->link = _dld_symtab[hashval]; _dld_symtab[hashval] = bp; return bp; } /* _dld_getsym */ /* Like `_dld_getsym' but return 0 if the symbol is not already known. */ symbol * _dld_getsym_soft (key) char *key; { register int hashval; register symbol *bp; /* Determine which bucket. */ hashval = hash_string (key) % TABSIZE; /* Search the bucket. */ for (bp = _dld_symtab[hashval]; bp; bp = bp->link) if (! strcmp (key, bp->name)) return bp; return 0; } /* _dld_getsym_soft */ /* Enter one global symbol in the hash table. NLIST_P points to the `struct nlist' read from the file that describes the global symbol. NAME is the symbol's name. ENTRY is the file entry for the file the symbol comes from. The `struct nlist' is modified by making n_name point back to the corresponding symbols. For the common definition, the symbol is considered defined by the first entry that defines it. The problem here is that uninitialized global variables are all treated as common definitions. Strictly speacking, in a program there should be exactly one definition (initialized or uninitialized) of any global variable and all other files that reference that variable should declare it with the 'extern' keyword. However, most compiler allows the omission of the 'extern' keyword, and let the linker map all these definitions to the same location. In other words, multiple definitions of the same symbol is allowed. Now, when one of the files that defines such symbol is to be unlinked, should this symbol become undefined? Or should it remain in core? The decision made is to treat the symbol defined by the first file that defines it. All subsequence definitions of the same symbol will be treated as extern references. However, if any of the following definition defines the symbol as initialized global, it will be considered multiple definition and be treated as an error. */ void _dld_enter_global_ref (entry, nlist_p, name) struct file_entry *entry; register struct nlist *nlist_p; char *name; { register symbol *sp = _dld_getsym (name); register int type = nlist_p->n_type; register int common = (type == (N_UNDF | N_EXT) && nlist_p->n_value); int oldref = sp->referenced; int olddef = sp->defined; nlist_p->n_un.n_name = (char *) sp; sp->referenced = 1; /* common definition */ if (common && !olddef) #ifndef linux type = N_COMM | N_EXT; #else type = N_TYPE | N_EXT; #endif if (type != (N_UNDF | N_EXT)) { /* definition of a symbol */ if (olddef) fatal (DLD_EMULTDEFS); else { sp->defined = type; sp->value = common ? (long) _dld_malloc (nlist_p->n_value) : nlist_p->n_value; if (common) bzero (sp->value, nlist_p->n_value); sp->defined_by = entry; } if (oldref && !olddef) { register struct file_chain *p = sp->referenced_by; register struct file_chain *prev = 0; dld_undefined_sym_count--; /* We do not set up references link to and from the dummy entry, nor do we touch the ref_count of it. Furthermore, if a symbol referenced by the dummy entry is defined, we remove all connections between the dummy entry and this symbol. */ /* If the dummy entry references anything other than a library member, this reference is removed. */ while (p) { if (entry != _dld_dummy_entry) { if (p->entry == _dld_dummy_entry && entry->superfile) entry->ref_count++; else if (insert_entry (&(p->entry->refs), entry) && insert_entry (&(entry->refs_by), p->entry) && p->entry != entry) entry->ref_count++; } if (p->entry == _dld_dummy_entry) { /* we force this to be an entry directly linked-in by the user (top-level module). */ entry->already_unlink = 0; del_link_list_elt (sp->referenced_by, prev, p, next); continue; } else p->entry->undefined_symbol_count--; prev = p; p = p->next; } } } else { /* this is just a reference */ if (sp->defined_by && sp->defined_by != _dld_dummy_entry) if (entry != _dld_dummy_entry) { if (insert_entry (&(entry->refs), sp->defined_by) && entry != sp->defined_by) sp->defined_by->ref_count++; } else if (sp->defined_by->superfile) { sp->defined_by->ref_count++; sp->defined_by->already_unlink = 0; } if (entry != _dld_dummy_entry) { if (insert_entry (&(sp->referenced_by), entry) && !sp->defined) entry->undefined_symbol_count++; } else { if (!sp->defined) insert_entry (&(sp->referenced_by), entry); } if (!oldref) { dld_undefined_sym_count++; sp->defined = 0; sp->value = 0; } } } /* Enter the external symbol defs and refs of ENTRY in the hash table. */ static void enter_file_symbols (entry) struct file_entry *entry; { register struct nlist *p, *end = entry->symbols + entry->header.a_syms / sizeof (struct nlist); for (p = entry->symbols; p < end; p++) #ifdef linux if (p->n_type & N_EXT) { if (p->n_type == (N_INDR | N_EXT)) { symbol *sp; /* Enter an indirect symbol and the following undefined symbol as it's reference (see ".../linux/a.out.h") */ /* First enter the referenced symbol */ _dld_enter_global_ref (entry, p+1, (p+1)->n_un.n_strx + entry->strings); /* Get the address of the corresponding 'struct glosym' */ sp = (symbol *)((p+1)->n_un.n_name); /* Now enter the indirect symbol (alias) */ _dld_enter_global_ref (entry, p, p->n_un.n_strx + entry->strings); /* Make 'indirect' point to the referenced symbol */ ((symbol *)(p->n_un.n_name))->indirect = sp; p++; } else _dld_enter_global_ref (entry, p, p->n_un.n_strx + entry->strings); } #else if (p->n_type & N_EXT) _dld_enter_global_ref (entry, p, p->n_un.n_strx + entry->strings); #endif } /* remove all symbols that are no longer needed */ static void cleanup_symtab () { register int i; for (i = 0; i < TABSIZE; i++) { register symbol *sp = _dld_symtab[i]; register symbol *prev_sp = 0; while (sp) { register struct file_chain *p = sp->referenced_by; register struct file_chain *prev = 0; register int obsolete = (sp->defined_by && sp->defined_by->ref_count == 0); while (p) if (p->entry->ref_count == 0) { del_link_list_elt (sp->referenced_by, prev, p, next); } else { if (obsolete) p->entry->undefined_symbol_count++; prev = p; p = p->next; } if (obsolete) { #ifndef linux if (sp->defined == (N_COMM | N_EXT) && sp->value) #else if (sp->defined == (N_TYPE | N_EXT) && sp->value) #endif free (sp->value); if (sp->referenced_by == 0) { free (sp->name); del_link_list_elt (_dld_symtab[i], prev_sp, sp, link); continue; } else { dld_undefined_sym_count++; sp->defined = 0; sp->defined_by = 0; sp->value = 0; } } if (sp->defined == 0 && sp->referenced_by == 0) { dld_undefined_sym_count--; free (sp->name); #ifndef linux if (sp->defined == (N_COMM | N_EXT) && sp->value) #else if (sp->defined == (N_TYPE | N_EXT) && sp->value) #endif free (sp->value); del_link_list_elt (_dld_symtab[i], prev_sp, sp, link); continue; } prev_sp = sp; sp = sp->link; } } } /* cleanup_symtab */ /* Searching libraries */ static struct file_entry *decode_library_subfile (); static void linear_library (), symdef_library (); static int subfile_wanted_p (); static void read_text_and_data (); /* Search the library ENTRY, already open on descriptor DESC. This means deciding which library members to load, making a chain of `struct file_entry' for those members, and entering their global symbols in the hash table. */ static void search_library (desc, entry) int desc; struct file_entry *entry; { int member_length; register char *name; register struct file_entry *subentry; if (!dld_undefined_sym_count) return; /* Examine its first member, which starts SARMAG bytes in. */ subentry = decode_library_subfile (desc, entry, SARMAG, &member_length); if (!subentry) return; name = subentry->filename; free (subentry); /* Search via __.SYMDEF if that exists, else linearly. */ #ifdef linux if (!strcmp (name, "__.SYMDEF/")) #else if (!strcmp (name, "__.SYMDEF")) #endif symdef_library (desc, entry, member_length); else linear_library (desc, entry); free (name); } /* search_library */ /* Construct and return a file_entry for a library member. The library's file_entry is library_entry, and the library is open on DESC. SUBFILE_OFFSET is the byte index in the library of this member's header. We store the length of the member into *LENGTH_LOC. */ static struct file_entry * decode_library_subfile (desc, library_entry, subfile_offset, length_loc) int desc; struct file_entry *library_entry; int subfile_offset; int *length_loc; { int bytes_read; register int namelen; int member_length; register char *name; struct ar_hdr hdr1; register struct file_entry *subentry; lseek (desc, subfile_offset, 0); bytes_read = read (desc, &hdr1, sizeof hdr1); if (!bytes_read) return 0; /* end of archive */ if (sizeof hdr1 != bytes_read) fatal (DLD_EBADLIBRARY); if (sscanf (hdr1.ar_size, "%d", &member_length) != 1) fatal (DLD_EBADLIBRARY); subentry = (struct file_entry *) _dld_malloc (sizeof (struct file_entry)); bzero (subentry, sizeof (struct file_entry)); for (namelen = 0; namelen < sizeof hdr1.ar_name && hdr1.ar_name[namelen] != 0 && hdr1.ar_name[namelen] != ' '; namelen++); name = (char *) _dld_malloc (namelen+1); strncpy (name, hdr1.ar_name, namelen); name[namelen] = 0; subentry->filename = name; subentry->local_sym_name = name; subentry->starting_offset = subfile_offset + sizeof hdr1; subentry->superfile = library_entry; subentry->total_size = member_length; (*length_loc) = member_length; return subentry; } /* decode_library_subfile */ /* Search a library that has a __.SYMDEF member. DESC is a descriptor on which the library is open. The file pointer is assumed to point at the __.SYMDEF data. ENTRY is the library's file_entry. MEMBER_LENGTH is the length of the __.SYMDEF data. */ static void symdef_library (desc, entry, member_length) int desc; struct file_entry *entry; int member_length; { int *symdef_data = (int *) _dld_malloc (member_length); register struct symdef *symdef_base; char *sym_name_base; int number_of_symdefs; int length_of_strings; int not_finished; int bytes_read; register int i; struct file_entry *prev = 0; int prev_offset = 0; bytes_read = read (desc, symdef_data, member_length); if (bytes_read != member_length) { free (symdef_data); fatal (DLD_EBADLIBRARY); } /* Ugly kludge here: save the address for symdef_data in entry->strings so that if fatal() is called, this memory block will be freed by clean_up(). If no error occurs, it is freed before this function returns. I use entry->strings just for convenience and don't want to add an extra entry in struct file_entry. Originally storage for symdef_data was allocated by alloca(), but I want to avoid the use of that. */ entry->strings = (char *) symdef_data; number_of_symdefs = *symdef_data / sizeof (struct symdef); if (number_of_symdefs < 0 || number_of_symdefs * sizeof (struct symdef) + 2 * sizeof (int) >= member_length) fatal (DLD_EBADLIBRARY); symdef_base = (struct symdef *) (symdef_data + 1); length_of_strings = *(int *) (symdef_base + number_of_symdefs); if (length_of_strings < 0 || number_of_symdefs * sizeof (struct symdef) + length_of_strings + 2 * sizeof (int) != member_length) fatal (DLD_EBADLIBRARY); sym_name_base = sizeof (int) + (char *) (symdef_base + number_of_symdefs); /* Check all the string indexes for validity. */ for (i = 0; i < number_of_symdefs; i++) { register int index = symdef_base[i].symbol_name_string_index; if (index < 0 || index >= length_of_strings || (index && *(sym_name_base + index - 1))) fatal (DLD_EBADLIBRARY); } /* Search the symdef data for members to load. Do this until one whole pass finds nothing to load. */ not_finished = 1; while (not_finished) { not_finished = 0; /* Scan all the symbols mentioned in the symdef for ones that we need. Load the library members that contain such symbols. */ for (i = 0; i < number_of_symdefs && dld_undefined_sym_count; i++) if (symdef_base[i].symbol_name_string_index >= 0) { register symbol *sp; sp = _dld_getsym_soft (sym_name_base + symdef_base[i].symbol_name_string_index); /* If we find a symbol that appears to be needed, think carefully about the archive member that the symbol is in. */ if (sp && sp->referenced && !sp->defined) { int junk; register int j; register int offset = symdef_base[i].library_member_offset; struct file_entry *subentry; /* Don't think carefully about any archive member more than once in a given pass. */ if (prev_offset == offset) continue; prev_offset = offset; /* Read the symbol table of the archive member. */ subentry = decode_library_subfile (desc, entry, offset, &junk); if (prev) prev->chain = subentry; else entry->subfiles = subentry; read_entry_symbols (desc, subentry); read_entry_strings (desc, subentry); /* Now scan the symbol table and decide whether to load. */ if (!subfile_wanted_p (subentry)) { if (prev) prev->chain = 0; else entry->subfiles = 0; free (subentry->filename); free (subentry->symbols); free (subentry->strings); free (subentry); } else { /* This member is needed; load it. Since we are loading something on this pass, we must make another pass through the symdef data. */ not_finished = 1; /* all library members are considered unlinked already so that they will be garbage collected whenever no other modules reference them. */ subentry->already_unlink = 1; enter_file_symbols (subentry); free (subentry->strings); subentry->strings = 0; read_text_and_data (desc, subentry); prev = subentry; /* Clear out this member's symbols from the symdef data so that following passes won't waste time on them. */ for (j = 0; j < number_of_symdefs; j++) { if (symdef_base[j].library_member_offset == offset) symdef_base[j].symbol_name_string_index = -1; } } } } } /* refer to "Ugly kludge" above. */ free (entry->strings); entry->strings = 0; } /* symdef_library */ /* Search a library that has no __.SYMDEF. ENTRY is the library's file_entry. DESC is the descriptor it is open on. */ static void linear_library (desc, entry) int desc; struct file_entry *entry; { register struct file_entry *prev = 0; register int this_subfile_offset = SARMAG; while (dld_undefined_sym_count) { int member_length; register struct file_entry *subentry; subentry = decode_library_subfile (desc, entry, this_subfile_offset, &member_length); if (!subentry) return; read_entry_symbols (desc, subentry); read_entry_strings (desc, subentry); if (!subfile_wanted_p (subentry)) { free (subentry->filename); free (subentry->symbols); free (subentry->strings); free (subentry); } else { subentry->already_unlink = 1; enter_file_symbols (subentry); free (subentry->strings); subentry->strings = 0; read_text_and_data (desc, subentry); if (prev) prev->chain = subentry; else entry->subfiles = subentry; prev = subentry; } this_subfile_offset += member_length + sizeof (struct ar_hdr); if (this_subfile_offset & 1) this_subfile_offset++; } } /* linear_library */ /* ENTRY is an entry for a library member. Its symbols have been read into core, but not entered. Return nonzero if we ought to load this member. */ static int subfile_wanted_p (entry) struct file_entry *entry; { register struct nlist *p; register struct nlist *end = entry->symbols + entry->header.a_syms / sizeof (struct nlist); for (p = entry->symbols; p < end; p++) { register int type = p->n_type; if (type & N_EXT && (type != (N_UNDF | N_EXT) || p->n_value)) { register char *name = p->n_un.n_strx + entry->strings; register symbol *sp = _dld_getsym_soft (name); /* If this symbol has not been hashed, we can't be looking for it. */ if (!sp) continue; /* We are looking for definition of external symbols or common blocks that have not been defined but have been referenced */ if (sp->referenced && !sp->defined && (type != (N_UNDF | N_EXT) || p->n_value)) return 1; } } return 0; } /* subfile_wanted_p */ /* Relocate the addresses of the file's symbols. */ static void relocate_symbol_address (entry) register struct file_entry *entry; { register struct nlist *p; register struct nlist *end = entry->symbols + entry->header.a_syms / sizeof (struct nlist); register int text_relocation, data_relocation, bss_relocation; text_relocation = entry->text_start_address; data_relocation = entry->data_start_address - entry->header.a_text; bss_relocation = entry->bss_start_address - entry->header.a_text - entry->header.a_data; for (p = entry->symbols; p < end; p++) { /* If this belongs to a section, update it by the section's start address */ register int type = p->n_type; register symbol *sp; if ((type & N_EXT) == 0) continue; sp = (symbol *) p->n_un.n_name; if (type == (N_TEXT | N_EXT)) sp->value += text_relocation; else if (type == (N_DATA | N_EXT)) /* A symbol whose value is in the data section is present in the input file as if the data section started at an address equal to the length of the file's text. */ sp->value += data_relocation; else if (type == (N_BSS | N_EXT)) /* likewise for symbols with value in BSS. */ sp->value += bss_relocation; } } /* relocate_symbol_address */ /* Actually performs the relocation of local symbols. Do it once and for all for each entry. Then keep only those with external references online. This function is copied almost directly from perform_relocation (). */ static void do_local_relocation (data, pc_relocation, reloc_info, dld_reloc_p, reloc_size, entry) char *data; struct relocation_info *reloc_info; struct dld_reloc_info *dld_reloc_p; struct file_entry *entry; int pc_relocation; int reloc_size; { register struct relocation_info *p = reloc_info; struct relocation_info *end = reloc_info + reloc_size / sizeof (struct relocation_info); int text_relocation = entry->text_start_address; int data_relocation = entry->data_start_address - entry->header.a_text; int bss_relocation = entry->bss_start_address - entry->header.a_text - entry->header.a_data; for (; p < end; p++) { register int relocation = 0; register int addr = RELOC_ADDRESS(p); register int symbolnum = RELOC_SYMBOL(p); #if defined(sun) && defined(sparc) register unsigned int mask = 0; #else register int length = RELOC_TARGET_SIZE(p); #endif if (RELOC_EXTERN_P(p)) { register int symindex = symbolnum * sizeof (struct nlist); dld_reloc_p->sp = ((symbol *) (((struct nlist *) (((char *)entry->symbols) + symindex)) ->n_un.n_name)); bcopy (p, &(dld_reloc_p->reloc_info), sizeof (struct relocation_info)); dld_reloc_p++; continue; } else switch (symbolnum) { case N_TEXT: case N_TEXT | N_EXT: relocation = text_relocation; break; case N_DATA: case N_DATA | N_EXT: /* A word that points to beginning of the the data section initially contains not 0 but rather the "address" of that section in the input file, which is the length of the file's text. */ relocation = data_relocation; break; case N_BSS: case N_BSS | N_EXT: /* Similarly, an input word pointing to the beginning of the bss initially contains the length of text plus data of the file. */ relocation = bss_relocation; break; case N_ABS: case N_ABS | N_EXT: /* just in case */ break; default: break; } if (RELOC_PCREL_P(p)) relocation -= pc_relocation; #if defined(sun) && defined(sparc) relocation += RELOC_ADD_EXTRA(p); relocation >>= RELOC_VALUE_RIGHTSHIFT(p); /* Unshifted mask for relocation */ mask = 1 << (RELOC_TARGET_BITSIZE(p) - 1); mask |= mask - 1; relocation &= mask; switch (RELOC_TARGET_SIZE(p)) { case 0: *(char *) (data + addr) &= ~mask; *(char *) (data + addr) |= relocation; break; case 1: *(short *) (data + addr) &= ~mask; *(short *) (data + addr) |= relocation; break; case 2: *(long *) (data + addr) &= ~mask; *(long *) (data + addr) |= relocation; break; default: break; } #else switch (length) { case 0: *(char *) (data + addr) += relocation; break; case 1: *(short *) (data + addr) += relocation; break; case 2: *(int *) (data + addr) += relocation; break; default: break; } #endif } } /* do_local_relocation */ /* Read the relocation information of file ENTRY into core. Assume it is already open, on descriptor DESC. Then relocate all the local (non-external) symbols. Save only the relocation info for the external symbol references. Update entry->header.a_{trsize,drsize} to reflect the new relocation table size (in bytes). */ static void relocate_local_refs (desc, entry) int desc; struct file_entry *entry; { int text_offset; /* number of relocation info that describes an external references. */ int tr_entry_count = 0, dr_entry_count = 0; struct relocation_info *reloc_buf; if (!entry->header_read_flag) read_header (desc, entry); text_offset = entry->starting_offset + N_TXTOFF (entry->header); /* For the text segment */ if (entry->header.a_trsize) { reloc_buf = (struct relocation_info *) _dld_malloc (entry->header.a_trsize); lseek (desc, text_offset + entry->header.a_text + entry->header.a_data, 0); if (entry->header.a_trsize != read (desc, reloc_buf, entry->header.a_trsize)) { free (reloc_buf); fatal (DLD_ENOTXTRELOC); } if ((tr_entry_count = reloc_info_ok (entry->header.a_text, reloc_buf, entry->header.a_trsize, entry->header.a_syms) ) == -1) { free (reloc_buf); fatal (DLD_EBADRELOC); } else { entry->text_reloc = (struct dld_reloc_info *) _dld_malloc (tr_entry_count * sizeof (struct dld_reloc_info)); do_local_relocation (entry->text_start_address, entry->text_start_address, reloc_buf, entry->text_reloc, entry->header.a_trsize, entry); free (reloc_buf); } } /* For the data segment */ if (entry->header.a_drsize) { reloc_buf = (struct relocation_info *) _dld_malloc (entry->header.a_drsize); lseek (desc, text_offset + entry->header.a_text + entry->header.a_data + entry->header.a_trsize, 0); if (entry->header.a_drsize != read (desc, reloc_buf, entry->header.a_drsize)) { free (reloc_buf); fatal (DLD_ENODATRELOC); } if ((dr_entry_count = reloc_info_ok (entry->header.a_data, reloc_buf, entry->header.a_drsize, entry->header.a_syms) ) == -1) { free (reloc_buf); fatal (DLD_EBADRELOC); } else { entry->data_reloc = (struct dld_reloc_info *) _dld_malloc (dr_entry_count * sizeof (struct dld_reloc_info)); do_local_relocation (entry->data_start_address, entry->data_start_address - entry->header.a_data, reloc_buf, entry->data_reloc, entry->header.a_drsize, entry); free (reloc_buf); } } entry->header.a_trsize = tr_entry_count * sizeof (struct dld_reloc_info); entry->header.a_drsize = dr_entry_count * sizeof (struct dld_reloc_info); /* Free the nlist array. */ if (entry->symbols) { free (entry->symbols); entry->symbols = 0; } } /* relocate_local_refs */ /* Relocate ENTRY's text or data section contents. DATA is the address of the contents, in core. DATA_SIZE is the length of the contents. PC_RELOCATION is the difference between the address of the contents in the output file and its address in the input file. RELOC_INFO is the address of the relocation info, in core. RELOC_SIZE is its length in bytes. REVERSE is true when an 'un-relocation' is to be done. */ static void perform_relocation (data, pc_relocation, reloc_info, reloc_size, reverse) char *data; struct dld_reloc_info *reloc_info; int pc_relocation; int reloc_size; int reverse; { register struct dld_reloc_info *p = reloc_info; struct dld_reloc_info *end = reloc_info + reloc_size / sizeof (struct dld_reloc_info); #if defined(sun) && defined(sparc) if (reverse) return; #endif for (; p < end; p++) { #ifdef linux register int relocation; register symbol *sp = p->sp; #else register int relocation = p->sp->value; #endif register struct relocation_info *r = &(p->reloc_info); register int addr = RELOC_ADDRESS(r); #if defined(sun) && defined(sparc) register unsigned int mask = 0; #else register int length = RELOC_TARGET_SIZE(r); #endif #ifdef linux while (sp->indirect) sp = sp->indirect; relocation = sp->value; #endif if (RELOC_PCREL_P(r)) relocation -= pc_relocation; #if defined(sun) && defined(sparc) relocation += RELOC_ADD_EXTRA(r); relocation >>= RELOC_VALUE_RIGHTSHIFT(r); /* Unshifted mask for relocation */ mask = 1 << (RELOC_TARGET_BITSIZE(r) - 1); mask |= mask - 1; relocation &= mask; switch (RELOC_TARGET_SIZE(r)) { case 0: *(char *) (data + addr) &= ~mask; *(char *) (data + addr) |= relocation; break; case 1: *(short *) (data + addr) &= ~mask; *(short *) (data + addr) |= relocation; break; case 2: *(long *) (data + addr) &= ~mask; *(long *) (data + addr) |= relocation; break; default: break; } #else if (reverse) relocation = - relocation; switch (length) { case 0: if (RELOC_MEMORY_SUB_P(r)) *(char *) (data + addr) = relocation - *(char *) (data + addr); else *(char *) (data + addr) += relocation; break; case 1: if (RELOC_MEMORY_SUB_P(r)) *(short *) (data + addr) = relocation - *(short *) (data + addr); else *(char *) (data + addr) += relocation; break; case 2: if (RELOC_MEMORY_SUB_P(r)) *(int *) (data + addr) = relocation - *(int *) (data + addr); else *(int *) (data + addr) += relocation; break; default: break; } #endif } } /* perform_relocation */ /* ABSOLUTE_FILENAME_P (fname): True if fname is an absolute filename */ #ifdef atarist #define ABSOLUTE_FILENAME_P(fname) ((fname[0] == '/') || \ (fname[0] && (fname[1] == ':'))) #else #define ABSOLUTE_FILENAME_P(fname) (fname[0] == '/') #endif /* atarist */ /* given a file name, create an appropriate file_entry for it */ static struct file_entry * make_entry (filename) char *filename; { register struct file_entry *entry = (struct file_entry *) _dld_malloc (sizeof (struct file_entry)); bzero (entry, sizeof (struct file_entry)); entry->filename = entry->local_sym_name = (char *) _dld_malloc (strlen (filename) + 1); strcpy (entry->local_sym_name, filename); if (!ABSOLUTE_FILENAME_P(filename)) { char name[MAXPATHLEN]; entry->filename = concat (getwd(name), "/", filename); } entry->chain = _dld_latest_entry; entry->ref_count = 1; return entry; } /* make_entry */ /* If ENTRY is a rel file, read its symbol and string sections into core. If it is a library, search it and load the appropriate members (which means calling this function recursively on those members). */ static void read_file_symbols (desc, entry, load_text) register int desc; register struct file_entry *entry; int load_text; /* used only by dld_init */ { register int len; int magicnum; len = read (desc, &magicnum, sizeof magicnum); if (len != sizeof magicnum) fatal (DLD_EBADHEADER); #ifdef atarist if (!load_text || !N_BADMAG (*((struct exec *)&magicnum))) { #else if (!N_BADMAG (*((struct exec *)&magicnum))) { #endif read_entry_symbols (desc, entry); read_entry_strings (desc, entry); enter_file_symbols (entry); free (entry->strings); entry->strings = 0; if (load_text) read_text_and_data (desc, entry); } else { char armag[SARMAG]; lseek (desc, 0, 0); if (SARMAG != read (desc, armag, SARMAG) || strncmp (armag, ARMAG, SARMAG)) fatal (DLD_EBADOBJECT); entry->library_flag = 1; search_library (desc, entry); } } /* read_file_symbols */ /* Allocate memory for all text, data and bss segments and read them in from the file. */ static void read_text_and_data (desc, entry) int desc; register struct file_entry *entry; { register size = entry->header.a_text + entry->header.a_data + entry->header.a_bss; entry->text_start_address = _dld_malloc (size); if (size - entry->header.a_text > 0) { entry->data_start_address = entry->text_start_address + entry->header.a_text; entry->bss_start_address = entry->data_start_address + entry->header.a_data; } else entry->data_start_address = entry->bss_start_address = 0; /* Read text and data sections into core. Note that the bss segment does not actually take up space in the object file, so its size must be subtracted from SIZE */ lseek (desc, entry->starting_offset + N_TXTOFF(entry->header), 0); size -= entry->header.a_bss; if (size != read (desc, entry->text_start_address, size)) { free (entry->text_start_address); entry->text_start_address = entry->data_start_address = entry->bss_start_address = 0; fatal (DLD_ENODATA); } /* zero the bss segment */ if (entry->header.a_bss) bzero ((void *) entry->bss_start_address, entry->header.a_bss); } /* read_text_and_data */ /* Allocate memory for the text and data segments and relocate all local symbols */ static void relocate_entry_symbols (desc, entry) int desc; register struct file_entry *entry; { /* Compute start addresses of each sections and symbols. */ if (entry->library_flag) { register struct file_entry *subentry = entry->subfiles; for (; subentry; subentry = subentry->chain) { relocate_symbol_address (subentry); relocate_local_refs (desc, subentry); } } else { relocate_symbol_address (entry); relocate_local_refs (desc, entry); } } /* relocate_entry_symbols */ /* Find all modules have all external references defined but not resolved. */ void _dld_patch_all_files (entry) register struct file_entry *entry; { while (entry) { if (entry->library_flag) _dld_patch_all_files (entry->subfiles); else if (!entry->all_symbols_resolved_flag && entry->undefined_symbol_count == 0) { /* entry whose global references have just been resolved */ perform_relocation (entry->text_start_address, entry->text_start_address, entry->text_reloc, entry->header.a_trsize, 0); perform_relocation (entry->data_start_address, entry->data_start_address - entry->header.a_data, entry->data_reloc, entry->header.a_drsize, 0); entry->all_symbols_resolved_flag = 1; } else if (entry->all_symbols_resolved_flag && entry->undefined_symbol_count != 0) { /* entry that has some of its global references being "un-defined" */ perform_relocation (entry->text_start_address, entry->text_start_address, entry->text_reloc, entry->header.a_trsize, 1); perform_relocation (entry->data_start_address, entry->data_start_address - entry->header.a_data, entry->data_reloc, entry->header.a_drsize, 1); entry->all_symbols_resolved_flag = 0; } entry = entry->chain; } } /* _dld_patch_all_files */ /* * reset the executable_flag of the given entry, and then recursively * propagate this to all modules that reference symbols in this entry. */ static void invalidate (entry) struct file_entry *entry; { register struct file_chain *p; if (entry == 0) return; entry->executable_flag = 0; for (p = entry->refs_by; p; p = p->next) if (p->entry->executable_flag) invalidate (p->entry); } /* invalidate */ /* * For all modules loaded, determine which of them can be safely executed. * For those that can, set the flag executable_flag. */ static void find_all_executable_modules () { register struct file_entry *p; /* set all executable flags */ for (p = _dld_latest_entry; p ; p = p->chain) { if (p->library_flag) { register struct file_entry *q = p->subfiles; while (q) { q->executable_flag = q->all_symbols_resolved_flag; q = q->chain; } } p->executable_flag = p->all_symbols_resolved_flag; } /* invalidate those modules that are not (yet) executable. */ for (p = _dld_latest_entry; p; p = p->chain) { if (p->library_flag) { register struct file_entry *q = p->subfiles; while (q) { if (!q->all_symbols_resolved_flag && q->refs_by) invalidate (q); q = q->chain; } } else if (!p->all_symbols_resolved_flag && p->refs_by) invalidate (p); } _dld_exec_flags_valid = 1; } /* find_all_executable_modules */ /* remove all reference pointers *TO* ENTRY */ static void remove_cross_references (head_of_chain, entry) struct file_entry *head_of_chain, *entry; { register struct file_entry *ep = head_of_chain; while (ep) { register struct file_chain *p = ep->refs; if (ep->library_flag) remove_cross_references (ep->subfiles, entry); else { register struct file_chain *prev = 0; while (p) { if (p->entry == entry || p->entry->superfile == entry) { del_link_list_elt (ep->refs, prev, p, next); } else { prev = p; p = p->next; } } } ep = ep->chain; } } /* remove_cross_references */ /* remove all cross reference pointers related to an obsolete file entry. It is assumed that the ref_count of this entry is zero. Also clear up all other entries that become obsolete when this entry is removed. */ static void cleanup_obsolete_entries (entry) struct file_entry *entry; { register struct file_chain *p; if (entry->ref_count != 0) return; if (entry->library_flag) { register struct file_entry *subentry = entry->subfiles; for (; subentry; subentry = subentry->chain) cleanup_obsolete_entries (subentry); } p = entry->refs; entry->refs = 0; /* to prevent loop; might be redundant*/ while (p) { register struct file_chain *next = p->next; if (p->entry->ref_count) /* ref_count may already be set to zero */ (p->entry->ref_count)--; if (p->entry->ref_count == 0) cleanup_obsolete_entries (p->entry); free (p); p = next; } } /* cleanup_obsolete_entries */ /* remove all memory blocks assigned for ENTRY, return the pointers to the next entry in chain */ static struct file_entry * kill_entry (entry) register struct file_entry *entry; { register struct file_chain *p; if (entry->library_flag) { register struct file_entry *subentry = entry->subfiles; while (subentry) subentry = kill_entry (subentry); } p = entry->refs; while (p) { register struct file_chain *next_chain = p->next; free (p); p = next_chain; } p = entry->refs_by; while (p) { register struct file_chain *next_chain = p->next; free (p); p = next_chain; } if (entry->local_sym_name) free (entry->local_sym_name); if (entry->filename != entry->local_sym_name && entry->filename) free (entry->filename); if (entry->symbols) free (entry->symbols); if (entry->strings) free (entry->strings); if (entry->text_reloc) free (entry->text_reloc); if (entry->data_reloc) free (entry->data_reloc); if (entry->text_start_address) free (entry->text_start_address); { register struct file_entry *next = entry->chain; free (entry); return (next); } } /* kill_entry */ /* clean all data structures so that they return to the original states after last call to dld */ static void clean_up () { if (!_dld_latest_entry) return; _dld_latest_entry->ref_count = 0; if (_dld_latest_entry->library_flag) { register struct file_entry *subentry = _dld_latest_entry->subfiles; for (; subentry; subentry = subentry->chain) subentry->ref_count = 0; } remove_cross_references (_dld_latest_entry, _dld_latest_entry); cleanup_obsolete_entries (_dld_latest_entry); cleanup_symtab (); _dld_latest_entry = kill_entry (_dld_latest_entry); } /* clean_up */ /* Actually perform the unlink operation. Search through the list of file entries, unlink those whose ref_count is zero. */ static struct file_entry * do_unlink (entry) struct file_entry *entry; { register struct file_entry *p = entry; register struct file_entry *prev = 0; if (p == 0) return p; while (p) { if (p->library_flag) { p->subfiles = do_unlink (p->subfiles); /* if all subentries are gone, remove itself */ if (p->subfiles == 0) p->ref_count = 0; } if (p->ref_count == 0) { register struct file_entry *next; next = kill_entry (p); if (prev == 0) { entry = next; p = entry; } else { prev->chain = next; p = prev->chain; } } else { prev = p; p = p->chain; } } _dld_exec_flags_valid = 0; return entry; } /* do_unlink */ int dld_init (myname) char *myname; { int desc; page_size = getpagesize (); bzero (_dld_symtab, TABSIZE * sizeof(symbol *)); _dld_latest_entry = 0; _dld_dummy_entry = 0; dld_undefined_sym_count = 0; _dld_exec_flags_valid = 0; if (myname == 0) { dld_errno = DLD_ENOFILE; return dld_errno; } if (setjmp (_dld_env)) { clean_up (); file_close (); return dld_errno; } _dld_latest_entry = make_entry (myname); desc = file_open (_dld_latest_entry); #ifdef atarist st_read_header (desc, _dld_latest_entry); #endif /* atarist */ read_file_symbols (desc, _dld_latest_entry, 0); #ifdef atarist /* do a consistency check of data in entry against data in _base */ if ((_dld_latest_entry->header.a_text != _base->p_tlen) || (_dld_latest_entry->header.a_data != _base->p_dlen) || (_dld_latest_entry->header.a_bss != _base->p_blen)) { if (_dld_latest_entry->symbols) { free (_dld_latest_entry->symbols); _dld_latest_entry->symbols = 0; } file_close (); dld_errno = DLD_EBADHEADER; return dld_errno; } _dld_latest_entry->text_start_address = (int) _base->p_tbase; _dld_latest_entry->data_start_address = (int) _base->p_dbase; _dld_latest_entry->bss_start_address = (int) _base->p_bbase; relocate_symbol_address (_dld_latest_entry); #endif /* atarist */ if (_dld_latest_entry->symbols) { free (_dld_latest_entry->symbols); _dld_latest_entry->symbols = 0; } file_close (); _dld_latest_entry->undefined_symbol_count = 0; _dld_latest_entry->all_symbols_resolved_flag = 1; return 0; } /* dld_init */ int dld_link (object_file) char *object_file; { register int desc; struct file_entry *old_latest_entry = _dld_latest_entry; if (setjmp (_dld_env)) { if (old_latest_entry != _dld_latest_entry) clean_up (); file_close (); return dld_errno; } dld_errno = 0; file_close (); /* file might be opened in the last call */ if (object_file == 0) { dld_errno = DLD_ENOFILE; return dld_errno; } _dld_latest_entry = make_entry (object_file); desc = file_open (_dld_latest_entry); read_file_symbols (desc, _dld_latest_entry, 1); if (_dld_latest_entry->library_flag && _dld_latest_entry->subfiles == 0) { free (_dld_latest_entry->local_sym_name); if (_dld_latest_entry->filename != _dld_latest_entry->local_sym_name) free (_dld_latest_entry->filename); _dld_latest_entry->filename = NULL; _dld_latest_entry->local_sym_name = NULL; _dld_latest_entry = kill_entry (_dld_latest_entry); file_close (); return 0; } relocate_entry_symbols (desc, _dld_latest_entry); file_close (); _dld_patch_all_files (_dld_latest_entry); _dld_exec_flags_valid = 0; return 0; } /* dld_link */ /* return the location of the given symbol without prepending a '_'. */ unsigned long dld_get_bare_symbol (name) char *name; { register symbol *sp; if (name == 0) return 0; sp = _dld_getsym_soft (name); #ifdef linux if (sp) { while (sp->indirect) sp = sp->indirect; if (sp->defined) return sp->value; } #else if (sp) if (sp->defined) return sp->value; #endif return 0; } /* dld_get_bare_symbol */ /* given a file_entry, unlink that (and all its decendents). Modules still referenced by the remainings will not be unlinked. ENTRY is assumed to be a valid pointer to a file_entry structure. if FORCE is true, remove this entry event regardless if it is still referenced by others */ void _dld_unlink_entry (entry, force) struct file_entry *entry; int force; { if (force) { entry->ref_count = 0; if (entry->library_flag) { register struct file_entry *subentry = entry->subfiles; for (; subentry; subentry = subentry->chain) subentry->ref_count = 0; } } else { if (entry->library_flag || entry->already_unlink) return; entry->ref_count--; entry->already_unlink = 1; } if (entry->ref_count == 0) { remove_cross_references (_dld_latest_entry, entry); cleanup_obsolete_entries (entry); cleanup_symtab (); _dld_latest_entry = do_unlink (_dld_latest_entry); } _dld_patch_all_files (_dld_latest_entry); _dld_exec_flags_valid = 0; } /* _dld_unlink_entry */ /* * return true if the named function can be safely exeucted. */ int dld_function_executable_p (name) char name[]; { register symbol *sp; register char *p; if (name == 0) return 0; if (setjmp (_dld_env)) return 0; /* prepend an '_' to name, as required by the C convention */ p = (char *) _dld_malloc (strlen(name) + 2); *p = '_'; strcpy (p+1, name); sp = _dld_getsym_soft (p); free (p); #ifdef linux if (sp && (sp->defined == (N_EXT | N_TEXT) || sp->defined == (N_EXT | N_INDR))) { #else if (sp && sp->defined == (N_EXT | N_TEXT)) { #endif register struct file_entry *fe = sp->defined_by; if (fe == 0) return 0; #ifdef linux while (sp->indirect) sp = sp->indirect; if (sp->defined != (N_EXT | N_TEXT)) return 0; #endif if (!_dld_exec_flags_valid) find_all_executable_modules (); return fe->executable_flag; } #ifdef linux if (sp && sp->defined == (N_EXT | N_ABS)) return 1; #endif return 0; } /* dld_function_executable_p */ octave-1.1.0/dld/error.c100666 415 17 4326 5643671622 13217 0ustar jweusers/* error.c -- print out the error strings. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" static char *errlst[] = { "error 0", "cannot open file", /* 1 DLD_ENOFILE */ "bad magic number", /* 2 DLD_EBADMAGIC */ "fail to read header", /* 3 DLD_EBADHEADER */ "premature eof in text section", /* 4 DLD_ENOTEXT */ "premature eof in symbols", /* 5 DLD_ENOSYMBOLS */ "bad string table", /* 6 DLD_ENOSTRINGS */ "premature eof in text relocation", /* 7 DLD_ENOTXTRELOC */ "premature eof in data section", /* 8 DLD_ENODATA */ "premature eof in data relocation", /* 9 DLD_ENODATRELOC */ "multiple definitions of symbol", /* 10 DLD_EMULTDEFS */ "malformed library archive", /* 11 DLD_EBADLIBRARY */ "common block not supported", /* 12 DLD_EBADCOMMON */ "malformed input file", /* 13 DLD_EBADOBJECT */ "bad relocation info", /* 14 DLD_EBADRELOC */ "virtual memory exhausted", /* 15 DLD_ENOMEMORY */ "undefined symbol" /* 16 DLD_EUNDEFSYM */ }; /* Prints out the given string and the error message corresponding to dld_errno to the stderr. */ void dld_perror (str) char *str; { if (str) fprintf (stderr, "%s: ", str); if (dld_errno < 1 || dld_errno > sizeof (errlst)/sizeof (char *)) fprintf (stderr, "unknown error.\n"); else fprintf (stderr, "%s.\n", errlst[dld_errno]); } /* dld_perror */ static char dld_str_error [256]; /* Returns the error message corresponding to the given error code. */ char * dld_strerror (code) int code; { if (code < 1 || code > sizeof (errlst)/sizeof (char *)) strcpy (dld_str_error, "unknown error"); else strcpy (dld_str_error, errlst[code]); return (dld_str_error); } /* dld_strerror */ octave-1.1.0/dld/find_exec.c100666 415 17 4627 5650260460 14006 0ustar jweusers/* Given a filename, dld_find_executable searches the directories listed in the environment variable PATH for a file with that filename. A new copy of the complete path name of that file is returned. This new string may be disposed by free() later on. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include #include #include #include #include #ifdef linux #include #endif #define DEFAULT_PATH ".:~/bin::/usr/local/bin:/usr/new:/usr/ucb:/usr/bin:/bin:/usr/hosts" static char * copy_of (s) register char *s; { register char *p = (char *) malloc (strlen(s)+1); if (!p) return 0; *p = 0; strcpy (p, s); return p; } /* ABSOLUTE_FILENAME_P (fname): True if fname is an absolute or relative filename */ #ifdef atarist #define ABSOLUTE_FILENAME_P(fname) ((fname[0] == '/') || \ (fname[0] && (fname[1] == ':'))) #else #define ABSOLUTE_FILENAME_P(fname) \ ((fname[0] == '/') || (fname[0] == '.') || (strchr (fname, '/'))) #endif /* atarist */ char * dld_find_executable (file) char *file; { char *search; register char *p; if (ABSOLUTE_FILENAME_P(file)) return copy_of (file); if (((search = (char *) getenv("DLDPATH")) == 0) && ((search = (char *) getenv("PATH")) == 0)) search = DEFAULT_PATH; p = search; while (*p) { char name[MAXPATHLEN]; register char *next; next = name; /* copy directory name into [name] */ while (*p && *p != ':') *next++ = *p++; *next = 0; if (*p) p++; if (name[0] == '.' && name[1] == 0) getwd (name); strcat (name, "/"); strcat (name, file); /* Don't be fooled by directories in the path, etc. */ if (access (name, X_OK) == 0) { struct stat stat_temp; if (stat (name, &stat_temp)) continue; if (S_IFREG != (S_IFMT & stat_temp.st_mode)) continue; return copy_of (name); } } return 0; } octave-1.1.0/dld/get_func.c100666 415 17 2552 5643673602 13657 0ustar jweusers/* get_func.c -- return the entry point of the given function. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* given a function name, return the location of that function (in core) */ unsigned long dld_get_func (name) char name[]; { register symbol *sp; register char *p; if (name == 0) return 0; if (setjmp (_dld_env)) return 0; /* prepend a '_' to name, as required by C's convention */ p = (char *) _dld_malloc (strlen(name) + 2); *p = '_'; strcpy (p+1, name); sp = _dld_getsym_soft (p); free (p); #ifdef linux if (sp) { while (sp->indirect) sp = sp->indirect; if ((sp->defined == (N_EXT | N_TEXT)) || (sp->defined == (N_EXT | N_ABS))) return sp->value; } #else if (sp) if (sp->defined == (N_EXT | N_TEXT)) return sp->value; #endif return 0; } /* dld_get_func */ octave-1.1.0/dld/get_symbol.c100666 415 17 2156 5021123062 14205 0ustar jweusers/* get_symbol.c -- return the address of the given symbol. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* given a symbol name, return the location of that symbol (in core) */ unsigned long dld_get_symbol (name) char name[]; { register char *p; register unsigned long value; if (name == 0) return 0; if (setjmp (_dld_env)) return 0; /* prepend a '_' to name, as required by C's convention */ p = (char *) _dld_malloc (strlen(name) + 2); *p = '_'; strcpy (p+1, name); value = dld_get_bare_symbol (p); free (p); return value; } /* dld_get_symbol */ octave-1.1.0/dld/list_undef.c100666 415 17 2577 5021123056 14207 0ustar jweusers/* list_undefined.c -- return a list of strings containing the names of the undefined symbols. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* * Return an array of strings, each of which is the name of an undefined * symbol. Return 0 if there is no undefined symbol. * * The caller is responsible to free this array. */ char ** dld_list_undefined_sym () { register symbol *sp; register int i; register int count = 0; register char **list; if (!dld_undefined_sym_count) return 0; if (setjmp (_dld_env)) return 0; list = (char **) _dld_malloc (sizeof(char *) * dld_undefined_sym_count); for (i=0; ilink) if (!sp->defined) { list[count++] = sp->name; if (count >= dld_undefined_sym_count) break; } return list; } /* dld_list_undefined_sym */ octave-1.1.0/dld/mk_dummy.c100666 415 17 2232 5021123054 13657 0ustar jweusers/* mk_dummy.c -- create a dummy file_entry for definitions and declarations of symbols explicitly make by the user. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" void _dld_create_dummy_entry () { register struct file_entry *entry; if (_dld_dummy_entry) return; entry = (struct file_entry *) _dld_malloc (sizeof (struct file_entry)); bzero (entry, sizeof (struct file_entry)); entry->filename = entry->local_sym_name = "-*- dummy entry -*-"; entry->chain = _dld_latest_entry; _dld_latest_entry = entry; entry->ref_count = 1; _dld_dummy_entry = entry; return; } /* _dld_create_dummy_entry */ octave-1.1.0/dld/ref.c100666 415 17 3066 5637145240 12635 0ustar jweusers/* ref.c -- explicitly make a reference to a symbol so that the library defining this symbol is loaded. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* * explicitly create a reference to NAME so that a library routine * defining it is forced to be loaded. (c.f. "ld -u" option) * It has no effect on non-library routines (plain object files). */ int dld_create_reference (name) char *name; { register char *p = 0; struct nlist dummy_nlist; /* simulate a nlist entry so that _dld_entery_global_ref can be used. */ if (name == 0) return 0; if (setjmp (_dld_env)) { if (p) free (p); return dld_errno; } if (_dld_dummy_entry == 0) _dld_create_dummy_entry (); bzero (&dummy_nlist, sizeof (struct nlist)); p = (char *) _dld_malloc (strlen(name) +2); *p = '_'; strcpy (p+1, name); dummy_nlist.n_un.n_name = p; dummy_nlist.n_type = N_EXT | N_UNDF; _dld_enter_global_ref (_dld_dummy_entry, &dummy_nlist, p); free (p); return 0; } /* dld_create_reference */ octave-1.1.0/dld/remove.c100666 415 17 3453 5643673714 13367 0ustar jweusers/* remove.c -- remove an explicitly defined symbol. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" /* * remove a previously defined symbol defined by dld_define(). * If symbol is not defined by dld_fine, this function becomes no-op. */ void dld_remove_defined_symbol (name) char *name; { register symbol *sp; register char *p; if (name == 0) return; p = (char *) _dld_malloc (strlen(name) +2); *p = '_'; strcpy (p+1, name); sp = _dld_getsym_soft (p); free (p); if (sp->defined_by && sp->defined_by == _dld_dummy_entry) { register struct file_chain *p = sp->referenced_by; register struct file_chain *prev = 0; while (p) if (p->entry->ref_count == 0) { del_link_list_elt (sp->referenced_by, prev, p, next); } else { p->entry->undefined_symbol_count++; prev = p; p = p->next; } if (sp->referenced_by) { dld_undefined_sym_count++; sp->value = 0; } #ifndef linux if (sp->defined == (N_COMM | N_EXT) && sp->value) { #else if (sp->defined == (N_TYPE | N_EXT) && sp->value) { #endif free (sp->value); sp->value = 0; } sp->defined = 0; sp->defined_by = 0; if (sp->referenced_by) { _dld_patch_all_files (_dld_latest_entry); _dld_exec_flags_valid = 0; } } } /* dld_remove_defined_symbol */ octave-1.1.0/dld/ul_file.c100666 415 17 2674 5637145532 13510 0ustar jweusers/* unlink_file.c -- unlink a given object file. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" static struct file_entry * search_files (entry, name) register struct file_entry *entry; register char *name; { while (entry) { if (entry->library_flag) { register struct file_entry *subentry; if ((subentry = search_files (entry->subfiles, name)) != 0) return subentry; } else { if (!strcmp (entry->local_sym_name, name)) return entry; if (entry->local_sym_name != entry->filename) if (!strcmp (entry->filename, name)) return entry; } entry = entry->chain; } return 0; } /* search_files */ int dld_unlink_by_file (name, force) char *name; int force; { register struct file_entry *entry; if ((entry = search_files (_dld_latest_entry, name))) { _dld_unlink_entry (entry, force); return 0; } dld_errno = DLD_EUNDEFSYM; return dld_errno; } /* dld_unlink_by_file */ octave-1.1.0/dld/ul_symbol.c100666 415 17 2505 5637145302 14062 0ustar jweusers/* unlink_symbol.c -- unlink the object file defining the given symbol. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@cs.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include "defs.h" int dld_unlink_by_symbol (name, force) char *name; int force; { register symbol *sp; register char *p; if (name == 0) { dld_errno = DLD_EUNDEFSYM; return dld_errno; } if (setjmp (_dld_env)) return dld_errno; /* prepend a '_' to name, as required by C's convention */ p = (char *) _dld_malloc (strlen(name) + 2); *p = '_'; strcpy (p+1, name); sp = _dld_getsym_soft (p); free (p); if (sp && sp->defined_by) { if (sp->defined_by != _dld_dummy_entry) _dld_unlink_entry (sp->defined_by, force); else dld_remove_defined_symbol (name); return 0; } dld_errno = DLD_EUNDEFSYM; return dld_errno; } /* dld_unlink_by_symbol */ octave-1.1.0/dld/dld.h100666 415 17 5061 5643671332 12631 0ustar jweusers/* Error codes */ #define DLD_ENOFILE 1 /* cannot open file */ #define DLD_EBADMAGIC 2 /* bad magic number */ #define DLD_EBADHEADER 3 /* failure reading header */ #define DLD_ENOTEXT 4 /* premature eof in text section */ #define DLD_ENOSYMBOLS 5 /* premature end of file in symbols */ #define DLD_ENOSTRINGS 6 /* bad string table */ #define DLD_ENOTXTRELOC 7 /* premature eof in text relocation */ #define DLD_ENODATA 8 /* premature eof in data section */ #define DLD_ENODATRELOC 9 /* premature eof in data relocation */ #define DLD_EMULTDEFS 10 /* multiple definitions of symbol */ #define DLD_EBADLIBRARY 11 /* malformed library archive */ #define DLD_EBADCOMMON 12 /* common block not supported */ #define DLD_EBADOBJECT 13 /* malformed input file (not rel or archive) */ #define DLD_EBADRELOC 14 /* bad relocation info */ #define DLD_ENOMEMORY 15 /* virtual memory exhausted */ #define DLD_EUNDEFSYM 16 /* undefined symbol */ extern int dld_errno; /* error code returned by dld */ extern int dld_undefined_sym_count; /* # of undefined global symbols */ extern int dld_init (); /* initialize the dld routines */ extern int dld_link (); /* dynamically link and load an object file */ extern unsigned long dld_get_symbol (); /* return the address of the named identifier */ extern unsigned long dld_get_func (); /* return the address of the named function */ extern unsigned long dld_get_bare_symbol (); /* same as dld_get_symbol except that no underscore (_) is prepended. Use to locate symbols defined by assembly routines. */ extern int dld_unlink_by_file (); /* unlink a file */ extern int dld_unlink_by_symbol (); /* unlink the module that define the given symbol */ extern int dld_function_executable_p (); /* return true if the named C function is executable */ extern char ** dld_list_undefined_sym (); /* return an array of undefined symbols */ extern char * dld_find_executable (); /* return the full path name of the given executable file. */ extern int dld_create_reference (); /* explicitly create a reference to the given symbol. */ extern int dld_define_sym (); /* explicitly define the value for the given symbol. */ extern void dld_remove_defined_symbol (); /* remove a explicitly defined symbol */ extern void dld_perror (); /* print error messages. */ extern char *dld_strerror (); /* returns the error message */ octave-1.1.0/dld/defs.h100666 415 17 15134 5643672134 13032 0ustar jweusers/* defs.h -- global definitions. */ /* This file is part of DLD, a dynamic link/unlink editor for C. Copyright (C) 1990 by W. Wilson Ho. The author can be reached electronically by how@ivy.ucdavis.edu or through physical mail at: W. Wilson Ho Division of Computer Science University of California at Davis Davis, CA 95616 */ /* 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 1, or (at your option) any later version. */ #include #include #include #include #include #include #include #include #include #include "dld.h" #ifdef linux #include #ifndef N_COMM #define N_COMM 16 #endif #endif /* Each input file, and each library member ("subfile") being loaded, has a `file_entry' structure for it. For files specified by command args, these are contained in the vector which `file_table' points to. For library members, they are dynamically allocated, and chained through the `chain' field. The chain is found in the `subfiles' field of the `file_entry'. The `file_entry' objects for the members have `superfile' fields pointing to the one for the library. */ struct file_entry { /* Name of this file. */ char *filename; /* Name to use for the symbol giving address of text start */ /* Usually the same as filename, but for a file spec'd with -l this is the -l switch itself rather than the filename. */ char *local_sym_name; /* For library member, points to next entry for next member. For object or library *file*, points to previously loaded entry */ struct file_entry *chain; /* number of undefined symbols referenced by this module */ int undefined_symbol_count; /* chain of file_entry that defines symbols this file references */ struct file_chain *refs; /* chain of file_entry that references symbols defined in this file */ struct file_chain *refs_by; /* reference count -- number of entries referenceing myself */ int ref_count; /* Describe the layout of the contents of the file */ /* The file's a.out header. */ struct exec header; /* Describe data from the file loaded into core */ /* Symbol table of the file. */ struct nlist *symbols; /* Size in bytes of string table. */ int string_size; /* Pointer to the string table. The string table is not kept in core all the time, but when it is in core, its address is here. */ char *strings; /* Relocation information of the file. */ /* Start of this file's text relocation information. */ struct dld_reloc_info *text_reloc; /* Start of this file's data relocation information. */ struct dld_reloc_info *data_reloc; /* Relation of this file's segments to the output buffer */ /* Start of this file's text seg in the output file core image. */ int text_start_address; /* Start of this file's data seg in the output file core image. */ int data_start_address; /* Start of this file's bss seg in the output file core image. */ int bss_start_address; /* For library members only */ /* For a library, points to chain of entries for the library members. */ struct file_entry *subfiles; /* For a library member, offset of the member within the archive. Zero for files that are not library members. */ int starting_offset; /* Size of contents of this file, if library member. */ int total_size; /* For library member, points to the library's own entry. */ struct file_entry *superfile; /* 1 if file is a library. */ char library_flag; /* 1 if file's header has been read into this structure. */ char header_read_flag; /* 1 if this module has all external references resolved */ char all_symbols_resolved_flag; /* 1 if functions in this module can be safely executed. */ char executable_flag; /* 1 if this module has already been (soft) unlinked. */ char already_unlink; /* 1 means search a set of directories for this file. */ /* char search_dirs_flag; */ }; /* format of file_entry chain */ struct file_chain { struct file_chain *next; struct file_entry *entry; }; /* Symbol table */ /* Global symbol data is recorded in these structures, one for each global symbol. They are found via hashing in 'symtab', which points to a vector of buckets. Each bucket is a chain of these structures through the link field. */ typedef struct glosym { /* Pointer to next symbol in this symbol's hash bucket. */ struct glosym *link; /* Name of this symbol. */ char *name; /* Value of this symbol as a global symbol. */ long value; #ifdef linux /* Nonzero means that this is an indirect symbol (alias), indirect points to the symbol that is referenced */ struct glosym *indirect; #endif /* Points to the file_entry that defines this symbol */ struct file_entry *defined_by; /* chain of file_entry that contains reference to this symbol */ struct file_chain *referenced_by; /* Nonzero means a definition of this global symbol is known to exist. Library members should not be loaded on its account. */ char defined; /* Nonzero means a reference to this global symbol has been seen in a file that is surely being loaded. */ char referenced; } symbol; /* Number of buckets in symbol hash table */ #define TABSIZE 1009 /* this is commonly used in removing single linked-list elements. */ #define del_link_list_elt(head, prev, current, next) { \ if (prev == 0) { \ head = current->next; \ free (current); \ current = head; \ } else { \ prev->next = current->next; \ free (current); \ current = prev->next; \ } } /* The symbol hash table: a vector of TABSIZE pointers to struct glosym. */ extern symbol *_dld_symtab[TABSIZE]; /* variable for saving the environment */ extern jmp_buf _dld_env; /* pointer to the lastest (newest) file entry */ extern struct file_entry *_dld_latest_entry; /* dummy file_entry to hold all "dangling" symbols. */ extern struct file_entry *_dld_dummy_entry; /* true if the executable flags are up-to-date */ extern char _dld_exec_flags_valid; extern int _dld_malloc (); extern symbol *_dld_getsym (); extern symbol *_dld_getsym_soft (); extern void _dld_enter_global_ref (); extern void _dld_unlink_entry (); extern void _dld_create_dummy_entry (); extern void _dld_patch_all_files (); octave-1.1.0/test/ 40777 415 17 0 5705522412 12023 5ustar jweusersoctave-1.1.0/test/Makefile.in100666 415 17 2575 5664507464 14214 0ustar jweusers# # Makefile for octave's test directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf SOURCES = DISTFILES = Makefile.in $(SOURCES) SUBDIRS = OCTAVE_BINARY = ../src/octave OCTAVE_SCRIPT_PATH = "$(srcdir)/../scripts//" # Complete directory trees to distribute. DISTDIRS = config octave.test all: check .PHONY: all check: @if test -n "$(RUNTEST)" ; then \ $(RUNTEST) \ OCTAVE="$(OCTAVE_BINARY)" \ OCTAVE_SCRIPT_PATH="$(OCTAVE_SCRIPT_PATH)" \ --tool octave --srcdir $(srcdir) $(RUNTEST_FLAGS) ; \ else \ echo "***" ; \ echo "*** Sorry, I can't run tests without DejaGnu" ; \ echo "***" ; \ fi .PHONY: check install: all .PHONY: install uninstall: .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) clean: .PHONY: clean mostlyclean: .PHONY: mostlyclean distclean: clean rm -f Makefile .PHONY: distclean realclean: distclean rm -f tags TAGS .PHONY: realclean local-dist: ln $(DISTFILES) ../`cat ../.fname`/test for dir in $(DISTDIRS); do ln -s ../../test/$$dir ../`cat ../.fname`/test; done .PHONY: local-dist dist: ln $(DISTFILES) ../`cat ../.fname`/test for dir in $(DISTDIRS); do ln -s ../../test/$$dir ../`cat ../.fname`/test; done .PHONY: dist octave-1.1.0/test/config/ 40777 415 17 0 5705523112 13266 5ustar jweusersoctave-1.1.0/test/config/unix-octave.exp100666 415 17 7410 5702325215 16346 0ustar jweusers# Some global definitions. if ![info exists prompt] then { set prompt "octave:\[0-9\]*> " } if ![info exists nl] then { set nl "(\[\r\n\])*" } if ![info exists d] then { set d "\[0-9\]*" } if ![info exists dp] then { set dp "\.*" } if ![info exists resync] then { set resync ".*$prompt$" } # octave_version -- extract and print the version number of octave proc octave_version {} { global OCTAVE set tmp [exec $OCTAVE -v] regexp "version.*$" $tmp version clone_output "[which $OCTAVE] $version\n" unset tmp unset version } # octave_load -- loads the program proc octave_load { arg } { } # octave_exit -- quit and cleanup proc octave_exit { } { } # Start Octave for an interactive test. proc octave_interactive_start { } { global OCTAVE global OCTAVE_SCRIPT_PATH global prompt global nl global resync global spawn_id global verbose global timeout if { $verbose > 1 } { send_user "starting $OCTAVE\n" } # It might take a long time to start Octave, but we shouldn't leave # the timeout period at a minute for the real tests. set timeout 60 if [ llength $OCTAVE_SCRIPT_PATH ] { spawn $OCTAVE -f -q -p $OCTAVE_SCRIPT_PATH } else { spawn $OCTAVE -f -q } set timeout 5 expect { -re "No such file.*" { error "Can't start $OCTAVE"; exit 1 } -re "$resync" { } timeout { error "Failed to spawn $OCTAVE (timeout)"; exit 1 } } # Expectations that are checked before and after those explicitly # specified in each expect block. Note that `$test' is a purely local # variable. Leaving one of these empty will screw us. # expect_before { # } expect_after { -re "usage:.*$prompt$" { fail "$test (usage)" } -re "warning:.*$prompt$" { fail "$test (warning)" } -re "parse error:.*$prompt$" { fail "$test (parse error)" } -re "error:.*$prompt$" { fail "$test (error)" } timeout { fail "$test (timeout)" } } # Always turn off paging! send "page_screen_output = \"false\";\n" expect { -re "$resync" { } } } # Stop an interactive Octave session. proc octave_interactive_stop { } { send "quit\n" expect { -re ".*$" { } } } # Start Octave for a single non-interactive test. proc octave_start { src_file } { global OCTAVE global OCTAVE_SCRIPT_PATH global oct_output set OSPATH OCTAVE_SCRIPT_PATH if ![info exists OSPATH] then { set OSPATH "" } # Can't seem to get 2>&1 to work without using /bin/sh -c ""... send_log "EXEC: $OCTAVE -f -q -p $OSPATH $src_file\n" catch "exec /bin/sh -c \"$OCTAVE -f -q -p $OSPATH $src_file 2>&1\"" oct_output } # do_test -- run a test given by the file $src_code. proc do_test { src_code } { global OCTAVE global OCTAVE_SCRIPT_PATH global srcdir global subdir global spawn_id global verbose global timeout global prog_output global oct_output if { $verbose > 1 } { send_user "starting $OCTAVE\n" } # Reset some variables set oct_output "" set pass_message $subdir/$src_code set fail_message $subdir/$src_code set pass no # Since we are starting up a fresh Octave for nearly every test, use a # fairly large timeout value. set timeout 60 # Run the test octave_start $srcdir/$subdir/$src_code # Check for expected output. if { $verbose > 1 } { send_user "\nChecking:\n$oct_output\nto see if it matches:\n$prog_output\n" } else { send_log "\nOctave Output:\n$oct_output\n" } if [regexp $prog_output $oct_output] then { if { $verbose > 1 } { send_user "Yes, it matches.\n\n" } set pass yes } else { if { $verbose > 1 } { send_user "Nope, it does not match.\n\n" } } if [string match $pass "yes"] then { pass $pass_message } else { fail $fail_message } uplevel { if [info exists errorInfo] then { unset errorInfo } } } octave-1.1.0/test/octave.test/ 40777 415 17 0 5705523113 14261 5ustar jweusersoctave-1.1.0/test/octave.test/eval/ 40777 415 17 0 5702166476 15224 5ustar jweusersoctave-1.1.0/test/octave.test/eval/eval-1.m100666 415 17 20 5701346140 16477 0ustar jweuserseval ("x = 1"); octave-1.1.0/test/octave.test/eval/eval.exp100666 415 17 552 5702166303 16735 0ustar jweusersset test eval-1 set prog_output "x = 1" do_test eval-1.m set test eval-2 set prog_output "ans = 1" do_test eval-2.m set test eval-3 set prog_output "^$" do_test eval-3.m set test eval-4 set prog_output "x = 1\nans = 1" do_test eval-4.m set test eval-5 set prog_output "flipud = 2" do_test eval-5.m set test eval-6 set prog_output "ans = 2" do_test eval-6.m octave-1.1.0/test/octave.test/eval/eval-2.m100666 415 17 20 5701372675 16514 0ustar jweuserseval ("x = 1;") octave-1.1.0/test/octave.test/eval/eval-3.m100666 415 17 21 5702062754 16511 0ustar jweuserseval ("x = 1;"); octave-1.1.0/test/octave.test/eval/eval-4.m100666 415 17 17 5702063103 16504 0ustar jweuserseval ("x = 1") octave-1.1.0/test/octave.test/eval/eval-5.m100666 415 17 35 5702066021 16507 0ustar jweuserseval ("flipud = 2;"); flipud octave-1.1.0/test/octave.test/eval/eval-6.m100666 415 17 106 5702063304 16530 0ustar jweusersfunction y = f () eval ("flipud = 2;"); y = flipud; endfunction f octave-1.1.0/test/octave.test/global/ 40777 415 17 0 5702166500 15521 5ustar jweusersoctave-1.1.0/test/octave.test/global/global.exp100666 415 17 765 5702166447 17576 0ustar jweusersset test global-1 set prog_output "G = 1" do_test global-1.m set test global-2 set prog_output "G = 1" do_test global-2.m set test global-3 set prog_output "error:.*" do_test global-3.m set test global-4 set prog_output "^$" do_test global-4.m set test global-5 set prog_output "error:.*" do_test global-5.m set test global-6 set prog_output "H = 1" do_test global-6.m set test global-7 set prog_output "error:.*" do_test global-7.m set test global-8 set prog_output "H = 1" do_test global-8.m octave-1.1.0/test/octave.test/global/global-1.m100666 415 17 20 5702153772 17331 0ustar jweusersglobal G = 1; G octave-1.1.0/test/octave.test/global/global-2.m100666 415 17 72 5702154065 17335 0ustar jweusersglobal G = 1; function f () global G; G endfunction f octave-1.1.0/test/octave.test/global/global-3.m100666 415 17 56 5702154132 17333 0ustar jweusersglobal G = 1; function f () G endfunction f octave-1.1.0/test/octave.test/global/global-4.m100666 415 17 55 5702153463 17341 0ustar jweusersfunction f () global H = 1; endfunction f; octave-1.1.0/test/octave.test/global/global-5.m100666 415 17 115 5702153702 17353 0ustar jweusers1; function f () global H = 1; endfunction function g () H endfunction g octave-1.1.0/test/octave.test/global/global-6.m100666 415 17 134 5702157104 17355 0ustar jweusers1; function f () global H = 1; endfunction f; function g () global H; H endfunction g octave-1.1.0/test/octave.test/global/global-7.m100666 415 17 57 5702153503 17341 0ustar jweusers1; function f () global H = 1; endfunction H octave-1.1.0/test/octave.test/global/global-8.m100666 415 17 144 5702156731 17365 0ustar jweusers1; function f () global H = 1; endfunction f; function g () global H; H endfunction clear H g octave-1.1.0/test/octave.test/if/ 40777 415 17 0 5702305373 14662 5ustar jweusersoctave-1.1.0/test/octave.test/if/if.exp100666 415 17 472 5702305102 16044 0ustar jweusersset test if-1 set prog_output "1" do_test if-1.m set test if-2 set prog_output "pass" do_test if-2.m set test if-3 set prog_output "pass" do_test if-3.m set test if-4 set prog_output "pass" do_test if-4.m set test if-5 set prog_output "pass" do_test if-5.m set test if-6 set prog_output "pass" do_test if-6.m octave-1.1.0/test/octave.test/if/if-1.m100666 415 17 66 5702305323 15626 0ustar jweusersi = 0; if (i == 0) i++; printf ("%d\n", i); endif octave-1.1.0/test/octave.test/if/if-2.m100666 415 17 100 5702305360 15635 0ustar jweusersif (eye (2)) printf ("fail\n"); else printf ("pass\n"); end octave-1.1.0/test/octave.test/if/if-3.m100666 415 17 117 5702305355 15652 0ustar jweusersx = 2; if (eye (2)) printf ("fail\n"); elseif (x) printf ("pass\n"); endif octave-1.1.0/test/octave.test/if/if-4.m100666 415 17 165 5702305352 15653 0ustar jweusersx = 0; y = -2; if (eye (2)) printf ("fail\n"); elseif (x) printf ("fail\n"); elseif (y) printf ("pass\n"); end octave-1.1.0/test/octave.test/if/if-5.m100666 415 17 221 5702305344 15646 0ustar jweusersx = 0; y = -2; if (eye (2)) printf ("fail\n"); elseif (x) printf ("fail\n"); elseif (x) printf ("fail\n"); else printf ("pass\n"); endif octave-1.1.0/test/octave.test/if/if-6.m100666 415 17 157 5702305350 15654 0ustar jweusersx = 0; y = -2; if (y) printf ("pass\n"); elseif (x) printf ("fail\n"); elseif (x) printf ("fail\n"); end octave-1.1.0/test/octave.test/fsolve/ 40777 415 17 0 5702166477 15574 5ustar jweusersoctave-1.1.0/test/octave.test/fsolve/fsolve.exp100666 415 17 271 5702166435 17657 0ustar jweusersset test fsolve-1 set prog_output "info good\nsolution good\nvalue good" do_test fsolve-1.m set test fsolve-2 set prog_output "info good\nsolution good\nvalue good" do_test fsolve-2.m octave-1.1.0/test/octave.test/fsolve/fsolve-1.m100666 415 17 1261 5702150220 17456 0ustar jweusersx_opt = [ 0.599054; 2.395931; 2.005014 ]; tol = 1.0e-5; function retval = f (p) x = p(1); y = p(2); z = p(3); retval = zeros (3, 1); retval(1) = sin(x) + y**2 + log(z) - 7; retval(2) = 3*x + 2**y -z**3 + 1; retval(3) = x + y + z - 5; end [x, info] = fsolve ("f", [ 0.5, 2.0, 2.5 ]); val = f (x); info_bad = (info != 1); solution_bad = sum (abs (x - x_opt) > tol); value_bad = sum (abs (val) > tol); if (info_bad) printf ("info bad\n"); else printf ("info good\n"); endif if (solution_bad) printf ("solution bad\n"); else printf ("solution good\n"); endif if (value_bad) printf ("value bad\n"); else printf ("value good\n"); endif octave-1.1.0/test/octave.test/fsolve/fsolve-2.m100666 415 17 1470 5702150164 17470 0ustar jweusersx_opt = [ -0.767297326653401; 0.590671081117440; 1.47190018629642; -1.52719341133957 ]; tol = 1.0e-5; function retval = f (p) x = p(1); y = p(2); z = p(3); w = p(4); retval = zeros (4, 1); retval(1) = 3*x + 4*y + exp (z + w) - 1.007; retval(2) = 6*x - 4*y + exp (3*z + w) - 11; retval(3) = x^4 - 4*y^2 + 6*z - 8*w - 20; retval(4) = x^2 + 2*y^3 + z - w - 4; end [x, info] = fsolve ("f", [-1, 1, 2, -1]); val = f (x); info_bad = (info != 1); solution_bad = sum (abs (x - x_opt) > tol); value_bad = sum (abs (val) > tol); if (info_bad) printf ("info bad\n"); else printf ("info good\n"); endif if (solution_bad) printf ("solution bad\n"); else printf ("solution good\n"); endif if (value_bad) printf ("value bad\n"); else printf ("value good\n"); endif octave-1.1.0/test/octave.test/recursion/ 40777 415 17 0 5702306323 16271 5ustar jweusersoctave-1.1.0/test/octave.test/recursion/recursion.exp100666 415 17 217 5702305656 21105 0ustar jweusersset test recursion-1 set prog_output "ans = 120" do_test recursion-1.m set test recursion-2 set prog_output "ans = 120" do_test recursion-2.m octave-1.1.0/test/octave.test/recursion/recursion-1.m100666 415 17 161 5702305627 20677 0ustar jweusers1; function y = f (x) if (x == 1) y = x; return; else y = x * f (x-1); endif endfunction f (5) octave-1.1.0/test/octave.test/recursion/recursion-2.m100666 415 17 161 5702305711 20672 0ustar jweusers1; function y = f (x) if (x == 1) y = x; return; else y = f (x-1) * x; endif endfunction f (5) octave-1.1.0/test/octave.test/return/ 40777 415 17 0 5702320134 15573 5ustar jweusersoctave-1.1.0/test/octave.test/return/return.exp100666 415 17 205 5702317732 17714 0ustar jweusersset test return-1 set prog_output "ans = 1" do_test return-1.m set test return-2 set prog_output "parse error.*" do_test return-2.m octave-1.1.0/test/octave.test/return/return-1.m100666 415 17 45 5702306074 17471 0ustar jweusersfunction f () 1 return 2 end f octave-1.1.0/test/octave.test/return/return-2.m100666 415 17 7 5702306057 17451 0ustar jweusersreturn octave-1.1.0/test/octave.test/transpose/ 40777 415 17 0 5702307147 16303 5ustar jweusersoctave-1.1.0/test/octave.test/transpose/transpose.exp100666 415 17 517 5702307104 21110 0ustar jweusersset test transpose-1 set prog_output "ans = 2" do_test transpose-1.m set test transpose-2 set prog_output "ans = *\n\n *1\n *2\n *3\n *4" do_test transpose-2.m set test transpose-3 set prog_output "ans = *\n\n *1 *2 *3 *4" do_test transpose-3.m set test transpose-4 set prog_output "ans = *\n\n *1 *3\n *2 *4" do_test transpose-4.m octave-1.1.0/test/octave.test/transpose/transpose-1.m100666 415 17 24 5702307061 20661 0ustar jweusersscalar = 2; scalar' octave-1.1.0/test/octave.test/transpose/transpose-2.m100666 415 17 24 5702307071 20663 0ustar jweusersrange = 1:4; range' octave-1.1.0/test/octave.test/transpose/transpose-3.m100666 415 17 34 5702307135 20666 0ustar jweusersvector = [1;2;3;4]; vector' octave-1.1.0/test/octave.test/transpose/transpose-4.m100666 415 17 34 5702307113 20663 0ustar jweusersmatrix = [1,2;3,4]; matrix' octave-1.1.0/test/octave.test/index.exp100666 415 17 20445 5702142252 16226 0ustar jweusers# # Tests for indexing operations # octave_interactive_start # Tests with do_fortran_indexing == "false" # scalar tests set test index-s-1 send "do_fortran_indexing = \"false\"; a = \[\]; isempty (a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-2 send "a = 1; a(1)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-3 send "a(:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-4 send "a(:,:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-5 send "a(1,:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-6 send "a(:,1)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-7 send "isempty (a(0))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-s-8 send "a(-1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-9 send "a(2)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-10 send "a(2,:)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-11 send "a(:,2)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-12 send "a(-1,:)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-13 send "a(:,-1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-14 send "a(\[1,2,3\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-15 send "a(\[1;2;3\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-16 send "a(\[1,2;3,4\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-17 send "a(\[0,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-18 send "a(\[0;1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-19 send "a(\[-1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-s-20 send "a(\[-1;0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } # vector tests set test index-v-1 send "a = \[4,3,2,1\]; a_prime = \[4;3;2;1\]; mid_a = \[3,2\]; a(1)\n" expect { -re "ans = 4$nl.*$prompt$" { pass "$test" } } set test index-v-2 send "a(2)\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test index-v-3 send "all (a(:) == a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-4 send "all (a(1,:) == a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-5 send "a(:,3)\n" expect { -re "ans = 2$nl.*$prompt$" { pass "$test" } } set test index-v-6 send "all (a(:,:) == a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-7 send "all (a(\[0,1,1,0\]) == mid_a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-8 send "a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-v-9 send "a(5)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-v-10 send "a(0,1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-v-11 send "isempty (a(0,:))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-12 send "a(:,0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-v-13 send "isempty (a(\[\]))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-14 send "isempty (a(\[\],:))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-v-15 send "isempty (a(:,\[\]))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } # matrix tests set test index-m-1 send "a = \[1,2;3,4\]; a_fvec = \[1;3;2;4\]; a_col_1 = \[1;3\]; a_col_2 = \[2;4\]; a_row_1 = \[1,2\]; a_row_2 = \[3,4\]; all (all (a(:,:) == a))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-m-2 send "a(:)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-m-3 send "a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-m-4 send "a(2)\n" expect { -re "error:.*$prompt$" { pass "$test" } } # Tests with do_fortran_indexing == "true" # scalar tests set test index-dfi-s-1 send "do_fortran_indexing = \"true\"; a = \[\]; isempty (a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-2 send "a = 1; a(1)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-3 send "a(:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-4 send "a(:,:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-5 send "a(1,:)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-6 send "a(:,1)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-7 send "isempty (a(0))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-s-8 send "a(-1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-9 send "a(2)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-10 send "a(2,:)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-11 send "a(:,2)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-12 send "a(-1,:)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-13 send "a(:,-1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-14 send "a(\[1,2,3\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-15 send "a(\[1;2;3\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-16 send "a(\[1,2;3,4\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-17 send "a(\[0,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-18 send "a(\[0;1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-19 send "a(\[-1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-s-20 send "a(\[-1;0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } # vector tests set test index-dfi-v-1 send "a = \[4,3,2,1\]; a_prime = \[4;3;2;1\]; mid_a = \[3,2\]; a(1)\n" expect { -re "ans = 4$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-2 send "a(2)\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-3 send "all (a(:) == a_prime)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-4 send "all (a(1,:) == a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-5 send "a(:,3)\n" expect { -re "ans = 2$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-6 send "all (a(:,:) == a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-7 send "all (a(\[0,1,1,0\]) == mid_a)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-8 send "a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-v-9 send "a(5)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-v-10 send "a(0,1)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-v-11 send "isempty (a(0,:))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-12 send "a(:,0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-v-13 send "isempty (a(\[\]))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-14 send "isempty (a(\[\],:))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-v-15 send "isempty (a(:,\[\]))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } # matrix tests set test index-dfi-m-1 send "a = \[1,2;3,4\]; a_fvec = \[1;3;2;4\]; a_col_1 = \[1;3\]; a_col_2 = \[2;4\]; a_row_1 = \[1,2\]; a_row_2 = \[3,4\]; all (all (a(:,:) == a))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-m-2 send "all (a(:) == a_fvec)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test index-dfi-m-3 send "a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test index-dfi-m-4 send "a(2)\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } octave_interactive_stop octave-1.1.0/test/octave.test/prefer.exp100666 415 17 14444 5702321375 16411 0ustar jweusers# # Tests for various builtin variables # octave_interactive_start # whitespace_in_literal_matrix set test whitespace-in-literal-matrix-1 send "whitespace_in_literal_matrix = \"ignore\"; m = \[3 2\];\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-2 send "m = \[3, 2\]; all (m == (3:-1:2))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-3 send "\[m (1)\]\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-4 send "\[m(1)\]\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-5 send "whitespace_in_literal_matrix = \"traditional\"; all (\[3 2\] == (3:-1:2))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-6 send "all (\[3, 2\] == (3:-1:2))\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-7 send "all (\[m (1)\] == \[3,2,1\])\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-8 send "\[m(1)\]\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-9 send "whitespace_in_literal_matrix = \"false\"; \[m (1)\]\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-10 send "\[m(1)\]\n" expect { -re "ans = 3$nl.*$prompt$" { pass "$test" } } set test whitespace-in-literal-matrix-11 send "all (\[m,(1)\] == \[3,2,1\])\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } # implicit_str_to_num_ok set test implicit-str-to-num-ok-1 send "implicit_str_to_num_ok = \"true\"; \"d\" + 0\n" expect { -re "ans = 100$nl.*$prompt$" { pass "$test" } } set test implicit-str-to-num-ok-2 send "implicit_str_to_num_ok = \"false\"; \"d\" + 0\n" expect { -re "error:.*$prompt$" { pass "$test" } } # ok_to_lose_imaginary_part set test ok-to-lose-imaginary-part-1 send "ok_to_lose_imaginary_part = \"true\"; eye (1+i)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test ok-to-lose-imaginary-part-2 send "ok_to_lose_imaginary_part = \"false\"; eye (1+i)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test ok-to-lose-imaginary-part-3 send "ok_to_lose_imaginary_part = \"warn\"; eye (1+i)\n" expect { -re "warning:.*$prompt$" { pass "$test" } } # prefer_column_vectors set test prefer-column-vectors-1 send "resize_on_range_error = \"true\"; prefer_column_vectors = \"true\"; clear a; a(1) = 1; a(2) = 2; all (a == \[1;2\])\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } -re "ans = 0$nl.*$prompt$" { fail "$test" } } set test prefer-column-vectors-2 send "prefer_column_vectors = \"false\"; clear a; a(1) = 1; a(2) = 2; all (a == \[1,2\])\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } -re "ans = 0$nl.*$prompt$" { fail "$test" } } # print_answer_id_name set test print-answer-id-name-1 send "print_answer_id_name = \"false\"; a = 1\n" expect { -re "1$nl.*$prompt$" { pass "$test" } } set test print-answer-id-name-2 send "print_answer_id_name = \"true\"; a = 1\n" expect { -re "a = 1$nl.*$prompt$" { pass "$test" } } # print_empty_dimensions set test print-empty-dimensions-1 send "print_empty_dimensions = \"false\"; ones (3, 0)\n" expect { -re "[]$nl.*$prompt$" { pass "$test" } } set test print-empty-dimensions-2 send "print_empty_dimensions = \"true\"; ones (3, 0)\n" expect { -re "[](3x0)$nl.*$prompt$" { pass "$test" } } # propagate_empty_matrices # This should maybe test more functions... set test propagate-empty-matrices-1 send "propagate_empty_matrices = \"false\"; inv (\[\]) == \[\]\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test propagate-empty-matrices-2 send "propagate_empty_matrices = \"true\"; inv (\[\]) == \[\]\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } # return_last_computed_value set test return-last-computed-value-1 send "return_last_computed_value = \"true\"; function f () 1; end f\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test return-last-computed-value-2 send "return_last_computed_value = \"false\"; f\n" expect { -re "$nl.*$prompt$" { pass "$test" } } # save_precision set test save-precision-1 send "save_precision = 1; x = pi; save - x\n" expect { -re "3$nl.*$prompt$" { pass "$test" } } set test save-precision-2 send "save_precision = 5; save - x\n" expect { -re "3.1416$nl.*$prompt$" { pass "$test" } } # silent_functions set test silent-functions-1 send "silent_functions = \"false\"; function f () 1, end f\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test silent-functions-2 send "silent_functions = \"true\"; f\n" expect { -re "$nl.*$prompt$" { pass "$test" } } # treat_neg_dim_as_zero set test treat-neg-dim-as-zero-1 send "treat_neg_dim_as_zero = \"false\"; eye (-1) == \[\]\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test treat-neg-dim-as-zero-2 send "treat_neg_dim_as_zero = \"warn\"; eye (-1) == \[\]\n" expect { -re "warning:.*$prompt$" { pass "$test" } -re "ans = 1$nl.*$prompt$" { xfail "$test" } } set test treat-neg-dim-as-zero-3 send "treat_neg_dim_as_zero = \"true\"; eye (-1) == \[\]\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } # warn_assign_as_truth_value set test warn-assign-as-truth-value-1 send "warn_assign_as_truth_value = \"false\"; if (x = 1) 1; endif\n" expect { -re "$nl.*$prompt$" { pass "$test" } } set test warn-assign-as-truth-value-2 send "warn_assign_as_truth_value = \"true\"; if (x = 1) 1; endif\n" expect { -re "warning:.*$prompt$" { pass "$test" } } # warn_comma_in_global_decl set test warn-comma-in-global-decl-1 send "warn_comma_in_global_decl = \"false\"; global z, y\n" expect { -re "$nl.*$prompt$" { pass "$test" } } set test warn-comma-in-global-decl-2 send "warn_comma_in_global_decl = \"true\"; global z, y\n" expect { -re "warning:.*$prompt$" { pass "$test" } } # warn_divide_by_zero set test warn-divide-by-zero-1 send "warn_divide_by_zero = \"false\"; isinf (1/0)\n" expect { -re "ans = 1$nl.*$prompt$" { pass "$test" } } set test warn-divide-by-zero-2 send "warn_divide_by_zero = \"true\"; isinf (1/0)\n" expect { -re "warning:.*$prompt$" { pass "$test" } } octave_interactive_stop octave-1.1.0/test/octave.test/contin/ 40777 415 17 0 5702341652 15556 5ustar jweusersoctave-1.1.0/test/octave.test/contin/contin.exp100666 415 17 1421 5702341624 17660 0ustar jweusersset test contin-1 set prog_output "parse error.*" do_test contin-1.m set test contin-2 set prog_output "ans = 1" do_test contin-2.m set test contin-3 set prog_output "ans = 1" do_test contin-3.m set test contin-4 set prog_output "parse error.*" do_test contin-4.m set test contin-5 set prog_output "ans = 1" do_test contin-5.m set test contin-6 set prog_output "ans = 1" do_test contin-6.m set test contin-7 set prog_output "ans = 1" do_test contin-7.m set test contin-8 set prog_output "ans = 1" do_test contin-8.m set test contin-9 set prog_output "ans = 1" do_test contin-9.m set test contin-10 set prog_output "ans = 6" do_test contin-10.m set test contin-11 set prog_output "ans = 1" do_test contin-11.m set test contin-12 set prog_output "ans = 1" do_test contin-12.m octave-1.1.0/test/octave.test/contin/contin-1.m100666 415 17 136 5702340236 17436 0ustar jweuserswhitespace_in_literal_matrix = "ignore"; x = [1,2]; a = 1; b = 2; [a... # comments here ok b] octave-1.1.0/test/octave.test/contin/contin-2.m100666 415 17 165 5702324107 17440 0ustar jweuserswhitespace_in_literal_matrix = "traditional"; x = [1,2]; a = 1; b = 2; y = [a... # comments here ok b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-3.m100666 415 17 162 5702324116 17436 0ustar jweuserswhitespace_in_literal_matrix = "standard"; x = [1,2]; a = 1; b = 2; y = [a... # comments here ok b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-8.m100666 415 17 171 5702341407 17445 0ustar jweuserswhitespace_in_literal_matrix = "traditional"; x = [1;2]; a = 1; b = 2; y = [a... # comments here ok ;\ b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-9.m100666 415 17 166 5702341413 17447 0ustar jweuserswhitespace_in_literal_matrix = "standard"; x = [1;2]; a = 1; b = 2; y = [a... # comments here ok ;\ b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-4.m100666 415 17 137 5702340521 17437 0ustar jweuserswhitespace_in_literal_matrix = "ignore"; x = [1,2]; a = 1; b = 2; [a... # comments ok here b] octave-1.1.0/test/octave.test/contin/contin-5.m100666 415 17 166 5702340510 17440 0ustar jweuserswhitespace_in_literal_matrix = "traditional"; x = [1,2]; a = 1; b = 2; y = [a... # comments here ok b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-6.m100666 415 17 163 5702340153 17441 0ustar jweuserswhitespace_in_literal_matrix = "standard"; x = [1,2]; a = 1; b = 2; y = [a... # comments here ok b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-7.m100666 415 17 164 5702341416 17446 0ustar jweuserswhitespace_in_literal_matrix = "ignore"; x = [1;2]; a = 1; b = 2; y = [a... # comments here ok ;\ b]; all (y == x) octave-1.1.0/test/octave.test/contin/contin-10.m100666 415 17 76 5702341610 17476 0ustar jweusers1 + ... 2 - \# comments here ok 3 / ... # comments here ok -1 octave-1.1.0/test/octave.test/contin/contin-11.m100666 415 17 330 5702341217 17513 0ustar jweusers1; function f (a,... b, ... c, ... % comments ok x, # continuation characters not required in parens y, \# but they should work too. z) 1 end f () octave-1.1.0/test/octave.test/contin/contin-12.m100666 415 17 60 5702341274 17477 0ustar jweusersif (1 == 1 && 2 == 2 || 3 == 5) 1 end octave-1.1.0/test/octave.test/infnan/ 40777 415 17 0 5702320663 15534 5ustar jweusersoctave-1.1.0/test/octave.test/infnan/infnan.exp100666 415 17 1077 5702320647 17627 0ustar jweusersset test infnan-1 set prog_output "ans = 0" do_test infnan-1.m set test infnan-2 set prog_output "ans = 1" do_test infnan-2.m set test infnan-3 set prog_output "ans = 0" do_test infnan-3.m set test infnan-4 set prog_output "ans = 0" do_test infnan-4.m set test infnan-5 set prog_output "ans = 0" do_test infnan-5.m set test infnan-6 set prog_output "ans = 1" do_test infnan-6.m set test infnan-7 set prog_output "ans = 1" do_test infnan-7.m set test infnan-8 set prog_output "ans = 0" do_test infnan-8.m set test infnan-9 set prog_output "ans = 0" do_test infnan-9.m octave-1.1.0/test/octave.test/infnan/infnan-1.m100666 415 17 24 5702320627 17352 0ustar jweusersa = Inf; finite (a) octave-1.1.0/test/octave.test/infnan/infnan-2.m100666 415 17 23 5702320636 17352 0ustar jweusersa = Inf; isinf (a) octave-1.1.0/test/octave.test/infnan/infnan-3.m100666 415 17 23 5702320640 17346 0ustar jweusersa = Inf; isnan (a) octave-1.1.0/test/octave.test/infnan/infnan-4.m100666 415 17 24 5702320641 17351 0ustar jweusersb = NaN; finite (b) octave-1.1.0/test/octave.test/infnan/infnan-5.m100666 415 17 23 5702320642 17352 0ustar jweusersb = NaN; isinf (b) octave-1.1.0/test/octave.test/infnan/infnan-6.m100666 415 17 23 5702320644 17355 0ustar jweusersb = NaN; isnan (b) octave-1.1.0/test/octave.test/infnan/infnan-7.m100666 415 17 30 5702320645 17355 0ustar jweusersc = rand (); finite (c) octave-1.1.0/test/octave.test/infnan/infnan-8.m100666 415 17 27 5702320647 17366 0ustar jweusersc = rand (); isinf (c) octave-1.1.0/test/octave.test/infnan/infnan-9.m100666 415 17 27 5702320650 17361 0ustar jweusersc = rand (); isnan (c) octave-1.1.0/test/octave.test/zero-one.exp100666 415 17 133344 5702142245 16702 0ustar jweusers# # Tests for zero-one indexing # octave_interactive_start # Tests with: # # prefer_zero_one_indexing == "false" # prefer_column_vectors == "false" # do_fortran_indexing == "false" # scalar tests set test zero-one-fff-s-1 send "prefer_zero_one_indexing = \"false\"; prefer_column_vectors = \"false\"; do_fortran_indexing = \"false\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-fff-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-s-4 send "all (a(\[1,1\]) == \[2,2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-fff-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-v-2 send "all (a(\[1,1,1,1\]) == \[9,9,9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-fff-m-1 send "a = \[9,8;7,6\]; a(\[0,0,0,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-fff-m-2 send "a(\[1,1,1,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-fff-m-3 send "a(\[0,1,1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-fff-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-10 send "all (a(0:1,\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-26 send "all (all (a(:,\[1,1\]) == \[9,9;7,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-29 send "all (a(1,\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-30 send "all (a(\[1,1\],0:1) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-34 send "all (all (a(\[1,1\],:) == \[9,8;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-35 send "all (a(\[1,1\],1) == \[9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fff-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,9;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "false" # prefer_column_vectors == "false" # do_fortran_indexing == "true" # scalar tests set test zero-one-fft-s-1 send "prefer_zero_one_indexing = \"false\"; prefer_column_vectors = \"false\"; do_fortran_indexing = \"true\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-fft-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-s-4 send "all (a(\[1,1\]) == \[2,2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-fft-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-v-2 send "all (a(\[1,1,1,1\]) == \[9,9,9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-fft-m-1 send "a = \[9,8;7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-2 send "all (a(\[1,1,1,1\]) == \[9;9;9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-3 send "all (a(\[0,1,1,0\]) == \[7;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-10 send "all (a(0:1,\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-26 send "all (all (a(:,\[1,1\]) == \[9,9;7,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-29 send "all (a(1,\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-30 send "all (a(\[1,1\],0:1) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-34 send "all (all (a(\[1,1\],:) == \[9,8;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-35 send "all (a(\[1,1\],1) == \[9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-fft-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,9;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "false" # prefer_column_vectors == "true" # do_fortran_indexing == "false" # scalar tests set test zero-one-ftf-s-1 send "prefer_zero_one_indexing = \"false\"; prefer_column_vectors = \"true\"; do_fortran_indexing = \"false\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ftf-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-s-4 send "all (a(\[1,1\]) == \[2;2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-ftf-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-v-2 send "all (a(\[1,1,1,1\]) == \[9,9,9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-ftf-m-1 send "a = \[9,8;7,6\]; a(\[0,0,0,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-2 send "a(\[1,1,1,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-3 send "a(\[0,1,1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-10 send "all (a(0:1,\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-26 send "all (all (a(:,\[1,1\]) == \[9,9;7,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-29 send "all (a(1,\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-30 send "all (a(\[1,1\],0:1) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-34 send "all (all (a(\[1,1\],:) == \[9,8;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-35 send "all (a(\[1,1\],1) == \[9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftf-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,9;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "false" # prefer_column_vectors == "true" # do_fortran_indexing == "true" # scalar tests set test zero-one-ftt-s-1 send "prefer_zero_one_indexing = \"false\"; prefer_column_vectors = \"true\"; do_fortran_indexing = \"true\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ftt-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-s-4 send "all (a(\[1,1\]) == \[2;2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-ftt-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-v-2 send "all (a(\[1,1,1,1\]) == \[9,9,9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-ftt-m-1 send "a = \[9,8;7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-2 send "all (a(\[1,1,1,1\]) == \[9;9;9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-3 send "all (a(\[0,1,1,0\]) == \[7;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-10 send "all (a(0:1,\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,7;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-26 send "all (all (a(:,\[1,1\]) == \[9,9;7,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-29 send "all (a(1,\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-30 send "all (a(\[1,1\],0:1) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;8,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-34 send "all (all (a(\[1,1\],:) == \[9,8;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-35 send "all (a(\[1,1\],1) == \[9;9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ftt-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,9;9,9\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "true" # prefer_column_vectors == "false" # do_fortran_indexing == "false" # scalar tests set test zero-one-tff-s-1 send "prefer_zero_one_indexing = \"true\"; prefer_column_vectors = \"false\"; do_fortran_indexing = \"false\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-tff-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-s-4 send "all (a(\[1,1\]) == \[2,2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-tff-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-v-2 send "all (a(\[1,1,1,1\]) == \[9,8,7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-tff-m-1 send "a = \[9,8;7,6\]; a(\[0,0,0,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-tff-m-2 send "a(\[1,1,1,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-tff-m-3 send "a(\[0,1,1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-tff-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-10 send "all (a(0:1,\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-26 send "all (all (a(:,\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-29 send "all (a(1,\[1,1\]) == \[9,8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-30 send "all (a(\[1,1\],0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-34 send "all (all (a(\[1,1\],:) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-35 send "all (a(\[1,1\],1) == \[9;7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tff-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "true" # prefer_column_vectors == "false" # do_fortran_indexing == "true" # scalar tests set test zero-one-tft-s-1 send "prefer_zero_one_indexing = \"true\"; prefer_column_vectors = \"false\"; do_fortran_indexing = \"true\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-tft-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-s-4 send "all (a(\[1,1\]) == \[2,2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-tft-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-v-2 send "all (a(\[1,1,1,1\]) == \[9,8,7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-tft-m-1 send "a = \[9,8;7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-2 send "all (a(\[1,1,1,1\]) == \[9;7;8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-3 send "all (a(\[0,1,1,0\]) == \[7;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-10 send "all (a(0:1,\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-26 send "all (all (a(:,\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-29 send "all (a(1,\[1,1\]) == \[9,8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-30 send "all (a(\[1,1\],0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-34 send "all (all (a(\[1,1\],:) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-35 send "all (a(\[1,1\],1) == \[9;7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-tft-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "true" # prefer_column_vectors == "true" # do_fortran_indexing == "false" # scalar tests set test zero-one-ttf-s-1 send "prefer_zero_one_indexing = \"true\"; prefer_column_vectors = \"true\"; do_fortran_indexing = \"false\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ttf-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-s-4 send "all (a(\[1,1\]) == \[2;2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-ttf-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-v-2 send "all (a(\[1,1,1,1\]) == \[9,8,7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-ttf-m-1 send "a = \[9,8;7,6\]; a(\[0,0,0,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-2 send "a(\[1,1,1,1\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-3 send "a(\[0,1,1,0\])\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-10 send "all (a(0:1,\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-26 send "all (all (a(:,\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-29 send "all (a(1,\[1,1\]) == \[9,8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-30 send "all (a(\[1,1\],0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-34 send "all (all (a(\[1,1\],:) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-35 send "all (a(\[1,1\],1) == \[9;7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttf-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # Tests with: # # prefer_zero_one_indexing == "true" # prefer_column_vectors == "true" # do_fortran_indexing == "true" # scalar tests set test zero-one-ttt-s-1 send "prefer_zero_one_indexing = \"true\"; prefer_column_vectors = \"true\"; do_fortran_indexing = \"true\"; a = \[\]; a(0)\n" expect { -re "error:.*$prompt$" { pass "$test" } } set test zero-one-ttt-s-2 send "a = 2; a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-s-3 send "a(1) == 2\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-s-4 send "all (a(\[1,1\]) == \[2;2\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # vector tests set test zero-one-ttt-v-1 send "a = \[9,8,7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-v-2 send "all (a(\[1,1,1,1\]) == \[9,8,7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-v-3 send "all (a(\[0,1,1,0\]) == \[8,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-v-4 send "all (a(\[1,1\]) == \[9,9\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } # matrix tests set test zero-one-ttt-m-1 send "a = \[9,8;7,6\]; isempty (a(\[0,0,0,0\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-2 send "all (a(\[1,1,1,1\]) == \[9;7;8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-3 send "all (a(\[0,1,1,0\]) == \[7;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-4 send "a(0:1,0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-5 send "all (a(0:1,2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-6 send "a(0:1,\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-7 send "all (a(0:1,\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-8 send "all (a(0:1,:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-9 send "a(0:1,1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-10 send "all (a(0:1,\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-11 send "all (a(2:-1:1,0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-12 send "all (a(2:-1:1,\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-13 send "all (all (a(2:-1:1,\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-14 send "a(\[0,1\],0:1) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-15 send "all (a(\[0,1\],2:-1:1) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-16 send "a(\[0,1\],\[0,1\]) == 6\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-17 send "all (a(\[0,1\],\[2,1\]) == \[6,7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-18 send "all (a(\[0,1\],:) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-19 send "a(\[0,1\],1) == 7\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-20 send "all (a(\[0,1\],\[1,1\]) == \[7,6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-21 send "all (a(\[2,1\],0:1) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-22 send "all (a(\[2,1\],\[0,1\]) == \[6;8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-23 send "all (all (a(\[2,1\],\[1,1\]) == \[7,6;9,8\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-24 send "all (a(:,0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-25 send "all (a(:,\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-26 send "all (all (a(:,\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-27 send "a(1,0:1) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-28 send "a(1,\[0,1\]) == 8\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-29 send "all (a(1,\[1,1\]) == \[9,8\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-30 send "all (a(\[1,1\],0:1) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-31 send "all (all (a(\[1,1\],2:-1:1) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-32 send "all (a(\[1,1\],\[0,1\]) == \[8;6\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-33 send "all (all (a(\[1,1\],\[2,1\]) == \[8,9;6,7\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-34 send "all (all (a(\[1,1\],:) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-35 send "all (a(\[1,1\],1) == \[9;7\])\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } set test zero-one-ttt-m-36 send "all (all (a(\[1,1\],\[1,1\]) == \[9,8;7,6\]))\n" expect { -re "ans = *1$nl.*$prompt$" { pass "$test" } } octave_interactive_stop octave-1.1.0/test/octave.test/unwind/ 40777 415 17 0 5702320135 15561 5ustar jweusersoctave-1.1.0/test/octave.test/unwind/unwind.exp100666 415 17 250 5702307527 17667 0ustar jweusersset test unwind-1 set prog_output "g = 0\n.*g = 1\n.*g = -1" do_test unwind-1.m set test unwind-2 set prog_output "g = 0\n.*error:.*\n.*\n.*g = -1" do_test unwind-2.moctave-1.1.0/test/octave.test/unwind/unwind-1.m100666 415 17 300 5702311701 17446 0ustar jweusersglobal g = -1; function f (x) global g; save_g = g; unwind_protect g = 0 [1,2;x]; g = 1 unwind_protect_cleanup g = save_g; end_unwind_protect endfunction f ([3,4]) g octave-1.1.0/test/octave.test/unwind/unwind-2.m100666 415 17 274 5702311666 17473 0ustar jweusersglobal g = -1; function f (x) global g; save_g = g; unwind_protect g = 0 [1,2;x]; g = 1 unwind_protect_cleanup g = save_g; end_unwind_protect endfunction f (3) g octave-1.1.0/test/octave.test/while/ 40777 415 17 0 5702320136 15366 5ustar jweusersoctave-1.1.0/test/octave.test/while/while.exp100666 415 17 440 5702310323 17264 0ustar jweusersset test while-1 set prog_output "^$" do_test while-1.m set test while-2 set prog_output "4321" do_test while-2.m set test while-3 set prog_output "4321" do_test while-3.m set test while-4 set prog_output "12" do_test while-4.m set test while-5 set prog_output "34" do_test while-5.m octave-1.1.0/test/octave.test/while/while-5.m100666 415 17 146 5702307750 17103 0ustar jweusersi = 0; while (++i < 5) if (i < 3) continue; endif printf ("%d", i); endwhile printf ("\n"); octave-1.1.0/test/octave.test/while/while-4.m100666 415 17 145 5702310013 17063 0ustar jweusersi = 0; while (i++ < 20) if (i > 2) break; endif printf ("%d", i); endwhile; printf ("\n"); octave-1.1.0/test/octave.test/while/while-3.m100666 415 17 104 5702310050 17056 0ustar jweusersi = 5; while (i) i--; printf ("%d", i); endwhile printf ("\n"); octave-1.1.0/test/octave.test/while/while-1.m100666 415 17 75 5702310102 17041 0ustar jweusersi = 0; while (eye (2)) i++; printf ("%d\n", i); endwhile octave-1.1.0/test/octave.test/while/while-2.m100666 415 17 77 5702310143 17051 0ustar jweusersi = 5; while (--i) printf ("%d", i); endwhile printf ("\n"); octave-1.1.0/test/octave.test/for/ 40777 415 17 0 5702166477 15064 5ustar jweusersoctave-1.1.0/test/octave.test/for/for.exp100666 415 17 744 5702166463 16445 0ustar jweusersset test for-1 set prog_output "1" do_test for-1.m set test for-2 set prog_output "1234" do_test for-2.m set test for-3 set prog_output "1234" do_test for-3.m set test for-4 set prog_output "1324" do_test for-4.m set test for-5 set prog_output "1" do_test for-5.m set test for-6 set prog_output "1234" do_test for-6.m set test for-7 set prog_output "1324" do_test for-7.m set test for-8 set prog_output "12" do_test for-8.m set test for-9 set prog_output "34" do_test for-9.m octave-1.1.0/test/octave.test/for/for-1.m100666 415 17 61 5702145315 16204 0ustar jweusersfor i = 1 printf ("%d", i); end printf ("\n"); octave-1.1.0/test/octave.test/for/for-2.m100666 415 17 66 5702145501 16207 0ustar jweusersfor i = 1:4 printf ("%d", i); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-3.m100666 415 17 74 5702145477 16223 0ustar jweusersfor i = [1,2,3,4] printf ("%d", i); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-4.m100666 415 17 132 5702145217 16227 0ustar jweusersfor i = [1,2;3,4] printf ("%d", i(1,1)); printf ("%d", i(2,1)); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-5.m100666 415 17 73 5702145175 16217 0ustar jweusersfor i = I printf ("%d", imag (i)); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-6.m100666 415 17 105 5702145127 16231 0ustar jweusersfor i = [1,2,3,4]*I printf ("%d", imag (i)); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-7.m100666 415 17 152 5702145463 16237 0ustar jweusersfor i = [1,2;3,4]*I printf ("%d", imag (i(1,1))); printf ("%d", imag (i(2,1))); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-8.m100666 415 17 134 5702145420 16231 0ustar jweusersfor i = [1,2,3,4] if (i > 2) break; endif printf ("%d", i); endfor printf ("\n"); octave-1.1.0/test/octave.test/for/for-9.m100666 415 17 137 5702144516 16242 0ustar jweusersfor i = [1,2,3,4] if (i < 3) continue; endif printf ("%d", i); endfor printf ("\n"); octave-1.1.0/doc/ 40777 415 17 0 5705522420 11610 5ustar jweusersoctave-1.1.0/doc/Makefile.in100666 415 17 13744 5705337172 14013 0ustar jweusers# # Makefile for octave's doc directory # # John W. Eaton # jwe@che.utexas.edu # Department of Chemical Engineering # The University of Texas at Austin TOPDIR = .. srcdir = @srcdir@ top_srcdir = @top_srcdir@ VPATH = @srcdir@ include $(TOPDIR)/Makeconf INSTALL = @INSTALL@ INSTALL_PROGRAM = @INSTALL_PROGRAM@ INSTALL_DATA = @INSTALL_DATA@ SOURCES = TEXINFO = amuse.texi arith.texi bugs.texi bugs1.texi control.texi \ cp-idx.texi diffeq.texi expr.texi extend.texi fn-idx.texi \ func.texi gnuinfo.texi gpl.texi help.texi history.texi \ hsuser.texi image.texi in-idx.texi install.texi install1.texi \ intro.texi invoke.texi io.texi linalg.texi matrix.texi \ nonlin.texi octave.texi op-idx.texi optim.texi plot.texi \ poly.texi preface.texi program.texi quad.texi rd-idx.texi \ rluser.texi set.texi signal.texi special.texi stats.texi \ stmt.texi strings.texi system.texi var.texi vr-idx.texi LIB_TEXINFO = liboctave.texi FAQ_TEXINFO = FAQ.texi ALL_TEXINFO = $(TEXINFO) $(LIB_TEXINFO) $(FAQ_TEXINFO) REFCARD = refcard.tex.in refcard.tex FORMATTED = octave.dvi octave.ps octave.info octave.info-[0-9]* \ FAQ.info FAQ.dvi FAQ.ps refcard.dvi refcard.ps # liboctave.dvi liboctave.ps liboctave.info liboctave.info-[0-9]* DISTFILES = Makefile.in conf.texi.in conf.texi texinfo.tex dir \ octave.1 $(REFCARD) $(ALL_TEXINFO) $(FORMATTED) SPELL = $(patsubst %.texi, %.spell, $(ALL_TEXINFO)) %.spell : %.texi rm -f $@ sed -e 's/@@/ at /g' -e 's/@[a-zA-Z]*//g' $< | spell > $@.tmp mv $@.tmp $@ all: octave.info octave.dvi octave.ps refcard.dvi refcard.ps \ FAQ.info FAQ.dvi FAQ.ps # liboctave.info liboctave.dvi liboctave.ps .PHONY: all octave.info: $(TEXINFO) conf.texi -makeinfo -I$(srcdir) octave.texi octave.dvi: $(TEXINFO) conf.texi texi2dvi $(srcdir)/octave.texi octave.ps: octave.dvi dvips -o octave.ps octave.dvi FAQ.info: FAQ.texi -makeinfo -I$(srcdir) FAQ.texi FAQ.dvi: FAQ.texi texi2dvi $(srcdir)/FAQ.texi FAQ.ps: FAQ.dvi dvips -o FAQ.ps FAQ.dvi liboctave.info: $(LIB_TEXINFO) conf.texi -makeinfo -I$(srcdir) liboctave.texi liboctave.dvi: $(LIB_TEXINFO) conf.texi texi2dvi $(srcdir)/liboctave.texi liboctave.ps: liboctave.dvi dvips -o liboctave.ps liboctave.dvi refcard.tex: refcard.tex.in sed 's/@LOCAL@.*$$//' refcard.tex.in > refcard.tex.tmp mv refcard.tex.tmp refcard.tex rm -f refcard.tex.tmp refcard-local.tex: refcard.tex.in sed 's/@LOCAL@//' refcard.tex.in > refcard-local.tex.tmp mv refcard-local.tex.tmp refcard-local.tex rm -f refcard-local.tex.tmp refcard.dvi: refcard.tex tex $(srcdir)/refcard.tex refcard-local.dvi: refcard-local.tex tex $(srcdir)/refcard-local.tex refcard.ps: refcard.dvi dvips -o refcard.ps refcard.dvi refcard-local.ps: refcard-local.dvi dvips -o refcard-local.ps refcard-local.dvi ../INSTALL.OCTAVE: install1.texi install.texi -makeinfo --no-header -I$(srcdir)/doc install1.texi -mv INSTALL ../INSTALL.OCTAVE ../BUGS: bugs1.texi bugs.texi -makeinfo --no-header -I$(srcdir)/doc bugs1.texi -mv BUGS ../BUGS # This mess is supposed to prevent us from making info files # unnecessarily when building Octave in a subdirectory. conf.texi: $(srcdir)/../src/version.h ../Makeconf Makefile conf.texi.in @echo "Making conf.texi from conf.texi.in..." @(version_val=${version}; \ sed < $(srcdir)/conf.texi.in > conf.texi.tmp \ -e "s;%OCTAVE_VERSION%;$$version_val;" \ -e "s;%OCTAVE_HOME%;${prefix};") @if test "$(srcdir)" = "." ; then \ $(top_srcdir)/move-if-change conf.texi.tmp conf.texi; \ else \ if cmp conf.texi.tmp $(srcdir)/conf.texi > /dev/null; then \ echo conf.texi is unchanged; \ rm -f conf.texi.tmp; \ else \ mv -f conf.texi.tmp conf.texi; \ fi; \ fi check: all .PHONY: check install: all $(top_srcdir)/mkinstalldirs $(mandir) $(infodir) @if test -d $(mandir) ; then \ rm -f $(mandir)/octave.$(manext) ; \ echo "installing $(srcdir)/octave.1 in $(mandir)" ; \ $(INSTALL_DATA) $(srcdir)/octave.1 $(mandir)/octave.$(manext) ; \ fi @if test -d $(infodir) ; then \ rm -f $(infodir)/octave.info* ; \ echo "installing info files in $(infodir)" ; \ if test -f octave.info ; then \ for f in octave.info* ; do \ $(INSTALL_DATA) $$f $(infodir)/$$f ; \ done ; \ else \ for f in $(srcdir)/octave.info* ; do \ $(INSTALL_DATA) $$f $(infodir)/`basename $$f` ; \ done ; \ fi ; \ if test -f $(infodir)/dir ; then \ if grep "^\* Octave: (octave)." $(infodir)/dir > /dev/null ; then \ true ; \ else \ echo "" ; \ echo "You should add the following entry" ; \ echo "" ; \ echo "* Octave: (octave)." ; \ echo " Interactive language for numerical computations." ; \ echo "" ; \ echo "to $(infodir)/dir." ; \ echo "" ; \ fi ; \ else \ echo "installing $(srcdir)/dir in $(infodir)" ; \ $(INSTALL_DATA) $(srcdir)/dir $(infodir)/dir ; \ fi ; \ fi .PHONY: install uninstall: rm -f $(infodir)/octave.info* $(infodir)/liboctave.info* rm -f $(mandir)/octave.$(manext) .PHONY: uninstall tags: $(SOURCES) ctags $(SOURCES) TAGS: $(SOURCES) etags $(SOURCES) spell: $(SPELL) .PHONY: spell clean: rm -f *.info *.info-* octave.cp octave.fn octave.in \ octave.ky octave.op octave.pg octave.rd octave.tp octave.vr \ octave.cps octave.fns octave.ins octave.kys octave.ops \ octave.pgs octave.rds octave.tps octave.vrs octave.aux \ octave.log octave.toc octave.dvi octave.ps liboctave.cp \ liboctave.fn liboctave.pg liboctave.tp liboctave.cps \ liboctave.fns liboctave.pgs liboctave.tps liboctave.aux \ liboctave.log liboctave.toc liboctave.dvi liboctave.ps \ refcard.dvi refcard.ps refcard-local.dvi refcard-local.ps .PHONY: clean mostlyclean: rm -f *.info *.info-* .PHONY: mostlyclean distclean: clean rm -f Makefile refcard-local.tex .PHONY: distclean realclean: distclean rm -f tags TAGS refcard.tex .PHONY: realclean local-dist: all ln $(DISTFILES) ../`cat ../.fname`/doc .PHONY: local-dist dist: all ln $(DISTFILES) ../`cat ../.fname`/doc .PHONY: dist doc-dist: all ln $(FORMATTED) ../`cat ../.fname`/doc .PHONY: doc-dist octave-1.1.0/doc/conf.texi.in100666 415 17 277 5516566202 14126 0ustar jweusers@c Copyright (C) 1993, 1994 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @set VERSION %OCTAVE_VERSION% @set OCTAVEHOME %OCTAVE_HOME% octave-1.1.0/doc/conf.texi100666 415 17 261 5705274133 13511 0ustar jweusers@c Copyright (C) 1993, 1994 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @set VERSION 1.1.0 @set OCTAVEHOME /usr/local octave-1.1.0/doc/texinfo.tex100666 415 17 406040 5523041533 14146 0ustar jweusers%% TeX macros to handle texinfo files % Copyright (C) 1985, 86, 88, 90, 91, 92, 1993 Free Software Foundation, Inc. %This texinfo.tex 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 2, or (at %your option) any later version. %This texinfo.tex file 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 texinfo.tex file; see the file COPYING. If not, write %to the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, %USA. %In other words, you are welcome to use, share and improve this program. %You are forbidden to forbid anyone else to use, share and improve %what you give them. Help stamp out software-hoarding! \def\texinfoversion{2.118} \message{Loading texinfo package [Version \texinfoversion]:} % Print the version number if in a .fmt file. \everyjob{\message{[Texinfo version \texinfoversion]}\message{}} % Save some parts of plain tex whose names we will redefine. \let\ptexlbrace=\{ \let\ptexrbrace=\} \let\ptexdots=\dots \let\ptexdot=\. \let\ptexstar=\* \let\ptexend=\end \let\ptexbullet=\bullet \let\ptexb=\b \let\ptexc=\c \let\ptexi=\i \let\ptext=\t \let\ptexl=\l \let\ptexL=\L \def\tie{\penalty 10000\ } % Save plain tex definition of ~. \message{Basics,} \chardef\other=12 % If this character appears in an error message or help string, it % starts a new line in the output. \newlinechar = `^^J % Ignore a token. % \def\gobble#1{} \hyphenation{ap-pen-dix} \hyphenation{mini-buf-fer mini-buf-fers} \hyphenation{eshell} % Margin to add to right of even pages, to left of odd pages. \newdimen \bindingoffset \bindingoffset=0pt \newdimen \normaloffset \normaloffset=\hoffset \newdimen\pagewidth \newdimen\pageheight \pagewidth=\hsize \pageheight=\vsize % Sometimes it is convenient to have everything in the transcript file % and nothing on the terminal. We don't just call \tracingall here, % since that produces some useless output on the terminal. % \def\gloggingall{\begingroup \globaldefs = 1 \loggingall \endgroup}% \def\loggingall{\tracingcommands2 \tracingstats2 \tracingpages1 \tracingoutput1 \tracinglostchars1 \tracingmacros2 \tracingparagraphs1 \tracingrestores1 \showboxbreadth\maxdimen\showboxdepth\maxdimen }% %---------------------Begin change----------------------- % %%%% For @cropmarks command. % Dimensions to add cropmarks at corners Added by P. A. MacKay, 12 Nov. 1986 % \newdimen\cornerlong \newdimen\cornerthick \newdimen \topandbottommargin \newdimen \outerhsize \newdimen \outervsize \cornerlong=1pc\cornerthick=.3pt % These set size of cropmarks \outerhsize=7in %\outervsize=9.5in % Alternative @smallbook page size is 9.25in \outervsize=9.25in \topandbottommargin=.75in % %---------------------End change----------------------- % \onepageout takes a vbox as an argument. Note that \pagecontents % does insertions itself, but you have to call it yourself. \chardef\PAGE=255 \output={\onepageout{\pagecontents\PAGE}} \def\onepageout#1{\hoffset=\normaloffset \ifodd\pageno \advance\hoffset by \bindingoffset \else \advance\hoffset by -\bindingoffset\fi {\escapechar=`\\\relax % makes sure backslash is used in output files. \shipout\vbox{{\let\hsize=\pagewidth \makeheadline} \pagebody{#1}% {\let\hsize=\pagewidth \makefootline}}}% \advancepageno \ifnum\outputpenalty>-20000 \else\dosupereject\fi} %%%% For @cropmarks command %%%% % Here is a modification of the main output routine for Near East Publications % This provides right-angle cropmarks at all four corners. % The contents of the page are centerlined into the cropmarks, % and any desired binding offset is added as an \hskip on either % site of the centerlined box. (P. A. MacKay, 12 November, 1986) % \def\croppageout#1{\hoffset=0pt % make sure this doesn't mess things up {\escapechar=`\\\relax % makes sure backslash is used in output files. \shipout \vbox to \outervsize{\hsize=\outerhsize \vbox{\line{\ewtop\hfill\ewtop}} \nointerlineskip \line{\vbox{\moveleft\cornerthick\nstop} \hfill \vbox{\moveright\cornerthick\nstop}} \vskip \topandbottommargin \centerline{\ifodd\pageno\hskip\bindingoffset\fi \vbox{ {\let\hsize=\pagewidth \makeheadline} \pagebody{#1} {\let\hsize=\pagewidth \makefootline}} \ifodd\pageno\else\hskip\bindingoffset\fi} \vskip \topandbottommargin plus1fill minus1fill \boxmaxdepth\cornerthick \line{\vbox{\moveleft\cornerthick\nsbot} \hfill \vbox{\moveright\cornerthick\nsbot}} \nointerlineskip \vbox{\line{\ewbot\hfill\ewbot}} }} \advancepageno \ifnum\outputpenalty>-20000 \else\dosupereject\fi} % % Do @cropmarks to get crop marks \def\cropmarks{\let\onepageout=\croppageout } \def\pagebody#1{\vbox to\pageheight{\boxmaxdepth=\maxdepth #1}} {\catcode`\@ =11 \gdef\pagecontents#1{\ifvoid\topins\else\unvbox\topins\fi \dimen@=\dp#1 \unvbox#1 \ifvoid\footins\else\vskip\skip\footins\footnoterule \unvbox\footins\fi \ifr@ggedbottom \kern-\dimen@ \vfil \fi} } % % Here are the rules for the cropmarks. Note that they are % offset so that the space between them is truly \outerhsize or \outervsize % (P. A. MacKay, 12 November, 1986) % \def\ewtop{\vrule height\cornerthick depth0pt width\cornerlong} \def\nstop{\vbox {\hrule height\cornerthick depth\cornerlong width\cornerthick}} \def\ewbot{\vrule height0pt depth\cornerthick width\cornerlong} \def\nsbot{\vbox {\hrule height\cornerlong depth\cornerthick width\cornerthick}} % Parse an argument, then pass it to #1. The argument is the rest of % the input line (except we remove a trailing comment). #1 should be a % macro which expects an ordinary undelimited TeX argument. % \def\parsearg#1{% \let\next = #1% \begingroup \obeylines \futurelet\temp\parseargx } % If the next token is an obeyed space (from an @example environment or % the like), remove it and recurse. Otherwise, we're done. \def\parseargx{% % \obeyedspace is defined far below, after the definition of \sepspaces. \ifx\obeyedspace\temp \expandafter\parseargdiscardspace \else \expandafter\parseargline \fi } % Remove a single space (as the delimiter token to the macro call). {\obeyspaces % \gdef\parseargdiscardspace {\futurelet\temp\parseargx}} {\obeylines % \gdef\parseargline#1^^M{% \endgroup % End of the group started in \parsearg. % % First remove any @c comment, then any @comment. % Result of each macro is put in \toks0. \argremovec #1\c\relax % \expandafter\argremovecomment \the\toks0 \comment\relax % % % Call the caller's macro, saved as \next in \parsearg. \expandafter\next\expandafter{\the\toks0}% }% } % Since all \c{,omment} does is throw away the argument, we can let TeX % do that for us. The \relax here is matched by the \relax in the call % in \parseargline; it could be more or less anything, its purpose is % just to delimit the argument to the \c. \def\argremovec#1\c#2\relax{\toks0 = {#1}} \def\argremovecomment#1\comment#2\relax{\toks0 = {#1}} % \argremovec{,omment} might leave us with trailing spaces, though; e.g., % @end itemize @c foo % will have two active spaces as part of the argument with the % `itemize'. Here we remove all active spaces from #1, and assign the % result to \toks0. % % This loses if there are any *other* active characters besides spaces % in the argument -- _ ^ +, for example -- since they get expanded. % Fortunately, Texinfo does not define any such commands. (If it ever % does, the catcode of the characters in questionwill have to be changed % here.) But this means we cannot call \removeactivespaces as part of % \argremovec{,omment}, since @c uses \parsearg, and thus the argument % that \parsearg gets might well have any character at all in it. % \def\removeactivespaces#1{% \begingroup \ignoreactivespaces \edef\temp{#1}% \global\toks0 = \expandafter{\temp}% \endgroup } % Change the active space to expand to nothing. % \begingroup \obeyspaces \gdef\ignoreactivespaces{\obeyspaces\let =\empty} \endgroup \def\flushcr{\ifx\par\lisppar \def\next##1{}\else \let\next=\relax \fi \next} %% These are used to keep @begin/@end levels from running away %% Call \inENV within environments (after a \begingroup) \newif\ifENV \ENVfalse \def\inENV{\ifENV\relax\else\ENVtrue\fi} \def\ENVcheck{% \ifENV\errmessage{Still within an environment. Type Return to continue.} \endgroup\fi} % This is not perfect, but it should reduce lossage % @begin foo is the same as @foo, for now. \newhelp\EMsimple{Type to continue.} \outer\def\begin{\parsearg\beginxxx} \def\beginxxx #1{% \expandafter\ifx\csname #1\endcsname\relax {\errhelp=\EMsimple \errmessage{Undefined command @begin #1}}\else \csname #1\endcsname\fi} % @end foo executes the definition of \Efoo. % \def\end{\parsearg\endxxx} \def\endxxx #1{% \removeactivespaces{#1}% \edef\endthing{\the\toks0}% % \expandafter\ifx\csname E\endthing\endcsname\relax \expandafter\ifx\csname \endthing\endcsname\relax % There's no \foo, i.e., no ``environment'' foo. \errhelp = \EMsimple \errmessage{Undefined command `@end \endthing'}% \else \unmatchedenderror\endthing \fi \else % Everything's ok; the right environment has been started. \csname E\endthing\endcsname \fi } % There is an environment #1, but it hasn't been started. Give an error. % \def\unmatchedenderror#1{% \errhelp = \EMsimple \errmessage{This `@end #1' doesn't have a matching `@#1'}% } % Define the control sequence \E#1 to give an unmatched @end error. % \def\defineunmatchedend#1{% \expandafter\def\csname E#1\endcsname{\unmatchedenderror{#1}}% } % Single-spacing is done by various environments (specifically, in % \nonfillstart and \quotations). \newskip\singlespaceskip \singlespaceskip = \baselineskip \def\singlespace{% % Why was this kern here? It messes up equalizing space above and below % environments. --karl, 6may93 %{\advance \baselineskip by -\singlespaceskip %\kern \baselineskip}% \baselineskip=\singlespaceskip } %% Simple single-character @ commands % @@ prints an @ % Kludge this until the fonts are right (grr). \def\@{{\tt \char '100}} % This is turned off because it was never documented % and you can use @w{...} around a quote to suppress ligatures. %% Define @` and @' to be the same as ` and ' %% but suppressing ligatures. %\def\`{{`}} %\def\'{{'}} % Used to generate quoted braces. \def\mylbrace {{\tt \char '173}} \def\myrbrace {{\tt \char '175}} \let\{=\mylbrace \let\}=\myrbrace % @: forces normal size whitespace following. \def\:{\spacefactor=1000 } % @* forces a line break. \def\*{\hfil\break\hbox{}\ignorespaces} % @. is an end-of-sentence period. \def\.{.\spacefactor=3000 } % @w prevents a word break. Without the \leavevmode, @w at the % beginning of a paragraph, when TeX is still in vertical mode, would % produce a whole line of output instead of starting the paragraph. \def\w#1{\leavevmode\hbox{#1}} % @group ... @end group forces ... to be all on one page, by enclosing % it in a TeX vbox. We use \vtop instead of \vbox to construct the box % to keep its height that of a normal line. According to the rules for % \topskip (p.114 of the TeXbook), the glue inserted is % max (\topskip - \ht (first item), 0). If that height is large, % therefore, no glue is inserted, and the space between the headline and % the text is small, which looks bad. % \def\group{\begingroup \ifnum\catcode13=\active \else \errhelp = \groupinvalidhelp \errmessage{@group invalid in context where filling is enabled}% \fi % % The \vtop we start below produces a box with normal height and large % depth; thus, TeX puts \baselineskip glue before it, and (when the % next line of text is done) \lineskip glue after it. (See p.82 of % the TeXbook.) Thus, space below is not quite equal to space % above. But it's pretty close. \def\Egroup{% \egroup % End the \vtop. \endgroup % End the \group. }% % \vtop\bgroup % We have to put a strut on the last line in case the @group is in % the midst of an example, rather than completely enclosing it. % Otherwise, the interline space between the last line of the group % and the first line afterwards is too small. But we can't put the % strut in \Egroup, since there it would be on a line by itself. % Hence this just inserts a strut at the beginning of each line. \everypar = {\strut}% % % Since we have a strut on every line, we don't need any of TeX's % normal interline spacing. \offinterlineskip % % OK, but now we have to do something about blank % lines in the input in @example-like environments, which normally % just turn into \lisppar, which will insert no space now that we've % turned off the interline space. Simplest is to make them be an % empty paragraph. \ifx\par\lisppar \edef\par{\leavevmode \par}% % % Reset ^^M's definition to new definition of \par. \obeylines \fi % % We do @comment here in case we are called inside an environment, % such as @example, where each end-of-line in the input causes an % end-of-line in the output. We don't want the end-of-line after % the `@group' to put extra space in the output. Since @group % should appear on a line by itself (according to the Texinfo % manual), we don't worry about eating any user text. \comment } % % TeX puts in an \escapechar (i.e., `@') at the beginning of the help % message, so this ends up printing `@group can only ...'. % \newhelp\groupinvalidhelp{% group can only be used in environments such as @example,^^J% where each line of input produces a line of output.} % @need space-in-mils % forces a page break if there is not space-in-mils remaining. \newdimen\mil \mil=0.001in \def\need{\parsearg\needx} % Old definition--didn't work. %\def\needx #1{\par % %% This method tries to make TeX break the page naturally %% if the depth of the box does not fit. %{\baselineskip=0pt% %\vtop to #1\mil{\vfil}\kern -#1\mil\penalty 10000 %\prevdepth=-1000pt %}} \def\needx#1{% % Go into vertical mode, so we don't make a big box in the middle of a % paragraph. \par % % Don't add any leading before our big empty box, but allow a page % break, since the best break might be right here. \allowbreak \nointerlineskip \vtop to #1\mil{\vfil}% % % TeX does not even consider page breaks if a penalty added to the % main vertical list is 10000 or more. But in order to see if the % empty box we just added fits on the page, we must make it consider % page breaks. On the other hand, we don't want to actually break the % page after the empty box. So we use a penalty of 9999. % % There is an extremely small chance that TeX will actually break the % page at this \penalty, if there are no other feasible breakpoints in % sight. (If the user is using lots of big @group commands, which % almost-but-not-quite fill up a page, TeX will have a hard time doing % good page breaking, for example.) However, I could not construct an % example where a page broke at this \penalty; if it happens in a real % document, then we can reconsider our strategy. \penalty9999 % % Back up by the size of the box, whether we did a page break or not. \kern -#1\mil % % Do not allow a page break right after this kern. \nobreak } % @br forces paragraph break \let\br = \par % @dots{} output some dots \def\dots{.$\,$.$\,$.\:} % @page forces the start of a new page \def\page{\par\vfill\supereject} % @exdent text.... % outputs text on separate line in roman font, starting at standard page margin % This records the amount of indent in the innermost environment. % That's how much \exdent should take out. \newskip\exdentamount % This defn is used inside fill environments such as @defun. \def\exdent{\parsearg\exdentyyy} \def\exdentyyy #1{{\hfil\break\hbox{\kern -\exdentamount{\rm#1}}\hfil\break}} % This defn is used inside nofill environments such as @example. \def\nofillexdent{\parsearg\nofillexdentyyy} \def\nofillexdentyyy #1{{\advance \leftskip by -\exdentamount \leftline{\hskip\leftskip{\rm#1}}}} %\hbox{{\rm#1}}\hfil\break}} % @include file insert text of that file as input. \def\include{\parsearg\includezzz} %Use \input\thisfile to avoid blank after \input, which may be an active %char (in which case the blank would become the \input argument). %The grouping keeps the value of \thisfile correct even when @include %is nested. \def\includezzz #1{\begingroup \def\thisfile{#1}\input\thisfile \endgroup} \def\thisfile{} % @center line outputs that line, centered \def\center{\parsearg\centerzzz} \def\centerzzz #1{{\advance\hsize by -\leftskip \advance\hsize by -\rightskip \centerline{#1}}} % @sp n outputs n lines of vertical space \def\sp{\parsearg\spxxx} \def\spxxx #1{\par \vskip #1\baselineskip} % @comment ...line which is ignored... % @c is the same as @comment % @ignore ... @end ignore is another way to write a comment \def\comment{\catcode 64=\other \catcode 123=\other \catcode 125=\other% \parsearg \commentxxx} \def\commentxxx #1{\catcode 64=0 \catcode 123=1 \catcode 125=2 } \let\c=\comment % Prevent errors for section commands. % Used in @ignore and in failing conditionals. \def\ignoresections{% \let\chapter=\relax \let\unnumbered=\relax \let\top=\relax \let\unnumberedsec=\relax \let\unnumberedsection=\relax \let\unnumberedsubsec=\relax \let\unnumberedsubsection=\relax \let\unnumberedsubsubsec=\relax \let\unnumberedsubsubsection=\relax \let\section=\relax \let\subsec=\relax \let\subsubsec=\relax \let\subsection=\relax \let\subsubsection=\relax \let\appendix=\relax \let\appendixsec=\relax \let\appendixsection=\relax \let\appendixsubsec=\relax \let\appendixsubsection=\relax \let\appendixsubsubsec=\relax \let\appendixsubsubsection=\relax \let\contents=\relax \let\smallbook=\relax \let\titlepage=\relax } % Used in nested conditionals, where we have to parse the Texinfo source % and so want to turn off most commands, in case they are used % incorrectly. % \def\ignoremorecommands{% \let\defcv = \relax \let\deffn = \relax \let\deffnx = \relax \let\defindex = \relax \let\defivar = \relax \let\defmac = \relax \let\defmethod = \relax \let\defop = \relax \let\defopt = \relax \let\defspec = \relax \let\deftp = \relax \let\deftypefn = \relax \let\deftypefun = \relax \let\deftypevar = \relax \let\deftypevr = \relax \let\defun = \relax \let\defvar = \relax \let\defvr = \relax \let\ref = \relax \let\xref = \relax \let\printindex = \relax \let\pxref = \relax \let\settitle = \relax \let\include = \relax \let\lowersections = \relax \let\down = \relax \let\raisesections = \relax \let\up = \relax \let\set = \relax \let\clear = \relax } % Ignore @ignore ... @end ignore. % \def\ignore{\doignore{ignore}} % Also ignore @ifinfo, @menu, and @direntry text. % \def\ifinfo{\doignore{ifinfo}} \def\menu{\doignore{menu}} \def\direntry{\doignore{direntry}} % Ignore text until a line `@end #1'. % \def\doignore#1{\begingroup % Don't complain about control sequences we have declared \outer. \ignoresections % % Define a command to swallow text until we reach `@end #1'. \long\def\doignoretext##1\end #1{\enddoignore}% % % Make sure that spaces turn into tokens that match what \doignoretext wants. \catcode32 = 10 % % And now expand that command. \doignoretext } % What we do to finish off ignored text. % \def\enddoignore{\endgroup\ignorespaces}% \newif\ifwarnedobs\warnedobsfalse \def\obstexwarn{% \ifwarnedobs\relax\else % We need to warn folks that they may have trouble with TeX 3.0. % This uses \immediate\write16 rather than \message to get newlines. \immediate\write16{} \immediate\write16{***WARNING*** for users of Unix TeX 3.0!} \immediate\write16{This manual trips a bug in TeX version 3.0 (tex hangs).} \immediate\write16{If you are running another version of TeX, relax.} \immediate\write16{If you are running Unix TeX 3.0, kill this TeX process.} \immediate\write16{ Then upgrade your TeX installation if you can.} \immediate\write16{If you are stuck with version 3.0, run the} \immediate\write16{ script ``tex3patch'' from the Texinfo distribution} \immediate\write16{ to use a workaround.} \immediate\write16{} \warnedobstrue \fi } % **In TeX 3.0, setting text in \nullfont hangs tex. For a % workaround (which requires the file ``dummy.tfm'' to be installed), % uncomment the following line: %%%%%\font\nullfont=dummy\let\obstexwarn=\relax % Ignore text, except that we keep track of conditional commands for % purposes of nesting, up to an `@end #1' command. % \def\nestedignore#1{% \obstexwarn % We must actually expand the ignored text to look for the @end % command, so that nested ignore constructs work. Thus, we put the % text into a \vbox and then do nothing with the result. To minimize % the change of memory overflow, we follow the approach outlined on % page 401 of the TeXbook: make the current font be a dummy font. % \setbox0 = \vbox\bgroup % Don't complain about control sequences we have declared \outer. \ignoresections % % Define `@end #1' to end the box, which will in turn undefine the % @end command again. \expandafter\def\csname E#1\endcsname{\egroup\ignorespaces}% % % We are going to be parsing Texinfo commands. Most cause no % trouble when they are used incorrectly, but some commands do % complicated argument parsing or otherwise get confused, so we % undefine them. % % We can't do anything about stray @-signs, unfortunately; % they'll produce `undefined control sequence' errors. \ignoremorecommands % % Set the current font to be \nullfont, a TeX primitive, and define % all the font commands to also use \nullfont. We don't use % dummy.tfm, as suggested in the TeXbook, because not all sites % might have that installed. Therefore, math mode will still % produce output, but that should be an extremely small amount of % stuff compared to the main input. % \nullfont \let\tenrm = \nullfont \let\tenit = \nullfont \let\tensl = \nullfont \let\tenbf = \nullfont \let\tentt = \nullfont \let\smallcaps = \nullfont \let\tensf = \nullfont % Similarly for index fonts (mostly for their use in % smallexample) \let\indrm = \nullfont \let\indit = \nullfont \let\indsl = \nullfont \let\indbf = \nullfont \let\indtt = \nullfont \let\indsc = \nullfont \let\indsf = \nullfont % % Don't complain when characters are missing from the fonts. \tracinglostchars = 0 % % Don't bother to do space factor calculations. \frenchspacing % % Don't report underfull hboxes. \hbadness = 10000 % % Do minimal line-breaking. \pretolerance = 10000 % % Do not execute instructions in @tex \def\tex{\doignore{tex}} } % @set VAR sets the variable VAR to an empty value. % @set VAR REST-OF-LINE sets VAR to the value REST-OF-LINE. % % Since we want to separate VAR from REST-OF-LINE (which might be % empty), we can't just use \parsearg; we have to insert a space of our % own to delimit the rest of the line, and then take it out again if we % didn't need it. % \def\set{\parsearg\setxxx} \def\setxxx#1{\setyyy#1 \endsetyyy} \def\setyyy#1 #2\endsetyyy{% \def\temp{#2}% \ifx\temp\empty \global\expandafter\let\csname SET#1\endcsname = \empty \else \setzzz{#1}#2\endsetzzz % Remove the trailing space \setxxx inserted. \fi } \def\setzzz#1#2 \endsetzzz{\expandafter\xdef\csname SET#1\endcsname{#2}} % @clear VAR clears (i.e., unsets) the variable VAR. % \def\clear{\parsearg\clearxxx} \def\clearxxx#1{\global\expandafter\let\csname SET#1\endcsname=\relax} % @value{foo} gets the text saved in variable foo. % \def\value#1{\expandafter \ifx\csname SET#1\endcsname\relax {\{No value for ``#1''\}} \else \csname SET#1\endcsname \fi} % @ifset VAR ... @end ifset reads the `...' iff VAR has been defined % with @set. % \def\ifset{\parsearg\ifsetxxx} \def\ifsetxxx #1{% \expandafter\ifx\csname SET#1\endcsname\relax \expandafter\ifsetfail \else \expandafter\ifsetsucceed \fi } \def\ifsetsucceed{\conditionalsucceed{ifset}} \def\ifsetfail{\nestedignore{ifset}} \defineunmatchedend{ifset} % @ifclear VAR ... @end ifclear reads the `...' iff VAR has never been % defined with @set, or has been undefined with @clear. % \def\ifclear{\parsearg\ifclearxxx} \def\ifclearxxx #1{% \expandafter\ifx\csname SET#1\endcsname\relax \expandafter\ifclearsucceed \else \expandafter\ifclearfail \fi } \def\ifclearsucceed{\conditionalsucceed{ifclear}} \def\ifclearfail{\nestedignore{ifclear}} \defineunmatchedend{ifclear} % @iftex always succeeds; we read the text following, through @end % iftex). But `@end iftex' should be valid only after an @iftex. % \def\iftex{\conditionalsucceed{iftex}} \defineunmatchedend{iftex} % We can't just want to start a group at @iftex (for example) and end it % at @end iftex, since then @set commands inside the conditional have no % effect (they'd get reverted at the end of the group). So we must % define \Eiftex to redefine itself to be its previous value. (We can't % just define it to fail again with an ``unmatched end'' error, since % the @ifset might be nested.) % \def\conditionalsucceed#1{% \edef\temp{% % Remember the current value of \E#1. \let\nece{prevE#1} = \nece{E#1}% % % At the `@end #1', redefine \E#1 to be its previous value. \def\nece{E#1}{\let\nece{E#1} = \nece{prevE#1}}% }% \temp } % We need to expand lots of \csname's, but we don't want to expand the % control sequences after we've constructed them. % \def\nece#1{\expandafter\noexpand\csname#1\endcsname} % @asis just yields its argument. Used with @table, for example. % \def\asis#1{#1} % @math means output in math mode. % We don't use $'s directly in the definition of \math because control % sequences like \math are expanded when the toc file is written. Then, % we read the toc file back, the $'s will be normal characters (as they % should be, according to the definition of Texinfo). So we must use a % control sequence to switch into and out of math mode. % % This isn't quite enough for @math to work properly in indices, but it % seems unlikely it will ever be needed there. % \let\implicitmath = $ \def\math#1{\implicitmath #1\implicitmath} % @bullet and @minus need the same treatment as @math, just above. \def\bullet{\implicitmath\ptexbullet\implicitmath} \def\minus{\implicitmath-\implicitmath} \def\node{\ENVcheck\parsearg\nodezzz} \def\nodezzz#1{\nodexxx [#1,]} \def\nodexxx[#1,#2]{\gdef\lastnode{#1}} \let\nwnode=\node \let\lastnode=\relax \def\donoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\setref{\lastnode}\fi \let\lastnode=\relax} \def\unnumbnoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\unnumbsetref{\lastnode}\fi \let\lastnode=\relax} \def\appendixnoderef{\ifx\lastnode\relax\else \expandafter\expandafter\expandafter\appendixsetref{\lastnode}\fi \let\lastnode=\relax} \let\refill=\relax % @setfilename is done at the beginning of every texinfo file. % So open here the files we need to have open while reading the input. % This makes it possible to make a .fmt file for texinfo. \def\setfilename{% \readauxfile \opencontents \openindices \fixbackslash % Turn off hack to swallow `\input texinfo'. \global\let\setfilename=\comment % Ignore extra @setfilename cmds. \comment % Ignore the actual filename. } \outer\def\bye{\pagealignmacro\tracingstats=1\ptexend} \def\inforef #1{\inforefzzz #1,,,,**} \def\inforefzzz #1,#2,#3,#4**{See Info file \file{\ignorespaces #3{}}, node \samp{\ignorespaces#1{}}} \message{fonts,} % Font-change commands. % Texinfo supports the sans serif font style, which plain TeX does not. % So we set up a \sf analogous to plain's \rm, etc. \newfam\sffam \def\sf{\fam=\sffam \tensf} \let\li = \sf % Sometimes we call it \li, not \sf. %% Try out Computer Modern fonts at \magstephalf \let\mainmagstep=\magstephalf \ifx\bigger\relax \let\mainmagstep=\magstep1 \font\textrm=cmr12 \font\texttt=cmtt12 \else \font\textrm=cmr10 scaled \mainmagstep \font\texttt=cmtt10 scaled \mainmagstep \fi % Instead of cmb10, you many want to use cmbx10. % cmbx10 is a prettier font on its own, but cmb10 % looks better when embedded in a line with cmr10. \font\textbf=cmb10 scaled \mainmagstep \font\textit=cmti10 scaled \mainmagstep \font\textsl=cmsl10 scaled \mainmagstep \font\textsf=cmss10 scaled \mainmagstep \font\textsc=cmcsc10 scaled \mainmagstep \font\texti=cmmi10 scaled \mainmagstep \font\textsy=cmsy10 scaled \mainmagstep % A few fonts for @defun, etc. \font\defbf=cmbx10 scaled \magstep1 %was 1314 \font\deftt=cmtt10 scaled \magstep1 \def\df{\let\tentt=\deftt \let\tenbf = \defbf \bf} % Fonts for indices and small examples. % We actually use the slanted font rather than the italic, % because texinfo normally uses the slanted fonts for that. % Do not make many font distinctions in general in the index, since they % aren't very useful. \font\ninett=cmtt9 \font\indrm=cmr9 \font\indit=cmsl9 \let\indsl=\indit \let\indtt=\ninett \let\indsf=\indrm \let\indbf=\indrm \let\indsc=\indrm \font\indi=cmmi9 \font\indsy=cmsy9 % Fonts for headings \font\chaprm=cmbx12 scaled \magstep2 \font\chapit=cmti12 scaled \magstep2 \font\chapsl=cmsl12 scaled \magstep2 \font\chaptt=cmtt12 scaled \magstep2 \font\chapsf=cmss12 scaled \magstep2 \let\chapbf=\chaprm \font\chapsc=cmcsc10 scaled\magstep3 \font\chapi=cmmi12 scaled \magstep2 \font\chapsy=cmsy10 scaled \magstep3 \font\secrm=cmbx12 scaled \magstep1 \font\secit=cmti12 scaled \magstep1 \font\secsl=cmsl12 scaled \magstep1 \font\sectt=cmtt12 scaled \magstep1 \font\secsf=cmss12 scaled \magstep1 \font\secbf=cmbx12 scaled \magstep1 \font\secsc=cmcsc10 scaled\magstep2 \font\seci=cmmi12 scaled \magstep1 \font\secsy=cmsy10 scaled \magstep2 % \font\ssecrm=cmbx10 scaled \magstep1 % This size an font looked bad. % \font\ssecit=cmti10 scaled \magstep1 % The letters were too crowded. % \font\ssecsl=cmsl10 scaled \magstep1 % \font\ssectt=cmtt10 scaled \magstep1 % \font\ssecsf=cmss10 scaled \magstep1 %\font\ssecrm=cmb10 scaled 1315 % Note the use of cmb rather than cmbx. %\font\ssecit=cmti10 scaled 1315 % Also, the size is a little larger than %\font\ssecsl=cmsl10 scaled 1315 % being scaled magstep1. %\font\ssectt=cmtt10 scaled 1315 %\font\ssecsf=cmss10 scaled 1315 %\let\ssecbf=\ssecrm \font\ssecrm=cmbx12 scaled \magstephalf \font\ssecit=cmti12 scaled \magstephalf \font\ssecsl=cmsl12 scaled \magstephalf \font\ssectt=cmtt12 scaled \magstephalf \font\ssecsf=cmss12 scaled \magstephalf \font\ssecbf=cmbx12 scaled \magstephalf \font\ssecsc=cmcsc10 scaled \magstep1 \font\sseci=cmmi12 scaled \magstephalf \font\ssecsy=cmsy10 scaled \magstep1 % The smallcaps and symbol fonts should actually be scaled \magstep1.5, % but that is not a standard magnification. % Fonts for title page: \font\titlerm = cmbx12 scaled \magstep3 \let\authorrm = \secrm % In order for the font changes to affect most math symbols and letters, % we have to define the \textfont of the standard families. Since % texinfo doesn't allow for producing subscripts and superscripts, we % don't bother to reset \scriptfont and \scriptscriptfont (which would % also require loading a lot more fonts). % \def\resetmathfonts{% \textfont0 = \tenrm \textfont1 = \teni \textfont2 = \tensy \textfont\itfam = \tenit \textfont\slfam = \tensl \textfont\bffam = \tenbf \textfont\ttfam = \tentt \textfont\sffam = \tensf } % The font-changing commands redefine the meanings of \tenSTYLE, instead % of just \STYLE. We do this so that font changes will continue to work % in math mode, where it is the current \fam that is relevant in most % cases, not the current. Plain TeX does, for example, % \def\bf{\fam=\bffam \tenbf} By redefining \tenbf, we obviate the need % to redefine \bf itself. \def\textfonts{% \let\tenrm=\textrm \let\tenit=\textit \let\tensl=\textsl \let\tenbf=\textbf \let\tentt=\texttt \let\smallcaps=\textsc \let\tensf=\textsf \let\teni=\texti \let\tensy=\textsy \resetmathfonts} \def\chapfonts{% \let\tenrm=\chaprm \let\tenit=\chapit \let\tensl=\chapsl \let\tenbf=\chapbf \let\tentt=\chaptt \let\smallcaps=\chapsc \let\tensf=\chapsf \let\teni=\chapi \let\tensy=\chapsy \resetmathfonts} \def\secfonts{% \let\tenrm=\secrm \let\tenit=\secit \let\tensl=\secsl \let\tenbf=\secbf \let\tentt=\sectt \let\smallcaps=\secsc \let\tensf=\secsf \let\teni=\seci \let\tensy=\secsy \resetmathfonts} \def\subsecfonts{% \let\tenrm=\ssecrm \let\tenit=\ssecit \let\tensl=\ssecsl \let\tenbf=\ssecbf \let\tentt=\ssectt \let\smallcaps=\ssecsc \let\tensf=\ssecsf \let\teni=\sseci \let\tensy=\ssecsy \resetmathfonts} \def\indexfonts{% \let\tenrm=\indrm \let\tenit=\indit \let\tensl=\indsl \let\tenbf=\indbf \let\tentt=\indtt \let\smallcaps=\indsc \let\tensf=\indsf \let\teni=\indi \let\tensy=\indsy \resetmathfonts} % Set up the default fonts, so we can use them for creating boxes. % \textfonts % Count depth in font-changes, for error checks \newcount\fontdepth \fontdepth=0 % Fonts for short table of contents. \font\shortcontrm=cmr12 \font\shortcontbf=cmbx12 \font\shortcontsl=cmsl12 %% Add scribe-like font environments, plus @l for inline lisp (usually sans %% serif) and @ii for TeX italic % \smartitalic{ARG} outputs arg in italics, followed by an italic correction % unless the following character is such as not to need one. \def\smartitalicx{\ifx\next,\else\ifx\next-\else\ifx\next.\else\/\fi\fi\fi} \def\smartitalic#1{{\sl #1}\futurelet\next\smartitalicx} \let\i=\smartitalic \let\var=\smartitalic \let\dfn=\smartitalic \let\emph=\smartitalic \let\cite=\smartitalic \def\b#1{{\bf #1}} \let\strong=\b % We can't just use \exhyphenpenalty, because that only has effect at % the end of a paragraph. Restore normal hyphenation at the end of the % group within which \nohyphenation is presumably called. % \def\nohyphenation{\hyphenchar\font = -1 \aftergroup\restorehyphenation} \def\restorehyphenation{\hyphenchar\font = `- } \def\t#1{% {\tt \nohyphenation \rawbackslash \frenchspacing #1}% \null } \let\ttfont = \t %\def\samp #1{`{\tt \rawbackslash \frenchspacing #1}'\null} \def\samp #1{`\tclose{#1}'\null} \def\key #1{{\tt \nohyphenation \uppercase{#1}}\null} \def\ctrl #1{{\tt \rawbackslash \hat}#1} \let\file=\samp % @code is a modification of @t, % which makes spaces the same size as normal in the surrounding text. \def\tclose#1{% {% % Change normal interword space to be same as for the current font. \spaceskip = \fontdimen2\font % % Switch to typewriter. \tt % % But `\ ' produces the large typewriter interword space. \def\ {{\spaceskip = 0pt{} }}% % % Turn off hyphenation. \nohyphenation % \rawbackslash \frenchspacing #1% }% \null } % We *must* turn on hyphenation at `-' and `_' in \code. % Otherwise, it is too hard to avoid overful hboxes % in the Emacs manual, the Library manual, etc. % Unfortunately, TeX uses one parameter (\hyphenchar) to control % both hyphenation at - and hyphenation within words. % We must therefore turn them both off (\tclose does that) % and arrange explicitly to hyphenate an a dash. % -- rms. { \catcode`\-=\active \catcode`\_=\active \global\def\code{\begingroup \catcode`\-=\active \let-\codedash \catcode`\_=\active \let_\codeunder \codex} % The following is used by \doprintindex to insure that long function names % wrap around. It is necessary for - and _ to be active before the index is % read from the file, as \entry parses the arguments long before \code is % ever called. -- mycroft \global\def\indexbreaks{\catcode`\-=\active \let-\realdash \catcode`\_=\active \let_\realunder} } \def\realdash{-} \def\realunder{_} \def\codedash{-\discretionary{}{}{}} \def\codeunder{\normalunderscore\discretionary{}{}{}} \def\codex #1{\tclose{#1}\endgroup} %\let\exp=\tclose %Was temporary % @kbd is like @code, except that if the argument is just one @key command, % then @kbd has no effect. \def\xkey{\key} \def\kbdfoo#1#2#3\par{\def\one{#1}\def\three{#3}\def\threex{??}% \ifx\one\xkey\ifx\threex\three \key{#2}% \else\tclose{\look}\fi \else\tclose{\look}\fi} % Typeset a dimension, e.g., `in' or `pt'. The only reason for the % argument is to make the input look right: @dmn{pt} instead of % @dmn{}pt. % \def\dmn#1{\thinspace #1} \def\kbd#1{\def\look{#1}\expandafter\kbdfoo\look??\par} \def\l#1{{\li #1}\null} % \def\r#1{{\rm #1}} % roman font % Use of \lowercase was suggested. \def\sc#1{{\smallcaps#1}} % smallcaps font \def\ii#1{{\it #1}} % italic font \message{page headings,} \newskip\titlepagetopglue \titlepagetopglue = 1.5in \newskip\titlepagebottomglue \titlepagebottomglue = 2pc % First the title page. Must do @settitle before @titlepage. \def\titlefont#1{{\titlerm #1}} \newif\ifseenauthor \newif\iffinishedtitlepage \def\shorttitlepage{\parsearg\shorttitlepagezzz} \def\shorttitlepagezzz #1{\begingroup\hbox{}\vskip 1.5in \chaprm \centerline{#1}% \endgroup\page\hbox{}\page} \def\titlepage{\begingroup \parindent=0pt \textfonts \let\subtitlerm=\tenrm % I deinstalled the following change because \cmr12 is undefined. % This change was not in the ChangeLog anyway. --rms. % \let\subtitlerm=\cmr12 \def\subtitlefont{\subtitlerm \normalbaselineskip = 13pt \normalbaselines}% % \def\authorfont{\authorrm \normalbaselineskip = 16pt \normalbaselines}% % % Leave some space at the very top of the page. \vglue\titlepagetopglue % % Now you can print the title using @title. \def\title{\parsearg\titlezzz}% \def\titlezzz##1{\leftline{\titlefont{##1}} % print a rule at the page bottom also. \finishedtitlepagefalse \vskip4pt \hrule height 4pt width \hsize \vskip4pt}% % No rule at page bottom unless we print one at the top with @title. \finishedtitlepagetrue % % Now you can put text using @subtitle. \def\subtitle{\parsearg\subtitlezzz}% \def\subtitlezzz##1{{\subtitlefont \rightline{##1}}}% % % @author should come last, but may come many times. \def\author{\parsearg\authorzzz}% \def\authorzzz##1{\ifseenauthor\else\vskip 0pt plus 1filll\seenauthortrue\fi {\authorfont \leftline{##1}}}% % % Most title ``pages'' are actually two pages long, with space % at the top of the second. We don't want the ragged left on the second. \let\oldpage = \page \def\page{% \iffinishedtitlepage\else \finishtitlepage \fi \oldpage \let\page = \oldpage \hbox{}}% % \def\page{\oldpage \hbox{}} } \def\Etitlepage{% \iffinishedtitlepage\else \finishtitlepage \fi % It is important to do the page break before ending the group, % because the headline and footline are only empty inside the group. % If we use the new definition of \page, we always get a blank page % after the title page, which we certainly don't want. \oldpage \endgroup \HEADINGSon } \def\finishtitlepage{% \vskip4pt \hrule height 2pt width \hsize \vskip\titlepagebottomglue \finishedtitlepagetrue } %%% Set up page headings and footings. \let\thispage=\folio \newtoks \evenheadline % Token sequence for heading line of even pages \newtoks \oddheadline % Token sequence for heading line of odd pages \newtoks \evenfootline % Token sequence for footing line of even pages \newtoks \oddfootline % Token sequence for footing line of odd pages % Now make Tex use those variables \headline={{\textfonts\rm \ifodd\pageno \the\oddheadline \else \the\evenheadline \fi}} \footline={{\textfonts\rm \ifodd\pageno \the\oddfootline \else \the\evenfootline \fi}\HEADINGShook} \let\HEADINGShook=\relax % Commands to set those variables. % For example, this is what @headings on does % @evenheading @thistitle|@thispage|@thischapter % @oddheading @thischapter|@thispage|@thistitle % @evenfooting @thisfile|| % @oddfooting ||@thisfile \def\evenheading{\parsearg\evenheadingxxx} \def\oddheading{\parsearg\oddheadingxxx} \def\everyheading{\parsearg\everyheadingxxx} \def\evenfooting{\parsearg\evenfootingxxx} \def\oddfooting{\parsearg\oddfootingxxx} \def\everyfooting{\parsearg\everyfootingxxx} {\catcode`\@=0 % \gdef\evenheadingxxx #1{\evenheadingyyy #1@|@|@|@|\finish} \gdef\evenheadingyyy #1@|#2@|#3@|#4\finish{% \global\evenheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\oddheadingxxx #1{\oddheadingyyy #1@|@|@|@|\finish} \gdef\oddheadingyyy #1@|#2@|#3@|#4\finish{% \global\oddheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\everyheadingxxx #1{\everyheadingyyy #1@|@|@|@|\finish} \gdef\everyheadingyyy #1@|#2@|#3@|#4\finish{% \global\evenheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}} \global\oddheadline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\evenfootingxxx #1{\evenfootingyyy #1@|@|@|@|\finish} \gdef\evenfootingyyy #1@|#2@|#3@|#4\finish{% \global\evenfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\oddfootingxxx #1{\oddfootingyyy #1@|@|@|@|\finish} \gdef\oddfootingyyy #1@|#2@|#3@|#4\finish{% \global\oddfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} \gdef\everyfootingxxx #1{\everyfootingyyy #1@|@|@|@|\finish} \gdef\everyfootingyyy #1@|#2@|#3@|#4\finish{% \global\evenfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}} \global\oddfootline={\rlap{\centerline{#2}}\line{#1\hfil#3}}} % }% unbind the catcode of @. % @headings double turns headings on for double-sided printing. % @headings single turns headings on for single-sided printing. % @headings off turns them off. % @headings on same as @headings double, retained for compatibility. % @headings after turns on double-sided headings after this page. % @headings doubleafter turns on double-sided headings after this page. % @headings singleafter turns on single-sided headings after this page. % By default, they are off. \def\headings #1 {\csname HEADINGS#1\endcsname} \def\HEADINGSoff{ \global\evenheadline={\hfil} \global\evenfootline={\hfil} \global\oddheadline={\hfil} \global\oddfootline={\hfil}} \HEADINGSoff % When we turn headings on, set the page number to 1. % For double-sided printing, put current file name in lower left corner, % chapter name on inside top of right hand pages, document % title on inside top of left hand pages, and page numbers on outside top % edge of all pages. \def\HEADINGSdouble{ %\pagealignmacro \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} } % For single-sided printing, chapter title goes across top left of page, % page number on top right. \def\HEADINGSsingle{ %\pagealignmacro \global\pageno=1 \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} } \def\HEADINGSon{\HEADINGSdouble} \def\HEADINGSafter{\let\HEADINGShook=\HEADINGSdoublex} \let\HEADINGSdoubleafter=\HEADINGSafter \def\HEADINGSdoublex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\folio\hfil\thistitle}} \global\oddheadline={\line{\thischapter\hfil\folio}} } \def\HEADINGSsingleafter{\let\HEADINGShook=\HEADINGSsinglex} \def\HEADINGSsinglex{% \global\evenfootline={\hfil} \global\oddfootline={\hfil} \global\evenheadline={\line{\thischapter\hfil\folio}} \global\oddheadline={\line{\thischapter\hfil\folio}} } % Subroutines used in generating headings % Produces Day Month Year style of output. \def\today{\number\day\space \ifcase\month\or January\or February\or March\or April\or May\or June\or July\or August\or September\or October\or November\or December\fi \space\number\year} % Use this if you want the Month Day, Year style of output. %\def\today{\ifcase\month\or %January\or February\or March\or April\or May\or June\or %July\or August\or September\or October\or November\or December\fi %\space\number\day, \number\year} % @settitle line... specifies the title of the document, for headings % It generates no output of its own \def\thistitle{No Title} \def\settitle{\parsearg\settitlezzz} \def\settitlezzz #1{\gdef\thistitle{#1}} \message{tables,} % @tabs -- simple alignment % These don't work. For one thing, \+ is defined as outer. % So these macros cannot even be defined. %\def\tabs{\parsearg\tabszzz} %\def\tabszzz #1{\settabs\+#1\cr} %\def\tabline{\parsearg\tablinezzz} %\def\tablinezzz #1{\+#1\cr} %\def\&{&} % Tables -- @table, @ftable, @vtable, @item(x), @kitem(x), @xitem(x). % default indentation of table text \newdimen\tableindent \tableindent=.8in % default indentation of @itemize and @enumerate text \newdimen\itemindent \itemindent=.3in % margin between end of table item and start of table text. \newdimen\itemmargin \itemmargin=.1in % used internally for \itemindent minus \itemmargin \newdimen\itemmax % Note @table, @vtable, and @vtable define @item, @itemx, etc., with % these defs. % They also define \itemindex % to index the item name in whatever manner is desired (perhaps none). \newif\ifitemxneedsnegativevskip \def\itemxpar{\par\ifitemxneedsnegativevskip\vskip-\parskip\nobreak\fi} \def\internalBitem{\smallbreak \parsearg\itemzzz} \def\internalBitemx{\itemxpar \parsearg\itemzzz} \def\internalBxitem "#1"{\def\xitemsubtopix{#1} \smallbreak \parsearg\xitemzzz} \def\internalBxitemx "#1"{\def\xitemsubtopix{#1} \itemxpar \parsearg\xitemzzz} \def\internalBkitem{\smallbreak \parsearg\kitemzzz} \def\internalBkitemx{\itemxpar \parsearg\kitemzzz} \def\kitemzzz #1{\dosubind {kw}{\code{#1}}{for {\bf \lastfunction}}% \itemzzz {#1}} \def\xitemzzz #1{\dosubind {kw}{\code{#1}}{for {\bf \xitemsubtopic}}% \itemzzz {#1}} \def\itemzzz #1{\begingroup % \advance\hsize by -\rightskip \advance\hsize by -\tableindent \setbox0=\hbox{\itemfont{#1}}% \itemindex{#1}% \nobreak % This prevents a break before @itemx. % % Be sure we are not still in the middle of a paragraph. %{\parskip = 0in %\par %}% % % If the item text does not fit in the space we have, put it on a line % by itself, and do not allow a page break either before or after that % line. We do not start a paragraph here because then if the next % command is, e.g., @kindex, the whatsit would get put into the % horizontal list on a line by itself, resulting in extra blank space. \ifdim \wd0>\itemmax % % Make this a paragraph so we get the \parskip glue and wrapping, % but leave it ragged-right. \begingroup \advance\leftskip by-\tableindent \advance\hsize by\tableindent \advance\rightskip by0pt plus1fil \leavevmode\unhbox0\par \endgroup % % We're going to be starting a paragraph, but we don't want the % \parskip glue -- logically it's part of the @item we just started. \nobreak \vskip-\parskip % % Stop a page break at the \parskip glue coming up. Unfortunately % we can't prevent a possible page break at the following % \baselineskip glue. \nobreak \endgroup \itemxneedsnegativevskipfalse \else % The item text fits into the space. Start a paragraph, so that the % following text (if any) will end up on the same line. Since that % text will be indented by \tableindent, we make the item text be in % a zero-width box. \noindent \rlap{\hskip -\tableindent\box0}\ignorespaces% \endgroup% \itemxneedsnegativevskiptrue% \fi } \def\item{\errmessage{@item while not in a table}} \def\itemx{\errmessage{@itemx while not in a table}} \def\kitem{\errmessage{@kitem while not in a table}} \def\kitemx{\errmessage{@kitemx while not in a table}} \def\xitem{\errmessage{@xitem while not in a table}} \def\xitemx{\errmessage{@xitemx while not in a table}} %% Contains a kludge to get @end[description] to work \def\description{\tablez{\dontindex}{1}{}{}{}{}} \def\table{\begingroup\inENV\obeylines\obeyspaces\tablex} {\obeylines\obeyspaces% \gdef\tablex #1^^M{% \tabley\dontindex#1 \endtabley}} \def\ftable{\begingroup\inENV\obeylines\obeyspaces\ftablex} {\obeylines\obeyspaces% \gdef\ftablex #1^^M{% \tabley\fnitemindex#1 \endtabley \def\Eftable{\endgraf\afterenvbreak\endgroup}% \let\Etable=\relax}} \def\vtable{\begingroup\inENV\obeylines\obeyspaces\vtablex} {\obeylines\obeyspaces% \gdef\vtablex #1^^M{% \tabley\vritemindex#1 \endtabley \def\Evtable{\endgraf\afterenvbreak\endgroup}% \let\Etable=\relax}} \def\dontindex #1{} \def\fnitemindex #1{\doind {fn}{\code{#1}}}% \def\vritemindex #1{\doind {vr}{\code{#1}}}% {\obeyspaces % \gdef\tabley#1#2 #3 #4 #5 #6 #7\endtabley{\endgroup% \tablez{#1}{#2}{#3}{#4}{#5}{#6}}} \def\tablez #1#2#3#4#5#6{% \aboveenvbreak % \begingroup % \def\Edescription{\Etable}% Neccessary kludge. \let\itemindex=#1% \ifnum 0#3>0 \advance \leftskip by #3\mil \fi % \ifnum 0#4>0 \tableindent=#4\mil \fi % \ifnum 0#5>0 \advance \rightskip by #5\mil \fi % \def\itemfont{#2}% \itemmax=\tableindent % \advance \itemmax by -\itemmargin % \advance \leftskip by \tableindent % \exdentamount=\tableindent \parindent = 0pt \parskip = \smallskipamount \ifdim \parskip=0pt \parskip=2pt \fi% \def\Etable{\endgraf\afterenvbreak\endgroup}% \let\item = \internalBitem % \let\itemx = \internalBitemx % \let\kitem = \internalBkitem % \let\kitemx = \internalBkitemx % \let\xitem = \internalBxitem % \let\xitemx = \internalBxitemx % } % This is the counter used by @enumerate, which is really @itemize \newcount \itemno \def\itemize{\parsearg\itemizezzz} \def\itemizezzz #1{% \begingroup % ended by the @end itemize \itemizey {#1}{\Eitemize} } \def\itemizey #1#2{% \aboveenvbreak % \itemmax=\itemindent % \advance \itemmax by -\itemmargin % \advance \leftskip by \itemindent % \exdentamount=\itemindent \parindent = 0pt % \parskip = \smallskipamount % \ifdim \parskip=0pt \parskip=2pt \fi% \def#2{\endgraf\afterenvbreak\endgroup}% \def\itemcontents{#1}% \let\item=\itemizeitem} % Set sfcode to normal for the chars that usually have another value. % These are `.?!:;,' \def\frenchspacing{\sfcode46=1000 \sfcode63=1000 \sfcode33=1000 \sfcode58=1000 \sfcode59=1000 \sfcode44=1000 } % \splitoff TOKENS\endmark defines \first to be the first token in % TOKENS, and \rest to be the remainder. % \def\splitoff#1#2\endmark{\def\first{#1}\def\rest{#2}}% % Allow an optional argument of an uppercase letter, lowercase letter, % or number, to specify the first label in the enumerated list. No % argument is the same as `1'. % \def\enumerate{\parsearg\enumeratezzz} \def\enumeratezzz #1{\enumeratey #1 \endenumeratey} \def\enumeratey #1 #2\endenumeratey{% \begingroup % ended by the @end enumerate % % If we were given no argument, pretend we were given `1'. \def\thearg{#1}% \ifx\thearg\empty \def\thearg{1}\fi % % Detect if the argument is a single token. If so, it might be a % letter. Otherwise, the only valid thing it can be is a number. % (We will always have one token, because of the test we just made. % This is a good thing, since \splitoff doesn't work given nothing at % all -- the first parameter is undelimited.) \expandafter\splitoff\thearg\endmark \ifx\rest\empty % Only one token in the argument. It could still be anything. % A ``lowercase letter'' is one whose \lccode is nonzero. % An ``uppercase letter'' is one whose \lccode is both nonzero, and % not equal to itself. % Otherwise, we assume it's a number. % % We need the \relax at the end of the \ifnum lines to stop TeX from % continuing to look for a . % \ifnum\lccode\expandafter`\thearg=0\relax \numericenumerate % a number (we hope) \else % It's a letter. \ifnum\lccode\expandafter`\thearg=\expandafter`\thearg\relax \lowercaseenumerate % lowercase letter \else \uppercaseenumerate % uppercase letter \fi \fi \else % Multiple tokens in the argument. We hope it's a number. \numericenumerate \fi } % An @enumerate whose labels are integers. The starting integer is % given in \thearg. % \def\numericenumerate{% \itemno = \thearg \startenumeration{\the\itemno}% } % The starting (lowercase) letter is in \thearg. \def\lowercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more lowercase letters in @enumerate; get a bigger alphabet}% \fi \char\lccode\itemno }% } % The starting (uppercase) letter is in \thearg. \def\uppercaseenumerate{% \itemno = \expandafter`\thearg \startenumeration{% % Be sure we're not beyond the end of the alphabet. \ifnum\itemno=0 \errmessage{No more uppercase letters in @enumerate; get a bigger alphabet} \fi \char\uccode\itemno }% } % Call itemizey, adding a period to the first argument and supplying the % common last two arguments. Also subtract one from the initial value in % \itemno, since @item increments \itemno. % \def\startenumeration#1{% \advance\itemno by -1 \itemizey{#1.}\Eenumerate\flushcr } % @alphaenumerate and @capsenumerate are abbreviations for giving an arg % to @enumerate. % \def\alphaenumerate{\enumerate{a}} \def\capsenumerate{\enumerate{A}} \def\Ealphaenumerate{\Eenumerate} \def\Ecapsenumerate{\Eenumerate} % Definition of @item while inside @itemize. \def\itemizeitem{% \advance\itemno by 1 {\let\par=\endgraf \smallbreak}% \ifhmode \errmessage{\in hmode at itemizeitem}\fi {\parskip=0in \hskip 0pt \hbox to 0pt{\hss \itemcontents\hskip \itemmargin}% \vadjust{\penalty 1200}}% \flushcr} \message{indexing,} % Index generation facilities % Define \newwrite to be identical to plain tex's \newwrite % except not \outer, so it can be used within \newindex. {\catcode`\@=11 \gdef\newwrite{\alloc@7\write\chardef\sixt@@n}} % \newindex {foo} defines an index named foo. % It automatically defines \fooindex such that % \fooindex ...rest of line... puts an entry in the index foo. % It also defines \fooindfile to be the number of the output channel for % the file that accumulates this index. The file's extension is foo. % The name of an index should be no more than 2 characters long % for the sake of vms. \def\newindex #1{ \expandafter\newwrite \csname#1indfile\endcsname% Define number for output file \openout \csname#1indfile\endcsname \jobname.#1 % Open the file \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\doindex {#1}} } % @defindex foo == \newindex{foo} \def\defindex{\parsearg\newindex} % Define @defcodeindex, like @defindex except put all entries in @code. \def\newcodeindex #1{ \expandafter\newwrite \csname#1indfile\endcsname% Define number for output file \openout \csname#1indfile\endcsname \jobname.#1 % Open the file \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\docodeindex {#1}} } \def\defcodeindex{\parsearg\newcodeindex} % @synindex foo bar makes index foo feed into index bar. % Do this instead of @defindex foo if you don't want it as a separate index. \def\synindex #1 #2 {% \expandafter\let\expandafter\synindexfoo\expandafter=\csname#2indfile\endcsname \expandafter\let\csname#1indfile\endcsname=\synindexfoo \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\doindex {#2}}% } % @syncodeindex foo bar similar, but put all entries made for index foo % inside @code. \def\syncodeindex #1 #2 {% \expandafter\let\expandafter\synindexfoo\expandafter=\csname#2indfile\endcsname \expandafter\let\csname#1indfile\endcsname=\synindexfoo \expandafter\xdef\csname#1index\endcsname{% % Define \xxxindex \noexpand\docodeindex {#2}}% } % Define \doindex, the driver for all \fooindex macros. % Argument #1 is generated by the calling \fooindex macro, % and it is "foo", the name of the index. % \doindex just uses \parsearg; it calls \doind for the actual work. % This is because \doind is more useful to call from other macros. % There is also \dosubind {index}{topic}{subtopic} % which makes an entry in a two-level index such as the operation index. \def\doindex#1{\edef\indexname{#1}\parsearg\singleindexer} \def\singleindexer #1{\doind{\indexname}{#1}} % like the previous two, but they put @code around the argument. \def\docodeindex#1{\edef\indexname{#1}\parsearg\singlecodeindexer} \def\singlecodeindexer #1{\doind{\indexname}{\code{#1}}} \def\indexdummies{% \def\_{{\realbackslash _}}% \def\w{\realbackslash w }% \def\bf{\realbackslash bf }% \def\rm{\realbackslash rm }% \def\sl{\realbackslash sl }% \def\sf{\realbackslash sf}% \def\tt{\realbackslash tt}% \def\gtr{\realbackslash gtr}% \def\less{\realbackslash less}% \def\hat{\realbackslash hat}% \def\char{\realbackslash char}% \def\TeX{\realbackslash TeX}% \def\dots{\realbackslash dots }% \def\copyright{\realbackslash copyright }% \def\tclose##1{\realbackslash tclose {##1}}% \def\code##1{\realbackslash code {##1}}% \def\samp##1{\realbackslash samp {##1}}% \def\t##1{\realbackslash r {##1}}% \def\r##1{\realbackslash r {##1}}% \def\i##1{\realbackslash i {##1}}% \def\b##1{\realbackslash b {##1}}% \def\cite##1{\realbackslash cite {##1}}% \def\key##1{\realbackslash key {##1}}% \def\file##1{\realbackslash file {##1}}% \def\var##1{\realbackslash var {##1}}% \def\kbd##1{\realbackslash kbd {##1}}% \def\dfn##1{\realbackslash dfn {##1}}% \def\emph##1{\realbackslash emph {##1}}% } % \indexnofonts no-ops all font-change commands. % This is used when outputting the strings to sort the index by. \def\indexdummyfont#1{#1} \def\indexdummytex{TeX} \def\indexdummydots{...} \def\indexnofonts{% \let\w=\indexdummyfont \let\t=\indexdummyfont \let\r=\indexdummyfont \let\i=\indexdummyfont \let\b=\indexdummyfont \let\emph=\indexdummyfont \let\strong=\indexdummyfont \let\cite=\indexdummyfont \let\sc=\indexdummyfont %Don't no-op \tt, since it isn't a user-level command % and is used in the definitions of the active chars like <, >, |... %\let\tt=\indexdummyfont \let\tclose=\indexdummyfont \let\code=\indexdummyfont \let\file=\indexdummyfont \let\samp=\indexdummyfont \let\kbd=\indexdummyfont \let\key=\indexdummyfont \let\var=\indexdummyfont \let\TeX=\indexdummytex \let\dots=\indexdummydots } % To define \realbackslash, we must make \ not be an escape. % We must first make another character (@) an escape % so we do not become unable to do a definition. {\catcode`\@=0 \catcode`\\=\other @gdef@realbackslash{\}} \let\indexbackslash=0 %overridden during \printindex. \def\doind #1#2{% {\count10=\lastpenalty % {\indexdummies % Must do this here, since \bf, etc expand at this stage \escapechar=`\\% {\let\folio=0% Expand all macros now EXCEPT \folio \def\rawbackslashxx{\indexbackslash}% \indexbackslash isn't defined now % so it will be output as is; and it will print as backslash in the indx. % % Now process the index-string once, with all font commands turned off, % to get the string to sort the index by. {\indexnofonts \xdef\temp1{#2}% }% % Now produce the complete index entry. We process the index-string again, % this time with font commands expanded, to get what to print in the index. \edef\temp{% \write \csname#1indfile\endcsname{% \realbackslash entry {\temp1}{\folio}{#2}}}% \temp }% }\penalty\count10}} \def\dosubind #1#2#3{% {\count10=\lastpenalty % {\indexdummies % Must do this here, since \bf, etc expand at this stage \escapechar=`\\% {\let\folio=0% \def\rawbackslashxx{\indexbackslash}% % % Now process the index-string once, with all font commands turned off, % to get the string to sort the index by. {\indexnofonts \xdef\temp1{#2 #3}% }% % Now produce the complete index entry. We process the index-string again, % this time with font commands expanded, to get what to print in the index. \edef\temp{% \write \csname#1indfile\endcsname{% \realbackslash entry {\temp1}{\folio}{#2}{#3}}}% \temp }% }\penalty\count10}} % The index entry written in the file actually looks like % \entry {sortstring}{page}{topic} % or % \entry {sortstring}{page}{topic}{subtopic} % The texindex program reads in these files and writes files % containing these kinds of lines: % \initial {c} % before the first topic whose initial is c % \entry {topic}{pagelist} % for a topic that is used without subtopics % \primary {topic} % for the beginning of a topic that is used with subtopics % \secondary {subtopic}{pagelist} % for each subtopic. % Define the user-accessible indexing commands % @findex, @vindex, @kindex, @cindex. \def\findex {\fnindex} \def\kindex {\kyindex} \def\cindex {\cpindex} \def\vindex {\vrindex} \def\tindex {\tpindex} \def\pindex {\pgindex} \def\cindexsub {\begingroup\obeylines\cindexsub} {\obeylines % \gdef\cindexsub "#1" #2^^M{\endgroup % \dosubind{cp}{#2}{#1}}} % Define the macros used in formatting output of the sorted index material. % This is what you call to cause a particular index to get printed. % Write % @unnumbered Function Index % @printindex fn \def\printindex{\parsearg\doprintindex} \def\doprintindex#1{% \tex \dobreak \chapheadingskip {10000} \catcode`\%=\other\catcode`\&=\other\catcode`\#=\other \catcode`\$=\other \catcode`\~=\other \indexbreaks % % The following don't help, since the chars were translated % when the raw index was written, and their fonts were discarded % due to \indexnofonts. %\catcode`\"=\active %\catcode`\^=\active %\catcode`\_=\active %\catcode`\|=\active %\catcode`\<=\active %\catcode`\>=\active % % \def\indexbackslash{\rawbackslashxx} \indexfonts\rm \tolerance=9500 \advance\baselineskip -1pt \begindoublecolumns % % See if the index file exists and is nonempty. \openin 1 \jobname.#1s \ifeof 1 % \enddoublecolumns gets confused if there is no text in the index, % and it loses the chapter title and the aux file entries for the % index. The easiest way to prevent this problem is to make sure % there is some text. (Index is nonexistent) \else % % If the index file exists but is empty, then \openin leaves \ifeof % false. We have to make TeX try to read something from the file, so % it can discover if there is anything in it. \read 1 to \temp \ifeof 1 (Index is empty) \else \input \jobname.#1s \fi \fi \closein 1 \enddoublecolumns \Etex } % These macros are used by the sorted index file itself. % Change them to control the appearance of the index. % Same as \bigskipamount except no shrink. % \balancecolumns gets confused if there is any shrink. \newskip\initialskipamount \initialskipamount 12pt plus4pt \def\initial #1{% {\let\tentt=\sectt \let\tt=\sectt \let\sf=\sectt \ifdim\lastskip<\initialskipamount \removelastskip \penalty-200 \vskip \initialskipamount\fi \line{\secbf#1\hfill}\kern 2pt\penalty10000}} % This typesets a paragraph consisting of #1, dot leaders, and then #2 % flush to the right margin. It is used for index and table of contents % entries. The paragraph is indented by \leftskip. % \def\entry #1#2{\begingroup % % Start a new paragraph if necessary, so our assignments below can't % affect previous text. \par % % Do not fill out the last line with white space. \parfillskip = 0in % % No extra space above this paragraph. \parskip = 0in % % Do not prefer a separate line ending with a hyphen to fewer lines. \finalhyphendemerits = 0 % % \hangindent is only relevant when the entry text and page number % don't both fit on one line. In that case, bob suggests starting the % dots pretty far over on the line. Unfortunately, a large % indentation looks wrong when the entry text itself is broken across % lines. So we use a small indentation and put up with long leaders. % % \hangafter is reset to 1 (which is the value we want) at the start % of each paragraph, so we need not do anything with that. \hangindent=2em % % When the entry text needs to be broken, just fill out the first line % with blank space. \rightskip = 0pt plus1fil % % Start a ``paragraph'' for the index entry so the line breaking % parameters we've set above will have an effect. \noindent % % Insert the text of the index entry. TeX will do line-breaking on it. #1% % The following is kluged to not output a line of dots in the index if % there are no page numbers. The next person who breaks this will be % cursed by a Unix daemon. \def\tempa{{\rm }}% \def\tempb{#2}% \edef\tempc{\tempa}% \edef\tempd{\tempb}% \ifx\tempc\tempd\ \else% % % If we must, put the page number on a line of its own, and fill out % this line with blank space. (The \hfil is overwhelmed with the % fill leaders glue in \indexdotfill if the page number does fit.) \hfil\penalty50 \null\nobreak\indexdotfill % Have leaders before the page number. % % The `\ ' here is removed by the implicit \unskip that TeX does as % part of (the primitive) \par. Without it, a spurious underfull % \hbox ensues. \ #2% The page number ends the paragraph. \fi% \par \endgroup} % Like \dotfill except takes at least 1 em. \def\indexdotfill{\cleaders \hbox{$\mathsurround=0pt \mkern1.5mu ${\it .}$ \mkern1.5mu$}\hskip 1em plus 1fill} \def\primary #1{\line{#1\hfil}} \newskip\secondaryindent \secondaryindent=0.5cm \def\secondary #1#2{ {\parfillskip=0in \parskip=0in \hangindent =1in \hangafter=1 \noindent\hskip\secondaryindent\hbox{#1}\indexdotfill #2\par }} %% Define two-column mode, which is used in indexes. %% Adapted from the TeXbook, page 416. \catcode `\@=11 \newbox\partialpage \newdimen\doublecolumnhsize \def\begindoublecolumns{\begingroup % Grab any single-column material above us. \output = {\global\setbox\partialpage =\vbox{\unvbox255\kern -\topskip \kern \baselineskip}}% \eject % % Now switch to the double-column output routine. \output={\doublecolumnout}% % % Change the page size parameters. We could do this once outside this % routine, in each of @smallbook, @afourpaper, and the default 8.5x11 % format, but then we repeat the same computation. Repeating a couple % of assignments once per index is clearly meaningless for the % execution time, so we may as well do it once. % % First we halve the line length, less a little for the gutter between % the columns. We compute the gutter based on the line length, so it % changes automatically with the paper format. The magic constant % below is chosen so that the gutter has the same value (well, +- < % 1pt) as it did when we hard-coded it. % % We put the result in a separate register, \doublecolumhsize, so we % can restore it in \pagesofar, after \hsize itself has (potentially) % been clobbered. % \doublecolumnhsize = \hsize \advance\doublecolumnhsize by -.04154\hsize \divide\doublecolumnhsize by 2 \hsize = \doublecolumnhsize % % Double the \vsize as well. (We don't need a separate register here, % since nobody clobbers \vsize.) \vsize = 2\vsize \doublecolumnpagegoal } \def\enddoublecolumns{\eject \endgroup \pagegoal=\vsize \unvbox\partialpage} \def\doublecolumnsplit{\splittopskip=\topskip \splitmaxdepth=\maxdepth \global\dimen@=\pageheight \global\advance\dimen@ by-\ht\partialpage \global\setbox1=\vsplit255 to\dimen@ \global\setbox0=\vbox{\unvbox1} \global\setbox3=\vsplit255 to\dimen@ \global\setbox2=\vbox{\unvbox3} \ifdim\ht0>\dimen@ \setbox255=\vbox{\unvbox0\unvbox2} \global\setbox255=\copy5 \fi \ifdim\ht2>\dimen@ \setbox255=\vbox{\unvbox0\unvbox2} \global\setbox255=\copy5 \fi } \def\doublecolumnpagegoal{% \dimen@=\vsize \advance\dimen@ by-2\ht\partialpage \global\pagegoal=\dimen@ } \def\pagesofar{\unvbox\partialpage % \hsize=\doublecolumnhsize % have to restore this since output routine \wd0=\hsize \wd2=\hsize \hbox to\pagewidth{\box0\hfil\box2}} \def\doublecolumnout{% \setbox5=\copy255 {\vbadness=10000 \doublecolumnsplit} \ifvbox255 \setbox0=\vtop to\dimen@{\unvbox0} \setbox2=\vtop to\dimen@{\unvbox2} \onepageout\pagesofar \unvbox255 \penalty\outputpenalty \else \setbox0=\vbox{\unvbox5} \ifvbox0 \dimen@=\ht0 \advance\dimen@ by\topskip \advance\dimen@ by-\baselineskip \divide\dimen@ by2 \splittopskip=\topskip \splitmaxdepth=\maxdepth {\vbadness=10000 \loop \global\setbox5=\copy0 \setbox1=\vsplit5 to\dimen@ \setbox3=\vsplit5 to\dimen@ \ifvbox5 \global\advance\dimen@ by1pt \repeat \setbox0=\vbox to\dimen@{\unvbox1} \setbox2=\vbox to\dimen@{\unvbox3} \global\setbox\partialpage=\vbox{\pagesofar} \doublecolumnpagegoal } \fi \fi } \catcode `\@=\other \message{sectioning,} % Define chapters, sections, etc. \newcount \chapno \newcount \secno \secno=0 \newcount \subsecno \subsecno=0 \newcount \subsubsecno \subsubsecno=0 % This counter is funny since it counts through charcodes of letters A, B, ... \newcount \appendixno \appendixno = `\@ \def\appendixletter{\char\the\appendixno} \newwrite \contentsfile % This is called from \setfilename. \def\opencontents{\openout \contentsfile = \jobname.toc} % Each @chapter defines this as the name of the chapter. % page headings and footings can use it. @section does likewise \def\thischapter{} \def\thissection{} \def\seccheck#1{\if \pageno<0 % \errmessage{@#1 not allowed after generating table of contents}\fi % } \def\chapternofonts{% \let\rawbackslash=\relax% \let\frenchspacing=\relax% \def\result{\realbackslash result} \def\equiv{\realbackslash equiv} \def\expansion{\realbackslash expansion} \def\print{\realbackslash print} \def\TeX{\realbackslash TeX} \def\dots{\realbackslash dots} \def\copyright{\realbackslash copyright} \def\tt{\realbackslash tt} \def\bf{\realbackslash bf } \def\w{\realbackslash w} \def\less{\realbackslash less} \def\gtr{\realbackslash gtr} \def\hat{\realbackslash hat} \def\char{\realbackslash char} \def\tclose##1{\realbackslash tclose {##1}} \def\code##1{\realbackslash code {##1}} \def\samp##1{\realbackslash samp {##1}} \def\r##1{\realbackslash r {##1}} \def\b##1{\realbackslash b {##1}} \def\key##1{\realbackslash key {##1}} \def\file##1{\realbackslash file {##1}} \def\kbd##1{\realbackslash kbd {##1}} % These are redefined because @smartitalic wouldn't work inside xdef. \def\i##1{\realbackslash i {##1}} \def\cite##1{\realbackslash cite {##1}} \def\var##1{\realbackslash var {##1}} \def\emph##1{\realbackslash emph {##1}} \def\dfn##1{\realbackslash dfn {##1}} } \newcount\absseclevel % used to calculate proper heading level \newcount\secbase\secbase=0 % @raise/lowersections modify this count % @raisesections: treat @section as chapter, @subsection as section, etc. \def\raisesections{\global\advance\secbase by -1} \let\up=\raisesections % original BFox name % @lowersections: treat @chapter as section, @section as subsection, etc. \def\lowersections{\global\advance\secbase by 1} \let\down=\lowersections % original BFox name % Choose a numbered-heading macro % #1 is heading level if unmodified by @raisesections or @lowersections % #2 is text for heading \def\numhead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \chapterzzz{#2} \or \seczzz{#2} \or \numberedsubseczzz{#2} \or \numberedsubsubseczzz{#2} \else \ifnum \absseclevel<0 \chapterzzz{#2} \else \numberedsubsubseczzz{#2} \fi \fi } % like \numhead, but chooses appendix heading levels \def\apphead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \appendixzzz{#2} \or \appendixsectionzzz{#2} \or \appendixsubseczzz{#2} \or \appendixsubsubseczzz{#2} \else \ifnum \absseclevel<0 \appendixzzz{#2} \else \appendixsubsubseczzz{#2} \fi \fi } % like \numhead, but chooses numberless heading levels \def\unnmhead#1#2{\absseclevel=\secbase\advance\absseclevel by #1 \ifcase\absseclevel \unnumberedzzz{#2} \or \unnumberedseczzz{#2} \or \unnumberedsubseczzz{#2} \or \unnumberedsubsubseczzz{#2} \else \ifnum \absseclevel<0 \unnumberedzzz{#2} \else \unnumberedsubsubseczzz{#2} \fi \fi } \def\thischaptername{No Chapter Title} \outer\def\chapter{\parsearg\chapteryyy} \def\chapteryyy #1{\numhead0{#1}} % normally numhead0 calls chapterzzz \def\chapterzzz #1{\seccheck{chapter}% \secno=0 \subsecno=0 \subsubsecno=0 \global\advance \chapno by 1 \message{Chapter \the\chapno}% \chapmacro {#1}{\the\chapno}% \gdef\thissection{#1}% \gdef\thischaptername{#1}% % We don't substitute the actual chapter name into \thischapter % because we don't want its macros evaluated now. \xdef\thischapter{Chapter \the\chapno: \noexpand\thischaptername}% {\chapternofonts% \edef\temp{{\realbackslash chapentry {#1}{\the\chapno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \global\let\section = \numberedsec \global\let\subsection = \numberedsubsec \global\let\subsubsection = \numberedsubsubsec }} \outer\def\appendix{\parsearg\appendixyyy} \def\appendixyyy #1{\apphead0{#1}} % normally apphead0 calls appendixzzz \def\appendixzzz #1{\seccheck{appendix}% \secno=0 \subsecno=0 \subsubsecno=0 \global\advance \appendixno by 1 \message{Appendix \appendixletter}% \chapmacro {#1}{Appendix \appendixletter}% \gdef\thissection{#1}% \gdef\thischaptername{#1}% \xdef\thischapter{Appendix \appendixletter: \noexpand\thischaptername}% {\chapternofonts% \edef\temp{{\realbackslash chapentry {#1}{Appendix \appendixletter}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \global\let\section = \appendixsec \global\let\subsection = \appendixsubsec \global\let\subsubsection = \appendixsubsubsec }} \outer\def\top{\parsearg\unnumberedyyy} \outer\def\unnumbered{\parsearg\unnumberedyyy} \def\unnumberedyyy #1{\unnmhead0{#1}} % normally unnmhead0 calls unnumberedzzz \def\unnumberedzzz #1{\seccheck{unnumbered}% \secno=0 \subsecno=0 \subsubsecno=0 % % This used to be simply \message{#1}, but TeX fully expands the % argument to \message. Therefore, if #1 contained @-commands, TeX % expanded them. For example, in `@unnumbered The @cite{Book}', TeX % expanded @cite (which turns out to cause errors because \cite is meant % to be executed, not expanded). % % Anyway, we don't want the fully-expanded definition of @cite to appear % as a result of the \message, we just want `@cite' itself. We use % \the to achieve this: TeX expands \the only once, % simply yielding the contents of the . \toks0 = {#1}\message{(\the\toks0)}% % \unnumbchapmacro {#1}% \gdef\thischapter{#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbchapentry {#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \global\let\section = \unnumberedsec \global\let\subsection = \unnumberedsubsec \global\let\subsubsection = \unnumberedsubsubsec }} \outer\def\numberedsec{\parsearg\secyyy} \def\secyyy #1{\numhead1{#1}} % normally calls seczzz \def\seczzz #1{\seccheck{section}% \subsecno=0 \subsubsecno=0 \global\advance \secno by 1 % \gdef\thissection{#1}\secheading {#1}{\the\chapno}{\the\secno}% {\chapternofonts% \edef\temp{{\realbackslash secentry % {#1}{\the\chapno}{\the\secno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appenixsection{\parsearg\appendixsecyyy} \outer\def\appendixsec{\parsearg\appendixsecyyy} \def\appendixsecyyy #1{\apphead1{#1}} % normally calls appendixsectionzzz \def\appendixsectionzzz #1{\seccheck{appendixsection}% \subsecno=0 \subsubsecno=0 \global\advance \secno by 1 % \gdef\thissection{#1}\secheading {#1}{\appendixletter}{\the\secno}% {\chapternofonts% \edef\temp{{\realbackslash secentry % {#1}{\appendixletter}{\the\secno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsec{\parsearg\unnumberedsecyyy} \def\unnumberedsecyyy #1{\unnmhead1{#1}} % normally calls unnumberedseczzz \def\unnumberedseczzz #1{\seccheck{unnumberedsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} \outer\def\numberedsubsec{\parsearg\numberedsubsecyyy} \def\numberedsubsecyyy #1{\numhead2{#1}} % normally calls numberedsubseczzz \def\numberedsubseczzz #1{\seccheck{subsection}% \gdef\thissection{#1}\subsubsecno=0 \global\advance \subsecno by 1 % \subsecheading {#1}{\the\chapno}{\the\secno}{\the\subsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsecentry % {#1}{\the\chapno}{\the\secno}{\the\subsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appendixsubsec{\parsearg\appendixsubsecyyy} \def\appendixsubsecyyy #1{\apphead2{#1}} % normally calls appendixsubseczzz \def\appendixsubseczzz #1{\seccheck{appendixsubsec}% \gdef\thissection{#1}\subsubsecno=0 \global\advance \subsecno by 1 % \subsecheading {#1}{\appendixletter}{\the\secno}{\the\subsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsecentry % {#1}{\appendixletter}{\the\secno}{\the\subsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsubsec{\parsearg\unnumberedsubsecyyy} \def\unnumberedsubsecyyy #1{\unnmhead2{#1}} %normally calls unnumberedsubseczzz \def\unnumberedsubseczzz #1{\seccheck{unnumberedsubsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsubsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} \outer\def\numberedsubsubsec{\parsearg\numberedsubsubsecyyy} \def\numberedsubsubsecyyy #1{\numhead3{#1}} % normally numberedsubsubseczzz \def\numberedsubsubseczzz #1{\seccheck{subsubsection}% \gdef\thissection{#1}\global\advance \subsubsecno by 1 % \subsubsecheading {#1} {\the\chapno}{\the\secno}{\the\subsecno}{\the\subsubsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsubsecentry % {#1} {\the\chapno}{\the\secno}{\the\subsecno}{\the\subsubsecno} {\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \donoderef % \penalty 10000 % }} \outer\def\appendixsubsubsec{\parsearg\appendixsubsubsecyyy} \def\appendixsubsubsecyyy #1{\apphead3{#1}} % normally appendixsubsubseczzz \def\appendixsubsubseczzz #1{\seccheck{appendixsubsubsec}% \gdef\thissection{#1}\global\advance \subsubsecno by 1 % \subsubsecheading {#1} {\appendixletter}{\the\secno}{\the\subsecno}{\the\subsubsecno}% {\chapternofonts% \edef\temp{{\realbackslash subsubsecentry{#1}% {\appendixletter} {\the\secno}{\the\subsecno}{\the\subsubsecno}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \appendixnoderef % \penalty 10000 % }} \outer\def\unnumberedsubsubsec{\parsearg\unnumberedsubsubsecyyy} \def\unnumberedsubsubsecyyy #1{\unnmhead3{#1}} %normally unnumberedsubsubseczzz \def\unnumberedsubsubseczzz #1{\seccheck{unnumberedsubsubsec}% \plainsecheading {#1}\gdef\thissection{#1}% {\chapternofonts% \edef\temp{{\realbackslash unnumbsubsubsecentry{#1}{\noexpand\folio}}}% \escapechar=`\\% \write \contentsfile \temp % \unnumbnoderef % \penalty 10000 % }} % These are variants which are not "outer", so they can appear in @ifinfo. % Actually, they should now be obsolete; ordinary section commands should work. \def\infotop{\parsearg\unnumberedzzz} \def\infounnumbered{\parsearg\unnumberedzzz} \def\infounnumberedsec{\parsearg\unnumberedseczzz} \def\infounnumberedsubsec{\parsearg\unnumberedsubseczzz} \def\infounnumberedsubsubsec{\parsearg\unnumberedsubsubseczzz} \def\infoappendix{\parsearg\appendixzzz} \def\infoappendixsec{\parsearg\appendixseczzz} \def\infoappendixsubsec{\parsearg\appendixsubseczzz} \def\infoappendixsubsubsec{\parsearg\appendixsubsubseczzz} \def\infochapter{\parsearg\chapterzzz} \def\infosection{\parsearg\sectionzzz} \def\infosubsection{\parsearg\subsectionzzz} \def\infosubsubsection{\parsearg\subsubsectionzzz} % These macros control what the section commands do, according % to what kind of chapter we are in (ordinary, appendix, or unnumbered). % Define them by default for a numbered chapter. \global\let\section = \numberedsec \global\let\subsection = \numberedsubsec \global\let\subsubsection = \numberedsubsubsec % Define @majorheading, @heading and @subheading % NOTE on use of \vbox for chapter headings, section headings, and % such: % 1) We use \vbox rather than the earlier \line to permit % overlong headings to fold. % 2) \hyphenpenalty is set to 10000 because hyphenation in a % heading is obnoxious; this forbids it. % 3) Likewise, headings look best if no \parindent is used, and % if justification is not attempted. Hence \raggedright. \def\majorheading{\parsearg\majorheadingzzz} \def\majorheadingzzz #1{% {\advance\chapheadingskip by 10pt \chapbreak }% {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 200} \def\chapheading{\parsearg\chapheadingzzz} \def\chapheadingzzz #1{\chapbreak % {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 200} \def\heading{\parsearg\secheadingi} \def\subheading{\parsearg\subsecheadingi} \def\subsubheading{\parsearg\subsubsecheadingi} % These macros generate a chapter, section, etc. heading only % (including whitespace, linebreaking, etc. around it), % given all the information in convenient, parsed form. %%% Args are the skip and penalty (usually negative) \def\dobreak#1#2{\par\ifdim\lastskip<#1\removelastskip\penalty#2\vskip#1\fi} \def\setchapterstyle #1 {\csname CHAPF#1\endcsname} %%% Define plain chapter starts, and page on/off switching for it % Parameter controlling skip before chapter headings (if needed) \newskip \chapheadingskip \chapheadingskip = 30pt plus 8pt minus 4pt \def\chapbreak{\dobreak \chapheadingskip {-4000}} \def\chappager{\par\vfill\supereject} \def\chapoddpage{\chappager \ifodd\pageno \else \hbox to 0pt{} \chappager\fi} \def\setchapternewpage #1 {\csname CHAPPAG#1\endcsname} \def\CHAPPAGoff{ \global\let\pchapsepmacro=\chapbreak \global\let\pagealignmacro=\chappager} \def\CHAPPAGon{ \global\let\pchapsepmacro=\chappager \global\let\pagealignmacro=\chappager \global\def\HEADINGSon{\HEADINGSsingle}} \def\CHAPPAGodd{ \global\let\pchapsepmacro=\chapoddpage \global\let\pagealignmacro=\chapoddpage \global\def\HEADINGSon{\HEADINGSdouble}} \CHAPPAGon \def\CHAPFplain{ \global\let\chapmacro=\chfplain \global\let\unnumbchapmacro=\unnchfplain} \def\chfplain #1#2{% \pchapsepmacro {% \chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #2\enspace #1}% }% \bigskip \penalty5000 } \def\unnchfplain #1{% \pchapsepmacro % {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 10000 % } \CHAPFplain % The default \def\unnchfopen #1{% \chapoddpage {\chapfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}\bigskip \par\penalty 10000 % } \def\chfopen #1#2{\chapoddpage {\chapfonts \vbox to 3in{\vfil \hbox to\hsize{\hfil #2} \hbox to\hsize{\hfil #1} \vfil}}% \par\penalty 5000 % } \def\CHAPFopen{ \global\let\chapmacro=\chfopen \global\let\unnumbchapmacro=\unnchfopen} % Parameter controlling skip before section headings. \newskip \subsecheadingskip \subsecheadingskip = 17pt plus 8pt minus 4pt \def\subsecheadingbreak{\dobreak \subsecheadingskip {-500}} \newskip \secheadingskip \secheadingskip = 21pt plus 8pt minus 4pt \def\secheadingbreak{\dobreak \secheadingskip {-1000}} % @paragraphindent is defined for the Info formatting commands only. \let\paragraphindent=\comment % Section fonts are the base font at magstep2, which produces % a size a bit more than 14 points in the default situation. \def\secheading #1#2#3{\secheadingi {#2.#3\enspace #1}} \def\plainsecheading #1{\secheadingi {#1}} \def\secheadingi #1{{\advance \secheadingskip by \parskip % \secheadingbreak}% {\secfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000 } % Subsection fonts are the base font at magstep1, % which produces a size of 12 points. \def\subsecheading #1#2#3#4{\subsecheadingi {#2.#3.#4\enspace #1}} \def\subsecheadingi #1{{\advance \subsecheadingskip by \parskip % \subsecheadingbreak}% {\subsecfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000 } \def\subsubsecfonts{\subsecfonts} % Maybe this should change: % Perhaps make sssec fonts scaled % magstep half \def\subsubsecheading #1#2#3#4#5{\subsubsecheadingi {#2.#3.#4.#5\enspace #1}} \def\subsubsecheadingi #1{{\advance \subsecheadingskip by \parskip % \subsecheadingbreak}% {\subsubsecfonts \vbox{\hyphenpenalty=10000\tolerance=5000 \parindent=0pt\raggedright \rm #1\hfill}}% \ifdim \parskip<10pt \kern 10pt\kern -\parskip\fi \penalty 10000} \message{toc printing,} % Finish up the main text and prepare to read what we've written % to \contentsfile. \newskip\contentsrightmargin \contentsrightmargin=1in \def\startcontents#1{% \pagealignmacro \immediate\closeout \contentsfile \ifnum \pageno>0 \pageno = -1 % Request roman numbered pages. \fi % Don't need to put `Contents' or `Short Contents' in the headline. % It is abundantly clear what they are. \unnumbchapmacro{#1}\def\thischapter{}% \begingroup % Set up to handle contents files properly. \catcode`\\=0 \catcode`\{=1 \catcode`\}=2 \catcode`\@=11 \raggedbottom % Worry more about breakpoints than the bottom. \advance\hsize by -\contentsrightmargin % Don't use the full line length. } % Normal (long) toc. \outer\def\contents{% \startcontents{Table of Contents}% \input \jobname.toc \endgroup \vfill \eject } % And just the chapters. \outer\def\summarycontents{% \startcontents{Short Contents}% % \let\chapentry = \shortchapentry \let\unnumbchapentry = \shortunnumberedentry % We want a true roman here for the page numbers. \secfonts \let\rm=\shortcontrm \let\bf=\shortcontbf \let\sl=\shortcontsl \rm \advance\baselineskip by 1pt % Open it up a little. \def\secentry ##1##2##3##4{} \def\unnumbsecentry ##1##2{} \def\subsecentry ##1##2##3##4##5{} \def\unnumbsubsecentry ##1##2{} \def\subsubsecentry ##1##2##3##4##5##6{} \def\unnumbsubsubsecentry ##1##2{} \input \jobname.toc \endgroup \vfill \eject } \let\shortcontents = \summarycontents % These macros generate individual entries in the table of contents. % The first argument is the chapter or section name. % The last argument is the page number. % The arguments in between are the chapter number, section number, ... % Chapter-level things, for both the long and short contents. \def\chapentry#1#2#3{\dochapentry{#2\labelspace#1}{#3}} % See comments in \dochapentry re vbox and related settings \def\shortchapentry#1#2#3{% \tocentry{\shortchaplabel{#2}\labelspace #1}{\doshortpageno{#3}}% } % Typeset the label for a chapter or appendix for the short contents. % The arg is, e.g. `Appendix A' for an appendix, or `3' for a chapter. % We could simplify the code here by writing out an \appendixentry % command in the toc file for appendices, instead of using \chapentry % for both, but it doesn't seem worth it. \setbox0 = \hbox{\shortcontrm Appendix } \newdimen\shortappendixwidth \shortappendixwidth = \wd0 \def\shortchaplabel#1{% % We typeset #1 in a box of constant width, regardless of the text of % #1, so the chapter titles will come out aligned. \setbox0 = \hbox{#1}% \dimen0 = \ifdim\wd0 > \shortappendixwidth \shortappendixwidth \else 0pt \fi % % This space should be plenty, since a single number is .5em, and the % widest letter (M) is 1em, at least in the Computer Modern fonts. % (This space doesn't include the extra space that gets added after % the label; that gets put in in \shortchapentry above.) \advance\dimen0 by 1.1em \hbox to \dimen0{#1\hfil}% } \def\unnumbchapentry#1#2{\dochapentry{#1}{#2}} \def\shortunnumberedentry#1#2{\tocentry{#1}{\doshortpageno{#2}}} % Sections. \def\secentry#1#2#3#4{\dosecentry{#2.#3\labelspace#1}{#4}} \def\unnumbsecentry#1#2{\dosecentry{#1}{#2}} % Subsections. \def\subsecentry#1#2#3#4#5{\dosubsecentry{#2.#3.#4\labelspace#1}{#5}} \def\unnumbsubsecentry#1#2{\dosubsecentry{#1}{#2}} % And subsubsections. \def\subsubsecentry#1#2#3#4#5#6{% \dosubsubsecentry{#2.#3.#4.#5\labelspace#1}{#6}} \def\unnumbsubsubsecentry#1#2{\dosubsubsecentry{#1}{#2}} % This parameter controls the indentation of the various levels. \newdimen\tocindent \tocindent = 3pc % Now for the actual typesetting. In all these, #1 is the text and #2 is the % page number. % % If the toc has to be broken over pages, we would want to be at chapters % if at all possible; hence the \penalty. \def\dochapentry#1#2{% \penalty-300 \vskip\baselineskip \begingroup \chapentryfonts \tocentry{#1}{\dopageno{#2}}% \endgroup \nobreak\vskip .25\baselineskip } \def\dosecentry#1#2{\begingroup \secentryfonts \leftskip=\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} \def\dosubsecentry#1#2{\begingroup \subsecentryfonts \leftskip=2\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} \def\dosubsubsecentry#1#2{\begingroup \subsubsecentryfonts \leftskip=3\tocindent \tocentry{#1}{\dopageno{#2}}% \endgroup} % Final typesetting of a toc entry; we use the same \entry macro as for % the index entries, but we want to suppress hyphenation here. (We % can't do that in the \entry macro, since index entries might consist % of hyphenated-identifiers-that-do-not-fit-on-a-line-and-nothing-else.) % \def\tocentry#1#2{\begingroup \hyphenpenalty = 10000 \entry{#1}{#2}% \endgroup} % Space between chapter (or whatever) number and the title. \def\labelspace{\hskip1em \relax} \def\dopageno#1{{\rm #1}} \def\doshortpageno#1{{\rm #1}} \def\chapentryfonts{\secfonts \rm} \def\secentryfonts{\textfonts} \let\subsecentryfonts = \textfonts \let\subsubsecentryfonts = \textfonts \message{environments,} % Since these characters are used in examples, it should be an even number of % \tt widths. Each \tt character is 1en, so two makes it 1em. % Furthermore, these definitions must come after we define our fonts. \newbox\dblarrowbox \newbox\longdblarrowbox \newbox\pushcharbox \newbox\bullbox \newbox\equivbox \newbox\errorbox \let\ptexequiv = \equiv %{\tentt %\global\setbox\dblarrowbox = \hbox to 1em{\hfil$\Rightarrow$\hfil} %\global\setbox\longdblarrowbox = \hbox to 1em{\hfil$\mapsto$\hfil} %\global\setbox\pushcharbox = \hbox to 1em{\hfil$\dashv$\hfil} %\global\setbox\equivbox = \hbox to 1em{\hfil$\ptexequiv$\hfil} % Adapted from the manmac format (p.420 of TeXbook) %\global\setbox\bullbox = \hbox to 1em{\kern.15em\vrule height .75ex width .85ex % depth .1ex\hfil} %} \def\point{$\star$} \def\result{\leavevmode\raise.15ex\hbox to 1em{\hfil$\Rightarrow$\hfil}} \def\expansion{\leavevmode\raise.1ex\hbox to 1em{\hfil$\mapsto$\hfil}} \def\print{\leavevmode\lower.1ex\hbox to 1em{\hfil$\dashv$\hfil}} \def\equiv{\leavevmode\lower.1ex\hbox to 1em{\hfil$\ptexequiv$\hfil}} % Adapted from the TeXbook's \boxit. {\tentt \global\dimen0 = 3em}% Width of the box. \dimen2 = .55pt % Thickness of rules % The text. (`r' is open on the right, `e' somewhat less so on the left.) \setbox0 = \hbox{\kern-.75pt \tensf error\kern-1.5pt} \global\setbox\errorbox=\hbox to \dimen0{\hfil \hsize = \dimen0 \advance\hsize by -5.8pt % Space to left+right. \advance\hsize by -2\dimen2 % Rules. \vbox{ \hrule height\dimen2 \hbox{\vrule width\dimen2 \kern3pt % Space to left of text. \vtop{\kern2.4pt \box0 \kern2.4pt}% Space above/below. \kern3pt\vrule width\dimen2}% Space to right. \hrule height\dimen2} \hfil} % The @error{} command. \def\error{\leavevmode\lower.7ex\copy\errorbox} % @tex ... @end tex escapes into raw Tex temporarily. % One exception: @ is still an escape character, so that @end tex works. % But \@ or @@ will get a plain tex @ character. \def\tex{\begingroup \catcode `\\=0 \catcode `\{=1 \catcode `\}=2 \catcode `\$=3 \catcode `\&=4 \catcode `\#=6 \catcode `\^=7 \catcode `\_=8 \catcode `\~=13 \let~=\tie \catcode `\%=14 \catcode 43=12 \catcode`\"=12 \catcode`\==12 \catcode`\|=12 \catcode`\<=12 \catcode`\>=12 \escapechar=`\\ % \let\{=\ptexlbrace \let\}=\ptexrbrace \let\.=\ptexdot \let\*=\ptexstar \let\dots=\ptexdots \def\@{@}% \let\bullet=\ptexbullet \let\b=\ptexb \let\c=\ptexc \let\i=\ptexi \let\t=\ptext \let\l=\ptexl \let\L=\ptexL % \let\Etex=\endgroup} % Define @lisp ... @endlisp. % @lisp does a \begingroup so it can rebind things, % including the definition of @endlisp (which normally is erroneous). % Amount to narrow the margins by for @lisp. \newskip\lispnarrowing \lispnarrowing=0.4in % This is the definition that ^^M gets inside @lisp, @example, and other % such environments. \null is better than a space, since it doesn't % have any width. \def\lisppar{\null\endgraf} % Make each space character in the input produce a normal interword % space in the output. Don't allow a line break at this space, as this % is used only in environments like @example, where each line of input % should produce a line of output anyway. % {\obeyspaces % \gdef\sepspaces{\obeyspaces\let =\tie}} % Define \obeyedspace to be our active space, whatever it is. This is % for use in \parsearg. {\sepspaces% \global\let\obeyedspace= } % This space is always present above and below environments. \newskip\envskipamount \envskipamount = 0pt % Make spacing and below environment symmetrical. We use \parskip here % to help in doing that, since in @example-like environments \parskip % is reset to zero; thus the \afterenvbreak inserts no space -- but the % start of the next paragraph will insert \parskip % \def\aboveenvbreak{{\advance\envskipamount by \parskip \endgraf \ifdim\lastskip<\envskipamount \removelastskip \penalty-50 \vskip\envskipamount \fi}} \let\afterenvbreak = \aboveenvbreak % \nonarrowing is a flag. If "set", @lisp etc don't narrow margins. \let\nonarrowing=\relax %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % \cartouche: draw rectangle w/rounded corners around argument \font\circle=lcircle10 \newdimen\circthick \newdimen\cartouter\newdimen\cartinner \newskip\normbskip\newskip\normpskip\newskip\normlskip \circthick=\fontdimen8\circle % \def\ctl{{\circle\char'013\hskip -6pt}}% 6pt from pl file: 1/2charwidth \def\ctr{{\hskip 6pt\circle\char'010}} \def\cbl{{\circle\char'012\hskip -6pt}} \def\cbr{{\hskip 6pt\circle\char'011}} \def\carttop{\hbox to \cartouter{\hskip\lskip \ctl\leaders\hrule height\circthick\hfil\ctr \hskip\rskip}} \def\cartbot{\hbox to \cartouter{\hskip\lskip \cbl\leaders\hrule height\circthick\hfil\cbr \hskip\rskip}} % \newskip\lskip\newskip\rskip \long\def\cartouche{% \begingroup \lskip=\leftskip \rskip=\rightskip \leftskip=0pt\rightskip=0pt %we want these *outside*. \cartinner=\hsize \advance\cartinner by-\lskip \advance\cartinner by-\rskip \cartouter=\hsize \advance\cartouter by 18pt % allow for 3pt kerns on either % side, and for 6pt waste from % each corner char \normbskip=\baselineskip \normpskip=\parskip \normlskip=\lineskip % Flag to tell @lisp, etc., not to narrow margin. \let\nonarrowing=\comment \vbox\bgroup \baselineskip=0pt\parskip=0pt\lineskip=0pt \carttop \hbox\bgroup \hskip\lskip \vrule\kern3pt \vbox\bgroup \hsize=\cartinner \kern3pt \begingroup \baselineskip=\normbskip \lineskip=\normlskip \parskip=\normpskip \vskip -\parskip \def\Ecartouche{% \endgroup \kern3pt \egroup \kern3pt\vrule \hskip\rskip \egroup \cartbot \egroup \endgroup }} % This macro is called at the beginning of all the @example variants, % inside a group. \def\nonfillstart{% \aboveenvbreak \inENV % This group ends at the end of the body \hfuzz = 12pt % Don't be fussy \sepspaces % Make spaces be word-separators rather than space tokens. \singlespace \let\par = \lisppar % don't ignore blank lines \obeylines % each line of input is a line of output \parskip = 0pt \parindent = 0pt \emergencystretch = 0pt % don't try to avoid overfull boxes % @cartouche defines \nonarrowing to inhibit narrowing % at next level down. \ifx\nonarrowing\relax \advance \leftskip by \lispnarrowing \exdentamount=\lispnarrowing \let\exdent=\nofillexdent \let\nonarrowing=\relax \fi } % To ending an @example-like environment, we first end the paragraph % (via \afterenvbreak's vertical glue), and then the group. That way we % keep the zero \parskip that the environments set -- \parskip glue % will be inserted at the beginning of the next paragraph in the % document, after the environment. % \def\nonfillfinish{\afterenvbreak\endgroup}% % This macro is \def\lisp{\begingroup \nonfillstart \let\Elisp = \nonfillfinish \tt \rawbackslash % have \ input char produce \ char from current font \gobble } % Define the \E... control sequence only if we are inside the % environment, so the error checking in \end will work. % % We must call \lisp last in the definition, since it reads the % return following the @example (or whatever) command. % \def\example{\begingroup \def\Eexample{\nonfillfinish\endgroup}\lisp} \def\smallexample{\begingroup \def\Esmallexample{\nonfillfinish\endgroup}\lisp} \def\smalllisp{\begingroup \def\Esmalllisp{\nonfillfinish\endgroup}\lisp} % @smallexample and @smalllisp. This is not used unless the @smallbook % command is given. Originally contributed by Pavel@xerox. % \def\smalllispx{\begingroup \nonfillstart \let\Esmalllisp = \nonfillfinish \let\Esmallexample = \nonfillfinish % % Smaller interline space and fonts for small examples. \baselineskip 10pt \indexfonts \tt \rawbackslash % output the \ character from the current font \gobble } % This is @display; same as @lisp except use roman font. % \def\display{\begingroup \nonfillstart \let\Edisplay = \nonfillfinish \gobble } % This is @format; same as @display except don't narrow margins. % \def\format{\begingroup \let\nonarrowing = t \nonfillstart \let\Eformat = \nonfillfinish \gobble } % @flushleft (same as @format) and @flushright. % \def\flushleft{\begingroup \let\nonarrowing = t \nonfillstart \let\Eflushleft = \nonfillfinish \gobble } \def\flushright{\begingroup \let\nonarrowing = t \nonfillstart \let\Eflushright = \nonfillfinish \advance\leftskip by 0pt plus 1fill \gobble} % @quotation does normal linebreaking and narrows the margins. % \def\quotation{% \begingroup\inENV %This group ends at the end of the @quotation body {\parskip=0pt % because we will skip by \parskip too, later \aboveenvbreak}% \singlespace \parindent=0pt \let\Equotation = \nonfillfinish % @cartouche defines \nonarrowing to inhibit narrowing % at next level down. \ifx\nonarrowing\relax \advance \leftskip by \lispnarrowing \advance \rightskip by \lispnarrowing \exdentamount=\lispnarrowing \let\nonarrowing=\relax \fi} \message{defuns,} % Define formatter for defuns % First, allow user to change definition object font (\df) internally \def\setdeffont #1 {\csname DEF#1\endcsname} \newskip\defbodyindent \defbodyindent=.4in \newskip\defargsindent \defargsindent=50pt \newskip\deftypemargin \deftypemargin=12pt \newskip\deflastargmargin \deflastargmargin=18pt \newcount\parencount % define \functionparens, which makes ( and ) and & do special things. % \functionparens affects the group it is contained in. \def\activeparens{% \catcode`\(=\active \catcode`\)=\active \catcode`\&=\active \catcode`\[=\active \catcode`\]=\active} % Make control sequences which act like normal parenthesis chars. \let\lparen = ( \let\rparen = ) {\activeparens % Now, smart parens don't turn on until &foo (see \amprm) % Be sure that we always have a definition for `(', etc. For example, % if the fn name has parens in it, \boldbrax will not be in effect yet, % so TeX would otherwise complain about undefined control sequence. \global\let(=\lparen \global\let)=\rparen \global\let[=\lbrack \global\let]=\rbrack \gdef\functionparens{\boldbrax\let&=\amprm\parencount=0 } \gdef\boldbrax{\let(=\opnr\let)=\clnr\let[=\lbrb\let]=\rbrb} % Definitions of (, ) and & used in args for functions. % This is the definition of ( outside of all parentheses. \gdef\oprm#1 {{\rm\char`\(}#1 \bf \let(=\opnested % \global\advance\parencount by 1 } % % This is the definition of ( when already inside a level of parens. \gdef\opnested{\char`\(\global\advance\parencount by 1 } % \gdef\clrm{% Print a paren in roman if it is taking us back to depth of 0. % also in that case restore the outer-level definition of (. \ifnum \parencount=1 {\rm \char `\)}\sl \let(=\oprm \else \char `\) \fi \global\advance \parencount by -1 } % If we encounter &foo, then turn on ()-hacking afterwards \gdef\amprm#1 {\&{\rm #1}\let(=\oprm \let)=\clrm\ } % \gdef\normalparens{\boldbrax\let&=\ampnr} } % End of definition inside \activeparens %% These parens (in \boldbrax) actually are a little bolder than the %% contained text. This is especially needed for [ and ] \def\opnr{{\sf\char`\(}} \def\clnr{{\sf\char`\)}} \def\ampnr{\&} \def\lbrb{{\bf\char`\[}} \def\rbrb{{\bf\char`\]}} % First, defname, which formats the header line itself. % #1 should be the function name. % #2 should be the type of definition, such as "Function". \def\defname #1#2{% % Get the values of \leftskip and \rightskip as they were % outside the @def... \dimen2=\leftskip \advance\dimen2 by -\defbodyindent \dimen3=\rightskip \advance\dimen3 by -\defbodyindent \noindent % \setbox0=\hbox{\hskip \deflastargmargin{\rm #2}\hskip \deftypemargin}% \dimen0=\hsize \advance \dimen0 by -\wd0 % compute size for first line \dimen1=\hsize \advance \dimen1 by -\defargsindent %size for continuations \parshape 2 0in \dimen0 \defargsindent \dimen1 % % Now output arg 2 ("Function" or some such) % ending at \deftypemargin from the right margin, % but stuck inside a box of width 0 so it does not interfere with linebreaking {% Adjust \hsize to exclude the ambient margins, % so that \rightline will obey them. \advance \hsize by -\dimen2 \advance \hsize by -\dimen3 \rlap{\rightline{{\rm #2}\hskip \deftypemargin}}}% % Make all lines underfull and no complaints: \tolerance=10000 \hbadness=10000 \advance\leftskip by -\defbodyindent \exdentamount=\defbodyindent {\df #1}\enskip % Generate function name } % Actually process the body of a definition % #1 should be the terminating control sequence, such as \Edefun. % #2 should be the "another name" control sequence, such as \defunx. % #3 should be the control sequence that actually processes the header, % such as \defunheader. \def\defparsebody #1#2#3{\begingroup\inENV% Environment for definitionbody \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2{\begingroup\obeylines\activeparens\spacesplit#3}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup % \catcode 61=\active % 61 is `=' \obeylines\activeparens\spacesplit#3} \def\defmethparsebody #1#2#3#4 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 {\begingroup\obeylines\activeparens\spacesplit{#3{##1}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\activeparens\spacesplit{#3{#4}}} \def\defopparsebody #1#2#3#4#5 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 ##2 {\def#4{##1}% \begingroup\obeylines\activeparens\spacesplit{#3{##2}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\activeparens\spacesplit{#3{#5}}} % These parsing functions are similar to the preceding ones % except that they do not make parens into active characters. % These are used for "variables" since they have no arguments. \def\defvarparsebody #1#2#3{\begingroup\inENV% Environment for definitionbody \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2{\begingroup\obeylines\spacesplit#3}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup % \catcode 61=\active % \obeylines\spacesplit#3} % This is used for \def{tp,vr}parsebody. It could probably be used for % some of the others, too, with some judicious conditionals. % \def\parsebodycommon#1#2#3{% \begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 {\begingroup\obeylines\spacesplit{#3{##1}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines } \def\defvrparsebody#1#2#3#4 {% \parsebodycommon{#1}{#2}{#3}% \spacesplit{#3{#4}}% } % This loses on `@deftp {Data Type} {struct termios}' -- it thinks the % type is just `struct', because we lose the braces in `{struct % termios}' when \spacesplit reads its undelimited argument. Sigh. % \let\deftpparsebody=\defvrparsebody % % So, to get around this, we put \empty in with the type name. That % way, TeX won't find exactly `{...}' as an undelimited argument, and % won't strip off the braces. % \def\deftpparsebody #1#2#3#4 {% \parsebodycommon{#1}{#2}{#3}% \spacesplit{\parsetpheaderline{#3{#4}}}\empty } % Fine, but then we have to eventually remove the \empty *and* the % braces (if any). That's what this does, putting the result in \tptemp. % \def\removeemptybraces\empty#1\relax{\def\tptemp{#1}}% % After \spacesplit has done its work, this is called -- #1 is the final % thing to call, #2 the type name (which starts with \empty), and #3 % (which might be empty) the arguments. % \def\parsetpheaderline#1#2#3{% \removeemptybraces#2\relax #1{\tptemp}{#3}% }% \def\defopvarparsebody #1#2#3#4#5 {\begingroup\inENV % \medbreak % % Define the end token that this defining construct specifies % so that it will exit this group. \def#1{\endgraf\endgroup\medbreak}% \def#2##1 ##2 {\def#4{##1}% \begingroup\obeylines\spacesplit{#3{##2}}}% \parindent=0in \advance\leftskip by \defbodyindent \advance \rightskip by \defbodyindent \exdentamount=\defbodyindent \begingroup\obeylines\spacesplit{#3{#5}}} % Split up #2 at the first space token. % call #1 with two arguments: % the first is all of #2 before the space token, % the second is all of #2 after that space token. % If #2 contains no space token, all of it is passed as the first arg % and the second is passed as empty. {\obeylines \gdef\spacesplit#1#2^^M{\endgroup\spacesplitfoo{#1}#2 \relax\spacesplitfoo}% \long\gdef\spacesplitfoo#1#2 #3#4\spacesplitfoo{% \ifx\relax #3% #1{#2}{}\else #1{#2}{#3#4}\fi}} % So much for the things common to all kinds of definitions. % Define @defun. % First, define the processing that is wanted for arguments of \defun % Use this to expand the args and terminate the paragraph they make up \def\defunargs #1{\functionparens \sl % Expand, preventing hyphenation at `-' chars. % Note that groups don't affect changes in \hyphenchar. \hyphenchar\tensl=0 #1% \hyphenchar\tensl=45 \ifnum\parencount=0 \else \errmessage{unbalanced parens in @def arguments}\fi% \interlinepenalty=10000 \advance\rightskip by 0pt plus 1fil \endgraf\penalty 10000\vskip -\parskip\penalty 10000% } \def\deftypefunargs #1{% % Expand, preventing hyphenation at `-' chars. % Note that groups don't affect changes in \hyphenchar. \functionparens \tclose{#1}% avoid \code because of side effects on active chars \interlinepenalty=10000 \advance\rightskip by 0pt plus 1fil \endgraf\penalty 10000\vskip -\parskip\penalty 10000% } % Do complete processing of one @defun or @defunx line already parsed. % @deffn Command forward-char nchars \def\deffn{\defmethparsebody\Edeffn\deffnx\deffnheader} \def\deffnheader #1#2#3{\doind {fn}{\code{#2}}% \begingroup\defname {#2}{#1}\defunargs{#3}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defun == @deffn Function \def\defun{\defparsebody\Edefun\defunx\defunheader} \def\defunheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Function}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @deftypefun int foobar (int @var{foo}, float @var{bar}) \def\deftypefun{\defparsebody\Edeftypefun\deftypefunx\deftypefunheader} % #1 is the data type. #2 is the name and args. \def\deftypefunheader #1#2{\deftypefunheaderx{#1}#2 \relax} % #1 is the data type, #2 the name, #3 the args. \def\deftypefunheaderx #1#2 #3\relax{% \doind {fn}{\code{#2}}% Make entry in function index \begingroup\defname {\code{#1} #2}{Function}% \deftypefunargs {#3}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @deftypefn {Library Function} int foobar (int @var{foo}, float @var{bar}) \def\deftypefn{\defmethparsebody\Edeftypefn\deftypefnx\deftypefnheader} % #1 is the classification. #2 is the data type. #3 is the name and args. \def\deftypefnheader #1#2#3{\deftypefnheaderx{#1}{#2}#3 \relax} % #1 is the classification, #2 the data type, #3 the name, #4 the args. \def\deftypefnheaderx #1#2#3 #4\relax{% \doind {fn}{\code{#3}}% Make entry in function index \begingroup \normalparens % notably, turn off `&' magic, which prevents % at least some C++ text from working \defname {\code{#2} #3}{#1}% \deftypefunargs {#4}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defmac == @deffn Macro \def\defmac{\defparsebody\Edefmac\defmacx\defmacheader} \def\defmacheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Macro}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % @defspec == @deffn Special Form \def\defspec{\defparsebody\Edefspec\defspecx\defspecheader} \def\defspecheader #1#2{\doind {fn}{\code{#1}}% Make entry in function index \begingroup\defname {#1}{Special Form}% \defunargs {#2}\endgroup % \catcode 61=\other % Turn off change made in \defparsebody } % This definition is run if you use @defunx % anywhere other than immediately after a @defun or @defunx. \def\deffnx #1 {\errmessage{@deffnx in invalid context}} \def\defunx #1 {\errmessage{@defunx in invalid context}} \def\defmacx #1 {\errmessage{@defmacx in invalid context}} \def\defspecx #1 {\errmessage{@defspecx in invalid context}} \def\deftypefnx #1 {\errmessage{@deftypefnx in invalid context}} \def\deftypeunx #1 {\errmessage{@deftypeunx in invalid context}} % @defmethod, and so on % @defop {Funny Method} foo-class frobnicate argument \def\defop #1 {\def\defoptype{#1}% \defopparsebody\Edefop\defopx\defopheader\defoptype} \def\defopheader #1#2#3{% \dosubind {fn}{\code{#2}}{on #1}% Make entry in function index \begingroup\defname {#2}{\defoptype{} on #1}% \defunargs {#3}\endgroup % } % @defmethod == @defop Method \def\defmethod{\defmethparsebody\Edefmethod\defmethodx\defmethodheader} \def\defmethodheader #1#2#3{% \dosubind {fn}{\code{#2}}{on #1}% entry in function index \begingroup\defname {#2}{Method on #1}% \defunargs {#3}\endgroup % } % @defcv {Class Option} foo-class foo-flag \def\defcv #1 {\def\defcvtype{#1}% \defopvarparsebody\Edefcv\defcvx\defcvarheader\defcvtype} \def\defcvarheader #1#2#3{% \dosubind {vr}{\code{#2}}{of #1}% Make entry in var index \begingroup\defname {#2}{\defcvtype{} of #1}% \defvarargs {#3}\endgroup % } % @defivar == @defcv {Instance Variable} \def\defivar{\defvrparsebody\Edefivar\defivarx\defivarheader} \def\defivarheader #1#2#3{% \dosubind {vr}{\code{#2}}{of #1}% Make entry in var index \begingroup\defname {#2}{Instance Variable of #1}% \defvarargs {#3}\endgroup % } % These definitions are run if you use @defmethodx, etc., % anywhere other than immediately after a @defmethod, etc. \def\defopx #1 {\errmessage{@defopx in invalid context}} \def\defmethodx #1 {\errmessage{@defmethodx in invalid context}} \def\defcvx #1 {\errmessage{@defcvx in invalid context}} \def\defivarx #1 {\errmessage{@defivarx in invalid context}} % Now @defvar % First, define the processing that is wanted for arguments of @defvar. % This is actually simple: just print them in roman. % This must expand the args and terminate the paragraph they make up \def\defvarargs #1{\normalparens #1% \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000} % @defvr Counter foo-count \def\defvr{\defvrparsebody\Edefvr\defvrx\defvrheader} \def\defvrheader #1#2#3{\doind {vr}{\code{#2}}% \begingroup\defname {#2}{#1}\defvarargs{#3}\endgroup} % @defvar == @defvr Variable \def\defvar{\defvarparsebody\Edefvar\defvarx\defvarheader} \def\defvarheader #1#2{\doind {vr}{\code{#1}}% Make entry in var index \begingroup\defname {#1}{Variable}% \defvarargs {#2}\endgroup % } % @defopt == @defvr {User Option} \def\defopt{\defvarparsebody\Edefopt\defoptx\defoptheader} \def\defoptheader #1#2{\doind {vr}{\code{#1}}% Make entry in var index \begingroup\defname {#1}{User Option}% \defvarargs {#2}\endgroup % } % @deftypevar int foobar \def\deftypevar{\defvarparsebody\Edeftypevar\deftypevarx\deftypevarheader} % #1 is the data type. #2 is the name. \def\deftypevarheader #1#2{% \doind {vr}{\code{#2}}% Make entry in variables index \begingroup\defname {\code{#1} #2}{Variable}% \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000 \endgroup} % @deftypevr {Global Flag} int enable \def\deftypevr{\defvrparsebody\Edeftypevr\deftypevrx\deftypevrheader} \def\deftypevrheader #1#2#3{\doind {vr}{\code{#3}}% \begingroup\defname {\code{#2} #3}{#1} \interlinepenalty=10000 \endgraf\penalty 10000\vskip -\parskip\penalty 10000 \endgroup} % This definition is run if you use @defvarx % anywhere other than immediately after a @defvar or @defvarx. \def\defvrx #1 {\errmessage{@defvrx in invalid context}} \def\defvarx #1 {\errmessage{@defvarx in invalid context}} \def\defoptx #1 {\errmessage{@defoptx in invalid context}} \def\deftypevarx #1 {\errmessage{@deftypevarx in invalid context}} \def\deftypevrx #1 {\errmessage{@deftypevrx in invalid context}} % Now define @deftp % Args are printed in bold, a slight difference from @defvar. \def\deftpargs #1{\bf \defvarargs{#1}} % @deftp Class window height width ... \def\deftp{\deftpparsebody\Edeftp\deftpx\deftpheader} \def\deftpheader #1#2#3{\doind {tp}{\code{#2}}% \begingroup\defname {#2}{#1}\deftpargs{#3}\endgroup} % This definition is run if you use @deftpx, etc % anywhere other than immediately after a @deftp, etc. \def\deftpx #1 {\errmessage{@deftpx in invalid context}} \message{cross reference,} % Define cross-reference macros \newwrite \auxfile \newif\ifhavexrefs % True if xref values are known. \newif\ifwarnedxrefs % True if we warned once that they aren't known. % \setref{foo} defines a cross-reference point named foo. \def\setref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Ysectionnumberandtype}} \def\unnumbsetref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Ynothing}} \def\appendixsetref#1{% \dosetq{#1-title}{Ytitle}% \dosetq{#1-pg}{Ypagenumber}% \dosetq{#1-snt}{Yappendixletterandtype}} % \xref, \pxref, and \ref generate cross-references to specified points. % For \xrefX, #1 is the node name, #2 the name of the Info % cross-reference, #3 the printed node name, #4 the name of the Info % file, #5 the name of the printed manual. All but the node name can be % omitted. % \def\pxref#1{see \xrefX[#1,,,,,,,]} \def\xref#1{See \xrefX[#1,,,,,,,]} \def\ref#1{\xrefX[#1,,,,,,,]} \def\xrefX[#1,#2,#3,#4,#5,#6]{\begingroup% \def\printedmanual{\ignorespaces #5}% \def\printednodename{\ignorespaces #3}% % \setbox1=\hbox{\printedmanual}% \setbox0=\hbox{\printednodename}% \ifdim \wd0=0pt% % No printed node name was explicitly given. \ifx SETxref-automatic-section-title % % This line should make the actual chapter or section title appear inside % the square brackets. Use the real section title if we have it. \ifdim \wd1>0pt% % It is in another manual, so we don't have it. \def\printednodename{\ignorespaces #1} \else% % We know the real title if we have the xref values. \ifhavexrefs \def\printednodename{\refx{#1-title}}% % Otherwise just copy the Info node name. \else \def\printednodename{\ignorespaces #1} \fi% \fi\def\printednodename{#1-title}% \else% This line just uses the node name. \def\printednodename{\ignorespaces #1}% \fi% ends \ifx SETxref-automatic-section-title \fi% ends \ifdim \wd0 % % % If we use \unhbox0 and \unhbox1 to print the node names, TeX does % not insert empty discretionaries after hyphens, which means that it % will not find a line break at a hyphen in a node names. Since some % manuals are best written with fairly long node names, containing % hyphens, this is a loss. Therefore, we simply give the text of % the node name again, so it is as if TeX is seeing it for the first % time. \ifdim \wd1>0pt section ``\printednodename'' in \cite{\printedmanual}% \else% \turnoffactive% \refx{#1-snt}{} [\printednodename], page\tie\refx{#1-pg}{}% \fi \endgroup} % \dosetq is the interface for calls from other macros % Use \turnoffactive so that punctuation chars such as underscore % work in node names. \def\dosetq #1#2{{\let\folio=0 \turnoffactive% \edef\next{\write\auxfile{\internalsetq {#1}{#2}}}% \next}} % \internalsetq {foo}{page} expands into % CHARACTERS 'xrdef {foo}{...expansion of \Ypage...} % When the aux file is read, ' is the escape character \def\internalsetq #1#2{'xrdef {#1}{\csname #2\endcsname}} % Things to be expanded by \internalsetq \def\Ypagenumber{\folio} \def\Ytitle{\thissection} \def\Ynothing{} \def\Ysectionnumberandtype{% \ifnum\secno=0 Chapter\xreftie\the\chapno % \else \ifnum \subsecno=0 Section\xreftie\the\chapno.\the\secno % \else \ifnum \subsubsecno=0 % Section\xreftie\the\chapno.\the\secno.\the\subsecno % \else % Section\xreftie\the\chapno.\the\secno.\the\subsecno.\the\subsubsecno % \fi \fi \fi } \def\Yappendixletterandtype{% \ifnum\secno=0 Appendix\xreftie'char\the\appendixno{}% \else \ifnum \subsecno=0 Section\xreftie'char\the\appendixno.\the\secno % \else \ifnum \subsubsecno=0 % Section\xreftie'char\the\appendixno.\the\secno.\the\subsecno % \else % Section\xreftie'char\the\appendixno.\the\secno.\the\subsecno.\the\subsubsecno % \fi \fi \fi } \gdef\xreftie{'tie} % Use TeX 3.0's \inputlineno to get the line number, for better error % messages, but if we're using an old version of TeX, don't do anything. % \ifx\inputlineno\thisisundefined \let\linenumber = \empty % Non-3.0. \else \def\linenumber{\the\inputlineno:\space} \fi % Define \refx{NAME}{SUFFIX} to reference a cross-reference string named NAME. % If its value is nonempty, SUFFIX is output afterward. \def\refx#1#2{% \expandafter\ifx\csname X#1\endcsname\relax % If not defined, say something at least. $\langle$un\-de\-fined$\rangle$% \ifhavexrefs \message{\linenumber Undefined cross reference `#1'.}% \else \ifwarnedxrefs\else \global\warnedxrefstrue \message{Cross reference values unknown; you must run TeX again.}% \fi \fi \else % It's defined, so just use it. \csname X#1\endcsname \fi #2% Output the suffix in any case. } % Read the last existing aux file, if any. No error if none exists. % This is the macro invoked by entries in the aux file. \def\xrdef #1#2{ {\catcode`\'=\other\expandafter \gdef \csname X#1\endcsname {#2}}} \def\readauxfile{% \begingroup \catcode `\^^@=\other \catcode `\=\other \catcode `\=\other \catcode `\^^C=\other \catcode `\^^D=\other \catcode `\^^E=\other \catcode `\^^F=\other \catcode `\^^G=\other \catcode `\^^H=\other \catcode `\ =\other \catcode `\^^L=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode `\=\other \catcode 26=\other \catcode `\^^[=\other \catcode `\^^\=\other \catcode `\^^]=\other \catcode `\^^^=\other \catcode `\^^_=\other \catcode `\@=\other \catcode `\^=\other \catcode `\~=\other \catcode `\[=\other \catcode `\]=\other \catcode`\"=\other \catcode`\_=\other \catcode`\|=\other \catcode`\<=\other \catcode`\>=\other \catcode `\$=\other \catcode `\#=\other \catcode `\&=\other % `\+ does not work, so use 43. \catcode 43=\other % the aux file uses ' as the escape. % Turn off \ as an escape so we do not lose on % entries which were dumped with control sequences in their names. % For example, 'xrdef {$\leq $-fun}{page ...} made by @defun ^^ % Reference to such entries still does not work the way one would wish, % but at least they do not bomb out when the aux file is read in. \catcode `\{=1 \catcode `\}=2 \catcode `\%=\other \catcode `\'=0 \catcode `\\=\other \openin 1 \jobname.aux \ifeof 1 \else \closein 1 \input \jobname.aux \global\havexrefstrue \global\warnedobstrue \fi % Open the new aux file. Tex will close it automatically at exit. \openout \auxfile=\jobname.aux \endgroup} % Footnotes. \newcount \footnoteno % The trailing space in the following definition for supereject is % vital for proper filling; pages come out unaligned when you do a % pagealignmacro call if that space before the closing brace is % removed. \def\supereject{\par\penalty -20000\footnoteno =0 } % @footnotestyle is meaningful for info output only.. \let\footnotestyle=\comment \let\ptexfootnote=\footnote {\catcode `\@=11 % % Auto-number footnotes. Otherwise like plain. \gdef\footnote{% \global\advance\footnoteno by \@ne \edef\thisfootno{$^{\the\footnoteno}$}% % % In case the footnote comes at the end of a sentence, preserve the % extra spacing after we do the footnote number. \let\@sf\empty \ifhmode\edef\@sf{\spacefactor\the\spacefactor}\/\fi % % Remove inadvertent blank space before typesetting the footnote number. \unskip \thisfootno\@sf \footnotezzz }% % Don't bother with the trickery in plain.tex to not require the % footnote text as a parameter. Our footnotes don't need to be so general. % \long\gdef\footnotezzz#1{\insert\footins{% % We want to typeset this text as a normal paragraph, even if the % footnote reference occurs in (for example) a display environment. % So reset some parameters. \interlinepenalty\interfootnotelinepenalty \splittopskip\ht\strutbox % top baseline for broken footnotes \splitmaxdepth\dp\strutbox \floatingpenalty\@MM \leftskip\z@skip \rightskip\z@skip \spaceskip\z@skip \xspaceskip\z@skip \parindent\defaultparindent % % Hang the footnote text off the number. \hang \textindent{\thisfootno}% % % Don't crash into the line above the footnote text. Since this % expands into a box, it must come within the paragraph, lest it % provide a place where TeX can split the footnote. \footstrut #1\strut}% } }%end \catcode `\@=11 % Set the baselineskip to #1, and the lineskip and strut size % correspondingly. There is no deep meaning behind these magic numbers % used as factors; they just match (closely enough) what Knuth defined. % \def\lineskipfactor{.08333} \def\strutheightpercent{.70833} \def\strutdepthpercent {.29167} % \def\setleading#1{% \normalbaselineskip = #1\relax \normallineskip = \lineskipfactor\normalbaselineskip \normalbaselines \setbox\strutbox =\hbox{% \vrule width0pt height\strutheightpercent\baselineskip depth \strutdepthpercent \baselineskip }% } % @| inserts a changebar to the left of the current line. It should % surround any changed text. This approach does *not* work if the % change spans more than two lines of output. To handle that, we would % have adopt a much more difficult approach (putting marks into the main % vertical list for the beginning and end of each change). % \def\|{% % \vadjust can only be used in horizontal mode. \leavevmode % % Append this vertical mode material after the current line in the output. \vadjust{% % We want to insert a rule with the height and depth of the current % leading; that is exactly what \strutbox is supposed to record. \vskip-\baselineskip % % \vadjust-items are inserted at the left edge of the type. So % the \llap here moves out into the left-hand margin. \llap{% % % For a thicker or thinner bar, change the `1pt'. \vrule height\baselineskip width1pt % % This is the space between the bar and the text. \hskip 12pt }% }% } % For a final copy, take out the rectangles % that mark overfull boxes (in case you have decided % that the text looks ok even though it passes the margin). % \def\finalout{\overfullrule=0pt} % End of control word definitions. \message{and turning on texinfo input format.} \def\openindices{% \newindex{cp}% \newcodeindex{fn}% \newcodeindex{vr}% \newcodeindex{tp}% \newcodeindex{ky}% \newcodeindex{pg}% } % Set some numeric style parameters, for 8.5 x 11 format. %\hsize = 6.5in \newdimen\defaultparindent \defaultparindent = 15pt \parindent = \defaultparindent \parskip 18pt plus 1pt \setleading{15pt} \advance\topskip by 1.2cm % Prevent underfull vbox error messages. \vbadness=10000 % Following George Bush, just get rid of widows and orphans. \widowpenalty=10000 \clubpenalty=10000 % Use TeX 3.0's \emergencystretch to help line breaking, but if we're % using an old version of TeX, don't do anything. We want the amount of % stretch added to depend on the line length, hence the dependence on % \hsize. This makes it come to about 9pt for the 8.5x11 format. % \ifx\emergencystretch\thisisundefined % Allow us to assign to \emergencystretch anyway. \def\emergencystretch{\dimen0}% \else \emergencystretch = \hsize \divide\emergencystretch by 45 \fi % Use @smallbook to reset parameters for 7x9.5 format (or else 7x9.25) \def\smallbook{ % These values for secheadingskip and subsecheadingskip are % experiments. RJC 7 Aug 1992 \global\secheadingskip = 17pt plus 6pt minus 3pt \global\subsecheadingskip = 14pt plus 6pt minus 3pt \global\lispnarrowing = 0.3in \setleading{12pt} \advance\topskip by -1cm \global\parskip 3pt plus 1pt \global\hsize = 5in \global\vsize=7.5in \global\tolerance=700 \global\hfuzz=1pt \global\contentsrightmargin=0pt \global\pagewidth=\hsize \global\pageheight=\vsize \global\let\smalllisp=\smalllispx \global\let\smallexample=\smalllispx \global\def\Esmallexample{\Esmalllisp} } % Use @afourpaper to print on European A4 paper. \def\afourpaper{ \global\tolerance=700 \global\hfuzz=1pt \setleading{12pt} \global\parskip 15pt plus 1pt \global\vsize= 53\baselineskip \advance\vsize by \topskip %\global\hsize= 5.85in % A4 wide 10pt \global\hsize= 6.5in \global\outerhsize=\hsize \global\advance\outerhsize by 0.5in \global\outervsize=\vsize \global\advance\outervsize by 0.6in \global\pagewidth=\hsize \global\pageheight=\vsize } % Define macros to output various characters with catcode for normal text. \catcode`\"=\other \catcode`\~=\other \catcode`\^=\other \catcode`\_=\other \catcode`\|=\other \catcode`\<=\other \catcode`\>=\other \catcode`\+=\other \def\normaldoublequote{"} \def\normaltilde{~} \def\normalcaret{^} \def\normalunderscore{_} \def\normalverticalbar{|} \def\normalless{<} \def\normalgreater{>} \def\normalplus{+} % This macro is used to make a character print one way in ttfont % where it can probably just be output, and another way in other fonts, % where something hairier probably needs to be done. % % #1 is what to print if we are indeed using \tt; #2 is what to print % otherwise. Since all the Computer Modern typewriter fonts have zero % interword stretch (and shrink), and it is reasonable to expect all % typewriter fonts to have this, we can check that font parameter. % \def\ifusingtt#1#2{\ifdim \fontdimen3\the\font=0pt #1\else #2\fi} % Turn off all special characters except @ % (and those which the user can use as if they were ordinary). % Most of these we simply print from the \tt font, but for some, we can % use math or other variants that look better in normal text. \catcode`\"=\active \def\activedoublequote{{\tt \char '042}} \let"=\activedoublequote \catcode`\~=\active \def~{{\tt \char '176}} \chardef\hat=`\^ \catcode`\^=\active \def^{{\tt \hat}} \catcode`\_=\active \def_{\ifusingtt\normalunderscore\_} % Subroutine for the previous macro. \def\_{\lvvmode \kern.06em \vbox{\hrule width.3em height.1ex}} % \lvvmode is equivalent in function to \leavevmode. % Using \leavevmode runs into trouble when written out to % an index file due to the expansion of \leavevmode into ``\unhbox % \voidb@x'' ---which looks to TeX like ``\unhbox \voidb\x'' due to our % magic tricks with @. \def\lvvmode{\vbox to 0pt{}} \catcode`\|=\active \def|{{\tt \char '174}} \chardef \less=`\< \catcode`\<=\active \def<{{\tt \less}} \chardef \gtr=`\> \catcode`\>=\active \def>{{\tt \gtr}} \catcode`\+=\active \def+{{\tt \char 43}} %\catcode 27=\active %\def^^[{$\diamondsuit$} % Used sometimes to turn off (effectively) the active characters % even after parsing them. \def\turnoffactive{\let"=\normaldoublequote \let~=\normaltilde \let^=\normalcaret \let_=\normalunderscore \let|=\normalverticalbar \let<=\normalless \let>=\normalgreater \let+=\normalplus} % Set up an active definition for =, but don't enable it most of the time. {\catcode`\==\active \global\def={{\tt \char 61}}} \catcode`\@=0 % \rawbackslashxx output one backslash character in current font \global\chardef\rawbackslashxx=`\\ %{\catcode`\\=\other %@gdef@rawbackslashxx{\}} % \rawbackslash redefines \ as input to do \rawbackslashxx. {\catcode`\\=\active @gdef@rawbackslash{@let\=@rawbackslashxx }} % \normalbackslash outputs one backslash in fixed width font. \def\normalbackslash{{\tt\rawbackslashxx}} % Say @foo, not \foo, in error messages. \escapechar=`\@ % \catcode 17=0 % Define control-q \catcode`\\=\active % If a .fmt file is being used, we don't want the `\input texinfo' to show up. % That is what \eatinput is for; after that, the `\' should revert to printing % a backslash. % @gdef@eatinput input texinfo{@fixbackslash} @global@let\ = @eatinput % On the other hand, perhaps the file did not have a `\input texinfo'. Then % the first `\{ in the file would cause an error. This macro tries to fix % that, assuming it is called before the first `\' could plausibly occur. % @gdef@fixbackslash{@ifx\@eatinput @let\ = @normalbackslash @fi} %% These look ok in all fonts, so just make them not special. The @rm below %% makes sure that the current font starts out as the newly loaded cmr10 @catcode`@$=@other @catcode`@%=@other @catcode`@&=@other @catcode`@#=@other @textfonts @rm @c Local variables: @c page-delimiter: "^\\\\message" @c End: octave-1.1.0/doc/dir100666 415 17 1030 5673175016 12411 0ustar jweusers-*- Text -*- This is the file .../info/dir, which contains the topmost node of the Info hierarchy. The first time you invoke Info you start off looking at that node, which is (dir)Top.  File: dir Node: Top This is the top of the INFO tree This (the Directory node) gives a menu of major topics. Typing "d" returns here, "q" exits, "?" lists all INFO commands, "h" gives a primer for first-timers, "mItem" visits the menu item named `Item', etc. * Octave: (octave). Interactive language for numerical computations. octave-1.1.0/doc/octave.1100666 415 17 4743 5650255133 13263 0ustar jweusers.\" Man page for Octave .\" .\" Copyright (C) 1994 John W. Eaton .\" .\" This file is part of Octave. .\" .\" Octave 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, or (at your option) any .\" later version. .\" .\" Octave 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 Octave; see the file COPYING. If not, write to the Free .\" Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. .\" .TH Octave 1 "Oct 16 1994" .LO 1 .SH NAME Octave \- A high-level interactive language for numerical computations. .SH SYNOPSIS .nf octave [-?Vdfhiqvx] [-p path] [--debug] [--help] [--ignore-init-file] [--info-file file] [--interactive] [--path path] [--silent] [--verbose] [--version] [--echo-commands] [file] .fi .SH DESCRIPTION Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems numerically. .SH DOCUMENTATION The primary documentation for Octave is written using Texinfo, the GNU documentation system, which allows the same source files to be used to produce on-line and printed versions of the manual. .PP You can read the on-line copy of the Octave documentation by issuing the command .nf octave:13> help -i .fi while running Octave interactively, by using the GNU Emacs info mode, or by running standalone programs like info or xinfo. .SH BUGS The best way to submit a bug report for Octave is to use the command .nf octave:13> bug_report .fi while running Octave interactively. This will create a template bug report file and start an editor on that file. Your message will be sent to the bug-octave mailing list once you are finished editing the template. .PP If you are unable to use the bug_report command, send your message to the .B bug-octave@che.utexas.edu mailing list by some other means. Please read the `Bugs' chapter in the Octave manual to find out how to submit a bug report that will enable the Octave maintainers to fix the problem. .SH AUTHOR .nf John W. Eaton UT Austin Department of Chemical Engineering Austin, Texas 78712 .fi octave-1.1.0/doc/refcard.tex.in100666 415 17 57613 5544140740 14500 0ustar jweusers% This file is TeX source for a reference card describing Octave. % debugger. % % I did not come up will all of this on my own. Most of it is % modified from the source for the gdb reference card, which was % orignally written by Roland Pesch . % % $Id: refcard.tex,v 1.99.8.1 1993/10/19 21:35:56 pesch Exp $ % Copyright (C) 1991, 1992 Free Software Foundation, Inc. % Permission is granted to make and distribute verbatim copies of % this reference provided the copyright notices and permission notices % are preserved on all copies. % % TeX markup is a programming language; accordingly this file is source % for a program to generate a reference. % % 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, 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 can find a copy of the GNU General Public License in the GDB % manual; or write to the Free Software Foundation, Inc., % 675 Mass Ave, Cambridge, MA 02139, USA. % % 22-AUG-1993 Andreas Vogel % % Modifications made in order to handle different papersizes correctly. % You only have to set the total width and height of the paper, the % horizontal and vertical margin space measured from *paper edge* % and the interline and interspec spacing. % In order to support a new papersize, you have to fiddle with the % latter four dimensions. Just try out a few values. % All other values will be computed at process time so it should be % quite easy to support different paper sizes - only four values to % guess :-) % % To find the configuration places, just search for the string % "CONFIGURATION". % % Andreas Vogel (av@ssw.de) % % Uncomment the following `magnification' command if you want to print % out in a larger font. Caution! You may need larger paper. You had % best avoid using 3-column output if you try this. See the ``Three % column format'' section below if you want to print in three column % format. % %\magnification=\magstep 1 % % NOTE ON INTENTIONAL OMISSIONS: This reference card includes many % Octave commands, but due to space constraints there are some things % I chose to omit. In general, not all synonyms for commands are % covered, nor all variations of a command. % %-------------------- Three column format ----------------------- %%%% --- To disable three column format, comment out this entire section % Three-column format for landscape printing \special{landscape}%-- is 'honored' by dvips %-------- Papersize defs: \newdimen\totalwidth \newdimen\totalheight \newdimen\hmargin \newdimen\vmargin \newdimen\secskip \newdimen\lskip \newdimen\barwidth \newdimen\barheight \newdimen\intersecwidth %% %% START CONFIGURATION - PAPERSIZE DEFINITIONS %%%------- Papersize params: --- Recommended: Use one of the following two --- %% US letter paper (8.5x11in) %% \totalwidth=11in % total width of paper \totalheight=8.5in % total height of paper \hmargin=.25in % horizontal margin width \vmargin=.25in % vertical margin width \secskip=1pc % space between refcard secs \lskip=2pt % extra skip between \sec entries %% %% Non-American standard A4 paper (Note: 1 in := 254 mm [ISO DEFINITION]) %% % \totalwidth=297mm % total width of paper % \totalheight=210mm % total height of paper % \hmargin=9mm % horizontal margin width % \vmargin=7mm % vertical margin width % \secskip=3mm % space between refcard secs % \lskip=0.4mm % extra skip between \sec entries %------- end papersize params %% %% change according to personal taste, not papersize dependent %% \barwidth=.1pt % width of the cropmark bar \barheight=2pt % height of the cropmark bar \intersecwidth=0.5em % width between \itmwid and \dfnwid %% %% END CONFIGURATION - PAPERSIZE DEFINITIONS %% %% %% values to be computed - nothing to configure %% \newdimen\fullhsize % width of area without margins \newdimen\itmwid % width of item column \newdimen\dfnwid % width of definition column \newdimen\temp % only for temporary use \newdimen\iofooitmwid % width of item column in iofoosec \newdimen\iofoodfnwid % width of definition column in iofoosec %% %% adjust the offsets so the margins are measured *from paper edge* %% \hoffset=-1in \advance \hoffset by \hmargin \voffset=-1in \advance \voffset by \vmargin %% %% fullhsize = totalwidth - (2 * hmargin) %% \fullhsize=\totalwidth \temp=\hmargin \multiply \temp by 2 \advance \fullhsize by -\temp %% %% hsize = (fullhsize - (4 * hmargin) - (2 * barwidth)) / 3 %% \hsize=\fullhsize \temp=\hmargin \multiply \temp by 4 \advance \hsize by -\temp \temp=\barwidth \multiply \temp by 2 \advance \hsize by -\temp \divide \hsize by 3 %% %% vsize = totalheight - (2 * vmargin) %% \vsize=\totalheight \temp=\vmargin \multiply \temp by 2 \advance \vsize by -\temp %% %% itmwid = (hsize - intersecwidth) * 1/3 %% dfnwid = (hsize - intersecwidth) * 2/3 %% \temp=\hsize \advance \temp by -\intersecwidth \divide \temp by 3 \itmwid=\temp \dfnwid=\hsize \advance \dfnwid by -\itmwid \iofooitmwid=\itmwid \advance \iofooitmwid by 0.35in \iofoodfnwid=\dfnwid \advance \iofoodfnwid by -0.35in %-------- end papersize defs \def\fulline{\hbox to \fullhsize} \let\lcr=L \newbox\leftcolumn\newbox\centercolumn \output={\if L\lcr \global\setbox\leftcolumn=\columnbox \global\let\lcr=C \else \if C\lcr \global\setbox\centercolumn=\columnbox \global\let\lcr=R \else \tripleformat \global\let\lcr=L \fi \fi % \ifnum\outputpenalty>-20000 \else\dosupereject\fi } %% %% START CONFIGURATION - ALTERNATIVE FOLDING GUIDES %% %% For NO printed folding guide, %% comment out other \def\vdecor's and uncomment: %\def\vdecor{\hskip\hmargin plus1fil\hskip\barwidth plus1fil\hskip\hmargin plus1fil} %% For SOLID LINE folding guide, %% comment out other \def\vdecor's and uncomment: %\def\vdecor{\hskip\hmargin plus1fil \vrule width \barwidth \hskip\hmargin plus1fil} %% For SMALL MARKS NEAR TOP AND BOTTOM as folding guide, %% comment out other \def\vdecor's and uncomment: \def\vdecor{\hskip\hmargin plus1fil \vbox to \vsize{\hbox to \barwidth{\vrule height\barheight width\barwidth}\vfill \hbox to \barwidth{\vrule height\barheight width\barwidth}}%THIS PERCENT SIGN IS ESSENTIAL \hskip\hmargin plus1fil} %% %% END CONFIGURATION - ALTERNATIVES FOR FOLDING GUIDES %% \def\tripleformat{\shipout\vbox{\fulline{\box\leftcolumn\vdecor \box\centercolumn\vdecor \columnbox} } \advancepageno} \def\columnbox{\leftline{\pagebody}} \def\bye{\par\vfill \supereject \if R\lcr \null\vfill\eject\fi \end} %-------------------- end three column format ----------------------- %-------------------- Computer Modern font defs: -------------------- \font\bbf=cmbx10 \font\vbbf=cmbx12 \font\smrm=cmr6 \font\brm=cmr10 \font\rm=cmr7 \font\it=cmti7 \font\tt=cmtt8 %-------------------- end font defs --------------------------------- % \hyphenpenalty=5000\tolerance=2000\raggedright\raggedbottom \normalbaselineskip=9pt\baselineskip=9pt % \parindent=0pt \parskip=0pt \footline={\vbox to0pt{\hss}} % \def\ctl#1{{\tt C-#1}} \def\opt#1{{\brm[{\rm #1}]}} \def\xtra#1{\noalign{\smallskip{\tt#1}}} % \long\def\sec#1;#2\endsec{\vskip \secskip \halign{% %COL 1 (of halign): \vtop{\hsize=\itmwid\tt ##\par\vskip \lskip }\hfil %COL 2 (of halign): &\vtop{\hsize=\dfnwid\hangafter=1\hangindent=\intersecwidth \rm ##\par\vskip \lskip}\cr %Tail of \long\def fills in halign body with \sec args: \noalign{{\bbf #1}\vskip \lskip} #2 } } \long\def\widesec#1;#2\endsec{\vskip \secskip \halign{% %COL 1 (of halign): \vbox{\tt ##\par\vskip \lskip }\cr %Tail of \long\def fills in halign body with \sec args: \noalign{{\bbf #1}\vskip 3\lskip} #2 } } \long\def\iofoosec#1;#2\endsec{\vskip \secskip \halign{% %COL 1 (of halign): \vtop{\hsize=\iofooitmwid\tt ##\par\vskip \lskip }\hfil %COL 2 (of halign): &\vtop{\hsize=\iofoodfnwid\hangafter=1\hangindent=\intersecwidth \rm ##\par\vskip \lskip}\cr %Tail of \long\def fills in halign body with \sec args: \noalign{{\bbf #1}\vskip \lskip} #2 } } {\vbbf Octave Quick Reference}\hfil{\smrm Octave Version 1.0}\qquad \sec Starting Octave; octave&start interactive Octave session\cr octave {\it file}&run Octave on commands in {\it file}\cr octave --help&describe command line options\cr \endsec \sec Stopping Octave; quit {\rm or} exit&exit Octave\cr INTERRUPT&({\it e.g.} \ctl{c}) terminate current command and return to top-level prompt\cr \endsec \sec Getting Help; help&list all commands and built-in variables\cr help {\it command}&briefly describe {\it command}\cr help -i&use Info to browse Octave manual\cr help -i {\it command}&search for {\it command\/} in Octave manual\cr \endsec \sec Motion in Info; SPC {\rm or} C-v&scroll forward one screenful\cr DEL {\rm or} M-v&scroll backward one screenful\cr C-l&redraw the display\cr \endsec \sec Node Selection in Info; n&select the next node\cr p&select the previous node\cr u&select the `up' node\cr t&select the `top' node\cr d&select the directory node\cr <&select the first node in the current file\cr >&select the last node in the current file\cr ]&move forward through the node structure\cr [&move backward through the nodes\cr g&reads the name of a node and selects it\cr C-x k&kills the current node\cr \endsec \sec Searching in Info; s&search for a string\cr C-s&search forward incrementally\cr C-r&search backward incrementally\cr i&search index and go to corresponding node\cr ,&go to next match from last `i' command\cr \endsec \sec Command-Line Cursor Motion; C-b&move back one character\cr C-f&move forward one character\cr C-a&move the the start of the line\cr C-e&move to the end of the line\cr M-f&move forward a word\cr M-b&move backward a word\cr C-l&clear screen, reprinting current line at top\cr \endsec \vfill \line{\smrm \opt{ } surround optional arguments \hfill ... show one or more arguments} \vskip\baselineskip \centerline{\smrm Copyright 1994, John W. Eaton\qquad Permissions on back} \eject \sec Inserting or Changing Text; M-TAB&insert a tab character\cr DEL&delete character to the left of the cursor\cr C-d&delete character under the cursor\cr C-v&add the next character verbatim\cr C-t&transpose characters at the point\cr M-t&transpose words at the point\cr M-u&uppercase the current word\cr M-l&lowercase the current word\cr M-c&capitalize the current word\cr \endsec \sec Killing and Yanking; C-k&kill to the end of the line\cr C-y&yank the most recently killed text\cr M-d&kill to the end of the current word\cr M-DEL&kill the word behind the cursor\cr M-y&rotate the kill ring and yank the new top\cr \endsec \sec Command Completion and History; TAB&complete a command or variable name\cr M-?&list possible completions\cr RET&enter the current line \cr C-p&move `up' through the history list\cr C-n&move `down' through the history list\cr M-<&move to the first line in the history\cr M->&move to the last line in the history\cr C-r&search backward in the history list\cr C-s&search forward in the history list\cr history \opt{{-q}} \opt{{\it N\/}}&list {\it N\/} previous history lines, omitting history numbers if {\tt -q}\cr history -w \opt{{\it file}}&write history to {\it file\/} ({\tt ~/.octave\_hist} if no {\it file\/} argument)\cr history -r \opt{{\it file}}&read history from {\it file\/} ({\tt ~/.octave\_hist} if no {\it file\/} argument)\cr edit\_history {\it lines}&edit and then run previous commands from the history list\cr run\_history {\it lines}&run previous commands from the history list\cr \quad\opt{{\it beg\/}} \opt{{\it end\/}}&Specify the first and last history commands to edit or run.\cr \omit \vbox{\rm If {\it beg}\/ is greater than {\it end}, reverse the list of commands before editing. If {\it end\/} is omitted, select commands from {\it beg\/} to the end of the history list. If both arguments are omitted, edit the previous item in the history list.}\span\cr \endsec \sec Shell Commands; cd {\it dir}&change working directory to {\it dir}\cr pwd&print working directory\cr ls \opt{{\it options}}&print directory listing\cr getenv ({\it string})&return value of named environment variable\cr shell\_cmd ({\it cmd})&execute arbitrary shell command string\cr \endsec \vfill\eject \sec Matrices; \omit \vbox{\rm\vskip0.5ex Square brackets delimit literal matrices. Commas separate elements on the same row. Semicolons separate rows. Commas may be replaced by spaces, and semicolons may be replaced by one or more newlines. Elements of a matrix may be arbitrary expressions, provided that all the dimensions agree.\vskip0.75ex}\span\cr [ {\it x}, {\it y}, ... ]&enter a row vector\cr [ {\it x}; {\it y}; ... ]&enter a column vector\cr [ {\it w}, {\it x}; {\it y}, {\it z} ]&enter a 2$\times$2 matrix\cr \endsec \sec Ranges; {\it base} : {\it limit}\cr {\it base} : {\it incr} : {\it limit}\cr \omit \vbox{\rm\vskip0.85ex Specify a range of values beginning with {\it base\/} with no elements greater than {\it limit}. If it is omitted, the default value of {\it incr\/} is 1. Negative increments are permitted.}\cr \endsec \sec Strings and Common Escape Sequences; \omit \vbox{\rm\vskip0.5ex A {\it string constant\/} consists of a sequence of characters enclosed in either double-quote or single-quote marks.\vskip0.75ex}\span\cr \char'134\char'134&a literal backslash\cr \char'134 "&a literal double-quote character\cr \char'134 '&a literal single-quote character\cr \char'134 n&newline, ASCII code 10\cr \char'134 t&horizontal tab, ASCII code 9\cr \endsec \sec Index Expressions; {\it var} ({\it idx})&select elements of a vector\cr {\it var} ({\it idx1}, {\it idx2})&select elements of a matrix\cr \quad {\it scalar}&select row (column) corresponding to {\it scalar}\cr \quad {\it vector}&select rows (columns) corresponding to the elements of {\it vector}\cr \quad {\it range}&select rows (columns) corresponding to the elements of {\it range}\cr \quad :&select all rows (columns)\cr \endsec \sec Global Variables; global {\it var1} ...&Declare variables global.\cr \omit \vbox{\rm\vskip0.5ex Global variables may be accessed inside the body of a function without having to be passed in the function parameter list provided they are also declared global within the function.}\span\cr \endsec \sec Selected Built-in Variables; EDITOR&editor to use with {\tt edit\_history}\cr LOADPATH&colon separated path to search for M-files\cr PAGER&program to use to paginate output\cr ans&most recent result not explicitly assigned\cr eps&machine precision\cr \omit\tt output\_max\_field\_width\span\cr output\_precision&maximum numeric field width, and minimum significant figures to display\cr page\_screen\_output&control whether output is paged\cr pi&$\pi$\cr save\_precision&digits stored by the {\tt save} command\cr silent\_functions&suppress output from functions\cr \endsec \vfill\eject \sec Arithmetic and Increment Operators; {\it x} + {\it y}&addition\cr {\it x} - {\it y}&subtraction\cr {\it x} * {\it y}&matrix multiplication\cr {\it x} .* {\it y}&element by element multiplication\cr {\it x} / {\it y}&right division, conceptually equivalent to {\tt (inverse~(y')~*~x')'}\cr {\it x} ./ {\it y}&element by element right division\cr {\it x} \char'134{} {\it y}&left division, conceptually equivalent to {\tt inverse~(x)~*~y}\cr {\it x} .\char'134{} {\it y}&element by element left division\cr {\it x} \char'136{} {\it y}&power operator\cr {\it x} .\char'136{} {\it y}&element by element power operator\cr - {\it x}&negation\cr + {\it x}&unary plus (a no-op)\cr {\it x} '&complex conjugate transpose\cr {\it x} .'&transpose\cr ++ {\it x}\quad{\rm(}-- {\it x}{\rm)}&increment (decrement) {\it x}, return {\it new\/} value\cr {\it x} ++\quad{\rm(}{\it x} --{\rm)}&increment (decrement) {\it x}, return {\it old\/} value\cr \endsec \sec Assignment Expressions; {\it var} = {\it expr}&assign expression to variable\cr {\it var} ({\it idx}) = {\it expr}&assign expression to indexed variable\cr \endsec \sec Comparison and Boolean Operators; {\it x} < {\it y}&true if {\it x\/} is less than {\it y}\cr {\it x} <= {\it y}&true if {\it x\/} is less than or equal to {\it y}\cr {\it x} == {\it y}&true if {\it x\/} is greater than {\it y}\cr {\it x} >= {\it y}&true if {\it x\/} is greater than or equal to {\it y}\cr {\it x} > {\it y}&true if {\it x\/} is equal to {\it y}\cr {\it x} != {\it y}&true if {\it x\/} is not equal to {\it y}\cr {\it bool1} \&\& {\it bool2}&true if both {\it bool1\/} and {\it bool2\/} are both true\cr {\it bool1} || {\it bool2}&true if at least one of {\it bool1\/}, {\it bool2\/} is true\cr ! {\it bool}&true {\it bool\/} is false\cr \endsec \sec Operator Precedence; \omit \vbox{\rm\vskip0.5ex Here is a table of the operators in Octave, in order of increasing precedence.\vskip0.75ex}\span\cr ;\ \ ,&statement separators\cr =&assignment, groups left to right\cr ||\ \ \&\&&logical ``or'' and ``and''\cr < <= == >= > !=&relational operators\cr :&colon\cr +\ \ -&addition and subtraction\cr * / \char'134\ \ .*\ \ ./\ \ .\char'134&multiplication and division\cr '\ \ .'&transpose\cr +\ \ -\ \ ++\ \ --\ \ !&unary minus, increment, logical ``not''\cr \char'136\ \ .\char'136&exponentiation\cr \endsec \widesec Statements; for {\it identifier} = {\it expr} {\it stmt-list} endfor\cr while ({\it condition}) {\it stmt-list} endwhile\cr \hbox{\vtop{\hsize=\itmwid\tt break} \vtop{\hsize=\dfnwid\rm exit innermost loop}}\cr \hbox{\vtop{\hsize=\itmwid\tt continue} \vtop{\hsize=\dfnwid\rm go to beginning of innermost loop}}\cr \hbox{\vtop{\hsize=\itmwid\tt return} \vtop{\hsize=\dfnwid\rm return to calling function}}\cr if ({\it condition}) {\it if-body} \opt{else {\it else-body}} endif\cr if ({\it condition}) {\it if-body} \opt{elseif ({\it condition}) {\it elseif-body}} endif\cr \vbox{\rm\vskip0.75ex Any number of {\tt elseif} clauses may appear in an {\tt if} statement.}\cr \endsec \vfill\eject \widesec Defining Functions; function \opt{{\it ret-list}} {\it function-name} \opt{\hskip0.2em({\it arg-list})\hskip0.2em}\cr \quad{\it function-body}\cr endfunction\cr\cr {\rm {\it ret-list\/} may be a single identifier or a comma-separated list of identifiers delimited by square-brackets.\vskip0.75ex}\cr {\rm {\it arg-list\/} is a comma-separated list of identifiers and may be empty.}\cr \endsec % sin({\it a}) cos({\it a}) tan({\it a})&trigonometric functions\cr % asin({\it a}) acos({\it a}) atan({\it a})&inverse trigonometric functions\cr % sinh({\it a}) cosh({\it a}) tanh({\it a})&hyperbolic trig functions\cr % asinh({\it a}) acosh({\it a}) atanh({\it a})&inverse hyperbolic trig % functions\cr\cr \sec Miscellaneous Functions; chol ({\it a})&Cholesky factorization\cr det ({\it a})&compute the determinant of a matrix\cr eig ({\it a})&eigenvalues and eigenvectors\cr expm ({\it a})&compute the exponential of a matrix\cr hess ({\it a})&compute Hessenberg decomposition\cr inverse ({\it a})&invert a square matrix\cr norm ({\it a}, {\it p})&compute the {\it p}-norm of a matrix\cr qr ({\it a})&compute the QR factorization of a matrix\cr rank ({\it a})&matrix rank\cr schur ({\it a})&Schur decomposition of a matrix\cr svd ({\it a})&singular value decomposition\cr syl ({\it a}, {\it b}, {\it c})&solve the Sylvester equation\cr\cr rows ({\it a})&return number of rows of {\it a}\cr columns ({\it a})&return number of columns of {\it a}\cr all ({\it a})&check if all elements of {\it a\/} nonzero\cr any ({\it a})&check if any elements of {\it a\/} nonzero\cr\cr diag ({\it v}, {\it k})&create diagonal matrices\cr linspace ({\it b}, {\it l}, {\it n})&create vector of linearly-spaced elements\cr logspace ({\it b}, {\it l}, {\it n})&create vector of log-spaced elements\cr eye ({\it n}, {\it m})&create {\it n\/} by {\it m\/} identity matrix\cr ones ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of ones\cr zeros ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of zeros\cr rand ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of random values\cr eval ({\it string})&evaluate {\it string} as a command\cr feval ({\it string}, ...)&evaluate function named by {\it string}, passing remaining arguments to called function\cr\cr error ({\it message})&print message and return to top level\cr\cr clear {\it pattern}&clear variables matching pattern\cr exist ({\it string})&check existence of variable or function\cr who&list current variables\cr\cr *fsolve&solve nonlinear algebraic equations\cr *lsode&integrate nonlinear ODEs\cr *dassl&integrate nonlinear DAEs\cr *quad&integrate nonlinear functions\cr@LOCAL@\cr @LOCAL@*qpsol&solve quadratic programs\cr @LOCAL@*npsol&solve nonlinear programs\cr\cr perror ({\it nm}, {\it code})&for functions that return numeric codes, print error message for named function and given error code\cr\cr \omit \vbox{\rm {\tt *} See the on-line or printed manual for the complete list of arguments for these functions.}\span\cr \endsec \vfill\eject \sec Plotting; \omit \vbox{\tt gplot \opt{{\it ranges}} {\it expr} \opt{{\it using}} \opt{{\it title}} \opt{{\it style}}\hfill{\rm 2D plotting} \par\vskip \lskip}\span\cr \omit \vbox{\tt gsplot \opt{{\it ranges}} {\it expr} \opt{{\it using}} \opt{{\it title}} \opt{{\it style}}\hfill{\rm 3D plotting} \par\vskip \lskip}\span\cr \quad{\it ranges}&specify data ranges\cr \quad{\it expr}&expression to plot\cr \quad{\it using}&specify columns to plot\cr \quad{\it title}&specify line title for legend\cr \quad{\it style}&specify line style\cr \omit \vbox{\rm\vskip0.85ex If {\it ranges\/} are supplied, they must come before the expression to plot. The {\it using\/}, {\it title\/}, and {\it style\/} options may appear in any order after {\it expr\/}. Multiple expressions may be plotted with a single command by separating them with commas.\vskip1ex}\span\cr set {\it options}&set plotting options\cr show {\it options}&show plotting options\cr replot&redisplay current plot\cr closeplot&close stream to {\tt gnuplot} process\cr purge\_tmp\_files&clean up temporary plotting files\cr \endsec \iofoosec C-style Input and Output; fopen ({\it name}, {\it mode})&open {\it file}\cr fclose ({\it file})&close {\it file}\cr printf ({\it fmt}, ...)&formatted output to {\tt stdout}\cr fprintf ({\it file}, {\it fmt}, ...)&formatted output to {\it file}\cr sprintf ({\it fmt}, ...)&formatted output returned as string\cr scanf ({\it fmt})&formatted input from {\tt stdin}\cr fscanf ({\it file}, {\it fmt})&formatted input from {\it file}\cr sscanf ({\it str}, {\it fmt})&formatted input from {\it string}\cr fgets ({\it file}, {\it len})&read {\it len\/} characters from {\it file\/}\cr fflush ({\it file})&flush pending output to {\it file}\cr ftell ({\it file})&return file pointer position\cr frewind ({\it file})&move file pointer to beginning\cr freport&print a info for open files\cr \omit \vbox{\rm\vskip0.75ex A file may be referenced either by name or by the number returned from {\tt fopen}. Three files are preconnected when Octave starts: {\tt stdin}, {\tt stdout}, and {\tt stderr}.\vskip0.75ex}\span\cr \endsec \vskip 0pt plus 2fill \hrule width \hsize \par\vskip10pt {\smrm\parskip=6pt Edition 1.0 for Octave Version 1.0. Copyright 1994, John W. Eaton (jwe@che.utexas.edu). The author assumes no responsibility for any errors on this card. This card may be freely distributed under the terms of the GNU General Public License. \TeX{} Macros for this card by Roland Pesch (pesch@cygnus.com), originally for the GDB reference card Octave itself is free software; you are welcome to distribute copies of it under the terms of the GNU General Public License. There is absolutely no warranty for Octave. } \end % For AUCTeX: % % Local Variables: % mode: tex % TeX-master: t % End: octave-1.1.0/doc/refcard.tex100666 415 17 77747 5705317742 14114 0ustar jweusers% refcard.tex % % This file is TeX source for a reference card describing Octave. % % John W. Eaton % jwe@che.utexas.edu % Department of Chemical Engineering % The University of Texas at Austin % % Heavily modified by jwe from the source for the gdb reference card, % which was orignally written by Roland Pesch . % % Copyright (C) 1991, 1992 Free Software Foundation, Inc. % Permission is granted to make and distribute verbatim copies of % this reference provided the copyright notices and permission notices % are preserved on all copies. % % TeX markup is a programming language; accordingly this file is source % for a program to generate a reference. % % 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, 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 can find a copy of the GNU General Public License in the GDB % manual; or write to the Free Software Foundation, Inc., % 675 Mass Ave, Cambridge, MA 02139, USA. % % You only have to set the total width and height of the paper, the % horizontal and vertical margin space measured from *paper edge* % and the interline and interspec spacing. % In order to support a new papersize, you have to fiddle with the % latter four dimensions. Just try out a few values. % All other values will be computed at process time so it should be % quite easy to support different paper sizes - only four values to % guess :-) % % To find the configuration places, just search for the string % "User configuration". % % -- Andreas Vogel (av@ssw.de) % % NOTE ON INTENTIONAL OMISSIONS: This reference card includes many % Octave commands, but due to space constraints there are some things % I chose to omit. In general, not all synonyms for commands are % covered, nor all variations of a command. % ------------------ % multicolumn format % ------------------ % This works with dvips \special{landscape} % Declarations (these must come first) \newdimen\totalwidth \newdimen\totalheight \newdimen\hmargin \newdimen\vmargin \newdimen\secskip \newdimen\lskip \newdimen\barwidth \newdimen\barheight \newdimen\intersecwidth \newcount\columnsperpage %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % CONFIGURATION % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % There are currently 8 total columns, so some of these options will % not create a single page reference card. % Choose a paper size. Uncomment only one of the following sections. % 4 columns, US legal paper (8.5 x 14in) \columnsperpage=4 % total number of columns to typeset \totalwidth=14in % total width of paper \totalheight=8.5in % total height of paper \hmargin=0.20in % horizontal margin width \vmargin=0.25in % vertical margin width \secskip=0.75pc % space between refcard secs \lskip=2pt % extra skip between \sec entries % 3 columns, US letter paper (8.5 x 14in) % \columnsperpage=3 % total number of columns to typeset % \totalwidth=11in % total width of paper % \totalheight=8.5in % total height of paper % \hmargin=0.25in % horizontal margin width % \vmargin=0.25in % vertical margin width % \secskip=0.75pc % space between refcard secs % \lskip=2pt % extra skip between \sec entries % 3 columns, A4 paper (Note: 1 in := 254 mm [ISO DEFINITION]) % \columnsperpage=3 % total number of columns to typeset % \totalwidth=297mm % total width of paper % \totalheight=210mm % total height of paper % \hmargin=9mm % horizontal margin width % \vmargin=7mm % vertical margin width % \secskip=3mm % space between refcard secs % \lskip=0.4mm % extra skip between \sec entries % Change according to personal taste, not papersize dependent. \barwidth=.1pt % width of the cropmark bar \barheight=2pt % height of the cropmark bar \intersecwidth=0.5em % width between \itmwid and \dfnwid % Uncomment only one of the following definitions for folding guides. % No printed folding guide: %\def\vdecor{\hskip\hmargin plus1fil % \hskip\barwidth plus1fil % \hskip\hmargin plus1fil} % Solid line folding guide: %\def\vdecor{\hskip\hmargin plus1fil% % \vrule width \barwidth% % \hskip\hmargin plus1fil} % For small marks near top and bottom as folding guide: \def\vdecor{\hskip\hmargin plus1fil% \vbox to \vsize{\hbox to \barwidth{\vrule height\barheight width\barwidth}% \vfill \hbox to \barwidth{\vrule height\barheight width\barwidth}}% \hskip\hmargin plus1fil} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % END CONFIGURATION % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % values to be computed based on above definitions. % nothing to configure \newdimen\fullhsize % width of area without margins \newdimen\itmwid % width of item column \newdimen\dfnwid % width of definition column \newdimen\idnwid % width of indented text \newdimen\temp % only for temporary use % an alternate section format, used in some cases to make text fit better. \newdimen\altitmwid % width of item column in altsec \newdimen\altdfnwid % width of definition column in altsec % adjust the offsets so the margins are measured *from paper edge* \hoffset=-1in \advance \hoffset by \hmargin \voffset=-1in \advance \voffset by \vmargin % Subtract hmargin for left and right sides of paper from full width. % % fullhsize = totalwidth - (2 * hmargin) \fullhsize=\totalwidth \temp=\hmargin \multiply \temp by 2 \advance \fullhsize by -\temp % intercolumn space is composed of hmargin barwidth hmargin so that we % get the same amount of space on either side of the (optional) rule % between columns. For N columns, we need to subtract this amount of % space N-1 times. Divide by the number of columns to get the final % value of \hsize that we use to typeset columns. % hsize = (fullhsize - (ncols-1)*barwidth - 2*(ncols-1)*hmargin) / ncols \newcount\tmpcnt \tmpcnt\columnsperpage \advance \tmpcnt by -1 \hsize=\fullhsize \temp=\barwidth \multiply \temp by \tmpcnt \advance \hsize by -\temp \multiply \tmpcnt by 2 \temp=\hmargin \multiply \temp by \tmpcnt \advance \hsize by -\temp \divide \hsize by 4 % Vertical size is easy -- same amount of space above and below. % % vsize = totalheight - (2 * vmargin) \vsize=\totalheight \temp=\vmargin \multiply \temp by 2 \advance \vsize by -\temp % Width of items in a section. % itmwid = (hsize - intersecwidth) * 1/3 % dfnwid = (hsize - intersecwidth) * 2/3 % width of the item \temp=\hsize \advance \temp by -\intersecwidth \divide \temp by 3 \itmwid=\temp % width of the corresponding definition \dfnwid=\hsize \advance \dfnwid by -\itmwid % indentation for sub items, etc. \temp=\hsize \advance\temp by -1em \idnwid=\temp % Width of items in an alt section. \altitmwid=\itmwid \advance \altitmwid by 0.35in \altdfnwid=\dfnwid \advance \altdfnwid by -0.35in % Output macros. % % Strategy: % % * set each column in a box % * append new columns in a global `holding' box, inserting % intercolumn decorations as necessary. % * when we fill a page, dump the saved box and the latest column, % separated by the intercolumn decoration. \newbox\holdbox \newcount\colno \colno=0 \output={\relax \global\advance\colno by 1 \ifnum\colno=1 \global\setbox\holdbox=\columnbox \else \ifnum\colno=\columnsperpage \shipout\hbox to \fullhsize{\box\holdbox\vdecor\columnbox} \advancepageno \global\colno=0 \else \global\setbox\holdbox=\vbox{\hbox{\box\holdbox\vdecor\columnbox}} \fi \fi} \def\columnbox{\leftline{\pagebody}} \def\bye{\par\vfill \supereject \if R\lcr \null\vfill\eject \fi \end} % ----- % Fonts % ----- \font\bbf=cmbx10 \font\vbbf=cmbx12 \font\smrm=cmr6 \font\brm=cmr10 \font\rm=cmr7 \font\it=cmti7 \font\tt=cmtt8 % We can afford to allow some slop \hfuzz=1pt \vfuzz=1pt \hyphenpenalty=5000 \tolerance=2000 \raggedright \raggedbottom \normalbaselineskip=9pt \baselineskip=9pt \parindent=0pt \parskip=0pt \footline={\vbox to0pt{\hss}} \def\ctl#1{{\tt C-#1}} \def\opt#1{{\brm[{\rm #1}]}} \def\xtra#1{\noalign{\smallskip{\tt#1}}} % A normal section \long\def\sec#1;#2\endsec{\vskip \secskip \halign{% % % column 1 (of halign): % \vtop{\hsize=\itmwid\tt ##\par\vskip \lskip }\hfil % % column 2 (of halign): % &\vtop{% \hsize=\dfnwid \hangafter=1 \hangindent=\intersecwidth \rm ##\par\vskip \lskip}\cr % % Tail of \long\def fills in halign body with \sec args: % \noalign{{\bbf #1}% \vskip \lskip} #2}} \long\def\widesec#1;#2\endsec{\vskip \secskip \halign{% % % column 1 (of halign): % \vbox{\tt ##\par\vskip \lskip }\cr % % Tail of \long\def fills in halign body with \sec args: % \noalign{{\bbf #1}\vskip 3\lskip} #2}} % an alternate section format, used in some cases to make text fit better. \long\def\altsec#1;#2\endsec{\vskip \secskip \halign{% % % column 1 (of halign): % \vtop{\hsize=\altitmwid\tt ##\par\vskip \lskip}\hfil % % column 2 (of halign): % &\vtop{% \hsize=\altdfnwid \hangafter=1 \hangindent=\intersecwidth \rm ##\par\vskip \lskip}\cr % % Tail of \long\def fills in halign body with \sec args: % \noalign{{\bbf #1}\vskip \lskip} #2}} % ------------------------------------- % The actual text of the reference card % ------------------------------------- {\vbbf Octave Quick Reference}\hfil{\smrm Octave Version 1.0}\qquad \sec Starting Octave; octave&start interactive Octave session\cr octave {\it file}&run Octave on commands in {\it file}\cr octave --help&describe command line options\cr \endsec \sec Stopping Octave; quit {\rm or} exit&exit Octave\cr INTERRUPT&({\it e.g.} \ctl{c}) terminate current command and return to top-level prompt\cr \endsec \sec Getting Help; help&list all commands and built-in variables\cr help {\it command}&briefly describe {\it command}\cr help -i&use Info to browse Octave manual\cr help -i {\it command}&search for {\it command\/} in Octave manual\cr \endsec \sec Motion in Info; SPC {\rm or} C-v&scroll forward one screenful\cr DEL {\rm or} M-v&scroll backward one screenful\cr C-l&redraw the display\cr \endsec \sec Node Selection in Info; n&select the next node\cr p&select the previous node\cr u&select the `up' node\cr t&select the `top' node\cr d&select the directory node\cr <&select the first node in the current file\cr >&select the last node in the current file\cr % ]&move forward through the node structure\cr % [&move backward through the nodes\cr g&reads the name of a node and selects it\cr C-x k&kills the current node\cr \endsec \sec Searching in Info; s&search for a string\cr C-s&search forward incrementally\cr C-r&search backward incrementally\cr i&search index \& go to corresponding node\cr ,&go to next match from last `i' command\cr \endsec \sec Command-Line Cursor Motion; C-b&move back one character\cr C-f&move forward one character\cr C-a&move the the start of the line\cr C-e&move to the end of the line\cr M-f&move forward a word\cr M-b&move backward a word\cr C-l&clear screen, reprinting current line at top\cr \endsec \sec Inserting or Changing Text; M-TAB&insert a tab character\cr DEL&delete character to the left of the cursor\cr C-d&delete character under the cursor\cr C-v&add the next character verbatim\cr C-t&transpose characters at the point\cr M-t&transpose words at the point\cr % M-u&uppercase the current word\cr % M-l&lowercase the current word\cr % M-c&capitalize the current word\cr \endsec \vfill \line{\smrm \opt{ } surround optional arguments \hfill ... show one or more arguments} \vskip0.25\baselineskip \centerline{\smrm Copyright 1994, John W. Eaton\qquad Permissions on back} \eject \sec Killing and Yanking; C-k&kill to the end of the line\cr C-y&yank the most recently killed text\cr M-d&kill to the end of the current word\cr M-DEL&kill the word behind the cursor\cr M-y&rotate the kill ring and yank the new top\cr \endsec \sec Command Completion and History; TAB&complete a command or variable name\cr M-?&list possible completions\cr RET&enter the current line \cr C-p&move `up' through the history list\cr C-n&move `down' through the history list\cr M-<&move to the first line in the history\cr M->&move to the last line in the history\cr C-r&search backward in the history list\cr C-s&search forward in the history list\cr history \opt{{-q}} \opt{{\it N\/}}&list {\it N\/} previous history lines, omitting history numbers if {\tt -q}\cr history -w \opt{{\it file}}&write history to {\it file\/} ({\tt ~/.octave\_hist} if no {\it file\/} argument)\cr history -r \opt{{\it file}}&read history from {\it file\/} ({\tt ~/.octave\_hist} if no {\it file\/} argument)\cr edit\_history {\it lines}&edit and then run previous commands from the history list\cr run\_history {\it lines}&run previous commands from the history list\cr \quad\opt{{\it beg\/}} \opt{{\it end\/}}&Specify the first and last history commands to edit or run.\cr \omit\hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex If {\it beg}\/ is greater than {\it end}, reverse the list of commands before editing. If {\it end\/} is omitted, select commands from {\it beg\/} to the end of the history list. If both arguments are omitted, edit the previous item in the history list.}\span\cr \endsec \sec Shell Commands; cd {\it dir}&change working directory to {\it dir}\cr pwd&print working directory\cr ls \opt{{\it options}}&print directory listing\cr getenv ({\it string})&return value of named environment variable\cr shell\_cmd ({\it cmd})&execute arbitrary shell command string\cr \endsec \sec Matrices; \omit\vbox{\rm\vskip0.25ex Square brackets delimit literal matrices. Commas separate elements on the same row. Semicolons separate rows. Commas may be replaced by spaces, and semicolons may be replaced by one or more newlines. Elements of a matrix may be arbitrary expressions, provided that all the dimensions agree.\vskip0.75ex}\span\cr [ {\it x}, {\it y}, ... ]&enter a row vector\cr [ {\it x}; {\it y}; ... ]&enter a column vector\cr [ {\it w}, {\it x}; {\it y}, {\it z} ]&enter a 2$\times$2 matrix\cr \endsec \sec Ranges; {\it base} : {\it limit}\cr {\it base} : {\it incr} : {\it limit}\cr \omit\hfill\vbox{\hsize=\idnwid\rm\vskip0.75ex Specify a range of values beginning with {\it base\/} with no elements greater than {\it limit}. If it is omitted, the default value of {\it incr\/} is 1. Negative increments are permitted.}\span\cr \endsec \vfill\eject \sec Strings and Common Escape Sequences; \omit\vbox{\rm\vskip0.5ex A {\it string constant\/} consists of a sequence of characters enclosed in either double-quote or single-quote marks.\vskip0.75ex}\span\cr \char'134\char'134&a literal backslash\cr \char'134 "&a literal double-quote character\cr \char'134 '&a literal single-quote character\cr \char'134 n&newline, ASCII code 10\cr \char'134 t&horizontal tab, ASCII code 9\cr \endsec \sec Index Expressions; {\it var} ({\it idx})&select elements of a vector\cr {\it var} ({\it idx1}, {\it idx2})&select elements of a matrix\cr \quad {\it scalar}&select row (column) corresponding to {\it scalar}\cr \quad {\it vector}&select rows (columns) corresponding to the elements of {\it vector}\cr \quad {\it range}&select rows (columns) corresponding to the elements of {\it range}\cr \quad :&select all rows (columns)\cr \endsec \sec Global Variables; global {\it var1} ...&Declare variables global.\cr \omit\hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Global variables may be accessed inside the body of a function without having to be passed in the function parameter list provided they are also declared global within the function.}\span\cr \endsec \sec Selected Built-in Variables; EDITOR&editor to use with {\tt edit\_history}\cr Inf, NaN&IEEE infinity, NaN\cr LOADPATH&path to search for function files\cr PAGER&program to use to paginate output\cr ans&last result not explicitly assigned\cr eps&machine precision\cr pi&$\pi$\cr realmax&maximum representable value\cr realmin&minimum representable value\cr \endsec \vskip -\secskip \vskip -2\lskip \altsec \null; automatic\_replot&automatically redraw plots\cr do\_fortran\_indexing&Fortran-style indexing of matrices\cr implicit\_str\_to\_num\_ok&allow strings to become numbers\cr output\_max\_field\_width&maximum numeric field width\cr output\_precision&min significant figures displayed\cr page\_screen\_output&control whether output is paged\cr prefer\_column\_vectors&create column vectors by default\cr resize\_on\_range\_error&automatic resizing of matrices\cr save\_precision&digits stored by {\tt save} command\cr silent\_functions&suppress output from functions\cr warn\_divide\_by\_zero&suppress divide by zero errors\cr \endsec \vskip -\secskip \vskip -2\lskip \widesec \null; commas\_in\_literal\_matrix\vskip\lskip\cr \omit\hfill\vbox{\hsize=\idnwid\rm control handling of spaces in matrices\vskip3\lskip}\cr ignore\_function\_time\_stamp\cr \omit\hfill\vbox{\hsize=\idnwid\rm ignore changes in function files during session\vskip3\lskip}\cr ok\_to\_lose\_imaginary\_part\cr \omit\hfill\vbox{\hsize=\idnwid\rm allow complex to real conversion\vskip3\lskip}\cr prefer\_zero\_one\_indexing\cr \omit\hfill\vbox{\hsize=\idnwid\rm if ambiguous, prefer 0-1 style indexing\vskip3\lskip}\cr \endsec \vfill\eject \sec Arithmetic and Increment Operators; {\it x} + {\it y}&addition\cr {\it x} - {\it y}&subtraction\cr {\it x} * {\it y}&matrix multiplication\cr {\it x} .* {\it y}&element by element multiplication\cr {\it x} / {\it y}&right division, conceptually equivalent to {\tt (inverse~(y')~*~x')'}\cr {\it x} ./ {\it y}&element by element right division\cr {\it x} \char'134{} {\it y}&left division, conceptually equivalent to {\tt inverse~(x)~*~y}\cr {\it x} .\char'134{} {\it y}&element by element left division\cr {\it x} \char'136{} {\it y}&power operator\cr {\it x} .\char'136{} {\it y}&element by element power operator\cr - {\it x}&negation\cr + {\it x}&unary plus (a no-op)\cr {\it x} '&complex conjugate transpose\cr {\it x} .'&transpose\cr ++ {\it x}\quad{\rm(}-- {\it x}{\rm)}&increment (decrement) {\it x}, return {\it new\/} value\cr {\it x} ++\quad{\rm(}{\it x} --{\rm)}&increment (decrement) {\it x}, return {\it old\/} value\cr \endsec \sec Assignment Expressions; {\it var} = {\it expr}&assign expression to variable\cr {\it var} ({\it idx}) = {\it expr}&assign expression to indexed variable\cr \endsec \sec Comparison and Boolean Operators; \omit \vbox{\rm\vskip0.75ex These operators work on an element-by-element basis. Both arguments are always evaluated.\vskip0.75ex}\span\cr {\it x} < {\it y}&true if {\it x\/} is less than {\it y}\cr {\it x} <= {\it y}&true if {\it x\/} is less than or equal to {\it y}\cr {\it x} == {\it y}&true if {\it x\/} is greater than {\it y}\cr {\it x} >= {\it y}&true if {\it x\/} is greater than or equal to {\it y}\cr {\it x} > {\it y}&true if {\it x\/} is equal to {\it y}\cr {\it x} != {\it y}&true if {\it x\/} is not equal to {\it y}\cr {\it x} \& {\it y}&true if both {\it x\/} and {\it y\/} are true\cr {\it x} | {\it y}&true if at least one of {\it x\/} or {\it y\/} is true\cr ! {\it bool}&true {\it bool\/} is false\cr \endsec \sec Short-circuit Boolean Operators; \omit \vbox{\rm\vskip0.75ex Operators evaluate left-to-right, expecting scalar operands. Operands are only evaluated if necessary, stopping once overall truth value can be determined. Operands are converted to scalars by applying the {\tt all} function.\vskip0.75ex}\span\cr {\it x} \&\& {\it y}&true if both {\it x\/} and {\it y\/} are true\cr {\it x} || {\it y}&true if at least one of {\it x\/} or {\it y\/} is true\cr \endsec \sec Operator Precedence; \omit \vbox{\rm\vskip0.5ex Here is a table of the operators in Octave, in order of increasing precedence.\vskip0.75ex}\span\cr ;\ \ ,&statement separators\cr =&assignment, groups left to right\cr ||\ \ \&\&&logical ``or'' and ``and''\cr |\ \ \&&element-wise ``or'' and ``and''\cr < <= == >= > !=&relational operators\cr :&colon\cr +\ \ -&addition and subtraction\cr * / \char'134\ \ .*\ \ ./\ \ .\char'134&multiplication and division\cr '\ \ .'&transpose\cr +\ \ -\ \ ++\ \ --\ \ !&unary minus, increment, logical ``not''\cr \char'136\ \ .\char'136&exponentiation\cr \endsec \vfill\eject \widesec Statements; for {\it identifier} = {\it expr} {\it stmt-list} endfor\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Execute {\it stmt-list} once for each column of {\it expr}. The variable {\it identifier} is set to the value of the current column during each iteration.}\cr\cr while ({\it condition}) {\it stmt-list} endwhile\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Execute {\it stmt-list} while {\it condition} is true.}\cr\cr \hbox{\vtop{\hsize=\itmwid\tt break} \vtop{\hsize=\dfnwid\rm exit innermost loop}}\cr \hbox{\vtop{\hsize=\itmwid\tt continue} \vtop{\hsize=\dfnwid\rm go to beginning of innermost loop}}\cr \hbox{\vtop{\hsize=\itmwid\tt return} \vtop{\hsize=\dfnwid\rm return to calling function}}\cr\cr if ({\it condition}) {\it if-body} \opt{{\tt else} {\it else-body}} endif\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Execute {\it if-body} if {\it condition} is true, otherwise execute {\it else-body}.}\cr if ({\it condition}) {\it if-body} \opt{{\tt elseif} ({\it condition}) {\it elseif-body}} endif\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Execute {\it if-body} if {\it condition} is true, otherwise execute the {\it elseif-body} corresponding to the first {\tt elseif} condition that is true, otherwise execute {\it else-body}.}\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Any number of {\tt elseif} clauses may appear in an {\tt if} statement.}\cr\cr unwind\_protect {\it body} unwind\_protect\_cleanup {\it cleanup} end\cr \hfill\vbox{\hsize=\idnwid\rm\vskip0.25ex Execute {\it body}. Execute {\it cleanup} no matter how control exits {\it body}.}\cr \endsec \widesec Defining Functions; function \opt{{\it ret-list}} {\it function-name} \opt{\hskip0.2em({\it arg-list})\hskip0.2em}\cr \quad{\it function-body}\cr endfunction\cr\cr {\rm {\it ret-list\/} may be a single identifier or a comma-separated list of identifiers delimited by square-brackets.\vskip0.75ex}\cr {\rm {\it arg-list\/} is a comma-separated list of identifiers and may be empty.}\cr \endsec \sec Basic Matrix Manipulations; rows ({\it a})&return number of rows of {\it a}\cr columns ({\it a})&return number of columns of {\it a}\cr all ({\it a})&check if all elements of {\it a\/} nonzero\cr any ({\it a})&check if any elements of {\it a\/} nonzero\cr find ({\it a})&return indices of nonzero elements\cr sort ({\it a})&order elements in each column of {\it a}\cr sum ({\it a})&sum elements in columns of {\it a}\cr prod ({\it a})&product of elements in columns of {\it a}\cr min ({\it args})&find minimum values\cr max ({\it args})&find maximum values\cr rem ({\it x}, {\it y})&find remainder of {\it x}/{\it y}\cr reshape ({\it a}, {\it m}, {\it n})&reformat {\it a} to be {\it m} by {\it n}\cr\cr diag ({\it v}, {\it k})&create diagonal matrices\cr linspace ({\it b}, {\it l}, {\it n})&create vector of linearly-spaced elements\cr logspace ({\it b}, {\it l}, {\it n})&create vector of log-spaced elements\cr eye ({\it n}, {\it m})&create {\it n\/} by {\it m\/} identity matrix\cr ones ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of ones\cr zeros ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of zeros\cr rand ({\it n}, {\it m})&create {\it n\/} by {\it m\/} matrix of random values\cr \endsec \vfill\eject % sin({\it a}) cos({\it a}) tan({\it a})&trigonometric functions\cr % asin({\it a}) acos({\it a}) atan({\it a})&inverse trigonometric functions\cr % sinh({\it a}) cosh({\it a}) tanh({\it a})&hyperbolic trig functions\cr % asinh({\it a}) acosh({\it a}) atanh({\it a})&inverse hyperbolic trig % functions\cr\cr \sec Linear Algebra; chol ({\it a})&Cholesky factorization\cr det ({\it a})&compute the determinant of a matrix\cr eig ({\it a})&eigenvalues and eigenvectors\cr expm ({\it a})&compute the exponential of a matrix\cr hess ({\it a})&compute Hessenberg decomposition\cr inverse ({\it a})&invert a square matrix\cr norm ({\it a}, {\it p})&compute the {\it p}-norm of a matrix\cr pinv ({\it a})&compute pseudoinverse of {\it a}\cr qr ({\it a})&compute the QR factorization of a matrix\cr rank ({\it a})&matrix rank\cr schur ({\it a})&Schur decomposition of a matrix\cr svd ({\it a})&singular value decomposition\cr syl ({\it a}, {\it b}, {\it c})&solve the Sylvester equation\cr \endsec \sec Equations, ODEs, DAEs, Quadrature; *fsolve&solve nonlinear algebraic equations\cr *lsode&integrate nonlinear ODEs\cr *dassl&integrate nonlinear DAEs\cr *quad&integrate nonlinear functions\cr\cr perror ({\it nm}, {\it code})&for functions that return numeric codes, print error message for named function and given error code\cr\cr \omit \vbox{\rm {\tt *} See the on-line or printed manual for the complete list of arguments for these functions.}\span\cr \endsec \sec Signal Processing; fft ({\it a})&Fast Fourier Transform using FFTPACK\cr ifft ({\it a})&inverse FFT using FFTPACK\cr freqz ({\it args})&FIR filter frequency response\cr sinc ({\it x})&returns {\tt sin ($\pi$ x)/($\pi$ x)}\cr \endsec \altsec Image Processing; colormap ({\it map})&set the current colormap\cr gray2ind ({\it i}, {\it n})&convert gray scale to Octave image\cr image ({\it img}, {\it zoom})&display an Octave image matrix\cr imagesc ({\it img}, {\it zoom})&display scaled matrix as image\cr imshow ({\it img}, {\it map})&display Octave image\cr imshow ({\it i}, {\it n})&display gray scale image\cr imshow ({\it r}, {\it g}, {\it b})&display RGB image\cr ind2gray ({\it img}, {\it map})&convert Octave image to gray scale\cr ind2rgb ({\it img}, {\it map})&convert indexed image to RGB\cr loadimage ({\it file})&load an image file\cr rgb2ind ({\it r}, {\it g}, {\it b})&convert RGB to Octave image\cr \omit\tt saveimage ({\it file}, {\it img}, {\it fmt}, {\it map})\quad\rm save a matrix to {\it file}\span\cr \endsec \altsec Sets; create\_set ({\it a}, {\it b})&create row vector of unique values\cr complement ({\it a}, {\it b})&elements of {\it b} not in {\it a}\cr intersection ({\it a}, {\it b})&intersection of sets {\it a} and {\it b}\cr union ({\it a}, {\it b})&union of sets {\it a} and {\it b}\cr \endsec \altsec Strings; strcmp ({\it s}, {\it t})&compare strings\cr strcat ({\it s}, {\it t}, ...)&concatenate strings\cr \endsec \vfill\eject \altsec C-style Input and Output; fopen ({\it name}, {\it mode})&open file {\it name}\cr fclose ({\it file})&close {\it file}\cr printf ({\it fmt}, ...)&formatted output to {\tt stdout}\cr fprintf ({\it file}, {\it fmt}, ...)&formatted output to {\it file}\cr sprintf ({\it fmt}, ...)&formatted output to string\cr scanf ({\it fmt})&formatted input from {\tt stdin}\cr fscanf ({\it file}, {\it fmt})&formatted input from {\it file}\cr sscanf ({\it str}, {\it fmt})&formatted input from {\it string}\cr fgets ({\it file}, {\it len})&read {\it len\/} characters from {\it file\/}\cr fflush ({\it file})&flush pending output to {\it file}\cr ftell ({\it file})&return file pointer position\cr frewind ({\it file})&move file pointer to beginning\cr freport&print a info for open files\cr fread ({\it file}, {\it size}, {\it prec})&read binary data files\cr fwrite ({\it file}, {\it size}, {\it prec})&write binary data files\cr feof ({\it file})&determine if pointer is at EOF\cr \omit \vbox{\rm\vskip0.75ex A file may be referenced either by name or by the number returned from {\tt fopen}. Three files are preconnected when Octave starts: {\tt stdin}, {\tt stdout}, and {\tt stderr}.\vskip0.75ex}\span\cr \endsec \sec Other Input and Output functions; save {\it file} {\it var} ...&save variables in {\it file}\cr load {\it file}&load variables from {\it file}\cr disp ({\it var})&display value of {\it var} to screen\cr \endsec \sec Miscellaneous Functions; eval ({\it str})&evaluate {\it str} as a command\cr feval ({\it str}, ...)&evaluate function named by {\it str}, passing remaining args to called function\cr\cr error ({\it message})&print message and return to top level\cr\cr clear {\it pattern}&clear variables matching pattern\cr exist ({\it str})&check existence of variable or function\cr who&list current variables\cr \endsec \sec Polynomials; compan ({\it p})&companion matrix\cr conv ({\it a}, {\it b})&convolution\cr deconv ({\it a}, {\it b})&deconvolve two vectors\cr poly ({\it a})&create polynomial from a matrix\cr polyderiv ({\it p})&derivative of polynomial\cr polyreduce ({\it p})&integral of polynomial\cr polyval ({\it p}, {\it x})&value of polynomial at {\it x}\cr polyvalm ({\it p}, {\it x})&value of polynomial at {\it x}\cr roots ({\it p})&polynomial roots\cr residue ({\it a}, {\it b})&partial fraction expansion of ratio {\it a}/{\it b}\cr \endsec \sec Statistics; corrcoef ({\it x}, {\it y})&correlation coefficient\cr cov ({\it x}, {\it y})&covariance\cr mean ({\it a})&mean value\cr median ({\it a})&median value\cr std ({\it a})&standard deviation\cr var ({\it a})&variance\cr \endsec \vfill\eject \sec Basic Plotting; \omit \vbox{\tt gplot \opt{{\it ranges}} {\it expr} \opt{{\it using}} \opt{{\it title}} \opt{{\it style}}\hfill{\rm 2D plotting} \par\vskip \lskip}\span\cr \omit \vbox{\tt gsplot \opt{{\it ranges}} {\it expr} \opt{{\it using}} \opt{{\it title}} \opt{{\it style}}\hfill{\rm 3D plotting} \par\vskip \lskip}\span\cr \quad{\it ranges}&specify data ranges\cr \quad{\it expr}&expression to plot\cr \quad{\it using}&specify columns to plot\cr \quad{\it title}&specify line title for legend\cr \quad{\it style}&specify line style\cr \omit \vbox{\rm\vskip0.85ex If {\it ranges\/} are supplied, they must come before the expression to plot. The {\it using\/}, {\it title\/}, and {\it style\/} options may appear in any order after {\it expr\/}. Multiple expressions may be plotted with a single command by separating them with commas.\vskip1ex}\span\cr set {\it options}&set plotting options\cr show {\it options}&show plotting options\cr replot&redisplay current plot\cr closeplot&close stream to {\tt gnuplot} process\cr purge\_tmp\_files&clean up temporary plotting files\cr automatic\_replot&built-in variable\cr \endsec \sec Other Plotting Functions; plot ({\it args})&2D plot with linear axes\cr semilogx ({\it args})&2D plot with logarithmic x-axis\cr semilogy ({\it args})&2D plot with logarithmic y-axis\cr loglog ({\it args})&2D plot with logarithmic axes\cr bar ({\it args})&plot bar charts\cr stairs ({\it x}, {\it y})&plot stairsteps\cr hist ({\it y}, {\it x})&plot histograms\cr\cr title ({\it string})&set plot title\cr\cr axis ({\it limits})&set axis ranges\cr xlabel ({\it string})&set x-axis label\cr ylabel ({\it string})&set y-axis label\cr grid \opt{on$|$off}&set grid state\cr hold \opt{on$|$off}&set hold state\cr ishold&return 1 if hold is on, 0 otherwise\cr\cr mesh ({\it x}, {\it y}, {\it z})&plot 3D surface\cr meshdom ({\it x}, {\it y})&create mesh coordinate matrices\cr \endsec \vskip 0pt plus 2fill \hrule width \hsize \par\vskip10pt {\smrm\parskip=6pt Edition 1.1 for Octave Version 1.1.0. Copyright 1994, 1995, John W. Eaton (jwe@che.utexas.edu). The author assumes no responsibility for any errors on this card. This card may be freely distributed under the terms of the GNU General Public License. \TeX{} Macros for this card by Roland Pesch (pesch@cygnus.com), originally for the GDB reference card Octave itself is free software; you are welcome to distribute copies of it under the terms of the GNU General Public License. There is absolutely no warranty for Octave. } \end % For AUCTeX: % % Local Variables: % mode: tex % TeX-master: t % End: octave-1.1.0/doc/amuse.texi100666 415 17 1462 5705073514 13722 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @cindex amusements @node Amusements, Installation, Programming Utilities, Top @chapter Amusements @findex texas_lotto @cindex lottery numbers @cindex numbers, lottery Octave cannot promise that you will actually win the lotto, but it can pick your numbers for you. The function @code{texas_lotto} will select six numbers between 1 and 50. @findex list_primes @cindex prime numbers @cindex numbers, prime The function @code{list_primes (@var{n})} uses a brute-force algorithm to compute the first @var{n} primes. @findex casesen @findex flops @findex exit @findex quit Other amusing functions include @code{casesen}, @code{flops}, @code{sombrero}, @code{exit}, and @code{quit}. octave-1.1.0/doc/arith.texi100666 415 17 21421 5705306116 13731 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Arithmetic, Linear Algebra, Built-in Variables, Top @chapter Arithmetic Unless otherwise noted, all of the functions described in this chapter will work for real and complex scalar or matrix arguments. @menu * Utility Functions:: * Complex Arithmetic:: * Trigonometry:: * Sums and Products:: * Special Functions:: @end menu @node Utility Functions, Complex Arithmetic, Arithmetic, Arithmetic @section Utility Functions The following functions are available for working with complex numbers. Each expects a single argument, and given a matrix, they work on an element by element basis. @ftable @code @item ceil (@var{x}) Return the smallest integer not less than @var{x}. If @var{x} is complex, return @code{ceil (real (@var{x})) + ceil (imag (@var{x})) * I}. @item floor (@var{x}) Return the largest integer not greater than @var{x}. If @var{x} is complex, return @code{floor (real (@var{x})) + floor (imag (@var{x})) * I}. @item fix (@var{x}) Truncate @var{x} toward zero. If @var{x} is complex, return @code{fix (real (@var{x})) + fix (imag (@var{x})) * I}. @item round (@var{x}) Return the integer nearest to @var{x}. If @var{x} is complex, return @code{round (real (@var{x})) + round (imag (@var{x})) * I}. @item sign (@var{x}) Compute the @dfn{signum} function, which is defined as @iftex @tex $$ {\rm sign} (@var{x}) = \cases{1,&$x>0$;\cr 0,&$x=0$;\cr -1,&$x<0$.\cr} $$ @end tex @end iftex @ifinfo @example -1, x < 0; sign (x) = 0, x = 0; 1, x > 0. @end example @end ifinfo For complex arguments, @code{sign} returns @code{x ./ abs (@var{x})}. @item exp (@var{x}) Compute the exponential of @var{x}. To compute the matrix exponential, see @ref{Linear Algebra}. @item gcd (@var{x}, @code{...}) Compute the greatest common divisor of the elements of @var{x}, or the list of all the arguments. For example, @example gcd (a1, ..., ak) @end example @noindent is the same as @example gcd ([a1, ..., ak]) @end example An optional second return value, @var{v} contains an integer vector such that @example g = v(1) * a(k) + ... + v(k) * a(k) @end example @item lcm (@var{x}, @code{...}) Compute the least common multiple of the elements elements of @var{x}, or the list of all the arguments. For example, @example lcm (a1, ..., ak) @end example @noindent is the same as @example lcm ([a1, ..., ak]). @end example @item log (@var{x}) Compute the natural logarithm of @var{x}. To compute the matrix logarithm, see @ref{Linear Algebra}. @item log2 (@var{x}) Compute the base-2 logarithm of @var{x}. @item log10 (@var{x}) Compute the base-10 logarithm of @var{x}. @item sqrt (@var{x}) Compute the square root of @var{x}. To compute the matrix square root, see @ref{Linear Algebra}. @item max (@var{x}) For a vector argument, return the maximum value. For a matrix argument, return the maximum value from each column, as a row vector. Thus, @example max (max (@var{x})) @end example @noindent returns the largest element of @var{x}. For complex arguments, the magnitude of the elements are used for comparison. @item min (@var{x}) Like @code{max}, but return the minimum value. @item rem (@var{x}, @var{y}) Return the remainder of @code{@var{x} / @var{y}}, computed using the expression @example x - y .* fix (x ./ y) @end example An error message is printed if the dimensions of the arguments do not agree, or if either of the arguments is complex. @end ftable @node Complex Arithmetic, Trigonometry, Utility Functions, Arithmetic @section Complex Arithmetic The following functions are available for working with complex numbers. Each expects a single argument. Given a matrix they work on an element by element basis. @ftable @code @item abs (@var{x}) Compute the magnitude of @var{x}. @item angle (@var{x}) @itemx arg (@var{x}) Compute the argument of @var{x}. @item conj (@var{x}) Return the complex conjugate of @var{x}. @item imag (@var{x}) Return the imaginary part of @var{x}. @item real (@var{x}) Return the real part of @var{x}. @end ftable @node Trigonometry, Sums and Products, Complex Arithmetic, Arithmetic @section Trigonometry Octave provides the following trigonometric functions: @example sin asin sinh asinh cos acos cosh acosh tan atan tanh atanh sec asec sech asech csc acsc csch acsch cot acot coth acoth @end example @findex sin @findex cos @findex tan @findex asin @findex acos @findex atan @findex sinh @findex cosh @findex tanh @findex asinh @findex acosh @findex atanh @findex sec @findex csc @findex cot @findex asec @findex acsc @findex acot @findex sech @findex csch @findex coth @findex asech @findex acsch @findex acoth @noindent Each of these functions expect a single argument. For matrix arguments, they work on an element by element basis. For example, the expression @example sin ([1, 2; 3, 4]) @end example @noindent produces @example ans = 0.84147 0.90930 0.14112 -0.75680 @end example @code{atan2 (@var{y}, @var{x})} @findex atan2 @node Sums and Products, Special Functions, Trigonometry, Arithmetic @section Sums and Products @ftable @code @item sum (@var{x}) For a vector argument, return the sum of all the elements. For a matrix argument, return the sum of the elements in each column, as a row vector. The sum of an empty matrix is 0 if it has no columns, or a vector of zeros if it has no rows (@pxref{Empty Matrices}). @item prod (@var{x}) For a vector argument, return the product of all the elements. For a matrix argument, return the product of the elements in each column, as a row vector. The product of an empty matrix is 1 if it has no columns, or a vector of ones if it has no rows (@pxref{Empty Matrices}). @item cumsum (@var{x}) Return the cumulative sum of each column of @var{x}. For example, @example cumsum ([1, 2; 3, 4]) @end example @noindent produces @example ans = 1 2 4 6 @end example @item cumprod (@var{x}) Return the cumulative product of each column of @var{x}. For example, @example cumprod ([1, 2; 3, 4]) @end example @noindent produces @example ans = 1 2 3 8 @end example @item sumsq (@var{x}) For a vector argument, return the sum of the squares of all the elements. For a matrix argument, return the sum of the squares of the elements in each column, as a row vector. @end ftable @node Special Functions, , Sums and Products, Arithmetic @section Special Functions @ftable @code @item beta Returns the beta function, @iftex @tex $$ \beta (a, b) = {\Gamma (a) \Gamma (b) \over \Gamma (a + b)}. $$ @end tex @end iftex @ifinfo @example beta (a, b) = gamma (a) * gamma (b) / gamma (a + b). @end example @end ifinfo @item betai (@var{a}, @var{b}, @var{x}) Returns the incomplete beta function, @iftex @tex $$ \beta (a, b, x) = \beta (a, b)^{-1} \int_0^x t^{(a-z)} (1-t)^{(b-1)} dt. $$ @end tex @end iftex @ifinfo @smallexample x / betai (a, b, x) = beta (a, b)^(-1) | t^(a-1) (1-t)^(b-1) dt. / t=0 @end smallexample @end ifinfo If x has more than one component, both @var{a} and @var{b} must be scalars. If @var{x} is a scalar, @var{a} and @var{b} must be of compatible dimensions. @item erf Computes the error function, @iftex @tex $$ {\rm erf} (z) = {2 \over \sqrt{\pi}}\int_0^z e^{-t^2} dt $$ @end tex @end iftex @ifinfo @smallexample z / erf (z) = (2/sqrt (pi)) | e^(-t^2) dt / t=0 @end smallexample @end ifinfo @item erfc (@var{z}) Computes the complementary error function, @code{1 - erf (@var{z})}. @item erfinv Computes the inverse of the error function. @item gamma (@var{z}) Computes the gamma function, @iftex @tex $$ \Gamma (z) = \int_0^\infty t^{z-1} e^{-t} dt. $$ @end tex @end iftex @ifinfo @example infinity / gamma (z) = | t^(z-1) exp (-t) dt. / t=0 @end example @end ifinfo @item gammai (@var{a}, @var{x}) Computes the incomplete gamma function, @iftex @tex $$ \Gamma (a, x) = {\int_0^x e^{-t} t^{a-1} dt \over \Gamma (a)} $$ @end tex @end iftex @ifinfo @smallexample x 1 / gammai (a, x) = --------- | exp (-t) t^(a-1) dt gamma (a) / t=0 @end smallexample @end ifinfo If @var{a} is scalar, then @code{gammai (@var{a}, @var{x})} is returned for each element of @var{x} and vice versa. If neither @var{a} nor @var{x} is scalar, the sizes of @var{a} and @var{x} must agree, and @var{gammai} is applied element-by-element. @item lgamma Returns the natural logarithm of the gamma function. @end ftable octave-1.1.0/doc/bugs.texi100666 415 17 41017 5705274100 13562 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @c The text of this file will eventually appear in the file BUGS @c in the Octave distribution, as well as in the Octave manual. @ifclear BUGSONLY @node Trouble, Command Line Editing, Installation, Top @appendix Known Causes of Trouble with Octave @end ifclear @cindex bugs, known @cindex installation trouble @cindex known causes of trouble @cindex troubleshooting This section describes known problems that affect users of Octave. Most of these are not Octave bugs per se---if they were, we would fix them. But the result for a user may be like the result of a bug. Some of these problems are due to bugs in other software, some are missing features that are too much work to add, and some are places where people's opinions differ as to what is best. @menu * Actual Bugs:: Bugs we will fix later. * Reporting Bugs:: * Bug Criteria:: * Bug Lists:: * Bug Reporting:: * Sending Patches:: * Service:: @end menu @node Actual Bugs, Reporting Bugs, Trouble, Trouble @appendixsec Actual Bugs We Haven't Fixed Yet @itemize @bullet @item Output that comes directly from Fortran functions is not sent through the pager and may appear out of sequence with other output that is sent through the pager. One way to avoid this is to force pending output to be flushed before calling a function that will produce output from within Fortran functions. To do this, use the command @example fflush (stdout) @end example Another possible workaround is to use the command @example page_screen_output = "false" @end example @noindent to turn the pager off. @item Control-C doesn't work properly in the pager on DEC Alpha systems running OSF/1 3.0. This appears to be a bug in the OSF/1 3.0 Bourne shell. The problem doesn't appear on systems running OSF/1 1.3. @item If you get messages like @example Input line too long @end example when trying to plot many lines on one graph, you have probably generated a plot command that is too larger for @code{gnuplot}'s fixed-length buffer for commands. Splitting up the plot command doesn't help because replot is implemented in gnuplot by simply appending the new plotting commands to the old command line and then evaluating it again. You can demonstrate this `feature' by running gnuplot and doing something like @example plot sin (x), sin (x), sin (x), ... lots more ..., sin (x) @end example @noindent and then @example replot sin (x), sin (x), sin (x), ... lots more ..., sin (x) @end example @noindent after repeating the replot command a few times, gnuplot will give you an error. Also, it doesn't help to use backslashes to enter a plot command over several lines, because the limit is on the overall command line length, once the backslashed lines are all pasted together. Because of this, Octave tries to use as little of the command-line length as possible by using the shortest possible abbreviations for all the plot commands and options. Unfortunately, the length of the temporary file names is probably what is taking up the most space on the command line. You can buy a little bit of command line space by setting the environment variable @code{TMPDIR} to be "." before starting Octave, or you can increase the maximum command line length in gnuplot by changing the following limits in the file plot.h in the gnuplot distribution and recompiling gnuplot. @example #define MAX_LINE_LEN 32768 /* originally 1024 */ #define MAX_TOKENS 8192 /* originally 400 */ @end example Of course, this doesn't really fix the problem, but it does make it much less likely that you will run into trouble unless you are putting a very large number of lines on a given plot. @item String handling could use some work. @end itemize A list of ideas for future enhancements is distributed with Octave. See the file @file{PROJECTS} in the top level directory in the source distribution. @node Reporting Bugs, Bug Criteria, Actual Bugs, Trouble @appendixsec Reporting Bugs @cindex bugs @cindex reporting bugs Your bug reports play an essential role in making Octave reliable. When you encounter a problem, the first thing to do is to see if it is already known. @xref{Trouble}. If it isn't known, then you should report the problem. Reporting a bug may help you by bringing a solution to your problem, or it may not. In any case, the principal function of a bug report is to help the entire community by making the next version of Octave work better. Bug reports are your contribution to the maintenance of Octave. In order for a bug report to serve its purpose, you must include the information that makes it possible to fix the bug. @findex bug_report If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function @code{bug_report}. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. @menu * Bug Criteria:: * Where: Bug Lists. Where to send your bug report. * Reporting: Bug Reporting. How to report a bug effectively. * Patches: Sending Patches. How to send a patch for Octave. @end menu @node Bug Criteria, Bug Lists, Reporting Bugs, Trouble @appendixsec Have You Found a Bug? @cindex bug criteria If you are not sure whether you have found a bug, here are some guidelines: @itemize @bullet @cindex fatal signal @cindex core dump @item If Octave gets a fatal signal, for any input whatever, that is a bug. Reliable interpreters never crash. @cindex incorrect output @cindex incorrect results @cindex results, incorrect @cindex answers, incorrect @cindex erroneous results @cindex wrong answers @item If Octave produces incorrect results, for any input whatever, that is a bug. @cindex undefined behavior @cindex undefined function value @item Some output may appear to be incorrect when it is in fact due to a program whose behavior is undefined, which happened by chance to give the desired results on another system. For example, the range operator may produce different results because of differences in the way floating point arithmetic is handled on various systems. @cindex erroneous messages @cindex incorrect error messages @cindex error messages, incorrect @item If Octave produces an error message for valid input, that is a bug. @cindex invalid input @item If Octave does not produce an error message for invalid input, that is a bug. However, you should note that your idea of ``invalid input'' might be my idea of ``an extension'' or ``support for traditional practice''. @cindex improving Octave @cindex suggestions @item If you are an experienced user of programs like Octave, your suggestions for improvement are welcome in any case. @end itemize @node Bug Lists, Bug Reporting, Bug Criteria, Trouble @appendixsec Where to Report Bugs @cindex bug report mailing lists @cindex reporting bugs @cindex bugs, reporting @findex bug_report If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function @code{bug_report}. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. If for some reason you cannot use Octave's @code{bug_report} function, send bug reports for Octave to: @example bug-octave@@che.utexas.edu @end example @strong{Do not send bug reports to @samp{help-octave}}. Most users of Octave do not want to receive bug reports. Those that do have asked to be on @samp{bug-octave}. As a last resort, send bug reports on paper to: @example Octave Bugs c/o John W. Eaton Department of Chemical Engineering The University of Texas at Austin Austin, Texas 78712 @end example @node Bug Reporting, Sending Patches, Bug Lists, Trouble @appendixsec How to Report Bugs @cindex bugs, reporting The fundamental principle of reporting bugs usefully is this: @strong{report all the facts}. If you are not sure whether to state a fact or leave it out, state it! Often people omit facts because they think they know what causes the problem and they conclude that some details don't matter. Thus, you might assume that the name of the variable you use in an example does not matter. Well, probably it doesn't, but one cannot be sure. Perhaps the bug is a stray memory reference which happens to fetch from the location where that name is stored in memory; perhaps, if the name were different, the contents of that location would fool the interpreter into doing the right thing despite the bug. Play it safe and give a specific, complete example. Keep in mind that the purpose of a bug report is to enable someone to fix the bug if it is not known. Always write your bug reports on the assumption that the bug is not known. Sometimes people give a few sketchy facts and ask, ``Does this ring a bell?'' This cannot help us fix a bug. It is better to send a complete bug report to begin with. Try to make your bug report self-contained. If we have to ask you for more information, it is best if you include all the previous information in your response, as well as the information that was missing. To enable someone to investigate the bug, you should include all these things: @itemize @bullet @item The version of Octave. You can get this by noting the version number that is printed when Octave starts, or running it with the @samp{-v} option. @item A complete input file that will reproduce the bug. A single statement may not be enough of an example---the bug might depend on other details that are missing from the single statement where the error finally occurs. @item The command arguments you gave Octave to execute that example and observe the bug. To guarantee you won't omit something important, list all the options. If we were to try to guess the arguments, we would probably guess wrong and then we would not encounter the bug. @item The type of machine you are using, and the operating system name and version number. @item The command-line arguments you gave to the @code{configure} command when you installed the interpreter. @item A complete list of any modifications you have made to the interpreter source. Be precise about these changes---show a context diff for them. @item Details of any other deviations from the standard procedure for installing Octave. @cindex incorrect output @cindex incorrect results @cindex results, incorrect @cindex answers, incorrect @cindex erroneous results @cindex wrong answers @item A description of what behavior you observe that you believe is incorrect. For example, "The interpreter gets a fatal signal," or, "The output produced at line 208 is incorrect." Of course, if the bug is that the interpreter gets a fatal signal, then one can't miss it. But if the bug is incorrect output, we might not notice unless it is glaringly wrong. Even if the problem you experience is a fatal signal, you should still say so explicitly. Suppose something strange is going on, such as, your copy of the interpreter is out of synch, or you have encountered a bug in the C library on your system. Your copy might crash and the copy here would not. If you said to expect a crash, then when the interpreter here fails to crash, we would know that the bug was not happening. If you don't say to expect a crash, then we would not know whether the bug was happening. We would not be able to draw any conclusion from our observations. Often the observed symptom is incorrect output when your program is run. Unfortunately, this is not enough information unless the program is short and simple. It is very helpful if you can include an explanation of the expected output, and why the actual output is incorrect. @item If you wish to suggest changes to the Octave source, send them as context diffs. If you even discuss something in the Octave source, refer to it by context, not by line number, because the line numbers in the development sources probalby won't match those in your sources. @end itemize Here are some things that are not necessary: @itemize @bullet @cindex bugs, investigating @item A description of the envelope of the bug. Often people who encounter a bug spend a lot of time investigating which changes to the input file will make the bug go away and which changes will not affect it. Such information is usually not necessary to enable us to fix bugs in Octave, but if you can find a simpler example to report @emph{instead} of the original one, that is a convenience. Errors in the output will be easier to spot, running under the debugger will take less time, etc. Most Octave bugs involve just one function, so the most straightforward way to simplify an example is to delete all the function definitions except the one in which the bug occurs. However, simplification is not vital; if you don't want to do this, report the bug anyway and send the entire test case you used. @item A patch for the bug. Patches can be helpful, but if you find a bug, you should report it, even if you cannot send a fix for the problem. @end itemize @node Sending Patches, Service, Bug Reporting, Trouble @appendixsec Sending Patches for Octave @cindex improving Octave @cindex diffs, submitting @cindex patches, submitting @cindex submitting diffs @cindex submitting patches If you would like to write bug fixes or improvements for Octave, that is very helpful. When you send your changes, please follow these guidelines to avoid causing extra work for us in studying the patches. If you don't follow these guidelines, your information might still be useful, but using it will take extra work. Maintaining Octave is a lot of work in the best of circumstances, and we can't keep up unless you do your best to help. @itemize @bullet @item Send an explanation with your changes of what problem they fix or what improvement they bring about. For a bug fix, just include a copy of the bug report, and explain why the change fixes the bug. @item Always include a proper bug report for the problem you think you have fixed. We need to convince ourselves that the change is right before installing it. Even if it is right, we might have trouble judging it if we don't have a way to reproduce the problem. @item Include all the comments that are appropriate to help people reading the source in the future understand why this change was needed. @item Don't mix together changes made for different reasons. Send them @emph{individually}. If you make two changes for separate reasons, then we might not want to install them both. We might want to install just one. @item Use @samp{diff -c} to make your diffs. Diffs without context are hard for us to install reliably. More than that, they make it hard for us to study the diffs to decide whether we want to install them. Unidiff format is better than contextless diffs, but not as easy to read as @samp{-c} format. If you have GNU diff, use @samp{diff -cp}, which shows the name of the function that each change occurs in. @item Write the change log entries for your changes. Read the @file{ChangeLog} file to see what sorts of information to put in, and to learn the style that we use. The purpose of the change log is to show people where to find what was changed. So you need to be specific about what functions you changed; in large functions, it's often helpful to indicate where within the function the change was made. On the other hand, once you have shown people where to find the change, you need not explain its purpose. Thus, if you add a new function, all you need to say about it is that it is new. If you feel that the purpose needs explaining, it probably does---but the explanation will be much more useful if you put it in comments in the code. If you would like your name to appear in the header line for who made the change, send us the header line. @end itemize @node Service, , Sending Patches, Trouble @appendixsec How To Get Help with Octave @cindex help, where to find If you need help installing, using or changing Octave, the mailing list @example help-octave@@che.utexas.edu @end example exists for the discussion of Octave matters related to using, installing, and porting Octave. If you would like to join the discussion, please send a short note to @example help-octave-request@@che.utexas.edu ^^^^^^^ @end example @strong{Please do not} send requests to be added or removed from the the mailing list, or other administrative trivia to the list itself. octave-1.1.0/doc/bugs1.texi100666 415 17 1214 5702421147 13620 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @setfilename BUGS @set BUGSONLY @include conf.texi @c The immediately following lines apply to the BUGS file @c which is generated using this file. This file documents known bugs in Octave and describes where and how to report any bugs that you may find. Copyright (C) 1993, 1994, 1995 John W. Eaton. You may copy, distribute, and modify it freely as long as you preserve this copyright notice and permission notice. @node Trouble,,, (dir) @chapter Known Causes of Trouble with Octave @include bugs.texi @bye octave-1.1.0/doc/control.texi100666 415 17 22606 5705272406 14314 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Control Theory, Signal Processing, Quadrature, Top @chapter Control Theory @ftable @code @item abcddim (@var{a}, @var{b}, @var{c}, @var{d}) Check for compatibility of the dimensions of the matrices defining the linear system [A, B, C, D] corresponding to @iftex @tex $$ {dx\over dt} = A x + B u $$ $$ y = C x + D u $$ @end tex @end iftex @ifinfo @example dx/dt = a x + b u y = c x + d u @end example @end ifinfo or a similar discrete-time system. If the matrices are compatibly dimensioned, then @code{abcddim} returns @var{n} = number of system states, @var{m} = number of system inputs, and @var{p} = number of system outputs. Otherwise @code{abcddim} returns @var{n} = @var{m} = @var{p} = @minus{}1. @item are (@var{a}, @var{b}, @var{c}, @var{opt}) Returns the solution, @var{x}, of the algebraic Riccati equation @example a' x + x a - x b x + c = 0 @end example @noindent for identically dimensioned square matrices @var{a}, @var{b}, @var{c}. If @var{b} (@var{c}) is not square, then the function attempts to use @code{@var{b}*@var{b}'} (@code{@var{c}'*@var{c}}) instead. Solution method: apply Laub's Schur method (IEEE Transactions on Automatic Control, 1979) to the appropriate Hamiltonian matrix. @var{opt} is an option passed to the eigenvalue balancing routine. Default is @code{"B"}. @item c2d (@var{a}, @var{b}, @var{t}) Converts the continuous time system described by: @iftex @tex $$ {dx\over dt} = A x + B u $$ @end tex @end iftex @ifinfo @example dx/dt = a x + b u @end example @end ifinfo into a discrete time equivalent model @iftex @tex $$ x_{k+1} = A_d x_k + B_d u_k $$ @end tex @end iftex @ifinfo @example x[k+1] = Ad x[k] + Bd u[k] @end example @end ifinfo @noindent via the matrix exponential assuming a zero-order hold on the input and sample time @var{t}. @item dare (@var{a}, @var{b}, @var{c}, @var{r}, @var{opt}) Returns the solution, @var{x} of the discrete-time algebraic Riccati equation @example a' x a - x + a' x b (r + b' x b)^(-1) b' x a + c = 0 @end example @noindent for matrices with dimensions: @example @var{a}: @var{n} by @var{n} @var{b}: @var{n} by @var{m} @var{c}: @var{n} by @var{n}, symmetric positive semidefinite @var{r}: @var{m} by @var{m}, symmetric positive definite (invertible) @end example If @var{c} is not square, then the function attempts to use @code{@var{c}'*@var{c}} instead. Solution method: Laub's Schur method (IEEE Transactions on Automatic Control, 1979) is applied to the appropriate symplectic matrix. See also: Ran and Rodman, @cite{Stable Hermitian Solutions of Discrete Algebraic Riccati Equations}, Mathematics of Control, Signals and Systems, Volume 5, Number 2 (1992). @var{opt} is an option passed to the eigenvalue balancing routine. The default is @code{"B"}. @item dgram (@var{a}, @var{b}) Returns the discrete controllability and observability gramian for the discrete time system described by @iftex @tex $$ x_{k+1} = A x_k + B u_k $$ $$ y_k = C x_k + D u_k $$ @end tex @end iftex @ifinfo @example x[k+1] = A x[k] + B u[k] y[k] = C x[k] + D u[k] @end example @end ifinfo @code{dgram (@var{a}, @var{b})} returns the discrete controllability gramian and @code{dgram (@var{a}', @var{c}')} returns the observability gramian. @item dlqe (@var{a}, @var{g}, @var{c}, @var{sigw}, @var{sigv} [, @var{z}]) Linear quadratic estimator (Kalman filter) design for the discrete time system @iftex @tex $$ x_{k+1} = A x_k + B u_k + G w_k $$ $$ y_k = C x_k + D u_k + w_k $$ @end tex @end iftex @ifinfo @example x[k+1] = A x[k] + B u[k] + G w[k] y[k] = C x[k] + D u[k] + w[k] @end example @end ifinfo where @var{w}, @var{v} are zero-mean gaussian noise processes with respective intensities @code{@var{sigw} = cov (@var{w}, @var{w})} and @code{@var{sigv} = cov (@var{v}, @var{v})}. If specified, @var{z} is @code{cov (@var{w}, @var{v})}. Otherwise @code{cov (@var{w}, @var{v}) = 0}. The observer structure is @iftex @tex $$ z_{k+1} = A z_k + B u_k + k(y_k - C z_k - D u_k) $$ @end tex @end iftex @ifinfo @example z[k+1] = A z[k] + B u[k] + k(y[k] - C z[k] - D u[k]) @end example @end ifinfo @noindent Returns: @var{l} is the observer gain, @code{(A - A L C)} is stable. @var{m} is the Ricatti equation solution. @var{p} is the estimate error covariance after the measurement update. @var{e} are the closed loop poles of @code{(A - A L C)}. @item dlqr (@var{a}, @var{b}, @var{q}, @var{r} [, @var{z}]) Linear quadratic regulator design for the discrete time system @iftex @tex $$ x_{k+1} = A x_k + B u_k $$ @end tex @end iftex @ifinfo @example x[k+1] = A x[k] + B u[k] @end example @end ifinfo to minimize the cost functional @example J = Sum [ x' Q x + u' R u ], Z omitted @end example @noindent or @example J = Sum [ x' Q x + u' R u +2 x' Z u ], Z included @end example @noindent Returns: @var{k} is the state feedback gain, @code{(A - B K)} is stable. @var{p} is the solution of algebraic Riccati equation. @var{e} are the closed loop poles of @var{(A - B K)}. @item dlyap (@var{a}, @var{b}) Solve the discrete-time Lyapunov equation @example a x a' - x + b = 0 @end example @noindent for square matrices @var{a}, @var{b}. If @var{b} is not square, then the function attempts to solve either @example a x a' - x + b b' = 0 @end example @noindent or @example a' x a - x + b' b = 0 @end example @noindent whichever is appropriate. Uses Schur decomposition method as in Kitagawa, International Journal of Control (1977); column-by-column solution method as suggested in Hammarling, IMA Journal of Numerical Analysis, (1982). @item is_controllable (@var{a}, @var{b}, @var{tol}) If the pair (a, b) is controllable, then return value 1. Otherwise, returns a value of 0. @var{tol} is a roundoff parameter, set to @code{2*eps} if omitted. Currently just constructs the controllability matrix and checks rank. A better method is as follows (Boley and Golub, Systems and Control Letters, 1984): Controllability is determined by applying Arnoldi iteration with complete re-orthogonalization to obtain an orthogonal basis of the Krylov subspace @iftex @tex $$ {\rm span} \left(\left[b~ab~\ldots~a^{n-1}b\right]\right) $$ @end tex @end iftex @ifinfo @example n-1 span ([b, a*b, ..., a^ *b]). @end example @end ifinfo @item is_observable (@var{a}, @var{c}, @var{tol}) Returns 1 if the pair @code{(a, c)} is observable. Otherwise, returns a value of 0. @item lqe (@var{a}, @var{g}, @var{c}, @var{sigw}, @var{sigv}, @var{z}) @example [k, p, e] = lqe (a, g, c, sigw, sigv, z) @end example Linear quadratic estimator (Kalman filter) design for the continuous time system @iftex @tex $$ {dx\over dt} = A x + B u $$ $$ y = C x + D u $$ @end tex @end iftex @ifinfo @example dx -- = a x + b u dt y = c x + d u @end example @end ifinfo where @var{w}, @var{v} are zero-mean gaussian noise processes with respective intensities @example sigw = cov (w, w) sigv = cov (v, v) @end example @noindent @var{z} (if specified) is the cross-covariance @code{cov (@var{w}, @var{v})}; the default value is @code{cov (@var{w}, @var{v}) = 0}. Observer structure is @code{dz/dt = A z + B u + k (y - C z - D u)} returns: @var{k} is observer gain: @code{(A - K C)} is stable. @var{p} is solution of algebraic Riccati equation. @var{e} is the vector of closed loop poles of @code{(A - K C)}. @item lqr (@var{a}, @var{b}, @var{q}, @var{r}, @var{z}) @itemx [@var{k}, @var{p}, @var{e}] = lqr (@var{a}, @var{b}, @var{q}, @var{r}, @var{z}) Linear quadratic regulator design for the continuous time system @iftex @tex $$ {dx\over dt} = A x + B u $$ @end tex @end iftex @ifinfo @example dx -- = A x + B u dt @end example @end ifinfo to minimize the cost functional @iftex @tex $$ J = \int_0^\infty x' Q x + u' R u $$ @end tex @end iftex @ifinfo @example infinity / J = | x' Q x + u' R u / t=0 @end example @end ifinfo @noindent @var{z} omitted or @iftex @tex $$ J = \int_0^\infty x' Q x + u' R u + 2 x' Z u $$ @end tex @end iftex @ifinfo @example infinity / J = | x' Q x + u' R u + 2 x' Z u / t=0 @end example @end ifinfo @var{z} included @noindent Returns: @var{k} is state feedback gain: @code{(A - B K)} is stable. @var{p} is the stabilizing solution of appropriate algebraic Riccati equation. @var{e} is the vector of the closed loop poles of @code{(A - B K)}. @item lyap (@var{a}, @var{b}, @var{c}) Solve the Lyapunov (or Sylvester) equation via the Bartels-Stewart algorithm (Communications of the ACM, 1972). If @code{(a, b, c)} are specified, then @code{lyap} returns the solution of the Sylvester equation @example a x + x b + c = 0 @end example If only @code{(a, b)} are specified, then @code{lyap} returns the solution of the Lyapunov equation @example a' x + x a + b = 0 @end example If @var{b} is not square, then @code{lyap} returns the solution of either @example a' x + x a + b' b = 0 @end example @noindent or @example a x + x a' + b b' = 0 @end example @noindent whichever is appropriate. Solves by using the Bartels-Stewart algorithm (1972). @item tzero (@var{a}, @var{b}, @var{c}, @var{d}, @var{bal}) Compute the transmission zeros of [A, B, C, D]. @var{bal} = balancing option (see balance); default is @code{"B"}. Needs to incorporate @code{mvzero} algorithm to isolate finite zeros; see Hodel, @cite{Computation of System Zeros with Balancing}, Linear Algebra and its Applications, July 1993. @end ftable octave-1.1.0/doc/cp-idx.texi100666 415 17 350 5705073512 13745 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Concept Index, Variable Index, Using Info, Top @unnumbered Concept Index @printindex cp octave-1.1.0/doc/diffeq.texi100666 415 17 11160 5705073523 14062 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Differential Equations, Optimization, Nonlinear Equations, Top @chapter Differential Equations Octave has two built-in functions for solving differential equations. Both are based on reliable ODE solvers written in Fortran. @menu * Ordinary Differential Equations:: * Differential-Algebraic Equations:: @end menu @cindex Differential Equations @cindex ODE @cindex DAE @node Ordinary Differential Equations, Differential-Algebraic Equations, Differential Equations, Differential Equations @section Ordinary Differential Equations @findex lsode The function @code{lsode} can be used Solve ODEs of the form @iftex @tex $$ {dx\over dt} = f (x, t) $$ @end tex @end iftex @ifinfo @example dx -- = f (x, t) dt @end example @end ifinfo @noindent using Hindmarsh's ODE solver LSODE. @example lsode (@var{fcn}, @var{x0}, @var{t_out}, @var{t_crit}) @end example The first argument is the name of the function to call to compute the vector of right hand sides. It must have the form @example @var{xdot} = f (@var{x}, @var{t}) @end example @noindent where @var{xdot} and @var{x} are vectors and @var{t} is a scalar. The second argument specifies the initial condition, and the third specifies a vector of output times at which the solution is desired, including the time corresponding to the initial condition. The fourth argument is optional, and may be used to specify a set of times that the ODE solver should not integrate past. It is useful for avoiding difficulties with singularities and points where there is a discontinuity in the derivative. @findex lsode_options Tolerances and other options for @code{lsode} may be specified using the function @code{lsode_options}. Here is an example of solving a set of two differential equations using @code{lsode}. The function @example function xdot = f (x, t) r = 0.25; k = 1.4; a = 1.5; b = 0.16; c = 0.9; d = 0.8; xdot(1) = r*x(1)*(1 - x(1)/k) - a*x(1)*x(2)/(1 + b*x(1)); xdot(2) = c*a*x(1)*x(2)/(1 + b*x(1)) - d*x(2); endfunction @end example @noindent is integrated with the command @example x = lsode ("f", [1; 2], (t = linspace (0, 50, 200)')); @end example @noindent producing a set of 200 values stored in the variable @var{x}. Note that this example takes advantage of the fact that an assignment produces a value to store the values of the output times in the variable @var{t} directly in the function call The results can then be plotted using the command @example plot (t, x) @end example See Alan C. Hindmarsh, @cite{ODEPACK, A Systematized Collection of ODE Solvers}, in Scientific Computing, R. S. Stepleman, editor, (1983) for more information about this family of ODE solvers. @node Differential-Algebraic Equations, , Ordinary Differential Equations, Differential Equations @section Differential-Algebraic Equations @findex dassl The function @code{dassl} can be used Solve DAEs of the form @iftex @tex $$ 0 = f (\dot{x}, x, t), \qquad x(t=0) = x_0, \dot{x}(t=0) = \dot{x}_0 $$ @end tex @end iftex @ifinfo @example 0 = f (x-dot, x, t), x(t=0) = x_0, x-dot(t=0) = x-dot_0 @end example @end ifinfo @example dassl (@var{fcn}, @var{x_0}, @var{xdot_0}, @var{t_out}, @var{t_crit}) @end example The first argument is the name of the function to call to compute the vector of residuals. It must have the form @example @var{res} = f (@var{x}, @var{xdot}, @var{t}) @end example @noindent where @var{x}, @var{xdot}, and @var{res} are vectors, and @var{t} is a scalar. The second and third arguments to @code{dassl} specify the initial condition of the states and their derivatives, and the fourth argument specifies a vector of output times at which the solution is desired, including the time corresponding to the initial condition. The set of initial states and derivatives are not strictly required to be consistent. In practice, however, DASSL is not very good at determining a consistent set for you, so it is best if you ensure that the initial values result in the function evaluating to zero. The fifth argument is optional, and may be used to specify a set of times that the DAE solver should not integrate past. It is useful for avoiding difficulties with singularities and points where there is a discontinuity in the derivative. @findex dassl_options Tolerances and other options for @code{dassl} may be specified using the function @code{dassl_options}. See K. E. Brenan, et al., @cite{Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations}, North-Holland (1989) for more information about the implementation of DASSL. octave-1.1.0/doc/expr.texi100666 415 17 135210 5705303343 13621 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Expressions, Statements, Invoking Octave, Top @chapter Expressions @cindex expressions Expressions are the basic building block of statements in Octave. An expression evaluates to a value, which you can print, test, store in a variable, pass to a function, or assign a new value to a variable with an assignment operator. An expression can serve as a statement on its own. Most other kinds of statements contain one or more expressions which specify data to be operated on. As in other languages, expressions in Octave include variables, array references, constants, and function calls, as well as combinations of these with various operators. @menu * Constant Expressions:: * Matrices:: * Ranges:: * Variables:: * Index Expressions:: * Data Structures:: * Calling Functions:: * Global Variables:: * Keywords:: * Arithmetic Ops:: * Comparison Ops:: * Boolean Expressions:: * Assignment Ops:: * Increment Ops:: * Operator Precedence:: @end menu @node Constant Expressions, Matrices, Expressions, Expressions @section Constant Expressions The simplest type of expression is the @dfn{constant}, which always has the same value. There are two types of constants: numeric constants and string constants. @menu * Numeric Constants:: * String Constants:: @end menu @node Numeric Constants, String Constants, Constant Expressions, Constant Expressions @subsection Numeric Constants @cindex numeric constant @cindex numeric value A @dfn{numeric constant} may be a scalar, a vector, or a matrix, and it may contain complex values. The simplest form of a numeric constant, a scalar, is a single number that can be an integer, a decimal fraction, a number in scientific (exponential) notation, or a complex number. Note that all numeric values are represented within Octave in double-precision floating point format (complex constants are stored as pairs of double-precision floating point values). Here are some examples of real-valued numeric constants, which all have the same value: @example 105 1.05e+2 1050e-1 @end example To specify complex constants, you can write an expression of the form @example 3 + 4i 3.0 + 4.0i 0.3e1 + 40e-1i @end example all of which are equivalent. The letter @samp{i} in the previous example stands for the pure imaginary constant, defined as @iftex @tex $\sqrt{-1}$. @end tex @end iftex @ifinfo @code{sqrt (-1)}. @end ifinfo For Octave to recognize a value as the imaginary part of a complex constant, a space must not appear between the number and the @samp{i}. If it does, Octave will print an error message, like this: @example octave:13> 3 + 4 i parse error: 3 + 4 i ^ @end example You may also use @samp{j}, @samp{I}, or @samp{J} in place of the @samp{i} above. All four forms are equivalent. @node String Constants, , Numeric Constants, Constant Expressions @subsection String Constants @cindex strings @cindex character strings @opindex " @opindex ' A @dfn{string constant} consists of a sequence of characters enclosed in either double-quote or single-quote marks. For example, both of the following expressions @example "parrot" 'parrot' @end example @noindent represent the string whose contents are @samp{parrot}. Strings in Octave can be of any length. Since the single-quote mark is also used for the transpose operator (@pxref{Arithmetic Ops}) but double-quote marks have no other purpose in Octave, it is best to use double-quote marks to denote strings. @c XXX FIXME XXX -- this is probably pretty confusing. @cindex escape sequence notation Some characters cannot be included literally in a string constant. You represent them instead with @dfn{escape sequences}, which are character sequences beginning with a backslash (@samp{\}). One use of an escape sequence is to include a double-quote (single-quote) character in a string constant that has been defined using double-quote (single-quote) marks. Since a plain double-quote would end the string, you must use @samp{\"} to represent a single double-quote character as a part of the string. The backslash character itself is another character that cannot be included normally. You must write @samp{\\} to put one backslash in the string. Thus, the string whose contents are the two characters @samp{"\} must be written @code{"\"\\"}. Another use of backslash is to represent unprintable characters such as newline. While there is nothing to stop you from writing most of these characters directly in a string constant, they may look ugly. Here is a table of all the escape sequences used in Octave. They are the same as those used in the C programming langauge. @table @code @item \\ Represents a literal backslash, @samp{\}. @item \" Represents a literal double-quote character, @samp{"}. @item \' Represents a literal single-quote character, @samp{'}. @item \a Represents the ``alert'' character, control-g, ASCII code 7. @item \b Represents a backspace, control-h, ASCII code 8. @item \f Represents a formfeed, control-l, ASCII code 12. @item \n Represents a newline, control-j, ASCII code 10. @item \r Represents a carriage return, control-m, ASCII code 13. @item \t Represents a horizontal tab, control-i, ASCII code 9. @item \v Represents a vertical tab, control-k, ASCII code 11. @c We don't do octal or hex this way yet. @c @c @item \@var{nnn} @c Represents the octal value @var{nnn}, where @var{nnn} are one to three @c digits between 0 and 7. For example, the code for the ASCII ESC @c (escape) character is @samp{\033}.@refill @c @c @item \x@var{hh}@dots{} @c Represents the hexadecimal value @var{hh}, where @var{hh} are hexadecimal @c digits (@samp{0} through @samp{9} and either @samp{A} through @samp{F} or @c @samp{a} through @samp{f}). Like the same construct in @sc{ansi} C, @c the escape @c sequence continues until the first non-hexadecimal digit is seen. However, @c using more than two hexadecimal digits produces undefined results. (The @c @samp{\x} escape sequence is not allowed in @sc{posix} @code{awk}.)@refill @end table Strings may be concatenated using the notation for defining matrices. For example, the expression @example [ "foo" , "bar" , "baz" ] @end example @noindent produces the string whose contents are @samp{foobarbaz}. The next section explains more about how to create matrices. @node Matrices, Ranges, Constant Expressions, Expressions @section Matrices @cindex matrices @opindex [ @opindex ] @opindex ; @opindex , It is easy to define a matrix of values in Octave. The size of the matrix is determined automatically, so it is not necessary to explicitly state the dimensions. The expression @example a = [1, 2; 3, 4] @end example @noindent results in the matrix @example a = 1 2 3 4 @end example The commas which separate the elements on a row may be omitted, and the semicolon that marks the beginning of a new row may be replaced by one or more new lines. The expression @example a = [ 1 2 3 4 ] @end example @noindent is equivalent to the one above. Elements of a matrix may be arbitrary expressions, provided that the dimensions all agree. For example, given the above matrix, the expression @example [ a, a ] @end example @noindent produces the matrix @example ans = 1 2 1 2 3 4 3 4 @end example @noindent but the expression @example [ a 1 ] @end example @noindent produces the error @c XXX FIXME XXX -- this error should eventually have line and column @c information associated with it. @example error: number of rows must match @end example Inside the square brackets that delimit a matrix expression, Octave looks at the surrounding context to determine whether spaces should be converted into element separators, or simply ignored, so commands like @example [ linspace (1, 2) ] @end example @noindent will work. However, some possible sources of confusion remain. For example, in the expression @example [ 1 - 1 ] @end example @noindent the @samp{-} is treated as a binary operator and the result is the scalar 0, but in the expression @example [ 1 -1 ] @end example @noindent the @samp{-} is treated as a unary operator and the result is the vector @code{[ 1 -1 ]}. Given @code{a = 1}, the expression @example [ 1 a' ] @end example @noindent results in the single quote character @samp{'} being treated as a transpose operator and the result is the vector @code{[ 1 1 ]}, but the expression @example [ 1 a ' ] @end example @noindent produces the error message @example error: unterminated string constant @end example @noindent because to not do so would make it impossible to correctly parse the valid expression @example [ a 'foo' ] @end example For clarity, it is probably best to always use commas and semicolons to separate matrix elements and rows. It is possible to enforce this style by setting the built-in variable @code{whitespace_in_literal_matrix} to @code{"ignore"}. @xref{Built-in Variables}. @menu * Empty Matrices:: @end menu @node Empty Matrices, , Matrices, Matrices @subsection Empty Matrices A matrix may have one or both dimensions zero, and operations on empty matrices are handled as described by Carl de Boor in @cite{An Empty Exercise}, SIGNUM, Volume 25, pages 2--6, 1990 and C. N. Nett and W. M. Haddad, in @cite{A System-Theoretic Appropriate Realization of the Empty Matrix Concept}, IEEE Transactions on Automatic Control, Volume 38, Number 5, May 1993. Briefly, given a scalar @code{s}, and an @var{m} by @var{n} matrix @code{M(mxn)}, and an @var{m} by @var{n} empty matrix @code{[](mxn)} (with either one or both dimensions equal to zero), the following are true: @example s * [](mxn) = [](mxn) * s = [](mxn) [](mxn) + [](mxn) = [](mxn) [](0xm) * M(mxn) = [](0xn) M(mxn) * [](nx0) = [](mx0) [](mx0) * [](0xn) = 0(mxn) @end example By default, dimensions of the empty matrix are now printed along with the empty matrix symbol, @samp{[]}. For example: @example octave:13> zeros (3, 0) ans = [](3x0) @end example The built-in variable @code{print_empty_dimensions} controls this behavior (@pxref{User Preferences}). Empty matrices may also be used in assignment statements as a convenient way to delete rows or columns of matrices. @xref{Assignment Ops, ,Assignment Expressions}. @node Ranges, Variables, Matrices, Expressions @section Ranges @cindex range expressions @cindex expression, range @opindex : A @dfn{range} is a convenient way to write a row vector with evenly spaced elements. A range constant is defined by the value of the first element in the range, an optional value for the increment between elements, and a maximum value which the elements of the range will not exceed. The base, increment, and limit are separated by colons (the @samp{:} character) and may contain any arithmetic expressions and function calls. If the increment is omitted, it is assumed to be 1. For example, the range @example 1 : 5 @end example @noindent defines the set of values @samp{[ 1 2 3 4 5 ]} (the increment has been omitted, so it is taken as 1), and the range @example 1 : 3 : 5 @end example @noindent defines the set of values @samp{[ 1 4 ]}. In this case, the base value is 1, the increment is 3, and the limit is 5. Although a range constant specifies a row vector, Octave does @emph{not} convert range constants to vectors unless it is necessary to do so. This allows you to write a constant like @samp{1 : 10000} without using up 80,000 bytes of storage on a typical 32-bit workstation. Note that the upper (or lower, if the increment is negative) bound on the range is not always included in the set of values, and that ranges defined by floating point values can produce surprising results because Octave uses floating point arithmetic to compute the values in the range. If it is important to include the endpoints of a range and the number of elements is known, you should use the @code{linspace} function instead (@pxref{Special Matrices}). @node Variables, Index Expressions, Ranges, Expressions @section Variables @cindex variables, user-defined @cindex user-defined variables Variables let you give names to values and refer to them later. You have already seen variables in many of the examples. The name of a variable must be a sequence of letters, digits and underscores, but it may not begin with a digit. Octave does not enforce a limit on the length of variable names, but it is seldom useful to have variables with names longer than about 30 characters. The following are all valid variable names @cindex job hunting @cindex getting a good job @cindex flying high and fast @example x x15 __foo_bar_baz__ fucnrdthsucngtagdjb @end example @noindent Case is significant in variable names. The symbols @code{a} and @code{A} are distinct variables. A variable name is a valid expression by itself. It represents the variable's current value. Variables are given new values with @dfn{assignment operators} and @dfn{increment operators}. @xref{Assignment Ops, ,Assignment Expressions}. A number of variables have special built-in meanings. For example, @code{PWD} holds the current working directory, and @code{pi} names the ratio of the circumference of a circle to its diameter. @xref{Built-in Variables}, for a list of all the predefined variables. Some of these built-in symbols are constants and may not be changed. Others can be used and assigned just like all other variables, but their values are also used or changed automatically by Octave. Variables in Octave can be assigned either numeric or string values. Variables may not be used before they have been given a value. Doing so results in an error. @node Index Expressions, Data Structures, Variables, Expressions @section Index Expressions An @dfn{index expression} allows you to reference or extract selected elements of a matrix or vector. Indices may be scalars, vectors, ranges, or the special operator @samp{:}, which may be used to select entire rows or columns. Vectors are indexed using a single expression. Matrices require two indices unless the value of the built-in variable @code{do_fortran_indexing} is @code{"true"}, in which case a matrix may also be indexed by a single expression (@pxref{User Preferences}). Given the matrix @example a = [1, 2; 3, 4] @end example @noindent all of the following expressions are equivalent @example a (1, [1, 2]) a (1, 1:2) a (1, :) @end example @noindent and select the first row of the matrix. A special form of indexing may be used to select elements of a matrix or vector. If the indices are vectors made up of only ones and zeros, the result is a new matrix whose elements correspond to the elements of the index vector that are equal to one. For example, @example a = [1, 2; 3, 4]; a ([1, 0], :) @end example @noindent selects the first row of the matrix @samp{a}. This operation can be useful for selecting elements of a matrix based on some condition, since the comparison operators return matrices of ones and zeros. Unfortunately, this special zero-one form of indexing leads to a conflict with the standard indexing operation. For example, should the following statements @example a = [1, 2; 3, 4]; a ([1, 1], :) @end example @noindent return the original matrix, or the matrix formed by selecting the first row twice? Although this conflict is not likely to arise very often in practice, you may select the behavior you prefer by setting the built-in variable @code{prefer_zero_one_indexing} (@pxref{User Preferences}). Finally, indexing a scalar with a vector of ones can be used to create a vector the same size as the the index vector, with each element equal to the value of the original scalar. For example, the following statements @example a = 13; a ([1, 1, 1, 1]) @end example @noindent produce a vector whose four elements are all equal to 13. Similarly, indexing a scalar with two vectors of ones can be used to create a matrix. For example the following statements @example a = 13; a ([1, 1], [1, 1, 1]) @end example @noindent create a 2 by 3 matrix with all elements equal to 13. This is an obscure notation and should be avoided. It is better to use the function @samp{ones} to generate a matrix of the appropriate size whose elements are all one, and then to scale it to produce the desired result. @xref{Special Matrices}. @node Data Structures, Calling Functions, Index Expressions, Expressions @section Data Structures @cindex structures @cindex data structures Octave includes a limited amount of support for organizing data in structures. The current implementation uses an associative array with indices limited to strings, but the syntax is more like C-style structures. Here are some examples of using data structures in Octave. Elements of structures can be of any value type. @example octave:1> x.a = 1; x.b = [1, 2; 3, 4]; x.c = "string"; octave:2> x.a x.a = 1 octave:3> x.b x.b = 1 2 3 4 octave:4> x.c x.c = string @end example Structures may be copied. @example octave:1> y = x y = @end example Note that when the value of a structure is printed, Octave only displays the names of the elements. This prevents long and confusing output from large deeply nested structures, but makes it more difficult to view the values of simple structures, so this behavior may change in a future version of Octave. Since structures are themselves values, structure elements may reference other structures. The following statements change the value of the element @code{b} of the structure @code{x} to be a data structure containing the single element @code{d}, which has a value of 3. @example octave:1> x.b.d = 3 x.b.d = 3 octave:2> x.b x.b = octave:3> x.b.d x.b.d = 3 @end example Functions can return structures. For example, the following function separates the real and complex parts of a matrix and stores them in two elements of the same structure variable. @example octave:1> function y = f (x) > y.re = real (x); > y.im = imag (x); > endfunction @end example When called with a complex-valued argument, @code{f} returns the data structure containing the real and imaginary parts of the original function argument. @example octave:1> f (rand (3) + rand (3) * I); ans = octave:3> ans.im ans.im = 0.093411 0.229690 0.627585 0.415128 0.221706 0.850341 0.894990 0.343265 0.384018 octave:4> ans.re ans.re = 0.56234 0.14797 0.26416 0.72120 0.62691 0.20910 0.89211 0.25175 0.21081 @end example Function return lists can include structure elements, and they may be indexed like any other variable. @example octave:1> [x.u, x.s(2:3,2:3), x.v] = svd ([1, 2; 3, 4]) x.u = -0.40455 -0.91451 -0.91451 0.40455 x.s = 0.00000 0.00000 0.00000 0.00000 5.46499 0.00000 0.00000 0.00000 0.36597 x.v = -0.57605 0.81742 -0.81742 -0.57605 octave:8> x x = @end example @findex is_struct You can also use the function @code{is_struct} to determine whether a given value is a data structure. For example @example is_struct (x) @end example @noindent returns 1 if the value of the variable @var{x} is a data structure. This feature should be considered experimental, but you should expect it to work. Suggestions for ways to improve it are welcome. @node Calling Functions, Global Variables, Data Structures, Expressions @section Calling Functions A @dfn{function} is a name for a particular calculation. Because it has a name, you can ask for it by name at any point in the program. For example, the function @code{sqrt} computes the square root of a number. A fixed set of functions are @dfn{built-in}, which means they are available in every Octave program. The @code{sqrt} function is one of these. In addition, you can define your own functions. @xref{Functions and Scripts}, for information about how to do this. @cindex arguments in function call The way to use a function is with a @dfn{function call} expression, which consists of the function name followed by a list of @dfn{arguments} in parentheses. The arguments are expressions which give the raw materials for the calculation that the function will do. When there is more than one argument, they are separated by commas. If there are no arguments, you can omit the parentheses, but it is a good idea to include them anyway, to clearly indicate that a function call was intended. Here are some examples: @example sqrt (x^2 + y^2) # @r{One argument} ones (n, m) # @r{Two arguments} rand () # @r{No arguments} @end example Each function expects a particular number of arguments. For example, the @code{sqrt} function must be called with a single argument, the number to take the square root of: @example sqrt (@var{argument}) @end example Some of the built-in functions take a variable number of arguments, depending on the particular usage, and their behavior is different depending on the number of arguments supplied. Like every other expression, the function call has a value, which is computed by the function based on the arguments you give it. In this example, the value of @code{sqrt (@var{argument})} is the square root of the argument. A function can also have side effects, such as assigning the values of certain variables or doing input or output operations. Unlike most languages, functions in Octave may return multiple values. For example, the following statement @example [u, s, v] = svd (a) @end example @noindent computes the singular value decomposition of the matrix @samp{a} and assigns the three result matrices to @samp{u}, @samp{s}, and @samp{v}. The left side of a multiple assignment expression is itself a list of expressions, and is allowed to be a list of variable names or index expressions. See also @ref{Index Expressions}, and @ref{Assignment Ops}. @menu * Call by Value:: * Recursion:: @end menu @node Call by Value, Recursion, Calling Functions, Calling Functions @subsection Call by Value In Octave, unlike Fortran, function arguments are passed by value, which means that each argument in a function call is evaluated and assigned to a temporary location in memory before being passed to the function. There is currently no way to specify that a function parameter should be passed by reference instead of by value. This means that it is impossible to directly alter the value of function parameter in the calling function. It can only change the local copy within the function body. For example, the function @example function f (x, n) while (n-- > 0) disp (x); endwhile endfunction @end example @noindent displays the value of the first argument @var{n} times. In this function, the variable @var{n} is used as a temporary variable without having to worry that its value might also change in the calling function. Call by value is also useful because it is always possible to pass constants for any function parameter without first having to determine that the function will not attempt to modify the parameter. The caller may use a variable as the expression for the argument, but the called function does not know this: it only knows what value the argument had. For example, given a function called as @example foo = "bar"; fcn (foo) @end example @noindent you should not think of the argument as being ``the variable @code{foo}.'' Instead, think of the argument as the string value, @code{"bar"}. @node Recursion, , Call by Value, Calling Functions @subsection Recursion @cindex factorial function Recursive function calls are allowed. A @dfn{recursive function} is one which calls itself, either directly or indirectly. For example, here is an inefficient@footnote{It would be much better to use @code{prod (1:n)}, or @code{gamma (n+1)} instead, after first checking to ensure that the value @code{n} is actually a positive integer.} way to compute the factorial of a given integer: @example function retval = fact (n) if (n > 0) retval = n * fact (n-1); else retval = 1; endif endfunction @end example This function is recursive because it calls itself directly. It eventually terminates because each time it calls itself, it uses an argument that is one less than was used for the previous call. Once the argument is no longer greater than zero, it does not call itself, and the recursion ends. There is currently no limit on the recursion depth, so infinite recursion is possible. If this happens, Octave will consume more and more memory attempting to store intermediate values for each function call context until there are no more resources available. This is obviously undesirable, and will probably be fixed in some future version of Octave by allowing users to specify a maximum allowable recursion depth. @node Global Variables, Keywords, Calling Functions, Expressions @section Global Variables A variable that has been declared @dfn{global} may be accessed from within a function body without having to pass it as a formal parameter. A variable may be declared global using a @code{global} declaration statement. The following statements are all global declarations. @example global a global b = 2 global c = 3, d, e = 5 @end example It is necessary declare a variable as global within a function body in order to access it. For example, @example global x function f () x = 1; endfunction f () @end example @noindent does @emph{not} set the value of the global variable @samp{x} to 1. In order to change the value of the global variable @samp{x}, you must also declare it to be global within the function body, like this @example function f () global x; x = 1; endfunction @end example Passing a global variable in a function parameter list will make a local copy and not modify the global value. For example: @example octave:1> function f (x) > x = 3 > endfunction octave:2> global x = 0 octave:3> x # This is the value of the global variable. x = 0 octave:4> f (x) x = 3 # The value of the local variable x is 3. octave:5> x # But it was a *copy* so the global variable x = 0 # remains unchanged. @end example @node Keywords, Arithmetic Ops, Global Variables, Expressions @section Keywords @cindex keywords The following identifiers are keywords, and may not be used as variable or function names: @example break endfor function return continue endfunction global while else endif gplot elseif endwhile gsplot end for if @end example The following command-like functions are also keywords, and may not be used as variable or function names: @example casesen document history set cd edit_history load show clear help ls who dir format run_history save @end example @node Arithmetic Ops, Comparison Ops, Keywords, Expressions @section Arithmetic Operators @cindex arithmetic operators @cindex operators, arithmetic @cindex addition @cindex subtraction @cindex multiplication @cindex matrix multiplication @cindex division @cindex quotient @cindex negation @cindex unary minus @cindex exponentiation @cindex transpose @cindex Hermitian operator @cindex transpose, complex-conjugate @cindex complex-conjugate transpose @opindex + @opindex - @opindex * @opindex / @opindex \ @opindex ** @opindex ^ @opindex ' @opindex .+ @opindex .- @opindex .* @opindex ./ @opindex .\ @opindex .** @opindex .^ @opindex .' The following arithmetic operators are available, and work on scalars and matrices. @table @code @item @var{x} + @var{y} Addition. If both operands are matrices, the number of rows and columns must both agree. If one operand is a scalar, its value is added to all the elements of the other operand. @item @var{x} .+ @var{y} Element by element addition. This operator is equivalent to @code{+}. @item @var{x} - @var{y} Subtraction. If both operands are matrices, the number of rows and columns of both must agree. @item @var{x} .- @var{y} Element by element subtraction. This operator is equivalent to @code{-}. @item @var{x} * @var{y} Matrix multiplication. The number of columns of @samp{x} must agree with the number of rows of @samp{y}. @item @var{x} .* @var{y} Element by element multiplication. If both operands are matrices, the number of rows and columns must both agree. @item @var{x} / @var{y} Right division. This is conceptually equivalent to the expression @example (inverse (y') * x')' @end example @noindent but it is computed without forming the inverse of @samp{y'}. If the system is not square, or if the coefficient matrix is singular, a minimum norm solution is computed. @item @var{x} ./ @var{y} Element by element right division. @item @var{x} \ @var{y} Left division. This is conceptually equivalent to the expression @example inverse (x) * y @end example @noindent but it is computed without forming the inverse of @samp{x}. If the system is not square, or if the coefficient matrix is singular, a minimum norm solution is computed. @item @var{x} .\ @var{y} Element by element left division. Each element of @samp{y} is divided by each corresponding element of @samp{x}. @item @var{x} ^ @var{y} @itemx @var{x} ** @var{y} Power operator. If @var{x} and @var{y} are both scalars, this operator returns @var{x} raised to the power @var{y}. If @var{x} is a scalar and @var{y} is a square matrix, the result is computed using an eigenvalue expansion. If @var{x} is a square matrix. the result is computed by repeated multiplication if @var{y} is an integer, and by an eigenvalue expansion if @var{y} is not an integer. An error results if both @var{x} and @var{y} are matrices. The implementation of this operator needs to be improved. @item @var{x} .^ @var{y} @item @var{x} .** @var{y} Element by element power operator. If both operands are matrices, the number of rows and columns must both agree. @item -@var{x} Negation. @item +@var{x} Unary plus. This operator has no effect on the operand. @item @var{x}' Complex conjugate transpose. For real arguments, this operator is the same as the transpose operator. For complex arguments, this operator is equivalent to the expression @example conj (x.') @end example @item @var{x}.' Transpose. @end table Note that because Octave's element by element operators begin with a @samp{.}, there is a possible ambiguity for statements like @example 1./m @end example @noindent because the period could be interpreted either as part of the constant or as part of the operator. To resolve this conflict, Octave treats the expression as if you had typed @example (1) ./ m @end example @noindent and not @example (1.) / m @end example @noindent Although this is inconsistent with the normal behavior of Octave's lexer, which usually prefers to break the input into tokens by preferring the longest possible match at any given point, it is more useful in this case. @node Comparison Ops, Boolean Expressions, Arithmetic Ops, Expressions @section Comparison Operators @cindex comparison expressions @cindex expressions, comparison @cindex relational operators @cindex operators, relational @cindex less than operator @cindex greater than operator @cindex equality operator @cindex tests for equality @cindex equality, tests for @opindex < @opindex <= @opindex == @opindex >= @opindex > @opindex != @opindex ~= @opindex <> @dfn{Comparison operators} compare numeric values for relationships such as equality. They are written using @emph{relational operators}, which are a superset of those in C. All of Octave's comparison operators return a value of 1 if the comparison is true, or 0 if it is false. For matrix values, they all work on an element-by-element basis. For example, evaluating the expression @example [1, 2; 3, 4] == [1, 3; 2, 4] @end example @noindent returns the result @example ans = 1 0 0 1 @end example @table @code @item @var{x} < @var{y} True if @var{x} is less than @var{y}. @item @var{x} <= @var{y} True if @var{x} is less than or equal to @var{y}. @item @var{x} == @var{y} True if @var{x} is equal to @var{y}. @item @var{x} >= @var{y} True if @var{x} is greater than or equal to @var{y}. @item @var{x} > @var{y} True if @var{x} is greater than @var{y}. @item @var{x} != @var{y} @itemx @var{x} ~= @var{y} @itemx @var{x} <> @var{y} True if @var{x} is not equal to @var{y}. @end table For matrix and vector arguments, the above table should be read as ``an element of the result matrix (vector) is true if the corresponding elements of the argument matrices (vectors) satisfy the specified condition'' String comparisons should be performed with the @code{strcmp} function, not with the comparison operators listed above. @xref{Calling Functions}. @node Boolean Expressions, Assignment Ops, Comparison Ops, Expressions @section Boolean Expressions @cindex expressions, boolean @cindex boolean expressions @cindex expressions, logical @cindex logical expressions @cindex operators, boolean @cindex boolean operators @cindex logical operators @cindex operators, logical @cindex and operator @cindex or operator @cindex not operator @menu * Element-by-element Boolean Operators:: * Short-circuit Boolean Operators:: @end menu @node Element-by-element Boolean Operators, Short-circuit Boolean Operators, Boolean Expressions, Boolean Expressions @subsection Element-by-element Boolean Operators @cindex element-by-element evaluation @opindex | @opindex & @opindex ~ @opindex ! An element-by-element @dfn{boolean expression} is a combination of comparison expressions or matching expressions, using the boolean operators ``or'' (@samp{|}), ``and'' (@samp{&}), and ``not'' (@samp{!}), along with parentheses to control nesting. The truth of the boolean expression is computed by combining the truth values of the corresponding elements of the component expressions. A value is considered to be false if it is zero, and true otherwise. Element-by-element boolean expressions can be used wherever comparison expressions can be used. They can be used in @code{if} and @code{while} statements. However, before being used in the condition of an @code{if} or @code{while} statement, an implicit conversion from a matrix value to a scalar value occurs using the equivalent of @code{all (all (@var{x}))}. That is, a value used as the condition in an @code{if} or @code{while} statement is only true if @emph{all} of its elements are nonzero. Like comparison operations, each element of an element-by-element boolean expression also has a numeric value (1 if true, 0 if false) that comes into play if the result of the boolean expression is stored in a variable, or used in arithmetic. Here are descriptions of the three element-by-element boolean operators. @table @code @item @var{boolean1} & @var{boolean2} Elements of the result are true if both corresponding elements of @var{boolean1} and @var{boolean2} are true. @item @var{boolean1} | @var{boolean2} Elements of the result are true if either of the corresponding elements of @var{boolean1} or @var{boolean2} is true. @item ! @var{boolean} @itemx ~ @var{boolean} Each element of the result is true if the corresponding element of @var{boolean} is false. @end table For matrix operands, these operators work on an element-by-element basis. For example, the expression @example [1, 0; 0, 1] & [1, 0; 2, 3] @end example @noindent returns a two by two identity matrix. For the binary operators, the dimensions of the operands must conform if both are matrices. If one of the operands is a scalar and the other a matrix, the operator is applied to the scalar and each element of the matrix. For the binary element-by-element boolean operators, both subexpressions @var{boolean1} and @var{boolean2} are evaluated before computing the result. This can make a difference when the expressions have side effects. For example, in the expression @example a & b++ @end example @noindent the value of the variable @var{b} is incremented even if the variable @var{a} is zero. This behavior is necessary for the boolean operators to work as described for matrix-valued operands. @node Short-circuit Boolean Operators, , Element-by-element Boolean Operators, Boolean Expressions @subsection Short-circuit Boolean Operators @cindex short-circuit evaluation @opindex || @opindex && Combined with the implicit conversion to scalar values in @code{if} and @code{while} conditions, Octave's element-by-element boolean operators are often sufficient for performing most logical operations. However, it is sometimes desirable to stop evaluating a boolean expression as soon as the overall truth value can be determined. Octave's @dfn{short-circuit} boolean operators work this way. @table @code @item @var{boolean1} && @var{boolean2} The expression @var{boolean1} is evaluated and converted to a scalar using the equivalent of the operation @code{all (all (@var{boolean1}))}. If it is false, the result of the expression is 0. If it is true, the expression @var{boolean2} is evaluated and converted to a scalar using the equivalent of the operation @code{all (all (@var{boolean1}))}. If it is true, the result of the expression is 1. Otherwise, the result of the expression is 0. @item @var{boolean1} || @var{boolean2} The expression @var{boolean1} is evaluated and converted to a scalar using the equivalent of the operation @code{all (all (@var{boolean1}))}. If it is true, the result of the expression is 1. If it is false, the expression @var{boolean2} is evaluated and converted to a scalar using the equivalent of the operation @code{all (all (@var{boolean1}))}. If it is true, the result of the expression is 1. Otherwise, the result of the expression is 0. @end table The fact that both operands may not be evaluated before determining the overall truth value of the expression can be important. For example, in the expression @example a && b++ @end example @noindent the value of the variable @var{b} is only incremented if the variable @var{a} is nonzero. This can be used to write somewhat more concise code. For example, it is possible write @example function f (a, b, c) if (nargin > 2 && isstr (c)) ... @end example @noindent instead of having to use two @code{if} statements to avoid attempting to evaluate an argument that doesn't exist. @example function f (a, b, c) if (nargin > 2) if (isstr (c)) ... @end example @node Assignment Ops, Increment Ops, Boolean Expressions, Expressions @section Assignment Expressions @cindex assignment expressions @cindex assignment operators @cindex operators, assignment @cindex expressions, assignment @opindex = An @dfn{assignment} is an expression that stores a new value into a variable. For example, the following expression assigns the value 1 to the variable @code{z}: @example z = 1 @end example After this expression is executed, the variable @code{z} has the value 1. Whatever old value @code{z} had before the assignment is forgotten. Assignments can store string values also. For example, the following expression would store the value @code{"this food is good"} in the variable @code{message}: @example thing = "food" predicate = "good" message = [ "this " , thing , " is " , predicate ] @end example @noindent (This also illustrates concatenation of strings.) The @samp{=} sign is called an @dfn{assignment operator}. It is the simplest assignment operator because the value of the right-hand operand is stored unchanged. @cindex side effect Most operators (addition, concatenation, and so on) have no effect except to compute a value. If you ignore the value, you might as well not use the operator. An assignment operator is different. It does produce a value, but even if you ignore the value, the assignment still makes itself felt through the alteration of the variable. We call this a @dfn{side effect}. @cindex lvalue The left-hand operand of an assignment need not be a variable (@pxref{Variables}). It can also be an element of a matrix (@pxref{Index Expressions}) or a list of return values (@pxref{Calling Functions}). These are all called @dfn{lvalues}, which means they can appear on the left-hand side of an assignment operator. The right-hand operand may be any expression. It produces the new value which the assignment stores in the specified variable, matrix element, or list of return values. It is important to note that variables do @emph{not} have permanent types. The type of a variable is simply the type of whatever value it happens to hold at the moment. In the following program fragment, the variable @code{foo} has a numeric value at first, and a string value later on: @example octave:13> foo = 1 foo = 1 octave:13> foo = "bar" foo = bar @end example @noindent When the second assignment gives @code{foo} a string value, the fact that it previously had a numeric value is forgotten. Assigning an empty matrix @samp{[]} works in most cases to allow you to delete rows or columns of matrices and vectors. @xref{Empty Matrices}. For example, given a 4 by 5 matrix @var{A}, the assignment @example A (3, :) = [] @end example @noindent deletes the third row of @var{A}, and the assignment @example A (:, 1:2:5) = [] @end example @noindent deletes the first, third, and fifth columns. An assignment is an expression, so it has a value. Thus, @code{z = 1} as an expression has the value 1. One consequence of this is that you can write multiple assignments together: @example x = y = z = 0 @end example @noindent stores the value 0 in all three variables. It does this because the value of @code{z = 0}, which is 0, is stored into @code{y}, and then the value of @code{y = z = 0}, which is 0, is stored into @code{x}. This is also true of assignments to lists of values, so the following is a valid expression @example [a, b, c] = [u, s, v] = svd (a) @end example @noindent that is exactly equivalent to @example [u, s, v] = svd (a) a = u b = s c = v @end example In expressions like this, the number of values in each part of the expression need not match. For example, the expression @example [a, b, c, d] = [u, s, v] = svd (a) @end example @noindent is equivalent to the expression above, except that the value of the variable @samp{d} is left unchanged, and the expression @example [a, b] = [u, s, v] = svd (a) @end example @noindent is equivalent to @example [u, s, v] = svd (a) a = u b = s @end example You can use an assignment anywhere an expression is called for. For example, it is valid to write @code{x != (y = 1)} to set @code{y} to 1 and then test whether @code{x} equals 1. But this style tends to make programs hard to read. Except in a one-shot program, you should rewrite it to get rid of such nesting of assignments. This is never very hard. @cindex increment operator @cindex decrement operator @cindex operators, increment @cindex operators, decrement @opindex ++ @opindex -- @node Increment Ops, Operator Precedence, Assignment Ops, Expressions @section Increment Operators @emph{Increment operators} increase or decrease the value of a variable by 1. The operator to increment a variable is written as @samp{++}. It may be used to increment a variable either before or after taking its value. For example, to pre-increment the variable @var{x}, you would write @code{++@var{x}}. This would add one to @var{x} and then return the new value of @var{x} as the result of the expression. It is exactly the same as the expression @code{@var{x} = @var{x} + 1}. To post-increment a variable @var{x}, you would write @code{@var{x}++}. This adds one to the variable @var{x}, but returns the value that @var{x} had prior to incrementing it. For example, if @var{x} is equal to 2, the result of the expression @code{@var{x}++} is 2, and the new value of @var{x} is 3. For matrix and vector arguments, the increment and decrement operators work on each element of the operand. Here is a list of all the increment and decrement expressions. @table @code @item ++@var{x} This expression increments the variable @var{x}. The value of the expression is the @emph{new} value of @var{x}. It is equivalent to the expression @code{@var{x} = @var{x} + 1}. @item --@var{x} This expression decrements the variable @var{x}. The value of the expression is the @emph{new} value of @var{x}. It is equivalent to the expression @code{@var{x} = @var{x} - 1}. @item @var{x}++ This expression causes the variable @var{x} to be incremented. The value of the expression is the @emph{old} value of @var{x}. @item @var{x}-- This expression causes the variable @var{x} to be decremented. The value of the expression is the @emph{old} value of @var{x}. @end table It is not currently possible to increment index expressions. For example, you might expect that the expression @code{@var{v}(4)++} would increment the fourth element of the vector @var{v}, but instead it results in a parse error. This problem may be fixed in a future release of Octave. @cindex operator precedence @node Operator Precedence, , Increment Ops, Expressions @section Operator Precedence @dfn{Operator precedence} determines how operators are grouped, when different operators appear close by in one expression. For example, @samp{*} has higher precedence than @samp{+}. Thus, the expression @code{a + b * c} means to multiply @code{b} and @code{c}, and then add @code{a} to the product (i.e., @code{a + (b * c)}). You can overrule the precedence of the operators by using parentheses. You can think of the precedence rules as saying where the parentheses are assumed if you do not write parentheses yourself. In fact, it is wise to use parentheses whenever you have an unusual combination of operators, because other people who read the program may not remember what the precedence is in this case. You might forget as well, and then you too could make a mistake. Explicit parentheses will help prevent any such mistake. When operators of equal precedence are used together, the leftmost operator groups first, except for the assignment, and exponentiation operators, which group in the opposite order. Thus, the expression @code{a - b + c} groups as @code{(a - b) + c}, but the expression @code{a = b = c} groups as @code{a = (b = c)}. The precedence of prefix unary operators is important when another operator follows the operand. For example, @code{-x^2} means @code{-(x^2)}, because @samp{-} has lower precedence than @samp{^}. Here is a table of the operators in Octave, in order of increasing precedence. @table @code @item statement separators @samp{;}, @samp{,}. @item assignment @samp{=}. This operator groups right to left. @item logical "or" and "and" @samp{||}, @samp{&&}. @item element-wise "or" and "and" @samp{|}, @samp{&}. @item relational @samp{<}, @samp{<=}, @samp{==}, @samp{>=}, @samp{>}, @samp{!=}, @samp{~=}, @samp{<>}. @item colon @samp{:}. @item add, subtract @samp{+}, @samp{-}. @item multiply, divide @samp{*}, @samp{/}, @samp{\}, @samp{.\}, @samp{.*}, @samp{./}. @item transpose @samp{'}, @samp{.'} @item unary plus, minus, increment, decrement, and ``not'' @samp{+}, @samp{-}, @samp{++}, @samp{--}, @samp{!}, @samp{~}. @item exponentiation @samp{^}, @samp{**}, @samp{.^}, @samp{.**}. @end table octave-1.1.0/doc/extend.texi100666 415 17 13335 5705272515 14123 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Adding New Functions @chapter Adding New Functions @cindex Functions The following is not complete, but should help get you started and give you some idea about why things are they way they are. Here's what you need to do to add a new function (I'll use svd() as an example): 1. Add the name of the new function to the general_functions list in builtins.cc: static builtin_general_functions general_functions[] = { ... { "svd", 2, 3, builtin_svd, "[U, S, V] = svd (X): return SVD of X\n", }, ... }; The builtin_general_functions struct is defined in builtns.h: struct builtin_general_functions { char *name; int nargin_max; int nargout_max; General_fcn general_fcn; char *help_string; }; name is what the user types (e.g. `svd'); nargin_max and nargout_max are the maximum number of input and output arguments. These are not really important. I had originally planned to use them to allow Octave to do some checking to see if the user had supplied the correct number of arguments, but that doesn't really work very well. It seems better to have each function check (since different numbers of input arguments may mean different things). Note: nargin == 1 means that the function takes no arguments (just like C, the first argument is (or should be, anyway) the function name). Also, -1 is shorthand for infinity. general_fcn is the function you need to define to do the real work. Usually called builtin_foo, for function foo. More about the form of this function is given below. help_string is the message that the user will get if he types `help svd'. Yes, the initialization of this structure is a bit clumsy. I'm probably going to try to fix that at some point, but don't really know exactly how and haven't had time to do it right yet. 2. Write the function that does all the work. I've adopted the following convention: * Declare the function in g-builtins.h. All `general' functions take the same arguments: builtin_svd (const tree_constant *args, int nargin, int nargout) - args: a vector of tree_constants, which is the basic data structure for values in Octave. Currently, a tree_constant can be a real or complex scalar or matrix, a range, or a string. - nargin: the number of arguments the user provided plus one. args[0] is supposed to hold the function name, but I'm not sure that that's always true yet. - nargout: the number of arguments the user provided on the left side of an assignment, or one if no assignment is being done (because of the implicit assignment to ans that will occur). * Define the function in g-builtins.cc. Usually, the function in g-builtins.cc only contains simple checks to see if the correct number of arguments have been supplied and then a call to the function that REALLY :-) does all the work. If the function is small, it's probably reasonable to define it in tc-extras.cc. If the function is not small, or if it depends on external fortran code, it is probably best to put it in its own file (for example, f-svd.cc). If dynamic linking is ever really made to work, it will be important for functions to be implemented this way. To make it easier to make all of this work in the future, calls are written using the DLD_FUNC macro defined at the top of g-builtins.cc. For example: DLD_BUILTIN (args, nargin, nargout, svd, retval = svd (args, nargin, nargout);) If dynamic linking is being used, this expands to return octave_dld_tc2_and_go (args, nargin, nargout, "svd", \ "builtin_svd_2", "f-svd.o")); which is a call to a function that will take care of patching in the function builtin_svd_2, which is defined in the file f-svd.cc (corresponding to the object file f-svd.o). Otherwise, it simply expands to retval = svd (args, nargin, nargout); (a function that is also defined in f-svd.cc). * If the function is defined in a separate file, like f-svd.cc, it should be implemented like the others that already exist. The code like #ifdef WITH_DLD tree_constant * builtin_svd_2 (tree_constant *args, int nargin, int nargout) { return svd (args, nargin, nargout); } #endif is just a hook for dynamic loading. It was implemented this way so that the names of all the functions that are to be loaded dynamically would have consistent form (so that they could easily be constructed from the name that the user types). The rest of the code defined in this file does the real work. In the case of svd, it uses some C++ classes to call the required Fortran subroutines. The class interfaces are defined in liboctave/Matrix.h, and the class definitions are (for things like SVD, HESS, LU, EIG, etc.) are in Matrix-ext.cc. 3. If you add a new file (like f-svd.cc), don't forget to add it to the list of files in Makefile.in, then use configure to update the Makefile. You should use the error reporting functions defined in error.{h,cc} instead of writing messages directly to cout or cerr. That way, it will be easier to maintain a consistent look to the warning and error messages. octave-1.1.0/doc/fn-idx.texi100666 415 17 356 5705073511 13753 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Function Index, Operator Index, Variable Index, Top @unnumbered Function Index @printindex fn octave-1.1.0/doc/func.texi100666 415 17 55741 5705307051 13570 0ustar jweusers@c Copyright (C) 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Functions and Scripts, Built-in Variables, Statements, Top @chapter Functions and Script Files @cindex defining functions @cindex user-defined functions @cindex functions, user-defined @cindex script files Complicated Octave programs can often be simplified by defining functions. Functions can be defined directly on the command line during interactive Octave sessions, or in external files, and can be called just like built-in ones. @menu * Defining Functions:: * Multiple Return Values:: * Variable-length Argument Lists:: * Variable-length Return Lists:: * Returning From a Function:: * Function Files:: * Script Files:: * Dynamically Linked Functions:: * Organization of Functions:: @end menu @node Defining Functions, Multiple Return Values, Functions and Scripts, Functions and Scripts @section Defining Functions In its simplest form, the definition of a function named @var{name} looks like this: @example @group function @var{name} @var{body} endfunction @end group @end example @noindent A valid function name is like a valid variable name: a sequence of letters, digits and underscores, not starting with a digit. Functions share the same pool of names as variables. The function @var{body} consists of Octave statements. It is the most important part of the definition, because it says what the function should actually @emph{do}. For example, here is a function that, when executed, will ring the bell on your terminal (assuming that it is possible to do so): @example @group function wakeup printf ("\a"); endfunction @end group @end example The @code{printf} statement (@pxref{Input and Output}) simply tells Octave to print the string @code{"\a"}. The special character @samp{\a} stands for the alert character (ASCII 7). @xref{String Constants}. Once this function is defined, you can ask Octave to evaluate it by typing the name of the function. Normally, you will want to pass some information to the functions you define. The syntax for passing parameters to a function in Octave is @example @group function @var{name} (@var{arg-list}) @var{body} endfunction @end group @end example @noindent where @var{arg-list} is a comma-separated list of the function's arguments. When the function is called, the argument names are used to hold the argument values given in the call. The list of arguments may be empty, in which case this form is equivalent to the one shown above. To print a message along with ringing the bell, you might modify the @code{beep} to look like this: @example @group function wakeup (message) printf ("\a%s\n", message); endfunction @end group @end example Calling this function using a statement like this @example wakeup ("Rise and shine!"); @end example @noindent will cause Octave to ring your terminal's bell and print the message @samp{Rise and shine!}, followed by a newline character (the @samp{\n} in the first argument to the @code{printf} statement). In most cases, you will also want to get some information back from the functions you define. Here is the syntax for writing a function that returns a single value: @example @group function @var{ret-var} = @var{name} (@var{arg-list}) @var{body} endfunction @end group @end example @noindent The symbol @var{ret-var} is the name of the variable that will hold the value to be returned by the function. This variable must be defined before the end of the function body in order for the function to return a value. For example, here is a function that computes the average of the elements of a vector: @example @group function retval = avg (v) retval = sum (v) / length (v); endfunction @end group @end example If we had written @code{avg} like this instead, @example @group function retval = avg (v) if (is_vector (v)) retval = sum (v) / length (v); endif endfunction @end group @end example @noindent and then called the function with a matrix instead of a vector as the argument, Octave would have printed an error message like this: @example @group error: `retval' undefined near line 1 column 10 error: evaluating index expression near line 7, column 1 @end group @end example @noindent because the body of the @code{if} statement was never executed, and @code{retval} was never defined. To prevent obscure errors like this, it is a good idea to always make sure that the return variables will always have values, and to produce meaningful error messages when problems are encountered. For example, @code{avg} could have been written like this: @example @group function retval = avg (v) retval = 0; if (is_vector (v)) retval = sum (v) / length (v); else error ("avg: expecting vector argument"); endif endfunction @end group @end example There is still one additional problem with this function. What if it is called without an argument? Without additional error checking, Octave will probably print an error message that won't really help you track down the source of the error. To allow you to catch errors like this, Octave provides each function with an automatic variable called @code{nargin}. Each time a function is called, @code{nargin} is automatically initialized to the number of arguments that have actually been passed to the function. For example, we might rewrite the @code{avg} function like this: @vindex nargout @example @group function retval = avg (v) retval = 0; if (nargin != 1) error ("usage: avg (vector)"); endif if (is_vector (v)) retval = sum (v) / length (v); else error ("avg: expecting vector argument"); endif endfunction @end group @end example Although Octave does not consider it an error if you call a function with more arguments than were expected, doing so is probably an error, so we check for that possibility too, and issue the error message if either too few or too many arguments have been provided. The body of a user-defined function can contain a @code{return} statement. This statement returns control to the rest of the Octave program. A @code{return} statement is assumed at the end of every function definition. @node Multiple Return Values, Variable-length Argument Lists, Defining Functions, Functions and Scripts @section Multiple Return Values Unlike many other computer languages, Octave allows you to define functions that return more than one value. The syntax for defining functions that return multiple values is @example function [@var{ret-list}] = @var{name} (@var{arg-list}) @var{body} endfunction @end example @noindent where @var{name}, @var{arg-list}, and @var{body} have the same meaning as before, and @var{ret-list} is a comma-separated list of variable names that will hold the values returned from the function. The list of return values must have at least one element. If @var{ret-list} has only one element, this form of the @code{function} statement is equivalent to the form described in the previous section. Here is an example of a function that returns two values, the maximum element of a vector and the index of its first occurrence in the vector. @example @group function [max, idx] = vmax (v) idx = 1; max = v (idx); for i = 2:length (v) if (v (i) > max) max = v (i); idx = i; endif endfor endfunction @end group @end example In this particular case, the two values could have been returned as elements of a single array, but that is not always possible or convenient. The values to be returned may not have compatible dimensions, and it is often desirable to give the individual return values distinct names. In addition to setting @code{nargin} each time a function is called, Octave also automatically initializes @code{nargout} to the number of values that are expected to be returned. This allows you to write functions that behave differently depending on the number of values that the user of the function has requested. The implicit assignment to the built-in variable @code{ans} does not figure in the count of output arguments, so the value of @code{nargout} may be zero. The @code{svd} and @code{lu} functions are examples of built-in functions that behave differently depending on the value of @code{nargout}. It is possible to write functions that only set some return values. For example, calling the function @example function [x, y, z] = f () x = 1; z = 2; endfunction @end example @noindent as @example [a, b, c] = f () @end example @noindent produces: @example a = 1 b = [](0x0) c = 2 @end example @node Variable-length Argument Lists, Variable-length Return Lists, Multiple Return Values, Functions and Scripts @section Variable-length Argument Lists @cindex Variable-length argument lists @cindex @code{...} @findex va_arg @findex va_start Octave has a real mechanism for handling functions that take an unspecified number of arguments, so it is not necessary to place an upper bound on the number of optional arguments that a function can accept. Here is an example of a function that uses the new syntax to print a header followed by an unspecified number of values: @example function foo (heading, ...) disp (heading); va_start (); while (--nargin) disp (va_arg ()); endwhile endfunction @end example The ellipsis that marks the variable argument list may only appear once and must be the last element in the list of arguments. Calling @code{va_start()} positions an internal pointer to the first unnamed argument and allows you to cycle through the arguments more than once. It is not necessary to call @code{va_start()} if you do not plan to cycle through the arguments more than once. The function @code{va_arg()} returns the value of the next available argument and moves the internal pointer to the next argument. It is an error to call @code{va_arg()} when there are no more arguments available. Sometimes it is useful to be able to pass all unnamed arguments to another function. The keyword @var{all_va_args} makes this very easy to do. For example, given the functions @example function f (...) while (nargin--) disp (va_arg ()) endwhile endfunction function g (...) f ("begin", all_va_args, "end") endfunction @end example @noindent the statement @example g (1, 2, 3) @end example @noindent prints @example begin 1 2 3 end @end example The keyword @code{all_va_args} always stands for the entire list of optional argument, so it is possible to use it more than once within the same function without having to call @code{var_start ()}. It can only be used within functions that take a variable number of arguments. It is an error to use it in other contexts. @node Variable-length Return Lists, Returning From a Function, Variable-length Argument Lists, Functions and Scripts @section Variable-length Return Lists @cindex Variable-length return lists @cindex @code{...} @findex vr_val Octave also has a real mechanism for handling functions that return an unspecified number of values, so it is no longer necessary to place an upper bound on the number of outputs that a function can produce. Here is an example of a function that uses the new syntax to produce N values: @example function [...] = foo (n, x) for i = 1:n vr_val (i * x); endfor endfunction @end example Each time @code{vr_val()} is called, it places the value of its argument at the end of the list of values to return from the function. Once @code{vr_val()} has been called, there is no way to go back to the beginning of the list and rewrite any of the return values. As with variable argument lists, the ellipsis that marks the variable return list may only appear once and must be the last element in the list of returned values. @node Returning From a Function, Function Files, Variable-length Return Lists, Functions and Scripts @section Returning From a Function The body of a user-defined function can contain a @code{return} statement. This statement returns control to the rest of the Octave program. It looks like this: @example return @end example Unlike the @code{return} statement in C, Octave's @code{return} statement cannot be used to return a value from a function. Instead, you must assign values to the list of return variables that are part of the @code{function} statement. The @code{return} statement simply makes it easier to exit a function from a deeply nested loop or conditional statement. Here is an example of a function that checks to see if any elements of a vector are nonzero. @example @group function retval = any_nonzero (v) retval = 0; for i = 1:length (v) if (v (i) != 0) retval = 1; return; endif endfor printf ("no nonzero elements found\n"); endfunction @end group @end example Note that this function could not have been written using the @code{break} statement to exit the loop once a nonzero value is found without adding extra logic to avoid printing the message if the vector does contain a nonzero element. @node Function Files, Script Files, Returning From a Function, Functions and Scripts @section Function Files @cindex function file Except for simple one-shot programs, it is not practical to have to define all the functions you need each time you need them. Instead, you will normally want to save them in a file so that you can easily edit them, and save them for use at a later time. Octave does not require you to load function definitions from files before using them. You simply need to put the function definitions in a place where Octave can find them. When Octave encounters an identifier that is undefined, it first looks for variables or functions that are already compiled and currently listed in its symbol table. If it fails to find a definition there, it searches the list of directories specified by the built-in variable @code{LOADPATH} for files ending in @file{.m} that have the same base name as the undefined identifier.@footnote{The @samp{.m} suffix was chosen for compatibility with @sc{Matlab}.} @xref{User Preferences} for a description of @code{LOADPATH}. Once Octave finds a file with a name that matches, the contents of the file are read. If it defines a @emph{single} function, it is compiled and executed. @xref{Script Files}, for more information about how you can define more than one function in a single file. When Octave defines a function from a function file, it saves the full name of the file it read and the time stamp on the file. After that, it checks the time stamp on the file every time it needs the function. If the time stamp indicates that the file has changed since the last time it was read, Octave reads it again. Checking the time stamp allows you to edit the definition of a function while Octave is running, and automatically use the new function definition without having to restart your Octave session. Checking the time stamp every time a function is used is rather inefficient, but it has to be done to ensure that the correct function definition is used. Octave assumes that function files in the @file{/usr/local/lib/octave/@value{VERSION}} directory tree will not change, so it doesn't have to check their time stamps every time the functions defined in those files are used. This is normally a very good assumption and provides a significant improvement in performance for the function files that are distributed with Octave. If you know that your own function files will not change while you are running Octave, you can improve performance by setting the variable @code{ignore_function_time_stamp} to @code{"all"}, so that Octave will ignore the time stamps for all function files. Setting it to @code{"system"} gives the default behavior. If you set it to anything else, Octave will check the time stamps on all function files. @node Script Files, Dynamically Linked Functions, Function Files, Functions and Scripts @section Script Files A script file is a file containing (almost) any sequence of Octave commands. It is read and evaluated just as if you had typed each command at the Octave prompt, and provides a convenient way to perform a sequence of commands that do not logically belong inside a function. Unlike a function file, a script file must @emph{not} begin with the keyword @code{function}. If it does, Octave will assume that it is a function file, and that it defines a single function that should be evaluated as soon as it is defined. A script file also differs from a function file in that the variables named in a script file are not local variables, but are in the same scope as the other variables that are visible on the command line. Even though a script file may not begin with the @code{function} keyword, it is possible to define more than one function in a single script file and load (but not execute) all of them at once. To do this, the first token in the file (ignoring comments and other white space) must be something other than @code{function}. If you have no other statements to evaluate, you can use a statement that has no effect, like this: @example @group # Prevent Octave from thinking that this # is a function file: 1; # Define function one: function one () ... @end group @end example To have Octave read and compile these functions into an internal form, you need to make sure that the file is in Octave's @code{LOADPATH}, then simply type the base name of the file that contains the commands. (Octave uses the same rules to search for script files as it does to search for function files.) If the first token in a file (ignoring comments) is @code{function}, Octave will compile the function and try to execute it, printing a message warning about any non-whitespace characters that appear after the function definition. Note that Octave does not try to lookup the definition of any identifier until it needs to evaluate it. This means that Octave will compile the following statements if they appear in a script file, or are typed at the command line, @example @group # not a function file: 1; function foo () do_something (); endfunction function do_something () do_something_else (); endfunction @end group @end example @noindent even though the function @code{do_something} is not defined before it is referenced in the function @code{foo}. This is not an error because the Octave does not need to resolve all symbols that are referenced by a function until the function is actually evaluated. Since Octave doesn't look for definitions until they are needed, the following code will always print @samp{bar = 3} whether it is typed directly on the command line, read from a script file, or is part of a function body, even if there is a function or script file called @file{bar.m} in Octave's @code{LOADPATH}. @example @group eval ("bar = 3"); bar @end group @end example Code like this appearing within a function body could fool Octave if definitions were resolved as the function was being compiled. It would be virtually impossible to make Octave clever enough to evaluate this code in a consistent fashion. The parser would have to be able to perform the @samp{eval ()} statement at compile time, and that would be impossible unless all the references in the string to be evaluated could also be resolved, and requiring that would be too restrictive (the string might come from user input, or depend on things that are not known until the function is evaluated). @node Dynamically Linked Functions, Organization of Functions, Script Files, Functions and Scripts @section Dynamically Linked Functions On some systems, Octave can dynamically load and execute functions written in C++ or other compiled languages. This currently only works on systems that have a working version of the GNU dynamic linker, @code{dld}. Unfortunately, @code{dld} does not work on very many systems, but someone is working on making @code{dld} use the GNU Binary File Descriptor library, @code{BFD}, so that may soon change. In any case, it should not be too hard to make Octave's dynamic linking features work on other systems using system-specific dynamic linking facilities. Here is an example of how to write a C++ function that Octave can load. @example #include #include "defun-dld.h" #include "tree-const.h" DEFUN_DLD ("hello", Fhello, Shello, -1, -1, "hello (...)\n\ \n\ Print greeting followed by the values of all the arguments passed.\n\ Returns all the arguments passed.") @{ Octave_object retval; cerr << "Hello, world!\n"; int nargin = args.length (); for (int i = 1; i < nargin; i++) retval (nargin-i-1) = args(i).eval (1); return retval; @} @end example Octave's dynamic linking features currently have the following limitations. @itemize @bullet @item Dynamic linking only works on systems that support the GNU dynamic linker, @code{dld}. @item Clearing dynamically linked functions doesn't work. @item Configuring Octave with @code{--enable-lite-kernel} seems to mostly work to make nonessential built-in functions dynamically loaded, but there also seem to be some problems. For example, fsolve seems to always return @code{info == 3}. This is difficult to debug since @code{gdb} won't seem to allow breakpoints to be set inside dynamically loaded functions. @item Octave uses a lot of memory if the dynamically linked functions are compiled to include debugging symbols. This appears to be a limitation with @code{dld}, and can be avoided by not using @code{-g} to compile functions that will be linked dynamically. @end itemize If you would like to volunteer to help improve Octave's ability to dynamically link externally compiled functions, please contact @code{bug-octave@@che.utexas.edu}. @node Organization of Functions, , Dynamically Linked Functions, Functions and Scripts @section Organization of Functions Distributed with Octave Many of Octave's standard functions are distributed as function files. They are loosely organized by topic, in subdirectories of @file{OCTAVE_HOME/lib/octave/VERSION/m}, to make it easier to find them. The following is a list of all the function file subdirectories, and the types of functions you will find there. @table @file @item control Functions for design and simulation of automatic control systems. @item elfun Elementary functions. @item general Miscellaneous matrix manipulations, like @code{flipud}, @code{rot90}, and @code{triu}, as well as other basic functions, like @code{is_matrix}, @code{nargchk}, etc. @item image Image processing tools. These functions require the X Window System. @item linear-algebra Functions for linear algebra. @item miscellaneous Functions that don't really belong anywhere else. @item plot A set of functions that implement the @sc{Matlab}-like plotting functions. @item polynomial Functions for manipulating polynomials. @item set Functions for creating and manipulating sets of unique values. @item signal Functions for signal processing applications. @item specfun Special functions. @item special-matrix Functions that create special matrix forms. @item startup Octave's system-wide startup file. @item statistics Statistical functions. @item strings Miscellaneous string-handling functions. @end table @xref{User Preferences} for an explanation of the built-in variable @code{LOADPATH}, and @ref{Function Files} for a description of the way Octave resolves undefined variable and function names. octave-1.1.0/doc/gnuinfo.texi100666 415 17 123617 5705073512 14322 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @c This file is meant to be included in any arbitrary piece of @c documentation that wishes to describe the info program. Some day @c info-stnd.texi should probably use this file instead of duplicating @c its contents. @c @c This file documents the use of the standalone GNU Info program, @c versions 2.7 and later. @node Using Info, Concept Index, Command Line Editing, Top @appendix Using Info @menu * Cursor Commands:: * Scrolling Commands:: * Node Commands:: * Searching Commands:: * Xref Commands:: * Window Commands:: * Printing Nodes:: * Other Info Commands:: * Info Variables:: @end menu @dfn{Info} is a program which is used to view info files on an ASCII terminal. @dfn{info files} are the result of processing texinfo files with the program @code{makeinfo} or with the Emacs command @code{M-x texinfo-format-buffer}. Finally, @dfn{texinfo} is a documentation language which allows a printed manual and on-line documentation (an info file) to be produced from a single source file. @menu * Cursor Commands:: Commands which move the cursor within a node. * Scrolling Commands:: Commands for moving the node around in a window. * Node Commands:: Commands for selecting a new node. * Searching Commands:: Commands for searching an info file. * Xref Commands:: Commands for selecting cross references. * Window Commands:: Commands which manipulate multiple windows. * Printing Nodes:: How to print out the contents of a node. * Other Info Commands:: A few commands that defy categories. * Info Variables:: How to change the default behavior of Info. @end menu @node Cursor Commands, Scrolling Commands, Using Info, Using Info @appendixsec Moving the Cursor @cindex cursor, moving Many people find that reading screens of text page by page is made easier when one is able to indicate particular pieces of text with some kind of pointing device. Since this is the case, GNU Info (both the Emacs and standalone versions) have several commands which allow you to move the cursor about the screen. The notation used in this manual to describe keystrokes is identical to the notation used within the Emacs manual, and the GNU Readline manual. @xref{Characters, , Character Conventions, emacs, the GNU Emacs Manual}, if you are unfamiliar with the notation. The following table lists the basic cursor movement commands in Info. Each entry consists of the key sequence you should type to execute the cursor movement, the @code{M-x}@footnote{@code{M-x} is also a command; it invokes @code{execute-extended-command}. @xref{M-x, , Executing an extended command, emacs, the GNU Emacs Manual}, for more detailed information.} command name (displayed in parentheses), and a short description of what the command does. All of the cursor motion commands can take an @dfn{numeric} argument (@pxref{Other Info Commands, @code{universal-argument}}), to find out how to supply them. With a numeric argument, the motion commands are simply executed that many times; for example, a numeric argument of 4 given to @code{next-line} causes the cursor to move down 4 lines. With a negative numeric argument, the motion is reversed; an argument of -4 given to the @code{next-line} command would cause the cursor to move @emph{up} 4 lines. @table @asis @item @code{C-n} (@code{next-line}) @kindex C-n, in Info windows @findex next-line Moves the cursor down to the next line. @item @code{C-p} (@code{prev-line}) @kindex C-p, in Info windows @findex prev-line Move the cursor up to the previous line. @item @code{C-a} (@code{beginning-of-line}) @kindex C-a, in Info windows @findex beginning-of-line Move the cursor to the start of the current line. @item @code{C-e} (@code{end-of-line}) @kindex C-e, in Info windows @findex end-of-line Moves the cursor to the end of the current line. @item @code{C-f} (@code{forward-char}) @kindex C-f, in Info windows @findex forward-char Move the cursor forward a character. @item @code{C-b} (@code{backward-char}) @kindex C-b, in Info windows @findex backward-char Move the cursor backward a character. @item @code{M-f} (@code{forward-word}) @kindex M-f, in Info windows @findex forward-word Moves the cursor forward a word. @item @code{M-b} (@code{backward-word}) @kindex M-b, in Info windows @findex backward-word Moves the cursor backward a word. @item @code{M-<} (@code{beginning-of-node}) @itemx @code{b} @kindex b, in Info windows @kindex M-<, in Info windows @findex beginning-of-node Moves the cursor to the start of the current node. @item @code{M->} (@code{end-of-node}) @kindex M->, in Info windows @findex end-of-node Moves the cursor to the end of the current node. @item @code{M-r} (@code{move-to-window-line}) @kindex M-r, in Info windows @findex move-to-window-line Moves the cursor to a specific line of the window. Without a numeric argument, @code{M-r} moves the cursor to the start of the line in the center of the window. With a numeric argument of @var{n}, @code{M-r} moves the cursor to the start of the @var{n}th line in the window. @end table @node Scrolling Commands, Node Commands, Cursor Commands, Using Info @appendixsec Moving Text Within a Window @cindex scrolling, in Info windows Sometimes you are looking at a screenful of text, and only part of the current paragraph you are reading is visible on the screen. The commands detailed in this section are used to shift which part of the current node is visible on the screen. @table @asis @item @code{SPC} (@code{scroll-forward}) @itemx @code{C-v} @kindex SPC, in Info windows @kindex C-v, in Info windows @findex scroll-forward Shift the text in this window up. That is, show more of the node which is currently below the bottom of the window. With a numeric argument, show that many more lines at the bottom of the window; a numeric argument of 4 would shift all of the text in the window up 4 lines (discarding the top 4 lines), and show you four new lines at the bottom of the window. Without a numeric argument, @key{SPC} takes the bottom two lines of the window and places them at the top of the window, redisplaying almost a completely new screenful of lines. @item @code{DEL} (@code{scroll-backward}) @itemx @code{M-v} @kindex DEL, in Info windows @kindex M-v, in Info windows @findex scroll-backward Shift the text in this window down. The inverse of @code{scroll-forward}. @end table @cindex scrolling through node structure The @code{scroll-forward} and @code{scroll-backward} commands can also move forward and backward through the node structure of the file. If you press @key{SPC} while viewing the end of a node, or @key{DEL} while viewing the beginning of a node, what happens is controlled by the variable @code{scroll-behaviour}. @xref{Info Variables, @code{scroll-behaviour}}, for more information. @table @asis @item @code{C-l} (@code{redraw-display}) @kindex C-l, in Info windows @findex redraw-display Redraw the display from scratch, or shift the line containing the cursor to a specified location. With no numeric argument, @samp{C-l} clears the screen, and then redraws its entire contents. Given a numeric argument of @var{n}, the line containing the cursor is shifted so that it is on the @var{n}th line of the window. @item @code{C-x w} (@code{toggle-wrap}) @kindex C-w, in Info windows @findex toggle-wrap Toggles the state of line wrapping in the current window. Normally, lines which are longer than the screen width @dfn{wrap}, i.e., they are continued on the next line. Lines which wrap have a @samp{\} appearing in the rightmost column of the screen. You can cause such lines to be terminated at the rightmost column by changing the state of line wrapping in the window with @code{C-x w}. When a line which needs more space than one screen width to display is displayed, a @samp{$} appears in the rightmost column of the screen, and the remainder of the line is invisible. @end table @node Node Commands, Searching Commands, Scrolling Commands, Using Info @appendixsec Selecting a New Node @cindex nodes, selection of in Info windows This section details the numerous Info commands which select a new node to view in the current window. The most basic node commands are @samp{n}, @samp{p}, @samp{u}, and @samp{l}. When you are viewing a node, the top line of the node contains some Info @dfn{pointers} which describe where the next, previous, and up nodes are. Info uses this line to move about the node structure of the file when you use the following commands: @table @asis @item @code{n} (@code{next-node}) @kindex n, in Info windows @findex next-node Selects the `Next' node. @item @code{p} (@code{prev-node}) @kindex p, in Info windows @findex prev-node Selects the `Prev' node. @item @code{u} (@code{up-node}) @kindex u, in Info windows @findex up-node Selects the `Up' node. @end table You can easily select a node that you have already viewed in this window by using the @samp{l} command -- this name stands for "last", and actually moves through the list of already visited nodes for this window. @samp{l} with a negative numeric argument moves forward through the history of nodes for this window, so you can quickly step between two adjacent (in viewing history) nodes. @table @asis @item @code{l} (@code{history-node}) @kindex l, in Info windows @findex history-node Selects the most recently selected node in this window. @end table Two additional commands make it easy to select the most commonly selected nodes; they are @samp{t} and @samp{d}. @table @asis @item @code{t} (@code{top-node}) @kindex t, in Info windows @findex top-node Selects the node @samp{Top} in the current info file. @item @code{d} (@code{dir-node}) @kindex d, in Info windows @findex dir-node Selects the directory node (i.e., the node @samp{(dir)}). @end table Here are some other commands which immediately result in the selection of a different node in the current window: @table @asis @item @code{<} (@code{first-node}) @kindex <, in Info windows @findex first-node Selects the first node which appears in this file. This node is most often @samp{Top}, but it doesn't have to be. @item @code{>} (@code{last-node}) @kindex >, in Info windows @findex last-node Selects the last node which appears in this file. @item @code{]} (@code{global-next-node}) @kindex ], in Info windows @findex global-next-node Moves forward or down through node structure. If the node that you are currently viewing has a @samp{Next} pointer, that node is selected. Otherwise, if this node has a menu, the first menu item is selected. If there is no @samp{Next} and no menu, the same process is tried with the @samp{Up} node of this node. @item @code{[} (@code{global-prev-node}) @kindex [, in Info windows @findex global-prev-node Moves backward or up through node structure. If the node that you are currently viewing has a @samp{Prev} pointer, that node is selected. Otherwise, if the node has an @samp{Up} pointer, that node is selected, and if it has a menu, the last item in the menu is selected. @end table You can get the same behavior as @code{global-next-node} and @code{global-prev-node} while simply scrolling through the file with @key{SPC} and @key{DEL}; @xref{Info Variables, @code{scroll-behaviour}}, for more information. @table @asis @item @code{g} (@code{goto-node}) @kindex g, in Info windows @findex goto-node Reads the name of a node and selects it. No completion is done while reading the node name, since the desired node may reside in a separate file. The node must be typed exactly as it appears in the info file. A file name may be included as with any node specification, for example @example @code{g(emacs)Buffers} @end example finds the node @samp{Buffers} in the info file @file{emacs}. @item @code{C-x k} (@code{kill-node}) @kindex C-x k, in Info windows @findex kill-node Kills a node. The node name is prompted for in the echo area, with a default of the current node. @dfn{Killing} a node means that Info tries hard to forget about it, removing it from the list of history nodes kept for the window where that node is found. Another node is selected in the window which contained the killed node. @item @code{C-x C-f} (@code{view-file}) @kindex C-x C-f, in Info windows @findex view-file Reads the name of a file and selects the entire file. The command @example @code{C-x C-f @var{filename}} @end example is equivalent to typing @example @code{g(@var{filename})*} @end example @item @code{C-x C-b} (@code{list-visited-nodes}) @kindex C-x C-b, in Info windows @findex list-visited-nodes Makes a window containing a menu of all of the currently visited nodes. This window becomes the selected window, and you may use the standard Info commands within it. @item @code{C-x b} (@code{select-visited-node}) @kindex C-x b, in Info windows @findex select-visited-node Selects a node which has been previously visited in a visible window. This is similar to @samp{C-x C-b} followed by @samp{m}, but no window is created. @end table @node Searching Commands, Xref Commands, Node Commands, Using Info @appendixsec Searching an Info File @cindex searching GNU Info allows you to search for a sequence of characters throughout an entire info file, search through the indices of an info file, or find areas within an info file which discuss a particular topic. @table @asis @item @code{s} (@code{search}) @kindex s, in Info windows @findex search Reads a string in the echo area and searches for it. @item @code{C-s} (@code{isearch-forward}) @kindex C-s, in Info windows @findex isearch-forward Interactively searches forward through the info file for a string as you type it. @item @code{C-r} (@code{isearch-backward}) @kindex C-r, in Info windows @findex isearch-backward Interactively searches backward through the info file for a string as you type it. @item @code{i} (@code{index-search}) @kindex i, in Info windows @findex index-search Looks up a string in the indices for this info file, and selects a node where the found index entry points to. @item @code{,} (@code{next-index-match}) @kindex , in Info windows @findex next-index-match Moves to the node containing the next matching index item from the last @samp{i} command. @end table The most basic searching command is @samp{s} (@code{search}). The @samp{s} command prompts you for a string in the echo area, and then searches the remainder of the info file for an occurrence of that string. If the string is found, the node containing it is selected, and the cursor is left positioned at the start of the found string. Subsequent @samp{s} commands show you the default search string within @samp{[} and @samp{]}; pressing @key{RET} instead of typing a new string will use the default search string. @dfn{Incremental searching} is similar to basic searching, but the string is looked up while you are typing it, instead of waiting until the entire search string has been specified. @node Xref Commands, Window Commands, Searching Commands, Using Info @appendixsec Selecting Cross References We have already discussed the @samp{Next}, @samp{Prev}, and @samp{Up} pointers which appear at the top of a node. In addition to these pointers, a node may contain other pointers which refer you to a different node, perhaps in another info file. Such pointers are called @dfn{cross references}, or @dfn{xrefs} for short. @menu * Parts of an Xref:: What a cross reference is made of. * Selecting Xrefs:: Commands for selecting menu or note items. @end menu @node Parts of an Xref, Selecting Xrefs, Xref Commands, Xref Commands @appendixsubsec Parts of an Xref Cross references have two major parts: the first part is called the @dfn{label}; it is the name that you can use to refer to the cross reference, and the second is the @dfn{target}; it is the full name of the node that the cross reference points to. The target is separated from the label by a colon @samp{:}; first the label appears, and then the target. For example, in the sample menu cross reference below, the single colon separates the label from the target. @example * Foo Label: Foo Target. More information about Foo. @end example Note the @samp{.} which ends the name of the target. The @samp{.} is not part of the target; it serves only to let Info know where the target name ends. A shorthand way of specifying references allows two adjacent colons to stand for a target name which is the same as the label name: @example * Foo Commands:: Commands pertaining to Foo. @end example In the above example, the name of the target is the same as the name of the label, in this case @code{Foo Commands}. You will normally see two types of cross references while viewing nodes: @dfn{menu} references, and @dfn{note} references. Menu references appear within a node's menu; they begin with a @samp{*} at the beginning of a line, and continue with a label, a target, and a comment which describes what the contents of the node pointed to contains. Note references appear within the body of the node text; they begin with @code{*Note}, and continue with a label and a target. Like @samp{Next}, @samp{Prev} and @samp{Up} pointers, cross references can point to any valid node. They are used to refer you to a place where more detailed information can be found on a particular subject. Here is a cross reference which points to a node within the Texinfo documentation: @xref{xref, , Writing an Xref, texinfo, the Texinfo Manual}, for more information on creating your own texinfo cross references. @node Selecting Xrefs, , Parts of an Xref, Xref Commands @appendixsubsec Selecting Xrefs The following table lists the Info commands which operate on menu items. @table @asis @item @code{1} (@code{menu-digit}) @itemx @code{2} @dots{} @code{9} @cindex 1 @dots{} 9, in Info windows @kindex 1 @dots{} 9, in Info windows @findex menu-digit Within an Info window, pressing a single digit, (such as @samp{1}), selects that menu item, and places its node in the current window. For convenience, there is one exception; pressing @samp{0} selects the @emph{last} item in the node's menu. @item @code{0} (@code{last-menu-item}) @kindex 0, in Info windows @findex last-menu-item Select the last item in the current node's menu. @item @code{m} (@code{menu-item}) @kindex m, in Info windows @findex menu-item Reads the name of a menu item in the echo area and selects its node. Completion is available while reading the menu label. @item @code{M-x find-menu} @findex find-menu Moves the cursor to the start of this node's menu. @end table This table lists the Info commands which operate on note cross references. @table @asis @item @code{f} (@code{xref-item}) @itemx @code{r} @kindex f, in Info windows @kindex r, in Info windows @findex xref-item Reads the name of a note cross reference in the echo area and selects its node. Completion is available while reading the cross reference label. @end table Finally, the next few commands operate on menu or note references alike: @table @asis @item @code{TAB} (@code{move-to-next-xref}) @kindex TAB, in Info windows @findex move-to-next-xref Moves the cursor to the start of the next nearest menu item or note reference in this node. You can then use @key{RET} (@code{select-reference-this-line} to select the menu or note reference. @item @code{M-TAB} (@code{move-to-prev-xref}) @kindex M-TAB, in Info windows @findex move-to-prev-xref Moves the cursor the start of the nearest previous menu item or note reference in this node. @item @code{RET} (@code{select-reference-this-line}) @kindex RET, in Info windows @findex select-reference-this-line Selects the menu item or note reference appearing on this line. @end table @node Window Commands, Printing Nodes, Xref Commands, Using Info @appendixsec Manipulating Multiple Windows @cindex windows, manipulating A @dfn{window} is a place to show the text of a node. Windows have a view area where the text of the node is displayed, and an associated @dfn{mode line}, which briefly describes the node being viewed. GNU Info supports multiple windows appearing in a single screen; each window is separated from the next by its modeline. At any time, there is only one @dfn{active} window, that is, the window in which the cursor appears. There are commands available for creating windows, changing the size of windows, selecting which window is active, and for deleting windows. @menu * The Mode Line:: What appears in the mode line? * Basic Windows:: Manipulating windows in Info. * The Echo Area:: Used for displaying errors and reading input. @end menu @node The Mode Line, Basic Windows, Window Commands, Window Commands @appendixsubsec The Mode Line A @dfn{mode line} is a line of inverse video which appears at the bottom of an info window. It describes the contents of the window just above it; this information includes the name of the file and node appearing in that window, the number of screen lines it takes to display the node, and the percentage of text that is above the top of the window. It can also tell you if the indirect tags table for this info file needs to be updated, and whether or not the info file was compressed when stored on disk. Here is a sample mode line for a window containing an uncompressed file named @file{dir}, showing the node @samp{Top}. @example -----Info: (dir)Top, 40 lines --Top--------------------------------------- ^^ ^ ^^^ ^^ (file)Node #lines where @end example When a node comes from a file which is compressed on disk, this is indicated in the mode line with two small @samp{z}'s. In addition, if the info file containing the node has been split into subfiles, the name of the subfile containing the node appears in the modeline as well: @example --zz-Info: (emacs)Top, 291 lines --Top-- Subfile: emacs-1.Z--------------- @end example When Info makes a node internally, such that there is no corresponding info file on disk, the name of the node is surrounded by asterisks (@samp{*}). The name itself tells you what the contents of the window are; the sample mode line below shows an internally constructed node showing possible completions: @example -----Info: *Completions*, 7 lines --All----------------------------------- @end example @node Basic Windows, The Echo Area, The Mode Line, Window Commands @appendixsubsec Window Commands It can be convenient to view more than one node at a time. To allow this, Info can display more than one @dfn{window}. Each window has its own mode line (@pxref{The Mode Line}) and history of nodes viewed in that window (@pxref{Node Commands, , @code{history-node}}). @table @asis @item @code{C-x o} (@code{next-window}) @cindex windows, selecting @kindex C-x o, in Info windows @findex next-window Selects the next window on the screen. Note that the echo area can only be selected if it is already in use, and you have left it temporarily. Normally, @samp{C-x o} simply moves the cursor into the next window on the screen, or if you are already within the last window, into the first window on the screen. Given a numeric argument, @samp{C-x o} moves over that many windows. A negative argument causes @samp{C-x o} to select the previous window on the screen. @item @code{M-x prev-window} @findex prev-window Selects the previous window on the screen. This is identical to @samp{C-x o} with a negative argument. @item @code{C-x 2} (@code{split-window}) @cindex windows, creating @kindex C-x 2, in Info windows @findex split-window Splits the current window into two windows, both showing the same node. Each window is one half the size of the original window, and the cursor remains in the original window. The variable @code{automatic-tiling} can cause all of the windows on the screen to be resized for you automatically, please @pxref{Info Variables, , automatic-tiling} for more information. @item @code{C-x 0} (@code{delete-window}) @cindex windows, deleting @kindex C-x 0, in Info windows @findex delete-window Deletes the current window from the screen. If you have made too many windows and your screen appears cluttered, this is the way to get rid of some of them. @item @code{C-x 1} (@code{keep-one-window}) @kindex C-x 1, in Info windows @findex keep-one-window Deletes all of the windows excepting the current one. @item @code{ESC C-v} (@code{scroll-other-window}) @kindex ESC C-v, in Info windows @findex scroll-other-window Scrolls the other window, in the same fashion that @samp{C-v} might scroll the current window. Given a negative argument, the "other" window is scrolled backward. @item @code{C-x ^} (@code{grow-window}) @kindex C-x ^, in Info windows @findex grow-window Grows (or shrinks) the current window. Given a numeric argument, grows the current window that many lines; with a negative numeric argument, the window is shrunk instead. @item @code{C-x t} (@code{tile-windows}) @cindex tiling @kindex C-x t, in Info windows @findex tile-windows Divides the available screen space among all of the visible windows. Each window is given an equal portion of the screen in which to display its contents. The variable @code{automatic-tiling} can cause @code{tile-windows} to be called when a window is created or deleted. @xref{Info Variables, , @code{automatic-tiling}}. @end table @node The Echo Area, , Basic Windows, Window Commands @appendixsubsec The Echo Area @cindex echo area The @dfn{echo area} is a one line window which appears at the bottom of the screen. It is used to display informative or error messages, and to read lines of input from you when that is necessary. Almost all of the commands available in the echo area are identical to their Emacs counterparts, so please refer to that documentation for greater depth of discussion on the concepts of editing a line of text. The following table briefly lists the commands that are available while input is being read in the echo area: @table @asis @item @code{C-f} (@code{echo-area-forward}) @kindex C-f, in the Info echo area @findex echo-area-forward Moves forward a character. @item @code{C-b} (@code{echo-area-backward}) @kindex C-b, in the Info echo area @findex echo-area-backward Moves backward a character. @item @code{C-a} (@code{echo-area-beg-of-line}) @kindex C-a, in the Info echo area @findex echo-area-beg-of-line Moves to the start of the input line. @item @code{C-e} (@code{echo-area-end-of-line}) @kindex C-e, in the Info echo area @findex echo-area-end-of-line Moves to the end of the input line. @item @code{M-f} (@code{echo-area-forward-word}) @kindex M-f, in the Info echo area @findex echo-area-forward-word Moves forward a word. @item @code{M-b} (@code{echo-area-backward-word}) @kindex M-b, in the Info echo area @findex echo-area-backward-word Moves backward a word. @item @code{C-d} (@code{echo-area-delete}) @kindex C-d, in the Info echo area @findex echo-area-delete Deletes the character under the cursor. @item @code{DEL} (@code{echo-area-rubout}) @kindex DEL, in the Info echo area @findex echo-area-rubout Deletes the character behind the cursor. @item @code{C-g} (@code{echo-area-abort}) @kindex C-g, in the Info echo area @findex echo-area-abort Cancels or quits the current operation. If completion is being read, @samp{C-g} discards the text of the input line which does not match any completion. If the input line is empty, @samp{C-g} aborts the calling function. @item @code{RET} (@code{echo-area-newline}) @kindex RET, in the Info echo area @findex echo-area-newline Accepts (or forces completion of) the current input line. @item @code{C-q} (@code{echo-area-quoted-insert}) @kindex C-q, in the Info echo area @findex echo-area-quoted-insert Inserts the next character verbatim. This is how you can insert control characters into a search string, for example. @item @var{printing character} (@code{echo-area-insert}) @kindex printing characters, in the Info echo area @findex echo-area-insert Inserts the character. @item @code{M-TAB} (@code{echo-area-tab-insert}) @kindex M-TAB, in the Info echo area @findex echo-area-tab-insert Inserts a TAB character. @item @code{C-t} (@code{echo-area-transpose-chars}) @kindex C-t, in the Info echo area @findex echo-area-transpose-chars Transposes the characters at the cursor. @end table The next group of commands deal with @dfn{killing}, and @dfn{yanking} text. For an in depth discussion of killing and yanking, @pxref{Killing, , Killing and Deleting, emacs, the GNU Emacs Manual} @table @asis @item @code{M-d} (@code{echo-area-kill-word}) @kindex M-d, in the Info echo area @findex echo-area-kill-word Kills the word following the cursor. @item @code{M-DEL} (@code{echo-area-backward-kill-word}) @kindex M-DEL, in the Info echo area @findex echo-area-backward-kill-word Kills the word preceding the cursor. @item @code{C-k} (@code{echo-area-kill-line}) @kindex C-k, in the Info echo area @findex echo-area-kill-line Kills the text from the cursor to the end of the line. @item @code{C-x DEL} (@code{echo-area-backward-kill-line}) @kindex C-x DEL, in the Info echo area @findex echo-area-backward-kill-line Kills the text from the cursor to the beginning of the line. @item @code{C-y} (@code{echo-area-yank}) @kindex C-y, in the Info echo area @findex echo-area-yank Yanks back the contents of the last kill. @item @code{M-y} (@code{echo-area-yank-pop}) @kindex M-y, in the Info echo area @findex echo-area-yank-pop Yanks back a previous kill, removing the last yanked text first. @end table Sometimes when reading input in the echo area, the command that needed input will only accept one of a list of several choices. The choices represent the @dfn{possible completions}, and you must respond with one of them. Since there are a limited number of responses you can make, Info allows you to abbreviate what you type, only typing as much of the response as is necessary to uniquely identify it. In addition, you can request Info to fill in as much of the response as is possible; this is called @dfn{completion}. The following commands are available when completing in the echo area: @table @asis @item @code{TAB} (@code{echo-area-complete}) @itemx @code{SPC} @kindex TAB, in the Info echo area @kindex SPC, in the Info echo area @findex echo-area-complete Inserts as much of a completion as is possible. @item @code{?} (@code{echo-area-possible-completions}) @kindex ?, in the Info echo area @findex echo-area-possible-completions Displays a window containing a list of the possible completions of what you have typed so far. For example, if the available choices are: @example bar foliate food forget @end example and you have typed an @samp{f}, followed by @samp{?}, the possible completions would contain: @example foliate food forget @end example i.e., all of the choices which begin with @samp{f}. Pressing @key{SPC} or @key{TAB} would result in @samp{fo} appearing in the echo area, since all of the choices which begin with @samp{f} continue with @samp{o}. Now, typing @samp{l} followed by @samp{TAB} results in @samp{foliate} appearing in the echo area, since that is the only choice which begins with @samp{fol}. @item @code{ESC C-v} (@code{echo-area-scroll-completions-window}) @kindex ESC C-v, in the Info echo area @findex echo-area-scroll-completions-window Scrolls the completions window, if that is visible, or the "other" window if not. @end table @node Printing Nodes, Other Info Commands, Window Commands, Using Info @appendixsec Printing Out Nodes @cindex printing You may wish to print out the contents of a node as a quick reference document for later use. Info provides you with a command for doing this. In general, we recommend that you use @TeX{} to format the document and print sections of it, by running @code{tex} on the texinfo source file. @table @asis @item @code{M-x print-node} @findex print-node @cindex INFO_PRINT_COMMAND, environment variable Pipes the contents of the current node through the command in the environment variable @code{INFO_PRINT_COMMAND}. If the variable doesn't exist, the node is simply piped to @code{lpr}. @end table @node Other Info Commands, Info Variables, Printing Nodes, Using Info @appendixsec Miscellaneous Info Commands GNU Info contains several commands which self-document GNU Info: @table @asis @item @code{M-x describe-command} @cindex functions, describing @cindex commands, describing @findex describe-command Reads the name of an Info command in the echo area and then displays a brief description of what that command does. @item @code{M-x describe-key} @cindex keys, describing @findex describe-key Reads a key sequence in the echo area, and then displays the name and documentation of the Info command that the key sequence invokes. @item @code{M-x describe-variable} Reads the name of a variable in the echo area and then displays a brief description of what the variable affects. @item @code{M-x where-is} @findex where-is Reads the name of an Info command in the echo area, and then displays a key sequence which can be typed in order to invoke that command. @item @code{C-h} (@code{get-help-window}) @itemx @code{?} @kindex C-h, in Info windows @kindex ?, in Info windows @findex get-help-window Creates (or moves into) the window displaying @code{*Help*}, and places a node containing a quick reference card into it. This window displays the most concise information about GNU Info available. @item @code{h} (@code{get-info-help-node}) @kindex h, in Info windows @findex get-info-help-node Tries hard to visit the node @code{(info)Help}. The info file @file{info.texi} distributed with GNU Info contains this node. Of course, the file must first be processed with @code{makeinfo}, and then placed into the location of your info directory. @end table Here are the commands for creating a numeric argument: @table @asis @item @code{C-u} (@code{universal-argument}) @cindex numeric arguments @kindex C-u, in Info windows @findex universal-argument Starts (or multiplies by 4) the current numeric argument. @samp{C-u} is a good way to give a small numeric argument to cursor movement or scrolling commands; @samp{C-u C-v} scrolls the screen 4 lines, while @samp{C-u C-u C-n} moves the cursor down 16 lines. @item @code{M-1} (@code{add-digit-to-numeric-arg}) @itemx @code{M-2} @dots{} @code{M-9} @kindex M-1 @dots{} M-9, in Info windows @findex add-digit-to-numeric-arg Adds the digit value of the invoking key to the current numeric argument. Once Info is reading a numeric argument, you may just type the digits of the argument, without the Meta prefix. For example, you might give @samp{C-l} a numeric argument of 32 by typing: @example @kbd{C-u 3 2 C-l} @end example or @example @kbd{M-3 2 C-l} @end example @end table @samp{C-g} is used to abort the reading of a multi-character key sequence, to cancel lengthy operations (such as multi-file searches) and to cancel reading input in the echo area. @table @asis @item @code{C-g} (@code{abort-key}) @cindex cancelling typeahead @cindex cancelling the current operation @kindex C-g, in Info windows @findex abort-key Cancels current operation. @end table The @samp{q} command of Info simply quits running Info. @table @asis @item @code{q} (@code{quit}) @cindex quitting @kindex q, in Info windows @findex quit Exits GNU Info. @end table If the operating system tells GNU Info that the screen is 60 lines tall, and it is actually only 40 lines tall, here is a way to tell Info that the operating system is correct. @table @asis @item @code{M-x set-screen-height} @findex set-screen-height @cindex screen, changing the height of Reads a height value in the echo area and sets the height of the displayed screen to that value. @end table Finally, Info provides a convenient way to display footnotes which might be associated with the current node that you are viewing: @table @asis @item @code{ESC C-f} (@code{show-footnotes}) @kindex ESC C-f, in Info windows @findex show-footnotes @cindex footnotes, displaying Shows the footnotes (if any) associated with the current node in another window. You can have Info automatically display the footnotes associated with a node when the node is selected by setting the variable @code{automatic-footnotes}. @xref{Info Variables, , @code{automatic-footnotes}}. @end table @node Info Variables, , Other Info Commands, Using Info @appendixsec Manipulating Variables GNU Info contains several @dfn{variables} whose values are looked at by various Info commands. You can change the values of these variables, and thus change the behavior of Info to more closely match your environment and info file reading manner. @table @asis @item @code{M-x set-variable} @cindex variables, setting @findex set-variable Reads the name of a variable, and the value for it, in the echo area and then sets the variable to that value. Completion is available when reading the variable name; often, completion is available when reading the value to give to the variable, but that depends on the variable itself. If a variable does @emph{not} supply multiple choices to complete over, it expects a numeric value. @item @code{M-x describe-variable} @cindex variables, describing @findex describe-variable Reads the name of a variable in the echo area and then displays a brief description of what the variable affects. @end table Here is a list of the variables that you can set in Info. @table @code @item automatic-footnotes @vindex automatic-footnotes When set to @code{On}, footnotes appear and disappear automatically. This variable is @code{On} by default. When a node is selected, a window containing the footnotes which appear in that node is created, and the footnotes are displayed within the new window. The window that Info creates to contain the footnotes is called @samp{*Footnotes*}. If a node is selected which contains no footnotes, and a @samp{*Footnotes*} window is on the screen, the @samp{*Footnotes*} window is deleted. Footnote windows created in this fashion are not automatically tiled so that they can use as little of the display as is possible. @item automatic-tiling @vindex automatic-tiling When set to @code{On}, creating or deleting a window resizes other windows. This variable is @code{Off} by default. Normally, typing @samp{C-x 2} divides the current window into two equal parts. When @code{automatic-tiling} is set to @code{On}, all of the windows are resized automatically, keeping an equal number of lines visible in each window. There are exceptions to the automatic tiling; specifically, the windows @samp{*Completions*} and @samp{*Footnotes*} are @emph{not} resized through automatic tiling; they remain their original size. @item visible-bell @vindex visible-bell When set to @code{On}, GNU Info attempts to flash the screen instead of ringing the bell. This variable is @code{Off} by default. Of course, Info can only flash the screen if the terminal allows it; in the case that the terminal does not allow it, the setting of this variable has no effect. However, you can make Info perform quietly by setting the @code{errors-ring-bell} variable to @code{Off}. @item errors-ring-bell @vindex errors-ring-bell When set to @code{On}, errors cause the bell to ring. The default setting of this variable is @code{On}. @item gc-compressed-files @vindex gc-compressed-files When set to @code{On}, Info garbage collects files which had to be uncompressed. The default value of this variable is @code{Off}. Whenever a node is visited in Info, the info file containing that node is read into core, and Info reads information about the tags and nodes contained in that file. Once the tags information is read by Info, it is never forgotten. However, the actual text of the nodes does not need to remain in core unless a particular info window needs it. For non-compressed files, the text of the nodes does not remain in core when it is no longer in use. But de-compressing a file can be a time consuming operation, and so Info tries hard not to do it twice. @code{gc-compressed-files} tells Info it is okay to garbage collect the text of the nodes of a file which was compressed on disk. @item show-index-match @vindex show-index-match When set to @code{On}, the portion of the matched search string is highlighted in the message which explains where the matched search string was found. The default value of this variable is @code{On}. When Info displays the location where an index match was found, (@pxref{Searching Commands, , @code{next-index-match}}), the portion of the string that you had typed is highlighted by displaying it in the inverse case from its surrounding characters. @item scroll-behaviour @vindex scroll-behaviour Controls what happens when forward scrolling is requested at the end of a node, or when backward scrolling is requested at the beginning of a node. The default value for this variable is @code{Continuous}. There are three possible values for this variable: @table @code @item Continuous Tries to get the first item in this node's menu, or failing that, the @samp{Next} node, or failing that, the @samp{Next} of the @samp{Up}. This behavior is identical to using the @samp{]} (@code{global-next-node}) and @samp{[} (@code{global-prev-node}) commands. @item Next Only Only tries to get the @samp{Next} node. @item Page Only Simply gives up, changing nothing. If @code{scroll-behaviour} is @code{Page Only}, no scrolling command can change the node that is being viewed. @end table @item scroll-step @vindex scroll-step The number of lines to scroll when the cursor moves out of the window. Scrolling happens automatically if the cursor has moved out of the visible portion of the node text when it is time to display. Usually the scrolling is done so as to put the cursor on the center line of the current window. However, if the variable @code{scroll-step} has a nonzero value, Info attempts to scroll the node text by that many lines; if that is enough to bring the cursor back into the window, that is what is done. The default value of this variable is 0, thus placing the cursor (and the text it is attached to) in the center of the window. Setting this variable to 1 causes a kind of "smooth scrolling" which some people prefer. @item ISO-Latin @cindex ISO Latin characters @vindex ISO-Latin When set to @code{On}, Info accepts and displays ISO Latin characters. By default, Info assumes an ASCII character set. @code{ISO-Latin} tells Info that it is running in an environment where the European standard character set is in use, and allows you to input such characters to Info, as well as display them. @end table octave-1.1.0/doc/gpl.texi100666 415 17 44133 5705073530 13412 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @cindex warranty @cindex copyright @node Copying, Introduction, Preface, Top @unnumbered GNU GENERAL PUBLIC LICENSE @center Version 2, June 1991 @display Copyright @copyright{} 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. @end display @unnumberedsec 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. @iftex @unnumberedsec TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end iftex @ifinfo @center TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION @end ifinfo @enumerate 0 @item 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. @item 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. @item 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: @enumerate a @item You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. @item 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. @item 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.) @end enumerate 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. @item 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: @enumerate a @item 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, @item 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, @item 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.) @end enumerate 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. @item 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. @item 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. @item 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. @item 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. @item 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. @item 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. @item 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. @iftex @heading NO WARRANTY @end iftex @ifinfo @center NO WARRANTY @end ifinfo @item 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. @item 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 enumerate @iftex @heading END OF TERMS AND CONDITIONS @end iftex @ifinfo @center END OF TERMS AND CONDITIONS @end ifinfo @page @unnumberedsec Appendix: 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. @smallexample @var{one line to give the program's name and a brief idea of what it does.} Copyright (C) 19@var{yy} @var{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., 675 Mass Ave, Cambridge, MA 02139, USA. @end smallexample 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: @smallexample Gnomovision version 69, Copyright (C) 19@var{yy} @var{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. @end smallexample The hypothetical commands @samp{show w} and @samp{show c} should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than @samp{show w} and @samp{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: @example Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. @var{signature of Ty Coon}, 1 April 1989 Ty Coon, President of Vice @end example 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. octave-1.1.0/doc/help.texi100666 415 17 2055 5705073515 13540 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Help, Programming Utilities, Command History Functions, Top @chapter Help @findex help Octave's @code{help} command can be used to print brief usage-style messages, or to display information directly from an on-line version of the printed manual, using the GNU Info browser. If invoked without any arguments, @code{help} prints a list of all the available operators, functions, and built-in variables. If the first argument is @code{-i}, the @code{help} command searches the index of the on-line version of this manual for the given topics. For example, the command @example help help @end example @noindent prints a short message describing the @code{help} command, and @example help -i help @end example @noindent starts the GNU Info browser at this node in the on-line version of the manual. @xref{Using Info}, for complete details about how to use the GNU Info browser to read the on-line version of the manual. octave-1.1.0/doc/history.texi100666 415 17 6510 5705073516 14312 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Command History Functions, Help, System Utilities, Top @chapter Command History Functions @findex edit_history @findex run_history @findex history Octave provides three functions for viewing, editing, and re-running chunks of commands from the history list. The function @code{history} displays a list of commands that you have executed. It also allows you to write the current history to a file for safe keeping, and to replace the history list with the commands stored in a named file. Valid arguments are: @table @code @item -w file Write the current history to the named file. If the name is omitted, use the default history file (normally @file{~/.octave_hist}). @item -r file Read the named file, replacing the current history list with its contents. If the name is omitted, use the default history file (normally @file{~/.octave_hist}). @item N Only display the most recent @code{N} lines of history. @item -q Don't number the displayed lines of history. This is useful for cutting and pasting commands if you are using the X Window System. @end table For example, to display the five most recent commands that you have typed without displaying line numbers, use the command @samp{history -q 5}. The function @code{edit_history} allows you to edit a block of commands from the history list using the editor named by the environment variable @code{EDITOR}, or the default editor (normally @code{vi}). It is often more convenient to use @code{edit_history} to define functions rather than attempting to enter them directly on the command line. By default, the block of commands is executed as soon as you exit the editor. To avoid executing any commands, simply delete all the lines from the buffer before exiting the editor. The @code{edit_history} command takes two optional arguments specifying the history numbers of first and last commands to edit. For example, the command @example edit_history 13 @end example @noindent extracts all the commands from the 13th through the last in the history list. The command @example edit_history 13 169 @end example @noindent only extracts commands 13 through 169. Specifying a larger number for the first command than the last command reverses the list of commands before placing them in the buffer to be edited. If both arguments are omitted, the previous command in the history list is used. The command @code{run_history} is like @code{edit_history}, except that the editor is not invoked, and the commands are simply executed as they appear in the history list. @findex diary The @code{diary} command allows you to create a list of all commands @emph{and} the output they produce, mixed together just as you see them on your terminal. For example, the command @example diary on @end example @noindent tells Octave to start recording your session in a file called @file{diary} in your current working directory. To give Octave the name of the file write to, use the a command like @example diary my-diary.txt @end example @noindent Then Octave will write all of your commands to the file @file{my-diary.txt}. To stop recording your session, use the command @example diary off @end example @noindent Without any arguments, @code{diary} toggles the current diary state. octave-1.1.0/doc/io.texi100666 415 17 123316 5705307104 13255 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Input and Output, Special Matrices, Image Processing, Top @chapter Input and Output There are two distinct classes of input and output functions. The first set are modeled after the functions available in @sc{Matlab}. The second set are modeled after the standard I/O library used by the C programming language. The C-style I/O functions offer more flexibility and control over the output, but are not quite as easy to use as the simpler @sc{Matlab}-style I/O functions. When running interactively, Octave normally sends any output intended for your terminal that is more than one screen long to a paging program, such as @code{less} or @code{more}. This avoids the problem of having a large volume of output stream by before you can read it. With @code{less} (and some versions of @code{more}) it also allows you to scan forward and backward, and search for specific items. @findex fflush No output is displayed by the pager until just before Octave is ready to print the top level prompt, or read from the standard input using the @code{fscanf} or @code{scanf} functions. This means that there may be some delay before any output appears on your screen if you have asked Octave to perform a significant amount of work with a single command statement. The function @code{fflush} may be used to force output to be sent to the pager immediately. @xref{C-Style I/O Functions}. You can select the program to run as the pager by setting the variable @code{PAGER}, and you can turn paging off by setting the value of the variable @code{page_screen_output} to the string @samp{"false"}. @xref{User Preferences}. @menu * Basic Input and Output:: * C-Style I/O Functions:: @end menu @node Basic Input and Output, C-Style I/O Functions, Input and Output, Input and Output @section Basic Input and Output Since Octave normally prints the value of an expression as soon as it has been evaluated, the simplest of all I/O functions is a simple expression. For example, the following expression will display the value of pi @example octave:13> pi pi = 3.1416 @end example This works well as long as it is acceptable to have the name of the variable (or @samp{ans}) printed along with the value. To print the value of a variable without printing its name, use the function @code{disp}. For example, the following expression @findex disp @example disp ("The value of pi is:"), disp (pi) @end example @noindent will print @example The value of pi is: 3.1416 @end example @noindent Note that the output from @code{disp} always ends with a newline. A simple way to control the output format is with the @code{format} statement. For example, to print more digits for pi you can use the command @example format long @end example @noindent Then the expression above will print @example The value of pi is: 3.14159265358979 @end example @findex format Here is a summary of the options for @code{format}: @table @code @item short This is the default format. Octave will try to print numbers with at least 5 significant figures within a field that is a maximum of 10 characters wide. If Octave is unable to format a matrix so that columns line up on the decimal point and all the numbers fit within the maximum field width, it switches to an @samp{e} format. @item long Octave will try to print numbers with at least 15 significant figures within a field that is a maximum of 24 characters wide. As will the @samp{short} format, Octave will switch to an @samp{e} format if it is unable to format a matrix so that columns line up on the decimal point and all the numbers fit within the maximum field width. @item long e @itemx short e The same as @samp{format long} or @samp{format short} but always display output with an @samp{e} format. For example, with the @samp{short e} format, pi is displayed as @example 3.14e+00 @end example @item long E @itemx short E The same as @samp{format long e} or @samp{format short e} but always display output with an uppercase @samp{E} format. For example, with the @samp{long E} format, pi is displayed as @example 3.14159265358979E+00 @end example @item free @itemx none Print output in free format, without trying to line up columns of matrices on the decimal point. This also causes complex numbers to be formatted like this @samp{(0.604194, 0.607088)} instead of like this @samp{0.60419 + 0.60709i}. @item bank Print in a fixed format with two places to the right of the decimal point. @item + Print a @samp{+} symbol for nonzero matrix elements and a space for zero matrix elements. This format can be very useful for examining the structure of a large matrix. @end table The @code{input} function may be used for prompting the user for a value and storing the result in a variable. For example, @findex input @example input ("Pick a number, any number! ") @end example @noindent prints the prompt @example Pick a number, any number! @end example @noindent and waits for the user to enter a value. The string entered by the user is evaluated as an expression, so it may be a literal constant, a variable name, or any other valid expression. Currently, @code{input} only returns one value, regardless of the number of values produced by the evaluation of the expression. If you are only interested in getting a literal string value, you can call @code{input} with the character string @samp{s} as the second argument. This tells Octave to return the string entered by the user directly, without evaluating it first. Because there may be output waiting to be displayed by the pager, it is a good idea to always call @code{fflush (stdout)} before calling @code{input}. This will ensure that all pending output is written to the screen before your prompt. @xref{C-Style I/O Functions}. @findex keyboard The second input function, @code{keyboard}, is normally used for simple debugging. Using @code{keyboard}, it is possible to examine the values of variables within a function, and to assign newassign new variables Like @code{input}, it prompts the user for input, but no value is returned, and it continues to prompt for input until the user types @samp{quit}, or @samp{exit}. If @code{keyboard} is invoked without any arguments, a default prompt of @samp{debug> } is used. For both of these functions, the normal command line history and editing functions are available at the prompt. @findex save To save variables in a file, use the @code{save} command. For example, the command @example save data a b c @end example @noindent saves the variables @samp{a}, @samp{b}, and @samp{c} in the file @file{data}. @vindex default_save_format The @var{save} command can read files in Octave's text and binary formats as well as @sc{Matlab}'s binary format. You can specify the default format with the built-in variable @var{default_save_format} using one of the following values: @code{"binary"} or @code{"mat-binary"}. The initial default save format is Octave's text format. @vindex save_precision You can use the built-in variable @code{save_precision} to specify the number of digits to keep when saving data in text format. The list of variables to save may include wildcard patterns containing the following special characters: @table @code @item ? Match any single character. @item * Match zero or more characters. @item [ @var{list} ] Match the list of characters specified by @var{list}. If the first character is @code{!} or @code{^}, match all characters except those specified by @var{list}. For example, the pattern @samp{[a-zA-Z]} will match all lower and upper case alphabetic characters. @end table The following options may be specified for @code{save}. @ftable @code @item -ascii Save the data in Octave's text data format. Using this flag overrides the value of the built-in variable @code{default_save_precision} @item -binary Save the data in Octave's binary data format. Using this flag overrides the value of the built-in variable @code{default_save_precision} @item -float-binary Save the data in Octave's binary data format but only using single precision. Using this flag overrides the value of the built-in variable @code{default_save_precision}. You should use this format only if you know that all the values to be saved can be represented in single precision. @item -mat-binary Save the data in @sc{Matlab}'s binary data format. Using this flag overrides the value of the built-in variable @code{default_save_precision}. @item -save-builtins Force Octave to save the values of built-in variables too. By default, Octave does not save built-in variables. @end ftable @findex load Saving global variables also saves the global status of the variable, so that if it is restored at a later time using @samp{load}, it will be restored as a global variable. To restore the values from a file, use the @code{load} command. For example, to restore the variables saved in the file @file{data}, use the command @example load data @end example Octave will refuse to overwrite existing variables unless you use the option @samp{-force}. If a variable that is not marked as global is loaded from a file when a global symbol with the same name already exists, it is loaded in the global symbol table. Also, if a variable is marked as global in a file and a local symbol exists, the local symbol is moved to the global symbol table and given the value from the file. Since it seems that both of these cases are likely to be the result of some sort of error, they will generate warnings. As with @code{save}, you may specify a list of variables and @code{load} will only extract those variables with names that match. The @code{load} command can read data stored in Octave's text and binary formats, and @sc{Matlab}'s binary format. It will automatically detect the type of file and do conversion from different floating point formats (currently only IEEE big and little endian, though other formats may added in the future). The following options may be specified for @code{save}. @ftable @code @item -force Force variables currently in memory to be overwritten by variables with the same name found in the file. @item -ascii Force Octave to assume the file is in Octave's text format. @item -binary Force Octave to assume the file is in Octave's binary format. @item -mat-binary Force Octave to assume the file is in @sc{Matlab}'s binary format. @end ftable @node C-Style I/O Functions, , Basic Input and Output, Input and Output @section C-Style I/O Functions The C-style input and output functions provide most of the functionality of the C programming language's standard I/O library. The argument lists for some of the input functions are slightly different, however, because Octave has no way of passing arguments by reference. In the following, @var{file} refers either to an integer file number (as returned by @file{fopen}) or a file name. There are three files that are always available: @table @code @item stdin The standard input stream (file number 0). When Octave is used interactively, this is filtered through the command line editing functions. @item stdout The standard output stream (file number 1). Data written to the standard output is normally filtered through the pager. @item stderr The standard error stream (file number 2). Even if paging is turned on, the standard error is not sent to the pager. It is useful for error messages and prompts. @end table You should always use the symbolic names given in the table above, rather than referring to these files by number, since it will make your programs clearer. @menu * Opening and Closing Files:: * Formatted Output:: * Output Conversion Syntax:: * Table of Output Conversions:: * Integer Conversions:: * Floating-Point Conversions:: * Other Output Conversions:: * Formatted Input:: * Input Conversion Syntax:: * Table of Input Conversions:: * Numeric Input Conversions:: * String Input Conversions:: * Binary I/O:: * Other I/O Functions:: @end menu @node Opening and Closing Files, Formatted Output, C-Style I/O Functions, C-Style I/O Functions @subsection Opening and Closing Files @findex fopen To open a file, use the function @code{fopen (name, mode)}. It returns an integer value that may be used to refer to the file later. The second argument is a one or two character string that specifies whether the file is to be opened for reading, writing, or both. For example, @example myfile = fopen ("splat.dat", "r"); @end example @noindent opens the file @file{splat.dat} for reading. Opening a file that is already open has no effect. @c XXX FIXME XXX -- There still seem to be some minor bugs with fopen. @c You should probably get an error if you try to reopen a file with a @c different mode. You should probably get a warning if the file is @c already open, etc. The possible values @samp{mode} may have are @table @asis @item @samp{r} Open a text file for reading. @item @samp{w} Open a text file for writing. The previous contents are discared. @item @samp{a} Open or create a text file for writing at the end of the file. @item @samp{r+} Open an existing text file for reading and writing. @item @samp{w+} Open a text file for reading or writing. The previous contents are discared. @item @samp{a+} Open or create a text file for reading or writing at the end of the file. @end table @findex fclose To close a file once you are finished with it, use the function @code{fclose (@var{file})}. If an error is encountered while trying to close the file, an error message is printed and @code{fclose} returns 0. Otherwise, it returns 1. @node Formatted Output, Output Conversion Syntax, Opening and Closing Files, C-Style I/O Functions @subsection Formatted Output This section describes how to call @code{printf} and related functions. The following functions are available for formatted output. They are modelled after the C language functions of the same name. @ftable @code @item printf (@var{template}, ...) The @code{printf} function prints the optional arguments under the control of the template string @var{template} to the stream @code{stdout}. @item fprintf (@var{file}, @var{template}, ...) This function is just like @code{printf}, except that the output is written to the stream @var{file} instead of @code{stdout}. @item sprintf (@var{template}, ...) This is like @code{printf}, except that the output is written to a string. Unlike the C library function, which requires you to provide a suitably sized string as an argument, Octave's @code{sprintf} function returns the string, automatically sized to hold all of the items converted. @end ftable The @code{printf} function can be used to print any number of arguments. The template string argument you supply in a call provides information not only about the number of additional arguments, but also about their types and what style should be used for printing them. Ordinary characters in the template string are simply written to the output stream as-is, while @dfn{conversion specifications} introduced by a @samp{%} character in the template cause subsequent arguments to be formatted and written to the output stream. For example, @cindex conversion specifications (@code{printf}) @smallexample pct = 37; filename = "foo.txt"; printf ("Processing of `%s' is %d%% finished.\nPlease be patient.\n", filename, pct); @end smallexample @noindent produces output like @smallexample Processing of `foo.txt' is 37% finished. Please be patient. @end smallexample This example shows the use of the @samp{%d} conversion to specify that a scalar argument should be printed in decimal notation, the @samp{%s} conversion to specify printing of a string argument, and the @samp{%%} conversion to print a literal @samp{%} character. There are also conversions for printing an integer argument as an unsigned value in octal, decimal, or hexadecimal radix (@samp{%o}, @samp{%u}, or @samp{%x}, respectively); or as a character value (@samp{%c}). Floating-point numbers can be printed in normal, fixed-point notation using the @samp{%f} conversion or in exponential notation using the @samp{%e} conversion. The @samp{%g} conversion uses either @samp{%e} or @samp{%f} format, depending on what is more appropriate for the magnitude of the particular number. You can control formatting more precisely by writing @dfn{modifiers} between the @samp{%} and the character that indicates which conversion to apply. These slightly alter the ordinary behavior of the conversion. For example, most conversion specifications permit you to specify a minimum field width and a flag indicating whether you want the result left- or right-justified within the field. The specific flags and modifiers that are permitted and their interpretation vary depending on the particular conversion. They're all described in more detail in the following sections. @node Output Conversion Syntax, Table of Output Conversions, Formatted Output, C-Style I/O Functions @subsection Output Conversion Syntax This section provides details about the precise syntax of conversion specifications that can appear in a @code{printf} template string. Characters in the template string that are not part of a conversion specification are printed as-is to the output stream. The conversion specifications in a @code{printf} template string have the general form: @smallexample % @var{flags} @var{width} @r{[} . @var{precision} @r{]} @var{type} @var{conversion} @end smallexample For example, in the conversion specifier @samp{%-10.8ld}, the @samp{-} is a flag, @samp{10} specifies the field width, the precision is @samp{8}, the letter @samp{l} is a type modifier, and @samp{d} specifies the conversion style. (This particular type specifier says to print a numeric argument in decimal notation, with a minimum of 8 digits left-justified in a field at least 10 characters wide.) In more detail, output conversion specifications consist of an initial @samp{%} character followed in sequence by: @itemize @bullet @item Zero or more @dfn{flag characters} that modify the normal behavior of the conversion specification. @cindex flag character (@code{printf}) @item An optional decimal integer specifying the @dfn{minimum field width}. If the normal conversion produces fewer characters than this, the field is padded with spaces to the specified width. This is a @emph{minimum} value; if the normal conversion produces more characters than this, the field is @emph{not} truncated. Normally, the output is right-justified within the field. @cindex minimum field width (@code{printf}) You can also specify a field width of @samp{*}. This means that the next argument in the argument list (before the actual value to be printed) is used as the field width. The value is rounded to the nearest integer. If the value is negative, this means to set the @samp{-} flag (see below) and to use the absolute value as the field width. @item An optional @dfn{precision} to specify the number of digits to be written for the numeric conversions. If the precision is specified, it consists of a period (@samp{.}) followed optionally by a decimal integer (which defaults to zero if omitted). @cindex precision (@code{printf}) You can also specify a precision of @samp{*}. This means that the next argument in the argument list (before the actual value to be printed) is used as the precision. The value must be an integer, and is ignored if it is negative. @item An optional @dfn{type modifier character}. This character is ignored by Octave's @code{printf} function, but is recognized to provide compatibility with the C language @code{printf}. @item A character that specifies the conversion to be applied. @end itemize The exact options that are permitted and how they are interpreted vary between the different conversion specifiers. See the descriptions of the individual conversions for information about the particular options that they use. @node Table of Output Conversions, Integer Conversions, Output Conversion Syntax, C-Style I/O Functions @subsection Table of Output Conversions @cindex output conversions, for @code{printf} Here is a table summarizing what all the different conversions do: @table @asis @item @samp{%d}, @samp{%i} Print an integer as a signed decimal number. @xref{Integer Conversions}, for details. @samp{%d} and @samp{%i} are synonymous for output, but are different when used with @code{scanf} for input (@pxref{Table of Input Conversions}). @item @samp{%o} Print an integer as an unsigned octal number. @xref{Integer Conversions}, for details. @item @samp{%u} Print an integer as an unsigned decimal number. @xref{Integer Conversions}, for details. @item @samp{%x}, @samp{%X} Print an integer as an unsigned hexadecimal number. @samp{%x} uses lower-case letters and @samp{%X} uses upper-case. @xref{Integer Conversions}, for details. @item @samp{%f} Print a floating-point number in normal (fixed-point) notation. @xref{Floating-Point Conversions}, for details. @item @samp{%e}, @samp{%E} Print a floating-point number in exponential notation. @samp{%e} uses lower-case letters and @samp{%E} uses upper-case. @xref{Floating-Point Conversions}, for details. @item @samp{%g}, @samp{%G} Print a floating-point number in either normal or exponential notation, whichever is more appropriate for its magnitude. @samp{%g} uses lower-case letters and @samp{%G} uses upper-case. @xref{Floating-Point Conversions}, for details. @item @samp{%c} Print a single character. @xref{Other Output Conversions}. @item @samp{%s} Print a string. @xref{Other Output Conversions}. @item @samp{%%} Print a literal @samp{%} character. @xref{Other Output Conversions}. @end table If the syntax of a conversion specification is invalid, unpredictable things will happen, so don't do this. If there aren't enough function arguments provided to supply values for all the conversion specifications in the template string, or if the arguments are not of the correct types, the results are unpredictable. If you supply more arguments than conversion specifications, the extra argument values are simply ignored; this is sometimes useful. @node Integer Conversions, Floating-Point Conversions, Table of Output Conversions, C-Style I/O Functions @subsection Integer Conversions This section describes the options for the @samp{%d}, @samp{%i}, @samp{%o}, @samp{%u}, @samp{%x}, and @samp{%X} conversion specifications. These conversions print integers in various formats. The @samp{%d} and @samp{%i} conversion specifications both print an numeric argument as a signed decimal number; while @samp{%o}, @samp{%u}, and @samp{%x} print the argument as an unsigned octal, decimal, or hexadecimal number (respectively). The @samp{%X} conversion specification is just like @samp{%x} except that it uses the characters @samp{ABCDEF} as digits instead of @samp{abcdef}. The following flags are meaningful: @table @asis @item @samp{-} Left-justify the result in the field (instead of the normal right-justification). @item @samp{+} For the signed @samp{%d} and @samp{%i} conversions, print a plus sign if the value is positive. @item @samp{ } For the signed @samp{%d} and @samp{%i} conversions, if the result doesn't start with a plus or minus sign, prefix it with a space character instead. Since the @samp{+} flag ensures that the result includes a sign, this flag is ignored if you supply both of them. @item @samp{#} For the @samp{%o} conversion, this forces the leading digit to be @samp{0}, as if by increasing the precision. For @samp{%x} or @samp{%X}, this prefixes a leading @samp{0x} or @samp{0X} (respectively) to the result. This doesn't do anything useful for the @samp{%d}, @samp{%i}, or @samp{%u} conversions. @item @samp{0} Pad the field with zeros instead of spaces. The zeros are placed after any indication of sign or base. This flag is ignored if the @samp{-} flag is also specified, or if a precision is specified. @end table If a precision is supplied, it specifies the minimum number of digits to appear; leading zeros are produced if necessary. If you don't specify a precision, the number is printed with as many digits as it needs. If you convert a value of zero with an explicit precision of zero, then no characters at all are produced. @node Floating-Point Conversions, Other Output Conversions, Integer Conversions, C-Style I/O Functions @subsection Floating-Point Conversions This section discusses the conversion specifications for floating-point numbers: the @samp{%f}, @samp{%e}, @samp{%E}, @samp{%g}, and @samp{%G} conversions. The @samp{%f} conversion prints its argument in fixed-point notation, producing output of the form @w{[@code{-}]@var{ddd}@code{.}@var{ddd}}, where the number of digits following the decimal point is controlled by the precision you specify. The @samp{%e} conversion prints its argument in exponential notation, producing output of the form @w{[@code{-}]@var{d}@code{.}@var{ddd}@code{e}[@code{+}|@code{-}]@var{dd}}. Again, the number of digits following the decimal point is controlled by the precision. The exponent always contains at least two digits. The @samp{%E} conversion is similar but the exponent is marked with the letter @samp{E} instead of @samp{e}. The @samp{%g} and @samp{%G} conversions print the argument in the style of @samp{%e} or @samp{%E} (respectively) if the exponent would be less than -4 or greater than or equal to the precision; otherwise they use the @samp{%f} style. Trailing zeros are removed from the fractional portion of the result and a decimal-point character appears only if it is followed by a digit. The following flags can be used to modify the behavior: @c Not @samp so we can have ` ' as an item. @table @asis @item @samp{-} Left-justify the result in the field. Normally the result is right-justified. @item @samp{+} Always include a plus or minus sign in the result. @item @samp{ } If the result doesn't start with a plus or minus sign, prefix it with a space instead. Since the @samp{+} flag ensures that the result includes a sign, this flag is ignored if you supply both of them. @item @samp{#} Specifies that the result should always include a decimal point, even if no digits follow it. For the @samp{%g} and @samp{%G} conversions, this also forces trailing zeros after the decimal point to be left in place where they would otherwise be removed. @item @samp{0} Pad the field with zeros instead of spaces; the zeros are placed after any sign. This flag is ignored if the @samp{-} flag is also specified. @end table The precision specifies how many digits follow the decimal-point character for the @samp{%f}, @samp{%e}, and @samp{%E} conversions. For these conversions, the default precision is @code{6}. If the precision is explicitly @code{0}, this suppresses the decimal point character entirely. For the @samp{%g} and @samp{%G} conversions, the precision specifies how many significant digits to print. Significant digits are the first digit before the decimal point, and all the digits after it. If the precision is @code{0} or not specified for @samp{%g} or @samp{%G}, it is treated like a value of @code{1}. If the value being printed cannot be expressed precisely in the specified number of digits, the value is rounded to the nearest number that fits. @node Other Output Conversions, Formatted Input, Floating-Point Conversions, C-Style I/O Functions @subsection Other Output Conversions This section describes miscellaneous conversions for @code{printf}. The @samp{%c} conversion prints a single character. The @samp{-} flag can be used to specify left-justification in the field, but no other flags are defined, and no precision or type modifier can be given. For example: @smallexample printf ("%c%c%c%c%c", "h", "e", "l", "l", "o"); @end smallexample @noindent prints @samp{hello}. The @samp{%s} conversion prints a string. The corresponding argument must be a string. A precision can be specified to indicate the maximum number of characters to write; otherwise characters in the string up to but not including the terminating null character are written to the output stream. The @samp{-} flag can be used to specify left-justification in the field, but no other flags or type modifiers are defined for this conversion. For example: @smallexample printf ("%3s%-6s", "no", "where"); @end smallexample @noindent prints @samp{ nowhere }. @node Formatted Input, Input Conversion Syntax, Other Output Conversions, C-Style I/O Functions @subsection Formatted Input Here are the descriptions of the functions for performing formatted input. @ftable @code @item scanf (@var{template}) The @code{scanf} function reads formatted input from the stream @code{stdin} under the control of the template string @var{template}. The resulting values are returned. @item fscanf (@var{file}, @var{template}) This function is just like @code{scanf}, except that the input is read from the stream @var{file} instead of @code{stdin}. @item sscanf (@var{string}, @var{template}) This is like @code{scanf}, except that the characters are taken from the string @var{string} instead of from a stream. Reaching the end of the string is treated as an end-of-file condition. @end ftable Calls to @code{scanf} are superficially similar to calls to @code{printf} in that arbitrary arguments are read under the control of a template string. While the syntax of the conversion specifications in the template is very similar to that for @code{printf}, the interpretation of the template is oriented more towards free-format input and simple pattern matching, rather than fixed-field formatting. For example, most @code{scanf} conversions skip over any amount of ``white space'' (including spaces, tabs, and newlines) in the input file, and there is no concept of precision for the numeric input conversions as there is for the corresponding output conversions. Ordinarily, non-whitespace characters in the template are expected to match characters in the input stream exactly. @cindex conversion specifications (@code{scanf}) When a @dfn{matching failure} occurs, @code{scanf} returns immediately, leaving the first non-matching character as the next character to be read from the stream, and @code{scanf} returns all the items that were successfully converted. @cindex matching failure, in @code{scanf} The formatted input functions are not used as frequently as the formatted output functions. Partly, this is because it takes some care to use them properly. Another reason is that it is difficult to recover from a matching error. @node Input Conversion Syntax, Table of Input Conversions, Formatted Input, C-Style I/O Functions @subsection Input Conversion Syntax A @code{scanf} template string is a string that contains ordinary multibyte characters interspersed with conversion specifications that start with @samp{%}. Any whitespace character in the template causes any number of whitespace characters in the input stream to be read and discarded. The whitespace characters that are matched need not be exactly the same whitespace characters that appear in the template string. For example, write @samp{ , } in the template to recognize a comma with optional whitespace before and after. Other characters in the template string that are not part of conversion specifications must match characters in the input stream exactly; if this is not the case, a matching failure occurs. The conversion specifications in a @code{scanf} template string have the general form: @smallexample % @var{flags} @var{width} @var{type} @var{conversion} @end smallexample In more detail, an input conversion specification consists of an initial @samp{%} character followed in sequence by: @itemize @bullet @item An optional @dfn{flag character} @samp{*}, which says to ignore the text read for this specification. When @code{scanf} finds a conversion specification that uses this flag, it reads input as directed by the rest of the conversion specification, but it discards this input, does not use a pointer argument, and does not increment the count of successful assignments. @cindex flag character (@code{scanf}) @item An optional decimal integer that specifies the @dfn{maximum field width}. Reading of characters from the input stream stops either when this maximum is reached or when a non-matching character is found, whichever happens first. Most conversions discard initial whitespace characters (those that don't are explicitly documented), and these discarded characters don't count towards the maximum field width. @cindex maximum field width (@code{scanf}) @item An optional type modifier character. This character is ignored by Octave's @code{scanf} function, but is recognized to provide compatibility with the C language @code{scanf}. @item A character that specifies the conversion to be applied. @end itemize The exact options that are permitted and how they are interpreted vary between the different conversion specifiers. See the descriptions of the individual conversions for information about the particular options that they allow. @node Table of Input Conversions, Numeric Input Conversions, Input Conversion Syntax, C-Style I/O Functions @subsection Table of Input Conversions @cindex input conversions, for @code{scanf} Here is a table that summarizes the various conversion specifications: @table @asis @item @samp{%d} Matches an optionally signed integer written in decimal. @xref{Numeric Input Conversions}. @item @samp{%i} Matches an optionally signed integer in any of the formats that the C language defines for specifying an integer constant. @xref{Numeric Input Conversions}. @item @samp{%o} Matches an unsigned integer written in octal radix. @xref{Numeric Input Conversions}. @item @samp{%u} Matches an unsigned integer written in decimal radix. @xref{Numeric Input Conversions}. @item @samp{%x}, @samp{%X} Matches an unsigned integer written in hexadecimal radix. @xref{Numeric Input Conversions}. @item @samp{%e}, @samp{%f}, @samp{%g}, @samp{%E}, @samp{%G} Matches an optionally signed floating-point number. @xref{Numeric Input Conversions}. @item @samp{%s} Matches a string containing only non-whitespace characters. @xref{String Input Conversions}. @item @samp{%c} Matches a string of one or more characters; the number of characters read is controlled by the maximum field width given for the conversion. @xref{String Input Conversions}. @item @samp{%%} This matches a literal @samp{%} character in the input stream. No corresponding argument is used. @end table If the syntax of a conversion specification is invalid, the behavior is undefined. If there aren't enough function arguments provided to supply addresses for all the conversion specifications in the template strings that perform assignments, or if the arguments are not of the correct types, the behavior is also undefined. On the other hand, extra arguments are simply ignored. @node Numeric Input Conversions, String Input Conversions, Table of Input Conversions, C-Style I/O Functions @subsection Numeric Input Conversions This section describes the @code{scanf} conversions for reading numeric values. The @samp{%d} conversion matches an optionally signed integer in decimal radix. The @samp{%i} conversion matches an optionally signed integer in any of the formats that the C language defines for specifying an integer constant. For example, any of the strings @samp{10}, @samp{0xa}, or @samp{012} could be read in as integers under the @samp{%i} conversion. Each of these specifies a number with decimal value @code{10}. The @samp{%o}, @samp{%u}, and @samp{%x} conversions match unsigned integers in octal, decimal, and hexadecimal radices, respectively. The @samp{%X} conversion is identical to the @samp{%x} conversion. They both permit either uppercase or lowercase letters to be used as digits. Unlike the C language @code{scanf}, Octave ignores the @samp{h}, @samp{l}, and @samp{L} modifiers. @node String Input Conversions, Binary I/O, Numeric Input Conversions, C-Style I/O Functions @subsection String Input Conversions This section describes the @code{scanf} input conversions for reading string and character values: @samp{%s} and @samp{%c}. The @samp{%c} conversion is the simplest: it matches a fixed number of characters, always. The maximum field with says how many characters to read; if you don't specify the maximum, the default is 1. This conversion does not skip over initial whitespace characters. It reads precisely the next @var{n} characters, and fails if it cannot get that many. The @samp{%s} conversion matches a string of non-whitespace characters. It skips and discards initial whitespace, but stops when it encounters more whitespace after having read something. For example, reading the input: @smallexample hello, world @end smallexample @noindent with the conversion @samp{%10c} produces @code{" hello, wo"}, but reading the same input with the conversion @samp{%10s} produces @code{"hello,"}. @node Binary I/O, Other I/O Functions, String Input Conversions, C-Style I/O Functions @subsection Binary I/O Octave has to C-style functions for reading and writing binary data. They are @code{fread} and @code{fwrite} and are patterned after the standard C functions with the same names. @ftable @code @item fread (@var{file}, @var{size}, @var{precision}) This function reads data in binary form of type @var{precision} from the specified @var{file}, which may be either a file name, or a file number as returned from @code{fopen}. The argument @var{size} specifies the size of the matrix to return. It may be a scalar or a two-element vector. If it is a scalar, @code{fread} returns a column vector of the specified length. If it is a two-element vector, it specifies the number of rows and columns of the result matrix, and @code{fread} fills the elements of the matrix in column-major order. The argument @var{precision} is a string specifying the type of data to read and may be one of @code{"char"}, @code{"schar"}, @code{"short"}, @code{"int"}, @code{"long"}, @code{"float"}, @code{"double"}, @code{"uchar"}, @code{"ushort"}, @code{"uint"}, or @code{"ulong"}. The default precision is @code{"uchar"}. The @code{fread} function returns two values, @code{data}, which is the data read from the file, and @code{count}, which is the number of elements read. @item fwrite (@var{file}, @var{data}, @var{precision}) This function writes data in binary form of type @var{precision} to the specified @var{file}, which may be either a file name, or a file number as returned from @code{fopen}. The argument @var{data} is a matrix of values that are to be written to the file. The values are extracted in column-major order. The argument @var{precision} is a string specifying the type of data to read and may be one of @code{"char"}, @code{"schar"}, @code{"short"}, @code{"int"}, @code{"long"}, @code{"float"}, @code{"double"}, @code{"uchar"}, @code{"ushort"}, @code{"uint"}, or @code{"ulong"}. The default precision is @code{"uchar"}. The @code{fwrite} function returns the number of elements written. The behavior of @code{fwrite} is undefined if the values in @var{data} are too large to fit in the specified precision. @end ftable @node Other I/O Functions, , Binary I/O, C-Style I/O Functions @subsection Other I/O Functions @findex fgets @example fgets (@var{file}, len) @end example Read @samp{len} characters from a file. To flush output to a stream, use the function @code{fflush (@var{file})}. This is useful for ensuring that all pending output makes it to the screen before some other event occurs. For example, it is always a good idea to flush the standard output stream before calling @code{input}. Three functions are available for setting and determining the position of the file pointer for a given file. @findex ftell The position of the file pointer (as the number of characters from the beginning of the file) can be obtained using the the function @code{ftell (@var{file})}. @findex fseek To set the file pointer to any location within the file, use the function @code{fseek (@var{file}, offset, origin)}. The pointer is placed @code{offset} characters from the @code{origin}, which may be one of the predefined variables @code{SEEK_CUR} (current position), @code{SEEK_SET} (beginning), or @code{SEEK_END} (end of file). If @code{origin} is omitted, @code{SEEK_SET} is assumed. The offset must be zero, or a value returned by @code{ftell} (in which case @code{origin} must be @code{SEEK_SET}. @xref{Predefined Constants}. @findex frewind The function @code{frewind (@var{file})} moves the file pointer to the beginning of a file, returning 1 for success, and 0 if an error was encountered. It is equivalent to @code{fseek (@var{file}, 0, SEEK_SET)}. The following example stores the current file position in the variable @samp{marker}, moves the pointer to the beginning of the file, reads four characters, and then returns to the original position. @example marker = ftell (myfile); frewind (myfile); fourch = fgets (myfile, 4); fseek (myfile, marker, SEEK_SET); @end example @findex feof The function @code{feof (@var{file})} allows you to find out if an end-of-file condition has been encountered for a given file. Note that it will only return 1 if the end of the file has already been encountered, not if the next read operation will result in an end-of-file condition. @findex ferror Similarly, the function @code{ferror (@var{file})} allows you to find out if an error condition has been encountered for a given file. Note that it will only return 1 if an error has already been encountered, not if the next operation will result in an error condition. @findex kbhit The function @code{kbhit} may be usd to read a single keystroke from the keyboard. For example, @example x = kbhit (); @end example @noindent will set @var{x} to the next character typed at the keyboard, without requiring a carriage return to be typed. @findex freport Finally, it is often useful to know exactly which files have been opened, and whether they are open for reading, writing, or both. The command @code{freport} prints this information for all open files. For example, @example @group octave:13> freport number mode name 0 r stdin 1 w stdout 2 w stderr 3 r myfile @end group @end example octave-1.1.0/doc/hsuser.texi100666 415 17 11632 5553154067 14145 0ustar jweusers@ignore This file documents the user interface to the GNU History library. Copyright (C) 1988, 1991 Free Software Foundation, Inc. Authored by Brian Fox. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the GNU Copyright statement is available to the distributee, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ignore @node Using History Interactively, Installation, Command Line Editing, Top @chapter Using History Interactively This chapter describes how to use the GNU History Library interactively, from a user's standpoint. @c It should be considered a user's guide. For @c information on using the GNU History Library in your own programs, @c @pxref{Programming with GNU History}. @menu * History Interaction:: What it feels like using History as a user. @end menu @node History Interaction, , , Using History Interactively @section History Interaction @cindex expansion The History library provides a history expansion feature that is similar to the history expansion in Csh. The following text describes the syntax that you use to manipulate the history information. History expansion takes place in two parts. The first is to determine which line from the previous history should be used during substitution. The second is to select portions of that line for inclusion into the current one. The line selected from the previous history is called the @dfn{event}, and the portions of that line that are acted upon are called @dfn{words}. The line is broken into words in the same fashion that the Bash shell does, so that several English (or Unix) words surrounded by quotes are considered as one word. @menu * Event Designators:: How to specify which history line to use. * Word Designators:: Specifying which words are of interest. * Modifiers:: Modifying the results of substitution. @end menu @node Event Designators, Word Designators, , History Interaction @subsection Event Designators @cindex event designators An event designator is a reference to a command line entry in the history list. @table @asis @item @code{!} Start a history substitution, except when followed by a space, tab, or the end of the line... @key{=} or @key{(}. @item @code{!!} Refer to the previous command. This is a synonym for @code{!-1}. @item @code{!n} Refer to command line @var{n}. @item @code{!-n} Refer to the command line @var{n} lines back. @item @code{!string} Refer to the most recent command starting with @var{string}. @item @code{!?string}[@code{?}] Refer to the most recent command containing @var{string}. @end table @node Word Designators, Modifiers, Event Designators, History Interaction @subsection Word Designators A @key{:} separates the event specification from the word designator. It can be omitted if the word designator begins with a @key{^}, @key{$}, @key{*} or @key{%}. Words are numbered from the beginning of the line, with the first word being denoted by a 0 (zero). @table @code @item 0 (zero) The zero'th word. For many applications, this is the command word. @item n The @var{n}'th word. @item ^ The first argument. that is, word 1. @item $ The last argument. @item % The word matched by the most recent @code{?string?} search. @item x-y A range of words; @code{-@var{y}} Abbreviates @code{0-@var{y}}. @item * All of the words, excepting the zero'th. This is a synonym for @code{1-$}. It is not an error to use @key{*} if there is just one word in the event. The empty string is returned in that case. @end table @node Modifiers, , Word Designators, History Interaction @subsection Modifiers After the optional word designator, you can add a sequence of one or more of the following modifiers, each preceded by a @key{:}. @table @code @item # The entire command line typed so far. This means the current command, not the previous command, so it really isn't a word designator, and doesn't belong in this section. @item h Remove a trailing file name component, leaving only the head. @item r Remove a trailing suffix of the form @samp{.}@var{suffix}, leaving the basename. @item e Remove all but the suffix. @item t Remove all leading file name components, leaving the tail. @item p Print the new command but do not execute it. @end table octave-1.1.0/doc/image.texi100666 415 17 11074 5705307773 13721 0ustar jweusers@c Copyright (C) 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Image Processing, Input and Output, Plotting, Top @chapter Image Processing To display images using these functions, you must be using Octave with the X Window System, and you must have either @code{xloadimage} or @code{xv} installed. You do not need to be running X in order to manipulate images, however, so some of these functions may be useful even if you are not able to view the results. @ftable @code @item colormap Set the current colormap. @code{colormap (@var{map})} sets the current colormap to @var{map}. The color map should be an @var{n} row by 3 column matrix. The columns contain red, green, and blue intensities respectively. All entries should be between 0 and 1 inclusive. The new colormap is returned. @code{colormap ("default")} restores the default colormap (a gray scale colormap with 64 entries). The default colormap is returned. With no arguments, @code{colormap} returns the current color map. @item gray (@var{n}) Create a gray colormap with values from 0 to @var{n}. The argument @var{n} should be a scalar. If it is omitted, 64 is assumed. @item gray2ind Convert a gray scale intensity image to an Octave indexed image. @item image Display an Octave image matrix. @code{image (@var{x})} displays a matrix as a color image. The elements of @var{x} are indices into the current colormap and should have values between 1 and the length of the colormap. @code{image (@var{x}, @var{zoom})} changes the zoom factor. The default value is 4. @item imagesc Scale and display a matrix as an image. @code{imagesc (@var{x})} displays a scaled version of the matrix @var{x}. The matrix is scaled so that its entries are indices into the current colormap. The scaled matrix is returned. @code{imagesc (@var{x}, @var{zoom})} sets the magnification, the default value is 4. @item imshow Display images. @code{imshow (@var{x})} displays an indexed image using the current colormap. @code{imshow (@var{x}, @var{map})} displays an indexed image using the specified colormap. @code{imshow (@var{i}, @var{n})} displays a gray scale intensity image. @code{imshow (@var{r}, @var{g}, @var{b})} displays an RGB image. @item ind2gray Convert an Octave indexed image to a gray scale intensity image. @code{@var{y} = ind2gray (@var{x})} converts an indexed image to a gray scale intensity image. The current colormap is used to determine the intensities. The intensity values lie between 0 and 1 inclusive. @code{@var{y} = ind2gray (@var{x}, @var{map})} uses the specified colormap instead of the current one in the conversion process. @item ind2rgb Convert an indexed image to red, green, and blue color components. @code{[@var{r}, @var{g}, @var{b}] = ind2rgb (@var{x})} uses the current colormap for the conversion. @code{[@var{r}, @var{g}, @var{b}] = ind2rgb (@var{x}, @var{map})} uses the specified colormap. @item loadimage Load an image file. @code{[@var{x}, @var{map}] = loadimage (@var{file})} loads an image and it's associated color map from the specified @var{file}. The image must be stored in Octave's image format. @c @item rgb2ntsc @c @item ntsc2rgb @item ocean (@var{n}) Create color colormap. The argument @var{n} should be a scalar. If it is omitted, 64 is assumed. @item rgb2ind Convert and RGB image to an Octave indexed image. @code{[@var{x}, @var{map}] = rgb2ind (@var{r}, @var{g}, @var{b})} @item saveimage Save a matrix to disk in image format. @code{saveimage (@var{file}, @var{x})} saves matrix @var{x} to @var{file} in Octave's image format. The current colormap is also saved in the file. @code{saveimage (@var{file}, @var{x}, "img")} saves the image in the default format and is the same as @code{saveimage (@var{file}, @var{x})}. @code{saveimage (@var{file}, @var{x}, "ppm")} saves the image in ppm format instead of the default Octave image format. @code{saveimage (@var{file}, @var{x}, "ps")} saves the image in PostScript format instead of the default Octave image format. (Note: images saved in PostScript format can not be read back into Octave with loadimage.) @code{saveimage (@var{file}, @var{x}, @var{fmt}, @var{map})} saves the image along with the specified colormap in the specified format. Note: if the colormap contains only two entries and these entries are black and white, the bitmap ppm and PostScript formats are used. If the image is a gray scale image (the entries within each row of the colormap are equal) the gray scale ppm and PostScript image formats are used, otherwise the full color formats are used. @end ftable octave-1.1.0/doc/in-idx.texi100666 415 17 330 5705073510 13745 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Info Index, , Readline Index, Top @unnumbered Info Index @printindex in octave-1.1.0/doc/install.texi100666 415 17 40003 5705073514 14270 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @c The text of this file will eventually appear in the file INSTALL @c in the Octave distribution, as well as in the Octave manual. @ifclear INSTALLONLY @node Installation, Trouble, Amusements, Top @appendix Installing Octave @end ifclear @cindex installing Octave Here is the procedure for installing Octave from scratch on a Unix system. For instructions on how to install the binary distributions of Octave, see @ref{Binary Distributions}. @itemize @bullet @item Run the shell script @file{configure}. This will determine the features your system has (or doesn't have) and create a file named Makefile from each of the files named Makefile.in. Here is a summary of the configure options that are most frequently used when building Octave: @table @code @item --prefix=@var{prefix} Install Octave in subdirectories below @var{prefix}. The default value of @var{prefix} is @file{/usr/local}. @item --srcdir=@var{dir} Look for Octave sources in the directory @var{dir}. @item --with-f2c Use f2c even if Fortran compiler is available. @item --enable-dld Use DLD to make Octave capable of dynamically linking externally compiled functions. This only works on systems that have a working port of DLD. @item --enable-lite-kernel Compile smaller kernel. This currently requires DLD so that Octave can load functions at run time that are not loaded at compile time. @item --help Print a summary of the options recognized by the configure script. @end table See the file INSTALL for more information about the command line options used by configure. That file also contains instructions for compiling in a directory other than where the source is located. @item Run make. You will need a recent version of GNU make. Modifying Octave's Makefiles to work with other make programs is probably not worth your time. We recommend you get and compile GNU make instead. For plotting, you will need to have gnuplot installed on your system. Gnuplot is a command-driven interactive function plotting program. Gnuplot is copyrighted, but freely distributable. The `gnu' in gnuplot is a coincidence---it is not related to the GNU project or the FSF in any but the most peripheral sense. For version @value{VERSION}, you must have the GNU C++ compiler (gcc) version 2.6.3 or later to compile Octave. You will also need version 2.6.1 of the GNU C++ class library (libg++). If you plan to modify the parser you will also need GNU bison and fles. If you modify the documentation, you will need GNU Texinfo, along with the patch for the makeinfo program that is distributed with Octave. GNU make, gcc, and libg++, gnuplot, bison, flex, and Texinfo are all available from many anonymous ftp archives, including ftp.che.utexas.edu, ftp.uu.net, prep.ai.mit.edu, and wuarchive.wustl.edu. If you don't have a Fortran compiler, or if your Fortran compiler doesn't work like the traditional Unix f77, you will need to have the Fortran to C translator f2c. You can get f2c from any number of anonymous ftp archives. The most recent version of f2c is always available from research.att.com. On an otherwise idle SPARCstation II, it will take somewhere between 60 and 90 minutes to compile everything, depending on whether you are compiling the Fortran libraries with f2c or using the Fortran compiler directly. You will need about 50 megabytes of disk storage to work with (considerably less if you don't compile with debugging symbols). To do that, use the command @example make CFLAGS=-O CXXFLAGS=-O LDFLAGS= @end example @noindent instead of just @samp{make}. @item If you encounter errors while compiling Octave, first check the list of known problems below to see if there is a workaround or solution for your problem. If not, @ifclear INSTALLONLY see @ref{Trouble}, @end ifclear @ifset INSTALLONLY see the file BUGS @end ifset for information about how to report bugs. @item Once you have successfully compiled Octave, run @samp{make install}. This will install a copy of octave, its libraries, and its documentation in the destination directory. As distributed, Octave is installed in the following directories: @table @file @item @var{prefix}/bin Octave and other binaries that people will want to run directly. @item @var{prefix}/lib Libraries like libcruft.a and liboctave.a. @item @var{prefix}/include/octave Include files distributed with Octave. @item @var{prefix}/man/man1 Unix-style man pages describing Octave. @item @var{prefix}/info Info files describing Octave. @item @var{prefix}/lib/octave/@var{version}/m Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. @item @var{prefix}/lib/octave/@var{version}/exec/@var{host_type} Executables to be run by Octave rather than the user. @item @var{prefix}/lib/octave/@var{version}/oct/@var{host_type} Object files that will be dynamically loaded. @item @var{prefix}/lib/octave/@var{version}/imagelib Image files that are distributed with Octave. @end table @noindent where @var{prefix} defaults to @file{/usr/local}, @var{version} stands for the current version number of the interpreter, and @var{host_type} is the type of computer on which Octave is installed (for example, @samp{i486-unknown-gnu}). @end itemize @menu * Installation Problems:: * Binary Distributions:: @end menu @node Installation Problems, Binary Distributions, Installation, Installation @appendixsec Installation Problems This section contains a list of problems (and some apparent problems that don't really mean anything is wrong) that may show up during installation of Octave. @c XXX FIXME XXX --- this might be a good place to explain the terms for @c FSQP and NPSOL. @itemize @bullet @item On AIX (and possibly other) systems, GCC 2.6.2 generates invalid assembly code when compiling some parts of Octave. On AIX systems, it is possible to get a working binary by not using the compiler flag @samp{-fno-implicit-templates}. You can specify this as an option to make by using a command like @example make NO_IMPLICIT_TEMPLATES= @end example @item You may need to edit some files in the gcc include subdirectory to add prototypes for functions there. For example, Ultrix 4.2 needs proper declarations for the @code{signal()} and the @code{SIG_IGN} macro in the file @file{signal.h}. On some systems the @code{SIG_IGN} macro is defined to be something like this: @example #define SIG_IGN (void (*)())1 @end example @noindent when it should really be something like: @example #define SIG_IGN (void (*)(int))1 @end example @noindent to match the prototype declaration for @code{signal()}. The gcc fixincludes/fixproto script should probably fix this when gcc installs its modified set of header files, but I don't think that's been done yet. @item There is a bug with the makeinfo program that is distributed with texinfo-3.1 that causes the indices in Octave's on-line manual to be generated incorrectly. If you need to recreate the on-line documentation, you should get the makeinfo program that is distributed with texinfo-3.1 and apply the patch for makeinfo that is distributed with Octave. See the file MAKEINFO.PATCH for more details. @item If you don't have NPSOL but you still want to be able to solve NLPs, or if you don't have QPSOL but you still want to solve QPs, you'll need to find replacements or order them from Stanford. If you know of a freely redistributable replacement, please let us know---we might be interested in distributing it with Octave. You can get more information about NPSOL and QPSOL from @quotation Stanford University@* Office of Technology Licensing@* 857 Serra Street@* Stanford CA 94305-6225@* Tel: (415) 723-0651@* Fax: (415) 725-7295 @end quotation Octave may soon support FSQP, an NLP solver from Andre Tits (andre@@src.umd.edu) of the University of Maryland. FSQP is available free of charge to academic sites, but can not be redistributed to third parties. @item Some of the Fortran subroutines may fail to compile with older versions of the Sun Fortran compiler. If you get errors like @example zgemm.f: zgemm: warning: unexpected parent of complex expression subtree zgemm.f, line 245: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 304: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 327: warning: unexpected parent of complex expression subtree pcc_binval: missing IR_CONV in complex op make[2]: *** [zgemm.o] Error 1 @end example @noindent when compiling the Fortran subroutines in the @file{libcruft} subdirectory, you should either upgrade your compiler or try compiling with optimization turned off. @item On NeXT systems with gcc 2.5.8, if you get errors like this: @example /usr/tmp/cc007458.s:unknown:Undefined local symbol LBB7656 /usr/tmp/cc007458.s:unknown:Undefined local symbol LBE7656 @end example @noindent when compiling @file{Array.cc} and @file{Matrix.cc}, try recompiling these files without @code{-g}. @item Some people have reported that calls to shell_cmd and the pager do not work on SunOS systems. This is apparently due to having @code{G_HAVE_SYS_WAIT} defined to be 0 instead of 1 when compiling libg++. @item On NeXT systems with gcc 2.5.8, linking to @file{libsys_s.a} may fail to resolve the following functions @example _tcgetattr _tcsetattr _tcflow @end example @noindent which are part of @file{libposix.a}. Unfortunately, linking Octave with @code{-posix} results in the following undefined symbols. @example .destructors_used .constructors_used _objc_msgSend _NXGetDefaultValue _NXRegisterDefaults .objc_class_name_NXStringTable .objc_class_name_NXBundle @end example One kludge around this problem is to extract @file{termios.o} from @file{libposix.a}, put it in Octave's @file{src} directory, and add it to the list of files to link together in the Makefile. Suggestions for better ways to solve this problem are welcome! @item With g++ 2.6.3 (and possibly other 2.6.x versions) on some Intel x86 systems, compiling @file{Array-d.cc} fails with the messages like @example as: /tmp/cc005254.s:4057: Local symbol LBB103 never defined. as: /tmp/cc005254.s:4057: Local symbol LBE103 never defined. @end example @noindent A possible workaround for this is to compile without @code{-g}. @item If Octave crashes immediately with a floating point exception, it is likely that it is failing to initialize the IEEE floating point values for infinity and NaN. If your system actually does support IEEE arithmetic, you should be able to fix this problem by modifying the function @code{octave_ieee_init} in the file @file{sysdep.cc} to correctly initialize Octave's internal infinity and NaN variables. If your system does not support IEEE arithmetic but Octave's configure script incorrectly determined that it does, you can work around the problem by editing the file @file{config.h} to not define @code{HAVE_ISINF}, @code{HAVE_FINITE}, and @code{HAVE_ISNAN}. In any case, please report this as a bug since it might be possible to modify Octave's configuration script to automatically determine the proper thing to do. @ignore @c These next two items should no longer be problems, since g++ and @c libg++ use a different method for installing an appropriate set of @c header files. @item Problems with finite and isinf on systems that don't have @code{isinf()} but do have @code{finite()}. The copy of @file{math.h} supplied with libg++ version 2.3 (and possibly other versions as well) declares @code{finite()} as @example double finite (double); @end example @noindent even though some (many? all?) systems declare it as @example int finite (double); @end example If the copy of @file{math.h} from libg++ was installed, you should edit it so that the libg++ declaration of @samp{finite()} matches the system's. @item Problems compiling octave.cc on RS/6000 (and possibly other) systems: If octave.cc fails to compile due to parse errors in system include files and undeclared subroutines like `gethostname' and `endpwent', it is probably because not all of the libg++ include files have been installed. This appears to be a problem with libg++ version 2.3. Here's a fix: Apply the following patch to @file{libg++/config/rs6000.mh} and re-run make install for libg++. @example *** rs6000.mh~ Mon Aug 17 19:18:44 1992 --- rs6000.mh Mon Dec 28 23:54:57 1992 *************** *** 3,6 **** # /usr/include/unistd.h has write(int, char*, unsigned) instead # of write(int, const void*, size_t). This causes problems due # to g++ new pedantic dis-allowal of void* -> char* conversions. ! G_CONFIG_ARGS = "HAVE_UNISTD=0 /*broken*/" --- 3,12 ---- # /usr/include/unistd.h has write(int, char*, unsigned) instead # of write(int, const void*, size_t). This causes problems due # to g++ new pedantic dis-allowal of void* -> char* conversions. ! G_CONFIG_ARGS = "HAVE_UNISTD=0 /*broken*/" ! ! # If the C include files are C++-ready (with extern "C"), ! # define: HAVE_CPLUS_EXTERN = 1 and: WRAP_C_INCLUDES = ! # If not, define HAVE_CPLUS_EXTERN = 0, and do not define ! # WRAP_C_INCLUDES here. ! HAVE_CPLUS_EXTERN = 0 @end example @end ignore @end itemize @node Binary Distributions, , Installation Problems, Installation @appendixsec Binary Distributions This section contains instructions for creating and installing a binary distribution. @menu * Installing Octave from a Binary Distribution:: * Creating a Binary Distribution:: @end menu @node Installing Octave from a Binary Distribution, Creating a Binary Distribution, Binary Distributions, Binary Distributions @appendixsubsec Installing Octave from a Binary Distribution @itemize @bullet @item To install Octave from a binary distribution, execute the command @example sh ./doinstall.sh @end example @noindent in the top level directory of the distribution. Binary distributions are normally compiled assuming that Octave will be installed in the following subdirectories of @file{/usr/local}. @table @file @item bin Octave and other binaries that people will want to run directly. @item man/man1 Unix-style man pages describing Octave. @item info Info files describing Octave. @item lib/octave/@var{version}/m Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. @item lib/octave/@var{version}/exec/@var{host_type} Executables to be run by Octave rather than the user. @ignore @item lib/octave/@var{version}/oct/@var{host_type} Object files that will be dynamically loaded. @end ignore @item lib/octave/@var{version}/imagelib Image files that are distributed with Octave. @end table @noindent where @var{version} stands for the current version number of the interpreter, and @var{host_type} is the type of computer on which Octave is installed (for example, @samp{i486-unknown-gnu}). If these directories don't exist, the script @file{doinstall.sh} will create them for you. If this is possible for you to install Octave in @file{/usr/local}, or if you would prefer to install it in a different directory, you can specify the name of the top level directory as an argument to the doinstall.sh script. For example: @example sh ./doinstall.sh /some/other/directory @end example @noindent Octave will then be installed in subdirectories of the directory @file{/some/other/directory} @end itemize @node Creating a Binary Distribution, , Installing Octave from a Binary Distribution, Binary Distributions @appendixsubsec Creating a Binary Distribution Here is how to build a binary distribution for others. @itemize @bullet @item Build Octave in the same directory as the source. This is required since the @samp{binary-dist} targets in the Makefiles will not work if you compile outside the source tree. @item Use @samp{CFLAGS=-O CXXFLAGS=-O LDFLAGS=} as arguments for Make because most people who get the binary distributions are probably not going to be interested in debugging Octave. @item Type @samp{make binary-dist}. This will build everything and then pack it up for distribution. @end itemize octave-1.1.0/doc/install1.texi100666 415 17 1151 5702421134 14322 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @setfilename INSTALL @set INSTALLONLY @include conf.texi @c The immediately following lines apply to the INSTALL file @c which is generated using this file. This file documents the installation of Octave. Octave 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. @node Installation, Installation, Installation, (dir) @chapter Installing Octave @include install.texi @bye octave-1.1.0/doc/intro.texi100666 415 17 40146 5705307412 13762 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Introduction, Invoking Octave, Copying, Top @chapter A Brief Introduction to Octave @cindex introduction This manual documents how to run, install and port Octave, and how to report bugs. Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems numerically, and for performing other numerical experiments. It may also be used as a batch-oriented language. This document corresponds to Octave version @value{VERSION}. @c XXX FIXME XXX -- add explanation about how and why Octave was written. @c @c XXX FIXME XXX -- add a sentence or two explaining that we could @c always use more funding. @menu * Running Octave:: * Simple Examples:: * Executable Octave Programs:: * Comments:: * Errors:: @end menu @node Running Octave, Simple Examples, Introduction, Introduction @section Running Octave On most systems, the way to invoke Octave is with the shell command @samp{octave}. Octave displays an initial message and then a prompt indicating it is ready to accept input. You can begin typing Octave commands immediately afterward. If you get into trouble, you can usually interrupt Octave by typing @kbd{Control-C} (usually written @kbd{C-c} for short). @kbd{C-c} gets its name from the fact that you type it by holding down the @kbd{CTRL} key and then pressing @kbd{c}. Doing this will normally return you to Octave's prompt. To exit Octave, type @samp{quit}, or @samp{exit} at the Octave prompt. @cindex exiting octave @cindex quitting octave @findex exit @findex quit On systems that support job control, you can suspend Octave by sending it a @code{SIGTSTP} signal, usually by typing @kbd{C-z}. @node Simple Examples, Executable Octave Programs, Running Octave, Introduction @section Simple Examples The following chapters describe all of Octave's features in detail, but before doing that, it might be helpful to give a sampling of some of its capabilities. If you are new to Octave, I recommend that you try these examples to begin learning Octave by using it. Lines marked with @samp{octave:13>} are lines you type, ending each with a carriage return. Octave will respond with an answer, or by displaying a graph. @unnumberedsubsec Creating a Matrix To create a new matrix and store it in a variable so that it you can refer to it later, type the command @example octave:1> a = [ 1, 1, 2; 3, 5, 8; 13, 21, 34 ] @end example @noindent Octave will respond by printing the matrix in neatly aligned columns. Ending a command with a semicolon tells Octave to not print the result of a command. For example @example octave:2> b = rand (3, 2); @end example @noindent will create a 3 row, 2 column matrix with each element set to a random value between zero and one. To display the value of any variable, simply type the name of the variable. For example, to display the value stored in the matrix @samp{b}, type the command @example octave:3> b @end example @unnumberedsubsec Matrix Arithmetic Octave has a convenient operator notation for performing matrix arithmetic. For example, to multiply the matrix @code{a} by a scalar value, type the command @example octave:4> 2 * a @end example To multiply the two matrices @var{a} and @var{b}, type the command @example octave:5> a * b @end example To form the matrix product @iftex @tex $a^Ta$, @end tex @end iftex @ifinfo @code{transpose (a) * a}, @end ifinfo type the command @example octave:6> a' * a @end example @unnumberedsubsec Solving Linear Equations To solve the set of linear equations @iftex @tex ${\bf Ax} = {\bf b}$, @end tex @end iftex @ifinfo @code{Ax = b}, @end ifinfo use the left division operator, @samp{\}: @example octave:7> a \ b @end example @noindent This is conceptually equivalent to @iftex @tex ${\bf A}^{-1}{\bf b}$, @end tex @end iftex @ifinfo inv (A) * b, @end ifinfo but avoids computing the inverse of a matrix directly. If the coefficient matrix is singular, Octave will print a warning message and compute a minimum norm solution. @unnumberedsubsec Integrating Differential Equations Octave has built-in functions for solving nonlinear differential equations of the form @iftex @tex $$ {dx \over dt} = f(x,t), \qquad {\rm with} x(t=t_0) = x_0 $$ @end tex @end iftex @ifinfo @example dx -- = f (x, t) dt @end example @noindent with the initial condition @example x(t = t0) = x0 @end example @end ifinfo @noindent For Octave to integrate equations of this form, you must first provide a definition of the function @iftex @tex $f (x, t)$. @end tex @end iftex @ifinfo @code{f(x,t)}. @end ifinfo This is straightforward, and may be accomplished by entering the function body directly on the command line. For example, the following commands define the right hand side function for an interesting pair of nonlinear differential equations. Note that while you are entering a function, Octave responds with a different prompt, to indicate that it is waiting for you to complete your input. @example octave:8> function xdot = f (x, t) > > r = 0.25; > k = 1.4; > a = 1.5; > b = 0.16; > c = 0.9; > d = 0.8; > > xdot(1) = r*x(1)*(1 - x(1)/k) - a*x(1)*x(2)/(1 + b*x(1)); > xdot(2) = c*a*x(1)*x(2)/(1 + b*x(1)) - d*x(2); > > endfunction @end example @noindent Given the initial condition @example x0 = [1; 2]; @end example @noindent and the set of output times as a column vector (note that the first output time corresponds to the initial condition given above) @example t = linspace (0, 50, 200)'; @end example @noindent it is easy to integrate the set of differential equations: @example x = lsode ("f", x0, t); @end example @noindent The function @samp{lsode} uses the Livermore Solver for Ordinary Differential Equations, described in A. C. Hindmarsh, @cite{ODEPACK, a Systematized Collection of ODE Solvers}, in: Scientific Computing, R. S. Stepleman et al. (Eds.), North-Holland, Amsterdam, 1983, pages 55--64. @unnumberedsubsec Producing Graphical Output To display the solution of the previous example graphically, use the command @example plot (t, x) @end example If you are using the X Window System, Octave will automatically create a separate window to display the plot. If you are using a terminal that supports some other graphics commands, you will need to tell Octave what kind of terminal you have. Type the command @example set term @end example @noindent to see a list of the supported terminal types. Octave uses @code{gnuplot} to display graphics, and can display graphics on any terminal that is supported by @code{gnuplot}. To capture the output of the plot command in a file rather than sending the output directly to your terminal, you can use a set of commands like this @example @group set term postscript set output "foo.ps" replot @end group @end example @noindent This will work for other types of output devices as well. Octave's @samp{set} command is really just piped to the @code{gnuplot} subprocess, so that once you have a plot on the screen that you like, you should be able to do something like this to create an output file suitable for your graphics printer. Or, you can eliminate the intermediate file by using commands like this @example @group set term postscript set output "|lpr -Pname_of_your_graphics_printer" replot @end group @end example @unnumberedsubsec Editing What You Have Typed At the Octave prompt, you can recall, edit, and reissue previous commands using Emacs- or vi-style editing commands. The default keybindings use Emacs-style commands. For example, to recall the previous command, type @kbd{Control-P} (usually written @kbd{C-p} for short). @kbd{C-p} gets its name from the fact that you type it by holding down the @kbd{CTRL} key and then pressing @kbd{p}. Doing this will normally bring back the previous line of input. @kbd{C-n} will bring up the next line of input, @kbd{C-b} will move the cursor backward on the line, @kbd{C-f} will move the cursor forward on the line, etc. A complete description of the command line editing capability is given in this manual in Appendix @ref{Command Line Editing}. @unnumberedsubsec Getting Help Octave has an extensive help facility. The same documentation that is available in printed form is also available from the Octave prompt, because both forms of the documentation are created from the same input file. In order to get good help you first need to know the name of the command that you want to use. This name of the function may not always be obvious, but a good place to start is to just type @code{help}. This will show you all the operators, reserved words, functions, built-in variables, and function files. You can then get more help on anything that is listed by simply including the name as an argument to help. For example, @example help plot @end example @noindent will display the help text for the @code{plot} function. Octave sends output that is too long to fit on one screen through a pager like @code{less} or @code{more}. Type a carriage return to advance one line, a space character to advance one page, and @samp{q} to exit the pager. @unnumberedsubsubsec Help via Info The part of Octave's help facility that allows you to read the complete text of the printed manual from within Octave uses a program called Info. When you invoke Info you will be put into a menu driven program that contains the entire Octave manual. Help for using Info is provided in this manual in Appendix @ref{Using Info}. @node Executable Octave Programs, Comments, Simple Examples, Introduction @section Executable Octave Programs @cindex executable scripts @cindex scripts, executable @cindex self contained programs @cindex program, self contained @cindex @samp{#!} Once you have learned Octave, you may want to write self-contained Octave scripts, using the @samp{#!} script mechanism. You can do this on many Unix systems @footnote{The @samp{#!} mechanism works on Unix systems derived from Berkeley Unix, System V Release 4, and some System V Release 3 systems.} (and someday on GNU). For example, you could create a text file named @file{hello}, containing the following lines: @example #! /usr/local/bin/octave -qf # a sample Octave program printf ("Hello, world!\n"); @end example @noindent After making this file executable (with the @code{chmod} command), you can simply type: @example hello @end example @noindent at the shell, and the system will arrange to run Octave @footnote{The line beginning with @samp{#!} lists the full file name of an interpreter to be run, and an optional initial command line argument to pass to that interpreter. The operating system then runs the interpreter with the given argument and the full argument list of the executed program. The first argument in the list is the full file name of the Octave program. The rest of the argument list will either be options to Octave, or data files, or both. The @code{-qf} option is usually specified in stand-alone Octave programs to prevent them from printing the normal startup message, and to keep them from behaving differently depending on the contents of a particular user's @file{~/.octaverc} file. @xref{Invoking Octave}.} as if you had typed: @example octave hello @end example @noindent Self-contained Octave scripts are useful when you want to write a program which users can invoke without knowing that the program is written in the Octave language. @node Comments, Errors, Executable Octave Programs, Introduction @section Comments in Octave Programs @cindex @samp{#} @cindex @samp{%} @cindex comments @cindex use of comments @cindex documenting Octave programs @cindex programs, documenting A @dfn{comment} is some text that is included in a program for the sake of human readers, and that is not really part of the program. Comments can explain what the program does, and how it works. Nearly all programming languages have provisions for comments, because programs are typically hard to understand without them. In the Octave language, a comment starts with either the sharp sign character, @samp{#}, or the percent symbol @samp{%} and continues to the end of the line. The Octave interpreter ignores the rest of a line following a sharp sign or percent symbol. For example, we could have put the following into the function @code{f}: @smallexample function xdot = f (x, t) # usage: f (x, t) # # This function defines the right-hand-side functions for a set of # nonlinear differential equations. r = 0.25 and so on... endfunction @end smallexample The @code{help} command (@pxref{Help}) is able to find the first block of comments in a function (even those that are composed directly on the command line). This means that users of Octave can use the same commands to get help for built-in functions, and for functions that you have defined. For example, after defining the function @code{f} above, the command @example help f @end example @noindent produces the output @smallexample usage: f (x, t) This function defines the right-hand-side functions for a set of nonlinear differential equations. @end smallexample Although it is possible to put comment lines into keyboard-composed throw-away Octave programs, it usually isn't very useful, because the purpose of a comment is to help you or another person understand the program at a later time. @node Errors, , Comments, Introduction @section Errors There are two classes of errors that Octave produces when it encounters input that it is unable to understand, or when it is unable to perform an action. A @dfn{parse error} occurs if Octave cannot understand something you have typed. For example, if you misspell a keyword, @example octave:13> functon y = f (x) y = x^2; endfunction @end example @noindent Octave will respond immediately with a message like this: @example parse error: functon y = f (x) y = x^2; endfunction ^ @end example @noindent For most parse errors, Octave uses a caret (@samp{^}) to mark the point on the line where it was unable to make sense of your input. In this case, Octave generated an error message because the keyword @code{function} was misspelled. Instead of seeing @samp{function f}, Octave saw two consecutive variable names, which is invalid in this context. It marked the error at the @code{y} because the first name by itself was accepted as valid input. Another class of error message occurs occurs at evaluation time. These errors are called @dfn{run-time errors}, or sometimes @dfn{evaluation errors} because they occur when your program is being @dfn{run}, or @dfn{evaluated}. For example, if after correcting the mistake in the previous function definition, you type @example octave:13> f () @end example @noindent Octave will respond with @example error: `x' undefined near line 1 column 24 error: evaluating expression near line 1, column 24 error: evaluating assignment expression near line 1, column 22 error: called from `f' @end example This error message has several parts, and gives you quite a bit of information to help you locate the source of the error. The messages are generated from the point of the innermost error, and provide a traceback of enclosing expression and function calls. In the example above, the first line indicates that a variable named @samp{x} was found to be undefined near line 1 and column 24 of some function or expression. For errors occurring within functions, lines are numbered beginning with the line containing the @samp{function} keyword. For errors occurring at the top level, the line number indicates the input line number, which is usually displayed in the prompt string. The second and third lines in the example indicate that the error occurred within an assignment expression, and the last line of the error message indicates that the error occurred within the function @samp{f}. If the function @samp{f} had been called from another function, say @samp{g}, the list of errors would have ended with one more line: @example error: called from `g' @end example These lists of function calls usually make it fairly easy to trace the path your program took before the error occurred, and to correct the error before trying again. octave-1.1.0/doc/invoke.texi100666 415 17 10770 5705277166 14136 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Invoking Octave, Expressions, Introduction, Top @chapter Invoking Octave Normally, Octave is used interactively by running the program @samp{octave} without any arguments. Once started, Octave reads commands from the terminal until you tell it to exit. You can also specify the name of a file on the command line, and Octave will read and execute the commands from the named file and then exit when it is finished. You can further control how Octave starts up by using the command-line options described in the next section, and Octave itself can remind you of the options available. Type @example octave --help @end example @noindent to display all available options and briefly describe their use (@samp{octave -h} is a shorter equivalent). @menu * Command Line Options:: * Startup Files:: @end menu @node Command Line Options, Startup Files, Invoking Octave, Invoking Octave @section Command Line Options @cindex Octave command options @cindex command options @cindex options, Octave command @table @code @item --debug @itemx -d @cindex @code{--debug} @cindex @code{-d} Enter parser debugging mode. Using this option will cause Octave's parser to print a lot of information about the commands it reads, and is probably only useful if you are actually trying to debug the parser. @item --help @itemx -h @itemx -? @cindex @code{--help} @cindex @code{-h} @cindex @code{-?} Print short help message and exit. @item --ignore-init-file @itemx --norc @itemx -f @cindex @code{--ignore-init-file} @cindex @code{--norc} @cindex @code{-f} Don't read any of the system or user initialization files at startup. @item --info-file @var{filename} @cindex @code{--info-file @var{filename}} Specify the name of the info file to use. The value of @var{filename} specified on the command line will override any value of @samp{OCTAVE_INFO_FILE} found in the environment, but not any @samp{INFO_FILE = "filename"} commands found in the system or user startup files. @item --interactive @itemx -i @cindex @code{--interactive} @cindex @code{-i} Force interactive behavior. @item --path @var{path} @itemx -p @var{path} @cindex @code{--path @var{path}} @cindex @code{-p @var{path}} Specify the path to search for function files. The value of @var{path} specified on the command line will override any value of @samp{OCTAVE_PATH} found in the environment, but not any @samp{LOADPATH = "path"} commands found in the system or user startup files. @item --silent @itemx --quiet @itemx -q @cindex @code{--silent} @cindex @code{--quiet} @cindex @code{-q} Don't print message at startup. @item --verbose @itemx -V @cindex @code{--verbose} @cindex @code{-V} Turn on verbose output. @item --version @itemx -v @cindex @code{--version} @cindex @code{-v} Print the program version number and exit. @item --echo-commands @itemx -x @cindex @code{--echo-commands} @cindex @code{-x} Echo commands as they are executed. @item @var{file} Execute commands from @var{file}. @end table @node Startup Files, , Command Line Options, Invoking Octave @section Startup Files @cindex initialization @cindex startup When Octave starts, it looks for commands to execute from the following files: @ftable @code @item OCTAVE_HOME/lib/octave/VERSION/startup/octaverc Where @code{OCTAVE_HOME} is the directory in which all of Octave is installed (the default is @file{/usr/local}), and @code{VERSION} is the version number of Octave. This file is provided so that changes to the default Octave environment can be made globally for all users. Some care should be taken when making changes to this file, since all users of Octave at your site will be affected. @item ~/.octaverc This file is normally used to make personal changes to the default Octave environment. @item .octaverc This file can be used to make changes to the default Octave environment for a particular project. Octave searches for this file after it reads @file{~/.octaverc}, so any use of the @code{cd} command in the @file{~/.octaverc} file will affect the directory that Octave searches for the file @file{.octaverc}. If you start Octave in your home directory, it will avoid executing commands from @file{~/.octaverc} twice. @end ftable A message will be displayed as each of these files is read if you invoke Octave with the @code{--verbose} option but without the @code{--silent} option. Startup files may contain any valid Octave commands, including multiple function definitions. octave-1.1.0/doc/linalg.texi100666 415 17 35376 5705274054 14113 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Linear Algebra, Polynomial Manipulations, Arithmetic, Top @chapter Linear Algebra This chapter documents the linear algebra functions of Octave. Reference material for many of these options may be found in Golub and Van Loan, @cite{Matrix Computations, 2nd Ed.}, Johns Hopkins, 1989, and in @cite{LAPACK Users' Guide}, SIAM, 1992. @menu * Basic Matrix Functions:: * Matrix Factorizations:: * Functions of a Matrix:: @end menu @node Basic Matrix Functions, Matrix Factorizations, Linear Algebra, Linear Algebra @section Basic Matrix Functions @ftable @code @item balance @example aa = balance (a, opt) [dd, aa] = balance(a, opt) [dd, aa] = balance (a, opt) [cc, dd, aa, bb] = balance (a, b, opt) @end example @code{[dd, aa] = balance (a)} returns @code{aa = dd \ a * dd}. @code{aa} is a matrix whose row/column norms are roughly equal in magnitude, and @code{dd} = @code{p * d}, where @code{p} is a permutation matrix and @code{d} is a diagonal matrix of powers of two. This allows the equilibration to be computed without roundoff. Results of eigenvalue calculation are typically improved by balancing first. @code{[cc, dd, aa, bb] = balance (a, b)} returns @code{aa} (@code{bb}) @code{= cc*a*dd (cc*b*dd)}), where @code{aa} and @code{bb} have non-zero elements of approximately the same magnitude and @code{cc} and @code{dd} are permuted diagonal matrices as in @code{dd} for the algebraic eigenvalue problem. The eigenvalue balancing option @code{opt} is selected as follows: @table @asis @item @code{"N"}, @code{"n"} No balancing; arguments copied, transformation(s) set to identity. @item @code{"P"}, @code{"p"} Permute argument(s) to isolate eigenvalues where possible. @item @code{"S"}, @code{"s"} Scale to improve accuracy of computed eigenvalues. @item @code{"B"}, @code{"b"} Permute and scale, in that order. Rows/columns of a (and b) that are isolated by permutation are not scaled. This is the default behavior. @end table Algebraic eigenvalue balancing uses standard LAPACK routines. Generalized eigenvalue problem balancing uses Ward's algorithm (SIAM Journal on Scientific and Statistical Computing, 1981). @item cond (@var{a}) Compute the (two-norm) condition number of a matrix. @code{cond (a)} is defined as @code{norm (a) * norm (inv (a))}, and is computed via a singular value decomposition. @item det (@var{a}) Compute the determinant of @var{a} using LINPACK. @item eig @example = eig (a) [v, lambda] = eig (a) @end example The eigenvalues (and eigenvectors) of a matrix are computed in a several step process which begins with a Hessenberg decomposition (see @code{hess}), followed by a Schur decomposition (see @code{schur}), from which the eigenvalues are apparent. The eigenvectors, when desired, are computed by further manipulations of the Schur decomposition. See also: @code{hess}, @code{schur}. @item givens @example [c, s] = givens (x, y) G = givens (x, y) @end example @code{G = givens(x, y)} returns a @iftex @tex $2\times 2$ @end tex @end iftex @ifinfo 2 x 2 @end ifinfo orthogonal matrix @code{G = [c s; -s' c]} such that @code{G [x; y] = [*; 0]} (x, y scalars) @item inv (@var{a}) @itemx inverse (@var{a}) Compute the inverse of the square matrix @var{a}. @item norm (@var{a}, @var{p}) Compute the p-norm of the matrix @var{a}. If the second argument is missing, @code{p = 2} is assumed. If @var{a} is a matrix: @table @asis @item @var{p} = @code{1} 1-norm, the largest column sum of @var{a}. @item @var{p} = @code{2} Largest singular value of @var{a}. @item @var{p} = @code{Inf} Infinity norm, the largest row sum of @var{a}. @item @var{p} = @code{"fro"} Frobenius norm of @var{a}, @code{sqrt (sum (diag (a' * a)))}. @end table If @var{a} is a vector or a scalar: @table @asis @item @var{p} = @code{Inf} @code{max (abs (a))}. @item @var{p} = @code{-Inf} @code{min (abs (a))}. @item other p-norm of @var{a}, @code{(sum (abs (a) .^ p)) ^ (1/p)}. @end table @item null (@var{a}, @var{tol}) Returns an orthonormal basis of the null space of @var{a}. The dimension of the null space is taken as the number of singular values of @var{a} not greater than @var{tol}. If the argument @var{tol} is missing, it is computed as @example max (size (a)) * max (svd (a)) * eps @end example @item orth (@var{a}, @var{tol}) Returns an orthonormal basis of the range of @var{a}. The dimension of the range space is taken as the number of singular values of @var{a} greater than @var{tol}. If the argument @var{tol} is missing, it is computed as @example max (size (a)) * max (svd (a)) * eps @end example @item pinv (@var{X}, @var{tol}) Returns the pseudoinverse of @var{X}. Singular values less than @var{tol} are ignored. If the second argument is omitted, it is assumed that @example tol = max (size (X)) * sigma_max (X) * eps, @end example @noindent where @code{sigma_max (@var{X})} is the maximal singular value of @var{X}. @item rank (@var{a}, @var{tol}) Compute the rank of @var{a}, using the singular value decomposition. The rank is taken to be the number of singular values of @var{a} that are greater than the specified tolerance @var{tol}. If the second argument is omitted, it is taken to be @example tol = max (size (a)) * sigma (1) * eps; @end example @noindent where @code{eps} is machine precision and @code{sigma} is the largest singular value of @code{a}. @item trace (@var{a}) Compute the trace of @var{a}, @code{sum (diag (a))}. @end ftable @node Matrix Factorizations, Functions of a Matrix, Basic Matrix Functions, Linear Algebra @section Matrix Factorizations @ftable @code @item chol (@var{a}) Compute the Cholesky factor, @var{r}, of the symmetric positive definite matrix @var{a}, where @iftex @tex $ R^T R = A $. @end tex @end iftex @ifinfo @example r' * r = a. @end example @end ifinfo @item hess (@var{a}) Compute the Hessenberg decomposition of the matrix @var{a}. @example h = hess (a) [p, h] = hess (a) @end example The Hessenberg decomposition is usually used as the first step in an eigenvalue computation, but has other applications as well (see Golub, Nash, and Van Loan, IEEE Transactions on Automatic Control, 1979. The Hessenberg decomposition is @code{p * h * p' = a} where @code{p} is a square unitary matrix (@code{p' * p = I}, using complex-conjugate transposition) and @code{h} is upper Hessenberg (@code{i >= j+1 => h (i, j) = 0}). @item lu (@var{a}) Compute the LU decomposition of @var{a}, using subroutines from LAPACK. The result is returned in a permuted form, according to the optional return value @var{p}. For example, given the matrix @code{a = [1, 2; 3, 4]}, @example [l, u, p] = lu (a) @end example @noindent returns @example l = 1.00000 0.00000 0.33333 1.00000 u = 3.00000 4.00000 0.00000 0.66667 p = 0 1 1 0 @end example @item qr (@var{a}) Compute the QR factorization of @var{a}, using standard LAPACK subroutines. For example, given the matrix @code{a = [1, 2; 3, 4]}, @example [q, r] = qr (a) @end example @noindent returns @example q = -0.31623 -0.94868 -0.94868 0.31623 r = -3.16228 -4.42719 0.00000 -0.63246 @end example The @code{qr} factorization has applications in the solution of least squares problems @iftex @tex $$ \min_x \left\Vert A x - b \right\Vert_2 $$ @end tex @end iftex @ifinfo @example @code{min norm(A x - b)} @end example @end ifinfo for overdetermined systems of equations (i.e., @iftex @tex $A$ @end tex @end iftex @ifinfo @code{a} @end ifinfo is a tall, thin matrix). The @code{qr} factorization is @code{q * r = a} where @code{q} is an orthogonal matrix and @code{r} is upper triangular. The permuted @code{qr} factorization @code{[q, r, pi] = qr (a)} forms the @code{qr} factorization such that the diagonal entries of @code{r} are decreasing in magnitude order. For example, given the matrix @code{a = [1, 2; 3, 4]}, @example [q, r, pi] = qr(a) @end example @noindent returns @example q = -0.44721 -0.89443 -0.89443 0.44721 r = -4.47214 -3.13050 0.00000 0.44721 p = 0 1 1 0 @end example The permuted @code{qr} factorization @code{[q, r, pi] = qr (a)} factorization allows the construction of an orthogonal basis of @code{span (a)}. @item schur @example [u, s] = schur (a, opt) opt = "a", "d", or "u" s = schur (a) @end example The Schur decomposition is used to compute eigenvalues of a square matrix, and has applications in the solution of algebraic Riccati equations in control (see @code{are} and @code{dare}). @code{schur} always returns @iftex @tex $S = U^T A U$ @end tex @end iftex @ifinfo @code{s = u' * a * u} @end ifinfo where @iftex @tex $U$ @end tex @end iftex @ifinfo @code{u} @end ifinfo is a unitary matrix @iftex @tex ($U' U$ @end tex @end iftex @ifinfo (@code{u'* u} @end ifinfo is identity) and @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo is upper triangular. The eigenvalues of @iftex @tex $A$ (and $S$) @end tex @end iftex @ifinfo @code{a} (and @code{s}) @end ifinfo are the diagonal elements of @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo If the matrix @iftex @tex $A$ @end tex @end iftex @ifinfo @code{a} @end ifinfo is real, then the real Schur decomposition is computed, in which the matrix @iftex @tex $U$ @end tex @end iftex @ifinfo @code{u} @end ifinfo is orthogonal and @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo is block upper triangular with blocks of size at most @iftex @tex $2\times 2$ @end tex @end iftex @ifinfo @code{2 x 2} @end ifinfo blocks along the diagonal. The diagonal elements of @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo (or the eigenvalues of the @iftex @tex $2\times 2$ @end tex @end iftex @ifinfo @code{2 x 2} @end ifinfo blocks, when appropriate) are the eigenvalues of @iftex @tex $A$ @end tex @end iftex @ifinfo @code{a} @end ifinfo and @iftex @tex $S$. @end tex @end iftex @ifinfo @code{s}. @end ifinfo The eigenvalues are optionally ordered along the diagonal according to the value of @code{opt}. @code{opt = "a"} indicates that all eigenvalues with negative real parts should be moved to the leading block of @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo (used in @code{are}), @code{opt = "d"} indicates that all eigenvalues with magnitude less than one should be moved to the leading block of @iftex @tex $S$ @end tex @end iftex @ifinfo @code{s} @end ifinfo (used in @code{dare}), and @code{opt = "u"}, the default, indicates that no ordering of eigenvalues should occur. The leading @iftex @tex $k$ @end tex @end iftex @ifinfo @code{k} @end ifinfo columns of @iftex @tex $U$ @end tex @end iftex @ifinfo @code{u} @end ifinfo always span the @iftex @tex $A$-invariant @end tex @end iftex @ifinfo @code{a}-invariant @end ifinfo subspace corresponding to the @iftex @tex $k$ @end tex @end iftex @ifinfo @code{k} @end ifinfo leading eigenvalues of @iftex @tex $S$. @end tex @end iftex @ifinfo @code{s}. @end ifinfo @item svd (@var{a}) Compute the singular value decomposition of @var{a} @iftex @tex $$ A = U\Sigma V^H $$ @end tex @end iftex @ifinfo @example a = u * sigma * v' @end example @end ifinfo The function @code{svd} normally returns the vector of singular values. If asked for three return values, it computes @iftex @tex $U$, $S$, and $V$. @end tex @end iftex @ifinfo U, S, and V. @end ifinfo For example, @example svd (hilb (3)) @end example @noindent returns @example ans = 1.4083189 0.1223271 0.0026873 @end example @noindent and @example [u, s, v] = svd (hilb (3)) @end example @noindent returns @example u = -0.82704 0.54745 0.12766 -0.45986 -0.52829 -0.71375 -0.32330 -0.64901 0.68867 s = 1.40832 0.00000 0.00000 0.00000 0.12233 0.00000 0.00000 0.00000 0.00269 v = -0.82704 0.54745 0.12766 -0.45986 -0.52829 -0.71375 -0.32330 -0.64901 0.68867 @end example If given a second argument, @code{svd} returns an economy-sized decomposition, eliminating the unnecessary rows or columns of @var{u} or @var{v}. @end ftable @node Functions of a Matrix, , Matrix Factorizations, Linear Algebra @section Functions of a Matrix @ftable @code @item expm @example expm (a) @end example Returns the exponential of a matrix, defined as the infinite Taylor series @iftex @tex $$ \exp (A) = I + A + {A^2 \over 2!} + {A^3 \over 3!} + \cdots $$ @end tex @end iftex @ifinfo @example expm(a) = I + a + a^2/2! + a^3/3! + ... @end example @end ifinfo The Taylor series is @emph{not} the way to compute the matrix exponential; see Moler and Van Loan, @cite{Nineteen Dubious Ways to Compute the Exponential of a Matrix}, SIAM Review, 1978. This routine uses Ward's diagonal @iftex @tex Pad\'e @end tex @end iftex @ifinfo Pade' @end ifinfo approximation method with three step preconditioning (SIAM Journal on Numerical Analysis, 1977). Diagonal @iftex @tex Pad\'e @end tex @end iftex @ifinfo Pade' @end ifinfo approximations are rational polynomials of matrices @iftex @tex $D_q(a)^{-1}N_q(a)$ @end tex @end iftex @ifinfo @example -1 D (a) N (a) @end example @end ifinfo whose Taylor series matches the first @iftex @tex $2 q + 1 $ @end tex @end iftex @ifinfo @code{2q+1} @end ifinfo terms of the Taylor series above; direct evaluation of the Taylor series (with the same preconditioning steps) may be desirable in lieu of the @iftex @tex Pad\'e @end tex @end iftex @ifinfo Pade' @end ifinfo approximation when @iftex @tex $D_q(a)$ @end tex @end iftex @ifinfo @code{Dq(a)} @end ifinfo is ill-conditioned. @item logm (@var{a}) Compute the matrix logarithm of the square matrix @var{a}. Note that this is currently implemented in terms of an eigenvalue expansion and needs to be improved to be more robust. @item sqrtm (@var{a}) Compute the matrix square root of the square matrix @var{a}. Note that this is currently implemented in terms of an eigenvalue expansion and needs to be improved to be more robust. @item kron (@var{a}, @var{b}) Form the kronecker product of two matrices, defined block by block as @example x = [a(i, j) b] @end example @item qzhess (@var{a}, @var{b}) Compute the Hessenberg-triangular decomposition of the matrix pencil @code{(a, b)}. This function returns @code{aa = q * a * z}, @code{bb = q * b * z}, @code{q}, @code{z} orthogonal. For example, @example [aa, bb, q, z] = qzhess (a, b) @end example The Hessenberg-triangular decomposition is the first step in Moler and Stewart's QZ decomposition algorithm. (The QZ decomposition will be included in a later release of Octave.) Algorithm taken from Golub and Van Loan, @cite{Matrix Computations, 2nd edition}. @item qzval (@var{a}, @var{b}) Compute generalized eigenvalues. @item syl (@var{a}, @var{b}, @var{c}) Solve the Sylvester equation @iftex @tex $$ A X + X B + C = 0 $$ @end tex @end iftex @ifinfo @example A X + X B + C = 0 @end example @end ifinfo using standard LAPACK subroutines. @end ftable octave-1.1.0/doc/matrix.texi100666 415 17 21024 5705273224 14130 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Matrix Manipulation, String Functions, Special Matrices, Top @chapter Matrix Manipulation There are a number of functions available for checking to see if the elements of a matrix meet some condition, and for rearranging the elements of a matrix. For example, Octave can easily tell you if all the elements of a matrix are finite, or are less than some specified value. Octave can also rotate the elements, extract the upper- or lower-triangular parts, or sort the columns of a matrix. @menu * Finding Elements and Checking Conditions:: * Rearranging Matrices:: @end menu @node Finding Elements and Checking Conditions, Rearranging Matrices, Matrix Manipulation, Matrix Manipulation @section Finding Elements and Checking Conditions @findex any @findex all The functions @code{any} and @code{all} are useful for determining whether any or all of the elements of a matrix satisfy some condition. Given a vector, the function @code{any} returns 1 if any element of the vector is nonzero. For a matrix argument, @code{any} returns a row vector of ones and zeros with each element indicating whether any of the elements of the corresponding column of the matrix are nonzero. For example, @example octave:13> any (eye (2, 4)) ans = 1 1 0 0 @end example To see if any of the elements of a matrix are nonzero, you can use a statement like @example any (any (a)) @end example For a matrix argument, @code{any} returns a row vector of ones and zeros with each element indicating whether any of the elements of the corresponding column of the matrix are nonzero. The function @code{all} behaves like the function @code{any}, except that it returns true only if all the elements of a vector, or all the elements in a column of a matrix, are nonzero. Since the comparison operators (@pxref{Comparison Ops}) return matrices of ones and zeros, it is easy to test a matrix for many things, not just whether the elements are nonzero. For example, @example octave:13> all (all (rand (5) < 0.9)) ans = 0 @end example @noindent tests a random 5 by 5 matrix to see if all of it's elements are less than 0.9. Note that in conditional contexts (like the test clause of @code{if} and @code{while} statements) Octave treats the test as if you had typed @code{all (all (condition))}. @findex isinf @findex finite @findex isnan The functions @code{isinf}, @code{finite}, and @code{isnan} return 1 if their arguments are infinite, finite, or not a number, respectively, and return 0 otherwise. For matrix values, they all work on an element by element basis. For example, evaluating the expression @example isinf ([1, 2; Inf, 4]) @end example @noindent produces the matrix @example ans = 0 0 1 0 @end example @findex find The function @code{find} returns a vector of indices of nonzero elements of a matrix. To obtain a single index for each matrix element, Octave pretends that the columns of a matrix form one long vector (like Fortran arrays are stored). For example, @example octave:13> find (eye (2)) ans = 1 4 @end example If two outputs are requested, @code{find} returns the row and column indices of nonzero elements of a matrix. For example, @example octave:13> [i, j] = find (eye (2)) i = 1 2 j = 1 2 @end example If three outputs are requested, @code{find} also returns the nonzero values in a vector. @node Rearranging Matrices, , Finding Elements and Checking Conditions, Matrix Manipulation @section Rearranging Matrices @findex fliplr @findex flipud The function @code{fliplr} reverses the order of the columns in a matrix, and @code{flipud} reverses the order of the rows. For example, @example octave:13> fliplr ([1, 2; 3, 4]) ans = 2 1 4 3 octave:13> flipud ([1, 2; 3, 4]) ans = 3 4 1 2 @end example @findex rot90 The function @code{rot90 (@var{a}, @var{n})} rotates a matrix counterclockwise in 90-degree increments. The second argument is optional, and specifies how many 90-degree rotations are to be applied (the default value is 1). Negative values of @var{n} rotate the matrix in a clockwise direction. For example, @example rot90 ([1, 2; 3, 4], -1) ans = 3 1 4 2 @end example @noindent rotates the given matrix clockwise by 90 degrees. The following are all equivalent statements: @example rot90 ([1, 2; 3, 4], -1) rot90 ([1, 2; 3, 4], 3) rot90 ([1, 2; 3, 4], 7) @end example @findex reshape The function @code{reshape (@var{a}, @var{m}, @var{n})} returns a matrix with @var{m} rows and @var{n} columns whose elements are taken from the matrix @var{a}. To decide how to order the elements, Octave pretends that the elements of a matrix are stored in column-major order (like Fortran arrays are stored). For example, @example octave:13> reshape ([1, 2, 3, 4], 2, 2) ans = 1 3 2 4 @end example If the variable @code{do_fortran_indexing} is @code{"true"}, the @code{reshape} function is equivalent to @example retval = zeros (m, n); retval (:) = a; @end example @noindent but it is somewhat less cryptic to use @code{reshape} instead of the colon operator. Note that the total number of elements in the original matrix must match the total number of elements in the new matrix. @findex sort The function @samp{sort} can be used to arrange the elements of a vector in increasing order. For matrices, @code{sort} orders the elements in each column. For example, @example octave:13> sort (rand (4)) ans = 0.065359 0.039391 0.376076 0.384298 0.111486 0.140872 0.418035 0.824459 0.269991 0.274446 0.421374 0.938918 0.580030 0.975784 0.562145 0.954964 @end example The @code{sort} function may also be used to produce a matrix containing the original row indices of the elements in the sorted matrix. For example, @example s = 0.051724 0.485904 0.253614 0.348008 0.391608 0.526686 0.536952 0.600317 0.733534 0.545522 0.691719 0.636974 0.986353 0.976130 0.868598 0.713884 i = 2 4 2 3 4 1 3 4 1 2 4 1 3 3 1 2 @end example @noindent These values may be used to recover the original matrix from the sorted version. For example, @example @end example The @code{sort} function does not allow sort keys to be specified, so it can't be used to order the rows of a matrix according to the values of the elements in various columns@footnote{For example, to first sort based on the values in column 1, and then, for any values that are repeated in column 1, sort based on the values found in column 2, etc.} in a single call. Using the second output, however, it is possible to sort all rows based on the values in a given column. Here's an example that sorts the rows of a matrix based on the values in the third column. @example octave:13> a = rand (4) a = 0.080606 0.453558 0.835597 0.437013 0.277233 0.625541 0.447317 0.952203 0.569785 0.528797 0.319433 0.747698 0.385467 0.124427 0.883673 0.226632 octave:14> [s, i] = sort (a (:, 3)); octave:15> a (i, :) ans = 0.569785 0.528797 0.319433 0.747698 0.277233 0.625541 0.447317 0.952203 0.080606 0.453558 0.835597 0.437013 0.385467 0.124427 0.883673 0.226632 @end example @findex triu @findex tril The functions @code{triu (@var{a}, @var{k})} and @code{tril (@var{a}, @var{k})} extract the upper or lower triangular part of the matrix @var{a}, and set all other elements to zero. The second argument is optional, and specifies how many diagonals above or below the main diagonal should also be set to zero. The default value of @var{k} is zero, so that @code{triu} and @code{tril} normally include the main diagonal as part of the result matrix. If the value of @var{k} is negative, additional elements above (for @code{tril}) or below (for @code{triu}) the main diagonal are also selected. The absolute value of @var{k} must not be greater than the number of sub- or super-diagonals. For example, @example @group octave:13> tril (rand (4), 1) ans = 0.00000 0.00000 0.00000 0.00000 0.09012 0.00000 0.00000 0.00000 0.01215 0.34768 0.00000 0.00000 0.00302 0.69518 0.91940 0.00000 @end group @end example @noindent forms a lower triangular matrix from a random 4 by 4 matrix, omitting the main diagonal, and @example @group octave:13> tril (rand (4), -1) ans = 0.06170 0.51396 0.00000 0.00000 0.96199 0.11986 0.35714 0.00000 0.16185 0.61442 0.79343 0.52029 0.68016 0.48835 0.63609 0.72113 @end group @end example @noindent forms a lower triangular matrix from a random 4 by 4 matrix, including the main diagonal and the first super-diagonal. octave-1.1.0/doc/nonlin.texi100666 415 17 3535 5705073523 14110 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Nonlinear Equations, Differential Equations, Polynomial Manipulations, Top @chapter Nonlinear Equations @cindex nonlinear equations @cindex equations, nonlinear @findex fsolve Octave can solve sets of nonlinear equations of the form @iftex @tex $$ f (x) = 0 $$ @end tex @end iftex @ifinfo @example F (x) = 0 @end example @end ifinfo @noindent using the function @code{fsolve}, which is based on the MINPACK subroutine @code{hybrd}. For example, to solve the set of equations @iftex @tex $$ \eqalign{-2x^2 + 3xy + 4\sin(y) - 6 &= 0\cr 3x^2 - 2xy^2 + 3\cos(x) + 4 &= 0} $$ @end tex @end iftex @ifinfo @example -2x^2 + 3xy + 4 sin(y) = 6 3x^2 - 2xy^2 + 3 cos(x) = -4 @end example @end ifinfo @noindent you first need to write a function to compute the value of the given function. For example: @example function y = f (x) y(1) = -2*x(1)^2 + 3*x(1)*x(2) + 4*sin(x(2)) - 6; y(2) = 3*x(1)^2 - 2*x(1)*x(2)^2 + 3*cos(x(1)) + 4; endfunction @end example Then, call @code{fsolve} with a specified initial condition to find the roots of the system of equations. For example, given the function @code{f} defined above, @example [x, info] = fsolve ("f", [1; 2]) @end example @noindent results in the solution @example x = 0.57983 2.54621 info = 1 @end example A value of @code{info = 1} indicates that the solution has converged. The function @code{perror} may be used to print English messages corresponding to the numeric error codes. For example, @example perror ("fsolve", 1) @end example @noindent prints @example solution converged to requested tolerance @end example @findex fsolve_options Tolerances and other options for @code{fsolve} may be specified using the function @code{fsolve_options}. octave-1.1.0/doc/octave.texi100666 415 17 31777 5705313566 14131 0ustar jweusers% Copyright (C) 1993, 1994, 1995 John W. Eaton % This is part of the Octave manual. % For copying conditions, see the file gpl.texi. \input texinfo @setfilename octave.info @c Settings for printing on 8-1/2 by 11 inch paper: @c ----------------------------------------------- @setchapternewpage odd @iftex @tex \global\chapheadingskip = 15pt plus 4pt minus 2pt \global\secheadingskip = 12pt plus 3pt minus 2pt \global\subsecheadingskip = 9pt plus 2pt minus 2pt \global\parskip 5pt plus 1pt @end tex @end iftex @c Settings for small book format: @c ------------------------------ @c @c @smallbook @c @setchapternewpage odd @c @finalout @c @iftex @c @cropmarks @c @end iftex @defindex op @c Things like the Octave version number are defined in conf.texi. @c This file doesn't include a chapter, so it must not be included @c if you want to run the Emacs function texinfo-multiple-files-update. @include conf.texi @settitle Octave @ifinfo Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. @ignore Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ifinfo @titlepage @title{Octave} @subtitle{A high-level interactive language for numerical computations} @subtitle{Edition 1.1 for Octave version @value{VERSION}} @subtitle{January 1995} @author{John W. Eaton} @page @vskip 0pt plus 1filll Copyright @copyright{} 1993, 1994, 1995 John W. Eaton. This is the first edition of the Octave documentation, and is consistent with version @value{VERSION} of Octave. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the same conditions as for modified versions. @end titlepage @ifinfo @node Top, Preface, (dir), (dir) @top This manual documents how to run, install and port Octave, as well as its new features and incompatibilities, and how to report bugs. It corresponds to Octave version @value{VERSION}. @end ifinfo @menu * Preface:: * Copying:: * Introduction:: A brief introduction to Octave. * Invoking Octave:: Command options supported by Octave. * Expressions:: Expressions. * Statements:: Looping and program flow control. * Functions and Scripts:: * Built-in Variables:: Descriptions of all built-in variables. * Arithmetic:: * Linear Algebra:: * Polynomial Manipulations:: * Nonlinear Equations:: * Differential Equations:: * Optimization:: * Quadrature:: * Control Theory:: * Signal Processing:: * Sets:: * Statistics:: * Plotting:: * Image Processing:: * Input and Output:: * Special Matrices:: * Matrix Manipulation:: * String Functions:: * System Utilities:: * Command History Functions:: * Help:: * Programming Utilities:: * Amusements:: * Installation:: How to configure, compile and install Octave. * Trouble:: If you have trouble installing Octave. * Command Line Editing:: Command history and editing. * Using Info:: * Concept Index:: An item for each concept. * Variable Index:: An item for each documented variable. * Function Index:: An item for each documented function. * Operator Index:: An item for each documented operator. * Readline Index:: An index for readline commands. * Info Index:: An index for info commands. --- The Detailed Node Listing --- A Brief Introduction to Octave * Running Octave:: * Simple Examples:: * Executable Octave Programs:: * Comments:: * Errors:: Invoking Octave * Command Line Options:: * Startup Files:: Expressions * Constant Expressions:: * Matrices:: * Ranges:: * Variables:: * Index Expressions:: * Data Structures:: * Calling Functions:: * Global Variables:: * Keywords:: * Arithmetic Ops:: * Comparison Ops:: * Boolean Expressions:: * Assignment Ops:: * Increment Ops:: * Operator Precedence:: Constant Expressions * Numeric Constants:: * String Constants:: Matrices * Empty Matrices:: Calling Functions * Call by Value:: * Recursion:: Boolean Expressions * Element-by-element Boolean Operators:: * Short-circuit Boolean Operators:: Statements * The if Statement:: * The while Statement:: * The for Statement:: * The break Statement:: * The continue Statement:: * The unwind_protect Statement:: Functions and Script Files * Defining Functions:: * Multiple Return Values:: * Variable-length Argument Lists:: * Variable-length Return Lists:: * Returning From a Function:: * Function Files:: * Script Files:: * Dynamically Linked Functions:: * Organization of Functions:: Built-in Variables * Predefined Constants:: * User Preferences:: * Other Built-in Variables:: * Summary of Preference Variables:: Arithmetic * Utility Functions:: * Complex Arithmetic:: * Trigonometry:: * Sums and Products:: * Special Functions:: Linear Algebra * Basic Matrix Functions:: * Matrix Factorizations:: * Functions of a Matrix:: Differential Equations * Ordinary Differential Equations:: * Differential-Algebraic Equations:: Optimization * Quadratic Programming:: * Nonlinear Programming:: * Linear Least Squares:: Quadrature * Functions of one Variable:: * Orthogonal Collocation:: Plotting * Two-Dimensional Plotting:: * Three-Dimensional Plotting:: * Miscellaneous Plotting Functions:: Input and Output * Basic Input and Output:: * C-Style I/O Functions:: C-Style I/O Functions * Opening and Closing Files:: * Formatted Output:: * Output Conversion Syntax:: * Table of Output Conversions:: * Integer Conversions:: * Floating-Point Conversions:: * Other Output Conversions:: * Formatted Input:: * Input Conversion Syntax:: * Table of Input Conversions:: * Numeric Input Conversions:: * String Input Conversions:: * Binary I/O:: * Other I/O Functions:: Special Matrices * Special Utility Matrices:: * Famous Matrices:: Matrix Manipulation * Finding Elements and Checking Conditions:: * Rearranging Matrices:: System Utilities * Timing Utilities:: * Interacting with the OS:: * System Information:: * Other Functions:: Programming Utilities * Evaluating Strings as Commands:: * Miscellaneous Utilities:: Installing Octave * Installation Problems:: * Binary Distributions:: Binary Distributions * Installing Octave from a Binary Distribution:: * Creating a Binary Distribution:: Known Causes of Trouble with Octave * Actual Bugs:: Bugs we will fix later. * Reporting Bugs:: * Bug Criteria:: * Bug Lists:: * Bug Reporting:: * Sending Patches:: * Service:: Reporting Bugs * Bug Criteria:: * Where: Bug Lists. Where to send your bug report. * Reporting: Bug Reporting. How to report a bug effectively. * Patches: Sending Patches. How to send a patch for Octave. Command Line Editing * Introduction and Notation:: Notation used in this text. * Readline Interaction:: The minimum set of commands for editing a line. * Readline Bare Essentials:: * Readline Movement Commands:: * Readline Killing Commands:: * Readline Arguments:: * Readline Init File:: Customizing Readline from a user's view. * Readline Init Syntax:: * Readline Vi Mode:: Readline Interaction * Readline Bare Essentials:: The least you need to know about Readline. * Readline Movement Commands:: Moving about the input line. * Readline Killing Commands:: How to delete text, and how to get it back! * Readline Arguments:: Giving numeric arguments to commands. Readline Init File * Readline Init Syntax:: Syntax for the commands in @file{~/.inputrc}. * Readline Vi Mode:: Switching to @code{vi} mode in Readline. Readline Init Syntax * Commands For Moving:: Moving about the line. * Commands For History:: Getting at previous lines. * Commands For Text:: Commands for changing text. * Commands For Killing:: Commands for killing and yanking. * Numeric Arguments:: Specifying numeric arguments, repeat counts. * Commands For Completion:: Getting Readline to do the typing for you. * Miscellaneous Commands:: Other miscellaneous commands. Using Info * Cursor Commands:: * Scrolling Commands:: * Node Commands:: * Searching Commands:: * Xref Commands:: * Window Commands:: * Printing Nodes:: * Other Info Commands:: * Info Variables:: Using Info * Cursor Commands:: Commands which move the cursor within a node. * Scrolling Commands:: Commands for moving the node around in a window. * Node Commands:: Commands for selecting a new node. * Searching Commands:: Commands for searching an info file. * Xref Commands:: Commands for selecting cross references. * Window Commands:: Commands which manipulate multiple windows. * Printing Nodes:: How to print out the contents of a node. * Other Info Commands:: A few commands that defy categories. * Info Variables:: How to change the default behavior of Info. Selecting Cross References * Parts of an Xref:: What a cross reference is made of. * Selecting Xrefs:: Commands for selecting menu or note items. Manipulating Multiple Windows * The Mode Line:: What appears in the mode line? * Basic Windows:: Manipulating windows in Info. * The Echo Area:: Used for displaying errors and reading input. @end menu @include preface.texi @include gpl.texi @include intro.texi @include invoke.texi @include expr.texi @include stmt.texi @include func.texi @include var.texi @include arith.texi @include linalg.texi @include poly.texi @include nonlin.texi @include diffeq.texi @include optim.texi @include quad.texi @include control.texi @include signal.texi @include set.texi @include stats.texi @include plot.texi @include image.texi @include io.texi @include special.texi @include matrix.texi @include strings.texi @include system.texi @include history.texi @include help.texi @include program.texi @include amuse.texi @c Appendices start here. Installation and bugs have to go before the @c readline and Info appendices because we want to have separate indices @c for them, and there appears to be no way to go back to the original @c set of indices once a redirection has taken place. @include install.texi @include bugs.texi @c Make a separate index for all readline commands, functions, and @c concepts. @defindex rd @syncodeindex cp rd @syncodeindex fn rd @syncodeindex ky rd @syncodeindex vr rd @include rluser.texi @c Make a separate index for all Info commands, functions, and concepts. @defindex in @syncodeindex cp in @syncodeindex fn in @syncodeindex ky in @syncodeindex vr in @include gnuinfo.texi @include cp-idx.texi @include vr-idx.texi @include fn-idx.texi @include op-idx.texi @include rd-idx.texi @include in-idx.texi @contents @bye octave-1.1.0/doc/op-idx.texi100666 415 17 356 5705073511 13766 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Operator Index, Readline Index, Function Index, Top @unnumbered Operator Index @printindex op octave-1.1.0/doc/optim.texi100666 415 17 6613 5705272036 13743 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Optimization, Quadrature, Differential Equations, Top @chapter Optimization @menu * Quadratic Programming:: * Nonlinear Programming:: * Linear Least Squares:: @end menu @c @cindex linear programming @cindex quadratic programming @cindex nonlinear programming @cindex optimization @cindex LP @cindex QP @cindex NLP @node Quadratic Programming, Nonlinear Programming, Optimization, Optimization @section Quadratic Programming @ftable @code @item qpsol @example [x, obj, info, lambda] = qpsol (x, H, c, lb, ub, lb, A, ub) @end example Solve quadratic programs using Gill and Murray's QPSOL. Because QPSOL is not freely redistributable, this function is only available if you have obtained your own copy of QPSOL. @xref{Installation}. @end ftable @findex qpsol_options Tolerances and other options for @code{qpsol} may be specified using the function @code{qpsol_options}. @node Nonlinear Programming, Linear Least Squares, Quadratic Programming, Optimization @section Nonlinear Programming @ignore @ftable @code @item fsqp @example fsqp () @end example @findex fsqp_options Tolerances and other options for @code{fsqp} may be specified using the function @code{fsqp_options}. Sorry, this hasn't been implemented yet. @end ignore @ftable @code @item npsol @example [x, obj, info, lambda] = npsol (x, 'phi', lb, ub, lb, A, ub, lb, 'g', ub) @end example Solve nonlinear programs using Gill and Murray's NPSOL. Because NPSOL is not freely redistributable, this function is only available if you have obtained your own copy of NPSOL. @xref{Installation}. The second argument is a string containing the name of the objective function to call. The objective function must be of the form @example y = phi (x) @end example @noindent where x is a vector and y is a scalar. @end ftable @findex npsol_options Tolerances and other options for @code{npsol} may be specified using the function @code{npsol_options}. @node Linear Least Squares, , Nonlinear Programming, Optimization @section Linear Least Squares @ftable @code @item gls (@var{Y}, @var{X}, @var{O}) Generalized least squares (GLS) estimation for the multivariate model @example Y = X * B + E, mean(E) = 0, cov(vec(E)) = (s^2)*O @end example @noindent with @example Y an T x p matrix X an T x k matrix B an k x p matrix E an T x p matrix O an Tp x Tp matrix @end example @noindent Each row of Y and X is an observation and each column a variable. Returns BETA, v, and, R, where BETA is the GLS estimator for B, v is the GLS estimator for s^2, and R = Y - X*BETA is the matrix of GLS residuals. @item ols (@var{Y}, @var{X}) Ordinary Least Squares (OLS) estimation for the multivariate model @example Y = X*B + E, mean (E) = 0, cov (vec (E)) = kron (S, I) @end example @noindent with @example Y an T x p matrix X an T x k matrix B an k x p matrix E an T x p matrix @end example @noindent Each row of Y and X is an observation and each column a variable. Returns BETA, SIGMA, and R, where BETA is the OLS estimator for B, i.e. @example BETA = pinv(X)*Y, @end example @noindent where pinv(X) denotes the pseudoinverse of X, SIGMA is the OLS estimator for the matrix S, i.e. @example SIGMA = (Y - X*BETA)'*(Y - X*BETA) / (T - rank(X)) @end example and R = Y - X*BETA is the matrix of OLS residuals. @end ftable octave-1.1.0/doc/plot.texi100666 415 17 43256 5705310244 13607 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Plotting, Image Processing, Statistics, Top @chapter Plotting @findex gplot @findex gsplot All of Octave's plotting functions use @code{gnuplot} to handle the actual graphics. There are two low-level functions, @code{gplot} and @code{gsplot}, that behave almost exactly like the corresponding @code{gnuplot} functions @code{plot} and @samp{splot}. A number of other higher level plotting functions, patterned after the graphics functions found in @sc{Matlab} version 3.5, are also available. These higher level functions are all implemented in terms of the two low-level plotting functions. @menu * Two-Dimensional Plotting:: * Three-Dimensional Plotting:: * Miscellaneous Plotting Functions:: @end menu @node Two-Dimensional Plotting, Three-Dimensional Plotting, Plotting, Plotting @section Two-Dimensional Plotting The syntax for Octave's two-dimensional plotting function, @code{gplot}, is @example gplot @var{ranges} @var{expression} @var{using} @var{title} @var{style} @end example @noindent where the @var{ranges}, @var{using}, @var{title}, and @var{style} arguments are optional, and the @var{using}, @var{title} and @var{style} qualifiers may appear in any order after the expression. You may plot multiple expressions with a single command by separating them with commas. Each expression may have its own set of qualifiers. The optional item @var{ranges} has the syntax @example [ x_lo : x_up ] [ y_lo : y_up ] @end example @noindent and may be used to specify the ranges for the axes of the plot, independent of the actual range of the data. The range for the y axes and any of the individual limits may be omitted. A range @code{[:]} indicates that the default limits should be used. This normally means that a range just large enough to include all the data points will be used. The expression to be plotted must not contain any literal matrices (e.g. @code{[ 1, 2; 3, 4 ]}) since it is nearly impossible to distinguish a plot range from a matrix of data. See the help for @code{gnuplot} for a description of the syntax for the optional items. By default, the @code{gplot} command plots the second column of a matrix versus the first. If the matrix only has one column, it is taken as a vector of y-coordinates and the x-coordinate is taken as the element index, starting with zero. For example, @example gplot rand (100,1) with linespoints @end example @noindent will plot 100 random values and connect them with lines. When @code{gplot} is used to plot a column vector, the indices of the elements are taken as x values. If there are more than two columns, you can choose which columns to plot with the @var{using} qualifier. For example, given the data @example x = (-10:0.1:10)'; data = [x, sin(x), cos(x)]; @end example @noindent the command @example gplot [-11:11] [-1.1:1.1] data with lines, data using 1:3 with impulses @end example @noindent will plot two lines. The first line is generated by the command @code{data with lines}, and is a graph of the sine function over the range -10 to 10. The data is taken from the first two columns of the matrix because columns to plot were not specified with the @var{using} qualifier. The clause @code{using 1:3} in the second part of this plot command specifies that the first and third columns of the matrix @code{data} should be taken as the values to plot. In this example, the ranges have been explicitly specified to be a bit larger than the actual range of the data so that the curves do not touch the border of the plot. @findex set @findex show @findex replot In addition to the basic plotting commands, the whole range of @code{set} and @code{show} commands from @code{gnuplot} are available, as is @code{replot}. The @code{set} and @code{show} commands allow you to set and show @code{gnuplot} parameters. For more information about the set and show commands, see the @code{gnuplot} user's guide (also available on line if you run @code{gnuplot} directly, instead of running it from Octave). The @code{replot} command allows you to force the plot to be redisplayed. This is useful if you have changed something about the plot, such as the title or axis labels. The @code{replot} command also accepts the same arguments as @code{gplot} or @code{gsplot} (except for data ranges) so you can add additional lines to existing plots. For example, @example set term tek40 set output "/dev/plotter" set title "sine with lines and cosine with impulses" replot "sin (x) w l" @end example will change the terminal type for plotting, add a title to the current plot, add a graph of sin (x) to the plot, and force the new plot to be sent to the plot device. This last step is normally required in order to update the plot. This default is reasonable for slow terminals or hardcopy output devices because even when you are adding additional lines with a replot command, gnuplot always redraws the entire plot, and you probably don't want to have a completely new plot generated every time something as minor as an axis label changes. @vindex automatic_replot Since this may not matter as much on faster terminals, you can tell Octave to redisplay the plot each time anything about it changes by setting the value of the builtin variable @code{automatic_replot} to the value @code{"true"}. Note that NaN values in the plot data are automatically omitted, and Inf values are converted to a very large value before calling gnuplot. @c XXX FIXME XXX -- add info about what to do to get plots on remote X @c terminals. People often forget how to properly set DISPLAY and run @c xhost. @c XXX FIXME XXX -- add info about getting paper copies of plots. The @sc{Matlab}-style two-dimensional plotting commands are: @cindex plotting @cindex graphics @ftable @code @item plot (@var{args}) This function produces two-dimensional plots. Many different combinations of arguments are possible. The simplest form is @example plot (y) @end example @noindent where the argument is taken as the set of @var{y} coordinates and the @var{x} coordinates are taken to be the indices of the elements, starting with 1. If more than one argument is given, they are interpreted as @example plot (x [, y] [, fmt] ...) @end example @noindent where @var{y} and @var{fmt} are optional, and any number of argument sets may appear. The @var{x} and @var{y} values are interpreted as follows: @itemize @bullet @item If a single data argument is supplied, it is taken as the set of @var{y} coordinates and the @var{x} coordinates are taken to be the indices of the elements, starting with 1. @item If the first argument is a vector and the second is a matrix, the the vector is plotted versus the columns (or rows) of the matrix. (using whichever combination matches, with columns tried first.) @item If the first argument is a matrix and the second is a vector, the the columns (or rows) of the matrix are plotted versus the vector. (using whichever combination matches, with columns tried first.) @item If both arguments are vectors, the elements of @var{y} are plotted versus the elements of @var{x}. @item If both arguments are matrices, the columns of @var{y} are plotted versus the columns of @var{x}. In this case, both matrices must have the same number of rows and columns and no attempt is made to transpose the arguments to make the number of rows match. If both arguments are scalars, a single point is plotted. @end itemize The @var{fmt} argument, if present is intrepreted as follows. If @var{fmt} is missing, the default gnuplot line style is assumed. @table @asis @item @samp{-} Set lines plot style (default). @item @samp{.} Set dots plot style. @item @samp{@@} Set points plot style. @item @samp{-@@} Set linespoints plot style. @item @samp{^} Set impulses plot style. @item @samp{L} Set steps plot style. @item @samp{#} Set boxes plot style. @item @samp{~} Set errorbars plot style. @item @samp{#~} Set boxerrorbars plot style. @item @samp{n} Interpreted as the plot color if @var{n} is an integer in the range 1 to 6. @item @samp{nm} If @var{nm} is a two digit integer and @var{m} is an integer in the range 1 to 6, @var{m} is interpreted as the point style. This is only valid in combination with the @code{@@} or @code{-@@} specifiers. @item @samp{c} If @var{c} is one of @var{"r"}, @var{"g"}, @var{"b"}, @var{"m"}, @var{"c"}, or @var{"w"}, it is interpreted as the plot color (red, green, blue, magenta, cyan, or white). @item @samp{+} @itemx @samp{*} @itemx @samp{o} @itemx @samp{x} Used in combination with the points or linespoints styles, set the point style. @end table The color line styles have the following meanings on terminals that support color. @example Number Gnuplot colors (lines)points style 1 red * 2 green + 3 blue o 4 magenta x 5 cyan house 6 brown there exists @end example Here are some plot examples: @example plot (x, y, "@@12", x, y2, x, y3, "4", x, y4, "+") @end example This command will plot @var{y} with points of type 2 (displayed as @code{+}) and color 1 (red), @var{y2} with lines, @var{y3} with lines of color 4 (magenta) and @var{y4} with points displayed as @code{+}. @example plot (b, "*") @end example This command will plot the data in @var{b} will be plotted with points displayed as @code{*}. @item hold Tell Octave to `hold' the current data on the plot when executing subsequent plotting commands. This allows you to execute a series of plot commands and have all the lines end up on the same figure. The default is for each new plot command to clear the plot device first. For example, the command @example hold on @end example @noindent turns the hold state on. An argument of @code{off} turns the hold state off, and @code{hold} with no arguments toggles the current hold state. @item ishold Returns 1 if the next line will be added to the current plot, or 0 if the plot device will be cleared before drawing the next line. @item loglog (@var{args}) Make a two-dimensional plot using log scales for both axes. See the description of @code{plot} above for a description of the arguments that @code{loglog} will accept. @item semilogx (@var{args}) Make a two-dimensional plot using a log scale for the @var{x} axis. See the description of @code{plot} above for a description of the arguments that @code{semilogx} will accept. @item semilogy (@var{args}) Make a two-dimensional plot using a log scale for the @var{y} axis. See the description of @code{plot} above for a description of the arguments that @code{semilogy} will accept. @item contour (@var{z}, @var{n}, @var{x}, @var{y}) Make a contour plot of the three-dimensional surface described by @var{z}. Someone needs to improve @code{gnuplot}'s contour routines before this will be very useful. @item polar (@var{theta}, @var{rho}) Make a two-dimensional plot given polar the coordinates @var{theta} and @var{rho}. @end ftable @node Three-Dimensional Plotting, Miscellaneous Plotting Functions, Two-Dimensional Plotting, Plotting @section Three-Dimensional Plotting The syntax for Octave's three-dimensional plotting function, @code{gsplot}, is @example gsplot @var{ranges} @var{expression} @var{using} @var{title} @var{style} @end example @noindent where the @var{ranges}, @var{using}, @var{title}, and @var{style} arguments are optional, and the @var{using}, @var{title} and @var{style} qualifiers may appear in any order after the expression. You may plot multiple expressions with a single command by separating them with commas. Each expression may have its own set of qualifiers. The optional item @var{ranges} has the syntax @example [ x_lo : x_up ] [ y_lo : y_up ] [ z_lo : z_up ] @end example @noindent and may be used to specify the ranges for the axes of the plot, independent of the actual range of the data. The range for the y and z axes and any of the individual limits may be omitted. A range @code{[:]} indicates that the default limits should be used. This normally means that a range just large enough to include all the data points will be used. The expression to be plotted must not contain any literal matrices (e.g. @code{[ 1, 2; 3, 4 ]}) since it is nearly impossible to distinguish a plot range from a matrix of data. See the help for @code{gnuplot} for a description of the syntax for the optional items. By default, the @code{gsplot} command plots each column of the expression as the z value, using the row index as the x value, and the column index as the y value. The indices are counted from zero, not one. For example, @example gsplot rand (5, 2) @end example @noindent will plot a random surface, with the x and y values taken from the row and column indices of the matrix. If parametric plotting mode is set (using the command @samp{set parametric}, then @code{gsplot} takes the columns of the matrix three at a time as the x, y and z values that define a line in three space. Any extra columns are ignored, and the x and y values are expected to be sorted. For example, with @samp{parametric} set, it makes sense to plot a matrix like @iftex @tex $$ \left[\matrix{ 1 & 1 & 3 & 2 & 1 & 6 & 3 & 1 & 9 \cr 1 & 2 & 2 & 2 & 2 & 5 & 3 & 2 & 8 \cr 1 & 3 & 1 & 2 & 3 & 4 & 3 & 3 & 7}\right] $$ @end tex @end iftex @ifinfo @example 1 1 3 2 1 6 3 1 9 1 2 2 2 2 5 3 2 8 1 3 1 2 3 4 3 3 7 @end example @end ifinfo @noindent but not @code{rand (5, 30)}. The @sc{Matlab}-style three-dimensional plotting commands are: @ftable @code @item mesh (@var{x}, @var{y}, @var{z}) Plot a mesh given matrices @code{x}, and @var{y} from @code{meshdom} and a matrix @var{z} corresponding to the @var{x} and @var{y} coordinates of the mesh. @item meshdom (@var{x}, @var{y}) Given vectors of @var{x} and @var{y} coordinates, return two matrices corresponding to the @var{x} and @var{y} coordinates of the mesh. See the file @file{sombrero.m} for an example of using @code{mesh} and @code{meshdom}. @end ftable @node Miscellaneous Plotting Functions, , Three-Dimensional Plotting, Plotting @section Miscellaneous Plotting Functions @ftable @code @item bar (@var{x}, @var{y}) Given two vectors of x-y data, @code{bar} produces a bar graph. If only one argument is given, it is taken as a vector of y-values and the x coordinates are taken to be the indices of the elements. If two output arguments are specified, the data are generated but not plotted. For example, @example bar (x, y); @end example @noindent and @example [xb, yb] = bar (x, y); plot (xb, yb); @end example @noindent are equivalent. @item grid For two-dimensional plotting, force the display of a grid on the plot. @item stairs (@var{x}, @var{y}) Given two vectors of x-y data, bar produces a `stairstep' plot. If only one argument is given, it is taken as a vector of y-values and the x coordinates are taken to be the indices of the elements. If two output arguments are specified, the data are generated but not plotted. For example, @example stairs (x, y); @end example @noindent and @example [xs, ys] = stairs (x, y); plot (xs, ys); @end example @noindent are equivalent. @item title (@var{string}) Specify a title for the plot. If you already have a plot displayed, use the command @code{replot} to redisplay it with the new title. @item xlabel (@var{string}) @itemx ylabel (@var{string}) Specify x and y axis labels for the plot. If you already have a plot displayed, use the command @code{replot} to redisplay it with the new labels. @item sombrero (@var{n}) Display a classic three-dimensional mesh plot. The parameter @var{n} allows you to increase the resolution. @item clearplot @itemx clg Clear the plot window and any titles or axis labels. The name @code{clg} is aliased to @code{clearplot} for compatibility with @sc{Matlab}. The commands @samp{gplot clear}, @samp{gsplot clear}, and @samp{replot clear} are equivalent to @samp{clearplot}. (Previously, commands like @samp{gplot clear} would evaluate @samp{clear} as an ordinary expression and clear all the visible variables.) @item closeplot Close stream to the @code{gnuplot} subprocess. If you are using X11, this will close the plot window. @item purge_tmp_files Delete the temporary files created by the plotting commands. Octave creates temporary data files for @code{gnuplot} and then sends commands to @code{gnuplot} through a pipe. Octave will delete the temporary files on exit, but if you are doing a lot of plotting you may want to clean up in the middle of a session. A future version of Octave will eliminate the need to use temporary files to hold the plot data. @item axis (@var{limits}) Sets the axis limits for plots. The argument @var{limits} should be a 2, 4, or 6 element vector. The first and second elements specify the lower and upper limits for the x axis. The second and third specify the limits for the y axis, and the fourth and fifth specify the limits for the z axis. With no arguments, @code{axis} turns autoscaling on. If your plot is already drawn, then you need to use @code{replot} before the new axis limits will take effect. You can get this to happen automatically by setting the built-in variable @code{automatic_replot} to @code{"true"}. @xref{User Preferences}. @item hist (@var{y}, @var{x}) Produce histogram counts or plots. With one vector input argument, plot a histogram of the values with 10 bins. The range of the histogram bins is determined by the range of the data. Given a second scalar argument, use that as the number of bins. Given a second vector argument, use that as the centers of the bins, with the width of the bins determined from the adjacent values in the vector. Extreme values are lumped in the first and last bins. With two output arguments, produce the values @var{nn} and @var{xx} such that @code{bar (@var{xx}, @var{nn})} will plot the histogram. @end ftable octave-1.1.0/doc/poly.texi100666 415 17 14051 5705316346 13614 0ustar jweusers@c Copyright (C) 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Polynomial Manipulations, Nonlinear Equations, Linear Algebra, Top @chapter Polynomial Manipulations In Octave, a polynomial is represented by its coefficients (arranged in descending order). For example, a vector @var{c} of length @var{n+1} corresponds to the following @var{n}-th order polynomial @iftex @tex $$ p (x) = c_1 x^n + ... + c_n x + c_{n+1}. $$ @end tex @end iftex @ifinfo @example p(x) = c(1) x^n + ... + c(n) x + c(n+1). @end example @end ifinfo @ftable @code @item compan (@var{c}) Compute the companion matrix corresponding to polynomial coefficient vector @var{c}. The companion matrix is @iftex @tex $$ A = \left[\matrix{ -c_2/c_1 & -c_3/c_1 & \cdots & -c_n/c_1 & -c_{n+1}/c_1\cr 1 & 0 & \cdots & 0 & 0 \cr 0 & 1 & \cdots & 0 & 0 \cr \vdots & & \ddots & \vdots & \vdots \cr 0 & 0 & \cdots & 1 & 0}\right]. $$ @end tex @end iftex @ifinfo @smallexample _ _ | -c(2)/c(1) -c(3)/c(1) ... -c(n)/c(1) -c(n+1)/c(1) | | 1 0 ... 0 0 | | 0 1 ... 0 0 | A = | . . . . . | | . . . . . | | . . . . . | |_ 0 0 ... 1 0 _| @end smallexample @end ifinfo The eigenvalues of the companion matrix are equal to the roots of the polynomial. @item conv (@var{a}, @var{b}) Convolve two vectors. @code{y = conv (a, b)} returns a vector of length equal to @code{length (a) + length (b) - 1}. If @var{a} and @var{b} are polynomial coefficient vectors, @code{conv} returns the coefficients of the product polynomial. @item deconv (@var{y}, @var{a}) Deconvolve two vectors. @code{[b, r] = deconv (y, a)} solves for @var{b} and @var{r} such that @code{y = conv (a, b) + r}. If @var{y} and @var{a} are polynomial coefficient vectors, @var{b} will contain the coefficients of the polynomial quotient and @var{r} will be a remander polynomial of lowest order. @item poly (@var{a}) If @var{a} is a square @var{n}-by-@var{n} matrix, @code{poly (@var{a})} is the row vector of the coefficients of @code{det (z * eye (n) - a)}, the characteristic polynomial of @var{a}. If @var{x} is a vector, @code{poly (@var{x})} is a vector of coefficients of the polynomial whose roots are the elements of @var{x}. @item polyderiv (@var{c}) Returns the coefficients of the derivative of the polynomial whose coefficients are given by vector @var{c}. @item polyinteg (@var{c}) Returns the coefficients of the integral the polynomial whose coefficients are represented by the vector @var{c}. The constant of integration is set to zero. @item polyreduce (@var{c}) Reduces a polynomial coefficient vector to a minimum number of terms by stripping off any leading zeros. @item polyval (@var{c}, @var{x}) Evaluate a polynomial. @code{polyval (@var{c}, @var{x})} will evaluate the polynomial at the specified value of @var{x}. If @var{x} is a vector or matrix, the polynomial is evaluated at each of the elements of @var{x}. @item polyvalm (@var{c}, @var{x}) Evaluate a polynomial in the matrix sense. @code{polyvalm (@var{c}, @var{x})} will evaluate the polynomial in the matrix sense, i.e. matrix multiplication is used instead of element by element multiplication as is used in polyval. The argument @var{x} must be a square matrix. @item residue (@var{b}, @var{a}, @var{tol}) If @var{b} and @var{a} are vectors of polynomial coefficients, then residue calculates the partial fraction expansion corresponding to the ratio of the two polynomials. The function @code{residue} returns @var{r}, @var{p}, @var{k}, and @var{e}, where the vector @var{r} contains the residue terms, @var{p} contains the pole values, @var{k} contains the coefficients of a direct polynomial term (if it exists) and @var{e} is a vector containing the powers of the denominators in the partial fraction terms. Assuming @var{b} and @var{a} represent polynomials @iftex @tex $P(s)$ and $Q(s)$ @end tex @end iftex @ifinfo P (s) and Q(s) @end ifinfo we have: @iftex @tex $$ {P(s)\over Q(s)} = \sum_{m=1}^M {r_m\over (s-p_m)^e_m} + \sum_{n=1}^N k_n s^{N-n}. $$ @end tex @end iftex @ifinfo @example P(s) M r(m) N ---- = SUM ------------- + SUM k(n)*s^(N-n) Q(s) m=1 (s-p(m))^e(m) n=1 @end example @end ifinfo @noindent where @var{M} is the number of poles (the length of the @var{r}, @var{p}, and @var{e} vectors) and @var{N} is the length of the @var{k} vector. The argument @var{tol} is optional, and if not specified, a default value of 0.001 is assumed. The tolerance value is used to determine whether poles with small imaginary components are declared real. It is also used to determine if two poles are distinct. If the ratio of the imaginary part of a pole to the real part is less than @var{tol}, the imaginary part is discarded. If two poles are farther apart than @var{tol} they are distinct. For example, Example: @example b = [1, 1, 1]; a = [1, -5, 8, -4]; [r, p, k, e] = residue (b, a) @end example @noindent returns @example r = [-2, 7, 3] p = [2, 2, 1] k = [](0x0) e = [1, 2, 1] @end example @noindent which implies the following partial fraction expansion @iftex @tex $$ {s^2+s+1\over s^3-5s^2+8s-4} = {-2\over s-2} + {7\over (s-2)^2} + {3\over s-1} $$ @end tex @end iftex @ifinfo @example s^2 + s + 1 -2 7 3 ------------------- = ----- + ------- + ----- s^3 - 5s^2 + 8s - 4 (s-2) (s-2)^2 (s-1) @end example @end ifinfo @item roots (@var{v}) For a vector @var{v} with @var{n} components, return the roots of the polynomial @iftex @tex $$ v_1 z^{n-1} + \cdots + v_{n-1} z + v_n. $$ @end tex @end iftex @ifinfo @example v(1) * z^(n-1) + ... + v(n-1) * z + v(n). @end example @end ifinfo @end ftable octave-1.1.0/doc/preface.texi100666 415 17 13530 5705307132 14230 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Preface, Copying, Top, Top @unnumbered Preface @cindex acknowledgements @cindex contributors @cindex history Octave was originally intended to be companion software for an undergraduate-level textbook on chemical reactor design being written by James B. Rawlings and John G. Ekerdt at the University of Texas. Clearly, Octave is now much more than just another `courseware' package with limited utiltiy beyond the classroom. Although our initial goals were somewhat vague, we knew that we wanted to create something that would enable students to solve realistic problems, and that they could use for many things other than chemical reactor design problems. There are those who would say that we should be teaching the students Fortran instead, because that is the computer language of engineering, but every time we have tried that, the students have spent far too much time trying to figure out why their Fortran code crashes and not enough time learning about chemical engineering. With Octave, most students pick up the basics quickly, and are using it confidently in just a few hours. Although it was originally intended to be used to teach reactor design, it is also currently used in several other undergraduate and graduate courses in our department, and the math department at the University of Texas has been using it for teaching differential equations and linear algebra as well. If you find it useful, please let us know. We are always interested to find out how Octave is being used in other places. Virtually everyone thinks that the name Octave has something to do with music, but it is actually the name of a former professor of mine who wrote a famous textbook on chemical reaction engineering, and who was also well known for his ability to do quick `back of the envelope' calculations. We hope that this software will make it possible for many people to do more ambitious computations just as easily. Everyone is encouraged to share this software with others under the terms of the GNU General Public License (@pxref{Copying}) as described at the beginning of this manual. You are also encouraged to help make Octave more useful by writing and contributing additional functions for it, and by reporting any problems you may have. Many people have already contributed to Octave's development. In addition to John W. Eaton, the following people have helped write parts of Octave or helped out in various other ways. @c Once lp_solve has been added, don't forget to include the lp_solve @c author, and Kantor, for providing an example. @itemize @bullet @item Karl Berry (karl@@cs.umb.edu) wrote the @code{kpathsea} library that allows Octave to recursively search directory paths for function and script files. @item Georg Beyerle (gbeyerle@@awi-potsdam.de) contributed code to save values in @sc{Matlab}'s @file{.mat}-file format, and has provided many useful bug reports and suggestions. @item John Campbell (jcc@@che.utexas.edu) wrote most of the file and C-style input and output functions. @item Brian Fox (bfox@@gnu.ai.mit.edu) wrote the @code{readline} library used for command history editing, and the portion of this manual that documents it. @item A. Scottedward Hodel (scotte@@eng.auburn.edu) contributed a number of functions including @code{expm}, @code{qzval}, @code{qzhess}, @code{syl}, @code{lyap}, and @code{balance}. @item Kurt Hornik (Kurt.Hornik@@ci.tuwien.ac.at) provided the @code{corrcoef}, @code{cov}, @code{kurtosis}, @code{pinv}, and @code{skewness} functions. @item Phil Johnson (johnsonp@@nicco.sscnet.ucla.edu) has helped to make Linux releases available. @item Friedrich Leisch (leisch@@ci.tuwien.ac.at) provided the @code{mahalanobis} function. @item Ken Neighbors (wkn@@leland.stanford.edu) has provided many useful bug reports and comments on @sc{Matlab} compatibility. @item Rick Niles (niles@@axp745.gsfc.nasa.gov) continues to track down odd incompatibilities and bugs. @item Mark Odegard (meo@@sugarland.unocal.com) provided the initial implementation of @code{fread}, @code{fwrite}, @code{feof}, and @code{ferror}. @item Tony Richardson (tony@@guts.biomed.uakron.edu) wrote Octave's image processing functions as well as most of the original polynomial functions. @item R. Bruce Tenison (Bruce.Tenison@@eng.auburn.edu) wrote the @code{hess} and @code{schur} functions. @item Teresa Twaroch (twaroch@@ci.tuwien.ac.at) provided the functions @code{gls} and @code{ols}. @item Fook Fah Yap (ffy@@eng.cam.ac.uk) provided the @code{fft} and @code{ifft} functions and valuable bug reports for early versions. @end itemize Special thanks to the following people and organizations for supporting the development of Octave: @itemize @bullet @item Digital Equipment Corporation, for an equipment grant as part of their External Research Program. @item Sun Microsystems, Inc., for an Academic Equipment grant. @item Texaco Chemical Company, for providing funding to continue the development of this software. @item The University of Texas College of Engineering, for providing a Challenge for Excellence Research Supplement, and for providing an Academic Development Funds grant. @item The State of Texas, for providing funding through the Texas Advanced Technology Program under Grant No. 003658-078. @item Noel Bell, Senior Engineer, Texaco Chemical Company, Austin Texas. @item James B. Rawlings, Associate Professor, Department of Chemical Engineering, The University of Texas at Austin. @item Richard Stallman, for writing GNU. @end itemize Portions of this document have been adapted from the @code{gawk}, @code{readline}, @code{gcc}, and C library manuals, published by the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. This project would not have been possible without the GNU software used in and used to produce Octave. octave-1.1.0/doc/program.texi100666 415 17 27357 5705305715 14313 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Programming Utilities, Amusements, Help, Top @chapter Programming Utilities @menu * Evaluating Strings as Commands:: * Miscellaneous Utilities:: @end menu @node Evaluating Strings as Commands, Miscellaneous Utilities, Programming Utilities, Programming Utilities @section Evaluating Strings as Commands @findex eval It is often useful to evaluate a string as if it were an Octave program, or use a string as the name of a function to call. These functions are necessary in order to evaluate commands that are not known until run time, or to write functions that will need to call user-supplied functions. The function @code{eval (@var{command})} parses @var{command} and evaluates it as if it were an Octave program, returning the last value computed. The @var{command} is evaluated in the current context, so any results remain available after @code{eval} returns. For example, @example octave:13> a error: `a' undefined octave:14> eval ("a = 13") a = 13 ans = 13 octave:15> a a = 13 @end example In this case, two values are printed: one for the expression that was evaluated, and one for the value returned from @code{eval}. Just as with any other expression, you can turn printing off by ending the expression in a semicolon. For example, @example octave:13> a error: `a' undefined octave:14> eval ("a = 13;") ans = 13 octave:15> a a = 13 @end example @findex feval The function @code{feval (@var{name}, ...)} can be used to evaluate the function named @var{name}. Any arguments after the first are passed on to the named function. For example, @example octave:12> feval ("acos", -1) ans = 3.1416 @end example @noindent calls the function @code{acos} with the argument @samp{-1}. The function @code{feval} is necessary in order to be able to write functions that call user-supplied functions, because Octave does not have a way to declare a pointer to a function (like C) or to declare a special kind of variable that can be used to hold the name of a function (like @code{EXTERNAL} in Fortran). Instead, you must refer to functions by name, and use @code{feval} to call them. For example, here is a simple-minded function for finding the root of a function of one variable: @cindex Fordyce, A. P. @findex newtroot @example @group function result = newtroot (fname, x) # usage: newtroot (fname, x) # # fname : a string naming a function f(x). # x : initial guess delta = tol = sqrt (eps); maxit = 200; fx = feval (fname, x); for i = 1:maxit if (abs (fx) < tol) result = x; return; else fx_new = feval (fname, x + delta); deriv = (fx_new - fx) / delta; x = x - fx / deriv; fx = fx_new; endif endfor result = x; endfunction @end group @end example Note that this is only meant to be an example of calling user-supplied functions and should not be taken too seriously. In addition to using a more robust algorithm, any serious code would check the number and type of all the arguments, ensure that the supplied function really was a function, etc. @node Miscellaneous Utilities, , Evaluating Strings as Commands, Programming Utilities @section Miscellaneous Utilities The following functions allow you to determine the size of a variable or expression, find out whether a variable exists, print error messages, or delete variable names from the symbol table. @ftable @code @item columns (@var{a}) Return the number of columns of @var{a}. @item rows (@var{a}) Return the number of rows of @var{a}. @item length (@var{a}) Return the number of rows of @var{a} or the number of columns of @var{a}, whichever is larger. @item size (@var{a}) Return the number rows and columns of @var{a}. If there is only one output argument, the result is returned in a 2 element row vector. If there are two output arguments, the number of rows is assigned to the first, and the number of columns to the second. For example, @example @group octave:13> size ([1, 2; 3, 4; 5, 6]) ans = 3 2 octave:14> [nr, nc] = size ([1, 2; 3, 4; 5, 6]) nr = 3 nc = 2 @end group @end example @item is_global (@var{a}) Return 1 if @var{a} is globally visible. Otherwise, return 0. @item is_matrix (@var{a}) Return 1 if @var{a} is a matrix. Otherwise, return 0. @item is_vector (@var{a}) Return 1 if @var{a} is a vector. Otherwise, return 0. @item is_scalar (@var{a}) Return 1 if @var{a} is a scalar. Otherwise, return 0. @item is_square (@var{x}) If @var{x} is a square matrix, then return the dimension of @var{x}. Otherwise, return 0. @item is_symmetric (@var{x}, @var{tol}) If @var{x} is symmetric within the tolerance specified by @var{tol}, then return the dimension of @var{x}. Otherwise, return 0. If @var{tol} is omitted, use a tolerance equal to the machine precision. @item isstr (@var{a}) Return 1 if @var{a} is a string. Otherwise, return 0. @item isempty (@var{a}) Return 1 if @var{a} is an empty matrix (either the number of rows, or the number of columns, or both are zero). Otherwise, return 0. @item clear @var{pattern} ... Delete the names matching the given patterns from the symbol table. The pattern may contain the following special characters: @table @code @item ? Match any single character. @item * Match zero or more characters. @item [ @var{list} ] Match the list of characters specified by @var{list}. If the first character is @code{!} or @code{^}, match all characters except those specified by @var{list}. For example, the pattern @samp{[a-zA-Z]} will match all lower and upper case alphabetic characters. @end table For example, the command @example clear foo b*r @end example @noindent clears the name @code{foo} and all names that begin with the letter @code{b} and end with the letter @code{r}. If @code{clear} is called without any arguments, all user-defined variables (local and global) are cleared from the symbol table. If @code{clear} is called with at least one argument, only the visible names matching the arguments are cleared. For example, suppose you have defined a function @code{foo}, and then hidden it by performing the assignment @code{foo = 2}. Executing the command @samp{clear foo} once will clear the variable definition and restore the definition of @code{foo} as a function. Executing @samp{clear foo} a second time will clear the function definition. This command may not be used within a function body. @item who @var{options} @var{pattern} ... List currently defined symbols matching the given patterns. The following are valid options. They may be shortened to one character but may not be combined. @table @code @item -all List all currently defined symbols. @item -builtins List built-in variables and functions. This includes all currently compiled function files, but does not include all function files that are in the @code{LOADPATH}. @item -functions List user-defined functions. @item -long Print a long listing including the type and dimensions of any symbols. The symbols in the first column of output indicate whether it is possible to redefine the symbol, and whether it is possible for it to be cleared. @item -variables List user-defined variables. @end table Valid patterns are the same as described for the @code{clear} command above. If no patterns are supplied, all symbols from the given category are listed. By default, only user defined functions and variables visible in the local scope are displayed. @findex whos The command @code{whos} is equivalent to @code{who -long}. @item exist (@var{name}) Return 1 if the name exists as a variable, and 2 if the name (after appending @samp{.m}) is a function file in the path. Otherwise, return 0. @item error (@var{msg}) Print the message @var{msg}, prefixed by the string @samp{error: }, and set Octave's internal error state such that control will return to the top level without evaluating any more commands. This is useful for aborting from functions. If @var{msg} does not end with a new line character, Octave will print a traceback of all the function calls leading to the error. For example, @example function f () g () end function g () h () end function h () nargin == 1 || error ("nargin != 1"); end f () error: nargin != 1 error: evaluating index expression near line 1, column 30 error: evaluating binary operator `||' near line 1, column 27 error: called from `h' error: called from `g' error: called from `f' @end example @noindent produces a list of messages that can help you to quickly locate the exact location of the error. If @var{msg} ends in a new line character, Octave will only print @var{msg} and will not display any traceback messages as it returns control to the top level. For example, modifying the error message in the previous example to end in a new line causes Octave to only print a single message: @example function h () nargin == 1 || error ("nargin != 1\n"); end f () error: nargin != 1 @end example @item warning (@var{msg}) Print the message @var{msg} prefixed by the string @samp{warning: }. @item usage (@var{msg}) Print the message @var{msg}, prefixed by the string @samp{usage: }, and set Octave's internal error state such that control will return to the top level without evaluating any more commands. This is useful for aborting from functions. After @code{usage} is evaluated, Octave will print a traceback of all the function calls leading to the usage message. @item perror (@var{name}, @var{num}) Print the error message for function @var{name} corresponding to the error number @var{num}. This function is intended to be used to print useful error messages for those functions that return numeric error codes. @item menu (@var{title}, @var{opt1}, @dots{}) Print a title string followed by a series of options. Each option will be printed along with a number. The return value is the number of the option selected by the user. This function is useful for interactive programs. There is no limit to the number of options that may be passed in, but it may be confusing to present more than will fit easily on one screen. @item document @var{symbol} @var{text} Set the documentation string for @var{symbol} to @var{text}. @item file_in_path (@var{path}, @var{file}) Return the absolute name name of @var{file} if it can be found in @var{path}. The value of @var{path} should be a colon-separated list of directories in the format described for the built-in variable @code{LOADPATH}. If the file cannot be found in the path, an empty matrix is returned. For example, @example octave:13> file_in_path (LOADPATH, "nargchk.m") ans = /usr/local/lib/octave/1.1.0/m/general/nargchk.m @end example @item nargchk (@var{nargin_min}, @var{nargin_max}, @var{n}) If @var{n} is in the range @var{nargin_min} through @var{nargin_max} inclusive, return the empty matrix. Otherwise, return a message indicating whether @var{n} is too large or too small. This is useful for checking to see that the number of arguments supplied to a function is within an acceptable range. @item octave_tmp_file_name Return a unique temporary file name. Since the named file is not opened, by @code{octave_tmp_file_name}, it is possible (though relatively unlikely) that it will not be available by the time your program attempts to open it. @item type @var{name} ... Display the definition of each @var{name} that refers to a function. Currently, Octave can only display functions that can be compiled cleanly, because it uses its internal representation of the function to recreate the program text. Comments are not displayed because Octave's currently discards them as it converts the text of a function file to its internal representation. This problem may be fixed in a future release. @item which @var{name} ... Display the type of each @var{name}. If @var{name} is defined from a function file, the full name of the file is also displayed. @end ftable octave-1.1.0/doc/quad.texi100666 415 17 3265 5705073522 13544 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Quadrature, Control Theory, Optimization, Top @chapter Quadrature @menu * Functions of one Variable:: * Orthogonal Collocation:: @end menu @node Functions of one Variable, Orthogonal Collocation, Quadrature, Quadrature @section Functions of one Variable @ftable @code @item quad @example [v, ier, nfun] = quad ("f", a, b) [v, ier, nfun] = quad ("f", a, b, tol) [v, ier, nfun] = quad ("f", a, b, tol, sing) @end example Integrate a nonlinear function of one variable using Quadpack. Where the first argument is the name of the function to call to compute the value of the integrand. It must have the form @example y = f (x) @end example @noindent where y and x are scalars. The second and third arguments are limits of integration. Either or both may be infinite. The optional argument tol specifies the desired accuracy of the result. The optional argument @var{sing} is a vector of values at which the integrand is singular. @findex quad_options Tolerances and other options for @code{quad} may be specified using the function @code{quad_options}. @end ftable @node Orthogonal Collocation, , Functions of one Variable, Quadrature @section Orthogonal Collocation @ftable @code @item colloc @example [r, A, B, q] = colloc (n) [r, A, B, q] = colloc (n, "left") [r, A, B, q] = colloc (n, "left", "right") @end example Compute derivative and integral weight matrices for orthogonal collocation using the subroutines given in J. Michelsen and M. L. Villadsen, @cite{Solution of Differential Equation Models by Polynomial Approximation}. @end ftable octave-1.1.0/doc/rd-idx.texi100666 415 17 352 5705073511 13751 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Readline Index, Info Index, Operator Index, Top @unnumbered Readline Index @printindex rd octave-1.1.0/doc/rluser.texi100666 415 17 51666 5705312571 14156 0ustar jweusers@comment %**start of header (This is for running Texinfo on a region.) @c @setfilename rluser.info @comment %**end of header (This is for running Texinfo on a region.) @c @setchapternewpage odd @ignore This file documents the end user interface to the GNU command line editing features. It is to be an appendix to manuals for programs which use these features. There is a document entitled "readline.texinfo" which contains both end-user and programmer documentation for the GNU Readline Library. Copyright (C) 1988 Free Software Foundation, Inc. Authored by Brian Fox. Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided also that the GNU Copyright statement is available to the distributee, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ignore @node Command Line Editing, Using Info, Trouble, Top @appendix Command Line Editing This text describes GNU's command line editing interface. It is relatively old and may not be entirely correct now. Please send a message to @code{bug-octave@@che.utexas.edu} if you find any errors. @xref{Reporting Bugs}, for more information about how to report bugs. @menu * Introduction and Notation:: Notation used in this text. * Readline Interaction:: The minimum set of commands for editing a line. * Readline Bare Essentials:: * Readline Movement Commands:: * Readline Killing Commands:: * Readline Arguments:: * Readline Init File:: Customizing Readline from a user's view. * Readline Init Syntax:: * Readline Vi Mode:: @end menu @node Introduction and Notation, Readline Interaction, Command Line Editing, Command Line Editing @appendixsec Introduction to Line Editing The following paragraphs describe the notation we use to represent keystrokes. The text @key{C-k} is read as `Control-K' and describes the character produced when the Control key is depressed and the @key{k} key is struck. The text @key{M-k} is read as `Meta-K' and describes the character produced when the meta key (if you have one) is depressed, and the @key{k} key is struck. If you do not have a meta key, the identical keystroke can be generated by typing @key{ESC} @i{first}, and then typing @key{k}. Either process is known as @dfn{metafying} the @key{k} key. The text @key{M-C-k} is read as `Meta-Control-k' and describes the character produced by @dfn{metafying} @key{C-k}. In addition, several keys have their own names. Specifically, @key{DEL}, @key{ESC}, @key{LFD}, @key{SPC}, @key{RET}, and @key{TAB} all stand for themselves when seen in this text, or in an init file (@pxref{Readline Init File}, for more info). @node Readline Interaction, Readline Bare Essentials, Introduction and Notation, Command Line Editing @appendixsec Readline Interaction @cindex interaction, readline Often during an interactive session you type in a long line of text, only to notice that the first word on the line is misspelled. The Readline library gives you a set of commands for manipulating the text as you type it in, allowing you to just fix your typo, and not forcing you to retype the majority of the line. Using these editing commands, you move the cursor to the place that needs correction, and delete or insert the text of the corrections. Then, when you are satisfied with the line, you simply press @key{RETURN}. You do not have to be at the end of the line to press @key{RETURN}; the entire line is accepted regardless of the location of the cursor within the line. @menu * Readline Bare Essentials:: The least you need to know about Readline. * Readline Movement Commands:: Moving about the input line. * Readline Killing Commands:: How to delete text, and how to get it back! * Readline Arguments:: Giving numeric arguments to commands. @end menu @node Readline Bare Essentials, Readline Movement Commands, Readline Interaction, Command Line Editing @appendixsec Readline Bare Essentials In order to enter characters into the line, simply type them. The typed character appears where the cursor was, and then the cursor moves one space to the right. If you mistype a character, you can use @key{DEL} to back up, and delete the mistyped character. Sometimes you may miss typing a character that you wanted to type, and not notice your error until you have typed several other characters. In that case, you can type @key{C-b} to move the cursor to the left, and then correct your mistake. Afterwards, you can move the cursor to the right with @key{C-f}. When you add text in the middle of a line, you will notice that characters to the right of the cursor get `pushed over' to make room for the text that you have inserted. Likewise, when you delete text behind the cursor, characters to the right of the cursor get `pulled back' to fill in the blank space created by the removal of the text. A list of the basic bare essentials for editing the text of an input line follows. @table @asis @item @key{C-b} Move back one character. @item @key{C-f} Move forward one character. @item @key{DEL} Delete the character to the left of the cursor. @item @key{C-d} Delete the character underneath the cursor. @item @w{Printing characters} Insert itself into the line at the cursor. @item @key{C-_} Undo the last thing that you did. You can undo all the way back to an empty line. @end table @node Readline Movement Commands, Readline Killing Commands, Readline Bare Essentials, Command Line Editing @appendixsec Readline Movement Commands The above table describes the most basic possible keystrokes that you need in order to do editing of the input line. For your convenience, many other commands have been added in addition to @key{C-b}, @key{C-f}, @key{C-d}, and @key{DEL}. Here are some commands for moving more rapidly about the line. @table @key @item C-a Move to the start of the line. @item C-e Move to the end of the line. @item M-f Move forward a word. @item M-b Move backward a word. @item C-l Clear the screen, reprinting the current line at the top. @end table Notice how @key{C-f} moves forward a character, while @key{M-f} moves forward a word. It is a loose convention that control keystrokes operate on characters while meta keystrokes operate on words. @node Readline Killing Commands, Readline Arguments, Readline Movement Commands, Command Line Editing @appendixsec Readline Killing Commands @dfn{Killing} text means to delete the text from the line, but to save it away for later use, usually by @dfn{yanking} it back into the line. If the description for a command says that it `kills' text, then you can be sure that you can get the text back in a different (or the same) place later. Here is the list of commands for killing text. @table @key @item C-k Kill the text from the current cursor position to the end of the line. @item M-d Kill from the cursor to the end of the current word, or if between words, to the end of the next word. @item M-DEL Kill from the cursor to the start of the previous word, or if between words, to the start of the previous word. @item C-w Kill from the cursor to the previous whitespace. This is different than @key{M-DEL} because the word boundaries differ. @end table And, here is how to @dfn{yank} the text back into the line. Yanking is @table @key @item C-y Yank the most recently killed text back into the buffer at the cursor. @item M-y Rotate the kill-ring, and yank the new top. You can only do this if the prior command is @key{C-y} or @key{M-y}. @end table When you use a kill command, the text is saved in a @dfn{kill-ring}. Any number of consecutive kills save all of the killed text together, so that when you yank it back, you get it in one clean sweep. The kill ring is not line specific; the text that you killed on a previously typed line is available to be yanked back later, when you are typing another line. @node Readline Arguments, Readline Init File, Readline Killing Commands, Command Line Editing @appendixsec Readline Arguments You can pass numeric arguments to Readline commands. Sometimes the argument acts as a repeat count, other times it is the @i{sign} of the argument that is significant. If you pass a negative argument to a command which normally acts in a forward direction, that command will act in a backward direction. For example, to kill text back to the start of the line, you might type @key{M--} @key{C-k}. The general way to pass numeric arguments to a command is to type meta digits before the command. If the first `digit' you type is a minus sign (@key{-}), then the sign of the argument will be negative. Once you have typed one meta digit to get the argument started, you can type the remainder of the digits, and then the command. For example, to give the @key{C-d} command an argument of 10, you could type @key{M-1 0 C-d}. @node Readline Init File, Readline Init Syntax, Readline Arguments, Command Line Editing @appendixsec Readline Init File Although the Readline library comes with a set of Emacs-like keybindings, it is possible that you would like to use a different set of keybindings. You can customize programs that use Readline by putting commands in an @dfn{init} file in your home directory. The name of this file is @file{~/.inputrc}. When a program which uses the Readline library starts up, the @file{~/.inputrc} file is read, and the keybindings are set. In addition, the @key{C-x C-r} command re-reads this init file, thus incorporating any changes that you might have made to it. @menu * Readline Init Syntax:: Syntax for the commands in @file{~/.inputrc}. * Readline Vi Mode:: Switching to @code{vi} mode in Readline. @end menu @node Readline Init Syntax, Readline Vi Mode, Readline Init File, Command Line Editing @appendixsec Readline Init Syntax There are only four constructs allowed in the @file{~/.inputrc} file: @table @asis @item Variable Settings You can change the state of a few variables in Readline. You do this by using the @code{set} command within the init file. Here is how you would specify that you wish to use Vi line editing commands: @example set editing-mode vi @end example Right now, there are only a few variables which can be set; so few in fact, that we just iterate them here: @table @code @item editing-mode @vindex editing-mode The @code{editing-mode} variable controls which editing mode you are using. By default, GNU Readline starts up in Emacs editing mode, where the keystrokes are most similar to Emacs. This variable can either be set to @code{emacs} or @code{vi}. @item horizontal-scroll-mode @vindex horizontal-scroll-mode This variable can either be set to @code{On} or @code{Off}. Setting it to @code{On} means that the text of the lines that you edit will scroll horizontally on a single screen line when they are larger than the width of the screen, instead of wrapping onto a new screen line. By default, this variable is set to @code{Off}. @item mark-modified-lines @vindex mark-modified-lines This variable when set to @code{On}, says to display an asterisk (@samp{*}) at the starts of history lines which have been modified. This variable is off by default. @item prefer-visible-bell @vindex prefer-visible-bell If this variable is set to @code{On} it means to use a visible bell if one is available, rather than simply ringing the terminal bell. By default, the value is @code{Off}. @end table @item Key Bindings The syntax for controlling keybindings in the @file{~/.inputrc} file is simple. First you have to know the @i{name} of the command that you want to change. The following pages contain tables of the command name, the default keybinding, and a short description of what the command does. Once you know the name of the command, simply place the name of the key you wish to bind the command to, a colon, and then the name of the command on a line in the @file{~/.inputrc} file. The name of the key can be expressed in different ways, depending on which is most comfortable for you. @table @asis @item @w{@var{keyname}: @var{function-name} or @var{macro}} @var{keyname} is the name of a key spelled out in English. For example: @example Control-u: universal-argument Meta-Rubout: backward-kill-word Control-o: ">&output" @end example In the above example, @key{C-u} is bound to the function @code{universal-argument}, and @key{C-o} is bound to run the macro expressed on the right hand side (that is, to insert the text @samp{>&output} into the line). @item @w{"@var{keyseq}": @var{function-name} or @var{macro}} @var{keyseq} differs from @var{keyname} above in that strings denoting an entire key sequence can be specified. Simply place the key sequence in double quotes. GNU Emacs style key escapes can be used, as in the following example: @example "\C-u": universal-argument "\C-x\C-r": re-read-init-file "\e[11~": "Function Key 1" @end example In the above example, @key{C-u} is bound to the function @code{universal-argument} (just as it was in the first example), @key{C-x C-r} is bound to the function @code{re-read-init-file}, and @key{ESC [ 1 1 ~} is bound to insert the text @samp{Function Key 1}. @end table @end table @menu * Commands For Moving:: Moving about the line. * Commands For History:: Getting at previous lines. * Commands For Text:: Commands for changing text. * Commands For Killing:: Commands for killing and yanking. * Numeric Arguments:: Specifying numeric arguments, repeat counts. * Commands For Completion:: Getting Readline to do the typing for you. * Miscellaneous Commands:: Other miscellaneous commands. @end menu @node Commands For Moving, Commands For History, Readline Init Syntax, Readline Init Syntax @appendixsubsec Commands For Moving @ftable @code @item beginning-of-line (@key{C-a}) Move to the start of the current line. @item end-of-line (@key{C-e}) Move to the end of the line. @item forward-char (@key{C-f}) Move forward a character. @item backward-char (@key{C-b}) Move back a character. @item forward-word (@key{M-f}) Move forward to the end of the next word. @item backward-word (@key{M-b}) Move back to the start of this, or the previous, word. @item clear-screen (@key{C-l}) Clear the screen leaving the current line at the top of the screen. @end ftable @node Commands For History, Commands For Text, Commands For Moving, Readline Init Syntax @appendixsubsec Commands For Manipulating The History @ftable @code @item accept-line (Newline, Return) Accept the line regardless of where the cursor is. If this line is non-empty, add it to the history list. If this line was a history line, then restore the history line to its original state. @item previous-history (@key{C-p}) Move `up' through the history list. @item next-history (@key{C-n}) Move `down' through the history list. @item beginning-of-history (@key{M-<}) Move to the first line in the history. @item end-of-history (@key{M->}) Move to the end of the input history, i.e., the line you are entering! @item reverse-search-history (@key{C-r}) Search backward starting at the current line and moving `up' through the history as necessary. This is an incremental search. @item forward-search-history (@key{C-s}) Search forward starting at the current line and moving `down' through the the history as necessary. @end ftable @node Commands For Text, Commands For Killing, Commands For History, Readline Init Syntax @appendixsubsec Commands For Changing Text @ftable @code @item delete-char (@key{C-d}) Delete the character under the cursor. If the cursor is at the beginning of the line, and there are no characters in the line, and the last character typed was not @key{C-d}, then return EOF. @item backward-delete-char (Rubout) Delete the character behind the cursor. A numeric arg says to kill the characters instead of deleting them. @item quoted-insert (@key{C-q}, @key{C-v}) Add the next character that you type to the line verbatim. This is how to insert things like @key{C-q} for example. @item tab-insert (@key{M-TAB}) Insert a tab character. @item self-insert (a, b, A, 1, !, ...) Insert yourself. @item transpose-chars (@key{C-t}) Drag the character before point forward over the character at point. Point moves forward as well. If point is at the end of the line, then transpose the two characters before point. Negative args don't work. @item transpose-words (@key{M-t}) Drag the word behind the cursor past the word in front of the cursor moving the cursor over that word as well. @item upcase-word (@key{M-u}) Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @item downcase-word (@key{M-l}) Lowercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @item capitalize-word (@key{M-c}) Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point. @end ftable @node Commands For Killing, Numeric Arguments, Commands For Text, Readline Init Syntax @appendixsubsec Killing And Yanking @ftable @code @item kill-line (@key{C-k}) Kill the text from the current cursor position to the end of the line. @item backward-kill-line () Kill backward to the beginning of the line. This is normally unbound. @item kill-word (@key{M-d}) Kill from the cursor to the end of the current word, or if between words, to the end of the next word. @item backward-kill-word (@key{M-DEL}) Kill the word behind the cursor. @item unix-line-discard (@key{C-u}) Do what @key{C-u} used to do in Unix line input. We save the killed text on the kill-ring, though. @item unix-word-rubout (@key{C-w}) Do what @key{C-w} used to do in Unix line input. The killed text is saved on the kill-ring. This is different than backward-kill-word because the word boundaries differ. @item yank (@key{C-y}) Yank the top of the kill ring into the buffer at point. @item yank-pop (@key{M-y}) Rotate the kill-ring, and yank the new top. You can only do this if the prior command is yank or yank-pop. @end ftable @node Numeric Arguments, Commands For Completion, Commands For Killing, Readline Init Syntax @appendixsubsec Specifying Numeric Arguments @ftable @code @item digit-argument (@key{M-0}, @key{M-1}, ... @key{M--}) Add this digit to the argument already accumulating, or start a new argument. @key{M--} starts a negative argument. @item universal-argument () Do what @key{C-u} does in emacs. By default, this is not bound. @end ftable @node Commands For Completion, Miscellaneous Commands, Numeric Arguments, Readline Init Syntax @appendixsubsec Letting Readline Type For You @ftable @code @item complete (TAB) Attempt to do completion on the text before point. This is implementation defined. Generally, if you are typing a file name argument, you can do file name completion; if you are typing a command, you can do command completion, if you are typing in a symbol to GDB, you can do symbol name completion, if you are typing in a variable to Bash, you can do variable name completion... @item possible-completions (M-?) List the possible completions of the text before point. @end ftable @node Miscellaneous Commands, , Commands For Completion, Readline Init Syntax @appendixsubsec Some Miscellaneous Commands @ftable @code @item re-read-init-file (@key{C-x} @key{C-r}) Read in the contents of your @file{~/.inputrc} file, and incorporate any bindings found there. @item abort (@key{C-g}) Ding! Stops things. @item do-uppercase-version (@key{M-a}, @key{M-b}, ...) Run the command that is bound to your uppercase brother. @item prefix-meta (ESC) Make the next character that you type be metafied. This is for people without a meta key. Typing @key{ESC f} is equivalent to typing @key{M-f}. @item undo (@key{C-_}) Incremental undo, separately remembered for each line. @item revert-line (@key{M-r}) Undo all changes made to this line. This is like typing the `undo' command enough times to get back to the beginning. @end ftable @node Readline Vi Mode, , Readline Init Syntax, Command Line Editing @appendixsec Readline Vi Mode While the Readline library does not have a full set of Vi editing functions, it does contain enough to allow simple editing of the line. In order to switch interactively between Emacs and Vi editing modes, use the command @key{M-C-j} (toggle-editing-mode). When you enter a line in Vi mode, you are already placed in `insertion' mode, as if you had typed an `i'. Pressing @key{ESC} switches you into `edit' mode, where you can edit the text of the line with the standard Vi movement keys, move to previous history lines with `k', and following lines with `j', and so forth. octave-1.1.0/doc/set.texi100666 415 17 2017 5705073521 13376 0ustar jweusers@c Copyright (C) 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Sets, Statistics, Signal Processing, Top @chapter Sets Octave has a limited set of functions for managing sets of data, where a set is defined as a collection unique elements. @findex create_set Given a matrix or vector of values, the function @code{create_set} returns a row vector containing unique values, sorted in ascending order. For example, @samp{create_set ([1, 2; 3, 4; 4, 2])} returns the vector @samp{[1, 2, 3, 4]}. @findex union @findex intersection The functions @code{union} and @code{intersection} take two sets as arguments and return the union and interection, respectively. For example, @samp{union ([1, 2, 3], [2, 3, 5])} returns the vector @samp{[1, 2, 5]}. @findex complement The function @code{complement (@var{a}, @var{b})} returns the elements of set @var{b} that are not in set @var{a}. For example, @samp{complement ([1, 2, 3], [2, 3, 5])} returns the value @samp{5}. octave-1.1.0/doc/signal.texi100666 415 17 10677 5705306537 14121 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Signal Processing, Sets, Control Theory, Top @chapter Signal Processing I hope that someday Octave will include more signal processing functions. If you would like to help improve Octave in this area, please contact @code{bug-octave@@che.utexas.edu}. @ftable @code @item fft (@var{a}) Compute the FFT of @var{a} using subroutines from FFTPACK. @item fft2 (@var{a}) Compute the two dimensional FFT of @var{a}. @item fftconv (@var{a}, @var{b}, @var{N}) This function returns the convolution of the vectors @var{a} and @var{b}, a vector with length equal to the @code{length (a) + length (b) - 1}. If @var{a} and @var{b} are the coefficient vectors of two polynomials, the returned value is the coefficient vector of the product polynomial. The computation uses the FFT by calling the function @code{fftfilt}. If the optional argument @var{N} is specified, an N-point FFT is used. @item fftfilt (@var{b}, @var{x}, @var{N}) With two arguments, @code{fftfilt} filters @var{x} with the FIR filter @var{b} using the FFT. Given the optional third argument, @var{N}, @code{fftfilt} uses the overlap-add method to filter @var{x} with @var{b} using an N-point FFT. @item filter (@var{b}, @var{a}, @var{x}) This function returns the solution to the following linear, time-invariant difference equation: @iftex @tex $$ \sum_{k=0}^N a_{k+1} y_{n-k} + \sum_{k=0}^M b_{k+1} x_{n-k} = 0, \qquad 1 \le n \le P $$ @end tex @end iftex @ifinfo @smallexample N M SUM a(k+1) y(n-k) + SUM b(k+1) x(n-k) = 0 for 1<=n<=length(x) k=0 k=0 @end smallexample @end ifinfo @noindent where @ifinfo N=length(a)-1 and M=length(b)-1. @end ifinfo @iftex @tex $a \in \Re^{N-1}$, $b \in \Re^{M-1}$, and $x \in \Re^P$. @end tex @end iftex An equivalent form of this equation is: @iftex @tex $$ y_n = \sum_{k=1}^N c_{k+1} y_{n-k} + \sum_{k=0}^M d_{k+1} x_{n-k}, \qquad 1 \le n \le P $$ @end tex @end iftex @ifinfo @smallexample N M y(n) = SUM c(k+1) y(n-k) + SUM d(k+1) x(n-k) for 1<=n<=length(x) k=1 k=0 @end smallexample @end ifinfo @noindent where @ifinfo c = a/a(1) and d = b/a(1). @end ifinfo @iftex @tex $c = a/a_1$ and $d = b/a_1$. @end tex @end iftex In terms of the z-transform, y is the result of passing the discrete- time signal x through a system characterized by the following rational system function: @iftex @tex $$ H(z) = {\sum_{k=0}^M d_{k+1} z^{-k} \over 1 + \sum_{k+1}^N c_{k+1} z^{-k}} $$ @end tex @end iftex @ifinfo @example M SUM d(k+1) z^(-k) k=0 H(z) = ---------------------- N 1 + SUM c(k+1) z(-k) k=1 @end example @end ifinfo When called as @example [y, sf] = filter (b, a, x, si) @end example @noindent @code{filter} uses the argument @var{si} as the initial state of the system and and returns the final state in @var{sf}. The state vector is a column vector whose length is equal to the length of the longest coefficient vector minus one. If @var{si} is not set, the initial state vector is set to all zeros. @item freqz Compute the frequency response of a filter. @code{[@var{h}, @var{w}] = freqz (@var{b})} returns the complex frequency response @var{h} of the FIR filter with coefficients @var{b}. The response is evaluated at 512 angular frequencies between 0 and @ifinfo pi. @end ifinfo @iftex @tex $\pi$. @end tex @end iftex @noindent The output value @var{w} is a vector containing the 512 frequencies. @code{[@var{h}, @var{w}] = freqz (@var{b}, @var{a})} returns the complex frequency response of the rational IIR filter whose numerator has coefficients @var{b} and denominator coefficients @var{a}. @code{[@var{h}, @var{w}] = freqz (@var{b}, @var{a}, @var{n})} returns the response evaluated at @var{n} angular frequencies. For fastest computation n should factor into a small number of small primes. @code{[@var{h}, @var{w}] = freqz (@var{b}, @var{a}, @var{n}, "whole")} evaluates the response at n frequencies between 0 and @ifinfo 2*pi. @end ifinfo @iftex @tex $2\pi$. @end tex @end iftex @item ifft (@var{a}) Compute the inverse FFT of @var{a} using subroutines from FFTPACK. @item ifft2 Compute the two dimensional inverse FFT of @var{a}. @item sinc (@var{x}) Returns @iftex @tex $ \sin (\pi x)/(\pi x)$. @end tex @end iftex @ifinfo sin(pi*x)/(pi*x). @end ifinfo @end ftable octave-1.1.0/doc/special.texi100666 415 17 21072 5705273330 14245 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Special Matrices, Matrix Manipulation, Input and Output, Top @chapter Special Matrices Octave provides a number of functions for creating special matrix forms. In nearly all cases, it is best to use the built-in functions for this purpose than to try to use other tricks to achieve the same effect. @menu * Special Utility Matrices:: * Famous Matrices:: @end menu @node Special Utility Matrices, Famous Matrices, Special Matrices, Special Matrices @section Special Utility Matrices @findex eye The function @code{eye} returns an identity matrix. If invoked with a single scalar argument, @code{eye} returns a square matrix with the dimension specified. If you supply two scalar arguments, @code{eye} takes them to be the number of rows and columns. If given a matrix or vector argument, @code{eye} returns an identity matrix with the same dimensions as the given argument. For example, @example eye (3) @end example @noindent creates an identity matrix with three rows and three columns, @example eye (5, 8) @end example @noindent creates an identity matrix with five rows and eight columns, and @example eye ([13, 21; 34, 55]) @end example @noindent creates an identity matrix with two rows and two columns. Normally, @code{eye} expects any scalar arguments you provide to be real and non-negative. The variables @code{ok_to_lose_imaginary_part} and @code{treat_neg_dim_as_zero} control the behavior of @code{eye} for complex and negative arguments. @xref{User Preferences}. Any non-integer arguments are rounded to the nearest integer value. There is an ambiguity when these functions are called with a single argument. You may have intended to create a matrix with the same dimensions as another variable, but ended up with something quite different, because the variable that you used as an argument was a scalar instead of a matrix. For example, if you need to create an identity matrix with the same dimensions as another variable in your program, it is best to use code like this @example eye (rows (a), columns (a)) @end example @noindent instead of just @example eye (a) @end example @noindent unless you know that the variable @var{a} will @emph{always} be a matrix. @findex ones @findex zeros @findex rand The functions @code{ones}, @code{zeros}, and @code{rand} all work like @code{eye}, except that they fill the resulting matrix with all ones, all zeros, or a set of random values. If you need to create a matrix whose values are all the same, you should use an expression like @example val_matrix = val * ones (n, m) @end example The @code{rand} function also takes some additional arguments that allow you to control its behavior. For example, the function call @example rand ("normal") @end example @noindent causes the sequence of numbers to be normally distributed. You may also use an argument of @code{"uniform"} to select a uniform distribution. To find out what the current distribution is, use an argument of @code{"dist"}. Normally, @code{rand} obtains the seed from the system clock, so that the sequence of random numbers is not the same each time you run Octave. If you really do need for to reproduce a sequence of numbers exactly, you can set the seed to a specific value. For example, the function call @example rand ("seed", 13) @end example @noindent sets the seed to the number 13. To see what the current seed is, use the argument @code{"seed"}. If it is invoked without arguments, @code{rand} returns a single element of a random sequence. The @code{rand} function uses Fortran code from RANLIB, a library of fortran routines for random number generation, compiled by Barry W. Brown and James Lovato of the Department of Biomathematics at The University of Texas, M.D. Anderson Cancer Center, Houston, TX 77030. @findex diag To create a diagonal matrix with vector @var{v} on diagonal @var{k}, use the function diag (@var{v}, @var{k}). The second argument is optional. If it is positive, the vector is placed on the @var{k}-th super-diagonal. If it is negative, it is placed on the @var{-k}-th sub-diagonal. The default value of @var{k} is 0, and the vector is placed on the main diagonal. For example, @example octave:13> diag ([1, 2, 3], 1) ans = 0 1 0 0 0 0 2 0 0 0 0 3 0 0 0 0 @end example @findex linspace @findex logspace The functions @code{linspace} and @code{logspace} make it very easy to create vectors with evenly or logarithmically spaced elements. For example, @example linspace (@var{base}, @var{limit}, @var{n}) @end example @noindent creates a vector with @var{n} (@var{n} greater than 2) linearly spaced elements between @var{base} and @var{limit}. The @var{base} and @var{limit} are always included in the range. If @var{base} is greater than @var{limit}, the elements are stored in decreasing order. If the number of points is not specified, a value of 100 is used. The function @code{logspace} is similar to @code{linspace} except that the values are logarithmically spaced. If @var{limit} is equal to @iftex @tex $\pi$, @end tex @end iftex @ifinfo pi, @end ifinfo the points are between @iftex @tex $10^{base}$ and $\pi$, @end tex @end iftex @ifinfo 10^base and pi, @end ifinfo @emph{not} @iftex @tex $10^{base}$ and $10^{\pi}$, @end tex @end iftex @ifinfo 10^base and 10^pi, @end ifinfo in order to be compatible with the corresponding @sc{Matlab} function. @node Famous Matrices, , Special Utility Matrices, Special Matrices @section Famous Matrices The following functions return famous matrix forms. @ftable @code @item hadamard (@var{k}) Return the Hadamard matrix of order n = 2^k. @item hankel (@var{c}, @var{r}) Return the Hankel matrix constructed given the first column @var{c}, and (optionally) the last row @var{r}. If the last element of @var{c} is not the same as the first element of @var{r}, the last element of @var{c} is used. If the second argument is omitted, the last row is taken to be the same as the first column. A Hankel matrix formed from an m-vector @var{c}, and an n-vector @var{r}, has the elements @iftex @tex $$ H (i, j) = \cases{c_{i+j-1},&$i+j-1\le m$;\cr r_{i+j-m},&otherwise.\cr} $$ @end tex @end iftex @ifinfo @example @group H (i, j) = c (i+j-1), i+j-1 <= m; H (i, j) = r (i+j-m), otherwise @end group @end example @end ifinfo @item hilb (@var{n}) Return the Hilbert matrix of order @var{n}. The @iftex @tex $i,\,j$ @end tex @end iftex @ifinfo i, j @end ifinfo element of a Hilbert matrix is defined as @iftex @tex $$ H (i, j) = {1 \over (i + j - 1)} $$ @end tex @end iftex @ifinfo @example H (i, j) = 1 / (i + j - 1) @end example @end ifinfo @item invhilb (@var{n}) Return the inverse of a Hilbert matrix of order @var{n}. This is exact. Compare with the numerical calculation of @code{inverse (hilb (n))}, which suffers from the ill-conditioning of the Hilbert matrix, and the finite precision of your computer's floating point arithmetic. @item toeplitz (@var{c}, @var{r}) Return the Toeplitz matrix constructed given the first column @var{c}, and (optionally) the first row @var{r}. If the first element of @var{c} is not the same as the first element of @var{r}, the first element of @var{c} is used. If the second argument is omitted, the first row is taken to be the same as the first column. A square Toeplitz matrix has the form @iftex @tex $$ \left[\matrix{c_0 & r_1 & r_2 & \ldots & r_n\cr c_1 & c_0 & r_1 & & c_{n-1}\cr c_2 & c_1 & c_0 & & c_{n-2}\cr \vdots & & & & \vdots\cr c_n & c_{n-1} & c_{n-2} & \ldots & c_0}\right]. $$ @end tex @end iftex @ifinfo @example @group c(0) r(1) r(2) ... r(n) c(1) c(0) r(1) r(n-1) c(2) c(1) c(0) r(n-2) . . . . . . c(n) c(n-1) c(n-2) ... c(0) @end group @end example @end ifinfo @item vander (@var{c}) Return the Vandermonde matrix whose next to last column is @var{c}. A Vandermonde matrix has the form @iftex @tex $$ \left[\matrix{c_0^n & \ldots & c_0^2 & c_0 & 1\cr c_1^n & \ldots & c_1^2 & c_1 & 1\cr \vdots & & \vdots & \vdots & \vdots\cr c_n^n & \ldots & c_n^2 & c_n & 1}\right]. $$ @end tex @end iftex @ifinfo @example @group c(0)^n ... c(0)^2 c(0) 1 c(1)^n ... c(1)^2 c(1) 1 . . . . . . . . . . . . c(n)^n ... c(n)^2 c(n) 1 @end group @end example @end ifinfo @end ftable octave-1.1.0/doc/stats.texi100666 415 17 4613 5705073520 13744 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Statistics, Plotting, Sets, Top @chapter Statistics I hope that someday Octave will include more statistics functions. If you would like to help improve Octave in this area, please contact @code{bug-octave@@che.utexas.edu}. @ftable @code @item corrcoef (@var{x} [, @var{y}]) If each row of @var{x} and @var{y} is an observation and each column is a variable, the (i,j)-th entry of @code{corrcoef (@var{x}, @var{y})} is the correlation between the i-th variable in @var{x} and the j-th variable in @var{y}. If invoked with one argument, compute @code{corrcoef (@var{x}, @var{x})}. @item cov (@var{x} [, @var{y}]) If each row of @var{x} and @var{y} is an observation and each column is a variable, the (i,j)-th entry of @code{cov (@var{x}, @var{y})} is the covariance between the i-th variable in X and the j-th variable in @var{y}. If invoked with one argument, compute @code{cov (@var{x}, @var{x})}. @item kurtosis (@var{x}) If @var{x} is a vector of length N, return the kurtosis @example kurtosis(x) = N^(-1) std(x)^(-4) SUM_i (x(i)-mean(x))^4 - 3 @end example @noindent of @var{x}. If @var{x} is a matrix, return the row vector containing the kurtosis of each column. @item mahalanobis (@var{x}, @var{y}) Returns Mahalanobis' D-square distance between the multivariate samples @var{x} and @var{y}, which must have the same number of components (columns), but may have a different number of observations (rows). @item mean (@var{a}) If @var{a} is a vector, compute the mean of the elements of @var{a}. If @var{a} is a matrix, compute the mean for each column and return them in a row vector. @item median (@var{a}) If @var{a} is a vector, compute the median value of the elements of @var{a}. If @var{a} is a matrix, compute the median value for each column and return them in a row vector. @item skewness (@var{x}) If @var{x} is a vector of length N, return the skewness @example skewness (x) = N^(-1) std(x)^(-3) SUM_i (x(i)-mean(x))^3 @end example @noindent of @var{x}. If @var{x} is a matrix, return the row vector containing the skewness of each column. @item std (@var{a}) If @var{a} is a vector, compute the standard deviation of the elements of @var{a}. If @var{a} is a matrix, compute the standard deviation for each column and return them in a row vector. @end ftable octave-1.1.0/doc/stmt.texi100666 415 17 33617 5705272550 13627 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Statements, Functions and Scripts, Expressions, Top @chapter Statements @cindex statements @dfn{Control statements} such as @code{if}, @code{while}, and so on control the flow of execution in Octave programs. All the control statements start with special keywords such as @code{if} and @code{while}, to distinguish them from simple expressions. @cindex @code{end} statement Many control statements contain other statements; for example, the @code{if} statement contains another statement which may or may not be executed. Each control statement has a corresponding @dfn{end} statement that marks the end of the end of the control statement. For example, the keyword @code{endif} marks the end of an @code{if} statement, and @code{endwhile} marks the end of a @code{while} statement. You can use the keyword @code{end} anywhere a more specific end keyword is expected, but using the more specific keywords is preferred because if you use them, Octave is able to provide better diagnostics for mismatched or missing end tokens. The list of statements contained between keywords like @code{if} or @code{while} and the corresponding end statement is called the @dfn{body} of a control statement. @menu * The if Statement:: * The while Statement:: * The for Statement:: * The break Statement:: * The continue Statement:: * The unwind_protect Statement:: @end menu @node The if Statement, The while Statement, Statements, Statements @section The @code{if} Statement @cindex @code{if} statement @cindex @code{else} statement @cindex @code{elseif} statement @cindex @code{endif} statement The @code{if} statement is Octave's decision-making statement. There are three basic forms of an @code{if} statement. In its simplest form, it looks like this: @example if (@var{condition}) @var{then-body} endif @end example @noindent @var{condition} is an expression that controls what the rest of the statement will do. The @var{then-body} is executed only if @var{condition} is true. The condition in an @code{if} statement is considered true if its value is non-zero, and false if its value is zero. If the value of the conditional expression in an @code{if} statement is a vector or a matrix, it is considered true only if @emph{all} of the elements are non-zero. The second form of an if statement looks like this: @example if (@var{condition}) @var{then-body} else @var{else-body} endif @end example @noindent If @var{condition} is true, @var{then-body} is executed; otherwise, @var{else-body} is executed. Here is an example: @example @group if (rem (x, 2) == 0) printf ("x is even\n"); else printf ("x is odd\n"); endif @end group @end example In this example, if the expression @code{rem (x, 2) == 0} is true (that is, the value of @code{x} is divisible by 2), then the first @code{printf} statement is evaluated, otherwise the second @code{printf} statement is evaluated. The third and most general form of the @code{if} statement allows multiple decisions to be combined in a single statement. It looks like this: @example if (@var{condition}) @var{then-body} elseif (@var{condition}) @var{elseif-body} else @var{else-body} endif @end example @noindent Any number of @code{elseif} clauses may appear. Each condition is tested in turn, and if one is found to be true, its corresponding @var{body} is executed. If none of the conditions are true and the @code{else} clause is present, its body is executed. Only one @code{else} clause may appear, and it must be the last part of the satement. In the following example, if the first condition is true (that is, the value of @code{x} is divisible by 2), then the first @code{printf} statement is executed. If it is false, then the second condition is tested, and if it is true (that is, the value of @code{x} is divisible by 3), then the second @code{printf} statement is executed. Otherwise, the third @code{printf} statement is performed. @example @group if (rem (x, 2) == 0) printf ("x is even\n"); elseif (rem (x, 3) == 0) printf ("x is odd and divisible by 3\n"); else printf ("x is odd\n"); endif @end group @end example Note that the @code{elseif} keyword must not be spelled @code{else if}, as is allowed in Fortran. If it is, the space between the @code{else} and @code{if} will tell Octave to treat this as a new @code{if} statement within another @code{if} statement's @code{else} clause. For example, if you write @example @group if (@var{c1}) @var{body-1} else if (@var{c2}) @var{body-2} endif @end group @end example @noindent Octave will expect additional input to complete the first @code{if} statement. If you are using Octave interactively, it will continue to prompt you for additional input. If Octave is reading this input from a file, it may complain about missing or mismatched @code{end} statements, or, if you have not used the more specific @code{end} statements (@code{endif}, @code{endfor}, etc.), it may simply produce incorrect results, without producing any warning messages. It is much easier to see the error if we rewrite the statements above like this, @example @group if (@var{c1}) @var{body-1} else if (@var{c2}) @var{body-2} endif @end group @end example @noindent using the indentation to show how Octave groups the statements. @xref{Functions and Scripts}. @node The while Statement, The for Statement, The if Statement, Statements @section The @code{while} Statement @cindex @code{while} statement @cindex @code{endwhile} statement @cindex loop @cindex body of a loop In programming, a @dfn{loop} means a part of a program that is (or at least can be) executed two or more times in succession. The @code{while} statement is the simplest looping statement in Octave. It repeatedly executes a statement as long as a condition is true. As with the condition in an @code{if} statement, the condition in a @code{while} statement is considered true if its value is non-zero, and false if its value is zero. If the value of the conditional expression in an @code{if} statement is a vector or a matrix, it is considered true only if @emph{all} of the elements are non-zero. Octave's @code{while} statement looks like this: @example @group while (@var{condition}) @var{body} endwhile @end group @end example @noindent Here @var{body} is a statement or list of statements that we call the @dfn{body} of the loop, and @var{condition} is an expression that controls how long the loop keeps running. The first thing the @code{while} statement does is test @var{condition}. If @var{condition} is true, it executes the statement @var{body}. After @var{body} has been executed, @var{condition} is tested again, and if it is still true, @var{body} is executed again. This process repeats until @var{condition} is no longer true. If @var{condition} is initially false, the body of the loop is never executed. This example creates a variable @code{fib} that contains the elements of the Fibonacci sequence. @example @group fib = ones (1, 10); i = 3; while (i <= 10) fib (i) = fib (i-1) + fib (i-2); i++; endwhile @end group @end example @noindent Here the body of the loop contains two statements. The loop works like this: first, the value of @code{i} is set to 3. Then, the @code{while} tests whether @code{i} is less than or equal to 10. This is the case when @code{i} equals 3, so the value of the @code{i}-th element of @code{fib} is set to the sum of the previous two values in the sequence. Then the @code{i++} increments the value of @code{i} and the loop repeats. The loop terminates when @code{i} reaches 11. A newline is not required between the condition and the body; but using one makes the program clearer unless the body is very simple. @node The for Statement, The break Statement, The while Statement, Statements @section The @code{for} Statement @cindex @code{for} statement @cindex @code{endfor} statement The @code{for} statement makes it more convenient to count iterations of a loop. The general form of the @code{for} statement looks like this: @example @group for @var{var} = @var{expression} @var{body} endfor @end group @end example @noindent The assignment expression in the @code{for} statement works a bit differently than Octave's normal assignment statement. Instead of assigning the complete result of the expression, it assigns each column of the expression to @var{var} in turn. If @var{expression} is either a row vector or a scalar, the value of @var{var} will be a scalar each time the loop body is executed. If @var{var} is a column vector or a matrix, @var{var} will be a column vector each time the loop body is executed. The following example shows another way to create a vector containing the first ten elements of the Fibonacci sequence, this time using the @code{for} statement: @example @group fib = ones (1, 10); for i = 3:10 fib (i) = fib (i-1) + fib (i-2); endfor @end group @end example @noindent This code works by first evaluating the expression @samp{3:10}, to produce a range of values from 3 to 10 inclusive. Then the variable @code{i} is assigned the first element of the range and the body of the loop is executed once. When the end of the loop body is reached, the next value in the range is assigned to the variable @code{i}, and the loop body is executed again. This process continues until there are no more elements to assign. In the @code{for} statement, @var{body} stands for any statement or list of statements. Although it is possible to rewrite all @code{for} loops as @code{while} loops, the Octave language has both statements because often a @code{for} loop is both less work to type and more natural to think of. Counting the number of iterations is very common in loops and it can be easier to think of this counting as part of looping rather than as something to do inside the loop. @node The break Statement, The continue Statement, The for Statement, Statements @section The @code{break} Statement @cindex @code{break} statement The @code{break} statement jumps out of the innermost @code{for} or @code{while} loop that encloses it. The @code{break} statement may only be used within the body of a loop. The following example finds the smallest divisor of a given integer, and also identifies prime numbers: @example @group num = 103; div = 2; while (div*div <= num) if (rem (num, div) == 0) break; endif div++; endwhile if (rem (num, div) == 0) printf ("Smallest divisor of %d is %d\n", num, div) else printf ("%d is prime\n", num); endif @end group @end example When the remainder is zero in the first @code{while} statement, Octave immediately @dfn{breaks out} of the loop. This means that Octave proceeds immediately to the statement following the loop and continues processing. (This is very different from the @code{exit} statement which stops the entire Octave program.) Here is another program equivalent to the previous one. It illustrates how the @var{condition} of a @code{while} statement could just as well be replaced with a @code{break} inside an @code{if}: @example @group @group num = 103; div = 2; while (1) if (rem (num, div) == 0) printf ("Smallest divisor of %d is %d\n", num, div); break; endif div++; if (div*div > num) printf ("%d is prime\n", num); break; endif endwhile @end group @end group @end example @node The continue Statement, The unwind_protect Statement, The break Statement, Statements @section The @code{continue} Statement @cindex @code{continue} statement The @code{continue} statement, like @code{break}, is used only inside @code{for} or @code{while} loops. It skips over the rest of the loop body, causing the next cycle around the loop to begin immediately. Contrast this with @code{break}, which jumps out of the loop altogether. Here is an example: @example @group # print elements of a vector of random # integers that are even. # first, create a row vector of 10 random # integers with values between 0 and 100: vec = round (rand (1, 10) * 100); # print what we're interested in: for x = vec if (rem (x, 2) != 0) continue; endif printf ("%d\n", x); endfor @end group @end example If one of the elements of @var{vec} is an odd number, this example skips the print statement for that element, and continues back to the first statement in the loop. This is not a practical example of the @code{continue} statement, but it should give you a clear understanding of how it works. Normally, one would probably write the loop like this: @example @group for x = vec if (rem (x, 2) == 0) printf ("%d\n", x); endif endfor @end group @end example @node The unwind_protect Statement, , The continue Statement, Statements @section The @code{unwind_protect} Statement Octave supports a limited form of exception handling modelled after the unwind-protect form of Lisp. The general form of an @code{unwind_protect} block looks like this: @example @group unwind_protect @var{body} unwind_protect_cleanup @var{cleanup} end_unwind_protect @end group @end example @noindent Where @var{body} and @var{cleanup} are both optional and may contain any Octave expressions or commands. The statements in @var{cleanup} are guaranteed to be executed regardless of how control exits @var{body}. This is useful to protect temporary changes to global variables from possible errors. For example, the following code will always restore the original value of the built-in variable @code{do_fortran_indexing} even if an error occurs while performing the indexing operation. @example save_do_fortran_indexing = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; elt = a (idx) unwind_protect_cleanup do_fortran_indexing = save_do_fortran_indexing; end_unwind_protect @end example Without @code{unwind_protect}, the value of @var{do_fortran_indexing} would not be restored if an error occurs while performing the indexing operation because evaluation would stop at the point of the error and the statement to restore the value would not be executed. octave-1.1.0/doc/strings.texi100666 415 17 4040 5705073516 14276 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @cindex strings @node String Functions, System Utilities, Matrix Manipulation, Top @chapter String Functions Octave currently has a limited ability to work with strings. @findex strcmp The function @code{strcmp (@var{s1}, @var{s2})} compares two strings, returning 1 if they are the same, and 0 otherwise. @strong{Note: For compatibility with @sc{Matlab}, Octave's strcmp function returns 1 if the strings are equal, and 0 otherwise. This is just the opposite of the corresponding C library function.} @findex int2str @findex num2str The functions @code{int2str} and @code{num2str} convert a numeric argument to a string. These functions are not very flexible, but are provided for compatibility with @sc{Matlab}. For better control over the results, use @code{sprintf} (@pxref{Formatted Output}). @findex setstr The function @code{setstr} can be used to convert a vector to a string. Each element of the vector is converted to the corresponding ASCII character. For example, @example setstr ([97, 98, 99]) @end example @noindent creates the string @example abc @end example @findex undo_string_escapes The function @code{undo_string_escapes (@var{string})} converts special characters in strings back to their escaped forms. For example, the expression @example bell = "\a"; @end example @noindent assigns the value of the alert character (control-g, ASCII code 7) to the string variable @var{bell}. If this string is printed, the system will ring the terminal bell (if it is possible). This is normally the desired outcome. However, sometimes it is useful to be able to print the original representation of the string, with the special characters replaced by their escape sequences. For example, @example octave:13> undo_string_escapes (bell) ans = \a @end example @noindent replaces the unprintable alert character with its printable representation. @xref{String Constants}, for a description of string escapes. octave-1.1.0/doc/system.texi100666 415 17 16627 5705311125 14156 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node System Utilities, Command History Functions, String Functions, Top @chapter System Utilities This chapter describes the functions that are available to allow you to get information about what is happening outside of Octave, while it is still running, and use this information in your program. For example, you can get information about environment variables, the current time, and even start other programs from the Octave prompt. @menu * Timing Utilities:: * Interacting with the OS:: * System Information:: * Other Functions:: @end menu @node Timing Utilities, Interacting with the OS, System Utilities, System Utilities @section Timing Utilities @findex clock The function @code{clock} returns a vector containing the current year, month (1-12), day (1-31), hour (0-23), minute (0-59) and second (0-60). For example, @example octave:13> clock ans = 1993 8 20 4 56 1 @end example The function clock is more accurate on systems that have the @code{gettimeofday} function. @findex date To get the date as a character string in the form DD-MMM-YY, use the command @code{date}. For example, @example octave:13> date ans = 20-Aug-93 @end example @findex tic @findex toc @findex etime Octave also has functions for computing time intervals and CPU time used. The functions @code{tic} and @code{toc} can be used to set and check a wall-clock timer. For example, @example tic (); # many computations later... elapsed_time = toc (); @end example @noindent will set the variable @code{elapsed_time} to the number of seconds since the most recent call to the function @code{tic}. The function @code{etime} provides another way to get elapsed wall-clock time by returning the difference (in seconds) between two time values returned from @code{clock}. For example: @example t0 = clock (); # many computations later... elapsed_time = etime (clock (), t0); @end example @noindent will set the variable @code{elapsed_time} to the number of seconds since the variable @code{t0} was set. @findex cputime The function @code{cputime} allows you to obtain information about the amount of CPU time your Octave session is using. For example, @example [total, user, system] = cputime (); @end example @noindent returns the CPU time used by your Octave session. The first output is the total time spent executing your process and is equal to the sum of second and third outputs, which are the number of CPU seconds spent executing in user mode and the number of CPU seconds spent executing in system mode, respectively. @findex is_leap_year Finally, Octave's function @code{is_leap_year} returns 1 if the given year is a leap year and 0 otherwise. If no arguments are provided, @code{is_leap_year} will use the current year. For example, @example octave:13> is_leap_year (2000) ans = 1 @end example @noindent Contrary to what many people who post misinformation to Usenet apparently believe, Octave knows that the year 2000 will be a leap year. @node Interacting with the OS, System Information, Timing Utilities, System Utilities @section Interacting with the OS @findex shell_cmd @findex system You can execute any shell command using the function @code{system (@var{cmd}, @var{flag})}. The second argument is optional. If it is present, the output of the command is returned by @code{system} as a string. If it is not supplied, any output from the command is printed, with the standard output filtered through the pager. For example, @c XXX FIXME XXX -- perhaps there should be another possible value for @c the second argument, to indicate that the command is to be run @c interactively, with the standard input and output connected to @c /dev/tty. @example users = system ("finger", 1) @end example @noindent places the output of the command @code{finger} in the variable @code{users}. If you want to execute a shell command and have it behave as if it were typed directly from the shell prompt, you may need to specify extra arguments for the command. For example, to get @code{bash} to behave as an interactive shell, you can type @example system ("bash -i >/dev/tty"); @end example The first argument, @samp{-i}, tells @code{bash} to behave as an interactive shell, and the redirection of the standard output stream prevents any output produced by @code{bash} from being sent back to Octave, where it would be buffered until Octave displays another prompt. The @code{system} function can return two values. The first is any output from the command that was written to the standard output stream, and the second is the output status of the command. For example, @example [output, status] = system ("echo foo; exit 2"); @end example @noindent will set the variable @code{output} to the string @samp{foo}, and the variable @code{status} to the integer @samp{2}. The name @code{shell_cmd} exists for compatibility with earlier versions of Octave. @findex getenv You can find the values of environment variables using the function @code{getenv}. For example, @example getenv ("PATH") @end example @noindent returns a string containing the value of your path. @findex clc @findex home The functions @code{clc}, and @code{home} clear your terminal screen and move the cursor to the upper left corner. @findex cd You can change the current working directory using the @code{cd} command. Tilde expansion is performed on the path. For example, @example cd ~/octave @end example @noindent Changes the current working directory to @file{~/octave}. If the directory does not exist, an error message is printed and the working directory is not changed. @findex chdir The name @code{chdir} is an alias for @code{cd}. @findex pwd The command @code{pwd} prints the current working directory. @findex dir @findex ls The functions @code{dir} and @code{ls} list directory contents. For example, @example octave:13> ls -l total 12 -rw-r--r-- 1 jwe users 4488 Aug 19 04:02 foo.m -rw-r--r-- 1 jwe users 1315 Aug 17 23:14 bar.m @end example The @code{dir} and @code{ls} commands are implemented by calling your system's directory listing command, so the available options may vary from system to system. @node System Information, Other Functions, Interacting with the OS, System Utilities @section System Information @findex computer If possible, @code{computer} prints a string of the form @var{cpu}-@var{vendor}-@var{os} that identifies the kind of computer Octave is running on. For example, @example octave:13> computer sparc-sun-sunos4.1.2 @end example @findex isieee The function @code{isieee} returns 1 if your computer claims to conform to the IEEE standard for floating point calculations. @findex version The function @code{version} returns Octave's version number as a string. This is also the value of the built-in variable @code{OCTAVE_VERSION}. @xref{Built-in Variables}. @node Other Functions, , System Information, System Utilities @section Other Functions @findex pause The function @code{pause} allows you to suspend the execution of a program. If invoked without any arguments, Octave waits until you type a character. With a numeric argument, it pauses for the given number of seconds. For example, the following statement prints a message and then waits 5 seconds before clearing the screen. @example fprintf (stderr, "wait please...\n"), pause (5), clc @end example octave-1.1.0/doc/var.texi100666 415 17 55205 5705307201 13415 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Built-in Variables, Arithmetic, Functions and Scripts, Top @chapter Built-in Variables @cindex variables @cindex built-in variables @cindex variables, built-in Most Octave variables are available for you to use for your own purposes; they never change except when your program assigns values to them, and never affect anything except when your program examines them. A few variables have special built-in meanings. Some of them, like @code{pi} and @code{eps} provide useful predefined constant values. Others, like @code{do_fortran_indexing} and @code{page_screen_output} are examined automatically by Octave, so that you can to tell Octave how to do certain things. There are also two special variables, @code{ans} and @code{PWD}, that are set automatically by Octave and carry information from the internal workings of Octave to your program. This chapter documents all the built-in variables of Octave. Most of them are also documented in the chapters that describe functions that use them, or are affected by their values. @c XXX FIXME XXX -- this should eventually happen. @menu * Predefined Constants:: * User Preferences:: * Other Built-in Variables:: * Summary of Preference Variables:: @end menu @node Predefined Constants, User Preferences, Built-in Variables, Built-in Variables @section Predefined Constants @vtable @code @item I@r{,} i@r{,} J@r{,} j A pure imaginary number, defined as @iftex @tex $\sqrt{-1}$. @end tex @end iftex @ifinfo @code{sqrt (-1)}. @end ifinfo The @code{I} and @code{J} forms are true constants, and cannot be modified. The @code{i} and @code{j} forms are like ordinary variables, and may be used for other purposes. However, unlike other variables, they once again assume their special predefined values if they are cleared @xref{Miscellaneous Utilities}. @item Inf@r{,} inf Infinity. This is the result of an operation like 1/0, or an operation that results in a floating point overflow. @item NaN@r{,} nan Not a number. This is the result of an operation like @samp{0/0}, or @samp{Inf - Inf}, or any operation with a NaN. @item SEEK_SET @itemx SEEK_CUR @itemx SEEK_END These variables may be used as the optional third argument for the function @code{fseek}. @item eps The machine precision. More precisely, @code{eps} is the smallest value such that @samp{1+eps} is not equal to 1. This number is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, @code{eps} is approximately @ifinfo 2.2204e-16. @end ifinfo @iftex @tex $2.2204\times10^{-16}$. @end tex @end iftex @item pi The ratio of the circumference of a circle to its diameter. Internally, @code{pi} is computed as @samp{4.0 * atan (1.0)}. @item realmax The largest floating point number that is representable. The actual value is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, @code{realmax} is approximately @ifinfo 1.7977e+308 @end ifinfo @iftex @tex $1.7977\times10^{308}$. @end tex @end iftex @item realmin The smallest floating point number that is representable. The actual value is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, @code{realmin} is approximately @ifinfo 2.2251e-308 @end ifinfo @iftex @tex $2.2251\times10^{-308}$. @end tex @end iftex @item stdin @itemx stdout @itemx stderr These variables are the file numbers corresponding to the standard input, standard output, and standard error streams. These streams are preconnected and available when Octave starts. @end vtable @node User Preferences, Other Built-in Variables, Predefined Constants, Built-in Variables @section User Preferences This section describes the variables that you can use to customize Octave's behavior. Normally, preferences are set in the file @file{~/.octaverc}, so that you can customize your environment in the same way each time you use Octave without having to remember and retype all the necessary commands. @xref{Startup Files} for more information. @vtable @code @item EDITOR A string naming the editor to use with the @code{edit_history} command. If the environment variable @code{EDITOR} is set when Octave starts, its value is used as the default. Otherwise, @code{EDITOR} is set to @code{"vi"}. @item IMAGEPATH A colon separated list of directories in which to search for image files. @xref{Image Processing} for a description of Octave's image processing capabilities. @item INFO_FILE A string naming the location of the Octave info file. The default value is @code{"@value{OCTAVEHOME}/info/octave.info"}. @item LOADPATH A colon separated list of directories in which to search for function files. @xref{Functions and Scripts}. The value of @code{LOADPATH} overrides the environment variable @code{OCTAVE_PATH}. @xref{Installation}. @code{LOADPATH} is now handled in the same way as @TeX{} handles @code{TEXINPUTS}. If the path starts with @samp{:}, the standard path is prepended to the value of @code{LOADPATH}. If it ends with @samp{:} the standard path is appended to the value of @code{LOADPATH}. In addition, if any path element ends in @samp{//}, that directory and all subdirectories it contains are searched recursively for function files. This can result in a slight delay as Octave caches the lists of files found in the @code{LOADPATH} the first time Octave searches for a function. After that, searching is usually much faster because Octave normally only needs to search its internal cache for files. To improve performance of recursive directory searching, it is best for each directory that is to be searched recursively to contain @emph{either} additional subdirectories @emph{or} function files, but not a mixture of both. @xref{Organization of Functions} for a description of the function file directories that are distributed with Octave. @item OCTAVE_VERSION The version number of Octave, as a string. @item PAGER The default value is @code{"less"}, or, if @code{less} is not available on your system, @code{"more"}. @xref{Installation}, and @ref{Input and Output}. @item PS1 The primary prompt string. When executing interactively, Octave displays the primary prompt @code{PS1} when it is ready to read a command. Octave allows the prompt to be customized by inserting a number of backslash-escaped special characters that are decoded as follows: @table @samp @item \t The time. @item \d The date. @item \n Begins a new line by printing the equivalent of a carriage return followed by a line feed. @item \s The name of the program (usually just @code{octave}). @item \w The current working directory. @item \W The basename of the current working directory. @item \u The username of the current user. @item \h The hostname. @item \# The command number of this command, counting from when Octave starts. @item \! The history number of this command. This differs from @samp{\#} by the number of commands in the history list when Octave starts. @item \$ If the effective UID is 0, a #, otherwise a $. @item \nnn The character whose character code in octal is @samp{nnn}. @item \\ A backslash. @end table The default value of @code{PS1} is @code{"\s:\#> "}. To change it, use a command like @example octave:13> PS1 = "\\u@@\\h> " @end example @noindent which will result in the prompt @samp{boris@@kremvax> } for the user @samp{boris} logged in on the host @samp{kremvax}. Note that two backslashes are required to enter a backslash into a string. @xref{String Constants}. @item PS2 The secondary prompt string, which is printed when Octave is expecting additional input to complete a command. For example, when defining a function over several lines, Octave will print the value of @code{PS1} at the beginning of each line after the first. Octave allows @code{PS2} to be customized in the same way as @code{PS1}. The default value of @code{PS2} is @code{"> "}. @item automatic_replot If this variable is @code{"true"}, Octave will automatically send a @code{replot} command to @code{gnuplot} each time the plot changes. Since this is fairly inefficient, the default value is @code{"false"}. @item whitespace_in_literal_matrix This variable allows some control over how Octave decides to convert spaces to commas and semicolons in matrix expressions like @samp{[m (1)]} or @example [ 1, 2, 3, 4 ] @end example If the value of @code{whitespace_in_literal_matrix} is @code{"ignore"}, Octave will never insert a comma or a semicolon in a literal matrix list. For example, the expression @samp{[1 2]} will result in an error instead of being treated the same as @samp{[1, 2]}, and the expression @example [ 1, 2, 3, 4 ] @end example @noindent will result in the vector [1 2 3 4] instead of a matrix. If the value of @code{whitespace_in_literal_matrix} is @code{"traditional"}, Octave will convert spaces to a comma between identifiers and @samp{(}. For example, given the matrix @example m = [3 2] @end example @noindent the expression @example [m (1)] @end example @noindent will be parsed as @example [m, (1)] @end example @noindent and will result in @example [3 2 1] @end example @noindent and the expression @example [ 1, 2, 3, 4 ] @end example @noindent will result in a matrix because the newline character is converted to a semicolon (row separator) even though there is a comma at the end of the first line (trailing commas or semicolons are ignored). This is apparently how @sc{Matlab} behaves. Any other value for @code{whitespace_in_literal_matrix} results in behavior that is the same as traditional, except that Octave does not convert spaces to a comma between identifiers and @samp{(}. For example, the expression @example [m (1)] @end example will produce @samp{3}. This is the way Octave has always behaved. @item default_save_format @item do_fortran_indexing If the value of @code{do_fortran_indexing} is @code{"true"}, Octave allows you to select elements of a two-dimensional matrix using a single index by treating the matrix as a single vector created from the columns of the matrix. The default value is @code{"false"}. @item empty_list_elements_ok This variable controls whether Octave ignores empty matrices in a matrix list. For example, if the value of @code{empty_list_elements_ok} is @code{"true"}, Octave will ignore the empty matrices in the expression @example a = [1, [], 3, [], 5] @end example @noindent and the variable @samp{a} will be assigned the value @samp{[ 1 3 5 ]}. The default value is @code{"warn"}. @item gnuplot_binary The name of the program invoked by the plot command. The default value is @code{"gnuplot"}. @xref{Installation}. @item ignore_function_time_stamp This variable variable can be used to prevent Octave from making the system call @code{stat()} each time it looks up functions defined in function files. If @code{ignore_function_time_stamp} to @code{"system"}, Octave will not automatically recompile function files in subdirectories of @code{@value{OCTAVEHOME}/lib/@value{VERSION}} if they have changed since they were last compiled, but will recompile other function files in the @code{LOADPATH} if they change. If set to @code{"all"}, Octave will not recompile any function files unless their definitions are removed with @code{clear}. For any other value of @code{ignore_function_time_stamp}, Octave will always check to see if functions defined in function files need to recompiled. The default value of @code{ignore_function_time_stamp} is @code{"system"}. @item implicit_str_to_num_ok If the value of @code{implicit_str_to_num_ok} is @code{"true"}, implicit conversions of strings to their numeric ASCII equivalents are allowed. Otherwise, an error message is printed and control is returned to the top level. The default value is @code{"false"}. @item ok_to_lose_imaginary_part If the value of @code{ok_to_lose_imaginary_part} is @code{"true"}, implicit conversions of complex numbers to real numbers are allowed (for example, by fsolve). If the value is @code{"warn"}, the conversion is allowed, but a warning is printed. Otherwise, an error message is printed and control is returned to the top level. The default value is @code{"warn"}. @item output_max_field_width This variable specifies the maximum width of a numeric output field. The default value is 10. It is possible to achieve a wide range of output styles by using different values of @code{output_precision} and @code{output_max_field_width}. Reasonable combinations can be set using the @code{format} function. @xref{Basic Input and Output}. @item output_precision This variable specifies the minimum number of significant figures to display for numeric output. The default value is 5. It is possible to achieve a wide range of output styles by using different values of @code{output_precision} and @code{output_max_field_width}. Reasonable combinations can be set using the @code{format} function. @xref{Basic Input and Output}. @item page_screen_output If the value of @code{page_screen_output} is @code{"true"}, all output intended for the screen that is longer than one page is sent through a pager. This allows you to view one screenful at a time. Some pagers (such as @code{less}---see @ref{Installation}) are also capable of moving backward on the output. The default value is @code{"true"}. @xref{Input and Output}. You can choose the program to use as the pager by setting the variable @code{PAGER}. @item prefer_column_vectors If @code{prefer_column_vectors} is @code{"true"}, operations like @example for i = 1:10 a (i) = i; endfor @end example @noindent (for @samp{a} previously undefined) produce column vectors. Otherwise, row vectors are preferred. The default value is @code{"false"}. If a variable is already defined to be a vector (a matrix with a single row or column), the original orientation is respected, regardless of the value of @code{prefer_column_vectors}. @item prefer_zero_one_indexing If the value of @code{prefer_zero_one_indexing} is @code{"true"}, Octave will perform zero-one style indexing when there is a conflict with the normal indexing rules. @xref{Index Expressions}. For example, given a matrix @example a = [1, 2, 3, 4] @end example @noindent with @code{prefer_zero_one_indexing} is set to @code{"true"}, the expression @example a ([1, 1, 1, 1]) @end example @noindent results in the matrix @samp{[ 1 2 3 4 ]}. If the value of @code{prefer_zero_one_indexing} set to @code{"false"}, the result would be the matrix @samp{[ 1 1 1 1 ]}. In the first case, Octave is selecting each element corresponding to a @samp{1} in the index vector. In the second, Octave is selecting the first element multiple times. The default value for @code{prefer_zero_one_indexing} is @code{"false"}. @item print_answer_id_name If the value of @code{print_answer_id_name} is @code{"true"}, variable names are printed along with the result. Otherwise, only the result values are printed. The default value is @code{"true"}. @item print_empty_dimensions If the value of @code{print_empty_dimensions} is @code{"true"}, the dimensions of empty matrices are printed along with the empty matrix symbol, @samp{[]}. For example, the expression @example zeros (3, 0) @end example @noindent will print @example ans = [](3x0) @end example @item propagate_empty_matrices If the value of @code{propagate_empty_matrices} is @code{"true"}, functions like @code{inverse} and @code{svd} will return an empty matrix if they are given one as an argument. The default value is @code{"true"}. @xref{Empty Matrices}. @item resize_on_range_error If the value of @code{resize_on_range_error} is @code{"true"}, expressions like @example for i = 1:10 a (i) = i; endfor @end example @noindent (for @samp{a} previously undefined) result in the variable @samp{a} being resized to be just large enough to hold the new value. Otherwise uninitialized elements are set to zero. If the value of @code{resize_on_range_error} is @code{"false"}, an error message is printed and control is returned to the top level. The default value is @code{"true"}. @item return_last_computed_value If the value of @code{return_last_computed_value} is true, and a function is defined without explicitly specifying a return value, the function will return the value of the last expression. Otherwise, no value will be returned. The default value is @code{"false"}. For example, the function @example function f () 2 + 2; endfunction @end example @noindent will either return nothing, if @code{return_last_computed_value} is @code{"false"}, or 4, if it is @code{"true"}. @item save_precision This variable specifies the number of digits to keep when saving data with the @code{save} command. The default value is 17. @item silent_functions If the value of @code{silent_functions} is @code{"true"}, internal output from a function is suppressed. Otherwise, the results of expressions within a function body that are not terminated with a semicolon will have their values printed. The default value is @code{"false"}. For example, if the function @example function f () 2 + 2 endfunction @end example @noindent is executed, Octave will either print @samp{ans = 4} or nothing depending on the value of @code{silent_functions}. @item split_long_rows For large matrices, Octave may not be able to display all the columns of a given row on one line of your screen. This can result in missing information or output that is nearly impossible to decipher, depending on whether your terminal truncates or wraps long lines. If the value of @code{split_long_rows} is @code{"true"}, Octave will display the matrix in a series of smaller pieces, each of which can fit within the limits of your terminal width. Each set of rows is labeled so that you can easily see which columns are currently being displayed. For example: @smallexample octave:13> rand (2, 9) ans = Columns 1 through 7: 0.92205 0.72628 0.99841 0.62590 0.82422 0.77486 0.30258 0.15999 0.79484 0.75443 0.86995 0.91430 0.23980 0.64591 Columns 8 and 9: 0.08894 0.13266 0.28008 0.65575 @end smallexample The default value of @code{split_long_rows} is @code{"true"}. @item treat_neg_dim_as_zero If the value of @code{treat_neg_dim_as_zero} is @code{"true"}, expressions like @example eye (-1) @end example @noindent produce an empty matrix (i.e., row and column dimensions are zero). Otherwise, an error message is printed and control is returned to the top level. The default value is @code{"false"}. @item warn_assign_as_truth_value If the value of @code{warn_assign_as_truth_value} is @code{"true"}, a warning is issued for statements like @example if (s = t) ... @end example @noindent since such statements are not common, and it is likely that the intent was to write @example if (s == t) ... @end example @noindent instead. There are times when it is useful to write code that contains assignments within the condition of a @code{while} or @code{if} statement. For example, statements like @example while (c = getc()) ... @end example @noindent are common in C programming. It is possible to avoid all warnings about such statements by setting @code{warn_assign_as_truth_value} to @code{"false"}, but that may also let real errors like @example if (x = 1) # intended to test (x == 1)! ... @end example @noindent slip by. In such cases, it is possible suppress errors for specific statements by writing them with an extra set of parentheses. For example, writing the previous example as @example while ((c = getc())) ... @end example @noindent will prevent the warning from being printed for this statement, while allowing Octave to warn about other assignments used in conditional contexts. The default value of @code{warn_assign_as_truth_value} is @code{"true"}. @item warn_comma_in_global_decl If the value of @code{warn_comma_in_global_decl} is @code{"true"}, a warning is issued for statements like @example global a = 1, b @end example @noindent which makes the variables @samp{a} and @samp{b} global and assigns the value 1 to the variable @samp{a}, because in this context, the comma is not interpreted as a statement separator. The default value of @code{warn_comma_in_global_decl} is @code{"true"}. @item warn_divide_by_zero If the value of @code{warn_divide_by_zero} is @code{"true"}, a warning is issued when Octave encounters a division by zero. If the value is @code{"false"}, the warning is omitted. The default value is @code{"true"}. @end vtable @node Other Built-in Variables, Summary of Preference Variables, User Preferences, Built-in Variables @section Other Built-in Variables In addition to these variables, there are two other special built-in variables whose values are automatically updated. @vtable @code @item ans This variable holds the most recently computed result that was not explicitly assigned to a variable. For example, after the expression @example 3^2 + 4^2 @end example @noindent is evaluated, the value of @code{ans} is @samp{25}. @item PWD The current working directory. The value of @code{PWD} is updated each time the current working directory is changed with the @samp{cd} command. @xref{System Utilities}. @end vtable @node Summary of Preference Variables, , Other Built-in Variables, Built-in Variables @section Summary of Preference Variables Here is a summary of all of Octave's preference variables and their default values. In the following table @code{OCTAVE_HOME} stands for the root directory where Octave is installed, and @code{VERSION} stands for the Octave version number. @smallexample EDITOR EDITOR environment variable, or "vi" INFO_FILE "OCTAVE_HOME/info/octave.info" LOADPATH OCTAVE_PATH environment variable, or ".:OCTAVE_HOME/lib/VERSION" PAGER "less", or "more" PS1 "\s:\#> " PS2 "> " automatic_replot "false" whitespace_in_literal_matrix "" do_fortran_indexing "false" empty_list_elements_ok "warn" gnuplot_binary "gnuplot" ignore_function_time_stamp "system" implicit_str_to_num_ok "false" ok_to_lose_imaginary_part "warn" output_max_field_width 10 output_precision 5 page_screen_output "true" prefer_column_vectors "false" prefer_zero_one_indexing "false" print_answer_id_name "true" print_empty_dimensions "true" resize_on_range_error "true" return_last_computed_value "false" save_precision 17 silent_functions "false" split_long_rows "true" treat_neg_dim_as_zero "false" warn_assign_as_truth_value "true" warn_comma_in_global_decl "true" warn_divide_by_zero "true" @end smallexample @c XXX FIXME XXX Might be nice to have a list of the settings required @c to have Octave behave as much like @sc{Matlab} as is possible. octave-1.1.0/doc/vr-idx.texi100666 415 17 355 5705073512 13777 0ustar jweusers@c Copyright (C) 1993, 1994, 1995 John W. Eaton @c This is part of the Octave manual. @c For copying conditions, see the file gpl.texi. @node Variable Index, Function Index, Concept Index, Top @unnumbered Variable Index @printindex vr octave-1.1.0/doc/liboctave.texi100666 415 17 273646 5702421131 14624 0ustar jweusers% Copyright (C) 1993, 1994, 1995 John W. Eaton % This is part of the Octave manual. % For copying conditions, see the file gpl.texi. \input texinfo @c -*-texinfo-*- @setfilename liboctave.info @c @smallbook @c @setchapternewpage odd @c @cropmarks @c @finalout @c Smaller amounts of whitespace for the 8.5 by 11 inch format. @tex \global\chapheadingskip = 15pt plus 4pt minus 2pt \global\secheadingskip = 12pt plus 3pt minus 2pt \global\subsecheadingskip = 9pt plus 2pt minus 2pt \global\parskip 6pt plus 1pt @end tex @iftex @set DONTINCLUDEGPL @end iftex @defindex op @include conf.texi c@settitle Octave C++ Classes @ifinfo Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. @ignore Permission is granted to process this file through Tex and print the results, provided the printed document carries copying permission notice identical to this one except for the removal of this paragraph (this paragraph not being relevant to the printed manual). @end ignore Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions. @end ifinfo @titlepage @title{Octave C++ Classes} @subtitle{Edition 1.0 for Octave version @value{VERSION}} @subtitle{September 1993} @author{John W. Eaton} @page @vskip 0pt plus 1filll Copyright @copyright{} 1993, 1994, 1995 John W. Eaton. This is the first edition of the documentation for Octave's C++ classes, and is consistent with version @value{VERSION} of Octave. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the same conditions as for modified versions. @end titlepage @ifinfo @node Top, Acknowledgements, (dir), (dir) @top This manual documents how to use, install and port Octave's C++ class library, and how to report bugs. It corresponds to Octave version @value{VERSION}. @end ifinfo @c ------------------------------------------------------------------------ @menu * Acknowledgements:: * Introduction:: * Arrays:: * Matrix and Vector @var{Operations}:: * Matrix Factorizations:: * Nonlinear Functions:: * Objective Functions:: * Bounds:: * Linear Constraints:: * Nonlinear Constraints:: * Nonlinear Equations:: * Ordinary Differential Equations:: * Differential Algebraic Equations:: * Quadrature:: * Quadratic Programming:: * Nonlinear Programming:: * Collocation Weights:: * Ranges:: * Installation:: * Bugs:: * Concept Index:: * Function Index:: @end menu @node Acknowledgements, Introduction, Top, Top @chapter Acknowledgements @cindex acknowledgements @menu * Contributors:: People who contributed to developing of Octave. @end menu @node Contributors, , Acknowledgements, Acknowledgements @unnumberedsec Contributors to Octave @cindex contributors In addition to John W. Eaton, several people have written parts of liboctave. @c Once lp_solve has been added, don't forget to include the lp_solve @c author, and Kantor, for providing an example. @itemize @bullet @item A. Scottedward Hodel (scotte@@eng.auburn.edu) contributed a number of functions including @code{expm}, @code{qzval}, @code{qzhess}, @code{syl}, @code{lyap}, and @code{balance}. @item R. Bruce Tenison (Bruce.Tenison@@eng.auburn.edu) wrote the @code{hess} and @code{schur} functions. @end itemize Special thanks to the following people and organizations for supporting the development of Octave: @itemize @bullet @item Digital Equipment Corporation, for an equipment grant as part of their External Research Program. @item Sun Microsystems, Inc., for an Academic Equipment grant. @item The University of Texas College of Engineering, for providing a Challenge for Excellence Research Supplement, and for providing an Academic Development Funds grant. @item Texaco Chemical Company, for providing funding to continue the development of this software. @item Noel Bell, Senior Engineer, Texaco Chemical Company, Austin Texas. @item James B. Rawlings, Associate Professor, Department of Chemical Engineering, The University of Texas at Austin. @end itemize Portions of this document have been adapted from the @code{gawk}, @code{readline}, @code{gcc}, and C library manuals, published by the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. This project would not have been possible without the GNU software used in and used to produce Octave. @c ------------------------------------------------------------------------ @node Introduction, Arrays, Acknowledgements, Top @chapter A Brief Introduction to Octave @cindex introduction This manual documents how to run, install and port Octave's C++ classes, and how to report bugs. @c ------------------------------------------------------------------------ @node Arrays, Matrix and Vector @var{Operations}, Introduction, Top @chapter Arrays @cindex arrays @menu * Constructors and Assignment:: @end menu @node Constructors and Assignment, , Arrays, Arrays @section Constructors and Assignment @deftypefn {} {}Array (void) @deftypefnx {} {}Array (int @var{n}) @deftypefnx {} {}Array (int @var{n}, const T &@var{val}) @deftypefnx {} {}Array (const Array &@var{a}) @end deftypefn @deftypefn {} Array& {operator =} (const Array &@var{a}) @end deftypefn @deftypefn {} int capacity (void) const @deftypefnx {} int length (void) const @end deftypefn @deftypefn {} T& elem (int @var{n}) @deftypefnx {} T& checkelem (int @var{n}) @deftypefnx {} T& {operator ()} (int @var{n}) @end deftypefn @c This needs to be fixed. @c @c T& xelem (int @var{n}) @c @c T elem (int @var{n}) const @c T checkelem (int @var{n}) const @c T operator () (int @var{n}) const @deftypefn {} void resize (int @var{n}) @deftypefnx {} void resize (int @var{n}, const T &@var{val}) @end deftypefn @deftypefn {} const T *data (void) const @end deftypefn @c Should this be public? @c @c T *fortran_vec (void) @deftypefn {} {}Array2 (void) @deftypefnx {} {}Array2 (int @var{n}, int @var{m}) @deftypefnx {} {}Array2 (int @var{n}, int @var{m}, const T &@var{val}) @deftypefnx {} {}Array2 (const Array2 &@var{a}) @deftypefnx {} {}Array2 (const DiagArray &@var{a}) @end deftypefn @deftypefn {} Array2& {operator =} (const Array2 &@var{a}) @end deftypefn @deftypefn {} int dim1 (void) const @deftypefnx {} int rows (void) const @end deftypefn @deftypefn {} int dim2 (void) const @deftypefnx {} int cols (void) const @deftypefnx {} int columns (void) const @end deftypefn @deftypefn {} T& elem (int @var{i}, int @var{j}) @deftypefnx {} T& checkelem (int @var{i}, int @var{j}) @deftypefnx {} T& {operator ()} (int @var{i}, int @var{j}) @end deftypefn @c This needs to be fixed. @c @c T& xelem (int i, int j) @c @c T elem (int i, int j) const @c T checkelem (int i, int j) const @c T operator () (int i, int j) const @deftypefn {} void resize (int @var{n}, int @var{m}) @deftypefnx {} void resize (int @var{n}, int @var{m}, const T &@var{val}) @end deftypefn @deftypefn {} Array3 (void) @deftypefnx {} Array3 (int @var{n}, int @var{m}, int @var{k}) @deftypefnx {} Array3 (int @var{n}, int @var{m}, int @var{k}, const T &@var{val}) @deftypefnx {} Array3 (const Array3 &@var{a}) @end deftypefn @deftypefn {} Array3& {operator =} (const Array3 &@var{a}) @end deftypefn @deftypefn {} int dim1 (void) const @deftypefnx {} int dim2 (void) const @deftypefnx {} int dim3 (void) const @end deftypefn @deftypefn {} T& elem (int @var{i}, int @var{j}, int @var{k}) @deftypefnx {} T& checkelem (int @var{i}, int @var{j}, int @var{k}) @deftypefnx {} T& {operator ()} (int @var{i}, int @var{j}, int @var{k}) @end deftypefn @c This needs to be fixed. @c @c T& xelem (int i, int j, int k) @c @c T elem (int i, int j, int k) const @c T checkelem (int i, int j, int k) const @c T operator () (int i, int j, int k) const @deftypefn {} void resize (int @var{n}, int @var{m}, int @var{k}) @deftypefnx {} void resize (int @var{n}, int @var{m}, int @var{k}, const T &@var{val}) @end deftypefn @deftypefn {} {}DiagArray (void) @deftypefnx {} {}DiagArray (int @var{n}) @deftypefnx {} {}DiagArray (int @var{n}, const T &@var{val}) @deftypefnx {} {}DiagArray (int @var{r}, int @var{c}) @deftypefnx {} {}DiagArray (int @var{r}, int @var{c}, const T &@var{val}) @deftypefnx {} {}DiagArray (const Array &@var{a}) @deftypefnx {} {}DiagArray (const DiagArray &@var{a}) @end deftypefn @deftypefn {} DiagArray& {operator =} (const DiagArray &@var{a}) @end deftypefn @deftypefn {} int dim1 (void) const @deftypefnx {} int rows (void) const @end deftypefn @deftypefn {} int dim2 (void) const @deftypefnx {} int cols (void) const @deftypefnx {} int columns (void) const @end deftypefn @deftypefn {} T& elem (int @var{r}, int @var{c}) @deftypefnx {} T& checkelem (int @var{r}, int @var{c}) @deftypefnx {} T& {operator ()} (int @var{r}, int @var{c}) @end deftypefn @c This needs to be fixed. @c @c T& xelem (int r, int c) @c @c T elem (int r, int c) const @c T checkelem (int r, int c) const @c T operator () (int r, int c) const @deftypefn {} void resize (int @var{n}, int @var{m}) @deftypefnx {} void resize (int @var{n}, int @var{m}, const T &@var{val}) @end deftypefn @c ------------------------------------------------------------------------ The real and complex @code{ColumnVector} and @code{RowVector} classes all have the following functions. These will eventually be part of an @code{MArray} class, derived from the @code{Array} class. Then the @code{ColumnVector} and @code{RowVector} classes will be derived from the @code{MArray} class. Element by element vector by scalar ops. @deftypefn {} {friend RowVector} {operator +} (const RowVector &@var{a}, const double &@var{s}) @deftypefnx {} {friend RowVector} {operator -} (const RowVector &@var{a}, const double &@var{s}) @deftypefnx {} {friend RowVector} {operator *} (const RowVector &@var{a}, const double &@var{s}) @deftypefnx {} {friend RowVector} {operator /} (const RowVector &@var{a}, const double &@var{s}) @end deftypefn Element by element scalar by vector ops. @deftypefn {} {friend RowVector} {operator +} (const double &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend RowVector} {operator -} (const double &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend RowVector} {operator *} (const double &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend RowVector} {operator /} (const double &@var{s}, const RowVector &@var{a}) @end deftypefn Element by element vector by vector ops. @deftypefn {} {friend RowVector} {operator +} (const RowVector &@var{a}, const RowVector &@var{b}) @deftypefnx {} {friend RowVector} {operator -} (const RowVector &@var{a}, const RowVector &@var{b}) @end deftypefn @deftypefn {} {friend RowVector} product (const RowVector &@var{a}, const RowVector &@var{b}) @deftypefnx {} {friend RowVector} quotient (const RowVector &@var{a}, const RowVector &@var{b}) @end deftypefn Unary MArray ops. @deftypefn {} {friend RowVector} {operator -} (const RowVector &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ The @code{Matrix} classes share the following functions. These will eventually be part of an @code{MArray2} class, derived from the @code{Array2} class. Then the @code{Matrix} class will be derived from the @code{MArray} class. Element by element matrix by scalar ops. @deftypefn {} {friend Matrix} {operator +} (const Matrix &@var{a}, const double &@var{s}) @deftypefnx {} {friend Matrix} {operator -} (const Matrix &@var{a}, const double &@var{s}) @deftypefnx {} {friend Matrix} {operator *} (const Matrix &@var{a}, const double &@var{s}) @deftypefnx {} {friend Matrix} {operator /} (const Matrix &@var{a}, const double &@var{s}) @end deftypefn Element by element scalar by matrix ops. @deftypefn {} {friend Matrix} {operator +} (const double &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend Matrix} {operator -} (const double &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend Matrix} {operator *} (const double &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend Matrix} {operator /} (const double &@var{s}, const Matrix &@var{a}) @end deftypefn Element by element matrix by matrix ops. @deftypefn {} {friend Matrix} {operator +} (const Matrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend Matrix} {operator -} (const Matrix &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend Matrix} product (const Matrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend Matrix} quotient (const Matrix &@var{a}, const Matrix &@var{b}) @end deftypefn Unary matrix ops. @deftypefn {} {friend Matrix} {operator -} (const Matrix &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ The @code{DiagMatrix} classes share the following functions. These will eventually be part of an @code{MDiagArray} class, derived from the @code{DiagArray} class. Then the @code{DiagMatrix} class will be derived from the @code{MDiagArray} class. Element by element MDiagArray by scalar ops. @deftypefn {} {friend DiagMatrix} {operator *} (const DiagMatrix &@var{a}, const double &@var{s}) @deftypefnx {} {friend DiagMatrix} {operator /} (const DiagMatrix &@var{a}, const double &@var{s}) @end deftypefn Element by element scalar by MDiagArray ops. @deftypefn {} {friend DiagMatrix} {operator *} (const double &@var{s}, const DiagMatrix &@var{a}) @end deftypefn Element by element MDiagArray by MDiagArray ops. @deftypefn {} {friend DiagMatrix} {operator +} (const DiagMatrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend DiagMatrix} {operator -} (const DiagMatrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend DiagMatrix} product (const DiagMatrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn Unary MDiagArray ops. @deftypefn {} {friend DiagMatrix} {operator -} (const DiagMatrix &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ @node Matrix and Vector @var{Operations}, Matrix Factorizations, Arrays, Top @chapter Matrix and Vector Operations @cindex matrix manipulations @cindex vector manipulations @deftypefn {} {}Matrix (void) @deftypefnx {} {}Matrix (int @var{r}, int @var{c}) @deftypefnx {} {}Matrix (int @var{r}, int @var{c}, double @var{val}) @deftypefnx {} {}Matrix (const Array2 &@var{a}) @deftypefnx {} {}Matrix (const Matrix &@var{a}) @deftypefnx {} {}Matrix (const DiagArray &@var{a}) @deftypefnx {} {}Matrix (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} Matrix& {operator =} (const Matrix &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const Matrix &@var{a}) const @deftypefnx {} int {operator !=} (const Matrix &@var{a}) const @end deftypefn @deftypefn {} Matrix& insert (const Matrix &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} Matrix& insert (const RowVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} Matrix& insert (const ColumnVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} Matrix& insert (const DiagMatrix &@var{a}, int @var{r}, int @var{c}) @end deftypefn @deftypefn {} Matrix& fill (double @var{val}) @deftypefnx {} Matrix& fill (double @var{val}, int r1, int c1, int r2, int c2) @end deftypefn @deftypefn {} Matrix append (const Matrix &@var{a}) const @deftypefnx {} Matrix append (const RowVector &@var{a}) const @deftypefnx {} Matrix append (const ColumnVector &@var{a}) const @deftypefnx {} Matrix append (const DiagMatrix &@var{a}) const @end deftypefn @deftypefn {} Matrix stack (const Matrix &@var{a}) const @deftypefnx {} Matrix stack (const RowVector &@var{a}) const @deftypefnx {} Matrix stack (const ColumnVector &@var{a}) const @deftypefnx {} Matrix stack (const DiagMatrix &@var{a}) const @end deftypefn @deftypefn {} Matrix transpose (void) const @end deftypefn @deftypefn {} Matrix extract (int r1, int c1, int r2, int c2) const @end deftypefn @deftypefn {} RowVector row (int @var{i}) const @deftypefnx {} RowVector row (char *s) const @end deftypefn @deftypefn {} ColumnVector column (int @var{i}) const @deftypefnx {} ColumnVector column (char *s) const @end deftypefn @deftypefn {} Matrix inverse (void) const @deftypefnx {} Matrix inverse (int &@var{info}) const @deftypefnx {} Matrix inverse (int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix fourier (void) const @deftypefnx {} ComplexMatrix ifourier (void) const @end deftypefn @deftypefn {} DET determinant (void) const @deftypefnx {} DET determinant (int &@var{info}) const @deftypefnx {} DET determinant (int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} Matrix solve (const Matrix &@var{b}) const @deftypefnx {} Matrix solve (const Matrix &@var{b}, int &@var{info}) const @deftypefnx {} Matrix solve (const Matrix &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix solve (const ComplexMatrix &@var{b}) const @deftypefnx {} ComplexMatrix solve (const ComplexMatrix &@var{b}, int &@var{info}) const @deftypefnx {} ComplexMatrix solve (const ComplexMatrix &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ColumnVector solve (const ColumnVector &@var{b}) const @deftypefnx {} ColumnVector solve (const ColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ColumnVector solve (const ColumnVector &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}) const @deftypefnx {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} Matrix lssolve (const Matrix &@var{b}) const @deftypefnx {} Matrix lssolve (const Matrix &@var{b}, int &@var{info}) const @deftypefnx {} Matrix lssolve (const Matrix &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}) const @deftypefnx {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}, int &@var{info}) const @deftypefnx {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} ColumnVector lssolve (const ColumnVector &@var{b}) const @deftypefnx {} ColumnVector lssolve (const ColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ColumnVector lssolve (const ColumnVector &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}) const @deftypefnx {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} Matrix& {operator +=} (const Matrix &@var{a}) @deftypefnx {} Matrix& {operator -=} (const Matrix &@var{a}) @end deftypefn @deftypefn {} Matrix& {operator +=} (const DiagMatrix &@var{a}) @deftypefnx {} Matrix& {operator -=} (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} Matrix {operator !} (void) const @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Matrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Matrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const Matrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexMatrix} {operator /} (const Matrix &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Complex &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Complex &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const Complex &@var{s}, const Matrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator /} (const Complex &@var{s}, const Matrix &@var{a}) @end deftypefn @deftypefn {} {friend ColumnVector} {operator *} (const Matrix &@var{a}, const ColumnVector &@var{b}) @deftypefnx {} {friend ComplexColumnVector} {operator *} (const Matrix &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend Matrix} {operator +} (const Matrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend Matrix} {operator -} (const Matrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend Matrix} {operator *} (const Matrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Matrix &@var{a}, const ComplexDiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Matrix &@var{a}, const ComplexDiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const Matrix &@var{a}, const ComplexDiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend Matrix} {operator *} (const Matrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const Matrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Matrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Matrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} product (const Matrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} quotient (const Matrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend Matrix} map (d_d_Mapper @var{f}, const Matrix &@var{a}) @deftypefnx {} void map (d_d_Mapper @var{f}) @end deftypefn @deftypefn {} Matrix all (void) const @deftypefnx {} Matrix any (void) const @end deftypefn @deftypefn {} Matrix cumprod (void) const @deftypefnx {} Matrix cumsum (void) const @deftypefnx {} Matrix prod (void) const @deftypefnx {} Matrix sum (void) const @deftypefnx {} Matrix sumsq (void) const @end deftypefn @deftypefn {} ColumnVector diag (void) const @deftypefnx {} ColumnVector diag (int @var{k}) const @end deftypefn @deftypefn {} ColumnVector row_min (void) const @deftypefnx {} ColumnVector row_min_loc (void) const @end deftypefn @deftypefn {} ColumnVector row_max (void) const @deftypefnx {} ColumnVector row_max_loc (void) const @end deftypefn @deftypefn {} RowVector column_min (void) const @deftypefnx {} RowVector column_min_loc (void) const @end deftypefn @deftypefn {} RowVector column_max (void) const @deftypefnx {} RowVector column_max_loc (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const Matrix &@var{a}) @deftypefnx {} {friend istream&} {operator >>} (istream &@var{is}, Matrix &@var{a}) @end deftypefn @deftypefn {} {}ColumnVector (void) @deftypefnx {} {}ColumnVector (int @var{n}) @deftypefnx {} {}ColumnVector (int @var{n}, double @var{val}) @deftypefnx {} {}ColumnVector (const Array &@var{a}) @deftypefnx {} {}ColumnVector (const ColumnVector &@var{a}) @end deftypefn @deftypefn {} ColumnVector& {operator =} (const ColumnVector &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const ColumnVector &@var{a}) const @deftypefnx {} int {operator !=} (const ColumnVector &@var{a}) const @end deftypefn @deftypefn {} ColumnVector& insert (const ColumnVector &@var{a}, int @var{r}) @end deftypefn @deftypefn {} ColumnVector& fill (double @var{val}) @deftypefnx {} ColumnVector& fill (double @var{val}, int r1, int r2) @end deftypefn @deftypefn {} ColumnVector stack (const ColumnVector &@var{a}) const @end deftypefn @deftypefn {} RowVector transpose (void) const @end deftypefn @deftypefn {} ColumnVector extract (int r1, int r2) const @end deftypefn @deftypefn {} ColumnVector& {operator +=} (const ColumnVector &@var{a}) @deftypefnx {} ColumnVector& {operator -=} (const ColumnVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (const ColumnVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator -} (const ColumnVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator *} (const ColumnVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator /} (const ColumnVector &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (const Complex &@var{s}, const ColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator -} (const Complex &@var{s}, const ColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator *} (const Complex &@var{s}, const ColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator /} (const Complex &@var{s}, const ColumnVector &@var{a}) @end deftypefn @deftypefn {} {friend Matrix} {operator *} (const ColumnVector &@var{a}, const RowVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator *} (const ColumnVector &@var{a}, const ComplexRowVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (const ComplexColumnVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator -} (const ComplexColumnVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} product (const ComplexColumnVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} quotient (const ComplexColumnVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ColumnVector} map (d_d_Mapper @var{f}, const ColumnVector &@var{a}) @deftypefnx {} void map (d_d_Mapper @var{f}) @end deftypefn @deftypefn {} double min (void) const @deftypefnx {} double max (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ColumnVector &@var{a}) @end deftypefn @deftypefn {} {}RowVector (void) @deftypefnx {} {}RowVector (int @var{n}) @deftypefnx {} {}RowVector (int @var{n}, double @var{val}) @deftypefnx {} {}RowVector (const Array &@var{a}) @deftypefnx {} {}RowVector (const RowVector &@var{a}) @end deftypefn @deftypefn {} RowVector& {operator =} (const RowVector &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const RowVector &@var{a}) const @deftypefnx {} int {operator !=} (const RowVector &@var{a}) const @end deftypefn @deftypefn {} RowVector& insert (const RowVector &@var{a}, int @var{c}) @end deftypefn @deftypefn {} RowVector& fill (double @var{val}) @deftypefnx {} RowVector& fill (double @var{val}, int c1, int c2) @end deftypefn @deftypefn {} RowVector append (const RowVector &@var{a}) const @end deftypefn @deftypefn {} ColumnVector transpose (void) const @end deftypefn @deftypefn {} RowVector extract (int c1, int c2) const @end deftypefn @deftypefn {} RowVector& {operator +=} (const RowVector &@var{a}) @deftypefnx {} RowVector& {operator -=} (const RowVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (const RowVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexRowVector} {operator -} (const RowVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexRowVector} {operator *} (const RowVector &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexRowVector} {operator /} (const RowVector &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (const Complex &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator -} (const Complex &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator *} (const Complex &@var{s}, const RowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator /} (const Complex &@var{s}, const RowVector &@var{a}) @end deftypefn @deftypefn {} {friend double} {operator *} (const RowVector &@var{a}, ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend Complex} {operator *} (const RowVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend RowVector} {operator *} (const RowVector &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator *} (const RowVector &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (const RowVector &@var{a}, const ComplexRowVector &@var{b}) @deftypefnx {} {friend ComplexRowVector} {operator -} (const RowVector &@var{a}, const ComplexRowVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} product (const RowVector &@var{a}, const ComplexRowVector &@var{b}) @deftypefnx {} {friend ComplexRowVector} quotient (const RowVector &@var{a}, const ComplexRowVector &@var{b}) @end deftypefn @deftypefn {} {friend RowVector} map (d_d_Mapper @var{f}, const RowVector &@var{a}) @deftypefnx {} void map (d_d_Mapper @var{f}) @end deftypefn @deftypefn {} double min (void) const @deftypefnx {} double max (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const RowVector &@var{a}) @end deftypefn @deftypefn {} {}DiagMatrix (void) @deftypefnx {} {}DiagMatrix (int @var{n}) @deftypefnx {} {}DiagMatrix (int @var{n}, double @var{val}) @deftypefnx {} {}DiagMatrix (int @var{r}, int @var{c}) @deftypefnx {} {}DiagMatrix (int @var{r}, int @var{c}, double @var{val}) @deftypefnx {} {}DiagMatrix (const RowVector &@var{a}) @deftypefnx {} {}DiagMatrix (const ColumnVector &@var{a}) @deftypefnx {} {}DiagMatrix (const DiagArray &@var{a}) @deftypefnx {} {}DiagMatrix (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} DiagMatrix& {operator =} (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const DiagMatrix &@var{a}) const @deftypefnx {} int {operator !=} (const DiagMatrix &@var{a}) const @end deftypefn @deftypefn {} DiagMatrix& fill (double @var{val}) @deftypefnx {} DiagMatrix& fill (double @var{val}, int @var{beg}, int @var{end}) @deftypefnx {} DiagMatrix& fill (const ColumnVector &@var{a}) @deftypefnx {} DiagMatrix& fill (const RowVector &@var{a}) @deftypefnx {} DiagMatrix& fill (const ColumnVector &@var{a}, int @var{beg}) @deftypefnx {} DiagMatrix& fill (const RowVector &@var{a}, int @var{beg}) @end deftypefn @deftypefn {} DiagMatrix transpose (void) const @end deftypefn @deftypefn {} Matrix extract (int r1, int c1, int r2, int c2) const @end deftypefn @deftypefn {} RowVector row (int @var{i}) const @deftypefnx {} RowVector row (char *s) const @end deftypefn @deftypefn {} ColumnVector column (int @var{i}) const @deftypefnx {} ColumnVector column (char *s) const @end deftypefn @deftypefn {} DiagMatrix inverse (void) const @deftypefnx {} DiagMatrix inverse (int &@var{info}) const @end deftypefn @deftypefn {} DiagMatrix& {operator +=} (const DiagMatrix &@var{a}) @deftypefnx {} DiagMatrix& {operator -=} (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend Matrix} {operator +} (const DiagMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend Matrix} {operator -} (const DiagMatrix &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const DiagMatrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const DiagMatrix &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator *} (const DiagMatrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexDiagMatrix} {operator /} (const DiagMatrix &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend Matrix} {operator +} (double @var{s}, const DiagMatrix &@var{a}) @deftypefnx {} {friend Matrix} {operator -} (double @var{s}, const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Complex &@var{s}, const DiagMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Complex &@var{s}, const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator *} (const Complex &@var{s}, const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ColumnVector} {operator *} (const DiagMatrix &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator *} (const DiagMatrix &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator +} (const DiagMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @deftypefnx {} {friend ComplexDiagMatrix} {operator -} (const DiagMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} product (const DiagMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend Matrix} {operator +} (const DiagMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend Matrix} {operator -} (const DiagMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend Matrix} {operator *} (const DiagMatrix &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const DiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const DiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const DiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} ColumnVector diag (void) const @deftypefnx {} ColumnVector diag (int @var{k}) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} {}ComplexMatrix (void) @deftypefnx {} {}ComplexMatrix (int @var{r}, int @var{c}) @deftypefnx {} {}ComplexMatrix (int @var{r}, int @var{c}, const Complex &@var{val}) @deftypefnx {} {}ComplexMatrix (const Matrix &@var{a}) @deftypefnx {} {}ComplexMatrix (const Array2 &@var{a}) @deftypefnx {} {}ComplexMatrix (const ComplexMatrix &@var{a}) @deftypefnx {} {}ComplexMatrix (const DiagMatrix &@var{a}) @deftypefnx {} {}ComplexMatrix (const DiagArray &@var{a}) @deftypefnx {} {}ComplexMatrix (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix& {operator =} (const ComplexMatrix &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const ComplexMatrix &@var{a}) const @deftypefnx {} int {operator !=} (const ComplexMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexMatrix& insert (const Matrix &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const RowVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const ColumnVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const DiagMatrix &@var{a}, int @var{r}, int @var{c}) @end deftypefn @deftypefn {} ComplexMatrix& insert (const ComplexMatrix &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const ComplexRowVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const ComplexColumnVector &@var{a}, int @var{r}, int @var{c}) @deftypefnx {} ComplexMatrix& insert (const ComplexDiagMatrix &@var{a}, int @var{r}, int @var{c}) @end deftypefn @deftypefn {} ComplexMatrix& fill (double @var{val}) @deftypefnx {} ComplexMatrix& fill (const Complex &@var{val}) @deftypefnx {} ComplexMatrix& fill (double @var{val}, int r1, int c1, int r2, int c2) @deftypefnx {} ComplexMatrix& fill (const Complex &@var{val}, int r1, int c1, int r2, int c2) @end deftypefn @deftypefn {} ComplexMatrix append (const Matrix &@var{a}) const @deftypefnx {} ComplexMatrix append (const RowVector &@var{a}) const @deftypefnx {} ComplexMatrix append (const ColumnVector &@var{a}) const @deftypefnx {} ComplexMatrix append (const DiagMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexMatrix append (const ComplexMatrix &@var{a}) const @deftypefnx {} ComplexMatrix append (const ComplexRowVector &@var{a}) const @deftypefnx {} ComplexMatrix append (const ComplexColumnVector &@var{a}) const @deftypefnx {} ComplexMatrix append (const ComplexDiagMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexMatrix stack (const Matrix &@var{a}) const @deftypefnx {} ComplexMatrix stack (const RowVector &@var{a}) const @deftypefnx {} ComplexMatrix stack (const ColumnVector &@var{a}) const @deftypefnx {} ComplexMatrix stack (const DiagMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexMatrix stack (const ComplexMatrix &@var{a}) const @deftypefnx {} ComplexMatrix stack (const ComplexRowVector &@var{a}) const @deftypefnx {} ComplexMatrix stack (const ComplexColumnVector &@var{a}) const @deftypefnx {} ComplexMatrix stack (const ComplexDiagMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexMatrix transpose (void) const @end deftypefn @deftypefn {} {friend Matrix} real (const ComplexMatrix &@var{a}) @deftypefnx {} {friend Matrix} imag (const ComplexMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} conj (const ComplexMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix extract (int r1, int c1, int r2, int c2) const @end deftypefn @deftypefn {} ComplexRowVector row (int @var{i}) const @deftypefnx {} ComplexRowVector row (char *s) const @end deftypefn @deftypefn {} ComplexColumnVector column (int @var{i}) const @deftypefnx {} ComplexColumnVector column (char *s) const @end deftypefn @deftypefn {} ComplexMatrix inverse (void) const @deftypefnx {} ComplexMatrix inverse (int &@var{info}) const @deftypefnx {} ComplexMatrix inverse (int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix fourier (void) const @deftypefnx {} ComplexMatrix ifourier (void) const @end deftypefn @deftypefn {} ComplexDET determinant (void) const @deftypefnx {} ComplexDET determinant (int &@var{info}) const @deftypefnx {} ComplexDET determinant (int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix solve (const Matrix &@var{b}) const @deftypefnx {} ComplexMatrix solve (const Matrix &@var{b}, int &@var{info}) const @deftypefnx {} ComplexMatrix solve (const Matrix &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix solve (const ComplexMatrix &@var{b}) const @deftypefnx {} ComplexMatrix solve (const ComplexMatrix &@var{b}, int &@var{info}) const @deftypefnx {} ComplexMatrix solve (const ComplexMatrix &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}) const @deftypefnx {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ComplexColumnVector solve (const ComplexColumnVector &@var{b}, int &@var{info}, double &@var{rcond}) const @end deftypefn @deftypefn {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}) const @deftypefnx {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}, int &@var{info}) const @deftypefnx {} ComplexMatrix lssolve (const ComplexMatrix &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}) const @deftypefnx {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}, int &@var{info}) const @deftypefnx {} ComplexColumnVector lssolve (const ComplexColumnVector &@var{b}, int &@var{info}, int &@var{rank}) const @end deftypefn @deftypefn {} ComplexMatrix& {operator +=} (const DiagMatrix &@var{a}) @deftypefnx {} ComplexMatrix& {operator -=} (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix& {operator +=} (const ComplexDiagMatrix &@var{a}) @deftypefnx {} ComplexMatrix& {operator -=} (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix& {operator +=} (const Matrix &@var{a}) @deftypefnx {} ComplexMatrix& {operator -=} (const Matrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix& {operator +=} (const ComplexMatrix &@var{a}) @deftypefnx {} ComplexMatrix& {operator -=} (const ComplexMatrix &@var{a}) @end deftypefn @deftypefn {} Matrix {operator !} (void) const @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexMatrix} {operator /} (const ComplexMatrix &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (double @var{s}, const ComplexMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator -} (double @var{s}, const ComplexMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator *} (double @var{s}, const ComplexMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator /} (double @var{s}, const ComplexMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator *} (const ComplexMatrix &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator *} (const ComplexMatrix &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexMatrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexMatrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexMatrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexMatrix &@var{a}, const ComplexDiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexMatrix &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator *} (const ComplexMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexMatrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} product (const ComplexMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} quotient (const ComplexMatrix &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} map (c_c_Mapper @var{f}, const ComplexMatrix &@var{a}) @deftypefnx {} {friend Matrix} map (d_c_Mapper @var{f}, const ComplexMatrix &@var{a}) @deftypefnx {} void map (c_c_Mapper @var{f}) @end deftypefn @deftypefn {} Matrix all (void) const @deftypefnx {} Matrix any (void) const @end deftypefn @deftypefn {} ComplexMatrix cumprod (void) const @deftypefnx {} ComplexMatrix cumsum (void) const @deftypefnx {} ComplexMatrix prod (void) const @deftypefnx {} ComplexMatrix sum (void) const @deftypefnx {} ComplexMatrix sumsq (void) const @end deftypefn @deftypefn {} ComplexColumnVector diag (void) const @deftypefnx {} ComplexColumnVector diag (int @var{k}) const @end deftypefn @deftypefn {} ComplexColumnVector row_min (void) const @deftypefnx {} ComplexColumnVector row_min_loc (void) const @end deftypefn @deftypefn {} ComplexColumnVector row_max (void) const @deftypefnx {} ComplexColumnVector row_max_loc (void) const @end deftypefn @deftypefn {} ComplexRowVector column_min (void) const @deftypefnx {} ComplexRowVector column_min_loc (void) const @end deftypefn @deftypefn {} ComplexRowVector column_max (void) const @deftypefnx {} ComplexRowVector column_max_loc (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexMatrix &@var{a}) @deftypefnx {} {friend istream&} {operator >>} (istream &@var{is}, ComplexMatrix &@var{a}) @end deftypefn @deftypefn {} {}ComplexColumnVector (void) @deftypefnx {} {}ComplexColumnVector (int @var{n}) @deftypefnx {} {}ComplexColumnVector (int @var{n}, const Complex &@var{val}) @deftypefnx {} {}ComplexColumnVector (const ColumnVector &@var{a}) @deftypefnx {} {}ComplexColumnVector (const Array &@var{a}) @deftypefnx {} {}ComplexColumnVector (const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} ComplexColumnVector& {operator =} (const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const ComplexColumnVector &@var{a}) const @deftypefnx {} int {operator !=} (const ComplexColumnVector &@var{a}) const @end deftypefn @deftypefn {} ComplexColumnVector& insert (const ColumnVector &@var{a}, int @var{r}) @deftypefnx {} ComplexColumnVector& insert (const ComplexColumnVector &@var{a}, int @var{r}) @end deftypefn @deftypefn {} ComplexColumnVector& fill (double @var{val}) @deftypefnx {} ComplexColumnVector& fill (const Complex &@var{val}) @deftypefnx {} ComplexColumnVector& fill (double @var{val}, int r1, int r2) @deftypefnx {} ComplexColumnVector& fill (const Complex &@var{val}, int r1, int r2) @end deftypefn @deftypefn {} ComplexColumnVector stack (const ColumnVector &@var{a}) const @deftypefnx {} ComplexColumnVector stack (const ComplexColumnVector &@var{a}) const @end deftypefn @deftypefn {} ComplexRowVector transpose (void) const @end deftypefn @deftypefn {} {friend ColumnVector} real (const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ColumnVector} imag (const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} conj (const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} ComplexColumnVector extract (int r1, int r2) const @end deftypefn @deftypefn {} ComplexColumnVector& {operator +=} (const ColumnVector &@var{a}) @deftypefnx {} ComplexColumnVector& {operator -=} (const ColumnVector &@var{a}) @end deftypefn @deftypefn {} ComplexColumnVector& {operator +=} (const ComplexColumnVector &@var{a}) @deftypefnx {} ComplexColumnVector& {operator -=} (const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (const ComplexColumnVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator -} (const ComplexColumnVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator *} (const ComplexColumnVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexColumnVector} {operator /} (const ComplexColumnVector &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (double @var{s}, const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator -} (double @var{s}, const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator *} (double @var{s}, const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ComplexColumnVector} {operator /} (double @var{s}, const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator *} (const ComplexColumnVector &@var{a}, const ComplexRowVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator +} (const ComplexColumnVector &@var{a}, const ColumnVector &@var{b}) @deftypefnx {} {friend ComplexColumnVector} {operator -} (const ComplexColumnVector &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} product (const ComplexColumnVector &@var{a}, const ColumnVector &@var{b}) @deftypefnx {} {friend ComplexColumnVector} quotient (const ComplexColumnVector &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} map (c_c_Mapper @var{f}, const ComplexColumnVector &@var{a}) @deftypefnx {} {friend ColumnVector} map (d_c_Mapper @var{f}, const ComplexColumnVector &@var{a}) @deftypefnx {} void map (c_c_Mapper @var{f}) @end deftypefn @deftypefn {} Complex min (void) const @deftypefnx {} Complex max (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexColumnVector &@var{a}) @end deftypefn @deftypefn {} {}ComplexRowVector (void) @deftypefnx {} {}ComplexRowVector (int @var{n}) @deftypefnx {} {}ComplexRowVector (int @var{n}, const Complex &@var{val}) @deftypefnx {} {}ComplexRowVector (const RowVector &@var{a}) @deftypefnx {} {}ComplexRowVector (const Array &@var{a}) @deftypefnx {} {}ComplexRowVector (const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} ComplexRowVector& {operator =} (const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const ComplexRowVector &@var{a}) const @deftypefnx {} int {operator !=} (const ComplexRowVector &@var{a}) const @end deftypefn @deftypefn {} ComplexRowVector& insert (const RowVector &@var{a}, int @var{c}) @deftypefnx {} ComplexRowVector& insert (const ComplexRowVector &@var{a}, int @var{c}) @end deftypefn @deftypefn {} ComplexRowVector& fill (double @var{val}) @deftypefnx {} ComplexRowVector& fill (const Complex &@var{val}) @deftypefnx {} ComplexRowVector& fill (double @var{val}, int c1, int c2) @deftypefnx {} ComplexRowVector& fill (const Complex &@var{val}, int c1, int c2) @end deftypefn @deftypefn {} ComplexRowVector append (const RowVector &@var{a}) const @deftypefnx {} ComplexRowVector append (const ComplexRowVector &@var{a}) const @end deftypefn @deftypefn {} ComplexColumnVector transpose (void) const @end deftypefn @deftypefn {} {friend RowVector} real (const ComplexRowVector &@var{a}) @deftypefnx {} {friend RowVector} imag (const ComplexRowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} conj (const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} ComplexRowVector extract (int c1, int c2) const @end deftypefn @deftypefn {} ComplexRowVector& {operator +=} (const RowVector &@var{a}) @deftypefnx {} ComplexRowVector& {operator -=} (const RowVector &@var{a}) @end deftypefn @deftypefn {} ComplexRowVector& {operator +=} (const ComplexRowVector &@var{a}) @deftypefnx {} ComplexRowVector& {operator -=} (const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (const ComplexRowVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexRowVector} {operator -} (const ComplexRowVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexRowVector} {operator *} (const ComplexRowVector &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexRowVector} {operator /} (const ComplexRowVector &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (double @var{s}, const ComplexRowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator -} (double @var{s}, const ComplexRowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator *} (double @var{s}, const ComplexRowVector &@var{a}) @deftypefnx {} {friend ComplexRowVector} {operator /} (double @var{s}, const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} {friend Complex} {operator *} (const ComplexRowVector &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend Complex} {operator *} (const ComplexRowVector &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator *} (const ComplexRowVector &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} {operator +} (const ComplexRowVector &@var{a}, const RowVector &@var{b}) @deftypefnx {} {friend ComplexRowVector} {operator -} (const ComplexRowVector &@var{a}, const RowVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} product (const ComplexRowVector &@var{a}, const RowVector &@var{b}) @deftypefnx {} {friend ComplexRowVector} quotient (const ComplexRowVector &@var{a}, const RowVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexRowVector} map (c_c_Mapper @var{f}, const ComplexRowVector &@var{a}) @deftypefnx {} {friend RowVector} map (d_c_Mapper @var{f}, const ComplexRowVector &@var{a}) @deftypefnx {} void map (c_c_Mapper @var{f}) @end deftypefn @deftypefn {} Complex min (void) const @deftypefnx {} Complex max (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexRowVector &@var{a}) @end deftypefn @deftypefn {} {}ComplexDiagMatrix (void) @deftypefnx {} {}ComplexDiagMatrix (int @var{n}) @deftypefnx {} {}ComplexDiagMatrix (int @var{n}, const Complex &@var{val}) @deftypefnx {} {}ComplexDiagMatrix (int @var{r}, int @var{c}) @deftypefnx {} {}ComplexDiagMatrix (int @var{r}, int @var{c}, const Complex &@var{val}) @deftypefnx {} {}ComplexDiagMatrix (const RowVector &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const ComplexRowVector &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const ColumnVector &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const ComplexColumnVector &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const DiagMatrix &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const DiagArray &@var{a}) @deftypefnx {} {}ComplexDiagMatrix (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexDiagMatrix& {operator =} (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} int {operator ==} (const ComplexDiagMatrix &@var{a}) const @deftypefnx {} int {operator !=} (const ComplexDiagMatrix &@var{a}) const @end deftypefn @deftypefn {} ComplexDiagMatrix& fill (double @var{val}) @deftypefnx {} ComplexDiagMatrix& fill (const Complex &@var{val}) @deftypefnx {} ComplexDiagMatrix& fill (double @var{val}, int @var{beg}, int @var{end}) @deftypefnx {} ComplexDiagMatrix& fill (const Complex &@var{val}, int @var{beg}, int @var{end}) @deftypefnx {} ComplexDiagMatrix& fill (const ColumnVector &@var{a}) @deftypefnx {} ComplexDiagMatrix& fill (const ComplexColumnVector &@var{a}) @deftypefnx {} ComplexDiagMatrix& fill (const RowVector &@var{a}) @deftypefnx {} ComplexDiagMatrix& fill (const ComplexRowVector &@var{a}) @deftypefnx {} ComplexDiagMatrix& fill (const ColumnVector &@var{a}, int @var{beg}) @deftypefnx {} ComplexDiagMatrix& fill (const ComplexColumnVector &@var{a}, int @var{beg}) @deftypefnx {} ComplexDiagMatrix& fill (const RowVector &@var{a}, int @var{beg}) @deftypefnx {} ComplexDiagMatrix& fill (const ComplexRowVector &@var{a}, int @var{beg}) @end deftypefn @deftypefn {} ComplexDiagMatrix transpose (void) const @end deftypefn @deftypefn {} {friend DiagMatrix} real (const ComplexDiagMatrix &@var{a}) @deftypefnx {} {friend DiagMatrix} imag (const ComplexDiagMatrix &@var{a}) @deftypefnx {} {friend ComplexDiagMatrix} conj (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix extract (int r1, int c1, int r2, int c2) const @end deftypefn @deftypefn {} ComplexRowVector row (int @var{i}) const @deftypefnx {} ComplexRowVector row (char *s) const @end deftypefn @deftypefn {} ComplexColumnVector column (int @var{i}) const @deftypefnx {} ComplexColumnVector column (char *s) const @end deftypefn @deftypefn {} ComplexDiagMatrix inverse (int &@var{info}) const @deftypefnx {} ComplexDiagMatrix inverse (void) const @end deftypefn @deftypefn {} ComplexDiagMatrix& {operator +=} (const DiagMatrix &@var{a}) @deftypefnx {} ComplexDiagMatrix& {operator -=} (const DiagMatrix &@var{a}) @end deftypefn @deftypefn {} ComplexDiagMatrix& {operator +=} (const ComplexDiagMatrix &@var{a}) @deftypefnx {} ComplexDiagMatrix& {operator -=} (const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexDiagMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexDiagMatrix &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexDiagMatrix &@var{a}, const Complex &@var{s}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexDiagMatrix &@var{a}, const Complex &@var{s}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator *} (const ComplexDiagMatrix &@var{a}, double @var{s}) @deftypefnx {} {friend ComplexDiagMatrix} {operator /} (const ComplexDiagMatrix &@var{a}, double @var{s}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (double @var{s}, const ComplexDiagMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator -} (double @var{s}, const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const Complex &@var{s}, const ComplexDiagMatrix &@var{a}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const Complex &@var{s}, const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator *} (double @var{s}, const ComplexDiagMatrix &@var{a}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator *} (const ComplexDiagMatrix &@var{a}, const ColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexColumnVector} {operator *} (const ComplexDiagMatrix &@var{a}, const ComplexColumnVector &@var{b}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} {operator +} (const ComplexDiagMatrix &@var{a}, const DiagMatrix &@var{b}) @deftypefnx {} {friend ComplexDiagMatrix} {operator -} (const ComplexDiagMatrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexDiagMatrix} product (const ComplexDiagMatrix &@var{a}, const DiagMatrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexDiagMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexDiagMatrix &@var{a}, const Matrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexDiagMatrix &@var{a}, const Matrix &@var{b}) @end deftypefn @deftypefn {} {friend ComplexMatrix} {operator +} (const ComplexDiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator -} (const ComplexDiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @deftypefnx {} {friend ComplexMatrix} {operator *} (const ComplexDiagMatrix &@var{a}, const ComplexMatrix &@var{b}) @end deftypefn @deftypefn {} ComplexColumnVector diag (void) const @deftypefnx {} ComplexColumnVector diag (int @var{k}) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexDiagMatrix &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ @node Matrix Factorizations, Nonlinear Functions, Matrix and Vector @var{Operations}, Top @chapter Matrix Factorizations @cindex matrix factorizations @cindex factorizations @deftypefn {} {}AEPBALANCE (void) @deftypefnx {} {}AEPBALANCE (const Matrix &@var{a}, const char *@var{balance_job}) @deftypefnx {} {}AEPBALANCE (const AEPBALANCE &@var{a}) @end deftypefn @deftypefn {} AEPBALANCE& {operator =} (const AEPBALANCE &@var{a}) @end deftypefn @deftypefn {} Matrix balanced_matrix (void) const @deftypefnx {} Matrix balancing_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const AEPBALANCE &@var{a}) @end deftypefn @deftypefn {} ComplexAEPBALANCE (void) @deftypefnx {} ComplexAEPBALANCE (const ComplexMatrix &@var{a}, const char *@var{balance_job}) @deftypefnx {} ComplexAEPBALANCE (const ComplexAEPBALANCE &@var{a}) @end deftypefn @deftypefn {} ComplexAEPBALANCE& {operator =} (const ComplexAEPBALANCE &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix balanced_matrix (void) const @deftypefnx {} ComplexMatrix balancing_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexAEPBALANCE &@var{a}) @end deftypefn @deftypefn {} {}DET (void) @deftypefnx {} {}DET (const DET &@var{a}) @end deftypefn @deftypefn {} DET& {operator =} (const DET &@var{a}) @end deftypefn @deftypefn {} int value_will_overflow (void) const @deftypefnx {} int value_will_underflow (void) const @end deftypefn @deftypefn {} double coefficient (void) const @deftypefnx {} int exponent (void) const @deftypefnx {} double value (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const DET &@var{a}) @end deftypefn @deftypefn {} {}ComplexDET (void) @deftypefnx {} {}ComplexDET (const ComplexDET &@var{a}) @end deftypefn @deftypefn {} ComplexDET& {operator =} (const ComplexDET &@var{a}) @end deftypefn @deftypefn {} int value_will_overflow (void) const @deftypefnx {} int value_will_underflow (void) const @end deftypefn @deftypefn {} Complex coefficient (void) const @deftypefnx {} int exponent (void) const @deftypefnx {} Complex value (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexDET &@var{a}) @end deftypefn @deftypefn {} {}GEPBALANCE (void) @deftypefnx {} {}GEPBALANCE (const Matrix &@var{a}, const Matrix &, const char *@var{balance_job}) @deftypefnx {} {}GEPBALANCE (const GEPBALANCE &@var{a}) @end deftypefn @deftypefn {} GEPBALANCE& {operator =} (const GEPBALANCE &@var{a}) @end deftypefn @deftypefn {} Matrix balanced_a_matrix (void) const @deftypefnx {} Matrix balanced_b_matrix (void) const @deftypefnx {} Matrix left_balancing_matrix (void) const @deftypefnx {} Matrix right_balancing_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const GEPBALANCE &@var{a}) @end deftypefn @deftypefn {} {}CHOL (void) @deftypefnx {} {}CHOL (const Matrix &@var{a}) @deftypefnx {} {}CHOL (const Matrix &@var{a}, int &@var{info}) @deftypefnx {} {}CHOL (const CHOL &@var{a}) @end deftypefn @deftypefn {} CHOL& {operator =} (const CHOL &@var{a}) @end deftypefn @deftypefn {} Matrix chol_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const CHOL &@var{a}) @end deftypefn @deftypefn {} {}ComplexCHOL (void) @deftypefnx {} {}ComplexCHOL (const ComplexMatrix &@var{a}) @deftypefnx {} {}ComplexCHOL (const ComplexMatrix &@var{a}, int &@var{info}) @deftypefnx {} {}ComplexCHOL (const ComplexCHOL &@var{a}) @end deftypefn @deftypefn {} ComplexCHOL& {operator =} (const ComplexCHOL &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix chol_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexCHOL &@var{a}) @end deftypefn @deftypefn {} {}HESS (void) @deftypefnx {} {}HESS (const Matrix &@var{a}) @deftypefnx {} {}HESS (const Matrix&a, int &@var{info}) @deftypefnx {} {}HESS (const HESS &@var{a}) @end deftypefn @deftypefn {} HESS& {operator =} (const HESS &@var{a}) @end deftypefn @deftypefn {} Matrix hess_matrix (void) const @deftypefnx {} Matrix unitary_hess_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const HESS &@var{a}) @end deftypefn @deftypefn {} {}ComplexHESS (void) @deftypefnx {} {}ComplexHESS (const ComplexMatrix &@var{a}) @deftypefnx {} {}ComplexHESS (const ComplexMatrix &@var{a}, int &@var{info}) @deftypefnx {} {}ComplexHESS (const ComplexHESS &@var{a}) @end deftypefn @deftypefn {} ComplexHESS& {operator =} (const ComplexHESS &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix hess_matrix (void) const @deftypefnx {} ComplexMatrix unitary_hess_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexHESS &@var{a}) @end deftypefn @deftypefn {} {}SCHUR (void) @deftypefnx {} {}SCHUR (const Matrix &@var{a}, const char *@var{ord}) @deftypefnx {} {}SCHUR (const Matrix &@var{a}, const char *@var{ord}, int &@var{info}) @deftypefnx {} {}SCHUR (const SCHUR &@var{a}, const char *@var{ord}) @end deftypefn @deftypefn {} SCHUR& {operator =} (const SCHUR &@var{a}) @end deftypefn @deftypefn {} Matrix schur_matrix (void) const @deftypefnx {} Matrix unitary_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const SCHUR &@var{a}) @end deftypefn @deftypefn {} {}ComplexSCHUR (void) @deftypefnx {} {}ComplexSCHUR (const ComplexMatrix &@var{a}, const char *@var{ord}) @deftypefnx {} {}ComplexSCHUR (const ComplexMatrix &@var{a}, const char *@var{ord}, int &@var{info}) @deftypefnx {} {}ComplexSCHUR (const ComplexSCHUR &@var{a}, const char *@var{ord}) @end deftypefn @deftypefn {} ComplexSCHUR& {operator =} (const ComplexSCHUR &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix schur_matrix (void) const @deftypefnx {} ComplexMatrix unitary_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexSCHUR &@var{a}) @end deftypefn @deftypefn {} {}SVD (void) @deftypefnx {} {}SVD (const Matrix &@var{a}) @deftypefnx {} {}SVD (const Matrix &@var{a}, int &@var{info}) @deftypefnx {} {}SVD (const SVD &@var{a}) @end deftypefn @deftypefn {} SVD& {operator =} (const SVD &@var{a}) @end deftypefn @deftypefn {} DiagMatrix singular_values (void) const @deftypefnx {} Matrix left_singular_matrix (void) const @deftypefnx {} Matrix right_singular_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const SVD &@var{a}) @end deftypefn @deftypefn {} {}ComplexSVD (void) @deftypefnx {} {}ComplexSVD (const ComplexMatrix &@var{a}) @deftypefnx {} {}ComplexSVD (const ComplexMatrix &@var{a}, int &@var{info}) @deftypefnx {} {}ComplexSVD (const ComplexSVD &@var{a}) @end deftypefn @deftypefn {} ComplexSVD& {operator =} (const ComplexSVD &@var{a}) @end deftypefn @deftypefn {} DiagMatrix singular_values (void) const @deftypefnx {} ComplexMatrix left_singular_matrix (void) const @deftypefnx {} ComplexMatrix right_singular_matrix (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexSVD &@var{a}) @end deftypefn @deftypefn {} {}EIG (void) @deftypefnx {} {}EIG (const Matrix &@var{a}) @deftypefnx {} {}EIG (const Matrix &@var{a}, int &@var{info}) @deftypefnx {} {}EIG (const ComplexMatrix &@var{a}) @deftypefnx {} {}EIG (const ComplexMatrix &@var{a}, int &@var{info}) @deftypefnx {} {}EIG (const EIG &@var{a}) @end deftypefn @deftypefn {} EIG& {operator =} (const EIG &@var{a}) @end deftypefn @deftypefn {} ComplexColumnVector eigenvalues (void) const @end deftypefn @deftypefn {} ComplexMatrix eigenvectors (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const EIG &@var{a}) @end deftypefn @deftypefn {} {}LU (void) @deftypefnx {} {}LU (const Matrix &@var{a}) @deftypefnx {} {}LU (const LU &@var{a}) @end deftypefn @deftypefn {} LU& {operator =} (const LU &@var{a}) @end deftypefn @deftypefn {} Matrix L (void) const @deftypefnx {} Matrix U (void) const @deftypefnx {} Matrix P (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const LU &@var{a}) @end deftypefn @deftypefn {} {}ComplexLU (void) @deftypefnx {} {}ComplexLU (const ComplexMatrix &@var{a}) @deftypefnx {} {}ComplexLU (const ComplexLU &@var{a}) @end deftypefn @deftypefn {} ComplexLU& {operator =} (const ComplexLU &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix L (void) const @deftypefnx {} ComplexMatrix U (void) const @deftypefnx {} Matrix P (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexLU &@var{a}) @end deftypefn @deftypefn {} {}QR (void) @deftypefnx {} {}QR (const Matrix &@var{A}) @deftypefnx {} {}QR (const QR &@var{a}) @end deftypefn @deftypefn {} QR& {operator =} (const QR &@var{a}) @end deftypefn @deftypefn {} Matrix Q (void) const @deftypefnx {} Matrix R (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const QR &@var{a}) @end deftypefn @deftypefn {} {}ComplexQR (void) @deftypefnx {} {}ComplexQR (const ComplexMatrix &@var{A}) @deftypefnx {} {}ComplexQR (const ComplexQR &@var{a}) @end deftypefn @deftypefn {} ComplexQR& {operator =} (const ComplexQR &@var{a}) @end deftypefn @deftypefn {} ComplexMatrix Q (void) const @deftypefnx {} ComplexMatrix R (void) const @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const ComplexQR &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ @node Nonlinear Functions, Objective Functions, Matrix Factorizations, Top @chapter Nonlinear Functions @cindex nonlinear functions @deftypefn {} {}NLFunc (void) @deftypefnx {} {}NLFunc (const @var{nonlinear_fcn}) @deftypefnx {} {}NLFunc (const @var{nonlinear_fcn}, const @var{jacobian_fcn}) @deftypefnx {} {}NLFunc (const NLFunc &@var{a}) @end deftypefn @deftypefn {} NLFunc& {operator =} (const NLFunc &@var{a}) @end deftypefn @deftypefn {} nonlinear_fcn function (void) const; @end deftypefn @deftypefn {} NLFunc& set_function (const nonlinear_fcn @var{f}) @end deftypefn @deftypefn {} jacobian_fcn jacobian_function (void) const; @end deftypefn @deftypefn {} NLFunc& set_jacobian_function (const jacobian_fcn @var{j}) @end deftypefn @c ------------------------------------------------------------------------ @node Objective Functions, Bounds, Nonlinear Functions, Top @chapter Objective Functions @cindex objective functions @deftypefn {} {}Objective (void) @deftypefnx {} {}Objective (const @var{objective_fcn}) @deftypefnx {} {}Objective (const @var{objective_fcn}, const @var{gradient_fcn}) @deftypefnx {} {}Objective (const Objective &@var{a}) @end deftypefn @deftypefn {} Objective& {operator =} (const Objective &@var{a}) @end deftypefn @deftypefn {} objective_fcn objective_function (void) const; @end deftypefn @deftypefn {} Objective& set_objective_function (const @var{objective_fcn}) @end deftypefn @deftypefn {} gradient_fcn gradient_function (void) const; @end deftypefn @deftypefn {} Objective& set_gradient_function (const @var{gradient_fcn}) @end deftypefn @c ------------------------------------------------------------------------ @node Bounds, Linear Constraints, Objective Functions, Top @chapter Bounds @cindex bounds @deftypefn {} {}Bounds (void) @deftypefnx {} {}Bounds (int @var{n}) @deftypefnx {} {}Bounds (const ColumnVector @var{lb}, const ColumnVector @var{ub}) @deftypefnx {} {}Bounds (const Bounds &@var{a}) @end deftypefn @deftypefn {} Bounds& {operator =} (const Bounds &@var{a}) @end deftypefn @deftypefn {} Bounds& resize (int @var{n}) @end deftypefn @deftypefn {} double lower_bound (int @var{index}) const; @deftypefnx {} double upper_bound (int @var{index}) const; @end deftypefn @deftypefn {} ColumnVector lower_bounds (void) const; @deftypefnx {} ColumnVector upper_bounds (void) const; @end deftypefn @deftypefn {} int size (void) const; @end deftypefn @deftypefn {} Bounds& set_bound (int @var{index}, double @var{low}, double @var{high}) @end deftypefn @deftypefn {} Bounds& set_bounds (double @var{low}, double @var{high}) @deftypefnx {} Bounds& set_bounds (const ColumnVector @var{lb}, const ColumnVector @var{ub}) @end deftypefn @deftypefn {} Bounds& set_lower_bound (int @var{index}, double @var{low}) @deftypefnx {} Bounds& set_upper_bound (int @var{index}, double @var{high}) @end deftypefn @deftypefn {} Bounds& set_lower_bounds (double @var{low}) @deftypefnx {} Bounds& set_upper_bounds (double @var{high}) @end deftypefn @deftypefn {} Bounds& set_lower_bounds (const ColumnVector @var{lb}) @deftypefnx {} Bounds& set_upper_bounds (const ColumnVector @var{ub}) @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const Bounds &@var{b}) @end deftypefn @c ------------------------------------------------------------------------ @node Linear Constraints, Nonlinear Constraints, Bounds, Top @chapter Linear Constraints @cindex linear Constraints @deftypefn {} {}LinConst (void) @deftypefnx {} {}LinConst (int @var{nclin}, int @var{nx}) @deftypefnx {} {}LinConst (int @var{nclin_eq}, int @var{nclin_ineq}, int @var{nx}) @deftypefnx {} {}LinConst (const ColumnVector &@var{lb}, const Matrix &@var{A}, const ColumnVector &@var{ub}) @deftypefnx {} {}LinConst (const Matrix &@var{A_eq}, const ColumnVector &@var{b_eq}, const Matrix &@var{A_ineq}, const ColumnVector &@var{b_ineq}) @deftypefnx {} {}LinConst (const LinConst &@var{a}) @end deftypefn @deftypefn {} LinConst& {operator =} (const LinConst &@var{a}) @end deftypefn @deftypefn {} LinConst& resize (int @var{nclin}, int @var{n}) @end deftypefn @deftypefn {} Matrix constraint_matrix (void) const; @end deftypefn @deftypefn {} LinConst& set_constraint_matrix (const Matrix &@var{A}) @end deftypefn @deftypefn {} Matrix eq_constraint_matrix (void) const; @deftypefnx {} Matrix ineq_constraint_matrix (void) const; @end deftypefn @deftypefn {} ColumnVector eq_constraint_vector (void) const; @deftypefnx {} ColumnVector ineq_constraint_vector (void) const; @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const LinConst &@var{b}) @end deftypefn @c ------------------------------------------------------------------------ @node Nonlinear Constraints, Nonlinear Equations, Linear Constraints, Top @chapter Nonlinear Constraints @cindex nonlinear Constraints @deftypefn {} {}NLConst (void) @deftypefnx {} {}NLConst (int @var{n}) @deftypefnx {} {}NLConst (const ColumnVector @var{lb}, const NLFunc @var{f}, const ColumnVector @var{ub}) @deftypefnx {} {}NLConst (const NLConst &@var{a}) @end deftypefn @deftypefn {} NLConst& {operator =} (const NLConst &@var{a}) @end deftypefn @c ------------------------------------------------------------------------ @node Nonlinear Equations, Ordinary Differential Equations, Nonlinear Constraints, Top @chapter Nonlinear Equations @cindex nonlinear equations @deftypefn {} {}NLEqn_options (void) @deftypefnx {} {}NLEqn_options (const NLEqn_options &@var{opt}) @end deftypefn @deftypefn {} NLEqn_options& {operator =} (const NLEqn_options &@var{opt}) @end deftypefn @deftypefn {} void init (void) @end deftypefn @deftypefn {} void copy (const NLEqn_options &@var{opt}) @end deftypefn @deftypefn {} void set_default_options (void) @end deftypefn @deftypefn {} void set_tolerance (double @var{val}) @end deftypefn @deftypefn {} double tolerance (void) @end deftypefn @deftypefn {} {}NLEqn (void) @deftypefnx {} {}NLEqn (const ColumnVector&, const @var{NLFunc}) @deftypefnx {} {}NLEqn (const NLEqn &@var{a}) @end deftypefn @deftypefn {} NLEqn& {operator =} (const NLEqn &@var{a}) @end deftypefn @deftypefn {} void resize (int @var{n}) @end deftypefn @deftypefn {} void set_states (const ColumnVector &@var{x}) @end deftypefn @deftypefn {} ColumnVector states (void) const @end deftypefn @deftypefn {} int size (void) const @end deftypefn @deftypefn {} ColumnVector solve (void) @deftypefnx {} ColumnVector solve (const ColumnVector &@var{x}) @end deftypefn @deftypefn {} ColumnVector solve (int &@var{info}) @deftypefnx{} ColumnVector solve (const ColumnVector &@var{x}, int &@var{info}) @end deftypefn @c ------------------------------------------------------------------------ @node Ordinary Differential Equations, Differential Algebraic Equations, Nonlinear Equations, Top @chapter Ordinary Differential Equations @cindex ODE @deftypefn {} {}ODE_options (void) @deftypefnx {} {}ODE_options (const ODE_options &@var{opt}) @end deftypefn @deftypefn {} ODE_options& {operator =} (const ODE_options &@var{opt}) @end deftypefn @deftypefn {} void init (void) @end deftypefn @deftypefn {} void copy (const ODE_options &@var{opt}) @end deftypefn @deftypefn {} void set_default_options (void) @end deftypefn @deftypefn {} void set_absolute_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_initial_step_size (double @var{val}) @end deftypefn @deftypefn {} void set_maximum_step_size (double @var{val}) @end deftypefn @deftypefn {} void set_minimum_step_size (double @var{val}) @end deftypefn @deftypefn {} void set_relative_tolerance (double @var{val}) @end deftypefn @deftypefn {} double absolute_tolerance (void) @deftypefnx {} double initial_step_size (void) @deftypefnx {} double maximum_step_size (void) @deftypefnx {} double minimum_step_size (void) @deftypefnx {} double relative_tolerance (void) @end deftypefn @deftypefn {} {}ODE (void) @deftypefnx {} {}ODE (int @var{n}) @deftypefnx {} {}ODE (const ColumnVector &@var{state}, double @var{time}, const ODEFunc &@var{f}) @end deftypefn @deftypefn {} {virtual int} size (void) const @end deftypefn @deftypefn {} {virtual ColumnVector} state (void) const @end deftypefn @deftypefn {} {virtual double} time (void) const @end deftypefn @deftypefn {} {virtual void} force_restart (void) @end deftypefn @deftypefn {} {virtual void} initialize (const ColumnVector &@var{x}, double @var{t}) @end deftypefn @deftypefn {} {virtual void} set_stop_time (double @var{t}) @end deftypefn @deftypefn {} {virtual void} clear_stop_time (void) @end deftypefn @deftypefn {} {virtual ColumnVector} integrate (double @var{t}) @end deftypefn @deftypefn {} void integrate (int @var{nsteps}, double @var{tstep}, ostream &@var{s}) @end deftypefn @deftypefn {} Matrix integrate (const ColumnVector &@var{tout}) @deftypefnx {} Matrix integrate (const ColumnVector &@var{tout}, const ColumnVector &@var{tcrit}) @end deftypefn @c ------------------------------------------------------------------------ @node Differential Algebraic Equations, Quadrature, Ordinary Differential Equations, Top @chapter Differential Algebraic Equations @cindex DAE @deftypefn {} {}DAE (void) @deftypefnx {} {}DAE (int @var{n}) @deftypefnx {} {}DAE (const ColumnVector &@var{x}, double @var{time}, DAEFunc &@var{f}) @deftypefnx {} {}DAE (const ColumnVector &@var{x}, ColumnVector &@var{xdot}, double @var{time}, DAEFunc &@var{f}) @end deftypefn @deftypefn {} ColumnVector deriv (void) @end deftypefn @deftypefn {} {virtual void} initialize (const ColumnVector &@var{x}, double @var{t}) @deftypefnx {} {virtual void} initialize (const ColumnVector &@var{x}, ColumnVector &@var{xdot}, double @var{t}) @end deftypefn @deftypefn {} ColumnVector integrate (double @var{t}) @end deftypefn @deftypefn {} Matrix integrate (const ColumnVector &@var{tout}, Matrix &@var{xdot_out}) @deftypefnx {} Matrix integrate (const ColumnVector &@var{tout}, Matrix &@var{xdot_out}, const ColumnVector &@var{tcrit}) @end deftypefn @c ------------------------------------------------------------------------ @node Quadrature, Quadratic Programming, Differential Algebraic Equations, Top @chapter Quadrature @cindex quadrature @cindex numerical integration @cindex integration @deftypefn {} {}Quad (integrand_fcn @var{fcn}) @deftypefnx {} {}Quad (integrand_fcn @var{fcn}, double @var{abs}, double @var{rel}) @end deftypefn @deftypefn {} {virtual double} integrate (void) @deftypefnx {} {virtual double} integrate (int &@var{ier}) @deftypefnx {} {virtual double} integrate (int &@var{ier}, int &@var{neval}) @deftypefnx {} {virtual double} integrate (int &@var{ier}, int &@var{neval}, double &@var{abserr}) = 0 @end deftypefn @deftypefn {} Quad_options (void) @deftypefnx {} Quad_options (const Quad_options &@var{opt}) @end deftypefn @deftypefn {} Quad_options& {operator =} (const Quad_options &@var{opt}) @end deftypefn @deftypefn {} void init (void) @end deftypefn @deftypefn {} void copy (const Quad_options &@var{opt}) @end deftypefn @deftypefn {} void set_default_options (void) @end deftypefn @deftypefn {} void set_absolute_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_relative_tolerance (double @var{val}) @end deftypefn @deftypefn {} double absolute_tolerance (void) @deftypefnx {} double relative_tolerance (void) @end deftypefn @deftypefn {} {}DefQuad (integrand_fcn @var{fcn}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, double @var{ll}, double @var{ul}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, double @var{ll}, double @var{ul}, double @var{abs}, double @var{rel}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, double @var{ll}, double @var{ul}, const ColumnVector &@var{sing}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, const ColumnVector &@var{sing}, double @var{abs}, double @var{rel}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, const ColumnVector &@var{sing}) @deftypefnx {} {}DefQuad (integrand_fcn @var{fcn}, double @var{ll}, double @var{ul}, const ColumnVector &@var{sing}, double @var{abs}, double @var{rel}) @end deftypefn @deftypefn {} {}IndefQuad (integrand_fcn @var{fcn}) @deftypefnx {} {}IndefQuad (integrand_fcn @var{fcn}, double @var{b}, IntegralType @var{t}) @deftypefnx {} {}IndefQuad (integrand_fcn @var{fcn}, double @var{b}, IntegralType @var{t}, double @var{abs}, double @var{rel}) @deftypefnx {} {}IndefQuad (integrand_fcn @var{fcn}, double @var{abs}, double @var{rel}) @end deftypefn @c ------------------------------------------------------------------------ @node Quadratic Programming, Nonlinear Programming, Quadrature, Top @chapter Quadratic Programming @cindex QP @cindex quadratic programming @deftypefn {} {}QP (void) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const Bounds &@var{b}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const LinConst &@var{lc}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const Bounds &@var{b}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const LinConst &@var{lc}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const Bounds &@var{b}, const LinConst &@var{lc}) @deftypefnx {} {}QP (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const Bounds &@var{b}, const LinConst &@var{lc}) @end deftypefn @deftypefn {} {virtual ColumnVector} minimize (void) @deftypefnx {} {virtual ColumnVector} minimize (double &@var{objf}) @deftypefnx {} {virtual ColumnVector} minimize (double &@var{objf}, int &@var{inform}) @deftypefnx {} {virtual ColumnVector} minimize (double &@var{objf}, int &@var{inform}, ColumnVector &@var{lambda}) = 0; @end deftypefn @deftypefn {} {virtual ColumnVector} minimize (const ColumnVector &@var{x}) @deftypefnx {} {virtual ColumnVector} minimize (const ColumnVector &@var{x}, double &@var{objf}) @deftypefnx {} {virtual ColumnVector} minimize (const ColumnVector &@var{x}, double &@var{objf}, int &@var{inform}) @deftypefnx {} {virtual ColumnVector} minimize (const ColumnVector &@var{x}, double &@var{objf}, int &@var{inform}, ColumnVector &@var{lambda}) @end deftypefn @deftypefn {} {}QPSOL_options (void) @deftypefnx {} {}QPSOL_options (const QPSOL_options &@var{opt}) @end deftypefn @deftypefn {} QPSOL_options& {operator =} (const QPSOL_options &@var{opt}) @end deftypefn @deftypefn {} void init (void) @end deftypefn @deftypefn {} void copy (const QPSOL_options &@var{opt}) @end deftypefn @deftypefn {} void set_default_options (void) @end deftypefn @deftypefn {} void set_feasibility_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_infinite_bound (double @var{val}) @end deftypefn @deftypefn {} void set_iteration_limit (int @var{val}) @end deftypefn @deftypefn {} void set_print_level (int @var{val}) @end deftypefn @deftypefn {} double feasibility_tolerance (void) @deftypefnx {} double infinite_bound (void) @deftypefnx {} int iteration_limit (void) @deftypefnx {} int print_level (void) @end deftypefn @deftypefn {} {}QPSOL (void) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const Bounds &@var{b}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const LinConst &@var{lc}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const Bounds &@var{b}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const LinConst &@var{lc}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const Bounds &@var{b}, const LinConst &@var{lc}) @deftypefnx {} {}QPSOL (const ColumnVector &@var{x}, const Matrix &@var{H}, const ColumnVector &@var{c}, const Bounds &@var{b}, const LinConst &@var{lc}) @deftypefnx {} {}QPSOL (const QPSOL &@var{a}) @end deftypefn @deftypefn {} QPSOL& {operator =} (const QPSOL &@var{a}) @end deftypefn @deftypefn {} ColumnVector minimize (double &@var{objf}, int &@var{inform}, ColumnVector &@var{lambda}) @end deftypefn @c ------------------------------------------------------------------------ @node Nonlinear Programming, Collocation Weights, Quadratic Programming, Top @chapter Nonlinear Programming @cindex NLP @cindex nonlinear programming @deftypefn {} {}NLP (void) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const LinConst &@var{lc}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const LinConst &@var{lc}, const NLConst &@var{nlc}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const LinConst &@var{lc}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const LinConst &@var{lc}, const NLConst &@var{nlc}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const NLConst &@var{nlc}) @deftypefnx {} {}NLP (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const NLConst &@var{nlc}) @end deftypefn @deftypefn {} NLP& {operator =} (const NLP &@var{a}) @end deftypefn @deftypefn {} int size (void) const @end deftypefn @deftypefn {} {}NPSOL_options (void) @deftypefnx {} {}NPSOL_options (const NPSOL_options &@var{opt}) @end deftypefn @deftypefn {} NPSOL_options& {operator =} (const NPSOL_options &@var{opt}) @end deftypefn @deftypefn {} void init (void) @deftypefnx {} void copy (const NPSOL_options &@var{opt}) @end deftypefn @deftypefn {} void set_default_options (void) @end deftypefn @deftypefn {} void set_central_difference_interval (double @var{val}) @end deftypefn @deftypefn {} void set_crash_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_difference_interval (double @var{val}) @end deftypefn @deftypefn {} void set_function_precision (double @var{val}) @end deftypefn @deftypefn {} void set_infinite_bound (double @var{val}) @end deftypefn @deftypefn {} void set_infinite_step (double @var{val}) @end deftypefn @deftypefn {} void set_linear_feasibility_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_linesearch_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_nonlinear_feasibility_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_optimality_tolerance (double @var{val}) @end deftypefn @deftypefn {} void set_derivative_level (int @var{val}) @end deftypefn @deftypefn {} void set_major_iteration_limit (int @var{val}) @end deftypefn @deftypefn {} void set_minor_iteration_limit (int @var{val}) @end deftypefn @deftypefn {} void set_major_print_level (int @var{val}) @end deftypefn @deftypefn {} void set_minor_print_level (int @var{val}) @end deftypefn @deftypefn {} void set_start_objective_check (int @var{val}) @end deftypefn @deftypefn {} void set_start_constraint_check (int @var{val}) @end deftypefn @deftypefn {} void set_stop_objective_check (int @var{val}) @end deftypefn @deftypefn {} void set_stop_constraint_check (int @var{val}) @end deftypefn @deftypefn {} void set_verify_level (int @var{val}) @end deftypefn @deftypefn {} double central_difference_interval (void) const @deftypefnx {} double crash_tolerance (void) const @deftypefnx {} double difference_interval (void) const @deftypefnx {} double function_precision (void) const @deftypefnx {} double infinite_bound (void) const @deftypefnx {} double infinite_step (void) const @deftypefnx {} double linear_feasibility_tolerance (void) const @deftypefnx {} double linesearch_tolerance (void) const @deftypefnx {} double nonlinear_feasibility_tolerance (void) const @deftypefnx {} double optimality_tolerance (void) const @deftypefnx {} int derivative_level (void) const @deftypefnx {} int major_iteration_limit (void) const @deftypefnx {} int minor_iteration_limit (void) const @deftypefnx {} int major_print_level (void) const @deftypefnx {} int minor_print_level (void) const @deftypefnx {} int start_objective_check (void) const @deftypefnx {} int start_constraint_check (void) const @deftypefnx {} int stop_objective_check (void) const @deftypefnx {} int stop_constraint_check (void) const @deftypefnx {} int verify_level (void) const @end deftypefn @deftypefn {} {}NPSOL (void) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const LinConst &@var{lc}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const LinConst &@var{lc}, const NLConst &@var{nlc}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const LinConst &@var{lc}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const LinConst &@var{lc}, const NLConst &@var{nlc}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const NLConst &@var{nlc}) @deftypefnx {} {}NPSOL (const ColumnVector &@var{x}, const Objective &@var{phi}, const Bounds &@var{b}, const NLConst &@var{nlc}) @deftypefnx {} {}NPSOL (const NPSOL &@var{a}) @end deftypefn @deftypefn {} ColumnVector minimize (void) @deftypefnx {} ColumnVector minimize (double &@var{objf}) @deftypefnx {} ColumnVector minimize (double &@var{objf}, int &@var{inform}) @deftypefnx {} ColumnVector minimize (double &@var{objf}, int &@var{inform}, ColumnVector &@var{lambda}) @end deftypefn @deftypefn {} ColumnVector minimize (const ColumnVector &@var{x}) @deftypefnx {} ColumnVector minimize (const ColumnVector &@var{x}, double &@var{objf}) @deftypefnx {} ColumnVector minimize (const ColumnVector &@var{x}, double &@var{objf}, int &@var{inform}) @deftypefnx {} ColumnVector minimize (const ColumnVector &@var{x}, double &@var{objf}, int &@var{inform}, ColumnVector &@var{lambda}) @end deftypefn @c ------------------------------------------------------------------------ @node Collocation Weights, Ranges, Nonlinear Programming, Top @chapter Collocation Weights @cindex orthogonal collocation @cindex collocation weights @deftypefn {} {}CollocWt (void) @deftypefnx {} {}CollocWt (int @var{n}, int @var{inc_l}, int @var{inc_r}) @deftypefnx {} {}CollocWt (int @var{n}, int @var{inc_l}, int @var{inc_r}, double @var{l}, double @var{r}) @deftypefnx {} {}CollocWt (int @var{n}, double @var{a}, double @var{b}, int @var{inc_l}, int @var{inc_r}) @deftypefnx {} {}CollocWt (int @var{n}, int @var{inc_l}, int @var{inc_r}, double @var{l}, double @var{r}) @deftypefnx {} {}CollocWt (const CollocWt&) @end deftypefn @deftypefn {} CollocWt& {operator =} (const CollocWt&) @end deftypefn @deftypefn {} CollocWt& resize (int @var{ncol}) @end deftypefn @deftypefn {} CollocWt& add_left (void) @deftypefnx {} CollocWt& add_right (void) @end deftypefn @deftypefn {} CollocWt& delete_left (void) @deftypefnx {} CollocWt& delete_right (void) @end deftypefn @deftypefn {} CollocWt& set_left (double @var{val}) @deftypefnx {} CollocWt& set_right (double @var{val}) @end deftypefn @deftypefn {} CollocWt& set_alpha (double @var{val}) @deftypefnx {} CollocWt& set_beta (double @var{val}) @end deftypefn @deftypefn {} int ncol (void) const @end deftypefn @deftypefn {} int left_included (void) const @deftypefnx {} int right_included (void) const @end deftypefn @deftypefn {} double left (void) const @deftypefnx {} double right (void) const @deftypefnx {} double width (void) const @end deftypefn @deftypefn {} double alpha (void) const @deftypefnx {} double beta (void) const @end deftypefn @deftypefn {} ColumnVector roots (void) @deftypefnx {} ColumnVector quad (void) @deftypefnx {} ColumnVector quad_weights (void) @end deftypefn @deftypefn {} Matrix first (void) @deftypefnx {} Matrix second (void) @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const CollocWt &@var{c}) @end deftypefn @c ------------------------------------------------------------------------ @node Ranges, Installation, Collocation Weights, Top @chapter Ranges @cindex ranges @deftypefn {} {}Range (void) @deftypefnx {} {}Range (const Range &@var{r}) @deftypefnx {} {}Range (double @var{b}, double @var{l}) @deftypefnx {} {}Range (double @var{b}, double @var{l}, double @var{i}) @end deftypefn @deftypefn {} double base (void) const @deftypefnx {} double limit (void) const @deftypefnx {} double inc (void) const @end deftypefn @deftypefn {} void set_base (double @var{b}) @deftypefnx {} void set_limit (double @var{l}) @deftypefnx {} void set_inc (double @var{i}) @end deftypefn @deftypefn {} int nelem (void) const @end deftypefn @deftypefn {} double min (void) const @deftypefnx {} double max (void) const @end deftypefn @deftypefn {} void sort (void) @end deftypefn @deftypefn {} {friend ostream&} {operator <<} (ostream &@var{os}, const Range &@var{r}) @deftypefnx {} {friend istream&} {operator >>} (istream &@var{is}, Range &@var{r}) @end deftypefn @deftypefn {} void print_range (void) @end deftypefn @c ------------------------------------------------------------------------ @node Installation, Bugs, Ranges, Top @chapter Installation @cindex installation @c ------------------------------------------------------------------------ @node Bugs, Concept Index, Installation, Top @chapter Bugs @cindex bugs, known @cindex installation trouble @cindex known causes of trouble @cindex troubleshooting @c ------------------------------------------------------------------------ @node Concept Index, Function Index, Bugs, Top @unnumbered Concept Index @printindex cp @c ------------------------------------------------------------------------ @node Function Index, , Concept Index, Top @unnumbered Function Index @printindex fn @contents @bye octave-1.1.0/doc/FAQ.texi100666 415 17 61524 5705307266 13250 0ustar jweusers\input texinfo.tex @c -*-texinfo-*- @setfilename FAQ.info @settitle Frequently asked questions about Octave (with answers) @c Smaller amounts of whitespace for the 8.5 by 11 inch format. @tex \global\chapheadingskip = 15pt plus 4pt minus 2pt \global\secheadingskip = 12pt plus 3pt minus 2pt \global\subsecheadingskip = 9pt plus 2pt minus 2pt \global\parskip 5pt plus 1pt @finalout @end tex @setchapternewpage off @titlepage @title Octave FAQ @subtitle Frequently asked questions about Octave @subtitle December 1, 1994 @sp 1 @author John W. Eaton @page @end titlepage @ifinfo @node Top, What is Octave?, (dir), (dir) @top @unnumbered Preface @cindex FAQ for Octave, latest version @end ifinfo This is a list of frequently asked questions (FAQ) for Octave users. Some information in this FAQ was developed for earlier versions of Octave and may now be obsolete. I'm looking for new questions (@emph{with} answers), better answers, or both. Please send suggestions to bug-octave@@che.utexas.edu. If you have general questions about Octave, or need help for something that is not covered by the FAQ, please use the help-octave@@che.utexas.edu mailing list. This FAQ is intended to supplement, not replace, the Octave manual. Before posting a question to the hlpe-octave mailing list, you should first check to see if the topic is covered in the manual. @menu * What is Octave?:: * Version 1.1.0:: * Octave Features:: * Documentation:: * Getting Octave:: * Installation:: * Getting additional help:: * Bug reports:: * @sc{Matlab} compatibility:: * Index:: @end menu @node What is Octave?, Version 1.1.0, Top, Top @chapter What is Octave? Octave is a high-level interactive language, primarily intended for numerical computations that is mostly compatible with @sc{Matlab}.@footnote{@sc{Matlab} is a registered trademark of The MathWorks, Inc.} Octave can do arithmetic for real and complex scalars and matrices, solve sets of nonlinear algebraic equations, integrate functions over finite and infinite intervals, and integrate systems of ordinary differential and differential-algebraic equations. Octave uses the GNU readline library to handle reading and editing input. By default, the line editing commands are similar to the cursor movement commands used by GNU Emacs, and a vi-style line editing interface is also available. At the end of each session, the command history is saved, so that commands entered during previous sessions are not lost. The Octave distribution includes a 200+ page Texinfo manual. Access to the complete text of the manual is available via the help command at the Octave prompt. Two and three dimensional plotting is fully supported using gnuplot. The underlying numerical solvers are currently standard Fortran ones like Lapack, Linpack, Odepack, the Blas, etc., packaged in a library of C++ classes. If possible, the Fortran subroutines are compiled with the system's Fortran compiler, and called directly from the C++ functions. If that's not possible, you can still compile Octave if you have the free Fortran to C translator f2c. Octave is also 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. @node Version 1.1.0, Octave Features, What is Octave?, Top @chapter What's new in version 1.1.0 of Octave The long-awaited version 1.1.0 of Octave has now been released. Many bugs have been fixed and lots of new features added. Octave is now much more compatible with @sc{Matlab}. Version 1.1.0 fixes many bugs, but as with any ``x.y.0'' release there will be a few glitches. You can expect a 1.1.1 shortly. You can help contribute to the quality of Octave by trying it out and submitting bug reports where you find them. A list of user-visible changes in recent versions of Octave may be found in the file NEWS, distributed in both source and binary releases of Octave. @node Octave Features, Documentation, Version 1.1.0, Top @chapter What features are unique to Octave? @menu * Command and variable name completion:: * Command history:: * Data structures:: * Short-circuit boolean operators:: * Increment and decrement operators:: * Unwind-protect:: * Variable-length argument lists:: * Variable-length return lists:: * Built-in ODE and DAE solvers:: @end menu @node Command and variable name completion, Command history, Octave Features, Octave Features @section Command and variable name completion @cindex Command completion @cindex Function name completion @cindex Variable name completion @cindex Name completion Typing a TAB character (ASCII code 9) on the command line causes Octave to attempt to complete variable, function, and file names. Octave uses the text before the cursor as the initial portion of the name to complete. For example, if you type @samp{fu} followed by TAB at the Octave prompt, Octave will complete the rest of the name @samp{function} on the command line (unless you have other variables or functions defined that begin with the characters @samp{fu}). If there is more than one possible completion, Octave will ring the terminal bell to let you know that your initial sequence of characters is not enough to specify a unique name. To complete the name, you may either edit the initial character sequence (usually adding more characters until completion is possible) or type another TAB to cause Octave to display the list of possible completions. @node Command history, Data structures, Command and variable name completion, Octave Features @section Command history @cindex Command history @cindex History When running interactively, Octave saves the commands you type in an internal buffer so that you can recall and edit them. Emacs and vi editing modes are available with Emacs keybindings enabled by default. When Octave exits, the current command history is saved to the file @file{~/.octave_hist}, and each time Octave starts, it inserts the contents of the @file{~/.octave_hist} file in the history list so that it is easy to begin working where you left off. @node Data structures, Short-circuit boolean operators, Command history, Octave Features @section Data structures @cindex Data structures @cindex Structures Octave includes a limited amount of support for organizing data in structures. The current implementation uses an associative array with indices limited to strings, but the syntax is more like C-style structures. Here are some examples of using data structures in Octave. @itemize @item Elements of structures can be of any value type. @example octave:1> x.a = 1; x.b = [1, 2; 3, 4]; x.c = "string"; octave:2> x.a x.a = 1 octave:3> x.b x.b = 1 2 3 4 octave:4> x.c x.c = string @end example @item Structures may be copied. @example octave:1> y = x y = @end example @item Structure elements may reference other structures. @example octave:1> x.b.d = 3 x.b.d = 3 octave:2> x.b x.b = octave:3> x.b.d x.b.d = 3 @end example @item Functions can return structures. @example octave:1> function y = f (x) > y.re = real (x); > y.im = imag (x); > endfunction octave:2> f (rand + rand*I); ans = octave:3> ans.im, ans.re ans.im = 0.93411 ans.re = 0.56234 @end example @item Function return lists can include structure elements, and they may be indexed like any other variable. @example octave:1> [x.u, x.s(2:3,2:3), x.v] = svd ([1, 2; 3, 4]) x.u = -0.40455 -0.91451 -0.91451 0.40455 x.s = 0.00000 0.00000 0.00000 0.00000 5.46499 0.00000 0.00000 0.00000 0.36597 x.v = -0.57605 0.81742 -0.81742 -0.57605 octave:8> x x = @end example @item You can also use the function @code{is_struct} to determine whether a given value is a data structure. For example @example is_struct (x) @end example @noindent returns 1 if the value of the variable @var{x} is a data structure. @end itemize This feature should be considered experimental, but you should expect it to work. Suggestions for ways to improve it are welcome. @node Short-circuit boolean operators, Increment and decrement operators, Data structures, Octave Features @section Short-circuit boolean operators @cindex Boolean operators, short-circuit @cindex Logical operators, short-circuit @cindex Short-circuit boolean operators @cindex Operators, boolean Octave's @samp{&&} and @samp{||} logical operators are evaluated in a short-circuit fashion (like the corresponding operators in the C language) and work differently than the element by element operators @samp{&} and @samp{|}. @node Increment and decrement operators, Unwind-protect, Short-circuit boolean operators, Octave Features @section Increment and decrement operators @cindex Increment operators @cindex Decrement operators @cindex Operators, increment @cindex Operators, decrement Octave includes the C-like increment and decrement operators @samp{++} and @samp{--} in both their prefix and postfix forms. For example, to pre-increment the variable @var{x}, you would write @code{++@var{x}}. This would add one to @var{x} and then return the new value of @var{x} as the result of the expression. It is exactly the same as the expression @code{@var{x} = @var{x} + 1}. To post-increment a variable @var{x}, you would write @code{@var{x}++}. This adds one to the variable @var{x}, but returns the value that @var{x} had prior to incrementing it. For example, if @var{x} is equal to 2, the result of the expression @code{@var{x}++} is 2, and the new value of @var{x} is 3. For matrix and vector arguments, the increment and decrement operators work on each element of the operand. It is not currently possible to increment index expressions. For example, you might expect that the expression @code{@var{v}(4)++} would increment the fourth element of the vector @var{v}, but instead it results in a parse error. This problem may be fixed in a future release of Octave. @node Unwind-protect, Variable-length argument lists, Increment and decrement operators, Octave Features @section Unwind-protect @cindex Unwind-protect Octave supports a limited form of exception handling modelled after the unwind-protect form of Lisp. The general form of an @code{unwind_protect} block looks like this: @example @group unwind_protect @var{body} unwind_protect_cleanup @var{cleanup} end_unwind_protect @end group @end example @noindent Where @var{body} and @var{cleanup} are both optional and may contain any Octave expressions or commands. The statements in @var{cleanup} are guaranteed to be executed regardless of how control exits @var{body}. The @code{unwind_protect} statement is often used to reliably restore the values of global variables that need to be temporarily changed. @node Variable-length argument lists, Variable-length return lists, Unwind-protect, Octave Features @section Variable-length argument lists @cindex Variable-length argument lists @cindex Argument lists, variable-length Octave has a real mechanism for handling functions that take an unspecified number of arguments, so it is no longer necessary to place an upper bound on the number of optional arguments that a function can accept. Here is an example of a function that uses the new syntax to print a header followed by an unspecified number of values: @example function foo (heading, ...) disp (heading); va_start (); while (--nargin) disp (va_arg ()); endwhile endfunction @end example Calling @code{va_start()} positions an internal pointer to the first unnamed argument and allows you to cycle through the arguments more than once. It is not necessary to call @code{va_start()} if you do not plan to cycle through the arguments more than once. The function @code{va_arg()} returns the value of the next available argument and moves the internal pointer to the next argument. It is an error to call @code{va_arg()} when there are no more arguments available. It is also possible to use the keyword @var{all_va_args} to pass all unnamed arguments to another function. @node Variable-length return lists, Built-in ODE and DAE solvers, Variable-length argument lists, Octave Features @section Variable-length return lists @cindex Variable-length return lists @cindex Return lists, variable-length Octave also has a real mechanism for handling functions that return an unspecified number of values, so it is no longer necessary to place an upper bound on the number of outputs that a function can produce. Here is an example of a function that uses the new syntax to produce @samp{N} values: @example function [...] = foo (n) for i = 1:n vr_val (i); endfor endfunction @end example @node Built-in ODE and DAE solvers, , Variable-length return lists, Octave Features @section Built-in ODE and DAE solvers @cindex DASSL @cindex LSODE Octave includes LSODE and DASSL for solving systems of stiff differential and differential-algebraic equations. These functions are built in to the interpreter. @node Documentation, Getting Octave, Octave Features, Top @chapter What documentation exists for Octave? @cindex Octave, documentation The Octave distribution includes a 220+ page manual that is also distributed under the terms of the GNU GPL. The Octave manual is intended to be a complete reference for Octave, but it is not a finished document. If you have problems using it, or find that some topic is not adequately explained, indexed, or cross-referenced, please send a bug report to bug-octave@@che.utexas.edu. Because the Octave manual is written using Texinfo, the complete text of the Octave manual is also available on line using the GNU Info system via the GNU Emacs, info, or xinfo programs, or by using the @samp{help -i} command to start the GNU info browser directly from the Octave prompt. It is also possible to use WWW browsers such as Mosaic to read the Octave manual (or any other Info file) by using Roar Smith's info2www program to convert GNU Info files to HTML. The source for info2www is available via anonymous ftp from ftp.che.utexas.edu in the directory @file{/pub/www}. @node Getting Octave, Installation, Documentation, Top @chapter Obtaining Source Code @cindex Source code @menu * Octave for Unix:: * Octave for other platforms:: * latest versions:: @end menu @node Octave for Unix, Octave for other platforms, Getting Octave, Getting Octave @section How do I get a copy of Octave for Unix? You can get Octave from a friend who has a copy, by anonymous FTP, or by ordering a tape or CD-ROM from the Free Software Foundation (FSF). @cindex Octave, ordering @cindex Octave, getting a copy Octave was not developed by the FSF, but the FSF does distribute Octave, and the developers of Octave support the efforts of the FSF by encouraging users of Octave to order Octave on tape or CD directly from the FSF. The FSF is a nonprofit organization that distributes software and manuals to raise funds for more GNU development. Buying a tape or CD from the FSF contributes directly to paying staff to develop GNU software. CD-ROMs cost $400 if an organization is buying, or $100 if an individual is buying. Tapes cost around $200 depending on media type. The FSF only makes new CD releases a few times a year, so if you are interested specifically in Octave, I recommend asking for the latest release on tape. @cindex FSF [Free Software Foundation] @cindex GNU [GNU's not unix] For more information about ordering from the FSF, contact gnu@@prep.ai.mit.edu, phone (617) 876-3296 or anonymous ftp file @file{/pub/gnu/GNUinfo/ORDERS} from prep.ai.mit.edu or one of the sites listed below. @cindex FSF, contact @cindex GNUware, anonymous FTP sites If you are on the Internet, you can copy the latest distribution version of Octave from the file @file{/pub/octave/octave-M.N.tar.gz}, on the host @file{ftp.che.utexas.edu}. This tar file has been compressed with GNU gzip, so be sure to use binary mode for the transfer. @samp{M} and @samp{N} stand for version numbers; look at a listing of the directory through ftp to see what version is available. After you unpack the distribution, be sure to look at the files @file{README} and @file{INSTALL}. Binaries for several popular systems are also available. If you would like help out by making binaries available for other systems, please contact bug-octave@@che.utexas.edu. A list of user-visible changes since the last release is available in the file @file{NEWS}. The file @file{ChangeLog} in the source distribution contains a more detailed record of changes made since the last release. @node Octave for other platforms, latest versions, Octave for Unix, Getting Octave @section How do I get a copy of Octave for (some other platform)? @cindex VMS support @cindex VAX @cindex MS-DOS support @cindex DJGPP @cindex EMX @cindex OS/2 support Octave currently runs on Unix-like systems only. It should be possible to make Octave work on other systems. If you are interested in porting Octave to other systems, please contact bug-octave@@che.utexas.edu. @node latest versions, , Octave for other platforms, Getting Octave @section What is the latest version of Octave @cindex Octave, version date The latest version of Octave is 1.1.0, released January 1995. @node Installation, Getting additional help, Getting Octave, Top @chapter Installation Issues and Problems @cindex Octave, building Octave requires approximately 50MB of disk storage to unpack and install (significantly less if you don't compile with debugging symbols). Octave has been compiled and tested with g++ and libg++ on a SPARCstation 2 running SunOS 4.1.2, an IBM RS/6000 running AIX 3.2.5, DEC Alpha systems running OSF/1 1.3 and 3.0, a DECstation 5000/240 running Ultrix 4.2a, and i486 systems running Linux. It should work on most other Unix systems that have a working port of g++ and libg++. @menu * What else do I need?:: * Other C++ compilers?:: @end menu @node What else do I need?, Other C++ compilers?, Installation, Installation @section What else do I need? @cindex GNU gcc @cindex GNU g++ @cindex libg++ @cindex GNU Make @cindex Flex @cindex GNU Bison In order to build Octave, you will need a current version of g++, libg++, and GNU make. If you don't have these tools, you can get them from many anonymous ftp archives, including ftp.che.utexas.edu, ftp.uu.net, prep.ai.mit.edu, and wuarchive.wustl.edu, or by writing to the FSF at 675 Mass Ave, Cambridge, MA 02139, USA. @node Other C++ compilers?, , What else do I need?, Installation @section Can I compile Octave with another C++ compiler? Currently, Octave can only be compiled with the GNU C++ compiler. It would be nice to make it possible to compile Octave with other C++ compilers, but the maintainers do not have sufficient time to devote to this. If you are interested in working to make Octave portable to other compilers, please contact bug-octave@@che.utexas.edu. @node Common problems @chapter Common problems This list is probably far too short. Feel free to suggest additional questions (preferably with answers!) @itemize @item Octave takes a long time to find symbols. Octave is probably spending this time recursively searching directories for function files. Check the value of your LOADPATH. For those elements that end in @samp{//}, do any name a very large directory tree? Does it contain directories that have a mixture of files and directories? In order for the recursive directory searching code to work efficiently, directories that are to be searched recursively should have either function files only, or subdirectories only, but not a mixture of both. Check to make sure that Octave's standard set of function files is installed this way. @end itemize @node Getting additional help, Bug reports, Installation, Top @chapter Getting additional help @cindex Additional help @cindex Mailing lists, help-octave The mailing list @example help-octave@@che.utexas.edu @end example @noindent is available for questions related to using, installing, and porting Octave that are not adequately answered by the Octave manual or by this document. If you would like to join the discussion and receive all messages sent to the list, please send a short note to @example help-octave-request@@che.utexas.edu ^^^^^^^ @end example @strong{Please do not} send requests to be added or removed from the the mailing list, or other administrative trivia to the list itself. An archive of old postings to the help-octave mailing list is maintained on ftp.che.utexas.edu in the directory @file{/pub/octave/MAILING-LISTS}. @node Bug reports, @sc{Matlab} compatibility, Getting additional help, Top @chapter I think I have found a bug in Octave. @cindex Bug in Octave, newly found ``I think I have found a bug in Octave, but I'm not sure. How do I know, and who should I tell?'' @cindex Manual, for Octave First, see the section on bugs and bug reports in the Octave manual. The Octave manual is included in the Octave distribution. When you report a bug, make sure to describe the type of computer you are using, the version of the operating system it is running, and the version of Octave that you are using. Also provide enough code so that the Octave maintainers can duplicate your bug. If you have Octave working at all, the easiest way to do this is to use the Octave function @code{bug_report}. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. @cindex Octave bug report @cindex Mailing lists, bug-octave If for some reason you cannot use Octave's @code{bug_report} function, mail your bug report to "bug-octave@@che.utexas.edu". Your message needs to include enough information to allow the maintainers of Octave to fix the bug. Please read the section on bugs and bug reports in the Octave manual for a list of things that should be included in every bug report. @node @sc{Matlab} compatibility, Index, Bug reports, Top @chapter Porting programs from @sc{Matlab} to Octave @cindex @sc{Matlab} compatibility @cindex Compatibility with @sc{Matlab} ``I have some @sc{Matlab} code, and I want to get it running under Octave. Is there anything I should watch out for?'' The differences between Octave and @sc{Matlab} typically fall into one of three categories: @enumerate @item Irrelevant. @item Known differences, perhaps configurable with a user preference variable. @item Unknown differences. @end enumerate The first category, irrelevant differences, do not affect computations and most likely do not affect the execution of function files. Some examples are: When typing @samp{help function}, Octave displays the first set of comment lines @emph{after} the function declaration, but @sc{Matlab} displays the first set of comment lines starting from the beginning of the file. The differences of the second category are usually because the authors of Octave decided on a better (subjective) implementation that the way @sc{Matlab} does it, and so introduced ``user preference variables'' so that you can customize Octave's behavior to be either @sc{Matlab}-compatible or to use Octave's new features. To make Octave more @sc{Matlab}-compatible, put the following statements in your @file{~/.octaverc} file. This is a partial list of the user preference variables that should be changed to get @sc{Matlab}-compatible behavior. (It is partial because not all the differences are currently known, and when they become known, this document lags behind.) @example do_fortran_indexing = 'true'; treat_neg_dim_as_zero = 'true'; empty_list_elements_ok = 'true'; implicit_str_to_num_ok = 'true'; whitespace_in_literal_matrix = 'traditional'; prefer_zero_one_indexing = 'true'; @end example Some other known differences are: @itemize @item String subscripting is not yet implemented in Octave. For example, @example a = 'reknob'; a([6,1,5,3,2,4]) @end example @noindent returns the string @samp{broken} in @sc{Matlab}, but generates an error in Octave. A future release of Octave will fix this along with providing a much more complete and powerful set of functions for manipulating strings. @item The Octave plotting functions are mostly compatible with the ones from @sc{Matlab} 3.x, but not from @sc{Matlab} 4.x. @item The C-style I/O functions are not completely compatible. It would be useful for someone to explore the differences so that they might be fixed, or at least noted in the manual. @end itemize The third category of differences is (hopefully) shrinking. If you find a difference between Octave behavior and @sc{Matlab}, then you should send a description of this difference (with code illustrating the difference, if possible) to bug-octave@@che.utexas.edu. An archive of old postings to the help-octave mailing list is maintained on ftp.che.utexas.edu in the directory @file{/pub/octave/MAILING-LISTS}. @node Index, , @sc{Matlab} compatibility, Top @appendix Concept Index @printindex cp @page @contents @bye octave-1.1.0/doc/octave.dvi100666 415 17 3036270 5705320114 13761 0ustar jweusers÷ƒ’À;è TeX output 1995.01.12:1532‹ÿÿÿÿŸòŽ ƒ3Ú þ#’§óUÂÖN ¼j cmbx12ëUOcta–ÿZv“eŽŸ‰ÕÁGŸ šª’±šEó2Kñ`y ó3 cmr10ÝA–¦fhigh-levš²!el“in˜teractiv˜e“language“for“n˜umerical“computationsŽ¤ ’+ÁŽEdition–¦f1.1“for“Octa•²!v“e›¦fv“ersion˜1.1.0Ž¡’•²ŠJan²!uary‘¦f1995Ž Ò¯óEÂÖN ff cmbx12ëEJohn–ffW.“EatonŽŸ‰ÕÁGŽŸŒ‹*ŸòŽ ƒ3Ú ÿtÝCop•²!yrigh“t‘±ž«‚cŽŽŽ‘¦fó:!",š ó3 cmsy10å ŽŽŽŽ‘@Ý1993,–¦f1994,“1995“John“W.“Eaton.Ž¤This–ýØis“the“ rst“edition“of“the“Octa•²!v“e›ýØdoMÞcumen“tation,‘Žand˜is˜consisten“t˜with˜v“ersion˜1.1.0˜of˜Octa“v“e.Ž¡Pš²!ermission–ú‡is“gran˜ted“to“mak˜e“and“distribute“v˜erbatim“copies“of“this“man˜ual“pro˜vided“the“cop˜yrigh˜tŽ©notice–¦fand“this“pMÞermission“notice“are“preserv²!ed“on“all“copies.Ž¡Pš²!ermission–\ùis“gran˜ted“to“cop˜y“and“distribute“moMÞdi ed“v˜ersions“of“this“man˜ual“under“the“conditionsŽ¦for–€vš²!erbatim“cop˜ying,‘!®pro˜vided“that“the“en˜tire“resulting“deriv˜ed“w˜ork“is“distributed“under“the“termsŽ¦of–¦fa“pMÞermission“notice“iden²!tical“to“this“one.Ž¡Pš²!ermission–³îis“gran˜ted“to“cop˜y“and“distribute“translations“of“this“man˜ual“in˜to“another“language,Ž¦under–¦fthe“same“conditions“as“for“moMÞdi ed“v²!ersions.ŽŽŸŒ‹–ŸòÝPreface’­H1ŽŽŽ ƒ3Ú ý¨ðÐó=ÂÖN G® cmbx12èPrefaceŽŽŸä‘ÝOcta•²!v“e›Äzw“as˜originally˜in“tended˜to˜bMÞe˜companion˜soft“w“are˜for˜an˜undergraduate-lev“el˜textb•MÞo“ok˜onŽ¤cš²!hemical–d¹reactor“design“bMÞeing“written“b˜y“James“B.“Ra˜wlings“and“John“G.“Ek˜erdt“at“the“Univ˜ersit˜yŽ¡of‘¦fT‘ÿeexas.Ž©‘Clearly‘ÿe,‘1ÙOcta•²!v“e–öis“noš²!w“m˜uc˜h“more“than“just“another“`coursew˜are'“pac˜k‘ÿdDage“with“limited“utiltiyŽ¡bšMÞey²!ond–Òõthe“classro˜om.‘c‰Although“our“initial“goals“wš²!ere“somewhat“v‘ÿdDague,‘Þw˜e“knew“that“w˜e“w˜an˜tedŽ¡to–1create“something“that“wš²!ould“enable“studen˜ts“to“solv˜e“realistic“problems,‘Hˆand“that“they“could“useŽ¡for–¦fmanš²!y“things“other“than“c˜hemical“reactor“design“problems.Ž¦‘There–íare“those“who“wš²!ould“sa˜y“that“w˜e“should“bMÞe“teac˜hing“the“studen˜ts“F‘ÿeortran“instead,‘,bMÞecauseŽ¡that–g€is“the“computer“language“of“engineering,‘tbut“evš²!ery“time“w˜e“ha˜v˜e“tried“that,‘tthe“studen˜ts“ha˜v˜eŽ¡spšMÞen²!t–ÍÈfar“to˜o“m•²!uc“h–ÍÈtime“trying“to“ gure“out“wh²!y“their“F‘ÿeortran“co˜de“crashes“and“not“enough“timeŽ¡learning–è´abMÞout“cš²!hemical“engineering.‘¤ÇWith“Octa˜v˜e,‘ùGmost“studen˜ts“pic˜k“up“the“basics“quic˜kly‘ÿe,‘ùGandŽ¡are–¦fusing“it“con den²!tly“in“just“a“few“hours.Ž¦‘Although–£\it“wš²!as“originally“in˜tended“to“bMÞe“used“to“teac˜h“reactor“design,‘£øit“is“also“curren˜tly“usedŽ¡in–bÝsevš²!eral“other“undergraduate“and“graduate“courses“in“our“departmen˜t,‘p_and“the“math“departmen˜tŽ¡at–the“Univ•²!ersit“y–of“T‘ÿeexas“has“bMÞeen“using“it“for“teacš²!hing“di eren˜tial“equations“and“linear“algebraŽ¡as–ĉwš²!ell.‘8GIf“y˜ou“ nd“it“useful,‘Ìplease“let“us“kno˜w.‘8GW‘ÿee“are“alw˜a˜ys“in˜terested“to“ nd“out“ho˜w“Octa˜v˜eŽ¡is–¦fbMÞeing“used“in“other“places.Ž¦‘Virtually›âev•²!ery“one˜thinks˜that˜the˜name˜Octa“v“e˜has˜something˜to˜do˜with˜m“usic,‘but˜it˜is˜ac-Ž¡tually–áÄthe“name“of“a“former“professor“of“mine“who“wrote“a“famous“textb•MÞo“ok–áÄon“c²!hemical“reactionŽ¡engineering,‘í}and–ßEwho“wš²!as“also“w˜ell“kno˜wn“for“his“abilit˜y“to“do“quic˜k“`bac˜k“of“the“en˜v˜elopMÞe'“calcu-Ž¡lations.‘Ö¯W‘ÿee–N¬hopšMÞe“that“this“soft•²!w“are–N¬will“mak²!e“it“p˜ossible“for“man²!y“p˜eople“to“do“more“am²!bitiousŽ¡computations–¦fjust“as“easily‘ÿe.Ž¦‘Ev•²!ery“one–ríis“encouraged“to“share“this“soft•²!w“are–ríwith“others“under“the“terms“of“the“GNU‘ràGeneralŽ¡Public–¦dLicense“(see‘LÈ[Cop²!ying],‘¦epage“8)“as“describšMÞed“at“the“b˜eginning“of“this“man²!ual.‘ÝÜY‘ÿeou“are“alsoŽ¡encouraged–ÙMto“help“makš²!e“Octa˜v˜e“more“useful“b˜y“writing“and“con˜tributing“additional“functions“forŽ¡it,–¦fand“bš²!y“repMÞorting“an˜y“problems“y˜ou“ma˜y“ha˜v˜e.Ž¦‘Manš²!y–9pMÞeople“ha˜v˜e“already“con˜tributed“to“Octa˜v˜e's“dev˜elopmen˜t.‘¹lIn“addition“to“John“W.“Eaton,Ž¡the–¦ffolloš²!wing“pMÞeople“ha˜v˜e“helpMÞed“write“parts“of“Octa˜v˜e“or“helpMÞed“out“in“v‘ÿdDarious“other“w˜a˜ys.Ž¦‘ú‘厑®dÝKarl–¬tBerry“(k‘ÿdDarló3ßêBy–1conš²!trast,‘äthe“GNU‘General“Public“License“is“in˜tended“to“guaran˜tee“y˜our“freedom“to“shareŽ¡and–Rcš²!hange“free“soft˜w˜are|to“mak˜e“sure“the“soft˜w˜are“is“free“for“all“its“users.‘ñ This“General“PublicŽ¡License–öjapplies“to“most“of“the“F›ÿeree“Soft•²!w“are–öjF˜oundation's“soft•²!w“are–öjand“to“an²!y“other“program“whoseŽ¡authors–8commit“to“using“it.‘°#(Some“other“F›ÿeree“Soft•²!w“are–8F˜oundation“soft•²!w“are–8is“co•²!v“ered›8b“y˜the˜GNUŽ¡Library–¦fGeneral“Public“License“instead.)‘ÝÝY‘ÿeou“can“apply“it“to“y²!our“programs,“toMÞo.Ž©—{‘When–‰wš²!e“spMÞeak“of“free“soft˜w˜are,‘Á°w˜e“are“referring“to“freedom,‘Á°not“price.‘…ÂOur“General“PublicŽ¡Licenses–ªÆare“designed“to“makš²!e“sure“that“y˜ou“ha˜v˜e“the“freedom“to“distribute“copies“of“free“soft˜w˜areŽ¡(and–бcš²!harge“for“this“service“if“y˜ou“wish),‘ÛDthat“y˜ou“receiv˜e“source“coMÞde“or“can“get“it“if“y˜ou“w˜an˜t“it,Ž¡that–²Æyš²!ou“can“c˜hange“the“soft˜w˜are“or“use“pieces“of“it“in“new“free“programs;‘¸öand“that“y˜ou“kno˜w“y˜ouŽ¡can–¦fdo“these“things.Ž¦‘T‘ÿeo–@Ìprotect“yš²!our“righ˜ts,‘Uw˜e“need“to“mak˜e“restrictions“that“forbid“an˜y˜one“to“den˜y“y˜ou“these“righ˜tsŽ¡or–Kªto“ask“yš²!ou“to“surrender“the“righ˜ts.‘¿ŸThese“restrictions“translate“to“certain“respMÞonsibilities“for“y˜ouŽ¡if–¦fyš²!ou“distribute“copies“of“the“soft˜w˜are,“or“if“y˜ou“moMÞdify“it.Ž¦‘F‘ÿeor–¼example,‘(Ñif“yš²!ou“distribute“copies“of“suc˜h“a“program,›(Ñwhether“gratis“or“for“a“fee,˜yš²!ou“m˜ustŽ¡givš²!e–®_the“recipien˜ts“all“the“righ˜ts“that“y˜ou“ha˜v˜e.‘õÇY‘ÿeou“m˜ust“mak˜e“sure“that“they‘ÿe,–°]toMÞo,“receiv˜e–®_or“canŽ¡get–¦fthe“source“coMÞde.‘ÝÝAnd“yš²!ou“m˜ust“sho˜w“them“these“terms“so“they“kno˜w“their“righ˜ts.Ž¦‘W‘ÿee–z protect“yš²!our“righ˜ts“with“t˜w˜o“steps:‘ǯ(1)“cop˜yrigh˜t“the“soft˜w˜are,‘‚éand“(2)“o er“y˜ou“this“licenseŽ¡whic•²!h›¦fgiv“es˜y“ou˜legal˜pMÞermission˜to˜cop“y‘ÿe,˜distribute˜and/or˜moMÞdify˜the˜soft“w“are.Ž¦‘Also,›Q!for–;Ïeac²!h“author's“protection“and“ours,˜wš²!e“w˜an˜t“to“mak˜e“certain“that“ev˜ery˜one“understandsŽ¡that–WÙthere“is“no“w•²!arran“t“y–WÙfor“this“free“soft•²!w“are.‘ò6If–WÙthe“soft•²!w“are–WÙis“moMÞdi ed“b²!y“someone“else“andŽ¡passed–Àfon,‘åwš²!e“w˜an˜t“its“recipien˜ts“to“kno˜w“that“what“they“ha˜v˜e“is“not“the“original,‘åso“that“an˜yŽ¡problems–¦finš²!troMÞduced“b˜y“others“will“not“re ect“on“the“original“authors'“reputations.Ž¦‘Finally‘ÿe,‘Nanš²!y–,øfree“program“is“threatened“constan˜tly“b˜y“soft˜w˜are“paten˜ts.‘q”W‘ÿee“wish“to“a˜v˜oid“theŽ¡danger–¸Öthat“redistributors“of“a“free“program“will“individually“obtain“paten²!t“licenses,‘èZin“e ect“makingŽ¡the–¯Zprogram“proprietary–ÿe.‘øºT“o›¯Zprev•²!en“t˜this,‘±—w“e˜ha“v“e˜made˜it˜clear˜that˜an“y˜paten“t˜m“ust˜bMÞe˜licensedŽ¡for›¦fev•²!ery“one's˜free˜use˜or˜not˜licensed˜at˜all.Ž¦‘The–¦fprecise“terms“and“conditions“for“copš²!ying,“distribution“and“moMÞdi cation“follo˜w.ŽŽŸŒ‹!ŸòÝ4’¯ 3Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðПñëETERMS–¦MAND“CONDITIONS“FŒÌOR“COPYING,“DISTRIBUTIONŽŸAND‘¦MMODIFICA‘þ¦fTIONŽŽŸ´¸‘ïæÝ0.Ž‘®dThis–ÌŸòÝ6’¯ 3Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБ®dwho›UPha•²!v“e˜receiv“ed˜copies,‘ or˜righ“ts,‘ from˜y“ou˜under˜this˜License˜will˜not˜ha“v“e˜their˜licensesŽ¤‘®dterminated–¦fso“long“as“suc²!h“parties“remain“in“full“compliance.Ž©&¾‘ïæ5.Ž‘®dY‘ÿeou–6¥are“not“required“to“accept“this“License,‘Z´since“yš²!ou“ha˜v˜e“not“signed“it.‘ŽšHo˜w˜ev˜er,‘Z´nothingŽ¡‘®delse–ºgranš²!ts“y˜ou“pšMÞermission“to“mo˜dify“or“distribute“the“Program“or“its“deriv‘ÿdDativš²!e“w˜orks.‘ÖNTheseŽ¡‘®dactions–XÈare“prohibited“bš²!y“la˜w“if“y˜ou“do“not“accept“this“License.‘õTherefore,‘…ab˜y“moMÞdifying“orŽ¡‘®ddistributing–æthe“Program“(or“anš²!y“w˜ork“based“on“the“Program),‘ö™y˜ou“indicate“y˜our“acceptanceŽ¡‘®dof–A©this“License“to“do“so,›UÏand“all“its“terms“and“conditions“for“cop²!ying,˜distributing“or“moMÞdifyingŽ¡‘®dthe–¦fProgram“or“w²!orks“based“on“it.Ž¦‘ïæ6.Ž‘®dEacš²!h–Vþtime“y˜ou“redistribute“the“Program“(or“an˜y“w˜ork“based“on“the“Program),‘ƒ$the“recipien˜tŽ¡‘®dautomatically–¾Óreceivš²!es“a“license“from“the“original“licensor“to“cop˜y‘ÿe,‘ídistribute“or“moMÞdify“theŽ¡‘®dProgram–à sub‘›»ject“to“these“terms“and“conditions.‘3ËY‘ÿeou“maš²!y“not“impMÞose“an˜y“further“restrictionsŽ¡‘®don–ú1the“recipienš²!ts'“exercise“of“the“righ˜ts“gran˜ted“herein.‘Ù?Y‘ÿeou“are“not“respMÞonsible“for“enforcingŽ¡‘®dcompliance–¦fb²!y“third“parties“to“this“License.Ž¦‘ïæ7.Ž‘®dIf,‘¹as–µWa“consequence“of“a“court“judgmenš²!t“or“allegation“of“paten˜t“infringemen˜t“or“for“an˜y“otherŽ¡‘®dreason–¢Œ(not“limited“to“patenš²!t“issues),‘£Rconditions“are“impMÞosed“on“y˜ou“(whether“b˜y“court“order,Ž¡‘®dagreemenš²!t–X¢or“otherwise)“that“con˜tradict“the“conditions“of“this“License,‘h/they“do“not“excuse“y˜ouŽ¡‘®dfrom–a]the“conditions“of“this“License.‘ÃIf“yš²!ou“cannot“distribute“so“as“to“satisfy“sim˜ultaneouslyŽ¡‘®dyš²!our–9obligations“under“this“License“and“an˜y“other“pMÞertinen˜t“obligations,‘Nãthen“as“a“consequenceŽ¡‘®dy•²!ou›§Tma“y˜not˜distribute˜the˜Program˜at˜all.‘à§F‘ÿeor˜example,‘§if˜a˜paten“t˜license˜w“ould˜not˜pMÞermitŽ¡‘®dro•²!y“alt“y-free–R¦redistribution“of“the“Program“bš²!y“all“those“who“receiv˜e“copies“directly“or“indirectlyŽ¡‘®dthrough–šåyš²!ou,‘2then“the“only“w˜a˜y“y˜ou“could“satisfy“bMÞoth“it“and“this“License“w˜ould“bMÞe“to“refrainŽ¡‘®den²!tirely–¦ffrom“distribution“of“the“Program.Ž¦‘®dIf–ÀÝ'“are“lines“y˜ou“t˜ypMÞe,‘ending“eac˜h“with“a“carriage“return.Ž¡Octa•²!v“e–¦fwill“respMÞond“with“an“answš²!er,“or“b˜y“displa˜ying“a“graph.ŽŸ ðõëECreating–¦Ma“MatrixŽŽŸ<=‘ÝT‘ÿeo–Ccreate“a“new“matrix“and“store“it“in“a“v‘ÿdDariable“so“that“it“yš²!ou“can“refer“to“it“later,‘=zt˜ypMÞe“theŽ¡commandŽŸ<=‘èUÞoctave:1>–¿ªa“=“[“1,“1,“2;“3,“5,“8;“13,“21,“34“]Ž¦ÝOcta•²!v“e–ÂÊwill“respMÞond“bš²!y“prin˜ting“the“matrix“in“neatly“aligned“columns.‘3 Ending“a“command“with“aŽ¡semicolon–¦ftells“Octa•²!v“e–¦fto“not“prin²!t“the“result“of“a“command.‘ÝÝF‘ÿeor“exampleŽŸ<=‘èUÞoctave:2>–¿ªb“=“rand“(3,“2);Ž¦Ýwill–6.create“a“3“roš²!w,‘Z 2“column“matrix“with“eac˜h“elemen˜t“set“to“a“random“v‘ÿdDalue“bMÞet˜w˜een“zero“andŽ¡one.ŽŽŸŒ‹ záŸòÝ12’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБT‘ÿeo–•Òdisplaš²!y“the“v‘ÿdDalue“of“an˜y“v‘ÿdDariable,‘Ñ­simply“t˜ypMÞe“the“name“of“the“v‘ÿdDariable.‘¬"F‘ÿeor“example,‘Ñ­toŽ¤displaš²!y–¦fthe“v‘ÿdDalue“stored“in“the“matrix“`ÞbÝ',“t˜ypMÞe“the“commandŽ©m‘èUÞoctave:3>‘¿ªbŽŸ I³ëEMatrix‘¦MArithmeticŽŽŸm‘ÝOcta•²!v“e–ßhas“a“con•²!v“enien“t–ßopšMÞerator“notation“for“p˜erforming“matrix“arithmetic.‘/IF‘ÿeor“example,‘2ýtoŽ¡mš²!ultiply–¦fthe“matrix“Þa“Ýb˜y“a“scalar“v‘ÿdDalue,“t˜ypMÞe“the“commandŽ¦‘èUÞoctave:4>–¿ª2“*“aŽ¤m‘ÝT‘ÿeo–¦fmš²!ultiply“the“t˜w˜o“matrices“áa“Ýand“ábÝ,“t˜ypMÞe“the“commandŽ¦‘èUÞoctave:5>–¿ªa“*“bŽ¡‘ÝT‘ÿeo–¦fform“the“matrix“prošMÞduct“ó9  b> ó3 cmmi10äaŸü¾ó 0e—rcmmi7´TŽ‘L¶äaÝ,“t²!yp˜e“the“commandŽ¦‘èUÞoctave:6>–¿ªa'“*“aŽŸ I³ëESolving–¦MLinear“EquationsŽŽŸm‘ÝT‘ÿeo–¦fsolv²!e“the“set“of“linear“equations“ó4Ò ž& ó3 cmb10ßAxŽ‘¾Ý=‘ §ßbÝ,“use“the“left“division“opMÞerator,“`Þ\Ý':Ž¦‘èUÞoctave:7>–¿ªa“\“bŽ¡ÝThis–¦fis“conceptually“equiv‘ÿdDalenš²!t“to“ßAŸü¾óO!â…cmsy7ºóÙ“ Rcmr7®1Ž‘ ¼tßbÝ,“but“a˜v˜oids“computing“the“in˜v˜erse“of“a“matrix“directly‘ÿe.Ž¡‘If–£üthe“coMÞecienš²!t“matrix“is“singular,‘׫Octa˜v˜e“will“prin˜t“a“w˜arning“message“and“compute“a“minim˜umŽ¤norm‘¦fsolution.ŽŸ I³ëEIn•ŒÌtegrating›¦MDi eren“tial˜EquationsŽŽŸm‘ÝOcta•²!v“e–¦fhas“built-in“functions“for“solving“nonlinear“di eren²!tial“equations“of“the“formŽŸ›^Ÿø—ž’”ñòädxŽ’”ñòŸÞȉfe õ"Ÿ t‘&ëdtŽŽŽŽ’¥$îÝ=– §äf‘-¼Ý(äx;‘Ó1tÝ)ä;‘¹›ÝwithŽ‘-HäxÝ(ät“Ý=“ätŸ¤z®0Ž‘|sÝ)“=“äxŸ¤z®0ŽŽŸ!§3ÝF‘ÿeor›ìZOcta•²!v“e˜to˜in“tegrate˜equations˜of˜this˜form,‘ý×y“ou˜m“ust˜ rst˜pro“vide˜a˜de nition˜of˜the˜functionŽ¡äf‘-¼Ý(äx;‘Ó1tÝ).‘ñòThis–mis“straigh•²!tforw“ard,‘oand›mma“y˜bMÞe˜accomplished˜b“y˜en“tering˜the˜function˜b•MÞo“dy˜directlyŽ¡on–3Ëthe“command“line.‘·©F‘ÿeor“example,‘J·the“folloš²!wing“commands“de ne“the“righ˜t“hand“side“function“forŽ¡an–Øinš²!teresting“pair“of“nonlinear“di eren˜tial“equations.‘ÑNote“that“while“y˜ou“are“en˜tering“a“function,Ž¡Octa•²!v“e–O‹respMÞonds“with“a“di erenš²!t“prompt,‘yÓto“indicate“that“it“is“w˜aiting“for“y˜ou“to“complete“y˜ourŽ¡input.Ž¦‘èUÞoctave:8>–¿ªfunction“xdot“=“f“(x,“t)Ž¤ ‘èU>Ž¡‘èU>‘ Tr–¿ª=“0.25;Ž¡‘èU>‘ Tk–¿ª=“1.4;Ž¡‘èU>‘ Ta–¿ª=“1.5;Ž¡‘èU>‘ Tb–¿ª=“0.16;ŽŽŸŒ‹ …ÙŸòÝChapter–¦f1:‘ÝÝA“Brief“Inš²!troMÞduction“to“Octa˜v˜e’ýÛv13ŽŽŽ ƒ3Ú ý¨ðБèUÞ>‘ Tc–¿ª=“0.9;Ž¤ ‘èU>‘ Td–¿ª=“0.8;Ž¡‘èU>Ž¡‘èU>‘ Txdot(1)–¿ª=“r*x(1)*(1“-“x(1)/k)“-“a*x(1)*x(2)/(1“+“b*x(1));Ž¡‘èU>‘ Txdot(2)–¿ª=“c*a*x(1)*x(2)/(1“+“b*x(1))“-“d*x(2);Ž¡‘èU>Ž¡‘èU>‘¿ªendfunctionŽ¤$-ÝGiv²!en–¦fthe“initial“conditionŽ©$-‘èUÞx0–¿ª=“[1;“2];Ž¡Ýand–‡>the“set“of“output“times“as“a“column“v²!ector“(note“that“the“ rst“output“time“correspMÞonds“to“theŽŸinitial–¦fcondition“givš²!en“abMÞo˜v˜e)Ž¦‘èUÞt–¿ª=“linspace“(0,“50,“200)';Ž¡Ýit–¦fis“easy“to“inš²!tegrate“the“set“of“di eren˜tial“equations:Ž¦‘èUÞx–¿ª=“lsode“("f",“x0,“t);Ž¡ÝThe–î®function“`ÞlsodeÝ'“uses“the“Livš²!ermore“Solv˜er“for“Ordinary“Di eren˜tial“Equations,‘ldescribMÞed“in“A.Ž¤C.–&Hindmarsh,‘3VáODEP‘ÿeAš²!CK,“a“Systematized“Collection“of“ODE‘ Solv˜ersÝ,‘3Vin:‘¿]Scien˜ti c“Computing,Ž¡R.–¦fS.“Stepleman“et“al.‘ÝÝ(Eds.),“North-Holland,“Amsterdam,“1983,“pages“55{64.ŽŸ$³ëEPros3ducing–¦MGraphical“OutputŽŽŸ$-‘ÝT›ÿeo–¦fdispla²!y“the“solution“of“the“previous“example“graphically˜,“use“the“commandŽ¦‘èUÞplot–¿ª(t,“x)ŽŸ$-‘ÝIf–¬qyš²!ou“are“using“the“X‘¬pWindo˜w“System,‘­ôOcta˜v˜e“will“automatically“create“a“separate“windo˜w“toŽ¡displaš²!y–(Tthe“plot.‘³×If“y˜ou“are“using“a“terminal“that“suppMÞorts“some“other“graphics“commands,‘A‹y˜ou“willŽ¡need–¦fto“tell“Octa•²!v“e–¦fwhat“kind“of“terminal“yš²!ou“ha˜v˜e.‘ÝÝT˜ypMÞe“the“commandŽ¦‘èUÞset‘¿ªtermŽ©$-Ýto–Ztsee“a“list“of“the“suppšMÞorted“terminal“t•²!yp˜es.‘úOcta“v“e–Ztuses“Þgnuplot“Ýto“displa²!y“graphics,‘‡wand“canŽ¡displaš²!y–¦fgraphics“on“an˜y“terminal“that“is“suppMÞorted“b˜y“ÞgnuplotÝ.Ž¦‘T‘ÿeo–‘¶capture“the“output“of“the“plot“command“in“a“ le“rather“than“sending“the“output“directly“toŽ¡yš²!our–¦fterminal,“y˜ou“can“use“a“set“of“commands“lik˜e“thisŽŸ%4‘èUÞset–¿ªterm“postscriptŽ¡‘èUset–¿ªoutput“"foo.ps"Ž¡‘èUreplotŽŽŸ1^×ÝThis–˜7will“wš²!ork“for“other“t˜ypMÞes“of“output“devices“as“w˜ell.‘³POcta˜v˜e's“`ÞsetÝ'“command“is“really“justŽ¡pipšMÞed–pto“the“Þgnuplot“Ýsubpro˜cess,‘¢jso“that“once“yš²!ou“ha˜v˜e“a“plot“on“the“screen“that“y˜ou“lik˜e,‘¢jy˜ouŽ¡should–“'bMÞe“able“to“do“something“likš²!e“this“to“create“an“output“ le“suitable“for“y˜our“graphics“prin˜ter.Ž¦‘Or,–¦fyš²!ou“can“eliminate“the“in˜termediate“ le“b˜y“using“commands“lik˜e“thisŽŽŸŒ‹bŸòÝ14’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞset–¿ªterm“postscriptŽ¤‘èUset–¿ªoutput“"|lpr“-Pname_of_your_graphics_printer"Ž¡‘èUreplotŽŽŸG¶<ëEEditing–¦MWhat“Y‘þ¦fou“Ha•ŒÌv“e‘¦MT“yps3edŽŽ©E‘ÝAš²!t–s«the“Octa˜v˜e“prompt,‘¦üy˜ou“can“recall,–¦üedit,“and–s«reissue“previous“commands“using“Emacs-“orŽ¤vi-stš²!yle–í]editing“commands.‘²ÂThe“default“k˜eybindings“use“Emacs-st˜yle“commands.‘²ÂF‘ÿeor“example,‘ÿtoŽ¡recall– óthe“previous“command,‘&—t²!ypMÞe“ÞControl-P“Ý(usually“written“ÞC-p“Ýfor“short).‘…ÞC-p“Ýgets“its“nameŽ¡from–ÆIthe“fact“that“yš²!ou“t˜ypMÞe“it“b˜y“holding“do˜wn“the“ÞCTRL“Ýk˜ey“and“then“pressing“ÞpÝ.‘=†Doing“this“willŽ¡normally–bring“bac²!k“the“previous“line“of“input.‘ÞÞC-n“Ýwill“bring“up“the“next“line“of“input,‘ |ÞC-b“ÝwillŽ¡mo•²!v“e–¦fthe“cursor“bac•²!kw“ard–¦fon“the“line,“ÞC-f“Ýwill“mo•²!v“e–¦fthe“cursor“forw²!ard“on“the“line,“etc.ŽŸE‘A‘9šcomplete–9Àdescription“of“the“command“line“editing“capabilitš²!y“is“giv˜en“in“this“man˜ual“in“Ap-Ž¡p•MÞendix›¦fApp“endix˜C˜[Command˜Line˜Editing],˜page˜173.ŽŸ)=ëEGetting‘¦MHelpŽŽ¦‘ÝOcta•²!v“e–Irhas“an“extensivš²!e“help“facilit˜y‘ÿe.‘¾áThe“same“doMÞcumen˜tation“that“is“a˜v‘ÿdDailable“in“prin˜ted“formŽ¡is–†ùalso“aš²!v‘ÿdDailable“from“the“Octa˜v˜e“prompt,‘¿bšMÞecause“b˜oth“forms“of“the“do˜cumen²!tation“are“createdŽ¡from–¦fthe“same“input“ le.Ž©E‘In–#½order“to“get“go•MÞo“d–#½help“yš²!ou“ rst“need“to“kno˜w“the“name“of“the“command“that“y˜ou“w˜an˜t“toŽ¡use.‘.^This–kæname“of“the“function“maš²!y“not“alw˜a˜ys“bMÞe“ob˜vious,‘Fbut“a“go•MÞo“d–kæplace“to“start“is“to“justŽ¡tš²!ypMÞe–δÞhelpÝ.‘VÇThis“will“sho˜w“y˜ou“all“the“opMÞerators,‘ØÈreserv˜ed“w˜ords,–ØÈfunctions,“built-in‘δv‘ÿdDariables,“andŽ¡function–tU les.‘Í-Y‘ÿeou“can“then“get“more“help“on“anš²!ything“that“is“listed“b˜y“simply“including“the“nameŽ¡as–¦fan“argumen²!t“to“help.‘ÝÝF‘ÿeor“example,ŽŸE‘èUÞhelp‘¿ªplotŽ¦Ýwill–¦fdispla²!y“the“help“text“for“the“Þplot“Ýfunction.Ž¦‘Octa•²!v“e–_ sends“output“that“is“toMÞo“long“to“ t“on“one“screen“through“a“pager“lik²!e“Þless“Ýor“ÞmoreÝ.Ž¡Tš²!ypMÞe–­Œa“carriage“return“to“adv‘ÿdDance“one“line,‘¯Va“space“c˜haracter“to“adv‘ÿdDance“one“page,‘¯Vand“`ÞqÝ'“to“exitŽ¡the‘¦fpager.ŽŸ)=ëEHelp–¦Mvia“InfoŽŽŸE‘ÝThe–Ã#part“of“Octa•²!v“e's–Ã#help“facilitš²!y“that“allo˜ws“y˜ou“to“read“the“complete“text“of“the“prin˜ted“man˜ualŽ¡from–s¡within“Octa•²!v“e–s¡uses“a“program“called“Info.‘ÌñWhen“yš²!ou“in˜v˜ok˜e“Info“y˜ou“will“bMÞe“put“in˜to“a“men˜uŽ¡drivš²!en–™'program“that“con˜tains“the“en˜tire“Octa˜v˜e“man˜ual.‘¶ Help“for“using“Info“is“pro˜vided“in“thisŽ¡man²!ual–¦fin“AppšMÞendix“App˜endix“D“[Using“Info],“page“183.ŽŽŸŒ‹˜ñŸòÝChapter–¦f1:‘ÝÝA“Brief“Inš²!troMÞduction“to“Octa˜v˜e’ýÛv15ŽŽŽ ƒ3Ú ý¨ðÐëE1.3‘™Executable›¦MOcta•ŒÌv“e˜ProgramsŽŽŸt9‘ÝOnce–Ö¤yš²!ou“ha˜v˜e“learned“Octa˜v˜e,‘â´y˜ou“ma˜y“w˜an˜t“to“write“self-con˜tained“Octa˜v˜e“scripts,‘â´using“theŽŸ`Þ#!Ý'–¦fscript“mecš²!hanism.‘ÝÝY‘ÿeou“can“do“this“on“man˜y“Unix“systemsŸü¾®1Ž‘"ÙÝ(and“someda˜y“on“GNU).Ž¤t9‘F‘ÿeor–¦fexample,“yš²!ou“could“create“a“text“ le“named“`ÞhelloÝ',“con˜taining“the“follo˜wing“lines:Ž©t9‘èUÞ#!–¿ª/usr/local/bin/octave“-qfŽŸ‘èU#–¿ªa“sample“Octave“programŽŸ ‘èUprintf–¿ª("Hello,“world!\n");Ž¡ÝAfter–¦fmaking“this“ le“executable“(with“the“Þchmod“Ýcommand),“yš²!ou“can“simply“t˜ypMÞe:Ž¦‘èUÞhelloŽ¡Ýat–¦fthe“shell,“and“the“system“will“arrange“to“run“Octa•²!v“eŸü¾®2Ž‘"ÙÝas–¦fif“yš²!ou“had“t˜ypMÞed:Ž¦‘èUÞoctave‘¿ªhelloŽ¡ÝSelf-con•²!tained›‹fOcta“v“e˜scripts˜are˜useful˜when˜y“ou˜w“an“t˜to˜write˜a˜program˜whic“h˜users˜can˜in“v“ok“eŽ¤without–¦fknoš²!wing“that“the“program“is“written“in“the“Octa˜v˜e“language.ŽŸ!ÐåëE1.4‘™CommenšŒÌts–¦Min“Octa˜v˜e“ProgramsŽŽŸt9‘ÝA‘ Yácommenš²!t‘HÝis– some“text“that“is“included“in“a“program“for“the“sak˜e“of“h˜uman“readers,‘*{and“that“isŽ¡not–³žreally“part“of“the“program.‘†Commenš²!ts“can“explain“what“the“program“doMÞes,‘¶ìand“ho˜w“it“w˜orks.Ž¡Nearly–,ªall“programming“languages“ha•²!v“e›,ªpro“visions˜for˜commen“ts,‘N;bMÞecause˜programs˜are˜t“ypicallyŽ¡hard–¦fto“understand“without“them.ŽŸt9‘In–·(the“Octa•²!v“e–·(language,‘ça“commenš²!t“starts“with“either“the“sharp“sign“c˜haracter,–ç`Þ#Ý',“or–·(the“pMÞercen˜tŽ¡symš²!bMÞol–K`Þ%Ý'“and“con˜tin˜ues“to“the“end“of“the“line.‘ŒThe“Octa˜v˜e“in˜terpreter“ignores“the“rest“of“a“lineŽ¡folloš²!wing–%÷a“sharp“sign“or“pMÞercen˜t“sym˜bMÞol.‘\‘F‘ÿeor“example,‘EÜw˜e“could“ha˜v˜e“put“the“follo˜wing“in˜to“theŽ¡function‘¦fÞfÝ:Ž¦‘èUÞfunction–¿ªxdot“=“f“(x,“t)ŽŸ‘èU#–¿ªusage:“f“(x,“t)ŽŸ ¦:‰ffŠ=Ÿ 9•‘ óŸü¾®1ŽŽ‘ÝThe–û`Þ#!Ý'“mecš²!hanism“w˜orks“on“Unix“systems“deriv˜ed“from“Berk˜eley“Unix,‘+System“V‘úîRelease“4,Ž¡‘and–¦fsome“System“V“Release“3“systems.Ž¡‘ óŸü¾®2ŽŽ‘ÝThe–’¤line“bšMÞeginning“with“`Þ#!Ý'“lists“the“full“ le“name“of“an“in²!terpreter“to“b˜e“run,‘–˜and“an“optionalŽ¡‘initial–€Wcommand“line“argumenš²!t“to“pass“to“that“in˜terpreter.‘Ñ-The“opMÞerating“system“then“runs“theŽ¡‘inš²!terpreter–/with“the“giv˜en“argumen˜t“and“the“full“argumen˜t“list“of“the“executed“program.‘yWTheŽ¡‘ rst–¬ôargumenš²!t“in“the“list“is“the“full“ le“name“of“the“Octa˜v˜e“program.‘ñ‡The“rest“of“the“argumen˜tŽ¡‘list–åÔwill“either“bMÞe“options“to“Octa•²!v“e,›õ¯or–åÔdata“ les,˜or“bšMÞoth.‘œ&The“Þ-qf“Ýoption“is“usually“sp˜eci edŽ¡‘in–ÙÝstand-alone“Octa•²!v“e–ÙÝprograms“to“prev•²!en“t–ÙÝthem“from“prin²!ting“the“normal“startup“message,Ž¡‘and– ˜to“kš²!eep“them“from“bMÞeha˜ving“di eren˜tly“depMÞending“on“the“con˜ten˜ts“of“a“particular“user'sŽ¡‘`Þ~/.octavercÝ'–¦f le.‘ÝÝSee“Chapter“2“[In•²!v“oking›¦fOcta“v“e],˜page˜19.ŽŽŸŒ‹£ÅŸòÝ16’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞ#Ž¤ ‘èU#–¿ªThis“function“defines“the“right-hand-side“functions“for“a“set“ofŽ¡‘èU#–¿ªnonlinear“differential“equations.Ž¤‘(g©r–¿ª=“0.25Ž¡‘(g©and–¿ªso“on...Ž¡‘èUendfunctionŽ©gj‘ÝThe–&ÞÞhelp“Ýcommand“(see“Chapter“26“[Help],‘@_page“151)“is“able“to“ nd“the“ rst“bloMÞcš²!k“of“commen˜tsŽ¤in–^Éa“function“(ev²!en“those“that“are“compMÞosed“directly“on“the“command“line).‘ÅþThis“means“that“usersŽ¡of›EüOcta•²!v“e˜can˜use˜the˜same˜commands˜to˜get˜help˜for˜built-in˜functions,‘YDand˜for˜functions˜that˜y“ouŽ¡ha•²!v“e–¦fde ned.‘ÝÝF‘ÿeor“example,“after“de ning“the“function“Þf“ÝabMÞo•²!v“e,–¦fthe“commandŽ¤gj‘èUÞhelp‘¿ªfŽ¦ÝproMÞduces–¦fthe“outputŽ¡‘"§ÿÞusage:–¿ªf“(x,“t)ŽŸ‘"§ÿThis–¿ªfunction“defines“the“right-hand-side“functions“for“a“set“ofŽŸ ‘"§ÿnonlinear–¿ªdifferential“equations.Ž¦‘ÝAlthough–ßeit“is“pMÞossible“to“put“commenš²!t“lines“in˜to“k˜eyb•MÞoard-comp“osed–ßethro˜w-a˜w˜a˜y“Octa˜v˜e“pro-Ž¤grams,›¹´it–‚¥usually“isn't“v²!ery“useful,˜bšMÞecause“the“purp˜ose“of“a“commenš²!t“is“to“help“y˜ou“or“anotherŽ¡pMÞerson–¦funderstand“the“program“at“a“later“time.ŽŸ%¦ëE1.5‘™ErrorsŽŽŸgj‘ÝThere–üare“t•²!w“o–üclasses“of“errors“that“Octa•²!v“e–üproMÞduces“when“it“encoun²!ters“input“that“it“is“unableŽ¡to–¦funderstand,“or“when“it“is“unable“to“pMÞerform“an“action.Ž¦‘A‘°áparse–Îerror‘ä÷ÝoMÞccurs“if“Octa•²!v“e–Îcannot“understand“something“yš²!ou“ha˜v˜e“t˜ypMÞed.‘>F‘ÿeor“example,‘9(ifŽ¡yš²!ou–¦fmisspMÞell“a“k˜eyw˜ord,Ž¤gj‘èUÞoctave:13>–¿ªfuncton“y“=“f“(x)“y“=“x^2;“endfunctionŽ¦ÝOcta•²!v“e–¦fwill“respMÞond“immediately“with“a“message“lik²!e“this:Ž¡‘èUÞparse‘¿ªerror:ŽŸ‘(g©functon–¿ªy“=“f“(x)“y“=“x^2;“endfunctionŽŸ ‘Vdù^Ž¦ÝF‘ÿeor–®|most“parse“errors,‘°Octa•²!v“e–®|uses“a“caret“(`Þ^Ý')“to“mark“the“pMÞoinš²!t“on“the“line“where“it“w˜as“unableŽ¤to–Imakš²!e“sense“of“y˜our“input.‘ÐÔIn“this“case,‘‡Octa˜v˜e“generated“an“error“message“bMÞecause“the“k˜eyw˜ordŽ¡Þfunction–çIÝwš²!as“misspMÞelled.‘ …Instead“of“seeing“`Þfunction‘¦ffÝ',‘7Octa˜v˜e“sa˜w“t˜w˜o“consecutiv˜e“v‘ÿdDariableŽ¡names,‘>¦whicš²!h–$¶is“in˜v‘ÿdDalid“in“this“con˜text.‘²¢It“mark˜ed“the“error“at“the“Þy“ÝbMÞecause“the“ rst“name“b˜y“itselfŽ¡w²!as–¦faccepted“as“v‘ÿdDalid“input.ŽŽŸŒ‹¯áŸòÝChapter–¦f1:‘ÝÝA“Brief“Inš²!troMÞduction“to“Octa˜v˜e’ýÛv17ŽŽŽ ƒ3Ú ý¨ðБAnother–?"class“of“error“message“ošMÞccurs“o˜ccurs“at“ev‘ÿdDaluation“time.‘¨These“errors“are“called“árun-Ž¤time–1ÒerrorsÝ,‘T­or“sometimes“áev‘ÿdDaluation“errors‘¥TÝbšMÞecause“they“o˜ccur“when“y²!our“program“is“b˜eing“árunÝ,Ž¡or–ìµáev‘ÿdDaluatedÝ.‘°ÉF‘ÿeor“example,›þHif“after“correcting“the“mistak²!e“in“the“previous“function“de nition,˜y²!ouŽ¡t²!ypMÞeŽ¤‘èUÞoctave:13>–¿ªf“()Ž©ÝOcta•²!v“e–¦fwill“respMÞond“withŽ¡‘èUÞerror:–¿ª`x'“undefined“near“line“1“column“24Ž¤ ‘èUerror:–¿ªevaluating“expression“near“line“1,“column“24Ž¡‘èUerror:–¿ªevaluating“assignment“expression“near“line“1,“column“22Ž¡‘èUerror:–¿ªcalled“from“`f'Ž¦‘ÝThis–Eterror“message“has“sevš²!eral“parts,‘X×and“giv˜es“y˜ou“quite“a“bit“of“information“to“help“y˜ou“loMÞcateŽ¤the–p5source“of“the“error.‘;IThe“messages“are“generated“from“the“pMÞoin²!t“of“the“innermost“error,‘¢¨andŽ¡proš²!vide–¦fa“tracebac˜k“of“enclosing“expression“and“function“calls.Ž¦‘In–×›the“example“abšMÞo•²!v“e,‘÷the–×› rst“line“indicates“that“a“v‘ÿdDariable“named“`ÞxÝ'“w²!as“found“to“b˜e“unde nedŽ¡near–"line“1“and“column“24“of“some“function“or“expression.‘PÛF‘ÿeor“errors“oMÞccurring“within“functions,Ž¡lines–Ø”are“n•²!um“b•MÞered›Ø”b“eginning˜with˜the˜line˜con•²!taining˜the˜`ÞfunctionÝ'˜k“eyw“ord.‘™BF‘ÿeor˜errors˜oMÞccurringŽ¡at–‚¾the“top“levš²!el,‘‰àthe“line“n˜um˜bMÞer“indicates“the“input“line“n˜um˜bMÞer,‘‰àwhic˜h“is“usually“displa˜y˜ed“in“theŽ¡prompt‘¦fstring.Ž¦‘The–6second“and“third“lines“in“the“example“indicate“that“the“error“oMÞccurred“within“an“assignmen²!tŽ¡expression,‘†ýand–&àthe“last“line“of“the“error“message“indicates“that“the“error“oMÞccurred“within“theŽ¡function–`z`ÞfÝ'.‘ If“the“function“`ÞfÝ'“had“bMÞeen“called“from“another“function,›Žÿsa²!y“`ÞgÝ',˜the“list“of“errorsŽ¡w•²!ould›¦fha“v“e˜ended˜with˜one˜more˜line:ŽŸ‘èUÞerror:–¿ªcalled“from“`g'Ž¦‘ÝThese– wlists“of“function“calls“usually“makš²!e“it“fairly“easy“to“trace“the“path“y˜our“program“toMÞokŽ¡bšMÞefore–¦fthe“error“o˜ccurred,“and“to“correct“the“error“b˜efore“trying“again.ŽŽŸŒ‹¹0ŸòÝ18’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹ÁýŸòÝChapter›¦f2:‘ÝÝIn•²!v“oking˜Octa“v“e’Dðì19ŽŽŽ ƒ3Ú ý¨ðÐè2‘ ¸QIn–ÿuÂv“oking‘¦MOcta“v“eŽŽŸ#‡Ž‘ÝNormally‘ÿe,‘lOcta•²!v“e–÷mis“used“in•²!teractiv“ely›÷mb“y˜running˜the˜program˜`ÞoctaveÝ'˜without˜an“y˜argumen“ts.Ž¤Once–¦fstarted,“Octa•²!v“e–¦freads“commands“from“the“terminal“unš²!til“y˜ou“tell“it“to“exit.Ž©´¶‘Y‘ÿeou–—tcan“also“spMÞecify“the“name“of“a“ le“on“the“command“line,‘šqand“Octa•²!v“e–—twill“read“and“executeŽ¡the–¦fcommands“from“the“named“ le“and“then“exit“when“it“is“ nished.Ž¦‘Y‘ÿeou–áCcan“further“conš²!trol“ho˜w“Octa˜v˜e“starts“up“b˜y“using“the“command-line“options“describMÞed“inŽ¡the–¦fnext“section,“and“Octa•²!v“e–¦fitself“can“remind“yš²!ou“of“the“options“a˜v‘ÿdDailable.‘ÝÝT˜ypMÞeŽŸ´¶‘èUÞoctave‘¿ª--helpŽ¦Ýto–¦fdisplaš²!y“all“a˜v›ÿdDailable“options“and“brie y“describMÞe“their“use“(`Þoctave“-hÝ'“is“a“shorter“equiv˜alen²!t).ŽŸ"ÒØëE2.1‘™Command–¦MLine“OptionsŽŽŸilÞ--debugŽŽŽ¡-dŽŽ‘9ÐóÝEnš²!ter–ߘparser“debugging“moMÞde.‘‰tUsing“this“option“will“cause“Octa˜v˜e's“parser“to“prin˜t“aŽ¡‘9Ðólot–|îof“information“abMÞout“the“commands“it“reads,‘…9and“is“probably“only“useful“if“y²!ou“areŽ¡‘9Ðóactually–¦ftrying“to“debug“the“parser.Ž©ilÞ--helpŽŽŽ¡-hŽŽŽ¡-?ŽŽ‘9ÐóÝPrin²!t–¦fshort“help“message“and“exit.Ž¦Þ--ignore-init-fileŽ¡--norcŽŽŽ¡-fŽŽ‘9ÐóÝDon't–¦fread“an²!y“of“the“system“or“user“initialization“ les“at“startup.Ž¦Þ--info-file‘¦fá lenameŽ¡‘9ÐóÝSpšMÞecify–Ðœthe“name“of“the“info“ le“to“use.‘–šThe“v‘ÿdDalue“of“á lename‘m£Ýsp˜eci ed“on“the“commandŽ¡‘9Ðóline–ÃÆwill“o•²!v“erride›ÃÆan“y˜v‘ÿdDalue˜of˜`ÞOCTAVE_INFO_FILEÝ'˜found˜in˜the˜en“vironmen“t,‘Ëbut˜notŽ¡‘9Ðóan²!y–¦f`ÞINFO_FILE“=“"filename"Ý'“commands“found“in“the“system“or“user“startup“ les.Ž¦Þ--interactiveŽ¡-iŽŽ‘9ÐóÝF‘ÿeorce›¦fin•²!teractiv“e˜bMÞeha“vior.Ž¦Þ--path‘¦fápathŽ¡Þ-p‘¦fápathŽŽ‘9ÐóÝSpšMÞecify–ƒÚthe“path“to“searc²!h“for“function“ les.‘}The“v‘ÿdDalue“of“ápath“Ýsp˜eci ed“on“the“commandŽ¡‘9Ðóline–]Iwill“o•²!v“erride›]Ian“y˜v‘ÿdDalue˜of˜`ÞOCTAVE_PATHÝ'˜found˜in˜the˜en“vironmen“t,‘‹but˜not˜an“yŽ¡‘9Ðó`ÞLOADPATH–¦f=“"path"Ý'“commands“found“in“the“system“or“user“startup“ les.Ž¦Þ--silentŽŽŽ¡--quietŽŽŽ¡-qŽŽ‘9ÐóÝDon't–¦fprin²!t“message“at“startup.ŽŽŸŒ‹ÂPŸòÝ20’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞ--verboseŽ¤-VŽŽ‘9ÐóÝT‘ÿeurn–¦fon“v²!erbMÞose“output.Ž©Þ--versionŽ¡-vŽŽ‘9ÐóÝPrinš²!t–¦fthe“program“v˜ersion“n˜um˜bMÞer“and“exit.Ž¦Þ--echo-commandsŽ¡-xŽŽ‘9ÐóÝEc²!ho–¦fcommands“as“they“are“executed.Ž¦á leŽŽ‘9ÐóÝExecute–¦fcommands“from“á leÝ.ŽŸ ëE2.2‘™Startup‘¦MFilesŽŽŸ‘ÝWhen›¦fOcta•²!v“e˜starts,˜it˜loMÞoks˜for˜commands˜to˜execute˜from˜the˜follo“wing˜ les:ŽŸÞOCTAVE_HOME/lib/octave/VERSION/startup/octavercŽ¡‘9ÐóÝWhere–·ÞOCTAVE_HOME“Ýis“the“directory“in“whicš²!h“all“of“Octa˜v˜e“is“installed“(the“defaultŽ¡‘9Ðóis–þ`Þ/usr/localÝ'),‘äand“ÞVERSION“Ýis“the“vš²!ersion“n˜um˜bMÞer“of“Octa˜v˜e.‘ü¦This“ le“is“pro˜videdŽ¡‘9Ðóso–½Üthat“cš²!hanges“to“the“default“Octa˜v˜e“en˜vironmen˜t“can“bMÞe“made“globally“for“all“users.Ž¡‘9ÐóSome–Äžcare“should“bMÞe“takš²!en“when“making“c˜hanges“to“this“ le,‘Ì,since“all“users“of“Octa˜v˜eŽ¡‘9Ðóat–¦fy²!our“site“will“bMÞe“a ected.Ž¦Þ~/.octavercŽ¡‘9ÐóÝThis–¾ le“is“normally“used“to“makš²!e“pMÞersonal“c˜hanges“to“the“default“Octa˜v˜e“en˜vironmen˜t.Ž¦Þ.octavercŽ¡‘9ÐóÝThis–©¯ le“can“bMÞe“used“to“makš²!e“c˜hanges“to“the“default“Octa˜v˜e“en˜vironmen˜t“for“a“particularŽ¡‘9Ðópro‘›»ject.‘ÐÝOcta•²!v“e›fsearc“hes˜for˜this˜ le˜after˜it˜reads˜`Þ~/.octavercÝ',‘‡3so˜an“y˜use˜of˜the˜ÞcdŽ¡‘9ÐóÝcommand–S#in“the“`Þ~/.octavercÝ'“ le“will“a ect“the“directory“that“Octa•²!v“e›S#searc“hes˜forŽ¡‘9Ðóthe–¦f le“`Þ.octavercÝ'.ŽŸ‘9ÐóIf–Ô‘yš²!ou“start“Octa˜v˜e“in“y˜our“home“directory‘ÿe,‘ it“will“a˜v˜oid“executing“commands“fromŽ¡‘9Ðó`Þ~/.octavercÝ'‘¦ft²!wice.ŽŸ‘A‘ˬmessage–Ëäwill“bMÞe“displa•²!y“ed–Ëäas“eacš²!h“of“these“ les“is“read“if“y˜ou“in˜v˜ok˜e“Octa˜v˜e“with“the“Þ--verboseŽ¡Ýoption–¦fbut“without“the“Þ--silent“Ýoption.ŽŸ‘Startup–¦f les“maš²!y“con˜tain“an˜y“v‘ÿdDalid“Octa˜v˜e“commands,“including“m˜ultiple“function“de nitions.ŽŽŸŒ‹ËaŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ21ŽŽŽ ƒ3Ú ý¨ðÐè3‘ ¸QExpressionsŽŽŸ‡˜‘ÝExpressions–²|are“the“basic“building“bloMÞcš²!k“of“statemen˜ts“in“Octa˜v˜e.‘An“expression“ev‘ÿdDaluates“to“aŽ¤v‘ÿdDalue,‘ÅŠwhic•²!h›¿Py“ou˜can˜prin“t,–ÅŠtest,“store˜in˜a˜v‘ÿdDariable,“pass˜to˜a˜function,“or˜assign˜a˜new˜v‘ÿdDalue˜to˜aŽ¡v‘ÿdDariable–¦fwith“an“assignmen²!t“opMÞerator.ŽŸ‘An–|¬expression“can“servš²!e“as“a“statemen˜t“on“its“o˜wn.‘ÏõMost“other“kinds“of“statemen˜ts“con˜tain“oneŽ¡or–2Smore“expressions“whic²!h“spšMÞecify“data“to“b˜e“op˜erated“on.‘¥As“in“other“languages,‘UOexpressions“inŽ¡Octa•²!v“e–h{include“v‘ÿdDariables,›tÝarra²!y“references,˜constan²!ts,˜and“function“calls,˜as“wš²!ell“as“com˜binations“ofŽ¡these–¦fwith“v‘ÿdDarious“opMÞerators.ŽŸCÌëE3.1‘™ConstanŒÌt‘¦MExpressionsŽŽ©‘ÝThe–QÛsimplest“tš²!ypMÞe“of“expression“is“the“áconstan˜tÝ,‘|¹whic˜h“alw˜a˜ys“has“the“same“v‘ÿdDalue.‘à=There“areŽ¡t•²!w“o›¦ft“ypMÞes˜of˜constan“ts:‘ÝÝn“umeric˜constan“ts˜and˜string˜constan“ts.ŽŸCÌóMÂÖN  #× cmbx12ëM3.1.1‘d(Numeric‘¦MConstan–átsŽŽ¦‘ÝA‘™án•²!umeric›™constan“t‘ÖÝma“y˜bMÞe˜a˜scalar,‘›Äa˜v“ector,–›Äor˜a˜matrix,“and˜it˜ma•²!y˜con“tain˜complex˜v‘ÿdDalues.Ž©‘The–°Lsimplest“form“of“a“nš²!umeric“constan˜t,›²Æa“scalar,˜is“a“single“n•²!um“bšMÞer–°Lthat“can“b˜e“an“in²!teger,‘²ÆaŽ¡decimal–2Ëfraction,‘Iêa“n•²!um“bšMÞer–2Ëin“scien²!ti c“(exp˜onenš²!tial)“notation,‘Iêor“a“complex“n˜um˜bMÞer.‘·TNote“that“allŽ¡nš²!umeric–Jv‘ÿdDalues“are“represen˜ted“within“Octa˜v˜e“in“double-precision“ oating“pMÞoin˜t“format“(complexŽ¡constanš²!ts–š¶are“stored“as“pairs“of“double-precision“ oating“pMÞoin˜t“v‘ÿdDalues).‘ÙøHere“are“some“examples“ofŽ¡real-v‘ÿdDalued–¦fnš²!umeric“constan˜ts,“whic˜h“all“ha˜v˜e“the“same“v‘ÿdDalue:ŽŸ‘èUÞ105Ž¤ ‘èU1.05e+2Ž¡‘èU1050e-1Ž¦‘ÝT‘ÿeo–¦fspMÞecify“complex“constanš²!ts,“y˜ou“can“write“an“expression“of“the“formŽŸ‘èUÞ3–¿ª+“4iŽ¡‘èU3.0–¿ª+“4.0iŽ¡‘èU0.3e1–¿ª+“40e-1iŽ¦‘Ýall–6˜of“whicš²!h“are“equiv‘ÿdDalen˜t.‘¸˜The“letter“`ÞiÝ'“in“the“previous“example“stands“for“the“pure“imaginaryŽ¤constan²!t,–¦fde ned“as“Ÿ÷låpŽ‘ ÆgŸ÷l‰p ýàŸ“üÝ1ŽŽŽ‘ÄG.Ž¦‘F‘ÿeor›žèOcta•²!v“e˜to˜recognize˜a˜v‘ÿdDalue˜as˜the˜imaginary˜part˜of˜a˜complex˜constan“t,‘ ha˜space˜m“ust˜notŽ¡app•MÞear›¦fb“et•²!w“een˜the˜n“um“b•MÞer˜and˜the˜`ÞiÝ'.‘ÝÝIf˜it˜do“es,˜Octa•²!v“e˜will˜prin“t˜an˜error˜message,˜lik“e˜this:ŽŸ‘èUÞoctave:13>–¿ª3“+“4“iŽ¤‘èUparse‘¿ªerror:Ž¡‘(g©3–¿ª+“4“iŽŸ ‘Jå¥^Ž¦‘ÝY‘ÿeou–¦fmaš²!y“also“use“`ÞjÝ',“`ÞIÝ',“or“`ÞJÝ'“in“place“of“the“`ÞiÝ'“abMÞo˜v˜e.‘ÝÝAll“four“forms“are“equiv‘ÿdDalen˜t.ŽŽŸŒ‹ÓŸòÝ22’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐëM3.1.2‘d(String‘¦MConstan–átsŽŽŸ‘ÝA‘•³ástring–•·constanš²!t‘Ò·Ýconsists“of“a“sequence“of“c˜haracters“enclosed“in“either“double-quote“or“single-Ž©quote–¦fmarks.‘ÝÝF‘ÿeor“example,“bMÞoth“of“the“follo²!wing“expressionsŽŸ‘èUÞ"parrot"ŽŸ ‘èU'parrot'Ž¤Ýrepresenš²!t–¦fthe“string“whose“con˜ten˜ts“are“`ÞparrotÝ'.‘ÝÝStrings“in“Octa˜v˜e“can“bMÞe“of“an˜y“length.Ž¡‘Since–&ðthe“single-quote“mark“is“also“used“for“the“transpšMÞose“op˜erator“(see“Section“3.10“[ArithmeticŽ¦Ops],›×äpage–Íþ33)“but“double-quote“marks“ha•²!v“e–Íþno“other“purpMÞose“in“Octa•²!v“e,˜it–Íþis“bMÞest“to“use“double-Ž¦quote–¦fmarks“to“denote“strings.Ž¡‘Some–û÷cš²!haracters“cannot“bMÞe“included“literally“in“a“string“constan˜t.‘Þ‘Y‘ÿeou“represen˜t“them“insteadŽ¦with–¦fáescapMÞe“sequencesÝ,“whicš²!h“are“c˜haracter“sequences“bMÞeginning“with“a“bac˜kslash“(`Þ\Ý').Ž¡‘One–ÍÄuse“of“an“escapMÞe“sequence“is“to“include“a“double-quote“(single-quote)“c²!haracter“in“a“stringŽ¦constan²!t–îñthat“has“bMÞeen“de ned“using“double-quote“(single-quote)“marks.‘ ¶Since“a“plain“double-quoteŽ¦wš²!ould–Xend“the“string,‘2Ty˜ou“m˜ust“use“`Þ\"Ý'“to“represen˜t“a“single“double-quote“c˜haracter“as“a“part“ofŽ¦the–0þstring.‘}¦The“bacš²!kslash“c˜haracter“itself“is“another“c˜haracter“that“cannot“bMÞe“included“normally‘ÿe.Ž¦Y‘ÿeou–B‰mš²!ust“write“`Þ\\Ý'“to“put“one“bac˜kslash“in“the“string.‘²ETh˜us,‘i‘the“string“whose“con˜ten˜ts“are“theŽ¦t•²!w“o›¦fc“haracters˜`Þ"\Ý'˜m“ust˜bMÞe˜written˜Þ"\"\\"Ý.Ž¡‘Another–£øuse“of“bacš²!kslash“is“to“represen˜t“unprin˜table“c˜haracters“suc˜h“as“newline.‘ÝWhile“there“isŽ¦nothing–âÄto“stop“yš²!ou“from“writing“most“of“these“c˜haracters“directly“in“a“string“constan˜t,‘ñÜthey“ma˜yŽ¦loMÞok‘¦fugly‘ÿe.Ž¡‘Here–Èis“a“table“of“all“the“escapMÞe“sequences“used“in“Octa•²!v“e.‘BéThey–Èare“the“same“as“those“used“inŽ¦the–¦fC“programming“langauge.Ž©ÀÂÞ\\ŽŽ‘9ÐóÝRepresenš²!ts–¦fa“literal“bac˜kslash,“`Þ\Ý'.Ž¤„Þ\"ŽŽ‘9ÐóÝRepresenš²!ts–¦fa“literal“double-quote“c˜haracter,“`Þ"Ý'.Ž¡Þ\'ŽŽ‘9ÐóÝRepresenš²!ts–¦fa“literal“single-quote“c˜haracter,“`Þ'Ý'.Ž¡Þ\aŽŽ‘9ÐóÝRepresenš²!ts–¦fthe“\alert"“c˜haracter,“con˜trol-g,“ASCIšMÞI“co˜de“7.Ž¡Þ\bŽŽ‘9ÐóÝRepresenš²!ts–¦fa“bac˜kspace,“con˜trol-h,“ASCIšMÞI“co˜de“8.Ž¡Þ\fŽŽ‘9ÐóÝRepresenš²!ts–¦fa“formfeed,“con˜trol-l,“ASCIšMÞI“co˜de“12.Ž¡Þ\nŽŽ‘9ÐóÝRepresenš²!ts–¦fa“newline,“con˜trol-j,“ASCIšMÞI“co˜de“10.Ž¡Þ\rŽŽ‘9ÐóÝRepresenš²!ts–¦fa“carriage“return,“con˜trol-m,“ASCIšMÞI“co˜de“13.Ž¡Þ\tŽŽ‘9ÐóÝRepresenš²!ts–¦fa“horizon˜tal“tab,“con˜trol-i,“ASCIšMÞI“co˜de“9.Ž¡Þ\vŽŽ‘9ÐóÝRepresenš²!ts–¦fa“v˜ertical“tab,“con˜trol-k,“ASCIšMÞI“co˜de“11.Ž¦‘Strings–aŸma²!y“bMÞe“concatenated“using“the“notation“for“de ning“matrices.‘ÆðF‘ÿeor“example,‘oathe“expres-ŽŸsionŽŽŸŒ‹Ý°ŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ23ŽŽŽ ƒ3Ú ý¨ðБèUÞ[–¿ª"foo"“,“"bar"“,“"baz"“]Ž© ¢ÝprošMÞduces–j@the“string“whose“con•²!ten“ts–j@are“`ÞfoobarbazÝ'.‘ÉÐThe“next“section“explains“more“ab˜out“ho²!w“toŽ¤create‘¦fmatrices.ŽŸ"‚ˆëE3.2‘™MatricesŽŽŸ ¢‘ÝIt–xis“easy“to“de ne“a“matrix“of“v‘ÿdDalues“in“Octa•²!v“e.‘ΑThe–xsize“of“the“matrix“is“determined“automat-Ž¡ically‘ÿe,–¦fso“it“is“not“necessary“to“explicitly“state“the“dimensions.‘ÝÝThe“expressionŽ¤ ¢‘èUÞa–¿ª=“[1,“2;“3,“4]Ž¦Ýresults–¦fin“the“matrixŽ¡‘èUÞa‘¿ª=ŽŸ‘(g©1‘ T2ŽŸ ‘(g©3‘ T4Ž¦‘ÝThe–‘´commas“whicš²!h“separate“the“elemen˜ts“on“a“ro˜w“ma˜y“bMÞe“omitted,‘̇and“the“semicolon“thatŽŸmarks–¦fthe“bMÞeginning“of“a“new“roš²!w“ma˜y“bMÞe“replaced“b˜y“one“or“more“new“lines.‘ÝÝThe“expressionŽ¡‘èUÞa–¿ª=“[“1“2ŽŸ ‘?fQ3–¿ª4“]Ž¦Ýis–¦fequiv‘ÿdDalenš²!t“to“the“one“abMÞo˜v˜e.Ž¦‘Elemenš²!ts–kšof“a“matrix“ma˜y“bMÞe“arbitrary“expressions,‘w]pro˜vided“that“the“dimensions“all“agree.‘ÊDF‘ÿeorŽŸexample,–¦fgivš²!en“the“abMÞo˜v˜e“matrix,“the“expressionŽ¡‘èUÞ[–¿ªa,“a“]Ž¦ÝproMÞduces–¦fthe“matrixŽ¡‘èUÞans‘¿ª=ŽŸ‘(g©1– T2“1“2ŽŸ ‘(g©3– T4“3“4Ž¦Ýbut–¦fthe“expressionŽ¡‘èUÞ[–¿ªa“1“]Ž¦ÝproMÞduces–¦fthe“errorŽ¡‘èUÞerror:–¿ªnumber“of“rows“must“matchŽ¦‘ÝInside–t“the“square“brac•²!k“ets–t“that“delimit“a“matrix“expression,‘¨Octa•²!v“e–t“loMÞoks“at“the“surroundingŽ¤conš²!text–—®to“determine“whether“spaces“should“bMÞe“con˜v˜erted“in˜to“elemen˜t“separators,‘ÍÓor“simply“ignored,Ž¡so–¦fcommands“lik²!eŽ¤ ¢‘èUÞ[–¿ªlinspace“(1,“2)“]Ž¦Ýwill›¦fw•²!ork.‘ÝÝHo“w“ev“er,˜some˜pMÞossible˜sources˜of˜confusion˜remain.‘ÝÝF‘ÿeor˜example,˜in˜the˜expressionŽ¡‘èUÞ[–¿ª1“-“1“]ŽŽŸŒ‹é ŸòÝ24’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐthe–¦f`Þ-Ý'“is“treated“as“a“binary“opMÞerator“and“the“result“is“the“scalar“0,“but“in“the“expressionŽ©‘èUÞ[–¿ª1“-1“]Ž¤Ýthe–¦f`Þ-Ý'“is“treated“as“a“unary“opMÞerator“and“the“result“is“the“v²!ector“Þ[“1“-1“]Ý.Ž¡‘Giv²!en–¦fÞa“=“1Ý,“the“expressionŽ¦‘èUÞ[–¿ª1“a'“]Ž¡Ýresults–±in“the“single“quote“c²!haracter“`Þ'Ý'“bšMÞeing“treated“as“a“transp˜ose“op˜erator“and“the“result“is“theŽŸv²!ector–¦fÞ[“1“1“]Ý,“but“the“expressionŽ¦‘èUÞ[–¿ª1“a“'“]Ž¡ÝproMÞduces–¦fthe“error“messageŽ¦‘èUÞerror:–¿ªunterminated“string“constantŽ¡ÝbMÞecause–¦fto“not“do“so“wš²!ould“mak˜e“it“impMÞossible“to“correctly“parse“the“v‘ÿdDalid“expressionŽ¦‘èUÞ[–¿ªa“'foo'“]Ž¡‘ÝF–ÿeor›ê|clarit²!y“,‘it˜is˜probably˜bMÞest˜to˜alw•²!a“ys˜use˜commas˜and˜semicolons˜to˜separate˜matrix˜elemen“tsŽ¤and–NKroš²!ws.‘ ÕIt“is“pMÞossible“to“enforce“this“st˜yle“b˜y“setting“the“built-in“v‘ÿdDariable“Þwhitespace_in_Ž¡literal_matrix–¦fÝto“Þ"ignore"Ý.‘ÝÝSee“Chapter“6“[Built-in“V‘ÿeariables],“page“61.ŽŸ -3ëM3.2.1‘d(Empt–áy‘¦MMatricesŽŽŸ‘ÝA‘6$matrix–6Amaš²!y“ha˜v˜e“one“or“bšMÞoth“dimensions“zero,‘L¯and“op˜erations“on“empt²!y“matrices“are“handledŽ¡as–I’describšMÞed“b²!y“Carl“de“Bo˜or“in“áAn“Empt²!y“ExerciseÝ,›\#SIGNUM,“V‘ÿeolume“25,˜pages“2{6,˜1990“and“C.Ž¡N.–ƒhNett“and“W.“M.“Haddad,‘Šhin“áA‘ƒ_System-Theoretic“Appropriate“Realization“of“the“Empt²!y“MatrixŽ¡ConceptÝ,›µIEEE‘ÁT‘ÿeransactions–ÁÙon“Automatic“Con²!trol,˜V‘ÿeolume“38,˜Num²!bMÞer“5,˜Ma²!y“1993.‘05Brie y‘ÿe,Ž¡givš²!en–SÅa“scalar“ÞsÝ,‘dLand“an“ám“Ýb˜y“án“Ýmatrix“ÞM(mxn)Ý,‘dLand“an“ám“Ýb˜y“án“Ýempt˜y“matrix“Þ[](mxn)“Ý(with“eitherŽ¡one–¦for“bMÞoth“dimensions“equal“to“zero),“the“follo²!wing“are“true:Ž¦‘èUÞs–¿ª*“[](mxn)“=“[](mxn)“*“s“=“[](mxn)Ž¤‘3æý[](mxn)–¿ª+“[](mxn)“=“[](mxn)Ž¡‘3æý[](0xm)–¿ª*“M(mxn)“=“[](0xn)Ž¡‘3æýM(mxn)–¿ª*“[](nx0)“=“[](mx0)Ž¡‘3æý[](mx0)–¿ª*“[](0xn)“=“0(mxn)ŽŸ‘ÝBy–Ondefault,‘¹°dimensions“of“the“emptš²!y“matrix“are“no˜w“prin˜ted“along“with“the“empt˜y“matrixŽŸsym²!bMÞol,–¦f`Þ[]Ý'.‘ÝÝF‘ÿeor“example:Ž¦‘èUÞoctave:13>–¿ªzeros“(3,“0)ŽŸ ‘èUans‘¿ª=Ž¡‘èU[](3x0)ŽŽŸŒ‹ð ŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ25ŽŽŽ ƒ3Ú ý¨ðБThe–ÞŽbuilt-in“v‘ÿdDariable“Þprint_empty_dimensions“Ýconš²!trols“this“bMÞeha˜vior“(see“Section“6.2“[UserŽ¤Preferences],–¦fpage“62).Ž©¹¼‘Emptš²!y–™Ûmatrices“ma˜y“also“bMÞe“used“in“assignmen˜t“statemen˜ts“as“a“con˜v˜enien˜t“w˜a˜y“to“delete“ro˜wsŽ¡or–¦fcolumns“of“matrices.‘ÝÝSee“Section“3.13“[Assignmen²!t“Expressions],“page“37.ŽŸ"æîëE3.3‘™RangesŽŽŸ¹¼‘ÝA‘Vwárange‘óíÝis–Væa“con•²!v“enien“t›Væw“a“y˜to˜write˜a˜ro“w˜v“ector˜with˜ev“enly˜spaced˜elemen“ts.‘ ï]A‘VwrangeŽ¡constanš²!t–ç©is“de ned“b˜y“the“v‘ÿdDalue“of“the“ rst“elemen˜t“in“the“range,‘ Ïan“optional“v‘ÿdDalue“for“the“incremen˜tŽ¡bMÞet•²!w“een›Ü.elemen“ts,‘Ÿand˜a˜maxim“um˜v‘ÿdDalue˜whic“h˜the˜elemen“ts˜of˜the˜range˜will˜not˜exceed.‘šuThe˜base,Ž¡incremenš²!t,‘b:and–<©limit“are“separated“b˜y“colons“(the“`Þ:Ý'“c˜haracter)“and“ma˜y“con˜tain“an˜y“arithmeticŽ¡expressions–dand“function“calls.›ÇÂIf“the“incremen²!t“is“omitted,‘qYit“is“assumed“to“bMÞe“1.˜F‘ÿeor“example,‘qYtheŽ¡rangeŽŸ¹¼‘èUÞ1–¿ª:“5Ž¦Ýde nes–ðCthe“set“of“v‘ÿdDalues“`Þ[–¦f1“2“3“4“5“]Ý'–ðC(the“incremenš²!t“has“bMÞeen“omitted,‘ºso“it“is“tak˜en“as“1),‘ºandŽ¡the‘¦frangeŽŸ¹¼‘èUÞ1–¿ª:“3“:“5Ž¦Ýde nes–K^the“set“of“v›ÿdDalues“`Þ[–¦f1“4“]Ý'.‘¿…In–K^this“case,‘]“the“base“v˜alue“is“1,›]“the“incremen²!t“is“3,˜and“the“limitŽ¡is‘¦f5.Ž¦‘Although–!åa“range“constanš²!t“spMÞeci es“a“ro˜w“v˜ector,‘@ÄOcta˜v˜e“doMÞes“ánot‘^åÝcon˜v˜ert“range“constan˜ts“toŽ¡vš²!ectors–gyunless“it“is“necessary“to“do“so.‘ÈãThis“allo˜ws“y˜ou“to“write“a“constan˜t“lik˜e“`Þ1–¦f:“10000Ý'‘gywithoutŽ¡using–¦fup“80,000“bš²!ytes“of“storage“on“a“t˜ypical“32-bit“w˜orkstation.Ž¦‘Note–©that“the“uppMÞer“(or“lo•²!w“er,‘-ºif–©the“incremenš²!t“is“negativ˜e)“bMÞound“on“the“range“is“not“alw˜a˜ysŽ¡included–ÛXin“the“set“of“v‘ÿdDalues,‘õand“that“ranges“de ned“bš²!y“ oating“pMÞoin˜t“v‘ÿdDalues“can“proMÞduce“surprisingŽ¡results–&ßbšMÞecause“Octa•²!v“e–&ßuses“ oating“p˜oin²!t“arithmetic“to“compute“the“v‘ÿdDalues“in“the“range.‘_IIf“it“isŽ¡impšMÞortan²!t–2Ëto“include“the“endp˜oinš²!ts“of“a“range“and“the“n˜um˜bMÞer“of“elemen˜ts“is“kno˜wn,‘Uäy˜ou“shouldŽ¡use–¦fthe“Þlinspace“Ýfunction“instead“(see“Chapter“21“[SpMÞecial“Matrices],“page“133).ŽŸ"æîëE3.4‘™V‘þ¦fariablesŽŽŸ¹¼‘ÝV‘ÿeariables–Íhlet“yš²!ou“giv˜e“names“to“v‘ÿdDalues“and“refer“to“them“later.‘•‰Y‘ÿeou“ha˜v˜e“already“seen“v‘ÿdDariables“inŽ¡manš²!y–Þ”of“the“examples.‘›BThe“name“of“a“v‘ÿdDariable“m˜ust“bMÞe“a“sequence“of“letters,‘Šdigits“and“underscores,Ž¡but–Yit“maš²!y“not“bMÞegin“with“a“digit.‘ÄOcta˜v˜e“doMÞes“not“enforce“a“limit“on“the“length“of“v‘ÿdDariable“names,Ž¡but–/it“is“seldom“useful“to“ha•²!v“e–/v‘ÿdDariables“with“names“longer“than“abMÞout“30“cš²!haracters.‘® The“follo˜wingŽ¡are–¦fall“v›ÿdDalid“v˜ariable“namesŽŸ¹¼‘èUÞxŽ¤ ‘èUx15Ž¡‘èU__foo_bar_baz__Ž¡‘èUfucnrdthsucngtagdjbŽŽŸŒ‹øÄŸòÝ26’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐCase–¦fis“signi canš²!t“in“v‘ÿdDariable“names.‘ÝÝThe“sym˜bMÞols“Þa“Ýand“ÞA“Ýare“distinct“v‘ÿdDariables.Ž©@‘A‘•v›ÿdDariable–Âœname“is“a“v˜alid“expression“bš²!y“itself.‘2€It“represen˜ts“the“v‘ÿdDariable's“curren˜t“v‘ÿdDalue.‘2€V‘ÿeari-Ž¤ables–-÷are“givš²!en“new“v‘ÿdDalues“with“áassignmen˜t“opMÞerators‘¡yÝand“áincremen˜t“opMÞeratorsÝ.‘tSee“Section“3.13Ž¡[Assignmen²!t–¦fExpressions],“page“37.Ž¦‘A‘Azn•²!um“bšMÞer–Aäof“v‘ÿdDariables“ha•²!v“e–Aäsp˜ecial“built-in“meanings.‘ °WF‘ÿeor“example,‘¨ÃÞPWD“Ýholds“the“curren²!tŽ¡w²!orking–¹+directory‘ÿe,‘ýÜand“Þpi“Ýnames“the“ratio“of“the“circumference“of“a“circle“to“its“diameter.‘,SeeŽ¡Chapter–¡@6“[Built-in“V‘ÿeariables],›ßöpage“61,˜for“a“list“of“all“the“prede ned“v‘ÿdDariables.‘ÎkSome“of“theseŽ¡built-in–Ìsymš²!bMÞols“are“constan˜ts“and“ma˜y“not“bMÞe“c˜hanged.‘ÐÿOthers“can“bMÞe“used“and“assigned“just“lik˜eŽ¡all–¦fother“v›ÿdDariables,“but“their“v˜alues“are“also“used“or“cš²!hanged“automatically“b˜y“Octa˜v˜e.Ž¦‘V›ÿeariables–†Bin“Octa•²!v“e–†Bcan“bMÞe“assigned“either“n²!umeric“or“string“v‘ÿdDalues.‘Ó&V˜ariables“ma²!y“not“bMÞe“usedŽ¡bšMÞefore–¦fthey“ha•²!v“e–¦fb˜een“giv²!en“a“v‘ÿdDalue.‘ÝÝDoing“so“results“in“an“error.ŽŸ! ëE3.5‘™Index‘¦MExpressionsŽŽŸ@‘ÝAn–¦fáindex“expression“Ýalloš²!ws“y˜ou“to“reference“or“extract“selected“elemen˜ts“of“a“matrix“or“v˜ector.Ž¦‘Indices–‡”maš²!y“bMÞe“scalars,–¾v˜ectors,“ranges,“or–‡”the“spšMÞecial“op˜erator“`Þ:Ý',‘¾whicš²!h“ma˜y“bMÞe“used“to“selectŽ¡en•²!tire›¦fro“ws˜or˜columns.Ž¦‘V‘ÿeectors–÷˜are“indexed“using“a“single“expression.‘ÑrMatrices“require“t•²!w“o–÷˜indices“unless“the“v‘ÿdDalue“ofŽ¡the–cGbuilt-in“v‘ÿdDariable“Þdo_fortran_indexing“Ýis“Þ"true"Ý,‘p³in“whicš²!h“case“a“matrix“ma˜y“also“bMÞe“indexedŽ¡b²!y–¦fa“single“expression“(see“Section“6.2“[User“Preferences],“page“62).Ž¦‘Giv²!en–¦fthe“matrixŽ¤@‘èUÞa–¿ª=“[1,“2;“3,“4]Ž¦Ýall–¦fof“the“folloš²!wing“expressions“are“equiv‘ÿdDalen˜tŽ¡‘èUÞa–¿ª(1,“[1,“2])Ž¤ ‘èUa–¿ª(1,“1:2)Ž¡‘èUa–¿ª(1,“:)Ž¦Ýand–¦fselect“the“ rst“ro²!w“of“the“matrix.Ž¦‘A‘ÏôspšMÞecial–Ïÿform“of“indexing“ma²!y“b˜e“used“to“select“elemenš²!ts“of“a“matrix“or“v˜ector.‘Z§If“the“indicesŽ¤are–¢8vš²!ectors“made“up“of“only“ones“and“zeros,‘£the“result“is“a“new“matrix“whose“elemen˜ts“correspMÞondŽ¡to–¦fthe“elemenš²!ts“of“the“index“v˜ector“that“are“equal“to“one.‘ÝÝF‘ÿeor“example,ŽŸ@‘èUÞa–¿ª=“[1,“2;“3,“4];ŽŸ ‘èUa–¿ª([1,“0],“:)Ž¦Ýselects–¦fthe“ rst“ro²!w“of“the“matrix“`ÞaÝ'.Ž¦‘This–å¡opšMÞeration“can“b˜e“useful“for“selecting“elemen²!ts“of“a“matrix“based“on“some“condition,‘õpsinceŽ¡the–¦fcomparison“opMÞerators“return“matrices“of“ones“and“zeros.Ž¦‘Unfortunately‘ÿe,‘dÚthis–>ÃspMÞecial“zero-one“form“of“indexing“leads“to“a“con ict“with“the“standard“in-Ž¡dexing–¦fopMÞeration.‘ÝÝF‘ÿeor“example,“should“the“folloš²!wing“statemen˜tsŽŽŸŒ‹}ŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ27ŽŽŽ ƒ3Ú ý¨ðБèUÞa–¿ª=“[1,“2;“3,“4];ŽŸ ‘èUa–¿ª([1,“1],“:)Ž©Ýreturn–Qythe“original“matrix,‘|=or“the“matrix“formed“bš²!y“selecting“the“ rst“ro˜w“t˜wice?‘ßAlthough“thisŽ¤con ict–åéis“not“likš²!ely“to“arise“v˜ery“often“in“practice,‘ iy˜ou“ma˜y“select“the“bMÞeha˜vior“y˜ou“prefer“b˜y“settingŽ¡the–¦fbuilt-in“v‘ÿdDariable“Þprefer_zero_one_indexing“Ý(see“Section“6.2“[User“Preferences],“page“62).Ž¦‘Finally‘ÿe,‘ÓÒindexing–ʽa“scalar“with“a“vš²!ector“of“ones“can“bMÞe“used“to“create“a“v˜ector“the“same“size“asŽ¡the–§—the“index“vš²!ector,‘§ãwith“eac˜h“elemen˜t“equal“to“the“v‘ÿdDalue“of“the“original“scalar.‘áqF‘ÿeor“example,‘§ãtheŽ¡follo•²!wing‘¦fstatemen“tsŽŸ‘èUÞa–¿ª=“13;ŽŸ ‘èUa–¿ª([1,“1,“1,“1])Ž¦ÝproMÞduce–¦fa“vš²!ector“whose“four“elemen˜ts“are“all“equal“to“13.Ž¦‘Similarly‘ÿe,‘bindexing–ïáa“scalar“with“t•²!w“o›ïáv“ectors˜of˜ones˜can˜bMÞe˜used˜to˜create˜a˜matrix.‘¡F‘ÿeor˜exampleŽ¡the–¦ffolloš²!wing“statemen˜tsŽŸ‘èUÞa–¿ª=“13;ŽŸ ‘èUa–¿ª([1,“1],“[1,“1,“1])Ž¦Ýcreate–¦fa“2“bš²!y“3“matrix“with“all“elemen˜ts“equal“to“13.Ž¦‘This–Vøis“an“obscure“notation“and“should“bšMÞe“a•²!v“oided.‘ï“It–Vøis“b˜etter“to“use“the“function“`ÞonesÝ'“toŽ¡generate–ûÉa“matrix“of“the“appropriate“size“whose“elemen²!ts“are“all“one,‘èand“then“to“scale“it“to“proMÞduceŽ¡the–¦fdesired“result.‘ÝÝSee“Chapter“21“[SpMÞecial“Matrices],“page“133.ŽŸ0ëE3.6‘™Data‘¦MStructuresŽŽŸ‘ÝOcta•²!v“e–Æðincludes“a“limited“amounš²!t“of“suppMÞort“for“organizing“data“in“structures.‘?|The“curren˜tŽ¡implemenš²!tation–qªuses“an“assoMÞciativ˜e“arra˜y“with“indices“limited“to“strings,‘¤zbut“the“syn˜tax“is“moreŽ¡lik•²!e›¦fC-st“yle˜structures.‘ÝÝHere˜are˜some˜examples˜of˜using˜data˜structures˜in˜Octa“v“e.Ž¦‘Elemenš²!ts–¦fof“structures“can“bMÞe“of“an˜y“v‘ÿdDalue“t˜ypMÞe.ŽŸ‘èUÞoctave:1>–¿ªx.a“=“1;“x.b“=“[1,“2;“3,“4];“x.c“=“"string";Ž¤ ‘èUoctave:2>‘¿ªx.aŽ¡‘èUx.a–¿ª=“1Ž¡‘èUoctave:3>‘¿ªx.bŽ¡‘èUx.b‘¿ª=Ž©‘(g©1‘ T2Ž¡‘(g©3‘ T4Ž¦‘èUoctave:4>‘¿ªx.cŽ¡‘èUx.c–¿ª=“stringŽŸ‘ÝStructures–¦fma²!y“bMÞe“copied.ŽŸ‘èUÞoctave:1>–¿ªy“=“xŽ¡‘èUy‘¿ª=ŽŽŸŒ‹IŸòÝ28’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞŽ©Ý™‘ÝNote–<ªthat“when“the“v‘ÿdDalue“of“a“structure“is“prin•²!ted,‘¢:Octa“v“e–<ªonly“displa²!ys“the“names“of“theŽ¤elemen•²!ts.‘χThis›{dprev“en“ts˜long˜and˜confusing˜output˜from˜large˜deeply˜nested˜structures,‘ƒþbut˜mak“esŽ¡it–:more“dicult“to“view“the“v‘ÿdDalues“of“simple“structures,‘^æso“this“bMÞehaš²!vior“ma˜y“c˜hange“in“a“futureŽ¡vš²!ersion–¦fof“Octa˜v˜e.Ž¦‘Since–Åsstructures“are“themselvš²!es“v‘ÿdDalues,‘Í6structure“elemen˜ts“ma˜y“reference“other“structures.‘;TheŽ¡follo•²!wing›Cöstatemen“ts˜c“hange˜the˜v‘ÿdDalue˜of˜the˜elemen“t˜Þb˜Ýof˜the˜structure˜Þx˜Ýto˜bMÞe˜a˜data˜structureŽ¡conš²!taining–¦fthe“single“elemen˜t“ÞdÝ,“whic˜h“has“a“v‘ÿdDalue“of“3.ŽŸÝ™‘èUÞoctave:1>–¿ªx.b.d“=“3Ž¤ ‘èUx.b.d–¿ª=“3Ž¡‘èUoctave:2>‘¿ªx.bŽ¡‘èUx.b‘¿ª=Ž¤‘èUŽ¡‘èUoctave:3>‘¿ªx.b.dŽ¤ ‘èUx.b.d–¿ª=“3Ž¦‘ÝF›ÿeunctions–Ï‘can“return“structures.‘Y_F˜or“example,‘Üthe“follo²!wing“function“separates“the“real“andŽŸcomplex–¦fparts“of“a“matrix“and“stores“them“in“t•²!w“o›¦felemen“ts˜of˜the˜same˜structure˜v‘ÿdDariable.ŽŸÝ™‘èUÞoctave:1>–¿ªfunction“y“=“f“(x)Ž¡‘èU>–¿ªy.re“=“real“(x);Ž¡‘èU>–¿ªy.im“=“imag“(x);Ž¡‘èU>‘¿ªendfunctionŽ¦‘ÝWhen–³;called“with“a“complex-v‘ÿdDalued“argumenš²!t,‘¶pÞf“Ýreturns“the“data“structure“con˜taining“the“realŽŸand–¦fimaginary“parts“of“the“original“function“argumen²!t.ŽŸÝ™‘èUÞoctave:1>–¿ªf“(rand“(3)“+“rand“(3)“*“I);Ž¡‘èUans‘¿ª=Ž¤‘èUŽ¡‘èUoctave:3>‘¿ªans.imŽ© ‘èUans.im‘¿ª=Ž¡‘(g©0.093411– T0.229690“0.627585Ž¦‘(g©0.415128– T0.221706“0.850341Ž¦‘(g©0.894990– T0.343265“0.384018Ž¡‘èUoctave:4>‘¿ªans.reŽ¦‘èUans.re‘¿ª=Ž¡‘(g©0.56234– T0.14797“0.26416Ž¦‘(g©0.72120– T0.62691“0.20910Ž¦‘(g©0.89211– T0.25175“0.21081ŽŽŸŒ‹ŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ29ŽŽŽ ƒ3Ú ý¨ðБF‘ÿeunction–QWreturn“lists“can“include“structure“elemenš²!ts,‘|and“they“ma˜y“bMÞe“indexed“lik˜e“an˜y“otherŽŸv‘ÿdDariable.ŽŸD‘èUÞoctave:1>–¿ª[x.u,“x.s(2:3,2:3),“x.v]“=“svd“([1,“2;“3,“4])Ž¤ ‘èUx.u‘¿ª=Ž©‘(g©-0.40455‘ T-0.91451Ž¡‘(g©-0.91451‘>þ0.40455Ž¦‘èUx.s‘¿ª=Ž¦‘(g©0.00000– T0.00000“0.00000Ž¡‘(g©0.00000– T5.46499“0.00000Ž¡‘(g©0.00000– T0.00000“0.36597Ž¦‘èUx.v‘¿ª=Ž¦‘(g©-0.57605‘>þ0.81742Ž¡‘(g©-0.81742‘ T-0.57605Ž¦‘èUoctave:8>‘¿ªxŽ¡‘èUx‘¿ª=Ž¦‘èUŽ¤D‘ÝY‘ÿeou– Ÿcan“also“use“the“function“Þis_struct“Ýto“determine“whether“a“giv²!en“v‘ÿdDalue“is“a“data“structure.Ž©F‘ÿeor‘¦fexampleŽŸD‘èUÞis_struct‘¿ª(x)Ž¡Ýreturns–¦f1“if“the“v›ÿdDalue“of“the“v˜ariable“áx‘gÅÝis“a“data“structure.Ž¡‘This–¨Þfeature“should“bšMÞe“considered“exp˜erimenš²!tal,‘©|but“y˜ou“should“expMÞect“it“to“w˜ork.‘åDSuggestionsŽ¦for›¦fw•²!a“ys˜to˜impro“v“e˜it˜are˜w“elcome.ŽŸ&ëE3.7‘™Calling‘¦MF‘þ¦functionsŽŽŸD‘ÝA‘ºáfunction–º Ýis“a“name“for“a“particular“calculation.‘ Because“it“has“a“name,‘¿yš²!ou“can“ask“for“it“b˜yŽ¦name–°at“anš²!y“pMÞoin˜t“in“the“program.‘úûF‘ÿeor“example,‘²ˆthe“function“Þsqrt“Ýcomputes“the“square“roMÞot“of“aŽ¦n•²!um“bMÞer.Ž¡‘A‘÷ï xed–øset“of“functions“are“ábuilt-inÝ,‘ kwhicš²!h“means“they“are“a˜v‘ÿdDailable“in“ev˜ery“Octa˜v˜e“program.Ž¦The–Ç`Þsqrt“Ýfunction“is“one“of“these.‘@ÌIn“addition,‘ÏŸyš²!ou“can“de ne“y˜our“o˜wn“functions.‘@ÌSee“Chapter“5Ž¦[F‘ÿeunctions–¦fand“Scripts],“page“49,“for“information“abMÞout“ho²!w“to“do“this.Ž¡‘The›8w•²!a“y˜to˜use˜a˜function˜is˜with˜a˜áfunction˜call‘|ŠÝexpression,‘,¨whic“h˜consists˜of˜the˜function˜nameŽ¦follo•²!w“ed›»ÿb“y˜a˜list˜of˜áargumen“ts‘/Ýin˜paren“theses.‘©The˜argumen“ts˜are˜expressions˜whic“h˜giv“e˜the˜ra“wŽ¦materials–m£for“the“calculation“that“the“function“will“do.‘3•When“there“is“more“than“one“argumen²!t,Ž¦they–¼Áare“separated“bš²!y“commas.‘ îIf“there“are“no“argumen˜ts,‘ÂXy˜ou“can“omit“the“paren˜theses,‘ÂXbut“it“isŽŽŸŒ‹ †ŸòÝ30’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐa›J5go•MÞo“d˜idea˜to˜include˜them˜an•²!yw“a“y‘ÿe,‘\¥to˜clearly˜indicate˜that˜a˜function˜call˜w“as˜in“tended.‘¿"Here˜areŽ©some‘¦fexamples:ŽŸ«®‘èUÞsqrt–¿ª(x^2“+“y^2)‘"}ü#“ÝOne‘¦fargumen²!tŽ¤ ‘èUÞones–¿ª(n,“m)‘?“0)Ž¡‘3æýdisp‘¿ª(x);Ž¡‘(g©endwhileŽ¡‘èUendfunctionŽŸ«®Ýdisplaš²!ys–vthe“v‘ÿdDalue“of“the“ rst“argumen˜t“án“Ýtimes.‘ 7 In“this“function,‘v:the“v‘ÿdDariable“án“Ýis“used“as“aŽ¦tempMÞorary–îv‘ÿdDariable“without“haš²!ving“to“w˜orry“that“its“v‘ÿdDalue“migh˜t“also“c˜hange“in“the“calling“function.ŽŽŸŒ‹(çŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ31ŽŽŽ ƒ3Ú ý¨ðÐCall–É)bš²!y“v‘ÿdDalue“is“also“useful“bMÞecause“it“is“alw˜a˜ys“pMÞossible“to“pass“constan˜ts“for“an˜y“function“parameterŽ¤without–¦f rst“ha²!ving“to“determine“that“the“function“will“not“attempt“to“moMÞdify“the“parameter.Ž©D•‘The–Ýçcaller“maš²!y“use“a“v‘ÿdDariable“as“the“expression“for“the“argumen˜t,‘ëÈbut“the“called“function“doMÞesŽ¡not–ðjknoš²!w“this:‘qæit“only“kno˜ws“what“v‘ÿdDalue“the“argumen˜t“had.‘»êF‘ÿeor“example,‘ëgiv˜en“a“function“calledŽ¡asŽŸD•‘èUÞfoo–¿ª=“"bar";ŽŸ ‘èUfcn‘¿ª(foo)Ž¦Ýyš²!ou–›should“not“think“of“the“argumen˜t“as“bMÞeing“\the“v‘ÿdDariable“ÞfooÝ."‘ÚInstead,‘Wthink“of“the“argumen˜tŽ¡as–¦fthe“string“v‘ÿdDalue,“Þ"bar"Ý.ŽŸÍÀëM3.7.2‘d(RecursionŽŽŸD•‘ÝRecursivš²!e–çfunction“calls“are“allo˜w˜ed.‘¬A‘Áárecursiv˜e“function“Ýis“one“whic˜h“calls“itself,‘.Íeither“directlyŽ¡or›¦findirectly–ÿe.‘ÝÝF“or˜example,˜here˜is˜an˜inecien•²!tŸü¾®1Ž‘"ÙÝw“a“y˜to˜compute˜the˜factorial˜of˜a˜giv“en˜in“teger:ŽŸD•‘èUÞfunction–¿ªretval“=“fact“(n)Ž¤ ‘(g©if–¿ª(n“>“0)Ž¡‘3æýretval–¿ª=“n“*“fact“(n-1);Ž¡‘(g©elseŽ¡‘3æýretval–¿ª=“1;Ž¡‘(g©endifŽ¡‘èUendfunctionŽ¦‘ÝThis–ô³function“is“recursivš²!e“bMÞecause“it“calls“itself“directly‘ÿe.‘ÈÄIt“ev˜en˜tually“terminates“bMÞecause“eac˜hŽ¤time–û it“calls“itself,‘3it“uses“an“argumenš²!t“that“is“one“less“than“w˜as“used“for“the“previous“call.‘ÛÉOnceŽ¡the–¦fargumen²!t“is“no“longer“greater“than“zero,“it“doMÞes“not“call“itself,“and“the“recursion“ends.Ž¦‘There–) is“curren²!tly“no“limit“on“the“recursion“depth,‘Šnso“in nite“recursion“is“pMÞossible.‘ gŒIf“thisŽ¡happMÞens,‘z—Octa•²!v“e–o£will“consume“more“and“more“memory“attempting“to“store“in²!termediate“v‘ÿdDalues“forŽ¡eacš²!h–ïfunction“call“con˜text“un˜til“there“are“no“more“resources“a˜v‘ÿdDailable.‘ ¼This“is“ob˜viously“undesirable,Ž¡and–will“probably“bMÞe“ xed“in“some“future“vš²!ersion“of“Octa˜v˜e“b˜y“allo˜wing“users“to“spMÞecify“a“maxim˜umŽ¡allo•²!w“able–¦frecursion“depth.ŽŸ!VëE3.8‘™Global‘¦MV‘þ¦fariablesŽŽŸD•‘ÝA‘†v‘ÿdDariable–† that“has“bšMÞeen“declared“áglobal‘ô]Ýma²!y“b˜e“accessed“from“within“a“function“b˜o˜dy“withoutŽ¡ha²!ving–¦fto“pass“it“as“a“formal“parameter.Ž¦‘A‘óv‘ÿdDariable–ó'maš²!y“bMÞe“declared“global“using“a“Þglobal“Ýdeclaration“statemen˜t.‘Ä!The“follo˜wing“state-Ž¡men²!ts–¦fare“all“global“declarations.ŽŸD•‘èUÞglobal‘¿ªaŽŸ ‘èUglobal–¿ªb“=“2ŽŸ 竉ffŠ=Ÿ 9•‘ óŸü¾®1ŽŽ‘ÝIt–íéwš²!ould“bMÞe“m˜uc˜h“bMÞetter“to“use“Þprod›¦f(1:n)Ý,‘?Êor“Þgamma˜(n+1)“Ýinstead,‘?Êafter“ rst“c•²!hec“king‘íétoŽ¡‘ensure–¦fthat“the“v‘ÿdDalue“Þn“Ýis“actually“a“pMÞositivš²!e“in˜teger.ŽŽŸŒ‹ 4ŸòÝ32’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞglobal–¿ªc“=“3,“d,“e“=“5Ž©îÍ‘ÝIt–›his“necessary“declare“a“v‘ÿdDariable“as“global“within“a“function“b•MÞo“dy–›hin“order“to“access“it.‘¼ãF‘ÿeorŽŸexample,ŽŸîÍ‘èUÞglobal‘¿ªxŽ¤ ‘èUfunction–¿ªf“()Ž¡‘èUx–¿ª=“1;Ž¡‘èUendfunctionŽ¡‘èUf‘¿ª()Ž¦ÝdoMÞes–Wlánot‘”lÝset“the“v›ÿdDalue“of“the“global“v˜ariable“`ÞxÝ'“to“1.‘ððIn“order“to“c²!hange“the“v˜alue“of“the“globalŽŸv‘ÿdDariable–¦f`ÞxÝ',“yš²!ou“m˜ust“also“declare“it“to“bšMÞe“global“within“the“function“b˜o˜dy‘ÿe,“lik²!e“thisŽŸîÍ‘èUÞfunction–¿ªf“()Ž¡‘(g©global‘¿ªx;Ž¡‘(g©x–¿ª=“1;Ž¡‘èUendfunctionŽ¦‘ÝPš²!assing–Wa“global“v‘ÿdDariable“in“a“function“parameter“list“will“mak˜e“a“loMÞcal“cop˜y“and“not“moMÞdify“theŽŸglobal–¦fv‘ÿdDalue.‘ÝÝF‘ÿeor“example:Ž©îÍ‘èUÞoctave:1>–¿ªfunction“f“(x)Ž¡‘èU>–¿ªx“=“3Ž¡‘èU>‘¿ªendfunctionŽ¡‘èUoctave:2>–¿ªglobal“x“=“0Ž¡‘èUoctave:3>–¿ªx‘P{L#“This“is“the“value“of“the“global“variable.Ž¡‘èUx–¿ª=“0Ž¡‘èUoctave:4>–¿ªf“(x)Ž¡‘èUx–¿ª=“3‘rùH#“The“value“of“the“local“variable“x“is“3.Ž¡‘èUoctave:5>–¿ªx‘P{L#“But“it“was“a“*copy*“so“the“global“variableŽ¡‘èUx–¿ª=“0‘rùH#“remains“unchanged.ŽŸ+»2ëE3.9‘™KeywŒÌordsŽŽŸîÍ‘ÝThe–¦ffolloš²!wing“iden˜ti ers“are“k˜eyw˜ords,“and“ma˜y“not“bMÞe“used“as“v‘ÿdDariable“or“function“names:Ž¦‘èUÞbreak‘(=¦endfor‘3¼úfunction‘þ¨returnŽ¡‘èUcontinue–þ¨endfunction“global‘"}üwhileŽ¡‘èUelse‘-ýPendif‘9|¤gplotŽ¡‘èUelseif‘"}üendwhile‘(=¦gsplotŽ¡‘èUend‘3¼úfor‘DûøifŽŸîÍ‘ÝThe–Nfolloš²!wing“command-lik˜e“functions“are“also“k˜eyw˜ords,‘wûand“ma˜y“not“bMÞe“used“as“v‘ÿdDariable“orŽŸfunction‘¦fnames:Ž¦‘èUÞcasesen‘>þdocument–(=¦history“setŽ¡‘èUcd‘-ýPedit_history‘>þload‘9|¤showŽ¡‘èUclear‘¾Rhelp‘?þsaveŽŽŸŒ‹!?fŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ33ŽŽŽ ƒ3Ú ý¨ðÐëE3.10‘™Arithmetic‘¦MOps3eratorsŽŽŸ(z‘ÝThe–¦ffolloš²!wing“arithmetic“opMÞerators“are“a˜v‘ÿdDailable,“and“w˜ork“on“scalars“and“matrices.ŽŸPôáx‘gÅÞ+‘¦fáyŽŽ‘9ÐóÝAddition.‘ƒ“If–Ý£bšMÞoth“op˜erands“are“matrices,‘ërthe“n•²!um“b˜er–Ý£of“roš²!ws“and“columns“m˜ust“bMÞothŽ¤‘9Ðóagree.‘`If–|tone“opMÞerand“is“a“scalar,‘±÷its“v‘ÿdDalue“is“added“to“all“the“elemen²!ts“of“the“otherŽ¡‘9ÐóopMÞerand.Ž¤Pôáx‘gÅÞ.+‘¦fáyŽŽ‘9ÐóÝElemen•²!t›¦fb“y˜elemen“t˜addition.‘ÝÝThis˜opMÞerator˜is˜equiv‘ÿdDalen“t˜to˜Þ+Ý.Ž¡áx‘gÅÞ-‘¦fáyŽŽ‘9ÐóÝSubtraction.‘³If–íwbšMÞoth“op˜erands“are“matrices,‘ÿ;the“n•²!um“b˜er–íwof“ro²!ws“and“columns“of“b˜othŽ©‘9Ðóm²!ust‘¦fagree.Ž¡áx‘gÅÞ.-‘¦fáyŽŽ‘9ÐóÝElemen•²!t›¦fb“y˜elemen“t˜subtraction.‘ÝÝThis˜opMÞerator˜is˜equiv‘ÿdDalen“t˜to˜Þ-Ý.Ž¡áx‘gÅÞ*‘¦fáyŽŽ‘9ÐóÝMatrix–!mš²!ultiplication.‘M®The“n˜um˜bMÞer“of“columns“of“`ÞxÝ'“m˜ust“agree“with“the“n˜um˜bMÞer“ofŽ¦‘9Ðóro²!ws–¦fof“`ÞyÝ'.Ž¡áx‘gÅÞ.*‘¦fáyŽŽ‘9ÐóÝElemen•²!t›e{b“y˜elemen“t˜m“ultiplication.‘È9If˜b•MÞoth˜op“erands˜are˜matrices,‘rwthe˜n•²!um“bMÞer˜of˜ro“wsŽ¦‘9Ðóand–¦fcolumns“m²!ust“bMÞoth“agree.Ž¡áx‘gÅÞ/‘¦fáyŽŽ‘9ÐóÝRighš²!t–¦fdivision.‘ÝÝThis“is“conceptually“equiv‘ÿdDalen˜t“to“the“expressionŽŸ(z‘V¹HÞ(inverse–¿ª(y')“*“x')'Ž¤(z‘9ÐóÝbut–¦fit“is“computed“without“forming“the“in•²!v“erse–¦fof“`Þy'Ý'.Ž¡‘9ÐóIf–OIthe“system“is“not“square,›yor“if“the“coMÞecien²!t“matrix“is“singular,˜a“minim²!um“normŽ¦‘9Ðósolution–¦fis“computed.Ž¤Pôáx‘gÅÞ./‘¦fáyŽŽ‘9ÐóÝElemen•²!t›¦fb“y˜elemen“t˜righ“t˜division.Ž¡áx‘gÅÞ\‘¦fáyŽŽ‘9ÐóÝLeft–¦fdivision.‘ÝÝThis“is“conceptually“equiv‘ÿdDalen²!t“to“the“expressionŽŸ(z‘V¹HÞinverse–¿ª(x)“*“yŽ¤(z‘9ÐóÝbut–¦fit“is“computed“without“forming“the“in•²!v“erse–¦fof“`ÞxÝ'.Ž¡‘9ÐóIf–OIthe“system“is“not“square,›yor“if“the“coMÞecien²!t“matrix“is“singular,˜a“minim²!um“normŽ¦‘9Ðósolution–¦fis“computed.Ž¤Pôáx‘gÅÞ.\‘¦fáyŽŽ‘9ÐóÝElemen•²!t›q{b“y˜elemen“t˜left˜division.‘Ì9Eac“h˜elemen“t˜of˜`ÞyÝ'˜is˜divided˜b“y˜eac“h˜correspMÞondingŽ¦‘9Ðóelemen²!t–¦fof“`ÞxÝ'.Ž¡áx‘gÅÞ^‘¦fáyŽŽŽ¦x‘gÅÞ**‘¦fáyŽŽ‘9ÐóÝP•²!o“w“er–õ¿opšMÞerator.‘¢ûIf“áx‘·Ýand“áy‘å×Ýare“b˜oth“scalars,‘this“op˜erator“returns“áx‘·Ýraised“to“the“p˜o•²!w“erŽ¦‘9ÐóáyÝ.‘ѬIf–Òáx‘C1Ýis“a“scalar“and“áy‘qêÝis“a“square“matrix,‘‰#the“result“is“computed“using“an“eigen²!v‘ÿdDalueŽ¦‘9Ðóexpansion.›³¹If–'úáx‘éYÝis“a“square“matrix.˜the“result“is“computed“bš²!y“repMÞeated“m˜ultiplication“ifŽ¦‘9Ðóáy‘Ýis–ían“inš²!teger,‘•9and“b˜y“an“eigen˜v‘ÿdDalue“expansion“if“áy‘Ýis“not“an“in˜teger.‘ÖµAn“error“resultsŽ¦‘9Ðóif–¦fbMÞoth“áx‘gÅÝand“áy‘–~Ýare“matrices.ŽŸ(z‘9ÐóThe–¦fimplemen²!tation“of“this“opšMÞerator“needs“to“b˜e“impro•²!v“ed.Ž¡áx‘gÅÞ.^‘¦fáyŽŽŽŽŸŒ‹"F®ŸòÝ34’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐáx‘gÅÞ.**‘¦fáyŽŽ‘9ÐóÝElemen•²!t›îùb“y˜elemen“t˜pMÞo“w“er˜op•MÞerator.‘ ¹If˜b“oth˜op“erands˜are˜matrices,‘¨the˜n•²!um“bMÞer˜of˜ro“wsŽ©‘9Ðóand–¦fcolumns“m²!ust“bMÞoth“agree.Ž¤VXÞ-áxŽŽ‘9ÐóÝNegation.Ž¡Þ+áxŽŽ‘9ÐóÝUnary–¦fplus.‘ÝÝThis“opšMÞerator“has“no“e ect“on“the“op˜erand.Ž¡áx‘Á_Þ'ŽŽ‘9ÐóÝComplex–¦:conjugate“transpšMÞose.‘ÝZF‘ÿeor“real“argumen²!ts,‘æ/this“op˜erator“is“the“same“as“theŽ¦‘9Ðótransp•MÞose›¶õop“erator.‘‹F‘ÿeor˜complex˜argumen²!ts,‘»this˜op“erator˜is˜equiv‘ÿdDalen²!t˜to˜the˜expres-Ž¦‘9ÐósionŽŸ+,‘V¹HÞconj‘¿ª(x.')Ž¡áxÞ.'ŽŽ‘9ÐóÝT‘ÿeranspMÞose.ŽŸVX‘Note–$othat“bMÞecause“Octa•²!v“e's›$oelemen“t˜b“y˜elemen“t˜op•MÞerators˜b“egin˜with˜a˜`Þ.Ý',‘Cñthere˜is˜a˜p“ossibleŽ¦am•²!biguit“y–¦ffor“statemenš²!ts“lik˜eŽ¤+,‘èUÞ1./mŽŸ+,ÝbšMÞecause– Éthe“p˜erio˜d“could“b˜e“inš²!terpreted“either“as“part“of“the“constan˜t“or“as“part“of“the“opMÞerator.Ž¦T‘ÿeo–¦fresolvš²!e“this“con ict,“Octa˜v˜e“treats“the“expression“as“if“y˜ou“had“t˜ypMÞedŽ¡‘èUÞ(1)–¿ª./“mŽ©+,Ýand‘¦fnotŽ¡‘èUÞ(1.)–¿ª/“mŽ¦ÝAlthough–ÚMthis“is“inconsistenš²!t“with“the“normal“bMÞeha˜vior“of“Octa˜v˜e's“lexer,‘çGwhic˜h“usually“prefers“toŽ¤break–œ¨the“input“inš²!to“tok˜ens“b˜y“preferring“the“longest“pMÞossible“matc˜h“at“an˜y“giv˜en“pMÞoin˜t,‘ž›it“is“moreŽ¡useful–¦fin“this“case.ŽŸ ¬±ëE3.11‘™Comparison‘¦MOps3eratorsŽŽŸ+,‘áComparison–.!opMÞerators‘¡£Ýcompare“nš²!umeric“v‘ÿdDalues“for“relationships“suc˜h“as“equalit˜y‘ÿe.‘ uThey“areŽ¡written–¦fusing“árelational“opšMÞeratorsÝ,“whic²!h“are“a“sup˜erset“of“those“in“C.Ž¦‘All–û¯of“Octa•²!v“e's–û¯comparison“opMÞerators“return“a“v‘ÿdDalue“of“1“if“the“comparison“is“true,‘or“0“if“it“isŽ¡false.‘ÁF‘ÿeor–Gwmatrix“v‘ÿdDalues,‘o»they“all“wš²!ork“on“an“elemen˜t-b˜y-elemen˜t“basis.‘ÁF‘ÿeor“example,‘o»ev‘ÿdDaluatingŽ¡the‘¦fexpressionŽ¤+,‘èUÞ[1,–¿ª2;“3,“4]“==“[1,“3;“2,“4]Ž¦Ýreturns–¦fthe“resultŽ¡‘èUÞans‘¿ª=ŽŸ‘(g©1‘ T0ŽŸ ‘(g©0‘ T1ŽŸVXáx‘gÅÞ<‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“less“than“áyÝ.ŽŸVXáx‘gÅÞ<=‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“less“than“or“equal“to“áyÝ.ŽŽŸŒ‹#QìŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ35ŽŽŽ ƒ3Ú ý¨ðÐáx‘gÅÞ==‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“equal“to“áyÝ.Ž¤šáx‘gÅÞ>=‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“greater“than“or“equal“to“áyÝ.Ž¡áx‘gÅÞ>‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“greater“than“áyÝ.Ž¡áx‘gÅÞ!=‘¦fáyŽŽŽ¤x‘gÅÞ~=‘¦fáyŽŽŽ¡x‘gÅÞ<>‘¦fáyŽŽ‘9ÐóÝT‘ÿerue–¦fif“áx‘gÅÝis“not“equal“to“áyÝ.ŽŸš‘F‘ÿeor–óòmatrix“and“vš²!ector“argumen˜ts,‘Uthe“abMÞo˜v˜e“table“should“bMÞe“read“as“\an“elemen˜t“of“the“resultŽ¡matrix–Nƒ(vš²!ector)“is“true“if“the“correspMÞonding“elemen˜ts“of“the“argumen˜t“matrices“(v˜ectors)“satisfy“theŽ¡spMÞeci ed‘¦fcondition"Ž©‹M‘String–§comparisons“should“bšMÞe“p˜erformed“with“the“Þstrcmp“Ýfunction,‘çGnot“with“the“comparisonŽ¡opšMÞerators–¦flisted“ab˜o•²!v“e.‘ÝÝSee–¦fSection“3.7“[Calling“F‘ÿeunctions],“page“29.ŽŸ"-3ëE3.12‘™Bos3olean‘¦MExpressionsŽŽŸ#¡æëM3.12.1‘d(Elemen•–át-b“y-elemen“t–¦MBošiolean“Op˜eratorsŽŽŸ‹M‘ÝAn›Ì÷elemen•²!t-b“y-elemen“t˜áb•MÞo“olean˜expression˜Ýis˜a˜com•²!bination˜of˜comparison˜expressions˜or˜matc“h-Ž¡ing–¡ expressions,‘ßÎusing“the“b•MÞo“olean›¡ op“erators˜\or"˜(`Þ|Ý'),–ßÎ\and"˜(`Þ&Ý'),“and˜\not"˜(`Þ!Ý'),“along˜withŽ¡parenš²!theses–‚.to“con˜trol“nesting.‘ÑËThe“truth“of“the“b•MÞo“olean–‚.expression“is“computed“b˜y“com˜bining“theŽ¡truth–Èv‘ÿdDalues“of“the“correspšMÞonding“elemen²!ts“of“the“comp˜onen²!t“expressions.‘Ö¨A‘Ãv‘ÿdDalue“is“considered“toŽ¡bMÞe–¦ffalse“if“it“is“zero,“and“true“otherwise.Ž¦‘Elemen•²!t-b“y-elemen“t›6Sb•MÞo“olean˜expressions˜can˜b“e˜used˜wherev²!er˜comparison˜expressions˜can˜b“eŽ¡used.›óÉThey–­µcan“bMÞe“used“in“Þif“Ýand“Þwhile“Ýstatemen•²!ts.˜Ho“w“ev“er,‘¯ˆb•MÞefore›­µb“eing˜used˜in˜the˜conditionŽ¡of–åan“Þif“Ýor“Þwhile“Ýstatemenš²!t,‘1Åan“implicit“con˜v˜ersion“from“a“matrix“v›ÿdDalue“to“a“scalar“v˜alue“oMÞccursŽ¡using–the“equiv›ÿdDalen²!t“of“Þall–¦f(all“(áx‘Á_Þ))Ý.‘F‚That–is,‘<ªa“v˜alue“used“as“the“condition“in“an“Þif“Ýor“ÞwhileŽ¡Ýstatemenš²!t–¦fis“only“true“if“áall‘¸Ýof“its“elemen˜ts“are“nonzero.Ž¦‘Likš²!e–P|comparison“opMÞerations,‘aªeac˜h“elemen˜t“of“an“elemen˜t-b˜y-elemen˜t“b•MÞo“olean–P|expression“also“hasŽ¡a–¾nš²!umeric“v‘ÿdDalue“(1“if“true,‘Ÿy0“if“false)“that“comes“in˜to“pla˜y“if“the“result“of“the“b•MÞo“olean–¾expression“isŽ¡stored–¦fin“a“v‘ÿdDariable,“or“used“in“arithmetic.Ž¦‘Here–¦fare“descriptions“of“the“three“elemen•²!t-b“y-elemen“t›¦fb•MÞo“olean˜op“erators.ŽŸšáb•MÞo“olean1‘…ŸÞ&‘¦fáb“o“olean2Ž¡‘9ÐóÝElemen²!ts–¢Àof“the“result“are“true“if“bšMÞoth“corresp˜onding“elemen²!ts“of“áb˜o˜olean1‘ùÝand“áb˜o˜olean2Ž¡‘9ÐóÝare‘¦ftrue.ŽŸšáb•MÞo“olean1‘…ŸÞ|‘¦fáb“o“olean2Ž¡‘9ÐóÝElemenš²!ts–öÇof“the“result“are“true“if“either“of“the“correspMÞonding“elemen˜ts“of“áb•MÞo“olean1‘ÖÝorŽ¡‘9Ðóáb•MÞo“olean2‘…ŸÝis‘¦ftrue.ŽŽŸŒ‹$ZšŸòÝ36’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞ!‘¦fáb•MÞo“oleanŽŽŽ¤Þ~‘¦fáb•MÞo“oleanŽŽ‘9ÐóÝEac•²!h›¦felemen“t˜of˜the˜result˜is˜true˜if˜the˜correspMÞonding˜elemen“t˜of˜áb•MÞo“olean˜Ýis˜false.ŽŸ£H‘F‘ÿeor–4matrix“opšMÞerands,‘W€these“op˜erators“wš²!ork“on“an“elemen˜t-b˜y-elemen˜t“basis.‘†éF‘ÿeor“example,‘W€theŽ¡expressionŽ©Q¤‘èUÞ[1,–¿ª0;“0,“1]“&“[1,“0;“2,“3]Ž¤Q¤Ýreturns–¦fa“t•²!w“o›¦fb“y˜t“w“o˜iden“tit“y˜matrix.Ž¡‘F‘ÿeor–ˆŽthe“binary“opšMÞerators,‘Ž†the“dimensions“of“the“op˜erands“m²!ust“conform“if“b˜oth“are“matrices.‘ÓêIfŽ¤one–2Áof“the“opšMÞerands“is“a“scalar“and“the“other“a“matrix,‘UØthe“op˜erator“is“applied“to“the“scalar“andŽ¡eac•²!h›¦felemen“t˜of˜the˜matrix.ŽŸQ¤‘F‘ÿeor–Çïthe“binary“elemen•²!t-b“y-elemen“t›Çïb•MÞo“olean˜op“erators,‘Pb“oth˜sub“expressions˜áb“o“olean1‘§(ÝandŽ¡áb•MÞo“olean2‘ØüÝare–ùÃev‘ÿdDaluated“bMÞefore“computing“the“result.‘×óThis“can“mak²!e“a“di erence“when“the“ex-Ž¡pressions›¦fha•²!v“e˜side˜e ects.‘ÝÝF‘ÿeor˜example,˜in˜the˜expressionŽ¦‘èUÞa–¿ª&“b++Ž¤Q¤Ýthe–¦fv›ÿdDalue“of“the“v˜ariable“áb‘ä Ýis“incremenš²!ted“ev˜en“if“the“v‘ÿdDariable“áa“Ýis“zero.Ž¡‘This–Ö”bšMÞeha²!vior“is“necessary“for“the“b˜o˜olean“op˜erators“to“w²!ork“as“describ˜ed“for“matrix-v‘ÿdDaluedŽ¤opMÞerands.ŽŸôíëM3.12.2‘d(Short-circuit–¦MBošiolean“Op˜eratorsŽŽŸQ¤‘ÝComš²!bined–w†with“the“implicit“con˜v˜ersion“to“scalar“v‘ÿdDalues“in“Þif“Ýand“Þwhile“Ýconditions,‘«ÍOcta˜v˜e'sŽ¡elemen•²!t-b“y-elemen“t›AWb•MÞo“olean˜op“erators˜are˜often˜sucien²!t˜for˜p“erforming˜most˜logical˜op“erations.Ž¡Ho•²!w“ev“er,‘90it–Ôis“sometimes“desirable“to“stop“ev‘ÿdDaluating“a“b•MÞo“olean–Ôexpression“as“soMÞon“as“the“o•²!v“erallŽ¡truth–¦fv‘ÿdDalue“can“bšMÞe“determined.‘ÝÝOcta•²!v“e's–¦fáshort-circuit‘ãfÝb˜o˜olean“op˜erators“wš²!ork“this“w˜a˜y‘ÿe.Ž©£Háb•MÞo“olean1‘…ŸÞ&&‘¦fáb“o“olean2Ž¡‘9ÐóÝThe–j expression“áb•MÞo“olean1‘IEÝis–j ev›ÿdDaluated“and“con•²!v“erted–j to“a“scalar“using“the“equiv˜alen²!tŽ¡‘9Ðóof–‘ the“opšMÞeration“Þall–¦f(all“(áb˜o˜olean1‘ß9Þ))Ý.‘ÈIf–‘ it“is“false,‘˲the“result“of“the“expression“isŽ¡‘9Ðó0.‘ÐèIf–L¿it“is“true,‘vUthe“expression“áb•MÞo“olean2‘+øÝis–L¿ev‘ÿdDaluated“and“con•²!v“erted–L¿to“a“scalar“usingŽ¡‘9Ðóthe–4equiv‘ÿdDalen²!t“of“the“opšMÞeration“Þall–¦f(all“(áb˜o˜olean1‘ß9Þ))Ý.‘†þIf–4it“is“true,‘W‰the“result“of“theŽ¡‘9Ðóexpression–¦fis“1.‘ÝÝOtherwise,“the“result“of“the“expression“is“0.ŽŸ£Háb•MÞo“olean1‘…ŸÞ||‘¦fáb“o“olean2Ž¡‘9ÐóÝThe–j expression“áb•MÞo“olean1‘IEÝis–j ev›ÿdDaluated“and“con•²!v“erted–j to“a“scalar“using“the“equiv˜alen²!tŽ¡‘9Ðóof–«the“opšMÞeration“Þall–¦f(all“(áb˜o˜olean1‘ß9Þ))Ý.‘ëçIf–«it“is“true,‘ì?the“result“of“the“expression“isŽ¡‘9Ðó1.‘‹×If–5¹it“is“false,‘YŽthe“expression“áb•MÞo“olean2‘òÝis–5¹ev‘ÿdDaluated“and“con•²!v“erted–5¹to“a“scalar“usingŽ¡‘9Ðóthe–4equiv‘ÿdDalen²!t“of“the“opšMÞeration“Þall–¦f(all“(áb˜o˜olean1‘ß9Þ))Ý.‘†þIf–4it“is“true,‘W‰the“result“of“theŽ¡‘9Ðóexpression–¦fis“1.‘ÝÝOtherwise,“the“result“of“the“expression“is“0.Ž¦‘The–Tfact“that“bšMÞoth“op˜erands“ma²!y“not“b˜e“ev‘ÿdDaluated“b˜efore“determining“the“o•²!v“erall–Ttruth“v‘ÿdDalueŽ¡of–¦fthe“expression“can“bšMÞe“imp˜ortan²!t.‘ÝÝF‘ÿeor“example,“in“the“expressionŽŽŸŒ‹%eëŸòÝChapter‘¦f3:‘ÝÝExpressions’ZÇÀ37ŽŽŽ ƒ3Ú ý¨ðБèUÞa–¿ª&&“b++Ž¤Ö-Ýthe–¦fv›ÿdDalue“of“the“v˜ariable“áb‘ä Ýis“only“incremen²!ted“if“the“v˜ariable“áa“Ýis“nonzero.Ž¡‘This–¦fcan“bšMÞe“used“to“write“somewhat“more“concise“co˜de.‘ÝÝF‘ÿeor“example,“it“is“p˜ossible“writeŽ©Ö-‘èUÞfunction–¿ªf“(a,“b,“c)Ž¤ ‘(g©if–¿ª(nargin“>“2“&&“isstr“(c))Ž¡‘3æý...ŽŸÖ-Ýinstead–hof“haš²!ving“to“use“t˜w˜o“Þif“Ýstatemen˜ts“to“a˜v˜oid“attempting“to“ev‘ÿdDaluate“an“argumen˜t“thatŽŸdoMÞesn't‘¦fexist.Ž¦‘èUÞfunction–¿ªf“(a,“b,“c)Ž¡‘(g©if–¿ª(nargin“>“2)Ž¡‘3æýif–¿ª(isstr“(c))Ž¡‘?fQ...ŽŸ#XµëE3.13‘™AssignmenŒÌt‘¦MExpressionsŽŽŸÖ-‘ÝAn–S;áassignmenš²!t‘;Ýis“an“expression“that“stores“a“new“v‘ÿdDalue“in˜to“a“v‘ÿdDariable.‘ ä\F‘ÿeor“example,‘¾ptheŽ¤follo²!wing–¦fexpression“assigns“the“v›ÿdDalue“1“to“the“v˜ariable“ÞzÝ:Ž¦‘èUÞz–¿ª=“1Ž©Ö-‘ÝAfter–¶øthis“expression“is“executed,‘ûthe“v›ÿdDariable“Þz“Ýhas“the“v˜alue“1.‘”Whatev²!er“old“v˜alue“Þz“ÝhadŽ¡bMÞefore–¦fthe“assignmen²!t“is“forgotten.Ž¦‘Assignmenš²!ts–fÂcan“store“string“v‘ÿdDalues“also.‘ȦF‘ÿeor“example,‘s}the“follo˜wing“expression“w˜ould“store“theŽ¡v›ÿdDalue–¦fÞ"this“food“is“good"“Ýin“the“v˜ariable“ÞmessageÝ:ŽŸÖ-‘èUÞthing–¿ª=“"food"Ž¤ ‘èUpredicate–¿ª=“"good"Ž¡‘èUmessage–¿ª=“[“"this“"“,“thing“,“"“is“"“,“predicate“]Ž¦Ý(This–¦falso“illustrates“concatenation“of“strings.)Ž¦‘The–JÐ`Þ=Ý'“sign“is“called“an“áassignmenš²!t“opMÞeratorÝ.‘ËIt“is“the“simplest“assignmen˜t“opšMÞerator“b˜ecauseŽ¤the–¦fv‘ÿdDalue“of“the“righš²!t-hand“opMÞerand“is“stored“unc˜hanged.Ž¦‘Most–õ&opMÞerators“(addition,–™concatenation,“and–õ&so“on)“ha•²!v“e–õ&no“e ect“except“to“compute“a“v‘ÿdDalue.‘¢ÈIfŽ¡yš²!ou–®ignore“the“v‘ÿdDalue,‘¯þy˜ou“migh˜t“as“w˜ell“not“use“the“opMÞerator.‘ôãAn“assignmen˜t“opMÞerator“is“di eren˜t.Ž¡It–ÔödošMÞes“pro˜duce“a“v‘ÿdDalue,‘ ™but“evš²!en“if“y˜ou“ignore“the“v‘ÿdDalue,‘ ™the“assignmen˜t“still“mak˜es“itself“feltŽ¡through–¦fthe“alteration“of“the“v‘ÿdDariable.‘ÝÝW‘ÿee“call“this“a“áside“e ectÝ.Ž¦‘The–ôleft-hand“opšMÞerand“of“an“assignmen²!t“need“not“b˜e“a“v‘ÿdDariable“(see“Section“3.4“[V‘ÿeariables],Ž¡page– ­25).‘³It“can“also“bMÞe“an“elemen²!t“of“a“matrix“(see“Section“3.5“[Index“Expressions],‘&?page“26)“orŽ¡a–#Õlist“of“return“v›ÿdDalues“(see“Section“3.7“[Calling“F‘ÿeunctions],‘C1page“29).‘V*These“are“all“called“álv˜aluesÝ,Ž¡whicš²!h–©Lmeans“they“can“appMÞear“on“the“left-hand“side“of“an“assignmen˜t“opMÞerator.‘æThe“righ˜t-handŽ¡opšMÞerand–²Îma²!y“b˜e“an²!y“expression.‘It“pro˜duces“the“new“v‘ÿdDalue“whicš²!h“the“assignmen˜t“stores“in“theŽ¡spMÞeci ed–¦fv›ÿdDariable,“matrix“elemen²!t,“or“list“of“return“v˜alues.ŽŽŸŒ‹&réŸòÝ38’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБIt–]is“impMÞortanš²!t“to“note“that“v‘ÿdDariables“do“ánot‘N]Ýha˜v˜e“pMÞermanen˜t“t˜ypMÞes.‘ÂThe“t˜ypMÞe“of“a“v‘ÿdDariable“isŽ¤simply–pjthe“tš²!ypMÞe“of“whatev˜er“v‘ÿdDalue“it“happMÞens“to“hold“at“the“momen˜t.‘;èIn“the“follo˜wing“programŽ¡fragmenš²!t,–¦fthe“v‘ÿdDariable“Þfoo“Ýhas“a“n˜umeric“v›ÿdDalue“at“ rst,“and“a“string“v˜alue“later“on:ŽŸZ\‘èUÞoctave:13>–¿ªfoo“=“1Ž¤ ‘èUfoo–¿ª=“1Ž¡‘èUoctave:13>–¿ªfoo“=“"bar"Ž¡‘èUfoo–¿ª=“barŽ¤Z\ÝWhen–b ‘ÝY‘ÿeou– mcan“use“an“assignmenš²!t“an˜ywhere“an“expression“is“called“for.‘©ßF‘ÿeor“example,‘)Ÿit“is“v‘ÿdDalid“to“writeŽ¤Þx–¦f!=“(y“=“1)–E‘Ýto“set“Þy“Ýto“1“and“then“test“whether“Þx“Ýequals“1.‘½–But“this“stš²!yle“tends“to“mak˜e“programsŽ¡hard–w“to“read.‘QeExcept“in“a“one-shot“program,‘«Þyš²!ou“should“rewrite“it“to“get“rid“of“suc˜h“nesting“ofŽ¡assignmenš²!ts.‘ÝÝThis–¦fis“nev˜er“v˜ery“hard.ŽŸ ø1ëE3.14‘™IncremenŒÌt‘¦MOps3eratorsŽŽŸ> ‘áIncremen²!t–øopMÞerators‘lÝincrease“or“decrease“the“v›ÿdDalue“of“a“v˜ariable“bš²!y“1.‘£ëThe“opMÞerator“to“incremen˜tŽ¡a– fv‘ÿdDariable“is“written“as“`Þ++Ý'.‘ÞIt“maš²!y“bMÞe“used“to“incremen˜t“a“v‘ÿdDariable“either“bMÞefore“or“after“takingŽ¡its‘¦fv‘ÿdDalue.Ž¦‘F‘ÿeor–+hexample,›L¨to“pre-incremen²!t“the“v‘ÿdDariable“áxÝ,˜yš²!ou“w˜ould“write“Þ++áx‘Á_Ý.‘lãThis“w˜ould“add“one“to“áxŽ¡Ýand–&9then“return“the“new“v‘ÿdDalue“of“áx‘ç˜Ýas“the“result“of“the“expression.‘]WIt“is“exactly“the“same“as“theŽ¡expression–¦fáx›gÅÞ=“áx˜Þ+“1Ý.Ž¦‘T‘ÿeo–ÐfpMÞost-incremenš²!t“a“v‘ÿdDariable“áxÝ,‘æy˜ou“w˜ould“write“áx‘Á_Þ++Ý.‘[ÝThis“adds“one“to“the“v‘ÿdDariable“áxÝ,‘æbutŽ¡returns–œ©the“v‘ÿdDalue“that“áx›^Ýhad“prior“to“incremen²!ting“it.‘ÚžF‘ÿeor“example,‘ž›if“áx˜Ýis“equal“to“2,‘ž›the“result“ofŽ¡the–¦fexpression“áx‘Á_Þ++“Ýis“2,“and“the“new“v‘ÿdDalue“of“áx‘gÅÝis“3.Ž¦‘F‘ÿeor–"Jmatrix“and“vš²!ector“argumen˜ts,‘<¶the“incremen˜t“and“decremen˜t“opMÞerators“w˜ork“on“eac˜h“elemen˜tŽ¡of–¦fthe“opMÞerand.Ž¦‘Here–¦fis“a“list“of“all“the“incremenš²!t“and“decremen˜t“expressions.ŽŸ|Þ++áxŽŽ‘9ÐóÝThis–ðexpression“incremen²!ts“the“v›ÿdDariable“áxÝ.‘® The“v˜alue“of“the“expression“is“the“ánew‘Ýv˜alueŽ¡‘9Ðóof–¦fáxÝ.‘ÝÝIt“is“equiv‘ÿdDalen²!t“to“the“expression“áx›gÅÞ=“áx˜Þ+“1Ý.Ž©|Þ--áxŽŽ‘9ÐóÝThis–óåexpression“decremen²!ts“the“v›ÿdDariable“áxÝ.‘¢]The“v˜alue“of“the“expression“is“the“ánew‘ãýÝv˜alueŽ¡‘9Ðóof–¦fáxÝ.‘ÝÝIt“is“equiv‘ÿdDalen²!t“to“the“expression“áx›gÅÞ=“áx˜Þ-“1Ý.Ž¦áx‘Á_Þ++ŽŽ‘9ÐóÝThis–ù£expression“causes“the“v›ÿdDariable“áx‘»Ýto“bMÞe“incremen²!ted.‘דThe“v˜alue“of“the“expressionŽ¡‘9Ðóis–¦fthe“áold‘¸Ýv‘ÿdDalue“of“áxÝ.Ž¦áxÞ--ŽŽ‘9ÐóÝThis–Ú}expression“causes“the“v›ÿdDariable“áx‘›ÜÝto“bMÞe“decremen²!ted.‘z#The“v˜alue“of“the“expressionŽ¡‘9Ðóis–¦fthe“áold‘¸Ýv‘ÿdDalue“of“áxÝ.ŽŸ|‘It–jkis“not“currenš²!tly“pMÞossible“to“incremen˜t“index“expressions.‘ÉßF‘ÿeor“example,‘vjy˜ou“migh˜t“expMÞect“thatŽ¡the–sexpression“áv‘ðÞ(4)++“Ýwš²!ould“incremen˜t“the“fourth“elemen˜t“of“the“v˜ector“ávÝ,‘;7but“instead“it“resultsŽ¡in–¦fa“parse“error.‘ÝÝThis“problem“maš²!y“bMÞe“ xed“in“a“future“release“of“Octa˜v˜e.ŽŸ ø1ëE3.15‘™Ops3erator‘¦MPrecedenceŽŽŸ> ‘áOpšMÞerator–uŠprecedence‘‘Ýdetermines“ho²!w“op˜erators“are“group˜ed,‘©Rwhen“di eren²!t“op˜erators“app˜earŽ¡close–çb²!y“in“one“expression.›ŸëF‘ÿeor“example,‘÷A`Þ*Ý'“has“higher“precedence“than“`Þ+Ý'.˜Th²!us,‘÷Athe“expressionŽ¡Þa–¦f+“b“*“c“Ýmeans“to“m²!ultiply“Þb“Ýand“ÞcÝ,“and“then“add“Þa“Ýto“the“proMÞduct“(i.e.,“Þa“+“(b“*“c)Ý).ŽŽŸŒ‹(‡ŸòÝ40’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБY‘ÿeou–@¯can“o•²!v“errule–@¯the“precedence“of“the“opMÞerators“bš²!y“using“paren˜theses.‘¬¸Y‘ÿeou“can“think“of“theŽ¤precedence–%›rules“as“saš²!ying“where“the“paren˜theses“are“assumed“if“y˜ou“do“not“write“paren˜thesesŽ¡yš²!ourself.‘ àGIn–Qßfact,‘¼¼it“is“wise“to“use“paren˜theses“whenev˜er“y˜ou“ha˜v˜e“an“un˜usual“com˜bination“ofŽ¡op•MÞerators,‘Áb“ecause–»³other“pMÞeople“who“read“the“program“maš²!y“not“remem˜bMÞer“what“the“precedence“isŽ¡in–Îthis“case.‘©Y‘ÿeou“mighš²!t“forget“as“w˜ell,‘'†and“then“y˜ou“toMÞo“could“mak˜e“a“mistak˜e.‘©Explicit“paren˜thesesŽ¡will–¦fhelp“prev•²!en“t›¦fan“y˜suc“h˜mistak“e.Ž©‘When–î"opšMÞerators“of“equal“precedence“are“used“together,‘ýthe“leftmost“op˜erator“groups“ rst,‘ýexceptŽ¡for–Wbthe“assignmenš²!t,‘ƒ¡and“expMÞonen˜tiation“opMÞerators,‘ƒ¡whic˜h“group“in“the“oppMÞosite“order.‘ðÑTh˜us,‘ƒ¡theŽ¡expression–¦fÞa“-“b“+“c“Ýgroups“as“Þ(a“-“b)“+“cÝ,“but“the“expression“Þa“=“b“=“c“Ýgroups“as“Þa“=“(b“=“c)Ý.Ž¦‘The–å5precedence“of“pre x“unary“opšMÞerators“is“imp˜ortan²!t“when“another“op˜erator“follo²!ws“theŽ¡opšMÞerand.‘ÝÝF‘ÿeor–¦fexample,“Þ-x^2“Ýmeans“Þ-(x^2)Ý,“b˜ecause“`Þ-Ý'“has“lo•²!w“er–¦fprecedence“than“`Þ^Ý'.Ž¦‘Here–¦fis“a“table“of“the“opMÞerators“in“Octa•²!v“e,–¦fin“order“of“increasing“precedence.ŽŸÞstatement‘¦fseparatorsŽ¡‘9ÐóÝ`Þ;Ý',‘¦f`Þ,Ý'.Ž©ÞassignmentŽ¡‘9ÐóÝ`Þ=Ý'.‘ÝÝThis–¦fopMÞerator“groups“righ²!t“to“left.Ž¦Þlogical–¦f"or"“and“"and"Ž¡‘9ÐóÝ`Þ||Ý',‘¦f`Þ&&Ý'.Ž¦Þelement-wise–¦f"or"“and“"and"Ž¡‘9ÐóÝ`Þ|Ý',‘¦f`Þ&Ý'.Ž¦ÞrelationalŽ¡‘9ÐóÝ`Þ<Ý',–¦f`Þ<=Ý',“`Þ==Ý',“`Þ>=Ý',“`Þ>Ý',“`Þ!=Ý',“`Þ~=Ý',“`Þ<>Ý'.Ž¦ÞcolonŽŽ‘9ÐóÝ`Þ:Ý'.Ž¦Þadd,‘¦fsubtractŽ¡‘9ÐóÝ`Þ+Ý',‘¦f`Þ-Ý'.Ž¦Þmultiply,‘¦fdivideŽ¡‘9ÐóÝ`Þ*Ý',–¦f`Þ/Ý',“`Þ\Ý',“`Þ.\Ý',“`Þ.*Ý',“`Þ./Ý'.Ž¦ÞtransposeŽ¡‘9ÐóÝ`Þ'Ý',‘¦f`Þ.'Ý'Ž¦Þunary–¦fplus,“minus,“increment,“decrement,“and“``not''Ž¡‘9ÐóÝ`Þ+Ý',–¦f`Þ-Ý',“`Þ++Ý',“`Þ--Ý',“`Þ!Ý',“`Þ~Ý'.Ž¦ÞexponentiationŽ¡‘9ÐóÝ`Þ^Ý',–¦f`Þ**Ý',“`Þ.^Ý',“`Þ.**Ý'.ŽŽŸŒ‹)“«ŸòÝChapter‘¦f4:‘ÝÝStatemen²!ts’]„41ŽŽŽ ƒ3Ú ý¨ðÐè4‘ ¸QStatemen‘ÿuÂtsŽŽŸ&·ñ‘áCon•²!trol›*Œstatemen“ts‘žÝsuc“h˜as˜ÞifÝ,–K•ÞwhileÝ,“and˜so˜on˜con•²!trol˜the˜ o“w˜of˜execution˜in˜Octa“v“e˜pro-Ž¤grams.‘¾All–Gthe“conš²!trol“statemen˜ts“start“with“spMÞecial“k˜eyw˜ords“suc˜h“as“Þif“Ýand“ÞwhileÝ,‘Z&to“distinguishŽ¡them–¦ffrom“simple“expressions.Ž©Wý‘Man•²!y›S¸con“trol˜statemen“ts˜con“tain˜other˜statemen“ts;‘*`for˜example,‘¿ the˜Þif˜Ýstatemen“t˜con“tainsŽ¡another–statemenš²!t“whic˜h“ma˜y“or“ma˜y“not“bMÞe“executed.‘¬jEac˜h“con˜trol“statemen˜t“has“a“correspMÞondingŽ¡áend‘8èÝstatemenš²!t–Ê–that“marks“the“end“of“the“end“of“the“con˜trol“statemen˜t.‘JnF‘ÿeor“example,‘Ó¢the“k˜eyw˜ordŽ¡Þendif–|èÝmarks“the“end“of“an“Þif“Ýstatemenš²!t,‘…4and“Þendwhile“Ýmarks“the“end“of“a“Þwhile“Ýstatemen˜t.‘ÐY‘ÿeouŽ¡can–<Ûuse“the“k•²!eyw“ord–<ÛÞend“Ýanš²!ywhere“a“more“spMÞeci c“end“k˜eyw˜ord“is“expMÞected,‘bybut“using“the“moreŽ¡spMÞeci c›rÕk•²!eyw“ords˜is˜preferred˜bMÞecause˜if˜y“ou˜use˜them,‘}%Octa“v“e˜is˜able˜to˜pro“vide˜bMÞetter˜diagnosticsŽ¡for–¦fmismatcš²!hed“or“missing“end“tok˜ens.Ž¦‘The–‡+list“of“statemenš²!ts“con˜tained“bMÞet˜w˜een“k˜eyw˜ords“lik˜e“Þif“Ýor“Þwhile“Ýand“the“correspMÞonding“endŽ¡statemenš²!t–¦fis“called“the“áb•MÞo“dy‘–~Ýof–¦fa“con˜trol“statemen˜t.ŽŸ%_ôëE4.1‘™The–¦MóH߆µTff cmtt12ëHif“ëEStatemenŒÌtŽŽŸWý‘ÝThe–¸TÞif“Ýstatemenš²!t“is“Octa˜v˜e's“decision-making“statemen˜t.‘¨There“are“three“basic“forms“of“an“ÞifŽ¡Ýstatemenš²!t.‘ÝÝIn–¦fits“simplest“form,“it“loMÞoks“lik˜e“this:ŽŸWý‘èUÞif–¿ª(áconditionÞ)“áthen-b•MÞo“dy‘¯ÂÞendifŽ¦ácondition–åŸÝis“an“expression“that“conš²!trols“what“the“rest“of“the“statemen˜t“will“do.‘›‰The“áthen-b•MÞo“dy‘Õ·ÝisŽ¡executed–¦fonly“if“ácondition“Ýis“true.Ž¦‘The–UÖcondition“in“an“Þif“Ýstatemen²!t“is“considered“true“if“its“v›ÿdDalue“is“non-zero,‘eóand“false“if“its“v˜alueŽ¡is–ì zero.‘®ÈIf“the“v‘ÿdDalue“of“the“conditional“expression“in“an“Þif“Ýstatemenš²!t“is“a“v˜ector“or“a“matrix,‘ýrit“isŽ¡considered–¦ftrue“only“if“áall‘¸Ýof“the“elemen²!ts“are“non-zero.Ž¦‘The–¦fsecond“form“of“an“if“statemenš²!t“loMÞoks“lik˜e“this:ŽŸWý‘èUÞif–¿ª(áconditionÞ)“áthen-b•MÞo“dy›¯ÂÞelse‘¿ªáelse-b“o“dy˜ÞendifŽ¦ÝIf–¦fácondition“Ýis“true,“áthen-b•MÞo“dy›–~Ýis–¦fexecuted;“otherwise,“áelse-b•MÞo“dy˜Ýis‘¦fexecuted.Ž¦‘Here–¦fis“an“example:ŽŸY‘èUÞif–¿ª(rem“(x,“2)“==“0)Ž¡‘(g©printf–¿ª("x“is“even\n");Ž¡‘èUelseŽ¡‘(g©printf–¿ª("x“is“odd\n");Ž¡‘èUendifŽŽŸP.c‘ÝIn–¶this“example,›æ)if“the“expression“Þrem–¦f(x,“2)“==“0–¶Ýis“true“(that“is,˜the“v‘ÿdDalue“of“Þx“Ýis“divisible“b²!y“2),Ž¡then–¦fthe“ rst“Þprintf“Ýstatemenš²!t“is“ev‘ÿdDaluated,“otherwise“the“second“Þprintf“Ýstatemen˜t“is“ev‘ÿdDaluated.ŽŽŸŒ‹*›ØŸòÝ42’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБThe–µäthird“and“most“general“form“of“the“Þif“Ýstatemenš²!t“allo˜ws“m˜ultiple“decisions“to“bMÞe“com˜binedŽ¤in–¦fa“single“statemenš²!t.‘ÝÝIt“loMÞoks“lik˜e“this:ŽŸàý‘èUÞif–¿ª(áconditionÞ)“áthen-b•MÞo“dy›¯ÂÞelseif–¿ª(áconditionÞ)“áelseif-b•MÞo“dy˜Þelse‘¿ªáelse-b“o“dy˜ÞendifŽ©àýÝAn•²!y›CSn“um“bMÞer˜of˜Þelseif˜Ýclauses˜ma“y˜appMÞear.‘¼×Eac“h˜condition˜is˜tested˜in˜turn,‘W#and˜if˜one˜is˜found˜toŽ¡bšMÞe–h²true,‘u its“corresp˜onding“áb˜o˜dy‘XÊÝis“executed.‘ÉLIf“none“of“the“conditions“are“true“and“the“Þelse“ÝclauseŽ¡is–‘presenš²!t,‘•`its“b•MÞo“dy–‘is“executed.‘ÖÅOnly“one“Þelse“Ýclause“ma˜y“appMÞear,‘•`and“it“m˜ust“bMÞe“the“last“part“ofŽ¡the‘¦fsatemen²!t.Ž¦‘In–ÒBthe“follo²!wing“example,›Ý9if“the“ rst“condition“is“true“(that“is,˜the“v‘ÿdDalue“of“Þx“Ýis“divisible“b²!y“2),Ž¡then–¿Žthe“ rst“Þprintf“Ýstatemen²!t“is“executed.‘)UIf“it“is“false,›ÅØthen“the“second“condition“is“tested,˜andŽ¡if–YSit“is“true“(that“is,›h¾the“v‘ÿdDalue“of“Þx“Ýis“divisible“b²!y“3),˜then“the“second“Þprintf“Ýstatemen²!t“is“executed.Ž¡Otherwise,–¦fthe“third“Þprintf“Ýstatemen²!t“is“pMÞerformed.ŽŸ/â‘èUÞif–¿ª(rem“(x,“2)“==“0)Ž¡‘(g©printf–¿ª("x“is“even\n");Ž¡‘èUelseif–¿ª(rem“(x,“3)“==“0)Ž¡‘(g©printf–¿ª("x“is“odd“and“divisible“by“3\n");Ž¡‘èUelseŽ¡‘(g©printf–¿ª("x“is“odd\n");Ž¡‘èUendifŽŽŸm§‘ÝNote–|that“the“Þelseif“Ýk•²!eyw“ord›|m“ust˜not˜b•MÞe˜sp“elled˜Þelse‘¦fifÝ,‘2xas˜is˜allo•²!w“ed˜in˜F‘ÿeortran.‘­If˜it˜is,‘2xtheŽ¡space›w®bMÞet•²!w“een˜the˜Þelse˜Ýand˜Þif˜Ýwill˜tell˜Octa“v“e˜to˜treat˜this˜as˜a˜new˜Þif˜Ýstatemen“t˜within˜anotherŽ¡Þif–¦fÝstatemenš²!t's“Þelse“Ýclause.‘ÝÝF‘ÿeor“example,“if“y˜ou“writeŽŸâ‘èUÞif‘¿ª(ác1‘ß9Þ)Ž¡‘(g©áb•MÞo“dy-1Ž¡‘èUÞelse–¿ªif“(ác2‘ß9Þ)Ž¡‘(g©áb•MÞo“dy-2Ž¡‘èUÞendifŽŽŸO§ÝOcta•²!v“e–s˜will“expMÞect“additional“input“to“complete“the“ rst“Þif“Ýstatemenš²!t.‘EtIf“y˜ou“are“using“Octa˜v˜eŽ¡in•²!teractiv“ely‘ÿe,‘^Vit–9Œwill“con•²!tin“ue–9Œto“prompt“yš²!ou“for“additional“input.‘—PIf“Octa˜v˜e“is“reading“this“inputŽ¡from–dßa“ le,‘qúit“maš²!y“complain“abMÞout“missing“or“mismatc˜hed“Þend“Ýstatemen˜ts,–qúor,“if–dßy˜ou“ha˜v˜e“not“usedŽ¡the–PÝmore“spMÞeci c“Þend“Ýstatemenš²!ts“(ÞendifÝ,–{{ÞendforÝ,“etc.),“it–PÝma˜y“simply“proMÞduce“incorrect“results,Ž¡without–¦fproMÞducing“anš²!y“w˜arning“messages.Ž¦‘It–¦fis“m•²!uc“h–¦feasier“to“see“the“error“if“wš²!e“rewrite“the“statemen˜ts“abMÞo˜v˜e“lik˜e“this,ŽŸâ‘èUÞif‘¿ª(ác1‘ß9Þ)Ž¡‘(g©áb•MÞo“dy-1Ž¡‘èUÞelseŽ¡‘(g©if‘¿ª(ác2‘ß9Þ)Ž¡‘3æýáb•MÞo“dy-2Ž¡‘(g©ÞendifŽŽŽŸŒ‹+¦îŸòÝChapter‘¦f4:‘ÝÝStatemen²!ts’]„43ŽŽŽ ƒ3Ú ý¨ðÐusing–,:the“indenš²!tation“to“sho˜w“ho˜w“Octa˜v˜e“groups“the“statemen˜ts.‘oXSee“Chapter“5“[F‘ÿeunctions“andŽ¤Scripts],–¦fpage“49.ŽŸ)9ÒëE4.2‘™The–¦MëHwhile“ëEStatemenŒÌtŽŽŸNu‘ÝIn–”Žprogramming,‘˜ a“álošMÞop‘éÝmeans“a“part“of“a“program“that“is“(or“at“least“can“b˜e)“executed“t•²!w“o‘”ŽorŽ¡more–¦ftimes“in“succession.Ž©Nu‘The–ä‰Þwhile“Ýstatemenš²!t“is“the“simplest“loMÞoping“statemen˜t“in“Octa˜v˜e.‘˜EIt“repMÞeatedly“executes“aŽ¡statemenš²!t–à=as“long“as“a“condition“is“true.‘‹bAs“with“the“condition“in“an“Þif“Ýstatemen˜t,‘î³the“conditionŽ¡in–­ a“Þwhile“Ýstatemen²!t“is“considered“true“if“its“v›ÿdDalue“is“non-zero,‘®¶and“false“if“its“v˜alue“is“zero.‘ñÏIf“theŽ¡v‘ÿdDalue–‚†of“the“conditional“expression“in“an“Þif“Ýstatemenš²!t“is“a“v˜ector“or“a“matrix,‘‰³it“is“considered“trueŽ¡only–¦fif“áall‘¸Ýof“the“elemen²!ts“are“non-zero.Ž¦‘Octa•²!v“e's–¦fÞwhile“Ýstatemenš²!t“loMÞoks“lik˜e“this:ŽŸNu‘èUÞwhile‘¿ª(áconditionÞ)Ž¡‘(g©áb•MÞo“dyŽ¡‘èUÞendwhileŽŽŸ2‰ÝHere›Æáb•MÞo“dy‘¶,Ýis˜a˜statemen•²!t˜or˜list˜of˜statemen“ts˜that˜w“e˜call˜the˜áb•MÞo“dy‘¶,Ýof˜the˜lo“op,‘Íÿand˜ácondition˜ÝisŽ¡an–¦fexpression“that“conš²!trols“ho˜w“long“the“loMÞop“k˜eeps“running.Ž¦‘The–Ùˆ rst“thing“the“Þwhile“Ýstatemen²!t“doMÞes“is“test“áconditionÝ.‘wDIf“ácondition“Ýis“true,‘æQit“executes“theŽ¡statemen²!t›Ûáb•MÞo“dyÝ.‘šAfter˜áb“o“dy‘Ë(Ýhas˜b“een˜executed,–»ácondition˜Ýis˜tested˜again,“and˜if˜it˜is˜still˜true,“áb•MÞo“dyŽ¡Ýis–@|executed“again.‘¬ This“prošMÞcess“rep˜eats“un²!til“ácondition“Ýis“no“longer“true.‘¬ If“ácondition“Ýis“initiallyŽ¡false,–¦fthe“b•MÞo“dy–¦fof“the“loMÞop“is“nev²!er“executed.Ž¦‘This–¦fexample“creates“a“v‘ÿdDariable“Þfib“Ýthat“conš²!tains“the“elemen˜ts“of“the“FibMÞonacci“sequence.ŽŸO|‘èUÞfib–¿ª=“ones“(1,“10);Ž¡‘èUi–¿ª=“3;Ž¡‘èUwhile–¿ª(i“<=“10)Ž¡‘(g©fib–¿ª(i)“=“fib“(i-1)“+“fib“(i-2);Ž¡‘(g©i++;Ž¡‘èUendwhileŽŽŸ_‰ÝHere–¦fthe“b•MÞo“dy–¦fof“the“loMÞop“conš²!tains“t˜w˜o“statemen˜ts.Ž¦‘The–\6loMÞop“wš²!orks“lik˜e“this:‘¸Å rst,›k the“v‘ÿdDalue“of“Þi“Ýis“set“to“3.‘Å#Then,˜the“Þwhile“Ýtests“whether“Þi“Ýis“lessŽ¡than–h{or“equal“to“10.‘É9This“is“the“case“when“Þi“Ýequals“3,‘tÝso“the“v‘ÿdDalue“of“the“ÞiÝ-th“elemen²!t“of“Þfib“Ýis“setŽ¡to–\~the“sum“of“the“previous“t•²!w“o–\~v›ÿdDalues“in“the“sequence.‘Å;Then“the“Þi++“Ýincremen²!ts“the“v˜alue“of“Þi“ÝandŽ¡the–¦flošMÞop“rep˜eats.‘ÝÝThe“lo˜op“terminates“when“Þi“Ýreac²!hes“11.Ž¦‘A‘ó¸newline–óæis“not“required“bšMÞet•²!w“een–óæthe“condition“and“the“b˜o˜dy;‘/fbut“using“one“mak²!es“the“programŽ¡clearer–¦funless“the“b•MÞo“dy–¦fis“v²!ery“simple.ŽŽŸŒ‹,±IŸòÝ44’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐëE4.3‘™The–¦MëHfor“ëEStatemenŒÌtŽŽŸé‘ÝThe–„ÍÞfor“Ýstatemenš²!t“mak˜es“it“more“con˜v˜enien˜t“to“coun˜t“iterations“of“a“loMÞop.‘ÒªThe“general“form“ofŽ¤the–¦fÞfor“Ýstatemenš²!t“loMÞoks“lik˜e“this:ŽŸé‘èUÞfor–¿ªáv‘ÿdDar‘ˆÓÞ=“áexpressionŽ¡‘(g©b•MÞo“dyŽ¡‘èUÞendforŽŽŸ6¼“ÝThe–[ assignmenš²!t“expression“in“the“Þfor“Ýstatemen˜t“w˜orks“a“bit“di eren˜tly“than“Octa˜v˜e's“normalŽ¡assignmen•²!t›9rstatemen“t.‘—Instead˜of˜assigning˜the˜complete˜result˜of˜the˜expression,‘^4it˜assigns˜eac“hŽ¡column–بof“the“expression“to“áv‘ÿdDar‘¡ÑÝin“turn.‘t¢If“áexpression“Ýis“either“a“roš²!w“v˜ector“or“a“scalar,‘å8the“v‘ÿdDalueŽ¡of–¾4áv‘ÿdDar‘‡]Ýwill“bšMÞe“a“scalar“eac²!h“time“the“lo˜op“b˜o˜dy“is“executed.‘%HIf“áv‘ÿdDar‘‡]Ýis“a“column“v²!ector“or“a“matrix,Ž¡áv‘ÿdDar‘oÝwill–¦fbMÞe“a“column“vš²!ector“eac˜h“time“the“lošMÞop“b˜o˜dy“is“executed.Ž©é‘The–%­folloš²!wing“example“sho˜ws“another“w˜a˜y“to“create“a“v˜ector“con˜taining“the“ rst“ten“elemen˜tsŽ¡of–¦fthe“FibMÞonacci“sequence,“this“time“using“the“Þfor“Ýstatemen²!t:ŽŸ‚ð‘èUÞfib–¿ª=“ones“(1,“10);Ž¡‘èUfor–¿ªi“=“3:10Ž¡‘(g©fib–¿ª(i)“=“fib“(i-1)“+“fib“(i-2);Ž¡‘èUendforŽŽŸE¼“ÝThis–4¨coMÞde“wš²!orks“b˜y“ rst“ev›ÿdDaluating“the“expression“`Þ3:10Ý',‘Khto“proMÞduce“a“range“of“v˜alues“from“3“to“10Ž¡inclusivš²!e.‘Ç6Then–bpthe“v‘ÿdDariable“Þi“Ýis“assigned“the“ rst“elemen˜t“of“the“range“and“the“b•MÞo“dy–bpof“the“loMÞop“isŽ¡executed–ÊŠonce.‘JHWhen“the“end“of“the“lošMÞop“b˜o˜dy“is“reac²!hed,‘Ó“the“next“v‘ÿdDalue“in“the“range“is“assignedŽ¡to–áthe“v‘ÿdDariable“ÞiÝ,‘ ?and“the“lošMÞop“b˜o˜dy“is“executed“again.‘NThis“pro˜cess“con•²!tin“ues›áun“til˜there˜are˜noŽ¡more–¦felemen²!ts“to“assign.Ž¦‘In–¦fthe“Þfor“Ýstatemenš²!t,“áb•MÞo“dy‘–~Ýstands–¦ffor“an˜y“statemen˜t“or“list“of“statemen˜ts.Ž¦‘Although–$Zit“is“pšMÞossible“to“rewrite“all“Þfor“Ýlo˜ops“as“Þwhile“Ýlo˜ops,‘C×the“Octa•²!v“e–$Zlanguage“has“b˜othŽ¡statemen²!ts–ƒKbšMÞecause“often“a“Þfor“Ýlo˜op“is“b˜oth“less“wš²!ork“to“t˜ypMÞe“and“more“natural“to“think“of.‘|ÔCoun˜tingŽ¡the›ºn•²!um“bMÞer˜of˜iterations˜is˜v“ery˜common˜in˜lo•MÞops˜and˜it˜can˜b“e˜easier˜to˜think˜of˜this˜coun²!ting˜asŽ¡part–¦fof“lošMÞoping“rather“than“as“something“to“do“inside“the“lo˜op.ŽŸ:¤ëE4.4‘™The–¦MëHbreak“ëEStatemenŒÌtŽŽŸé‘ÝThe– ÇÞbreak“Ýstatemen²!t“jumps“out“of“the“innermost“Þfor“Ýor“Þwhile“ÝloMÞop“that“encloses“it.‘±SThe“ÞbreakŽ¡Ýstatemen•²!t›õýma“y˜only˜b•MÞe˜used˜within˜the˜b“o“dy˜of˜a˜lo“op.‘Ì¢The˜follo²!wing˜example˜ nds˜the˜smallestŽ¡divisor–¦fof“a“givš²!en“in˜teger,“and“also“iden˜ti es“prime“n˜um˜bMÞers:ŽŽŸŒ‹-¼ ŸòÝChapter‘¦f4:‘ÝÝStatemen²!ts’]„45ŽŽŽ ƒ3Ú ý¨ðБèUÞnum–¿ª=“103;Ž¤‘èUdiv–¿ª=“2;Ž¡‘èUwhile–¿ª(div*div“<=“num)Ž¡‘(g©if–¿ª(rem“(num,“div)“==“0)Ž¡‘3æýbreak;Ž¡‘(g©endifŽ¡‘(g©div++;Ž¡‘èUendwhileŽ¡‘èUif–¿ª(rem“(num,“div)“==“0)Ž¡‘(g©printf–¿ª("Smallest“divisor“of“%d“is“%d\n",“num,“div)Ž¡‘èUelseŽ¡‘(g©printf–¿ª("%d“is“prime\n",“num);Ž¡‘èUendifŽŽ Ê‘ÝWhen–ºZthe“remainder“is“zero“in“the“ rst“Þwhile“Ýstatemen•²!t,‘ÿWOcta“v“e–ºZimmediately“ábreaks“out‘÷ZÝofŽ¤the–lošMÞop.‘½This“means“that“Octa•²!v“e–pro˜ceeds“immediately“to“the“statemenš²!t“follo˜wing“the“loMÞop“andŽ¡con•²!tin“ues–|proMÞcessing.‘®(This“is“vš²!ery“di eren˜t“from“the“Þexit“Ýstatemen˜t“whic˜h“stops“the“en˜tire“Octa˜v˜eŽ¡program.)ŽŸFp‘Here–Sis“another“program“equiv‘ÿdDalenš²!t“to“the“previous“one.‘ã®It“illustrates“ho˜w“the“ácondition“Ýof“aŽ¡Þwhile–¦fÝstatemenš²!t“could“just“as“w˜ell“bMÞe“replaced“with“a“Þbreak“Ýinside“an“ÞifÝ:ŽŸGw‘èUÞnum–¿ª=“103;Ž¡‘èUdiv–¿ª=“2;Ž¡‘èUwhile‘¿ª(1)Ž¡‘(g©if–¿ª(rem“(num,“div)“==“0)Ž¡‘3æýprintf–¿ª("Smallest“divisor“of“%d“is“%d\n",“num,“div);Ž¡‘3æýbreak;Ž¡‘(g©endifŽ¡‘(g©div++;Ž¡‘(g©if–¿ª(div*div“>“num)Ž¡‘3æýprintf–¿ª("%d“is“prime\n",“num);Ž¡‘3æýbreak;Ž¡‘(g©endifŽ¡‘èUendwhileŽŽŽ å¹¿ëE4.5‘™The–¦MëHcontinue“ëEStatemenŒÌtŽŽŸFp‘ÝThe–ì8Þcontinue“Ýstatemen•²!t,›ý­lik“e–ì8ÞbreakÝ,˜is“used“only“inside“Þfor“Ýor“Þwhile“ÝloMÞops.‘¯SIt“skips“o•²!v“er‘ì8theŽ¡rest–ÁEof“the“lošMÞop“b˜o˜dy‘ÿe,‘Çýcausing“the“next“cycle“around“the“lo˜op“to“b˜egin“immediately‘ÿe.‘.{Con²!trast“thisŽ¡with–¦fÞbreakÝ,“whic²!h“jumps“out“of“the“loMÞop“altogether.‘ÝÝHere“is“an“example:ŽŽŸŒ‹.Æ ŸòÝ46’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞ#–¿ªprint“elements“of“a“vector“of“randomŽ¤‘èU#–¿ªintegers“that“are“even.Ž¡¡‘èU#–¿ªfirst,“create“a“row“vector“of“10“randomŽ¡‘èU#–¿ªintegers“with“values“between“0“and“100:Ž¡¡‘èUvec–¿ª=“round“(rand“(1,“10)“*“100);Ž¡¡‘èU#–¿ªprint“what“we're“interested“in:Ž¡¡‘èUfor–¿ªx“=“vecŽ¡‘(g©if–¿ª(rem“(x,“2)“!=“0)Ž¡‘3æýcontinue;Ž¡‘(g©endifŽ¡‘(g©printf–¿ª("%d\n",“x);Ž¡‘èUendforŽŽ õ2בÝIf–£Æone“of“the“elemenš²!ts“of“áv˜ec‘MÊÝis“an“oMÞdd“n˜um˜bMÞer,‘¤Mthis“example“skips“the“prin˜t“statemen˜t“for“thatŽ¤elemenš²!t,–¦fand“con˜tin˜ues“bac˜k“to“the“ rst“statemen˜t“in“the“loMÞop.Ž©ø-‘This–K‡is“not“a“practical“example“of“the“Þcontinue“Ýstatemenš²!t,‘´Ïbut“it“should“giv˜e“y˜ou“a“clearŽ¡understanding–¦fof“hoš²!w“it“w˜orks.‘ÝÝNormally‘ÿe,“one“w˜ould“probably“write“the“loMÞop“lik˜e“this:ŽŸù4‘èUÞfor–¿ªx“=“vecŽ¡‘(g©if–¿ª(rem“(x,“2)“==“0)Ž¡‘3æýprintf–¿ª("%d\n",“x);Ž¡‘(g©endifŽ¡‘èUendforŽŽŸd€´ëE4.6‘™The–¦MëHunwind_protect“ëEStatemenŒÌtŽŽŸø-‘ÝOcta•²!v“e–ìsuppšMÞorts“a“limited“form“of“exception“handling“mo˜delled“after“the“un²!wind-protect“formŽ¡of‘¦fLisp.Ž¦‘The–¦fgeneral“form“of“an“Þunwind_protect“ÝblošMÞc²!k“lo˜oks“lik²!e“this:ŽŸG‘èUÞunwind_protectŽ¡‘(g©áb•MÞo“dyŽ¡‘èUÞunwind_protect_cleanupŽ¡‘(g©áclean²!upŽ¡‘èUÞend_unwind_protectŽŽŸP2×ÝWhere›! áb•MÞo“dy‘#Ýand˜áclean²!up‘v Ýare˜b“oth˜optional˜and˜ma•²!y˜con“tain˜an“y˜Octa“v“e˜expressions˜or˜commands.Ž¡The–¦fstatemenš²!ts“in“áclean˜up‘ûgÝare“guaran˜teed“to“bMÞe“executed“regardless“of“ho˜w“con˜trol“exits“áb•MÞo“dyÝ.ŽŽŸŒ‹/ÍdŸòÝChapter‘¦f4:‘ÝÝStatemen²!ts’]„47ŽŽŽ ƒ3Ú ý¨ðБThis–¦Îis“useful“to“protect“tempšMÞorary“c²!hanges“to“global“v‘ÿdDariables“from“p˜ossible“errors.‘ßF‘ÿeor“exam-Ž¤ple,‘&"the– –folloš²!wing“coMÞde“will“alw˜a˜ys“restore“the“original“v›ÿdDalue“of“the“built-in“v˜ariable“Þdo_fortran_Ž¡indexing–¦fÝev²!en“if“an“error“ošMÞccurs“while“p˜erforming“the“indexing“op˜eration.ŽŸ‘èUÞsave_do_fortran_indexing–¿ª=“do_fortran_indexing;Ž¤ ‘èUunwind_protectŽ¡‘(g©do_fortran_indexing–¿ª=“"true";Ž¡‘(g©elt–¿ª=“a“(idx)Ž¡‘èUunwind_protect_cleanupŽ¡‘(g©do_fortran_indexing–¿ª=“save_do_fortran_indexing;Ž¡‘èUend_unwind_protectŽŸ‘ÝWithout–hÌÞunwind_protectÝ,‘™fthe“v‘ÿdDalue“of“ádo‘¨/‰x³HøŽ–ñ'fortran‘¨/‰x³HøŽ“indexing‘XäÝw²!ould–hÌnot“bMÞe“restored“if“an“errorŽ¤ošMÞccurs–Éüwhile“p˜erforming“the“indexing“op˜eration“b˜ecause“ev‘ÿdDaluation“w²!ould“stop“at“the“p˜oin²!t“of“theŽ¡error–¦fand“the“statemenš²!t“to“restore“the“v‘ÿdDalue“w˜ould“not“bMÞe“executed.ŽŽŸŒ‹0ÓåŸòÝ48’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹1ØŸòÝChapter–¦f5:‘ÝÝF‘ÿeunctions“and“Script“Files’» 49ŽŽŽ ƒ3Ú ý¨ðÐè5‘ ¸QF‘þaGunctions–¦Mand“Script“FilesŽŽŸ*º‘ÝComplicated›÷ƒOcta•²!v“e˜programs˜can˜often˜bMÞe˜simpli ed˜b“y˜de ning˜functions.‘Ñ3F‘ÿeunctions˜can˜bMÞeŽ¤de ned–,directly“on“the“command“line“during“in•²!teractiv“e›,Octa“v“e˜sessions,–Mˆor˜in˜external˜ les,“andŽ¡can–¦fbMÞe“called“just“lik²!e“built-in“ones.ŽŸ(ûëE5.1‘™De ning‘¦MF‘þ¦functionsŽŽŸ¿‘ÝIn–¦fits“simplest“form,“the“de nition“of“a“function“named“áname‘CmÝloMÞoks“lik²!e“this:ŽŸÆ‘èUÞfunction‘¿ªánameŽ¡‘(g©b•MÞo“dyŽ¡‘èUÞendfunctionŽŽŸ2“max)Ž¡‘?fQmax–¿ª=“v“(i);Ž¡‘?fQidx–¿ª=“i;Ž¡‘3æýendifŽ¡‘(g©endforŽ¡‘èUendfunctionŽŽ ™ÂY‘ÝIn–-îthis“particular“case,‘OÏthe“t•²!w“o–-îv‘ÿdDalues“could“ha•²!v“e–-îbMÞeen“returned“as“elemenš²!ts“of“a“single“arra˜y‘ÿe,Ž¡but–’–that“is“not“alw•²!a“ys–’–pšMÞossible“or“con•²!v“enien“t.‘×BThe–’–v‘ÿdDalues“to“b˜e“returned“maš²!y“not“ha˜v˜e“compatibleŽ¡dimensions,–¦fand“it“is“often“desirable“to“giv²!e“the“individual“return“v‘ÿdDalues“distinct“names.Ž¦‘In–üyaddition“to“setting“Þnargin“Ýeacš²!h“time“a“function“is“called,‘uOcta˜v˜e“also“automatically“initializesŽ¡Þnargout–4bÝto“the“n•²!um“bšMÞer–4bof“v‘ÿdDalues“that“are“exp˜ected“to“b˜e“returned.‘ ‡ÒThis“alloš²!ws“y˜ou“to“writeŽ¡functions–ÍSthat“bMÞeha•²!v“e›ÍSdi eren“tly˜depMÞending˜on˜the˜n“um“bMÞer˜of˜v‘ÿdDalues˜that˜the˜user˜of˜the˜functionŽ¡has–žErequested.‘Û'The“implicit“assignmenš²!t“to“the“built-in“v‘ÿdDariable“Þans“ÝdoMÞes“not“ gure“in“the“coun˜t“ofŽ¡output–¦fargumenš²!ts,“so“the“v‘ÿdDalue“of“Þnargout“Ýma˜y“bMÞe“zero.Ž¦‘The–ÕÞsvd“Ýand“Þlu“Ýfunctions“are“examples“of“built-in“functions“that“bMÞeha•²!v“e›Õdi eren“tly˜depMÞendingŽ¡on–¦fthe“v‘ÿdDalue“of“ÞnargoutÝ.Ž¦‘It– is“pMÞossible“to“write“functions“that“only“set“some“return“v‘ÿdDalues.‘ ÀF‘ÿeor“example,‘bïcalling“theŽ¡functionŽŸ‡¯‘èUÞfunction–¿ª[x,“y,“z]“=“f“()Ž¤ ‘(g©x–¿ª=“1;Ž¡‘(g©z–¿ª=“2;Ž¡‘èUendfunctionŽ¦ÝasŽ¤‡¯‘èUÞ[a,–¿ªb,“c]“=“f“()Ž¦ÝproMÞduces:Ž¡‘èUÞa–¿ª=“1ŽŸ‘èUb–¿ª=“[](0x0)ŽŽŸŒ‹5ó¾ŸòÝChapter–¦f5:‘ÝÝF‘ÿeunctions“and“Script“Files’» 53ŽŽŽ ƒ3Ú ý¨ðБèUÞc–¿ª=“2ŽŸ!ÃÌëE5.3‘™V‘þ¦fariable-length–¦MArgumenŒÌt“ListsŽŽŸpó‘ÝOcta•²!v“e–has“a“real“mecš²!hanism“for“handling“functions“that“tak˜e“an“unspMÞeci ed“n˜um˜bMÞer“of“argu-Ž¤men²!ts,‘²so–‹Eit“is“not“necessary“to“place“an“uppšMÞer“b˜ound“on“the“n•²!um“b˜er–‹Eof“optional“argumen²!ts“that“aŽ¡function–¦fcan“accept.Ž©pó‘Here–¥is“an“example“of“a“function“that“uses“the“new“synš²!tax“to“prin˜t“a“header“follo˜w˜ed“b˜y“anŽ¡unspšMÞeci ed‘¦fn•²!um“b˜er–¦fof“v‘ÿdDalues:ŽŸpó‘èUÞfunction–¿ªfoo“(heading,“...)Ž¤ ‘(g©disp‘¿ª(heading);Ž¡‘(g©va_start‘¿ª();Ž¡‘(g©while‘¿ª(--nargin)Ž¡‘3æýdisp–¿ª(va_arg“());Ž¡‘(g©endwhileŽ¡‘èUendfunctionŽ¦‘ÝThe–öžellipsis“that“marks“the“v‘ÿdDariable“argumenš²!t“list“ma˜y“only“appMÞear“once“and“m˜ust“bMÞe“the“lastŽ¤elemenš²!t–¦fin“the“list“of“argumen˜ts.Ž¦‘Calling–3éÞva_start()“ÝpšMÞositions“an“in²!ternal“p˜oinš²!ter“to“the“ rst“unnamed“argumen˜t“and“allo˜ws“y˜ouŽ¡to–õcycle“through“the“argumenš²!ts“more“than“once.‘ÉïIt“is“not“necessary“to“call“Þva_start()“Ýif“y˜ou“doŽ¡not–¦fplan“to“cycle“through“the“argumen²!ts“more“than“once.Ž¦‘The–Mâfunction“Þva_arg()“Ýreturns“the“v›ÿdDalue“of“the“next“a²!v˜ailable“argumenš²!t“and“mo˜v˜es“the“in˜ternalŽ¡pMÞoinš²!ter–'to“the“next“argumen˜t.‘ë It“is“an“error“to“call“Þva_arg()“Ýwhen“there“are“no“more“argumen˜tsŽ¡a²!v‘ÿdDailable.Ž¦‘Sometimes–÷æit“is“useful“to“bMÞe“able“to“pass“all“unnamed“argumen²!ts“to“another“function.‘Ò\TheŽ¡k•²!eyw“ord›¦fáall‘¨/‰x³HøŽ–ñ'v‘ÿdDa‘¨/‰x³HøŽ“args‘èÝmak•²!es˜this˜v“ery˜easy˜to˜do.‘ÝÝF‘ÿeor˜example,˜giv“en˜the˜functionsŽŸpó‘èUÞfunction–¿ªf“(...)Ž¤ ‘(g©while‘¿ª(nargin--)Ž¡‘3æýdisp–¿ª(va_arg“())Ž¡‘(g©endwhileŽ¡‘èUendfunctionŽ¡‘èUfunction–¿ªg“(...)Ž¡‘(g©f–¿ª("begin",“all_va_args,“"end")Ž¡‘èUendfunctionŽ¦Ýthe‘¦fstatemen²!tŽ¤pó‘èUÞg–¿ª(1,“2,“3)Ž¦Ýprin²!tsŽ¡‘èUÞbeginŽ¤ ‘èU1Ž¡‘èU2Ž¡‘èU3ŽŽŸŒ‹6üúŸòÝ54’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞendŽ©¹¼‘ÝThe›Ú0k•²!eyw“ord˜Þall_va_args˜Ýalw“a“ys˜stands˜for˜the˜en“tire˜list˜of˜optional˜argumen“t,‘so˜it˜is˜pMÞossibleŽ¤to–\use“it“more“than“once“within“the“same“function“without“ha²!ving“to“call“Þvar_start‘¦f()Ý.‘þñIt“canŽ¡only–¡LbMÞe“used“within“functions“that“takš²!e“a“v‘ÿdDariable“n˜um˜bMÞer“of“argumen˜ts.‘Ü*It“is“an“error“to“use“it“inŽ¡other‘¦fcon²!texts.ŽŸ6æîëE5.4‘™V‘þ¦fariable-length–¦MReturn“ListsŽŽŸ¹¼‘ÝOcta•²!v“e–Û_also“has“a“real“mecš²!hanism“for“handling“functions“that“return“an“unspMÞeci ed“n˜um˜bMÞerŽ¡of–Gbv‘ÿdDalues,‘o¡so“it“is“no“longer“necessary“to“place“an“uppšMÞer“b˜ound“on“the“n•²!um“b˜er–Gbof“outputs“that“aŽ¡function–¦fcan“proMÞduce.Ž¦‘Here–¦fis“an“example“of“a“function“that“uses“the“new“syn²!tax“to“proMÞduce“N“v‘ÿdDalues:ŽŸ¹¼‘èUÞfunction–¿ª[...]“=“foo“(n,“x)Ž¤ ‘(g©for–¿ªi“=“1:nŽ¡‘3æývr_val–¿ª(i“*“x);Ž¡‘(g©endforŽ¡‘èUendfunctionŽ¦‘ÝEacš²!h–ztime“Þvr_val()“Ýis“called,‘‚åit“places“the“v‘ÿdDalue“of“its“argumen˜t“at“the“end“of“the“list“of“v‘ÿdDaluesŽ¤to–h4return“from“the“function.‘#FOnce“Þvr_val()“Ýhas“bMÞeen“called,‘˜§there“is“no“w•²!a“y–h4to“go“bac²!k“to“theŽ¡bMÞeginning–¦fof“the“list“and“rewrite“an²!y“of“the“return“v‘ÿdDalues.Ž¦‘As–R!with“v›ÿdDariable“argumen²!t“lists,‘büthe“ellipsis“that“marks“the“v˜ariable“return“list“ma²!y“only“appMÞearŽ¡once–¦fand“mš²!ust“bMÞe“the“last“elemen˜t“in“the“list“of“returned“v‘ÿdDalues.ŽŸ6æîëE5.5‘™Returning–¦MF›þ¦from“a“F˜unctionŽŽŸ¹¼‘ÝThe›/]b•MÞo“dy˜of˜a˜user-de ned˜function˜can˜con•²!tain˜a˜Þreturn˜Ýstatemen“t.‘xÃThis˜statemen“t˜returnsŽ¡conš²!trol–¦fto“the“rest“of“the“Octa˜v˜e“program.‘ÝÝIt“loMÞoks“lik˜e“this:ŽŸ¹¼‘èUÞreturnŽ¦‘ÝUnlikš²!e–Zthe“Þreturn“Ýstatemen˜t“in“C,“Octa˜v˜e's“Þreturn“Ýstatemen˜t“cannot“bMÞe“used“to“return“a“v‘ÿdDalueŽ¡from–‚qa“function.‘qþInstead,‘¹syš²!ou“m˜ust“assign“v›ÿdDalues“to“the“list“of“return“v˜ariables“that“are“part“ofŽ¡the– ìÞfunction“Ýstatemenš²!t.‘pThe“Þreturn“Ýstatemen˜t“simply“mak˜es“it“easier“to“exit“a“function“from“aŽ¡deeply–¦fnested“loMÞop“or“conditional“statemen²!t.Ž¦‘Here–¦fis“an“example“of“a“function“that“c•²!hec“ks–¦fto“see“if“anš²!y“elemen˜ts“of“a“v˜ector“are“nonzero.ŽŽŸŒ‹7ŸòÝChapter–¦f5:‘ÝÝF‘ÿeunctions“and“Script“Files’» 55ŽŽŽ ƒ3Ú ý¨ðБèUÞfunction–¿ªretval“=“any_nonzero“(v)Ž¤‘(g©retval–¿ª=“0;Ž¡‘(g©for–¿ªi“=“1:length“(v)Ž¡‘3æýif–¿ª(v“(i)“!=“0)Ž¡‘?fQretval–¿ª=“1;Ž¡‘?fQreturn;Ž¡‘3æýendifŽ¡‘(g©endforŽ¡‘(g©printf–¿ª("no“nonzero“elements“found\n");Ž¡‘èUendfunctionŽŽ š\!‘ÝNote–z that“this“function“could“not“ha•²!v“e–z bšMÞeen“written“using“the“Þbreak“Ýstatemen²!t“to“exit“the“lo˜opŽ¤once–#da“nonzero“v‘ÿdDalue“is“found“without“adding“extra“logic“to“a•²!v“oid›#dprin“ting˜the˜message˜if˜the˜v“ectorŽ¡doMÞes–¦fconš²!tain“a“nonzero“elemen˜t.ŽŸ$…ÝëE5.6‘™F‘þ¦function‘¦MFilesŽŽŸ!w‘ÝExcept–Ûýfor“simple“one-shot“programs,‘ébit“is“not“practical“to“ha•²!v“e–Ûýto“de ne“all“the“functions“y²!ouŽ¡need–»Heacš²!h“time“y˜ou“need“them.‘‚Instead,‘À€y˜ou“will“normally“w˜an˜t“to“sa˜v˜e“them“in“a“ le“so“that“y˜ouŽ¡can–¦feasily“edit“them,“and“sa•²!v“e–¦fthem“for“use“at“a“later“time.Ž©!w‘Octa•²!v“e–Ë`došMÞes“not“require“y²!ou“to“load“function“de nitions“from“ les“b˜efore“using“them.‘”ÛY‘ÿeou“simplyŽ¡need–¦fto“put“the“function“de nitions“in“a“place“where“Octa•²!v“e–¦fcan“ nd“them.Ž¦‘When›ȼOcta•²!v“e˜encoun“ters˜an˜iden“ti er˜that˜is˜unde ned,‘ÑQit˜ rst˜loMÞoks˜for˜v‘ÿdDariables˜or˜functionsŽ¡that–c»are“already“compiled“and“currenš²!tly“listed“in“its“sym˜bMÞol“table.‘ÜIf“it“fails“to“ nd“a“de nitionŽ¡there,‘9•it–asearcš²!hes“the“list“of“directories“spMÞeci ed“b˜y“the“built-in“v‘ÿdDariable“ÞLOADPATH“Ýfor“ les“ending“inŽ¡`Þ.mÝ'–fthat“ha•²!v“e–fthe“same“base“name“as“the“unde ned“iden²!ti er.Ÿü¾®1Ž‘ RûÝSee“Section“6.2“[User“Preferences],Ž¡page–z\62“for“a“description“of“ÞLOADPATHÝ.‘Y¿Once“Octa•²!v“e–z\ nds“a“ le“with“a“name“that“matc²!hes,‘¯YtheŽ¡con•²!ten“ts–$ãof“the“ le“are“read.› YUIf“it“de nes“a“ásingle‘ÁêÝfunction,‘„‚it“is“compiled“and“executed.˜SeeŽ¡Section–ß÷5.7“[Script“Files],›î[page“56,˜for“more“information“abMÞout“hoš²!w“y˜ou“can“de ne“more“than“oneŽ¡function–¦fin“a“single“ le.Ž¦‘When›ZÏOcta•²!v“e˜de nes˜a˜function˜from˜a˜function˜ le,‘‡éit˜sa“v“es˜the˜full˜name˜of˜the˜ le˜it˜readŽ¡and–sthe“time“stamp“on“the“ le.‘ÌÅAfter“that,‘}_it“c•²!hec“ks–sthe“time“stamp“on“the“ le“ev²!ery“time“it“needsŽ¡the–¶[function.‘ ¼If“the“time“stamp“indicates“that“the“ le“has“cš²!hanged“since“the“last“time“it“w˜as“read,Ž¡Octa•²!v“e–¦freads“it“again.Ž¦‘Checš²!king–=3the“time“stamp“allo˜ws“y˜ou“to“edit“the“de nition“of“a“function“while“Octa˜v˜e“is“running,Ž¡and–Íautomatically“use“the“new“function“de nition“without“haš²!ving“to“restart“y˜our“Octa˜v˜e“session.Ž¡Checš²!king–÷ãthe“time“stamp“ev˜ery“time“a“function“is“used“is“rather“inecien˜t,‘ Bbut“it“has“to“bMÞe“doneŽ¡to–¦fensure“that“the“correct“function“de nition“is“used.ŽŸ ìC‰ffŠ=Ÿ 9•‘ óŸü¾®1ŽŽ‘ÝThe–¦f`Þ.mÝ'“sux“wš²!as“c˜hosen“for“compatibilit˜y“with“ãMa‘ÿEtlabÝ.ŽŽŸŒ‹83ŸòÝ56’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБOcta•²!v“e–(Zassumes“that“function“ les“in“the“`Þ/usr/local/lib/octave/1.1.0Ý'“directory“tree“willŽ¤not–shcš²!hange,‘}›so“it“doMÞesn't“ha˜v˜e“to“c˜hec˜k“their“time“stamps“ev˜ery“time“the“functions“de ned“in“thoseŽ¡ les–¢–are“used.‘ܘThis“is“normally“a“vš²!ery“go•MÞo“d–¢–assumption“and“pro˜vides“a“signi can˜t“impro˜v˜emen˜t“inŽ¡pMÞerformance–¦ffor“the“function“ les“that“are“distributed“with“Octa•²!v“e.Ž©Íi‘If–«ôyš²!ou“kno˜w“that“y˜our“o˜wn“function“ les“will“not“c˜hange“while“y˜ou“are“running“Octa˜v˜e,‘íWy˜ouŽ¡can›‡oimpro•²!v“e˜pMÞerformance˜b“y˜setting˜the˜v‘ÿdDariable˜Þignore_function_time_stamp˜Ýto˜Þ"all"Ý,‘¡so˜thatŽ¡Octa•²!v“e–owill“ignore“the“time“stamps“for“all“function“ les.‘ýùSetting“it“to“Þ"system"“Ýgiv²!es“the“defaultŽ¡bMÞeha•²!vior.‘ÝÝIf›¦fy“ou˜set˜it˜to˜an“ything˜else,˜Octa“v“e˜will˜c“hec“k˜the˜time˜stamps˜on˜all˜function˜ les.ŽŸ'5£ëE5.7‘™Script‘¦MFilesŽŽŸÍi‘ÝA‘Óscript–ÓÝ le“is“a“ le“conš²!taining“(almost)“an˜y“sequence“of“Octa˜v˜e“commands.‘fAIt“is“read“andŽ¡ev‘ÿdDaluated–7ÿjust“as“if“yš²!ou“had“t˜ypMÞed“eac˜h“command“at“the“Octa˜v˜e“prompt,‘Nand“pro˜vides“a“con˜v˜enien˜tŽ¡w•²!a“y–¦fto“pšMÞerform“a“sequence“of“commands“that“do“not“logically“b˜elong“inside“a“function.Ž¦‘Unlikš²!e– }a“function“ le,‘*ya“script“ le“m˜ust“ánot‘H}ÝbMÞegin“with“the“k˜eyw˜ord“ÞfunctionÝ.‘ª:If“it“doMÞes,‘*yOcta˜v˜eŽ¡will–¢äassume“that“it“is“a“function“ le,‘£˜and“that“it“de nes“a“single“function“that“should“bMÞe“ev‘ÿdDaluatedŽ¡as–¦fsoMÞon“as“it“is“de ned.Ž¦‘A‘á³script–á le“also“di ers“from“a“function“ le“in“that“the“v‘ÿdDariables“named“in“a“script“ le“are“notŽ¡lošMÞcal–ÿQv‘ÿdDariables,‘Œbut“are“in“the“same“scop˜e“as“the“other“v‘ÿdDariables“that“are“visible“on“the“commandŽ¡line.Ž¦‘Evš²!en–¡kthough“a“script“ le“ma˜y“not“bMÞegin“with“the“Þfunction“Ýk˜eyw˜ord,‘à,it“is“pMÞossible“to“de neŽ¡more–#¹than“one“function“in“a“single“script“ le“and“load“(but“not“execute)“all“of“them“at“once.‘UÕT‘ÿeoŽ¡do–êthis,‘5‹the“ rst“tokš²!en“in“the“ le“(ignoring“commen˜ts“and“other“white“space)“m˜ust“bMÞe“somethingŽ¡other–than“ÞfunctionÝ.‘úIf“yš²!ou“ha˜v˜e“no“other“statemen˜ts“to“ev‘ÿdDaluate,‘Íy˜ou“can“use“a“statemen˜t“thatŽ¡has–¦fno“e ect,“lik²!e“this:ŽŸÎp‘èUÞ#–¿ªPrevent“Octave“from“thinking“that“thisŽ¡‘èU#–¿ªis“a“function“file:Ž¡¡‘èU1;Ž¡¡‘èU#–¿ªDefine“function“one:Ž¡¡‘èUfunction–¿ªone“()Ž¡‘(g©...ŽŽ Œ‘ÝT‘ÿeo›µ-ha•²!v“e˜Octa“v“e˜read˜and˜compile˜these˜functions˜in“to˜an˜in“ternal˜form,‘¸Þy“ou˜need˜to˜mak“e˜sureŽ¡that–´the“ le“is“in“Octa•²!v“e's–´ÞLOADPATHÝ,‘·wthen“simply“tš²!ypMÞe“the“base“name“of“the“ le“that“con˜tains“theŽ¡commands.‘óµ(Octa•²!v“e–uses“the“same“rules“to“searcš²!h“for“script“ les“as“it“doMÞes“to“searc˜h“for“functionŽ¡ les.)ŽŽŸŒ‹9ÈŸòÝChapter–¦f5:‘ÝÝF‘ÿeunctions“and“Script“Files’» 57ŽŽŽ ƒ3Ú ý¨ðБIf–^¦the“ rst“tokš²!en“in“a“ le“(ignoring“commen˜ts)“is“ÞfunctionÝ,‘Œ¶Octa˜v˜e“will“compile“the“functionŽ¤and–¯try“to“execute“it,‘1prinš²!ting“a“message“w˜arning“abMÞout“an˜y“non-whitespace“c˜haracters“that“appMÞearŽ¡after–¦fthe“function“de nition.Ž© ­‘Note– that“Octa•²!v“e– došMÞes“not“try“to“lo˜okup“the“de nition“of“anš²!y“iden˜ti er“un˜til“it“needs“to“ev‘ÿdDaluateŽ¡it.‘÷TThis–®ãmeans“that“Octa•²!v“e–®ãwill“compile“the“folloš²!wing“statemen˜ts“if“they“appMÞear“in“a“script“ le,‘±orŽ¡are–¦ft²!ypMÞed“at“the“command“line,ŽŸ ´‘èUÞ#–¿ªnot“a“function“file:Ž¡‘èU1;Ž¡‘èUfunction–¿ªfoo“()Ž¡‘(g©do_something‘¿ª();Ž¡‘èUendfunctionŽ¡‘èUfunction–¿ªdo_something“()Ž¡‘(g©do_something_else‘¿ª();Ž¡‘èUendfunctionŽŽŸ{FWÝev²!en–àŒthough“the“function“Þdo_something“Ýis“not“de ned“bMÞefore“it“is“referenced“in“the“function“ÞfooÝ.Ž¡This–Uis“not“an“error“bšMÞecause“the“Octa•²!v“e–Udo˜es“not“need“to“resolvš²!e“all“sym˜bMÞols“that“are“referenced“b˜yŽ¡a–¦ffunction“un²!til“the“function“is“actually“ev‘ÿdDaluated.Ž¦‘Since›%¡Octa•²!v“e˜do•MÞesn't˜lo“ok˜for˜de nitions˜un•²!til˜they˜are˜needed,‘Eothe˜follo“wing˜coMÞde˜will˜alw“a“ysŽ¡prin²!t›ŸÃ`Þbar–¦f=“3Ý'˜whether˜it˜is˜t²!ypMÞed˜directly˜on˜the˜command˜line,–¡read˜from˜a˜script˜ le,“or˜is˜partŽ¡of–¦fa“function“b•MÞo“dy‘ÿe,–¦fevš²!en“if“there“is“a“function“or“script“ le“called“`Þbar.mÝ'“in“Octa˜v˜e's“ÞLOADPATHÝ.ŽŸ ´‘èUÞeval–¿ª("bar“=“3");Ž¡‘èUbarŽŽŸ!FW‘ÝCošMÞde–.ëlik²!e“this“app˜earing“within“a“function“b˜o˜dy“could“fo˜ol“Octa•²!v“e–.ëif“de nitions“wš²!ere“resolv˜ed“asŽ¡the–,³function“wš²!as“bMÞeing“compiled.‘µLIt“w˜ould“bšMÞe“virtually“imp˜ossible“to“makš²!e“Octa˜v˜e“clev˜er“enough“toŽ¡ev‘ÿdDaluate–À this“coMÞde“in“a“consistenš²!t“fashion.‘,‹The“parser“w˜ould“ha˜v˜e“to“bšMÞe“able“to“p˜erform“the“`ÞevalŽ¡()Ý'–ˆUstatemenš²!t“at“compile“time,‘ŽXand“that“w˜ould“bšMÞe“imp˜ossible“unless“all“the“references“in“the“stringŽ¡to– bšMÞe“ev‘ÿdDaluated“could“also“b˜e“resolvš²!ed,‘,,and“requiring“that“w˜ould“bšMÞe“to˜o“restrictivš²!e“(the“string“migh˜tŽ¡come–¦ffrom“user“input,“or“depMÞend“on“things“that“are“not“knoš²!wn“un˜til“the“function“is“ev‘ÿdDaluated).ŽŸ .¶ëE5.8‘™Dynamically–¦MLinkŒÌed“F‘þ¦functionsŽŽŸ ­‘ÝOn–Üôsome“systems,‘ê—Octa•²!v“e–Üôcan“dynamically“load“and“execute“functions“written“in“CÞ++“Ýor“otherŽ¡compiled–0;languages.‘¶zThis“currenš²!tly“only“w˜orks“on“systems“that“ha˜v˜e“a“w˜orking“v˜ersion“of“the“GNUŽ¡dynamic›º‰link²!er,–ÿ‘ÞdldÝ.‘EUnfortunately‘ÿe,“Þdld˜ÝdoMÞes˜not˜w•²!ork˜on˜v“ery˜man“y˜systems,‘ÿ‘but˜someone˜isŽ¡wš²!orking–(ßon“making“Þdld“Ýuse“the“GNU‘(¿Binary“File“Descriptor“library‘ÿe,–AúÞBFDÝ,“so–(ßthat“ma˜y“soMÞon“c˜hange.Ž¡In–7¾an²!y“case,‘\it“should“not“bšMÞe“to˜o“hard“to“makš²!e“Octa˜v˜e's“dynamic“linking“features“w˜ork“on“otherŽ¡systems–¦fusing“system-spMÞeci c“dynamic“linking“facilities.Ž¦‘Here–¦fis“an“example“of“hoš²!w“to“write“a“CÞ++“Ýfunction“that“Octa˜v˜e“can“load.ŽŸ ­‘èUÞ#include‘¿ªŽŽŸŒ‹:%ŸòÝ58’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý´ðБèUÞ#include‘¿ª"defun-dld.h"Ž¤ ‘èU#include‘¿ª"tree-const.h"ŽŸ‘èUDEFUN_DLD–¿ª("hello",“Fhello,“Shello,“-1,“-1,Ž¡‘(g©"hello‘¿ª(...)\n\Ž¡‘èU\n\Ž¡‘èUPrint–¿ªgreeting“followed“by“the“values“of“all“the“arguments“passed.\n\Ž¡‘èUReturns–¿ªall“the“arguments“passed.")Ž¡‘èU{Ž¡‘(g©Octave_object‘¿ªretval;Ž¡‘(g©cerr–¿ª<<“"Hello,“world!\n";Ž¡‘(g©int–¿ªnargin“=“args.length“();Ž¡‘(g©for–¿ª(int“i“=“1;“i“<“nargin;“i++)Ž¡‘3æýretval–¿ª(nargin-i-1)“=“args(i).eval“(1);Ž¡‘(g©return‘¿ªretval;Ž¡‘èU}Ž¤‘ÝOcta•²!v“e's–¦fdynamic“linking“features“currenš²!tly“ha˜v˜e“the“follo˜wing“limitations.Ž¡‘ú‘厑®dÝDynamic–¦flinking“only“wš²!orks“on“systems“that“suppMÞort“the“GNU“dynamic“link˜er,“ÞdldÝ.Ž¤c¡‘ú‘厑®dÝClearing–¦fdynamically“linkš²!ed“functions“doMÞesn't“w˜ork.Ž¡‘ú‘厑®dÝCon guring›̺Octa•²!v“e˜with˜Þ--enable-lite-kernel˜Ýseems˜to˜mostly˜w“ork˜to˜mak“e˜nonessen“tialŽ¤‘®dbuilt-in–hCfunctions“dynamically“loaded,‘t°but“there“also“seem“to“bMÞe“some“problems.‘É'F‘ÿeor“example,Ž¡‘®dfsolvš²!e–lÓseems“to“alw˜a˜ys“return“Þinfo–¦f==“3Ý.‘1#This–lÓis“dicult“to“debug“since“Þgdb“Ýw˜on't“seem“toŽ¡‘®dallo•²!w›¦fbreakpMÞoin“ts˜to˜bMÞe˜set˜inside˜dynamically˜loaded˜functions.ŽŸc¡‘ú‘厑®dÝOcta•²!v“e–)Óuses“a“lot“of“memory“if“the“dynamically“link²!ed“functions“are“compiled“to“include“de-Ž¡‘®dbugging–Éäsym²!bšMÞols.‘HWThis“app˜ears“to“b˜e“a“limitation“with“ÞdldÝ,‘ÒÄand“can“b˜e“a•²!v“oided›Éäb“y˜not˜usingŽ¡‘®dÞ-g–¦fÝto“compile“functions“that“will“bMÞe“link²!ed“dynamically‘ÿe.Ž©c¡‘If–Jðyš²!ou“w˜ould“lik˜e“to“v˜olun˜teer“to“help“impro˜v˜e“Octa˜v˜e's“abilit˜y“to“dynamically“link“externallyŽ¡compiled–¦ffunctions,“please“con²!tact“Þbug-octave@che.utexas.eduÝ.ŽŸÇBëE5.9‘™Organization–¦Mof“F‘þ¦functions“Distributed“with“Octa•ŒÌv“eŽŽŸ‘ÝManš²!y–Ê•of“Octa˜v˜e's“standard“functions“are“distributed“as“function“ les.‘”˜They“are“loMÞosely“organizedŽ¡b²!y–vZtopic,›³)in“subMÞdirectories“of“`ÞOCTAVE_HOME/lib/octave/VERSION/mÝ',˜to“mak²!e“it“easier“to“ nd“them.ŽŸ‘The–·folloš²!wing“is“a“list“of“all“the“function“ le“subMÞdirectories,‘»/and“the“t˜ypMÞes“of“functions“y˜ou“willŽ¡ nd‘¦fthere.Ž¦`ÞcontrolÝ'ŽŽ‘9ÐóF‘ÿeunctions–¦ffor“design“and“simš²!ulation“of“automatic“con˜trol“systems.Ž¤ÇB`ÞelfunÝ'ŽŽ‘9ÐóElemen²!tary‘¦ffunctions.Ž¡`ÞgeneralÝ'ŽŽ‘9ÐóMiscellaneous–”matrix“manipulations,›Ïplik²!e“ÞflipudÝ,˜Þrot90Ý,˜and“ÞtriuÝ,˜as“w²!ell“as“otherŽŸ‘9Ðóbasic–¦ffunctions,“lik²!e“Þis_matrixÝ,“ÞnargchkÝ,“etc.Ž¡`ÞimageÝ'ŽŽ‘9ÐóImage–¦fprošMÞcessing“to˜ols.‘ÝÝThese“functions“require“the“X“Windo²!w“System.ŽŽŸŒ‹;1ŒŸòÝChapter–¦f5:‘ÝÝF‘ÿeunctions“and“Script“Files’» 59ŽŽŽ ƒ3Ú ý¨ðÐ`Þlinear-algebraÝ'Ž¤‘9ÐóF‘ÿeunctions–¦ffor“linear“algebra.Ž©`ÞmiscellaneousÝ'Ž¡‘9ÐóF‘ÿeunctions–¦fthat“don't“really“bMÞelong“an²!ywhere“else.Ž¦`ÞplotÝ'ŽŽ‘9ÐóA–¦fset“of“functions“that“implemenš²!t“the“ãMa‘ÿEtlabÝ-lik˜e“plotting“functions.Ž¦`ÞpolynomialÝ'Ž¡‘9ÐóF‘ÿeunctions–¦ffor“manipulating“pMÞolynomials.Ž¦`ÞsetÝ'ŽŽ‘9ÐóF‘ÿeunctions–¦ffor“creating“and“manipulating“sets“of“unique“v‘ÿdDalues.Ž¦`ÞsignalÝ'ŽŽ‘9ÐóF‘ÿeunctions–¦ffor“signal“proMÞcessing“applications.Ž¦`ÞspecfunÝ'ŽŽ‘9ÐóSpMÞecial‘¦ffunctions.Ž¦`Þspecial-matrixÝ'Ž¡‘9ÐóF‘ÿeunctions–¦fthat“create“spMÞecial“matrix“forms.Ž¦`ÞstartupÝ'ŽŽ‘9ÐóOcta•²!v“e's–¦fsystem-wide“startup“ le.Ž¦`ÞstatisticsÝ'Ž¡‘9ÐóStatistical‘¦ffunctions.Ž¦`ÞstringsÝ'ŽŽ‘9ÐóMiscellaneous–¦fstring-handling“functions.ŽŸ‘See–NÛSection“6.2“[User“Preferences],‘`]page“62“for“an“explanation“of“the“built-in“v‘ÿdDariable“ÞLOADPATHÝ,Ž¡and–yESection“5.6“[F‘ÿeunction“Files],‘­üpage“55“for“a“description“of“the“w•²!a“y›yEOcta“v“e˜resolv“es˜unde nedŽ¡v‘ÿdDariable–¦fand“function“names.ŽŽŸŒ‹<<<ŸòÝ60’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹=@ðŸòÝChapter–¦f6:‘ÝÝBuilt-in“V‘ÿeariables’>Om61ŽŽŽ ƒ3Ú ý¨ðÐè6‘ ¸QBuilt-in‘¦MV‘þaGariablesŽŽŸF‘ÝMost›qFOcta•²!v“e˜v‘ÿdDariables˜are˜a“v‘ÿdDailable˜for˜y“ou˜to˜use˜for˜y“our˜o“wn˜purpMÞoses;‘Öµthey˜nev“er˜c“hangeŽ¤except–§Âwhen“yš²!our“program“assigns“v‘ÿdDalues“to“them,‘èand“nev˜er“a ect“an˜ything“except“when“y˜ourŽ¡program–¦fexamines“them.Ž©‘A‘'Ofew–'pv‘ÿdDariables“ha•²!v“e–'pspMÞecial“built-in“meanings.‘`ûSome“of“them,‘G²likš²!e“Þpi“Ýand“Þeps“Ýpro˜vide“usefulŽ¡prede ned–æconstanš²!t“v‘ÿdDalues.‘ Others,‘ölik˜e“Þdo_fortran_indexing“Ýand“Þpage_screen_output“Ýare“ex-Ž¡amined–÷1automatically“bš²!y“Octa˜v˜e,‘;so“that“y˜ou“can“to“tell“Octa˜v˜e“ho˜w“to“do“certain“things.‘£vThere“areŽ¡also›wt•²!w“o˜spMÞecial˜v‘ÿdDariables,–-¦Þans˜Ýand˜ÞPWDÝ,“that˜are˜set˜automatically˜b•²!y˜Octa“v“e˜and˜carry˜informationŽ¡from–¦fthe“inš²!ternal“w˜orkings“of“Octa˜v˜e“to“y˜our“program.Ž¦‘This–vjcš²!hapter“doMÞcumen˜ts“all“the“built-in“v‘ÿdDariables“of“Octa˜v˜e.‘ÍÞMost“of“them“are“also“doMÞcumen˜tedŽ¡in–¦fthe“cš²!hapters“that“describMÞe“functions“that“use“them,“or“are“a ected“b˜y“their“v‘ÿdDalues.ŽŸ £ëE6.1‘™Prede ned‘¦MConstanŒÌtsŽŽŸ†ÒÞIÝ,–¦fÞiÝ,“ÞJÝ,“ÞjŽŽ‘9ÐóÝA‘©{pure–©½imaginary“n•²!um“bMÞer,‘ê“de ned–©½as“Ÿ÷låpŽ‘ ɾŸ÷l‰p ýàŸ“üÝ1ŽŽŽ‘Çž.‘çãThe“ÞI“Ýand“ÞJ“Ýforms“are“true“constan²!ts,Ž¡‘9Ðóand–G.cannot“bšMÞe“mo˜di ed.‘À6The“Þi“Ýand“Þj“Ýforms“are“likš²!e“ordinary“v‘ÿdDariables,‘o`and“ma˜y“bMÞeŽ¡‘9Ðóused–LÊfor“other“purpMÞoses.‘¿ÿHo•²!w“ev“er,›^¶unlik“e–LÊother“v‘ÿdDariables,˜they“once“again“assume“theirŽ¡‘9ÐóspMÞecial–ôdprede ned“v‘ÿdDalues“if“they“are“cleared“See“Section“27.2“[Miscellaneous“Utilities],Ž¡‘9Ðópage‘¦f154.Ž© ¤ÞInfÝ,‘¦fÞinfŽŽ‘9ÐóÝIn nitš²!y‘ÿe.‘Ž¼This–6°is“the“result“of“an“opMÞeration“lik˜e“1/0,‘ZÃor“an“opMÞeration“that“results“in“aŽ¡‘9Ðó oating–¦fpMÞoinš²!t“o˜v˜er o˜w.Ž¦ÞNaNÝ,‘¦fÞnanŽŽ‘9ÐóÝNot–Õóa“n•²!um“bšMÞer.‘lƒThis–Õóis“the“result“of“an“op˜eration“lik²!e“`Þ0/0Ý',›!Õor“`ÞInf–¦f-“InfÝ',˜or‘Õóan²!yŽ¡‘9ÐóopMÞeration–¦fwith“a“NaN.Ž¦ÞSEEK_SETŽŽŽ¡SEEK_CURŽŽŽ¡SEEK_ENDŽŽ‘9ÐóÝThese–¦fv‘ÿdDariables“maš²!y“bMÞe“used“as“the“optional“third“argumen˜t“for“the“function“ÞfseekÝ.Ž¦ÞepsŽŽ‘9ÐóÝThe– macš²!hine“precision.‘WMore“precisely‘ÿe,‘"YÞeps“Ýis“the“smallest“v‘ÿdDalue“suc˜h“that“`Þ1+epsÝ'“isŽ¡‘9Ðónot–8™equal“to“1.‘”uThis“n•²!um“bšMÞer–8™is“system-dep˜endenš²!t.‘”uOn“mac˜hines“that“suppMÞort“64“bitŽ¡‘9ÐóIEEE–¦f oating“pMÞoinš²!t“arithmetic,“Þeps“Ýis“appro˜ximately“2ä:Ý2204–nìå“Ý10Ÿü¾º®16Ž‘¸çÝ.Ž¦ÞpiŽŽ‘9ÐóÝThe–Pratio“of“the“circumference“of“a“circle“to“its“diameter.‘ÁIn²!ternally‘ÿe,‘aHÞpi“Ýis“computed“asŽ¡‘9Ðó`Þ4.0–¦f*“atan“(1.0)Ý'.Ž¦ÞrealmaxŽŽ‘9ÐóÝThe–Q@largest“ oating“pMÞoinš²!t“n˜um˜bMÞer“that“is“represen˜table.‘ÞkThe“actual“v‘ÿdDalue“is“system-Ž¡‘9ÐódepMÞenden•²!t.‘ÕùOn›Ž»mac“hines˜that˜supp•MÞort˜64˜bit˜IEEE‘Žµ oating˜p“oin²!t˜arithmetic,‘“wÞrealmaxŽ¡‘9ÐóÝis–¦fappro²!ximately“1ä:Ý7977–nìå“Ý10Ÿü¾®308Ž‘ uYÝ.Ž¦ÞrealminŽŽ‘9ÐóÝThe–ÖUsmallest“ oating“pMÞoinš²!t“n˜um˜bMÞer“that“is“represen˜table.‘m©The“actual“v‘ÿdDalue“is“system-Ž¡‘9ÐódepMÞenden•²!t.‘ÕùOn›Ž»mac“hines˜that˜supp•MÞort˜64˜bit˜IEEE‘Žµ oating˜p“oin²!t˜arithmetic,‘“wÞrealminŽ¡‘9ÐóÝis–¦fappro²!ximately“2ä:Ý2251–nìå“Ý10Ÿü¾º®308Ž‘µZÝ.ŽŽŸŒ‹>ACŸòÝ62’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞstdinŽŽŽ¤stdoutŽŽŽ¡stderrŽŽ‘9ÐóÝThese–Òêv‘ÿdDariables“are“the“ le“n•²!um“b•MÞers›Òêcorresp“onding˜to˜the˜standard˜input,‘ standardŽ¡‘9Ðóoutput,‘64and–æ>standard“error“streams.‘eThese“streams“are“preconnected“and“a²!v‘ÿdDailableŽ¡‘9Ðówhen›¦fOcta•²!v“e˜starts.ŽŸ#aƒëE6.2‘™User‘¦MPreferencesŽŽŸØa‘ÝThis–¦fsection“describMÞes“the“v‘ÿdDariables“that“yš²!ou“can“use“to“customize“Octa˜v˜e's“bMÞeha˜vior.ŽŸØa‘Normally‘ÿe,›\"preferences–I‘are“set“in“the“ le“`Þ~/.octavercÝ',˜so“that“yš²!ou“can“customize“y˜our“en˜viron-Ž¡menš²!t–)Úin“the“same“w˜a˜y“eac˜h“time“y˜ou“use“Octa˜v˜e“without“ha˜ving“to“remem˜bMÞer“and“ret˜ypMÞe“all“theŽ¡necessary–¦fcommands.‘ÝÝSee“Section“2.2“[Startup“Files],“page“20“for“more“information.ŽŸ°ÂÞEDITORŽŽ‘9ÐóÝA‘¢-string–¢onaming“the“editor“to“use“with“the“Þedit_history“Ýcommand.‘‡6If“the“en•²!vironmen“tŽ¡‘9Ðóv›ÿdDariable–½~ÞEDITOR“Ýis“set“when“Octa•²!v“e–½~starts,‘ÃDits“v˜alue“is“used“as“the“default.‘#$Otherwise,Ž¡‘9ÐóÞEDITOR–¦fÝis“set“to“Þ"vi"Ý.Ž©°ÂÞIMAGEPATHŽ¡‘9ÐóÝA–¤Þcolon“separated“list“of“directories“in“whicš²!h“to“searc˜h“for“image“ les.‘ÝZSee“Chapter“19Ž¡‘9Ðó[Image–Î;ProšMÞcessing],‘ùwpage“115“for“a“description“of“Octa•²!v“e's–Î;image“pro˜cessing“capabilities.Ž¦ÞINFO_FILEŽ¡‘9ÐóÝA–¦fstring“naming“the“loMÞcation“of“the“Octa•²!v“e–¦finfo“ le.ŽŸØa‘9ÐóThe–¦fdefault“v‘ÿdDalue“is“Þ"/usr/local/info/octave.info"Ý.Ž¦ÞLOADPATHŽŽ‘9ÐóÝA‘=colon–=¨separated“list“of“directories“in“whicš²!h“to“searc˜h“for“function“ les.‘ºóSee“Chapter“5Ž¡‘9Ðó[F‘ÿeunctions–¦¾and“Scripts],‘æÓpage“49.‘ÞäThe“v‘ÿdDalue“of“ÞLOADPATH“Ýo•²!v“errides–¦¾the“en•²!vironmen“tŽ¡‘9Ðóv‘ÿdDariable–¦fÞOCTAVE_PATHÝ.‘ÝÝSee“AppMÞendix“A“[Installation],“page“161.Ž©Øa‘9ÐóÞLOADPATH–¼çÝis“noš²!w“handled“in“the“same“w˜a˜y“as“T‘þ,³Ÿ[wEŽ‘B X‘¼ handles“ÞTEXINPUTSÝ.‘!aIf“the“pathŽ¡‘9Ðóstarts–l§with“`Þ:Ý',‘ž7the“standard“path“is“prepMÞended“to“the“v‘ÿdDalue“of“ÞLOADPATHÝ.‘0¡If“it“endsŽ¡‘9Ðówith–¦f`Þ:Ý'“the“standard“path“is“appMÞended“to“the“v‘ÿdDalue“of“ÞLOADPATHÝ.Ž¦‘9ÐóIn–JIaddition,‘sBif“anš²!y“path“elemen˜t“ends“in“`Þ//Ý',‘sBthat“directory“and“all“subMÞdirectories“itŽ¡‘9Ðóconš²!tains–°µare“searc˜hed“recursiv˜ely“for“function“ les.‘üÊThis“can“result“in“a“sligh˜t“dela˜y“asŽ¡‘9ÐóOcta•²!v“e›K#cac“hes˜the˜lists˜of˜ les˜found˜in˜the˜ÞLOADPATH˜Ýthe˜ rst˜time˜Octa“v“e˜searc“hes˜forŽ¡‘9Ðóa–¶Xfunction.‘ ²After“that,‘ºTsearcš²!hing“is“usually“m˜uc˜h“faster“bMÞecause“Octa˜v˜e“normally“onlyŽ¡‘9Ðóneeds–¦fto“searcš²!h“its“in˜ternal“cac˜he“for“ les.Ž¦‘9ÐóT‘ÿeo›!Ôimpro•²!v“e˜pMÞerformance˜of˜recursiv“e˜directory˜searc“hing,‘@°it˜is˜bMÞest˜for˜eac“h˜directoryŽ¡‘9Ðóthat–í&is“to“bMÞe“searcš²!hed“recursiv˜ely“to“con˜tain“áeither›¶OÝadditional“subMÞdirectories“áor˜ÝfunctionŽ¡‘9Ðó les,–¦fbut“not“a“mixture“of“bMÞoth.Ž¦‘9ÐóSee–"Section“5.9“[Organization“of“F‘ÿeunctions],‘A‡page“58“for“a“description“of“the“functionŽ¡‘9Ðó le–¦fdirectories“that“are“distributed“with“Octa•²!v“e.ŽŽŸŒ‹?N–ŸòÝChapter–¦f6:‘ÝÝBuilt-in“V‘ÿeariables’>Om63ŽŽŽ ƒ3Ú ý¨ðÐÞOCTAVE_VERSIONŽ¤‘9ÐóÝThe–¦fvš²!ersion“n˜um˜bMÞer“of“Octa˜v˜e,“as“a“string.Ž©ÇôÞPAGERŽŽ‘9ÐóÝThe–ùhdefault“v›ÿdDalue“is“Þ"less"Ý,–(or,“if–ùhÞless“Ýis“not“a²!v˜ailable“on“y²!our“system,‘(Þ"more"Ý.‘ÖâSeeŽ¡‘9ÐóAppMÞendix–¦fA“[Installation],“page“161,“and“Chapter“20“[Input“and“Output],“page“117.Ž¦ÞPS1ŽŽ‘9ÐóÝThe–Ñiprimary“prompt“string.‘–ÞWhen“executing“in•²!teractiv“ely‘ÿe,‘üOcta“v“e›Ñidispla“ys˜the˜primaryŽ¡‘9Ðóprompt–¼ùÞPS1“Ýwhen“it“is“ready“to“read“a“command.‘!•Octa•²!v“e›¼ùallo“ws˜the˜prompt˜to˜bMÞeŽ¡‘9Ðócustomized–ubš²!y“inserting“a“n˜um˜bMÞer“of“bac˜kslash-escapšMÞed“sp˜ecial“c²!haracters“that“areŽ¡‘9ÐódecoMÞded–¦fas“follo²!ws:Ž¦‘9Ðó`Þ\tÝ'ŽŽ‘s¡æThe‘¦ftime.Ž¦‘9Ðó`Þ\dÝ'ŽŽ‘s¡æThe‘¦fdate.Ž¦‘9Ðó`Þ\nÝ'ŽŽ‘s¡æBegins–ô‚a“new“line“bš²!y“prin˜ting“the“equiv‘ÿdDalen˜t“of“a“carriage“return“follo˜w˜edŽ¡‘s¡æb²!y–¦fa“line“feed.Ž¦‘9Ðó`Þ\sÝ'ŽŽ‘s¡æThe–¦fname“of“the“program“(usually“just“ÞoctaveÝ).Ž¦‘9Ðó`Þ\wÝ'ŽŽ‘s¡æThe–¦fcurrenš²!t“w˜orking“directory‘ÿe.Ž¦‘9Ðó`Þ\WÝ'ŽŽ‘s¡æThe–¦fbasename“of“the“currenš²!t“w˜orking“directory‘ÿe.Ž¦‘9Ðó`Þ\uÝ'ŽŽ‘s¡æThe–¦fusername“of“the“curren²!t“user.Ž¦‘9Ðó`Þ\hÝ'ŽŽ‘s¡æThe‘¦fhostname.Ž¦‘9Ðó`Þ\#Ý'ŽŽ‘s¡æThe–‹ command“n•²!um“bMÞer–‹ of“this“command,‘öcounš²!ting“from“when“Octa˜v˜e“starts.Ž¦‘9Ðó`Þ\!Ý'ŽŽ‘s¡æThe–í×history“n•²!um“bMÞer–í×of“this“command.‘ XThis“di ers“from“`Þ\#Ý'“bš²!y“the“n˜um˜bMÞerŽ¡‘s¡æof–¦fcommands“in“the“history“list“when“Octa•²!v“e‘¦fstarts.Ž¦‘9Ðó`Þ\$Ý'ŽŽ‘s¡æIf–¦fthe“e ectiv²!e“UID“is“0,“a“#,“otherwise“a“$.Ž¦‘9Ðó`Þ\nnnÝ'ŽŽ‘s¡æThe–¦fcš²!haracter“whose“c˜haracter“cošMÞde“in“o˜ctal“is“`ÞnnnÝ'.Ž¦‘9Ðó`Þ\\Ý'ŽŽ‘s¡æA‘¦fbac²!kslash.Ž¦‘9ÐóThe–¦fdefault“v‘ÿdDalue“of“ÞPS1“Ýis“Þ"\s:\#>“"Ý.‘ÝÝT‘ÿeo“cš²!hange“it,“use“a“command“lik˜eŽŸcú‘V¹HÞoctave:13>–¿ªPS1“=“"\\u@\\h>“"ŽŸcú‘9ÐóÝwhic²!h–\Ÿwill“result“in“the“prompt“`Þboris@kremvax>‘¦fÝ'“for“the“user“`ÞborisÝ'“logged“in“onŽ¡‘9Ðóthe–…Ïhost“`ÞkremvaxÝ'.‘ÓNote“that“t•²!w“o›…Ïbac“kslashes˜are˜required˜to˜en“ter˜a˜bac“kslash˜in“to˜aŽ¡‘9Ðóstring.‘ÝÝSee–¦fSection“3.1.2“[String“Constan²!ts],“page“22.Ž¦ÞPS2ŽŽ‘9ÐóÝThe–§Osecondary“prompt“string,‘ç‰whicš²!h“is“prin˜ted“when“Octa˜v˜e“is“expMÞecting“additionalŽ¡‘9Ðóinput–Ï6to“complete“a“command.‘XLF‘ÿeor“example,‘iwhen“de ning“a“function“o•²!v“er‘Ï6sev“eralŽ¡‘9Ðólines,‘ƒOcta•²!v“e–`äwill“prinš²!t“the“v‘ÿdDalue“of“ÞPS1“Ýat“the“bMÞeginning“of“eac˜h“line“after“the“ rst.Ž¡‘9ÐóOcta•²!v“e›ž`allo“ws˜ÞPS2˜Ýto˜bMÞe˜customized˜in˜the˜same˜w“a“y˜as˜ÞPS1Ý.‘Û0The˜default˜v‘ÿdDalue˜of˜ÞPS2Ž¡‘9ÐóÝis–¦fÞ">“"Ý.ŽŽŸŒ‹@Z±ŸòÝ64’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞautomatic_replotŽ¤‘9ÐóÝIf–îthis“v‘ÿdDariable“is“Þ"true"Ý,‘÷Octa•²!v“e–îwill“automatically“send“a“Þreplot“Ýcommand“toŽ¡‘9ÐóÞgnuplot–dÝeacš²!h“time“the“plot“c˜hanges.‘Ö2Since“this“is“fairly“inecien˜t,‘“þthe“default“v‘ÿdDalue“isŽ¡‘9ÐóÞ"false"Ý.ŽŸ”Þwhitespace_in_literal_matrixŽ¡‘9ÐóÝThis–ïÒv‘ÿdDariable“alloš²!ws“some“con˜trol“o˜v˜er“ho˜w“Octa˜v˜e“decides“to“con˜v˜ert“spaces“to“commasŽ¡‘9Ðóand–¦fsemicolons“in“matrix“expressions“lik²!e“`Þ[m“(1)]Ý'“orŽ© Ê‘V¹HÞ[–¿ª1,“2,ŽŸ ‘b8œ3,–¿ª4“]ŽŸ Ê‘9ÐóÝIf–™the“v‘ÿdDalue“of“Þwhitespace_in_literal_matrix“Ýis“Þ"ignore"Ý,‘›ÂOcta•²!v“e–™will“nev²!er“insertŽ¡‘9Ðóa–R„comma“or“a“semicolon“in“a“literal“matrix“list.‘â6F‘ÿeor“example,‘}‹the“expression“`Þ[1‘¦f2]Ý'Ž¡‘9Ðówill–B‰result“in“an“error“instead“of“bMÞeing“treated“the“same“as“`Þ[1,‘¦f2]Ý',‘V‚and“the“expressionŽ¦‘V¹HÞ[–¿ª1,“2,ŽŸ ‘b8œ3,–¿ª4“]Ž¤ Ê‘9ÐóÝwill–¦fresult“in“the“v²!ector“[1“2“3“4]“instead“of“a“matrix.Ž¡‘9ÐóIf–¸žthe“v‘ÿdDalue“of“Þwhitespace_in_literal_matrix“Ýis“Þ"traditional"Ý,‘è,Octa•²!v“e–¸žwill“con•²!v“ertŽŸ‘9Ðóspaces–¦fto“a“comma“bMÞet•²!w“een›¦fiden“ti ers˜and˜`Þ(Ý'.‘ÝÝF‘ÿeor˜example,˜giv“en˜the˜matrixŽ¦‘V¹HÞm–¿ª=“[3“2]Ž¡‘9ÐóÝthe‘¦fexpressionŽ¦‘V¹HÞ[m‘¿ª(1)]Ž¡‘9ÐóÝwill–¦fbMÞe“parsed“asŽ¦‘V¹HÞ[m,‘¿ª(1)]Ž¡‘9ÐóÝand–¦fwill“result“inŽ¦‘V¹HÞ[3–¿ª2“1]Ž¡‘9ÐóÝand–¦fthe“expressionŽ¦‘V¹HÞ[–¿ª1,“2,ŽŸ ‘b8œ3,–¿ª4“]Ž¡‘9ÐóÝwill–ÇQresult“in“a“matrix“bMÞecause“the“newline“cš²!haracter“is“con˜v˜erted“to“a“semicolon“(ro˜wŽ¤‘9Ðóseparator)–Úgev²!en“though“there“is“a“comma“at“the“end“of“the“ rst“line“(trailing“commasŽ¡‘9Ðóor–¦fsemicolons“are“ignored).‘ÝÝThis“is“apparenš²!tly“ho˜w“ãMa‘ÿEtlab“ÝbMÞeha˜v˜es.ŽŸ Ê‘9ÐóAnš²!y–qÒother“v‘ÿdDalue“for“Þwhitespace_in_literal_matrix“Ýresults“in“bMÞeha˜vior“that“is“theŽ¡‘9Ðósame–ías“traditional,‘ÿkexcept“that“Octa•²!v“e–ídošMÞes“not“con•²!v“ert–íspaces“to“a“comma“b˜et•²!w“eenŽ¡‘9Ðóiden²!ti ers–¦fand“`Þ(Ý'.‘ÝÝF‘ÿeor“example,“the“expressionŽ¦‘V¹HÞ[m‘¿ª(1)]Ž¤ Ê‘9ÐóÝwill–¦fproMÞduce“`Þ3Ý'.‘ÝÝThis“is“the“w•²!a“y›¦fOcta“v“e˜has˜alw“a“ys˜bMÞeha“v“ed.ŽŸ”Þdefault_save_formatŽ¡do_fortran_indexingŽ¤‘9ÐóÝIf–Ì°the“v‘ÿdDalue“of“Þdo_fortran_indexing“Ýis“Þ"true"Ý,‘ÖCOcta•²!v“e›Ì°allo“ws˜y“ou˜to˜select˜elemen“tsŽ¡‘9Ðóof–Â(a“t•²!w“o-dimensional–Â(matrix“using“a“single“index“b²!y“treating“the“matrix“as“a“singleŽ¡‘9Ðóv²!ector–¦fcreated“from“the“columns“of“the“matrix.‘ÝÝThe“default“v‘ÿdDalue“is“Þ"false"Ý.ŽŽŸŒ‹AeJŸòÝChapter–¦f6:‘ÝÝBuilt-in“V‘ÿeariables’>Om65ŽŽŽ ƒ3Ú ý¨ðÐÞempty_list_elements_okŽ¤‘9ÐóÝThis–¦fv‘ÿdDariable“conš²!trols“whether“Octa˜v˜e“ignores“empt˜y“matrices“in“a“matrix“list.Ž©Ĩ‘9ÐóF‘ÿeor–Q1example,›{äif“the“v‘ÿdDalue“of“Þempty_list_elements_ok“Ýis“Þ"true"Ý,˜Octa•²!v“e–Q1will“ignoreŽ¡‘9Ðóthe–¦fempt²!y“matrices“in“the“expressionŽŸĨ‘V¹HÞa–¿ª=“[1,“[],“3,“[],“5]Ž¦‘9ÐóÝand–¦fthe“v›ÿdDariable“`ÞaÝ'“will“bMÞe“assigned“the“v˜alue“`Þ[“1“3“5“]Ý'.Ž¦‘9ÐóThe–¦fdefault“v‘ÿdDalue“is“Þ"warn"Ý.Ž©‰PÞgnuplot_binaryŽ¡‘9ÐóÝThe–HÑname“of“the“program“in•²!v“ok“ed›HÑb“y˜the˜plot˜command.‘ ÅThe˜default˜v‘ÿdDalue˜isŽ¡‘9ÐóÞ"gnuplot"Ý.‘ÝÝSee–¦fAppMÞendix“A“[Installation],“page“161.Ž¦Þignore_function_time_stampŽ¡‘9ÐóÝThis– uv›ÿdDariable“v˜ariable“can“bMÞe“used“to“prev•²!en“t› uOcta“v“e˜from˜making˜the˜system˜callŽ¡‘9ÐóÞstat()–ŸÝeac²!h“time“it“loMÞoks“up“functions“de ned“in“function“ les.‘ÛfIf“Þignore_function_Ž¡‘9Ðótime_stamp–({Ýto“Þ"system"Ý,‘ˆÿOcta•²!v“e–({will“not“automatically“recompile“function“ les“inŽ¡‘9ÐósubMÞdirectories–%®of“Þ/usr/local/lib/1.1.0“Ýif“they“ha•²!v“e›%®c“hanged˜since˜they˜w“ere˜lastŽ¡‘9Ðócompiled,‘êbut–©`will“recompile“other“function“ les“in“the“ÞLOADPATH“Ýif“they“c²!hange.‘æËIfŽ¡‘9Ðóset–B>to“Þ"all"Ý,‘i4Octa•²!v“e–B>will“not“recompile“an²!y“function“ les“unless“their“de nitions“areŽ¡‘9Ðóremo•²!v“ed–WÃwith“ÞclearÝ.‘ñôF‘ÿeor“anš²!y“other“v‘ÿdDalue“of“Þignore_function_time_stampÝ,‘„Octa˜v˜eŽ¡‘9Ðówill› alw•²!a“ys˜c“hec“k˜to˜see˜if˜functions˜de ned˜in˜function˜ les˜need˜to˜recompiled.‘êÅTheŽ¡‘9Ðódefault–¦fv‘ÿdDalue“of“Þignore_function_time_stamp“Ýis“Þ"system"Ý.Ž¦Þimplicit_str_to_num_okŽ¡‘9ÐóÝIf–øïthe“v‘ÿdDalue“of“Þimplicit_str_to_num_ok“Ýis“Þ"true"Ý,‘ ‘implicit“con•²!v“ersions–øïof“strings“toŽ¡‘9Ðótheir–<`nš²!umeric“ASCIMÞI‘<9equiv‘ÿdDalen˜ts“are“allo˜w˜ed.‘ŸÊOtherwise,‘aÞan“error“message“is“prin˜tedŽ¡‘9Ðóand–¦fconš²!trol“is“returned“to“the“top“lev˜el.‘ÝÝThe“default“v‘ÿdDalue“is“Þ"false"Ý.Ž¦Þok_to_lose_imaginary_partŽ¡‘9ÐóÝIf–Ý“the“v‘ÿdDalue“of“Þok_to_lose_imaginary_part“Ýis“Þ"true"Ý,‘½implicit“con•²!v“ersions–Ý“of“complexŽ¡‘9Ðón•²!um“bšMÞers–ç©to“real“n•²!um“b˜ers–ç©are“allo•²!w“ed–ç©(for“example,‘÷úbš²!y“fsolv˜e).‘¡§If“the“v‘ÿdDalue“is“Þ"warn"Ý,Ž¡‘9Ðóthe›±Àcon•²!v“ersion˜is˜allo“w“ed,‘ô–but˜a˜w“arning˜is˜prin“ted.‘ÿêOtherwise,‘ô–an˜error˜message˜isŽ¡‘9Ðóprinš²!ted–¦fand“con˜trol“is“returned“to“the“top“lev˜el.‘ÝÝThe“default“v‘ÿdDalue“is“Þ"warn"Ý.Ž¦Þoutput_max_field_widthŽ¡‘9ÐóÝThis–ò“v‘ÿdDariable“spMÞeci es“the“maximš²!um“width“of“a“n˜umeric“output“ eld.‘¡ìThe“default“v‘ÿdDalueŽ¡‘9Ðóis‘¦f10.ŽŸĨ‘9ÐóIt–SÌis“pMÞossible“to“ac•²!hiev“e–SÌa“wide“range“of“output“stš²!yles“b˜y“using“di eren˜t“v‘ÿdDalues“ofŽ¡‘9ÐóÞoutput_precision–NÝand“Þoutput_max_field_widthÝ.‘ÔáReasonable“com²!binations“can“bMÞeŽ¡‘9Ðóset–¦fusing“the“Þformat“Ýfunction.‘ÝÝSee“Section“20.1“[Basic“Input“and“Output],“page“117.Ž¦Þoutput_precisionŽ¡‘9ÐóÝThis–ç¾v‘ÿdDariable“spMÞeci es“the“minimš²!um“n˜um˜bMÞer“of“signi can˜t“ gures“to“displa˜y“for“n˜umericŽ¡‘9Ðóoutput.‘ÝÝThe–¦fdefault“v‘ÿdDalue“is“5.ŽŽŸŒ‹BoZŸòÝ66’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБ9ÐóIt–SÌis“pMÞossible“to“ac•²!hiev“e–SÌa“wide“range“of“output“stš²!yles“b˜y“using“di eren˜t“v‘ÿdDalues“ofŽ¤‘9ÐóÞoutput_precision–NÝand“Þoutput_max_field_widthÝ.‘ÔáReasonable“com²!binations“can“bMÞeŽ¡‘9Ðóset–¦fusing“the“Þformat“Ýfunction.‘ÝÝSee“Section“20.1“[Basic“Input“and“Output],“page“117.Ž©çìÞpage_screen_outputŽ¡‘9ÐóÝIf–v{the“v‘ÿdDalue“of“Þpage_screen_output“Ýis“Þ"true"Ý,‘€all“output“in²!tended“for“the“screen“thatŽ¡‘9Ðóis–Ÿälonger“than“one“page“is“senš²!t“through“a“pager.‘Û²This“allo˜ws“y˜ou“to“view“one“screenfulŽ¡‘9Ðóat–="a“time.‘¢Some“pagers“(suc²!h“as“ÞlessÝ|see“AppMÞendix“A‘<û[Installation],‘bÑpage“161)“areŽ¡‘9Ðóalso–Íwcapable“of“moš²!ving“bac˜kw˜ard“on“the“output.›SThe“default“v‘ÿdDalue“is“Þ"true"Ý.˜SeeŽ¡‘9ÐóChapter–¦f20“[Input“and“Output],“page“117.ŽŸóö‘9ÐóY‘ÿeou–¦fcan“cš²!hoMÞose“the“program“to“use“as“the“pager“b˜y“setting“the“v‘ÿdDariable“ÞPAGERÝ.Ž¦Þprefer_column_vectorsŽ¡‘9ÐóÝIf–¦fÞprefer_column_vectors“Ýis“Þ"true"Ý,“opMÞerations“lik²!eŽŸóö‘V¹HÞfor–¿ªi“=“1:10Ž¤ ‘b8œa–¿ª(i)“=“i;Ž¡‘V¹HendforŽ¤óö‘9ÐóÝ(for–Bj`ÞaÝ'“previously“unde ned)“proMÞduce“column“v•²!ectors.‘ ±èOtherwise,‘©jro“w›Bjv“ectors˜areŽ©‘9Ðópreferred.‘ÝÝThe–¦fdefault“v‘ÿdDalue“is“Þ"false"Ý.Ž¡‘9ÐóIf–ÄPa“v‘ÿdDariable“is“already“de ned“to“bMÞe“a“vš²!ector“(a“matrix“with“a“single“ro˜w“or“column),‘ñˆtheŽ¦‘9Ðóoriginal–¦forien²!tation“is“respMÞected,“regardless“of“the“v‘ÿdDalue“of“Þprefer_column_vectorsÝ.ŽŸçìÞprefer_zero_one_indexingŽ¦‘9ÐóÝIf–ˆøthe“v‘ÿdDalue“of“Þprefer_zero_one_indexing“Ýis“Þ"true"Ý,‘ÁOcta•²!v“e–ˆøwill“pMÞerform“zero-oneŽ¦‘9Ðóst²!yle–£indexing“when“there“is“a“con ict“with“the“normal“indexing“rules.‘Ü»See“Section“3.5Ž¦‘9Ðó[Index–¦fExpressions],“page“26.‘ÝÝF‘ÿeor“example,“giv²!en“a“matrixŽ©óö‘V¹HÞa–¿ª=“[1,“2,“3,“4]Ž¡‘9ÐóÝwith–¦fÞprefer_zero_one_indexing“Ýis“set“to“Þ"true"Ý,“the“expressionŽ¦‘V¹HÞa–¿ª([1,“1,“1,“1])Ž¡‘9ÐóÝresults–÷iin“the“matrix“`Þ[–¦f1“2“3“4“]Ý'.‘ÐåIf–÷ithe“v‘ÿdDalue“of“Þprefer_zero_one_indexing“Ýset“toŽ©‘9ÐóÞ"false"Ý,–¦fthe“result“w²!ould“bMÞe“the“matrix“`Þ[“1“1“1“1“]Ý'.Ž¡‘9ÐóIn–!Œthe“ rst“case,‘@UOcta•²!v“e–!Œis“selecting“eacš²!h“elemen˜t“correspMÞonding“to“a“`Þ1Ý'“in“the“indexŽ¦‘9Ðóvš²!ector.‘ÝÝIn–¦fthe“second,“Octa˜v˜e“is“selecting“the“ rst“elemen˜t“m˜ultiple“times.Ž¡‘9ÐóThe–¦fdefault“v‘ÿdDalue“for“Þprefer_zero_one_indexing“Ýis“Þ"false"Ý.Ž¤çìÞprint_answer_id_nameŽ¦‘9ÐóÝIf–æVthe“v›ÿdDalue“of“Þprint_answer_id_name“Ýis“Þ"true"Ý,‘6Rv˜ariable“names“are“prin²!ted“alongŽ¦‘9Ðówith–¢\the“result.›ÑÀOtherwise,‘áZonly“the“result“v‘ÿdDalues“are“prin²!ted.˜The“default“v‘ÿdDalue“isŽ¦‘9ÐóÞ"true"Ý.Ž¡Þprint_empty_dimensionsŽ¦‘9ÐóÝIf–uŒthe“v‘ÿdDalue“of“Þprint_empty_dimensions“Ýis“Þ"true"Ý,‘Qthe“dimensions“of“empt²!y“matricesŽ¦‘9Ðóare–¦fprinš²!ted“along“with“the“empt˜y“matrix“sym˜bMÞol,“`Þ[]Ý'.‘ÝÝF‘ÿeor“example,“the“expressionŽŽŸŒ‹C{ÝŸòÝChapter–¦f6:‘ÝÝBuilt-in“V‘ÿeariables’>Om67ŽŽŽ ƒ3Ú ý¨ðБV¹HÞzeros–¿ª(3,“0)ŽŸl—‘9ÐóÝwill‘¦fprin²!tŽŸl—‘V¹HÞans‘¿ª=ŽŸ‘V¹H[](3x0)Ž©Ù.propagate_empty_matricesŽ¤‘9ÐóÝIf–sgthe“v‘ÿdDalue“of“Þpropagate_empty_matrices“Ýis“Þ"true"Ý,‘}šfunctions“lik²!e“Þinverse“Ýand“ÞsvdŽ¡‘9ÐóÝwill–Breturn“an“emptš²!y“matrix“if“they“are“giv˜en“one“as“an“argumen˜t.‘ëpThe“default“v‘ÿdDalueŽ¡‘9Ðóis–¦fÞ"true"Ý.‘ÝÝSee“Section“3.2.1“[Empt²!y“Matrices],“page“24.Ž¦Þresize_on_range_errorŽ¡‘9ÐóÝIf–¦fthe“v‘ÿdDalue“of“Þresize_on_range_error“Ýis“Þ"true"Ý,“expressions“lik²!eŽŸl—‘V¹HÞfor–¿ªi“=“1:10Ž¤ ‘b8œa–¿ª(i)“=“i;Ž¡‘V¹HendforŽŸl—‘9ÐóÝ(for–zi`ÞaÝ'“previously“unde ned)“result“in“the“v‘ÿdDariable“`ÞaÝ'“bšMÞeing“resized“to“b˜e“just“largeŽ¤‘9Ðóenough–µ/to“hold“the“new“v‘ÿdDalue.› 9Otherwise“uninitialized“elemen²!ts“are“set“to“zero.˜If“theŽ¡‘9Ðóv‘ÿdDalue–ÀÞof“Þresize_on_range_error“Ýis“Þ"false"Ý,‘Ç}an“error“message“is“prinš²!ted“and“con˜trolŽ¡‘9Ðóis–¦freturned“to“the“top“lev²!el.‘ÝÝThe“default“v‘ÿdDalue“is“Þ"true"Ý.Ž¦Þreturn_last_computed_valueŽ¡‘9ÐóÝIf–ûºthe“v‘ÿdDalue“of“Þreturn_last_computed_value“Ýis“true,‘and“a“function“is“de ned“with-Ž¡‘9Ðóout–B:explicitly“spMÞecifying“a“return“v›ÿdDalue,‘i/the“function“will“return“the“v˜alue“of“the“lastŽ¡‘9Ðóexpression.›ÝÝOtherwise,–¦fno“v‘ÿdDalue“will“bMÞe“returned.˜The“default“v‘ÿdDalue“is“Þ"false"Ý.Ž©l—‘9ÐóF‘ÿeor–¦fexample,“the“functionŽŸl—‘V¹HÞfunction–¿ªf“()Ž¤ ‘b8œ2–¿ª+“2;Ž¡‘V¹HendfunctionŽ¦‘9ÐóÝwill–PUeither“return“nothing,›zÑif“Þreturn_last_computed_value“Ýis“Þ"false"Ý,˜or“4,˜if“it“isŽ¤‘9ÐóÞ"true"Ý.Ž©Ù.Þsave_precisionŽ¡‘9ÐóÝThis–`Ôv‘ÿdDariable“spšMÞeci es“the“n•²!um“b˜er–`Ôof“digits“to“kš²!eep“when“sa˜ving“data“with“the“ÞsaveŽ¡‘9ÐóÝcommand.‘ÝÝThe–¦fdefault“v‘ÿdDalue“is“17.Ž¦Þsilent_functionsŽ¡‘9ÐóÝIf–Cqthe“v‘ÿdDalue“of“Þsilent_functions“Ýis“Þ"true"Ý,‘j´in²!ternal“output“from“a“function“is“sup-Ž¡‘9Ðópressed.‘ÕOtherwise,‘’wthe–|results“of“expressions“within“a“function“b•MÞo“dy–|that“are“not“ter-Ž¡‘9Ðóminated–\with“a“semicolon“will“ha•²!v“e–\their“v›ÿdDalues“prin²!ted.‘ÅThe“default“v˜alue“is“Þ"false"Ý.ŽŸl—‘9ÐóF‘ÿeor–¦fexample,“if“the“functionŽŸl—‘V¹HÞfunction–¿ªf“()Ž¤ ‘b8œ2–¿ª+“2Ž¡‘V¹HendfunctionŽŽŸŒ‹D‡ŽŸòÝ68’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБ9Ðóis›°ºexecuted,‘óOOcta•²!v“e˜will˜either˜prin“t˜`Þans–¦f=“4Ý'˜or˜nothing˜depMÞending˜on˜the˜v‘ÿdDalue˜ofŽ¤‘9ÐóÞsilent_functionsÝ.ŽŸAæÞsplit_long_rowsŽ¡‘9ÐóÝF‘ÿeor–’large“matrices,‘Octa•²!v“e›’ma“y˜not˜bMÞe˜able˜to˜displa“y˜all˜the˜columns˜of˜a˜giv“en˜ro“wŽ¡‘9Ðóon–{íone“line“of“y²!our“screen.‘^sThis“can“result“in“missing“information“or“output“that“isŽ¡‘9Ðónearly–\DimpšMÞossible“to“decipher,‘kdep˜ending“on“whether“y²!our“terminal“truncates“or“wrapsŽ¡‘9Ðólong‘¦flines.ŽŸ ó‘9ÐóIf–Ôlthe“v‘ÿdDalue“of“Þsplit_long_rows“Ýis“Þ"true"Ý,‘ßîOcta•²!v“e–Ôlwill“displa²!y“the“matrix“in“a“seriesŽ¡‘9Ðóof–³’smaller“pieces,‘¶Ýeacš²!h“of“whic˜h“can“ t“within“the“limits“of“y˜our“terminal“width.‘bEac˜hŽ¡‘9Ðóset–Ö,of“roš²!ws“is“labMÞeled“so“that“y˜ou“can“easily“see“whic˜h“columns“are“curren˜tly“bMÞeingŽ¡‘9Ðódispla•²!y“ed.‘ÝÝF‘ÿeor‘¦fexample:ŽŸ ó‘V¹HÞoctave:13>–¿ªrand“(2,“9)Ž© ‘V¹Hans‘¿ª=Ž¤‘\xòColumns–¿ª1“through“7:Ž¡‘gøF0.92205– T0.72628“0.99841“0.62590“0.82422“0.77486“0.30258Ž¦‘gøF0.15999– T0.79484“0.75443“0.86995“0.91430“0.23980“0.64591Ž¡‘\xòColumns–¿ª8“and“9:Ž¡‘b8œ0.08894‘ T0.13266Ž¦‘b8œ0.28008‘ T0.65575Ž¤ ó‘9ÐóÝThe–¦fdefault“v‘ÿdDalue“of“Þsplit_long_rows“Ýis“Þ"true"Ý.ŽŸAæÞtreat_neg_dim_as_zeroŽ©‘9ÐóÝIf–¦fthe“v‘ÿdDalue“of“Þtreat_neg_dim_as_zero“Ýis“Þ"true"Ý,“expressions“lik²!eŽŸ ó‘V¹HÞeye‘¿ª(-1)Ž¡‘9ÐóÝproMÞduce–2¨an“emptš²!y“matrix“(i.e.,‘U¸ro˜w“and“column“dimensions“are“zero).‘‚¢Otherwise,‘U¸anŽ¦‘9Ðóerror–é[message“is“prinš²!ted“and“con˜trol“is“returned“to“the“top“lev˜el.‘¦¼The“default“v‘ÿdDalue“isŽ¦‘9ÐóÞ"false"Ý.ŽŸAæÞwarn_assign_as_truth_valueŽ¦‘9ÐóÝIf–€ôthe“v‘ÿdDalue“of“Þwarn_assign_as_truth_value“Ýis“Þ"true"Ý,‘ˆqa“w²!arning“is“issued“for“state-Ž¦‘9Ðómen•²!ts‘¦flik“eŽ© ó‘V¹HÞif–¿ª(s“=“t)ŽŸ ‘b8œ...Ž¡‘9ÐóÝsince–¦fsucš²!h“statemen˜ts“are“not“common,“and“it“is“lik˜ely“that“the“in˜ten˜t“w˜as“to“writeŽ¦‘V¹HÞif–¿ª(s“==“t)ŽŸ ‘b8œ...Ž¡‘9ÐóÝinstead.Ž¡‘9ÐóThere–/Rare“times“when“it“is“useful“to“write“coMÞde“that“conš²!tains“assignmen˜ts“within“theŽŸ‘9Ðócondition–¦fof“a“Þwhile“Ýor“Þif“Ýstatemenš²!t.‘ÝÝF‘ÿeor“example,“statemen˜ts“lik˜eŽŽŸŒ‹E§ŸòÝChapter–¦f6:‘ÝÝBuilt-in“V‘ÿeariables’>Om69ŽŽŽ ƒ3Ú ý¨ðБV¹HÞwhile–¿ª(c“=“getc())Ž© ‘b8œ...Ž¤ )‘9ÐóÝare–¦fcommon“in“C“programming.Ž¡‘9ÐóIt–LXis“pšMÞossible“to“a•²!v“oid–LXall“w²!arnings“ab˜out“sucš²!h“statemen˜ts“b˜y“setting“Þwarn_assign_as_ŽŸ‘9Ðótruth_value–¦fÝto“Þ"false"Ý,“but“that“maš²!y“also“let“real“errors“lik˜eŽŸ )‘V¹HÞif–¿ª(x“=“1)‘ T#“intended“to“test“(x“==“1)!Ž¦‘b8œ...Ž¡‘9ÐóÝslip‘¦fb²!y‘ÿe.Ž¡‘9ÐóIn–suc²!h“cases,‘6it“is“pšMÞossible“suppress“errors“for“sp˜eci c“statemenš²!ts“b˜y“writing“them“withŽŸ‘9Ðóan–¦fextra“set“of“paren²!theses.‘ÝÝF‘ÿeor“example,“writing“the“previous“example“asŽŸ )‘V¹HÞwhile–¿ª((c“=“getc()))Ž¦‘b8œ...Ž¡‘9ÐóÝwill›Â{prev•²!en“t˜the˜w“arning˜from˜bMÞeing˜prin“ted˜for˜this˜statemen“t,‘Éwhile˜allo“wing˜Octa“v“eŽ©‘9Ðóto–¦fwš²!arn“abMÞout“other“assignmen˜ts“used“in“conditional“con˜texts.Ž¡‘9ÐóThe–¦fdefault“v‘ÿdDalue“of“Þwarn_assign_as_truth_value“Ýis“Þ"true"Ý.ŽŸRÞwarn_comma_in_global_declŽ¦‘9ÐóÝIf–úwthe“v‘ÿdDalue“of“Þwarn_comma_in_global_decl“Ýis“Þ"true"Ý,‘{a“w²!arning“is“issued“for“state-Ž¦‘9Ðómen•²!ts‘¦flik“eŽŸ )‘V¹HÞglobal–¿ªa“=“1,“bŽ¡‘9ÐóÝwhic•²!h›n mak“es˜the˜v–ÿdDariables˜`ÞaÝ'˜and˜`ÞbÝ'˜global˜and˜assigns˜the˜v“alue˜1˜to˜the˜v“ariable˜`ÞaÝ',Ž¦‘9ÐóbMÞecause–¦fin“this“conš²!text,“the“comma“is“not“in˜terpreted“as“a“statemen˜t“separator.Ž¡‘9ÐóThe–¦fdefault“v‘ÿdDalue“of“Þwarn_comma_in_global_decl“Ýis“Þ"true"Ý.ŽŸRÞwarn_divide_by_zeroŽ¦‘9ÐóÝIf–OÌthe“v‘ÿdDalue“of“Þwarn_divide_by_zero“Ýis“Þ"true"Ý,‘º%a“wš²!arning“is“issued“when“Octa˜v˜eŽ¦‘9Ðóencounš²!ters–fa“division“b˜y“zero.‘ÖIf“the“v‘ÿdDalue“is“Þ"false"Ý,‘•øthe“w˜arning“is“omitted.‘ÖTheŽ¦‘9Ðódefault–¦fv‘ÿdDalue“is“Þ"true"Ý.ŽŸ $¢ëE6.3‘™Other–¦MBuilt-in“V‘þ¦fariablesŽŽŸ )‘ÝIn–saddition“to“these“v›ÿdDariables,‘Ç6there“are“t•²!w“o–sother“spMÞecial“built-in“v˜ariables“whose“v˜alues“areŽ¦automatically‘¦fupMÞdated.ŽŸRÞansŽŽ‘9ÐóÝThis–vv‘ÿdDariable“holds“the“most“recenš²!tly“computed“result“that“w˜as“not“explicitly“assignedŽ¦‘9Ðóto–¦fa“v‘ÿdDariable.‘ÝÝF‘ÿeor“example,“after“the“expressionŽŸ )‘V¹HÞ3^2–¿ª+“4^2Ž¡‘9ÐóÝis–¦fev›ÿdDaluated,“the“v˜alue“of“Þans“Ýis“`Þ25Ý'.ŽŸRÞPWDŽŽ‘9ÐóÝThe–ëûcurrenš²!t“w˜orking“directory‘ÿe.‘®›The“v‘ÿdDalue“of“ÞPWD“Ýis“upMÞdated“eac˜h“time“the“curren˜tŽ¦‘9Ðówš²!orking–¹}directory“is“c˜hanged“with“the“`ÞcdÝ'“command.‘ŽåSee“Chapter“24“[System“Utilities],Ž¦‘9Ðópage‘¦f145.ŽŽŸŒ‹F™zŸòÝ70’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐëE6.4‘™Summary–¦Mof“Preference“V‘þ¦fariablesŽŽŸ‘ÝHere–‡dis“a“summary“of“all“of“Octa•²!v“e's–‡dpreference“v›ÿdDariables“and“their“default“v˜alues.‘~2In“the“follo²!wingŽ¤table–jšÞOCTAVE_HOME“Ýstands“for“the“roMÞot“directory“where“Octa•²!v“e–jšis“installed,‘vand“ÞVERSION“Ýstands“forŽ¡the›¦fOcta•²!v“e˜v“ersion˜n“um“bMÞer.ŽŸ‘èUÞEDITOR’„8FEDITOR–¿ªenvironment“variable,“or“"vi"Ž¤ ‘èUINFO_FILE‘rùH"OCTAVE_HOME/info/octave.info"Ž¡‘èULOADPATH‘x¸òOCTAVE_PATH–¿ªenvironment“variable,“orŽ¡’Þ—".:OCTAVE_HOME/lib/VERSION"Ž¡‘èUPAGER’‰÷ð"less",–¿ªor“"more"Ž¡‘èUPS1’•wD"\s:\#>‘¿ª"Ž¡‘èUPS2’•wD">‘¿ª"Ž¡‘èUautomatic_replot‘J»¢"false"Ž¡‘èUwhitespace_in_literal_matrix‘¿ª""Ž¡‘èUdo_fortran_indexing‘9|¤"false"Ž¡‘èUempty_list_elements_ok‘(=¦"warn"Ž¡‘èUgnuplot_binary‘V:ö"gnuplot"Ž¡‘èUignore_function_time_stamp‘>þ"system"Ž¡‘èUimplicit_str_to_num_ok‘(=¦"false"Ž¡‘èUok_to_lose_imaginary_part‘þ¨"warn"Ž¡‘èUoutput_max_field_width‘(=¦10Ž¡‘èUoutput_precision‘J»¢5Ž¡‘èUpage_screen_output‘?þ"false"Ž¡‘èUsave_precision‘V:ö17Ž¡‘èUsilent_functions‘J»¢"false"Ž¡‘èUsplit_long_rows‘P{L"true"Ž¡‘èUtreat_neg_dim_as_zero‘-ýP"false"Ž¡‘èUwarn_assign_as_truth_value‘>þ"true"Ž¡‘èUwarn_comma_in_global_decl‘þ¨"true"Ž¡‘èUwarn_divide_by_zero‘9|¤"true"ŽŽŸŒ‹G£?ŸòÝChapter‘¦f7:‘ÝÝArithmetic’^ÃÍ71ŽŽŽ ƒ3Ú ý¨ðÐè7‘ ¸QArithmeticŽŽŸ'‘ÝUnless–é†otherwise“noted,‘:Nall“of“the“functions“describMÞed“in“this“cš²!hapter“will“w˜ork“for“real“andŽ¤complex–¦fscalar“or“matrix“argumen²!ts.ŽŸ?”ëE7.1‘™UtilitŒÌy‘¦MF‘þ¦functionsŽŽŸ‘ÝThe–‘folloš²!wing“functions“are“a˜v‘ÿdDailable“for“w˜orking“with“complex“n˜um˜bMÞers.‘ÖAEac˜h“expMÞects“a“singleŽ¡argumenš²!t,–¦fand“giv˜en“a“matrix,“they“w˜ork“on“an“elemen˜t“b˜y“elemen˜t“basis.ŽŸŸÊÞceil‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–ìthe“smallest“in²!teger“not“less“than“áxÝ.‘¯If“áx‘­}Ýis“complex,‘ý‹return“Þceil–¦f(real“(áx‘Á_Þ))Ž¡‘9Ðó+–¦fceil“(imag“(áx‘Á_Þ))“*“IÝ.Ž©?”Þfloor‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–¬the“largest“in²!teger“not“greater“than“áxÝ.‘î¶If“áx‘mcÝis“complex,‘íkreturn“Þfloor‘¦f(realŽ¡‘9Ðó(áx›Á_Þ))–¦f+“floor“(imag“(áx˜Þ))“*“IÝ.Ž¦Þfix‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝT‘ÿeruncate›ì=áx‘­œÝto•²!w“ard˜zero.‘¯aIf˜áx‘­œÝis˜complex,‘ý²return˜Þfix–¦f(real“(áx›Á_Þ))“+“fix“(imag“(áx˜Þ))“*Ž¡‘9ÐóIÝ.Ž¦Þround‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–œ_the“in²!teger“nearest“to“áxÝ.‘¿ÉIf“áx‘]¾Ýis“complex,‘ÙÝreturn“Þround–¦f(real“(áx‘Á_Þ))“+“roundŽ¡‘9Ðó(imag–¦f(áx‘Á_Þ))“*“IÝ.Ž¦Þsign‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–¦fthe“ásignš²!um“Ýfunction,“whic˜h“is“de ned“asŽŸ"¡˜’¯ôÏsignŽ’Âà(áx‘Á_Ý)– §=ŸëC(“óú±u cmex10½8ŽŸ “<ŽŸ “:ŽŽŸð¹ì‘ ÁgÝ1ä;Ž‘)½'x“>“Ý0;ŽŽ¡‘ Ág0ä;Ž‘)½'x“Ý=“0;ŽŽ¡‘ ÁgåÝ1ä;Ž‘)½'x“<“Ý0.ŽŽŽŽŽŸ$ó…‘9ÐóF‘ÿeor–¦fcomplex“argumen²!ts,“Þsign“Ýreturns“Þx“./“abs“(áx‘Á_Þ)Ý.Ž¦Þexp‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–íÏthe“expšMÞonen²!tial“of“áxÝ.‘´T‘ÿeo“compute“the“matrix“exp˜onen²!tial,‘?©see“Chapter“8Ž¡‘9Ðó[Linear–¦fAlgebra],“page“75.Ž¦Þgcd–¦f(áxÞ,“...)Ž¡‘9ÐóÝCompute–¾ìthe“greatest“common“divisor“of“the“elemen²!ts“of“áxÝ,‘Åor“the“list“of“all“the“argu-Ž¡‘9Ðómen²!ts.‘ÝÝF‘ÿeor‘¦fexample,Ž¤ŸÊ‘V¹HÞgcd–¿ª(a1,“...,“ak)Ž©ŸÊ‘9ÐóÝis–¦fthe“same“asŽ¡‘V¹HÞgcd–¿ª([a1,“...,“ak])Ž¦‘9ÐóÝAn–¦foptional“second“return“v‘ÿdDalue,“áv‘–~Ýconš²!tains“an“in˜teger“v˜ector“suc˜h“thatŽ¡‘V¹HÞg–¿ª=“v(1)“*“a(k)“+“...“+“v(k)“*“a(k)ŽŸ?”lcm–¦f(áxÞ,“...)Ž¤‘9ÐóÝCompute–Eåthe“least“common“mš²!ultiple“of“the“elemen˜ts“elemen˜ts“of“áxÝ,‘Y2or“the“list“of“all“theŽ¡‘9Ðóargumen²!ts.‘ÝÝF‘ÿeor‘¦fexample,ŽŸŸÊ‘V¹HÞlcm–¿ª(a1,“...,“ak)Ž¦‘9ÐóÝis–¦fthe“same“asŽŽŸŒ‹H© ŸòÝ72’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБV¹HÞlcm–¿ª([a1,“...,“ak]).Ž¤ log‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–p›the“natural“logarithm“of“áxÝ.‘ËïT‘ÿeo“compute“the“matrix“logarithm,‘{]see“Chapter“8Ž©‘9Ðó[Linear–¦fAlgebra],“page“75.Ž¡Þlog2‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–¦fthe“base-2“logarithm“of“áxÝ.Ž¡Þlog10‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–¦fthe“base-10“logarithm“of“áxÝ.Ž¡Þsqrt‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–Þnthe“square“rošMÞot“of“áxÝ.‘…öT‘ÿeo“compute“the“matrix“square“ro˜ot,‘,psee“Chapter“8Ž¦‘9Ðó[Linear–¦fAlgebra],“page“75.Ž¡Þmax‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝF‘ÿeor–g9a“vš²!ector“argumen˜t,‘sÛreturn“the“maxim˜um“v‘ÿdDalue.‘ÈÎF‘ÿeor“a“matrix“argumen˜t,‘sÛreturn“theŽ¦‘9Ðómaximš²!um–¦fv‘ÿdDalue“from“eac˜h“column,“as“a“ro˜w“v˜ector.‘ÝÝTh˜us,ŽŸÈ‘V¹HÞmax–¿ª(max“(áx‘Á_Þ))Ž¤È‘9ÐóÝreturns–¦fthe“largest“elemen²!t“of“áxÝ.Ž¡‘9ÐóF‘ÿeor–¦fcomplex“argumenš²!ts,“the“magnitude“of“the“elemen˜ts“are“used“for“comparison.Ž¤ Þmin‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝLikš²!e–¦fÞmaxÝ,“but“return“the“minim˜um“v‘ÿdDalue.Ž¡Þrem–¦f(áxÞ,“áy‘ðÞ)Ž¦‘9ÐóÝReturn–¦fthe“remainder“of“áx‘gÅÞ/“áy‘ðÝ,“computed“using“the“expressionŽŸÈ‘V¹HÞx–¿ª-“y“.*“fix“(x“./“y)ŽŸÈ‘9ÐóÝAn–öŒerror“message“is“prinš²!ted“if“the“dimensions“of“the“argumen˜ts“do“not“agree,‘¸or“if“eitherŽ¦‘9Ðóof–¦fthe“argumen²!ts“is“complex.ŽŸ ëE7.2‘™Complex‘¦MArithmeticŽŽŸÈ‘ÝThe–‘folloš²!wing“functions“are“a˜v‘ÿdDailable“for“w˜orking“with“complex“n˜um˜bMÞers.‘ÖAEac˜h“expMÞects“a“singleŽ¦argumen•²!t.‘ÝÝGiv“en–¦fa“matrix“they“wš²!ork“on“an“elemen˜t“b˜y“elemen˜t“basis.ŽŸ Þabs‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–¦fthe“magnitude“of“áxÝ.Ž¡Þangle‘¦f(áx‘Á_Þ)ŽŽŽ¦arg‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝCompute–¦fthe“argumen²!t“of“áxÝ.Ž¡Þconj‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–¦fthe“complex“conjugate“of“áxÝ.Ž¡Þimag‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–¦fthe“imaginary“part“of“áxÝ.Ž¡Þreal‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturn–¦fthe“real“part“of“áxÝ.ŽŸ ëE7.3‘™T‘þ¦frigonometryŽŽŸÈ‘ÝOcta•²!v“e›¦fpro“vides˜the˜follo“wing˜trigonometric˜functions:ŽŸÈ‘èUÞsin–þ¨asin“sinh“asinhŽ¤ ‘èUcos–þ¨acos“cosh“acoshŽ¡‘èUtan–þ¨atan“tanh“atanhŽŽŸŒ‹I²óŸòÝChapter‘¦f7:‘ÝÝArithmetic’^ÃÍ73ŽŽŽ ƒ3Ú ý´ðБèUÞsec–þ¨asec“sech“asechŽ¤ ‘èUcsc–þ¨acsc“csch“acschŽ¡‘èUcot–þ¨acot“coth“acothŽ¤N“ÝEacš²!h–oÙof“these“functions“expMÞect“a“single“argumen˜t.‘Ë®F‘ÿeor“matrix“argumen˜ts,‘zÂthey“w˜ork“on“an“elemen˜tŽŸb•²!y›¦felemen“t˜basis.‘ÝÝF‘ÿeor˜example,˜the˜expressionŽ©N“‘èUÞsin–¿ª([1,“2;“3,“4])Ž¡ÝproMÞducesŽ¦‘èUÞans‘¿ª=ŽŸ‘.'S0.84147‘>þ0.90930ŽŸ ‘.'S0.14112‘ T-0.75680Ž¡‘atan2–¦f(áyÞ,“áx‘Á_Þ)ŽŸ!:KëE7.4‘™Sums–¦Mand“Pros3ductsŽŽŸ&Þsum‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝF‘ÿeor–ˆ.a“vš²!ector“argumen˜t,‘ÀŸreturn“the“sum“of“all“the“elemen˜ts.‘ƒ4F‘ÿeor“a“matrix“argumen˜t,Ž¤‘9Ðóreturn–€\the“sum“of“the“elemenš²!ts“in“eac˜h“column,‘‡÷as“a“ro˜w“v˜ector.‘Ñ/The“sum“of“an“empt˜yŽ¡‘9Ðómatrix–mis“0“if“it“has“no“columns,‘x†or“a“vš²!ector“of“zeros“if“it“has“no“ro˜ws“(see“Section“3.2.1Ž¡‘9Ðó[Empt²!y–¦fMatrices],“page“24).Ž©&Þprod‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝF‘ÿeor–`‹a“vš²!ector“argumen˜t,‘n„return“the“proMÞduct“of“all“the“elemen˜ts.‘Æ”F‘ÿeor“a“matrix“argumen˜t,Ž¡‘9Ðóreturn–APthe“proMÞduct“of“the“elemenš²!ts“in“eac˜h“column,‘h as“a“ro˜w“v˜ector.‘®šThe“proMÞduct“ofŽ¡‘9Ðóan–]emptš²!y“matrix“is“1“if“it“has“no“columns,‘ŠÌor“a“v˜ector“of“ones“if“it“has“no“ro˜ws“(seeŽ¡‘9ÐóSection–¦f3.2.1“[Empt²!y“Matrices],“page“24).Ž¦Þcumsum‘¦f(áx‘Á_Þ)Ž¡‘9ÐóÝReturn–¦fthe“cum•²!ulativ“e–¦fsum“of“eac²!h“column“of“áxÝ.‘ÝÝF‘ÿeor“example,Ž¤N“‘V¹HÞcumsum–¿ª([1,“2;“3,“4])ŽŸN“‘9ÐóÝproMÞducesŽ¡‘V¹HÞans‘¿ª=ŽŸ‘b8œ1‘ T2ŽŸ ‘b8œ4‘ T6Ž¦cumprod‘¦f(áx‘Á_Þ)ŽŸ‘9ÐóÝReturn–¦fthe“cum•²!ulativ“e–¦fproMÞduct“of“eac²!h“column“of“áxÝ.‘ÝÝF‘ÿeor“example,Ž¡‘V¹HÞcumprod–¿ª([1,“2;“3,“4])ŽŸN“‘9ÐóÝproMÞducesŽ¡‘V¹HÞans‘¿ª=ŽŸ‘b8œ1‘ T2ŽŸ ‘b8œ3‘ T8ŽŽŸŒ‹J»iŸòÝ74’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞsumsq‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝF‘ÿeor–g4a“vš²!ector“argumen˜t,‘sØreturn“the“sum“of“the“squares“of“all“the“elemen˜ts.‘ÈÌF‘ÿeor“a“matrixŽ¤‘9Ðóargumenš²!t,‘7&return–çthe“sum“of“the“squares“of“the“elemen˜ts“in“eac˜h“column,‘7&as“a“ro˜wŽ¡‘9Ðóv²!ector.ŽŸ ëE7.5‘™Sps3ecial‘¦MF‘þ¦functionsŽŽŸÞbetaŽŽ‘9ÐóÝReturns–¦fthe“bMÞeta“function,ŽŸÿÔ’¼îpä ‘“òÝ(äa;‘Ó1bÝ)‘ §=Ÿø—ž‘=Ú(äaÝ)(äbÝ)Ž‘=ÚŸÞȉfe)5VŸ t‘ý(äa–nìÝ+“äbÝ)ŽŽŽŽ‘.¦cä:ŽŸ"LÞbetai–¦f(áaÞ,“ábÞ,“áx‘Á_Þ)Ž¡‘9ÐóÝReturns–¦fthe“incomplete“bMÞeta“function,ŽŸÄý’ƒ²öä ›“òÝ(äa;–Ó1b;“xÝ)– §=“ä ˜Ý(äa;‘Ó1bÝ)Ÿûz•º®1Ž‘ ¥Ÿò&»½ZŽŸôŸ‘¦´xŽŸ@‘ß®0ŽŽ‘k»ätŸûz•®(´aº´zI{®)Ž‘rÝ(1–nìå“ätÝ)Ÿûz•®(´bº®1)Ž‘€ºädt:Ž© ºR‘9ÐóÝIf–*¿x“has“more“than“one“comp•MÞonenš²!t,‘KÕb“oth–*¿áa“Ýand“áb‘heÝm˜ust“bMÞe“scalars.‘jéIf“áx‘ìÝis“a“scalar,‘KÕáaŽ¡‘9ÐóÝand–¦fáb‘ä Ým²!ust“bMÞe“of“compatible“dimensions.Ž¤ÞerfŽŽ‘9ÐóÝComputes–¦fthe“error“function,ŽŸ×ï’µo+erfŽ’ÂÉ…(äz{IÝ)‘ §=Ÿø—ž‘ bJ2Ž‘=ÚŸÞȉfeÂzŸ tŸø#åpŽ‘ Ÿø#‰p ¢yŸÜÿ䎎ŽŽŽŽ‘¸Ÿò&»½ZŽŸôŸ‘!¹´zŽŸ@‘”ò®0ŽŽ‘'u{äeŸûz•º´tŸüûró†›Zcmr5°2ŽŽ‘ ¬wädtŽŸ"“Þerfc‘¦f(áz‘šqÞ)ŽŽ‘9ÐóÝComputes–¦fthe“complemen²!tary“error“function,“Þ1“-“erf“(áz‘šqÞ)Ý.Ž¡ÞerfinvŽŽ‘9ÐóÝComputes–¦fthe“in•²!v“erse–¦fof“the“error“function.Ž¡Þgamma‘¦f(áz‘šqÞ)ŽŽ‘9ÐóÝComputes–¦fthe“gamma“function,ŽŸÛ’·ÇË(äz{IÝ)– §=“Ÿò&»½ZŽŸôŸ‘ ¨º1ŽŸ@‘˜á®0ŽŽ‘V¾ätŸûz•´zI{º®1Ž‘ØäeŸûz•º´tŽ‘ ÅWädt:Ž¦Þgammai–¦f(áaÞ,“áx‘Á_Þ)Ž¤‘9ÐóÝComputes–¦fthe“incomplete“gamma“function,ŽŸ«^’µ³Ä(äa;‘Ó1xÝ)‘ §=Ÿø‹b‘=ÚŸ÷´ø½RŽŸú-Ú‘ è…´xŽŸ #–‘ö¾®0ŽŽ‘ÄšäeŸü¾º´tŽ‘ ÅWätŸü¾´aº®1Ž‘äädtŽ‘=ÚŸë‰fe9ÊŸ t‘öãÝ(äaÝ)ŽŽŽŽŽŸ"L‘9ÐóIf–¦fáa“Ýis“scalar,“then“Þgammai“(áaÞ,“áx‘Á_Þ)“Ýis“returned“for“eacš²!h“elemen˜t“of“áx‘gÅÝand“vice“v˜ersa.ŽŸ‘9ÐóIf–x1neither“áa“Ýnor“áx›9Ýis“scalar,‘¬¤the“sizes“of“áa“Ýand“áx˜Ým²!ust“agree,‘¬¤and“ágammai‘ ´Ýis“appliedŽ¡‘9Ðóelemen•²!t-b“y-elemen“t.ŽŸÞlgammaŽŽ‘9ÐóÝReturns–¦fthe“natural“logarithm“of“the“gamma“function.ŽŽŸŒ‹KˆŸòÝChapter–¦f8:‘ÝÝLinear“Algebra’K75ŽŽŽ ƒ3Ú ý¨ðÐè8‘ ¸QLinear‘¦MAlgebraŽŽŸ#¥5‘ÝThis–vRcš²!hapter“doMÞcumen˜ts“the“linear“algebra“functions“of“Octa˜v˜e.‘M¢Reference“material“for“man˜yŽ¤of–Ò¼these“options“ma²!y“bMÞe“found“in“Golub“and“V‘ÿean“Loan,›ÑáMatrix“Computations,˜2nd“Ed.Ý,˜JohnsŽ¡Hopkins,–¦f1989,“and“in“áLAP‘ÿeA²!CK“Users'“GuideÝ,“SIAM,“1992.ŽŸ"ê‘ëE8.1‘™Basic–¦MMatrix“F‘þ¦functionsŽŽŸuHÞbalanceŽŽŽŸº¤‘V¹Haa–¿ª=“balance“(a,“opt)Ž¤ ‘V¹H[dd,–¿ªaa]“=‘ Tbalance(a,“opt)Ž¡‘V¹H[dd,–¿ªaa]“=“balance“(a,“opt)Ž¡‘V¹H[cc,–¿ªdd,“aa,“bb]“=“balance“(a,“b,“opt)Ž©º¤‘9Ðó[dd,–¦faa]“=“balance“(a)–ñÝreturns“Þaa–¦f=“dd“\“a“*“ddÝ.‘,Þaa–ñÝis“a“matrix“whose“ro²!w/columnŽ¤‘9Ðónorms–)'are“roughly“equal“in“magnitude,›‰Öand“Þdd“Ý=“Þp–¦f*“dÝ,˜where–)'Þp“Ýis“a“pMÞerm²!utationŽ¡‘9Ðómatrix–Land“Þd“Ýis“a“diagonal“matrix“of“pMÞo•²!w“ers–Lof“t•²!w“o.‘¿ÄThis›Lallo“ws˜the˜equilibration˜to˜bMÞeŽ¡‘9Ðócomputed–J without“roundo .‘ÈÍResults“of“eigenš²!v‘ÿdDalue“calculation“are“t˜ypically“impro˜v˜edŽ¡‘9Ðób²!y–¦fbalancing“ rst.Ž¦‘9ÐóÞ[cc,–¦fdd,“aa,“bb]“=“balance“(a,“b)–7\Ýreturns“Þaa“Ý(ÞbbÝ)“Þ=–¦fcc*a*dd“(cc*b*dd)Ý),‘M‘where‘7\ÞaaŽ¡‘9ÐóÝand–,Þbb“Ýha•²!v“e–,non-zero“elemenš²!ts“of“appro˜ximately“the“same“magnitude“and“Þcc“Ýand“ÞddŽ¡‘9ÐóÝare–¦fpMÞermš²!uted“diagonal“matrices“as“in“Þdd“Ýfor“the“algebraic“eigen˜v‘ÿdDalue“problem.Ž¦‘9ÐóThe–¦feigenš²!v‘ÿdDalue“balancing“option“Þopt“Ýis“selected“as“follo˜ws:Ž¤uH‘9ÐóÞ"N"Ý,‘¦fÞ"n"ŽŽ‘s¡æÝNo–¦fbalancing;“argumenš²!ts“copied,“transformation(s)“set“to“iden˜tit˜y‘ÿe.Ž¡‘9ÐóÞ"P"Ý,‘¦fÞ"p"ŽŽ‘s¡æÝP•²!erm“ute›¦fargumen“t(s)˜to˜isolate˜eigen“v‘ÿdDalues˜where˜pMÞossible.Ž¡‘9ÐóÞ"S"Ý,‘¦fÞ"s"ŽŽ‘s¡æÝScale–¦fto“impro•²!v“e–¦faccuracy“of“computed“eigen²!v‘ÿdDalues.Ž¡‘9ÐóÞ"B"Ý,‘¦fÞ"b"ŽŽ‘s¡æÝP•²!erm“ute–Ù³and“scale,‘&†in“that“order.‘wÄRo²!ws/columns“of“a“(and“b)“that“areŽŸ‘s¡æisolated–¦fbš²!y“pMÞerm˜utation“are“not“scaled.‘ÝÝThis“is“the“default“bMÞeha˜vior.Ž¡‘9ÐóAlgebraic–¦feigenš²!v‘ÿdDalue“balancing“uses“standard“LAP‘ÿeA˜CK“routines.Ž¦‘9ÐóGeneralized–Çýeigen²!v‘ÿdDalue“problem“balancing“uses“W‘ÿeard's“algorithm“(SIAM‘dzJournal“onŽ©‘9ÐóScien²!ti c–¦fand“Statistical“Computing,“1981).Ž¡Þcond‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–…the“(t•²!w“o-norm)–…condition“n•²!um“bMÞer–…of“a“matrix.‘;Þcond‘¦f(a)“Ýis“de ned“as“ÞnormŽ¦‘9Ðó(a)–¦f*“norm“(inv“(a))Ý,“and“is“computed“via“a“singular“v‘ÿdDalue“decompMÞosition.Ž¡Þdet‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“determinanš²!t“of“áa“Ýusing“LINP‘ÿeA˜CK.Ž¡ÞeigŽŽŽŸº¤’›µ@=–¿ªeig“(a)ŽŸ ‘V¹H[v,–¿ªlambda]“=“eig“(a)ŽŽŸŒ‹LËŸòÝ76’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБ9ÐóThe–ªeigenš²!v‘ÿdDalues“(and“eigen˜v˜ectors)“of“a“matrix“are“computed“in“a“sev˜eral“step“proMÞcessŽ¤‘9Ðówhicš²!h–Z£bMÞegins“with“a“Hessen˜bšMÞerg“decomp˜osition“(see“ÞhessÝ),‘iÊfollo•²!w“ed›Z£b“y˜a˜Sc“h“ur˜decom-Ž¡‘9ÐópMÞosition–5«(see“ÞschurÝ),‘L7from“whicš²!h“the“eigen˜v‘ÿdDalues“are“apparen˜t.‘¸JThe“eigen˜v˜ectors,‘L7whenŽ¡‘9Ðódesired,–¦fare“computed“bš²!y“further“manipulations“of“the“Sc˜h˜ur“decompMÞosition.Ž¤ø´‘9ÐóSee–¦falso:‘ÝÝÞhessÝ,“ÞschurÝ.Ž©ñhÞgivensŽŽŽŸø´‘V¹H[c,–¿ªs]“=“givens“(x,“y)ŽŸ ‘V¹HG–¿ª=“givens“(x,“y)Ž¡‘9ÐóG–¦f=“givens(x,“y)–lrÝreturns“a“2–ûå“Ý2–lrorthogonal“matrix“ÞG–¦f=“[c“s;“-s'“c]–lrÝsuc²!h“that“ÞG‘¦f[x;Ž¤‘9Ðóy]–¦f=“[*;“0]“Ý(x,“y“scalars)Ž¦Þinv‘¦f(áaÞ)ŽŽŽ¡inverse‘¦f(áaÞ)Ž¡‘9ÐóÝCompute–¦fthe“in•²!v“erse–¦fof“the“square“matrix“áaÝ.Ž¦Þnorm–¦f(áaÞ,“ápUÞ)Ž¡‘9ÐóÝCompute–"zthe“p-norm“of“the“matrix“áaÝ.‘ RIf“the“second“argumen²!t“is“missing,‘Þp–¦f=“2‘"zÝisŽ¡‘9Ðóassumed.ŽŸø´‘9ÐóIf–¦fáa“Ýis“a“matrix:Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞ1ŽŽ‘s¡æÝ1-norm,–¦fthe“largest“column“sum“of“áaÝ.Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞ2ŽŽ‘s¡æÝLargest–¦fsingular“v‘ÿdDalue“of“áaÝ.Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞInfŽŽ‘s¡æÝIn nitš²!y–¦fnorm,“the“largest“ro˜w“sum“of“áaÝ.Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞ"fro"Ž¡‘s¡æÝF‘ÿerobMÞenius–¦fnorm“of“áaÝ,“Þsqrt“(sum“(diag“(a'“*“a)))Ý.Ž¦‘9ÐóIf–¦fáa“Ýis“a“v²!ector“or“a“scalar:Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞInfŽŽ‘s¡æmax–¦f(abs“(a))Ý.Ž¦‘9Ðóáp‘ûgÝ=‘¦fÞ-InfŽŽ‘s¡æmin–¦f(abs“(a))Ý.Ž¦‘9ÐóotherŽŽ‘s¡æp-norm–¦fof“áaÝ,“Þ(sum“(abs“(a)“.^“p))“^“(1/p)Ý.Ž¦Þnull–¦f(áaÞ,“átolnRÞ)Ž¡‘9ÐóÝReturns–¦fan“orthonormal“basis“of“the“n²!ull“space“of“áaÝ.ŽŸø´‘9ÐóThe–ÎÞdimension“of“the“nš²!ull“space“is“tak˜en“as“the“n˜um˜bMÞer“of“singular“v‘ÿdDalues“of“áa“ÝnotŽ¡‘9Ðógreater–¦fthan“átolÝ.‘ÝÝIf“the“argumen²!t“átol‘¸Ýis“missing,“it“is“computed“asŽŸø´‘V¹HÞmax–¿ª(size“(a))“*“max“(svd“(a))“*“epsŽ¦orth–¦f(áaÞ,“átolnRÞ)Ž¡‘9ÐóÝReturns–¦fan“orthonormal“basis“of“the“range“of“áaÝ.ŽŸø´‘9ÐóThe–/½dimension“of“the“range“space“is“takš²!en“as“the“n˜um˜bMÞer“of“singular“v‘ÿdDalues“of“áa“ÝgreaterŽ¡‘9Ðóthan–¦fátolÝ.‘ÝÝIf“the“argumen²!t“átol‘¸Ýis“missing,“it“is“computed“asŽŽŸŒ‹MÕ‚ŸòÝChapter–¦f8:‘ÝÝLinear“Algebra’K77ŽŽŽ ƒ3Ú ý¨ðБV¹HÞmax–¿ª(size“(a))“*“max“(svd“(a))“*“epsŽ©¨Fpinv–¦f(áXÞ,“átolnRÞ)ŽŸ‘9ÐóÝReturns–¦fthe“pseudoin•²!v“erse–¦fof“áXÝ.“Singular“v‘ÿdDalues“less“than“átol‘¸Ýare“ignored.Ž¤Ô#‘9ÐóIf–¦fthe“second“argumen²!t“is“omitted,“it“is“assumed“thatŽŸÔ#‘V¹HÞtol–¿ª=“max“(size“(X))“*“sigma_max“(X)“*“eps,Ž¡‘9ÐóÝwhere–¦fÞsigma_max“(áX‘TÞ)“Ýis“the“maximal“singular“v‘ÿdDalue“of“áXÝ.Ž¦Þrank–¦f(áaÞ,“átolnRÞ)Ž¤‘9ÐóÝCompute–àòthe“rank“of“áaÝ,‘ï”using“the“singular“v‘ÿdDalue“decompMÞosition.‘€The“rank“is“tak²!en“toŽ¡‘9ÐóbšMÞe–¡Òthe“n•²!um“b˜er–¡Òof“singular“v‘ÿdDalues“of“áa“Ýthat“are“greater“than“the“sp˜eci ed“tolerance“átolÝ.Ž¡‘9ÐóIf–¦fthe“second“argumenš²!t“is“omitted,“it“is“tak˜en“to“bMÞeŽŸÔ#‘V¹HÞtol–¿ª=‘ Tmax“(size“(a))“*“sigma“(1)“*“eps;ŽŸÔ#‘9ÐóÝwhere–¦fÞeps“Ýis“mac²!hine“precision“and“Þsigma“Ýis“the“largest“singular“v‘ÿdDalue“of“ÞaÝ.Ž¦Þtrace‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“trace“of“áaÝ,“Þsum“(diag“(a))Ý.ŽŸ¨GëE8.2‘™Matrix‘¦MF‘þ¦factorizationsŽŽŸÔ#Þchol‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–´rthe“Cholesky“factor,–÷ôárÝ,“of–´rthe“symmetric“pMÞositiv²!e“de nite“matrix“áaÝ,‘÷ôwhereŽ¡‘9ÐóäR¨Ÿü¾´TŽ‘b^äR‘ OÝ=‘ §äAÝ.Ž¦Þhess‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“Hessen²!bšMÞerg“decomp˜osition“of“the“matrix“áaÝ.ŽŸÔ#‘swšÞh–¿ª=“hess“(a)ŽŸ ‘V¹H[p,–¿ªh]“=“hess“(a)ŽŸÔ#‘9ÐóÝThe–!Hessen²!bšMÞerg“decomp˜osition“is“usually“used“as“the“ rst“step“in“an“eigen²!v‘ÿdDalue“com-Ž¡‘9Ðóputation,›’but–cShas“other“applications“as“w²!ell“(see“Golub,˜Nash,˜and“V‘ÿean“Loan,˜IEEEŽ¡‘9ÐóT‘ÿeransactions–i·on“Automatic“Conš²!trol,‘š‹1979.‘'ÑThe“Hessen˜bšMÞerg“decomp˜osition“is“Þp–¦f*“h“*Ž¡‘9Ðóp'–¦f=“a–ŠnÝwhere“Þp“Ýis“a“square“unitary“matrix“(Þp'–¦f*“p“=“IÝ,‘using–Šncomplex-conjugate“trans-Ž¡‘9ÐópšMÞosition)–¦fand“Þh“Ýis“upp˜er“Hessen²!b˜erg“(Þi“>=“j+1“=>“h“(i,“j)“=“0Ý).Ž¦Þlu‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–ûthe“LU‘úúdecompMÞosition“of“áaÝ,‘:using“subroutines“from“LAP‘ÿeA²!CK.“The“result“isŽ¡‘9Ðóreturned–fin“a“pMÞerm²!uted“form,‘faccording“to“the“optional“return“v‘ÿdDalue“ápÝ.‘ñÜF‘ÿeor“example,Ž¡‘9Ðógiv²!en–¦fthe“matrix“Þa“=“[1,“2;“3,“4]Ý,Ž¤Ô#‘V¹HÞ[l,–¿ªu,“p]“=“lu“(a)ŽŸÔ#‘9ÐóÝreturnsŽ¡‘V¹HÞl‘¿ª=Ž¤‘b8œ1.00000‘ T0.00000Ž© ‘b8œ0.33333‘ T1.00000Ž¡‘V¹Hu‘¿ª=Ž¡‘b8œ3.00000‘ T4.00000Ž¦‘b8œ0.00000‘ T0.66667ŽŽŸŒ‹NÞLŸòÝ78’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý´ðБV¹HÞp‘¿ª=Ž©‘b8œ0‘ T1ŽŸ ‘b8œ1‘ T0ŽŸÕ’qr‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–ƒ\the“QR›ƒfactorization“of“áaÝ,‘½‘using“standard“LAP–ÿeA²!CK˜subroutines.‘|ÚF“or‘ƒ\example,ŽŸ‘9Ðógiv²!en–¦fthe“matrix“Þa“=“[1,“2;“3,“4]Ý,Ž¤êÉ‘V¹HÞ[q,–¿ªr]“=“qr“(a)ŽŸêÉ‘9ÐóÝreturnsŽ¡‘V¹HÞq‘¿ª=Ž¦‘b8œ-0.31623‘ T-0.94868Ž¤ ‘b8œ-0.94868‘>þ0.31623Ž¦‘V¹Hr‘¿ª=Ž¦‘b8œ-3.16228‘ T-4.42719Ž¡‘gøF0.00000‘ T-0.63246Ž¤êÉ‘9ÐóÝThe–¦fÞqr“Ýfactorization“has“applications“in“the“solution“of“least“squares“problemsŽŸA’ÈØbminŽŸ’ϳñ´xŽŽ’Üë•åkŽ’âe/äAx–nìå“äbåkŽŽ’lsŸ<Ì®2ŽŽŸ·u‘9ÐóÝfor›«4o•²!v“erdetermined˜systems˜of˜equations˜(i.e.,–¬häA˜Ýis˜a˜tall,“thin˜matrix).‘ìHThe˜Þqr˜Ýfactor-Ž©‘9Ðóization–¦fis“Þq“*“r“=“a“Ýwhere“Þq“Ýis“an“orthogonal“matrix“and“Þr“Ýis“uppMÞer“triangular.Ž¡‘9ÐóThe–ƲpMÞermš²!uted“Þqr“Ýfactorization“Þ[q,–¦fr,“pi]“=“qr“(a)–ƲÝforms“the“Þqr“Ýfactorization“suc˜hŽ¦‘9Ðóthat–kthe“diagonal“enš²!tries“of“Þr“Ýare“decreasing“in“magnitude“order.‘<íF‘ÿeor“example,‘8¬giv˜enŽ¦‘9Ðóthe–¦fmatrix“Þa“=“[1,“2;“3,“4]Ý,Ž©êÉ‘V¹HÞ[q,–¿ªr,“pi]“=“qr(a)Ž¡‘9ÐóÝreturnsŽ¦‘V¹HÞq‘¿ª=Ž¤‘b8œ-0.44721‘ T-0.89443Ž© ‘b8œ-0.89443‘>þ0.44721Ž¡‘V¹Hr‘¿ª=Ž¡‘b8œ-4.47214‘ T-3.13050Ž¦‘gøF0.00000‘>þ0.44721Ž¡‘V¹Hp‘¿ª=Ž¡‘gøF0‘ T1Ž¦‘gøF1‘ T0ŽŸêÉ‘9ÐóÝThe–§•pMÞermš²!uted“Þqr“Ýfactorization“Þ[q,–¦fr,“pi]“=“qr“(a)–§•Ýfactorization“allo˜ws“the“construc-ŽŸ‘9Ðótion–¦fof“an“orthogonal“basis“of“Þspan“(a)Ý.ŽŽŸŒ‹O纟òÝChapter–¦f8:‘ÝÝLinear“Algebra’K79ŽŽŽ ƒ3Ú ý¨ðÐÞschurŽŽŽŸ½n‘V¹H[u,–¿ªs]“=“schur“(a,“opt)‘>þopt“=“"a",“"d",“or“"u"ŽŸ ‘swšs–¿ª=“schur“(a)Ž©½n‘9ÐóÝThe›ý{Sc•²!h“ur˜decompMÞosition˜is˜used˜to˜compute˜eigen“v‘ÿdDalues˜of˜a˜square˜matrix,‘@and˜hasŽ¤‘9Ðóapplications–Ëäin“the“solution“of“algebraic“Riccati“equations“in“con²!trol“(see“Þare“Ýand“ÞdareÝ).Ž¡‘9ÐóÞschur›‰AÝalw•²!a“ys˜returns˜äS‘¬9Ý=‘ §äU‘1ŸŸü¾´TŽ‘~UäAU–ºàÝwhere˜äU“Ýis˜a˜unitary˜matrix˜(äU‘1ŸŸü¾º0Ž‘ÿØäU“Ýis˜iden•²!tit“y)˜and˜äSŽ¡‘9ÐóÝis–KuppMÞer“triangular.‘¿mThe“eigenš²!v‘ÿdDalues“of“äA“Ý(and“äS‘¡’Ý)“are“the“diagonal“elemen˜ts“of“äS‘ì§ÝIf“theŽ¡‘9Ðómatrix–ÇÊäA“Ýis“real,›Ð#then“the“real“Sc•²!h“ur–ÇÊdecompMÞosition“is“computed,˜in“whic²!h“the“matrixŽ¡‘9ÐóäU‘WÉÝis–&*orthogonal“and“äS‘ǼÝis“blošMÞc²!k“upp˜er“triangular“with“blo˜c²!ks“of“size“at“most“2–nuå“Ý2‘&*blo˜c²!ksŽ¡‘9Ðóalong–nthe“diagonal.‘ËThe“diagonal“elemenš²!ts“of“äS‘¬Ý(or“the“eigen˜v‘ÿdDalues“of“the“2–þUå“Ý2‘nbloMÞc˜ks,Ž¡‘9Ðówhen–¦fappropriate)“are“the“eigen²!v‘ÿdDalues“of“äA“Ýand“äS‘¡’Ý.Ž¦‘9ÐóThe–»—eigen²!v›ÿdDalues“are“optionally“ordered“along“the“diagonal“according“to“the“v˜alue“ofŽ¡‘9ÐóÞoptÝ.‘ÃÞopt–¦f=“"a"–V'Ýindicates“that“all“eigenš²!v‘ÿdDalues“with“negativ˜e“real“parts“should“bMÞe“mo˜v˜edŽ¡‘9Ðóto– ßthe“leading“bloMÞcš²!k“of“äS‘­qÝ(used“in“ÞareÝ),‘%>Þopt–¦f=“"d"– ßÝindicates“that“all“eigen˜v‘ÿdDalues“withŽ¡‘9Ðómagnitude–‰œless“than“one“should“bšMÞe“mo•²!v“ed–‰œto“the“leading“blo˜c²!k“of“äS‘+.Ý(used“in“ÞdareÝ),Ž¡‘9Ðóand› ‘Þopt–¦f=“"u"Ý,–)¼the˜default,“indicates˜that˜no˜ordering˜of˜eigen²!v‘ÿdDalues˜should˜oMÞccur.‘©ìTheŽ¡‘9Ðóleading–™äk‘gØÝcolumns“of“äU‘A8Ýalw•²!a“ys–™span“the“äAÝ-in•²!v‘ÿdDarian“t–™subspace“correspMÞonding“to“the“äkŽ¡‘9ÐóÝleading–¦feigen²!v‘ÿdDalues“of“äS‘¡’Ý.ŽŸzÜÞsvd‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“singular“v‘ÿdDalue“decompMÞosition“of“áaŽŸ8K’Îú®äA– §Ý=“äU‘1ŸÝäV‘nïŸûz•´HŽŽŸ õ¹‘9ÐóÝThe–Îèfunction“Þsvd“Ýnormally“returns“the“vš²!ector“of“singular“v‘ÿdDalues.‘WdIf“ask˜ed“for“threeŽ¡‘9Ðóreturn–¦fv‘ÿdDalues,“it“computes“äU‘1ŸÝ,“äS‘¡’Ý,“and“äV‘nïÝ.‘ÝÝF‘ÿeor“example,Ž¤½n‘V¹HÞsvd–¿ª(hilb“(3))Ž¦‘9ÐóÝreturnsŽ¡‘V¹HÞans‘¿ª=ŽŸ‘b8œ1.4083189Ž¤ ‘b8œ0.1223271Ž¡‘b8œ0.0026873Ž¦‘9ÐóÝandŽ¤½n‘V¹HÞ[u,–¿ªs,“v]“=“svd“(hilb“(3))Ž¦‘9ÐóÝreturnsŽ¡‘V¹HÞu‘¿ª=Ž©‘b8œ-0.82704–>þ0.54745“0.12766Ž¤ ‘b8œ-0.45986– T-0.52829“-0.71375Ž¡‘b8œ-0.32330‘ T-0.64901‘>þ0.68867Ž¦‘V¹Hs‘¿ª=ŽŽŸŒ‹PíÇŸòÝ80’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý´ðБb8œÞ1.40832– T0.00000“0.00000Ž¤ ‘b8œ0.00000– T0.12233“0.00000Ž¡‘b8œ0.00000– T0.00000“0.00269Ž¤‘V¹Hv‘¿ª=Ž¡‘b8œ-0.82704–>þ0.54745“0.12766Ž¤ ‘b8œ-0.45986– T-0.52829“-0.71375Ž¡‘b8œ-0.32330‘ T-0.64901‘>þ0.68867Ž¤Îz‘9ÐóÝIf–Çègivš²!en“a“second“argumen˜t,‘ÐIÞsvd“Ýreturns“an“econom˜y-sized“decompMÞosition,‘ÐIeliminatingŽ©‘9Ðóthe–¦funnecessary“ro²!ws“or“columns“of“áu“Ýor“ávÝ.ŽŸœóëE8.3‘™F‘þ¦functions–¦Mof“a“MatrixŽŽŸÎzÞexpmŽŽŽŸÎz‘V¹Hexpm‘¿ª(a)Ž¡‘9ÐóÝReturns–¦fthe“expMÞonenš²!tial“of“a“matrix,“de ned“as“the“in nite“T‘ÿea˜ylor“seriesŽŸ‡Ï’›§1expŽ’¬aÞ(äAÝ)– §=“äI‘JäÝ+–nìäA“Ý+Ÿø—ž‘¢äAŸü¾®2ŽŽ‘¢ŸÞȉfe ²ÚŸ t‘KÝ2!ŽŽŽŽ–÷+Ÿø—ž‘¢äAŸü¾®3ŽŽ‘¢ŸÞȉfe ²ÚŸ t‘KÝ3!ŽŽŽŽ“+‘nìå–Ó1“ŽŽŸŸÇ‘9ÐóÝThe–T‘ÿeaš²!ylor“series“is“ánot‘ÌÝthe“w˜a˜y“to“compute“the“matrix“expMÞonen˜tial;‘wsee“Moler“andŽ¦‘9ÐóV›ÿean–uòLoan,‘©ÕáNineteen“Dubious“W˜aš²!ys“to“Compute“the“ExpMÞonen˜tial“of“a“MatrixÝ,‘©ÕSIAMŽ¦‘9ÐóReview,‘íæ1978.‘ïÞThis–¬froutine“uses“W‘ÿeard's“diagonal“Pš²!ad²"‘úÔDe“appro˜ximation“methoMÞd“withŽ¦‘9Ðóthree–¦fstep“preconditioning“(SIAM“Journal“on“Numerical“Analysis,“1977).Ž¡‘9ÐóDiagonal–ÀPš²!ad²"‘úÔDe“appro˜ximations“are“rational“pMÞolynomials“of“matrices“äDŸ¤z´qŽ–j•Ý(äaÝ)Ÿü¾º®1Ž‘ ¼täNŸ¤z´qŽ“Ý(äaÝ)Ž¦‘9Ðówhose–qRT‘ÿeaš²!ylor“series“matc˜hes“the“ rst“2äq‘ZÇÝ+‘ö41“terms“of“the“T‘ÿea˜ylor“series“abMÞo˜v˜e;‘ÖÈdirectŽ¦‘9Ðóev‘ÿdDaluation–„ of“the“T‘ÿeaš²!ylor“series“(with“the“same“preconditioning“steps)“ma˜y“bMÞe“desirableŽ¦‘9Ðóin–¦flieu“of“the“Pš²!ad²"‘úÔDe“appro˜ximation“when“äDŸ¤z´qŽ‘j•Ý(äaÝ)“is“ill-conditioned.Ž¤œôÞlogm‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–ó>the“matrix“logarithm“of“the“square“matrix“áaÝ.‘ÄdNote“that“this“is“curren²!tlyŽ¦‘9Ðóimplemenš²!ted–3ìin“terms“of“an“eigen˜v‘ÿdDalue“expansion“and“needs“to“bMÞe“impro˜v˜ed“to“bMÞe“moreŽ¦‘9Ðórobust.Ž¡Þsqrtm‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–^rthe“matrix“square“roMÞot“of“the“square“matrix“áaÝ.‘Note“that“this“is“curren²!tlyŽ¦‘9Ðóimplemenš²!ted–3ìin“terms“of“an“eigen˜v‘ÿdDalue“expansion“and“needs“to“bMÞe“impro˜v˜ed“to“bMÞe“moreŽ¦‘9Ðórobust.Ž¡Þkron–¦f(áaÞ,“áb=¦Þ)Ž¦‘9ÐóÝF‘ÿeorm–¦fthe“kronec•²!k“er–¦fprošMÞduct“of“t•²!w“o–¦fmatrices,“de ned“blo˜cš²!k“b˜y“bloMÞc˜k“asŽŸÎz‘V¹HÞx–¿ª=“[a(i,“j)“b]Ž¡qzhess–¦f(áaÞ,“áb=¦Þ)Ž¦‘9ÐóÝCompute–öthe“Hessen²!bšMÞerg-triangular“decomp˜osition“of“the“matrix“p˜encil“Þ(a,‘¦fb)Ý.‘)ŽThisŽ¦‘9Ðófunction–¦freturns“Þaa“=“q“*“a“*“zÝ,“Þbb“=“q“*“b“*“zÝ,“ÞqÝ,“Þz“Ýorthogonal.‘ÝÝF‘ÿeor“example,ŽŽŸŒ‹Q÷ºŸòÝChapter–¦f8:‘ÝÝLinear“Algebra’K81ŽŽŽ ƒ3Ú ý¨ðБV¹HÞ[aa,–¿ªbb,“q,“z]“=“qzhess“(a,“b)Ž©‘9ÐóÝThe–éHessen²!bšMÞerg-triangular“decomp˜osition“is“the“ rst“step“in“Moler“and“Stew²!art's“QZŽ¤‘9ÐódecompšMÞosition–]³algorithm.‘Å¡(The“QZ‘] decomp˜osition“will“b˜e“included“in“a“later“release“ofŽ¡‘9ÐóOcta•²!v“e.)Ž¦‘9ÐóAlgorithm–¦ftak²!en“from“Golub“and“V‘ÿean“Loan,“áMatrix“Computations,“2nd“editionÝ.Ž©Þqzval–¦f(áaÞ,“áb=¦Þ)Ž¡‘9ÐóÝCompute–¦fgeneralized“eigen²!v‘ÿdDalues.Ž¦Þsyl–¦f(áaÞ,“ábÞ,“ác‘ªÞ)Ž¡‘9ÐóÝSolvš²!e–¦fthe“Sylv˜ester“equationŽ¤’¼¯ðäAX‘JäÝ+–nìäX‘ÛøB‘ûÝ+“äC‘Ó(Ý=‘ §0Ž¡‘9Ðóusing–¦fstandard“LAP‘ÿeA²!CK“subroutines.ŽŽŸŒ‹RŸòÝ82’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹SߟòÝChapter–¦f9:“P²!olynomial“Manipulations’0Ê83ŽŽŽ ƒ3Ú ý¨ðÐè9‘ ¸QP‘ÿuÂolynomial‘¦MManipulationsŽŽŸ!>ã‘ÝIn›>üOcta•²!v“e,‘e!a˜pMÞolynomial˜is˜represen“ted˜b“y˜its˜coMÞecien“ts˜(arranged˜in˜descending˜order).‘§ŸF‘ÿeorŽ¤example,–¦fa“vš²!ector“ác‘PjÝof“length“ánÞ+á1‘…ŸÝcorrespMÞonds“to“the“follo˜wing“ánÝ-th“order“pMÞolynomialŽŸ¿U’¢p¾äpÝ(äxÝ)– §=“äcŸ¤z®1Ž‘|säxŸûz•´nŽ‘àjÝ+–nìä:::“Ý+“äcŸ¤z´nŽ‘q~äx“Ý+“äcŸ¤z´n®+1Ž‘‘ä:ŽŸÿÞcompan‘¦f(ác‘ªÞ)Ž¡‘9ÐóÝCompute–¦fthe“companion“matrix“correspšMÞonding“to“p˜olynomial“co˜ecienš²!t“v˜ector“ácÝ.Ž©?Ç‘9ÐóThe–¦fcompanion“matrix“isŽŸ7 ¶‘q[?äA– §Ý=ŸÙ©‚“½2ŽŸ™¦“6Ž¤“6Ž¡“6Ž¡“6Ž¡“6Ž¡“6ŽŸfi“4ŽŽŸáL‘ ˆ„åäcŸ¤z®2Ž‘|sä=cŸ¤z®1ŽŽ‘6ì³åäcŸ¤z®3Ž‘|sä=cŸ¤z®1ŽŽ‘bPâå–Ó1“ŽŽ‘z zäcŸ¤z´nŽ‘q~ä=cŸ¤z®1ŽŽ’¦c´åäcŸ¤z´n®+1Ž‘‘ä=cŸ¤z®1ŽŽŽ¡‘4Ý1Ž‘Dhc0Ž‘bPâå–Ó1“ŽŽ’ˆ°Ý0Ž’¹ië0ŽŽ¡‘40Ž‘Dhc1Ž‘bPâå–Ó1“ŽŽ’ˆ°Ý0Ž’¹ië0ŽŽŸgߟø‘;¬.Ž¤‘;¬.Ž¡‘;¬.ŽŽŽŸù‘bì.ŽŽ‘g.¾Ÿü.Ž‘kpߟÿ.ŽŽŽŸø’‰8'.Ž¤’‰8'.Ž¡’‰8'.ŽŽŽŸø’º¡c.Ž¤’º¡c.Ž¡’º¡c.ŽŽŽŽ¡‘40Ž‘Dhc0Ž‘bPâå–Ó1“ŽŽ’ˆ°Ý1Ž’¹ië0ŽŽ¡ŽŸÙ©‚’Ó¼í½3ŽŸ™¦’Ó¼í7Ž¤’Ó¼í7Ž¡’Ó¼í7Ž¡’Ó¼í7Ž¡’Ó¼í7Ž¡’Ó¼í7ŽŸfi’Ó¼í5ŽŽŽ’Ü:Êä:ŽŸ:J}‘9ÐóÝThe–¦feigen²!v‘ÿdDalues“of“the“companion“matrix“are“equal“to“the“rošMÞots“of“the“p˜olynomial.ŽŸŽÞconv–¦f(áaÞ,“áb=¦Þ)Ž¡‘9ÐóÝCon•²!v“olv“e›¦ft“w“o˜v“ectors.Ž¦‘9ÐóÞy–¦f=“conv“(a,“b)–ÃÝreturns“a“v²!ector“of“length“equal“to“Þlength–¦f(a)“+“length“(b)“-“1Ý.‘ôIfŽ¡‘9Ðóáa–zÃÝand“áb‘¸iÝare“pšMÞolynomial“co˜ecienš²!t“v˜ectors,‘ƒ~Þconv“Ýreturns“the“coMÞecien˜ts“of“the“proMÞductŽ¡‘9ÐópMÞolynomial.ŽŸŽÞdeconv–¦f(áyÞ,“áaÞ)Ž¡‘9ÐóÝDecon•²!v“olv“e›¦ft“w“o˜v“ectors.Ž¦‘9ÐóÞ[b,–¦fr]“=“deconv“(y,“a)“Ýsolvš²!es“for“áb‘ä Ýand“ár‘oÝsuc˜h“that“Þy“=“conv“(a,“b)“+“rÝ.Ž¦‘9ÐóIf–?^áy‘/vÝand“áa“Ýare“pšMÞolynomial“co˜ecienš²!t“v˜ectors,‘¥›áb‘}Ýwill“con˜tain“the“coMÞecien˜ts“of“theŽ¡‘9ÐópšMÞolynomial–¦fquotien²!t“and“ár‘oÝwill“b˜e“a“remander“p˜olynomial“of“lo•²!w“est‘¦forder.Ž©ŽÞpoly‘¦f(áaÞ)ŽŽ‘9ÐóÝIf–"ëáa“Ýis“a“square“ánÝ-bš²!y-án“Ýmatrix,‘=7Þpoly‘¦f(áaÞ)“Ýis“the“ro˜w“v˜ector“of“the“coMÞecien˜ts“of“Þdet–¦f(z“*Ž¡‘9Ðóeye–¦f(n)“-“a)Ý,‘—@the–“vcš²!haracteristic“pMÞolynomial“of“áaÝ.‘×If“áx‘TÕÝis“a“v˜ector,‘—@Þpoly‘¦f(áx‘Á_Þ)“Ýis“a“v˜ectorŽ¡‘9Ðóof–¦fcošMÞecien²!ts“of“the“p˜olynomial“whose“ro˜ots“are“the“elemen²!ts“of“áxÝ.Ž¦Þpolyderiv‘¦f(ác‘ªÞ)Ž¡‘9ÐóÝReturns–I¹the“coMÞecienš²!ts“of“the“deriv‘ÿdDativ˜e“of“the“pšMÞolynomial“whose“co˜ecienš²!ts“are“giv˜enŽ¡‘9Ðób•²!y›¦fv“ector˜ácÝ.Ž¦Þpolyinteg‘¦f(ác‘ªÞ)Ž¡‘9ÐóÝReturns–¢¼the“coMÞecienš²!ts“of“the“in˜tegral“the“pšMÞolynomial“whose“co˜ecienš²!ts“are“represen˜tedŽ¡‘9Ðóbš²!y–¦fthe“v˜ector“ácÝ.ŽŸ?Ç‘9ÐóThe–¦fconstanš²!t“of“in˜tegration“is“set“to“zero.ŽŽŸŒ‹T2ŸòÝ84’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞpolyreduce‘¦f(ác‘ªÞ)Ž¤‘9ÐóÝReduces–@óa“pšMÞolynomial“co˜ecienš²!t“v˜ector“to“a“minim˜um“n˜um˜bMÞer“of“terms“b˜y“strippingŽ¡‘9Ðóo –¦fan²!y“leading“zeros.Ž©ûÞpolyval–¦f(ácÞ,“áx‘Á_Þ)Ž¡‘9ÐóÝEv‘ÿdDaluate–¦fa“pMÞolynomial.Ž¤ý€‘9ÐóÞpolyval–¦f(ácÞ,“áx‘Á_Þ)“Ýwill“ev‘ÿdDaluate“the“pšMÞolynomial“at“the“sp˜eci ed“v‘ÿdDalue“of“áxÝ.Ž¡‘9ÐóIf–¦fáx‘gÅÝis“a“vš²!ector“or“matrix,“the“pMÞolynomial“is“ev‘ÿdDaluated“at“eac˜h“of“the“elemen˜ts“of“áxÝ.Ž¦Þpolyvalm–¦f(ácÞ,“áx‘Á_Þ)Ž©‘9ÐóÝEv‘ÿdDaluate–¦fa“pMÞolynomial“in“the“matrix“sense.Ž¡‘9ÐóÞpolyvalm–¦f(ácÞ,“áx‘Á_Þ)–)Ýwill“ev‘ÿdDaluate“the“pMÞolynomial“in“the“matrix“sense,‘-i.e.‘!%matrix“m²!ulti-Ž¦‘9Ðóplication–¦fis“used“instead“of“elemenš²!t“b˜y“elemen˜t“m˜ultiplication“as“is“used“in“pMÞolyv‘ÿdDal.Ž¡‘9ÐóThe–¦fargumenš²!t“áx‘gÅÝm˜ust“bMÞe“a“square“matrix.ŽŸûÞresidue–¦f(ábÞ,“áaÞ,“átolnRÞ)Ž¦‘9ÐóÝIf–ÈGáb‘íÝand“áa“Ýare“v²!ectors“of“pšMÞolynomial“co˜ecien²!ts,‘¾then“residue“calculates“the“partialŽ¦‘9Ðófraction–¦fexpansion“correspšMÞonding“to“the“ratio“of“the“t•²!w“o‘¦fp˜olynomials.Ž¡‘9ÐóThe–*vfunction“Þresidue“Ýreturns“árÝ,–KzápÝ,“ákÝ,“and›*váeÝ,“where˜the˜v•²!ector˜ár‘óŸÝcon“tains˜the˜residueŽ¦‘9Ðóterms,›ÿWáp‘[Ýcon²!tains–ºZthe“pMÞole“v‘ÿdDalues,˜ák‘d^Ýconš²!tains“the“coMÞecien˜ts“of“a“direct“pMÞolynomialŽ¦‘9Ðóterm–ü(if“it“exists)“and“áe‘®Ýis“a“vš²!ector“con˜taining“the“pMÞo˜w˜ers“of“the“denominators“in“theŽ¦‘9Ðópartial–¦ffraction“terms.Ž¡‘9ÐóAssuming–¦fáb‘ä Ýand“áa“Ýrepresenš²!t“pMÞolynomials“äP‘…VÝ(äsÝ)“and“äQÝ(äsÝ)“w˜e“ha˜v˜e:ŽŸ"kœŸø—ž’“³]äP‘…VÝ(äsÝ)Ž’“¥ÖŸÞȉfeNZŸ täQÝ(äsÝ)ŽŽŽŽ’®2 =ŸóC1‘vÈ´MŽŸ ¼Ï‘nŸöC0½XŽŽŸ pº‘ §´m®=1ŽŽŸø—ž‘(âþärŸ¤z´mŽŽ‘I©ŸÞȉfe/»õŸ tÝ(äs–nìå“äpŸ¤z´mŽ‘˜›Ý)ŸüÖ0´eŽŸÞÏmŽŽŽŽŽŽ‘J§½Ý+ŸóC1‘lÔ´NŽŸ ¼Ï‘¾ÈŸöC0½XŽŽŸ pº‘nì´n®=1ŽŽ‘SžäkŸ¤z´nŽ‘q~äsŸûz•´N‘À,º´nŽ‘Ç0ä:ŽŸ$Α9ÐóÝwhere–;]áM‘jåÝis“the“n•²!um“bšMÞer–;]of“p˜oles“(the“length“of“the“árÝ,–`›ápÝ,“and–;]áe‘ØdÝv²!ectors)“and“áN‘jåÝis“theŽ¦‘9Ðólength–¦fof“the“ák‘PjÝv²!ector.Ž¡‘9ÐóThe–š¬argumen²!t“átol‘þÝis“optional,›and“if“not“spMÞeci ed,˜a“default“v‘ÿdDalue“of“0.001“is“assumed.Ž¦‘9ÐóThe–û…tolerance“v‘ÿdDalue“is“used“to“determine“whether“pšMÞoles“with“small“imaginary“comp˜o-Ž¦‘9Ðónenš²!ts–c°are“declared“real.‘ºIt“is“also“used“to“determine“if“t˜w˜o“pMÞoles“are“distinct.‘ºIf“theŽ¦‘9Ðóratio–~of“the“imaginary“part“of“a“pMÞole“to“the“real“part“is“less“than“átolÝ,‘6ythe“imaginary“partŽ¦‘9Ðóis–¦fdiscarded.›ÝÝIf“t•²!w“o–¦fpMÞoles“are“farther“apart“than“átol‘¸Ýthey“are“distinct.˜F‘ÿeor“example,Ž¡‘9ÐóExample:Ž©ý€‘\xòÞb–¿ª=“[1,“1,“1];ŽŸ ‘\xòa–¿ª=“[1,“-5,“8,“-4];ŽŸ‘\xò[r,–¿ªp,“k,“e]“=“residue“(b,“a)Ž¡‘9ÐóÝreturnsŽ¦‘V¹HÞr–¿ª=“[-2,“7,“3]ŽŽŸŒ‹U†ŸòÝChapter–¦f9:‘ÝÝP²!olynomial“Manipulations’ùS85ŽŽŽ ƒ3Ú ý¨ðБV¹HÞp–¿ª=“[2,“2,“1]Ž¤‘V¹Hk–¿ª=“[](0x0)Ž¡‘V¹He–¿ª=“[1,“2,“1]ŽŸ‘9ÐóÝwhicš²!h–¦fimplies“the“follo˜wing“partial“fraction“expansionŽŸEˆŸø—ž’œäsŸü¾®2Ž‘ë_Ý+–nìäs“Ý+“1Ž‘¢.ŸÞȉfePò Ÿ täsŸüÖ0®3Ž–ë_å›nìÝ5äsŸüÖ0®2Ž“Ý+˜8äs˜å˜Ý4ŽŽŽŽ’ÔÒ=Ÿø—ž‘ =ÆåÝ2Ž‘=ÚŸÞȉfeý·Ÿ täs–nìå“Ý2ŽŽŽŽ‘Ý°+Ÿø—ž‘dŠ7Ž‘¢ŸÞȉfe$þpŸ t(äs–nìå“Ý2)ŸüÖ0®2ŽŽŽŽŽ‘,B®Ý+Ÿø—ž‘ ä.3Ž‘¢ŸÞȉfeý·Ÿ täs–nìå“Ý1ŽŽŽŽŽŸ"LÞroots‘¦f(áv‘ðÞ)ŽŸ‘9ÐóÝF‘ÿeor–¦fa“vš²!ector“áv‘–~Ýwith“án“ÝcompMÞonen˜ts,“return“the“rošMÞots“of“the“p˜olynomialŽŸ’¬¶òävŸ¤z®1Ž‘|säz{IŸûz•´nº®1Ž‘˜'Ý+‘nìå–Ó1“Ž‘¤;Ý+–nìävŸ¤z´nº®1Ž‘­òäz‘ê5Ý+“ävŸ¤z´nŽ‘q~ä:ŽŽŸŒ‹V³ŸòÝ86’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹WߟòÝChapter–¦f10:‘ÝÝNonlinear“Equations’+%Ò87ŽŽŽ ƒ3Ú ý¨ðÐè10‘ ¸QNonlinear‘¦MEquationsŽŽ¤ ‘ÝOcta•²!v“e–¦fcan“solv²!e“sets“of“nonlinear“equations“of“the“formŽŸ’Ö.Êäf‘-¼Ý(äxÝ)– §=“0Ž¡using–¦fthe“function“ÞfsolveÝ,“whicš²!h“is“based“on“the“MINP‘ÿeA˜CK“subroutine“ÞhybrdÝ.Ž©‘F‘ÿeor–¦fexample,“to“solv²!e“the“set“of“equationsŽŸ"ØŸ÷c/’£f°åÝ2äxŸûz•®2Ž‘ë_Ý+–nì3äxy‘ÓÝ+“4‘Ó1sinŽ‘Dç(äyd“Ý)“å“Ý6ŽŽ’!R=‘ §0ŽŽŽŸ’¥·ß3äxŸûz•®2Ž‘ë_å–nìÝ2äxyd“Ÿûz•®2Ž‘OòÝ+“3‘Ó1cosŽ‘|^(äxÝ)“+“4ŽŽ’!R=‘ §0ŽŽŽŽŽŸ'Ùyš²!ou–¦f rst“need“to“write“a“function“to“compute“the“v‘ÿdDalue“of“the“giv˜en“function.‘ÝÝF‘ÿeor“example:ŽŸ‘èUÞfunction–¿ªy“=“f“(x)Ž¤‘(g©y(1)–¿ª=“-2*x(1)^2“+“3*x(1)*x(2)‘>þ+“4*sin(x(2))“-“6;ŽŸ ‘(g©y(2)–¿ª=‘ T3*x(1)^2“-“2*x(1)*x(2)^2“+“3*cos(x(1))“+“4;Ž¡‘èUendfunctionŽ¦‘ÝThen,‘ydcall–n$Þfsolve“Ýwith“a“spšMÞeci ed“initial“condition“to“ nd“the“ro˜ots“of“the“system“of“equations.ŽŸF‘ÿeor–¦fexample,“givš²!en“the“function“Þf“Ýde ned“abMÞo˜v˜e,Ž¤‘èUÞ[x,–¿ªinfo]“=“fsolve“("f",“[1;“2])Ž¦Ýresults–¦fin“the“solutionŽ¡‘èUÞx‘¿ª=Ž¤‘(g©0.57983ŽŸ ‘(g©2.54621Ž¡‘èUinfo–¿ª=“1Ž¦‘ÝA–¦fv‘ÿdDalue“of“Þinfo“=“1“Ýindicates“that“the“solution“has“con•²!v“erged.Ž¦‘The–8¿function“Þperror“Ýmaš²!y“bMÞe“used“to“prin˜t“English“messages“correspMÞonding“to“the“n˜umeric“errorŽŸcoMÞdes.‘ÝÝF‘ÿeor‘¦fexample,Ž¤‘èUÞperror–¿ª("fsolve",“1)Ž¦Ýprin²!tsŽ¡‘èUÞsolution–¿ªconverged“to“requested“toleranceŽ¦‘ÝT‘ÿeolerances–¦fand“other“options“for“Þfsolve“Ýma²!y“bšMÞe“sp˜eci ed“using“the“function“Þfsolve_optionsÝ.ŽŽŸŒ‹X2ŸòÝ88’©¦™Octa•²!v“eŽŽŽ ƒ3ÚŸŒ‹Y%ÅŸòÝChapter–¦f11:‘ÝÝDi eren²!tial“Equations’$MÒ89ŽŽŽ ƒ3Ú ý¨ðÐè11‘ ¸QDi eren‘ÿuÂtial‘¦MEquationsŽŽŸ#ÓÑÝOcta•²!v“e–êÖhas“t•²!w“o–êÖbuilt-in“functions“for“solving“di eren²!tial“equations.‘«-Both“are“based“on“reliableŽ¤ODE–¦fsolv²!ers“written“in“F‘ÿeortran.ŽŸ#ÏëE11.1‘™Ordinary–¦MDi erenŒÌtial“EquationsŽŽŸÃô‘ÝThe–¦ffunction“Þlsode“Ýcan“bMÞe“used“Solv²!e“ODEs“of“the“formŽŸŽâŸø—ž’·öädxŽ’·öŸÞȉfe õ"Ÿ t‘&ëdtŽŽŽŽ’ÞºòÝ=‘ §äf‘-¼Ý(äx;‘Ó1tÝ)ŽŸ$mOusing–¦fHindmarsh's“ODE“solv²!er“LSODE.Ž©Ãô‘èUÞlsode–¿ª(áfcnÞ,“áx0Þ,“át‘¨/‰x³HøŽ›ñ'outÞ,“át‘¨/‰x³HøŽ˜crit=Þ)ŽŸÃô‘ÝThe–9¿ rst“argumenš²!t“is“the“name“of“the“function“to“call“to“compute“the“v˜ector“of“righ˜t“hand“sides.Ž¡It–¦fmš²!ust“ha˜v˜e“the“formŽ¦‘èUáxdot‘üªÞ=–¿ªf“(áxÞ,“át=Þ)Ž¤ÃôÝwhere–¦fáxdot›ãfÝand“áx‘gÅÝare“v²!ectors“and“át˜Ýis“a“scalar.Ž¡‘The–(\second“argumen²!t“spšMÞeci es“the“initial“condition,‘HÙand“the“third“sp˜eci es“a“v²!ector“of“outputŽ©times–¦fat“whic²!h“the“solution“is“desired,“including“the“time“correspMÞonding“to“the“initial“condition.Ž¡‘The–?øfourth“argumenš²!t“is“optional,‘Ttand“ma˜y“bšMÞe“used“to“sp˜ecify“a“set“of“times“that“the“ODE‘?Þsolv²!erŽ¦should–Šnot“inš²!tegrate“past.‘HIt“is“useful“for“a˜v˜oiding“diculties“with“singularities“and“pMÞoin˜ts“whereŽ¦there–¦fis“a“discon•²!tin“uit“y–¦fin“the“deriv‘ÿdDativ²!e.Ž¡‘T‘ÿeolerances–¦fand“other“options“for“Þlsode“Ýma²!y“bšMÞe“sp˜eci ed“using“the“function“Þlsode_optionsÝ.Ž¡‘Here–¦fis“an“example“of“solving“a“set“of“t•²!w“o›¦fdi eren“tial˜equations˜using˜ÞlsodeÝ.‘ÝÝThe˜functionŽŸÃô‘èUÞfunction–¿ªxdot“=“f“(x,“t)Ž©‘(g©r–¿ª=“0.25;Ž¤ ‘(g©k–¿ª=“1.4;Ž¡‘(g©a–¿ª=“1.5;Ž¡‘(g©b–¿ª=“0.16;Ž¡‘(g©c–¿ª=“0.9;Ž¡‘(g©d–¿ª=“0.8;Ž¦‘(g©xdot(1)–¿ª=“r*x(1)*(1“-“x(1)/k)“-“a*x(1)*x(2)/(1“+“b*x(1));Ž¡‘(g©xdot(2)–¿ª=“c*a*x(1)*x(2)/(1“+“b*x(1))“-“d*x(2);Ž¦‘èUendfunctionŽŸÃôÝis–¦fin²!tegrated“with“the“commandŽŸÃô‘èUÞx–¿ª=“lsode“("f",“[1;“2],“(t“=“linspace“(0,“50,“200)'));ŽŽŸŒ‹Z&ŸòÝ90’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðÐproMÞducing–äFa“set“of“200“v›ÿdDalues“stored“in“the“v˜ariable“áxÝ.‘—~Note“that“this“example“tak²!es“adv˜an²!tage“ofŽ¤the–FÊfact“that“an“assignmen²!t“proMÞduces“a“v›ÿdDalue“to“store“the“v˜alues“of“the“output“times“in“the“v˜ariableŽ¡át‘ãfÝdirectly–¦fin“the“function“call“The“results“can“then“bMÞe“plotted“using“the“commandŽŸ‘èUÞplot–¿ª(t,“x)Ž©‘ÝSee–'ãAlan“C.“Hindmarsh,‘HBáODEP‘ÿeA²!CK,“A›'ÂSystematized“Collection“of“ODE˜Solvš²!ersÝ,‘HBin“Scien˜ti cŽ¡Computing,›'ôR.–WS.“Stepleman,˜editor,˜(1983)“for“more“information“abMÞout“this“family“of“ODE‘/solv²!ers.ŽŸ ëE11.2‘™Di erenŒÌtial-Algebraic‘¦MEquationsŽŽŸ‘ÝThe–¦ffunction“Þdassl“Ýcan“bMÞe“used“Solvš²!e“D˜AEs“of“the“formŽŸ‘|>·0– §=“äf‘-¼Ý(‘›¸_ŽäxŽŽ‘B;–Ó1x;“tÝ)ä;‘¹›xÝ(ät– §Ý=“0)“=“äxŸ¤z®0Ž‘|sä;‘néÝ_Ž‘Ó1äxŽŽ‘LÝ(ät“Ý=“0)“=‘¦__Ž“äxŸ¤z®0ŽŽŽŽŸ‘èUÞdassl–¿ª(áfcnÞ,“áx‘¨/‰x³HøŽ›ñ'0Þ,“áxdot‘¨/‰x³HøŽ˜0Þ,“át‘¨/‰x³HøŽ˜outÞ,“át‘¨/‰x³HøŽ˜crit=Þ)Ž¦‘ÝThe–fŠ rst“argumenš²!t“is“the“name“of“the“function“to“call“to“compute“the“v˜ector“of“residuals.‘IItŽ¡m•²!ust›¦fha“v“e˜the˜formŽŸ‘èUáres‘3,Þ=–¿ªf“(áxÞ,“áxdotÞ,“át=Þ)Ž¦Ýwhere–¦fáxÝ,“áxdotÝ,“and“áres‘èÝare“v²!ectors,“and“át‘ãfÝis“a“scalar.Ž¦‘The–.Øsecond“and“third“argumen²!ts“to“Þdassl“ÝspMÞecify“the“initial“condition“of“the“states“and“theirŽ¡deriv‘ÿdDativš²!es,‘êžand–©Çthe“fourth“argumen˜t“spMÞeci es“a“v˜ector“of“output“times“at“whic˜h“the“solution“isŽ¡desired,–¦fincluding“the“time“correspMÞonding“to“the“initial“condition.Ž¦‘The–ßset“of“initial“states“and“deriv‘ÿdDativš²!es“are“not“strictly“required“to“bMÞe“consisten˜t.‘DHIn“practice,Ž¡ho•²!w“ev“er,‘S­D“ASSL‘>äis–>ÿnot“vš²!ery“go•MÞo“d–>ÿat“determining“a“consisten˜t“set“for“y˜ou,‘S­so“it“is“bMÞest“if“y˜ou“ensureŽ¡that–¦fthe“initial“v›ÿdDalues“result“in“the“function“ev˜aluating“to“zero.Ž¦‘The–Óü fth“argumenš²!t“is“optional,‘ßaand“ma˜y“bšMÞe“used“to“sp˜ecify“a“set“of“times“that“the“D•²!AE‘Óðsolv“erŽ¡should–Šnot“inš²!tegrate“past.‘HIt“is“useful“for“a˜v˜oiding“diculties“with“singularities“and“pMÞoin˜ts“whereŽ¡there–¦fis“a“discon•²!tin“uit“y–¦fin“the“deriv‘ÿdDativ²!e.Ž¦‘T‘ÿeolerances–¦fand“other“options“for“Þdassl“Ýma²!y“bšMÞe“sp˜eci ed“using“the“function“Þdassl_optionsÝ.Ž¦‘See–ŽK.“E.“Brenan,›’úet“al.,˜áNumerical“Solution“of“Initial-V‘ÿealue“Problems“in“Di eren²!tial-AlgebraicŽ¡EquationsÝ,–¦fNorth-Holland“(1989)“for“more“information“abMÞout“the“implemenš²!tation“of“D˜ASSL.ŽŽŸŒ‹[.NŸòÝChapter‘¦f12:‘ÝÝOptimization’Né91ŽŽŽ ƒ3Ú ý¨ðÐè12‘ ¸QOptimizationŽŽŸ(Ýreturns“the“discrete“con•²!trollabilit“y–t>gramian“and“Þdgram–¦f(áaÞ',“ác‘ªÞ')‘t>ÝreturnsŽ¦‘9Ðóthe–¦fobserv‘ÿdDabilit²!y“gramian.Ž¡Þdlqe–¦f(áaÞ,“ágÞ,“ácÞ,“ásigwÞ,“ásigv‘–~Þ[,“áz‘šqÞ])Ž¦‘9ÐóÝLinear–¦fquadratic“estimator“(Kalman“ lter)“design“for“the“discrete“time“systemŽŸIP’­$äxŸ¤z´k+B®+1Ž‘:Ý=‘ §äAxŸ¤z´kŽ–Z|Ý+›nìäB‘Œ¤uŸ¤z´kŽ“Ý+˜äGwŸ¤z´kŽŽŸ’ ’¶?äyŸ¤z´kŽ‘ö7Ý=‘ §äC‘ÈxŸ¤z´kŽ–Z|Ý+›nìäDMÞuŸ¤z´kŽ“Ý+˜äwŸ¤z´kŽŽŸIP‘9ÐóÝwhere–Q·áwÝ,‘|Œáv‘AÏÝare“zero-mean“gaussian“noise“prošMÞcesses“with“resp˜ectivš²!e“in˜tensities“ásigw‘–~Þ=Ž¦‘9Ðócov–¦f(áwÞ,“áw›ðÞ)“Ýand“ásigv‘–~Þ=“cov“(ávÞ,“áv˜Þ)Ý.Ž¤p‘9ÐóIf–¦fspMÞeci ed,“áz‘@×Ýis“Þcov“(áwÞ,“áv›ðÞ)Ý.‘ÝÝOtherwise“Þcov“(áwÞ,“áv˜Þ)“=“0Ý.Ž¡‘9ÐóThe–¦fobserv²!er“structure“isŽŸIP’‹—«äzŸ¤z´k+B®+1Ž‘:Ý=‘ §äAzŸ¤z´kŽ–Z|Ý+›nìäB‘Œ¤uŸ¤z´kŽ“Ý+˜äkX?Ý(äyŸ¤z´kŽ“å˜äC‘ÈzŸ¤z´kŽ“å˜äDMÞuŸ¤z´kŽ‘ëÝ)ŽŸaÀ‘9ÐóReturns:Ž¡‘9Ðóál‘¸Ýis–¦fthe“observ²!er“gain,“Þ(A“-“A“L“C)“Ýis“stable.Ž¡‘9Ðóám–¦fÝis“the“Ricatti“equation“solution.Ž¡‘9Ðóáp‘ûgÝis–¦fthe“estimate“error“coš²!v‘ÿdDariance“after“the“measuremen˜t“upMÞdate.Ž¡‘9Ðóáe‘CmÝare–¦fthe“closed“lošMÞop“p˜oles“of“Þ(A“-“A“L“C)Ý.ŽŸ0àÞdlqr–¦f(áaÞ,“ábÞ,“áqÞ,“ár‘oÞ[,“áz‘šqÞ])Ž¦‘9ÐóÝLinear–¦fquadratic“regulator“design“for“the“discrete“time“systemŽ¤IP’¾„VäxŸ¤z´k+B®+1Ž‘:Ý=‘ §äAxŸ¤z´kŽ‘Z|Ý+‘nìäB‘Œ¤uŸ¤z´kŽŽ¡‘9ÐóÝto–¦fminimize“the“cost“functionalŽŽŸŒ‹aSŠŸòÝChapter–¦f14:‘ÝÝCon²!trol“Theory’C%97ŽŽŽ ƒ3Ú ý¨ðБV¹HÞJ–¿ª=“Sum“[“x'“Q“x“+“u'“R“u“],‘P{LZ“omittedŽ¤Û¬‘9ÐóÝorŽ©Û¬‘V¹HÞJ–¿ª=“Sum“[“x'“Q“x“+“u'“R“u“+2“x'“Z“u“],‘þ¨Z“includedŽ¡‘9ÐóÝReturns:Ž¡‘9Ðóák‘PjÝis–¦fthe“state“feedbac²!k“gain,“Þ(A“-“B“K)“Ýis“stable.Ž¡‘9Ðóáp‘ûgÝis–¦fthe“solution“of“algebraic“Riccati“equation.Ž¡‘9Ðóáe‘CmÝare–¦fthe“closed“lošMÞop“p˜oles“of“á(A“-“B“K)Ý.ŽŸ·XÞdlyap–¦f(áaÞ,“áb=¦Þ)ŽŸ‘9ÐóÝSolvš²!e–¦fthe“discrete-time“Ly˜apuno˜v“equationŽ¦‘V¹HÞa–¿ªx“a'“-“x“+“b“=“0Ž¡‘9ÐóÝfor–¦fsquare“matrices“áaÝ,“ábÝ.‘ÝÝIf“áb‘ä Ýis“not“square,“then“the“function“attempts“to“solv²!e“eitherŽ¦‘V¹HÞa–¿ªx“a'“-“x“+“b“b'“=“0Ž¡‘9ÐóÝorŽ¦‘V¹HÞa'–¿ªx“a“-“x“+“b'“b“=“0Ž¡‘9ÐóÝwhic•²!hev“er–¦fis“appropriate.Ž¡‘9ÐóUses›Ó^Sc•²!h“ur˜decomp•MÞosition˜metho“d˜as˜in˜Kitaga•²!w“a,‘œIn“ternational˜Journal˜of˜Con“trolŽ¤‘9Ðó(1977);‘€€column-b²!y-column–mŒsolution“methoMÞd“as“suggested“in“Hammarling,‘xëIMA‘m~JournalŽ¡‘9Ðóof–¦fNumerical“Analysis,“(1982).Ž©·XÞis_controllable–¦f(áaÞ,“ábÞ,“átolnRÞ)Ž¡‘9ÐóÝIf–¦fthe“pair“(a,“b)“is“con²!trollable,“then“return“v›ÿdDalue“1.‘ÝÝOtherwise,“returns“a“v˜alue“of“0.Ž¤Û¬‘9Ðóátol‘¸Ýis–¦fa“roundo “parameter,“set“to“Þ2*eps“Ýif“omitted.Ž¡‘9ÐóCurrenš²!tly–pHjust“constructs“the“con˜trollabilit˜y“matrix“and“c˜hec˜ks“rank.‘ËÓA‘p:bšMÞetter“metho˜dŽ¤‘9Ðóis–´as“folloš²!ws“(Boley“and“Golub,‘·xSystems“and“Con˜trol“Letters,‘·x1984):‘ù.Con˜trollabilit˜y“isŽ¡‘9Ðódetermined–+²b²!y“applying“Arnoldi“iteration“with“complete“re-orthogonalization“to“obtainŽ¡‘9Ðóan–¦forthogonal“basis“of“the“Krylo²!v“subspaceŽŸ¹ ’³ÞÉspanŽ’˧õŸ÷©–½Ž’Ð=LŸ÷©–Ž’Ôgøäb‘¦fab‘y—:–Ó1:“:Ž‘¹‘aŸûz•´nº®1Ž‘­òäbŸ÷©–½ŽŽ’M'Ÿ÷©–ŽŽŽŸ”¹Þis_observable–¦f(áaÞ,“ácÞ,“átolnRÞ)Ž¡‘9ÐóÝReturns–¦f1“if“the“pair“Þ(a,“c)“Ýis“observ›ÿdDable.‘ÝÝOtherwise,“returns“a“v˜alue“of“0.Ž¦Þlqe–¦f(áaÞ,“ágÞ,“ácÞ,“ásigwÞ,“ásigvÞ,“áz‘šqÞ)ŽŸ ‘V¹H[k,–¿ªp,“e]“=“lqe“(a,“g,“c,“sigw,“sigv,“z)ŽŸÛ¬‘9ÐóÝLinear–¦fquadratic“estimator“(Kalman“ lter)“design“for“the“con•²!tin“uous–¦ftime“systemŽŸ¸àŸø—ž’È,ädxŽ’È,ŸÞȉfe õ"Ÿ t‘&ëdtŽŽŽŽ’ØO(Ý=‘ §äAx–nìÝ+“äB‘Œ¤uŽŸ¹ ’ÊÀ“y‘o:Ý=‘ §äC‘Èx–nìÝ+“äDMÞuŽŸn±‘9ÐóÝwhere–¦fáwÝ,“áv‘–~Ýare“zero-mean“gaussian“noise“prošMÞcesses“with“resp˜ectivš²!e“in˜tensitiesŽŽŸŒ‹b]+ŸòÝ98’©¦™Octa•²!v“eŽŽŽ ƒ3Ú ý¨ðБV¹HÞsigw–¿ª=“cov“(w,“w)ŽŸ ‘V¹Hsigv–¿ª=“cov“(v,“v)Ž¤_‘9Ðóáz‘ÐÝÝ(if–6lspMÞeci ed)“is“the“cross-co²!v›ÿdDariance“Þcov–¦f(áwÞ,“áv‘ðÞ)Ý;‘~pthe–6ldefault“v˜alue“is“Þcov–¦f(áwÞ,“áv‘ðÞ)“=Ž©‘9Ðó0Ý.Ž¡‘9ÐóObserv²!er–¦fstructure“is“Þdz/dt“=“A“z“+“B“u“+“k“(y“-“C“z“-“D“u)Ž¡‘9ÐóÝreturns:Ž¡‘9Ðóák‘PjÝis–¦fobserv²!er“gain:‘ÝÝÞ(A“-“K“C)“Ýis“stable.Ž¡‘9Ðóáp‘ûgÝis–¦fsolution“of“algebraic“Riccati“equation.Ž¡‘9Ðóáe‘CmÝis–¦fthe“v²!ector“of“closed“lošMÞop“p˜oles“of“Þ(A“-“K“C)Ý.ŽŸ¾ Þlqr–¦f(áaÞ,“ábÞ,“áqÞ,“árÞ,“áz‘šqÞ)Ž¦[ákÞ,–¦fápÞ,“áe‘Þ]“=“lqr“(áaÞ,“ábÞ,“áqÞ,“árÞ,“áz‘šqÞ)Ž¦‘9ÐóÝLinear–¦fquadratic“regulator“design“for“the“con•²!tin“uous–¦ftime“systemŽŸ*Ÿø—ž’È,ädxŽ’È,ŸÞȉfe õ"Ÿ t‘&ëdtŽŽŽŽ’ØO(Ý=‘ §äAx–nìÝ+“äB‘Œ¤uŽŸz’‘9ÐóÝto–¦fminimize“the“cost“functionalŽŸ’·PœäJ‘DÝ=‘ §Ÿò&»½ZŽŸôŸ‘ ¨º1ŽŸ@‘˜á®0ŽŽ‘V¾äxŸûz•º0Ž›Î9äQx–nìÝ+“äuŸûz•º0Ž˜äR¨uŽŸ"6j‘9Ðóáz‘@×Ýomitted‘¦forŽŸ’¢1äJ‘DÝ=‘ §Ÿò&»½ZŽŸôŸ‘ ¨º1ŽŸ@‘˜á®0ŽŽ‘V¾äxŸûz•º0Ž›Î9äQx–nìÝ+“äuŸûz•º0Ž˜äR¨u“Ý+“2äxŸûz•º0Ž˜äZ‘ÈuŽŸ×d‘9Ðóáz‘@×ÝincludedŽ¡‘9ÐóReturns:Ž¡‘9Ðóák‘PjÝis–¦fstate“feedbac²!k“gain:‘ÝÝÞ(A“-“B“K)“Ýis“stable.Ž¡‘9Ðóáp‘ûgÝis–¦fthe“stabilizing“solution“of“appropriate“algebraic“Riccati“equation.Ž¡‘9Ðóáe‘CmÝis–¦fthe“v²!ector“of“the“closed“lošMÞop“p˜oles“of“Þ(A“-“B“K)Ý.ŽŸ¾ Þlyap–¦f(áaÞ,“ábÞ,“ác‘ªÞ)Ž¦‘9ÐóÝSolvš²!e–.the“Ly˜apuno˜v“(or“Sylv˜ester)“equation“via“the“Bartels-Stew˜art“algorithm“(Com-Ž¦‘9Ðómš²!unications–¦fof“the“A˜CM,“1972).Ž¡‘9ÐóIf–¦fÞ(a,“b,“c)“Ýare“spMÞeci ed,“then“Þlyap“Ýreturns“the“solution“of“the“Sylv²!ester“equationŽ©_‘V¹HÞa–¿ªx“+“x“b“+“c“=“0Ž¡‘9ÐóÝIf–¦fonly“Þ(a,“b)“Ýare“spMÞeci ed,“then“Þlyap“Ýreturns“the“solution“of“the“Ly•²!apuno“v‘¦fequationŽ¦‘V¹HÞa'–¿ªx“+“x“a“+“b“=“0Ž¡‘9ÐóÝIf–¦fáb‘ä Ýis“not“square,“then“Þlyap“Ýreturns“the“solution“of“eitherŽ¦‘V¹HÞa'–¿ªx“+“x“a“+“b'“b“=“0Ž¡‘9ÐóÝorŽŽŸŒ‹cfaŸòÝChapter–¦f14:‘ÝÝCon²!trol“Theory’C%99ŽŽŽ ƒ3Ú ý¨ðБV¹HÞa–¿ªx“+“x“a'“+“b“b'“=“0Ž¤‘9ÐóÝwhic•²!hev“er–¦fis“appropriate.Ž¡‘9ÐóSolv•²!es›¦fb“y˜using˜the˜Bartels-Stew“art˜algorithm˜(1972).ŽŸÞtzero–¦f(áaÞ,“ábÞ,“ácÞ,“ádÞ,“ábalnRÞ)Ž©‘9ÐóÝCompute–¦fthe“transmission“zeros“of“[A,“B,“C,“D].Ž¡‘9Ðóábal‘¸Ý=–¦fbalancing“option“(see“balance);“default“is“Þ"B"Ý.Ž¡‘9ÐóNeeds–†to“incorpšMÞorate“Þmvzero“Ýalgorithm“to“isolate“ nite“zeros;‘‘+see“Ho˜del,‘ŒìáComputationŽ¦‘9Ðóof–¦fSystem“Zeros“with“BalancingÝ,“Linear“Algebra“and“its“Applications,“July“1993.ŽŽŸŒ‹dn7ŸòÝ100’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹ep®ŸòÝChapter–¦f15:‘ÝÝSignal“ProMÞcessing’4„101ŽŽŽ ƒ3Ú ý¨ðÐè15‘ ¸QSignal‘¦MPro‘Š=cessingŽŽŸ2±‘ÝI‘¸,hopMÞe–¸0that“somedaš²!y“Octa˜v˜e“will“include“more“signal“proMÞcessing“functions.‘;If“y˜ou“w˜ould“lik˜e“toŽ©help›¦fimpro•²!v“e˜Octa“v“e˜in˜this˜area,˜please˜con“tact˜Þbug-octave@che.utexas.eduÝ.ŽŸŒ¬Þfft‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“FFT“of“áa“Ýusing“subroutines“from“FFTP‘ÿeA²!CK.Ž¤XÞfft2‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“t•²!w“o–¦fdimensional“FFT“of“áaÝ.Ž¡Þfftconv–¦f(áaÞ,“ábÞ,“áN‘/®Þ)Ž¦‘9ÐóÝThis–Èfunction“returns“the“con•²!v“olution–Èof“the“vš²!ectors“áa“Ýand“ábÝ,‘k`a“v˜ector“with“lengthŽ¦‘9Ðóequal–)—to“the“Þlength–¦f(a)“+“length“(b)“-“1Ý.‘´CIf–)—áa“Ýand“áb‘g=Ýare“the“coMÞecienš²!t“v˜ectors“of“t˜w˜oŽ¦‘9ÐópšMÞolynomials,–¦fthe“returned“v‘ÿdDalue“is“the“co˜ecienš²!t“v˜ector“of“the“prošMÞduct“p˜olynomial.ŽŸŒ¬‘9ÐóThe–®Icomputation“uses“the“FFT‘®Gb²!y“calling“the“function“ÞfftfiltÝ.‘õ‡If“the“optional“argu-Ž¦‘9Ðómen²!t–¦fáN‘ÖÝis“spšMÞeci ed,“an“N-p˜oin²!t“FFT“is“used.Ž¡Þfftfilt–¦f(ábÞ,“áxÞ,“áN‘/®Þ)Ž¦‘9ÐóÝWith›¦ft•²!w“o˜argumen“ts,˜Þfftfilt˜Ý lters˜áx‘gÅÝwith˜the˜FIR˜ lter˜áb‘ä Ýusing˜the˜FFT.ŽŸŒ¬‘9ÐóGivš²!en–ì the“optional“third“argumen˜t,‘ýáNÝ,“Þfftfilt“Ýuses“the“o˜v˜erlap-add“methoMÞd“to“ lterŽ¦‘9Ðóáx‘gÅÝwith–¦fáb‘ä Ýusing“an“N-pMÞoin²!t“FFT.Ž¡Þfilter–¦f(ábÞ,“áaÞ,“áx‘Á_Þ)Ž¦‘9ÐóÝThis–`ªfunction“returns“the“solution“to“the“folloš²!wing“linear,‘Ï;time-in˜v‘ÿdDarian˜t“di erenceŽ¦‘9Ðóequation:Ž¤ØrŸóC1‘}˜´NŽŸ ¼Ï‘yTŒŸöC0½XŽŽŸ ÊS‘yG§´k+B®=0ŽŽ’‰¦käaŸ¤z´k+B®+1Ž– “äyŸ¤z´nº´kŽ‘‹ûÝ+ŸóC1‘„ˆ´MŽŸ ¼Ï‘{ÑŸöC0½XŽŽŸ ÊS‘nì´k+B®=0ŽŽ‘Í°äbŸ¤z´k+B®+1Ž“äxŸ¤z´nº´kŽ‘'¶Ý=– §0ä;‘¹›Ý1“å“än“å“äPŽŸ!JÓ‘9ÐóÝwhere›¦fäa– §å2“<Ÿü¾´N‘À,º®1Ž‘Ò%Ý,˜äb“å2“<Ÿü¾´M‘À,º®1Ž‘ÐÝ,˜and˜äx“å2“<Ÿü¾´PŽ‘ªïÝ.‘ÝÝAn˜equiv‘ÿdDalen²!t˜form˜of˜this˜equation˜is:Ž¡‘v¢ÛäyŸ¤z´nŽ‘|%Ý=ŸóC1‘Ř´NŽŸ ¼Ï‘ŒŸöC0½XŽŽŸ ÊS‘ §´k+B®=1ŽŽ‘ikäcŸ¤z´k+B®+1Ž– “äyŸ¤z´nº´kŽ‘‹ûÝ+ŸóC1‘„ˆ´MŽŸ ¼Ï‘{ÑŸöC0½XŽŽŸ ÊS‘nì´k+B®=0ŽŽ‘Í°ädŸ¤z´k+B®+1Ž“äxŸ¤z´nº´kŽ‘ä;‘¹›Ý1– §å“än“å“äPŽŸ ¿n‘9ÐóÝwhere›¦fäc– §Ý=“äa=aŸ¤z®1Ž‘"ÙÝand˜äd“Ý=“äb=aŸ¤z®1Ž‘|sÝ.Ž¤Œ¬‘9ÐóIn–áÙterms“of“the“z-transform,‘ )y“is“the“result“of“passing“the“discrete-“time“signal“x“throughŽ¦‘9Ðóa–¦fsystem“cš²!haracterized“b˜y“the“follo˜wing“rational“system“function:ŽŸÇó’¬î+äH‘ãÁÝ(äz•{IÝ)‘ §=Ÿø—ž‘ 0ÀŸøC0½PŽŸú¼‘¾û´MŽŸ%‘¾ûk+B®=0ŽŽ‘(¿ädŸ¤z´k+B®+1Ž‘ “äz“Ÿü¾º´kŽŽ‘=ÚŸÞȉfeRÏÞŸ ?¦Ý1–nì+“ŸøC0½PŽŸú¼‘ ý'´NŽŸ%‘ ý'k+B®+1ŽŽ‘ÛëäcŸ¤z´k+B®+1Ž‘ “äz{IŸüÖ0º´kŽŽŽŽŽŽŸ§ù‘9ÐóÝWhen–¦fcalled“asŽŸŒ¬‘V¹HÞ[y,–¿ªsf]“=“filter“(b,“a,“x,“si)Ž¡‘9Ðófilter–2%Ýuses“the“argumen²!t“ási‘ƨÝas“the“initial“state“of“the“system“and“and“returns“the“ nalŽ¦‘9Ðóstate–Ï in“ásfÝ.‘WÎThe“state“vš²!ector“is“a“column“v˜ector“whose“length“is“equal“to“the“length“ofŽ¦‘9Ðóthe–¬longest“coMÞecienš²!t“v˜ector“min˜us“one.‘%¯If“ási‘¨/Ýis“not“set,‘.ýthe“initial“state“v˜ector“is“setŽ¦‘9Ðóto–¦fall“zeros.ŽŽŸŒ‹fqŸòÝ102’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞfreqzŽŽ‘9ÐóÝCompute–¦fthe“frequency“respMÞonse“of“a“ lter.Ž¤‘9ÐóÞ[áhÞ,–¦fáw‘ðÞ]“=“freqz“(áb=¦Þ)– ªÝreturns“the“complex“frequency“respMÞonse“áh“Ýof“the“FIR‘ lter“withŽ©‘9ÐócošMÞecien²!ts–¦fábÝ.‘ÝÝThe“resp˜onse“is“ev‘ÿdDaluated“at“512“angular“frequencies“b˜et•²!w“een–¦f0“and“äd“Ý.Ž¡‘9ÐóThe–¦foutput“v‘ÿdDalue“áw‘–~Ýis“a“vš²!ector“con˜taining“the“512“frequencies.Ž¡‘9ÐóÞ[áhÞ,–¦fáw‘ðÞ]“=“freqz“(ábÞ,“áaÞ)–_Ýreturns“the“complex“frequency“respšMÞonse“of“the“rational“I˜IRŽ¦‘9Ðó lter–¦fwhose“nš²!umerator“has“coMÞecien˜ts“áb‘ä Ýand“denominator“coMÞecien˜ts“áaÝ.Ž¡‘9ÐóÞ[áhÞ,–¦fáw‘ðÞ]“=“freqz“(ábÞ,“áaÞ,“ánÞ)–Ýreturns“the“respMÞonse“ev‘ÿdDaluated“at“án“Ýangular“frequencies.Ž¦‘9ÐóF‘ÿeor–¦ffastest“computation“n“should“factor“inš²!to“a“small“n˜um˜bMÞer“of“small“primes.Ž¡‘9ÐóÞ[áhÞ,–¦fáw‘ðÞ]“=“freqz“(ábÞ,“áaÞ,“ánÞ,“"whole")–Ö¬Ýev‘ÿdDaluates“the“respšMÞonse“at“n“frequencies“b˜et•²!w“eenŽ¦‘9Ðó0–¦fand“2äd“Ý.Ž¤Þifft‘¦f(áaÞ)ŽŽ‘9ÐóÝCompute–¦fthe“in•²!v“erse–¦fFFT“of“áa“Ýusing“subroutines“from“FFTP‘ÿeA²!CK.Ž¡Þifft2ŽŽ‘9ÐóÝCompute–¦fthe“t•²!w“o–¦fdimensional“in•²!v“erse–¦fFFT“of“áaÝ.Ž¡Þsinc‘¦f(áx‘Á_Þ)ŽŽ‘9ÐóÝReturns‘¦fsinŽ‘(ä•d“xÝ)ä=Ý(ä“xÝ).ŽŽŸŒ‹g}ŸòÝChapter‘¦f16:‘ÝÝSets’tT103ŽŽŽ ƒ3Ú ý¨ðÐè16‘ ¸QSetsŽŽŸ ‘ÝOcta•²!v“e–ÒGhas“a“limited“set“of“functions“for“managing“sets“of“data,‘>where“a“set“is“de ned“as“aŽ¤collection–¦funique“elemen²!ts.Ž©‘Givš²!en–d5a“matrix“or“v˜ector“of“v‘ÿdDalues,‘“¨the“function“Þcreate_set“Ýreturns“a“ro˜w“v˜ector“con˜tainingŽ¡unique–ÿ•v‘ÿdDalues,› òsorted“in“ascending“order.‘¦BF‘ÿeor“example,˜`Þcreate_set–¦f([1,“2;“3,“4;“4,“2])Ý'‘ÿ•returnsŽ¡the–¦fv²!ector“`Þ[1,“2,“3,“4]Ý'.Ž¦‘The–öúfunctions“Þunion“Ýand“Þintersection“Ýtakš²!e“t˜w˜o“sets“as“argumen˜ts“and“return“the“union“andŽ¡in•²!terection,›µFrespMÞectiv“ely–ÿe.‘F“or‘²Lexample,˜`Þunion–¦f([1,“2,“3],“[2,“3,“5])Ý'–²Lreturns“the“v²!ector“`Þ[1,‘¦f2,Ž¡5]Ý'.Ž¦‘The–žÚfunction“Þcomplement–¦f(áaÞ,“áb=¦Þ)–žÚÝreturns“the“elemen²!ts“of“set“áb‘Ü€Ýthat“are“not“in“set“áaÝ.‘†F‘ÿeor“example,Ž¡`Þcomplement–¦f([1,“2,“3],“[2,“3,“5])Ý'“returns“the“v‘ÿdDalue“`Þ5Ý'.ŽŽŸŒ‹h‚)ŸòÝ104’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹i†ŸòÝChapter‘¦f17:‘ÝÝStatistics’[ï¤105ŽŽŽ ƒ3Ú ý¨ðÐè17‘ ¸QStatisticsŽŽŸ ‘ÝI‘´hopMÞe–ðthat“somedaš²!y“Octa˜v˜e“will“include“more“statistics“functions.‘š{If“y˜ou“w˜ould“lik˜e“to“helpŽ¤impro•²!v“e›¦fOcta“v“e˜in˜this˜area,˜please˜con“tact˜Þbug-octave@che.utexas.eduÝ.ŽŸÞcorrcoef–¦f(áx‘gÅÞ[,“áy‘ðÞ])Ž¡‘9ÐóÝIf–§eacš²!h“ro˜w“of“áx‘hfÝand“áy‘—Ýis“an“observ‘ÿdDation“and“eac˜h“column“is“a“v‘ÿdDariable,‘ç.the“(i,j)-thŽ¡‘9Ðóenš²!try–_of“Þcorrcoef–¦f(áxÞ,“áy‘ðÞ)–_Ýis“the“correlation“bMÞet˜w˜een“the“i-th“v‘ÿdDariable“in“áx‘ àÝand“the“j-thŽ¡‘9Ðóv‘ÿdDariable–¦fin“áyÝ.‘ÝÝIf“in•²!v“ok“ed–¦fwith“one“argumen²!t,“compute“Þcorrcoef“(áxÞ,“áx‘Á_Þ)Ý.Ž©Þcov–¦f(áx‘gÅÞ[,“áy‘ðÞ])Ž¡‘9ÐóÝIf–teacš²!h“ro˜w“of“áx‘ÄÓÝand“áy‘óŒÝis“an“observ‘ÿdDation“and“eac˜h“column“is“a“v‘ÿdDariable,‘$ the“(i,j)-th“en˜tryŽ¡‘9Ðóof›¢ôÞcov–¦f(áxÞ,“áy‘ðÞ)˜Ýis˜the˜co•²!v‘ÿdDariance˜bMÞet“w“een˜the˜i-th˜v–ÿdDariable˜in˜X‘¢óand˜the˜j-th˜v“ariable˜inŽ¡‘9ÐóáyÝ.‘ÝÝIf›¦fin•²!v“ok“ed˜with˜one˜argumen“t,˜compute˜Þcov˜(áxÞ,˜áx‘Á_Þ)Ý.Ž¦Þkurtosis‘¦f(áx‘Á_Þ)Ž¡‘9ÐóÝIf–¦fáx‘gÅÝis“a“v²!ector“of“length“N,“return“the“kurtosisŽ¡‘V¹HÞkurtosis(x)–¿ª=“N^(-1)“std(x)^(-4)“SUM_i“(x(i)-mean(x))^4“-“3ŽŸ‘9ÐóÝof–¦fáxÝ.‘ÝÝIf“áx‘gÅÝis“a“matrix,“return“the“roš²!w“v˜ector“con˜taining“the“kurtosis“of“eac˜h“column.Ž¦Þmahalanobis–¦f(áxÞ,“áy‘ðÞ)Ž¡‘9ÐóÝReturns–©÷Mahalanobis'“D-square“distance“bMÞet•²!w“een–©÷the“m²!ultiv‘ÿdDariate“samples“áx‘kVÝand“áyÝ,Ž¡‘9Ðówhic•²!h›q–m“ust˜ha“v“e˜the˜same˜n“um“b•MÞer˜of˜comp“onen•²!ts˜(columns),‘|&but˜ma“y˜ha“v“e˜a˜di eren“tŽ¡‘9Ðón•²!um“bMÞer–¦fof“observ‘ÿdDations“(ro²!ws).Ž¦Þmean‘¦f(áaÞ)ŽŽ‘9ÐóÝIf–Èßáa“Ýis“a“vš²!ector,‘Ñ}compute“the“mean“of“the“elemen˜ts“of“áaÝ.‘EHIf“áa“Ýis“a“matrix,‘Ñ}compute“theŽ¡‘9Ðómean–¦ffor“eacš²!h“column“and“return“them“in“a“ro˜w“v˜ector.Ž¦Þmedian‘¦f(áaÞ)Ž¡‘9ÐóÝIf–ÆÝáa“Ýis“a“vš²!ector,‘ó’compute“the“median“v‘ÿdDalue“of“the“elemen˜ts“of“áaÝ.‘“ZIf“áa“Ýis“a“matrix,‘ó’computeŽ¡‘9Ðóthe–¦fmedian“v‘ÿdDalue“for“eacš²!h“column“and“return“them“in“a“ro˜w“v˜ector.Ž¦Þskewness‘¦f(áx‘Á_Þ)Ž¡‘9ÐóÝIf–¦fáx‘gÅÝis“a“vš²!ector“of“length“N,“return“the“sk˜ewnessŽ¡‘V¹HÞskewness–¿ª(x)“=“N^(-1)“std(x)^(-3)“SUM_i“(x(i)-mean(x))^3ŽŸ‘9ÐóÝof–¦fáxÝ.‘ÝÝIf“áx‘gÅÝis“a“matrix,“return“the“roš²!w“v˜ector“con˜taining“the“sk˜ewness“of“eac˜h“column.Ž¦Þstd‘¦f(áaÞ)ŽŽ‘9ÐóÝIf–¾Oáa“Ýis“a“vš²!ector,‘ÄIcompute“the“standard“deviation“of“the“elemen˜ts“of“áaÝ.‘%˜If“áa“Ýis“a“matrix,Ž¡‘9Ðócompute–¦fthe“standard“deviation“for“eacš²!h“column“and“return“them“in“a“ro˜w“v˜ector.ŽŽŸŒ‹j†qŸòÝ106’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹kÀŸòÝChapter‘¦f18:‘ÝÝPlotting’`Ź107ŽŽŽ ƒ3Ú ý¨ðÐè18‘ ¸QPlottingŽŽŸ!­Ô‘ÝAll–„¼of“Octa•²!v“e's–„¼plotting“functions“use“Þgnuplot“Ýto“handle“the“actual“graphics.‘xÞThere“are“t•²!w“oŽ¤lo•²!w-lev“el–eùfunctions,›rÜÞgplot“Ýand“ÞgsplotÝ,˜that“bšMÞeha•²!v“e–eùalmost“exactly“lik²!e“the“corresp˜onding“ÞgnuplotŽ¡Ýfunctions–FÞplot“Ýand“`ÞsplotÝ'.‘ÐÒA‘Žfunctions“found“in“ãMa‘ÿEtlab“Ývš²!ersion“3.5,‘d˜are“also“a˜v‘ÿdDailable.‘¦VThese“higher“lev˜el“functionsŽ¡are–¦fall“implemenš²!ted“in“terms“of“the“t˜w˜o“lo˜w-lev˜el“plotting“functions.ŽŸ!WÝëE18.1‘™TwŒÌo-Dimensional‘¦MPlottingŽŽŸU÷‘ÝThe–¦fsynš²!tax“for“Octa˜v˜e's“t˜w˜o-dimensional“plotting“function,“ÞgplotÝ,“isŽŸU÷‘èUÞgplot–¿ªáranges‘3,expression“using‘¯Âtitle‘\±st²!yleŽ©U÷Ýwhere–ëthe“árangesÝ,–‘¿ªpiŽŸ ‘èUpi–¿ª=“3.1416Ž¦‘ÝThis–Îwš²!orks“w˜ell“as“long“as“it“is“acceptable“to“ha˜v˜e“the“name“of“the“v‘ÿdDariable“(or“`ÞansÝ')“prin˜tedŽ¡along–ÝÏwith“the“v›ÿdDalue.‘„T‘ÿeo“prin²!t“the“v˜alue“of“a“v˜ariable“without“prin²!ting“its“name,‘ë©use“the“functionŽ¡ÞdispÝ.‘ÝÝF‘ÿeor–¦fexample,“the“follo²!wing“expressionŽ¤b?‘èUÞdisp–¿ª("The“value“of“pi“is:"),“disp“(pi)Ž¦Ýwill‘¦fprin²!tŽ¡‘èUÞThe–¿ªvalue“of“pi“is:ŽŸ ‘èU3.1416Ž¦ÝNote–¦fthat“the“output“from“Þdisp“Ýalw•²!a“ys–¦fends“with“a“newline.Ž¦‘A‘Zsimple›Z,w•²!a“y˜to˜con“trol˜the˜output˜format˜is˜with˜the˜Þformat˜Ýstatemen“t.‘ÄuF‘ÿeor˜example,‘ikto˜prin“tŽŸmore–¦fdigits“for“pi“y²!ou“can“use“the“commandŽ¡‘èUÞformat‘¿ªlongŽŽŸŒ‹vôÓŸòÝ118’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐThen–¦fthe“expression“abMÞo•²!v“e–¦fwill“prin²!tŽŸ€–‘èUÞThe–¿ªvalue“of“pi“is:ŽŸ ‘èU3.14159265358979ŽŸ€–‘ÝHere–¦fis“a“summary“of“the“options“for“ÞformatÝ:ŽŸ,ÞshortŽŽ‘9ÐóÝThis–9is“the“default“format.‘ÖyOcta•²!v“e–9will“try“to“prinš²!t“n˜um˜bMÞers“with“at“least“5“signi can˜tŽ¤‘9Ðó gures–¦fwithin“a“ eld“that“is“a“maximš²!um“of“10“c˜haracters“wide.Ž©€–‘9ÐóIf›10Octa•²!v“e˜is˜unable˜to˜format˜a˜matrix˜so˜that˜columns˜line˜up˜on˜the˜decimal˜pMÞoin“tŽ¡‘9Ðóand–¦fall“the“n•²!um“bMÞers–¦f t“within“the“maximš²!um“ eld“width,“it“switc˜hes“to“an“`ÞeÝ'“format.ŽŸ,ÞlongŽŽ‘9ÐóÝOcta•²!v“e–œ¡will“try“to“prinš²!t“n˜um˜bMÞers“with“at“least“15“signi can˜t“ gures“within“a“ eld“thatŽ¡‘9Ðóis–¦fa“maximš²!um“of“24“c˜haracters“wide.Ž¦‘9ÐóAs–`÷will“the“`ÞshortÝ'“format,‘nÚOcta•²!v“e–`÷will“switc²!h“to“an“`ÞeÝ'“format“if“it“is“unable“to“formatŽ¡‘9Ðóa–è0matrix“so“that“columns“line“up“on“the“decimal“pMÞoinš²!t“and“all“the“n˜um˜bMÞers“ t“withinŽ¡‘9Ðóthe–¦fmaxim²!um“ eld“width.Ž©,Þlong‘¦feŽŽŽ¡short‘¦feŽŽ‘9ÐóÝThe–F-same“as“`Þformat›¦flongÝ'“or“`Þformat˜shortÝ'“but“alw•²!a“ys›F-displa“y˜output˜with˜an˜`ÞeÝ'Ž¡‘9Ðóformat.‘ÝÝF‘ÿeor–¦fexample,“with“the“`Þshort“eÝ'“format,“pi“is“displa•²!y“ed‘¦fasŽŸ€–‘\xòÞ3.14e+00Ž¦long‘¦fEŽŽŽ¡short‘¦fEŽŽ‘9ÐóÝThe–‹same“as“`Þformat–¦flong“eÝ'–‹or“`Þformat–¦fshort“eÝ'–‹but“alw•²!a“ys›‹displa“y˜output˜with˜anŽ¡‘9ÐóuppMÞercase–¦f`ÞEÝ'“format.‘ÝÝF‘ÿeor“example,“with“the“`Þlong“EÝ'“format,“pi“is“displa•²!y“ed‘¦fasŽŸ€–‘\xòÞ3.14159265358979E+00Ž¦freeŽŽŽ¡noneŽŽ‘9ÐóÝPrin²!t–:Ooutput“in“free“format,‘ŸIwithout“trying“to“line“up“columns“of“matrices“on“theŽ¡‘9Ðódecimal–ÉþpMÞoinš²!t.‘”eThis“also“causes“complex“n˜um˜bšMÞers“to“b˜e“formatted“lik²!e“this“`Þ(0.604194,Ž¡‘9Ðó0.607088)Ý'–¦finstead“of“lik²!e“this“`Þ0.60419“+“0.60709iÝ'.Ž¦ÞbankŽŽ‘9ÐóÝPrinš²!t–¦fin“a“ xed“format“with“t˜w˜o“places“to“the“righ˜t“of“the“decimal“pMÞoin˜t.Ž¦Þ+ŽŽ‘9ÐóÝPrinš²!t–ña“`Þ+Ý'“sym˜bMÞol“for“nonzero“matrix“elemen˜ts“and“a“space“for“zero“matrix“elemen˜ts.Ž¡‘9ÐóThis–¦fformat“can“bMÞe“v²!ery“useful“for“examining“the“structure“of“a“large“matrix.ŽŸ,‘The–¸€Þinput“Ýfunction“ma²!y“bMÞe“used“for“prompting“the“user“for“a“v‘ÿdDalue“and“storing“the“result“in“aŽ¡v‘ÿdDariable.‘ÝÝF‘ÿeor‘¦fexample,Ž¤€–‘èUÞinput–¿ª("Pick“a“number,“any“number!“")Ž©€–Ýprin²!ts–¦fthe“promptŽ¡‘èUÞPick–¿ªa“number,“any“number!Ž¦Ýand–,wš²!aits“for“the“user“to“en˜ter“a“v‘ÿdDalue.‘¦ÊThe“string“en˜tered“b˜y“the“user“is“ev‘ÿdDaluated“as“an“expression,ŽŸso–¦fit“maš²!y“bMÞe“a“literal“constan˜t,“a“v‘ÿdDariable“name,“or“an˜y“other“v‘ÿdDalid“expression.ŽŽŸŒ‹w¯ŸòÝChapter–¦f20:‘ÝÝInput“and“Output’1+’119ŽŽŽ ƒ3Ú ý¨ðБCurren²!tly‘ÿe,›¬Þinput–wÀÝonly“returns“one“v‘ÿdDalue,˜regardless“of“the“n•²!um“bšMÞer–wÀof“v‘ÿdDalues“pro˜duced“b²!y“theŽ¤ev‘ÿdDaluation–¦fof“the“expression.Ž©ÃÅ‘If–lÛyš²!ou“are“only“in˜terested“in“getting“a“literal“string“v‘ÿdDalue,‘x]y˜ou“can“call“Þinput“Ýwith“the“c˜haracterŽ¡string–̆`ÞsÝ'“as“the“second“argumenš²!t.‘•=This“tells“Octa˜v˜e“to“return“the“string“en˜tered“b˜y“the“user“directly‘ÿe,Ž¡without–¦fev‘ÿdDaluating“it“ rst.Ž¦‘Because–ÏJthere“maš²!y“bMÞe“output“w˜aiting“to“bMÞe“displa˜y˜ed“b˜y“the“pager,‘Ùƒit“is“a“go•MÞo“d–ÏJidea“to“alw˜a˜ysŽ¡call–ÊmÞfflush‘¦f(stdout)“ÝbšMÞefore“calling“ÞinputÝ.‘IñThis“will“ensure“that“all“p˜ending“output“is“written“toŽ¡the–¦fscreen“bMÞefore“yš²!our“prompt.‘ÝÝSee“Section“20.2“[C-St˜yle“I/O“F‘ÿeunctions],“page“121.Ž¦‘The–¢¿second“input“function,–£zÞkeyboardÝ,“is–¢¿normally“used“for“simple“debugging.‘Ü¥Using“ÞkeyboardÝ,Ž¡it–“–is“pMÞossible“to“examine“the“v›ÿdDalues“of“v˜ariables“within“a“function,‘Îáand“to“assign“new²!assign“newŽ¡v‘ÿdDariables–1Lik²!e“ÞinputÝ,›.cit“prompts“the“user“for“input,˜but“no“v‘ÿdDalue“is“returned,˜and“it“con•²!tin“ues‘1toŽ¡prompt–¦ffor“input“unš²!til“the“user“t˜ypMÞes“`ÞquitÝ',“or“`ÞexitÝ'.Ž¦‘If–¦fÞkeyboard“Ýis“in•²!v“ok“ed–¦fwithout“anš²!y“argumen˜ts,“a“default“prompt“of“`Þdebug>“Ý'“is“used.Ž¦‘F‘ÿeor–ôbMÞoth“of“these“functions,‘®the“normal“command“line“history“and“editing“functions“are“a²!v‘ÿdDailableŽ¡at–¦fthe“prompt.Ž¦‘T‘ÿeo›¦fsa•²!v“e˜v‘ÿdDariables˜in˜a˜ le,˜use˜the˜Þsave˜Ýcommand.‘ÝÝF‘ÿeor˜example,˜the˜commandŽŸÃÅ‘èUÞsave–¿ªdata“a“b“cŽ¦Ýsa•²!v“es–¦fthe“v‘ÿdDariables“`ÞaÝ',“`ÞbÝ',“and“`ÞcÝ'“in“the“ le“`ÞdataÝ'.Ž¦‘The›Ú–ása•²!v“e‘wÝcommand˜can˜read˜ les˜in˜Octa“v“e's˜text˜and˜binary˜formats˜as˜w“ell˜as˜ãMa‘ÿEtlabÝ'sŽ¡binary–EYformat.‘º¶Y‘ÿeou“can“spMÞecify“the“default“format“with“the“built-in“v‘ÿdDariable“ádefault‘¨/‰x³HøŽ›ñ'sa•²!v“e‘¨/‰x³HøŽ˜formatŽ¡Ýusing–1¨one“of“the“folloš²!wing“v‘ÿdDalues:‘ôaÞ"binary"“Ýor“Þ"mat-binary"Ý.‘£The“initial“default“sa˜v˜e“format“isŽ¡Octa•²!v“e's–¦ftext“format.Ž¦‘Y‘ÿeou–f{can“use“the“built-in“v‘ÿdDariable“Þsave_precision“Ýto“spšMÞecify“the“n•²!um“b˜er–f{of“digits“to“k²!eep“whenŽ¡sa²!ving–¦fdata“in“text“format.Ž¦‘The–*olist“of“v‘ÿdDariables“to“sa•²!v“e›*oma“y˜include˜wildcard˜patterns˜con“taining˜the˜follo“wing˜spMÞecialŽ¡c²!haracters:Ž©‡ŠÞ?ŽŽ‘9ÐóÝMatc•²!h›¦fan“y˜single˜c“haracter.Ž¤‡ŠÞ*ŽŽ‘9ÐóÝMatcš²!h–¦fzero“or“more“c˜haracters.Ž¡Þ[‘¦fálist‘ãfÞ]ŽŽ‘9ÐóÝMatcš²!h–¥3the“list“of“c˜haracters“spMÞeci ed“b˜y“álistÝ.‘ÚDIf“the“ rst“c˜haracter“is“Þ!“Ýor“Þ^Ý,‘äæmatc˜hŽ¤‘9Ðóall–äÍcš²!haracters“except“those“spMÞeci ed“b˜y“álistÝ.‘™F‘ÿeor“example,‘ôfthe“pattern“`Þ[a-zA-Z]Ý'“willŽ¡‘9Ðómatcš²!h–¦fall“lo˜w˜er“and“uppšMÞer“case“alphab˜etic“c²!haracters.Ž¦‘The–¦ffolloš²!wing“options“ma˜y“bšMÞe“sp˜eci ed“for“ÞsaveÝ.Ž¦Þ-asciiŽŽ‘9ÐóÝSa•²!v“e–ìthe“data“in“Octa•²!v“e's–ìtext“data“format.‘®úUsing“this“ ag“o•²!v“errides–ìthe“v‘ÿdDalue“of“theŽ¡‘9Ðóbuilt-in–¦fv‘ÿdDariable“Þdefault_save_precisionŽŽŸŒ‹x ~ŸòÝ120’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞ-binaryŽŽ‘9ÐóÝSa•²!v“e–*the“data“in“Octa•²!v“e's–*binary“data“format.‘´nUsing“this“ ag“o•²!v“errides–*the“v‘ÿdDalue“of“theŽ¤‘9Ðóbuilt-in–¦fv‘ÿdDariable“Þdefault_save_precisionŽ© ¤-float-binaryŽ¡‘9ÐóÝSa•²!v“e–Øïthe“data“in“Octa•²!v“e's–Øïbinary“data“format“but“only“using“single“precision.‘™`Using“thisŽ¡‘9Ðó ag›ƒo•²!v“errides˜the˜v–ÿdDalue˜of˜the˜built-in˜v“ariable˜Þdefault_save_precisionÝ.‘Ò?Y‘ÿeou˜shouldŽ¡‘9Ðóuse–Æ‹this“format“only“if“yš²!ou“kno˜w“that“all“the“v‘ÿdDalues“to“bMÞe“sa˜v˜ed“can“bMÞe“represen˜ted“inŽ¡‘9Ðósingle‘¦fprecision.Ž¦Þ-mat-binaryŽ¡‘9ÐóÝSa•²!v“e–×¥the“data“in“ãMa‘ÿEtlabÝ's“binary“data“format.‘qšUsing“this“ ag“o•²!v“errides–×¥the“v‘ÿdDalue“ofŽ¡‘9Ðóthe–¦fbuilt-in“v‘ÿdDariable“Þdefault_save_precisionÝ.Ž¦Þ-save-builtinsŽ¡‘9ÐóÝF‘ÿeorce›Ó Octa•²!v“e˜to˜sa“v“e˜the˜v–ÿdDalues˜of˜built-in˜v“ariables˜toMÞo.‘cÐBy˜default,‘Þ6Octa•²!v“e˜doMÞes˜notŽ¡‘9Ðósa•²!v“e–¦fbuilt-in“v‘ÿdDariables.ŽŸ ¤‘Saš²!ving–Бglobal“v‘ÿdDariables“also“sa˜v˜es“the“global“status“of“the“v‘ÿdDariable,‘Ûso“that“if“it“is“restored“at“aŽ¡later–¦ftime“using“`ÞloadÝ',“it“will“bMÞe“restored“as“a“global“v‘ÿdDariable.Ž©†Ò‘T›ÿeo–¸nrestore“the“v‘ÿdDalues“from“a“ le,‘¼ñuse“the“Þload“Ýcommand.‘öF˜or“example,‘¼ñto“restore“the“v‘ÿdDariablesŽ¡sa•²!v“ed–¦fin“the“ le“`ÞdataÝ',“use“the“commandŽŸ†Ò‘èUÞload‘¿ªdataŽ¦‘ÝOcta•²!v“e–¦fwill“refuse“to“o•²!v“erwrite–¦fexisting“v‘ÿdDariables“unless“y²!ou“use“the“option“`Þ-forceÝ'.Ž¦‘If–.a“v‘ÿdDariable“that“is“not“markš²!ed“as“global“is“loaded“from“a“ le“when“a“global“sym˜bMÞol“with“theŽ¡same–Õßname“already“exists,›á¾it“is“loaded“in“the“global“sym²!bMÞol“table.‘lIAlso,˜if“a“v‘ÿdDariable“is“mark²!ed“asŽ¡global–u…in“a“ le“and“a“lošMÞcal“sym²!b˜ol“exists,‘Kthe“lo˜cal“sym²!b˜ol“is“mo•²!v“ed–u…to“the“global“sym²!b˜ol“table“andŽ¡givš²!en–åÀthe“v‘ÿdDalue“from“the“ le.‘›êSince“it“seems“that“bMÞoth“of“these“cases“are“lik˜ely“to“bMÞe“the“result“ofŽ¡some–¦fsort“of“error,“they“will“generate“w²!arnings.Ž¦‘As–4Owith“ÞsaveÝ,‘K!yš²!ou“ma˜y“spMÞecify“a“list“of“v›ÿdDariables“and“Þload“Ýwill“only“extract“those“v˜ariables“withŽ¡names–¦fthat“matc²!h.Ž¦‘The–ôuÞload“Ýcommand“can“read“data“stored“in“Octa•²!v“e's–ôutext“and“binary“formats,‘ùand“ãMa‘ÿEtlabÝ'sŽ¡binary–"aformat.‘±ÛIt“will“automatically“detect“the“tš²!ypMÞe“of“ le“and“do“con˜v˜ersion“from“di eren˜t“ oatingŽ¡pMÞoinš²!t–Ï>formats“(curren˜tly“only“IEEE‘Ï3big“and“little“endian,‘Ùsthough“other“formats“ma˜y“added“in“theŽ¡future).Ž¦‘The–¦ffolloš²!wing“options“ma˜y“bšMÞe“sp˜eci ed“for“ÞsaveÝ.ŽŸ ¤Þ-forceŽŽ‘9ÐóÝF‘ÿeorce–û3v‘ÿdDariables“currenš²!tly“in“memory“to“bMÞe“o˜v˜erwritten“b˜y“v‘ÿdDariables“with“the“same“nameŽ¡‘9Ðófound–¦fin“the“ le.Ž¤ ¤Þ-asciiŽŽ‘9ÐóÝF‘ÿeorce›¦fOcta•²!v“e˜to˜assume˜the˜ le˜is˜in˜Octa“v“e's˜text˜format.Ž¡Þ-binaryŽŽ‘9ÐóÝF‘ÿeorce›¦fOcta•²!v“e˜to˜assume˜the˜ le˜is˜in˜Octa“v“e's˜binary˜format.ŽŽŸŒ‹y"ŸòÝChapter–¦f20:‘ÝÝInput“and“Output’1+’121ŽŽŽ ƒ3Ú ý¨ðÐÞ-mat-binaryŽ¤‘9ÐóÝF‘ÿeorce›¦fOcta•²!v“e˜to˜assume˜the˜ le˜is˜in˜ãMa‘ÿEtlabÝ's˜binary˜format.ŽŸ ”ëE20.2‘™C-StŒÌyle–¦MI/O“F‘þ¦functionsŽŽŸ%‘ÝThe–-C-stš²!yle“input“and“output“functions“pro˜vide“most“of“the“functionalit˜y“of“the“C‘,òprogrammingŽ¡language's–\jstandard“I/O‘\These“sligh˜tly“alter“the“ordinary“bMÞeha˜vior“of“theŽ¡con•²!v“ersion.‘&ÍF‘ÿeor–¾¶example,‘Émost“con•²!v“ersion–¾¶spšMÞeci cations“p˜ermit“y²!ou“to“sp˜ecify“a“minim²!um“ eldŽ¡width–¦fand“a“ ag“indicating“whether“yš²!ou“w˜an˜t“the“result“left-“or“righ˜t-justi ed“within“the“ eld.Ž¦‘The–ÏspšMÞeci c“ ags“and“mo˜di ers“that“are“p˜ermitted“and“their“in²!terpretation“v‘ÿdDary“dep˜ending“onŽ¡the–¦fparticular“con•²!v“ersion.‘ÝÝThey're–¦fall“describMÞed“in“more“detail“in“the“follo²!wing“sections.ŽŸ#ÏÖëM20.2.3‘d(Output›¦MCon•–áv“ersion˜Syn“taxŽŽŸEG‘ÝThis–€4section“proš²!vides“details“abMÞout“the“precise“syn˜tax“of“con˜v˜ersion“spšMÞeci cations“that“can“app˜earŽ¡in–¦fa“Þprintf“Ýtemplate“string.Ž¦‘Characters–Jin“the“template“string“that“are“not“part“of“a“con•²!v“ersion–JspMÞeci cation“are“prin²!ted“as-isŽ¡to–¦fthe“output“stream.Ž¦‘The›¦fcon•²!v“ersion˜spMÞeci cations˜in˜a˜Þprintf˜Ýtemplate˜string˜ha“v“e˜the˜general˜form:ŽŸEG‘èUÞ%–¿ªá ags‘3,width“Ý[“Þ.“áprecision“Ý]“át•²!ypMÞe‘\±con“v“ersionŽ¦‘ÝF‘ÿeor–ã(example,› 4in“the“con•²!v“ersion–ã(spMÞeci er“`Þ%-10.8ldÝ',˜the“`Þ-Ý'“is“a“ ag,˜`Þ10Ý'“spMÞeci es“the“ eld“width,Ž¡the–dßprecision“is“`Þ8Ý',‘”}the“letter“`ÞlÝ'“is“a“t²!ypšMÞe“mo˜di er,‘”}and“`ÞdÝ'“sp˜eci es“the“con•²!v“ersion‘dßst“yle.‘G(ThisŽ¡particular–rÔt²!ypšMÞe“sp˜eci er“saš²!ys“to“prin˜t“a“n˜umeric“argumen˜t“in“decimal“notation,‘}%with“a“minim˜um“ofŽ¡8–¦fdigits“left-justi ed“in“a“ eld“at“least“10“c²!haracters“wide.)Ž¦‘In–¹Vmore“detail,‘þoutput“con•²!v“ersion–¹VspMÞeci cations“consist“of“an“initial“`Þ%Ý'“cš²!haracter“follo˜w˜ed“inŽ¡sequence‘¦fb²!y:Ž¦‘ú‘厑®dÝZero–a°or“more“á ag“c²!haracters‘Õ2Ýthat“mošMÞdify“the“normal“b˜ehaš²!vior“of“the“con˜v˜ersion“spMÞeci cation.Ž©EG‘ú‘厑®dÝAn–Ú¡optional“decimal“inš²!teger“spMÞecifying“the“áminim˜um“ eld“widthÝ.‘zIf“the“normal“con˜v˜ersionŽ¡‘®dproMÞduces–£fewš²!er“c˜haracters“than“this,‘âÅthe“ eld“is“padded“with“spaces“to“the“spMÞeci ed“width.Ž¡‘®dThis–€…is“a“áminimš²!um“Ýv‘ÿdDalue;‘í”if“the“normal“con˜v˜ersion“proMÞduces“more“c˜haracters“than“this,‘· theŽ¡‘®d eld–¦fis“ánot‘ãfÝtruncated.‘ÝÝNormally‘ÿe,“the“output“is“righ²!t-justi ed“within“the“ eld.Ž¦‘®dY‘ÿeou–çcan“also“spMÞecify“a“ eld“width“of“`Þ*Ý'.‘ÛThis“means“that“the“next“argumenš²!t“in“the“argumen˜tŽ¡‘®dlist–­z(bšMÞefore“the“actual“v‘ÿdDalue“to“b˜e“prin²!ted)“is“used“as“the“ eld“width.‘óThe“v‘ÿdDalue“is“rounded“toŽ¡‘®dthe–þ$nearest“inš²!teger.‘åIf“the“v‘ÿdDalue“is“negativ˜e,‘this“means“to“set“the“`Þ-Ý'“ ag“(see“bMÞelo˜w)“and“toŽ¡‘®duse–¦fthe“absolute“v‘ÿdDalue“as“the“ eld“width.Ž¦‘ú‘厑®dÝAn–ýÈoptional“áprecision“Ýto“spšMÞecify“the“n•²!um“b˜er–ýÈof“digits“to“b˜e“written“for“the“nš²!umeric“con˜v˜ersions.Ž¡‘®dIf–.»the“precision“is“spšMÞeci ed,‘Fªit“consists“of“a“p˜erio˜d“(`Þ.Ý')“follo•²!w“ed–.»optionally“bš²!y“a“decimal“in˜tegerŽ¡‘®d(whic²!h–¦fdefaults“to“zero“if“omitted).ŽŽŸŒ‹|9àŸòÝ124’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБ®dY‘ÿeou– €can“also“spMÞecify“a“precision“of“`Þ*Ý'.‘ªThis“means“that“the“next“argumenš²!t“in“the“argumen˜t“listŽ¤‘®d(bšMÞefore–8the“actual“v‘ÿdDalue“to“b˜e“prinš²!ted)“is“used“as“the“precision.‘ÕxThe“v‘ÿdDalue“m˜ust“bMÞe“an“in˜teger,Ž¡‘®dand–¦fis“ignored“if“it“is“negativ²!e.Ž©צ‘ú‘厑®dÝAn–×optional“át²!ypšMÞe“mo˜di er“cš²!haracterÝ.‘/This“c˜haracter“is“ignored“b˜y“Octa˜v˜e's“Þprintf“Ýfunction,Ž¡‘®dbut–¦fis“recognized“to“proš²!vide“compatibilit˜y“with“the“C“language“ÞprintfÝ.Ž¦‘ú‘厑®dÝA–¦fcš²!haracter“that“spMÞeci es“the“con˜v˜ersion“to“bMÞe“applied.Ž©צ‘The–ê)exact“options“that“are“pMÞermitted“and“hoš²!w“they“are“in˜terpreted“v‘ÿdDary“bMÞet˜w˜een“the“di eren˜tŽ¡con•²!v“ersion–ë[spšMÞeci ers.‘¬½See“the“descriptions“of“the“individual“con•²!v“ersions–ë[for“information“ab˜out“theŽ¡particular–¦foptions“that“they“use.ŽŸ¯LëM20.2.4‘d(T‘þÄ£able–¦Mof“Output“Con•–áv“ersionsŽŽŸ‘ÝHere–¦fis“a“table“summarizing“what“all“the“di erenš²!t“con˜v˜ersions“do:Ž¦`Þ%dÝ',‘¦f`Þ%iÝ'ŽŽ‘9ÐóPrinš²!t–Žzan“in˜teger“as“a“signed“decimal“n˜um˜bMÞer.‘ÕäSee“Section“20.2.5“[In˜teger“Con˜v˜ersions],Ž¡‘9Ðópage–¼2125,›Á¥for“details.‘A`Þ%dÝ'“and“`Þ%iÝ'“are“synon²!ymous“for“output,˜but“are“di eren²!t“whenŽ¡‘9Ðóused–7Ìwith“Þscanf“Ýfor“input“(see“Section“20.2.10“[T‘ÿeable“of“Input“Con•²!v“ersions],‘Mëpage‘7Ì128).Ž©¯L`Þ%oÝ'ŽŽ‘9ÐóPrinš²!t–­an“in˜teger“as“an“unsigned“oMÞctal“n˜um˜bMÞer.‘®õSee“Section“20.2.5“[In˜teger“Con˜v˜ersions],Ž¡‘9Ðópage–¦f125,“for“details.Ž¦`Þ%uÝ'ŽŽ‘9ÐóPrinš²!t–¿an“in˜teger“as“an“unsigned“decimal“n˜um˜bMÞer.‘:çSee“Section“20.2.5“[In˜teger“Con˜v˜er-Ž¡‘9Ðósions],–¦fpage“125,“for“details.Ž¦`Þ%xÝ',‘¦f`Þ%XÝ'ŽŽ‘9ÐóPrinš²!t–êêan“in˜teger“as“an“unsigned“hexadecimal“n˜um˜bMÞer.‘«i`Þ%xÝ'“uses“lo˜w˜er-case“letters“andŽ¡‘9Ðó`Þ%XÝ'–¦fuses“uppMÞer-case.‘ÝÝSee“Section“20.2.5“[Inš²!teger“Con˜v˜ersions],“page“125,“for“details.Ž¦`Þ%fÝ'ŽŽ‘9ÐóPrinš²!t–<a“ oating-pMÞoin˜t“n˜um˜bšMÞer“in“normal“( xed-p˜oin²!t)“notation.‘ žáSee“Section“20.2.6Ž¡‘9Ðó[Floating-P•²!oin“t›¦fCon“v“ersions],˜page˜125,˜for˜details.Ž¦`Þ%eÝ',‘¦f`Þ%EÝ'ŽŽ‘9ÐóPrinš²!t–•öa“ oating-pMÞoin˜t“n˜um˜bšMÞer“in“exp˜onenš²!tial“notation.‘Øb`Þ%eÝ'“uses“lo˜w˜er-case“letters“andŽ¡‘9Ðó`Þ%EÝ'–ÒÅuses“uppMÞer-case.‘búSee“Section“20.2.6“[Floating-P•²!oin“t›ÒÅCon“v“ersions],–Üpage˜125,“forŽ¡‘9Ðódetails.Ž¦`Þ%gÝ',‘¦f`Þ%GÝ'ŽŽ‘9ÐóPrinš²!t–aga“ oating-pMÞoin˜t“n˜um˜bšMÞer“in“either“normal“or“exp˜onenš²!tial“notation,‘'whic˜hev˜er“isŽ¡‘9Ðómore–:tappropriate“for“its“magnitude.‘š`Þ%gÝ'“uses“lo•²!w“er-case–:tletters“and“`Þ%GÝ'“uses“uppMÞer-Ž¡‘9Ðócase.‘ÝÝSee–¦fSection“20.2.6“[Floating-P•²!oin“t›¦fCon“v“ersions],˜page˜125,˜for˜details.Ž¦`Þ%cÝ'ŽŽ‘9ÐóPrinš²!t–¦fa“single“c˜haracter.‘ÝÝSee“Section“20.2.7“[Other“Output“Con˜v˜ersions],“page“126.Ž¦`Þ%sÝ'ŽŽ‘9ÐóPrinš²!t–¦fa“string.‘ÝÝSee“Section“20.2.7“[Other“Output“Con˜v˜ersions],“page“126.Ž¦`Þ%%Ý'ŽŽ‘9ÐóPrinš²!t–¦fa“literal“`Þ%Ý'“c˜haracter.‘ÝÝSee“Section“20.2.7“[Other“Output“Con˜v˜ersions],“page“126.ŽŸצ‘If–´Ïthe“synš²!tax“of“a“con˜v˜ersion“spMÞeci cation“is“in˜v‘ÿdDalid,›¸iunpredictable“things“will“happMÞen,˜so“don'tŽ¡do–Fthis.‘ÐÓIf“there“aren't“enough“function“argumenš²!ts“pro˜vided“to“supply“v‘ÿdDalues“for“all“the“con˜v˜ersionŽ¡spMÞeci cations– ‰in“the“template“string,‘+Oor“if“the“argumenš²!ts“are“not“of“the“correct“t˜ypMÞes,‘+Othe“results“areŽŽŸŒ‹}H*ŸòÝChapter–¦f20:‘ÝÝInput“and“Output’1+’125ŽŽŽ ƒ3Ú ý¨ðÐunpredictable.‘¶SIf–Cãyš²!ou“supply“more“argumen˜ts“than“con˜v˜ersion“spMÞeci cations,‘kBthe“extra“argumen˜tŽ¤v‘ÿdDalues–¦fare“simply“ignored;“this“is“sometimes“useful.ŽŸaæëM20.2.5‘d(In•–áteger‘¦MCon“v“ersionsŽŽŸu÷‘ÝThis–Ù section“describšMÞes“the“options“for“the“`Þ%dÝ',–åÏ`Þ%iÝ',“`Þ%oÝ',“`Þ%uÝ',“`Þ%xÝ',“and–Ù `Þ%XÝ'“con•²!v“ersion‘Ù sp˜eci -Ž¡cations.‘ÝÝThese›¦fcon•²!v“ersions˜prin“t˜in“tegers˜in˜v‘ÿdDarious˜formats.Ž©u÷‘The–o@`Þ%dÝ'“and“`Þ%iÝ'“con•²!v“ersion–o@spšMÞeci cations“b˜oth“prinš²!t“an“n˜umeric“argumen˜t“as“a“signed“decimalŽ¡n•²!um“bMÞer;‘Iwhile›#`Þ%oÝ',–6ý`Þ%uÝ',“and˜`Þ%xÝ'˜prin•²!t˜the˜argumen“t˜as˜an˜unsigned˜oMÞctal,–6ýdecimal,“or˜hexadecimalŽ¡n•²!um“b•MÞer›­¯(resp“ectiv•²!ely).‘ó·The˜`Þ%XÝ'˜con“v“ersion˜spMÞeci cation˜is˜just˜lik“e˜`Þ%xÝ'˜except˜that˜it˜uses˜theŽ¡c²!haracters–¦f`ÞABCDEFÝ'“as“digits“instead“of“`ÞabcdefÝ'.Ž¦‘The–¦ffollo²!wing“ ags“are“meaningful:ŽŸëî`Þ-Ý'ŽŽ‘9ÐóLeft-justify–¦fthe“result“in“the“ eld“(instead“of“the“normal“righ²!t-justi cation).Ž¤ëî`Þ+Ý'ŽŽ‘9ÐóF‘ÿeor–¦fthe“signed“`Þ%dÝ'“and“`Þ%iÝ'“con•²!v“ersions,›¦fprin“t˜a˜plus˜sign˜if˜the˜v‘ÿdDalue˜is˜pMÞositiv“e.Ž¡`‘¦f'ŽŽ‘9ÐóF‘ÿeor–0µthe“signed“`Þ%dÝ'“and“`Þ%iÝ'“con•²!v“ersions,‘H?if–0µthe“result“doMÞesn't“start“with“a“plus“or“min²!usŽ¤‘9Ðósign,‘¥(pre x–¤Ùit“with“a“space“c²!haracter“instead.‘ÝYSince“the“`Þ+Ý'“ ag“ensures“that“the“resultŽ¡‘9Ðóincludes–¦fa“sign,“this“ ag“is“ignored“if“y²!ou“supply“bMÞoth“of“them.Ž©ëî`Þ#Ý'ŽŽ‘9ÐóF‘ÿeor–<the“`Þ%oÝ'“con•²!v“ersion,›a‚this–<forces“the“leading“digit“to“bMÞe“`Þ0Ý',˜as“if“b²!y“increasing“theŽ¡‘9Ðóprecision.‘›šF‘ÿeor–ßž`Þ%xÝ'“or“`Þ%XÝ',‘_this“pre xes“a“leading“`Þ0xÝ'“or“`Þ0XÝ'“(respMÞectiv²!ely)“to“the“result.Ž¡‘9ÐóThis–¦fdoMÞesn't“do“anš²!ything“useful“for“the“`Þ%dÝ',“`Þ%iÝ',“or“`Þ%uÝ'“con˜v˜ersions.Ž¦`Þ0Ý'ŽŽ‘9ÐóPš²!ad–I the“ eld“with“zeros“instead“of“spaces.‘ÅÅThe“zeros“are“placed“after“an˜y“indicationŽ¡‘9Ðóof– #sign“or“base.‘ This“ ag“is“ignored“if“the“`Þ-Ý'“ ag“is“also“spMÞeci ed,‘#or“if“a“precision“isŽ¡‘9ÐóspMÞeci ed.ŽŸëî‘If–`×a“precision“is“supplied,‘nÀit“spMÞeci es“the“minimš²!um“n˜um˜bšMÞer“of“digits“to“app˜ear;‘xleading“zeros“areŽ¡prošMÞduced–×vif“necessary‘ÿe.‘q If“y²!ou“don't“sp˜ecify“a“precision,‘ã¹the“n•²!um“b˜er–×vis“prinš²!ted“with“as“man˜y“digitsŽ¡as–Ç_it“needs.‘@ÉIf“yš²!ou“con˜v˜ert“a“v‘ÿdDalue“of“zero“with“an“explicit“precision“of“zero,‘Ïžthen“no“c˜haracters“atŽ¡all–¦fare“proMÞduced.ŽŸaæëM20.2.6‘d(Floating-P•–áoin“t‘¦MCon“v“ersionsŽŽŸu÷‘ÝThis–’Ãsection“discusses“the“con•²!v“ersion–’ÃspšMÞeci cations“for“ oating-p˜oinš²!t“n˜um˜bMÞers:‘¶—the“`Þ%fÝ',‘ÍÚ`Þ%eÝ',Ž¡`Þ%EÝ',–¦f`Þ%gÝ',“and“`Þ%GÝ'“con•²!v“ersions.Ž©u÷‘The–"ä`Þ%fÝ'“con•²!v“ersion›"äprin“ts˜its˜argumen“t˜in˜ xed-pMÞoin“t˜notation,‘BproMÞducing˜output˜of˜the˜formŽ¡[Þ-Ý]ádddnRÞ.ádddŽ‘6ñRÝ,‘öÃwhere–æ°the“n•²!um“bšMÞer–æ°of“digits“follo²!wing“the“decimal“p˜oinš²!t“is“con˜trolled“b˜y“the“precisionŽ¡y²!ou‘¦fspMÞecify‘ÿe.Ž¦‘The–Ü^`Þ%eÝ'“con•²!v“ersion›Ü^prin“ts˜its˜argumen“t˜in˜expMÞonen“tial˜notation,‘éÜproMÞducing˜output˜of˜the˜formŽ¡[Þ-Ý]ád•nRÞ.áddd“ÞeÝ[Þ+|-Ý]áddŽ‘Ts¢Ý.‘ÞAgain,‘æzthe›¦vn•²!um“bMÞer˜of˜digits˜follo“wing˜the˜decimal˜pMÞoin“t˜is˜con“trolled˜b“y˜theŽŽŸŒ‹~U÷ŸòÝ126’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐprecision.‘טThe–“˜expMÞonenš²!t“alw˜a˜ys“con˜tains“at“least“t˜w˜o“digits.‘טThe“`Þ%EÝ'“con˜v˜ersion“is“similar“but“theŽ¤expMÞonenš²!t–¦fis“mark˜ed“with“the“letter“`ÞEÝ'“instead“of“`ÞeÝ'.Ž©—÷‘The–v²`Þ%gÝ'“and“`Þ%GÝ'“con•²!v“ersions›v²prin“t˜the˜argumen“t˜in˜the˜st“yle˜of˜`Þ%eÝ'˜or˜`Þ%EÝ'˜(respMÞectiv“ely)˜if˜theŽ¡expMÞonen•²!t›<Éw“ould˜bMÞe˜less˜than˜-4˜or˜greater˜than˜or˜equal˜to˜the˜precision;‘‡ûotherwise˜they˜use˜theŽ¡`Þ%fÝ'–ŒQstš²!yle.‘Õ+T‘ÿerailing“zeros“are“remo˜v˜ed“from“the“fractional“pšMÞortion“of“the“result“and“a“decimal-p˜oin²!tŽ¡cš²!haracter–¦fappMÞears“only“if“it“is“follo˜w˜ed“b˜y“a“digit.Ž¦‘The–¦ffollo²!wing“ ags“can“bšMÞe“used“to“mo˜dify“the“b˜eha²!vior:ŽŸ/î`Þ-Ý'ŽŽ‘9ÐóLeft-justify–¦fthe“result“in“the“ eld.‘ÝÝNormally“the“result“is“righ²!t-justi ed.Ž¤/î`Þ+Ý'ŽŽ‘9ÐóAlw•²!a“ys–¦finclude“a“plus“or“min²!us“sign“in“the“result.Ž¡`‘¦f'ŽŽ‘9ÐóIf–Øethe“result“doMÞesn't“start“with“a“plus“or“min²!us“sign,‘™pre x“it“with“a“space“instead.‘™2SinceŽ¤‘9Ðóthe–Š`Þ+Ý'“ ag“ensures“that“the“result“includes“a“sign,‘Ãthis“ ag“is“ignored“if“y²!ou“supplyŽ¡‘9ÐóbMÞoth–¦fof“them.Ž©/î`Þ#Ý'ŽŽ‘9ÐóSpšMÞeci es–…Æthat“the“result“should“alw•²!a“ys–…Æinclude“a“decimal“p˜oin•²!t,‘ŒLev“en–…Æif“no“digits“follo²!wŽ¡‘9Ðóit.‘1GF‘ÿeor–lßthe“`Þ%gÝ'“and“`Þ%GÝ'“con•²!v“ersions,‘ž}this–lßalso“forces“trailing“zeros“after“the“decimalŽ¡‘9ÐópšMÞoin²!t–¦fto“b˜e“left“in“place“where“they“w²!ould“otherwise“b˜e“remo•²!v“ed.Ž¦`Þ0Ý'ŽŽ‘9ÐóPš²!ad–9{the“ eld“with“zeros“instead“of“spaces;‘]Éthe“zeros“are“placed“after“an˜y“sign.‘¹This“ agŽ¡‘9Ðóis–¦fignored“if“the“`Þ-Ý'“ ag“is“also“spMÞeci ed.ŽŸ/î‘The–žprecision“spMÞeci es“hoš²!w“man˜y“digits“follo˜w“the“decimal-pMÞoin˜t“c˜haracter“for“the“`Þ%fÝ',–9Æ`Þ%eÝ',“andŽ¡`Þ%EÝ'›#Ëcon•²!v“ersions.‘V F‘ÿeor˜these˜con“v“ersions,‘C$the˜default˜precision˜is˜Þ6Ý.‘V If˜the˜precision˜is˜explicitly˜Þ0Ý,Ž¡this–suppresses“the“decimal“pMÞoinš²!t“c˜haracter“en˜tirely–ÿe.‘°hF“or–the“`Þ%gÝ'“and“`Þ%GÝ'“con˜v˜ersions,‘9Nthe“precisionŽ¡spMÞeci es–Thoš²!w“man˜y“signi can˜t“digits“to“prin˜t.‘§,Signi can˜t“digits“are“the“ rst“digit“bMÞefore“the“decimalŽ¡pšMÞoin²!t,‘çand–óšall“the“digits“after“it.‘ÅyIf“the“precision“is“Þ0“Ýor“not“sp˜eci ed“for“`Þ%gÝ'“or“`Þ%GÝ',‘çit“is“treatedŽ¡lik²!e–ØÍa“v›ÿdDalue“of“Þ1Ý.‘uIf“the“v˜alue“bšMÞeing“prin²!ted“cannot“b˜e“expressed“precisely“in“the“sp˜eci ed“n•²!um“b˜erŽ¡of–¦fdigits,“the“v‘ÿdDalue“is“rounded“to“the“nearest“n•²!um“bMÞer–¦fthat“ ts.ŽŸÇäëM20.2.7‘d(Other–¦MOutput“Con•–áv“ersionsŽŽŸ—÷‘ÝThis–¦fsection“describMÞes“miscellaneous“con•²!v“ersions–¦ffor“ÞprintfÝ.Ž©—÷‘The–@`Þ%cÝ'“con•²!v“ersion›@prin“ts˜a˜single˜c“haracter.‘§&The˜`Þ-Ý'˜ ag˜can˜b•MÞe˜used˜to˜sp“ecify˜left-justi cationŽ¡in–s the“ eld,›¦Nbut“no“other“ ags“are“de ned,˜and“no“precision“or“t²!ypšMÞe“mo˜di er“can“b˜e“giv²!en.‘D F‘ÿeorŽ¡example:ŽŸ—÷‘èUÞprintf–¿ª("%c%c%c%c%c",“"h",“"e",“"l",“"l",“"o");Ž¦Ýprin²!ts‘¦f`ÞhelloÝ'.Ž¦‘The–šŸ`Þ%sÝ'“con•²!v“ersion›šŸprin“ts˜a˜string.‘ÙðThe˜correspMÞonding˜argumen“t˜m“ust˜bMÞe˜a˜string.‘ÙðA‘šœprecisionŽ¡can–!^bšMÞe“sp˜eci ed“to“indicate“the“maximš²!um“n˜um˜bMÞer“of“c˜haracters“to“write;‘^Úotherwise“c˜haracters“inŽ¡the–^Ùstring“up“to“but“not“including“the“terminating“nš²!ull“c˜haracter“are“written“to“the“output“stream.ŽŽŸŒ‹c^ŸòÝChapter–¦f20:‘ÝÝInput“and“Output’1+’127ŽŽŽ ƒ3Ú ý¨ðÐThe–G`Þ-Ý'“ ag“can“bšMÞe“used“to“sp˜ecify“left-justi cation“in“the“ eld,‘Zbut“no“other“ ags“or“t²!yp˜e“mo˜di ersŽ¤are–¦fde ned“for“this“con•²!v“ersion.‘ÝÝF‘ÿeor‘¦fexample:ŽŸIÞ‘èUÞprintf–¿ª("%3s%-6s",“"no",“"where");ŽŸIÞÝprin²!ts–¦f`“Þnowhere“Ý'.ŽŸÝ™ëM20.2.8‘d(F‘þÄ£ormatted‘¦MInputŽŽŸIÞ‘ÝHere–¦fare“the“descriptions“of“the“functions“for“pMÞerforming“formatted“input.ŽŸ“¼Þscanf‘¦f(átemplate‘Þ)Ž¡‘9ÐóÝThe–fnÞscanf“Ýfunction“reads“formatted“input“from“the“stream“Þstdin“Ýunder“the“con²!trol“ofŽ¡‘9Ðóthe–¦ftemplate“string“átemplateÝ.‘ÝÝThe“resulting“v‘ÿdDalues“are“returned.Ž©“¼Þfscanf–¦f(á leÞ,“átemplate‘Þ)Ž¡‘9ÐóÝThis–ïÕfunction“is“just“lik²!e“ÞscanfÝ,‘B1except“that“the“input“is“read“from“the“stream“á leŽ¡‘9ÐóÝinstead–¦fof“ÞstdinÝ.Ž¦Þsscanf–¦f(ástringÞ,“átemplate‘Þ)Ž¡‘9ÐóÝThis–»çis“likš²!e“ÞscanfÝ,‘ÁHexcept“that“the“c˜haracters“are“tak˜en“from“the“string“ástring‘«ÿÝinsteadŽ¡‘9Ðóof–™ufrom“a“stream.‘ÙReac²!hing“the“end“of“the“string“is“treated“as“an“end-of- le“condition.ŽŸ“¼‘Calls–ÁÖto“Þscanf“Ýare“supMÞer cially“similar“to“calls“to“Þprintf“Ýin“that“arbitrary“argumen²!ts“are“readŽ¡under–‹ithe“conš²!trol“of“a“template“string.‘ŒçWhile“the“syn˜tax“of“the“con˜v˜ersion“spMÞeci cations“in“theŽ¡template–©Fis“vš²!ery“similar“to“that“for“ÞprintfÝ,‘éýthe“in˜terpretation“of“the“template“is“orien˜ted“moreŽ¡to•²!w“ards–¾µfree-format“input“and“simple“pattern“matc²!hing,‘Érather“than“ xed- eld“formatting.‘&ËF‘ÿeorŽ¡example,‘7Pmost–UÞscanf“Ýcon•²!v“ersions–Uskip“o•²!v“er›Uan“y˜amoun“t˜of˜\white˜space"˜(including˜spaces,‘7Ptabs,Ž¡and–¹Œnewlines)“in“the“input“ le,‘èëand“there“is“no“concept“of“precision“for“the“nš²!umeric“input“con˜v˜ersionsŽ¡as–¼Ëthere“is“for“the“correspMÞonding“output“con•²!v“ersions.‘! Ordinarily‘ÿe,‘Âdnon-whitespace›¼Ëc“haracters˜in˜theŽ¡template–¦fare“expMÞected“to“matcš²!h“c˜haracters“in“the“input“stream“exactly‘ÿe.Ž©IÞ‘When– ©a“ámatc²!hing“failure‘¦°ÝoMÞccurs,›byÞscanf“Ýreturns“immediately‘ÿe,˜leaš²!ving“the“ rst“non-matc˜hingŽ¡cš²!haracter–ýas“the“next“c˜haracter“to“bMÞe“read“from“the“stream,‘»and“Þscanf“Ýreturns“all“the“items“thatŽ¡wš²!ere–¦fsuccessfully“con˜v˜erted.Ž¦‘The–ˆformatted“input“functions“are“not“used“as“frequen²!tly“as“the“formatted“output“functions.Ž¡Pš²!artly‘ÿe,‘[Üthis–I9is“bMÞecause“it“tak˜es“some“care“to“use“them“propMÞerly‘ÿe.‘¾ÎAnother“reason“is“that“it“is“dicultŽ¡to›¦freco•²!v“er˜from˜a˜matc“hing˜error.ŽŸÝ™ëM20.2.9‘d(Input›¦MCon•–áv“ersion˜Syn“taxŽŽŸIÞ‘ÝA‘²±Þscanf–²öÝtemplate“string“is“a“string“that“conš²!tains“ordinary“m˜ultib˜yte“c˜haracters“in˜terspMÞersedŽ¡with›¦fcon•²!v“ersion˜spMÞeci cations˜that˜start˜with˜`Þ%Ý'.Ž¦‘Anš²!y–Q›whitespace“c˜haracter“in“the“template“causes“an˜y“n˜um˜bMÞer“of“whitespace“c˜haracters“in“theŽ¡input–ôBstream“to“bMÞe“read“and“discarded.‘ÇrThe“whitespace“cš²!haracters“that“are“matc˜hed“need“not“bMÞeŽŽŸŒ‹€pñŸòÝ128’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐexactly–žthe“same“whitespace“c²!haracters“that“appMÞear“in“the“template“string.‘ÛF‘ÿeor“example,‘ŸÀwrite“`‘¦fÞ,Ž¤Ý'–¦fin“the“template“to“recognize“a“comma“with“optional“whitespace“bMÞefore“and“after.Ž©¯<‘Other–Îcš²!haracters“in“the“template“string“that“are“not“part“of“con˜v˜ersion“spMÞeci cations“m˜ust“matc˜hŽ¡cš²!haracters–¦fin“the“input“stream“exactly;“if“this“is“not“the“case,“a“matc˜hing“failure“oMÞccurs.Ž¦‘The›¦fcon•²!v“ersion˜spMÞeci cations˜in˜a˜Þscanf˜Ýtemplate˜string˜ha“v“e˜the˜general˜form:ŽŸ¯<‘èUÞ%–¿ªá ags‘3,width“t•²!ypMÞe‘\±con“v“ersionŽ¦‘ÝIn– more“detail,‘&³an“input“con•²!v“ersion– spMÞeci cation“consists“of“an“initial“`Þ%Ý'“cš²!haracter“follo˜w˜ed“inŽ¡sequence‘¦fb²!y:Ž¦‘ú‘厑®dÝAn–¢¼optional“á ag“c•²!haracter‘kåÝ`Þ*Ý',‘£wwhic“h›¢¼sa“ys˜to˜ignore˜the˜text˜read˜for˜this˜spMÞeci cation.‘ܤWhenŽ¡‘®dÞscanf–mSÝ nds“a“con•²!v“ersion–mSspMÞeci cation“that“uses“this“ ag,‘x½it“reads“input“as“directed“b²!y“the“restŽ¡‘®dof–¶the“con•²!v“ersion–¶spMÞeci cation,›.¦but“it“discards“this“input,˜došMÞes“not“use“a“p˜oinš²!ter“argumen˜t,‘.¦andŽ¡‘®ddoMÞes–¦fnot“incremenš²!t“the“coun˜t“of“successful“assignmen˜ts.Ž©¯<‘ú‘厑®dÝAn–Ž1optional“decimal“inš²!teger“that“spMÞeci es“the“ámaxim˜um“ eld“widthÝ.‘€vReading“of“c˜haracters“fromŽ¡‘®dthe–Õíinput“stream“stops“either“when“this“maximš²!um“is“reac˜hed“or“when“a“non-matc˜hing“c˜haracterŽ¡‘®dis›ÃÚfound,‘ñ)whic•²!hev“er˜happMÞens˜ rst.‘’YMost˜con“v“ersions˜discard˜initial˜whitespace˜c“haracters˜(thoseŽ¡‘®dthat–Vdon't“are“explicitly“doMÞcumenš²!ted),‘fand“these“discarded“c˜haracters“don't“coun˜t“to˜w˜ards“theŽ¡‘®dmaxim²!um–¦f eld“width.Ž¦‘ú‘厑®dÝAn–põoptional“t²!ypšMÞe“mo˜di er“cš²!haracter.‘=ŠThis“c˜haracter“is“ignored“b˜y“Octa˜v˜e's“Þscanf“Ýfunction,Ž¡‘®dbut–¦fis“recognized“to“proš²!vide“compatibilit˜y“with“the“C“language“ÞscanfÝ.Ž¦‘ú‘厑®dÝA–¦fcš²!haracter“that“spMÞeci es“the“con˜v˜ersion“to“bMÞe“applied.Ž©^x‘The–ê)exact“options“that“are“pMÞermitted“and“hoš²!w“they“are“in˜terpreted“v‘ÿdDary“bMÞet˜w˜een“the“di eren˜tŽ¡con•²!v“ersion–ë[spšMÞeci ers.‘¬½See“the“descriptions“of“the“individual“con•²!v“ersions–ë[for“information“ab˜out“theŽ¡particular–¦foptions“that“they“allo²!w.ŽŸ µëM20.2.10‘d(T‘þÄ£able–¦Mof“Input“Con•–áv“ersionsŽŽŸ¯<‘ÝHere–¦fis“a“table“that“summarizes“the“v‘ÿdDarious“con•²!v“ersion‘¦fspMÞeci cations:Ž¦`Þ%dÝ'ŽŽ‘9ÐóMatcš²!hes–}×an“optionally“signed“in˜teger“written“in“decimal.‘ÐXSee“Section“20.2.11“[NumericŽ¡‘9ÐóInput›¦fCon•²!v“ersions],˜page˜129.Ž©^x`Þ%iÝ'ŽŽ‘9ÐóMatcš²!hes–T¾an“optionally“signed“in˜teger“in“an˜y“of“the“formats“that“the“C‘Tªlanguage“de nesŽ¡‘9Ðófor–iÕspMÞecifying“an“inš²!teger“constan˜t.‘()See“Section“20.2.11“[Numeric“Input“Con˜v˜ersions],Ž¡‘9Ðópage‘¦f129.Ž¦`Þ%oÝ'ŽŽ‘9ÐóMatcš²!hes–÷Ran“unsigned“in˜teger“written“in“oMÞctal“radix.‘£See“Section“20.2.11“[Numeric“InputŽ¡‘9ÐóCon•²!v“ersions],–¦fpage“129.Ž¦`Þ%uÝ'ŽŽ‘9ÐóMatcš²!hes–]1an“unsigned“in˜teger“written“in“decimal“radix.‘?See“Section“20.2.11“[NumericŽ¡‘9ÐóInput›¦fCon•²!v“ersions],˜page˜129.ŽŽŸŒ‹}ŸòÝChapter–¦f20:‘ÝÝInput“and“Output’1+’129ŽŽŽ ƒ3Ú ý¨ðÐ`Þ%xÝ',‘¦f`Þ%XÝ'ŽŽ‘9ÐóMatcš²!hes–cÈan“unsigned“in˜teger“written“in“hexadecimal“radix.‘See“Section“20.2.11“[Nu-Ž¤‘9Ðómeric–¦fInput“Con•²!v“ersions],–¦fpage“129.Ž©S"`Þ%eÝ',–¦f`Þ%fÝ',“`Þ%gÝ',“`Þ%EÝ',“`Þ%GÝ'Ž¡‘9ÐóMatcš²!hes–F an“optionally“signed“ oating-pMÞoin˜t“n˜um˜bMÞer.‘ ¼ÒSee“Section“20.2.11“[NumericŽ¡‘9ÐóInput›¦fCon•²!v“ersions],˜page˜129.Ž¦`Þ%sÝ'ŽŽ‘9ÐóMatcš²!hes–­a“string“con˜taining“only“non-whitespace“c˜haracters.‘ŠÄSee“Section“20.2.12“[StringŽ¡‘9ÐóInput›¦fCon•²!v“ersions],˜page˜129.Ž¦`Þ%cÝ'ŽŽ‘9ÐóMatcš²!hes–6Ca“string“of“one“or“more“c˜haracters;‘[¤the“n˜um˜bMÞer“of“c˜haracters“read“is“con˜trolledŽ¡‘9Ðóbš²!y– the“maxim˜um“ eld“width“giv˜en“for“the“con˜v˜ersion.‘­See“Section“20.2.12“[String“InputŽ¡‘9ÐóCon•²!v“ersions],–¦fpage“129.Ž¦`Þ%%Ý'ŽŽ‘9ÐóThis–¾matcš²!hes“a“literal“`Þ%Ý'“c˜haracter“in“the“input“stream.‘:æNo“correspMÞonding“argumen˜tŽ¡‘9Ðóis‘¦fused.ŽŸS"‘If–Òthe“synš²!tax“of“a“con˜v˜ersion“spMÞeci cation“is“in˜v‘ÿdDalid,‘1­the“bMÞeha˜vior“is“unde ned.‘,!If“there“aren'tŽ¡enough–HZfunction“argumenš²!ts“pro˜vided“to“supply“addresses“for“all“the“con˜v˜ersion“spMÞeci cations“in“theŽ¡template–aEstrings“that“pMÞerform“assignmenš²!ts,‘ýor“if“the“argumen˜ts“are“not“of“the“correct“t˜ypMÞes,‘ýtheŽ¡bMÞehaš²!vior–¦fis“also“unde ned.‘ÝÝOn“the“other“hand,“extra“argumen˜ts“are“simply“ignored.ŽŸ|´ëM20.2.11‘d(Numeric–¦MInput“Con•–áv“ersionsŽŽŸ)‘‘ÝThis–¦fsection“describMÞes“the“Þscanf“Ýcon•²!v“ersions–¦ffor“reading“n²!umeric“v‘ÿdDalues.Ž¤)‘‘The–¦f`Þ%dÝ'“con•²!v“ersion›¦fmatc“hes˜an˜optionally˜signed˜in“teger˜in˜decimal˜radix.Ž¡‘The–‘¿ªfreportŽ¤¡‘"§ÿnumber– Tmode“nameŽ¡¡‘?fQ0‘¾Rr‘ TstdinŽ¡‘?fQ1‘¾Rw‘ TstdoutŽ¡‘?fQ2‘¾Rw‘ TstderrŽ¡‘?fQ3‘¾Rr‘ TmyfileŽŽŽŸŒ‹…®ŸòÝChapter–¦f21:‘ÝÝSpMÞecial“Matrices’9JŸ133ŽŽŽ ƒ3Ú ý¨ðÐè21‘ ¸QSp‘Š=ecial‘¦MMatricesŽŽŸ!ï;‘ÝOcta•²!v“e›½Ìpro“vides˜a˜n“um“b•MÞer˜of˜functions˜for˜creating˜sp“ecial˜matrix˜forms.‘$In˜nearly˜all˜cases,‘Ã¥itŽ¤is–àÿbšMÞest“to“use“the“built-in“functions“for“this“purp˜ose“than“to“try“to“use“other“tricš²!ks“to“ac˜hiev˜e“theŽ¡same‘¦fe ect.ŽŸ!Œ/ëE21.1‘™Sps3ecial–¦MUtilitŒÌy“MatricesŽŽŸc ‘ÝThe–×function“Þeye“Ýreturns“an“iden•²!tit“y–×matrix.‘oìIf“in•²!v“ok“ed–×with“a“single“scalar“argumen²!t,‘#AÞeyeŽ¡Ýreturns–¬‚a“square“matrix“with“the“dimension“spMÞeci ed.‘ð0If“yš²!ou“supply“t˜w˜o“scalar“argumen˜ts,‘îÞeyeŽ¡Ýtakš²!es–»{them“to“bMÞe“the“n˜um˜bMÞer“of“ro˜ws“and“columns.‘If“giv˜en“a“matrix“or“v˜ector“argumen˜t,‘ÀÞeyeŽ¡Ýreturns–¦fan“iden•²!tit“y–¦fmatrix“with“the“same“dimensions“as“the“givš²!en“argumen˜t.Ž¤c ‘F‘ÿeor‘¦fexample,Ž©c ‘èUÞeye‘¿ª(3)Ž¡Ýcreates–¦fan“iden•²!tit“y–¦fmatrix“with“three“ro²!ws“and“three“columns,Ž¦‘èUÞeye–¿ª(5,“8)Ž¡Ýcreates–¦fan“iden•²!tit“y–¦fmatrix“with“ vš²!e“ro˜ws“and“eigh˜t“columns,“andŽ¦‘èUÞeye–¿ª([13,“21;“34,“55])Ž¡Ýcreates–¦fan“iden•²!tit“y–¦fmatrix“with“t•²!w“o›¦fro“ws˜and˜t“w“o˜columns.Ž¡‘Normally‘ÿe,‘fýÞeye– EÝexpMÞects“anš²!y“scalar“argumen˜ts“y˜ou“pro˜vide“to“bMÞe“real“and“non-negativ˜e.‘ {TheŽ¤v‘ÿdDariables–ËzÞok_to_lose_imaginary_part“Ýand“Þtreat_neg_dim_as_zero“Ýconš²!trol“the“bMÞeha˜vior“of“ÞeyeŽ¡Ýfor–‰0complex“and“negativš²!e“argumen˜ts.›Ô!See“Section“6.2“[User“Preferences],‘page“62.˜Anš²!y“non-in˜tegerŽ¡argumenš²!ts–¦fare“rounded“to“the“nearest“in˜teger“v‘ÿdDalue.Ž©c ‘There– is“an“am•²!biguit“y– when“these“functions“are“called“with“a“single“argumenš²!t.‘ òY‘ÿeou“ma˜y“ha˜v˜eŽ¡in²!tended–Ÿto“create“a“matrix“with“the“same“dimensions“as“another“v‘ÿdDariable,‘Y¬but“ended“up“withŽ¡something–®quite“di erenš²!t,‘°šbMÞecause“the“v‘ÿdDariable“that“y˜ou“used“as“an“argumen˜t“w˜as“a“scalar“insteadŽ¡of–¦fa“matrix.Ž¦‘F‘ÿeor–ßÓexample,‘.-if“yš²!ou“need“to“create“an“iden˜tit˜y“matrix“with“the“same“dimensions“as“anotherŽ¡v‘ÿdDariable–¦fin“y²!our“program,“it“is“bšMÞest“to“use“co˜de“lik²!e“thisŽ¤c ‘èUÞeye–¿ª(rows“(a),“columns“(a))Ž¦Ýinstead–¦fof“justŽ¡‘èUÞeye‘¿ª(a)Ž¦Ýunless–¦fyš²!ou“kno˜w“that“the“v‘ÿdDariable“áa“Ýwill“áalw˜a˜ys‘èÝbMÞe“a“matrix.Ž¦‘The–Âfunctions“ÞonesÝ,–5ÞzerosÝ,“and–ÂÞrand“Ýall“wš²!ork“lik˜e“ÞeyeÝ,‘5except“that“they“ ll“the“resulting“matrixŽŸwith–¦fall“ones,“all“zeros,“or“a“set“of“random“v‘ÿdDalues.Ž¦‘If–¦fyš²!ou“need“to“create“a“matrix“whose“v‘ÿdDalues“are“all“the“same,“y˜ou“should“use“an“expression“lik˜eŽŽŸŒ‹†¯ƒŸòÝ134’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞval_matrix–¿ª=“val“*“ones“(n,“m)Ž¤ïò‘ÝThe–€~Þrand“Ýfunction“also“takš²!es“some“additional“argumen˜ts“that“allo˜w“y˜ou“to“con˜trol“its“bMÞeha˜vior.Ž©F‘ÿeor–¦fexample,“the“function“callŽŸïò‘èUÞrand‘¿ª("normal")Ž¡Ýcauses–Üthe“sequence“of“n•²!um“bšMÞers–Üto“b˜e“normally“distributed.‘~ÀY‘ÿeou“maš²!y“also“use“an“argumen˜t“ofŽ¦Þ"uniform"–HÝto“select“a“uniform“distribution.‘­T‘ÿeo“ nd“out“what“the“curren²!t“distribution“is,‘pguse“anŽ¦argumen²!t–¦fof“Þ"dist"Ý.Ž¡‘Normally‘ÿe,› ÉÞrand–ÿbÝobtains“the“seed“from“the“system“cloMÞc²!k,˜so“that“the“sequence“of“random“n•²!um“bMÞersŽ¦is–Y}not“the“same“eacš²!h“time“y˜ou“run“Octa˜v˜e.‘÷!If“y˜ou“really“do“need“for“to“reproMÞduce“a“sequence“ofŽ¦n•²!um“bšMÞers–¦fexactly‘ÿe,“y²!ou“can“set“the“seed“to“a“sp˜eci c“v‘ÿdDalue.‘ÝÝF‘ÿeor“example,“the“function“callŽŸïò‘èUÞrand–¿ª("seed",“13)Ž¡Ýsets–¦fthe“seed“to“the“n•²!um“bMÞer–¦f13.‘ÝÝT‘ÿeo“see“what“the“currenš²!t“seed“is,“use“the“argumen˜t“Þ"seed"Ý.Ž¡‘If–¦fit“is“in•²!v“ok“ed–¦fwithout“argumenš²!ts,“Þrand“Ýreturns“a“single“elemen˜t“of“a“random“sequence.Ž¡‘The–R,Þrand“Ýfunction“uses“F‘ÿeortran“coMÞde“from“RANLIB,“a“library“of“fortran“routines“for“randomŽ¦n•²!um“bMÞer–Ângeneration,‘ðcompiled“bš²!y“Barry“W.“Bro˜wn“and“James“Lo˜v‘ÿdDato“of“the“Departmen˜t“of“Biomath-Ž¦ematics–¦fat“The“Univ•²!ersit“y–¦fof“T‘ÿeexas,“M.D.“Anderson“Cancer“Cen²!ter,“Houston,“TX“77030.Ž¡‘T‘ÿeo–§:create“a“diagonal“matrix“with“v²!ector“áv‘—RÝon“diagonal“ákÝ,›çnuse“the“function“diag“(ávÝ,˜ák‘ªÝ).‘àXTheŽ¦second–;ùargumenš²!t“is“optional.‘ž—If“it“is“pMÞositiv˜e,‘a^the“v˜ector“is“placed“on“the“ákÝ-th“supMÞer-diagonal.‘ž—IfŽ¦it–Â|is“negativ²!e,›Éit“is“placed“on“the“á-kÝ-th“sub-diagonal.‘2The“default“v‘ÿdDalue“of“ák‘l€Ýis“0,˜and“the“v²!ector“isŽ¦placed–¦fon“the“main“diagonal.‘ÝÝF‘ÿeor“example,ŽŸïò‘èUÞoctave:13>–¿ªdiag“([1,“2,“3],“1)Ž¤ ‘èUans‘¿ª=ŽŸ‘(g©0– T1“0“0Ž¡‘(g©0– T0“2“0Ž¡‘(g©0– T0“0“3Ž¡‘(g©0– T0“0“0Ž¤ïò‘ÝThe–wÜfunctions“Þlinspace“Ýand“Þlogspace“Ýmakš²!e“it“v˜ery“easy“to“create“v˜ectors“with“ev˜enly“orŽ¦logarithmically–¦fspaced“elemen²!ts.‘ÝÝF‘ÿeor“example,ŽŸïò‘èUÞlinspace–¿ª(ábaseÞ,“álimitÞ,“ánÞ)Ž¡Ýcreates–(ˆa“vš²!ector“with“án“Ý(án“Ýgreater“than“2)“linearly“spaced“elemen˜ts“bMÞet˜w˜een“ábase‘ÅÝand“álimitÝ.‘dCTheŽ¦ábase›&GÝand–‰@álimit‘Æ@Ýare“alw•²!a“ys–‰@included“in“the“range.‘†lIf“ábase˜Ýis“greater“than“álimitÝ,‘Á÷the“elemen²!ts“areŽ¦stored–¦fin“decreasing“order.‘ÝÝIf“the“n•²!um“bšMÞer–¦fof“p˜oin²!ts“is“not“sp˜eci ed,“a“v‘ÿdDalue“of“100“is“used.Ž¡‘The–1function“Þlogspace“Ýis“similar“to“Þlinspace“Ýexcept“that“the“v‘ÿdDalues“are“logarithmically“spaced.Ž¡‘If–B³álimit‘³Ýis“equal“to“äd“Ý,‘iÆthe“pšMÞoin²!ts“are“b˜et•²!w“een–B³10Ÿü¾´baseŽ›.ìÝand“äd“Ý,‘iÆánot‘³Ý10Ÿü¾´baseŽ˜Ýand“10Ÿü¾´Ž‘moÝ,‘iÆin“order“to“bMÞeŽ¦compatible–¦fwith“the“correspMÞonding“ãMa‘ÿEtlab“Ýfunction.ŽŽŸŒ‹‡ºŸòÝChapter–¦f21:‘ÝÝSpMÞecial“Matrices’9JŸ135ŽŽŽ ƒ3Ú ý¨ðÐëE21.2‘™F‘þ¦famous‘¦MMatricesŽŽŸ‘ÝThe–¦ffollo²!wing“functions“return“famous“matrix“forms.ŽŸµÞhadamard‘¦f(ák‘ªÞ)Ž¤‘9ÐóÝReturn–¦fthe“Hadamard“matrix“of“order“n“=“2Þ^Ýk.Ž©-jÞhankel–¦f(ácÞ,“ár‘É)Þ)Ž¡‘9ÐóÝReturn–KÇthe“Hankš²!el“matrix“constructed“giv˜en“the“ rst“column“ácÝ,‘uand“(optionally)“theŽ¡‘9Ðólast–Eroš²!w“árÝ.‘¹ÔIf“the“last“elemen˜t“of“ác‘ïÝis“not“the“same“as“the“ rst“elemen˜t“of“árÝ,‘l·the“lastŽ¡‘9Ðóelemenš²!t–e‘of“ác‘•Ýis“used.‘ÈAIf“the“second“argumen˜t“is“omitted,‘rˆthe“last“ro˜w“is“tak˜en“to“bMÞe“theŽ¡‘9Ðósame–¦fas“the“ rst“column.ŽŸµ‘9ÐóA–¦fHankš²!el“matrix“formed“from“an“m-v˜ector“ácÝ,“and“an“n-v˜ector“árÝ,“has“the“elemen˜tsŽŸ‡’•=ŠäH‘ãÁÝ(äi;‘Ó1j‘ vÝ)– §=“Ÿñ©’½ŽŸ÷ß"‘ ]ÙäcŸ¤z´i®+´jgº®1Ž‘jüä;Ž‘9Ói–nìÝ+“äj‘bå“Ý1– §å“ämÝ;ŽŽ¡‘ ]ÙärŸ¤z´i®+´jgº´mŽ‘‡$ä;Ž‘9ÓÝotherwise.ŽŽŽŽŽŸÈÞhilb‘¦f(ánÞ)ŽŽ‘9ÐóÝReturn–ò’the“HilbšMÞert“matrix“of“order“ánÝ.‘ÂaThe“äi;‘¦bj‘“Ýelemen²!t“of“a“Hilb˜ert“matrix“is“de nedŽ¡‘9ÐóasŽ¡’¹gäH‘ãÁÝ(äi;‘Ó1j‘ vÝ)‘ §=Ÿø—ž‘Ve1Ž‘=ÚŸÞȉfe1ª¯Ÿ t(äi–nìÝ+“äj‘bå“Ý1)ŽŽŽŽŽŸ‹×Þinvhilb‘¦f(ánÞ)Ž¡‘9ÐóÝReturn–X¿the“in•²!v“erse–X¿of“a“HilbMÞert“matrix“of“order“ánÝ.›ôèThis“is“exact.˜Compare“with“theŽ¡‘9Ðónš²!umerical–îŠcalculation“of“Þinverse–¦f(hilb“(n))Ý,‘Pwhic˜h–îŠsu ers“from“the“ill-conditioning“ofŽ¡‘9Ðóthe–´VHilbšMÞert“matrix,‘äÀand“the“ nite“precision“of“y²!our“computer's“ oating“p˜oin²!t“arithmetic.Ž¦Þtoeplitz–¦f(ácÞ,“ár‘É)Þ)Ž¡‘9ÐóÝReturn–Óthe“T‘ÿeoMÞeplitz“matrix“constructed“giv²!en“the“ rst“column“ácÝ,‘Þ(and“(optionally)“theŽ¡‘9Ðó rst–roš²!w“árÝ.‘ù³If“the“ rst“elemen˜t“of“ác‘¯Ýis“not“the“same“as“the“ rst“elemen˜t“of“árÝ,‘ªthe“ rstŽ¡‘9Ðóelemenš²!t–IØof“ác‘óÜÝis“used.‘¿If“the“second“argumen˜t“is“omitted,‘\[the“ rst“ro˜w“is“tak˜en“to“bMÞe“theŽ¡‘9Ðósame–¦fas“the“ rst“column.Ž©µ‘9ÐóA–¦fsquare“T‘ÿeoMÞeplitz“matrix“has“the“formŽŸ/TªŸÙ©‚’Ÿò_½2ŽŸ™¦’Ÿò_6Ž¤’Ÿò_6Ž¡’Ÿò_6Ž¡’Ÿò_6Ž¡’Ÿò_6Ž¡’Ÿò_6ŽŸfi’Ÿò_4ŽŽŸà)’¨êÂäcŸ¤z®0ŽŽ’ÃþärŸ¤z®1ŽŽ’âo?ärŸ¤z®2ŽŽ’üN‹ä:–Ó1:“:ŽŽ’ ’rŸ¤z´nŽŽŽ¡’¨êÂäcŸ¤z®1ŽŽ’Ã*ÉäcŸ¤z®0ŽŽ’âo?ärŸ¤z®1ŽŽ’#äcŸ¤z´nº®1ŽŽŽ¡’¨êÂäcŸ¤z®2ŽŽ’Ã*ÉäcŸ¤z®1ŽŽ’≠äcŸ¤z®0ŽŽ’#äcŸ¤z´nº®2ŽŽŽŸᯟø’¬3Ý.Ž¤’¬3.Ž¡’¬3.ŽŽŽŸø’¸T.Ž¤’¸T.Ž¡’¸T.ŽŽŽŽ¡’¨p<äcŸ¤z´nŽŽ’½’ äcŸ¤z´nº®1ŽŽ’ÜðJäcŸ¤z´nº®2ŽŽ’üN‹ä:–Ó1:“:ŽŽ’ ãcŸ¤z®0ŽŽŽ¡ŽŸÙ©‚’*F`½3ŽŸ™¦’*F`7Ž¤’*F`7Ž¡’*F`7Ž¡’*F`7Ž¡’*F`7Ž¡’*F`7ŽŸfi’*F`5ŽŽŽ’2Ä=ä:ŽŸ1k_Þvander‘¦f(ác‘ªÞ)Ž¡‘9ÐóÝReturn–¦fthe“V‘ÿeandermonde“matrix“whose“next“to“last“column“is“ácÝ.Ž¦‘9ÐóA–¦fV‘ÿeandermonde“matrix“has“the“formŽŸ%Ñ0Ÿß©†’±§Œ½2ŽŸ™¦’±§Œ6Ž¤’±§Œ6Ž¡’±§Œ6Ž¡’±§Œ6ŽŸfi’±§Œ4ŽŽŸçq’’º%iäcŸü¾´nŽŸ®A®0ŽŽŽ’ÏG6ä:–Ó1:“:ŽŽ’ç{TcŸü¾®2ŽŸ®A0ŽŽŽ’ü!äcŸ¤z®0ŽŽ’DhÝ1ŽŽ¡’º%iäcŸü¾´nŽŸ®A®1ŽŽŽ’ÏG6ä:–Ó1:“:ŽŽ’ç{TcŸü¾®2ŽŸ®A1ŽŽŽ’ü!äcŸ¤z®1ŽŽ’DhÝ1ŽŽŸÞŸø’½·`.Ž¤’½·`.Ž¡’½·`.ŽŽŽŸø’ê’Å.Ž¤’ê’Å.Ž¡’ê’Å.ŽŽŽŸø’ÿ´’.Ž¤’ÿ´’.Ž¡’ÿ´’.ŽŽŽŸø’{à.Ž¤’{à.Ž¡’{à.ŽŽŽŽ¡’º%iäcŸü¾´nŽŸ®AnŽŽŽ’ÏG6ä:–Ó1:“:ŽŽ’çÎcŸü¾®2ŽŸ®A´nŽŽŽ’ü"›äcŸ¤z´nŽŽ’DhÝ1ŽŽ¡ŽŸß©†’‘3½3ŽŸ™¦’‘37Ž¤’‘37Ž¡’‘37Ž¡’‘37ŽŸfi’‘35ŽŽŽ’!ä:ŽŽŸŒ‹ˆÆŸòÝ136’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹‰ÓuŸòÝChapter–¦f22:‘ÝÝMatrix“Manipulation’#%è137ŽŽŽ ƒ3Ú ý¨ðÐè22‘ ¸QMatrix‘¦MManipulationŽŽŸ"íÔ‘ÝThere–ô1are“a“n•²!um“bMÞer–ô1of“functions“aš²!v‘ÿdDailable“for“c˜hec˜king“to“see“if“the“elemen˜ts“of“a“matrix“meetŽ¤some–¿Ácondition,›Æand“for“rearranging“the“elemen²!ts“of“a“matrix.‘)îF‘ÿeor“example,˜Octa•²!v“e–¿Ácan“easily“tellŽ¡yš²!ou–z˜if“all“the“elemen˜ts“of“a“matrix“are“ nite,‘ƒ[or“are“less“than“some“spMÞeci ed“v‘ÿdDalue.‘ÏCOcta˜v˜e“can“alsoŽ¡rotate–¦fthe“elemenš²!ts,“extract“the“uppMÞer-“or“lo˜w˜er-triangular“parts,“or“sort“the“columns“of“a“matrix.ŽŸ"WÝëE22.1‘™Finding–¦MElemenšŒÌts“and“Chec˜king“ConditionsŽŽŸ•÷‘ÝThe–2}functions“Þany“Ýand“Þall“Ýare“useful“for“determining“whether“anš²!y“or“all“of“the“elemen˜ts“of“aŽ¡matrix–¦fsatisfy“some“condition.Ž¤•÷‘Givš²!en–¦fa“v˜ector,“the“function“Þany“Ýreturns“1“if“an˜y“elemen˜t“of“the“v˜ector“is“nonzero.Ž¡‘F‘ÿeor–<]a“matrix“argumenš²!t,‘Q’Þany“Ýreturns“a“ro˜w“v˜ector“of“ones“and“zeros“with“eac˜h“elemen˜t“indicatingŽŸwhether–“anš²!y“of“the“elemen˜ts“of“the“correspMÞonding“column“of“the“matrix“are“nonzero.‘ÖAF‘ÿeor“example,Ž©•÷‘èUÞoctave:13>–¿ªany“(eye“(2,“4))ŽŸ ‘èUans‘¿ª=ŽŸ‘(g©1– T1“0“0Ž¡‘ÝT‘ÿeo–¦fsee“if“anš²!y“of“the“elemen˜ts“of“a“matrix“are“nonzero,“y˜ou“can“use“a“statemen˜t“lik˜eŽ¦‘èUÞany–¿ª(any“(a))Ž¡‘ÝF‘ÿeor–<]a“matrix“argumenš²!t,‘Q’Þany“Ýreturns“a“ro˜w“v˜ector“of“ones“and“zeros“with“eac˜h“elemen˜t“indicatingŽ©whether–¦fanš²!y“of“the“elemen˜ts“of“the“correspMÞonding“column“of“the“matrix“are“nonzero.Ž¡‘The–6function“Þall“ÝbMÞeha•²!v“es›6lik“e˜the˜function˜ÞanyÝ,‘Ò?except˜that˜it˜returns˜true˜only˜if˜all˜the˜elemen“tsŽ¦of–¦fa“vš²!ector,“or“all“the“elemen˜ts“in“a“column“of“a“matrix,“are“nonzero.Ž¡‘Since–3hthe“comparison“opMÞerators“(see“Section“3.11“[Comparison“Ops],‘V¨page“34)“return“matricesŽ¦of–?Uones“and“zeros,›eit“is“easy“to“test“a“matrix“for“man²!y“things,˜not“just“whether“the“elemen²!ts“areŽ¦nonzero.‘ÝÝF‘ÿeor‘¦fexample,ŽŸ•÷‘èUÞoctave:13>–¿ªall“(all“(rand“(5)“<“0.9))ŽŸ ‘èUans–¿ª=“0Ž¡Ýtests–¦fa“random“5“bš²!y“5“matrix“to“see“if“all“of“it's“elemen˜ts“are“less“than“0.9.Ž¡‘Note–ýœthat“in“conditional“conš²!texts“(lik˜e“the“test“clause“of“Þif“Ýand“Þwhile“Ýstatemen˜ts)“Octa˜v˜e“treatsŽ¦the–¦ftest“as“if“yš²!ou“had“t˜ypMÞed“Þall“(all“(condition))Ý.Ž¡‘The–ä$functions“ÞisinfÝ,–ó”ÞfiniteÝ,“and–ä$Þisnan“Ýreturn“1“if“their“argumen²!ts“are“in nite,–ó” nite,“or‘ä$notŽ¦a‘“ån•²!um“b•MÞer,›—˜resp“ectiv²!ely‘ÿe,˜and–“åreturn“0“otherwise.‘ײF‘ÿeor“matrix“v‘ÿdDalues,˜they“all“wš²!ork“on“an“elemen˜t“b˜yŽ¦elemen²!t–¦fbasis.‘ÝÝF‘ÿeor“example,“ev‘ÿdDaluating“the“expressionŽŸ•÷‘èUÞisinf–¿ª([1,“2;“Inf,“4])Ž¡ÝproMÞduces–¦fthe“matrixŽŽŸŒ‹ŠÓÉŸòÝ138’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞans‘¿ª=ŽŸ‘(g©0‘ T0Ž© ‘(g©1‘ T0ŽŸÁD‘ÝThe–öãfunction“Þfind“Ýreturns“a“vš²!ector“of“indices“of“nonzero“elemen˜ts“of“a“matrix.‘£\T‘ÿeo“obtain“a“singleŽ¤index–wfor“eacš²!h“matrix“elemen˜t,‘€‹Octa˜v˜e“pretends“that“the“columns“of“a“matrix“form“one“long“v˜ectorŽ¡(likš²!e–¦fF‘ÿeortran“arra˜ys“are“stored).‘ÝÝF‘ÿeor“example,ŽŸÁD‘èUÞoctave:13>–¿ªfind“(eye“(2))Ž¦‘èUans‘¿ª=ŽŸ‘(g©1Ž¦‘(g©4ŽŸÁD‘ÝIf›ožt•²!w“o˜outputs˜are˜requested,‘z“Þfind˜Ýreturns˜the˜ro“w˜and˜column˜indices˜of˜nonzero˜elemen“ts˜of˜aŽ¡matrix.‘ÝÝF‘ÿeor‘¦fexample,ŽŸÁD‘èUÞoctave:13>–¿ª[i,“j]“=“find“(eye“(2))Ž¦‘èUi‘¿ª=Ž¤‘(g©1Ž¦‘(g©2Ž¡‘èUj‘¿ª=Ž¡‘(g©1Ž¦‘(g©2ŽŸÁD‘ÝIf–¦fthree“outputs“are“requested,“Þfind“Ýalso“returns“the“nonzero“v‘ÿdDalues“in“a“v²!ector.ŽŸ#ëE22.2‘™Rearranging‘¦MMatricesŽŽŸÁD‘ÝThe–z½function“Þfliplr“Ýrevš²!erses“the“order“of“the“columns“in“a“matrix,‘¯Òand“Þflipud“Ýrev˜erses“theŽŸorder–¦fof“the“ro²!ws.‘ÝÝF‘ÿeor“example,ŽŸÁD‘èUÞoctave:13>–¿ªfliplr“([1,“2;“3,“4])Ž¦‘èUans‘¿ª=Ž¡‘(g©2‘ T1Ž¦‘(g©4‘ T3Ž¡‘èUoctave:13>–¿ªflipud“([1,“2;“3,“4])Ž¦‘èUans‘¿ª=Ž¡‘(g©3‘ T4Ž¦‘(g©1‘ T2ŽŸÁD‘ÝThe–hfunction“Þrot90–¦f(áaÞ,“ánÞ)–hÝrotates“a“matrix“coun•²!tercloMÞc“kwise–hin“90-degree“incremen²!ts.‘ôãTheŽ¤second–‘[argumenš²!t“is“optional,‘Ìand“spMÞeci es“ho˜w“man˜y“90-degree“rotations“are“to“bMÞe“applied“(theŽ¡default–¦fv›ÿdDalue“is“1).‘ÝÝNegativ²!e“v˜alues“of“án“Ýrotate“the“matrix“in“a“cloMÞc²!kwise“direction.‘ÝÝF‘ÿeor“example,ŽŽŸŒ‹‹ÞÝŸòÝChapter–¦f22:‘ÝÝMatrix“Manipulation’#%è139ŽŽŽ ƒ3Ú ý¨ðБèUÞrot90–¿ª([1,“2;“3,“4],“-1)Ž¤ ‘èUans‘¿ª=ŽŸ‘(g©3‘ T1Ž¡‘(g©4‘ T2Ž©+Ýrotates–¦fthe“givš²!en“matrix“cloMÞc˜kwise“b˜y“90“degrees.‘ÝÝThe“follo˜wing“are“all“equiv‘ÿdDalen˜t“statemen˜ts:ŽŸ+‘èUÞrot90–¿ª([1,“2;“3,“4],“-1)Ž¡‘èUrot90–¿ª([1,“2;“3,“4],“3)Ž¡‘èUrot90–¿ª([1,“2;“3,“4],“7)Ž¦‘ÝThe–.function“Þreshape–¦f(áaÞ,“ámÞ,“ánÞ)–.Ýreturns“a“matrix“with“ám“Ýroš²!ws“and“án“Ýcolumns“whose“elemen˜tsŽ¤are–Mtakš²!en“from“the“matrix“áaÝ.‘ <‘T‘ÿeo“decide“ho˜w“to“order“the“elemen˜ts,‘x†Octa˜v˜e“pretends“that“theŽ¡elemenš²!ts–¦fof“a“matrix“are“stored“in“column-ma‘›»jor“order“(lik˜e“F‘ÿeortran“arra˜ys“are“stored).Ž¦‘F‘ÿeor‘¦fexample,ŽŸ+‘èUÞoctave:13>–¿ªreshape“([1,“2,“3,“4],“2,“2)Ž¤ ‘èUans‘¿ª=ŽŸ‘(g©1‘ T3Ž¡‘(g©2‘ T4Ž¦‘ÝIf–¦fthe“v›ÿdDariable“Þdo_fortran_indexing“Ýis“Þ"true"Ý,“the“Þreshape“Ýfunction“is“equiv˜alen²!t“toŽŸ+‘èUÞretval–¿ª=“zeros“(m,“n);Ž¡‘èUretval–¿ª(:)“=“a;Ž¦Ýbut–ò it“is“somewhat“less“cryptic“to“use“Þreshape“Ýinstead“of“the“colon“opMÞerator.‘‹Note“that“the“totalŽ¤n•²!um“bMÞer–t½of“elemenš²!ts“in“the“original“matrix“m˜ust“matc˜h“the“total“n˜um˜bMÞer“of“elemen˜ts“in“the“newŽ¡matrix.Ž¦‘The–Z¹function“`ÞsortÝ'“can“bMÞe“used“to“arrange“the“elemenš²!ts“of“a“v˜ector“in“increasing“order.‘úÖF‘ÿeorŽ¡matrices,–¦fÞsort“Ýorders“the“elemenš²!ts“in“eac˜h“column.Ž¦‘F‘ÿeor‘¦fexample,ŽŸ+‘èUÞoctave:13>–¿ªsort“(rand“(4))Ž¤ ‘èUans‘¿ª=ŽŸ‘(g©0.065359– T0.039391“0.376076“0.384298Ž¡‘(g©0.111486– T0.140872“0.418035“0.824459Ž¡‘(g©0.269991– T0.274446“0.421374“0.938918Ž¡‘(g©0.580030– T0.975784“0.562145“0.954964Ž¦‘ÝThe–£äÞsort“Ýfunction“ma²!y“also“bšMÞe“used“to“pro˜duce“a“matrix“conš²!taining“the“original“ro˜w“indices“ofŽŸthe–¦felemen²!ts“in“the“sorted“matrix.‘ÝÝF‘ÿeor“example,ŽŸ+‘èUÞs‘¿ª=ŽŸ‘(g©0.051724– T0.485904“0.253614“0.348008Ž¡‘(g©0.391608– T0.526686“0.536952“0.600317Ž¡‘(g©0.733534– T0.545522“0.691719“0.636974Ž¡‘(g©0.986353– T0.976130“0.868598“0.713884ŽŽŸŒ‹Œå?ŸòÝ140’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý´ðБèUÞi‘¿ª=Ž©‘(g©2– T4“2“3Ž¤ ‘(g©4– T1“3“4Ž¡‘(g©1– T2“4“1Ž¡‘(g©3– T3“1“2ŽŸQÝThese–¦fv‘ÿdDalues“maš²!y“bMÞe“used“to“reco˜v˜er“the“original“matrix“from“the“sorted“v˜ersion.‘ÝÝF‘ÿeor“example,ŽŸ$¢‘The–ZŠÞsort“Ýfunction“doMÞes“not“alloš²!w“sort“k˜eys“to“bšMÞe“sp˜eci ed,‘i¶so“it“can't“b˜e“used“to“order“the“ro²!wsŽ¤of–¯Ýin“a“single“call.‘1_Using“theŽ¡second‘&Žoutput,›@ ho•²!w“ev“er,˜it–&Žis“pMÞossible“to“sort“all“roš²!ws“based“on“the“v‘ÿdDalues“in“a“giv˜en“column.‘³@Here'sŽ¡an–¦fexample“that“sorts“the“ro²!ws“of“a“matrix“based“on“the“v‘ÿdDalues“in“the“third“column.ŽŸQ‘èUÞoctave:13>–¿ªa“=“rand“(4)Ž¤ ‘èUa‘¿ª=Ž¦‘(g©0.080606– T0.453558“0.835597“0.437013Ž¡‘(g©0.277233– T0.625541“0.447317“0.952203Ž¡‘(g©0.569785– T0.528797“0.319433“0.747698Ž¡‘(g©0.385467– T0.124427“0.883673“0.226632Ž¦‘èUoctave:14>–¿ª[s,“i]“=“sort“(a“(:,“3));Ž¡‘èUoctave:15>–¿ªa“(i,“:)Ž¡‘èUans‘¿ª=Ž¦‘(g©0.569785– T0.528797“0.319433“0.747698Ž¡‘(g©0.277233– T0.625541“0.447317“0.952203Ž¡‘(g©0.080606– T0.453558“0.835597“0.437013Ž¡‘(g©0.385467– T0.124427“0.883673“0.226632Ž©Q‘ÝThe– Šfunctions“Þtriu–¦f(áaÞ,“ák›ªÞ)– ŠÝand“Þtril–¦f(áaÞ,“ák˜Þ)– ŠÝextract“the“uppMÞer“or“lo•²!w“er– Štriangular“part“of“theŽ¤matrix–üáaÝ,‘."and“set“all“other“elemenš²!ts“to“zero.‘# The“second“argumen˜t“is“optional,‘."and“spMÞeci es“ho˜wŽ¡manš²!y–¦fdiagonals“abMÞo˜v˜e“or“bMÞelo˜w“the“main“diagonal“should“also“bMÞe“set“to“zero.Ž¦‘The–Z„default“v‘ÿdDalue“of“ák‘ˆÝis“zero,‘‡‹so“that“Þtriu“Ýand“Þtril“Ýnormally“include“the“main“diagonal“asŽ¡part–¦fof“the“result“matrix.Ž¦‘If––¿ªtril“(rand“(4),“1)Ž¤‘èUans‘¿ª=Ž¡¡‘(g©0.00000– T0.00000“0.00000“0.00000Ž¡‘(g©0.09012– T0.00000“0.00000“0.00000Ž¡‘(g©0.01215– T0.34768“0.00000“0.00000Ž¡‘(g©0.00302– T0.69518“0.91940“0.00000ŽŽ¤l:ªÝforms–¦fa“lo•²!w“er–¦ftriangular“matrix“from“a“random“4“b²!y“4“matrix,“omitting“the“main“diagonal,“andŽŸ‘èUÞoctave:13>–¿ªtril“(rand“(4),“-1)Ž¤‘èUans‘¿ª=Ž¡¡‘(g©0.06170– T0.51396“0.00000“0.00000Ž¡‘(g©0.96199– T0.11986“0.35714“0.00000Ž¡‘(g©0.16185– T0.61442“0.79343“0.52029Ž¡‘(g©0.68016– T0.48835“0.63609“0.72113ŽŽ¡Ýforms–Féa“lo•²!w“er–Fétriangular“matrix“from“a“random“4“b²!y“4“matrix,‘Zincluding“the“main“diagonal“and“theŽŸ rst‘¦fsupMÞer-diagonal.ŽŽŸŒ‹ŽöÉŸòÝ142’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹úŸòÝChapter–¦f23:‘ÝÝString“F‘ÿeunctions’8‡ô143ŽŽŽ ƒ3Ú ý¨ðÐè23‘ ¸QString‘¦MF‘þaGunctionsŽŽŸ ‘ÝOcta•²!v“e›¦fcurren“tly˜has˜a˜limited˜abilit“y˜to˜w“ork˜with˜strings.Ž¤‘The–„Ófunction“Þstrcmp–¦f(ás1Þ,“ás2‘ß9Þ)–„ÓÝcompares“t•²!w“o–„Óstrings,›¼mreturning“1“if“they“are“the“same,˜and“0Ž©otherwise.Ž¡‘ßNote:‘pöF‘ÿeor–oòcompatibilitš²!y“with“ãMa‘ÿEtlabß,‘¢UOcta˜v˜e's“strcmp“function“returns“1“if“the“strings“areŽ¦equal,–¦fand“0“otherwise.‘ÝÝThis“is“just“the“oppšMÞosite“of“the“corresp˜onding“C“library“function.Ž¡‘ÝThe–ðfunctions“Þint2str“Ýand“Þnum2str“Ýcon•²!v“ert–ða“nš²!umeric“argumen˜t“to“a“string.‘¼[These“functionsŽ¦are–Ônot“vš²!ery“ exible,‘‡‹but“are“pro˜vided“for“compatibilit˜y“with“ãMa‘ÿEtlabÝ.‘ÑF‘ÿeor“bMÞetter“con˜trol“o˜v˜er“theŽ¦results,–¦fuse“Þsprintf“Ý(see“Section“20.2.2“[F‘ÿeormatted“Output],“page“122).Ž¡‘The–§function“Þsetstr“Ýcan“bMÞe“used“to“con•²!v“ert–§a“vš²!ector“to“a“string.‘àEac˜h“elemen˜t“of“the“v˜ector“isŽ¦con•²!v“erted–¦fto“the“correspšMÞonding“ASCI˜I“c²!haracter.‘ÝÝF‘ÿeor“example,Ž©‘èUÞsetstr–¿ª([97,“98,“99])Ž¡Ýcreates–¦fthe“stringŽ¦‘èUÞabcŽ¡‘ÝThe–æfunction“Þundo_string_escapes‘¦f(ástring‘ðÞ)“Ýcon•²!v“erts–æspMÞecial“cš²!haracters“in“strings“bac˜k“to“theirŽŸescapMÞed–¦fforms.‘ÝÝF‘ÿeor“example,“the“expressionŽ¦‘èUÞbell–¿ª=“"\a";Ž¡Ýassigns–¦hthe“v‘ÿdDalue“of“the“alert“cš²!haracter“(con˜trol-g,‘æhASCI•MÞI‘¦&co“de–¦h7)“to“the“string“v‘ÿdDariable“ábMÞellÝ.‘ÝãIfŽ¤this–¥ðstring“is“prin²!ted,‘¦the“system“will“ring“the“terminal“bšMÞell“(if“it“is“p˜ossible).‘ݶThis“is“normally“theŽ¡desired›©outcome.‘åøHo•²!w“ev“er,‘©Çsometimes˜it˜is˜useful˜to˜bMÞe˜able˜to˜prin“t˜the˜original˜represen“tation˜ofŽ¡the–¦fstring,“with“the“spMÞecial“cš²!haracters“replaced“b˜y“their“escapMÞe“sequences.‘ÝÝF‘ÿeor“example,Ž¦‘èUÞoctave:13>–¿ªundo_string_escapes“(bell)ŽŸ ‘èUans–¿ª=“\aŽŸÝreplaces–ƒYthe“unprinš²!table“alert“c˜haracter“with“its“prin˜table“represen˜tation.‘Ò.See“Section“3.1.2“[StringŽ¡Constan²!ts],–¦fpage“22,“for“a“description“of“string“escapMÞes.ŽŽŸŒ‹ú\ŸòÝ144’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹‘ãŸòÝChapter–¦f24:‘ÝÝSystem“Utilities’;±Ã145ŽŽŽ ƒ3Ú ý¨ðÐè24‘ ¸QSystem‘¦MUtilitiesŽŽŸ$$±‘ÝThis–W»cš²!hapter“describMÞes“the“functions“that“are“a˜v‘ÿdDailable“to“allo˜w“y˜ou“to“get“information“abMÞoutŽ¤what–²êis“happMÞening“outside“of“Octa•²!v“e,›ö while–²êit“is“still“running,˜and“use“this“information“in“y²!ourŽ¡program.‘±1F‘ÿeor–—‚example,‘ÓÉyš²!ou“can“get“information“abMÞout“en˜vironmen˜t“v‘ÿdDariables,‘ÓÉthe“curren˜t“time,Ž¡and–¦fevš²!en“start“other“programs“from“the“Octa˜v˜e“prompt.ŽŸ#PŽëE24.1‘™Timing‘¦MUtilitiesŽŽŸÔ#‘ÝThe–function“Þclock“Ýreturns“a“vš²!ector“con˜taining“the“curren˜t“y˜ear,‘5]mon˜th“(1-12),‘5]da˜y“(1-31),‘5]hourŽ¡(0-23),–¦fmin²!ute“(0-59)“and“second“(0-60).‘ÝÝF‘ÿeor“example,Ž©Ô#‘èUÞoctave:13>‘¿ªclockŽŸ ‘èUans‘¿ª=ŽŸ‘(g©1993–¾R8›þ¨20“4˜56“1Ž¤Ô#‘ÝThe–¦ffunction“cloMÞcš²!k“is“more“accurate“on“systems“that“ha˜v˜e“the“Þgettimeofday“Ýfunction.Ž¡‘T›ÿeo–¾get“the“date“as“a“c²!haracter“string“in“the“form“DD-MMM-YY,“use“the“command“ÞdateÝ.‘ìæF˜orŽŸexample,Ž¦‘èUÞoctave:13>‘¿ªdateŽŸ ‘èUans–¿ª=“20-Aug-93Ž¡‘ÝOcta•²!v“e–£calso“has“functions“for“computing“time“in²!terv‘ÿdDals“and“CPU‘£btime“used.‘ÜÜThe“functions“ÞticŽŸÝand–¦fÞtoc“Ýcan“bšMÞe“used“to“set“and“c•²!hec“k–¦fa“w•²!all-clo˜c“k–¦ftimer.‘ÝÝF‘ÿeor“example,Ž¦‘èUÞtic‘¿ª();Ž¤ ‘èU#–¿ªmany“computations“later...Ž¡‘èUelapsed_time–¿ª=“toc“();Ž¤Ô#Ýwill–üˆset“the“v‘ÿdDariable“Þelapsed_time“Ýto“the“n•²!um“bMÞer–üˆof“seconds“since“the“most“recen²!t“call“to“theŽ©function‘¦fÞticÝ.Ž¡‘The–Q7function“Þetime“Ýproš²!vides“another“w˜a˜y“to“get“elapsed“w˜all-cloMÞc˜k“time“b˜y“returning“the“di er-Ž¦ence–¦f(in“seconds)“bMÞet•²!w“een›¦ft“w“o˜time˜v‘ÿdDalues˜returned˜from˜ÞclockÝ.‘ÝÝF‘ÿeor˜example:ŽŸÔ#‘èUÞt0–¿ª=“clock“();Ž¤ ‘èU#–¿ªmany“computations“later...Ž¡‘èUelapsed_time–¿ª=“etime“(clock“(),“t0);Ž¤Ô#Ýwill–¦fset“the“v›ÿdDariable“Þelapsed_time“Ýto“the“n•²!um“bMÞer–¦fof“seconds“since“the“v˜ariable“Þt0“Ýw²!as“set.Ž¡‘The–R1function“Þcputime“Ýalloš²!ws“y˜ou“to“obtain“information“abMÞout“the“amoun˜t“of“CPU‘Rtime“y˜ourŽ¦Octa•²!v“e–¦fsession“is“using.‘ÝÝF‘ÿeor“example,ŽŸÔ#‘èUÞ[total,–¿ªuser,“system]“=“cputime“();Ž¡Ýreturns–Œ¨the“CPU‘Œatime“used“bš²!y“y˜our“Octa˜v˜e“session.‘óThe“ rst“output“is“the“total“time“spMÞen˜t“executingŽ¦yš²!our–øPproMÞcess“and“is“equal“to“the“sum“of“second“and“third“outputs,‘ Ëwhic˜h“are“the“n˜um˜bMÞer“of“CPUŽŽŸŒ‹’7ŸòÝ146’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐseconds–ÞúspšMÞen²!t“executing“in“user“mo˜de“and“the“n•²!um“b˜er–Þúof“CPU‘Þìseconds“sp˜en²!t“executing“in“systemŽ¤mo•MÞde,‘¦fresp“ectiv²!ely‘ÿe.Ž©np‘Finally‘ÿe,‘»ÂOcta•²!v“e's–function“Þis_leap_year“Ýreturns“1“if“the“givš²!en“y˜ear“is“a“leap“y˜ear“and“0“otherwise.Ž¡If–¦fno“argumenš²!ts“are“pro˜vided,“Þis_leap_year“Ýwill“use“the“curren˜t“y˜ear.‘ÝÝF‘ÿeor“example,ŽŸnp‘èUÞoctave:13>–¿ªis_leap_year“(2000)ŽŸ ‘èUans–¿ª=“1Ž¦ÝConš²!trary–öto“what“man˜y“pšMÞeople“who“p˜ost“misinformation“to“Usenet“apparen²!tly“b˜eliev•²!e,‘~ZOcta“v“eŽ¡knoš²!ws–¦fthat“the“y˜ear“2000“will“bMÞe“a“leap“y˜ear.ŽŸ%¹ÀëE24.2‘™InŒÌteracting–¦Mwith“the“OSŽŽŸnp‘ÝY‘ÿeou–“-can“execute“an²!y“shell“command“using“the“function“Þsystem–¦f(ácmdÞ,“á ag‘ðÞ)Ý.‘×uThe–“-second“argu-Ž¡menš²!t–A¿is“optional.‘¯éIf“it“is“presen˜t,‘h•the“output“of“the“command“is“returned“b˜y“Þsystem“Ýas“a“string.Ž¡If–01it“is“not“supplied,‘R£anš²!y“output“from“the“command“is“prin˜ted,‘R£with“the“standard“output“ lteredŽ¡through–¦fthe“pager.‘ÝÝF‘ÿeor“example,ŽŸnp‘èUÞusers–¿ª=“system“("finger",“1)Ž¦Ýplaces–¦fthe“output“of“the“command“Þfinger“Ýin“the“v‘ÿdDariable“ÞusersÝ.Ž¦‘If–byš²!ou“w˜an˜t“to“execute“a“shell“command“and“ha˜v˜e“it“bMÞeha˜v˜e“as“if“it“w˜ere“t˜ypMÞed“directly“fromŽ¡the–šëshell“prompt,‘7yš²!ou“ma˜y“need“to“spMÞecify“extra“argumen˜ts“for“the“command.‘Ú F‘ÿeor“example,‘7to“getŽ¡Þbash–¦fÝto“bMÞeha•²!v“e–¦fas“an“in•²!teractiv“e–¦fshell,“yš²!ou“can“t˜ypMÞeŽŸnp‘èUÞsystem–¿ª("bash“-i“>/dev/tty");Ž¦‘ÝThe–¬Ö rst“argumenš²!t,–®r`Þ-iÝ',“tells–¬ÖÞbash“Ýto“bMÞeha˜v˜e“as“an“in˜teractiv˜e“shell,‘®rand“the“redirection“of“theŽ¡standard–Jyoutput“stream“prev•²!en“ts›Jyan“y˜output˜proMÞduced˜b“y˜Þbash˜Ýfrom˜bMÞeing˜sen“t˜bac“k˜to˜Octa“v“e,Ž¡where–¦fit“wš²!ould“bMÞe“bu ered“un˜til“Octa˜v˜e“displa˜ys“another“prompt.Ž¦‘The–eUÞsystem“Ýfunction“can“return“t•²!w“o–eUv‘ÿdDalues.‘©The“ rst“is“an²!y“output“from“the“command“thatŽ¡w²!as–Ùªwritten“to“the“standard“output“stream,‘æzand“the“second“is“the“output“status“of“the“command.Ž¡F‘ÿeor‘¦fexample,Ž¤np‘èUÞ[output,–¿ªstatus]“=“system“("echo“foo;“exit“2");Ž¦Ýwill–¦fset“the“v›ÿdDariable“Þoutput“Ýto“the“string“`ÞfooÝ',“and“the“v˜ariable“Þstatus“Ýto“the“in²!teger“`Þ2Ý'.Ž¦‘The–¦fname“Þshell_cmd“Ýexists“for“compatibilitš²!y“with“earlier“v˜ersions“of“Octa˜v˜e.Ž¦‘Y‘ÿeou–¦fcan“ nd“the“v›ÿdDalues“of“en•²!vironmen“t–¦fv˜ariables“using“the“function“ÞgetenvÝ.‘ÝÝF‘ÿeor“example,Ž¡‘èUÞgetenv‘¿ª("PATH")Ž¦Ýreturns–¦fa“string“conš²!taining“the“v‘ÿdDalue“of“y˜our“path.Ž¦‘The–ðšfunctions“ÞclcÝ,‘&and“Þhome“Ýclear“yš²!our“terminal“screen“and“mo˜v˜e“the“cursor“to“the“uppMÞer“leftŽŸcorner.ŽŽŸŒ‹“ +ŸòÝChapter–¦f24:‘ÝÝSystem“Utilities’;±Ã147ŽŽŽ ƒ3Ú ý¨ðБY‘ÿeou–zŽcan“cš²!hange“the“curren˜t“w˜orking“directory“using“the“Þcd“Ýcommand.‘ ZTTilde“expansion“isŽ¤pMÞerformed–¦fon“the“path.‘ÝÝF‘ÿeor“example,ŽŸ‘èUÞcd‘¿ª~/octaveŽ©ÝChanges–Ûóthe“currenš²!t“w˜orking“directory“to“`Þ~/octaveÝ'.‘~„If“the“directory“doMÞes“not“exist,‘)Van“errorŽ¡message–¦fis“prinš²!ted“and“the“w˜orking“directory“is“not“c˜hanged.Ž¦‘The–¦fname“Þchdir“Ýis“an“alias“for“ÞcdÝ.Ž¦‘The–¦fcommand“Þpwd“Ýprinš²!ts“the“curren˜t“w˜orking“directory‘ÿe.Ž¦‘The–¦ffunctions“Þdir“Ýand“Þls“Ýlist“directory“con•²!ten“ts.‘ÝÝF‘ÿeor‘¦fexample,ŽŸ‘èUÞoctave:13>–¿ªls“-lŽ¤ ‘èUtotal‘¿ª12Ž¡‘èU-rw-r--r--‘>þ1–¿ªjwe‘"}üusers‘-ýP4488“Aug“19“04:02“foo.mŽ¡‘èU-rw-r--r--‘>þ1–¿ªjwe‘"}üusers‘-ýP1315“Aug“17“23:14“bar.mŽ¦‘ÝThe–çÕÞdir“Ýand“Þls“Ýcommands“are“implemenš²!ted“b˜y“calling“y˜our“system's“directory“listing“command,Ž¤so–¦fthe“aš²!v‘ÿdDailable“options“ma˜y“v‘ÿdDary“from“system“to“system.ŽŸ ëE24.3‘™System‘¦MInformationŽŽŸ‘ÝIf–ÄpMÞossible,‘ËnÞcomputer“Ýprinš²!ts“a“string“of“the“form“ácpuÝ-áv˜endorÝ-áos‘7ˆÝthat“iden˜ti es“the“kind“of“com-Ž¡puter›¦fOcta•²!v“e˜is˜running˜on.‘ÝÝF‘ÿeor˜example,ŽŸ‘èUÞoctave:13>‘¿ªcomputerŽŸ ‘èUsparc-sun-sunos4.1.2Ž¦‘ÝThe–VOfunction“Þisieee“Ýreturns“1“if“y²!our“computer“claims“to“conform“to“the“IEEE‘V"standard“forŽ¡ oating–¦fpMÞoin²!t“calculations.Ž¦‘The–]´function“Þversion“Ýreturns“Octa•²!v“e's›]´v“ersion˜n“um“bMÞer˜as˜a˜string.‘Å¢This˜is˜also˜the˜v‘ÿdDalue˜of˜theŽ¡built-in–¦fv‘ÿdDariable“ÞOCTAVE_VERSIONÝ.‘ÝÝSee“Chapter“6“[Built-in“V‘ÿeariables],“page“61.ŽŸ ëE24.4‘™Other‘¦MF‘þ¦functionsŽŽŸ‘ÝThe–Êfunction“Þpause“Ýalloš²!ws“y˜ou“to“suspMÞend“the“execution“of“a“program.‘HÕIf“in˜v˜ok˜ed“without“an˜yŽ¡argumen•²!ts,‘&QOcta“v“e› »w“aits˜un“til˜y“ou˜t“ypMÞe˜a˜c“haracter.‘ÝWith˜a˜n“umeric˜argumen“t,‘&Qit˜pauses˜for˜theŽ¡giv•²!en›°Sn“um“bMÞer˜of˜seconds.‘û¤F‘ÿeor˜example,‘²Îthe˜follo“wing˜statemen“t˜prin“ts˜a˜message˜and˜then˜w“aits˜5Ž¡seconds–¦fbMÞefore“clearing“the“screen.ŽŸ‘èUÞfprintf–¿ª(stderr,“"wait“please...\n"),“pause“(5),“clcŽŽŸŒ‹”AŸòÝ148’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹•! ŸòÝChapter–¦f25:‘ÝÝCommand“History“F‘ÿeunctions’ýv:149ŽŽŽ ƒ3Ú ý¨ðÐè25‘ ¸QCommand–¦MHistory“F‘þaGunctionsŽŽŸ!ÏÖ‘ÝOcta•²!v“e›ª¨pro“vides˜three˜functions˜for˜viewing,–«¸editing,“and˜re-running˜c•²!h“unks˜of˜commands˜fromŽ¤the–¦fhistory“list.ŽŸ\Ä‘The–>ºfunction“Þhistory“Ýdisplaš²!ys“a“list“of“commands“that“y˜ou“ha˜v˜e“executed.‘»NIt“also“allo˜ws“y˜ou“toŽ¡write–ä™the“currenš²!t“history“to“a“ le“for“safe“k˜eeping,‘ \and“to“replace“the“history“list“with“the“commandsŽ¡stored–¦fin“a“named“ le.‘ÝÝV‘ÿealid“argumen²!ts“are:ŽŸ¹ˆÞ-w‘¦ffileŽŽ‘9ÐóÝW‘ÿerite–nsthe“curren²!t“history“to“the“named“ le.‘6If“the“name“is“omitted,‘ vuse“the“defaultŽ¡‘9Ðóhistory–¦f le“(normally“`Þ~/.octave_histÝ').Ž©¹ˆÞ-r‘¦ffileŽŽ‘9ÐóÝRead–[’the“named“ le,‘j‰replacing“the“currenš²!t“history“list“with“its“con˜ten˜ts.‘ÄìIf“the“name“isŽ¡‘9Ðóomitted,–¦fuse“the“default“history“ le“(normally“`Þ~/.octave_histÝ').Ž¦ÞNŽŽ‘9ÐóÝOnly–¦fdisplaš²!y“the“most“recen˜t“ÞN“Ýlines“of“history‘ÿe.Ž¦Þ-qŽŽ‘9ÐóÝDon't›èÜn•²!um“bMÞer˜the˜displa“y“ed˜lines˜of˜history‘ÿe.‘¥@This˜is˜useful˜for˜cutting˜and˜pastingŽ¡‘9Ðócommands–¦fif“yš²!ou“are“using“the“X“Windo˜w“System.ŽŸ¹ˆ‘F‘ÿeor–kŸexample,‘wato“displaš²!y“the“ v˜e“most“recen˜t“commands“that“y˜ou“ha˜v˜e“t˜ypMÞed“without“displa˜yingŽ¡line›¦fn•²!um“bMÞers,˜use˜the˜command˜`Þhistory˜-q˜5Ý'.Ž©\Ä‘The–Œäfunction“Þedit_history“Ýalloš²!ws“y˜ou“to“edit“a“bloMÞc˜k“of“commands“from“the“history“list“usingŽ¡the–F2editor“named“bš²!y“the“en˜vironmen˜t“v‘ÿdDariable“ÞEDITORÝ,‘n%or“the“default“editor“(normally“ÞviÝ).‘½AIt“isŽ¡often–|×more“con•²!v“enien“t–|×to“use“Þedit_history“Ýto“de ne“functions“rather“than“attempting“to“en²!terŽ¡them–4directly“on“the“command“line.‘›HBy“default,‘ʨthe“blošMÞc²!k“of“commands“is“executed“as“so˜on“asŽ¡yš²!ou–Ê©exit“the“editor.‘J¥T‘ÿeo“a˜v˜oid“executing“an˜y“commands,‘Ó¹simply“delete“all“the“lines“from“the“bu erŽ¡bMÞefore–¦fexiting“the“editor.Ž¦‘The–%¸Þedit_history“Ýcommand“takš²!es“t˜w˜o“optional“argumen˜ts“spMÞecifying“the“history“n˜um˜bMÞers“ofŽ¡ rst–¦fand“last“commands“to“edit.‘ÝÝF‘ÿeor“example,“the“commandŽ¤\Ä‘èUÞedit_history‘¿ª13Ž¦Ýextracts–¦fall“the“commands“from“the“13th“through“the“last“in“the“history“list.‘ÝÝThe“commandŽ¡‘èUÞedit_history–¿ª13“169Ž¦Ýonly–òextracts“commands“13“through“169.‘ €SpšMÞecifying“a“larger“n•²!um“b˜er–òfor“the“ rst“command“thanŽ¤the–¶Élast“command“rev²!erses“the“list“of“commands“bšMÞefore“placing“them“in“the“bu er“to“b˜e“edited.‘IfŽ¡bMÞoth–¦fargumen²!ts“are“omitted,“the“previous“command“in“the“history“list“is“used.Ž¦‘The–RËcommand“Þrun_history“Ýis“likš²!e“Þedit_historyÝ,‘}äexcept“that“the“editor“is“not“in˜v˜ok˜ed,‘}äandŽ¡the–¦fcommands“are“simply“executed“as“they“appMÞear“in“the“history“list.Ž¦‘The–žtÞdiary“Ýcommand“alloš²!ws“y˜ou“to“create“a“list“of“all“commands“áand‘ ÆÝthe“output“they“proMÞduce,Ž¡mixed–¦ftogether“just“as“yš²!ou“see“them“on“y˜our“terminal.Ž¦‘F‘ÿeor–¦fexample,“the“commandŽŽŸŒ‹–!aŸòÝ150’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞdiary‘¿ªonŽ¤Ýtells›qOcta•²!v“e˜to˜start˜recording˜y“our˜session˜in˜a˜ le˜called˜`ÞdiaryÝ'˜in˜y“our˜curren“t˜w“orking˜directory‘ÿe.ŽŸT‘ÿeo–¦fgivš²!e“Octa˜v˜e“the“name“of“the“ le“write“to,“use“the“a“command“lik˜eŽ©‘èUÞdiary‘¿ªmy-diary.txtŽ¡ÝThen›¦fOcta•²!v“e˜will˜write˜all˜of˜y“our˜commands˜to˜the˜ le˜`Þmy-diary.txtÝ'.Ž¡‘T‘ÿeo–¦fstop“recording“y²!our“session,“use“the“commandŽ¦‘èUÞdiary‘¿ªoffŽ¡ÝWithout–¦fanš²!y“argumen˜ts,“Þdiary“Ýtoggles“the“curren˜t“diary“state.ŽŽŸŒ‹—-{ŸòÝChapter‘¦f26:‘ÝÝHelp’q§U151ŽŽŽ ƒ3Ú ý¨ðÐè26‘ ¸QHelpŽŽŸ ‘ÝOcta•²!v“e's–xpÞhelp“Ýcommand“can“bMÞe“used“to“prinš²!t“brief“usage-st˜yle“messages,‘´Ôor“to“displa˜y“informationŽ¤directly–uÓfrom“an“on-line“vš²!ersion“of“the“prin˜ted“man˜ual,‘©®using“the“GNU‘užInfo“bro˜wser.‘L#If“in˜v˜ok˜edŽ¡without–Å”anš²!y“argumen˜ts,‘ _Þhelp“Ýprin˜ts“a“list“of“all“the“a˜v‘ÿdDailable“opMÞerators,– _functions,“and‘Å”built-inŽ¡v‘ÿdDariables.‘HIf–ÉÐthe“ rst“argumenš²!t“is“Þ-iÝ,‘Òªthe“Þhelp“Ýcommand“searc˜hes“the“index“of“the“on-line“v˜ersionŽ¡of–¦fthis“manš²!ual“for“the“giv˜en“topics.Ž¤‘F‘ÿeor–¦fexample,“the“commandŽ©‘èUÞhelp‘¿ªhelpŽ¡Ýprin²!ts–¦fa“short“message“describing“the“Þhelp“Ýcommand,“andŽ¦‘èUÞhelp–¿ª-i“helpŽ¡Ýstarts–¦fthe“GNU“Info“broš²!wser“at“this“noMÞde“in“the“on-line“v˜ersion“of“the“man˜ual.Ž¡‘See–XAppMÞendix“D‘WØ[Using“Info],›„mpage“183,˜for“complete“details“abMÞout“ho²!w“to“use“the“GNU‘WØInfoŽŸbroš²!wser–¦fto“read“the“on-line“v˜ersion“of“the“man˜ual.ŽŽŸŒ‹˜/ПòÝ152’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹™4ŸòÝChapter–¦f27:‘ÝÝProgramming“Utilities’ÒJ153ŽŽŽ ƒ3Ú ý¨ðÐè27‘ ¸QProgramming‘¦MUtilitiesŽŽŸHêNëE27.1‘™Ev‘ÿ™aluating–¦MStrings“as“CommandsŽŽŸJ‘ÝIt–v]is“often“useful“to“ev‘ÿdDaluate“a“string“as“if“it“wš²!ere“an“Octa˜v˜e“program,‘ª[or“use“a“string“as“theŽ¤name–È‘of“a“function“to“call.‘D^These“functions“are“necessary“in“order“to“ev‘ÿdDaluate“commands“that“areŽ¡not–¦fknoš²!wn“un˜til“run“time,“or“to“write“functions“that“will“need“to“call“user-supplied“functions.Ž©J‘The–rŽfunction“Þeval‘¦f(ácommandnRÞ)“Ýparses“ácommand‘ààÝand“ev‘ÿdDaluates“it“as“if“it“wš²!ere“an“Octa˜v˜e“program,Ž¡returning–â¶the“last“v›ÿdDalue“computed.‘œ£The“ácommand‘QÝis“ev˜aluated“in“the“currenš²!t“con˜text,‘ Ùso“an˜y“resultsŽ¡remain–¦fa²!v‘ÿdDailable“after“Þeval“Ýreturns.‘ÝÝF‘ÿeor“example,ŽŸJ‘èUÞoctave:13>‘¿ªaŽ¤ ‘èUerror:–¿ª`a'“undefinedŽ¡‘èUoctave:14>–¿ªeval“("a“=“13")Ž¡‘èUa–¿ª=“13Ž¡‘èUans–¿ª=“13Ž¡‘èUoctave:15>‘¿ªaŽ¡‘èUa–¿ª=“13Ž¦‘ÝIn–´¤this“case,‘¸3t•²!w“o–´¤v‘ÿdDalues“are“prinš²!ted:‘úYone“for“the“expression“that“w˜as“ev‘ÿdDaluated,‘¸3and“one“for“theŽ¤v‘ÿdDalue–ؾreturned“from“ÞevalÝ.‘tåJust“as“with“anš²!y“other“expression,‘åTy˜ou“can“turn“prin˜ting“o “b˜y“endingŽ¡the–¦fexpression“in“a“semicolon.‘ÝÝF‘ÿeor“example,ŽŸJ‘èUÞoctave:13>‘¿ªaŽ¤ ‘èUerror:–¿ª`a'“undefinedŽ¡‘èUoctave:14>–¿ªeval“("a“=“13;")Ž¡‘èUans–¿ª=“13Ž¡‘èUoctave:15>‘¿ªaŽ¡‘èUa–¿ª=“13Ž¦‘ÝThe–Mfunction“Þfeval–¦f(ánameÞ,“...)–MÝcan“bMÞe“used“to“ev‘ÿdDaluate“the“function“named“ánameÝ.‘ ѾAn²!yŽŸargumen²!ts–¦fafter“the“ rst“are“passed“on“to“the“named“function.‘ÝÝF‘ÿeor“example,ŽŸJ‘èUÞoctave:12>–¿ªfeval“("acos",“-1)Ž¡‘èUans–¿ª=“3.1416Ž¦Ýcalls–¦fthe“function“Þacos“Ýwith“the“argumen²!t“`Þ-1Ý'.Ž¦‘The–F¹function“Þfeval“Ýis“necessary“in“order“to“bMÞe“able“to“write“functions“that“call“user-suppliedŽ¤functions,‘³½bMÞecause›}ßOcta•²!v“e˜doMÞes˜not˜ha“v“e˜a˜w“a“y˜to˜declare˜a˜pMÞoin“ter˜to˜a˜function˜(lik“e˜C)‘}¨or˜toŽ¡declare–ò‰a“spšMÞecial“kind“of“v‘ÿdDariable“that“can“b˜e“used“to“hold“the“name“of“a“function“(lik²!e“ÞEXTERNALŽ¡Ýin–¦fF‘ÿeortran).‘ÝÝInstead,“yš²!ou“m˜ust“refer“to“functions“b˜y“name,“and“use“Þfeval“Ýto“call“them.Ž¦‘F‘ÿeor–i³example,‘u×here“is“a“simple-minded“function“for“ nding“the“roMÞot“of“a“function“of“one“v‘ÿdDariable:ŽŽŸŒ‹š4eŸòÝ154’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБèUÞfunction–¿ªresult“=“newtroot“(fname,“x)Ž¤¡‘èU#–¿ªusage:“newtroot“(fname,“x)Ž¡‘èU#Ž¡‘èU#‘>þfname–¿ª:“a“string“naming“a“function“f(x).Ž¡‘èU#‘>þx‘¾R:–¿ªinitial“guessŽ¡¡‘(g©delta–¿ª=“tol“=“sqrt“(eps);Ž¡‘(g©maxit–¿ª=“200;Ž¡‘(g©fx–¿ª=“feval“(fname,“x);Ž¡‘(g©for–¿ªi“=“1:maxitŽ¡‘3æýif–¿ª(abs“(fx)“<“tol)Ž¡‘?fQresult–¿ª=“x;Ž¡‘?fQreturn;Ž¡‘3æýelseŽ¡‘?fQfx_new–¿ª=“feval“(fname,“x“+“delta);Ž¡‘?fQderiv–¿ª=“(fx_new“-“fx)“/“delta;Ž¡‘?fQx–¿ª=“x“-“fx“/“deriv;Ž¡‘?fQfx–¿ª=“fx_new;Ž¡‘3æýendifŽ¡‘(g©endforŽ¡¡‘(g©result–¿ª=“x;Ž¡¡‘èUendfunctionŽŽ z÷ ‘ÝNote–fthat“this“is“only“mean²!t“to“bMÞe“an“example“of“calling“user-supplied“functions“and“should“notŽ¤bšMÞe–W«tak²!en“to˜o“seriously‘ÿe.‘ßIn“addition“to“using“a“more“robust“algorithm,‘gjan²!y“serious“co˜de“wš²!ould“c˜hec˜kŽ¡the›q*n•²!um“bMÞer˜and˜t“ypMÞe˜of˜all˜the˜argumen“ts,‘{Ðensure˜that˜the˜supplied˜function˜really˜w“as˜a˜function,Ž¡etc.ŽŸ"ñ‚ëE27.2‘™Miscellaneous‘¦MUtilitiesŽŽŸ¼a‘ÝThe–´lfolloš²!wing“functions“allo˜w“y˜ou“to“determine“the“size“of“a“v‘ÿdDariable“or“expression,‘÷í nd“outŽ¡whether–¦fa“v›ÿdDariable“exists,“prin²!t“error“messages,“or“delete“v˜ariable“names“from“the“sym²!bMÞol“table.ŽŸxÂÞcolumns‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–¦fthe“n•²!um“bMÞer–¦fof“columns“of“áaÝ.Ž¤xÂÞrows‘¦f(áaÞ)ŽŽ‘9ÐóÝReturn–¦fthe“n•²!um“bMÞer–¦fof“ro²!ws“of“áaÝ.Ž¡Þlength‘¦f(áaÞ)ŽŸ‘9ÐóÝReturn–¦fthe“n•²!um“bMÞer–¦fof“roš²!ws“of“áa“Ýor“the“n˜um˜bMÞer“of“columns“of“áaÝ,“whic˜hev˜er“is“larger.ŽŽŸŒ‹›=ÜŸòÝChapter–¦f27:‘ÝÝProgramming“Utilities’ÒJ155ŽŽŽ ƒ3Ú ý¨ðÐÞsize‘¦f(áaÞ)ŽŽ‘9ÐóÝReturn–ÛKthe“n•²!um“bMÞer›ÛKro“ws˜and˜columns˜of˜áaÝ.‘|If˜there˜is˜only˜one˜output˜argumen“t,‘è…theŽ¤‘9Ðóresult–H‰is“returned“in“a“2“elemenš²!t“ro˜w“v˜ector.‘ÄEIf“there“are“t˜w˜o“output“argumen˜ts,‘qtheŽ¡‘9Ðón•²!um“bMÞer––‹of“roš²!ws“is“assigned“to“the“ rst,‘™·and“the“n˜um˜bMÞer“of“columns“to“the“second.‘Ø”F‘ÿeorŽ¡‘9Ðóexample,ŽŸÿ‘V¹HÞoctave:13>–¿ªsize“([1,“2;“3,“4;“5,“6])Ž¡‘V¹Hans‘¿ª=Ž¡¡‘b8œ3‘ T2Ž¡¡‘V¹Hoctave:14>–¿ª[nr,“nc]“=“size“([1,“2;“3,“4;“5,“6])Ž¡‘V¹Hnr–¿ª=“3Ž¡¡‘V¹Hnc–¿ª=“2ŽŽ 6Ìis_global‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–¦f1“if“áa“Ýis“globally“visible.‘ÝÝOtherwise,“return“0.Ž©ü"Þis_matrix‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–¦f1“if“áa“Ýis“a“matrix.‘ÝÝOtherwise,“return“0.Ž¦Þis_vector‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–¦f1“if“áa“Ýis“a“v²!ector.‘ÝÝOtherwise,“return“0.Ž¦Þis_scalar‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–¦f1“if“áa“Ýis“a“scalar.‘ÝÝOtherwise,“return“0.Ž¦Þis_square‘¦f(áx‘Á_Þ)Ž¡‘9ÐóÝIf–¦fáx‘gÅÝis“a“square“matrix,“then“return“the“dimension“of“áxÝ.‘ÝÝOtherwise,“return“0.Ž¦Þis_symmetric–¦f(áxÞ,“átolnRÞ)Ž¡‘9ÐóÝIf–zbáx‘;ÁÝis“symmetric“within“the“tolerance“spMÞeci ed“b²!y“átolÝ,‘ƒ0then“return“the“dimension“of“áxÝ.Ž¡‘9ÐóOtherwise,–¦freturn“0.‘ÝÝIf“átol‘¸Ýis“omitted,“use“a“tolerance“equal“to“the“mac²!hine“precision.Ž¦Þisstr‘¦f(áaÞ)ŽŽ‘9ÐóÝReturn–¦f1“if“áa“Ýis“a“string.‘ÝÝOtherwise,“return“0.Ž¦Þisempty‘¦f(áaÞ)Ž¡‘9ÐóÝReturn–”1“if“áa“Ýis“an“emptš²!y“matrix“(either“the“n˜um˜bMÞer“of“ro˜ws,‘&‹or“the“n˜um˜bMÞer“of“columns,Ž¡‘9Ðóor–¦fbMÞoth“are“zero).‘ÝÝOtherwise,“return“0.Ž¦Þclear–¦fápattern“Þ...Ž¡‘9ÐóÝDelete–ûjthe“names“matcš²!hing“the“giv˜en“patterns“from“the“sym˜bMÞol“table.‘¤ßThe“pattern“ma˜yŽ¡‘9Ðóconš²!tain–¦fthe“follo˜wing“spMÞecial“c˜haracters:Ž¦‘9ÐóÞ?ŽŽ‘s¡æÝMatc•²!h›¦fan“y˜single˜c“haracter.Ž¦‘9ÐóÞ*ŽŽ‘s¡æÝMatcš²!h–¦fzero“or“more“c˜haracters.ŽŽŸŒ‹œD2ŸòÝ156’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБ9ÐóÞ[‘¦fálist‘ãfÞ]ŽŽ‘s¡æÝMatcš²!h–2Ythe“list“of“c˜haracters“spMÞeci ed“b˜y“álistÝ.‘·.If“the“ rst“c˜haracter“is“Þ!“Ýor“Þ^Ý,Ž¤‘s¡æmatcš²!h–Ž6all“c˜haracters“except“those“spMÞeci ed“b˜y“álistÝ.‘€xF‘ÿeor“example,‘Æ@the“patternŽ¡‘s¡æ`Þ[a-zA-Z]Ý'–¦fwill“matcš²!h“all“lo˜w˜er“and“uppšMÞer“case“alphab˜etic“c²!haracters.ŽŸe~‘9ÐóF‘ÿeor–¦fexample,“the“commandŽŸ²¿‘V¹HÞclear–¿ªfoo“b*rŽ©²¿‘9ÐóÝclears–aÇthe“name“Þfoo“Ýand“all“names“that“bMÞegin“with“the“letter“Þb“Ýand“end“with“the“letterŽ¡‘9ÐóÞrÝ.Ž¦‘9ÐóIf–ä-Þclear“Ýis“called“without“anš²!y“argumen˜ts,‘óŸall“user-de ned“v‘ÿdDariables“(loMÞcal“and“global)Ž¡‘9Ðóare–4–cleared“from“the“symš²!bMÞol“table.‘ ˆmIf“Þclear“Ýis“called“with“at“least“one“argumen˜t,Ž¡‘9Ðóonly–\the“visible“names“matcš²!hing“the“argumen˜ts“are“cleared.‘ÐÚF‘ÿeor“example,‘‡*suppMÞose“y˜ouŽ¡‘9Ðóha•²!v“e–5úde ned“a“function“ÞfooÝ,‘Lvand“then“hidden“it“bš²!y“pMÞerforming“the“assignmen˜t“Þfoo–¦f=“2Ý.Ž¡‘9ÐóExecuting–|the“command“`Þclear‘¦ffooÝ'“once“will“clear“the“v‘ÿdDariable“de nition“and“restoreŽ¡‘9Ðóthe–‘~de nition“of“Þfoo“Ýas“a“function.‘ÖåExecuting“`Þclear‘¦ffooÝ'“a“second“time“will“clear“theŽ¡‘9Ðófunction‘¦fde nition.Ž¦‘9ÐóThis–¦fcommand“ma²!y“not“bšMÞe“used“within“a“function“b˜o˜dy‘ÿe.Ž©e~Þwho–¦fáoptions‘èpattern“Þ...Ž¡‘9ÐóÝList–{¾currenš²!tly“de ned“sym˜bMÞols“matc˜hing“the“giv˜en“patterns.‘]äThe“follo˜wing“are“v‘ÿdDalidŽ¡‘9Ðóoptions.‘ÝÝThey–¦fmaš²!y“bMÞe“shortened“to“one“c˜haracter“but“ma˜y“not“bMÞe“com˜bined.Ž¦‘9ÐóÞ-allŽŽ‘s¡æÝList–¦fall“currenš²!tly“de ned“sym˜bMÞols.Ž¦‘9ÐóÞ-builtinsŽ¡‘s¡æÝList–µSbuilt-in“v‘ÿdDariables“and“functions.‘ ¥This“includes“all“curren²!tly“com-Ž¡‘s¡æpiled–6™function“ les,‘Z¦but“doMÞes“not“include“all“function“ les“that“are“in“theŽ¡‘s¡æÞLOADPATHÝ.Ž¦‘9ÐóÞ-functionsŽ¡‘s¡æÝList–¦fuser-de ned“functions.Ž¦‘9ÐóÞ-longŽŽ‘s¡æÝPrinš²!t– a“long“listing“including“the“t˜ypMÞe“and“dimensions“of“an˜y“sym˜bMÞols.‘¬ñTheŽ¡‘s¡æsym²!bšMÞols–éÊin“the“ rst“column“of“output“indicate“whether“it“is“p˜ossible“toŽ¡‘s¡ærede ne–¦fthe“sym²!bšMÞol,“and“whether“it“is“p˜ossible“for“it“to“b˜e“cleared.Ž¦‘9ÐóÞ-variablesŽ¡‘s¡æÝList–¦fuser-de ned“v‘ÿdDariables.Ž¦‘9ÐóV‘ÿealid–?%patterns“are“the“same“as“describšMÞed“for“the“Þclear“Ýcommand“ab˜o•²!v“e.‘»rIf–?%no“patternsŽ¡‘9Ðóare–ø•supplied,‘M all“symš²!bMÞols“from“the“giv˜en“category“are“listed.‘ÔiBy“default,‘M only“userŽ¡‘9Ðóde ned–¦ffunctions“and“v‘ÿdDariables“visible“in“the“lošMÞcal“scop˜e“are“displa•²!y“ed.ŽŸ²¿‘9ÐóThe–¦fcommand“Þwhos“Ýis“equiv‘ÿdDalen²!t“to“Þwho“-longÝ.Ž¦Þexist‘¦f(áname‘Þ)Ž¡‘9ÐóÝReturn–uì1“if“the“name“exists“as“a“v‘ÿdDariable,‘žand“2“if“the“name“(after“appMÞending“`Þ.mÝ')“is“aŽ¡‘9Ðófunction–¦f le“in“the“path.‘ÝÝOtherwise,“return“0.ŽŽŸŒ‹KíŸòÝChapter–¦f27:‘ÝÝProgramming“Utilities’ÒJ157ŽŽŽ ƒ3Ú ý¨ðÐÞerror‘¦f(ámsg‘ðÞ)Ž¤‘9ÐóÝPrinš²!t–:.the“message“ámsgÝ,‘Ÿ pre xed“b˜y“the“string“`Þerror:‘¦fÝ',‘Ÿ and“set“Octa˜v˜e's“in˜ternalŽ¡‘9Ðóerror–õzstate“sucš²!h“that“con˜trol“will“return“to“the“top“lev˜el“without“ev‘ÿdDaluating“an˜y“moreŽ¡‘9Ðócommands.‘ÝÝThis–¦fis“useful“for“abMÞorting“from“functions.Ž©·ñ‘9ÐóIf–‘=ámsg‘UÝdoMÞes“not“end“with“a“new“line“c•²!haracter,‘•yOcta“v“e–‘=will“prinš²!t“a“tracebac˜k“of“all“theŽ¡‘9Ðófunction–¦fcalls“leading“to“the“error.‘ÝÝF‘ÿeor“example,ŽŸ·ñ‘V¹HÞfunction–¿ªf“()“g“()“endŽ¤ ‘V¹Hfunction–¿ªg“()“h“()“endŽ¡‘V¹Hfunction–¿ªh“()“nargin“==“1“||“error“("nargin“!=“1");“endŽ¡‘V¹Hf‘¿ª()Ž¡‘V¹Herror:–¿ªnargin“!=“1Ž¡‘V¹Herror:–¿ªevaluating“index“expression“near“line“1,“column“30Ž¡‘V¹Herror:–¿ªevaluating“binary“operator“`||'“near“line“1,“column“27Ž¡‘V¹Herror:–¿ªcalled“from“`h'Ž¡‘V¹Herror:–¿ªcalled“from“`g'Ž¡‘V¹Herror:–¿ªcalled“from“`f'Ž¦‘9ÐóÝproMÞduces–RÖa“list“of“messages“that“can“help“yš²!ou“to“quic˜kly“lošMÞcate“the“exact“lo˜cation“ofŽ¤‘9Ðóthe‘¦ferror.Ž¦‘9ÐóIf–;1ámsg›+IÝends“in“a“new“line“c•²!haracter,‘`cOcta“v“e–;1will“only“prin²!t“ámsg˜Ýand“will“not“displa²!yŽ¡‘9Ðóan•²!y›ËÄtracebac“k˜messages˜as˜it˜returns˜con“trol˜to˜the˜top˜lev“el.‘MöF‘ÿeor˜example,‘ÕmoMÞdifyingŽ¡‘9Ðóthe–ÑÍerror“message“in“the“previous“example“to“end“in“a“new“line“causes“Octa•²!v“e–ÑÍto“onlyŽ¡‘9Ðóprin²!t–¦fa“single“message:ŽŸ·ñ‘V¹HÞfunction–¿ªh“()“nargin“==“1“||“error“("nargin“!=“1\n");“endŽ¤ ‘V¹Hf‘¿ª()Ž¡‘V¹Herror:–¿ªnargin“!=“1Ž¤oâwarning‘¦f(ámsg‘ðÞ)Ž©‘9ÐóÝPrinš²!t–¦fthe“message“ámsg‘–~Ýpre xed“b˜y“the“string“`Þwarning:“Ý'.Ž¡Þusage‘¦f(ámsg‘ðÞ)Ž¦‘9ÐóÝPrinš²!t–:.the“message“ámsgÝ,‘Ÿ pre xed“b˜y“the“string“`Þusage:‘¦fÝ',‘Ÿ and“set“Octa˜v˜e's“in˜ternalŽ¦‘9Ðóerror–õzstate“sucš²!h“that“con˜trol“will“return“to“the“top“lev˜el“without“ev‘ÿdDaluating“an˜y“moreŽ¦‘9Ðócommands.‘ÝÝThis–¦fis“useful“for“abMÞorting“from“functions.ŽŸ·ñ‘9ÐóAfter–n¥Þusage“Ýis“ev‘ÿdDaluated,‘yÌOcta•²!v“e–n¥will“prinš²!t“a“tracebac˜k“of“all“the“function“calls“leadingŽ¦‘9Ðóto–¦fthe“usage“message.Ž¡Þperror–¦f(ánameÞ,“án²!umÞ)Ž¦‘9ÐóÝPrinš²!t–·—the“error“message“for“function“áname‘TžÝcorrespMÞonding“to“the“error“n˜um˜bMÞer“án˜umÝ.Ž¦‘9ÐóThis–·/function“is“inš²!tended“to“bMÞe“used“to“prin˜t“useful“error“messages“for“those“functionsŽ¦‘9Ðóthat–¦freturn“n²!umeric“error“coMÞdes.Ž¡Þmenu–¦f(átitleÞ,“áopt1Þ,“.–Ó1.“.)Ž¦‘9ÐóÝPrinš²!t–'1a“title“string“follo˜w˜ed“b˜y“a“series“of“options.‘`>Eac˜h“option“will“bMÞe“prin˜ted“alongŽ¦‘9Ðówith–êa“n•²!um“bšMÞer.‘§ The–êreturn“v‘ÿdDalue“is“the“n•²!um“b˜er–êof“the“option“selected“b²!y“the“user.‘§ ThisŽ¦‘9Ðófunction–©åis“useful“for“in•²!teractiv“e–©åprograms.‘èYThere“is“no“limit“to“the“n•²!um“bMÞer–©åof“optionsŽŽŸŒ‹žW)ŸòÝ158’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБ9Ðóthat–¦îmaš²!y“bMÞe“passed“in,‘§but“it“ma˜y“bMÞe“confusing“to“presen˜t“more“than“will“ t“easily“onŽ¤‘9Ðóone‘¦fscreen.Ž©Þdocument‘¦fásym²!bMÞol‘¸textŽ¡‘9ÐóÝSet–¦fthe“doMÞcumenš²!tation“string“for“ásym˜bMÞol‘¸Ýto“átextÝ.Ž¦Þfile_in_path–¦f(ápathÞ,“á le‘Þ)Ž¡‘9ÐóÝReturn–Mthe“absolute“name“name“of“á le‘¼TÝif“it“can“bMÞe“found“in“ápathÝ.‘H“The“v‘ÿdDalue“of“ápathŽ¡‘9ÐóÝshould–‹bšMÞe“a“colon-separated“list“of“directories“in“the“format“describ˜ed“for“the“built-inŽ¡‘9Ðóv‘ÿdDariable‘¦fÞLOADPATHÝ.ŽŸ‘9ÐóIf–¦fthe“ le“cannot“bMÞe“found“in“the“path,“an“empt²!y“matrix“is“returned.‘ÝÝF‘ÿeor“example,Ž¡‘V¹HÞoctave:13>–¿ªfile_in_path“(LOADPATH,“"nargchk.m")ŽŸ ‘V¹Hans–¿ª=“/usr/local/lib/octave/1.1.0/m/general/nargchk.mŽ¦nargchk–¦f(ánargin_minÞ,“ánargin_maxÞ,“ánÞ)Ž¡‘9ÐóÝIf–%…án“Ýis“in“the“range“ánargin‘¨/‰x³HøŽ›ñ'min“Ýthrough“ánargin‘¨/‰x³HøŽ˜max‘æäÝinclusivš²!e,‘?Kreturn“the“empt˜y“matrix.Ž¡‘9ÐóOtherwise,–¦freturn“a“message“indicating“whether“án“Ýis“tošMÞo“large“or“to˜o“small.ŽŸ‘9ÐóThis–›is“useful“for“c•²!hec“king–›to“see“that“the“n•²!um“bMÞer–›of“argumen²!ts“supplied“to“a“functionŽ¡‘9Ðóis–¦fwithin“an“acceptable“range.Ž¦Þoctave_tmp_file_nameŽ¡‘9ÐóÝReturn–¦fa“unique“tempMÞorary“ le“name.ŽŸ‘9ÐóSince–á¸the“named“ le“is“not“opMÞened,›ðŒb²!y“Þoctave_tmp_file_nameÝ,˜it“is“pMÞossible“(thoughŽ¡‘9Ðórelativ•²!ely›ªdunlik“ely)˜that˜it˜will˜not˜bMÞe˜a“v‘ÿdDailable˜b“y˜the˜time˜y“our˜program˜attempts˜toŽ¡‘9ÐóopMÞen‘¦fit.Ž¦Þtype‘¦fáname‘CmÞ...Ž¡‘9ÐóÝDisplaš²!y–¦fthe“de nition“of“eac˜h“áname‘CmÝthat“refers“to“a“function.Ž©‘9ÐóCurren•²!tly›ÿe,‘ðƒOcta“v“e–á°can“only“displa²!y“functions“that“can“bMÞe“compiled“cleanly˜,‘ðƒbMÞecause“itŽ¡‘9Ðóuses–¦fits“inš²!ternal“represen˜tation“of“the“function“to“recreate“the“program“text.Ž¦‘9ÐóCommenš²!ts–<™are“not“displa˜y˜ed“bMÞecause“Octa˜v˜e's“curren˜tly“discards“them“as“it“con˜v˜ertsŽ¡‘9Ðóthe–º-text“of“a“function“ le“to“its“inš²!ternal“represen˜tation.‘2This“problem“ma˜y“bMÞe“ xed“inŽ¡‘9Ðóa–¦ffuture“release.ŽŸÞwhich‘¦fáname‘CmÞ...Ž¡‘9ÐóÝDisplaš²!y–the“t˜ypMÞe“of“eac˜h“ánameÝ.‘ûSIf“áname‘¢”Ýis“de ned“from“a“function“ le,‘Wthe“full“nameŽ¡‘9Ðóof–¦fthe“ le“is“also“displa•²!y“ed.ŽŽŸŒ‹ŸbˆŸòÝChapter‘¦f28:‘ÝÝAm•²!usemen“ts’K4û159ŽŽŽ ƒ3Ú ý¨ðÐè28‘ ¸QAm–ÿuÂusemen“tsŽŽŸ ‘ÝOcta•²!v“e–7ƒcannot“promise“that“yš²!ou“will“actually“win“the“lotto,‘[Êbut“it“can“pic˜k“y˜our“n˜um˜bMÞers“forŽŸyš²!ou.‘ÝÝThe–¦ffunction“Þtexas_lotto“Ýwill“select“six“n˜um˜bšMÞers“b˜et•²!w“een–¦f1“and“50.Ž¤‘The–¦ffunction“Þlist_primes“(ánÞ)“Ýuses“a“brute-force“algorithm“to“compute“the“ rst“án“Ýprimes.Ž¡‘Other–¦fam²!using“functions“include“ÞcasesenÝ,“ÞflopsÝ,“ÞsombreroÝ,“ÞexitÝ,“and“ÞquitÝ.ŽŽŸŒ‹ kÁŸòÝ160’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹¡möŸòÝAppMÞendix–¦fA:“Installing“Octa•²!v“e’2©161ŽŽŽ ƒ3Ú ý¨ðÐèApp‘Š=endix–¦MA‘ ¸QInstalling“Octa–ÿuÂv“eŽŽŸ$‘ÝHere–µåis“the“proMÞcedure“for“installing“Octa•²!v“e–µåfrom“scratc²!h“on“a“Unix“system.‘ [F‘ÿeor“instructions“onŽ¤hoš²!w–‚äto“install“the“binary“distributions“of“Octa˜v˜e,›‰þsee“Section“A.2“[Binary“Distributions],˜page“165.ŽŸ‘ú‘厑®dÝRun–9äthe“shell“script“`ÞconfigureÝ'.‘¹²This“will“determine“the“features“y²!our“system“has“(or“doMÞesn'tŽ¡‘®dha•²!v“e)–¦fand“create“a“ le“named“Makš²!e le“from“eac˜h“of“the“ les“named“Mak˜e le.in.ŽŸÉ‘®dHere– Üis“a“summary“of“the“con gure“options“that“are“most“frequenš²!tly“used“when“building“Octa˜v˜e:Ž©’‘®dÞ--prefix=ápre xŽ¡‘OWÝInstall›qOcta•²!v“e˜in˜sub•MÞdirectories˜b“elo²!w˜ápre xÝ.‘ BþThe˜default˜v‘ÿdDalue˜of˜ápre x‘ÞÐÝisŽ¡‘OW`Þ/usr/localÝ'.Ž¦‘®dÞ--srcdir=ádirŽ¡‘OWÝLoMÞok–¦ffor“Octa•²!v“e–¦fsources“in“the“directory“ádirÝ.Ž¦‘®dÞ--with-f2cŽ¡‘OWÝUse–¦ff2c“evš²!en“if“F‘ÿeortran“compiler“is“a˜v‘ÿdDailable.Ž¦‘®dÞ--enable-dldŽ¡‘OWÝUse–ð DLD‘ïÝto“makš²!e“Octa˜v˜e“capable“of“dynamically“linking“externally“compiled“func-Ž¡‘OWtions.‘ÝÝThis–¦fonly“wš²!orks“on“systems“that“ha˜v˜e“a“w˜orking“pMÞort“of“DLD.Ž¦‘®dÞ--enable-lite-kernelŽ¡‘OWÝCompile–¢smaller“kš²!ernel.‘ ’This“curren˜tly“requires“DLD‘Fso“that“Octa˜v˜e“can“loadŽ¡‘OWfunctions–¦fat“run“time“that“are“not“loaded“at“compile“time.Ž¦‘®dÞ--helpŽŽ‘OWÝPrinš²!t–¦fa“summary“of“the“options“recognized“b˜y“the“con gure“script.Ž¦‘®dSee–‘the“ le“INST‘ÿeALL‘mfor“more“information“abMÞout“the“command“line“options“used“b²!y“con gure.Ž¡‘®dThat–~ le“also“con²!tains“instructions“for“compiling“in“a“directory“other“than“where“the“source“isŽ¡‘®dloMÞcated.Ž¤É‘ú‘厑®dÝRun‘¦fmak²!e.Ž¡‘®dY‘ÿeou–rwill“need“a“recenš²!t“v˜ersion“of“GNU‘Nmak˜e.‘®ŒMoMÞdifying“Octa˜v˜e's“Mak˜e les“to“w˜ork“with“otherŽ¤‘®dmakš²!e–Òprograms“is“probably“not“w˜orth“y˜our“time.‘"W‘ÿee“recommend“y˜ou“get“and“compile“GNUŽ¡‘®dmak²!e‘¦finstead.Ž©É‘®dF‘ÿeor–µšplotting,‘¹gyš²!ou“will“need“to“ha˜v˜e“gn˜uplot“installed“on“y˜our“system.‘ yGn˜uplot“is“a“command-Ž¡‘®ddriv•²!en›qCin“teractiv“e˜function˜plotting˜program.‘Ì'Gn“uplot˜is˜cop“yrigh“ted,‘{äbut˜freely˜distributable.Ž¡‘®dThe–,`gnš²!u'“in“gn˜uplot“is“a“coincidence|it“is“not“related“to“the“GNU›&pro‘›»ject“or“the“FSF˜in“an²!yŽ¡‘®dbut–¦fthe“most“pMÞeripheral“sense.Ž¦‘®dF‘ÿeor–J•vš²!ersion“1.1.0,‘\òy˜ou“m˜ust“ha˜v˜e“the“GNU‘J~CÞ++“Ýcompiler“(gcc)“v˜ersion“2.6.3“or“later“to“compileŽ¡‘®dOcta•²!v“e.›Ï Þplot–¿ªsin“(x),“sin“(x),“sin“(x),“...“lots“more“...,“sin“(x)Ž¦‘®dÝand‘¦fthenŽ¡‘> Þreplot–¿ªsin“(x),“sin“(x),“sin“(x),“...“lots“more“...,“sin“(x)Ž¦‘®dÝafter–¦frepMÞeating“the“replot“command“a“few“times,“gnš²!uplot“will“giv˜e“y˜ou“an“error.Ž¦‘®dAlso,‘6©it–ºdoMÞesn't“help“to“use“bacš²!kslashes“to“en˜ter“a“plot“command“o˜v˜er“sev˜eral“lines,‘6©bMÞecause“theŽ¤‘®dlimit–V…is“on“the“o•²!v“erall–V…command“line“length,‘fonce“the“bac²!kslashed“lines“are“all“pasted“together.Ž¦‘®dBecause–âof“this,‘Octa•²!v“e–âtries“to“use“as“little“of“the“command-line“length“as“pMÞossible“b²!y“usingŽ¡‘®dthe–µshortest“pMÞossible“abbreviations“for“all“the“plot“commands“and“options.‘õÉUnfortunately‘ÿe,Ž¡‘®dthe–3Žlength“of“the“tempMÞorary“ le“names“is“probably“what“is“taking“up“the“most“space“on“theŽ¡‘®dcommand‘¦fline.ŽŽŸŒ‹¨®ŸòÝ168’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБ®dY‘ÿeou–Hcan“buy“a“little“bit“of“command“line“space“bš²!y“setting“the“en˜vironmen˜t“v‘ÿdDariable“ÞTMPDIR“Ýto“bMÞeŽ¤‘®dÞ"Ý.Þ"–|/ÝbMÞefore“starting“Octa•²!v“e,‘„ or›|/y“ou˜can˜increase˜the˜maxim“um˜command˜line˜length˜in˜gn“uplotŽ¡‘®db•²!y›ÕÆc“hanging˜the˜follo“wing˜limits˜in˜the˜ le˜plot.h˜in˜the˜gn“uplot˜distribution˜and˜recompilingŽ¡‘®dgn²!uplot.ŽŸ÷‘2–¹Þ#define–¿ªMAX_LINE_LEN“32768‘ T/*“originally“1024“*/ŽŸ ‘2–¹#define–¿ªMAX_TOKENS“8192‘¾R/*“originally“400“*/Ž©÷‘®dÝOf–V®course,›‚¿this“doMÞesn't“really“ x“the“problem,˜but“it“doMÞes“makš²!e“it“m˜uc˜h“less“lik˜ely“that“y˜ouŽ¡‘®dwill–¦frun“inš²!to“trouble“unless“y˜ou“are“putting“a“v˜ery“large“n˜um˜bMÞer“of“lines“on“a“giv˜en“plot.Ž¦‘ú‘厑®dÝString–¦fhandling“could“use“some“w²!ork.ŽŸ+î‘A‘MÑlist–Müof“ideas“for“future“enhancemenš²!ts“is“distributed“with“Octa˜v˜e.‘ÔžSee“the“ le“`ÞPROJECTSÝ'“inŽ¡the–¦ftop“lev²!el“directory“in“the“source“distribution.ŽŸ WÝëEB.2‘™Reps3orting‘¦MBugsŽŽŸ÷‘ÝY‘ÿeour–¦fbug“repMÞorts“plaš²!y“an“essen˜tial“role“in“making“Octa˜v˜e“reliable.Ž©÷‘When–.+yš²!ou“encoun˜ter“a“problem,‘the“ rst“thing“to“do“is“to“see“if“it“is“already“kno˜wn.‘ u,SeeŽ¡AppMÞendix–¦fB“[T‘ÿerouble],“page“167.‘ÝÝIf“it“isn't“knoš²!wn,“then“y˜ou“should“repMÞort“the“problem.Ž¦‘RepMÞorting–Oa“bug“maš²!y“help“y˜ou“b˜y“bringing“a“solution“to“y˜our“problem,‘6 or“it“ma˜y“not.‘6˜In“an˜yŽ¡case,‘€0the–T¢principal“function“of“a“bug“repMÞort“is“to“help“the“enš²!tire“comm˜unit˜y“b˜y“making“the“nextŽ¡vš²!ersion–¦fof“Octa˜v˜e“w˜ork“bšMÞetter.‘ÝÝBug“rep˜orts“are“yš²!our“con˜tribution“to“the“main˜tenance“of“Octa˜v˜e.Ž¦‘In–â\order“for“a“bug“repšMÞort“to“serv²!e“its“purp˜ose,‘ñZyš²!ou“m˜ust“include“the“information“that“mak˜es“itŽ¡pMÞossible–¦fto“ x“the“bug.Ž¦‘If–.yš²!ou“ha˜v˜e“Octa˜v˜e“w˜orking“at“all,‘Oéthe“easiest“w˜a˜y“to“prepare“a“complete“bug“repMÞort“is“to“useŽ¡the›hOcta•²!v“e˜function˜Þbug_reportÝ.‘6âWhen˜y“ou˜execute˜this˜function,‘6(Octa“v“e˜will˜prompt˜y“ou˜for˜aŽ¡sub‘›»ject–Land“then“in•²!v“ok“e–Lthe“editor“on“a“ le“that“already“con²!tains“all“the“con guration“information.Ž¡When–¦fyš²!ou“exit“the“editor,“Octa˜v˜e“will“mail“the“bug“repMÞort“for“y˜ou.ŽŸ WÝëEB.3‘™Ha•ŒÌv“e–¦MY›þ¦fou“F˜ound“a“Bug?ŽŽŸ÷‘ÝIf–¦fyš²!ou“are“not“sure“whether“y˜ou“ha˜v˜e“found“a“bug,“here“are“some“guidelines:ŽŸ+î‘ú‘厑®dÝIf›n-Octa•²!v“e˜gets˜a˜fatal˜signal,‘ylfor˜an“y˜input˜whatev“er,‘ylthat˜is˜a˜bug.‘Ë Reliable˜in“terpreters˜nev“erŽ¡‘®dcrash.Ž¤÷‘ú‘厑®dÝIf›¦fOcta•²!v“e˜proMÞduces˜incorrect˜results,˜for˜an“y˜input˜whatev“er,˜that˜is˜a˜bug.Ž¡‘ú‘厑®dÝSome–Ýçoutput“ma²!y“appšMÞear“to“b˜e“incorrect“when“it“is“in“fact“due“to“a“program“whose“b˜eha²!viorŽ¤‘®dis–~unde ned,‘´ whicš²!h“happMÞened“b˜y“c˜hance“to“giv˜e“the“desired“results“on“another“system.‘eF‘ÿeorŽ¡‘®dexample,‘‡Pthe–ZUrange“opšMÞerator“ma²!y“pro˜duce“di eren²!t“results“b˜ecause“of“di erences“in“the“w•²!a“yŽ¡‘®d oating–¦fpMÞoin²!t“arithmetic“is“handled“on“v‘ÿdDarious“systems.ŽŸ÷‘ú‘厑®dÝIf›¦fOcta•²!v“e˜proMÞduces˜an˜error˜message˜for˜v‘ÿdDalid˜input,˜that˜is˜a˜bug.ŽŽŸŒ‹©ºŸòÝAppMÞendix–¦fB:“Knoš²!wn“Causes“of“T‘ÿerouble“with“Octa˜v˜e’Ë›à169ŽŽŽ ƒ3Ú ý¨ðБú‘厑®dÝIf›QÈOcta•²!v“e˜do•MÞes˜not˜pro“duce˜an˜error˜message˜for˜in•²!v‘ÿdDalid˜input,‘| that˜is˜a˜bug.‘àHo“w“ev“er,‘| y“ouŽ¤‘®dshould–“þnote“that“yš²!our“idea“of“\in˜v‘ÿdDalid“input"“migh˜t“bMÞe“m˜y“idea“of“\an“extension"“or“\suppMÞortŽ¡‘®dfor–¦ftraditional“practice".ŽŸ)8‘ú‘厑®dÝIf–§—yš²!ou“are“an“expMÞerienced“user“of“programs“lik˜e“Octa˜v˜e,‘§ãy˜our“suggestions“for“impro˜v˜emen˜t“areŽ¡‘®dwš²!elcome–¦fin“an˜y“case.ŽŸ$¤âëEB.4‘™Where–¦Mto“Reps3ort“BugsŽŽŸ)8‘ÝIf–.yš²!ou“ha˜v˜e“Octa˜v˜e“w˜orking“at“all,‘Oéthe“easiest“w˜a˜y“to“prepare“a“complete“bug“repMÞort“is“to“useŽ¡the›hOcta•²!v“e˜function˜Þbug_reportÝ.‘6âWhen˜y“ou˜execute˜this˜function,‘6(Octa“v“e˜will˜prompt˜y“ou˜for˜aŽ¡sub‘›»ject–Land“then“in•²!v“ok“e–Lthe“editor“on“a“ le“that“already“con²!tains“all“the“con guration“information.Ž¡When–¦fyš²!ou“exit“the“editor,“Octa˜v˜e“will“mail“the“bug“repMÞort“for“y˜ou.Ž©)8‘If–ÿðfor“some“reason“yš²!ou“cannot“use“Octa˜v˜e's“Þbug_report“Ýfunction,‘Rsend“bug“repMÞorts“for“Octa˜v˜eŽ¡to:ŽŸ)8‘èUÞbug-octave@che.utexas.eduŽ¦‘ßDo–'xnot“send“bug“repMÞorts“to“`Þhelp-octaveß'Ý.‘aMost“users“of“Octa•²!v“e–'xdo“not“w•²!an“t–'xto“receiv²!e“bugŽ¡repMÞorts.‘ÝÝThose–¦fthat“do“ha•²!v“e›¦fask“ed˜to˜bMÞe˜on˜`Þbug-octaveÝ'.Ž¦‘As–¦fa“last“resort,“send“bug“repšMÞorts“on“pap˜er“to:ŽŸ)8‘èUÞOctave–¿ªBugs“c/o“John“W.“EatonŽ¤ ‘èUDepartment–¿ªof“Chemical“EngineeringŽ¡‘èUThe–¿ªUniversity“of“Texas“at“AustinŽ¡‘èUAustin,–¿ªTexas“78712ŽŸ$¤âëEB.5‘™HoŒÌw–¦Mto“Reps3ort“BugsŽŽŸ)8‘ÝThe–r›fundamen²!tal“principle“of“repšMÞorting“bugs“usefully“is“this:‘Ã÷ßrep˜ort“all“the“factsÝ.‘Ì™If“y²!ou“are“notŽ¤sure–¦fwhether“to“state“a“fact“or“lea•²!v“e–¦fit“out,“state“it!Ž¦‘Often–ÐápšMÞeople“omit“facts“b˜ecause“they“think“they“kno²!w“what“causes“the“problem“and“they“con-Ž¡clude–ç?that“some“details“don't“matter.‘ gTh•²!us,‘÷uy“ou›ç?migh“t˜assume˜that˜the˜name˜of˜the˜v‘ÿdDariable˜y“ouŽ¡use–GÓin“an“example“došMÞes“not“matter.‘Â$W‘ÿeell,‘p.probably“it“do˜esn't,‘p.but“one“cannot“b˜e“sure.‘Â$P²!erhapsŽ¡the–´"bug“is“a“straš²!y“memory“reference“whic˜h“happMÞens“to“fetc˜h“from“the“loMÞcation“where“that“name“isŽ¡stored–j·in“memory;‘~œpMÞerhaps,‘v§if“the“name“wš²!ere“di eren˜t,‘v§the“con˜ten˜ts“of“that“loMÞcation“w˜ould“foMÞol“theŽ¡in•²!terpreter›a³in“to˜doing˜the˜righ“t˜thing˜despite˜the˜bug.‘ÄPla“y˜it˜safe˜and˜giv“e˜a˜spMÞeci c,‘†completeŽ¡example.Ž¦‘Keep–ûŸin“mind“that“the“purpšMÞose“of“a“bug“rep˜ort“is“to“enable“someone“to“ x“the“bug“if“it“is“notŽ¡kno•²!wn.‘ÝÝAlw“a“ys–¦fwrite“yš²!our“bug“repMÞorts“on“the“assumption“that“the“bug“is“not“kno˜wn.Ž¦‘Sometimes–ŸpMÞeople“givš²!e“a“few“sk˜etc˜h˜y“facts“and“ask,‘-\DošMÞes“this“ring“a“b˜ell?"‘øˆThis“cannot“helpŽ¡us–¦f x“a“bug.‘ÝÝIt“is“bšMÞetter“to“send“a“complete“bug“rep˜ort“to“b˜egin“with.ŽŽŸŒ‹ªÆÒŸòÝ170’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБT‘ÿery–àto“makš²!e“y˜our“bug“repMÞort“self-con˜tained.‘GJIf“w˜e“ha˜v˜e“to“ask“y˜ou“for“more“information,‘<þit“isŽ¤bMÞest–+ if“yš²!ou“include“all“the“previous“information“in“y˜our“respMÞonse,‘LNas“w˜ell“as“the“information“thatŽ¡w²!as‘¦fmissing.Ž¤‘T‘ÿeo–¦fenable“someone“to“in•²!v“estigate–¦fthe“bug,“y²!ou“should“include“all“these“things:Ž¡‘ú‘厑®dÝThe–0yvš²!ersion“of“Octa˜v˜e.‘|Y‘ÿeou“can“get“this“b˜y“noting“the“v˜ersion“n˜um˜bMÞer“that“is“prin˜ted“whenŽ©‘®dOcta•²!v“e–¦fstarts,“or“running“it“with“the“`Þ-vÝ'“option.Ž¤ïò‘ú‘厑®dÝA–¦fcomplete“input“ le“that“will“reproMÞduce“the“bug.Ž¡‘®dA‘ojsingle–oxstatemenš²!t“ma˜y“not“bMÞe“enough“of“an“example|the“bug“migh˜t“depMÞend“on“other“detailsŽ¦‘®dthat–¦fare“missing“from“the“single“statemen²!t“where“the“error“ nally“oMÞccurs.Ž¡‘ú‘厑®dÝThe–ãRcommand“argumenš²!ts“y˜ou“ga˜v˜e“Octa˜v˜e“to“execute“that“example“and“observ˜e“the“bug.‘” T‘ÿeoŽ¦‘®dguaran•²!tee›¦fy“ou˜w“on't˜omit˜something˜impMÞortan“t,˜list˜all˜the˜options.Ž¡‘®dIf–²8wš²!e“w˜ere“to“try“to“guess“the“argumen˜ts,‘µ,w˜e“w˜ould“probably“guess“wrong“and“then“w˜e“w˜ouldŽ¦‘®dnot–¦fencoun²!ter“the“bug.Ž¡‘ú‘厑®dÝThe–¦ftš²!ypMÞe“of“mac˜hine“y˜ou“are“using,“and“the“opMÞerating“system“name“and“v˜ersion“n˜um˜bMÞer.Ž¡‘ú‘厑®dÝThe–†ecommand-line“argumenš²!ts“y˜ou“ga˜v˜e“to“the“Þconfigure“Ýcommand“when“y˜ou“installed“theŽ¦‘®din²!terpreter.Ž¡‘ú‘厑®dÝA–¦fcomplete“list“of“anš²!y“moMÞdi cations“y˜ou“ha˜v˜e“made“to“the“in˜terpreter“source.Ž¡‘®dBe–¦fprecise“abMÞout“these“c•²!hanges|sho“w–¦fa“con²!text“di “for“them.Ž¡‘ú‘厑®dÝDetails–¦fof“anš²!y“other“deviations“from“the“standard“proMÞcedure“for“installing“Octa˜v˜e.Ž¡‘ú‘厑®dÝA‘çdescription–ç.of“what“bMÞehaš²!vior“y˜ou“observ˜e“that“y˜ou“bMÞeliev˜e“is“incorrect.‘ 4F‘ÿeor“example,‘÷_Þ"ÝTheŽ¦‘®din²!terpreter–¦fgets“a“fatal“signal,Þ"“Ýor,“Þ"ÝThe“output“proMÞduced“at“line“208“is“incorrect.Þ"Ž¡‘®dÝOf–ò…course,›Œif“the“bug“is“that“the“in²!terpreter“gets“a“fatal“signal,˜then“one“can't“miss“it.‘Â9But“ifŽ¦‘®dthe–¦fbug“is“incorrect“output,“wš²!e“migh˜t“not“notice“unless“it“is“glaringly“wrong.Ž¡‘®dEvš²!en–cšif“the“problem“y˜ou“expMÞerience“is“a“fatal“signal,‘pöy˜ou“should“still“sa˜y“so“explicitly‘ÿe.‘Ç™SuppMÞoseŽ¦‘®dsomething–ustrange“is“going“on,›¨Æsuc²!h“as,˜yš²!our“cop˜y“of“the“in˜terpreter“is“out“of“sync˜h,‘¨Æor“y˜ouŽ¦‘®dha•²!v“e›{encoun“tered˜a˜bug˜in˜the˜C‘{library˜on˜y“our˜system.‘ÏoY‘ÿeour˜cop“y˜migh“t˜crash˜and˜the˜cop“yŽ¦‘®dhere–Qßwš²!ould“not.‘Á°If“y˜ou“said“to“expMÞect“a“crash,‘bÇthen“when“the“in˜terpreter“here“fails“to“crash,‘bÇw˜eŽ¦‘®dw•²!ould›÷kno“w˜that˜the˜bug˜w“as˜not˜happMÞening.‘£jIf˜y“ou˜don't˜sa“y˜to˜expMÞect˜a˜crash,‘then˜w“e˜w“ouldŽ¦‘®dnot–Mknoš²!w“whether“the“bug“w˜as“happMÞening.‘ÀW‘ÿee“w˜ould“not“bMÞe“able“to“dra˜w“an˜y“conclusion“fromŽ¦‘®dour‘¦fobserv‘ÿdDations.Ž¡‘®dOften–kòthe“observš²!ed“symptom“is“incorrect“output“when“y˜our“program“is“run.‘.€Unfortunately‘ÿe,Ž¦‘®dthis–Z5is“not“enough“information“unless“the“program“is“short“and“simple.‘ÄwIt“is“vš²!ery“helpful“if“y˜ouŽ¦‘®dcan–¦finclude“an“explanation“of“the“expMÞected“output,“and“wh²!y“the“actual“output“is“incorrect.Ž¡‘ú‘厑®dÝIf– ,yš²!ou“wish“to“suggest“c˜hanges“to“the“Octa˜v˜e“source,‘!Ýsend“them“as“con˜text“di s.‘.If“y˜ou“ev˜enŽ¦‘®ddiscuss–4¹something“in“the“Octa•²!v“e–4¹source,‘Kurefer“to“it“bš²!y“con˜text,‘Kunot“b˜y“line“n˜um˜b•MÞer,‘Kub“ecause‘4¹theŽ¦‘®dline›¦fn•²!um“bMÞers˜in˜the˜dev“elopmen“t˜sources˜probalb“y˜w“on't˜matc“h˜those˜in˜y“our˜sources.ŽŸïò‘Here–¦fare“some“things“that“are“not“necessary:ŽŽŸŒ‹«Ò½ŸòÝAppMÞendix–¦fB:“Knoš²!wn“Causes“of“T‘ÿerouble“with“Octa˜v˜e’Ë›à171ŽŽŽ ƒ3Ú ý¨ðБú‘厑®dÝA–¦fdescription“of“the“en•²!v“elopMÞe–¦fof“the“bug.Ž©ó‘®dOften–opšMÞeople“who“encoun²!ter“a“bug“sp˜end“a“lot“of“time“in•²!v“estigating›owhic“h˜c“hanges˜to˜the˜inputŽ¤‘®d le–Öwill“makš²!e“the“bug“go“a˜w˜a˜y“and“whic˜h“c˜hanges“will“not“a ect“it.‘«­Suc˜h“information“is“usuallyŽ¡‘®dnot–ªQnecessary“to“enable“us“to“ x“bugs“in“Octa•²!v“e,‘ëKbut–ªQif“y²!ou“can“ nd“a“simpler“example“toŽ¡‘®drepšMÞort–~Xáinstead‘ìªÝof“the“original“one,‘†[that“is“a“con•²!v“enience.‘ЃErrors–~Xin“the“output“will“b˜e“easier“toŽ¡‘®dspMÞot,›ì”running–Þ‹under“the“debugger“will“tak²!e“less“time,˜etc.‘†KMost“Octa•²!v“e–Þ‹bugs“in•²!v“olv“e–Þ‹just“oneŽ¡‘®dfunction,‘Å&so–¾ÿthe“most“straigh•²!tforw“ard›¾ÿw“a“y˜to˜simplify˜an˜example˜is˜to˜delete˜all˜the˜functionŽ¡‘®dde nitions–¦fexcept“the“one“in“whic²!h“the“bug“oMÞccurs.Ž¦‘®dHo•²!w“ev“er,‘ûsimpli cation–õCis“not“vital;‘²if“yš²!ou“don't“w˜an˜t“to“do“this,‘ûrepMÞort“the“bug“an˜yw˜a˜y“andŽ¡‘®dsend–¦fthe“enš²!tire“test“case“y˜ou“used.Ž¦‘ú‘厑®dÝA–©¯patcš²!h“for“the“bug.‘ç¹P˜atc˜hes“can“bMÞe“helpful,‘ª‚but“if“y˜ou“ nd“a“bug,‘ª‚y˜ou“should“repMÞort“it,‘ª‚ev˜enŽ¡‘®dif–¦fy²!ou“cannot“send“a“ x“for“the“problem.ŽŸ&CÌëEB.6‘™Sending›¦MP•ŒÌatc“hes˜for˜Octa“v“eŽŽŸó‘ÝIf–]ìyš²!ou“w˜ould“lik˜e“to“write“bug“ xes“or“impro˜v˜emen˜ts“for“Octa˜v˜e,‘lkthat“is“v˜ery“helpful.‘Å´When“y˜ouŽ¡send–@Þyš²!our“c˜hanges,‘U-please“follo˜w“these“guidelines“to“a˜v˜oid“causing“extra“w˜ork“for“us“in“studying“theŽ¡patc²!hes.Ž©ó‘If–Køyš²!ou“don't“follo˜w“these“guidelines,‘^y˜our“information“migh˜t“still“bMÞe“useful,‘^but“using“it“will“tak˜eŽ¡extra›$™w•²!ork.‘XvMain“taining˜Octa“v“e˜is˜a˜lot˜of˜w“ork˜in˜the˜bMÞest˜of˜circumstances,‘D&and˜w“e˜can't˜k“eepŽ¡up–¦funless“yš²!ou“do“y˜our“bMÞest“to“help.Ž¦‘ú‘厑®dÝSend–„an“explanation“with“yš²!our“c˜hanges“of“what“problem“they“ x“or“what“impro˜v˜emen˜t“theyŽ¡‘®dbring–}abšMÞout.‘Ö:F‘ÿeor“a“bug“ x,‘”just“include“a“cop²!y“of“the“bug“rep˜ort,‘”and“explain“whš²!y“the“c˜hangeŽ¡‘®d xes–¦fthe“bug.Ž©ó‘ú‘厑®dÝAlw•²!a“ys–€include“a“propšMÞer“bug“rep˜ort“for“the“problem“yš²!ou“think“y˜ou“ha˜v˜e“ xed.‘jáW‘ÿee“need“toŽ¡‘®dcon•²!vince›VCourselv“es˜that˜the˜c“hange˜is˜righ“t˜bMÞefore˜installing˜it.‘íuEv“en˜if˜it˜is˜righ“t,‘‚:w“e˜migh“tŽ¡‘®dha•²!v“e–¦ftrouble“judging“it“if“wš²!e“don't“ha˜v˜e“a“w˜a˜y“to“reproMÞduce“the“problem.Ž¦‘ú‘厑®dÝInclude–œ¡all“the“commen²!ts“that“are“appropriate“to“help“pMÞeople“reading“the“source“in“the“futureŽ¡‘®dunderstand–¦fwhš²!y“this“c˜hange“w˜as“needed.Ž¦‘ú‘厑®dÝDon't–¦fmix“together“cš²!hanges“made“for“di eren˜t“reasons.‘ÝÝSend“them“áindividuallyÝ.Ž¦‘®dIf–½yš²!ou“mak˜e“t˜w˜o“c˜hanges“for“separate“reasons,‘/then“w˜e“migh˜t“not“w˜an˜t“to“install“them“bMÞoth.Ž¡‘®dW‘ÿee–¦fmighš²!t“w˜an˜t“to“install“just“one.Ž¦‘ú‘厑®dÝUse–`Þdiff‘¦f-cÝ'“to“makš²!e“y˜our“di s.‘¨Di s“without“con˜text“are“hard“for“us“to“install“reliably‘ÿe.‘¨MoreŽ¡‘®dthan–w‹that,‘«Óthey“makš²!e“it“hard“for“us“to“study“the“di s“to“decide“whether“w˜e“w˜an˜t“to“installŽ¡‘®dthem.‘ÝÝUnidi –¦fformat“is“bMÞetter“than“con²!textless“di s,“but“not“as“easy“to“read“as“`Þ-cÝ'“format.Ž¦‘®dIf–’Hyš²!ou“ha˜v˜e“GNU‘’Cdi ,›–Nuse“`Þdiff‘¦f-cpÝ',˜whicš²!h“sho˜ws“the“name“of“the“function“that“eac˜h“c˜hangeŽ¡‘®doMÞccurs‘¦fin.ŽŽŸŒ‹¬á•ŸòÝ172’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБú‘厑®dÝW‘ÿerite–¦fthe“cš²!hange“log“en˜tries“for“y˜our“c˜hanges.Ž©‘®dRead– the“`ÞChangeLogÝ'“ le“to“see“what“sorts“of“information“to“put“in,‘-aand“to“learn“the“st²!yle“thatŽ¤‘®dwš²!e–­0use.‘ò&output"ŽŽŸŒ‹±­ŸòÝAppMÞendix–¦fC:“Command“Line“Editing’²H177ŽŽŽ ƒ3Ú ý¨ðБs¡æIn–`the“abšMÞo•²!v“e–`example,‘nÞC-U“Ýis“b˜ound“to“the“function“Þuniversal-argumentÝ,Ž¤‘s¡æand–ŒxÞC-O“Ýis“bMÞound“to“run“the“macro“expressed“on“the“righ²!t“hand“side“(thatŽ¡‘s¡æis,–¦fto“insert“the“text“`Þ>&outputÝ'“in²!to“the“line).Ž©ÙÈ‘9ÐóÞ"ák²!eyseq@æÞ"Ý:‘ÝÝáfunction-name‘CmÝor‘¦fámacroŽŽ¡‘s¡ækš²!eyseq‘RÎÝdi ers–èfrom“ák˜eyname‘®ïÝabMÞo˜v˜e“in“that“strings“denoting“an“en˜tire“k˜eyŽ¡‘s¡æsequence–"can“bšMÞe“sp˜eci ed.‘±ÀSimply“place“the“k²!ey“sequence“in“double“quotes.Ž¡‘s¡æGNU–¦fEmacs“stš²!yle“k˜ey“escapšMÞes“can“b˜e“used,“as“in“the“follo²!wing“example:ŽŸlä’Š;Þ"\C-u":‘¿ªuniversal-argumentŽ¤ ’Š;"\C-x\C-r":‘¿ªre-read-init-fileŽ¡’Š;"\e[11~":–¿ª"Function“Key“1"ŽŸlä‘s¡æÝIn–¯the“abšMÞo•²!v“e–¯example,‘±?ÞC-U“Ýis“b˜ound“to“the“function“Þuniversal-argumentŽ¤‘s¡æÝ(just–tgas“it“w²!as“in“the“ rst“example),‘~gÞC-X‘¿ªC-R“Ýis“bMÞound“to“the“function“Þre-Ž¡‘s¡æread-init-fileÝ,‘˜and›•ÞESC–¿ª[“1“1“~˜Ýis˜bMÞound˜to˜insert˜the˜text˜`ÞFunctionŽ¡‘s¡æKey‘¦f1Ý'.ŽŸF­ëMC.8.1‘d(Commands–¦MF‘þÄ£or“Mo–ávingŽŽŸÙÈÞbeginning-of-line‘¦f(C-A)Ž¡‘9ÐóÝMo•²!v“e–¦fto“the“start“of“the“curren²!t“line.Ž¦Þend-of-line‘¦f(C-E)Ž¡‘9ÐóÝMo•²!v“e–¦fto“the“end“of“the“line.Ž¦Þforward-char‘¦f(C-F)Ž¡‘9ÐóÝMo•²!v“e›¦fforw“ard˜a˜c“haracter.Ž¦Þbackward-char‘¦f(C-B)Ž¡‘9ÐóÝMo•²!v“e›¦fbac“k˜a˜c“haracter.Ž¦Þforward-word‘¦f(M-F)Ž¡‘9ÐóÝMo•²!v“e›¦fforw“ard˜to˜the˜end˜of˜the˜next˜w“ord.Ž¦Þbackward-word‘¦f(M-B)Ž¡‘9ÐóÝMo•²!v“e›¦fbac“k˜to˜the˜start˜of˜this,˜or˜the˜previous,˜w“ord.Ž¦Þclear-screen‘¦f(C-L)Ž¡‘9ÐóÝClear–¦fthe“screen“leaš²!ving“the“curren˜t“line“at“the“top“of“the“screen.ŽŸF­ëMC.8.2‘d(Commands–¦MF‘þÄ£or“Manipulating“The“HistoryŽŽŸÙÈÞaccept-line–¦f(Newline,“Return)Ž¡‘9ÐóÝAccept–'the“line“regardless“of“where“the“cursor“is.‘³lIf“this“line“is“non-empt²!y‘ÿe,‘@‰add“it“to“theŽ¡‘9Ðóhistory–Ålist.‘øùIf“this“line“w²!as“a“history“line,‘\then“restore“the“history“line“to“its“originalŽ¡‘9Ðóstate.ŽŽŸŒ‹²$hŸòÝ178’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞprevious-history‘¦f(C-P)Ž¤‘9ÐóÝMo•²!v“e–¦f`up'“through“the“history“list.Ž©|Þnext-history‘¦f(C-N)Ž¡‘9ÐóÝMo•²!v“e›¦f`do“wn'˜through˜the˜history˜list.Ž¦Þbeginning-of-history‘¦f(M-<)Ž¡‘9ÐóÝMo•²!v“e–¦fto“the“ rst“line“in“the“history‘ÿe.Ž¦Þend-of-history‘¦f(M->)Ž¡‘9ÐóÝMo•²!v“e–¦fto“the“end“of“the“input“history‘ÿe,“i.e.,“the“line“yš²!ou“are“en˜tering!Ž¦Þreverse-search-history‘¦f(C-R)Ž¡‘9ÐóÝSearc•²!h›<@bac“kw“ard˜starting˜at˜the˜curren“t˜line˜and˜mo“ving˜`up'˜through˜the˜history˜asŽ¡‘9Ðónecessary‘ÿe.‘ÝÝThis–¦fis“an“incremenš²!tal“searc˜h.Ž¦Þforward-search-history‘¦f(C-S)Ž¡‘9ÐóÝSearc•²!h›}-forw“ard˜starting˜at˜the˜curren“t˜line˜and˜mo“ving˜`do“wn'˜through˜the˜the˜historyŽ¡‘9Ðóas‘¦fnecessary‘ÿe.ŽŸ|ëMC.8.3‘d(Commands–¦MF›þÄ£or“Changing“T˜extŽŽŸ> Þdelete-char‘¦f(C-D)Ž¡‘9ÐóÝDelete– the“c²!haracter“under“the“cursor.‘ËIf“the“cursor“is“at“the“bMÞeginning“of“the“line,Ž¡‘9Ðóand–l—there“are“no“cš²!haracters“in“the“line,‘x'and“the“last“c˜haracter“t˜ypMÞed“w˜as“not“ÞC-DÝ,‘x'thenŽ¡‘9Ðóreturn‘¦fEOF.Ž¦Þbackward-delete-char‘¦f(Rubout)Ž¡‘9ÐóÝDelete–Ÿ¹the“cš²!haracter“bMÞehind“the“cursor.‘†NA‘Ÿwn˜umeric“arg“sa˜ys“to“kill“the“c˜haracters“insteadŽ¡‘9Ðóof–¦fdeleting“them.Ž¦Þquoted-insert–¦f(C-Q,“C-V)Ž¡‘9ÐóÝAdd–"öthe“next“cš²!haracter“that“y˜ou“t˜ypMÞe“to“the“line“v˜erbatim.‘² This“is“ho˜w“to“insert“thingsŽ¡‘9Ðólik²!e–¦fÞC-Q“Ýfor“example.Ž¦Þtab-insert‘¦f(M-TAB)Ž¡‘9ÐóÝInsert–¦fa“tab“c²!haracter.Ž¦Þself-insert–¦f(a,“b,“A,“1,“!,“...)Ž¡‘9ÐóÝInsert‘¦fy²!ourself.Ž¦Þtranspose-chars‘¦f(C-T)Ž¡‘9ÐóÝDrag–2‚the“c²!haracter“bšMÞefore“p˜oinš²!t“forw˜ard“o˜v˜er“the“c˜haracter“at“pMÞoin˜t.‘ ‚2P˜oin˜t“mo˜v˜esŽ¡‘9Ðóforwš²!ard–C~as“w˜ell.‘µ$If“pMÞoin˜t“is“at“the“end“of“the“line,‘jÃthen“transpMÞose“the“t˜w˜o“c˜haractersŽ¡‘9Ðób•MÞefore›¦fp“oin•²!t.‘ÝÝNegativ“e˜args˜don't˜w“ork.Ž¦Þtranspose-words‘¦f(M-T)Ž¡‘9ÐóÝDrag–Ÿthe“wš²!ord“bMÞehind“the“cursor“past“the“w˜ord“in“fron˜t“of“the“cursor“mo˜ving“the“cursorŽ¡‘9Ðóo•²!v“er–¦fthat“wš²!ord“as“w˜ell.ŽŽŸŒ‹³,±ŸòÝAppMÞendix–¦fC:“Command“Line“Editing’²H179ŽŽŽ ƒ3Ú ý¨ðÐÞupcase-word‘¦f(M-U)Ž¤‘9ÐóÝUppMÞercase–Fthe“currenš²!t“(or“follo˜wing)“w˜ord.‘½¼With“a“negativ˜e“argumen˜t,‘YIdo“the“previousŽ¡‘9Ðówš²!ord,–¦fbut“do“not“mo˜v˜e“pMÞoin˜t.Ž©«îÞdowncase-word‘¦f(M-L)Ž¡‘9ÐóÝLo•²!w“ercase–^}the“currenš²!t“(or“follo˜wing)“w˜ord.‘ÅåWith“a“negativ˜e“argumen˜t,‘lÞdo“the“previousŽ¡‘9Ðówš²!ord,–¦fbut“do“not“mo˜v˜e“pMÞoin˜t.Ž¦Þcapitalize-word‘¦f(M-C)Ž¡‘9ÐóÝUppMÞercase–Fthe“currenš²!t“(or“follo˜wing)“w˜ord.‘½¼With“a“negativ˜e“argumen˜t,‘YIdo“the“previousŽ¡‘9Ðówš²!ord,–¦fbut“do“not“mo˜v˜e“pMÞoin˜t.ŽŸ«ïëMC.8.4‘d(Killing–¦MAnd“Y‘þÄ£ankingŽŽŸÕ÷Þkill-line‘¦f(C-K)Ž¡‘9ÐóÝKill–¦fthe“text“from“the“curren²!t“cursor“pMÞosition“to“the“end“of“the“line.Ž¦Þbackward-kill-line‘¦f()Ž¡‘9ÐóÝKill›¦fbac•²!kw“ard˜to˜the˜bMÞeginning˜of˜the˜line.‘ÝÝThis˜is˜normally˜un“bMÞound.Ž¦Þkill-word‘¦f(M-D)Ž¡‘9ÐóÝKill–Ífrom“the“cursor“to“the“end“of“the“currenš²!t“w˜ord,‘•or“if“bMÞet˜w˜een“w˜ords,‘•to“the“end“ofŽ¡‘9Ðóthe–¦fnext“w²!ord.Ž¦Þbackward-kill-word‘¦f(M-DEL)Ž¡‘9ÐóÝKill–¦fthe“w²!ord“bMÞehind“the“cursor.Ž¦Þunix-line-discard‘¦f(C-U)Ž¡‘9ÐóÝDo–8_what“ÞC-U“Ýused“to“do“in“Unix“line“input.‘“ÉW‘ÿee“sa•²!v“e–8_the“killed“text“on“the“kill-ring,Ž¡‘9Ðóthough.Ž¦Þunix-word-rubout‘¦f(C-W)Ž¡‘9ÐóÝDo–÷what“ÞC-W“Ýused“to“do“in“Unix“line“input.‘GThe“killed“text“is“sa•²!v“ed–÷on“the“kill-ring.Ž¡‘9ÐóThis–¦fis“di erenš²!t“than“bac˜kw˜ard-kill-w˜ord“bMÞecause“the“w˜ord“bMÞoundaries“di er.Ž¦Þyank‘¦f(C-Y)Ž¡‘9ÐóÝY‘ÿeank–¦fthe“top“of“the“kill“ring“inš²!to“the“bu er“at“pMÞoin˜t.Ž¦Þyank-pop‘¦f(M-Y)Ž¡‘9ÐóÝRotate–Pthe“kill-ring,‘a»and“y²!ank“the“new“top.‘Á@Y‘ÿeou“can“only“do“this“if“the“prior“commandŽ¡‘9Ðóis–¦fyš²!ank“or“y˜ank-pMÞop.ŽŸ«ïëMC.8.5‘d(Spiecifying–¦MNumeric“Argumen–átsŽŽŸÕ÷Þdigit-argument–¦f(M-0,“M-1,“...“M--)Ž¡‘9ÐóÝAdd–>$this“digit“to“the“argumenš²!t“already“accum˜ulating,‘dor“start“a“new“argumen˜t.‘¥ÞM--Ž¡‘9ÐóÝstarts–¦fa“negativš²!e“argumen˜t.ŽŽŸŒ‹´5ŸòÝ180’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞuniversal-argument‘¦f()Ž¤‘9ÐóÝDo–¦fwhat“ÞC-U“ÝdošMÞes“in“emacs.‘ÝÝBy“default,“this“is“not“b˜ound.Ž©JÅëMC.8.6‘d(Letting–¦MReadline“T–áypie“F›þÄ£or“Y˜ouŽŽŸÜ„Þcomplete‘¦f(TAB)Ž¡‘9ÐóÝA²!ttempt–L>to“do“completion“on“the“text“bšMÞefore“p˜oinš²!t.‘ÏeThis“is“implemen˜tation“de ned.Ž¡‘9ÐóGenerally‘ÿe,‘·=if–³ßyš²!ou“are“t˜yping“a“ le“name“argumen˜t,‘·=y˜ou“can“do“ le“name“completion;‘º›ifŽ¡‘9Ðóyš²!ou–VÒare“t˜yping“a“command,‘‚ìy˜ou“can“do“command“completion,‘‚ìif“y˜ou“are“t˜yping“in“aŽ¡‘9Ðósymš²!bMÞol–²to“GDB,“y˜ou“can“do“sym˜bMÞol“name“completion,‘Eif“y˜ou“are“t˜yping“in“a“v‘ÿdDariableŽ¡‘9Ðóto–¦fBash,“y²!ou“can“do“v‘ÿdDariable“name“completion...ŽŸÜ„Þpossible-completions‘¦f(M-?)Ž¡‘9ÐóÝList–¦fthe“pšMÞossible“completions“of“the“text“b˜efore“p˜oin²!t.Ž¦ëMC.8.7‘d(Some–¦MMiscellaneous“CommandsŽŽŸÜ„Þre-read-init-file–¦f(C-X“C-R)Ž¡‘9ÐóÝRead–«Çin“the“con•²!ten“ts–«Çof“yš²!our“`Þ~/.inputrcÝ'“ le,‘íand“incorpMÞorate“an˜y“bindings“foundŽ¡‘9Ðóthere.Ž©Ü„Þabort‘¦f(C-G)Ž¡‘9ÐóÝDing!‘ÝÝStops‘¦fthings.Ž¦Þdo-uppercase-version–¦f(M-A,“M-B,“...)Ž¡‘9ÐóÝRun–¦fthe“command“that“is“bšMÞound“to“y²!our“upp˜ercase“brother.Ž¦Þprefix-meta‘¦f(ESC)Ž¡‘9ÐóÝMakš²!e–~Kthe“next“c˜haracter“that“y˜ou“t˜ypšMÞe“b˜e“meta ed.‘ÐThis“is“for“p˜eople“without“a“metaŽ¡‘9Ðók•²!ey‘ÿe.‘ÝÝT“yping–¦fÞESC‘¿ªF“Ýis“equiv‘ÿdDalenš²!t“to“t˜yping“ÞM-FÝ.Ž¦Þundo‘¦f(C-_)Ž¡‘9ÐóÝIncremenš²!tal–¦fundo,“separately“remem˜bMÞered“for“eac˜h“line.Ž¦Þrevert-line‘¦f(M-R)Ž¡‘9ÐóÝUndo–\ýall“cš²!hanges“made“to“this“line.‘¡This“is“lik˜e“t˜yping“the“`undo'“command“enoughŽ¡‘9Ðótimes–¦fto“get“bac²!k“to“the“bMÞeginning.ŽŸ!¹ëEC.9‘™Readline–¦MVi“Mos3deŽŽŸnB‘ÝWhile–ÏCthe“Readline“library“došMÞes“not“ha•²!v“e–ÏCa“full“set“of“Vi“editing“functions,‘úJit“do˜es“con²!tain“enoughŽ¡to–¦fallo²!w“simple“editing“of“the“line.ŽŸnB‘In–›order“to“switcš²!h“in˜teractiv˜ely“bMÞet˜w˜een“Emacs“and“Vi“editing“moMÞdes,‘Muse“the“command“ÞM-C-JŽ¡Ý(toggle-editing-moMÞde).ŽŽŸŒ‹µ=2ŸòÝAppMÞendix–¦fC:“Command“Line“Editing’²H181ŽŽŽ ƒ3Ú ý¨ðБWhen–mjyš²!ou“en˜ter“a“line“in“Vi“moMÞde,‘Ÿ+y˜ou“are“already“placed“in“`insertion'“moMÞde,‘Ÿ+as“if“y˜ou“hadŽ¤tš²!ypMÞed–9Ian“`i'.‘–†Pressing“ÞESC“Ýswitc˜hes“y˜ou“in˜to“`edit'“moMÞde,‘^where“y˜ou“can“edit“the“text“of“the“lineŽ¡with–cthe“standard“Vi“mo•²!v“emen“t›ck“eys,‘)¢mo“v“e˜to˜previous˜history˜lines˜with˜`k',‘)¢and˜follo“wing˜linesŽ¡with–¦f`j',“and“so“forth.ŽŽŸŒ‹¶EpŸòÝ182’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹·GqŸòÝAppMÞendix–¦fD:“Using“Info’Rr3183ŽŽŽ ƒ3Ú ý¨ðÐèApp‘Š=endix–¦MD‘ ¸QUsing“InfoŽŽŸ!­z‘áInfo‘ Ýis–„Ða“program“whic²!h“is“used“to“view“info“ les“on“an“ASCIMÞI‘„Çterminal.‘Ò«áinfo“ les‘øRÝare“the“resultŽ¤of–¤proMÞcessing“texinfo“ les“with“the“program“Þmakeinfo“Ýor“with“the“Emacs“command“ÞM-x‘¦ftexinfo-Ž¡format-bufferÝ.‘o¦Finally‘ÿe,‘ã$átexinfo‘cÎÝis–Öþa“doMÞcumenš²!tation“language“whic˜h“allo˜ws“a“prin˜ted“man˜ual“andŽ¡on-line–¦fdošMÞcumen²!tation“(an“info“ le)“to“b˜e“pro˜duced“from“a“single“source“ le.ŽŸ!W•ëED.1‘™MoŒÌving–¦Mthe“CursorŽŽŸUå‘ÝManš²!y–йpMÞeople“ nd“that“reading“screens“of“text“page“b˜y“page“is“made“easier“when“one“is“able“toŽ¡indicate–.¶particular“pieces“of“text“with“some“kind“of“pMÞoin²!ting“device.‘vÎSince“this“is“the“case,‘PÊGNUŽ¡Info–èê(bMÞoth“the“Emacs“and“standalone“vš²!ersions)“ha˜v˜e“sev˜eral“commands“whic˜h“allo˜w“y˜ou“to“mo˜v˜e“theŽ¡cursor–3abšMÞout“the“screen.‘·pThe“notation“used“in“this“man²!ual“to“describ˜e“k•²!eystrok“es–3is“iden²!tical“to“theŽ¡notation–used“within“the“Emacs“manš²!ual,‘„and“the“GNU‘Readline“man˜ual.‘öòSee“section“\CharacterŽ¡Con•²!v“en“tions"–¦fin“áthe“GNU“Emacs“Manš²!ualnRÝ,“if“y˜ou“are“unfamiliar“with“the“notation.ŽŸUå‘The–»folloš²!wing“table“lists“the“basic“cursor“mo˜v˜emen˜t“commands“in“Info.‘mEac˜h“en˜try“consists“of“theŽ¡kš²!ey–$Wsequence“y˜ou“should“t˜ypMÞe“to“execute“the“cursor“mo˜v˜emen˜t,‘>Zthe“ÞM-xŸü¾®1Ž‘ ÊÝcommand“name“(displa˜y˜edŽ¡in–üparen²!theses),‘Q‡and“a“short“description“of“what“the“command“doMÞes.‘ÞúAll“of“the“cursor“motionŽ¡commands–ºãcan“takš²!e“an“án˜umeric‘dçÝargumen˜t“(see“Section“D.8“[Other“Info“Commands],›Àpage“193),˜toŽ¡ nd–×Éout“hoš²!w“to“supply“them.‘˜þWith“a“n˜umeric“argumen˜t,‘the“motion“commands“are“simply“executedŽ¡that–ùmanš²!y“times;‘MÂfor“example,‘1Ýa“n˜umeric“argumen˜t“of“4“giv˜en“to“Þnext-line“Ýcauses“the“cursor“toŽ¡mo•²!v“e›¸@do“wn˜4˜lines.‘lWith˜a˜negativ“e˜n“umeric˜argumen“t,‘¼·the˜motion˜is˜rev“ersed;‘Á-an˜argumen“t˜of˜-4Ž¡givš²!en–¦fto“the“Þnext-line“Ýcommand“w˜ould“cause“the“cursor“to“mo˜v˜e“áup‘ûgÝ4“lines.ŽŸ«ÊÞC-n‘¦fÝ(Þnext-lineÝ)Ž¡‘9ÐóMo•²!v“es–¦fthe“cursor“do²!wn“to“the“next“line.Ž©«ÊÞC-p‘¦fÝ(Þprev-lineÝ)Ž¡‘9ÐóMo•²!v“e–¦fthe“cursor“up“to“the“previous“line.Ž¦ÞC-a‘¦fÝ(Þbeginning-of-lineÝ)Ž¡‘9ÐóMo•²!v“e–¦fthe“cursor“to“the“start“of“the“curren²!t“line.Ž¦ÞC-e‘¦fÝ(Þend-of-lineÝ)Ž¡‘9ÐóMo•²!v“es–¦fthe“cursor“to“the“end“of“the“curren²!t“line.Ž¦ÞC-f‘¦fÝ(Þforward-charÝ)Ž¡‘9ÐóMo•²!v“e–¦fthe“cursor“forwš²!ard“a“c˜haracter.Ž¦ÞC-b‘¦fÝ(Þbackward-charÝ)Ž¡‘9ÐóMo•²!v“e–¦fthe“cursor“bac•²!kw“ard–¦fa“c²!haracter.ŽŸ ½û‰ffŠ=Ÿ 9•‘ óŸü¾®1ŽŽ‘ÞM-x–šÝis“also“a“command;‘˳it“in•²!v“ok“es–šÞexecute-extended-commandÝ.‘ (xSee“section“\Executing“anŽ¡‘extended–¦fcommand"“in“áthe“GNU“Emacs“Man²!ualnRÝ,“for“more“detailed“information.ŽŽŸŒ‹¸GÅŸòÝ184’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞM-f‘¦fÝ(Þforward-wordÝ)Ž¤‘9ÐóMo•²!v“es–¦fthe“cursor“forwš²!ard“a“w˜ord.Ž©Ä~ÞM-b‘¦fÝ(Þbackward-wordÝ)Ž¡‘9ÐóMo•²!v“es–¦fthe“cursor“bac•²!kw“ard–¦fa“w²!ord.Ž¦ÞM-<‘¦fÝ(Þbeginning-of-nodeÝ)Ž¡ÞbŽŽ‘9ÐóÝMo•²!v“es–¦fthe“cursor“to“the“start“of“the“curren²!t“noMÞde.Ž¦ÞM->‘¦fÝ(Þend-of-nodeÝ)Ž¡‘9ÐóMo•²!v“es–¦fthe“cursor“to“the“end“of“the“curren²!t“noMÞde.Ž¦ÞM-r‘¦fÝ(Þmove-to-window-lineÝ)Ž¡‘9ÐóMo•²!v“es–ÿžthe“cursor“to“a“spMÞeci c“line“of“the“windoš²!w.‘é„Without“a“n˜umeric“argumen˜t,‘ìÞM-rŽ¡‘9ÐóÝmo•²!v“es–¿âthe“cursor“to“the“start“of“the“line“in“the“cenš²!ter“of“the“windo˜w.‘*QWith“a“n˜umericŽ¡‘9Ðóargumenš²!t–¦fof“ánÝ,“ÞM-r“Ýmo˜v˜es“the“cursor“to“the“start“of“the“ánÝth“line“in“the“windo˜w.ŽŸ!ˆýëED.2‘™MošŒÌving–¦MT‘þ¦fext“Within“a“Windo˜wŽŽŸb?‘ÝSometimes–,}yš²!ou“are“loMÞoking“at“a“screenful“of“text,‘Nand“only“part“of“the“curren˜t“paragraph“y˜ouŽ¡are–vreading“is“visible“on“the“screen.‘ÖThe“commands“detailed“in“this“section“are“used“to“shift“whic²!hŽ¡part–¦fof“the“curren²!t“noMÞde“is“visible“on“the“screen.ŽŸÄ~ÞSPC‘¦fÝ(Þscroll-forwardÝ)Ž¡ÞC-vŽŽ‘9ÐóÝShift–8ethe“text“in“this“windoš²!w“up.‘“ÛThat“is,‘\åsho˜w“more“of“the“noMÞde“whic˜h“is“curren˜tlyŽ¡‘9ÐóbšMÞelo²!w–vÑthe“b˜ottom“of“the“windoš²!w.‘OWith“a“n˜umeric“argumen˜t,‘ªësho˜w“that“man˜y“moreŽ¡‘9Ðólines–‰ at“the“bMÞottom“of“the“windoš²!w;‘’Õa“n˜umeric“argumen˜t“of“4“w˜ould“shift“all“of“the“textŽ¡‘9Ðóin–ï(the“windoš²!w“up“4“lines“(discarding“the“top“4“lines),‘Xand“sho˜w“y˜ou“four“new“lines“atŽ¡‘9Ðóthe–6|bMÞottom“of“the“windoš²!w.‘ŽWithout“a“n˜umeric“argumen˜t,‘ZÞSPC“Ýtak˜es“the“bMÞottom“t˜w˜oŽ¡‘9Ðólines–Âof“the“windoš²!w“and“places“them“at“the“top“of“the“windo˜w,‘/redispla˜ying“almost“aŽ¡‘9Ðócompletely–¦fnew“screenful“of“lines.Ž¦ÞDEL‘¦fÝ(Þscroll-backwardÝ)Ž¡ÞM-vŽŽ‘9ÐóÝShift–¦fthe“text“in“this“windoš²!w“do˜wn.‘ÝÝThe“in˜v˜erse“of“Þscroll-forwardÝ.Ž©Ä~‘The–4ÑÞscroll-forward“Ýand“Þscroll-backward“Ýcommands“can“also“mo•²!v“e›4Ñforw“ard˜and˜bac“kw“ardŽ¡through–Öpthe“nošMÞde“structure“of“the“ le.‘˜‹If“y²!ou“press“ÞSPC“Ýwhile“viewing“the“end“of“a“no˜de,‘or“ÞDEL“ÝwhileŽ¡viewing–5Íthe“bšMÞeginning“of“a“no˜de,‘Y§what“happ˜ens“is“conš²!trolled“b˜y“the“v‘ÿdDariable“Þscroll-behaviourÝ.Ž¡See–¦fSection“D.9“[Info“V‘ÿeariables],“page“195,“for“more“information.Ž¦ÞC-l‘¦fÝ(Þredraw-displayÝ)Ž¡‘9ÐóRedraš²!w–é*the“displa˜y“from“scratc˜h,‘ùÚor“shift“the“line“con˜taining“the“cursor“to“a“spMÞeci edŽ¡‘9ÐóloMÞcation.‘‚ÅWith–•no“nš²!umeric“argumen˜t,›ËÆ`ÞC-lÝ'“clears“the“screen,˜and“then“redraš²!ws“its“en˜tireŽ¡‘9Ðócon•²!ten“ts.‘ZGiv“en–:a“nš²!umeric“argumen˜t“of“ánÝ,‘(/the“line“con˜taining“the“cursor“is“shifted“soŽ¡‘9Ðóthat–¦fit“is“on“the“ánÝth“line“of“the“windo²!w.ŽŽŸŒ‹¹SgŸòÝAppMÞendix–¦fD:“Using“Info’Rr3185ŽŽŽ ƒ3Ú ý¨ðÐÞC-x–¦fw“Ý(Þtoggle-wrapÝ)Ž¤‘9ÐóT‘ÿeoggles–Z9the“state“of“line“wrapping“in“the“currenš²!t“windo˜w.‘ùVNormally‘ÿe,‘‡.lines“whic˜h“areŽ¡‘9Ðólonger–°›than“the“screen“width“áwrapÝ,–áÃi.e.,“they–°›are“con•²!tin“ued–°›on“the“next“line.‘‹ïLines“whic²!hŽ¡‘9Ðówrap›Пha•²!v“e˜a˜`Þ\Ý'˜appMÞearing˜in˜the˜righ“tmost˜column˜of˜the˜screen.‘\‰Y‘ÿeou˜can˜cause˜suc“hŽ¡‘9Ðólines–Êto“bMÞe“terminated“at“the“righš²!tmost“column“b˜y“c˜hanging“the“state“of“line“wrappingŽ¡‘9Ðóin–Tythe“windoš²!w“with“ÞC-x‘¦fwÝ.‘ÂŽWhen“a“line“whic˜h“needs“more“space“than“one“screen“widthŽ¡‘9Ðóto–Z×displaš²!y“is“displa˜y˜ed,‘‡óa“`Þ$Ý'“appMÞears“in“the“righ˜tmost“column“of“the“screen,‘‡óand“theŽ¡‘9Ðóremainder–¦fof“the“line“is“in²!visible.ŽŸ+ëED.3‘™Selecting–¦Ma“New“Nos3deŽŽŸ‘ÝThis–ú section“details“the“nš²!umerous“Info“commands“whic˜h“select“a“new“noMÞde“to“view“in“the“curren˜tŽ¡windo²!w.Ž¤‘The–¦fmost“basic“noMÞde“commands“are“`ÞnÝ',“`ÞpÝ',“`ÞuÝ',“and“`ÞlÝ'.Ž¡‘When–¥)y²!ou“are“viewing“a“nošMÞde,‘Øœthe“top“line“of“the“no˜de“con²!tains“some“Info“áp˜oin•²!ters‘«Ýwhic“h‘¥)describ˜eŽ¤where–éthe“next,–ù¿previous,“and–éup“nošMÞdes“are.‘¥çInfo“uses“this“line“to“mo•²!v“e–éab˜out“the“no˜de“structureŽ¡of–¦fthe“ le“when“yš²!ou“use“the“follo˜wing“commands:ŽŸÞn‘¦fÝ(Þnext-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“`Next'“noMÞde.Ž©,Þp‘¦fÝ(Þprev-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“`Prev'“noMÞde.Ž¦Þu‘¦fÝ(Þup-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“`Up'“noMÞde.Ž©‘Y‘ÿeou– øcan“easily“select“a“noMÞde“that“yš²!ou“ha˜v˜e“already“view˜ed“in“this“windo˜w“b˜y“using“the“`ÞlÝ'Ž¡command–Èí{“this“name“stands“for“Þ"ÝlastÞ"Ý,‘Žand“actually“mo•²!v“es–Èíthrough“the“list“of“already“visitedŽ¡noMÞdes–Sfor“this“windoš²!w.‘-¥`ÞlÝ'“with“a“negativ˜e“n˜umeric“argumen˜t“mo˜v˜es“forw˜ard“through“the“historyŽ¡of–\xnoMÞdes“for“this“windoš²!w,‘kAso“y˜ou“can“quic˜kly“step“bMÞet˜w˜een“t˜w˜o“adjacen˜t“(in“viewing“history)“noMÞdes.Ž¦Þl‘¦fÝ(Þhistory-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“most“recenš²!tly“selected“noMÞde“in“this“windo˜w.Ž¦‘Twš²!o–‡additional“commands“mak˜e“it“easy“to“select“the“most“commonly“selected“noMÞdes;‘-—they“areŽ¡`ÞtÝ'–¦fand“`ÞdÝ'.Ž¦Þt‘¦fÝ(Þtop-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“noMÞde“`ÞTopÝ'“in“the“curren²!t“info“ le.ŽŸ,Þd‘¦fÝ(Þdir-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“directory“nošMÞde“(i.e.,“the“no˜de“`Þ(dir)Ý').Ž¦‘Here– are“some“other“commands“whicš²!h“immediately“result“in“the“selection“of“a“di eren˜t“noMÞde“inŽ¡the–¦fcurrenš²!t“windo˜w:ŽŽŸŒ‹º^•ŸòÝ186’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞ<‘¦fÝ(Þfirst-nodeÝ)Ž¤‘9ÐóSelects–÷Œthe“ rst“nošMÞde“whic²!h“app˜ears“in“this“ le.‘ÑNThis“no˜de“is“most“often“`ÞTopÝ',‘ Õbut“itŽ¡‘9ÐódoMÞesn't›¦fha•²!v“e˜to˜bMÞe.Ž©ÔÞ>‘¦fÝ(Þlast-nodeÝ)Ž¡‘9ÐóSelects–¦fthe“last“nošMÞde“whic²!h“app˜ears“in“this“ le.Ž¦Þ]‘¦fÝ(Þglobal-next-nodeÝ)Ž¡‘9ÐóMo•²!v“es›Ÿªforw“ard˜or˜do“wn˜through˜no•MÞde˜structure.‘ɪIf˜the˜no“de˜that˜y•²!ou˜are˜curren“tlyŽ¡‘9Ðóviewing–-þ^“^^^‘-ýP^^Ž¡‘Vdù(file)Node‘¿ª#lines‘þ¨whereŽŽŸŒ‹¾Š@ŸòÝ190’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðБWhen–ÎÝa“nošMÞde“comes“from“a“ le“whic²!h“is“compressed“on“disk,‘Øúthis“is“indicated“in“the“mo˜de“lineŽ¤with›>t•²!w“o˜small˜`ÞzÝ''s.‘»In˜addition,‘Rãif˜the˜info˜ le˜con“taining˜the˜no•MÞde˜has˜b“een˜split˜in²!to˜sub les,‘RãtheŽ¡name–¦fof“the“sub le“con²!taining“the“nošMÞde“app˜ears“in“the“mo˜deline“as“w²!ell:Ž©‘èUÞ--zz-Info:–¿ª(emacs)Top,“291“lines“--Top--“Subfile:“emacs-1.Z---------------ŽŸ‘ÝWhen–\ôInfo“makš²!es“a“noMÞde“in˜ternally‘ÿe,‘Š—suc˜h“that“there“is“no“correspMÞonding“info“ le“on“disk,‘Š—theŽ¡name–úÑof“the“noMÞde“is“surrounded“bš²!y“asterisks“(`Þ*Ý').‘ÛThe“name“itself“tells“y˜ou“what“the“con˜ten˜ts“ofŽ¡the–>windo²!w“are;‘FLthe“sample“mošMÞde“line“b˜eloš²!w“sho˜ws“an“in˜ternally“constructed“noMÞde“sho˜wing“pMÞossibleŽ¡completions:Ž¦‘èUÞ-----Info:–¿ª*Completions*,“7“lines“--All-----------------------------------ŽŸ)¹ëMD.6.2‘d(Windo–áw‘¦MCommandsŽŽŸ‘ÝIt–— can“bšMÞe“con•²!v“enien“t–— to“view“more“than“one“no˜de“at“a“time.‘¯ÒT‘ÿeo“alloš²!w“this,‘Ó6Info“can“displa˜yŽ¡more–õ than“one“áwindo•²!wÝ.‘Ê Eac“h›õ windo“w˜has˜its˜o“wn˜mo•MÞde˜line˜(see˜Section˜D.6.1˜[The˜Mo“de˜Line],Ž¡page–DŒ189)“and“history“of“noMÞdes“viewš²!ed“in“that“windo˜w“(see“Section“D.3“[Þhistory-nodeÝ],‘Xpage“185).ŽŸÜÞC-x–¦fo“Ý(Þnext-windowÝ)Ž¡‘9ÐóSelects–€gthe“next“windoš²!w“on“the“screen.‘Ñ3Note“that“the“ec˜ho“area“can“only“bMÞe“selected“ifŽ¡‘9Ðóit–ýËis“already“in“use,‘¤and“yš²!ou“ha˜v˜e“left“it“tempMÞorarily–ÿe.‘ä Normally“,‘¤`ÞC-x‘¦foÝ'–ýËsimply“mo˜v˜esŽ¡‘9Ðóthe–yÎcursor“inš²!to“the“next“windo˜w“on“the“screen,‘®§or“if“y˜ou“are“already“within“the“lastŽ¡‘9Ðówindo•²!w,‘Eªin“to–-{the“ rst“windoš²!w“on“the“screen.‘µGiv˜en“a“n˜umeric“argumen˜t,‘Eª`ÞC-x‘¦foÝ'“mo˜v˜esŽ¡‘9Ðóo•²!v“er–eÙthat“manš²!y“windo˜ws.‘6A‘e¨negativ˜e“argumen˜t“causes“`ÞC-x‘¦foÝ'“to“select“the“previousŽ¡‘9Ðówindo²!w–¦fon“the“screen.Ž©)¸ÞM-x‘¦fprev-windowŽ¡‘9ÐóÝSelects–’the“previous“windoš²!w“on“the“screen.‘×This“is“iden˜tical“to“`ÞC-x‘¦foÝ'“with“a“negativ˜eŽ¡‘9Ðóargumen²!t.Ž¦ÞC-x–¦f2“Ý(Þsplit-windowÝ)Ž¡‘9ÐóSplits–ŠÜthe“currenš²!t“windo˜w“in˜to“t˜w˜o“windo˜ws,‘ÑbMÞoth“sho˜wing“the“same“noMÞde.‘ZEac˜h“windo˜wŽ¡‘9Ðóis–>ùone“half“the“size“of“the“original“windo²!w,‘¥and“the“cursor“remains“in“the“originalŽ¡‘9Ðówindoš²!w.‘ûŽThe–¡v‘ÿdDariable“Þautomatic-tiling“Ýcan“cause“all“of“the“windo˜ws“on“the“screenŽ¡‘9Ðóto–‹«bMÞe“resized“for“y²!ou“automatically‘ÿe,›‘please“see“Section“D.9“[automatic-tiling],˜page“195Ž¡‘9Ðófor–¦fmore“information.Ž¦ÞC-x–¦f0“Ý(Þdelete-windowÝ)Ž¡‘9ÐóDeletes–‚Lthe“currenš²!t“windo˜w“from“the“screen.‘ÑÔIf“y˜ou“ha˜v˜e“made“toMÞo“man˜y“windo˜ws“andŽ¡‘9Ðóyš²!our–¦fscreen“appMÞears“cluttered,“this“is“the“w˜a˜y“to“get“rid“of“some“of“them.Ž¦ÞC-x–¦f1“Ý(Þkeep-one-windowÝ)Ž¡‘9ÐóDeletes–¦fall“of“the“windoš²!ws“excepting“the“curren˜t“one.Ž¦ÞESC–¦fC-v“Ý(Þscroll-other-windowÝ)Ž¡‘9ÐóScrolls–qÜthe“other“windoš²!w,‘¯‘in“the“same“fashion“that“`ÞC-vÝ'“migh˜t“scroll“the“curren˜t“windo˜w.Ž¡‘9ÐóGivš²!en–¦fa“negativ˜e“argumen˜t,“the“Þ"ÝotherÞ"“Ýwindo˜w“is“scrolled“bac˜kw˜ard.ŽŽŸŒ‹¿•#ŸòÝAppMÞendix–¦fD:“Using“Info’Rr3191ŽŽŽ ƒ3Ú ý¨ðÐÞC-x–¦f^“Ý(Þgrow-windowÝ)Ž¤‘9ÐóGroš²!ws–Š(or“shrinks)“the“curren˜t“windo˜w.‘Ô•Giv˜en“a“n˜umeric“argumen˜t,‘gro˜ws“the“curren˜tŽ¡‘9Ðówindoš²!w–þôthat“man˜y“lines;‘«;with“a“negativ˜e“n˜umeric“argumen˜t,‘Uthe“windo˜w“is“shrunkŽ¡‘9Ðóinstead.Ž©ÜàÞC-x–¦ft“Ý(Þtile-windowsÝ)Ž¡‘9ÐóDivides–2§the“aš²!v‘ÿdDailable“screen“space“among“all“of“the“visible“windo˜ws.‘‚¡Eac˜h“windo˜w“isŽ¡‘9Ðógivš²!en–Õ2an“equal“pMÞortion“of“the“screen“in“whic˜h“to“displa˜y“its“con˜ten˜ts.‘j@The“v‘ÿdDariableŽ¡‘9ÐóÞautomatic-tiling–‚ÞÝcan“cause“Þtile-windows“Ýto“bMÞe“called“when“a“windo²!w“is“created“orŽ¡‘9Ðódeleted.‘ÝÝSee–¦fSection“D.9“[Þautomatic-tilingÝ],“page“195.ŽŸÜàëMD.6.3‘d(The–¦MEc–áho“AreaŽŽŸ‘ÝThe–Sßáecš²!ho“area“Ýis“a“one“line“windo˜w“whic˜h“appšMÞears“at“the“b˜ottom“of“the“screen.‘æGIt“is“used“toŽ¡displa•²!y›Çïinformativ“e˜or˜error˜messages,‘ÐQand˜to˜read˜lines˜of˜input˜from˜y“ou˜when˜that˜is˜necessary‘ÿe.Ž¡Almost– #all“of“the“commands“aš²!v‘ÿdDailable“in“the“ec˜ho“area“are“iden˜tical“to“their“Emacs“coun˜terparts,Ž¡so–÷ªplease“refer“to“that“doMÞcumen²!tation“for“greater“depth“of“discussion“on“the“concepts“of“editing“aŽ¡line–Ægof“text.‘=áThe“folloš²!wing“table“brie y“lists“the“commands“that“are“a˜v‘ÿdDailable“while“input“is“bMÞeingŽ¡read–¦fin“the“ec²!ho“area:ŽŸnpÞC-f‘¦fÝ(Þecho-area-forwardÝ)Ž¡‘9ÐóMo•²!v“es›¦fforw“ard˜a˜c“haracter.Ž¦ÞC-b‘¦fÝ(Þecho-area-backwardÝ)Ž¡‘9ÐóMo•²!v“es›¦fbac“kw“ard˜a˜c“haracter.Ž¦ÞC-a‘¦fÝ(Þecho-area-beg-of-lineÝ)Ž¡‘9ÐóMo•²!v“es–¦fto“the“start“of“the“input“line.Ž¦ÞC-e‘¦fÝ(Þecho-area-end-of-lineÝ)Ž¡‘9ÐóMo•²!v“es–¦fto“the“end“of“the“input“line.Ž¦ÞM-f‘¦fÝ(Þecho-area-forward-wordÝ)Ž¡‘9ÐóMo•²!v“es›¦fforw“ard˜a˜w“ord.Ž¦ÞM-b‘¦fÝ(Þecho-area-backward-wordÝ)Ž¡‘9ÐóMo•²!v“es›¦fbac“kw“ard˜a˜w“ord.Ž¦ÞC-d‘¦fÝ(Þecho-area-deleteÝ)Ž¡‘9ÐóDeletes–¦fthe“c²!haracter“under“the“cursor.Ž¦ÞDEL‘¦fÝ(Þecho-area-ruboutÝ)Ž¡‘9ÐóDeletes–¦fthe“c²!haracter“bMÞehind“the“cursor.Ž¦ÞC-g‘¦fÝ(Þecho-area-abortÝ)Ž¡‘9ÐóCancels–Å!or“quits“the“curren²!t“opšMÞeration.‘:If“completion“is“b˜eing“read,‘ÌÐ`ÞC-gÝ'“discards“theŽ¡‘9Ðótext–^ãof“the“input“line“whicš²!h“doMÞes“not“matc˜h“an˜y“completion.‘ÆIf“the“input“line“is“empt˜y‘ÿe,Ž¡‘9Ðó`ÞC-gÝ'–¦fabMÞorts“the“calling“function.ŽŽŸŒ‹À¡¼ŸòÝ192’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞRET‘¦fÝ(Þecho-area-newlineÝ)Ž¤‘9ÐóAccepts–¦f(or“forces“completion“of‘Ú)“the“curren²!t“input“line.Ž©÷¤ÞC-q‘¦fÝ(Þecho-area-quoted-insertÝ)Ž¡‘9ÐóInserts–bõthe“next“cš²!haracter“v˜erbatim.‘ÇbThis“is“ho˜w“y˜ou“can“insert“con˜trol“c˜haracters“in˜toŽ¡‘9Ðóa–¦fsearc²!h“string,“for“example.Ž¦áprin•²!ting‘¦fc“haracter‘oÝ(Þecho-area-insertÝ)Ž¡‘9ÐóInserts–¦fthe“c²!haracter.Ž¦ÞM-TAB‘¦fÝ(Þecho-area-tab-insertÝ)Ž¡‘9ÐóInserts–¦fa“T‘ÿeAB“c²!haracter.Ž¦ÞC-t‘¦fÝ(Þecho-area-transpose-charsÝ)Ž¡‘9ÐóT‘ÿeranspMÞoses–¦fthe“c²!haracters“at“the“cursor.Ž©÷¤‘The–k:next“group“of“commands“deal“with“ákillingÝ,‘wand“áy²!anking‘[RÝtext.‘Ê$F‘ÿeor“an“in“depth“discussion“ofŽ¡killing–¦fand“yš²!anking,“see“section“\Killing“and“Deleting"“in“áthe“GNU“Emacs“Man˜ualŽ¦ÞM-d‘¦fÝ(Þecho-area-kill-wordÝ)Ž¡‘9ÐóKills–¦fthe“wš²!ord“follo˜wing“the“cursor.Ž©÷¤ÞM-DEL‘¦fÝ(Þecho-area-backward-kill-wordÝ)Ž¡‘9ÐóKills–¦fthe“w²!ord“preceding“the“cursor.Ž¦ÞC-k‘¦fÝ(Þecho-area-kill-lineÝ)Ž¡‘9ÐóKills–¦fthe“text“from“the“cursor“to“the“end“of“the“line.Ž¦ÞC-x–¦fDEL“Ý(Þecho-area-backward-kill-lineÝ)Ž¡‘9ÐóKills–¦fthe“text“from“the“cursor“to“the“bMÞeginning“of“the“line.Ž¦ÞC-y‘¦fÝ(Þecho-area-yankÝ)Ž¡‘9ÐóY‘ÿeanks–¦fbacš²!k“the“con˜ten˜ts“of“the“last“kill.Ž¦ÞM-y‘¦fÝ(Þecho-area-yank-popÝ)Ž¡‘9ÐóY‘ÿeanks–¦fbacš²!k“a“previous“kill,“remo˜ving“the“last“y˜ank˜ed“text“ rst.Ž©÷¤‘Sometimes–µwhen“reading“input“in“the“ec²!ho“area,‘{ˆthe“command“that“needed“input“will“onlyŽ¡accept–®wone“of“a“list“of“sevš²!eral“c˜hoices.‘öThe“c˜hoices“represen˜t“the“ápMÞossible“completionsÝ,‘ðzand“y˜ouŽ¡mš²!ust–ÐsrespMÞond“with“one“of“them.‘\Since“there“are“a“limited“n˜um˜bšMÞer“of“resp˜onses“yš²!ou“can“mak˜e,Ž¡Info–õcalloš²!ws“y˜ou“to“abbreviate“what“y˜ou“t˜ypMÞe,‘ "only“t˜yping“as“m˜uc˜h“of“the“respMÞonse“as“is“necessaryŽ¡to–VHuniquely“idenš²!tify“it.‘íƒIn“addition,‘‚@y˜ou“can“request“Info“to“ ll“in“as“m˜uc˜h“of“the“respMÞonse“as“isŽ¡pMÞossible;–¦fthis“is“called“ácompletionÝ.ŽŸ{Ò‘The–¦ffolloš²!wing“commands“are“a˜v‘ÿdDailable“when“completing“in“the“ec˜ho“area:Ž¦ÞTAB‘¦fÝ(Þecho-area-completeÝ)Ž¡ÞSPCŽŽ‘9ÐóÝInserts–¦fas“m•²!uc“h–¦fof“a“completion“as“is“pMÞossible.ŽŽŸŒ‹Á«ŸòÝAppMÞendix–¦fD:“Using“Info’Rr3193ŽŽŽ ƒ3Ú ý¨ðÐÞ?‘¦fÝ(Þecho-area-possible-completionsÝ)Ž¤‘9ÐóDisplaš²!ys–$Za“windo˜w“con˜taining“a“list“of“the“pMÞossible“completions“of“what“y˜ou“ha˜v˜e“t˜ypMÞedŽ¡‘9Ðóso–¦ffar.‘ÝÝF‘ÿeor“example,“if“the“aš²!v‘ÿdDailable“c˜hoices“are:Ž©°ó‘V¹HÞbarŽ¤ ‘V¹HfoliateŽ¡‘V¹HfoodŽ¡‘V¹HforgetŽŸ°ó‘9ÐóÝand–¦fyš²!ou“ha˜v˜e“t˜ypMÞed“an“`ÞfÝ',“follo˜w˜ed“b˜y“`Þ?Ý',“the“pMÞossible“completions“w˜ould“con˜tain:Ž¦‘V¹HÞfoliateŽ¡‘V¹HfoodŽ¡‘V¹HforgetŽŸ°ó‘9ÐóÝi.e.,‘d_all–>aof“the“cš²!hoices“whic˜h“bMÞegin“with“`ÞfÝ'.‘¥ÎPressing“ÞSPC“Ýor“ÞTAB“Ýw˜ould“result“in“`ÞfoÝ'Ž¤‘9ÐóappMÞearing–¿in“the“ecš²!ho“area,‘Å'since“all“of“the“c˜hoices“whic˜h“bMÞegin“with“`ÞfÝ'“con˜tin˜ue“withŽ¡‘9Ðó`ÞoÝ'.‘NKNo•²!w,‘Õ>t“yping–Ëà`ÞlÝ'“follo•²!w“ed›Ëàb“y˜`ÞTABÝ'˜results˜in˜`ÞfoliateÝ'˜appMÞearing˜in˜the˜ec“ho˜area,Ž¡‘9Ðósince–¦fthat“is“the“only“cš²!hoice“whic˜h“bMÞegins“with“`ÞfolÝ'.ŽŸaæÞESC–¦fC-v“Ý(Þecho-area-scroll-completions-windowÝ)Ž¡‘9ÐóScrolls–¦fthe“completions“windoš²!w,“if“that“is“visible,“or“the“Þ"ÝotherÞ"“Ýwindo˜w“if“not.Ž©aæëED.7‘™PrinŒÌting–¦MOut“Nos3desŽŽŸ‘ÝY‘ÿeou–ê®maš²!y“wish“to“prin˜t“out“the“con˜ten˜ts“of“a“noMÞde“as“a“quic˜k“reference“doMÞcumen˜t“for“later“use.Ž¡Info–´'proš²!vides“y˜ou“with“a“command“for“doing“this.‘ In“general,‘·—w˜e“recommend“that“y˜ou“use“T‘þ,³Ÿ[wEŽ‘B X‘´#toŽ¡format–¦fthe“doMÞcumenš²!t“and“prin˜t“sections“of“it,“b˜y“running“Þtex“Ýon“the“texinfo“source“ le.ŽŸ°óÞM-x‘¦fprint-nodeŽ¡‘9ÐóÝPipšMÞes–{ûthe“con•²!ten“ts–{ûof“the“curren²!t“no˜de“through“the“command“in“the“en•²!vironmen“t‘{ûv‘ÿdDari-Ž¡‘9Ðóable–;&ÞINFO_PRINT_COMMANDÝ.‘œIf“the“v‘ÿdDariable“došMÞesn't“exist,‘`Vthe“no˜de“is“simply“pip˜ed“toŽ¡‘9ÐóÞlprÝ.Ž¦ëED.8‘™Miscellaneous–¦MInfo“CommandsŽŽŸ‘ÝGNU–¦fInfo“conš²!tains“sev˜eral“commands“whic˜h“self-doMÞcumen˜t“GNU“Info:ŽŸ°óÞM-x‘¦fdescribe-commandŽ¡‘9ÐóÝReads–&~the“name“of“an“Info“command“in“the“ecš²!ho“area“and“then“displa˜ys“a“brief“descrip-Ž¡‘9Ðótion–¦fof“what“that“command“doMÞes.Ž©aæÞM-x‘¦fdescribe-keyŽ¡‘9ÐóÝReads–5a“kš²!ey“sequence“in“the“ec˜ho“area,‘KÀand“then“displa˜ys“the“name“and“doMÞcumen˜tationŽ¡‘9Ðóof–¦fthe“Info“command“that“the“kš²!ey“sequence“in˜v˜ok˜es.Ž¦ÞM-x‘¦fdescribe-variableŽ¡‘9ÐóÝReads–Á½the“name“of“a“v‘ÿdDariable“in“the“ecš²!ho“area“and“then“displa˜ys“a“brief“description“ofŽ¡‘9Ðówhat–¦fthe“v‘ÿdDariable“a ects.ŽŽŸŒ‹Â´ŸòÝ194’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞM-x‘¦fwhere-isŽ¤‘9ÐóÝReads–]the“name“of“an“Info“command“in“the“ecš²!ho“area,‘#øand“then“displa˜ys“a“k˜ey“sequenceŽ¡‘9Ðówhicš²!h–¦fcan“bMÞe“t˜ypMÞed“in“order“to“in˜v˜ok˜e“that“command.Ž©S"ÞC-h‘¦fÝ(Þget-help-windowÝ)Ž¡Þ?ŽŽ‘9ÐóÝCreates–VÓ(or“mo•²!v“es›VÓin“to)˜the˜windo“w˜displa“ying˜Þ*Help*Ý,‘f½and˜places˜a˜noMÞde˜con“taining˜aŽ¡‘9Ðóquicš²!k–‘9reference“card“in˜to“it.‘ÖÎThis“windo˜w“displa˜ys“the“most“concise“information“abMÞoutŽ¡‘9ÐóGNU–¦fInfo“a²!v‘ÿdDailable.Ž¦Þh‘¦fÝ(Þget-info-help-nodeÝ)Ž¡‘9ÐóT‘ÿeries–eLhard“to“visit“the“noMÞde“Þ(info)HelpÝ.‘ŽThe“info“ le“`Þinfo.texiÝ'“distributed“withŽ¡‘9ÐóGNU‘×´Info–×èconš²!tains“this“noMÞde.‘™ Of“course,‘5the“ le“m˜ust“ rst“bšMÞe“pro˜cessed“with“ÞmakeinfoÝ,Ž¡‘9Ðóand–¦fthen“placed“inš²!to“the“loMÞcation“of“y˜our“info“directory‘ÿe.Ž¤S"‘Here–¦fare“the“commands“for“creating“a“nš²!umeric“argumen˜t:Ž¡ÞC-u‘¦fÝ(Þuniversal-argumentÝ)Ž¤‘9ÐóStarts–=â(or“mš²!ultiplies“b˜y“4)“the“curren˜t“n˜umeric“argumen˜t.‘»`ÞC-uÝ'“is“a“go•MÞo“d–=âw˜a˜y“to“giv˜e“aŽ¡‘9Ðósmall–éInš²!umeric“argumen˜t“to“cursor“mo˜v˜emen˜t“or“scrolling“commands;‘ »`ÞC-u‘¦fC-vÝ'“scrollsŽ¡‘9Ðóthe–¦fscreen“4“lines,“while“`ÞC-u“C-u“C-nÝ'“mo•²!v“es–¦fthe“cursor“do²!wn“16“lines.Ž¦ÞM-1‘¦fÝ(Þadd-digit-to-numeric-argÝ)Ž¡ÞM-2›¦fÝ.–Ó1.“.˜ÞM-9Ž¡‘9ÐóÝAdds–&Õthe“digit“v‘ÿdDalue“of“the“in•²!v“oking›&Õk“ey˜to˜the˜curren“t˜n“umeric˜argumen“t.‘³WOnce˜Info˜isŽ¡‘9Ðóreading–Sa“nš²!umeric“argumen˜t,‘#ðy˜ou“ma˜y“just“t˜ypMÞe“the“digits“of“the“argumen˜t,‘#ðwithout“theŽ¡‘9ÐóMeta–¦fpre x.‘ÝÝF‘ÿeor“example,“yš²!ou“migh˜t“giv˜e“`ÞC-lÝ'“a“n˜umeric“argumen˜t“of“32“b˜y“t˜yping:Ž¤)‘‘V¹HÞC-u–¿ª3“2“C-lŽŸ)‘‘9ÐóÝorŽ¡‘V¹HÞM-3–¿ª2“C-lŽ¤S"‘Ý`ÞC-gÝ'–óõis“used“to“abMÞort“the“reading“of“a“m•²!ulti-c“haracter›óõk“ey˜sequence,‘¦to˜cancel˜length“y˜opMÞerationsŽ©(sucš²!h–¦fas“m˜ulti- le“searc˜hes)“and“to“cancel“reading“input“in“the“ec˜ho“area.Ž¡ÞC-g‘¦fÝ(Þabort-keyÝ)Ž¦‘9ÐóCancels–¦fcurren²!t“opMÞeration.Ž¡‘The–¦f`ÞqÝ'“command“of“Info“simply“quits“running“Info.Ž¡Þq‘¦fÝ(ÞquitÝ)ŽŽ‘9ÐóExits–¦fGNU“Info.Ž¡‘If–yÏthe“opMÞerating“system“tells“GNU‘yÃInfo“that“the“screen“is“60“lines“tall,‘‚ºand“it“is“actually“only“40Ž¦lines–¦ftall,“here“is“a“w•²!a“y–¦fto“tell“Info“that“the“opMÞerating“system“is“correct.Ž¡ÞM-x‘¦fset-screen-heightŽ¦‘9ÐóÝReads–la“heighš²!t“v‘ÿdDalue“in“the“ec˜ho“area“and“sets“the“heigh˜t“of“the“displa˜y˜ed“screen“toŽ¦‘9Ðóthat‘¦fv‘ÿdDalue.ŽŽŸŒ‹Ã½ØŸòÝAppMÞendix–¦fD:“Using“Info’Rr3195ŽŽŽ ƒ3Ú ý¨ðБFinally‘ÿe,‘mæInfo–_Æproš²!vides“a“con˜v˜enien˜t“w˜a˜y“to“displa˜y“foMÞotnotes“whic˜h“migh˜t“bšMÞe“asso˜ciated“with“theŽ¤currenš²!t–¦fnoMÞde“that“y˜ou“are“viewing:Ž©\$ÞESC–¦fC-f“Ý(Þshow-footnotesÝ)Ž¡‘9ÐóShoš²!ws–Z’the“foMÞotnotes“(if“an˜y)“assoMÞciated“with“the“curren˜t“noMÞde“in“another“windo˜w.Ž¡‘9ÐóY‘ÿeou–™Ùcan“ha•²!v“e–™ÙInfo“automatically“displa²!y“the“fošMÞotnotes“asso˜ciated“with“a“no˜de“whenŽ¡‘9Ðóthe–"noMÞde“is“selected“b²!y“setting“the“v‘ÿdDariable“Þautomatic-footnotesÝ.‘›See“Section“D.9Ž¡‘9Ðó[Þautomatic-footnotesÝ],–¦fpage“195.ŽŸ ¸HëED.9‘™Manipulating‘¦MV‘þ¦fariablesŽŽŸ.‘ÝGNU‘LInfo–L.conš²!tains“sev˜eral“áv›ÿdDariables‘¿°Ýwhose“v˜alues“are“loMÞokš²!ed“at“b˜y“v‘ÿdDarious“Info“commands.‘¿ÊY‘ÿeouŽ¡can–èÓc²!hange“the“v›ÿdDalues“of“these“v˜ariables,‘½and“thš²!us“c˜hange“the“bMÞeha˜vior“of“Info“to“more“closely“matc˜hŽ¡y•²!our›¦fen“vironmen“t˜and˜info˜ le˜reading˜manner.Ž¦ÞM-x‘¦fset-variableŽ¡‘9ÐóÝReads–Øthe“name“of“a“v›ÿdDariable,‘åand“the“v˜alue“for“it,‘åin“the“ec²!ho“area“and“then“sets“theŽ¡‘9Ðóv›ÿdDariable––óto“that“v˜alue.‘Ø·Completion“is“a²!v˜ailable“when“reading“the“v˜ariable“name;‘œoften,Ž¡‘9Ðócompletion–õãis“a²!v›ÿdDailable“when“reading“the“v˜alue“to“giv²!e“to“the“v˜ariable,‘1but“that“depMÞendsŽ¡‘9Ðóon–Ù.the“v›ÿdDariable“itself.‘v6If“a“v˜ariable“doMÞes“ánot‘.Ýsupply“mš²!ultiple“c˜hoices“to“complete“o˜v˜er,Ž¡‘9Ðóit–¦fexpMÞects“a“n²!umeric“v‘ÿdDalue.ŽŸ\$ÞM-x‘¦fdescribe-variableŽ¡‘9ÐóÝReads–Á½the“name“of“a“v‘ÿdDariable“in“the“ecš²!ho“area“and“then“displa˜ys“a“brief“description“ofŽ¡‘9Ðówhat–¦fthe“v‘ÿdDariable“a ects.Ž¦‘Here–¦fis“a“list“of“the“v‘ÿdDariables“that“y²!ou“can“set“in“Info.Ž¦Þautomatic-footnotesŽ¡‘9ÐóÝWhen–¿^set“to“ÞOnÝ,‘œfošMÞotnotes“app˜ear“and“disapp˜ear“automatically‘ÿe.‘(ÆThis“v‘ÿdDariable“is“ÞOnŽ¡‘9ÐóÝbš²!y–³Ädefault.‘øWhen“a“noMÞde“is“selected,‘·a“windo˜w“con˜taining“the“foMÞotnotes“whic˜h“appMÞearŽ¡‘9Ðóin–ë÷that“nošMÞde“is“created,‘ý\and“the“fo˜otnotes“are“displa•²!y“ed–ë÷within“the“new“windo²!w.‘®‘TheŽ¡‘9Ðówindoš²!w–;~that“Info“creates“to“con˜tain“the“fošMÞotnotes“is“called“`Þ*Footnotes*Ý'.‘$If“a“no˜deŽ¡‘9Ðóis–š÷selected“whicš²!h“con˜tains“no“foMÞotnotes,‘Aand“a“`Þ*Footnotes*Ý'“windo˜w“is“on“the“screen,Ž¡‘9Ðóthe–Ô`Þ*Footnotes*Ý'“windoš²!w“is“deleted.‘©F‘ÿeoMÞotnote“windo˜ws“created“in“this“fashion“are“notŽ¡‘9Ðóautomatically–¦ftiled“so“that“they“can“use“as“little“of“the“displa²!y“as“is“pMÞossible.ŽŸ\$Þautomatic-tilingŽ¡‘9ÐóÝWhen–m¡set“to“ÞOnÝ,‘Ÿocreating“or“deleting“a“windoš²!w“resizes“other“windo˜ws.‘3This“v‘ÿdDariableŽ¡‘9Ðóis–¼uÞOff“Ýbš²!y“default.‘ Normally‘ÿe,‘Áøt˜yping“`ÞC-x‘¦f2Ý'“divides“the“curren˜t“windo˜w“in˜to“t˜w˜o“equalŽ¡‘9Ðóparts.‘’õWhen–âÃÞautomatic-tiling“Ýis“set“to“ÞOnÝ,‘ñÚall“of“the“windo²!ws“are“resized“automat-Ž¡‘9Ðóically‘ÿe,‘0kš²!eeping–ú;an“equal“n˜um˜bMÞer“of“lines“visible“in“eac˜h“windo˜w.‘Ù\There“are“exceptionsŽ¡‘9Ðóto–¸ôthe“automatic“tiling;‘Â;spMÞeci cally‘ÿe,‘½—the“windo²!ws“`Þ*Completions*Ý'“and“`Þ*Footnotes*Ý'Ž¡‘9Ðóare–¦fánot‘ãfÝresized“through“automatic“tiling;“they“remain“their“original“size.ŽŽŸŒ‹ÄÇàŸòÝ196’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý¨ðÐÞvisible-bellŽ¤‘9ÐóÝWhen–set“to“ÞOnÝ,‘"%GNU‘ëInfo“attempts“to“ ash“the“screen“instead“of“ringing“the“bMÞell.‘¦ÂThisŽ¡‘9Ðóv‘ÿdDariable–¦Ais“ÞOff“Ýbš²!y“default.‘ˆ|Of“course,‘Ù|Info“can“only“ ash“the“screen“if“the“terminal“allo˜wsŽ¡‘9Ðóit;‘s*in–.éthe“case“that“the“terminal“doMÞes“not“allo²!w“it,‘Q the“setting“of“this“v‘ÿdDariable“has“noŽ¡‘9Ðóe ect.‘ÜbHo•²!w“ev“er,‘¢Øy“ou–¡ôcan“makš²!e“Info“pMÞerform“quietly“b˜y“setting“the“Þerrors-ring-bellŽ¡‘9ÐóÝv‘ÿdDariable–¦fto“ÞOffÝ.Ž©æÞerrors-ring-bellŽ¡‘9ÐóÝWhen–YDset“to“ÞOnÝ,‘h±errors“cause“the“bMÞell“to“ring.‘Ä'The“default“setting“of“this“v‘ÿdDariable“is“ÞOnÝ.Ž¦Þgc-compressed-filesŽ¡‘9ÐóÝWhen–gset“to“ÞOnÝ,‘s¼Info“garbage“collects“ les“whic²!h“had“to“bMÞe“uncompressed.‘ÈÁThe“defaultŽ¡‘9Ðóv›ÿdDalue–8bof“this“v˜ariable“is“ÞOffÝ.‘¹1Whenevš²!er“a“noMÞde“is“visited“in“Info,‘Ncthe“info“ le“con˜tainingŽ¡‘9Ðóthat–\1nošMÞde“is“read“in²!to“core,‘É£and“Info“reads“information“ab˜out“the“tags“and“no˜desŽ¡‘9Ðóconš²!tained–°Ýin“that“ le.‘ýAOnce“the“tags“information“is“read“b˜y“Info,‘³zit“is“nev˜er“forgotten.Ž¡‘9ÐóHo•²!w“ev“er,‘Ùtthe–¦8actual“text“of“the“nošMÞdes“do˜es“not“need“to“remain“in“core“unless“a“particularŽ¡‘9Ðóinfo–±‚windo²!w“needs“it.‘ÿ0F‘ÿeor“non-compressed“ les,‘´Hthe“text“of“the“nošMÞdes“do˜es“not“remainŽ¡‘9Ðóin–y2core“when“it“is“no“longer“in“use.‘ÎÌBut“de-compressing“a“ le“can“bMÞe“a“time“consumingŽ¡‘9ÐóopMÞeration,‘\ and–Irso“Info“tries“hard“not“to“do“it“t²!wice.‘¾áÞgc-compressed-files“Ýtells“Info“itŽ¡‘9Ðóis–s¤ok‘ÿdDaš²!y“to“garbage“collect“the“text“of“the“noMÞdes“of“a“ le“whic˜h“w˜as“compressed“on“disk.Ž¦Þshow-index-matchŽ¡‘9ÐóÝWhen–bset“to“ÞOnÝ,‘oÂthe“pMÞortion“of“the“matcš²!hed“searc˜h“string“is“highligh˜ted“in“the“messageŽ¡‘9Ðówhicš²!h–ïexplains“where“the“matc˜hed“searc˜h“string“w˜as“found.‘öwThe“default“v‘ÿdDalue“of“thisŽ¡‘9Ðóv‘ÿdDariable–»is“ÞOnÝ.‘òWhen“Info“displaš²!ys“the“loMÞcation“where“an“index“matc˜h“w˜as“found,‘ÀD(seeŽ¡‘9ÐóSection–¸ D.4“[Þnext-index-matchÝ],›ý-page“187),˜the“pMÞortion“of“the“string“that“y²!ou“hadŽ¡‘9Ðótš²!ypMÞed–îŸis“highligh˜ted“b˜y“displa˜ying“it“in“the“in˜v˜erse“case“from“its“surrounding“c˜haracters.Ž¦Þscroll-behaviourŽ¡‘9ÐóÝConš²!trols–twhat“happMÞens“when“forw˜ard“scrolling“is“requested“at“the“end“of“a“noMÞde,‘¨orŽ¡‘9Ðówhen›P¨bac•²!kw“ard˜scrolling˜is˜requested˜at˜the˜b•MÞeginning˜of˜a˜no“de.‘ÁHThe˜default˜v‘ÿdDalue˜forŽ¡‘9Ðóthis–¦fv›ÿdDariable“is“ÞContinuousÝ.‘ÝÝThere“are“three“pMÞossible“v˜alues“for“this“v˜ariable:Ž¦‘9ÐóÞContinuousŽ¡‘s¡æÝT‘ÿeries–$Íto“get“the“ rst“item“in“this“noMÞde's“men²!u,›Dgor“failing“that,˜the“`ÞNextÝ'Ž¡‘s¡ænoMÞde,›Qror–/=failing“that,˜the“`ÞNextÝ'“of“the“`ÞUpÝ'.‘xaThis“bMÞehaš²!vior“is“iden˜tical“toŽ¡‘s¡æusing–“the“`Þ]Ý'“(Þglobal-next-nodeÝ)“and“`Þ[Ý'“(Þglobal-prev-nodeÝ)“commands.Ž¦‘9ÐóÞNext‘¦fOnlyŽŽ‘s¡æÝOnly–¦ftries“to“get“the“`ÞNextÝ'“noMÞde.Ž¦‘9ÐóÞPage‘¦fOnlyŽŽ‘s¡æÝSimply–_givš²!es“up,‘:`c˜hanging“nothing.‘°ÛIf“Þscroll-behaviour“Ýis“ÞPage‘¦fOnlyÝ,‘:`noŽ¡‘s¡æscrolling–¦fcommand“can“c²!hange“the“nošMÞde“that“is“b˜eing“view²!ed.Ž¦Þscroll-stepŽ¡‘9ÐóÝThe›ñln•²!um“bMÞer˜of˜lines˜to˜scroll˜when˜the˜cursor˜mo“v“es˜out˜of˜the˜windo“w.‘¾îScrollingŽ¡‘9ÐóhappšMÞens–!ùautomatically“if“the“cursor“has“mo•²!v“ed–!ùout“of“the“visible“p˜ortion“of“the“no˜deŽŽŸŒ‹ÅÔÄŸòÝAppMÞendix–¦fD:“Using“Info’Rr3197ŽŽŽ ƒ3Ú ý¨ðБ9Ðótext–L when“it“is“time“to“displa²!y‘ÿe.‘ÎËUsually“the“scrolling“is“done“so“as“to“put“the“cursorŽ¤‘9Ðóon–aåthe“cenš²!ter“line“of“the“curren˜t“windo˜w.‘[Ho˜w˜ev˜er,‘Åif“the“v‘ÿdDariable“Þscroll-step“ÝhasŽ¡‘9Ðóa–ynonzero“v‘ÿdDalue,‘­½Info“attempts“to“scroll“the“noMÞde“text“bš²!y“that“man˜y“lines;‘âhif“that“isŽ¡‘9Ðóenough–SÑto“bring“the“cursor“bacš²!k“in˜to“the“windo˜w,‘,that“is“what“is“done.‘æThe“defaultŽ¡‘9Ðóv›ÿdDalue–9of“this“v˜ariable“is“0,‘Nøthš²!us“placing“the“cursor“(and“the“text“it“is“attac˜hed“to)“in“theŽ¡‘9Ðócenš²!ter–`eof“the“windo˜w.‘ ÚSetting“this“v‘ÿdDariable“to“1“causes“a“kind“of“Þ"ÝsmoMÞoth“scrollingÞ"Ž¡‘9ÐóÝwhic²!h–¦fsome“pMÞeople“prefer.ŽŸÞISO-LatinŽ¡‘9ÐóÝWhen–/ßset“to“ÞOnÝ,‘’ŸòÝConcept‘¦fIndex’_201ŽŽŽ ƒ3ÚŸôðРý´¬NLPGL‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘y¬91Ž¤nonlinear‘Tequations‘#‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘TÁ¬87Ž¡nonlinear‘Tprogramming‘‡a‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¹¬91Ž¡not‘TopAÇerator‘åš‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘U¬35Ž¡n•¾9um“bAÇers,‘Tlottery‘½±‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ïl¬159Ž¡n•¾9um“bAÇers,‘Tprime‘œÎ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Έ¬159Ž¡n•¾9umeric‘Tconstan“t‘Çé‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ù¤¬21Ž¡n¾9umeric‘Tv‘ÿ|ralueCb‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘u¬21Ž©ëEOŽŸ¬Octa•¾9v“e–Tcommand“options‘©°‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ûk¬19Ž¡ODE‘‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Á»¬89Ž¡opAÇerator‘TprecedenceÕ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘M¬39Ž¡opAÇerators,‘Tarithmetic•‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘HP¬33Ž¡opAÇerators,‘Tassignmen¾9t‘°‰‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘âD¬37Ž¡op•AÇerators,‘Tb“o“olean‘ \‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘R¬35Ž¡opAÇerators,‘Tdecremen¾9t6–‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘hP¬39Ž¡opAÇerators,‘Tincremen¾9t‘ü\‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘.¬39Ž¡opAÇerators,‘Tlogical‘æ"‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ݬ35Ž¡opAÇerators,‘Trelational‘ã‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ Á¬34Ž¡optimization‘Ê}‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ü8¬91Ž¡options,›TOcta•¾9v“e˜command`Í‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘’ˆ¬19Ž¡or‘TopAÇerator‘f~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘˜8¬35Ž¡output›Tcon•¾9v“ersions,˜for˜Éprintf‘îU‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬124Ž¦ëEPŽŸ¬patc¾9hes,‘Tsubmitting‘œ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Í»¬171Ž¡plotting‘Ñ™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ T¬108Ž¡precision‘T(Éprintf¬)‘9Z‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘k¬123Ž¡prime‘Tn•¾9um“bAÇers‘屑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ k¬159Ž¡program,–Tself“con¾9tained‘ƒ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘´Á¬15Ž¡programs,‘TdoAÇcumen¾9ting‘A±‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘sk¬15Ž¦ëEQŽŸ¬QP‘ûê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘-¤¬91Ž¡quadratic‘Tprogramming‘%(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Vã¬91Ž¡quitting‘ToAÇcta•¾9v“e‘ò ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ #Ƭ11Ž¡quotien¾9t‘Mš‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘T¬33Ž¦ëERŽŸ¬range‘Texpressions‘T‰‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†D¬25Ž¡relational‘TopAÇerators‘±‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ol¬34Ž¡repAÇorting›Tbugs‘ Í‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Rˆ¬168,˜169ŽŽ ý´’ô¢ results,›Tincorrect‘ö:‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘'ô¬168,˜170Ž©ÌÍ’ô¢ ëESŽŸ’ô¢ ¬script‘T les‘Ž‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘±I¬49Ž¤’ô¢ scripts,‘Texecutable‘]È‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‚¬15Ž¡’ô¢ self–Tcon¾9tained“programs‘øä‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘*Ÿ¬15Ž¡’ô¢ short-circuit‘Tev‘ÿ|raluation‘æ"‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ݬ36Ž¡’ô¢ side‘Te ect#‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘OÞ¬37Ž¡’ô¢ startup‘DÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘v‡¬20Ž¡’ô¢ statemen¾9tsYÈ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‹‚¬41Ž¡’ô¢ strings‘ür‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘.,¬22,‘T141Ž¡’ô¢ structures‘r‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 2,¬27Ž¡’ô¢ submitting‘Tdi sZ«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Œe¬171Ž¡’ô¢ submitting‘Tpatc¾9hes‘äã‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ž¬171Ž¡’ô¢ subtraction‘DÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘v‡¬33Ž¡’ô¢ suggestions‘9Þ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘k˜¬169Ž¦’ô¢ ëETŽŸ’ô¢ ¬tests–Tfor“equalit¾9yx‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©»¬34Ž¡’ô¢ transpAÇose‘Û‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ׬33Ž¡’ô¢ transpAÇose,‘Tcomplex-conjugate‘Ÿ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÑI¬33Ž¡’ô¢ troubleshoAÇoting‘Ÿê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ѥ¬167Ž¦’ô¢ ëEUŽŸ’ô¢ ¬unary‘Tmin¾9us‘‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘4À¬33Ž¡’ô¢ unde ned‘TbAÇeha¾9vior‘î~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 8¬168Ž¡’ô¢ unde ned–Tfunction“v‘ÿ|ralue‘ ð‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘<ª¬168Ž¡’ô¢ use–Tof“commen¾9ts‘þ9‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘/ô¬15Ž¡’ô¢ user-de ned‘Tfunctions‘˜s‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ê-¬49Ž¡’ô¢ user-de ned‘Tv‘ÿ|rariables‘Z¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Œf¬25Ž¦’ô¢ ëEVŽŸ’ô¢ ¬V‘ÿ:«ariable-length–Targumen¾9t“listsh‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘D#¬53Ž¡’ô¢ V‘ÿ:«ariable-length–Treturn“listsrh‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¤#¬54Ž¡’ô¢ v‘ÿ|rariables^#‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ݬ61Ž¡’ô¢ v‘ÿ|rariables,‘Tbuilt-in‘#x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘U2¬61Ž¡’ô¢ v‘ÿ|rariables,‘Tuser-de nedÉ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Cƒ¬25Ž¦’ô¢ ëEWŽŸ’ô¢ ¬w•¾9arran“t“yAš‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘sU¬2Ž¡’ô¢ Éwhile‘T¬statemen¾9t‘'|‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Y6¬43Ž¡’ô¢ wrong›Tansw¾9ers‘9‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Kô¬168,˜170ŽŽŽŽŸŒ‹ÊÓŸòÝ202’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹ËãùŸòÝV‘ÿeariable‘¦fIndex’WV203ŽŽŽ ƒ3Ú ý¨ðÐèV‘þaGariable‘¦MIndexŽŽ 1 ýøëEAŽ¤Éans‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬69Ž©Éautomatic‘‘$‰c4ÕÂŽ‘færeplot‘ïø‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ !³¬64,‘T108ŽŸëEDŽ¡Édefault‘‘$‰c4ÕÂŽ–fæsave‘‘$‰c4ÕÂŽ“format‘­—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ßR¬64,‘T119Ž¦Édo‘‘$‰c4ÕÂŽ–fæfortran‘‘$‰c4ÕÂŽ“indexing‘* ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘[Ĭ64ŽŸëEEŽ¡ÉEDITOR‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬62Ž¦Éempty‘‘$‰c4ÕÂŽ–fælist‘‘$‰c4ÕÂŽ“elements‘‘$‰c4ÕÂŽ“ok‘稑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘c¬65Ž¦Éeps‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬61Ž©ëEGŽ¡Égnuplot‘‘$‰c4ÕÂŽ‘fæbinary‘ ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;K¬65Ž¦ëEIŽ¡ÉI¬,–TÉi¬,“ÉJ¬,“Éj¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬61Ž¤Éignore‘‘$‰c4ÕÂŽ–fæfunction‘‘$‰c4ÕÂŽ“time‘‘$‰c4ÕÂŽ“stamp‘»”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íO¬65Ž¡ÉIMAGEPATH‘Úß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ š¬62Ž¡Éimplicit‘‘$‰c4ÕÂŽ–fæstr‘‘$‰c4ÕÂŽ“to‘‘$‰c4ÕÂŽ“num‘‘$‰c4ÕÂŽ“ok‘‘‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»¬65Ž¡ÉInf¬,‘TÉinf‘C‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘2þ¬61Ž¡ÉINFO‘‘$‰c4ÕÂŽ‘fæFILE‘„7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘µò¬62Ž¦ëELŽ¤ÉLOADPATH‘)r‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘[-¬62Ž¦ëENŽ¡ÉNaN¬,‘TÉnan‘C‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘2þ¬61ŽŸÉnargout‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©À¬51Ž¦ëEOŽ¡ÉOCTAVE‘‘$‰c4ÕÂŽ‘fæVERSION‘ ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;K¬63Ž¤Éok‘‘$‰c4ÕÂŽ–fæto‘‘$‰c4ÕÂŽ“lose‘‘$‰c4ÕÂŽ“imaginary‘‘$‰c4ÕÂŽ“part‘¥G‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘׬65Ž¡Éoutput‘‘$‰c4ÕÂŽ–fæmax‘‘$‰c4ÕÂŽ“field‘‘$‰c4ÕÂŽ“width‘稑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘c¬65Ž¡Éoutput‘‘$‰c4ÕÂŽ‘fæprecision‘lj‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž%¬65ŽŽ ýø’ô¢ ëEPŽ©’ô¢ Épage‘‘$‰c4ÕÂŽ–fæscreen‘‘$‰c4ÕÂŽ“output‘xœ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ªW¬66Ž¤’ô¢ ÉPAGERó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬63Ž¡’ô¢ Épi‘ò¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘$g¬61Ž¡’ô¢ Éprefer‘‘$‰c4ÕÂŽ–fæcolumn‘‘$‰c4ÕÂŽ“vectors‘Œã‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¾ž¬66Ž¡’ô¢ Éprefer‘‘$‰c4ÕÂŽ–fæzero‘‘$‰c4ÕÂŽ“one‘‘$‰c4ÕÂŽ“indexingJ‚‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|=¬66Ž¡’ô¢ Éprint‘‘$‰c4ÕÂŽ–fæanswer‘‘$‰c4ÕÂŽ“id‘‘$‰c4ÕÂŽ“name‘„ΑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶‰¬66Ž¡’ô¢ Éprint‘‘$‰c4ÕÂŽ–fæempty‘‘$‰c4ÕÂŽ“dimensions>P‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘p ¬66Ž¡’ô¢ Épropagate‘‘$‰c4ÕÂŽ–fæempty‘‘$‰c4ÕÂŽ“matrices‘¯b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘á¬67Ž¡’ô¢ ÉPS1‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬63Ž¡’ô¢ ÉPS2‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬63Ž¡’ô¢ ÉPWD‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬69ŽŸ’ô¢ ëERŽ¦’ô¢ Érealmax‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©À¬61Ž¡’ô¢ Érealmin‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©À¬61Ž¡’ô¢ Éresize‘‘$‰c4ÕÂŽ–fæon‘‘$‰c4ÕÂŽ“range‘‘$‰c4ÕÂŽ“error‘6;‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gö¬67Ž¡’ô¢ Éreturn‘‘$‰c4ÕÂŽ–fælast‘‘$‰c4ÕÂŽ“computed‘‘$‰c4ÕÂŽ“value‘»”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íO¬67ŽŸ’ô¢ ëESŽ¦’ô¢ Ésave‘‘$‰c4ÕÂŽ‘fæprecision~æ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘°¡¬67,‘T119Ž¡’ô¢ ÉSEEK‘‘$‰c4ÕÂŽ‘fæCUR‘ÒÊ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ …¬61Ž¡’ô¢ ÉSEEK‘‘$‰c4ÕÂŽ‘fæEND‘ÒÊ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ …¬61Ž¡’ô¢ ÉSEEK‘‘$‰c4ÕÂŽ‘fæSET‘ÒÊ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ …¬61Ž¡’ô¢ Ésilent‘‘$‰c4ÕÂŽ‘fæfunctions‘lj‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž%¬67Ž¡’ô¢ Ésplit‘‘$‰c4ÕÂŽ–fælong‘‘$‰c4ÕÂŽ“rowsV‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡Ø¬68Ž¡’ô¢ Éstderr‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬62Ž¡’ô¢ Éstdinó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬62Ž¡’ô¢ Éstdout‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬62Ž¤’ô¢ ëETŽ¦’ô¢ Étreat‘‘$‰c4ÕÂŽ–fæneg‘‘$‰c4ÕÂŽ“dim‘‘$‰c4ÕÂŽ“as‘‘$‰c4ÕÂŽ“zero‘ß“‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ N¬68Ž¡’ô¢ ëEWŽ¦’ô¢ Éwarn‘‘$‰c4ÕÂŽ–fæassign‘‘$‰c4ÕÂŽ“as‘‘$‰c4ÕÂŽ“truth‘‘$‰c4ÕÂŽ“valueV´‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ˆo¬68Ž¤’ô¢ Éwarn‘‘$‰c4ÕÂŽ–fæcomma‘‘$‰c4ÕÂŽ“in‘‘$‰c4ÕÂŽ“global‘‘$‰c4ÕÂŽ“decl‘¥G‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘׬69Ž¡’ô¢ Éwarn‘‘$‰c4ÕÂŽ–fædivide‘‘$‰c4ÕÂŽ“by‘‘$‰c4ÕÂŽ“zero‘Óa‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬69Ž¡’ô¢ Éwhitespace‘‘$‰c4ÕÂŽ–fæin‘‘$‰c4ÕÂŽ“literal‘‘$‰c4ÕÂŽ“matrix‘n‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P)¬64ŽŽŽŽŸŒ‹ÌäMŸòÝ204’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹Í(KŸòÝF‘ÿeunction‘¦fIndex’|É@205ŽŽŽ ƒ3Ú ý¨ðÐèF‘þaGunction‘¦MIndexŽŽžXŸ,$ªëE-Ž©É-ascii‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬119,‘T120Ž¤É-binary‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬120Ž¡É-float-binary‘m‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž¿¬120Ž¡É-force‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬120Ž¡É-mat-binary€‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘±;¬120,‘T121Ž¡É-save-builtins‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬120Ž¤ ÌëE.Ž¦É.octaverc‘Úß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ š¬20Ž¡ëE[Ž¦É[ÍkÉ,–TÍpÉ,“Íe‘É]“=“lqr“(ÍaÉ,“ÍbÉ,“ÍqÉ,“ÍrÉ,“Íz}ÞÉ)‘¢ú‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ô´¬98Ž¡ëH~Ž¦É~/.octaverc=¹‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ot¬20Ž¡ëEAŽ¦Éabcddim–T(ÍaÉ,“ÍbÉ,“ÍcÉ,“ÍdXæÉ)‘ˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¹Ã¬95Ž¤Éabs‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬72Ž¡ÉacosU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éacoshó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡ÉacotU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éacothó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡ÉacscU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éacschó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡ÉallbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬137Ž¡Éangle‘T(Íx‘žÂÉ)‘Iˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{B¬72Ž¡ÉanybR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬137Ž¡Éare–T(ÍaÉ,“ÍbÉ,“ÍcÉ,“Íopt.ñÉ)‘×O‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬95Ž¡Éarg‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬72Ž¡ÉasecU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éasechó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡ÉasinU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éasinhó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡ÉatanU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Éatan2ó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡Éatanhó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬73Ž¡Éaxis‘T(Ílimits\ûÉ)‘Ì2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ýì¬113ŽŽŸ,$ª’ô¢ ëEBŽ©’ô¢ Ébalance‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©À¬75Ž¤’ô¢ Ébar–T(ÍxÉ,“Íy‘Æ;É)‘c{‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘•5¬112Ž¡’ô¢ ÉbetaU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬74Ž¡’ô¢ Ébetai–T(ÍaÉ,“ÍbÉ,“Íx‘žÂÉ)‘î)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ã¬74Ž¡’ô¢ Ébug‘‘$‰c4ÕÂŽ‘færeport‘wk‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©&¬168,‘T169ŽŸ$0’ô¢ ëECŽ¦’ô¢ Éc2d–T(ÍaÉ,“ÍbÉ,“Ít.ñÉ)Yq‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‹+¬95Ž¡’ô¢ Écasesen‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬159Ž¡’ô¢ Écd‘°å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘â ¬146Ž¡’ô¢ Éceil‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬71Ž¡’ô¢ Échdir‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬147Ž¡’ô¢ Échol‘T(ÍaÉ)‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬77Ž¡’ô¢ ÉclcbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬146Ž¡’ô¢ Éclear–TÍpattern“É...‘h‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™Ø¬155Ž¡’ô¢ Éclearplot‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬113Ž¡’ô¢ ÉclgbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬113Ž¡’ô¢ Éclock‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬145Ž¡’ô¢ Écloseplot‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬113Ž¡’ô¢ Écolloc‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬93Ž¡’ô¢ Écolormap‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬115Ž¡’ô¢ Écolumns‘T(ÍaÉ)‘Úß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ š¬154Ž¡’ô¢ Écompan‘T(Íc‘‹É)‘g|‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™7¬83Ž¡’ô¢ ÉcomplementJ…‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|@¬103Ž¡’ô¢ Écomputer‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬147Ž¡’ô¢ Écond‘T(ÍaÉ)‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬75Ž¡’ô¢ Éconj‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬72Ž¡’ô¢ Écontour–T(ÍzÉ,“ÍnÉ,“ÍxÉ,“Íy‘Æ;É)—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘AQ¬111Ž¡’ô¢ Éconv–T(ÍaÉ,“Íb1ÆÉ)‘ é‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ò¤¬83Ž¡’ô¢ Écorrcoef–T(Íx‘´É[,“Íy‘Æ;É])‘Û‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘±•¬105Ž¡’ô¢ Écos‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¡’ô¢ ÉcoshU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡’ô¢ Écot‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¡’ô¢ ÉcothU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡’ô¢ Écov–T(Íx‘´É[,“Íy‘Æ;É])‘ú‚‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘,<¬105Ž¡’ô¢ Écputime‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬145Ž¡’ô¢ Écreate‘‘$‰c4ÕÂŽ‘fæset‘óÝ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘%˜¬103Ž¡’ô¢ Écsc‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¡’ô¢ ÉcschU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73ŽŽŽŽŸŒ‹Î(ŸŸòÝ206’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý|Ì&Ÿ,$ªÉcumprod‘T(Íx‘žÂÉ)‘¬b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Þ¬73Ž¤Écumsum‘T(Íx‘žÂÉ)‘úõ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘,¯¬73Ž©¯»ëEDŽŸÉdare–T(ÍaÉ,“ÍbÉ,“ÍcÉ,“ÍrÉ,“Íopt.ñÉ)‘üÓ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ .Ž¬95Ž¡Édassló‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬90Ž¡Édassl‘‘$‰c4ÕÂŽ‘fæoptionsIë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{¦¬90Ž¡Édate¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬145Ž¡Édeconv–T(ÍyÉ,“ÍaÉ)‘=Š‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘oD¬83Ž¡Édet‘T(ÍaÉ)Hº‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘zu¬75Ž¡Édgram–T(ÍaÉ,“Íb1ÆÉ)‘RV‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘„¬96Ž¡Édiag¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬134Ž¡Édiary‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬149Ž¡ÉdirbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬147Ž¡Édisp¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬117Ž¡Édlqe–T(ÍaÉ,“ÍgÉ,“ÍcÉ,“ÍsigwÉ,“Ísigv‘ÛÉ[,“Íz}ÞÉ])‘åÏ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ Š¬96Ž¡Édlqr–T(ÍaÉ,“ÍbÉ,“ÍqÉ,“Ír‘º«É[,“Íz}ÞÉ])‘‰ý‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»·¬96Ž¡Édlyap–T(ÍaÉ,“Íb1ÆÉ)‘RV‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘„¬97Ž¡Édocument‘TÍsym¾9bAÇol‘n:text‘Ž‘ÅU.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ X¬158Ž¦ëEEŽŸÉedit‘‘$‰c4ÕÂŽ‘fæhistoryV·‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ˆr¬149Ž¡Éeig‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬75Ž¡Éerf‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬74Ž¡Éerfc‘T(Íz}ÞÉ)‘ 7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ <ò¬74Ž¡Éerfinv‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬74Ž¡Éerror‘T(Ímsg‘Æ;É)‘‘â‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ãœ¬157Ž¡Éetime‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬145Ž¡Éeval¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬153Ž¡Éexist‘T(Íname‘É)‘õD‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘&ÿ¬156Ž¡Éexit‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ Ϭ11,‘T159Ž¡Éexp‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬71Ž¡ÉexpmU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬80Ž¡ÉeyebR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬133Ž¦ëEFŽŸÉfclose‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬122Ž¡Éfeof¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬131Ž¡Éferror‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬131Ž¡Éfeval‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬153Ž¡Éfflush‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬117Ž¡Éfft‘T(ÍaÉ)ó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬101Ž¡Éfft2‘T(ÍaÉ)‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬101ŽŽŸ,$ª’ô¢ Éfftconv–T(ÍaÉ,“ÍbÉ,“ÍN‘î—É)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ V¬101Ž¤’ô¢ Éfftfilt–T(ÍbÉ,“ÍxÉ,“ÍN‘î—É)‘͸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÿr¬101Ž¡’ô¢ Éfgets‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬131Ž¡’ô¢ Éfile‘‘$‰c4ÕÂŽ–fæin‘‘$‰c4ÕÂŽ“path–T(ÍpathÉ,“Í le‘É)#‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘FÞ¬158Ž¡’ô¢ Éfilter–T(ÍbÉ,“ÍaÉ,“Íx‘žÂÉ)]Ï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‰¬101Ž¡’ô¢ Éfind¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬138Ž¡’ô¢ Éfinite‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬137Ž¡’ô¢ Éfix‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬71Ž¡’ô¢ Éfliplr‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬138Ž¡’ô¢ Éflipud‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬138Ž¡’ô¢ Éfloor‘T(Íx‘žÂÉ)‘Iˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{B¬71Ž¡’ô¢ Éflops‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬159Ž¡’ô¢ Éfopen‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬121Ž¡’ô¢ Éformat‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬118Ž¡’ô¢ Éfprintf–T(Í leÉ,“ÍtemplateÉ,“...)‘ «‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Òe¬122Ž¡’ô¢ Éfread–T(Í leÉ,“ÍsizeÉ,“ÍprecisionÉ)c‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6¬130Ž¡’ô¢ Éfreport‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬131Ž¡’ô¢ Éfreqz‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬102Ž¡’ô¢ Éfrewind‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬131Ž¡’ô¢ Éfscanf–T(Í leÉ,“Ítemplate‘É)W;‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ˆö¬127Ž¡’ô¢ Éfseek‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬131Ž¡’ô¢ Éfsolve‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬87Ž¡’ô¢ Éfsolve‘‘$‰c4ÕÂŽ‘fæoptions‘ ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;K¬87Ž¡’ô¢ Éftell‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬131Ž¡’ô¢ Éfwrite–T(Í leÉ,“ÍdataÉ,“ÍprecisionÉ)‘ Õ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ >¬130Ž©‡˜’ô¢ ëEGŽŸ’ô¢ Égamma‘T(Íz}ÞÉ)‘¼¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘î_¬74Ž¡’ô¢ Égammai–T(ÍaÉ,“Íx‘žÂÉ)‘î)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ã¬74Ž¡’ô¢ Égcd–T(ÍxÉ,“...)‘Q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘± ¬71Ž¡’ô¢ Égetenv‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬146Ž¡’ô¢ Égivens‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬76Ž¡’ô¢ Égls–T(ÍYÉ,“ÍXÉ,“ÍOuçÉ)x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©Ó¬91Ž¡’ô¢ Égplot‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬107Ž¡’ô¢ Égray‘T(ÍnÉ)‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬115Ž¡’ô¢ Égray2ind‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬115Ž¡’ô¢ Égrid¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬112Ž¡’ô¢ Égsplot‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬107Ž¦’ô¢ ëEHŽŸ’ô¢ Éhadamard‘T(Ík‘‹É)%å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘WŸ¬135Ž¡’ô¢ Éhankel–T(ÍcÉ,“Ír‘¥WÉ)‘Œ¥‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¾`¬135Ž¡’ô¢ Éhelp¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬151ŽŽŽŽŸŒ‹Ï‰ŸòÝF‘ÿeunction‘¦fIndex’|É@207ŽŽŽ ƒ3Ú ý|Ì&Ÿ,$ªÉhess‘T(ÍaÉ)‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬77Ž¤Éhilb‘T(ÍnÉ)‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬135Ž¡Éhist–T(ÍyÉ,“Íx‘žÂÉ)‘(¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Z_¬113Ž¡Éhistory‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬149Ž¡Éhold¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬110Ž¡Éhome¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬146ŽŸ‡˜ëEIŽŸÉifft‘T(ÍaÉ)‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬102Ž¡Éifft2‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬102Ž¡Éimag‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬72Ž¡Éimage‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬115Ž¡Éimagesc‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬115Ž¡Éimshow‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬115Ž¡Éind2gray‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬115Ž¡Éind2rgb‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬116Ž¡Éinput‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬118Ž¡Éint2str‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬143Ž¡Éintersection‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬103Ž¡Éinv‘T(ÍaÉ)Hº‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘zu¬76Ž¡Éinverse‘T(ÍaÉ)‘¦‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Na¬76Ž¡Éinvhilb‘T(ÍnÉ)‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬135Ž¡Éis‘‘$‰c4ÕÂŽ‘fæcontrollable–T(ÍaÉ,“ÍbÉ,“ÍtolXæÉ)‘Þè‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ £¬97Ž¡Éis‘‘$‰c4ÕÂŽ‘fæglobal‘T(ÍaÉ)‘ç‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘̬155Ž¡Éis‘‘$‰c4ÕÂŽ–fæleap‘‘$‰c4ÕÂŽ“year‘‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘1ʬ146Ž¡Éis‘‘$‰c4ÕÂŽ‘fæmatrix‘T(ÍaÉ)‘ç‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘̬155Ž¡Éis‘‘$‰c4ÕÂŽ‘fæobservable–T(ÍaÉ,“ÍcÉ,“ÍtolXæÉ)‘ñd‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘#¬97Ž¡Éis‘‘$‰c4ÕÂŽ‘fæscalar‘T(ÍaÉ)‘ç‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘̬155Ž¡Éis‘‘$‰c4ÕÂŽ‘fæsquare‘T(Íx‘žÂÉ)vÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¨‡¬155Ž¡Éis‘‘$‰c4ÕÂŽ‘fæstruct‘„7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘µò¬29Ž¡Éis‘‘$‰c4ÕÂŽ‘fæsymmetric–T(ÍxÉ,“ÍtolXæÉ)‘¨R‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ú ¬155Ž¡Éis‘‘$‰c4ÕÂŽ‘fævector‘T(ÍaÉ)‘ç‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘̬155Ž¡Éisempty‘T(ÍaÉ)‘Úß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ š¬155Ž¡Éishold‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬110Ž¡Éisieee‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬147Ž¡Éisinf‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬137Ž¡Éisnan‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬137Ž¡Éisstr‘T(ÍaÉ)‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©À¬155ŽŸ‡˜ëEKŽŸÉkbhit‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬131Ž¡Ékeyboard‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬119Ž¡Ékron–T(ÍaÉ,“Íb1ÆÉ)‘ é‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ò¤¬80ŽŽŸ,$ª’ô¢ Ékurtosis‘T(Íx‘žÂÉ)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘M¬105Ž©"Ze’ô¢ ëELŽŸ’ô¢ Élcm–T(ÍxÉ,“...)‘Q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘± ¬71Ž¤’ô¢ Élength‘T(ÍaÉ)‘)r‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘[-¬154Ž¡’ô¢ Élgamma‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬74Ž¡’ô¢ Élinspace‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬134Ž¡’ô¢ Élist‘‘$‰c4ÕÂŽ‘fæprimes‘¥J‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘׬159Ž¡’ô¢ Éload¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬120Ž¡’ô¢ Éloadimage‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬116Ž¡’ô¢ Élog‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬72Ž¡’ô¢ Élog10‘T(Íx‘žÂÉ)‘Iˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{B¬72Ž¡’ô¢ Élog2‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬72Ž¡’ô¢ Éloglog‘T(Íargs\ûÉ)‘3}‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘e8¬110Ž¡’ô¢ Élogm‘T(ÍaÉ)‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬80Ž¡’ô¢ Élogspace‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬134Ž¡’ô¢ Élqe–T(ÍaÉ,“ÍgÉ,“ÍcÉ,“ÍsigwÉ,“ÍsigvÉ,“Íz}ÞÉ)‘¢à‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ôš¬97Ž¡’ô¢ Élqr–T(ÍaÉ,“ÍbÉ,“ÍqÉ,“ÍrÉ,“Íz}ÞÉ)6›‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘hV¬98Ž¡’ô¢ Éls‘°å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘â ¬147Ž¡’ô¢ Élsodeó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬89Ž¡’ô¢ Élsode‘‘$‰c4ÕÂŽ‘fæoptionsIë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{¦¬89Ž¡’ô¢ Élu‘T(ÍaÉ)‘—M‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ɬ77Ž¡’ô¢ Élyap–T(ÍaÉ,“ÍbÉ,“Íc‘‹É)‘©C‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Úþ¬98Ž¦’ô¢ ëEMŽŸ’ô¢ Émahalanobis–T(ÍxÉ,“Íy‘Æ;É)‘ý‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘.Õ¬105Ž¡’ô¢ Émax‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬72Ž¡’ô¢ Émean‘T(ÍaÉ)‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬105Ž¡’ô¢ Émedian‘T(ÍaÉ)‘)r‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘[-¬105Ž¡’ô¢ Émenu–T(ÍtitleÉ,“Íopt1É,“ó5ùž" cmmi9²:–Šª:“:Ž‘j¤É)‘¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÞI¬157Ž¡’ô¢ Émesh–T(ÍxÉ,“ÍyÉ,“Íz}ÞÉ)‘n‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ŸÌ¬112Ž¡’ô¢ Émeshdom–T(ÍxÉ,“Íy‘Æ;É))/‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Zé¬112Ž¡’ô¢ Émin‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬72Ž¦’ô¢ ëENŽŸ’ô¢ Énargchk–T(Ínargin‘Ž‰c4ÆgŽ›TyminÉ,“Ínargin‘Ž‰c4ÆgŽ˜maxÉ,“ÍnÉ)‘ßx‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘2¬158Ž¡’ô¢ Énewtroot‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬153Ž¡’ô¢ Énorm–T(ÍaÉ,“ÍpEƒÉ)‘— ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÈŬ76Ž¡’ô¢ Énpsoló‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬91Ž¡’ô¢ Énpsol‘‘$‰c4ÕÂŽ‘fæoptionsIë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{¦¬91Ž¡’ô¢ Énull–T(ÍaÉ,“ÍtolXæÉ)‘È‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ù¿¬76Ž¡’ô¢ Énum2str‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬143ŽŽŽŽŸŒ‹ÐòðŸòÝ208’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý|Ì&Ÿ,$ªëEOŽ©Éocean‘T(ÍnÉ)‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬116Ž¤ÉOCTAVE‘‘$‰c4ÕÂŽ‘fæHOME/lib/octave/VERSION/startup/octavercŽ¡‘®‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ºq¬20Ž¡Éoctave‘‘$‰c4ÕÂŽ–fætmp‘‘$‰c4ÕÂŽ“file‘‘$‰c4ÕÂŽ“name‘C‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘t¬158Ž¡Éols–T(ÍYÉ,“ÍX‘åƒÉ)‘•ú‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ç´¬92Ž¡Éones¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬133Ž¡Éorth–T(ÍaÉ,“ÍtolXæÉ)‘È‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ù¿¬76ŽŸëEPŽ¦Épause‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬147Ž¡Éperror–T(ÍnameÉ,“Ín¾9umÉ)wÑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©~¬157Ž¡Épinv–T(ÍXÉ,“ÍtolXæÉ)‘®k‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘à%¬77Ž¡Éplot‘T(Íargs\ûÉ)‘У‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ^¬108Ž¡Épolar–T(ÍthetaÉ,“Írhos½É)‘ìx‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘2¬111Ž¡Époly‘T(ÍaÉ)‘_‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ :¬83Ž¡Épolyderiv‘T(Íc‘‹É){ÑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘­~¬83Ž¡Épolyinteg‘T(Íc‘‹É){ÑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘­~¬83Ž¡Épolyreduce‘T(Íc‘‹É)-0‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘^ë¬84Ž¡Épolyval–T(ÍcÉ,“Íx‘žÂÉ)‘á]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¬84Ž¡Épolyvalm–T(ÍcÉ,“Íx‘žÂÉ)‘’Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ä„¬84Ž¡Éprintf–T(ÍtemplateÉ,“...)‘xí‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ª¨¬122Ž¡Éprod‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬73Ž¡Épurge‘‘$‰c4ÕÂŽ–fætmp‘‘$‰c4ÕÂŽ“filesV‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘F¬113Ž¡ÉpwdbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬147ŽŸëEQŽ¦Éqpsoló‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬91Ž¡Éqpsol‘‘$‰c4ÕÂŽ‘fæoptionsIë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{¦¬91Ž¡Éqr‘T(ÍaÉ)‘—M‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ɬ78Ž¡ÉquadU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬93Ž¡Équad‘‘$‰c4ÕÂŽ‘fæoptions‘˜~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ê9¬93Ž¡Équit‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ Ϭ11,‘T159Ž¡Éqzhess–T(ÍaÉ,“Íb1ÆÉ)‘ÑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘5~¬80Ž¡Éqzval–T(ÍaÉ,“Íb1ÆÉ)‘RV‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘„¬81ŽŸëERŽ¦Érand¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬133Ž¡Érank–T(ÍaÉ,“ÍtolXæÉ)‘È‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ù¿¬77Ž¡Éreal‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬72Ž¡Érem–T(ÍxÉ,“Íy‘Æ;É)‘¥B‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Öü¬72Ž¡Éreplot‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬108Ž¡Éreshape‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬139ŽŽŸ,$ª’ô¢ Éresidue–T(ÍbÉ,“ÍaÉ,“ÍtolXæÉ)‘›ð‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Í«¬84Ž¤’ô¢ Érgb2ind‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬116Ž¡’ô¢ Éroots‘T(Ív‘Æ;É)‘5Ë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘g†¬85Ž¡’ô¢ Érot90‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬138Ž¡’ô¢ Éround‘T(Íx‘žÂÉ)‘Iˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{B¬71Ž¡’ô¢ Érows‘T(ÍaÉ)‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬154Ž¡’ô¢ Érun‘‘$‰c4ÕÂŽ‘fæhistory‘¥J‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘׬149ŽŸA0’ô¢ ëESŽŸ’ô¢ Ésave¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬119Ž¡’ô¢ Ésaveimage‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬116Ž¡’ô¢ Éscanf‘T(Ítemplate‘É)/~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘a8¬127Ž¡’ô¢ Éschuró‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬79Ž¡’ô¢ Ésec‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¡’ô¢ ÉsechU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡’ô¢ Ésemilogx‘T(Íargs\ûÉ)‘–W‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ȭ110Ž¡’ô¢ Ésemilogy‘T(Íargs\ûÉ)‘–W‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ȭ110Ž¡’ô¢ ÉsetbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬108Ž¡’ô¢ Ésetstr‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬143Ž¡’ô¢ Éshell‘‘$‰c4ÕÂŽ‘fæcmd‘Bp‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘t+¬146Ž¡’ô¢ Éshow¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬108Ž¡’ô¢ Ésign‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬71Ž¡’ô¢ Ésin‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¡’ô¢ Ésinc‘T(Íx‘žÂÉ)‘VT‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ˆ¬102Ž¡’ô¢ ÉsinhU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡’ô¢ Ésize‘T(ÍaÉ)‘Ƙ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øS¬155Ž¡’ô¢ Éskewness‘T(Íx‘žÂÉ)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘M¬105Ž¡’ô¢ Ésombrero‘T(ÍnÉ)J…‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|@¬113Ž¡’ô¢ Ésort¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬139Ž¡’ô¢ Ésprintf–T(ÍtemplateÉ,“...)‘*Z‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘\¬122Ž¡’ô¢ Ésqrt‘T(Íx‘žÂÉ)‘˜‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÉÕ¬72Ž¡’ô¢ Ésqrtm‘T(ÍaÉ)‘¹Ì‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘뇬80Ž¡’ô¢ Ésscanf–T(ÍstringÉ,“Ítemplate‘É)‘Ñü‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘·¬127Ž¡’ô¢ Éstairs–T(ÍxÉ,“Íy‘Æ;É)w‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘©|¬112Ž¡’ô¢ Éstd‘T(ÍaÉ)ó‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8®¬105Ž¡’ô¢ Éstrcmp‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬143Ž¡’ô¢ Ésum‘T(Íx‘žÂÉ)‘殑ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ h¬73Ž¡’ô¢ Ésumsq‘T(Íx‘žÂÉ)‘Iˆ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘{B¬74Ž¡’ô¢ Ésvd‘T(ÍaÉ)Hº‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘zu¬79Ž¡’ô¢ Ésyl–T(ÍaÉ,“ÍbÉ,“Íc‘‹É)‘÷Ö‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ )‘¬81Ž¡’ô¢ Ésystem‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬146ŽŽŽŽŸŒ‹Ñ ZñŸòÝF‘ÿeunction‘¦fIndex’|É@209ŽŽŽ ƒ3Ú þÂðРþæëETŽ©Étan‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÕÔ¬73Ž¤ÉtanhU†‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡A¬73Ž¡Étexas‘‘$‰c4ÕÂŽ‘fælotto‘¥J‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘׬159Ž¡ÉticbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬145Ž¡Étitle‘T(Ístring‘Æ;É)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6H¬112Ž¡ÉtocbR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘” ¬145Ž¡Étoeplitz–T(ÍcÉ,“Ír‘¥WÉ)‘ï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘!:¬135Ž¡Étrace‘T(ÍaÉ)‘¹Ì‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘뇬77Ž¡Étril¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬140Ž¡Étriu¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬140Ž¡Étype‘TÍname‘–eÉ...‘xÒ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ª¬158Ž¡Étzero–T(ÍaÉ,“ÍbÉ,“ÍcÉ,“ÍdÉ,“ÍbalXæÉ)‘Z)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‹ä¬99ŽŸëEUŽ¦Éundo‘‘$‰c4ÕÂŽ–fæstring‘‘$‰c4ÕÂŽ“escapes‘èB‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ý¬143Ž¡Éunion‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬103Ž¡Éusage‘T(Ímsg‘Æ;É)‘‘â‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ãœ¬157ŽŸëEVŽ¦Éva‘‘$‰c4ÕÂŽ‘fæarga¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘“s¬53ŽŽ þæ’ô¢ Éva‘‘$‰c4ÕÂŽ‘fæstart‘ÒÊ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ …¬53Ž¤’ô¢ Évander‘T(Íc‘‹É)‘%µ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Wp¬135Ž¡’ô¢ Éversion‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬147Ž¡’ô¢ Évr‘‘$‰c4ÕÂŽ‘fævala¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘“s¬54Ž©!€’ô¢ ëEWŽŸ’ô¢ Éwarning‘T(Ímsg‘Æ;É)‘ô¼‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘&v¬157Ž¡’ô¢ Éwhich‘TÍname‘–eÉ...‘*?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘[ú¬158Ž¡’ô¢ Éwho–TÍoptions‘rOpattern“É...Á‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘5{¬156Ž¡’ô¢ Éwhos¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬156Ž¦’ô¢ ëEXŽ¤’ô¢ Éxlabel‘T(Ístring‘Æ;É)‘Ä2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘õí¬113Ž¦’ô¢ ëEYŽ¡’ô¢ Éylabel‘T(Ístring‘Æ;É)‘Ä2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘õí¬113Ž¦’ô¢ ëEZŽ¡’ô¢ Ézeros‘Ód‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ¬133ŽŽŽŽŸŒ‹Ò ÂþŸòÝ210’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹Ó é9ŸòÝOpMÞerator‘¦fIndex’{[E211ŽŽŽ ƒ3Ú ý¨ðÐèOp‘Š=erator‘¦MIndexŽŽ P\( ýÜëE!Ž¤¬!Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬35Ž©!=‘Ê}‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ü8¬34ŽŸëE&Ž¡¬&(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6ã¬35Ž¦&&‘ˆ¶‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ºq¬36Ž©ëE'Ž¡¬'‘ D‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘=ÿ¬22,‘T33Ž¦ëE*Ž¡¬*‘N ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ƭ33ŽŸ**‘ D‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘=ÿ¬33Ž¦ëE,Ž¡¬,Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬23Ž¦ëE-Ž¡¬-(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6ã¬33ŽŸ{‘N ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ƭ39Ž¦ëE.Ž¡¬.'‘ D‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘=ÿ¬33Ž¤.*(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6ã¬33Ž¡.**‘Ñ™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ T¬33Ž¡.-‘Ê}‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ü8¬33Ž¡./(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6ã¬33Ž¡.É+‘”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 8O¬33Ž¡.É^‘”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 8O¬33Ž¡.É\‘”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 8O¬33Ž¦ëE/Ž¤¬/‘N ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ƭ33Ž¦ëE:Ž¡¬:Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬25Ž¦ëE;Ž¡¬;Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬23ŽŽ ýÜ’ô¢ ëE=Ž¤’ô¢ ¬=(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6ã¬37ŽŸ’ô¢ ==‘ˆ¶‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ºq¬34Ž©ff’ô¢ ëE[Ž¡’ô¢ ¬[Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬23Ž¦’ô¢ ëE]Ž¡’ô¢ ¬]Fï‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘xª¬23Ž¦’ô¢ ëH"Ž¡’ô¢ É"‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬22Ž¦’ô¢ ëH|Ž¡’ô¢ É|‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬35ŽŸ’ô¢ É||‘ò¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘$g¬36Ž¦’ô¢ ëH~Ž¡’ô¢ É~‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬35ŽŸ’ô¢ É~¬=‘ÄÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘öˆ¬34Ž¦’ô¢ ëH+Ž¡’ô¢ É+‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬33ŽŸ’ô¢ É++‘ò¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘$g¬39Ž¦’ô¢ ëH>Ž¡’ô¢ É>‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬34ŽŸ’ô¢ É>¬=‘ÄÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘öˆ¬34Ž¦’ô¢ ëH^Ž¡’ô¢ É^‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬33Ž¦’ô¢ ëH\Ž¡’ô¢ É\‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬33Ž¦’ô¢ ëH<Ž¡’ô¢ É<‘A?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘rú¬34Ž¤’ô¢ É<¬=‘ÄÍ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘öˆ¬34Ž¡’ô¢ É<>‘ò¬‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘$g¬34ŽŽŽŽŸŒ‹Ô éŸòÝ212’¤,ÿOcta•²!v“eŽŽŽ ƒ3ÚŸŒ‹Õ *¼ŸòÝReadline‘¦fIndex’}dü213ŽŽŽ ƒ3Ú ý¨ðÐèReadline‘¦MIndexŽŽŸþÛVŸ,$ªëEAŽ¤Éabort‘T(C-G)‘ΑÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÿά180Ž©Éaccept-line–T(Newline,“Return)6N‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘h ¬177ŽŸoâëEBŽ¡Ébackward-char‘T(C-B)g³‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™n¬177Ž¦Ébackward-delete-char‘T(Rubout)‘re‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¤ ¬178Ž¦Ébackward-kill-line‘T()‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬179Ž¦Ébackward-kill-word‘T(M-DEL)Oæ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¡¬179Ž¦Ébackward-word‘T(M-B)g³‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™n¬177Ž¦Ébeginning-of-history‘T(M-<)Oæ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¡¬178Ž¦Ébeginning-of-line‘T(C-A)‘;Ÿ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘mZ¬177ŽŸoâëECŽ¡Écapitalize-word‘T(M-C)‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬179Ž¦Éclear-screen‘T(C-L)‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬177Ž¦Écomplete‘T(TAB)‘ð’‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ "M¬180ŽŸoâëEDŽ¡Édelete-char‘T(C-D)‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬178Ž¦Édigit-argument–T(M-0,“M-1,“...“M--)Q±‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ƒl¬179Ž¦Édo-uppercase-version–T(M-A,“M-B,“...)‘ð¢‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘"]¬180Ž¦Édowncase-word‘T(M-L)g³‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™n¬179ŽŸoâëEEŽ¡Éediting-mode‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬176Ž¦Éend-of-history‘T(M->) ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘JÛ¬178Ž¦Éend-of-line‘T(C-E)‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬177ŽŸoâëEFŽ¡Éforward-char‘T(C-F)‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬177Ž¦Éforward-search-history‘T(C-S)‘Àø‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ò³¬178Ž¦Éforward-word‘T(M-F)‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬177Ž©oâëEHŽ¡Éhorizontal-scroll-mode‘¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘é̬176Ž¦ëEIŽ¡Éinteraction,‘Treadline‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬173ŽŽŸ,$ª’ô¢ ëEKŽ¤’ô¢ Ékill-line‘T(C-K)‘¡ÿ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Óº¬179ŽŸ’ô¢ Ékill-word‘T(M-D)‘¡ÿ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Óº¬179Ž©Áæ’ô¢ ëEMŽ¡’ô¢ Émark-modified-lines‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬176Ž¦’ô¢ ëENŽ¡’ô¢ Énext-history‘T(C-N)‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬178Ž¦’ô¢ ëEPŽ¡’ô¢ Épossible-completions‘T(M-?)Oæ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¡¬180Ž¤’ô¢ Éprefer-visible-bell‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬176Ž¡’ô¢ Éprefix-meta‘T(ESC)‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬180Ž¡’ô¢ Éprevious-history‘T(C-P)‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬178Ž¦’ô¢ ëEQŽ¤’ô¢ Équoted-insert–T(C-Q,“C-V)‘¿-‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ðè¬178Ž¦’ô¢ ëERŽ¡’ô¢ Ére-read-init-file–T(C-X“C-R)‘Ót‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘/¬180Ž¤’ô¢ Éreverse-search-history‘T(C-R)‘Àø‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ò³¬178Ž¡’ô¢ Érevert-line‘T(M-R)‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬180Ž¦’ô¢ ëESŽ¤’ô¢ Éself-insert–T(a,“b,“A,“1,“!,“...)‘„á‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶œ¬178Ž¦’ô¢ ëETŽ¡’ô¢ Étab-insert‘T(M-TAB)‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬178Ž¤’ô¢ Étranspose-chars‘T(C-T)‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬178Ž¡’ô¢ Étranspose-words‘T(M-T)‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬178Ž¦’ô¢ ëEUŽŸ’ô¢ Éundo‘T(C-‘‘$‰c4ÕÂŽ‘fæ)‘Åþ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘÷¹¬180Ž¡’ô¢ Éuniversal-argument‘T()‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬180Ž¡’ô¢ Éunix-line-discard‘T(C-U)‘;Ÿ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘mZ¬179Ž¡’ô¢ Éunix-word-rubout‘T(C-W)‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬179Ž¡’ô¢ Éupcase-word‘T(M-U)‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬179ŽŽŽŽŸŒ‹Ö +ŸòÝ214’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý°ðПøëEYŽŸÉyank‘T(C-Y)‘¦‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Na¬179ŽŽŸø’ô¢ Éyank-pop‘T(M-Y)‘ð’‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ "M¬179ŽŽŽŽŸŒ‹× YXŸòÝInfo‘¦fIndex’”215ŽŽŽ ƒ3Ú ý¨ðÐèInfo‘¦MIndexŽŽŸþÛVŸ,$ªëE,Ž¤É,–Tin“Info“windows‘šã‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ìž¬187Ž©…ëE?Ž¡É?,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬194ŽŸÉ?,–Tin“the“Info“echo“area ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘JÛ¬193Ž¦ëE[Ž¡É[,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬186Ž¦ëE]Ž¡É],–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬186Ž¦ëH>Ž¡É>,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬186Ž¦ëH<Ž¡É<,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬186Ž¦ëE0Ž¡É0,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬188Ž¦ëE1Ž¡É1‘T²:–Šª:“:Ž‘øÉ9,–Tin“Info“windows‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬188Ž¦ëEAŽ¡Éabort-key‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬194Ž¤Éadd-digit-to-numeric-argë‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘L¦¬194Ž¡Éautomatic-footnotes‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬195Ž¡Éautomatic-tiling‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬195Ž¦ëEBŽŸÉb,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬184Ž¡Ébackward-char‘m‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž¿¬183Ž¡Ébackward-word‘m‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž¿¬184Ž¡Ébeginning-of-line2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬183Ž¡Ébeginning-of-node2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬184Ž¦ëECŽŸÉC-a,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183ŽŽŸ,$ª’ô¢ ÉC-a,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¤’ô¢ ÉC-b,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183Ž¡’ô¢ ÉC-b,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡’ô¢ ÉC-d,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡’ô¢ ÉC-e,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183Ž¡’ô¢ ÉC-e,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡’ô¢ ÉC-f,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183Ž¡’ô¢ ÉC-f,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡’ô¢ ÉC-g,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬194Ž¡’ô¢ ÉC-g,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡’ô¢ ÉC-h,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬194Ž¡’ô¢ ÉC-k,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ ÉC-l,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡’ô¢ ÉC-n,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183Ž¡’ô¢ ÉC-p,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬183Ž¡’ô¢ ÉC-q,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ ÉC-r,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬187Ž¡’ô¢ ÉC-s,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬187Ž¡’ô¢ ÉC-t,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ ÉC-u,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬194Ž¡’ô¢ ÉC-v,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡’ô¢ ÉC-w,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬185Ž¡’ô¢ ÉC-x–T^,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬191Ž¡’ô¢ ÉC-x–T0,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬190Ž¡’ô¢ ÉC-x–T1,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬190Ž¡’ô¢ ÉC-x–T2,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬190Ž¡’ô¢ ÉC-x–Tb,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬187Ž¡’ô¢ ÉC-x–TC-b,“in“Info“windows‘U7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†ò¬186Ž¡’ô¢ ÉC-x–TC-f,“in“Info“windows‘U7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†ò¬186Ž¡’ô¢ ÉC-x–TDEL,“in“the“Info“echo“area‘"‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘S¬192Ž¡’ô¢ ÉC-x–Tk,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬186Ž¡’ô¢ ÉC-x–To,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬190Ž¡’ô¢ ÉC-x–Tt,“in“Info“windows‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬191Ž¡’ô¢ ÉC-y,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ Écancelling–Tthe“current“operation¶‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Nq¬194Ž¡’ô¢ Écancelling‘Ttypeahead ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘JÛ¬194Ž¡’ô¢ Écommands,‘Tdescribing ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘JÛ¬193Ž¡’ô¢ Écursor,‘Tmoving‘ð’‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ "M¬183ŽŽŽŽŸŒ‹Ø \YŸòÝ216’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú ý|Ì&Ÿ,$ªëEDŽ©Éd,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¤ÉDEL,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉDEL,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡Édelete-window‘m‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ž¿¬190Ž¡Édescribe-command‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬193Ž¡Édescribe-key‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬193Ž¡Édescribe-variable2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬195Ž¡Édir-node‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬185ŽŸ?0ëEEŽ¦Éecho‘Tarea‘k9‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘œô¬191Ž¡Éecho-area-abort‘ÏÞ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™¬191Ž¡Éecho-area-backward‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬191Ž¡Éecho-area-backward-kill-line‘îבÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ’¬192Ž¡Éecho-area-backward-kill-word‘îבÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ’¬192Ž¡Éecho-area-backward-wordi~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘›9¬191Ž¡Éecho-area-beg-of-line‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8_¬191Ž¡Éecho-area-complete‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬192Ž¡Éecho-area-delete‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬191Ž¡Éecho-area-end-of-line‘¤‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘8_¬191Ž¡Éecho-area-forward2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬191Ž¡Éecho-area-forward-word‘¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘é̬191Ž¡Éecho-area-insert‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬192Ž¡Éecho-area-kill-line‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬192Ž¡Éecho-area-kill-word‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬192Ž¡Éecho-area-newline2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬192Ž¡Éecho-area-possible-completionsQ±‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ƒl¬193Ž¡Éecho-area-quoted-inserti~‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘›9¬192Ž¡Éecho-area-rubout‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬191Ž¡Éecho-area-scroll-completions-window‘× ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ŭ193Ž¡Éecho-area-tab-insert‘U7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†ò¬192Ž¡Éecho-area-transpose-chars‘Ú‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ K¬192Ž¡Éecho-area-yank‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬192Ž¡Éecho-area-yank-pop‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬192Ž¡Éend-of-line‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬183Ž¡Éend-of-node‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬184Ž¡Éerrors-ring-bell‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬196Ž¡ÉESC–TC-f,“in“Info“windows‘U7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†ò¬195Ž¡ÉESC–TC-v,“in“Info“windows‘U7‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘†ò¬190Ž¡ÉESC–TC-v,“in“the“Info“echo“area‘"‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘S¬193ŽŽŸ,$ª’ô¢ ëEFŽ©’ô¢ Éf,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬189Ž¤’ô¢ Éfind-menu‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬188Ž¡’ô¢ Éfirst-nodeJ…‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|@¬186Ž¡’ô¢ Éfootnotes,‘Tdisplaying‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬195Ž¡’ô¢ Éforward-char‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬183Ž¡’ô¢ Éforward-word‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬184Ž¡’ô¢ Éfunctions,‘Tdescribing‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬193ŽŸœ£’ô¢ ëEGŽ¦’ô¢ Ég,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬186Ž¡’ô¢ Égc-compressed-files‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬196Ž¡’ô¢ Éget-help-window‘ÏÞ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™¬194Ž¡’ô¢ Éget-info-help-node‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬194Ž¡’ô¢ Églobal-next-node‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬186Ž¡’ô¢ Églobal-prev-node‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬186Ž¡’ô¢ Égoto-node‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬186Ž¡’ô¢ Égrow-window‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬191ŽŸœ£’ô¢ ëEHŽ¦’ô¢ Éh,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬194Ž¡’ô¢ Éhistory-node‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬185ŽŸœ£’ô¢ ëEIŽ¦’ô¢ Éi,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬187Ž¡’ô¢ Éindex-search‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬187Ž¡’ô¢ ÉINFO‘‘$‰c4ÕÂŽ–fæPRINT‘‘$‰c4ÕÂŽ“COMMAND,–Tenvironment“variable6å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘h ¬193Ž¡’ô¢ Éisearch-backward‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬187Ž¡’ô¢ Éisearch-forward‘ÏÞ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™¬187Ž¡’ô¢ ÉISO–TLatin“characters‘ëA‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ü¬197Ž¡’ô¢ ÉISO-Latin‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬197ŽŸœ£’ô¢ ëEKŽ¦’ô¢ Ékeep-one-window‘ÏÞ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™¬190Ž¡’ô¢ Ékeys,‘Tdescribing‘Sl‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘…'¬193Ž¡’ô¢ Ékill-node‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬186ŽŸœ£’ô¢ ëELŽ¦’ô¢ Él,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¡’ô¢ Élast-menu-item‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬188Ž¡’ô¢ Élast-node‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬186Ž¡’ô¢ Élist-visited-nodes‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬186ŽŽŽŽŸŒ‹Ù —´ŸòÝInfo‘¦fIndex’”217ŽŽŽ ƒ3Ú ý|Ì&Ÿ,$ªëEMŽ©Ém,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬188Ž¤ÉM->,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-<,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-1‘T²:–Šª:“:Ž‘øÉM-9,–Tin“Info“windows‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬194Ž¡ÉM-b,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-b,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡ÉM-d,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡ÉM-DEL,–Tin“the“Info“echo“area‘í ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ǭ192Ž¡ÉM-f,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-f,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬191Ž¡ÉM-r,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-TAB,–Tin“Info“windows‘ <‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Q÷¬189Ž¡ÉM-TAB,–Tin“the“Info“echo“area‘í ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ǭ192Ž¡ÉM-v,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡ÉM-y,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡Émenu-digitJ…‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|@¬188Ž¡Émenu-item‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬188Ž¡Émove-to-next-xref2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬189Ž¡Émove-to-prev-xref2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬189Ž¡Émove-to-window-line‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬184ŽŸëENŽ¦Én,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¡Énext-index-match‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬187Ž¡Énext-line‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬183Ž¡Énext-node‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬185Ž¡Énext-window‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬190Ž¡Énodes,–Tselection“of“in“Info“windows‘Õ?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ú¬185Ž¡Énumeric‘Targuments‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬194ŽŸëEPŽ¦Ép,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¡Éprev-line‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬183Ž¡Éprev-node‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬185Ž¡Éprev-window‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬190Ž¡Éprint-nodeJ…‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘|@¬193Ž¡Éprinting‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬193Ž¡Éprinting–Tcharacters,“in“the“Info“echo“area‘“‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÁN¬192ŽŸëEQŽ¦Éq,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬194Ž¡Équit¿‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ez¬194ŽŽŸ,$ª’ô¢ Équitting‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬194Ž©ÃÌ’ô¢ ëERŽŸ’ô¢ Ér,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬189Ž¤’ô¢ Éredraw-display‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬184Ž¡’ô¢ ÉRET,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬189Ž¡’ô¢ ÉRET,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¦’ô¢ ëESŽŸ’ô¢ És,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬187Ž¡’ô¢ Éscreen,–Tchanging“the“height“of‘‹ý‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘½¸¬194Ž¡’ô¢ Éscroll-backward‘ÏÞ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘™¬184Ž¡’ô¢ Éscroll-behaviour‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬196Ž¡’ô¢ Éscroll-forward‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬184Ž¡’ô¢ Éscroll-other-window‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬190Ž¡’ô¢ Éscroll-step‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬196Ž¡’ô¢ Éscrolling–Tthrough“node“structure¶‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Nq¬184Ž¡’ô¢ Éscrolling,–Tin“Info“windows‘ô(‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ %ã¬184Ž¡’ô¢ Ésearch‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬187Ž¡’ô¢ Ésearching‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬187Ž¡’ô¢ Éselect-reference-this-line‘‹ý‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘½¸¬189Ž¡’ô¢ Éselect-visited-node‘£Ê‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ…¬187Ž¡’ô¢ Éset-screen-height2¸‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ds¬194Ž¡’ô¢ Éset-variable‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬195Ž¡’ô¢ Éshow-footnotes‘q‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘P,¬195Ž¡’ô¢ Éshow-index-match‘K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘³¬196Ž¡’ô¢ ÉSPC,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬184Ž¡’ô¢ ÉSPC,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ Ésplit-window‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬190Ž¦’ô¢ ëETŽŸ’ô¢ Ét,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¡’ô¢ ÉTAB,–Tin“Info“windows‘½b‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ï¬189Ž¡’ô¢ ÉTAB,–Tin“the“Info“echo“area‘Š2‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘»í¬192Ž¡’ô¢ Étile-windows‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬191Ž¡’ô¢ Étiling‘„Ñ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶Œ¬191Ž¡’ô¢ Étoggle-wrap‘ *‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ ;å¬185Ž¡’ô¢ Étop-node‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬185Ž¦’ô¢ ëEUŽŸ’ô¢ Éu,–Tin“Info“windowsLP‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘~ ¬185Ž¡’ô¢ Éuniversal-argument‘ò]‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ $¬194Ž¡’ô¢ Éup-node‘6>‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘gù¬185ŽŽŽŽŸŒ‹Ú äAŸòÝ218’¤,ÿOcta•²!v“eŽŽŽ ƒ3Ú þ ðПœëEVŽ©Évariables,‘Tdescribing‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬195Ž¤Évariables,‘Tsetting‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬195Ž¡Éview-file‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬186Ž¡Évisible-bell‘»—‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘íR¬196ŽŸëEWŽ¦Éwhere-is‘ç«‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘f¬194ŽŽŸœ’ô¢ Éwindows,‘Tcreating‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬190Ž¤’ô¢ Éwindows,‘Tdeleting‘Ù‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6”¬190Ž¡’ô¢ Éwindows,‘Tmanipulating‘ØÅ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ €¬189Ž¡’ô¢ Éwindows,‘Tselecting‘¶F‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘è¬190ŽŸ*’ô¢ ëEXŽŸ’ô¢ Éxref-item‘™‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ÊÓ¬189ŽŽŽŽŸŒ‹ÿÿÿÿ 4Ÿò’Ò¶œÝiŽŽŽ ƒ3Ú ý¨ðÐèT‘þaGable–¦Mof“Con–ÿuÂten“tsŽŽŸ(O0ëEPreface‘S‘32óF›»ˆ@ff cmti12ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ :ëE1ŽŸ!ÀGNU–ffGENERAL“PUBLIC“LICENSE‘ ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ (¼ëE3Ž©À‘$ÝPream²!ble‘Ö‘é˜ó5ý': ó3 cmti10à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ «KÝ3Ž¤‘$TERMS–¦fAND“CONDITIONS“F²!OR“COPYING,“DISTRIBUTION“ANDŽ¡‘9æjMODIFICA‘ÿeTION‘‹8‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ `hÝ4Ž¡‘$AppMÞendix:‘ÝÝHo²!w–¦fto“Apply“These“T›ÿeerms“to“Y˜our“New“Programs‘7à‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ý8ŽŸëE1‘32A–ffBrief“InšŒÌtros3duction“to“Octa˜v˜e‘{^‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ š ëE11Ž¦‘$Ý1.1‘ ó5Running‘¦fOcta•²!v“ePÒ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ &Ý11Ž¡‘$1.2‘ ó5Simple‘¦fExamples‘¿a‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ”‘Ý11Ž¡‘HCreating–¦fa“Matrix{‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ PòÝ11Ž¡‘HMatrix‘¦fArithmetic‘P€‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ %±Ý12Ž¡‘HSolving–¦fLinear“Equations‘º)‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ YÝ12Ž¡‘HIn•²!tegrating›¦fDi eren“tial˜Equations‘ƒ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ å³Ý12Ž¡‘HProMÞducing–¦fGraphical“Output‘”ô‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ j%Ý13Ž¡‘HEditing–¦fWhat“Y‘ÿeou“Ha•²!v“e‘¦fT“ypMÞed‘~T‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ S„Ý14Ž¡‘HGetting‘¦fHelp‘m‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ BóÝ14Ž¡‘lHelp–¦fvia“Info‘tv‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ I¦Ý14Ž¡‘$1.3‘ ó5Executable›¦fOcta•²!v“e˜Programs‘µ$‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ŠTÝ15Ž¡‘$1.4‘ ó5Commenš²!ts–¦fin“Octa˜v˜e“Programsv ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ K=Ý15Ž¡‘$1.5‘ ó5Errors‘Ë+‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘  [Ý16ŽŸëE2‘32In•ŒÌv“oking‘ffOcta“v“e‘»þ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ Ú­ëE19Ž¦‘$Ý2.1‘ ó5Command–¦fLine“Options‘O‰‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ $ºÝ19Ž¡‘$2.2‘ ó5Startup‘¦fFiles‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘îÁÝ20ŽŸëE3‘32Expressions‘E’‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘d@ëE21Ž¦‘$Ý3.1‘ ó5Constan²!t‘¦fExpressions‘ƒa‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ X’Ý21Ž¡‘H3.1.1‘ ó5Numeric‘¦fConstan²!ts‘É‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÖúÝ21Ž¡‘H3.1.2‘ ó5String‘¦fConstan²!ts‘s~‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ H®Ý22Ž¡‘$3.2‘ ó5Matricest¶‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ IçÝ23Ž¡‘H3.2.1‘ ó5Empt²!y‘¦fMatrices‘£™‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ xÉÝ24Ž¡‘$3.3‘ ó5Ranges‘M2‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ "bÝ25Ž¡‘$3.4‘ ó5V‘ÿeariables‘­»‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‚ëÝ25Ž¡‘$3.5‘ ó5Index‘¦fExpressions‘"B‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÷sÝ26Ž¡‘$3.6‘ ó5Data‘¦fStructures‘Üú‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ²+Ý27ŽŽŸŒ‹ÿÿÿþ @uŸòÝii’®„wOcta•²!v“eŽŽŽ ƒ3Ú ý†Ì&‘$3.7‘ ó5Calling‘¦fF‘ÿeunctions‘FC‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ sÝ29Ž¤‘H3.7.1‘ ó5Call–¦fb²!y“V‘ÿealue‘‚S‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ WƒÝ30Ž¡‘H3.7.2‘ ó5Recursion‘%…‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ úµÝ31Ž¡‘$3.8‘ ó5Global‘¦fV‘ÿeariables‘#Ÿ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ øÐÝ31Ž¡‘$3.9‘ ó5Keyw²!ords(d‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ý•Ý32Ž¡‘$3.10‘ ó5Arithmetic‘¦fOpMÞerators3)‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ZÝ33Ž¡‘$3.11‘ ó5Comparison‘¦fOpMÞerators,ì‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ý34Ž¡‘$3.12‘ ó5BoMÞolean‘¦fExpressionsPÄ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ %ôÝ35Ž¡‘H3.12.1‘ ó5Elemen•²!t-b“y-elemen“t–¦fBošMÞolean“Op˜erators(ï‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘þÝ35Ž¡‘H3.12.2‘ ó5Short-circuit–¦fBošMÞolean“Op˜erators‘þ‡‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ó·Ý36Ž¡‘$3.13‘ ó5Assignmen²!t‘¦fExpressions‘. ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ =Ý37Ž¡‘$3.14‘ ó5Incremen²!t‘¦fOpMÞerators‘-M‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ }Ý39Ž¡‘$3.15‘ ó5OpMÞerator‘¦fPrecedence‘ÓÁ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¨ñÝ39Ž©ëE4‘32StatemenŒÌts‘云32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘hëE41ŽŸÀ‘$Ý4.1‘ ó5The–¦fÞif“ÝStatemen²!t‘ ë‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ àÝ41Ž¡‘$4.2‘ ó5The–¦fÞwhile“ÝStatemen²!t1ª‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÛÝ43Ž¡‘$4.3‘ ó5The–¦fÞfor“ÝStatemen²!t‘€‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ —±Ý44Ž¡‘$4.4‘ ó5The–¦fÞbreak“ÝStatemen²!t1ª‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÛÝ44Ž¡‘$4.5‘ ó5The–¦fÞcontinue“ÝStatemen²!t‘ïÓ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÅÝ45Ž¡‘$4.6‘ ó5The–¦fÞunwind‘°—‰x³sŽ‘#™protect“ÝStatemen²!t‘ Z‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ àŠÝ46Ž¦ëE5‘32F‘þ¦functions–ffand“Script“Files‘)§‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘HVëE49ŽŸÀ‘$Ý5.1‘ ó5De ning‘¦fF‘ÿeunctions‘æy‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ »ªÝ49Ž¡‘$5.2‘ ó5Multiple–¦fReturn“V‘ÿealues‘¢‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ çÓÝ51Ž¡‘$5.3‘ ó5V‘ÿeariable-length–¦fArgumen²!t“Lists‘q»‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ FëÝ53Ž¡‘$5.4‘ ó5V‘ÿeariable-length–¦fReturn“Lists‘äÒ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ºÝ54Ž¡‘$5.5‘ ó5Returning–¦fF›ÿerom“a“F˜unction‘¸s‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ £Ý54Ž¡‘$5.6‘ ó5F‘ÿeunction‘¦fFiles‘|‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Q6Ý55Ž¡‘$5.7‘ ó5Script‘¦fFiles‘vk‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ KœÝ56Ž¡‘$5.8‘ ó5Dynamically–¦fLink²!ed“F‘ÿeunctions‘XÑ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ .Ý57Ž¡‘$5.9‘ ó5Organization–¦fof“F‘ÿeunctions“Distributed“with“Octa•²!v“e‘S*‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ (ZÝ58Ž¦ëE6‘32Built-in‘ffV‘þ¦fariables‘V¨‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘uVëE61ŽŸÀ‘$Ý6.1‘ ó5Prede ned‘¦fConstan²!ts‘Á‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÜòÝ61Ž¡‘$6.2‘ ó5User‘¦fPreferences‘ Q‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ß‚Ý62Ž¡‘$6.3‘ ó5Other–¦fBuilt-in“V‘ÿeariables‘Òô‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¨$Ý69Ž¡‘$6.4‘ ó5Summary–¦fof“Preference“V‘ÿeariables‘íñ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ã"Ý70ŽŽŸŒ‹ÿÿÿý o‰Ÿò’Ì¡FÝiiiŽŽŽ ƒ3Ú ý†Ì&ëE7‘32Arithmetic‘Ÿ-‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘½ÜëE71Ž©À‘$Ý7.1‘ ó5Utilit²!y‘¦fF‘ÿeunctions‘ ?‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ âoÝ71Ž¤‘$7.2‘ ó5Complex‘¦fArithmetic‘‚‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ b³Ý72Ž¡‘$7.3‘ ó5T‘ÿerigonometry‘ið‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ?!Ý72Ž¡‘$7.4‘ ó5Sums–¦fand“ProMÞducts‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ð@Ý73Ž¡‘$7.5‘ ó5SpMÞecial‘¦fF‘ÿeunctions‘m2‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ BbÝ74ŽŸëE8‘32Linear‘ffAlgebra‘·J‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ÕøëE75Ž¦‘$Ý8.1‘ ó5Basic–¦fMatrix“F‘ÿeunctions‘E>‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ oÝ75Ž¡‘$8.2‘ ó5Matrix‘¦fF‘ÿeactorizationsHú‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ *Ý77Ž¡‘$8.3‘ ó5F‘ÿeunctions–¦fof“a“Matrix‘o|‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ D­Ý80ŽŸëE9‘32PŒÌolynomial‘ffManipulations‘ é‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘?˜ëE83Ž¤!À10‘32Nonlinear‘ffEquations‘š‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ¹.ëE87Ž¡11‘32Di erenŒÌtial‘ffEquations î‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ )œëE89Ž¦‘$Ý11.1‘ ó5Ordinary–¦fDi eren²!tial“Equations‘Ç÷‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 'Ý89Ž¤‘$11.2‘ ó5Di eren²!tial-Algebraic‘¦fEquations‘âC‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ·tÝ90ŽŸëE12‘32Optimization‘ó«‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ZëE91Ž¦‘$Ý12.1‘ ó5Quadratic‘¦fProgramming‘<¨‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ØÝ91Ž¡‘$12.2‘ ó5Nonlinear‘¦fProgramming‘ÿS‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ô„Ý91Ž¡‘$12.3‘ ó5Linear–¦fLeast“Squares‘´œ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‰ÌÝ91ŽŸëE13‘32Quadrature‘$M‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘BüëE93Ž¦‘$Ý13.1‘ ó5F›ÿeunctions–¦fof“one“V˜ariable‘>6‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ gÝ93Ž¡‘$13.2‘ ó5Orthogonal‘¦fColloMÞcation‘‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ݯÝ93ŽŸëE14‘32ConŒÌtrol‘ffTheory‘h&‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘†ÔëE95Ž¤!À15‘32Signal‘ffPros3cessing‘¾‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ÜÍëE101Ž¡16‘32Sets‘ó¦‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘UëE103Ž¡17‘32Statistics‘êE‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ôëE105ŽŽŸŒ‹ÿÿÿü ¡“ŸòÝiv’«Ç©Octa•²!v“eŽŽŽ ƒ3Ú ý†Ì&ëE18‘32Plotting‘ÿÒ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ €ëE107Ž©À‘$Ý18.1‘ ó5Tw²!o-Dimensional‘¦fPlotting‘¦‡‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ {¸Ý107Ž¤‘$18.2‘ ó5Three-Dimensional‘¦fPlotting‘º”‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÅÝ111Ž¡‘$18.3‘ ó5Miscellaneous–¦fPlotting“F‘ÿeunctions‘+o‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ŸÝ112ŽŸëE19‘32Image‘ffPros3cessing‘Ƕ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ æeëE115ŽŸ!À20‘32Input–ffand“Output‘T‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ëE117Ž¦‘$Ý20.1‘ ó5Basic–¦fInput“and“Output‘¶å‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ŒÝ117Ž¡‘$20.2‘ ó5C-St²!yle–¦fI/O“F‘ÿeunctions‘ñ$‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÆUÝ121Ž¡‘H20.2.1‘ ó5OpMÞening–¦fand“Closing“Files‘tî‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ JÝ121Ž¡‘H20.2.2‘ ó5F‘ÿeormatted‘¦fOutput‘¡‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ v9Ý122Ž¡‘H20.2.3‘ ó5Output›¦fCon•²!v“ersion˜Syn“tax‘¢°‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ wàÝ123Ž¡‘H20.2.4‘ ó5T‘ÿeable–¦fof“Output“Con•²!v“ersions‘Äï‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ š Ý124Ž¡‘H20.2.5‘ ó5In•²!teger‘¦fCon“v“ersions‘¢—‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ wÈÝ125Ž¡‘H20.2.6‘ ó5Floating-P•²!oin“t‘¦fCon“v“ersions‘Ø>‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ­oÝ125Ž¡‘H20.2.7‘ ó5Other–¦fOutput“Con•²!v“ersions‘ Ï‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ àÿÝ126Ž¡‘H20.2.8‘ ó5F‘ÿeormatted‘¦fInput‘r±‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ GáÝ127Ž¡‘H20.2.9‘ ó5Input›¦fCon•²!v“ersion˜Syn“tax‘Üî‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ²Ý127Ž¡‘H20.2.10‘ ó5T‘ÿeable–¦fof“Input“Con•²!v“ersions‘ÙË‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ®ûÝ128Ž¡‘H20.2.11‘ ó5Numeric–¦fInput“Con•²!v“ersions:‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘èkÝ129Ž¡‘H20.2.12‘ ó5String–¦fInput“Con•²!v“ersions‘„ï‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ZÝ129Ž¡‘H20.2.13‘ ó5Binary‘¦fI/O‘l€‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ A±Ý130Ž¡‘H20.2.14‘ ó5Other–¦fI/O“F‘ÿeunctionsP‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ %6Ý131ŽŸëE21‘32Sps3ecial‘ffMatrices‘±¿‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ÐmëE133Ž¦‘$Ý21.1‘ ó5SpMÞecial–¦fUtilit²!y“Matrices?—‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÈÝ133Ž¡‘$21.2‘ ó5F‘ÿeamous‘¦fMatrices‘¶Ë‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‹üÝ135ŽŸëE22‘32Matrix‘ffManipulation‘)‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘G±ëE137Ž¦‘$Ý22.1‘ ó5Finding–¦fElemenš²!ts“and“Chec˜king“Conditions‘[‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ú‹Ý137Ž¡‘$22.2‘ ó5Rearranging‘¦fMatrices!?‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘öoÝ138ŽŸëE23‘32String‘ffF‘þ¦functions‘|‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ¬*ëE143ŽŸ!À24‘32System‘ffUtilities!ˆ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ @6ëE145Ž¦‘$Ý24.1‘ ó5Timing‘¦fUtilities‘­u‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‚¦Ý145Ž¡‘$24.2‘ ó5In²!teracting–¦fwith“the“OS‘iþ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ?/Ý146Ž¡‘$24.3‘ ó5System‘¦fInformation‘ç7‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¼hÝ147Ž¡‘$24.4‘ ó5Other‘¦fF‘ÿeunctions‘jØ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ @ Ý147ŽŽŸŒ‹ÿÿÿû ÅòŸò’ÏùÎÝvŽŽŽ ƒ3Ú ý†Ì&ëE25‘32Command–ffHistory“F‘þ¦functions‘dR‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ƒëE149Ž¤!À26‘32Help‘Ì‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘1{ëE151Ž¡27‘32Programming‘ffUtilities‘º¶‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ÙeëE153Ž©À‘$Ý27.1‘ ó5Ev‘ÿdDaluating–¦fStrings“as“Commands‘ŸE‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ tvÝ153ŽŸ‘$27.2‘ ó5Miscellaneous‘¦fUtilities‘Αé˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ £JÝ154ŽŸëE28‘32Am•ŒÌusemen“ts‘¢a‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ÁëE159Ž¡Apps3endix–ffA‘32Installing“Octa•ŒÌv“e‘ÃB‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ áñëE161Ž¦‘$ÝA.1‘ ó5Installation‘¦fProblems‘̓‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¢´Ý163Ž¤‘$A.2‘ ó5Binary‘¦fDistributions‘?Í‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ýÝ165Ž¡‘HA.2.1‘ ó5Installing›¦fOcta•²!v“e˜from˜a˜Binary˜Distribution‘]þ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 3/Ý165Ž¡‘HA.2.2‘ ó5Creating–¦fa“Binary“Distribution‘µð‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‹!Ý166ŽŸëEApps3endix–ffB‘32KnošŒÌwn“Causes“of“T‘þ¦frouble“with“Octa˜v˜eŽ¡‘#sÚ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘,$ëE167Ž¦‘$ÝB.1‘ ó5Actual–¦fBugs“W›ÿee“Ha•²!v“en't–¦fFixed“Y˜et‘b‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 7KÝ167Ž¡‘$B.2‘ ó5RepMÞorting‘¦fBugsF¯‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ßÝ168Ž¡‘$B.3‘ ó5Ha•²!v“e–¦fY›ÿeou“F˜ound“a“Bug?á‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘æÝ168Ž¡‘$B.4‘ ó5Where–¦fto“RepMÞort“Bugs‘…‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ZFÝ169Ž¡‘$B.5‘ ó5Ho²!w–¦fto“RepMÞort“Bugs‘^ô‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 4%Ý169Ž¡‘$B.6‘ ó5Sending›¦fP•²!atc“hes˜for˜Octa“v“e‘’‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ gKÝ171Ž¡‘$B.7‘ ó5Hoš²!w–¦fT‘ÿeo“Get“Help“with“Octa˜v˜e‘ú‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ï7Ý172ŽŸëEApps3endix–ffC‘32Command“Line“Editing‘’Ø‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘±†ëE173Ž¦‘$ÝC.1‘ ó5In²!troMÞduction–¦fto“Line“Editingt€‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ I°Ý173Ž¡‘$C.2‘ ó5Readline‘¦fIn²!teraction‘z‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ תÝ173Ž¡‘$C.3‘ ó5Readline–¦fBare“Essen²!tials‘=‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ímÝ173Ž¡‘$C.4‘ ó5Readline›¦fMo•²!v“emen“t˜Commands‘¯¦‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ „×Ý174Ž¡‘$C.5‘ ó5Readline–¦fKilling“Commands‘”›‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ iËÝ174Ž¡‘$C.6‘ ó5Readline‘¦fArgumen²!ts‘ú°‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÏáÝ175Ž¡‘$C.7‘ ó5Readline–¦fInit“File‘ݺ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ²ëÝ175Ž¡‘$C.8‘ ó5Readline–¦fInit“Syn²!tax‘Ä‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ñôÝ175Ž¡‘HC.8.1‘ ó5Commands–¦fF‘ÿeor“Mo²!ving‘Æ_‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ›Ý177Ž¡‘HC.8.2‘ ó5Commands–¦fF‘ÿeor“Manipulating“The“History‘[Ý‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 1 Ý177Ž¡‘HC.8.3‘ ó5Commands–¦fF›ÿeor“Changing“T˜ext‘‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ôBÝ178Ž¡‘HC.8.4‘ ó5Killing–¦fAnd“Y‘ÿeanking‘@Ó‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ý179Ž¡‘HC.8.5‘ ó5SpMÞecifying–¦fNumeric“Argumen²!ts‘’ç‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ hÝ179Ž¡‘HC.8.6‘ ó5Letting–¦fReadline“T²!ypMÞe“F›ÿeor“Y˜ou‘†Î‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ [þÝ180ŽŽŸŒ‹ÿÿÿú ðÈŸòÝvi’«Ç©Octa•²!v“eŽŽŽ ƒ3Ú ý†Ì&‘HC.8.7‘ ó5Some–¦fMiscellaneous“Commands‘Ä"‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ™RÝ180Ž¤‘$C.9‘ ó5Readline–¦fVi“MoMÞde‘*5‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ÿfÝ180Ž©ëEApps3endix–ffD‘32Using“Info‘G¸‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ffëE183ŽŸÀ‘$ÝD.1‘ ó5Mo²!ving–¦fthe“Cursor €‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘õ°Ý183Ž¡‘$D.2‘ ó5Moš²!ving–¦fT‘ÿeext“Within“a“Windo˜w‘M‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ Ú~Ý184Ž¡‘$D.3‘ ó5Selecting–¦fa“New“NoMÞde‘©„‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ~µÝ185Ž¡‘$D.4‘ ó5Searc²!hing–¦fan“Info“Filek9‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ @jÝ187Ž¡‘$D.5‘ ó5Selecting–¦fCross“References/9‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ jÝ187Ž¡‘HD.5.1‘ ó5P²!arts–¦fof“an“Xref‘xð‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ N Ý187Ž¡‘HD.5.2‘ ó5Selecting‘¦fXrefsl"‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ARÝ188Ž¡‘$D.6‘ ó5Manipulating–¦fMultiple“Windo²!ws‘%ý‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ û.Ý189Ž¡‘HD.6.1‘ ó5The–¦fMoMÞde“Line‘ÄK‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ™{Ý189Ž¡‘HD.6.2‘ ó5Windo²!w‘¦fCommands‘ž±‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ sâÝ190Ž¡‘HD.6.3‘ ó5The–¦fEc²!ho“Area‘\#‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ 1TÝ191Ž¡‘$D.7‘ ó5Prin²!ting–¦fOut“NoMÞdes‘‡F‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ \vÝ193Ž¡‘$D.8‘ ó5Miscellaneous–¦fInfo“Commands‘:C‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ sÝ193Ž¡‘$D.9‘ ó5Manipulating‘¦fV‘ÿeariables‘t ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ IQÝ195Ž¦ëEConcept‘ffIndex‘ѽ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ðlëE199Ž¤!ÀV‘þ¦fariable‘ffIndex‘Ø$‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ öÒëE203Ž¡F‘þ¦function‘ffIndex‘Žø‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘­§ëE205Ž¡Ops3erator‘ffIndex‘DM‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ bûëE211Ž¡Readline‘ffIndex‘§€‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘Æ.ëE213Ž¡Info‘ffIndex‘®õ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ͤëE215ŽŽŸŒø cƒ’À;è›3ÚÕÁG âóUÂÖN ¼j cmbx12óMÂÖN  #× cmbx12óH߆µTff cmtt12óF›»ˆ@ff cmti12óEÂÖN ff cmbx12ó=ÂÖN G® cmbx12ó:!",š ó3 cmsy10ó9  b> ó3 cmmi10ó8Œ-ø ó3 cmcsc10ó6p®0J ó3 cmsl10ó5ý': ó3 cmti10ó4Ò ž& ó3 cmb10ó3ßê46 D E /Fb 1 47 df<387CFCFCF87006067A8512> 46 D E /Fc 1 59 df<60F0F06004047D830B>58 D E /Fd 31 123 df<000F8000304000E0E001C0E001C0C00380000380000380000380000380003FFFC007 03800703800703800703800703800703800E07000E07000E07000E07000E07000E07001C 0E001C0E00FF1FC0131A7F9915>12 D<7070F06004047D830B>46 D<003000700F7000E000E000E000E000E000E001C001C001C001C001C001C00380038003 8003800380038007000780FFF00C187D9713>49 D<0FE01FF000F0038000F0010000B001 0000B8010001380200011C0200011C0200010E0200010E02000107020002070400020704 0002038400020384000201C4000201C4000400E8000400E8000400E80004007800040078 00040038000C0030001C001000FF8010001C1A7E991D>78 D<001FC0000070700001C01C 0003800E0007000F000E0007001C0007803C000780380003807800038078000780700007 80F0000780F0000780F0000780F0000780F0000F00F0000F00F0001E0070001C0078003C 00380078001C00F0000E01C0000707800001FC0000191A7C991E>I<07FE0FF800F003C0 00700300007002000038040000380800001C1000001C3000000E2000000E400000078000 0007000000038000000780000005C0000009C0000010E0000020E0000040700000C07000 018038000100380002001C0006001C001E003E00FF80FFC01D1A7F991D>88 DI<0FC01870383010380038003803F81E7038707070E070E071E0F1E0E263763C38 10107D8F13>97 D<7E000E000E000E000E001C001C001C001C001C001DF03A0C3C063807 3807380338037007700770077006700E700CF018C87087C0101A7C9915>I<01FC06060C 0E1804300070007000E000E000E000E000600070043008183007C00F107E8F11>I<000F C00001C00001C00001C00001C000038000038000038000038000038001F380070F000C07 00180700300700700700700700E00E00E00E00E00E00E00E00600E00600E00301C00187E 000F9F80121A7E9915>I<01F006181C0C380C300E700E7FFEE000E000E000E000600060 043008183007C00F107E8F11>I<00F8E0038F600706000E07000E07000E07000E0E000E 0C0006180009F0001800001800001800001FF8000FFE000FFF00300700600380600180C0 0300600300600600381C000FE0001318808F13>103 D<0FC00001C00001C00001C00001 C000038000038000038000038000038000039E0007630007838007838007038007038007 03800E07000E07000E07000E07000E07000E07001C0E001C0E00FF9FC0121A7F9915>I< 018003C003C001800000000000000000000000001F800700070007000700070007000E00 0E000E000E000E000E001C001C00FF800A1A80990A>I<0FC00001C00001C00001C00001 C0000380000380000380000380000380000387E007038007020007040007080007200007 70000EF0000F78000E38000E3C000E1C000E1E001C0E001C0F00FF3FC0131A7F9914> 107 D<0FC001C001C001C001C00380038003800380038003800700070007000700070007 000E000E000E000E000E000E001C001C00FF800A1A80990A>I<1F9F07C0072188600741 D0700781E0700701C0700701C0700701C0700E0380E00E0380E00E0380E00E0380E00E03 80E00E0380E01C0701C01C0701C0FF9FE7F81D107F8F20>I<1F9E000763000783800783 800703800703800703800E07000E07000E07000E07000E07000E07001C0E001C0E00FF9F C012107F8F15>I<01F0060C1C061807300370037003E007E007E007E007600E600C3018 18700FC010107E8F13>I<0FDF0003A0C003C06003807003807003807003807007007007 00700700700700600700E00701C00F03800E87000E7C000E00000E00000E00001C00001C 00001C0000FF80001417808F15>I<01F180070B000C0B00180700380700700700700700 E00E00E00E00E00E00E00E00600E00701E00301C00187C000F9C00001C00001C00001C00 00380000380000380001FF0011177E8F14>I<1FB8074C079C07880700070007000E000E 000E000E000E000E001C001E00FFC00E107F8F0F>I<07EC0C181008300830083C003FC0 1FE007F00078403840184010E030D0608F800E107F8F0F>I<02000600040004000C001C 003C00FFC0380038003800380038003800700070007080708070807080710072001C000A 177C960F>IIII<3FC7E0078380078200 03840003C80001D00000F00000E00000F00000F000013800023800041C00081C00381E00 FC3FC013107F8F14>I<1FE1F80380E00380C003808003810001C10001C20001C20001C4 0000E40000E80000F80000F00000E000006000004000004000008000008000610000E200 00E400007800001517808F14>I<0FFF1C0E181C1038107010E000E001C0038007040E04 1C081C0838187030FFF010107F8F11>I E /Fe 76 127 df<60F0F0F0F0F0F0F0F0F0F0 F0F0F0600000000060F0F0600417789614>33 DI<071C00071C00071C00071C00071C007FFF00FFFF80FFFF 800E38000E38000E38000E38000E38000E38000E3800FFFF80FFFF807FFF001C70001C70 001C70001C70001C700011177F9614>I<3806007C0E006C0E00EE1C00EE1C00EE3800EE 38006C38007C700038700000700000E00000E00001C00001C00001C00003800003800007 0000070E00071F000E1B000E3B800E3B801C3B801C3B80381B00381F00180E00111D7F99 14>37 D<00C001C0030006000C001C0038003000700070006000E000E000E000E000E000 E000E000600070007000300038001C000C000600030001C000C00A1D7A9914>40 D<8000C0006000300018001C000E00060007000700030003800380038003800380038003 8003000700070006000E001C00180030006000C0008000091D7C9914>I<01C00001C000 01C00001C00001C00001C00001C000FFFF80FFFF80FFFF8001C00001C00001C00001C000 01C00001C00001C00011117F9314>43 D<70F8FCFC7C0C1830E0C0060A798414>II<70F8F8F8700505798414>I<0006000E000E001C001C00380038 0070007000E000E001C001C0038003800380070007000E000E001C001C00380038007000 7000E000E000C0000F1D7E9914>I<07C00FE01C7038383018701C701CE00EE00EE00EE0 0EE00EE00EE00EE00EE00E701C701C383838381C700FE007C00F177E9614>I<03000300 07000F003F00F70047000700070007000700070007000700070007000700070007000700 07007FF07FF00C177C9614>I<0FC01FF03838701CE00EE00EE00E400E000E001C001C00 380030007000E001C0030006000C00180E300E7FFE7FFE0F177E9614>I<07C01FE03830 7038601CE01CE00CE00EE00E601E701E383E1FEE07CE000E001C001C001C7038707070E0 3FC01F000F177E9614>57 D<000E003E007C00F003E007C01F003E00F800F000F8003E00 1F0007C003E000F0007C003E000E0F137E9414>60 DI<4000E000F8007C001E000F8007C001F0 00F8003E001E003E00F801F007C00F801E007C00F800E00040000F157E9514>I<1FE03F F8701CE00EE00E400E003C007000E001C003800380038003800300000000000000000003 000780078003000F177E9614>I<01C00003E00003E00003600003600007700007700007 70000770000630000E38000E38000E38000E38000E38001FFC001FFC001C1C001C1C003C 1E00380E00FE3F80FE3F8011177F9614>65 DI< 03C60FFE1C3E181E381E700E700E600EE000E000E000E000E000E000E000600E700E700E 380C181C1C380FF003C00F177E9614>IIII<03C60FFE1C3E181E381E700E700E600EE000E000E000E000E07FE07FE00E 600E700E700E381E181E1C3E0FFE03CE10177F9614>III<07FC07FC007000700070007000700070007000700070007000700070 0070007000700070E070E070F0E07FC01F000E177D9614>IIIII<1FF07FFC78 3C701CE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00E701C78 3C7FFC1FF00F177E9614>II<1FF07FFC783C70 1CE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE00EE38EE1CE71DC78FC7F FC1FF000780038003C001C001E0F1C7E9614>II<0FCC1FFC307C603CE01CE01C E01CE00070007E003FE00FF001F8001C001E000E600EE00EE00EF01CF838FFF0C7E00F17 7E9614>I<7FFF80FFFF80E1C380E1C380E1C380E1C38001C00001C00001C00001C00001 C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C0000FF8000F F80011177F9614>IIII<7E3E007E3E001C38001E38000E7800 0F700007F00007E00003E00003C00001C00003C00003E00003E0000770000770000E7800 0E38001C3C001C1C003C1E00FE3F80FE3F8011177F9614>II91 DII<04001F007FC0F1E0E0E00B057C9614>I<1FC0007FF0007078002018 00001C00001C0007FC001FFC003C1C00701C00E01C00E01C00E01C00707C003FFF800F8F 8011107E8F14>97 DI<03F80FFC1C1C380870006000E000E000E000E000600070 00380E1C1E0FFC03F00F107E8F14>I<007E00007E00000E00000E00000E00000E00000E 0007CE000FFE001C3E00301E00700E00E00E00E00E00E00E00E00E00E00E00E00E00700E 00301E00383E001FEFC007CFC012177F9614>I<07E00FF01C38301C700CE00EE00EFFFE FFFEE00060007000380E1C1E0FFC03F00F107E8F14>I<007C00FE01CE03840380038003 807FFEFFFE0380038003800380038003800380038003800380038003807FFC7FFC0F177F 9614>I<07CF001FFF80383B80301800701C00701C00701C003018003838003FF00037C0 007000007000003FF8001FFC003FFE00700F00E00380E00380E00380E003807007003C1E 001FFC0007F00011197F8F14>II<030007800780030000000000000000007F80 7F80038003800380038003800380038003800380038003800380FFFCFFFC0E187D9714> I<006000F000F0006000000000000000001FF01FF0007000700070007000700070007000 70007000700070007000700070007000700070007040E0E0C07F803F000C207E9714>I< FC0000FC00001C00001C00001C00001C00001C00001DFF801DFF801C3C001C78001CF000 1DE0001FC0001FC0001FE0001EF0001C70001C38001C38001C1C00FE3F80FE3F8011177F 9614>IIII<07C01FF03C78701C701CE00EE0 0EE00EE00EE00EE00E701C783C3C781FF007C00F107E8F14>II<03CE00 0FFE001C3E00301E00700E00E00E00E00E00E00E00E00E00E00E00E00E00700E00301E00 1C3E000FEE0007CE00000E00000E00000E00000E00000E00000E00007FC0007FC012187F 8F14>II<0FD83FF86038C038C038F0007F 803FF007F8001C6006E006F006F81CFFF8CFE00F107E8F14>I<03000700070007000700 7FFCFFFC07000700070007000700070007000700070E070E070E070C03FC00F00F157F94 14>IIII<7E3F007E3F001E38000E7800 07700007E00003E00001C00003C00003E0000770000E78000E38001C1C00FE3F80FE3F80 11107F8F14>II<3FFF7FFF700E701C7038007000E001C0038007000E00 1C0738077007FFFFFFFF10107F8F14>I124 D<1C103F38E7E041C00D047D9614>126 D E /Ff 67 124 df<00FC7C0183C607078E0607040E07000E07000E07000E07000E0700 0E0700FFFFF00E07000E07000E07000E07000E07000E07000E07000E07000E07000E0700 0E07000E07000E07000E07007F0FF0171A809916>11 D<00FC000182000703000607000E 02000E00000E00000E00000E00000E0000FFFF000E07000E07000E07000E07000E07000E 07000E07000E07000E07000E07000E07000E07000E07000E07007F0FE0131A809915>I< 00FF000387000707000607000E07000E07000E07000E07000E07000E0700FFFF000E0700 0E07000E07000E07000E07000E07000E07000E07000E07000E07000E07000E07000E0700 0E07007F9FE0131A809915>I<60F0F0F0F0F0F060606060606060606060200000000060 F0F060041A7D990B>33 D<01C0000003200000061000000E1000000E1000000E1000000E 1000000E2000000E4000000E40000007807F8007001E0007000800078010000B80100013 C0200031C0200060E04000E0F08000E0788000E0390000E01E0080E00E0080700F010038 73C3000F807C00191A7E991E>38 D<60F0F868080808101020C0050B7D990B>I<008001 00020004000C00080018003000300030006000600060006000E000E000E000E000E000E0 00E000E000E000E0006000600060006000300030003000180008000C0004000200010000 8009267D9B0F>I<8000400020001000180008000C000600060006000300030003000300 038003800380038003800380038003800380038003000300030003000600060006000C00 08001800100020004000800009267E9B0F>I<0300030003000300E31C73381FE0078007 801FE07338E31C03000300030003000E107E9B13>I<60F0F07010101020204080040B7D 830B>44 DI<60F0F06004047D830B>I<0004000C001800180018 00300030003000600060006000C000C000C0018001800180030003000300060006000600 0C000C000C00180018001800300030003000600060006000C000C0000E257E9B13>I<07 8018603030303060186018E01CE01CE01CE01CE01CE01CE01CE01CE01CE01CE01CE01C60 18601870383030186007800E187E9713>I<03000700FF00070007000700070007000700 07000700070007000700070007000700070007000700070007000700FFF00C187D9713> I<0F80106020304038803CC01CE01C401C003C003800380070006000C001800100020004 040804100430083FF87FF8FFF80E187E9713>I<0F8010E0207060787038203800780070 0070006000C00F8000E000700038003C003CE03CE03CC03C4038407030E00F800E187E97 13>I<00300030007000F000F001700370027004700C7008701070307020704070C070FF FF00700070007000700070007007FF10187F9713>I<30183FF03FE03FC0200020002000 2000200027C03860203000380018001C001C401CE01CE01C80184038403030E00F800E18 7E9713>I<01E006100C1818383038300070006000E000E7C0E860F030F018E018E01CE0 1CE01C601C601C701830183030186007C00E187E9713>I<40007FFE7FFC7FFC40088010 801080200040004000800180018001000300030003000300070007000700070007000700 02000F197E9813>I<078018603030201860186018601870103C303E600F8007C019F030 F86038401CC00CC00CC00CC00C6008201018600FC00E187E9713>I<0780186030307030 6018E018E018E01CE01CE01C601C603C303C185C0F9C001C001800180038703070606040 21801F000E187E9713>I<60F0F060000000000000000060F0F06004107D8F0B>I<60F0F0 60000000000000000060F0F0701010102020408004177D8F0B>I61 D<000C0000000C0000000C0000001E0000001E0000003F0000002700000027000000 43800000438000004380000081C0000081C0000081C0000100E0000100E00001FFE00002 0070000200700006007800040038000400380008001C0008001C001C001E00FF00FFC01A 1A7F991D>65 D68 DII72 D76 D78 D<007F000001C1C000070070000E0038001C001C 003C001E0038000E0078000F0070000700F0000780F0000780F0000780F0000780F00007 80F0000780F0000780F000078078000F0078000F0038000E003C001E001C001C000E0038 000700700001C1C000007F0000191A7E991E>II<007F00 0001C1C000070070000E0038001C001C003C001E0038000E0078000F0070000700F00007 80F0000780F0000780F0000780F0000780F0000780F0000780F00007807000070078000F 0038000E003C1C1E001C221C000E4138000741F00001E1C000007F80800000C0800000C0 800000E18000007F0000007F0000003E0000001C0019217E991E>I86 D91 D93 D<18204040808080B0F87830050B7E990B> 96 D<3F8070C070E020700070007007F01C7030707070E070E071E071E0F171FB1E3C10 107E8F13>II<07F80C1C381C30087000E000E000E000E0 00E000E0007000300438080C1807E00E107F8F11>I<007E00000E00000E00000E00000E 00000E00000E00000E00000E00000E0003CE000C3E00380E00300E00700E00E00E00E00E 00E00E00E00E00E00E00E00E00600E00700E00381E001C2E0007CFC0121A7F9915>I<07 C01C3030187018600CE00CFFFCE000E000E000E0006000300438080C1807E00E107F8F11 >I<01F0031807380E100E000E000E000E000E000E00FFC00E000E000E000E000E000E00 0E000E000E000E000E000E000E000E007FE00D1A80990C>I<0FCE187330307038703870 387038303018602FC02000600070003FF03FFC1FFE600FC003C003C003C0036006381C07 E010187F8F13>II<18003C003C00180000000000000000 0000000000FC001C001C001C001C001C001C001C001C001C001C001C001C001C001C00FF 80091A80990A>I<018003C003C001800000000000000000000000000FC001C001C001C0 01C001C001C001C001C001C001C001C001C001C001C001C001C001C001C041C0E180E300 7E000A2182990C>IIIII<07E01C38300C700E60 06E007E007E007E007E007E0076006700E381C1C3807E010107F8F13>II<03C2 000C2600381E00300E00700E00E00E00E00E00E00E00E00E00E00E00E00E00700E00700E 00381E001C2E0007CE00000E00000E00000E00000E00000E00000E00007FC012177F8F14 >II<1F2060E04020C020C020F0007F003FC01FE000F080708030C030C020F0408F 800C107F8F0F>I<0400040004000C000C001C003C00FFC01C001C001C001C001C001C00 1C001C001C201C201C201C201C200E4003800B177F960F>IIIIII<7FF86070407040E041C041C00380070007000E081C081C 08381070107030FFF00D107F8F11>II E /Fg 1 51 df<3E00418080C0C0C000C000C0018003000400084030407F80FF800A0D7E8C0E> 50 D E /Fh 18 91 df<00200040008001000300060006000C000C001800180038003000 30007000700070006000E000E000E000E000E000E000E000E000E000E000E000E000E000 6000700070007000300030003800180018000C000C000600060003000100008000400020 0B317A8113>0 D<800040002000100018000C000C000600060003000300038001800180 01C001C001C000C000E000E000E000E000E000E000E000E000E000E000E000E000E000C0 01C001C001C001800180038003000300060006000C000C00180010002000400080000B31 7F8113>III<0000700001F00003C0000780000E00001C00003800007000007000 00F00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E000 00E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E000 00E00000E00000E00000E00000E00000E00000E00001C00001C00001C000038000070000 0600000E0000380000700000C000007000003800000E000006000007000003800001C000 01C00001C00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E000 00E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E000 00E00000E00000E00000E00000E00000E00000E00000E00000F000007000007000003800 001C00000E000007800003C00001F000007014637B811F>26 D 50 DII<001C001C001C001C001C00 1C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C00 1C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C00 1C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C00 1C001C001C001C001C001C001C001C001C001C001C001CFFFCFFFCFFFC0E4A80811C>I< E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0E0031B73801C>II<00180078 00F001E003C007800F001F001E003E003C007C007C007800F800F800F800F800F800F800 F800F800F800F800F800F800F800F800F800F800F800F800F800F800F800F800F8000D25 707E25>I58 D<007C007C007C007C007C007C007C007C007C007C00 7C007C007C007C007C007C007C007C007C007C007C007C007C007C00F800F800F800F001 F001E003E003C0078007000E001C003800F000C000F00038001C000E000700078003C003 E001E001F000F000F800F800F8007C007C007C007C007C007C007C007C007C007C007C00 7C007C007C007C007C007C007C007C007C007C007C007C007C0E4D798025>60 D80 D<0000F800018400030600060E000604000E00000E00000E00000C00001C00001C00 001C00001C00001C00001C00001C00001C00001C00003800003800003800003800003800 003800003800003800003800003800007000007000007000007000007000007000007000 00700000700000600000E00000E00000E00040C000E0C000C180004300003E0000172E7E 7F14>82 D88 D<00000003800000000660000000 0C700000000CF00000000CF00000001C6000000018000000003800000000380000000038 000000007000000000700000000070000000007000000000F000000000E000000000E000 000000E000000001E000000001E000000001C000000001C000000003C000000003C00000 0003C000000003C000000007800000000780000000078000000007800000000F80000000 0F800000000F000000000F000000001F000000001F000000001F000000001F000000001E 000000003E000000003E000000003E000000003E000000003C000000007C000000007C00 0000007C000000007C000000007800000000F800000000F800000000F800000000F80000 0000F000000001F000000001F000000001F000000001F000000001E000000001E0000000 03E000000003E000000003C000000003C000000003C000000003C0000000078000000007 8000000007800000000780000000070000000007000000000F000000000F000000000E00 0000000E000000000E000000001E000000001C000000001C000000001C00000000180000 0000380000000038000000003000000000700000006060000000F060000000F0C0000000 E18000000063000000001E00000000245C7E7F17>90 D E /Fi 26 127 df<200100780780F807C0F807C0F807C07807807807807807807807807807807807 8078078078078078078078078070038070038030030012127AA51F>34 D<000C0000001E0000001E0000001E0000001E0000001E0000001E0000001E0000001E00 00001E0000001E00007FFFFF80FFFFFFC0FFFFFFC07FFFFF80001E0000001E0000001E00 00001E0000001E0000001E0000001E0000001E0000001E0000001E0000000C00001A1A7E 9E1F>43 D<00000600001F00003F0000FE0001FC0007F0001FE0003F8000FF0001FC0007 F0000FE0003F80007F0000FC0000FC00007F00003F80000FE00007F00001FC0000FF0000 3F80001FE00007F00001FC0000FE00003F00001F000006181E7DA01F>60 D<600000F80000FC00007F00003F80000FE00007F80001FC0000FF00003F80000FE00007 F00001FC0000FE00003F00003F0000FE0001FC0007F0000FE0003F8000FF0001FC0007F8 000FE0003F80007F0000FC0000F80000600000181E7DA01F>62 D<600000F00000F00000 F800007800007C00003C00003E00001E00001F00000F00000F800007800007C00003C000 03E00001E00001E00001F00000F00000F800007800007C00003C00003E00001E00001F00 000F00000F800007800007800007C00003C00003E00001E00001F00000F00000F8000078 00007C00003C00003E00001E00001F00000F00000F000006182F7DA91F>92 D<00C00003F00007F8001FFE007F3F80FC0FC0F807C060018012087AA41F>94 D<7FFFFEFFFFFFFFFFFF7FFFFE18047D7D1F>I<07FC00001FFF00003FFFC0003E03E000 3E01F0001C00F00000007800000078000000780000007800003FF80001FFF80007FFF800 1FE078003E0078007C00780078007800F0007800F0007800F0007800F00078007800F800 7E03F8003FFFFFE00FFF3FE003FC0FE01B1A7D991F>97 D<7F800000FF8000007F800000 07800000078000000780000007800000078000000780000007800000078000000787C000 079FF80007FFFC0007F83E0007E00F0007C0078007C00780078003C0078003C0078001E0 078001E0078001E0078001E0078001E0078001E0078001E0078001E0078003C007C003C0 07C0078007E00F8007E01F0007F83E0007FFFC00079FF000038FC0001B257FA41F>I<00 7FC001FFF007FFF80F80F81F00F83E00703C0000780000780000F00000F00000F00000F0 0000F00000F00000F00000F000007800007800003C00783E00781F00F80F81F007FFE001 FFC0007F00151A7B991F>I<0003FC000007FC000003FC0000003C0000003C0000003C00 00003C0000003C0000003C0000003C0000003C00007E3C0001FFBC0007FFFC000F81FC00 1F00FC003E007C003C007C0078003C0078003C00F0003C00F0003C00F0003C00F0003C00 F0003C00F0003C00F0003C00F0003C0078003C0078007C003C007C003C00FC001E01FC00 0F83FC0007FFBFC003FF3FE0007C3FC01B257EA41F>I<007F0001FFC007FFE00FC1F01F 00783E00783C003C78003C78001E70001EF0001EFFFFFEFFFFFEFFFFFEF00000F0000078 00007800007800003C001E1E001E1F003E0FC07C03FFF801FFF0003F80171A7D991F>I< 0003F0000FFC001FFE003E3E003C3E00781C0078000078000078000078000078007FFFFC FFFFFCFFFFFC007800007800007800007800007800007800007800007800007800007800 0078000078000078000078000078000078000078000078000078000078007FFFF87FFFF8 7FFFF817257EA41F>I<7F800000FF8000007F8000000780000007800000078000000780 0000078000000780000007800000078000000787E000079FF00007BFF80007F83C0007F0 1C0007E01E0007C01E0007C01E0007801E0007801E0007801E0007801E0007801E000780 1E0007801E0007801E0007801E0007801E0007801E0007801E0007801E0007801E000780 1E007FF87FE0FFFCFFF07FF87FE01C257FA41F>104 D<00700000F80000F80000F80000 70000000000000000000000000000000000000000000007FF800FFF8007FF80000780000 780000780000780000780000780000780000780000780000780000780000780000780000 7800007800007800007800007800007800007800FFFFF8FFFFF8FFFFF815267BA51F>I< FF800000FF800000FF800000078000000780000007800000078000000780000007800000 07800000078000000787FFE0078FFFE00787FFE007807E000780FC000781F8000783F000 0787E000078FC000079F800007BF000007FF000007FF800007FFC00007F3C00007E3E000 07C1F0000780F0000780F80007807C0007803C0007801E0007801F00FFF87FF0FFFCFFF0 FFF87FF01C257FA41F>107 D<7FFC00FFFC007FFC00003C00003C00003C00003C00003C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C 00003C00003C007FFFFEFFFFFF7FFFFE18257DA41F>I<7F87E000FF9FF0007FBFF80007 F83C0007F01C0007E01E0007C01E0007C01E0007801E0007801E0007801E0007801E0007 801E0007801E0007801E0007801E0007801E0007801E0007801E0007801E0007801E0007 801E0007801E007FF87FE0FFFCFFF07FF87FE01C1A7F991F>110 D<00FC0003FF0007FF801F87E01E01E03C00F07C00F8780078780078F0003CF0003CF000 3CF0003CF0003CF0003CF0003CF8007C7800787800787C00F83C00F01E01E01F87E007FF 8003FF0000FC00161A7C991F>I<7F87C000FF9FF8007FFFFC0007F83E0007E00F0007C0 078007C00780078003C0078003C0078001E0078001E0078001E0078001E0078001E00780 01E0078001E0078001E0078003C007C003C007C0078007E00F8007E01F0007F83E0007FF FC00079FF000078FC0000780000007800000078000000780000007800000078000000780 00000780000007800000078000007FF80000FFFC00007FF800001B277F991F>I<7FE07E 00FFE1FF807FE7FFC001EF87C001FE07C001FC038001F8000001F8000001F0000001F000 0001E0000001E0000001E0000001E0000001E0000001E0000001E0000001E0000001E000 0001E0000001E0000001E0000001E000007FFFE000FFFFF0007FFFE0001A1A7E991F> 114 D<0070000000F0000000F0000000F0000000F0000000F0000000F000007FFFFE00FF FFFE00FFFFFE0000F0000000F0000000F0000000F0000000F0000000F0000000F0000000 F0000000F0000000F0000000F0000000F0000000F0000000F0078000F0078000F0078000 F0078000F0078000F00F00007C1F00003FFE00001FFC000007F00019217FA01F>116 D<7F81FE00FF83FE007F81FE0007801E0007801E0007801E0007801E0007801E0007801E 0007801E0007801E0007801E0007801E0007801E0007801E0007801E0007801E0007801E 0007801E0007801E0007803E0007807E0003C0FE0003FFFFE001FFDFF0007F1FE01C1A7F 991F>I119 D<60F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0 F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F060042F73A91F>124 D<0380600FE0F01FE1F03CF3C0F87F80F07F00601C0014077BA41F>126 D E /Fj 57 122 df45 D<3C7EFFFFFFFF7E3C08 087C8711>I<00000600000F00000F00001F00001E00003E00003C00003C00007C000078 0000F80000F00000F00001F00001E00001E00003E00003C00007C0000780000780000F80 000F00001F00001E00001E00003E00003C00007C0000780000780000F80000F00001F000 01E00001E00003E00003C00007C0000780000780000F80000F00000F00001F00001E0000 3E00003C00003C00007C0000780000F80000F00000F0000060000018377DA81F>I<007F 800003FFF00007E1F8000F807C001F003E003F003F003E001F007E001F807E001F807E00 1F807E001F80FE001FC0FE001FC0FE001FC0FE001FC0FE001FC0FE001FC0FE001FC0FE00 1FC0FE001FC0FE001FC0FE001FC0FE001FC0FE001FC07E001F807E001F807E001F807E00 1F803F003F003F003F001F003E000F807C0007E1F80003FFF000007F80001A237EA21F> I<001C00003C0000FC00FFFC00FFFC0000FC0000FC0000FC0000FC0000FC0000FC0000FC 0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC 0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC0000FC007FFFFC7FFFFC1623 7CA21F>I<01FF0007FFC01E07F03803F86001FC7C00FEFE00FEFE00FFFE007FFE007F7C 007F3800FF0000FF0000FE0000FE0001FC0001F80003F00007E0000780000F00001E0000 3C0000700000E00301C0030380070700060600060FFFFE1FFFFE3FFFFE7FFFFCFFFFFCFF FFFC18237DA21F>I<01FF0007FFE01E03F03801F83C01FC7E00FE7E00FE7E00FE3E00FE 1C01FE0001FC0001FC0003F80007F0000FC001FF0001FF000007E00001F00001F80000FC 0000FE0000FF0000FF1000FF7C00FFFE00FFFE00FFFE00FEFE00FE7C01FC7001F83E07F0 0FFFC001FF0018237DA21F>I<0000380000007800000078000000F8000001F8000003F8 000007F8000006F800000CF800001CF8000038F8000030F8000060F80000E0F80001C0F8 000180F8000300F8000700F8000E00F8001C00F8001800F8003000F8007000F800E000F8 00FFFFFFC0FFFFFFC00001F8000001F8000001F8000001F8000001F8000001F8000001F8 00007FFFC0007FFFC01A237EA21F>I<18000C1F007C1FFFF81FFFF01FFFE01FFFC01FFF 801FFE0018000018000018000018000018000018FF001BFFE01F01F01C00F80800FC0000 7E00007E00007E00007F00007F78007FFC007FFC007FFC007FFC007EF8007E6000FC7000 FC3801F81E07E007FFC001FE0018237DA21F>I<001FC0007FF001F83803E00C07803E0F 807E1F007E3F007E3F007E7E003C7E00007E00007E0000FE3FC0FE7FF0FE80F8FF80FCFF 007CFF007EFE007EFE007FFE007FFE007FFE007F7E007F7E007F7E007F7E007F3E007E3F 007E1F007C0F80F807C1F003FFC0007F0018237DA21F>I<300000003C0000003FFFFFC0 3FFFFFC03FFFFF807FFFFF007FFFFE007FFFFC006000180060001800E0003000C0006000 C000C0000001800000018000000300000007000000060000000E0000001E0000001E0000 001E0000003C0000003C0000007C0000007C0000007C0000007C000000FC000000FC0000 00FC000000FC000000FC000000FC000000FC000000780000003000001A257DA41F>I<00 FF8003FFE00F01F81C007C38003C38001E78001E78001E7C001E7E001E7F803C7FE03C3F F8781FFCF01FFFC00FFFC003FFE003FFF80FFFFC1E1FFC3C07FE7801FE7800FFF0003FF0 001FF0000FF0000FF0000FF0000E78000E78001C3E00381F80F007FFE000FF0018237DA2 1F>I<00FF0003FFC00F83E01F00F03F00F87E007C7E007C7E007EFE007EFE007EFE007E FE007FFE007FFE007FFE007F7E007F7E00FF3E00FF3F01FF1F017F0FFE7F03FC7F00007F 00007E00007E3C007E7E00FC7E00FC7E00F87E00F07C01F03003E01C0F800FFF0003F800 18237DA21F>I<00001C00000000001C00000000003E00000000003E00000000003E0000 0000007F00000000007F0000000000FF8000000000FF8000000000FF80000000019FC000 0000019FC0000000031FE0000000030FE0000000030FE00000000607F00000000607F000 00000C07F80000000C03F80000001C03FC0000001801FC0000001801FC0000003001FE00 00003000FE0000007FFFFF0000007FFFFF00000060007F000000C0007F800000C0003F80 0001C0003FC0000180001FC0000180001FC0000300000FE0000300000FE0000780000FF0 00FFF801FFFF80FFF801FFFF8029257EA42E>65 DI<0000FF 8008000FFFF018003FC03C7800FE0006F801F80003F803F00001F807E00000F80FC00000 781FC00000783F800000383F800000387F800000187F000000187F00000018FF00000000 FF00000000FF00000000FF00000000FF00000000FF00000000FF00000000FF00000000FF 000000007F000000007F000000187F800000183F800000183F800000181FC00000300FC0 00003007E000006003F00000C001F800018000FE000700003FC01E00000FFFF8000000FF C00025257DA42C>IIII72 DI75 DI II<0003FF8000001FFFF000007F01FC0001FC007F0003F0 001F8007E0000FC00FE0000FE01FC00007F01F800003F03F800003F83F800003F87F8000 03FC7F000001FC7F000001FCFF000001FEFF000001FEFF000001FEFF000001FEFF000001 FEFF000001FEFF000001FEFF000001FEFF000001FE7F000001FC7F000001FC7F800003FC 3F800003F83F800003F81FC00007F01FC00007F00FE0000FE007F0001FC003F8003F8001 FC007F00007F01FC00001FFFF0000003FF800027257DA42E>II82 D<00FF008007FFE3800F80F7801E001F803C000F80 7800078078000380F8000380F8000180F8000180FC000180FC000000FF0000007FE00000 7FFF00003FFFE0003FFFF8001FFFFE0007FFFF0003FFFF80007FFF800003FFC000003FC0 00000FE0000007E0000007E0C00003E0C00003E0C00003E0C00003C0E00003C0F00007C0 F8000780FC000F00FFC03E00E3FFF800803FE0001B257DA422>I<7FFFFFFFF87FFFFFFF F87E00FE01F87800FE00787000FE00386000FE00186000FE0018E000FE001CE000FE000C C000FE000CC000FE000CC000FE000CC000FE000C0000FE00000000FE00000000FE000000 00FE00000000FE00000000FE00000000FE00000000FE00000000FE00000000FE00000000 FE00000000FE00000000FE00000000FE00000000FE00000000FE00000000FE00000000FE 00000000FE00000000FE00000000FE000000FFFFFE0000FFFFFE0026247EA32B>I86 DI<7FFFC0FFFE007FFFC0 FFFE0003FC000F800001FC0007000001FE000E000000FF000C0000007F80180000007F80 380000003FC0700000001FE0600000001FE0C00000000FF1C000000007FB8000000007FB 0000000003FE0000000001FE0000000000FE0000000000FF00000000007F80000000007F C0000000007FC000000000DFE000000001CFF0000000038FF00000000307F80000000603 FC0000000E01FC0000001C01FE0000001800FF00000030007F80000070007F800000E000 3FC00000C0001FE0000180001FE00003C0000FF000FFFC00FFFF80FFFC00FFFF8029257E A42E>II<07FF00001FFFC0003E03E0003F01F0003F01F8 003F00FC001E00FC000000FC000000FC000000FC00003FFC0003FCFC000FC0FC003F00FC 007E00FC007E00FC00FC00FC00FC00FC00FC00FC00FC017C007E017C003F067C001FFC3F E007F01FE01B187E971E>97 DI<007FE003FFF807C0 7C1F80FC1F00FC3F00FC7E00787E0000FE0000FE0000FE0000FE0000FE0000FE0000FE00 00FE00007E00007F00003F000C1F800C1FC01807E07003FFE0007F0016187E971B>I<00 01FF800001FF8000001F8000001F8000001F8000001F8000001F8000001F8000001F8000 001F8000001F8000001F8000001F8000001F80007F1F8003FFDF8007E0FF801F803F803F 001F803F001F807E001F807E001F80FE001F80FE001F80FE001F80FE001F80FE001F80FE 001F80FE001F80FE001F807E001F807E001F803F001F803F003F801F807F800FC0FF8003 FF9FF800FE1FF81D267EA522>I<007F0003FFC007C1F00F80F81F00F83F007C7E007C7E 007EFE007EFE007EFFFFFEFFFFFEFE0000FE0000FE00007E00007E00007E00063F00061F 000C0F801807E07003FFE0007F8017187E971C>I<000FC0007FF000F8F001F1F803F1F8 03E1F807E0F007E00007E00007E00007E00007E00007E00007E000FFFF00FFFF0007E000 07E00007E00007E00007E00007E00007E00007E00007E00007E00007E00007E00007E000 07E00007E00007E00007E00007E00007E00007E0007FFF007FFF0015267EA513>I<01FF 07C007FFDFE00F83F1E01F01F1E03E00F8007E00FC007E00FC007E00FC007E00FC007E00 FC007E00FC003E00F8001F01F0000F83E0000FFFC00011FF000030000000300000003800 00003C0000003FFFE0001FFFFC001FFFFE000FFFFF001FFFFF803C003F8078000FC0F800 07C0F80007C0F80007C0F80007C07C000F803E001F001F807E0007FFF80000FFC0001B24 7E971F>II<0F001F803FC03FC03FC03FC01F800F00 0000000000000000000000000000FFC0FFC00FC00FC00FC00FC00FC00FC00FC00FC00FC0 0FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC0FFF8FFF80D277EA611>I107 DIII<007F800003FFF00007 C0F8001F807E003F003F003F003F007E001F807E001F80FE001FC0FE001FC0FE001FC0FE 001FC0FE001FC0FE001FC0FE001FC0FE001FC07E001F807E001F803F003F003F003F001F 807E000FC0FC0003FFF000007F80001A187E971F>II114 D<07F9801FFF803C0F80700380F00180F00180F00180FC0000FF80007FFC007FFE003FFF 800FFFC003FFC0001FE00003E0C001E0C001E0E001E0E001C0F003C0FC0780EFFF00C3FC 0013187E9718>I<00600000600000600000600000E00000E00001E00001E00003E00007 E0001FE000FFFFC0FFFFC007E00007E00007E00007E00007E00007E00007E00007E00007 E00007E00007E00007E00007E06007E06007E06007E06007E06007E06003E0C003F0C001 FF80007E0013237FA218>IIIIII E /Fk 10 62 df<01020408103020606040C0C0C0C0C0C0C0C0C0C04060 6020301008040201081E7E950D>40 D<80402010080C0406060203030303030303030303 020606040C0810204080081E7E950D>I<00600000600000600000600000600000600000 6000006000006000006000FFFFF0FFFFF000600000600000600000600000600000600000 600000600000600000600014167E9119>43 D<0F0030C0606060604020C030C030C030C0 30C030C030C030C030C03040206060606030C00F000C137E9211>48 D<0C001C00EC000C000C000C000C000C000C000C000C000C000C000C000C000C000C000C 00FFC00A137D9211>I<1F0060C06060F070F030603000700070006000C001C001800200 04000810101020207FE0FFE00C137E9211>I<0FC030707038703870380038003000E00F C0007000380018001C601CF01CF018E03860701FC00E137F9211>I<07C00C2010702070 60006000C000CF00D0C0E060C020C030C030C03040306020206010C00F000C137E9211> 54 D<0FC0107020186018601870183C303F600F800FE031F06078C01CC00CC00CC00C60 1830300FC00E137F9211>56 D<7FFFE0FFFFF00000000000000000000000000000000000 00FFFFF07FFFE0140A7E8B19>61 D E /Fl 3 50 df0 D<040E0E1C1C1C38383070706060C0C0070F7F8F0A>48 D<0F001E003BC0618060608040 40310040801A0020800E0020800E0020800E0020800B0020401180404020C0C030C07B80 0F001E001B0D7E8C21>I E /Fm 39 122 df<387CFEFFFF7F3B030306060E0C18302008 107D9F0D>39 D<387CFEFFFF7F3B030306060E0C18302008107D860D>44 D<387CFEFEFE7C3807077D860D>46 D<03F0000FFC001F3E003E1F003C0F007C0F807C0F 807C0F80FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0FC0F C0FC0FC0FC0FC07C0F807C0F807C0F803C0F003E1F001F3E000FFC0003F000121D7E9C17 >48 D<00E001E00FE0FFE0F3E003E003E003E003E003E003E003E003E003E003E003E003 E003E003E003E003E003E003E003E003E003E003E07FFF7FFF101D7D9C17>I<387CFEFE FE7C38000000000000387CFEFEFE7C3807147D930D>58 D<000700000007000000070000 000F8000000F8000000F8000001FC000001FC000003FE0000037E0000037E0000077F000 0063F0000063F00000E1F80000C1F80000C1F8000180FC000180FC000180FC0003007E00 03FFFE0003FFFE0006003F0006003F0006003F000C001F800C001F801C001F80FF80FFF8 FF80FFF81D1F7E9E22>65 D<001FC04000FFF1C003F81FC007E00FC00FC007C01F8003C0 3F0001C03F0001C07F0001C07E0000C07E0000C0FE0000C0FE000000FE000000FE000000 FE000000FE000000FE000000FE000000FE0000007E0000C07E0000C07F0000C03F0000C0 3F0001801F8001800FC0030007E0060003F81C0000FFF800001FE0001A1F7D9E21>67 DI70 D78 D<003F800001FFF00003E0F8000FC07E001F803F001F001F003F001F803F001F 807E000FC07E000FC07E000FC0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000F E0FE000FE0FE000FE0FE000FE07E000FC07E000FC07F001FC03F001F803F001F801F803F 001F803F000FC07E0003E0F80001FFF000003F80001B1F7D9E22>II<7FFFFFC07FFFFFC07C1F83C0701F81C0601F80C060 1F80C0E01F80E0C01F8060C01F8060C01F8060C01F8060001F8000001F8000001F800000 1F8000001F8000001F8000001F8000001F8000001F8000001F8000001F8000001F800000 1F8000001F8000001F8000001F8000001F800007FFFE0007FFFE001B1E7E9D20>84 D<040C1830706060C0C0DCFEFFFF7F3E1C08107E9F0D>96 D<07F0001FFC003F1E003F1F 003F0F803F0F800C0F80000F8000FF800FFF801F0F807C0F807C0F80F80F80F80F80F80F 80F817807C37803FE7F00F81F014147F9316>II<03F00FFC1E7E3E7E7C7E7C7EFC18FC00FC00FC00FC 00FC00FC00FC007C007E033E031F0E0FFC03F010147E9314>I<003FC0003FC00007C000 07C00007C00007C00007C00007C00007C00007C00007C00007C003E7C00FFFC01F1FC03E 07C07C07C07C07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C07C07C07C 07C03C0FC01E1FC00FF7F807E7F815207E9F19>I<03F8000FFE001F1F003E0F807E0780 7C07C0FC07C0FC07C0FFFFC0FFFFC0FC0000FC0000FC0000FC00007C00007E00C03E01C0 1F038007FF0001FC0012147F9315>I<003F0001FF8003E7C007CFC0078FC00F8FC00F87 800F80000F80000F80000F80000F8000FFF000FFF0000F80000F80000F80000F80000F80 000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80007FF8 007FF80012207F9F0E>I<03F0E00FFDF01E1EF03C0FF07C0F807C0F807C0F807C0F807C 0F803C0F001E1E001FFC0033F0003000003000003800003FFE003FFF801FFFC03FFFE078 03F07000F0F000F0F000F0F000F0F000F07801E03E07C01FFF8003FC00141E7F9317>I< FF0000FF00001F00001F00001F00001F00001F00001F00001F00001F00001F00001F0000 1F1F001F3FC01F63C01F83E01F83E01F03E01F03E01F03E01F03E01F03E01F03E01F03E0 1F03E01F03E01F03E01F03E01F03E01F03E0FFE7FCFFE7FC16207E9F19>I<1C003F007F 007F007F003F001C00000000000000000000000000FF00FF001F001F001F001F001F001F 001F001F001F001F001F001F001F001F001F001F00FFE0FFE00B217FA00C>I<003800FE 00FE00FE00FE00FE003800000000000000000000000001FE01FE003E003E003E003E003E 003E003E003E003E003E003E003E003E003E003E003E003E003E003E003E783EFC3EFC7E FC7CFCF87FF01FC00F2A84A00E>I108 DII<01F8000FFF001F0F803E07C07C03E07C03E07C03E0FC03F0FC03 F0FC03F0FC03F0FC03F0FC03F0FC03F07C03E07C03E03E07C01F0F800FFF0003FC001414 7F9317>II<03E0C00FF1C01F1BC0 3E0FC07E07C07C07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07C07C07C0 7E07C03E0FC01F1FC00FF7C007E7C00007C00007C00007C00007C00007C00007C00007C0 003FF8003FF8151D7E9318>II<1FB03FF07070E030E030E030 F000FF007FC03FE01FF007F80078C038C038E038E038F070FFE0CF800D147E9312>I<03 00030003000300070007000F000F003F00FFF8FFF81F001F001F001F001F001F001F001F 001F001F001F181F181F181F181F180F3007F003E00D1D7F9C12>IIIIII E /Fn 20 123 df<3FFE7FFEC440844004400CC008C0 08C018C018C030C030E020400F0D7E8C13>25 D<07FC7FC000E00E0001C01C0001C01C00 01C01C0001C01C0003803800038038000380380003FFF800070070000700700007007000 070070000E00E0000E00E0000E00E0000E00E0001C01C000FF8FF8001A147F931B>72 D<07F000FE00F000F0017001E0017002E0017002E0017004E0027009C0023809C0023811 C0023821C0043823800438438004388380041C8380081D0700081E0700081E0700081C07 0018180E00FE187FC01F147F9320>77 D<07E01FC000E006000170040001700400013804 0001380400021C0800021C0800020E0800020E0800040710000407100004039000040390 000801E0000801E0000800E0000800E00018004000FE0040001A147F931A>I<07FFE000 E07001C01801C01C01C01C01C01C0380380380380380700381C007FF0007000007000007 00000E00000E00000E00000E00001C0000FF800016147F9315>80 D<1FFFF8381C1820381820380840380840381080701000700000700000700000E00000E0 0000E00000E00001C00001C00001C00001C0000380003FF8001514809314>84 D<07B00C7010703060606060606060C0C0C0C8C0C841C862D03C700D0D7E8C12>97 D<7C000C00180018001800180030003700388030C060C060C060C060C0C180C180C10043 00660038000A147E930F>I<007C000C0018001800180018003007B00C70107030606060 60606060C0C0C0C8C0C841C862D03C700E147E9311>100 D<07800C401020304060407F 8060004000C0004020604021801E000B0D7E8C10>I<06070600000000384C4C8C981818 30326262643808147F930C>105 D<0060007000600000000000000000038004C0046008 C008C000C000C0018001800180018003000300030003006600E600CC0078000C1A81930E >I<3E0006000C000C000C000C001800187018B819383230340038003E00630063106310 6310C320C1C00D147E9312>I<30F87C00590C86004E0D06009C0E0600980C0600180C06 00180C060030180C0030180C8030181880301818806030190060300E00190D7F8C1D> 109 D<30F8590C4E0C9C0C980C180C180C30183019303130316032601C100D7F8C15>I< 072008E010E030C060C060C060C0C180C180C180438067003B0003000300060006000600 3F800B137E8C0F>113 D<0700188019C0318038001E000F0003804180E180C10082007C 000A0D7E8C10>115 D<02000600060006000C00FF800C000C0018001800180018003000 31003100320032001C0009127F910D>I<0E3C13CE238E430C43000300030006000608C6 08E610CA2071C00F0D7F8C13>120 D<07100F2010E000400080010002000C0010202020 3840478083000C0D7F8C10>122 D E /Fo 46 123 df<0000F800030600040600080300 100300200300400700400700800700800601000E01000C0107F80104700207D802001C02 001C02001E04001E04001E04001E04001E08003C08003C08003C0800781800701400F014 00E01201C0218700207C0020000020000040000040000040000040000080000080000080 000018297F9F1A>12 D<0FFFFC1FFFFC3FFFFC608200C08400808400018400010400010C 00030C00030C00020C00060C00060C000E0C000C0E001C0E001C0E00380F001806001614 7E931A>25 D<70F8F8F87005057C840D>58 D<70F8FCFC74040404080810102040060E7C 840D>I<000001C00000078000001E00000078000001E00000078000000E000000380000 00F0000003C000000F0000003C000000F0000000F00000003C0000000F00000003C00000 00F0000000380000000E0000000780000001E0000000780000001E0000000780000001C0 1A1A7C9723>I<000100030003000600060006000C000C000C0018001800180030003000 3000600060006000C000C000C00180018001800300030003000600060006000C000C000C 00180018001800300030003000600060006000C000C000C000102D7DA117>II<00 0002000000060000000E0000000E0000001E0000001F0000002F0000002F0000004F0000 008F0000008F0000010F0000010F0000020F0000040F0000040F0000080F800008078000 1007800020078000200780007FFF80004007800080078001800780010007800200078002 0007C0040003C00C0003C01E0007C0FF807FFC1E207E9F22>65 D<00FFFFE0000F007800 0F003C000F001C000F001E001E001E001E001E001E001E001E001E003C003C003C003C00 3C0078003C00F0007803C0007FFF80007803C0007801E000F000F000F000F000F000F000 F0007001E000F001E000F001E000F001E000E003C001E003C003C003C0038003C00F0007 801E00FFFFF0001F1F7E9E22>I<0000FE0200078186001C004C0038003C0060003C00C0 001C01C0001803800018070000180F0000181E0000101E0000103C0000003C0000007800 0000780000007800000078000000F0000000F0000000F0000000F0000000F00000807000 008070000080700001003800010038000200180004000C001800060020000381C00000FE 00001F217E9F21>I<00FFFFE000000F007800000F001C00000F000E00000F000700001E 000700001E000380001E000380001E000380003C000380003C000380003C000380003C00 0380007800078000780007800078000780007800078000F0000F0000F0000F0000F0000E 0000F0001E0001E0001C0001E0003C0001E000380001E000700003C000E00003C001C000 03C003800003C007000007803C0000FFFFF00000211F7E9E26>I<00007E010003818300 0E00460038002E0070001E00E0000E01C0000C0380000C0700000C0F00000C1E0000081E 0000083C0000003C00000078000000780000007800000078000000F0000000F0007FFCF0 0001E0F00001E0F00003C0700003C0700003C0700003C038000780380007801C000F800C 000B80060033000380C100007F000020217E9F24>71 D<00FFF9FFF0000F801F00000F00 1E00000F001E00000F001E00001E003C00001E003C00001E003C00001E003C00003C0078 00003C007800003C007800003C007800007800F000007FFFF000007800F000007800F000 00F001E00000F001E00000F001E00000F001E00001E003C00001E003C00001E003C00001 E003C00003C007800003C007800003C007800003C007800007C00F8000FFF8FFF800241F 7E9E26>I<00FFFC000F80000F00000F00000F00001E00001E00001E00001E00003C0000 3C00003C00003C0000780000780000780000780000F00000F00000F00000F00001E00001 E00001E00001E00003C00003C00003C00003C00007C000FFFC00161F7F9E14>I<001FFF 0000F80000F00000F00000F00001E00001E00001E00001E00003C00003C00003C00003C0 000780000780000780000780000F00000F00000F00000F00001E00001E00301E00781E00 F83C00F83C00F0780080700040E00021C0001F000018207D9E19>I<00FF803FF0000F80 0780000F800200000BC00200000BC002000013C004000011E004000011E004000011E004 000020F008000020F008000020F808000020780800004078100000403C100000403C1000 00403C100000801E200000801E200000801E200000800F200001000F400001000F400001 0007C000010007C00002000780000200038000020003800006000380000F00010000FFE0 010000241F7E9E25>78 D<00FFFFC0000F0070000F0038000F001C000F001E001E001E00 1E001E001E001E001E001E003C003C003C003C003C0078003C0070007800E00078038000 7FFE000078000000F0000000F0000000F0000000F0000001E0000001E0000001E0000001 E0000003C0000003C0000003C0000003C0000007C00000FFFC00001F1F7E9E1D>80 D<0001FC0000070700001C01C0003000E000E000E001C000700380007007800078070000 380F0000381E0000381E0000383C0000383C000078780000787800007878000078780000 78F00000F0F00000F0F00000E0F00001E0F00001C0F00003C070000380701C070070600F 0038811E0038813C001C8170000E81E0000783808001FD00800001018000010100000383 00000386000003FE000003FC000001F8000000F0001D297E9F24>I<00FFFF80000F01E0 000F0070000F0038000F003C001E003C001E003C001E003C001E003C003C0078003C0078 003C00F0003C01E00078038000780F00007FF80000781C0000F00E0000F00F0000F00700 00F0078001E00F0001E00F0001E00F0001E00F0003C01E0003C01E0203C01E0203C01E04 07C00E04FFFC0718000003E01F207E9E23>I<0007E0800018118000300B000060070000 C0070001C0030001800200038002000380020003800200038000000380000003C0000003 F8000003FF800001FFC00000FFE000003FF0000003F0000000F000000070000000700000 0070002000700020007000200060006000E0006000C0006001C00070018000E8030000C6 0E000081F8000019217D9F1C>I<7FFC1FF807C003C00780010007800100078001000F00 02000F0002000F0002000F0002001E0004001E0004001E0004001E0004003C0008003C00 08003C0008003C00080078001000780010007800100078001000F0002000F0002000F000 2000F0004000F0004000700080007001000030020000380400000C18000007E000001D20 7C9E1F>85 DI<00FFF8 3FF8000FC00F80000F80060000078004000007C008000003C010000003C020000003E040 000001E080000001F100000000F300000000F600000000FC0000000078000000007C0000 00007C000000007C00000000BE000000011E000000021E000000061F0000000C0F000000 080F800000100780000020078000004007C000008003C000010003E000030003E0000F00 07E000FFE01FFE00251F7F9E26>88 D<007FFFF800FC00F000E001E000C003C001800780 0100078003000F0002001E0002003C00040078000000F8000000F0000001E0000003C000 00078000000F0000000F0000001E0000003C00000078008000F0008001F0010001E00100 03C00300078002000F0006001E0004003E000C003C003C007800F800FFFFF8001D1F7D9E 1F>90 D<00F1800389C00707800E03801C03803C0380380700780700780700780700F00E 00F00E00F00E00F00E10F01C20F01C20703C20705C40308C400F078014147E9318>97 D<07803F8007000700070007000E000E000E000E001C001C001CF01D0C3A0E3C0E380F38 0F700F700F700F700FE01EE01EE01EE01CE03CE038607060E031C01F0010207E9F14>I< 007C01C207010E0F1E0F1C0E3C04780078007800F000F000F000F000F000700170023004 18380FC010147E9314>I<0000780003F80000700000700000700000700000E00000E000 00E00000E00001C00001C000F1C00389C00707800E03801C03803C038038070078070078 0700780700F00E00F00E00F00E00F00E10F01C20F01C20703C20705C40308C400F078015 207E9F18>I<007C01C207010E011C013C013802780C7BF07C00F000F000F000F0007000 700170023004183807C010147E9315>I<00007C0000CE00019E00039E00030C00070000 0700000700000700000E00000E00000E0000FFF0000E00000E00001C00001C00001C0000 1C00001C0000380000380000380000380000380000700000700000700000700000700000 E00000E00000E00000E00000C00001C000318000798000F300006200003C000017297E9F 16>I<00E001E001E000C000000000000000000000000000000E00130023804380438043 808700070007000E000E001C001C001C20384038403840388019000E000B1F7E9E10> 105 D<0000C00001E00001E00001C0000000000000000000000000000000000000000000 001E00006300004380008380010380010380020700000700000700000700000E00000E00 000E00000E00001C00001C00001C00001C00003800003800003800003800007000007000 30700078E000F1C0006380003E00001328819E13>I<01E0000FE00001C00001C00001C0 0001C0000380000380000380000380000700000700000701E00706100E08700E10F00E20 F00E40601C80001D00001E00001FC000387000383800383800381C207038407038407038 40701880E01880600F0014207E9F18>I<1E07C07C00231861860023A032030043C03403 004380380380438038038087007007000700700700070070070007007007000E00E00E00 0E00E00E000E00E00E000E00E01C101C01C01C201C01C038201C01C038401C01C0184038 038018801801800F0024147E9328>109 D<1E07802318C023A06043C070438070438070 8700E00700E00700E00700E00E01C00E01C00E01C00E03821C03841C07041C07081C0308 3803101801E017147E931B>I<03C1E004621804741C08781C08701E08701E10E01E00E0 1E00E01E00E01E01C03C01C03C01C03C01C0380380780380700380E003C1C0072380071E 000700000700000E00000E00000E00000E00001C00001C0000FFC000171D819317>112 D<00F0400388C00705800E03801C03803C0380380700780700780700780700F00E00F00E 00F00E00F00E00F01C00F01C00703C00705C0030B8000F38000038000038000070000070 0000700000700000E00000E0000FFE00121D7E9314>I<1E1E0023210023C38043C78043 87804383008700000700000700000700000E00000E00000E00000E00001C00001C00001C 00001C000038000018000011147E9315>I<007C018203010603060706060E00078007F8 03FC01FE001F00077007F006F006E004400820301FC010147E9315>I<00C000E001C001 C001C001C003800380FFF8038007000700070007000E000E000E000E001C001C001C001C 10382038203820384018800F000D1C7F9B10>I<0F00601180702180E021C0E041C0E043 80E08381C00701C00701C00701C00E03800E03800E03800E03840E07080C07080C07080E 0F1006131003E1E016147E931A>I<0F01801183C02183E021C1E041C0E0438060838040 0700400700400700400E00800E00800E00800E01000E01000C02000E04000E0400061800 01E00013147E9316>I<0F006060118070F02180E0F821C0E07841C0E0384380E0188381 C0100701C0100701C0100701C0100E0380200E0380200E0380200E0380400E0380400E03 80800E078080060781000709860001F078001D147E9321>I<03C1C00C62201034701038 F02038F020386040700000700000700000700000E00000E00000E00000E02061C040F1C0 40F1C080E2C080446300383C0014147E931A>I<0F00601180702180E021C0E041C0E043 80E08381C00701C00701C00701C00E03800E03800E03800E03800E07000C07000C07000E 0F00061E0003EE00000E00000E00001C0078180078380070700060600021C0001F000014 1D7E9316>I<01E02003F04007F8C00C1F80080100000200000400000800001000006000 00C0000100000200000400800801001003003F060061FC0040F80080700013147E9315> I E /Fp 63 123 df<0003F07C001E0DC600380F0F00701E0F00E01E0E00E00C0001C01C 0001C01C0001C01C0001C01C0001C01C00038038007FFFFFC00380380003803800038038 00038038000700700007007000070070000700700007007000070070000E00E0000E00E0 000E00E0000E00E0000E00E0000E00E0001C01C0001E01E000FF8FFE0020207E9F1B>11 D<0003E0001C1800381800703C00E03C00E03801C00001C00001C00001C00001C0000380 007FFFF00380700380700380700380700700E00700E00700E00700E00700E00700E00E01 C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FF0FF816207E9F19>I<0003F400 1C1C00383C00703C00E03C00E03801C03801C03801C03801C03801C0380380707FFFF003 80700380700380700380700700E00700E00700E00700E00700E00700E00E01C00E01C00E 01C00E01C00E01C00E01C01C03801E03C0FF9FF816207E9F19>I<387C7C7E3A04040408 0810204080070E789F0D>39 D<00030004000800100020006000C0018001000300060006 000C000C001C0018001800380030003000700070006000600060006000E000E000E000E0 00E000E00060006000600060006000300030001000180008000C00040002000100102E7C A112>I<008000C000600020003000180018000C000C000C000E00060006000600060006 000600060006000600060006000E000E000E000C000C001C001800180038003000300060 006000C000C001800100030006000C0018003000600080000F2E7FA112>I<1C3E7E7E3A 0202040408081020C0070E7D840D>44 DI<3078F8787005057C 840D>I<007E0001C3000301800701C00E00C00E00E01C00E01C00E03C01E03801E07801 E07801E07801E07801E07801E0F003C0F003C0F003C0F003C0F003C0F00380F00780E007 80E00700E00700E00E00600E00701C003038003870000FC000131F7C9D17>48 D<000C001C00FC0F380038003800380038003800700070007000700070007000E000E000 E000E000E000E001C001C001C001C001C001C0038003C0FFFE0F1E7C9D17>I<003F8000 C1E00100F00200780400780400780F007C0F807C0F807C0F00780600780000F80000F000 01E00001C0000380000700000E00001C0000380000600000C00001800003002006002008 00401000403FFFC07FFF80FFFF80161E7E9D17>I<007F000183C00201E00400F00700F0 0F00F00F01F00F01F00001E00001E00003C0000380000700000E0000F800000E00000700 0007800007C00003C00007C03007C07807C0F807C0F807C0F00780800F00400E00201C00 18780007E000141F7D9D17>I<0000600000600000E00001C00003C00005C0000DC00009 C00011C000238000438000C3800083800103800203800407000807001807001007002007 00400700FFFFF0000E00000E00000E00000E00000E00001C00001E0001FFE0141E7E9D17 >I<0000100000001800000038000000380000007800000078000000FC000001BC000001 3C0000033C0000023C0000063C0000043E0000081E0000081E0000101E0000101E000020 1E0000200F0000400F0000400F0000FFFF0000800F0001000F8001000780020007800200 078004000780040007800C0007C03E0007C0FF807FFC1E207E9F22>65 D<07FFFF00007C01C0003C01E0003C00F0007800F8007800F8007800F8007800F8007800 F8007800F000F001F000F001E000F003C000F00F8000FFFE0000F00F0001E007C001E003 C001E003E001E001E001E001E001E001E003C001E003C003E003C003E003C003C003C007 C003C00F8007800F0007803E00FFFFF0001D1F7E9E20>I<0001F808000E061800380138 007000F801E0007803C0007007800030078000300F0000301F0000301E0000303E000020 3C0000007C0000007C0000007C0000007C000000F8000000F8000000F8000000F8000000 F80000007800004078000080780000803C0000803C0001001C0002000E00020006000C00 0300100001C0E000003F00001D217B9F21>I<07FFFF00007C01E0003C00F0003C007800 78003C0078003C0078001E0078001E0078001E0078001F00F0001F00F0001F00F0001F00 F0001F00F0001F00F0001F01E0001E01E0003E01E0003E01E0003E01E0003C01E0007C03 C0007803C000F003C000F003C001E003C003C003C0078007800F0007803C00FFFFE00020 1F7E9E23>I<07FFFFF8007C0078003C0038003C00180078001800780008007800080078 0008007800080078080800F0100000F0100000F0100000F0300000FFF00000F0700001E0 200001E0200001E0200001E0200001E0000801E0001003C0001003C0001003C0002003C0 002003C0006003C000C0078001C0078007C0FFFFFF801D1F7E9E1F>I<0001FC04000F03 0C003C009C0070007C00E0003C01C0003803800018078000180F0000181F0000181E0000 183E0000103C0000007C0000007C0000007C0000007C000000F8000000F8000000F8007F FCF80003E0780001E0780001E0780003C0780003C03C0003C03C0003C01C0003C00E0007 C007000B800380118001E06080003F80001E217B9F24>71 D<07FFC7FFC0007C00F80000 3C007800003C007800007800F000007800F000007800F000007800F000007800F0000078 00F00000F001E00000F001E00000F001E00000F001E00000FFFFE00000F001E00001E003 C00001E003C00001E003C00001E003C00001E003C00001E003C00003C007800003C00780 0003C007800003C007800003C007800003C007800007800F000007C00F8000FFF8FFF800 221F7E9E22>I<07FFE0007C00003C00003C000078000078000078000078000078000078 0000F00000F00000F00000F00000F00000F00001E00001E00001E00001E00001E00001E0 0003C00003C00003C00003C00003C00003C00007800007C000FFFC00131F7F9E10>I<07 FFE07FE0007C001F00003C000C00003C0018000078001000007800400000780080000078 0100000078020000007804000000F008000000F010000000F060000000F0F0000000F1F0 000000F278000001E478000001E878000001F03C000001E03C000001E01E000001E01E00 0003C00F000003C00F000003C00F000003C007800003C007800003C003C000078003C000 07C007E000FFFC3FFC00231F7E9E23>75 D<07FFF000007E0000003C0000003C00000078 0000007800000078000000780000007800000078000000F0000000F0000000F0000000F0 000000F0000000F0000001E0000001E0000001E0000001E0000001E0008001E0010003C0 010003C0010003C0030003C0020003C0060003C0060007801E0007807C00FFFFFC00191F 7E9E1C>I<07FC0000FFC0007C0000F800003C00017800003C00017800004E0002F00000 4E0002F000004E0004F000004E0004F000004E0008F000004E0008F00000870011E00000 870011E00000870021E00000870021E00000870041E00000838041E00001038083C00001 038083C00001038103C00001038203C0000101C203C0000101C403C0000201C407800002 01C80780000201C80780000201D00780000200F00780000600E00780000600E00F00000F 00C00F8000FFE0C1FFF8002A1F7E9E2A>I<07FC01FFC0003E003E00003E001800003E00 1800004F001000004F001000004780100000478010000043C010000043C010000083C020 000081E020000081E020000080F020000080F020000080782000010078400001007C4000 01003C400001003C400001001E400001001E400002000F800002000F800002000F800002 000780000200078000060003800006000300000F00010000FFE0010000221F7E9E22>I< 0003F800001E0E000038070000E0038001C001C003C001E0078000E00F0000F00F0000F0 1E0000F01E0000F83E0000F83C0000F87C0000F87C0000F87C0000F87C0000F8F80001F0 F80001F0F80001F0F80001F0F80003E0780003E0780003C0780007C07C0007803C000F00 3C001E001E001C000E0038000700F00003C3C00000FE00001D217B9F23>I<07FFFF0000 7C03C0003C01E0003C00F0007800F0007800F8007800F8007800F8007800F8007800F000 F001F000F001E000F003C000F0078000F00F0000FFF80001E0000001E0000001E0000001 E0000001E0000001E0000003C0000003C0000003C0000003C0000003C0000003C0000007 80000007C00000FFFC00001D1F7E9E1F>I<07FFFC00007C0700003C03C0003C01E00078 01E0007801F0007801F0007801F0007801F0007801E000F003E000F003C000F0078000F0 0F0000F03C0000FFF00001E0300001E0380001E01C0001E01C0001E01C0001E01E0003C0 3E0003C03E0003C03E0003C03E0003C03E0003C03E0207803E0407C01F04FFFC0F180000 03E01F207E9E21>82 D<003F040060CC01803C03801C03001C0700180600080E00080E00 080E00080E00000F00000F80000FE00007FE0003FF8001FFC0007FE00007E00001E00000 E00000F00000F04000E04000E04000E04000E06000C0600180E00380F80300C60C0081F8 0016217D9F19>I<3FFFFFF03C0780F03007803060078030400F0010400F0010C00F0010 800F0010800F0010800F0010001E0000001E0000001E0000001E0000001E0000001E0000 003C0000003C0000003C0000003C0000003C0000003C0000007800000078000000780000 00780000007800000078000000F0000001F800007FFFE0001C1F7A9E21>IIII<03FFC0FF C0007F007E00003E003800001E003000001E002000000F004000000F008000000F810000 00078200000007C600000003C400000003E800000001F000000001F000000000F0000000 00F800000000F8000000017C000000023C000000043C0000000C1E000000081E00000010 1F000000200F000000400F800000C0078000008007C000010003C000070003E0001F8007 E000FFE01FFE00221F7F9E22>I I<03FFFFC003E007800380078007000F0006001E0004003C000C003C00080078000800F0 000801F0000001E0000003C0000007800000078000000F0000001E0000003C0000003C00 000078000000F0010001E0010001E0020003C00200078002000F8006000F0004001E000C 003C001C007C003C007800F800FFFFF8001A1F7D9E1C>I<3078F8F8700505789E0D>95 D<07F8000C0C001E06001E07001C070000070000070000070000FF0007C7001E07003C0E 00780E00F00E10F00E10F00E10F01E10F02E20784F401F878014147D9317>97 D<0700003F00000F00000700000700000E00000E00000E00000E00000E00000E00001C00 001C7C001D87001E03801C01C01C01C03801C03801E03801E03801E03801E03801E07003 C07003C0700380700780700700700E00E81C00C4380083E00013207B9F19>I<01FC0706 0E0F1C0F380E78007000F000F000F000F000E000E000E000E000F0027004300818300FC0 10147C9314>I<0000700003F00000F00000700000700000E00000E00000E00000E00000 E00000E00001C000F9C00305C00E03C01C03C03801C0780380700380F00380F00380F003 80F00380E00700E00700E00700E00700E00700700F00301E00186F000F8FE014207C9F19 >I<00F800070E000E07001C0700380380780380700380F00380F00380FFFF80F00000E0 0000E00000E00000E00000F001007002003004001C180007E00011147D9314>I<000780 0018C00031E00061E000E1C000C00001C00001C00001C00001C00001C0000380007FF800 0380000380000380000380000700000700000700000700000700000700000E00000E0000 0E00000E00000E00000E00001C00001E0000FFE00013207E9F0E>I<00000E003E1100E1 A301C1C20381E00780E00701E00F01E00F01E00F01E00703C007038007870004FC000800 000800001800001C00000FFF000FFFC007FFE01800F0300030600030C00030C00030C000 306000603000C01C070007FC00181F809417>I<00E00007E00001E00000E00000E00001 C00001C00001C00001C00001C00001C000038000038F800390E003A0E003C06003806007 80E00700E00700E00700E00700E00700E00E01C00E01C00E01C00E01C00E01C00E01C01C 03801E03C0FFCFF815207E9F19>I<01C003E003E003E001C00000000000000000000000 0003801F800780038003800700070007000700070007000E000E000E000E000E000E001C 001E00FF800B1F7F9E0C>I<00E00007E00001E00000E00000E00001C00001C00001C000 01C00001C00001C0000380000383FC0380F00380C0038180038100070400070800071800 073800077C00071C000E1C000E0E000E0E000E0F000E07000E07801C03801E07C0FF8FF0 16207E9F18>107 D<00E007E001E000E000E001C001C001C001C001C001C00380038003 800380038003800700070007000700070007000E000E000E000E000E000E001C001E00FF C00B207F9F0C>I<0387C07C001F9861860007A072070003C03403000380380300078078 0700070070070007007007000700700700070070070007007007000E00E00E000E00E00E 000E00E00E000E00E00E000E00E00E000E00E00E001C01C01C001E01E01E00FFCFFCFFC0 22147E9326>I<038F801F90E007A0E003C0600380600780E00700E00700E00700E00700 E00700E00E01C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FFCFF815147E9319 >I<00FC000387000E01801C00C03800E03800E07000F0F000F0F000F0F000F0F000F0E0 01E0E001E0E001C0E003C0F00380700700380E001C1C0007E00014147D9317>I<00E3E0 07EC3800F01C00E01E00E00E01C00E01C00F01C00F01C00F01C00F01C00F03801E03801E 03801C03803C0380380380700740E00721C0071F000700000700000700000E00000E0000 0E00000E00001E0000FFC000181D809319>I<00F040038CC00E04C01C03C03C03C07803 80780380F00380F00380F00380F00380E00700E00700E00700F00700F00F00700F00301E 00186E000F8E00000E00000E00000E00001C00001C00001C00001C00003C0001FF80121D 7C9318>I<038E001FB38007C78003C78003830007800007000007000007000007000007 00000E00000E00000E00000E00000E00000E00001C00001E0000FFE00011147E9312>I< 01F2060E080618061802380438001E001FE00FF003F8003C401C400C400C600C6018E010 D0608FC00F147E9312>I<0080010001000100030007000F001E00FFF80E000E000E000E 001C001C001C001C001C001C00380038203820382038203840384018800F000D1C7C9B12 >I<1C0380FC1F803C07801C03801C038038070038070038070038070038070038070070 0E00700E00700E00700E00701E00701E00703C00305E001F9FC012147B9319>III<1FF0FF03C07801C06001C04000E08000E180007300007600003C00003C 00001C00002E00004E000087000107000203800603800C01C03E03E0FF07FC18147F9318 >I<0FF83F8001E00E0001C00C0001C0080000E0180000E0100000E0200000E0200000F0 40000070400000708000007080000071000000390000003A0000003E0000003C00000038 000000180000001000000010000000200000002000000040000070C00000F0800000F100 0000E20000007C000000191D809318>I<07FFE00701E00401C00C0380080700080E0010 1C0000380000700000700000E00001C0000380800700800E00801C01001C010038030070 0E00FFFE0013147F9314>I E /Fq 5 117 df 77 D<001800001800001800003C00003C00004E00004E00004E00008700008700018780 0103800103800201C00201C003FFC00400E00400E00800700800701800703C0078FE01FF 18177F961C>97 DI108 D<7FFFFC70381C403804403804C038068038028038028038020038000038000038000038 00003800003800003800003800003800003800003800003800003800007C0007FFC01717 7F961B>116 D E /Fr 94 127 df<70F8F8F8F8F8F8F8F8F8F8F8F8F8F8F8F870000000 000070F8F8F870051C779B18>33 D<4010E038F078E038E038E038E038E038E038E038E0 38E038E03860300D0E7B9C18>I<030600078F00078F00078F00078F00078F00078F007F FFC0FFFFE0FFFFE07FFFC00F1E000F1E000F1E000F1E000F1E000F1E007FFFC0FFFFE0FF FFE07FFFC01E3C001E3C001E3C001E3C001E3C001E3C000C1800131C7E9B18>I<00C000 01C00001C00001C00003F0000FFC003FFE007DCF0071C700E1C380E1C780E1C780E1C780 F1C00079C0003DC0001FE0000FF80003FC0001DE0001CF0001C70061C380F1C380F1C380 E1C380E1C70071C70079DE003FFE001FF80007E00001C00001C00001C00000C00011247D 9F18>I<3803007C07807C0780EE0F80EE0F00EE0F00EE1F00EE1E00EE1E00EE3E007C3C 007C3C00387C0000780000780000F80000F00001F00001E00001E00003E00003C00003C0 0007C0000783800787C00F87C00F0EE00F0EE01F0EE01E0EE01E0EE03E0EE03C07C03C07 C018038013247E9F18>I<01C00007E0000FF0000E70001C38001C38001C38001C38001C 73F01C73F01CE3F00FE3800FC7000F87000F07001F0E003F0E007B8E0073DC00E1DC00E0 F800E0F800E07070E0787070FC707FFFE03FCFE00F03C0141C7F9B18>I<387C7C7E3E0E 0E0E1C1C38F8F0C0070E789B18>I<007000F001E003C007800F001E001C003800380070 00700070007000E000E000E000E000E000E000E000E0007000700070007000380038001C 001E000F00078003C001F000F000700C24799F18>I<6000F00078003C001E000F000780 038001C001C000E000E000E000E00070007000700070007000700070007000E000E000E0 00E001C001C0038007800F001E003C007800F00060000C247C9F18>I<01C00001C00001 C00001C000C1C180F1C780F9CF807FFF001FFC0007F00007F0001FFC007FFF00F9CF80F1 C780C1C18001C00001C00001C00001C00011147D9718>I<00600000F00000F00000F000 00F00000F00000F00000F0007FFFC0FFFFE0FFFFE07FFFC000F00000F00000F00000F000 00F00000F00000F00000600013147E9718>I<1C3E7E7F3F1F070E1E7CF860080C788518> I<7FFF00FFFF80FFFF807FFF0011047D8F18>I<3078FCFC78300606778518>I<00030000 0780000780000F80000F00001F00001E00001E00003E00003C00007C0000780000780000 F80000F00001F00001E00003E00003C00003C00007C0000780000F80000F00000F00001F 00001E00003E00003C00003C00007C0000780000F80000F00000F0000060000011247D9F 18>I<01F00007FC000FFE001F1F001C07003803807803C07001C07001C0E000E0E000E0 E000E0E000E0E000E0E000E0E000E0E000E0E000E0F001E07001C07001C07803C0380380 1C07001F1F000FFE0007FC0001F000131C7E9B18>I<01800380038007800F803F80FF80 FB8043800380038003800380038003800380038003800380038003800380038003800380 7FFCFFFE7FFC0F1C7B9B18>I<03F0000FFE003FFF007C0F807003C0E001C0F000E0F000 E06000E00000E00000E00001C00001C00003C0000780000F00001E00003C0000780000F0 0001E00007C0000F80001E00E03C00E07FFFE0FFFFE07FFFE0131C7E9B18>I<07F8001F FE003FFF007807807803C07801C03001C00001C00003C0000380000F0003FF0003FE0003 FF000007800003C00001C00000E00000E00000E0F000E0F000E0F001C0F003C07C07803F FF001FFE0003F800131C7E9B18>I<001F00003F0000770000770000E70001E70001C700 0387000787000707000E07001E07003C0700380700780700F00700FFFFF8FFFFF8FFFFF8 000700000700000700000700000700000700007FF000FFF8007FF0151C7F9B18>I<1FFF 803FFF803FFF803800003800003800003800003800003800003800003800003BF8003FFE 003FFF003C07801803C00001C00000E00000E06000E0F000E0F000E0E001C07003C07C0F 803FFF001FFC0003F000131C7E9B18>I<007E0001FF0007FF800F83C01E03C01C03C038 0180380000700000700000E1F800E7FE00FFFF00FE0780F803C0F001C0F000E0E000E0F0 00E07000E07000E07000E03801C03C03C01E07800FFF0007FE0001F800131C7E9B18>I< E00000FFFFE0FFFFE0FFFFE0E003C0E00780000700000E00001E00001C00003800003800 00700000700000E00000E00000E00001C00001C00001C00001C00003C000038000038000 038000038000038000038000038000131D7E9C18>I<03F8000FFE001FFF003E0F803803 807001C07001C07001C07001C03803803C07801FFF0007FC000FFE001F1F003C07807001 C0F001E0E000E0E000E0E000E0E000E07001C07803C03E0F801FFF000FFE0003F800131C 7E9B18>I<03F0000FFC001FFE003C0F00780780700380E001C0E001C0E001C0E001E0E0 01E07001E07803E03C0FE01FFFE00FFEE003F0E00000E00001C00001C00001C030038078 0780780F00783E003FFC001FF00007C000131C7E9B18>I<3078FCFC7830000000000000 00003078FCFC78300614779318>I<183C7E7E3C180000000000000000183C7E7E3E1E0E 1C3C78F060071A789318>I<000300000780001F80003F00007E0001FC0003F00007E000 1FC0003F00007E0000FC0000FC00007E00003F00001FC00007E00003F00001FC00007E00 003F00001F8000078000030011187D9918>I<7FFFC0FFFFE0FFFFE0FFFFE00000000000 00000000000000FFFFE0FFFFE0FFFFE07FFFC0130C7E9318>I<600000F00000FC00007E 00003F00001FC00007E00003F00001FC00007E00003F00001F80001F80003F00007E0001 FC0003F00007E0001FC0003F00007E0000FC0000F0000060000011187D9918>I<0FF000 3FFC007FFF00700F00F00380F00380600780000F00003E00007C0001F00001E00003C000 03C00003C00003C00003C00003800000000000000000000000000000000003800007C000 07C00007C000038000111C7D9B18>I<007C0001FE0007FF000F87801E03C03C1DC0387F C070FFE071E3E071C1E0E1C1E0E380E0E380E0E380E0E380E0E380E0E380E0E1C1C071C1 C071E3C070FF80387F003C1C001E00E00F83E007FFC001FF80007E00131C7E9B18>I<00 700000F80000F80000D80000D80001DC0001DC0001DC00018C00038E00038E00038E0003 8E000306000707000707000707000707000FFF800FFF800FFF800E03800E03801C01C01C 01C07F07F0FF8FF87F07F0151C7F9B18>I I<00F8E003FEE007FFE00F07E01E03E03C01E03800E07000E07000E0700000E00000E000 00E00000E00000E00000E00000E00000E000007000007000E07000E03800E03C00E01E01 C00F07C007FF8003FE0000F800131C7E9B18>I<7FF800FFFE007FFF001C0F801C03C01C 03C01C01E01C00E01C00E01C00F01C00701C00701C00701C00701C00701C00701C00701C 00701C00F01C00E01C00E01C01E01C01C01C03C01C0F807FFF00FFFE007FF800141C7F9B 18>III<01F1C003FDC00FFFC01F0FC01C03C03803C03801C07001C07001C0700000E0 0000E00000E00000E00000E00000E00FF0E01FF0E00FF07001C07001C07003C03803C038 03C01C07C01F0FC00FFFC003FDC001F1C0141C7E9B18>I<7F07F0FF8FF87F07F01C01C0 1C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01FFFC01FFFC01FFFC01C01C0 1C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C01C07F07F0FF8FF87F07F0 151C7F9B18>I<7FFF00FFFF807FFF0001C00001C00001C00001C00001C00001C00001C0 0001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C0 0001C00001C00001C0007FFF00FFFF807FFF00111C7D9B18>I<01FFC003FFC001FFC000 0E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E0000 0E00000E00000E00000E00000E00000E00000E00F00E00F00E00F03C007FFC003FF0000F C000121C7D9B18>I<7F07F0FF87F87F07F01C03C01C07801C07001C0E001C1E001C3C00 1C38001C70001CF0001DF0001DF0001FB8001FB8001F1C001E1C001C0E001C0E001C0700 1C07001C03801C03801C01C07F03F0FF87F87F03F0151C7F9B18>I<7FE000FFE0007FE0 000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00 000E00000E00000E00000E00000E00000E00700E00700E00700E00700E00707FFFF0FFFF F07FFFF0141C7F9B18>II<7E07F0FF0FF8 7F07F01D81C01D81C01D81C01DC1C01CC1C01CC1C01CE1C01CE1C01CE1C01C61C01C71C0 1C71C01C31C01C39C01C39C01C39C01C19C01C19C01C1DC01C0DC01C0DC01C0DC07F07C0 FF87C07F03C0151C7F9B18>I<0FF8003FFE007FFF00780F00700700F00780E00380E003 80E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380E003 80E00380E00380F00780700700780F007FFF003FFE000FF800111C7D9B18>II<0FF8003FFE007FFF00780F00700700F00780E00380 E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380 E00380E1E380E1E380F0E78070F700787F007FFF003FFE000FFC00001C00001E00000E00 000F0000070000070011227D9B18>I<7FF800FFFE007FFF001C0F801C03801C03C01C01 C01C01C01C01C01C03C01C03801C0F801FFF001FFE001FFE001C0F001C07001C03801C03 801C03801C03801C03801C039C1C039C1C039C7F01F8FF81F87F00F0161C7F9B18>I<03 F3801FFF803FFF807C0F80700780E00380E00380E00380E000007000007800003F00001F F00007FE0000FF00000F800003C00001C00000E00000E06000E0E000E0E001E0F001C0F8 0780FFFF80FFFE00E7F800131C7E9B18>I<7FFFF8FFFFF8FFFFF8E07038E07038E07038 E07038007000007000007000007000007000007000007000007000007000007000007000 00700000700000700000700000700000700000700007FF0007FF0007FF00151C7F9B18> IIII<7F8FE07F9FE07F8FE00E07000F07 00070E00078E00039C0003DC0001F80001F80000F00000F00000700000F00000F80001F8 0001DC00039E00038E00070F000707000E07800E03801E03C07F07F0FF8FF87F07F0151C 7F9B18>II<3FFFE07FFFE07FFFE07001C0 7003C0700780700700000F00001E00001C00003C0000780000700000F00001E00001C000 03C0000780000700000F00001E00E01C00E03C00E07800E07000E0FFFFE0FFFFE0FFFFE0 131C7E9B18>II<600000F00000F00000F800007800007C00003C00003C 00003E00001E00001F00000F00000F00000F800007800007C00003C00003C00003E00001 E00001F00000F00000F800007800007800007C00003C00003E00001E00001E00001F0000 0F00000F8000078000078000030011247D9F18>II<018007C01FF07EFC F83EE00E0F067C9B18>I<7FFF00FFFF80FFFF807FFF0011047D7F18>I<061E3E387070E0 E0E0F8FC7C7C38070E789E18>I<1FE0003FF8007FFC00781E00300E0000070000070000 FF0007FF001FFF007F0700780700E00700E00700E00700F00F00781F003FFFF01FFBF007 E1F014147D9318>I<7E0000FE00007E00000E00000E00000E00000E00000E00000E3E00 0EFF800FFFC00FC1E00F80E00F00700E00700E00380E00380E00380E00380E00380E0038 0F00700F00700F80E00FC1E00FFFC00EFF80063E00151C809B18>I<01FE0007FF001FFF 803E0780380300700000700000E00000E00000E00000E00000E00000E000007000007001 C03801C03E03C01FFF8007FF0001FC0012147D9318>I<001F80003F80001F8000038000 038000038000038000038003E3800FFB801FFF803C1F80380F80700780700380E00380E0 0380E00380E00380E00380E00380700780700780380F803C1F801FFFF00FFBF803E3F015 1C7E9B18>I<01F00007FC001FFE003E0F00380780700380700380E001C0E001C0FFFFC0 FFFFC0FFFFC0E000007000007001C03801C03E03C01FFF8007FF0001FC0012147D9318> I<001F80007FC000FFE000E1E001C0C001C00001C00001C0007FFFC0FFFFC0FFFFC001C0 0001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C0 0001C0007FFF007FFF007FFF00131C7F9B18>I<01E1F007FFF80FFFF81E1E301C0E0038 07003807003807003807003807001C0E001E1E001FFC001FF80039E0003800001C00001F FE001FFFC03FFFE07801F0700070E00038E00038E00038E000387800F07E03F01FFFC00F FF8001FC00151F7F9318>I<7E0000FE00007E00000E00000E00000E00000E00000E0000 0E3E000EFF800FFFC00FC1C00F80E00F00E00E00E00E00E00E00E00E00E00E00E00E00E0 0E00E00E00E00E00E00E00E00E00E07FC3FCFFE7FE7FC3FC171C809B18>I<03800007C0 0007C00007C0000380000000000000000000000000007FC000FFC0007FC00001C00001C0 0001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C0 00FFFF00FFFF80FFFF00111D7C9C18>I<0038007C007C007C003800000000000000000F FC1FFC0FFC001C001C001C001C001C001C001C001C001C001C001C001C001C001C001C00 1C001C001C001C001C001C001C6038F078FFF07FE03F800E277E9C18>II<7FE000FFE0007FE00000E00000E00000E00000E00000E0 0000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E0 0000E00000E00000E00000E00000E0007FFFC0FFFFE07FFFC0131C7E9B18>I<7CE0E000 FFFBF8007FFFF8001F1F1C001E1E1C001E1E1C001C1C1C001C1C1C001C1C1C001C1C1C00 1C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C007F1F1F00FFBFBF80 7F1F1F001914819318>I<7E3E00FEFF807FFFC00FC1C00F80E00F00E00E00E00E00E00E 00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E07FC3FCFFE7FE7FC3FC17 14809318>I<01F0000FFE001FFF003E0F803803807001C07001C0E000E0E000E0E000E0 E000E0E000E0F001E07001C07803C03C07803E0F801FFF000FFE0001F00013147E9318> I<7E3E00FEFF807FFFC00FC1E00F80E00F00700E00700E00380E00380E00380E00380E00 380E00380F00700F00700F80E00FC1E00FFFC00EFF800E3E000E00000E00000E00000E00 000E00000E00000E00007FC000FFE0007FC000151E809318>I<01E38007FB801FFF803E 1F80380F80700780700780E00380E00380E00380E00380E00380E0038070078070078038 0F803C1F801FFF800FFB8003E38000038000038000038000038000038000038000038000 3FF8003FF8003FF8151E7E9318>I<7F87E0FF9FF07FBFF803F87803F03003E00003C000 03C0000380000380000380000380000380000380000380000380000380007FFE00FFFF00 7FFE0015147F9318>I<07F7003FFF007FFF00780F00E00700E00700E007007C00007FE0 001FFC0003FE00001F00600780E00380E00380F00380F80F00FFFF00FFFC00E7F0001114 7D9318>I<0180000380000380000380000380007FFFC0FFFFC0FFFFC003800003800003 80000380000380000380000380000380000380000380400380E00380E00380E001C1C001 FFC000FF80003E0013197F9818>I<7E07E0FE0FE07E07E00E00E00E00E00E00E00E00E0 0E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E01E00F03E007FFFC03FFFE 01FCFC1714809318>I<7F8FF0FF8FF87F8FF01E03C00E03800E03800E03800707000707 00070700038E00038E00038E00038E0001DC0001DC0001DC0000F80000F8000070001514 7F9318>II< 7F8FF07F9FF07F8FF0070700078E00039E0001DC0001F80000F80000700000F00000F800 01DC00039E00038E000707000F07807F8FF0FF8FF87F8FF015147F9318>I<7F8FF0FF8F F87F8FF00E01C00E03800E0380070380070700070700038700038600038E0001CE0001CE 0000CC0000CC0000DC0000780000780000780000700000700000700000F00000E00079E0 007BC0007F80003F00001E0000151E7F9318>I<3FFFF07FFFF07FFFF07001E07003C070 0780000F00001E00003C0000F80001F00003C0000780000F00701E00703C0070780070FF FFF0FFFFF0FFFFF014147F9318>I<0007E0001FE0007FE000780000E00000E00000E000 00E00000E00000E00000E00000E00000E00000E00000E00001E0007FC000FF8000FF8000 7FC00001E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E000 00E000007800007FE0001FE00007E013247E9F18>I<60F0F0F0F0F0F0F0F0F0F0F0F0F0 F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0600424769F18>I<7C0000FF0000FF C00003C00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000 E00000F000007FC0003FE0003FE0007FC000F00000E00000E00000E00000E00000E00000 E00000E00000E00000E00000E00000E00003C000FFC000FF00007C000013247E9F18>I< 060C1F1E3FBEFBF8F1F060C00F067C9B18>I E /Fs 58 123 df<00003FFC07F8000003 FFFF3FFE00000FF807FF0F00003FC003FC1F80007F0007F83FC000FE000FF83FC001FE00 0FF03FC001FC000FF03FC003FC000FF01F8003FC000FF0060003FC000FF0000003FC000F F0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0 000003FC000FF00000FFFFFFFFFFF000FFFFFFFFFFF000FFFFFFFFFFF00003FC000FF000 0003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF00000 03FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003 FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC 000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC00 0FF0000003FC000FF0000003FC000FF0000003FC000FF0000003FC000FF000007FFFE1FF FFC0007FFFE1FFFFC0007FFFE1FFFFC00032327FB12F>11 D45 D<000FF80000007FFF000001FC1FC00003F007 E00007E003F0000FE003F8001FC001FC001FC001FC003FC001FE003F8000FE003F8000FE 007F8000FF007F8000FF007F8000FF007F8000FF00FF8000FF80FF8000FF80FF8000FF80 FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF 8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF807F8000FF007F80 00FF007F8000FF007F8000FF007F8000FF003F8000FE003FC001FE001FC001FC001FC001 FC000FE003F80007E003F00003F007E00001FC1FC000007FFF0000000FF80000212E7DAD 28>48 D<0001C0000003C000000FC000007FC0001FFFC000FFFFC000FFBFC000E03FC000 003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000 003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000 003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000 003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC0007FFFFFE0 7FFFFFE07FFFFFE01B2E7AAD28>I<003FE00001FFFE0007FFFF800F80FFC01E003FE038 001FF07C000FF87E0007FCFF0007FCFF8007FEFF8007FEFF8003FEFF8003FE7F0003FE3E 0007FE000007FE000007FC000007FC00000FF800000FF800000FF000001FE000001FC000 003F8000007F0000007E000000F8000001F0000003E0000007C000000F0000001E000E00 3C000E0038000E0070001E00E0001C01C0001C0300003C07FFFFFC0FFFFFFC1FFFFFFC3F FFFFFC7FFFFFF8FFFFFFF8FFFFFFF8FFFFFFF81F2E7CAD28>I<001FF80000007FFF0000 01FFFFC00003E03FE00007800FF0000FC00FF8001FE007F8001FE007FC001FE007FC001F E007FC001FE007FC000FC007FC00078007FC0000000FF80000000FF80000000FF0000000 1FE00000001FC00000003F80000000FE0000003FF80000003FFF800000001FE000000007 F000000007F800000003FC00000003FE00000001FF00000001FF00000001FF80000001FF 80000001FF801C0001FF803E0001FF807F0001FF80FF8001FF80FF8001FF00FF8001FF00 FF8003FE007F0003FE007E0007FC003C0007F8001FC01FF0000FFFFFC00003FFFF000000 3FF80000212E7DAD28>I<0000007000000000F000000001F000000003F000000007F000 00000FF00000000FF00000001FF00000003FF000000077F0000000F7F0000000E7F00000 01C7F000000387F000000707F000000F07F000000E07F000001C07F000003807F0000070 07F00000F007F00000E007F00001C007F000038007F000070007F0000F0007F0000E0007 F0001C0007F000380007F000700007F000E00007F000FFFFFFFFE0FFFFFFFFE0FFFFFFFF E000000FF00000000FF00000000FF00000000FF00000000FF00000000FF00000000FF000 00000FF00000000FF000000FFFFFE0000FFFFFE0000FFFFFE0232E7EAD28>I<0C000030 0FC003F00FFFFFE00FFFFFC00FFFFF800FFFFF000FFFFE000FFFF8000FFFF0000FFF8000 0E0000000E0000000E0000000E0000000E0000000E0000000E0000000E0000000E1FF000 0E7FFE000FE03F800F800FC00E0007E00C0007F0000007F8000003FC000003FC000003FC 000003FE000003FE180003FE3E0003FE7F0003FEFF0003FEFF0003FEFF0003FCFF0003FC FE0003FC780007F8780007F03C000FE01E001FC00FC07F8007FFFF0001FFFC00003FE000 1F2E7CAD28>I<0000FF80000007FFE000001FFFF000007F80F80000FE003C0001F8007C 0003F000FE0007F001FE000FE001FE000FE001FE001FC001FE003FC000FC003FC0007800 3FC00000007F800000007F800000007F80000000FF83FC0000FF8FFF8000FF9C0FC000FF B003F000FFB001F800FFE001FC00FFC001FE00FFC000FE00FFC000FF00FFC000FF00FF80 00FF80FF8000FF80FF8000FF80FF8000FF807F8000FF807F8000FF807F8000FF807F8000 FF803F8000FF003FC000FF001FC000FF001FC000FE000FC001FC0007E001FC0003F003F8 0001FC0FE00000FFFFC000003FFF0000000FFC0000212E7DAD28>I<38000000003E0000 00003FFFFFFFC03FFFFFFFC03FFFFFFFC03FFFFFFF807FFFFFFF007FFFFFFE007FFFFFFC 007FFFFFF80078000038007000007000700000E000F00001C000E000038000E000070000 E00007000000000E000000001C00000000380000000038000000007800000000F0000000 00F000000001F000000001E000000003E000000003E000000007E000000007E00000000F C00000000FC00000000FC00000001FC00000001FC00000001FC00000001FC00000001FC0 0000003FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC000 00003FC00000001F800000000F00000022307CAF28>I<000FF80000003FFF000000FFFF C00001F00FE00003C003F000078000F8000F0000F8000F00007C000F00007C001F00007C 001F00007C001F80007C001FC0007C001FF000F8001FFC00F8000FFE00F0000FFF81E000 07FFE3C00007FFFF800003FFFE000001FFFF000000FFFFC000003FFFE00001FFFFF00003 E3FFF80007C1FFFC001F807FFE003F001FFF003E0007FF007E0003FF807E0000FF80FC00 007F80FC00003F80FC00001F80FC00001F80FC00001F80FC00001F007E00001F007E0000 1F007F00003E003F00007C001FC000F8000FF007F00003FFFFE00000FFFF8000001FF800 00212E7DAD28>I<000FF80000007FFF000001FFFF800003F80FC00007E007E0000FC003 F0001FC001F8003FC001FC007F8001FC007F8001FE007F8000FE00FF8000FF00FF8000FF 00FF8000FF00FF8000FF00FF8000FF80FF8000FF80FF8000FF80FF8000FF807F8001FF80 7F8001FF803F8001FF803FC001FF801FC003FF800FC006FF8007E006FF8001F81CFF8000 FFF8FF80001FE0FF80000000FF00000000FF00000000FF00000000FF000F0001FE001F80 01FE003FC001FC003FC001FC003FC003F8003FC003F0003F8007E0001F000FC0001E001F 80000F80FF000007FFFE000001FFF80000007FC00000212E7DAD28>I<00000078000000 00000078000000000000FC000000000000FC000000000000FC000000000001FE00000000 0001FE000000000003FF000000000003FF000000000007FF800000000007FF8000000000 07FF80000000000FFFC0000000000E7FC0000000001E7FE0000000001C3FE0000000001C 3FE000000000383FF000000000381FF000000000781FF800000000700FF800000000700F F800000000E00FFC00000000E007FC00000001E007FE00000001C003FE00000001C003FE 000000038003FF000000038001FF000000078001FF800000070000FF800000070000FF80 00000FFFFFFFC000000FFFFFFFC000001FFFFFFFE000001C00003FE000003C00003FF000 003800001FF000003800001FF000007000001FF800007000000FF80000F000000FFC0000 E0000007FC0000E0000007FC0001C0000007FE0003E0000003FE00FFFF8001FFFFFCFFFF 8001FFFFFCFFFF8001FFFFFC36317DB03D>65 DI<000003FF80018000003FFFF003800001FFFFFC07800007FF003F 0F80001FF800079F80003FC00001FF8000FF800000FF8001FE0000007F8003FC0000003F 8007FC0000001F8007F80000000F800FF00000000F801FF000000007801FF00000000780 3FE000000007803FE000000003807FE000000003807FE000000003807FC000000000007F C00000000000FFC00000000000FFC00000000000FFC00000000000FFC00000000000FFC0 0000000000FFC00000000000FFC00000000000FFC00000000000FFC000000000007FC000 000000007FC000000000007FE000000000007FE000000003803FE000000003803FE00000 0003801FF000000003801FF000000007800FF0000000070007F8000000070007FC000000 0E0003FC0000001E0001FE0000001C0000FF8000007800003FC00000F000001FF80003E0 000007FF003F80000001FFFFFE000000003FFFF80000000003FF80000031317CB03A>I< FFFFFFFFF00000FFFFFFFFFF0000FFFFFFFFFFC00000FF8000FFF00000FF80000FF80000 FF800003FE0000FF800001FF0000FF800000FF8000FF8000007FC000FF8000003FC000FF 8000001FE000FF8000001FF000FF8000000FF000FF8000000FF800FF8000000FF800FF80 000007FC00FF80000007FC00FF80000007FC00FF80000007FC00FF80000007FE00FF8000 0007FE00FF80000007FE00FF80000007FE00FF80000007FE00FF80000007FE00FF800000 07FE00FF80000007FE00FF80000007FE00FF80000007FE00FF80000007FE00FF80000007 FC00FF80000007FC00FF80000007FC00FF80000007FC00FF8000000FF800FF8000000FF8 00FF8000000FF000FF8000001FF000FF8000001FE000FF8000003FE000FF8000007FC000 FF8000007F8000FF800001FF0000FF800003FE0000FF80000FFC0000FF80007FF000FFFF FFFFFFC000FFFFFFFFFF0000FFFFFFFFF0000037317EB03E>III<000003FF00030000007FFFF007000001FFFFFC0F 000007FF007E1F00001FF0000FBF00007FC00003FF0000FF800001FF0001FE0000007F00 03FC0000007F0007FC0000003F000FF80000001F000FF00000001F001FF00000000F001F F00000000F003FE000000007003FE000000007007FE000000007007FE000000007007FC0 0000000000FFC00000000000FFC00000000000FFC00000000000FFC00000000000FFC000 00000000FFC00000000000FFC00000000000FFC00000000000FFC00000000000FFC00000 000000FFC00007FFFFFC7FC00007FFFFFC7FE00007FFFFFC7FE0000001FF003FE0000001 FF003FE0000001FF001FF0000001FF001FF0000001FF000FF0000001FF000FF8000001FF 0007FC000001FF0003FC000001FF0001FE000001FF0000FF800001FF00007FC00003FF00 001FF800077F000007FF003E3F000001FFFFFC1F0000007FFFF00F00000003FF80030036 317CB03F>III75 DIII<00000F FF0000000000FFFFF000000007FC03FE0000001FE0007F8000003F80001FC000007F0000 0FE00001FE000007F80003FC000003FC0007F8000001FE0007F8000001FE000FF0000000 FF001FF0000000FF801FE00000007F803FE00000007FC03FE00000007FC03FE00000007F C07FC00000003FE07FC00000003FE07FC00000003FE0FFC00000003FF0FFC00000003FF0 FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FF C00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF07FC00000003FE07FE0 0000007FE07FE00000007FE07FE00000007FE03FE00000007FC03FE00000007FC01FF000 0000FF801FF0000000FF800FF8000001FF0007F8000001FE0007FC000003FE0003FC0000 03FC0001FE000007F80000FF00000FF000003FC0003FC000001FE0007F80000007FC03FE 00000000FFFFF0000000000FFF00000034317CB03D>II< 00000FFF0000000000FFFFF000000007FC03FE0000001FE0007F8000003FC0003FC00000 7F00000FE00001FE000007F80003FC000003FC0007FC000003FE0007F8000001FE000FF8 000001FF001FF0000000FF801FF0000000FF803FE00000007FC03FE00000007FC03FE000 00007FC07FE00000007FE07FC00000003FE07FC00000003FE0FFC00000003FF0FFC00000 003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC0000000 3FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF07FC00000003F E07FC00000003FE07FE00000007FE07FE00000007FE03FE00000007FC03FE00000007FC0 1FF0000000FF801FF0000000FF800FF001F800FF0007F807FC01FE0007FC0E0603FE0003 FC0C0303FC0001FE180187F80000FF1801CFF000003FD800FFC000001FEC00FF80000007 FE03FE00000000FFFFF0000000000FFF78003000000000780030000000007C0030000000 003E0070000000003F81F0000000003FFFF0000000003FFFE0000000001FFFE000000000 1FFFE0000000001FFFC0000000000FFFC0000000000FFF800000000007FF000000000003 FE000000000000F800343F7CB03D>II<001FF8018000FFFF038003FFFFC78007F0 07EF800F8000FF801F00007F803E00001F803E00000F807C00000F807C00000780FC0000 0780FC00000780FC00000380FE00000380FE00000380FF00000000FFC00000007FF00000 007FFF8000003FFFF800003FFFFF80001FFFFFF0000FFFFFF80007FFFFFE0003FFFFFF00 00FFFFFF80003FFFFF800001FFFFC000001FFFE0000000FFE00000003FE00000001FF000 00000FF000000007F060000007F0E0000003F0E0000003F0E0000003F0E0000003E0F000 0003E0F0000003E0F8000007C0FC000007C0FF00000F80FFC0001F00FBFC00FE00F1FFFF F800E03FFFF000C003FF800024317CB02D>I<7FFFFFFFFFFF007FFFFFFFFFFF007FFFFF FFFFFF007FC00FF801FF007E000FF8003F007C000FF8001F0078000FF8000F0078000FF8 000F0070000FF8000700F0000FF8000780F0000FF8000780F0000FF8000780E0000FF800 0380E0000FF8000380E0000FF8000380E0000FF8000380E0000FF800038000000FF80000 0000000FF800000000000FF800000000000FF800000000000FF800000000000FF8000000 00000FF800000000000FF800000000000FF800000000000FF800000000000FF800000000 000FF800000000000FF800000000000FF800000000000FF800000000000FF80000000000 0FF800000000000FF800000000000FF800000000000FF800000000000FF800000000000F F800000000000FF800000000000FF800000000000FF800000000000FF800000000000FF8 00000000000FF8000000007FFFFFFF0000007FFFFFFF0000007FFFFFFF000031307DAF38 >III<00FFF00000 03FFFE00000F803F80000FC00FE0001FE007F0001FE007F0001FE003F8000FC003FC0007 8003FC00000003FC00000003FC00000003FC00000003FC000000FFFC00001FFFFC0000FF E3FC0003FC03FC000FF003FC001FC003FC003FC003FC007F8003FC007F8003FC00FF0003 FC00FF0003FC00FF0003FC00FF0007FC00FF0007FC007F800DFC003FC019FE001FE070FF F007FFE07FF000FF803FF024207E9F27>97 D<01F8000000FFF8000000FFF8000000FFF8 0000000FF800000007F800000007F800000007F800000007F800000007F800000007F800 000007F800000007F800000007F800000007F800000007F800000007F800000007F80000 0007F83FE00007F8FFFC0007FBE07F0007FF001F8007FE000FC007FC000FE007F80007F0 07F80007F807F80007F807F80003FC07F80003FC07F80003FC07F80003FE07F80003FE07 F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F80003FC07F8 0003FC07F80003FC07F80007F807F80007F807F80007F007FC000FE007FE000FC007E700 3F8007C3C0FE000780FFF80007003FC00027327EB12D>I<000FFF00007FFFC001FC01F0 03F003F007E007F80FE007F81FC007F83FC003F03FC001E07F8000007F8000007F800000 FF800000FF800000FF800000FF800000FF800000FF800000FF800000FF8000007F800000 7F8000007F8000003FC0001C3FC0001C1FC000380FE0003807E0007003F001E001FC07C0 007FFF00000FF8001E207D9F24>I<0000000FC0000007FFC0000007FFC0000007FFC000 00007FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC00000 003FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC00007F8 3FC0003FFF3FC000FE07BFC003F801FFC007E0007FC00FE0007FC01FC0003FC03FC0003F C03FC0003FC07F80003FC07F80003FC07F80003FC0FF80003FC0FF80003FC0FF80003FC0 FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC07F80003FC07F80003FC07F 80003FC03FC0003FC03FC0003FC01FC0003FC00FE0007FC007E000FFC003F003FFE001FC 0F3FFE007FFE3FFE000FF03FFE27327DB12D>I<000FFC00007FFF8001FC0FC003F003E0 07E001F00FE001F81FC000FC3FC000FE3FC000FE7F80007E7F80007F7F80007FFF80007F FF80007FFFFFFFFFFFFFFFFFFF800000FF800000FF800000FF8000007F8000007F800000 7F8000003FC000071FC000071FC0000E0FE0000E07F0001C03F8007800FE03E0003FFFC0 0007FE0020207E9F25>I<0001FE00000FFF80001FC3C0007F07E000FE0FF001FE0FF001 FC0FF003FC0FF003FC07E003FC018003FC000003FC000003FC000003FC000003FC000003 FC000003FC000003FC0000FFFFFC00FFFFFC00FFFFFC0003FC000003FC000003FC000003 FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003 FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003 FC000003FC000003FC000003FC000003FC00007FFFF0007FFFF0007FFFF0001C327EB119 >I<001FF007C000FFFE3FE001F83F79F007E00FC3F00FE00FE1F00FC007E0E01FC007F0 001FC007F0003FC007F8003FC007F8003FC007F8003FC007F8003FC007F8001FC007F000 1FC007F0000FC007E0000FE00FE00007E00FC00003F83F000006FFFE00000E1FF000000E 000000001E000000001E000000001F000000001F800000001FFFFF80000FFFFFF0000FFF FFFC0007FFFFFE0003FFFFFF0003FFFFFF800FFFFFFFC01F00007FC07E00001FE07C0000 0FE0FC000007E0FC000007E0FC000007E0FC000007E07E00000FC03E00000F803F00001F 800FC0007E0007F803FC0001FFFFF000001FFF0000242F7E9F28>I<01F8000000FFF800 0000FFF8000000FFF80000000FF800000007F800000007F800000007F800000007F80000 0007F800000007F800000007F800000007F800000007F800000007F800000007F8000000 07F800000007F800000007F807F80007F83FFE0007F8783F0007F8C03F8007F9801FC007 FB001FC007FE001FE007FC001FE007FC001FE007FC001FE007F8001FE007F8001FE007F8 001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F800 1FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001F E007F8001FE007F8001FE0FFFFC3FFFFFFFFC3FFFFFFFFC3FFFF28327DB12D>I<03C000 07E0000FF0001FF8001FF8001FF8001FF8000FF00007E00003C000000000000000000000 00000000000000000000000000000000000001F800FFF800FFF800FFF8000FF80007F800 07F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800 07F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F800FFFF80 FFFF80FFFF8011337DB217>I<01F8000000FFF8000000FFF8000000FFF80000000FF800 000007F800000007F800000007F800000007F800000007F800000007F800000007F80000 0007F800000007F800000007F800000007F800000007F800000007F800000007F801FFF8 07F801FFF807F801FFF807F8003F0007F8003C0007F800780007F800F00007F803C00007 F807800007F80F000007F81E000007F878000007F8FC000007F9FE000007FBFE000007FF FF000007FE7F800007FC7FC00007F83FC00007F01FE00007F00FF00007F00FF80007F007 FC0007F003FC0007F001FE0007F000FF0007F000FF8007F0007F8007F0007FC0FFFF81FF FEFFFF81FFFEFFFF81FFFE27327EB12B>107 D<01F800FFF800FFF800FFF8000FF80007 F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007 F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007 F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007 F80007F80007F80007F80007F80007F800FFFFC0FFFFC0FFFFC012327DB117>I<03F007 F8001FE000FFF03FFE00FFF800FFF0783F01E0FC00FFF0C03F8300FE000FF1801FC6007F 0007F3001FCC007F0007F6001FF8007F8007FC001FF0007F8007FC001FF0007F8007FC00 1FF0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F 8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F800 1FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F 8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F800 1FE0007F8007F8001FE0007F80FFFFC3FFFF0FFFFCFFFFC3FFFF0FFFFCFFFFC3FFFF0FFF FC3E207D9F45>I<03F007F800FFF03FFE00FFF0783F00FFF0C03F800FF1801FC007F300 1FC007F6001FE007FC001FE007FC001FE007FC001FE007F8001FE007F8001FE007F8001F E007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE0 07F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007 F8001FE007F8001FE0FFFFC3FFFFFFFFC3FFFFFFFFC3FFFF28207D9F2D>I<0007FC0000 007FFFC00001FC07F00003F001F80007E000FC000FC0007E001FC0007F003FC0007F803F 80003F807F80003FC07F80003FC07F80003FC0FF80003FE0FF80003FE0FF80003FE0FF80 003FE0FF80003FE0FF80003FE0FF80003FE0FF80003FE07F80003FC07F80003FC07F8000 3FC03FC0007F803FC0007F801FC0007F000FE000FE0007E000FC0003F803F80001FE0FF0 00007FFFC0000007FC000023207E9F28>I<01F83FE000FFF8FFFC00FFFBE07F00FFFF00 3F8007FE001FC007FC000FE007F8000FF007F80007F807F80007F807F80007FC07F80003 FC07F80003FC07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE 07F80003FE07F80003FE07F80003FC07F80007FC07F80007FC07F80007F807F80007F807 F8000FF007FC000FE007FE001FC007FF003F8007FBC0FE0007F8FFF80007F83FC00007F8 00000007F800000007F800000007F800000007F800000007F800000007F800000007F800 000007F800000007F800000007F8000000FFFFC00000FFFFC00000FFFFC00000272E7E9F 2D>I<0007F801C0003FFE03C000FE0707C003F8018FC007F000CFC00FE000FFC01FE000 7FC03FC0007FC03FC0003FC07FC0003FC07FC0003FC07F80003FC0FF80003FC0FF80003F C0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC07F80003FC0 7F80003FC07FC0003FC03FC0003FC03FC0003FC01FE0007FC00FE0007FC007F000FFC003 F803BFC001FC0F3FC0007FFE3FC0000FF03FC00000003FC00000003FC00000003FC00000 003FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC0000000 3FC0000007FFFE000007FFFE000007FFFE272E7D9F2B>I<03F03F00FFF07FC0FFF1C3E0 FFF187E00FF30FF007F60FF007F60FF007FC07E007FC03C007FC000007FC000007F80000 07F8000007F8000007F8000007F8000007F8000007F8000007F8000007F8000007F80000 07F8000007F8000007F8000007F8000007F8000007F8000007F8000007F80000FFFFE000 FFFFE000FFFFE0001C207E9F21>I<01FF860007FFFE001F00FE003C003E0078001E0078 000E00F8000E00F8000E00F8000E00FC000000FF800000FFFC00007FFFC0007FFFF0003F FFF8001FFFFC0007FFFE0001FFFF00003FFF000000FF8000003F8060001F80E0000F80E0 000F80F0000F80F0000F00F8000F00FC001E00FE001C00FF807800F3FFF000C07F800019 207D9F20>I<001C0000001C0000001C0000001C0000001C0000003C0000003C0000003C 0000007C0000007C000000FC000001FC000003FC000007FC00001FFFFE00FFFFFE00FFFF FE0003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC 000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC038003FC 038003FC038003FC038003FC038003FC038003FC038001FC038001FC070000FE0700007F 0E00003FFC000007F000192E7FAD1F>I<01F80007E0FFF803FFE0FFF803FFE0FFF803FF E00FF8003FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE0 07F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007 F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8003FE007F8 003FE003F8007FE003F8007FE001FC00DFF000FE039FFF007FFF1FFF000FFC1FFF28207D 9F2D>III<7FFF807FFC7FFF807FFC7FFF807FFC03FE000F0001FE001E0000FF003C00 00FF807800007FC07800003FE0F000001FE1E000000FF3C000000FFF80000007FF000000 03FE00000001FE00000000FF00000000FF80000000FFC0000001FFC0000003DFE0000007 8FF00000078FF800000F07FC00001E03FC00003C01FE00007800FF0000F000FF8000E000 7FC001E0003FC0FFFC01FFFFFFFC01FFFFFFFC01FFFF28207F9F2B>II<3FFFFFF83FFFFFF83F800FF03E001FE03C003FE03800 3FC078007F807800FF807001FF007001FE007003FE007007FC000007F800000FF800001F F000001FE000003FC000007FC00000FF801C00FF001C01FF001C03FE001C03FC001C07FC 003C0FF8003C0FF000381FE000783FE000F83FC001F87F8007F8FFFFFFF8FFFFFFF81E20 7E9F24>I E /Ft 10 113 df0 D<70F8F8F87005057C8D0D>I<400004C0000C6000183000301800600C00C00601800303 0001860000CC0000780000300000300000780000CC000186000303000601800C00C01800 60300030600018C0000C40000416187A9623>I<0001FE00000007FF8000001E01E00000 7800780000E0001C000180000600030000030006000001800C000000C00C000000C01800 000060300000003030000000303000000030600000001860000000186000000018C00000 000CC00000000CC00000000CC00000000CC00000000CC00000000CC00000000CC0000000 0CC00000000C600000001860000000186000000018300000003030000000303000000030 18000000600C000000C00C000000C006000001800300000300018000060000E0001C0000 78007800001E01E0000007FF80000001FE0000262B7DA02D>13 D<03C00FF01FF83FFC7F FE7FFEFFFFFFFFFFFFFFFFFFFFFFFF7FFE7FFE3FFC1FF80FF003C010127D9317>15 D<000000C0000003C000000F0000003C000000F0000003C00000070000001C0000007800 0001E00000078000001E00000078000000E0000000780000001E0000000780000001E000 0000780000001C0000000700000003C0000000F00000003C0000000F00000003C0000000 C0000000000000000000000000000000000000000000000000000000007FFFFF80FFFFFF C01A247C9C23>20 D<003FF800FFF803C0000700000C0000180000300000300000600000 600000C00000C00000C00000FFFFF8FFFFF8C00000C00000C00000600000600000300000 3000001800000C000007000003C00000FFF8003FF8151C7C981E>50 D<00001E000F00FF0011810F0020C60F8060E40780407807C0407003E0407801E0207801 F0307800F0187800F80C780078047C003C067C0038027C0060027C0180027FFE00427C3C 00467C3C00447C3C00447C3C0038783C0000783C0000783C0000783C0000783C0000783C 0040781E00E0703C0020703C0020601E0810E01E3008C00FC0078003001E227EA021>60 D<4020C030C030C030C030C030C030C030C030C030C030C030C030C030C030C030C030C0 30C030C030C030C030C030C030C030C030C030C030C030C030C030C030C030C030C030C0 30C030C030C030C030C030C030C030C030C03040200C2E7BA117>107 D<00000000080000000018000000003000000000300000000060000000006000000000C0 00000000C000000001800000000180000000030000000003000000000600000000060000 00000C000000000C00000000180000000018000000003000000000300000000060000000 006000000000C000060000C0001E000180002F000180004F000300008780030000078006 000003C006000003C00C000003C00C000001E018000001E018000000F030000000F03000 0000786000000078600000003CC00000003CC00000001F800000001F800000000F000000 000F00000000060000000006000000252E7E8126>112 D E /Fu 79 123 df<0001FF01FE00001FFFCFFF00007F01FF0F8000FC03FE1FC001F807FC1FC003 F807FC1FC007F007F81FC007F007F80F8007F003F8000007F003F8000007F003F8000007 F003F8000007F003F8000007F003F8000007F003F80000FFFFFFFFF000FFFFFFFFF000FF FFFFFFF00007F003F8000007F003F8000007F003F8000007F003F8000007F003F8000007 F003F8000007F003F8000007F003F8000007F003F8000007F003F8000007F003F8000007 F003F8000007F003F8000007F003F8000007F003F8000007F003F8000007F003F8000007 F003F8000007F003F8000007F003F8000007F003F800007FFF3FFFC0007FFF3FFFC0007F FF3FFFC0002A2A7FA927>11 D<0001FF0000001FFFC000007F81E00000FC01E00001F807 F00003F807F00007F007F00007F007F00007F007F00007F007F00007F001C00007F00000 0007F000000007F000000007F03FF800FFFFFFF800FFFFFFF800FFFFFFF80007F003F800 07F003F80007F003F80007F003F80007F003F80007F003F80007F003F80007F003F80007 F003F80007F003F80007F003F80007F003F80007F003F80007F003F80007F003F80007F0 03F80007F003F80007F003F80007F003F80007F003F80007F003F8007FFF3FFF807FFF3F FF807FFF3FFF80212A7FA925>I<3E007F00FF80FF80FF80FF80FF80FF807F007F007F00 7F007F007F007F007F003E003E003E003E003E003E003E003E001C001C001C001C000000 00000000000000001C003E007F00FF80FF80FF807F003E001C00092A7BA914>33 D<000003000600000007800F00000007800F0000000F801F0000000F001E0000000F001E 0000000F001E0000001F003E0000001E003C0000001E003C0000003E007C0000003C0078 0000003C00780000003C00780000007C00F80000007800F00000007800F00000007800F0 007FFFFFFFFFFCFFFFFFFFFFFEFFFFFFFFFFFE7FFFFFFFFFFC0001E003C0000003E007C0 000003C00780000003C00780000003C00780000003C00780000003C00780000003C00780 000007C00F80000007800F00007FFFFFFFFFFCFFFFFFFFFFFEFFFFFFFFFFFE7FFFFFFFFF FC001E003C0000001E003C0000001E003C0000003E007C0000003C00780000003C007800 00003C00780000007C00F80000007800F00000007800F0000000F801F0000000F001E000 0000F001E0000000F001E0000001F003E0000001E003C0000001E003C0000000C0018000 002F367CA938>35 D<01F00000018007FC000003C00F0E000007C01E0780000F803E03E0 003F007C03FC00FF007C039FFFFE007C01C3FF7C00FC01C0007800FC01C000F800FC01C0 01F000FC01C003E000FC01C003C000FC01C007C000FC01C00F8000FC01C01F00007C01C0 1E00007C03803E00007C03807C00003E0300F800001E0700F000000F0E01F0000007FC03 E0000001F007C00000000007800F8000000F803FE000001F00787000003E00F03800003C 01F01800007C03E01C0000F803E01C0001F003E00E0001E007E00E0003E007E00E0007C0 07E00E000F8007E00E000F0007E00E001F0007E00E003E0007E00E007C0007E00E007800 03E00E00F80003E01C01F00003E01C03E00001F01803C00000F03807C000007870078000 003FE0030000000F802F307CAC38>37 D<0001F0000000000FF8000000001F1C00000000 3C0E000000007C0600000000FC0700000000F80700000001F80700000001F80700000001 F80700000001F80E00000001FC0C00000001FC1C00000001FC3800000001FC3000000001 FC6000FFF800FEC000FFF800FF8000FFF800FF00000E00007F00000E00007F00001C0000 7F80003800007F8000380000FFC0007000019FC000E000031FE000E000070FF001C0000F 0FF80380001E07F80380003E03FC0700007E01FE0E0000FE01FF1C0000FE00FFB80000FE 007FF00000FE003FF00000FF001FF000707F0007F800703F801FFC00E01FC07FFF03E00F FFF87FFFC007FFE01FFF8000FF0003FC002D2A7DA934>I<3C007F00FF80FF80FFC0FFC0 FFC07FC03EC000C000C00180018001800300030006000E001C00380030000A157BA913> I<001C0000003E0000003E0000003E0000003E0000201C0200781C0F00FC1C1F80FE1C3F 80FF1C7F803FDDFE0007EBF00000FF8000001C000000FF800007EBF0003FDDFE00FF1C7F 80FE1C3F80FC1C1F80781C0F00201C0200003E0000003E0000003E0000003E0000001C00 00191B7CAC22>42 D<3C007F00FF80FF80FFC0FFC0FFC07FC03EC000C000C00180018001 800300030006000E001C00380030000A157B8813>44 DI<1C007F007F00FF80FF80FF807F007F001C0009097B8813>I<000003000000 07800000078000000F8000000F0000000F0000001F0000001E0000003E0000003C000000 3C0000007C0000007800000078000000F8000000F0000001F0000001E0000001E0000003 E0000003C0000003C0000007C00000078000000F8000000F0000000F0000001F0000001E 0000003E0000003C0000003C0000007C0000007800000078000000F8000000F0000001F0 000001E0000001E0000003E0000003C0000003C0000007C00000078000000F8000000F00 00000F0000001F0000001E0000001E0000003E0000003C0000007C000000780000007800 0000F8000000F0000000F000000060000000193C7CAC22>I<003F800001FFF00007E0FC 000FC07E001F803F001F001F003F001F803E000F807E000FC07E000FC07E000FC07E000F C0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000F E0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE07E000FC07E000FC07E000F C07E000FC03F001F803F001F801F001F001F803F000FC07E0007E0FC0001FFF000003F80 001B277DA622>I<000E00001E00007E0007FE00FFFE00FFFE00F8FE0000FE0000FE0000 FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000 FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000 FE0000FE0000FE007FFFFE7FFFFE7FFFFE17277BA622>I<00FF800007FFF0000FFFFC00 1E03FE003800FF807C003F80FE003FC0FF001FC0FF001FE0FF000FE0FF000FE07E000FE0 3C001FE000001FE000001FC000001FC000003F8000003F0000007E000000FC000000F800 0001F0000003E00000078000000F0000001E0000003C00E0007000E000E000E001C001C0 038001C0060001C00FFFFFC01FFFFFC03FFFFFC07FFFFFC0FFFFFF80FFFFFF80FFFFFF80 1B277DA622>I<007F800003FFF00007FFFC000F80FE001F007F003F807F003F803F803F 803F803F803F801F803F801F003F8000007F0000007F0000007E000000FC000001F80000 07F00000FFC00000FFC0000001F80000007E0000003F0000003F8000001FC000001FC000 001FE000001FE03C001FE07E001FE0FF001FE0FF001FE0FF001FC0FF003FC0FE003F807C 007F003F00FE001FFFFC0007FFF00000FF80001B277DA622>I<00000E0000001E000000 3E0000007E000000FE000000FE000001FE000003FE0000077E00000E7E00000E7E00001C 7E0000387E0000707E0000E07E0000E07E0001C07E0003807E0007007E000E007E000E00 7E001C007E0038007E0070007E00E0007E00FFFFFFF8FFFFFFF8FFFFFFF80000FE000000 FE000000FE000000FE000000FE000000FE000000FE000000FE00007FFFF8007FFFF8007F FFF81D277EA622>I<180003001F801F001FFFFE001FFFFC001FFFF8001FFFF0001FFFC0 001FFF00001C0000001C0000001C0000001C0000001C0000001C0000001C0000001C7FC0 001DFFF8001F80FC001E003F0008003F0000001F8000001FC000001FC000001FE000001F E018001FE07C001FE0FE001FE0FE001FE0FE001FE0FE001FC0FC001FC078003F8078003F 803C007F001F01FE000FFFFC0003FFF00000FF80001B277DA622>I<0007F800003FFE00 00FFFF0001FC078003F00FC007C01FC00F801FC01F801FC01F001FC03F000F803F000000 7E0000007E0000007E000000FE020000FE1FF000FE3FFC00FE603E00FE801F00FF801F80 FF000FC0FF000FC0FE000FE0FE000FE0FE000FE0FE000FE07E000FE07E000FE07E000FE0 7E000FE03E000FE03F000FC01F000FC01F001F800F801F0007E07E0003FFFC0001FFF800 003FC0001B277DA622>I<380000003E0000003FFFFFF03FFFFFF03FFFFFF07FFFFFE07F FFFFC07FFFFF807FFFFF0070000E0070000E0070001C00E0003800E0007000E000E00000 01E0000001C000000380000007800000070000000F0000001F0000001E0000003E000000 3E0000007E0000007C0000007C000000FC000000FC000000FC000000FC000001FC000001 FC000001FC000001FC000001FC000001FC000001FC000000F80000007000001C297CA822 >I<003FC00001FFF00003FFFC0007C07E000F003F001E001F001E000F803E000F803E00 0F803F000F803F800F803FC00F803FF01F001FFC1E001FFE3C000FFFF8000FFFE00007FF F80001FFFC0001FFFE0007FFFF000F0FFF801E03FFC03E01FFC07C007FE07C001FE0F800 0FE0F80007E0F80003E0F80003E0F80003E0F80003C07C0003C07E0007803F000F001FC0 3F000FFFFC0003FFF800007FC0001B277DA622>I<007F800001FFF00007FFF8000FC0FC 001F803E003F001F007E001F807E001F807E000F80FE000FC0FE000FC0FE000FC0FE000F E0FE000FE0FE000FE0FE000FE0FE000FE07E001FE07E001FE03F003FE01F002FE00F80CF E007FF8FE001FF0FE000080FE000000FC000000FC000000FC000001F803E001F807F001F 807F003F007F003E007F007E007E00FC003E03F8001FFFE0000FFF800001FE00001B277D A622>I<1C007F007F00FF80FF80FF807F007F001C000000000000000000000000000000 000000001C007F007F00FF80FF80FF807F007F001C00091B7B9A13>I<1C007F007F00FF 80FF80FF807F007F001C000000000000000000000000000000000000003C007E00FF00FF 00FF80FF80FF807F803F8001800180018003000300070006000E000C0018003000200009 277B9A13>I<7FFFFFFFFFC0FFFFFFFFFFE0FFFFFFFFFFE07FFFFFFFFFC0000000000000 000000000000000000000000000000000000000000000000000000000000000000000000 0000000000000000000000000000000000007FFFFFFFFFC0FFFFFFFFFFE0FFFFFFFFFFE0 7FFFFFFFFFC02B127C9734>61 D<01FF000FFFE01E03F03801F87800FCFC00FEFE00FEFE 00FEFE00FE7C00FE3800FC0001FC0003F80007E0000FC0000F80001E00001E00003C0000 380000380000700000700000700000700000700000700000700000000000000000000000 000000000000700000F80001FC0003FE0003FE0003FE0001FC0000F800007000172A7CA9 20>63 D<00000780000000000780000000000FC0000000000FC0000000000FC000000000 1FE0000000001FE0000000003FF0000000003FF0000000003FF00000000077F800000000 77F800000000F7FC00000000E3FC00000000E3FC00000001C1FE00000001C1FE00000003 C1FF0000000380FF0000000380FF00000007007F80000007007F8000000F007FC000000E 003FC000000E003FC000001C001FE000001C001FE000003FFFFFF000003FFFFFF000003F FFFFF00000700007F80000700007F80000F00007FC0000E00003FC0000E00003FC0001C0 0001FE0001C00001FE0003C00001FF00FFFE003FFFFCFFFE003FFFFCFFFE003FFFFC2E29 7EA833>65 DI<00007FE0030007FFFC07001FFFFF0F007FF00F9F00FF0001FF01FC0000FF03F80000 7F07F000003F0FE000001F1FC000001F1FC000000F3F8000000F3F800000077F80000007 7F800000077F00000000FF00000000FF00000000FF00000000FF00000000FF00000000FF 00000000FF00000000FF00000000FF000000007F000000007F800000007F800000073F80 0000073F800000071FC00000071FC000000E0FE000000E07F000001C03F800003C01FC00 007800FF0001F0007FF007C0001FFFFF800007FFFE0000007FF00028297CA831>IIII<00007FE003000007FF FC0700001FFFFF0F00007FF00F9F0000FF0001FF0001FC0000FF0003F800007F0007F000 003F000FE000001F001FC000001F001FC000000F003F8000000F003F80000007007F8000 0007007F80000007007F0000000000FF0000000000FF0000000000FF0000000000FF0000 000000FF0000000000FF0000000000FF0000000000FF0000000000FF0000FFFFF87F0000 FFFFF87F8000FFFFF87F800000FF003F800000FF003F800000FF001FC00000FF001FC000 00FF000FE00000FF0007F00000FF0003F80000FF0001FC0000FF0000FF0001FF00007FF0 07FF00001FFFFF9F000007FFFE0F0000007FF003002D297CA835>III<00FFFFF800FFFFF800FFFFF80000FF000000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF001800FF007E00FF00FF 00FF00FF00FF00FF00FF00FF00FE007E01FC007C01F8003E07F0000FFFE00003FF00001D 297EA823>IIIII<0000FFC00000000FFFFC0000003F807F000000FE00 1FC00001F80007E00003F00003F00007E00001F8000FE00001FC001FC00000FE001FC000 00FE003F8000007F003F8000007F007F8000007F807F0000003F807F0000003F807F0000 003F80FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000 003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC07F0000003F807F8000 007F807F8000007F803F8000007F003F8000007F001FC00000FE001FC00000FE000FE000 01FC0007F00003F80003F80007F00001FC000FE00000FE001FC000003FC0FF0000000FFF FC00000000FFC000002A297CA833>II<0000FFC00000000FFFFC0000003FC0FF000000FE001FC000 01FC000FE00003F00003F00007F00003F8000FE00001FC001FC00000FE001FC00000FE00 3F8000007F003F8000007F007F8000007F807F8000007F807F0000003F807F0000003F80 FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0 FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC07F0000003F807F8000007F80 7F8000007F803F8000007F003F8000007F001FC00000FE001FC03E00FE000FE07F81FC00 07E0C1C1F80003F18063F00001F98067E00000FF803FC000003FC07F0000000FFFFC0000 0000FFF800C00000003C00C00000001E00C00000001E01C00000001F83C00000001FFFC0 0000000FFF800000000FFF800000000FFF0000000007FF0000000003FE0000000001FC00 00000000F8002A357CA833>II<00FF00C003FFE1C00FFFF9C01F80FFC03F003FC03E00 0FC07C0007C07C0007C0FC0003C0FC0003C0FC0001C0FE0001C0FE0001C0FF000000FFC0 00007FFC00007FFFE0003FFFF8001FFFFE001FFFFF0007FFFF8003FFFFC000FFFFC0000F FFE000007FE000001FF000000FF0000007F0E00003F0E00003F0E00003F0E00003F0F000 03E0F00003E0F80007E0FC0007C0FF000F80FFE01F80E3FFFF00E1FFFC00C01FF0001C29 7CA825>I<7FFFFFFFFF807FFFFFFFFF807FFFFFFFFF807F807F807F807C007F800F8078 007F80078078007F80078070007F800380F0007F8003C0F0007F8003C0E0007F8001C0E0 007F8001C0E0007F8001C0E0007F8001C0E0007F8001C000007F80000000007F80000000 007F80000000007F80000000007F80000000007F80000000007F80000000007F80000000 007F80000000007F80000000007F80000000007F80000000007F80000000007F80000000 007F80000000007F80000000007F80000000007F80000000007F80000000007F80000000 007F80000000007F80000000FFFFFFC00000FFFFFFC00000FFFFFFC0002A287EA72F>I< FFFFF000FFFEFFFFF000FFFEFFFFF000FFFE03FC0000038003FC0000038003FC00000380 03FC0000038003FC0000038003FC0000038003FC0000038003FC0000038003FC00000380 03FC0000038003FC0000038003FC0000038003FC0000038003FC0000038003FC00000380 03FC0000038003FC0000038003FC0000038003FC0000038003FC0000038003FC00000380 03FC0000038003FC0000038003FC0000038003FC0000038003FC0000038003FC00000380 03FC0000038001FC0000070001FE0000070000FE00000E00007F00000E00003F00003C00 001FC0007800000FF003F0000007FFFFE0000000FFFF800000001FFC00002F297EA834> III<7FFFF81FFFE07FFFF81FFFE07FFFF81FFFE0 01FF0000F00000FF8001E00000FFC001C000007FC003C000003FE0078000001FF00F0000 001FF00E0000000FF81E00000007FC3C00000007FC3800000003FE7800000001FFF00000 0001FFE000000000FFC0000000007FC0000000003FE0000000003FE0000000001FF00000 00001FF8000000003FF8000000003FFC000000007BFE00000000F3FE00000001E1FF0000 0001C0FF80000003C07FC0000007807FC000000F003FE000000E001FF000001E001FF000 003C000FF80000380007FC0000780007FC0000F00003FE0001E00001FF00FFFF003FFFFC FFFF003FFFFCFFFF003FFFFC2E297EA833>II<3FFFFFFF003FFFFFFF003FFFFFFF003F F001FE003F8003FC003F0007FC003E0007F8003C000FF00078001FF00078001FE0007800 3FE00070003FC00070007F80007000FF80007000FF00000001FE00000003FE00000003FC 00000007F80000000FF80000000FF00000001FF00000001FE00000003FC00000007FC003 80007F80038000FF00038001FF00038001FE00038003FC00078007FC00078007F8000780 0FF8000F000FF0000F001FE0001F003FE0003F003FC000FF007F8003FF00FFFFFFFF00FF FFFFFF00FFFFFFFF0021297CA829>II93 D<03FF80000FFFF0001F01FC003F80FE003F 807F003F803F003F803F801F003F8000003F8000003F8000003F8000003F80003FFF8001 FC3F800FE03F801F803F803F003F807E003F80FC003F80FC003F80FC003F80FC003F80FC 005F807E00DF803F839FFC1FFE0FFC03F803FC1E1B7E9A21>97 DI<003FF00001FFFC0003F03E000FC0 7F001F807F003F007F003F007F007F003E007E0000007E000000FE000000FE000000FE00 0000FE000000FE000000FE000000FE0000007E0000007E0000007F0000003F0003803F80 03801F8007000FE00E0003F83C0001FFF800003FC000191B7E9A1E>I<00007FF000007F F000007FF0000007F0000007F0000007F0000007F0000007F0000007F0000007F0000007 F0000007F0000007F0000007F0000007F0003F87F001FFF7F007F03FF00FC00FF01F8007 F03F0007F03F0007F07E0007F07E0007F07E0007F0FE0007F0FE0007F0FE0007F0FE0007 F0FE0007F0FE0007F0FE0007F0FE0007F07E0007F07E0007F03F0007F03F0007F01F800F F00FC01FF007E07FFF01FFE7FF007F87FF202A7EA925>I<003FC00001FFF00003E07C00 0F803E001F801F001F001F003F000F807E000F807E000FC07E000FC0FE0007C0FE0007C0 FFFFFFC0FFFFFFC0FE000000FE000000FE0000007E0000007E0000007F0000003F0001C0 1F0001C00F80038007C0070003F01E0000FFFC00003FE0001A1B7E9A1F>I<0007F8003F FC007E3E01FC7F03F87F03F07F07F07F07F03E07F00007F00007F00007F00007F00007F0 0007F000FFFFC0FFFFC0FFFFC007F00007F00007F00007F00007F00007F00007F00007F0 0007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F0 0007F0007FFF807FFF807FFF80182A7EA915>I<007F80F001FFE3F807C0FE1C0F807C7C 1F003E7C1F003E103F003F003F003F003F003F003F003F003F003F003F003F001F003E00 1F003E000F807C0007C0F80005FFE0000C7F8000180000001C0000001C0000001E000000 1FFFF8001FFFFF000FFFFFC007FFFFE003FFFFF00FFFFFF03E0007F07C0001F8F80000F8 F80000F8F80000F8F80000F87C0001F07C0001F03F0007E00FC01F8007FFFF00007FF000 1E287E9A22>II<07000FC01FE03FE03FE03FE01FE00FC007000000000000000000000000000000FFE0 FFE0FFE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE0 0FE00FE00FE00FE00FE0FFFEFFFEFFFE0F2B7EAA12>I107 DIII<003FE00001FFFC0003F0 7E000FC01F801F800FC03F0007E03F0007E07E0003F07E0003F07E0003F0FE0003F8FE00 03F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F87E0003F07E0003F03F00 07E03F0007E01F800FC00FC01F8007F07F0001FFFC00003FE0001D1B7E9A22>II<003F807001FFE0F003F071F00FC019F01F800FF0 3F800FF03F0007F07F0007F07F0007F07E0007F0FE0007F0FE0007F0FE0007F0FE0007F0 FE0007F0FE0007F0FE0007F0FE0007F07F0007F07F0007F03F0007F03F8007F01F800FF0 0FC01FF007F077F001FFE7F0007F87F0000007F0000007F0000007F0000007F0000007F0 000007F0000007F0000007F0000007F000007FFF00007FFF00007FFF20277E9A23>II<03FE300FFFF03E03F07800F07000F0F00070F00070 F80070FE0000FFE0007FFF007FFFC03FFFE01FFFF007FFF800FFF80007FC0000FCE0007C E0003CF0003CF00038F80038FC0070FF01E0E7FFC0C1FF00161B7E9A1B>I<0070000070 0000700000700000F00000F00000F00001F00003F00003F00007F0001FFFE0FFFFE0FFFF E007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F0 0007F00007F07007F07007F07007F07007F07007F07007F07003F0E001F8C000FFC0003F 0014267FA51A>IIIII I<3FFFFF3FFFFF3F00FE3C01FE3803FC7803F87807F0700FF0700FE0701FC0003FC0003F 80007F0000FF0000FE0001FC0703FC0703F80707F0070FF00F0FE00F1FC00E3FC01E7F80 3E7F00FEFFFFFEFFFFFE181B7E9A1E>I E /Fv 93 125 df0 D6 D<001F83E000F06E3001C078780380F8780300F03007007000070070000700 700007007000070070000700700007007000FFFFFF800700700007007000070070000700 700007007000070070000700700007007000070070000700700007007000070070000700 700007007000070070000700700007007000070070007FE3FF001D20809F1B>11 D<003F0000E0C001C0C00381E00701E00701E00700000700000700000700000700000700 00FFFFE00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700 E00700E00700E00700E00700E00700E00700E00700E07FC3FE1720809F19>I<003FE000 E0E001C1E00381E00700E00700E00700E00700E00700E00700E00700E00700E0FFFFE007 00E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E007 00E00700E00700E00700E00700E00700E07FE7FE1720809F19>I<001F81F80000F04F04 0001C07C06000380F80F000300F00F000700F00F00070070000007007000000700700000 070070000007007000000700700000FFFFFFFF0007007007000700700700070070070007 007007000700700700070070070007007007000700700700070070070007007007000700 700700070070070007007007000700700700070070070007007007000700700700070070 07007FE3FE3FF02420809F26>I<07070F1C383060C00808779F17>19 D<70F8F8F8F8F8F8F8707070707070707070702020202020000000000070F8F8F8700521 7CA00D>33 D<7038F87CFC7EFC7E743A0402040204020804080410081008201040200F0E 7E9F17>I<000300C0000300C0000300C0000300C0000601800006018000060180000601 8000060180000C0300000C0300000C0300000C0300000C0300001806007FFFFFFCFFFFFF FE00300C0000300C0000300C0000300C0000601800006018000060180000601800FFFFFF FE7FFFFFFC00C0300001806000018060000180600001806000018060000300C0000300C0 000300C0000300C0000300C0000601800006018000060180001F297D9F26>I<00800080 07E00C981084208260824081C087C08FC08FC086E080F08078803F803FE01FF807FC00FE 009E008E00870087F083F083F0838083808240864084208818B007C00080008000801025 7DA117>I<70F8FCFC74040404080810102040060E7C9F0D>39 D<002000400080010002 0006000C000C00180018003000300030007000600060006000E000E000E000E000E000E0 00E000E000E000E000E000E0006000600060007000300030003000180018000C000C0006 00020001000080004000200B2E7DA112>I<800040002000100008000C00060006000300 030001800180018001C000C000C000C000E000E000E000E000E000E000E000E000E000E0 00E000E000C000C000C001C001800180018003000300060006000C000800100020004000 80000B2E7DA112>I<01800180018001800180C183F18F399C0FF003C003C00FF0399CF1 8FC1830180018001800180018010147DA117>I<00060000000600000006000000060000 000600000006000000060000000600000006000000060000000600000006000000060000 0006000000060000FFFFFFF0FFFFFFF00006000000060000000600000006000000060000 000600000006000000060000000600000006000000060000000600000006000000060000 000600001C207D9A23>I<70F8FCFC74040404080810102040060E7C840D>II<70F8F8F87005057C840D>I<000100030003000600060006000C000C000C00 180018001800300030003000600060006000C000C000C001800180018003000300030006 00060006000C000C000C00180018001800300030003000600060006000C000C000C00010 2D7DA117>I<03F0000E1C001C0E00180600380700700380700380700380700380F003C0 F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0 7003807003807003807807803807001806001C0E000E1C0003F000121F7E9D17>I<0180 03800F80F380038003800380038003800380038003800380038003800380038003800380 03800380038003800380038003800380038007C0FFFE0F1E7C9D17>I<03F0000C1C0010 0E00200700400780800780F007C0F803C0F803C0F803C02007C00007C000078000078000 0F00000E00001C0000380000700000600000C0000180000300000600400C004018004010 00803FFF807FFF80FFFF80121E7E9D17>I<03F0000C1C00100E00200F00780F80780780 780780380F80000F80000F00000F00000E00001C0000380003F000003C00000E00000F00 0007800007800007C02007C0F807C0F807C0F807C0F00780400780400F00200E001C3C00 03F000121F7E9D17>I<000600000600000E00000E00001E00002E00002E00004E00008E 00008E00010E00020E00020E00040E00080E00080E00100E00200E00200E00400E00C00E 00FFFFF0000E00000E00000E00000E00000E00000E00000E0000FFE0141E7F9D17>I<18 03001FFE001FFC001FF8001FE00010000010000010000010000010000010000011F00016 1C00180E001007001007800003800003800003C00003C00003C07003C0F003C0F003C0E0 0380400380400700200600100E000C380003E000121F7E9D17>I<007C00018200070100 0E03800C07801C0780380300380000780000700000700000F1F000F21C00F40600F80700 F80380F80380F003C0F003C0F003C0F003C0F003C07003C07003C0700380380380380700 1807000C0E00061C0001F000121F7E9D17>I<4000007FFFC07FFF807FFF804001008002 0080020080040000080000080000100000200000200000400000400000C00000C00001C0 000180000380000380000380000380000780000780000780000780000780000780000780 00030000121F7D9D17>I<03F0000C0C0010060030030020018060018060018060018070 01807803003E03003F06001FC8000FF00003F80007FC000C7E00103F00300F8060038040 01C0C001C0C000C0C000C0C000C0C000806001802001001002000C0C0003F000121F7E9D 17>I<03F0000E18001C0C00380600380700700700700380F00380F00380F003C0F003C0 F003C0F003C0F003C07007C07007C03807C0180BC00E13C003E3C0000380000380000380 000700300700780600780E00700C002018001070000FC000121F7E9D17>I<70F8F8F870 0000000000000000000070F8F8F87005147C930D>I<70F8F8F870000000000000000000 0070F0F8F878080808101010202040051D7C930D>I<7FFFFFE0FFFFFFF0000000000000 0000000000000000000000000000000000000000000000000000FFFFFFF07FFFFFE01C0C 7D9023>61 D<0FC0307040384038E03CF03CF03C603C0038007000E000C0018001800100 03000200020002000200020002000000000000000000000007000F800F800F8007000E20 7D9F15>63 D<000100000003800000038000000380000007C0000007C0000007C0000009 E0000009E0000009E0000010F0000010F0000010F0000020780000207800002078000040 3C0000403C0000403C0000801E0000801E0000FFFE0001000F0001000F0001000F000200 07800200078002000780040003C00E0003C01F0007E0FFC03FFE1F207F9F22>65 DI<000FC040007030C001C009C0 038005C0070003C00E0001C01E0000C01C0000C03C0000C07C0000407C00004078000040 F8000000F8000000F8000000F8000000F8000000F8000000F8000000F8000000F8000000 780000007C0000407C0000403C0000401C0000401E0000800E0000800700010003800200 01C0040000703800000FC0001A217D9F21>IIII<000FE0200078186000E004E0038002E0070001E0 0F0000E01E0000601E0000603C0000603C0000207C00002078000020F8000000F8000000 F8000000F8000000F8000000F8000000F8000000F8007FFCF80003E0780001E07C0001E0 3C0001E03C0001E01E0001E01E0001E00F0001E0070001E0038002E000E0046000781820 000FE0001E217D9F24>III<0FFFC0007C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00203C00F83C00F83C 00F83C00F0380040780040700030E0000F800012207E9E17>IIIII<001F800000F0F00001C0380007801E000F000F000E0007001E00 07803C0003C03C0003C07C0003E0780001E0780001E0F80001F0F80001F0F80001F0F800 01F0F80001F0F80001F0F80001F0F80001F0F80001F0780001E07C0003E07C0003E03C00 03C03C0003C01E0007800E0007000F000F0007801E0001C0380000F0F000001F80001C21 7D9F23>II<001F800000F0F000 01C0380007801E000F000F000E0007001E0007803C0003C03C0003C07C0003E07C0003E0 780001E0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0 F80001F0780001E0780001E07C0003E03C0003C03C0F03C01E1087800E2047000F204F00 07A03E0001E0380000F0F010001FB01000003010000038300000387000003FF000001FE0 00001FE000000FC0000007801C297D9F23>II<07E0800C1980100780300380600180600180E00180E00080E000 80E00080F00000F000007800007F00003FF0001FFC000FFE0003FF00001F800007800003 C00003C00001C08001C08001C08001C08001C0C00180C00380E00300F00600CE0C0081F8 0012217D9F19>I<7FFFFFE0780F01E0600F0060400F0020400F0020C00F0030800F0010 800F0010800F0010800F0010000F0000000F0000000F0000000F0000000F0000000F0000 000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000 000F0000000F0000000F0000000F0000001F800007FFFE001C1F7E9E21>IIII<7FF83FF8 0FE00FC007C0070003C0020001E0040001F00C0000F0080000781000007C1000003C2000 003E4000001E4000000F8000000F8000000780000003C0000007E0000005E0000009F000 0018F8000010780000207C0000603C0000401E0000801F0001800F0001000780020007C0 070003C01F8007E0FFE01FFE1F1F7F9E22>II<7FFFF87C00F87000F06001E04001E0C003C0C003C0800780800F80800F00 001E00001E00003C00003C0000780000F80000F00001E00001E00003C00403C004078004 0F80040F000C1E000C1E00083C00183C0018780038F801F8FFFFF8161F7D9E1C>II<080410082010201040204020804080408040B85CFC7E FC7E7C3E381C0F0E7B9F17>II<3078FC78300605 7D9E0D>95 D<081020204040808080B8FCFC7C38060E7D9F0D>I<1FE000303000781800 781C00300E00000E00000E00000E0000FE00078E001E0E00380E00780E00F00E10F00E10 F00E10F01E10781E103867200F83C014147E9317>I<0E0000FE00000E00000E00000E00 000E00000E00000E00000E00000E00000E00000E00000E3E000EC3800F01C00F00E00E00 E00E00700E00700E00780E00780E00780E00780E00780E00780E00700E00700E00E00F00 E00D01C00CC300083E0015207F9F19>I<03F80E0C1C1E381E380C70007000F000F000F0 00F000F000F00070007000380138011C020E0C03F010147E9314>I<000380003F800003 8000038000038000038000038000038000038000038000038000038003E380061B801C07 80380380380380700380700380F00380F00380F00380F00380F00380F003807003807003 803803803807801C07800E1B8003E3F815207E9F19>I<03F0000E1C001C0E0038070038 0700700700700380F00380F00380FFFF80F00000F00000F0000070000070000038008018 00800C010007060001F80011147F9314>I<007C00C6018F038F07060700070007000700 070007000700FFF007000700070007000700070007000700070007000700070007000700 07000700070007007FF01020809F0E>I<0000E003E3300E3C301C1C30380E00780F0078 0F00780F00780F00780F00380E001C1C001E380033E0002000002000003000003000003F FE001FFF800FFFC03001E0600070C00030C00030C00030C000306000603000C01C038003 FC00141F7F9417>I<0E0000FE00000E00000E00000E00000E00000E00000E00000E0000 0E00000E00000E00000E3E000E43000E81800F01C00F01C00E01C00E01C00E01C00E01C0 0E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C0FFE7FC16207F 9F19>I<1C001E003E001E001C000000000000000000000000000E007E000E000E000E00 0E000E000E000E000E000E000E000E000E000E000E000E000E000E00FFC00A1F809E0C> I<00E001F001F001F000E0000000000000000000000000007007F000F000700070007000 700070007000700070007000700070007000700070007000700070007000700070007060 70F060F0C061803F000C28829E0E>I<0E0000FE00000E00000E00000E00000E00000E00 000E00000E00000E00000E00000E00000E0FF00E03C00E03000E02000E04000E08000E10 000E30000E70000EF8000F38000E1C000E1E000E0E000E07000E07800E03800E03C00E03 E0FFCFF815207F9F18>I<0E00FE000E000E000E000E000E000E000E000E000E000E000E 000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E 00FFE00B20809F0C>I<0E1F01F000FE618618000E81C81C000F00F00E000F00F00E000E 00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00 E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E00FFE7FE 7FE023147F9326>I<0E3E00FE43000E81800F01C00F01C00E01C00E01C00E01C00E01C0 0E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C0FFE7FC16147F 9319>I<01F800070E001C03803801C03801C07000E07000E0F000F0F000F0F000F0F000 F0F000F0F000F07000E07000E03801C03801C01C0380070E0001F80014147F9317>I<0E 3E00FEC3800F01C00F00E00E00E00E00F00E00700E00780E00780E00780E00780E00780E 00780E00700E00F00E00E00F01E00F01C00EC3000E3E000E00000E00000E00000E00000E 00000E00000E00000E0000FFE000151D7F9319>I<03E0800619801C05803C0780380380 780380700380F00380F00380F00380F00380F00380F00380700380780380380380380780 1C0B800E138003E380000380000380000380000380000380000380000380000380003FF8 151D7E9318>I<0E78FE8C0F1E0F1E0F0C0E000E000E000E000E000E000E000E000E000E 000E000E000E000E00FFE00F147F9312>I<1F9030704030C010C010C010E00078007F80 3FE00FF00070803880188018C018C018E030D0608F800D147E9312>I<02000200020006 0006000E000E003E00FFF80E000E000E000E000E000E000E000E000E000E000E000E080E 080E080E080E080610031001E00D1C7F9B12>I<0E01C0FE1FC00E01C00E01C00E01C00E 01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E03C006 03C0030DC001F1FC16147F9319>III<7FC3FC0F01E00701C00701 8003810001C20000E40000EC00007800003800003C00007C00004E000087000107000303 800201C00601E01E01E0FF07FE1714809318>II<3FFF380E200E201C40384078407000E001E001C00380078007010E011E01 1C0338027006700EFFFE10147F9314>III E /Fw 6 119 df<0000007FF800000000000FFFFFC0000000007FFFFFF800000001 FFE01FFE00000007FF0003FF8000000FFC0000FFC000001FF000003FE000007FE000001F F80000FFC000000FFC0001FF80000007FE0001FF00000003FE0003FF00000003FF0007FE 00000001FF800FFE00000001FFC00FFC00000000FFC01FFC00000000FFE01FFC00000000 FFE03FF8000000007FF03FF8000000007FF03FF8000000007FF07FF8000000007FF87FF0 000000003FF87FF0000000003FF87FF0000000003FF87FF0000000003FF8FFF000000000 3FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0 000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF000000000 3FFCFFF0000000003FFCFFF0000000003FFC7FF0000000003FF87FF8000000007FF87FF8 000000007FF87FF8000000007FF83FF8000000007FF03FF8000000007FF03FFC00000000 FFF01FFC00000000FFE01FFC00000000FFE00FFE00000001FFC00FFE00000001FFC007FF 00000003FF8003FF00000003FF0003FF80000007FF0001FF80000007FE0000FFC000000F FC00007FE000001FF800003FF800007FF000000FFC0000FFC0000007FF0003FF80000001 FFE01FFE000000007FFFFFF8000000000FFFFFC000000000007FF80000003E3D7BBB49> 79 D<003FFE00000001FFFFE0000007FFFFF800000FE007FC00000FF001FE00001FF800 FF00001FF8007F80001FF8007FC0001FF8003FC0000FF0003FE00007E0003FE00003C000 3FE0000000003FE0000000003FE0000000003FE0000000003FE0000000FFFFE000001FFF FFE000007FF83FE00003FF803FE00007FC003FE0000FF0003FE0001FE0003FE0003FE000 3FE0007FC0003FE0007FC0003FE000FF80003FE000FF80003FE000FF80003FE000FF8000 3FE000FF80007FE0007FC0007FE0007FC000DFE0003FE0039FF0001FF80F0FFFE007FFFE 0FFFE001FFF807FFE0003FE000FFE02B267DA52F>97 D<0001FFF000000FFFFE00003FFF FF8000FF801FC001FE003FC003FC007FE007F8007FE00FF0007FE01FF0007FE03FE0003F C03FE0001F807FE0000F007FC00000007FC00000007FC0000000FFC0000000FFC0000000 FFC0000000FFC0000000FFC0000000FFC0000000FFC0000000FFC00000007FC00000007F C00000007FE00000007FE00000003FE00000003FF00000F01FF00000F00FF80001E007F8 0001E003FC0003C001FF000F8000FFC03F00003FFFFE00000FFFF8000001FFC00024267D A52B>99 D<0001FF8000000FFFF000003FFFFC0000FF81FE0003FE007F8007F8003F800F F8001FC00FF0000FE01FE0000FE03FE0000FF03FE00007F07FC00007F07FC00007F87FC0 0007F8FFC00007F8FFC00007F8FFFFFFFFF8FFFFFFFFF8FFFFFFFFF8FFC0000000FFC000 0000FFC0000000FFC00000007FC00000007FC00000007FC00000003FE00000003FE00000 781FE00000781FF00000780FF00000F007F80001F003FC0003E001FE000FC000FFC07F80 003FFFFE00000FFFF8000000FFC00025267DA52C>101 D<000F0000000F0000000F0000 000F0000000F0000001F0000001F0000001F0000001F0000003F0000003F0000007F0000 007F000000FF000001FF000003FF000007FF00001FFFFFF0FFFFFFF0FFFFFFF0FFFFFFF0 01FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF0000 01FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF0000 01FF000001FF003C01FF003C01FF003C01FF003C01FF003C01FF003C01FF003C01FF003C 00FF007800FF8078007F80F0003FC1E0001FFFC0000FFF800001FE001E377EB626>116 D118 D E end %%EndProlog %%BeginSetup %%Feature: *Resolution 300dpi TeXDict begin %%EndSetup %%Page: 1 1 1 0 bop 0 692 a Fw(Octa)m(v)m(e)p 0 726 1950 17 v 737 774 a Fv(A)15 b(high-lev)o(el)j(in)o(teractiv)o(e)e(language)f(for)g(n) o(umerical)h(computations)1244 828 y(Edition)h(1.1)d(for)g(Octa)o(v)o (e)h(v)o(ersion)h(1.1.0)1684 882 y(Jan)o(uary)f(1995)0 2545 y Fu(John)22 b(W.)h(Eaton)p 0 2570 1950 9 v eop %%Page: 2 2 2 1 bop 0 2089 a Fv(Cop)o(yrigh)o(t)226 2088 y(c)214 2089 y Ft(\015)15 b Fv(1993,)f(1994,)f(1995)i(John)g(W.)g(Eaton.)0 2172 y(This)e(is)g(the)g(\014rst)f(edition)h(of)f(the)h(Octa)o(v)o(e)f (do)q(cumen)o(tation,)h(and)g(is)g(consisten)o(t)f(with)h(v)o(ersion)g (1.1.0)e(of)h(Octa)o(v)o(e.)0 2255 y(P)o(ermission)h(is)g(gran)o(ted)f (to)f(mak)o(e)h(and)h(distribute)h(v)o(erbatim)e(copies)h(of)f(this)h (man)o(ual)g(pro)o(vided)g(the)f(cop)o(yrigh)o(t)0 2317 y(notice)k(and)f(this)h(p)q(ermission)h(notice)e(are)g(preserv)o(ed)h (on)f(all)h(copies.)0 2400 y(P)o(ermission)f(is)f(gran)o(ted)f(to)h (cop)o(y)g(and)g(distribute)h(mo)q(di\014ed)h(v)o(ersions)e(of)f(this)i (man)o(ual)f(under)h(the)f(conditions)0 2462 y(for)e(v)o(erbatim)g(cop) o(ying,)h(pro)o(vided)h(that)d(the)i(en)o(tire)g(resulting)h(deriv)o (ed)f(w)o(ork)f(is)h(distributed)h(under)f(the)g(terms)0 2525 y(of)i(a)g(p)q(ermission)h(notice)g(iden)o(tical)h(to)e(this)g (one.)0 2608 y(P)o(ermission)20 b(is)g(gran)o(ted)f(to)g(cop)o(y)h(and) f(distribute)i(translations)f(of)f(this)h(man)o(ual)f(in)o(to)h (another)f(language,)0 2670 y(under)d(the)f(same)g(conditions)i(as)d (for)h(mo)q(di\014ed)h(v)o(ersions.)p eop %%Page: 1 3 1 2 bop 0 -58 a Fv(Preface)1781 b(1)0 183 y Fs(Preface)62 311 y Fv(Octa)o(v)o(e)11 b(w)o(as)g(originally)i(in)o(tended)g(to)e(b)q (e)h(companion)g(soft)o(w)o(are)e(for)h(an)h(undergraduate-lev)o(el)h (textb)q(o)q(ok)e(on)0 374 y(c)o(hemical)16 b(reactor)d(design)i(b)q (eing)g(written)f(b)o(y)g(James)h(B.)f(Ra)o(wlings)h(and)f(John)h(G.)e (Ek)o(erdt)h(at)f(the)h(Univ)o(ersit)o(y)0 436 y(of)h(T)l(exas.)62 519 y(Clearly)l(,)j(Octa)o(v)o(e)f(is)g(no)o(w)g(m)o(uc)o(h)g(more)g (than)f(just)h(another)g(`coursew)o(are')e(pac)o(k)m(age)i(with)h (limited)h(utiltiy)0 581 y(b)q(ey)o(ond)e(the)f(classro)q(om.)21 b(Although)c(our)f(initial)i(goals)d(w)o(ere)h(somewhat)f(v)m(ague,)h (w)o(e)g(knew)g(that)f(w)o(e)h(w)o(an)o(ted)0 644 y(to)d(create)g (something)g(that)g(w)o(ould)g(enable)i(studen)o(ts)e(to)g(solv)o(e)g (realistic)i(problems,)f(and)f(that)g(they)g(could)i(use)0 706 y(for)g(man)o(y)f(things)i(other)f(than)g(c)o(hemical)h(reactor)f (design)h(problems.)62 789 y(There)d(are)f(those)g(who)f(w)o(ould)i(sa) o(y)f(that)f(w)o(e)h(should)h(b)q(e)g(teac)o(hing)g(the)f(studen)o(ts)g (F)l(ortran)f(instead,)i(b)q(ecause)0 851 y(that)g(is)i(the)f(computer) h(language)f(of)g(engineering,)h(but)g(ev)o(ery)f(time)g(w)o(e)g(ha)o (v)o(e)g(tried)h(that,)e(the)h(studen)o(ts)g(ha)o(v)o(e)0 913 y(sp)q(en)o(t)i(far)f(to)q(o)g(m)o(uc)o(h)h(time)h(trying)e(to)h (\014gure)g(out)f(wh)o(y)h(their)g(F)l(ortran)f(co)q(de)h(crashes)g (and)g(not)f(enough)i(time)0 976 y(learning)g(ab)q(out)g(c)o(hemical)g (engineering.)25 b(With)17 b(Octa)o(v)o(e,)e(most)h(studen)o(ts)g(pic)o (k)h(up)g(the)f(basics)h(quic)o(kly)l(,)h(and)0 1038 y(are)d(using)h(it)f(con\014den)o(tly)i(in)f(just)f(a)f(few)h(hours.)62 1121 y(Although)h(it)f(w)o(as)g(originally)i(in)o(tended)f(to)f(b)q(e)g (used)h(to)f(teac)o(h)g(reactor)f(design,)i(it)f(is)h(also)f(curren)o (tly)g(used)0 1183 y(in)g(sev)o(eral)f(other)g(undergraduate)g(and)g (graduate)g(courses)g(in)h(our)f(departmen)o(t,)f(and)i(the)f(math)f (departmen)o(t)0 1245 y(at)j(the)h(Univ)o(ersit)o(y)g(of)g(T)l(exas)f (has)h(b)q(een)h(using)g(it)f(for)f(teac)o(hing)h(di\013eren)o(tial)h (equations)f(and)g(linear)h(algebra)0 1308 y(as)d(w)o(ell.)23 b(If)16 b(y)o(ou)f(\014nd)h(it)g(useful,)h(please)f(let)h(us)e(kno)o (w.)21 b(W)l(e)16 b(are)f(alw)o(a)o(ys)g(in)o(terested)h(to)f(\014nd)i (out)e(ho)o(w)g(Octa)o(v)o(e)0 1370 y(is)h(b)q(eing)g(used)g(in)g (other)f(places.)62 1453 y(Virtually)j(ev)o(ery)o(one)f(thinks)g(that)f (the)h(name)f(Octa)o(v)o(e)h(has)f(something)h(to)f(do)h(with)g(m)o (usic,)g(but)g(it)g(is)g(ac-)0 1515 y(tually)g(the)f(name)g(of)g(a)g (former)f(professor)h(of)g(mine)h(who)f(wrote)f(a)h(famous)f(textb)q(o) q(ok)h(on)g(c)o(hemical)i(reaction)0 1578 y(engineering,)g(and)e(who)g (w)o(as)f(also)h(w)o(ell)h(kno)o(wn)f(for)g(his)h(abilit)o(y)g(to)f(do) g(quic)o(k)g(`bac)o(k)g(of)g(the)g(en)o(v)o(elop)q(e')h(calcu-)0 1640 y(lations.)29 b(W)l(e)18 b(hop)q(e)g(that)f(this)i(soft)o(w)o(are) d(will)j(mak)o(e)f(it)g(p)q(ossible)i(for)d(man)o(y)h(p)q(eople)h(to)e (do)h(more)g(am)o(bitious)0 1702 y(computations)d(just)g(as)g(easily)l (.)62 1785 y(Ev)o(ery)o(one)f(is)h(encouraged)g(to)e(share)i(this)f (soft)o(w)o(are)f(with)i(others)f(under)h(the)f(terms)g(of)g(the)g(GNU) h(General)0 1847 y(Public)i(License)g(\(see)30 b([Cop)o(ying],)15 b(page)g(8\))f(as)h(describ)q(ed)i(at)e(the)g(b)q(eginning)i(of)e(this) h(man)o(ual.)k(Y)l(ou)15 b(are)g(also)0 1910 y(encouraged)h(to)g(help)h (mak)o(e)f(Octa)o(v)o(e)f(more)h(useful)h(b)o(y)f(writing)g(and)h(con)o (tributing)f(additional)i(functions)f(for)0 1972 y(it,)e(and)g(b)o(y)h (rep)q(orting)f(an)o(y)g(problems)h(y)o(ou)f(ma)o(y)f(ha)o(v)o(e.)62 2055 y(Man)o(y)f(p)q(eople)i(ha)o(v)o(e)e(already)h(con)o(tributed)g (to)e(Octa)o(v)o(e's)h(dev)o(elopmen)o(t.)20 b(In)14 b(addition)h(to)d(John)i(W.)f(Eaton,)0 2117 y(the)i(follo)o(wing)h(p)q (eople)h(ha)o(v)o(e)e(help)q(ed)i(write)e(parts)g(of)f(Octa)o(v)o(e)h (or)g(help)q(ed)i(out)e(in)h(v)m(arious)g(other)e(w)o(a)o(ys.)37 2200 y Ft(\017)30 b Fv(Karl)20 b(Berry)f(\(k)m(arl)p Fr(@)p Fv(cs.um)o(b.edu\))h(wrote)e(the)i Fr(kpathsea)e Fv(library)i(that)f(allo)o(ws)h(Octa)o(v)o(e)f(to)g(recursiv)o(ely)90 2262 y(searc)o(h)c(directory)g(paths)g(for)g(function)h(and)f(script)h (\014les.)37 2336 y Ft(\017)30 b Fv(Georg)11 b(Bey)o(erle)j(\(gb)q(ey)o (erle)p Fr(@)p Fv(a)o(wi-p)q(otsdam.de\))e(con)o(tributed)h(co)q(de)g (to)e(sa)o(v)o(e)h(v)m(alues)h(in)g Fq(Ma)m(tlab)p Fv('s)f(`)p Fr(.mat)p Fv('-)90 2398 y(\014le)k(format,)e(and)h(has)g(pro)o(vided)h (man)o(y)f(useful)h(bug)g(rep)q(orts)e(and)i(suggestions.)37 2472 y Ft(\017)30 b Fv(John)14 b(Campb)q(ell)i(\(jcc)p Fr(@)p Fv(c)o(he.utexas.edu\))e(wrote)f(most)g(of)g(the)h(\014le)h(and) f(C-st)o(yle)g(input)h(and)g(output)e(func-)90 2534 y(tions.)37 2608 y Ft(\017)30 b Fv(Brian)12 b(F)l(o)o(x)g(\(bfo)o(x)p Fr(@)p Fv(gn)o(u.ai.mit.edu\))e(wrote)h(the)h Fr(readline)f Fv(library)i(used)f(for)f(command)h(history)g(editing,)90 2670 y(and)j(the)h(p)q(ortion)f(of)g(this)h(man)o(ual)f(that)f(do)q (cumen)o(ts)i(it.)p eop %%Page: 2 4 2 3 bop 0 -58 a Fv(2)1789 b(Octa)o(v)o(e)37 183 y Ft(\017)30 b Fv(A.)18 b(Scottedw)o(ard)g(Ho)q(del)i(\(scotte)p Fr(@)p Fv(eng.auburn.edu\))e(con)o(tributed)i(a)e(n)o(um)o(b)q(er)h(of)g (functions)g(including)90 246 y Fr(expm)p Fv(,)14 b Fr(qzval)p Fv(,)g Fr(qzhess)p Fv(,)g Fr(syl)p Fv(,)h Fr(lyap)p Fv(,)f(and)h Fr(balance)p Fv(.)37 320 y Ft(\017)30 b Fv(Kurt)14 b(Hornik)h (\(Kurt.Hornik)p Fr(@)p Fv(ci.tu)o(wien.ac.at\))e(pro)o(vided)i(the)g Fr(corrcoef)p Fv(,)e Fr(cov)p Fv(,)g Fr(kurtosis)p Fv(,)g Fr(pinv)p Fv(,)h(and)90 382 y Fr(skewness)g Fv(functions.)37 457 y Ft(\017)30 b Fv(Phil)17 b(Johnson)e(\(johnsonp)p Fr(@)p Fv(nicco.sscnet.ucla.edu\))h(has)g(help)q(ed)h(to)d(mak)o(e)h (Lin)o(ux)h(releases)g(a)o(v)m(ailable.)37 532 y Ft(\017)30 b Fv(F)l(riedric)o(h)17 b(Leisc)o(h)f(\(leisc)o(h)p Fr(@)p Fv(ci.tu)o(wien.ac.at\))g(pro)o(vided)g(the)f Fr(mahalanobis)f Fv(function.)37 607 y Ft(\017)30 b Fv(Ken)12 b(Neigh)o(b)q(ors)g(\(wkn) p Fr(@)p Fv(leland.stanford.edu\))g(has)f(pro)o(vided)i(man)o(y)e (useful)h(bug)g(rep)q(orts)f(and)h(commen)o(ts)90 669 y(on)j Fq(Ma)m(tlab)h Fv(compatibilit)o(y)l(.)37 744 y Ft(\017)30 b Fv(Ric)o(k)12 b(Niles)g(\(niles)p Fr(@)p Fv(axp745.gsfc.nasa.go)o(v\))7 b(con)o(tin)o(ues)12 b(to)d(trac)o(k)h (do)o(wn)g(o)q(dd)h(incompatibili)q(ties)i(and)e(bugs.)37 818 y Ft(\017)30 b Fv(Mark)23 b(Odegard)g(\(meo)p Fr(@)p Fv(sugarland.uno)q(cal.com\))g(pro)o(vided)h(the)g(initial)h(implemen)o (tation)g(of)e Fr(fread)p Fv(,)90 881 y Fr(fwrite)p Fv(,)14 b Fr(feof)p Fv(,)g(and)i Fr(ferror)p Fv(.)37 955 y Ft(\017)30 b Fv(T)l(on)o(y)19 b(Ric)o(hardson)i(\(ton)o(y)p Fr(@)p Fv(guts.biomed.uakron.edu\))d(wrote)g(Octa)o(v)o(e's)h(image)h(pro)q (cessing)g(functions)90 1018 y(as)15 b(w)o(ell)h(as)f(most)f(of)h(the)g (original)h(p)q(olynomial)h(functions.)37 1092 y Ft(\017)30 b Fv(R.)15 b(Bruce)h(T)l(enison)g(\(Bruce.T)l(enison)p Fr(@)p Fv(eng.auburn.edu\))h(wrote)d(the)h Fr(hess)g Fv(and)g Fr(schur)g Fv(functions.)37 1167 y Ft(\017)30 b Fv(T)l(eresa)15 b(Tw)o(aro)q(c)o(h)f(\(t)o(w)o(aro)q(c)o(h)p Fr(@)p Fv(ci.tu)o(wien.ac.at\))f(pro)o(vided)j(the)f(functions)h Fr(gls)f Fv(and)g Fr(ols)p Fv(.)37 1242 y Ft(\017)30 b Fv(F)l(o)q(ok)21 b(F)l(ah)g(Y)l(ap)h(\(\013y)p Fr(@)p Fv(eng.cam.ac.uk\))d(pro)o(vided)j(the)g Fr(fft)f Fv(and)h Fr(ifft)f Fv(functions)h(and)f(v)m(aluable)j(bug)90 1304 y(rep)q(orts)15 b(for)f(early)i(v)o(ersions.)62 1400 y(Sp)q(ecial)24 b(thanks)d(to)f(the)h(follo)o(wing)h(p)q(eople)h(and)e (organizations)h(for)e(supp)q(orting)i(the)f(dev)o(elopmen)o(t)h(of)0 1462 y(Octa)o(v)o(e:)37 1545 y Ft(\017)30 b Fv(Digital)20 b(Equipmen)o(t)h(Corp)q(oration,)e(for)g(an)h(equipmen)o(t)h(gran)o(t)d (as)h(part)g(of)h(their)g(External)f(Researc)o(h)90 1607 y(Program.)37 1682 y Ft(\017)30 b Fv(Sun)16 b(Microsystems,)e(Inc.,)i (for)e(an)h(Academic)i(Equipmen)o(t)f(gran)o(t.)37 1757 y Ft(\017)30 b Fv(T)l(exaco)12 b(Chemical)h(Compan)o(y)l(,)e(for)h(pro) o(viding)g(funding)h(to)f(con)o(tin)o(ue)g(the)g(dev)o(elopmen)o(t)g (of)g(this)g(soft)o(w)o(are.)37 1831 y Ft(\017)30 b Fv(The)16 b(Univ)o(ersit)o(y)h(of)f(T)l(exas)g(College)h(of)f(Engineering,)i(for) d(pro)o(viding)i(a)f(Challenge)i(for)e(Excellence)i(Re-)90 1893 y(searc)o(h)d(Supplemen)o(t,)h(and)g(for)e(pro)o(viding)i(an)g (Academic)g(Dev)o(elopmen)o(t)f(F)l(unds)h(gran)o(t.)37 1968 y Ft(\017)30 b Fv(The)17 b(State)f(of)g(T)l(exas,)h(for)f(pro)o (viding)h(funding)h(through)e(the)h(T)l(exas)f(Adv)m(anced)i(T)l(ec)o (hnology)f(Program)90 2030 y(under)f(Gran)o(t)e(No.)20 b(003658-078.)37 2105 y Ft(\017)30 b Fv(No)q(el)16 b(Bell,)g(Senior)h (Engineer,)e(T)l(exaco)g(Chemical)i(Compan)o(y)l(,)d(Austin)i(T)l (exas.)37 2180 y Ft(\017)30 b Fv(James)13 b(B.)g(Ra)o(wlings,)h(Asso)q (ciate)f(Professor,)f(Departmen)o(t)g(of)g(Chemical)j(Engineering,)f (The)f(Univ)o(ersit)o(y)90 2242 y(of)i(T)l(exas)g(at)f(Austin.)37 2317 y Ft(\017)30 b Fv(Ric)o(hard)16 b(Stallman,)g(for)e(writing)i (GNU.)62 2412 y(P)o(ortions)k(of)g(this)g(do)q(cumen)o(t)h(ha)o(v)o(e)f (b)q(een)h(adapted)f(from)g(the)g Fr(gawk)p Fv(,)g Fr(readline)p Fv(,)g Fr(gcc)p Fv(,)h(and)f(C)g(library)0 2475 y(man)o(uals,)14 b(published)j(b)o(y)d(the)h(F)l(ree)f(Soft)o(w)o(are)f(F)l(oundation,)h (675)g(Mass)f(Av)o(e,)h(Cam)o(bridge,)g(MA)g(02139,)f(USA.)62 2558 y(This)23 b(pro)s(ject)e(w)o(ould)h(not)f(ha)o(v)o(e)g(b)q(een)i (p)q(ossible)h(without)d(the)h(GNU)g(soft)o(w)o(are)e(used)i(in)g(and)g (used)h(to)0 2620 y(pro)q(duce)16 b(Octa)o(v)o(e.)p eop %%Page: 3 5 3 4 bop 0 -58 a Fv(GNU)15 b(GENERAL)h(PUBLIC)g(LICENSE)1177 b(3)0 183 y Fs(GNU)16 b(GENERAL)g(PUBLIC)g(LICENSE)769 305 y Fv(V)l(ersion)g(2,)e(June)i(1991)120 378 y(Cop)o(yrigh)o(t)346 377 y(c)334 378 y Ft(\015)f Fv(1989,)f(1991)g(F)l(ree)h(Soft)o(w)o(are) f(F)l(oundation,)h(Inc.)120 428 y(675)f(Mass)h(Av)o(e,)g(Cam)o(bridge,) f(MA)h(02139,)f(USA)120 528 y(Ev)o(ery)o(one)h(is)g(p)q(ermitted)h(to)f (cop)o(y)g(and)g(distribute)i(v)o(erbatim)e(copies)120 577 y(of)g(this)g(license)j(do)q(cumen)o(t,)d(but)g(c)o(hanging)h(it)f (is)h(not)f(allo)o(w)o(ed.)0 720 y Fu(Pream)n(ble)62 826 y Fv(The)20 b(licenses)i(for)d(most)g(soft)o(w)o(are)f(are)i (designed)h(to)e(tak)o(e)h(a)o(w)o(a)o(y)e(y)o(our)h(freedom)h(to)f (share)h(and)g(c)o(hange)0 889 y(it.)25 b(By)17 b(con)o(trast,)e(the)i (GNU)f(General)i(Public)g(License)h(is)e(in)o(tended)h(to)e(guaran)o (tee)g(y)o(our)g(freedom)h(to)f(share)0 951 y(and)h(c)o(hange)g(free)f (soft)o(w)o(are|to)f(mak)o(e)h(sure)h(the)g(soft)o(w)o(are)e(is)i(free) g(for)f(all)h(its)g(users.)25 b(This)17 b(General)g(Public)0 1013 y(License)d(applies)g(to)e(most)f(of)h(the)h(F)l(ree)f(Soft)o(w)o (are)f(F)l(oundation's)h(soft)o(w)o(are)f(and)h(to)g(an)o(y)g(other)g (program)f(whose)0 1075 y(authors)h(commit)h(to)g(using)g(it.)20 b(\(Some)12 b(other)h(F)l(ree)g(Soft)o(w)o(are)e(F)l(oundation)j(soft)o (w)o(are)d(is)i(co)o(v)o(ered)g(b)o(y)g(the)g(GNU)0 1138 y(Library)j(General)f(Public)i(License)g(instead.\))k(Y)l(ou)15 b(can)g(apply)h(it)g(to)e(y)o(our)h(programs,)f(to)q(o.)62 1223 y(When)20 b(w)o(e)e(sp)q(eak)h(of)g(free)g(soft)o(w)o(are,)e(w)o (e)i(are)f(referring)i(to)e(freedom,)h(not)g(price.)32 b(Our)19 b(General)g(Public)0 1285 y(Licenses)e(are)e(designed)i(to)d (mak)o(e)h(sure)g(that)g(y)o(ou)g(ha)o(v)o(e)g(the)g(freedom)g(to)g (distribute)h(copies)h(of)d(free)i(soft)o(w)o(are)0 1348 y(\(and)g(c)o(harge)f(for)g(this)i(service)g(if)f(y)o(ou)g(wish\),)f (that)h(y)o(ou)f(receiv)o(e)i(source)f(co)q(de)g(or)g(can)g(get)f(it)h (if)h(y)o(ou)e(w)o(an)o(t)g(it,)0 1410 y(that)g(y)o(ou)g(can)g(c)o (hange)h(the)f(soft)o(w)o(are)f(or)h(use)g(pieces)i(of)e(it)h(in)g(new) g(free)f(programs;)f(and)i(that)e(y)o(ou)h(kno)o(w)g(y)o(ou)0 1472 y(can)g(do)g(these)h(things.)62 1558 y(T)l(o)e(protect)f(y)o(our)g (righ)o(ts,)g(w)o(e)g(need)h(to)f(mak)o(e)g(restrictions)h(that)f (forbid)h(an)o(y)o(one)f(to)g(den)o(y)h(y)o(ou)f(these)h(righ)o(ts)0 1620 y(or)f(to)g(ask)h(y)o(ou)f(to)g(surrender)h(the)g(righ)o(ts.)19 b(These)14 b(restrictions)g(translate)g(to)f(certain)h(resp)q (onsibilitie)q(s)i(for)d(y)o(ou)0 1682 y(if)j(y)o(ou)f(distribute)h (copies)g(of)f(the)g(soft)o(w)o(are,)e(or)i(if)h(y)o(ou)e(mo)q(dify)i (it.)62 1768 y(F)l(or)h(example,)g(if)h(y)o(ou)e(distribute)i(copies)g (of)f(suc)o(h)g(a)f(program,)g(whether)h(gratis)g(or)f(for)g(a)h(fee,)g (y)o(ou)g(m)o(ust)0 1830 y(giv)o(e)f(the)f(recipien)o(ts)i(all)f(the)f (righ)o(ts)g(that)g(y)o(ou)g(ha)o(v)o(e.)20 b(Y)l(ou)c(m)o(ust)e(mak)o (e)h(sure)h(that)e(they)l(,)h(to)q(o,)g(receiv)o(e)h(or)f(can)0 1892 y(get)g(the)g(source)g(co)q(de.)21 b(And)16 b(y)o(ou)e(m)o(ust)h (sho)o(w)g(them)g(these)g(terms)g(so)g(they)g(kno)o(w)g(their)g(righ)o (ts.)62 1978 y(W)l(e)g(protect)f(y)o(our)g(righ)o(ts)g(with)h(t)o(w)o (o)e(steps:)19 b(\(1\))14 b(cop)o(yrigh)o(t)g(the)h(soft)o(w)o(are,)d (and)j(\(2\))e(o\013er)h(y)o(ou)g(this)h(license)0 2040 y(whic)o(h)h(giv)o(es)f(y)o(ou)g(legal)h(p)q(ermission)h(to)e(cop)o(y)l (,)f(distribute)j(and/or)e(mo)q(dify)g(the)h(soft)o(w)o(are.)62 2125 y(Also,)e(for)f(eac)o(h)g(author's)g(protection)g(and)h(ours,)f(w) o(e)g(w)o(an)o(t)g(to)g(mak)o(e)g(certain)g(that)g(ev)o(ery)o(one)g (understands)0 2188 y(that)k(there)i(is)f(no)g(w)o(arran)o(t)o(y)e(for) i(this)g(free)g(soft)o(w)o(are.)27 b(If)18 b(the)g(soft)o(w)o(are)f(is) h(mo)q(di\014ed)i(b)o(y)e(someone)g(else)h(and)0 2250 y(passed)h(on,)g(w)o(e)g(w)o(an)o(t)f(its)h(recipien)o(ts)h(to)e(kno)o (w)g(that)g(what)h(they)f(ha)o(v)o(e)h(is)g(not)f(the)h(original,)i(so) d(that)g(an)o(y)0 2312 y(problems)d(in)o(tro)q(duced)g(b)o(y)f(others)g (will)i(not)e(re\015ect)g(on)g(the)h(original)g(authors')e (reputations.)62 2398 y(Finally)l(,)20 b(an)o(y)d(free)g(program)f(is)i (threatened)g(constan)o(tly)f(b)o(y)g(soft)o(w)o(are)f(paten)o(ts.)26 b(W)l(e)17 b(wish)h(to)f(a)o(v)o(oid)g(the)0 2460 y(danger)11 b(that)g(redistributors)h(of)f(a)g(free)g(program)f(will)j(individual)q (ly)h(obtain)e(paten)o(t)f(licenses,)j(in)e(e\013ect)f(making)0 2522 y(the)k(program)g(proprietary)l(.)20 b(T)l(o)15 b(prev)o(en)o(t)g(this,)h(w)o(e)f(ha)o(v)o(e)g(made)g(it)h(clear)f (that)g(an)o(y)g(paten)o(t)g(m)o(ust)g(b)q(e)h(licensed)0 2585 y(for)f(ev)o(ery)o(one's)f(free)h(use)h(or)f(not)f(licensed)k(at)c (all.)62 2670 y(The)i(precise)g(terms)f(and)g(conditions)i(for)d(cop)o (ying,)h(distribution)i(and)f(mo)q(di\014cation)g(follo)o(w.)p eop %%Page: 4 6 4 5 bop 0 -58 a Fv(4)1789 b(Octa)o(v)o(e)0 121 y Fu(TERMS)15 b(AND)f(CONDITIONS)f(F)n(OR)i(COPYING,)e(DISTRIBUTION)0 183 y(AND)h(MODIFICA)-6 b(TION)25 290 y Fv(0.)29 b(This)22 b(License)g(applies)h(to)d(an)o(y)h(program)f(or)h(other)f(w)o(ork)g (whic)o(h)i(con)o(tains)f(a)g(notice)h(placed)g(b)o(y)f(the)90 352 y(cop)o(yrigh)o(t)15 b(holder)h(sa)o(ying)f(it)g(ma)o(y)g(b)q(e)g (distributed)i(under)f(the)f(terms)g(of)f(this)i(General)g(Public)h (License.)90 414 y(The)h(\\Program",)d(b)q(elo)o(w,)j(refers)f(to)g(an) o(y)g(suc)o(h)h(program)e(or)h(w)o(ork,)f(and)i(a)f(\\w)o(ork)f(based)i (on)f(the)g(Pro-)90 477 y(gram")c(means)h(either)h(the)g(Program)e(or)g (an)o(y)h(deriv)m(ativ)o(e)i(w)o(ork)d(under)i(cop)o(yrigh)o(t)f(la)o (w:)20 b(that)13 b(is)i(to)f(sa)o(y)l(,)f(a)90 539 y(w)o(ork)h(con)o (taining)i(the)g(Program)e(or)h(a)g(p)q(ortion)g(of)g(it,)g(either)h(v) o(erbatim)g(or)e(with)i(mo)q(di\014cations)h(and/or)90 601 y(translated)h(in)o(to)g(another)g(language.)29 b(\(Hereinafter,)19 b(translation)f(is)h(included)h(without)f(limitation)g(in)90 664 y(the)c(term)g(\\mo)q(di\014cation".\))20 b(Eac)o(h)15 b(licensee)j(is)d(addressed)h(as)f(\\y)o(ou".)90 741 y(Activities)k(other)e(than)g(cop)o(ying,)g(distribution)i(and)f(mo)q (di\014cation)g(are)f(not)g(co)o(v)o(ered)g(b)o(y)g(this)h(License;)90 803 y(they)f(are)f(outside)h(its)f(scop)q(e.)24 b(The)17 b(act)f(of)g(running)i(the)e(Program)f(is)i(not)f(restricted,)h(and)g (the)f(output)90 866 y(from)21 b(the)g(Program)f(is)i(co)o(v)o(ered)f (only)h(if)f(its)h(con)o(ten)o(ts)e(constitute)i(a)f(w)o(ork)f(based)i (on)f(the)g(Program)90 928 y(\(indep)q(enden)o(t)f(of)d(ha)o(ving)g(b)q (een)i(made)f(b)o(y)f(running)i(the)e(Program\).)26 b(Whether)17 b(that)g(is)h(true)f(dep)q(ends)90 990 y(on)e(what)g(the)g(Program)f (do)q(es.)25 1068 y(1.)29 b(Y)l(ou)21 b(ma)o(y)e(cop)o(y)h(and)h (distribute)h(v)o(erbatim)e(copies)h(of)f(the)g(Program's)f(source)h (co)q(de)h(as)f(y)o(ou)g(receiv)o(e)90 1130 y(it,)e(in)g(an)o(y)g (medium,)g(pro)o(vided)h(that)e(y)o(ou)g(conspicuously)i(and)f (appropriately)g(publish)i(on)d(eac)o(h)h(cop)o(y)90 1192 y(an)h(appropriate)f(cop)o(yrigh)o(t)h(notice)g(and)g(disclaimer)h (of)f(w)o(arran)o(t)o(y;)f(k)o(eep)h(in)o(tact)f(all)i(the)e(notices)i (that)90 1255 y(refer)c(to)f(this)i(License)g(and)g(to)e(the)h(absence) h(of)e(an)o(y)h(w)o(arran)o(t)o(y;)e(and)i(giv)o(e)h(an)o(y)e(other)h (recipien)o(ts)h(of)f(the)90 1317 y(Program)e(a)h(cop)o(y)g(of)f(this)i (License)h(along)e(with)h(the)f(Program.)90 1395 y(Y)l(ou)h(ma)o(y)f(c) o(harge)g(a)h(fee)g(for)f(the)h(ph)o(ysical)h(act)e(of)h(transferring)f (a)g(cop)o(y)l(,)h(and)g(y)o(ou)f(ma)o(y)g(at)h(y)o(our)f(option)90 1457 y(o\013er)f(w)o(arran)o(t)o(y)g(protection)h(in)h(exc)o(hange)f (for)g(a)g(fee.)25 1535 y(2.)29 b(Y)l(ou)15 b(ma)o(y)e(mo)q(dify)i(y)o (our)f(cop)o(y)g(or)g(copies)h(of)f(the)g(Program)f(or)h(an)o(y)g(p)q (ortion)g(of)g(it,)h(th)o(us)f(forming)g(a)g(w)o(ork)90 1597 y(based)g(on)g(the)g(Program,)f(and)h(cop)o(y)g(and)g(distribute)h (suc)o(h)g(mo)q(di\014cations)g(or)e(w)o(ork)g(under)i(the)f(terms)f (of)90 1659 y(Section)j(1)f(ab)q(o)o(v)o(e,)f(pro)o(vided)i(that)f(y)o (ou)g(also)g(meet)g(all)h(of)f(these)g(conditions:)115 1737 y(a.)29 b(Y)l(ou)13 b(m)o(ust)g(cause)g(the)g(mo)q(di\014ed)h (\014les)g(to)f(carry)f(prominen)o(t)i(notices)f(stating)g(that)f(y)o (ou)h(c)o(hanged)g(the)180 1799 y(\014les)j(and)g(the)f(date)g(of)g(an) o(y)f(c)o(hange.)112 1877 y(b.)30 b(Y)l(ou)14 b(m)o(ust)f(cause)h(an)o (y)f(w)o(ork)g(that)g(y)o(ou)g(distribute)i(or)e(publish,)j(that)d(in)h (whole)g(or)f(in)i(part)e(con)o(tains)180 1939 y(or)g(is)i(deriv)o(ed)f (from)f(the)h(Program)f(or)g(an)o(y)g(part)g(thereof,)h(to)f(b)q(e)h (licensed)i(as)e(a)f(whole)i(at)e(no)g(c)o(harge)180 2001 y(to)i(all)h(third)f(parties)h(under)g(the)f(terms)g(of)f(this)i (License.)117 2079 y(c.)30 b(If)12 b(the)h(mo)q(di\014ed)g(program)e (normally)i(reads)f(commands)g(in)o(teractiv)o(ely)h(when)g(run,)f(y)o (ou)g(m)o(ust)g(cause)180 2141 y(it,)20 b(when)f(started)g(running)h (for)e(suc)o(h)i(in)o(teractiv)o(e)f(use)g(in)h(the)g(most)e(ordinary)h (w)o(a)o(y)l(,)g(to)f(prin)o(t)h(or)180 2203 y(displa)o(y)j(an)g (announcemen)o(t)g(including)i(an)d(appropriate)g(cop)o(yrigh)o(t)g (notice)h(and)g(a)f(notice)h(that)180 2266 y(there)d(is)h(no)g(w)o (arran)o(t)o(y)d(\(or)h(else,)j(sa)o(ying)f(that)e(y)o(ou)h(pro)o(vide) h(a)f(w)o(arran)o(t)o(y\))e(and)j(that)e(users)i(ma)o(y)180 2328 y(redistribute)d(the)e(program)f(under)j(these)e(conditions,)i (and)e(telling)i(the)f(user)f(ho)o(w)g(to)g(view)h(a)f(cop)o(y)180 2390 y(of)k(this)i(License.)35 b(\(Exception:)29 b(if)21 b(the)f(Program)e(itself)j(is)f(in)o(teractiv)o(e)g(but)g(do)q(es)g (not)f(normally)180 2452 y(prin)o(t)c(suc)o(h)f(an)g(announcemen)o(t,)h (y)o(our)f(w)o(ork)f(based)i(on)f(the)g(Program)f(is)i(not)f(required)h (to)e(prin)o(t)i(an)180 2515 y(announcemen)o(t.\))90 2608 y(These)20 b(requiremen)o(ts)h(apply)g(to)e(the)i(mo)q(di\014ed)g (w)o(ork)e(as)h(a)g(whole.)35 b(If)20 b(iden)o(ti\014able)i(sections)f (of)f(that)90 2670 y(w)o(ork)d(are)g(not)g(deriv)o(ed)i(from)e(the)h (Program,)f(and)g(can)h(b)q(e)h(reasonably)f(considered)h(indep)q (enden)o(t)h(and)p eop %%Page: 5 7 5 6 bop 0 -58 a Fv(GNU)15 b(GENERAL)h(PUBLIC)g(LICENSE)1177 b(5)90 183 y(separate)15 b(w)o(orks)f(in)j(themselv)o(es,)e(then)h (this)g(License,)h(and)f(its)f(terms,)g(do)g(not)g(apply)h(to)f(those)g (sections)90 246 y(when)j(y)o(ou)g(distribute)h(them)f(as)g(separate)f (w)o(orks.)28 b(But)18 b(when)g(y)o(ou)g(distribute)h(the)f(same)g (sections)g(as)90 308 y(part)d(of)g(a)g(whole)h(whic)o(h)h(is)f(a)f(w)o (ork)f(based)i(on)g(the)f(Program,)f(the)h(distribution)j(of)d(the)g (whole)h(m)o(ust)f(b)q(e)90 370 y(on)g(the)g(terms)f(of)g(this)h (License,)i(whose)d(p)q(ermissions)j(for)d(other)g(licensees)j(extend)e (to)g(the)f(en)o(tire)i(whole,)90 432 y(and)f(th)o(us)g(to)g(eac)o(h)g (and)h(ev)o(ery)f(part)f(regardless)i(of)e(who)h(wrote)g(it.)90 507 y(Th)o(us,)g(it)g(is)h(not)f(the)g(in)o(ten)o(t)g(of)g(this)h (section)g(to)e(claim)i(righ)o(ts)f(or)g(con)o(test)g(y)o(our)f(righ)o (ts)h(to)g(w)o(ork)f(written)90 569 y(en)o(tirely)e(b)o(y)f(y)o(ou;)h (rather,)f(the)g(in)o(ten)o(t)h(is)f(to)g(exercise)h(the)f(righ)o(t)g (to)g(con)o(trol)g(the)g(distribution)i(of)e(deriv)m(ativ)o(e)90 631 y(or)k(collectiv)o(e)i(w)o(orks)d(based)h(on)g(the)h(Program.)90 706 y(In)i(addition,)h(mere)f(aggregation)e(of)h(another)h(w)o(ork)e (not)h(based)h(on)g(the)g(Program)e(with)i(the)f(Program)90 768 y(\(or)d(with)h(a)f(w)o(ork)g(based)h(on)g(the)f(Program\))f(on)i (a)f(v)o(olume)h(of)g(a)f(storage)f(or)i(distribution)h(medium)g(do)q (es)90 830 y(not)f(bring)h(the)f(other)g(w)o(ork)f(under)i(the)f(scop)q (e)h(of)f(this)g(License.)25 904 y(3.)29 b(Y)l(ou)16 b(ma)o(y)f(cop)o(y)h(and)g(distribute)h(the)f(Program)e(\(or)h(a)h(w)o (ork)f(based)h(on)g(it,)f(under)i(Section)g(2\))e(in)i(ob)s(ject)90 967 y(co)q(de)f(or)f(executable)h(form)f(under)h(the)g(terms)e(of)h (Sections)h(1)f(and)h(2)f(ab)q(o)o(v)o(e)g(pro)o(vided)h(that)f(y)o(ou) g(also)g(do)90 1029 y(one)g(of)g(the)g(follo)o(wing:)115 1103 y(a.)29 b(Accompan)o(y)12 b(it)g(with)g(the)h(complete)f(corresp)q (onding)h(mac)o(hine-readable)h(source)e(co)q(de,)h(whic)o(h)g(m)o(ust) 180 1165 y(b)q(e)j(distributed)i(under)e(the)g(terms)g(of)f(Sections)i (1)e(and)h(2)g(ab)q(o)o(v)o(e)f(on)h(a)f(medium)i(customarily)f(used) 180 1228 y(for)f(soft)o(w)o(are)e(in)o(terc)o(hange;)i(or,)112 1302 y(b.)30 b(Accompan)o(y)12 b(it)g(with)g(a)f(written)h(o\013er,)f (v)m(alid)i(for)f(at)f(least)g(three)h(y)o(ears,)g(to)f(giv)o(e)h(an)o (y)f(third)h(part)o(y)l(,)g(for)180 1364 y(a)j(c)o(harge)g(no)g(more)f (than)h(y)o(our)g(cost)g(of)f(ph)o(ysically)j(p)q(erforming)f(source)f (distribution,)h(a)f(complete)180 1427 y(mac)o(hine-readable)e(cop)o(y) f(of)f(the)g(corresp)q(onding)i(source)e(co)q(de,)i(to)e(b)q(e)h (distributed)h(under)f(the)g(terms)180 1489 y(of)j(Sections)h(1)f(and)g (2)g(ab)q(o)o(v)o(e)g(on)g(a)g(medium)h(customarily)g(used)f(for)g (soft)o(w)o(are)e(in)o(terc)o(hange;)j(or,)117 1563 y(c.)30 b(Accompan)o(y)12 b(it)g(with)g(the)h(information)f(y)o(ou)f(receiv)o (ed)i(as)f(to)f(the)h(o\013er)f(to)h(distribute)h(corresp)q(onding)180 1625 y(source)j(co)q(de.)22 b(\(This)16 b(alternativ)o(e)g(is)g(allo)o (w)o(ed)g(only)g(for)f(noncommercial)i(distribution)g(and)f(only)g(if) 180 1688 y(y)o(ou)f(receiv)o(ed)h(the)g(program)e(in)i(ob)s(ject)f(co)q (de)h(or)e(executable)j(form)d(with)i(suc)o(h)g(an)f(o\013er,)f(in)i (accord)180 1750 y(with)g(Subsection)g(b)f(ab)q(o)o(v)o(e.\))90 1836 y(The)g(source)g(co)q(de)g(for)g(a)f(w)o(ork)g(means)h(the)g (preferred)g(form)f(of)h(the)g(w)o(ork)e(for)i(making)g(mo)q (di\014cations)h(to)90 1899 y(it.)29 b(F)l(or)17 b(an)h(executable)h(w) o(ork,)f(complete)g(source)g(co)q(de)h(means)f(all)h(the)f(source)g(co) q(de)h(for)e(all)i(mo)q(dules)90 1961 y(it)d(con)o(tains,)g(plus)g(an)o (y)g(asso)q(ciated)g(in)o(terface)g(de\014nition)h(\014les,)g(plus)f (the)g(scripts)g(used)h(to)e(con)o(trol)g(com-)90 2023 y(pilation)k(and)f(installation)h(of)e(the)g(executable.)28 b(Ho)o(w)o(ev)o(er,)17 b(as)g(a)g(sp)q(ecial)i(exception,)g(the)f (source)f(co)q(de)90 2085 y(distributed)g(need)f(not)g(include)i(an)o (ything)d(that)g(is)h(normally)g(distributed)h(\(in)f(either)h(source)e (or)g(binary)90 2148 y(form\))j(with)h(the)g(ma)s(jor)e(comp)q(onen)o (ts)i(\(compiler,)h(k)o(ernel,)g(and)f(so)f(on\))h(of)f(the)h(op)q (erating)g(system)f(on)90 2210 y(whic)o(h)e(the)f(executable)i(runs,)e (unless)h(that)f(comp)q(onen)o(t)g(itself)h(accompanies)g(the)f (executable.)90 2284 y(If)d(distribution)i(of)e(executable)h(or)e(ob)s (ject)h(co)q(de)g(is)h(made)f(b)o(y)g(o\013ering)g(access)g(to)f(cop)o (y)h(from)f(a)h(designated)90 2347 y(place,)18 b(then)g(o\013ering)f (equiv)m(alen)o(t)i(access)e(to)g(cop)o(y)g(the)g(source)h(co)q(de)f (from)g(the)g(same)g(place)h(coun)o(ts)f(as)90 2409 y(distribution)e (of)e(the)g(source)g(co)q(de,)h(ev)o(en)g(though)f(third)g(parties)h (are)f(not)g(comp)q(elled)i(to)e(cop)o(y)g(the)g(source)90 2471 y(along)i(with)h(the)f(ob)s(ject)g(co)q(de.)25 2545 y(4.)29 b(Y)l(ou)15 b(ma)o(y)e(not)i(cop)o(y)l(,)f(mo)q(dify)l(,)h (sublicense,)i(or)c(distribute)j(the)f(Program)e(except)i(as)f (expressly)h(pro)o(vided)90 2608 y(under)i(this)g(License.)25 b(An)o(y)16 b(attempt)g(otherwise)g(to)g(cop)o(y)l(,)h(mo)q(dify)l(,)g (sublicense)h(or)e(distribute)i(the)e(Pro-)90 2670 y(gram)11 b(is)i(v)o(oid,)f(and)g(will)i(automatically)f(terminate)f(y)o(our)f (righ)o(ts)h(under)g(this)h(License.)20 b(Ho)o(w)o(ev)o(er,)12 b(parties)p eop %%Page: 6 8 6 7 bop 0 -58 a Fv(6)1789 b(Octa)o(v)o(e)90 183 y(who)18 b(ha)o(v)o(e)f(receiv)o(ed)j(copies,)f(or)e(righ)o(ts,)h(from)g(y)o(ou) f(under)i(this)g(License)h(will)f(not)f(ha)o(v)o(e)f(their)i(licenses) 90 246 y(terminated)c(so)g(long)h(as)f(suc)o(h)g(parties)g(remain)h(in) g(full)h(compliance.)25 325 y(5.)29 b(Y)l(ou)18 b(are)f(not)g(required) i(to)e(accept)g(this)h(License,)i(since)f(y)o(ou)e(ha)o(v)o(e)g(not)g (signed)i(it.)27 b(Ho)o(w)o(ev)o(er,)16 b(nothing)90 387 y(else)g(gran)o(ts)d(y)o(ou)i(p)q(ermission)h(to)e(mo)q(dify)i(or)e (distribute)i(the)f(Program)e(or)i(its)g(deriv)m(ativ)o(e)h(w)o(orks.)j (These)90 450 y(actions)f(are)g(prohibited)i(b)o(y)e(la)o(w)g(if)g(y)o (ou)g(do)g(not)g(accept)g(this)h(License.)30 b(Therefore,)18 b(b)o(y)g(mo)q(difying)h(or)90 512 y(distributing)f(the)e(Program)f (\(or)g(an)o(y)h(w)o(ork)g(based)g(on)g(the)h(Program\),)d(y)o(ou)i (indicate)i(y)o(our)d(acceptance)90 574 y(of)e(this)h(License)h(to)e (do)h(so,)f(and)h(all)g(its)g(terms)f(and)h(conditions)h(for)e(cop)o (ying,)g(distributing)j(or)d(mo)q(difying)90 636 y(the)i(Program)f(or)h (w)o(orks)f(based)h(on)h(it.)25 716 y(6.)29 b(Eac)o(h)18 b(time)g(y)o(ou)g(redistribute)h(the)f(Program)f(\(or)g(an)o(y)h(w)o (ork)f(based)h(on)g(the)h(Program\),)d(the)i(recipien)o(t)90 778 y(automatically)i(receiv)o(es)h(a)e(license)j(from)d(the)h (original)h(licensor)g(to)e(cop)o(y)l(,)h(distribute)h(or)f(mo)q(dify)g (the)90 840 y(Program)14 b(sub)s(ject)i(to)f(these)h(terms)f(and)h (conditions.)22 b(Y)l(ou)16 b(ma)o(y)f(not)g(imp)q(ose)i(an)o(y)e (further)h(restrictions)90 903 y(on)g(the)h(recipien)o(ts')h(exercise)f (of)g(the)f(righ)o(ts)g(gran)o(ted)g(herein.)26 b(Y)l(ou)16 b(are)h(not)f(resp)q(onsible)i(for)e(enforcing)90 965 y(compliance)h(b)o(y)e(third)h(parties)f(to)g(this)g(License.)25 1044 y(7.)29 b(If,)15 b(as)g(a)h(consequence)g(of)f(a)g(court)h (judgmen)o(t)f(or)g(allegation)h(of)f(paten)o(t)g(infringemen)o(t)i(or) d(for)h(an)o(y)g(other)90 1107 y(reason)g(\(not)f(limited)j(to)e(paten) o(t)f(issues\),)i(conditions)g(are)f(imp)q(osed)h(on)f(y)o(ou)g (\(whether)g(b)o(y)g(court)g(order,)90 1169 y(agreemen)o(t)e(or)h (otherwise\))g(that)f(con)o(tradict)h(the)g(conditions)h(of)e(this)i (License,)g(they)f(do)g(not)g(excuse)g(y)o(ou)90 1231 y(from)j(the)i(conditions)g(of)f(this)h(License.)30 b(If)19 b(y)o(ou)f(cannot)g(distribute)h(so)f(as)g(to)g(satisfy)g(sim)o (ultaneously)90 1293 y(y)o(our)13 b(obligations)h(under)g(this)g (License)h(and)f(an)o(y)f(other)g(p)q(ertinen)o(t)h(obligations,)h (then)e(as)g(a)h(consequence)90 1356 y(y)o(ou)h(ma)o(y)f(not)h (distribute)i(the)e(Program)f(at)g(all.)21 b(F)l(or)15 b(example,)g(if)h(a)f(paten)o(t)g(license)i(w)o(ould)e(not)g(p)q(ermit) 90 1418 y(ro)o(y)o(alt)o(y-free)e(redistribution)i(of)f(the)g(Program)e (b)o(y)i(all)h(those)e(who)h(receiv)o(e)h(copies)f(directly)h(or)f (indirectly)90 1480 y(through)h(y)o(ou,)f(then)h(the)g(only)h(w)o(a)o (y)e(y)o(ou)h(could)h(satisfy)e(b)q(oth)i(it)f(and)g(this)g(License)i (w)o(ould)f(b)q(e)f(to)g(refrain)90 1543 y(en)o(tirely)h(from)f (distribution)i(of)d(the)i(Program.)90 1622 y(If)c(an)o(y)f(p)q(ortion) h(of)f(this)h(section)g(is)g(held)g(in)o(v)m(alid)i(or)d(unenforceable) i(under)f(an)o(y)f(particular)h(circumstance,)90 1684 y(the)j(balance)g(of)f(the)g(section)h(is)g(in)o(tended)h(to)e(apply)h (and)g(the)f(section)h(as)f(a)h(whole)g(is)g(in)o(tended)g(to)f(apply) 90 1747 y(in)i(other)f(circumstances.)90 1826 y(It)j(is)g(not)g(the)g (purp)q(ose)g(of)f(this)i(section)f(to)f(induce)j(y)o(ou)d(to)h (infringe)h(an)o(y)e(paten)o(ts)h(or)f(other)g(prop)q(ert)o(y)90 1888 y(righ)o(t)k(claims)g(or)g(to)f(con)o(test)g(v)m(alidit)o(y)j(of)d (an)o(y)h(suc)o(h)g(claims;)j(this)d(section)h(has)f(the)g(sole)g(purp) q(ose)g(of)90 1951 y(protecting)h(the)g(in)o(tegrit)o(y)g(of)f(the)h (free)g(soft)o(w)o(are)e(distribution)k(system,)e(whic)o(h)h(is)f (implemen)o(ted)i(b)o(y)90 2013 y(public)18 b(license)g(practices.)23 b(Man)o(y)15 b(p)q(eople)i(ha)o(v)o(e)f(made)g(generous)g(con)o (tributions)h(to)e(the)h(wide)h(range)e(of)90 2075 y(soft)o(w)o(are)e (distributed)k(through)e(that)f(system)h(in)h(reliance)h(on)e (consisten)o(t)h(application)g(of)f(that)g(system;)90 2137 y(it)f(is)h(up)f(to)g(the)g(author/donor)f(to)g(decide)j(if)e(he)h (or)e(she)i(is)f(willing)j(to)c(distribute)i(soft)o(w)o(are)e(through)g (an)o(y)90 2200 y(other)i(system)g(and)g(a)g(licensee)i(cannot)e(imp)q (ose)h(that)f(c)o(hoice.)90 2279 y(This)h(section)f(is)h(in)o(tended)g (to)f(mak)o(e)f(thoroughly)h(clear)h(what)e(is)i(b)q(eliev)o(ed)h(to)d (b)q(e)i(a)f(consequence)h(of)f(the)90 2341 y(rest)g(of)g(this)g (License.)25 2421 y(8.)29 b(If)13 b(the)f(distribution)i(and/or)e(use)g (of)g(the)h(Program)d(is)j(restricted)g(in)g(certain)g(coun)o(tries)f (either)h(b)o(y)g(paten)o(ts)90 2483 y(or)i(b)o(y)g(cop)o(yrigh)o(ted)g (in)o(terfaces,)g(the)g(original)h(cop)o(yrigh)o(t)f(holder)h(who)f (places)h(the)f(Program)f(under)i(this)90 2545 y(License)h(ma)o(y)e (add)g(an)g(explicit)j(geographical)d(distribution)i(limitation)g (excluding)g(those)e(coun)o(tries,)g(so)90 2608 y(that)e(distribution)j (is)e(p)q(ermitted)g(only)h(in)f(or)g(among)f(coun)o(tries)h(not)f(th)o (us)h(excluded.)21 b(In)15 b(suc)o(h)f(case,)g(this)90 2670 y(License)j(incorp)q(orates)e(the)h(limitation)g(as)f(if)h (written)f(in)h(the)f(b)q(o)q(dy)h(of)f(this)h(License.)p eop %%Page: 7 9 7 8 bop 0 -58 a Fv(GNU)15 b(GENERAL)h(PUBLIC)g(LICENSE)1177 b(7)25 183 y(9.)29 b(The)14 b(F)l(ree)h(Soft)o(w)o(are)d(F)l(oundation) j(ma)o(y)e(publish)j(revised)f(and/or)f(new)g(v)o(ersions)h(of)e(the)i (General)f(Public)90 246 y(License)k(from)e(time)h(to)f(time.)24 b(Suc)o(h)17 b(new)g(v)o(ersions)f(will)j(b)q(e)e(similar)g(in)h (spirit)f(to)f(the)h(presen)o(t)f(v)o(ersion,)90 308 y(but)f(ma)o(y)g(di\013er)g(in)h(detail)h(to)d(address)h(new)h (problems)g(or)e(concerns.)90 382 y(Eac)o(h)21 b(v)o(ersion)h(is)h(giv) o(en)f(a)f(distinguishing)j(v)o(ersion)e(n)o(um)o(b)q(er.)40 b(If)22 b(the)g(Program)e(sp)q(eci\014es)j(a)f(v)o(ersion)90 445 y(n)o(um)o(b)q(er)e(of)f(this)h(License)h(whic)o(h)g(applies)g(to)e (it)h(and)g(\\an)o(y)f(later)g(v)o(ersion",)h(y)o(ou)g(ha)o(v)o(e)f (the)h(option)f(of)90 507 y(follo)o(wing)j(the)f(terms)f(and)h (conditions)h(either)g(of)e(that)h(v)o(ersion)g(or)f(of)h(an)o(y)f (later)h(v)o(ersion)g(published)90 569 y(b)o(y)d(the)g(F)l(ree)g(Soft)o (w)o(are)e(F)l(oundation.)29 b(If)18 b(the)g(Program)f(do)q(es)h(not)g (sp)q(ecify)h(a)f(v)o(ersion)g(n)o(um)o(b)q(er)g(of)g(this)90 632 y(License,)f(y)o(ou)d(ma)o(y)h(c)o(ho)q(ose)g(an)o(y)g(v)o(ersion)g (ev)o(er)h(published)h(b)o(y)e(the)h(F)l(ree)f(Soft)o(w)o(are)f(F)l (oundation.)2 706 y(10.)29 b(If)17 b(y)o(ou)g(wish)h(to)f(incorp)q (orate)g(parts)g(of)g(the)g(Program)f(in)o(to)h(other)g(free)g (programs)f(whose)h(distribution)90 769 y(conditions)23 b(are)f(di\013eren)o(t,)h(write)f(to)f(the)h(author)f(to)h(ask)f(for)g (p)q(ermission.)41 b(F)l(or)22 b(soft)o(w)o(are)e(whic)o(h)i(is)90 831 y(cop)o(yrigh)o(ted)h(b)o(y)f(the)h(F)l(ree)g(Soft)o(w)o(are)e(F)l (oundation,)j(write)f(to)f(the)g(F)l(ree)h(Soft)o(w)o(are)e(F)l (oundation;)26 b(w)o(e)90 893 y(sometimes)13 b(mak)o(e)f(exceptions)i (for)f(this.)19 b(Our)13 b(decision)i(will)g(b)q(e)e(guided)i(b)o(y)d (the)h(t)o(w)o(o)f(goals)h(of)f(preserving)90 955 y(the)i(free)g (status)g(of)f(all)i(deriv)m(ativ)o(es)h(of)d(our)h(free)g(soft)o(w)o (are)e(and)j(of)e(promoting)h(the)g(sharing)h(and)f(reuse)g(of)90 1018 y(soft)o(w)o(are)f(generally)l(.)90 1142 y Fu(NO)h(W)-7 b(ARRANTY)2 1246 y Fv(11.)29 b(BECA)o(USE)20 b(THE)h(PR)o(OGRAM)f(IS)i (LICENSED)e(FREE)h(OF)f(CHAR)o(GE,)g(THERE)h(IS)g(NO)g(W)-5 b(AR-)90 1308 y(RANTY)12 b(F)o(OR)f(THE)g(PR)o(OGRAM,)g(TO)h(THE)f (EXTENT)f(PERMITTED)h(BY)h(APPLICABLE)g(LA)-5 b(W.)90 1370 y(EX)o(CEPT)23 b(WHEN)g(OTHER)-5 b(WISE)24 b(ST)l(A)l(TED)g(IN)g (WRITING)f(THE)h(COPYRIGHT)g(HOLDERS)90 1433 y(AND/OR)11 b(OTHER)f(P)l(AR)l(TIES)i(PR)o(O)o(VIDE)e(THE)g(PR)o(OGRAM)h(\\AS)f (IS")h(WITHOUT)f(W)-5 b(ARRANTY)90 1495 y(OF)14 b(ANY)h(KIND,)f(EITHER) h(EXPRESSED)f(OR)h(IMPLIED,)f(INCLUDING,)h(BUT)f(NOT)h(LIMITED)90 1557 y(TO,)23 b(THE)g(IMPLIED)h(W)-5 b(ARRANTIES)24 b(OF)f(MER)o(CHANT) l(ABILITY)i(AND)e(FITNESS)h(F)o(OR)f(A)90 1620 y(P)l(AR)l(TICULAR)e (PURPOSE.)e(THE)f(ENTIRE)h(RISK)h(AS)f(TO)g(THE)f(QUALITY)i(AND)e(PERF) o(OR-)90 1682 y(MANCE)h(OF)h(THE)f(PR)o(OGRAM)h(IS)h(WITH)e(YOU.)h (SHOULD)h(THE)e(PR)o(OGRAM)h(PR)o(O)o(VE)g(DE-)90 1744 y(FECTIVE,)d(YOU)h(ASSUME)g(THE)g(COST)g(OF)f(ALL)i(NECESSAR)l(Y)g(SER) -5 b(VICING,)18 b(REP)l(AIR)h(OR)90 1806 y(CORRECTION.)2 1881 y(12.)29 b(IN)13 b(NO)g(EVENT)f(UNLESS)i(REQUIRED)g(BY)e (APPLICABLE)i(LA)-5 b(W)13 b(OR)g(A)o(GREED)f(TO)g(IN)h(WRIT-)90 1943 y(ING)h(WILL)g(ANY)f(COPYRIGHT)h(HOLDER,)g(OR)g(ANY)g(OTHER)g(P)l (AR)l(TY)g(WHO)g(MA)l(Y)f(MODIFY)90 2006 y(AND/OR)k(REDISTRIBUTE)h(THE) e(PR)o(OGRAM)h(AS)f(PERMITTED)g(ABO)o(VE,)h(BE)f(LIABLE)i(TO)90 2068 y(YOU)13 b(F)o(OR)g(D)o(AMA)o(GES,)f(INCLUDING)h(ANY)g(GENERAL,)g (SPECIAL,)g(INCIDENT)l(AL)h(OR)g(CON-)90 2130 y(SEQUENTIAL)20 b(D)o(AMA)o(GES)d(ARISING)j(OUT)f(OF)f(THE)g(USE)h(OR)g(INABILITY)i(TO) d(USE)h(THE)90 2192 y(PR)o(OGRAM)g(\(INCLUDING)h(BUT)f(NOT)h(LIMITED)f (TO)g(LOSS)i(OF)e(D)o(A)l(T)l(A)g(OR)h(D)o(A)l(T)l(A)f(BEING)90 2255 y(RENDERED)j(INA)o(CCURA)l(TE)h(OR)f(LOSSES)h(SUST)l(AINED)g(BY)f (YOU)h(OR)f(THIRD)h(P)l(AR)l(TIES)90 2317 y(OR)15 b(A)g(F)-5 b(AILURE)15 b(OF)f(THE)h(PR)o(OGRAM)f(TO)h(OPERA)l(TE)g(WITH)f(ANY)h (OTHER)g(PR)o(OGRAMS\),)90 2379 y(EVEN)k(IF)g(SUCH)g(HOLDER)h(OR)f (OTHER)h(P)l(AR)l(TY)f(HAS)g(BEEN)g(AD)o(VISED)g(OF)g(THE)g(POSSI-)90 2441 y(BILITY)e(OF)e(SUCH)g(D)o(AMA)o(GES.)0 2574 y Fu(END)f(OF)h (TERMS)h(AND)e(CONDITIONS)p eop %%Page: 8 10 8 9 bop 0 -58 a Fv(8)1789 b(Octa)o(v)o(e)0 183 y Fu(App)r(endix:)24 b(Ho)n(w)14 b(to)h(Apply)i(These)d(T)-6 b(erms)13 b(to)i(Y)-6 b(our)16 b(New)e(Programs)62 289 y Fv(If)i(y)o(ou)e(dev)o(elop)j(a)d (new)i(program,)d(and)j(y)o(ou)e(w)o(an)o(t)g(it)i(to)e(b)q(e)i(of)f (the)g(greatest)f(p)q(ossible)j(use)e(to)g(the)g(public,)0 351 y(the)f(b)q(est)g(w)o(a)o(y)f(to)h(ac)o(hiev)o(e)g(this)h(is)f(to)g (mak)o(e)f(it)h(free)g(soft)o(w)o(are)f(whic)o(h)i(ev)o(ery)o(one)e (can)h(redistribute)i(and)e(c)o(hange)0 413 y(under)i(these)f(terms.)62 498 y(T)l(o)f(do)g(so,)g(attac)o(h)f(the)h(follo)o(wing)h(notices)g(to) f(the)g(program.)k(It)d(is)f(safest)g(to)f(attac)o(h)g(them)i(to)e(the) h(start)f(of)0 560 y(eac)o(h)k(source)f(\014le)i(to)e(most)g (e\013ectiv)o(ely)h(con)o(v)o(ey)g(the)f(exclusion)j(of)d(w)o(arran)o (t)o(y;)f(and)h(eac)o(h)h(\014le)h(should)f(ha)o(v)o(e)g(at)0 622 y(least)e(the)h(\\cop)o(yrigh)o(t")e(line)j(and)e(a)g(p)q(oin)o (ter)h(to)e(where)i(the)f(full)i(notice)e(is)h(found.)120 695 y Fp(one)f(line)i(to)e(giv)o(e)g(the)g(program's)f(name)h(and)h(a)f (brief)g(idea)h(of)f(what)g(it)g(do)q(es.)120 745 y Fr(Copyright)23 b(\(C\))g(19)p Fp(yy)51 b(name)16 b(of)e(author)120 844 y Fr(This)23 b(program)g(is)h(free)f(software;)g(you)g(can)h (redistribute)e(it)h(and/or)h(modify)120 894 y(it)g(under)f(the)g (terms)g(of)h(the)f(GNU)h(General)f(Public)g(License)g(as)g(published)g (by)120 944 y(the)g(Free)h(Software)f(Foundation;)f(either)h(version)g (2)h(of)f(the)h(License,)e(or)120 994 y(\(at)h(your)h(option\))f(any)g (later)g(version.)120 1093 y(This)g(program)g(is)h(distributed)e(in)i (the)f(hope)h(that)f(it)g(will)h(be)f(useful,)120 1143 y(but)g(WITHOUT)g(ANY)h(WARRANTY;)e(without)h(even)h(the)f(implied)g (warranty)g(of)120 1193 y(MERCHANTABILITY)f(or)h(FITNESS)g(FOR)h(A)f (PARTICULAR)g(PURPOSE.)47 b(See)23 b(the)120 1243 y(GNU)g(General)g (Public)g(License)g(for)h(more)f(details.)120 1342 y(You)g(should)g (have)h(received)f(a)g(copy)h(of)f(the)h(GNU)f(General)g(Public)g (License)120 1392 y(along)g(with)g(this)h(program;)f(if)g(not,)g(write) h(to)f(the)h(Free)f(Software)120 1442 y(Foundation,)f(Inc.,)i(675)f (Mass)g(Ave,)h(Cambridge,)e(MA)i(02139,)f(USA.)62 1527 y Fv(Also)16 b(add)f(information)h(on)f(ho)o(w)f(to)h(con)o(tact)f(y)o (ou)h(b)o(y)g(electronic)i(and)e(pap)q(er)h(mail.)62 1611 y(If)11 b(the)f(program)f(is)i(in)o(teractiv)o(e,)g(mak)o(e)f(it)g (output)g(a)g(short)g(notice)g(lik)o(e)i(this)e(when)h(it)f(starts)f (in)i(an)g(in)o(teractiv)o(e)0 1674 y(mo)q(de:)120 1746 y Fr(Gnomovision)22 b(version)h(69,)h(Copyright)e(\(C\))i(19)p Fp(yy)j(name)15 b(of)g(author)120 1796 y Fr(Gnomovision)22 b(comes)i(with)f(ABSOLUTELY)f(NO)i(WARRANTY;)f(for)g(details)g(type)g (`show)g(w'.)120 1845 y(This)g(is)h(free)f(software,)g(and)g(you)h(are) f(welcome)g(to)h(redistribute)e(it)120 1895 y(under)h(certain)g (conditions;)f(type)i(`show)f(c')h(for)f(details.)62 1980 y Fv(The)e(h)o(yp)q(othetical)g(commands)f(`)p Fr(show)14 b(w)p Fv(')19 b(and)i(`)p Fr(show)14 b(c)p Fv(')19 b(should)i(sho)o(w)f (the)g(appropriate)g(parts)f(of)h(the)0 2042 y(General)11 b(Public)i(License.)20 b(Of)11 b(course,)g(the)g(commands)g(y)o(ou)f (use)h(ma)o(y)f(b)q(e)i(called)g(something)f(other)f(than)h(`)p Fr(show)0 2105 y(w)p Fv(')k(and)g(`)p Fr(show)f(c)p Fv(';)h(they)g (could)h(ev)o(en)g(b)q(e)f(mouse-clic)o(ks)i(or)e(men)o(u)g (items|whatev)o(er)h(suits)f(y)o(our)g(program.)62 2189 y(Y)l(ou)g(should)g(also)f(get)g(y)o(our)f(emplo)o(y)o(er)h(\(if)h(y)o (ou)f(w)o(ork)f(as)g(a)h(programmer\))f(or)g(y)o(our)h(sc)o(ho)q(ol,)h (if)f(an)o(y)l(,)g(to)f(sign)0 2252 y(a)i(\\cop)o(yrigh)o(t)f (disclaimer")j(for)e(the)g(program,)f(if)h(necessary)l(.)21 b(Here)15 b(is)h(a)f(sample;)g(alter)g(the)h(names:)120 2324 y Fr(Yoyodyne,)23 b(Inc.,)g(hereby)g(disclaims)f(all)i(copyright)f (interest)f(in)i(the)f(program)120 2374 y(`Gnomovision')f(\(which)h (makes)g(passes)g(at)h(compilers\))e(written)h(by)h(James)f(Hacker.)120 2473 y Fp(signature)15 b(of)g(T)o(y)g(Co)q(on)p Fr(,)23 b(1)h(April)f(1989)120 2523 y(Ty)h(Coon,)f(President)f(of)i(Vice)62 2608 y Fv(This)16 b(General)g(Public)h(License)g(do)q(es)f(not)f(p)q (ermit)h(incorp)q(orating)g(y)o(our)e(program)h(in)o(to)g(proprietary)g (pro-)0 2670 y(grams.)21 b(If)16 b(y)o(our)f(program)g(is)h(a)g (subroutine)h(library)l(,)f(y)o(ou)g(ma)o(y)f(consider)i(it)f(more)f (useful)i(to)e(p)q(ermit)i(linking)p eop %%Page: 9 11 9 10 bop 0 -58 a Fv(GNU)15 b(GENERAL)h(PUBLIC)g(LICENSE)1177 b(9)0 183 y(proprietary)19 b(applications)h(with)g(the)f(library)l(.)32 b(If)19 b(this)g(is)h(what)e(y)o(ou)h(w)o(an)o(t)f(to)g(do,)h(use)h (the)f(GNU)f(Library)0 246 y(General)e(Public)h(License)g(instead)e(of) g(this)h(License.)p eop %%Page: 10 12 10 11 bop 0 -58 a Fv(10)1766 b(Octa)o(v)o(e)p eop %%Page: 11 13 11 12 bop 0 -58 a Fv(Chapter)15 b(1:)k(A)d(Brief)g(In)o(tro)q(duction)g (to)e(Octa)o(v)o(e)1054 b(11)0 183 y Fs(1)41 b(A)15 b(Brief)f(In)n(tro) r(duction)h(to)h(Octa)n(v)n(e)62 321 y Fv(This)g(man)o(ual)f(do)q (cumen)o(ts)h(ho)o(w)f(to)f(run,)h(install)i(and)e(p)q(ort)g(Octa)o(v)o (e,)g(and)g(ho)o(w)g(to)f(rep)q(ort)h(bugs.)62 405 y(Octa)o(v)o(e)i(is) h(a)f(high-lev)o(el)j(language,)d(primarily)i(in)o(tended)g(for)d(n)o (umerical)j(computations.)26 b(It)17 b(pro)o(vides)h(a)0 467 y(con)o(v)o(enien)o(t)f(command)g(line)h(in)o(terface)f(for)g (solving)g(linear)h(and)f(nonlinear)h(problems)g(n)o(umerically)l(,)h (and)e(for)0 529 y(p)q(erforming)f(other)e(n)o(umerical)j(exp)q(erimen) o(ts.)k(It)15 b(ma)o(y)f(also)i(b)q(e)f(used)h(as)f(a)g(batc)o(h-orien) o(ted)h(language.)62 613 y(This)g(do)q(cumen)o(t)g(corresp)q(onds)f(to) g(Octa)o(v)o(e)f(v)o(ersion)i(1.1.0.)0 750 y Fu(1.1)33 b(Running)17 b(Octa)n(v)n(e)62 855 y Fv(On)c(most)d(systems,)i(the)g(w) o(a)o(y)e(to)i(in)o(v)o(ok)o(e)f(Octa)o(v)o(e)h(is)g(with)g(the)g (shell)h(command)f(`)p Fr(octave)p Fv('.)17 b(Octa)o(v)o(e)11 b(displa)o(ys)0 917 y(an)k(initial)i(message)e(and)g(then)h(a)f(prompt) g(indicating)i(it)e(is)h(ready)f(to)f(accept)i(input.)21 b(Y)l(ou)15 b(can)g(b)q(egin)i(t)o(yping)0 980 y(Octa)o(v)o(e)e (commands)g(immediately)i(afterw)o(ard.)62 1064 y(If)e(y)o(ou)g(get)g (in)o(to)f(trouble,)i(y)o(ou)e(can)h(usually)i(in)o(terrupt)e(Octa)o(v) o(e)f(b)o(y)h(t)o(yping)g Fr(Control-C)f Fv(\(usually)i(written)0 1126 y Fr(C-c)e Fv(for)f(short\).)19 b Fr(C-c)14 b Fv(gets)f(its)i (name)f(from)f(the)i(fact)e(that)h(y)o(ou)f(t)o(yp)q(e)i(it)f(b)o(y)g (holding)i(do)o(wn)e(the)g Fr(CTRL)g Fv(k)o(ey)g(and)0 1188 y(then)i(pressing)f Fr(c)p Fv(.)20 b(Doing)15 b(this)h(will)h (normally)f(return)f(y)o(ou)g(to)f(Octa)o(v)o(e's)g(prompt.)62 1272 y(T)l(o)h(exit)h(Octa)o(v)o(e,)e(t)o(yp)q(e)i(`)p Fr(quit)p Fv(',)d(or)i(`)p Fr(exit)p Fv(')f(at)g(the)h(Octa)o(v)o(e)g (prompt.)62 1356 y(On)i(systems)f(that)g(supp)q(ort)g(job)h(con)o (trol,)f(y)o(ou)g(can)g(susp)q(end)i(Octa)o(v)o(e)e(b)o(y)h(sending)g (it)g(a)f Fr(SIGTSTP)f Fv(signal,)0 1418 y(usually)i(b)o(y)e(t)o(yping) g Fr(C-z)p Fv(.)0 1555 y Fu(1.2)33 b(Simple)15 b(Examples)62 1660 y Fv(The)f(follo)o(wing)f(c)o(hapters)g(describ)q(e)i(all)f(of)f (Octa)o(v)o(e's)f(features)h(in)h(detail,)g(but)f(b)q(efore)h(doing)f (that,)g(it)g(migh)o(t)0 1722 y(b)q(e)j(helpful)h(to)e(giv)o(e)g(a)g (sampling)h(of)f(some)g(of)g(its)g(capabilities.)62 1806 y(If)f(y)o(ou)f(are)g(new)g(to)g(Octa)o(v)o(e,)g(I)g(recommend)h(that)e (y)o(ou)h(try)g(these)h(examples)g(to)e(b)q(egin)j(learning)f(Octa)o(v) o(e)f(b)o(y)0 1868 y(using)k(it.)25 b(Lines)18 b(mark)o(ed)e(with)h(`)p Fr(octave:13>)p Fv(')d(are)j(lines)h(y)o(ou)e(t)o(yp)q(e,)h(ending)h (eac)o(h)f(with)g(a)f(carriage)g(return.)0 1931 y(Octa)o(v)o(e)f(will)i (resp)q(ond)e(with)h(an)f(answ)o(er,)f(or)h(b)o(y)g(displa)o(ying)i(a)e (graph.)0 2067 y Fu(Creating)g(a)g(Matrix)62 2172 y Fv(T)l(o)i(create)g (a)g(new)g(matrix)g(and)g(store)g(it)g(in)h(a)f(v)m(ariable)i(so)d (that)h(it)g(y)o(ou)g(can)g(refer)g(to)g(it)g(later,)h(t)o(yp)q(e)f (the)0 2234 y(command)120 2306 y Fr(octave:1>)23 b(a)g(=)h([)g(1,)f(1,) h(2;)g(3,)f(5,)h(8;)f(13,)h(21,)f(34)h(])0 2390 y Fv(Octa)o(v)o(e)15 b(will)j(resp)q(ond)e(b)o(y)f(prin)o(ting)i(the)f(matrix)f(in)i(neatly) f(aligned)h(columns.)22 b(Ending)16 b(a)g(command)f(with)h(a)0 2452 y(semicolon)g(tells)h(Octa)o(v)o(e)d(to)h(not)g(prin)o(t)g(the)g (result)h(of)f(a)g(command.)k(F)l(or)c(example)120 2524 y Fr(octave:2>)23 b(b)g(=)h(rand)f(\(3,)h(2\);)0 2608 y Fv(will)19 b(create)e(a)h(3)f(ro)o(w,)g(2)g(column)h(matrix)g(with)f (eac)o(h)h(elemen)o(t)g(set)g(to)e(a)i(random)f(v)m(alue)i(b)q(et)o(w)o (een)e(zero)h(and)0 2670 y(one.)p eop %%Page: 12 14 12 13 bop 0 -58 a Fv(12)1766 b(Octa)o(v)o(e)62 183 y(T)l(o)19 b(displa)o(y)h(the)f(v)m(alue)i(of)d(an)o(y)h(v)m(ariable,)i(simply)g (t)o(yp)q(e)e(the)g(name)g(of)g(the)g(v)m(ariable.)33 b(F)l(or)18 b(example,)j(to)0 246 y(displa)o(y)16 b(the)g(v)m(alue)g (stored)f(in)h(the)f(matrix)g(`)p Fr(b)p Fv(',)f(t)o(yp)q(e)h(the)g (command)120 316 y Fr(octave:3>)23 b(b)0 450 y Fu(Matrix)16 b(Arithmetic)62 554 y Fv(Octa)o(v)o(e)h(has)g(a)f(con)o(v)o(enien)o(t)i (op)q(erator)e(notation)h(for)f(p)q(erforming)i(matrix)e(arithmetic.)26 b(F)l(or)17 b(example,)h(to)0 617 y(m)o(ultiply)f(the)e(matrix)g Fr(a)g Fv(b)o(y)g(a)g(scalar)g(v)m(alue,)h(t)o(yp)q(e)f(the)h(command) 120 688 y Fr(octave:4>)23 b(2)g(*)h(a)62 771 y Fv(T)l(o)15 b(m)o(ultiply)i(the)e(t)o(w)o(o)f(matrices)h Fp(a)g Fv(and)h Fp(b)p Fv(,)f(t)o(yp)q(e)g(the)g(command)120 842 y Fr(octave:5>)23 b(a)g(*)h(b)62 925 y Fv(T)l(o)15 b(form)g(the)g(matrix)g(pro)q(duct)g Fo(a)657 909 y Fn(T)684 925 y Fo(a)p Fv(,)f(t)o(yp)q(e)i(the)f(command) 120 996 y Fr(octave:6>)23 b(a')g(*)h(a)0 1130 y Fu(Solving)17 b(Linear)f(Equations)62 1234 y Fv(T)l(o)f(solv)o(e)h(the)f(set)g(of)g (linear)h(equations)f Fm(Ax)e Fv(=)g Fm(b)p Fv(,)i(use)h(the)f(left)h (division)h(op)q(erator,)d(`)p Fr(\\)p Fv(':)120 1305 y Fr(octave:7>)23 b(a)g(\\)h(b)0 1388 y Fv(This)16 b(is)f(conceptually) i(equiv)m(alen)o(t)g(to)e Fm(A)719 1372 y Fl(\000)p Fk(1)764 1388 y Fm(b)p Fv(,)g(but)g(a)o(v)o(oids)g(computing)h(the)f(in)o(v)o (erse)h(of)e(a)h(matrix)g(directly)l(.)62 1472 y(If)d(the)f(co)q (e\016cien)o(t)h(matrix)e(is)i(singular,)g(Octa)o(v)o(e)f(will)h(prin)o (t)g(a)e(w)o(arning)h(message)g(and)g(compute)g(a)g(minim)o(um)0 1534 y(norm)k(solution.)0 1668 y Fu(In)n(tegrating)h(Di\013eren)n(tial) h(Equations)62 1772 y Fv(Octa)o(v)o(e)e(has)g(built-in)j(functions)e (for)e(solving)i(nonlinear)h(di\013eren)o(tial)f(equations)g(of)f(the)g (form)618 1868 y Fo(dx)p 618 1889 50 2 v 623 1930 a(dt)686 1899 y Fv(=)e Fo(f)5 b Fv(\()p Fo(x;)j(t)p Fv(\))p Fo(;)97 b Fv(with)p Fo(x)p Fv(\()p Fo(t)13 b Fv(=)g Fo(t)1195 1906 y Fk(0)1214 1899 y Fv(\))f(=)h Fo(x)1318 1906 y Fk(0)0 2039 y Fv(F)l(or)j(Octa)o(v)o(e)g(to)f(in)o(tegrate)h(equations) h(of)f(this)h(form,)e(y)o(ou)h(m)o(ust)g(\014rst)g(pro)o(vide)h(a)f (de\014nition)i(of)e(the)g(function)0 2101 y Fo(f)5 b Fv(\()p Fo(x;)j(t)p Fv(\).)23 b(This)18 b(is)f(straigh)o(tforw)o(ard,)d (and)j(ma)o(y)f(b)q(e)i(accomplished)g(b)o(y)f(en)o(tering)g(the)g (function)g(b)q(o)q(dy)h(directly)0 2163 y(on)13 b(the)h(command)f (line.)21 b(F)l(or)13 b(example,)h(the)f(follo)o(wing)h(commands)f (de\014ne)i(the)e(righ)o(t)g(hand)h(side)g(function)h(for)0 2226 y(an)g(in)o(teresting)g(pair)g(of)f(nonlinear)i(di\013eren)o(tial) g(equations.)k(Note)14 b(that)g(while)i(y)o(ou)e(are)g(en)o(tering)h(a) f(function,)0 2288 y(Octa)o(v)o(e)k(resp)q(onds)g(with)g(a)g (di\013eren)o(t)g(prompt,)g(to)f(indicate)j(that)d(it)h(is)h(w)o (aiting)f(for)f(y)o(ou)h(to)f(complete)h(y)o(our)0 2350 y(input.)120 2421 y Fr(octave:8>)23 b(function)f(xdot)i(=)f(f)h(\(x,)g (t\))120 2471 y(>)120 2521 y(>)48 b(r)23 b(=)h(0.25;)120 2570 y(>)48 b(k)23 b(=)h(1.4;)120 2620 y(>)48 b(a)23 b(=)h(1.5;)120 2670 y(>)48 b(b)23 b(=)h(0.16;)p eop %%Page: 13 15 13 14 bop 0 -58 a Fv(Chapter)15 b(1:)k(A)d(Brief)g(In)o(tro)q(duction)g (to)e(Octa)o(v)o(e)1054 b(13)120 183 y Fr(>)48 b(c)23 b(=)h(0.9;)120 233 y(>)48 b(d)23 b(=)h(0.8;)120 283 y(>)120 333 y(>)48 b(xdot\(1\))22 b(=)i(r*x\(1\)*\(1)f(-)h(x\(1\)/k\))e(-)i (a*x\(1\)*x\(2\)/\(1)e(+)i(b*x\(1\)\);)120 382 y(>)48 b(xdot\(2\))22 b(=)i(c*a*x\(1\)*x\(2\)/\(1)e(+)i(b*x\(1\)\))f(-)g (d*x\(2\);)120 432 y(>)120 482 y(>)h(endfunction)0 570 y Fv(Giv)o(en)16 b(the)f(initial)i(condition)120 645 y Fr(x0)24 b(=)f([1;)h(2];)0 733 y Fv(and)15 b(the)g(set)f(of)g(output) h(times)g(as)f(a)g(column)i(v)o(ector)e(\(note)g(that)g(the)h(\014rst)f (output)h(time)g(corresp)q(onds)g(to)f(the)0 795 y(initial)j(condition) g(giv)o(en)e(ab)q(o)o(v)o(e\))120 871 y Fr(t)24 b(=)f(linspace)g(\(0,)h (50,)f(200\)';)0 958 y Fv(it)15 b(is)h(easy)f(to)g(in)o(tegrate)g(the)g (set)g(of)g(di\013eren)o(tial)h(equations:)120 1034 y Fr(x)24 b(=)f(lsode)h(\("f",)f(x0,)g(t\);)0 1121 y Fv(The)12 b(function)i(`)p Fr(lsode)p Fv(')c(uses)j(the)f(Liv)o(ermore)h(Solv)o (er)f(for)g(Ordinary)h(Di\013eren)o(tial)g(Equations,)f(describ)q(ed)i (in)f(A.)0 1184 y(C.)j(Hindmarsh,)i Fp(ODEP)l(A)o(CK,)f(a)g (Systematized)g(Collection)i(of)d(ODE)h(Solv)o(ers)p Fv(,)h(in:)24 b(Scien)o(ti\014c)19 b(Computing,)0 1246 y(R.)c(S.)g(Stepleman)h(et)g(al.)k(\(Eds.\),)14 b(North-Holland,)h (Amsterdam,)g(1983,)e(pages)i(55{64.)0 1398 y Fu(Pro)r(ducing)h (Graphical)h(Output)62 1506 y Fv(T)l(o)e(displa)o(y)h(the)g(solution)g (of)e(the)i(previous)g(example)g(graphically)l(,)g(use)g(the)f(command) 120 1581 y Fr(plot)23 b(\(t,)h(x\))62 1669 y Fv(If)16 b(y)o(ou)f(are)g(using)h(the)f(X)h(Windo)o(w)f(System,)g(Octa)o(v)o(e)g (will)i(automatically)e(create)g(a)g(separate)g(windo)o(w)h(to)0 1732 y(displa)o(y)e(the)f(plot.)20 b(If)13 b(y)o(ou)g(are)g(using)h(a)f (terminal)h(that)e(supp)q(orts)h(some)g(other)g(graphics)g(commands,)g (y)o(ou)g(will)0 1794 y(need)j(to)f(tell)h(Octa)o(v)o(e)f(what)f(kind)j (of)d(terminal)i(y)o(ou)f(ha)o(v)o(e.)20 b(T)o(yp)q(e)15 b(the)g(command)120 1869 y Fr(set)23 b(term)0 1957 y Fv(to)17 b(see)i(a)f(list)h(of)e(the)h(supp)q(orted)h(terminal)g(t)o (yp)q(es.)29 b(Octa)o(v)o(e)17 b(uses)i Fr(gnuplot)e Fv(to)g(displa)o(y)j(graphics,)f(and)f(can)0 2019 y(displa)o(y)e (graphics)g(on)f(an)o(y)g(terminal)h(that)e(is)i(supp)q(orted)g(b)o(y)f Fr(gnuplot)p Fv(.)62 2107 y(T)l(o)g(capture)g(the)g(output)f(of)h(the)g (plot)g(command)g(in)g(a)g(\014le)h(rather)e(than)h(sending)h(the)f (output)f(directly)j(to)0 2169 y(y)o(our)e(terminal,)g(y)o(ou)g(can)g (use)h(a)f(set)g(of)g(commands)g(lik)o(e)h(this)120 2253 y Fr(set)23 b(term)h(postscript)120 2315 y(set)f(output)g("foo.ps")120 2377 y(replot)0 2458 y Fv(This)d(will)g(w)o(ork)f(for)f(other)h(t)o(yp) q(es)g(of)g(output)g(devices)h(as)f(w)o(ell.)32 b(Octa)o(v)o(e's)19 b(`)p Fr(set)p Fv(')f(command)h(is)g(really)h(just)0 2520 y(pip)q(ed)g(to)e(the)h Fr(gnuplot)e Fv(subpro)q(cess,)j(so)e (that)g(once)g(y)o(ou)g(ha)o(v)o(e)h(a)f(plot)g(on)h(the)f(screen)h (that)f(y)o(ou)g(lik)o(e,)i(y)o(ou)0 2582 y(should)c(b)q(e)f(able)h(to) e(do)h(something)g(lik)o(e)h(this)g(to)e(create)h(an)f(output)h(\014le) h(suitable)g(for)e(y)o(our)h(graphics)g(prin)o(ter.)62 2670 y(Or,)g(y)o(ou)g(can)g(eliminate)i(the)f(in)o(termediate)g(\014le) g(b)o(y)f(using)h(commands)f(lik)o(e)h(this)p eop %%Page: 14 16 14 15 bop 0 -58 a Fv(14)1766 b(Octa)o(v)o(e)120 183 y Fr(set)23 b(term)h(postscript)120 246 y(set)f(output)g("|lpr)h (-Pname_of_your_graphics_)o(printer)o(")120 308 y(replot)0 481 y Fu(Editing)17 b(What)f(Y)-6 b(ou)15 b(Ha)n(v)n(e)g(T)n(yp)r(ed)62 594 y Fv(A)o(t)j(the)h(Octa)o(v)o(e)f(prompt,)g(y)o(ou)h(can)f(recall,) i(edit,)g(and)f(reissue)g(previous)h(commands)e(using)h(Emacs-)f(or)0 656 y(vi-st)o(yle)f(editing)h(commands.)23 b(The)17 b(default)g(k)o (eybindings)h(use)e(Emacs-st)o(yle)h(commands.)23 b(F)l(or)16 b(example,)h(to)0 719 y(recall)h(the)f(previous)h(command,)e(t)o(yp)q (e)h Fr(Control-P)f Fv(\(usually)i(written)f Fr(C-p)f Fv(for)g(short\).)24 b Fr(C-p)17 b Fv(gets)f(its)h(name)0 781 y(from)e(the)h(fact)f(that)g(y)o(ou)g(t)o(yp)q(e)h(it)g(b)o(y)g (holding)h(do)o(wn)e(the)h Fr(CTRL)f Fv(k)o(ey)h(and)g(then)g(pressing) g Fr(p)p Fv(.)21 b(Doing)16 b(this)g(will)0 843 y(normally)h(bring)h (bac)o(k)e(the)h(previous)h(line)g(of)f(input.)25 b Fr(C-n)17 b Fv(will)h(bring)f(up)h(the)e(next)h(line)i(of)d(input,)i Fr(C-b)e Fv(will)0 905 y(mo)o(v)o(e)e(the)i(cursor)f(bac)o(kw)o(ard)f (on)h(the)g(line,)i Fr(C-f)e Fv(will)h(mo)o(v)o(e)f(the)g(cursor)g (forw)o(ard)f(on)h(the)g(line,)i(etc.)62 998 y(A)h(complete)g (description)h(of)e(the)h(command)g(line)h(editing)g(capabilit)o(y)g (is)f(giv)o(en)g(in)g(this)g(man)o(ual)g(in)h(Ap-)0 1060 y(p)q(endix)e(App)q(endix)g(C)e([Command)g(Line)h(Editing],)g(page)f (173.)0 1231 y Fu(Getting)h(Help)62 1344 y Fv(Octa)o(v)o(e)e(has)f(an)h (extensiv)o(e)g(help)h(facilit)o(y)l(.)21 b(The)14 b(same)f(do)q(cumen) o(tation)h(that)f(is)h(a)o(v)m(ailable)i(in)e(prin)o(ted)h(form)0 1406 y(is)k(also)g(a)o(v)m(ailable)i(from)d(the)h(Octa)o(v)o(e)f (prompt,)h(b)q(ecause)h(b)q(oth)f(forms)f(of)g(the)h(do)q(cumen)o (tation)g(are)g(created)0 1468 y(from)14 b(the)i(same)f(input)h (\014le.)62 1561 y(In)i(order)f(to)g(get)f(go)q(o)q(d)i(help)g(y)o(ou)f (\014rst)g(need)h(to)f(kno)o(w)f(the)i(name)f(of)g(the)g(command)g (that)g(y)o(ou)f(w)o(an)o(t)h(to)0 1623 y(use.)30 b(This)19 b(name)f(of)g(the)h(function)g(ma)o(y)f(not)g(alw)o(a)o(ys)f(b)q(e)i (ob)o(vious,)g(but)g(a)f(go)q(o)q(d)g(place)i(to)d(start)h(is)g(to)g (just)0 1685 y(t)o(yp)q(e)e Fr(help)p Fv(.)21 b(This)c(will)g(sho)o(w)e (y)o(ou)h(all)h(the)f(op)q(erators,)e(reserv)o(ed)i(w)o(ords,)f (functions,)i(built-in)h(v)m(ariables,)f(and)0 1748 y(function)e (\014les.)21 b(Y)l(ou)14 b(can)h(then)g(get)f(more)g(help)h(on)g(an)o (ything)f(that)g(is)h(listed)g(b)o(y)g(simply)g(including)i(the)e(name) 0 1810 y(as)g(an)g(argumen)o(t)f(to)h(help.)21 b(F)l(or)15 b(example,)120 1890 y Fr(help)23 b(plot)0 1982 y Fv(will)17 b(displa)o(y)f(the)f(help)i(text)e(for)f(the)h Fr(plot)g Fv(function.)62 2075 y(Octa)o(v)o(e)j(sends)h(output)f(that)f(is)i(to)q (o)e(long)i(to)e(\014t)i(on)f(one)g(screen)h(through)f(a)f(pager)h(lik) o(e)i Fr(less)d Fv(or)h Fr(more)p Fv(.)0 2137 y(T)o(yp)q(e)e(a)f (carriage)g(return)g(to)g(adv)m(ance)h(one)f(line,)i(a)e(space)g(c)o (haracter)g(to)g(adv)m(ance)h(one)f(page,)g(and)g(`)p Fr(q)p Fv(')g(to)g(exit)0 2199 y(the)g(pager.)0 2370 y Fu(Help)g(via)h(Info)62 2483 y Fv(The)c(part)f(of)g(Octa)o(v)o(e's)g (help)h(facilit)o(y)h(that)e(allo)o(ws)h(y)o(ou)f(to)g(read)g(the)h (complete)g(text)f(of)g(the)h(prin)o(ted)g(man)o(ual)0 2545 y(from)i(within)h(Octa)o(v)o(e)f(uses)h(a)f(program)f(called)j (Info.)k(When)15 b(y)o(ou)f(in)o(v)o(ok)o(e)g(Info)h(y)o(ou)f(will)i(b) q(e)f(put)f(in)o(to)h(a)f(men)o(u)0 2608 y(driv)o(en)20 b(program)e(that)g(con)o(tains)i(the)f(en)o(tire)g(Octa)o(v)o(e)g(man)o (ual.)32 b(Help)20 b(for)f(using)h(Info)f(is)h(pro)o(vided)g(in)g(this) 0 2670 y(man)o(ual)15 b(in)h(App)q(endix)i(App)q(endix)f(D)e([Using)g (Info],)g(page)g(183.)p eop %%Page: 15 17 15 16 bop 0 -58 a Fv(Chapter)15 b(1:)k(A)d(Brief)g(In)o(tro)q(duction)g (to)e(Octa)o(v)o(e)1054 b(15)0 183 y Fu(1.3)33 b(Executable)16 b(Octa)n(v)n(e)f(Programs)62 289 y Fv(Once)i(y)o(ou)f(ha)o(v)o(e)f (learned)i(Octa)o(v)o(e,)f(y)o(ou)f(ma)o(y)h(w)o(an)o(t)f(to)g(write)h (self-con)o(tained)h(Octa)o(v)o(e)f(scripts,)g(using)h(the)0 351 y(`)p Fr(#!)p Fv(')d(script)i(mec)o(hanism.)k(Y)l(ou)c(can)f(do)g (this)h(on)f(man)o(y)g(Unix)h(systems)1247 335 y Fk(1)1280 351 y Fv(\(and)f(someda)o(y)g(on)g(GNU\).)62 436 y(F)l(or)g(example,)g (y)o(ou)g(could)i(create)e(a)f(text)h(\014le)h(named)g(`)p Fr(hello)p Fv(',)d(con)o(taining)j(the)f(follo)o(wing)h(lines:)120 509 y Fr(#!)24 b(/usr/local/bin/octave)d(-qf)120 608 y(#)j(a)f(sample)g(Octave)h(program)120 658 y(printf)f(\("Hello,)g (world!\\n"\);)0 743 y Fv(After)15 b(making)g(this)h(\014le)g (executable)h(\(with)e(the)g Fr(chmod)f Fv(command\),)h(y)o(ou)g(can)g (simply)i(t)o(yp)q(e:)120 815 y Fr(hello)0 900 y Fv(at)e(the)g(shell,)h (and)g(the)f(system)g(will)i(arrange)d(to)g(run)i(Octa)o(v)o(e)1095 884 y Fk(2)1128 900 y Fv(as)f(if)h(y)o(ou)f(had)g(t)o(yp)q(ed:)120 973 y Fr(octave)23 b(hello)0 1058 y Fv(Self-con)o(tained)16 b(Octa)o(v)o(e)f(scripts)g(are)f(useful)i(when)g(y)o(ou)e(w)o(an)o(t)g (to)g(write)h(a)f(program)g(whic)o(h)h(users)g(can)g(in)o(v)o(ok)o(e)0 1120 y(without)g(kno)o(wing)g(that)g(the)g(program)f(is)i(written)f(in) h(the)g(Octa)o(v)o(e)e(language.)0 1260 y Fu(1.4)33 b(Comm)n(en)n(ts)12 b(in)k(Octa)n(v)n(e)f(Programs)62 1366 y Fv(A)e Fp(commen)o(t)g Fv(is)g(some)g(text)f(that)g(is)h(included)i(in)f(a)e(program)g(for)g (the)h(sak)o(e)f(of)g(h)o(uman)h(readers,)g(and)f(that)g(is)0 1428 y(not)j(really)h(part)f(of)g(the)h(program.)j(Commen)o(ts)c(can)g (explain)i(what)e(the)g(program)g(do)q(es,)g(and)h(ho)o(w)f(it)g(w)o (orks.)0 1490 y(Nearly)j(all)g(programming)f(languages)g(ha)o(v)o(e)g (pro)o(visions)h(for)f(commen)o(ts,)g(b)q(ecause)h(programs)e(are)i(t)o (ypically)0 1553 y(hard)d(to)g(understand)g(without)h(them.)62 1638 y(In)c(the)g(Octa)o(v)o(e)f(language,)g(a)g(commen)o(t)g(starts)f (with)i(either)g(the)f(sharp)h(sign)f(c)o(haracter,)g(`)p Fr(#)p Fv(',)g(or)g(the)g(p)q(ercen)o(t)0 1700 y(sym)o(b)q(ol)17 b(`)p Fr(\045)p Fv(')f(and)h(con)o(tin)o(ues)h(to)e(the)h(end)h(of)e (the)h(line.)27 b(The)17 b(Octa)o(v)o(e)f(in)o(terpreter)i(ignores)f (the)g(rest)f(of)h(a)f(line)0 1762 y(follo)o(wing)i(a)f(sharp)g(sign)h (or)f(p)q(ercen)o(t)g(sym)o(b)q(ol.)27 b(F)l(or)17 b(example,)h(w)o(e)f (could)h(ha)o(v)o(e)f(put)g(the)h(follo)o(wing)g(in)o(to)f(the)0 1824 y(function)f Fr(f)p Fv(:)120 1897 y Fr(function)23 b(xdot)g(=)h(f)g(\(x,)f(t\))120 1996 y(#)h(usage:)f(f)g(\(x,)h(t\))p 0 2053 600 2 v 21 2092 a Fk(1)62 2108 y Fv(The)17 b(`)p Fr(#!)p Fv(')f(mec)o(hanism)h(w)o(orks)e(on)i(Unix)g(systems)f(deriv)o (ed)i(from)e(Berk)o(eley)h(Unix,)h(System)e(V)h(Release)h(4,)62 2170 y(and)e(some)f(System)g(V)g(Release)h(3)f(systems.)21 2216 y Fk(2)62 2233 y Fv(The)g(line)i(b)q(eginning)g(with)e(`)p Fr(#!)p Fv(')f(lists)i(the)f(full)h(\014le)g(name)f(of)f(an)h(in)o (terpreter)g(to)f(b)q(e)i(run,)f(and)g(an)f(optional)62 2295 y(initial)j(command)d(line)j(argumen)o(t)c(to)h(pass)h(to)f(that)g (in)o(terpreter.)19 b(The)c(op)q(erating)g(system)f(then)h(runs)g(the) 62 2357 y(in)o(terpreter)j(with)g(the)f(giv)o(en)h(argumen)o(t)f(and)g (the)h(full)h(argumen)o(t)d(list)i(of)f(the)h(executed)g(program.)26 b(The)62 2419 y(\014rst)15 b(argumen)o(t)g(in)h(the)f(list)h(is)g(the)g (full)g(\014le)h(name)e(of)g(the)g(Octa)o(v)o(e)g(program.)k(The)d (rest)e(of)h(the)h(argumen)o(t)62 2482 y(list)h(will)h(either)f(b)q(e)g (options)f(to)g(Octa)o(v)o(e,)g(or)f(data)h(\014les,)h(or)f(b)q(oth.)23 b(The)16 b Fr(-qf)g Fv(option)g(is)h(usually)h(sp)q(eci\014ed)62 2544 y(in)j(stand-alone)g(Octa)o(v)o(e)f(programs)f(to)g(prev)o(en)o(t) h(them)g(from)g(prin)o(ting)h(the)f(normal)g(startup)g(message,)62 2606 y(and)g(to)e(k)o(eep)i(them)f(from)g(b)q(eha)o(ving)h(di\013eren)o (tly)g(dep)q(ending)h(on)f(the)f(con)o(ten)o(ts)g(of)f(a)h(particular)h (user's)62 2668 y(`)p Fr(~/.octaverc)p Fv(')13 b(\014le.)21 b(See)16 b(Chapter)f(2)g([In)o(v)o(oking)g(Octa)o(v)o(e],)f(page)h(19.) p eop %%Page: 16 18 16 17 bop 0 -58 a Fv(16)1766 b(Octa)o(v)o(e)120 183 y Fr(#)120 233 y(#)24 b(This)f(function)g(defines)g(the)g (right-hand-side)f(functions)h(for)g(a)h(set)f(of)120 283 y(#)h(nonlinear)e(differential)h(equations.)168 382 y(r)g(=)h(0.25)168 482 y(and)f(so)h(on...)120 582 y(endfunction)62 671 y Fv(The)14 b Fr(help)e Fv(command)h(\(see)g(Chapter)g(26)g ([Help],)g(page)g(151\))f(is)i(able)g(to)e(\014nd)i(the)f(\014rst)g (blo)q(c)o(k)h(of)f(commen)o(ts)0 733 y(in)i(a)f(function)g(\(ev)o(en)h (those)e(that)h(are)f(comp)q(osed)i(directly)g(on)f(the)g(command)g (line\).)21 b(This)15 b(means)f(that)f(users)0 795 y(of)g(Octa)o(v)o(e) g(can)h(use)g(the)g(same)f(commands)h(to)f(get)g(help)i(for)e(built-in) j(functions,)e(and)g(for)f(functions)h(that)f(y)o(ou)0 857 y(ha)o(v)o(e)i(de\014ned.)21 b(F)l(or)15 b(example,)g(after)g (de\014ning)h(the)g(function)g Fr(f)f Fv(ab)q(o)o(v)o(e,)f(the)h (command)120 934 y Fr(help)23 b(f)0 1023 y Fv(pro)q(duces)16 b(the)f(output)144 1099 y Fr(usage:)23 b(f)h(\(x,)f(t\))144 1199 y(This)g(function)g(defines)g(the)g(right-hand-side)f(functions)h (for)g(a)h(set)f(of)144 1248 y(nonlinear)f(differential)h(equations.)62 1337 y Fv(Although)17 b(it)f(is)h(p)q(ossible)h(to)d(put)i(commen)o(t)e (lines)j(in)o(to)e(k)o(eyb)q(oard-comp)q(osed)h(thro)o(w-a)o(w)o(a)o(y) c(Octa)o(v)o(e)j(pro-)0 1400 y(grams,)i(it)h(usually)h(isn't)f(v)o(ery) g(useful,)h(b)q(ecause)g(the)f(purp)q(ose)g(of)f(a)h(commen)o(t)f(is)h (to)g(help)h(y)o(ou)e(or)g(another)0 1462 y(p)q(erson)e(understand)f (the)h(program)e(at)g(a)h(later)g(time.)0 1618 y Fu(1.5)33 b(Errors)62 1728 y Fv(There)15 b(are)g(t)o(w)o(o)e(classes)j(of)e (errors)g(that)g(Octa)o(v)o(e)g(pro)q(duces)i(when)f(it)g(encoun)o (ters)g(input)h(that)e(it)h(is)h(unable)0 1790 y(to)f(understand,)g(or) g(when)g(it)h(is)f(unable)i(to)d(p)q(erform)h(an)h(action.)62 1879 y(A)h Fp(parse)g(error)j Fv(o)q(ccurs)d(if)h(Octa)o(v)o(e)f (cannot)g(understand)g(something)h(y)o(ou)e(ha)o(v)o(e)h(t)o(yp)q(ed.) 26 b(F)l(or)16 b(example,)i(if)0 1941 y(y)o(ou)d(missp)q(ell)i(a)e(k)o (eyw)o(ord,)120 2017 y Fr(octave:13>)22 b(functon)h(y)h(=)g(f)g(\(x\))f (y)h(=)f(x^2;)h(endfunction)0 2106 y Fv(Octa)o(v)o(e)15 b(will)i(resp)q(ond)e(immediately)i(with)f(a)f(message)f(lik)o(e)j (this:)120 2183 y Fr(parse)23 b(error:)168 2282 y(functon)g(y)g(=)h(f)g (\(x\))f(y)h(=)g(x^2;)f(endfunction)359 2332 y(^)0 2421 y Fv(F)l(or)15 b(most)f(parse)h(errors,)g(Octa)o(v)o(e)g(uses)g(a)g (caret)g(\(`)p Fr(^)p Fv('\))f(to)g(mark)h(the)h(p)q(oin)o(t)f(on)h (the)f(line)i(where)f(it)f(w)o(as)g(unable)0 2483 y(to)f(mak)o(e)g (sense)h(of)f(y)o(our)g(input.)21 b(In)15 b(this)g(case,)f(Octa)o(v)o (e)h(generated)f(an)h(error)e(message)i(b)q(ecause)g(the)g(k)o(eyw)o (ord)0 2545 y Fr(function)k Fv(w)o(as)h(missp)q(elled.)38 b(Instead)21 b(of)f(seeing)h(`)p Fr(function)14 b(f)p Fv(',)21 b(Octa)o(v)o(e)f(sa)o(w)f(t)o(w)o(o)g(consecutiv)o(e)j(v)m (ariable)0 2608 y(names,)13 b(whic)o(h)h(is)g(in)o(v)m(alid)h(in)f (this)f(con)o(text.)19 b(It)13 b(mark)o(ed)g(the)g(error)f(at)h(the)g Fr(y)g Fv(b)q(ecause)h(the)f(\014rst)g(name)g(b)o(y)g(itself)0 2670 y(w)o(as)h(accepted)i(as)f(v)m(alid)i(input.)p eop %%Page: 17 19 17 18 bop 0 -58 a Fv(Chapter)15 b(1:)k(A)d(Brief)g(In)o(tro)q(duction)g (to)e(Octa)o(v)o(e)1054 b(17)62 183 y(Another)18 b(class)g(of)f(error)g (message)g(o)q(ccurs)h(o)q(ccurs)g(at)f(ev)m(aluation)i(time.)28 b(These)18 b(errors)f(are)g(called)j Fp(run-)0 246 y(time)e(errors)p Fv(,)f(or)g(sometimes)g Fp(ev)m(aluation)i(errors)f Fv(b)q(ecause)h (they)e(o)q(ccur)h(when)g(y)o(our)f(program)f(is)i(b)q(eing)h Fp(run)p Fv(,)0 308 y(or)d Fp(ev)m(aluated)p Fv(.)24 b(F)l(or)16 b(example,)h(if)g(after)e(correcting)i(the)f(mistak)o(e)g (in)i(the)e(previous)h(function)g(de\014nition,)h(y)o(ou)0 370 y(t)o(yp)q(e)120 441 y Fr(octave:13>)k(f)i(\(\))0 524 y Fv(Octa)o(v)o(e)15 b(will)i(resp)q(ond)e(with)120 594 y Fr(error:)23 b(`x')g(undefined)g(near)g(line)h(1)f(column)h(24) 120 644 y(error:)f(evaluating)g(expression)f(near)h(line)h(1,)f(column) g(24)120 694 y(error:)g(evaluating)g(assignment)f(expression)h(near)g (line)g(1,)h(column)f(22)120 744 y(error:)g(called)g(from)g(`f')62 827 y Fv(This)14 b(error)f(message)h(has)f(sev)o(eral)h(parts,)f(and)h (giv)o(es)f(y)o(ou)h(quite)g(a)f(bit)h(of)g(information)f(to)g(help)i (y)o(ou)f(lo)q(cate)0 889 y(the)19 b(source)f(of)g(the)h(error.)29 b(The)18 b(messages)g(are)g(generated)h(from)f(the)g(p)q(oin)o(t)h(of)f (the)h(innermost)g(error,)f(and)0 951 y(pro)o(vide)e(a)f(tracebac)o(k)f (of)h(enclosing)i(expression)f(and)f(function)h(calls.)62 1034 y(In)d(the)f(example)g(ab)q(o)o(v)o(e,)g(the)g(\014rst)f(line)j (indicates)f(that)e(a)h(v)m(ariable)h(named)f(`)p Fr(x)p Fv(')f(w)o(as)g(found)h(to)g(b)q(e)g(unde\014ned)0 1096 y(near)17 b(line)i(1)e(and)g(column)h(24)f(of)g(some)g(function)h(or)e (expression.)27 b(F)l(or)17 b(errors)f(o)q(ccurring)i(within)h (functions,)0 1159 y(lines)13 b(are)f(n)o(um)o(b)q(ered)h(b)q(eginning) h(with)e(the)g(line)h(con)o(taining)g(the)f(`)p Fr(function)p Fv(')e(k)o(eyw)o(ord.)18 b(F)l(or)11 b(errors)g(o)q(ccurring)0 1221 y(at)j(the)h(top)f(lev)o(el,)i(the)e(line)j(n)o(um)o(b)q(er)e (indicates)h(the)e(input)i(line)g(n)o(um)o(b)q(er,)f(whic)o(h)g(is)h (usually)g(displa)o(y)o(ed)f(in)h(the)0 1283 y(prompt)f(string.)62 1366 y(The)e(second)g(and)g(third)h(lines)g(in)g(the)e(example)i (indicate)g(that)e(the)h(error)f(o)q(ccurred)h(within)h(an)f(assignmen) o(t)0 1429 y(expression,)23 b(and)f(the)g(last)f(line)i(of)e(the)h (error)e(message)h(indicates)i(that)e(the)g(error)g(o)q(ccurred)h (within)h(the)0 1491 y(function)c(`)p Fr(f)p Fv('.)28 b(If)19 b(the)f(function)h(`)p Fr(f)p Fv(')e(had)i(b)q(een)g(called)h (from)d(another)h(function,)h(sa)o(y)f(`)p Fr(g)p Fv(',)g(the)g(list)h (of)f(errors)0 1553 y(w)o(ould)e(ha)o(v)o(e)e(ended)j(with)e(one)h (more)e(line:)120 1624 y Fr(error:)23 b(called)g(from)g(`g')62 1707 y Fv(These)d(lists)g(of)f(function)h(calls)g(usually)h(mak)o(e)d (it)i(fairly)g(easy)f(to)g(trace)f(the)i(path)f(y)o(our)f(program)h(to) q(ok)0 1769 y(b)q(efore)c(the)h(error)e(o)q(ccurred,)i(and)f(to)g (correct)f(the)i(error)e(b)q(efore)i(trying)f(again.)p eop %%Page: 18 20 18 19 bop 0 -58 a Fv(18)1766 b(Octa)o(v)o(e)p eop %%Page: 19 21 19 20 bop 0 -58 a Fv(Chapter)15 b(2:)k(In)o(v)o(oking)d(Octa)o(v)o(e) 1349 b(19)0 183 y Fs(2)41 b(In)n(v)n(oking)13 b(Octa)n(v)n(e)62 331 y Fv(Normally)l(,)g(Octa)o(v)o(e)f(is)h(used)g(in)o(teractiv)o(ely) h(b)o(y)e(running)h(the)g(program)e(`)p Fr(octave)p Fv(')g(without)h (an)o(y)g(argumen)o(ts.)0 393 y(Once)k(started,)e(Octa)o(v)o(e)h(reads) g(commands)g(from)g(the)g(terminal)h(un)o(til)g(y)o(ou)f(tell)h(it)g (to)e(exit.)62 479 y(Y)l(ou)h(can)h(also)e(sp)q(ecify)j(the)e(name)g (of)f(a)h(\014le)h(on)f(the)g(command)g(line,)h(and)f(Octa)o(v)o(e)g (will)h(read)f(and)g(execute)0 541 y(the)g(commands)g(from)g(the)g (named)g(\014le)i(and)e(then)h(exit)f(when)h(it)f(is)h(\014nished.)62 627 y(Y)l(ou)h(can)f(further)g(con)o(trol)g(ho)o(w)f(Octa)o(v)o(e)h (starts)f(up)i(b)o(y)f(using)h(the)f(command-line)i(options)e(describ)q (ed)i(in)0 689 y(the)d(next)h(section,)f(and)g(Octa)o(v)o(e)g(itself)h (can)g(remind)g(y)o(ou)f(of)f(the)i(options)f(a)o(v)m(ailable.)22 b(T)o(yp)q(e)120 763 y Fr(octave)h(--help)0 849 y Fv(to)15 b(displa)o(y)h(all)g(a)o(v)m(ailable)h(options)e(and)h(brie\015y)g (describ)q(e)h(their)e(use)h(\(`)p Fr(octave)e(-h)p Fv(')g(is)i(a)f (shorter)f(equiv)m(alen)o(t\).)0 993 y Fu(2.1)33 b(Comm)n(and)12 b(Line)17 b(Options)0 1116 y Fr(--debug)0 1178 y(-d)192 b Fv(En)o(ter)16 b(parser)f(debugging)j(mo)q(de.)23 b(Using)16 b(this)h(option)f(will)i(cause)e(Octa)o(v)o(e's)g(parser)f(to)h(prin)o (t)g(a)240 1240 y(lot)f(of)f(information)g(ab)q(out)h(the)f(commands)h (it)f(reads,)h(and)f(is)h(probably)g(only)g(useful)h(if)f(y)o(ou)f(are) 240 1302 y(actually)i(trying)f(to)g(debug)h(the)f(parser.)0 1395 y Fr(--help)0 1458 y(-h)0 1520 y(-?)192 b Fv(Prin)o(t)15 b(short)g(help)h(message)f(and)g(exit.)0 1613 y Fr(--ignore-init-file)0 1675 y(--norc)0 1737 y(-f)192 b Fv(Don't)14 b(read)h(an)o(y)g(of)g(the) g(system)g(or)g(user)g(initialization)j(\014les)e(at)f(startup.)0 1830 y Fr(--info-file)f Fp(\014lename)240 1893 y Fv(Sp)q(ecify)f(the)f (name)g(of)f(the)h(info)g(\014le)h(to)e(use.)19 b(The)12 b(v)m(alue)h(of)e Fp(\014lename)16 b Fv(sp)q(eci\014ed)e(on)d(the)h (command)240 1955 y(line)17 b(will)h(o)o(v)o(erride)d(an)o(y)h(v)m (alue)h(of)e(`)p Fr(OCTAVE_INFO_FILE)p Fv(')e(found)j(in)g(the)g(en)o (vironmen)o(t,)g(but)f(not)240 2017 y(an)o(y)g(`)p Fr(INFO_FILE)e(=)i ("filename")p Fv(')f(commands)h(found)g(in)h(the)g(system)e(or)h(user)g (startup)g(\014les.)0 2110 y Fr(--interactive)0 2173 y(-i)192 b Fv(F)l(orce)15 b(in)o(teractiv)o(e)h(b)q(eha)o(vior.)0 2266 y Fr(--path)e Fp(path)0 2328 y Fr(-p)h Fp(path)86 b Fv(Sp)q(ecify)12 b(the)f(path)f(to)g(searc)o(h)g(for)g(function)h (\014les.)20 b(The)10 b(v)m(alue)i(of)e Fp(path)g Fv(sp)q(eci\014ed)j (on)e(the)f(command)240 2390 y(line)20 b(will)g(o)o(v)o(erride)e(an)o (y)g(v)m(alue)h(of)f(`)p Fr(OCTAVE_PATH)p Fv(')e(found)i(in)h(the)f(en) o(vironmen)o(t,)h(but)g(not)e(an)o(y)240 2452 y(`)p Fr(LOADPATH)d(=)h ("path")p Fv(')f(commands)h(found)g(in)h(the)f(system)g(or)g(user)g (startup)g(\014les.)0 2545 y Fr(--silent)0 2608 y(--quiet)0 2670 y(-q)192 b Fv(Don't)14 b(prin)o(t)i(message)e(at)h(startup.)p eop %%Page: 20 22 20 21 bop 0 -58 a Fv(20)1766 b(Octa)o(v)o(e)0 183 y Fr(--verbose)0 246 y(-V)192 b Fv(T)l(urn)16 b(on)f(v)o(erb)q(ose)g(output.)0 333 y Fr(--version)0 395 y(-v)192 b Fv(Prin)o(t)15 b(the)g(program)g(v) o(ersion)g(n)o(um)o(b)q(er)g(and)h(exit.)0 482 y Fr(--echo-commands)0 544 y(-x)192 b Fv(Ec)o(ho)15 b(commands)g(as)g(they)g(are)g(executed.)0 632 y Fp(\014le)183 b Fv(Execute)16 b(commands)f(from)f Fp(\014le)p Fv(.)0 764 y Fu(2.2)33 b(Startup)16 b(Files)62 868 y Fv(When)g(Octa)o(v)o(e)f(starts,)e(it)j(lo)q(oks)f(for)g (commands)g(to)f(execute)i(from)e(the)i(follo)o(wing)g(\014les:)0 964 y Fr(OCTAVE_HOME/lib/octave/VER)o(SION/st)o(artup/oc)o(taverc)240 1026 y Fv(Where)k Fr(OCTAVE_HOME)e Fv(is)i(the)g(directory)g(in)g(whic) o(h)g(all)h(of)e(Octa)o(v)o(e)g(is)i(installed)g(\(the)e(default)240 1088 y(is)e(`)p Fr(/usr/local)p Fv('\),)e(and)h Fr(VERSION)g Fv(is)h(the)g(v)o(ersion)g(n)o(um)o(b)q(er)g(of)g(Octa)o(v)o(e.)24 b(This)17 b(\014le)h(is)f(pro)o(vided)240 1150 y(so)e(that)g(c)o (hanges)h(to)f(the)g(default)h(Octa)o(v)o(e)g(en)o(vironmen)o(t)f(can)h (b)q(e)g(made)g(globally)h(for)e(all)h(users.)240 1213 y(Some)g(care)f(should)i(b)q(e)f(tak)o(en)g(when)g(making)g(c)o(hanges) f(to)g(this)h(\014le,)h(since)g(all)f(users)g(of)f(Octa)o(v)o(e)240 1275 y(at)g(y)o(our)f(site)i(will)h(b)q(e)f(a\013ected.)0 1362 y Fr(~/.octaverc)240 1424 y Fv(This)e(\014le)g(is)f(normally)h (used)f(to)f(mak)o(e)h(p)q(ersonal)h(c)o(hanges)f(to)f(the)h(default)g (Octa)o(v)o(e)g(en)o(vironmen)o(t.)0 1512 y Fr(.octaverc)240 1574 y Fv(This)f(\014le)g(can)f(b)q(e)h(used)g(to)e(mak)o(e)h(c)o (hanges)g(to)f(the)h(default)h(Octa)o(v)o(e)f(en)o(vironmen)o(t)g(for)g (a)f(particular)240 1636 y(pro)s(ject.)19 b(Octa)o(v)o(e)14 b(searc)o(hes)h(for)e(this)i(\014le)h(after)e(it)h(reads)f(`)p Fr(~/.octaverc)p Fv(',)e(so)i(an)o(y)h(use)f(of)h(the)f Fr(cd)240 1698 y Fv(command)k(in)h(the)f(`)p Fr(~/.octaverc)p Fv(')d(\014le)20 b(will)f(a\013ect)e(the)i(directory)f(that)f(Octa)o(v) o(e)h(searc)o(hes)g(for)240 1761 y(the)d(\014le)i(`)p Fr(.octaverc)p Fv('.)240 1835 y(If)j(y)o(ou)g(start)f(Octa)o(v)o(e)h (in)h(y)o(our)e(home)h(directory)l(,)i(it)e(will)i(a)o(v)o(oid)e (executing)h(commands)f(from)240 1898 y(`)p Fr(~/.octaverc)p Fv(')13 b(t)o(wice.)62 1993 y(A)f(message)f(will)i(b)q(e)g(displa)o(y)o (ed)g(as)e(eac)o(h)h(of)f(these)h(\014les)g(is)h(read)e(if)h(y)o(ou)g (in)o(v)o(ok)o(e)f(Octa)o(v)o(e)g(with)h(the)g Fr(--verbose)0 2055 y Fv(option)j(but)h(without)f(the)g Fr(--silent)f Fv(option.)62 2138 y(Startup)h(\014les)h(ma)o(y)f(con)o(tain)g(an)o(y)g (v)m(alid)i(Octa)o(v)o(e)e(commands,)f(including)k(m)o(ultiple)f (function)f(de\014nitions.)p eop %%Page: 21 23 21 22 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(21)0 183 y Fs(3)41 b(Expressions)62 310 y Fv(Expressions)16 b(are)f(the)h(basic)g(building)i(blo)q(c)o(k)e(of)f(statemen)o(ts)f(in) i(Octa)o(v)o(e.)k(An)c(expression)g(ev)m(aluates)h(to)d(a)0 372 y(v)m(alue,)j(whic)o(h)f(y)o(ou)f(can)h(prin)o(t,)g(test,)e(store)h (in)i(a)e(v)m(ariable,)i(pass)e(to)g(a)g(function,)i(or)e(assign)g(a)h (new)f(v)m(alue)i(to)e(a)0 435 y(v)m(ariable)i(with)e(an)g(assignmen)o (t)g(op)q(erator.)62 518 y(An)g(expression)g(can)g(serv)o(e)f(as)h(a)f (statemen)o(t)f(on)i(its)f(o)o(wn.)20 b(Most)13 b(other)h(kinds)i(of)e (statemen)o(ts)f(con)o(tain)i(one)0 580 y(or)i(more)g(expressions)h (whic)o(h)h(sp)q(ecify)f(data)f(to)g(b)q(e)h(op)q(erated)g(on.)26 b(As)18 b(in)g(other)f(languages,)h(expressions)g(in)0 642 y(Octa)o(v)o(e)c(include)i(v)m(ariables,)g(arra)o(y)d(references,)h (constan)o(ts,)f(and)i(function)g(calls,)g(as)f(w)o(ell)h(as)f(com)o (binations)g(of)0 704 y(these)h(with)h(v)m(arious)g(op)q(erators.)0 834 y Fu(3.1)33 b(Constan)n(t)14 b(Expressions)62 938 y Fv(The)k(simplest)i(t)o(yp)q(e)e(of)f(expression)i(is)f(the)h Fp(constan)o(t)p Fv(,)e(whic)o(h)i(alw)o(a)o(ys)e(has)h(the)g(same)g(v) m(alue.)29 b(There)18 b(are)0 1000 y(t)o(w)o(o)c(t)o(yp)q(es)h(of)g (constan)o(ts:)k(n)o(umeric)d(constan)o(ts)e(and)i(string)f(constan)o (ts.)0 1117 y Fj(3.1.1)30 b(Numeric)16 b(Constan)n(ts)62 1221 y Fv(A)f Fp(n)o(umeric)h(constan)o(t)f Fv(ma)o(y)g(b)q(e)g(a)g (scalar,)f(a)h(v)o(ector,)f(or)h(a)f(matrix,)h(and)g(it)g(ma)o(y)f(con) o(tain)h(complex)h(v)m(alues.)62 1304 y(The)g(simplest)g(form)f(of)g(a) g(n)o(umeric)h(constan)o(t,)e(a)h(scalar,)g(is)h(a)f(single)i(n)o(um)o (b)q(er)f(that)e(can)i(b)q(e)g(an)f(in)o(teger,)g(a)0 1367 y(decimal)g(fraction,)e(a)g(n)o(um)o(b)q(er)h(in)g(scien)o (ti\014c)h(\(exp)q(onen)o(tial\))f(notation,)f(or)g(a)g(complex)h(n)o (um)o(b)q(er.)19 b(Note)13 b(that)g(all)0 1429 y(n)o(umeric)19 b(v)m(alues)g(are)e(represen)o(ted)i(within)g(Octa)o(v)o(e)e(in)i (double-precision)i(\015oating)d(p)q(oin)o(t)g(format)e(\(complex)0 1491 y(constan)o(ts)e(are)h(stored)f(as)h(pairs)g(of)g (double-precision)j(\015oating)d(p)q(oin)o(t)g(v)m(alues\).)21 b(Here)15 b(are)g(some)g(examples)g(of)0 1553 y(real-v)m(alued)i(n)o (umeric)f(constan)o(ts,)e(whic)o(h)i(all)g(ha)o(v)o(e)f(the)g(same)g(v) m(alue:)120 1624 y Fr(105)120 1674 y(1.05e+2)120 1724 y(1050e-1)62 1807 y Fv(T)l(o)g(sp)q(ecify)i(complex)f(constan)o(ts,)e (y)o(ou)g(can)i(write)f(an)g(expression)h(of)f(the)g(form)120 1877 y Fr(3)24 b(+)f(4i)120 1927 y(3.0)g(+)h(4.0i)120 1977 y(0.3e1)f(+)h(40e-1i)62 2060 y Fv(all)15 b(of)e(whic)o(h)h(are)f (equiv)m(alen)o(t.)21 b(The)13 b(letter)h(`)p Fr(i)p Fv(')e(in)j(the)e(previous)h(example)g(stands)g(for)e(the)i(pure)g (imaginary)0 2122 y(constan)o(t,)g(de\014ned)j(as)408 2086 y Ft(p)p 446 2086 59 2 v 36 x(\000)p Fv(1.)62 2205 y(F)l(or)e(Octa)o(v)o(e)f(to)h(recognize)h(a)f(v)m(alue)h(as)f(the)g (imaginary)g(part)g(of)f(a)h(complex)h(constan)o(t,)e(a)g(space)i(m)o (ust)e(not)0 2267 y(app)q(ear)h(b)q(et)o(w)o(een)h(the)f(n)o(um)o(b)q (er)h(and)f(the)g(`)p Fr(i)p Fv('.)k(If)d(it)f(do)q(es,)g(Octa)o(v)o(e) g(will)i(prin)o(t)f(an)f(error)f(message,)h(lik)o(e)h(this:)120 2338 y Fr(octave:13>)22 b(3)i(+)g(4)g(i)120 2438 y(parse)f(error:)168 2537 y(3)g(+)h(4)g(i)311 2587 y(^)62 2670 y Fv(Y)l(ou)16 b(ma)o(y)e(also)h(use)h(`)p Fr(j)p Fv(',)e(`)p Fr(I)p Fv(',)g(or)g(`)p Fr(J)p Fv(')h(in)h(place)g(of)f(the)g(`)p Fr(i)p Fv(')f(ab)q(o)o(v)o(e.)20 b(All)c(four)f(forms)f(are)h(equiv)m (alen)o(t.)p eop %%Page: 22 24 22 23 bop 0 -58 a Fv(22)1766 b(Octa)o(v)o(e)0 183 y Fj(3.1.2)30 b(String)15 b(Constan)n(ts)62 287 y Fv(A)g Fp(string)g(constan)o(t)g Fv(consists)g(of)g(a)f(sequence)j(of)d(c)o(haracters)g(enclosed)i(in)g (either)g(double-quote)g(or)e(single-)0 349 y(quote)h(marks.)k(F)l(or)c (example,)g(b)q(oth)h(of)e(the)i(follo)o(wing)g(expressions)120 420 y Fr("parrot")120 470 y('parrot')0 553 y Fv(represen)o(t)f(the)g (string)h(whose)f(con)o(ten)o(ts)f(are)h(`)p Fr(parrot)p Fv('.)j(Strings)e(in)g(Octa)o(v)o(e)f(can)g(b)q(e)h(of)f(an)o(y)f (length.)62 636 y(Since)h(the)e(single-quote)i(mark)d(is)i(also)f(used) g(for)g(the)g(transp)q(ose)g(op)q(erator)f(\(see)h(Section)h(3.10)e ([Arithmetic)0 698 y(Ops],)k(page)f(33\))g(but)h(double-quote)h(marks)f (ha)o(v)o(e)f(no)h(other)f(purp)q(ose)i(in)f(Octa)o(v)o(e,)g(it)g(is)g (b)q(est)g(to)f(use)i(double-)0 760 y(quote)e(marks)f(to)h(denote)h (strings.)62 843 y(Some)h(c)o(haracters)f(cannot)g(b)q(e)h(included)j (literally)e(in)f(a)g(string)f(constan)o(t.)23 b(Y)l(ou)17 b(represen)o(t)g(them)f(instead)0 906 y(with)g Fp(escap)q(e)f (sequences)p Fv(,)h(whic)o(h)g(are)f(c)o(haracter)g(sequences)h(b)q (eginning)h(with)f(a)f(bac)o(kslash)g(\(`)p Fr(\\)p Fv('\).)62 989 y(One)i(use)f(of)f(an)h(escap)q(e)h(sequence)g(is)f(to)f(include)k (a)c(double-quote)i(\(single-quote\))g(c)o(haracter)e(in)h(a)g(string)0 1051 y(constan)o(t)11 b(that)h(has)g(b)q(een)h(de\014ned)h(using)f (double-quote)g(\(single-quote\))g(marks.)18 b(Since)c(a)e(plain)i (double-quote)0 1113 y(w)o(ould)j(end)h(the)f(string,)g(y)o(ou)g(m)o (ust)f(use)i(`)p Fr(\\")p Fv(')e(to)g(represen)o(t)h(a)g(single)h (double-quote)g(c)o(haracter)f(as)f(a)h(part)f(of)0 1175 y(the)i(string.)26 b(The)18 b(bac)o(kslash)g(c)o(haracter)e(itself)j (is)f(another)f(c)o(haracter)f(that)h(cannot)g(b)q(e)h(included)j (normally)l(.)0 1238 y(Y)l(ou)d(m)o(ust)f(write)h(`)p Fr(\\\\)p Fv(')f(to)g(put)h(one)f(bac)o(kslash)h(in)h(the)f(string.)27 b(Th)o(us,)18 b(the)g(string)g(whose)f(con)o(ten)o(ts)g(are)h(the)0 1300 y(t)o(w)o(o)c(c)o(haracters)g(`)p Fr("\\)p Fv(')g(m)o(ust)h(b)q(e) h(written)f Fr("\\"\\\\")p Fv(.)62 1383 y(Another)g(use)h(of)f(bac)o (kslash)g(is)h(to)e(represen)o(t)h(unprin)o(table)i(c)o(haracters)e (suc)o(h)g(as)g(newline.)22 b(While)16 b(there)f(is)0 1445 y(nothing)i(to)e(stop)h(y)o(ou)g(from)f(writing)i(most)e(of)h (these)g(c)o(haracters)g(directly)h(in)g(a)f(string)g(constan)o(t,)f (they)i(ma)o(y)0 1507 y(lo)q(ok)e(ugly)l(.)62 1590 y(Here)h(is)h(a)e (table)h(of)f(all)i(the)f(escap)q(e)g(sequences)h(used)g(in)f(Octa)o(v) o(e.)21 b(They)16 b(are)g(the)g(same)f(as)g(those)h(used)g(in)0 1653 y(the)f(C)g(programming)g(langauge.)0 1747 y Fr(\\\\)192 b Fv(Represen)o(ts)16 b(a)f(literal)h(bac)o(kslash,)f(`)p Fr(\\)p Fv('.)0 1832 y Fr(\\")192 b Fv(Represen)o(ts)16 b(a)f(literal)h(double-quote)h(c)o(haracter,)d(`)p Fr(")p Fv('.)0 1917 y Fr(\\')192 b Fv(Represen)o(ts)16 b(a)f(literal)h (single-quote)h(c)o(haracter,)d(`)p Fr(')p Fv('.)0 2003 y Fr(\\a)192 b Fv(Represen)o(ts)16 b(the)f(\\alert")g(c)o(haracter,)f (con)o(trol-g,)g(ASCI)q(I)j(co)q(de)e(7.)0 2088 y Fr(\\b)192 b Fv(Represen)o(ts)16 b(a)f(bac)o(kspace,)g(con)o(trol-h,)g(ASCI)q(I)h (co)q(de)g(8.)0 2173 y Fr(\\f)192 b Fv(Represen)o(ts)16 b(a)f(formfeed,)f(con)o(trol-l,)i(ASCI)q(I)g(co)q(de)g(12.)0 2258 y Fr(\\n)192 b Fv(Represen)o(ts)16 b(a)f(newline,)h(con)o(trol-j,) f(ASCI)q(I)h(co)q(de)g(10.)0 2343 y Fr(\\r)192 b Fv(Represen)o(ts)16 b(a)f(carriage)g(return,)f(con)o(trol-m,)h(ASCI)q(I)h(co)q(de)g(13.)0 2428 y Fr(\\t)192 b Fv(Represen)o(ts)16 b(a)f(horizon)o(tal)g(tab,)g (con)o(trol-i,)g(ASCI)q(I)h(co)q(de)g(9.)0 2513 y Fr(\\v)192 b Fv(Represen)o(ts)16 b(a)f(v)o(ertical)g(tab,)g(con)o(trol-k,)g(ASCI)q (I)h(co)q(de)g(11.)62 2608 y(Strings)f(ma)o(y)e(b)q(e)i(concatenated)f (using)h(the)f(notation)g(for)f(de\014ning)j(matrices.)j(F)l(or)14 b(example,)g(the)g(expres-)0 2670 y(sion)p eop %%Page: 23 25 23 24 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(23)120 183 y Fr([)24 b("foo")f(,)h("bar")f(,)h("baz")f(])0 269 y Fv(pro)q(duces)15 b(the)f(string)h(whose)f(con)o(ten)o(ts)f(are)h (`)p Fr(foobarbaz)p Fv('.)k(The)c(next)g(section)h(explains)h(more)e (ab)q(out)g(ho)o(w)g(to)0 331 y(create)h(matrices.)0 474 y Fu(3.2)33 b(Matrices)62 581 y Fv(It)15 b(is)g(easy)f(to)g (de\014ne)h(a)f(matrix)h(of)f(v)m(alues)h(in)h(Octa)o(v)o(e.)j(The)14 b(size)i(of)e(the)g(matrix)g(is)h(determined)h(automat-)0 643 y(ically)l(,)h(so)e(it)g(is)h(not)f(necessary)g(to)g(explicitly)i (state)e(the)g(dimensions.)22 b(The)15 b(expression)120 716 y Fr(a)24 b(=)f([1,)h(2;)f(3,)h(4])0 802 y Fv(results)16 b(in)g(the)f(matrix)120 875 y Fr(a)24 b(=)168 975 y(1)47 b(2)168 1024 y(3)g(4)62 1110 y Fv(The)20 b(commas)e(whic)o(h)i (separate)e(the)h(elemen)o(ts)h(on)f(a)g(ro)o(w)f(ma)o(y)g(b)q(e)i (omitted,)f(and)g(the)h(semicolon)g(that)0 1172 y(marks)14 b(the)i(b)q(eginning)h(of)e(a)g(new)g(ro)o(w)f(ma)o(y)h(b)q(e)h (replaced)g(b)o(y)f(one)h(or)e(more)h(new)h(lines.)21 b(The)15 b(expression)120 1246 y Fr(a)24 b(=)f([)h(1)g(2)263 1295 y(3)g(4)g(])0 1381 y Fv(is)16 b(equiv)m(alen)o(t)h(to)d(the)h(one) h(ab)q(o)o(v)o(e.)62 1467 y(Elemen)o(ts)f(of)f(a)g(matrix)g(ma)o(y)f(b) q(e)i(arbitrary)f(expressions,)g(pro)o(vided)h(that)f(the)g(dimensions) i(all)f(agree.)20 b(F)l(or)0 1529 y(example,)c(giv)o(en)f(the)h(ab)q(o) o(v)o(e)e(matrix,)h(the)g(expression)120 1602 y Fr([)24 b(a,)f(a)h(])0 1688 y Fv(pro)q(duces)16 b(the)f(matrix)120 1761 y Fr(ans)23 b(=)168 1860 y(1)47 b(2)h(1)f(2)168 1910 y(3)g(4)h(3)f(4)0 1996 y Fv(but)15 b(the)h(expression)120 2069 y Fr([)24 b(a)f(1)h(])0 2155 y Fv(pro)q(duces)16 b(the)f(error)120 2228 y Fr(error:)23 b(number)g(of)h(rows)f(must)g (match)62 2313 y Fv(Inside)d(the)f(square)f(brac)o(k)o(ets)g(that)g (delimit)i(a)f(matrix)f(expression,)i(Octa)o(v)o(e)e(lo)q(oks)h(at)e (the)i(surrounding)0 2376 y(con)o(text)10 b(to)g(determine)i(whether)f (spaces)g(should)h(b)q(e)g(con)o(v)o(erted)e(in)o(to)h(elemen)o(t)g (separators,)f(or)h(simply)h(ignored,)0 2438 y(so)j(commands)g(lik)o(e) 120 2511 y Fr([)24 b(linspace)e(\(1,)i(2\))g(])0 2597 y Fv(will)17 b(w)o(ork.)i(Ho)o(w)o(ev)o(er,)14 b(some)g(p)q(ossible)j (sources)f(of)e(confusion)i(remain.)21 b(F)l(or)14 b(example,)i(in)g (the)f(expression)120 2670 y Fr([)24 b(1)f(-)h(1)g(])p eop %%Page: 24 26 24 25 bop 0 -58 a Fv(24)1766 b(Octa)o(v)o(e)0 183 y(the)15 b(`)p Fr(-)p Fv(')g(is)g(treated)g(as)g(a)g(binary)g(op)q(erator)g(and) g(the)g(result)h(is)g(the)f(scalar)g(0,)g(but)g(in)h(the)f(expression) 120 258 y Fr([)24 b(1)f(-1)h(])0 346 y Fv(the)15 b(`)p Fr(-)p Fv(')g(is)g(treated)g(as)g(a)g(unary)g(op)q(erator)f(and)i(the)f (result)g(is)h(the)f(v)o(ector)g Fr([)g(1)g(-1)g(])p Fv(.)62 433 y(Giv)o(en)h Fr(a)f(=)g(1)p Fv(,)g(the)g(expression)120 508 y Fr([)24 b(1)f(a')h(])0 595 y Fv(results)15 b(in)h(the)f(single)i (quote)e(c)o(haracter)f(`)p Fr(')p Fv(')g(b)q(eing)i(treated)f(as)g(a)f (transp)q(ose)h(op)q(erator)f(and)i(the)f(result)g(is)h(the)0 658 y(v)o(ector)e Fr([)i(1)f(1)g(])p Fv(,)f(but)i(the)f(expression)120 733 y Fr([)24 b(1)f(a)h(')g(])0 820 y Fv(pro)q(duces)16 b(the)f(error)g(message)120 895 y Fr(error:)23 b(unterminated)f(string) h(constant)0 982 y Fv(b)q(ecause)16 b(to)f(not)g(do)g(so)f(w)o(ould)i (mak)o(e)f(it)g(imp)q(ossible)j(to)c(correctly)i(parse)f(the)g(v)m (alid)i(expression)120 1057 y Fr([)24 b(a)f('foo')h(])62 1145 y Fv(F)l(or)12 b(clarit)o(y)l(,)h(it)f(is)h(probably)g(b)q(est)f (to)f(alw)o(a)o(ys)h(use)g(commas)g(and)g(semicolons)h(to)f(separate)f (matrix)h(elemen)o(ts)0 1207 y(and)22 b(ro)o(ws.)40 b(It)22 b(is)g(p)q(ossible)i(to)e(enforce)g(this)h(st)o(yle)f(b)o(y)g(setting)g (the)g(built-in)i(v)m(ariable)g Fr(whitespace_in_)0 1269 y(literal_matrix)13 b Fv(to)i Fr("ignore")p Fv(.)k(See)c(Chapter)g(6)g ([Built-in)i(V)l(ariables],)f(page)f(61.)0 1403 y Fj(3.2.1)30 b(Empt)n(y)16 b(Matrices)62 1511 y Fv(A)e(matrix)f(ma)o(y)f(ha)o(v)o(e) h(one)h(or)f(b)q(oth)g(dimensions)i(zero,)f(and)f(op)q(erations)h(on)f (empt)o(y)g(matrices)g(are)g(handled)0 1573 y(as)g(describ)q(ed)j(b)o (y)e(Carl)f(de)h(Bo)q(or)g(in)g Fp(An)g(Empt)o(y)f(Exercise)p Fv(,)i(SIGNUM,)e(V)l(olume)i(25,)e(pages)g(2{6,)g(1990)g(and)h(C.)0 1636 y(N.)g(Nett)h(and)f(W.)g(M.)g(Haddad,)h(in)g Fp(A)g (System-Theoretic)g(Appropriate)g(Realization)i(of)d(the)g(Empt)o(y)h (Matrix)0 1698 y(Concept)p Fv(,)21 b(IEEE)f(T)l(ransactions)f(on)h (Automatic)g(Con)o(trol,)g(V)l(olume)g(38,)g(Num)o(b)q(er)g(5,)h(Ma)o (y)e(1993.)32 b(Brie\015y)l(,)0 1760 y(giv)o(en)14 b(a)g(scalar)g Fr(s)p Fv(,)f(and)h(an)g Fp(m)g Fv(b)o(y)g Fp(n)g Fv(matrix)f Fr(M\(mxn\))p Fv(,)g(and)h(an)g Fp(m)g Fv(b)o(y)f Fp(n)h Fv(empt)o(y)g(matrix)g Fr([]\(mxn\))e Fv(\(with)i(either)0 1822 y(one)h(or)g(b)q(oth)g(dimensions)i(equal)f(to)f(zero\),)f(the)h (follo)o(wing)h(are)f(true:)120 1897 y Fr(s)24 b(*)f([]\(mxn\))g(=)h ([]\(mxn\))f(*)h(s)f(=)h([]\(mxn\))215 1997 y([]\(mxn\))f(+)h ([]\(mxn\))f(=)h([]\(mxn\))215 2097 y([]\(0xm\))f(*)h(M\(mxn\))f(=)h ([]\(0xn\))215 2196 y(M\(mxn\))f(*)h([]\(nx0\))f(=)h([]\(mx0\))215 2296 y([]\(mx0\))f(*)h([]\(0xn\))f(=)h(0\(mxn\))62 2383 y Fv(By)e(default,)j(dimensions)e(of)f(the)g(empt)o(y)g(matrix)g(are)f (no)o(w)h(prin)o(ted)h(along)f(with)g(the)h(empt)o(y)e(matrix)0 2446 y(sym)o(b)q(ol,)15 b(`)p Fr([])p Fv('.)k(F)l(or)c(example:)120 2521 y Fr(octave:13>)22 b(zeros)i(\(3,)f(0\))120 2570 y(ans)g(=)120 2670 y([]\(3x0\))p eop %%Page: 25 27 25 26 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(25)62 183 y(The)21 b(built-in)h(v)m(ariable)g Fr (print_empty_dimensions)17 b Fv(con)o(trols)j(this)h(b)q(eha)o(vior)g (\(see)f(Section)h(6.2)e([User)0 246 y(Preferences],)c(page)g(62\).)62 332 y(Empt)o(y)g(matrices)g(ma)o(y)f(also)h(b)q(e)h(used)f(in)h (assignmen)o(t)f(statemen)o(ts)f(as)g(a)h(con)o(v)o(enien)o(t)h(w)o(a)o (y)e(to)g(delete)i(ro)o(ws)0 394 y(or)f(columns)h(of)e(matrices.)20 b(See)c(Section)g(3.13)e([Assignmen)o(t)h(Expressions],)g(page)g(37.)0 539 y Fu(3.3)33 b(Ranges)62 645 y Fv(A)23 b Fp(range)h Fv(is)f(a)f(con)o(v)o(enien)o(t)g(w)o(a)o(y)f(to)h(write)g(a)g(ro)o(w)g (v)o(ector)f(with)i(ev)o(enly)g(spaced)f(elemen)o(ts.)42 b(A)22 b(range)0 708 y(constan)o(t)11 b(is)i(de\014ned)g(b)o(y)f(the)h (v)m(alue)g(of)f(the)g(\014rst)f(elemen)o(t)i(in)g(the)f(range,)g(an)g (optional)h(v)m(alue)g(for)f(the)g(incremen)o(t)0 770 y(b)q(et)o(w)o(een)g(elemen)o(ts,)h(and)f(a)g(maxim)o(um)g(v)m(alue)h (whic)o(h)g(the)f(elemen)o(ts)g(of)g(the)g(range)f(will)j(not)d (exceed.)20 b(The)12 b(base,)0 832 y(incremen)o(t,)19 b(and)e(limit)i(are)f(separated)f(b)o(y)h(colons)g(\(the)f(`)p Fr(:)p Fv(')g(c)o(haracter\))g(and)g(ma)o(y)g(con)o(tain)h(an)o(y)f (arithmetic)0 895 y(expressions)e(and)f(function)h(calls.)21 b(If)14 b(the)g(incremen)o(t)h(is)g(omitted,)f(it)g(is)h(assumed)f(to)g (b)q(e)g(1.)20 b(F)l(or)13 b(example,)i(the)0 957 y(range)120 1030 y Fr(1)24 b(:)f(5)0 1116 y Fv(de\014nes)17 b(the)g(set)f(of)g(v)m (alues)i(`)p Fr([)c(1)h(2)g(3)g(4)g(5)g(])p Fv(')h(\(the)g(incremen)o (t)h(has)g(b)q(een)g(omitted,)g(so)f(it)g(is)h(tak)o(en)f(as)g(1\),)g (and)0 1179 y(the)f(range)120 1252 y Fr(1)24 b(:)f(3)h(:)g(5)0 1338 y Fv(de\014nes)15 b(the)f(set)f(of)g(v)m(alues)i(`)p Fr([)g(1)g(4)g(])p Fv('.)k(In)14 b(this)g(case,)g(the)g(base)f(v)m (alue)i(is)g(1,)e(the)h(incremen)o(t)g(is)h(3,)e(and)h(the)g(limit)0 1401 y(is)i(5.)62 1487 y(Although)i(a)f(range)g(constan)o(t)f(sp)q (eci\014es)j(a)e(ro)o(w)f(v)o(ector,)h(Octa)o(v)o(e)g(do)q(es)g Fp(not)h Fv(con)o(v)o(ert)e(range)h(constan)o(ts)g(to)0 1549 y(v)o(ectors)c(unless)j(it)e(is)h(necessary)f(to)g(do)g(so.)19 b(This)c(allo)o(ws)f(y)o(ou)g(to)f(write)i(a)f(constan)o(t)f(lik)o(e)i (`)p Fr(1)g(:)g(10000)p Fv(')e(without)0 1611 y(using)j(up)g(80,000)d (b)o(ytes)i(of)g(storage)f(on)h(a)g(t)o(ypical)h(32-bit)f(w)o (orkstation.)62 1697 y(Note)i(that)f(the)h(upp)q(er)h(\(or)e(lo)o(w)o (er,)h(if)g(the)g(incremen)o(t)h(is)f(negativ)o(e\))g(b)q(ound)h(on)f (the)g(range)g(is)g(not)g(alw)o(a)o(ys)0 1759 y(included)e(in)d(the)g (set)g(of)f(v)m(alues,)j(and)e(that)f(ranges)h(de\014ned)h(b)o(y)f (\015oating)f(p)q(oin)o(t)i(v)m(alues)g(can)f(pro)q(duce)h(surprising)0 1822 y(results)18 b(b)q(ecause)g(Octa)o(v)o(e)f(uses)g(\015oating)h(p)q (oin)o(t)f(arithmetic)h(to)f(compute)g(the)h(v)m(alues)g(in)g(the)g (range.)25 b(If)18 b(it)f(is)0 1884 y(imp)q(ortan)o(t)g(to)g(include)j (the)d(endp)q(oin)o(ts)i(of)e(a)g(range)g(and)h(the)f(n)o(um)o(b)q(er)h (of)f(elemen)o(ts)h(is)g(kno)o(wn,)g(y)o(ou)f(should)0 1946 y(use)f(the)f Fr(linspace)f Fv(function)i(instead)g(\(see)f (Chapter)g(21)f([Sp)q(ecial)j(Matrices],)e(page)g(133\).)0 2091 y Fu(3.4)33 b(V)-6 b(ariables)62 2198 y Fv(V)l(ariables)13 b(let)f(y)o(ou)g(giv)o(e)f(names)h(to)f(v)m(alues)i(and)f(refer)f(to)g (them)h(later.)19 b(Y)l(ou)12 b(ha)o(v)o(e)f(already)h(seen)g(v)m (ariables)h(in)0 2260 y(man)o(y)e(of)h(the)g(examples.)20 b(The)12 b(name)g(of)f(a)h(v)m(ariable)h(m)o(ust)f(b)q(e)g(a)g (sequence)h(of)f(letters,)g(digits)h(and)f(underscores,)0 2322 y(but)i(it)g(ma)o(y)g(not)f(b)q(egin)i(with)g(a)e(digit.)21 b(Octa)o(v)o(e)13 b(do)q(es)h(not)g(enforce)g(a)g(limit)h(on)f(the)g (length)h(of)e(v)m(ariable)i(names,)0 2385 y(but)e(it)g(is)h(seldom)f (useful)h(to)e(ha)o(v)o(e)h(v)m(ariables)h(with)f(names)g(longer)g (than)g(ab)q(out)g(30)f(c)o(haracters.)18 b(The)13 b(follo)o(wing)0 2447 y(are)i(all)h(v)m(alid)h(v)m(ariable)f(names)120 2521 y Fr(x)120 2570 y(x15)120 2620 y(__foo_bar_baz__)120 2670 y(fucnrdthsucngtagdjb)p eop %%Page: 26 28 26 27 bop 0 -58 a Fv(26)1766 b(Octa)o(v)o(e)0 183 y(Case)15 b(is)h(signi\014can)o(t)g(in)g(v)m(ariable)g(names.)k(The)c(sym)o(b)q (ols)f Fr(a)g Fv(and)g Fr(A)g Fv(are)g(distinct)i(v)m(ariables.)62 267 y(A)f(v)m(ariable)h(name)f(is)g(a)f(v)m(alid)i(expression)g(b)o(y)f (itself.)22 b(It)15 b(represen)o(ts)h(the)g(v)m(ariable's)g(curren)o(t) g(v)m(alue.)22 b(V)l(ari-)0 330 y(ables)c(are)f(giv)o(en)h(new)g(v)m (alues)g(with)g Fp(assignmen)o(t)f(op)q(erators)i Fv(and)e Fp(incremen)o(t)h(op)q(erators)p Fv(.)26 b(See)18 b(Section)g(3.13)0 392 y([Assignmen)o(t)d(Expressions],)g(page)g(37.)62 476 y(A)22 b(n)o(um)o(b)q(er)g(of)g(v)m(ariables)h(ha)o(v)o(e)e(sp)q (ecial)j(built-in)g(meanings.)41 b(F)l(or)21 b(example,)j Fr(PWD)e Fv(holds)g(the)g(curren)o(t)0 538 y(w)o(orking)d(directory)l (,)i(and)f Fr(pi)f Fv(names)h(the)g(ratio)f(of)g(the)h(circumference)h (of)e(a)h(circle)h(to)e(its)h(diameter.)33 b(See)0 600 y(Chapter)19 b(6)g([Built-in)i(V)l(ariables],)g(page)e(61,)g(for)g(a)g (list)h(of)f(all)h(the)f(prede\014ned)i(v)m(ariables.)34 b(Some)19 b(of)g(these)0 663 y(built-in)e(sym)o(b)q(ols)e(are)f (constan)o(ts)g(and)h(ma)o(y)e(not)i(b)q(e)g(c)o(hanged.)20 b(Others)15 b(can)f(b)q(e)h(used)h(and)e(assigned)i(just)e(lik)o(e)0 725 y(all)i(other)f(v)m(ariables,)h(but)f(their)h(v)m(alues)g(are)f (also)h(used)f(or)g(c)o(hanged)h(automatically)f(b)o(y)g(Octa)o(v)o(e.) 62 809 y(V)l(ariables)h(in)g(Octa)o(v)o(e)e(can)h(b)q(e)g(assigned)g (either)h(n)o(umeric)f(or)f(string)h(v)m(alues.)21 b(V)l(ariables)16 b(ma)o(y)e(not)g(b)q(e)h(used)0 871 y(b)q(efore)g(they)h(ha)o(v)o(e)f (b)q(een)h(giv)o(en)g(a)e(v)m(alue.)22 b(Doing)15 b(so)g(results)g(in)h (an)f(error.)0 1008 y Fu(3.5)33 b(Index)16 b(Expressions)62 1113 y Fv(An)g Fp(index)g(expression)g Fv(allo)o(ws)g(y)o(ou)f(to)f (reference)i(or)f(extract)f(selected)j(elemen)o(ts)e(of)g(a)g(matrix)g (or)g(v)o(ector.)62 1197 y(Indices)i(ma)o(y)d(b)q(e)h(scalars,)f(v)o (ectors,)g(ranges,)g(or)g(the)h(sp)q(ecial)i(op)q(erator)c(`)p Fr(:)p Fv(',)h(whic)o(h)h(ma)o(y)f(b)q(e)i(used)f(to)f(select)0 1260 y(en)o(tire)i(ro)o(ws)e(or)h(columns.)62 1344 y(V)l(ectors)i(are)f (indexed)i(using)f(a)f(single)i(expression.)25 b(Matrices)16 b(require)i(t)o(w)o(o)d(indices)j(unless)g(the)f(v)m(alue)g(of)0 1406 y(the)d(built-in)j(v)m(ariable)e Fr(do_fortran_indexing)d Fv(is)i Fr("true")p Fv(,)f(in)i(whic)o(h)g(case)f(a)g(matrix)g(ma)o(y)f (also)h(b)q(e)h(indexed)0 1468 y(b)o(y)g(a)g(single)i(expression)f (\(see)f(Section)h(6.2)e([User)h(Preferences],)g(page)g(62\).)62 1552 y(Giv)o(en)h(the)f(matrix)120 1624 y Fr(a)24 b(=)f([1,)h(2;)f(3,)h (4])0 1708 y Fv(all)16 b(of)f(the)g(follo)o(wing)h(expressions)g(are)f (equiv)m(alen)o(t)120 1780 y Fr(a)24 b(\(1,)f([1,)h(2]\))120 1829 y(a)g(\(1,)f(1:2\))120 1879 y(a)h(\(1,)f(:\))0 1963 y Fv(and)15 b(select)h(the)g(\014rst)e(ro)o(w)h(of)f(the)i(matrix.)62 2047 y(A)g(sp)q(ecial)i(form)d(of)g(indexing)j(ma)o(y)d(b)q(e)i(used)f (to)g(select)g(elemen)o(ts)h(of)e(a)h(matrix)f(or)h(v)o(ector.)21 b(If)16 b(the)g(indices)0 2110 y(are)f(v)o(ectors)f(made)h(up)h(of)f (only)g(ones)g(and)h(zeros,)e(the)i(result)f(is)h(a)f(new)g(matrix)g (whose)g(elemen)o(ts)h(corresp)q(ond)0 2172 y(to)f(the)g(elemen)o(ts)h (of)e(the)i(index)g(v)o(ector)f(that)f(are)h(equal)h(to)f(one.)20 b(F)l(or)14 b(example,)120 2243 y Fr(a)24 b(=)f([1,)h(2;)f(3,)h(4];)120 2293 y(a)g(\([1,)f(0],)g(:\))0 2377 y Fv(selects)16 b(the)f(\014rst)g (ro)o(w)f(of)h(the)g(matrix)g(`)p Fr(a)p Fv('.)62 2461 y(This)i(op)q(eration)g(can)f(b)q(e)h(useful)g(for)f(selecting)h (elemen)o(ts)g(of)f(a)g(matrix)g(based)g(on)g(some)g(condition,)i (since)0 2524 y(the)d(comparison)h(op)q(erators)e(return)h(matrices)g (of)g(ones)g(and)h(zeros.)62 2608 y(Unfortunately)l(,)j(this)f(sp)q (ecial)h(zero-one)f(form)f(of)g(indexing)j(leads)e(to)f(a)g(con\015ict) i(with)f(the)g(standard)f(in-)0 2670 y(dexing)f(op)q(eration.)k(F)l(or) 15 b(example,)h(should)g(the)f(follo)o(wing)h(statemen)o(ts)p eop %%Page: 27 29 27 28 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(27)120 183 y Fr(a)24 b(=)f([1,)h(2;)f(3,)h(4];)120 233 y(a)g(\([1,)f(1],)g(:\))0 316 y Fv(return)18 b(the)g(original)h (matrix,)f(or)f(the)h(matrix)g(formed)g(b)o(y)g(selecting)h(the)f (\014rst)g(ro)o(w)f(t)o(wice?)29 b(Although)19 b(this)0 378 y(con\015ict)13 b(is)g(not)e(lik)o(ely)j(to)e(arise)g(v)o(ery)g (often)f(in)i(practice,)g(y)o(ou)f(ma)o(y)f(select)i(the)f(b)q(eha)o (vior)h(y)o(ou)f(prefer)g(b)o(y)g(setting)0 441 y(the)j(built-in)j(v)m (ariable)e Fr(prefer_zero_one_indexing)c Fv(\(see)k(Section)g(6.2)e ([User)h(Preferences],)g(page)g(62\).)62 524 y(Finally)l(,)j(indexing)f (a)f(scalar)f(with)i(a)e(v)o(ector)g(of)g(ones)h(can)g(b)q(e)h(used)f (to)f(create)h(a)f(v)o(ector)g(the)h(same)g(size)g(as)0 586 y(the)f(the)h(index)g(v)o(ector,)e(with)i(eac)o(h)f(elemen)o(t)h (equal)g(to)f(the)g(v)m(alue)h(of)f(the)g(original)i(scalar.)j(F)l(or) 14 b(example,)i(the)0 648 y(follo)o(wing)g(statemen)o(ts)120 719 y Fr(a)24 b(=)f(13;)120 769 y(a)h(\([1,)f(1,)h(1,)f(1]\))0 852 y Fv(pro)q(duce)16 b(a)f(v)o(ector)f(whose)i(four)e(elemen)o(ts)i (are)f(all)h(equal)g(to)f(13.)62 935 y(Similarly)l(,)g(indexing)f(a)e (scalar)g(with)h(t)o(w)o(o)e(v)o(ectors)g(of)h(ones)g(can)h(b)q(e)g (used)f(to)g(create)g(a)g(matrix.)19 b(F)l(or)11 b(example)0 997 y(the)k(follo)o(wing)h(statemen)o(ts)120 1067 y Fr(a)24 b(=)f(13;)120 1117 y(a)h(\([1,)f(1],)g([1,)h(1,)g(1]\))0 1200 y Fv(create)15 b(a)g(2)g(b)o(y)g(3)g(matrix)g(with)g(all)h(elemen) o(ts)g(equal)g(to)f(13.)62 1283 y(This)k(is)f(an)g(obscure)h(notation)f (and)g(should)h(b)q(e)g(a)o(v)o(oided.)28 b(It)18 b(is)h(b)q(etter)f (to)f(use)i(the)f(function)h(`)p Fr(ones)p Fv(')e(to)0 1346 y(generate)12 b(a)g(matrix)g(of)g(the)h(appropriate)f(size)i (whose)e(elemen)o(ts)h(are)f(all)i(one,)e(and)h(then)g(to)e(scale)j(it) e(to)g(pro)q(duce)0 1408 y(the)j(desired)i(result.)j(See)c(Chapter)f (21)f([Sp)q(ecial)j(Matrices],)d(page)i(133.)0 1537 y Fu(3.6)33 b(Data)14 b(Structures)62 1641 y Fv(Octa)o(v)o(e)20 b(includes)i(a)d(limited)j(amoun)o(t)d(of)h(supp)q(ort)g(for)f (organizing)h(data)g(in)g(structures.)34 b(The)20 b(curren)o(t)0 1703 y(implemen)o(tation)g(uses)f(an)f(asso)q(ciativ)o(e)h(arra)o(y)e (with)i(indices)h(limited)h(to)d(strings,)g(but)h(the)g(syn)o(tax)e(is) i(more)0 1765 y(lik)o(e)d(C-st)o(yle)g(structures.)j(Here)d(are)f(some) f(examples)i(of)f(using)h(data)f(structures)f(in)j(Octa)o(v)o(e.)62 1848 y(Elemen)o(ts)f(of)f(structures)g(can)g(b)q(e)h(of)e(an)o(y)h(v)m (alue)i(t)o(yp)q(e.)120 1919 y Fr(octave:1>)23 b(x.a)g(=)h(1;)f(x.b)h (=)g([1,)f(2;)h(3,)f(4];)h(x.c)f(=)h("string";)120 1968 y(octave:2>)f(x.a)120 2018 y(x.a)g(=)h(1)120 2068 y(octave:3>)f(x.b)120 2118 y(x.b)g(=)168 2218 y(1)47 b(2)168 2267 y(3)g(4)120 2367 y(octave:4>)23 b(x.c)120 2417 y(x.c)g(=)h(string)62 2500 y Fv(Structures)15 b(ma)o(y)g(b)q(e)h(copied.)120 2570 y Fr(octave:1>)23 b(y)g(=)h(x)120 2620 y(y)g(=)p eop %%Page: 28 30 28 29 bop 0 -58 a Fv(28)1766 b(Octa)o(v)o(e)120 183 y Fr()62 282 y Fv(Note)e(that)f(when)h(the)g (v)m(alue)h(of)e(a)h(structure)f(is)i(prin)o(ted,)g(Octa)o(v)o(e)f (only)g(displa)o(ys)h(the)f(names)g(of)f(the)0 345 y(elemen)o(ts.)f (This)15 b(prev)o(en)o(ts)g(long)f(and)h(confusing)g(output)g(from)e (large)i(deeply)h(nested)f(structures,)f(but)h(mak)o(es)0 407 y(it)j(more)f(di\016cult)i(to)e(view)h(the)g(v)m(alues)h(of)e (simple)i(structures,)e(so)h(this)g(b)q(eha)o(vior)g(ma)o(y)f(c)o (hange)g(in)i(a)e(future)0 469 y(v)o(ersion)e(of)g(Octa)o(v)o(e.)62 568 y(Since)i(structures)f(are)f(themselv)o(es)i(v)m(alues,)f (structure)g(elemen)o(ts)g(ma)o(y)f(reference)h(other)g(structures.)21 b(The)0 630 y(follo)o(wing)d(statemen)o(ts)f(c)o(hange)h(the)g(v)m (alue)h(of)e(the)h(elemen)o(t)g Fr(b)g Fv(of)f(the)h(structure)g Fr(x)f Fv(to)g(b)q(e)i(a)e(data)g(structure)0 693 y(con)o(taining)f (the)f(single)i(elemen)o(t)f Fr(d)p Fv(,)e(whic)o(h)i(has)f(a)g(v)m (alue)i(of)e(3.)120 779 y Fr(octave:1>)23 b(x.b.d)g(=)h(3)120 829 y(x.b.d)f(=)h(3)120 879 y(octave:2>)f(x.b)120 929 y(x.b)g(=)120 1028 y()120 1128 y(octave:3>)h(x.b.d)120 1178 y(x.b.d)g(=)h(3)62 1277 y Fv(F)l(unctions)d(can)f(return)g (structures.)34 b(F)l(or)20 b(example,)h(the)f(follo)o(wing)h(function) g(separates)e(the)h(real)h(and)0 1339 y(complex)16 b(parts)f(of)f(a)h (matrix)g(and)g(stores)g(them)g(in)h(t)o(w)o(o)e(elemen)o(ts)i(of)f (the)g(same)g(structure)g(v)m(ariable.)120 1426 y Fr(octave:1>)23 b(function)f(y)i(=)g(f)g(\(x\))120 1476 y(>)g(y.re)f(=)h(real)f(\(x\);) 120 1525 y(>)h(y.im)f(=)h(imag)f(\(x\);)120 1575 y(>)h(endfunction)62 1674 y Fv(When)16 b(called)h(with)f(a)f(complex-v)m(alued)j(argumen)o (t,)c Fr(f)h Fv(returns)h(the)f(data)g(structure)g(con)o(taining)h(the) g(real)0 1737 y(and)f(imaginary)h(parts)e(of)h(the)g(original)i (function)f(argumen)o(t.)120 1823 y Fr(octave:1>)23 b(f)g(\(rand)h (\(3\))f(+)h(rand)f(\(3\))g(*)h(I\);)120 1873 y(ans)f(=)120 1973 y()120 2072 y(octave:3>)f(ans.im)120 2122 y(ans.im)g(=)168 2222 y(0.093411)46 b(0.229690)h(0.627585)168 2271 y(0.415128)f(0.221706)h(0.850341)168 2321 y(0.894990)f(0.343265)h (0.384018)120 2421 y(octave:4>)23 b(ans.re)120 2471 y(ans.re)g(=)168 2570 y(0.56234)46 b(0.14797)h(0.26416)168 2620 y(0.72120)f(0.62691)h (0.20910)168 2670 y(0.89211)f(0.25175)h(0.21081)p eop %%Page: 29 31 29 30 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(29)62 183 y(F)l(unction)19 b(return)f(lists)h(can)f(include)i (structure)e(elemen)o(ts,)h(and)f(they)g(ma)o(y)f(b)q(e)i(indexed)h (lik)o(e)f(an)o(y)e(other)0 246 y(v)m(ariable.)120 322 y Fr(octave:1>)23 b([x.u,)g(x.s\(2:3,2:3\),)f(x.v])h(=)h(svd)f(\([1,)h (2;)f(3,)h(4]\))120 372 y(x.u)f(=)168 472 y(-0.40455)46 b(-0.91451)168 522 y(-0.91451)70 b(0.40455)120 621 y(x.s)23 b(=)168 721 y(0.00000)46 b(0.00000)h(0.00000)168 771 y(0.00000)f(5.46499)h(0.00000)168 820 y(0.00000)f(0.00000)h(0.36597)120 920 y(x.v)23 b(=)168 1020 y(-0.57605)70 b(0.81742)168 1070 y(-0.81742)46 b(-0.57605)120 1169 y(octave:8>)23 b(x)120 1219 y(x)h(=)120 1319 y()62 1408 y Fv(Y)l(ou)13 b(can)g(also)g(use)g(the)f(function)i Fr(is_struct)d Fv(to)h(determine)i(whether)f(a)f(giv)o(en)h(v)m(alue)h (is)f(a)g(data)f(structure.)0 1470 y(F)l(or)j(example)120 1547 y Fr(is_struct)23 b(\(x\))0 1636 y Fv(returns)15 b(1)g(if)h(the)f(v)m(alue)h(of)f(the)g(v)m(ariable)i Fp(x)h Fv(is)e(a)f(data)f(structure.)62 1725 y(This)i(feature)f(should) h(b)q(e)g(considered)h(exp)q(erimen)o(tal,)f(but)f(y)o(ou)g(should)i (exp)q(ect)f(it)f(to)g(w)o(ork.)k(Suggestions)0 1788 y(for)c(w)o(a)o(ys)f(to)g(impro)o(v)o(e)h(it)h(are)f(w)o(elcome.)0 1946 y Fu(3.7)33 b(Calling)16 b(F)-6 b(unctions)62 2056 y Fv(A)16 b Fp(function)g Fv(is)g(a)f(name)h(for)f(a)g(particular)h (calculation.)23 b(Because)16 b(it)g(has)f(a)g(name,)g(y)o(ou)h(can)f (ask)g(for)g(it)h(b)o(y)0 2118 y(name)f(at)g(an)o(y)g(p)q(oin)o(t)h(in) g(the)g(program.)j(F)l(or)c(example,)g(the)h(function)g Fr(sqrt)f Fv(computes)g(the)h(square)f(ro)q(ot)f(of)h(a)0 2180 y(n)o(um)o(b)q(er.)62 2269 y(A)i(\014xed)g(set)f(of)g(functions)i (are)e Fp(built-in)p Fv(,)j(whic)o(h)e(means)g(they)f(are)g(a)o(v)m (ailable)j(in)e(ev)o(ery)f(Octa)o(v)o(e)g(program.)0 2332 y(The)g Fr(sqrt)f Fv(function)i(is)f(one)g(of)f(these.)22 b(In)16 b(addition,)h(y)o(ou)e(can)h(de\014ne)h(y)o(our)e(o)o(wn)g (functions.)23 b(See)16 b(Chapter)f(5)0 2394 y([F)l(unctions)h(and)f (Scripts],)g(page)g(49,)f(for)h(information)g(ab)q(out)g(ho)o(w)g(to)g (do)g(this.)62 2483 y(The)e(w)o(a)o(y)f(to)g(use)h(a)g(function)g(is)g (with)g(a)g Fp(function)g(call)j Fv(expression,)e(whic)o(h)f(consists)g (of)g(the)f(function)i(name)0 2545 y(follo)o(w)o(ed)i(b)o(y)f(a)h(list) g(of)f Fp(argumen)o(ts)i Fv(in)f(paren)o(theses.)21 b(The)16 b(argumen)o(ts)f(are)g(expressions)h(whic)o(h)g(giv)o(e)g(the)g(ra)o(w) 0 2608 y(materials)j(for)e(the)i(calculation)h(that)e(the)g(function)h (will)i(do.)29 b(When)19 b(there)f(is)h(more)f(than)h(one)f(argumen)o (t,)0 2670 y(they)e(are)f(separated)g(b)o(y)h(commas.)k(If)c(there)f (are)h(no)f(argumen)o(ts,)g(y)o(ou)g(can)g(omit)h(the)g(paren)o (theses,)f(but)h(it)f(is)p eop %%Page: 30 32 30 31 bop 0 -58 a Fv(30)1766 b(Octa)o(v)o(e)0 183 y(a)13 b(go)q(o)q(d)h(idea)g(to)g(include)i(them)d(an)o(yw)o(a)o(y)l(,)g(to)g (clearly)i(indicate)g(that)e(a)g(function)i(call)g(w)o(as)e(in)o (tended.)20 b(Here)14 b(are)0 246 y(some)h(examples:)120 323 y Fr(sqrt)23 b(\(x^2)h(+)f(y^2\))143 b(#)24 b Fv(One)16 b(argumen)o(t)120 373 y Fr(ones)23 b(\(n,)h(m\))262 b(#)24 b Fv(Tw)o(o)14 b(argumen)o(ts)120 423 y Fr(rand)23 b(\(\))358 b(#)24 b Fv(No)15 b(argumen)o(ts)62 513 y(Eac)o(h)g(function)g(exp)q (ects)h(a)e(particular)h(n)o(um)o(b)q(er)h(of)e(argumen)o(ts.)19 b(F)l(or)14 b(example,)h(the)g Fr(sqrt)f Fv(function)i(m)o(ust)0 575 y(b)q(e)g(called)h(with)e(a)g(single)i(argumen)o(t,)d(the)h(n)o(um) o(b)q(er)g(to)g(tak)o(e)f(the)i(square)f(ro)q(ot)f(of:)120 652 y Fr(sqrt)23 b(\()p Fp(argumen)o(t)q Fr(\))62 742 y Fv(Some)13 b(of)f(the)h(built-in)i(functions)f(tak)o(e)e(a)g(v)m (ariable)i(n)o(um)o(b)q(er)f(of)g(argumen)o(ts,)f(dep)q(ending)j(on)d (the)h(particular)0 805 y(usage,)i(and)g(their)h(b)q(eha)o(vior)f(is)h (di\013eren)o(t)g(dep)q(ending)h(on)e(the)g(n)o(um)o(b)q(er)h(of)f (argumen)o(ts)f(supplied.)62 895 y(Lik)o(e)19 b(ev)o(ery)f(other)f (expression,)i(the)f(function)g(call)h(has)f(a)f(v)m(alue,)j(whic)o(h)e (is)g(computed)h(b)o(y)e(the)h(function)0 957 y(based)f(on)f(the)g (argumen)o(ts)g(y)o(ou)g(giv)o(e)g(it.)24 b(In)17 b(this)f(example,)h (the)g(v)m(alue)g(of)f Fr(sqrt)f(\()p Fp(argumen)o(t)q Fr(\))g Fv(is)i(the)f(square)0 1019 y(ro)q(ot)e(of)h(the)g(argumen)o (t.)k(A)c(function)h(can)f(also)g(ha)o(v)o(e)g(side)h(e\013ects,)f(suc) o(h)g(as)g(assigning)g(the)h(v)m(alues)g(of)f(certain)0 1081 y(v)m(ariables)i(or)d(doing)i(input)g(or)f(output)g(op)q (erations.)62 1171 y(Unlik)o(e)24 b(most)e(languages,)i(functions)g(in) f(Octa)o(v)o(e)g(ma)o(y)e(return)i(m)o(ultiple)i(v)m(alues.)43 b(F)l(or)22 b(example,)j(the)0 1234 y(follo)o(wing)16 b(statemen)o(t)120 1311 y Fr([u,)23 b(s,)h(v])g(=)f(svd)h(\(a\))0 1401 y Fv(computes)16 b(the)g(singular)h(v)m(alue)g(decomp)q(osition)g (of)e(the)h(matrix)g(`)p Fr(a)p Fv(')f(and)h(assigns)g(the)g(three)g (result)g(matrices)0 1463 y(to)f(`)p Fr(u)p Fv(',)e(`)p Fr(s)p Fv(',)h(and)i(`)p Fr(v)p Fv('.)62 1553 y(The)f(left)h(side)g(of) e(a)h(m)o(ultiple)h(assignmen)o(t)f(expression)h(is)g(itself)f(a)g (list)h(of)e(expressions,)i(and)f(is)g(allo)o(w)o(ed)h(to)0 1616 y(b)q(e)g(a)f(list)h(of)e(v)m(ariable)j(names)e(or)g(index)h (expressions.)21 b(See)16 b(also)f(Section)h(3.5)e([Index)i (Expressions],)f(page)g(26,)0 1678 y(and)g(Section)h(3.13)e([Assignmen) o(t)i(Ops],)e(page)i(37.)0 1819 y Fj(3.7.1)30 b(Call)15 b(b)n(y)h(V)-5 b(alue)62 1930 y Fv(In)22 b(Octa)o(v)o(e,)h(unlik)o(e)g (F)l(ortran,)e(function)i(argumen)o(ts)d(are)h(passed)h(b)o(y)f(v)m (alue,)j(whic)o(h)f(means)e(that)g(eac)o(h)0 1992 y(argumen)o(t)c(in)i (a)e(function)i(call)f(is)h(ev)m(aluated)g(and)e(assigned)i(to)e(a)g (temp)q(orary)g(lo)q(cation)i(in)f(memory)g(b)q(efore)0 2054 y(b)q(eing)c(passed)f(to)f(the)g(function.)20 b(There)13 b(is)g(curren)o(tly)g(no)f(w)o(a)o(y)g(to)g(sp)q(ecify)i(that)e(a)g (function)h(parameter)f(should)0 2116 y(b)q(e)18 b(passed)f(b)o(y)h (reference)f(instead)h(of)f(b)o(y)g(v)m(alue.)27 b(This)18 b(means)f(that)g(it)g(is)h(imp)q(ossible)i(to)c(directly)j(alter)e(the) 0 2179 y(v)m(alue)h(of)f(function)h(parameter)f(in)h(the)f(calling)i (function.)26 b(It)18 b(can)f(only)h(c)o(hange)f(the)g(lo)q(cal)h(cop)o (y)f(within)i(the)0 2241 y(function)d(b)q(o)q(dy)l(.)21 b(F)l(or)14 b(example,)i(the)f(function)120 2319 y Fr(function)23 b(f)g(\(x,)h(n\))168 2368 y(while)f(\(n--)g(>)h(0\))215 2418 y(disp)g(\(x\);)168 2468 y(endwhile)120 2518 y(endfunction)0 2608 y Fv(displa)o(ys)e(the)g(v)m(alue)g(of)f(the)g(\014rst)g(argumen)o (t)f Fp(n)i Fv(times.)38 b(In)22 b(this)f(function,)j(the)d(v)m (ariable)h Fp(n)g Fv(is)g(used)f(as)g(a)0 2670 y(temp)q(orary)11 b(v)m(ariable)j(without)e(ha)o(ving)h(to)e(w)o(orry)g(that)h(its)g(v)m (alue)i(migh)o(t)e(also)g(c)o(hange)g(in)h(the)g(calling)g(function.)p eop %%Page: 31 33 31 32 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(31)0 183 y(Call)12 b(b)o(y)g(v)m(alue)h(is)f(also)f(useful)i(b)q (ecause)g(it)f(is)g(alw)o(a)o(ys)f(p)q(ossible)i(to)e(pass)g(constan)o (ts)g(for)g(an)o(y)g(function)i(parameter)0 246 y(without)i(\014rst)g (ha)o(ving)g(to)g(determine)h(that)f(the)g(function)h(will)h(not)e (attempt)f(to)h(mo)q(dify)g(the)h(parameter.)62 330 y(The)h(caller)g (ma)o(y)e(use)i(a)e(v)m(ariable)j(as)e(the)g(expression)h(for)e(the)h (argumen)o(t,)g(but)g(the)g(called)i(function)f(do)q(es)0 392 y(not)f(kno)o(w)g(this:)23 b(it)16 b(only)h(kno)o(ws)f(what)g(v)m (alue)h(the)g(argumen)o(t)f(had.)23 b(F)l(or)16 b(example,)h(giv)o(en)g (a)f(function)h(called)0 454 y(as)120 526 y Fr(foo)23 b(=)h("bar";)120 576 y(fcn)f(\(foo\))0 660 y Fv(y)o(ou)15 b(should)h(not)e(think)i(of)f(the)g(argumen)o(t)f(as)h(b)q(eing)h (\\the)f(v)m(ariable)h Fr(foo)p Fv(.")j(Instead,)c(think)h(of)f(the)g (argumen)o(t)0 722 y(as)g(the)g(string)g(v)m(alue,)h Fr("bar")p Fv(.)0 846 y Fj(3.7.2)30 b(Recursion)62 951 y Fv(Recursiv)o(e)14 b(function)g(calls)g(are)e(allo)o(w)o(ed.)20 b(A)13 b Fp(recursiv)o(e)g(function)h Fv(is)f(one)g(whic)o(h)h(calls)f (itself,)h(either)g(directly)0 1013 y(or)h(indirectly)l(.)22 b(F)l(or)15 b(example,)g(here)h(is)g(an)f(ine\016cien)o(t)942 996 y Fk(1)977 1013 y Fv(w)o(a)o(y)f(to)h(compute)g(the)g(factorial)h (of)e(a)h(giv)o(en)h(in)o(teger:)120 1085 y Fr(function)23 b(retval)g(=)h(fact)f(\(n\))168 1134 y(if)g(\(n)h(>)g(0\))215 1184 y(retval)f(=)h(n)g(*)g(fact)f(\(n-1\);)168 1234 y(else)215 1284 y(retval)g(=)h(1;)168 1334 y(endif)120 1384 y(endfunction)62 1468 y Fv(This)17 b(function)h(is)f(recursiv)o(e) g(b)q(ecause)g(it)g(calls)g(itself)h(directly)l(.)25 b(It)17 b(ev)o(en)o(tually)g(terminates)f(b)q(ecause)i(eac)o(h)0 1530 y(time)f(it)g(calls)g(itself,)h(it)f(uses)f(an)h(argumen)o(t)f (that)g(is)h(one)f(less)i(than)e(w)o(as)g(used)h(for)f(the)h(previous)g (call.)25 b(Once)0 1592 y(the)15 b(argumen)o(t)g(is)g(no)h(longer)f (greater)f(than)h(zero,)g(it)h(do)q(es)f(not)g(call)h(itself,)g(and)f (the)h(recursion)g(ends.)62 1676 y(There)22 b(is)g(curren)o(tly)g(no)f (limit)i(on)f(the)f(recursion)h(depth,)i(so)d(in\014nite)i(recursion)f (is)g(p)q(ossible.)41 b(If)22 b(this)0 1739 y(happ)q(ens,)15 b(Octa)o(v)o(e)f(will)i(consume)f(more)f(and)g(more)g(memory)g (attempting)g(to)f(store)h(in)o(termediate)h(v)m(alues)h(for)0 1801 y(eac)o(h)c(function)h(call)h(con)o(text)d(un)o(til)j(there)e(are) g(no)g(more)g(resources)g(a)o(v)m(ailable.)21 b(This)12 b(is)h(ob)o(viously)g(undesirable,)0 1863 y(and)g(will)h(probably)f(b)q (e)g(\014xed)h(in)f(some)f(future)h(v)o(ersion)g(of)f(Octa)o(v)o(e)g(b) o(y)h(allo)o(wing)g(users)g(to)f(sp)q(ecify)i(a)e(maxim)o(um)0 1925 y(allo)o(w)o(able)k(recursion)g(depth.)0 2063 y Fu(3.8)33 b(Global)16 b(V)-6 b(ariables)62 2168 y Fv(A)15 b(v)m(ariable)h(that)e(has)h(b)q(een)g(declared)h Fp(global)h Fv(ma)o(y)d(b)q(e)i(accessed)f(from)f(within)i(a)e(function)i(b)q(o)q (dy)f(without)0 2230 y(ha)o(ving)g(to)g(pass)g(it)g(as)g(a)g(formal)g (parameter.)62 2314 y(A)i(v)m(ariable)h(ma)o(y)d(b)q(e)i(declared)h (global)f(using)g(a)f Fr(global)g Fv(declaration)h(statemen)o(t.)23 b(The)16 b(follo)o(wing)i(state-)0 2376 y(men)o(ts)d(are)g(all)h (global)g(declarations.)120 2448 y Fr(global)23 b(a)120 2498 y(global)g(b)h(=)f(2)p 0 2551 600 2 v 21 2590 a Fk(1)62 2606 y Fv(It)e(w)o(ould)g(b)q(e)g(m)o(uc)o(h)f(b)q(etter)h(to)f (use)h Fr(prod)14 b(\(1:n\))p Fv(,)21 b(or)f Fr(gamma)14 b(\(n+1\))20 b Fv(instead,)i(after)e(\014rst)g(c)o(hec)o(king)i(to)62 2668 y(ensure)16 b(that)f(the)g(v)m(alue)h Fr(n)f Fv(is)h(actually)g(a) f(p)q(ositiv)o(e)h(in)o(teger.)p eop %%Page: 32 34 32 33 bop 0 -58 a Fv(32)1766 b(Octa)o(v)o(e)120 183 y Fr(global)23 b(c)h(=)f(3,)h(d,)g(e)f(=)h(5)62 278 y Fv(It)19 b(is)h(necessary)g(declare)g(a)f(v)m(ariable)h(as)f(global)h(within)g (a)f(function)h(b)q(o)q(dy)g(in)g(order)f(to)f(access)i(it.)32 b(F)l(or)0 341 y(example,)120 423 y Fr(global)23 b(x)120 473 y(function)g(f)g(\(\))120 523 y(x)h(=)f(1;)120 573 y(endfunction)120 623 y(f)h(\(\))0 718 y Fv(do)q(es)18 b Fp(not)h Fv(set)f(the)g(v)m(alue)h(of)f(the)g(global)h(v)m(ariable)g (`)p Fr(x)p Fv(')e(to)h(1.)28 b(In)19 b(order)f(to)f(c)o(hange)h(the)g (v)m(alue)i(of)d(the)h(global)0 780 y(v)m(ariable)f(`)p Fr(x)p Fv(',)c(y)o(ou)i(m)o(ust)g(also)g(declare)h(it)g(to)e(b)q(e)i (global)g(within)g(the)g(function)g(b)q(o)q(dy)l(,)f(lik)o(e)i(this)120 863 y Fr(function)23 b(f)g(\(\))168 913 y(global)g(x;)168 963 y(x)g(=)h(1;)120 1012 y(endfunction)62 1108 y Fv(P)o(assing)14 b(a)g(global)g(v)m(ariable)h(in)g(a)f(function)h(parameter)e(list)h (will)i(mak)o(e)d(a)h(lo)q(cal)h(cop)o(y)f(and)g(not)f(mo)q(dify)i(the) 0 1170 y(global)h(v)m(alue.)21 b(F)l(or)15 b(example:)120 1253 y Fr(octave:1>)23 b(function)f(f)i(\(x\))120 1302 y(>)g(x)f(=)h(3)120 1352 y(>)g(endfunction)120 1402 y(octave:2>)f (global)g(x)g(=)h(0)120 1452 y(octave:3>)f(x)334 b(#)23 b(This)h(is)f(the)h(value)f(of)g(the)h(global)f(variable.)120 1502 y(x)h(=)f(0)120 1551 y(octave:4>)g(f)g(\(x\))120 1601 y(x)h(=)f(3)478 b(#)23 b(The)h(value)f(of)h(the)f(local)g (variable)g(x)h(is)f(3.)120 1651 y(octave:5>)g(x)334 b(#)23 b(But)h(it)f(was)h(a)g(*copy*)f(so)g(the)h(global)f(variable)120 1701 y(x)h(=)f(0)478 b(#)23 b(remains)g(unchanged.)0 1882 y Fu(3.9)33 b(Keyw)n(ords)62 1998 y Fv(The)16 b(follo)o(wing)g (iden)o(ti\014ers)g(are)f(k)o(eyw)o(ords,)f(and)i(ma)o(y)e(not)h(b)q(e) h(used)g(as)e(v)m(ariable)j(or)e(function)h(names:)120 2081 y Fr(break)166 b(endfor)214 b(function)95 b(return)120 2131 y(continue)f(endfunction)g(global)143 b(while)120 2181 y(else)190 b(endif)238 b(gplot)120 2231 y(elseif)142 b(endwhile)166 b(gsplot)120 2280 y(end)214 b(for)286 b(if)62 2376 y Fv(The)18 b(follo)o(wing)h(command-lik)o(e)g(functions)g (are)e(also)h(k)o(eyw)o(ords,)g(and)g(ma)o(y)f(not)h(b)q(e)g(used)h(as) e(v)m(ariable)i(or)0 2438 y(function)d(names:)120 2521 y Fr(casesen)71 b(document)166 b(history)g(set)120 2570 y(cd)191 b(edit_history)70 b(load)238 b(show)120 2620 y(clear)119 b(help)262 b(ls)286 b(who)120 2670 y(dir)167 b(format)214 b(run_history)70 b(save)p eop %%Page: 33 35 33 34 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(33)0 183 y Fu(3.10)32 b(Arithmetic)15 b(Op)r(erators)62 288 y Fv(The)h(follo)o(wing)g(arithmetic)f(op)q(erators)g(are)g(a)o(v)m (ailable,)h(and)f(w)o(ork)g(on)g(scalars)g(and)g(matrices.)0 384 y Fp(x)j Fr(+)d Fp(y)135 b Fv(Addition.)24 b(If)16 b(b)q(oth)h(op)q(erands)f(are)g(matrices,)g(the)g(n)o(um)o(b)q(er)g(of) g(ro)o(ws)f(and)h(columns)h(m)o(ust)f(b)q(oth)240 447 y(agree.)30 b(If)19 b(one)g(op)q(erand)g(is)g(a)f(scalar,)h(its)g(v)m (alue)h(is)f(added)h(to)e(all)h(the)g(elemen)o(ts)g(of)g(the)f(other) 240 509 y(op)q(erand.)0 597 y Fp(x)g Fr(.+)d Fp(y)111 b Fv(Elemen)o(t)16 b(b)o(y)f(elemen)o(t)h(addition.)21 b(This)15 b(op)q(erator)g(is)h(equiv)m(alen)o(t)g(to)f Fr(+)p Fv(.)0 686 y Fp(x)j Fr(-)d Fp(y)135 b Fv(Subtraction.)24 b(If)16 b(b)q(oth)h(op)q(erands)g(are)f(matrices,)g(the)g(n)o(um)o(b)q (er)h(of)f(ro)o(ws)f(and)i(columns)g(of)f(b)q(oth)240 748 y(m)o(ust)f(agree.)0 837 y Fp(x)j Fr(.-)d Fp(y)111 b Fv(Elemen)o(t)16 b(b)o(y)f(elemen)o(t)h(subtraction.)k(This)15 b(op)q(erator)g(is)h(equiv)m(alen)o(t)g(to)f Fr(-)p Fv(.)0 925 y Fp(x)j Fr(*)d Fp(y)135 b Fv(Matrix)17 b(m)o(ultiplication.)28 b(The)17 b(n)o(um)o(b)q(er)h(of)f(columns)h(of)e(`)p Fr(x)p Fv(')h(m)o(ust)f(agree)h(with)h(the)f(n)o(um)o(b)q(er)g(of)240 987 y(ro)o(ws)d(of)h(`)p Fr(y)p Fv('.)0 1076 y Fp(x)j Fr(.*)d Fp(y)111 b Fv(Elemen)o(t)15 b(b)o(y)f(elemen)o(t)h(m)o (ultiplication.)22 b(If)14 b(b)q(oth)g(op)q(erands)h(are)f(matrices,)g (the)g(n)o(um)o(b)q(er)g(of)g(ro)o(ws)240 1138 y(and)h(columns)h(m)o (ust)f(b)q(oth)g(agree.)0 1227 y Fp(x)j Fr(/)d Fp(y)135 b Fv(Righ)o(t)16 b(division.)21 b(This)16 b(is)g(conceptually)h(equiv)m (alen)o(t)g(to)d(the)i(expression)360 1290 y Fr(\(inverse)23 b(\(y'\))g(*)h(x'\)')240 1365 y Fv(but)15 b(it)h(is)f(computed)h (without)f(forming)g(the)h(in)o(v)o(erse)f(of)g(`)p Fr(y')p Fv('.)240 1440 y(If)j(the)g(system)g(is)g(not)g(square,)g(or)f(if)i (the)f(co)q(e\016cien)o(t)h(matrix)e(is)i(singular,)g(a)e(minim)o(um)i (norm)240 1503 y(solution)d(is)g(computed.)0 1591 y Fp(x)i Fr(./)d Fp(y)111 b Fv(Elemen)o(t)16 b(b)o(y)f(elemen)o(t)h(righ)o(t)f (division.)0 1680 y Fp(x)j Fr(\\)d Fp(y)135 b Fv(Left)15 b(division.)22 b(This)16 b(is)g(conceptually)h(equiv)m(alen)o(t)f(to)f (the)g(expression)360 1743 y Fr(inverse)23 b(\(x\))g(*)h(y)240 1818 y Fv(but)15 b(it)h(is)f(computed)h(without)f(forming)g(the)h(in)o (v)o(erse)f(of)g(`)p Fr(x)p Fv('.)240 1893 y(If)j(the)g(system)g(is)g (not)g(square,)g(or)f(if)i(the)f(co)q(e\016cien)o(t)h(matrix)e(is)i (singular,)g(a)e(minim)o(um)i(norm)240 1956 y(solution)d(is)g (computed.)0 2044 y Fp(x)i Fr(.\\)d Fp(y)111 b Fv(Elemen)o(t)15 b(b)o(y)f(elemen)o(t)h(left)g(division.)21 b(Eac)o(h)15 b(elemen)o(t)g(of)f(`)p Fr(y)p Fv(')f(is)i(divided)h(b)o(y)f(eac)o(h)f (corresp)q(onding)240 2106 y(elemen)o(t)i(of)f(`)p Fr(x)p Fv('.)0 2195 y Fp(x)j Fr(^)d Fp(y)0 2257 y(x)j Fr(**)d Fp(y)111 b Fv(P)o(o)o(w)o(er)11 b(op)q(erator.)18 b(If)13 b Fp(x)i Fv(and)e Fp(y)j Fv(are)c(b)q(oth)g(scalars,)h(this)f(op)q (erator)g(returns)g Fp(x)k Fv(raised)c(to)g(the)g(p)q(o)o(w)o(er)240 2319 y Fp(y)p Fv(.)20 b(If)14 b Fp(x)k Fv(is)d(a)g(scalar)f(and)h Fp(y)j Fv(is)d(a)g(square)f(matrix,)g(the)h(result)g(is)g(computed)g (using)g(an)g(eigen)o(v)m(alue)240 2382 y(expansion.)20 b(If)14 b Fp(x)i Fv(is)d(a)g(square)g(matrix.)19 b(the)13 b(result)h(is)g(computed)f(b)o(y)g(rep)q(eated)h(m)o(ultiplication)h (if)240 2444 y Fp(y)k Fv(is)c(an)g(in)o(teger,)g(and)g(b)o(y)f(an)h (eigen)o(v)m(alue)i(expansion)f(if)f Fp(y)k Fv(is)c(not)g(an)f(in)o (teger.)20 b(An)15 b(error)g(results)240 2506 y(if)h(b)q(oth)f Fp(x)j Fv(and)e Fp(y)j Fv(are)c(matrices.)240 2582 y(The)g(implemen)o (tation)i(of)e(this)g(op)q(erator)g(needs)h(to)e(b)q(e)i(impro)o(v)o (ed.)0 2670 y Fp(x)i Fr(.^)d Fp(y)p eop %%Page: 34 36 34 35 bop 0 -58 a Fv(34)1766 b(Octa)o(v)o(e)0 183 y Fp(x)18 b Fr(.**)d Fp(y)87 b Fv(Elemen)o(t)13 b(b)o(y)f(elemen)o(t)h(p)q(o)o(w) o(er)f(op)q(erator.)18 b(If)12 b(b)q(oth)g(op)q(erands)h(are)f (matrices,)g(the)h(n)o(um)o(b)q(er)f(of)g(ro)o(ws)240 246 y(and)j(columns)h(m)o(ust)f(b)q(oth)g(agree.)0 334 y Fr(-)p Fp(x)192 b Fv(Negation.)0 423 y Fr(+)p Fp(x)g Fv(Unary)15 b(plus.)21 b(This)16 b(op)q(erator)e(has)h(no)g(e\013ect)g (on)g(the)h(op)q(erand.)0 511 y Fp(x)s Fr(')189 b Fv(Complex)20 b(conjugate)f(transp)q(ose.)32 b(F)l(or)19 b(real)g(argumen)o(ts,)g (this)h(op)q(erator)f(is)g(the)h(same)f(as)g(the)240 573 y(transp)q(ose)c(op)q(erator.)20 b(F)l(or)15 b(complex)h(argumen)o (ts,)e(this)i(op)q(erator)f(is)h(equiv)m(alen)o(t)h(to)e(the)g(expres-) 240 636 y(sion)360 699 y Fr(conj)23 b(\(x.'\))0 787 y Fp(x)p Fr(.')168 b Fv(T)l(ransp)q(ose.)62 884 y(Note)17 b(that)g(b)q(ecause)h(Octa)o(v)o(e's)e(elemen)o(t)i(b)o(y)f(elemen)o(t) h(op)q(erators)f(b)q(egin)h(with)g(a)f(`)p Fr(.)p Fv(',)f(there)i(is)f (a)g(p)q(ossible)0 946 y(am)o(biguit)o(y)e(for)g(statemen)o(ts)f(lik)o (e)120 1018 y Fr(1./m)0 1101 y Fv(b)q(ecause)k(the)f(p)q(erio)q(d)h (could)g(b)q(e)f(in)o(terpreted)h(either)f(as)g(part)f(of)g(the)h (constan)o(t)f(or)g(as)h(part)f(of)g(the)h(op)q(erator.)0 1164 y(T)l(o)e(resolv)o(e)g(this)h(con\015ict,)g(Octa)o(v)o(e)e(treats) h(the)g(expression)h(as)f(if)g(y)o(ou)g(had)h(t)o(yp)q(ed)120 1235 y Fr(\(1\))23 b(./)h(m)0 1319 y Fv(and)15 b(not)120 1390 y Fr(\(1.\))23 b(/)h(m)0 1474 y Fv(Although)17 b(this)f(is)h (inconsisten)o(t)g(with)f(the)g(normal)g(b)q(eha)o(vior)h(of)e(Octa)o (v)o(e's)h(lexer,)g(whic)o(h)h(usually)h(prefers)e(to)0 1536 y(break)f(the)g(input)h(in)o(to)f(tok)o(ens)g(b)o(y)g(preferring)g (the)g(longest)g(p)q(ossible)i(matc)o(h)e(at)f(an)o(y)h(giv)o(en)g(p)q (oin)o(t,)h(it)f(is)g(more)0 1598 y(useful)h(in)g(this)g(case.)0 1734 y Fu(3.11)32 b(Comparison)13 b(Op)r(erators)62 1838 y Fp(Comparison)22 b(op)q(erators)g Fv(compare)f(n)o(umeric)i(v)m (alues)f(for)f(relationships)j(suc)o(h)d(as)h(equalit)o(y)l(.)39 b(They)22 b(are)0 1901 y(written)15 b(using)h Fp(relational)g(op)q (erators)p Fv(,)e(whic)o(h)i(are)f(a)g(sup)q(erset)h(of)e(those)h(in)h (C.)62 1984 y(All)i(of)e(Octa)o(v)o(e's)g(comparison)h(op)q(erators)e (return)i(a)f(v)m(alue)i(of)e(1)g(if)h(the)g(comparison)g(is)g(true,)f (or)g(0)h(if)g(it)f(is)0 2047 y(false.)28 b(F)l(or)17 b(matrix)h(v)m(alues,)h(they)f(all)h(w)o(ork)d(on)i(an)g(elemen)o(t-b)o (y-elemen)o(t)h(basis.)29 b(F)l(or)17 b(example,)i(ev)m(aluating)0 2109 y(the)c(expression)120 2180 y Fr([1,)23 b(2;)h(3,)g(4])f(==)h([1,) f(3;)h(2,)f(4])0 2264 y Fv(returns)15 b(the)g(result)120 2335 y Fr(ans)23 b(=)168 2435 y(1)47 b(0)168 2485 y(0)g(1)0 2581 y Fp(x)18 b Fr(<)d Fp(y)135 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(less)g(than)f Fp(y)p Fv(.)0 2670 y Fp(x)j Fr(<=)d Fp(y)111 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(less)g(than)f (or)g(equal)h(to)e Fp(y)p Fv(.)p eop %%Page: 35 37 35 36 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(35)0 183 y Fp(x)18 b Fr(==)d Fp(y)111 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(equal)g(to)f Fp(y)p Fv(.)0 275 y Fp(x)j Fr(>=)d Fp(y)111 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(greater)e(than)h(or)g(equal)h(to)f Fp(y)p Fv(.)0 367 y Fp(x)j Fr(>)d Fp(y)135 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(greater)e(than)h Fp(y)p Fv(.)0 458 y Fp(x)j Fr(!=)d Fp(y)0 521 y(x)j Fr(~=)d Fp(y)0 583 y(x)j Fr(<>)d Fp(y)111 b Fv(T)l(rue)15 b(if)h Fp(x)i Fv(is)e(not)f(equal)h(to)e Fp(y)p Fv(.)62 683 y(F)l(or)i(matrix)g(and)h(v)o(ector)f(argumen)o(ts,) f(the)i(ab)q(o)o(v)o(e)f(table)h(should)g(b)q(e)g(read)g(as)f(\\an)g (elemen)o(t)h(of)f(the)h(result)0 745 y(matrix)c(\(v)o(ector\))g(is)h (true)g(if)g(the)g(corresp)q(onding)h(elemen)o(ts)f(of)f(the)h(argumen) o(t)f(matrices)h(\(v)o(ectors\))e(satisfy)i(the)0 807 y(sp)q(eci\014ed)j(condition")62 893 y(String)j(comparisons)f(should)i (b)q(e)f(p)q(erformed)f(with)h(the)f Fr(strcmp)g Fv(function,)i(not)e (with)g(the)h(comparison)0 955 y(op)q(erators)14 b(listed)j(ab)q(o)o(v) o(e.)i(See)d(Section)g(3.7)e([Calling)j(F)l(unctions],)e(page)g(29.)0 1097 y Fu(3.12)32 b(Bo)r(olean)15 b(Expressions)0 1245 y Fj(3.12.1)29 b(Elemen)n(t-b)n(y-elemen)n(t)18 b(Bo)r(olean)c(Op)r (erators)62 1351 y Fv(An)e(elemen)o(t-b)o(y-elemen)o(t)i Fp(b)q(o)q(olean)e(expression)h Fv(is)f(a)f(com)o(bination)i(of)e (comparison)h(expressions)g(or)f(matc)o(h-)0 1413 y(ing)20 b(expressions,)h(using)f(the)f(b)q(o)q(olean)h(op)q(erators)e(\\or")h (\(`)p Fr(|)p Fv('\),)f(\\and")h(\(`)p Fr(&)p Fv('\),)f(and)i(\\not")e (\(`)p Fr(!)p Fv('\),)g(along)i(with)0 1475 y(paren)o(theses)15 b(to)f(con)o(trol)g(nesting.)20 b(The)15 b(truth)f(of)h(the)f(b)q(o)q (olean)i(expression)f(is)g(computed)g(b)o(y)g(com)o(bining)h(the)0 1538 y(truth)e(v)m(alues)i(of)f(the)g(corresp)q(onding)h(elemen)o(ts)f (of)g(the)f(comp)q(onen)o(t)h(expressions.)21 b(A)15 b(v)m(alue)h(is)f(considered)i(to)0 1600 y(b)q(e)f(false)f(if)h(it)g (is)f(zero,)g(and)g(true)g(otherwise.)62 1685 y(Elemen)o(t-b)o (y-elemen)o(t)k(b)q(o)q(olean)g(expressions)f(can)g(b)q(e)g(used)g (wherev)o(er)g(comparison)f(expressions)i(can)e(b)q(e)0 1747 y(used.)k(They)15 b(can)h(b)q(e)g(used)g(in)g Fr(if)f Fv(and)g Fr(while)g Fv(statemen)o(ts.)k(Ho)o(w)o(ev)o(er,)14 b(b)q(efore)i(b)q(eing)g(used)g(in)g(the)g(condition)0 1810 y(of)h(an)g Fr(if)f Fv(or)h Fr(while)f Fv(statemen)o(t,)g(an)h (implicit)i(con)o(v)o(ersion)f(from)e(a)g(matrix)h(v)m(alue)h(to)f(a)f (scalar)h(v)m(alue)i(o)q(ccurs)0 1872 y(using)f(the)f(equiv)m(alen)o(t) i(of)e Fr(all)d(\(all)h(\()p Fp(x)s Fr(\)\))p Fv(.)25 b(That)17 b(is,)h(a)f(v)m(alue)h(used)g(as)e(the)i(condition)g(in)g(an) f Fr(if)g Fv(or)g Fr(while)0 1934 y Fv(statemen)o(t)d(is)i(only)g(true) f(if)g Fp(all)j Fv(of)d(its)g(elemen)o(ts)h(are)f(nonzero.)62 2019 y(Lik)o(e)g(comparison)f(op)q(erations,)g(eac)o(h)g(elemen)o(t)g (of)g(an)f(elemen)o(t-b)o(y-elemen)o(t)j(b)q(o)q(olean)f(expression)f (also)g(has)0 2082 y(a)h(n)o(umeric)h(v)m(alue)g(\(1)e(if)i(true,)f(0)f (if)i(false\))f(that)f(comes)h(in)o(to)g(pla)o(y)h(if)f(the)g(result)h (of)e(the)h(b)q(o)q(olean)i(expression)e(is)0 2144 y(stored)g(in)h(a)f (v)m(ariable,)h(or)f(used)g(in)h(arithmetic.)62 2229 y(Here)g(are)f(descriptions)h(of)f(the)g(three)h(elemen)o(t-b)o (y-elemen)o(t)h(b)q(o)q(olean)f(op)q(erators.)0 2329 y Fp(b)q(o)q(olean1)k Fr(&)15 b Fp(b)q(o)q(olean2)240 2392 y Fv(Elemen)o(ts)c(of)g(the)g(result)g(are)g(true)g(if)g(b)q(oth)h (corresp)q(onding)g(elemen)o(ts)f(of)g Fp(b)q(o)q(olean1)k Fv(and)c Fp(b)q(o)q(olean2)240 2454 y Fv(are)k(true.)0 2545 y Fp(b)q(o)q(olean1)20 b Fr(|)15 b Fp(b)q(o)q(olean2)240 2608 y Fv(Elemen)o(ts)i(of)f(the)h(result)f(are)h(true)f(if)h(either)g (of)f(the)h(corresp)q(onding)g(elemen)o(ts)h(of)e Fp(b)q(o)q(olean1)k Fv(or)240 2670 y Fp(b)q(o)q(olean2)g Fv(is)15 b(true.)p eop %%Page: 36 38 36 37 bop 0 -58 a Fv(36)1766 b(Octa)o(v)o(e)0 183 y Fr(!)15 b Fp(b)q(o)q(olean)0 246 y Fr(~)g Fp(b)q(o)q(olean)48 b Fv(Eac)o(h)15 b(elemen)o(t)h(of)f(the)g(result)h(is)f(true)g(if)h (the)f(corresp)q(onding)i(elemen)o(t)e(of)g Fp(b)q(o)q(olean)h Fv(is)g(false.)62 344 y(F)l(or)h(matrix)g(op)q(erands,)h(these)g(op)q (erators)f(w)o(ork)f(on)i(an)f(elemen)o(t-b)o(y-elemen)o(t)i(basis.)27 b(F)l(or)17 b(example,)i(the)0 406 y(expression)120 478 y Fr([1,)k(0;)h(0,)g(1])f(&)h([1,)f(0;)h(2,)g(3])0 562 y Fv(returns)15 b(a)g(t)o(w)o(o)f(b)o(y)h(t)o(w)o(o)f(iden)o(tit)o(y)i (matrix.)62 646 y(F)l(or)e(the)h(binary)g(op)q(erators,)f(the)h (dimensions)h(of)e(the)h(op)q(erands)g(m)o(ust)f(conform)h(if)g(b)q (oth)g(are)f(matrices.)20 b(If)0 709 y(one)e(of)f(the)g(op)q(erands)h (is)g(a)f(scalar)h(and)f(the)h(other)f(a)g(matrix,)g(the)h(op)q(erator) f(is)h(applied)h(to)e(the)g(scalar)h(and)0 771 y(eac)o(h)d(elemen)o(t)h (of)f(the)g(matrix.)62 855 y(F)l(or)28 b(the)g(binary)h(elemen)o(t-b)o (y-elemen)o(t)h(b)q(o)q(olean)f(op)q(erators,)h(b)q(oth)f(sub)q (expressions)g Fp(b)q(o)q(olean1)k Fv(and)0 918 y Fp(b)q(o)q(olean2)25 b Fv(are)20 b(ev)m(aluated)i(b)q(efore)f(computing)g(the)g(result.)37 b(This)21 b(can)g(mak)o(e)f(a)h(di\013erence)h(when)f(the)g(ex-)0 980 y(pressions)16 b(ha)o(v)o(e)f(side)h(e\013ects.)j(F)l(or)c (example,)h(in)g(the)f(expression)120 1052 y Fr(a)24 b(&)f(b++)0 1136 y Fv(the)15 b(v)m(alue)i(of)d(the)i(v)m(ariable)g Fp(b)h Fv(is)e(incremen)o(ted)i(ev)o(en)e(if)h(the)f(v)m(ariable)i Fp(a)e Fv(is)h(zero.)62 1220 y(This)21 b(b)q(eha)o(vior)g(is)f (necessary)h(for)e(the)h(b)q(o)q(olean)h(op)q(erators)f(to)f(w)o(ork)g (as)h(describ)q(ed)i(for)e(matrix-v)m(alued)0 1283 y(op)q(erands.)0 1407 y Fj(3.12.2)29 b(Short-circuit)17 b(Bo)r(olean)c(Op)r(erators)62 1512 y Fv(Com)o(bined)20 b(with)e(the)h(implicit)i(con)o(v)o(ersion)e (to)f(scalar)g(v)m(alues)i(in)g Fr(if)e Fv(and)h Fr(while)f Fv(conditions,)i(Octa)o(v)o(e's)0 1574 y(elemen)o(t-b)o(y-elemen)o(t)g (b)q(o)q(olean)e(op)q(erators)f(are)g(often)h(su\016cien)o(t)g(for)f(p) q(erforming)h(most)f(logical)i(op)q(erations.)0 1637 y(Ho)o(w)o(ev)o(er,)d(it)i(is)f(sometimes)g(desirable)i(to)d(stop)h(ev) m(aluating)h(a)f(b)q(o)q(olean)h(expression)g(as)f(so)q(on)g(as)g(the)g (o)o(v)o(erall)0 1699 y(truth)e(v)m(alue)h(can)g(b)q(e)f(determined.)22 b(Octa)o(v)o(e's)14 b Fp(short-circuit)j Fv(b)q(o)q(olean)f(op)q (erators)e(w)o(ork)h(this)g(w)o(a)o(y)l(.)0 1797 y Fp(b)q(o)q(olean1)20 b Fr(&&)14 b Fp(b)q(o)q(olean2)240 1859 y Fv(The)19 b(expression)g Fp(b)q(o)q(olean1)k Fv(is)18 b(ev)m(aluated)i(and)e(con)o(v)o(erted)h (to)e(a)h(scalar)h(using)g(the)f(equiv)m(alen)o(t)240 1922 y(of)h(the)g(op)q(eration)g Fr(all)c(\(all)f(\()p Fp(b)q(o)q(olean1)t Fr(\)\))p Fv(.)31 b(If)20 b(it)f(is)g(false,)h(the) f(result)h(of)e(the)i(expression)f(is)240 1984 y(0.)28 b(If)18 b(it)g(is)g(true,)g(the)g(expression)h Fp(b)q(o)q(olean2)j Fv(is)d(ev)m(aluated)g(and)f(con)o(v)o(erted)g(to)f(a)g(scalar)h(using) 240 2046 y(the)g(equiv)m(alen)o(t)h(of)e(the)g(op)q(eration)h Fr(all)d(\(all)f(\()p Fp(b)q(o)q(olean1)t Fr(\)\))p Fv(.)27 b(If)18 b(it)g(is)g(true,)f(the)h(result)g(of)f(the)240 2108 y(expression)f(is)g(1.)j(Otherwise,)d(the)f(result)h(of)f(the)g (expression)h(is)g(0.)0 2198 y Fp(b)q(o)q(olean1)k Fr(||)14 b Fp(b)q(o)q(olean2)240 2261 y Fv(The)19 b(expression)g Fp(b)q(o)q(olean1)k Fv(is)18 b(ev)m(aluated)i(and)e(con)o(v)o(erted)h (to)e(a)h(scalar)h(using)g(the)f(equiv)m(alen)o(t)240 2323 y(of)h(the)h(op)q(eration)f Fr(all)c(\(all)f(\()p Fp(b)q(o)q(olean1)t Fr(\)\))p Fv(.)33 b(If)20 b(it)f(is)h(true,)g(the)g (result)g(of)f(the)g(expression)h(is)240 2385 y(1.)27 b(If)17 b(it)h(is)g(false,)g(the)g(expression)g Fp(b)q(o)q(olean2)k Fv(is)c(ev)m(aluated)h(and)e(con)o(v)o(erted)h(to)f(a)g(scalar)g(using) 240 2447 y(the)h(equiv)m(alen)o(t)h(of)e(the)g(op)q(eration)h Fr(all)d(\(all)f(\()p Fp(b)q(o)q(olean1)t Fr(\)\))p Fv(.)27 b(If)18 b(it)g(is)g(true,)f(the)h(result)g(of)f(the)240 2510 y(expression)f(is)g(1.)j(Otherwise,)d(the)f(result)h(of)f(the)g (expression)h(is)g(0.)62 2608 y(The)i(fact)e(that)h(b)q(oth)g(op)q (erands)g(ma)o(y)g(not)g(b)q(e)g(ev)m(aluated)i(b)q(efore)e (determining)i(the)e(o)o(v)o(erall)g(truth)g(v)m(alue)0 2670 y(of)e(the)g(expression)h(can)f(b)q(e)h(imp)q(ortan)o(t.)k(F)l(or) 14 b(example,)i(in)g(the)f(expression)p eop %%Page: 37 39 37 38 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(37)120 183 y Fr(a)24 b(&&)f(b++)0 270 y Fv(the)15 b(v)m(alue)i(of)d (the)i(v)m(ariable)g Fp(b)h Fv(is)e(only)h(incremen)o(ted)h(if)e(the)h (v)m(ariable)g Fp(a)f Fv(is)h(nonzero.)62 356 y(This)g(can)f(b)q(e)h (used)g(to)f(write)g(somewhat)f(more)h(concise)h(co)q(de.)21 b(F)l(or)14 b(example,)i(it)f(is)h(p)q(ossible)h(write)120 430 y Fr(function)23 b(f)g(\(a,)h(b,)g(c\))168 480 y(if)f(\(nargin)g(>) h(2)g(&&)f(isstr)g(\(c\)\))215 530 y(...)0 616 y Fv(instead)f(of)e(ha)o (ving)i(to)e(use)i(t)o(w)o(o)e Fr(if)h Fv(statemen)o(ts)f(to)g(a)o(v)o (oid)h(attempting)g(to)f(ev)m(aluate)i(an)f(argumen)o(t)g(that)0 679 y(do)q(esn't)15 b(exist.)120 753 y Fr(function)23 b(f)g(\(a,)h(b,)g(c\))168 803 y(if)f(\(nargin)g(>)h(2\))215 852 y(if)g(\(isstr)f(\(c\)\))263 902 y(...)0 1049 y Fu(3.13)32 b(Assignmen)n(t)13 b(Expressions)62 1156 y Fv(An)23 b Fp(assignmen)o(t)g Fv(is)f(an)g(expression)i(that)d(stores)g(a)h(new)h (v)m(alue)g(in)o(to)f(a)g(v)m(ariable.)42 b(F)l(or)22 b(example,)i(the)0 1218 y(follo)o(wing)16 b(expression)g(assigns)f(the) h(v)m(alue)g(1)f(to)f(the)i(v)m(ariable)g Fr(z)p Fv(:)120 1292 y Fr(z)24 b(=)f(1)62 1379 y Fv(After)c(this)i(expression)f(is)g (executed,)h(the)f(v)m(ariable)h Fr(z)f Fv(has)f(the)h(v)m(alue)h(1.)32 b(Whatev)o(er)19 b(old)h(v)m(alue)h Fr(z)f Fv(had)0 1441 y(b)q(efore)15 b(the)h(assignmen)o(t)f(is)h(forgotten.)62 1528 y(Assignmen)o(ts)f(can)f(store)f(string)i(v)m(alues)g(also.)k(F)l (or)14 b(example,)h(the)f(follo)o(wing)h(expression)g(w)o(ould)f(store) g(the)0 1590 y(v)m(alue)i Fr("this)f(food)f(is)h(good")g Fv(in)h(the)f(v)m(ariable)i Fr(message)p Fv(:)120 1664 y Fr(thing)23 b(=)h("food")120 1714 y(predicate)f(=)g("good")120 1764 y(message)g(=)h([)f("this)h(")f(,)h(thing)f(,)h(")g(is)f(")h(,)g (predicate)e(])0 1850 y Fv(\(This)15 b(also)h(illustrates)g (concatenation)f(of)g(strings.\))62 1937 y(The)j(`)p Fr(=)p Fv(')f(sign)i(is)f(called)h(an)f Fp(assignmen)o(t)g(op)q(erator) p Fv(.)27 b(It)18 b(is)g(the)g(simplest)h(assignmen)o(t)f(op)q(erator)f (b)q(ecause)0 1999 y(the)e(v)m(alue)i(of)d(the)i(righ)o(t-hand)f(op)q (erand)h(is)g(stored)e(unc)o(hanged.)62 2085 y(Most)e(op)q(erators)f (\(addition,)i(concatenation,)g(and)f(so)g(on\))g(ha)o(v)o(e)g(no)h (e\013ect)f(except)g(to)g(compute)h(a)f(v)m(alue.)20 b(If)0 2148 y(y)o(ou)15 b(ignore)h(the)f(v)m(alue,)h(y)o(ou)f(migh)o(t) g(as)g(w)o(ell)i(not)e(use)g(the)h(op)q(erator.)j(An)d(assignmen)o(t)f (op)q(erator)f(is)i(di\013eren)o(t.)0 2210 y(It)k(do)q(es)h(pro)q(duce) g(a)e(v)m(alue,)k(but)d(ev)o(en)g(if)h(y)o(ou)f(ignore)g(the)g(v)m (alue,)i(the)f(assignmen)o(t)f(still)h(mak)o(es)f(itself)h(felt)0 2272 y(through)15 b(the)g(alteration)g(of)g(the)g(v)m(ariable.)22 b(W)l(e)15 b(call)h(this)g(a)f Fp(side)h(e\013ect)p Fv(.)62 2359 y(The)21 b(left-hand)h(op)q(erand)f(of)f(an)g(assignmen)o(t)h (need)g(not)g(b)q(e)g(a)f(v)m(ariable)i(\(see)f(Section)g(3.4)f([V)l (ariables],)0 2421 y(page)d(25\).)24 b(It)17 b(can)g(also)f(b)q(e)i(an) f(elemen)o(t)g(of)g(a)f(matrix)h(\(see)g(Section)g(3.5)f([Index)i (Expressions],)f(page)g(26\))e(or)0 2483 y(a)i(list)h(of)f(return)g(v)m (alues)h(\(see)g(Section)g(3.7)e([Calling)i(F)l(unctions],)g(page)f (29\).)25 b(These)18 b(are)f(all)h(called)h Fp(lv)m(alues)p Fv(,)0 2545 y(whic)o(h)h(means)g(they)f(can)h(app)q(ear)f(on)g(the)h (left-hand)g(side)h(of)e(an)g(assignmen)o(t)g(op)q(erator.)32 b(The)20 b(righ)o(t-hand)0 2608 y(op)q(erand)g(ma)o(y)f(b)q(e)h(an)o(y) f(expression.)34 b(It)20 b(pro)q(duces)g(the)g(new)f(v)m(alue)i(whic)o (h)g(the)e(assignmen)o(t)h(stores)e(in)j(the)0 2670 y(sp)q(eci\014ed)c (v)m(ariable,)g(matrix)d(elemen)o(t,)i(or)f(list)h(of)e(return)i(v)m (alues.)p eop %%Page: 38 40 38 39 bop 0 -58 a Fv(38)1766 b(Octa)o(v)o(e)62 183 y(It)17 b(is)h(imp)q(ortan)o(t)e(to)g(note)h(that)f(v)m(ariables)j(do)e Fp(not)g Fv(ha)o(v)o(e)g(p)q(ermanen)o(t)g(t)o(yp)q(es.)25 b(The)17 b(t)o(yp)q(e)g(of)g(a)f(v)m(ariable)i(is)0 246 y(simply)i(the)e(t)o(yp)q(e)h(of)f(whatev)o(er)g(v)m(alue)h(it)g(happ)q (ens)h(to)e(hold)h(at)f(the)g(momen)o(t.)29 b(In)19 b(the)g(follo)o (wing)g(program)0 308 y(fragmen)o(t,)14 b(the)h(v)m(ariable)i Fr(foo)d Fv(has)h(a)g(n)o(umeric)h(v)m(alue)h(at)d(\014rst,)h(and)g(a)g (string)g(v)m(alue)i(later)e(on:)120 380 y Fr(octave:13>)22 b(foo)i(=)g(1)120 430 y(foo)f(=)h(1)120 479 y(octave:13>)e(foo)i(=)g ("bar")120 529 y(foo)f(=)h(bar)0 614 y Fv(When)19 b(the)f(second)h (assignmen)o(t)f(giv)o(es)g Fr(foo)g Fv(a)g(string)g(v)m(alue,)i(the)e (fact)g(that)g(it)g(previously)i(had)e(a)g(n)o(umeric)0 676 y(v)m(alue)e(is)g(forgotten.)62 760 y(Assigning)h(an)g(empt)o(y)e (matrix)h(`)p Fr([])p Fv(')f(w)o(orks)g(in)i(most)e(cases)h(to)g(allo)o (w)g(y)o(ou)g(to)g(delete)h(ro)o(ws)e(or)g(columns)i(of)0 823 y(matrices)h(and)f(v)o(ectors.)27 b(See)18 b(Section)g(3.2.1)e ([Empt)o(y)h(Matrices],)g(page)g(24.)27 b(F)l(or)17 b(example,)h(giv)o (en)g(a)g(4)f(b)o(y)g(5)0 885 y(matrix)e Fp(A)p Fv(,)g(the)g(assignmen) o(t)120 957 y Fr(A)24 b(\(3,)f(:\))h(=)f([])0 1042 y Fv(deletes)16 b(the)g(third)f(ro)o(w)g(of)f Fp(A)p Fv(,)h(and)h(the)f (assignmen)o(t)120 1114 y Fr(A)24 b(\(:,)f(1:2:5\))g(=)h([])0 1198 y Fv(deletes)16 b(the)g(\014rst,)e(third,)h(and)h(\014fth)f (columns.)62 1283 y(An)g(assignmen)o(t)f(is)h(an)g(expression,)g(so)f (it)h(has)f(a)h(v)m(alue.)20 b(Th)o(us,)15 b Fr(z)g(=)g(1)f Fv(as)g(an)h(expression)g(has)f(the)h(v)m(alue)h(1.)0 1345 y(One)g(consequence)h(of)d(this)i(is)g(that)e(y)o(ou)h(can)g (write)h(m)o(ultiple)h(assignmen)o(ts)e(together:)120 1417 y Fr(x)24 b(=)f(y)h(=)g(z)g(=)f(0)0 1501 y Fv(stores)13 b(the)g(v)m(alue)i(0)e(in)i(all)f(three)g(v)m(ariables.)21 b(It)13 b(do)q(es)h(this)g(b)q(ecause)h(the)e(v)m(alue)i(of)e Fr(z)i(=)g(0)p Fv(,)f(whic)o(h)g(is)g(0,)f(is)h(stored)0 1564 y(in)o(to)h Fr(y)p Fv(,)g(and)g(then)h(the)f(v)m(alue)h(of)f Fr(y)g(=)g(z)g(=)g(0)p Fv(,)g(whic)o(h)h(is)g(0,)e(is)i(stored)f(in)o (to)g Fr(x)p Fv(.)62 1648 y(This)h(is)g(also)f(true)g(of)g(assignmen)o (ts)g(to)f(lists)i(of)f(v)m(alues,)h(so)f(the)g(follo)o(wing)h(is)g(a)f (v)m(alid)h(expression)120 1720 y Fr([a,)23 b(b,)h(c])g(=)f([u,)h(s,)f (v])h(=)g(svd)f(\(a\))0 1805 y Fv(that)14 b(is)i(exactly)g(equiv)m (alen)o(t)h(to)120 1877 y Fr([u,)23 b(s,)h(v])g(=)f(svd)h(\(a\))120 1926 y(a)g(=)f(u)120 1976 y(b)h(=)f(s)120 2026 y(c)h(=)f(v)62 2111 y Fv(In)14 b(expressions)g(lik)o(e)g(this,)g(the)f(n)o(um)o(b)q (er)h(of)e(v)m(alues)j(in)f(eac)o(h)f(part)f(of)h(the)g(expression)h (need)g(not)f(matc)o(h.)19 b(F)l(or)0 2173 y(example,)d(the)f (expression)120 2245 y Fr([a,)23 b(b,)h(c,)g(d])f(=)h([u,)f(s,)h(v])g (=)f(svd)h(\(a\))0 2329 y Fv(is)18 b(equiv)m(alen)o(t)i(to)d(the)h (expression)h(ab)q(o)o(v)o(e,)f(except)g(that)f(the)h(v)m(alue)h(of)f (the)g(v)m(ariable)h(`)p Fr(d)p Fv(')e(is)h(left)h(unc)o(hanged,)0 2392 y(and)c(the)h(expression)120 2464 y Fr([a,)23 b(b])h(=)g([u,)f(s,) h(v])f(=)h(svd)g(\(a\))0 2548 y Fv(is)16 b(equiv)m(alen)o(t)h(to)120 2620 y Fr([u,)23 b(s,)h(v])g(=)f(svd)h(\(a\))120 2670 y(a)g(=)f(u)p eop %%Page: 39 41 39 40 bop 0 -58 a Fv(Chapter)15 b(3:)k(Expressions)1441 b(39)120 183 y Fr(b)24 b(=)f(s)62 267 y Fv(Y)l(ou)13 b(can)g(use)g(an)g(assignmen)o(t)f(an)o(ywhere)h(an)f(expression)i(is)f (called)h(for.)19 b(F)l(or)12 b(example,)h(it)g(is)h(v)m(alid)g(to)e (write)0 330 y Fr(x)j(!=)g(\(y)g(=)g(1\))e Fv(to)g(set)g Fr(y)h Fv(to)f(1)g(and)h(then)g(test)f(whether)h Fr(x)f Fv(equals)i(1.)k(But)13 b(this)h(st)o(yle)g(tends)g(to)f(mak)o(e)g (programs)0 392 y(hard)19 b(to)f(read.)30 b(Except)18 b(in)i(a)e(one-shot)g(program,)g(y)o(ou)h(should)g(rewrite)g(it)g(to)f (get)g(rid)h(of)f(suc)o(h)h(nesting)g(of)0 454 y(assignmen)o(ts.)h (This)15 b(is)h(nev)o(er)g(v)o(ery)e(hard.)0 591 y Fu(3.14)32 b(Incremen)n(t)14 b(Op)r(erators)62 696 y Fp(Incremen)o(t)f(op)q (erators)h Fv(increase)f(or)f(decrease)h(the)f(v)m(alue)i(of)e(a)g(v)m (ariable)h(b)o(y)g(1.)18 b(The)13 b(op)q(erator)e(to)h(incremen)o(t)0 758 y(a)17 b(v)m(ariable)h(is)f(written)g(as)f(`)p Fr(++)p Fv('.)24 b(It)17 b(ma)o(y)f(b)q(e)i(used)f(to)f(incremen)o(t)i(a)f(v)m (ariable)h(either)f(b)q(efore)h(or)e(after)g(taking)0 820 y(its)f(v)m(alue.)62 904 y(F)l(or)i(example,)h(to)f(pre-incremen)o (t)i(the)e(v)m(ariable)i Fp(x)p Fv(,)e(y)o(ou)g(w)o(ould)h(write)f Fr(++)p Fp(x)s Fv(.)27 b(This)18 b(w)o(ould)f(add)h(one)f(to)g Fp(x)0 967 y Fv(and)g(then)h(return)f(the)h(new)f(v)m(alue)i(of)d Fp(x)21 b Fv(as)c(the)g(result)h(of)f(the)g(expression.)27 b(It)17 b(is)h(exactly)g(the)f(same)g(as)g(the)0 1029 y(expression)f Fp(x)i Fr(=)d Fp(x)k Fr(+)c(1)p Fv(.)62 1113 y(T)l(o)20 b(p)q(ost-incremen)o(t)h(a)f(v)m(ariable)h Fp(x)p Fv(,)g(y)o(ou)e(w)o(ould)i(write)f Fp(x)s Fr(++)p Fv(.)34 b(This)21 b(adds)f(one)g(to)f(the)i(v)m(ariable)g Fp(x)p Fv(,)g(but)0 1175 y(returns)15 b(the)g(v)m(alue)h(that)f Fp(x)j Fv(had)d(prior)g(to)g(incremen)o(ting)h(it.)k(F)l(or)15 b(example,)g(if)h Fp(x)i Fv(is)d(equal)h(to)e(2,)h(the)g(result)g(of)0 1237 y(the)g(expression)h Fp(x)s Fr(++)f Fv(is)h(2,)f(and)g(the)g(new)h (v)m(alue)g(of)f Fp(x)j Fv(is)e(3.)62 1321 y(F)l(or)d(matrix)f(and)i(v) o(ector)e(argumen)o(ts,)g(the)h(incremen)o(t)h(and)f(decremen)o(t)h(op) q(erators)e(w)o(ork)g(on)h(eac)o(h)g(elemen)o(t)0 1384 y(of)i(the)g(op)q(erand.)62 1468 y(Here)h(is)f(a)g(list)h(of)f(all)h (the)f(incremen)o(t)h(and)g(decremen)o(t)f(expressions.)0 1565 y Fr(++)p Fp(x)168 b Fv(This)13 b(expression)h(incremen)o(ts)g (the)f(v)m(ariable)h Fp(x)p Fv(.)19 b(The)13 b(v)m(alue)h(of)f(the)g (expression)g(is)h(the)f Fp(new)k Fv(v)m(alue)240 1627 y(of)e Fp(x)p Fv(.)20 b(It)15 b(is)h(equiv)m(alen)o(t)g(to)f(the)g (expression)h Fp(x)j Fr(=)c Fp(x)j Fr(+)d(1)p Fv(.)0 1717 y Fr(--)p Fp(x)168 b Fv(This)13 b(expression)g(decremen)o(ts)g (the)f(v)m(ariable)i Fp(x)p Fv(.)19 b(The)12 b(v)m(alue)i(of)e(the)g (expression)h(is)g(the)f Fp(new)17 b Fv(v)m(alue)240 1779 y(of)e Fp(x)p Fv(.)20 b(It)15 b(is)h(equiv)m(alen)o(t)g(to)f(the)g (expression)h Fp(x)j Fr(=)c Fp(x)j Fr(-)d(1)p Fv(.)0 1868 y Fp(x)s Fr(++)165 b Fv(This)17 b(expression)h(causes)e(the)h(v)m (ariable)h Fp(x)h Fv(to)d(b)q(e)i(incremen)o(ted.)25 b(The)17 b(v)m(alue)g(of)f(the)h(expression)240 1930 y(is)f(the)f Fp(old)j Fv(v)m(alue)e(of)f Fp(x)p Fv(.)0 2020 y Fp(x)p Fr(--)168 b Fv(This)17 b(expression)g(causes)f(the)g(v)m (ariable)h Fp(x)i Fv(to)d(b)q(e)h(decremen)o(ted.)23 b(The)16 b(v)m(alue)h(of)f(the)g(expression)240 2082 y(is)g(the)f Fp(old)j Fv(v)m(alue)e(of)f Fp(x)p Fv(.)62 2179 y(It)g(is)f(not)g(curren)o(tly)h(p)q(ossible)h(to)d(incremen)o(t)i (index)h(expressions.)k(F)l(or)14 b(example,)h(y)o(ou)f(migh)o(t)g(exp) q(ect)h(that)0 2242 y(the)i(expression)h Fp(v)t Fr(\(4\)++)e Fv(w)o(ould)i(incremen)o(t)g(the)f(fourth)g(elemen)o(t)h(of)e(the)i(v)o (ector)e Fp(v)p Fv(,)h(but)g(instead)h(it)g(results)0 2304 y(in)e(a)f(parse)g(error.)k(This)d(problem)g(ma)o(y)e(b)q(e)i (\014xed)g(in)g(a)f(future)g(release)h(of)f(Octa)o(v)o(e.)0 2441 y Fu(3.15)32 b(Op)r(erator)15 b(Precedence)62 2545 y Fp(Op)q(erator)k(precedence)j Fv(determines)e(ho)o(w)e(op)q(erators)g (are)g(group)q(ed,)h(when)g(di\013eren)o(t)g(op)q(erators)f(app)q(ear)0 2608 y(close)f(b)o(y)f(in)h(one)g(expression.)23 b(F)l(or)16 b(example,)h(`)p Fr(*)p Fv(')e(has)h(higher)h(precedence)h(than)f(`)p Fr(+)p Fv('.)22 b(Th)o(us,)16 b(the)g(expression)0 2670 y Fr(a)f(+)g(b)g(*)g(c)g Fv(means)g(to)g(m)o(ultiply)i Fr(b)e Fv(and)g Fr(c)p Fv(,)g(and)g(then)h(add)f Fr(a)g Fv(to)g(the)g(pro)q(duct)g(\(i.e.,)g Fr(a)g(+)g(\(b)g(*)g(c\))p Fv(\).)p eop %%Page: 40 42 40 41 bop 0 -58 a Fv(40)1766 b(Octa)o(v)o(e)62 183 y(Y)l(ou)18 b(can)g(o)o(v)o(errule)g(the)g(precedence)h(of)e(the)h(op)q(erators)f (b)o(y)g(using)i(paren)o(theses.)27 b(Y)l(ou)18 b(can)g(think)h(of)e (the)0 246 y(precedence)23 b(rules)f(as)f(sa)o(ying)h(where)f(the)h (paren)o(theses)f(are)g(assumed)h(if)g(y)o(ou)f(do)g(not)g(write)h (paren)o(theses)0 308 y(y)o(ourself.)41 b(In)23 b(fact,)f(it)h(is)f (wise)h(to)f(use)g(paren)o(theses)g(whenev)o(er)h(y)o(ou)f(ha)o(v)o(e)f (an)i(un)o(usual)g(com)o(bination)f(of)0 370 y(op)q(erators,)14 b(b)q(ecause)j(other)e(p)q(eople)i(who)e(read)h(the)f(program)g(ma)o(y) g(not)g(remem)o(b)q(er)h(what)f(the)g(precedence)i(is)0 432 y(in)c(this)h(case.)19 b(Y)l(ou)12 b(migh)o(t)h(forget)f(as)g(w)o (ell,)h(and)g(then)g(y)o(ou)g(to)q(o)f(could)h(mak)o(e)f(a)h(mistak)o (e.)18 b(Explicit)d(paren)o(theses)0 495 y(will)i(help)f(prev)o(en)o(t) f(an)o(y)g(suc)o(h)h(mistak)o(e.)62 578 y(When)d(op)q(erators)e(of)h (equal)h(precedence)h(are)e(used)h(together,)e(the)h(leftmost)g(op)q (erator)g(groups)f(\014rst,)h(except)0 640 y(for)17 b(the)i(assignmen)o (t,)f(and)g(exp)q(onen)o(tiation)h(op)q(erators,)f(whic)o(h)h(group)f (in)g(the)h(opp)q(osite)f(order.)29 b(Th)o(us,)18 b(the)0 702 y(expression)e Fr(a)f(-)g(b)g(+)g(c)g Fv(groups)g(as)g Fr(\(a)g(-)g(b\))g(+)g(c)p Fv(,)f(but)i(the)f(expression)h Fr(a)f(=)g(b)g(=)g(c)g Fv(groups)g(as)g Fr(a)g(=)g(\(b)g(=)g(c\))p Fv(.)62 785 y(The)25 b(precedence)h(of)e(pre\014x)h(unary)g(op)q (erators)e(is)i(imp)q(ortan)o(t)g(when)g(another)f(op)q(erator)f(follo) o(ws)i(the)0 847 y(op)q(erand.)20 b(F)l(or)15 b(example,)h Fr(-x^2)e Fv(means)h Fr(-\(x^2\))p Fv(,)f(b)q(ecause)i(`)p Fr(-)p Fv(')f(has)g(lo)o(w)o(er)g(precedence)h(than)g(`)p Fr(^)p Fv('.)62 930 y(Here)g(is)f(a)g(table)h(of)f(the)g(op)q(erators)f (in)i(Octa)o(v)o(e,)f(in)h(order)f(of)f(increasing)j(precedence.)0 1026 y Fr(statement)d(separators)240 1088 y Fv(`)p Fr(;)p Fv(',)g(`)p Fr(,)p Fv('.)0 1175 y Fr(assignment)240 1238 y Fv(`)p Fr(=)p Fv('.)19 b(This)d(op)q(erator)e(groups)h(righ)o(t)g(to) f(left.)0 1325 y Fr(logical)g("or")h(and)g("and")240 1387 y Fv(`)p Fr(||)p Fv(',)f(`)p Fr(&&)p Fv('.)0 1474 y Fr(element-wise)g("or")g(and)h("and")240 1537 y Fv(`)p Fr(|)p Fv(',)f(`)p Fr(&)p Fv('.)0 1624 y Fr(relational)240 1686 y Fv(`)p Fr(<)p Fv(',)g(`)p Fr(<=)p Fv(',)g(`)p Fr(==)p Fv(',)f(`)p Fr(>=)p Fv(',)h(`)p Fr(>)p Fv(',)g(`)p Fr(!=)p Fv(',)g(`)p Fr(~=)p Fv(',)g(`)p Fr(<>)p Fv('.)0 1773 y Fr(colon)120 b Fv(`)p Fr(:)p Fv('.)0 1860 y Fr(add,)15 b(subtract)240 1923 y Fv(`)p Fr(+)p Fv(',)f(`)p Fr(-)p Fv('.)0 2010 y Fr(multiply,)g(divide)240 2072 y Fv(`)p Fr(*)p Fv(',)g(`)p Fr(/)p Fv(',)g(`)p Fr(\\)p Fv(',)g(`)p Fr(.\\)p Fv(',)f(`)p Fr(.*)p Fv(',)h(`)p Fr(./)p Fv('.)0 2159 y Fr(transpose)240 2221 y Fv(`)p Fr(')p Fv(',)g(`)p Fr(.')p Fv(')0 2309 y Fr(unary)g(plus,)h(minus,)f(increment,)g (decrement,)g(and)h(``not'')240 2371 y Fv(`)p Fr(+)p Fv(',)f(`)p Fr(-)p Fv(',)g(`)p Fr(++)p Fv(',)g(`)p Fr(--)p Fv(',)f(`)p Fr(!)p Fv(',)h(`)p Fr(~)p Fv('.)0 2458 y Fr(exponentiation)240 2520 y Fv(`)p Fr(^)p Fv(',)g(`)p Fr(**)p Fv(',)g(`)p Fr(.^)p Fv(',)f(`)p Fr(.**)p Fv('.)p eop %%Page: 41 43 41 42 bop 0 -58 a Fv(Chapter)15 b(4:)k(Statemen)o(ts)1451 b(41)0 183 y Fs(4)41 b(Statemen)n(ts)62 344 y Fp(Con)o(trol)17 b(statemen)o(ts)h Fv(suc)o(h)g(as)f Fr(if)p Fv(,)g Fr(while)p Fv(,)g(and)g(so)g(on)g(con)o(trol)g(the)h(\015o)o(w)f(of)g(execution)h (in)g(Octa)o(v)o(e)f(pro-)0 406 y(grams.)h(All)d(the)f(con)o(trol)f (statemen)o(ts)g(start)f(with)i(sp)q(ecial)i(k)o(eyw)o(ords)d(suc)o(h)h (as)f Fr(if)g Fv(and)h Fr(while)p Fv(,)f(to)g(distinguish)0 469 y(them)i(from)g(simple)h(expressions.)62 557 y(Man)o(y)22 b(con)o(trol)g(statemen)o(ts)f(con)o(tain)h(other)g(statemen)o(ts;)i (for)d(example,)k(the)d Fr(if)g Fv(statemen)o(t)f(con)o(tains)0 619 y(another)12 b(statemen)o(t)g(whic)o(h)i(ma)o(y)e(or)g(ma)o(y)g (not)h(b)q(e)g(executed.)20 b(Eac)o(h)13 b(con)o(trol)f(statemen)o(t)g (has)h(a)f(corresp)q(onding)0 682 y Fp(end)18 b Fv(statemen)o(t)d(that) g(marks)g(the)h(end)g(of)g(the)g(end)g(of)f(the)h(con)o(trol)g (statemen)o(t.)k(F)l(or)15 b(example,)i(the)f(k)o(eyw)o(ord)0 744 y Fr(endif)e Fv(marks)g(the)g(end)h(of)f(an)h Fr(if)f Fv(statemen)o(t,)f(and)i Fr(endwhile)e Fv(marks)h(the)h(end)g(of)f(a)g Fr(while)g Fv(statemen)o(t.)19 b(Y)l(ou)0 806 y(can)f(use)g(the)f(k)o (eyw)o(ord)g Fr(end)h Fv(an)o(ywhere)f(a)g(more)h(sp)q(eci\014c)h(end)f (k)o(eyw)o(ord)f(is)h(exp)q(ected,)i(but)d(using)i(the)e(more)0 868 y(sp)q(eci\014c)f(k)o(eyw)o(ords)e(is)h(preferred)f(b)q(ecause)i (if)f(y)o(ou)f(use)g(them,)g(Octa)o(v)o(e)g(is)h(able)g(to)f(pro)o (vide)h(b)q(etter)f(diagnostics)0 931 y(for)h(mismatc)o(hed)g(or)g (missing)h(end)g(tok)o(ens.)62 1019 y(The)f(list)h(of)e(statemen)o(ts)f (con)o(tained)j(b)q(et)o(w)o(een)f(k)o(eyw)o(ords)f(lik)o(e)h Fr(if)g Fv(or)f Fr(while)g Fv(and)h(the)g(corresp)q(onding)g(end)0 1082 y(statemen)o(t)f(is)i(called)h(the)e Fp(b)q(o)q(dy)20 b Fv(of)14 b(a)h(con)o(trol)g(statemen)o(t.)0 1237 y Fu(4.1)33 b(The)15 b Fi(if)f Fu(Statemen)n(t)62 1346 y Fv(The)i Fr(if)f Fv(statemen)o(t)g(is)h(Octa)o(v)o(e's)e (decision-making)k(statemen)o(t.)h(There)d(are)f(three)h(basic)g(forms) f(of)g(an)g Fr(if)0 1408 y Fv(statemen)o(t.)k(In)d(its)f(simplest)h (form,)e(it)i(lo)q(oks)f(lik)o(e)i(this:)120 1484 y Fr(if)24 b(\()p Fp(condition)p Fr(\))h Fp(then-b)q(o)q(dy)k Fr(endif)0 1573 y Fp(condition)18 b Fv(is)e(an)g(expression)i(that)d(con)o(trols)h (what)g(the)g(rest)g(of)f(the)i(statemen)o(t)e(will)j(do.)23 b(The)16 b Fp(then-b)q(o)q(dy)21 b Fv(is)0 1635 y(executed)16 b(only)g(if)g Fp(condition)g Fv(is)g(true.)62 1724 y(The)e(condition)i (in)e(an)g Fr(if)g Fv(statemen)o(t)f(is)h(considered)h(true)f(if)g(its) g(v)m(alue)i(is)e(non-zero,)g(and)g(false)g(if)h(its)f(v)m(alue)0 1786 y(is)j(zero.)23 b(If)17 b(the)f(v)m(alue)i(of)d(the)i(conditional) h(expression)f(in)g(an)f Fr(if)g Fv(statemen)o(t)g(is)h(a)f(v)o(ector)f (or)h(a)g(matrix,)g(it)g(is)0 1848 y(considered)h(true)e(only)g(if)h Fp(all)i Fv(of)d(the)g(elemen)o(ts)h(are)f(non-zero.)62 1937 y(The)h(second)f(form)g(of)g(an)g(if)g(statemen)o(t)g(lo)q(oks)g (lik)o(e)h(this:)120 2013 y Fr(if)24 b(\()p Fp(condition)p Fr(\))h Fp(then-b)q(o)q(dy)k Fr(else)23 b Fp(else-b)q(o)q(dy)29 b Fr(endif)0 2102 y Fv(If)15 b Fp(condition)i Fv(is)f(true,)e Fp(then-b)q(o)q(dy)21 b Fv(is)15 b(executed;)h(otherwise,)f Fp(else-b)q(o)q(dy)21 b Fv(is)16 b(executed.)62 2190 y(Here)g(is)f(an)h(example:)120 2275 y Fr(if)24 b(\(rem)f(\(x,)g(2\))h (==)g(0\))168 2337 y(printf)f(\("x)g(is)h(even\\n"\);)120 2399 y(else)168 2462 y(printf)f(\("x)g(is)h(odd\\n"\);)120 2524 y(endif)62 2608 y Fv(In)12 b(this)g(example,)g(if)g(the)g (expression)g Fr(rem)j(\(x,)f(2\))h(==)g(0)c Fv(is)h(true)f(\(that)f (is,)j(the)e(v)m(alue)i(of)d Fr(x)i Fv(is)f(divisible)k(b)o(y)c(2\),)0 2670 y(then)16 b(the)f(\014rst)g Fr(printf)f Fv(statemen)o(t)g(is)i(ev) m(aluated,)g(otherwise)f(the)g(second)h Fr(printf)e Fv(statemen)o(t)h (is)g(ev)m(aluated.)p eop %%Page: 42 44 42 43 bop 0 -58 a Fv(42)1766 b(Octa)o(v)o(e)62 183 y(The)16 b(third)g(and)g(most)e(general)i(form)f(of)g(the)g Fr(if)h Fv(statemen)o(t)e(allo)o(ws)i(m)o(ultiple)h(decisions)g(to)e(b)q(e)h (com)o(bined)0 246 y(in)g(a)f(single)h(statemen)o(t.)j(It)c(lo)q(oks)h (lik)o(e)g(this:)120 320 y Fr(if)24 b(\()p Fp(condition)p Fr(\))h Fp(then-b)q(o)q(dy)k Fr(elseif)23 b(\()p Fp(condition)p Fr(\))i Fp(elseif-b)q(o)q(dy)30 b Fr(else)23 b Fp(else-b)q(o)q(dy)30 b Fr(endif)0 406 y Fv(An)o(y)14 b(n)o(um)o(b)q(er)g(of)f Fr(elseif)f Fv(clauses)j(ma)o(y)e(app)q(ear.)19 b(Eac)o(h)14 b(condition)h(is)f(tested)f(in)i(turn,)e(and)h(if)g(one)g(is)g(found)g (to)0 469 y(b)q(e)h(true,)f(its)g(corresp)q(onding)h Fp(b)q(o)q(dy)k Fv(is)c(executed.)20 b(If)15 b(none)f(of)g(the)g (conditions)i(are)e(true)g(and)g(the)g Fr(else)g Fv(clause)0 531 y(is)h(presen)o(t,)g(its)g(b)q(o)q(dy)h(is)f(executed.)21 b(Only)16 b(one)f Fr(else)f Fv(clause)i(ma)o(y)e(app)q(ear,)g(and)h(it) h(m)o(ust)e(b)q(e)h(the)g(last)g(part)f(of)0 593 y(the)h(satemen)o(t.) 62 680 y(In)i(the)f(follo)o(wing)g(example,)h(if)f(the)g(\014rst)g (condition)h(is)f(true)g(\(that)f(is,)h(the)g(v)m(alue)i(of)d Fr(x)h Fv(is)g(divisible)j(b)o(y)d(2\),)0 742 y(then)g(the)g(\014rst)f Fr(printf)g Fv(statemen)o(t)f(is)i(executed.)22 b(If)16 b(it)g(is)g(false,)g(then)g(the)f(second)i(condition)f(is)h(tested,)e (and)0 804 y(if)f(it)h(is)f(true)g(\(that)f(is,)h(the)g(v)m(alue)h(of)f Fr(x)g Fv(is)g(divisible)j(b)o(y)d(3\),)f(then)h(the)h(second)f Fr(printf)f Fv(statemen)o(t)g(is)h(executed.)0 867 y(Otherwise,)i(the)f (third)h Fr(printf)e Fv(statemen)o(t)g(is)i(p)q(erformed.)120 950 y Fr(if)24 b(\(rem)f(\(x,)g(2\))h(==)g(0\))168 1013 y(printf)f(\("x)g(is)h(even\\n"\);)120 1075 y(elseif)f(\(rem)g(\(x,)h (3\))f(==)h(0\))168 1137 y(printf)f(\("x)g(is)h(odd)f(and)h(divisible)e (by)i(3\\n"\);)120 1200 y(else)168 1262 y(printf)f(\("x)g(is)h (odd\\n"\);)120 1324 y(endif)62 1403 y Fv(Note)13 b(that)f(the)h Fr(elseif)f Fv(k)o(eyw)o(ord)g(m)o(ust)g(not)h(b)q(e)g(sp)q(elled)i Fr(else)g(if)p Fv(,)e(as)f(is)h(allo)o(w)o(ed)h(in)f(F)l(ortran.)18 b(If)13 b(it)g(is,)h(the)0 1466 y(space)h(b)q(et)o(w)o(een)f(the)h Fr(else)f Fv(and)g Fr(if)h Fv(will)h(tell)f(Octa)o(v)o(e)f(to)g(treat)f (this)i(as)f(a)h(new)f Fr(if)g Fv(statemen)o(t)g(within)h(another)0 1528 y Fr(if)g Fv(statemen)o(t's)f Fr(else)g Fv(clause.)21 b(F)l(or)14 b(example,)i(if)g(y)o(ou)f(write)120 1610 y Fr(if)24 b(\()p Fp(c1)t Fr(\))168 1673 y Fp(b)q(o)q(dy-1)120 1735 y Fr(else)f(if)h(\()p Fp(c2)t Fr(\))168 1797 y Fp(b)q(o)q(dy-2)120 1860 y Fr(endif)0 1939 y Fv(Octa)o(v)o(e)18 b(will)i(exp)q(ect)g (additional)g(input)f(to)f(complete)h(the)g(\014rst)f Fr(if)g Fv(statemen)o(t.)29 b(If)19 b(y)o(ou)f(are)g(using)h(Octa)o(v)o (e)0 2001 y(in)o(teractiv)o(ely)l(,)g(it)f(will)h(con)o(tin)o(ue)f(to)f (prompt)g(y)o(ou)h(for)f(additional)i(input.)28 b(If)18 b(Octa)o(v)o(e)f(is)h(reading)g(this)g(input)0 2063 y(from)13 b(a)h(\014le,)h(it)g(ma)o(y)e(complain)i(ab)q(out)f(missing)h(or)f (mismatc)o(hed)h Fr(end)e Fv(statemen)o(ts,)g(or,)g(if)i(y)o(ou)f(ha)o (v)o(e)g(not)f(used)0 2126 y(the)18 b(more)g(sp)q(eci\014c)h Fr(end)f Fv(statemen)o(ts)f(\()p Fr(endif)p Fv(,)g Fr(endfor)p Fv(,)g(etc.\),)h(it)g(ma)o(y)f(simply)j(pro)q(duce)f(incorrect)f (results,)0 2188 y(without)d(pro)q(ducing)i(an)o(y)e(w)o(arning)g (messages.)62 2275 y(It)h(is)f(m)o(uc)o(h)g(easier)h(to)f(see)g(the)g (error)g(if)h(w)o(e)e(rewrite)i(the)f(statemen)o(ts)f(ab)q(o)o(v)o(e)h (lik)o(e)h(this,)120 2357 y Fr(if)24 b(\()p Fp(c1)t Fr(\))168 2419 y Fp(b)q(o)q(dy-1)120 2482 y Fr(else)168 2544 y(if)f(\()p Fp(c2)t Fr(\))215 2606 y Fp(b)q(o)q(dy-2)168 2668 y Fr(endif)p eop %%Page: 43 45 43 44 bop 0 -58 a Fv(Chapter)15 b(4:)k(Statemen)o(ts)1451 b(43)0 183 y(using)18 b(the)g(inden)o(tation)g(to)f(sho)o(w)f(ho)o(w)h (Octa)o(v)o(e)g(groups)g(the)h(statemen)o(ts.)25 b(See)18 b(Chapter)f(5)g([F)l(unctions)h(and)0 246 y(Scripts],)d(page)g(49.)0 417 y Fu(4.2)33 b(The)15 b Fi(while)e Fu(Statemen)n(t)62 530 y Fv(In)j(programming,)e(a)g Fp(lo)q(op)j Fv(means)e(a)g(part)f(of) g(a)h(program)f(that)g(is)h(\(or)f(at)h(least)g(can)g(b)q(e\))g (executed)h(t)o(w)o(o)d(or)0 592 y(more)i(times)g(in)h(succession.)62 685 y(The)21 b Fr(while)e Fv(statemen)o(t)h(is)h(the)f(simplest)h(lo)q (oping)h(statemen)o(t)d(in)i(Octa)o(v)o(e.)35 b(It)21 b(rep)q(eatedly)g(executes)g(a)0 747 y(statemen)o(t)15 b(as)h(long)g(as)g(a)g(condition)h(is)g(true.)22 b(As)17 b(with)f(the)g(condition)i(in)f(an)f Fr(if)g Fv(statemen)o(t,)e(the)j (condition)0 809 y(in)f(a)f Fr(while)g Fv(statemen)o(t)f(is)i (considered)g(true)g(if)f(its)h(v)m(alue)g(is)g(non-zero,)f(and)h (false)g(if)f(its)h(v)m(alue)g(is)g(zero.)k(If)c(the)0 872 y(v)m(alue)g(of)e(the)h(conditional)h(expression)f(in)h(an)e Fr(if)h Fv(statemen)o(t)e(is)i(a)g(v)o(ector)f(or)g(a)g(matrix,)g(it)h (is)g(considered)h(true)0 934 y(only)g(if)f Fp(all)j Fv(of)d(the)g(elemen)o(ts)h(are)f(non-zero.)62 1027 y(Octa)o(v)o(e's)g Fr(while)f Fv(statemen)o(t)g(lo)q(oks)i(lik)o(e)g(this:)120 1107 y Fr(while)23 b(\()p Fp(condition)p Fr(\))168 1169 y Fp(b)q(o)q(dy)120 1231 y Fr(endwhile)0 1316 y Fv(Here)16 b Fp(b)q(o)q(dy)k Fv(is)c(a)g(statemen)o(t)f(or)g(list)h(of)g(statemen) o(ts)e(that)h(w)o(e)g(call)i(the)f Fp(b)q(o)q(dy)k Fv(of)c(the)g(lo)q (op,)g(and)f Fp(condition)i Fv(is)0 1379 y(an)e(expression)h(that)f (con)o(trols)g(ho)o(w)f(long)i(the)f(lo)q(op)h(k)o(eeps)f(running.)62 1471 y(The)i(\014rst)e(thing)i(the)f Fr(while)f Fv(statemen)o(t)g(do)q (es)h(is)h(test)e Fp(condition)p Fv(.)24 b(If)16 b Fp(condition)i Fv(is)e(true,)g(it)g(executes)h(the)0 1534 y(statemen)o(t)11 b Fp(b)q(o)q(dy)p Fv(.)19 b(After)12 b Fp(b)q(o)q(dy)k Fv(has)c(b)q(een)h(executed,)g Fp(condition)g Fv(is)g(tested)f(again,)g (and)g(if)g(it)g(is)h(still)g(true,)f Fp(b)q(o)q(dy)0 1596 y Fv(is)18 b(executed)h(again.)27 b(This)19 b(pro)q(cess)e(rep)q (eats)h(un)o(til)h Fp(condition)g Fv(is)f(no)g(longer)g(true.)27 b(If)18 b Fp(condition)h Fv(is)f(initially)0 1658 y(false,)d(the)g(b)q (o)q(dy)h(of)f(the)g(lo)q(op)h(is)g(nev)o(er)f(executed.)62 1751 y(This)h(example)g(creates)f(a)g(v)m(ariable)h Fr(fib)f Fv(that)g(con)o(tains)g(the)g(elemen)o(ts)h(of)f(the)g(Fib)q(onacci)i (sequence.)120 1839 y Fr(fib)23 b(=)h(ones)f(\(1,)h(10\);)120 1901 y(i)g(=)f(3;)120 1964 y(while)g(\(i)h(<=)f(10\))168 2026 y(fib)g(\(i\))h(=)f(fib)h(\(i-1\))f(+)h(fib)f(\(i-2\);)168 2088 y(i++;)120 2150 y(endwhile)0 2236 y Fv(Here)15 b(the)h(b)q(o)q(dy) g(of)e(the)i(lo)q(op)f(con)o(tains)h(t)o(w)o(o)e(statemen)o(ts.)62 2328 y(The)g(lo)q(op)h(w)o(orks)e(lik)o(e)i(this:)20 b(\014rst,)13 b(the)h(v)m(alue)i(of)d Fr(i)h Fv(is)h(set)e(to)h(3.)19 b(Then,)14 b(the)g Fr(while)f Fv(tests)h(whether)g Fr(i)g Fv(is)g(less)0 2391 y(than)g(or)g(equal)h(to)e(10.)19 b(This)c(is)g(the)f(case)g(when)h Fr(i)f Fv(equals)h(3,)e(so)h(the)h(v) m(alue)g(of)f(the)g Fr(i)p Fv(-th)g(elemen)o(t)h(of)f Fr(fib)f Fv(is)i(set)0 2453 y(to)e(the)h(sum)g(of)g(the)g(previous)h(t) o(w)o(o)e(v)m(alues)i(in)f(the)h(sequence.)20 b(Then)15 b(the)f Fr(i++)f Fv(incremen)o(ts)i(the)f(v)m(alue)h(of)f Fr(i)g Fv(and)0 2515 y(the)h(lo)q(op)h(rep)q(eats.)k(The)15 b(lo)q(op)h(terminates)f(when)h Fr(i)f Fv(reac)o(hes)g(11.)62 2608 y(A)e(newline)h(is)f(not)f(required)h(b)q(et)o(w)o(een)g(the)f (condition)i(and)e(the)g(b)q(o)q(dy;)i(but)e(using)i(one)e(mak)o(es)g (the)g(program)0 2670 y(clearer)k(unless)g(the)f(b)q(o)q(dy)h(is)g(v)o (ery)f(simple.)p eop %%Page: 44 46 44 45 bop 0 -58 a Fv(44)1766 b(Octa)o(v)o(e)0 183 y Fu(4.3)33 b(The)15 b Fi(for)f Fu(Statemen)n(t)62 314 y Fv(The)h Fr(for)f Fv(statemen)o(t)g(mak)o(es)g(it)h(more)f(con)o(v)o(enien)o(t)h (to)f(coun)o(t)h(iterations)g(of)f(a)g(lo)q(op.)20 b(The)15 b(general)g(form)f(of)0 376 y(the)h Fr(for)g Fv(statemen)o(t)f(lo)q (oks)i(lik)o(e)g(this:)120 474 y Fr(for)23 b Fp(v)m(ar)28 b Fr(=)23 b Fp(expression)168 536 y(b)q(o)q(dy)120 598 y Fr(endfor)0 701 y Fv(The)g(assignmen)o(t)f(expression)h(in)g(the)f Fr(for)g Fv(statemen)o(t)f(w)o(orks)h(a)g(bit)g(di\013eren)o(tly)h (than)g(Octa)o(v)o(e's)e(normal)0 763 y(assignmen)o(t)c(statemen)o(t.) 26 b(Instead)18 b(of)g(assigning)g(the)g(complete)g(result)g(of)f(the)h (expression,)g(it)g(assigns)g(eac)o(h)0 826 y(column)f(of)e(the)i (expression)f(to)g Fp(v)m(ar)j Fv(in)e(turn.)22 b(If)16 b Fp(expression)h Fv(is)g(either)g(a)e(ro)o(w)g(v)o(ector)h(or)f(a)h (scalar,)g(the)g(v)m(alue)0 888 y(of)f Fp(v)m(ar)k Fv(will)e(b)q(e)f(a) g(scalar)f(eac)o(h)h(time)g(the)g(lo)q(op)g(b)q(o)q(dy)g(is)g (executed.)22 b(If)16 b Fp(v)m(ar)j Fv(is)d(a)f(column)h(v)o(ector)f (or)g(a)h(matrix,)0 950 y Fp(v)m(ar)i Fv(will)f(b)q(e)f(a)f(column)h(v) o(ector)f(eac)o(h)g(time)g(the)h(lo)q(op)f(b)q(o)q(dy)h(is)g(executed.) 62 1060 y(The)i(follo)o(wing)g(example)g(sho)o(ws)e(another)h(w)o(a)o (y)g(to)f(create)h(a)g(v)o(ector)g(con)o(taining)h(the)f(\014rst)g(ten) g(elemen)o(ts)0 1122 y(of)e(the)g(Fib)q(onacci)i(sequence,)f(this)f (time)h(using)g(the)f Fr(for)g Fv(statemen)o(t:)120 1228 y Fr(fib)23 b(=)h(ones)f(\(1,)h(10\);)120 1291 y(for)f(i)h(=)g(3:10)168 1353 y(fib)f(\(i\))h(=)f(fib)h(\(i-1\))f(+)h(fib)f(\(i-2\);)120 1415 y(endfor)0 1518 y Fv(This)14 b(co)q(de)g(w)o(orks)e(b)o(y)i (\014rst)e(ev)m(aluating)j(the)f(expression)g(`)p Fr(3:10)p Fv(',)e(to)g(pro)q(duce)j(a)e(range)g(of)g(v)m(alues)h(from)f(3)g(to)g (10)0 1580 y(inclusiv)o(e.)22 b(Then)14 b(the)h(v)m(ariable)g Fr(i)f Fv(is)h(assigned)f(the)h(\014rst)e(elemen)o(t)i(of)f(the)g (range)g(and)g(the)g(b)q(o)q(dy)h(of)f(the)g(lo)q(op)g(is)0 1642 y(executed)j(once.)22 b(When)16 b(the)g(end)g(of)g(the)f(lo)q(op)i (b)q(o)q(dy)f(is)g(reac)o(hed,)g(the)g(next)g(v)m(alue)h(in)g(the)f (range)f(is)h(assigned)0 1705 y(to)g(the)h(v)m(ariable)h Fr(i)p Fv(,)f(and)g(the)g(lo)q(op)g(b)q(o)q(dy)g(is)h(executed)f (again.)25 b(This)17 b(pro)q(cess)g(con)o(tin)o(ues)h(un)o(til)g(there) f(are)f(no)0 1767 y(more)f(elemen)o(ts)h(to)e(assign.)62 1877 y(In)i(the)f Fr(for)g Fv(statemen)o(t,)f Fp(b)q(o)q(dy)20 b Fv(stands)15 b(for)f(an)o(y)h(statemen)o(t)f(or)h(list)h(of)f (statemen)o(ts.)62 1987 y(Although)j(it)g(is)f(p)q(ossible)i(to)e (rewrite)g(all)h Fr(for)f Fv(lo)q(ops)h(as)f Fr(while)f Fv(lo)q(ops,)i(the)f(Octa)o(v)o(e)g(language)h(has)f(b)q(oth)0 2049 y(statemen)o(ts)9 b(b)q(ecause)j(often)e(a)g Fr(for)g Fv(lo)q(op)h(is)g(b)q(oth)g(less)g(w)o(ork)e(to)h(t)o(yp)q(e)h(and)f (more)g(natural)h(to)f(think)h(of.)18 b(Coun)o(ting)0 2112 y(the)e(n)o(um)o(b)q(er)f(of)h(iterations)f(is)h(v)o(ery)f(common) h(in)g(lo)q(ops)g(and)g(it)f(can)h(b)q(e)g(easier)g(to)f(think)h(of)f (this)h(coun)o(ting)g(as)0 2174 y(part)f(of)f(lo)q(oping)j(rather)d (than)h(as)g(something)h(to)e(do)h(inside)i(the)f(lo)q(op.)0 2415 y Fu(4.4)33 b(The)15 b Fi(break)e Fu(Statemen)n(t)62 2545 y Fv(The)h Fr(break)e Fv(statemen)o(t)g(jumps)h(out)g(of)f(the)h (innermost)h Fr(for)e Fv(or)h Fr(while)f Fv(lo)q(op)i(that)e(encloses)i (it.)19 b(The)14 b Fr(break)0 2608 y Fv(statemen)o(t)h(ma)o(y)h(only)h (b)q(e)g(used)g(within)h(the)f(b)q(o)q(dy)g(of)f(a)g(lo)q(op.)24 b(The)17 b(follo)o(wing)g(example)h(\014nds)f(the)f(smallest)0 2670 y(divisor)g(of)f(a)g(giv)o(en)g(in)o(teger,)g(and)h(also)f(iden)o (ti\014es)i(prime)f(n)o(um)o(b)q(ers:)p eop %%Page: 45 47 45 46 bop 0 -58 a Fv(Chapter)15 b(4:)k(Statemen)o(ts)1451 b(45)120 183 y Fr(num)23 b(=)h(103;)120 246 y(div)f(=)h(2;)120 308 y(while)f(\(div*div)g(<=)h(num\))168 370 y(if)f(\(rem)h(\(num,)f (div\))g(==)h(0\))215 432 y(break;)168 495 y(endif)168 557 y(div++;)120 619 y(endwhile)120 681 y(if)g(\(rem)f(\(num,)g(div\))g (==)h(0\))168 744 y(printf)f(\("Smallest)f(divisor)h(of)h(\045d)f(is)h (\045d\\n",)f(num,)g(div\))120 806 y(else)168 868 y(printf)g(\("\045d)g (is)h(prime\\n",)e(num\);)120 930 y(endif)62 1024 y Fv(When)e(the)g (remainder)g(is)h(zero)e(in)i(the)e(\014rst)h Fr(while)f Fv(statemen)o(t,)g(Octa)o(v)o(e)g(immediately)j Fp(breaks)d(out)h Fv(of)0 1086 y(the)d(lo)q(op.)25 b(This)18 b(means)f(that)f(Octa)o(v)o (e)g(pro)q(ceeds)i(immediately)h(to)d(the)h(statemen)o(t)f(follo)o (wing)h(the)g(lo)q(op)h(and)0 1148 y(con)o(tin)o(ues)13 b(pro)q(cessing.)20 b(\(This)14 b(is)f(v)o(ery)g(di\013eren)o(t)g(from) f(the)h Fr(exit)f Fv(statemen)o(t)g(whic)o(h)i(stops)e(the)h(en)o(tire) g(Octa)o(v)o(e)0 1211 y(program.\))62 1311 y(Here)19 b(is)f(another)g(program)e(equiv)m(alen)o(t)k(to)e(the)g(previous)g (one.)29 b(It)18 b(illustrates)h(ho)o(w)e(the)h Fp(condition)i Fv(of)d(a)0 1374 y Fr(while)d Fv(statemen)o(t)h(could)h(just)f(as)f(w)o (ell)j(b)q(e)f(replaced)g(with)f(a)g Fr(break)g Fv(inside)i(an)e Fr(if)p Fv(:)120 1470 y Fr(num)23 b(=)h(103;)120 1533 y(div)f(=)h(2;)120 1595 y(while)f(\(1\))168 1657 y(if)g(\(rem)h(\(num,) f(div\))g(==)h(0\))215 1719 y(printf)f(\("Smallest)g(divisor)g(of)g (\045d)h(is)g(\045d\\n",)f(num,)g(div\);)215 1782 y(break;)168 1844 y(endif)168 1906 y(div++;)168 1968 y(if)g(\(div*div)g(>)h(num\)) 215 2031 y(printf)f(\("\045d)h(is)f(prime\\n",)g(num\);)215 2093 y(break;)168 2155 y(endif)120 2218 y(endwhile)0 2424 y Fu(4.5)33 b(The)15 b Fi(continue)e Fu(Statemen)n(t)62 2545 y Fv(The)k Fr(continue)e Fv(statemen)o(t,)g(lik)o(e)j Fr(break)p Fv(,)d(is)i(used)g(only)g(inside)h Fr(for)e Fv(or)g Fr(while)f Fv(lo)q(ops.)24 b(It)16 b(skips)h(o)o(v)o(er)f(the)0 2608 y(rest)f(of)g(the)h(lo)q(op)g(b)q(o)q(dy)l(,)h(causing)f(the)g (next)f(cycle)i(around)f(the)f(lo)q(op)i(to)e(b)q(egin)i(immediately)l (.)23 b(Con)o(trast)14 b(this)0 2670 y(with)i Fr(break)p Fv(,)e(whic)o(h)i(jumps)f(out)g(of)g(the)g(lo)q(op)h(altogether.)j (Here)d(is)f(an)g(example:)p eop %%Page: 46 48 46 47 bop 0 -58 a Fv(46)1766 b(Octa)o(v)o(e)120 183 y Fr(#)24 b(print)f(elements)g(of)g(a)h(vector)f(of)h(random)120 246 y(#)g(integers)e(that)i(are)f(even.)120 370 y(#)h(first,)f(create)g (a)h(row)f(vector)g(of)h(10)f(random)120 432 y(#)h(integers)e(with)i (values)f(between)g(0)g(and)h(100:)120 557 y(vec)f(=)h(round)f(\(rand)h (\(1,)f(10\))g(*)h(100\);)120 681 y(#)g(print)f(what)g(we're)g (interested)g(in:)120 806 y(for)g(x)h(=)g(vec)168 868 y(if)f(\(rem)h(\(x,)f(2\))h(!=)f(0\))215 930 y(continue;)168 993 y(endif)168 1055 y(printf)g(\("\045d\\n",)g(x\);)120 1117 y(endfor)62 1201 y Fv(If)16 b(one)f(of)g(the)g(elemen)o(ts)h(of)e Fp(v)o(ec)k Fv(is)e(an)f(o)q(dd)h(n)o(um)o(b)q(er,)f(this)h(example)g (skips)f(the)h(prin)o(t)f(statemen)o(t)f(for)h(that)0 1263 y(elemen)o(t,)h(and)f(con)o(tin)o(ues)h(bac)o(k)f(to)f(the)i (\014rst)e(statemen)o(t)h(in)h(the)f(lo)q(op.)62 1355 y(This)23 b(is)f(not)g(a)g(practical)h(example)f(of)g(the)g Fr(continue)f Fv(statemen)o(t,)h(but)g(it)h(should)g(giv)o(e)f(y)o(ou)g (a)f(clear)0 1417 y(understanding)16 b(of)f(ho)o(w)g(it)g(w)o(orks.)k (Normally)l(,)d(one)f(w)o(ould)g(probably)h(write)g(the)f(lo)q(op)h (lik)o(e)g(this:)120 1504 y Fr(for)23 b(x)h(=)g(vec)168 1566 y(if)f(\(rem)h(\(x,)f(2\))h(==)f(0\))215 1628 y(printf)g (\("\045d\\n",)g(x\);)168 1691 y(endif)120 1753 y(endfor)0 1921 y Fu(4.6)33 b(The)15 b Fi(unwind_protec)o(t)d Fu(Statemen)n(t)62 2033 y Fv(Octa)o(v)o(e)17 b(supp)q(orts)f(a)h(limited)i(form)d(of)g (exception)i(handling)g(mo)q(delled)h(after)d(the)h(un)o(wind-protect)h (form)0 2095 y(of)d(Lisp.)62 2186 y(The)h(general)f(form)g(of)g(an)g Fr(unwind_protect)e Fv(blo)q(c)o(k)j(lo)q(oks)f(lik)o(e)i(this:)120 2275 y Fr(unwind_protect)168 2337 y Fp(b)q(o)q(dy)120 2399 y Fr(unwind_protect_cleanup)168 2462 y Fp(clean)o(up)120 2524 y Fr(end_unwind_protect)0 2608 y Fv(Where)c Fp(b)q(o)q(dy)18 b Fv(and)13 b Fp(clean)o(up)j Fv(are)c(b)q(oth)i(optional)f(and)g(ma)o (y)g(con)o(tain)g(an)o(y)g(Octa)o(v)o(e)f(expressions)i(or)f(commands.) 0 2670 y(The)i(statemen)o(ts)f(in)j Fp(clean)o(up)g Fv(are)e(guaran)o (teed)g(to)f(b)q(e)i(executed)g(regardless)g(of)f(ho)o(w)f(con)o(trol)h (exits)h Fp(b)q(o)q(dy)p Fv(.)p eop %%Page: 47 49 47 48 bop 0 -58 a Fv(Chapter)15 b(4:)k(Statemen)o(ts)1451 b(47)62 183 y(This)16 b(is)g(useful)g(to)f(protect)f(temp)q(orary)h(c)o (hanges)g(to)g(global)g(v)m(ariables)i(from)d(p)q(ossible)j(errors.)i (F)l(or)c(exam-)0 246 y(ple,)j(the)f(follo)o(wing)g(co)q(de)h(will)g (alw)o(a)o(ys)f(restore)f(the)h(original)h(v)m(alue)g(of)e(the)h (built-in)i(v)m(ariable)g Fr(do_fortran_)0 308 y(indexing)14 b Fv(ev)o(en)i(if)f(an)g(error)g(o)q(ccurs)g(while)i(p)q(erforming)f (the)f(indexing)i(op)q(eration.)120 378 y Fr(save_do_fortran_indexing)k (=)i(do_fortran_indexing;)120 428 y(unwind_protect)168 478 y(do_fortran_indexing)e(=)j("true";)168 528 y(elt)f(=)h(a)g (\(idx\))120 578 y(unwind_protect_cleanup)168 627 y (do_fortran_indexing)d(=)j(save_do_fortran_indexing)o(;)120 677 y(end_unwind_protect)62 760 y Fv(Without)18 b Fr(unwind_protect)p Fv(,)f(the)i(v)m(alue)g(of)f Fp(do)p 922 760 14 2 v 17 w(fortran)p 1078 760 V 15 w(indexing)24 b Fv(w)o(ould)19 b(not)f(b)q(e)h(restored)f(if)g(an)h(error)0 823 y(o)q(ccurs)d(while)h (p)q(erforming)g(the)e(indexing)j(op)q(eration)e(b)q(ecause)h(ev)m (aluation)g(w)o(ould)f(stop)f(at)g(the)h(p)q(oin)o(t)h(of)e(the)0 885 y(error)f(and)i(the)f(statemen)o(t)f(to)h(restore)f(the)i(v)m(alue) g(w)o(ould)g(not)e(b)q(e)i(executed.)p eop %%Page: 48 50 48 49 bop 0 -58 a Fv(48)1766 b(Octa)o(v)o(e)p eop %%Page: 49 51 49 50 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(49)0 183 y Fs(5)41 b(F)-7 b(unctions)14 b(and)h(Script)g(Files)62 358 y Fv(Complicated)j(Octa)o(v)o(e)e (programs)f(can)i(often)f(b)q(e)h(simpli\014ed)i(b)o(y)e(de\014ning)h (functions.)24 b(F)l(unctions)18 b(can)e(b)q(e)0 420 y(de\014ned)j(directly)f(on)g(the)f(command)g(line)i(during)g(in)o (teractiv)o(e)e(Octa)o(v)o(e)g(sessions,)h(or)f(in)h(external)g (\014les,)h(and)0 482 y(can)c(b)q(e)h(called)h(just)e(lik)o(e)h (built-in)i(ones.)0 648 y Fu(5.1)33 b(De\014ning)15 b(F)-6 b(unctions)62 761 y Fv(In)16 b(its)f(simplest)i(form,)d(the)h (de\014nition)i(of)e(a)g(function)h(named)f Fp(name)j Fv(lo)q(oks)d(lik)o(e)i(this:)120 848 y Fr(function)23 b Fp(name)168 910 y(b)q(o)q(dy)120 972 y Fr(endfunction)0 1056 y Fv(A)16 b(v)m(alid)i(function)g(name)e(is)h(lik)o(e)g(a)f(v)m (alid)i(v)m(ariable)g(name:)k(a)16 b(sequence)i(of)e(letters,)g(digits) h(and)g(underscores,)0 1119 y(not)e(starting)f(with)i(a)f(digit.)21 b(F)l(unctions)15 b(share)h(the)f(same)g(p)q(o)q(ol)h(of)f(names)g(as)f (v)m(ariables.)62 1210 y(The)e(function)h Fp(b)q(o)q(dy)j Fv(consists)c(of)g(Octa)o(v)o(e)f(statemen)o(ts.)18 b(It)12 b(is)g(the)g(most)f(imp)q(ortan)o(t)g(part)g(of)h(the)g(de\014nition,)0 1272 y(b)q(ecause)k(it)g(sa)o(ys)e(what)h(the)g(function)h(should)g (actually)g Fp(do)p Fv(.)62 1364 y(F)l(or)10 b(example,)i(here)g(is)f (a)f(function)i(that,)e(when)i(executed,)g(will)g(ring)f(the)g(b)q(ell) i(on)d(y)o(our)h(terminal)g(\(assuming)0 1426 y(that)j(it)i(is)g(p)q (ossible)h(to)d(do)h(so\):)120 1516 y Fr(function)23 b(wakeup)168 1578 y(printf)g(\("\\a"\);)120 1640 y(endfunction)62 1727 y Fv(The)c Fr(printf)e Fv(statemen)o(t)g(\(see)h(Chapter)g(20)f ([Input)i(and)f(Output],)h(page)f(117\))e(simply)k(tells)f(Octa)o(v)o (e)f(to)0 1789 y(prin)o(t)i(the)f(string)h Fr("\\a")p Fv(.)32 b(The)20 b(sp)q(ecial)h(c)o(haracter)e(`)p Fr(\\a)p Fv(')f(stands)h(for)g(the)h(alert)f(c)o(haracter)g(\(ASCI)q(I)h(7\).)32 b(See)0 1851 y(Section)16 b(3.1.2)e([String)h(Constan)o(ts],)e(page)i (22.)62 1942 y(Once)22 b(this)f(function)g(is)g(de\014ned,)h(y)o(ou)f (can)f(ask)g(Octa)o(v)o(e)g(to)g(ev)m(aluate)h(it)g(b)o(y)f(t)o(yping)h (the)f(name)h(of)f(the)0 2005 y(function.)62 2096 y(Normally)l(,)d(y)o (ou)g(will)h(w)o(an)o(t)d(to)h(pass)h(some)f(information)h(to)f(the)g (functions)i(y)o(ou)e(de\014ne.)25 b(The)17 b(syn)o(tax)f(for)0 2158 y(passing)g(parameters)e(to)h(a)f(function)i(in)g(Octa)o(v)o(e)f (is)120 2246 y Fr(function)23 b Fp(name)j Fr(\()p Fp(arg-list)q Fr(\))168 2308 y Fp(b)q(o)q(dy)120 2370 y Fr(endfunction)0 2454 y Fv(where)16 b Fp(arg-list)g Fv(is)g(a)f(comma-separated)g(list)h (of)f(the)h(function's)g(argumen)o(ts.)j(When)d(the)g(function)g(is)g (called,)0 2516 y(the)f(argumen)o(t)f(names)h(are)g(used)h(to)e(hold)i (the)f(argumen)o(t)f(v)m(alues)j(giv)o(en)e(in)h(the)f(call.)21 b(The)15 b(list)h(of)f(argumen)o(ts)0 2579 y(ma)o(y)f(b)q(e)i(empt)o(y) l(,)f(in)h(whic)o(h)g(case)f(this)h(form)e(is)i(equiv)m(alen)o(t)h(to)e (the)g(one)g(sho)o(wn)g(ab)q(o)o(v)o(e.)62 2670 y(T)l(o)g(prin)o(t)h(a) f(message)f(along)i(with)f(ringing)h(the)g(b)q(ell,)g(y)o(ou)f(migh)o (t)g(mo)q(dify)h(the)f Fr(beep)g Fv(to)f(lo)q(ok)i(lik)o(e)g(this:)p eop %%Page: 50 52 50 51 bop 0 -58 a Fv(50)1766 b(Octa)o(v)o(e)120 183 y Fr(function)23 b(wakeup)g(\(message\))168 246 y(printf)g (\("\\a\045s\\n",)f(message\);)120 308 y(endfunction)62 406 y Fv(Calling)17 b(this)e(function)h(using)g(a)f(statemen)o(t)f(lik) o(e)j(this)120 498 y Fr(wakeup)23 b(\("Rise)g(and)h(shine!"\);)0 604 y Fv(will)19 b(cause)f(Octa)o(v)o(e)f(to)g(ring)g(y)o(our)g (terminal's)h(b)q(ell)h(and)f(prin)o(t)g(the)f(message)g(`)p Fr(Rise)e(and)f(shine!)p Fv(',)j(follo)o(w)o(ed)0 666 y(b)o(y)e(a)g(newline)i(c)o(haracter)e(\(the)g(`)p Fr(\\n)p Fv(')f(in)i(the)f(\014rst)g(argumen)o(t)f(to)h(the)g Fr(printf)f Fv(statemen)o(t\).)62 771 y(In)k(most)e(cases,)g(y)o(ou)h (will)h(also)f(w)o(an)o(t)e(to)h(get)h(some)f(information)h(bac)o(k)g (from)f(the)g(functions)i(y)o(ou)e(de\014ne.)0 833 y(Here)f(is)h(the)f (syn)o(tax)g(for)f(writing)i(a)f(function)h(that)f(returns)g(a)g (single)h(v)m(alue:)120 935 y Fr(function)23 b Fp(ret-v)m(ar)k Fr(=)c Fp(name)k Fr(\()p Fp(arg-list)q Fr(\))168 997 y Fp(b)q(o)q(dy)120 1059 y Fr(endfunction)0 1157 y Fv(The)21 b(sym)o(b)q(ol)g Fp(ret-v)m(ar)i Fv(is)e(the)f(name)h(of)f(the)h(v)m (ariable)g(that)f(will)i(hold)f(the)g(v)m(alue)h(to)e(b)q(e)h(returned) f(b)o(y)h(the)0 1219 y(function.)41 b(This)22 b(v)m(ariable)i(m)o(ust)d (b)q(e)h(de\014ned)i(b)q(efore)e(the)g(end)g(of)g(the)g(function)h(b)q (o)q(dy)f(in)h(order)f(for)f(the)0 1282 y(function)16 b(to)f(return)g(a)g(v)m(alue.)62 1387 y(F)l(or)g(example,)g(here)h(is)g (a)f(function)h(that)e(computes)h(the)h(a)o(v)o(erage)e(of)h(the)g (elemen)o(ts)h(of)e(a)h(v)o(ector:)120 1488 y Fr(function)23 b(retval)g(=)h(avg)f(\(v\))168 1550 y(retval)g(=)g(sum)h(\(v\))f(/)h (length)f(\(v\);)120 1612 y(endfunction)62 1710 y Fv(If)16 b(w)o(e)f(had)g(written)g Fr(avg)g Fv(lik)o(e)h(this)g(instead,)120 1813 y Fr(function)23 b(retval)g(=)h(avg)f(\(v\))168 1875 y(if)g(\(is_vector)g(\(v\)\))215 1937 y(retval)g(=)h(sum)g(\(v\))f (/)h(length)f(\(v\);)168 2000 y(endif)120 2062 y(endfunction)0 2160 y Fv(and)14 b(then)g(called)h(the)f(function)h(with)f(a)f(matrix)h (instead)g(of)f(a)h(v)o(ector)f(as)g(the)h(argumen)o(t,)f(Octa)o(v)o(e) g(w)o(ould)h(ha)o(v)o(e)0 2222 y(prin)o(ted)i(an)f(error)g(message)f (lik)o(e)j(this:)120 2323 y Fr(error:)23 b(`retval')g(undefined)f(near) i(line)f(1)h(column)f(10)120 2385 y(error:)g(evaluating)g(index)g (expression)f(near)i(line)f(7,)g(column)g(1)0 2483 y Fv(b)q(ecause)f(the)e(b)q(o)q(dy)i(of)e(the)h Fr(if)f Fv(statemen)o(t)f(w)o(as)h(nev)o(er)h(executed,)i(and)d Fr(retval)g Fv(w)o(as)g(nev)o(er)h(de\014ned.)37 b(T)l(o)0 2545 y(prev)o(en)o(t)14 b(obscure)g(errors)g(lik)o(e)h(this,)f(it)h(is) g(a)e(go)q(o)q(d)h(idea)h(to)f(alw)o(a)o(ys)f(mak)o(e)h(sure)g(that)g (the)g(return)g(v)m(ariables)h(will)0 2608 y(alw)o(a)o(ys)d(ha)o(v)o(e) g(v)m(alues,)i(and)f(to)f(pro)q(duce)i(meaningful)g(error)e(messages)g (when)h(problems)g(are)g(encoun)o(tered.)20 b(F)l(or)0 2670 y(example,)c Fr(avg)e Fv(could)j(ha)o(v)o(e)d(b)q(een)j(written)e (lik)o(e)h(this:)p eop %%Page: 51 53 51 52 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(51)120 183 y Fr(function)23 b(retval)g(=)h(avg)f(\(v\)) 168 246 y(retval)g(=)g(0;)168 308 y(if)g(\(is_vector)g(\(v\)\))215 370 y(retval)g(=)h(sum)g(\(v\))f(/)h(length)f(\(v\);)168 432 y(else)215 495 y(error)h(\("avg:)f(expecting)f(vector)h (argument"\);)168 557 y(endif)120 619 y(endfunction)62 703 y Fv(There)11 b(is)g(still)h(one)f(additional)h(problem)f(with)g (this)g(function.)19 b(What)10 b(if)g(it)h(is)g(called)h(without)f(an)f (argumen)o(t?)0 765 y(Without)17 b(additional)h(error)e(c)o(hec)o (king,)h(Octa)o(v)o(e)g(will)h(probably)f(prin)o(t)h(an)e(error)g (message)g(that)g(w)o(on't)g(really)0 828 y(help)f(y)o(ou)e(trac)o(k)g (do)o(wn)h(the)g(source)g(of)f(the)h(error.)k(T)l(o)c(allo)o(w)g(y)o (ou)f(to)h(catc)o(h)f(errors)g(lik)o(e)i(this,)f(Octa)o(v)o(e)f(pro)o (vides)0 890 y(eac)o(h)j(function)g(with)g(an)f(automatic)g(v)m (ariable)i(called)g Fr(nargin)p Fv(.)j(Eac)o(h)15 b(time)h(a)f (function)h(is)g(called,)h Fr(nargin)d Fv(is)0 952 y(automatically)e (initialized)i(to)d(the)g(n)o(um)o(b)q(er)h(of)e(argumen)o(ts)h(that)f (ha)o(v)o(e)h(actually)h(b)q(een)g(passed)g(to)e(the)h(function.)0 1015 y(F)l(or)k(example,)g(w)o(e)g(migh)o(t)g(rewrite)g(the)h Fr(avg)f Fv(function)h(lik)o(e)g(this:)120 1103 y Fr(function)23 b(retval)g(=)h(avg)f(\(v\))168 1165 y(retval)g(=)g(0;)168 1228 y(if)g(\(nargin)g(!=)h(1\))215 1290 y(error)g(\("usage:)e(avg)i (\(vector\)"\);)168 1352 y(endif)168 1414 y(if)f(\(is_vector)g(\(v\)\)) 215 1477 y(retval)g(=)h(sum)g(\(v\))f(/)h(length)f(\(v\);)168 1539 y(else)215 1601 y(error)h(\("avg:)f(expecting)f(vector)h (argument"\);)168 1664 y(endif)120 1726 y(endfunction)62 1810 y Fv(Although)16 b(Octa)o(v)o(e)e(do)q(es)i(not)e(consider)i(it)g (an)f(error)f(if)i(y)o(ou)e(call)i(a)f(function)h(with)f(more)g (argumen)o(ts)f(than)0 1872 y(w)o(ere)k(exp)q(ected,)i(doing)f(so)f(is) h(probably)g(an)g(error,)f(so)g(w)o(e)g(c)o(hec)o(k)h(for)e(that)h(p)q (ossibilit)o(y)j(to)q(o,)d(and)h(issue)g(the)0 1934 y(error)14 b(message)h(if)h(either)g(to)q(o)e(few)h(or)g(to)q(o)g(man)o(y)f (argumen)o(ts)h(ha)o(v)o(e)g(b)q(een)h(pro)o(vided.)62 2026 y(The)i(b)q(o)q(dy)g(of)f(a)g(user-de\014ned)i(function)g(can)e (con)o(tain)h(a)f Fr(return)f Fv(statemen)o(t.)26 b(This)18 b(statemen)o(t)e(returns)0 2088 y(con)o(trol)j(to)f(the)h(rest)f(of)g (the)h(Octa)o(v)o(e)g(program.)29 b(A)19 b Fr(return)f Fv(statemen)o(t)g(is)h(assumed)g(at)f(the)h(end)h(of)e(ev)o(ery)0 2150 y(function)e(de\014nition.)0 2317 y Fu(5.2)33 b(Multiple)17 b(Return)f(V)-6 b(alues)62 2429 y Fv(Unlik)o(e)16 b(man)o(y)e(other)g (computer)g(languages,)g(Octa)o(v)o(e)g(allo)o(ws)g(y)o(ou)g(to)f (de\014ne)j(functions)f(that)e(return)h(more)0 2491 y(than)h(one)g(v)m (alue.)21 b(The)16 b(syn)o(tax)e(for)h(de\014ning)i(functions)f(that)e (return)h(m)o(ultiple)i(v)m(alues)g(is)120 2570 y Fr(function)23 b([)p Fp(ret-list)q Fr(])h(=)g Fp(name)i Fr(\()p Fp(arg-list)q Fr(\))168 2620 y Fp(b)q(o)q(dy)120 2670 y Fr(endfunction)p eop %%Page: 52 54 52 53 bop 0 -58 a Fv(52)1766 b(Octa)o(v)o(e)0 183 y(where)13 b Fp(name)p Fv(,)f Fp(arg-list)p Fv(,)h(and)g Fp(b)q(o)q(dy)k Fv(ha)o(v)o(e)12 b(the)h(same)f(meaning)h(as)f(b)q(efore,)h(and)f Fp(ret-list)j Fv(is)e(a)f(comma-separated)0 246 y(list)i(of)f(v)m (ariable)h(names)f(that)g(will)i(hold)f(the)f(v)m(alues)h(returned)g (from)e(the)i(function.)20 b(The)13 b(list)h(of)f(return)g(v)m(alues)0 308 y(m)o(ust)e(ha)o(v)o(e)f(at)h(least)g(one)h(elemen)o(t.)19 b(If)11 b Fp(ret-list)i Fv(has)e(only)h(one)f(elemen)o(t,)i(this)e (form)g(of)g(the)g Fr(function)f Fv(statemen)o(t)0 370 y(is)16 b(equiv)m(alen)o(t)h(to)d(the)h(form)g(describ)q(ed)i(in)f(the) f(previous)h(section.)62 455 y(Here)e(is)h(an)f(example)g(of)g(a)g (function)g(that)g(returns)f(t)o(w)o(o)g(v)m(alues,)i(the)f(maxim)o(um) g(elemen)o(t)g(of)g(a)g(v)o(ector)f(and)0 518 y(the)i(index)i(of)e(its) g(\014rst)g(o)q(ccurrence)h(in)g(the)f(v)o(ector.)120 590 y Fr(function)23 b([max,)g(idx])g(=)h(vmax)f(\(v\))168 653 y(idx)g(=)h(1;)168 715 y(max)f(=)h(v)g(\(idx\);)168 777 y(for)f(i)h(=)g(2:length)e(\(v\))215 839 y(if)i(\(v)g(\(i\))f(>)h (max\))263 902 y(max)g(=)f(v)h(\(i\);)263 964 y(idx)g(=)f(i;)215 1026 y(endif)168 1088 y(endfor)120 1151 y(endfunction)62 1229 y Fv(In)18 b(this)g(particular)g(case,)g(the)f(t)o(w)o(o)f(v)m (alues)j(could)f(ha)o(v)o(e)f(b)q(een)i(returned)f(as)f(elemen)o(ts)h (of)f(a)g(single)h(arra)o(y)l(,)0 1291 y(but)d(that)f(is)i(not)e(alw)o (a)o(ys)g(p)q(ossible)j(or)d(con)o(v)o(enien)o(t.)20 b(The)c(v)m(alues)g(to)e(b)q(e)h(returned)h(ma)o(y)e(not)g(ha)o(v)o(e)h (compatible)0 1353 y(dimensions,)h(and)g(it)f(is)h(often)f(desirable)i (to)d(giv)o(e)i(the)f(individual)j(return)d(v)m(alues)i(distinct)f (names.)62 1438 y(In)d(addition)h(to)e(setting)g Fr(nargin)g Fv(eac)o(h)g(time)h(a)f(function)h(is)g(called,)i(Octa)o(v)o(e)d(also)g (automatically)h(initializes)0 1501 y Fr(nargout)21 b Fv(to)g(the)g(n)o(um)o(b)q(er)h(of)g(v)m(alues)g(that)f(are)h(exp)q (ected)h(to)e(b)q(e)h(returned.)39 b(This)23 b(allo)o(ws)f(y)o(ou)f(to) g(write)0 1563 y(functions)c(that)e(b)q(eha)o(v)o(e)h(di\013eren)o(tly) h(dep)q(ending)h(on)d(the)h(n)o(um)o(b)q(er)g(of)g(v)m(alues)h(that)e (the)h(user)g(of)f(the)h(function)0 1625 y(has)f(requested.)20 b(The)c(implicit)h(assignmen)o(t)e(to)f(the)i(built-in)h(v)m(ariable)g Fr(ans)d Fv(do)q(es)i(not)e(\014gure)h(in)h(the)g(coun)o(t)e(of)0 1687 y(output)h(argumen)o(ts,)f(so)h(the)g(v)m(alue)h(of)f Fr(nargout)f Fv(ma)o(y)h(b)q(e)h(zero.)62 1773 y(The)g Fr(svd)g Fv(and)g Fr(lu)g Fv(functions)g(are)g(examples)h(of)e (built-in)k(functions)d(that)g(b)q(eha)o(v)o(e)g(di\013eren)o(tly)h (dep)q(ending)0 1835 y(on)e(the)g(v)m(alue)i(of)e Fr(nargout)p Fv(.)62 1920 y(It)21 b(is)h(p)q(ossible)g(to)f(write)g(functions)h (that)e(only)h(set)g(some)g(return)g(v)m(alues.)38 b(F)l(or)20 b(example,)j(calling)g(the)0 1982 y(function)120 2055 y Fr(function)g([x,)g(y,)h(z])f(=)h(f)g(\(\))168 2105 y(x)f(=)h(1;)168 2155 y(z)f(=)h(2;)120 2205 y(endfunction)0 2290 y Fv(as)120 2363 y Fr([a,)f(b,)h(c])g(=)f(f)h(\(\))0 2448 y Fv(pro)q(duces:)120 2521 y Fr(a)g(=)f(1)120 2620 y(b)h(=)f([]\(0x0\))p eop %%Page: 53 55 53 54 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(53)120 183 y Fr(c)24 b(=)f(2)0 323 y Fu(5.3)33 b(V)-6 b(ariable-length)17 b(Argumen)n(t)d(Lists)62 429 y Fv(Octa)o(v)o(e)j(has)g(a)g(real)g(mec)o(hanism)h(for)e(handling)j (functions)f(that)e(tak)o(e)h(an)g(unsp)q(eci\014ed)i(n)o(um)o(b)q(er)f (of)e(argu-)0 491 y(men)o(ts,)e(so)g(it)h(is)h(not)e(necessary)h(to)f (place)i(an)f(upp)q(er)g(b)q(ound)h(on)f(the)g(n)o(um)o(b)q(er)g(of)f (optional)h(argumen)o(ts)f(that)g(a)0 554 y(function)i(can)f(accept.)62 638 y(Here)20 b(is)g(an)f(example)h(of)f(a)g(function)h(that)f(uses)g (the)h(new)f(syn)o(tax)g(to)g(prin)o(t)g(a)g(header)h(follo)o(w)o(ed)g (b)o(y)f(an)0 701 y(unsp)q(eci\014ed)f(n)o(um)o(b)q(er)d(of)g(v)m (alues:)120 773 y Fr(function)23 b(foo)g(\(heading,)g(...\))168 823 y(disp)g(\(heading\);)168 873 y(va_start)f(\(\);)168 923 y(while)h(\(--nargin\))215 972 y(disp)h(\(va_arg)f(\(\)\);)168 1022 y(endwhile)120 1072 y(endfunction)62 1157 y Fv(The)17 b(ellipsis)i(that)d(marks)g(the)g(v)m(ariable)i(argumen)o(t)e(list)h (ma)o(y)f(only)h(app)q(ear)g(once)g(and)f(m)o(ust)g(b)q(e)h(the)g(last) 0 1219 y(elemen)o(t)f(in)g(the)f(list)h(of)f(argumen)o(ts.)62 1304 y(Calling)g Fr(va_start\(\))d Fv(p)q(ositions)i(an)f(in)o(ternal)i (p)q(oin)o(ter)f(to)e(the)i(\014rst)f(unnamed)h(argumen)o(t)e(and)i (allo)o(ws)f(y)o(ou)0 1366 y(to)j(cycle)h(through)g(the)f(argumen)o(ts) g(more)g(than)g(once.)24 b(It)17 b(is)g(not)f(necessary)g(to)g(call)i Fr(va_start\(\))d Fv(if)i(y)o(ou)f(do)0 1428 y(not)f(plan)h(to)e(cycle) j(through)e(the)g(argumen)o(ts)f(more)h(than)g(once.)62 1513 y(The)f(function)h Fr(va_arg\(\))d Fv(returns)i(the)g(v)m(alue)h (of)e(the)h(next)g(a)o(v)m(ailable)h(argumen)o(t)e(and)h(mo)o(v)o(es)f (the)h(in)o(ternal)0 1576 y(p)q(oin)o(ter)j(to)f(the)h(next)g(argumen)o (t.)23 b(It)17 b(is)g(an)g(error)e(to)h(call)i Fr(va_arg\(\))e Fv(when)h(there)g(are)f(no)h(more)f(argumen)o(ts)0 1638 y(a)o(v)m(ailable.)62 1723 y(Sometimes)21 b(it)g(is)g(useful)h(to)e(b)q (e)i(able)f(to)f(pass)g(all)i(unnamed)f(argumen)o(ts)f(to)g(another)h (function.)37 b(The)0 1785 y(k)o(eyw)o(ord)14 b Fp(all)p 229 1785 14 2 v 18 w(v)m(a)p 291 1785 V 16 w(args)j Fv(mak)o(es)d(this) i(v)o(ery)f(easy)g(to)f(do.)20 b(F)l(or)15 b(example,)g(giv)o(en)h(the) f(functions)120 1857 y Fr(function)23 b(f)g(\(...\))168 1907 y(while)g(\(nargin--\))215 1957 y(disp)h(\(va_arg)f(\(\)\))168 2007 y(endwhile)120 2057 y(endfunction)120 2106 y(function)g(g)g (\(...\))168 2156 y(f)g(\("begin",)g(all_va_args,)f("end"\))120 2206 y(endfunction)0 2291 y Fv(the)15 b(statemen)o(t)120 2363 y Fr(g)24 b(\(1,)f(2,)h(3\))0 2448 y Fv(prin)o(ts)120 2521 y Fr(begin)120 2570 y(1)120 2620 y(2)120 2670 y(3)p eop %%Page: 54 56 54 55 bop 0 -58 a Fv(54)1766 b(Octa)o(v)o(e)120 183 y Fr(end)62 290 y Fv(The)12 b(k)o(eyw)o(ord)f Fr(all_va_args)g Fv(alw)o(a)o(ys)g(stands)h(for)f(the)h(en)o(tire)g(list)h(of)e (optional)i(argumen)o(t,)e(so)h(it)g(is)g(p)q(ossible)0 352 y(to)18 b(use)g(it)g(more)g(than)g(once)h(within)g(the)f(same)g (function)h(without)f(ha)o(ving)h(to)e(call)i Fr(var_start)14 b(\(\))p Fv(.)29 b(It)18 b(can)0 415 y(only)e(b)q(e)f(used)h(within)g (functions)g(that)f(tak)o(e)f(a)h(v)m(ariable)h(n)o(um)o(b)q(er)g(of)f (argumen)o(ts.)k(It)c(is)g(an)g(error)g(to)f(use)i(it)f(in)0 477 y(other)g(con)o(texts.)0 705 y Fu(5.4)33 b(V)-6 b(ariable-length)17 b(Return)g(Lists)62 832 y Fv(Octa)o(v)o(e)j(also)g(has)g(a)g(real)h (mec)o(hanism)g(for)e(handling)j(functions)f(that)e(return)i(an)f(unsp) q(eci\014ed)j(n)o(um)o(b)q(er)0 895 y(of)17 b(v)m(alues,)j(so)d(it)h (is)g(no)g(longer)g(necessary)g(to)f(place)i(an)f(upp)q(er)h(b)q(ound)f (on)g(the)g(n)o(um)o(b)q(er)g(of)g(outputs)f(that)g(a)0 957 y(function)f(can)f(pro)q(duce.)62 1064 y(Here)h(is)f(an)h(example)g (of)e(a)h(function)h(that)f(uses)g(the)g(new)h(syn)o(tax)e(to)h(pro)q (duce)h(N)f(v)m(alues:)120 1158 y Fr(function)23 b([...])g(=)h(foo)f (\(n,)h(x\))168 1208 y(for)f(i)h(=)g(1:n)215 1258 y(vr_val)f(\(i)h(*)g (x\);)168 1307 y(endfor)120 1357 y(endfunction)62 1464 y Fv(Eac)o(h)15 b(time)f Fr(vr_val\(\))g Fv(is)h(called,)h(it)e(places) i(the)e(v)m(alue)i(of)e(its)h(argumen)o(t)e(at)h(the)h(end)g(of)f(the)g (list)i(of)e(v)m(alues)0 1526 y(to)k(return)g(from)g(the)g(function.)30 b(Once)19 b Fr(vr_val\(\))f Fv(has)g(b)q(een)h(called,)i(there)d(is)h (no)f(w)o(a)o(y)g(to)f(go)h(bac)o(k)g(to)g(the)0 1589 y(b)q(eginning)f(of)e(the)g(list)h(and)g(rewrite)f(an)o(y)g(of)g(the)g (return)g(v)m(alues.)62 1695 y(As)f(with)g(v)m(ariable)h(argumen)o(t)e (lists,)i(the)f(ellipsis)i(that)e(marks)f(the)h(v)m(ariable)h(return)f (list)g(ma)o(y)f(only)i(app)q(ear)0 1758 y(once)h(and)f(m)o(ust)g(b)q (e)g(the)h(last)f(elemen)o(t)h(in)g(the)f(list)h(of)f(returned)g(v)m (alues.)0 1985 y Fu(5.5)33 b(Returning)17 b(F)-6 b(rom)13 b(a)i(F)-6 b(unction)62 2113 y Fv(The)18 b(b)q(o)q(dy)g(of)f(a)g (user-de\014ned)i(function)g(can)e(con)o(tain)h(a)f Fr(return)f Fv(statemen)o(t.)26 b(This)18 b(statemen)o(t)e(returns)0 2175 y(con)o(trol)f(to)f(the)i(rest)f(of)f(the)i(Octa)o(v)o(e)e (program.)19 b(It)c(lo)q(oks)h(lik)o(e)g(this:)120 2270 y Fr(return)62 2376 y Fv(Unlik)o(e)g(the)e Fr(return)f Fv(statemen)o(t)g(in)i(C,)e(Octa)o(v)o(e's)g Fr(return)g Fv(statemen)o(t)g(cannot)h(b)q(e)g(used)h(to)e(return)h(a)g(v)m(alue)0 2439 y(from)k(a)g(function.)32 b(Instead,)20 b(y)o(ou)e(m)o(ust)g (assign)h(v)m(alues)h(to)e(the)h(list)h(of)e(return)h(v)m(ariables)h (that)e(are)g(part)g(of)0 2501 y(the)f Fr(function)f Fv(statemen)o(t.)24 b(The)17 b Fr(return)f Fv(statemen)o(t)f(simply)k (mak)o(es)d(it)h(easier)g(to)g(exit)g(a)f(function)i(from)e(a)0 2563 y(deeply)h(nested)e(lo)q(op)h(or)f(conditional)i(statemen)o(t.)62 2670 y(Here)f(is)f(an)h(example)g(of)e(a)h(function)h(that)f(c)o(hec)o (ks)g(to)g(see)g(if)h(an)o(y)f(elemen)o(ts)h(of)e(a)h(v)o(ector)g(are)g (nonzero.)p eop %%Page: 55 57 55 56 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(55)120 183 y Fr(function)23 b(retval)g(=)h(any_nonzero)e (\(v\))168 246 y(retval)h(=)g(0;)168 308 y(for)g(i)h(=)g(1:length)e (\(v\))215 370 y(if)i(\(v)g(\(i\))f(!=)h(0\))263 432 y(retval)f(=)h(1;)263 495 y(return;)215 557 y(endif)168 619 y(endfor)168 681 y(printf)f(\("no)g(nonzero)g(elements)g (found\\n"\);)120 744 y(endfunction)62 824 y Fv(Note)14 b(that)g(this)h(function)g(could)h(not)e(ha)o(v)o(e)g(b)q(een)i (written)e(using)h(the)g Fr(break)f Fv(statemen)o(t)f(to)h(exit)h(the)f (lo)q(op)0 886 y(once)f(a)g(nonzero)g(v)m(alue)i(is)e(found)h(without)f (adding)h(extra)e(logic)i(to)e(a)o(v)o(oid)h(prin)o(ting)h(the)f (message)g(if)h(the)f(v)o(ector)0 949 y(do)q(es)j(con)o(tain)f(a)g (nonzero)g(elemen)o(t.)0 1100 y Fu(5.6)33 b(F)-6 b(unction)17 b(Files)62 1209 y Fv(Except)g(for)e(simple)j(one-shot)d(programs,)g(it) h(is)h(not)f(practical)h(to)e(ha)o(v)o(e)h(to)f(de\014ne)i(all)g(the)f (functions)h(y)o(ou)0 1271 y(need)f(eac)o(h)g(time)g(y)o(ou)f(need)h (them.)21 b(Instead,)16 b(y)o(ou)f(will)i(normally)g(w)o(an)o(t)d(to)h (sa)o(v)o(e)g(them)g(in)i(a)e(\014le)h(so)f(that)g(y)o(ou)0 1333 y(can)g(easily)i(edit)e(them,)g(and)h(sa)o(v)o(e)e(them)h(for)g (use)g(at)g(a)g(later)g(time.)62 1421 y(Octa)o(v)o(e)c(do)q(es)h(not)g (require)g(y)o(ou)g(to)f(load)g(function)i(de\014nitions)g(from)e (\014les)i(b)q(efore)f(using)g(them.)19 b(Y)l(ou)12 b(simply)0 1483 y(need)k(to)f(put)g(the)g(function)h(de\014nitions)h(in)f(a)f (place)h(where)g(Octa)o(v)o(e)f(can)g(\014nd)h(them.)62 1571 y(When)g(Octa)o(v)o(e)g(encoun)o(ters)g(an)f(iden)o(ti\014er)j (that)d(is)h(unde\014ned,)h(it)f(\014rst)g(lo)q(oks)g(for)f(v)m (ariables)i(or)e(functions)0 1633 y(that)j(are)g(already)g(compiled)i (and)f(curren)o(tly)f(listed)i(in)f(its)f(sym)o(b)q(ol)h(table.)30 b(If)18 b(it)h(fails)g(to)e(\014nd)i(a)f(de\014nition)0 1695 y(there,)13 b(it)g(searc)o(hes)g(the)g(list)h(of)f(directories)h (sp)q(eci\014ed)h(b)o(y)e(the)g(built-in)i(v)m(ariable)g Fr(LOADPATH)d Fv(for)g(\014les)i(ending)g(in)0 1758 y(`)p Fr(.m)p Fv(')g(that)g(ha)o(v)o(e)g(the)h(same)g(base)g(name)g(as)f(the) h(unde\014ned)i(iden)o(ti\014er.)1231 1741 y Fk(1)1271 1758 y Fv(See)e(Section)h(6.2)e([User)g(Preferences],)0 1820 y(page)k(62)h(for)f(a)g(description)i(of)e Fr(LOADPATH)p Fv(.)29 b(Once)20 b(Octa)o(v)o(e)e(\014nds)h(a)g(\014le)g(with)g(a)g (name)f(that)g(matc)o(hes,)h(the)0 1882 y(con)o(ten)o(ts)i(of)g(the)g (\014le)i(are)e(read.)38 b(If)22 b(it)f(de\014nes)i(a)e Fp(single)k Fv(function,)f(it)d(is)h(compiled)h(and)f(executed.)39 b(See)0 1944 y(Section)17 b(5.7)e([Script)i(Files],)f(page)g(56,)g(for) f(more)h(information)g(ab)q(out)g(ho)o(w)g(y)o(ou)g(can)g(de\014ne)h (more)f(than)g(one)0 2007 y(function)g(in)g(a)f(single)h(\014le.)62 2094 y(When)j(Octa)o(v)o(e)e(de\014nes)j(a)d(function)i(from)f(a)g (function)h(\014le,)g(it)f(sa)o(v)o(es)g(the)g(full)h(name)g(of)e(the)h (\014le)i(it)e(read)0 2157 y(and)d(the)f(time)h(stamp)e(on)i(the)f (\014le.)21 b(After)14 b(that,)f(it)i(c)o(hec)o(ks)f(the)h(time)g (stamp)e(on)i(the)f(\014le)i(ev)o(ery)e(time)h(it)f(needs)0 2219 y(the)i(function.)21 b(If)16 b(the)f(time)h(stamp)f(indicates)i (that)e(the)g(\014le)i(has)e(c)o(hanged)h(since)g(the)g(last)f(time)h (it)g(w)o(as)e(read,)0 2281 y(Octa)o(v)o(e)h(reads)g(it)g(again.)62 2369 y(Chec)o(king)g(the)e(time)h(stamp)f(allo)o(ws)g(y)o(ou)h(to)e (edit)j(the)e(de\014nition)j(of)d(a)g(function)h(while)h(Octa)o(v)o(e)e (is)h(running,)0 2431 y(and)j(automatically)h(use)f(the)g(new)g (function)h(de\014nition)h(without)e(ha)o(ving)g(to)f(restart)g(y)o (our)g(Octa)o(v)o(e)h(session.)0 2493 y(Chec)o(king)g(the)g(time)g (stamp)f(ev)o(ery)g(time)h(a)f(function)h(is)h(used)f(is)g(rather)f (ine\016cien)o(t,)i(but)e(it)h(has)f(to)g(b)q(e)i(done)0 2556 y(to)d(ensure)g(that)g(the)g(correct)g(function)h(de\014nition)h (is)f(used.)p 0 2614 600 2 v 21 2652 a Fk(1)62 2668 y Fv(The)g(`)p Fr(.m)p Fv(')e(su\016x)h(w)o(as)f(c)o(hosen)i(for)e (compatibilit)o(y)j(with)f Fq(Ma)m(tlab)p Fv(.)p eop %%Page: 56 58 56 57 bop 0 -58 a Fv(56)1766 b(Octa)o(v)o(e)62 183 y(Octa)o(v)o(e)17 b(assumes)g(that)g(function)h(\014les)g(in)g(the)g(`)p Fr(/usr/local/lib/octave/)o(1.1.0)p Fv(')c(directory)j(tree)g(will)0 246 y(not)d(c)o(hange,)g(so)g(it)h(do)q(esn't)f(ha)o(v)o(e)g(to)g(c)o (hec)o(k)g(their)h(time)g(stamps)f(ev)o(ery)g(time)h(the)f(functions)h (de\014ned)h(in)f(those)0 308 y(\014les)h(are)f(used.)20 b(This)c(is)g(normally)f(a)g(v)o(ery)g(go)q(o)q(d)g(assumption)g(and)h (pro)o(vides)f(a)g(signi\014can)o(t)h(impro)o(v)o(emen)o(t)f(in)0 370 y(p)q(erformance)g(for)g(the)g(function)h(\014les)g(that)f(are)g (distributed)h(with)g(Octa)o(v)o(e.)62 461 y(If)k(y)o(ou)f(kno)o(w)g (that)g(y)o(our)g(o)o(wn)g(function)h(\014les)g(will)h(not)e(c)o(hange) h(while)h(y)o(ou)e(are)g(running)i(Octa)o(v)o(e,)e(y)o(ou)0 523 y(can)c(impro)o(v)o(e)f(p)q(erformance)h(b)o(y)g(setting)g(the)f(v) m(ariable)j Fr(ignore_function_time_st)o(amp)12 b Fv(to)i Fr("all")p Fv(,)f(so)i(that)0 585 y(Octa)o(v)o(e)h(will)j(ignore)e(the) g(time)g(stamps)f(for)g(all)i(function)f(\014les.)26 b(Setting)17 b(it)g(to)f Fr("system")g Fv(giv)o(es)h(the)f(default)0 647 y(b)q(eha)o(vior.)k(If)c(y)o(ou)f(set)g(it)g(to)g(an)o(ything)g (else,)h(Octa)o(v)o(e)f(will)h(c)o(hec)o(k)g(the)f(time)h(stamps)e(on)h (all)i(function)f(\014les.)0 810 y Fu(5.7)33 b(Script)17 b(Files)62 921 y Fv(A)j(script)h(\014le)g(is)g(a)e(\014le)j(con)o (taining)e(\(almost\))f(an)o(y)h(sequence)h(of)f(Octa)o(v)o(e)g (commands.)34 b(It)20 b(is)h(read)f(and)0 984 y(ev)m(aluated)14 b(just)g(as)f(if)g(y)o(ou)h(had)f(t)o(yp)q(ed)h(eac)o(h)f(command)h(at) e(the)i(Octa)o(v)o(e)f(prompt,)g(and)g(pro)o(vides)h(a)f(con)o(v)o (enien)o(t)0 1046 y(w)o(a)o(y)h(to)h(p)q(erform)g(a)g(sequence)h(of)f (commands)g(that)f(do)h(not)g(logically)i(b)q(elong)f(inside)h(a)e (function.)62 1136 y(Unlik)o(e)f(a)f(function)g(\014le,)h(a)f(script)g (\014le)g(m)o(ust)f Fp(not)i Fv(b)q(egin)g(with)f(the)g(k)o(eyw)o(ord)e Fr(function)p Fv(.)18 b(If)13 b(it)g(do)q(es,)g(Octa)o(v)o(e)0 1199 y(will)k(assume)e(that)f(it)i(is)f(a)g(function)h(\014le,)g(and)f (that)g(it)g(de\014nes)h(a)f(single)i(function)e(that)g(should)h(b)q(e) g(ev)m(aluated)0 1261 y(as)f(so)q(on)g(as)g(it)g(is)h(de\014ned.)62 1351 y(A)g(script)h(\014le)g(also)f(di\013ers)h(from)e(a)h(function)h (\014le)g(in)g(that)f(the)g(v)m(ariables)h(named)g(in)g(a)f(script)g (\014le)h(are)f(not)0 1414 y(lo)q(cal)i(v)m(ariables,)g(but)e(are)h(in) g(the)g(same)f(scop)q(e)i(as)e(the)g(other)h(v)m(ariables)h(that)e(are) g(visible)j(on)d(the)h(command)0 1476 y(line.)62 1566 y(Ev)o(en)j(though)f(a)g(script)g(\014le)i(ma)o(y)d(not)h(b)q(egin)i (with)e(the)h Fr(function)e Fv(k)o(eyw)o(ord,)h(it)g(is)h(p)q(ossible)h (to)e(de\014ne)0 1629 y(more)e(than)g(one)g(function)h(in)g(a)f(single) i(script)f(\014le)g(and)f(load)h(\(but)f(not)g(execute\))g(all)h(of)f (them)g(at)g(once.)26 b(T)l(o)0 1691 y(do)17 b(this,)h(the)f(\014rst)f (tok)o(en)h(in)h(the)f(\014le)h(\(ignoring)g(commen)o(ts)e(and)h(other) g(white)h(space\))f(m)o(ust)f(b)q(e)i(something)0 1753 y(other)e(than)h Fr(function)p Fv(.)23 b(If)17 b(y)o(ou)g(ha)o(v)o(e)f (no)h(other)f(statemen)o(ts)g(to)g(ev)m(aluate,)h(y)o(ou)g(can)g(use)g (a)f(statemen)o(t)g(that)0 1816 y(has)f(no)g(e\013ect,)g(lik)o(e)h (this:)120 1902 y Fr(#)24 b(Prevent)f(Octave)g(from)g(thinking)g(that)g (this)120 1964 y(#)h(is)f(a)h(function)f(file:)120 2089 y(1;)120 2213 y(#)h(Define)f(function)g(one:)120 2338 y(function)g(one)g(\(\))168 2400 y(...)62 2483 y Fv(T)l(o)15 b(ha)o(v)o(e)g(Octa)o(v)o(e)g(read)h(and)f(compile)i(these)f(functions) g(in)o(to)g(an)f(in)o(ternal)h(form,)f(y)o(ou)g(need)h(to)f(mak)o(e)g (sure)0 2545 y(that)g(the)g(\014le)i(is)f(in)g(Octa)o(v)o(e's)e Fr(LOADPATH)p Fv(,)g(then)i(simply)h(t)o(yp)q(e)e(the)h(base)f(name)h (of)f(the)g(\014le)i(that)d(con)o(tains)i(the)0 2608 y(commands.)24 b(\(Octa)o(v)o(e)16 b(uses)h(the)g(same)f(rules)i(to)e (searc)o(h)g(for)g(script)i(\014les)f(as)g(it)f(do)q(es)h(to)g(searc)o (h)f(for)g(function)0 2670 y(\014les.\))p eop %%Page: 57 59 57 58 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(57)62 183 y(If)19 b(the)f(\014rst)g(tok)o(en)g(in)h(a)e (\014le)j(\(ignoring)e(commen)o(ts\))f(is)i Fr(function)p Fv(,)f(Octa)o(v)o(e)f(will)j(compile)g(the)e(function)0 246 y(and)13 b(try)f(to)g(execute)i(it,)f(prin)o(ting)h(a)e(message)h (w)o(arning)f(ab)q(out)h(an)o(y)g(non-whitespace)h(c)o(haracters)e (that)g(app)q(ear)0 308 y(after)i(the)i(function)g(de\014nition.)62 391 y(Note)d(that)f(Octa)o(v)o(e)g(do)q(es)i(not)e(try)g(to)h(lo)q (okup)g(the)g(de\014nition)i(of)d(an)o(y)h(iden)o(ti\014er)h(un)o(til)g (it)f(needs)h(to)e(ev)m(aluate)0 453 y(it.)21 b(This)15 b(means)h(that)e(Octa)o(v)o(e)h(will)i(compile)g(the)f(follo)o(wing)g (statemen)o(ts)e(if)i(they)f(app)q(ear)g(in)i(a)e(script)g(\014le,)h (or)0 516 y(are)f(t)o(yp)q(ed)g(at)g(the)g(command)g(line,)120 595 y Fr(#)24 b(not)f(a)h(function)f(file:)120 657 y(1;)120 719 y(function)g(foo)g(\(\))168 781 y(do_something)f(\(\);)120 844 y(endfunction)120 906 y(function)h(do_something)f(\(\))168 968 y(do_something_else)f(\(\);)120 1030 y(endfunction)0 1106 y Fv(ev)o(en)16 b(though)g(the)h(function)g Fr(do_something)d Fv(is)j(not)f(de\014ned)h(b)q(efore)f(it)h(is)g(referenced)g(in)g(the)f (function)h Fr(foo)p Fv(.)0 1169 y(This)d(is)h(not)e(an)h(error)f(b)q (ecause)i(the)f(Octa)o(v)o(e)g(do)q(es)g(not)f(need)i(to)e(resolv)o(e)h (all)h(sym)o(b)q(ols)f(that)g(are)f(referenced)i(b)o(y)0 1231 y(a)g(function)h(un)o(til)g(the)g(function)g(is)f(actually)h(ev)m (aluated.)62 1314 y(Since)j(Octa)o(v)o(e)e(do)q(esn't)g(lo)q(ok)h(for)e (de\014nitions)j(un)o(til)g(they)e(are)g(needed,)i(the)e(follo)o(wing)h (co)q(de)g(will)h(alw)o(a)o(ys)0 1376 y(prin)o(t)c(`)p Fr(bar)g(=)g(3)p Fv(')f(whether)i(it)f(is)h(t)o(yp)q(ed)f(directly)h (on)f(the)h(command)f(line,)h(read)f(from)f(a)h(script)h(\014le,)f(or)g (is)h(part)0 1439 y(of)f(a)g(function)h(b)q(o)q(dy)l(,)f(ev)o(en)h(if)g (there)f(is)h(a)e(function)j(or)d(script)i(\014le)g(called)h(`)p Fr(bar.m)p Fv(')d(in)i(Octa)o(v)o(e's)e Fr(LOADPATH)p Fv(.)120 1518 y Fr(eval)23 b(\("bar)g(=)h(3"\);)120 1580 y(bar)62 1656 y Fv(Co)q(de)14 b(lik)o(e)g(this)g(app)q(earing)g(within) g(a)f(function)h(b)q(o)q(dy)g(could)h(fo)q(ol)e(Octa)o(v)o(e)g(if)h (de\014nitions)h(w)o(ere)e(resolv)o(ed)g(as)0 1718 y(the)g(function)h (w)o(as)f(b)q(eing)h(compiled.)21 b(It)13 b(w)o(ould)h(b)q(e)g (virtually)g(imp)q(ossible)i(to)d(mak)o(e)f(Octa)o(v)o(e)h(clev)o(er)h (enough)g(to)0 1780 y(ev)m(aluate)i(this)h(co)q(de)f(in)g(a)g (consisten)o(t)f(fashion.)22 b(The)16 b(parser)f(w)o(ould)h(ha)o(v)o(e) f(to)g(b)q(e)h(able)h(to)e(p)q(erform)g(the)h(`)p Fr(eval)0 1843 y(\(\))p Fv(')e(statemen)o(t)g(at)g(compile)i(time,)f(and)g(that)f (w)o(ould)h(b)q(e)g(imp)q(ossible)i(unless)f(all)g(the)e(references)i (in)f(the)g(string)0 1905 y(to)d(b)q(e)h(ev)m(aluated)h(could)g(also)f (b)q(e)g(resolv)o(ed,)g(and)g(requiring)h(that)e(w)o(ould)h(b)q(e)h(to) q(o)e(restrictiv)o(e)h(\(the)f(string)h(migh)o(t)0 1967 y(come)i(from)g(user)g(input,)h(or)e(dep)q(end)j(on)e(things)h(that)f (are)f(not)h(kno)o(wn)g(un)o(til)h(the)g(function)g(is)g(ev)m (aluated\).)0 2101 y Fu(5.8)33 b(Dynamically)15 b(Link)n(ed)i(F)-6 b(unctions)62 2205 y Fv(On)17 b(some)f(systems,)f(Octa)o(v)o(e)h(can)g (dynamically)i(load)e(and)h(execute)f(functions)h(written)f(in)h(C)p Fr(++)f Fv(or)f(other)0 2267 y(compiled)g(languages.)k(This)14 b(curren)o(tly)g(only)g(w)o(orks)e(on)h(systems)g(that)g(ha)o(v)o(e)g (a)f(w)o(orking)h(v)o(ersion)h(of)f(the)g(GNU)0 2329 y(dynamic)21 b(link)o(er,)g Fr(dld)p Fv(.)33 b(Unfortunately)l(,)21 b Fr(dld)e Fv(do)q(es)h(not)f(w)o(ork)g(on)h(v)o(ery)f(man)o(y)g (systems,)h(but)g(someone)f(is)0 2391 y(w)o(orking)13 b(on)g(making)g Fr(dld)g Fv(use)g(the)h(GNU)f(Binary)g(File)i (Descriptor)e(library)l(,)h Fr(BFD)p Fv(,)f(so)f(that)h(ma)o(y)f(so)q (on)h(c)o(hange.)0 2454 y(In)18 b(an)o(y)f(case,)h(it)g(should)h(not)e (b)q(e)h(to)q(o)f(hard)g(to)g(mak)o(e)g(Octa)o(v)o(e's)g(dynamic)h (linking)i(features)d(w)o(ork)g(on)g(other)0 2516 y(systems)e(using)h (system-sp)q(eci\014c)g(dynamic)h(linking)g(facilities.)62 2599 y(Here)f(is)f(an)h(example)g(of)e(ho)o(w)h(to)g(write)g(a)g(C)p Fr(++)f Fv(function)j(that)d(Octa)o(v)o(e)h(can)g(load.)120 2670 y Fr(#include)23 b()p eop %%Page: 58 60 58 59 bop 0 -58 a Fv(58)1766 b(Octa)o(v)o(e)120 233 y Fr(#include)23 b("defun-dld.h")120 283 y(#include)g("tree-const.h")120 382 y(DEFUN_DLD)g(\("hello",)f(Fhello,)h(Shello,)g(-1,)h(-1,)168 432 y("hello)f(\(...\)\\n\\)120 482 y(\\n\\)120 532 y(Print)g(greeting) g(followed)g(by)g(the)h(values)f(of)g(all)h(the)f(arguments)g (passed.\\n\\)120 582 y(Returns)g(all)g(the)h(arguments)e(passed."\)) 120 632 y({)168 681 y(Octave_object)g(retval;)168 731 y(cerr)h(<<)h("Hello,)f(world!\\n";)168 781 y(int)g(nargin)g(=)h (args.length)e(\(\);)168 831 y(for)h(\(int)g(i)h(=)g(1;)g(i)f(<)h (nargin;)f(i++\))215 881 y(retval)g(\(nargin-i-1\))g(=)g (args\(i\).eval)g(\(1\);)168 930 y(return)g(retval;)120 980 y(})62 1063 y Fv(Octa)o(v)o(e's)15 b(dynamic)h(linking)h(features)e (curren)o(tly)g(ha)o(v)o(e)g(the)h(follo)o(wing)f(limitations.)37 1146 y Ft(\017)30 b Fv(Dynamic)16 b(linking)h(only)f(w)o(orks)e(on)h (systems)g(that)f(supp)q(ort)h(the)h(GNU)f(dynamic)h(link)o(er,)g Fr(dld)p Fv(.)37 1218 y Ft(\017)30 b Fv(Clearing)16 b(dynamically)h (link)o(ed)g(functions)f(do)q(esn't)f(w)o(ork.)37 1291 y Ft(\017)30 b Fv(Con\014guring)16 b(Octa)o(v)o(e)g(with)g Fr(--enable-lite-kernel)d Fv(seems)j(to)f(mostly)h(w)o(ork)e(to)i(mak)o (e)f(nonessen)o(tial)90 1353 y(built-in)i(functions)e(dynamically)h (loaded,)e(but)h(there)f(also)g(seem)g(to)g(b)q(e)h(some)f(problems.)20 b(F)l(or)13 b(example,)90 1415 y(fsolv)o(e)18 b(seems)h(to)f(alw)o(a)o (ys)f(return)i Fr(info)14 b(==)h(3)p Fv(.)30 b(This)19 b(is)g(di\016cult)g(to)f(debug)h(since)h Fr(gdb)e Fv(w)o(on't)f(seem)i (to)90 1477 y(allo)o(w)c(breakp)q(oin)o(ts)h(to)f(b)q(e)g(set)g(inside) i(dynamically)g(loaded)f(functions.)37 1550 y Ft(\017)30 b Fv(Octa)o(v)o(e)17 b(uses)h(a)f(lot)g(of)g(memory)f(if)i(the)g (dynamically)h(link)o(ed)g(functions)f(are)f(compiled)i(to)e(include)i (de-)90 1612 y(bugging)d(sym)o(b)q(ols.)22 b(This)17 b(app)q(ears)e(to)h(b)q(e)g(a)f(limitation)j(with)e Fr(dld)p Fv(,)f(and)h(can)g(b)q(e)g(a)o(v)o(oided)g(b)o(y)g(not)f(using)90 1674 y Fr(-g)g Fv(to)f(compile)j(functions)f(that)f(will)h(b)q(e)g (link)o(ed)h(dynamically)l(.)62 1767 y(If)h(y)o(ou)g(w)o(ould)g(lik)o (e)h(to)e(v)o(olun)o(teer)h(to)g(help)h(impro)o(v)o(e)f(Octa)o(v)o(e's) f(abilit)o(y)i(to)e(dynamically)j(link)f(externally)0 1829 y(compiled)e(functions,)f(please)g(con)o(tact)e Fr(bug-octave@che.utexas.edu)p Fv(.)0 1957 y Fu(5.9)33 b(Organization)15 b(of)g(F)-6 b(unctions)17 b(Distributed)g(with)f (Octa)n(v)n(e)62 2061 y Fv(Man)o(y)11 b(of)g(Octa)o(v)o(e's)g(standard) g(functions)i(are)e(distributed)i(as)f(function)g(\014les.)20 b(They)11 b(are)h(lo)q(osely)g(organized)0 2123 y(b)o(y)e(topic,)i(in)f (sub)q(directories)h(of)d(`)p Fr(OCTAVE_HOME/lib/octave/VERS)o(ION/m)p Fv(')o(,)f(to)i(mak)o(e)g(it)g(easier)h(to)e(\014nd)i(them.)62 2206 y(The)16 b(follo)o(wing)g(is)g(a)f(list)i(of)e(all)h(the)g (function)g(\014le)g(sub)q(directories,)h(and)f(the)f(t)o(yp)q(es)h(of) f(functions)h(y)o(ou)f(will)0 2268 y(\014nd)h(there.)0 2361 y(`)p Fr(control)p Fv(')46 b(F)l(unctions)16 b(for)f(design)h(and) f(sim)o(ulation)h(of)f(automatic)g(con)o(trol)g(systems.)0 2444 y(`)p Fr(elfun)p Fv(')94 b(Elemen)o(tary)15 b(functions.)0 2526 y(`)p Fr(general)p Fv(')46 b(Miscellaneous)21 b(matrix)e (manipulations,)i(lik)o(e)f Fr(flipud)p Fv(,)f Fr(rot90)p Fv(,)g(and)g Fr(triu)p Fv(,)g(as)g(w)o(ell)h(as)e(other)240 2588 y(basic)e(functions,)f(lik)o(e)i Fr(is_matrix)p Fv(,)c Fr(nargchk)p Fv(,)h(etc.)0 2670 y(`)p Fr(image)p Fv(')94 b(Image)15 b(pro)q(cessing)h(to)q(ols.)k(These)c(functions)f (require)i(the)e(X)g(Windo)o(w)g(System.)p eop %%Page: 59 61 59 60 bop 0 -58 a Fv(Chapter)15 b(5:)k(F)l(unctions)d(and)g(Script)g (Files)1150 b(59)0 183 y(`)p Fr(linear-algebra)p Fv(')240 246 y(F)l(unctions)16 b(for)f(linear)h(algebra.)0 333 y(`)p Fr(miscellaneous)p Fv(')240 395 y(F)l(unctions)g(that)e(don't)h (really)h(b)q(elong)g(an)o(ywhere)g(else.)0 482 y(`)p Fr(plot)p Fv(')118 b(A)15 b(set)g(of)g(functions)h(that)e(implemen)o(t) j(the)e Fq(Ma)m(tlab)p Fv(-lik)o(e)i(plotting)f(functions.)0 569 y(`)p Fr(polynomial)p Fv(')240 632 y(F)l(unctions)g(for)f (manipulating)h(p)q(olynomials.)0 719 y(`)p Fr(set)p Fv(')142 b(F)l(unctions)16 b(for)f(creating)g(and)g(manipulating)i (sets)e(of)g(unique)h(v)m(alues.)0 806 y(`)p Fr(signal)p Fv(')70 b(F)l(unctions)16 b(for)f(signal)h(pro)q(cessing)g (applications.)0 893 y(`)p Fr(specfun)p Fv(')46 b(Sp)q(ecial)17 b(functions.)0 980 y(`)p Fr(special-matrix)p Fv(')240 1043 y(F)l(unctions)f(that)e(create)h(sp)q(ecial)i(matrix)e(forms.)0 1130 y(`)p Fr(startup)p Fv(')46 b(Octa)o(v)o(e's)14 b(system-wide)i (startup)f(\014le.)0 1217 y(`)p Fr(statistics)p Fv(')240 1279 y(Statistical)h(functions.)0 1366 y(`)p Fr(strings)p Fv(')46 b(Miscellaneous)17 b(string-handling)g(functions.)62 1462 y(See)e(Section)f(6.2)f([User)h(Preferences],)f(page)h(62)f(for)g (an)h(explanation)h(of)e(the)h(built-in)i(v)m(ariable)f Fr(LOADPATH)p Fv(,)0 1524 y(and)k(Section)g(5.6)f([F)l(unction)h (Files],)h(page)e(55)g(for)g(a)h(description)h(of)e(the)h(w)o(a)o(y)e (Octa)o(v)o(e)h(resolv)o(es)h(unde\014ned)0 1586 y(v)m(ariable)e(and)e (function)h(names.)p eop %%Page: 60 62 60 61 bop 0 -58 a Fv(60)1766 b(Octa)o(v)o(e)p eop %%Page: 61 63 61 62 bop 0 -58 a Fv(Chapter)15 b(6:)k(Built-in)f(V)l(ariables)1323 b(61)0 183 y Fs(6)41 b(Built-in)13 b(V)-7 b(ariables)62 308 y Fv(Most)18 b(Octa)o(v)o(e)g(v)m(ariables)i(are)e(a)o(v)m(ailable) i(for)e(y)o(ou)g(to)g(use)h(for)e(y)o(our)h(o)o(wn)g(purp)q(oses;)j (they)d(nev)o(er)h(c)o(hange)0 370 y(except)h(when)g(y)o(our)f(program) f(assigns)h(v)m(alues)i(to)d(them,)i(and)g(nev)o(er)g(a\013ect)e(an)o (ything)i(except)g(when)f(y)o(our)0 433 y(program)14 b(examines)i(them.)62 516 y(A)i(few)f(v)m(ariables)h(ha)o(v)o(e)f(sp)q (ecial)i(built-in)h(meanings.)27 b(Some)17 b(of)g(them,)g(lik)o(e)i Fr(pi)e Fv(and)g Fr(eps)g Fv(pro)o(vide)h(useful)0 578 y(prede\014ned)g(constan)o(t)d(v)m(alues.)24 b(Others,)17 b(lik)o(e)g Fr(do_fortran_indexing)d Fv(and)i Fr(page_screen_output)e Fv(are)i(ex-)0 640 y(amined)d(automatically)g(b)o(y)f(Octa)o(v)o(e,)g (so)g(that)g(y)o(ou)g(can)h(to)e(tell)j(Octa)o(v)o(e)e(ho)o(w)g(to)f (do)i(certain)f(things.)20 b(There)12 b(are)0 703 y(also)h(t)o(w)o(o)e (sp)q(ecial)k(v)m(ariables,)f Fr(ans)e Fv(and)h Fr(PWD)p Fv(,)f(that)h(are)f(set)g(automatically)i(b)o(y)e(Octa)o(v)o(e)h(and)g (carry)f(information)0 765 y(from)i(the)i(in)o(ternal)g(w)o(orkings)f (of)f(Octa)o(v)o(e)h(to)g(y)o(our)f(program.)62 848 y(This)h(c)o (hapter)g(do)q(cumen)o(ts)f(all)i(the)e(built-in)j(v)m(ariables)f(of)e (Octa)o(v)o(e.)19 b(Most)13 b(of)h(them)h(are)f(also)g(do)q(cumen)o (ted)0 910 y(in)i(the)f(c)o(hapters)g(that)g(describ)q(e)i(functions)f (that)e(use)i(them,)e(or)h(are)g(a\013ected)g(b)o(y)g(their)h(v)m (alues.)0 1039 y Fu(6.1)33 b(Prede\014ned)16 b(Constan)n(ts)0 1153 y Fr(I)p Fv(,)f Fr(i)p Fv(,)f Fr(J)p Fv(,)h Fr(j)61 b Fv(A)19 b(pure)h(imaginary)g(n)o(um)o(b)q(er,)g(de\014ned)h(as)1023 1118 y Ft(p)p 1061 1118 59 2 v 35 x(\000)p Fv(1.)33 b(The)19 b Fr(I)g Fv(and)h Fr(J)f Fv(forms)g(are)g(true)g(constan)o(ts,)240 1216 y(and)f(cannot)g(b)q(e)g(mo)q(di\014ed.)29 b(The)18 b Fr(i)g Fv(and)g Fr(j)f Fv(forms)g(are)h(lik)o(e)h(ordinary)f(v)m (ariables,)h(and)f(ma)o(y)f(b)q(e)240 1278 y(used)d(for)f(other)h(purp) q(oses.)20 b(Ho)o(w)o(ev)o(er,)12 b(unlik)o(e)k(other)d(v)m(ariables,)i (they)f(once)g(again)g(assume)f(their)240 1340 y(sp)q(ecial)18 b(prede\014ned)g(v)m(alues)g(if)f(they)f(are)h(cleared)g(See)g(Section) g(27.2)f([Miscellaneous)i(Utilities],)240 1402 y(page)d(154.)0 1486 y Fr(Inf)p Fv(,)f Fr(inf)69 b Fv(In\014nit)o(y)l(.)28 b(This)18 b(is)g(the)g(result)g(of)f(an)h(op)q(eration)f(lik)o(e)i (1/0,)e(or)g(an)g(op)q(eration)h(that)f(results)h(in)g(a)240 1548 y(\015oating)d(p)q(oin)o(t)h(o)o(v)o(er\015o)o(w.)0 1631 y Fr(NaN)p Fv(,)e Fr(nan)69 b Fv(Not)20 b(a)f(n)o(um)o(b)q(er.)35 b(This)21 b(is)g(the)f(result)g(of)g(an)g(op)q(eration)h(lik)o(e)g(`)p Fr(0/0)p Fv(',)f(or)f(`)p Fr(Inf)c(-)g(Inf)p Fv(',)20 b(or)f(an)o(y)240 1693 y(op)q(eration)c(with)h(a)f(NaN.)0 1777 y Fr(SEEK_SET)0 1839 y(SEEK_CUR)0 1901 y(SEEK_END)48 b Fv(These)16 b(v)m(ariables)g(ma)o(y)f(b)q(e)g(used)h(as)f(the)g (optional)h(third)g(argumen)o(t)e(for)h(the)g(function)h Fr(fseek)p Fv(.)0 1984 y Fr(eps)168 b Fv(The)17 b(mac)o(hine)h (precision.)26 b(More)16 b(precisely)l(,)j Fr(eps)d Fv(is)i(the)f (smallest)g(v)m(alue)h(suc)o(h)f(that)f(`)p Fr(1+eps)p Fv(')f(is)240 2047 y(not)i(equal)h(to)f(1.)27 b(This)18 b(n)o(um)o(b)q(er)g(is)g(system-dep)q(enden)o(t.)28 b(On)19 b(mac)o(hines)f(that)f(supp)q(ort)g(64)g(bit)240 2109 y(IEEE)e(\015oating)h(p)q(oin)o(t)f(arithmetic,)h Fr(eps)e Fv(is)i(appro)o(ximately)f(2)p Fo(:)p Fv(2204)9 b Ft(\002)h Fv(10)1539 2092 y Fl(\000)p Fk(16)1600 2109 y Fv(.)0 2192 y Fr(pi)192 b Fv(The)14 b(ratio)f(of)h(the)g(circumference)h(of)e (a)h(circle)h(to)e(its)h(diameter.)20 b(In)o(ternally)l(,)15 b Fr(pi)f Fv(is)g(computed)g(as)240 2254 y(`)p Fr(4.0)g(*)h(atan)g (\(1.0\))p Fv('.)0 2338 y Fr(realmax)72 b Fv(The)18 b(largest)g (\015oating)g(p)q(oin)o(t)g(n)o(um)o(b)q(er)g(that)g(is)g(represen)o (table.)29 b(The)18 b(actual)h(v)m(alue)g(is)f(system-)240 2400 y(dep)q(enden)o(t.)j(On)16 b(mac)o(hines)f(that)f(supp)q(ort)h(64) f(bit)i(IEEE)f(\015oating)g(p)q(oin)o(t)g(arithmetic,)g Fr(realmax)240 2462 y Fv(is)h(appro)o(ximately)f(1)p Fo(:)p Fv(7977)8 b Ft(\002)j Fv(10)813 2446 y Fk(308)864 2462 y Fv(.)0 2545 y Fr(realmin)72 b Fv(The)16 b(smallest)h(\015oating) f(p)q(oin)o(t)g(n)o(um)o(b)q(er)g(that)g(is)g(represen)o(table.)23 b(The)16 b(actual)h(v)m(alue)g(is)f(system-)240 2608 y(dep)q(enden)o(t.)21 b(On)16 b(mac)o(hines)f(that)f(supp)q(ort)h(64)f (bit)i(IEEE)f(\015oating)g(p)q(oin)o(t)g(arithmetic,)g Fr(realmin)240 2670 y Fv(is)h(appro)o(ximately)f(2)p Fo(:)p Fv(2251)8 b Ft(\002)j Fv(10)813 2654 y Fl(\000)p Fk(308)890 2670 y Fv(.)p eop %%Page: 62 64 62 63 bop 0 -58 a Fv(62)1766 b(Octa)o(v)o(e)0 183 y Fr(stdin)0 246 y(stdout)0 308 y(stderr)96 b Fv(These)20 b(v)m(ariables)i(are)e (the)g(\014le)h(n)o(um)o(b)q(ers)f(corresp)q(onding)h(to)f(the)g (standard)f(input,)j(standard)240 370 y(output,)f(and)g(standard)f (error)f(streams.)35 b(These)21 b(streams)e(are)h(preconnected)i(and)e (a)o(v)m(ailable)240 432 y(when)c(Octa)o(v)o(e)e(starts.)0 579 y Fu(6.2)33 b(User)14 b(Preferences)62 686 y Fv(This)i(section)g (describ)q(es)h(the)e(v)m(ariables)h(that)f(y)o(ou)g(can)g(use)h(to)e (customize)i(Octa)o(v)o(e's)e(b)q(eha)o(vior.)62 773 y(Normally)l(,)h(preferences)f(are)f(set)h(in)g(the)g(\014le)h(`)p Fr(~/.octaverc)p Fv(',)c(so)j(that)f(y)o(ou)g(can)h(customize)g(y)o (our)f(en)o(viron-)0 835 y(men)o(t)k(in)h(the)g(same)f(w)o(a)o(y)f(eac) o(h)h(time)h(y)o(ou)f(use)h(Octa)o(v)o(e)f(without)g(ha)o(ving)g(to)g (remem)o(b)q(er)h(and)f(ret)o(yp)q(e)h(all)g(the)0 898 y(necessary)d(commands.)20 b(See)c(Section)g(2.2)e([Startup)h(Files],)g (page)g(20)g(for)f(more)h(information.)0 1000 y Fr(EDITOR)96 b Fv(A)11 b(string)g(naming)g(the)g(editor)h(to)e(use)h(with)h(the)f Fr(edit_history)e Fv(command.)18 b(If)12 b(the)f(en)o(vironmen)o(t)240 1062 y(v)m(ariable)17 b Fr(EDITOR)e Fv(is)h(set)f(when)h(Octa)o(v)o(e)f (starts,)f(its)i(v)m(alue)h(is)f(used)g(as)f(the)h(default.)21 b(Otherwise,)240 1125 y Fr(EDITOR)14 b Fv(is)i(set)f(to)g Fr("vi")p Fv(.)0 1219 y Fr(IMAGEPATH)240 1281 y Fv(A)g(colon)h (separated)f(list)h(of)f(directories)h(in)g(whic)o(h)g(to)e(searc)o(h)h (for)g(image)g(\014les.)21 b(See)16 b(Chapter)f(19)240 1343 y([Image)c(Pro)q(cessing],)h(page)g(115)f(for)g(a)g(description)i (of)f(Octa)o(v)o(e's)f(image)g(pro)q(cessing)i(capabilities.)0 1437 y Fr(INFO_FILE)240 1500 y Fv(A)i(string)g(naming)h(the)f(lo)q (cation)h(of)f(the)g(Octa)o(v)o(e)g(info)h(\014le.)240 1578 y(The)f(default)h(v)m(alue)h(is)e Fr ("/usr/local/info/octave.info")o Fv(.)0 1672 y Fr(LOADPATH)48 b Fv(A)14 b(colon)g(separated)f(list)h(of)f(directories)i(in)f(whic)o (h)g(to)f(searc)o(h)g(for)g(function)i(\014les.)20 b(See)14 b(Chapter)f(5)240 1734 y([F)l(unctions)20 b(and)f(Scripts],)i(page)e (49.)32 b(The)19 b(v)m(alue)i(of)e Fr(LOADPATH)f Fv(o)o(v)o(errides)h (the)h(en)o(vironmen)o(t)240 1797 y(v)m(ariable)d Fr(OCTAVE_PATH)p Fv(.)h(See)e(App)q(endix)h(A)e([Installation],)h(page)f(161.)240 1875 y Fr(LOADPATH)k Fv(is)h(no)o(w)f(handled)i(in)g(the)f(same)f(w)o (a)o(y)g(as)g(T)1217 1885 y(E)1243 1875 y(X)g(handles)i Fr(TEXINPUTS)p Fv(.)32 b(If)20 b(the)g(path)240 1937 y(starts)d(with)i(`)p Fr(:)p Fv(',)f(the)g(standard)g(path)h(is)f(prep) q(ended)j(to)d(the)g(v)m(alue)i(of)e Fr(LOADPATH)p Fv(.)28 b(If)19 b(it)f(ends)240 1999 y(with)e(`)p Fr(:)p Fv(')e(the)h(standard) g(path)g(is)h(app)q(ended)g(to)f(the)g(v)m(alue)i(of)d Fr(LOADPATH)p Fv(.)240 2078 y(In)k(addition,)i(if)e(an)o(y)g(path)f (elemen)o(t)i(ends)f(in)h(`)p Fr(//)p Fv(',)e(that)g(directory)h(and)g (all)h(sub)q(directories)h(it)240 2140 y(con)o(tains)15 b(are)h(searc)o(hed)f(recursiv)o(ely)i(for)e(function)h(\014les.)21 b(This)16 b(can)g(result)f(in)i(a)e(sligh)o(t)g(dela)o(y)h(as)240 2202 y(Octa)o(v)o(e)d(cac)o(hes)h(the)g(lists)g(of)g(\014les)g(found)h (in)f(the)g Fr(LOADPATH)e Fv(the)i(\014rst)g(time)g(Octa)o(v)o(e)f (searc)o(hes)h(for)240 2264 y(a)h(function.)22 b(After)15 b(that,)f(searc)o(hing)i(is)g(usually)h(m)o(uc)o(h)e(faster)g(b)q (ecause)h(Octa)o(v)o(e)f(normally)h(only)240 2327 y(needs)g(to)f(searc) o(h)g(its)g(in)o(ternal)h(cac)o(he)f(for)g(\014les.)240 2405 y(T)l(o)i(impro)o(v)o(e)g(p)q(erformance)g(of)g(recursiv)o(e)h (directory)f(searc)o(hing,)h(it)g(is)f(b)q(est)h(for)e(eac)o(h)i (directory)240 2467 y(that)11 b(is)i(to)f(b)q(e)h(searc)o(hed)f (recursiv)o(ely)i(to)d(con)o(tain)h Fp(either)17 b Fv(additional)c(sub) q(directories)h Fp(or)h Fv(function)240 2530 y(\014les,)h(but)f(not)g (a)g(mixture)g(of)g(b)q(oth.)240 2608 y(See)j(Section)g(5.9)e ([Organization)i(of)e(F)l(unctions],)i(page)f(58)g(for)f(a)h (description)i(of)e(the)g(function)240 2670 y(\014le)f(directories)g (that)f(are)g(distributed)i(with)e(Octa)o(v)o(e.)p eop %%Page: 63 65 63 64 bop 0 -58 a Fv(Chapter)15 b(6:)k(Built-in)f(V)l(ariables)1323 b(63)0 183 y Fr(OCTAVE_VERSION)240 246 y Fv(The)15 b(v)o(ersion)h(n)o (um)o(b)q(er)f(of)g(Octa)o(v)o(e,)g(as)f(a)h(string.)0 336 y Fr(PAGER)120 b Fv(The)17 b(default)g(v)m(alue)h(is)f Fr("less")p Fv(,)e(or,)h(if)h Fr(less)f Fv(is)h(not)g(a)o(v)m(ailable)h (on)e(y)o(our)g(system,)g Fr("more")p Fv(.)23 b(See)240 398 y(App)q(endix)17 b(A)f([Installation],)f(page)g(161,)f(and)h (Chapter)g(20)g([Input)g(and)h(Output],)f(page)g(117.)0 489 y Fr(PS1)168 b Fv(The)12 b(primary)g(prompt)f(string.)19 b(When)12 b(executing)h(in)o(teractiv)o(ely)l(,)g(Octa)o(v)o(e)e (displa)o(ys)i(the)f(primary)240 551 y(prompt)19 b Fr(PS1)h Fv(when)g(it)g(is)g(ready)g(to)f(read)g(a)h(command.)33 b(Octa)o(v)o(e)19 b(allo)o(ws)h(the)g(prompt)f(to)g(b)q(e)240 613 y(customized)24 b(b)o(y)e(inserting)i(a)e(n)o(um)o(b)q(er)h(of)g (bac)o(kslash-escap)q(ed)h(sp)q(ecial)g(c)o(haracters)e(that)g(are)240 675 y(deco)q(ded)17 b(as)d(follo)o(ws:)240 766 y(`)p Fr(\\t)p Fv(')166 b(The)15 b(time.)240 856 y(`)p Fr(\\d)p Fv(')166 b(The)15 b(date.)240 947 y(`)p Fr(\\n)p Fv(')166 b(Begins)17 b(a)f(new)h(line)h(b)o(y)f(prin)o(ting)g(the)g(equiv)m (alen)o(t)h(of)e(a)g(carriage)g(return)h(follo)o(w)o(ed)480 1009 y(b)o(y)e(a)g(line)i(feed.)240 1099 y(`)p Fr(\\s)p Fv(')166 b(The)15 b(name)h(of)e(the)i(program)e(\(usually)i(just)f Fr(octave)p Fv(\).)240 1190 y(`)p Fr(\\w)p Fv(')166 b(The)15 b(curren)o(t)h(w)o(orking)e(directory)l(.)240 1280 y(`)p Fr(\\W)p Fv(')166 b(The)15 b(basename)h(of)f(the)g(curren)o(t)g(w)o (orking)g(directory)l(.)240 1371 y(`)p Fr(\\u)p Fv(')166 b(The)15 b(username)h(of)f(the)g(curren)o(t)g(user.)240 1461 y(`)p Fr(\\h)p Fv(')166 b(The)15 b(hostname.)240 1551 y(`)p Fr(\\#)p Fv(')166 b(The)11 b(command)f(n)o(um)o(b)q(er)h(of) f(this)h(command,)g(coun)o(ting)h(from)d(when)i(Octa)o(v)o(e)g(starts.) 240 1642 y(`)p Fr(\\!)p Fv(')166 b(The)12 b(history)h(n)o(um)o(b)q(er)f (of)g(this)h(command.)18 b(This)13 b(di\013ers)g(from)e(`)p Fr(\\#)p Fv(')g(b)o(y)h(the)h(n)o(um)o(b)q(er)480 1704 y(of)i(commands)g(in)h(the)f(history)g(list)h(when)g(Octa)o(v)o(e)f (starts.)240 1795 y(`)p Fr(\\$)p Fv(')166 b(If)15 b(the)h(e\013ectiv)o (e)f(UID)h(is)f(0,)g(a)g(#,)f(otherwise)i(a)f($.)240 1885 y(`)p Fr(\\nnn)p Fv(')118 b(The)15 b(c)o(haracter)g(whose)g(c)o (haracter)f(co)q(de)i(in)g(o)q(ctal)g(is)f(`)p Fr(nnn)p Fv('.)240 1975 y(`)p Fr(\\\\)p Fv(')166 b(A)15 b(bac)o(kslash.)240 2066 y(The)g(default)h(v)m(alue)h(of)d Fr(PS1)h Fv(is)h Fr("\\s:\\#>)e(")p Fv(.)20 b(T)l(o)15 b(c)o(hange)g(it,)g(use)h(a)e (command)h(lik)o(e)360 2130 y Fr(octave:13>)22 b(PS1)i(=)g ("\\\\u@\\\\h>)e(")240 2206 y Fv(whic)o(h)d(will)h(result)e(in)h(the)g (prompt)e(`)p Fr(boris@kremvax>)c Fv(')18 b(for)f(the)i(user)f(`)p Fr(boris)p Fv(')f(logged)h(in)h(on)240 2268 y(the)c(host)f(`)p Fr(kremvax)p Fv('.)k(Note)c(that)g(t)o(w)o(o)g(bac)o(kslashes)h(are)f (required)i(to)e(en)o(ter)g(a)h(bac)o(kslash)g(in)o(to)f(a)240 2331 y(string.)20 b(See)c(Section)g(3.1.2)d([String)i(Constan)o(ts],)f (page)h(22.)0 2421 y Fr(PS2)168 b Fv(The)20 b(secondary)f(prompt)g (string,)h(whic)o(h)g(is)g(prin)o(ted)g(when)g(Octa)o(v)o(e)f(is)h(exp) q(ecting)h(additional)240 2483 y(input)g(to)e(complete)i(a)f(command.) 34 b(F)l(or)19 b(example,)j(when)f(de\014ning)g(a)f(function)h(o)o(v)o (er)e(sev)o(eral)240 2545 y(lines,)h(Octa)o(v)o(e)e(will)i(prin)o(t)e (the)h(v)m(alue)g(of)f Fr(PS1)g Fv(at)f(the)i(b)q(eginning)h(of)e(eac)o (h)g(line)i(after)d(the)i(\014rst.)240 2608 y(Octa)o(v)o(e)c(allo)o(ws) g Fr(PS2)f Fv(to)h(b)q(e)h(customized)g(in)g(the)f(same)f(w)o(a)o(y)g (as)h Fr(PS1)p Fv(.)20 b(The)15 b(default)g(v)m(alue)i(of)d Fr(PS2)240 2670 y Fv(is)i Fr(">)f(")p Fv(.)p eop %%Page: 64 66 64 65 bop 0 -58 a Fv(64)1766 b(Octa)o(v)o(e)0 183 y Fr (automatic_replot)240 246 y Fv(If)25 b(this)g(v)m(ariable)h(is)f Fr("true")p Fv(,)h(Octa)o(v)o(e)e(will)j(automatically)e(send)g(a)f Fr(replot)g Fv(command)h(to)240 308 y Fr(gnuplot)14 b Fv(eac)o(h)h(time)g(the)g(plot)g(c)o(hanges.)20 b(Since)c(this)f(is)h (fairly)f(ine\016cien)o(t,)h(the)f(default)g(v)m(alue)h(is)240 370 y Fr("false")p Fv(.)0 449 y Fr(whitespace_in_literal_matr)o(ix)240 512 y Fv(This)d(v)m(ariable)g(allo)o(ws)g(some)f(con)o(trol)g(o)o(v)o (er)f(ho)o(w)h(Octa)o(v)o(e)g(decides)i(to)d(con)o(v)o(ert)h(spaces)g (to)g(commas)240 574 y(and)j(semicolons)i(in)f(matrix)f(expressions)h (lik)o(e)g(`)p Fr([m)e(\(1\)])p Fv(')h(or)360 632 y Fr([)24 b(1,)f(2,)408 682 y(3,)g(4)h(])240 753 y Fv(If)15 b(the)g(v)m(alue)i (of)d Fr(whitespace_in_literal_matri)o(x)e Fv(is)k Fr("ignore")p Fv(,)d(Octa)o(v)o(e)i(will)h(nev)o(er)g(insert)240 815 y(a)i(comma)f(or)h(a)f(semicolon)i(in)g(a)f(literal)h(matrix)f(list.)29 b(F)l(or)17 b(example,)i(the)f(expression)h(`)p Fr([1)c(2])p Fv(')240 877 y(will)g(result)f(in)h(an)e(error)g(instead)h(of)f(b)q (eing)i(treated)e(the)h(same)f(as)g(`)p Fr([1,)i(2])p Fv(',)e(and)g(the)h(expression)360 936 y Fr([)24 b(1,)f(2,)408 985 y(3,)g(4)h(])240 1056 y Fv(will)17 b(result)f(in)g(the)f(v)o(ector) f([1)h(2)g(3)g(4])f(instead)i(of)f(a)g(matrix.)240 1127 y(If)d(the)f(v)m(alue)i(of)e Fr(whitespace_in_literal_m)o(atrix)d Fv(is)k Fr("traditional")p Fv(,)e(Octa)o(v)o(e)h(will)i(con)o(v)o(ert) 240 1189 y(spaces)i(to)g(a)g(comma)f(b)q(et)o(w)o(een)i(iden)o (ti\014ers)h(and)e(`)p Fr(\()p Fv('.)k(F)l(or)c(example,)g(giv)o(en)h (the)f(matrix)360 1247 y Fr(m)24 b(=)f([3)h(2])240 1318 y Fv(the)15 b(expression)360 1377 y Fr([m)24 b(\(1\)])240 1447 y Fv(will)17 b(b)q(e)f(parsed)f(as)360 1506 y Fr([m,)23 b(\(1\)])240 1576 y Fv(and)15 b(will)i(result)f(in)360 1635 y Fr([3)24 b(2)f(1])240 1705 y Fv(and)15 b(the)h(expression)360 1764 y Fr([)24 b(1,)f(2,)408 1814 y(3,)g(4)h(])240 1884 y Fv(will)17 b(result)g(in)f(a)g(matrix)f(b)q(ecause)i(the)e(newline)j (c)o(haracter)d(is)h(con)o(v)o(erted)g(to)f(a)g(semicolon)i(\(ro)o(w) 240 1947 y(separator\))e(ev)o(en)h(though)g(there)g(is)g(a)g(comma)g (at)f(the)h(end)h(of)e(the)i(\014rst)e(line)j(\(trailing)f(commas)240 2009 y(or)e(semicolons)h(are)f(ignored\).)20 b(This)c(is)f(apparen)o (tly)h(ho)o(w)f Fq(Ma)m(tlab)g Fv(b)q(eha)o(v)o(es.)240 2080 y(An)o(y)k(other)f(v)m(alue)h(for)f Fr (whitespace_in_literal_matrix)d Fv(results)k(in)g(b)q(eha)o(vior)g (that)f(is)h(the)240 2142 y(same)d(as)g(traditional,)h(except)g(that)e (Octa)o(v)o(e)h(do)q(es)h(not)f(con)o(v)o(ert)g(spaces)g(to)g(a)g (comma)g(b)q(et)o(w)o(een)240 2204 y(iden)o(ti\014ers)h(and)e(`)p Fr(\()p Fv('.)k(F)l(or)c(example,)g(the)h(expression)360 2262 y Fr([m)24 b(\(1\)])240 2333 y Fv(will)17 b(pro)q(duce)f(`)p Fr(3)p Fv('.)j(This)d(is)f(the)h(w)o(a)o(y)e(Octa)o(v)o(e)h(has)g(alw)o (a)o(ys)f(b)q(eha)o(v)o(ed.)0 2412 y Fr(default_save_format)0 2483 y(do_fortran_indexing)240 2545 y Fv(If)i(the)g(v)m(alue)h(of)e Fr(do_fortran_indexing)f Fv(is)i Fr("true")p Fv(,)f(Octa)o(v)o(e)g (allo)o(ws)h(y)o(ou)g(to)f(select)h(elemen)o(ts)240 2608 y(of)j(a)h(t)o(w)o(o-dimensional)h(matrix)e(using)i(a)e(single)i(index) g(b)o(y)f(treating)f(the)h(matrix)g(as)f(a)h(single)240 2670 y(v)o(ector)14 b(created)i(from)e(the)h(columns)h(of)f(the)h (matrix.)j(The)c(default)h(v)m(alue)h(is)e Fr("false")p Fv(.)p eop %%Page: 65 67 65 66 bop 0 -58 a Fv(Chapter)15 b(6:)k(Built-in)f(V)l(ariables)1323 b(65)0 183 y Fr(empty_list_elements_ok)240 246 y Fv(This)16 b(v)m(ariable)g(con)o(trols)f(whether)h(Octa)o(v)o(e)e(ignores)i(empt)o (y)f(matrices)g(in)h(a)f(matrix)g(list.)240 319 y(F)l(or)i(example,)i (if)g(the)f(v)m(alue)h(of)f Fr(empty_list_elements_ok)d Fv(is)j Fr("true")p Fv(,)f(Octa)o(v)o(e)h(will)i(ignore)240 382 y(the)15 b(empt)o(y)g(matrices)g(in)h(the)g(expression)360 443 y Fr(a)24 b(=)f([1,)h([],)f(3,)h([],)f(5])240 517 y Fv(and)15 b(the)h(v)m(ariable)g(`)p Fr(a)p Fv(')f(will)h(b)q(e)g (assigned)g(the)f(v)m(alue)i(`)p Fr([)d(1)h(3)g(5)g(])p Fv('.)240 590 y(The)g(default)h(v)m(alue)h(is)e Fr("warn")p Fv(.)0 676 y Fr(gnuplot_binary)240 738 y Fv(The)26 b(name)h(of)e(the)h (program)f(in)o(v)o(ok)o(ed)i(b)o(y)f(the)g(plot)g(command.)53 b(The)26 b(default)h(v)m(alue)g(is)240 800 y Fr("gnuplot")p Fv(.)19 b(See)c(App)q(endix)j(A)d([Installation],)g(page)g(161.)0 885 y Fr(ignore_function_time_stamp)240 948 y Fv(This)22 b(v)m(ariable)h(v)m(ariable)f(can)g(b)q(e)g(used)g(to)e(prev)o(en)o(t)i (Octa)o(v)o(e)e(from)h(making)h(the)f(system)g(call)240 1010 y Fr(stat\(\))14 b Fv(eac)o(h)h(time)h(it)f(lo)q(oks)g(up)h (functions)g(de\014ned)g(in)g(function)g(\014les.)21 b(If)15 b Fr(ignore_function_)240 1072 y(time_stamp)20 b Fv(to)h Fr("system")p Fv(,)g(Octa)o(v)o(e)g(will)j(not)d (automatically)g(recompile)i(function)g(\014les)f(in)240 1134 y(sub)q(directories)h(of)e Fr(/usr/local/lib/1.1.0)e Fv(if)j(they)f(ha)o(v)o(e)g(c)o(hanged)h(since)g(they)g(w)o(ere)f(last) 240 1197 y(compiled,)h(but)d(will)i(recompile)g(other)e(function)i (\014les)f(in)g(the)g Fr(LOADPATH)e Fv(if)i(they)f(c)o(hange.)33 b(If)240 1259 y(set)17 b(to)h Fr("all")p Fv(,)f(Octa)o(v)o(e)g(will)j (not)d(recompile)i(an)o(y)e(function)i(\014les)g(unless)g(their)f (de\014nitions)h(are)240 1321 y(remo)o(v)o(ed)f(with)g Fr(clear)p Fv(.)28 b(F)l(or)17 b(an)o(y)h(other)g(v)m(alue)h(of)f Fr(ignore_function_time_st)o(amp)p Fv(,)d(Octa)o(v)o(e)240 1384 y(will)j(alw)o(a)o(ys)e(c)o(hec)o(k)h(to)f(see)h(if)g(functions)h (de\014ned)g(in)f(function)h(\014les)f(need)h(to)e(recompiled.)26 b(The)240 1446 y(default)16 b(v)m(alue)g(of)f Fr (ignore_function_time_stamp)d Fv(is)j Fr("system")p Fv(.)0 1531 y Fr(implicit_str_to_num_ok)240 1593 y Fv(If)i(the)f(v)m(alue)i (of)e Fr(implicit_str_to_num_ok)e Fv(is)j Fr("true")p Fv(,)e(implicit)k(con)o(v)o(ersions)e(of)f(strings)h(to)240 1656 y(their)h(n)o(umeric)h(ASCI)q(I)g(equiv)m(alen)o(ts)g(are)e(allo)o (w)o(ed.)28 b(Otherwise,)18 b(an)g(error)f(message)g(is)h(prin)o(ted) 240 1718 y(and)d(con)o(trol)g(is)h(returned)g(to)e(the)h(top)g(lev)o (el.)21 b(The)16 b(default)g(v)m(alue)g(is)g Fr("false")p Fv(.)0 1803 y Fr(ok_to_lose_imaginary_part)240 1865 y Fv(If)c(the)g(v)m(alue)h(of)f Fr(ok_to_lose_imaginary_part)c Fv(is)13 b Fr("true")p Fv(,)e(implicit)k(con)o(v)o(ersions)d(of)f (complex)240 1928 y(n)o(um)o(b)q(ers)17 b(to)e(real)i(n)o(um)o(b)q(ers) f(are)g(allo)o(w)o(ed)h(\(for)e(example,)i(b)o(y)f(fsolv)o(e\).)23 b(If)17 b(the)f(v)m(alue)h(is)g Fr("warn")p Fv(,)240 1990 y(the)j(con)o(v)o(ersion)f(is)h(allo)o(w)o(ed,)h(but)f(a)f(w)o (arning)g(is)h(prin)o(ted.)34 b(Otherwise,)21 b(an)f(error)e(message)h (is)240 2052 y(prin)o(ted)d(and)f(con)o(trol)g(is)h(returned)g(to)e (the)h(top)g(lev)o(el.)21 b(The)16 b(default)g(v)m(alue)g(is)g Fr("warn")p Fv(.)0 2137 y Fr(output_max_field_width)240 2200 y Fv(This)d(v)m(ariable)h(sp)q(eci\014es)g(the)e(maxim)o(um)g (width)h(of)f(a)g(n)o(umeric)h(output)f(\014eld.)20 b(The)13 b(default)g(v)m(alue)240 2262 y(is)j(10.)240 2336 y(It)22 b(is)h(p)q(ossible)h(to)d(ac)o(hiev)o(e)i(a)f(wide)h(range)f(of)g (output)f(st)o(yles)i(b)o(y)f(using)h(di\013eren)o(t)f(v)m(alues)h(of) 240 2398 y Fr(output_precision)16 b Fv(and)i Fr(output_max_field_width) p Fv(.)25 b(Reasonable)19 b(com)o(binations)f(can)g(b)q(e)240 2460 y(set)d(using)h(the)f Fr(format)g Fv(function.)20 b(See)c(Section)g(20.1)e([Basic)i(Input)g(and)f(Output],)g(page)g(117.) 0 2545 y Fr(output_precision)240 2608 y Fv(This)e(v)m(ariable)g(sp)q (eci\014es)h(the)e(minim)o(um)h(n)o(um)o(b)q(er)g(of)f(signi\014can)o (t)h(\014gures)f(to)f(displa)o(y)j(for)d(n)o(umeric)240 2670 y(output.)20 b(The)15 b(default)h(v)m(alue)g(is)g(5.)p eop %%Page: 66 68 66 67 bop 0 -58 a Fv(66)1766 b(Octa)o(v)o(e)240 183 y(It)22 b(is)h(p)q(ossible)h(to)d(ac)o(hiev)o(e)i(a)f(wide)h(range)f(of)g (output)f(st)o(yles)i(b)o(y)f(using)h(di\013eren)o(t)f(v)m(alues)h(of) 240 246 y Fr(output_precision)16 b Fv(and)i Fr(output_max_field_width)p Fv(.)25 b(Reasonable)19 b(com)o(binations)f(can)g(b)q(e)240 308 y(set)d(using)h(the)f Fr(format)g Fv(function.)20 b(See)c(Section)g(20.1)e([Basic)i(Input)g(and)f(Output],)g(page)g(117.) 0 395 y Fr(page_screen_output)240 457 y Fv(If)g(the)f(v)m(alue)i(of)e Fr(page_screen_output)e Fv(is)j Fr("true")p Fv(,)e(all)i(output)g(in)o (tended)g(for)f(the)h(screen)g(that)240 519 y(is)h(longer)f(than)g(one) g(page)g(is)h(sen)o(t)f(through)f(a)h(pager.)20 b(This)15 b(allo)o(ws)h(y)o(ou)e(to)h(view)g(one)h(screenful)240 581 y(at)h(a)g(time.)28 b(Some)18 b(pagers)f(\(suc)o(h)g(as)h Fr(less)p Fv(|see)f(App)q(endix)j(A)e([Installation],)g(page)g(161\))e (are)240 644 y(also)k(capable)h(of)e(mo)o(ving)h(bac)o(kw)o(ard)f(on)h (the)g(output.)34 b(The)21 b(default)f(v)m(alue)h(is)g Fr("true")p Fv(.)33 b(See)240 706 y(Chapter)15 b(20)g([Input)g(and)h (Output],)e(page)h(117.)240 780 y(Y)l(ou)g(can)h(c)o(ho)q(ose)f(the)g (program)f(to)h(use)g(as)g(the)g(pager)g(b)o(y)g(setting)h(the)f(v)m (ariable)i Fr(PAGER)p Fv(.)0 867 y Fr(prefer_column_vectors)240 929 y Fv(If)e Fr(prefer_column_vectors)e Fv(is)i Fr("true")p Fv(,)f(op)q(erations)i(lik)o(e)360 992 y Fr(for)23 b(i)h(=)g(1:10)408 1041 y(a)f(\(i\))h(=)g(i;)360 1091 y(endfor)240 1166 y Fv(\(for)d(`)p Fr(a)p Fv(')g(previously)i(unde\014ned\))h(pro)q(duce) e(column)h(v)o(ectors.)39 b(Otherwise,)24 b(ro)o(w)d(v)o(ectors)g(are) 240 1228 y(preferred.)f(The)c(default)f(v)m(alue)i(is)f Fr("false")p Fv(.)240 1302 y(If)c(a)f(v)m(ariable)i(is)f(already)g (de\014ned)h(to)e(b)q(e)h(a)f(v)o(ector)g(\(a)g(matrix)g(with)h(a)f (single)i(ro)o(w)d(or)h(column\),)i(the)240 1365 y(original)j(orien)o (tation)f(is)h(resp)q(ected,)g(regardless)f(of)g(the)g(v)m(alue)i(of)e Fr(prefer_column_vectors)p Fv(.)0 1452 y Fr(prefer_zero_one_indexing) 240 1514 y Fv(If)k(the)g(v)m(alue)h(of)f Fr(prefer_zero_one_indexin)o (g)d Fv(is)k Fr("true")p Fv(,)e(Octa)o(v)o(e)h(will)h(p)q(erform)f (zero-one)240 1576 y(st)o(yle)c(indexing)i(when)f(there)f(is)h(a)f (con\015ict)h(with)f(the)g(normal)g(indexing)j(rules.)i(See)c(Section)g (3.5)240 1638 y([Index)g(Expressions],)f(page)g(26.)k(F)l(or)c (example,)g(giv)o(en)h(a)f(matrix)360 1700 y Fr(a)24 b(=)f([1,)h(2,)f(3,)h(4])240 1775 y Fv(with)16 b Fr (prefer_zero_one_indexin)o(g)c Fv(is)k(set)f(to)g Fr("true")p Fv(,)f(the)h(expression)360 1837 y Fr(a)24 b(\([1,)f(1,)h(1,)f(1]\))240 1912 y Fv(results)17 b(in)g(the)g(matrix)f(`)p Fr([)f(1)g(2)g(3)g(4)g (])p Fv('.)23 b(If)17 b(the)f(v)m(alue)i(of)e Fr (prefer_zero_one_indexing)d Fv(set)k(to)240 1974 y Fr("false")p Fv(,)d(the)h(result)h(w)o(ould)f(b)q(e)h(the)f(matrix)g(`)p Fr([)g(1)g(1)g(1)g(1)g(])p Fv('.)240 2048 y(In)j(the)f(\014rst)g(case,) g(Octa)o(v)o(e)g(is)h(selecting)g(eac)o(h)g(elemen)o(t)g(corresp)q (onding)g(to)e(a)h(`)p Fr(1)p Fv(')f(in)i(the)g(index)240 2111 y(v)o(ector.)h(In)d(the)f(second,)h(Octa)o(v)o(e)e(is)i(selecting) h(the)e(\014rst)g(elemen)o(t)h(m)o(ultiple)h(times.)240 2185 y(The)e(default)h(v)m(alue)h(for)d Fr(prefer_zero_one_indexing)e Fv(is)k Fr("false")p Fv(.)0 2272 y Fr(print_answer_id_name)240 2334 y Fv(If)21 b(the)f(v)m(alue)i(of)e Fr(print_answer_id_name)d Fv(is)k Fr("true")p Fv(,)g(v)m(ariable)g(names)g(are)f(prin)o(ted)h (along)240 2396 y(with)f(the)f(result.)33 b(Otherwise,)20 b(only)g(the)g(result)f(v)m(alues)i(are)e(prin)o(ted.)33 b(The)19 b(default)h(v)m(alue)g(is)240 2459 y Fr("true")p Fv(.)0 2545 y Fr(print_empty_dimensions)240 2608 y Fv(If)15 b(the)f(v)m(alue)i(of)e Fr(print_empty_dimensions)d Fv(is)k Fr("true")p Fv(,)e(the)i(dimensions)h(of)e(empt)o(y)g(matrices)240 2670 y(are)h(prin)o(ted)h(along)f(with)h(the)f(empt)o(y)g(matrix)g(sym) o(b)q(ol,)g(`)p Fr([])p Fv('.)k(F)l(or)14 b(example,)i(the)f (expression)p eop %%Page: 67 69 67 68 bop 0 -58 a Fv(Chapter)15 b(6:)k(Built-in)f(V)l(ariables)1323 b(67)360 183 y Fr(zeros)23 b(\(3,)h(0\))240 260 y Fv(will)17 b(prin)o(t)360 324 y Fr(ans)23 b(=)360 423 y([]\(3x0\))0 514 y(propagate_empty_matrices)240 576 y Fv(If)15 b(the)f(v)m(alue)i (of)e Fr(propagate_empty_matrice)o(s)e Fv(is)j Fr("true")p Fv(,)e(functions)i(lik)o(e)g Fr(inverse)f Fv(and)g Fr(svd)240 639 y Fv(will)k(return)f(an)g(empt)o(y)f(matrix)g(if)h(they)g(are)f (giv)o(en)h(one)g(as)g(an)f(argumen)o(t.)24 b(The)16 b(default)i(v)m(alue)240 701 y(is)e Fr("true")p Fv(.)j(See)d(Section)g (3.2.1)d([Empt)o(y)h(Matrices],)h(page)g(24.)0 792 y Fr(resize_on_range_error)240 854 y Fv(If)g(the)h(v)m(alue)g(of)f Fr(resize_on_range_error)d Fv(is)k Fr("true")p Fv(,)e(expressions)i (lik)o(e)360 918 y Fr(for)23 b(i)h(=)g(1:10)408 968 y(a)f(\(i\))h(=)g (i;)360 1017 y(endfor)240 1094 y Fv(\(for)18 b(`)p Fr(a)p Fv(')f(previously)j(unde\014ned\))h(result)e(in)g(the)g(v)m(ariable)h (`)p Fr(a)p Fv(')e(b)q(eing)h(resized)h(to)e(b)q(e)i(just)e(large)240 1156 y(enough)e(to)f(hold)h(the)f(new)h(v)m(alue.)22 b(Otherwise)16 b(uninitializ)q(ed)i(elemen)o(ts)f(are)e(set)g(to)g (zero.)20 b(If)c(the)240 1219 y(v)m(alue)h(of)e Fr (resize_on_range_error)e Fv(is)j Fr("false")p Fv(,)e(an)i(error)f (message)g(is)h(prin)o(ted)g(and)g(con)o(trol)240 1281 y(is)g(returned)f(to)g(the)g(top)g(lev)o(el.)21 b(The)16 b(default)f(v)m(alue)i(is)f Fr("true")p Fv(.)0 1371 y Fr(return_last_computed_value)240 1434 y Fv(If)h(the)g(v)m(alue)g(of)f Fr(return_last_computed_value)d Fv(is)18 b(true,)e(and)h(a)f(function)h (is)h(de\014ned)f(with-)240 1496 y(out)g(explicitly)k(sp)q(ecifying)e (a)f(return)g(v)m(alue,)h(the)f(function)g(will)i(return)d(the)h(v)m (alue)h(of)e(the)h(last)240 1558 y(expression.)j(Otherwise,)15 b(no)h(v)m(alue)g(will)h(b)q(e)f(returned.)k(The)15 b(default)h(v)m (alue)h(is)e Fr("false")p Fv(.)240 1635 y(F)l(or)g(example,)g(the)h (function)360 1699 y Fr(function)23 b(f)g(\(\))408 1749 y(2)g(+)h(2;)360 1798 y(endfunction)240 1875 y Fv(will)c(either)e (return)g(nothing,)h(if)f Fr(return_last_computed_value)d Fv(is)j Fr("false")p Fv(,)f(or)h(4,)g(if)g(it)g(is)240 1937 y Fr("true")p Fv(.)0 2028 y Fr(save_precision)240 2090 y Fv(This)h(v)m(ariable)g(sp)q(eci\014es)h(the)f(n)o(um)o(b)q(er)f (of)g(digits)h(to)f(k)o(eep)g(when)h(sa)o(ving)f(data)g(with)g(the)h Fr(save)240 2152 y Fv(command.)h(The)15 b(default)h(v)m(alue)g(is)g (17.)0 2243 y Fr(silent_functions)240 2305 y Fv(If)i(the)g(v)m(alue)h (of)e Fr(silent_functions)f Fv(is)i Fr("true")p Fv(,)f(in)o(ternal)i (output)e(from)g(a)h(function)g(is)g(sup-)240 2368 y(pressed.)i (Otherwise,)c(the)e(results)i(of)e(expressions)i(within)g(a)e(function) i(b)q(o)q(dy)f(that)f(are)h(not)f(ter-)240 2430 y(minated)h(with)f(a)g (semicolon)h(will)g(ha)o(v)o(e)f(their)g(v)m(alues)i(prin)o(ted.)k(The) 14 b(default)h(v)m(alue)g(is)f Fr("false")p Fv(.)240 2506 y(F)l(or)h(example,)g(if)h(the)f(function)360 2570 y Fr(function)23 b(f)g(\(\))408 2620 y(2)g(+)h(2)360 2670 y(endfunction)p eop %%Page: 68 70 68 69 bop 0 -58 a Fv(68)1766 b(Octa)o(v)o(e)240 183 y(is)20 b(executed,)h(Octa)o(v)o(e)e(will)i(either)g(prin)o(t)f(`)p Fr(ans)14 b(=)h(4)p Fv(')k(or)g(nothing)h(dep)q(ending)i(on)d(the)h(v)m (alue)g(of)240 246 y Fr(silent_functions)p Fv(.)0 334 y Fr(split_long_rows)240 396 y Fv(F)l(or)c(large)h(matrices,)f(Octa)o (v)o(e)h(ma)o(y)f(not)g(b)q(e)h(able)h(to)e(displa)o(y)h(all)h(the)f (columns)g(of)f(a)h(giv)o(en)g(ro)o(w)240 458 y(on)i(one)f(line)j(of)d (y)o(our)g(screen.)31 b(This)19 b(can)g(result)g(in)h(missing)f (information)g(or)f(output)g(that)g(is)240 521 y(nearly)d(imp)q (ossible)h(to)d(decipher,)j(dep)q(ending)g(on)e(whether)g(y)o(our)g (terminal)g(truncates)g(or)f(wraps)240 583 y(long)i(lines.)240 658 y(If)h(the)g(v)m(alue)h(of)f Fr(split_long_rows)e Fv(is)i Fr("true")p Fv(,)f(Octa)o(v)o(e)h(will)h(displa)o(y)g(the)f (matrix)g(in)h(a)e(series)240 720 y(of)g(smaller)h(pieces,)h(eac)o(h)e (of)g(whic)o(h)h(can)g(\014t)f(within)i(the)e(limits)i(of)e(y)o(our)g (terminal)h(width.)21 b(Eac)o(h)240 783 y(set)f(of)g(ro)o(ws)f(is)h (lab)q(eled)j(so)c(that)h(y)o(ou)f(can)i(easily)g(see)f(whic)o(h)h (columns)g(are)f(curren)o(tly)h(b)q(eing)240 845 y(displa)o(y)o(ed.)g (F)l(or)15 b(example:)360 908 y Fr(octave:13>)22 b(rand)i(\(2,)f(9\)) 360 957 y(ans)g(=)384 1057 y(Columns)g(1)g(through)g(7:)432 1157 y(0.92205)46 b(0.72628)h(0.99841)g(0.62590)g(0.82422)f(0.77486)h (0.30258)432 1207 y(0.15999)f(0.79484)h(0.75443)g(0.86995)g(0.91430)f (0.23980)h(0.64591)384 1306 y(Columns)23 b(8)g(and)h(9:)408 1406 y(0.08894)46 b(0.13266)408 1456 y(0.28008)g(0.65575)240 1531 y Fv(The)15 b(default)h(v)m(alue)h(of)d Fr(split_long_rows)g Fv(is)h Fr("true")p Fv(.)0 1619 y Fr(treat_neg_dim_as_zero)240 1681 y Fv(If)g(the)h(v)m(alue)g(of)f Fr(treat_neg_dim_as_zero)d Fv(is)k Fr("true")p Fv(,)e(expressions)i(lik)o(e)360 1744 y Fr(eye)23 b(\(-1\))240 1819 y Fv(pro)q(duce)18 b(an)g(empt)o(y)f(matrix)g(\(i.e.,)g(ro)o(w)g(and)h(column)g (dimensions)h(are)e(zero\).)27 b(Otherwise,)18 b(an)240 1882 y(error)e(message)f(is)i(prin)o(ted)g(and)g(con)o(trol)f(is)g (returned)h(to)f(the)g(top)g(lev)o(el.)25 b(The)16 b(default)h(v)m (alue)g(is)240 1944 y Fr("false")p Fv(.)0 2032 y Fr (warn_assign_as_truth_value)240 2094 y Fv(If)e(the)g(v)m(alue)g(of)g Fr(warn_assign_as_truth_v)o(alue)c Fv(is)16 b Fr("true")p Fv(,)d(a)h(w)o(arning)h(is)g(issued)h(for)e(state-)240 2157 y(men)o(ts)h(lik)o(e)360 2220 y Fr(if)24 b(\(s)f(=)h(t\))408 2269 y(...)240 2345 y Fv(since)16 b(suc)o(h)g(statemen)o(ts)e(are)h (not)g(common,)f(and)h(it)h(is)g(lik)o(ely)h(that)d(the)h(in)o(ten)o(t) h(w)o(as)e(to)h(write)360 2407 y Fr(if)24 b(\(s)f(==)h(t\))408 2457 y(...)240 2532 y Fv(instead.)240 2608 y(There)18 b(are)f(times)g(when)h(it)g(is)g(useful)g(to)f(write)h(co)q(de)g(that)e (con)o(tains)i(assignmen)o(ts)f(within)i(the)240 2670 y(condition)d(of)f(a)g Fr(while)g Fv(or)f Fr(if)h Fv(statemen)o(t.)k(F) l(or)c(example,)g(statemen)o(ts)f(lik)o(e)p eop %%Page: 69 71 69 70 bop 0 -58 a Fv(Chapter)15 b(6:)k(Built-in)f(V)l(ariables)1323 b(69)360 183 y Fr(while)23 b(\(c)h(=)f(getc\(\)\))408 233 y(...)240 308 y Fv(are)15 b(common)g(in)h(C)f(programming.)240 383 y(It)f(is)g(p)q(ossible)i(to)d(a)o(v)o(oid)g(all)i(w)o(arnings)e (ab)q(out)h(suc)o(h)g(statemen)o(ts)f(b)o(y)g(setting)h Fr(warn_assign_as_)240 445 y(truth_value)g Fv(to)g Fr("false")p Fv(,)g(but)h(that)g(ma)o(y)f(also)h(let)h(real)g(errors)e(lik)o(e)360 507 y Fr(if)24 b(\(x)f(=)h(1\))47 b(#)24 b(intended)f(to)g(test)h(\(x)f (==)h(1\)!)408 557 y(...)240 632 y Fv(slip)17 b(b)o(y)l(.)240 707 y(In)d(suc)o(h)f(cases,)g(it)g(is)g(p)q(ossible)i(suppress)e (errors)g(for)f(sp)q(eci\014c)j(statemen)o(ts)c(b)o(y)i(writing)h(them) f(with)240 769 y(an)i(extra)g(set)g(of)f(paren)o(theses.)20 b(F)l(or)15 b(example,)h(writing)f(the)h(previous)g(example)g(as)360 832 y Fr(while)23 b(\(\(c)h(=)f(getc\(\)\)\))408 882 y(...)240 956 y Fv(will)17 b(prev)o(en)o(t)f(the)g(w)o(arning)f(from)g (b)q(eing)i(prin)o(ted)f(for)f(this)h(statemen)o(t,)f(while)i(allo)o (wing)f(Octa)o(v)o(e)240 1019 y(to)f(w)o(arn)f(ab)q(out)h(other)g (assignmen)o(ts)g(used)h(in)g(conditional)h(con)o(texts.)240 1094 y(The)e(default)h(v)m(alue)h(of)d Fr(warn_assign_as_truth_value)e Fv(is)k Fr("true")p Fv(.)0 1181 y Fr(warn_comma_in_global_decl)240 1243 y Fv(If)h(the)f(v)m(alue)i(of)e Fr(warn_comma_in_global_decl)d Fv(is)18 b Fr("true")p Fv(,)d(a)h(w)o(arning)h(is)g(issued)h(for)e (state-)240 1306 y(men)o(ts)f(lik)o(e)360 1368 y Fr(global)23 b(a)h(=)f(1,)h(b)240 1443 y Fv(whic)o(h)15 b(mak)o(es)f(the)g(v)m (ariables)i(`)p Fr(a)p Fv(')d(and)i(`)p Fr(b)p Fv(')e(global)i(and)f (assigns)h(the)f(v)m(alue)i(1)e(to)f(the)i(v)m(ariable)g(`)p Fr(a)p Fv(',)240 1505 y(b)q(ecause)h(in)g(this)g(con)o(text,)e(the)h (comma)g(is)h(not)e(in)o(terpreted)i(as)f(a)g(statemen)o(t)f (separator.)240 1580 y(The)h(default)h(v)m(alue)h(of)d Fr(warn_comma_in_global_decl)e Fv(is)k Fr("true")p Fv(.)0 1667 y Fr(warn_divide_by_zero)240 1730 y Fv(If)22 b(the)h(v)m(alue)g (of)f Fr(warn_divide_by_zero)d Fv(is)k Fr("true")p Fv(,)f(a)g(w)o (arning)g(is)h(issued)g(when)f(Octa)o(v)o(e)240 1792 y(encoun)o(ters)c(a)g(division)j(b)o(y)d(zero.)29 b(If)19 b(the)f(v)m(alue)i(is)e Fr("false")p Fv(,)g(the)g(w)o(arning)h(is)g (omitted.)29 b(The)240 1854 y(default)16 b(v)m(alue)g(is)g Fr("true")p Fv(.)0 1988 y Fu(6.3)33 b(Other)15 b(Built-in)j(V)-6 b(ariables)62 2092 y Fv(In)20 b(addition)g(to)e(these)h(v)m(ariables,)i (there)e(are)g(t)o(w)o(o)e(other)i(sp)q(ecial)i(built-in)g(v)m (ariables)f(whose)f(v)m(alues)h(are)0 2154 y(automatically)c(up)q (dated.)0 2250 y Fr(ans)168 b Fv(This)15 b(v)m(ariable)h(holds)f(the)f (most)g(recen)o(tly)h(computed)g(result)g(that)f(w)o(as)f(not)h (explicitly)j(assigned)240 2312 y(to)e(a)f(v)m(ariable.)22 b(F)l(or)14 b(example,)i(after)e(the)i(expression)360 2374 y Fr(3^2)23 b(+)h(4^2)240 2449 y Fv(is)16 b(ev)m(aluated,)g(the)f (v)m(alue)h(of)f Fr(ans)g Fv(is)h(`)p Fr(25)p Fv('.)0 2537 y Fr(PWD)168 b Fv(The)21 b(curren)o(t)f(w)o(orking)g(directory)l (.)36 b(The)21 b(v)m(alue)h(of)e Fr(PWD)g Fv(is)h(up)q(dated)g(eac)o(h) g(time)g(the)f(curren)o(t)240 2599 y(w)o(orking)11 b(directory)h(is)f (c)o(hanged)h(with)g(the)f(`)p Fr(cd)p Fv(')g(command.)18 b(See)12 b(Chapter)f(24)g([System)g(Utilities],)240 2661 y(page)k(145.)p eop %%Page: 70 72 70 71 bop 0 -58 a Fv(70)1766 b(Octa)o(v)o(e)0 183 y Fu(6.4)33 b(Summ)o(ary)13 b(of)h(Preference)h(V)-6 b(ariables)62 287 y Fv(Here)11 b(is)g(a)f(summary)g(of)g(all)i(of)e(Octa)o(v)o(e's)g (preference)h(v)m(ariables)h(and)f(their)g(default)g(v)m(alues.)19 b(In)12 b(the)e(follo)o(wing)0 349 y(table)15 b Fr(OCTAVE_HOME)d Fv(stands)i(for)g(the)g(ro)q(ot)g(directory)g(where)h(Octa)o(v)o(e)e (is)i(installed,)h(and)e Fr(VERSION)g Fv(stands)g(for)0 412 y(the)h(Octa)o(v)o(e)g(v)o(ersion)g(n)o(um)o(b)q(er.)120 482 y Fr(EDITOR)548 b(EDITOR)23 b(environment)f(variable,)h(or)h("vi") 120 532 y(INFO_FILE)476 b("OCTAVE_HOME/info/octave.i)o(nfo")120 582 y(LOADPATH)500 b(OCTAVE_PATH)22 b(environment)h(variable,)f(or)812 632 y(".:OCTAVE_HOME/lib/VERSION)o(")120 681 y(PAGER)572 b("less",)23 b(or)h("more")120 731 y(PS1)620 b("\\s:\\#>)23 b(")120 781 y(PS2)620 b(">)24 b(")120 831 y(automatic_replot)308 b("false")120 881 y(whitespace_in_literal_matr)o(ix)21 b("")120 930 y(do_fortran_indexing)236 b("false")120 980 y(empty_list_elements_ok)164 b("warn")120 1030 y(gnuplot_binary)356 b("gnuplot")120 1080 y(ignore_function_time_stamp)68 b("system")120 1130 y(implicit_str_to_num_ok)164 b("false")120 1180 y(ok_to_lose_imaginary_part)92 b("warn")120 1229 y(output_max_field_width)164 b(10)120 1279 y(output_precision)308 b(5)120 1329 y(page_screen_output)260 b("true")120 1379 y(prefer_column_vectors)188 b("false")120 1429 y (prefer_zero_one_indexing)116 b("false")120 1478 y (print_answer_id_name)212 b("true")120 1528 y(print_empty_dimensions) 164 b("true")120 1578 y(resize_on_range_error)188 b("true")120 1628 y(return_last_computed_value)68 b("false")120 1678 y(save_precision)356 b(17)120 1727 y(silent_functions)308 b("false")120 1777 y(split_long_rows)332 b("true")120 1827 y(treat_neg_dim_as_zero)188 b("false")120 1877 y (warn_assign_as_truth_value)68 b("true")120 1927 y (warn_comma_in_global_decl)92 b("true")120 1977 y(warn_divide_by_zero) 236 b("true")p eop %%Page: 71 73 71 72 bop 0 -58 a Fv(Chapter)15 b(7:)k(Arithmetic)1458 b(71)0 183 y Fs(7)41 b(Arithmetic)62 310 y Fv(Unless)22 b(otherwise)e(noted,)i(all)f(of)f(the)h(functions)g(describ)q(ed)h(in)g (this)e(c)o(hapter)h(will)h(w)o(ork)d(for)h(real)h(and)0 372 y(complex)16 b(scalar)f(or)g(matrix)g(argumen)o(ts.)0 502 y Fu(7.1)33 b(Utilit)n(y)17 b(F)-6 b(unctions)62 606 y Fv(The)15 b(follo)o(wing)h(functions)f(are)g(a)o(v)m(ailable)h (for)f(w)o(orking)f(with)h(complex)h(n)o(um)o(b)q(ers.)k(Eac)o(h)15 b(exp)q(ects)g(a)g(single)0 668 y(argumen)o(t,)f(and)h(giv)o(en)h(a)f (matrix,)f(they)i(w)o(ork)e(on)h(an)g(elemen)o(t)h(b)o(y)f(elemen)o(t)h (basis.)0 762 y Fr(ceil)f(\()p Fp(x)s Fr(\))54 b Fv(Return)17 b(the)f(smallest)h(in)o(teger)g(not)f(less)h(than)f Fp(x)p Fv(.)23 b(If)17 b Fp(x)i Fv(is)e(complex,)g(return)f Fr(ceil)f(\(real)f(\()p Fp(x)s Fr(\)\))240 824 y(+)h(ceil)g(\(imag)f (\()p Fp(x)s Fr(\)\))h(*)g(I)p Fv(.)0 908 y Fr(floor)f(\()p Fp(x)s Fr(\))31 b Fv(Return)20 b(the)g(largest)f(in)o(teger)g(not)g (greater)g(than)g Fp(x)p Fv(.)33 b(If)19 b Fp(x)k Fv(is)d(complex,)h (return)e Fr(floor)c(\(real)240 970 y(\()p Fp(x)s Fr(\)\))g(+)g(floor)f (\(imag)h(\()p Fp(x)s Fr(\)\))g(*)g(I)p Fv(.)0 1054 y Fr(fix)g(\()p Fp(x)s Fr(\))78 b Fv(T)l(runcate)16 b Fp(x)k Fv(to)o(w)o(ard)15 b(zero.)23 b(If)16 b Fp(x)k Fv(is)d(complex,)g (return)f Fr(fix)f(\(real)f(\()p Fp(x)s Fr(\)\))h(+)g(fix)g(\(imag)f (\()p Fp(x)s Fr(\)\))h(*)240 1117 y(I)p Fv(.)0 1201 y Fr(round)f(\()p Fp(x)s Fr(\))31 b Fv(Return)20 b(the)f(in)o(teger)g (nearest)g(to)g Fp(x)p Fv(.)32 b(If)19 b Fp(x)j Fv(is)e(complex,)h (return)e Fr(round)14 b(\(real)h(\()p Fp(x)s Fr(\)\))g(+)g(round)240 1263 y(\(imag)f(\()p Fp(x)s Fr(\)\))h(*)g(I)p Fv(.)0 1347 y Fr(sign)g(\()p Fp(x)s Fr(\))54 b Fv(Compute)15 b(the)g Fp(sign)o(um)h Fv(function,)f(whic)o(h)i(is)e(de\014ned)i(as) 730 1491 y(sign)q(\()p Fp(x)s Fv(\))12 b(=)932 1405 y Fh(8)932 1442 y(<)932 1517 y(:)977 1427 y Fv(1)p Fo(;)80 b(x)12 b(>)h Fv(0;)977 1490 y(0)p Fo(;)80 b(x)12 b Fv(=)h(0;)977 1552 y Ft(\000)p Fv(1)p Fo(;)45 b(x)12 b(<)h Fv(0.)240 1644 y(F)l(or)i(complex)h(argumen)o(ts,)e Fr(sign)g Fv(returns)h Fr(x)g(./)g(abs)g(\()p Fp(x)s Fr(\))p Fv(.)0 1728 y Fr(exp)g(\()p Fp(x)s Fr(\))78 b Fv(Compute)20 b(the)h(exp)q(onen)o(tial)h(of)e Fp(x)p Fv(.)36 b(T)l(o)20 b(compute)h(the)f(matrix)g(exp)q(onen)o (tial,)j(see)e(Chapter)f(8)240 1791 y([Linear)c(Algebra],)f(page)g(75.) 0 1875 y Fr(gcd)g(\()p Fp(x)p Fr(,)g(...\))240 1937 y Fv(Compute)g(the)h(greatest)f(common)g(divisor)h(of)f(the)h(elemen)o (ts)g(of)g Fp(x)p Fv(,)f(or)g(the)h(list)g(of)f(all)i(the)e(argu-)240 1999 y(men)o(ts.)20 b(F)l(or)14 b(example,)360 2060 y Fr(gcd)23 b(\(a1,)h(...,)f(ak\))240 2133 y Fv(is)16 b(the)f(same)g(as) 360 2194 y Fr(gcd)23 b(\([a1,)h(...,)f(ak]\))240 2267 y Fv(An)15 b(optional)h(second)g(return)f(v)m(alue,)h Fp(v)j Fv(con)o(tains)c(an)h(in)o(teger)f(v)o(ector)f(suc)o(h)i(that) 360 2328 y Fr(g)24 b(=)f(v\(1\))h(*)f(a\(k\))h(+)g(...)f(+)h(v\(k\))f (*)h(a\(k\))0 2412 y(lcm)15 b(\()p Fp(x)p Fr(,)g(...\))240 2474 y Fv(Compute)e(the)h(least)g(common)f(m)o(ultiple)j(of)d(the)h (elemen)o(ts)g(elemen)o(ts)g(of)f Fp(x)p Fv(,)h(or)f(the)h(list)g(of)f (all)i(the)240 2536 y(argumen)o(ts.)k(F)l(or)c(example,)360 2597 y Fr(lcm)23 b(\(a1,)h(...,)f(ak\))240 2670 y Fv(is)16 b(the)f(same)g(as)p eop %%Page: 72 74 72 73 bop 0 -58 a Fv(72)1766 b(Octa)o(v)o(e)360 183 y Fr(lcm)23 b(\([a1,)h(...,)f(ak]\).)0 271 y(log)15 b(\()p Fp(x)s Fr(\))78 b Fv(Compute)14 b(the)h(natural)f(logarithm)g(of)g Fp(x)p Fv(.)20 b(T)l(o)14 b(compute)g(the)h(matrix)f(logarithm,)g(see)g (Chapter)g(8)240 333 y([Linear)i(Algebra],)f(page)g(75.)0 420 y Fr(log2)g(\()p Fp(x)s Fr(\))54 b Fv(Compute)15 b(the)g(base-2)g(logarithm)h(of)e Fp(x)p Fv(.)0 508 y Fr(log10)g(\()p Fp(x)s Fr(\))31 b Fv(Compute)15 b(the)g(base-10)g (logarithm)g(of)g Fp(x)p Fv(.)0 595 y Fr(sqrt)g(\()p Fp(x)s Fr(\))54 b Fv(Compute)20 b(the)g(square)g(ro)q(ot)g(of)g Fp(x)p Fv(.)35 b(T)l(o)20 b(compute)g(the)g(matrix)g(square)g(ro)q(ot,) h(see)f(Chapter)g(8)240 657 y([Linear)c(Algebra],)f(page)g(75.)0 745 y Fr(max)g(\()p Fp(x)s Fr(\))78 b Fv(F)l(or)14 b(a)f(v)o(ector)h (argumen)o(t,)f(return)h(the)g(maxim)o(um)h(v)m(alue.)20 b(F)l(or)14 b(a)g(matrix)g(argumen)o(t,)f(return)h(the)240 807 y(maxim)o(um)h(v)m(alue)i(from)d(eac)o(h)h(column,)h(as)f(a)g(ro)o (w)f(v)o(ector.)19 b(Th)o(us,)360 869 y Fr(max)k(\(max)h(\()p Fp(x)s Fr(\)\))240 944 y Fv(returns)15 b(the)g(largest)g(elemen)o(t)h (of)f Fp(x)p Fv(.)240 1019 y(F)l(or)g(complex)h(argumen)o(ts,)e(the)h (magnitude)h(of)e(the)i(elemen)o(ts)g(are)e(used)i(for)f(comparison.)0 1106 y Fr(min)g(\()p Fp(x)s Fr(\))78 b Fv(Lik)o(e)16 b Fr(max)p Fv(,)e(but)i(return)f(the)g(minim)o(um)i(v)m(alue.)0 1194 y Fr(rem)e(\()p Fp(x)p Fr(,)g Fp(y)t Fr(\))240 1256 y Fv(Return)h(the)f(remainder)h(of)f Fp(x)j Fr(/)d Fp(y)t Fv(,)g(computed)g(using)h(the)g(expression)360 1318 y Fr(x)24 b(-)f(y)h(.*)g(fix)f(\(x)h(./)f(y\))240 1393 y Fv(An)13 b(error)e(message)h(is)h(prin)o(ted)g(if)g(the)f(dimensions) i(of)e(the)h(argumen)o(ts)e(do)h(not)g(agree,)h(or)e(if)i(either)240 1456 y(of)i(the)g(argumen)o(ts)f(is)i(complex.)0 1589 y Fu(7.2)33 b(Complex)13 b(Arithmetic)62 1693 y Fv(The)i(follo)o(wing)h (functions)f(are)g(a)o(v)m(ailable)h(for)f(w)o(orking)f(with)h(complex) h(n)o(um)o(b)q(ers.)k(Eac)o(h)15 b(exp)q(ects)g(a)g(single)0 1755 y(argumen)o(t.)k(Giv)o(en)d(a)f(matrix)f(they)i(w)o(ork)e(on)h(an) g(elemen)o(t)h(b)o(y)f(elemen)o(t)h(basis.)0 1851 y Fr(abs)f(\()p Fp(x)s Fr(\))78 b Fv(Compute)15 b(the)g(magnitude)h(of)f Fp(x)p Fv(.)0 1938 y Fr(angle)f(\()p Fp(x)s Fr(\))0 2000 y(arg)h(\()p Fp(x)s Fr(\))78 b Fv(Compute)15 b(the)g(argumen)o(t)g(of)f Fp(x)p Fv(.)0 2088 y Fr(conj)h(\()p Fp(x)s Fr(\))54 b Fv(Return)16 b(the)f(complex)h(conjugate)f(of)g Fp(x)p Fv(.)0 2175 y Fr(imag)g(\()p Fp(x)s Fr(\))54 b Fv(Return)16 b(the)f(imaginary)h(part)e(of)h Fp(x)p Fv(.)0 2263 y Fr(real)g(\()p Fp(x)s Fr(\))54 b Fv(Return)16 b(the)f(real)h(part)e(of) h Fp(x)p Fv(.)0 2396 y Fu(7.3)33 b(T)-6 b(rigonometry)62 2500 y Fv(Octa)o(v)o(e)15 b(pro)o(vides)h(the)f(follo)o(wing)h (trigonometric)f(functions:)120 2570 y Fr(sin)95 b(asin)g(sinh)g(asinh) 120 2620 y(cos)g(acos)g(cosh)g(acosh)120 2670 y(tan)g(atan)g(tanh)g (atanh)p eop %%Page: 73 75 73 74 bop 0 -58 a Fv(Chapter)15 b(7:)k(Arithmetic)1458 b(73)120 233 y Fr(sec)95 b(asec)g(sech)g(asech)120 283 y(csc)g(acsc)g(csch)g(acsch)120 333 y(cot)g(acot)g(coth)g(acoth)0 417 y Fv(Eac)o(h)14 b(of)g(these)h(functions)g(exp)q(ect)g(a)f(single)h (argumen)o(t.)k(F)l(or)14 b(matrix)g(argumen)o(ts,)f(they)h(w)o(ork)g (on)g(an)g(elemen)o(t)0 479 y(b)o(y)h(elemen)o(t)h(basis.)k(F)l(or)15 b(example,)h(the)f(expression)120 551 y Fr(sin)23 b(\([1,)h(2;)f(3,)h (4]\))0 635 y Fv(pro)q(duces)120 707 y Fr(ans)f(=)192 807 y(0.84147)70 b(0.90930)192 857 y(0.14112)46 b(-0.75680)62 941 y(atan2)15 b(\()p Fp(y)p Fr(,)g Fp(x)s Fr(\))0 1079 y Fu(7.4)33 b(Sums)13 b(and)j(Pro)r(ducts)0 1198 y Fr(sum)f(\()p Fp(x)s Fr(\))78 b Fv(F)l(or)18 b(a)h(v)o(ector)f(argumen)o(t,)h(return) f(the)h(sum)g(of)g(all)g(the)g(elemen)o(ts.)32 b(F)l(or)18 b(a)h(matrix)f(argumen)o(t,)240 1260 y(return)d(the)f(sum)h(of)f(the)h (elemen)o(ts)g(in)g(eac)o(h)g(column,)g(as)f(a)h(ro)o(w)e(v)o(ector.)19 b(The)c(sum)g(of)f(an)g(empt)o(y)240 1322 y(matrix)g(is)h(0)f(if)g(it)h (has)f(no)g(columns,)h(or)f(a)g(v)o(ector)f(of)h(zeros)g(if)h(it)g(has) f(no)g(ro)o(ws)f(\(see)h(Section)i(3.2.1)240 1384 y([Empt)o(y)e (Matrices],)g(page)i(24\).)0 1474 y Fr(prod)f(\()p Fp(x)s Fr(\))54 b Fv(F)l(or)13 b(a)h(v)o(ector)g(argumen)o(t,)f(return)h(the)g (pro)q(duct)g(of)g(all)h(the)f(elemen)o(ts.)20 b(F)l(or)14 b(a)f(matrix)h(argumen)o(t,)240 1536 y(return)k(the)f(pro)q(duct)i(of)e (the)h(elemen)o(ts)g(in)h(eac)o(h)e(column,)i(as)e(a)h(ro)o(w)f(v)o (ector.)26 b(The)18 b(pro)q(duct)g(of)240 1599 y(an)g(empt)o(y)g (matrix)g(is)g(1)g(if)h(it)f(has)g(no)g(columns,)i(or)d(a)h(v)o(ector)g (of)f(ones)i(if)f(it)h(has)f(no)g(ro)o(ws)f(\(see)240 1661 y(Section)f(3.2.1)e([Empt)o(y)g(Matrices],)g(page)h(24\).)0 1751 y Fr(cumsum)f(\()p Fp(x)s Fr(\))240 1813 y Fv(Return)i(the)f(cum)o (ulativ)o(e)h(sum)f(of)g(eac)o(h)g(column)h(of)f Fp(x)p Fv(.)20 b(F)l(or)15 b(example,)360 1877 y Fr(cumsum)23 b(\([1,)g(2;)h(3,)g(4]\))240 1953 y Fv(pro)q(duces)360 2016 y Fr(ans)f(=)408 2116 y(1)47 b(2)408 2165 y(4)g(6)0 2255 y(cumprod)14 b(\()p Fp(x)s Fr(\))240 2317 y Fv(Return)i(the)f(cum) o(ulativ)o(e)h(pro)q(duct)g(of)e(eac)o(h)i(column)g(of)f Fp(x)p Fv(.)k(F)l(or)c(example,)360 2381 y Fr(cumprod)23 b(\([1,)g(2;)h(3,)f(4]\))240 2457 y Fv(pro)q(duces)360 2521 y Fr(ans)g(=)408 2620 y(1)47 b(2)408 2670 y(3)g(8)p eop %%Page: 74 76 74 75 bop 0 -58 a Fv(74)1766 b(Octa)o(v)o(e)0 183 y Fr(sumsq)14 b(\()p Fp(x)s Fr(\))31 b Fv(F)l(or)14 b(a)f(v)o(ector)h(argumen)o(t,)f (return)h(the)g(sum)h(of)e(the)i(squares)f(of)f(all)i(the)g(elemen)o (ts.)20 b(F)l(or)13 b(a)h(matrix)240 246 y(argumen)o(t,)21 b(return)f(the)g(sum)h(of)f(the)g(squares)g(of)g(the)h(elemen)o(ts)g (in)g(eac)o(h)g(column,)h(as)e(a)g(ro)o(w)240 308 y(v)o(ector.)0 441 y Fu(7.5)33 b(Sp)r(ecial)16 b(F)-6 b(unctions)0 557 y Fr(beta)144 b Fv(Returns)16 b(the)f(b)q(eta)g(function,)784 686 y Fo(\014)r Fv(\()p Fo(a;)8 b(b)p Fv(\))j(=)977 655 y(\000\()p Fo(a)p Fv(\)\000\()p Fo(b)p Fv(\))p 977 675 172 2 v 981 717 a(\000\()p Fo(a)f Fv(+)h Fo(b)p Fv(\))1153 686 y Fo(:)0 827 y Fr(betai)j(\()p Fp(a)p Fr(,)h Fp(b)p Fr(,)g Fp(x)s Fr(\))240 889 y Fv(Returns)h(the)f(incomplete)i(b)q(eta)e (function,)547 1013 y Fo(\014)r Fv(\()p Fo(a;)8 b(b;)g(x)p Fv(\))i(=)j Fo(\014)r Fv(\()p Fo(a;)8 b(b)p Fv(\))910 994 y Fl(\000)p Fk(1)960 955 y Fh(Z)1002 966 y Fn(x)983 1050 y Fk(0)1030 1013 y Fo(t)1046 994 y Fk(\()p Fn(a)p Fl(\000)p Fn(z)q Fk(\))1135 1013 y Fv(\(1)i Ft(\000)g Fo(t)p Fv(\))1265 994 y Fk(\()p Fn(b)p Fl(\000)p Fk(1\))1351 1013 y Fo(dt:)240 1149 y Fv(If)18 b(x)f(has)g(more)g(than)g(one)h(comp) q(onen)o(t,)f(b)q(oth)h Fp(a)f Fv(and)g Fp(b)i Fv(m)o(ust)e(b)q(e)h (scalars.)26 b(If)17 b Fp(x)k Fv(is)d(a)f(scalar,)g Fp(a)240 1211 y Fv(and)e Fp(b)i Fv(m)o(ust)d(b)q(e)i(of)f(compatible)h (dimensions.)0 1298 y Fr(erf)168 b Fv(Computes)15 b(the)g(error)g (function,)753 1422 y(erf)t(\()p Fo(z)r Fv(\))d(=)954 1391 y(2)p 933 1412 66 2 v 933 1421 a Ft(p)p 971 1421 28 2 v 32 x Fo(\031)1011 1365 y Fh(Z)1052 1375 y Fn(z)1034 1459 y Fk(0)1079 1422 y Fo(e)1100 1403 y Fl(\000)p Fn(t)1139 1391 y Fg(2)1157 1422 y Fo(dt)0 1563 y Fr(erfc)j(\()p Fp(z)s Fr(\))58 b Fv(Computes)15 b(the)g(complemen)o(tary)g(error)g (function,)h Fr(1)f(-)g(erf)f(\()p Fp(z)s Fr(\))p Fv(.)0 1650 y Fr(erfinv)96 b Fv(Computes)15 b(the)g(in)o(v)o(erse)h(of)f(the)g (error)f(function.)0 1738 y Fr(gamma)g(\()p Fp(z)s Fr(\))35 b Fv(Computes)15 b(the)g(gamma)f(function,)763 1862 y(\000\()p Fo(z)r Fv(\))e(=)910 1805 y Fh(Z)952 1815 y Fl(1)933 1899 y Fk(0)995 1862 y Fo(t)1011 1844 y Fn(z)q Fl(\000)p Fk(1)1073 1862 y Fo(e)1094 1844 y Fl(\000)p Fn(t)1134 1862 y Fo(dt:)0 1998 y Fr(gammai)i(\()p Fp(a)p Fr(,)h Fp(x)s Fr(\))240 2061 y Fv(Computes)g(the)g(incomplete)i(gamma)d (function,)754 2192 y(\000\()p Fo(a;)8 b(x)p Fv(\))k(=)954 2127 y Fh(R)981 2137 y Fn(x)973 2175 y Fk(0)1010 2161 y Fo(e)1031 2145 y Fl(\000)p Fn(t)1072 2161 y Fo(t)1088 2145 y Fn(a)p Fl(\000)p Fk(1)1151 2161 y Fo(dt)p 954 2182 237 2 v 1028 2223 a Fv(\000\()p Fo(a)p Fv(\))240 2334 y(If)j Fp(a)g Fv(is)h(scalar,)f(then)g Fr(gammai)g(\()p Fp(a)p Fr(,)f Fp(x)s Fr(\))h Fv(is)h(returned)g(for)e(eac)o(h)i(elemen) o(t)g(of)e Fp(x)19 b Fv(and)c(vice)h(v)o(ersa.)240 2408 y(If)j(neither)g Fp(a)g Fv(nor)f Fp(x)k Fv(is)d(scalar,)g(the)g(sizes)g (of)f Fp(a)g Fv(and)h Fp(x)j Fv(m)o(ust)c(agree,)h(and)f Fp(gammai)j Fv(is)e(applied)240 2471 y(elemen)o(t-b)o(y-elemen)o(t.)0 2558 y Fr(lgamma)96 b Fv(Returns)16 b(the)f(natural)g(logarithm)g(of)g (the)g(gamma)g(function.)p eop %%Page: 75 77 75 76 bop 0 -58 a Fv(Chapter)15 b(8:)k(Linear)e(Algebra)1375 b(75)0 183 y Fs(8)41 b(Linear)15 b(Algebra)62 331 y Fv(This)k(c)o (hapter)g(do)q(cumen)o(ts)g(the)f(linear)i(algebra)f(functions)g(of)f (Octa)o(v)o(e.)30 b(Reference)20 b(material)e(for)g(man)o(y)0 393 y(of)i(these)g(options)g(ma)o(y)f(b)q(e)i(found)g(in)g(Golub)f(and) g(V)l(an)h(Loan,)g Fp(Matrix)e(Computations,)i(2nd)f(Ed.)p Fv(,)g(Johns)0 456 y(Hopkins,)c(1989,)d(and)j(in)g Fp(LAP)l(A)o(CK)g (Users')e(Guide)p Fv(,)i(SIAM,)f(1992.)0 601 y Fu(8.1)33 b(Basic)14 b(Matrix)j(F)-6 b(unctions)0 723 y Fr(balance)360 788 y(aa)24 b(=)f(balance)g(\(a,)h(opt\))360 838 y([dd,)f(aa])h(=)47 b(balance\(a,)23 b(opt\))360 888 y([dd,)g(aa])h(=)f(balance)g(\(a,)h (opt\))360 938 y([cc,)f(dd,)h(aa,)f(bb])h(=)f(balance)g(\(a,)h(b,)f (opt\))240 1015 y([dd,)15 b(aa])f(=)h(balance)g(\(a\))h Fv(returns)h Fr(aa)e(=)g(dd)g(\\)g(a)g(*)g(dd)p Fv(.)25 b Fr(aa)16 b Fv(is)i(a)f(matrix)f(whose)h(ro)o(w/column)240 1078 y(norms)k(are)g(roughly)h(equal)g(in)g(magnitude,)i(and)d Fr(dd)h Fv(=)f Fr(p)15 b(*)g(d)p Fv(,)23 b(where)f Fr(p)f Fv(is)h(a)f(p)q(erm)o(utation)240 1140 y(matrix)13 b(and)h Fr(d)g Fv(is)g(a)g(diagonal)g(matrix)f(of)h(p)q(o)o(w)o(ers)f(of)g(t)o (w)o(o.)18 b(This)c(allo)o(ws)g(the)g(equilibration)i(to)d(b)q(e)240 1202 y(computed)18 b(without)g(roundo\013.)27 b(Results)19 b(of)f(eigen)o(v)m(alue)i(calculation)f(are)f(t)o(ypically)h(impro)o(v) o(ed)240 1265 y(b)o(y)c(balancing)i(\014rst.)240 1342 y Fr([cc,)e(dd,)f(aa,)h(bb])g(=)g(balance)f(\(a,)h(b\))e Fv(returns)g Fr(aa)g Fv(\()p Fr(bb)p Fv(\))g Fr(=)i(cc*a*dd)f (\(cc*b*dd\))p Fv(\),)e(where)h Fr(aa)240 1405 y Fv(and)18 b Fr(bb)f Fv(ha)o(v)o(e)g(non-zero)g(elemen)o(ts)h(of)f(appro)o (ximately)h(the)f(same)g(magnitude)h(and)g Fr(cc)f Fv(and)g Fr(dd)240 1467 y Fv(are)e(p)q(erm)o(uted)h(diagonal)f(matrices)h(as)e (in)i Fr(dd)f Fv(for)g(the)g(algebraic)h(eigen)o(v)m(alue)h(problem.) 240 1545 y(The)e(eigen)o(v)m(alue)j(balancing)e(option)g Fr(opt)e Fv(is)i(selected)g(as)f(follo)o(ws:)240 1638 y Fr("N")p Fv(,)f Fr("n")69 b Fv(No)15 b(balancing;)h(argumen)o(ts)e (copied,)j(transformation\(s\))c(set)i(to)f(iden)o(tit)o(y)l(.)240 1731 y Fr("P")p Fv(,)g Fr("p")69 b Fv(P)o(erm)o(ute)15 b(argumen)o(t\(s\))e(to)i(isolate)g(eigen)o(v)m(alues)j(where)d(p)q (ossible.)240 1824 y Fr("S")p Fv(,)f Fr("s")69 b Fv(Scale)16 b(to)f(impro)o(v)o(e)g(accuracy)g(of)g(computed)g(eigen)o(v)m(alues.) 240 1917 y Fr("B")p Fv(,)f Fr("b")69 b Fv(P)o(erm)o(ute)20 b(and)g(scale,)i(in)f(that)e(order.)35 b(Ro)o(ws/columns)20 b(of)g(a)g(\(and)g(b\))g(that)f(are)480 1980 y(isolated)d(b)o(y)f(p)q (erm)o(utation)g(are)g(not)g(scaled.)21 b(This)16 b(is)f(the)h(default) f(b)q(eha)o(vior.)240 2073 y(Algebraic)h(eigen)o(v)m(alue)i(balancing)e (uses)g(standard)e(LAP)l(A)o(CK)i(routines.)240 2151 y(Generalized)22 b(eigen)o(v)m(alue)f(problem)g(balancing)g(uses)f(W)l (ard's)g(algorithm)f(\(SIAM)h(Journal)h(on)240 2213 y(Scien)o(ti\014c)c (and)f(Statistical)f(Computing,)g(1981\).)0 2306 y Fr(cond)g(\()p Fp(a)p Fr(\))58 b Fv(Compute)17 b(the)g(\(t)o(w)o(o-norm\))d(condition) 19 b(n)o(um)o(b)q(er)e(of)f(a)h(matrix.)24 b Fr(cond)15 b(\(a\))h Fv(is)i(de\014ned)g(as)f Fr(norm)240 2368 y(\(a\))e(*)g(norm) f(\(inv)h(\(a\)\))p Fv(,)f(and)i(is)f(computed)h(via)f(a)g(singular)h (v)m(alue)h(decomp)q(osition.)0 2462 y Fr(det)e(\()p Fp(a)p Fr(\))82 b Fv(Compute)15 b(the)g(determinan)o(t)h(of)e Fp(a)h Fv(using)h(LINP)l(A)o(CK.)0 2555 y Fr(eig)646 2620 y(=)24 b(eig)g(\(a\))360 2670 y([v,)f(lambda])g(=)h(eig)g(\(a\))p eop %%Page: 76 78 76 77 bop 0 -58 a Fv(76)1766 b(Octa)o(v)o(e)240 183 y(The)15 b(eigen)o(v)m(alues)j(\(and)d(eigen)o(v)o(ectors\))g(of)g(a)f(matrix)h (are)g(computed)h(in)g(a)f(sev)o(eral)g(step)h(pro)q(cess)240 246 y(whic)o(h)f(b)q(egins)g(with)f(a)g(Hessen)o(b)q(erg)g(decomp)q (osition)i(\(see)e Fr(hess)p Fv(\),)f(follo)o(w)o(ed)h(b)o(y)g(a)f(Sc)o (h)o(ur)i(decom-)240 308 y(p)q(osition)f(\(see)g Fr(schur)p Fv(\),)e(from)h(whic)o(h)h(the)f(eigen)o(v)m(alues)j(are)d(apparen)o (t.)19 b(The)13 b(eigen)o(v)o(ectors,)g(when)240 370 y(desired,)j(are)f(computed)h(b)o(y)f(further)g(manipulations)h(of)f (the)g(Sc)o(h)o(ur)h(decomp)q(osition.)240 445 y(See)g(also:)k Fr(hess)p Fv(,)14 b Fr(schur)p Fv(.)0 532 y Fr(givens)360 594 y([c,)23 b(s])h(=)g(givens)f(\(x,)g(y\))360 644 y(G)h(=)f(givens)g (\(x,)h(y\))240 718 y(G)15 b(=)g(givens\(x,)f(y\))g Fv(returns)g(a)g(2) 8 b Ft(\002)g Fv(2)14 b(orthogonal)g(matrix)g Fr(G)h(=)g([c)g(s;)g(-s') f(c])g Fv(suc)o(h)h(that)e Fr(G)i([x;)240 780 y(y])g(=)g([*;)g(0])g Fv(\(x,)f(y)h(scalars\))0 867 y Fr(inv)g(\()p Fp(a)p Fr(\))0 930 y(inverse)f(\()p Fp(a)p Fr(\))240 992 y Fv(Compute)h(the)g (in)o(v)o(erse)h(of)f(the)g(square)g(matrix)g Fp(a)p Fv(.)0 1079 y Fr(norm)g(\()p Fp(a)p Fr(,)f Fp(p)q Fr(\))240 1141 y Fv(Compute)21 b(the)h(p-norm)f(of)g(the)g(matrix)g Fp(a)p Fv(.)38 b(If)22 b(the)f(second)h(argumen)o(t)f(is)h(missing,)h Fr(p)15 b(=)g(2)21 b Fv(is)240 1203 y(assumed.)240 1278 y(If)15 b Fp(a)g Fv(is)h(a)f(matrix:)240 1365 y Fp(p)i Fv(=)e Fr(1)124 b Fv(1-norm,)14 b(the)i(largest)e(column)j(sum)e(of)g Fp(a)p Fv(.)240 1452 y Fp(p)i Fv(=)e Fr(2)124 b Fv(Largest)15 b(singular)h(v)m(alue)g(of)f Fp(a)p Fv(.)240 1539 y Fp(p)i Fv(=)e Fr(Inf)76 b Fv(In\014nit)o(y)16 b(norm,)f(the)g(largest)g(ro)o (w)f(sum)h(of)g Fp(a)p Fv(.)240 1626 y Fp(p)i Fv(=)e Fr("fro")480 1688 y Fv(F)l(rob)q(enius)h(norm)f(of)g Fp(a)p Fv(,)f Fr(sqrt)h(\(sum)g(\(diag)f(\(a')h(*)g(a\)\)\))p Fv(.)240 1775 y(If)g Fp(a)g Fv(is)h(a)f(v)o(ector)f(or)h(a)g(scalar:) 240 1862 y Fp(p)i Fv(=)e Fr(Inf)76 b(max)15 b(\(abs)f(\(a\)\))p Fv(.)240 1949 y Fp(p)j Fv(=)e Fr(-Inf)52 b(min)15 b(\(abs)f(\(a\)\))p Fv(.)240 2036 y(other)136 b(p-norm)15 b(of)g Fp(a)p Fv(,)f Fr(\(sum)h(\(abs)g(\(a\))f(.^)h(p\)\))g(^)g(\(1/p\))p Fv(.)0 2123 y Fr(null)g(\()p Fp(a)p Fr(,)f Fp(tol)r Fr(\))240 2185 y Fv(Returns)i(an)f(orthonormal)f(basis)i(of)f(the)g(n)o(ull)i (space)e(of)g Fp(a)p Fv(.)240 2260 y(The)20 b(dimension)i(of)e(the)g(n) o(ull)h(space)f(is)h(tak)o(en)e(as)h(the)g(n)o(um)o(b)q(er)g(of)g (singular)h(v)m(alues)g(of)f Fp(a)f Fv(not)240 2322 y(greater)14 b(than)h Fp(tol)p Fv(.)20 b(If)c(the)f(argumen)o(t)f Fp(tol)j Fv(is)f(missing,)g(it)f(is)h(computed)g(as)360 2384 y Fr(max)23 b(\(size)h(\(a\)\))f(*)h(max)f(\(svd)g(\(a\)\))h(*)f (eps)0 2471 y(orth)15 b(\()p Fp(a)p Fr(,)f Fp(tol)r Fr(\))240 2533 y Fv(Returns)i(an)f(orthonormal)f(basis)i(of)f(the)g(range)g(of)g Fp(a)p Fv(.)240 2608 y(The)f(dimension)g(of)f(the)h(range)f(space)g(is) h(tak)o(en)f(as)g(the)g(n)o(um)o(b)q(er)h(of)e(singular)j(v)m(alues)f (of)f Fp(a)g Fv(greater)240 2670 y(than)i Fp(tol)p Fv(.)20 b(If)15 b(the)h(argumen)o(t)e Fp(tol)j Fv(is)f(missing,)f(it)h(is)g (computed)f(as)p eop %%Page: 77 79 77 78 bop 0 -58 a Fv(Chapter)15 b(8:)k(Linear)e(Algebra)1375 b(77)360 183 y Fr(max)23 b(\(size)h(\(a\)\))f(*)h(max)f(\(svd)g (\(a\)\))h(*)f(eps)0 269 y(pinv)15 b(\()p Fp(X)p Fr(,)g Fp(tol)r Fr(\))240 331 y Fv(Returns)h(the)f(pseudoin)o(v)o(erse)h(of)f Fp(X)p Fv(.)g(Singular)h(v)m(alues)h(less)f(than)f Fp(tol)i Fv(are)d(ignored.)240 405 y(If)h(the)h(second)f(argumen)o(t)g(is)h (omitted,)e(it)i(is)g(assumed)f(that)360 467 y Fr(tol)23 b(=)h(max)g(\(size)f(\(X\)\))g(*)h(sigma_max)e(\(X\))i(*)g(eps,)240 541 y Fv(where)15 b Fr(sigma_max)f(\()p Fp(X)5 b Fr(\))15 b Fv(is)h(the)f(maximal)g(singular)i(v)m(alue)f(of)f Fp(X)p Fv(.)0 627 y Fr(rank)g(\()p Fp(a)p Fr(,)f Fp(tol)r Fr(\))240 689 y Fv(Compute)i(the)g(rank)g(of)g Fp(a)p Fv(,)f(using)i(the)g(singular)g(v)m(alue)g(decomp)q(osition.)24 b(The)16 b(rank)g(is)h(tak)o(en)f(to)240 751 y(b)q(e)g(the)f(n)o(um)o (b)q(er)g(of)g(singular)h(v)m(alues)g(of)f Fp(a)g Fv(that)f(are)h (greater)f(than)h(the)h(sp)q(eci\014ed)h(tolerance)e Fp(tol)p Fv(.)240 813 y(If)g(the)h(second)f(argumen)o(t)g(is)h (omitted,)e(it)i(is)g(tak)o(en)e(to)h(b)q(e)360 875 y Fr(tol)23 b(=)48 b(max)23 b(\(size)h(\(a\)\))f(*)h(sigma)f(\(1\))g(*)h (eps;)240 949 y Fv(where)15 b Fr(eps)g Fv(is)h(mac)o(hine)g(precision)h (and)e Fr(sigma)g Fv(is)g(the)h(largest)e(singular)i(v)m(alue)h(of)e Fr(a)p Fv(.)0 1035 y Fr(trace)f(\()p Fp(a)p Fr(\))35 b Fv(Compute)15 b(the)g(trace)g(of)g Fp(a)p Fv(,)f Fr(sum)h(\(diag)f (\(a\)\))p Fv(.)0 1166 y Fu(8.2)33 b(Matrix)16 b(F)-6 b(actorizations)0 1282 y Fr(chol)15 b(\()p Fp(a)p Fr(\))58 b Fv(Compute)19 b(the)h(Cholesky)g(factor,)f Fp(r)p Fv(,)h(of)g(the)f (symmetric)h(p)q(ositiv)o(e)h(de\014nite)g(matrix)e Fp(a)p Fv(,)h(where)240 1344 y Fo(R)275 1327 y Fn(T)301 1344 y Fo(R)13 b Fv(=)f Fo(A)p Fv(.)0 1430 y Fr(hess)j(\()p Fp(a)p Fr(\))58 b Fv(Compute)15 b(the)g(Hessen)o(b)q(erg)h(decomp)q (osition)g(of)f(the)h(matrix)e Fp(a)p Fv(.)479 1491 y Fr(h)24 b(=)g(hess)f(\(a\))360 1541 y([p,)g(h])h(=)g(hess)f(\(a\))240 1615 y Fv(The)17 b(Hessen)o(b)q(erg)h(decomp)q(osition)g(is)f(usually)h (used)g(as)e(the)h(\014rst)g(step)g(in)g(an)g(eigen)o(v)m(alue)i(com-) 240 1677 y(putation,)g(but)f(has)g(other)g(applications)i(as)e(w)o(ell) h(\(see)f(Golub,)i(Nash,)e(and)h(V)l(an)f(Loan,)h(IEEE)240 1740 y(T)l(ransactions)f(on)h(Automatic)f(Con)o(trol,)g(1979.)28 b(The)19 b(Hessen)o(b)q(erg)g(decomp)q(osition)g(is)g Fr(p)c(*)g(h)g(*)240 1802 y(p')g(=)g(a)f Fv(where)h Fr(p)g Fv(is)g(a)g(square)f(unitary)h(matrix)g(\()p Fr(p')f(*)h(p)g(=)g(I)p Fv(,)g(using)g(complex-conjugate)g(trans-)240 1864 y(p)q(osition\))h (and)f Fr(h)g Fv(is)h(upp)q(er)g(Hessen)o(b)q(erg)g(\()p Fr(i)f(>=)g(j+1)f(=>)h(h)g(\(i,)g(j\))g(=)g(0)p Fv(\).)0 1950 y Fr(lu)g(\()p Fp(a)p Fr(\))106 b Fv(Compute)16 b(the)h(LU)g(decomp)q(osition)h(of)e Fp(a)p Fv(,)g(using)i(subroutines) f(from)f(LAP)l(A)o(CK.)h(The)f(result)h(is)240 2012 y(returned)g(in)h (a)e(p)q(erm)o(uted)h(form,)f(according)h(to)f(the)h(optional)g(return) g(v)m(alue)h Fp(p)p Fv(.)24 b(F)l(or)16 b(example,)240 2074 y(giv)o(en)g(the)f(matrix)g Fr(a)g(=)g([1,)g(2;)f(3,)h(4])p Fv(,)360 2136 y Fr([l,)23 b(u,)h(p])g(=)f(lu)h(\(a\))240 2210 y Fv(returns)360 2271 y Fr(l)g(=)408 2371 y(1.00000)46 b(0.00000)408 2421 y(0.33333)g(1.00000)360 2521 y(u)24 b(=)408 2620 y(3.00000)46 b(4.00000)408 2670 y(0.00000)g(0.66667)p eop %%Page: 78 80 78 79 bop 0 -58 a Fv(78)1766 b(Octa)o(v)o(e)360 233 y Fr(p)24 b(=)408 333 y(0)47 b(1)408 382 y(1)g(0)0 469 y(qr)15 b(\()p Fp(a)p Fr(\))106 b Fv(Compute)10 b(the)h(QR)g (factorization)f(of)g Fp(a)p Fv(,)h(using)g(standard)f(LAP)l(A)o(CK)h (subroutines.)20 b(F)l(or)9 b(example,)240 531 y(giv)o(en)16 b(the)f(matrix)g Fr(a)g(=)g([1,)g(2;)f(3,)h(4])p Fv(,)360 593 y Fr([q,)23 b(r])h(=)g(qr)f(\(a\))240 668 y Fv(returns)360 729 y Fr(q)h(=)408 829 y(-0.31623)46 b(-0.94868)408 879 y(-0.94868)70 b(0.31623)360 979 y(r)24 b(=)408 1078 y(-3.16228)46 b(-4.42719)432 1128 y(0.00000)g(-0.63246)240 1202 y Fv(The)15 b Fr(qr)g Fv(factorization)g(has)g(applications)i(in)f(the)f(solution)h (of)f(least)h(squares)f(problems)834 1311 y(min)862 1336 y Fn(x)917 1311 y Ft(k)p Fo(Ax)10 b Ft(\000)g Fo(b)p Ft(k)1098 1325 y Fk(2)240 1426 y Fv(for)15 b(o)o(v)o(erdetermined)g (systems)g(of)g(equations)h(\(i.e.,)e Fo(A)i Fv(is)f(a)g(tall,)h(thin)g (matrix\).)j(The)d Fr(qr)f Fv(factor-)240 1489 y(ization)h(is)g Fr(q)f(*)g(r)g(=)g(a)g Fv(where)g Fr(q)g Fv(is)h(an)f(orthogonal)f (matrix)h(and)h Fr(r)f Fv(is)g(upp)q(er)i(triangular.)240 1563 y(The)j(p)q(erm)o(uted)g Fr(qr)g Fv(factorization)g Fr([q,)14 b(r,)h(pi])g(=)g(qr)g(\(a\))k Fv(forms)g(the)h Fr(qr)g Fv(factorization)g(suc)o(h)240 1625 y(that)c(the)i(diagonal)f (en)o(tries)h(of)e Fr(r)h Fv(are)g(decreasing)h(in)g(magnitude)g (order.)25 b(F)l(or)16 b(example,)i(giv)o(en)240 1688 y(the)d(matrix)g Fr(a)g(=)g([1,)g(2;)g(3,)g(4])p Fv(,)360 1749 y Fr([q,)23 b(r,)h(pi])f(=)h(qr\(a\))240 1824 y Fv(returns)360 1886 y Fr(q)g(=)408 1985 y(-0.44721)46 b(-0.89443)408 2035 y(-0.89443)70 b(0.44721)360 2135 y(r)24 b(=)408 2234 y(-4.47214)46 b(-3.13050)432 2284 y(0.00000)70 b(0.44721)360 2384 y(p)24 b(=)432 2484 y(0)47 b(1)432 2533 y(1)g(0)240 2608 y Fv(The)15 b(p)q(erm)o(uted)h Fr(qr)f Fv(factorization)g Fr([q,)g(r,)g(pi])f(=)h(qr)g(\(a\))g Fv(factorization)g(allo)o(ws)h(the)f(construc-)240 2670 y(tion)g(of)g(an)g(orthogonal)g(basis)g(of)g Fr(span)g(\(a\))p Fv(.)p eop %%Page: 79 81 79 80 bop 0 -58 a Fv(Chapter)15 b(8:)k(Linear)e(Algebra)1375 b(79)0 183 y Fr(schur)360 249 y([u,)23 b(s])h(=)g(schur)f(\(a,)g(opt\)) 71 b(opt)24 b(=)g("a",)f("d",)g(or)h("u")479 298 y(s)g(=)g(schur)f (\(a\))240 376 y Fv(The)17 b(Sc)o(h)o(ur)g(decomp)q(osition)h(is)f (used)g(to)f(compute)h(eigen)o(v)m(alues)h(of)e(a)h(square)f(matrix,)g (and)h(has)240 438 y(applications)c(in)g(the)e(solution)i(of)e (algebraic)i(Riccati)g(equations)f(in)g(con)o(trol)g(\(see)f Fr(are)g Fv(and)h Fr(dare)p Fv(\).)240 501 y Fr(schur)i Fv(alw)o(a)o(ys)g(returns)h Fo(S)g Fv(=)e Fo(U)803 484 y Fn(T)829 501 y Fo(AU)20 b Fv(where)15 b Fo(U)k Fv(is)c(a)g(unitary)g (matrix)f(\()p Fo(U)1539 484 y Fl(0)1551 501 y Fo(U)19 b Fv(is)c(iden)o(tit)o(y\))h(and)f Fo(S)240 563 y Fv(is)f(upp)q(er)h (triangular.)k(The)14 b(eigen)o(v)m(alues)i(of)d Fo(A)h Fv(\(and)g Fo(S)s Fv(\))f(are)g(the)h(diagonal)g(elemen)o(ts)g(of)g Fo(S)i Fv(If)e(the)240 625 y(matrix)h Fo(A)h Fv(is)g(real,)g(then)g (the)g(real)g(Sc)o(h)o(ur)g(decomp)q(osition)h(is)f(computed,)g(in)h (whic)o(h)f(the)g(matrix)240 688 y Fo(U)i Fv(is)c(orthogonal)e(and)h Fo(S)j Fv(is)e(blo)q(c)o(k)f(upp)q(er)h(triangular)g(with)f(blo)q(c)o (ks)h(of)f(size)h(at)e(most)h(2)6 b Ft(\002)g Fv(2)12 b(blo)q(c)o(ks)240 750 y(along)i(the)h(diagonal.)20 b(The)14 b(diagonal)h(elemen)o(ts)g(of)f Fo(S)j Fv(\(or)c(the)i(eigen)o(v)m (alues)h(of)e(the)g(2)8 b Ft(\002)h Fv(2)14 b(blo)q(c)o(ks,)240 812 y(when)i(appropriate\))f(are)f(the)i(eigen)o(v)m(alues)h(of)e Fo(A)g Fv(and)g Fo(S)s Fv(.)240 890 y(The)20 b(eigen)o(v)m(alues)i(are) d(optionally)i(ordered)f(along)f(the)h(diagonal)g(according)h(to)e(the) g(v)m(alue)i(of)240 952 y Fr(opt)p Fv(.)e Fr(opt)c(=)g("a")e Fv(indicates)j(that)d(all)i(eigen)o(v)m(alues)g(with)g(negativ)o(e)f (real)g(parts)f(should)i(b)q(e)f(mo)o(v)o(ed)240 1014 y(to)i(the)h(leading)h(blo)q(c)o(k)g(of)e Fo(S)k Fv(\(used)d(in)g Fr(are)p Fv(\),)g Fr(opt)d(=)h("d")i Fv(indicates)h(that)e(all)i(eigen) o(v)m(alues)h(with)240 1077 y(magnitude)g(less)h(than)f(one)g(should)h (b)q(e)f(mo)o(v)o(ed)g(to)f(the)h(leading)h(blo)q(c)o(k)g(of)e Fo(S)j Fv(\(used)f(in)f Fr(dare)p Fv(\),)240 1139 y(and)13 b Fr(opt)i(=)g("u")p Fv(,)d(the)h(default,)g(indicates)h(that)e(no)h (ordering)g(of)f(eigen)o(v)m(alues)j(should)e(o)q(ccur.)20 b(The)240 1201 y(leading)e Fo(k)g Fv(columns)g(of)e Fo(U)22 b Fv(alw)o(a)o(ys)16 b(span)h(the)g Fo(A)p Fv(-in)o(v)m(arian)o(t)h (subspace)g(corresp)q(onding)g(to)e(the)h Fo(k)240 1263 y Fv(leading)g(eigen)o(v)m(alues)g(of)d Fo(S)s Fv(.)0 1357 y Fr(svd)h(\()p Fp(a)p Fr(\))82 b Fv(Compute)15 b(the)g(singular)h(v)m(alue)h(decomp)q(osition)f(of)f Fp(a)859 1478 y Fo(A)e Fv(=)g Fo(U)5 b Fv(\006)p Fo(V)1059 1459 y Fn(H)240 1615 y Fv(The)20 b(function)h Fr(svd)f Fv(normally)g(returns)g(the)g(v)o(ector)f(of)h(singular)h(v)m(alues.)35 b(If)21 b(ask)o(ed)e(for)h(three)240 1677 y(return)15 b(v)m(alues,)h(it)g(computes)f Fo(U)5 b Fv(,)15 b Fo(S)s Fv(,)f(and)h Fo(V)10 b Fv(.)20 b(F)l(or)14 b(example,)360 1742 y Fr(svd)23 b(\(hilb)h(\(3\)\))240 1820 y Fv(returns)360 1886 y Fr(ans)f(=)408 1985 y(1.4083189)408 2035 y(0.1223271)408 2085 y(0.0026873)240 2163 y Fv(and)360 2228 y Fr([u,)g(s,)h(v])g(=)f (svd)h(\(hilb)f(\(3\)\))240 2306 y Fv(returns)360 2371 y Fr(u)h(=)408 2471 y(-0.82704)70 b(0.54745)h(0.12766)408 2521 y(-0.45986)46 b(-0.52829)h(-0.71375)408 2570 y(-0.32330)f (-0.64901)71 b(0.68867)360 2670 y(s)24 b(=)p eop %%Page: 80 82 80 81 bop 0 -58 a Fv(80)1766 b(Octa)o(v)o(e)408 233 y Fr(1.40832)46 b(0.00000)h(0.00000)408 283 y(0.00000)f(0.12233)h (0.00000)408 333 y(0.00000)f(0.00000)h(0.00269)360 432 y(v)24 b(=)408 532 y(-0.82704)70 b(0.54745)h(0.12766)408 582 y(-0.45986)46 b(-0.52829)h(-0.71375)408 632 y(-0.32330)f(-0.64901) 71 b(0.68867)240 705 y Fv(If)16 b(giv)o(en)g(a)g(second)g(argumen)o(t,) f Fr(svd)g Fv(returns)h(an)f(econom)o(y-sized)i(decomp)q(osition,)g (eliminating)240 768 y(the)e(unnecessary)h(ro)o(ws)e(or)h(columns)h(of) f Fp(u)g Fv(or)g Fp(v)p Fv(.)0 899 y Fu(8.3)33 b(F)-6 b(unctions)16 b(of)f(a)f(Matrix)0 1014 y Fr(expm)360 1076 y(expm)23 b(\(a\))240 1150 y Fv(Returns)16 b(the)f(exp)q(onen)o (tial)i(of)d(a)h(matrix,)g(de\014ned)h(as)f(the)g(in\014nite)j(T)l(a)o (ylor)c(series)646 1272 y(exp)q(\()p Fo(A)p Fv(\))e(=)h Fo(I)g Fv(+)e Fo(A)f Fv(+)1019 1242 y Fo(A)1053 1225 y Fk(2)p 1019 1262 53 2 v 1028 1304 a Fv(2!)1087 1272 y(+)1138 1242 y Fo(A)1172 1225 y Fk(3)p 1138 1262 V 1146 1304 a Fv(3!)1205 1272 y(+)h Ft(\001)d(\001)g(\001)240 1383 y Fv(The)19 b(T)l(a)o(ylor)g(series)g(is)h Fp(not)f Fv(the)h(w)o(a)o(y)d(to)i(compute)g(the)g(matrix)g(exp)q(onen)o(tial;)j (see)d(Moler)g(and)240 1445 y(V)l(an)g(Loan,)g Fp(Nineteen)h(Dubious)f (W)l(a)o(ys)f(to)g(Compute)g(the)h(Exp)q(onen)o(tial)h(of)e(a)g(Matrix) p Fv(,)h(SIAM)240 1507 y(Review,)i(1978.)32 b(This)20 b(routine)g(uses)g(W)l(ard's)e(diagonal)i(P)o(ad)o(\023)-21 b(e)19 b(appro)o(ximation)g(metho)q(d)h(with)240 1570 y(three)15 b(step)h(preconditioning)h(\(SIAM)e(Journal)h(on)f (Numerical)i(Analysis,)f(1977\).)240 1644 y(Diagonal)25 b(P)o(ad)o(\023)-21 b(e)24 b(appro)o(ximations)h(are)g(rational)g(p)q (olynomials)h(of)f(matrices)g Fo(D)1714 1651 y Fn(q)1732 1644 y Fv(\()p Fo(a)p Fv(\))1792 1627 y Fl(\000)p Fk(1)1836 1644 y Fo(N)1873 1651 y Fn(q)1891 1644 y Fv(\()p Fo(a)p Fv(\))240 1706 y(whose)18 b(T)l(a)o(ylor)g(series)i(matc)o(hes)e(the)g (\014rst)g(2)p Fo(q)c Fv(+)f(1)18 b(terms)g(of)g(the)h(T)l(a)o(ylor)f (series)h(ab)q(o)o(v)o(e;)g(direct)240 1768 y(ev)m(aluation)d(of)e(the) h(T)l(a)o(ylor)f(series)h(\(with)g(the)g(same)f(preconditioning)j (steps\))d(ma)o(y)g(b)q(e)h(desirable)240 1830 y(in)h(lieu)h(of)e(the)g (P)o(ad)o(\023)-21 b(e)14 b(appro)o(ximation)h(when)h Fo(D)1082 1837 y Fn(q)1100 1830 y Fv(\()p Fo(a)p Fv(\))e(is)i (ill-conditione)q(d.)0 1916 y Fr(logm)f(\()p Fp(a)p Fr(\))58 b Fv(Compute)20 b(the)h(matrix)f(logarithm)h(of)f(the)h(square)f (matrix)g Fp(a)p Fv(.)36 b(Note)20 b(that)g(this)h(is)g(curren)o(tly) 240 1978 y(implemen)o(ted)15 b(in)f(terms)f(of)g(an)g(eigen)o(v)m(alue) j(expansion)e(and)f(needs)h(to)f(b)q(e)h(impro)o(v)o(ed)g(to)e(b)q(e)i (more)240 2041 y(robust.)0 2126 y Fr(sqrtm)g(\()p Fp(a)p Fr(\))35 b Fv(Compute)18 b(the)g(matrix)g(square)g(ro)q(ot)f(of)h(the)g (square)g(matrix)g Fp(a)p Fv(.)29 b(Note)18 b(that)f(this)i(is)f (curren)o(tly)240 2188 y(implemen)o(ted)d(in)f(terms)f(of)g(an)g(eigen) o(v)m(alue)j(expansion)e(and)f(needs)h(to)f(b)q(e)h(impro)o(v)o(ed)g (to)e(b)q(e)i(more)240 2251 y(robust.)0 2336 y Fr(kron)h(\()p Fp(a)p Fr(,)f Fp(b)q Fr(\))240 2398 y Fv(F)l(orm)g(the)i(kronec)o(k)o (er)f(pro)q(duct)g(of)g(t)o(w)o(o)f(matrices,)h(de\014ned)h(blo)q(c)o (k)g(b)o(y)f(blo)q(c)o(k)h(as)360 2460 y Fr(x)24 b(=)f([a\(i,)h(j\))f (b])0 2545 y(qzhess)14 b(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))240 2608 y Fv(Compute)i(the)g(Hessen)o(b)q(erg-triangular)h(decomp)q (osition)g(of)f(the)g(matrix)f(p)q(encil)k Fr(\(a,)14 b(b\))p Fv(.)25 b(This)240 2670 y(function)16 b(returns)f Fr(aa)g(=)g(q)g(*)g(a)g(*)g(z)p Fv(,)g Fr(bb)g(=)g(q)g(*)g(b)g(*)g(z)p Fv(,)f Fr(q)p Fv(,)h Fr(z)g Fv(orthogonal.)k(F)l(or)c(example,)p eop %%Page: 81 83 81 82 bop 0 -58 a Fv(Chapter)15 b(8:)k(Linear)e(Algebra)1375 b(81)360 183 y Fr([aa,)23 b(bb,)h(q,)f(z])h(=)g(qzhess)f(\(a,)g(b\))240 258 y Fv(The)17 b(Hessen)o(b)q(erg-triangular)h(decomp)q(osition)h(is)e (the)g(\014rst)g(step)g(in)h(Moler)f(and)g(Stew)o(art's)f(QZ)240 320 y(decomp)q(osition)f(algorithm.)20 b(\(The)14 b(QZ)g(decomp)q (osition)h(will)h(b)q(e)f(included)h(in)f(a)f(later)g(release)g(of)240 382 y(Octa)o(v)o(e.\))240 457 y(Algorithm)i(tak)o(en)e(from)h(Golub)g (and)h(V)l(an)f(Loan,)g Fp(Matrix)g(Computations,)f(2nd)i(edition)p Fv(.)0 544 y Fr(qzval)e(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))240 607 y Fv(Compute)g(generalized)i(eigen)o(v)m(alues.)0 694 y Fr(syl)e(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)i Fp(c)s Fr(\))240 756 y Fv(Solv)o(e)g(the)f(Sylv)o(ester)h(equation)783 868 y Fo(AX)e Fv(+)c Fo(X)t(B)i Fv(+)f Fo(C)k Fv(=)e(0)240 980 y(using)j(standard)f(LAP)l(A)o(CK)h(subroutines.)p eop %%Page: 82 84 82 83 bop 0 -58 a Fv(82)1766 b(Octa)o(v)o(e)p eop %%Page: 83 85 83 84 bop 0 -58 a Fv(Chapter)15 b(9:)f(P)o(olynomial)i(Manipulations) 1157 b(83)0 183 y Fs(9)41 b(P)n(olynomial)12 b(Manipulations)62 321 y Fv(In)19 b(Octa)o(v)o(e,)e(a)g(p)q(olynomial)j(is)e(represen)o (ted)g(b)o(y)g(its)g(co)q(e\016cien)o(ts)g(\(arranged)f(in)h (descending)i(order\).)27 b(F)l(or)0 384 y(example,)16 b(a)f(v)o(ector)f Fp(c)k Fv(of)d(length)h Fp(n)p Fr(+)p Fp(1)i Fv(corresp)q(onds)e(to)e(the)i(follo)o(wing)g Fp(n)p Fv(-th)f(order)g(p)q(olynomial)674 499 y Fo(p)p Fv(\()p Fo(x)p Fv(\))d(=)h Fo(c)839 506 y Fk(1)857 499 y Fo(x)883 480 y Fn(n)916 499 y Fv(+)e Fo(:::)e Fv(+)h Fo(c)1075 506 y Fn(n)1097 499 y Fo(x)g Fv(+)h Fo(c)1199 506 y Fn(n)p Fk(+1)1263 499 y Fo(:)0 627 y Fr(compan)j(\()p Fp(c)s Fr(\))240 690 y Fv(Compute)h(the)g(companion)h(matrix)f(corresp) q(onding)h(to)f(p)q(olynomial)h(co)q(e\016cien)o(t)h(v)o(ector)d Fp(c)p Fv(.)240 765 y(The)h(companion)h(matrix)f(is)471 994 y Fo(A)d Fv(=)565 835 y Fh(2)565 908 y(6)565 933 y(6)565 958 y(6)565 983 y(6)565 1007 y(6)565 1032 y(6)565 1059 y(4)601 866 y Ft(\000)p Fo(c)656 873 y Fk(2)674 866 y Fo(=c)717 873 y Fk(1)781 866 y Ft(\000)p Fo(c)836 873 y Fk(3)854 866 y Fo(=c)897 873 y Fk(1)961 866 y Ft(\001)c(\001)g (\001)43 b(\000)p Fo(c)1114 873 y Fn(n)1137 866 y Fo(=c)1180 873 y Fk(1)1243 866 y Ft(\000)p Fo(c)1298 873 y Fn(n)p Fk(+1)1363 866 y Fo(=c)1406 873 y Fk(1)656 929 y Fv(1)158 b(0)101 b Ft(\001)8 b(\001)g(\001)101 b Fv(0)182 b(0)656 991 y(0)158 b(1)101 b Ft(\001)8 b(\001)g(\001)101 b Fv(0)182 b(0)662 1026 y(.)662 1042 y(.)662 1059 y(.)963 1030 y(.)981 1042 y(.)999 1055 y(.)1122 1026 y(.)1122 1042 y(.)1122 1059 y(.)1327 1026 y(.)1327 1042 y(.)1327 1059 y(.)656 1121 y(0)158 b(0)101 b Ft(\001)8 b(\001)g(\001)101 b Fv(1)182 b(0)1432 835 y Fh(3)1432 908 y(7)1432 933 y(7)1432 958 y(7)1432 983 y(7)1432 1007 y(7)1432 1032 y(7)1432 1059 y(5)1467 994 y Fo(:)240 1236 y Fv(The)15 b(eigen)o(v)m(alues)j(of) c(the)i(companion)f(matrix)g(are)g(equal)h(to)f(the)g(ro)q(ots)f(of)h (the)g(p)q(olynomial.)0 1325 y Fr(conv)g(\()p Fp(a)p Fr(,)f Fp(b)q Fr(\))240 1387 y Fv(Con)o(v)o(olv)o(e)h(t)o(w)o(o)f(v)o (ectors.)240 1463 y Fr(y)h(=)g(conv)g(\(a,)f(b\))j Fv(returns)g(a)f(v)o (ector)h(of)f(length)i(equal)f(to)g Fr(length)d(\(a\))h(+)g(length)f (\(b\))h(-)g(1)p Fv(.)25 b(If)240 1525 y Fp(a)14 b Fv(and)h Fp(b)h Fv(are)e(p)q(olynomial)i(co)q(e\016cien)o(t)f(v)o(ectors,)f Fr(conv)g Fv(returns)g(the)h(co)q(e\016cien)o(ts)g(of)f(the)h(pro)q (duct)240 1588 y(p)q(olynomial.)0 1677 y Fr(deconv)f(\()p Fp(y)p Fr(,)h Fp(a)p Fr(\))240 1739 y Fv(Decon)o(v)o(olv)o(e)g(t)o(w)o (o)f(v)o(ectors.)240 1815 y Fr([b,)h(r])g(=)g(deconv)f(\(y,)h(a\))g Fv(solv)o(es)g(for)f Fp(b)j Fv(and)e Fp(r)j Fv(suc)o(h)e(that)e Fr(y)h(=)g(conv)g(\(a,)g(b\))g(+)g(r)p Fv(.)240 1891 y(If)22 b Fp(y)k Fv(and)c Fp(a)f Fv(are)h(p)q(olynomial)h(co)q (e\016cien)o(t)g(v)o(ectors,)f Fp(b)h Fv(will)h(con)o(tain)e(the)g(co)q (e\016cien)o(ts)g(of)g(the)240 1953 y(p)q(olynomial)17 b(quotien)o(t)e(and)h Fp(r)i Fv(will)f(b)q(e)e(a)g(remander)h(p)q (olynomial)g(of)f(lo)o(w)o(est)g(order.)0 2042 y Fr(poly)g(\()p Fp(a)p Fr(\))58 b Fv(If)13 b Fp(a)g Fv(is)h(a)e(square)h Fp(n)p Fv(-b)o(y-)p Fp(n)h Fv(matrix,)f Fr(poly)i(\()p Fp(a)p Fr(\))d Fv(is)i(the)f(ro)o(w)f(v)o(ector)g(of)h(the)g(co)q (e\016cien)o(ts)h(of)f Fr(det)h(\(z)h(*)240 2104 y(eye)g(\(n\))f(-)h (a\))p Fv(,)g(the)g(c)o(haracteristic)g(p)q(olynomial)i(of)d Fp(a)p Fv(.)19 b(If)d Fp(x)i Fv(is)d(a)g(v)o(ector,)e Fr(poly)i(\()p Fp(x)s Fr(\))g Fv(is)g(a)g(v)o(ector)240 2167 y(of)g(co)q(e\016cien)o(ts)h(of)f(the)g(p)q(olynomial)i(whose)e (ro)q(ots)f(are)h(the)g(elemen)o(ts)h(of)f Fp(x)p Fv(.)0 2256 y Fr(polyderiv)f(\()p Fp(c)s Fr(\))240 2318 y Fv(Returns)g(the)g (co)q(e\016cien)o(ts)h(of)e(the)h(deriv)m(ativ)o(e)h(of)e(the)h(p)q (olynomial)h(whose)f(co)q(e\016cien)o(ts)g(are)f(giv)o(en)240 2380 y(b)o(y)i(v)o(ector)g Fp(c)p Fv(.)0 2470 y Fr(polyinteg)f(\()p Fp(c)s Fr(\))240 2532 y Fv(Returns)e(the)f(co)q(e\016cien)o(ts)g(of)g (the)g(in)o(tegral)g(the)g(p)q(olynomial)i(whose)e(co)q(e\016cien)o(ts) h(are)e(represen)o(ted)240 2594 y(b)o(y)15 b(the)g(v)o(ector)g Fp(c)p Fv(.)240 2670 y(The)g(constan)o(t)g(of)g(in)o(tegration)g(is)g (set)g(to)g(zero.)p eop %%Page: 84 86 84 85 bop 0 -58 a Fv(84)1766 b(Octa)o(v)o(e)0 183 y Fr(polyreduce)14 b(\()p Fp(c)s Fr(\))240 246 y Fv(Reduces)19 b(a)f(p)q(olynomial)h(co)q (e\016cien)o(t)g(v)o(ector)e(to)g(a)g(minim)o(um)i(n)o(um)o(b)q(er)f (of)f(terms)g(b)o(y)h(stripping)240 308 y(o\013)c(an)o(y)h(leading)i (zeros.)0 395 y Fr(polyval)d(\()p Fp(c)p Fr(,)h Fp(x)s Fr(\))240 457 y Fv(Ev)m(aluate)h(a)f(p)q(olynomial.)240 532 y Fr(polyval)f(\()p Fp(c)p Fr(,)h Fp(x)s Fr(\))g Fv(will)i(ev)m(aluate)f(the)g(p)q(olynomial)g(at)f(the)g(sp)q (eci\014ed)j(v)m(alue)e(of)f Fp(x)p Fv(.)240 606 y(If)g Fp(x)k Fv(is)c(a)g(v)o(ector)g(or)f(matrix,)h(the)g(p)q(olynomial)i(is) f(ev)m(aluated)g(at)f(eac)o(h)g(of)g(the)g(elemen)o(ts)h(of)f Fp(x)p Fv(.)0 694 y Fr(polyvalm)f(\()p Fp(c)p Fr(,)h Fp(x)s Fr(\))240 756 y Fv(Ev)m(aluate)h(a)f(p)q(olynomial)h(in)h(the)e (matrix)g(sense.)240 831 y Fr(polyvalm)f(\()p Fp(c)p Fr(,)h Fp(x)s Fr(\))i Fv(will)i(ev)m(aluate)e(the)g(p)q(olynomial)i(in) f(the)f(matrix)f(sense,)i(i.e.)25 b(matrix)17 b(m)o(ulti-)240 893 y(plication)g(is)f(used)f(instead)h(of)f(elemen)o(t)h(b)o(y)f (elemen)o(t)h(m)o(ultiplication)i(as)c(is)i(used)g(in)g(p)q(olyv)m(al.) 240 967 y(The)f(argumen)o(t)g Fp(x)j Fv(m)o(ust)d(b)q(e)h(a)e(square)i (matrix.)0 1055 y Fr(residue)e(\()p Fp(b)p Fr(,)h Fp(a)p Fr(,)g Fp(tol)r Fr(\))240 1117 y Fv(If)20 b Fp(b)h Fv(and)f Fp(a)g Fv(are)g(v)o(ectors)f(of)g(p)q(olynomial)j(co)q(e\016cien)o(ts,) f(then)f(residue)i(calculates)f(the)f(partial)240 1179 y(fraction)15 b(expansion)h(corresp)q(onding)g(to)f(the)g(ratio)g(of)g (the)g(t)o(w)o(o)f(p)q(olynomials.)240 1254 y(The)k(function)g Fr(residue)e Fv(returns)h Fp(r)p Fv(,)h Fp(p)p Fv(,)f Fp(k)p Fv(,)h(and)f Fp(e)p Fv(,)h(where)f(the)h(v)o(ector)f Fp(r)j Fv(con)o(tains)d(the)h(residue)240 1316 y(terms,)i Fp(p)h Fv(con)o(tains)f(the)g(p)q(ole)g(v)m(alues,)i Fp(k)g Fv(con)o(tains)e(the)g(co)q(e\016cien)o(ts)g(of)g(a)f(direct)h (p)q(olynomial)240 1378 y(term)c(\(if)i(it)f(exists\))g(and)g Fp(e)i Fv(is)f(a)e(v)o(ector)h(con)o(taining)g(the)g(p)q(o)o(w)o(ers)g (of)f(the)h(denominators)g(in)h(the)240 1441 y(partial)e(fraction)f (terms.)240 1515 y(Assuming)h Fp(b)g Fv(and)g Fp(a)f Fv(represen)o(t)g(p)q(olynomials)h Fo(P)6 b Fv(\()p Fo(s)p Fv(\))16 b(and)f Fo(Q)p Fv(\()p Fo(s)p Fv(\))g(w)o(e)g(ha)o(v)o(e:)613 1627 y Fo(P)6 b Fv(\()p Fo(s)p Fv(\))p 613 1648 93 2 v 613 1689 a Fo(Q)p Fv(\()p Fo(s)p Fv(\))723 1658 y(=)789 1605 y Fn(M)777 1618 y Fh(X)771 1706 y Fn(m)p Fk(=1)928 1627 y Fo(r)949 1634 y Fn(m)p 855 1648 199 2 v 855 1689 a Fv(\()p Fo(s)k Ft(\000)h Fo(p)973 1696 y Fn(m)1004 1689 y Fv(\))1022 1676 y Fn(e)1022 1701 y(m)1068 1658 y Fv(+)1130 1605 y Fn(N)1115 1618 y Fh(X)1114 1706 y Fn(n)p Fk(=1)1184 1658 y Fo(k)1208 1665 y Fn(n)1230 1658 y Fo(s)1251 1639 y Fn(N)s Fl(\000)p Fn(n)1329 1658 y Fo(:)240 1811 y Fv(where)18 b Fp(M)k Fv(is)c(the)g(n)o(um)o(b)q(er)g (of)f(p)q(oles)i(\(the)e(length)h(of)f(the)h Fp(r)p Fv(,)g Fp(p)p Fv(,)g(and)g Fp(e)i Fv(v)o(ectors\))c(and)i Fp(N)23 b Fv(is)18 b(the)240 1873 y(length)e(of)f(the)g Fp(k)j Fv(v)o(ector.)240 1948 y(The)d(argumen)o(t)f Fp(tol)j Fv(is)f(optional,)f(and)g(if)h(not)e(sp)q(eci\014ed,)j(a)e(default)g(v) m(alue)i(of)d(0.001)g(is)h(assumed.)240 2010 y(The)i(tolerance)g(v)m (alue)h(is)f(used)g(to)f(determine)h(whether)g(p)q(oles)h(with)f(small) g(imaginary)g(comp)q(o-)240 2072 y(nen)o(ts)h(are)g(declared)i(real.)29 b(It)18 b(is)h(also)f(used)h(to)f(determine)h(if)g(t)o(w)o(o)e(p)q (oles)i(are)f(distinct.)30 b(If)19 b(the)240 2135 y(ratio)12 b(of)h(the)g(imaginary)g(part)g(of)f(a)h(p)q(ole)h(to)e(the)h(real)g (part)f(is)i(less)f(than)g Fp(tol)p Fv(,)g(the)g(imaginary)h(part)240 2197 y(is)i(discarded.)21 b(If)15 b(t)o(w)o(o)f(p)q(oles)i(are)f (farther)g(apart)f(than)h Fp(tol)i Fv(they)e(are)g(distinct.)21 b(F)l(or)15 b(example,)240 2272 y(Example:)384 2334 y Fr(b)24 b(=)f([1,)h(1,)f(1];)384 2384 y(a)h(=)f([1,)h(-5,)f(8,)h(-4];) 384 2483 y([r,)f(p,)h(k,)f(e])h(=)g(residue)f(\(b,)g(a\))240 2558 y Fv(returns)360 2620 y Fr(r)h(=)f([-2,)h(7,)f(3])p eop %%Page: 85 87 85 86 bop 0 -58 a Fv(Chapter)15 b(9:)k(P)o(olynomial)d(Manipulations) 1152 b(85)360 183 y Fr(p)24 b(=)f([2,)h(2,)f(1])360 283 y(k)h(=)f([]\(0x0\))360 382 y(e)h(=)f([1,)h(2,)f(1])240 457 y Fv(whic)o(h)16 b(implies)h(the)f(follo)o(wing)g(partial)f (fraction)g(expansion)600 556 y Fo(s)621 540 y Fk(2)650 556 y Fv(+)c Fo(s)f Fv(+)h(1)p 530 576 337 2 v 530 618 a Fo(s)551 605 y Fk(3)580 618 y Ft(\000)f Fv(5)p Fo(s)669 605 y Fk(2)698 618 y Fv(+)h(8)p Fo(s)f Ft(\000)g Fv(4)883 587 y(=)957 556 y Ft(\000)p Fv(2)p 936 576 100 2 v 936 618 a Fo(s)h Ft(\000)f Fv(2)1051 587 y(+)1167 556 y(7)p 1102 576 154 2 v 1102 618 a(\()p Fo(s)g Ft(\000)g Fv(2\))1237 605 y Fk(2)1270 587 y Fv(+)1359 556 y(3)p 1321 576 100 2 v 1321 618 a Fo(s)g Ft(\000)g Fv(1)0 729 y Fr(roots)k(\()p Fp(v)t Fr(\))240 791 y Fv(F)l(or)h(a)f(v)o(ector)h Fp(v)k Fv(with)d Fp(n)f Fv(comp)q(onen)o(ts,)g(return)g(the)g(ro)q(ots)f(of)h (the)h(p)q(olynomial)717 903 y Fo(v)739 910 y Fk(1)758 903 y Fo(z)781 884 y Fn(n)p Fl(\000)p Fk(1)856 903 y Fv(+)10 b Ft(\001)e(\001)g(\001)h Fv(+)h Fo(v)1032 910 y Fn(n)p Fl(\000)p Fk(1)1097 903 y Fo(z)i Fv(+)f Fo(v)1198 910 y Fn(n)1220 903 y Fo(:)p eop %%Page: 86 88 86 87 bop 0 -58 a Fv(86)1766 b(Octa)o(v)o(e)p eop %%Page: 87 89 87 88 bop 0 -58 a Fv(Chapter)15 b(10:)k(Nonlinear)e(Equations)1242 b(87)0 183 y Fs(10)41 b(Nonlinear)14 b(Equations)62 316 y Fv(Octa)o(v)o(e)h(can)g(solv)o(e)h(sets)f(of)f(nonlinear)j(equations) f(of)e(the)i(form)889 428 y Fo(f)5 b Fv(\()p Fo(x)p Fv(\))12 b(=)h(0)0 561 y(using)j(the)f(function)h Fr(fsolve)p Fv(,)e(whic)o(h)i(is)g(based)f(on)h(the)f(MINP)l(A)o(CK)g(subroutine)i Fr(hybrd)p Fv(.)62 644 y(F)l(or)e(example,)g(to)g(solv)o(e)g(the)h(set) f(of)f(equations)678 752 y Ft(\000)p Fv(2)p Fo(x)762 733 y Fk(2)791 752 y Fv(+)d(3)p Fo(xy)g Fv(+)g(4)d(sin\()p Fo(y)r Fv(\))h Ft(\000)i Fv(6)h(=)h(0)688 827 y(3)p Fo(x)737 808 y Fk(2)765 827 y Ft(\000)e Fv(2)p Fo(xy)884 808 y Fk(2)912 827 y Fv(+)g(3)d(cos)o(\()p Fo(x)p Fv(\))h(+)i(4)h(=)h(0)0 952 y(y)o(ou)i(\014rst)g(need)h(to)e(write)i(a)e(function)i(to)f (compute)g(the)h(v)m(alue)g(of)f(the)g(giv)o(en)h(function.)21 b(F)l(or)14 b(example:)120 1023 y Fr(function)23 b(y)g(=)h(f)g(\(x\)) 168 1122 y(y\(1\))f(=)h(-2*x\(1\)^2)e(+)i(3*x\(1\)*x\(2\))70 b(+)24 b(4*sin\(x\(2\)\))e(-)i(6;)168 1172 y(y\(2\))f(=)48 b(3*x\(1\)^2)22 b(-)i(2*x\(1\)*x\(2\)^2)e(+)i(3*cos\(x\(1\)\))e(+)i(4;) 120 1272 y(endfunction)62 1355 y Fv(Then,)15 b(call)g Fr(fsolve)f Fv(with)g(a)g(sp)q(eci\014ed)j(initial)f(condition)g(to)d (\014nd)i(the)g(ro)q(ots)e(of)h(the)g(system)g(of)g(equations.)0 1417 y(F)l(or)h(example,)g(giv)o(en)h(the)f(function)h Fr(f)f Fv(de\014ned)i(ab)q(o)o(v)o(e,)120 1488 y Fr([x,)23 b(info])h(=)f(fsolve)g(\("f",)h([1;)f(2]\))0 1571 y Fv(results)16 b(in)g(the)f(solution)120 1641 y Fr(x)24 b(=)168 1741 y(0.57983)168 1791 y(2.54621)120 1890 y(info)f(=)h(1)62 1973 y Fv(A)16 b(v)m(alue)g(of)f Fr(info)f(=)h(1)g Fv(indicates)i(that) d(the)i(solution)g(has)f(con)o(v)o(erged.)62 2056 y(The)f(function)g Fr(perror)f Fv(ma)o(y)f(b)q(e)j(used)f(to)e(prin)o(t)i(English)h (messages)e(corresp)q(onding)h(to)f(the)g(n)o(umeric)i(error)0 2119 y(co)q(des.)20 b(F)l(or)15 b(example,)120 2189 y Fr(perror)23 b(\("fsolve",)g(1\))0 2272 y Fv(prin)o(ts)120 2343 y Fr(solution)g(converged)f(to)i(requested)f(tolerance)62 2426 y Fv(T)l(olerances)16 b(and)g(other)e(options)i(for)e Fr(fsolve)h Fv(ma)o(y)f(b)q(e)i(sp)q(eci\014ed)h(using)f(the)f (function)i Fr(fsolve_options)p Fv(.)p eop %%Page: 88 90 88 89 bop 0 -58 a Fv(88)1766 b(Octa)o(v)o(e)p eop %%Page: 89 91 89 90 bop 0 -58 a Fv(Chapter)15 b(11:)k(Di\013eren)o(tial)d(Equations) 1214 b(89)0 183 y Fs(11)41 b(Di\013eren)n(tial)13 b(Equations)62 332 y Fv(Octa)o(v)o(e)j(has)g(t)o(w)o(o)f(built-in)k(functions)e(for)f (solving)h(di\013eren)o(tial)g(equations.)24 b(Both)16 b(are)g(based)h(on)f(reliable)0 394 y(ODE)f(solv)o(ers)g(written)g(in)i (F)l(ortran.)0 540 y Fu(11.1)32 b(Ordinary)17 b(Di\013eren)n(tial)g (Equations)62 647 y Fv(The)f(function)g Fr(lsode)e Fv(can)i(b)q(e)f (used)h(Solv)o(e)g(ODEs)f(of)g(the)g(form)857 743 y Fo(dx)p 857 763 50 2 v 862 805 a(dt)925 774 y Fv(=)e Fo(f)5 b Fv(\()p Fo(x;)j(t)p Fv(\))0 925 y(using)16 b(Hindmarsh's)f(ODE)h(solv)o (er)f(LSODE.)120 999 y Fr(lsode)23 b(\()p Fp(fcn)p Fr(,)h Fp(x0)p Fr(,)g Fp(t)p 510 999 14 2 v 16 w(out)p Fr(,)f Fp(t)p 657 999 V 16 w(crit)q Fr(\))62 1085 y Fv(The)14 b(\014rst)f(argumen)o(t)g(is)h(the)f(name)h(of)f(the)g(function)h(to)f (call)i(to)e(compute)g(the)h(v)o(ector)e(of)h(righ)o(t)h(hand)f(sides.) 0 1147 y(It)i(m)o(ust)g(ha)o(v)o(e)g(the)g(form)120 1221 y Fp(xdot)24 b Fr(=)g(f)g(\()p Fp(x)p Fr(,)g Fp(t)q Fr(\))0 1307 y Fv(where)15 b Fp(xdot)h Fv(and)g Fp(x)i Fv(are)d(v)o(ectors)f (and)i Fp(t)f Fv(is)h(a)f(scalar.)62 1393 y(The)j(second)g(argumen)o(t) e(sp)q(eci\014es)j(the)f(initial)h(condition,)g(and)e(the)h(third)g(sp) q(eci\014es)h(a)e(v)o(ector)f(of)h(output)0 1455 y(times)e(at)g(whic)o (h)h(the)f(solution)h(is)g(desired,)g(including)i(the)d(time)h(corresp) q(onding)g(to)f(the)g(initial)i(condition.)62 1542 y(The)d(fourth)f (argumen)o(t)g(is)h(optional,)g(and)g(ma)o(y)f(b)q(e)h(used)g(to)f(sp)q (ecify)i(a)e(set)g(of)g(times)h(that)f(the)g(ODE)h(solv)o(er)0 1604 y(should)k(not)e(in)o(tegrate)h(past.)24 b(It)17 b(is)h(useful)g(for)e(a)o(v)o(oiding)h(di\016culties)i(with)e (singularities)i(and)e(p)q(oin)o(ts)h(where)0 1666 y(there)d(is)h(a)f (discon)o(tin)o(uit)o(y)h(in)g(the)g(deriv)m(ativ)o(e.)62 1752 y(T)l(olerances)g(and)g(other)e(options)i(for)e Fr(lsode)h Fv(ma)o(y)f(b)q(e)i(sp)q(eci\014ed)h(using)f(the)g(function) g Fr(lsode_options)p Fv(.)62 1839 y(Here)g(is)f(an)h(example)g(of)e (solving)i(a)f(set)g(of)g(t)o(w)o(o)f(di\013eren)o(tial)i(equations)g (using)g Fr(lsode)p Fv(.)j(The)c(function)120 1912 y Fr(function)23 b(xdot)g(=)h(f)g(\(x,)f(t\))168 2012 y(r)g(=)h(0.25;)168 2062 y(k)f(=)h(1.4;)168 2112 y(a)f(=)h(1.5;)168 2161 y(b)f(=)h(0.16;)168 2211 y(c)f(=)h(0.9;)168 2261 y(d)f(=)h(0.8;)168 2361 y(xdot\(1\))f(=)g(r*x\(1\)*\(1)g(-)h(x\(1\)/k\))f(-)g (a*x\(1\)*x\(2\)/\(1)f(+)i(b*x\(1\)\);)168 2410 y(xdot\(2\))f(=)g (c*a*x\(1\)*x\(2\)/\(1)f(+)i(b*x\(1\)\))f(-)g(d*x\(2\);)120 2510 y(endfunction)0 2596 y Fv(is)16 b(in)o(tegrated)f(with)g(the)h (command)120 2670 y Fr(x)24 b(=)f(lsode)h(\("f",)f([1;)g(2],)h(\(t)f(=) h(linspace)f(\(0,)g(50,)h(200\)'\)\);)p eop %%Page: 90 92 90 91 bop 0 -58 a Fv(90)1766 b(Octa)o(v)o(e)0 183 y(pro)q(ducing)18 b(a)d(set)h(of)g(200)f(v)m(alues)j(stored)e(in)h(the)f(v)m(ariable)h Fp(x)p Fv(.)23 b(Note)16 b(that)g(this)g(example)h(tak)o(es)f(adv)m(an) o(tage)f(of)0 246 y(the)f(fact)f(that)g(an)g(assignmen)o(t)h(pro)q (duces)g(a)g(v)m(alue)h(to)e(store)g(the)g(v)m(alues)i(of)e(the)h (output)f(times)h(in)h(the)f(v)m(ariable)0 308 y Fp(t)i Fv(directly)g(in)g(the)g(function)g(call)g(The)f(results)h(can)f(then)h (b)q(e)g(plotted)f(using)h(the)g(command)120 378 y Fr(plot)23 b(\(t,)h(x\))62 461 y Fv(See)18 b(Alan)g(C.)f(Hindmarsh,)h Fp(ODEP)l(A)o(CK,)f(A)g(Systematized)h(Collection)h(of)e(ODE)g(Solv)o (ers)p Fv(,)h(in)g(Scien)o(ti\014c)0 524 y(Computing,)13 b(R.)g(S.)f(Stepleman,)i(editor,)f(\(1983\))e(for)h(more)g(information) h(ab)q(out)f(this)h(family)h(of)e(ODE)g(solv)o(ers.)0 656 y Fu(11.2)32 b(Di\013eren)n(tial-Algebrai)q(c)18 b(Equations)62 760 y Fv(The)e(function)g Fr(dassl)e Fv(can)i(b)q(e)f (used)h(Solv)o(e)g(D)o(AEs)e(of)h(the)g(form)516 872 y(0)d(=)h Fo(f)5 b Fv(\()i(_)-20 b Fo(x;)8 b(x;)g(t)p Fv(\))p Fo(;)96 b(x)p Fv(\()p Fo(t)13 b Fv(=)g(0\))f(=)h Fo(x)1129 879 y Fk(0)1148 872 y Fo(;)h Fv(_)-19 b Fo(x)o Fv(\()p Fo(t)13 b Fv(=)g(0\))f(=)19 b(_)-19 b Fo(x)1416 879 y Fk(0)120 972 y Fr(dassl)23 b(\()p Fp(fcn)p Fr(,)h Fp(x)p 421 972 14 2 v 16 w(0)p Fr(,)g Fp(xdot)p 598 972 V 16 w(0)p Fr(,)f Fp(t)p 702 972 V 16 w(out)p Fr(,)h Fp(t)p 850 972 V 16 w(crit)q Fr(\))62 1055 y Fv(The)19 b(\014rst)f(argumen)o(t)f(is)i(the)f(name)h(of)f(the)g(function)h(to)f (call)h(to)f(compute)g(the)h(v)o(ector)f(of)f(residuals.)31 b(It)0 1117 y(m)o(ust)15 b(ha)o(v)o(e)f(the)i(form)120 1188 y Fp(res)26 b Fr(=)d(f)h(\()p Fp(x)p Fr(,)g Fp(xdot)p Fr(,)f Fp(t)q Fr(\))0 1271 y Fv(where)15 b Fp(x)p Fv(,)g Fp(xdot)p Fv(,)g(and)g Fp(res)i Fv(are)e(v)o(ectors,)f(and)h Fp(t)h Fv(is)g(a)f(scalar.)62 1354 y(The)j(second)g(and)f(third)h (argumen)o(ts)f(to)g Fr(dassl)f Fv(sp)q(ecify)j(the)f(initial)h (condition)g(of)e(the)g(states)g(and)g(their)0 1416 y(deriv)m(ativ)o (es,)k(and)f(the)f(fourth)g(argumen)o(t)g(sp)q(eci\014es)i(a)e(v)o (ector)g(of)g(output)g(times)h(at)f(whic)o(h)h(the)f(solution)h(is)0 1478 y(desired,)c(including)i(the)d(time)h(corresp)q(onding)g(to)f(the) g(initial)i(condition.)62 1561 y(The)h(set)f(of)f(initial)j(states)e (and)g(deriv)m(ativ)o(es)h(are)f(not)g(strictly)h(required)g(to)e(b)q (e)i(consisten)o(t.)26 b(In)18 b(practice,)0 1624 y(ho)o(w)o(ev)o(er,) 13 b(D)o(ASSL)h(is)g(not)f(v)o(ery)g(go)q(o)q(d)g(at)g(determining)i(a) e(consisten)o(t)h(set)f(for)g(y)o(ou,)g(so)h(it)f(is)h(b)q(est)g(if)g (y)o(ou)f(ensure)0 1686 y(that)h(the)i(initial)h(v)m(alues)f(result)g (in)g(the)f(function)h(ev)m(aluating)h(to)d(zero.)62 1769 y(The)i(\014fth)g(argumen)o(t)g(is)g(optional,)g(and)g(ma)o(y)g(b) q(e)g(used)h(to)e(sp)q(ecify)i(a)f(set)g(of)f(times)h(that)g(the)g(D)o (AE)f(solv)o(er)0 1831 y(should)j(not)e(in)o(tegrate)h(past.)24 b(It)17 b(is)h(useful)g(for)e(a)o(v)o(oiding)h(di\016culties)i(with)e (singularities)i(and)e(p)q(oin)o(ts)h(where)0 1893 y(there)d(is)h(a)f (discon)o(tin)o(uit)o(y)h(in)g(the)g(deriv)m(ativ)o(e.)62 1977 y(T)l(olerances)g(and)g(other)e(options)i(for)e Fr(dassl)h Fv(ma)o(y)f(b)q(e)i(sp)q(eci\014ed)h(using)f(the)g(function) g Fr(dassl_options)p Fv(.)62 2060 y(See)g(K.)e(E.)h(Brenan,)g(et)f (al.,)h Fp(Numerical)h(Solution)g(of)e(Initial-V)l(alue)k(Problems)d (in)h(Di\013eren)o(tial-Algebraic)0 2122 y(Equations)p Fv(,)f(North-Holland)h(\(1989\))d(for)i(more)g(information)g(ab)q(out)g (the)g(implemen)o(tation)i(of)e(D)o(ASSL.)p eop %%Page: 91 93 91 92 bop 0 -58 a Fv(Chapter)15 b(12:)k(Optimization)1389 b(91)0 183 y Fs(12)41 b(Optimization)0 350 y Fu(12.1)32 b(Quadratic)16 b(Programm)o(ing)0 464 y Fr(qpsol)360 524 y([x,)23 b(obj,)h(info,)f(lambda])432 573 y(=)g(qpsol)g(\(x,)h(H,)g (c,)f(lb,)h(ub,)f(lb,)g(A,)h(ub\))240 645 y Fv(Solv)o(e)d(quadratic)g (programs)e(using)j(Gill)g(and)f(Murra)o(y's)e(QPSOL.)i(Because)g (QPSOL)h(is)f(not)240 708 y(freely)g(redistributable,)j(this)d (function)g(is)g(only)g(a)o(v)m(ailable)i(if)e(y)o(ou)f(ha)o(v)o(e)g (obtained)h(y)o(our)f(o)o(wn)240 770 y(cop)o(y)15 b(of)g(QPSOL.)h(See)g (App)q(endix)h(A)e([Installation],)h(page)f(161.)62 863 y(T)l(olerances)h(and)g(other)e(options)i(for)e Fr(qpsol)h Fv(ma)o(y)f(b)q(e)i(sp)q(eci\014ed)h(using)f(the)g(function)g Fr(qpsol_options)p Fv(.)0 991 y Fu(12.2)32 b(Nonlinear)16 b(Programm)o(ing)0 1104 y Fr(npsol)360 1164 y([x,)23 b(obj,)h(info,)f(lambda])432 1214 y(=)g(npsol)g(\(x,)h('phi',)f(lb,)g (ub,)h(lb,)f(A,)h(ub,)f(lb,)h('g',)f(ub\))240 1286 y Fv(Solv)o(e)f(nonlinear)g(programs)e(using)i(Gill)h(and)e(Murra)o(y's)f (NPSOL.)i(Because)f(NPSOL)i(is)e(not)240 1348 y(freely)g (redistributable,)j(this)d(function)g(is)g(only)g(a)o(v)m(ailable)i(if) e(y)o(ou)f(ha)o(v)o(e)g(obtained)h(y)o(our)f(o)o(wn)240 1410 y(cop)o(y)15 b(of)g(NPSOL.)h(See)f(App)q(endix)j(A)d ([Installation],)g(page)g(161.)240 1482 y(The)g(second)h(argumen)o(t)e (is)h(a)g(string)f(con)o(taining)i(the)f(name)g(of)f(the)h(ob)s(jectiv) o(e)g(function)h(to)e(call.)240 1545 y(The)h(ob)s(jectiv)o(e)h (function)g(m)o(ust)e(b)q(e)i(of)f(the)g(form)360 1604 y Fr(y)24 b(=)f(phi)h(\(x\))240 1676 y Fv(where)15 b(x)h(is)f(a)g(v)o (ector)g(and)g(y)g(is)h(a)f(scalar.)62 1769 y(T)l(olerances)h(and)g (other)e(options)i(for)e Fr(npsol)h Fv(ma)o(y)f(b)q(e)i(sp)q(eci\014ed) h(using)f(the)g(function)g Fr(npsol_options)p Fv(.)0 1897 y Fu(12.3)32 b(Linear)17 b(Least)d(Squares)0 2011 y Fr(gls)h(\()p Fp(Y)p Fr(,)g Fp(X)p Fr(,)g Fp(O)r Fr(\))240 2073 y Fv(Generalized)i(least)e(squares)g(\(GLS\))g(estimation)h(for)e (the)h(m)o(ultiv)m(ariate)i(mo)q(del)360 2132 y Fr(Y)24 b(=)f(X)h(*)g(B)g(+)f(E,)48 b(mean\(E\))23 b(=)g(0,)48 b(cov\(vec\(E\)\))22 b(=)i(\(s^2\)*O)240 2205 y Fv(with)360 2264 y Fr(Y)g(an)f(T)h(x)g(p)f(matrix)360 2314 y(X)h(an)f(T)h(x)g(k)f (matrix)360 2364 y(B)h(an)f(k)h(x)g(p)f(matrix)360 2414 y(E)h(an)f(T)h(x)g(p)f(matrix)360 2464 y(O)h(an)f(Tp)h(x)g(Tp)f(matrix) 240 2536 y Fv(Eac)o(h)15 b(ro)o(w)f(of)h(Y)g(and)h(X)f(is)h(an)f (observ)m(ation)g(and)h(eac)o(h)f(column)h(a)f(v)m(ariable.)240 2608 y(Returns)21 b(BET)l(A,)f(v,)h(and,)g(R,)g(where)f(BET)l(A)h(is)f (the)h(GLS)f(estimator)g(for)f(B,)h(v)h(is)f(the)h(GLS)240 2670 y(estimator)14 b(for)h(s)p Fr(^)p Fv(2,)f(and)i(R)f(=)h(Y)f(-)g (X*BET)l(A)h(is)f(the)h(matrix)e(of)h(GLS)h(residuals.)p eop %%Page: 92 94 92 93 bop 0 -58 a Fv(92)1766 b(Octa)o(v)o(e)0 183 y Fr(ols)15 b(\()p Fp(Y)p Fr(,)g Fp(X)5 b Fr(\))240 246 y Fv(Ordinary)16 b(Least)f(Squares)g(\(OLS\))h(estimation)f(for)g(the)g(m)o(ultiv)m (ariate)h(mo)q(del)360 308 y Fr(Y)24 b(=)f(X*B)h(+)g(E,)47 b(mean)23 b(\(E\))h(=)g(0,)47 b(cov)23 b(\(vec)h(\(E\)\))f(=)h(kron)f (\(S,)h(I\))240 382 y Fv(with)360 445 y Fr(Y)g(an)f(T)h(x)g(p)f(matrix) 360 495 y(X)h(an)f(T)h(x)g(k)f(matrix)360 544 y(B)h(an)f(k)h(x)g(p)f (matrix)360 594 y(E)h(an)f(T)h(x)g(p)f(matrix)240 669 y Fv(Eac)o(h)15 b(ro)o(w)f(of)h(Y)g(and)h(X)f(is)h(an)f(observ)m(ation) g(and)h(eac)o(h)f(column)h(a)f(v)m(ariable.)240 744 y(Returns)h(BET)l (A,)f(SIGMA,)g(and)g(R,)g(where)h(BET)l(A)f(is)h(the)f(OLS)h(estimator) f(for)f(B,)h(i.e.)360 806 y Fr(BETA)23 b(=)h(pinv\(X\)*Y,)240 881 y Fv(where)18 b(pin)o(v\(X\))g(denotes)g(the)g(pseudoin)o(v)o(erse) h(of)e(X,)g(SIGMA)h(is)g(the)g(OLS)h(estimator)e(for)g(the)240 943 y(matrix)e(S,)g(i.e.)360 1005 y Fr(SIGMA)23 b(=)h(\(Y)f(-)h (X*BETA\)'*\(Y)f(-)g(X*BETA\))g(/)h(\(T)g(-)f(rank\(X\)\))240 1080 y Fv(and)15 b(R)h(=)g(Y)f(-)g(X*BET)l(A)g(is)h(the)f(matrix)g(of)g (OLS)h(residuals.)p eop %%Page: 93 95 93 94 bop 0 -58 a Fv(Chapter)15 b(13:)k(Quadrature)1420 b(93)0 183 y Fs(13)41 b(Quadrature)0 366 y Fu(13.1)32 b(F)-6 b(unctions)17 b(of)d(one)h(V)-6 b(ariable)0 482 y Fr(quad)360 544 y([v,)23 b(ier,)h(nfun])f(=)h(quad)f(\("f",)g(a,)h (b\))360 594 y([v,)f(ier,)h(nfun])f(=)h(quad)f(\("f",)g(a,)h(b,)f (tol\))360 644 y([v,)g(ier,)h(nfun])f(=)h(quad)f(\("f",)g(a,)h(b,)f (tol,)h(sing\))240 719 y Fv(In)o(tegrate)15 b(a)f(nonlinear)j(function) f(of)f(one)g(v)m(ariable)i(using)f(Quadpac)o(k.)240 793 y(Where)h(the)g(\014rst)f(argumen)o(t)g(is)h(the)g(name)g(of)f(the)h (function)h(to)e(call)i(to)e(compute)h(the)f(v)m(alue)i(of)240 856 y(the)d(in)o(tegrand.)20 b(It)c(m)o(ust)e(ha)o(v)o(e)h(the)g(form) 360 918 y Fr(y)24 b(=)f(f)h(\(x\))240 993 y Fv(where)15 b(y)h(and)f(x)g(are)g(scalars.)240 1067 y(The)22 b(second)g(and)g (third)g(argumen)o(ts)e(are)i(limits)h(of)e(in)o(tegration.)39 b(Either)22 b(or)f(b)q(oth)g(ma)o(y)g(b)q(e)240 1130 y(in\014nite.)31 b(The)18 b(optional)h(argumen)o(t)e(tol)h(sp)q (eci\014es)i(the)e(desired)i(accuracy)e(of)f(the)i(result.)29 b(The)240 1192 y(optional)16 b(argumen)o(t)e Fp(sing)20 b Fv(is)15 b(a)g(v)o(ector)g(of)g(v)m(alues)h(at)f(whic)o(h)h(the)f(in) o(tegrand)g(is)h(singular.)240 1267 y(T)l(olerances)24 b(and)g(other)f(options)h(for)f Fr(quad)g Fv(ma)o(y)g(b)q(e)h(sp)q (eci\014ed)i(using)f(the)e(function)i Fr(quad_)240 1329 y(options)p Fv(.)0 1462 y Fu(13.2)32 b(Orthogonal)15 b(Collo)r(cation)0 1578 y Fr(colloc)360 1640 y([r,)23 b(A,)h(B,)g(q])f(=)h(colloc)f(\(n\))360 1690 y([r,)g(A,)h(B,)g(q])f(=)h (colloc)f(\(n,)g("left"\))360 1740 y([r,)g(A,)h(B,)g(q])f(=)h(colloc)f (\(n,)g("left",)g("right"\))240 1815 y Fv(Compute)17 b(deriv)m(ativ)o(e)h(and)f(in)o(tegral)g(w)o(eigh)o(t)g(matrices)g(for) f(orthogonal)g(collo)q(cation)i(using)g(the)240 1877 y(subroutines)13 b(giv)o(en)f(in)h(J.)e(Mic)o(helsen)j(and)e(M.)f(L.)h (Villadsen,)i Fp(Solution)f(of)e(Di\013eren)o(tial)i(Equation)240 1939 y(Mo)q(dels)j(b)o(y)f(P)o(olynomial)h(Appro)o(ximation)p Fv(.)p eop %%Page: 94 96 94 95 bop 0 -58 a Fv(94)1766 b(Octa)o(v)o(e)p eop %%Page: 95 97 95 96 bop 0 -58 a Fv(Chapter)15 b(14:)k(Con)o(trol)c(Theory)1341 b(95)0 183 y Fs(14)41 b(Con)n(trol)16 b(Theory)0 328 y Fr(abcddim)e(\()p Fp(a)p Fr(,)h Fp(b)p Fr(,)g Fp(c)p Fr(,)g Fp(d)r Fr(\))240 391 y Fv(Chec)o(k)k(for)e(compatibilit)o(y)k (of)d(the)g(dimensions)i(of)e(the)h(matrices)f(de\014ning)i(the)f (linear)g(system)240 453 y([A,)14 b(B,)h(C,)g(D])g(corresp)q(onding)h (to)831 550 y Fo(dx)p 831 571 50 2 v 836 612 a(dt)898 581 y Fv(=)d Fo(Ax)d Fv(+)h Fo(B)r(u)842 693 y(y)j Fv(=)f Fo(C)s(x)d Fv(+)g Fo(D)q(u)240 784 y Fv(or)15 b(a)g(similar)h (discrete-time)h(system.)240 859 y(If)22 b(the)g(matrices)g(are)g (compatibly)h(dimensioned,)i(then)e Fr(abcddim)e Fv(returns)h Fp(n)g Fv(=)g(n)o(um)o(b)q(er)g(of)240 921 y(system)e(states,)h Fp(m)g Fv(=)g(n)o(um)o(b)q(er)g(of)f(system)h(inputs,)h(and)f Fp(p)i Fv(=)e(n)o(um)o(b)q(er)g(of)f(system)h(outputs.)240 983 y(Otherwise)16 b Fr(abcddim)e Fv(returns)h Fp(n)h Fv(=)f Fp(m)g Fv(=)h Fp(p)h Fv(=)e Ft(\000)p Fv(1.)0 1070 y Fr(are)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)i Fp(c)p Fr(,)f Fp(opt)q Fr(\))240 1133 y Fv(Returns)h(the)f(solution,)h Fp(x)p Fv(,)e(of)h(the)g(algebraic)h(Riccati)h(equation)360 1195 y Fr(a')24 b(x)f(+)h(x)g(a)f(-)h(x)g(b)g(x)f(+)h(c)g(=)g(0)240 1270 y Fv(for)18 b(iden)o(tically)k(dimensioned)f(square)e(matrices)g Fp(a)p Fv(,)h Fp(b)p Fv(,)g Fp(c)p Fv(.)31 b(If)20 b Fp(b)g Fv(\()p Fp(c)s Fv(\))f(is)g(not)g(square,)g(then)h(the)240 1332 y(function)c(attempts)e(to)h(use)g Fp(b)q Fr(*)p Fp(b)q Fr(')h Fv(\()p Fp(c)s Fr('*)p Fp(c)s Fv(\))e(instead.)240 1407 y(Solution)h(metho)q(d:)20 b(apply)15 b(Laub's)f(Sc)o(h)o(ur)g (metho)q(d)g(\(IEEE)g(T)l(ransactions)g(on)g(Automatic)g(Con-)240 1469 y(trol,)h(1979\))e(to)i(the)g(appropriate)g(Hamiltonian)i(matrix.) 240 1544 y Fp(opt)f Fv(is)g(an)f(option)g(passed)g(to)g(the)g(eigen)o (v)m(alue)j(balancing)e(routine.)k(Default)c(is)f Fr("B")p Fv(.)0 1631 y Fr(c2d)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)i Fp(t)q Fr(\))240 1693 y Fv(Con)o(v)o(erts)e(the)h(con)o(tin)o(uous)h (time)f(system)g(describ)q(ed)i(b)o(y:)831 1788 y Fo(dx)p 831 1808 V 836 1850 a(dt)898 1819 y Fv(=)c Fo(Ax)d Fv(+)h Fo(B)r(u)240 1936 y Fv(in)o(to)k(a)g(discrete)h(time)g(equiv)m(alen)o (t)h(mo)q(del)773 2048 y Fo(x)799 2055 y Fn(k)q Fk(+1)874 2048 y Fv(=)c Fo(A)956 2055 y Fn(d)975 2048 y Fo(x)1001 2055 y Fn(k)1032 2048 y Fv(+)d Fo(B)1111 2055 y Fn(d)1131 2048 y Fo(u)1157 2055 y Fn(k)240 2172 y Fv(via)k(the)g(matrix)f(exp)q (onen)o(tial)i(assuming)f(a)f(zero-order)h(hold)g(on)f(the)h(input)h (and)f(sample)g(time)g Fp(t)p Fv(.)0 2259 y Fr(dare)h(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)h Fp(c)p Fr(,)h Fp(r)p Fr(,)f Fp(opt)q Fr(\))240 2321 y Fv(Returns)h(the)f(solution,)h Fp(x)i Fv(of)d(the)g(discrete-time)i(algebraic)f(Riccati)g(equation)360 2384 y Fr(a')24 b(x)f(a)h(-)g(x)f(+)h(a')g(x)g(b)f(\(r)h(+)g(b')f(x)h (b\)^\(-1\))f(b')g(x)h(a)g(+)g(c)f(=)h(0)240 2458 y Fv(for)15 b(matrices)g(with)g(dimensions:)360 2521 y Fp(a)p Fr(:)23 b Fp(n)i Fr(by)e Fp(n)360 2570 y(b)q Fr(:)h Fp(n)g Fr(by)g Fp(m)360 2620 y(c)s Fr(:)g Fp(n)g Fr(by)f Fp(n)p Fr(,)h(symmetric)f (positive)g(semidefinite)360 2670 y Fp(r)s Fr(:)h Fp(m)g Fr(by)f Fp(m)p Fr(,)h(symmetric)e(positive)h(definite)g(\(invertible\)) p eop %%Page: 96 98 96 97 bop 0 -58 a Fv(96)1766 b(Octa)o(v)o(e)240 183 y(If)15 b Fp(c)k Fv(is)c(not)g(square,)g(then)g(the)h(function)g(attempts)e(to) g(use)i Fp(c)s Fr('*)p Fp(c)i Fv(instead.)240 258 y(Solution)j(metho)q (d:)30 b(Laub's)20 b(Sc)o(h)o(ur)g(metho)q(d)g(\(IEEE)g(T)l (ransactions)f(on)h(Automatic)g(Con)o(trol,)240 321 y(1979\))14 b(is)h(applied)j(to)c(the)h(appropriate)h(symplectic)g(matrix.)240 396 y(See)h(also:)22 b(Ran)17 b(and)g(Ro)q(dman,)g Fp(Stable)g (Hermitian)g(Solutions)h(of)e(Discrete)h(Algebraic)g(Riccati)240 458 y(Equations)p Fv(,)d(Mathematics)f(of)g(Con)o(trol,)g(Signals)h (and)g(Systems,)f(V)l(olume)i(5,)e(Num)o(b)q(er)h(2)f(\(1992\).)240 533 y Fp(opt)j Fv(is)g(an)f(option)g(passed)g(to)g(the)g(eigen)o(v)m (alue)j(balancing)e(routine.)k(The)c(default)g(is)f Fr("B")p Fv(.)0 621 y Fr(dgram)f(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))240 683 y Fv(Returns)22 b(the)g(discrete)g(con)o(trollabilit)o(y)i(and)e (observ)m(abilit)o(y)h(gramian)e(for)g(the)h(discrete)h(time)240 746 y(system)15 b(describ)q(ed)i(b)o(y)791 809 y Fo(x)817 816 y Fn(k)q Fk(+1)892 809 y Fv(=)c Fo(Ax)1000 816 y Fn(k)1030 809 y Fv(+)e Fo(B)r(u)1138 816 y Fn(k)812 903 y Fo(y)834 910 y Fn(k)867 903 y Fv(=)i Fo(C)s(x)977 910 y Fn(k)1007 903 y Fv(+)e Fo(D)q(u)1118 910 y Fn(k)240 1008 y Fr(dgram)j(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))g Fv(returns)f(the)g (discrete)h(con)o(trollabilit)o(y)h(gramian)f(and)f Fr(dgram)h(\()p Fp(a)p Fr(',)f Fp(c)s Fr('\))g Fv(returns)240 1070 y(the)h(observ)m (abilit)o(y)i(gramian.)0 1158 y Fr(dlqe)e(\()p Fp(a)p Fr(,)f Fp(g)p Fr(,)h Fp(c)p Fr(,)g Fp(sigw)p Fr(,)g Fp(sigv)20 b Fr([,)14 b Fp(z)s Fr(]\))240 1221 y Fv(Linear)i(quadratic)g (estimator)e(\(Kalman)h(\014lter\))h(design)g(for)e(the)i(discrete)g (time)f(system)719 1334 y Fo(x)745 1341 y Fn(k)q Fk(+1)820 1334 y Fv(=)e Fo(Ax)928 1341 y Fn(k)958 1334 y Fv(+)e Fo(B)r(u)1066 1341 y Fn(k)1097 1334 y Fv(+)g Fo(Gw)1212 1341 y Fn(k)758 1448 y Fo(y)780 1455 y Fn(k)813 1448 y Fv(=)i Fo(C)s(x)923 1455 y Fn(k)953 1448 y Fv(+)e Fo(D)q(u)1064 1455 y Fn(k)1094 1448 y Fv(+)f Fo(w)1172 1455 y Fn(k)240 1541 y Fv(where)18 b Fp(w)p Fv(,)g Fp(v)k Fv(are)c(zero-mean)g (gaussian)g(noise)h(pro)q(cesses)f(with)g(resp)q(ectiv)o(e)h(in)o (tensities)h Fp(sigw)f Fr(=)240 1603 y(cov)c(\()p Fp(w)p Fr(,)f Fp(w)t Fr(\))h Fv(and)h Fp(sigv)j Fr(=)c(cov)g(\()p Fp(v)p Fr(,)g Fp(v)t Fr(\))p Fv(.)240 1678 y(If)g(sp)q(eci\014ed,)i Fp(z)h Fv(is)e Fr(cov)f(\()p Fp(w)p Fr(,)f Fp(v)t Fr(\))p Fv(.)20 b(Otherwise)c Fr(cov)f(\()p Fp(w)p Fr(,)f Fp(v)t Fr(\))h(=)g(0)p Fv(.)240 1753 y(The)g(observ)o(er)g(structure)g(is)579 1867 y Fo(z)600 1874 y Fn(k)q Fk(+1)676 1867 y Fv(=)e Fo(Az)779 1874 y Fn(k)809 1867 y Fv(+)e Fo(B)r(u)917 1874 y Fn(k)948 1867 y Fv(+)g Fo(k)q Fv(\()p Fo(y)1059 1874 y Fn(k)1089 1867 y Ft(\000)g Fo(C)s(z)1192 1874 y Fn(k)1222 1867 y Ft(\000)g Fo(D)q(u)1333 1874 y Fn(k)1353 1867 y Fv(\))240 1993 y(Returns:)240 2068 y Fp(l)18 b Fv(is)d(the)h(observ)o(er)e(gain,)h Fr(\(A)g(-)g(A)g(L)g(C\))g Fv(is)h(stable.)240 2143 y Fp(m)f Fv(is)h(the)f(Ricatti)h(equation)g (solution.)240 2218 y Fp(p)h Fv(is)e(the)h(estimate)f(error)f(co)o(v)m (ariance)i(after)f(the)g(measuremen)o(t)g(up)q(date.)240 2293 y Fp(e)j Fv(are)d(the)g(closed)h(lo)q(op)g(p)q(oles)g(of)f Fr(\(A)g(-)g(A)g(L)g(C\))p Fv(.)0 2381 y Fr(dlqr)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)h Fp(q)p Fr(,)g Fp(r)k Fr([,)c Fp(z)s Fr(]\))240 2443 y Fv(Linear)h(quadratic)g(regulator)e(design)i (for)f(the)g(discrete)h(time)g(system)791 2557 y Fo(x)817 2564 y Fn(k)q Fk(+1)892 2557 y Fv(=)d Fo(Ax)1000 2564 y Fn(k)1030 2557 y Fv(+)e Fo(B)r(u)1138 2564 y Fn(k)240 2670 y Fv(to)k(minimize)i(the)e(cost)g(functional)p eop %%Page: 97 99 97 98 bop 0 -58 a Fv(Chapter)15 b(14:)k(Con)o(trol)c(Theory)1341 b(97)360 183 y Fr(J)24 b(=)f(Sum)h([)g(x')f(Q)h(x)g(+)f(u')h(R)g(u)f (],)334 b(Z)24 b(omitted)240 257 y Fv(or)360 319 y Fr(J)g(=)f(Sum)h([)g (x')f(Q)h(x)g(+)f(u')h(R)g(u)f(+2)h(x')g(Z)f(u)h(],)95 b(Z)24 b(included)240 393 y Fv(Returns:)240 467 y Fp(k)18 b Fv(is)e(the)f(state)f(feedbac)o(k)i(gain,)f Fr(\(A)g(-)g(B)g(K\))g Fv(is)g(stable.)240 541 y Fp(p)i Fv(is)e(the)h(solution)g(of)f (algebraic)h(Riccati)g(equation.)240 616 y Fp(e)i Fv(are)d(the)g (closed)h(lo)q(op)g(p)q(oles)g(of)f Fp(\(A)g(-)g(B)g(K\))p Fv(.)0 702 y Fr(dlyap)f(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))240 764 y Fv(Solv)o(e)h(the)f(discrete-time)i(Ly)o(apuno)o(v)e(equation)360 826 y Fr(a)24 b(x)f(a')h(-)g(x)f(+)h(b)g(=)g(0)240 900 y Fv(for)15 b(square)g(matrices)g Fp(a)p Fv(,)f Fp(b)p Fv(.)20 b(If)c Fp(b)g Fv(is)g(not)f(square,)f(then)i(the)f(function)h (attempts)e(to)h(solv)o(e)g(either)360 961 y Fr(a)24 b(x)f(a')h(-)g(x)f(+)h(b)g(b')g(=)f(0)240 1035 y Fv(or)360 1097 y Fr(a')h(x)f(a)h(-)g(x)f(+)h(b')g(b)g(=)f(0)240 1171 y Fv(whic)o(hev)o(er)16 b(is)g(appropriate.)240 1245 y(Uses)k(Sc)o(h)o(ur)g(decomp)q(osition)i(metho)q(d)e(as)g(in)h (Kitaga)o(w)o(a,)e(In)o(ternational)i(Journal)g(of)f(Con)o(trol)240 1308 y(\(1977\);)12 b(column-b)o(y-column)17 b(solution)e(metho)q(d)f (as)g(suggested)g(in)h(Hammarling,)g(IMA)f(Journal)240 1370 y(of)h(Numerical)h(Analysis,)g(\(1982\).)0 1456 y Fr(is_controllable)d(\()p Fp(a)p Fr(,)i Fp(b)p Fr(,)g Fp(tol)r Fr(\))240 1518 y Fv(If)g(the)h(pair)f(\(a,)f(b\))i(is)f(con)o (trollable,)h(then)g(return)f(v)m(alue)h(1.)k(Otherwise,)c(returns)f(a) f(v)m(alue)j(of)e(0.)240 1592 y Fp(tol)i Fv(is)f(a)f(roundo\013)f (parameter,)g(set)h(to)g Fr(2*eps)f Fv(if)i(omitted.)240 1666 y(Curren)o(tly)e(just)g(constructs)g(the)h(con)o(trollabilit)o(y)h (matrix)e(and)g(c)o(hec)o(ks)h(rank.)k(A)14 b(b)q(etter)h(metho)q(d)240 1729 y(is)h(as)f(follo)o(ws)g(\(Boley)h(and)g(Golub,)f(Systems)h(and)f (Con)o(trol)g(Letters,)g(1984\):)k(Con)o(trollabilit)o(y)d(is)240 1791 y(determined)f(b)o(y)e(applying)h(Arnoldi)h(iteration)e(with)h (complete)g(re-orthogonalization)f(to)g(obtain)240 1853 y(an)i(orthogonal)g(basis)g(of)g(the)g(Krylo)o(v)h(subspace)747 1960 y(span)845 1925 y Fh(\000\002)882 1960 y Fo(b)e(ab)23 b(:)8 b(:)g(:)20 b(a)1082 1941 y Fn(n)p Fl(\000)p Fk(1)1148 1960 y Fo(b)1168 1925 y Fh(\003)o(\001)0 2079 y Fr(is_observable)13 b(\()p Fp(a)p Fr(,)i Fp(c)p Fr(,)g Fp(tol)r Fr(\))240 2141 y Fv(Returns)h(1)f(if)g(the)h(pair)f Fr(\(a,)g(c\))g Fv(is)g(observ)m(able.)21 b(Otherwise,)16 b(returns)f(a)g(v)m(alue)h (of)f(0.)0 2227 y Fr(lqe)g(\()p Fp(a)p Fr(,)f Fp(g)p Fr(,)h Fp(c)p Fr(,)g Fp(sigw)p Fr(,)g Fp(sigv)p Fr(,)h Fp(z)s Fr(\))360 2277 y([k,)23 b(p,)h(e])g(=)f(lqe)h(\(a,)f(g,)h(c,)f (sigw,)h(sigv,)f(z\))240 2351 y Fv(Linear)16 b(quadratic)g(estimator)e (\(Kalman)h(\014lter\))h(design)g(for)e(the)i(con)o(tin)o(uous)f(time)h (system)831 2444 y Fo(dx)p 831 2464 50 2 v 836 2505 a(dt)898 2474 y Fv(=)d Fo(Ax)d Fv(+)h Fo(B)r(u)842 2581 y(y)j Fv(=)f Fo(C)s(x)d Fv(+)g Fo(D)q(u)240 2670 y Fv(where)15 b Fp(w)p Fv(,)g Fp(v)k Fv(are)c(zero-mean)g(gaussian)h(noise)f(pro)q (cesses)h(with)g(resp)q(ectiv)o(e)g(in)o(tensities)p eop %%Page: 98 100 98 99 bop 0 -58 a Fv(98)1766 b(Octa)o(v)o(e)360 183 y Fr(sigw)23 b(=)h(cov)f(\(w,)h(w\))360 233 y(sigv)f(=)h(cov)f(\(v,)h (v\))240 309 y Fp(z)c Fv(\(if)e(sp)q(eci\014ed\))h(is)f(the)g(cross-co) o(v)m(ariance)g Fr(cov)d(\()p Fp(w)p Fr(,)f Fp(v)t Fr(\))p Fv(;)k(the)g(default)g(v)m(alue)h(is)f Fr(cov)d(\()p Fp(w)p Fr(,)f Fp(v)t Fr(\))h(=)240 372 y(0)p Fv(.)240 448 y(Observ)o(er)g(structure)g(is)h Fr(dz/dt)f(=)g(A)g(z)g(+)g(B)g(u)g (+)g(k)g(\(y)g(-)g(C)g(z)g(-)g(D)g(u\))240 524 y Fv(returns:)240 600 y Fp(k)j Fv(is)e(observ)o(er)e(gain:)21 b Fr(\(A)14 b(-)h(K)g(C\))g Fv(is)h(stable.)240 677 y Fp(p)h Fv(is)e(solution)h(of) f(algebraic)h(Riccati)h(equation.)240 753 y Fp(e)h Fv(is)e(the)f(v)o (ector)f(of)h(closed)h(lo)q(op)g(p)q(oles)g(of)f Fr(\(A)g(-)g(K)g(C\))p Fv(.)0 843 y Fr(lqr)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)i Fp(q)p Fr(,)f Fp(r)p Fr(,)f Fp(z)s Fr(\))0 905 y([)p Fp(k)p Fr(,)h Fp(p)p Fr(,)g Fp(e)s Fr(])g(=)g(lqr)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)i Fp(q)p Fr(,)f Fp(r)p Fr(,)f Fp(z)s Fr(\))240 968 y Fv(Linear)i(quadratic)g(regulator)e(design)i (for)f(the)g(con)o(tin)o(uous)h(time)f(system)831 1068 y Fo(dx)p 831 1088 50 2 v 836 1130 a(dt)898 1098 y Fv(=)e Fo(Ax)d Fv(+)h Fo(B)r(u)240 1221 y Fv(to)k(minimize)i(the)e(cost)g (functional)761 1338 y Fo(J)i Fv(=)851 1280 y Fh(Z)893 1290 y Fl(1)874 1374 y Fk(0)935 1338 y Fo(x)961 1319 y Fl(0)973 1338 y Fo(Qx)10 b Fv(+)g Fo(u)1116 1319 y Fl(0)1128 1338 y Fo(Ru)240 1480 y Fp(z)18 b Fv(omitted)d(or)673 1546 y Fo(J)i Fv(=)763 1489 y Fh(Z)805 1499 y Fl(1)786 1583 y Fk(0)847 1546 y Fo(x)873 1528 y Fl(0)885 1546 y Fo(Qx)10 b Fv(+)g Fo(u)1028 1528 y Fl(0)1040 1546 y Fo(Ru)g Fv(+)g(2)p Fo(x)1205 1528 y Fl(0)1217 1546 y Fo(Z)s(u)240 1654 y Fp(z)18 b Fv(included)240 1730 y(Returns:)240 1806 y Fp(k)g Fv(is)e(state)e(feedbac)o(k)i(gain:)k Fr(\(A)15 b(-)g(B)g(K\))g Fv(is)g(stable.)240 1882 y Fp(p)i Fv(is)e(the)h (stabilizing)h(solution)f(of)f(appropriate)g(algebraic)h(Riccati)h (equation.)240 1959 y Fp(e)h Fv(is)e(the)f(v)o(ector)f(of)h(the)g (closed)i(lo)q(op)e(p)q(oles)h(of)f Fr(\(A)g(-)g(B)g(K\))p Fv(.)0 2049 y Fr(lyap)g(\()p Fp(a)p Fr(,)f Fp(b)p Fr(,)h Fp(c)s Fr(\))240 2111 y Fv(Solv)o(e)j(the)f(Ly)o(apuno)o(v)h(\(or)e (Sylv)o(ester\))i(equation)g(via)f(the)h(Bartels-Stew)o(art)e (algorithm)i(\(Com-)240 2174 y(m)o(unications)e(of)f(the)g(A)o(CM,)f (1972\).)240 2250 y(If)h Fr(\(a,)g(b,)g(c\))g Fv(are)g(sp)q(eci\014ed,) i(then)e Fr(lyap)g Fv(returns)g(the)g(solution)h(of)f(the)g(Sylv)o (ester)h(equation)360 2314 y Fr(a)24 b(x)f(+)h(x)g(b)g(+)f(c)h(=)g(0) 240 2390 y Fv(If)15 b(only)h Fr(\(a,)f(b\))g Fv(are)g(sp)q(eci\014ed,)i (then)e Fr(lyap)g Fv(returns)g(the)g(solution)h(of)f(the)g(Ly)o(apuno)o (v)g(equation)360 2454 y Fr(a')24 b(x)f(+)h(x)g(a)f(+)h(b)g(=)g(0)240 2530 y Fv(If)15 b Fp(b)i Fv(is)f(not)e(square,)h(then)h Fr(lyap)e Fv(returns)h(the)h(solution)g(of)e(either)360 2594 y Fr(a')24 b(x)f(+)h(x)g(a)f(+)h(b')g(b)g(=)f(0)240 2670 y Fv(or)p eop %%Page: 99 101 99 100 bop 0 -58 a Fv(Chapter)15 b(14:)k(Con)o(trol)c(Theory)1341 b(99)360 183 y Fr(a)24 b(x)f(+)h(x)g(a')f(+)h(b)g(b')g(=)f(0)240 258 y Fv(whic)o(hev)o(er)16 b(is)g(appropriate.)240 333 y(Solv)o(es)g(b)o(y)f(using)h(the)f(Bartels-Stew)o(art)f(algorithm)i (\(1972\).)0 420 y Fr(tzero)e(\()p Fp(a)p Fr(,)h Fp(b)p Fr(,)g Fp(c)p Fr(,)h Fp(d)p Fr(,)f Fp(bal)r Fr(\))240 482 y Fv(Compute)g(the)g(transmission)h(zeros)f(of)g([A,)f(B,)h(C,)g (D].)240 557 y Fp(bal)j Fv(=)d(balancing)i(option)e(\(see)g(balance\);) h(default)f(is)h Fr("B")p Fv(.)240 632 y(Needs)f(to)f(incorp)q(orate)h Fr(mvzero)f Fv(algorithm)h(to)f(isolate)h(\014nite)h(zeros;)e(see)h(Ho) q(del,)g Fp(Computation)240 694 y(of)g(System)g(Zeros)f(with)i (Balancing)p Fv(,)g(Linear)g(Algebra)g(and)f(its)h(Applications,)g (July)h(1993.)p eop %%Page: 100 102 100 101 bop 0 -58 a Fv(100)1743 b(Octa)o(v)o(e)p eop %%Page: 101 103 101 102 bop 0 -58 a Fv(Chapter)15 b(15:)k(Signal)e(Pro)q(cessing)1281 b(101)0 183 y Fs(15)41 b(Signal)14 b(Pro)r(cessing)62 309 y Fv(I)i(hop)q(e)g(that)f(someda)o(y)g(Octa)o(v)o(e)g(will)i (include)h(more)d(signal)h(pro)q(cessing)h(functions.)k(If)16 b(y)o(ou)f(w)o(ould)h(lik)o(e)h(to)0 371 y(help)f(impro)o(v)o(e)g(Octa) o(v)o(e)e(in)i(this)g(area,)e(please)i(con)o(tact)f Fr (bug-octave@che.utexas.ed)o(u)p Fv(.)0 464 y Fr(fft)g(\()p Fp(a)p Fr(\))82 b Fv(Compute)15 b(the)g(FFT)g(of)f Fp(a)h Fv(using)h(subroutines)g(from)f(FFTP)l(A)o(CK.)0 548 y Fr(fft2)g(\()p Fp(a)p Fr(\))58 b Fv(Compute)15 b(the)g(t)o(w)o(o)f (dimensional)j(FFT)e(of)f Fp(a)p Fv(.)0 631 y Fr(fftconv)g(\()p Fp(a)p Fr(,)h Fp(b)p Fr(,)g Fp(N)5 b Fr(\))240 694 y Fv(This)22 b(function)g(returns)f(the)g(con)o(v)o(olution)g(of)g(the)g (v)o(ectors)f Fp(a)h Fv(and)g Fp(b)p Fv(,)i(a)d(v)o(ector)h(with)g (length)240 756 y(equal)14 b(to)e(the)i Fr(length)g(\(a\))h(+)g(length) f(\(b\))h(-)g(1)p Fv(.)k(If)13 b Fp(a)g Fv(and)h Fp(b)g Fv(are)f(the)g(co)q(e\016cien)o(t)h(v)o(ectors)f(of)f(t)o(w)o(o)240 818 y(p)q(olynomials,)k(the)g(returned)f(v)m(alue)i(is)e(the)h(co)q (e\016cien)o(t)g(v)o(ector)e(of)h(the)g(pro)q(duct)h(p)q(olynomial.)240 891 y(The)g(computation)f(uses)g(the)h(FFT)e(b)o(y)i(calling)h(the)e (function)h Fr(fftfilt)p Fv(.)j(If)d(the)f(optional)h(argu-)240 953 y(men)o(t)f Fp(N)20 b Fv(is)c(sp)q(eci\014ed,)h(an)e(N-p)q(oin)o(t) h(FFT)e(is)i(used.)0 1037 y Fr(fftfilt)e(\()p Fp(b)p Fr(,)h Fp(x)p Fr(,)g Fp(N)5 b Fr(\))240 1099 y Fv(With)15 b(t)o(w)o(o)f(argumen)o(ts,)g Fr(fftfilt)g Fv(\014lters)i Fp(x)i Fv(with)e(the)f(FIR)h(\014lter)g Fp(b)g Fv(using)g(the)f(FFT.) 240 1172 y(Giv)o(en)i(the)f(optional)h(third)g(argumen)o(t,)e Fp(N)p Fv(,)h Fr(fftfilt)g Fv(uses)g(the)h(o)o(v)o(erlap-add)f(metho)q (d)h(to)e(\014lter)240 1234 y Fp(x)j Fv(with)e Fp(b)g Fv(using)g(an)f(N-p)q(oin)o(t)h(FFT.)0 1317 y Fr(filter)e(\()p Fp(b)p Fr(,)h Fp(a)p Fr(,)g Fp(x)s Fr(\))240 1380 y Fv(This)23 b(function)g(returns)f(the)h(solution)g(to)f(the)g(follo)o(wing)h (linear,)i(time-in)o(v)m(arian)o(t)f(di\013erence)240 1442 y(equation:)519 1513 y Fn(N)504 1526 y Fh(X)503 1615 y Fn(k)q Fk(=0)571 1566 y Fo(a)595 1573 y Fn(k)q Fk(+1)658 1566 y Fo(y)680 1573 y Fn(n)p Fl(\000)p Fn(k)757 1566 y Fv(+)815 1513 y Fn(M)803 1526 y Fh(X)803 1615 y Fn(k)q Fk(=0)871 1566 y Fo(b)891 1573 y Fn(k)q Fk(+1)953 1566 y Fo(x)979 1573 y Fn(n)p Fl(\000)p Fn(k)1058 1566 y Fv(=)13 b(0)p Fo(;)98 b Fv(1)12 b Ft(\024)h Fo(n)g Ft(\024)g Fo(P)240 1704 y Fv(where)i Fo(a)e Ft(2)g(<)484 1688 y Fn(N)s Fl(\000)p Fk(1)558 1704 y Fv(,)i Fo(b)d Ft(2)h(<)694 1688 y Fn(M)s Fl(\000)p Fk(1)773 1704 y Fv(,)i(and)g Fo(x)e Ft(2)g(<)1004 1688 y Fn(P)1031 1704 y Fv(.)20 b(An)15 b(equiv)m(alen)o(t)i(form)e(of)f(this)i(equation)g (is:)492 1828 y Fo(y)514 1835 y Fn(n)550 1828 y Fv(=)613 1775 y Fn(N)598 1788 y Fh(X)598 1877 y Fn(k)q Fk(=1)666 1828 y Fo(c)686 1835 y Fn(k)q Fk(+1)748 1828 y Fo(y)770 1835 y Fn(n)p Fl(\000)p Fn(k)847 1828 y Fv(+)906 1775 y Fn(M)893 1788 y Fh(X)893 1877 y Fn(k)q Fk(=0)961 1828 y Fo(d)985 1835 y Fn(k)q Fk(+1)1047 1828 y Fo(x)1073 1835 y Fn(n)p Fl(\000)p Fn(k)1140 1828 y Fo(;)98 b Fv(1)12 b Ft(\024)h Fo(n)g Ft(\024)g Fo(P)240 1964 y Fv(where)i Fo(c)e Fv(=)g Fo(a=a)523 1971 y Fk(1)556 1964 y Fv(and)j Fo(d)c Fv(=)h Fo(b=a)796 1971 y Fk(1)814 1964 y Fv(.)240 2037 y(In)g(terms)e(of)h(the)g(z-transform,)f(y)h(is)h(the)f(result)g (of)g(passing)g(the)g(discrete-)h(time)f(signal)h(x)f(through)240 2099 y(a)j(system)g(c)o(haracterized)g(b)o(y)h(the)f(follo)o(wing)h (rational)f(system)g(function:)718 2219 y Fo(H)t Fv(\()p Fo(z)r Fv(\))c(=)921 2156 y Fh(P)964 2166 y Fn(M)964 2199 y(k)q Fk(=0)1034 2188 y Fo(d)1058 2195 y Fn(k)q Fk(+1)1121 2188 y Fo(z)1144 2171 y Fl(\000)p Fn(k)p 883 2208 344 2 v 883 2255 a Fv(1)f(+)962 2223 y Fh(P)1006 2233 y Fn(N)1006 2266 y(k)q Fk(+1)1076 2255 y Fo(c)1096 2262 y Fn(k)q Fk(+1)1158 2255 y Fo(z)1181 2242 y Fl(\000)p Fn(k)240 2350 y Fv(When)16 b(called)g(as)360 2410 y Fr([y,)23 b(sf])h(=)g(filter)f(\(b,)g(a,)h(x,)f(si\))240 2483 y(filter)12 b Fv(uses)i(the)f(argumen)o(t)g Fp(si)j Fv(as)d(the)h(initial)h(state)d (of)h(the)h(system)f(and)g(and)h(returns)f(the)g(\014nal)240 2545 y(state)i(in)i Fp(sf)p Fv(.)k(The)16 b(state)f(v)o(ector)h(is)g(a) g(column)g(v)o(ector)f(whose)h(length)h(is)f(equal)h(to)e(the)h(length) g(of)240 2608 y(the)h(longest)g(co)q(e\016cien)o(t)h(v)o(ector)e(min)o (us)i(one.)25 b(If)17 b Fp(si)j Fv(is)e(not)e(set,)h(the)g(initial)i (state)d(v)o(ector)h(is)g(set)240 2670 y(to)e(all)h(zeros.)p eop %%Page: 102 104 102 103 bop 0 -58 a Fv(102)1743 b(Octa)o(v)o(e)0 183 y Fr(freqz)120 b Fv(Compute)15 b(the)g(frequency)h(resp)q(onse)g(of)f (a)g(\014lter.)240 258 y Fr([)p Fp(h)p Fr(,)g Fp(w)t Fr(])g(=)g(freqz)f(\()p Fp(b)q Fr(\))j Fv(returns)g(the)g(complex)g (frequency)h(resp)q(onse)f Fp(h)h Fv(of)e(the)h(FIR)g(\014lter)h(with) 240 320 y(co)q(e\016cien)o(ts)e Fp(b)p Fv(.)k(The)c(resp)q(onse)f(is)h (ev)m(aluated)g(at)f(512)f(angular)h(frequencies)i(b)q(et)o(w)o(een)f (0)f(and)g Fo(\031)r Fv(.)240 395 y(The)g(output)g(v)m(alue)i Fp(w)i Fv(is)c(a)g(v)o(ector)g(con)o(taining)h(the)f(512)f (frequencies.)240 470 y Fr([)p Fp(h)p Fr(,)h Fp(w)t Fr(])g(=)g(freqz)f (\()p Fp(b)p Fr(,)h Fp(a)p Fr(\))21 b Fv(returns)g(the)g(complex)h (frequency)g(resp)q(onse)f(of)g(the)g(rational)g(I)q(IR)240 532 y(\014lter)16 b(whose)f(n)o(umerator)f(has)h(co)q(e\016cien)o(ts)h Fp(b)h Fv(and)e(denominator)g(co)q(e\016cien)o(ts)h Fp(a)p Fv(.)240 607 y Fr([)p Fp(h)p Fr(,)f Fp(w)t Fr(])g(=)g(freqz)f(\()p Fp(b)p Fr(,)h Fp(a)p Fr(,)g Fp(n)p Fr(\))21 b Fv(returns)g(the)g(resp)q (onse)g(ev)m(aluated)h(at)f Fp(n)g Fv(angular)g(frequencies.)240 669 y(F)l(or)15 b(fastest)f(computation)h(n)g(should)h(factor)f(in)o (to)g(a)g(small)h(n)o(um)o(b)q(er)f(of)g(small)h(primes.)240 744 y Fr([)p Fp(h)p Fr(,)f Fp(w)t Fr(])g(=)g(freqz)f(\()p Fp(b)p Fr(,)h Fp(a)p Fr(,)g Fp(n)p Fr(,)g("whole"\))g Fv(ev)m(aluates)i(the)f(resp)q(onse)h(at)e(n)h(frequencies)i(b)q(et)o (w)o(een)240 806 y(0)d(and)g(2)p Fo(\031)r Fv(.)0 893 y Fr(ifft)g(\()p Fp(a)p Fr(\))58 b Fv(Compute)15 b(the)g(in)o(v)o(erse) h(FFT)e(of)h Fp(a)g Fv(using)h(subroutines)g(from)e(FFTP)l(A)o(CK.)0 980 y Fr(ifft2)120 b Fv(Compute)15 b(the)g(t)o(w)o(o)f(dimensional)j (in)o(v)o(erse)f(FFT)e(of)h Fp(a)p Fv(.)0 1067 y Fr(sinc)g(\()p Fp(x)s Fr(\))54 b Fv(Returns)16 b(sin)q(\()p Fo(\031)r(x)p Fv(\))p Fo(=)p Fv(\()p Fo(\031)r(x)p Fv(\).)p eop %%Page: 103 105 103 104 bop 0 -58 a Fv(Chapter)15 b(16:)k(Sets)1546 b(103)0 183 y Fs(16)41 b(Sets)62 316 y Fv(Octa)o(v)o(e)20 b(has)g(a)g(limited)h (set)f(of)g(functions)h(for)e(managing)h(sets)g(of)f(data,)i(where)f(a) g(set)g(is)g(de\014ned)i(as)d(a)0 378 y(collection)e(unique)g(elemen)o (ts.)62 461 y(Giv)o(en)i(a)f(matrix)g(or)g(v)o(ector)f(of)h(v)m(alues,) i(the)e(function)h Fr(create_set)e Fv(returns)h(a)g(ro)o(w)g(v)o(ector) f(con)o(taining)0 524 y(unique)d(v)m(alues,)g(sorted)e(in)h(ascending)h (order.)19 b(F)l(or)11 b(example,)j(`)p Fr(create_set)f(\([1,)i(2;)g (3,)g(4;)g(4,)f(2]\))p Fv(')e(returns)0 586 y(the)j(v)o(ector)g(`)p Fr([1,)f(2,)h(3,)g(4])p Fv('.)62 669 y(The)i(functions)g Fr(union)f Fv(and)h Fr(intersection)e Fv(tak)o(e)g(t)o(w)o(o)h(sets)g (as)g(argumen)o(ts)f(and)i(return)g(the)f(union)i(and)0 731 y(in)o(terection,)e(resp)q(ectiv)o(ely)l(.)22 b(F)l(or)15 b(example,)h(`)p Fr(union)e(\([1,)h(2,)g(3],)f([2,)h(3,)g(5]\))p Fv(')f(returns)i(the)f(v)o(ector)g(`)p Fr([1,)f(2,)0 793 y(5])p Fv('.)62 876 y(The)d(function)h Fr(complement)i(\()p Fp(a)p Fr(,)h Fp(b)q Fr(\))c Fv(returns)f(the)h(elemen)o(ts)h(of)e(set) h Fp(b)h Fv(that)e(are)h(not)g(in)g(set)g Fp(a)p Fv(.)18 b(F)l(or)10 b(example,)0 939 y(`)p Fr(complement)j(\([1,)i(2,)g(3],)g ([2,)f(3,)h(5]\))p Fv(')g(returns)g(the)g(v)m(alue)h(`)p Fr(5)p Fv('.)p eop %%Page: 104 106 104 105 bop 0 -58 a Fv(104)1743 b(Octa)o(v)o(e)p eop %%Page: 105 107 105 106 bop 0 -58 a Fv(Chapter)15 b(17:)k(Statistics)1445 b(105)0 183 y Fs(17)41 b(Statistics)62 316 y Fv(I)20 b(hop)q(e)f(that)g(someda)o(y)f(Octa)o(v)o(e)g(will)j(include)g(more)e (statistics)g(functions.)32 b(If)19 b(y)o(ou)g(w)o(ould)g(lik)o(e)h(to) f(help)0 378 y(impro)o(v)o(e)c(Octa)o(v)o(e)g(in)h(this)g(area,)e (please)i(con)o(tact)e Fr(bug-octave@che.utexas.edu)p Fv(.)0 474 y Fr(corrcoef)g(\()p Fp(x)k Fr([,)d Fp(y)t Fr(]\))240 536 y Fv(If)20 b(eac)o(h)f(ro)o(w)f(of)h Fp(x)k Fv(and)c Fp(y)24 b Fv(is)19 b(an)h(observ)m(ation)f(and)h(eac)o(h)f (column)i(is)f(a)f(v)m(ariable,)i(the)e(\(i,j\)-th)240 598 y(en)o(try)14 b(of)f Fr(corrcoef)h(\()p Fp(x)p Fr(,)h Fp(y)t Fr(\))f Fv(is)h(the)f(correlation)g(b)q(et)o(w)o(een)g(the)h (i-th)f(v)m(ariable)i(in)f Fp(x)i Fv(and)d(the)g(j-th)240 661 y(v)m(ariable)j(in)f Fp(y)p Fv(.)j(If)d(in)o(v)o(ok)o(ed)f(with)h (one)f(argumen)o(t,)f(compute)i Fr(corrcoef)e(\()p Fp(x)p Fr(,)g Fp(x)s Fr(\))p Fv(.)0 748 y Fr(cov)h(\()p Fp(x)j Fr([,)d Fp(y)t Fr(]\))240 810 y Fv(If)e(eac)o(h)f(ro)o(w)g(of)g Fp(x)k Fv(and)d Fp(y)j Fv(is)d(an)f(observ)m(ation)h(and)g(eac)o(h)g (column)g(is)g(a)g(v)m(ariable,)h(the)e(\(i,j\)-th)g(en)o(try)240 872 y(of)j Fr(cov)f(\()p Fp(x)p Fr(,)h Fp(y)t Fr(\))g Fv(is)h(the)f(co)o(v)m(ariance)h(b)q(et)o(w)o(een)f(the)g(i-th)h(v)m (ariable)h(in)f(X)f(and)g(the)h(j-th)f(v)m(ariable)h(in)240 935 y Fp(y)p Fv(.)k(If)15 b(in)o(v)o(ok)o(ed)h(with)f(one)h(argumen)o (t,)e(compute)h Fr(cov)g(\()p Fp(x)p Fr(,)g Fp(x)s Fr(\))p Fv(.)0 1022 y Fr(kurtosis)f(\()p Fp(x)s Fr(\))240 1084 y Fv(If)h Fp(x)k Fv(is)c(a)g(v)o(ector)g(of)g(length)g(N,)g(return)g (the)h(kurtosis)360 1146 y Fr(kurtosis\(x\))22 b(=)i(N^\(-1\))f (std\(x\)^\(-4\))f(SUM_i)i(\(x\(i\)-mean\(x\)\)^4)d(-)j(3)240 1221 y Fv(of)15 b Fp(x)p Fv(.)20 b(If)15 b Fp(x)j Fv(is)e(a)f(matrix,)f (return)i(the)f(ro)o(w)f(v)o(ector)h(con)o(taining)h(the)f(kurtosis)g (of)g(eac)o(h)g(column.)0 1308 y Fr(mahalanobis)f(\()p Fp(x)p Fr(,)h Fp(y)t Fr(\))240 1370 y Fv(Returns)20 b(Mahalanobis')f (D-square)h(distance)g(b)q(et)o(w)o(een)g(the)f(m)o(ultiv)m(ariate)h (samples)g Fp(x)j Fv(and)c Fp(y)p Fv(,)240 1433 y(whic)o(h)c(m)o(ust)f (ha)o(v)o(e)g(the)g(same)g(n)o(um)o(b)q(er)h(of)f(comp)q(onen)o(ts)g (\(columns\),)h(but)f(ma)o(y)g(ha)o(v)o(e)g(a)g(di\013eren)o(t)240 1495 y(n)o(um)o(b)q(er)i(of)e(observ)m(ations)i(\(ro)o(ws\).)0 1582 y Fr(mean)f(\()p Fp(a)p Fr(\))58 b Fv(If)16 b Fp(a)f Fv(is)i(a)e(v)o(ector,)g(compute)h(the)g(mean)f(of)h(the)g(elemen)o(ts) g(of)f Fp(a)p Fv(.)22 b(If)16 b Fp(a)f Fv(is)h(a)g(matrix,)f(compute)h (the)240 1644 y(mean)f(for)g(eac)o(h)g(column)h(and)g(return)f(them)g (in)h(a)f(ro)o(w)f(v)o(ector.)0 1732 y Fr(median)g(\()p Fp(a)p Fr(\))240 1794 y Fv(If)e Fp(a)f Fv(is)h(a)f(v)o(ector,)h (compute)f(the)h(median)g(v)m(alue)h(of)e(the)h(elemen)o(ts)g(of)f Fp(a)p Fv(.)19 b(If)12 b Fp(a)f Fv(is)h(a)f(matrix,)h(compute)240 1856 y(the)j(median)h(v)m(alue)h(for)d(eac)o(h)i(column)g(and)f(return) g(them)g(in)h(a)f(ro)o(w)g(v)o(ector.)0 1943 y Fr(skewness)f(\()p Fp(x)s Fr(\))240 2006 y Fv(If)h Fp(x)k Fv(is)c(a)g(v)o(ector)g(of)g (length)g(N,)g(return)g(the)h(sk)o(ewness)360 2068 y Fr(skewness)23 b(\(x\))g(=)h(N^\(-1\))f(std\(x\)^\(-3\))f(SUM_i)i (\(x\(i\)-mean\(x\)\)^3)240 2143 y Fv(of)15 b Fp(x)p Fv(.)20 b(If)15 b Fp(x)j Fv(is)e(a)f(matrix,)f(return)i(the)f(ro)o(w)f (v)o(ector)h(con)o(taining)h(the)f(sk)o(ewness)g(of)g(eac)o(h)g (column.)0 2230 y Fr(std)g(\()p Fp(a)p Fr(\))82 b Fv(If)16 b Fp(a)f Fv(is)h(a)f(v)o(ector,)g(compute)h(the)f(standard)h(deviation) g(of)f(the)h(elemen)o(ts)g(of)f Fp(a)p Fv(.)21 b(If)16 b Fp(a)f Fv(is)h(a)g(matrix,)240 2292 y(compute)f(the)h(standard)e (deviation)j(for)d(eac)o(h)h(column)i(and)e(return)g(them)g(in)h(a)f (ro)o(w)f(v)o(ector.)p eop %%Page: 106 108 106 107 bop 0 -58 a Fv(106)1743 b(Octa)o(v)o(e)p eop %%Page: 107 109 107 108 bop 0 -58 a Fv(Chapter)15 b(18:)k(Plotting)1465 b(107)0 183 y Fs(18)41 b(Plotting)62 323 y Fv(All)20 b(of)f(Octa)o(v)o(e's)f(plotting)h(functions)h(use)f Fr(gnuplot)f Fv(to)g(handle)i(the)f(actual)g(graphics.)31 b(There)19 b(are)f(t)o(w)o(o)0 385 y(lo)o(w-lev)o(el)e(functions,)e Fr(gplot)g Fv(and)g Fr(gsplot)p Fv(,)f(that)h(b)q(eha)o(v)o(e)g(almost) g(exactly)g(lik)o(e)i(the)e(corresp)q(onding)h Fr(gnuplot)0 448 y Fv(functions)g Fr(plot)f Fv(and)h(`)p Fr(splot)p Fv('.)j(A)d(n)o(um)o(b)q(er)g(of)f(other)g(higher)h(lev)o(el)h (plotting)f(functions,)g(patterned)g(after)f(the)0 510 y(graphics)k(functions)h(found)f(in)g Fq(Ma)m(tlab)g Fv(v)o(ersion)g(3.5,)f(are)g(also)h(a)o(v)m(ailable.)29 b(These)18 b(higher)g(lev)o(el)h(functions)0 572 y(are)c(all)h (implemen)o(ted)h(in)f(terms)f(of)f(the)i(t)o(w)o(o)e(lo)o(w-lev)o(el)i (plotting)g(functions.)0 711 y Fu(18.1)32 b(Tw)n(o-Dimensional)14 b(Plotting)62 816 y Fv(The)i(syn)o(tax)e(for)h(Octa)o(v)o(e's)f(t)o(w)o (o-dimensional)i(plotting)g(function,)g Fr(gplot)p Fv(,)e(is)120 888 y Fr(gplot)23 b Fp(ranges)j(expression)e(using)29 b(title)e(st)o(yle)0 972 y Fv(where)21 b(the)f Fp(ranges)p Fv(,)h Fp(using)p Fv(,)h Fp(title)p Fv(,)h(and)d Fp(st)o(yle)j Fv(argumen)o(ts)d(are)g(optional,)i(and)f(the)f Fp(using)p Fv(,)i Fp(title)i Fv(and)d Fp(st)o(yle)0 1034 y Fv(quali\014ers)e(ma)o (y)e(app)q(ear)h(in)g(an)o(y)f(order)h(after)f(the)g(expression.)28 b(Y)l(ou)18 b(ma)o(y)f(plot)h(m)o(ultiple)h(expressions)g(with)0 1097 y(a)h(single)h(command)f(b)o(y)g(separating)g(them)g(with)g (commas.)34 b(Eac)o(h)20 b(expression)h(ma)o(y)e(ha)o(v)o(e)h(its)g(o)o (wn)g(set)f(of)0 1159 y(quali\014ers.)62 1243 y(The)d(optional)f(item)h Fp(ranges)h Fv(has)e(the)g(syn)o(tax)120 1315 y Fr([)24 b(x_lo)f(:)h(x_up)f(])h([)g(y_lo)f(:)h(y_up)f(])0 1400 y Fv(and)18 b(ma)o(y)g(b)q(e)h(used)g(to)e(sp)q(ecify)j(the)e(ranges)g (for)f(the)h(axes)g(of)g(the)h(plot,)f(indep)q(enden)o(t)j(of)d(the)g (actual)g(range)0 1462 y(of)f(the)g(data.)25 b(The)17 b(range)g(for)g(the)g(y)g(axes)g(and)g(an)o(y)g(of)g(the)g(individual)k (limits)d(ma)o(y)f(b)q(e)g(omitted.)26 b(A)17 b(range)0 1524 y Fr([:])e Fv(indicates)j(that)d(the)g(default)i(limits)g(should)g (b)q(e)f(used.)22 b(This)16 b(normally)h(means)f(that)f(a)g(range)g (just)h(large)0 1586 y(enough)g(to)e(include)k(all)e(the)f(data)g(p)q (oin)o(ts)g(will)i(b)q(e)f(used.)62 1671 y(The)h(expression)h(to)e(b)q (e)h(plotted)g(m)o(ust)f(not)h(con)o(tain)f(an)o(y)h(literal)h (matrices)e(\(e.g.)24 b Fr([)15 b(1,)g(2;)g(3,)g(4)g(])p Fv(\))h(since)0 1733 y(it)f(is)h(nearly)g(imp)q(ossible)h(to)e (distinguish)i(a)e(plot)h(range)e(from)h(a)g(matrix)g(of)f(data.)62 1818 y(See)i(the)f(help)i(for)d Fr(gnuplot)h Fv(for)f(a)h(description)i (of)e(the)g(syn)o(tax)f(for)h(the)g(optional)h(items.)62 1902 y(By)j(default,)h(the)e Fr(gplot)g Fv(command)h(plots)g(the)f (second)i(column)f(of)f(a)h(matrix)f(v)o(ersus)g(the)h(\014rst.)30 b(If)19 b(the)0 1964 y(matrix)c(only)h(has)g(one)f(column,)h(it)g(is)g (tak)o(en)f(as)g(a)g(v)o(ector)g(of)g(y-co)q(ordinates)h(and)g(the)f (x-co)q(ordinate)h(is)g(tak)o(en)0 2027 y(as)f(the)g(elemen)o(t)h (index,)g(starting)f(with)g(zero.)20 b(F)l(or)15 b(example,)120 2098 y Fr(gplot)23 b(rand)g(\(100,1\))g(with)h(linespoints)0 2183 y Fv(will)19 b(plot)f(100)e(random)h(v)m(alues)i(and)e(connect)h (them)g(with)f(lines.)28 b(When)18 b Fr(gplot)f Fv(is)h(used)g(to)e (plot)i(a)f(column)0 2245 y(v)o(ector,)d(the)h(indices)j(of)c(the)i (elemen)o(ts)g(are)e(tak)o(en)h(as)g(x)g(v)m(alues.)62 2330 y(If)22 b(there)f(are)g(more)g(than)g(t)o(w)o(o)f(columns,)k(y)o (ou)d(can)g(c)o(ho)q(ose)h(whic)o(h)g(columns)g(to)f(plot)g(with)h(the) f Fp(using)0 2392 y Fv(quali\014er.)g(F)l(or)15 b(example,)h(giv)o(en)f (the)h(data)120 2464 y Fr(x)24 b(=)f(\(-10:0.1:10\)';)120 2514 y(data)g(=)h([x,)f(sin\(x\),)g(cos\(x\)];)0 2598 y Fv(the)15 b(command)120 2670 y Fr(gplot)23 b([-11:11])g([-1.1:1.1])f (data)i(with)f(lines,)g(data)g(using)h(1:3)f(with)g(impulses)p eop %%Page: 108 110 108 109 bop 0 -58 a Fv(108)1743 b(Octa)o(v)o(e)0 183 y(will)19 b(plot)e(t)o(w)o(o)f(lines.)27 b(The)17 b(\014rst)g(line)i (is)f(generated)f(b)o(y)g(the)g(command)g Fr(data)d(with)h(lines)p Fv(,)i(and)g(is)g(a)g(graph)0 246 y(of)f(the)g(sine)h(function)g(o)o(v) o(er)e(the)h(range)f(-10)h(to)f(10.)22 b(The)16 b(data)g(is)g(tak)o(en) g(from)f(the)h(\014rst)g(t)o(w)o(o)e(columns)j(of)f(the)0 308 y(matrix)f(b)q(ecause)h(columns)g(to)f(plot)g(w)o(ere)g(not)g(sp)q (eci\014ed)i(with)f(the)f Fp(using)20 b Fv(quali\014er.)62 393 y(The)15 b(clause)g Fr(using)g(1:3)f Fv(in)h(the)g(second)f(part)g (of)g(this)h(plot)g(command)f(sp)q(eci\014es)i(that)e(the)h(\014rst)f (and)g(third)0 455 y(columns)i(of)f(the)g(matrix)g Fr(data)g Fv(should)h(b)q(e)g(tak)o(en)e(as)h(the)g(v)m(alues)i(to)d(plot.)62 541 y(In)f(this)g(example,)h(the)e(ranges)g(ha)o(v)o(e)h(b)q(een)g (explicitly)i(sp)q(eci\014ed)g(to)d(b)q(e)h(a)f(bit)h(larger)g(than)f (the)h(actual)f(range)0 603 y(of)j(the)g(data)g(so)f(that)h(the)g(curv) o(es)g(do)h(not)e(touc)o(h)h(the)h(b)q(order)f(of)g(the)g(plot.)62 689 y(In)i(addition)g(to)e(the)h(basic)g(plotting)g(commands,)g(the)g (whole)g(range)f(of)h Fr(set)f Fv(and)h Fr(show)f Fv(commands)h(from)0 751 y Fr(gnuplot)e Fv(are)h(a)o(v)m(ailable,)i(as)d(is)i Fr(replot)p Fv(.)62 836 y(The)h Fr(set)e Fv(and)h Fr(show)g Fv(commands)g(allo)o(w)g(y)o(ou)g(to)f(set)h(and)g(sho)o(w)g Fr(gnuplot)f Fv(parameters.)21 b(F)l(or)16 b(more)g(infor-)0 898 y(mation)h(ab)q(out)f(the)h(set)f(and)h(sho)o(w)f(commands,)h(see)g (the)g Fr(gnuplot)f Fv(user's)g(guide)i(\(also)e(a)o(v)m(ailable)i(on)f (line)h(if)0 961 y(y)o(ou)d(run)g Fr(gnuplot)g Fv(directly)l(,)h (instead)g(of)e(running)j(it)e(from)g(Octa)o(v)o(e\).)62 1046 y(The)h Fr(replot)e Fv(command)h(allo)o(ws)h(y)o(ou)f(to)f(force)i (the)f(plot)g(to)g(b)q(e)h(redispla)o(y)o(ed.)22 b(This)15 b(is)h(useful)h(if)e(y)o(ou)g(ha)o(v)o(e)0 1108 y(c)o(hanged)20 b(something)g(ab)q(out)g(the)g(plot,)h(suc)o(h)f(as)g(the)g(title)h(or) e(axis)h(lab)q(els.)36 b(The)20 b Fr(replot)f Fv(command)h(also)0 1171 y(accepts)13 b(the)h(same)e(argumen)o(ts)h(as)f Fr(gplot)h Fv(or)f Fr(gsplot)h Fv(\(except)g(for)f(data)h(ranges\))f (so)h(y)o(ou)g(can)g(add)h(additional)0 1233 y(lines)j(to)d(existing)j (plots.)62 1318 y(F)l(or)e(example,)120 1391 y Fr(set)23 b(term)h(tek40)120 1441 y(set)f(output)g("/dev/plotter")120 1491 y(set)g(title)h("sine)f(with)g(lines)g(and)h(cosine)f(with)g (impulses")120 1541 y(replot)g("sin)g(\(x\))h(w)g(l")62 1626 y Fv(will)16 b(c)o(hange)e(the)g(terminal)h(t)o(yp)q(e)f(for)f (plotting,)i(add)f(a)g(title)g(to)g(the)g(curren)o(t)g(plot,)g(add)g(a) g(graph)f(of)h(sin)h(\(x\))0 1688 y(to)e(the)g(plot,)h(and)g(force)f (the)g(new)h(plot)g(to)e(b)q(e)i(sen)o(t)g(to)e(the)i(plot)f(device.)21 b(This)14 b(last)g(step)f(is)h(normally)g(required)0 1751 y(in)e(order)g(to)f(up)q(date)h(the)f(plot.)19 b(This)12 b(default)g(is)g(reasonable)g(for)f(slo)o(w)h(terminals)g(or)f(hardcop) o(y)g(output)h(devices)0 1813 y(b)q(ecause)i(ev)o(en)g(when)g(y)o(ou)f (are)g(adding)h(additional)g(lines)h(with)f(a)f(replot)g(command,)h(gn) o(uplot)f(alw)o(a)o(ys)g(redra)o(ws)0 1875 y(the)j(en)o(tire)h(plot,)f (and)g(y)o(ou)g(probably)g(don't)g(w)o(an)o(t)f(to)g(ha)o(v)o(e)h(a)g (completely)h(new)f(plot)h(generated)f(ev)o(ery)g(time)0 1938 y(something)f(as)g(minor)h(as)e(an)i(axis)f(lab)q(el)i(c)o (hanges.)62 2023 y(Since)e(this)f(ma)o(y)f(not)g(matter)f(as)h(m)o(uc)o (h)g(on)h(faster)e(terminals,)i(y)o(ou)f(can)h(tell)g(Octa)o(v)o(e)f (to)g(redispla)o(y)h(the)g(plot)0 2085 y(eac)o(h)f(time)h(an)o(ything)g (ab)q(out)f(it)g(c)o(hanges)h(b)o(y)f(setting)g(the)h(v)m(alue)g(of)f (the)h(builtin)h(v)m(ariable)g Fr(automatic_replot)0 2147 y Fv(to)g(the)g(v)m(alue)h Fr("true")p Fv(.)62 2233 y(Note)f(that)g(NaN)h(v)m(alues)g(in)g(the)g(plot)g(data)f(are)g (automatically)h(omitted,)f(and)g(Inf)h(v)m(alues)h(are)e(con)o(v)o (erted)0 2295 y(to)g(a)f(v)o(ery)h(large)h(v)m(alue)g(b)q(efore)f (calling)i(gn)o(uplot.)62 2381 y(The)f Fq(Ma)m(tlab)p Fv(-st)o(yle)f(t)o(w)o(o-dimensional)i(plotting)e(commands)g(are:)0 2481 y Fr(plot)g(\()p Fp(args)r Fr(\))240 2543 y Fv(This)k(function)g (pro)q(duces)g(t)o(w)o(o-dimensional)g(plots.)29 b(Man)o(y)17 b(di\013eren)o(t)i(com)o(binations)g(of)e(argu-)240 2605 y(men)o(ts)e(are)g(p)q(ossible.)21 b(The)16 b(simplest)g(form)f(is)360 2670 y Fr(plot)23 b(\(y\))p eop %%Page: 109 111 109 110 bop 0 -58 a Fv(Chapter)15 b(18:)k(Plotting)1465 b(109)240 183 y(where)12 b(the)h(argumen)o(t)e(is)i(tak)o(en)e(as)h (the)g(set)g(of)g Fp(y)k Fv(co)q(ordinates)c(and)h(the)f Fp(x)j Fv(co)q(ordinates)e(are)e(tak)o(en)240 246 y(to)k(b)q(e)g(the)h (indices)h(of)e(the)g(elemen)o(ts,)g(starting)g(with)h(1.)240 317 y(If)f(more)g(than)g(one)h(argumen)o(t)e(is)i(giv)o(en,)f(they)g (are)g(in)o(terpreted)h(as)360 377 y Fr(plot)23 b(\(x)h([,)f(y])h([,)g (fmt])f(...\))240 449 y Fv(where)17 b Fp(y)k Fv(and)c Fp(fm)o(t)g Fv(are)g(optional,)g(and)g(an)o(y)g(n)o(um)o(b)q(er)g(of)g (argumen)o(t)f(sets)g(ma)o(y)h(app)q(ear.)25 b(The)17 b Fp(x)240 511 y Fv(and)e Fp(y)k Fv(v)m(alues)e(are)e(in)o(terpreted)g (as)g(follo)o(ws:)277 583 y Ft(\017)30 b Fv(If)18 b(a)f(single)h(data)f (argumen)o(t)g(is)h(supplied,)i(it)d(is)h(tak)o(en)f(as)g(the)h(set)f (of)g Fp(y)k Fv(co)q(ordinates)d(and)330 645 y(the)d Fp(x)k Fv(co)q(ordinates)c(are)g(tak)o(en)g(to)f(b)q(e)i(the)f(indices) j(of)c(the)i(elemen)o(ts,)f(starting)g(with)g(1.)277 717 y Ft(\017)30 b Fv(If)21 b(the)h(\014rst)f(argumen)o(t)f(is)i(a)f(v) o(ector)f(and)i(the)f(second)h(is)f(a)g(matrix,)h(the)g(the)f(v)o (ector)f(is)330 780 y(plotted)14 b(v)o(ersus)g(the)g(columns)h(\(or)e (ro)o(ws\))g(of)h(the)g(matrix.)19 b(\(using)14 b(whic)o(hev)o(er)h (com)o(bination)330 842 y(matc)o(hes,)f(with)i(columns)g(tried)g (\014rst.\))277 914 y Ft(\017)30 b Fv(If)17 b(the)g(\014rst)g(argumen)o (t)f(is)i(a)f(matrix)f(and)h(the)h(second)f(is)h(a)e(v)o(ector,)h(the)g (the)g(columns)h(\(or)330 976 y(ro)o(ws\))e(of)h(the)g(matrix)g(are)g (plotted)g(v)o(ersus)g(the)h(v)o(ector.)25 b(\(using)17 b(whic)o(hev)o(er)h(com)o(bination)330 1038 y(matc)o(hes,)c(with)i (columns)g(tried)g(\014rst.\))277 1110 y Ft(\017)30 b Fv(If)17 b(b)q(oth)h(argumen)o(ts)e(are)h(v)o(ectors,)f(the)h(elemen)o (ts)h(of)f Fp(y)k Fv(are)c(plotted)g(v)o(ersus)g(the)g(elemen)o(ts)330 1173 y(of)e Fp(x)p Fv(.)277 1245 y Ft(\017)30 b Fv(If)17 b(b)q(oth)f(argumen)o(ts)g(are)g(matrices,)g(the)g(columns)i(of)e Fp(y)k Fv(are)c(plotted)h(v)o(ersus)f(the)g(columns)330 1307 y(of)e Fp(x)p Fv(.)19 b(In)c(this)g(case,)f(b)q(oth)g(matrices)g (m)o(ust)g(ha)o(v)o(e)f(the)i(same)e(n)o(um)o(b)q(er)i(of)f(ro)o(ws)f (and)h(columns)330 1369 y(and)i(no)g(attempt)f(is)h(made)g(to)f(transp) q(ose)g(the)h(argumen)o(ts)f(to)g(mak)o(e)h(the)f(n)o(um)o(b)q(er)i(of) e(ro)o(ws)330 1431 y(matc)o(h.)330 1503 y(If)g(b)q(oth)h(argumen)o(ts)e (are)h(scalars,)g(a)g(single)h(p)q(oin)o(t)g(is)g(plotted.)240 1585 y(The)i Fp(fm)o(t)h Fv(argumen)o(t,)e(if)i(presen)o(t)f(is)h(in)o (trepreted)f(as)g(follo)o(ws.)29 b(If)18 b Fp(fm)o(t)g Fv(is)h(missing,)g(the)f(default)240 1647 y(gn)o(uplot)d(line)i(st)o (yle)f(is)f(assumed.)240 1729 y(`)p Fr(-)p Fv(')190 b(Set)15 b(lines)i(plot)f(st)o(yle)f(\(default\).)240 1811 y(`)p Fr(.)p Fv(')190 b(Set)15 b(dots)g(plot)g(st)o(yle.)240 1892 y(`)p Fr(@)p Fv(')190 b(Set)15 b(p)q(oin)o(ts)h(plot)f(st)o(yle.) 240 1974 y(`)p Fr(-@)p Fv(')166 b(Set)15 b(linesp)q(oin)o(ts)j(plot)d (st)o(yle.)240 2056 y(`)p Fr(^)p Fv(')190 b(Set)15 b(impulses)i(plot)f (st)o(yle.)240 2137 y(`)p Fr(L)p Fv(')190 b(Set)15 b(steps)g(plot)h(st) o(yle.)240 2219 y(`)p Fr(#)p Fv(')190 b(Set)15 b(b)q(o)o(xes)h(plot)f (st)o(yle.)240 2301 y(`)p Fr(~)p Fv(')190 b(Set)15 b(errorbars)f(plot)i (st)o(yle.)240 2382 y(`)p Fr(#~)p Fv(')166 b(Set)15 b(b)q(o)o (xerrorbars)f(plot)i(st)o(yle.)240 2464 y(`)p Fr(n)p Fv(')190 b(In)o(terpreted)16 b(as)e(the)i(plot)f(color)g(if)h Fp(n)f Fv(is)h(an)f(in)o(teger)h(in)g(the)f(range)g(1)g(to)f(6.)240 2545 y(`)p Fr(nm)p Fv(')166 b(If)17 b Fp(nm)h Fv(is)f(a)g(t)o(w)o(o)f (digit)i(in)o(teger)f(and)g Fp(m)g Fv(is)h(an)f(in)o(teger)g(in)h(the)g (range)e(1)h(to)g(6,)f Fp(m)h Fv(is)480 2608 y(in)o(terpreted)g(as)g (the)g(p)q(oin)o(t)g(st)o(yle.)24 b(This)18 b(is)f(only)g(v)m(alid)i (in)e(com)o(bination)h(with)f(the)480 2670 y Fr(@)e Fv(or)g Fr(-@)g Fv(sp)q(eci\014ers.)p eop %%Page: 110 112 110 111 bop 0 -58 a Fv(110)1743 b(Octa)o(v)o(e)240 183 y(`)p Fr(c)p Fv(')190 b(If)16 b Fp(c)i Fv(is)e(one)f(of)g Fr(")p Fp(r)p Fr(")p Fv(,)g Fr(")p Fp(g)p Fr(")p Fv(,)f Fr(")p Fp(b)p Fr(")p Fv(,)h Fr(")p Fp(m)p Fr(")p Fv(,)g Fr(")p Fp(c)p Fr(")p Fv(,)f(or)h Fr(")p Fp(w)p Fr(")p Fv(,)g(it)g(is)h(in)o(terpreted)g(as)f(the)h(plot)480 246 y(color)f(\(red,)g(green,)g(blue,)h(magen)o(ta,)e(cy)o(an,)g(or)h (white\).)240 330 y(`)p Fr(+)p Fv(')240 392 y(`)p Fr(*)p Fv(')240 455 y(`)p Fr(o)p Fv(')240 517 y(`)p Fr(x)p Fv(')190 b(Used)21 b(in)g(com)o(bination)g(with)f(the)g(p)q(oin)o(ts)h(or)f (linesp)q(oin)o(ts)i(st)o(yles,)f(set)f(the)g(p)q(oin)o(t)480 579 y(st)o(yle.)240 664 y(The)15 b(color)h(line)h(st)o(yles)e(ha)o(v)o (e)g(the)g(follo)o(wing)h(meanings)g(on)f(terminals)h(that)e(supp)q (ort)h(color.)360 725 y Fr(Number)47 b(Gnuplot)23 b(colors)47 b(\(lines\)points)22 b(style)408 774 y(1)167 b(red)453 b(*)408 824 y(2)167 b(green)405 b(+)408 874 y(3)167 b(blue)429 b(o)408 924 y(4)167 b(magenta)357 b(x)408 974 y(5)167 b(cyan)381 b(house)408 1024 y(6)167 b(brown)285 b(there)23 b(exists)240 1097 y Fv(Here)15 b(are)g(some)g(plot)h(examples:)360 1158 y Fr(plot)23 b(\(x,)h(y,)f("@12",)g(x,)h(y2,)f(x,)h(y3,)f("4",)h (x,)f(y4,)h("+"\))240 1231 y Fv(This)16 b(command)f(will)j(plot)d Fp(y)20 b Fv(with)c(p)q(oin)o(ts)g(of)f(t)o(yp)q(e)g(2)g(\(displa)o(y)o (ed)i(as)e Fr(+)p Fv(\))g(and)h(color)f(1)g(\(red\),)g Fp(y2)240 1294 y Fv(with)h(lines,)g Fp(y3)i Fv(with)e(lines)h(of)e (color)g(4)g(\(magen)o(ta\))e(and)i Fp(y4)k Fv(with)c(p)q(oin)o(ts)h (displa)o(y)o(ed)h(as)d Fr(+)p Fv(.)360 1355 y Fr(plot)23 b(\(b,)h("*"\))240 1428 y Fv(This)16 b(command)f(will)i(plot)e(the)g (data)g(in)h Fp(b)g Fv(will)h(b)q(e)f(plotted)g(with)f(p)q(oin)o(ts)h (displa)o(y)o(ed)g(as)f Fr(*)p Fv(.)0 1512 y Fr(hold)144 b Fv(T)l(ell)17 b(Octa)o(v)o(e)d(to)h(`hold')g(the)g(curren)o(t)g(data) g(on)g(the)g(plot)h(when)f(executing)i(subsequen)o(t)e(plotting)240 1575 y(commands.)k(This)14 b(allo)o(ws)f(y)o(ou)g(to)f(execute)i(a)f (series)h(of)f(plot)g(commands)g(and)g(ha)o(v)o(e)g(all)h(the)f(lines) 240 1637 y(end)i(up)f(on)g(the)g(same)g(\014gure.)20 b(The)14 b(default)g(is)h(for)e(eac)o(h)h(new)h(plot)f(command)g(to)f (clear)i(the)f(plot)240 1699 y(device)j(\014rst.)i(F)l(or)c(example,)g (the)h(command)360 1760 y Fr(hold)23 b(on)240 1834 y Fv(turns)17 b(the)g(hold)g(state)f(on.)25 b(An)17 b(argumen)o(t)f(of)g Fr(off)g Fv(turns)h(the)g(hold)h(state)d(o\013,)h(and)h Fr(hold)g Fv(with)240 1896 y(no)e(argumen)o(ts)f(toggles)h(the)h (curren)o(t)f(hold)h(state.)0 1980 y Fr(ishold)96 b Fv(Returns)16 b(1)e(if)i(the)f(next)g(line)i(will)f(b)q(e)g(added)g(to)e(the)h (curren)o(t)g(plot,)g(or)f(0)h(if)h(the)f(plot)g(device)h(will)240 2043 y(b)q(e)g(cleared)g(b)q(efore)g(dra)o(wing)f(the)g(next)g(line.)0 2127 y Fr(loglog)f(\()p Fp(args)r Fr(\))240 2190 y Fv(Mak)o(e)e(a)g(t)o (w)o(o-dimensional)i(plot)f(using)h(log)e(scales)i(for)e(b)q(oth)h (axes.)19 b(See)13 b(the)g(description)h(of)f Fr(plot)240 2252 y Fv(ab)q(o)o(v)o(e)i(for)f(a)h(description)i(of)e(the)g(argumen)o (ts)f(that)h Fr(loglog)f Fv(will)j(accept.)0 2336 y Fr(semilogx)d(\()p Fp(args)r Fr(\))240 2399 y Fv(Mak)o(e)k(a)g(t)o(w)o(o-dimensional)h (plot)f(using)h(a)f(log)h(scale)g(for)e(the)i Fp(x)i Fv(axis.)29 b(See)19 b(the)g(description)g(of)240 2461 y Fr(plot)c Fv(ab)q(o)o(v)o(e)f(for)h(a)g(description)i(of)d(the)i (argumen)o(ts)e(that)g Fr(semilogx)g Fv(will)j(accept.)0 2545 y Fr(semilogy)d(\()p Fp(args)r Fr(\))240 2608 y Fv(Mak)o(e)k(a)f(t)o(w)o(o-dimensional)j(plot)e(using)h(a)f(log)g (scale)h(for)f(the)g Fp(y)k Fv(axis.)29 b(See)19 b(the)g(description)g (of)240 2670 y Fr(plot)c Fv(ab)q(o)o(v)o(e)f(for)h(a)g(description)i (of)d(the)i(argumen)o(ts)e(that)g Fr(semilogy)g Fv(will)j(accept.)p eop %%Page: 111 113 111 112 bop 0 -58 a Fv(Chapter)15 b(18:)k(Plotting)1465 b(111)0 183 y Fr(contour)14 b(\()p Fp(z)p Fr(,)h Fp(n)p Fr(,)h Fp(x)p Fr(,)f Fp(y)t Fr(\))240 246 y Fv(Mak)o(e)h(a)h(con)o (tour)f(plot)i(of)e(the)h(three-dimensional)j(surface)d(describ)q(ed)i (b)o(y)d Fp(z)p Fv(.)26 b(Someone)17 b(needs)240 308 y(to)e(impro)o(v)o(e)g Fr(gnuplot)p Fv('s)e(con)o(tour)i(routines)h(b)q (efore)f(this)h(will)h(b)q(e)e(v)o(ery)g(useful.)0 390 y Fr(polar)f(\()p Fp(theta)p Fr(,)h Fp(rho)r Fr(\))240 452 y Fv(Mak)o(e)f(a)h(t)o(w)o(o-dimensional)h(plot)g(giv)o(en)g(p)q (olar)f(the)g(co)q(ordinates)h Fp(theta)f Fv(and)g Fp(rho)p Fv(.)0 580 y Fu(18.2)32 b(Three-Dimensional)15 b(Plotting)62 684 y Fv(The)h(syn)o(tax)e(for)h(Octa)o(v)o(e's)f(three-dimensional)k (plotting)d(function,)h Fr(gsplot)p Fv(,)e(is)120 754 y Fr(gsplot)23 b Fp(ranges)i(expression)g(using)k(title)e(st)o(yle)0 837 y Fv(where)21 b(the)f Fp(ranges)p Fv(,)h Fp(using)p Fv(,)h Fp(title)p Fv(,)h(and)d Fp(st)o(yle)j Fv(argumen)o(ts)d(are)g (optional,)i(and)f(the)f Fp(using)p Fv(,)i Fp(title)i Fv(and)d Fp(st)o(yle)0 900 y Fv(quali\014ers)e(ma)o(y)e(app)q(ear)h(in) g(an)o(y)f(order)h(after)f(the)g(expression.)28 b(Y)l(ou)18 b(ma)o(y)f(plot)h(m)o(ultiple)h(expressions)g(with)0 962 y(a)h(single)h(command)f(b)o(y)g(separating)g(them)g(with)g (commas.)34 b(Eac)o(h)20 b(expression)h(ma)o(y)e(ha)o(v)o(e)h(its)g(o)o (wn)g(set)f(of)0 1024 y(quali\014ers.)62 1107 y(The)d(optional)f(item)h Fp(ranges)h Fv(has)e(the)g(syn)o(tax)120 1178 y Fr([)24 b(x_lo)f(:)h(x_up)f(])h([)g(y_lo)f(:)h(y_up)f(])h([)f(z_lo)h(:)f(z_up)h (])0 1261 y Fv(and)16 b(ma)o(y)e(b)q(e)i(used)g(to)f(sp)q(ecify)h(the)g (ranges)f(for)g(the)g(axes)g(of)g(the)h(plot,)f(indep)q(enden)o(t)j(of) c(the)i(actual)f(range)g(of)0 1323 y(the)f(data.)19 b(The)14 b(range)f(for)g(the)h(y)g(and)g(z)g(axes)f(and)h(an)o(y)f(of)h(the)g (individual)j(limits)e(ma)o(y)e(b)q(e)h(omitted.)19 b(A)14 b(range)0 1385 y Fr([:])h Fv(indicates)j(that)d(the)g(default)i(limits) g(should)g(b)q(e)f(used.)22 b(This)16 b(normally)h(means)f(that)f(a)g (range)g(just)h(large)0 1447 y(enough)g(to)e(include)k(all)e(the)f (data)g(p)q(oin)o(ts)g(will)i(b)q(e)f(used.)62 1530 y(The)h(expression) h(to)e(b)q(e)h(plotted)g(m)o(ust)f(not)h(con)o(tain)f(an)o(y)h(literal) h(matrices)e(\(e.g.)24 b Fr([)15 b(1,)g(2;)g(3,)g(4)g(])p Fv(\))h(since)0 1593 y(it)f(is)h(nearly)g(imp)q(ossible)h(to)e (distinguish)i(a)e(plot)h(range)e(from)h(a)g(matrix)g(of)f(data.)62 1676 y(See)i(the)f(help)i(for)d Fr(gnuplot)h Fv(for)f(a)h(description)i (of)e(the)g(syn)o(tax)f(for)h(the)g(optional)h(items.)62 1759 y(By)g(default,)g(the)f Fr(gsplot)g Fv(command)g(plots)h(eac)o(h)f (column)h(of)f(the)h(expression)g(as)f(the)h(z)f(v)m(alue,)i(using)f (the)0 1821 y(ro)o(w)e(index)i(as)e(the)h(x)f(v)m(alue,)i(and)f(the)g (column)g(index)h(as)e(the)h(y)g(v)m(alue.)21 b(The)15 b(indices)h(are)f(coun)o(ted)g(from)e(zero,)0 1883 y(not)i(one.)20 b(F)l(or)14 b(example,)120 1954 y Fr(gsplot)23 b(rand)g(\(5,)h(2\))0 2037 y Fv(will)17 b(plot)f(a)f(random)h(surface,)f(with)h(the)g(x)f (and)h(y)g(v)m(alues)g(tak)o(en)f(from)g(the)h(ro)o(w)f(and)h(column)g (indices)i(of)d(the)0 2099 y(matrix.)62 2182 y(If)k(parametric)f (plotting)h(mo)q(de)f(is)h(set)f(\(using)h(the)f(command)g(`)p Fr(set)d(parametric)p Fv(',)i(then)h Fr(gsplot)g Fv(tak)o(es)0 2244 y(the)c(columns)h(of)f(the)g(matrix)g(three)g(at)g(a)g(time)g(as)g (the)g(x,)g(y)g(and)h(z)f(v)m(alues)h(that)f(de\014ne)h(a)f(line)i(in)f (three)f(space.)0 2307 y(An)o(y)k(extra)e(columns)j(are)e(ignored,)h (and)g(the)g(x)f(and)h(y)f(v)m(alues)i(are)e(exp)q(ected)i(to)e(b)q(e)h (sorted.)27 b(F)l(or)16 b(example,)0 2369 y(with)g(`)p Fr(parametric)p Fv(')d(set,)h(it)i(mak)o(es)e(sense)i(to)e(plot)i(a)f (matrix)g(lik)o(e)656 2413 y Fh(2)656 2486 y(6)656 2513 y(4)691 2447 y Fv(1)45 b(1)g(3)g(2)h(1)f(6)g(3)g(1)g(9)691 2510 y(1)g(2)g(2)g(2)h(2)f(5)g(3)g(2)g(8)691 2572 y(1)g(3)g(1)g(2)h(3)f (4)g(3)g(3)g(7)1267 2413 y Fh(3)1267 2486 y(7)1267 2513 y(5)0 2670 y Fv(but)15 b(not)g Fr(rand)g(\(5,)f(30\))p Fv(.)p eop %%Page: 112 114 112 113 bop 0 -58 a Fv(112)1743 b(Octa)o(v)o(e)62 183 y(The)16 b Fq(Ma)m(tlab)p Fv(-st)o(yle)f(three-dimensional)j(plotting)e (commands)f(are:)0 280 y Fr(mesh)g(\()p Fp(x)p Fr(,)f Fp(y)p Fr(,)h Fp(z)s Fr(\))240 343 y Fv(Plot)j(a)f(mesh)h(giv)o(en)g (matrices)g Fr(x)p Fv(,)g(and)g Fp(y)j Fv(from)c Fr(meshdom)g Fv(and)h(a)f(matrix)h Fp(z)i Fv(corresp)q(onding)f(to)240 405 y(the)c Fp(x)k Fv(and)c Fp(y)k Fv(co)q(ordinates)d(of)e(the)i (mesh.)0 494 y Fr(meshdom)e(\()p Fp(x)p Fr(,)h Fp(y)t Fr(\))240 556 y Fv(Giv)o(en)g(v)o(ectors)f(of)h Fp(x)j Fv(and)d Fp(y)k Fv(co)q(ordinates,)c(return)f(t)o(w)o(o)g(matrices)h (corresp)q(onding)h(to)e(the)h Fp(x)j Fv(and)240 618 y Fp(y)h Fv(co)q(ordinates)d(of)e(the)i(mesh.)240 694 y(See)g(the)f(\014le)h(`)p Fr(sombrero.m)p Fv(')d(for)i(an)g(example)h (of)f(using)h Fr(mesh)e Fv(and)i Fr(meshdom)p Fv(.)0 830 y Fu(18.3)32 b(Miscellaneous)15 b(Plotting)i(F)-6 b(unctions)0 948 y Fr(bar)15 b(\()p Fp(x)p Fr(,)g Fp(y)t Fr(\))240 1011 y Fv(Giv)o(en)h(t)o(w)o(o)d(v)o(ectors)i(of)g(x-y)g (data,)f Fr(bar)h Fv(pro)q(duces)h(a)f(bar)g(graph.)240 1086 y(If)g(only)h(one)f(argumen)o(t)f(is)i(giv)o(en,)f(it)g(is)h(tak)o (en)f(as)f(a)h(v)o(ector)f(of)h(y-v)m(alues)h(and)f(the)h(x)f(co)q (ordinates)240 1148 y(are)g(tak)o(en)g(to)f(b)q(e)i(the)f(indices)j(of) c(the)i(elemen)o(ts.)240 1224 y(If)k(t)o(w)o(o)e(output)h(argumen)o(ts) g(are)g(sp)q(eci\014ed,)k(the)d(data)e(are)i(generated)f(but)h(not)f (plotted.)34 b(F)l(or)240 1286 y(example,)360 1349 y Fr(bar)23 b(\(x,)h(y\);)240 1425 y Fv(and)360 1488 y Fr([xb,)f(yb])h(=)f(bar)h(\(x,)f(y\);)360 1538 y(plot)g(\(xb,)h(yb\);) 240 1614 y Fv(are)15 b(equiv)m(alen)o(t.)0 1702 y Fr(grid)144 b Fv(F)l(or)15 b(t)o(w)o(o-dimensional)h(plotting,)f(force)g(the)g (displa)o(y)i(of)d(a)h(grid)h(on)f(the)g(plot.)0 1791 y Fr(stairs)f(\()p Fp(x)p Fr(,)h Fp(y)t Fr(\))240 1854 y Fv(Giv)o(en)h(t)o(w)o(o)d(v)o(ectors)i(of)g(x-y)g(data,)f(bar)h(pro)q (duces)h(a)f(`stairstep')f(plot.)240 1929 y(If)h(only)h(one)f(argumen)o (t)f(is)i(giv)o(en,)f(it)g(is)h(tak)o(en)f(as)f(a)h(v)o(ector)f(of)h (y-v)m(alues)h(and)f(the)h(x)f(co)q(ordinates)240 1991 y(are)g(tak)o(en)g(to)f(b)q(e)i(the)f(indices)j(of)c(the)i(elemen)o (ts.)240 2067 y(If)k(t)o(w)o(o)e(output)h(argumen)o(ts)g(are)g(sp)q (eci\014ed,)k(the)d(data)e(are)i(generated)f(but)h(not)f(plotted.)34 b(F)l(or)240 2129 y(example,)360 2192 y Fr(stairs)23 b(\(x,)g(y\);)240 2268 y Fv(and)360 2331 y Fr([xs,)g(ys])h(=)f(stairs)h (\(x,)f(y\);)360 2381 y(plot)g(\(xs,)h(ys\);)240 2457 y Fv(are)15 b(equiv)m(alen)o(t.)0 2545 y Fr(title)f(\()p Fp(string)t Fr(\))240 2608 y Fv(Sp)q(ecify)21 b(a)e(title)h(for)f(the)g (plot.)33 b(If)19 b(y)o(ou)g(already)h(ha)o(v)o(e)f(a)g(plot)h(displa)o (y)o(ed,)h(use)f(the)f(command)240 2670 y Fr(replot)14 b Fv(to)h(redispla)o(y)h(it)g(with)f(the)g(new)h(title.)p eop %%Page: 113 115 113 114 bop 0 -58 a Fv(Chapter)15 b(18:)k(Plotting)1465 b(113)0 183 y Fr(xlabel)14 b(\()p Fp(string)t Fr(\))0 246 y(ylabel)g(\()p Fp(string)t Fr(\))240 308 y Fv(Sp)q(ecify)k(x)f (and)f(y)h(axis)g(lab)q(els)h(for)e(the)g(plot.)24 b(If)17 b(y)o(ou)f(already)h(ha)o(v)o(e)f(a)g(plot)h(displa)o(y)o(ed,)h(use)f (the)240 370 y(command)e Fr(replot)f Fv(to)h(redispla)o(y)h(it)g(with)f (the)h(new)f(lab)q(els.)0 457 y Fr(sombrero)f(\()p Fp(n)p Fr(\))240 519 y Fv(Displa)o(y)h(a)f(classic)h(three-dimensional)i(mesh) e(plot.)k(The)c(parameter)e Fp(n)i Fv(allo)o(ws)f(y)o(ou)g(to)g (increase)240 581 y(the)h(resolution.)0 668 y Fr(clearplot)0 730 y(clg)168 b Fv(Clear)23 b(the)g(plot)h(windo)o(w)f(and)g(an)o(y)g (titles)g(or)g(axis)g(lab)q(els.)45 b(The)23 b(name)g Fr(clg)g Fv(is)h(aliased)g(to)240 793 y Fr(clearplot)14 b Fv(for)g(compatibilit)o(y)j(with)f Fq(Ma)m(tlab)p Fv(.)240 867 y(The)h(commands)g(`)p Fr(gplot)d(clear)p Fv(',)i(`)p Fr(gsplot)e(clear)p Fv(',)i(and)h(`)p Fr(replot)d(clear)p Fv(')i(are)h(equiv)m(alen)o(t)i(to)240 929 y(`)p Fr(clearplot)p Fv('.)i(\(Previously)l(,)c(commands)f(lik)o(e)h(`)p Fr(gplot)d(clear)p Fv(')h(w)o(ould)i(ev)m(aluate)g(`)p Fr(clear)p Fv(')d(as)i(an)240 992 y(ordinary)f(expression)h(and)g(clear)f(all)i(the)e(visible)i(v)m (ariables.\))0 1079 y Fr(closeplot)240 1141 y Fv(Close)f(stream)e(to)h (the)h Fr(gnuplot)e Fv(subpro)q(cess.)22 b(If)16 b(y)o(ou)f(are)g (using)h(X11,)f(this)h(will)h(close)f(the)g(plot)240 1203 y(windo)o(w.)0 1290 y Fr(purge_tmp_files)240 1352 y Fv(Delete)g(the)f(temp)q(orary)g(\014les)h(created)f(b)o(y)g(the)g (plotting)h(commands.)240 1427 y(Octa)o(v)o(e)d(creates)g(temp)q(orary) f(data)g(\014les)i(for)f Fr(gnuplot)f Fv(and)h(then)h(sends)g(commands) e(to)h Fr(gnuplot)240 1489 y Fv(through)j(a)g(pip)q(e.)25 b(Octa)o(v)o(e)16 b(will)i(delete)g(the)e(temp)q(orary)g(\014les)i(on)e (exit,)h(but)f(if)h(y)o(ou)f(are)g(doing)h(a)240 1551 y(lot)e(of)g(plotting)h(y)o(ou)f(ma)o(y)f(w)o(an)o(t)g(to)h(clean)h(up) f(in)i(the)e(middle)i(of)e(a)f(session.)240 1626 y(A)j(future)h(v)o (ersion)f(of)g(Octa)o(v)o(e)g(will)i(eliminate)g(the)f(need)g(to)e(use) i(temp)q(orary)f(\014les)h(to)f(hold)h(the)240 1688 y(plot)d(data.)0 1775 y Fr(axis)g(\()p Fp(limits)r Fr(\))240 1837 y Fv(Sets)g(the)g (axis)h(limits)g(for)f(plots.)240 1912 y(The)c(argumen)o(t)f Fp(limits)j Fv(should)f(b)q(e)f(a)f(2,)h(4,)g(or)f(6)g(elemen)o(t)i(v)o (ector.)17 b(The)11 b(\014rst)f(and)h(second)g(elemen)o(ts)240 1974 y(sp)q(ecify)20 b(the)f(lo)o(w)o(er)g(and)g(upp)q(er)h(limits)g (for)f(the)g(x)g(axis.)31 b(The)19 b(second)h(and)f(third)h(sp)q(ecify) g(the)240 2036 y(limits)d(for)d(the)h(y)h(axis,)f(and)g(the)g(fourth)g (and)g(\014fth)h(sp)q(ecify)g(the)f(limits)i(for)d(the)i(z)f(axis.)240 2111 y(With)g(no)h(argumen)o(ts,)e Fr(axis)g Fv(turns)h(autoscaling)h (on.)240 2185 y(If)11 b(y)o(our)f(plot)h(is)g(already)g(dra)o(wn,)g (then)g(y)o(ou)g(need)g(to)f(use)i Fr(replot)d Fv(b)q(efore)i(the)g (new)g(axis)g(limits)h(will)240 2247 y(tak)o(e)k(e\013ect.)24 b(Y)l(ou)17 b(can)g(get)f(this)h(to)f(happ)q(en)i(automatically)f(b)o (y)g(setting)g(the)f(built-in)k(v)m(ariable)240 2310 y Fr(automatic_replot)13 b Fv(to)i Fr("true")p Fv(.)k(See)c(Section)h (6.2)f([User)f(Preferences],)h(page)h(62.)0 2396 y Fr(hist)f(\()p Fp(y)p Fr(,)f Fp(x)s Fr(\))240 2459 y Fv(Pro)q(duce)i(histogram)e(coun) o(ts)h(or)g(plots.)240 2533 y(With)20 b(one)f(v)o(ector)g(input)i (argumen)o(t,)e(plot)h(a)f(histogram)g(of)g(the)g(v)m(alues)i(with)f (10)f(bins.)34 b(The)240 2595 y(range)15 b(of)g(the)g(histogram)f(bins) j(is)e(determined)i(b)o(y)e(the)g(range)g(of)g(the)g(data.)240 2670 y(Giv)o(en)h(a)f(second)g(scalar)g(argumen)o(t,)f(use)i(that)e(as) h(the)h(n)o(um)o(b)q(er)f(of)g(bins.)p eop %%Page: 114 116 114 115 bop 0 -58 a Fv(114)1743 b(Octa)o(v)o(e)240 183 y(Giv)o(en)15 b(a)f(second)h(v)o(ector)f(argumen)o(t,)g(use)h(that)f (as)g(the)h(cen)o(ters)f(of)g(the)h(bins,)h(with)e(the)h(width)g(of)240 246 y(the)g(bins)h(determined)h(from)d(the)i(adjacen)o(t)f(v)m(alues)h (in)g(the)f(v)o(ector.)240 320 y(Extreme)g(v)m(alues)h(are)f(lump)q(ed) i(in)f(the)f(\014rst)g(and)g(last)h(bins.)240 395 y(With)j(t)o(w)o(o)e (output)i(argumen)o(ts,)f(pro)q(duce)i(the)f(v)m(alues)h Fp(nn)f Fv(and)g Fp(xx)j Fv(suc)o(h)d(that)f Fr(bar)d(\()p Fp(xx)p Fr(,)g Fp(nn)p Fr(\))240 457 y Fv(will)i(plot)e(the)h (histogram.)p eop %%Page: 115 117 115 116 bop 0 -58 a Fv(Chapter)15 b(19:)f(Image)h(Pro)q(cessing)1288 b(115)0 183 y Fs(19)41 b(Image)14 b(Pro)r(cessing)62 319 y Fv(T)l(o)g(displa)o(y)g(images)g(using)g(these)g(functions,)g(y)o (ou)f(m)o(ust)g(b)q(e)h(using)h(Octa)o(v)o(e)e(with)h(the)f(X)h(Windo)o (w)f(System,)0 381 y(and)j(y)o(ou)g(m)o(ust)g(ha)o(v)o(e)g(either)h Fr(xloadimage)e Fv(or)g Fr(xv)h Fv(installed.)25 b(Y)l(ou)17 b(do)f(not)g(need)h(to)f(b)q(e)g(running)i(X)e(in)h(order)0 443 y(to)e(manipulate)j(images,)e(ho)o(w)o(ev)o(er,)f(so)g(some)h(of)g (these)g(functions)h(ma)o(y)e(b)q(e)i(useful)g(ev)o(en)g(if)f(y)o(ou)g (are)g(not)f(able)0 506 y(to)g(view)g(the)h(results.)0 602 y Fr(colormap)48 b Fv(Set)15 b(the)h(curren)o(t)f(colormap.)240 677 y Fr(colormap)f(\()p Fp(map)q Fr(\))f Fv(sets)g(the)g(curren)o(t)f (colormap)h(to)g Fp(map)p Fv(.)18 b(The)c(color)f(map)f(should)i(b)q(e) g(an)f Fp(n)g Fv(ro)o(w)240 740 y(b)o(y)h(3)f(column)i(matrix.)k(The)c (columns)f(con)o(tain)g(red,)h(green,)e(and)i(blue)g(in)o(tensities)g (resp)q(ectiv)o(ely)l(.)240 802 y(All)h(en)o(tries)g(should)g(b)q(e)g (b)q(et)o(w)o(een)g(0)f(and)g(1)g(inclusiv)o(e.)22 b(The)15 b(new)h(colormap)f(is)h(returned.)240 877 y Fr(colormap)e (\("default"\))i Fv(restores)g(the)h(default)h(colormap)f(\(a)f(gra)o (y)g(scale)i(colormap)f(with)h(64)240 939 y(en)o(tries\).)i(The)15 b(default)h(colormap)f(is)h(returned.)240 1015 y(With)f(no)h(argumen)o (ts,)e Fr(colormap)g Fv(returns)h(the)g(curren)o(t)g(color)g(map.)0 1103 y Fr(gray)g(\()p Fp(n)p Fr(\))56 b Fv(Create)16 b(a)g(gra)o(y)f(colormap)i(with)f(v)m(alues)i(from)d(0)i(to)e Fp(n)p Fv(.)24 b(The)17 b(argumen)o(t)e Fp(n)i Fv(should)g(b)q(e)g(a)f (scalar.)240 1165 y(If)f(it)h(is)g(omitted,)e(64)h(is)h(assumed.)0 1253 y Fr(gray2ind)48 b Fv(Con)o(v)o(ert)14 b(a)h(gra)o(y)f(scale)i(in) o(tensit)o(y)g(image)f(to)g(an)g(Octa)o(v)o(e)g(indexed)i(image.)0 1342 y Fr(image)120 b Fv(Displa)o(y)16 b(an)f(Octa)o(v)o(e)g(image)g (matrix.)240 1417 y Fr(image)f(\()p Fp(x)s Fr(\))j Fv(displa)o(ys)g(a)f (matrix)g(as)g(a)g(color)h(image.)23 b(The)17 b(elemen)o(ts)g(of)f Fp(x)j Fv(are)d(indices)j(in)o(to)d(the)240 1479 y(curren)o(t)f (colormap)g(and)h(should)g(ha)o(v)o(e)f(v)m(alues)h(b)q(et)o(w)o(een)f (1)g(and)h(the)f(length)h(of)f(the)g(colormap.)240 1554 y Fr(image)f(\()p Fp(x)p Fr(,)h Fp(zo)q(om)p Fr(\))g Fv(c)o(hanges)g(the)h(zo)q(om)f(factor.)j(The)e(default)g(v)m(alue)g (is)g(4.)0 1643 y Fr(imagesc)72 b Fv(Scale)16 b(and)g(displa)o(y)g(a)f (matrix)g(as)f(an)i(image.)240 1718 y Fr(imagesc)e(\()p Fp(x)s Fr(\))g Fv(displa)o(ys)h(a)e(scaled)i(v)o(ersion)f(of)g(the)g (matrix)f Fp(x)p Fv(.)19 b(The)c(matrix)e(is)h(scaled)h(so)f(that)f (its)240 1780 y(en)o(tries)j(are)e(indices)k(in)o(to)d(the)g(curren)o (t)g(colormap.)20 b(The)15 b(scaled)i(matrix)d(is)i(returned.)240 1855 y Fr(imagesc)e(\()p Fp(x)p Fr(,)h Fp(zo)q(om)p Fr(\))g Fv(sets)g(the)g(magni\014cation,)h(the)f(default)h(v)m(alue)g(is)g(4.)0 1943 y Fr(imshow)96 b Fv(Displa)o(y)16 b(images.)240 2019 y Fr(imshow)e(\()p Fp(x)s Fr(\))h Fv(displa)o(ys)i(an)e(indexed)i (image)e(using)h(the)f(curren)o(t)g(colormap.)240 2094 y Fr(imshow)f(\()p Fp(x)p Fr(,)h Fp(map)q Fr(\))g Fv(displa)o(ys)i(an)e (indexed)i(image)e(using)h(the)f(sp)q(eci\014ed)j(colormap.)240 2169 y Fr(imshow)c(\()p Fp(i)p Fr(,)i Fp(n)p Fr(\))f Fv(displa)o(ys)h(a)f(gra)o(y)f(scale)i(in)o(tensit)o(y)g(image.)240 2244 y Fr(imshow)e(\()p Fp(r)p Fr(,)h Fp(g)p Fr(,)g Fp(b)q Fr(\))g Fv(displa)o(ys)h(an)f(R)o(GB)h(image.)0 2333 y Fr(ind2gray)48 b Fv(Con)o(v)o(ert)14 b(an)h(Octa)o(v)o(e)g(indexed)i (image)e(to)g(a)g(gra)o(y)f(scale)i(in)o(tensit)o(y)g(image.)240 2408 y Fp(y)j Fr(=)c(ind2gray)f(\()p Fp(x)s Fr(\))21 b Fv(con)o(v)o(erts)f(an)h(indexed)i(image)e(to)f(a)g(gra)o(y)g(scale)i (in)o(tensit)o(y)g(image.)37 b(The)240 2470 y(curren)o(t)14 b(colormap)h(is)g(used)g(to)f(determine)h(the)g(in)o(tensities.)21 b(The)15 b(in)o(tensit)o(y)g(v)m(alues)h(lie)g(b)q(et)o(w)o(een)240 2532 y(0)f(and)g(1)g(inclusiv)o(e.)240 2608 y Fp(y)k Fr(=)c(ind2gray)f(\()p Fp(x)p Fr(,)h Fp(map)q Fr(\))h Fv(uses)g(the)g(sp)q(eci\014ed)j(colormap)d(instead)g(of)g(the)g (curren)o(t)g(one)g(in)h(the)240 2670 y(con)o(v)o(ersion)e(pro)q(cess.) p eop %%Page: 116 118 116 117 bop 0 -58 a Fv(116)1743 b(Octa)o(v)o(e)0 183 y Fr(ind2rgb)72 b Fv(Con)o(v)o(ert)14 b(an)h(indexed)i(image)e(to)g (red,)g(green,)g(and)g(blue)i(color)e(comp)q(onen)o(ts.)240 258 y Fr([)p Fp(r)p Fr(,)g Fp(g)p Fr(,)f Fp(b)q Fr(])i(=)f(ind2rgb)f (\()p Fp(x)s Fr(\))h Fv(uses)g(the)h(curren)o(t)f(colormap)g(for)f(the) i(con)o(v)o(ersion.)240 333 y Fr([)p Fp(r)p Fr(,)f Fp(g)p Fr(,)f Fp(b)q Fr(])i(=)f(ind2rgb)f(\()p Fp(x)p Fr(,)h Fp(map)q Fr(\))g Fv(uses)g(the)h(sp)q(eci\014ed)h(colormap.)0 420 y Fr(loadimage)240 482 y Fv(Load)e(an)g(image)h(\014le.)240 557 y Fr([)p Fp(x)p Fr(,)f Fp(map)q Fr(])g(=)g(loadimage)f(\()p Fp(\014le)s Fr(\))19 b Fv(loads)f(an)g(image)g(and)h(it's)f(asso)q (ciated)g(color)g(map)g(from)g(the)240 619 y(sp)q(eci\014ed)f Fp(\014le)p Fv(.)k(The)16 b(image)f(m)o(ust)g(b)q(e)g(stored)g(in)h (Octa)o(v)o(e's)f(image)g(format.)0 706 y Fr(ocean)f(\()p Fp(n)p Fr(\))33 b Fv(Create)20 b(color)g(colormap.)36 b(The)20 b(argumen)o(t)g Fp(n)g Fv(should)i(b)q(e)f(a)f(scalar.)35 b(If)21 b(it)f(is)h(omitted,)h(64)d(is)240 769 y(assumed.)0 856 y Fr(rgb2ind)72 b Fv(Con)o(v)o(ert)14 b(and)h(R)o(GB)h(image)f(to)g (an)g(Octa)o(v)o(e)f(indexed)j(image.)240 930 y Fr([)p Fp(x)p Fr(,)e Fp(map)q Fr(])g(=)g(rgb2ind)f(\()p Fp(r)p Fr(,)h Fp(g)p Fr(,)g Fp(b)q Fr(\))0 1018 y(saveimage)240 1080 y Fv(Sa)o(v)o(e)g(a)g(matrix)g(to)f(disk)i(in)g(image)f(format.) 240 1155 y Fr(saveimage)f(\()p Fp(\014le)p Fr(,)i Fp(x)s Fr(\))22 b Fv(sa)o(v)o(es)f(matrix)g Fp(x)k Fv(to)c Fp(\014le)26 b Fv(in)d(Octa)o(v)o(e's)e(image)g(format.)39 b(The)22 b(curren)o(t)240 1217 y(colormap)15 b(is)h(also)f(sa)o(v)o(ed)g(in)h (the)f(\014le.)240 1292 y Fr(saveimage)f(\()p Fp(\014le)p Fr(,)i Fp(x)p Fr(,)f("img"\))g Fv(sa)o(v)o(es)h(the)g(image)h(in)g(the) f(default)h(format)e(and)i(is)g(the)f(same)g(as)240 1354 y Fr(saveimage)e(\()p Fp(\014le)p Fr(,)i Fp(x)s Fr(\))p Fv(.)240 1429 y Fr(saveimage)e(\()p Fp(\014le)p Fr(,)i Fp(x)p Fr(,)f("ppm"\))f Fv(sa)o(v)o(es)g(the)h(image)g(in)h(ppm)g (format)d(instead)j(of)f(the)g(default)g(Oc-)240 1491 y(ta)o(v)o(e)f(image)i(format.)240 1566 y Fr(saveimage)e(\()p Fp(\014le)p Fr(,)i Fp(x)p Fr(,)f("ps"\))e Fv(sa)o(v)o(es)h(the)g(image) g(in)h(P)o(ostScript)f(format)f(instead)h(of)g(the)g(default)240 1628 y(Octa)o(v)o(e)h(image)g(format.)k(\(Note:)h(images)15 b(sa)o(v)o(ed)g(in)h(P)o(ostScript)f(format)f(can)i(not)f(b)q(e)h(read) f(bac)o(k)240 1690 y(in)o(to)g(Octa)o(v)o(e)g(with)g(loadimage.\))240 1765 y Fr(saveimage)f(\()p Fp(\014le)p Fr(,)i Fp(x)p Fr(,)f Fp(fm)o(t)p Fr(,)f Fp(map)q Fr(\))j Fv(sa)o(v)o(es)f(the)h (image)h(along)f(with)g(the)g(sp)q(eci\014ed)i(colormap)e(in)240 1827 y(the)e(sp)q(eci\014ed)j(format.)240 1902 y(Note:)i(if)15 b(the)h(colormap)f(con)o(tains)g(only)h(t)o(w)o(o)e(en)o(tries)i(and)f (these)h(en)o(tries)g(are)f(blac)o(k)g(and)h(white,)240 1964 y(the)11 b(bitmap)h(ppm)f(and)g(P)o(ostScript)g(formats)f(are)h (used.)19 b(If)11 b(the)h(image)f(is)g(a)g(gra)o(y)f(scale)i(image)f (\(the)240 2026 y(en)o(tries)16 b(within)h(eac)o(h)f(ro)o(w)e(of)h(the) h(colormap)g(are)f(equal\))h(the)g(gra)o(y)e(scale)i(ppm)g(and)g(P)o (ostScript)240 2089 y(image)f(formats)f(are)h(used,)g(otherwise)h(the)f (full)i(color)e(formats)f(are)h(used.)p eop %%Page: 117 119 117 118 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(117)0 183 y Fs(20)41 b(Input)15 b(and)g(Output)62 324 y Fv(There)f(are)f(t)o(w)o(o)g(distinct)i(classes)f(of)f(input)i(and)f (output)f(functions.)20 b(The)14 b(\014rst)f(set)h(are)f(mo)q(deled)i (after)e(the)0 386 y(functions)18 b(a)o(v)m(ailable)i(in)e Fq(Ma)m(tlab)p Fv(.)27 b(The)18 b(second)g(set)f(are)h(mo)q(deled)g (after)f(the)h(standard)f(I/O)h(library)g(used)0 449 y(b)o(y)d(the)g(C)g(programming)g(language.)20 b(The)15 b(C-st)o(yle)g(I/O)h(functions)g(o\013er)e(more)h(\015exibilit)o(y)j (and)d(con)o(trol)g(o)o(v)o(er)0 511 y(the)g(output,)g(but)g(are)g(not) g(quite)h(as)f(easy)g(to)f(use)i(as)f(the)g(simpler)h Fq(Ma)m(tlab)p Fv(-st)o(yle)g(I/O)g(functions.)62 595 y(When)f(running)h(in)o(teractiv)o(ely)l(,)f(Octa)o(v)o(e)g(normally)g (sends)g(an)o(y)f(output)g(in)o(tended)i(for)e(y)o(our)g(terminal)i (that)0 658 y(is)g(more)e(than)h(one)g(screen)h(long)f(to)f(a)h(paging) g(program,)f(suc)o(h)h(as)g Fr(less)f Fv(or)h Fr(more)p Fv(.)k(This)c(a)o(v)o(oids)g(the)g(problem)0 720 y(of)d(ha)o(ving)h(a)g (large)g(v)o(olume)g(of)f(output)h(stream)f(b)o(y)g(b)q(efore)h(y)o(ou) g(can)g(read)f(it.)20 b(With)13 b Fr(less)f Fv(\(and)g(some)h(v)o (ersions)0 782 y(of)i Fr(more)p Fv(\))f(it)i(also)f(allo)o(ws)g(y)o(ou) g(to)f(scan)i(forw)o(ard)e(and)h(bac)o(kw)o(ard,)f(and)h(searc)o(h)g (for)g(sp)q(eci\014c)i(items.)62 867 y(No)j(output)g(is)h(displa)o(y)o (ed)g(b)o(y)f(the)h(pager)e(un)o(til)j(just)e(b)q(efore)g(Octa)o(v)o(e) g(is)h(ready)f(to)f(prin)o(t)i(the)f(top)g(lev)o(el)0 929 y(prompt,)d(or)g(read)g(from)g(the)g(standard)g(input)h(using)g (the)g Fr(fscanf)e Fv(or)h Fr(scanf)g Fv(functions.)27 b(This)17 b(means)h(that)0 991 y(there)g(ma)o(y)f(b)q(e)i(some)f(dela)o (y)g(b)q(efore)h(an)o(y)e(output)h(app)q(ears)g(on)g(y)o(our)g(screen)g (if)h(y)o(ou)f(ha)o(v)o(e)f(ask)o(ed)h(Octa)o(v)o(e)g(to)0 1054 y(p)q(erform)i(a)g(signi\014can)o(t)h(amoun)o(t)f(of)g(w)o(ork)f (with)i(a)f(single)i(command)e(statemen)o(t.)34 b(The)21 b(function)g Fr(fflush)0 1116 y Fv(ma)o(y)c(b)q(e)h(used)g(to)f(force)g (output)h(to)e(b)q(e)j(sen)o(t)e(to)g(the)g(pager)g(immediately)l(.)29 b(See)18 b(Section)h(20.2)d([C-St)o(yle)i(I/O)0 1178 y(F)l(unctions],)d(page)g(121.)62 1263 y(Y)l(ou)f(can)h(select)f(the)g (program)f(to)g(run)i(as)e(the)h(pager)g(b)o(y)g(setting)g(the)g(v)m (ariable)h Fr(PAGER)p Fv(,)e(and)h(y)o(ou)g(can)g(turn)0 1325 y(paging)j(o\013)g(b)o(y)g(setting)g(the)g(v)m(alue)i(of)e(the)g (v)m(ariable)i Fr(page_screen_output)14 b Fv(to)j(the)g(string)g(`)p Fr("false")p Fv('.)24 b(See)0 1387 y(Section)16 b(6.2)e([User)h (Preferences],)g(page)g(62.)0 1527 y Fu(20.1)32 b(Basic)15 b(Input)h(and)g(Output)62 1632 y Fv(Since)j(Octa)o(v)o(e)e(normally)h (prin)o(ts)g(the)f(v)m(alue)i(of)e(an)g(expression)h(as)f(so)q(on)h(as) f(it)g(has)h(b)q(een)g(ev)m(aluated,)h(the)0 1694 y(simplest)i(of)f (all)h(I/O)f(functions)h(is)f(a)g(simple)h(expression.)36 b(F)l(or)19 b(example,)j(the)e(follo)o(wing)g(expression)h(will)0 1756 y(displa)o(y)16 b(the)g(v)m(alue)g(of)f(pi)120 1829 y Fr(octave:13>)22 b(pi)120 1878 y(pi)i(=)f(3.1416)62 1963 y Fv(This)18 b(w)o(orks)e(w)o(ell)i(as)e(long)i(as)e(it)i(is)f (acceptable)h(to)f(ha)o(v)o(e)f(the)h(name)g(of)g(the)g(v)m(ariable)i (\(or)d(`)p Fr(ans)p Fv('\))f(prin)o(ted)0 2025 y(along)h(with)h(the)f (v)m(alue.)24 b(T)l(o)15 b(prin)o(t)i(the)f(v)m(alue)h(of)f(a)g(v)m (ariable)h(without)f(prin)o(ting)h(its)g(name,)f(use)g(the)g(function)0 2088 y Fr(disp)p Fv(.)j(F)l(or)c(example,)h(the)f(follo)o(wing)h (expression)120 2160 y Fr(disp)23 b(\("The)g(value)h(of)f(pi)h(is:"\),) f(disp)g(\(pi\))0 2244 y Fv(will)17 b(prin)o(t)120 2317 y Fr(The)23 b(value)h(of)f(pi)h(is:)120 2366 y(3.1416)0 2451 y Fv(Note)15 b(that)f(the)i(output)f(from)f Fr(disp)h Fv(alw)o(a)o(ys)f(ends)i(with)f(a)g(newline.)62 2536 y(A)f(simple)i(w)o(a)o(y)d(to)g(con)o(trol)h(the)g(output)f(format)g (is)i(with)f(the)g Fr(format)f Fv(statemen)o(t.)18 b(F)l(or)c(example,) g(to)g(prin)o(t)0 2598 y(more)h(digits)h(for)e(pi)i(y)o(ou)f(can)h(use) f(the)g(command)120 2670 y Fr(format)23 b(long)p eop %%Page: 118 120 118 119 bop 0 -58 a Fv(118)1743 b(Octa)o(v)o(e)0 183 y(Then)16 b(the)f(expression)h(ab)q(o)o(v)o(e)f(will)i(prin)o(t)120 256 y Fr(The)23 b(value)h(of)f(pi)h(is:)120 306 y(3.14159265358979)62 391 y Fv(Here)16 b(is)f(a)g(summary)g(of)g(the)g(options)g(for)g Fr(format)p Fv(:)0 490 y Fr(short)120 b Fv(This)15 b(is)h(the)f (default)g(format.)k(Octa)o(v)o(e)14 b(will)i(try)f(to)f(prin)o(t)h(n)o (um)o(b)q(ers)g(with)g(at)g(least)f(5)h(signi\014can)o(t)240 553 y(\014gures)g(within)i(a)e(\014eld)h(that)f(is)g(a)g(maxim)o(um)g (of)g(10)g(c)o(haracters)f(wide.)240 630 y(If)k(Octa)o(v)o(e)f(is)h (unable)g(to)f(format)f(a)h(matrix)h(so)f(that)f(columns)j(line)g(up)f (on)f(the)h(decimal)g(p)q(oin)o(t)240 692 y(and)d(all)i(the)e(n)o(um)o (b)q(ers)g(\014t)g(within)i(the)e(maxim)o(um)g(\014eld)i(width,)e(it)h (switc)o(hes)f(to)g(an)g(`)p Fr(e)p Fv(')f(format.)0 783 y Fr(long)144 b Fv(Octa)o(v)o(e)15 b(will)h(try)f(to)f(prin)o(t)i (n)o(um)o(b)q(ers)f(with)g(at)g(least)g(15)f(signi\014can)o(t)i (\014gures)f(within)i(a)d(\014eld)j(that)240 845 y(is)f(a)f(maxim)o(um) g(of)f(24)h(c)o(haracters)f(wide.)240 922 y(As)g(will)i(the)e(`)p Fr(short)p Fv(')f(format,)f(Octa)o(v)o(e)i(will)h(switc)o(h)g(to)e(an)h (`)p Fr(e)p Fv(')f(format)g(if)i(it)f(is)h(unable)g(to)e(format)240 984 y(a)j(matrix)g(so)g(that)f(columns)i(line)h(up)f(on)f(the)h (decimal)g(p)q(oin)o(t)g(and)g(all)g(the)f(n)o(um)o(b)q(ers)h(\014t)f (within)240 1047 y(the)f(maxim)o(um)g(\014eld)i(width.)0 1138 y Fr(long)e(e)0 1200 y(short)f(e)82 b Fv(The)18 b(same)g(as)f(`)p Fr(format)d(long)p Fv(')j(or)g(`)p Fr(format)d(short)p Fv(')j(but)h(alw)o(a)o(ys)f(displa)o(y)h(output)g (with)g(an)g(`)p Fr(e)p Fv(')240 1263 y(format.)h(F)l(or)14 b(example,)i(with)f(the)h(`)p Fr(short)e(e)p Fv(')g(format,)g(pi)i(is)g (displa)o(y)o(ed)g(as)384 1327 y Fr(3.14e+00)0 1418 y(long)f(E)0 1481 y(short)f(E)82 b Fv(The)17 b(same)f(as)h(`)p Fr(format)d(long)g(e) p Fv(')j(or)f(`)p Fr(format)e(short)g(e)p Fv(')j(but)f(alw)o(a)o(ys)g (displa)o(y)i(output)f(with)g(an)240 1543 y(upp)q(ercase)f(`)p Fr(E)p Fv(')f(format.)j(F)l(or)d(example,)g(with)h(the)f(`)p Fr(long)f(E)p Fv(')h(format,)e(pi)j(is)g(displa)o(y)o(ed)h(as)384 1607 y Fr(3.14159265358979E+00)0 1699 y(free)0 1761 y(none)144 b Fv(Prin)o(t)22 b(output)f(in)i(free)f(format,)f(without)h(trying)g (to)f(line)i(up)g(columns)f(of)f(matrices)h(on)g(the)240 1823 y(decimal)13 b(p)q(oin)o(t.)19 b(This)12 b(also)g(causes)g (complex)g(n)o(um)o(b)q(ers)g(to)f(b)q(e)i(formatted)d(lik)o(e)j(this)f (`)p Fr(\(0.604194,)240 1885 y(0.607088\))p Fv(')i(instead)h(of)g(lik)o (e)h(this)g(`)p Fr(0.60419)e(+)h(0.60709i)p Fv('.)0 1977 y Fr(bank)144 b Fv(Prin)o(t)15 b(in)h(a)f(\014xed)h(format)e(with)h(t)o (w)o(o)f(places)i(to)f(the)g(righ)o(t)g(of)g(the)g(decimal)i(p)q(oin)o (t.)0 2068 y Fr(+)216 b Fv(Prin)o(t)16 b(a)g(`)p Fr(+)p Fv(')g(sym)o(b)q(ol)h(for)f(nonzero)g(matrix)g(elemen)o(ts)h(and)g(a)f (space)h(for)e(zero)i(matrix)f(elemen)o(ts.)240 2130 y(This)g(format)e(can)h(b)q(e)h(v)o(ery)f(useful)h(for)f(examining)h (the)f(structure)g(of)g(a)g(large)g(matrix.)62 2230 y(The)h Fr(input)f Fv(function)h(ma)o(y)f(b)q(e)h(used)g(for)f(prompting)h(the) f(user)h(for)f(a)g(v)m(alue)i(and)e(storing)g(the)h(result)g(in)g(a)0 2292 y(v)m(ariable.)21 b(F)l(or)15 b(example,)120 2365 y Fr(input)23 b(\("Pick)g(a)h(number,)f(any)g(number!)g("\))0 2450 y Fv(prin)o(ts)15 b(the)h(prompt)120 2523 y Fr(Pick)23 b(a)h(number,)f(any)g(number!)0 2608 y Fv(and)13 b(w)o(aits)f(for)g (the)g(user)h(to)f(en)o(ter)g(a)g(v)m(alue.)20 b(The)13 b(string)g(en)o(tered)g(b)o(y)f(the)h(user)f(is)h(ev)m(aluated)h(as)e (an)g(expression,)0 2670 y(so)j(it)g(ma)o(y)g(b)q(e)h(a)e(literal)j (constan)o(t,)d(a)h(v)m(ariable)h(name,)f(or)g(an)o(y)g(other)g(v)m (alid)h(expression.)p eop %%Page: 119 121 119 120 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(119)62 183 y(Curren)o(tly)l(,)20 b Fr(input)e Fv(only)h(returns)f (one)h(v)m(alue,)h(regardless)f(of)f(the)h(n)o(um)o(b)q(er)g(of)f(v)m (alues)i(pro)q(duced)f(b)o(y)g(the)0 246 y(ev)m(aluation)d(of)f(the)g (expression.)62 332 y(If)g(y)o(ou)f(are)g(only)g(in)o(terested)h(in)g (getting)f(a)g(literal)i(string)e(v)m(alue,)h(y)o(ou)f(can)h(call)g Fr(input)f Fv(with)g(the)h(c)o(haracter)0 394 y(string)d(`)p Fr(s)p Fv(')e(as)i(the)f(second)i(argumen)o(t.)k(This)c(tells)f(Octa)o (v)o(e)g(to)f(return)g(the)h(string)g(en)o(tered)g(b)o(y)f(the)h(user)g (directly)l(,)0 456 y(without)j(ev)m(aluating)i(it)e(\014rst.)62 542 y(Because)i(there)f(ma)o(y)f(b)q(e)h(output)g(w)o(aiting)g(to)f(b)q (e)i(displa)o(y)o(ed)g(b)o(y)f(the)g(pager,)f(it)h(is)h(a)e(go)q(o)q(d) h(idea)g(to)g(alw)o(a)o(ys)0 605 y(call)h Fr(fflush)d(\(stdout\))h Fv(b)q(efore)h(calling)h Fr(input)p Fv(.)k(This)c(will)g(ensure)g(that) e(all)h(p)q(ending)i(output)e(is)g(written)g(to)0 667 y(the)f(screen)h(b)q(efore)g(y)o(our)e(prompt.)20 b(See)15 b(Section)h(20.2)e([C-St)o(yle)i(I/O)f(F)l(unctions],)h(page)f(121.)62 753 y(The)h(second)f(input)h(function,)g Fr(keyboard)p Fv(,)e(is)h(normally)h(used)g(for)e(simple)j(debugging.)k(Using)15 b Fr(keyboard)p Fv(,)0 815 y(it)k(is)h(p)q(ossible)h(to)d(examine)i (the)f(v)m(alues)h(of)f(v)m(ariables)h(within)g(a)f(function,)i(and)e (to)f(assign)i(new)o(assign)f(new)0 878 y(v)m(ariables)f(Lik)o(e)g Fr(input)p Fv(,)e(it)i(prompts)e(the)h(user)g(for)g(input,)h(but)f(no)g (v)m(alue)h(is)f(returned,)h(and)f(it)g(con)o(tin)o(ues)h(to)0 940 y(prompt)d(for)f(input)j(un)o(til)f(the)f(user)g(t)o(yp)q(es)h(`)p Fr(quit)p Fv(',)d(or)i(`)p Fr(exit)p Fv('.)62 1026 y(If)h Fr(keyboard)e Fv(is)h(in)o(v)o(ok)o(ed)h(without)f(an)o(y)g(argumen)o (ts,)f(a)h(default)h(prompt)e(of)h(`)p Fr(debug>)f Fv(')h(is)h(used.)62 1112 y(F)l(or)c(b)q(oth)g(of)g(these)h(functions,)g(the)f(normal)h (command)f(line)i(history)e(and)h(editing)g(functions)g(are)f(a)o(v)m (ailable)0 1175 y(at)j(the)g(prompt.)62 1261 y(T)l(o)g(sa)o(v)o(e)g(v)m (ariables)h(in)g(a)f(\014le,)h(use)f(the)h Fr(save)e Fv(command.)20 b(F)l(or)15 b(example,)g(the)h(command)120 1335 y Fr(save)23 b(data)h(a)f(b)h(c)0 1421 y Fv(sa)o(v)o(es)14 b(the)i(v)m(ariables)g(`)p Fr(a)p Fv(',)e(`)p Fr(b)p Fv(',)g(and)h(`)p Fr(c)p Fv(')g(in)h(the)f(\014le)h(`)p Fr(data)p Fv('.)62 1507 y(The)21 b Fp(sa)o(v)o(e)h Fv(command)e(can)g (read)g(\014les)h(in)g(Octa)o(v)o(e's)f(text)f(and)i(binary)g(formats)d (as)i(w)o(ell)h(as)f Fq(Ma)m(tlab)p Fv('s)0 1569 y(binary)e(format.)27 b(Y)l(ou)18 b(can)g(sp)q(ecify)h(the)f(default)g(format)e(with)i(the)g (built-in)i(v)m(ariable)g Fp(default)p 1705 1569 14 2 v 17 w(sa)o(v)o(e)p 1805 1569 V 15 w(format)0 1631 y Fv(using)e(one)g(of)f(the)g(follo)o(wing)i(v)m(alues:)25 b Fr("binary")16 b Fv(or)h Fr("mat-binary")p Fv(.)25 b(The)18 b(initial)i(default)e(sa)o(v)o(e)e(format)g(is)0 1694 y(Octa)o(v)o(e's)e(text)h(format.)62 1780 y(Y)l(ou)g(can)f(use)g (the)h(built-in)h(v)m(ariable)g Fr(save_precision)c Fv(to)i(sp)q(ecify) h(the)f(n)o(um)o(b)q(er)h(of)e(digits)i(to)f(k)o(eep)g(when)0 1842 y(sa)o(ving)h(data)g(in)h(text)e(format.)62 1928 y(The)22 b(list)g(of)f(v)m(ariables)i(to)e(sa)o(v)o(e)g(ma)o(y)g (include)i(wildcard)g(patterns)e(con)o(taining)h(the)g(follo)o(wing)g (sp)q(ecial)0 1991 y(c)o(haracters:)0 2093 y Fr(?)216 b Fv(Matc)o(h)14 b(an)o(y)h(single)i(c)o(haracter.)0 2186 y Fr(*)216 b Fv(Matc)o(h)14 b(zero)i(or)e(more)h(c)o(haracters.)0 2280 y Fr([)g Fp(list)i Fr(])100 b Fv(Matc)o(h)19 b(the)g(list)h(of)f (c)o(haracters)g(sp)q(eci\014ed)i(b)o(y)e Fp(list)p Fv(.)33 b(If)20 b(the)f(\014rst)g(c)o(haracter)g(is)h Fr(!)f Fv(or)g Fr(^)p Fv(,)h(matc)o(h)240 2342 y(all)d(c)o(haracters)f(except) g(those)g(sp)q(eci\014ed)j(b)o(y)d Fp(list)p Fv(.)23 b(F)l(or)16 b(example,)h(the)f(pattern)g(`)p Fr([a-zA-Z])p Fv(')e(will)240 2404 y(matc)o(h)h(all)h(lo)o(w)o(er)f(and)g(upp)q(er)h (case)f(alphab)q(etic)i(c)o(haracters.)62 2506 y(The)f(follo)o(wing)g (options)f(ma)o(y)f(b)q(e)i(sp)q(eci\014ed)i(for)c Fr(save)p Fv(.)0 2608 y Fr(-ascii)96 b Fv(Sa)o(v)o(e)16 b(the)g(data)g(in)h(Octa) o(v)o(e's)f(text)f(data)h(format.)22 b(Using)17 b(this)g(\015ag)f(o)o (v)o(errides)g(the)g(v)m(alue)i(of)e(the)240 2670 y(built-in)i(v)m (ariable)e Fr(default_save_precision)p eop %%Page: 120 122 120 121 bop 0 -58 a Fv(120)1743 b(Octa)o(v)o(e)0 183 y Fr(-binary)72 b Fv(Sa)o(v)o(e)13 b(the)g(data)g(in)h(Octa)o(v)o(e's)e (binary)i(data)e(format.)18 b(Using)c(this)f(\015ag)g(o)o(v)o(errides)g (the)h(v)m(alue)g(of)f(the)240 246 y(built-in)18 b(v)m(ariable)e Fr(default_save_precision)0 337 y(-float-binary)240 399 y Fv(Sa)o(v)o(e)11 b(the)h(data)g(in)g(Octa)o(v)o(e's)f(binary)i(data)e (format)g(but)h(only)g(using)h(single)g(precision.)20 b(Using)13 b(this)240 462 y(\015ag)h(o)o(v)o(errides)h(the)g(v)m(alue)g (of)g(the)f(built-in)j(v)m(ariable)f Fr(default_save_precision)p Fv(.)h(Y)l(ou)e(should)240 524 y(use)h(this)g(format)f(only)h(if)g(y)o (ou)f(kno)o(w)h(that)f(all)h(the)g(v)m(alues)h(to)e(b)q(e)h(sa)o(v)o (ed)g(can)g(b)q(e)g(represen)o(ted)g(in)240 586 y(single)h(precision.)0 678 y Fr(-mat-binary)240 740 y Fv(Sa)o(v)o(e)f(the)g(data)f(in)i Fq(Ma)m(tlab)p Fv('s)f(binary)g(data)g(format.)k(Using)d(this)f(\015ag) g(o)o(v)o(errides)g(the)g(v)m(alue)h(of)240 802 y(the)e(built-in)j(v)m (ariable)e Fr(default_save_precision)p Fv(.)0 894 y Fr(-save-builtins) 240 956 y Fv(F)l(orce)g(Octa)o(v)o(e)f(to)g(sa)o(v)o(e)h(the)g(v)m (alues)h(of)e(built-in)k(v)m(ariables)e(to)q(o.)k(By)16 b(default,)h(Octa)o(v)o(e)e(do)q(es)h(not)240 1018 y(sa)o(v)o(e)e (built-in)k(v)m(ariables.)62 1118 y(Sa)o(ving)e(global)h(v)m(ariables)g (also)f(sa)o(v)o(es)f(the)h(global)h(status)e(of)g(the)h(v)m(ariable,)h (so)f(that)f(if)h(it)g(is)h(restored)e(at)g(a)0 1180 y(later)g(time)h(using)g(`)p Fr(load)p Fv(',)d(it)j(will)g(b)q(e)g (restored)f(as)g(a)g(global)h(v)m(ariable.)62 1266 y(T)l(o)f(restore)g (the)h(v)m(alues)g(from)f(a)g(\014le,)i(use)e(the)h Fr(load)f Fv(command.)21 b(F)l(or)14 b(example,)i(to)f(restore)g(the)h(v)m (ariables)0 1328 y(sa)o(v)o(ed)f(in)h(the)f(\014le)h(`)p Fr(data)p Fv(',)e(use)h(the)h(command)120 1401 y Fr(load)23 b(data)62 1486 y Fv(Octa)o(v)o(e)15 b(will)i(refuse)e(to)g(o)o(v)o (erwrite)f(existing)j(v)m(ariables)f(unless)g(y)o(ou)f(use)h(the)f (option)h(`)p Fr(-force)p Fv('.)62 1571 y(If)i(a)e(v)m(ariable)j(that)d (is)i(not)f(mark)o(ed)f(as)h(global)h(is)g(loaded)f(from)g(a)g(\014le)h (when)f(a)g(global)h(sym)o(b)q(ol)f(with)h(the)0 1633 y(same)e(name)g(already)g(exists,)g(it)g(is)h(loaded)f(in)h(the)f (global)h(sym)o(b)q(ol)f(table.)23 b(Also,)16 b(if)g(a)g(v)m(ariable)h (is)g(mark)o(ed)e(as)0 1696 y(global)g(in)g(a)f(\014le)i(and)e(a)g(lo)q (cal)i(sym)o(b)q(ol)f(exists,)f(the)h(lo)q(cal)g(sym)o(b)q(ol)g(is)g (mo)o(v)o(ed)f(to)g(the)g(global)h(sym)o(b)q(ol)g(table)g(and)0 1758 y(giv)o(en)i(the)f(v)m(alue)h(from)f(the)g(\014le.)24 b(Since)18 b(it)e(seems)h(that)e(b)q(oth)i(of)e(these)i(cases)f(are)g (lik)o(ely)i(to)e(b)q(e)g(the)h(result)f(of)0 1820 y(some)f(sort)f(of)h (error,)f(they)h(will)i(generate)e(w)o(arnings.)62 1905 y(As)f(with)f Fr(save)p Fv(,)g(y)o(ou)g(ma)o(y)g(sp)q(ecify)h(a)f(list) i(of)d(v)m(ariables)j(and)f Fr(load)e Fv(will)j(only)f(extract)f(those) g(v)m(ariables)i(with)0 1968 y(names)g(that)g(matc)o(h.)62 2053 y(The)i Fr(load)f Fv(command)g(can)h(read)f(data)g(stored)g(in)h (Octa)o(v)o(e's)f(text)g(and)g(binary)i(formats,)d(and)h Fq(Ma)m(tlab)p Fv('s)0 2115 y(binary)e(format.)j(It)d(will)g (automatically)g(detect)f(the)g(t)o(yp)q(e)g(of)g(\014le)h(and)f(do)g (con)o(v)o(ersion)g(from)g(di\013eren)o(t)g(\015oating)0 2177 y(p)q(oin)o(t)j(formats)f(\(curren)o(tly)h(only)g(IEEE)g(big)h (and)f(little)h(endian,)g(though)f(other)f(formats)g(ma)o(y)g(added)h (in)h(the)0 2240 y(future\).)62 2325 y(The)f(follo)o(wing)g(options)f (ma)o(y)f(b)q(e)i(sp)q(eci\014ed)i(for)c Fr(save)p Fv(.)0 2425 y Fr(-force)96 b Fv(F)l(orce)12 b(v)m(ariables)i(curren)o(tly)f (in)g(memory)f(to)g(b)q(e)h(o)o(v)o(erwritten)e(b)o(y)i(v)m(ariables)h (with)e(the)h(same)f(name)240 2487 y(found)k(in)g(the)f(\014le.)0 2578 y Fr(-ascii)96 b Fv(F)l(orce)15 b(Octa)o(v)o(e)g(to)f(assume)h (the)h(\014le)g(is)g(in)g(Octa)o(v)o(e's)e(text)h(format.)0 2670 y Fr(-binary)72 b Fv(F)l(orce)15 b(Octa)o(v)o(e)g(to)f(assume)h (the)h(\014le)g(is)g(in)g(Octa)o(v)o(e's)e(binary)i(format.)p eop %%Page: 121 123 121 122 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(121)0 183 y Fr(-mat-binary)240 246 y Fv(F)l(orce)15 b(Octa)o(v)o(e)g(to)f(assume)h(the)h(\014le)g(is)g(in)g Fq(Ma)m(tlab)p Fv('s)f(binary)g(format.)0 381 y Fu(20.2)32 b(C-St)n(yle)17 b(I/O)d(F)-6 b(unctions)62 485 y Fv(The)14 b(C-st)o(yle)f(input)h(and)g(output)f(functions)h(pro)o(vide)g(most)e (of)h(the)g(functionalit)o(y)h(of)f(the)h(C)f(programming)0 547 y(language's)18 b(standard)g(I/O)g(library)l(.)30 b(The)18 b(argumen)o(t)g(lists)h(for)e(some)h(of)g(the)g(input)h (functions)g(are)f(sligh)o(tly)0 610 y(di\013eren)o(t,)d(ho)o(w)o(ev)o (er,)f(b)q(ecause)i(Octa)o(v)o(e)f(has)g(no)g(w)o(a)o(y)f(of)h(passing) h(argumen)o(ts)e(b)o(y)h(reference.)62 693 y(In)20 b(the)f(follo)o (wing,)h Fp(\014le)i Fv(refers)d(either)g(to)f(an)h(in)o(teger)g (\014le)h(n)o(um)o(b)q(er)f(\(as)f(returned)h(b)o(y)g(`)p Fr(fopen)p Fv('\))e(or)h(a)h(\014le)0 756 y(name.)62 839 y(There)d(are)f(three)g(\014les)h(that)f(are)f(alw)o(a)o(ys)h(a)o (v)m(ailable:)0 936 y Fr(stdin)120 b Fv(The)16 b(standard)f(input)h (stream)f(\(\014le)h(n)o(um)o(b)q(er)g(0\).)j(When)d(Octa)o(v)o(e)f(is) h(used)g(in)o(teractiv)o(ely)l(,)h(this)e(is)240 998 y(\014ltered)h(through)f(the)g(command)g(line)i(editing)g(functions.)0 1086 y Fr(stdout)96 b Fv(The)17 b(standard)f(output)h(stream)f (\(\014le)h(n)o(um)o(b)q(er)g(1\).)24 b(Data)16 b(written)h(to)f(the)h (standard)f(output)g(is)240 1149 y(normally)g(\014ltered)g(through)f (the)g(pager.)0 1237 y Fr(stderr)96 b Fv(The)16 b(standard)g(error)f (stream)g(\(\014le)i(n)o(um)o(b)q(er)f(2\).)22 b(Ev)o(en)16 b(if)g(paging)h(is)f(turned)h(on,)e(the)h(standard)240 1299 y(error)e(is)i(not)f(sen)o(t)g(to)g(the)g(pager.)k(It)d(is)f (useful)i(for)d(error)h(messages)f(and)i(prompts.)62 1396 y(Y)l(ou)j(should)g(alw)o(a)o(ys)f(use)h(the)f(sym)o(b)q(olic)i (names)e(giv)o(en)h(in)g(the)g(table)f(ab)q(o)o(v)o(e,)h(rather)f(than) g(referring)h(to)0 1458 y(these)c(\014les)i(b)o(y)e(n)o(um)o(b)q(er,)g (since)h(it)g(will)h(mak)o(e)d(y)o(our)h(programs)f(clearer.)0 1581 y Fj(20.2.1)29 b(Op)r(ening)15 b(and)h(Closing)f(Files)62 1685 y Fv(T)l(o)i(op)q(en)g(a)g(\014le,)g(use)g(the)g(function)h Fr(fopen)c(\(name,)h(mode\))p Fv(.)23 b(It)17 b(returns)g(an)f(in)o (teger)h(v)m(alue)h(that)e(ma)o(y)g(b)q(e)0 1747 y(used)h(to)e(refer)h (to)f(the)h(\014le)h(later.)22 b(The)17 b(second)f(argumen)o(t)f(is)i (a)e(one)i(or)e(t)o(w)o(o)g(c)o(haracter)g(string)h(that)f(sp)q (eci\014es)0 1809 y(whether)g(the)h(\014le)g(is)g(to)e(b)q(e)i(op)q (ened)g(for)f(reading,)g(writing,)h(or)e(b)q(oth.)62 1893 y(F)l(or)h(example,)120 1964 y Fr(myfile)23 b(=)h(fopen)f (\("splat.dat",)f("r"\);)0 2048 y Fv(op)q(ens)16 b(the)f(\014le)h(`)p Fr(splat.dat)p Fv(')d(for)i(reading.)20 b(Op)q(ening)e(a)c(\014le)j (that)d(is)i(already)f(op)q(en)h(has)f(no)g(e\013ect.)62 2131 y(The)h(p)q(ossible)h(v)m(alues)f(`)p Fr(mode)p Fv(')e(ma)o(y)g(ha)o(v)o(e)h(are)0 2228 y(`)p Fr(r)p Fv(')190 b(Op)q(en)16 b(a)f(text)g(\014le)h(for)f(reading.)0 2317 y(`)p Fr(w)p Fv(')190 b(Op)q(en)16 b(a)f(text)g(\014le)h(for)f (writing.)20 b(The)c(previous)g(con)o(ten)o(ts)e(are)h(discared.)0 2405 y(`)p Fr(a)p Fv(')190 b(Op)q(en)16 b(or)f(create)g(a)g(text)g (\014le)h(for)f(writing)g(at)g(the)g(end)h(of)f(the)g(\014le.)0 2493 y(`)p Fr(r+)p Fv(')166 b(Op)q(en)16 b(an)g(existing)g(text)e (\014le)j(for)d(reading)i(and)f(writing.)0 2582 y(`)p Fr(w+)p Fv(')166 b(Op)q(en)16 b(a)f(text)g(\014le)h(for)f(reading)h(or) e(writing.)21 b(The)15 b(previous)h(con)o(ten)o(ts)f(are)f(discared.)0 2670 y(`)p Fr(a+)p Fv(')166 b(Op)q(en)16 b(or)f(create)g(a)g(text)g (\014le)h(for)f(reading)g(or)g(writing)h(at)e(the)h(end)h(of)f(the)g (\014le.)p eop %%Page: 122 124 122 123 bop 0 -58 a Fv(122)1743 b(Octa)o(v)o(e)62 183 y(T)l(o)12 b(close)i(a)e(\014le)h(once)g(y)o(ou)f(are)g(\014nished)i (with)f(it,)g(use)g(the)f(function)i Fr(fclose)g(\()p Fp(\014le)s Fr(\))p Fv(.)19 b(If)13 b(an)f(error)g(is)h(encoun-)0 246 y(tered)h(while)i(trying)e(to)f(close)i(the)f(\014le,)h(an)f(error) f(message)g(is)i(prin)o(ted)g(and)f Fr(fclose)f Fv(returns)h(0.)19 b(Otherwise,)c(it)0 308 y(returns)g(1.)0 431 y Fj(20.2.2)29 b(F)-5 b(ormatted)15 b(Output)62 536 y Fv(This)h(section)g(describ)q (es)h(ho)o(w)d(to)h(call)h Fr(printf)f Fv(and)g(related)h(functions.)62 620 y(The)22 b(follo)o(wing)g(functions)g(are)f(a)o(v)m(ailable)i(for)d (formatted)h(output.)37 b(They)22 b(are)f(mo)q(delled)i(after)e(the)g (C)0 683 y(language)15 b(functions)h(of)f(the)g(same)g(name.)0 780 y Fr(printf)f(\()p Fp(template)p Fr(,)h(...\))240 843 y Fv(The)h Fr(printf)f Fv(function)i(prin)o(ts)f(the)g(optional)h (argumen)o(ts)e(under)i(the)f(con)o(trol)f(of)h(the)g(template)240 905 y(string)f Fp(template)j Fv(to)d(the)g(stream)f Fr(stdout)p Fv(.)0 994 y Fr(fprintf)g(\()p Fp(\014le)p Fr(,)i Fp(template)p Fr(,)f(...\))240 1057 y Fv(This)i(function)h(is)f(just)g(lik)o(e)h Fr(printf)p Fv(,)d(except)j(that)e(the)g(output)h(is)g(written)g(to)f (the)h(stream)f Fp(\014le)240 1119 y Fv(instead)g(of)f Fr(stdout)p Fv(.)0 1208 y Fr(sprintf)f(\()p Fp(template)p Fr(,)h(...\))240 1271 y Fv(This)g(is)g(lik)o(e)h Fr(printf)p Fv(,)d(except)j(that)d(the)i(output)f(is)i(written)e(to)g(a)g(string.) 20 b(Unlik)o(e)c(the)f(C)f(library)240 1333 y(function,)21 b(whic)o(h)f(requires)h(y)o(ou)e(to)g(pro)o(vide)h(a)f(suitably)h (sized)h(string)e(as)g(an)h(argumen)o(t,)f(Oc-)240 1395 y(ta)o(v)o(e's)13 b Fr(sprintf)h Fv(function)h(returns)f(the)h(string,) f(automatically)h(sized)h(to)d(hold)j(all)f(of)f(the)h(items)240 1457 y(con)o(v)o(erted.)62 1555 y(The)g Fr(printf)e Fv(function)i(can)f (b)q(e)g(used)h(to)e(prin)o(t)i(an)o(y)e(n)o(um)o(b)q(er)i(of)e (argumen)o(ts.)19 b(The)14 b(template)g(string)g(argu-)0 1617 y(men)o(t)e(y)o(ou)h(supply)h(in)g(a)e(call)i(pro)o(vides)f (information)g(not)g(only)g(ab)q(out)g(the)f(n)o(um)o(b)q(er)i(of)e (additional)i(argumen)o(ts,)0 1680 y(but)h(also)g(ab)q(out)h(their)f(t) o(yp)q(es)g(and)h(what)e(st)o(yle)i(should)g(b)q(e)g(used)g(for)e(prin) o(ting)i(them.)62 1764 y(Ordinary)g(c)o(haracters)e(in)i(the)f (template)g(string)f(are)h(simply)h(written)f(to)f(the)h(output)g (stream)f(as-is,)g(while)0 1826 y Fp(con)o(v)o(ersion)f(sp)q (eci\014cations)k Fv(in)o(tro)q(duced)e(b)o(y)e(a)g(`)p Fr(\045)p Fv(')g(c)o(haracter)f(in)i(the)g(template)f(cause)h (subsequen)o(t)g(argumen)o(ts)0 1888 y(to)h(b)q(e)g(formatted)f(and)i (written)f(to)g(the)g(output)g(stream.)k(F)l(or)14 b(example,)120 1960 y Fr(pct)23 b(=)h(37;)120 2010 y(filename)f(=)g("foo.txt";)120 2060 y(printf)g(\("Processing)f(of)i(`\045s')f(is)h(\045d\045\045)f (finished.\\nPlease)f(be)h(patient.\\n",)311 2109 y(filename,)g(pct\);) 0 2193 y Fv(pro)q(duces)16 b(output)f(lik)o(e)120 2265 y Fr(Processing)22 b(of)i(`foo.txt')f(is)g(37\045)h(finished.)120 2315 y(Please)f(be)h(patient.)62 2399 y Fv(This)17 b(example)g(sho)o (ws)e(the)h(use)h(of)e(the)h(`)p Fr(\045d)p Fv(')f(con)o(v)o(ersion)h (to)g(sp)q(ecify)h(that)e(a)h(scalar)g(argumen)o(t)f(should)i(b)q(e)0 2461 y(prin)o(ted)h(in)f(decimal)h(notation,)f(the)g(`)p Fr(\045s)p Fv(')e(con)o(v)o(ersion)i(to)g(sp)q(ecify)h(prin)o(ting)f (of)g(a)f(string)h(argumen)o(t,)f(and)h(the)0 2524 y(`)p Fr(\045\045)p Fv(')d(con)o(v)o(ersion)h(to)g(prin)o(t)h(a)e(literal)j (`)p Fr(\045)p Fv(')d(c)o(haracter.)62 2608 y(There)23 b(are)f(also)h(con)o(v)o(ersions)f(for)g(prin)o(ting)h(an)g(in)o(teger) f(argumen)o(t)g(as)g(an)g(unsigned)i(v)m(alue)g(in)f(o)q(ctal,)0 2670 y(decimal,)16 b(or)f(hexadecimal)i(radix)e(\(`)p Fr(\045o)p Fv(',)f(`)p Fr(\045u)p Fv(',)g(or)g(`)p Fr(\045x)p Fv(',)g(resp)q(ectiv)o(ely\);)i(or)f(as)g(a)g(c)o(haracter)f(v)m(alue)i (\(`)p Fr(\045c)p Fv('\).)p eop %%Page: 123 125 123 124 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(123)62 183 y(Floating-p)q(oin)o(t)14 b(n)o(um)o(b)q(ers)g(can)g(b)q (e)g(prin)o(ted)g(in)g(normal,)g(\014xed-p)q(oin)o(t)h(notation)e (using)h(the)f(`)p Fr(\045f)p Fv(')g(con)o(v)o(ersion)0 246 y(or)k(in)i(exp)q(onen)o(tial)h(notation)d(using)i(the)f(`)p Fr(\045e)p Fv(')f(con)o(v)o(ersion.)28 b(The)18 b(`)p Fr(\045g)p Fv(')f(con)o(v)o(ersion)h(uses)g(either)h(`)p Fr(\045e)p Fv(')e(or)g(`)p Fr(\045f)p Fv(')0 308 y(format,)c(dep)q (ending)18 b(on)d(what)g(is)g(more)g(appropriate)g(for)g(the)g (magnitude)h(of)f(the)g(particular)h(n)o(um)o(b)q(er.)62 400 y(Y)l(ou)i(can)f(con)o(trol)g(formatting)g(more)f(precisely)k(b)o (y)d(writing)h Fp(mo)q(di\014ers)i Fv(b)q(et)o(w)o(een)d(the)h(`)p Fr(\045)p Fv(')e(and)i(the)f(c)o(har-)0 462 y(acter)g(that)h(indicates) h(whic)o(h)g(con)o(v)o(ersion)f(to)f(apply)l(.)29 b(These)18 b(sligh)o(tly)h(alter)f(the)g(ordinary)g(b)q(eha)o(vior)g(of)g(the)0 525 y(con)o(v)o(ersion.)34 b(F)l(or)19 b(example,)i(most)e(con)o(v)o (ersion)h(sp)q(eci\014cations)h(p)q(ermit)g(y)o(ou)e(to)g(sp)q(ecify)i (a)f(minim)o(um)h(\014eld)0 587 y(width)16 b(and)f(a)g(\015ag)g (indicating)i(whether)e(y)o(ou)g(w)o(an)o(t)f(the)i(result)f(left-)h (or)f(righ)o(t-justi\014ed)h(within)g(the)g(\014eld.)62 679 y(The)g(sp)q(eci\014c)i(\015ags)e(and)g(mo)q(di\014ers)g(that)f (are)h(p)q(ermitted)h(and)f(their)g(in)o(terpretation)g(v)m(ary)g(dep)q (ending)i(on)0 742 y(the)d(particular)h(con)o(v)o(ersion.)k(They're)15 b(all)h(describ)q(ed)h(in)g(more)d(detail)j(in)f(the)f(follo)o(wing)h (sections.)0 890 y Fj(20.2.3)29 b(Output)16 b(Con)n(v)n(ersion)g(Syn)n (tax)62 1004 y Fv(This)11 b(section)g(pro)o(vides)g(details)h(ab)q(out) e(the)g(precise)i(syn)o(tax)e(of)g(con)o(v)o(ersion)g(sp)q (eci\014cations)i(that)e(can)h(app)q(ear)0 1066 y(in)16 b(a)f Fr(printf)f Fv(template)i(string.)62 1158 y(Characters)c(in)i (the)f(template)g(string)f(that)g(are)h(not)f(part)g(of)h(a)f(con)o(v)o (ersion)h(sp)q(eci\014cation)i(are)d(prin)o(ted)i(as-is)0 1221 y(to)h(the)g(output)g(stream.)62 1313 y(The)h(con)o(v)o(ersion)f (sp)q(eci\014cations)i(in)f(a)f Fr(printf)f Fv(template)i(string)f(ha)o (v)o(e)g(the)g(general)h(form:)120 1393 y Fr(\045)24 b Fp(\015ags)h(width)g Fv([)e Fr(.)h Fp(precision)h Fv(])f Fp(t)o(yp)q(e)i(con)o(v)o(ersion)62 1485 y Fv(F)l(or)12 b(example,)h(in)g(the)f(con)o(v)o(ersion)g(sp)q(eci\014er)i(`)p Fr(\045-10.8ld)p Fv(',)c(the)i(`)p Fr(-)p Fv(')f(is)i(a)f(\015ag,)f(`)p Fr(10)p Fv(')g(sp)q(eci\014es)j(the)e(\014eld)i(width,)0 1548 y(the)k(precision)i(is)f(`)p Fr(8)p Fv(',)f(the)g(letter)h(`)p Fr(l)p Fv(')e(is)i(a)f(t)o(yp)q(e)g(mo)q(di\014er,)i(and)e(`)p Fr(d)p Fv(')g(sp)q(eci\014es)i(the)e(con)o(v)o(ersion)g(st)o(yle.)30 b(\(This)0 1610 y(particular)15 b(t)o(yp)q(e)f(sp)q(eci\014er)i(sa)o (ys)e(to)g(prin)o(t)h(a)f(n)o(umeric)h(argumen)o(t)e(in)j(decimal)f (notation,)f(with)h(a)f(minim)o(um)h(of)0 1672 y(8)g(digits)h (left-justi\014ed)h(in)f(a)f(\014eld)h(at)f(least)g(10)g(c)o(haracters) f(wide.\))62 1765 y(In)21 b(more)e(detail,)i(output)f(con)o(v)o(ersion) f(sp)q(eci\014cations)j(consist)e(of)f(an)h(initial)h(`)p Fr(\045)p Fv(')e(c)o(haracter)g(follo)o(w)o(ed)h(in)0 1827 y(sequence)c(b)o(y:)37 1919 y Ft(\017)30 b Fv(Zero)14 b(or)f(more)h Fp(\015ag)g(c)o(haracters)h Fv(that)e(mo)q(dify)i(the)f (normal)g(b)q(eha)o(vior)h(of)e(the)h(con)o(v)o(ersion)h(sp)q (eci\014cation.)37 2004 y Ft(\017)30 b Fv(An)20 b(optional)h(decimal)h (in)o(teger)e(sp)q(ecifying)i(the)f Fp(minim)o(um)g(\014eld)g(width)p Fv(.)36 b(If)20 b(the)h(normal)f(con)o(v)o(ersion)90 2066 y(pro)q(duces)g(few)o(er)f(c)o(haracters)g(than)g(this,)h(the)g (\014eld)g(is)g(padded)g(with)g(spaces)f(to)g(the)g(sp)q(eci\014ed)j (width.)90 2128 y(This)d(is)h(a)e Fp(minim)o(um)i Fv(v)m(alue;)h(if)e (the)g(normal)g(con)o(v)o(ersion)g(pro)q(duces)g(more)g(c)o(haracters)f (than)g(this,)i(the)90 2190 y(\014eld)c(is)g Fp(not)g Fv(truncated.)k(Normally)l(,)15 b(the)h(output)f(is)g(righ)o (t-justi\014ed)i(within)f(the)f(\014eld.)90 2275 y(Y)l(ou)g(can)g(also) h(sp)q(ecify)g(a)f(\014eld)h(width)g(of)e(`)p Fr(*)p Fv('.)19 b(This)d(means)f(that)f(the)h(next)g(argumen)o(t)g(in)h(the)f (argumen)o(t)90 2337 y(list)h(\(b)q(efore)f(the)h(actual)f(v)m(alue)i (to)d(b)q(e)i(prin)o(ted\))g(is)g(used)g(as)f(the)g(\014eld)i(width.)k (The)15 b(v)m(alue)i(is)f(rounded)g(to)90 2399 y(the)h(nearest)f(in)o (teger.)24 b(If)17 b(the)g(v)m(alue)h(is)f(negativ)o(e,)g(this)g(means) f(to)g(set)h(the)f(`)p Fr(-)p Fv(')g(\015ag)g(\(see)h(b)q(elo)o(w\))g (and)g(to)90 2461 y(use)f(the)f(absolute)g(v)m(alue)i(as)e(the)g (\014eld)h(width.)37 2545 y Ft(\017)30 b Fv(An)13 b(optional)g Fp(precision)h Fv(to)e(sp)q(ecify)h(the)g(n)o(um)o(b)q(er)g(of)f (digits)h(to)f(b)q(e)h(written)g(for)e(the)i(n)o(umeric)g(con)o(v)o (ersions.)90 2608 y(If)h(the)f(precision)i(is)e(sp)q(eci\014ed,)j(it)d (consists)h(of)f(a)g(p)q(erio)q(d)h(\(`)p Fr(.)p Fv('\))e(follo)o(w)o (ed)h(optionally)i(b)o(y)e(a)g(decimal)i(in)o(teger)90 2670 y(\(whic)o(h)h(defaults)f(to)g(zero)g(if)h(omitted\).)p eop %%Page: 124 126 124 125 bop 0 -58 a Fv(124)1743 b(Octa)o(v)o(e)90 183 y(Y)l(ou)13 b(can)g(also)f(sp)q(ecify)i(a)f(precision)h(of)e(`)p Fr(*)p Fv('.)18 b(This)c(means)e(that)g(the)h(next)g(argumen)o(t)f(in)h (the)g(argumen)o(t)f(list)90 246 y(\(b)q(efore)j(the)g(actual)g(v)m (alue)h(to)e(b)q(e)h(prin)o(ted\))g(is)h(used)f(as)g(the)f(precision.) 22 b(The)15 b(v)m(alue)h(m)o(ust)e(b)q(e)h(an)g(in)o(teger,)90 308 y(and)g(is)h(ignored)g(if)g(it)f(is)h(negativ)o(e.)37 382 y Ft(\017)30 b Fv(An)17 b(optional)g Fp(t)o(yp)q(e)g(mo)q(di\014er) h(c)o(haracter)p Fv(.)24 b(This)17 b(c)o(haracter)f(is)i(ignored)f(b)o (y)g(Octa)o(v)o(e's)f Fr(printf)f Fv(function,)90 444 y(but)g(is)h(recognized)g(to)f(pro)o(vide)h(compatibilit)o(y)g(with)g (the)f(C)g(language)h Fr(printf)p Fv(.)37 518 y Ft(\017)30 b Fv(A)15 b(c)o(haracter)g(that)f(sp)q(eci\014es)j(the)f(con)o(v)o (ersion)f(to)f(b)q(e)i(applied.)62 613 y(The)h(exact)f(options)g(that)g (are)g(p)q(ermitted)h(and)f(ho)o(w)g(they)h(are)f(in)o(terpreted)h(v)m (ary)f(b)q(et)o(w)o(een)g(the)h(di\013eren)o(t)0 675 y(con)o(v)o(ersion)f(sp)q(eci\014ers.)25 b(See)17 b(the)g(descriptions) g(of)f(the)h(individual)i(con)o(v)o(ersions)e(for)e(information)i(ab)q (out)f(the)0 738 y(particular)g(options)f(that)g(they)g(use.)0 857 y Fj(20.2.4)29 b(T)-5 b(able)15 b(of)g(Output)g(Con)n(v)n(ersions) 62 960 y Fv(Here)h(is)f(a)g(table)h(summarizing)g(what)f(all)h(the)f (di\013eren)o(t)g(con)o(v)o(ersions)h(do:)0 1055 y(`)p Fr(\045d)p Fv(',)e(`)p Fr(\045i)p Fv(')65 b(Prin)o(t)15 b(an)g(in)o(teger)g(as)f(a)g(signed)i(decimal)g(n)o(um)o(b)q(er.)21 b(See)15 b(Section)h(20.2.5)d([In)o(teger)h(Con)o(v)o(ersions],)240 1117 y(page)h(125,)g(for)g(details.)22 b(`)p Fr(\045d)p Fv(')14 b(and)i(`)p Fr(\045i)p Fv(')e(are)i(synon)o(ymous)f(for)g (output,)g(but)g(are)h(di\013eren)o(t)f(when)240 1180 y(used)f(with)g Fr(scanf)e Fv(for)h(input)i(\(see)e(Section)h(20.2.10)e ([T)l(able)h(of)g(Input)i(Con)o(v)o(ersions],)d(page)i(128\).)0 1266 y(`)p Fr(\045o)p Fv(')166 b(Prin)o(t)13 b(an)g(in)o(teger)g(as)f (an)h(unsigned)i(o)q(ctal)e(n)o(um)o(b)q(er.)19 b(See)14 b(Section)f(20.2.5)e([In)o(teger)i(Con)o(v)o(ersions],)240 1328 y(page)i(125,)f(for)h(details.)0 1414 y(`)p Fr(\045u)p Fv(')166 b(Prin)o(t)17 b(an)g(in)o(teger)g(as)g(an)g(unsigned)i (decimal)f(n)o(um)o(b)q(er.)26 b(See)18 b(Section)g(20.2.5)d([In)o (teger)i(Con)o(v)o(er-)240 1476 y(sions],)e(page)g(125,)f(for)g (details.)0 1562 y(`)p Fr(\045x)p Fv(',)g(`)p Fr(\045X)p Fv(')65 b(Prin)o(t)16 b(an)h(in)o(teger)f(as)g(an)g(unsigned)i (hexadecimal)g(n)o(um)o(b)q(er.)23 b(`)p Fr(\045x)p Fv(')16 b(uses)g(lo)o(w)o(er-case)g(letters)h(and)240 1624 y(`)p Fr(\045X)p Fv(')d(uses)i(upp)q(er-case.)21 b(See)15 b(Section)i(20.2.5) c([In)o(teger)i(Con)o(v)o(ersions],)f(page)h(125,)f(for)g(details.)0 1710 y(`)p Fr(\045f)p Fv(')166 b(Prin)o(t)22 b(a)f(\015oating-p)q(oin)o (t)i(n)o(um)o(b)q(er)f(in)g(normal)g(\(\014xed-p)q(oin)o(t\))h (notation.)39 b(See)22 b(Section)h(20.2.6)240 1772 y([Floating-P)o(oin) o(t)15 b(Con)o(v)o(ersions],)f(page)h(125,)f(for)g(details.)0 1858 y(`)p Fr(\045e)p Fv(',)g(`)p Fr(\045E)p Fv(')65 b(Prin)o(t)15 b(a)g(\015oating-p)q(oin)o(t)g(n)o(um)o(b)q(er)g(in)h (exp)q(onen)o(tial)h(notation.)i(`)p Fr(\045e)p Fv(')14 b(uses)h(lo)o(w)o(er-case)g(letters)g(and)240 1920 y(`)p Fr(\045E)p Fv(')k(uses)h(upp)q(er-case.)36 b(See)21 b(Section)g(20.2.6) d([Floating-P)o(oin)o(t)h(Con)o(v)o(ersions],)i(page)f(125,)g(for)240 1983 y(details.)0 2069 y(`)p Fr(\045g)p Fv(',)14 b(`)p Fr(\045G)p Fv(')65 b(Prin)o(t)18 b(a)g(\015oating-p)q(oin)o(t)h(n)o(um) o(b)q(er)g(in)g(either)g(normal)f(or)f(exp)q(onen)o(tial)j(notation,)e (whic)o(hev)o(er)h(is)240 2131 y(more)e(appropriate)h(for)f(its)h (magnitude.)27 b(`)p Fr(\045g)p Fv(')17 b(uses)h(lo)o(w)o(er-case)f (letters)h(and)f(`)p Fr(\045G)p Fv(')g(uses)h(upp)q(er-)240 2193 y(case.)i(See)c(Section)g(20.2.6)d([Floating-P)o(oin)o(t)i(Con)o (v)o(ersions],)f(page)h(125,)f(for)g(details.)0 2279 y(`)p Fr(\045c)p Fv(')166 b(Prin)o(t)15 b(a)g(single)i(c)o(haracter.)i (See)d(Section)g(20.2.7)d([Other)i(Output)h(Con)o(v)o(ersions],)e(page) h(126.)0 2365 y(`)p Fr(\045s)p Fv(')166 b(Prin)o(t)15 b(a)g(string.)20 b(See)c(Section)g(20.2.7)d([Other)i(Output)h(Con)o(v)o (ersions],)e(page)h(126.)0 2451 y(`)p Fr(\045\045)p Fv(')166 b(Prin)o(t)15 b(a)g(literal)i(`)p Fr(\045)p Fv(')d(c)o(haracter.)19 b(See)d(Section)g(20.2.7)d([Other)i(Output)h(Con)o(v)o(ersions],)e (page)h(126.)62 2545 y(If)h(the)f(syn)o(tax)g(of)g(a)g(con)o(v)o (ersion)h(sp)q(eci\014cation)h(is)f(in)o(v)m(alid,)h(unpredictable)h (things)e(will)h(happ)q(en,)f(so)f(don't)0 2608 y(do)f(this.)21 b(If)14 b(there)h(aren't)f(enough)h(function)g(argumen)o(ts)f(pro)o (vided)h(to)f(supply)i(v)m(alues)g(for)e(all)h(the)g(con)o(v)o(ersion)0 2670 y(sp)q(eci\014cations)g(in)e(the)g(template)g(string,)g(or)f(if)h (the)g(argumen)o(ts)f(are)g(not)g(of)h(the)f(correct)h(t)o(yp)q(es,)f (the)h(results)g(are)p eop %%Page: 125 127 125 126 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(125)0 183 y(unpredictable.)30 b(If)18 b(y)o(ou)f(supply)i(more)f (argumen)o(ts)e(than)i(con)o(v)o(ersion)g(sp)q(eci\014cations,)i(the)e (extra)f(argumen)o(t)0 246 y(v)m(alues)f(are)f(simply)i(ignored;)e (this)h(is)f(sometimes)h(useful.)0 372 y Fj(20.2.5)29 b(In)n(teger)15 b(Con)n(v)n(ersions)62 477 y Fv(This)i(section)f (describ)q(es)i(the)e(options)g(for)g(the)g(`)p Fr(\045d)p Fv(',)f(`)p Fr(\045i)p Fv(',)f(`)p Fr(\045o)p Fv(',)h(`)p Fr(\045u)p Fv(',)g(`)p Fr(\045x)p Fv(',)g(and)h(`)p Fr(\045X)p Fv(')f(con)o(v)o(ersion)h(sp)q(eci\014-)0 540 y(cations.)k(These)c(con) o(v)o(ersions)f(prin)o(t)g(in)o(tegers)h(in)g(v)m(arious)f(formats.)62 625 y(The)g(`)p Fr(\045d)p Fv(')e(and)i(`)p Fr(\045i)p Fv(')e(con)o(v)o(ersion)h(sp)q(eci\014cations)i(b)q(oth)f(prin)o(t)f (an)h(n)o(umeric)g(argumen)o(t)e(as)h(a)g(signed)h(decimal)0 687 y(n)o(um)o(b)q(er;)f(while)g(`)p Fr(\045o)p Fv(',)e(`)p Fr(\045u)p Fv(',)g(and)h(`)p Fr(\045x)p Fv(')f(prin)o(t)h(the)g (argumen)o(t)f(as)h(an)g(unsigned)h(o)q(ctal,)f(decimal,)i(or)d (hexadecimal)0 749 y(n)o(um)o(b)q(er)20 b(\(resp)q(ectiv)o(ely\).)33 b(The)20 b(`)p Fr(\045X)p Fv(')f(con)o(v)o(ersion)g(sp)q(eci\014cation) j(is)e(just)f(lik)o(e)h(`)p Fr(\045x)p Fv(')f(except)h(that)e(it)i (uses)g(the)0 811 y(c)o(haracters)14 b(`)p Fr(ABCDEF)p Fv(')g(as)h(digits)h(instead)g(of)e(`)p Fr(abcdef)p Fv('.)62 896 y(The)i(follo)o(wing)g(\015ags)e(are)h(meaningful:)0 996 y(`)p Fr(-)p Fv(')190 b(Left-justify)16 b(the)f(result)h(in)g(the)f (\014eld)h(\(instead)g(of)f(the)g(normal)g(righ)o(t-justi\014cation\).) 0 1087 y(`)p Fr(+)p Fv(')190 b(F)l(or)15 b(the)g(signed)h(`)p Fr(\045d)p Fv(')e(and)i(`)p Fr(\045i)p Fv(')e(con)o(v)o(ersions,)h (prin)o(t)g(a)g(plus)h(sign)g(if)f(the)h(v)m(alue)g(is)g(p)q(ositiv)o (e.)0 1178 y(`)f(')199 b(F)l(or)13 b(the)g(signed)h(`)p Fr(\045d)p Fv(')e(and)i(`)p Fr(\045i)p Fv(')e(con)o(v)o(ersions,)i(if)f (the)h(result)f(do)q(esn't)h(start)e(with)h(a)g(plus)i(or)d(min)o(us) 240 1240 y(sign,)j(pre\014x)h(it)f(with)h(a)f(space)g(c)o(haracter)g (instead.)20 b(Since)d(the)e(`)p Fr(+)p Fv(')f(\015ag)h(ensures)h(that) e(the)i(result)240 1302 y(includes)h(a)e(sign,)h(this)f(\015ag)g(is)h (ignored)g(if)f(y)o(ou)g(supply)i(b)q(oth)e(of)g(them.)0 1393 y(`)p Fr(#)p Fv(')190 b(F)l(or)17 b(the)h(`)p Fr(\045o)p Fv(')e(con)o(v)o(ersion,)i(this)g(forces)g(the)f(leading)i(digit)g(to)e (b)q(e)h(`)p Fr(0)p Fv(',)f(as)g(if)h(b)o(y)g(increasing)h(the)240 1455 y(precision.)h(F)l(or)12 b(`)p Fr(\045x)p Fv(')f(or)g(`)p Fr(\045X)p Fv(',)g(this)i(pre\014xes)f(a)g(leading)h(`)p Fr(0x)p Fv(')e(or)h(`)p Fr(0X)p Fv(')f(\(resp)q(ectiv)o(ely\))h(to)g (the)g(result.)240 1518 y(This)k(do)q(esn't)f(do)g(an)o(ything)g (useful)i(for)d(the)i(`)p Fr(\045d)p Fv(',)d(`)p Fr(\045i)p Fv(',)h(or)h(`)p Fr(\045u)p Fv(')f(con)o(v)o(ersions.)0 1609 y(`)p Fr(0)p Fv(')190 b(P)o(ad)17 b(the)h(\014eld)h(with)g(zeros)e (instead)i(of)e(spaces.)28 b(The)18 b(zeros)g(are)f(placed)i(after)f (an)o(y)f(indication)240 1671 y(of)f(sign)i(or)e(base.)25 b(This)17 b(\015ag)g(is)g(ignored)g(if)h(the)f(`)p Fr(-)p Fv(')e(\015ag)i(is)g(also)g(sp)q(eci\014ed,)i(or)d(if)i(a)e(precision)i (is)240 1733 y(sp)q(eci\014ed.)62 1832 y(If)d(a)e(precision)j(is)f (supplied,)h(it)e(sp)q(eci\014es)i(the)e(minim)o(um)h(n)o(um)o(b)q(er)g (of)e(digits)i(to)f(app)q(ear;)g(leading)h(zeros)f(are)0 1895 y(pro)q(duced)j(if)g(necessary)l(.)22 b(If)17 b(y)o(ou)e(don't)h (sp)q(ecify)h(a)f(precision,)h(the)f(n)o(um)o(b)q(er)g(is)h(prin)o(ted) g(with)f(as)g(man)o(y)f(digits)0 1957 y(as)g(it)h(needs.)23 b(If)16 b(y)o(ou)f(con)o(v)o(ert)g(a)g(v)m(alue)i(of)f(zero)f(with)h (an)g(explicit)i(precision)f(of)f(zero,)f(then)h(no)g(c)o(haracters)f (at)0 2019 y(all)h(are)f(pro)q(duced.)0 2145 y Fj(20.2.6)29 b(Floating-P)n(oin)n(t)15 b(Con)n(v)n(ersions)62 2251 y Fv(This)20 b(section)f(discusses)i(the)e(con)o(v)o(ersion)g(sp)q (eci\014cations)i(for)d(\015oating-p)q(oin)o(t)i(n)o(um)o(b)q(ers:)28 b(the)19 b(`)p Fr(\045f)p Fv(',)f(`)p Fr(\045e)p Fv(',)0 2313 y(`)p Fr(\045E)p Fv(',)c(`)p Fr(\045g)p Fv(',)g(and)h(`)p Fr(\045G)p Fv(')f(con)o(v)o(ersions.)62 2398 y(The)k(`)p Fr(\045f)p Fv(')e(con)o(v)o(ersion)h(prin)o(ts)h(its)f(argumen)o(t)g (in)h(\014xed-p)q(oin)o(t)g(notation,)f(pro)q(ducing)i(output)e(of)f (the)i(form)0 2461 y([)p Fr(-)p Fv(])p Fp(ddd)r Fr(.)p Fp(ddd)r Fv(,)e(where)h(the)f(n)o(um)o(b)q(er)h(of)e(digits)i(follo)o (wing)g(the)g(decimal)g(p)q(oin)o(t)g(is)g(con)o(trolled)g(b)o(y)f(the) g(precision)0 2523 y(y)o(ou)f(sp)q(ecify)l(.)62 2608 y(The)i(`)p Fr(\045e)p Fv(')e(con)o(v)o(ersion)h(prin)o(ts)g(its)g (argumen)o(t)g(in)h(exp)q(onen)o(tial)g(notation,)f(pro)q(ducing)h (output)f(of)g(the)g(form)0 2670 y([)p Fr(-)p Fv(])p Fp(d)r Fr(.)p Fp(ddd)r Fr(e)p Fv([)p Fr(+|-)p Fv(])p Fp(dd)q Fv(.)32 b(Again,)20 b(the)g(n)o(um)o(b)q(er)f(of)g(digits)h (follo)o(wing)g(the)g(decimal)h(p)q(oin)o(t)f(is)f(con)o(trolled)i(b)o (y)e(the)p eop %%Page: 126 128 126 127 bop 0 -58 a Fv(126)1743 b(Octa)o(v)o(e)0 183 y(precision.)21 b(The)15 b(exp)q(onen)o(t)h(alw)o(a)o(ys)e(con)o(tains) h(at)f(least)h(t)o(w)o(o)f(digits.)20 b(The)c(`)p Fr(\045E)p Fv(')d(con)o(v)o(ersion)i(is)h(similar)g(but)f(the)0 246 y(exp)q(onen)o(t)h(is)f(mark)o(ed)g(with)h(the)f(letter)g(`)p Fr(E)p Fv(')g(instead)g(of)g(`)p Fr(e)p Fv('.)62 331 y(The)g(`)p Fr(\045g)p Fv(')e(and)i(`)p Fr(\045G)p Fv(')e(con)o(v)o (ersions)i(prin)o(t)f(the)h(argumen)o(t)f(in)h(the)f(st)o(yle)h(of)f(`) p Fr(\045e)p Fv(')f(or)h(`)p Fr(\045E)p Fv(')g(\(resp)q(ectiv)o(ely\))h (if)g(the)0 393 y(exp)q(onen)o(t)j(w)o(ould)g(b)q(e)g(less)h(than)e(-4) h(or)f(greater)g(than)g(or)g(equal)i(to)e(the)g(precision;)j(otherwise) e(they)g(use)g(the)0 456 y(`)p Fr(\045f)p Fv(')c(st)o(yle.)20 b(T)l(railing)c(zeros)e(are)h(remo)o(v)o(ed)f(from)g(the)h(fractional)g (p)q(ortion)g(of)f(the)h(result)g(and)g(a)g(decimal-p)q(oin)o(t)0 518 y(c)o(haracter)f(app)q(ears)i(only)g(if)f(it)h(is)f(follo)o(w)o(ed) h(b)o(y)f(a)g(digit.)62 603 y(The)h(follo)o(wing)g(\015ags)e(can)i(b)q (e)g(used)f(to)g(mo)q(dify)h(the)f(b)q(eha)o(vior:)0 704 y(`)p Fr(-)p Fv(')190 b(Left-justify)16 b(the)f(result)h(in)g(the)f (\014eld.)21 b(Normally)16 b(the)f(result)h(is)f(righ)o(t-justi\014ed.) 0 796 y(`)p Fr(+)p Fv(')190 b(Alw)o(a)o(ys)15 b(include)i(a)e(plus)h (or)f(min)o(us)h(sign)g(in)g(the)f(result.)0 888 y(`)g(')199 b(If)12 b(the)g(result)g(do)q(esn't)g(start)f(with)h(a)f(plus)i(or)f (min)o(us)g(sign,)h(pre\014x)f(it)g(with)g(a)g(space)g(instead.)19 b(Since)240 950 y(the)g(`)p Fr(+)p Fv(')f(\015ag)g(ensures)i(that)e (the)h(result)g(includes)j(a)c(sign,)i(this)f(\015ag)g(is)g(ignored)h (if)f(y)o(ou)g(supply)240 1012 y(b)q(oth)c(of)g(them.)0 1105 y(`)p Fr(#)p Fv(')190 b(Sp)q(eci\014es)17 b(that)d(the)h(result)g (should)g(alw)o(a)o(ys)f(include)j(a)e(decimal)h(p)q(oin)o(t,)f(ev)o (en)g(if)g(no)f(digits)i(follo)o(w)240 1167 y(it.)30 b(F)l(or)18 b(the)g(`)p Fr(\045g)p Fv(')f(and)i(`)p Fr(\045G)p Fv(')e(con)o(v)o(ersions,)i(this)g(also)g(forces)f(trailing)h(zeros)f (after)g(the)g(decimal)240 1229 y(p)q(oin)o(t)e(to)e(b)q(e)i(left)g(in) g(place)g(where)f(they)h(w)o(ould)f(otherwise)h(b)q(e)f(remo)o(v)o(ed.) 0 1321 y(`)p Fr(0)p Fv(')190 b(P)o(ad)13 b(the)h(\014eld)g(with)g (zeros)f(instead)h(of)f(spaces;)h(the)g(zeros)f(are)g(placed)i(after)d (an)o(y)h(sign.)20 b(This)14 b(\015ag)240 1383 y(is)i(ignored)f(if)h (the)f(`)p Fr(-)p Fv(')g(\015ag)g(is)g(also)g(sp)q(eci\014ed.)62 1484 y(The)e(precision)i(sp)q(eci\014es)g(ho)o(w)d(man)o(y)h(digits)h (follo)o(w)f(the)g(decimal-p)q(oin)o(t)i(c)o(haracter)d(for)h(the)g(`)p Fr(\045f)p Fv(',)f(`)p Fr(\045e)p Fv(',)g(and)0 1546 y(`)p Fr(\045E)p Fv(')k(con)o(v)o(ersions.)26 b(F)l(or)17 b(these)g(con)o(v)o(ersions,)h(the)f(default)h(precision)h(is)e Fr(6)p Fv(.)26 b(If)18 b(the)f(precision)i(is)f(explicitly)i Fr(0)p Fv(,)0 1608 y(this)13 b(suppresses)h(the)f(decimal)i(p)q(oin)o (t)e(c)o(haracter)f(en)o(tirely)l(.)21 b(F)l(or)12 b(the)h(`)p Fr(\045g)p Fv(')f(and)h(`)p Fr(\045G)p Fv(')f(con)o(v)o(ersions,)h(the) g(precision)0 1671 y(sp)q(eci\014es)h(ho)o(w)e(man)o(y)g(signi\014can)o (t)i(digits)f(to)f(prin)o(t.)19 b(Signi\014can)o(t)14 b(digits)g(are)e(the)g(\014rst)h(digit)g(b)q(efore)g(the)f(decimal)0 1733 y(p)q(oin)o(t,)17 b(and)g(all)g(the)f(digits)i(after)d(it.)24 b(If)17 b(the)g(precision)h(is)e Fr(0)h Fv(or)f(not)g(sp)q(eci\014ed)i (for)e(`)p Fr(\045g)p Fv(')g(or)f(`)p Fr(\045G)p Fv(',)h(it)h(is)f (treated)0 1795 y(lik)o(e)h(a)f(v)m(alue)h(of)f Fr(1)p Fv(.)22 b(If)16 b(the)g(v)m(alue)h(b)q(eing)h(prin)o(ted)e(cannot)g(b)q (e)h(expressed)g(precisely)h(in)e(the)g(sp)q(eci\014ed)j(n)o(um)o(b)q (er)0 1857 y(of)c(digits,)g(the)h(v)m(alue)g(is)g(rounded)g(to)e(the)i (nearest)e(n)o(um)o(b)q(er)i(that)e(\014ts.)0 1985 y Fj(20.2.7)29 b(Other)16 b(Output)f(Con)n(v)n(ersions)62 2091 y Fv(This)h(section)g(describ)q(es)h(miscellaneous)g(con)o(v)o (ersions)e(for)g Fr(printf)p Fv(.)62 2177 y(The)e(`)p Fr(\045c)p Fv(')f(con)o(v)o(ersion)g(prin)o(ts)h(a)f(single)i(c)o (haracter.)k(The)13 b(`)p Fr(-)p Fv(')f(\015ag)g(can)h(b)q(e)g(used)g (to)f(sp)q(ecify)i(left-justi\014cation)0 2239 y(in)19 b(the)g(\014eld,)h(but)f(no)f(other)g(\015ags)h(are)f(de\014ned,)i(and) f(no)f(precision)i(or)e(t)o(yp)q(e)h(mo)q(di\014er)g(can)g(b)q(e)g(giv) o(en.)31 b(F)l(or)0 2301 y(example:)120 2374 y Fr(printf)23 b(\("\045c\045c\045c\045c\045c",)f("h",)h("e",)h("l",)f("l",)g("o"\);)0 2460 y Fv(prin)o(ts)15 b(`)p Fr(hello)p Fv('.)62 2545 y(The)h(`)p Fr(\045s)p Fv(')d(con)o(v)o(ersion)j(prin)o(ts)f(a)g (string.)k(The)d(corresp)q(onding)g(argumen)o(t)e(m)o(ust)g(b)q(e)i(a)f (string.)k(A)c(precision)0 2608 y(can)i(b)q(e)h(sp)q(eci\014ed)i(to)c (indicate)j(the)e(maxim)o(um)g(n)o(um)o(b)q(er)h(of)e(c)o(haracters)h (to)f(write;)i(otherwise)g(c)o(haracters)e(in)0 2670 y(the)e(string)g(up)h(to)e(but)h(not)g(including)j(the)d(terminating)g (n)o(ull)i(c)o(haracter)d(are)h(written)g(to)f(the)h(output)g(stream.)p eop %%Page: 127 129 127 128 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(127)0 183 y(The)14 b(`)p Fr(-)p Fv(')f(\015ag)g(can)h(b)q(e)g(used)g (to)f(sp)q(ecify)i(left-justi\014cation)g(in)g(the)e(\014eld,)i(but)f (no)g(other)f(\015ags)g(or)g(t)o(yp)q(e)h(mo)q(di\014ers)0 246 y(are)h(de\014ned)h(for)f(this)h(con)o(v)o(ersion.)k(F)l(or)14 b(example:)120 317 y Fr(printf)23 b(\("\0453s\045-6s",)f("no",)i ("where"\);)0 401 y Fv(prin)o(ts)15 b(`)g Fr(nowhere)f Fv('.)0 525 y Fj(20.2.8)29 b(F)-5 b(ormatted)15 b(Input)62 630 y Fv(Here)h(are)f(the)g(descriptions)i(of)d(the)i(functions)g(for)e (p)q(erforming)i(formatted)e(input.)0 728 y Fr(scanf)g(\()p Fp(template)s Fr(\))240 791 y Fv(The)g Fr(scanf)g Fv(function)h(reads)f (formatted)f(input)i(from)e(the)i(stream)e Fr(stdin)g Fv(under)i(the)g(con)o(trol)e(of)240 853 y(the)i(template)h(string)f Fp(template)p Fv(.)20 b(The)15 b(resulting)i(v)m(alues)f(are)f (returned.)0 942 y Fr(fscanf)f(\()p Fp(\014le)p Fr(,)i Fp(template)s Fr(\))240 1005 y Fv(This)21 b(function)h(is)f(just)f(lik) o(e)h Fr(scanf)p Fv(,)g(except)g(that)f(the)h(input)g(is)g(read)g(from) f(the)g(stream)g Fp(\014le)240 1067 y Fv(instead)c(of)f Fr(stdin)p Fv(.)0 1157 y Fr(sscanf)f(\()p Fp(string)p Fr(,)h Fp(template)s Fr(\))240 1219 y Fv(This)h(is)g(lik)o(e)h Fr(scanf)p Fv(,)d(except)i(that)f(the)h(c)o(haracters)f(are)g(tak)o(en) g(from)g(the)g(string)h Fp(string)j Fv(instead)240 1281 y(of)c(from)f(a)g(stream.)19 b(Reac)o(hing)e(the)e(end)g(of)g(the)g (string)g(is)g(treated)g(as)f(an)h(end-of-\014le)i(condition.)62 1379 y(Calls)g(to)e Fr(scanf)g Fv(are)g(sup)q(er\014cially)j(similar)f (to)e(calls)i(to)e Fr(printf)f Fv(in)j(that)e(arbitrary)g(argumen)o(ts) g(are)g(read)0 1441 y(under)20 b(the)f(con)o(trol)f(of)h(a)f(template)h (string.)31 b(While)21 b(the)e(syn)o(tax)f(of)g(the)h(con)o(v)o(ersion) g(sp)q(eci\014cations)i(in)f(the)0 1503 y(template)g(is)f(v)o(ery)h (similar)g(to)f(that)g(for)f Fr(printf)p Fv(,)i(the)f(in)o (terpretation)h(of)f(the)g(template)h(is)g(orien)o(ted)f(more)0 1566 y(to)o(w)o(ards)f(free-format)h(input)i(and)e(simple)j(pattern)d (matc)o(hing,)h(rather)g(than)f(\014xed-\014eld)j(formatting.)33 b(F)l(or)0 1628 y(example,)18 b(most)e Fr(scanf)h Fv(con)o(v)o(ersions) g(skip)h(o)o(v)o(er)e(an)o(y)h(amoun)o(t)f(of)g(\\white)i(space")f (\(including)i(spaces,)f(tabs,)0 1690 y(and)12 b(newlines\))g(in)h(the) e(input)h(\014le,)h(and)f(there)f(is)h(no)f(concept)h(of)f(precision)i (for)e(the)g(n)o(umeric)i(input)f(con)o(v)o(ersions)0 1753 y(as)j(there)h(is)g(for)f(the)g(corresp)q(onding)i(output)e(con)o (v)o(ersions.)21 b(Ordinarily)l(,)d(non-whitespace)f(c)o(haracters)d (in)j(the)0 1815 y(template)e(are)g(exp)q(ected)i(to)d(matc)o(h)h(c)o (haracters)f(in)i(the)g(input)g(stream)e(exactly)l(.)62 1899 y(When)22 b(a)e Fp(matc)o(hing)h(failure)k Fv(o)q(ccurs,)d Fr(scanf)e Fv(returns)h(immediately)l(,)j(lea)o(ving)e(the)f(\014rst)g (non-matc)o(hing)0 1961 y(c)o(haracter)16 b(as)g(the)h(next)f(c)o (haracter)g(to)g(b)q(e)i(read)e(from)g(the)h(stream,)e(and)i Fr(scanf)f Fv(returns)h(all)g(the)g(items)g(that)0 2024 y(w)o(ere)e(successfully)i(con)o(v)o(erted.)62 2108 y(The)i(formatted)f (input)i(functions)f(are)g(not)g(used)g(as)f(frequen)o(tly)i(as)e(the)h (formatted)f(output)h(functions.)0 2170 y(P)o(artly)l(,)13 b(this)h(is)h(b)q(ecause)f(it)g(tak)o(es)f(some)g(care)h(to)f(use)h (them)g(prop)q(erly)l(.)20 b(Another)14 b(reason)f(is)h(that)f(it)h(is) g(di\016cult)0 2232 y(to)h(reco)o(v)o(er)f(from)h(a)f(matc)o(hing)i (error.)0 2356 y Fj(20.2.9)29 b(Input)16 b(Con)n(v)n(ersion)g(Syn)n (tax)62 2461 y Fv(A)k Fr(scanf)f Fv(template)g(string)h(is)g(a)f (string)h(that)f(con)o(tains)g(ordinary)h(m)o(ultib)o(yte)g(c)o (haracters)f(in)o(tersp)q(ersed)0 2524 y(with)d(con)o(v)o(ersion)f(sp)q (eci\014cations)i(that)d(start)g(with)i(`)p Fr(\045)p Fv('.)62 2608 y(An)o(y)i(whitespace)h(c)o(haracter)e(in)i(the)f (template)g(causes)h(an)o(y)e(n)o(um)o(b)q(er)i(of)e(whitespace)i(c)o (haracters)e(in)i(the)0 2670 y(input)e(stream)f(to)g(b)q(e)h(read)f (and)h(discarded.)25 b(The)17 b(whitespace)g(c)o(haracters)f(that)f (are)i(matc)o(hed)f(need)h(not)f(b)q(e)p eop %%Page: 128 130 128 129 bop 0 -58 a Fv(128)1743 b(Octa)o(v)o(e)0 183 y(exactly)15 b(the)h(same)e(whitespace)i(c)o(haracters)f(that)f(app)q (ear)h(in)h(the)f(template)g(string.)20 b(F)l(or)15 b(example,)g(write) g(`)g Fr(,)0 246 y Fv(')g(in)h(the)f(template)g(to)g(recognize)h(a)f (comma)g(with)g(optional)h(whitespace)g(b)q(efore)f(and)h(after.)62 331 y(Other)c(c)o(haracters)f(in)i(the)e(template)h(string)g(that)f (are)g(not)h(part)f(of)g(con)o(v)o(ersion)h(sp)q(eci\014cations)h(m)o (ust)f(matc)o(h)0 394 y(c)o(haracters)i(in)i(the)g(input)g(stream)e (exactly;)i(if)f(this)h(is)g(not)e(the)i(case,)e(a)h(matc)o(hing)h (failure)g(o)q(ccurs.)62 480 y(The)g(con)o(v)o(ersion)f(sp)q (eci\014cations)i(in)f(a)f Fr(scanf)f Fv(template)i(string)f(ha)o(v)o (e)g(the)g(general)h(form:)120 553 y Fr(\045)24 b Fp(\015ags)h(width)g (t)o(yp)q(e)h(con)o(v)o(ersion)62 639 y Fv(In)18 b(more)e(detail,)i(an) f(input)h(con)o(v)o(ersion)f(sp)q(eci\014cation)i(consists)e(of)f(an)h (initial)i(`)p Fr(\045)p Fv(')d(c)o(haracter)g(follo)o(w)o(ed)h(in)0 701 y(sequence)f(b)o(y:)37 787 y Ft(\017)30 b Fv(An)15 b(optional)h Fp(\015ag)f(c)o(haracter)j Fv(`)p Fr(*)p Fv(',)13 b(whic)o(h)j(sa)o(ys)f(to)f(ignore)i(the)f(text)g(read)g(for)f (this)i(sp)q(eci\014cation.)22 b(When)90 849 y Fr(scanf)14 b Fv(\014nds)g(a)g(con)o(v)o(ersion)h(sp)q(eci\014cation)h(that)e(uses) g(this)h(\015ag,)f(it)g(reads)g(input)h(as)f(directed)i(b)o(y)e(the)g (rest)90 911 y(of)e(the)h(con)o(v)o(ersion)g(sp)q(eci\014cation,)i(but) e(it)g(discards)g(this)g(input,)h(do)q(es)f(not)g(use)g(a)f(p)q(oin)o (ter)i(argumen)o(t,)e(and)90 974 y(do)q(es)k(not)e(incremen)o(t)i(the)g (coun)o(t)f(of)f(successful)j(assignmen)o(ts.)37 1051 y Ft(\017)30 b Fv(An)11 b(optional)g(decimal)h(in)o(teger)f(that)f(sp)q (eci\014es)j(the)d Fp(maxim)o(um)h(\014eld)h(width)p Fv(.)19 b(Reading)12 b(of)e(c)o(haracters)g(from)90 1114 y(the)i(input)h(stream)e(stops)g(either)i(when)f(this)g(maxim)o(um)g (is)g(reac)o(hed)g(or)g(when)g(a)f(non-matc)o(hing)i(c)o(haracter)90 1176 y(is)f(found,)g(whic)o(hev)o(er)h(happ)q(ens)f(\014rst.)18 b(Most)11 b(con)o(v)o(ersions)h(discard)g(initial)h(whitespace)g(c)o (haracters)e(\(those)90 1238 y(that)i(don't)h(are)f(explicitly)k(do)q (cumen)o(ted\),)d(and)g(these)g(discarded)h(c)o(haracters)f(don't)f (coun)o(t)h(to)o(w)o(ards)e(the)90 1300 y(maxim)o(um)j(\014eld)i (width.)37 1378 y Ft(\017)30 b Fv(An)19 b(optional)g(t)o(yp)q(e)f(mo)q (di\014er)i(c)o(haracter.)29 b(This)19 b(c)o(haracter)f(is)h(ignored)g (b)o(y)f(Octa)o(v)o(e's)g Fr(scanf)f Fv(function,)90 1440 y(but)e(is)h(recognized)g(to)f(pro)o(vide)h(compatibilit)o(y)g (with)g(the)f(C)g(language)h Fr(scanf)p Fv(.)37 1518 y Ft(\017)30 b Fv(A)15 b(c)o(haracter)g(that)f(sp)q(eci\014es)j(the)f (con)o(v)o(ersion)f(to)f(b)q(e)i(applied.)62 1619 y(The)h(exact)f (options)g(that)g(are)g(p)q(ermitted)h(and)f(ho)o(w)g(they)h(are)f(in)o (terpreted)h(v)m(ary)f(b)q(et)o(w)o(een)g(the)h(di\013eren)o(t)0 1681 y(con)o(v)o(ersion)f(sp)q(eci\014ers.)25 b(See)17 b(the)g(descriptions)g(of)f(the)h(individual)i(con)o(v)o(ersions)e(for) e(information)i(ab)q(out)f(the)0 1743 y(particular)g(options)f(that)g (they)g(allo)o(w.)0 1872 y Fj(20.2.10)29 b(T)-5 b(able)15 b(of)f(Input)i(Con)n(v)n(ersions)62 1979 y Fv(Here)g(is)f(a)g(table)h (that)e(summarizes)i(the)f(v)m(arious)h(con)o(v)o(ersion)f(sp)q (eci\014cations:)0 2080 y(`)p Fr(\045d)p Fv(')166 b(Matc)o(hes)14 b(an)g(optionally)i(signed)g(in)o(teger)e(written)h(in)g(decimal.)21 b(See)16 b(Section)f(20.2.11)d([Numeric)240 2142 y(Input)k(Con)o(v)o (ersions],)e(page)h(129.)0 2235 y(`)p Fr(\045i)p Fv(')166 b(Matc)o(hes)13 b(an)h(optionally)h(signed)g(in)o(teger)f(in)h(an)o(y)e (of)h(the)g(formats)e(that)h(the)h(C)g(language)g(de\014nes)240 2297 y(for)k(sp)q(ecifying)i(an)e(in)o(teger)h(constan)o(t.)28 b(See)19 b(Section)h(20.2.11)c([Numeric)j(Input)g(Con)o(v)o(ersions],) 240 2360 y(page)c(129.)0 2453 y(`)p Fr(\045o)p Fv(')166 b(Matc)o(hes)12 b(an)g(unsigned)i(in)o(teger)e(written)h(in)g(o)q(ctal) f(radix.)20 b(See)13 b(Section)g(20.2.11)d([Numeric)j(Input)240 2515 y(Con)o(v)o(ersions],)h(page)h(129.)0 2608 y(`)p Fr(\045u)p Fv(')166 b(Matc)o(hes)18 b(an)g(unsigned)h(in)o(teger)g (written)f(in)h(decimal)g(radix.)29 b(See)19 b(Section)g(20.2.11)d ([Numeric)240 2670 y(Input)g(Con)o(v)o(ersions],)e(page)h(129.)p eop %%Page: 129 131 129 130 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(129)0 183 y(`)p Fr(\045x)p Fv(',)14 b(`)p Fr(\045X)p Fv(')65 b(Matc)o(hes)18 b(an)g(unsigned)i(in)o(teger)e(written)g(in)h (hexadecimal)h(radix.)30 b(See)19 b(Section)g(20.2.11)d([Nu-)240 246 y(meric)g(Input)g(Con)o(v)o(ersions],)e(page)h(129.)0 334 y(`)p Fr(\045e)p Fv(',)f(`)p Fr(\045f)p Fv(',)g(`)p Fr(\045g)p Fv(',)f(`)p Fr(\045E)p Fv(',)h(`)p Fr(\045G)p Fv(')240 396 y(Matc)o(hes)21 b(an)h(optionally)h(signed)g(\015oating-p) q(oin)o(t)g(n)o(um)o(b)q(er.)40 b(See)23 b(Section)g(20.2.11)c ([Numeric)240 459 y(Input)d(Con)o(v)o(ersions],)e(page)h(129.)0 547 y(`)p Fr(\045s)p Fv(')166 b(Matc)o(hes)11 b(a)f(string)h(con)o (taining)h(only)g(non-whitespace)g(c)o(haracters.)18 b(See)12 b(Section)g(20.2.12)d([String)240 609 y(Input)16 b(Con)o(v)o(ersions],)e(page)h(129.)0 698 y(`)p Fr(\045c)p Fv(')166 b(Matc)o(hes)13 b(a)g(string)g(of)g(one)h(or)e(more)h(c)o (haracters;)g(the)h(n)o(um)o(b)q(er)f(of)g(c)o(haracters)g(read)g(is)h (con)o(trolled)240 760 y(b)o(y)f(the)g(maxim)o(um)f(\014eld)j(width)e (giv)o(en)g(for)f(the)h(con)o(v)o(ersion.)20 b(See)13 b(Section)h(20.2.12)c([String)j(Input)240 822 y(Con)o(v)o(ersions],)h (page)h(129.)0 911 y(`)p Fr(\045\045)p Fv(')166 b(This)18 b(matc)o(hes)e(a)h(literal)h(`)p Fr(\045)p Fv(')f(c)o(haracter)f(in)i (the)f(input)h(stream.)25 b(No)17 b(corresp)q(onding)h(argumen)o(t)240 973 y(is)e(used.)62 1070 y(If)i(the)f(syn)o(tax)f(of)g(a)h(con)o(v)o (ersion)g(sp)q(eci\014cation)i(is)f(in)o(v)m(alid,)h(the)e(b)q(eha)o (vior)h(is)f(unde\014ned.)27 b(If)18 b(there)f(aren't)0 1132 y(enough)d(function)h(argumen)o(ts)d(pro)o(vided)j(to)e(supply)i (addresses)f(for)f(all)h(the)g(con)o(v)o(ersion)g(sp)q(eci\014cations)h (in)g(the)0 1195 y(template)j(strings)h(that)e(p)q(erform)h(assignmen)o (ts,)h(or)e(if)i(the)f(argumen)o(ts)g(are)g(not)f(of)h(the)g(correct)g (t)o(yp)q(es,)h(the)0 1257 y(b)q(eha)o(vior)d(is)f(also)h(unde\014ned.) 21 b(On)16 b(the)f(other)g(hand,)g(extra)g(argumen)o(ts)f(are)h(simply) i(ignored.)0 1379 y Fj(20.2.11)29 b(Numeric)16 b(Input)f(Con)n(v)n (ersions)62 1484 y Fv(This)h(section)g(describ)q(es)h(the)e Fr(scanf)f Fv(con)o(v)o(ersions)i(for)e(reading)i(n)o(umeric)g(v)m (alues.)62 1567 y(The)g(`)p Fr(\045d)p Fv(')e(con)o(v)o(ersion)h(matc)o (hes)g(an)g(optionally)h(signed)h(in)o(teger)e(in)h(decimal)h(radix.)62 1651 y(The)22 b(`)p Fr(\045i)p Fv(')f(con)o(v)o(ersion)h(matc)o(hes)f (an)h(optionally)h(signed)g(in)o(teger)f(in)g(an)o(y)g(of)f(the)h (formats)e(that)h(the)h(C)0 1713 y(language)15 b(de\014nes)i(for)d(sp)q (ecifying)j(an)e(in)o(teger)h(constan)o(t.)62 1797 y(F)l(or)g(example,) h(an)o(y)e(of)h(the)g(strings)g(`)p Fr(10)p Fv(',)f(`)p Fr(0xa)p Fv(',)g(or)h(`)p Fr(012)p Fv(')f(could)i(b)q(e)g(read)f(in)h (as)f(in)o(tegers)g(under)h(the)f(`)p Fr(\045i)p Fv(')0 1859 y(con)o(v)o(ersion.)k(Eac)o(h)15 b(of)g(these)g(sp)q(eci\014es)i (a)e(n)o(um)o(b)q(er)h(with)f(decimal)i(v)m(alue)f Fr(10)p Fv(.)62 1943 y(The)f(`)p Fr(\045o)p Fv(',)e(`)p Fr(\045u)p Fv(',)h(and)g(`)p Fr(\045x)p Fv(')g(con)o(v)o(ersions)g(matc)o(h)g (unsigned)i(in)o(tegers)f(in)g(o)q(ctal,)g(decimal,)h(and)e (hexadecimal)0 2005 y(radices,)i(resp)q(ectiv)o(ely)l(.)62 2089 y(The)i(`)p Fr(\045X)p Fv(')f(con)o(v)o(ersion)h(is)g(iden)o (tical)i(to)d(the)h(`)p Fr(\045x)p Fv(')f(con)o(v)o(ersion.)28 b(They)18 b(b)q(oth)g(p)q(ermit)g(either)h(upp)q(ercase)f(or)0 2151 y(lo)o(w)o(ercase)d(letters)g(to)g(b)q(e)h(used)f(as)g(digits.)62 2235 y(Unlik)o(e)i(the)e(C)g(language)h Fr(scanf)p Fv(,)e(Octa)o(v)o(e) g(ignores)i(the)f(`)p Fr(h)p Fv(',)f(`)p Fr(l)p Fv(',)g(and)h(`)p Fr(L)p Fv(')g(mo)q(di\014ers.)0 2357 y Fj(20.2.12)29 b(String)15 b(Input)g(Con)n(v)n(ersions)62 2462 y Fv(This)g(section)h (describ)q(es)g(the)e Fr(scanf)g Fv(input)i(con)o(v)o(ersions)e(for)g (reading)h(string)g(and)f(c)o(haracter)g(v)m(alues:)21 b(`)p Fr(\045s)p Fv(')0 2524 y(and)15 b(`)p Fr(\045c)p Fv('.)62 2608 y(The)22 b(`)p Fr(\045c)p Fv(')e(con)o(v)o(ersion)i(is)g (the)g(simplest:)33 b(it)22 b(matc)o(hes)f(a)h(\014xed)g(n)o(um)o(b)q (er)g(of)f(c)o(haracters,)h(alw)o(a)o(ys.)38 b(The)0 2670 y(maxim)o(um)20 b(\014eld)h(with)f(sa)o(ys)f(ho)o(w)g(man)o(y)h(c) o(haracters)f(to)g(read;)i(if)g(y)o(ou)e(don't)g(sp)q(ecify)j(the)d (maxim)o(um,)i(the)p eop %%Page: 130 132 130 131 bop 0 -58 a Fv(130)1743 b(Octa)o(v)o(e)0 183 y(default)14 b(is)h(1.)k(This)c(con)o(v)o(ersion)f(do)q(es)g(not)f (skip)i(o)o(v)o(er)e(initial)j(whitespace)f(c)o(haracters.)j(It)c (reads)g(precisely)i(the)0 246 y(next)f Fp(n)h Fv(c)o(haracters,)e(and) h(fails)h(if)g(it)f(cannot)g(get)g(that)f(man)o(y)l(.)62 334 y(The)h(`)p Fr(\045s)p Fv(')f(con)o(v)o(ersion)h(matc)o(hes)g(a)f (string)h(of)g(non-whitespace)h(c)o(haracters.)j(It)c(skips)g(and)g (discards)h(initial)0 396 y(whitespace,)g(but)f(stops)g(when)g(it)h (encoun)o(ters)f(more)g(whitespace)h(after)e(ha)o(ving)i(read)f (something.)62 485 y(F)l(or)g(example,)g(reading)h(the)g(input:)144 561 y Fr(hello,)23 b(world)0 650 y Fv(with)14 b(the)f(con)o(v)o(ersion) h(`)p Fr(\04510c)p Fv(')e(pro)q(duces)i Fr(")h(hello,)f(wo")p Fv(,)f(but)h(reading)g(the)f(same)g(input)i(with)e(the)h(con)o(v)o (ersion)0 712 y(`)p Fr(\04510s)p Fv(')g(pro)q(duces)i Fr("hello,")p Fv(.)0 850 y Fj(20.2.13)29 b(Binary)15 b(I/O)62 959 y Fv(Octa)o(v)o(e)c(has)h(to)f(C-st)o(yle)h(functions)g (for)f(reading)h(and)g(writing)g(binary)g(data.)18 b(They)12 b(are)f Fr(fread)g Fv(and)h Fr(fwrite)0 1021 y Fv(and)j(are)g (patterned)g(after)g(the)g(standard)g(C)g(functions)h(with)f(the)h (same)f(names.)0 1128 y Fr(fread)f(\()p Fp(\014le)p Fr(,)i Fp(size)p Fr(,)g Fp(precision)p Fr(\))240 1190 y Fv(This)f(function)g (reads)f(data)g(in)h(binary)g(form)f(of)g(t)o(yp)q(e)g Fp(precision)i Fv(from)e(the)g(sp)q(eci\014ed)j Fp(\014le)p Fv(,)e(whic)o(h)240 1253 y(ma)o(y)f(b)q(e)i(either)g(a)f(\014le)h (name,)f(or)g(a)g(\014le)h(n)o(um)o(b)q(er)g(as)e(returned)i(from)e Fr(fopen)p Fv(.)240 1333 y(The)j(argumen)o(t)g Fp(size)k Fv(sp)q(eci\014es)e(the)e(size)h(of)f(the)g(matrix)g(to)g(return.)26 b(It)17 b(ma)o(y)g(b)q(e)g(a)g(scalar)h(or)e(a)240 1395 y(t)o(w)o(o-elemen)o(t)j(v)o(ector.)30 b(If)20 b(it)f(is)h(a)e(scalar,) i Fr(fread)e Fv(returns)h(a)g(column)h(v)o(ector)e(of)h(the)g(sp)q (eci\014ed)240 1458 y(length.)h(If)14 b(it)f(is)h(a)f(t)o(w)o(o-elemen) o(t)h(v)o(ector,)e(it)i(sp)q(eci\014es)h(the)f(n)o(um)o(b)q(er)g(of)f (ro)o(ws)f(and)i(columns)g(of)f(the)240 1520 y(result)j(matrix,)e(and)i Fr(fread)e Fv(\014lls)j(the)e(elemen)o(ts)h(of)e(the)i(matrix)f(in)h (column-ma)s(jor)e(order.)240 1600 y(The)e(argumen)o(t)f Fp(precision)i Fv(is)f(a)f(string)h(sp)q(ecifying)h(the)f(t)o(yp)q(e)f (of)g(data)g(to)g(read)h(and)g(ma)o(y)e(b)q(e)j(one)e(of)240 1663 y Fr("char")p Fv(,)16 b Fr("schar")p Fv(,)h Fr("short")p Fv(,)f Fr("int")p Fv(,)g Fr("long")p Fv(,)h Fr("float")p Fv(,)f Fr("double")p Fv(,)g Fr("uchar")p Fv(,)g Fr("ushort")p Fv(,)240 1725 y Fr("uint")p Fv(,)e(or)h Fr("ulong")p Fv(.)k(The)c(default)h(precision)g(is)g Fr("uchar")p Fv(.)240 1805 y(The)e Fr(fread)g Fv(function)h(returns)f(t)o(w)o(o)f(v) m(alues,)i Fr(data)p Fv(,)f(whic)o(h)h(is)g(the)f(data)g(read)g(from)f (the)i(\014le,)g(and)240 1868 y Fr(count)p Fv(,)f(whic)o(h)i(is)g(the)f (n)o(um)o(b)q(er)h(of)e(elemen)o(ts)i(read.)0 1966 y Fr(fwrite)e(\()p Fp(\014le)p Fr(,)i Fp(data)p Fr(,)f Fp(precision)p Fr(\))240 2028 y Fv(This)j(function)f(writes)g(data)g (in)h(binary)f(form)f(of)h(t)o(yp)q(e)g Fp(precision)h Fv(to)f(the)g(sp)q(eci\014ed)i Fp(\014le)p Fv(,)f(whic)o(h)240 2091 y(ma)o(y)c(b)q(e)i(either)g(a)f(\014le)h(name,)f(or)g(a)g(\014le)h (n)o(um)o(b)q(er)g(as)e(returned)i(from)e Fr(fopen)p Fv(.)240 2171 y(The)i(argumen)o(t)e Fp(data)h Fv(is)g(a)g(matrix)g(of)g (v)m(alues)i(that)d(are)h(to)g(b)q(e)h(written)f(to)g(the)g(\014le.)21 b(The)16 b(v)m(alues)240 2233 y(are)f(extracted)g(in)h(column-ma)s(jor) f(order.)240 2314 y(The)d(argumen)o(t)f Fp(precision)i Fv(is)f(a)f(string)h(sp)q(ecifying)h(the)f(t)o(yp)q(e)f(of)g(data)g(to) g(read)h(and)g(ma)o(y)e(b)q(e)j(one)e(of)240 2376 y Fr("char")p Fv(,)16 b Fr("schar")p Fv(,)h Fr("short")p Fv(,)f Fr("int")p Fv(,)g Fr("long")p Fv(,)h Fr("float")p Fv(,)f Fr("double")p Fv(,)g Fr("uchar")p Fv(,)g Fr("ushort")p Fv(,)240 2438 y Fr("uint")p Fv(,)e(or)h Fr("ulong")p Fv(.)k(The)c(default)h (precision)g(is)g Fr("uchar")p Fv(.)240 2519 y(The)f Fr(fwrite)g Fv(function)h(returns)f(the)g(n)o(um)o(b)q(er)h(of)e (elemen)o(ts)i(written.)240 2599 y(The)j(b)q(eha)o(vior)g(of)f Fr(fwrite)g Fv(is)i(unde\014ned)g(if)f(the)g(v)m(alues)h(in)f Fp(data)f Fv(are)h(to)q(o)f(large)h(to)f(\014t)g(in)i(the)240 2661 y(sp)q(eci\014ed)d(precision.)p eop %%Page: 131 133 131 132 bop 0 -58 a Fv(Chapter)15 b(20:)k(Input)d(and)g(Output)1267 b(131)0 183 y Fj(20.2.14)29 b(Other)15 b(I/O)g(F)-5 b(unctions)120 278 y Fr(fgets)23 b(\()p Fp(\014le)p Fr(,)i(len\))62 364 y Fv(Read)16 b(`)p Fr(len)p Fv(')e(c)o(haracters)g(from)h(a)g (\014le.)62 451 y(T)l(o)g(\015ush)g(output)g(to)f(a)h(stream,)f(use)h (the)g(function)g Fr(fflush)g(\()p Fp(\014le)s Fr(\))p Fv(.)20 b(This)15 b(is)h(useful)g(for)e(ensuring)i(that)e(all)0 513 y(p)q(ending)j(output)e(mak)o(es)f(it)h(to)g(the)g(screen)g(b)q (efore)g(some)g(other)g(ev)o(en)o(t)f(o)q(ccurs.)20 b(F)l(or)15 b(example,)g(it)h(is)f(alw)o(a)o(ys)f(a)0 575 y(go)q(o)q(d)h(idea)h(to) f(\015ush)g(the)h(standard)f(output)g(stream)f(b)q(efore)h(calling)i Fr(input)p Fv(.)62 662 y(Three)h(functions)g(are)f(a)o(v)m(ailable)i (for)e(setting)h(and)f(determining)i(the)f(p)q(osition)g(of)f(the)h (\014le)g(p)q(oin)o(ter)g(for)f(a)0 724 y(giv)o(en)f(\014le.)62 810 y(The)f(p)q(osition)h(of)e(the)h(\014le)h(p)q(oin)o(ter)f(\(as)f (the)h(n)o(um)o(b)q(er)g(of)g(c)o(haracters)e(from)h(the)h(b)q (eginning)i(of)e(the)f(\014le\))i(can)0 872 y(b)q(e)g(obtained)g(using) g(the)f(the)g(function)h Fr(ftell)f(\()p Fp(\014le)s Fr(\))p Fv(.)62 959 y(T)l(o)20 b(set)f(the)h(\014le)h(p)q(oin)o(ter)f (to)f(an)o(y)g(lo)q(cation)i(within)g(the)f(\014le,)h(use)f(the)g (function)h Fr(fseek)14 b(\()p Fp(\014le)p Fr(,)i(offset,)0 1021 y(origin\))p Fv(.)35 b(The)21 b(p)q(oin)o(ter)g(is)g(placed)h Fr(offset)d Fv(c)o(haracters)h(from)g(the)h Fr(origin)p Fv(,)f(whic)o(h)i(ma)o(y)e(b)q(e)h(one)g(of)f(the)0 1083 y(prede\014ned)c(v)m(ariables)f Fr(SEEK_CUR)e Fv(\(curren)o(t)h(p)q (osition\),)g Fr(SEEK_SET)f Fv(\(b)q(eginning\),)j(or)e Fr(SEEK_END)e Fv(\(end)j(of)f(\014le\).)0 1146 y(If)h Fr(origin)f Fv(is)h(omitted,)f Fr(SEEK_SET)g Fv(is)h(assumed.)20 b(The)15 b(o\013set)f(m)o(ust)g(b)q(e)h(zero,)f(or)h(a)f(v)m(alue)i (returned)f(b)o(y)g Fr(ftell)0 1208 y Fv(\(in)h(whic)o(h)g(case)f Fr(origin)f Fv(m)o(ust)h(b)q(e)h Fr(SEEK_SET)p Fv(.)j(See)c(Section)h (6.1)f([Prede\014ned)h(Constan)o(ts],)d(page)i(61.)62 1294 y(The)k(function)h Fr(frewind)14 b(\()p Fp(\014le)s Fr(\))20 b Fv(mo)o(v)o(es)e(the)h(\014le)h(p)q(oin)o(ter)f(to)g(the)g (b)q(eginning)i(of)d(a)h(\014le,)h(returning)g(1)f(for)0 1356 y(success,)c(and)h(0)f(if)g(an)g(error)g(w)o(as)f(encoun)o(tered.) 21 b(It)15 b(is)h(equiv)m(alen)o(t)h(to)d Fr(fseek)h(\()p Fp(\014le)p Fr(,)h(0,)f(SEEK_SET\))p Fv(.)62 1443 y(The)e(follo)o(wing) g(example)g(stores)e(the)h(curren)o(t)h(\014le)g(p)q(osition)g(in)g (the)f(v)m(ariable)i(`)p Fr(marker)p Fv(',)d(mo)o(v)o(es)g(the)h(p)q (oin)o(ter)0 1505 y(to)j(the)g(b)q(eginning)i(of)e(the)g(\014le,)h (reads)f(four)g(c)o(haracters,)f(and)h(then)h(returns)f(to)g(the)g (original)h(p)q(osition.)120 1579 y Fr(marker)23 b(=)h(ftell)f (\(myfile\);)120 1629 y(frewind)g(\(myfile\);)120 1679 y(fourch)g(=)h(fgets)f(\(myfile,)g(4\);)120 1728 y(fseek)g(\(myfile,)g (marker,)g(SEEK_SET\);)62 1815 y Fv(The)15 b(function)g Fr(feof)g(\()p Fp(\014le)s Fr(\))g Fv(allo)o(ws)g(y)o(ou)f(to)g(\014nd) h(out)f(if)h(an)g(end-of-\014le)h(condition)g(has)f(b)q(een)g(encoun)o (tered)0 1877 y(for)g(a)g(giv)o(en)h(\014le.)22 b(Note)15 b(that)g(it)h(will)h(only)f(return)g(1)f(if)h(the)f(end)i(of)e(the)g (\014le)i(has)e(already)h(b)q(een)h(encoun)o(tered,)0 1939 y(not)e(if)g(the)h(next)f(read)g(op)q(eration)h(will)g(result)g (in)g(an)f(end-of-\014le)i(condition.)62 2026 y(Similarly)l(,)j(the)e (function)g Fr(ferror)c(\()p Fp(\014le)s Fr(\))k Fv(allo)o(ws)g(y)o(ou) f(to)g(\014nd)h(out)f(if)h(an)f(error)g(condition)i(has)e(b)q(een)h (en-)0 2088 y(coun)o(tered)d(for)f(a)g(giv)o(en)i(\014le.)k(Note)15 b(that)f(it)h(will)h(only)f(return)g(1)f(if)i(an)e(error)g(has)h (already)g(b)q(een)h(encoun)o(tered,)0 2150 y(not)f(if)g(the)h(next)f (op)q(eration)g(will)i(result)f(in)g(an)f(error)g(condition.)62 2237 y(The)h(function)g Fr(kbhit)e Fv(ma)o(y)h(b)q(e)h(usd)f(to)g(read) g(a)g(single)h(k)o(eystrok)o(e)e(from)h(the)g(k)o(eyb)q(oard.)20 b(F)l(or)14 b(example,)120 2310 y Fr(x)24 b(=)f(kbhit)h(\(\);)0 2397 y Fv(will)19 b(set)d Fp(x)21 b Fv(to)16 b(the)h(next)g(c)o (haracter)f(t)o(yp)q(ed)i(at)e(the)h(k)o(eyb)q(oard,)g(without)g (requiring)h(a)f(carriage)g(return)g(to)f(b)q(e)0 2459 y(t)o(yp)q(ed.)62 2545 y(Finally)l(,)j(it)e(is)h(often)f(useful)h(to)e (kno)o(w)h(exactly)g(whic)o(h)h(\014les)g(ha)o(v)o(e)e(b)q(een)j(op)q (ened,)f(and)f(whether)g(they)g(are)0 2608 y(op)q(en)c(for)g(reading,)g (writing,)h(or)e(b)q(oth.)19 b(The)13 b(command)g Fr(freport)f Fv(prin)o(ts)h(this)g(information)g(for)f(all)i(op)q(en)f(\014les.)0 2670 y(F)l(or)i(example,)p eop %%Page: 132 134 132 133 bop 0 -58 a Fv(132)1743 b(Octa)o(v)o(e)120 183 y Fr(octave:13>)22 b(freport)144 308 y(number)47 b(mode)g(name)263 432 y(0)119 b(r)48 b(stdin)263 495 y(1)119 b(w)48 b(stdout)263 557 y(2)119 b(w)48 b(stderr)263 619 y(3)119 b(r)48 b(myfile)p eop %%Page: 133 135 133 134 bop 0 -58 a Fv(Chapter)15 b(21:)k(Sp)q(ecial)e(Matrices)1301 b(133)0 183 y Fs(21)41 b(Sp)r(ecial)14 b(Matrices)62 324 y Fv(Octa)o(v)o(e)h(pro)o(vides)h(a)g(n)o(um)o(b)q(er)g(of)f (functions)h(for)f(creating)h(sp)q(ecial)h(matrix)e(forms.)21 b(In)16 b(nearly)g(all)g(cases,)g(it)0 386 y(is)h(b)q(est)f(to)g(use)g (the)g(built-in)j(functions)e(for)e(this)i(purp)q(ose)g(than)f(to)f (try)h(to)f(use)i(other)f(tric)o(ks)g(to)f(ac)o(hiev)o(e)i(the)0 449 y(same)e(e\013ect.)0 588 y Fu(21.1)32 b(Sp)r(ecial)17 b(Utilit)n(y)g(Matrices)62 693 y Fv(The)k(function)g Fr(eye)e Fv(returns)h(an)g(iden)o(tit)o(y)h(matrix.)35 b(If)20 b(in)o(v)o(ok)o(ed)g(with)h(a)f(single)h(scalar)f(argumen)o(t,) g Fr(eye)0 756 y Fv(returns)f(a)g(square)h(matrix)f(with)h(the)f (dimension)i(sp)q(eci\014ed.)35 b(If)20 b(y)o(ou)f(supply)i(t)o(w)o(o)d (scalar)h(argumen)o(ts,)g Fr(eye)0 818 y Fv(tak)o(es)g(them)h(to)f(b)q (e)h(the)g(n)o(um)o(b)q(er)g(of)f(ro)o(ws)g(and)h(columns.)34 b(If)20 b(giv)o(en)g(a)f(matrix)h(or)f(v)o(ector)g(argumen)o(t,)g Fr(eye)0 880 y Fv(returns)c(an)g(iden)o(tit)o(y)h(matrix)f(with)h(the)f (same)g(dimensions)i(as)d(the)i(giv)o(en)f(argumen)o(t.)62 965 y(F)l(or)g(example,)120 1037 y Fr(eye)23 b(\(3\))0 1122 y Fv(creates)15 b(an)g(iden)o(tit)o(y)h(matrix)f(with)g(three)h (ro)o(ws)e(and)h(three)g(columns,)120 1194 y Fr(eye)23 b(\(5,)h(8\))0 1278 y Fv(creates)15 b(an)g(iden)o(tit)o(y)h(matrix)f (with)g(\014v)o(e)h(ro)o(ws)e(and)h(eigh)o(t)h(columns,)f(and)120 1350 y Fr(eye)23 b(\([13,)h(21;)f(34,)h(55]\))0 1435 y Fv(creates)15 b(an)g(iden)o(tit)o(y)h(matrix)f(with)g(t)o(w)o(o)f(ro) o(ws)g(and)i(t)o(w)o(o)e(columns.)62 1520 y(Normally)l(,)23 b Fr(eye)e Fv(exp)q(ects)g(an)o(y)g(scalar)g(argumen)o(ts)f(y)o(ou)h (pro)o(vide)g(to)g(b)q(e)g(real)h(and)f(non-negativ)o(e.)38 b(The)0 1582 y(v)m(ariables)17 b Fr(ok_to_lose_imaginary_part)12 b Fv(and)k Fr(treat_neg_dim_as_zero)d Fv(con)o(trol)j(the)g(b)q(eha)o (vior)g(of)f Fr(eye)0 1644 y Fv(for)f(complex)i(and)f(negativ)o(e)f (argumen)o(ts.)19 b(See)d(Section)f(6.2)f([User)g(Preferences],)h(page) g(62.)k(An)o(y)14 b(non-in)o(teger)0 1707 y(argumen)o(ts)g(are)h (rounded)h(to)f(the)g(nearest)g(in)o(teger)g(v)m(alue.)62 1791 y(There)i(is)h(an)e(am)o(biguit)o(y)h(when)h(these)f(functions)g (are)g(called)h(with)g(a)e(single)i(argumen)o(t.)24 b(Y)l(ou)17 b(ma)o(y)f(ha)o(v)o(e)0 1853 y(in)o(tended)22 b(to)e(create)h(a)g (matrix)f(with)h(the)g(same)g(dimensions)h(as)f(another)f(v)m(ariable,) j(but)e(ended)h(up)g(with)0 1916 y(something)16 b(quite)g(di\013eren)o (t,)f(b)q(ecause)h(the)g(v)m(ariable)g(that)f(y)o(ou)g(used)h(as)f(an)g (argumen)o(t)g(w)o(as)f(a)h(scalar)g(instead)0 1978 y(of)g(a)g(matrix.) 62 2063 y(F)l(or)20 b(example,)i(if)f(y)o(ou)f(need)h(to)e(create)h(an) h(iden)o(tit)o(y)g(matrix)f(with)g(the)h(same)f(dimensions)h(as)f (another)0 2125 y(v)m(ariable)d(in)f(y)o(our)e(program,)g(it)h(is)h(b)q (est)g(to)e(use)i(co)q(de)f(lik)o(e)i(this)120 2197 y Fr(eye)23 b(\(rows)h(\(a\),)f(columns)g(\(a\)\))0 2282 y Fv(instead)16 b(of)f(just)120 2354 y Fr(eye)23 b(\(a\))0 2438 y Fv(unless)16 b(y)o(ou)f(kno)o(w)g(that)f(the)i(v)m(ariable)g Fp(a)f Fv(will)i Fp(alw)o(a)o(ys)f Fv(b)q(e)g(a)f(matrix.)62 2523 y(The)e(functions)h Fr(ones)p Fv(,)e Fr(zeros)p Fv(,)h(and)g Fr(rand)f Fv(all)i(w)o(ork)e(lik)o(e)i Fr(eye)p Fv(,)e(except)i(that)e(they)h(\014ll)h(the)f(resulting)h(matrix)0 2585 y(with)i(all)g(ones,)f(all)h(zeros,)e(or)h(a)g(set)g(of)g(random)f (v)m(alues.)62 2670 y(If)i(y)o(ou)f(need)h(to)e(create)h(a)g(matrix)g (whose)g(v)m(alues)h(are)f(all)h(the)g(same,)e(y)o(ou)h(should)h(use)g (an)f(expression)h(lik)o(e)p eop %%Page: 134 136 134 135 bop 0 -58 a Fv(134)1743 b(Octa)o(v)o(e)120 183 y Fr(val_matrix)22 b(=)i(val)g(*)f(ones)h(\(n,)f(m\))62 274 y Fv(The)15 b Fr(rand)f Fv(function)h(also)g(tak)o(es)f(some)g (additional)i(argumen)o(ts)e(that)g(allo)o(w)h(y)o(ou)f(to)g(con)o (trol)g(its)h(b)q(eha)o(vior.)0 337 y(F)l(or)g(example,)g(the)h (function)g(call)120 415 y Fr(rand)23 b(\("normal"\))0 506 y Fv(causes)d(the)h(sequence)g(of)f(n)o(um)o(b)q(ers)g(to)g(b)q(e)h (normally)g(distributed.)36 b(Y)l(ou)21 b(ma)o(y)e(also)h(use)h(an)f (argumen)o(t)f(of)0 569 y Fr("uniform")e Fv(to)g(select)h(a)g(uniform)g (distribution.)29 b(T)l(o)18 b(\014nd)g(out)g(what)f(the)h(curren)o(t)g (distribution)h(is,)g(use)f(an)0 631 y(argumen)o(t)c(of)h Fr("dist")p Fv(.)62 722 y(Normally)l(,)f Fr(rand)d Fv(obtains)i(the)g (seed)g(from)e(the)i(system)f(clo)q(c)o(k,)h(so)g(that)e(the)i (sequence)h(of)e(random)g(n)o(um)o(b)q(ers)0 784 y(is)19 b(not)e(the)i(same)e(eac)o(h)h(time)h(y)o(ou)f(run)g(Octa)o(v)o(e.)28 b(If)19 b(y)o(ou)e(really)i(do)f(need)h(for)f(to)f(repro)q(duce)i(a)f (sequence)h(of)0 846 y(n)o(um)o(b)q(ers)c(exactly)l(,)h(y)o(ou)f(can)g (set)g(the)g(seed)h(to)f(a)f(sp)q(eci\014c)k(v)m(alue.)j(F)l(or)14 b(example,)i(the)f(function)h(call)120 925 y Fr(rand)23 b(\("seed",)g(13\))0 1016 y Fv(sets)15 b(the)g(seed)h(to)e(the)i(n)o (um)o(b)q(er)f(13.)20 b(T)l(o)14 b(see)i(what)f(the)g(curren)o(t)g (seed)h(is,)f(use)h(the)f(argumen)o(t)f Fr("seed")p Fv(.)62 1107 y(If)i(it)f(is)h(in)o(v)o(ok)o(ed)f(without)g(argumen)o(ts,)f Fr(rand)h Fv(returns)g(a)g(single)i(elemen)o(t)e(of)g(a)g(random)g (sequence.)62 1198 y(The)j Fr(rand)g Fv(function)h(uses)f(F)l(ortran)f (co)q(de)h(from)g(RANLIB,)h(a)e(library)i(of)f(fortran)f(routines)h (for)f(random)0 1260 y(n)o(um)o(b)q(er)12 b(generation,)g(compiled)h(b) o(y)f(Barry)e(W.)h(Bro)o(wn)g(and)h(James)g(Lo)o(v)m(ato)e(of)i(the)f (Departmen)o(t)g(of)g(Biomath-)0 1323 y(ematics)k(at)g(The)g(Univ)o (ersit)o(y)h(of)f(T)l(exas,)g(M.D.)e(Anderson)j(Cancer)f(Cen)o(ter,)g (Houston,)f(TX)h(77030.)62 1414 y(T)l(o)k(create)g(a)h(diagonal)g (matrix)f(with)g(v)o(ector)g Fp(v)k Fv(on)c(diagonal)h Fp(k)p Fv(,)g(use)g(the)f(function)i(diag)e(\()p Fp(v)p Fv(,)h Fp(k)s Fv(\).)32 b(The)0 1476 y(second)18 b(argumen)o(t)f(is)h (optional.)28 b(If)18 b(it)g(is)g(p)q(ositiv)o(e,)h(the)e(v)o(ector)g (is)h(placed)h(on)f(the)f Fp(k)p Fv(-th)h(sup)q(er-diagonal.)29 b(If)0 1538 y(it)16 b(is)g(negativ)o(e,)g(it)f(is)i(placed)g(on)e(the)h Fp(-k)p Fv(-th)g(sub-diagonal.)22 b(The)16 b(default)g(v)m(alue)h(of)e Fp(k)k Fv(is)d(0,)f(and)h(the)f(v)o(ector)g(is)0 1601 y(placed)h(on)g(the)f(main)g(diagonal.)21 b(F)l(or)15 b(example,)120 1679 y Fr(octave:13>)22 b(diag)i(\([1,)f(2,)h(3],)f(1\)) 120 1729 y(ans)g(=)168 1829 y(0)47 b(1)h(0)f(0)168 1878 y(0)g(0)h(2)f(0)168 1928 y(0)g(0)h(0)f(3)168 1978 y(0)g(0)h(0)f(0)62 2069 y Fv(The)23 b(functions)h Fr(linspace)d Fv(and)i Fr(logspace)f Fv(mak)o(e)g(it)h(v)o(ery)g(easy)f(to)g(create)h(v)o (ectors)f(with)h(ev)o(enly)g(or)0 2131 y(logarithmically)17 b(spaced)f(elemen)o(ts.)k(F)l(or)15 b(example,)120 2210 y Fr(linspace)23 b(\()p Fp(base)p Fr(,)g Fp(limit)p Fr(,)j Fp(n)p Fr(\))0 2301 y Fv(creates)17 b(a)g(v)o(ector)g(with)g Fp(n)h Fv(\()p Fp(n)f Fv(greater)f(than)i(2\))e(linearly)j(spaced)f (elemen)o(ts)g(b)q(et)o(w)o(een)g Fp(base)i Fv(and)d Fp(limit)p Fv(.)28 b(The)0 2363 y Fp(base)21 b Fv(and)f Fp(limit)h Fv(are)d(alw)o(a)o(ys)g(included)k(in)e(the)f(range.)30 b(If)19 b Fp(base)j Fv(is)d(greater)f(than)h Fp(limit)p Fv(,)i(the)e(elemen)o(ts)g(are)0 2426 y(stored)c(in)h(decreasing)g (order.)j(If)d(the)f(n)o(um)o(b)q(er)h(of)f(p)q(oin)o(ts)g(is)h(not)f (sp)q(eci\014ed,)i(a)d(v)m(alue)j(of)e(100)f(is)i(used.)62 2517 y(The)d(function)h Fr(logspace)d Fv(is)i(similar)h(to)e Fr(linspace)g Fv(except)h(that)f(the)g(v)m(alues)i(are)e (logarithmically)j(spaced.)62 2608 y(If)j Fp(limit)i Fv(is)f(equal)f(to)f Fo(\031)r Fv(,)h(the)f(p)q(oin)o(ts)i(are)e(b)q (et)o(w)o(een)h(10)1032 2591 y Fn(base)1115 2608 y Fv(and)g Fo(\031)r Fv(,)g Fp(not)g Fv(10)1395 2591 y Fn(base)1478 2608 y Fv(and)g(10)1615 2591 y Fn(\031)1637 2608 y Fv(,)g(in)h(order)e (to)g(b)q(e)0 2670 y(compatible)f(with)g(the)f(corresp)q(onding)h Fq(Ma)m(tlab)g Fv(function.)p eop %%Page: 135 137 135 136 bop 0 -58 a Fv(Chapter)15 b(21:)k(Sp)q(ecial)e(Matrices)1301 b(135)0 183 y Fu(21.2)32 b(F)-6 b(amous)13 b(Matrices)62 287 y Fv(The)j(follo)o(wing)g(functions)g(return)f(famous)f(matrix)h (forms.)0 379 y Fr(hadamard)f(\()p Fp(k)s Fr(\))240 441 y Fv(Return)i(the)f(Hadamard)g(matrix)g(of)f(order)h(n)h(=)f(2)p Fr(^)p Fv(k.)0 521 y Fr(hankel)f(\()p Fp(c)p Fr(,)h Fp(r)s Fr(\))240 583 y Fv(Return)j(the)g(Hank)o(el)h(matrix)e(constructed)h (giv)o(en)h(the)f(\014rst)f(column)i Fp(c)p Fv(,)f(and)g (\(optionally\))h(the)240 645 y(last)f(ro)o(w)f Fp(r)p Fv(.)27 b(If)18 b(the)g(last)f(elemen)o(t)i(of)e Fp(c)k Fv(is)d(not)g(the)f(same)h(as)f(the)h(\014rst)g(elemen)o(t)g(of)f Fp(r)p Fv(,)h(the)g(last)240 707 y(elemen)o(t)d(of)f Fp(c)j Fv(is)d(used.)20 b(If)15 b(the)f(second)h(argumen)o(t)e(is)i (omitted,)f(the)g(last)g(ro)o(w)f(is)i(tak)o(en)f(to)f(b)q(e)i(the)240 770 y(same)g(as)g(the)g(\014rst)g(column.)240 841 y(A)g(Hank)o(el)h (matrix)f(formed)g(from)f(an)h(m-v)o(ector)g Fp(c)p Fv(,)g(and)g(an)g (n-v)o(ector)g Fp(r)p Fv(,)g(has)g(the)g(elemen)o(ts)620 934 y Fo(H)t Fv(\()p Fo(i;)8 b(j)s Fv(\))h(=)814 875 y Fh(\032)853 900 y Fo(c)873 907 y Fn(i)p Fk(+)p Fn(j)r Fl(\000)p Fk(1)970 900 y Fo(;)59 b(i)9 b Fv(+)i Fo(j)h Ft(\000)f Fv(1)h Ft(\024)h Fo(m)p Fv(;)853 963 y Fo(r)874 970 y Fn(i)p Fk(+)p Fn(j)r Fl(\000)p Fn(m)983 963 y Fo(;)46 b Fv(otherwise.)0 1036 y Fr(hilb)15 b(\()p Fp(n)p Fr(\))56 b Fv(Return)17 b(the)g(Hilb)q(ert)g(matrix)g(of)f(order)g Fp(n)p Fv(.)24 b(The)16 b Fo(i;)f(j)j Fv(elemen)o(t)g(of)e(a)g(Hilb)q (ert)i(matrix)e(is)h(de\014ned)240 1099 y(as)770 1161 y Fo(H)t Fv(\()p Fo(i;)8 b(j)s Fv(\))h(=)1061 1130 y(1)p 969 1150 207 2 v 969 1192 a(\()p Fo(i)h Fv(+)g Fo(j)j Ft(\000)d Fv(1\))0 1263 y Fr(invhilb)k(\()p Fp(n)p Fr(\))240 1325 y Fv(Return)19 b(the)f(in)o(v)o(erse)g(of)g(a)g(Hilb)q(ert)h (matrix)f(of)g(order)g Fp(n)p Fv(.)28 b(This)19 b(is)g(exact.)28 b(Compare)17 b(with)i(the)240 1387 y(n)o(umerical)13 b(calculation)h(of)e Fr(inverse)i(\(hilb)h(\(n\)\))p Fv(,)d(whic)o(h)h(su\013ers)e(from)h(the)g(ill-conditi)q(oning)j(of)240 1450 y(the)c(Hilb)q(ert)i(matrix,)e(and)h(the)f(\014nite)i(precision)f (of)f(y)o(our)g(computer's)g(\015oating)g(p)q(oin)o(t)h(arithmetic.)0 1529 y Fr(toeplitz)i(\()p Fp(c)p Fr(,)h Fp(r)s Fr(\))240 1591 y Fv(Return)i(the)f(T)l(o)q(eplitz)h(matrix)f(constructed)g(giv)o (en)g(the)g(\014rst)g(column)g Fp(c)p Fv(,)g(and)g(\(optionally\))h (the)240 1654 y(\014rst)f(ro)o(w)g Fp(r)p Fv(.)24 b(If)17 b(the)g(\014rst)g(elemen)o(t)g(of)f Fp(c)k Fv(is)d(not)g(the)f(same)h (as)f(the)h(\014rst)f(elemen)o(t)i(of)e Fp(r)p Fv(,)h(the)f(\014rst)240 1716 y(elemen)o(t)e(of)g Fp(c)i Fv(is)f(used.)k(If)14 b(the)g(second)g(argumen)o(t)f(is)i(omitted,)e(the)h(\014rst)f(ro)o(w)g (is)h(tak)o(en)f(to)h(b)q(e)g(the)240 1778 y(same)h(as)g(the)g(\014rst) g(column.)240 1849 y(A)g(square)g(T)l(o)q(eplitz)i(matrix)e(has)g(the)g (form)664 1886 y Fh(2)664 1960 y(6)664 1984 y(6)664 2009 y(6)664 2034 y(6)664 2059 y(6)664 2084 y(6)664 2111 y(4)701 1913 y Fo(c)721 1920 y Fk(0)810 1913 y Fo(r)831 1920 y Fk(1)940 1913 y Fo(r)961 1920 y Fk(2)1047 1913 y Fo(:)8 b(:)g(:)65 b(r)1188 1920 y Fn(n)701 1975 y Fo(c)721 1982 y Fk(1)810 1975 y Fo(c)830 1982 y Fk(0)940 1975 y Fo(r)961 1982 y Fk(1)1146 1975 y Fo(c)1166 1982 y Fn(n)p Fl(\000)p Fk(1)701 2038 y Fo(c)721 2045 y Fk(2)810 2038 y Fo(c)830 2045 y Fk(1)940 2038 y Fo(c)960 2045 y Fk(0)1146 2038 y Fo(c)1166 2045 y Fn(n)p Fl(\000)p Fk(2)714 2083 y Fv(.)714 2099 y(.)714 2116 y(.)1182 2083 y(.)1182 2099 y(.)1182 2116 y(.)699 2178 y Fo(c)719 2185 y Fn(n)787 2178 y Fo(c)807 2185 y Fn(n)p Fl(\000)p Fk(1)917 2178 y Fo(c)937 2185 y Fn(n)p Fl(\000)p Fk(2)1047 2178 y Fo(:)8 b(:)g(:)67 b(c)1189 2185 y Fk(0)1238 1886 y Fh(3)1238 1960 y(7)1238 1984 y(7)1238 2009 y(7)1238 2034 y(7)1238 2059 y(7)1238 2084 y(7)1238 2111 y(5)1273 2046 y Fo(:)0 2251 y Fr(vander)14 b(\()p Fp(c)s Fr(\))240 2313 y Fv(Return)i(the)f(V)l(andermonde)h (matrix)f(whose)g(next)g(to)g(last)g(column)h(is)g Fp(c)p Fv(.)240 2384 y(A)f(V)l(andermonde)h(matrix)f(has)g(the)g(form)737 2407 y Fh(2)737 2480 y(6)737 2505 y(6)737 2530 y(6)737 2554 y(6)737 2581 y(4)773 2439 y Fo(c)793 2423 y Fn(n)793 2450 y Fk(0)860 2439 y Fo(:)8 b(:)g(:)46 b(c)981 2423 y Fk(2)981 2450 y(0)1049 2439 y Fo(c)1069 2446 y Fk(0)1134 2439 y Fv(1)773 2501 y Fo(c)793 2485 y Fn(n)793 2512 y Fk(1)860 2501 y Fo(:)8 b(:)g(:)46 b(c)981 2485 y Fk(2)981 2512 y(1)1049 2501 y Fo(c)1069 2508 y Fk(1)1134 2501 y Fv(1)788 2547 y(.)788 2564 y(.)788 2581 y(.)974 2547 y(.)974 2564 y(.)974 2581 y(.)1061 2547 y(.)1061 2564 y(.)1061 2581 y(.)1139 2547 y(.)1139 2564 y(.)1139 2581 y(.)773 2643 y Fo(c)793 2626 y Fn(n)793 2654 y(n)860 2643 y Fo(:)8 b(:)g(:)44 b(c)979 2626 y Fk(2)979 2654 y Fn(n)1047 2643 y Fo(c)1067 2650 y Fn(n)1134 2643 y Fv(1)1165 2407 y Fh(3)1165 2480 y(7)1165 2505 y(7)1165 2530 y(7)1165 2554 y(7)1165 2581 y(5)1200 2541 y Fo(:)p eop %%Page: 136 138 136 137 bop 0 -58 a Fv(136)1743 b(Octa)o(v)o(e)p eop %%Page: 137 139 137 138 bop 0 -58 a Fv(Chapter)15 b(22:)k(Matrix)c(Manipulation)1210 b(137)0 183 y Fs(22)41 b(Matrix)14 b(Manipulation)62 328 y Fv(There)j(are)f(a)g(n)o(um)o(b)q(er)h(of)f(functions)h(a)o(v)m (ailable)h(for)e(c)o(hec)o(king)i(to)d(see)i(if)g(the)g(elemen)o(ts)g (of)f(a)g(matrix)g(meet)0 391 y(some)f(condition,)i(and)f(for)f (rearranging)g(the)h(elemen)o(ts)g(of)f(a)g(matrix.)21 b(F)l(or)15 b(example,)h(Octa)o(v)o(e)f(can)h(easily)h(tell)0 453 y(y)o(ou)d(if)h(all)h(the)e(elemen)o(ts)h(of)f(a)g(matrix)h(are)f (\014nite,)h(or)f(are)g(less)h(than)g(some)f(sp)q(eci\014ed)i(v)m (alue.)21 b(Octa)o(v)o(e)14 b(can)h(also)0 515 y(rotate)f(the)h(elemen) o(ts,)h(extract)e(the)h(upp)q(er-)i(or)d(lo)o(w)o(er-triangular)i (parts,)e(or)g(sort)h(the)g(columns)h(of)f(a)g(matrix.)0 658 y Fu(22.1)32 b(Finding)18 b(Elemen)n(ts)13 b(and)j(Chec)n(king)g (Conditions)62 764 y Fv(The)i(functions)g Fr(any)f Fv(and)h Fr(all)f Fv(are)g(useful)i(for)d(determining)j(whether)f(an)o(y)f(or)g (all)i(of)e(the)g(elemen)o(ts)h(of)f(a)0 826 y(matrix)e(satisfy)g(some) g(condition.)62 912 y(Giv)o(en)h(a)f(v)o(ector,)f(the)h(function)h Fr(any)f Fv(returns)g(1)g(if)h(an)o(y)e(elemen)o(t)i(of)f(the)g(v)o (ector)g(is)h(nonzero.)62 997 y(F)l(or)d(a)g(matrix)g(argumen)o(t,)g Fr(any)g Fv(returns)g(a)h(ro)o(w)e(v)o(ector)h(of)g(ones)g(and)h(zeros) f(with)h(eac)o(h)g(elemen)o(t)g(indicating)0 1059 y(whether)h(an)o(y)f (of)h(the)g(elemen)o(ts)g(of)g(the)g(corresp)q(onding)g(column)h(of)f (the)f(matrix)h(are)f(nonzero.)20 b(F)l(or)14 b(example,)120 1132 y Fr(octave:13>)22 b(any)i(\(eye)f(\(2,)h(4\)\))120 1182 y(ans)f(=)168 1282 y(1)47 b(1)h(0)f(0)62 1367 y Fv(T)l(o)15 b(see)h(if)f(an)o(y)g(of)g(the)g(elemen)o(ts)h(of)f(a)g (matrix)g(are)f(nonzero,)h(y)o(ou)g(can)h(use)f(a)g(statemen)o(t)f(lik) o(e)120 1440 y Fr(any)23 b(\(any)h(\(a\)\))62 1526 y Fv(F)l(or)13 b(a)g(matrix)g(argumen)o(t,)g Fr(any)g Fv(returns)g(a)h (ro)o(w)e(v)o(ector)h(of)g(ones)g(and)h(zeros)f(with)h(eac)o(h)g (elemen)o(t)g(indicating)0 1588 y(whether)h(an)o(y)g(of)g(the)g(elemen) o(ts)h(of)f(the)g(corresp)q(onding)h(column)g(of)f(the)h(matrix)e(are)h (nonzero.)62 1673 y(The)c(function)h Fr(all)f Fv(b)q(eha)o(v)o(es)g (lik)o(e)h(the)f(function)g Fr(any)p Fv(,)g(except)h(that)e(it)h (returns)g(true)g(only)g(if)g(all)h(the)f(elemen)o(ts)0 1736 y(of)k(a)g(v)o(ector,)f(or)g(all)j(the)e(elemen)o(ts)h(in)g(a)f (column)h(of)e(a)h(matrix,)g(are)g(nonzero.)62 1821 y(Since)k(the)f (comparison)f(op)q(erators)g(\(see)g(Section)i(3.11)d([Comparison)h (Ops],)h(page)f(34\))g(return)g(matrices)0 1883 y(of)g(ones)h(and)g (zeros,)g(it)g(is)g(easy)f(to)g(test)g(a)h(matrix)f(for)g(man)o(y)g (things,)i(not)e(just)g(whether)h(the)g(elemen)o(ts)g(are)0 1946 y(nonzero.)i(F)l(or)15 b(example,)120 2019 y Fr(octave:13>)22 b(all)i(\(all)f(\(rand)g(\(5\))h(<)g(0.9\)\))120 2068 y(ans)f(=)h(0)0 2154 y Fv(tests)15 b(a)f(random)h(5)g(b)o(y)g(5)g (matrix)g(to)g(see)g(if)h(all)g(of)f(it's)g(elemen)o(ts)g(are)g(less)h (than)f(0.9.)62 2239 y(Note)d(that)g(in)h(conditional)i(con)o(texts)c (\(lik)o(e)j(the)e(test)g(clause)h(of)f Fr(if)h Fv(and)f Fr(while)g Fv(statemen)o(ts\))f(Octa)o(v)o(e)h(treats)0 2302 y(the)j(test)g(as)g(if)g(y)o(ou)g(had)h(t)o(yp)q(ed)f Fr(all)g(\(all)g(\(condition\)\))p Fv(.)62 2387 y(The)i(functions)g Fr(isinf)p Fv(,)e Fr(finite)p Fv(,)g(and)i Fr(isnan)e Fv(return)h(1)g(if)h(their)f(argumen)o(ts)g(are)g(in\014nite,)i (\014nite,)f(or)e(not)0 2449 y(a)g(n)o(um)o(b)q(er,)f(resp)q(ectiv)o (ely)l(,)j(and)e(return)g(0)f(otherwise.)20 b(F)l(or)15 b(matrix)f(v)m(alues,)i(they)f(all)h(w)o(ork)e(on)h(an)f(elemen)o(t)i (b)o(y)0 2512 y(elemen)o(t)g(basis.)k(F)l(or)15 b(example,)g(ev)m (aluating)i(the)e(expression)120 2585 y Fr(isinf)23 b(\([1,)g(2;)h (Inf,)f(4]\))0 2670 y Fv(pro)q(duces)16 b(the)f(matrix)p eop %%Page: 138 140 138 139 bop 0 -58 a Fv(138)1743 b(Octa)o(v)o(e)120 183 y Fr(ans)23 b(=)168 283 y(0)47 b(0)168 333 y(1)g(0)62 419 y Fv(The)13 b(function)g Fr(find)f Fv(returns)g(a)g(v)o(ector)g(of) g(indices)i(of)e(nonzero)g(elemen)o(ts)h(of)f(a)g(matrix.)19 b(T)l(o)12 b(obtain)h(a)f(single)0 481 y(index)k(for)e(eac)o(h)g (matrix)g(elemen)o(t,)h(Octa)o(v)o(e)f(pretends)h(that)f(the)g(columns) h(of)f(a)h(matrix)f(form)f(one)i(long)g(v)o(ector)0 543 y(\(lik)o(e)h(F)l(ortran)e(arra)o(ys)g(are)h(stored\).)k(F)l(or)14 b(example,)120 617 y Fr(octave:13>)22 b(find)i(\(eye)f(\(2\)\))120 667 y(ans)g(=)168 767 y(1)168 816 y(4)62 902 y Fv(If)15 b(t)o(w)o(o)e(outputs)h(are)g(requested,)g Fr(find)g Fv(returns)g(the)h(ro)o(w)e(and)i(column)g(indices)h(of)e(nonzero)g (elemen)o(ts)h(of)f(a)0 965 y(matrix.)20 b(F)l(or)14 b(example,)120 1038 y Fr(octave:13>)22 b([i,)i(j])g(=)f(find)h(\(eye)f (\(2\)\))120 1088 y(i)h(=)168 1188 y(1)168 1238 y(2)120 1337 y(j)g(=)168 1437 y(1)168 1487 y(2)62 1573 y Fv(If)16 b(three)f(outputs)g(are)g(requested,)g Fr(find)g Fv(also)g(returns)g (the)g(nonzero)h(v)m(alues)g(in)g(a)f(v)o(ector.)0 1718 y Fu(22.2)32 b(Rearranging)16 b(Matrices)62 1825 y Fv(The)j(function)h Fr(fliplr)d Fv(rev)o(erses)i(the)g(order)f(of)g(the)h(columns)g(in)h(a) e(matrix,)h(and)g Fr(flipud)e Fv(rev)o(erses)i(the)0 1887 y(order)c(of)g(the)g(ro)o(ws.)k(F)l(or)14 b(example,)120 1961 y Fr(octave:13>)22 b(fliplr)i(\([1,)f(2;)g(3,)h(4]\))120 2011 y(ans)f(=)168 2111 y(2)47 b(1)168 2160 y(4)g(3)120 2260 y(octave:13>)22 b(flipud)i(\([1,)f(2;)g(3,)h(4]\))120 2310 y(ans)f(=)168 2409 y(3)47 b(4)168 2459 y(1)g(2)62 2545 y Fv(The)21 b(function)h Fr(rot90)15 b(\()p Fp(a)p Fr(,)f Fp(n)p Fr(\))21 b Fv(rotates)f(a)g(matrix)h(coun)o(terclo)q(c)o (kwise)h(in)f(90-degree)g(incremen)o(ts.)38 b(The)0 2608 y(second)20 b(argumen)o(t)e(is)h(optional,)h(and)g(sp)q(eci\014es)g(ho) o(w)f(man)o(y)f(90-degree)h(rotations)g(are)f(to)h(b)q(e)g(applied)i (\(the)0 2670 y(default)16 b(v)m(alue)g(is)g(1\).)j(Negativ)o(e)c(v)m (alues)i(of)d Fp(n)i Fv(rotate)e(the)h(matrix)g(in)h(a)f(clo)q(c)o (kwise)h(direction.)21 b(F)l(or)15 b(example,)p eop %%Page: 139 141 139 140 bop 0 -58 a Fv(Chapter)15 b(22:)k(Matrix)c(Manipulation)1210 b(139)120 183 y Fr(rot90)23 b(\([1,)g(2;)h(3,)g(4],)f(-1\))120 233 y(ans)g(=)168 333 y(3)47 b(1)168 382 y(4)g(2)0 466 y Fv(rotates)14 b(the)h(giv)o(en)h(matrix)f(clo)q(c)o(kwise)h(b)o(y)f (90)g(degrees.)20 b(The)c(follo)o(wing)f(are)g(all)h(equiv)m(alen)o(t)h (statemen)o(ts:)120 536 y Fr(rot90)23 b(\([1,)g(2;)h(3,)g(4],)f(-1\)) 120 586 y(rot90)g(\([1,)g(2;)h(3,)g(4],)f(3\))120 636 y(rot90)g(\([1,)g(2;)h(3,)g(4],)f(7\))62 719 y Fv(The)15 b(function)h Fr(reshape)e(\()p Fp(a)p Fr(,)g Fp(m)p Fr(,)h Fp(n)p Fr(\))g Fv(returns)f(a)h(matrix)f(with)h Fp(m)f Fv(ro)o(ws)g(and)h Fp(n)f Fv(columns)i(whose)e(elemen)o(ts)0 781 y(are)21 b(tak)o(en)g(from)f(the)i(matrix)e Fp(a)p Fv(.)38 b(T)l(o)21 b(decide)i(ho)o(w)e(to)f(order)h(the)h(elemen)o(ts,) h(Octa)o(v)o(e)e(pretends)g(that)g(the)0 843 y(elemen)o(ts)16 b(of)f(a)g(matrix)f(are)h(stored)g(in)h(column-ma)s(jor)f(order)g (\(lik)o(e)h(F)l(ortran)e(arra)o(ys)g(are)h(stored\).)62 926 y(F)l(or)g(example,)120 997 y Fr(octave:13>)22 b(reshape)h(\([1,)h (2,)f(3,)h(4],)f(2,)h(2\))120 1047 y(ans)f(=)168 1146 y(1)47 b(3)168 1196 y(2)g(4)62 1279 y Fv(If)16 b(the)f(v)m(ariable)i Fr(do_fortran_indexing)12 b Fv(is)k Fr("true")p Fv(,)e(the)h Fr(reshape)f Fv(function)i(is)g(equiv)m(alen)o(t)h(to)120 1350 y Fr(retval)23 b(=)h(zeros)f(\(m,)g(n\);)120 1400 y(retval)g(\(:\))g(=)h(a;)0 1483 y Fv(but)17 b(it)f(is)h(somewhat)f (less)h(cryptic)g(to)f(use)h Fr(reshape)e Fv(instead)i(of)f(the)h (colon)g(op)q(erator.)22 b(Note)16 b(that)g(the)h(total)0 1545 y(n)o(um)o(b)q(er)i(of)f(elemen)o(ts)h(in)h(the)e(original)i (matrix)e(m)o(ust)g(matc)o(h)g(the)h(total)f(n)o(um)o(b)q(er)g(of)h (elemen)o(ts)g(in)g(the)g(new)0 1607 y(matrix.)62 1690 y(The)g(function)g(`)p Fr(sort)p Fv(')d(can)j(b)q(e)f(used)h(to)f (arrange)f(the)h(elemen)o(ts)h(of)f(a)f(v)o(ector)h(in)h(increasing)g (order.)29 b(F)l(or)0 1753 y(matrices,)15 b Fr(sort)f Fv(orders)h(the)h(elemen)o(ts)f(in)h(eac)o(h)g(column.)62 1836 y(F)l(or)f(example,)120 1906 y Fr(octave:13>)22 b(sort)i(\(rand)f(\(4\)\))120 1956 y(ans)g(=)168 2056 y(0.065359)46 b(0.039391)h(0.376076)g(0.384298)168 2105 y(0.111486)f(0.140872)h(0.418035)g(0.824459)168 2155 y(0.269991)f(0.274446)h(0.421374)g(0.938918)168 2205 y(0.580030)f(0.975784)h(0.562145)g(0.954964)62 2288 y Fv(The)16 b Fr(sort)e Fv(function)i(ma)o(y)f(also)g(b)q(e)h(used)f(to)g (pro)q(duce)h(a)f(matrix)g(con)o(taining)h(the)f(original)h(ro)o(w)e (indices)j(of)0 2350 y(the)e(elemen)o(ts)h(in)g(the)f(sorted)g(matrix.) 20 b(F)l(or)14 b(example,)120 2421 y Fr(s)24 b(=)168 2521 y(0.051724)46 b(0.485904)h(0.253614)g(0.348008)168 2570 y(0.391608)f(0.526686)h(0.536952)g(0.600317)168 2620 y(0.733534)f(0.545522)h(0.691719)g(0.636974)168 2670 y(0.986353)f(0.976130)h(0.868598)g(0.713884)p eop %%Page: 140 142 140 141 bop 0 -58 a Fv(140)1743 b(Octa)o(v)o(e)120 233 y Fr(i)24 b(=)168 333 y(2)47 b(4)h(2)f(3)168 382 y(4)g(1)h(3)f(4)168 432 y(1)g(2)h(4)f(1)168 482 y(3)g(3)h(1)f(2)0 578 y Fv(These)16 b(v)m(alues)g(ma)o(y)e(b)q(e)i(used)g(to)f(reco)o(v)o(er)f(the)h (original)i(matrix)e(from)f(the)h(sorted)g(v)o(ersion.)20 b(F)l(or)15 b(example,)62 707 y(The)f Fr(sort)g Fv(function)h(do)q(es)f (not)g(allo)o(w)g(sort)f(k)o(eys)h(to)f(b)q(e)i(sp)q(eci\014ed,)g(so)f (it)g(can't)g(b)q(e)g(used)h(to)e(order)h(the)g(ro)o(ws)0 769 y(of)h(a)h(matrix)f(according)h(to)f(the)h(v)m(alues)h(of)e(the)g (elemen)o(ts)i(in)f(v)m(arious)g(columns)1402 753 y Fk(1)1437 769 y Fv(in)h(a)e(single)i(call.)23 b(Using)16 b(the)0 832 y(second)e(output,)f(ho)o(w)o(ev)o(er,)f(it)h(is)h(p)q(ossible)h (to)d(sort)h(all)h(ro)o(ws)e(based)h(on)g(the)g(v)m(alues)i(in)f(a)e (giv)o(en)i(column.)20 b(Here's)0 894 y(an)15 b(example)h(that)f(sorts) f(the)h(ro)o(ws)f(of)h(a)g(matrix)g(based)g(on)g(the)h(v)m(alues)g(in)g (the)f(third)h(column.)120 977 y Fr(octave:13>)22 b(a)i(=)g(rand)f (\(4\))120 1027 y(a)h(=)168 1127 y(0.080606)46 b(0.453558)h(0.835597)g (0.437013)168 1177 y(0.277233)f(0.625541)h(0.447317)g(0.952203)168 1226 y(0.569785)f(0.528797)h(0.319433)g(0.747698)168 1276 y(0.385467)f(0.124427)h(0.883673)g(0.226632)120 1376 y(octave:14>)22 b([s,)i(i])g(=)f(sort)h(\(a)f(\(:,)h(3\)\);)120 1426 y(octave:15>)e(a)i(\(i,)g(:\))120 1475 y(ans)f(=)168 1575 y(0.569785)46 b(0.528797)h(0.319433)g(0.747698)168 1625 y(0.277233)f(0.625541)h(0.447317)g(0.952203)168 1675 y(0.080606)f(0.453558)h(0.835597)g(0.437013)168 1724 y(0.385467)f(0.124427)h(0.883673)g(0.226632)62 1820 y Fv(The)17 b(functions)h Fr(triu)d(\()p Fp(a)p Fr(,)f Fp(k)s Fr(\))j Fv(and)g Fr(tril)d(\()p Fp(a)p Fr(,)h Fp(k)s Fr(\))h Fv(extract)g(the)h(upp)q(er)h(or)f(lo)o(w)o(er)f (triangular)h(part)f(of)h(the)0 1883 y(matrix)g Fp(a)p Fv(,)f(and)h(set)g(all)h(other)f(elemen)o(ts)g(to)g(zero.)25 b(The)17 b(second)g(argumen)o(t)f(is)i(optional,)g(and)f(sp)q (eci\014es)h(ho)o(w)0 1945 y(man)o(y)d(diagonals)g(ab)q(o)o(v)o(e)g(or) g(b)q(elo)o(w)h(the)f(main)h(diagonal)f(should)i(also)e(b)q(e)h(set)f (to)f(zero.)62 2041 y(The)19 b(default)f(v)m(alue)i(of)d Fp(k)k Fv(is)e(zero,)f(so)g(that)f Fr(triu)h Fv(and)g Fr(tril)g Fv(normally)g(include)j(the)d(main)h(diagonal)f(as)0 2103 y(part)d(of)f(the)i(result)f(matrix.)62 2199 y(If)g(the)g(v)m (alue)h(of)f Fp(k)i Fv(is)f(negativ)o(e,)e(additional)i(elemen)o(ts)g (ab)q(o)o(v)o(e)e(\(for)g Fr(tril)p Fv(\))g(or)g(b)q(elo)o(w)i(\(for)e Fr(triu)p Fv(\))g(the)h(main)0 2261 y(diagonal)h(are)f(also)g (selected.)62 2357 y(The)h(absolute)f(v)m(alue)i(of)d Fp(k)k Fv(m)o(ust)d(not)g(b)q(e)h(greater)e(than)h(the)g(n)o(um)o(b)q (er)h(of)f(sub-)g(or)g(sup)q(er-diagonals.)62 2452 y(F)l(or)g(example,) p 0 2551 600 2 v 21 2590 a Fk(1)62 2606 y Fv(F)l(or)j(example,)h(to)e (\014rst)h(sort)f(based)i(on)f(the)g(v)m(alues)h(in)g(column)g(1,)f (and)h(then,)f(for)g(an)o(y)g(v)m(alues)h(that)e(are)62 2668 y(rep)q(eated)f(in)g(column)g(1,)f(sort)f(based)h(on)h(the)f(v)m (alues)h(found)g(in)g(column)g(2,)e(etc.)p eop %%Page: 141 143 141 142 bop 0 -58 a Fv(Chapter)15 b(22:)k(Matrix)c(Manipulation)1210 b(141)120 183 y Fr(octave:13>)22 b(tril)i(\(rand)f(\(4\),)g(1\))120 246 y(ans)g(=)168 370 y(0.00000)46 b(0.00000)h(0.00000)g(0.00000)168 432 y(0.09012)f(0.00000)h(0.00000)g(0.00000)168 495 y(0.01215)f (0.34768)h(0.00000)g(0.00000)168 557 y(0.00302)f(0.69518)h(0.91940)g (0.00000)0 633 y Fv(forms)14 b(a)h(lo)o(w)o(er)g(triangular)g(matrix)g (from)g(a)g(random)f(4)h(b)o(y)g(4)g(matrix,)g(omitting)g(the)g(main)h (diagonal,)f(and)120 711 y Fr(octave:13>)22 b(tril)i(\(rand)f(\(4\),)g (-1\))120 774 y(ans)g(=)168 898 y(0.06170)46 b(0.51396)h(0.00000)g (0.00000)168 960 y(0.96199)f(0.11986)h(0.35714)g(0.00000)168 1023 y(0.16185)f(0.61442)h(0.79343)g(0.52029)168 1085 y(0.68016)f(0.48835)h(0.63609)g(0.72113)0 1161 y Fv(forms)13 b(a)g(lo)o(w)o(er)g(triangular)h(matrix)g(from)e(a)i(random)f(4)g(b)o (y)h(4)f(matrix,)h(including)i(the)e(main)g(diagonal)g(and)g(the)0 1223 y(\014rst)h(sup)q(er-diagonal.)p eop %%Page: 142 144 142 143 bop 0 -58 a Fv(142)1743 b(Octa)o(v)o(e)p eop %%Page: 143 145 143 144 bop 0 -58 a Fv(Chapter)15 b(23:)k(String)d(F)l(unctions)1298 b(143)0 183 y Fs(23)41 b(String)15 b(F)-7 b(unctions)62 316 y Fv(Octa)o(v)o(e)15 b(curren)o(tly)h(has)f(a)g(limited)i(abilit)o (y)f(to)f(w)o(ork)f(with)h(strings.)62 399 y(The)k(function)h Fr(strcmp)14 b(\()p Fp(s1)p Fr(,)h Fp(s2)t Fr(\))j Fv(compares)g(t)o(w) o(o)g(strings,)h(returning)g(1)g(if)g(they)g(are)f(the)h(same,)g(and)g (0)0 461 y(otherwise.)62 544 y Fm(Note:)26 b(F)l(or)18 b(compatibilit)o(y)h(with)g Fq(Ma)m(tlab)p Fm(,)g(Octa)o(v)o(e's)f (strcmp)e(function)k(returns)f(1)g(if)g(the)f(strings)h(are)0 607 y(equal,)d(and)g(0)f(otherwise.)20 b(This)c(is)g(just)f(the)g(opp)q (osite)h(of)f(the)g(corresp)q(onding)i(C)e(library)j(function.)62 690 y Fv(The)f(functions)g Fr(int2str)e Fv(and)i Fr(num2str)e Fv(con)o(v)o(ert)h(a)g(n)o(umeric)i(argumen)o(t)d(to)h(a)g(string.)23 b(These)17 b(functions)0 752 y(are)d(not)g(v)o(ery)h(\015exible,)h(but) f(are)f(pro)o(vided)h(for)f(compatibilit)o(y)j(with)d Fq(Ma)m(tlab)p Fv(.)20 b(F)l(or)14 b(b)q(etter)h(con)o(trol)f(o)o(v)o (er)g(the)0 814 y(results,)h(use)h Fr(sprintf)e Fv(\(see)h(Section)h (20.2.2)d([F)l(ormatted)h(Output],)h(page)g(122\).)62 897 y(The)h(function)g Fr(setstr)e Fv(can)h(b)q(e)h(used)g(to)f(con)o (v)o(ert)f(a)h(v)o(ector)g(to)f(a)h(string.)20 b(Eac)o(h)15 b(elemen)o(t)h(of)f(the)g(v)o(ector)f(is)0 959 y(con)o(v)o(erted)h(to)f (the)i(corresp)q(onding)g(ASCI)q(I)g(c)o(haracter.)k(F)l(or)14 b(example,)120 1030 y Fr(setstr)23 b(\([97,)g(98,)h(99]\))0 1113 y Fv(creates)15 b(the)g(string)120 1184 y Fr(abc)62 1267 y Fv(The)e(function)f Fr(undo_string_escapes)h(\()p Fp(string)t Fr(\))f Fv(con)o(v)o(erts)f(sp)q(ecial)j(c)o(haracters)d (in)i(strings)f(bac)o(k)g(to)f(their)0 1329 y(escap)q(ed)16 b(forms.)j(F)l(or)c(example,)g(the)h(expression)120 1400 y Fr(bell)23 b(=)h("\\a";)0 1483 y Fv(assigns)19 b(the)h(v)m(alue)g(of) f(the)h(alert)f(c)o(haracter)g(\(con)o(trol-g,)g(ASCI)q(I)i(co)q(de)f (7\))e(to)h(the)g(string)h(v)m(ariable)g Fp(b)q(ell)p Fv(.)35 b(If)0 1545 y(this)16 b(string)f(is)g(prin)o(ted,)h(the)f (system)g(will)i(ring)e(the)h(terminal)g(b)q(ell)h(\(if)e(it)h(is)f(p)q (ossible\).)22 b(This)15 b(is)h(normally)g(the)0 1607 y(desired)g(outcome.)k(Ho)o(w)o(ev)o(er,)14 b(sometimes)h(it)h(is)f (useful)i(to)d(b)q(e)i(able)g(to)f(prin)o(t)g(the)h(original)g (represen)o(tation)f(of)0 1669 y(the)g(string,)g(with)h(the)f(sp)q (ecial)i(c)o(haracters)d(replaced)j(b)o(y)e(their)h(escap)q(e)f (sequences.)21 b(F)l(or)15 b(example,)120 1740 y Fr(octave:13>)22 b(undo_string_escapes)g(\(bell\))120 1790 y(ans)h(=)h(\\a)0 1873 y Fv(replaces)16 b(the)e(unprin)o(table)i(alert)f(c)o(haracter)f (with)h(its)g(prin)o(table)h(represen)o(tation.)j(See)c(Section)h (3.1.2)d([String)0 1935 y(Constan)o(ts],)g(page)i(22,)f(for)h(a)g (description)i(of)d(string)i(escap)q(es.)p eop %%Page: 144 146 144 145 bop 0 -58 a Fv(144)1743 b(Octa)o(v)o(e)p eop %%Page: 145 147 145 146 bop 0 -58 a Fv(Chapter)15 b(24:)k(System)c(Utilities)1313 b(145)0 183 y Fs(24)41 b(System)13 b(Utilities)62 333 y Fv(This)19 b(c)o(hapter)f(describ)q(es)h(the)g(functions)f(that)g (are)g(a)o(v)m(ailable)h(to)f(allo)o(w)g(y)o(ou)g(to)f(get)h (information)g(ab)q(out)0 396 y(what)h(is)h(happ)q(ening)h(outside)g (of)e(Octa)o(v)o(e,)h(while)h(it)e(is)h(still)h(running,)h(and)e(use)f (this)h(information)g(in)g(y)o(our)0 458 y(program.)30 b(F)l(or)19 b(example,)h(y)o(ou)f(can)h(get)e(information)h(ab)q(out)g (en)o(vironmen)o(t)h(v)m(ariables,)h(the)e(curren)o(t)g(time,)0 520 y(and)c(ev)o(en)h(start)e(other)h(programs)f(from)g(the)h(Octa)o(v) o(e)g(prompt.)0 667 y Fu(24.1)32 b(Timing)14 b(Utilities)62 774 y Fv(The)f(function)h Fr(clock)e Fv(returns)h(a)g(v)o(ector)f(con)o (taining)i(the)f(curren)o(t)f(y)o(ear,)h(mon)o(th)f(\(1-12\),)g(da)o(y) g(\(1-31\),)g(hour)0 836 y(\(0-23\),)h(min)o(ute)j(\(0-59\))e(and)h (second)h(\(0-60\).)j(F)l(or)14 b(example,)120 910 y Fr(octave:13>)22 b(clock)120 960 y(ans)h(=)168 1060 y(1993)118 b(8)96 b(20)119 b(4)95 b(56)119 b(1)62 1146 y Fv(The)16 b(function)g(clo)q(c)o(k)g(is)f(more)g(accurate)g(on)g(systems)g(that)f (ha)o(v)o(e)h(the)g Fr(gettimeofday)f Fv(function.)62 1233 y(T)l(o)j(get)f(the)h(date)f(as)g(a)h(c)o(haracter)f(string)g(in)i (the)f(form)e(DD-MMM-YY,)h(use)h(the)f(command)h Fr(date)p Fv(.)24 b(F)l(or)0 1295 y(example,)120 1369 y Fr(octave:13>)e(date)120 1419 y(ans)h(=)h(20-Aug-93)62 1505 y Fv(Octa)o(v)o(e)15 b(also)g(has)g(functions)h(for)f(computing)g(time)h(in)o(terv)m(als)g (and)f(CPU)g(time)h(used.)k(The)15 b(functions)h Fr(tic)0 1567 y Fv(and)f Fr(toc)g Fv(can)g(b)q(e)h(used)g(to)f(set)g(and)g(c)o (hec)o(k)g(a)g(w)o(all-clo)q(c)o(k)i(timer.)j(F)l(or)15 b(example,)120 1641 y Fr(tic)23 b(\(\);)120 1691 y(#)h(many)f (computations)f(later...)120 1741 y(elapsed_time)g(=)i(toc)f(\(\);)0 1827 y Fv(will)f(set)f(the)g(v)m(ariable)h Fr(elapsed_time)d Fv(to)h(the)h(n)o(um)o(b)q(er)g(of)f(seconds)h(since)h(the)f(most)f (recen)o(t)h(call)h(to)e(the)0 1890 y(function)c Fr(tic)p Fv(.)62 1976 y(The)e(function)h Fr(etime)e Fv(pro)o(vides)h(another)g (w)o(a)o(y)f(to)g(get)g(elapsed)i(w)o(all-clo)q(c)o(k)g(time)f(b)o(y)g (returning)h(the)e(di\013er-)0 2038 y(ence)j(\(in)g(seconds\))f(b)q(et) o(w)o(een)h(t)o(w)o(o)d(time)j(v)m(alues)g(returned)g(from)e Fr(clock)p Fv(.)19 b(F)l(or)c(example:)120 2112 y Fr(t0)24 b(=)f(clock)g(\(\);)120 2162 y(#)h(many)f(computations)f(later...)120 2212 y(elapsed_time)g(=)i(etime)f(\(clock)g(\(\),)h(t0\);)0 2299 y Fv(will)17 b(set)e(the)g(v)m(ariable)i Fr(elapsed_time)c Fv(to)i(the)g(n)o(um)o(b)q(er)h(of)e(seconds)i(since)g(the)g(v)m (ariable)g Fr(t0)f Fv(w)o(as)f(set.)62 2385 y(The)k(function)h Fr(cputime)e Fv(allo)o(ws)h(y)o(ou)g(to)f(obtain)i(information)f(ab)q (out)g(the)g(amoun)o(t)f(of)g(CPU)h(time)g(y)o(our)0 2447 y(Octa)o(v)o(e)d(session)h(is)f(using.)21 b(F)l(or)14 b(example,)120 2521 y Fr([total,)23 b(user,)g(system])g(=)h(cputime)f (\(\);)0 2608 y Fv(returns)11 b(the)f(CPU)h(time)g(used)g(b)o(y)f(y)o (our)g(Octa)o(v)o(e)h(session.)19 b(The)10 b(\014rst)h(output)f(is)h (the)g(total)f(time)h(sp)q(en)o(t)g(executing)0 2670 y(y)o(our)16 b(pro)q(cess)h(and)f(is)i(equal)f(to)f(the)g(sum)h(of)f (second)h(and)g(third)g(outputs,)f(whic)o(h)h(are)g(the)f(n)o(um)o(b)q (er)h(of)f(CPU)p eop %%Page: 146 148 146 147 bop 0 -58 a Fv(146)1743 b(Octa)o(v)o(e)0 183 y(seconds)17 b(sp)q(en)o(t)f(executing)h(in)g(user)f(mo)q(de)h(and)f (the)g(n)o(um)o(b)q(er)h(of)e(CPU)h(seconds)h(sp)q(en)o(t)f(executing)h (in)g(system)0 246 y(mo)q(de,)e(resp)q(ectiv)o(ely)l(.)62 334 y(Finally)l(,)e(Octa)o(v)o(e's)d(function)h Fr(is_leap_year)e Fv(returns)h(1)g(if)h(the)f(giv)o(en)h(y)o(ear)f(is)h(a)f(leap)i(y)o (ear)d(and)i(0)f(otherwise.)0 397 y(If)15 b(no)h(argumen)o(ts)e(are)h (pro)o(vided,)g Fr(is_leap_year)f Fv(will)j(use)e(the)h(curren)o(t)f(y) o(ear.)k(F)l(or)c(example,)120 473 y Fr(octave:13>)22 b(is_leap_year)h(\(2000\))120 523 y(ans)g(=)h(1)0 612 y Fv(Con)o(trary)c(to)g(what)h(man)o(y)g(p)q(eople)i(who)e(p)q(ost)g (misinformation)h(to)f(Usenet)g(apparen)o(tly)h(b)q(eliev)o(e,)i(Octa)o (v)o(e)0 674 y(kno)o(ws)15 b(that)f(the)h(y)o(ear)g(2000)f(will)j(b)q (e)f(a)f(leap)h(y)o(ear.)0 831 y Fu(24.2)32 b(In)n(teracting)17 b(with)e(the)h(OS)62 941 y Fv(Y)l(ou)f(can)g(execute)h(an)o(y)f(shell)h (command)f(using)g(the)g(function)h Fr(system)e(\()p Fp(cmd)p Fr(,)i Fp(\015ag)t Fr(\))p Fv(.)j(The)c(second)g(argu-)0 1003 y(men)o(t)i(is)i(optional.)28 b(If)18 b(it)g(is)g(presen)o(t,)g (the)g(output)f(of)g(the)h(command)g(is)g(returned)g(b)o(y)g Fr(system)f Fv(as)g(a)g(string.)0 1065 y(If)h(it)f(is)h(not)f (supplied,)j(an)o(y)d(output)h(from)e(the)i(command)f(is)h(prin)o(ted,) g(with)g(the)g(standard)f(output)g(\014ltered)0 1127 y(through)e(the)g(pager.)20 b(F)l(or)14 b(example,)120 1204 y Fr(users)23 b(=)h(system)f(\("finger",)f(1\))0 1293 y Fv(places)16 b(the)f(output)g(of)g(the)g(command)g Fr(finger)g Fv(in)h(the)f(v)m(ariable)i Fr(users)p Fv(.)62 1382 y(If)i(y)o(ou)f(w)o(an)o(t)f(to)g(execute)i(a)f(shell)i(command)e (and)h(ha)o(v)o(e)e(it)i(b)q(eha)o(v)o(e)g(as)e(if)i(it)g(w)o(ere)f(t)o (yp)q(ed)g(directly)i(from)0 1444 y(the)15 b(shell)i(prompt,)d(y)o(ou)h (ma)o(y)f(need)i(to)e(sp)q(ecify)i(extra)f(argumen)o(ts)f(for)g(the)h (command.)20 b(F)l(or)15 b(example,)g(to)f(get)0 1506 y Fr(bash)h Fv(to)f(b)q(eha)o(v)o(e)i(as)e(an)i(in)o(teractiv)o(e)f (shell,)i(y)o(ou)d(can)i(t)o(yp)q(e)120 1583 y Fr(system)23 b(\("bash)g(-i)h(>/dev/tty"\);)62 1672 y Fv(The)16 b(\014rst)f(argumen) o(t,)f(`)p Fr(-i)p Fv(',)g(tells)i Fr(bash)f Fv(to)f(b)q(eha)o(v)o(e)i (as)f(an)g(in)o(teractiv)o(e)h(shell,)g(and)g(the)f(redirection)i(of)e (the)0 1734 y(standard)i(output)h(stream)f(prev)o(en)o(ts)h(an)o(y)f (output)h(pro)q(duced)h(b)o(y)f Fr(bash)f Fv(from)g(b)q(eing)i(sen)o(t) f(bac)o(k)g(to)f(Octa)o(v)o(e,)0 1796 y(where)e(it)h(w)o(ould)f(b)q(e)h (bu\013ered)g(un)o(til)g(Octa)o(v)o(e)f(displa)o(ys)h(another)f (prompt.)62 1885 y(The)k Fr(system)e Fv(function)i(can)g(return)f(t)o (w)o(o)f(v)m(alues.)30 b(The)19 b(\014rst)f(is)h(an)o(y)e(output)i (from)e(the)h(command)h(that)0 1948 y(w)o(as)c(written)h(to)g(the)g (standard)f(output)h(stream,)f(and)h(the)h(second)f(is)h(the)f(output)g (status)f(of)g(the)h(command.)0 2010 y(F)l(or)f(example,)120 2086 y Fr([output,)23 b(status])g(=)g(system)g(\("echo)g(foo;)h(exit)f (2"\);)0 2175 y Fv(will)17 b(set)e(the)g(v)m(ariable)i Fr(output)d Fv(to)h(the)g(string)g(`)p Fr(foo)p Fv(',)f(and)h(the)g(v)m (ariable)i Fr(status)d Fv(to)h(the)g(in)o(teger)g(`)p Fr(2)p Fv('.)62 2264 y(The)h(name)f Fr(shell_cmd)f Fv(exists)h(for)g (compatibilit)o(y)i(with)e(earlier)h(v)o(ersions)g(of)e(Octa)o(v)o(e.) 62 2353 y(Y)l(ou)i(can)f(\014nd)h(the)f(v)m(alues)i(of)d(en)o(vironmen) o(t)i(v)m(ariables)g(using)g(the)g(function)g Fr(getenv)p Fv(.)j(F)l(or)14 b(example,)120 2430 y Fr(getenv)23 b(\("PATH"\))0 2519 y Fv(returns)15 b(a)g(string)g(con)o(taining)h(the)f(v)m(alue)i (of)e(y)o(our)f(path.)62 2608 y(The)j(functions)g Fr(clc)p Fv(,)f(and)h Fr(home)e Fv(clear)i(y)o(our)f(terminal)h(screen)g(and)g (mo)o(v)o(e)e(the)i(cursor)f(to)g(the)g(upp)q(er)i(left)0 2670 y(corner.)p eop %%Page: 147 149 147 148 bop 0 -58 a Fv(Chapter)15 b(24:)k(System)c(Utilities)1313 b(147)62 183 y(Y)l(ou)23 b(can)g(c)o(hange)g(the)g(curren)o(t)g(w)o (orking)f(directory)h(using)h(the)e Fr(cd)h Fv(command.)42 b(Tilde)25 b(expansion)e(is)0 246 y(p)q(erformed)15 b(on)h(the)f(path.) 20 b(F)l(or)14 b(example,)120 316 y Fr(cd)24 b(~/octave)0 399 y Fv(Changes)c(the)g(curren)o(t)g(w)o(orking)g(directory)h(to)e(`)p Fr(~/octave)p Fv('.)33 b(If)21 b(the)f(directory)h(do)q(es)f(not)g (exist,)i(an)e(error)0 461 y(message)15 b(is)g(prin)o(ted)h(and)g(the)f (w)o(orking)g(directory)g(is)h(not)f(c)o(hanged.)62 544 y(The)h(name)f Fr(chdir)f Fv(is)i(an)f(alias)h(for)f Fr(cd)p Fv(.)62 627 y(The)h(command)f Fr(pwd)g Fv(prin)o(ts)g(the)g (curren)o(t)g(w)o(orking)g(directory)l(.)62 710 y(The)h(functions)g Fr(dir)e Fv(and)i Fr(ls)f Fv(list)h(directory)f(con)o(ten)o(ts.)k(F)l (or)c(example,)120 781 y Fr(octave:13>)22 b(ls)i(-l)120 831 y(total)f(12)120 881 y(-rw-r--r--)70 b(1)24 b(jwe)143 b(users)190 b(4488)23 b(Aug)h(19)f(04:02)g(foo.m)120 930 y(-rw-r--r--)70 b(1)24 b(jwe)143 b(users)190 b(1315)23 b(Aug)h(17)f(23:14)g(bar.m)62 1013 y Fv(The)13 b Fr(dir)e Fv(and)i Fr(ls)e Fv(commands)h(are)g(implemen)o(ted)i(b)o(y)e(calling)i (y)o(our)d(system's)h(directory)g(listing)h(command,)0 1076 y(so)i(the)g(a)o(v)m(ailable)i(options)e(ma)o(y)g(v)m(ary)g(from)f (system)h(to)g(system.)0 1209 y Fu(24.3)32 b(System)14 b(Information)62 1312 y Fv(If)i(p)q(ossible,)h Fr(computer)e Fv(prin)o(ts)h(a)f(string)h(of)f(the)h(form)f Fp(cpu)p Fv(-)p Fp(v)o(endor)p Fv(-)p Fp(os)j Fv(that)d(iden)o(ti\014es)i(the)f (kind)h(of)e(com-)0 1375 y(puter)g(Octa)o(v)o(e)g(is)h(running)g(on.)k (F)l(or)15 b(example,)120 1445 y Fr(octave:13>)22 b(computer)120 1495 y(sparc-sun-sunos4.1.2)62 1578 y Fv(The)d(function)f Fr(isieee)g Fv(returns)g(1)f(if)i(y)o(our)e(computer)h(claims)h(to)f (conform)f(to)h(the)g(IEEE)g(standard)g(for)0 1640 y(\015oating)d(p)q (oin)o(t)h(calculations.)62 1723 y(The)f(function)f Fr(version)f Fv(returns)h(Octa)o(v)o(e's)f(v)o(ersion)i(n)o(um)o(b)q(er)f(as)g(a)f (string.)20 b(This)14 b(is)h(also)f(the)g(v)m(alue)h(of)f(the)0 1786 y(built-in)k(v)m(ariable)e Fr(OCTAVE_VERSION)p Fv(.)i(See)e (Chapter)f(6)g([Built-in)i(V)l(ariables],)e(page)h(61.)0 1918 y Fu(24.4)32 b(Other)15 b(F)-6 b(unctions)62 2022 y Fv(The)16 b(function)h Fr(pause)e Fv(allo)o(ws)h(y)o(ou)f(to)g(susp)q (end)i(the)f(execution)h(of)f(a)f(program.)21 b(If)16 b(in)o(v)o(ok)o(ed)g(without)f(an)o(y)0 2084 y(argumen)o(ts,)h(Octa)o (v)o(e)g(w)o(aits)h(un)o(til)h(y)o(ou)e(t)o(yp)q(e)h(a)g(c)o(haracter.) 24 b(With)17 b(a)g(n)o(umeric)g(argumen)o(t,)f(it)i(pauses)f(for)f(the) 0 2147 y(giv)o(en)g(n)o(um)o(b)q(er)g(of)e(seconds.)21 b(F)l(or)15 b(example,)h(the)f(follo)o(wing)h(statemen)o(t)f(prin)o(ts) g(a)g(message)g(and)h(then)f(w)o(aits)g(5)0 2209 y(seconds)h(b)q(efore) f(clearing)h(the)g(screen.)120 2280 y Fr(fprintf)23 b(\(stderr,)g ("wait)g(please...\\n"\),)f(pause)h(\(5\),)g(clc)p eop %%Page: 148 150 148 149 bop 0 -58 a Fv(148)1743 b(Octa)o(v)o(e)p eop %%Page: 149 151 149 150 bop 0 -58 a Fv(Chapter)15 b(25:)k(Command)c(History)g(F)l (unctions)1053 b(149)0 183 y Fs(25)41 b(Command)12 b(History)j(F)-7 b(unctions)62 324 y Fv(Octa)o(v)o(e)15 b(pro)o(vides)h(three)f (functions)h(for)f(viewing,)h(editing,)g(and)g(re-running)g(c)o(h)o (unks)g(of)f(commands)g(from)0 386 y(the)g(history)g(list.)62 470 y(The)f(function)g Fr(history)f Fv(displa)o(ys)h(a)g(list)g(of)f (commands)g(that)g(y)o(ou)g(ha)o(v)o(e)g(executed.)21 b(It)13 b(also)h(allo)o(ws)f(y)o(ou)h(to)0 533 y(write)e(the)g(curren)o (t)g(history)g(to)g(a)f(\014le)i(for)f(safe)g(k)o(eeping,)h(and)f(to)g (replace)h(the)f(history)g(list)h(with)f(the)g(commands)0 595 y(stored)j(in)h(a)f(named)g(\014le.)21 b(V)l(alid)c(argumen)o(ts)d (are:)0 693 y Fr(-w)h(file)81 b Fv(W)l(rite)19 b(the)f(curren)o(t)g (history)h(to)f(the)g(named)h(\014le.)31 b(If)18 b(the)h(name)f(is)h (omitted,)g(use)g(the)f(default)240 756 y(history)d(\014le)h (\(normally)g(`)p Fr(~/.octave_hist)p Fv('\).)0 846 y Fr(-r)f(file)81 b Fv(Read)15 b(the)f(named)g(\014le,)h(replacing)g(the) f(curren)o(t)g(history)g(list)h(with)f(its)g(con)o(ten)o(ts.)19 b(If)14 b(the)g(name)g(is)240 908 y(omitted,)h(use)g(the)h(default)f (history)h(\014le)g(\(normally)f(`)p Fr(~/.octave_hist)p Fv('\).)0 998 y Fr(N)216 b Fv(Only)16 b(displa)o(y)h(the)e(most)f (recen)o(t)i Fr(N)f Fv(lines)h(of)f(history)l(.)0 1088 y Fr(-q)192 b Fv(Don't)19 b(n)o(um)o(b)q(er)i(the)g(displa)o(y)o(ed)g (lines)h(of)e(history)l(.)36 b(This)21 b(is)g(useful)h(for)d(cutting)i (and)g(pasting)240 1151 y(commands)15 b(if)h(y)o(ou)f(are)f(using)i (the)g(X)f(Windo)o(w)g(System.)62 1249 y(F)l(or)f(example,)h(to)e (displa)o(y)j(the)e(\014v)o(e)g(most)g(recen)o(t)g(commands)g(that)g(y) o(ou)g(ha)o(v)o(e)f(t)o(yp)q(ed)i(without)f(displa)o(ying)0 1312 y(line)j(n)o(um)o(b)q(ers,)e(use)g(the)h(command)f(`)p Fr(history)f(-q)h(5)p Fv('.)62 1396 y(The)g(function)h Fr(edit_history)d Fv(allo)o(ws)i(y)o(ou)f(to)h(edit)g(a)f(blo)q(c)o(k)i (of)e(commands)h(from)f(the)h(history)g(list)g(using)0 1458 y(the)j(editor)g(named)g(b)o(y)g(the)g(en)o(vironmen)o(t)g(v)m (ariable)h Fr(EDITOR)p Fv(,)e(or)g(the)h(default)h(editor)f(\(normally) g Fr(vi)p Fv(\).)27 b(It)17 b(is)0 1521 y(often)h(more)h(con)o(v)o (enien)o(t)g(to)f(use)h Fr(edit_history)e Fv(to)h(de\014ne)i(functions) f(rather)f(than)h(attempting)f(to)g(en)o(ter)0 1583 y(them)h(directly)h (on)f(the)g(command)g(line.)33 b(By)19 b(default,)h(the)f(blo)q(c)o(k)h (of)f(commands)f(is)i(executed)g(as)f(so)q(on)f(as)0 1645 y(y)o(ou)d(exit)i(the)f(editor.)21 b(T)l(o)16 b(a)o(v)o(oid)f (executing)i(an)o(y)f(commands,)f(simply)i(delete)g(all)g(the)f(lines)h (from)e(the)h(bu\013er)0 1707 y(b)q(efore)f(exiting)i(the)e(editor.)62 1792 y(The)j Fr(edit_history)d Fv(command)i(tak)o(es)g(t)o(w)o(o)f (optional)i(argumen)o(ts)e(sp)q(ecifying)j(the)f(history)f(n)o(um)o(b)q (ers)g(of)0 1854 y(\014rst)e(and)g(last)g(commands)g(to)g(edit.)20 b(F)l(or)15 b(example,)h(the)f(command)120 1926 y Fr(edit_history)22 b(13)0 2011 y Fv(extracts)14 b(all)i(the)g(commands)f(from)f(the)i (13th)e(through)h(the)g(last)g(in)h(the)g(history)f(list.)20 b(The)c(command)120 2083 y Fr(edit_history)22 b(13)i(169)0 2167 y Fv(only)17 b(extracts)g(commands)f(13)h(through)f(169.)25 b(Sp)q(ecifying)19 b(a)d(larger)h(n)o(um)o(b)q(er)g(for)g(the)g (\014rst)f(command)h(than)0 2230 y(the)f(last)f(command)g(rev)o(erses)g (the)h(list)g(of)f(commands)h(b)q(efore)f(placing)i(them)f(in)g(the)f (bu\013er)h(to)f(b)q(e)h(edited.)22 b(If)0 2292 y(b)q(oth)15 b(argumen)o(ts)g(are)g(omitted,)f(the)i(previous)g(command)f(in)h(the)f (history)g(list)h(is)g(used.)62 2376 y(The)i(command)g Fr(run_history)f Fv(is)h(lik)o(e)h Fr(edit_history)p Fv(,)e(except)i(that)e(the)h(editor)g(is)h(not)e(in)o(v)o(ok)o(ed,)i (and)0 2439 y(the)c(commands)g(are)g(simply)i(executed)f(as)f(they)g (app)q(ear)g(in)h(the)g(history)f(list.)62 2523 y(The)h Fr(diary)e Fv(command)h(allo)o(ws)g(y)o(ou)g(to)f(create)h(a)g(list)h (of)e(all)i(commands)f Fp(and)i Fv(the)e(output)g(they)g(pro)q(duce,)0 2585 y(mixed)h(together)f(just)f(as)h(y)o(ou)g(see)h(them)f(on)g(y)o (our)g(terminal.)62 2670 y(F)l(or)g(example,)g(the)h(command)p eop %%Page: 150 152 150 151 bop 0 -58 a Fv(150)1743 b(Octa)o(v)o(e)120 183 y Fr(diary)23 b(on)0 266 y Fv(tells)14 b(Octa)o(v)o(e)e(to)f(start)h (recording)h(y)o(our)f(session)h(in)g(a)f(\014le)i(called)g(`)p Fr(diary)p Fv(')d(in)i(y)o(our)f(curren)o(t)h(w)o(orking)f(directory)l (.)0 329 y(T)l(o)j(giv)o(e)g(Octa)o(v)o(e)g(the)g(name)h(of)e(the)i (\014le)g(write)f(to,)f(use)i(the)f(a)g(command)g(lik)o(e)120 399 y Fr(diary)23 b(my-diary.txt)0 482 y Fv(Then)16 b(Octa)o(v)o(e)e (will)j(write)f(all)g(of)f(y)o(our)f(commands)h(to)g(the)g(\014le)h(`)p Fr(my-diary.txt)p Fv('.)62 565 y(T)l(o)f(stop)g(recording)h(y)o(our)e (session,)i(use)f(the)h(command)120 636 y Fr(diary)23 b(off)0 719 y Fv(Without)15 b(an)o(y)g(argumen)o(ts,)f Fr(diary)g Fv(toggles)h(the)g(curren)o(t)h(diary)f(state.)p eop %%Page: 151 153 151 152 bop 0 -58 a Fv(Chapter)15 b(26:)k(Help)1536 b(151)0 183 y Fs(26)41 b(Help)62 316 y Fv(Octa)o(v)o(e's)10 b Fr(help)f Fv(command)i(can)f(b)q(e)h(used)g(to)f(prin)o(t)g(brief)h (usage-st)o(yle)g(messages,)f(or)g(to)f(displa)o(y)j(information)0 378 y(directly)20 b(from)e(an)g(on-line)j(v)o(ersion)d(of)g(the)h(prin) o(ted)g(man)o(ual,)h(using)f(the)g(GNU)f(Info)h(bro)o(wser.)29 b(If)19 b(in)o(v)o(ok)o(ed)0 441 y(without)h(an)o(y)f(argumen)o(ts,)h Fr(help)f Fv(prin)o(ts)h(a)g(list)h(of)e(all)i(the)f(a)o(v)m(ailable)h (op)q(erators,)f(functions,)h(and)g(built-in)0 503 y(v)m(ariables.)i (If)16 b(the)g(\014rst)f(argumen)o(t)g(is)h Fr(-i)p Fv(,)g(the)g Fr(help)f Fv(command)g(searc)o(hes)h(the)g(index)h(of)e(the)h(on-line)i (v)o(ersion)0 565 y(of)d(this)g(man)o(ual)h(for)e(the)i(giv)o(en)f (topics.)62 648 y(F)l(or)g(example,)g(the)h(command)120 719 y Fr(help)23 b(help)0 802 y Fv(prin)o(ts)15 b(a)g(short)g(message)g (describing)i(the)e Fr(help)g Fv(command,)f(and)120 872 y Fr(help)23 b(-i)h(help)0 955 y Fv(starts)14 b(the)h(GNU)g(Info)h(bro) o(wser)e(at)h(this)g(no)q(de)h(in)g(the)f(on-line)i(v)o(ersion)f(of)f (the)g(man)o(ual.)62 1038 y(See)k(App)q(endix)h(D)e([Using)g(Info],)g (page)g(183,)g(for)f(complete)i(details)g(ab)q(out)f(ho)o(w)g(to)f(use) i(the)f(GNU)g(Info)0 1101 y(bro)o(wser)c(to)h(read)g(the)g(on-line)i(v) o(ersion)f(of)f(the)g(man)o(ual.)p eop %%Page: 152 154 152 153 bop 0 -58 a Fv(152)1743 b(Octa)o(v)o(e)p eop %%Page: 153 155 153 154 bop 0 -58 a Fv(Chapter)15 b(27:)k(Programming)14 b(Utilities)1185 b(153)0 183 y Fs(27)41 b(Programming)12 b(Utilities)0 486 y Fu(27.1)32 b(Ev)l(aluating)17 b(Strings)g(as)d (Comm)n(ands)62 605 y Fv(It)19 b(is)g(often)f(useful)i(to)e(ev)m (aluate)h(a)f(string)h(as)f(if)h(it)g(w)o(ere)f(an)h(Octa)o(v)o(e)f (program,)g(or)g(use)h(a)f(string)h(as)f(the)0 667 y(name)e(of)f(a)h (function)g(to)f(call.)23 b(These)16 b(functions)h(are)e(necessary)h (in)g(order)g(to)f(ev)m(aluate)i(commands)e(that)g(are)0 729 y(not)g(kno)o(wn)g(un)o(til)h(run)g(time,)f(or)f(to)h(write)g (functions)h(that)f(will)i(need)f(to)e(call)i(user-supplied)i (functions.)62 827 y(The)11 b(function)g Fr(eval)j(\()p Fp(command)r Fr(\))c Fv(parses)g Fp(command)i Fv(and)e(ev)m(aluates)h (it)g(as)e(if)i(it)g(w)o(ere)f(an)g(Octa)o(v)o(e)f(program,)0 890 y(returning)k(the)f(last)g(v)m(alue)h(computed.)19 b(The)12 b Fp(command)i Fv(is)f(ev)m(aluated)g(in)g(the)f(curren)o(t)g (con)o(text,)f(so)h(an)o(y)g(results)0 952 y(remain)k(a)o(v)m(ailable)h (after)d Fr(eval)h Fv(returns.)k(F)l(or)c(example,)120 1037 y Fr(octave:13>)22 b(a)120 1087 y(error:)h(`a')g(undefined)120 1137 y(octave:14>)f(eval)i(\("a)f(=)h(13"\))120 1187 y(a)g(=)f(13)120 1237 y(ans)g(=)h(13)120 1286 y(octave:15>)e(a)120 1336 y(a)i(=)f(13)62 1434 y Fv(In)16 b(this)g(case,)f(t)o(w)o(o)f(v)m (alues)j(are)e(prin)o(ted:)21 b(one)16 b(for)f(the)g(expression)h(that) f(w)o(as)g(ev)m(aluated,)h(and)g(one)f(for)g(the)0 1497 y(v)m(alue)i(returned)g(from)e Fr(eval)p Fv(.)22 b(Just)16 b(as)f(with)i(an)o(y)e(other)h(expression,)h(y)o(ou)f(can)g(turn)g (prin)o(ting)h(o\013)e(b)o(y)h(ending)0 1559 y(the)f(expression)h(in)g (a)f(semicolon.)21 b(F)l(or)15 b(example,)120 1644 y Fr(octave:13>)22 b(a)120 1694 y(error:)h(`a')g(undefined)120 1744 y(octave:14>)f(eval)i(\("a)f(=)h(13;"\))120 1794 y(ans)f(=)h(13)120 1844 y(octave:15>)e(a)120 1893 y(a)i(=)f(13)62 1991 y Fv(The)g(function)f Fr(feval)15 b(\()p Fp(name)p Fr(,)g(...\))21 b Fv(can)h(b)q(e)h(used)g(to)e(ev)m(aluate)i(the)f (function)h(named)f Fp(name)p Fv(.)41 b(An)o(y)0 2054 y(argumen)o(ts)14 b(after)h(the)g(\014rst)g(are)g(passed)g(on)g(to)g (the)g(named)h(function.)k(F)l(or)15 b(example,)120 2139 y Fr(octave:12>)22 b(feval)i(\("acos",)e(-1\))120 2189 y(ans)h(=)h(3.1416)0 2287 y Fv(calls)16 b(the)g(function)g Fr(acos)e Fv(with)i(the)f(argumen)o(t)f(`)p Fr(-1)p Fv('.)62 2385 y(The)k(function)h Fr(feval)e Fv(is)h(necessary)g(in)h(order)e(to) h(b)q(e)g(able)h(to)e(write)h(functions)g(that)f(call)i(user-supplied)0 2447 y(functions,)h(b)q(ecause)g(Octa)o(v)o(e)e(do)q(es)h(not)f(ha)o(v) o(e)h(a)f(w)o(a)o(y)g(to)g(declare)h(a)g(p)q(oin)o(ter)g(to)f(a)g (function)i(\(lik)o(e)f(C\))f(or)h(to)0 2510 y(declare)e(a)g(sp)q (ecial)h(kind)f(of)f(v)m(ariable)i(that)e(can)g(b)q(e)h(used)g(to)f (hold)i(the)e(name)g(of)g(a)h(function)g(\(lik)o(e)g Fr(EXTERNAL)0 2572 y Fv(in)f(F)l(ortran\).)i(Instead,)e(y)o(ou)f(m)o (ust)f(refer)h(to)g(functions)h(b)o(y)f(name,)g(and)g(use)h Fr(feval)e Fv(to)h(call)h(them.)62 2670 y(F)l(or)e(example,)h(here)f (is)h(a)f(simple-minded)j(function)e(for)f(\014nding)h(the)g(ro)q(ot)e (of)h(a)g(function)h(of)f(one)g(v)m(ariable:)p eop %%Page: 154 156 154 155 bop 0 -58 a Fv(154)1743 b(Octa)o(v)o(e)120 183 y Fr(function)23 b(result)g(=)h(newtroot)e(\(fname,)h(x\))120 308 y(#)h(usage:)f(newtroot)g(\(fname,)f(x\))120 370 y(#)120 432 y(#)71 b(fname)24 b(:)f(a)h(string)f(naming)g(a)h(function) f(f\(x\).)120 495 y(#)71 b(x)120 b(:)23 b(initial)g(guess)168 619 y(delta)g(=)h(tol)f(=)h(sqrt)f(\(eps\);)168 681 y(maxit)g(=)h(200;) 168 744 y(fx)f(=)h(feval)f(\(fname,)g(x\);)168 806 y(for)g(i)h(=)g (1:maxit)215 868 y(if)g(\(abs)f(\(fx\))h(<)f(tol\))263 930 y(result)g(=)h(x;)263 993 y(return;)215 1055 y(else)263 1117 y(fx_new)f(=)h(feval)f(\(fname,)g(x)h(+)f(delta\);)263 1180 y(deriv)g(=)h(\(fx_new)f(-)h(fx\))f(/)h(delta;)263 1242 y(x)g(=)g(x)f(-)h(fx)g(/)f(deriv;)263 1304 y(fx)h(=)f(fx_new;)215 1366 y(endif)168 1429 y(endfor)168 1553 y(result)g(=)g(x;)120 1678 y(endfunction)62 1756 y Fv(Note)14 b(that)g(this)g(is)h(only)f (mean)o(t)g(to)g(b)q(e)g(an)g(example)h(of)f(calling)i(user-supplied)h (functions)e(and)f(should)h(not)0 1819 y(b)q(e)g(tak)o(en)e(to)q(o)g (seriously)l(.)21 b(In)15 b(addition)g(to)e(using)i(a)e(more)h(robust)f (algorithm,)h(an)o(y)g(serious)g(co)q(de)g(w)o(ould)h(c)o(hec)o(k)0 1881 y(the)f(n)o(um)o(b)q(er)h(and)g(t)o(yp)q(e)f(of)g(all)h(the)g (argumen)o(ts,)e(ensure)i(that)e(the)i(supplied)i(function)e(really)g (w)o(as)e(a)h(function,)0 1943 y(etc.)0 2088 y Fu(27.2)32 b(Miscellaneous)15 b(Utilities)62 2195 y Fv(The)20 b(follo)o(wing)g (functions)h(allo)o(w)f(y)o(ou)f(to)g(determine)h(the)g(size)g(of)g(a)f (v)m(ariable)i(or)e(expression,)i(\014nd)f(out)0 2257 y(whether)15 b(a)g(v)m(ariable)i(exists,)e(prin)o(t)g(error)g (messages,)f(or)h(delete)h(v)m(ariable)h(names)e(from)f(the)i(sym)o(b)q (ol)f(table.)0 2359 y Fr(columns)f(\()p Fp(a)p Fr(\))240 2421 y Fv(Return)i(the)f(n)o(um)o(b)q(er)h(of)e(columns)i(of)f Fp(a)p Fv(.)0 2514 y Fr(rows)g(\()p Fp(a)p Fr(\))58 b Fv(Return)16 b(the)f(n)o(um)o(b)q(er)h(of)e(ro)o(ws)h(of)f Fp(a)p Fv(.)0 2608 y Fr(length)g(\()p Fp(a)p Fr(\))240 2670 y Fv(Return)i(the)f(n)o(um)o(b)q(er)h(of)e(ro)o(ws)h(of)f Fp(a)h Fv(or)g(the)g(n)o(um)o(b)q(er)h(of)e(columns)i(of)f Fp(a)p Fv(,)g(whic)o(hev)o(er)h(is)f(larger.)p eop %%Page: 155 157 155 156 bop 0 -58 a Fv(Chapter)15 b(27:)k(Programming)14 b(Utilities)1185 b(155)0 183 y Fr(size)15 b(\()p Fp(a)p Fr(\))58 b Fv(Return)17 b(the)f(n)o(um)o(b)q(er)g(ro)o(ws)f(and)h (columns)h(of)f Fp(a)p Fv(.)22 b(If)16 b(there)h(is)f(only)h(one)f (output)g(argumen)o(t,)f(the)240 246 y(result)j(is)h(returned)f(in)g(a) g(2)g(elemen)o(t)g(ro)o(w)f(v)o(ector.)27 b(If)18 b(there)g(are)g(t)o (w)o(o)e(output)i(argumen)o(ts,)f(the)240 308 y(n)o(um)o(b)q(er)e(of)g (ro)o(ws)f(is)h(assigned)h(to)e(the)h(\014rst,)f(and)h(the)g(n)o(um)o (b)q(er)h(of)e(columns)i(to)e(the)h(second.)21 b(F)l(or)240 370 y(example,)360 445 y Fr(octave:13>)h(size)i(\([1,)f(2;)h(3,)f(4;)h (5,)f(6]\))360 507 y(ans)g(=)408 632 y(3)47 b(2)360 756 y(octave:14>)22 b([nr,)i(nc])f(=)h(size)f(\([1,)h(2;)f(3,)h(4;)f(5,)h (6]\))360 818 y(nr)g(=)f(3)360 943 y(nc)h(=)f(2)0 1031 y(is_global)14 b(\()p Fp(a)p Fr(\))240 1093 y Fv(Return)i(1)f(if)g Fp(a)g Fv(is)h(globally)g(visible.)22 b(Otherwise,)16 b(return)f(0.)0 1189 y Fr(is_matrix)f(\()p Fp(a)p Fr(\))240 1251 y Fv(Return)i(1)f(if)g Fp(a)g Fv(is)h(a)f(matrix.)k(Otherwise,)d (return)f(0.)0 1346 y Fr(is_vector)f(\()p Fp(a)p Fr(\))240 1409 y Fv(Return)i(1)f(if)g Fp(a)g Fv(is)h(a)f(v)o(ector.)k(Otherwise,) d(return)f(0.)0 1504 y Fr(is_scalar)f(\()p Fp(a)p Fr(\))240 1566 y Fv(Return)i(1)f(if)g Fp(a)g Fv(is)h(a)f(scalar.)20 b(Otherwise,)15 b(return)g(0.)0 1662 y Fr(is_square)f(\()p Fp(x)s Fr(\))240 1724 y Fv(If)h Fp(x)k Fv(is)c(a)g(square)g(matrix,)g (then)g(return)h(the)f(dimension)i(of)d Fp(x)p Fv(.)20 b(Otherwise,)c(return)f(0.)0 1819 y Fr(is_symmetric)f(\()p Fp(x)p Fr(,)g Fp(tol)r Fr(\))240 1882 y Fv(If)h Fp(x)i Fv(is)e(symmetric)g(within)h(the)e(tolerance)h(sp)q(eci\014ed)i(b)o(y)d Fp(tol)p Fv(,)g(then)h(return)g(the)f(dimension)i(of)e Fp(x)p Fv(.)240 1944 y(Otherwise,)i(return)f(0.)k(If)d Fp(tol)h Fv(is)e(omitted,)g(use)h(a)f(tolerance)g(equal)h(to)f(the)g (mac)o(hine)h(precision.)0 2039 y Fr(isstr)e(\()p Fp(a)p Fr(\))35 b Fv(Return)16 b(1)f(if)g Fp(a)g Fv(is)h(a)f(string.)20 b(Otherwise,)15 b(return)g(0.)0 2135 y Fr(isempty)f(\()p Fp(a)p Fr(\))240 2197 y Fv(Return)f(1)f(if)i Fp(a)e Fv(is)h(an)g(empt)o (y)f(matrix)g(\(either)h(the)g(n)o(um)o(b)q(er)g(of)f(ro)o(ws,)g(or)g (the)g(n)o(um)o(b)q(er)h(of)g(columns,)240 2259 y(or)i(b)q(oth)g(are)g (zero\).)k(Otherwise,)d(return)f(0.)0 2355 y Fr(clear)f Fp(pattern)h Fr(...)240 2417 y Fv(Delete)e(the)g(names)f(matc)o(hing)g (the)h(giv)o(en)g(patterns)f(from)f(the)i(sym)o(b)q(ol)g(table.)19 b(The)13 b(pattern)f(ma)o(y)240 2479 y(con)o(tain)j(the)h(follo)o(wing) g(sp)q(ecial)h(c)o(haracters:)240 2575 y Fr(?)216 b Fv(Matc)o(h)14 b(an)o(y)h(single)i(c)o(haracter.)240 2670 y Fr(*)216 b Fv(Matc)o(h)14 b(zero)i(or)e(more)h(c)o(haracters.)p eop %%Page: 156 158 156 157 bop 0 -58 a Fv(156)1743 b(Octa)o(v)o(e)240 183 y Fr([)15 b Fp(list)i Fr(])100 b Fv(Matc)o(h)13 b(the)g(list)h(of)f(c)o (haracters)f(sp)q(eci\014ed)k(b)o(y)d Fp(list)p Fv(.)20 b(If)14 b(the)f(\014rst)g(c)o(haracter)g(is)h Fr(!)f Fv(or)g Fr(^)p Fv(,)480 246 y(matc)o(h)d(all)i(c)o(haracters)e(except)h (those)f(sp)q(eci\014ed)j(b)o(y)d Fp(list)p Fv(.)20 b(F)l(or)10 b(example,)i(the)e(pattern)480 308 y(`)p Fr([a-zA-Z])p Fv(')j(will)k(matc)o(h)e(all)h(lo)o(w)o(er)f(and)g(upp)q(er)h(case)g (alphab)q(etic)g(c)o(haracters.)240 392 y(F)l(or)f(example,)g(the)h (command)360 453 y Fr(clear)23 b(foo)h(b*r)240 527 y Fv(clears)15 b(the)f(name)g Fr(foo)f Fv(and)i(all)g(names)f(that)f(b)q (egin)i(with)g(the)f(letter)g Fr(b)g Fv(and)g(end)h(with)g(the)f (letter)240 589 y Fr(r)p Fv(.)240 663 y(If)i Fr(clear)g Fv(is)h(called)g(without)g(an)o(y)e(argumen)o(ts,)h(all)h (user-de\014ned)h(v)m(ariables)f(\(lo)q(cal)g(and)g(global\))240 725 y(are)k(cleared)i(from)e(the)h(sym)o(b)q(ol)g(table.)39 b(If)22 b Fr(clear)f Fv(is)h(called)i(with)e(at)f(least)g(one)h (argumen)o(t,)240 787 y(only)15 b(the)g(visible)i(names)d(matc)o(hing)h (the)f(argumen)o(ts)g(are)g(cleared.)21 b(F)l(or)14 b(example,)h(supp)q (ose)g(y)o(ou)240 849 y(ha)o(v)o(e)e(de\014ned)i(a)e(function)h Fr(foo)p Fv(,)f(and)g(then)h(hidden)h(it)f(b)o(y)f(p)q(erforming)h(the) f(assignmen)o(t)h Fr(foo)g(=)i(2)p Fv(.)240 912 y(Executing)f(the)g (command)f(`)p Fr(clear)g(foo)p Fv(')g(once)h(will)h(clear)f(the)g(v)m (ariable)h(de\014nition)g(and)f(restore)240 974 y(the)g(de\014nition)i (of)d Fr(foo)g Fv(as)h(a)f(function.)21 b(Executing)16 b(`)p Fr(clear)e(foo)p Fv(')g(a)g(second)i(time)f(will)h(clear)g(the) 240 1036 y(function)g(de\014nition.)240 1110 y(This)g(command)f(ma)o(y) f(not)h(b)q(e)h(used)g(within)g(a)f(function)h(b)q(o)q(dy)l(.)0 1194 y Fr(who)f Fp(options)i(pattern)e Fr(...)240 1257 y Fv(List)k(curren)o(tly)g(de\014ned)h(sym)o(b)q(ols)f(matc)o(hing)g (the)g(giv)o(en)g(patterns.)30 b(The)19 b(follo)o(wing)g(are)f(v)m (alid)240 1319 y(options.)i(They)15 b(ma)o(y)g(b)q(e)h(shortened)f(to)g (one)g(c)o(haracter)g(but)g(ma)o(y)f(not)h(b)q(e)h(com)o(bined.)240 1404 y Fr(-all)144 b Fv(List)16 b(all)g(curren)o(tly)g(de\014ned)g(sym) o(b)q(ols.)240 1488 y Fr(-builtins)480 1551 y Fv(List)24 b(built-in)i(v)m(ariables)g(and)d(functions.)47 b(This)24 b(includes)i(all)f(curren)o(tly)f(com-)480 1613 y(piled)19 b(function)g(\014les,)g(but)e(do)q(es)h(not)f(include)j(all)f(function) f(\014les)g(that)f(are)g(in)i(the)480 1675 y Fr(LOADPATH)p Fv(.)240 1760 y Fr(-functions)480 1822 y Fv(List)d(user-de\014ned)h (functions.)240 1907 y Fr(-long)120 b Fv(Prin)o(t)13 b(a)f(long)h(listing)i(including)g(the)e(t)o(yp)q(e)g(and)g(dimensions) h(of)f(an)o(y)f(sym)o(b)q(ols.)20 b(The)480 1969 y(sym)o(b)q(ols)h(in)g (the)g(\014rst)f(column)h(of)f(output)g(indicate)i(whether)f(it)f(is)h (p)q(ossible)i(to)480 2031 y(rede\014ne)16 b(the)g(sym)o(b)q(ol,)f(and) g(whether)h(it)f(is)h(p)q(ossible)h(for)d(it)i(to)e(b)q(e)i(cleared.) 240 2116 y Fr(-variables)480 2178 y Fv(List)g(user-de\014ned)h(v)m (ariables.)240 2263 y(V)l(alid)e(patterns)e(are)g(the)h(same)f(as)g (describ)q(ed)j(for)d(the)g Fr(clear)g Fv(command)g(ab)q(o)o(v)o(e.)19 b(If)14 b(no)f(patterns)240 2325 y(are)20 b(supplied,)k(all)e(sym)o(b)q (ols)f(from)f(the)h(giv)o(en)g(category)f(are)g(listed.)38 b(By)20 b(default,)j(only)e(user)240 2387 y(de\014ned)c(functions)f (and)f(v)m(ariables)h(visible)i(in)e(the)f(lo)q(cal)h(scop)q(e)g(are)f (displa)o(y)o(ed.)240 2461 y(The)g(command)h Fr(whos)e Fv(is)i(equiv)m(alen)o(t)h(to)d Fr(who)h(-long)p Fv(.)0 2545 y Fr(exist)f(\()p Fp(name)s Fr(\))240 2608 y Fv(Return)h(1)f(if)h (the)f(name)h(exists)g(as)f(a)g(v)m(ariable,)h(and)g(2)f(if)h(the)f (name)h(\(after)e(app)q(ending)j(`)p Fr(.m)p Fv('\))d(is)i(a)240 2670 y(function)h(\014le)g(in)g(the)g(path.)j(Otherwise,)d(return)f(0.) p eop %%Page: 157 159 157 158 bop 0 -58 a Fv(Chapter)15 b(27:)k(Programming)14 b(Utilities)1185 b(157)0 183 y Fr(error)14 b(\()p Fp(msg)t Fr(\))240 246 y Fv(Prin)o(t)22 b(the)g(message)f Fp(msg)p Fv(,)h(pre\014xed)h(b)o(y)f(the)g(string)f(`)p Fr(error:)14 b Fv(',)23 b(and)f(set)f(Octa)o(v)o(e's)g(in)o(ternal)240 308 y(error)16 b(state)f(suc)o(h)i(that)f(con)o(trol)g(will)i(return)f (to)f(the)g(top)g(lev)o(el)i(without)f(ev)m(aluating)g(an)o(y)f(more) 240 370 y(commands.)k(This)15 b(is)h(useful)g(for)f(ab)q(orting)g(from) g(functions.)240 444 y(If)g Fp(msg)j Fv(do)q(es)e(not)e(end)i(with)f(a) f(new)h(line)i(c)o(haracter,)d(Octa)o(v)o(e)g(will)j(prin)o(t)e(a)f (tracebac)o(k)h(of)f(all)i(the)240 506 y(function)g(calls)g(leading)h (to)d(the)i(error.)j(F)l(or)14 b(example,)360 567 y Fr(function)23 b(f)g(\(\))h(g)g(\(\))f(end)360 617 y(function)g(g)g(\(\))h(h)g(\(\))f (end)360 667 y(function)g(h)g(\(\))h(nargin)f(==)h(1)f(||)h(error)f (\("nargin)g(!=)h(1"\);)f(end)360 716 y(f)h(\(\))360 766 y(error:)f(nargin)g(!=)h(1)360 816 y(error:)f(evaluating)g(index)g (expression)f(near)i(line)f(1,)g(column)g(30)360 866 y(error:)g(evaluating)g(binary)g(operator)f(`||')i(near)f(line)g(1,)h (column)f(27)360 916 y(error:)g(called)g(from)g(`h')360 965 y(error:)g(called)g(from)g(`g')360 1015 y(error:)g(called)g(from)g (`f')240 1089 y Fv(pro)q(duces)c(a)f(list)g(of)g(messages)f(that)h(can) g(help)h(y)o(ou)f(to)f(quic)o(kly)i(lo)q(cate)g(the)f(exact)g(lo)q (cation)g(of)240 1151 y(the)d(error.)240 1225 y(If)j Fp(msg)j Fv(ends)d(in)h(a)e(new)h(line)h(c)o(haracter,)e(Octa)o(v)o(e)g (will)j(only)e(prin)o(t)g Fp(msg)j Fv(and)c(will)j(not)d(displa)o(y)240 1287 y(an)o(y)e(tracebac)o(k)h(messages)f(as)g(it)i(returns)e(con)o (trol)h(to)f(the)h(top)f(lev)o(el.)23 b(F)l(or)15 b(example,)i(mo)q (difying)240 1349 y(the)f(error)f(message)h(in)g(the)g(previous)h (example)g(to)e(end)i(in)f(a)g(new)g(line)i(causes)e(Octa)o(v)o(e)f(to) g(only)240 1411 y(prin)o(t)h(a)e(single)j(message:)360 1473 y Fr(function)23 b(h)g(\(\))h(nargin)f(==)h(1)f(||)h(error)f (\("nargin)g(!=)h(1\\n"\);)f(end)360 1522 y(f)h(\(\))360 1572 y(error:)f(nargin)g(!=)h(1)0 1657 y(warning)14 b(\()p Fp(msg)t Fr(\))240 1719 y Fv(Prin)o(t)h(the)g(message)g Fp(msg)k Fv(pre\014xed)d(b)o(y)f(the)g(string)g(`)p Fr(warning:)f Fv('.)0 1804 y Fr(usage)g(\()p Fp(msg)t Fr(\))240 1866 y Fv(Prin)o(t)22 b(the)g(message)f Fp(msg)p Fv(,)h(pre\014xed)h(b)o(y)f (the)g(string)f(`)p Fr(usage:)14 b Fv(',)23 b(and)f(set)f(Octa)o(v)o (e's)g(in)o(ternal)240 1929 y(error)16 b(state)f(suc)o(h)i(that)f(con)o (trol)g(will)i(return)f(to)f(the)g(top)g(lev)o(el)i(without)f(ev)m (aluating)g(an)o(y)f(more)240 1991 y(commands.)k(This)15 b(is)h(useful)g(for)f(ab)q(orting)g(from)g(functions.)240 2064 y(After)f Fr(usage)f Fv(is)i(ev)m(aluated,)g(Octa)o(v)o(e)f(will)i (prin)o(t)f(a)f(tracebac)o(k)g(of)f(all)j(the)e(function)h(calls)h (leading)240 2127 y(to)f(the)g(usage)g(message.)0 2212 y Fr(perror)f(\()p Fp(name)p Fr(,)h Fp(n)o(um)p Fr(\))240 2274 y Fv(Prin)o(t)20 b(the)f(error)g(message)g(for)g(function)i Fp(name)h Fv(corresp)q(onding)f(to)e(the)g(error)g(n)o(um)o(b)q(er)h Fp(n)o(um)p Fv(.)240 2336 y(This)c(function)g(is)g(in)o(tended)h(to)e (b)q(e)h(used)g(to)f(prin)o(t)h(useful)g(error)f(messages)g(for)g (those)g(functions)240 2398 y(that)f(return)i(n)o(umeric)g(error)e(co)q (des.)0 2483 y Fr(menu)h(\()p Fp(title)p Fr(,)g Fp(opt1)p Fr(,)g(.)8 b(.)g(.\))240 2545 y Fv(Prin)o(t)17 b(a)g(title)h(string)g (follo)o(w)o(ed)f(b)o(y)g(a)g(series)h(of)f(options.)26 b(Eac)o(h)17 b(option)h(will)h(b)q(e)f(prin)o(ted)g(along)240 2608 y(with)13 b(a)f(n)o(um)o(b)q(er.)19 b(The)13 b(return)g(v)m(alue)g (is)g(the)g(n)o(um)o(b)q(er)g(of)f(the)h(option)f(selected)i(b)o(y)f (the)f(user.)19 b(This)240 2670 y(function)d(is)g(useful)g(for)f(in)o (teractiv)o(e)h(programs.)i(There)e(is)g(no)f(limit)h(to)f(the)g(n)o (um)o(b)q(er)h(of)f(options)p eop %%Page: 158 160 158 159 bop 0 -58 a Fv(158)1743 b(Octa)o(v)o(e)240 183 y(that)14 b(ma)o(y)h(b)q(e)h(passed)f(in,)h(but)f(it)h(ma)o(y)e(b)q(e)i (confusing)g(to)f(presen)o(t)g(more)g(than)g(will)i(\014t)e(easily)h (on)240 246 y(one)f(screen.)0 333 y Fr(document)f Fp(sym)o(b)q(ol)j (text)240 395 y Fv(Set)e(the)h(do)q(cumen)o(tation)f(string)g(for)g Fp(sym)o(b)q(ol)i Fv(to)e Fp(text)p Fv(.)0 482 y Fr(file_in_path)f(\()p Fp(path)p Fr(,)g Fp(\014le)s Fr(\))240 544 y Fv(Return)k(the)f (absolute)h(name)f(name)g(of)g Fp(\014le)j Fv(if)e(it)f(can)h(b)q(e)f (found)h(in)g Fp(path)p Fv(.)26 b(The)17 b(v)m(alue)h(of)f Fp(path)240 607 y Fv(should)h(b)q(e)f(a)g(colon-separated)g(list)g(of)f (directories)i(in)g(the)f(format)e(describ)q(ed)k(for)d(the)h(built-in) 240 669 y(v)m(ariable)g Fr(LOADPATH)p Fv(.)240 744 y(If)e(the)h(\014le) g(cannot)f(b)q(e)h(found)f(in)h(the)g(path,)e(an)h(empt)o(y)g(matrix)g (is)h(returned.)k(F)l(or)15 b(example,)360 806 y Fr(octave:13>)22 b(file_in_path)h(\(LOADPATH,)f("nargchk.m"\))360 856 y(ans)h(=)h(/usr/local/lib/octave/1.1.0)o(/m/gener)o(al/narg)o(chk.m)0 943 y(nargchk)14 b(\()p Fp(nargin_min)p Fr(,)i Fp(nargin_max)p Fr(,)e Fp(n)p Fr(\))240 1005 y Fv(If)f Fp(n)h Fv(is)f(in)h(the)f(range) g Fp(nargin)p 743 1005 14 2 v 17 w(min)h Fv(through)f Fp(nargin)p 1145 1005 V 16 w(max)j Fv(inclusiv)o(e,)g(return)d(the)g (empt)o(y)g(matrix.)240 1067 y(Otherwise,)j(return)f(a)g(message)f (indicating)k(whether)d Fp(n)g Fv(is)h(to)q(o)f(large)g(or)f(to)q(o)h (small.)240 1142 y(This)h(is)f(useful)h(for)f(c)o(hec)o(king)h(to)e (see)h(that)g(the)g(n)o(um)o(b)q(er)g(of)g(argumen)o(ts)f(supplied)j (to)d(a)h(function)240 1204 y(is)h(within)g(an)f(acceptable)h(range.)0 1292 y Fr(octave_tmp_file_name)240 1354 y Fv(Return)g(a)f(unique)h (temp)q(orary)f(\014le)h(name.)240 1429 y(Since)i(the)e(named)g(\014le) i(is)e(not)g(op)q(ened,)h(b)o(y)f Fr(octave_tmp_file_name)p Fv(,)d(it)k(is)g(p)q(ossible)g(\(though)240 1491 y(relativ)o(ely)f (unlik)o(ely\))i(that)c(it)i(will)h(not)d(b)q(e)i(a)o(v)m(ailable)h(b)o (y)f(the)f(time)g(y)o(our)g(program)f(attempts)h(to)240 1553 y(op)q(en)h(it.)0 1640 y Fr(type)f Fp(name)i Fr(...)240 1703 y Fv(Displa)o(y)f(the)f(de\014nition)i(of)e(eac)o(h)g Fp(name)j Fv(that)c(refers)h(to)g(a)g(function.)240 1777 y(Curren)o(tly)l(,)h(Octa)o(v)o(e)g(can)g(only)h(displa)o(y)g (functions)g(that)f(can)g(b)q(e)h(compiled)h(cleanly)l(,)g(b)q(ecause)f (it)240 1840 y(uses)e(its)h(in)o(ternal)g(represen)o(tation)f(of)g(the) g(function)h(to)f(recreate)g(the)g(program)f(text.)240 1914 y(Commen)o(ts)j(are)g(not)g(displa)o(y)o(ed)i(b)q(ecause)g(Octa)o (v)o(e's)e(curren)o(tly)h(discards)g(them)g(as)f(it)h(con)o(v)o(erts) 240 1977 y(the)e(text)f(of)g(a)g(function)h(\014le)h(to)e(its)g(in)o (ternal)i(represen)o(tation.)k(This)16 b(problem)g(ma)o(y)f(b)q(e)h (\014xed)g(in)240 2039 y(a)f(future)g(release.)0 2126 y Fr(which)f Fp(name)k Fr(...)240 2188 y Fv(Displa)o(y)f(the)g(t)o(yp)q (e)g(of)f(eac)o(h)h Fp(name)p Fv(.)25 b(If)17 b Fp(name)i Fv(is)e(de\014ned)h(from)e(a)h(function)g(\014le,)h(the)f(full)h(name) 240 2250 y(of)d(the)g(\014le)h(is)g(also)f(displa)o(y)o(ed.)p eop %%Page: 159 161 159 160 bop 0 -58 a Fv(Chapter)15 b(28:)k(Am)o(usemen)o(ts)1375 b(159)0 183 y Fs(28)41 b(Am)n(usem)o(en)m(ts)62 316 y Fv(Octa)o(v)o(e)17 b(cannot)h(promise)g(that)f(y)o(ou)g(will)i (actually)f(win)g(the)g(lotto,)f(but)h(it)g(can)f(pic)o(k)i(y)o(our)e (n)o(um)o(b)q(ers)h(for)0 378 y(y)o(ou.)i(The)15 b(function)h Fr(texas_lotto)e Fv(will)j(select)e(six)h(n)o(um)o(b)q(ers)g(b)q(et)o (w)o(een)f(1)g(and)g(50.)62 461 y(The)h(function)g Fr(list_primes)d(\() p Fp(n)p Fr(\))j Fv(uses)f(a)g(brute-force)g(algorithm)g(to)g(compute)g (the)h(\014rst)e Fp(n)i Fv(primes.)62 544 y(Other)g(am)o(using)f (functions)h(include)i Fr(casesen)p Fv(,)13 b Fr(flops)p Fv(,)h Fr(sombrero)p Fv(,)g Fr(exit)p Fv(,)g(and)i Fr(quit)p Fv(.)p eop %%Page: 160 162 160 161 bop 0 -58 a Fv(160)1743 b(Octa)o(v)o(e)p eop %%Page: 161 163 161 162 bop 0 -58 a Fv(App)q(endix)17 b(A:)e(Installing)i(Octa)o(v)o(e) 1273 b(161)0 183 y Fs(App)r(endix)13 b(A)41 b(Installing)14 b(Octa)n(v)n(e)62 313 y Fv(Here)i(is)g(the)f(pro)q(cedure)i(for)e (installing)i(Octa)o(v)o(e)e(from)g(scratc)o(h)g(on)g(a)g(Unix)i (system.)j(F)l(or)15 b(instructions)h(on)0 375 y(ho)o(w)e(to)g(install) i(the)f(binary)g(distributions)h(of)e(Octa)o(v)o(e,)g(see)h(Section)h (A.2)e([Binary)h(Distributions],)g(page)f(165.)37 458 y Ft(\017)30 b Fv(Run)14 b(the)g(shell)h(script)f(`)p Fr(configure)p Fv('.)j(This)d(will)h(determine)g(the)e(features)g(y)o (our)g(system)g(has)g(\(or)g(do)q(esn't)90 520 y(ha)o(v)o(e\))h(and)i (create)f(a)g(\014le)h(named)f(Mak)o(e\014le)h(from)e(eac)o(h)i(of)e (the)i(\014les)g(named)f(Mak)o(e\014le.in.)90 594 y(Here)c(is)h(a)e (summary)h(of)f(the)h(con\014gure)h(options)f(that)f(are)h(most)f (frequen)o(tly)h(used)h(when)f(building)j(Octa)o(v)o(e:)90 679 y Fr(--prefix=)p Fp(pre\014x)330 742 y Fv(Install)27 b(Octa)o(v)o(e)e(in)h(sub)q(directories)h(b)q(elo)o(w)f Fp(pre\014x)p Fv(.)51 b(The)26 b(default)g(v)m(alue)g(of)f Fp(pre\014x)k Fv(is)330 804 y(`)p Fr(/usr/local)p Fv('.)90 889 y Fr(--srcdir=)p Fp(dir)330 951 y Fv(Lo)q(ok)15 b(for)g(Octa)o(v)o (e)g(sources)g(in)h(the)f(directory)h Fp(dir)p Fv(.)90 1037 y Fr(--with-f2c)330 1099 y Fv(Use)f(f2c)g(ev)o(en)h(if)g(F)l (ortran)e(compiler)i(is)g(a)o(v)m(ailable.)90 1185 y Fr(--enable-dld)330 1247 y Fv(Use)c(DLD)g(to)g(mak)o(e)g(Octa)o(v)o(e)g (capable)h(of)f(dynamically)i(linking)g(externally)f(compiled)h(func-) 330 1309 y(tions.)20 b(This)c(only)g(w)o(orks)e(on)h(systems)g(that)f (ha)o(v)o(e)h(a)g(w)o(orking)g(p)q(ort)f(of)h(DLD.)90 1394 y Fr(--enable-lite-kernel)330 1457 y Fv(Compile)22 b(smaller)g(k)o(ernel.)38 b(This)22 b(curren)o(tly)f(requires)h(DLD)f (so)g(that)f(Octa)o(v)o(e)g(can)i(load)330 1519 y(functions)16 b(at)f(run)g(time)h(that)e(are)h(not)g(loaded)h(at)e(compile)j(time.)90 1604 y Fr(--help)96 b Fv(Prin)o(t)15 b(a)g(summary)g(of)f(the)i (options)f(recognized)h(b)o(y)g(the)f(con\014gure)g(script.)90 1690 y(See)e(the)g(\014le)h(INST)l(ALL)h(for)d(more)h(information)g(ab) q(out)f(the)h(command)g(line)i(options)e(used)g(b)o(y)g(con\014gure.)90 1752 y(That)h(\014le)i(also)e(con)o(tains)h(instructions)g(for)f (compiling)i(in)g(a)e(directory)h(other)f(than)g(where)h(the)g(source)f (is)90 1814 y(lo)q(cated.)37 1888 y Ft(\017)30 b Fv(Run)16 b(mak)o(e.)90 1962 y(Y)l(ou)d(will)i(need)e(a)g(recen)o(t)g(v)o(ersion) g(of)g(GNU)f(mak)o(e.)19 b(Mo)q(difying)14 b(Octa)o(v)o(e's)e(Mak)o (e\014les)h(to)f(w)o(ork)g(with)h(other)90 2024 y(mak)o(e)j(programs)g (is)i(probably)f(not)g(w)o(orth)f(y)o(our)g(time.)25 b(W)l(e)17 b(recommend)h(y)o(ou)e(get)h(and)g(compile)h(GNU)90 2086 y(mak)o(e)d(instead.)90 2160 y(F)l(or)g(plotting,)g(y)o(ou)h(will) h(need)f(to)f(ha)o(v)o(e)g(gn)o(uplot)g(installed)j(on)d(y)o(our)g (system.)20 b(Gn)o(uplot)c(is)g(a)f(command-)90 2223 y(driv)o(en)g(in)o(teractiv)o(e)g(function)g(plotting)g(program.)j(Gn)o (uplot)d(is)g(cop)o(yrigh)o(ted,)f(but)g(freely)h(distributable.)90 2285 y(The)g(`gn)o(u')f(in)i(gn)o(uplot)f(is)g(a)f(coincidence|)q(it)k (is)d(not)f(related)i(to)e(the)h(GNU)f(pro)s(ject)g(or)g(the)h(FSF)g (in)g(an)o(y)90 2347 y(but)g(the)h(most)e(p)q(eripheral)j(sense.)90 2421 y(F)l(or)c(v)o(ersion)h(1.1.0,)e(y)o(ou)h(m)o(ust)h(ha)o(v)o(e)f (the)h(GNU)f(C)p Fr(++)g Fv(compiler)i(\(gcc\))e(v)o(ersion)h(2.6.3)f (or)g(later)g(to)g(compile)90 2483 y(Octa)o(v)o(e.)19 b(Y)l(ou)c(will)h(also)f(need)g(v)o(ersion)g(2.6.1)d(of)j(the)f(GNU)g (C)p Fr(++)g Fv(class)h(library)h(\(libg)p Fr(++)p Fv(\).)j(If)c(y)o (ou)f(plan)i(to)90 2545 y(mo)q(dify)i(the)f(parser)f(y)o(ou)h(will)i (also)d(need)i(GNU)f(bison)h(and)f(\015es.)25 b(If)18 b(y)o(ou)e(mo)q(dify)i(the)f(do)q(cumen)o(tation,)90 2608 y(y)o(ou)c(will)i(need)g(GNU)e(T)l(exinfo,)h(along)g(with)f(the)h (patc)o(h)f(for)g(the)h(mak)o(einfo)f(program)g(that)f(is)i (distributed)90 2670 y(with)i(Octa)o(v)o(e.)p eop %%Page: 162 164 162 163 bop 0 -58 a Fv(162)1743 b(Octa)o(v)o(e)90 183 y(GNU)10 b(mak)o(e,)h(gcc,)g(and)f(libg)p Fr(++)p Fv(,)i(gn)o(uplot,)f (bison,)h(\015ex,)f(and)f(T)l(exinfo)h(are)f(all)i(a)o(v)m(ailable)g (from)d(man)o(y)h(anon)o(y-)90 246 y(mous)g(ftp)g(arc)o(hiv)o(es,)h (including)i(ftp.c)o(he.utexas.edu,)d(ftp.uu.net,)g(prep.ai.mit.edu,)i (and)e(wuarc)o(hiv)o(e.wustl.edu.)p 2066 254 21 41 v 90 322 a(If)16 b(y)o(ou)g(don't)f(ha)o(v)o(e)h(a)g(F)l(ortran)e (compiler,)j(or)f(if)g(y)o(our)g(F)l(ortran)f(compiler)i(do)q(esn't)f (w)o(ork)f(lik)o(e)i(the)f(tradi-)90 384 y(tional)h(Unix)h(f77,)e(y)o (ou)g(will)j(need)f(to)e(ha)o(v)o(e)g(the)h(F)l(ortran)e(to)h(C)h (translator)f(f2c.)24 b(Y)l(ou)17 b(can)g(get)f(f2c)h(from)90 446 y(an)o(y)c(n)o(um)o(b)q(er)g(of)f(anon)o(ymous)h(ftp)f(arc)o(hiv)o (es.)20 b(The)13 b(most)f(recen)o(t)h(v)o(ersion)g(of)g(f2c)f(is)i(alw) o(a)o(ys)e(a)o(v)m(ailable)j(from)90 508 y(researc)o(h.att.com.)90 585 y(On)i(an)e(otherwise)i(idle)g(SP)l(AR)o(Cstation)f(I)q(I,)h(it)f (will)i(tak)o(e)d(somewhere)h(b)q(et)o(w)o(een)g(60)g(and)g(90)f(min)o (utes)i(to)90 647 y(compile)g(ev)o(erything,)e(dep)q(ending)i(on)e (whether)g(y)o(ou)g(are)g(compiling)i(the)e(F)l(ortran)f(libraries)i (with)g(f2c)e(or)90 709 y(using)h(the)e(F)l(ortran)g(compiler)i (directly)l(.)21 b(Y)l(ou)14 b(will)i(need)e(ab)q(out)g(50)f(megab)o (ytes)g(of)h(disk)g(storage)f(to)g(w)o(ork)90 771 y(with)20 b(\(considerably)g(less)g(if)g(y)o(ou)f(don't)g(compile)i(with)f (debugging)g(sym)o(b)q(ols\).)32 b(T)l(o)19 b(do)h(that,)f(use)h(the)90 834 y(command)210 897 y Fr(make)j(CFLAGS=-O)g(CXXFLAGS=-O)f(LDFLAGS=)90 974 y Fv(instead)16 b(of)f(just)f(`)p Fr(make)p Fv('.)37 1050 y Ft(\017)30 b Fv(If)17 b(y)o(ou)g(encoun)o(ter)g(errors)f(while)j (compiling)f(Octa)o(v)o(e,)f(\014rst)g(c)o(hec)o(k)g(the)g(list)h(of)e (kno)o(wn)h(problems)g(b)q(elo)o(w)90 1112 y(to)d(see)g(if)h(there)g (is)g(a)f(w)o(ork)m(around)g(or)g(solution)h(for)f(y)o(our)g(problem.) 20 b(If)15 b(not,)e(see)i(App)q(endix)i(B)d([T)l(rouble],)90 1174 y(page)h(167,)f(for)h(information)g(ab)q(out)g(ho)o(w)g(to)f(rep)q (ort)h(bugs.)37 1251 y Ft(\017)30 b Fv(Once)16 b(y)o(ou)f(ha)o(v)o(e)g (successfully)i(compiled)g(Octa)o(v)o(e,)d(run)i(`)p Fr(make)e(install)p Fv('.)90 1327 y(This)h(will)i(install)f(a)e(cop)o (y)h(of)f(o)q(cta)o(v)o(e,)g(its)h(libraries,)h(and)f(its)g(do)q(cumen) o(tation)g(in)g(the)g(destination)h(direc-)90 1389 y(tory)l(.)j(As)c (distributed,)i(Octa)o(v)o(e)e(is)g(installed)i(in)f(the)g(follo)o (wing)g(directories:)90 1479 y(`)p Fp(pre\014x)s Fr(/bin)p Fv(')330 1541 y(Octa)o(v)o(e)f(and)g(other)g(binaries)i(that)d(p)q (eople)j(will)g(w)o(an)o(t)d(to)g(run)i(directly)l(.)90 1631 y(`)p Fp(pre\014x)s Fr(/lib)p Fv(')330 1694 y(Libraries)h(lik)o(e) f(lib)q(cruft.a)g(and)f(lib)q(o)q(cta)o(v)o(e.a.)90 1784 y(`)p Fp(pre\014x)s Fr(/include/octave)p Fv(')330 1846 y(Include)i(\014les)g(distributed)f(with)g(Octa)o(v)o(e.)90 1936 y(`)p Fp(pre\014x)s Fr(/man/man1)p Fv(')330 1998 y(Unix-st)o(yle)g(man)f(pages)g(describing)i(Octa)o(v)o(e.)90 2088 y(`)p Fp(pre\014x)s Fr(/info)p Fv(')330 2151 y(Info)e(\014les)i (describing)g(Octa)o(v)o(e.)90 2241 y(`)p Fp(pre\014x)s Fr(/lib/octave/)p Fp(v)o(ersion)p Fr(/m)p Fv(')330 2303 y(F)l(unction)g(\014les)h(distributed)g(with)e(Octa)o(v)o(e.)24 b(This)17 b(includes)h(the)f(Octa)o(v)o(e)f(v)o(ersion,)h(so)f(that)330 2365 y(m)o(ultiple)h(v)o(ersions)e(of)g(Octa)o(v)o(e)g(ma)o(y)f(b)q(e)i (installed)h(at)e(the)g(same)g(time.)90 2455 y(`)p Fp(pre\014x)s Fr(/lib/octave/)p Fp(v)o(ersion)p Fr(/exec/)p Fp(host)p 876 2455 14 2 v 14 w(t)o(yp)q(e)s Fv(')330 2518 y(Executables)h(to)f(b) q(e)h(run)f(b)o(y)g(Octa)o(v)o(e)g(rather)g(than)g(the)g(user.)90 2608 y(`)p Fp(pre\014x)s Fr(/lib/octave/)p Fp(v)o(ersion)p Fr(/oct/)p Fp(host)p 852 2608 V 14 w(t)o(yp)q(e)s Fv(')330 2670 y(Ob)s(ject)g(\014les)h(that)f(will)i(b)q(e)f(dynamically)h (loaded.)p eop %%Page: 163 165 163 164 bop 0 -58 a Fv(App)q(endix)17 b(A:)e(Installing)i(Octa)o(v)o(e) 1273 b(163)90 183 y(`)p Fp(pre\014x)s Fr(/lib/octave/)p Fp(v)o(ersion)p Fr(/imagelib)p Fv(')330 246 y(Image)15 b(\014les)h(that)f(are)g(distributed)h(with)g(Octa)o(v)o(e.)90 335 y(where)j Fp(pre\014x)j Fv(defaults)d(to)e(`)p Fr(/usr/local)p Fv(',)g Fp(v)o(ersion)i Fv(stands)f(for)g(the)g(curren)o(t)g(v)o (ersion)h(n)o(um)o(b)q(er)g(of)f(the)90 397 y(in)o(terpreter,)e(and)g Fp(host)p 506 397 14 2 v 16 w(t)o(yp)q(e)j Fv(is)d(the)g(t)o(yp)q(e)g (of)g(computer)g(on)g(whic)o(h)h(Octa)o(v)o(e)e(is)i(installed)g(\(for) e(example,)90 460 y(`)p Fr(i486-unknown-gnu)p Fv('\).)0 598 y Fu(A.1)33 b(Installation)16 b(Problems)62 703 y Fv(This)j(section)f(con)o(tains)h(a)e(list)i(of)f(problems)g(\(and)g (some)g(apparen)o(t)g(problems)g(that)f(don't)h(really)h(mean)0 765 y(an)o(ything)c(is)h(wrong\))e(that)h(ma)o(y)f(sho)o(w)h(up)h (during)g(installation)g(of)f(Octa)o(v)o(e.)37 849 y Ft(\017)30 b Fv(On)16 b(AIX)g(\(and)f(p)q(ossibly)i(other\))e(systems,) f(GCC)h(2.6.2)f(generates)h(in)o(v)m(alid)j(assem)o(bly)d(co)q(de)h (when)g(com-)90 911 y(piling)k(some)d(parts)g(of)h(Octa)o(v)o(e.)27 b(On)18 b(AIX)h(systems,)e(it)h(is)g(p)q(ossible)i(to)d(get)g(a)h(w)o (orking)f(binary)i(b)o(y)e(not)90 974 y(using)k(the)f(compiler)h (\015ag)f(`)p Fr(-fno-implicit-templates)p Fv(')o(.)32 b(Y)l(ou)20 b(can)h(sp)q(ecify)g(this)f(as)g(an)g(option)h(to)90 1036 y(mak)o(e)15 b(b)o(y)g(using)h(a)f(command)g(lik)o(e)210 1100 y Fr(make)23 b(NO_IMPLICIT_TEMPLATES=)37 1175 y Ft(\017)30 b Fv(Y)l(ou)13 b(ma)o(y)f(need)i(to)e(edit)h(some)g(\014les) g(in)h(the)f(gcc)f(include)k(sub)q(directory)d(to)f(add)h(protot)o(yp)q (es)f(for)g(functions)90 1238 y(there.)27 b(F)l(or)17 b(example,)i(Ultrix)f(4.2)f(needs)h(prop)q(er)g(declarations)g(for)f (the)h Fr(signal\(\))e Fv(and)i(the)g Fr(SIG_IGN)90 1300 y Fv(macro)c(in)j(the)e(\014le)h(`)p Fr(signal.h)p Fv('.)90 1376 y(On)g(some)f(systems)f(the)i Fr(SIG_IGN)e Fv(macro)g(is)i (de\014ned)h(to)d(b)q(e)i(something)f(lik)o(e)i(this:)210 1440 y Fr(#define)47 b(SIG_IGN)g(\(void)23 b(\(*\)\(\)\)1)90 1515 y Fv(when)16 b(it)f(should)h(really)g(b)q(e)g(something)g(lik)o (e:)210 1579 y Fr(#define)47 b(SIG_IGN)g(\(void)23 b(\(*\)\(int\)\)1)90 1655 y Fv(to)15 b(matc)o(h)f(the)h(protot)o(yp)q(e)g(declaration)h(for) e Fr(signal\(\))p Fv(.)90 1731 y(The)j(gcc)f(\014xincludes/\014xproto)i (script)f(should)g(probably)g(\014x)g(this)g(when)g(gcc)f(installs)i (its)e(mo)q(di\014ed)i(set)90 1793 y(of)d(header)g(\014les,)h(but)f(I)h (don't)f(think)h(that's)e(b)q(een)i(done)g(y)o(et.)37 1869 y Ft(\017)30 b Fv(There)21 b(is)f(a)g(bug)h(with)g(the)f(mak)o (einfo)g(program)f(that)h(is)h(distributed)h(with)e(texinfo-3.1)g(that) g(causes)90 1931 y(the)g(indices)i(in)e(Octa)o(v)o(e's)f(on-line)i(man) o(ual)f(to)f(b)q(e)i(generated)e(incorrectly)l(.)35 b(If)20 b(y)o(ou)g(need)g(to)f(recreate)90 1994 y(the)j(on-line)i(do)q(cumen)o (tation,)g(y)o(ou)e(should)h(get)f(the)g(mak)o(einfo)g(program)f(that)g (is)i(distributed)h(with)90 2056 y(texinfo-3.1)c(and)h(apply)h(the)e (patc)o(h)h(for)f(mak)o(einfo)h(that)f(is)h(distributed)h(with)f(Octa)o (v)o(e.)36 b(See)21 b(the)g(\014le)90 2118 y(MAKEINF)o(O.P)l(A)l(TCH)15 b(for)g(more)g(details.)37 2194 y Ft(\017)30 b Fv(If)18 b(y)o(ou)g(don't)g(ha)o(v)o(e)f(NPSOL)j(but)e(y)o(ou)g(still)h(w)o(an)o (t)e(to)h(b)q(e)g(able)h(to)f(solv)o(e)g(NLPs,)h(or)e(if)i(y)o(ou)f (don't)f(ha)o(v)o(e)90 2257 y(QPSOL)g(but)f(y)o(ou)g(still)h(w)o(an)o (t)e(to)g(solv)o(e)h(QPs,)g(y)o(ou'll)g(need)h(to)e(\014nd)h (replacemen)o(ts)h(or)e(order)h(them)g(from)90 2319 y(Stanford.)26 b(If)17 b(y)o(ou)g(kno)o(w)g(of)g(a)g(freely)h(redistributable)h (replacemen)o(t,)f(please)g(let)g(us)f(kno)o(w|w)o(e)g(migh)o(t)90 2381 y(b)q(e)f(in)o(terested)g(in)g(distributing)g(it)g(with)f(Octa)o (v)o(e.)90 2457 y(Y)l(ou)g(can)h(get)f(more)f(information)i(ab)q(out)f (NPSOL)h(and)f(QPSOL)i(from)210 2521 y(Stanford)e(Univ)o(ersit)o(y)210 2570 y(O\016ce)h(of)f(T)l(ec)o(hnology)g(Licensing)210 2620 y(857)f(Serra)h(Street)210 2670 y(Stanford)g(CA)g(94305-6225)p eop %%Page: 164 166 164 165 bop 0 -58 a Fv(164)1743 b(Octa)o(v)o(e)210 183 y(T)l(el:)21 b(\(415\))13 b(723-0651)210 233 y(F)l(ax:)19 b(\(415\))14 b(725-7295)90 318 y(Octa)o(v)o(e)h(ma)o(y)g(so)q(on)h (supp)q(ort)g(FSQP)l(,)g(an)f(NLP)h(solv)o(er)g(from)f(Andre)h(Tits)g (\(andre)p Fr(@)p Fv(src.umd.edu\))g(of)f(the)90 380 y(Univ)o(ersit)o(y)k(of)f(Maryland.)29 b(FSQP)18 b(is)h(a)o(v)m (ailable)h(free)e(of)g(c)o(harge)g(to)g(academic)h(sites,)g(but)f(can)g (not)g(b)q(e)90 442 y(redistributed)f(to)d(third)i(parties.)37 516 y Ft(\017)30 b Fv(Some)18 b(of)g(the)g(F)l(ortran)f(subroutines)h (ma)o(y)g(fail)h(to)e(compile)j(with)e(older)g(v)o(ersions)h(of)e(the)h (Sun)h(F)l(ortran)90 578 y(compiler.)i(If)16 b(y)o(ou)e(get)h(errors)g (lik)o(e)210 639 y Fr(zgemm.f:)210 689 y(zgemm:)210 739 y(warning:)23 b(unexpected)f(parent)h(of)h(complex)f(expression)f (subtree)210 789 y(zgemm.f,)h(line)g(245:)g(warning:)g(unexpected)g (parent)g(of)g(complex)g(expression)g(subtree)210 839 y(warning:)g(unexpected)f(parent)h(of)h(complex)f(expression)f(subtree) 210 888 y(zgemm.f,)h(line)g(304:)g(warning:)g(unexpected)g(parent)g(of) g(complex)g(expression)g(subtree)210 938 y(warning:)g(unexpected)f (parent)h(of)h(complex)f(expression)f(subtree)210 988 y(zgemm.f,)h(line)g(327:)g(warning:)g(unexpected)g(parent)g(of)g (complex)g(expression)g(subtree)210 1038 y(pcc_binval:)f(missing)h (IR_CONV)g(in)h(complex)f(op)210 1088 y(make[2]:)g(***)g([zgemm.o])g (Error)g(1)90 1161 y Fv(when)f(compiling)h(the)f(F)l(ortran)e (subroutines)i(in)g(the)g(`)p Fr(libcruft)p Fv(')d(sub)q(directory)l(,) 24 b(y)o(ou)d(should)h(either)90 1223 y(upgrade)15 b(y)o(our)g (compiler)i(or)d(try)h(compiling)i(with)e(optimization)i(turned)e (o\013.)37 1297 y Ft(\017)30 b Fv(On)16 b(NeXT)f(systems)g(with)g(gcc)h (2.5.8,)d(if)j(y)o(ou)e(get)h(errors)g(lik)o(e)h(this:)210 1358 y Fr(/usr/tmp/cc007458.s:unknow)o(n:Undef)o(ined)21 b(local)i(symbol)g(LBB7656)210 1408 y(/usr/tmp/cc007458.s:unknow)o (n:Undef)o(ined)e(local)i(symbol)g(LBE7656)90 1481 y Fv(when)16 b(compiling)h(`)p Fr(Array.cc)p Fv(')c(and)i(`)p Fr(Matrix.cc)p Fv(',)e(try)i(recompiling)i(these)e(\014les)i(without)e Fr(-g)p Fv(.)37 1555 y Ft(\017)30 b Fv(Some)22 b(p)q(eople)i(ha)o(v)o (e)d(rep)q(orted)i(that)e(calls)i(to)f(shell)p 1036 1555 14 2 v 18 w(cmd)g(and)h(the)f(pager)g(do)g(not)f(w)o(ork)h(on)g(SunOS) 90 1617 y(systems.)d(This)14 b(is)g(apparen)o(tly)f(due)h(to)f(ha)o (ving)h Fr(G_HAVE_SYS_WAIT)d Fv(de\014ned)k(to)d(b)q(e)i(0)f(instead)h (of)f(1)g(when)90 1680 y(compiling)k(libg)p Fr(++)p Fv(.)37 1753 y Ft(\017)30 b Fv(On)20 b(NeXT)f(systems)g(with)g(gcc)g(2.5.8,)f (linking)j(to)e(`)p Fr(libsys_s.a)p Fv(')e(ma)o(y)h(fail)i(to)f(resolv) o(e)g(the)g(follo)o(wing)90 1815 y(functions)210 1876 y Fr(_tcgetattr)210 1926 y(_tcsetattr)210 1976 y(_tcflow)90 2050 y Fv(whic)o(h)j(are)e(part)g(of)g(`)p Fr(libposix.a)p Fv('.)34 b(Unfortunately)l(,)22 b(linking)h(Octa)o(v)o(e)d(with)h Fr(-posix)f Fv(results)h(in)h(the)90 2112 y(follo)o(wing)16 b(unde\014ned)h(sym)o(b)q(ols.)210 2173 y Fr(.destructors_used)210 2223 y(.constructors_used)210 2273 y(_objc_msgSend)210 2322 y(_NXGetDefaultValue)210 2372 y(_NXRegisterDefaults)210 2422 y(.objc_class_name_NXStringT)o(able)210 2472 y (.objc_class_name_NXBundle)90 2545 y Fv(One)11 b(kludge)h(around)f (this)g(problem)g(is)h(to)e(extract)g(`)p Fr(termios.o)p Fv(')e(from)i(`)p Fr(libposix.a)p Fv(',)f(put)i(it)g(in)h(Octa)o(v)o (e's)90 2608 y(`)p Fr(src)p Fv(')j(directory)l(,)h(and)g(add)h(it)f(to) f(the)i(list)f(of)g(\014les)h(to)f(link)h(together)e(in)i(the)f(Mak)o (e\014le.)23 b(Suggestions)17 b(for)90 2670 y(b)q(etter)e(w)o(a)o(ys)f (to)h(solv)o(e)g(this)h(problem)g(are)f(w)o(elcome!)p eop %%Page: 165 167 165 166 bop 0 -58 a Fv(App)q(endix)17 b(A:)e(Installing)i(Octa)o(v)o(e) 1273 b(165)37 183 y Ft(\017)30 b Fv(With)24 b(g)p Fr(++)e Fv(2.6.3)g(\(and)h(p)q(ossibly)i(other)e(2.6.x)f(v)o(ersions\))h(on)h (some)f(In)o(tel)h(x86)f(systems,)h(compiling)90 246 y(`)p Fr(Array-d.cc)p Fv(')13 b(fails)j(with)g(the)f(messages)f(lik)o (e)210 308 y Fr(as:)23 b(/tmp/cc005254.s:4057:)e(Local)j(symbol)f (LBB103)g(never)g(defined.)210 357 y(as:)g(/tmp/cc005254.s:4057:)e (Local)j(symbol)f(LBE103)g(never)g(defined.)90 432 y Fv(A)15 b(p)q(ossible)i(w)o(ork)m(around)e(for)g(this)g(is)h(to)e (compile)j(without)e Fr(-g)p Fv(.)37 507 y Ft(\017)30 b Fv(If)17 b(Octa)o(v)o(e)g(crashes)f(immediately)j(with)e(a)g (\015oating)f(p)q(oin)o(t)i(exception,)g(it)f(is)g(lik)o(ely)i(that)d (it)h(is)g(failing)i(to)90 569 y(initialize)f(the)e(IEEE)f(\015oating)g (p)q(oin)o(t)h(v)m(alues)g(for)f(in\014nit)o(y)h(and)g(NaN.)90 643 y(If)g(y)o(our)e(system)h(actually)h(do)q(es)g(supp)q(ort)f(IEEE)h (arithmetic,)f(y)o(ou)g(should)h(b)q(e)g(able)g(to)f(\014x)h(this)f (problem)90 706 y(b)o(y)20 b(mo)q(difying)i(the)e(function)i Fr(octave_ieee_init)c Fv(in)j(the)g(\014le)g(`)p Fr(sysdep.cc)p Fv(')d(to)i(correctly)h(initialize)90 768 y(Octa)o(v)o(e's)14 b(in)o(ternal)i(in\014nit)o(y)h(and)e(NaN)g(v)m(ariables.)90 842 y(If)21 b(y)o(our)f(system)g(do)q(es)h(not)f(supp)q(ort)h(IEEE)g (arithmetic)g(but)g(Octa)o(v)o(e's)f(con\014gure)h(script)g (incorrectly)90 905 y(determined)e(that)e(it)g(do)q(es,)i(y)o(ou)e(can) g(w)o(ork)g(around)h(the)f(problem)h(b)o(y)g(editing)h(the)e(\014le)i (`)p Fr(config.h)p Fv(')d(to)90 967 y(not)f(de\014ne)h Fr(HAVE_ISINF)p Fv(,)e Fr(HAVE_FINITE)p Fv(,)f(and)i Fr(HAVE_ISNAN)p Fv(.)90 1042 y(In)h(an)o(y)e(case,)h(please)h(rep)q (ort)f(this)g(as)g(a)g(bug)g(since)h(it)g(migh)o(t)f(b)q(e)g(p)q (ossible)i(to)e(mo)q(dify)g(Octa)o(v)o(e's)f(con\014gu-)90 1104 y(ration)h(script)h(to)e(automatically)i(determine)g(the)f(prop)q (er)h(thing)f(to)g(do.)0 1236 y Fu(A.2)33 b(Binary)16 b(Distributions)62 1340 y Fv(This)g(section)g(con)o(tains)f (instructions)h(for)f(creating)g(and)h(installing)h(a)e(binary)g (distribution.)0 1460 y Fj(A.2.1)30 b(Installing)15 b(Octa)n(v)n(e)i (from)d(a)h(Binary)h(Distribution)37 1564 y Ft(\017)30 b Fv(T)l(o)15 b(install)i(Octa)o(v)o(e)d(from)h(a)g(binary)g (distribution,)i(execute)f(the)f(command)210 1626 y Fr(sh)24 b(./doinstall.sh)90 1701 y Fv(in)16 b(the)f(top)g(lev)o(el)i(directory) e(of)g(the)g(distribution.)90 1775 y(Binary)23 b(distributions)i(are)d (normally)i(compiled)g(assuming)f(that)f(Octa)o(v)o(e)h(will)h(b)q(e)g (installed)g(in)g(the)90 1838 y(follo)o(wing)16 b(sub)q(directories)h (of)e(`)p Fr(/usr/local)p Fv('.)90 1924 y(`)p Fr(bin)p Fv(')142 b(Octa)o(v)o(e)15 b(and)g(other)g(binaries)i(that)d(p)q(eople) j(will)g(w)o(an)o(t)d(to)g(run)i(directly)l(.)90 2011 y(`)p Fr(man/man1)p Fv(')330 2073 y(Unix-st)o(yle)g(man)f(pages)g (describing)i(Octa)o(v)o(e.)90 2160 y(`)p Fr(info)p Fv(')118 b(Info)15 b(\014les)i(describing)g(Octa)o(v)o(e.)90 2247 y(`)p Fr(lib/octave/)p Fp(v)o(ersion)p Fr(/m)p Fv(')330 2309 y(F)l(unction)g(\014les)h(distributed)g(with)e(Octa)o(v)o(e.)24 b(This)17 b(includes)h(the)f(Octa)o(v)o(e)f(v)o(ersion,)h(so)f(that)330 2372 y(m)o(ultiple)h(v)o(ersions)e(of)g(Octa)o(v)o(e)g(ma)o(y)f(b)q(e)i (installed)h(at)e(the)g(same)g(time.)90 2459 y(`)p Fr(lib/octave/)p Fp(v)o(ersion)p Fr(/exec/)p Fp(host)p 737 2459 14 2 v 14 w(t)o(yp)q(e)s Fv(')330 2521 y(Executables)h(to)f(b)q(e)h(run)f(b)o (y)g(Octa)o(v)o(e)g(rather)g(than)g(the)g(user.)90 2608 y(`)p Fr(lib/octave/)p Fp(v)o(ersion)p Fr(/imagelib)p Fv(')330 2670 y(Image)g(\014les)h(that)f(are)g(distributed)h(with)g (Octa)o(v)o(e.)p eop %%Page: 166 168 166 167 bop 0 -58 a Fv(166)1743 b(Octa)o(v)o(e)90 183 y(where)18 b Fp(v)o(ersion)g Fv(stands)f(for)g(the)h(curren)o(t)g(v)o (ersion)f(n)o(um)o(b)q(er)h(of)g(the)f(in)o(terpreter,)i(and)e Fp(host)p 1718 183 14 2 v 16 w(t)o(yp)q(e)k Fv(is)d(the)90 246 y(t)o(yp)q(e)d(of)g(computer)g(on)g(whic)o(h)h(Octa)o(v)o(e)f(is)h (installed)h(\(for)d(example,)i(`)p Fr(i486-unknown-gnu)p Fv('\).)90 320 y(If)f(these)h(directories)g(don't)f(exist,)g(the)g (script)h(`)p Fr(doinstall.sh)p Fv(')d(will)k(create)d(them)i(for)e(y)o (ou.)90 395 y(If)h(this)h(is)f(p)q(ossible)i(for)d(y)o(ou)h(to)f (install)i(Octa)o(v)o(e)f(in)h(`)p Fr(/usr/local)p Fv(',)c(or)j(if)g(y) o(ou)g(w)o(ould)g(prefer)g(to)f(install)j(it)90 457 y(in)f(a)f (di\013eren)o(t)g(directory)l(,)g(y)o(ou)g(can)g(sp)q(ecify)h(the)f (name)h(of)e(the)h(top)g(lev)o(el)h(directory)g(as)e(an)h(argumen)o(t)g (to)90 519 y(the)g(doinstall.sh)i(script.)j(F)l(or)15 b(example:)210 582 y Fr(sh)24 b(./doinstall.sh)e(/some/other/directory) 90 656 y Fv(Octa)o(v)o(e)15 b(will)i(then)e(b)q(e)h(installed)h(in)f (sub)q(directories)h(of)e(the)g(directory)h(`)p Fr (/some/other/director)o(y)p Fv(')0 777 y Fj(A.2.2)30 b(Creating)16 b(a)e(Binary)i(Distribution)62 881 y Fv(Here)g(is)f(ho)o (w)g(to)g(build)i(a)e(binary)h(distribution)g(for)f(others.)37 964 y Ft(\017)30 b Fv(Build)20 b(Octa)o(v)o(e)e(in)h(the)g(same)e (directory)i(as)f(the)g(source.)29 b(This)19 b(is)g(required)g(since)h (the)e(`)p Fr(binary-dist)p Fv(')90 1026 y(targets)c(in)i(the)f(Mak)o (e\014les)h(will)h(not)d(w)o(ork)h(if)g(y)o(ou)g(compile)i(outside)f (the)f(source)g(tree.)37 1101 y Ft(\017)30 b Fv(Use)14 b(`)p Fr(CFLAGS=-O)f(CXXFLAGS=-O)h(LDFLAGS=)p Fv(')e(as)i(argumen)o(ts) f(for)g(Mak)o(e)g(b)q(ecause)i(most)e(p)q(eople)i(who)e(get)90 1163 y(the)i(binary)h(distributions)h(are)e(probably)h(not)e(going)i (to)e(b)q(e)i(in)o(terested)g(in)g(debugging)g(Octa)o(v)o(e.)37 1238 y Ft(\017)30 b Fv(T)o(yp)q(e)15 b(`)p Fr(make)g(binary-dist)p Fv('.)j(This)d(will)i(build)g(ev)o(erything)f(and)f(then)h(pac)o(k)f (it)g(up)h(for)f(distribution.)p eop %%Page: 167 169 167 168 bop 0 -58 a Fv(App)q(endix)17 b(B:)e(Kno)o(wn)h(Causes)f(of)f (T)l(rouble)i(with)g(Octa)o(v)o(e)845 b(167)0 183 y Fs(App)r(endix)13 b(B)41 b(Kno)n(wn)16 b(Causes)f(of)g(T)-7 b(rouble)14 b(with)i(Octa)n(v)n(e)62 322 y Fv(This)e(section)f(describ)q(es)h(kno)o (wn)f(problems)g(that)f(a\013ect)g(users)h(of)f(Octa)o(v)o(e.)19 b(Most)11 b(of)i(these)g(are)f(not)g(Octa)o(v)o(e)0 384 y(bugs)j(p)q(er)h(se|if)g(they)f(w)o(ere,)g(w)o(e)g(w)o(ould)g(\014x)h (them.)j(But)d(the)f(result)h(for)e(a)h(user)g(ma)o(y)g(b)q(e)g(lik)o (e)i(the)e(result)h(of)e(a)0 446 y(bug.)62 530 y(Some)k(of)f(these)g (problems)h(are)f(due)h(to)f(bugs)g(in)i(other)e(soft)o(w)o(are,)e (some)i(are)g(missing)i(features)e(that)f(are)0 592 y(to)q(o)f(m)o(uc)o (h)g(w)o(ork)f(to)h(add,)g(and)g(some)g(are)g(places)h(where)f(p)q (eople's)h(opinions)h(di\013er)f(as)e(to)h(what)g(is)g(b)q(est.)0 730 y Fu(B.1)33 b(Actual)15 b(Bugs)g(W)-6 b(e)16 b(Ha)n(v)n(en't)f (Fixed)h(Y)-6 b(et)37 834 y Ft(\017)30 b Fv(Output)20 b(that)f(comes)h(directly)h(from)e(F)l(ortran)g(functions)h(is)h(not)e (sen)o(t)h(through)f(the)h(pager)g(and)g(ma)o(y)90 897 y(app)q(ear)d(out)g(of)g(sequence)i(with)e(other)g(output)g(that)g(is)h (sen)o(t)f(through)g(the)g(pager.)26 b(One)18 b(w)o(a)o(y)f(to)f(a)o(v) o(oid)90 959 y(this)e(is)h(to)e(force)h(p)q(ending)h(output)f(to)f(b)q (e)i(\015ushed)g(b)q(efore)f(calling)h(a)f(function)h(that)e(will)i (pro)q(duce)g(output)90 1021 y(from)f(within)j(F)l(ortran)d(functions.) 21 b(T)l(o)14 b(do)i(this,)f(use)g(the)h(command)210 1085 y Fr(fflush)23 b(\(stdout\))90 1160 y Fv(Another)15 b(p)q(ossible)i(w)o(ork)m(around)e(is)h(to)e(use)i(the)f(command)210 1224 y Fr(page_screen_output)21 b(=)j("false")90 1300 y Fv(to)15 b(turn)g(the)g(pager)g(o\013.)37 1375 y Ft(\017)30 b Fv(Con)o(trol-C)15 b(do)q(esn't)g(w)o(ork)f(prop)q(erly)i(in)g(the)f (pager)g(on)g(DEC)g(Alpha)h(systems)f(running)h(OSF/1)f(3.0.)90 1451 y(This)20 b(app)q(ears)g(to)f(b)q(e)i(a)e(bug)h(in)h(the)f(OSF/1)f (3.0)g(Bourne)h(shell.)35 b(The)20 b(problem)g(do)q(esn't)g(app)q(ear)g (on)90 1513 y(systems)15 b(running)h(OSF/1)f(1.3.)37 1589 y Ft(\017)30 b Fv(If)15 b(y)o(ou)g(get)g(messages)g(lik)o(e)210 1653 y Fr(Input)23 b(line)g(too)h(long)90 1728 y Fv(when)11 b(trying)g(to)f(plot)h(man)o(y)g(lines)h(on)f(one)g(graph,)g(y)o(ou)g (ha)o(v)o(e)f(probably)i(generated)e(a)h(plot)g(command)g(that)90 1791 y(is)17 b(to)q(o)e(larger)i(for)e Fr(gnuplot)p Fv('s)g (\014xed-length)j(bu\013er)e(for)g(commands.)23 b(Splitting)17 b(up)g(the)g(plot)f(command)90 1853 y(do)q(esn't)g(help)i(b)q(ecause)f (replot)f(is)h(implemen)o(ted)h(in)f(gn)o(uplot)f(b)o(y)g(simply)i(app) q(ending)g(the)e(new)g(plotting)90 1915 y(commands)f(to)g(the)g(old)h (command)f(line)i(and)e(then)g(ev)m(aluating)i(it)e(again.)90 1991 y(Y)l(ou)g(can)h(demonstrate)e(this)i(`feature')e(b)o(y)h(running) h(gn)o(uplot)g(and)f(doing)h(something)f(lik)o(e)258 2054 y Fr(plot)23 b(sin)g(\(x\),)h(sin)f(\(x\),)h(sin)f(\(x\),)g(...)h (lots)f(more)g(...,)h(sin)f(\(x\))90 2130 y Fv(and)15 b(then)258 2194 y Fr(replot)23 b(sin)g(\(x\),)h(sin)f(\(x\),)g(sin)h (\(x\),)f(...)h(lots)f(more)g(...,)g(sin)h(\(x\))90 2269 y Fv(after)14 b(rep)q(eating)i(the)g(replot)f(command)g(a)g(few)g (times,)g(gn)o(uplot)h(will)g(giv)o(e)g(y)o(ou)f(an)g(error.)90 2345 y(Also,)e(it)h(do)q(esn't)e(help)j(to)d(use)h(bac)o(kslashes)h(to) e(en)o(ter)h(a)f(plot)h(command)g(o)o(v)o(er)f(sev)o(eral)h(lines,)i(b) q(ecause)f(the)90 2407 y(limit)h(is)g(on)f(the)g(o)o(v)o(erall)g (command)f(line)j(length,)e(once)h(the)f(bac)o(kslashed)g(lines)i(are)d (all)i(pasted)f(together.)90 2483 y(Because)j(of)g(this,)g(Octa)o(v)o (e)f(tries)h(to)f(use)h(as)g(little)h(of)e(the)h(command-line)h(length) g(as)e(p)q(ossible)j(b)o(y)d(using)90 2545 y(the)21 b(shortest)f(p)q (ossible)j(abbreviations)e(for)f(all)i(the)f(plot)g(commands)g(and)g (options.)37 b(Unfortunately)l(,)90 2608 y(the)18 b(length)g(of)f(the)g (temp)q(orary)g(\014le)i(names)e(is)h(probably)g(what)f(is)h(taking)g (up)f(the)h(most)f(space)g(on)h(the)90 2670 y(command)d(line.)p eop %%Page: 168 170 168 169 bop 0 -58 a Fv(168)1743 b(Octa)o(v)o(e)90 183 y(Y)l(ou)11 b(can)g(buy)h(a)e(little)i(bit)g(of)e(command)h(line)i (space)e(b)o(y)g(setting)g(the)g(en)o(vironmen)o(t)g(v)m(ariable)h Fr(TMPDIR)e Fv(to)g(b)q(e)90 246 y Fr(")p Fv(.)p Fr(")k Fv(b)q(efore)h(starting)f(Octa)o(v)o(e,)f(or)h(y)o(ou)h(can)f(increase) i(the)e(maxim)o(um)h(command)f(line)i(length)f(in)h(gn)o(uplot)90 308 y(b)o(y)g(c)o(hanging)g(the)g(follo)o(wing)h(limits)g(in)g(the)f (\014le)h(plot.h)f(in)h(the)f(gn)o(uplot)g(distribution)i(and)e (recompiling)90 370 y(gn)o(uplot.)210 433 y Fr(#define)23 b(MAX_LINE_LEN)f(32768)47 b(/*)24 b(originally)e(1024)i(*/)210 482 y(#define)f(MAX_TOKENS)f(8192)119 b(/*)24 b(originally)e(400)i(*/) 90 558 y Fv(Of)18 b(course,)h(this)f(do)q(esn't)g(really)h(\014x)f(the) h(problem,)g(but)f(it)g(do)q(es)h(mak)o(e)e(it)h(m)o(uc)o(h)g(less)h (lik)o(ely)h(that)d(y)o(ou)90 620 y(will)g(run)e(in)o(to)g(trouble)h (unless)h(y)o(ou)d(are)h(putting)h(a)f(v)o(ery)g(large)g(n)o(um)o(b)q (er)g(of)g(lines)i(on)e(a)g(giv)o(en)h(plot.)37 695 y Ft(\017)30 b Fv(String)15 b(handling)i(could)g(use)e(some)g(w)o(ork.)62 791 y(A)j(list)h(of)e(ideas)i(for)e(future)h(enhancemen)o(ts)h(is)f (distributed)i(with)e(Octa)o(v)o(e.)28 b(See)18 b(the)g(\014le)h(`)p Fr(PROJECTS)p Fv(')d(in)0 853 y(the)f(top)g(lev)o(el)i(directory)e(in)h (the)f(source)h(distribution.)0 988 y Fu(B.2)33 b(Rep)r(orting)16 b(Bugs)62 1092 y Fv(Y)l(our)g(bug)f(rep)q(orts)g(pla)o(y)g(an)g(essen)o (tial)h(role)g(in)g(making)f(Octa)o(v)o(e)g(reliable.)62 1175 y(When)22 b(y)o(ou)f(encoun)o(ter)h(a)f(problem,)j(the)e(\014rst)f (thing)h(to)f(do)g(is)h(to)f(see)h(if)g(it)g(is)g(already)g(kno)o(wn.) 38 b(See)0 1237 y(App)q(endix)17 b(B)f([T)l(rouble],)f(page)g(167.)k (If)c(it)h(isn't)f(kno)o(wn,)f(then)i(y)o(ou)f(should)h(rep)q(ort)f (the)g(problem.)62 1321 y(Rep)q(orting)j(a)f(bug)g(ma)o(y)g(help)h(y)o (ou)f(b)o(y)g(bringing)h(a)f(solution)h(to)e(y)o(our)g(problem,)i(or)f (it)g(ma)o(y)g(not.)25 b(In)17 b(an)o(y)0 1383 y(case,)h(the)g (principal)j(function)e(of)e(a)h(bug)g(rep)q(ort)g(is)g(to)g(help)h (the)f(en)o(tire)h(comm)o(unit)o(y)f(b)o(y)g(making)g(the)g(next)0 1445 y(v)o(ersion)d(of)g(Octa)o(v)o(e)g(w)o(ork)f(b)q(etter.)20 b(Bug)15 b(rep)q(orts)g(are)g(y)o(our)g(con)o(tribution)h(to)e(the)i (main)o(tenance)f(of)g(Octa)o(v)o(e.)62 1529 y(In)i(order)f(for)g(a)f (bug)i(rep)q(ort)f(to)f(serv)o(e)h(its)g(purp)q(ose,)h(y)o(ou)f(m)o (ust)g(include)i(the)e(information)h(that)e(mak)o(es)h(it)0 1591 y(p)q(ossible)h(to)e(\014x)g(the)g(bug.)62 1674 y(If)j(y)o(ou)f(ha)o(v)o(e)g(Octa)o(v)o(e)g(w)o(orking)g(at)g(all,)h (the)g(easiest)f(w)o(a)o(y)g(to)g(prepare)g(a)g(complete)h(bug)g(rep)q (ort)f(is)h(to)f(use)0 1737 y(the)g(Octa)o(v)o(e)g(function)h Fr(bug_report)p Fv(.)24 b(When)17 b(y)o(ou)g(execute)h(this)f (function,)h(Octa)o(v)o(e)f(will)i(prompt)d(y)o(ou)h(for)f(a)0 1799 y(sub)s(ject)e(and)g(then)g(in)o(v)o(ok)o(e)f(the)h(editor)g(on)g (a)f(\014le)i(that)e(already)h(con)o(tains)g(all)g(the)g (con\014guration)g(information.)0 1861 y(When)i(y)o(ou)e(exit)i(the)f (editor,)g(Octa)o(v)o(e)g(will)i(mail)f(the)f(bug)h(rep)q(ort)f(for)f (y)o(ou.)0 1995 y Fu(B.3)33 b(Ha)n(v)n(e)15 b(Y)-6 b(ou)15 b(F)-6 b(ound)16 b(a)f(Bug?)62 2100 y Fv(If)h(y)o(ou)f(are)f(not)h (sure)h(whether)f(y)o(ou)g(ha)o(v)o(e)g(found)g(a)g(bug,)g(here)h(are)f (some)f(guidelines:)37 2196 y Ft(\017)30 b Fv(If)15 b(Octa)o(v)o(e)e (gets)h(a)g(fatal)g(signal,)h(for)f(an)o(y)g(input)h(whatev)o(er,)e (that)h(is)h(a)f(bug.)19 b(Reliable)e(in)o(terpreters)e(nev)o(er)90 2258 y(crash.)37 2333 y Ft(\017)30 b Fv(If)15 b(Octa)o(v)o(e)g(pro)q (duces)h(incorrect)g(results,)f(for)g(an)o(y)g(input)h(whatev)o(er,)e (that)g(is)i(a)f(bug.)37 2408 y Ft(\017)30 b Fv(Some)16 b(output)g(ma)o(y)f(app)q(ear)i(to)e(b)q(e)i(incorrect)f(when)h(it)f (is)h(in)g(fact)e(due)i(to)f(a)f(program)g(whose)h(b)q(eha)o(vior)90 2470 y(is)j(unde\014ned,)i(whic)o(h)f(happ)q(ened)g(b)o(y)f(c)o(hance)g (to)f(giv)o(e)h(the)g(desired)h(results)f(on)f(another)h(system.)30 b(F)l(or)90 2533 y(example,)19 b(the)g(range)e(op)q(erator)h(ma)o(y)f (pro)q(duce)i(di\013eren)o(t)f(results)h(b)q(ecause)g(of)f (di\013erences)h(in)g(the)f(w)o(a)o(y)90 2595 y(\015oating)d(p)q(oin)o (t)h(arithmetic)g(is)f(handled)i(on)e(v)m(arious)h(systems.)37 2670 y Ft(\017)30 b Fv(If)15 b(Octa)o(v)o(e)g(pro)q(duces)h(an)f(error) g(message)g(for)f(v)m(alid)j(input,)f(that)e(is)i(a)f(bug.)p eop %%Page: 169 171 169 170 bop 0 -58 a Fv(App)q(endix)17 b(B:)e(Kno)o(wn)h(Causes)f(of)f (T)l(rouble)i(with)g(Octa)o(v)o(e)845 b(169)37 183 y Ft(\017)30 b Fv(If)18 b(Octa)o(v)o(e)g(do)q(es)g(not)g(pro)q(duce)h(an) e(error)h(message)f(for)h(in)o(v)m(alid)i(input,)f(that)e(is)i(a)f (bug.)28 b(Ho)o(w)o(ev)o(er,)17 b(y)o(ou)90 246 y(should)f(note)f(that) f(y)o(our)g(idea)i(of)e(\\in)o(v)m(alid)j(input")f(migh)o(t)f(b)q(e)g (m)o(y)g(idea)g(of)g(\\an)f(extension")i(or)e(\\supp)q(ort)90 308 y(for)h(traditional)g(practice".)37 387 y Ft(\017)30 b Fv(If)15 b(y)o(ou)g(are)g(an)g(exp)q(erienced)j(user)d(of)g(programs) f(lik)o(e)j(Octa)o(v)o(e,)d(y)o(our)h(suggestions)g(for)f(impro)o(v)o (emen)o(t)h(are)90 450 y(w)o(elcome)h(in)g(an)o(y)e(case.)0 602 y Fu(B.4)33 b(Where)16 b(to)e(Rep)r(ort)i(Bugs)62 710 y Fv(If)i(y)o(ou)f(ha)o(v)o(e)g(Octa)o(v)o(e)g(w)o(orking)g(at)g (all,)h(the)g(easiest)f(w)o(a)o(y)g(to)g(prepare)g(a)g(complete)h(bug)g (rep)q(ort)f(is)h(to)f(use)0 773 y(the)g(Octa)o(v)o(e)g(function)h Fr(bug_report)p Fv(.)24 b(When)17 b(y)o(ou)g(execute)h(this)f (function,)h(Octa)o(v)o(e)f(will)i(prompt)d(y)o(ou)h(for)f(a)0 835 y(sub)s(ject)e(and)g(then)g(in)o(v)o(ok)o(e)f(the)h(editor)g(on)g (a)f(\014le)i(that)e(already)h(con)o(tains)g(all)g(the)g (con\014guration)g(information.)0 897 y(When)i(y)o(ou)e(exit)i(the)f (editor,)g(Octa)o(v)o(e)g(will)i(mail)f(the)f(bug)h(rep)q(ort)f(for)f (y)o(ou.)62 985 y(If)j(for)f(some)h(reason)f(y)o(ou)g(cannot)h(use)g (Octa)o(v)o(e's)e Fr(bug_report)h Fv(function,)h(send)g(bug)g(rep)q (orts)f(for)g(Octa)o(v)o(e)0 1047 y(to:)120 1123 y Fr (bug-octave@che.utexas.edu)62 1210 y Fm(Do)h(not)g(send)h(bug)f(rep)q (orts)i(to)d(`)p Fr(help-octave)p Fm(')p Fv(.)24 b(Most)16 b(users)i(of)f(Octa)o(v)o(e)g(do)g(not)g(w)o(an)o(t)f(to)h(receiv)o(e)h (bug)0 1273 y(rep)q(orts.)h(Those)d(that)e(do)h(ha)o(v)o(e)g(ask)o(ed)g (to)g(b)q(e)g(on)h(`)p Fr(bug-octave)p Fv('.)62 1361 y(As)f(a)g(last)g(resort,)f(send)i(bug)g(rep)q(orts)e(on)h(pap)q(er)h (to:)120 1436 y Fr(Octave)23 b(Bugs)g(c/o)h(John)f(W.)h(Eaton)120 1486 y(Department)e(of)i(Chemical)f(Engineering)120 1536 y(The)g(University)g(of)h(Texas)f(at)g(Austin)120 1585 y(Austin,)g(Texas)g(78712)0 1737 y Fu(B.5)33 b(Ho)n(w)14 b(to)h(Rep)r(ort)g(Bugs)62 1846 y Fv(The)g(fundamen)o(tal)g(principle)i (of)d(rep)q(orting)g(bugs)h(usefully)h(is)f(this:)20 b Fm(rep)q(ort)15 b(all)h(the)e(facts)p Fv(.)20 b(If)14 b(y)o(ou)g(are)g(not)0 1908 y(sure)h(whether)h(to)e(state)h(a)g(fact)f (or)h(lea)o(v)o(e)g(it)h(out,)e(state)g(it!)62 1996 y(Often)i(p)q (eople)i(omit)e(facts)f(b)q(ecause)i(they)f(think)g(they)g(kno)o(w)g (what)f(causes)h(the)g(problem)h(and)f(they)g(con-)0 2058 y(clude)i(that)d(some)h(details)h(don't)f(matter.)22 b(Th)o(us,)16 b(y)o(ou)g(migh)o(t)g(assume)g(that)g(the)g(name)h(of)e (the)i(v)m(ariable)g(y)o(ou)0 2121 y(use)h(in)h(an)f(example)g(do)q(es) g(not)g(matter.)26 b(W)l(ell,)20 b(probably)e(it)g(do)q(esn't,)g(but)g (one)g(cannot)g(b)q(e)g(sure.)28 b(P)o(erhaps)0 2183 y(the)16 b(bug)f(is)h(a)f(stra)o(y)f(memory)h(reference)h(whic)o(h)h (happ)q(ens)f(to)f(fetc)o(h)g(from)g(the)g(lo)q(cation)i(where)e(that)g (name)g(is)0 2245 y(stored)f(in)h(memory;)e(p)q(erhaps,)i(if)g(the)f (name)g(w)o(ere)g(di\013eren)o(t,)h(the)f(con)o(ten)o(ts)g(of)f(that)h (lo)q(cation)h(w)o(ould)f(fo)q(ol)h(the)0 2308 y(in)o(terpreter)j(in)o (to)h(doing)f(the)h(righ)o(t)f(thing)g(despite)i(the)e(bug.)29 b(Pla)o(y)18 b(it)h(safe)f(and)g(giv)o(e)h(a)f(sp)q(eci\014c,)i (complete)0 2370 y(example.)62 2458 y(Keep)e(in)f(mind)h(that)e(the)g (purp)q(ose)i(of)e(a)g(bug)h(rep)q(ort)f(is)h(to)f(enable)i(someone)e (to)g(\014x)h(the)g(bug)f(if)h(it)g(is)g(not)0 2520 y(kno)o(wn.)j(Alw)o (a)o(ys)14 b(write)i(y)o(our)e(bug)i(rep)q(orts)f(on)g(the)g (assumption)g(that)g(the)g(bug)h(is)f(not)g(kno)o(wn.)62 2608 y(Sometimes)i(p)q(eople)i(giv)o(e)d(a)h(few)f(sk)o(etc)o(h)o(y)h (facts)f(and)h(ask,)f(\\Do)q(es)g(this)h(ring)g(a)g(b)q(ell?")27 b(This)17 b(cannot)g(help)0 2670 y(us)e(\014x)h(a)f(bug.)20 b(It)15 b(is)h(b)q(etter)f(to)f(send)i(a)f(complete)h(bug)f(rep)q(ort)g (to)g(b)q(egin)h(with.)p eop %%Page: 170 172 170 171 bop 0 -58 a Fv(170)1743 b(Octa)o(v)o(e)62 183 y(T)l(ry)17 b(to)g(mak)o(e)f(y)o(our)h(bug)g(rep)q(ort)g(self-con)o (tained.)27 b(If)18 b(w)o(e)f(ha)o(v)o(e)f(to)h(ask)g(y)o(ou)f(for)h (more)g(information,)g(it)g(is)0 246 y(b)q(est)h(if)f(y)o(ou)g(include) j(all)e(the)g(previous)g(information)f(in)i(y)o(our)d(resp)q(onse,)i (as)f(w)o(ell)i(as)e(the)g(information)h(that)0 308 y(w)o(as)c (missing.)62 391 y(T)l(o)h(enable)i(someone)e(to)f(in)o(v)o(estigate)h (the)h(bug,)f(y)o(ou)g(should)h(include)h(all)g(these)e(things:)37 474 y Ft(\017)30 b Fv(The)18 b(v)o(ersion)f(of)g(Octa)o(v)o(e.)27 b(Y)l(ou)17 b(can)h(get)f(this)h(b)o(y)f(noting)h(the)f(v)o(ersion)h(n) o(um)o(b)q(er)g(that)e(is)i(prin)o(ted)g(when)90 536 y(Octa)o(v)o(e)d(starts,)e(or)i(running)h(it)g(with)f(the)h(`)p Fr(-v)p Fv(')e(option.)37 611 y Ft(\017)30 b Fv(A)15 b(complete)h(input)g(\014le)h(that)d(will)j(repro)q(duce)f(the)f(bug.) 90 685 y(A)f(single)i(statemen)o(t)d(ma)o(y)h(not)g(b)q(e)h(enough)f (of)g(an)g(example|the)i(bug)f(migh)o(t)f(dep)q(end)i(on)e(other)g (details)90 747 y(that)g(are)h(missing)h(from)f(the)g(single)i (statemen)o(t)d(where)h(the)h(error)e(\014nally)j(o)q(ccurs.)37 822 y Ft(\017)30 b Fv(The)16 b(command)g(argumen)o(ts)g(y)o(ou)g(ga)o (v)o(e)f(Octa)o(v)o(e)h(to)f(execute)i(that)f(example)h(and)f(observ)o (e)g(the)g(bug.)23 b(T)l(o)90 884 y(guaran)o(tee)14 b(y)o(ou)h(w)o (on't)f(omit)h(something)h(imp)q(ortan)o(t,)e(list)i(all)g(the)g (options.)90 958 y(If)g(w)o(e)f(w)o(ere)g(to)g(try)f(to)h(guess)h(the)f (argumen)o(ts,)f(w)o(e)h(w)o(ould)h(probably)g(guess)f(wrong)g(and)h (then)f(w)o(e)h(w)o(ould)90 1021 y(not)f(encoun)o(ter)g(the)h(bug.)37 1095 y Ft(\017)30 b Fv(The)15 b(t)o(yp)q(e)h(of)e(mac)o(hine)j(y)o(ou)d (are)h(using,)h(and)f(the)g(op)q(erating)h(system)f(name)g(and)g(v)o (ersion)h(n)o(um)o(b)q(er.)37 1170 y Ft(\017)30 b Fv(The)19 b(command-line)i(argumen)o(ts)d(y)o(ou)g(ga)o(v)o(e)g(to)g(the)h Fr(configure)f Fv(command)g(when)i(y)o(ou)e(installed)j(the)90 1232 y(in)o(terpreter.)37 1306 y Ft(\017)30 b Fv(A)15 b(complete)h(list)g(of)f(an)o(y)g(mo)q(di\014cations)h(y)o(ou)f(ha)o(v) o(e)g(made)g(to)g(the)g(in)o(terpreter)g(source.)90 1381 y(Be)h(precise)g(ab)q(out)f(these)g(c)o(hanges|sho)o(w)g(a)g(con)o (text)g(di\013)h(for)e(them.)37 1455 y Ft(\017)30 b Fv(Details)16 b(of)e(an)o(y)h(other)g(deviations)h(from)f(the)g(standard)g(pro)q (cedure)h(for)e(installing)k(Octa)o(v)o(e.)37 1530 y Ft(\017)30 b Fv(A)16 b(description)i(of)e(what)g(b)q(eha)o(vior)g(y)o (ou)g(observ)o(e)g(that)g(y)o(ou)g(b)q(eliev)o(e)i(is)f(incorrect.)23 b(F)l(or)16 b(example,)h Fr(")p Fv(The)90 1592 y(in)o(terpreter)e(gets) g(a)g(fatal)g(signal,)p Fr(")g Fv(or,)g Fr(")p Fv(The)g(output)g(pro)q (duced)h(at)f(line)i(208)d(is)i(incorrect.)p Fr(")90 1666 y Fv(Of)h(course,)f(if)h(the)f(bug)h(is)g(that)f(the)g(in)o (terpreter)h(gets)f(a)g(fatal)g(signal,)h(then)g(one)g(can't)e(miss)i (it.)24 b(But)16 b(if)90 1729 y(the)f(bug)h(is)f(incorrect)h(output,)f (w)o(e)g(migh)o(t)g(not)f(notice)i(unless)h(it)e(is)h(glaringly)g (wrong.)90 1803 y(Ev)o(en)e(if)h(the)f(problem)h(y)o(ou)f(exp)q (erience)i(is)e(a)g(fatal)g(signal,)h(y)o(ou)f(should)h(still)g(sa)o(y) f(so)f(explicitly)l(.)23 b(Supp)q(ose)90 1865 y(something)c(strange)f (is)h(going)f(on,)h(suc)o(h)g(as,)g(y)o(our)f(cop)o(y)g(of)g(the)h(in)o (terpreter)g(is)g(out)f(of)g(sync)o(h,)h(or)f(y)o(ou)90 1928 y(ha)o(v)o(e)c(encoun)o(tered)h(a)f(bug)h(in)g(the)g(C)f(library)i (on)e(y)o(our)g(system.)19 b(Y)l(our)c(cop)o(y)f(migh)o(t)g(crash)h (and)g(the)f(cop)o(y)90 1990 y(here)g(w)o(ould)g(not.)19 b(If)c(y)o(ou)e(said)h(to)g(exp)q(ect)g(a)g(crash,)f(then)h(when)h(the) f(in)o(terpreter)g(here)g(fails)g(to)g(crash,)f(w)o(e)90 2052 y(w)o(ould)g(kno)o(w)f(that)f(the)i(bug)f(w)o(as)g(not)g(happ)q (ening.)20 b(If)13 b(y)o(ou)f(don't)g(sa)o(y)g(to)f(exp)q(ect)i(a)f (crash,)h(then)g(w)o(e)f(w)o(ould)90 2115 y(not)h(kno)o(w)h(whether)g (the)f(bug)h(w)o(as)f(happ)q(ening.)21 b(W)l(e)14 b(w)o(ould)g(not)g(b) q(e)g(able)h(to)e(dra)o(w)g(an)o(y)g(conclusion)j(from)90 2177 y(our)f(observ)m(ations.)90 2251 y(Often)k(the)f(observ)o(ed)h (symptom)e(is)i(incorrect)g(output)f(when)h(y)o(our)f(program)f(is)i (run.)30 b(Unfortunately)l(,)90 2314 y(this)14 b(is)h(not)e(enough)i (information)f(unless)h(the)f(program)f(is)h(short)g(and)g(simple.)21 b(It)14 b(is)g(v)o(ery)g(helpful)i(if)e(y)o(ou)90 2376 y(can)h(include)j(an)d(explanation)h(of)f(the)g(exp)q(ected)i(output,)d (and)i(wh)o(y)f(the)g(actual)g(output)g(is)h(incorrect.)37 2450 y Ft(\017)30 b Fv(If)17 b(y)o(ou)g(wish)g(to)f(suggest)g(c)o (hanges)h(to)f(the)h(Octa)o(v)o(e)f(source,)h(send)h(them)f(as)f(con)o (text)g(di\013s.)25 b(If)17 b(y)o(ou)g(ev)o(en)90 2513 y(discuss)d(something)g(in)g(the)g(Octa)o(v)o(e)f(source,)g(refer)g(to) g(it)h(b)o(y)f(con)o(text,)g(not)g(b)o(y)g(line)i(n)o(um)o(b)q(er,)f(b) q(ecause)g(the)90 2575 y(line)j(n)o(um)o(b)q(ers)e(in)h(the)g(dev)o (elopmen)o(t)g(sources)f(probalb)o(y)g(w)o(on't)f(matc)o(h)h(those)g (in)h(y)o(our)e(sources.)62 2670 y(Here)i(are)f(some)f(things)i(that)f (are)f(not)h(necessary:)p eop %%Page: 171 173 171 172 bop 0 -58 a Fv(App)q(endix)17 b(B:)e(Kno)o(wn)h(Causes)f(of)f (T)l(rouble)i(with)g(Octa)o(v)o(e)845 b(171)37 183 y Ft(\017)30 b Fv(A)15 b(description)i(of)e(the)g(en)o(v)o(elop)q(e)h(of) f(the)g(bug.)90 264 y(Often)e(p)q(eople)i(who)d(encoun)o(ter)h(a)g(bug) g(sp)q(end)h(a)e(lot)h(of)g(time)g(in)o(v)o(estigating)g(whic)o(h)h(c)o (hanges)f(to)f(the)h(input)90 327 y(\014le)h(will)g(mak)o(e)e(the)h (bug)g(go)f(a)o(w)o(a)o(y)g(and)h(whic)o(h)g(c)o(hanges)g(will)h(not)f (a\013ect)f(it.)19 b(Suc)o(h)13 b(information)g(is)h(usually)90 389 y(not)19 b(necessary)h(to)e(enable)j(us)f(to)e(\014x)i(bugs)f(in)i (Octa)o(v)o(e,)e(but)h(if)g(y)o(ou)f(can)g(\014nd)i(a)e(simpler)h (example)h(to)90 451 y(rep)q(ort)14 b Fp(instead)j Fv(of)d(the)h (original)h(one,)e(that)g(is)h(a)f(con)o(v)o(enience.)21 b(Errors)14 b(in)h(the)g(output)f(will)i(b)q(e)g(easier)f(to)90 514 y(sp)q(ot,)h(running)h(under)g(the)f(debugger)g(will)i(tak)o(e)e (less)g(time,)h(etc.)22 b(Most)15 b(Octa)o(v)o(e)h(bugs)g(in)o(v)o(olv) o(e)h(just)f(one)90 576 y(function,)g(so)f(the)h(most)f(straigh)o (tforw)o(ard)e(w)o(a)o(y)i(to)g(simplify)i(an)f(example)g(is)g(to)f (delete)i(all)f(the)g(function)90 638 y(de\014nitions)h(except)f(the)f (one)g(in)h(whic)o(h)g(the)g(bug)f(o)q(ccurs.)90 719 y(Ho)o(w)o(ev)o(er,)g(simpli\014cation)k(is)e(not)f(vital;)i(if)f(y)o (ou)f(don't)g(w)o(an)o(t)f(to)h(do)g(this,)h(rep)q(ort)f(the)h(bug)g (an)o(yw)o(a)o(y)e(and)90 782 y(send)h(the)f(en)o(tire)h(test)e(case)i (y)o(ou)e(used.)37 863 y Ft(\017)30 b Fv(A)15 b(patc)o(h)g(for)g(the)g (bug.)21 b(P)o(atc)o(hes)14 b(can)i(b)q(e)f(helpful,)i(but)f(if)f(y)o (ou)g(\014nd)h(a)f(bug,)g(y)o(ou)g(should)i(rep)q(ort)d(it,)i(ev)o(en) 90 925 y(if)g(y)o(ou)f(cannot)g(send)g(a)g(\014x)h(for)e(the)h (problem.)0 1084 y Fu(B.6)33 b(Sending)16 b(P)n(atc)n(hes)f(for)g(Octa) n(v)n(e)62 1194 y Fv(If)g(y)o(ou)e(w)o(ould)i(lik)o(e)g(to)e(write)h (bug)g(\014xes)h(or)e(impro)o(v)o(emen)o(ts)h(for)f(Octa)o(v)o(e,)h (that)f(is)i(v)o(ery)e(helpful.)22 b(When)14 b(y)o(ou)0 1256 y(send)g(y)o(our)f(c)o(hanges,)h(please)g(follo)o(w)g(these)g (guidelines)i(to)d(a)o(v)o(oid)g(causing)h(extra)f(w)o(ork)g(for)g(us)g (in)i(studying)f(the)0 1319 y(patc)o(hes.)62 1408 y(If)g(y)o(ou)g (don't)f(follo)o(w)h(these)g(guidelines,)i(y)o(our)d(information)h (migh)o(t)g(still)h(b)q(e)f(useful,)h(but)f(using)g(it)g(will)i(tak)o (e)0 1470 y(extra)h(w)o(ork.)25 b(Main)o(taining)18 b(Octa)o(v)o(e)f (is)g(a)g(lot)g(of)g(w)o(ork)g(in)h(the)f(b)q(est)h(of)e (circumstances,)j(and)e(w)o(e)g(can't)g(k)o(eep)0 1533 y(up)f(unless)g(y)o(ou)f(do)g(y)o(our)g(b)q(est)g(to)g(help.)37 1622 y Ft(\017)30 b Fv(Send)18 b(an)f(explanation)h(with)f(y)o(our)g(c) o(hanges)g(of)g(what)f(problem)i(they)f(\014x)g(or)g(what)f(impro)o(v)o (emen)o(t)h(they)90 1685 y(bring)e(ab)q(out.)20 b(F)l(or)14 b(a)h(bug)g(\014x,)f(just)h(include)i(a)e(cop)o(y)f(of)h(the)g(bug)g (rep)q(ort,)f(and)h(explain)h(wh)o(y)f(the)g(c)o(hange)90 1747 y(\014xes)h(the)f(bug.)37 1828 y Ft(\017)30 b Fv(Alw)o(a)o(ys)18 b(include)j(a)e(prop)q(er)g(bug)g(rep)q(ort)f(for)g(the)h(problem)g(y)o (ou)g(think)g(y)o(ou)g(ha)o(v)o(e)f(\014xed.)31 b(W)l(e)19 b(need)h(to)90 1890 y(con)o(vince)f(ourselv)o(es)g(that)e(the)h(c)o (hange)g(is)h(righ)o(t)f(b)q(efore)g(installing)i(it.)29 b(Ev)o(en)18 b(if)g(it)h(is)f(righ)o(t,)g(w)o(e)g(migh)o(t)90 1953 y(ha)o(v)o(e)d(trouble)g(judging)h(it)g(if)f(w)o(e)g(don't)g(ha)o (v)o(e)g(a)g(w)o(a)o(y)f(to)h(repro)q(duce)h(the)f(problem.)37 2034 y Ft(\017)30 b Fv(Include)17 b(all)f(the)f(commen)o(ts)g(that)f (are)h(appropriate)g(to)f(help)j(p)q(eople)f(reading)g(the)f(source)g (in)h(the)f(future)90 2096 y(understand)h(wh)o(y)f(this)g(c)o(hange)h (w)o(as)e(needed.)37 2177 y Ft(\017)30 b Fv(Don't)14 b(mix)i(together)e(c)o(hanges)h(made)h(for)e(di\013eren)o(t)i(reasons.) j(Send)d(them)f Fp(individual)q(ly)p Fv(.)90 2258 y(If)i(y)o(ou)g(mak)o (e)f(t)o(w)o(o)g(c)o(hanges)h(for)f(separate)h(reasons,)f(then)i(w)o(e) e(migh)o(t)h(not)g(w)o(an)o(t)f(to)g(install)i(them)f(b)q(oth.)90 2321 y(W)l(e)e(migh)o(t)g(w)o(an)o(t)f(to)h(install)i(just)e(one.)37 2402 y Ft(\017)30 b Fv(Use)13 b(`)p Fr(diff)h(-c)p Fv(')e(to)g(mak)o(e) g(y)o(our)g(di\013s.)19 b(Di\013s)13 b(without)f(con)o(text)g(are)g (hard)h(for)f(us)h(to)f(install)i(reliably)l(.)21 b(More)90 2464 y(than)d(that,)h(they)f(mak)o(e)h(it)f(hard)h(for)f(us)h(to)f (study)g(the)h(di\013s)g(to)f(decide)i(whether)f(w)o(e)f(w)o(an)o(t)g (to)g(install)90 2527 y(them.)i(Unidi\013)c(format)e(is)i(b)q(etter)f (than)g(con)o(textless)h(di\013s,)f(but)g(not)g(as)g(easy)g(to)f(read)h (as)g(`)p Fr(-c)p Fv(')f(format.)90 2608 y(If)h(y)o(ou)g(ha)o(v)o(e)f (GNU)h(di\013,)g(use)g(`)p Fr(diff)f(-cp)p Fv(',)g(whic)o(h)i(sho)o(ws) e(the)h(name)g(of)f(the)h(function)h(that)e(eac)o(h)h(c)o(hange)90 2670 y(o)q(ccurs)h(in.)p eop %%Page: 172 174 172 173 bop 0 -58 a Fv(172)1743 b(Octa)o(v)o(e)37 183 y Ft(\017)30 b Fv(W)l(rite)15 b(the)h(c)o(hange)f(log)g(en)o(tries)h (for)e(y)o(our)h(c)o(hanges.)90 258 y(Read)e(the)g(`)p Fr(ChangeLog)p Fv(')e(\014le)j(to)e(see)h(what)f(sorts)g(of)g (information)h(to)f(put)h(in,)h(and)f(to)f(learn)h(the)g(st)o(yle)g (that)90 320 y(w)o(e)i(use.)21 b(The)15 b(purp)q(ose)h(of)f(the)g(c)o (hange)h(log)f(is)h(to)f(sho)o(w)f(p)q(eople)j(where)f(to)e(\014nd)i (what)f(w)o(as)g(c)o(hanged.)20 b(So)90 382 y(y)o(ou)13 b(need)i(to)e(b)q(e)i(sp)q(eci\014c)h(ab)q(out)d(what)g(functions)i(y)o (ou)f(c)o(hanged;)g(in)g(large)g(functions,)h(it's)e(often)h(helpful)90 445 y(to)h(indicate)h(where)g(within)g(the)f(function)h(the)g(c)o (hange)f(w)o(as)f(made.)90 519 y(On)f(the)f(other)g(hand,)h(once)g(y)o (ou)f(ha)o(v)o(e)g(sho)o(wn)f(p)q(eople)j(where)f(to)e(\014nd)i(the)g (c)o(hange,)f(y)o(ou)g(need)h(not)f(explain)90 582 y(its)18 b(purp)q(ose.)27 b(Th)o(us,)18 b(if)g(y)o(ou)f(add)g(a)h(new)f (function,)i(all)f(y)o(ou)f(need)i(to)e(sa)o(y)f(ab)q(out)i(it)g(is)g (that)e(it)i(is)g(new.)90 644 y(If)g(y)o(ou)f(feel)i(that)e(the)g(purp) q(ose)i(needs)f(explaining,)i(it)e(probably)g(do)q(es|but)h(the)e (explanation)i(will)g(b)q(e)90 706 y(m)o(uc)o(h)c(more)g(useful)h(if)g (y)o(ou)f(put)g(it)h(in)g(commen)o(ts)e(in)i(the)g(co)q(de.)90 781 y(If)i(y)o(ou)f(w)o(ould)h(lik)o(e)h(y)o(our)e(name)g(to)g(app)q (ear)h(in)g(the)g(header)g(line)h(for)e(who)h(made)f(the)h(c)o(hange,)g (send)g(us)90 843 y(the)d(header)h(line.)0 976 y Fu(B.7)33 b(Ho)n(w)14 b(T)-6 b(o)15 b(Get)g(Help)g(with)h(Octa)n(v)n(e)62 1080 y Fv(If)g(y)o(ou)f(need)h(help)g(installing,)h(using)f(or)f(c)o (hanging)g(Octa)o(v)o(e,)g(the)g(mailing)i(list)120 1150 y Fr(help-octave@che.utexas.edu)62 1233 y Fv(exists)h(for)e(the)h (discussion)i(of)e(Octa)o(v)o(e)g(matters)f(related)h(to)g(using,)h (installing,)h(and)e(p)q(orting)g(Octa)o(v)o(e.)26 b(If)0 1296 y(y)o(ou)15 b(w)o(ould)g(lik)o(e)i(to)d(join)i(the)f(discussion,)i (please)f(send)g(a)f(short)f(note)h(to)120 1366 y Fr (help-octave-request@che.ut)o(exas.ed)o(u)406 1416 y(^^^^^^^)62 1499 y Fm(Please)i(do)f(not)f Fv(send)h(requests)g(to)f(b)q(e)h(added)g (or)f(remo)o(v)o(ed)g(from)g(the)h(the)g(mailing)h(list,)f(or)f(other)g (admin-)0 1561 y(istrativ)o(e)g(trivia)h(to)e(the)i(list)g(itself.)p eop %%Page: 173 175 173 174 bop 0 -58 a Fv(App)q(endix)17 b(C:)e(Command)g(Line)h(Editing) 1146 b(173)0 183 y Fs(App)r(endix)13 b(C)41 b(Command)12 b(Line)j(Editing)62 310 y Fv(This)i(text)f(describ)q(es)h(GNU's)f (command)g(line)i(editing)f(in)o(terface.)23 b(It)16 b(is)h(relativ)o(ely)g(old)g(and)f(ma)o(y)g(not)f(b)q(e)0 372 y(en)o(tirely)f(correct)e(no)o(w.)18 b(Please)13 b(send)g(a)g(message)f(to)f Fr(bug-octave@che.utexas.edu)f Fv(if)j(y)o(ou)f(\014nd)h(an)o(y)f(errors.)0 434 y(See)k(Section)g(B.2) f([Rep)q(orting)g(Bugs],)g(page)g(168,)f(for)g(more)h(information)h(ab) q(out)f(ho)o(w)f(to)h(rep)q(ort)g(bugs.)0 564 y Fu(C.1)32 b(In)n(tro)r(duction)18 b(to)d(Line)h(Editing)62 667 y Fv(The)g(follo)o(wing)g(paragraphs)e(describ)q(e)j(the)e(notation)g (w)o(e)g(use)g(to)g(represen)o(t)g(k)o(eystrok)o(es.)62 750 y(The)g(text)e Fr(C-K)h Fv(is)g(read)g(as)g(`Con)o(trol-K')f(and)h (describ)q(es)i(the)e(c)o(haracter)f(pro)q(duced)i(when)g(the)f(Con)o (trol)f(k)o(ey)0 813 y(is)j(depressed)g(and)f(the)h Fr(K)f Fv(k)o(ey)g(is)g(struc)o(k.)62 896 y(The)i(text)f Fr(M-K)g Fv(is)i(read)e(as)g(`Meta-K')g(and)h(describ)q(es)h(the)f(c)o(haracter) f(pro)q(duced)h(when)h(the)e(meta)g(k)o(ey)h(\(if)0 958 y(y)o(ou)g(ha)o(v)o(e)f(one\))h(is)g(depressed,)h(and)f(the)g Fr(K)g Fv(k)o(ey)g(is)g(struc)o(k.)25 b(If)17 b(y)o(ou)f(do)h(not)g(ha) o(v)o(e)f(a)h(meta)f(k)o(ey)l(,)h(the)g(iden)o(tical)0 1020 y(k)o(eystrok)o(e)i(can)g(b)q(e)i(generated)e(b)o(y)h(t)o(yping)f Fr(ESC)h Fp(\014rst)p Fv(,)g(and)f(then)h(t)o(yping)g Fr(K)p Fv(.)33 b(Either)20 b(pro)q(cess)g(is)g(kno)o(wn)f(as)0 1083 y Fp(metafying)g Fv(the)c Fr(K)g Fv(k)o(ey)l(.)62 1166 y(The)h(text)e Fr(M-C-K)g Fv(is)i(read)f(as)f(`Meta-Con)o(trol-k') g(and)h(describ)q(es)h(the)g(c)o(haracter)e(pro)q(duced)i(b)o(y)f Fp(metafying)0 1228 y Fr(C-K)p Fv(.)62 1311 y(In)i(addition,)h(sev)o (eral)e(k)o(eys)g(ha)o(v)o(e)g(their)h(o)o(wn)f(names.)23 b(Sp)q(eci\014cally)m(,)c Fr(DEL)p Fv(,)d Fr(ESC)p Fv(,)f Fr(LFD)p Fv(,)h Fr(SPC)p Fv(,)g Fr(RET)p Fv(,)g(and)g Fr(TAB)0 1373 y Fv(all)k(stand)e(for)g(themselv)o(es)i(when)f(seen)g (in)h(this)f(text,)g(or)f(in)i(an)e(init)i(\014le)g(\(see)f(Section)g (C.7)f([Readline)j(Init)0 1435 y(File],)16 b(page)f(175,)f(for)g(more)h (info\).)0 1565 y Fu(C.2)32 b(Readline)17 b(In)n(teraction)62 1669 y Fv(Often)f(during)h(an)f(in)o(teractiv)o(e)g(session)h(y)o(ou)e (t)o(yp)q(e)h(in)h(a)f(long)g(line)h(of)f(text,)f(only)h(to)g(notice)g (that)f(the)h(\014rst)0 1731 y(w)o(ord)d(on)i(the)f(line)i(is)e(missp)q (elled.)23 b(The)14 b(Readline)i(library)f(giv)o(es)g(y)o(ou)e(a)h(set) g(of)g(commands)g(for)f(manipulating)0 1793 y(the)18 b(text)g(as)g(y)o(ou)g(t)o(yp)q(e)g(it)h(in,)g(allo)o(wing)g(y)o(ou)f (to)g(just)g(\014x)g(y)o(our)g(t)o(yp)q(o,)g(and)h(not)f(forcing)g(y)o (ou)g(to)g(ret)o(yp)q(e)g(the)0 1856 y(ma)s(jorit)o(y)d(of)h(the)g (line.)25 b(Using)17 b(these)g(editing)h(commands,)e(y)o(ou)g(mo)o(v)o (e)f(the)i(cursor)f(to)g(the)g(place)h(that)f(needs)0 1918 y(correction,)g(and)h(delete)g(or)f(insert)g(the)h(text)e(of)h (the)g(corrections.)23 b(Then,)17 b(when)g(y)o(ou)f(are)g(satis\014ed)g (with)h(the)0 1980 y(line,)h(y)o(ou)e(simply)i(press)f Fr(RETURN)p Fv(.)23 b(Y)l(ou)17 b(do)f(not)g(ha)o(v)o(e)g(to)g(b)q(e)i (at)e(the)g(end)h(of)f(the)h(line)h(to)e(press)h Fr(RETURN)p Fv(;)f(the)0 2042 y(en)o(tire)g(line)h(is)e(accepted)h(regardless)f(of) g(the)g(lo)q(cation)h(of)f(the)h(cursor)e(within)j(the)e(line.)0 2172 y Fu(C.3)32 b(Readline)17 b(Bare)e(Essen)n(tials)62 2276 y Fv(In)f(order)f(to)f(en)o(ter)h(c)o(haracters)g(in)o(to)g(the)g (line,)i(simply)f(t)o(yp)q(e)f(them.)19 b(The)14 b(t)o(yp)q(ed)f(c)o (haracter)f(app)q(ears)i(where)0 2338 y(the)h(cursor)h(w)o(as,)e(and)h (then)h(the)g(cursor)f(mo)o(v)o(es)f(one)i(space)g(to)e(the)i(righ)o (t.)k(If)c(y)o(ou)f(mist)o(yp)q(e)h(a)f(c)o(haracter,)f(y)o(ou)0 2400 y(can)h(use)h Fr(DEL)f Fv(to)f(bac)o(k)h(up,)h(and)f(delete)h(the) f(mist)o(yp)q(ed)h(c)o(haracter.)62 2483 y(Sometimes)f(y)o(ou)e(ma)o(y) h(miss)g(t)o(yping)g(a)g(c)o(haracter)g(that)f(y)o(ou)h(w)o(an)o(ted)f (to)g(t)o(yp)q(e,)h(and)h(not)e(notice)i(y)o(our)f(error)0 2545 y(un)o(til)k(y)o(ou)e(ha)o(v)o(e)g(t)o(yp)q(ed)h(sev)o(eral)g (other)f(c)o(haracters.)23 b(In)18 b(that)d(case,)i(y)o(ou)f(can)h(t)o (yp)q(e)g Fr(C-B)f Fv(to)g(mo)o(v)o(e)g(the)g(cursor)0 2608 y(to)f(the)h(left,)g(and)g(then)g(correct)f(y)o(our)h(mistak)o(e.) 21 b(Afterw)o(ards,)14 b(y)o(ou)i(can)g(mo)o(v)o(e)f(the)h(cursor)f(to) g(the)h(righ)o(t)g(with)0 2670 y Fr(C-F)p Fv(.)p eop %%Page: 174 176 174 175 bop 0 -58 a Fv(174)1743 b(Octa)o(v)o(e)62 183 y(When)18 b(y)o(ou)f(add)g(text)g(in)h(the)f(middle)i(of)e(a)g(line,)i (y)o(ou)e(will)i(notice)e(that)g(c)o(haracters)f(to)h(the)g(righ)o(t)g (of)g(the)0 246 y(cursor)h(get)g(`pushed)i(o)o(v)o(er')d(to)h(mak)o(e)g (ro)q(om)g(for)g(the)h(text)f(that)g(y)o(ou)g(ha)o(v)o(e)h(inserted.)31 b(Lik)o(ewise,)20 b(when)f(y)o(ou)0 308 y(delete)f(text)f(b)q(ehind)j (the)d(cursor,)g(c)o(haracters)f(to)h(the)g(righ)o(t)h(of)e(the)i (cursor)f(get)g(`pulled)i(bac)o(k')d(to)h(\014ll)i(in)f(the)0 370 y(blank)g(space)f(created)g(b)o(y)g(the)h(remo)o(v)m(al)f(of)f(the) i(text.)25 b(A)17 b(list)h(of)e(the)h(basic)h(bare)f(essen)o(tials)h (for)e(editing)j(the)0 432 y(text)c(of)f(an)i(input)g(line)h(follo)o (ws.)0 527 y Fr(C-B)168 b Fv(Mo)o(v)o(e)14 b(bac)o(k)h(one)h(c)o (haracter.)0 614 y Fr(C-F)168 b Fv(Mo)o(v)o(e)14 b(forw)o(ard)g(one)h (c)o(haracter.)0 701 y Fr(DEL)168 b Fv(Delete)16 b(the)f(c)o(haracter)g (to)f(the)h(left)h(of)f(the)g(cursor.)0 787 y Fr(C-D)168 b Fv(Delete)16 b(the)f(c)o(haracter)g(underneath)h(the)f(cursor.)0 874 y(Prin)o(ting)h(c)o(haracters)240 936 y(Insert)f(itself)i(in)o(to)e (the)g(line)i(at)d(the)i(cursor.)0 1023 y Fr(C-_)168 b Fv(Undo)15 b(the)h(last)f(thing)h(that)e(y)o(ou)h(did.)21 b(Y)l(ou)15 b(can)h(undo)f(all)h(the)g(w)o(a)o(y)e(bac)o(k)h(to)f(an)i (empt)o(y)e(line.)0 1155 y Fu(C.4)32 b(Readline)17 b(Mo)n(v)n(emen)n(t) c(Comm)o(a)o(nds)62 1259 y Fv(The)f(ab)q(o)o(v)o(e)g(table)g(describ)q (es)i(the)e(most)f(basic)h(p)q(ossible)i(k)o(eystrok)o(es)d(that)g(y)o (ou)g(need)i(in)g(order)f(to)f(do)h(editing)0 1321 y(of)g(the)h(input)h (line.)21 b(F)l(or)12 b(y)o(our)g(con)o(v)o(enience,)i(man)o(y)f(other) f(commands)h(ha)o(v)o(e)f(b)q(een)i(added)f(in)h(addition)g(to)e Fr(C-B)p Fv(,)0 1383 y Fr(C-F)p Fv(,)i Fr(C-D)p Fv(,)h(and)g Fr(DEL)p Fv(.)20 b(Here)15 b(are)g(some)g(commands)g(for)f(mo)o(ving)h (more)g(rapidly)i(ab)q(out)e(the)g(line.)0 1479 y Fr(C-A)168 b Fv(Mo)o(v)o(e)14 b(to)h(the)g(start)f(of)h(the)g(line.)0 1565 y Fr(C-E)168 b Fv(Mo)o(v)o(e)14 b(to)h(the)g(end)h(of)f(the)g (line.)0 1652 y Fr(M-F)168 b Fv(Mo)o(v)o(e)14 b(forw)o(ard)g(a)h(w)o (ord.)0 1738 y Fr(M-B)168 b Fv(Mo)o(v)o(e)14 b(bac)o(kw)o(ard)h(a)g(w)o (ord.)0 1825 y Fr(C-L)168 b Fv(Clear)15 b(the)h(screen,)f(reprin)o (ting)h(the)f(curren)o(t)g(line)i(at)e(the)g(top.)62 1920 y(Notice)22 b(ho)o(w)e Fr(C-F)h Fv(mo)o(v)o(es)f(forw)o(ard)g(a)g (c)o(haracter,)i(while)g Fr(M-F)f Fv(mo)o(v)o(es)f(forw)o(ard)g(a)h(w)o (ord.)36 b(It)21 b(is)h(a)f(lo)q(ose)0 1982 y(con)o(v)o(en)o(tion)15 b(that)g(con)o(trol)g(k)o(eystrok)o(es)f(op)q(erate)h(on)g(c)o (haracters)f(while)j(meta)e(k)o(eystrok)o(es)f(op)q(erate)h(on)g(w)o (ords.)0 2115 y Fu(C.5)32 b(Readline)17 b(Killing)g(Comm)o(a)o(nds)62 2218 y Fp(Killing)22 b Fv(text)14 b(means)h(to)f(delete)h(the)g(text)f (from)g(the)h(line,)h(but)f(to)f(sa)o(v)o(e)g(it)h(a)o(w)o(a)o(y)e(for) h(later)h(use,)g(usually)h(b)o(y)0 2281 y Fp(y)o(anking)21 b Fv(it)c(bac)o(k)g(in)o(to)g(the)g(line.)27 b(If)18 b(the)f(description)h(for)f(a)g(command)f(sa)o(ys)h(that)f(it)h (`kills')h(text,)f(then)g(y)o(ou)0 2343 y(can)e(b)q(e)h(sure)g(that)e (y)o(ou)h(can)g(get)g(the)g(text)g(bac)o(k)g(in)h(a)f(di\013eren)o(t)g (\(or)g(the)g(same\))g(place)h(later.)62 2426 y(Here)g(is)f(the)h(list) g(of)e(commands)h(for)g(killing)j(text.)0 2521 y Fr(C-K)168 b Fv(Kill)17 b(the)f(text)e(from)h(the)g(curren)o(t)g(cursor)g(p)q (osition)h(to)f(the)g(end)h(of)f(the)g(line.)0 2608 y Fr(M-D)168 b Fv(Kill)17 b(from)d(the)h(cursor)g(to)f(the)h(end)g(of)g (the)g(curren)o(t)f(w)o(ord,)g(or)g(if)i(b)q(et)o(w)o(een)f(w)o(ords,)f (to)g(the)h(end)g(of)240 2670 y(the)g(next)h(w)o(ord.)p eop %%Page: 175 177 175 176 bop 0 -58 a Fv(App)q(endix)17 b(C:)e(Command)g(Line)h(Editing) 1146 b(175)0 183 y Fr(M-DEL)120 b Fv(Kill)16 b(from)d(the)h(cursor)f (to)g(the)h(start)f(of)g(the)h(previous)h(w)o(ord,)e(or)g(if)h(b)q(et)o (w)o(een)g(w)o(ords,)f(to)g(the)h(start)240 246 y(of)h(the)g(previous)h (w)o(ord.)0 333 y Fr(C-W)168 b Fv(Kill)18 b(from)e(the)g(cursor)g(to)f (the)h(previous)h(whitespace.)24 b(This)17 b(is)f(di\013eren)o(t)h (than)f Fr(M-DEL)f Fv(b)q(ecause)240 396 y(the)g(w)o(ord)g(b)q (oundaries)h(di\013er.)62 492 y(And,)g(here)f(is)h(ho)o(w)f(to)f Fp(y)o(ank)k Fv(the)d(text)g(bac)o(k)g(in)o(to)g(the)g(line.)22 b(Y)l(anking)16 b(is)0 588 y Fr(C-Y)168 b Fv(Y)l(ank)15 b(the)h(most)e(recen)o(tly)i(killed)h(text)e(bac)o(k)g(in)o(to)g(the)h (bu\013er)f(at)f(the)i(cursor.)0 676 y Fr(M-Y)168 b Fv(Rotate)13 b(the)h(kill-ring,)i(and)e(y)o(ank)g(the)g(new)g(top.)19 b(Y)l(ou)14 b(can)g(only)g(do)g(this)g(if)g(the)g(prior)g(command)240 738 y(is)i Fr(C-Y)e Fv(or)h Fr(M-Y)p Fv(.)62 834 y(When)h(y)o(ou)f(use) g(a)g(kill)i(command,)e(the)h(text)e(is)i(sa)o(v)o(ed)f(in)h(a)f Fp(kill-ring)p Fv(.)22 b(An)o(y)16 b(n)o(um)o(b)q(er)f(of)g(consecutiv) o(e)h(kills)0 896 y(sa)o(v)o(e)g(all)i(of)e(the)g(killed)j(text)e (together,)e(so)i(that)f(when)h(y)o(ou)f(y)o(ank)g(it)h(bac)o(k,)g(y)o (ou)f(get)g(it)h(in)h(one)f(clean)g(sw)o(eep.)0 958 y(The)f(kill)i (ring)f(is)f(not)g(line)i(sp)q(eci\014c;)g(the)e(text)g(that)f(y)o(ou)h (killed)j(on)d(a)f(previously)j(t)o(yp)q(ed)e(line)i(is)f(a)o(v)m (ailable)h(to)0 1021 y(b)q(e)e(y)o(ank)o(ed)f(bac)o(k)g(later,)g(when)g (y)o(ou)g(are)g(t)o(yping)h(another)e(line.)0 1155 y Fu(C.6)32 b(Readline)17 b(Argumen)n(ts)62 1259 y Fv(Y)l(ou)i(can)g (pass)f(n)o(umeric)i(argumen)o(ts)d(to)h(Readline)j(commands.)30 b(Sometimes)19 b(the)f(argumen)o(t)g(acts)g(as)g(a)0 1321 y(rep)q(eat)f(coun)o(t,)f(other)g(times)g(it)h(is)g(the)g Fp(sign)f Fv(of)g(the)h(argumen)o(t)f(that)f(is)i(signi\014can)o(t.)25 b(If)16 b(y)o(ou)h(pass)f(a)g(negativ)o(e)0 1383 y(argumen)o(t)g(to)g (a)h(command)g(whic)o(h)h(normally)f(acts)g(in)h(a)e(forw)o(ard)g (direction,)i(that)f(command)f(will)j(act)d(in)i(a)0 1446 y(bac)o(kw)o(ard)13 b(direction.)21 b(F)l(or)13 b(example,)h(to)f(kill)i(text)e(bac)o(k)h(to)f(the)h(start)e(of)h(the)h (line,)h(y)o(ou)e(migh)o(t)h(t)o(yp)q(e)g Fr(M--)f(C-K)p Fv(.)62 1529 y(The)19 b(general)g(w)o(a)o(y)f(to)g(pass)g(n)o(umeric)i (argumen)o(ts)e(to)g(a)g(command)h(is)g(to)f(t)o(yp)q(e)g(meta)g (digits)i(b)q(efore)f(the)0 1591 y(command.)36 b(If)21 b(the)g(\014rst)f(`digit')h(y)o(ou)g(t)o(yp)q(e)f(is)i(a)e(min)o(us)h (sign)g(\()p Fr(-)p Fv(\),)g(then)g(the)g(sign)g(of)g(the)f(argumen)o (t)g(will)0 1653 y(b)q(e)i(negativ)o(e.)40 b(Once)22 b(y)o(ou)f(ha)o(v)o(e)h(t)o(yp)q(ed)g(one)f(meta)g(digit)i(to)e(get)g (the)h(argumen)o(t)f(started,)h(y)o(ou)f(can)h(t)o(yp)q(e)0 1716 y(the)c(remainder)h(of)f(the)g(digits,)h(and)f(then)h(the)f (command.)29 b(F)l(or)17 b(example,)i(to)f(giv)o(e)g(the)g Fr(C-D)g Fv(command)g(an)0 1778 y(argumen)o(t)c(of)h(10,)f(y)o(ou)h (could)h(t)o(yp)q(e)g Fr(M-1)23 b(0)h(C-D)p Fv(.)0 1912 y Fu(C.7)32 b(Readline)17 b(Init)f(File)62 2016 y Fv(Although)j(the)f (Readline)i(library)f(comes)f(with)g(a)g(set)g(of)f(Emacs-lik)o(e)i(k)o (eybindings,)h(it)e(is)h(p)q(ossible)h(that)0 2078 y(y)o(ou)13 b(w)o(ould)h(lik)o(e)g(to)f(use)h(a)f(di\013eren)o(t)g(set)g(of)g(k)o (eybindings.)21 b(Y)l(ou)14 b(can)f(customize)h(programs)e(that)h(use)h (Readline)0 2141 y(b)o(y)h(putting)g(commands)f(in)i(an)e Fp(init)j Fv(\014le)f(in)f(y)o(our)f(home)h(directory)l(.)20 b(The)15 b(name)f(of)h(this)g(\014le)g(is)g(`)p Fr(~/.inputrc)p Fv('.)62 2224 y(When)j(a)e(program)g(whic)o(h)i(uses)f(the)g(Readline)i (library)f(starts)d(up,)j(the)f(`)p Fr(~/.inputrc)p Fv(')e(\014le)i(is) h(read,)f(and)0 2286 y(the)e(k)o(eybindings)i(are)e(set.)62 2370 y(In)j(addition,)g(the)f Fr(C-X)23 b(C-R)16 b Fv(command)h (re-reads)g(this)g(init)h(\014le,)g(th)o(us)f(incorp)q(orating)g(an)o (y)g(c)o(hanges)g(that)0 2432 y(y)o(ou)e(migh)o(t)g(ha)o(v)o(e)g(made)g (to)f(it.)0 2566 y Fu(C.8)32 b(Readline)17 b(Init)f(Syn)n(tax)62 2670 y Fv(There)g(are)f(only)g(four)g(constructs)g(allo)o(w)o(ed)h(in)g (the)f(`)p Fr(~/.inputrc)p Fv(')e(\014le:)p eop %%Page: 176 178 176 177 bop 0 -58 a Fv(176)1743 b(Octa)o(v)o(e)0 183 y(V)l(ariable)16 b(Settings)240 246 y(Y)l(ou)f(can)g(c)o(hange)h(the)f (state)f(of)h(a)f(few)h(v)m(ariables)i(in)f(Readline.)22 b(Y)l(ou)15 b(do)g(this)g(b)o(y)g(using)h(the)f Fr(set)240 308 y Fv(command)h(within)i(the)f(init)g(\014le.)25 b(Here)17 b(is)g(ho)o(w)f(y)o(ou)g(w)o(ould)h(sp)q(ecify)h(that)d(y)o(ou)i(wish)g (to)e(use)i(Vi)240 370 y(line)g(editing)f(commands:)360 438 y Fr(set)23 b(editing-mode)g(vi)240 519 y Fv(Righ)o(t)15 b(no)o(w,)e(there)i(are)f(only)h(a)f(few)g(v)m(ariables)h(whic)o(h)g (can)g(b)q(e)g(set;)f(so)g(few)g(in)h(fact,)f(that)f(w)o(e)h(just)240 581 y(iterate)h(them)g(here:)240 680 y Fr(editing-mode)480 743 y Fv(The)21 b Fr(editing-mode)e Fv(v)m(ariable)k(con)o(trols)d (whic)o(h)i(editing)g(mo)q(de)f(y)o(ou)g(are)g(using.)480 805 y(By)f(default,)i(GNU)d(Readline)k(starts)18 b(up)j(in)g(Emacs)e (editing)j(mo)q(de,)f(where)f(the)480 867 y(k)o(eystrok)o(es)d(are)g (most)g(similar)i(to)e(Emacs.)28 b(This)18 b(v)m(ariable)h(can)f (either)h(b)q(e)f(set)g(to)480 929 y Fr(emacs)c Fv(or)h Fr(vi)p Fv(.)240 1029 y Fr(horizontal-scroll-mode)480 1091 y Fv(This)j(v)m(ariable)g(can)f(either)g(b)q(e)h(set)f(to)f Fr(On)h Fv(or)f Fr(Off)p Fv(.)25 b(Setting)17 b(it)g(to)f Fr(On)h Fv(means)g(that)480 1153 y(the)d(text)g(of)f(the)h(lines)i (that)d(y)o(ou)h(edit)h(will)g(scroll)g(horizon)o(tally)g(on)f(a)g (single)h(screen)480 1215 y(line)g(when)e(they)g(are)g(larger)g(than)g (the)g(width)h(of)e(the)i(screen,)f(instead)h(of)f(wrapping)480 1278 y(on)o(to)h(a)h(new)h(screen)f(line.)22 b(By)15 b(default,)h(this)f(v)m(ariable)i(is)f(set)e(to)h Fr(Off)p Fv(.)240 1377 y Fr(mark-modified-lines)480 1439 y Fv(This)g(v)m (ariable)i(when)e(set)f(to)g Fr(On)p Fv(,)h(sa)o(ys)f(to)g(displa)o(y)i (an)e(asterisk)h(\(`)p Fr(*)p Fv('\))e(at)h(the)h(starts)480 1501 y(of)g(history)g(lines)i(whic)o(h)f(ha)o(v)o(e)f(b)q(een)h(mo)q (di\014ed.)21 b(This)16 b(v)m(ariable)h(is)e(o\013)g(b)o(y)g(default.) 240 1600 y Fr(prefer-visible-bell)480 1663 y Fv(If)g(this)g(v)m (ariable)h(is)f(set)g(to)f Fr(On)g Fv(it)h(means)g(to)f(use)h(a)f (visible)j(b)q(ell)g(if)e(one)f(is)i(a)o(v)m(ailable,)480 1725 y(rather)f(than)g(simply)h(ringing)g(the)g(terminal)g(b)q(ell.)21 b(By)16 b(default,)f(the)g(v)m(alue)i(is)e Fr(Off)p Fv(.)0 1824 y(Key)h(Bindings)240 1886 y(The)j(syn)o(tax)g(for)g(con)o (trolling)h(k)o(eybindings)h(in)f(the)f(`)p Fr(~/.inputrc)p Fv(')e(\014le)j(is)g(simple.)33 b(First)19 b(y)o(ou)240 1949 y(ha)o(v)o(e)13 b(to)g(kno)o(w)h(the)f Fp(name)k Fv(of)c(the)h(command)f(that)g(y)o(ou)h(w)o(an)o(t)e(to)h(c)o(hange.)20 b(The)14 b(follo)o(wing)g(pages)240 2011 y(con)o(tain)i(tables)h(of)f (the)g(command)g(name,)g(the)g(default)h(k)o(eybinding,)h(and)e(a)g (short)f(description)240 2073 y(of)g(what)f(the)i(command)f(do)q(es.) 240 2154 y(Once)h(y)o(ou)e(kno)o(w)g(the)h(name)g(of)f(the)h(command,)f (simply)i(place)g(the)f(name)f(of)h(the)f(k)o(ey)h(y)o(ou)f(wish)240 2216 y(to)g(bind)j(the)e(command)g(to,)f(a)g(colon,)i(and)f(then)g(the) g(name)g(of)g(the)g(command)g(on)g(a)f(line)j(in)f(the)240 2278 y(`)p Fr(~/.inputrc)p Fv(')d(\014le.)22 b(The)16 b(name)g(of)f(the)h(k)o(ey)f(can)h(b)q(e)g(expressed)g(in)h(di\013eren) o(t)f(w)o(a)o(ys,)e(dep)q(ending)240 2341 y(on)h(whic)o(h)h(is)g(most)e (comfortable)h(for)g(y)o(ou.)240 2440 y Fp(k)o(eyname)s Fv(:)k Fp(function-name)g Fv(or)c Fp(macro)480 2502 y(k)o(eyname)j Fv(is)d(the)h(name)f(of)g(a)g(k)o(ey)g(sp)q(elled)i(out)e(in)h (English.)21 b(F)l(or)15 b(example:)600 2570 y Fr(Control-u:)22 b(universal-argument)600 2620 y(Meta-Rubout:)g(backward-kill-word)600 2670 y(Control-o:)g(">&output")p eop %%Page: 177 179 177 178 bop 0 -58 a Fv(App)q(endix)17 b(C:)e(Command)g(Line)h(Editing) 1146 b(177)480 183 y(In)15 b(the)f(ab)q(o)o(v)o(e)f(example,)i Fr(C-U)f Fv(is)g(b)q(ound)h(to)f(the)g(function)h Fr (universal-argument)p Fv(,)480 246 y(and)g Fr(C-O)f Fv(is)i(b)q(ound)f (to)f(run)h(the)g(macro)f(expressed)i(on)f(the)f(righ)o(t)h(hand)g (side)h(\(that)480 308 y(is,)f(to)g(insert)h(the)f(text)g(`)p Fr(>&output)p Fv(')e(in)o(to)i(the)g(line\).)240 398 y Fr(")p Fp(k)o(eyseq)q Fr(")p Fv(:)20 b Fp(function-name)e Fv(or)d Fp(macro)480 461 y(k)o(eyseq)j Fv(di\013ers)f(from)f Fp(k)o(eyname)k Fv(ab)q(o)o(v)o(e)c(in)i(that)e(strings)h(denoting)h (an)f(en)o(tire)g(k)o(ey)480 523 y(sequence)d(can)f(b)q(e)h(sp)q (eci\014ed.)21 b(Simply)15 b(place)f(the)f(k)o(ey)g(sequence)h(in)g (double)h(quotes.)480 585 y(GNU)g(Emacs)g(st)o(yle)g(k)o(ey)g(escap)q (es)h(can)f(b)q(e)h(used,)g(as)e(in)j(the)e(follo)o(wing)h(example:)600 649 y Fr("\\C-u":)23 b(universal-argument)600 699 y("\\C-x\\C-r":)f (re-read-init-file)600 749 y("\\e[11~":)h("Function)f(Key)i(1")480 825 y Fv(In)16 b(the)f(ab)q(o)o(v)o(e)g(example,)h Fr(C-U)f Fv(is)h(b)q(ound)g(to)f(the)g(function)h Fr(universal-argument)480 888 y Fv(\(just)e(as)g(it)g(w)o(as)g(in)h(the)g(\014rst)f(example\),)g Fr(C-X)24 b(C-R)14 b Fv(is)h(b)q(ound)g(to)f(the)g(function)h Fr(re-)480 950 y(read-init-file)p Fv(,)e(and)i Fr(ESC)23 b([)h(1)g(1)f(~)15 b Fv(is)h(b)q(ound)f(to)g(insert)g(the)g(text)f(`)p Fr(Function)480 1012 y(Key)h(1)p Fv('.)0 1138 y Fj(C.8.1)30 b(Commands)16 b(F)-5 b(or)14 b(Mo)n(ving)0 1258 y Fr(beginning-of-line) f(\(C-A\))240 1320 y Fv(Mo)o(v)o(e)h(to)h(the)g(start)f(of)h(the)g (curren)o(t)g(line.)0 1411 y Fr(end-of-line)f(\(C-E\))240 1473 y Fv(Mo)o(v)o(e)g(to)h(the)g(end)h(of)f(the)g(line.)0 1564 y Fr(forward-char)f(\(C-F\))240 1626 y Fv(Mo)o(v)o(e)g(forw)o(ard) g(a)h(c)o(haracter.)0 1717 y Fr(backward-char)e(\(C-B\))240 1779 y Fv(Mo)o(v)o(e)h(bac)o(k)h(a)g(c)o(haracter.)0 1870 y Fr(forward-word)f(\(M-F\))240 1932 y Fv(Mo)o(v)o(e)g(forw)o(ard) g(to)h(the)g(end)h(of)f(the)g(next)g(w)o(ord.)0 2023 y Fr(backward-word)e(\(M-B\))240 2085 y Fv(Mo)o(v)o(e)h(bac)o(k)h(to)g (the)g(start)f(of)h(this,)g(or)g(the)g(previous,)h(w)o(ord.)0 2175 y Fr(clear-screen)e(\(C-L\))240 2238 y Fv(Clear)h(the)h(screen)f (lea)o(ving)h(the)g(curren)o(t)f(line)i(at)d(the)h(top)g(of)g(the)g (screen.)0 2363 y Fj(C.8.2)30 b(Commands)16 b(F)-5 b(or)14 b(Manipulating)i(The)e(History)0 2483 y Fr(accept-line)g(\(Newline,)g (Return\))240 2545 y Fv(Accept)g(the)f(line)i(regardless)e(of)g(where)g (the)g(cursor)g(is.)20 b(If)13 b(this)h(line)h(is)e(non-empt)o(y)l(,)h (add)f(it)g(to)g(the)240 2608 y(history)k(list.)25 b(If)17 b(this)g(line)i(w)o(as)c(a)i(history)g(line,)h(then)f(restore)f(the)h (history)f(line)j(to)d(its)h(original)240 2670 y(state.)p eop %%Page: 178 180 178 179 bop 0 -58 a Fv(178)1743 b(Octa)o(v)o(e)0 183 y Fr(previous-history)13 b(\(C-P\))240 246 y Fv(Mo)o(v)o(e)h(`up')h (through)g(the)g(history)g(list.)0 326 y Fr(next-history)f(\(C-N\))240 389 y Fv(Mo)o(v)o(e)g(`do)o(wn')g(through)h(the)h(history)f(list.)0 470 y Fr(beginning-of-history)d(\(M-<\))240 532 y Fv(Mo)o(v)o(e)i(to)h (the)g(\014rst)g(line)i(in)f(the)f(history)l(.)0 613 y Fr(end-of-history)e(\(M->\))240 675 y Fv(Mo)o(v)o(e)h(to)h(the)g(end) h(of)f(the)g(input)h(history)l(,)f(i.e.,)g(the)g(line)i(y)o(ou)e(are)g (en)o(tering!)0 756 y Fr(reverse-search-history)d(\(C-R\))240 818 y Fv(Searc)o(h)18 b(bac)o(kw)o(ard)f(starting)g(at)g(the)g(curren)o (t)h(line)h(and)f(mo)o(ving)f(`up')h(through)f(the)h(history)f(as)240 880 y(necessary)l(.)j(This)c(is)g(an)f(incremen)o(tal)h(searc)o(h.)0 961 y Fr(forward-search-history)c(\(C-S\))240 1024 y Fv(Searc)o(h)j(forw)o(ard)e(starting)h(at)g(the)g(curren)o(t)h(line)h (and)f(mo)o(ving)f(`do)o(wn')g(through)g(the)g(the)h(history)240 1086 y(as)g(necessary)l(.)0 1200 y Fj(C.8.3)30 b(Commands)16 b(F)-5 b(or)14 b(Changing)h(T)-5 b(ext)0 1313 y Fr(delete-char)14 b(\(C-D\))240 1375 y Fv(Delete)20 b(the)f(c)o(haracter)g(under)h(the)f (cursor.)32 b(If)19 b(the)h(cursor)e(is)i(at)f(the)g(b)q(eginning)j(of) c(the)i(line,)240 1438 y(and)14 b(there)h(are)f(no)g(c)o(haracters)f (in)j(the)e(line,)i(and)e(the)g(last)h(c)o(haracter)e(t)o(yp)q(ed)i(w)o (as)e(not)h Fr(C-D)p Fv(,)g(then)240 1500 y(return)h(EOF.)0 1581 y Fr(backward-delete-char)d(\(Rubout\))240 1643 y Fv(Delete)g(the)f(c)o(haracter)f(b)q(ehind)j(the)e(cursor.)18 b(A)11 b(n)o(umeric)h(arg)e(sa)o(ys)g(to)g(kill)j(the)e(c)o(haracters)f (instead)240 1705 y(of)15 b(deleting)h(them.)0 1786 y Fr(quoted-insert)d(\(C-Q,)i(C-V\))240 1848 y Fv(Add)f(the)f(next)g(c)o (haracter)f(that)h(y)o(ou)f(t)o(yp)q(e)h(to)g(the)g(line)i(v)o (erbatim.)k(This)13 b(is)h(ho)o(w)f(to)f(insert)i(things)240 1911 y(lik)o(e)i Fr(C-Q)f Fv(for)g(example.)0 1991 y Fr(tab-insert)f(\(M-TAB\))240 2054 y Fv(Insert)h(a)g(tab)g(c)o (haracter.)0 2135 y Fr(self-insert)f(\(a,)g(b,)h(A,)g(1,)g(!,)g(...\)) 240 2197 y Fv(Insert)g(y)o(ourself.)0 2278 y Fr(transpose-chars)e (\(C-T\))240 2340 y Fv(Drag)21 b(the)g(c)o(haracter)g(b)q(efore)h(p)q (oin)o(t)g(forw)o(ard)f(o)o(v)o(er)f(the)i(c)o(haracter)f(at)g(p)q(oin) o(t.)40 b(P)o(oin)o(t)21 b(mo)o(v)o(es)240 2402 y(forw)o(ard)16 b(as)i(w)o(ell.)28 b(If)18 b(p)q(oin)o(t)h(is)f(at)f(the)h(end)g(of)f (the)h(line,)i(then)e(transp)q(ose)g(the)f(t)o(w)o(o)g(c)o(haracters) 240 2465 y(b)q(efore)e(p)q(oin)o(t.)21 b(Negativ)o(e)15 b(args)f(don't)h(w)o(ork.)0 2545 y Fr(transpose-words)e(\(M-T\))240 2608 y Fv(Drag)f(the)h(w)o(ord)f(b)q(ehind)i(the)f(cursor)g(past)f(the) h(w)o(ord)f(in)h(fron)o(t)f(of)h(the)f(cursor)h(mo)o(ving)f(the)h (cursor)240 2670 y(o)o(v)o(er)h(that)h(w)o(ord)f(as)h(w)o(ell.)p eop %%Page: 179 181 179 180 bop 0 -58 a Fv(App)q(endix)17 b(C:)e(Command)g(Line)h(Editing) 1146 b(179)0 183 y Fr(upcase-word)14 b(\(M-U\))240 246 y Fv(Upp)q(ercase)h(the)e(curren)o(t)h(\(or)f(follo)o(wing\))h(w)o (ord.)k(With)c(a)f(negativ)o(e)h(argumen)o(t,)f(do)g(the)h(previous)240 308 y(w)o(ord,)g(but)h(do)h(not)e(mo)o(v)o(e)h(p)q(oin)o(t.)0 394 y Fr(downcase-word)e(\(M-L\))240 456 y Fv(Lo)o(w)o(ercase)g(the)i (curren)o(t)f(\(or)f(follo)o(wing\))h(w)o(ord.)19 b(With)14 b(a)g(negativ)o(e)g(argumen)o(t,)f(do)h(the)g(previous)240 518 y(w)o(ord,)g(but)h(do)h(not)e(mo)o(v)o(e)h(p)q(oin)o(t.)0 604 y Fr(capitalize-word)e(\(M-C\))240 666 y Fv(Upp)q(ercase)i(the)e (curren)o(t)h(\(or)f(follo)o(wing\))h(w)o(ord.)k(With)c(a)f(negativ)o (e)h(argumen)o(t,)f(do)g(the)h(previous)240 728 y(w)o(ord,)g(but)h(do)h (not)e(mo)o(v)o(e)h(p)q(oin)o(t.)0 847 y Fj(C.8.4)30 b(Killing)16 b(And)f(Y)-5 b(anking)0 963 y Fr(kill-line)14 b(\(C-K\))240 1025 y Fv(Kill)j(the)f(text)e(from)h(the)g(curren)o(t)g (cursor)g(p)q(osition)h(to)f(the)g(end)h(of)f(the)g(line.)0 1111 y Fr(backward-kill-line)e(\(\))240 1173 y Fv(Kill)k(bac)o(kw)o (ard)e(to)f(the)i(b)q(eginning)h(of)e(the)g(line.)22 b(This)15 b(is)h(normally)g(un)o(b)q(ound.)0 1259 y Fr(kill-word)e (\(M-D\))240 1321 y Fv(Kill)j(from)d(the)h(cursor)g(to)f(the)h(end)g (of)g(the)g(curren)o(t)f(w)o(ord,)g(or)g(if)i(b)q(et)o(w)o(een)f(w)o (ords,)f(to)g(the)h(end)g(of)240 1384 y(the)g(next)h(w)o(ord.)0 1470 y Fr(backward-kill-word)d(\(M-DEL\))240 1532 y Fv(Kill)k(the)f(w)o (ord)e(b)q(ehind)j(the)f(cursor.)0 1618 y Fr(unix-line-discard)d (\(C-U\))240 1680 y Fv(Do)k(what)g Fr(C-U)g Fv(used)h(to)f(do)h(in)g (Unix)h(line)g(input.)28 b(W)l(e)17 b(sa)o(v)o(e)g(the)h(killed)i(text) d(on)g(the)h(kill-ring,)240 1742 y(though.)0 1828 y Fr (unix-word-rubout)13 b(\(C-W\))240 1890 y Fv(Do)k(what)f Fr(C-W)h Fv(used)h(to)e(do)h(in)h(Unix)g(line)h(input.)27 b(The)17 b(killed)j(text)c(is)i(sa)o(v)o(ed)f(on)g(the)g(kill-ring.)240 1952 y(This)f(is)f(di\013eren)o(t)h(than)f(bac)o(kw)o(ard-kill-w)o(ord) h(b)q(ecause)g(the)f(w)o(ord)g(b)q(oundaries)h(di\013er.)0 2038 y Fr(yank)f(\(C-Y\))240 2101 y Fv(Y)l(ank)g(the)h(top)f(of)f(the)i (kill)h(ring)e(in)o(to)g(the)h(bu\013er)f(at)f(p)q(oin)o(t.)0 2186 y Fr(yank-pop)g(\(M-Y\))240 2249 y Fv(Rotate)f(the)h(kill-ring,)i (and)e(y)o(ank)g(the)g(new)g(top.)19 b(Y)l(ou)14 b(can)g(only)g(do)g (this)g(if)g(the)g(prior)g(command)240 2311 y(is)i(y)o(ank)f(or)f(y)o (ank-p)q(op.)0 2430 y Fj(C.8.5)30 b(Sp)r(ecifying)16 b(Numeric)f(Argumen)n(ts)0 2545 y Fr(digit-argument)e(\(M-0,)i(M-1,)f (...)h(M--\))240 2608 y Fv(Add)j(this)g(digit)h(to)e(the)h(argumen)o(t) e(already)i(accum)o(ulating,)h(or)e(start)g(a)g(new)h(argumen)o(t.)26 b Fr(M--)240 2670 y Fv(starts)14 b(a)h(negativ)o(e)g(argumen)o(t.)p eop %%Page: 180 182 180 181 bop 0 -58 a Fv(180)1743 b(Octa)o(v)o(e)0 183 y Fr(universal-argument)13 b(\(\))240 246 y Fv(Do)i(what)f Fr(C-U)h Fv(do)q(es)h(in)g(emacs.)j(By)d(default,)f(this)h(is)f(not)g (b)q(ound.)0 371 y Fj(C.8.6)30 b(Letting)15 b(Readline)g(T)n(yp)r(e)g (F)-5 b(or)15 b(Y)-5 b(ou)0 491 y Fr(complete)14 b(\(TAB\))240 553 y Fv(A)o(ttempt)j(to)g(do)h(completion)h(on)f(the)g(text)f(b)q (efore)h(p)q(oin)o(t.)29 b(This)18 b(is)h(implemen)o(tation)g (de\014ned.)240 616 y(Generally)l(,)d(if)g(y)o(ou)f(are)g(t)o(yping)h (a)f(\014le)i(name)e(argumen)o(t,)f(y)o(ou)h(can)h(do)f(\014le)i(name)e (completion;)h(if)240 678 y(y)o(ou)i(are)f(t)o(yping)i(a)e(command,)i (y)o(ou)e(can)i(do)f(command)g(completion,)h(if)g(y)o(ou)e(are)h(t)o (yping)g(in)h(a)240 740 y(sym)o(b)q(ol)e(to)f(GDB,)g(y)o(ou)g(can)h(do) g(sym)o(b)q(ol)g(name)g(completion,)h(if)f(y)o(ou)f(are)h(t)o(yping)g (in)g(a)g(v)m(ariable)240 802 y(to)e(Bash,)f(y)o(ou)h(can)h(do)f(v)m (ariable)h(name)g(completion...)0 893 y Fr(possible-completions)c (\(M-?\))240 955 y Fv(List)k(the)f(p)q(ossible)i(completions)f(of)f (the)g(text)g(b)q(efore)h(p)q(oin)o(t.)0 1081 y Fj(C.8.7)30 b(Some)16 b(Miscellaneous)f(Commands)0 1201 y Fr(re-read-init-file)e (\(C-X)h(C-R\))240 1263 y Fv(Read)20 b(in)g(the)g(con)o(ten)o(ts)f(of)g (y)o(our)g(`)p Fr(~/.inputrc)p Fv(')e(\014le,)k(and)f(incorp)q(orate)f (an)o(y)g(bindings)j(found)240 1325 y(there.)0 1416 y Fr(abort)14 b(\(C-G\))240 1479 y Fv(Ding!)20 b(Stops)15 b(things.)0 1569 y Fr(do-uppercase-version)d(\(M-A,)j(M-B,)f(...\))240 1632 y Fv(Run)i(the)f(command)g(that)g(is)h(b)q(ound)g(to)e(y)o(our)h (upp)q(ercase)h(brother.)0 1722 y Fr(prefix-meta)e(\(ESC\))240 1785 y Fv(Mak)o(e)g(the)g(next)h(c)o(haracter)f(that)g(y)o(ou)g(t)o(yp) q(e)h(b)q(e)g(meta\014ed.)20 b(This)15 b(is)g(for)f(p)q(eople)i (without)e(a)h(meta)240 1847 y(k)o(ey)l(.)20 b(T)o(yping)c Fr(ESC)23 b(F)15 b Fv(is)h(equiv)m(alen)o(t)h(to)d(t)o(yping)i Fr(M-F)p Fv(.)0 1938 y Fr(undo)f(\(C-_\))240 2000 y Fv(Incremen)o(tal)h (undo,)f(separately)h(remem)o(b)q(ered)g(for)e(eac)o(h)h(line.)0 2091 y Fr(revert-line)f(\(M-R\))240 2153 y Fv(Undo)k(all)i(c)o(hanges)e (made)g(to)f(this)i(line.)30 b(This)19 b(is)g(lik)o(e)g(t)o(yping)f (the)h(`undo')f(command)g(enough)240 2215 y(times)d(to)g(get)g(bac)o(k) g(to)f(the)i(b)q(eginning.)0 2355 y Fu(C.9)32 b(Readline)17 b(Vi)f(Mo)r(de)62 2461 y Fv(While)d(the)f(Readline)i(library)f(do)q(es) f(not)f(ha)o(v)o(e)g(a)h(full)h(set)e(of)h(Vi)g(editing)h(functions,)g (it)f(do)q(es)g(con)o(tain)g(enough)0 2523 y(to)j(allo)o(w)g(simple)i (editing)f(of)f(the)g(line.)62 2608 y(In)h(order)f(to)f(switc)o(h)h(in) o(teractiv)o(ely)h(b)q(et)o(w)o(een)g(Emacs)e(and)h(Vi)h(editing)g(mo)q (des,)f(use)h(the)f(command)g Fr(M-C-J)0 2670 y Fv(\(toggle-editing-mo) q(de\).)p eop %%Page: 181 183 181 182 bop 0 -58 a Fv(App)q(endix)17 b(C:)e(Command)g(Line)h(Editing) 1146 b(181)62 183 y(When)19 b(y)o(ou)f(en)o(ter)g(a)h(line)h(in)f(Vi)g (mo)q(de,)g(y)o(ou)f(are)g(already)h(placed)h(in)f(`insertion')g(mo)q (de,)g(as)f(if)h(y)o(ou)f(had)0 246 y(t)o(yp)q(ed)g(an)f(`i'.)27 b(Pressing)18 b Fr(ESC)f Fv(switc)o(hes)h(y)o(ou)f(in)o(to)h(`edit')g (mo)q(de,)g(where)f(y)o(ou)h(can)f(edit)i(the)e(text)g(of)h(the)f(line) 0 308 y(with)g(the)g(standard)g(Vi)g(mo)o(v)o(emen)o(t)f(k)o(eys,)h(mo) o(v)o(e)f(to)g(previous)i(history)f(lines)h(with)g(`k',)e(and)h(follo)o (wing)g(lines)0 370 y(with)f(`j',)d(and)j(so)f(forth.)p eop %%Page: 182 184 182 183 bop 0 -58 a Fv(182)1743 b(Octa)o(v)o(e)p eop %%Page: 183 185 183 184 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(183)0 183 y Fs(App)r(endix)13 b(D)41 b(Using)14 b(Info)62 323 y Fp(Info)j Fv(is)f(a)e(program)f(whic)o(h)j(is)f(used)g(to)f(view) i(info)f(\014les)g(on)g(an)g(ASCI)q(I)g(terminal.)21 b Fp(info)15 b(\014les)i Fv(are)e(the)g(result)0 385 y(of)g(pro)q(cessing)h(texinfo)f(\014les)h(with)g(the)f(program)f Fr(makeinfo)g Fv(or)h(with)g(the)h(Emacs)e(command)h Fr(M-x)g(texinfo-)0 448 y(format-buffer)p Fv(.)20 b(Finally)l(,)e Fp(texinfo)g Fv(is)f(a)f(do)q(cumen)o(tation)g(language)g(whic)o(h)h (allo)o(ws)f(a)g(prin)o(ted)h(man)o(ual)f(and)0 510 y(on-line)h(do)q (cumen)o(tation)f(\(an)e(info)i(\014le\))g(to)f(b)q(e)g(pro)q(duced)i (from)d(a)h(single)i(source)e(\014le.)0 648 y Fu(D.1)32 b(Mo)n(ving)16 b(the)g(Cursor)62 753 y Fv(Man)o(y)f(p)q(eople)j(\014nd) e(that)g(reading)g(screens)g(of)g(text)f(page)h(b)o(y)g(page)g(is)g (made)g(easier)g(when)h(one)f(is)g(able)h(to)0 816 y(indicate)i (particular)f(pieces)h(of)e(text)g(with)g(some)g(kind)i(of)e(p)q(oin)o (ting)h(device.)28 b(Since)19 b(this)f(is)g(the)g(case,)f(GNU)0 878 y(Info)12 b(\(b)q(oth)g(the)g(Emacs)g(and)h(standalone)f(v)o (ersions\))g(ha)o(v)o(e)g(sev)o(eral)g(commands)g(whic)o(h)h(allo)o(w)f (y)o(ou)g(to)g(mo)o(v)o(e)f(the)0 940 y(cursor)i(ab)q(out)g(the)h (screen.)19 b(The)14 b(notation)f(used)h(in)g(this)g(man)o(ual)f(to)g (describ)q(e)i(k)o(eystrok)o(es)d(is)i(iden)o(tical)h(to)e(the)0 1002 y(notation)j(used)i(within)g(the)e(Emacs)h(man)o(ual,)g(and)g(the) f(GNU)h(Readline)i(man)o(ual.)24 b(See)18 b(section)f(\\Character)0 1065 y(Con)o(v)o(en)o(tions")e(in)h Fp(the)f(GNU)g(Emacs)g(Man)o(ual)r Fv(,)f(if)i(y)o(ou)f(are)g(unfamiliar)h(with)g(the)f(notation.)62 1149 y(The)d(follo)o(wing)g(table)g(lists)g(the)f(basic)h(cursor)g(mo)o (v)o(emen)o(t)e(commands)h(in)h(Info.)19 b(Eac)o(h)11 b(en)o(try)g(consists)h(of)f(the)0 1211 y(k)o(ey)i(sequence)h(y)o(ou)f (should)h(t)o(yp)q(e)f(to)g(execute)g(the)h(cursor)e(mo)o(v)o(emen)o (t,)g(the)i Fr(M-x)1394 1195 y Fk(1)1425 1211 y Fv(command)f(name)g (\(displa)o(y)o(ed)0 1274 y(in)22 b(paren)o(theses\),)f(and)g(a)f (short)h(description)h(of)e(what)g(the)h(command)g(do)q(es.)37 b(All)22 b(of)e(the)h(cursor)f(motion)0 1336 y(commands)15 b(can)h(tak)o(e)f(an)g Fp(n)o(umeric)k Fv(argumen)o(t)c(\(see)h (Section)g(D.8)f([Other)g(Info)h(Commands],)e(page)i(193\),)e(to)0 1398 y(\014nd)f(out)e(ho)o(w)g(to)h(supply)h(them.)18 b(With)12 b(a)g(n)o(umeric)h(argumen)o(t,)e(the)h(motion)g(commands)f (are)h(simply)h(executed)0 1460 y(that)j(man)o(y)h(times;)h(for)e (example,)i(a)f(n)o(umeric)h(argumen)o(t)e(of)g(4)h(giv)o(en)h(to)e Fr(next-line)g Fv(causes)h(the)g(cursor)g(to)0 1523 y(mo)o(v)o(e)e(do)o (wn)g(4)g(lines.)22 b(With)16 b(a)f(negativ)o(e)h(n)o(umeric)g(argumen) o(t,)f(the)g(motion)h(is)g(rev)o(ersed;)f(an)g(argumen)o(t)g(of)g(-4)0 1585 y(giv)o(en)h(to)e(the)i Fr(next-line)d Fv(command)j(w)o(ould)f (cause)h(the)f(cursor)g(to)f(mo)o(v)o(e)h Fp(up)i Fv(4)e(lines.)0 1683 y Fr(C-n)g Fv(\()p Fr(next-line)p Fv(\))240 1746 y(Mo)o(v)o(es)f(the)h(cursor)g(do)o(wn)g(to)g(the)g(next)g(line.)0 1836 y Fr(C-p)g Fv(\()p Fr(prev-line)p Fv(\))240 1898 y(Mo)o(v)o(e)f(the)h(cursor)g(up)h(to)f(the)g(previous)h(line.)0 1988 y Fr(C-a)f Fv(\()p Fr(beginning-of-line)p Fv(\))240 2050 y(Mo)o(v)o(e)f(the)h(cursor)g(to)g(the)g(start)f(of)h(the)g (curren)o(t)g(line.)0 2140 y Fr(C-e)g Fv(\()p Fr(end-of-line)p Fv(\))240 2202 y(Mo)o(v)o(es)f(the)h(cursor)g(to)g(the)g(end)h(of)f (the)g(curren)o(t)g(line.)0 2292 y Fr(C-f)g Fv(\()p Fr(forward-char)p Fv(\))240 2354 y(Mo)o(v)o(e)f(the)h(cursor)g(forw)o(ard)f(a)h(c)o (haracter.)0 2444 y Fr(C-b)g Fv(\()p Fr(backward-char)p Fv(\))240 2507 y(Mo)o(v)o(e)f(the)h(cursor)g(bac)o(kw)o(ard)g(a)g(c)o (haracter.)p 0 2551 600 2 v 21 2590 a Fk(1)62 2606 y Fr(M-x)21 b Fv(is)h(also)f(a)g(command;)i(it)f(in)o(v)o(ok)o(es)f Fr(execute-extended-comman)o(d)p Fv(.)35 b(See)22 b(section)f (\\Executing)h(an)62 2668 y(extended)16 b(command")f(in)h Fp(the)g(GNU)f(Emacs)f(Man)o(ual)r Fv(,)h(for)g(more)f(detailed)j (information.)p eop %%Page: 184 186 184 185 bop 0 -58 a Fv(184)1743 b(Octa)o(v)o(e)0 183 y Fr(M-f)15 b Fv(\()p Fr(forward-word)p Fv(\))240 246 y(Mo)o(v)o(es)f(the)h(cursor)g(forw)o(ard)f(a)h(w)o(ord.)0 336 y Fr(M-b)g Fv(\()p Fr(backward-word)p Fv(\))240 398 y(Mo)o(v)o(es)f(the)h(cursor)g(bac)o(kw)o(ard)g(a)g(w)o(ord.)0 488 y Fr(M-<)g Fv(\()p Fr(beginning-of-node)p Fv(\))0 551 y Fr(b)216 b Fv(Mo)o(v)o(es)14 b(the)h(cursor)g(to)g(the)g(start)f (of)h(the)g(curren)o(t)g(no)q(de.)0 641 y Fr(M->)g Fv(\()p Fr(end-of-node)p Fv(\))240 703 y(Mo)o(v)o(es)f(the)h(cursor)g(to)g(the) g(end)h(of)f(the)g(curren)o(t)g(no)q(de.)0 794 y Fr(M-r)g Fv(\()p Fr(move-to-window-line)p Fv(\))240 856 y(Mo)o(v)o(es)h(the)g (cursor)h(to)f(a)g(sp)q(eci\014c)i(line)h(of)d(the)h(windo)o(w.)24 b(Without)17 b(a)f(n)o(umeric)i(argumen)o(t,)d Fr(M-r)240 918 y Fv(mo)o(v)o(es)g(the)g(cursor)h(to)f(the)g(start)g(of)g(the)h (line)h(in)f(the)g(cen)o(ter)g(of)f(the)h(windo)o(w.)21 b(With)16 b(a)f(n)o(umeric)240 981 y(argumen)o(t)f(of)h Fp(n)p Fv(,)g Fr(M-r)g Fv(mo)o(v)o(es)f(the)i(cursor)e(to)h(the)g (start)f(of)h(the)g Fp(n)p Fv(th)h(line)h(in)f(the)f(windo)o(w.)0 1120 y Fu(D.2)32 b(Mo)n(ving)16 b(T)-6 b(ext)16 b(Within)i(a)d(Windo)n (w)62 1225 y Fv(Sometimes)j(y)o(ou)f(are)g(lo)q(oking)h(at)f(a)g (screenful)i(of)e(text,)g(and)g(only)h(part)f(of)g(the)g(curren)o(t)h (paragraph)e(y)o(ou)0 1287 y(are)f(reading)g(is)g(visible)i(on)e(the)g (screen.)20 b(The)15 b(commands)g(detailed)h(in)g(this)f(section)h(are) e(used)i(to)e(shift)h(whic)o(h)0 1350 y(part)g(of)f(the)i(curren)o(t)f (no)q(de)h(is)f(visible)j(on)d(the)g(screen.)0 1448 y Fr(SPC)g Fv(\()p Fr(scroll-forward)p Fv(\))0 1511 y Fr(C-v)168 b Fv(Shift)18 b(the)g(text)f(in)h(this)g(windo)o(w)g(up.)28 b(That)17 b(is,)h(sho)o(w)f(more)g(of)g(the)h(no)q(de)g(whic)o(h)g(is)g (curren)o(tly)240 1573 y(b)q(elo)o(w)h(the)g(b)q(ottom)f(of)g(the)g (windo)o(w.)31 b(With)18 b(a)h(n)o(umeric)g(argumen)o(t,)f(sho)o(w)g (that)g(man)o(y)g(more)240 1635 y(lines)e(at)e(the)h(b)q(ottom)f(of)g (the)h(windo)o(w;)g(a)f(n)o(umeric)i(argumen)o(t)e(of)g(4)h(w)o(ould)g (shift)g(all)g(of)g(the)f(text)240 1697 y(in)j(the)g(windo)o(w)f(up)h (4)f(lines)i(\(discarding)g(the)e(top)g(4)g(lines\),)i(and)e(sho)o(w)g (y)o(ou)g(four)g(new)h(lines)h(at)240 1760 y(the)g(b)q(ottom)e(of)h (the)h(windo)o(w.)27 b(Without)18 b(a)f(n)o(umeric)h(argumen)o(t,)f Fr(SPC)g Fv(tak)o(es)g(the)h(b)q(ottom)e(t)o(w)o(o)240 1822 y(lines)j(of)d(the)h(windo)o(w)g(and)g(places)h(them)f(at)g(the)g (top)f(of)h(the)g(windo)o(w,)g(redispla)o(ying)i(almost)d(a)240 1884 y(completely)h(new)e(screenful)h(of)f(lines.)0 1975 y Fr(DEL)g Fv(\()p Fr(scroll-backward)p Fv(\))0 2037 y Fr(M-v)168 b Fv(Shift)16 b(the)f(text)g(in)h(this)f(windo)o(w)h(do)o (wn.)k(The)15 b(in)o(v)o(erse)h(of)e Fr(scroll-forward)p Fv(.)62 2135 y(The)k Fr(scroll-forward)e Fv(and)h Fr(scroll-backward)f Fv(commands)h(can)h(also)f(mo)o(v)o(e)g(forw)o(ard)f(and)i(bac)o(kw)o (ard)0 2198 y(through)11 b(the)h(no)q(de)h(structure)e(of)h(the)g (\014le.)20 b(If)12 b(y)o(ou)f(press)h Fr(SPC)f Fv(while)j(viewing)f (the)f(end)g(of)g(a)f(no)q(de,)i(or)e Fr(DEL)g Fv(while)0 2260 y(viewing)19 b(the)e(b)q(eginning)j(of)d(a)g(no)q(de,)i(what)e (happ)q(ens)h(is)g(con)o(trolled)h(b)o(y)e(the)h(v)m(ariable)h Fr(scroll-behaviour)p Fv(.)0 2322 y(See)d(Section)g(D.9)e([Info)h(V)l (ariables],)h(page)f(195,)f(for)g(more)h(information.)0 2421 y Fr(C-l)g Fv(\()p Fr(redraw-display)p Fv(\))240 2483 y(Redra)o(w)h(the)h(displa)o(y)g(from)f(scratc)o(h,)f(or)h(shift)h (the)f(line)i(con)o(taining)f(the)f(cursor)g(to)g(a)g(sp)q(eci\014ed) 240 2545 y(lo)q(cation.)j(With)11 b(no)g(n)o(umeric)h(argumen)o(t,)e(`) p Fr(C-l)p Fv(')g(clears)h(the)g(screen,)g(and)g(then)h(redra)o(ws)e (its)g(en)o(tire)240 2608 y(con)o(ten)o(ts.)24 b(Giv)o(en)18 b(a)e(n)o(umeric)i(argumen)o(t)e(of)g Fp(n)p Fv(,)i(the)f(line)h(con)o (taining)g(the)f(cursor)f(is)i(shifted)f(so)240 2670 y(that)d(it)i(is)g(on)f(the)g Fp(n)p Fv(th)g(line)i(of)e(the)g(windo)o (w.)p eop %%Page: 185 187 185 186 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(185)0 183 y Fr(C-x)15 b(w)g Fv(\()p Fr(toggle-wrap)p Fv(\))240 246 y(T)l(oggles)j(the)g(state)g(of)f(line)j(wrapping)f(in)f (the)h(curren)o(t)f(windo)o(w.)28 b(Normally)l(,)20 b(lines)f(whic)o(h) g(are)240 308 y(longer)12 b(than)f(the)g(screen)h(width)f Fp(wrap)p Fv(,)h(i.e.,)f(they)h(are)e(con)o(tin)o(ued)j(on)e(the)g (next)g(line.)21 b(Lines)12 b(whic)o(h)240 370 y(wrap)j(ha)o(v)o(e)h(a) f(`)p Fr(\\)p Fv(')g(app)q(earing)i(in)g(the)f(righ)o(tmost)f(column)h (of)g(the)g(screen.)22 b(Y)l(ou)16 b(can)g(cause)h(suc)o(h)240 432 y(lines)f(to)e(b)q(e)h(terminated)g(at)f(the)h(righ)o(tmost)f (column)h(b)o(y)g(c)o(hanging)g(the)f(state)g(of)g(line)j(wrapping)240 495 y(in)e(the)f(windo)o(w)g(with)g Fr(C-x)h(w)p Fv(.)k(When)14 b(a)g(line)h(whic)o(h)g(needs)g(more)e(space)h(than)g(one)g(screen)g (width)240 557 y(to)j(displa)o(y)j(is)e(displa)o(y)o(ed,)i(a)e(`)p Fr($)p Fv(')f(app)q(ears)h(in)h(the)g(righ)o(tmost)e(column)i(of)e(the) i(screen,)g(and)f(the)240 619 y(remainder)e(of)f(the)g(line)i(is)f(in)o (visible.)0 744 y Fu(D.3)32 b(Selecting)17 b(a)e(New)f(No)r(de)62 847 y Fv(This)f(section)g(details)h(the)e(n)o(umerous)h(Info)f (commands)g(whic)o(h)i(select)f(a)f(new)h(no)q(de)g(to)e(view)i(in)h (the)e(curren)o(t)0 910 y(windo)o(w.)62 993 y(The)k(most)e(basic)i(no)q (de)g(commands)f(are)g(`)p Fr(n)p Fv(',)f(`)p Fr(p)p Fv(',)f(`)p Fr(u)p Fv(',)h(and)i(`)p Fr(l)p Fv('.)62 1076 y(When)c(y)o(ou)e(are)h(viewing)h(a)f(no)q(de,)h(the)f(top)g(line) i(of)d(the)h(no)q(de)h(con)o(tains)f(some)g(Info)g Fp(p)q(oin)o(ters)i Fv(whic)o(h)f(describ)q(e)0 1138 y(where)17 b(the)f(next,)g(previous,)h (and)g(up)f(no)q(des)h(are.)23 b(Info)16 b(uses)h(this)g(line)h(to)d (mo)o(v)o(e)h(ab)q(out)g(the)g(no)q(de)h(structure)0 1200 y(of)e(the)g(\014le)h(when)g(y)o(ou)f(use)g(the)h(follo)o(wing)g (commands:)0 1292 y Fr(n)f Fv(\()p Fr(next-node)p Fv(\))240 1354 y(Selects)h(the)g(`Next')e(no)q(de.)0 1433 y Fr(p)h Fv(\()p Fr(prev-node)p Fv(\))240 1495 y(Selects)h(the)g(`Prev')e(no)q (de.)0 1574 y Fr(u)h Fv(\()p Fr(up-node)p Fv(\))240 1636 y(Selects)h(the)g(`Up')e(no)q(de.)62 1728 y(Y)l(ou)22 b(can)f(easily)h(select)g(a)e(no)q(de)i(that)e(y)o(ou)h(ha)o(v)o(e)f (already)i(view)o(ed)g(in)f(this)h(windo)o(w)f(b)o(y)g(using)h(the)f(`) p Fr(l)p Fv(')0 1790 y(command)f({)f(this)i(name)f(stands)f(for)h Fr(")p Fv(last)p Fr(")p Fv(,)g(and)g(actually)h(mo)o(v)o(es)e(through)g (the)h(list)h(of)f(already)g(visited)0 1852 y(no)q(des)e(for)e(this)h (windo)o(w.)26 b(`)p Fr(l)p Fv(')16 b(with)h(a)g(negativ)o(e)g(n)o (umeric)h(argumen)o(t)e(mo)o(v)o(es)h(forw)o(ard)e(through)i(the)g (history)0 1914 y(of)d(no)q(des)g(for)g(this)g(windo)o(w,)g(so)g(y)o (ou)f(can)h(quic)o(kly)i(step)e(b)q(et)o(w)o(een)g(t)o(w)o(o)f(adjacen) o(t)g(\(in)i(viewing)g(history\))f(no)q(des.)0 2006 y Fr(l)h Fv(\()p Fr(history-node)p Fv(\))240 2068 y(Selects)h(the)g(most) e(recen)o(tly)i(selected)g(no)q(de)g(in)g(this)g(windo)o(w.)62 2159 y(Tw)o(o)g(additional)i(commands)f(mak)o(e)f(it)h(easy)f(to)g (select)i(the)e(most)g(commonly)h(selected)h(no)q(des;)g(they)e(are)0 2222 y(`)p Fr(t)p Fv(')e(and)i(`)p Fr(d)p Fv('.)0 2313 y Fr(t)f Fv(\()p Fr(top-node)p Fv(\))240 2375 y(Selects)h(the)g(no)q (de)f(`)p Fr(Top)p Fv(')f(in)i(the)g(curren)o(t)f(info)g(\014le.)0 2454 y Fr(d)g Fv(\()p Fr(dir-node)p Fv(\))240 2516 y(Selects)h(the)g (directory)f(no)q(de)h(\(i.e.,)e(the)i(no)q(de)f(`)p Fr(\(dir\))p Fv('\).)62 2608 y(Here)h(are)e(some)h(other)g(commands)g (whic)o(h)h(immediately)g(result)g(in)g(the)f(selection)i(of)d(a)h (di\013eren)o(t)g(no)q(de)h(in)0 2670 y(the)f(curren)o(t)g(windo)o(w:)p eop %%Page: 186 188 186 187 bop 0 -58 a Fv(186)1743 b(Octa)o(v)o(e)0 183 y Fr(<)15 b Fv(\()p Fr(first-node)p Fv(\))240 246 y(Selects)j(the)e (\014rst)g(no)q(de)h(whic)o(h)h(app)q(ears)e(in)i(this)f(\014le.)25 b(This)17 b(no)q(de)g(is)g(most)f(often)g(`)p Fr(Top)p Fv(',)f(but)i(it)240 308 y(do)q(esn't)e(ha)o(v)o(e)g(to)f(b)q(e.)0 395 y Fr(>)h Fv(\()p Fr(last-node)p Fv(\))240 458 y(Selects)h(the)g (last)f(no)q(de)g(whic)o(h)i(app)q(ears)e(in)h(this)g(\014le.)0 545 y Fr(])f Fv(\()p Fr(global-next-node)p Fv(\))240 607 y(Mo)o(v)o(es)j(forw)o(ard)g(or)h(do)o(wn)g(through)g(no)q(de)h (structure.)31 b(If)20 b(the)f(no)q(de)h(that)f(y)o(ou)g(are)f(curren)o (tly)240 670 y(viewing)c(has)g(a)e(`)p Fr(Next)p Fv(')g(p)q(oin)o(ter,) i(that)f(no)q(de)g(is)h(selected.)21 b(Otherwise,)14 b(if)f(this)h(no)q(de)g(has)f(a)g(men)o(u,)240 732 y(the)j(\014rst)f (men)o(u)g(item)h(is)g(selected.)22 b(If)16 b(there)f(is)h(no)g(`)p Fr(Next)p Fv(')e(and)h(no)h(men)o(u,)f(the)h(same)f(pro)q(cess)g(is)240 794 y(tried)h(with)f(the)h(`)p Fr(Up)p Fv(')e(no)q(de)i(of)e(this)i(no) q(de.)0 882 y Fr([)f Fv(\()p Fr(global-prev-node)p Fv(\))240 944 y(Mo)o(v)o(es)k(bac)o(kw)o(ard)h(or)g(up)h(through)f(no)q(de)h (structure.)35 b(If)21 b(the)f(no)q(de)i(that)d(y)o(ou)h(are)g(curren)o (tly)240 1006 y(viewing)d(has)e(a)g(`)p Fr(Prev)p Fv(')f(p)q(oin)o (ter,)i(that)f(no)q(de)h(is)g(selected.)22 b(Otherwise,)16 b(if)g(the)f(no)q(de)h(has)g(an)f(`)p Fr(Up)p Fv(')240 1069 y(p)q(oin)o(ter,)e(that)e(no)q(de)h(is)g(selected,)i(and)e(if)g (it)g(has)g(a)f(men)o(u,)i(the)e(last)h(item)g(in)h(the)f(men)o(u)g(is) g(selected.)62 1165 y(Y)l(ou)22 b(can)g(get)f(the)h(same)f(b)q(eha)o (vior)h(as)f Fr(global-next-node)f Fv(and)h Fr(global-prev-node)f Fv(while)j(simply)0 1227 y(scrolling)c(through)f(the)g(\014le)h(with)f Fr(SPC)f Fv(and)h Fr(DEL)p Fv(;)h(See)f(Section)h(D.9)e([Info)g(V)l (ariables],)i(page)f(195,)f(for)g(more)0 1289 y(information.)0 1385 y Fr(g)e Fv(\()p Fr(goto-node)p Fv(\))240 1447 y(Reads)f(the)f (name)h(of)e(a)h(no)q(de)h(and)g(selects)g(it.)19 b(No)13 b(completion)i(is)f(done)f(while)i(reading)f(the)f(no)q(de)240 1510 y(name,)18 b(since)h(the)f(desired)g(no)q(de)h(ma)o(y)e(reside)h (in)h(a)e(separate)h(\014le.)28 b(The)18 b(no)q(de)g(m)o(ust)f(b)q(e)i (t)o(yp)q(ed)240 1572 y(exactly)f(as)f(it)h(app)q(ears)g(in)g(the)g (info)g(\014le.)28 b(A)18 b(\014le)h(name)e(ma)o(y)g(b)q(e)i(included)h (as)d(with)h(an)o(y)f(no)q(de)240 1634 y(sp)q(eci\014cation,)g(for)d (example)360 1697 y Fr(g\(emacs\)Buffers)240 1771 y Fv(\014nds)i(the)f (no)q(de)h(`)p Fr(Buffers)p Fv(')d(in)j(the)g(info)f(\014le)i(`)p Fr(emacs)p Fv('.)0 1859 y Fr(C-x)e(k)g Fv(\()p Fr(kill-node)p Fv(\))240 1921 y(Kills)k(a)e(no)q(de.)26 b(The)18 b(no)q(de)g(name)f (is)g(prompted)h(for)e(in)i(the)f(ec)o(ho)g(area,)g(with)h(a)e(default) i(of)f(the)240 1984 y(curren)o(t)d(no)q(de.)20 b Fp(Killing)h Fv(a)14 b(no)q(de)g(means)g(that)g(Info)g(tries)g(hard)g(to)g(forget)f (ab)q(out)h(it,)g(remo)o(ving)g(it)240 2046 y(from)h(the)h(list)g(of)f (history)h(no)q(des)g(k)o(ept)g(for)f(the)g(windo)o(w)h(where)g(that)f (no)q(de)h(is)g(found.)22 b(Another)240 2108 y(no)q(de)16 b(is)g(selected)g(in)g(the)f(windo)o(w)h(whic)o(h)g(con)o(tained)g(the) f(killed)i(no)q(de.)0 2196 y Fr(C-x)e(C-f)f Fv(\()p Fr(view-file)p Fv(\))240 2258 y(Reads)i(the)f(name)g(of)g(a)g(\014le)h(and)f(selects)h (the)g(en)o(tire)f(\014le.)21 b(The)16 b(command)360 2320 y Fr(C-x)23 b(C-f)h Fp(\014lename)240 2395 y Fv(is)16 b(equiv)m(alen)o(t)h(to)d(t)o(yping)360 2458 y Fr(g\()p Fp(\014lename)s Fr(\)*)0 2545 y(C-x)h(C-b)f Fv(\()p Fr (list-visited-nodes)p Fv(\))240 2608 y(Mak)o(es)g(a)h(windo)o(w)h(con)o (taining)g(a)f(men)o(u)g(of)g(all)h(of)f(the)g(curren)o(tly)h(visited)g (no)q(des.)21 b(This)16 b(windo)o(w)240 2670 y(b)q(ecomes)e(the)g (selected)h(windo)o(w,)f(and)g(y)o(ou)f(ma)o(y)g(use)h(the)g(standard)g (Info)g(commands)f(within)i(it.)p eop %%Page: 187 189 187 188 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(187)0 183 y Fr(C-x)15 b(b)g Fv(\()p Fr(select-visited-node)p Fv(\))240 246 y(Selects)j(a)f(no)q(de)h(whic)o(h)g(has)g(b)q(een)g (previously)h(visited)f(in)g(a)f(visible)j(windo)o(w.)26 b(This)18 b(is)g(similar)240 308 y(to)d(`)p Fr(C-x)f(C-b)p Fv(')g(follo)o(w)o(ed)i(b)o(y)f(`)p Fr(m)p Fv(',)f(but)h(no)g(windo)o (w)h(is)f(created.)0 447 y Fu(D.4)32 b(Searc)n(hing)17 b(an)e(Info)g(File)62 553 y Fv(GNU)e(Info)h(allo)o(ws)f(y)o(ou)g(to)g (searc)o(h)g(for)g(a)g(sequence)h(of)f(c)o(haracters)g(throughout)f(an) h(en)o(tire)h(info)g(\014le,)g(searc)o(h)0 615 y(through)g(the)h (indices)h(of)f(an)f(info)h(\014le,)g(or)f(\014nd)i(areas)e(within)h (an)g(info)g(\014le)g(whic)o(h)h(discuss)f(a)g(particular)g(topic.)0 714 y Fr(s)g Fv(\()p Fr(search)p Fv(\))240 776 y(Reads)h(a)f(string)g (in)h(the)f(ec)o(ho)g(area)g(and)g(searc)o(hes)g(for)g(it.)0 867 y Fr(C-s)g Fv(\()p Fr(isearch-forward)p Fv(\))240 929 y(In)o(teractiv)o(ely)h(searc)o(hes)f(forw)o(ard)f(through)h(the)g (info)h(\014le)g(for)f(a)g(string)g(as)g(y)o(ou)f(t)o(yp)q(e)i(it.)0 1020 y Fr(C-r)f Fv(\()p Fr(isearch-backward)p Fv(\))240 1082 y(In)o(teractiv)o(ely)h(searc)o(hes)f(bac)o(kw)o(ard)g(through)f (the)i(info)f(\014le)i(for)d(a)h(string)g(as)g(y)o(ou)g(t)o(yp)q(e)g (it.)0 1173 y Fr(i)g Fv(\()p Fr(index-search)p Fv(\))240 1235 y(Lo)q(oks)i(up)g(a)g(string)g(in)h(the)f(indices)i(for)d(this)i (info)f(\014le,)h(and)f(selects)h(a)f(no)q(de)g(where)h(the)f(found)240 1297 y(index)f(en)o(try)f(p)q(oin)o(ts)h(to.)0 1388 y Fr(,)f Fv(\()p Fr(next-index-match)p Fv(\))240 1450 y(Mo)o(v)o(es)c(to) h(the)h(no)q(de)g(con)o(taining)g(the)f(next)h(matc)o(hing)f(index)i (item)f(from)e(the)i(last)f(`)p Fr(i)p Fv(')f(command.)62 1549 y(The)k(most)f(basic)h(searc)o(hing)g(command)f(is)h(`)p Fr(s)p Fv(')f(\()p Fr(search)p Fv(\).)k(The)d(`)p Fr(s)p Fv(')e(command)i(prompts)f(y)o(ou)g(for)g(a)g(string)0 1611 y(in)g(the)f(ec)o(ho)h(area,)e(and)i(then)f(searc)o(hes)h(the)f (remainder)h(of)f(the)g(info)h(\014le)g(for)f(an)g(o)q(ccurrence)h(of)f (that)g(string.)19 b(If)0 1673 y(the)c(string)g(is)h(found,)f(the)g(no) q(de)h(con)o(taining)g(it)g(is)f(selected,)h(and)g(the)f(cursor)g(is)g (left)h(p)q(ositioned)g(at)f(the)g(start)0 1736 y(of)i(the)h(found)g (string.)27 b(Subsequen)o(t)18 b(`)p Fr(s)p Fv(')f(commands)g(sho)o(w)g (y)o(ou)h(the)f(default)h(searc)o(h)g(string)f(within)i(`)p Fr([)p Fv(')e(and)0 1798 y(`)p Fr(])p Fv(';)d(pressing)i Fr(RET)f Fv(instead)g(of)g(t)o(yping)h(a)e(new)i(string)f(will)i(use)e (the)h(default)f(searc)o(h)g(string.)62 1883 y Fp(Incremen)o(tal)20 b(searc)o(hing)i Fv(is)d(similar)h(to)e(basic)h(searc)o(hing,)g(but)g (the)f(string)h(is)f(lo)q(ok)o(ed)h(up)g(while)h(y)o(ou)e(are)0 1945 y(t)o(yping)d(it,)g(instead)h(of)f(w)o(aiting)g(un)o(til)i(the)e (en)o(tire)h(searc)o(h)f(string)g(has)g(b)q(een)h(sp)q(eci\014ed.)0 2084 y Fu(D.5)32 b(Selecting)17 b(Cross)d(References)62 2190 y Fv(W)l(e)19 b(ha)o(v)o(e)e(already)i(discussed)h(the)e(`)p Fr(Next)p Fv(',)f(`)p Fr(Prev)p Fv(',)h(and)g(`)p Fr(Up)p Fv(')f(p)q(oin)o(ters)i(whic)o(h)g(app)q(ear)g(at)e(the)i(top)e(of)h(a) 0 2252 y(no)q(de.)h(In)13 b(addition)g(to)f(these)g(p)q(oin)o(ters,)g (a)g(no)q(de)h(ma)o(y)e(con)o(tain)h(other)g(p)q(oin)o(ters)g(whic)o(h) h(refer)f(y)o(ou)g(to)f(a)h(di\013eren)o(t)0 2315 y(no)q(de,)j(p)q (erhaps)h(in)g(another)f(info)h(\014le.)21 b(Suc)o(h)16 b(p)q(oin)o(ters)f(are)g(called)i Fp(cross)e(references)p Fv(,)g(or)g Fp(xrefs)i Fv(for)d(short.)0 2440 y Fj(D.5.1)30 b(P)n(arts)15 b(of)g(an)g(Xref)62 2545 y Fv(Cross)f(references)h(ha)o (v)o(e)f(t)o(w)o(o)g(ma)s(jor)f(parts:)19 b(the)14 b(\014rst)g(part)g (is)i(called)g(the)e Fp(lab)q(el)r Fv(;)i(it)f(is)g(the)g(name)f(that)g (y)o(ou)0 2608 y(can)h(use)h(to)e(refer)h(to)g(the)g(cross)g (reference,)g(and)g(the)h(second)f(is)h(the)f Fp(target)q Fv(;)f(it)h(is)h(the)f(full)h(name)f(of)g(the)g(no)q(de)0 2670 y(that)f(the)i(cross)f(reference)g(p)q(oin)o(ts)h(to.)p eop %%Page: 188 190 188 189 bop 0 -58 a Fv(188)1743 b(Octa)o(v)o(e)62 183 y(The)13 b(target)e(is)i(separated)g(from)e(the)i(lab)q(el)h(b)o(y)e(a) h(colon)g(`)p Fr(:)p Fv(';)f(\014rst)g(the)g(lab)q(el)j(app)q(ears,)d (and)h(then)g(the)g(target.)0 246 y(F)l(or)j(example,)i(in)g(the)f (sample)g(men)o(u)h(cross)e(reference)i(b)q(elo)o(w,)f(the)g(single)h (colon)g(separates)e(the)h(lab)q(el)i(from)0 308 y(the)c(target.)120 379 y Fr(*)24 b(Foo)f(Label:)g(Foo)h(Target.)46 b(More)24 b(information)e(about)h(Foo.)62 463 y Fv(Note)15 b(the)g(`)p Fr(.)p Fv(')f(whic)o(h)i(ends)g(the)f(name)h(of)e(the)i(target.)i(The)d (`)p Fr(.)p Fv(')g(is)g(not)g(part)g(of)f(the)i(target;)d(it)j(serv)o (es)e(only)0 526 y(to)h(let)g(Info)h(kno)o(w)e(where)i(the)f(target)f (name)h(ends.)62 610 y(A)g(shorthand)g(w)o(a)o(y)e(of)i(sp)q(ecifying)h (references)g(allo)o(ws)e(t)o(w)o(o)g(adjacen)o(t)g(colons)h(to)f (stand)h(for)f(a)g(target)g(name)0 672 y(whic)o(h)i(is)g(the)f(same)g (as)g(the)g(lab)q(el)i(name:)120 744 y Fr(*)24 b(Foo)f(Commands::)47 b(Commands)22 b(pertaining)h(to)g(Foo.)62 828 y Fv(In)16 b(the)f(ab)q(o)o(v)o(e)g(example,)h(the)f(name)h(of)f(the)g(target)f (is)i(the)f(same)g(as)g(the)g(name)g(of)g(the)h(lab)q(el,)g(in)g(this)g (case)0 890 y Fr(Foo)f(Commands)p Fv(.)62 974 y(Y)l(ou)i(will)h (normally)f(see)g(t)o(w)o(o)e(t)o(yp)q(es)h(of)g(cross)g(references)h (while)h(viewing)g(no)q(des:)23 b Fp(men)o(u)17 b Fv(references,)g(and) 0 1036 y Fp(note)25 b Fv(references.)43 b(Men)o(u)23 b(references)g(app)q(ear)g(within)h(a)e(no)q(de's)h(men)o(u;)j(they)d (b)q(egin)h(with)f(a)f(`)p Fr(*)p Fv(')g(at)g(the)0 1099 y(b)q(eginning)c(of)d(a)h(line,)h(and)g(con)o(tin)o(ue)f(with)g(a)g (lab)q(el,)h(a)f(target,)e(and)i(a)g(commen)o(t)f(whic)o(h)i(describ)q (es)h(what)d(the)0 1161 y(con)o(ten)o(ts)g(of)f(the)i(no)q(de)f(p)q (oin)o(ted)i(to)d(con)o(tains.)62 1245 y(Note)i(references)g(app)q(ear) g(within)g(the)g(b)q(o)q(dy)g(of)g(the)f(no)q(de)h(text;)f(they)h(b)q (egin)h(with)f Fr(*Note)p Fv(,)f(and)g(con)o(tin)o(ue)0 1307 y(with)h(a)e(lab)q(el)j(and)f(a)f(target.)62 1391 y(Lik)o(e)20 b(`)p Fr(Next)p Fv(',)e(`)p Fr(Prev)p Fv(')f(and)i(`)p Fr(Up)p Fv(')f(p)q(oin)o(ters,)h(cross)f(references)i(can)e(p)q(oin)o (t)i(to)e(an)o(y)g(v)m(alid)i(no)q(de.)31 b(They)19 b(are)0 1454 y(used)c(to)f(refer)g(y)o(ou)g(to)g(a)g(place)i(where)f(more)f (detailed)i(information)e(can)h(b)q(e)g(found)g(on)f(a)g(particular)h (sub)s(ject.)0 1516 y(Here)k(is)g(a)g(cross)f(reference)i(whic)o(h)g(p) q(oin)o(ts)f(to)f(a)g(no)q(de)i(within)g(the)f(T)l(exinfo)g(do)q(cumen) o(tation:)28 b(See)19 b(section)0 1578 y(\\W)l(riting)14 b(an)g(Xref)t(")g(in)h Fp(the)f(T)l(exinfo)h(Man)o(ual)r Fv(,)e(for)h(more)f(information)i(on)f(creating)g(y)o(our)f(o)o(wn)h (texinfo)g(cross)0 1640 y(references.)0 1764 y Fj(D.5.2)30 b(Selecting)15 b(Xrefs)62 1869 y Fv(The)h(follo)o(wing)g(table)f(lists) h(the)f(Info)h(commands)f(whic)o(h)h(op)q(erate)f(on)g(men)o(u)h (items.)0 1966 y Fr(1)f Fv(\()p Fr(menu-digit)p Fv(\))0 2029 y Fr(2)g Fv(.)8 b(.)g(.)13 b Fr(9)109 b Fv(Within)18 b(an)f(Info)g(windo)o(w,)h(pressing)g(a)e(single)j(digit,)f(\(suc)o(h)f (as)g(`)p Fr(1)p Fv('\),)e(selects)j(that)f(men)o(u)g(item,)240 2091 y(and)i(places)g(its)g(no)q(de)h(in)f(the)g(curren)o(t)f(windo)o (w.)31 b(F)l(or)18 b(con)o(v)o(enience,)j(there)d(is)h(one)g (exception;)240 2153 y(pressing)d(`)p Fr(0)p Fv(')e(selects)i(the)f Fp(last)h Fv(item)g(in)g(the)f(no)q(de's)h(men)o(u.)0 2242 y Fr(0)f Fv(\()p Fr(last-menu-item)p Fv(\))240 2305 y(Select)h(the)g(last)f(item)g(in)h(the)g(curren)o(t)f(no)q(de's)g(men) o(u.)0 2394 y Fr(m)g Fv(\()p Fr(menu-item)p Fv(\))240 2456 y(Reads)i(the)g(name)g(of)g(a)g(men)o(u)g(item)g(in)h(the)f(ec)o (ho)g(area)f(and)h(selects)h(its)f(no)q(de.)26 b(Completion)17 b(is)240 2518 y(a)o(v)m(ailable)g(while)g(reading)e(the)h(men)o(u)f (lab)q(el.)0 2608 y Fr(M-x)g(find-menu)240 2670 y Fv(Mo)o(v)o(es)f(the) h(cursor)g(to)g(the)g(start)f(of)h(this)h(no)q(de's)f(men)o(u.)p eop %%Page: 189 191 189 190 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(189)62 183 y(This)16 b(table)g(lists)g(the)f(Info)g(commands)g(whic)o (h)h(op)q(erate)f(on)h(note)f(cross)f(references.)0 289 y Fr(f)h Fv(\()p Fr(xref-item)p Fv(\))0 351 y Fr(r)216 b Fv(Reads)17 b(the)f(name)h(of)f(a)g(note)g(cross)g(reference)h(in)g (the)f(ec)o(ho)h(area)e(and)i(selects)g(its)f(no)q(de.)24 b(Com-)240 413 y(pletion)17 b(is)e(a)o(v)m(ailable)i(while)g(reading)f (the)f(cross)g(reference)g(lab)q(el.)62 518 y(Finally)l(,)i(the)e(next) g(few)g(commands)g(op)q(erate)g(on)h(men)o(u)f(or)g(note)g(references)h (alik)o(e:)0 624 y Fr(TAB)f Fv(\()p Fr(move-to-next-xref)p Fv(\))240 686 y(Mo)o(v)o(es)h(the)g(cursor)h(to)f(the)g(start)g(of)g (the)h(next)g(nearest)f(men)o(u)h(item)g(or)f(note)h(reference)g(in)h (this)240 748 y(no)q(de.)35 b(Y)l(ou)20 b(can)g(then)h(use)f Fr(RET)g Fv(\()p Fr(select-reference-this-)o(line)d Fv(to)i(select)i (the)f(men)o(u)g(or)240 811 y(note)15 b(reference.)0 908 y Fr(M-TAB)f Fv(\()p Fr(move-to-prev-xref)p Fv(\))240 970 y(Mo)o(v)o(es)g(the)h(cursor)g(the)h(start)e(of)g(the)i(nearest)f (previous)h(men)o(u)f(item)h(or)e(note)i(reference)f(in)i(this)240 1032 y(no)q(de.)0 1129 y Fr(RET)e Fv(\()p Fr(select-reference-this-)o (line)p Fv(\))240 1191 y(Selects)h(the)g(men)o(u)f(item)h(or)e(note)h (reference)h(app)q(earing)g(on)f(this)h(line.)0 1344 y Fu(D.6)32 b(Manipulating)18 b(Multiple)g(Windo)n(ws)62 1453 y Fv(A)f Fp(windo)o(w)j Fv(is)d(a)f(place)i(to)d(sho)o(w)h(the)h (text)f(of)g(a)g(no)q(de.)24 b(Windo)o(ws)16 b(ha)o(v)o(e)g(a)g(view)h (area)f(where)h(the)f(text)g(of)0 1515 y(the)f(no)q(de)g(is)h(displa)o (y)o(ed,)g(and)f(an)f(asso)q(ciated)i Fp(mo)q(de)f(line)p Fv(,)h(whic)o(h)g(brie\015y)f(describ)q(es)i(the)e(no)q(de)g(b)q(eing)i (view)o(ed.)62 1603 y(GNU)i(Info)g(supp)q(orts)f(m)o(ultiple)j(windo)o (ws)e(app)q(earing)g(in)h(a)e(single)i(screen;)g(eac)o(h)f(windo)o(w)g (is)g(separated)0 1665 y(from)12 b(the)h(next)h(b)o(y)e(its)i(mo)q (deline.)21 b(A)o(t)12 b(an)o(y)h(time,)g(there)h(is)f(only)h(one)f Fp(activ)o(e)j Fv(windo)o(w,)d(that)f(is,)i(the)f(windo)o(w)g(in)0 1727 y(whic)o(h)k(the)g(cursor)f(app)q(ears.)24 b(There)17 b(are)f(commands)g(a)o(v)m(ailable)i(for)e(creating)h(windo)o(ws,)g(c)o (hanging)f(the)h(size)0 1790 y(of)e(windo)o(ws,)g(selecting)h(whic)o(h) g(windo)o(w)g(is)f(activ)o(e,)g(and)h(for)e(deleting)j(windo)o(ws.)0 1925 y Fj(D.6.1)30 b(The)15 b(Mo)r(de)g(Line)62 2033 y Fv(A)22 b Fp(mo)q(de)f(line)26 b Fv(is)21 b(a)g(line)i(of)e(in)o(v)o (erse)h(video)g(whic)o(h)g(app)q(ears)f(at)g(the)g(b)q(ottom)g(of)g(an) g(info)h(windo)o(w.)38 b(It)0 2096 y(describ)q(es)19 b(the)e(con)o(ten)o(ts)f(of)g(the)h(windo)o(w)h(just)e(ab)q(o)o(v)o(e)h (it;)h(this)f(information)g(includes)i(the)e(name)g(of)g(the)g(\014le)0 2158 y(and)g(no)q(de)h(app)q(earing)f(in)h(that)e(windo)o(w,)h(the)g(n) o(um)o(b)q(er)g(of)g(screen)g(lines)i(it)e(tak)o(es)f(to)g(displa)o(y)i (the)f(no)q(de,)h(and)0 2220 y(the)d(p)q(ercen)o(tage)g(of)g(text)g (that)f(is)h(ab)q(o)o(v)o(e)g(the)g(top)g(of)f(the)i(windo)o(w.)k(It)15 b(can)g(also)g(tell)h(y)o(ou)f(if)g(the)g(indirect)i(tags)0 2282 y(table)f(for)f(this)i(info)f(\014le)h(needs)f(to)g(b)q(e)g(up)q (dated,)h(and)f(whether)g(or)f(not)g(the)h(info)g(\014le)h(w)o(as)e (compressed)h(when)0 2345 y(stored)f(on)g(disk.)62 2433 y(Here)g(is)g(a)f(sample)g(mo)q(de)h(line)h(for)d(a)h(windo)o(w)h(con)o (taining)g(an)f(uncompressed)h(\014le)h(named)e(`)p Fr(dir)p Fv(',)f(sho)o(wing)0 2495 y(the)i(no)q(de)h(`)p Fr(Top)p Fv('.)120 2570 y Fr(-----Info:)22 b(\(dir\)Top,)h(40)h(lines)f (--Top--------------------)o(--------)o(-------)o(----)406 2620 y(^^)72 b(^)f(^^^)191 b(^^)359 2670 y(\(file\)Node)22 b(#lines)95 b(where)p eop %%Page: 190 192 190 191 bop 0 -58 a Fv(190)1743 b(Octa)o(v)o(e)62 183 y(When)16 b(a)g(no)q(de)h(comes)e(from)g(a)h(\014le)h(whic)o(h)g(is)f (compressed)g(on)g(disk,)g(this)h(is)f(indicated)i(in)e(the)g(mo)q(de)g (line)0 246 y(with)e(t)o(w)o(o)e(small)i(`)p Fr(z)p Fv(''s.)k(In)c (addition,)h(if)f(the)f(info)h(\014le)h(con)o(taining)f(the)g(no)q(de)g (has)f(b)q(een)i(split)g(in)o(to)e(sub\014les,)i(the)0 308 y(name)g(of)g(the)g(sub\014le)i(con)o(taining)f(the)f(no)q(de)h (app)q(ears)f(in)h(the)g(mo)q(deline)h(as)e(w)o(ell:)120 378 y Fr(--zz-Info:)22 b(\(emacs\)Top,)h(291)g(lines)g(--Top--)g (Subfile:)g(emacs-1.Z---------------)62 461 y Fv(When)c(Info)f(mak)o (es)g(a)g(no)q(de)g(in)o(ternally)l(,)j(suc)o(h)d(that)g(there)g(is)g (no)h(corresp)q(onding)g(info)f(\014le)i(on)e(disk,)h(the)0 524 y(name)e(of)f(the)g(no)q(de)i(is)f(surrounded)g(b)o(y)f(asterisks)h (\(`)p Fr(*)p Fv('\).)22 b(The)17 b(name)g(itself)g(tells)h(y)o(ou)e (what)g(the)g(con)o(ten)o(ts)g(of)0 586 y(the)d(windo)o(w)g(are;)g(the) g(sample)g(mo)q(de)g(line)i(b)q(elo)o(w)e(sho)o(ws)g(an)f(in)o (ternally)j(constructed)e(no)q(de)g(sho)o(wing)g(p)q(ossible)0 648 y(completions:)120 719 y Fr(-----Info:)22 b(*Completions*,)g(7)i (lines)f(--All------------------------)o(-------)o(----)0 831 y Fj(D.6.2)30 b(Windo)n(w)16 b(Commands)62 935 y Fv(It)j(can)h(b)q(e)f(con)o(v)o(enien)o(t)h(to)f(view)g(more)g(than)g (one)g(no)q(de)h(at)e(a)h(time.)32 b(T)l(o)19 b(allo)o(w)g(this,)h (Info)g(can)f(displa)o(y)0 998 y(more)d(than)g(one)h Fp(windo)o(w)p Fv(.)24 b(Eac)o(h)16 b(windo)o(w)h(has)f(its)h(o)o(wn)f (mo)q(de)h(line)h(\(see)e(Section)i(D.6.1)c([The)j(Mo)q(de)f(Line],)0 1060 y(page)d(189\))g(and)h(history)f(of)g(no)q(des)i(view)o(ed)f(in)g (that)f(windo)o(w)h(\(see)g(Section)g(D.3)f([)p Fr(history-node)p Fv(],)e(page)j(185\).)0 1151 y Fr(C-x)h(o)g Fv(\()p Fr(next-window)p Fv(\))240 1214 y(Selects)h(the)e(next)h(windo)o(w)g(on)f(the)h(screen.) 20 b(Note)14 b(that)g(the)h(ec)o(ho)g(area)f(can)g(only)h(b)q(e)h (selected)f(if)240 1276 y(it)i(is)g(already)g(in)g(use,)g(and)g(y)o(ou) f(ha)o(v)o(e)h(left)g(it)f(temp)q(orarily)l(.)25 b(Normally)l(,)17 b(`)p Fr(C-x)e(o)p Fv(')h(simply)i(mo)o(v)o(es)240 1338 y(the)h(cursor)f(in)o(to)h(the)f(next)h(windo)o(w)g(on)f(the)h(screen,) h(or)e(if)h(y)o(ou)f(are)h(already)f(within)i(the)f(last)240 1401 y(windo)o(w,)13 b(in)o(to)h(the)f(\014rst)g(windo)o(w)g(on)g(the)h (screen.)20 b(Giv)o(en)13 b(a)g(n)o(umeric)h(argumen)o(t,)f(`)p Fr(C-x)h(o)p Fv(')f(mo)o(v)o(es)240 1463 y(o)o(v)o(er)k(that)h(man)o(y) g(windo)o(ws.)29 b(A)19 b(negativ)o(e)f(argumen)o(t)f(causes)i(`)p Fr(C-x)14 b(o)p Fv(')k(to)g(select)h(the)f(previous)240 1525 y(windo)o(w)d(on)h(the)f(screen.)0 1605 y Fr(M-x)g(prev-window)240 1667 y Fv(Selects)h(the)f(previous)g(windo)o(w)h(on)e(the)h(screen.)21 b(This)15 b(is)g(iden)o(tical)i(to)d(`)p Fr(C-x)h(o)p Fv(')f(with)h(a)g(negativ)o(e)240 1729 y(argumen)o(t.)0 1809 y Fr(C-x)g(2)g Fv(\()p Fr(split-window)p Fv(\))240 1871 y(Splits)d(the)f(curren)o(t)f(windo)o(w)h(in)o(to)f(t)o(w)o(o)g (windo)o(ws,)h(b)q(oth)g(sho)o(wing)f(the)h(same)f(no)q(de.)19 b(Eac)o(h)11 b(windo)o(w)240 1933 y(is)22 b(one)g(half)h(the)e(size)i (of)f(the)g(original)g(windo)o(w,)i(and)e(the)g(cursor)f(remains)h(in)h (the)f(original)240 1995 y(windo)o(w.)j(The)17 b(v)m(ariable)h Fr(automatic-tiling)c Fv(can)j(cause)g(all)h(of)e(the)h(windo)o(ws)g (on)g(the)f(screen)240 2058 y(to)e(b)q(e)i(resized)f(for)g(y)o(ou)f (automatically)l(,)h(please)h(see)f(Section)h(D.9)d ([automatic-tiling],)i(page)g(195)240 2120 y(for)g(more)f(information.) 0 2200 y Fr(C-x)h(0)g Fv(\()p Fr(delete-window)p Fv(\))240 2262 y(Deletes)g(the)g(curren)o(t)f(windo)o(w)h(from)f(the)h(screen.)20 b(If)15 b(y)o(ou)f(ha)o(v)o(e)g(made)h(to)q(o)f(man)o(y)g(windo)o(ws)h (and)240 2324 y(y)o(our)g(screen)g(app)q(ears)h(cluttered,)f(this)h(is) g(the)f(w)o(a)o(y)f(to)h(get)f(rid)i(of)f(some)g(of)g(them.)0 2404 y Fr(C-x)g(1)g Fv(\()p Fr(keep-one-window)p Fv(\))240 2466 y(Deletes)h(all)g(of)f(the)g(windo)o(ws)g(excepting)i(the)e (curren)o(t)g(one.)0 2545 y Fr(ESC)g(C-v)f Fv(\()p Fr (scroll-other-window)p Fv(\))240 2608 y(Scrolls)d(the)g(other)e(windo)o (w,)i(in)g(the)g(same)f(fashion)g(that)g(`)p Fr(C-v)p Fv(')f(migh)o(t)h(scroll)h(the)f(curren)o(t)g(windo)o(w.)240 2670 y(Giv)o(en)16 b(a)f(negativ)o(e)g(argumen)o(t,)f(the)h Fr(")p Fv(other)p Fr(")g Fv(windo)o(w)g(is)h(scrolled)g(bac)o(kw)o (ard.)p eop %%Page: 191 193 191 192 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(191)0 183 y Fr(C-x)15 b(^)g Fv(\()p Fr(grow-window)p Fv(\))240 246 y(Gro)o(ws)e(\(or)h(shrinks\))h(the)g(curren)o(t)g(windo) o(w.)20 b(Giv)o(en)15 b(a)f(n)o(umeric)i(argumen)o(t,)e(gro)o(ws)f(the) i(curren)o(t)240 308 y(windo)o(w)21 b(that)f(man)o(y)g(lines;)25 b(with)c(a)g(negativ)o(e)g(n)o(umeric)g(argumen)o(t,)g(the)g(windo)o(w) g(is)h(shrunk)240 370 y(instead.)0 452 y Fr(C-x)15 b(t)g Fv(\()p Fr(tile-windows)p Fv(\))240 515 y(Divides)k(the)e(a)o(v)m (ailable)i(screen)f(space)g(among)f(all)h(of)f(the)h(visible)i(windo)o (ws.)26 b(Eac)o(h)18 b(windo)o(w)f(is)240 577 y(giv)o(en)k(an)f(equal)g (p)q(ortion)h(of)f(the)g(screen)g(in)h(whic)o(h)g(to)f(displa)o(y)h (its)f(con)o(ten)o(ts.)34 b(The)21 b(v)m(ariable)240 639 y Fr(automatic-tiling)12 b Fv(can)j(cause)g Fr(tile-windows)e Fv(to)h(b)q(e)h(called)h(when)g(a)e(windo)o(w)h(is)g(created)f(or)240 702 y(deleted.)21 b(See)16 b(Section)g(D.9)e([)p Fr(automatic-tiling)p Fv(],)e(page)j(195.)0 817 y Fj(D.6.3)30 b(The)15 b(Ec)n(ho)h(Area)62 921 y Fv(The)j Fp(ec)o(ho)f(area)f Fv(is)i(a)e(one)h(line)i(windo)o(w)e (whic)o(h)h(app)q(ears)f(at)g(the)g(b)q(ottom)f(of)g(the)i(screen.)28 b(It)18 b(is)h(used)g(to)0 983 y(displa)o(y)e(informativ)o(e)f(or)f (error)g(messages,)g(and)h(to)f(read)h(lines)h(of)e(input)i(from)e(y)o (ou)g(when)i(that)e(is)h(necessary)l(.)0 1046 y(Almost)h(all)h(of)e (the)h(commands)g(a)o(v)m(ailable)h(in)g(the)f(ec)o(ho)g(area)f(are)g (iden)o(tical)j(to)d(their)i(Emacs)e(coun)o(terparts,)0 1108 y(so)g(please)i(refer)e(to)g(that)g(do)q(cumen)o(tation)h(for)e (greater)h(depth)h(of)f(discussion)i(on)f(the)f(concepts)h(of)f (editing)i(a)0 1170 y(line)f(of)f(text.)21 b(The)16 b(follo)o(wing)g (table)g(brie\015y)h(lists)f(the)g(commands)g(that)f(are)g(a)o(v)m (ailable)j(while)f(input)f(is)h(b)q(eing)0 1232 y(read)e(in)h(the)f(ec) o(ho)h(area:)0 1325 y Fr(C-f)f Fv(\()p Fr(echo-area-forward)p Fv(\))240 1388 y(Mo)o(v)o(es)f(forw)o(ard)g(a)h(c)o(haracter.)0 1470 y Fr(C-b)g Fv(\()p Fr(echo-area-backward)p Fv(\))240 1532 y(Mo)o(v)o(es)f(bac)o(kw)o(ard)h(a)f(c)o(haracter.)0 1615 y Fr(C-a)h Fv(\()p Fr(echo-area-beg-of-line)p Fv(\))240 1677 y(Mo)o(v)o(es)f(to)h(the)g(start)f(of)h(the)g(input)h(line.)0 1760 y Fr(C-e)f Fv(\()p Fr(echo-area-end-of-line)p Fv(\))240 1822 y(Mo)o(v)o(es)f(to)h(the)g(end)h(of)f(the)g(input)h(line.)0 1904 y Fr(M-f)f Fv(\()p Fr(echo-area-forward-word)o Fv(\))240 1967 y(Mo)o(v)o(es)f(forw)o(ard)g(a)h(w)o(ord.)0 2049 y Fr(M-b)g Fv(\()p Fr(echo-area-backward-wor)o(d)p Fv(\))240 2111 y(Mo)o(v)o(es)f(bac)o(kw)o(ard)h(a)f(w)o(ord.)0 2194 y Fr(C-d)h Fv(\()p Fr(echo-area-delete)p Fv(\))240 2256 y(Deletes)h(the)f(c)o(haracter)f(under)i(the)g(cursor.)0 2338 y Fr(DEL)f Fv(\()p Fr(echo-area-rubout)p Fv(\))240 2401 y(Deletes)h(the)f(c)o(haracter)f(b)q(ehind)k(the)d(cursor.)0 2483 y Fr(C-g)g Fv(\()p Fr(echo-area-abort)p Fv(\))240 2545 y(Cancels)h(or)g(quits)g(the)g(curren)o(t)f(op)q(eration.)22 b(If)16 b(completion)g(is)h(b)q(eing)g(read,)e(`)p Fr(C-g)p Fv(')f(discards)j(the)240 2608 y(text)d(of)f(the)h(input)h(line)h(whic) o(h)f(do)q(es)f(not)g(matc)o(h)f(an)o(y)h(completion.)21 b(If)14 b(the)g(input)h(line)h(is)e(empt)o(y)l(,)240 2670 y(`)p Fr(C-g)p Fv(')g(ab)q(orts)h(the)g(calling)i(function.)p eop %%Page: 192 194 192 193 bop 0 -58 a Fv(192)1743 b(Octa)o(v)o(e)0 183 y Fr(RET)15 b Fv(\()p Fr(echo-area-newline)p Fv(\))240 246 y(Accepts)h(\(or)e(forces)h(completion)h(of)t(\))e(the)i(curren)o (t)f(input)h(line.)0 337 y Fr(C-q)f Fv(\()p Fr(echo-area-quoted-inser)o (t)p Fv(\))240 399 y(Inserts)f(the)g(next)h(c)o(haracter)e(v)o (erbatim.)19 b(This)c(is)g(ho)o(w)e(y)o(ou)h(can)g(insert)h(con)o(trol) f(c)o(haracters)f(in)o(to)240 461 y(a)i(searc)o(h)g(string,)g(for)f (example.)0 552 y Fp(prin)o(ting)i(c)o(haracter)i Fv(\()p Fr(echo-area-insert)p Fv(\))240 615 y(Inserts)d(the)h(c)o(haracter.)0 706 y Fr(M-TAB)e Fv(\()p Fr(echo-area-tab-insert)p Fv(\))240 768 y(Inserts)h(a)g(T)l(AB)h(c)o(haracter.)0 859 y Fr(C-t)f Fv(\()p Fr(echo-area-transpose-ch)o(ars)p Fv(\))240 922 y(T)l(ransp)q(oses)g(the)g(c)o(haracters)g(at)f(the)i(cursor.)62 1021 y(The)f(next)f(group)g(of)g(commands)g(deal)h(with)f Fp(killing)p Fv(,)j(and)d Fp(y)o(anking)19 b Fv(text.)g(F)l(or)13 b(an)i(in)g(depth)f(discussion)i(of)0 1083 y(killing)i(and)d(y)o (anking,)g(see)h(section)f(\\Killing)j(and)d(Deleting")h(in)g Fp(the)g(GNU)f(Emacs)f(Man)o(ual)0 1183 y Fr(M-d)h Fv(\()p Fr(echo-area-kill-word)p Fv(\))240 1245 y(Kills)i(the)f(w)o(ord)e (follo)o(wing)i(the)f(cursor.)0 1336 y Fr(M-DEL)f Fv(\()p Fr(echo-area-backward-kill-wor)o(d)p Fv(\))240 1399 y(Kills)j(the)f(w)o (ord)e(preceding)j(the)e(cursor.)0 1490 y Fr(C-k)g Fv(\()p Fr(echo-area-kill-line)p Fv(\))240 1552 y(Kills)i(the)f(text)e(from)h (the)g(cursor)g(to)f(the)i(end)g(of)e(the)i(line.)0 1643 y Fr(C-x)f(DEL)f Fv(\()p Fr(echo-area-backward-kill-lin)o(e)p Fv(\))240 1705 y(Kills)j(the)f(text)e(from)h(the)g(cursor)g(to)f(the)i (b)q(eginning)h(of)e(the)g(line.)0 1797 y Fr(C-y)g Fv(\()p Fr(echo-area-yank)p Fv(\))240 1859 y(Y)l(anks)g(bac)o(k)g(the)h(con)o (ten)o(ts)e(of)h(the)g(last)g(kill.)0 1950 y Fr(M-y)g Fv(\()p Fr(echo-area-yank-pop)p Fv(\))240 2012 y(Y)l(anks)g(bac)o(k)g (a)g(previous)h(kill,)h(remo)o(ving)e(the)g(last)g(y)o(ank)o(ed)g(text) g(\014rst.)62 2112 y(Sometimes)22 b(when)g(reading)f(input)i(in)f(the)f (ec)o(ho)h(area,)f(the)h(command)f(that)g(needed)h(input)g(will)h(only) 0 2174 y(accept)d(one)f(of)g(a)h(list)g(of)f(sev)o(eral)h(c)o(hoices.) 33 b(The)20 b(c)o(hoices)g(represen)o(t)g(the)f Fp(p)q(ossible)i (completions)p Fv(,)h(and)d(y)o(ou)0 2236 y(m)o(ust)g(resp)q(ond)i (with)f(one)h(of)e(them.)35 b(Since)21 b(there)f(are)g(a)g(limited)i(n) o(um)o(b)q(er)e(of)g(resp)q(onses)g(y)o(ou)g(can)g(mak)o(e,)0 2299 y(Info)d(allo)o(ws)f(y)o(ou)g(to)g(abbreviate)h(what)f(y)o(ou)g(t) o(yp)q(e,)h(only)g(t)o(yping)f(as)h(m)o(uc)o(h)f(of)g(the)h(resp)q (onse)g(as)f(is)h(necessary)0 2361 y(to)g(uniquely)k(iden)o(tify)e(it.) 29 b(In)18 b(addition,)i(y)o(ou)d(can)i(request)f(Info)g(to)f(\014ll)j (in)f(as)e(m)o(uc)o(h)h(of)g(the)g(resp)q(onse)h(as)e(is)0 2423 y(p)q(ossible;)g(this)e(is)h(called)h Fp(completion)p Fv(.)62 2508 y(The)f(follo)o(wing)g(commands)f(are)g(a)o(v)m(ailable)h (when)g(completing)g(in)g(the)g(ec)o(ho)f(area:)0 2608 y Fr(TAB)g Fv(\()p Fr(echo-area-complete)p Fv(\))0 2670 y Fr(SPC)168 b Fv(Inserts)15 b(as)g(m)o(uc)o(h)g(of)g(a)g(completion)h (as)f(is)h(p)q(ossible.)p eop %%Page: 193 195 193 194 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(193)0 183 y Fr(?)15 b Fv(\()p Fr(echo-area-possible-compl)o(etions)p Fv(\))240 246 y(Displa)o(ys)f(a)e(windo)o(w)i(con)o(taining)g(a)e(list) i(of)f(the)g(p)q(ossible)i(completions)f(of)f(what)f(y)o(ou)h(ha)o(v)o (e)g(t)o(yp)q(ed)240 308 y(so)i(far.)k(F)l(or)c(example,)g(if)h(the)f (a)o(v)m(ailable)i(c)o(hoices)f(are:)360 369 y Fr(bar)360 419 y(foliate)360 468 y(food)360 518 y(forget)240 592 y Fv(and)f(y)o(ou)g(ha)o(v)o(e)g(t)o(yp)q(ed)h(an)f(`)p Fr(f)p Fv(',)f(follo)o(w)o(ed)h(b)o(y)g(`)p Fr(?)p Fv(',)f(the)h(p)q (ossible)i(completions)g(w)o(ould)e(con)o(tain:)360 653 y Fr(foliate)360 702 y(food)360 752 y(forget)240 826 y Fv(i.e.,)j(all)h(of)e(the)h(c)o(hoices)g(whic)o(h)h(b)q(egin)f(with)g (`)p Fr(f)p Fv('.)27 b(Pressing)18 b Fr(SPC)f Fv(or)g Fr(TAB)g Fv(w)o(ould)h(result)h(in)f(`)p Fr(fo)p Fv(')240 888 y(app)q(earing)e(in)h(the)e(ec)o(ho)h(area,)f(since)i(all)f(of)f (the)h(c)o(hoices)g(whic)o(h)h(b)q(egin)g(with)f(`)p Fr(f)p Fv(')e(con)o(tin)o(ue)j(with)240 950 y(`)p Fr(o)p Fv('.)k(No)o(w,)15 b(t)o(yping)h(`)p Fr(l)p Fv(')f(follo)o(w)o(ed)h(b)o (y)f(`)p Fr(TAB)p Fv(')g(results)h(in)h(`)p Fr(foliate)p Fv(')d(app)q(earing)j(in)f(the)g(ec)o(ho)g(area,)240 1012 y(since)g(that)f(is)h(the)f(only)h(c)o(hoice)g(whic)o(h)g(b)q (egins)g(with)g(`)p Fr(fol)p Fv('.)0 1097 y Fr(ESC)f(C-v)f Fv(\()p Fr(echo-area-scroll-completion)o(s-window)o Fv(\))240 1159 y(Scrolls)i(the)g(completions)g(windo)o(w,)f(if)h(that)e(is)i (visible,)h(or)d(the)i Fr(")p Fv(other)p Fr(")e Fv(windo)o(w)i(if)f (not.)0 1290 y Fu(D.7)32 b(Prin)n(ting)18 b(Out)d(No)r(des)62 1393 y Fv(Y)l(ou)i(ma)o(y)e(wish)i(to)f(prin)o(t)h(out)e(the)i(con)o (ten)o(ts)f(of)f(a)h(no)q(de)h(as)f(a)g(quic)o(k)h(reference)g(do)q (cumen)o(t)g(for)f(later)g(use.)0 1456 y(Info)g(pro)o(vides)g(y)o(ou)f (with)g(a)g(command)h(for)f(doing)h(this.)21 b(In)16 b(general,)f(w)o(e)g(recommend)h(that)f(y)o(ou)g(use)h(T)1835 1465 y(E)1860 1456 y(X)g(to)0 1518 y(format)e(the)h(do)q(cumen)o(t)h (and)f(prin)o(t)h(sections)f(of)g(it,)g(b)o(y)g(running)i Fr(tex)d Fv(on)h(the)h(texinfo)f(source)h(\014le.)0 1612 y Fr(M-x)f(print-node)240 1674 y Fv(Pip)q(es)h(the)e(con)o(ten)o(ts)g (of)g(the)h(curren)o(t)f(no)q(de)h(through)g(the)f(command)g(in)i(the)e (en)o(vironmen)o(t)h(v)m(ari-)240 1737 y(able)j Fr(INFO_PRINT_COMMAND)p Fv(.)25 b(If)18 b(the)g(v)m(ariable)h(do)q(esn't)e(exist,)h(the)g(no)q (de)g(is)g(simply)h(pip)q(ed)h(to)240 1799 y Fr(lpr)p Fv(.)0 1929 y Fu(D.8)32 b(Miscellaneous)16 b(Info)f(Comm)n(a)o(nds)62 2033 y Fv(GNU)g(Info)h(con)o(tains)f(sev)o(eral)g(commands)g(whic)o(h)h (self-do)q(cumen)o(t)h(GNU)e(Info:)0 2127 y Fr(M-x)g(describe-command) 240 2189 y Fv(Reads)f(the)f(name)g(of)g(an)g(Info)g(command)g(in)h(the) f(ec)o(ho)g(area)g(and)g(then)h(displa)o(ys)g(a)f(brief)h(descrip-)240 2252 y(tion)h(of)g(what)g(that)f(command)h(do)q(es.)0 2336 y Fr(M-x)g(describe-key)240 2399 y Fv(Reads)f(a)f(k)o(ey)g (sequence)i(in)f(the)f(ec)o(ho)h(area,)f(and)g(then)h(displa)o(ys)g (the)g(name)f(and)h(do)q(cumen)o(tation)240 2461 y(of)h(the)g(Info)g (command)h(that)e(the)h(k)o(ey)g(sequence)i(in)o(v)o(ok)o(es.)0 2545 y Fr(M-x)e(describe-variable)240 2608 y Fv(Reads)h(the)g(name)g (of)f(a)g(v)m(ariable)i(in)g(the)e(ec)o(ho)h(area)f(and)h(then)g (displa)o(ys)h(a)e(brief)h(description)h(of)240 2670 y(what)e(the)g(v)m(ariable)i(a\013ects.)p eop %%Page: 194 196 194 195 bop 0 -58 a Fv(194)1743 b(Octa)o(v)o(e)0 183 y Fr(M-x)15 b(where-is)240 246 y Fv(Reads)e(the)g(name)f(of)g(an)h (Info)g(command)f(in)i(the)e(ec)o(ho)h(area,)f(and)h(then)g(displa)o (ys)g(a)f(k)o(ey)h(sequence)240 308 y(whic)o(h)j(can)f(b)q(e)h(t)o(yp)q (ed)g(in)g(order)f(to)f(in)o(v)o(ok)o(e)h(that)g(command.)0 396 y Fr(C-h)g Fv(\()p Fr(get-help-window)p Fv(\))0 459 y Fr(?)216 b Fv(Creates)13 b(\(or)g(mo)o(v)o(es)g(in)o(to\))h(the)g (windo)o(w)g(displa)o(ying)i Fr(*Help*)p Fv(,)d(and)h(places)g(a)g(no)q (de)h(con)o(taining)f(a)240 521 y(quic)o(k)i(reference)f(card)g(in)o (to)g(it.)20 b(This)15 b(windo)o(w)g(displa)o(ys)h(the)f(most)f (concise)i(information)f(ab)q(out)240 583 y(GNU)g(Info)g(a)o(v)m (ailable.)0 672 y Fr(h)g Fv(\()p Fr(get-info-help-node)p Fv(\))240 734 y(T)l(ries)k(hard)f(to)g(visit)h(the)f(no)q(de)h Fr(\(info\)Help)p Fv(.)28 b(The)18 b(info)h(\014le)h(`)p Fr(info.texi)p Fv(')c(distributed)k(with)240 796 y(GNU)12 b(Info)g(con)o(tains)g(this)g(no)q(de.)19 b(Of)12 b(course,)h(the)f (\014le)g(m)o(ust)g(\014rst)f(b)q(e)i(pro)q(cessed)f(with)g Fr(makeinfo)p Fv(,)240 858 y(and)j(then)h(placed)g(in)o(to)g(the)f(lo)q (cation)h(of)f(y)o(our)f(info)i(directory)l(.)62 955 y(Here)g(are)f(the)g(commands)g(for)f(creating)i(a)f(n)o(umeric)h (argumen)o(t:)0 1052 y Fr(C-u)f Fv(\()p Fr(universal-argument)p Fv(\))240 1114 y(Starts)e(\(or)f(m)o(ultiplies)k(b)o(y)e(4\))e(the)i (curren)o(t)f(n)o(umeric)i(argumen)o(t.)j(`)p Fr(C-u)p Fv(')13 b(is)h(a)f(go)q(o)q(d)g(w)o(a)o(y)g(to)g(giv)o(e)g(a)240 1177 y(small)k(n)o(umeric)g(argumen)o(t)f(to)f(cursor)h(mo)o(v)o(emen)o (t)g(or)f(scrolling)j(commands;)e(`)p Fr(C-u)f(C-v)p Fv(')g(scrolls)240 1239 y(the)g(screen)h(4)f(lines,)h(while)h(`)p Fr(C-u)d(C-u)h(C-n)p Fv(')f(mo)o(v)o(es)h(the)g(cursor)g(do)o(wn)g(16)g (lines.)0 1327 y Fr(M-1)g Fv(\()p Fr(add-digit-to-numeric-a)o(rg)p Fv(\))0 1390 y Fr(M-2)g Fv(.)8 b(.)g(.)13 b Fr(M-9)240 1452 y Fv(Adds)h(the)f(digit)h(v)m(alue)g(of)f(the)g(in)o(v)o(oking)h (k)o(ey)f(to)f(the)i(curren)o(t)f(n)o(umeric)h(argumen)o(t.)k(Once)c (Info)f(is)240 1514 y(reading)g(a)f(n)o(umeric)i(argumen)o(t,)e(y)o(ou) g(ma)o(y)g(just)g(t)o(yp)q(e)h(the)f(digits)i(of)e(the)g(argumen)o(t,)g (without)h(the)240 1576 y(Meta)h(pre\014x.)21 b(F)l(or)14 b(example,)i(y)o(ou)f(migh)o(t)g(giv)o(e)g(`)p Fr(C-l)p Fv(')f(a)h(n)o(umeric)h(argumen)o(t)f(of)f(32)h(b)o(y)g(t)o(yping:)360 1639 y Fr(C-u)23 b(3)h(2)g(C-l)240 1715 y Fv(or)360 1778 y Fr(M-3)f(2)h(C-l)62 1875 y Fv(`)p Fr(C-g)p Fv(')11 b(is)i(used)g(to)f(ab)q(ort)f(the)i(reading)g(of)f(a)g(m)o(ulti-c)o (haracter)g(k)o(ey)g(sequence,)i(to)e(cancel)h(length)o(y)g(op)q (erations)0 1937 y(\(suc)o(h)i(as)g(m)o(ulti-\014le)i(searc)o(hes\))e (and)g(to)g(cancel)h(reading)g(input)g(in)g(the)g(ec)o(ho)f(area.)0 2034 y Fr(C-g)g Fv(\()p Fr(abort-key)p Fv(\))240 2096 y(Cancels)h(curren)o(t)f(op)q(eration.)62 2193 y(The)h(`)p Fr(q)p Fv(')e(command)h(of)g(Info)g(simply)i(quits)e(running)i(Info.)0 2290 y Fr(q)e Fv(\()p Fr(quit)p Fv(\))69 b(Exits)15 b(GNU)g(Info.)62 2386 y(If)g(the)g(op)q(erating)f(system)g(tells)i(GNU)e(Info)h(that)f (the)g(screen)h(is)g(60)f(lines)i(tall,)f(and)g(it)f(is)h(actually)h (only)f(40)0 2449 y(lines)i(tall,)e(here)h(is)g(a)e(w)o(a)o(y)h(to)f (tell)i(Info)g(that)e(the)i(op)q(erating)f(system)g(is)h(correct.)0 2545 y Fr(M-x)f(set-screen-height)240 2608 y Fv(Reads)k(a)f(heigh)o(t)h (v)m(alue)g(in)h(the)e(ec)o(ho)h(area)e(and)i(sets)f(the)h(heigh)o(t)f (of)g(the)h(displa)o(y)o(ed)h(screen)f(to)240 2670 y(that)14 b(v)m(alue.)p eop %%Page: 195 197 195 196 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(195)62 183 y(Finally)l(,)16 b(Info)e(pro)o(vides)h(a)e(con)o(v)o (enien)o(t)i(w)o(a)o(y)e(to)g(displa)o(y)j(fo)q(otnotes)d(whic)o(h)i (migh)o(t)e(b)q(e)i(asso)q(ciated)f(with)h(the)0 246 y(curren)o(t)g(no)q(de)h(that)e(y)o(ou)h(are)g(viewing:)0 342 y Fr(ESC)g(C-f)f Fv(\()p Fr(show-footnotes)p Fv(\))240 405 y(Sho)o(ws)22 b(the)g(fo)q(otnotes)g(\(if)g(an)o(y\))g(asso)q (ciated)g(with)h(the)f(curren)o(t)g(no)q(de)h(in)g(another)f(windo)o (w.)240 467 y(Y)l(ou)d(can)h(ha)o(v)o(e)e(Info)i(automatically)f (displa)o(y)i(the)e(fo)q(otnotes)f(asso)q(ciated)h(with)h(a)f(no)q(de)g (when)240 529 y(the)g(no)q(de)h(is)f(selected)h(b)o(y)f(setting)g(the)g (v)m(ariable)i Fr(automatic-footnotes)p Fv(.)28 b(See)20 b(Section)g(D.9)240 592 y([)p Fr(automatic-footnotes)p Fv(],)11 b(page)k(195.)0 727 y Fu(D.9)32 b(Manipulating)18 b(V)-6 b(ariables)62 832 y Fv(GNU)14 b(Info)g(con)o(tains)g(sev)o(eral) g Fp(v)m(ariables)i Fv(whose)e(v)m(alues)h(are)e(lo)q(ok)o(ed)i(at)e(b) o(y)g(v)m(arious)i(Info)f(commands.)19 b(Y)l(ou)0 894 y(can)12 b(c)o(hange)g(the)h(v)m(alues)g(of)f(these)g(v)m(ariables,)i (and)e(th)o(us)g(c)o(hange)g(the)g(b)q(eha)o(vior)h(of)f(Info)g(to)f (more)h(closely)i(matc)o(h)0 956 y(y)o(our)h(en)o(vironmen)o(t)g(and)h (info)f(\014le)h(reading)g(manner.)0 1053 y Fr(M-x)f(set-variable)240 1116 y Fv(Reads)i(the)f(name)g(of)f(a)h(v)m(ariable,)h(and)f(the)g(v)m (alue)i(for)d(it,)h(in)h(the)f(ec)o(ho)g(area)g(and)g(then)g(sets)g (the)240 1178 y(v)m(ariable)g(to)f(that)f(v)m(alue.)21 b(Completion)16 b(is)f(a)o(v)m(ailable)i(when)e(reading)h(the)f(v)m (ariable)h(name;)f(often,)240 1240 y(completion)e(is)g(a)o(v)m(ailable) h(when)f(reading)g(the)f(v)m(alue)i(to)e(giv)o(e)g(to)g(the)g(v)m (ariable,)i(but)f(that)e(dep)q(ends)240 1302 y(on)16 b(the)g(v)m(ariable)h(itself.)24 b(If)16 b(a)g(v)m(ariable)h(do)q(es)f Fp(not)h Fv(supply)g(m)o(ultiple)h(c)o(hoices)f(to)e(complete)i(o)o(v)o (er,)240 1365 y(it)e(exp)q(ects)h(a)f(n)o(umeric)h(v)m(alue.)0 1453 y Fr(M-x)f(describe-variable)240 1516 y Fv(Reads)h(the)g(name)g (of)f(a)g(v)m(ariable)i(in)g(the)e(ec)o(ho)h(area)f(and)h(then)g (displa)o(ys)h(a)e(brief)h(description)h(of)240 1578 y(what)e(the)g(v)m(ariable)i(a\013ects.)62 1675 y(Here)f(is)f(a)g(list) h(of)f(the)g(v)m(ariables)i(that)d(y)o(ou)h(can)h(set)f(in)h(Info.)0 1772 y Fr(automatic-footnotes)240 1834 y Fv(When)k(set)g(to)f Fr(On)p Fv(,)h(fo)q(otnotes)f(app)q(ear)h(and)g(disapp)q(ear)g (automatically)l(.)35 b(This)20 b(v)m(ariable)h(is)f Fr(On)240 1896 y Fv(b)o(y)15 b(default.)21 b(When)16 b(a)f(no)q(de)h(is)g(selected,)h(a)e(windo)o(w)g(con)o(taining)i(the)e (fo)q(otnotes)g(whic)o(h)h(app)q(ear)240 1959 y(in)h(that)f(no)q(de)h (is)g(created,)f(and)g(the)h(fo)q(otnotes)e(are)h(displa)o(y)o(ed)i (within)f(the)g(new)f(windo)o(w.)24 b(The)240 2021 y(windo)o(w)18 b(that)f(Info)h(creates)f(to)g(con)o(tain)h(the)f(fo)q(otnotes)g(is)h (called)h(`)p Fr(*Footnotes*)p Fv('.)25 b(If)18 b(a)f(no)q(de)240 2083 y(is)f(selected)g(whic)o(h)g(con)o(tains)f(no)g(fo)q(otnotes,)e (and)j(a)e(`)p Fr(*Footnotes*)p Fv(')f(windo)o(w)i(is)h(on)f(the)g (screen,)240 2145 y(the)e(`)p Fr(*Footnotes*)p Fv(')d(windo)o(w)j(is)g (deleted.)20 b(F)l(o)q(otnote)12 b(windo)o(ws)h(created)g(in)g(this)g (fashion)g(are)f(not)240 2208 y(automatically)k(tiled)g(so)f(that)f (they)i(can)f(use)h(as)e(little)j(of)e(the)g(displa)o(y)h(as)f(is)h(p)q (ossible.)0 2296 y Fr(automatic-tiling)240 2359 y Fv(When)j(set)f(to)g Fr(On)p Fv(,)g(creating)h(or)f(deleting)i(a)e(windo)o(w)h(resizes)g (other)f(windo)o(ws.)30 b(This)19 b(v)m(ariable)240 2421 y(is)d Fr(Off)f Fv(b)o(y)h(default.)21 b(Normally)l(,)16 b(t)o(yping)g(`)p Fr(C-x)e(2)p Fv(')h(divides)j(the)d(curren)o(t)h (windo)o(w)f(in)o(to)h(t)o(w)o(o)e(equal)240 2483 y(parts.)22 b(When)17 b Fr(automatic-tiling)d Fv(is)i(set)g(to)g Fr(On)p Fv(,)g(all)h(of)e(the)i(windo)o(ws)f(are)g(resized)h(automat-) 240 2545 y(ically)l(,)h(k)o(eeping)g(an)e(equal)i(n)o(um)o(b)q(er)f(of) f(lines)i(visible)h(in)e(eac)o(h)g(windo)o(w.)24 b(There)17 b(are)f(exceptions)240 2608 y(to)f(the)g(automatic)g(tiling;)i(sp)q (eci\014cally)l(,)h(the)e(windo)o(ws)g(`)p Fr(*Completions*)p Fv(')d(and)i(`)p Fr(*Footnotes*)p Fv(')240 2670 y(are)g Fp(not)h Fv(resized)g(through)f(automatic)g(tiling;)h(they)f(remain)h (their)f(original)i(size.)p eop %%Page: 196 198 196 197 bop 0 -58 a Fv(196)1743 b(Octa)o(v)o(e)0 183 y Fr(visible-bell)240 246 y Fv(When)13 b(set)f(to)g Fr(On)p Fv(,)g(GNU)h(Info)f(attempts)g(to)g(\015ash)g(the)h(screen)g(instead)g (of)f(ringing)i(the)e(b)q(ell.)21 b(This)240 308 y(v)m(ariable)12 b(is)g Fr(Off)f Fv(b)o(y)g(default.)19 b(Of)11 b(course,)g(Info)h(can)f (only)g(\015ash)h(the)f(screen)g(if)h(the)f(terminal)h(allo)o(ws)240 370 y(it;)18 b(in)h(the)e(case)h(that)e(the)i(terminal)g(do)q(es)g(not) f(allo)o(w)g(it,)h(the)g(setting)f(of)g(this)h(v)m(ariable)h(has)e(no) 240 432 y(e\013ect.)j(Ho)o(w)o(ev)o(er,)13 b(y)o(ou)i(can)g(mak)o(e)g (Info)g(p)q(erform)g(quietly)i(b)o(y)e(setting)g(the)g Fr(errors-ring-bell)240 495 y Fv(v)m(ariable)i(to)d Fr(Off)p Fv(.)0 580 y Fr(errors-ring-bell)240 642 y Fv(When)g(set)g(to)f Fr(On)p Fv(,)h(errors)f(cause)h(the)g(b)q(ell)i(to)d(ring.)20 b(The)14 b(default)h(setting)f(of)f(this)i(v)m(ariable)g(is)g Fr(On)p Fv(.)0 727 y Fr(gc-compressed-files)240 789 y Fv(When)g(set)e(to)h Fr(On)p Fv(,)g(Info)g(garbage)f(collects)j (\014les)f(whic)o(h)g(had)f(to)g(b)q(e)h(uncompressed.)20 b(The)14 b(default)240 852 y(v)m(alue)h(of)e(this)g(v)m(ariable)i(is)f Fr(Off)p Fv(.)19 b(Whenev)o(er)14 b(a)f(no)q(de)h(is)g(visited)h(in)f (Info,)f(the)h(info)g(\014le)g(con)o(taining)240 914 y(that)22 b(no)q(de)h(is)f(read)h(in)o(to)f(core,)h(and)g(Info)f(reads) h(information)f(ab)q(out)g(the)h(tags)e(and)h(no)q(des)240 976 y(con)o(tained)16 b(in)g(that)f(\014le.)21 b(Once)c(the)e(tags)f (information)i(is)g(read)f(b)o(y)g(Info,)h(it)f(is)h(nev)o(er)g (forgotten.)240 1038 y(Ho)o(w)o(ev)o(er,)11 b(the)g(actual)g(text)f(of) h(the)g(no)q(des)h(do)q(es)f(not)g(need)h(to)e(remain)i(in)f(core)g (unless)i(a)d(particular)240 1101 y(info)16 b(windo)o(w)f(needs)i(it.)j (F)l(or)15 b(non-compressed)h(\014les,)g(the)g(text)e(of)h(the)h(no)q (des)g(do)q(es)g(not)f(remain)240 1163 y(in)g(core)g(when)g(it)f(is)h (no)g(longer)f(in)i(use.)k(But)14 b(de-compressing)i(a)e(\014le)h(can)g (b)q(e)g(a)f(time)h(consuming)240 1225 y(op)q(eration,)f(and)g(so)f (Info)h(tries)g(hard)f(not)h(to)f(do)g(it)h(t)o(wice.)20 b Fr(gc-compressed-files)11 b Fv(tells)k(Info)f(it)240 1287 y(is)h(ok)m(a)o(y)f(to)g(garbage)f(collect)j(the)e(text)g(of)g (the)g(no)q(des)h(of)f(a)g(\014le)i(whic)o(h)f(w)o(as)f(compressed)g (on)h(disk.)0 1373 y Fr(show-index-match)240 1435 y Fv(When)f(set)g(to) g Fr(On)p Fv(,)f(the)i(p)q(ortion)f(of)g(the)g(matc)o(hed)g(searc)o(h)g (string)g(is)g(highligh)o(ted)i(in)f(the)f(message)240 1497 y(whic)o(h)k(explains)g(where)f(the)g(matc)o(hed)f(searc)o(h)h (string)f(w)o(as)g(found.)25 b(The)17 b(default)g(v)m(alue)h(of)f(this) 240 1559 y(v)m(ariable)g(is)f Fr(On)p Fv(.)21 b(When)15 b(Info)h(displa)o(ys)h(the)e(lo)q(cation)i(where)e(an)h(index)h(matc)o (h)e(w)o(as)f(found,)i(\(see)240 1622 y(Section)21 b(D.4)d([)p Fr(next-index-match)p Fv(],)g(page)h(187\),)g(the)h(p)q(ortion)g(of)f (the)h(string)g(that)e(y)o(ou)i(had)240 1684 y(t)o(yp)q(ed)13 b(is)f(highligh)o(ted)i(b)o(y)f(displa)o(ying)g(it)g(in)g(the)f(in)o(v) o(erse)h(case)f(from)g(its)g(surrounding)h(c)o(haracters.)0 1769 y Fr(scroll-behaviour)240 1831 y Fv(Con)o(trols)18 b(what)g(happ)q(ens)h(when)g(forw)o(ard)f(scrolling)i(is)f(requested)g (at)f(the)g(end)h(of)g(a)f(no)q(de,)h(or)240 1894 y(when)14 b(bac)o(kw)o(ard)f(scrolling)j(is)e(requested)g(at)f(the)h(b)q (eginning)i(of)e(a)f(no)q(de.)20 b(The)14 b(default)h(v)m(alue)g(for) 240 1956 y(this)h(v)m(ariable)g(is)g Fr(Continuous)p Fv(.)i(There)e(are)f(three)g(p)q(ossible)i(v)m(alues)f(for)f(this)h(v)m (ariable:)240 2041 y Fr(Continuous)480 2103 y Fv(T)l(ries)i(to)e(get)h (the)h(\014rst)e(item)i(in)g(this)g(no)q(de's)f(men)o(u,)h(or)f (failing)h(that,)f(the)g(`)p Fr(Next)p Fv(')480 2166 y(no)q(de,)h(or)f(failing)i(that,)e(the)g(`)p Fr(Next)p Fv(')f(of)h(the)h(`)p Fr(Up)p Fv('.)25 b(This)18 b(b)q(eha)o(vior)g(is) g(iden)o(tical)i(to)480 2228 y(using)11 b(the)g(`)p Fr(])p Fv(')f(\()p Fr(global-next-node)p Fv(\))e(and)j(`)p Fr([)p Fv(')f(\()p Fr(global-prev-node)p Fv(\))e(commands.)240 2313 y Fr(Next)15 b(Only)33 b Fv(Only)16 b(tries)g(to)e(get)h(the)g(`)p Fr(Next)p Fv(')f(no)q(de.)240 2398 y Fr(Page)h(Only)33 b Fv(Simply)15 b(giv)o(es)e(up,)g(c)o(hanging)h(nothing.)19 b(If)14 b Fr(scroll-behaviour)c Fv(is)k Fr(Page)h(Only)p Fv(,)d(no)480 2460 y(scrolling)17 b(command)e(can)g(c)o(hange)g(the)h (no)q(de)f(that)g(is)h(b)q(eing)g(view)o(ed.)0 2545 y Fr(scroll-step)240 2608 y Fv(The)21 b(n)o(um)o(b)q(er)g(of)f(lines)i (to)e(scroll)h(when)g(the)g(cursor)f(mo)o(v)o(es)g(out)g(of)g(the)h (windo)o(w.)36 b(Scrolling)240 2670 y(happ)q(ens)18 b(automatically)g (if)g(the)f(cursor)g(has)g(mo)o(v)o(ed)f(out)h(of)g(the)g(visible)j(p)q (ortion)d(of)g(the)g(no)q(de)p eop %%Page: 197 199 197 198 bop 0 -58 a Fv(App)q(endix)17 b(D:)e(Using)h(Info)1405 b(197)240 183 y(text)17 b(when)i(it)f(is)g(time)h(to)e(displa)o(y)l(.) 29 b(Usually)19 b(the)f(scrolling)h(is)g(done)f(so)g(as)f(to)g(put)h (the)g(cursor)240 246 y(on)g(the)g(cen)o(ter)h(line)h(of)d(the)i (curren)o(t)f(windo)o(w.)29 b(Ho)o(w)o(ev)o(er,)18 b(if)g(the)h(v)m (ariable)g Fr(scroll-step)e Fv(has)240 308 y(a)h(nonzero)h(v)m(alue,)h (Info)f(attempts)f(to)g(scroll)h(the)g(no)q(de)g(text)f(b)o(y)h(that)f (man)o(y)g(lines;)j(if)f(that)d(is)240 370 y(enough)h(to)g(bring)g(the) g(cursor)g(bac)o(k)g(in)o(to)g(the)g(windo)o(w,)h(that)e(is)h(what)g (is)g(done.)29 b(The)18 b(default)240 432 y(v)m(alue)d(of)e(this)h(v)m (ariable)g(is)g(0,)f(th)o(us)h(placing)g(the)g(cursor)f(\(and)g(the)h (text)f(it)g(is)h(attac)o(hed)f(to\))g(in)h(the)240 495 y(cen)o(ter)k(of)g(the)g(windo)o(w.)29 b(Setting)19 b(this)g(v)m (ariable)g(to)f(1)g(causes)g(a)g(kind)h(of)f Fr(")p Fv(smo)q(oth)g (scrolling)p Fr(")240 557 y Fv(whic)o(h)e(some)f(p)q(eople)i(prefer.)0 644 y Fr(ISO-Latin)240 706 y Fv(When)22 b(set)f(to)g Fr(On)p Fv(,)i(Info)f(accepts)f(and)h(displa)o(ys)h(ISO)f(Latin)g(c)o (haracters.)39 b(By)21 b(default,)j(Info)240 769 y(assumes)18 b(an)h(ASCI)q(I)g(c)o(haracter)f(set.)30 b Fr(ISO-Latin)17 b Fv(tells)i(Info)g(that)f(it)h(is)g(running)g(in)h(an)e(en)o(vi-)240 831 y(ronmen)o(t)c(where)h(the)g(Europ)q(ean)g(standard)f(c)o(haracter) g(set)g(is)i(in)f(use,)g(and)g(allo)o(ws)g(y)o(ou)f(to)g(input)240 893 y(suc)o(h)i(c)o(haracters)e(to)g(Info,)i(as)e(w)o(ell)j(as)d (displa)o(y)j(them.)p eop %%Page: 198 200 198 199 bop 0 -58 a Fv(198)1743 b(Octa)o(v)o(e)p eop %%Page: 199 201 199 200 bop 0 -58 a Fv(Concept)15 b(Index)1593 b(199)0 183 y Fs(Concept)16 b(Index)0 377 y Fu(#)0 443 y Ff(`)p Fe(#)p Ff(')6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)19 b Ff(15)0 501 y(`)p Fe(#!)p Ff(')5 b Fd(.)t(.)h(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(15)0 616 y Fu(\045)0 683 y Ff(`)p Fe(\045)p Ff(')6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)19 b Ff(15)0 797 y Fu(-)0 864 y Fe(--debug)9 b Fd(.)s(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(19)0 922 y Fe(--echo-com)o(ma)o(nds)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(20)0 980 y Fe(--help)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(19)0 1038 y Fe(--ignore-i)o(ni)o(t-f)o(il)o(e)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)16 b Ff(19)0 1096 y Fe(--info-fil)o(e)10 b Fd(\014lename)c(.)h(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(19)0 1154 y Fe(--interact)o(iv)o(e)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(19)0 1213 y Fe(--norc)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(19)0 1271 y Fe(--path)10 b Fd(path)e(.)g(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(19)0 1329 y Fe(--quiet)9 b Fd(.)s(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(19)0 1387 y Fe(--silent)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(19)0 1445 y Fe(--verbose)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)19 b Ff(20)0 1503 y Fe(--version)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)19 b Ff(20)0 1561 y Fe(-?)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)20 b Ff(19)0 1619 y Fe(-d)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(19)0 1677 y Fe(-f)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(19)0 1736 y Fe(-h)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)20 b Ff(19)0 1794 y Fe(-i)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(19)0 1852 y Fe(-p)12 b Fd(path)5 b(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(19)0 1910 y Fe(-q)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)20 b Ff(19)0 1968 y Fe(-v)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(20)0 2026 y Fe(-V)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(20)0 2084 y Fe(-x)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)20 b Ff(20)0 2199 y Fu(.)0 2266 y Fe(...)9 b Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(53,)13 b(54)0 2380 y Fu(A)0 2447 y Ff(ac)o(kno)o(wledgemen)o(ts)g Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(1)0 2505 y(addition)8 b Fd(.)h(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)21 b Ff(33)0 2563 y(am)o(usemen)o(ts)10 b Fd(.)c(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)22 b Ff(158)0 2621 y(and)14 b(op)q(erator)t Fd(.)6 b(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(35)0 2679 y(answ)o(ers,)d(incorrect)5 b Fd(.)j(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)18 b Ff(168,)13 b(170)1015 377 y(argumen)o(ts)h(in)g (function)h(call)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)25 b Ff(29)1015 435 y(arithmetic)15 b(op)q(erators)9 b Fd(.)e(.)f(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(33)1015 493 y(assignmen)o(t)15 b(expressions)5 b Fd(.)j(.)e(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)18 b Ff(37)1015 551 y(assignmen)o(t)d(op)q(erators)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)24 b Ff(37)1015 671 y Fu(B)1015 737 y Ff(b)q(o)q(dy)15 b(of)d(a)h(lo)q(op) 7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)20 b Ff(43)1015 796 y(b)q(o)q(olean)15 b(expressions)6 b Fd(.)j(.)d(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(35)1015 854 y(b)q(o)q(olean)15 b(op)q(erators)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(35)1015 912 y Fe(break)11 b Ff(statemen)o(t)d Fd(.)f(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(44)1015 970 y(bug)14 b(criteria)5 b Fd(.)j(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(168)1015 1028 y(bug)c(rep)q(ort)g(mailing)h(lists)8 b Fd(.)f(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(169)1015 1086 y(bugs)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(168)1015 1144 y(bugs,)d(in)o(v)o(estigating)6 b Fd(.)j(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(171)1015 1202 y(bugs,)c(kno)o(wn)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(167)1015 1260 y(bugs,)14 b(rep)q(orting)9 b Fd(.)f(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)21 b Ff(169)1015 1319 y(built-in)16 b(v)n(ariables)5 b Fd(.)j(.)e(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(61)1015 1439 y Fu(C)1015 1505 y Ff(c)o(haracter)c(strings)6 b Fd(.)i(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)20 b Ff(22)1015 1563 y(command)14 b(options)6 b Fd(.)i(.)f(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)19 b Ff(19)1015 1621 y(commen)o(ts)12 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)24 b Ff(15)1015 1679 y(comparison)15 b(expressions)e Fd(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(34)1015 1737 y(complex-conjugate)16 b(transp)q(ose)7 b Fd(.)g(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 20 b Ff(33)1015 1796 y Fe(continue)10 b Ff(statemen)o(t)t Fd(.)d(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(45)1015 1854 y(con)o(tributors)c Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(1)1015 1912 y(con)o(v)o(ersion)15 b(sp)q(eci\014cation)q(s)g(\()p Fe(printf)p Ff(\))6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)18 b Ff(122)1015 1970 y(con)o(v)o(ersion)d(sp)q (eci\014cation)q(s)g(\()p Fe(scanf)p Ff(\))7 b Fd(.)t(.)g(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)19 b Ff(127)1015 2028 y(cop)o(yrigh)o(t)9 b Fd(.)f(.)e(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)22 b Ff(2)1015 2086 y(core)14 b(dump)5 b Fd(.)i(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(168)1015 2206 y Fu(D)1015 2273 y Ff(D)o(AE)11 b Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(89)1015 2331 y(data)14 b(structures)d Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(27)1015 2389 y(decremen)o(t)14 b(op)q(erator)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(39)1015 2447 y(de\014ning)16 b(functions)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(49)1015 2505 y(Di\013eren)o(tial)e(Equations)5 b Fd(.)i(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(89)1015 2563 y(di\013s,)d(submitting)8 b Fd(.)g(.)e(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(171)1015 2621 y(division)6 b Fd(.)i(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(33)1015 2679 y(do)q(cumen)o(ting)e(Octa)o(v)o(e)d(programs)c Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)22 b Ff(15)p eop %%Page: 200 202 200 201 bop 0 -58 a Fv(200)1743 b(Octa)o(v)o(e)0 183 y Fu(E)0 250 y Ff(elemen)o(t-b)o(y-elemen)o(t)15 b(ev)n(aluation)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)24 b Ff(35)0 308 y Fe(else)11 b Ff(statemen)o(t)e Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)22 b Ff(41)0 366 y Fe(elseif)10 b Ff(statemen)o(t)d Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)19 b Ff(41)0 424 y Fe(end)12 b Ff(statemen)o(t)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)23 b Ff(41)0 482 y Fe(endfor)10 b Ff(statemen)o(t)d Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)19 b Ff(44)0 540 y Fe(endif)11 b Ff(statemen)o(t)d Fd(.)e(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(41)0 598 y Fe(endwhile)10 b Ff(statemen)o(t)t Fd(.)c(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(43)0 656 y(equalit)o(y)e(op)q(erator)d Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(34)0 715 y(equalit)o(y)m(,)15 b(tests)e(for)c Fd(.)d(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)23 b Ff(34)0 773 y(equations,)15 b(nonlinear)e Fd(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(87)0 831 y(erroneous)14 b(messages)9 b Fd(.)e(.)f(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(168)0 889 y(erroneous)14 b(results)6 b Fd(.)h(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(168,)13 b(170)0 947 y(error)g(messages,)h(incorrect)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(168)0 1005 y(escap)q(e)14 b(sequence)g(notation)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)17 b Ff(22)0 1063 y(executable)e(scripts)5 b Fd(.)j(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)18 b Ff(15)0 1121 y(exiting)d(o)q(cta)o(v)o(e)t Fd(.)6 b(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(11)0 1180 y(exp)q(onen)o(tiation)6 b Fd(.)i(.)e(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)17 b Ff(33)0 1238 y(expression,)e(range)c Fd(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(25)0 1296 y(expressions)12 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)22 b Ff(21)0 1354 y(expressions,)15 b(assignmen)o(t)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)21 b Ff(37)0 1412 y(expressions,)15 b(b)q(o)q(olean)d Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)22 b Ff(35)0 1470 y(expressions,)15 b(comparison)5 b Fd(.)j(.)e(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)18 b Ff(34)0 1528 y(expressions,)d(logical)t Fd(.)9 b(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(35)0 1649 y Fu(F)0 1715 y Ff(factorial)d(function)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)23 b Ff(31)0 1773 y(fatal)14 b(signal)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(168)0 1831 y(\015ag)14 b(c)o(haracter)f(\()p Fe(printf)p Ff(\))c Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(123)0 1889 y(\015ag)14 b(c)o(haracter)f(\()p Fe(scanf)p Ff(\))t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(128)0 1948 y(\015ying)e(high)f(and)g(fast)8 b Fd(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(25)0 2006 y Fe(for)12 b Ff(statemen)o(t)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(44)0 2064 y(F)m(ordyce,)13 b(A.)g(P)m(.)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)20 b Ff(153)0 2122 y(function)14 b(\014le)t Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(55)0 2180 y(functions,)e(user-de\014ned)9 b Fd(.)f(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)21 b Ff(49)0 2300 y Fu(G)0 2367 y Ff(getting)14 b(a)f(go)q(o)q(d)h(job)9 b Fd(.)d(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(25)0 2425 y(graphics)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(108)0 2483 y(greater)13 b(than)h(op)q(erator)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(34)0 2604 y Fu(H)0 2670 y Ff(help,)14 b(where)f(to)g(\014nd)t Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(172)1015 183 y(Hermitian)e(op)q (erator)10 b Fd(.)c(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 23 b Ff(33)1015 241 y(history)s Fd(.)9 b(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)17 b Ff(1)1015 357 y Fu(I)1015 423 y Fe(if)c Ff(statemen)o(t)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(41)1015 481 y(impro)o(ving)g(Octa)o(v)o(e)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)19 b Ff(169,)13 b(171)1015 540 y(incorrect)i(error)e(messages)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(168)1015 598 y(incorrect)15 b(output)c Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)23 b Ff(168,)13 b(170)1015 656 y(incorrect)i(results)t Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(168,)d(170)1015 714 y(incremen)o(t)i(op)q(erator)d Fd(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)25 b Ff(39)1015 772 y(initial)q(iza)q(tion)7 b Fd(.)i(.)d(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(20)1015 830 y(input)15 b(con)o(v)o(ersions,)g(for)d Fe(scanf)e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(128)1015 888 y(installati)q(on) 16 b(trouble)c Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 23 b Ff(167)1015 946 y(installi)q(ng)16 b(Octa)o(v)o(e)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(161)1015 1005 y(in)o(tro)q(duction)9 b Fd(.)g(.)d(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(11)1015 1063 y(in)o(v)n(alid)16 b(input)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)17 b Ff(168)1015 1178 y Fu(J)1015 1245 y Ff(job)d(h)o(un)o (ting)7 b Fd(.)g(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(25)1015 1360 y Fu(K)1015 1427 y Ff(k)o(eyw)o(ords)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 23 b Ff(32)1015 1485 y(kno)o(wn)14 b(causes)g(of)f(trouble)s Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(167)1015 1600 y Fu(L)1015 1667 y Ff(less)e(than)g(op)q(erator)s Fd(.)7 b(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(34)1015 1725 y(logical)f(expressions)c Fd(.)6 b(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(35)1015 1783 y(logical)16 b(op)q(erators)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(35)1015 1841 y(lo)q(op)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)21 b Ff(43)1015 1899 y(lottery)14 b(n)o(um)o(b)q(ers)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(159)1015 1957 y(LP)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)23 b Ff(91)1015 2015 y(lv)n(alue)t Fd(.)8 b(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(37)1015 2131 y Fu(M)1015 2197 y Ff(matc)o(hing)e(failure,)f(in)g Fe(scanf)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(127)1015 2256 y(matrices)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(23)1015 2314 y(matrix)14 b(m)o(ultipli)q(catio)q(n)e Fd(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(33)1015 2372 y(maxim)o(um)15 b(\014eld)f(width)g(\()p Fe(scanf)p Ff(\))6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(128)1015 2430 y(minim)o(um)c(\014eld)f(width)g(\()p Fe(printf)p Ff(\))9 b Fd(.)t(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)21 b Ff(123)1015 2488 y(m)o(ultipli)q(cati)q(on)t Fd(.)9 b(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)17 b Ff(33)1015 2604 y Fu(N)1015 2670 y Ff(negation)6 b Fd(.)j(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(33)p eop %%Page: 201 203 201 202 bop 0 -58 a Fv(Concept)15 b(Index)1593 b(201)0 183 y Ff(NLP)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(91)0 241 y(nonlinear)f(equations)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(87)0 299 y(nonlinear)c (programming)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(91)0 358 y(not)13 b(op)q(erator)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)19 b Ff(35)0 416 y(n)o(um)o(b)q(ers,)14 b(lottery)6 b Fd(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(159)0 474 y(n)o(um)o(b)q(ers,)14 b(prime)6 b Fd(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(159)0 532 y(n)o(umeric)c(constan)o(t)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(21)0 590 y(n)o(umeric)14 b(v)n(alue)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(21)0 698 y Fu(O)0 764 y Ff(Octa)o(v)o(e)c(command)h(options)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(19)0 823 y(ODE)10 b Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(89)0 881 y(op)q(erator)14 b(precedence)s Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)16 b Ff(39)0 939 y(op)q(erators,)e(arithmetic)s Fd(.)8 b(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)16 b Ff(33)0 997 y(op)q(erators,)e (assignmen)o(t)6 b Fd(.)i(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 19 b Ff(37)0 1055 y(op)q(erators,)14 b(b)q(o)q(olean)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)20 b Ff(35)0 1113 y(op)q(erators,)14 b(decremen)o(t)t Fd(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(39)0 1171 y(op)q(erators,)d(incremen)o(t)7 b Fd(.)g(.)f(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(39)0 1229 y(op)q(erators,)14 b(logical)f Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(35)0 1287 y(op)q(erators,)14 b(relational)f Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 24 b Ff(34)0 1346 y(optimization)7 b Fd(.)i(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(91)0 1404 y(options,)14 b(Octa)o(v)o(e)f(command)5 b Fd(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)17 b Ff(19)0 1462 y(or)c(op)q(erator)c Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(35)0 1520 y(output)14 b(con)o(v)o(ersions,)h(for)d Fe(printf)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)20 b Ff(124)0 1628 y Fu(P)0 1694 y Ff(patc)o(hes,)13 b(submitting)6 b Fd(.)j(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) 18 b Ff(171)0 1752 y(plotting)13 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(108)0 1810 y(precision)15 b(\()p Fe(printf)p Ff(\))8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(123)0 1869 y(prime)14 b(n)o(um)o(b)q(ers)e Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(159)0 1927 y(program,)13 b(self)h(con)o(tained)d Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(15)0 1985 y(programs,)14 b(do)q(cumen)o(ting)8 b Fd(.)g(.)e(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)21 b Ff(15)0 2093 y Fu(Q)0 2159 y Ff(QP)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(91)0 2217 y(quadratic)15 b(programming)8 b Fd(.)g(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)21 b Ff(91)0 2275 y(quitting)15 b(o)q(cta)o(v)o(e)d Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)24 b Ff(11)0 2334 y(quotien)o(t)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)21 b Ff(33)0 2441 y Fu(R)0 2508 y Ff(range)14 b(expressions)9 b Fd(.)f(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)21 b Ff(25)0 2566 y(relational)16 b(op)q(erators)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)20 b Ff(34)0 2624 y(rep)q(orting)15 b(bugs)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(168,)13 b(169)1015 183 y(results,)h(incorrect)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)20 b Ff(168,)13 b(170)1015 303 y Fu(S)1015 369 y Ff(script)h(\014les)9 b Fd(.)f(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)22 b Ff(49)1015 427 y(scripts,)14 b(executable)9 b Fd(.)f(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(15)1015 485 y(self)14 b(con)o(tained)h(programs)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)20 b Ff(15)1015 544 y(short-circuit)15 b(ev)n(aluation)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(36)1015 602 y(side)15 b(e\013ect)s Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 17 b Ff(37)1015 660 y(startup)8 b Fd(.)g(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(20)1015 718 y(statemen)o(ts)t Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(41)1015 776 y(strings)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)20 b Ff(22,)12 b(141)1015 834 y(structures)h Fd(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)25 b Ff(27)1015 892 y(submitting)16 b(di\013s)t Fd(.)8 b(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(171)1015 950 y(submitting)f(patc)o(hes)c Fd(.)6 b(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)23 b Ff(171)1015 1008 y(subtraction)8 b Fd(.)h(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(33)1015 1067 y(suggestions)8 b Fd(.)h(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(169)1015 1186 y Fu(T)1015 1253 y Ff(tests)14 b(for)e(equalit)o(y)5 b Fd(.)k(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)18 b Ff(34)1015 1311 y(transp)q(ose)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)20 b Ff(33)1015 1369 y(transp)q(ose,)14 b(complex-conjugate)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)23 b Ff(33)1015 1427 y(troublesho)q(oti)q(ng)6 b Fd(.)j(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)18 b Ff(167)1015 1546 y Fu(U)1015 1613 y Ff(unary)c(min)o(us)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)20 b Ff(33)1015 1671 y(unde\014ned)15 b(b)q(eha)o(vior)f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)23 b Ff(168)1015 1729 y(unde\014ned)15 b(function)g(v)n(alue)7 b Fd(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(168)1015 1787 y(use)14 b(of)f(commen)o(ts)7 b Fd(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)20 b Ff(15)1015 1845 y(user-de\014ned)15 b(functions)5 b Fd(.)j(.)e(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)19 b Ff(49)1015 1903 y(user-de\014ned)c(v)n(ariables)9 b Fd(.)f(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(25)1015 2023 y Fu(V)1015 2089 y Ff(V)m(ariable-length)16 b(argumen)o(t)e(lists)s Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(53)1015 2148 y(V)m(ariable-length)f(return)e(lists)5 b Fd(.)i(.)f(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)18 b Ff(54)1015 2206 y(v)n(ariables)5 b Fd(.)k(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)18 b Ff(61)1015 2264 y(v)n(ariables,)d(built-in)8 b Fd(.)h(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(61)1015 2322 y(v)n(ariables,)15 b(user-de\014ned)s Fd(.)9 b(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(25)1015 2441 y Fu(W)1015 2508 y Ff(w)o(arran)o(t)o(y)t Fd(.)7 b(.)f(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(2)1015 2566 y Fe(while)11 b Ff(statemen)o(t)d Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(43)1015 2624 y(wrong)14 b(answ)o(ers)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)20 b Ff(168,)13 b(170)p eop %%Page: 202 204 202 203 bop 0 -58 a Fv(202)1743 b(Octa)o(v)o(e)p eop %%Page: 203 205 203 204 bop 0 -58 a Fv(V)l(ariable)16 b(Index)1593 b(203)0 183 y Fs(V)-7 b(ariable)14 b(Index)0 353 y Fu(A)0 420 y Fe(ans)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(69)0 478 y Fe(automatic)p 182 478 12 2 v 11 w(replot)8 b Fd(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(64,)13 b(108)0 603 y Fu(D)0 669 y Fe(default)p 142 669 V 11 w(save)p 233 669 V 13 w(format)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(64,)13 b(119)0 727 y Fe(do)p 42 727 V 13 w(fortran)p 195 727 V 12 w(indexing)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)21 b Ff(64)0 852 y Fu(E)0 918 y Fe(EDITOR)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(62)0 976 y Fe(empty)p 102 976 V 12 w(list)p 194 976 V 13 w(elements)p 367 976 V 11 w(ok)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(65)0 1034 y Fe(eps)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)18 b Ff(61)0 1159 y Fu(G)0 1225 y Fe(gnuplot)p 142 1225 V 11 w(binary)10 b Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)24 b Ff(65)0 1350 y Fu(I)0 1416 y Fe(I)p Ff(,)12 b Fe(i)p Ff(,)g Fe(J)p Ff(,)g Fe(j)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(61)0 1474 y Fe(ignore)p 122 1474 V 12 w(function)p 294 1474 V 11 w(time)p 385 1474 V 12 w(stamp)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(65)0 1532 y Fe(IMAGEPATH)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)19 b Ff(62)0 1590 y Fe(implicit)p 162 1590 V 11 w(str)p 233 1590 V 13 w(to)p 286 1590 V 13 w(num)p 359 1590 V 13 w(ok)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(65)0 1649 y Fe(Inf)p Ff(,)11 b Fe(inf)c Fd(.)e(.)h(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)20 b Ff(61)0 1707 y Fe(INFO)p 82 1707 V 13 w(FILE)7 b Fd(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(62)0 1831 y Fu(L)0 1898 y Fe(LOADPATH)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(62)0 2022 y Fu(N)0 2089 y Fe(NaN)p Ff(,)11 b Fe(nan)c Fd(.)e(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(61)0 2147 y Fe(nargout)9 b Fd(.)s(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(51)0 2271 y Fu(O)0 2338 y Fe(OCTAVE)p 122 2338 V 12 w(VERSION)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)24 b Ff(63)0 2396 y Fe(ok)p 42 2396 V 13 w(to)p 95 2396 V 14 w(lose)p 189 2396 V 12 w(imaginary)p 381 2396 V 11 w(part)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(65)0 2454 y Fe(output)p 122 2454 V 12 w(max)p 194 2454 V 13 w(field)p 307 2454 V 12 w(width)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)20 b Ff(65)0 2512 y Fe(output)p 122 2512 V 12 w(precision)8 b Fd(.)s(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(65)1015 353 y Fu(P)1015 420 y Fe(page)p 1097 420 V 13 w(screen)p 1230 420 V 12 w(output)9 b Fd(.)t(.)d(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(66)1015 478 y Fe(PAGER)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)16 b Ff(63)1015 536 y Fe(pi)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)20 b Ff(61)1015 594 y Fe(prefer)p 1137 594 V 12 w(column)p 1269 594 V 12 w(vectors)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 19 b Ff(66)1015 652 y Fe(prefer)p 1137 652 V 12 w(zero)p 1229 652 V 13 w(one)p 1302 652 V 13 w(indexing)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)17 b Ff(66)1015 710 y Fe(print)p 1117 710 V 13 w(answer)p 1250 710 V 11 w(id)p 1301 710 V 14 w(name)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(66)1015 769 y Fe(print)p 1117 769 V 13 w(empty)p 1230 769 V 12 w(dimension)o(s)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)17 b Ff(66)1015 827 y Fe(propagate)p 1197 827 V 11 w(empty)p 1308 827 V 12 w(matrices)7 b Fd(.)f(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)23 b Ff(67)1015 885 y Fe(PS1)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(63)1015 943 y Fe(PS2)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(63)1015 1001 y Fe(PWD)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(69)1015 1109 y Fu(R)1015 1175 y Fe(realmax)9 b Fd(.)t(.)d(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)22 b Ff(61)1015 1233 y Fe(realmin)9 b Fd(.)t(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(61)1015 1292 y Fe(resize)p 1137 1292 V 12 w(on)p 1189 1292 V 14 w(range)p 1303 1292 V 12 w(error)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) 21 b Ff(67)1015 1350 y Fe(return)p 1137 1350 V 12 w(last)p 1229 1350 V 13 w(computed)p 1402 1350 V 11 w(value)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)23 b Ff(67)1015 1458 y Fu(S)1015 1524 y Fe(save)p 1097 1524 V 13 w(precision)5 b Fd(.)s(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(67,)12 b(119)1015 1582 y Fe(SEEK)p 1097 1582 V 13 w(CUR)d Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(61)1015 1640 y Fe(SEEK)p 1097 1640 V 13 w(END)9 b Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(61)1015 1698 y Fe(SEEK)p 1097 1698 V 13 w(SET)9 b Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(61)1015 1757 y Fe(silent)p 1137 1757 V 12 w(functions)9 b Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)22 b Ff(67)1015 1815 y Fe(split)p 1117 1815 V 13 w(long)p 1210 1815 V 12 w(rows)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(68)1015 1873 y Fe(stderr)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(62)1015 1931 y Fe(stdin)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)16 b Ff(62)1015 1989 y Fe(stdout)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 24 b Ff(62)1015 2097 y Fu(T)1015 2163 y Fe(treat)p 1117 2163 V 13 w(neg)p 1190 2163 V 13 w(dim)p 1263 2163 V 13 w(as)p 1316 2163 V 13 w(zero)9 b Fd(.)d(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)24 b Ff(68)1015 2271 y Fu(W)1015 2338 y Fe(warn)p 1097 2338 V 13 w(assign)p 1230 2338 V 12 w(as)p 1282 2338 V 13 w(truth)p 1395 2338 V 12 w(value)t Fd(.)5 b(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 18 b Ff(68)1015 2396 y Fe(warn)p 1097 2396 V 13 w(comma)p 1210 2396 V 12 w(in)p 1262 2396 V 14 w(global)p 1396 2396 V 11 w(decl)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(69)1015 2454 y Fe(warn)p 1097 2454 V 13 w(divide)p 1230 2454 V 12 w(by)p 1282 2454 V 13 w(zero)9 b Fd(.)d(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)24 b Ff(69)1015 2512 y Fe(whitespace)p 1217 2512 V 11 w(in)p 1268 2512 V 13 w(literal)p 1421 2512 V 12 w(matrix)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(64)p eop %%Page: 204 206 204 205 bop 0 -58 a Fv(204)1743 b(Octa)o(v)o(e)p eop %%Page: 205 207 205 206 bop 0 -58 a Fv(F)l(unction)16 b(Index)1582 b(205)0 183 y Fs(F)-7 b(unction)15 b(Index)0 367 y Fu(-)0 433 y Fe(-ascii)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)24 b Ff(119,)13 b(120)0 491 y Fe(-binary)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(120)0 550 y Fe(-float-bin)o(ar)o(y)9 b Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(120)0 608 y Fe(-force)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(120)0 666 y Fe(-mat-binar)o(y)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)18 b Ff(120,)13 b(121)0 724 y Fe(-save-buil)o(ti)o(ns)7 b Fd(.)s(.)f(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(120)0 857 y Fu(.)0 923 y Fe(.octaverc)6 b Fd(.)s(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)19 b Ff(20)0 1056 y Fu([)0 1123 y Fe([)p Fd(k)p Fe(,)12 b Fd(p)p Fe(,)h Fd(e)r Fe(])g(=)f(lqr)g(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(q)p Fe(,)f Fd(r)p Fe(,)h Fd(z)r Fe(\))c Fd(.)d(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)23 b Ff(98)0 1255 y Fi(~)0 1322 y Fe(~/.octaver)o(c)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)17 b Ff(20)0 1455 y Fu(A)0 1521 y Fe(abcddim)10 b(\()p Fd(a)p Fe(,)i Fd(b)p Fe(,)h Fd(c)p Fe(,)g Fd(d)q Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)18 b Ff(95)0 1579 y Fe(abs)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(72)0 1637 y Fe(acos)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(73)0 1696 y Fe(acosh)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)16 b Ff(73)0 1754 y Fe(acot)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)17 b Ff(73)0 1812 y Fe(acoth)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(73)0 1870 y Fe(acsc)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(73)0 1928 y Fe(acsch)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)16 b Ff(73)0 1986 y Fe(all)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)18 b Ff(137)0 2044 y Fe(angle)11 b(\()p Fd(x)s Fe(\))d Fd(.)d(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(72)0 2102 y Fe(any)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(137)0 2160 y Fe(are)12 b(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(c)p Fe(,)f Fd(opt)q Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)23 b Ff(95)0 2219 y Fe(arg)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(72)0 2277 y Fe(asec)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)17 b Ff(73)0 2335 y Fe(asech)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)16 b Ff(73)0 2393 y Fe(asin)t Fd(.)5 b(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(73)0 2451 y Fe(asinh)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(73)0 2509 y Fe(atan)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(73)0 2567 y Fe(atan2)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)16 b Ff(73)0 2625 y Fe(atanh)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)16 b Ff(73)0 2683 y Fe(axis)11 b(\()p Fd(limits)r Fe(\))6 b Fd(.)h(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)19 b Ff(113)1015 367 y Fu(B)1015 433 y Fe(balance)9 b Fd(.)t(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(75)1015 491 y Fe(bar)12 b(\()p Fd(x)p Fe(,)g Fd(y)s Fe(\))d Fd(.)d(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)21 b Ff(112)1015 550 y Fe(beta)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(74)1015 608 y Fe(betai)11 b(\()p Fd(a)p Fe(,)i Fd(b)p Fe(,)f Fd(x)s Fe(\))7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(74)1015 666 y Fe(bug)p 1077 666 12 2 v 13 w(report)9 b Fd(.)t(.)d(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(168,)13 b(169)1015 815 y Fu(C)1015 882 y Fe(c2d)f(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(t)q Fe(\))t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(95)1015 940 y Fe(casesen)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(159)1015 998 y Fe(cd)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)18 b Ff(146)1015 1056 y Fe(ceil)12 b(\()p Fd(x)s Fe(\))c Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(71)1015 1114 y Fe(chdir)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(147)1015 1172 y Fe(chol)12 b(\()p Fd(a)p Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 25 b Ff(77)1015 1231 y Fe(clc)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)17 b Ff(146)1015 1289 y Fe(clear)11 b Fd(pattern)j Fe(...)9 b Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) 21 b Ff(155)1015 1347 y Fe(clearplot)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(113)1015 1405 y Fe(clg)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)17 b Ff(113)1015 1463 y Fe(clock)9 b Fd(.)d(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)23 b Ff(145)1015 1521 y Fe(closeplot)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)18 b Ff(113)1015 1579 y Fe(colloc)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(93)1015 1637 y Fe(colormap)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(115)1015 1696 y Fe(columns)11 b(\()p Fd(a)p Fe(\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(154)1015 1754 y Fe(compan)11 b(\()p Fd(c)r Fe(\))e Fd(.)c(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(83)1015 1812 y Fe(complement)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(103)1015 1870 y Fe(computer)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(147)1015 1928 y Fe(cond)12 b(\()p Fd(a)p Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)25 b Ff(75)1015 1986 y Fe(conj)12 b(\()p Fd(x)s Fe(\))c Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(72)1015 2044 y Fe(contour)11 b(\()p Fd(z)p Fe(,)h Fd(n)p Fe(,)g Fd(x)p Fe(,)h Fd(y)s Fe(\))s Fd(.)7 b(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)16 b Ff(111)1015 2102 y Fe(conv)c(\()p Fd(a)p Fe(,)g Fd(b)q Fe(\))d Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(83)1015 2160 y Fe(corrcoef)10 b(\()p Fd(x)15 b Fe([,)d Fd(y)s Fe(]\))d Fd(.)d(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(105)1015 2219 y Fe(cos)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)19 b Ff(73)1015 2277 y Fe(cosh)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(73)1015 2335 y Fe(cot)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 19 b Ff(73)1015 2393 y Fe(coth)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)18 b Ff(73)1015 2451 y Fe(cov)12 b(\()p Fd(x)j Fe([,)d Fd(y)s Fe(]\))7 b Fd(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(105)1015 2509 y Fe(cputime)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(145)1015 2567 y Fe(create)p 1137 2567 V 12 w(set)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)19 b Ff(103)1015 2625 y Fe(csc)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(73)1015 2683 y Fe(csch)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)18 b Ff(73)p eop %%Page: 206 208 206 207 bop 0 -58 a Fv(206)1743 b(Octa)o(v)o(e)0 183 y Fe(cumprod)10 b(\()p Fd(x)s Fe(\))c Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(73)0 241 y Fe(cumsum)10 b(\()p Fd(x)s Fe(\))d Fd(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)20 b Ff(73)0 365 y Fu(D)0 431 y Fe(dare)11 b(\()p Fd(a)p Fe(,)h Fd(b)p Fe(,)h Fd(c)p Fe(,)g Fd(r)p Fe(,)f Fd(opt)q Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(95)0 489 y Fe(dassl)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)16 b Ff(90)0 547 y Fe(dassl)p 102 547 12 2 v 12 w(options)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)17 b Ff(90)0 605 y Fe(date)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)16 b Ff(145)0 663 y Fe(deconv)10 b(\()p Fd(y)p Fe(,)j Fd(a)p Fe(\))8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(83)0 722 y Fe(det)12 b(\()p Fd(a)p Fe(\))t Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)17 b Ff(75)0 780 y Fe(dgram)11 b(\()p Fd(a)p Fe(,)h Fd(b)q Fe(\))c Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)21 b Ff(96)0 838 y Fe(diag)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(134)0 896 y Fe(diary)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(149)0 954 y Fe(dir)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)18 b Ff(147)0 1012 y Fe(disp)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)16 b Ff(117)0 1070 y Fe(dlqe)11 b(\()p Fd(a)p Fe(,)h Fd(g)p Fe(,)h Fd(c)p Fe(,)g Fd(sigw)p Fe(,)g Fd(sigv)k Fe([,)12 b Fd(z)r Fe(]\))e Fd(.)c(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(96)0 1128 y Fe(dlqr)11 b(\()p Fd(a)p Fe(,)h Fd(b)p Fe(,)h Fd(q)p Fe(,)g Fd(r)i Fe([,)d Fd(z)r Fe(]\))d Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)22 b Ff(96)0 1187 y Fe(dlyap)11 b(\()p Fd(a)p Fe(,)h Fd(b)q Fe(\))c Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)21 b Ff(97)0 1245 y Fe(document)10 b Fd(sym)o(b)q(ol)16 b(text)11 b(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(158)0 1368 y Fu(E)0 1434 y Fe(edit)p 82 1434 V 13 w(history)t Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)17 b Ff(149)0 1492 y Fe(eig)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(75)0 1551 y Fe(erf)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(74)0 1609 y Fe(erfc)11 b(\()p Fd(z)r Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)24 b Ff(74)0 1667 y Fe(erfinv)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(74)0 1725 y Fe(error)11 b(\()p Fd(msg)s Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)22 b Ff(157)0 1783 y Fe(etime)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(145)0 1841 y Fe(eval)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)16 b Ff(153)0 1899 y Fe(exist)11 b(\()p Fd(name)r Fe(\))c Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)20 b Ff(156)0 1957 y Fe(exit)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)19 b Ff(11,)13 b(159)0 2015 y Fe(exp)f(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(71)0 2074 y Fe(expm)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(80)0 2132 y Fe(eye)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)18 b Ff(133)0 2255 y Fu(F)0 2321 y Fe(fclose)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(122)0 2379 y Fe(feof)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(131)0 2438 y Fe(ferror)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(131)0 2496 y Fe(feval)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(153)0 2554 y Fe(fflush)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(117)0 2612 y Fe(fft)12 b(\()p Fd(a)p Fe(\))s Fd(.)5 b(.)h(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(101)0 2670 y Fe(fft2)11 b(\()p Fd(a)p Fe(\))f Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)23 b Ff(101)1015 183 y Fe(fftconv)11 b(\()p Fd(a)p Fe(,)h Fd(b)p Fe(,)h Fd(N)t Fe(\))7 b Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) 19 b Ff(101)1015 241 y Fe(fftfilt)11 b(\()p Fd(b)p Fe(,)h Fd(x)p Fe(,)h Fd(N)t Fe(\))6 b Fd(.)f(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)19 b Ff(101)1015 299 y Fe(fgets)9 b Fd(.)d(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)23 b Ff(131)1015 358 y Fe(file)p 1097 358 V 13 w(in)p 1150 358 V 13 w(path)12 b(\()p Fd(path)p Fe(,)g Fd(\014le)r Fe(\))s Fd(.)c(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(158)1015 416 y Fe(filter)11 b(\()p Fd(b)p Fe(,)h Fd(a)p Fe(,)h Fd(x)s Fe(\))5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(101)1015 474 y Fe(find)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(138)1015 532 y Fe(finite)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(137)1015 590 y Fe(fix)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)24 b Ff(71)1015 648 y Fe(fliplr)7 b Fd(.)g(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)22 b Ff(138)1015 706 y Fe(flipud)7 b Fd(.)g(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)22 b Ff(138)1015 764 y Fe(floor)11 b(\()p Fd(x)s Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(71)1015 823 y Fe(flops)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(159)1015 881 y Fe(fopen)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(121)1015 939 y Fe(format)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(118)1015 997 y Fe(fprintf)11 b(\()p Fd(\014le)p Fe(,)i Fd(template)p Fe(,)g(...\))c Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)22 b Ff(122)1015 1055 y Fe(fread)11 b(\()p Fd(\014le)p Fe(,)i Fd(size)p Fe(,)h Fd(precision)p Fe(\))s Fd(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(130)1015 1113 y Fe(freport)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(131)1015 1171 y Fe(freqz)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) 23 b Ff(102)1015 1229 y Fe(frewind)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(131)1015 1287 y Fe(fscanf)11 b(\()p Fd(\014le)p Fe(,)i Fd(template)r Fe(\))t Fd(.)7 b(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 17 b Ff(127)1015 1346 y Fe(fseek)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)23 b Ff(131)1015 1404 y Fe(fsolve)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)24 b Ff(87)1015 1462 y Fe(fsolve)p 1137 1462 V 12 w(options)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)25 b Ff(87)1015 1520 y Fe(ftell)9 b Fd(.)d(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)23 b Ff(131)1015 1578 y Fe(fwrite)11 b(\()p Fd(\014le)p Fe(,)i Fd(data)p Fe(,)g Fd(precision)p Fe(\))h Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)24 b Ff(130)1015 1709 y Fu(G)1015 1775 y Fe(gamma)11 b(\()p Fd(z)r Fe(\))f Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)23 b Ff(74)1015 1833 y Fe(gammai)11 b(\()p Fd(a)p Fe(,)h Fd(x)s Fe(\))7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(74)1015 1892 y Fe(gcd)12 b(\()p Fd(x)p Fe(,)g(...\))d Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)22 b Ff(71)1015 1950 y Fe(getenv)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(146)1015 2008 y Fe(givens)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)24 b Ff(76)1015 2066 y Fe(gls)12 b(\()p Fd(Y)p Fe(,)g Fd(X)p Fe(,)g Fd(O)r Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)18 b Ff(91)1015 2124 y Fe(gplot)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(107)1015 2182 y Fe(gray)12 b(\()p Fd(n)p Fe(\))d Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(115)1015 2240 y Fe(gray2ind)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(115)1015 2298 y Fe(grid)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(112)1015 2356 y Fe(gsplot)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(107)1015 2487 y Fu(H)1015 2554 y Fe(hadamard)10 b(\()p Fd(k)r Fe(\))t Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(135)1015 2612 y Fe(hankel)11 b(\()p Fd(c)p Fe(,)h Fd(r)s Fe(\))d Fd(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(135)1015 2670 y Fe(help)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)16 b Ff(151)p eop %%Page: 207 209 207 208 bop 0 -58 a Fv(F)l(unction)16 b(Index)1582 b(207)0 183 y Fe(hess)11 b(\()p Fd(a)p Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)24 b Ff(77)0 241 y Fe(hilb)11 b(\()p Fd(n)p Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)22 b Ff(135)0 299 y Fe(hist)11 b(\()p Fd(y)p Fe(,)i Fd(x)s Fe(\))8 b Fd(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(113)0 358 y Fe(history)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(149)0 416 y Fe(hold)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(110)0 474 y Fe(home)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(146)0 605 y Fu(I)0 671 y Fe(ifft)11 b(\()p Fd(a)p Fe(\))f Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)23 b Ff(102)0 729 y Fe(ifft2)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(102)0 787 y Fe(imag)11 b(\()p Fd(x)s Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)22 b Ff(72)0 845 y Fe(image)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(115)0 904 y Fe(imagesc)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(115)0 962 y Fe(imshow)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(115)0 1020 y Fe(ind2gray)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(115)0 1078 y Fe(ind2rgb)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(116)0 1136 y Fe(input)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(118)0 1194 y Fe(int2str)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(143)0 1252 y Fe(intersecti)o(on)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(103)0 1310 y Fe(inv)12 b(\()p Fd(a)p Fe(\))t Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)17 b Ff(76)0 1369 y Fe(inverse)10 b(\()p Fd(a)p Fe(\))e Fd(.)d(.)h(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)20 b Ff(76)0 1427 y Fe(invhilb)10 b(\()p Fd(n)p Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(135)0 1485 y Fe(is)p 42 1485 12 2 v 13 w(controllab)o(le)10 b(\()p Fd(a)p Fe(,)i Fd(b)p Fe(,)g Fd(tol)q Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(97)0 1543 y Fe(is)p 42 1543 V 13 w(global)11 b(\()p Fd(a)p Fe(\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)20 b Ff(155)0 1601 y Fe(is)p 42 1601 V 13 w(leap)p 135 1601 V 13 w(year)7 b Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(146)0 1659 y Fe(is)p 42 1659 V 13 w(matrix)11 b(\()p Fd(a)p Fe(\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)20 b Ff(155)0 1717 y Fe(is)p 42 1717 V 13 w(observable)9 b(\()p Fd(a)p Fe(,)k Fd(c)p Fe(,)f Fd(tol)q Fe(\))7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(97)0 1775 y Fe(is)p 42 1775 V 13 w(scalar)11 b(\()p Fd(a)p Fe(\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)20 b Ff(155)0 1833 y Fe(is)p 42 1833 V 13 w(square)11 b(\()p Fd(x)s Fe(\))5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(155)0 1892 y Fe(is)p 42 1892 V 13 w(struct)7 b Fd(.)f(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(29)0 1950 y Fe(is)p 42 1950 V 13 w(symmetric)10 b(\()p Fd(x)p Fe(,)i Fd(tol)q Fe(\))6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(155)0 2008 y Fe(is)p 42 2008 V 13 w(vector)11 b(\()p Fd(a)p Fe(\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(155)0 2066 y Fe(isempty)10 b(\()p Fd(a)p Fe(\))d Fd(.)e(.)h(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(155)0 2124 y Fe(ishold)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(110)0 2182 y Fe(isieee)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(147)0 2240 y Fe(isinf)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(137)0 2298 y Fe(isnan)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(137)0 2356 y Fe(isstr)11 b(\()p Fd(a)p Fe(\))e Fd(.)c(.)i(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)22 b Ff(155)0 2487 y Fu(K)0 2554 y Fe(kbhit)9 b Fd(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)24 b Ff(131)0 2612 y Fe(keyboard)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(119)0 2670 y Fe(kron)11 b(\()p Fd(a)p Fe(,)h Fd(b)q Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(80)1015 183 y Fe(kurtosis)10 b(\()p Fd(x)s Fe(\))s Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)16 b Ff(105)1015 326 y Fu(L)1015 392 y Fe(lcm)c(\()p Fd(x)p Fe(,)g(...\))d Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)22 b Ff(71)1015 450 y Fe(length)11 b(\()p Fd(a)p Fe(\))d Fd(.)d(.)h(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)20 b Ff(154)1015 508 y Fe(lgamma)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 24 b Ff(74)1015 567 y Fe(linspace)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(134)1015 625 y Fe(list)p 1097 625 V 13 w(primes)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)18 b Ff(159)1015 683 y Fe(load)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(120)1015 741 y Fe(loadimage)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(116)1015 799 y Fe(log)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) 24 b Ff(72)1015 857 y Fe(log10)11 b(\()p Fd(x)s Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(72)1015 915 y Fe(log2)12 b(\()p Fd(x)s Fe(\))c Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(72)1015 973 y Fe(loglog)11 b(\()p Fd(args)r Fe(\))d Fd(.)d(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)20 b Ff(110)1015 1032 y Fe(logm)12 b(\()p Fd(a)p Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)25 b Ff(80)1015 1090 y Fe(logspace)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(134)1015 1148 y Fe(lqe)12 b(\()p Fd(a)p Fe(,)g Fd(g)p Fe(,)h Fd(c)p Fe(,)f Fd(sigw)p Fe(,)i Fd(sigv)p Fe(,)f Fd(z)r Fe(\))6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(97)1015 1206 y Fe(lqr)12 b(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(q)p Fe(,)g Fd(r)p Fe(,)f Fd(z)r Fe(\))t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(98)1015 1264 y Fe(ls)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)18 b Ff(147)1015 1322 y Fe(lsode)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)16 b Ff(89)1015 1380 y Fe(lsode)p 1117 1380 V 13 w(options)t Fd(.)s(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)17 b Ff(89)1015 1438 y Fe(lu)c(\()p Fd(a)p Fe(\))5 b Fd(.)g(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(77)1015 1496 y Fe(lyap)12 b(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(c)r Fe(\))d Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(98)1015 1639 y Fu(M)1015 1705 y Fe(mahalanobis)9 b(\()p Fd(x)p Fe(,)j Fd(y)s Fe(\))7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(105)1015 1764 y Fe(max)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(72)1015 1822 y Fe(mean)12 b(\()p Fd(a)p Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(105)1015 1880 y Fe(median)11 b(\()p Fd(a)p Fe(\))d Fd(.)d(.)h(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)20 b Ff(105)1015 1938 y Fe(menu)12 b(\()p Fd(title)p Fe(,)h Fd(opt1)p Fe(,)g Fc(:)6 b(:)g(:)g Fe(\))k Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)22 b Ff(157)1015 1996 y Fe(mesh)12 b(\()p Fd(x)p Fe(,)g Fd(y)p Fe(,)h Fd(z)r Fe(\))c Fd(.)c(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)21 b Ff(112)1015 2054 y Fe(meshdom)11 b(\()p Fd(x)p Fe(,)h Fd(y)s Fe(\))t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)16 b Ff(112)1015 2112 y Fe(min)c(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(72)1015 2255 y Fu(N)1015 2321 y Fe(nargchk)11 b(\()p Fd(nargin)p 1293 2321 V 15 w(min)p Fe(,)i Fd(nargin)p 1509 2321 V 16 w(max)p Fe(,)g Fd(n)p Fe(\))7 b Fd(.)e(.)h(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(158)1015 2379 y Fe(newtroot)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(153)1015 2438 y Fe(norm)12 b(\()p Fd(a)p Fe(,)g Fd(p)q Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(76)1015 2496 y Fe(npsol)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)16 b Ff(91)1015 2554 y Fe(npsol)p 1117 2554 V 13 w(options)t Fd(.)s(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)17 b Ff(91)1015 2612 y Fe(null)12 b(\()p Fd(a)p Fe(,)g Fd(tol)q Fe(\))6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(76)1015 2670 y Fe(num2str)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(143)p eop %%Page: 208 210 208 209 bop 0 -58 a Fv(208)1743 b(Octa)o(v)o(e)0 183 y Fu(O)0 250 y Fe(ocean)11 b(\()p Fd(n)p Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(116)0 308 y Fe(OCTAVE)p 122 308 12 2 v 12 w(HOME/lib/)o(oct)o(av)o (e/V)o(ER)o(SIO)o(N/s)o(ta)o(rtu)o(p/)o(oct)o(ave)o(rc)82 366 y Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(20)0 424 y Fe(octave)p 122 424 V 12 w(tmp)p 194 424 V 13 w(file)p 287 424 V 12 w(name)8 b Fd(.)d(.)h(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)21 b Ff(158)0 482 y Fe(ols)12 b(\()p Fd(Y)p Fe(,)f Fd(X)t Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(92)0 540 y Fe(ones)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(133)0 598 y Fe(orth)11 b(\()p Fd(a)p Fe(,)h Fd(tol)q Fe(\))6 b Fd(.)i(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)19 b Ff(76)0 719 y Fu(P)0 785 y Fe(pause)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(147)0 843 y Fe(perror)10 b(\()p Fd(name)p Fe(,)j Fd(n)o(um)p Fe(\))5 b Fd(.)h(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(157)0 901 y Fe(pinv)11 b(\()p Fd(X)p Fe(,)h Fd(tol)q Fe(\))f Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)23 b Ff(77)0 960 y Fe(plot)11 b(\()p Fd(args)r Fe(\))f Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)23 b Ff(108)0 1018 y Fe(polar)11 b(\()p Fd(theta)p Fe(,)h Fd(rho)r Fe(\))7 b Fd(.)f(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(111)0 1076 y Fe(poly)11 b(\()p Fd(a)p Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)24 b Ff(83)0 1134 y Fe(polyderiv)9 b(\()p Fd(c)r Fe(\))c Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)18 b Ff(83)0 1192 y Fe(polyinteg)9 b(\()p Fd(c)r Fe(\))c Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)18 b Ff(83)0 1250 y Fe(polyreduce)9 b(\()p Fd(c)r Fe(\))t Fd(.)c(.)h(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)16 b Ff(84)0 1308 y Fe(polyval)10 b(\()p Fd(c)p Fe(,)i Fd(x)s Fe(\))7 b Fd(.)e(.)h(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)19 b Ff(84)0 1366 y Fe(polyvalm)10 b(\()p Fd(c)p Fe(,)i Fd(x)s Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)18 b Ff(84)0 1425 y Fe(printf)10 b(\()p Fd(template)p Fe(,)k(...\))9 b Fd(.)t(.)d(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(122)0 1483 y Fe(prod)11 b(\()p Fd(x)s Fe(\))e Fd(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)22 b Ff(73)0 1541 y Fe(purge)p 102 1541 V 12 w(tmp)p 174 1541 V 13 w(files)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(113)0 1599 y Fe(pwd)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(147)0 1719 y Fu(Q)0 1786 y Fe(qpsol)s Fd(.)t(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(91)0 1844 y Fe(qpsol)p 102 1844 V 12 w(options)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(91)0 1902 y Fe(qr)12 b(\()p Fd(a)p Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)18 b Ff(78)0 1960 y Fe(quad)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(93)0 2018 y Fe(quad)p 82 2018 V 13 w(options)5 b Fd(.)s(.)h(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)18 b Ff(93)0 2076 y Fe(quit)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)19 b Ff(11,)13 b(159)0 2134 y Fe(qzhess)d(\()p Fd(a)p Fe(,)j Fd(b)q Fe(\))7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(80)0 2193 y Fe(qzval)11 b(\()p Fd(a)p Fe(,)h Fd(b)q Fe(\))c Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)21 b Ff(81)0 2313 y Fu(R)0 2379 y Fe(rand)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)16 b Ff(133)0 2438 y Fe(rank)11 b(\()p Fd(a)p Fe(,)h Fd(tol)q Fe(\))6 b Fd(.)i(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(77)0 2496 y Fe(real)11 b(\()p Fd(x)s Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)22 b Ff(72)0 2554 y Fe(rem)12 b(\()p Fd(x)p Fe(,)g Fd(y)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(72)0 2612 y Fe(replot)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(108)0 2670 y Fe(reshape)8 b Fd(.)s(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(139)1015 183 y Fe(residue)11 b(\()p Fd(b)p Fe(,)h Fd(a)p Fe(,)h Fd(tol)q Fe(\))d Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 23 b Ff(84)1015 241 y Fe(rgb2ind)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(116)1015 299 y Fe(roots)11 b(\()p Fd(v)s Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)21 b Ff(85)1015 358 y Fe(rot90)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(138)1015 416 y Fe(round)11 b(\()p Fd(x)s Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(71)1015 474 y Fe(rows)12 b(\()p Fd(a)p Fe(\))e Fd(.)c(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)23 b Ff(154)1015 532 y Fe(run)p 1077 532 V 13 w(history)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)18 b Ff(149)1015 802 y Fu(S)1015 868 y Fe(save)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(119)1015 927 y Fe(saveimage)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(116)1015 985 y Fe(scanf)11 b(\()p Fd(template)r Fe(\))t Fd(.)c(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) 16 b Ff(127)1015 1043 y Fe(schur)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)16 b Ff(79)1015 1101 y Fe(sec)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(73)1015 1159 y Fe(sech)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(73)1015 1217 y Fe(semilogx)10 b(\()p Fd(args)r Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(110)1015 1275 y Fe(semilogy)10 b(\()p Fd(args)r Fe(\))5 b Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)18 b Ff(110)1015 1333 y Fe(set)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)17 b Ff(108)1015 1391 y Fe(setstr)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(143)1015 1450 y Fe(shell)p 1117 1450 V 13 w(cmd)8 b Fd(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(146)1015 1508 y Fe(show)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)16 b Ff(108)1015 1566 y Fe(sign)c(\()p Fd(x)s Fe(\))c Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(71)1015 1624 y Fe(sin)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(73)1015 1682 y Fe(sinc)12 b(\()p Fd(x)s Fe(\))d Fd(.)t(.)d(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(102)1015 1740 y Fe(sinh)t Fd(.)5 b(.)h(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(73)1015 1798 y Fe(size)12 b(\()p Fd(a)p Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(155)1015 1856 y Fe(skewness)10 b(\()p Fd(x)s Fe(\))s Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(105)1015 1914 y Fe(sombrero)10 b(\()p Fd(n)p Fe(\))t Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(113)1015 1973 y Fe(sort)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)16 b Ff(139)1015 2031 y Fe(sprintf)11 b(\()p Fd(template)p Fe(,)i(...\))8 b Fd(.)t(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)20 b Ff(122)1015 2089 y Fe(sqrt)12 b(\()p Fd(x)s Fe(\))c Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(72)1015 2147 y Fe(sqrtm)11 b(\()p Fd(a)p Fe(\))f Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)23 b Ff(80)1015 2205 y Fe(sscanf)11 b(\()p Fd(string)p Fe(,)i Fd(template)r Fe(\))6 b Fd(.)i(.)e(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)19 b Ff(127)1015 2263 y Fe(stairs)11 b(\()p Fd(x)p Fe(,)h Fd(y)s Fe(\))5 b Fd(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)17 b Ff(112)1015 2321 y Fe(std)12 b(\()p Fd(a)p Fe(\))s Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(105)1015 2379 y Fe(strcmp)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(143)1015 2438 y Fe(sum)12 b(\()p Fd(x)s Fe(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(73)1015 2496 y Fe(sumsq)11 b(\()p Fd(x)s Fe(\))d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(74)1015 2554 y Fe(svd)12 b(\()p Fd(a)p Fe(\))t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)17 b Ff(79)1015 2612 y Fe(syl)12 b(\()p Fd(a)p Fe(,)g Fd(b)p Fe(,)h Fd(c)r Fe(\))e Fd(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)24 b Ff(81)1015 2670 y Fe(system)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(146)p eop %%Page: 209 211 209 210 bop 0 -58 a Fv(F)l(unction)16 b(Index)1582 b(209)0 183 y Fu(T)0 250 y Fe(tan)6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)18 b Ff(73)0 308 y Fe(tanh)t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)17 b Ff(73)0 366 y Fe(texas)p 102 366 12 2 v 12 w(lotto)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(159)0 424 y Fe(tic)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(145)0 482 y Fe(title)11 b(\()p Fd(string)s Fe(\))s Fd(.)c(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)16 b Ff(112)0 540 y Fe(toc)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)18 b Ff(145)0 598 y Fe(toeplitz)10 b(\()p Fd(c)p Fe(,)i Fd(r)s Fe(\))7 b Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(135)0 656 y Fe(trace)11 b(\()p Fd(a)p Fe(\))e Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(77)0 715 y Fe(tril)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(140)0 773 y Fe(triu)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)16 b Ff(140)0 831 y Fe(type)11 b Fd(name)16 b Fe(...)9 b Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)22 b Ff(158)0 889 y Fe(tzero)11 b(\()p Fd(a)p Fe(,)h Fd(b)p Fe(,)h Fd(c)p Fe(,)f Fd(d)p Fe(,)h Fd(bal)q Fe(\))c Fd(.)e(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)21 b Ff(99)0 997 y Fu(U)0 1063 y Fe(undo)p 82 1063 V 13 w(string)p 215 1063 V 11 w(escapes)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 20 b Ff(143)0 1121 y Fe(union)9 b Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 24 b Ff(103)0 1180 y Fe(usage)11 b(\()p Fd(msg)s Fe(\))e Fd(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)22 b Ff(157)0 1287 y Fu(V)0 1354 y Fe(va)p 42 1354 V 13 w(arg)5 b Fd(.)g(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)17 b Ff(53)1015 183 y Fe(va)p 1057 183 V 14 w(start)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(53)1015 241 y Fe(vander)11 b(\()p Fd(c)r Fe(\))d Fd(.)d(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(135)1015 299 y Fe(version)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(147)1015 358 y Fe(vr)p 1057 358 V 14 w(val)5 b Fd(.)t(.)h(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)18 b Ff(54)1015 497 y Fu(W)1015 563 y Fe(warning)11 b(\()p Fd(msg)s Fe(\))c Fd(.)e(.)h(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)19 b Ff(157)1015 621 y Fe(which)11 b Fd(name)16 b Fe(...)8 b Fd(.)d(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)20 b Ff(158)1015 679 y Fe(who)12 b Fd(options)k(pattern)e Fe(...)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(156)1015 737 y Fe(whos)s Fd(.)5 b(.)h(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(156)1015 876 y Fu(X)1015 943 y Fe(xlabel)11 b(\()p Fd(string)s Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)23 b Ff(113)1015 1082 y Fu(Y)1015 1148 y Fe(ylabel)11 b(\()p Fd(string)s Fe(\))g Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(113)1015 1287 y Fu(Z)1015 1354 y Fe(zeros)9 b Fd(.)d(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)23 b Ff(133)p eop %%Page: 210 212 210 211 bop 0 -58 a Fv(210)1743 b(Octa)o(v)o(e)p eop %%Page: 211 213 211 212 bop 0 -58 a Fv(Op)q(erator)15 b(Index)1576 b(211)0 183 y Fs(Op)r(erator)16 b(Index)0 367 y Fu(!)0 434 y Ff(!)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)17 b Ff(35)0 492 y(!=)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)19 b Ff(34)0 600 y Fu(&)0 666 y Ff(&)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(35)0 724 y(&&)5 b Fd(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)18 b Ff(36)0 832 y Fu(')0 899 y Ff(')7 b Fd(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(22,)13 b(33)0 1007 y Fu(*)0 1073 y Ff(*)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)21 b Ff(33)0 1131 y(**)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(33)0 1239 y Fu(,)0 1306 y Ff(,)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)17 b Ff(23)0 1413 y Fu(-)0 1480 y Ff(-)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(33)0 1538 y({)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)21 b Ff(39)0 1646 y Fu(.)0 1712 y Ff(.')7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(33)0 1770 y(.*)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)16 b Ff(33)0 1829 y(.**)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)23 b Ff(33)0 1887 y(.-)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(33)0 1945 y(./)s Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)16 b Ff(33)0 2003 y(.)p Fe(+)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(33)0 2061 y(.)p Fe(^)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)24 b Ff(33)0 2119 y(.)p Fe(\\)11 b Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)24 b Ff(33)0 2227 y Fu(/)0 2293 y Ff(/)8 b Fd(.)f(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)21 b Ff(33)0 2401 y Fu(:)0 2468 y Ff(:)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)17 b Ff(25)0 2576 y Fu(;)0 2642 y Ff(;)t Fd(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(23)1015 367 y Fu(=)1015 434 y Ff(=)s Fd(.)7 b(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(37)1015 492 y(==)5 b Fd(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(34)1015 606 y Fu([)1015 672 y Ff([)t Fd(.)6 b(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)17 b Ff(23)1015 786 y Fu(])1015 852 y Ff(])t Fd(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)17 b Ff(23)1015 966 y Fi(")1015 1032 y Fe(")8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)21 b Ff(22)1015 1146 y Fi(|)1015 1213 y Fe(|)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(35)1015 1271 y Fe(||)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)20 b Ff(36)1015 1384 y Fi(~)1015 1451 y Fe(~)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)21 b Ff(35)1015 1509 y Fe(~)p Ff(=)10 b Fd(.)c(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(34)1015 1623 y Fi(+)1015 1689 y Fe(+)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)21 b Ff(33)1015 1747 y Fe(++)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(39)1015 1861 y Fi(>)1015 1927 y Fe(>)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)21 b Ff(34)1015 1985 y Fe(>)p Ff(=)10 b Fd(.)c(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(34)1015 2099 y Fi(^)1015 2166 y Fe(^)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)21 b Ff(33)1015 2279 y Fi(\\)1015 2346 y Fe(\\)8 b Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)21 b Ff(33)1015 2460 y Fi(<)1015 2526 y Fe(<)8 b Fd(.)e(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(34)1015 2584 y Fe(<)p Ff(=)10 b Fd(.)c(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)24 b Ff(34)1015 2642 y Fe(<>)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(34)p eop %%Page: 212 214 212 213 bop 0 -58 a Fv(212)1743 b(Octa)o(v)o(e)p eop %%Page: 213 215 213 214 bop 0 -58 a Fv(Readline)18 b(Index)1584 b(213)0 183 y Fs(Readline)14 b(Index)0 362 y Fu(A)0 428 y Fe(abort)d(\(C-G\))6 b Fd(.)t(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)19 b Ff(180)0 486 y Fe(accept-lin)o(e)10 b(\(Newline)o(,)g(Return\))t Fd(.)s(.)c(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(177)0 608 y Fu(B)0 675 y Fe(backward-c)o(ha)o(r)10 b(\(C-B\))5 b Fd(.)t(.)h(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)18 b Ff(177)0 733 y Fe(backward-d)o(el)o(ete)o (-c)o(har)9 b(\(Rubout\))g Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(178)0 791 y Fe(backward-k)o(il)o (l-l)o(in)o(e)10 b(\(\))g Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(179)0 849 y Fe(backward-k)o(il)o(l-w)o(or)o(d)10 b(\(M-DEL\))t Fd(.)t(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)17 b Ff(179)0 907 y Fe(backward-w)o(or)o(d) 10 b(\(M-B\))5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(177)0 965 y Fe(beginning-)o(of)o(-hi)o(st)o(ory)9 b(\(M-<\))t Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)17 b Ff(178)0 1024 y Fe(beginning-)o(of)o (-li)o(ne)9 b(\(C-A\))f Fd(.)t(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(177)0 1146 y Fu(C)0 1212 y Fe(capitalize)o(-w)o(ord)9 b(\(M-C\))g Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(179)0 1270 y Fe(clear-scre)o(en)9 b(\(C-L\))d Fd(.)t(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)19 b Ff(177)0 1328 y Fe(complete)10 b(\(TAB\))f Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)24 b Ff(180)0 1451 y Fu(D)0 1517 y Fe(delete-cha)o(r)10 b(\(C-D\))d Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(178)0 1575 y Fe(digit-argu)o(me)o(nt)9 b(\(M-0,)i(M-1,)h(...)f (M--\))t Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)17 b Ff(179)0 1633 y Fe(do-upperca)o(se)o(-ve)o(rs)o(ion)9 b(\(M-A,)i(M-B,)g(...\))c Fd(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(180)0 1691 y Fe(downcase-w)o(or)o(d)10 b(\(M-L\))5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(179)0 1814 y Fu(E)0 1880 y Fe(editing-mo)o(de)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)23 b Ff(176)0 1938 y Fe(end-of-his)o(to)o(ry)9 b(\(M->\))s Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(178)0 1996 y Fe(end-of-lin)o(e)10 b(\(C-E\))d Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(177)0 2118 y Fu(F)0 2185 y Fe(forward-ch)o(ar)9 b(\(C-F\))d Fd(.)t(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)19 b Ff(177)0 2243 y Fe(forward-se)o(ar)o(ch-)o(hi)o (sto)o(ry)9 b(\(C-S\))g Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(178)0 2301 y Fe(forward-wo)o(rd)9 b(\(M-F\))d Fd(.)t(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(177)0 2423 y Fu(H)0 2490 y Fe(horizontal)o(-s)o(cro)o(ll)o(-mo)o (de)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(176)0 2612 y Fu(I)0 2678 y Fe(interactio)o(n,)9 b(readline)f Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(173)1015 362 y Fu(K)1015 428 y Fe(kill-line)10 b(\(C-K\))e Fd(.)e(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(179)1015 486 y Fe(kill-word)10 b(\(M-D\))e Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(179)1015 614 y Fu(M)1015 680 y Fe(mark-modifi)o(ed)o(-li)o(nes)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)22 b Ff(176)1015 808 y Fu(N)1015 874 y Fe(next-histor)o(y)10 b(\(C-N\))c Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)18 b Ff(178)1015 1002 y Fu(P)1015 1069 y Fe(possible-co)o(mp)o(let)o(ion)o(s)10 b(\(M-?\))t Fd(.)t(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)17 b Ff(180)1015 1127 y Fe(prefer-visi)o(bl)o(e-b)o(ell) 6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(176)1015 1185 y Fe(prefix-meta)9 b(\(ESC\))e Fd(.)t(.)f(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)20 b Ff(180)1015 1243 y Fe(previous-hi)o(st)o(ory)9 b(\(C-P\))f Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(178)1015 1371 y Fu(Q)1015 1437 y Fe(quoted-inse)o(rt)9 b(\(C-Q,)i(C-V\))e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)23 b Ff(178)1015 1565 y Fu(R)1015 1631 y Fe(re-read-ini)o(t-)o(fil)o(e)10 b(\(C-X)h(C-R\))6 b Fd(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(180)1015 1689 y Fe(reverse-sea)o(rc)o(h-h)o(ist)o (or)o(y)10 b(\(C-R\))e Fd(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(178)1015 1747 y Fe(revert-line)9 b(\(M-R\))e Fd(.)t(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(180)1015 1875 y Fu(S)1015 1941 y Fe(self-insert)9 b(\(a,)j(b,)g(A,)g(1,)g(!,)g(...\))5 b Fd(.)t(.)i(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(178)1015 2069 y Fu(T)1015 2136 y Fe(tab-insert)9 b(\(M-TAB\))d Fd(.)t(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(178)1015 2194 y Fe(transpose-c)o (ha)o(rs)10 b(\(C-T\))e Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(178)1015 2252 y Fe(transpose-w)o(or)o(ds)10 b(\(M-T\))e Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(178)1015 2379 y Fu(U)1015 2446 y Fe(undo)12 b(\(C-)p 1169 2446 12 2 v 13 w(\))e Fd(.)c(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(180)1015 2504 y Fe(universal-a)o (rg)o(ume)o(nt)9 b(\(\))h Fd(.)c(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(180)1015 2562 y Fe(unix-line-d)o(is)o(car)o(d)10 b(\(C-U\))e Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(179)1015 2620 y Fe(unix-word-r)o(ub)o(out)9 b(\(C-W\))f Fd(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)22 b Ff(179)1015 2678 y Fe(upcase-word)9 b(\(M-U\))e Fd(.)t(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(179)p eop %%Page: 214 216 214 215 bop 0 -58 a Fv(214)1743 b(Octa)o(v)o(e)0 183 y Fu(Y)0 250 y Fe(yank)11 b(\(C-Y\))d Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(179)1015 183 y Fe(yank-pop)10 b(\(M-Y\))f Fd(.)d(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(179)p eop %%Page: 215 217 215 216 bop 0 -58 a Fv(Info)15 b(Index)1679 b(215)0 183 y Fs(Info)15 b(Index)0 362 y Fu(,)0 428 y Fe(,)d(in)g(Info)g(windows)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(187)0 540 y Fu(?)0 607 y Fe(?,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(194)0 665 y Fe(?,)12 b(in)g(the)g(Info)f(echo)g(area)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)16 b Ff(193)0 777 y Fu([)0 843 y Fe([,)c(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)17 b Ff(186)0 955 y Fu(])0 1022 y Fe(],)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)17 b Ff(186)0 1134 y Fi(>)0 1200 y Fe(>,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)17 b Ff(186)0 1312 y Fi(<)0 1379 y Fe(<,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)17 b Ff(186)0 1491 y Fu(0)0 1557 y Fe(0,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)17 b Ff(188)0 1670 y Fu(1)0 1736 y Fe(1)12 b Fc(:)6 b(:)h(:)18 b Fe(9,)12 b(in)g(Info)g(windows)7 b Fd(.)s(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(188)0 1848 y Fu(A)0 1914 y Fe(abort-key)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(194)0 1973 y Fe(add-digit-)o(to)o(-nu)o(me)o(ric)o(-ar)o(g)s Fd(.)s(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)16 b Ff(194)0 2031 y Fe(automatic-)o(fo)o(otn)o (ot)o(es)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(195)0 2089 y Fe(automatic-)o(ti)o(lin)o(g)5 b Fd(.)s(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(195)0 2201 y Fu(B)0 2267 y Fe(b,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(184)0 2325 y Fe(backward-c)o(ha)o(r)9 b Fd(.)s(.)d(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(183)0 2384 y Fe(backward-w)o(or)o(d)9 b Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(184)0 2442 y Fe(beginning-)o(of)o(-li)o(ne)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)17 b Ff(183)0 2500 y Fe(beginning-)o(of)o(-no)o(de) s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(184)0 2612 y Fu(C)0 2678 y Fe(C-a,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(183)1015 362 y Fe(C-a,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(191)1015 420 y Fe(C-b,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(183)1015 478 y Fe(C-b,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(191)1015 536 y Fe(C-d,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)22 b Ff(191)1015 594 y Fe(C-e,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(183)1015 652 y Fe(C-e,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)22 b Ff(191)1015 710 y Fe(C-f,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(183)1015 769 y Fe(C-f,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)22 b Ff(191)1015 827 y Fe(C-g,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(194)1015 885 y Fe(C-g,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)22 b Ff(191)1015 943 y Fe(C-h,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(194)1015 1001 y Fe(C-k,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)22 b Ff(192)1015 1059 y Fe(C-l,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(184)1015 1117 y Fe(C-n,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(183)1015 1175 y Fe(C-p,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)23 b Ff(183)1015 1233 y Fe(C-q,)12 b(in)g(the)f(Info)h (echo)f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(192)1015 1292 y Fe(C-r,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)23 b Ff(187)1015 1350 y Fe(C-s,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(187)1015 1408 y Fe(C-t,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(192)1015 1466 y Fe(C-u,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(194)1015 1524 y Fe(C-v,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)23 b Ff(184)1015 1582 y Fe(C-w,)12 b(in)g(Info)f (windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(185)1015 1640 y Fe(C-x)12 b(^,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(191)1015 1698 y Fe(C-x)12 b(0,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)24 b Ff(190)1015 1757 y Fe(C-x)12 b(1,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(190)1015 1815 y Fe(C-x)12 b(2,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)24 b Ff(190)1015 1873 y Fe(C-x)12 b(b,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(187)1015 1931 y Fe(C-x)12 b(C-b,)f(in)h(Info)g(windows)c Fd(.)t(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) 21 b Ff(186)1015 1989 y Fe(C-x)12 b(C-f,)f(in)h(Info)g(windows)c Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(186)1015 2047 y Fe(C-x)12 b(DEL,)f(in)h(the)g(Info)f(echo)h(area)c Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)20 b Ff(192)1015 2105 y Fe(C-x)12 b(k,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)24 b Ff(186)1015 2163 y Fe(C-x)12 b(o,)g(in)g(Info)f (windows)e Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(190)1015 2221 y Fe(C-x)12 b(t,)g(in)g(Info)f(windows)e Fd(.)d(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)24 b Ff(191)1015 2280 y Fe(C-y,)12 b(in)g(the)f(Info)h(echo) f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(192)1015 2338 y Fe(cancelling)9 b(the)j(current)e(operation)s Fd(.)s(.)c(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)16 b Ff(194)1015 2396 y Fe(cancelling)9 b(typeahead)s Fd(.)s(.)d(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(194)1015 2454 y Fe(commands,)10 b(describin)o(g)s Fd(.)s(.)c(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(193)1015 2512 y Fe(cursor,)11 b(moving)d Fd(.)e(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(183)p eop %%Page: 216 218 216 217 bop 0 -58 a Fv(216)1743 b(Octa)o(v)o(e)0 183 y Fu(D)0 250 y Fe(d,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(185)0 308 y Fe(DEL,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)23 b Ff(184)0 366 y Fe(DEL,)11 b(in)h(the)g(Info)f (echo)g(area)d Fd(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(191)0 424 y Fe(delete-win)o(do)o(w)9 b Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(190)0 482 y Fe(describe-c)o(om)o (man)o(d)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) 18 b Ff(193)0 540 y Fe(describe-k)o(ey)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(193)0 598 y Fe(describe-v)o(ar)o(iab)o(le)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(195)0 656 y Fe(dir-node)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(185)0 918 y Fu(E)0 985 y Fe(echo)11 b(area)e Fd(.)c(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(191)0 1043 y Fe(echo-area-)o(ab)o(ort)5 b Fd(.)t(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)19 b Ff(191)0 1101 y Fe(echo-area-)o(ba)o(ckw)o(ar)o(d)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)24 b Ff(191)0 1159 y Fe(echo-area-)o(ba)o(ckw)o(ar) o(d-k)o(ill)o(-l)o(ine)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(192)0 1217 y Fe(echo-area-)o(ba) o(ckw)o(ar)o(d-k)o(ill)o(-w)o(ord)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(192)0 1275 y Fe(echo-area-)o(ba)o(ckw)o(ar)o(d-w)o(ord)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)18 b Ff(191)0 1333 y Fe(echo-area-)o(be)o(g-o)o(f-)o (lin)o(e)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(191)0 1391 y Fe(echo-area-)o(co)o(mpl)o(et)o(e)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)24 b Ff(192)0 1450 y Fe(echo-area-)o(de)o(let)o(e)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(191)0 1508 y Fe(echo-area-)o(en)o(d-o)o(f-)o(lin)o(e)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(191)0 1566 y Fe(echo-area-)o(fo)o(rwa)o(rd)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)17 b Ff(191)0 1624 y Fe(echo-area-)o(fo)o(rwa)o(rd) o(-wo)o(rd)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(191)0 1682 y Fe(echo-area-)o(in)o(ser)o(t)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(192)0 1740 y Fe(echo-area-)o(ki)o (ll-)o(li)o(ne)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(192)0 1798 y Fe(echo-area-)o(ki)o(ll-)o(wo)o(rd)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(192)0 1856 y Fe(echo-area-)o(ne)o(wli)o(ne)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(192)0 1914 y Fe(echo-area-)o(po)o(ssi)o (bl)o(e-c)o(omp)o(le)o(tio)o(ns)s Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)17 b Ff(193)0 1973 y Fe(echo-area-)o(qu) o(ote)o(d-)o(ins)o(ert)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(192)0 2031 y Fe(echo-area-)o(ru)o(bou)o(t)5 b Fd(.)s(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(191)0 2089 y Fe(echo-area-)o(sc)o(rol)o(l-)o(com)o(ple)o(ti)o(ons)o(-w)o(ind) o(ow)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)19 b Ff(193)0 2147 y Fe(echo-area-)o(ta)o(b-i)o(ns)o(ert)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(192)0 2205 y Fe(echo-area-)o(tr)o(ans)o(po)o(se-)o(cha)o(rs)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)24 b Ff(192)0 2263 y Fe(echo-area-)o(ya)o(nk)7 b Fd(.)s(.)f(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(192)0 2321 y Fe(echo-area-)o(ya)o(nk-)o(po)o(p)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(192)0 2379 y Fe(end-of-lin)o(e)8 b Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)24 b Ff(183)0 2438 y Fe(end-of-nod)o(e)8 b Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)24 b Ff(184)0 2496 y Fe(errors-rin)o(g-)o(bel)o(l)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(196)0 2554 y Fe(ESC)12 b(C-f,)f(in)h(Info)f(windows)e Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(195)0 2612 y Fe(ESC)12 b(C-v,)f(in)h(Info)f(windows)e Fd(.)s(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)21 b Ff(190)0 2670 y Fe(ESC)12 b(C-v,)f(in)h(the)g(Info)f(echo)g(area)d Fd(.)t(.)e(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(193)1015 183 y Fu(F)1015 250 y Fe(f,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(189)1015 308 y Fe(find-menu)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(188)1015 366 y Fe(first-node)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(186)1015 424 y Fe(footnotes,)9 b(displaying)e Fd(.)f(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)23 b Ff(195)1015 482 y Fe(forward-cha)o(r)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)23 b Ff(183)1015 540 y Fe(forward-wor)o(d)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)23 b Ff(184)1015 598 y Fe(functions,)9 b(describing)e Fd(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(193)1015 725 y Fu(G)1015 792 y Fe(g,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(186)1015 850 y Fe(gc-compress)o(ed)o(-fi)o(les)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)22 b Ff(196)1015 908 y Fe(get-help-wi)o(nd)o(ow)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(194)1015 966 y Fe(get-info-he)o(lp)o(-no)o(de)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(194)1015 1024 y Fe(global-next)o(-n)o(ode)t Fd(.)s(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(186)1015 1082 y Fe(global-prev)o(-n)o(ode)t Fd(.)s(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(186)1015 1141 y Fe(goto-node)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(186)1015 1199 y Fe(grow-window)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(191)1015 1326 y Fu(H)1015 1392 y Fe(h,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(194)1015 1450 y Fe(history-nod)o(e)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(185)1015 1577 y Fu(I)1015 1644 y Fe(i,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(187)1015 1702 y Fe(index-searc)o(h)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(187)1015 1760 y Fe(INFO)p 1097 1760 12 2 v 13 w(PRINT)p 1210 1760 V 12 w(COMMAND,)10 b(environme)o(nt)g(variable)s Fd(.)s(.)c(.)h(.)f(.)g(.)16 b Ff(193)1015 1818 y Fe(isearch-bac)o(kw)o (ard)t Fd(.)s(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(187)1015 1876 y Fe(isearch-for)o(wa)o(rd)6 b Fd(.)s(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(187)1015 1934 y Fe(ISO)12 b(Latin)f(characters)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)19 b Ff(197)1015 1992 y Fe(ISO-Latin)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)18 b Ff(197)1015 2120 y Fu(K)1015 2186 y Fe(keep-one-wi)o(nd)o(ow)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(190)1015 2244 y Fe(keys,)11 b(describing)d Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)21 b Ff(193)1015 2302 y Fe(kill-node)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(186)1015 2429 y Fu(L)1015 2496 y Fe(l,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(185)1015 2554 y Fe(last-menu-i)o(te)o(m)8 b Fd(.)s(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(188)1015 2612 y Fe(last-node)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(186)1015 2670 y Fe(list-visite)o(d-)o(nod)o(es)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)24 b Ff(186)p eop %%Page: 217 219 217 218 bop 0 -58 a Fv(Info)15 b(Index)1679 b(217)0 183 y Fu(M)0 250 y Fe(m,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(188)0 308 y Fe(M->,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)23 b Ff(184)0 366 y Fe(M-<,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(184)0 424 y Fe(M-1)12 b Fc(:)6 b(:)g(:)19 b Fe(M-9,)11 b(in)h(Info)f(windows) d Fd(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)24 b Ff(194)0 482 y Fe(M-b,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(184)0 540 y Fe(M-b,)11 b(in)h(the)g(Info)f(echo)g(area)d Fd(.)e(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) 22 b Ff(191)0 598 y Fe(M-d,)11 b(in)h(the)g(Info)f(echo)g(area)d Fd(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)22 b Ff(192)0 656 y Fe(M-DEL,)10 b(in)j(the)e(Info)g (echo)h(area)7 b Fd(.)t(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(192)0 715 y Fe(M-f,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(184)0 773 y Fe(M-f,)11 b(in)h(the)g(Info)f(echo)g(area)d Fd(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)22 b Ff(191)0 831 y Fe(M-r,)11 b(in)h(Info)g (windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(184)0 889 y Fe(M-TAB,)10 b(in)j(Info)e(windows)d Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(189)0 947 y Fe(M-TAB,)10 b(in)j(the)e(Info)g(echo)h(area)7 b Fd(.)t(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(192)0 1005 y Fe(M-v,)11 b(in)h(Info)g(windows)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)23 b Ff(184)0 1063 y Fe(M-y,)11 b(in)h(the)g(Info)f(echo)g(area)d Fd(.)e(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) 22 b Ff(192)0 1121 y Fe(menu-digit)s Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(188)0 1180 y Fe(menu-item)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(188)0 1238 y Fe(move-to-ne)o(xt)o(-xr)o(ef)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(189)0 1296 y Fe(move-to-pr)o(ev)o(-xr)o(ef)s Fd(.)s(.)6 b(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(189)0 1354 y Fe(move-to-wi)o(nd)o(ow-)o (li)o(ne)6 b Fd(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(184)0 1474 y Fu(N)0 1541 y Fe(n,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(185)0 1599 y Fe(next-index)o(-m)o(atc)o(h)5 b Fd(.)s(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(187)0 1657 y Fe(next-line)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(183)0 1715 y Fe(next-node)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(185)0 1773 y Fe(next-windo)o(w)8 b Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)24 b Ff(190)0 1831 y Fe(nodes,)10 b(selection)g(of)i(in)g(Info)f(windows)6 b Fd(.)t(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)19 b Ff(185)0 1889 y Fe(numeric)10 b(arguments)d Fd(.)s(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)20 b Ff(194)0 2010 y Fu(P)0 2076 y Fe(p,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(185)0 2134 y Fe(prev-line)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)18 b Ff(183)0 2193 y Fe(prev-node)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)18 b Ff(185)0 2251 y Fe(prev-windo)o(w)8 b Fd(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)24 b Ff(190)0 2309 y Fe(print-node)s Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)17 b Ff(193)0 2367 y Fe(printing)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(193)0 2425 y Fe(printing)10 b(character)o(s,)f(in)j(the)g(Info)f (echo)g(area)d Fd(.)e(.)g(.)h(.)22 b Ff(192)0 2545 y Fu(Q)0 2612 y Fe(q,)12 b(in)g(Info)f(windows)t Fd(.)t(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)17 b Ff(194)0 2670 y Fe(quit)s Fd(.)5 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(194)1015 183 y Fe(quitting)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(194)1015 303 y Fu(R)1015 369 y Fe(r,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(189)1015 427 y Fe(redraw-disp)o(la)o(y)8 b Fd(.)s(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(184)1015 485 y Fe(RET,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)23 b Ff(189)1015 543 y Fe(RET,)12 b(in)g(the)f(Info)h(echo) f(area)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(192)1015 663 y Fu(S)1015 729 y Fe(s,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(187)1015 787 y Fe(screen,)11 b(changing)e(the)j(height)e(of)f Fd(.)d(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(194)1015 845 y Fe(scroll-back)o(wa)o(rd)6 b Fd(.)s(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)19 b Ff(184)1015 904 y Fe(scroll-beha)o(vi)o(our)t Fd(.)s(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(196)1015 962 y Fe(scroll-forw)o(ar)o(d)8 b Fd(.)s(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(184)1015 1020 y Fe(scroll-othe)o(r-)o(win)o(dow)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)22 b Ff(190)1015 1078 y Fe(scroll-step)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)24 b Ff(196)1015 1136 y Fe(scrolling)10 b(through)g(node)h (structure)s Fd(.)s(.)6 b(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)16 b Ff(184)1015 1194 y Fe(scrolling,)9 b(in)j(Info)g(windows)c Fd(.)e(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)24 b Ff(184)1015 1252 y Fe(search)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(187)1015 1310 y Fe(searching)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(187)1015 1369 y Fe(select-refe)o(re)o(nce)o(-th)o(is)o(-li)o(ne)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)22 b Ff(189)1015 1427 y Fe(select-visi)o(te)o(d-n)o(ode)6 b Fd(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)22 b Ff(187)1015 1485 y Fe(set-screen-)o(he)o(igh)o(t)t Fd(.)s(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)16 b Ff(194)1015 1543 y Fe(set-variabl)o(e)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)23 b Ff(195)1015 1601 y Fe(show-footno)o(te)o(s)8 b Fd(.)s(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(195)1015 1659 y Fe(show-index-)o(ma)o(tch)t Fd(.)s(.)7 b(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(196)1015 1717 y Fe(SPC,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(184)1015 1775 y Fe(SPC,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(192)1015 1833 y Fe(split-windo)o(w)7 b Fd(.)f(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(190)1015 1953 y Fu(T)1015 2019 y Fe(t,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(185)1015 2077 y Fe(TAB,)12 b(in)g(Info)f(windows)d Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(189)1015 2135 y Fe(TAB,)12 b(in)g(the)f(Info)h(echo)f(area)d Fd(.)e(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(192)1015 2194 y Fe(tile-window)o(s)7 b Fd(.)f(.)g(.)g(.)g(.)g (.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(191)1015 2252 y Fe(tiling)7 b Fd(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(191)1015 2310 y Fe(toggle-wrap)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(185)1015 2368 y Fe(top-node)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)19 b Ff(185)1015 2487 y Fu(U)1015 2554 y Fe(u,)13 b(in)f(Info)f(windows)t Fd(.)s(.)6 b(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(185)1015 2612 y Fe(universal-a)o(rg)o(ume)o(nt)8 b Fd(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(194)1015 2670 y Fe(up-node)8 b Fd(.)t(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(185)p eop %%Page: 218 220 218 219 bop 0 -58 a Fv(218)1743 b(Octa)o(v)o(e)0 183 y Fu(V)0 250 y Fe(variables,)9 b(describin)o(g)f Fd(.)e(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)24 b Ff(195)0 308 y Fe(variables,)9 b(setting)d Fd(.)s(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(195)0 366 y Fe(view-file)5 b Fd(.)s(.)h(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)18 b Ff(186)0 424 y Fe(visible-be)o(ll)7 b Fd(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(196)0 532 y Fu(W)0 598 y Fe(where-is)7 b Fd(.)s(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(194)1015 183 y Fe(windows,)10 b(creating)d Fd(.)s(.)f(.)h(.)f(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(190)1015 241 y Fe(windows,)10 b(deleting)d Fd(.)s(.)f(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)20 b Ff(190)1015 299 y Fe(windows,)10 b(manipulati)o(ng)d Fd(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)23 b Ff(189)1015 358 y Fe(windows,)10 b(selecting)c Fd(.)s(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)18 b Ff(190)1015 532 y Fu(X)1015 598 y Fe(xref-item)5 b Fd(.)t(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(189)p eop %%Page: -1 221 -1 220 bop 1937 -58 a Fv(i)0 183 y Fs(T)-7 b(able)15 b(of)g(Con)n(ten)n(ts)0 351 y Fu(Preface)10 b Fb(.)e(.)i(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)32 b Fu(1)0 491 y(GNU)22 b(GENERAL)g(PUBLIC)g(LICENSE)9 b Fb(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f (.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)31 b Fu(3)149 569 y Fv(Pream)o(ble)7 b Fa(.)i(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)22 b Fv(3)149 631 y(TERMS)16 b(AND)f(CONDITIONS)h(F)o(OR)g(COPYING,)f(DISTRIBUTION)i(AND)240 693 y(MODIFICA)l(TION)6 b Fa(.)j(.)f(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)21 b Fv(4)149 755 y(App)q(endix:)h(Ho)o(w)15 b(to)g(Apply)h(These)f (T)l(erms)g(to)g(Y)l(our)g(New)h(Programs)11 b Fa(.)d(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)28 b Fv(8)0 880 y Fu(1)67 b(A)22 b(Brief)h(In)n(tro)r (duction)h(to)e(Octa)n(v)n(e)11 b Fb(.)f(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)34 b Fu(11)149 958 y Fv(1.1)45 b(Running)17 b(Octa)o(v)o(e)5 b Fa(.)i(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)g(.)f(.)h(.)f(.)h(.)20 b Fv(11)149 1020 y(1.2)45 b(Simple)17 b(Examples)7 b Fa(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)22 b Fv(11)299 1082 y(Creating)15 b(a)g(Matrix)6 b Fa(.)h(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fv(11)299 1144 y(Matrix)15 b(Arithmetic)f Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(12)299 1207 y(Solving)16 b(Linear)g(Equations)11 b Fa(.)d(.)g(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fv(12)299 1269 y(In)o(tegrating)15 b(Di\013eren)o(tial)h(Equations)c Fa(.)c(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)28 b Fv(12)299 1331 y(Pro)q(ducing)16 b(Graphical)g(Output)6 b Fa(.)j(.)e(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)22 b Fv(13)299 1394 y(Editing)16 b(What)f(Y)l(ou)g(Ha)o(v)o(e)g(T)o(yp)q(ed)g Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)29 b Fv(14)299 1456 y(Getting)15 b(Help)g Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)29 b Fv(14)448 1518 y(Help)17 b(via)e(Info)g Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)29 b Fv(14)149 1580 y(1.3)45 b(Executable)16 b(Octa)o(v)o(e)f(Programs)7 b Fa(.)f(.)h(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)22 b Fv(15)149 1643 y(1.4)45 b(Commen)o(ts)14 b(in)i(Octa)o(v)o(e)f(Programs)6 b Fa(.)g(.)i(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fv(15)149 1705 y(1.5)45 b(Errors)7 b Fa(.)g(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)22 b Fv(16)0 1829 y Fu(2)67 b(In)n(v)n(oking)24 b(Octa)n(v)n(e)8 b Fb(.)i(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) 31 b Fu(19)149 1907 y Fv(2.1)45 b(Command)15 b(Line)h(Options)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)29 b Fv(19)149 1969 y(2.2)45 b(Startup)15 b(Files)t Fa(.)9 b(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)20 b Fv(20)0 2094 y Fu(3)67 b(Expressions)19 b Fb(.)10 b(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.) g(.)g(.)g(.)41 b Fu(21)149 2172 y Fv(3.1)k(Constan)o(t)14 b(Expressions)6 b Fa(.)i(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fv(21)299 2234 y(3.1.1)44 b(Numeric)16 b(Constan)o(ts)11 b Fa(.)d(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)27 b Fv(21)299 2296 y(3.1.2)44 b(String)15 b(Constan)o(ts)e Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)29 b Fv(22)149 2359 y(3.2)45 b(Matrices)6 b Fa(.)h(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)21 b Fv(23)299 2421 y(3.2.1)44 b(Empt)o(y)14 b(Matrices)d Fa(.)d(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) g(.)f(.)h(.)f(.)h(.)f(.)26 b Fv(24)149 2483 y(3.3)45 b(Ranges)9 b Fa(.)f(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)25 b Fv(25)149 2545 y(3.4)45 b(V)l(ariables)11 b Fa(.)e(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)26 b Fv(25)149 2608 y(3.5)45 b(Index)16 b(Expressions)9 b Fa(.)f(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)24 b Fv(26)149 2670 y(3.6)45 b(Data)14 b(Structures)8 b Fa(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)23 b Fv(27)p eop %%Page: -2 222 -2 221 bop 0 -58 a Fv(ii)1788 b(Octa)o(v)o(e)149 42 y(3.7)45 b(Calling)17 b(F)l(unctions)d Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)29 b Fv(29)299 104 y(3.7.1)44 b(Call)16 b(b)o(y)f(V)l(alue)g Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)30 b Fv(30)299 166 y(3.7.2)44 b(Recursion)9 b Fa(.)f(.)g(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)24 b Fv(31)149 228 y(3.8)45 b(Global)16 b(V)l(ariables)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)28 b Fv(31)149 291 y(3.9)45 b(Keyw)o(ords)5 b Fa(.)i(.)g(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)20 b Fv(32)149 353 y(3.10)45 b(Arithmetic)16 b(Op)q(erators)5 b Fa(.)i(.)g(.)h(.)g(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)20 b Fv(33)149 415 y(3.11)45 b(Comparison)15 b(Op)q(erators)5 b Fa(.)i(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)20 b Fv(34)149 477 y(3.12)45 b(Bo)q(olean)16 b(Expressions)5 b Fa(.)j(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)20 b Fv(35)299 540 y(3.12.1)43 b(Elemen)o(t-b)o(y-elemen)o(t)17 b(Bo)q(olean)f(Op)q (erators)5 b Fa(.)i(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)20 b Fv(35)299 602 y(3.12.2)43 b(Short-circuit)17 b(Bo)q(olean)f(Op)q(erators)c Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)27 b Fv(36)149 664 y(3.13)45 b(Assignmen)o(t)15 b(Expressions)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)28 b Fv(37)149 726 y(3.14)45 b(Incremen)o(t)15 b(Op)q(erators)e Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)28 b Fv(39)149 789 y(3.15)45 b(Op)q(erator)15 b(Precedence)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)27 b Fv(39)0 913 y Fu(4)67 b(Statemen)n(ts)13 b Fb(.)8 b(.)h(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)35 b Fu(41)149 991 y Fv(4.1)45 b(The)15 b Fr(if)g Fv(Statemen)o(t)8 b Fa(.)f(.)h(.)f(.)h(.)f(.)h(.)g (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g (.)f(.)h(.)23 b Fv(41)149 1053 y(4.2)45 b(The)15 b Fr(while)g Fv(Statemen)o(t)5 b Fa(.)h(.)i(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)20 b Fv(43)149 1116 y(4.3)45 b(The)15 b Fr(for)g Fv(Statemen)o(t)7 b Fa(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)22 b Fv(44)149 1178 y(4.4)45 b(The)15 b Fr(break)g Fv(Statemen)o(t)5 b Fa(.)h(.)i(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)20 b Fv(44)149 1240 y(4.5)45 b(The)15 b Fr(continue)f Fv(Statemen)o(t)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)27 b Fv(45)149 1302 y(4.6)45 b(The)15 b Fr(unwind)p 493 1302 15 2 v 17 w(protect)f Fv(Statemen)o(t)8 b Fa(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)23 b Fv(46)0 1427 y Fu(5)67 b(F)-6 b(unctions)24 b(and)f(Script)h(Files)14 b Fb(.)d(.)f(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)f(.)37 b Fu(49)149 1505 y Fv(5.1)45 b(De\014ning)16 b(F)l(unctions)d Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)27 b Fv(49)149 1567 y(5.2)45 b(Multiple)17 b(Return)f(V)l(alues)8 b Fa(.)h(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)24 b Fv(51)149 1629 y(5.3)45 b(V)l (ariable-length)17 b(Argumen)o(t)e(Lists)g Fa(.)7 b(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(53)149 1692 y(5.4)45 b(V)l(ariable-length)17 b(Return)f(Lists)d Fa(.)7 b(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)27 b Fv(54)149 1754 y(5.5)45 b(Returning)16 b(F)l(rom)f(a)g(F)l(unction)c Fa(.)d(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)26 b Fv(54)149 1816 y(5.6)45 b(F)l(unction)16 b(Files)f Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)29 b Fv(55)149 1878 y(5.7)45 b(Script)16 b(Files)10 b Fa(.)f(.)e(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)25 b Fv(56)149 1941 y(5.8)45 b(Dynamically)16 b(Link)o(ed)h(F)l(unctions)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(57)149 2003 y(5.9)45 b(Organization)16 b(of)f(F)l(unctions)h (Distributed)g(with)f(Octa)o(v)o(e)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(58)0 2127 y Fu(6)67 b(Built-in)25 b(V)-6 b(ariables)15 b Fb(.)c(.)f(.)g(.)g(.)g(.)f(.)h(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.) h(.)g(.)g(.)g(.)g(.)g(.)g(.)37 b Fu(61)149 2205 y Fv(6.1)45 b(Prede\014ned)16 b(Constan)o(ts)8 b Fa(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)23 b Fv(61)149 2268 y(6.2)45 b(User)15 b(Preferences)e Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)28 b Fv(62)149 2330 y(6.3)45 b(Other)15 b(Built-in)j(V)l(ariables)12 b Fa(.)c(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)27 b Fv(69)149 2392 y(6.4)45 b(Summary)15 b(of)g(Preference)h(V)l(ariables)8 b Fa(.)g(.)g(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)g(.)f(.)23 b Fv(70)p eop %%Page: -3 223 -3 222 bop 1912 -58 a Fv(iii)0 42 y Fu(7)67 b(Arithmetic)16 b Fb(.)10 b(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)38 b Fu(71)149 119 y Fv(7.1)45 b(Utilit)o(y)16 b(F)l(unctions)8 b Fa(.)h(.)e(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)g(.)23 b Fv(71)149 182 y(7.2)45 b(Complex)16 b(Arithmetic)6 b Fa(.)i(.)g(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)21 b Fv(72)149 244 y(7.3)45 b(T)l(rigonometry)10 b Fa(.)d(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)25 b Fv(72)149 306 y(7.4)45 b(Sums)15 b(and)h(Pro)q(ducts)t Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)20 b Fv(73)149 368 y(7.5)45 b(Sp)q(ecial)17 b(F)l(unctions)e Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(74)0 493 y Fu(8)67 b(Linear)24 b(Algebra)12 b Fb(.)e(.)g(.)g(.)g(.)f(.)h(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.) h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)35 b Fu(75)149 571 y Fv(8.1)45 b(Basic)16 b(Matrix)e(F)l(unctions)9 b Fa(.)g(.)f(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)f(.)h(.)f(.)h(.)24 b Fv(75)149 633 y(8.2)45 b(Matrix)15 b(F)l(actorizations)5 b Fa(.)i(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)20 b Fv(77)149 695 y(8.3)45 b(F)l(unctions)16 b(of)f(a)g(Matrix)e Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(80)0 820 y Fu(9)67 b(P)n(olynomial)22 b(Manipulations)14 b Fb(.)e(.)e(.)g(.)g(.)f(.)h(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)36 b Fu(83)0 960 y(10)66 b(Nonlinear)24 b(Equations)12 b Fb(.)f(.)f(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)34 b Fu(87)0 1100 y(11)66 b(Di\013eren)n(tial)25 b(Equations)5 b Fb(.)11 b(.)f(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)28 b Fu(89)149 1178 y Fv(11.1)45 b(Ordinary)16 b(Di\013eren)o(tial)g(Equations)11 b Fa(.)d(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)27 b Fv(89)149 1240 y(11.2)45 b(Di\013eren)o(tial-Algebraic)17 b(Equations)8 b Fa(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) 23 b Fv(90)0 1365 y Fu(12)66 b(Optimization)9 b Fb(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)32 b Fu(91)149 1443 y Fv(12.1)45 b(Quadratic)15 b(Programming)9 b Fa(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)24 b Fv(91)149 1505 y(12.2)45 b(Nonlinear)16 b(Programming)c Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)27 b Fv(91)149 1567 y(12.3)45 b(Linear)16 b(Least)f(Squares)c Fa(.)d(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fv(91)0 1692 y Fu(13)66 b(Quadrature)19 b Fb(.)10 b(.)g(.)g(.)g(.)g (.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)41 b Fu(93)149 1769 y Fv(13.1)k(F)l(unctions)16 b(of)e(one)i(V)l(ariable)9 b Fa(.)g(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)24 b Fv(93)149 1832 y(13.2)45 b(Orthogonal)15 b(Collo)q(cation)8 b Fa(.)h(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)23 b Fv(93)0 1956 y Fu(14)66 b(Con)n(trol)24 b(Theory)15 b Fb(.)10 b(.)g(.)g(.)f(.)h(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.) h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)38 b Fu(95)0 2096 y(15)66 b(Signal)24 b(Pro)r(cessing)12 b Fb(.)e(.)g(.)f(.)h(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)34 b Fu(101)0 2236 y(16)66 b(Sets)13 b Fb(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)35 b Fu(103)0 2377 y(17)66 b(Statistics)9 b Fb(.)i(.)f(.)g(.)g(.)g(.)f(.)h (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)31 b Fu(105)p eop %%Page: -4 224 -4 223 bop 0 -58 a Fv(iv)1776 b(Octa)o(v)o(e)0 42 y Fu(18)66 b(Plotting)9 b Fb(.)j(.)e(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f (.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)31 b Fu(107)149 119 y Fv(18.1)45 b(Tw)o(o-Dimensional)16 b(Plotting)11 b Fa(.)c(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)26 b Fv(107)149 182 y(18.2)45 b(Three-Dimensional)17 b(Plotting)7 b Fa(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)22 b Fv(111)149 244 y(18.3)45 b(Miscellaneous)17 b(Plotting)e(F)l(unctions)9 b Fa(.)f(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)24 b Fv(112)0 368 y Fu(19)66 b(Image)20 b(Pro)r(cessing)12 b Fb(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)35 b Fu(115)0 509 y(20)66 b(Input)24 b(and)f(Output)18 b Fb(.)10 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)40 b Fu(117)149 586 y Fv(20.1)45 b(Basic)16 b(Input)g(and)f(Output)c Fa(.)d(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) g(.)f(.)26 b Fv(117)149 649 y(20.2)45 b(C-St)o(yle)15 b(I/O)h(F)l(unctions)8 b Fa(.)g(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)23 b Fv(121)299 711 y(20.2.1)43 b(Op)q(ening)18 b(and)d(Closing)h(Files)f Fa(.)8 b(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(121)299 773 y(20.2.2)43 b(F)l(ormatted)14 b(Output)7 b Fa(.)h(.)g(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)21 b Fv(122)299 835 y(20.2.3)43 b(Output)16 b(Con)o(v)o(ersion)f(Syn)o(tax)c Fa(.)c(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)26 b Fv(123)299 898 y(20.2.4)43 b(T)l(able)16 b(of)f(Output)h(Con)o(v)o(ersions)11 b Fa(.)c(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fv(124)299 960 y(20.2.5)43 b(In)o(teger)16 b(Con)o(v)o(ersions)7 b Fa(.)g(.)g(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)21 b Fv(125)299 1022 y(20.2.6)43 b(Floating-P)o(oin)o(t)16 b(Con)o(v)o(ersions)8 b Fa(.)e(.)i(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)22 b Fv(125)299 1084 y(20.2.7)43 b(Other)16 b(Output)g(Con)o(v)o(ersions)c Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)27 b Fv(126)299 1147 y(20.2.8)43 b(F)l(ormatted)14 b(Input)h Fa(.)8 b(.)g(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(127)299 1209 y(20.2.9)43 b(Input)16 b(Con)o(v)o(ersion)f(Syn)o(tax)8 b Fa(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)22 b Fv(127)299 1271 y(20.2.10)43 b(T)l(able)16 b(of)f(Input)h(Con)o(v)o(ersions)8 b Fa(.)f(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)22 b Fv(128)299 1334 y(20.2.11)43 b(Numeric)16 b(Input)g(Con)o(v)o(ersions)t Fa(.)8 b(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)19 b Fv(129)299 1396 y(20.2.12)43 b(String)16 b(Input)g(Con)o(v)o(ersions)6 b Fa(.)h(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fv(129)299 1458 y(20.2.13)43 b(Binary)16 b(I/O)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(130)299 1520 y(20.2.14)43 b(Other)16 b(I/O)f(F)l(unctions)5 b Fa(.)k(.)e(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)20 b Fv(131)0 1645 y Fu(21)66 b(Sp)r(ecial)24 b(Matrices)12 b Fb(.)e(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)34 b Fu(133)149 1723 y Fv(21.1)45 b(Sp)q(ecial)17 b(Utilit)o(y)f(Matrices) 5 b Fa(.)j(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)20 b Fv(133)149 1785 y(21.2)45 b(F)l(amous)14 b(Matrices)7 b Fa(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)22 b Fv(135)0 1910 y Fu(22)66 b(Matrix)24 b(Manipulation)14 b Fb(.)e(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)36 b Fu(137)149 1987 y Fv(22.1)45 b(Finding)16 b(Elemen)o(ts)g(and)f(Chec)o(king)h (Conditions)d Fa(.)8 b(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)27 b Fv(137)149 2050 y(22.2)45 b(Rearranging)15 b(Matrices)5 b Fa(.)i(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)19 b Fv(138)0 2174 y Fu(23)66 b(String)25 b(F)-6 b(unctions)11 b Fb(.)h(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)34 b Fu(143)0 2314 y(24)66 b(System)21 b(Utilities)6 b Fb(.)12 b(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)28 b Fu(145)149 2392 y Fv(24.1)45 b(Timing)16 b(Utilities)7 b Fa(.)i(.)f(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)22 b Fv(145)149 2454 y(24.2)45 b(In)o(teracting)15 b(with)h(the)f(OS)g Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)29 b Fv(146)149 2517 y(24.3)45 b(System)15 b(Information)d Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)27 b Fv(147)149 2579 y(24.4)45 b(Other)15 b(F)l(unctions)g Fa(.)7 b(.)h(.)g(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)29 b Fv(147)p eop %%Page: -5 225 -5 224 bop 1926 -58 a Fv(v)0 42 y Fu(25)66 b(Comm)o(a)o(nd)21 b(History)i(F)-6 b(unctions)11 b Fb(.)g(.)f(.)g(.)g(.)f(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)33 b Fu(149)0 182 y(26)66 b(Help)19 b Fb(.)9 b(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)40 b Fu(151)0 322 y(27)66 b(Programm)o(ing)20 b(Utilities)8 b Fb(.)k(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)30 b Fu(153)149 400 y Fv(27.1)45 b(Ev)m(aluating)16 b(Strings)f(as)g(Commands)7 b Fa(.)g(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)21 b Fv(153)149 462 y(27.2)45 b(Miscellaneous)17 b(Utilities)7 b Fa(.)j(.)d(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)22 b Fv(154)0 586 y Fu(28)66 b(Am)n(usem)o(en)n(ts) 12 b Fb(.)7 b(.)i(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)g(.)34 b Fu(159)0 726 y(App)r(endix)24 b(A)67 b(Installing)25 b(Octa)n(v)n(e)12 b Fb(.)d(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)34 b Fu(161)149 804 y Fv(A.1)45 b(Installation)17 b(Problems)11 b Fa(.)d(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)26 b Fv(163)149 867 y(A.2)45 b(Binary)16 b(Distributions)9 b Fa(.)g(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)24 b Fv(165)299 929 y(A.2.1)44 b(Installing)17 b(Octa)o(v)o(e)e(from)f(a)h(Binary)h (Distribution)10 b Fa(.)e(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)25 b Fv(165)299 991 y(A.2.2)44 b(Creating)15 b(a)g(Binary)h(Distribution)7 b Fa(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)22 b Fv(166)0 1116 y Fu(App)r(endix)i(B)67 b(Kno)n(wn)23 b(Causes)d(of)i(T)-6 b(rouble)24 b(with)f(Octa)n(v)n(e) 152 1178 y Fb(.)10 b(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.) 40 b Fu(167)149 1256 y Fv(B.1)45 b(Actual)16 b(Bugs)f(W)l(e)h(Ha)o(v)o (en't)e(Fixed)i(Y)l(et)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(167)149 1318 y(B.2)45 b(Rep)q(orting)17 b(Bugs)5 b Fa(.)i(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)20 b Fv(168)149 1380 y(B.3)45 b(Ha)o(v)o(e)15 b(Y)l(ou)h(F)l(ound)f(a)g(Bug?)t Fa(.)8 b(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)19 b Fv(168)149 1443 y(B.4)45 b(Where)16 b(to)e(Rep)q(ort)i(Bugs)10 b Fa(.)e(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)25 b Fv(169)149 1505 y(B.5)45 b(Ho)o(w)15 b(to)g(Rep)q(ort)g(Bugs)10 b Fa(.)d(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)25 b Fv(169)149 1567 y(B.6)45 b(Sending)17 b(P)o(atc)o(hes)e(for)f(Octa)o(v)o(e)6 b Fa(.)i(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) 21 b Fv(171)149 1629 y(B.7)45 b(Ho)o(w)15 b(T)l(o)g(Get)g(Help)h(with)f (Octa)o(v)o(e)8 b Fa(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h (.)f(.)23 b Fv(172)0 1754 y Fu(App)r(endix)h(C)67 b(Comm)n(and)20 b(Line)k(Editing)17 b Fb(.)10 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h (.)g(.)g(.)38 b Fu(173)149 1832 y Fv(C.1)45 b(In)o(tro)q(duction)16 b(to)f(Line)h(Editing)6 b Fa(.)j(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)21 b Fv(173)149 1894 y(C.2)45 b(Readline)18 b(In)o(teraction)12 b Fa(.)c(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)27 b Fv(173)149 1956 y(C.3)45 b(Readline)18 b(Bare)d(Essen)o(tials)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)28 b Fv(173)149 2018 y(C.4)45 b(Readline)18 b(Mo)o(v)o(emen)o(t)c(Commands)7 b Fa(.)f(.)i(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)22 b Fv(174)149 2081 y(C.5)45 b(Readline)18 b(Killing)g(Commands)11 b Fa(.)6 b(.)i(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)25 b Fv(174)149 2143 y(C.6)45 b(Readline)18 b(Argumen)o(ts)11 b Fa(.)d(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)27 b Fv(175)149 2205 y(C.7)45 b(Readline)18 b(Init)e(File)8 b Fa(.)g(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)22 b Fv(175)149 2268 y(C.8)45 b(Readline)18 b(Init)e(Syn)o(tax)9 b Fa(.)d(.)i(.)f(.)h (.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)23 b Fv(175)299 2330 y(C.8.1)44 b(Commands)14 b(F)l(or)h(Mo)o(ving)7 b Fa(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)22 b Fv(177)299 2392 y(C.8.2)44 b(Commands)14 b(F)l(or)h (Manipulating)i(The)e(History)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)29 b Fv(177)299 2454 y(C.8.3)44 b(Commands)14 b(F)l(or)h(Changing)h(T)l(ext)9 b Fa(.)e(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)24 b Fv(178)299 2517 y(C.8.4)44 b(Killing)18 b(And)e(Y)l(anking)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)28 b Fv(179)299 2579 y(C.8.5)44 b(Sp)q(ecifying)17 b(Numeric)g(Argumen)o (ts)6 b Fa(.)h(.)g(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fv(179)299 2641 y(C.8.6)44 b(Letting)16 b(Readline)h(T)o(yp)q(e)f(F)l(or)e(Y)l(ou)h Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)29 b Fv(180)p eop %%Page: -6 226 -6 225 bop 0 -58 a Fv(vi)1776 b(Octa)o(v)o(e)299 42 y(C.8.7)44 b(Some)15 b(Miscellaneous)i(Commands)11 b Fa(.)d(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fv(180)149 104 y(C.9)45 b(Readline)18 b(Vi)d(Mo)q(de)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)28 b Fv(180)0 228 y Fu(App)r(endix)c(D)67 b(Using)22 b(Info)10 b Fb(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)32 b Fu(183)149 306 y Fv(D.1)45 b(Mo)o(ving)15 b(the)g(Cursor)5 b Fa(.)i(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)19 b Fv(183)149 368 y(D.2)45 b(Mo)o(ving)15 b(T)l(ext)g(Within)h(a)f (Windo)o(w)8 b Fa(.)g(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) 23 b Fv(184)149 431 y(D.3)45 b(Selecting)17 b(a)e(New)g(No)q(de)7 b Fa(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)22 b Fv(185)149 493 y(D.4)45 b(Searc)o(hing)16 b(an)f(Info)g(File)6 b Fa(.)j(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)21 b Fv(187)149 555 y(D.5)45 b(Selecting)17 b(Cross)d(References)5 b Fa(.)k(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)20 b Fv(187)299 617 y(D.5.1)44 b(P)o(arts)14 b(of)g(an)i(Xref)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)29 b Fv(187)299 680 y(D.5.2)44 b(Selecting)17 b(Xrefs)6 b Fa(.)h(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)21 b Fv(188)149 742 y(D.6)45 b(Manipulating)17 b(Multiple)g(Windo)o(ws)9 b Fa(.)e(.)g(.)h(.)g(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)24 b Fv(189)299 804 y(D.6.1)44 b(The)15 b(Mo)q(de)g(Line)c Fa(.)f(.)d(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fv(189)299 867 y(D.6.2)44 b(Windo)o(w)15 b(Commands)7 b Fa(.)g(.)g(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)21 b Fv(190)299 929 y(D.6.3)44 b(The)15 b(Ec)o(ho)g(Area)f Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)29 b Fv(191)149 991 y(D.7)45 b(Prin)o(ting)16 b(Out)f(No)q(des)6 b Fa(.)i(.)g(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)21 b Fv(193)149 1053 y(D.8)45 b(Miscellaneous)17 b(Info)f(Commands)9 b Fa(.)e(.)g(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f (.)h(.)f(.)24 b Fv(193)149 1116 y(D.9)45 b(Manipulating)17 b(V)l(ariables)e Fa(.)7 b(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)29 b Fv(195)0 1240 y Fu(Concept)22 b(Index)8 b Fb(.)j(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f (.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)31 b Fu(199)0 1380 y(V)-6 b(ariable)24 b(Index)9 b Fb(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)f (.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)31 b Fu(203)0 1520 y(F)-6 b(unction)25 b(Index)16 b Fb(.)10 b(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.) h(.)g(.)38 b Fu(205)0 1660 y(Op)r(erator)22 b(Index)10 b Fb(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)32 b Fu(211)0 1801 y(Readline)24 b(Index)17 b Fb(.)10 b(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.) g(.)g(.)g(.)g(.)38 b Fu(213)0 1941 y(Info)22 b(Index)17 b Fb(.)10 b(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f (.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)38 b Fu(215)p eop %%Trailer end userdict /end-hook known{end-hook}if %%EOF octave-1.1.0/doc/octave.info100666 415 17 14532 5705317773 14105 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  Indirect: octave.info-1: 707 octave.info-2: 50385 octave.info-3: 99437 octave.info-4: 133929 octave.info-5: 182606 octave.info-6: 225541 octave.info-7: 274531 octave.info-8: 323921 octave.info-9: 372266 octave.info-10: 406273  Tag Table: (Indirect) Node: Top707 Node: Preface8285 Node: Copying13894 Node: Introduction33064 Node: Running Octave33752 Node: Simple Examples34598 Node: Executable Octave Programs41636 Node: Comments43445 Node: Errors45268 Node: Invoking Octave48036 Node: Command Line Options48867 Node: Startup Files50385 Node: Expressions51848 Node: Constant Expressions52829 Node: Numeric Constants53193 Node: String Constants54595 Node: Matrices57154 Node: Empty Matrices59331 Node: Ranges60637 Node: Variables62223 Node: Index Expressions63792 Node: Data Structures66394 Node: Calling Functions69531 Node: Call by Value72038 Node: Recursion73567 Node: Global Variables74956 Node: Keywords76397 Node: Arithmetic Ops77135 Node: Comparison Ops80417 Node: Boolean Expressions81715 Node: Element-by-element Boolean Operators81956 Node: Short-circuit Boolean Operators84644 Node: Assignment Ops86804 Node: Increment Ops90764 Node: Operator Precedence92656 Node: Statements94691 Node: The if Statement95991 Node: The while Statement99437 Node: The for Statement101591 Node: The break Statement103541 Node: The continue Statement105047 Node: The unwind_protect Statement106348 Node: Functions and Scripts107753 Node: Defining Functions108407 Node: Multiple Return Values113445 Node: Variable-length Argument Lists115774 Node: Variable-length Return Lists117846 Node: Returning From a Function118898 Node: Function Files120190 Node: Script Files123030 Node: Dynamically Linked Functions126629 Node: Organization of Functions128998 Node: Built-in Variables130767 Node: Predefined Constants131887 Node: User Preferences133929 Node: Other Built-in Variables151064 Node: Summary of Preference Variables151795 Node: Arithmetic153599 Node: Utility Functions153972 Node: Complex Arithmetic156666 Node: Trigonometry157228 Node: Sums and Products157906 Node: Special Functions159264 Node: Linear Algebra161085 Node: Basic Matrix Functions161554 Node: Matrix Factorizations166206 Node: Functions of a Matrix171482 Node: Polynomial Manipulations173746 Node: Nonlinear Equations178763 Node: Differential Equations180126 Node: Ordinary Differential Equations180500 Node: Differential-Algebraic Equations182606 Node: Optimization184247 Node: Quadratic Programming184463 Node: Nonlinear Programming185041 Node: Linear Least Squares185856 Node: Quadrature187235 Node: Functions of one Variable187419 Node: Orthogonal Collocation188382 Node: Control Theory188908 Node: Signal Processing196384 Node: Sets199799 Node: Statistics200611 Node: Plotting202707 Node: Two-Dimensional Plotting203397 Node: Three-Dimensional Plotting213088 Node: Miscellaneous Plotting Functions215663 Node: Image Processing219571 Node: Input and Output223863 Node: Basic Input and Output225541 Node: C-Style I/O Functions233757 Node: Opening and Closing Files235382 Node: Formatted Output236694 Node: Output Conversion Syntax239803 Node: Table of Output Conversions242740 Node: Integer Conversions244901 Node: Floating-Point Conversions246946 Node: Other Output Conversions249771 Node: Formatted Input250828 Node: Input Conversion Syntax252867 Node: Table of Input Conversions255312 Node: Numeric Input Conversions257138 Node: String Input Conversions258165 Node: Binary I/O259183 Node: Other I/O Functions261317 Node: Special Matrices264206 Node: Special Utility Matrices264626 Node: Famous Matrices268977 Node: Matrix Manipulation271214 Node: Finding Elements and Checking Conditions271846 Node: Rearranging Matrices274531 Node: String Functions279619 Node: System Utilities281358 Node: Timing Utilities281953 Node: Interacting with the OS284186 Node: System Information286866 Node: Other Functions287518 Node: Command History Functions288033 Node: Help291091 Node: Programming Utilities291979 Node: Evaluating Strings as Commands292190 Node: Miscellaneous Utilities295106 Node: Amusements303990 Node: Installation304469 Node: Installation Problems309794 Node: Binary Distributions315858 Node: Installing Octave from a Binary Distribution316184 Node: Creating a Binary Distribution318049 Node: Trouble318789 Node: Actual Bugs319521 Node: Reporting Bugs322561 Node: Bug Criteria323921 Node: Bug Lists325141 Node: Bug Reporting326125 Node: Sending Patches331498 Node: Service334317 Node: Command Line Editing334928 Node: Introduction and Notation335719 Node: Readline Interaction336768 Node: Readline Bare Essentials337925 Node: Readline Movement Commands339459 Node: Readline Killing Commands340348 Node: Readline Arguments341989 Node: Readline Init File342965 Node: Readline Init Syntax343833 Node: Commands For Moving347845 Node: Commands For History348497 Node: Commands For Text349569 Node: Commands For Killing351234 Node: Numeric Arguments352359 Node: Commands For Completion352800 Node: Miscellaneous Commands353524 Node: Readline Vi Mode354360 Node: Using Info355072 Node: Cursor Commands356374 Node: Scrolling Commands359039 Node: Node Commands361520 Node: Searching Commands365530 Node: Xref Commands367141 Node: Parts of an Xref367763 Node: Selecting Xrefs369730 Node: Window Commands371321 Node: The Mode Line372266 Node: Basic Windows373938 Node: The Echo Area376470 Node: Printing Nodes380656 Node: Other Info Commands381303 Node: Info Variables384543 Node: Concept Index390707 Node: Variable Index402969 Node: Function Index406273 Node: Operator Index426399 Node: Readline Index428874 Node: Info Index431900  End Tag Table octave-1.1.0/doc/octave.info-1100666 415 17 142321 5705317772 14260 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Top, Next: Preface, Prev: (dir), Up: (dir) This manual documents how to run, install and port Octave, as well as its new features and incompatibilities, and how to report bugs. It corresponds to Octave version 1.1.0. * Menu: * Preface:: * Copying:: * Introduction:: A brief introduction to Octave. * Invoking Octave:: Command options supported by Octave. * Expressions:: Expressions. * Statements:: Looping and program flow control. * Functions and Scripts:: * Built-in Variables:: Descriptions of all built-in variables. * Arithmetic:: * Linear Algebra:: * Polynomial Manipulations:: * Nonlinear Equations:: * Differential Equations:: * Optimization:: * Quadrature:: * Control Theory:: * Signal Processing:: * Sets:: * Statistics:: * Plotting:: * Image Processing:: * Input and Output:: * Special Matrices:: * Matrix Manipulation:: * String Functions:: * System Utilities:: * Command History Functions:: * Help:: * Programming Utilities:: * Amusements:: * Installation:: How to configure, compile and install Octave. * Trouble:: If you have trouble installing Octave. * Command Line Editing:: Command history and editing. * Using Info:: * Concept Index:: An item for each concept. * Variable Index:: An item for each documented variable. * Function Index:: An item for each documented function. * Operator Index:: An item for each documented operator. * Readline Index:: An index for readline commands. * Info Index:: An index for info commands. -- The Detailed Node Listing -- A Brief Introduction to Octave * Running Octave:: * Simple Examples:: * Executable Octave Programs:: * Comments:: * Errors:: Invoking Octave * Command Line Options:: * Startup Files:: Expressions * Constant Expressions:: * Matrices:: * Ranges:: * Variables:: * Index Expressions:: * Data Structures:: * Calling Functions:: * Global Variables:: * Keywords:: * Arithmetic Ops:: * Comparison Ops:: * Boolean Expressions:: * Assignment Ops:: * Increment Ops:: * Operator Precedence:: Constant Expressions * Numeric Constants:: * String Constants:: Matrices * Empty Matrices:: Calling Functions * Call by Value:: * Recursion:: Boolean Expressions * Element-by-element Boolean Operators:: * Short-circuit Boolean Operators:: Statements * The if Statement:: * The while Statement:: * The for Statement:: * The break Statement:: * The continue Statement:: * The unwind_protect Statement:: Functions and Script Files * Defining Functions:: * Multiple Return Values:: * Variable-length Argument Lists:: * Variable-length Return Lists:: * Returning From a Function:: * Function Files:: * Script Files:: * Dynamically Linked Functions:: * Organization of Functions:: Built-in Variables * Predefined Constants:: * User Preferences:: * Other Built-in Variables:: * Summary of Preference Variables:: Arithmetic * Utility Functions:: * Complex Arithmetic:: * Trigonometry:: * Sums and Products:: * Special Functions:: Linear Algebra * Basic Matrix Functions:: * Matrix Factorizations:: * Functions of a Matrix:: Differential Equations * Ordinary Differential Equations:: * Differential-Algebraic Equations:: Optimization * Quadratic Programming:: * Nonlinear Programming:: * Linear Least Squares:: Quadrature * Functions of one Variable:: * Orthogonal Collocation:: Plotting * Two-Dimensional Plotting:: * Three-Dimensional Plotting:: * Miscellaneous Plotting Functions:: Input and Output * Basic Input and Output:: * C-Style I/O Functions:: C-Style I/O Functions * Opening and Closing Files:: * Formatted Output:: * Output Conversion Syntax:: * Table of Output Conversions:: * Integer Conversions:: * Floating-Point Conversions:: * Other Output Conversions:: * Formatted Input:: * Input Conversion Syntax:: * Table of Input Conversions:: * Numeric Input Conversions:: * String Input Conversions:: * Binary I/O:: * Other I/O Functions:: Special Matrices * Special Utility Matrices:: * Famous Matrices:: Matrix Manipulation * Finding Elements and Checking Conditions:: * Rearranging Matrices:: System Utilities * Timing Utilities:: * Interacting with the OS:: * System Information:: * Other Functions:: Programming Utilities * Evaluating Strings as Commands:: * Miscellaneous Utilities:: Installing Octave * Installation Problems:: * Binary Distributions:: Binary Distributions * Installing Octave from a Binary Distribution:: * Creating a Binary Distribution:: Known Causes of Trouble with Octave * Actual Bugs:: Bugs we will fix later. * Reporting Bugs:: * Bug Criteria:: * Bug Lists:: * Bug Reporting:: * Sending Patches:: * Service:: Reporting Bugs * Bug Criteria:: * Where: Bug Lists. Where to send your bug report. * Reporting: Bug Reporting. How to report a bug effectively. * Patches: Sending Patches. How to send a patch for Octave. Command Line Editing * Introduction and Notation:: Notation used in this text. * Readline Interaction:: The minimum set of commands for editing a line. * Readline Bare Essentials:: * Readline Movement Commands:: * Readline Killing Commands:: * Readline Arguments:: * Readline Init File:: Customizing Readline from a user's view. * Readline Init Syntax:: * Readline Vi Mode:: Readline Interaction * Readline Bare Essentials:: The least you need to know about Readline. * Readline Movement Commands:: Moving about the input line. * Readline Killing Commands:: How to delete text, and how to get it back! * Readline Arguments:: Giving numeric arguments to commands. Readline Init File * Readline Init Syntax:: Syntax for the commands in `~/.inputrc'. * Readline Vi Mode:: Switching to `vi' mode in Readline. Readline Init Syntax * Commands For Moving:: Moving about the line. * Commands For History:: Getting at previous lines. * Commands For Text:: Commands for changing text. * Commands For Killing:: Commands for killing and yanking. * Numeric Arguments:: Specifying numeric arguments, repeat counts. * Commands For Completion:: Getting Readline to do the typing for you. * Miscellaneous Commands:: Other miscellaneous commands. Using Info * Cursor Commands:: * Scrolling Commands:: * Node Commands:: * Searching Commands:: * Xref Commands:: * Window Commands:: * Printing Nodes:: * Other Info Commands:: * Info Variables:: Using Info * Cursor Commands:: Commands which move the cursor within a node. * Scrolling Commands:: Commands for moving the node around in a window. * Node Commands:: Commands for selecting a new node. * Searching Commands:: Commands for searching an info file. * Xref Commands:: Commands for selecting cross references. * Window Commands:: Commands which manipulate multiple windows. * Printing Nodes:: How to print out the contents of a node. * Other Info Commands:: A few commands that defy categories. * Info Variables:: How to change the default behavior of Info. Selecting Cross References * Parts of an Xref:: What a cross reference is made of. * Selecting Xrefs:: Commands for selecting menu or note items. Manipulating Multiple Windows * The Mode Line:: What appears in the mode line? * Basic Windows:: Manipulating windows in Info. * The Echo Area:: Used for displaying errors and reading input.  File: octave.info, Node: Preface, Next: Copying, Prev: Top, Up: Top Preface ******* Octave was originally intended to be companion software for an undergraduate-level textbook on chemical reactor design being written by James B. Rawlings and John G. Ekerdt at the University of Texas. Clearly, Octave is now much more than just another `courseware' package with limited utiltiy beyond the classroom. Although our initial goals were somewhat vague, we knew that we wanted to create something that would enable students to solve realistic problems, and that they could use for many things other than chemical reactor design problems. There are those who would say that we should be teaching the students Fortran instead, because that is the computer language of engineering, but every time we have tried that, the students have spent far too much time trying to figure out why their Fortran code crashes and not enough time learning about chemical engineering. With Octave, most students pick up the basics quickly, and are using it confidently in just a few hours. Although it was originally intended to be used to teach reactor design, it is also currently used in several other undergraduate and graduate courses in our department, and the math department at the University of Texas has been using it for teaching differential equations and linear algebra as well. If you find it useful, please let us know. We are always interested to find out how Octave is being used in other places. Virtually everyone thinks that the name Octave has something to do with music, but it is actually the name of a former professor of mine who wrote a famous textbook on chemical reaction engineering, and who was also well known for his ability to do quick `back of the envelope' calculations. We hope that this software will make it possible for many people to do more ambitious computations just as easily. Everyone is encouraged to share this software with others under the terms of the GNU General Public License (*note Copying::.) as described at the beginning of this manual. You are also encouraged to help make Octave more useful by writing and contributing additional functions for it, and by reporting any problems you may have. Many people have already contributed to Octave's development. In addition to John W. Eaton, the following people have helped write parts of Octave or helped out in various other ways. * Karl Berry (karl@cs.umb.edu) wrote the `kpathsea' library that allows Octave to recursively search directory paths for function and script files. * Georg Beyerle (gbeyerle@awi-potsdam.de) contributed code to save values in MATLAB's `.mat'-file format, and has provided many useful bug reports and suggestions. * John Campbell (jcc@che.utexas.edu) wrote most of the file and C-style input and output functions. * Brian Fox (bfox@gnu.ai.mit.edu) wrote the `readline' library used for command history editing, and the portion of this manual that documents it. * A. Scottedward Hodel (scotte@eng.auburn.edu) contributed a number of functions including `expm', `qzval', `qzhess', `syl', `lyap', and `balance'. * Kurt Hornik (Kurt.Hornik@ci.tuwien.ac.at) provided the `corrcoef', `cov', `kurtosis', `pinv', and `skewness' functions. * Phil Johnson (johnsonp@nicco.sscnet.ucla.edu) has helped to make Linux releases available. * Friedrich Leisch (leisch@ci.tuwien.ac.at) provided the `mahalanobis' function. * Ken Neighbors (wkn@leland.stanford.edu) has provided many useful bug reports and comments on MATLAB compatibility. * Rick Niles (niles@axp745.gsfc.nasa.gov) continues to track down odd incompatibilities and bugs. * Mark Odegard (meo@sugarland.unocal.com) provided the initial implementation of `fread', `fwrite', `feof', and `ferror'. * Tony Richardson (tony@guts.biomed.uakron.edu) wrote Octave's image processing functions as well as most of the original polynomial functions. * R. Bruce Tenison (Bruce.Tenison@eng.auburn.edu) wrote the `hess' and `schur' functions. * Teresa Twaroch (twaroch@ci.tuwien.ac.at) provided the functions `gls' and `ols'. * Fook Fah Yap (ffy@eng.cam.ac.uk) provided the `fft' and `ifft' functions and valuable bug reports for early versions. Special thanks to the following people and organizations for supporting the development of Octave: * Digital Equipment Corporation, for an equipment grant as part of their External Research Program. * Sun Microsystems, Inc., for an Academic Equipment grant. * Texaco Chemical Company, for providing funding to continue the development of this software. * The University of Texas College of Engineering, for providing a Challenge for Excellence Research Supplement, and for providing an Academic Development Funds grant. * The State of Texas, for providing funding through the Texas Advanced Technology Program under Grant No. 003658-078. * Noel Bell, Senior Engineer, Texaco Chemical Company, Austin Texas. * James B. Rawlings, Associate Professor, Department of Chemical Engineering, The University of Texas at Austin. * Richard Stallman, for writing GNU. Portions of this document have been adapted from the `gawk', `readline', `gcc', and C library manuals, published by the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. This project would not have been possible without the GNU software used in and used to produce Octave.  File: octave.info, Node: Copying, Next: Introduction, Prev: Preface, Up: Top GNU GENERAL PUBLIC LICENSE ************************** Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 675 Mass Ave, Cambridge, MA 02139, 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. 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 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. 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 Appendix: 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., 675 Mass Ave, Cambridge, MA 02139, 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.  File: octave.info, Node: Introduction, Next: Invoking Octave, Prev: Copying, Up: Top A Brief Introduction to Octave ****************************** This manual documents how to run, install and port Octave, and how to report bugs. Octave is a high-level language, primarily intended for numerical computations. It provides a convenient command line interface for solving linear and nonlinear problems numerically, and for performing other numerical experiments. It may also be used as a batch-oriented language. This document corresponds to Octave version 1.1.0. * Menu: * Running Octave:: * Simple Examples:: * Executable Octave Programs:: * Comments:: * Errors::  File: octave.info, Node: Running Octave, Next: Simple Examples, Prev: Introduction, Up: Introduction Running Octave ============== On most systems, the way to invoke Octave is with the shell command `octave'. Octave displays an initial message and then a prompt indicating it is ready to accept input. You can begin typing Octave commands immediately afterward. If you get into trouble, you can usually interrupt Octave by typing `Control-C' (usually written `C-c' for short). `C-c' gets its name from the fact that you type it by holding down the `CTRL' key and then pressing `c'. Doing this will normally return you to Octave's prompt. To exit Octave, type `quit', or `exit' at the Octave prompt. On systems that support job control, you can suspend Octave by sending it a `SIGTSTP' signal, usually by typing `C-z'.  File: octave.info, Node: Simple Examples, Next: Executable Octave Programs, Prev: Running Octave, Up: Introduction Simple Examples =============== The following chapters describe all of Octave's features in detail, but before doing that, it might be helpful to give a sampling of some of its capabilities. If you are new to Octave, I recommend that you try these examples to begin learning Octave by using it. Lines marked with `octave:13>' are lines you type, ending each with a carriage return. Octave will respond with an answer, or by displaying a graph. Creating a Matrix ----------------- To create a new matrix and store it in a variable so that it you can refer to it later, type the command octave:1> a = [ 1, 1, 2; 3, 5, 8; 13, 21, 34 ] Octave will respond by printing the matrix in neatly aligned columns. Ending a command with a semicolon tells Octave to not print the result of a command. For example octave:2> b = rand (3, 2); will create a 3 row, 2 column matrix with each element set to a random value between zero and one. To display the value of any variable, simply type the name of the variable. For example, to display the value stored in the matrix `b', type the command octave:3> b Matrix Arithmetic ----------------- Octave has a convenient operator notation for performing matrix arithmetic. For example, to multiply the matrix `a' by a scalar value, type the command octave:4> 2 * a To multiply the two matrices A and B, type the command octave:5> a * b To form the matrix product `transpose (a) * a', type the command octave:6> a' * a Solving Linear Equations ------------------------ To solve the set of linear equations `Ax = b', use the left division operator, `\': octave:7> a \ b This is conceptually equivalent to inv (A) * b, but avoids computing the inverse of a matrix directly. If the coefficient matrix is singular, Octave will print a warning message and compute a minimum norm solution. Integrating Differential Equations ---------------------------------- Octave has built-in functions for solving nonlinear differential equations of the form dx -- = f (x, t) dt with the initial condition x(t = t0) = x0 For Octave to integrate equations of this form, you must first provide a definition of the function `f(x,t)'. This is straightforward, and may be accomplished by entering the function body directly on the command line. For example, the following commands define the right hand side function for an interesting pair of nonlinear differential equations. Note that while you are entering a function, Octave responds with a different prompt, to indicate that it is waiting for you to complete your input. octave:8> function xdot = f (x, t) > > r = 0.25; > k = 1.4; > a = 1.5; > b = 0.16; > c = 0.9; > d = 0.8; > > xdot(1) = r*x(1)*(1 - x(1)/k) - a*x(1)*x(2)/(1 + b*x(1)); > xdot(2) = c*a*x(1)*x(2)/(1 + b*x(1)) - d*x(2); > > endfunction Given the initial condition x0 = [1; 2]; and the set of output times as a column vector (note that the first output time corresponds to the initial condition given above) t = linspace (0, 50, 200)'; it is easy to integrate the set of differential equations: x = lsode ("f", x0, t); The function `lsode' uses the Livermore Solver for Ordinary Differential Equations, described in A. C. Hindmarsh, `ODEPACK, a Systematized Collection of ODE Solvers', in: Scientific Computing, R. S. Stepleman et al. (Eds.), North-Holland, Amsterdam, 1983, pages 55-64. Producing Graphical Output -------------------------- To display the solution of the previous example graphically, use the command plot (t, x) If you are using the X Window System, Octave will automatically create a separate window to display the plot. If you are using a terminal that supports some other graphics commands, you will need to tell Octave what kind of terminal you have. Type the command set term to see a list of the supported terminal types. Octave uses `gnuplot' to display graphics, and can display graphics on any terminal that is supported by `gnuplot'. To capture the output of the plot command in a file rather than sending the output directly to your terminal, you can use a set of commands like this set term postscript set output "foo.ps" replot This will work for other types of output devices as well. Octave's `set' command is really just piped to the `gnuplot' subprocess, so that once you have a plot on the screen that you like, you should be able to do something like this to create an output file suitable for your graphics printer. Or, you can eliminate the intermediate file by using commands like this set term postscript set output "|lpr -Pname_of_your_graphics_printer" replot Editing What You Have Typed --------------------------- At the Octave prompt, you can recall, edit, and reissue previous commands using Emacs- or vi-style editing commands. The default keybindings use Emacs-style commands. For example, to recall the previous command, type `Control-P' (usually written `C-p' for short). `C-p' gets its name from the fact that you type it by holding down the `CTRL' key and then pressing `p'. Doing this will normally bring back the previous line of input. `C-n' will bring up the next line of input, `C-b' will move the cursor backward on the line, `C-f' will move the cursor forward on the line, etc. A complete description of the command line editing capability is given in this manual in Appendix *Note Command Line Editing::. Getting Help ------------ Octave has an extensive help facility. The same documentation that is available in printed form is also available from the Octave prompt, because both forms of the documentation are created from the same input file. In order to get good help you first need to know the name of the command that you want to use. This name of the function may not always be obvious, but a good place to start is to just type `help'. This will show you all the operators, reserved words, functions, built-in variables, and function files. You can then get more help on anything that is listed by simply including the name as an argument to help. For example, help plot will display the help text for the `plot' function. Octave sends output that is too long to fit on one screen through a pager like `less' or `more'. Type a carriage return to advance one line, a space character to advance one page, and `q' to exit the pager. Help via Info ............. The part of Octave's help facility that allows you to read the complete text of the printed manual from within Octave uses a program called Info. When you invoke Info you will be put into a menu driven program that contains the entire Octave manual. Help for using Info is provided in this manual in Appendix *Note Using Info::.  File: octave.info, Node: Executable Octave Programs, Next: Comments, Prev: Simple Examples, Up: Introduction Executable Octave Programs ========================== Once you have learned Octave, you may want to write self-contained Octave scripts, using the `#!' script mechanism. You can do this on many Unix systems (1) (and someday on GNU). For example, you could create a text file named `hello', containing the following lines: #! /usr/local/bin/octave -qf # a sample Octave program printf ("Hello, world!\n"); After making this file executable (with the `chmod' command), you can simply type: hello at the shell, and the system will arrange to run Octave (2) as if you had typed: octave hello Self-contained Octave scripts are useful when you want to write a program which users can invoke without knowing that the program is written in the Octave language. ---------- Footnotes ---------- (1) The `#!' mechanism works on Unix systems derived from Berkeley Unix, System V Release 4, and some System V Release 3 systems. (2) The line beginning with `#!' lists the full file name of an interpreter to be run, and an optional initial command line argument to pass to that interpreter. The operating system then runs the interpreter with the given argument and the full argument list of the executed program. The first argument in the list is the full file name of the Octave program. The rest of the argument list will either be options to Octave, or data files, or both. The `-qf' option is usually specified in stand-alone Octave programs to prevent them from printing the normal startup message, and to keep them from behaving differently depending on the contents of a particular user's `~/.octaverc' file. *Note Invoking Octave::.  File: octave.info, Node: Comments, Next: Errors, Prev: Executable Octave Programs, Up: Introduction Comments in Octave Programs =========================== A "comment" is some text that is included in a program for the sake of human readers, and that is not really part of the program. Comments can explain what the program does, and how it works. Nearly all programming languages have provisions for comments, because programs are typically hard to understand without them. In the Octave language, a comment starts with either the sharp sign character, `#', or the percent symbol `%' and continues to the end of the line. The Octave interpreter ignores the rest of a line following a sharp sign or percent symbol. For example, we could have put the following into the function `f': function xdot = f (x, t) # usage: f (x, t) # # This function defines the right-hand-side functions for a set of # nonlinear differential equations. r = 0.25 and so on... endfunction The `help' command (*note Help::.) is able to find the first block of comments in a function (even those that are composed directly on the command line). This means that users of Octave can use the same commands to get help for built-in functions, and for functions that you have defined. For example, after defining the function `f' above, the command help f produces the output usage: f (x, t) This function defines the right-hand-side functions for a set of nonlinear differential equations. Although it is possible to put comment lines into keyboard-composed throw-away Octave programs, it usually isn't very useful, because the purpose of a comment is to help you or another person understand the program at a later time.  File: octave.info, Node: Errors, Prev: Comments, Up: Introduction Errors ====== There are two classes of errors that Octave produces when it encounters input that it is unable to understand, or when it is unable to perform an action. A "parse error" occurs if Octave cannot understand something you have typed. For example, if you misspell a keyword, octave:13> functon y = f (x) y = x^2; endfunction Octave will respond immediately with a message like this: parse error: functon y = f (x) y = x^2; endfunction ^ For most parse errors, Octave uses a caret (`^') to mark the point on the line where it was unable to make sense of your input. In this case, Octave generated an error message because the keyword `function' was misspelled. Instead of seeing `function f', Octave saw two consecutive variable names, which is invalid in this context. It marked the error at the `y' because the first name by itself was accepted as valid input. Another class of error message occurs occurs at evaluation time. These errors are called "run-time errors", or sometimes "evaluation errors" because they occur when your program is being "run", or "evaluated". For example, if after correcting the mistake in the previous function definition, you type octave:13> f () Octave will respond with error: `x' undefined near line 1 column 24 error: evaluating expression near line 1, column 24 error: evaluating assignment expression near line 1, column 22 error: called from `f' This error message has several parts, and gives you quite a bit of information to help you locate the source of the error. The messages are generated from the point of the innermost error, and provide a traceback of enclosing expression and function calls. In the example above, the first line indicates that a variable named `x' was found to be undefined near line 1 and column 24 of some function or expression. For errors occurring within functions, lines are numbered beginning with the line containing the `function' keyword. For errors occurring at the top level, the line number indicates the input line number, which is usually displayed in the prompt string. The second and third lines in the example indicate that the error occurred within an assignment expression, and the last line of the error message indicates that the error occurred within the function `f'. If the function `f' had been called from another function, say `g', the list of errors would have ended with one more line: error: called from `g' These lists of function calls usually make it fairly easy to trace the path your program took before the error occurred, and to correct the error before trying again.  File: octave.info, Node: Invoking Octave, Next: Expressions, Prev: Introduction, Up: Top Invoking Octave *************** Normally, Octave is used interactively by running the program `octave' without any arguments. Once started, Octave reads commands from the terminal until you tell it to exit. You can also specify the name of a file on the command line, and Octave will read and execute the commands from the named file and then exit when it is finished. You can further control how Octave starts up by using the command-line options described in the next section, and Octave itself can remind you of the options available. Type octave --help to display all available options and briefly describe their use (`octave -h' is a shorter equivalent). * Menu: * Command Line Options:: * Startup Files::  File: octave.info, Node: Command Line Options, Next: Startup Files, Prev: Invoking Octave, Up: Invoking Octave Command Line Options ==================== `--debug' `-d' Enter parser debugging mode. Using this option will cause Octave's parser to print a lot of information about the commands it reads, and is probably only useful if you are actually trying to debug the parser. `--help' `-h' `-?' Print short help message and exit. `--ignore-init-file' `--norc' `-f' Don't read any of the system or user initialization files at startup. `--info-file FILENAME' Specify the name of the info file to use. The value of FILENAME specified on the command line will override any value of `OCTAVE_INFO_FILE' found in the environment, but not any `INFO_FILE = "filename"' commands found in the system or user startup files. `--interactive' `-i' Force interactive behavior. `--path PATH' `-p PATH' Specify the path to search for function files. The value of PATH specified on the command line will override any value of `OCTAVE_PATH' found in the environment, but not any `LOADPATH = "path"' commands found in the system or user startup files. `--silent' `--quiet' `-q' Don't print message at startup. `--verbose' `-V' Turn on verbose output. `--version' `-v' Print the program version number and exit. `--echo-commands' `-x' Echo commands as they are executed. `FILE' Execute commands from FILE. octave-1.1.0/doc/octave.info-10100666 415 17 112603 5705317773 14341 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Function Index, Next: Operator Index, Prev: Variable Index, Up: Top Function Index ************** * Menu: * -ascii: Basic Input and Output. * -ascii: Basic Input and Output. * -binary: Basic Input and Output. * -binary: Basic Input and Output. * -float-binary: Basic Input and Output. * -force: Basic Input and Output. * -mat-binary: Basic Input and Output. * -mat-binary: Basic Input and Output. * -save-builtins: Basic Input and Output. * .octaverc: Startup Files. * abcddim (A, B, C, D): Control Theory. * abs (X): Complex Arithmetic. * acos: Trigonometry. * acosh: Trigonometry. * acot: Trigonometry. * acoth: Trigonometry. * acsc: Trigonometry. * acsch: Trigonometry. * all: Finding Elements and Checking Conditions. * angle (X): Complex Arithmetic. * any: Finding Elements and Checking Conditions. * are (A, B, C, OPT): Control Theory. * arg (X): Complex Arithmetic. * asec: Trigonometry. * asech: Trigonometry. * asin: Trigonometry. * asinh: Trigonometry. * atan: Trigonometry. * atan2: Trigonometry. * atanh: Trigonometry. * axis (LIMITS): Miscellaneous Plotting Functions. * balance: Basic Matrix Functions. * bar (X, Y): Miscellaneous Plotting Functions. * beta: Special Functions. * betai (A, B, X): Special Functions. * bug_report: Reporting Bugs. * bug_report: Bug Lists. * c2d (A, B, T): Control Theory. * casesen: Amusements. * cd: Interacting with the OS. * ceil (X): Utility Functions. * chdir: Interacting with the OS. * chol (A): Matrix Factorizations. * clc: Interacting with the OS. * clear PATTERN ...: Miscellaneous Utilities. * clearplot: Miscellaneous Plotting Functions. * clg: Miscellaneous Plotting Functions. * clock: Timing Utilities. * closeplot: Miscellaneous Plotting Functions. * colloc: Orthogonal Collocation. * colormap: Image Processing. * columns (A): Miscellaneous Utilities. * compan (C): Polynomial Manipulations. * complement: Sets. * computer: System Information. * cond (A): Basic Matrix Functions. * conj (X): Complex Arithmetic. * contour (Z, N, X, Y): Two-Dimensional Plotting. * conv (A, B): Polynomial Manipulations. * corrcoef (X [, Y]): Statistics. * cos: Trigonometry. * cosh: Trigonometry. * cot: Trigonometry. * coth: Trigonometry. * cov (X [, Y]): Statistics. * cputime: Timing Utilities. * create_set: Sets. * csc: Trigonometry. * csch: Trigonometry. * cumprod (X): Sums and Products. * cumsum (X): Sums and Products. * dare (A, B, C, R, OPT): Control Theory. * dassl: Differential-Algebraic Equations. * dassl_options: Differential-Algebraic Equations. * date: Timing Utilities. * deconv (Y, A): Polynomial Manipulations. * det (A): Basic Matrix Functions. * dgram (A, B): Control Theory. * diag: Special Utility Matrices. * diary: Command History Functions. * dir: Interacting with the OS. * disp: Basic Input and Output. * dlqe (A, G, C, SIGW, SIGV [, Z]): Control Theory. * dlqr (A, B, Q, R [, Z]): Control Theory. * dlyap (A, B): Control Theory. * document SYMBOL TEXT: Miscellaneous Utilities. * edit_history: Command History Functions. * eig: Basic Matrix Functions. * erf: Special Functions. * erfc (Z): Special Functions. * erfinv: Special Functions. * error (MSG): Miscellaneous Utilities. * etime: Timing Utilities. * eval: Evaluating Strings as Commands. * exist (NAME): Miscellaneous Utilities. * exit: Amusements. * exit: Running Octave. * exp (X): Utility Functions. * expm: Functions of a Matrix. * eye: Special Utility Matrices. * fclose: Opening and Closing Files. * feof: Other I/O Functions. * ferror: Other I/O Functions. * feval: Evaluating Strings as Commands. * fflush: Input and Output. * fft (A): Signal Processing. * fft2 (A): Signal Processing. * fftconv (A, B, N): Signal Processing. * fftfilt (B, X, N): Signal Processing. * fgets: Other I/O Functions. * file_in_path (PATH, FILE): Miscellaneous Utilities. * filter (B, A, X): Signal Processing. * find: Finding Elements and Checking Conditions. * finite: Finding Elements and Checking Conditions. * fix (X): Utility Functions. * fliplr: Rearranging Matrices. * flipud: Rearranging Matrices. * floor (X): Utility Functions. * flops: Amusements. * fopen: Opening and Closing Files. * format: Basic Input and Output. * fprintf (FILE, TEMPLATE, ...): Formatted Output. * fread (FILE, SIZE, PRECISION): Binary I/O. * freport: Other I/O Functions. * freqz: Signal Processing. * frewind: Other I/O Functions. * fscanf (FILE, TEMPLATE): Formatted Input. * fseek: Other I/O Functions. * fsolve: Nonlinear Equations. * fsolve_options: Nonlinear Equations. * ftell: Other I/O Functions. * fwrite (FILE, DATA, PRECISION): Binary I/O. * gamma (Z): Special Functions. * gammai (A, X): Special Functions. * gcd (X, ...): Utility Functions. * getenv: Interacting with the OS. * givens: Basic Matrix Functions. * gls (Y, X, O): Linear Least Squares. * gplot: Plotting. * gray (N): Image Processing. * gray2ind: Image Processing. * grid: Miscellaneous Plotting Functions. * gsplot: Plotting. * hadamard (K): Famous Matrices. * hankel (C, R): Famous Matrices. * help: Help. * hess (A): Matrix Factorizations. * hilb (N): Famous Matrices. * hist (Y, X): Miscellaneous Plotting Functions. * history: Command History Functions. * hold: Two-Dimensional Plotting. * home: Interacting with the OS. * ifft (A): Signal Processing. * ifft2: Signal Processing. * imag (X): Complex Arithmetic. * image: Image Processing. * imagesc: Image Processing. * imshow: Image Processing. * ind2gray: Image Processing. * ind2rgb: Image Processing. * input: Basic Input and Output. * int2str: String Functions. * intersection: Sets. * inv (A): Basic Matrix Functions. * inverse (A): Basic Matrix Functions. * invhilb (N): Famous Matrices. * isempty (A): Miscellaneous Utilities. * ishold: Two-Dimensional Plotting. * isieee: System Information. * isinf: Finding Elements and Checking Conditions. * isnan: Finding Elements and Checking Conditions. * isstr (A): Miscellaneous Utilities. * is_controllable (A, B, TOL): Control Theory. * is_global (A): Miscellaneous Utilities. * is_leap_year: Timing Utilities. * is_matrix (A): Miscellaneous Utilities. * is_observable (A, C, TOL): Control Theory. * is_scalar (A): Miscellaneous Utilities. * is_square (X): Miscellaneous Utilities. * is_struct: Data Structures. * is_symmetric (X, TOL): Miscellaneous Utilities. * is_vector (A): Miscellaneous Utilities. * kbhit: Other I/O Functions. * keyboard: Basic Input and Output. * kron (A, B): Functions of a Matrix. * kurtosis (X): Statistics. * lcm (X, ...): Utility Functions. * length (A): Miscellaneous Utilities. * lgamma: Special Functions. * linspace: Special Utility Matrices. * list_primes: Amusements. * load: Basic Input and Output. * loadimage: Image Processing. * log (X): Utility Functions. * log10 (X): Utility Functions. * log2 (X): Utility Functions. * loglog (ARGS): Two-Dimensional Plotting. * logm (A): Functions of a Matrix. * logspace: Special Utility Matrices. * lqe (A, G, C, SIGW, SIGV, Z): Control Theory. * lqr (A, B, Q, R, Z): Control Theory. * ls: Interacting with the OS. * lsode: Ordinary Differential Equations. * lsode_options: Ordinary Differential Equations. * lu (A): Matrix Factorizations. * lyap (A, B, C): Control Theory. * mahalanobis (X, Y): Statistics. * max (X): Utility Functions. * mean (A): Statistics. * median (A): Statistics. * menu (TITLE, OPT1, ...): Miscellaneous Utilities. * mesh (X, Y, Z): Three-Dimensional Plotting. * meshdom (X, Y): Three-Dimensional Plotting. * min (X): Utility Functions. * nargchk (NARGIN_MIN, NARGIN_MAX, N): Miscellaneous Utilities. * newtroot: Evaluating Strings as Commands. * norm (A, P): Basic Matrix Functions. * npsol: Nonlinear Programming. * npsol_options: Nonlinear Programming. * null (A, TOL): Basic Matrix Functions. * num2str: String Functions. * ocean (N): Image Processing. * OCTAVE_HOME/lib/octave/VERSION/startup/octaverc: Startup Files. * octave_tmp_file_name: Miscellaneous Utilities. * ols (Y, X): Linear Least Squares. * ones: Special Utility Matrices. * orth (A, TOL): Basic Matrix Functions. * pause: Other Functions. * perror (NAME, NUM): Miscellaneous Utilities. * pinv (X, TOL): Basic Matrix Functions. * plot (ARGS): Two-Dimensional Plotting. * polar (THETA, RHO): Two-Dimensional Plotting. * poly (A): Polynomial Manipulations. * polyderiv (C): Polynomial Manipulations. * polyinteg (C): Polynomial Manipulations. * polyreduce (C): Polynomial Manipulations. * polyval (C, X): Polynomial Manipulations. * polyvalm (C, X): Polynomial Manipulations. * printf (TEMPLATE, ...): Formatted Output. * prod (X): Sums and Products. * purge_tmp_files: Miscellaneous Plotting Functions. * pwd: Interacting with the OS. * qpsol: Quadratic Programming. * qpsol_options: Quadratic Programming. * qr (A): Matrix Factorizations. * quad: Functions of one Variable. * quad_options: Functions of one Variable. * quit: Amusements. * quit: Running Octave. * qzhess (A, B): Functions of a Matrix. * qzval (A, B): Functions of a Matrix. * rand: Special Utility Matrices. * rank (A, TOL): Basic Matrix Functions. * real (X): Complex Arithmetic. * rem (X, Y): Utility Functions. * replot: Two-Dimensional Plotting. * reshape: Rearranging Matrices. * residue (B, A, TOL): Polynomial Manipulations. * rgb2ind: Image Processing. * roots (V): Polynomial Manipulations. * rot90: Rearranging Matrices. * round (X): Utility Functions. * rows (A): Miscellaneous Utilities. * run_history: Command History Functions. * save: Basic Input and Output. * saveimage: Image Processing. * scanf (TEMPLATE): Formatted Input. * schur: Matrix Factorizations. * sec: Trigonometry. * sech: Trigonometry. * semilogx (ARGS): Two-Dimensional Plotting. * semilogy (ARGS): Two-Dimensional Plotting. * set: Two-Dimensional Plotting. * setstr: String Functions. * shell_cmd: Interacting with the OS. * show: Two-Dimensional Plotting. * sign (X): Utility Functions. * sin: Trigonometry. * sinc (X): Signal Processing. * sinh: Trigonometry. * size (A): Miscellaneous Utilities. * skewness (X): Statistics. * sombrero (N): Miscellaneous Plotting Functions. * sort: Rearranging Matrices. * sprintf (TEMPLATE, ...): Formatted Output. * sqrt (X): Utility Functions. * sqrtm (A): Functions of a Matrix. * sscanf (STRING, TEMPLATE): Formatted Input. * stairs (X, Y): Miscellaneous Plotting Functions. * std (A): Statistics. * strcmp: String Functions. * sum (X): Sums and Products. * sumsq (X): Sums and Products. * svd (A): Matrix Factorizations. * syl (A, B, C): Functions of a Matrix. * system: Interacting with the OS. * tan: Trigonometry. * tanh: Trigonometry. * texas_lotto: Amusements. * tic: Timing Utilities. * title (STRING): Miscellaneous Plotting Functions. * toc: Timing Utilities. * toeplitz (C, R): Famous Matrices. * trace (A): Basic Matrix Functions. * tril: Rearranging Matrices. * triu: Rearranging Matrices. * type NAME ...: Miscellaneous Utilities. * tzero (A, B, C, D, BAL): Control Theory. * undo_string_escapes: String Functions. * union: Sets. * usage (MSG): Miscellaneous Utilities. * vander (C): Famous Matrices. * va_arg: Variable-length Argument Lists. * va_start: Variable-length Argument Lists. * version: System Information. * vr_val: Variable-length Return Lists. * warning (MSG): Miscellaneous Utilities. * which NAME ...: Miscellaneous Utilities. * who OPTIONS PATTERN ...: Miscellaneous Utilities. * whos: Miscellaneous Utilities. * xlabel (STRING): Miscellaneous Plotting Functions. * ylabel (STRING): Miscellaneous Plotting Functions. * zeros: Special Utility Matrices. * [K, P, E] = lqr (A, B, Q, R, Z): Control Theory. * ~/.octaverc: Startup Files.  File: octave.info, Node: Operator Index, Next: Readline Index, Prev: Function Index, Up: Top Operator Index ************** * Menu: * !: Element-by-element Boolean Operators. * !=: Comparison Ops. * ": String Constants. * &: Element-by-element Boolean Operators. * &&: Short-circuit Boolean Operators. * ': String Constants. * ': Arithmetic Ops. * *: Arithmetic Ops. * **: Arithmetic Ops. * +: Arithmetic Ops. * ++: Assignment Ops. * ,: Matrices. * -: Arithmetic Ops. * -: Assignment Ops. * .': Arithmetic Ops. * .*: Arithmetic Ops. * .**: Arithmetic Ops. * .+: Arithmetic Ops. * .-: Arithmetic Ops. * ./: Arithmetic Ops. * .\: Arithmetic Ops. * .^: Arithmetic Ops. * /: Arithmetic Ops. * :: Ranges. * ;: Matrices. * <: Comparison Ops. * <=: Comparison Ops. * <>: Comparison Ops. * =: Assignment Ops. * ==: Comparison Ops. * >: Comparison Ops. * >=: Comparison Ops. * [: Matrices. * \: Arithmetic Ops. * ]: Matrices. * ^: Arithmetic Ops. * |: Element-by-element Boolean Operators. * ||: Short-circuit Boolean Operators. * ~: Element-by-element Boolean Operators. * ~=: Comparison Ops.  File: octave.info, Node: Readline Index, Next: Info Index, Prev: Operator Index, Up: Top Readline Index ************** * Menu: * abort (C-g): Miscellaneous Commands. * accept-line (Newline, Return): Commands For History. * backward-char (C-b): Commands For Moving. * backward-delete-char (Rubout): Commands For Text. * backward-kill-line (): Commands For Killing. * backward-kill-word (M-DEL): Commands For Killing. * backward-word (M-b): Commands For Moving. * beginning-of-history (M-<): Commands For History. * beginning-of-line (C-a): Commands For Moving. * capitalize-word (M-c): Commands For Text. * clear-screen (C-l): Commands For Moving. * complete (TAB): Commands For Completion. * delete-char (C-d): Commands For Text. * digit-argument (M-0, M-1, ... M-): Numeric Arguments. * do-uppercase-version (M-a, M-b, ...): Miscellaneous Commands. * downcase-word (M-l): Commands For Text. * editing-mode: Readline Init Syntax. * end-of-history (M->): Commands For History. * end-of-line (C-e): Commands For Moving. * forward-char (C-f): Commands For Moving. * forward-search-history (C-s): Commands For History. * forward-word (M-f): Commands For Moving. * horizontal-scroll-mode: Readline Init Syntax. * interaction, readline: Readline Interaction. * kill-line (C-k): Commands For Killing. * kill-word (M-d): Commands For Killing. * mark-modified-lines: Readline Init Syntax. * next-history (C-n): Commands For History. * possible-completions (M-?): Commands For Completion. * prefer-visible-bell: Readline Init Syntax. * prefix-meta (ESC): Miscellaneous Commands. * previous-history (C-p): Commands For History. * quoted-insert (C-q, C-v): Commands For Text. * re-read-init-file (C-x C-r): Miscellaneous Commands. * reverse-search-history (C-r): Commands For History. * revert-line (M-r): Miscellaneous Commands. * self-insert (a, b, A, 1, !, ...): Commands For Text. * tab-insert (M-TAB): Commands For Text. * transpose-chars (C-t): Commands For Text. * transpose-words (M-t): Commands For Text. * undo (C-_): Miscellaneous Commands. * universal-argument (): Numeric Arguments. * unix-line-discard (C-u): Commands For Killing. * unix-word-rubout (C-w): Commands For Killing. * upcase-word (M-u): Commands For Text. * yank (C-y): Commands For Killing. * yank-pop (M-y): Commands For Killing.  File: octave.info, Node: Info Index, Prev: Readline Index, Up: Top Info Index ********** * Menu: * , in Info windows: Searching Commands. * 0, in Info windows: Selecting Xrefs. * 1 ... 9, in Info windows: Selecting Xrefs. * 1 ... 9, in Info windows: Selecting Xrefs. * <, in Info windows: Node Commands. * >, in Info windows: Node Commands. * ?, in Info windows: Other Info Commands. * ?, in the Info echo area: The Echo Area. * abort-key: Other Info Commands. * add-digit-to-numeric-arg: Other Info Commands. * automatic-footnotes: Info Variables. * automatic-tiling: Info Variables. * b, in Info windows: Cursor Commands. * backward-char: Cursor Commands. * backward-word: Cursor Commands. * beginning-of-line: Cursor Commands. * beginning-of-node: Cursor Commands. * C-a, in Info windows: Cursor Commands. * C-a, in the Info echo area: The Echo Area. * C-b, in Info windows: Cursor Commands. * C-b, in the Info echo area: The Echo Area. * C-d, in the Info echo area: The Echo Area. * C-e, in Info windows: Cursor Commands. * C-e, in the Info echo area: The Echo Area. * C-f, in Info windows: Cursor Commands. * C-f, in the Info echo area: The Echo Area. * C-g, in Info windows: Other Info Commands. * C-g, in the Info echo area: The Echo Area. * C-h, in Info windows: Other Info Commands. * C-k, in the Info echo area: The Echo Area. * C-l, in Info windows: Scrolling Commands. * C-n, in Info windows: Cursor Commands. * C-p, in Info windows: Cursor Commands. * C-q, in the Info echo area: The Echo Area. * C-r, in Info windows: Searching Commands. * C-s, in Info windows: Searching Commands. * C-t, in the Info echo area: The Echo Area. * C-u, in Info windows: Other Info Commands. * C-v, in Info windows: Scrolling Commands. * C-w, in Info windows: Scrolling Commands. * C-x 0, in Info windows: Basic Windows. * C-x 1, in Info windows: Basic Windows. * C-x 2, in Info windows: Basic Windows. * C-x b, in Info windows: Node Commands. * C-x C-b, in Info windows: Node Commands. * C-x C-f, in Info windows: Node Commands. * C-x DEL, in the Info echo area: The Echo Area. * C-x k, in Info windows: Node Commands. * C-x o, in Info windows: Basic Windows. * C-x t, in Info windows: Basic Windows. * C-x ^, in Info windows: Basic Windows. * C-y, in the Info echo area: The Echo Area. * cancelling the current operation: Other Info Commands. * cancelling typeahead: Other Info Commands. * commands, describing: Other Info Commands. * cursor, moving: Cursor Commands. * d, in Info windows: Node Commands. * DEL, in Info windows: Scrolling Commands. * DEL, in the Info echo area: The Echo Area. * delete-window: Basic Windows. * describe-command: Other Info Commands. * describe-key: Other Info Commands. * describe-variable: Info Variables. * dir-node: Node Commands. * echo area: The Echo Area. * echo-area-abort: The Echo Area. * echo-area-backward: The Echo Area. * echo-area-backward-kill-line: The Echo Area. * echo-area-backward-kill-word: The Echo Area. * echo-area-backward-word: The Echo Area. * echo-area-beg-of-line: The Echo Area. * echo-area-complete: The Echo Area. * echo-area-delete: The Echo Area. * echo-area-end-of-line: The Echo Area. * echo-area-forward: The Echo Area. * echo-area-forward-word: The Echo Area. * echo-area-insert: The Echo Area. * echo-area-kill-line: The Echo Area. * echo-area-kill-word: The Echo Area. * echo-area-newline: The Echo Area. * echo-area-possible-completions: The Echo Area. * echo-area-quoted-insert: The Echo Area. * echo-area-rubout: The Echo Area. * echo-area-scroll-completions-window: The Echo Area. * echo-area-tab-insert: The Echo Area. * echo-area-transpose-chars: The Echo Area. * echo-area-yank: The Echo Area. * echo-area-yank-pop: The Echo Area. * end-of-line: Cursor Commands. * end-of-node: Cursor Commands. * errors-ring-bell: Info Variables. * ESC C-f, in Info windows: Other Info Commands. * ESC C-v, in Info windows: Basic Windows. * ESC C-v, in the Info echo area: The Echo Area. * f, in Info windows: Selecting Xrefs. * find-menu: Selecting Xrefs. * first-node: Node Commands. * footnotes, displaying: Other Info Commands. * forward-char: Cursor Commands. * forward-word: Cursor Commands. * functions, describing: Other Info Commands. * g, in Info windows: Node Commands. * gc-compressed-files: Info Variables. * get-help-window: Other Info Commands. * get-info-help-node: Other Info Commands. * global-next-node: Node Commands. * global-prev-node: Node Commands. * goto-node: Node Commands. * grow-window: Basic Windows. * h, in Info windows: Other Info Commands. * history-node: Node Commands. * i, in Info windows: Searching Commands. * index-search: Searching Commands. * INFO_PRINT_COMMAND, environment variable: Printing Nodes. * isearch-backward: Searching Commands. * isearch-forward: Searching Commands. * ISO Latin characters: Info Variables. * ISO-Latin: Info Variables. * keep-one-window: Basic Windows. * keys, describing: Other Info Commands. * kill-node: Node Commands. * l, in Info windows: Node Commands. * last-menu-item: Selecting Xrefs. * last-node: Node Commands. * list-visited-nodes: Node Commands. * m, in Info windows: Selecting Xrefs. * M-1 ... M-9, in Info windows: Other Info Commands. * M-<, in Info windows: Cursor Commands. * M->, in Info windows: Cursor Commands. * M-b, in Info windows: Cursor Commands. * M-b, in the Info echo area: The Echo Area. * M-d, in the Info echo area: The Echo Area. * M-DEL, in the Info echo area: The Echo Area. * M-f, in Info windows: Cursor Commands. * M-f, in the Info echo area: The Echo Area. * M-r, in Info windows: Cursor Commands. * M-TAB, in Info windows: Selecting Xrefs. * M-TAB, in the Info echo area: The Echo Area. * M-v, in Info windows: Scrolling Commands. * M-y, in the Info echo area: The Echo Area. * menu-digit: Selecting Xrefs. * menu-item: Selecting Xrefs. * move-to-next-xref: Selecting Xrefs. * move-to-prev-xref: Selecting Xrefs. * move-to-window-line: Cursor Commands. * n, in Info windows: Node Commands. * next-index-match: Searching Commands. * next-line: Cursor Commands. * next-node: Node Commands. * next-window: Basic Windows. * nodes, selection of in Info windows: Node Commands. * numeric arguments: Other Info Commands. * p, in Info windows: Node Commands. * prev-line: Cursor Commands. * prev-node: Node Commands. * prev-window: Basic Windows. * print-node: Printing Nodes. * printing: Printing Nodes. * printing characters, in the Info echo area: The Echo Area. * q, in Info windows: Other Info Commands. * quit: Other Info Commands. * quitting: Other Info Commands. * r, in Info windows: Selecting Xrefs. * redraw-display: Scrolling Commands. * RET, in Info windows: Selecting Xrefs. * RET, in the Info echo area: The Echo Area. * s, in Info windows: Searching Commands. * screen, changing the height of: Other Info Commands. * scroll-backward: Scrolling Commands. * scroll-behaviour: Info Variables. * scroll-forward: Scrolling Commands. * scroll-other-window: Basic Windows. * scroll-step: Info Variables. * scrolling through node structure: Scrolling Commands. * scrolling, in Info windows: Scrolling Commands. * search: Searching Commands. * searching: Searching Commands. * select-reference-this-line: Selecting Xrefs. * select-visited-node: Node Commands. * set-screen-height: Other Info Commands. * set-variable: Info Variables. * show-footnotes: Other Info Commands. * show-index-match: Info Variables. * SPC, in Info windows: Scrolling Commands. * SPC, in the Info echo area: The Echo Area. * split-window: Basic Windows. * t, in Info windows: Node Commands. * TAB, in Info windows: Selecting Xrefs. * TAB, in the Info echo area: The Echo Area. * tile-windows: Basic Windows. * tiling: Basic Windows. * toggle-wrap: Scrolling Commands. * top-node: Node Commands. * u, in Info windows: Node Commands. * universal-argument: Other Info Commands. * up-node: Node Commands. * variables, describing: Info Variables. * variables, setting: Info Variables. * view-file: Node Commands. * visible-bell: Info Variables. * where-is: Other Info Commands. * windows, creating: Basic Windows. * windows, deleting: Basic Windows. * windows, manipulating: Window Commands. * windows, selecting: Basic Windows. * xref-item: Selecting Xrefs. * [, in Info windows: Node Commands. * ], in Info windows: Node Commands. octave-1.1.0/doc/octave.info-11100666 415 17 30722 5705060363 14311 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Info Index, Prev: Readline Index, Up: Top Info Index ********** * Menu: * , in Info windows: Searching Commands. * 0, in Info windows: Selecting Xrefs. * 1 ... 9, in Info windows: Selecting Xrefs. * 1 ... 9, in Info windows: Selecting Xrefs. * <, in Info windows: Node Commands. * >, in Info windows: Node Commands. * ?, in Info windows: Other Info Commands. * ?, in the Info echo area: The Echo Area. * abort-key: Other Info Commands. * add-digit-to-numeric-arg: Other Info Commands. * automatic-footnotes: Info Variables. * automatic-tiling: Info Variables. * b, in Info windows: Cursor Commands. * backward-char: Cursor Commands. * backward-word: Cursor Commands. * beginning-of-line: Cursor Commands. * beginning-of-node: Cursor Commands. * C-a, in Info windows: Cursor Commands. * C-a, in the Info echo area: The Echo Area. * C-b, in Info windows: Cursor Commands. * C-b, in the Info echo area: The Echo Area. * C-d, in the Info echo area: The Echo Area. * C-e, in Info windows: Cursor Commands. * C-e, in the Info echo area: The Echo Area. * C-f, in Info windows: Cursor Commands. * C-f, in the Info echo area: The Echo Area. * C-g, in Info windows: Other Info Commands. * C-g, in the Info echo area: The Echo Area. * C-h, in Info windows: Other Info Commands. * C-k, in the Info echo area: The Echo Area. * C-l, in Info windows: Scrolling Commands. * C-n, in Info windows: Cursor Commands. * C-p, in Info windows: Cursor Commands. * C-q, in the Info echo area: The Echo Area. * C-r, in Info windows: Searching Commands. * C-s, in Info windows: Searching Commands. * C-t, in the Info echo area: The Echo Area. * C-u, in Info windows: Other Info Commands. * C-v, in Info windows: Scrolling Commands. * C-w, in Info windows: Scrolling Commands. * C-x 0, in Info windows: Basic Windows. * C-x 1, in Info windows: Basic Windows. * C-x 2, in Info windows: Basic Windows. * C-x b, in Info windows: Node Commands. * C-x C-b, in Info windows: Node Commands. * C-x C-f, in Info windows: Node Commands. * C-x DEL, in the Info echo area: The Echo Area. * C-x k, in Info windows: Node Commands. * C-x o, in Info windows: Basic Windows. * C-x t, in Info windows: Basic Windows. * C-x ^, in Info windows: Basic Windows. * C-y, in the Info echo area: The Echo Area. * cancelling the current operation: Other Info Commands. * cancelling typeahead: Other Info Commands. * commands, describing: Other Info Commands. * cursor, moving: Cursor Commands. * d, in Info windows: Node Commands. * DEL, in Info windows: Scrolling Commands. * DEL, in the Info echo area: The Echo Area. * delete-window: Basic Windows. * describe-command: Other Info Commands. * describe-key: Other Info Commands. * describe-variable: Info Variables. * dir-node: Node Commands. * echo area: The Echo Area. * echo-area-abort: The Echo Area. * echo-area-backward: The Echo Area. * echo-area-backward-kill-line: The Echo Area. * echo-area-backward-kill-word: The Echo Area. * echo-area-backward-word: The Echo Area. * echo-area-beg-of-line: The Echo Area. * echo-area-complete: The Echo Area. * echo-area-delete: The Echo Area. * echo-area-end-of-line: The Echo Area. * echo-area-forward: The Echo Area. * echo-area-forward-word: The Echo Area. * echo-area-insert: The Echo Area. * echo-area-kill-line: The Echo Area. * echo-area-kill-word: The Echo Area. * echo-area-newline: The Echo Area. * echo-area-possible-completions: The Echo Area. * echo-area-quoted-insert: The Echo Area. * echo-area-rubout: The Echo Area. * echo-area-scroll-completions-window: The Echo Area. * echo-area-tab-insert: The Echo Area. * echo-area-transpose-chars: The Echo Area. * echo-area-yank: The Echo Area. * echo-area-yank-pop: The Echo Area. * end-of-line: Cursor Commands. * end-of-node: Cursor Commands. * errors-ring-bell: Info Variables. * ESC C-f, in Info windows: Other Info Commands. * ESC C-v, in Info windows: Basic Windows. * ESC C-v, in the Info echo area: The Echo Area. * f, in Info windows: Selecting Xrefs. * find-menu: Selecting Xrefs. * first-node: Node Commands. * footnotes, displaying: Other Info Commands. * forward-char: Cursor Commands. * forward-word: Cursor Commands. * functions, describing: Other Info Commands. * g, in Info windows: Node Commands. * gc-compressed-files: Info Variables. * get-help-window: Other Info Commands. * get-info-help-node: Other Info Commands. * global-next-node: Node Commands. * global-prev-node: Node Commands. * goto-node: Node Commands. * grow-window: Basic Windows. * h, in Info windows: Other Info Commands. * history-node: Node Commands. * i, in Info windows: Searching Commands. * index-search: Searching Commands. * INFO_PRINT_COMMAND, environment variable: Printing Nodes. * isearch-backward: Searching Commands. * isearch-forward: Searching Commands. * ISO Latin characters: Info Variables. * ISO-Latin: Info Variables. * keep-one-window: Basic Windows. * keys, describing: Other Info Commands. * kill-node: Node Commands. * l, in Info windows: Node Commands. * last-menu-item: Selecting Xrefs. * last-node: Node Commands. * list-visited-nodes: Node Commands. * m, in Info windows: Selecting Xrefs. * M-1 ... M-9, in Info windows: Other Info Commands. * M-<, in Info windows: Cursor Commands. * M->, in Info windows: Cursor Commands. * M-b, in Info windows: Cursor Commands. * M-b, in the Info echo area: The Echo Area. * M-d, in the Info echo area: The Echo Area. * M-DEL, in the Info echo area: The Echo Area. * M-f, in Info windows: Cursor Commands. * M-f, in the Info echo area: The Echo Area. * M-r, in Info windows: Cursor Commands. * M-TAB, in Info windows: Selecting Xrefs. * M-TAB, in the Info echo area: The Echo Area. * M-v, in Info windows: Scrolling Commands. * M-y, in the Info echo area: The Echo Area. * menu-digit: Selecting Xrefs. * menu-item: Selecting Xrefs. * move-to-next-xref: Selecting Xrefs. * move-to-prev-xref: Selecting Xrefs. * move-to-window-line: Cursor Commands. * n, in Info windows: Node Commands. * next-index-match: Searching Commands. * next-line: Cursor Commands. * next-node: Node Commands. * next-window: Basic Windows. * nodes, selection of in Info windows: Node Commands. * numeric arguments: Other Info Commands. * p, in Info windows: Node Commands. * prev-line: Cursor Commands. * prev-node: Node Commands. * prev-window: Basic Windows. * print-node: Printing Nodes. * printing: Printing Nodes. * printing characters, in the Info echo area: The Echo Area. * q, in Info windows: Other Info Commands. * quit: Other Info Commands. * quitting: Other Info Commands. * r, in Info windows: Selecting Xrefs. * redraw-display: Scrolling Commands. * RET, in Info windows: Selecting Xrefs. * RET, in the Info echo area: The Echo Area. * s, in Info windows: Searching Commands. * screen, changing the height of: Other Info Commands. * scroll-backward: Scrolling Commands. * scroll-behaviour: Info Variables. * scroll-forward: Scrolling Commands. * scroll-other-window: Basic Windows. * scroll-step: Info Variables. * scrolling through node structure: Scrolling Commands. * scrolling, in Info windows: Scrolling Commands. * search: Searching Commands. * searching: Searching Commands. * select-reference-this-line: Selecting Xrefs. * select-visited-node: Node Commands. * set-screen-height: Other Info Commands. * set-variable: Info Variables. * show-footnotes: Other Info Commands. * show-index-match: Info Variables. * SPC, in Info windows: Scrolling Commands. * SPC, in the Info echo area: The Echo Area. * split-window: Basic Windows. * t, in Info windows: Node Commands. * TAB, in Info windows: Selecting Xrefs. * TAB, in the Info echo area: The Echo Area. * tile-windows: Basic Windows. * tiling: Basic Windows. * toggle-wrap: Scrolling Commands. * top-node: Node Commands. * u, in Info windows: Node Commands. * universal-argument: Other Info Commands. * up-node: Node Commands. * variables, describing: Info Variables. * variables, setting: Info Variables. * view-file: Node Commands. * visible-bell: Info Variables. * where-is: Other Info Commands. * windows, creating: Basic Windows. * windows, deleting: Basic Windows. * windows, manipulating: Window Commands. * windows, selecting: Basic Windows. * xref-item: Selecting Xrefs. * [, in Info windows: Node Commands. * ], in Info windows: Node Commands. octave-1.1.0/doc/octave.info-2100666 415 17 141137 5705317773 14266 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Startup Files, Prev: Command Line Options, Up: Invoking Octave Startup Files ============= When Octave starts, it looks for commands to execute from the following files: `OCTAVE_HOME/lib/octave/VERSION/startup/octaverc' Where `OCTAVE_HOME' is the directory in which all of Octave is installed (the default is `/usr/local'), and `VERSION' is the version number of Octave. This file is provided so that changes to the default Octave environment can be made globally for all users. Some care should be taken when making changes to this file, since all users of Octave at your site will be affected. `~/.octaverc' This file is normally used to make personal changes to the default Octave environment. `.octaverc' This file can be used to make changes to the default Octave environment for a particular project. Octave searches for this file after it reads `~/.octaverc', so any use of the `cd' command in the `~/.octaverc' file will affect the directory that Octave searches for the file `.octaverc'. If you start Octave in your home directory, it will avoid executing commands from `~/.octaverc' twice. A message will be displayed as each of these files is read if you invoke Octave with the `--verbose' option but without the `--silent' option. Startup files may contain any valid Octave commands, including multiple function definitions.  File: octave.info, Node: Expressions, Next: Statements, Prev: Invoking Octave, Up: Top Expressions *********** Expressions are the basic building block of statements in Octave. An expression evaluates to a value, which you can print, test, store in a variable, pass to a function, or assign a new value to a variable with an assignment operator. An expression can serve as a statement on its own. Most other kinds of statements contain one or more expressions which specify data to be operated on. As in other languages, expressions in Octave include variables, array references, constants, and function calls, as well as combinations of these with various operators. * Menu: * Constant Expressions:: * Matrices:: * Ranges:: * Variables:: * Index Expressions:: * Data Structures:: * Calling Functions:: * Global Variables:: * Keywords:: * Arithmetic Ops:: * Comparison Ops:: * Boolean Expressions:: * Assignment Ops:: * Increment Ops:: * Operator Precedence::  File: octave.info, Node: Constant Expressions, Next: Matrices, Prev: Expressions, Up: Expressions Constant Expressions ==================== The simplest type of expression is the "constant", which always has the same value. There are two types of constants: numeric constants and string constants. * Menu: * Numeric Constants:: * String Constants::  File: octave.info, Node: Numeric Constants, Next: String Constants, Prev: Constant Expressions, Up: Constant Expressions Numeric Constants ----------------- A "numeric constant" may be a scalar, a vector, or a matrix, and it may contain complex values. The simplest form of a numeric constant, a scalar, is a single number that can be an integer, a decimal fraction, a number in scientific (exponential) notation, or a complex number. Note that all numeric values are represented within Octave in double-precision floating point format (complex constants are stored as pairs of double-precision floating point values). Here are some examples of real-valued numeric constants, which all have the same value: 105 1.05e+2 1050e-1 To specify complex constants, you can write an expression of the form 3 + 4i 3.0 + 4.0i 0.3e1 + 40e-1i all of which are equivalent. The letter `i' in the previous example stands for the pure imaginary constant, defined as `sqrt (-1)'. For Octave to recognize a value as the imaginary part of a complex constant, a space must not appear between the number and the `i'. If it does, Octave will print an error message, like this: octave:13> 3 + 4 i parse error: 3 + 4 i ^ You may also use `j', `I', or `J' in place of the `i' above. All four forms are equivalent.  File: octave.info, Node: String Constants, Prev: Numeric Constants, Up: Constant Expressions String Constants ---------------- A "string constant" consists of a sequence of characters enclosed in either double-quote or single-quote marks. For example, both of the following expressions "parrot" 'parrot' represent the string whose contents are `parrot'. Strings in Octave can be of any length. Since the single-quote mark is also used for the transpose operator (*note Arithmetic Ops::.) but double-quote marks have no other purpose in Octave, it is best to use double-quote marks to denote strings. Some characters cannot be included literally in a string constant. You represent them instead with "escape sequences", which are character sequences beginning with a backslash (`\'). One use of an escape sequence is to include a double-quote (single-quote) character in a string constant that has been defined using double-quote (single-quote) marks. Since a plain double-quote would end the string, you must use `\"' to represent a single double-quote character as a part of the string. The backslash character itself is another character that cannot be included normally. You must write `\\' to put one backslash in the string. Thus, the string whose contents are the two characters `"\' must be written `"\"\\"'. Another use of backslash is to represent unprintable characters such as newline. While there is nothing to stop you from writing most of these characters directly in a string constant, they may look ugly. Here is a table of all the escape sequences used in Octave. They are the same as those used in the C programming langauge. `\\' Represents a literal backslash, `\'. `\"' Represents a literal double-quote character, `"'. `\'' Represents a literal single-quote character, `''. `\a' Represents the "alert" character, control-g, ASCII code 7. `\b' Represents a backspace, control-h, ASCII code 8. `\f' Represents a formfeed, control-l, ASCII code 12. `\n' Represents a newline, control-j, ASCII code 10. `\r' Represents a carriage return, control-m, ASCII code 13. `\t' Represents a horizontal tab, control-i, ASCII code 9. `\v' Represents a vertical tab, control-k, ASCII code 11. Strings may be concatenated using the notation for defining matrices. For example, the expression [ "foo" , "bar" , "baz" ] produces the string whose contents are `foobarbaz'. The next section explains more about how to create matrices.  File: octave.info, Node: Matrices, Next: Ranges, Prev: Constant Expressions, Up: Expressions Matrices ======== It is easy to define a matrix of values in Octave. The size of the matrix is determined automatically, so it is not necessary to explicitly state the dimensions. The expression a = [1, 2; 3, 4] results in the matrix a = 1 2 3 4 The commas which separate the elements on a row may be omitted, and the semicolon that marks the beginning of a new row may be replaced by one or more new lines. The expression a = [ 1 2 3 4 ] is equivalent to the one above. Elements of a matrix may be arbitrary expressions, provided that the dimensions all agree. For example, given the above matrix, the expression [ a, a ] produces the matrix ans = 1 2 1 2 3 4 3 4 but the expression [ a 1 ] produces the error error: number of rows must match Inside the square brackets that delimit a matrix expression, Octave looks at the surrounding context to determine whether spaces should be converted into element separators, or simply ignored, so commands like [ linspace (1, 2) ] will work. However, some possible sources of confusion remain. For example, in the expression [ 1 - 1 ] the `-' is treated as a binary operator and the result is the scalar 0, but in the expression [ 1 -1 ] the `-' is treated as a unary operator and the result is the vector `[ 1 -1 ]'. Given `a = 1', the expression [ 1 a' ] results in the single quote character `'' being treated as a transpose operator and the result is the vector `[ 1 1 ]', but the expression [ 1 a ' ] produces the error message error: unterminated string constant because to not do so would make it impossible to correctly parse the valid expression [ a 'foo' ] For clarity, it is probably best to always use commas and semicolons to separate matrix elements and rows. It is possible to enforce this style by setting the built-in variable `whitespace_in_literal_matrix' to `"ignore"'. *Note Built-in Variables::. * Menu: * Empty Matrices::  File: octave.info, Node: Empty Matrices, Prev: Matrices, Up: Matrices Empty Matrices -------------- A matrix may have one or both dimensions zero, and operations on empty matrices are handled as described by Carl de Boor in `An Empty Exercise', SIGNUM, Volume 25, pages 2-6, 1990 and C. N. Nett and W. M. Haddad, in `A System-Theoretic Appropriate Realization of the Empty Matrix Concept', IEEE Transactions on Automatic Control, Volume 38, Number 5, May 1993. Briefly, given a scalar `s', and an M by N matrix `M(mxn)', and an M by N empty matrix `[](mxn)' (with either one or both dimensions equal to zero), the following are true: s * [](mxn) = [](mxn) * s = [](mxn) [](mxn) + [](mxn) = [](mxn) [](0xm) * M(mxn) = [](0xn) M(mxn) * [](nx0) = [](mx0) [](mx0) * [](0xn) = 0(mxn) By default, dimensions of the empty matrix are now printed along with the empty matrix symbol, `[]'. For example: octave:13> zeros (3, 0) ans = [](3x0) The built-in variable `print_empty_dimensions' controls this behavior (*note User Preferences::.). Empty matrices may also be used in assignment statements as a convenient way to delete rows or columns of matrices. *Note Assignment Expressions: Assignment Ops.  File: octave.info, Node: Ranges, Next: Variables, Prev: Matrices, Up: Expressions Ranges ====== A "range" is a convenient way to write a row vector with evenly spaced elements. A range constant is defined by the value of the first element in the range, an optional value for the increment between elements, and a maximum value which the elements of the range will not exceed. The base, increment, and limit are separated by colons (the `:' character) and may contain any arithmetic expressions and function calls. If the increment is omitted, it is assumed to be 1. For example, the range 1 : 5 defines the set of values `[ 1 2 3 4 5 ]' (the increment has been omitted, so it is taken as 1), and the range 1 : 3 : 5 defines the set of values `[ 1 4 ]'. In this case, the base value is 1, the increment is 3, and the limit is 5. Although a range constant specifies a row vector, Octave does *not* convert range constants to vectors unless it is necessary to do so. This allows you to write a constant like `1 : 10000' without using up 80,000 bytes of storage on a typical 32-bit workstation. Note that the upper (or lower, if the increment is negative) bound on the range is not always included in the set of values, and that ranges defined by floating point values can produce surprising results because Octave uses floating point arithmetic to compute the values in the range. If it is important to include the endpoints of a range and the number of elements is known, you should use the `linspace' function instead (*note Special Matrices::.).  File: octave.info, Node: Variables, Next: Index Expressions, Prev: Ranges, Up: Expressions Variables ========= Variables let you give names to values and refer to them later. You have already seen variables in many of the examples. The name of a variable must be a sequence of letters, digits and underscores, but it may not begin with a digit. Octave does not enforce a limit on the length of variable names, but it is seldom useful to have variables with names longer than about 30 characters. The following are all valid variable names x x15 __foo_bar_baz__ fucnrdthsucngtagdjb Case is significant in variable names. The symbols `a' and `A' are distinct variables. A variable name is a valid expression by itself. It represents the variable's current value. Variables are given new values with "assignment operators" and "increment operators". *Note Assignment Expressions: Assignment Ops. A number of variables have special built-in meanings. For example, `PWD' holds the current working directory, and `pi' names the ratio of the circumference of a circle to its diameter. *Note Built-in Variables::, for a list of all the predefined variables. Some of these built-in symbols are constants and may not be changed. Others can be used and assigned just like all other variables, but their values are also used or changed automatically by Octave. Variables in Octave can be assigned either numeric or string values. Variables may not be used before they have been given a value. Doing so results in an error.  File: octave.info, Node: Index Expressions, Next: Data Structures, Prev: Variables, Up: Expressions Index Expressions ================= An "index expression" allows you to reference or extract selected elements of a matrix or vector. Indices may be scalars, vectors, ranges, or the special operator `:', which may be used to select entire rows or columns. Vectors are indexed using a single expression. Matrices require two indices unless the value of the built-in variable `do_fortran_indexing' is `"true"', in which case a matrix may also be indexed by a single expression (*note User Preferences::.). Given the matrix a = [1, 2; 3, 4] all of the following expressions are equivalent a (1, [1, 2]) a (1, 1:2) a (1, :) and select the first row of the matrix. A special form of indexing may be used to select elements of a matrix or vector. If the indices are vectors made up of only ones and zeros, the result is a new matrix whose elements correspond to the elements of the index vector that are equal to one. For example, a = [1, 2; 3, 4]; a ([1, 0], :) selects the first row of the matrix `a'. This operation can be useful for selecting elements of a matrix based on some condition, since the comparison operators return matrices of ones and zeros. Unfortunately, this special zero-one form of indexing leads to a conflict with the standard indexing operation. For example, should the following statements a = [1, 2; 3, 4]; a ([1, 1], :) return the original matrix, or the matrix formed by selecting the first row twice? Although this conflict is not likely to arise very often in practice, you may select the behavior you prefer by setting the built-in variable `prefer_zero_one_indexing' (*note User Preferences::.). Finally, indexing a scalar with a vector of ones can be used to create a vector the same size as the the index vector, with each element equal to the value of the original scalar. For example, the following statements a = 13; a ([1, 1, 1, 1]) produce a vector whose four elements are all equal to 13. Similarly, indexing a scalar with two vectors of ones can be used to create a matrix. For example the following statements a = 13; a ([1, 1], [1, 1, 1]) create a 2 by 3 matrix with all elements equal to 13. This is an obscure notation and should be avoided. It is better to use the function `ones' to generate a matrix of the appropriate size whose elements are all one, and then to scale it to produce the desired result. *Note Special Matrices::.  File: octave.info, Node: Data Structures, Next: Calling Functions, Prev: Index Expressions, Up: Expressions Data Structures =============== Octave includes a limited amount of support for organizing data in structures. The current implementation uses an associative array with indices limited to strings, but the syntax is more like C-style structures. Here are some examples of using data structures in Octave. Elements of structures can be of any value type. octave:1> x.a = 1; x.b = [1, 2; 3, 4]; x.c = "string"; octave:2> x.a x.a = 1 octave:3> x.b x.b = 1 2 3 4 octave:4> x.c x.c = string Structures may be copied. octave:1> y = x y = Note that when the value of a structure is printed, Octave only displays the names of the elements. This prevents long and confusing output from large deeply nested structures, but makes it more difficult to view the values of simple structures, so this behavior may change in a future version of Octave. Since structures are themselves values, structure elements may reference other structures. The following statements change the value of the element `b' of the structure `x' to be a data structure containing the single element `d', which has a value of 3. octave:1> x.b.d = 3 x.b.d = 3 octave:2> x.b x.b = octave:3> x.b.d x.b.d = 3 Functions can return structures. For example, the following function separates the real and complex parts of a matrix and stores them in two elements of the same structure variable. octave:1> function y = f (x) > y.re = real (x); > y.im = imag (x); > endfunction When called with a complex-valued argument, `f' returns the data structure containing the real and imaginary parts of the original function argument. octave:1> f (rand (3) + rand (3) * I); ans = octave:3> ans.im ans.im = 0.093411 0.229690 0.627585 0.415128 0.221706 0.850341 0.894990 0.343265 0.384018 octave:4> ans.re ans.re = 0.56234 0.14797 0.26416 0.72120 0.62691 0.20910 0.89211 0.25175 0.21081 Function return lists can include structure elements, and they may be indexed like any other variable. octave:1> [x.u, x.s(2:3,2:3), x.v] = svd ([1, 2; 3, 4]) x.u = -0.40455 -0.91451 -0.91451 0.40455 x.s = 0.00000 0.00000 0.00000 0.00000 5.46499 0.00000 0.00000 0.00000 0.36597 x.v = -0.57605 0.81742 -0.81742 -0.57605 octave:8> x x = You can also use the function `is_struct' to determine whether a given value is a data structure. For example is_struct (x) returns 1 if the value of the variable X is a data structure. This feature should be considered experimental, but you should expect it to work. Suggestions for ways to improve it are welcome.  File: octave.info, Node: Calling Functions, Next: Global Variables, Prev: Data Structures, Up: Expressions Calling Functions ================= A "function" is a name for a particular calculation. Because it has a name, you can ask for it by name at any point in the program. For example, the function `sqrt' computes the square root of a number. A fixed set of functions are "built-in", which means they are available in every Octave program. The `sqrt' function is one of these. In addition, you can define your own functions. *Note Functions and Scripts::, for information about how to do this. The way to use a function is with a "function call" expression, which consists of the function name followed by a list of "arguments" in parentheses. The arguments are expressions which give the raw materials for the calculation that the function will do. When there is more than one argument, they are separated by commas. If there are no arguments, you can omit the parentheses, but it is a good idea to include them anyway, to clearly indicate that a function call was intended. Here are some examples: sqrt (x^2 + y^2) # One argument ones (n, m) # Two arguments rand () # No arguments Each function expects a particular number of arguments. For example, the `sqrt' function must be called with a single argument, the number to take the square root of: sqrt (ARGUMENT) Some of the built-in functions take a variable number of arguments, depending on the particular usage, and their behavior is different depending on the number of arguments supplied. Like every other expression, the function call has a value, which is computed by the function based on the arguments you give it. In this example, the value of `sqrt (ARGUMENT)' is the square root of the argument. A function can also have side effects, such as assigning the values of certain variables or doing input or output operations. Unlike most languages, functions in Octave may return multiple values. For example, the following statement [u, s, v] = svd (a) computes the singular value decomposition of the matrix `a' and assigns the three result matrices to `u', `s', and `v'. The left side of a multiple assignment expression is itself a list of expressions, and is allowed to be a list of variable names or index expressions. See also *Note Index Expressions::, and *Note Assignment Ops::. * Menu: * Call by Value:: * Recursion::  File: octave.info, Node: Call by Value, Next: Recursion, Prev: Calling Functions, Up: Calling Functions Call by Value ------------- In Octave, unlike Fortran, function arguments are passed by value, which means that each argument in a function call is evaluated and assigned to a temporary location in memory before being passed to the function. There is currently no way to specify that a function parameter should be passed by reference instead of by value. This means that it is impossible to directly alter the value of function parameter in the calling function. It can only change the local copy within the function body. For example, the function function f (x, n) while (n-- > 0) disp (x); endwhile endfunction displays the value of the first argument N times. In this function, the variable N is used as a temporary variable without having to worry that its value might also change in the calling function. Call by value is also useful because it is always possible to pass constants for any function parameter without first having to determine that the function will not attempt to modify the parameter. The caller may use a variable as the expression for the argument, but the called function does not know this: it only knows what value the argument had. For example, given a function called as foo = "bar"; fcn (foo) you should not think of the argument as being "the variable `foo'." Instead, think of the argument as the string value, `"bar"'.  File: octave.info, Node: Recursion, Prev: Call by Value, Up: Calling Functions Recursion --------- Recursive function calls are allowed. A "recursive function" is one which calls itself, either directly or indirectly. For example, here is an inefficient(1) way to compute the factorial of a given integer: function retval = fact (n) if (n > 0) retval = n * fact (n-1); else retval = 1; endif endfunction This function is recursive because it calls itself directly. It eventually terminates because each time it calls itself, it uses an argument that is one less than was used for the previous call. Once the argument is no longer greater than zero, it does not call itself, and the recursion ends. There is currently no limit on the recursion depth, so infinite recursion is possible. If this happens, Octave will consume more and more memory attempting to store intermediate values for each function call context until there are no more resources available. This is obviously undesirable, and will probably be fixed in some future version of Octave by allowing users to specify a maximum allowable recursion depth. ---------- Footnotes ---------- (1) It would be much better to use `prod (1:n)', or `gamma (n+1)' instead, after first checking to ensure that the value `n' is actually a positive integer.  File: octave.info, Node: Global Variables, Next: Keywords, Prev: Calling Functions, Up: Expressions Global Variables ================ A variable that has been declared "global" may be accessed from within a function body without having to pass it as a formal parameter. A variable may be declared global using a `global' declaration statement. The following statements are all global declarations. global a global b = 2 global c = 3, d, e = 5 It is necessary declare a variable as global within a function body in order to access it. For example, global x function f () x = 1; endfunction f () does *not* set the value of the global variable `x' to 1. In order to change the value of the global variable `x', you must also declare it to be global within the function body, like this function f () global x; x = 1; endfunction Passing a global variable in a function parameter list will make a local copy and not modify the global value. For example: octave:1> function f (x) > x = 3 > endfunction octave:2> global x = 0 octave:3> x # This is the value of the global variable. x = 0 octave:4> f (x) x = 3 # The value of the local variable x is 3. octave:5> x # But it was a *copy* so the global variable x = 0 # remains unchanged.  File: octave.info, Node: Keywords, Next: Arithmetic Ops, Prev: Global Variables, Up: Expressions Keywords ======== The following identifiers are keywords, and may not be used as variable or function names: break endfor function return continue endfunction global while else endif gplot elseif endwhile gsplot end for if The following command-like functions are also keywords, and may not be used as variable or function names: casesen document history set cd edit_history load show clear help ls who dir format run_history save  File: octave.info, Node: Arithmetic Ops, Next: Comparison Ops, Prev: Keywords, Up: Expressions Arithmetic Operators ==================== The following arithmetic operators are available, and work on scalars and matrices. `X + Y' Addition. If both operands are matrices, the number of rows and columns must both agree. If one operand is a scalar, its value is added to all the elements of the other operand. `X .+ Y' Element by element addition. This operator is equivalent to `+'. `X - Y' Subtraction. If both operands are matrices, the number of rows and columns of both must agree. `X .- Y' Element by element subtraction. This operator is equivalent to `-'. `X * Y' Matrix multiplication. The number of columns of `x' must agree with the number of rows of `y'. `X .* Y' Element by element multiplication. If both operands are matrices, the number of rows and columns must both agree. `X / Y' Right division. This is conceptually equivalent to the expression (inverse (y') * x')' but it is computed without forming the inverse of `y''. If the system is not square, or if the coefficient matrix is singular, a minimum norm solution is computed. `X ./ Y' Element by element right division. `X \ Y' Left division. This is conceptually equivalent to the expression inverse (x) * y but it is computed without forming the inverse of `x'. If the system is not square, or if the coefficient matrix is singular, a minimum norm solution is computed. `X .\ Y' Element by element left division. Each element of `y' is divided by each corresponding element of `x'. `X ^ Y' `X ** Y' Power operator. If X and Y are both scalars, this operator returns X raised to the power Y. If X is a scalar and Y is a square matrix, the result is computed using an eigenvalue expansion. If X is a square matrix. the result is computed by repeated multiplication if Y is an integer, and by an eigenvalue expansion if Y is not an integer. An error results if both X and Y are matrices. The implementation of this operator needs to be improved. `X .^ Y' `X .** Y' Element by element power operator. If both operands are matrices, the number of rows and columns must both agree. `-X' Negation. `+X' Unary plus. This operator has no effect on the operand. `X'' Complex conjugate transpose. For real arguments, this operator is the same as the transpose operator. For complex arguments, this operator is equivalent to the expression conj (x.') `X.'' Transpose. Note that because Octave's element by element operators begin with a `.', there is a possible ambiguity for statements like 1./m because the period could be interpreted either as part of the constant or as part of the operator. To resolve this conflict, Octave treats the expression as if you had typed (1) ./ m and not (1.) / m Although this is inconsistent with the normal behavior of Octave's lexer, which usually prefers to break the input into tokens by preferring the longest possible match at any given point, it is more useful in this case.  File: octave.info, Node: Comparison Ops, Next: Boolean Expressions, Prev: Arithmetic Ops, Up: Expressions Comparison Operators ==================== "Comparison operators" compare numeric values for relationships such as equality. They are written using *relational operators*, which are a superset of those in C. All of Octave's comparison operators return a value of 1 if the comparison is true, or 0 if it is false. For matrix values, they all work on an element-by-element basis. For example, evaluating the expression [1, 2; 3, 4] == [1, 3; 2, 4] returns the result ans = 1 0 0 1 `X < Y' True if X is less than Y. `X <= Y' True if X is less than or equal to Y. `X == Y' True if X is equal to Y. `X >= Y' True if X is greater than or equal to Y. `X > Y' True if X is greater than Y. `X != Y' `X ~= Y' `X <> Y' True if X is not equal to Y. For matrix and vector arguments, the above table should be read as "an element of the result matrix (vector) is true if the corresponding elements of the argument matrices (vectors) satisfy the specified condition" String comparisons should be performed with the `strcmp' function, not with the comparison operators listed above. *Note Calling Functions::.  File: octave.info, Node: Boolean Expressions, Next: Assignment Ops, Prev: Comparison Ops, Up: Expressions Boolean Expressions =================== * Menu: * Element-by-element Boolean Operators:: * Short-circuit Boolean Operators::  File: octave.info, Node: Element-by-element Boolean Operators, Next: Short-circuit Boolean Operators, Prev: Boolean Expressions, Up: Boolean Expressions Element-by-element Boolean Operators ------------------------------------ An element-by-element "boolean expression" is a combination of comparison expressions or matching expressions, using the boolean operators "or" (`|'), "and" (`&'), and "not" (`!'), along with parentheses to control nesting. The truth of the boolean expression is computed by combining the truth values of the corresponding elements of the component expressions. A value is considered to be false if it is zero, and true otherwise. Element-by-element boolean expressions can be used wherever comparison expressions can be used. They can be used in `if' and `while' statements. However, before being used in the condition of an `if' or `while' statement, an implicit conversion from a matrix value to a scalar value occurs using the equivalent of `all (all (X))'. That is, a value used as the condition in an `if' or `while' statement is only true if *all* of its elements are nonzero. Like comparison operations, each element of an element-by-element boolean expression also has a numeric value (1 if true, 0 if false) that comes into play if the result of the boolean expression is stored in a variable, or used in arithmetic. Here are descriptions of the three element-by-element boolean operators. `BOOLEAN1 & BOOLEAN2' Elements of the result are true if both corresponding elements of BOOLEAN1 and BOOLEAN2 are true. `BOOLEAN1 | BOOLEAN2' Elements of the result are true if either of the corresponding elements of BOOLEAN1 or BOOLEAN2 is true. `! BOOLEAN' `~ BOOLEAN' Each element of the result is true if the corresponding element of BOOLEAN is false. For matrix operands, these operators work on an element-by-element basis. For example, the expression [1, 0; 0, 1] & [1, 0; 2, 3] returns a two by two identity matrix. For the binary operators, the dimensions of the operands must conform if both are matrices. If one of the operands is a scalar and the other a matrix, the operator is applied to the scalar and each element of the matrix. For the binary element-by-element boolean operators, both subexpressions BOOLEAN1 and BOOLEAN2 are evaluated before computing the result. This can make a difference when the expressions have side effects. For example, in the expression a & b++ the value of the variable B is incremented even if the variable A is zero. This behavior is necessary for the boolean operators to work as described for matrix-valued operands.  File: octave.info, Node: Short-circuit Boolean Operators, Prev: Element-by-element Boolean Operators, Up: Boolean Expressions Short-circuit Boolean Operators ------------------------------- Combined with the implicit conversion to scalar values in `if' and `while' conditions, Octave's element-by-element boolean operators are often sufficient for performing most logical operations. However, it is sometimes desirable to stop evaluating a boolean expression as soon as the overall truth value can be determined. Octave's "short-circuit" boolean operators work this way. `BOOLEAN1 && BOOLEAN2' The expression BOOLEAN1 is evaluated and converted to a scalar using the equivalent of the operation `all (all (BOOLEAN1))'. If it is false, the result of the expression is 0. If it is true, the expression BOOLEAN2 is evaluated and converted to a scalar using the equivalent of the operation `all (all (BOOLEAN1))'. If it is true, the result of the expression is 1. Otherwise, the result of the expression is 0. `BOOLEAN1 || BOOLEAN2' The expression BOOLEAN1 is evaluated and converted to a scalar using the equivalent of the operation `all (all (BOOLEAN1))'. If it is true, the result of the expression is 1. If it is false, the expression BOOLEAN2 is evaluated and converted to a scalar using the equivalent of the operation `all (all (BOOLEAN1))'. If it is true, the result of the expression is 1. Otherwise, the result of the expression is 0. The fact that both operands may not be evaluated before determining the overall truth value of the expression can be important. For example, in the expression a && b++ the value of the variable B is only incremented if the variable A is nonzero. This can be used to write somewhat more concise code. For example, it is possible write function f (a, b, c) if (nargin > 2 && isstr (c)) ... instead of having to use two `if' statements to avoid attempting to evaluate an argument that doesn't exist. function f (a, b, c) if (nargin > 2) if (isstr (c)) ...  File: octave.info, Node: Assignment Ops, Next: Increment Ops, Prev: Boolean Expressions, Up: Expressions Assignment Expressions ====================== An "assignment" is an expression that stores a new value into a variable. For example, the following expression assigns the value 1 to the variable `z': z = 1 After this expression is executed, the variable `z' has the value 1. Whatever old value `z' had before the assignment is forgotten. Assignments can store string values also. For example, the following expression would store the value `"this food is good"' in the variable `message': thing = "food" predicate = "good" message = [ "this " , thing , " is " , predicate ] (This also illustrates concatenation of strings.) The `=' sign is called an "assignment operator". It is the simplest assignment operator because the value of the right-hand operand is stored unchanged. Most operators (addition, concatenation, and so on) have no effect except to compute a value. If you ignore the value, you might as well not use the operator. An assignment operator is different. It does produce a value, but even if you ignore the value, the assignment still makes itself felt through the alteration of the variable. We call this a "side effect". The left-hand operand of an assignment need not be a variable (*note Variables::.). It can also be an element of a matrix (*note Index Expressions::.) or a list of return values (*note Calling Functions::.). These are all called "lvalues", which means they can appear on the left-hand side of an assignment operator. The right-hand operand may be any expression. It produces the new value which the assignment stores in the specified variable, matrix element, or list of return values. It is important to note that variables do *not* have permanent types. The type of a variable is simply the type of whatever value it happens to hold at the moment. In the following program fragment, the variable `foo' has a numeric value at first, and a string value later on: octave:13> foo = 1 foo = 1 octave:13> foo = "bar" foo = bar When the second assignment gives `foo' a string value, the fact that it previously had a numeric value is forgotten. Assigning an empty matrix `[]' works in most cases to allow you to delete rows or columns of matrices and vectors. *Note Empty Matrices::. For example, given a 4 by 5 matrix A, the assignment A (3, :) = [] deletes the third row of A, and the assignment A (:, 1:2:5) = [] deletes the first, third, and fifth columns. An assignment is an expression, so it has a value. Thus, `z = 1' as an expression has the value 1. One consequence of this is that you can write multiple assignments together: x = y = z = 0 stores the value 0 in all three variables. It does this because the value of `z = 0', which is 0, is stored into `y', and then the value of `y = z = 0', which is 0, is stored into `x'. This is also true of assignments to lists of values, so the following is a valid expression [a, b, c] = [u, s, v] = svd (a) that is exactly equivalent to [u, s, v] = svd (a) a = u b = s c = v In expressions like this, the number of values in each part of the expression need not match. For example, the expression [a, b, c, d] = [u, s, v] = svd (a) is equivalent to the expression above, except that the value of the variable `d' is left unchanged, and the expression [a, b] = [u, s, v] = svd (a) is equivalent to [u, s, v] = svd (a) a = u b = s You can use an assignment anywhere an expression is called for. For example, it is valid to write `x != (y = 1)' to set `y' to 1 and then test whether `x' equals 1. But this style tends to make programs hard to read. Except in a one-shot program, you should rewrite it to get rid of such nesting of assignments. This is never very hard.  File: octave.info, Node: Increment Ops, Next: Operator Precedence, Prev: Assignment Ops, Up: Expressions Increment Operators =================== *Increment operators* increase or decrease the value of a variable by 1. The operator to increment a variable is written as `++'. It may be used to increment a variable either before or after taking its value. For example, to pre-increment the variable X, you would write `++X'. This would add one to X and then return the new value of X as the result of the expression. It is exactly the same as the expression `X = X + 1'. To post-increment a variable X, you would write `X++'. This adds one to the variable X, but returns the value that X had prior to incrementing it. For example, if X is equal to 2, the result of the expression `X++' is 2, and the new value of X is 3. For matrix and vector arguments, the increment and decrement operators work on each element of the operand. Here is a list of all the increment and decrement expressions. `++X' This expression increments the variable X. The value of the expression is the *new* value of X. It is equivalent to the expression `X = X + 1'. `--X' This expression decrements the variable X. The value of the expression is the *new* value of X. It is equivalent to the expression `X = X - 1'. `X++' This expression causes the variable X to be incremented. The value of the expression is the *old* value of X. `X--' This expression causes the variable X to be decremented. The value of the expression is the *old* value of X. It is not currently possible to increment index expressions. For example, you might expect that the expression `V(4)++' would increment the fourth element of the vector V, but instead it results in a parse error. This problem may be fixed in a future release of Octave.  File: octave.info, Node: Operator Precedence, Prev: Increment Ops, Up: Expressions Operator Precedence =================== "Operator precedence" determines how operators are grouped, when different operators appear close by in one expression. For example, `*' has higher precedence than `+'. Thus, the expression `a + b * c' means to multiply `b' and `c', and then add `a' to the product (i.e., `a + (b * c)'). You can overrule the precedence of the operators by using parentheses. You can think of the precedence rules as saying where the parentheses are assumed if you do not write parentheses yourself. In fact, it is wise to use parentheses whenever you have an unusual combination of operators, because other people who read the program may not remember what the precedence is in this case. You might forget as well, and then you too could make a mistake. Explicit parentheses will help prevent any such mistake. When operators of equal precedence are used together, the leftmost operator groups first, except for the assignment, and exponentiation operators, which group in the opposite order. Thus, the expression `a - b + c' groups as `(a - b) + c', but the expression `a = b = c' groups as `a = (b = c)'. The precedence of prefix unary operators is important when another operator follows the operand. For example, `-x^2' means `-(x^2)', because `-' has lower precedence than `^'. Here is a table of the operators in Octave, in order of increasing precedence. `statement separators' `;', `,'. `assignment' `='. This operator groups right to left. `logical "or" and "and"' `||', `&&'. `element-wise "or" and "and"' `|', `&'. `relational' `<', `<=', `==', `>=', `>', `!=', `~=', `<>'. `colon' `:'. `add, subtract' `+', `-'. `multiply, divide' `*', `/', `\', `.\', `.*', `./'. `transpose' `'', `.'' `unary plus, minus, increment, decrement, and ``not''' `+', `-', `++', `--', `!', `~'. `exponentiation' `^', `**', `.^', `.**'.  File: octave.info, Node: Statements, Next: Functions and Scripts, Prev: Expressions, Up: Top Statements ********** "Control statements" such as `if', `while', and so on control the flow of execution in Octave programs. All the control statements start with special keywords such as `if' and `while', to distinguish them from simple expressions. Many control statements contain other statements; for example, the `if' statement contains another statement which may or may not be executed. Each control statement has a corresponding "end" statement that marks the end of the end of the control statement. For example, the keyword `endif' marks the end of an `if' statement, and `endwhile' marks the end of a `while' statement. You can use the keyword `end' anywhere a more specific end keyword is expected, but using the more specific keywords is preferred because if you use them, Octave is able to provide better diagnostics for mismatched or missing end tokens. The list of statements contained between keywords like `if' or `while' and the corresponding end statement is called the "body" of a control statement. * Menu: * The if Statement:: * The while Statement:: * The for Statement:: * The break Statement:: * The continue Statement:: * The unwind_protect Statement::  File: octave.info, Node: The if Statement, Next: The while Statement, Prev: Statements, Up: Statements The `if' Statement ================== The `if' statement is Octave's decision-making statement. There are three basic forms of an `if' statement. In its simplest form, it looks like this: if (CONDITION) THEN-BODY endif CONDITION is an expression that controls what the rest of the statement will do. The THEN-BODY is executed only if CONDITION is true. The condition in an `if' statement is considered true if its value is non-zero, and false if its value is zero. If the value of the conditional expression in an `if' statement is a vector or a matrix, it is considered true only if *all* of the elements are non-zero. The second form of an if statement looks like this: if (CONDITION) THEN-BODY else ELSE-BODY endif If CONDITION is true, THEN-BODY is executed; otherwise, ELSE-BODY is executed. Here is an example: if (rem (x, 2) == 0) printf ("x is even\n"); else printf ("x is odd\n"); endif In this example, if the expression `rem (x, 2) == 0' is true (that is, the value of `x' is divisible by 2), then the first `printf' statement is evaluated, otherwise the second `printf' statement is evaluated. The third and most general form of the `if' statement allows multiple decisions to be combined in a single statement. It looks like this: if (CONDITION) THEN-BODY elseif (CONDITION) ELSEIF-BODY else ELSE-BODY endif Any number of `elseif' clauses may appear. Each condition is tested in turn, and if one is found to be true, its corresponding BODY is executed. If none of the conditions are true and the `else' clause is present, its body is executed. Only one `else' clause may appear, and it must be the last part of the satement. In the following example, if the first condition is true (that is, the value of `x' is divisible by 2), then the first `printf' statement is executed. If it is false, then the second condition is tested, and if it is true (that is, the value of `x' is divisible by 3), then the second `printf' statement is executed. Otherwise, the third `printf' statement is performed. if (rem (x, 2) == 0) printf ("x is even\n"); elseif (rem (x, 3) == 0) printf ("x is odd and divisible by 3\n"); else printf ("x is odd\n"); endif Note that the `elseif' keyword must not be spelled `else if', as is allowed in Fortran. If it is, the space between the `else' and `if' will tell Octave to treat this as a new `if' statement within another `if' statement's `else' clause. For example, if you write if (C1) BODY-1 else if (C2) BODY-2 endif Octave will expect additional input to complete the first `if' statement. If you are using Octave interactively, it will continue to prompt you for additional input. If Octave is reading this input from a file, it may complain about missing or mismatched `end' statements, or, if you have not used the more specific `end' statements (`endif', `endfor', etc.), it may simply produce incorrect results, without producing any warning messages. It is much easier to see the error if we rewrite the statements above like this, if (C1) BODY-1 else if (C2) BODY-2 endif using the indentation to show how Octave groups the statements. *Note Functions and Scripts::. octave-1.1.0/doc/octave.info-3100666 415 17 104577 5705317773 14276 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: The while Statement, Next: The for Statement, Prev: The if Statement, Up: Statements The `while' Statement ===================== In programming, a "loop" means a part of a program that is (or at least can be) executed two or more times in succession. The `while' statement is the simplest looping statement in Octave. It repeatedly executes a statement as long as a condition is true. As with the condition in an `if' statement, the condition in a `while' statement is considered true if its value is non-zero, and false if its value is zero. If the value of the conditional expression in an `if' statement is a vector or a matrix, it is considered true only if *all* of the elements are non-zero. Octave's `while' statement looks like this: while (CONDITION) BODY endwhile Here BODY is a statement or list of statements that we call the "body" of the loop, and CONDITION is an expression that controls how long the loop keeps running. The first thing the `while' statement does is test CONDITION. If CONDITION is true, it executes the statement BODY. After BODY has been executed, CONDITION is tested again, and if it is still true, BODY is executed again. This process repeats until CONDITION is no longer true. If CONDITION is initially false, the body of the loop is never executed. This example creates a variable `fib' that contains the elements of the Fibonacci sequence. fib = ones (1, 10); i = 3; while (i <= 10) fib (i) = fib (i-1) + fib (i-2); i++; endwhile Here the body of the loop contains two statements. The loop works like this: first, the value of `i' is set to 3. Then, the `while' tests whether `i' is less than or equal to 10. This is the case when `i' equals 3, so the value of the `i'-th element of `fib' is set to the sum of the previous two values in the sequence. Then the `i++' increments the value of `i' and the loop repeats. The loop terminates when `i' reaches 11. A newline is not required between the condition and the body; but using one makes the program clearer unless the body is very simple.  File: octave.info, Node: The for Statement, Next: The break Statement, Prev: The while Statement, Up: Statements The `for' Statement =================== The `for' statement makes it more convenient to count iterations of a loop. The general form of the `for' statement looks like this: for VAR = EXPRESSION BODY endfor The assignment expression in the `for' statement works a bit differently than Octave's normal assignment statement. Instead of assigning the complete result of the expression, it assigns each column of the expression to VAR in turn. If EXPRESSION is either a row vector or a scalar, the value of VAR will be a scalar each time the loop body is executed. If VAR is a column vector or a matrix, VAR will be a column vector each time the loop body is executed. The following example shows another way to create a vector containing the first ten elements of the Fibonacci sequence, this time using the `for' statement: fib = ones (1, 10); for i = 3:10 fib (i) = fib (i-1) + fib (i-2); endfor This code works by first evaluating the expression `3:10', to produce a range of values from 3 to 10 inclusive. Then the variable `i' is assigned the first element of the range and the body of the loop is executed once. When the end of the loop body is reached, the next value in the range is assigned to the variable `i', and the loop body is executed again. This process continues until there are no more elements to assign. In the `for' statement, BODY stands for any statement or list of statements. Although it is possible to rewrite all `for' loops as `while' loops, the Octave language has both statements because often a `for' loop is both less work to type and more natural to think of. Counting the number of iterations is very common in loops and it can be easier to think of this counting as part of looping rather than as something to do inside the loop.  File: octave.info, Node: The break Statement, Next: The continue Statement, Prev: The for Statement, Up: Statements The `break' Statement ===================== The `break' statement jumps out of the innermost `for' or `while' loop that encloses it. The `break' statement may only be used within the body of a loop. The following example finds the smallest divisor of a given integer, and also identifies prime numbers: num = 103; div = 2; while (div*div <= num) if (rem (num, div) == 0) break; endif div++; endwhile if (rem (num, div) == 0) printf ("Smallest divisor of %d is %d\n", num, div) else printf ("%d is prime\n", num); endif When the remainder is zero in the first `while' statement, Octave immediately "breaks out" of the loop. This means that Octave proceeds immediately to the statement following the loop and continues processing. (This is very different from the `exit' statement which stops the entire Octave program.) Here is another program equivalent to the previous one. It illustrates how the CONDITION of a `while' statement could just as well be replaced with a `break' inside an `if': num = 103; div = 2; while (1) if (rem (num, div) == 0) printf ("Smallest divisor of %d is %d\n", num, div); break; endif div++; if (div*div > num) printf ("%d is prime\n", num); break; endif endwhile  File: octave.info, Node: The continue Statement, Next: The unwind_protect Statement, Prev: The break Statement, Up: Statements The `continue' Statement ======================== The `continue' statement, like `break', is used only inside `for' or `while' loops. It skips over the rest of the loop body, causing the next cycle around the loop to begin immediately. Contrast this with `break', which jumps out of the loop altogether. Here is an example: # print elements of a vector of random # integers that are even. # first, create a row vector of 10 random # integers with values between 0 and 100: vec = round (rand (1, 10) * 100); # print what we're interested in: for x = vec if (rem (x, 2) != 0) continue; endif printf ("%d\n", x); endfor If one of the elements of VEC is an odd number, this example skips the print statement for that element, and continues back to the first statement in the loop. This is not a practical example of the `continue' statement, but it should give you a clear understanding of how it works. Normally, one would probably write the loop like this: for x = vec if (rem (x, 2) == 0) printf ("%d\n", x); endif endfor  File: octave.info, Node: The unwind_protect Statement, Prev: The continue Statement, Up: Statements The `unwind_protect' Statement ============================== Octave supports a limited form of exception handling modelled after the unwind-protect form of Lisp. The general form of an `unwind_protect' block looks like this: unwind_protect BODY unwind_protect_cleanup CLEANUP end_unwind_protect Where BODY and CLEANUP are both optional and may contain any Octave expressions or commands. The statements in CLEANUP are guaranteed to be executed regardless of how control exits BODY. This is useful to protect temporary changes to global variables from possible errors. For example, the following code will always restore the original value of the built-in variable `do_fortran_indexing' even if an error occurs while performing the indexing operation. save_do_fortran_indexing = do_fortran_indexing; unwind_protect do_fortran_indexing = "true"; elt = a (idx) unwind_protect_cleanup do_fortran_indexing = save_do_fortran_indexing; end_unwind_protect Without `unwind_protect', the value of DO_FORTRAN_INDEXING would not be restored if an error occurs while performing the indexing operation because evaluation would stop at the point of the error and the statement to restore the value would not be executed.  File: octave.info, Node: Functions and Scripts, Next: Built-in Variables, Prev: Statements, Up: Top Functions and Script Files ************************** Complicated Octave programs can often be simplified by defining functions. Functions can be defined directly on the command line during interactive Octave sessions, or in external files, and can be called just like built-in ones. * Menu: * Defining Functions:: * Multiple Return Values:: * Variable-length Argument Lists:: * Variable-length Return Lists:: * Returning From a Function:: * Function Files:: * Script Files:: * Dynamically Linked Functions:: * Organization of Functions::  File: octave.info, Node: Defining Functions, Next: Multiple Return Values, Prev: Functions and Scripts, Up: Functions and Scripts Defining Functions ================== In its simplest form, the definition of a function named NAME looks like this: function NAME BODY endfunction A valid function name is like a valid variable name: a sequence of letters, digits and underscores, not starting with a digit. Functions share the same pool of names as variables. The function BODY consists of Octave statements. It is the most important part of the definition, because it says what the function should actually *do*. For example, here is a function that, when executed, will ring the bell on your terminal (assuming that it is possible to do so): function wakeup printf ("\a"); endfunction The `printf' statement (*note Input and Output::.) simply tells Octave to print the string `"\a"'. The special character `\a' stands for the alert character (ASCII 7). *Note String Constants::. Once this function is defined, you can ask Octave to evaluate it by typing the name of the function. Normally, you will want to pass some information to the functions you define. The syntax for passing parameters to a function in Octave is function NAME (ARG-LIST) BODY endfunction where ARG-LIST is a comma-separated list of the function's arguments. When the function is called, the argument names are used to hold the argument values given in the call. The list of arguments may be empty, in which case this form is equivalent to the one shown above. To print a message along with ringing the bell, you might modify the `beep' to look like this: function wakeup (message) printf ("\a%s\n", message); endfunction Calling this function using a statement like this wakeup ("Rise and shine!"); will cause Octave to ring your terminal's bell and print the message `Rise and shine!', followed by a newline character (the `\n' in the first argument to the `printf' statement). In most cases, you will also want to get some information back from the functions you define. Here is the syntax for writing a function that returns a single value: function RET-VAR = NAME (ARG-LIST) BODY endfunction The symbol RET-VAR is the name of the variable that will hold the value to be returned by the function. This variable must be defined before the end of the function body in order for the function to return a value. For example, here is a function that computes the average of the elements of a vector: function retval = avg (v) retval = sum (v) / length (v); endfunction If we had written `avg' like this instead, function retval = avg (v) if (is_vector (v)) retval = sum (v) / length (v); endif endfunction and then called the function with a matrix instead of a vector as the argument, Octave would have printed an error message like this: error: `retval' undefined near line 1 column 10 error: evaluating index expression near line 7, column 1 because the body of the `if' statement was never executed, and `retval' was never defined. To prevent obscure errors like this, it is a good idea to always make sure that the return variables will always have values, and to produce meaningful error messages when problems are encountered. For example, `avg' could have been written like this: function retval = avg (v) retval = 0; if (is_vector (v)) retval = sum (v) / length (v); else error ("avg: expecting vector argument"); endif endfunction There is still one additional problem with this function. What if it is called without an argument? Without additional error checking, Octave will probably print an error message that won't really help you track down the source of the error. To allow you to catch errors like this, Octave provides each function with an automatic variable called `nargin'. Each time a function is called, `nargin' is automatically initialized to the number of arguments that have actually been passed to the function. For example, we might rewrite the `avg' function like this: function retval = avg (v) retval = 0; if (nargin != 1) error ("usage: avg (vector)"); endif if (is_vector (v)) retval = sum (v) / length (v); else error ("avg: expecting vector argument"); endif endfunction Although Octave does not consider it an error if you call a function with more arguments than were expected, doing so is probably an error, so we check for that possibility too, and issue the error message if either too few or too many arguments have been provided. The body of a user-defined function can contain a `return' statement. This statement returns control to the rest of the Octave program. A `return' statement is assumed at the end of every function definition.  File: octave.info, Node: Multiple Return Values, Next: Variable-length Argument Lists, Prev: Defining Functions, Up: Functions and Scripts Multiple Return Values ====================== Unlike many other computer languages, Octave allows you to define functions that return more than one value. The syntax for defining functions that return multiple values is function [RET-LIST] = NAME (ARG-LIST) BODY endfunction where NAME, ARG-LIST, and BODY have the same meaning as before, and RET-LIST is a comma-separated list of variable names that will hold the values returned from the function. The list of return values must have at least one element. If RET-LIST has only one element, this form of the `function' statement is equivalent to the form described in the previous section. Here is an example of a function that returns two values, the maximum element of a vector and the index of its first occurrence in the vector. function [max, idx] = vmax (v) idx = 1; max = v (idx); for i = 2:length (v) if (v (i) > max) max = v (i); idx = i; endif endfor endfunction In this particular case, the two values could have been returned as elements of a single array, but that is not always possible or convenient. The values to be returned may not have compatible dimensions, and it is often desirable to give the individual return values distinct names. In addition to setting `nargin' each time a function is called, Octave also automatically initializes `nargout' to the number of values that are expected to be returned. This allows you to write functions that behave differently depending on the number of values that the user of the function has requested. The implicit assignment to the built-in variable `ans' does not figure in the count of output arguments, so the value of `nargout' may be zero. The `svd' and `lu' functions are examples of built-in functions that behave differently depending on the value of `nargout'. It is possible to write functions that only set some return values. For example, calling the function function [x, y, z] = f () x = 1; z = 2; endfunction as [a, b, c] = f () produces: a = 1 b = [](0x0) c = 2  File: octave.info, Node: Variable-length Argument Lists, Next: Variable-length Return Lists, Prev: Multiple Return Values, Up: Functions and Scripts Variable-length Argument Lists ============================== Octave has a real mechanism for handling functions that take an unspecified number of arguments, so it is not necessary to place an upper bound on the number of optional arguments that a function can accept. Here is an example of a function that uses the new syntax to print a header followed by an unspecified number of values: function foo (heading, ...) disp (heading); va_start (); while (--nargin) disp (va_arg ()); endwhile endfunction The ellipsis that marks the variable argument list may only appear once and must be the last element in the list of arguments. Calling `va_start()' positions an internal pointer to the first unnamed argument and allows you to cycle through the arguments more than once. It is not necessary to call `va_start()' if you do not plan to cycle through the arguments more than once. The function `va_arg()' returns the value of the next available argument and moves the internal pointer to the next argument. It is an error to call `va_arg()' when there are no more arguments available. Sometimes it is useful to be able to pass all unnamed arguments to another function. The keyword ALL_VA_ARGS makes this very easy to do. For example, given the functions function f (...) while (nargin--) disp (va_arg ()) endwhile endfunction function g (...) f ("begin", all_va_args, "end") endfunction the statement g (1, 2, 3) prints begin 1 2 3 end The keyword `all_va_args' always stands for the entire list of optional argument, so it is possible to use it more than once within the same function without having to call `var_start ()'. It can only be used within functions that take a variable number of arguments. It is an error to use it in other contexts.  File: octave.info, Node: Variable-length Return Lists, Next: Returning From a Function, Prev: Variable-length Argument Lists, Up: Functions and Scripts Variable-length Return Lists ============================ Octave also has a real mechanism for handling functions that return an unspecified number of values, so it is no longer necessary to place an upper bound on the number of outputs that a function can produce. Here is an example of a function that uses the new syntax to produce N values: function [...] = foo (n, x) for i = 1:n vr_val (i * x); endfor endfunction Each time `vr_val()' is called, it places the value of its argument at the end of the list of values to return from the function. Once `vr_val()' has been called, there is no way to go back to the beginning of the list and rewrite any of the return values. As with variable argument lists, the ellipsis that marks the variable return list may only appear once and must be the last element in the list of returned values.  File: octave.info, Node: Returning From a Function, Next: Function Files, Prev: Variable-length Return Lists, Up: Functions and Scripts Returning From a Function ========================= The body of a user-defined function can contain a `return' statement. This statement returns control to the rest of the Octave program. It looks like this: return Unlike the `return' statement in C, Octave's `return' statement cannot be used to return a value from a function. Instead, you must assign values to the list of return variables that are part of the `function' statement. The `return' statement simply makes it easier to exit a function from a deeply nested loop or conditional statement. Here is an example of a function that checks to see if any elements of a vector are nonzero. function retval = any_nonzero (v) retval = 0; for i = 1:length (v) if (v (i) != 0) retval = 1; return; endif endfor printf ("no nonzero elements found\n"); endfunction Note that this function could not have been written using the `break' statement to exit the loop once a nonzero value is found without adding extra logic to avoid printing the message if the vector does contain a nonzero element.  File: octave.info, Node: Function Files, Next: Script Files, Prev: Returning From a Function, Up: Functions and Scripts Function Files ============== Except for simple one-shot programs, it is not practical to have to define all the functions you need each time you need them. Instead, you will normally want to save them in a file so that you can easily edit them, and save them for use at a later time. Octave does not require you to load function definitions from files before using them. You simply need to put the function definitions in a place where Octave can find them. When Octave encounters an identifier that is undefined, it first looks for variables or functions that are already compiled and currently listed in its symbol table. If it fails to find a definition there, it searches the list of directories specified by the built-in variable `LOADPATH' for files ending in `.m' that have the same base name as the undefined identifier.(1) *Note User Preferences:: for a description of `LOADPATH'. Once Octave finds a file with a name that matches, the contents of the file are read. If it defines a *single* function, it is compiled and executed. *Note Script Files::, for more information about how you can define more than one function in a single file. When Octave defines a function from a function file, it saves the full name of the file it read and the time stamp on the file. After that, it checks the time stamp on the file every time it needs the function. If the time stamp indicates that the file has changed since the last time it was read, Octave reads it again. Checking the time stamp allows you to edit the definition of a function while Octave is running, and automatically use the new function definition without having to restart your Octave session. Checking the time stamp every time a function is used is rather inefficient, but it has to be done to ensure that the correct function definition is used. Octave assumes that function files in the `/usr/local/lib/octave/1.1.0' directory tree will not change, so it doesn't have to check their time stamps every time the functions defined in those files are used. This is normally a very good assumption and provides a significant improvement in performance for the function files that are distributed with Octave. If you know that your own function files will not change while you are running Octave, you can improve performance by setting the variable `ignore_function_time_stamp' to `"all"', so that Octave will ignore the time stamps for all function files. Setting it to `"system"' gives the default behavior. If you set it to anything else, Octave will check the time stamps on all function files. ---------- Footnotes ---------- (1) The `.m' suffix was chosen for compatibility with MATLAB.  File: octave.info, Node: Script Files, Next: Dynamically Linked Functions, Prev: Function Files, Up: Functions and Scripts Script Files ============ A script file is a file containing (almost) any sequence of Octave commands. It is read and evaluated just as if you had typed each command at the Octave prompt, and provides a convenient way to perform a sequence of commands that do not logically belong inside a function. Unlike a function file, a script file must *not* begin with the keyword `function'. If it does, Octave will assume that it is a function file, and that it defines a single function that should be evaluated as soon as it is defined. A script file also differs from a function file in that the variables named in a script file are not local variables, but are in the same scope as the other variables that are visible on the command line. Even though a script file may not begin with the `function' keyword, it is possible to define more than one function in a single script file and load (but not execute) all of them at once. To do this, the first token in the file (ignoring comments and other white space) must be something other than `function'. If you have no other statements to evaluate, you can use a statement that has no effect, like this: # Prevent Octave from thinking that this # is a function file: 1; # Define function one: function one () ... To have Octave read and compile these functions into an internal form, you need to make sure that the file is in Octave's `LOADPATH', then simply type the base name of the file that contains the commands. (Octave uses the same rules to search for script files as it does to search for function files.) If the first token in a file (ignoring comments) is `function', Octave will compile the function and try to execute it, printing a message warning about any non-whitespace characters that appear after the function definition. Note that Octave does not try to lookup the definition of any identifier until it needs to evaluate it. This means that Octave will compile the following statements if they appear in a script file, or are typed at the command line, # not a function file: 1; function foo () do_something (); endfunction function do_something () do_something_else (); endfunction even though the function `do_something' is not defined before it is referenced in the function `foo'. This is not an error because the Octave does not need to resolve all symbols that are referenced by a function until the function is actually evaluated. Since Octave doesn't look for definitions until they are needed, the following code will always print `bar = 3' whether it is typed directly on the command line, read from a script file, or is part of a function body, even if there is a function or script file called `bar.m' in Octave's `LOADPATH'. eval ("bar = 3"); bar Code like this appearing within a function body could fool Octave if definitions were resolved as the function was being compiled. It would be virtually impossible to make Octave clever enough to evaluate this code in a consistent fashion. The parser would have to be able to perform the `eval ()' statement at compile time, and that would be impossible unless all the references in the string to be evaluated could also be resolved, and requiring that would be too restrictive (the string might come from user input, or depend on things that are not known until the function is evaluated).  File: octave.info, Node: Dynamically Linked Functions, Next: Organization of Functions, Prev: Script Files, Up: Functions and Scripts Dynamically Linked Functions ============================ On some systems, Octave can dynamically load and execute functions written in C++ or other compiled languages. This currently only works on systems that have a working version of the GNU dynamic linker, `dld'. Unfortunately, `dld' does not work on very many systems, but someone is working on making `dld' use the GNU Binary File Descriptor library, `BFD', so that may soon change. In any case, it should not be too hard to make Octave's dynamic linking features work on other systems using system-specific dynamic linking facilities. Here is an example of how to write a C++ function that Octave can load. #include #include "defun-dld.h" #include "tree-const.h" DEFUN_DLD ("hello", Fhello, Shello, -1, -1, "hello (...)\n\ \n\ Print greeting followed by the values of all the arguments passed.\n\ Returns all the arguments passed.") { Octave_object retval; cerr << "Hello, world!\n"; int nargin = args.length (); for (int i = 1; i < nargin; i++) retval (nargin-i-1) = args(i).eval (1); return retval; } Octave's dynamic linking features currently have the following limitations. * Dynamic linking only works on systems that support the GNU dynamic linker, `dld'. * Clearing dynamically linked functions doesn't work. * Configuring Octave with `--enable-lite-kernel' seems to mostly work to make nonessential built-in functions dynamically loaded, but there also seem to be some problems. For example, fsolve seems to always return `info == 3'. This is difficult to debug since `gdb' won't seem to allow breakpoints to be set inside dynamically loaded functions. * Octave uses a lot of memory if the dynamically linked functions are compiled to include debugging symbols. This appears to be a limitation with `dld', and can be avoided by not using `-g' to compile functions that will be linked dynamically. If you would like to volunteer to help improve Octave's ability to dynamically link externally compiled functions, please contact `bug-octave@che.utexas.edu'.  File: octave.info, Node: Organization of Functions, Prev: Dynamically Linked Functions, Up: Functions and Scripts Organization of Functions Distributed with Octave ================================================= Many of Octave's standard functions are distributed as function files. They are loosely organized by topic, in subdirectories of `OCTAVE_HOME/lib/octave/VERSION/m', to make it easier to find them. The following is a list of all the function file subdirectories, and the types of functions you will find there. `control' Functions for design and simulation of automatic control systems. `elfun' Elementary functions. `general' Miscellaneous matrix manipulations, like `flipud', `rot90', and `triu', as well as other basic functions, like `is_matrix', `nargchk', etc. `image' Image processing tools. These functions require the X Window System. `linear-algebra' Functions for linear algebra. `miscellaneous' Functions that don't really belong anywhere else. `plot' A set of functions that implement the MATLAB-like plotting functions. `polynomial' Functions for manipulating polynomials. `set' Functions for creating and manipulating sets of unique values. `signal' Functions for signal processing applications. `specfun' Special functions. `special-matrix' Functions that create special matrix forms. `startup' Octave's system-wide startup file. `statistics' Statistical functions. `strings' Miscellaneous string-handling functions. *Note User Preferences:: for an explanation of the built-in variable `LOADPATH', and *Note Function Files:: for a description of the way Octave resolves undefined variable and function names.  File: octave.info, Node: Built-in Variables, Next: Arithmetic, Prev: Functions and Scripts, Up: Top Built-in Variables ****************** Most Octave variables are available for you to use for your own purposes; they never change except when your program assigns values to them, and never affect anything except when your program examines them. A few variables have special built-in meanings. Some of them, like `pi' and `eps' provide useful predefined constant values. Others, like `do_fortran_indexing' and `page_screen_output' are examined automatically by Octave, so that you can to tell Octave how to do certain things. There are also two special variables, `ans' and `PWD', that are set automatically by Octave and carry information from the internal workings of Octave to your program. This chapter documents all the built-in variables of Octave. Most of them are also documented in the chapters that describe functions that use them, or are affected by their values. * Menu: * Predefined Constants:: * User Preferences:: * Other Built-in Variables:: * Summary of Preference Variables::  File: octave.info, Node: Predefined Constants, Next: User Preferences, Prev: Built-in Variables, Up: Built-in Variables Predefined Constants ==================== `I, i, J, j' A pure imaginary number, defined as `sqrt (-1)'. The `I' and `J' forms are true constants, and cannot be modified. The `i' and `j' forms are like ordinary variables, and may be used for other purposes. However, unlike other variables, they once again assume their special predefined values if they are cleared *Note Miscellaneous Utilities::. `Inf, inf' Infinity. This is the result of an operation like 1/0, or an operation that results in a floating point overflow. `NaN, nan' Not a number. This is the result of an operation like `0/0', or `Inf - Inf', or any operation with a NaN. `SEEK_SET' `SEEK_CUR' `SEEK_END' These variables may be used as the optional third argument for the function `fseek'. `eps' The machine precision. More precisely, `eps' is the smallest value such that `1+eps' is not equal to 1. This number is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, `eps' is approximately 2.2204e-16. `pi' The ratio of the circumference of a circle to its diameter. Internally, `pi' is computed as `4.0 * atan (1.0)'. `realmax' The largest floating point number that is representable. The actual value is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, `realmax' is approximately 1.7977e+308 `realmin' The smallest floating point number that is representable. The actual value is system-dependent. On machines that support 64 bit IEEE floating point arithmetic, `realmin' is approximately 2.2251e-308 `stdin' `stdout' `stderr' These variables are the file numbers corresponding to the standard input, standard output, and standard error streams. These streams are preconnected and available when Octave starts. octave-1.1.0/doc/octave.info-4100666 415 17 140350 5705317773 14264 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: User Preferences, Next: Other Built-in Variables, Prev: Predefined Constants, Up: Built-in Variables User Preferences ================ This section describes the variables that you can use to customize Octave's behavior. Normally, preferences are set in the file `~/.octaverc', so that you can customize your environment in the same way each time you use Octave without having to remember and retype all the necessary commands. *Note Startup Files:: for more information. `EDITOR' A string naming the editor to use with the `edit_history' command. If the environment variable `EDITOR' is set when Octave starts, its value is used as the default. Otherwise, `EDITOR' is set to `"vi"'. `IMAGEPATH' A colon separated list of directories in which to search for image files. *Note Image Processing:: for a description of Octave's image processing capabilities. `INFO_FILE' A string naming the location of the Octave info file. The default value is `"/usr/local/info/octave.info"'. `LOADPATH' A colon separated list of directories in which to search for function files. *Note Functions and Scripts::. The value of `LOADPATH' overrides the environment variable `OCTAVE_PATH'. *Note Installation::. `LOADPATH' is now handled in the same way as TeX handles `TEXINPUTS'. If the path starts with `:', the standard path is prepended to the value of `LOADPATH'. If it ends with `:' the standard path is appended to the value of `LOADPATH'. In addition, if any path element ends in `//', that directory and all subdirectories it contains are searched recursively for function files. This can result in a slight delay as Octave caches the lists of files found in the `LOADPATH' the first time Octave searches for a function. After that, searching is usually much faster because Octave normally only needs to search its internal cache for files. To improve performance of recursive directory searching, it is best for each directory that is to be searched recursively to contain *either* additional subdirectories *or* function files, but not a mixture of both. *Note Organization of Functions:: for a description of the function file directories that are distributed with Octave. `OCTAVE_VERSION' The version number of Octave, as a string. `PAGER' The default value is `"less"', or, if `less' is not available on your system, `"more"'. *Note Installation::, and *Note Input and Output::. `PS1' The primary prompt string. When executing interactively, Octave displays the primary prompt `PS1' when it is ready to read a command. Octave allows the prompt to be customized by inserting a number of backslash-escaped special characters that are decoded as follows: `\t' The time. `\d' The date. `\n' Begins a new line by printing the equivalent of a carriage return followed by a line feed. `\s' The name of the program (usually just `octave'). `\w' The current working directory. `\W' The basename of the current working directory. `\u' The username of the current user. `\h' The hostname. `\#' The command number of this command, counting from when Octave starts. `\!' The history number of this command. This differs from `\#' by the number of commands in the history list when Octave starts. `\$' If the effective UID is 0, a #, otherwise a $. `\nnn' The character whose character code in octal is `nnn'. `\\' A backslash. The default value of `PS1' is `"\s:\#> "'. To change it, use a command like octave:13> PS1 = "\\u@\\h> " which will result in the prompt `boris@kremvax> ' for the user `boris' logged in on the host `kremvax'. Note that two backslashes are required to enter a backslash into a string. *Note String Constants::. `PS2' The secondary prompt string, which is printed when Octave is expecting additional input to complete a command. For example, when defining a function over several lines, Octave will print the value of `PS1' at the beginning of each line after the first. Octave allows `PS2' to be customized in the same way as `PS1'. The default value of `PS2' is `"> "'. `automatic_replot' If this variable is `"true"', Octave will automatically send a `replot' command to `gnuplot' each time the plot changes. Since this is fairly inefficient, the default value is `"false"'. `whitespace_in_literal_matrix' This variable allows some control over how Octave decides to convert spaces to commas and semicolons in matrix expressions like `[m (1)]' or [ 1, 2, 3, 4 ] If the value of `whitespace_in_literal_matrix' is `"ignore"', Octave will never insert a comma or a semicolon in a literal matrix list. For example, the expression `[1 2]' will result in an error instead of being treated the same as `[1, 2]', and the expression [ 1, 2, 3, 4 ] will result in the vector [1 2 3 4] instead of a matrix. If the value of `whitespace_in_literal_matrix' is `"traditional"', Octave will convert spaces to a comma between identifiers and `('. For example, given the matrix m = [3 2] the expression [m (1)] will be parsed as [m, (1)] and will result in [3 2 1] and the expression [ 1, 2, 3, 4 ] will result in a matrix because the newline character is converted to a semicolon (row separator) even though there is a comma at the end of the first line (trailing commas or semicolons are ignored). This is apparently how MATLAB behaves. Any other value for `whitespace_in_literal_matrix' results in behavior that is the same as traditional, except that Octave does not convert spaces to a comma between identifiers and `('. For example, the expression [m (1)] will produce `3'. This is the way Octave has always behaved. `default_save_format' `do_fortran_indexing' If the value of `do_fortran_indexing' is `"true"', Octave allows you to select elements of a two-dimensional matrix using a single index by treating the matrix as a single vector created from the columns of the matrix. The default value is `"false"'. `empty_list_elements_ok' This variable controls whether Octave ignores empty matrices in a matrix list. For example, if the value of `empty_list_elements_ok' is `"true"', Octave will ignore the empty matrices in the expression a = [1, [], 3, [], 5] and the variable `a' will be assigned the value `[ 1 3 5 ]'. The default value is `"warn"'. `gnuplot_binary' The name of the program invoked by the plot command. The default value is `"gnuplot"'. *Note Installation::. `ignore_function_time_stamp' This variable variable can be used to prevent Octave from making the system call `stat()' each time it looks up functions defined in function files. If `ignore_function_time_stamp' to `"system"', Octave will not automatically recompile function files in subdirectories of `/usr/local/lib/1.1.0' if they have changed since they were last compiled, but will recompile other function files in the `LOADPATH' if they change. If set to `"all"', Octave will not recompile any function files unless their definitions are removed with `clear'. For any other value of `ignore_function_time_stamp', Octave will always check to see if functions defined in function files need to recompiled. The default value of `ignore_function_time_stamp' is `"system"'. `implicit_str_to_num_ok' If the value of `implicit_str_to_num_ok' is `"true"', implicit conversions of strings to their numeric ASCII equivalents are allowed. Otherwise, an error message is printed and control is returned to the top level. The default value is `"false"'. `ok_to_lose_imaginary_part' If the value of `ok_to_lose_imaginary_part' is `"true"', implicit conversions of complex numbers to real numbers are allowed (for example, by fsolve). If the value is `"warn"', the conversion is allowed, but a warning is printed. Otherwise, an error message is printed and control is returned to the top level. The default value is `"warn"'. `output_max_field_width' This variable specifies the maximum width of a numeric output field. The default value is 10. It is possible to achieve a wide range of output styles by using different values of `output_precision' and `output_max_field_width'. Reasonable combinations can be set using the `format' function. *Note Basic Input and Output::. `output_precision' This variable specifies the minimum number of significant figures to display for numeric output. The default value is 5. It is possible to achieve a wide range of output styles by using different values of `output_precision' and `output_max_field_width'. Reasonable combinations can be set using the `format' function. *Note Basic Input and Output::. `page_screen_output' If the value of `page_screen_output' is `"true"', all output intended for the screen that is longer than one page is sent through a pager. This allows you to view one screenful at a time. Some pagers (such as `less'--see *Note Installation::) are also capable of moving backward on the output. The default value is `"true"'. *Note Input and Output::. You can choose the program to use as the pager by setting the variable `PAGER'. `prefer_column_vectors' If `prefer_column_vectors' is `"true"', operations like for i = 1:10 a (i) = i; endfor (for `a' previously undefined) produce column vectors. Otherwise, row vectors are preferred. The default value is `"false"'. If a variable is already defined to be a vector (a matrix with a single row or column), the original orientation is respected, regardless of the value of `prefer_column_vectors'. `prefer_zero_one_indexing' If the value of `prefer_zero_one_indexing' is `"true"', Octave will perform zero-one style indexing when there is a conflict with the normal indexing rules. *Note Index Expressions::. For example, given a matrix a = [1, 2, 3, 4] with `prefer_zero_one_indexing' is set to `"true"', the expression a ([1, 1, 1, 1]) results in the matrix `[ 1 2 3 4 ]'. If the value of `prefer_zero_one_indexing' set to `"false"', the result would be the matrix `[ 1 1 1 1 ]'. In the first case, Octave is selecting each element corresponding to a `1' in the index vector. In the second, Octave is selecting the first element multiple times. The default value for `prefer_zero_one_indexing' is `"false"'. `print_answer_id_name' If the value of `print_answer_id_name' is `"true"', variable names are printed along with the result. Otherwise, only the result values are printed. The default value is `"true"'. `print_empty_dimensions' If the value of `print_empty_dimensions' is `"true"', the dimensions of empty matrices are printed along with the empty matrix symbol, `[]'. For example, the expression zeros (3, 0) will print ans = [](3x0) `propagate_empty_matrices' If the value of `propagate_empty_matrices' is `"true"', functions like `inverse' and `svd' will return an empty matrix if they are given one as an argument. The default value is `"true"'. *Note Empty Matrices::. `resize_on_range_error' If the value of `resize_on_range_error' is `"true"', expressions like for i = 1:10 a (i) = i; endfor (for `a' previously undefined) result in the variable `a' being resized to be just large enough to hold the new value. Otherwise uninitialized elements are set to zero. If the value of `resize_on_range_error' is `"false"', an error message is printed and control is returned to the top level. The default value is `"true"'. `return_last_computed_value' If the value of `return_last_computed_value' is true, and a function is defined without explicitly specifying a return value, the function will return the value of the last expression. Otherwise, no value will be returned. The default value is `"false"'. For example, the function function f () 2 + 2; endfunction will either return nothing, if `return_last_computed_value' is `"false"', or 4, if it is `"true"'. `save_precision' This variable specifies the number of digits to keep when saving data with the `save' command. The default value is 17. `silent_functions' If the value of `silent_functions' is `"true"', internal output from a function is suppressed. Otherwise, the results of expressions within a function body that are not terminated with a semicolon will have their values printed. The default value is `"false"'. For example, if the function function f () 2 + 2 endfunction is executed, Octave will either print `ans = 4' or nothing depending on the value of `silent_functions'. `split_long_rows' For large matrices, Octave may not be able to display all the columns of a given row on one line of your screen. This can result in missing information or output that is nearly impossible to decipher, depending on whether your terminal truncates or wraps long lines. If the value of `split_long_rows' is `"true"', Octave will display the matrix in a series of smaller pieces, each of which can fit within the limits of your terminal width. Each set of rows is labeled so that you can easily see which columns are currently being displayed. For example: octave:13> rand (2, 9) ans = Columns 1 through 7: 0.92205 0.72628 0.99841 0.62590 0.82422 0.77486 0.30258 0.15999 0.79484 0.75443 0.86995 0.91430 0.23980 0.64591 Columns 8 and 9: 0.08894 0.13266 0.28008 0.65575 The default value of `split_long_rows' is `"true"'. `treat_neg_dim_as_zero' If the value of `treat_neg_dim_as_zero' is `"true"', expressions like eye (-1) produce an empty matrix (i.e., row and column dimensions are zero). Otherwise, an error message is printed and control is returned to the top level. The default value is `"false"'. `warn_assign_as_truth_value' If the value of `warn_assign_as_truth_value' is `"true"', a warning is issued for statements like if (s = t) ... since such statements are not common, and it is likely that the intent was to write if (s == t) ... instead. There are times when it is useful to write code that contains assignments within the condition of a `while' or `if' statement. For example, statements like while (c = getc()) ... are common in C programming. It is possible to avoid all warnings about such statements by setting `warn_assign_as_truth_value' to `"false"', but that may also let real errors like if (x = 1) # intended to test (x == 1)! ... slip by. In such cases, it is possible suppress errors for specific statements by writing them with an extra set of parentheses. For example, writing the previous example as while ((c = getc())) ... will prevent the warning from being printed for this statement, while allowing Octave to warn about other assignments used in conditional contexts. The default value of `warn_assign_as_truth_value' is `"true"'. `warn_comma_in_global_decl' If the value of `warn_comma_in_global_decl' is `"true"', a warning is issued for statements like global a = 1, b which makes the variables `a' and `b' global and assigns the value 1 to the variable `a', because in this context, the comma is not interpreted as a statement separator. The default value of `warn_comma_in_global_decl' is `"true"'. `warn_divide_by_zero' If the value of `warn_divide_by_zero' is `"true"', a warning is issued when Octave encounters a division by zero. If the value is `"false"', the warning is omitted. The default value is `"true"'.  File: octave.info, Node: Other Built-in Variables, Next: Summary of Preference Variables, Prev: User Preferences, Up: Built-in Variables Other Built-in Variables ======================== In addition to these variables, there are two other special built-in variables whose values are automatically updated. `ans' This variable holds the most recently computed result that was not explicitly assigned to a variable. For example, after the expression 3^2 + 4^2 is evaluated, the value of `ans' is `25'. `PWD' The current working directory. The value of `PWD' is updated each time the current working directory is changed with the `cd' command. *Note System Utilities::.  File: octave.info, Node: Summary of Preference Variables, Prev: Other Built-in Variables, Up: Built-in Variables Summary of Preference Variables =============================== Here is a summary of all of Octave's preference variables and their default values. In the following table `OCTAVE_HOME' stands for the root directory where Octave is installed, and `VERSION' stands for the Octave version number. EDITOR EDITOR environment variable, or "vi" INFO_FILE "OCTAVE_HOME/info/octave.info" LOADPATH OCTAVE_PATH environment variable, or ".:OCTAVE_HOME/lib/VERSION" PAGER "less", or "more" PS1 "\s:\#> " PS2 "> " automatic_replot "false" whitespace_in_literal_matrix "" do_fortran_indexing "false" empty_list_elements_ok "warn" gnuplot_binary "gnuplot" ignore_function_time_stamp "system" implicit_str_to_num_ok "false" ok_to_lose_imaginary_part "warn" output_max_field_width 10 output_precision 5 page_screen_output "true" prefer_column_vectors "false" prefer_zero_one_indexing "false" print_answer_id_name "true" print_empty_dimensions "true" resize_on_range_error "true" return_last_computed_value "false" save_precision 17 silent_functions "false" split_long_rows "true" treat_neg_dim_as_zero "false" warn_assign_as_truth_value "true" warn_comma_in_global_decl "true" warn_divide_by_zero "true"  File: octave.info, Node: Arithmetic, Next: Linear Algebra, Prev: Built-in Variables, Up: Top Arithmetic ********** Unless otherwise noted, all of the functions described in this chapter will work for real and complex scalar or matrix arguments. * Menu: * Utility Functions:: * Complex Arithmetic:: * Trigonometry:: * Sums and Products:: * Special Functions::  File: octave.info, Node: Utility Functions, Next: Complex Arithmetic, Prev: Arithmetic, Up: Arithmetic Utility Functions ================= The following functions are available for working with complex numbers. Each expects a single argument, and given a matrix, they work on an element by element basis. `ceil (X)' Return the smallest integer not less than X. If X is complex, return `ceil (real (X)) + ceil (imag (X)) * I'. `floor (X)' Return the largest integer not greater than X. If X is complex, return `floor (real (X)) + floor (imag (X)) * I'. `fix (X)' Truncate X toward zero. If X is complex, return `fix (real (X)) + fix (imag (X)) * I'. `round (X)' Return the integer nearest to X. If X is complex, return `round (real (X)) + round (imag (X)) * I'. `sign (X)' Compute the "signum" function, which is defined as -1, x < 0; sign (x) = 0, x = 0; 1, x > 0. For complex arguments, `sign' returns `x ./ abs (X)'. `exp (X)' Compute the exponential of X. To compute the matrix exponential, see *Note Linear Algebra::. `gcd (X, `...')' Compute the greatest common divisor of the elements of X, or the list of all the arguments. For example, gcd (a1, ..., ak) is the same as gcd ([a1, ..., ak]) An optional second return value, V contains an integer vector such that g = v(1) * a(k) + ... + v(k) * a(k) `lcm (X, `...')' Compute the least common multiple of the elements elements of X, or the list of all the arguments. For example, lcm (a1, ..., ak) is the same as lcm ([a1, ..., ak]). `log (X)' Compute the natural logarithm of X. To compute the matrix logarithm, see *Note Linear Algebra::. `log2 (X)' Compute the base-2 logarithm of X. `log10 (X)' Compute the base-10 logarithm of X. `sqrt (X)' Compute the square root of X. To compute the matrix square root, see *Note Linear Algebra::. `max (X)' For a vector argument, return the maximum value. For a matrix argument, return the maximum value from each column, as a row vector. Thus, max (max (X)) returns the largest element of X. For complex arguments, the magnitude of the elements are used for comparison. `min (X)' Like `max', but return the minimum value. `rem (X, Y)' Return the remainder of `X / Y', computed using the expression x - y .* fix (x ./ y) An error message is printed if the dimensions of the arguments do not agree, or if either of the arguments is complex.  File: octave.info, Node: Complex Arithmetic, Next: Trigonometry, Prev: Utility Functions, Up: Arithmetic Complex Arithmetic ================== The following functions are available for working with complex numbers. Each expects a single argument. Given a matrix they work on an element by element basis. `abs (X)' Compute the magnitude of X. `angle (X)' `arg (X)' Compute the argument of X. `conj (X)' Return the complex conjugate of X. `imag (X)' Return the imaginary part of X. `real (X)' Return the real part of X.  File: octave.info, Node: Trigonometry, Next: Sums and Products, Prev: Complex Arithmetic, Up: Arithmetic Trigonometry ============ Octave provides the following trigonometric functions: sin asin sinh asinh cos acos cosh acosh tan atan tanh atanh sec asec sech asech csc acsc csch acsch cot acot coth acoth Each of these functions expect a single argument. For matrix arguments, they work on an element by element basis. For example, the expression sin ([1, 2; 3, 4]) produces ans = 0.84147 0.90930 0.14112 -0.75680 `atan2 (Y, X)'  File: octave.info, Node: Sums and Products, Next: Special Functions, Prev: Trigonometry, Up: Arithmetic Sums and Products ================= `sum (X)' For a vector argument, return the sum of all the elements. For a matrix argument, return the sum of the elements in each column, as a row vector. The sum of an empty matrix is 0 if it has no columns, or a vector of zeros if it has no rows (*note Empty Matrices::.). `prod (X)' For a vector argument, return the product of all the elements. For a matrix argument, return the product of the elements in each column, as a row vector. The product of an empty matrix is 1 if it has no columns, or a vector of ones if it has no rows (*note Empty Matrices::.). `cumsum (X)' Return the cumulative sum of each column of X. For example, cumsum ([1, 2; 3, 4]) produces ans = 1 2 4 6 `cumprod (X)' Return the cumulative product of each column of X. For example, cumprod ([1, 2; 3, 4]) produces ans = 1 2 3 8 `sumsq (X)' For a vector argument, return the sum of the squares of all the elements. For a matrix argument, return the sum of the squares of the elements in each column, as a row vector.  File: octave.info, Node: Special Functions, Prev: Sums and Products, Up: Arithmetic Special Functions ================= `beta' Returns the beta function, beta (a, b) = gamma (a) * gamma (b) / gamma (a + b). `betai (A, B, X)' Returns the incomplete beta function, x / betai (a, b, x) = beta (a, b)^(-1) | t^(a-1) (1-t)^(b-1) dt. / t=0 If x has more than one component, both A and B must be scalars. If X is a scalar, A and B must be of compatible dimensions. `erf' Computes the error function, z / erf (z) = (2/sqrt (pi)) | e^(-t^2) dt / t=0 `erfc (Z)' Computes the complementary error function, `1 - erf (Z)'. `erfinv' Computes the inverse of the error function. `gamma (Z)' Computes the gamma function, infinity / gamma (z) = | t^(z-1) exp (-t) dt. / t=0 `gammai (A, X)' Computes the incomplete gamma function, x 1 / gammai (a, x) = --------- | exp (-t) t^(a-1) dt gamma (a) / t=0 If A is scalar, then `gammai (A, X)' is returned for each element of X and vice versa. If neither A nor X is scalar, the sizes of A and X must agree, and GAMMAI is applied element-by-element. `lgamma' Returns the natural logarithm of the gamma function.  File: octave.info, Node: Linear Algebra, Next: Polynomial Manipulations, Prev: Arithmetic, Up: Top Linear Algebra ************** This chapter documents the linear algebra functions of Octave. Reference material for many of these options may be found in Golub and Van Loan, `Matrix Computations, 2nd Ed.', Johns Hopkins, 1989, and in `LAPACK Users' Guide', SIAM, 1992. * Menu: * Basic Matrix Functions:: * Matrix Factorizations:: * Functions of a Matrix::  File: octave.info, Node: Basic Matrix Functions, Next: Matrix Factorizations, Prev: Linear Algebra, Up: Linear Algebra Basic Matrix Functions ====================== `balance' aa = balance (a, opt) [dd, aa] = balance(a, opt) [dd, aa] = balance (a, opt) [cc, dd, aa, bb] = balance (a, b, opt) `[dd, aa] = balance (a)' returns `aa = dd \ a * dd'. `aa' is a matrix whose row/column norms are roughly equal in magnitude, and `dd' = `p * d', where `p' is a permutation matrix and `d' is a diagonal matrix of powers of two. This allows the equilibration to be computed without roundoff. Results of eigenvalue calculation are typically improved by balancing first. `[cc, dd, aa, bb] = balance (a, b)' returns `aa' (`bb') `= cc*a*dd (cc*b*dd)'), where `aa' and `bb' have non-zero elements of approximately the same magnitude and `cc' and `dd' are permuted diagonal matrices as in `dd' for the algebraic eigenvalue problem. The eigenvalue balancing option `opt' is selected as follows: `"N"', `"n"' No balancing; arguments copied, transformation(s) set to identity. `"P"', `"p"' Permute argument(s) to isolate eigenvalues where possible. `"S"', `"s"' Scale to improve accuracy of computed eigenvalues. `"B"', `"b"' Permute and scale, in that order. Rows/columns of a (and b) that are isolated by permutation are not scaled. This is the default behavior. Algebraic eigenvalue balancing uses standard LAPACK routines. Generalized eigenvalue problem balancing uses Ward's algorithm (SIAM Journal on Scientific and Statistical Computing, 1981). `cond (A)' Compute the (two-norm) condition number of a matrix. `cond (a)' is defined as `norm (a) * norm (inv (a))', and is computed via a singular value decomposition. `det (A)' Compute the determinant of A using LINPACK. `eig' = eig (a) [v, lambda] = eig (a) The eigenvalues (and eigenvectors) of a matrix are computed in a several step process which begins with a Hessenberg decomposition (see `hess'), followed by a Schur decomposition (see `schur'), from which the eigenvalues are apparent. The eigenvectors, when desired, are computed by further manipulations of the Schur decomposition. See also: `hess', `schur'. `givens' [c, s] = givens (x, y) G = givens (x, y) `G = givens(x, y)' returns a 2 x 2 orthogonal matrix `G = [c s; -s' c]' such that `G [x; y] = [*; 0]' (x, y scalars) `inv (A)' `inverse (A)' Compute the inverse of the square matrix A. `norm (A, P)' Compute the p-norm of the matrix A. If the second argument is missing, `p = 2' is assumed. If A is a matrix: P = `1' 1-norm, the largest column sum of A. P = `2' Largest singular value of A. P = `Inf' Infinity norm, the largest row sum of A. P = `"fro"' Frobenius norm of A, `sqrt (sum (diag (a' * a)))'. If A is a vector or a scalar: P = `Inf' `max (abs (a))'. P = `-Inf' `min (abs (a))'. other p-norm of A, `(sum (abs (a) .^ p)) ^ (1/p)'. `null (A, TOL)' Returns an orthonormal basis of the null space of A. The dimension of the null space is taken as the number of singular values of A not greater than TOL. If the argument TOL is missing, it is computed as max (size (a)) * max (svd (a)) * eps `orth (A, TOL)' Returns an orthonormal basis of the range of A. The dimension of the range space is taken as the number of singular values of A greater than TOL. If the argument TOL is missing, it is computed as max (size (a)) * max (svd (a)) * eps `pinv (X, TOL)' Returns the pseudoinverse of X. Singular values less than TOL are ignored. If the second argument is omitted, it is assumed that tol = max (size (X)) * sigma_max (X) * eps, where `sigma_max (X)' is the maximal singular value of X. `rank (A, TOL)' Compute the rank of A, using the singular value decomposition. The rank is taken to be the number of singular values of A that are greater than the specified tolerance TOL. If the second argument is omitted, it is taken to be tol = max (size (a)) * sigma (1) * eps; where `eps' is machine precision and `sigma' is the largest singular value of `a'. `trace (A)' Compute the trace of A, `sum (diag (a))'.  File: octave.info, Node: Matrix Factorizations, Next: Functions of a Matrix, Prev: Basic Matrix Functions, Up: Linear Algebra Matrix Factorizations ===================== `chol (A)' Compute the Cholesky factor, R, of the symmetric positive definite matrix A, where r' * r = a. `hess (A)' Compute the Hessenberg decomposition of the matrix A. h = hess (a) [p, h] = hess (a) The Hessenberg decomposition is usually used as the first step in an eigenvalue computation, but has other applications as well (see Golub, Nash, and Van Loan, IEEE Transactions on Automatic Control, 1979. The Hessenberg decomposition is `p * h * p' = a' where `p' is a square unitary matrix (`p' * p = I', using complex-conjugate transposition) and `h' is upper Hessenberg (`i >= j+1 => h (i, j) = 0'). `lu (A)' Compute the LU decomposition of A, using subroutines from LAPACK. The result is returned in a permuted form, according to the optional return value P. For example, given the matrix `a = [1, 2; 3, 4]', [l, u, p] = lu (a) returns l = 1.00000 0.00000 0.33333 1.00000 u = 3.00000 4.00000 0.00000 0.66667 p = 0 1 1 0 `qr (A)' Compute the QR factorization of A, using standard LAPACK subroutines. For example, given the matrix `a = [1, 2; 3, 4]', [q, r] = qr (a) returns q = -0.31623 -0.94868 -0.94868 0.31623 r = -3.16228 -4.42719 0.00000 -0.63246 The `qr' factorization has applications in the solution of least squares problems `min norm(A x - b)' for overdetermined systems of equations (i.e., `a' is a tall, thin matrix). The `qr' factorization is `q * r = a' where `q' is an orthogonal matrix and `r' is upper triangular. The permuted `qr' factorization `[q, r, pi] = qr (a)' forms the `qr' factorization such that the diagonal entries of `r' are decreasing in magnitude order. For example, given the matrix `a = [1, 2; 3, 4]', [q, r, pi] = qr(a) returns q = -0.44721 -0.89443 -0.89443 0.44721 r = -4.47214 -3.13050 0.00000 0.44721 p = 0 1 1 0 The permuted `qr' factorization `[q, r, pi] = qr (a)' factorization allows the construction of an orthogonal basis of `span (a)'. `schur' [u, s] = schur (a, opt) opt = "a", "d", or "u" s = schur (a) The Schur decomposition is used to compute eigenvalues of a square matrix, and has applications in the solution of algebraic Riccati equations in control (see `are' and `dare'). `schur' always returns `s = u' * a * u' where `u' is a unitary matrix (`u'* u' is identity) and `s' is upper triangular. The eigenvalues of `a' (and `s') are the diagonal elements of `s' If the matrix `a' is real, then the real Schur decomposition is computed, in which the matrix `u' is orthogonal and `s' is block upper triangular with blocks of size at most `2 x 2' blocks along the diagonal. The diagonal elements of `s' (or the eigenvalues of the `2 x 2' blocks, when appropriate) are the eigenvalues of `a' and `s'. The eigenvalues are optionally ordered along the diagonal according to the value of `opt'. `opt = "a"' indicates that all eigenvalues with negative real parts should be moved to the leading block of `s' (used in `are'), `opt = "d"' indicates that all eigenvalues with magnitude less than one should be moved to the leading block of `s' (used in `dare'), and `opt = "u"', the default, indicates that no ordering of eigenvalues should occur. The leading `k' columns of `u' always span the `a'-invariant subspace corresponding to the `k' leading eigenvalues of `s'. `svd (A)' Compute the singular value decomposition of A a = u * sigma * v' The function `svd' normally returns the vector of singular values. If asked for three return values, it computes U, S, and V. For example, svd (hilb (3)) returns ans = 1.4083189 0.1223271 0.0026873 and [u, s, v] = svd (hilb (3)) returns u = -0.82704 0.54745 0.12766 -0.45986 -0.52829 -0.71375 -0.32330 -0.64901 0.68867 s = 1.40832 0.00000 0.00000 0.00000 0.12233 0.00000 0.00000 0.00000 0.00269 v = -0.82704 0.54745 0.12766 -0.45986 -0.52829 -0.71375 -0.32330 -0.64901 0.68867 If given a second argument, `svd' returns an economy-sized decomposition, eliminating the unnecessary rows or columns of U or V.  File: octave.info, Node: Functions of a Matrix, Prev: Matrix Factorizations, Up: Linear Algebra Functions of a Matrix ===================== `expm' expm (a) Returns the exponential of a matrix, defined as the infinite Taylor series expm(a) = I + a + a^2/2! + a^3/3! + ... The Taylor series is *not* the way to compute the matrix exponential; see Moler and Van Loan, `Nineteen Dubious Ways to Compute the Exponential of a Matrix', SIAM Review, 1978. This routine uses Ward's diagonal Pade' approximation method with three step preconditioning (SIAM Journal on Numerical Analysis, 1977). Diagonal Pade' approximations are rational polynomials of matrices -1 D (a) N (a) whose Taylor series matches the first `2q+1' terms of the Taylor series above; direct evaluation of the Taylor series (with the same preconditioning steps) may be desirable in lieu of the Pade' approximation when `Dq(a)' is ill-conditioned. `logm (A)' Compute the matrix logarithm of the square matrix A. Note that this is currently implemented in terms of an eigenvalue expansion and needs to be improved to be more robust. `sqrtm (A)' Compute the matrix square root of the square matrix A. Note that this is currently implemented in terms of an eigenvalue expansion and needs to be improved to be more robust. `kron (A, B)' Form the kronecker product of two matrices, defined block by block as x = [a(i, j) b] `qzhess (A, B)' Compute the Hessenberg-triangular decomposition of the matrix pencil `(a, b)'. This function returns `aa = q * a * z', `bb = q * b * z', `q', `z' orthogonal. For example, [aa, bb, q, z] = qzhess (a, b) The Hessenberg-triangular decomposition is the first step in Moler and Stewart's QZ decomposition algorithm. (The QZ decomposition will be included in a later release of Octave.) Algorithm taken from Golub and Van Loan, `Matrix Computations, 2nd edition'. `qzval (A, B)' Compute generalized eigenvalues. `syl (A, B, C)' Solve the Sylvester equation A X + X B + C = 0 using standard LAPACK subroutines.  File: octave.info, Node: Polynomial Manipulations, Next: Nonlinear Equations, Prev: Linear Algebra, Up: Top Polynomial Manipulations ************************ In Octave, a polynomial is represented by its coefficients (arranged in descending order). For example, a vector C of length N+1 corresponds to the following N-th order polynomial p(x) = c(1) x^n + ... + c(n) x + c(n+1). `compan (C)' Compute the companion matrix corresponding to polynomial coefficient vector C. The companion matrix is _ _ | -c(2)/c(1) -c(3)/c(1) ... -c(n)/c(1) -c(n+1)/c(1) | | 1 0 ... 0 0 | | 0 1 ... 0 0 | A = | . . . . . | | . . . . . | | . . . . . | |_ 0 0 ... 1 0 _| The eigenvalues of the companion matrix are equal to the roots of the polynomial. `conv (A, B)' Convolve two vectors. `y = conv (a, b)' returns a vector of length equal to `length (a) + length (b) - 1'. If A and B are polynomial coefficient vectors, `conv' returns the coefficients of the product polynomial. `deconv (Y, A)' Deconvolve two vectors. `[b, r] = deconv (y, a)' solves for B and R such that `y = conv (a, b) + r'. If Y and A are polynomial coefficient vectors, B will contain the coefficients of the polynomial quotient and R will be a remander polynomial of lowest order. `poly (A)' If A is a square N-by-N matrix, `poly (A)' is the row vector of the coefficients of `det (z * eye (n) - a)', the characteristic polynomial of A. If X is a vector, `poly (X)' is a vector of coefficients of the polynomial whose roots are the elements of X. `polyderiv (C)' Returns the coefficients of the derivative of the polynomial whose coefficients are given by vector C. `polyinteg (C)' Returns the coefficients of the integral the polynomial whose coefficients are represented by the vector C. The constant of integration is set to zero. `polyreduce (C)' Reduces a polynomial coefficient vector to a minimum number of terms by stripping off any leading zeros. `polyval (C, X)' Evaluate a polynomial. `polyval (C, X)' will evaluate the polynomial at the specified value of X. If X is a vector or matrix, the polynomial is evaluated at each of the elements of X. `polyvalm (C, X)' Evaluate a polynomial in the matrix sense. `polyvalm (C, X)' will evaluate the polynomial in the matrix sense, i.e. matrix multiplication is used instead of element by element multiplication as is used in polyval. The argument X must be a square matrix. `residue (B, A, TOL)' If B and A are vectors of polynomial coefficients, then residue calculates the partial fraction expansion corresponding to the ratio of the two polynomials. The function `residue' returns R, P, K, and E, where the vector R contains the residue terms, P contains the pole values, K contains the coefficients of a direct polynomial term (if it exists) and E is a vector containing the powers of the denominators in the partial fraction terms. Assuming B and A represent polynomials P (s) and Q(s) we have: P(s) M r(m) N ---- = SUM ------------- + SUM k(n)*s^(N-n) Q(s) m=1 (s-p(m))^e(m) n=1 where M is the number of poles (the length of the R, P, and E vectors) and N is the length of the K vector. The argument TOL is optional, and if not specified, a default value of 0.001 is assumed. The tolerance value is used to determine whether poles with small imaginary components are declared real. It is also used to determine if two poles are distinct. If the ratio of the imaginary part of a pole to the real part is less than TOL, the imaginary part is discarded. If two poles are farther apart than TOL they are distinct. For example, Example: b = [1, 1, 1]; a = [1, -5, 8, -4]; [r, p, k, e] = residue (b, a) returns r = [-2, 7, 3] p = [2, 2, 1] k = [](0x0) e = [1, 2, 1] which implies the following partial fraction expansion s^2 + s + 1 -2 7 3 ------------------- = ----- + ------- + ----- s^3 - 5s^2 + 8s - 4 (s-2) (s-2)^2 (s-1) `roots (V)' For a vector V with N components, return the roots of the polynomial v(1) * z^(n-1) + ... + v(n-1) * z + v(n).  File: octave.info, Node: Nonlinear Equations, Next: Differential Equations, Prev: Polynomial Manipulations, Up: Top Nonlinear Equations ******************* Octave can solve sets of nonlinear equations of the form F (x) = 0 using the function `fsolve', which is based on the MINPACK subroutine `hybrd'. For example, to solve the set of equations -2x^2 + 3xy + 4 sin(y) = 6 3x^2 - 2xy^2 + 3 cos(x) = -4 you first need to write a function to compute the value of the given function. For example: function y = f (x) y(1) = -2*x(1)^2 + 3*x(1)*x(2) + 4*sin(x(2)) - 6; y(2) = 3*x(1)^2 - 2*x(1)*x(2)^2 + 3*cos(x(1)) + 4; endfunction Then, call `fsolve' with a specified initial condition to find the roots of the system of equations. For example, given the function `f' defined above, [x, info] = fsolve ("f", [1; 2]) results in the solution x = 0.57983 2.54621 info = 1 A value of `info = 1' indicates that the solution has converged. The function `perror' may be used to print English messages corresponding to the numeric error codes. For example, perror ("fsolve", 1) prints solution converged to requested tolerance Tolerances and other options for `fsolve' may be specified using the function `fsolve_options'.  File: octave.info, Node: Differential Equations, Next: Optimization, Prev: Nonlinear Equations, Up: Top Differential Equations ********************** Octave has two built-in functions for solving differential equations. Both are based on reliable ODE solvers written in Fortran. * Menu: * Ordinary Differential Equations:: * Differential-Algebraic Equations::  File: octave.info, Node: Ordinary Differential Equations, Next: Differential-Algebraic Equations, Prev: Differential Equations, Up: Differential Equations Ordinary Differential Equations =============================== The function `lsode' can be used Solve ODEs of the form dx -- = f (x, t) dt using Hindmarsh's ODE solver LSODE. lsode (FCN, X0, T_OUT, T_CRIT) The first argument is the name of the function to call to compute the vector of right hand sides. It must have the form XDOT = f (X, T) where XDOT and X are vectors and T is a scalar. The second argument specifies the initial condition, and the third specifies a vector of output times at which the solution is desired, including the time corresponding to the initial condition. The fourth argument is optional, and may be used to specify a set of times that the ODE solver should not integrate past. It is useful for avoiding difficulties with singularities and points where there is a discontinuity in the derivative. Tolerances and other options for `lsode' may be specified using the function `lsode_options'. Here is an example of solving a set of two differential equations using `lsode'. The function function xdot = f (x, t) r = 0.25; k = 1.4; a = 1.5; b = 0.16; c = 0.9; d = 0.8; xdot(1) = r*x(1)*(1 - x(1)/k) - a*x(1)*x(2)/(1 + b*x(1)); xdot(2) = c*a*x(1)*x(2)/(1 + b*x(1)) - d*x(2); endfunction is integrated with the command x = lsode ("f", [1; 2], (t = linspace (0, 50, 200)')); producing a set of 200 values stored in the variable X. Note that this example takes advantage of the fact that an assignment produces a value to store the values of the output times in the variable T directly in the function call The results can then be plotted using the command plot (t, x) See Alan C. Hindmarsh, `ODEPACK, A Systematized Collection of ODE Solvers', in Scientific Computing, R. S. Stepleman, editor, (1983) for more information about this family of ODE solvers. octave-1.1.0/doc/octave.info-5100666 415 17 125172 5705317773 14272 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Differential-Algebraic Equations, Prev: Ordinary Differential Equations, Up: Differential Equations Differential-Algebraic Equations ================================ The function `dassl' can be used Solve DAEs of the form 0 = f (x-dot, x, t), x(t=0) = x_0, x-dot(t=0) = x-dot_0 dassl (FCN, X_0, XDOT_0, T_OUT, T_CRIT) The first argument is the name of the function to call to compute the vector of residuals. It must have the form RES = f (X, XDOT, T) where X, XDOT, and RES are vectors, and T is a scalar. The second and third arguments to `dassl' specify the initial condition of the states and their derivatives, and the fourth argument specifies a vector of output times at which the solution is desired, including the time corresponding to the initial condition. The set of initial states and derivatives are not strictly required to be consistent. In practice, however, DASSL is not very good at determining a consistent set for you, so it is best if you ensure that the initial values result in the function evaluating to zero. The fifth argument is optional, and may be used to specify a set of times that the DAE solver should not integrate past. It is useful for avoiding difficulties with singularities and points where there is a discontinuity in the derivative. Tolerances and other options for `dassl' may be specified using the function `dassl_options'. See K. E. Brenan, et al., `Numerical Solution of Initial-Value Problems in Differential-Algebraic Equations', North-Holland (1989) for more information about the implementation of DASSL.  File: octave.info, Node: Optimization, Next: Quadrature, Prev: Differential Equations, Up: Top Optimization ************ * Menu: * Quadratic Programming:: * Nonlinear Programming:: * Linear Least Squares::  File: octave.info, Node: Quadratic Programming, Next: Nonlinear Programming, Prev: Optimization, Up: Optimization Quadratic Programming ===================== `qpsol' [x, obj, info, lambda] = qpsol (x, H, c, lb, ub, lb, A, ub) Solve quadratic programs using Gill and Murray's QPSOL. Because QPSOL is not freely redistributable, this function is only available if you have obtained your own copy of QPSOL. *Note Installation::. Tolerances and other options for `qpsol' may be specified using the function `qpsol_options'.  File: octave.info, Node: Nonlinear Programming, Next: Linear Least Squares, Prev: Quadratic Programming, Up: Optimization Nonlinear Programming ===================== `npsol' [x, obj, info, lambda] = npsol (x, 'phi', lb, ub, lb, A, ub, lb, 'g', ub) Solve nonlinear programs using Gill and Murray's NPSOL. Because NPSOL is not freely redistributable, this function is only available if you have obtained your own copy of NPSOL. *Note Installation::. The second argument is a string containing the name of the objective function to call. The objective function must be of the form y = phi (x) where x is a vector and y is a scalar. Tolerances and other options for `npsol' may be specified using the function `npsol_options'.  File: octave.info, Node: Linear Least Squares, Prev: Nonlinear Programming, Up: Optimization Linear Least Squares ==================== `gls (Y, X, O)' Generalized least squares (GLS) estimation for the multivariate model Y = X * B + E, mean(E) = 0, cov(vec(E)) = (s^2)*O with Y an T x p matrix X an T x k matrix B an k x p matrix E an T x p matrix O an Tp x Tp matrix Each row of Y and X is an observation and each column a variable. Returns BETA, v, and, R, where BETA is the GLS estimator for B, v is the GLS estimator for s^2, and R = Y - X*BETA is the matrix of GLS residuals. `ols (Y, X)' Ordinary Least Squares (OLS) estimation for the multivariate model Y = X*B + E, mean (E) = 0, cov (vec (E)) = kron (S, I) with Y an T x p matrix X an T x k matrix B an k x p matrix E an T x p matrix Each row of Y and X is an observation and each column a variable. Returns BETA, SIGMA, and R, where BETA is the OLS estimator for B, i.e. BETA = pinv(X)*Y, where pinv(X) denotes the pseudoinverse of X, SIGMA is the OLS estimator for the matrix S, i.e. SIGMA = (Y - X*BETA)'*(Y - X*BETA) / (T - rank(X)) and R = Y - X*BETA is the matrix of OLS residuals.  File: octave.info, Node: Quadrature, Next: Control Theory, Prev: Optimization, Up: Top Quadrature ********** * Menu: * Functions of one Variable:: * Orthogonal Collocation::  File: octave.info, Node: Functions of one Variable, Next: Orthogonal Collocation, Prev: Quadrature, Up: Quadrature Functions of one Variable ========================= `quad' [v, ier, nfun] = quad ("f", a, b) [v, ier, nfun] = quad ("f", a, b, tol) [v, ier, nfun] = quad ("f", a, b, tol, sing) Integrate a nonlinear function of one variable using Quadpack. Where the first argument is the name of the function to call to compute the value of the integrand. It must have the form y = f (x) where y and x are scalars. The second and third arguments are limits of integration. Either or both may be infinite. The optional argument tol specifies the desired accuracy of the result. The optional argument SING is a vector of values at which the integrand is singular. Tolerances and other options for `quad' may be specified using the function `quad_options'.  File: octave.info, Node: Orthogonal Collocation, Prev: Functions of one Variable, Up: Quadrature Orthogonal Collocation ====================== `colloc' [r, A, B, q] = colloc (n) [r, A, B, q] = colloc (n, "left") [r, A, B, q] = colloc (n, "left", "right") Compute derivative and integral weight matrices for orthogonal collocation using the subroutines given in J. Michelsen and M. L. Villadsen, `Solution of Differential Equation Models by Polynomial Approximation'.  File: octave.info, Node: Control Theory, Next: Signal Processing, Prev: Quadrature, Up: Top Control Theory ************** `abcddim (A, B, C, D)' Check for compatibility of the dimensions of the matrices defining the linear system [A, B, C, D] corresponding to dx/dt = a x + b u y = c x + d u or a similar discrete-time system. If the matrices are compatibly dimensioned, then `abcddim' returns N = number of system states, M = number of system inputs, and P = number of system outputs. Otherwise `abcddim' returns N = M = P = -1. `are (A, B, C, OPT)' Returns the solution, X, of the algebraic Riccati equation a' x + x a - x b x + c = 0 for identically dimensioned square matrices A, B, C. If B (C) is not square, then the function attempts to use `B*B'' (`C'*C') instead. Solution method: apply Laub's Schur method (IEEE Transactions on Automatic Control, 1979) to the appropriate Hamiltonian matrix. OPT is an option passed to the eigenvalue balancing routine. Default is `"B"'. `c2d (A, B, T)' Converts the continuous time system described by: dx/dt = a x + b u into a discrete time equivalent model x[k+1] = Ad x[k] + Bd u[k] via the matrix exponential assuming a zero-order hold on the input and sample time T. `dare (A, B, C, R, OPT)' Returns the solution, X of the discrete-time algebraic Riccati equation a' x a - x + a' x b (r + b' x b)^(-1) b' x a + c = 0 for matrices with dimensions: A: N by N B: N by M C: N by N, symmetric positive semidefinite R: M by M, symmetric positive definite (invertible) If C is not square, then the function attempts to use `C'*C' instead. Solution method: Laub's Schur method (IEEE Transactions on Automatic Control, 1979) is applied to the appropriate symplectic matrix. See also: Ran and Rodman, `Stable Hermitian Solutions of Discrete Algebraic Riccati Equations', Mathematics of Control, Signals and Systems, Volume 5, Number 2 (1992). OPT is an option passed to the eigenvalue balancing routine. The default is `"B"'. `dgram (A, B)' Returns the discrete controllability and observability gramian for the discrete time system described by x[k+1] = A x[k] + B u[k] y[k] = C x[k] + D u[k] `dgram (A, B)' returns the discrete controllability gramian and `dgram (A', C')' returns the observability gramian. `dlqe (A, G, C, SIGW, SIGV [, Z])' Linear quadratic estimator (Kalman filter) design for the discrete time system x[k+1] = A x[k] + B u[k] + G w[k] y[k] = C x[k] + D u[k] + w[k] where W, V are zero-mean gaussian noise processes with respective intensities `SIGW = cov (W, W)' and `SIGV = cov (V, V)'. If specified, Z is `cov (W, V)'. Otherwise `cov (W, V) = 0'. The observer structure is z[k+1] = A z[k] + B u[k] + k(y[k] - C z[k] - D u[k]) Returns: L is the observer gain, `(A - A L C)' is stable. M is the Ricatti equation solution. P is the estimate error covariance after the measurement update. E are the closed loop poles of `(A - A L C)'. `dlqr (A, B, Q, R [, Z])' Linear quadratic regulator design for the discrete time system x[k+1] = A x[k] + B u[k] to minimize the cost functional J = Sum [ x' Q x + u' R u ], Z omitted or J = Sum [ x' Q x + u' R u +2 x' Z u ], Z included Returns: K is the state feedback gain, `(A - B K)' is stable. P is the solution of algebraic Riccati equation. E are the closed loop poles of (A - B K). `dlyap (A, B)' Solve the discrete-time Lyapunov equation a x a' - x + b = 0 for square matrices A, B. If B is not square, then the function attempts to solve either a x a' - x + b b' = 0 or a' x a - x + b' b = 0 whichever is appropriate. Uses Schur decomposition method as in Kitagawa, International Journal of Control (1977); column-by-column solution method as suggested in Hammarling, IMA Journal of Numerical Analysis, (1982). `is_controllable (A, B, TOL)' If the pair (a, b) is controllable, then return value 1. Otherwise, returns a value of 0. TOL is a roundoff parameter, set to `2*eps' if omitted. Currently just constructs the controllability matrix and checks rank. A better method is as follows (Boley and Golub, Systems and Control Letters, 1984): Controllability is determined by applying Arnoldi iteration with complete re-orthogonalization to obtain an orthogonal basis of the Krylov subspace n-1 span ([b, a*b, ..., a^ *b]). `is_observable (A, C, TOL)' Returns 1 if the pair `(a, c)' is observable. Otherwise, returns a value of 0. `lqe (A, G, C, SIGW, SIGV, Z)' [k, p, e] = lqe (a, g, c, sigw, sigv, z) Linear quadratic estimator (Kalman filter) design for the continuous time system dx -- = a x + b u dt y = c x + d u where W, V are zero-mean gaussian noise processes with respective intensities sigw = cov (w, w) sigv = cov (v, v) Z (if specified) is the cross-covariance `cov (W, V)'; the default value is `cov (W, V) = 0'. Observer structure is `dz/dt = A z + B u + k (y - C z - D u)' returns: K is observer gain: `(A - K C)' is stable. P is solution of algebraic Riccati equation. E is the vector of closed loop poles of `(A - K C)'. `lqr (A, B, Q, R, Z)' `[K, P, E] = lqr (A, B, Q, R, Z)' Linear quadratic regulator design for the continuous time system dx -- = A x + B u dt to minimize the cost functional infinity / J = | x' Q x + u' R u / t=0 Z omitted or infinity / J = | x' Q x + u' R u + 2 x' Z u / t=0 Z included Returns: K is state feedback gain: `(A - B K)' is stable. P is the stabilizing solution of appropriate algebraic Riccati equation. E is the vector of the closed loop poles of `(A - B K)'. `lyap (A, B, C)' Solve the Lyapunov (or Sylvester) equation via the Bartels-Stewart algorithm (Communications of the ACM, 1972). If `(a, b, c)' are specified, then `lyap' returns the solution of the Sylvester equation a x + x b + c = 0 If only `(a, b)' are specified, then `lyap' returns the solution of the Lyapunov equation a' x + x a + b = 0 If B is not square, then `lyap' returns the solution of either a' x + x a + b' b = 0 or a x + x a' + b b' = 0 whichever is appropriate. Solves by using the Bartels-Stewart algorithm (1972). `tzero (A, B, C, D, BAL)' Compute the transmission zeros of [A, B, C, D]. BAL = balancing option (see balance); default is `"B"'. Needs to incorporate `mvzero' algorithm to isolate finite zeros; see Hodel, `Computation of System Zeros with Balancing', Linear Algebra and its Applications, July 1993.  File: octave.info, Node: Signal Processing, Next: Sets, Prev: Control Theory, Up: Top Signal Processing ***************** I hope that someday Octave will include more signal processing functions. If you would like to help improve Octave in this area, please contact `bug-octave@che.utexas.edu'. `fft (A)' Compute the FFT of A using subroutines from FFTPACK. `fft2 (A)' Compute the two dimensional FFT of A. `fftconv (A, B, N)' This function returns the convolution of the vectors A and B, a vector with length equal to the `length (a) + length (b) - 1'. If A and B are the coefficient vectors of two polynomials, the returned value is the coefficient vector of the product polynomial. The computation uses the FFT by calling the function `fftfilt'. If the optional argument N is specified, an N-point FFT is used. `fftfilt (B, X, N)' With two arguments, `fftfilt' filters X with the FIR filter B using the FFT. Given the optional third argument, N, `fftfilt' uses the overlap-add method to filter X with B using an N-point FFT. `filter (B, A, X)' This function returns the solution to the following linear, time-invariant difference equation: N M SUM a(k+1) y(n-k) + SUM b(k+1) x(n-k) = 0 for 1<=n<=length(x) k=0 k=0 where N=length(a)-1 and M=length(b)-1. An equivalent form of this equation is: N M y(n) = SUM c(k+1) y(n-k) + SUM d(k+1) x(n-k) for 1<=n<=length(x) k=1 k=0 where c = a/a(1) and d = b/a(1). In terms of the z-transform, y is the result of passing the discrete- time signal x through a system characterized by the following rational system function: M SUM d(k+1) z^(-k) k=0 H(z) = ---------------------- N 1 + SUM c(k+1) z(-k) k=1 When called as [y, sf] = filter (b, a, x, si) `filter' uses the argument SI as the initial state of the system and and returns the final state in SF. The state vector is a column vector whose length is equal to the length of the longest coefficient vector minus one. If SI is not set, the initial state vector is set to all zeros. `freqz' Compute the frequency response of a filter. `[H, W] = freqz (B)' returns the complex frequency response H of the FIR filter with coefficients B. The response is evaluated at 512 angular frequencies between 0 and pi. The output value W is a vector containing the 512 frequencies. `[H, W] = freqz (B, A)' returns the complex frequency response of the rational IIR filter whose numerator has coefficients B and denominator coefficients A. `[H, W] = freqz (B, A, N)' returns the response evaluated at N angular frequencies. For fastest computation n should factor into a small number of small primes. `[H, W] = freqz (B, A, N, "whole")' evaluates the response at n frequencies between 0 and 2*pi. `ifft (A)' Compute the inverse FFT of A using subroutines from FFTPACK. `ifft2' Compute the two dimensional inverse FFT of A. `sinc (X)' Returns sin(pi*x)/(pi*x).  File: octave.info, Node: Sets, Next: Statistics, Prev: Signal Processing, Up: Top Sets **** Octave has a limited set of functions for managing sets of data, where a set is defined as a collection unique elements. Given a matrix or vector of values, the function `create_set' returns a row vector containing unique values, sorted in ascending order. For example, `create_set ([1, 2; 3, 4; 4, 2])' returns the vector `[1, 2, 3, 4]'. The functions `union' and `intersection' take two sets as arguments and return the union and interection, respectively. For example, `union ([1, 2, 3], [2, 3, 5])' returns the vector `[1, 2, 5]'. The function `complement (A, B)' returns the elements of set B that are not in set A. For example, `complement ([1, 2, 3], [2, 3, 5])' returns the value `5'.  File: octave.info, Node: Statistics, Next: Plotting, Prev: Sets, Up: Top Statistics ********** I hope that someday Octave will include more statistics functions. If you would like to help improve Octave in this area, please contact `bug-octave@che.utexas.edu'. `corrcoef (X [, Y])' If each row of X and Y is an observation and each column is a variable, the (i,j)-th entry of `corrcoef (X, Y)' is the correlation between the i-th variable in X and the j-th variable in Y. If invoked with one argument, compute `corrcoef (X, X)'. `cov (X [, Y])' If each row of X and Y is an observation and each column is a variable, the (i,j)-th entry of `cov (X, Y)' is the covariance between the i-th variable in X and the j-th variable in Y. If invoked with one argument, compute `cov (X, X)'. `kurtosis (X)' If X is a vector of length N, return the kurtosis kurtosis(x) = N^(-1) std(x)^(-4) SUM_i (x(i)-mean(x))^4 - 3 of X. If X is a matrix, return the row vector containing the kurtosis of each column. `mahalanobis (X, Y)' Returns Mahalanobis' D-square distance between the multivariate samples X and Y, which must have the same number of components (columns), but may have a different number of observations (rows). `mean (A)' If A is a vector, compute the mean of the elements of A. If A is a matrix, compute the mean for each column and return them in a row vector. `median (A)' If A is a vector, compute the median value of the elements of A. If A is a matrix, compute the median value for each column and return them in a row vector. `skewness (X)' If X is a vector of length N, return the skewness skewness (x) = N^(-1) std(x)^(-3) SUM_i (x(i)-mean(x))^3 of X. If X is a matrix, return the row vector containing the skewness of each column. `std (A)' If A is a vector, compute the standard deviation of the elements of A. If A is a matrix, compute the standard deviation for each column and return them in a row vector.  File: octave.info, Node: Plotting, Next: Image Processing, Prev: Statistics, Up: Top Plotting ******** All of Octave's plotting functions use `gnuplot' to handle the actual graphics. There are two low-level functions, `gplot' and `gsplot', that behave almost exactly like the corresponding `gnuplot' functions `plot' and `splot'. A number of other higher level plotting functions, patterned after the graphics functions found in MATLAB version 3.5, are also available. These higher level functions are all implemented in terms of the two low-level plotting functions. * Menu: * Two-Dimensional Plotting:: * Three-Dimensional Plotting:: * Miscellaneous Plotting Functions::  File: octave.info, Node: Two-Dimensional Plotting, Next: Three-Dimensional Plotting, Prev: Plotting, Up: Plotting Two-Dimensional Plotting ======================== The syntax for Octave's two-dimensional plotting function, `gplot', is gplot RANGES EXPRESSION USING TITLE STYLE where the RANGES, USING, TITLE, and STYLE arguments are optional, and the USING, TITLE and STYLE qualifiers may appear in any order after the expression. You may plot multiple expressions with a single command by separating them with commas. Each expression may have its own set of qualifiers. The optional item RANGES has the syntax [ x_lo : x_up ] [ y_lo : y_up ] and may be used to specify the ranges for the axes of the plot, independent of the actual range of the data. The range for the y axes and any of the individual limits may be omitted. A range `[:]' indicates that the default limits should be used. This normally means that a range just large enough to include all the data points will be used. The expression to be plotted must not contain any literal matrices (e.g. `[ 1, 2; 3, 4 ]') since it is nearly impossible to distinguish a plot range from a matrix of data. See the help for `gnuplot' for a description of the syntax for the optional items. By default, the `gplot' command plots the second column of a matrix versus the first. If the matrix only has one column, it is taken as a vector of y-coordinates and the x-coordinate is taken as the element index, starting with zero. For example, gplot rand (100,1) with linespoints will plot 100 random values and connect them with lines. When `gplot' is used to plot a column vector, the indices of the elements are taken as x values. If there are more than two columns, you can choose which columns to plot with the USING qualifier. For example, given the data x = (-10:0.1:10)'; data = [x, sin(x), cos(x)]; the command gplot [-11:11] [-1.1:1.1] data with lines, data using 1:3 with impulses will plot two lines. The first line is generated by the command `data with lines', and is a graph of the sine function over the range -10 to 10. The data is taken from the first two columns of the matrix because columns to plot were not specified with the USING qualifier. The clause `using 1:3' in the second part of this plot command specifies that the first and third columns of the matrix `data' should be taken as the values to plot. In this example, the ranges have been explicitly specified to be a bit larger than the actual range of the data so that the curves do not touch the border of the plot. In addition to the basic plotting commands, the whole range of `set' and `show' commands from `gnuplot' are available, as is `replot'. The `set' and `show' commands allow you to set and show `gnuplot' parameters. For more information about the set and show commands, see the `gnuplot' user's guide (also available on line if you run `gnuplot' directly, instead of running it from Octave). The `replot' command allows you to force the plot to be redisplayed. This is useful if you have changed something about the plot, such as the title or axis labels. The `replot' command also accepts the same arguments as `gplot' or `gsplot' (except for data ranges) so you can add additional lines to existing plots. For example, set term tek40 set output "/dev/plotter" set title "sine with lines and cosine with impulses" replot "sin (x) w l" will change the terminal type for plotting, add a title to the current plot, add a graph of sin (x) to the plot, and force the new plot to be sent to the plot device. This last step is normally required in order to update the plot. This default is reasonable for slow terminals or hardcopy output devices because even when you are adding additional lines with a replot command, gnuplot always redraws the entire plot, and you probably don't want to have a completely new plot generated every time something as minor as an axis label changes. Since this may not matter as much on faster terminals, you can tell Octave to redisplay the plot each time anything about it changes by setting the value of the builtin variable `automatic_replot' to the value `"true"'. Note that NaN values in the plot data are automatically omitted, and Inf values are converted to a very large value before calling gnuplot. The MATLAB-style two-dimensional plotting commands are: `plot (ARGS)' This function produces two-dimensional plots. Many different combinations of arguments are possible. The simplest form is plot (y) where the argument is taken as the set of Y coordinates and the X coordinates are taken to be the indices of the elements, starting with 1. If more than one argument is given, they are interpreted as plot (x [, y] [, fmt] ...) where Y and FMT are optional, and any number of argument sets may appear. The X and Y values are interpreted as follows: * If a single data argument is supplied, it is taken as the set of Y coordinates and the X coordinates are taken to be the indices of the elements, starting with 1. * If the first argument is a vector and the second is a matrix, the the vector is plotted versus the columns (or rows) of the matrix. (using whichever combination matches, with columns tried first.) * If the first argument is a matrix and the second is a vector, the the columns (or rows) of the matrix are plotted versus the vector. (using whichever combination matches, with columns tried first.) * If both arguments are vectors, the elements of Y are plotted versus the elements of X. * If both arguments are matrices, the columns of Y are plotted versus the columns of X. In this case, both matrices must have the same number of rows and columns and no attempt is made to transpose the arguments to make the number of rows match. If both arguments are scalars, a single point is plotted. The FMT argument, if present is intrepreted as follows. If FMT is missing, the default gnuplot line style is assumed. `-' Set lines plot style (default). `.' Set dots plot style. `@' Set points plot style. `-@' Set linespoints plot style. `^' Set impulses plot style. `L' Set steps plot style. `#' Set boxes plot style. `~' Set errorbars plot style. `#~' Set boxerrorbars plot style. `n' Interpreted as the plot color if N is an integer in the range 1 to 6. `nm' If NM is a two digit integer and M is an integer in the range 1 to 6, M is interpreted as the point style. This is only valid in combination with the `@' or `-@' specifiers. `c' If C is one of "R", "G", "B", "M", "C", or "W", it is interpreted as the plot color (red, green, blue, magenta, cyan, or white). `+' `*' `o' `x' Used in combination with the points or linespoints styles, set the point style. The color line styles have the following meanings on terminals that support color. Number Gnuplot colors (lines)points style 1 red * 2 green + 3 blue o 4 magenta x 5 cyan house 6 brown there exists Here are some plot examples: plot (x, y, "@12", x, y2, x, y3, "4", x, y4, "+") This command will plot Y with points of type 2 (displayed as `+') and color 1 (red), Y2 with lines, Y3 with lines of color 4 (magenta) and Y4 with points displayed as `+'. plot (b, "*") This command will plot the data in B will be plotted with points displayed as `*'. `hold' Tell Octave to `hold' the current data on the plot when executing subsequent plotting commands. This allows you to execute a series of plot commands and have all the lines end up on the same figure. The default is for each new plot command to clear the plot device first. For example, the command hold on turns the hold state on. An argument of `off' turns the hold state off, and `hold' with no arguments toggles the current hold state. `ishold' Returns 1 if the next line will be added to the current plot, or 0 if the plot device will be cleared before drawing the next line. `loglog (ARGS)' Make a two-dimensional plot using log scales for both axes. See the description of `plot' above for a description of the arguments that `loglog' will accept. `semilogx (ARGS)' Make a two-dimensional plot using a log scale for the X axis. See the description of `plot' above for a description of the arguments that `semilogx' will accept. `semilogy (ARGS)' Make a two-dimensional plot using a log scale for the Y axis. See the description of `plot' above for a description of the arguments that `semilogy' will accept. `contour (Z, N, X, Y)' Make a contour plot of the three-dimensional surface described by Z. Someone needs to improve `gnuplot''s contour routines before this will be very useful. `polar (THETA, RHO)' Make a two-dimensional plot given polar the coordinates THETA and RHO.  File: octave.info, Node: Three-Dimensional Plotting, Next: Miscellaneous Plotting Functions, Prev: Two-Dimensional Plotting, Up: Plotting Three-Dimensional Plotting ========================== The syntax for Octave's three-dimensional plotting function, `gsplot', is gsplot RANGES EXPRESSION USING TITLE STYLE where the RANGES, USING, TITLE, and STYLE arguments are optional, and the USING, TITLE and STYLE qualifiers may appear in any order after the expression. You may plot multiple expressions with a single command by separating them with commas. Each expression may have its own set of qualifiers. The optional item RANGES has the syntax [ x_lo : x_up ] [ y_lo : y_up ] [ z_lo : z_up ] and may be used to specify the ranges for the axes of the plot, independent of the actual range of the data. The range for the y and z axes and any of the individual limits may be omitted. A range `[:]' indicates that the default limits should be used. This normally means that a range just large enough to include all the data points will be used. The expression to be plotted must not contain any literal matrices (e.g. `[ 1, 2; 3, 4 ]') since it is nearly impossible to distinguish a plot range from a matrix of data. See the help for `gnuplot' for a description of the syntax for the optional items. By default, the `gsplot' command plots each column of the expression as the z value, using the row index as the x value, and the column index as the y value. The indices are counted from zero, not one. For example, gsplot rand (5, 2) will plot a random surface, with the x and y values taken from the row and column indices of the matrix. If parametric plotting mode is set (using the command `set parametric', then `gsplot' takes the columns of the matrix three at a time as the x, y and z values that define a line in three space. Any extra columns are ignored, and the x and y values are expected to be sorted. For example, with `parametric' set, it makes sense to plot a matrix like 1 1 3 2 1 6 3 1 9 1 2 2 2 2 5 3 2 8 1 3 1 2 3 4 3 3 7 but not `rand (5, 30)'. The MATLAB-style three-dimensional plotting commands are: `mesh (X, Y, Z)' Plot a mesh given matrices `x', and Y from `meshdom' and a matrix Z corresponding to the X and Y coordinates of the mesh. `meshdom (X, Y)' Given vectors of X and Y coordinates, return two matrices corresponding to the X and Y coordinates of the mesh. See the file `sombrero.m' for an example of using `mesh' and `meshdom'.  File: octave.info, Node: Miscellaneous Plotting Functions, Prev: Three-Dimensional Plotting, Up: Plotting Miscellaneous Plotting Functions ================================ `bar (X, Y)' Given two vectors of x-y data, `bar' produces a bar graph. If only one argument is given, it is taken as a vector of y-values and the x coordinates are taken to be the indices of the elements. If two output arguments are specified, the data are generated but not plotted. For example, bar (x, y); and [xb, yb] = bar (x, y); plot (xb, yb); are equivalent. `grid' For two-dimensional plotting, force the display of a grid on the plot. `stairs (X, Y)' Given two vectors of x-y data, bar produces a `stairstep' plot. If only one argument is given, it is taken as a vector of y-values and the x coordinates are taken to be the indices of the elements. If two output arguments are specified, the data are generated but not plotted. For example, stairs (x, y); and [xs, ys] = stairs (x, y); plot (xs, ys); are equivalent. `title (STRING)' Specify a title for the plot. If you already have a plot displayed, use the command `replot' to redisplay it with the new title. `xlabel (STRING)' `ylabel (STRING)' Specify x and y axis labels for the plot. If you already have a plot displayed, use the command `replot' to redisplay it with the new labels. `sombrero (N)' Display a classic three-dimensional mesh plot. The parameter N allows you to increase the resolution. `clearplot' `clg' Clear the plot window and any titles or axis labels. The name `clg' is aliased to `clearplot' for compatibility with MATLAB. The commands `gplot clear', `gsplot clear', and `replot clear' are equivalent to `clearplot'. (Previously, commands like `gplot clear' would evaluate `clear' as an ordinary expression and clear all the visible variables.) `closeplot' Close stream to the `gnuplot' subprocess. If you are using X11, this will close the plot window. `purge_tmp_files' Delete the temporary files created by the plotting commands. Octave creates temporary data files for `gnuplot' and then sends commands to `gnuplot' through a pipe. Octave will delete the temporary files on exit, but if you are doing a lot of plotting you may want to clean up in the middle of a session. A future version of Octave will eliminate the need to use temporary files to hold the plot data. `axis (LIMITS)' Sets the axis limits for plots. The argument LIMITS should be a 2, 4, or 6 element vector. The first and second elements specify the lower and upper limits for the x axis. The second and third specify the limits for the y axis, and the fourth and fifth specify the limits for the z axis. With no arguments, `axis' turns autoscaling on. If your plot is already drawn, then you need to use `replot' before the new axis limits will take effect. You can get this to happen automatically by setting the built-in variable `automatic_replot' to `"true"'. *Note User Preferences::. `hist (Y, X)' Produce histogram counts or plots. With one vector input argument, plot a histogram of the values with 10 bins. The range of the histogram bins is determined by the range of the data. Given a second scalar argument, use that as the number of bins. Given a second vector argument, use that as the centers of the bins, with the width of the bins determined from the adjacent values in the vector. Extreme values are lumped in the first and last bins. With two output arguments, produce the values NN and XX such that `bar (XX, NN)' will plot the histogram.  File: octave.info, Node: Image Processing, Next: Input and Output, Prev: Plotting, Up: Top Image Processing **************** To display images using these functions, you must be using Octave with the X Window System, and you must have either `xloadimage' or `xv' installed. You do not need to be running X in order to manipulate images, however, so some of these functions may be useful even if you are not able to view the results. `colormap' Set the current colormap. `colormap (MAP)' sets the current colormap to MAP. The color map should be an N row by 3 column matrix. The columns contain red, green, and blue intensities respectively. All entries should be between 0 and 1 inclusive. The new colormap is returned. `colormap ("default")' restores the default colormap (a gray scale colormap with 64 entries). The default colormap is returned. With no arguments, `colormap' returns the current color map. `gray (N)' Create a gray colormap with values from 0 to N. The argument N should be a scalar. If it is omitted, 64 is assumed. `gray2ind' Convert a gray scale intensity image to an Octave indexed image. `image' Display an Octave image matrix. `image (X)' displays a matrix as a color image. The elements of X are indices into the current colormap and should have values between 1 and the length of the colormap. `image (X, ZOOM)' changes the zoom factor. The default value is 4. `imagesc' Scale and display a matrix as an image. `imagesc (X)' displays a scaled version of the matrix X. The matrix is scaled so that its entries are indices into the current colormap. The scaled matrix is returned. `imagesc (X, ZOOM)' sets the magnification, the default value is 4. `imshow' Display images. `imshow (X)' displays an indexed image using the current colormap. `imshow (X, MAP)' displays an indexed image using the specified colormap. `imshow (I, N)' displays a gray scale intensity image. `imshow (R, G, B)' displays an RGB image. `ind2gray' Convert an Octave indexed image to a gray scale intensity image. `Y = ind2gray (X)' converts an indexed image to a gray scale intensity image. The current colormap is used to determine the intensities. The intensity values lie between 0 and 1 inclusive. `Y = ind2gray (X, MAP)' uses the specified colormap instead of the current one in the conversion process. `ind2rgb' Convert an indexed image to red, green, and blue color components. `[R, G, B] = ind2rgb (X)' uses the current colormap for the conversion. `[R, G, B] = ind2rgb (X, MAP)' uses the specified colormap. `loadimage' Load an image file. `[X, MAP] = loadimage (FILE)' loads an image and it's associated color map from the specified FILE. The image must be stored in Octave's image format. `ocean (N)' Create color colormap. The argument N should be a scalar. If it is omitted, 64 is assumed. `rgb2ind' Convert and RGB image to an Octave indexed image. `[X, MAP] = rgb2ind (R, G, B)' `saveimage' Save a matrix to disk in image format. `saveimage (FILE, X)' saves matrix X to FILE in Octave's image format. The current colormap is also saved in the file. `saveimage (FILE, X, "img")' saves the image in the default format and is the same as `saveimage (FILE, X)'. `saveimage (FILE, X, "ppm")' saves the image in ppm format instead of the default Octave image format. `saveimage (FILE, X, "ps")' saves the image in PostScript format instead of the default Octave image format. (Note: images saved in PostScript format can not be read back into Octave with loadimage.) `saveimage (FILE, X, FMT, MAP)' saves the image along with the specified colormap in the specified format. Note: if the colormap contains only two entries and these entries are black and white, the bitmap ppm and PostScript formats are used. If the image is a gray scale image (the entries within each row of the colormap are equal) the gray scale ppm and PostScript image formats are used, otherwise the full color formats are used.  File: octave.info, Node: Input and Output, Next: Special Matrices, Prev: Image Processing, Up: Top Input and Output **************** There are two distinct classes of input and output functions. The first set are modeled after the functions available in MATLAB. The second set are modeled after the standard I/O library used by the C programming language. The C-style I/O functions offer more flexibility and control over the output, but are not quite as easy to use as the simpler MATLAB-style I/O functions. When running interactively, Octave normally sends any output intended for your terminal that is more than one screen long to a paging program, such as `less' or `more'. This avoids the problem of having a large volume of output stream by before you can read it. With `less' (and some versions of `more') it also allows you to scan forward and backward, and search for specific items. No output is displayed by the pager until just before Octave is ready to print the top level prompt, or read from the standard input using the `fscanf' or `scanf' functions. This means that there may be some delay before any output appears on your screen if you have asked Octave to perform a significant amount of work with a single command statement. The function `fflush' may be used to force output to be sent to the pager immediately. *Note C-Style I/O Functions::. You can select the program to run as the pager by setting the variable `PAGER', and you can turn paging off by setting the value of the variable `page_screen_output' to the string `"false"'. *Note User Preferences::. * Menu: * Basic Input and Output:: * C-Style I/O Functions:: octave-1.1.0/doc/octave.info-6100666 415 17 141041 5705317773 14264 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Basic Input and Output, Next: C-Style I/O Functions, Prev: Input and Output, Up: Input and Output Basic Input and Output ====================== Since Octave normally prints the value of an expression as soon as it has been evaluated, the simplest of all I/O functions is a simple expression. For example, the following expression will display the value of pi octave:13> pi pi = 3.1416 This works well as long as it is acceptable to have the name of the variable (or `ans') printed along with the value. To print the value of a variable without printing its name, use the function `disp'. For example, the following expression disp ("The value of pi is:"), disp (pi) will print The value of pi is: 3.1416 Note that the output from `disp' always ends with a newline. A simple way to control the output format is with the `format' statement. For example, to print more digits for pi you can use the command format long Then the expression above will print The value of pi is: 3.14159265358979 Here is a summary of the options for `format': `short' This is the default format. Octave will try to print numbers with at least 5 significant figures within a field that is a maximum of 10 characters wide. If Octave is unable to format a matrix so that columns line up on the decimal point and all the numbers fit within the maximum field width, it switches to an `e' format. `long' Octave will try to print numbers with at least 15 significant figures within a field that is a maximum of 24 characters wide. As will the `short' format, Octave will switch to an `e' format if it is unable to format a matrix so that columns line up on the decimal point and all the numbers fit within the maximum field width. `long e' `short e' The same as `format long' or `format short' but always display output with an `e' format. For example, with the `short e' format, pi is displayed as 3.14e+00 `long E' `short E' The same as `format long e' or `format short e' but always display output with an uppercase `E' format. For example, with the `long E' format, pi is displayed as 3.14159265358979E+00 `free' `none' Print output in free format, without trying to line up columns of matrices on the decimal point. This also causes complex numbers to be formatted like this `(0.604194, 0.607088)' instead of like this `0.60419 + 0.60709i'. `bank' Print in a fixed format with two places to the right of the decimal point. `+' Print a `+' symbol for nonzero matrix elements and a space for zero matrix elements. This format can be very useful for examining the structure of a large matrix. The `input' function may be used for prompting the user for a value and storing the result in a variable. For example, input ("Pick a number, any number! ") prints the prompt Pick a number, any number! and waits for the user to enter a value. The string entered by the user is evaluated as an expression, so it may be a literal constant, a variable name, or any other valid expression. Currently, `input' only returns one value, regardless of the number of values produced by the evaluation of the expression. If you are only interested in getting a literal string value, you can call `input' with the character string `s' as the second argument. This tells Octave to return the string entered by the user directly, without evaluating it first. Because there may be output waiting to be displayed by the pager, it is a good idea to always call `fflush (stdout)' before calling `input'. This will ensure that all pending output is written to the screen before your prompt. *Note C-Style I/O Functions::. The second input function, `keyboard', is normally used for simple debugging. Using `keyboard', it is possible to examine the values of variables within a function, and to assign newassign new variables Like `input', it prompts the user for input, but no value is returned, and it continues to prompt for input until the user types `quit', or `exit'. If `keyboard' is invoked without any arguments, a default prompt of `debug> ' is used. For both of these functions, the normal command line history and editing functions are available at the prompt. To save variables in a file, use the `save' command. For example, the command save data a b c saves the variables `a', `b', and `c' in the file `data'. The SAVE command can read files in Octave's text and binary formats as well as MATLAB's binary format. You can specify the default format with the built-in variable DEFAULT_SAVE_FORMAT using one of the following values: `"binary"' or `"mat-binary"'. The initial default save format is Octave's text format. You can use the built-in variable `save_precision' to specify the number of digits to keep when saving data in text format. The list of variables to save may include wildcard patterns containing the following special characters: `?' Match any single character. `*' Match zero or more characters. `[ LIST ]' Match the list of characters specified by LIST. If the first character is `!' or `^', match all characters except those specified by LIST. For example, the pattern `[a-zA-Z]' will match all lower and upper case alphabetic characters. The following options may be specified for `save'. `-ascii' Save the data in Octave's text data format. Using this flag overrides the value of the built-in variable `default_save_precision' `-binary' Save the data in Octave's binary data format. Using this flag overrides the value of the built-in variable `default_save_precision' `-float-binary' Save the data in Octave's binary data format but only using single precision. Using this flag overrides the value of the built-in variable `default_save_precision'. You should use this format only if you know that all the values to be saved can be represented in single precision. `-mat-binary' Save the data in MATLAB's binary data format. Using this flag overrides the value of the built-in variable `default_save_precision'. `-save-builtins' Force Octave to save the values of built-in variables too. By default, Octave does not save built-in variables. Saving global variables also saves the global status of the variable, so that if it is restored at a later time using `load', it will be restored as a global variable. To restore the values from a file, use the `load' command. For example, to restore the variables saved in the file `data', use the command load data Octave will refuse to overwrite existing variables unless you use the option `-force'. If a variable that is not marked as global is loaded from a file when a global symbol with the same name already exists, it is loaded in the global symbol table. Also, if a variable is marked as global in a file and a local symbol exists, the local symbol is moved to the global symbol table and given the value from the file. Since it seems that both of these cases are likely to be the result of some sort of error, they will generate warnings. As with `save', you may specify a list of variables and `load' will only extract those variables with names that match. The `load' command can read data stored in Octave's text and binary formats, and MATLAB's binary format. It will automatically detect the type of file and do conversion from different floating point formats (currently only IEEE big and little endian, though other formats may added in the future). The following options may be specified for `save'. `-force' Force variables currently in memory to be overwritten by variables with the same name found in the file. `-ascii' Force Octave to assume the file is in Octave's text format. `-binary' Force Octave to assume the file is in Octave's binary format. `-mat-binary' Force Octave to assume the file is in MATLAB's binary format.  File: octave.info, Node: C-Style I/O Functions, Prev: Basic Input and Output, Up: Input and Output C-Style I/O Functions ===================== The C-style input and output functions provide most of the functionality of the C programming language's standard I/O library. The argument lists for some of the input functions are slightly different, however, because Octave has no way of passing arguments by reference. In the following, FILE refers either to an integer file number (as returned by `fopen') or a file name. There are three files that are always available: `stdin' The standard input stream (file number 0). When Octave is used interactively, this is filtered through the command line editing functions. `stdout' The standard output stream (file number 1). Data written to the standard output is normally filtered through the pager. `stderr' The standard error stream (file number 2). Even if paging is turned on, the standard error is not sent to the pager. It is useful for error messages and prompts. You should always use the symbolic names given in the table above, rather than referring to these files by number, since it will make your programs clearer. * Menu: * Opening and Closing Files:: * Formatted Output:: * Output Conversion Syntax:: * Table of Output Conversions:: * Integer Conversions:: * Floating-Point Conversions:: * Other Output Conversions:: * Formatted Input:: * Input Conversion Syntax:: * Table of Input Conversions:: * Numeric Input Conversions:: * String Input Conversions:: * Binary I/O:: * Other I/O Functions::  File: octave.info, Node: Opening and Closing Files, Next: Formatted Output, Prev: C-Style I/O Functions, Up: C-Style I/O Functions Opening and Closing Files ------------------------- To open a file, use the function `fopen (name, mode)'. It returns an integer value that may be used to refer to the file later. The second argument is a one or two character string that specifies whether the file is to be opened for reading, writing, or both. For example, myfile = fopen ("splat.dat", "r"); opens the file `splat.dat' for reading. Opening a file that is already open has no effect. The possible values `mode' may have are `r' Open a text file for reading. `w' Open a text file for writing. The previous contents are discared. `a' Open or create a text file for writing at the end of the file. `r+' Open an existing text file for reading and writing. `w+' Open a text file for reading or writing. The previous contents are discared. `a+' Open or create a text file for reading or writing at the end of the file. To close a file once you are finished with it, use the function `fclose (FILE)'. If an error is encountered while trying to close the file, an error message is printed and `fclose' returns 0. Otherwise, it returns 1.  File: octave.info, Node: Formatted Output, Next: Output Conversion Syntax, Prev: Opening and Closing Files, Up: C-Style I/O Functions Formatted Output ---------------- This section describes how to call `printf' and related functions. The following functions are available for formatted output. They are modelled after the C language functions of the same name. `printf (TEMPLATE, ...)' The `printf' function prints the optional arguments under the control of the template string TEMPLATE to the stream `stdout'. `fprintf (FILE, TEMPLATE, ...)' This function is just like `printf', except that the output is written to the stream FILE instead of `stdout'. `sprintf (TEMPLATE, ...)' This is like `printf', except that the output is written to a string. Unlike the C library function, which requires you to provide a suitably sized string as an argument, Octave's `sprintf' function returns the string, automatically sized to hold all of the items converted. The `printf' function can be used to print any number of arguments. The template string argument you supply in a call provides information not only about the number of additional arguments, but also about their types and what style should be used for printing them. Ordinary characters in the template string are simply written to the output stream as-is, while "conversion specifications" introduced by a `%' character in the template cause subsequent arguments to be formatted and written to the output stream. For example, pct = 37; filename = "foo.txt"; printf ("Processing of `%s' is %d%% finished.\nPlease be patient.\n", filename, pct); produces output like Processing of `foo.txt' is 37% finished. Please be patient. This example shows the use of the `%d' conversion to specify that a scalar argument should be printed in decimal notation, the `%s' conversion to specify printing of a string argument, and the `%%' conversion to print a literal `%' character. There are also conversions for printing an integer argument as an unsigned value in octal, decimal, or hexadecimal radix (`%o', `%u', or `%x', respectively); or as a character value (`%c'). Floating-point numbers can be printed in normal, fixed-point notation using the `%f' conversion or in exponential notation using the `%e' conversion. The `%g' conversion uses either `%e' or `%f' format, depending on what is more appropriate for the magnitude of the particular number. You can control formatting more precisely by writing "modifiers" between the `%' and the character that indicates which conversion to apply. These slightly alter the ordinary behavior of the conversion. For example, most conversion specifications permit you to specify a minimum field width and a flag indicating whether you want the result left- or right-justified within the field. The specific flags and modifiers that are permitted and their interpretation vary depending on the particular conversion. They're all described in more detail in the following sections.  File: octave.info, Node: Output Conversion Syntax, Next: Table of Output Conversions, Prev: Formatted Output, Up: C-Style I/O Functions Output Conversion Syntax ------------------------ This section provides details about the precise syntax of conversion specifications that can appear in a `printf' template string. Characters in the template string that are not part of a conversion specification are printed as-is to the output stream. The conversion specifications in a `printf' template string have the general form: % FLAGS WIDTH [ . PRECISION ] TYPE CONVERSION For example, in the conversion specifier `%-10.8ld', the `-' is a flag, `10' specifies the field width, the precision is `8', the letter `l' is a type modifier, and `d' specifies the conversion style. (This particular type specifier says to print a numeric argument in decimal notation, with a minimum of 8 digits left-justified in a field at least 10 characters wide.) In more detail, output conversion specifications consist of an initial `%' character followed in sequence by: * Zero or more "flag characters" that modify the normal behavior of the conversion specification. * An optional decimal integer specifying the "minimum field width". If the normal conversion produces fewer characters than this, the field is padded with spaces to the specified width. This is a *minimum* value; if the normal conversion produces more characters than this, the field is *not* truncated. Normally, the output is right-justified within the field. You can also specify a field width of `*'. This means that the next argument in the argument list (before the actual value to be printed) is used as the field width. The value is rounded to the nearest integer. If the value is negative, this means to set the `-' flag (see below) and to use the absolute value as the field width. * An optional "precision" to specify the number of digits to be written for the numeric conversions. If the precision is specified, it consists of a period (`.') followed optionally by a decimal integer (which defaults to zero if omitted). You can also specify a precision of `*'. This means that the next argument in the argument list (before the actual value to be printed) is used as the precision. The value must be an integer, and is ignored if it is negative. * An optional "type modifier character". This character is ignored by Octave's `printf' function, but is recognized to provide compatibility with the C language `printf'. * A character that specifies the conversion to be applied. The exact options that are permitted and how they are interpreted vary between the different conversion specifiers. See the descriptions of the individual conversions for information about the particular options that they use.  File: octave.info, Node: Table of Output Conversions, Next: Integer Conversions, Prev: Output Conversion Syntax, Up: C-Style I/O Functions Table of Output Conversions --------------------------- Here is a table summarizing what all the different conversions do: `%d', `%i' Print an integer as a signed decimal number. *Note Integer Conversions::, for details. `%d' and `%i' are synonymous for output, but are different when used with `scanf' for input (*note Table of Input Conversions::.). `%o' Print an integer as an unsigned octal number. *Note Integer Conversions::, for details. `%u' Print an integer as an unsigned decimal number. *Note Integer Conversions::, for details. `%x', `%X' Print an integer as an unsigned hexadecimal number. `%x' uses lower-case letters and `%X' uses upper-case. *Note Integer Conversions::, for details. `%f' Print a floating-point number in normal (fixed-point) notation. *Note Floating-Point Conversions::, for details. `%e', `%E' Print a floating-point number in exponential notation. `%e' uses lower-case letters and `%E' uses upper-case. *Note Floating-Point Conversions::, for details. `%g', `%G' Print a floating-point number in either normal or exponential notation, whichever is more appropriate for its magnitude. `%g' uses lower-case letters and `%G' uses upper-case. *Note Floating-Point Conversions::, for details. `%c' Print a single character. *Note Other Output Conversions::. `%s' Print a string. *Note Other Output Conversions::. `%%' Print a literal `%' character. *Note Other Output Conversions::. If the syntax of a conversion specification is invalid, unpredictable things will happen, so don't do this. If there aren't enough function arguments provided to supply values for all the conversion specifications in the template string, or if the arguments are not of the correct types, the results are unpredictable. If you supply more arguments than conversion specifications, the extra argument values are simply ignored; this is sometimes useful.  File: octave.info, Node: Integer Conversions, Next: Floating-Point Conversions, Prev: Table of Output Conversions, Up: C-Style I/O Functions Integer Conversions ------------------- This section describes the options for the `%d', `%i', `%o', `%u', `%x', and `%X' conversion specifications. These conversions print integers in various formats. The `%d' and `%i' conversion specifications both print an numeric argument as a signed decimal number; while `%o', `%u', and `%x' print the argument as an unsigned octal, decimal, or hexadecimal number (respectively). The `%X' conversion specification is just like `%x' except that it uses the characters `ABCDEF' as digits instead of `abcdef'. The following flags are meaningful: `-' Left-justify the result in the field (instead of the normal right-justification). `+' For the signed `%d' and `%i' conversions, print a plus sign if the value is positive. ` ' For the signed `%d' and `%i' conversions, if the result doesn't start with a plus or minus sign, prefix it with a space character instead. Since the `+' flag ensures that the result includes a sign, this flag is ignored if you supply both of them. `#' For the `%o' conversion, this forces the leading digit to be `0', as if by increasing the precision. For `%x' or `%X', this prefixes a leading `0x' or `0X' (respectively) to the result. This doesn't do anything useful for the `%d', `%i', or `%u' conversions. `0' Pad the field with zeros instead of spaces. The zeros are placed after any indication of sign or base. This flag is ignored if the `-' flag is also specified, or if a precision is specified. If a precision is supplied, it specifies the minimum number of digits to appear; leading zeros are produced if necessary. If you don't specify a precision, the number is printed with as many digits as it needs. If you convert a value of zero with an explicit precision of zero, then no characters at all are produced.  File: octave.info, Node: Floating-Point Conversions, Next: Other Output Conversions, Prev: Integer Conversions, Up: C-Style I/O Functions Floating-Point Conversions -------------------------- This section discusses the conversion specifications for floating-point numbers: the `%f', `%e', `%E', `%g', and `%G' conversions. The `%f' conversion prints its argument in fixed-point notation, producing output of the form [`-']DDD`.'DDD, where the number of digits following the decimal point is controlled by the precision you specify. The `%e' conversion prints its argument in exponential notation, producing output of the form [`-']D`.'DDD`e'[`+'|`-']DD. Again, the number of digits following the decimal point is controlled by the precision. The exponent always contains at least two digits. The `%E' conversion is similar but the exponent is marked with the letter `E' instead of `e'. The `%g' and `%G' conversions print the argument in the style of `%e' or `%E' (respectively) if the exponent would be less than -4 or greater than or equal to the precision; otherwise they use the `%f' style. Trailing zeros are removed from the fractional portion of the result and a decimal-point character appears only if it is followed by a digit. The following flags can be used to modify the behavior: `-' Left-justify the result in the field. Normally the result is right-justified. `+' Always include a plus or minus sign in the result. ` ' If the result doesn't start with a plus or minus sign, prefix it with a space instead. Since the `+' flag ensures that the result includes a sign, this flag is ignored if you supply both of them. `#' Specifies that the result should always include a decimal point, even if no digits follow it. For the `%g' and `%G' conversions, this also forces trailing zeros after the decimal point to be left in place where they would otherwise be removed. `0' Pad the field with zeros instead of spaces; the zeros are placed after any sign. This flag is ignored if the `-' flag is also specified. The precision specifies how many digits follow the decimal-point character for the `%f', `%e', and `%E' conversions. For these conversions, the default precision is `6'. If the precision is explicitly `0', this suppresses the decimal point character entirely. For the `%g' and `%G' conversions, the precision specifies how many significant digits to print. Significant digits are the first digit before the decimal point, and all the digits after it. If the precision is `0' or not specified for `%g' or `%G', it is treated like a value of `1'. If the value being printed cannot be expressed precisely in the specified number of digits, the value is rounded to the nearest number that fits.  File: octave.info, Node: Other Output Conversions, Next: Formatted Input, Prev: Floating-Point Conversions, Up: C-Style I/O Functions Other Output Conversions ------------------------ This section describes miscellaneous conversions for `printf'. The `%c' conversion prints a single character. The `-' flag can be used to specify left-justification in the field, but no other flags are defined, and no precision or type modifier can be given. For example: printf ("%c%c%c%c%c", "h", "e", "l", "l", "o"); prints `hello'. The `%s' conversion prints a string. The corresponding argument must be a string. A precision can be specified to indicate the maximum number of characters to write; otherwise characters in the string up to but not including the terminating null character are written to the output stream. The `-' flag can be used to specify left-justification in the field, but no other flags or type modifiers are defined for this conversion. For example: printf ("%3s%-6s", "no", "where"); prints ` nowhere '.  File: octave.info, Node: Formatted Input, Next: Input Conversion Syntax, Prev: Other Output Conversions, Up: C-Style I/O Functions Formatted Input --------------- Here are the descriptions of the functions for performing formatted input. `scanf (TEMPLATE)' The `scanf' function reads formatted input from the stream `stdin' under the control of the template string TEMPLATE. The resulting values are returned. `fscanf (FILE, TEMPLATE)' This function is just like `scanf', except that the input is read from the stream FILE instead of `stdin'. `sscanf (STRING, TEMPLATE)' This is like `scanf', except that the characters are taken from the string STRING instead of from a stream. Reaching the end of the string is treated as an end-of-file condition. Calls to `scanf' are superficially similar to calls to `printf' in that arbitrary arguments are read under the control of a template string. While the syntax of the conversion specifications in the template is very similar to that for `printf', the interpretation of the template is oriented more towards free-format input and simple pattern matching, rather than fixed-field formatting. For example, most `scanf' conversions skip over any amount of "white space" (including spaces, tabs, and newlines) in the input file, and there is no concept of precision for the numeric input conversions as there is for the corresponding output conversions. Ordinarily, non-whitespace characters in the template are expected to match characters in the input stream exactly. When a "matching failure" occurs, `scanf' returns immediately, leaving the first non-matching character as the next character to be read from the stream, and `scanf' returns all the items that were successfully converted. The formatted input functions are not used as frequently as the formatted output functions. Partly, this is because it takes some care to use them properly. Another reason is that it is difficult to recover from a matching error.  File: octave.info, Node: Input Conversion Syntax, Next: Table of Input Conversions, Prev: Formatted Input, Up: C-Style I/O Functions Input Conversion Syntax ----------------------- A `scanf' template string is a string that contains ordinary multibyte characters interspersed with conversion specifications that start with `%'. Any whitespace character in the template causes any number of whitespace characters in the input stream to be read and discarded. The whitespace characters that are matched need not be exactly the same whitespace characters that appear in the template string. For example, write ` , ' in the template to recognize a comma with optional whitespace before and after. Other characters in the template string that are not part of conversion specifications must match characters in the input stream exactly; if this is not the case, a matching failure occurs. The conversion specifications in a `scanf' template string have the general form: % FLAGS WIDTH TYPE CONVERSION In more detail, an input conversion specification consists of an initial `%' character followed in sequence by: * An optional "flag character" `*', which says to ignore the text read for this specification. When `scanf' finds a conversion specification that uses this flag, it reads input as directed by the rest of the conversion specification, but it discards this input, does not use a pointer argument, and does not increment the count of successful assignments. * An optional decimal integer that specifies the "maximum field width". Reading of characters from the input stream stops either when this maximum is reached or when a non-matching character is found, whichever happens first. Most conversions discard initial whitespace characters (those that don't are explicitly documented), and these discarded characters don't count towards the maximum field width. * An optional type modifier character. This character is ignored by Octave's `scanf' function, but is recognized to provide compatibility with the C language `scanf'. * A character that specifies the conversion to be applied. The exact options that are permitted and how they are interpreted vary between the different conversion specifiers. See the descriptions of the individual conversions for information about the particular options that they allow.  File: octave.info, Node: Table of Input Conversions, Next: Numeric Input Conversions, Prev: Input Conversion Syntax, Up: C-Style I/O Functions Table of Input Conversions -------------------------- Here is a table that summarizes the various conversion specifications: `%d' Matches an optionally signed integer written in decimal. *Note Numeric Input Conversions::. `%i' Matches an optionally signed integer in any of the formats that the C language defines for specifying an integer constant. *Note Numeric Input Conversions::. `%o' Matches an unsigned integer written in octal radix. *Note Numeric Input Conversions::. `%u' Matches an unsigned integer written in decimal radix. *Note Numeric Input Conversions::. `%x', `%X' Matches an unsigned integer written in hexadecimal radix. *Note Numeric Input Conversions::. `%e', `%f', `%g', `%E', `%G' Matches an optionally signed floating-point number. *Note Numeric Input Conversions::. `%s' Matches a string containing only non-whitespace characters. *Note String Input Conversions::. `%c' Matches a string of one or more characters; the number of characters read is controlled by the maximum field width given for the conversion. *Note String Input Conversions::. `%%' This matches a literal `%' character in the input stream. No corresponding argument is used. If the syntax of a conversion specification is invalid, the behavior is undefined. If there aren't enough function arguments provided to supply addresses for all the conversion specifications in the template strings that perform assignments, or if the arguments are not of the correct types, the behavior is also undefined. On the other hand, extra arguments are simply ignored.  File: octave.info, Node: Numeric Input Conversions, Next: String Input Conversions, Prev: Table of Input Conversions, Up: C-Style I/O Functions Numeric Input Conversions ------------------------- This section describes the `scanf' conversions for reading numeric values. The `%d' conversion matches an optionally signed integer in decimal radix. The `%i' conversion matches an optionally signed integer in any of the formats that the C language defines for specifying an integer constant. For example, any of the strings `10', `0xa', or `012' could be read in as integers under the `%i' conversion. Each of these specifies a number with decimal value `10'. The `%o', `%u', and `%x' conversions match unsigned integers in octal, decimal, and hexadecimal radices, respectively. The `%X' conversion is identical to the `%x' conversion. They both permit either uppercase or lowercase letters to be used as digits. Unlike the C language `scanf', Octave ignores the `h', `l', and `L' modifiers.  File: octave.info, Node: String Input Conversions, Next: Binary I/O, Prev: Numeric Input Conversions, Up: C-Style I/O Functions String Input Conversions ------------------------ This section describes the `scanf' input conversions for reading string and character values: `%s' and `%c'. The `%c' conversion is the simplest: it matches a fixed number of characters, always. The maximum field with says how many characters to read; if you don't specify the maximum, the default is 1. This conversion does not skip over initial whitespace characters. It reads precisely the next N characters, and fails if it cannot get that many. The `%s' conversion matches a string of non-whitespace characters. It skips and discards initial whitespace, but stops when it encounters more whitespace after having read something. For example, reading the input: hello, world with the conversion `%10c' produces `" hello, wo"', but reading the same input with the conversion `%10s' produces `"hello,"'.  File: octave.info, Node: Binary I/O, Next: Other I/O Functions, Prev: String Input Conversions, Up: C-Style I/O Functions Binary I/O ---------- Octave has to C-style functions for reading and writing binary data. They are `fread' and `fwrite' and are patterned after the standard C functions with the same names. `fread (FILE, SIZE, PRECISION)' This function reads data in binary form of type PRECISION from the specified FILE, which may be either a file name, or a file number as returned from `fopen'. The argument SIZE specifies the size of the matrix to return. It may be a scalar or a two-element vector. If it is a scalar, `fread' returns a column vector of the specified length. If it is a two-element vector, it specifies the number of rows and columns of the result matrix, and `fread' fills the elements of the matrix in column-major order. The argument PRECISION is a string specifying the type of data to read and may be one of `"char"', `"schar"', `"short"', `"int"', `"long"', `"float"', `"double"', `"uchar"', `"ushort"', `"uint"', or `"ulong"'. The default precision is `"uchar"'. The `fread' function returns two values, `data', which is the data read from the file, and `count', which is the number of elements read. `fwrite (FILE, DATA, PRECISION)' This function writes data in binary form of type PRECISION to the specified FILE, which may be either a file name, or a file number as returned from `fopen'. The argument DATA is a matrix of values that are to be written to the file. The values are extracted in column-major order. The argument PRECISION is a string specifying the type of data to read and may be one of `"char"', `"schar"', `"short"', `"int"', `"long"', `"float"', `"double"', `"uchar"', `"ushort"', `"uint"', or `"ulong"'. The default precision is `"uchar"'. The `fwrite' function returns the number of elements written. The behavior of `fwrite' is undefined if the values in DATA are too large to fit in the specified precision.  File: octave.info, Node: Other I/O Functions, Prev: Binary I/O, Up: C-Style I/O Functions Other I/O Functions ------------------- fgets (FILE, len) Read `len' characters from a file. To flush output to a stream, use the function `fflush (FILE)'. This is useful for ensuring that all pending output makes it to the screen before some other event occurs. For example, it is always a good idea to flush the standard output stream before calling `input'. Three functions are available for setting and determining the position of the file pointer for a given file. The position of the file pointer (as the number of characters from the beginning of the file) can be obtained using the the function `ftell (FILE)'. To set the file pointer to any location within the file, use the function `fseek (FILE, offset, origin)'. The pointer is placed `offset' characters from the `origin', which may be one of the predefined variables `SEEK_CUR' (current position), `SEEK_SET' (beginning), or `SEEK_END' (end of file). If `origin' is omitted, `SEEK_SET' is assumed. The offset must be zero, or a value returned by `ftell' (in which case `origin' must be `SEEK_SET'. *Note Predefined Constants::. The function `frewind (FILE)' moves the file pointer to the beginning of a file, returning 1 for success, and 0 if an error was encountered. It is equivalent to `fseek (FILE, 0, SEEK_SET)'. The following example stores the current file position in the variable `marker', moves the pointer to the beginning of the file, reads four characters, and then returns to the original position. marker = ftell (myfile); frewind (myfile); fourch = fgets (myfile, 4); fseek (myfile, marker, SEEK_SET); The function `feof (FILE)' allows you to find out if an end-of-file condition has been encountered for a given file. Note that it will only return 1 if the end of the file has already been encountered, not if the next read operation will result in an end-of-file condition. Similarly, the function `ferror (FILE)' allows you to find out if an error condition has been encountered for a given file. Note that it will only return 1 if an error has already been encountered, not if the next operation will result in an error condition. The function `kbhit' may be usd to read a single keystroke from the keyboard. For example, x = kbhit (); will set X to the next character typed at the keyboard, without requiring a carriage return to be typed. Finally, it is often useful to know exactly which files have been opened, and whether they are open for reading, writing, or both. The command `freport' prints this information for all open files. For example, octave:13> freport number mode name 0 r stdin 1 w stdout 2 w stderr 3 r myfile  File: octave.info, Node: Special Matrices, Next: Matrix Manipulation, Prev: Input and Output, Up: Top Special Matrices **************** Octave provides a number of functions for creating special matrix forms. In nearly all cases, it is best to use the built-in functions for this purpose than to try to use other tricks to achieve the same effect. * Menu: * Special Utility Matrices:: * Famous Matrices::  File: octave.info, Node: Special Utility Matrices, Next: Famous Matrices, Prev: Special Matrices, Up: Special Matrices Special Utility Matrices ======================== The function `eye' returns an identity matrix. If invoked with a single scalar argument, `eye' returns a square matrix with the dimension specified. If you supply two scalar arguments, `eye' takes them to be the number of rows and columns. If given a matrix or vector argument, `eye' returns an identity matrix with the same dimensions as the given argument. For example, eye (3) creates an identity matrix with three rows and three columns, eye (5, 8) creates an identity matrix with five rows and eight columns, and eye ([13, 21; 34, 55]) creates an identity matrix with two rows and two columns. Normally, `eye' expects any scalar arguments you provide to be real and non-negative. The variables `ok_to_lose_imaginary_part' and `treat_neg_dim_as_zero' control the behavior of `eye' for complex and negative arguments. *Note User Preferences::. Any non-integer arguments are rounded to the nearest integer value. There is an ambiguity when these functions are called with a single argument. You may have intended to create a matrix with the same dimensions as another variable, but ended up with something quite different, because the variable that you used as an argument was a scalar instead of a matrix. For example, if you need to create an identity matrix with the same dimensions as another variable in your program, it is best to use code like this eye (rows (a), columns (a)) instead of just eye (a) unless you know that the variable A will *always* be a matrix. The functions `ones', `zeros', and `rand' all work like `eye', except that they fill the resulting matrix with all ones, all zeros, or a set of random values. If you need to create a matrix whose values are all the same, you should use an expression like val_matrix = val * ones (n, m) The `rand' function also takes some additional arguments that allow you to control its behavior. For example, the function call rand ("normal") causes the sequence of numbers to be normally distributed. You may also use an argument of `"uniform"' to select a uniform distribution. To find out what the current distribution is, use an argument of `"dist"'. Normally, `rand' obtains the seed from the system clock, so that the sequence of random numbers is not the same each time you run Octave. If you really do need for to reproduce a sequence of numbers exactly, you can set the seed to a specific value. For example, the function call rand ("seed", 13) sets the seed to the number 13. To see what the current seed is, use the argument `"seed"'. If it is invoked without arguments, `rand' returns a single element of a random sequence. The `rand' function uses Fortran code from RANLIB, a library of fortran routines for random number generation, compiled by Barry W. Brown and James Lovato of the Department of Biomathematics at The University of Texas, M.D. Anderson Cancer Center, Houston, TX 77030. To create a diagonal matrix with vector V on diagonal K, use the function diag (V, K). The second argument is optional. If it is positive, the vector is placed on the K-th super-diagonal. If it is negative, it is placed on the -K-th sub-diagonal. The default value of K is 0, and the vector is placed on the main diagonal. For example, octave:13> diag ([1, 2, 3], 1) ans = 0 1 0 0 0 0 2 0 0 0 0 3 0 0 0 0 The functions `linspace' and `logspace' make it very easy to create vectors with evenly or logarithmically spaced elements. For example, linspace (BASE, LIMIT, N) creates a vector with N (N greater than 2) linearly spaced elements between BASE and LIMIT. The BASE and LIMIT are always included in the range. If BASE is greater than LIMIT, the elements are stored in decreasing order. If the number of points is not specified, a value of 100 is used. The function `logspace' is similar to `linspace' except that the values are logarithmically spaced. If LIMIT is equal to pi, the points are between 10^base and pi, *not* 10^base and 10^pi, in order to be compatible with the corresponding MATLAB function.  File: octave.info, Node: Famous Matrices, Prev: Special Utility Matrices, Up: Special Matrices Famous Matrices =============== The following functions return famous matrix forms. `hadamard (K)' Return the Hadamard matrix of order n = 2^k. `hankel (C, R)' Return the Hankel matrix constructed given the first column C, and (optionally) the last row R. If the last element of C is not the same as the first element of R, the last element of C is used. If the second argument is omitted, the last row is taken to be the same as the first column. A Hankel matrix formed from an m-vector C, and an n-vector R, has the elements H (i, j) = c (i+j-1), i+j-1 <= m; H (i, j) = r (i+j-m), otherwise `hilb (N)' Return the Hilbert matrix of order N. The i, j element of a Hilbert matrix is defined as H (i, j) = 1 / (i + j - 1) `invhilb (N)' Return the inverse of a Hilbert matrix of order N. This is exact. Compare with the numerical calculation of `inverse (hilb (n))', which suffers from the ill-conditioning of the Hilbert matrix, and the finite precision of your computer's floating point arithmetic. `toeplitz (C, R)' Return the Toeplitz matrix constructed given the first column C, and (optionally) the first row R. If the first element of C is not the same as the first element of R, the first element of C is used. If the second argument is omitted, the first row is taken to be the same as the first column. A square Toeplitz matrix has the form c(0) r(1) r(2) ... r(n) c(1) c(0) r(1) r(n-1) c(2) c(1) c(0) r(n-2) . . . . . . c(n) c(n-1) c(n-2) ... c(0) `vander (C)' Return the Vandermonde matrix whose next to last column is C. A Vandermonde matrix has the form c(0)^n ... c(0)^2 c(0) 1 c(1)^n ... c(1)^2 c(1) 1 . . . . . . . . . . . . c(n)^n ... c(n)^2 c(n) 1  File: octave.info, Node: Matrix Manipulation, Next: String Functions, Prev: Special Matrices, Up: Top Matrix Manipulation ******************* There are a number of functions available for checking to see if the elements of a matrix meet some condition, and for rearranging the elements of a matrix. For example, Octave can easily tell you if all the elements of a matrix are finite, or are less than some specified value. Octave can also rotate the elements, extract the upper- or lower-triangular parts, or sort the columns of a matrix. * Menu: * Finding Elements and Checking Conditions:: * Rearranging Matrices::  File: octave.info, Node: Finding Elements and Checking Conditions, Next: Rearranging Matrices, Prev: Matrix Manipulation, Up: Matrix Manipulation Finding Elements and Checking Conditions ======================================== The functions `any' and `all' are useful for determining whether any or all of the elements of a matrix satisfy some condition. Given a vector, the function `any' returns 1 if any element of the vector is nonzero. For a matrix argument, `any' returns a row vector of ones and zeros with each element indicating whether any of the elements of the corresponding column of the matrix are nonzero. For example, octave:13> any (eye (2, 4)) ans = 1 1 0 0 To see if any of the elements of a matrix are nonzero, you can use a statement like any (any (a)) For a matrix argument, `any' returns a row vector of ones and zeros with each element indicating whether any of the elements of the corresponding column of the matrix are nonzero. The function `all' behaves like the function `any', except that it returns true only if all the elements of a vector, or all the elements in a column of a matrix, are nonzero. Since the comparison operators (*note Comparison Ops::.) return matrices of ones and zeros, it is easy to test a matrix for many things, not just whether the elements are nonzero. For example, octave:13> all (all (rand (5) < 0.9)) ans = 0 tests a random 5 by 5 matrix to see if all of it's elements are less than 0.9. Note that in conditional contexts (like the test clause of `if' and `while' statements) Octave treats the test as if you had typed `all (all (condition))'. The functions `isinf', `finite', and `isnan' return 1 if their arguments are infinite, finite, or not a number, respectively, and return 0 otherwise. For matrix values, they all work on an element by element basis. For example, evaluating the expression isinf ([1, 2; Inf, 4]) produces the matrix ans = 0 0 1 0 The function `find' returns a vector of indices of nonzero elements of a matrix. To obtain a single index for each matrix element, Octave pretends that the columns of a matrix form one long vector (like Fortran arrays are stored). For example, octave:13> find (eye (2)) ans = 1 4 If two outputs are requested, `find' returns the row and column indices of nonzero elements of a matrix. For example, octave:13> [i, j] = find (eye (2)) i = 1 2 j = 1 2 If three outputs are requested, `find' also returns the nonzero values in a vector. octave-1.1.0/doc/octave.info-7100666 415 17 141661 5705317773 14275 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Rearranging Matrices, Prev: Finding Elements and Checking Conditions, Up: Matrix Manipulation Rearranging Matrices ==================== The function `fliplr' reverses the order of the columns in a matrix, and `flipud' reverses the order of the rows. For example, octave:13> fliplr ([1, 2; 3, 4]) ans = 2 1 4 3 octave:13> flipud ([1, 2; 3, 4]) ans = 3 4 1 2 The function `rot90 (A, N)' rotates a matrix counterclockwise in 90-degree increments. The second argument is optional, and specifies how many 90-degree rotations are to be applied (the default value is 1). Negative values of N rotate the matrix in a clockwise direction. For example, rot90 ([1, 2; 3, 4], -1) ans = 3 1 4 2 rotates the given matrix clockwise by 90 degrees. The following are all equivalent statements: rot90 ([1, 2; 3, 4], -1) rot90 ([1, 2; 3, 4], 3) rot90 ([1, 2; 3, 4], 7) The function `reshape (A, M, N)' returns a matrix with M rows and N columns whose elements are taken from the matrix A. To decide how to order the elements, Octave pretends that the elements of a matrix are stored in column-major order (like Fortran arrays are stored). For example, octave:13> reshape ([1, 2, 3, 4], 2, 2) ans = 1 3 2 4 If the variable `do_fortran_indexing' is `"true"', the `reshape' function is equivalent to retval = zeros (m, n); retval (:) = a; but it is somewhat less cryptic to use `reshape' instead of the colon operator. Note that the total number of elements in the original matrix must match the total number of elements in the new matrix. The function `sort' can be used to arrange the elements of a vector in increasing order. For matrices, `sort' orders the elements in each column. For example, octave:13> sort (rand (4)) ans = 0.065359 0.039391 0.376076 0.384298 0.111486 0.140872 0.418035 0.824459 0.269991 0.274446 0.421374 0.938918 0.580030 0.975784 0.562145 0.954964 The `sort' function may also be used to produce a matrix containing the original row indices of the elements in the sorted matrix. For example, s = 0.051724 0.485904 0.253614 0.348008 0.391608 0.526686 0.536952 0.600317 0.733534 0.545522 0.691719 0.636974 0.986353 0.976130 0.868598 0.713884 i = 2 4 2 3 4 1 3 4 1 2 4 1 3 3 1 2 These values may be used to recover the original matrix from the sorted version. For example, The `sort' function does not allow sort keys to be specified, so it can't be used to order the rows of a matrix according to the values of the elements in various columns(1) in a single call. Using the second output, however, it is possible to sort all rows based on the values in a given column. Here's an example that sorts the rows of a matrix based on the values in the third column. octave:13> a = rand (4) a = 0.080606 0.453558 0.835597 0.437013 0.277233 0.625541 0.447317 0.952203 0.569785 0.528797 0.319433 0.747698 0.385467 0.124427 0.883673 0.226632 octave:14> [s, i] = sort (a (:, 3)); octave:15> a (i, :) ans = 0.569785 0.528797 0.319433 0.747698 0.277233 0.625541 0.447317 0.952203 0.080606 0.453558 0.835597 0.437013 0.385467 0.124427 0.883673 0.226632 The functions `triu (A, K)' and `tril (A, K)' extract the upper or lower triangular part of the matrix A, and set all other elements to zero. The second argument is optional, and specifies how many diagonals above or below the main diagonal should also be set to zero. The default value of K is zero, so that `triu' and `tril' normally include the main diagonal as part of the result matrix. If the value of K is negative, additional elements above (for `tril') or below (for `triu') the main diagonal are also selected. The absolute value of K must not be greater than the number of sub- or super-diagonals. For example, octave:13> tril (rand (4), 1) ans = 0.00000 0.00000 0.00000 0.00000 0.09012 0.00000 0.00000 0.00000 0.01215 0.34768 0.00000 0.00000 0.00302 0.69518 0.91940 0.00000 forms a lower triangular matrix from a random 4 by 4 matrix, omitting the main diagonal, and octave:13> tril (rand (4), -1) ans = 0.06170 0.51396 0.00000 0.00000 0.96199 0.11986 0.35714 0.00000 0.16185 0.61442 0.79343 0.52029 0.68016 0.48835 0.63609 0.72113 forms a lower triangular matrix from a random 4 by 4 matrix, including the main diagonal and the first super-diagonal. ---------- Footnotes ---------- (1) For example, to first sort based on the values in column 1, and then, for any values that are repeated in column 1, sort based on the values found in column 2, etc.  File: octave.info, Node: String Functions, Next: System Utilities, Prev: Matrix Manipulation, Up: Top String Functions **************** Octave currently has a limited ability to work with strings. The function `strcmp (S1, S2)' compares two strings, returning 1 if they are the same, and 0 otherwise. *Note: For compatibility with MATLAB, Octave's strcmp function returns 1 if the strings are equal, and 0 otherwise. This is just the opposite of the corresponding C library function.* The functions `int2str' and `num2str' convert a numeric argument to a string. These functions are not very flexible, but are provided for compatibility with MATLAB. For better control over the results, use `sprintf' (*note Formatted Output::.). The function `setstr' can be used to convert a vector to a string. Each element of the vector is converted to the corresponding ASCII character. For example, setstr ([97, 98, 99]) creates the string abc The function `undo_string_escapes (STRING)' converts special characters in strings back to their escaped forms. For example, the expression bell = "\a"; assigns the value of the alert character (control-g, ASCII code 7) to the string variable BELL. If this string is printed, the system will ring the terminal bell (if it is possible). This is normally the desired outcome. However, sometimes it is useful to be able to print the original representation of the string, with the special characters replaced by their escape sequences. For example, octave:13> undo_string_escapes (bell) ans = \a replaces the unprintable alert character with its printable representation. *Note String Constants::, for a description of string escapes.  File: octave.info, Node: System Utilities, Next: Command History Functions, Prev: String Functions, Up: Top System Utilities **************** This chapter describes the functions that are available to allow you to get information about what is happening outside of Octave, while it is still running, and use this information in your program. For example, you can get information about environment variables, the current time, and even start other programs from the Octave prompt. * Menu: * Timing Utilities:: * Interacting with the OS:: * System Information:: * Other Functions::  File: octave.info, Node: Timing Utilities, Next: Interacting with the OS, Prev: System Utilities, Up: System Utilities Timing Utilities ================ The function `clock' returns a vector containing the current year, month (1-12), day (1-31), hour (0-23), minute (0-59) and second (0-60). For example, octave:13> clock ans = 1993 8 20 4 56 1 The function clock is more accurate on systems that have the `gettimeofday' function. To get the date as a character string in the form DD-MMM-YY, use the command `date'. For example, octave:13> date ans = 20-Aug-93 Octave also has functions for computing time intervals and CPU time used. The functions `tic' and `toc' can be used to set and check a wall-clock timer. For example, tic (); # many computations later... elapsed_time = toc (); will set the variable `elapsed_time' to the number of seconds since the most recent call to the function `tic'. The function `etime' provides another way to get elapsed wall-clock time by returning the difference (in seconds) between two time values returned from `clock'. For example: t0 = clock (); # many computations later... elapsed_time = etime (clock (), t0); will set the variable `elapsed_time' to the number of seconds since the variable `t0' was set. The function `cputime' allows you to obtain information about the amount of CPU time your Octave session is using. For example, [total, user, system] = cputime (); returns the CPU time used by your Octave session. The first output is the total time spent executing your process and is equal to the sum of second and third outputs, which are the number of CPU seconds spent executing in user mode and the number of CPU seconds spent executing in system mode, respectively. Finally, Octave's function `is_leap_year' returns 1 if the given year is a leap year and 0 otherwise. If no arguments are provided, `is_leap_year' will use the current year. For example, octave:13> is_leap_year (2000) ans = 1 Contrary to what many people who post misinformation to Usenet apparently believe, Octave knows that the year 2000 will be a leap year.  File: octave.info, Node: Interacting with the OS, Next: System Information, Prev: Timing Utilities, Up: System Utilities Interacting with the OS ======================= You can execute any shell command using the function `system (CMD, FLAG)'. The second argument is optional. If it is present, the output of the command is returned by `system' as a string. If it is not supplied, any output from the command is printed, with the standard output filtered through the pager. For example, users = system ("finger", 1) places the output of the command `finger' in the variable `users'. If you want to execute a shell command and have it behave as if it were typed directly from the shell prompt, you may need to specify extra arguments for the command. For example, to get `bash' to behave as an interactive shell, you can type system ("bash -i >/dev/tty"); The first argument, `-i', tells `bash' to behave as an interactive shell, and the redirection of the standard output stream prevents any output produced by `bash' from being sent back to Octave, where it would be buffered until Octave displays another prompt. The `system' function can return two values. The first is any output from the command that was written to the standard output stream, and the second is the output status of the command. For example, [output, status] = system ("echo foo; exit 2"); will set the variable `output' to the string `foo', and the variable `status' to the integer `2'. The name `shell_cmd' exists for compatibility with earlier versions of Octave. You can find the values of environment variables using the function `getenv'. For example, getenv ("PATH") returns a string containing the value of your path. The functions `clc', and `home' clear your terminal screen and move the cursor to the upper left corner. You can change the current working directory using the `cd' command. Tilde expansion is performed on the path. For example, cd ~/octave Changes the current working directory to `~/octave'. If the directory does not exist, an error message is printed and the working directory is not changed. The name `chdir' is an alias for `cd'. The command `pwd' prints the current working directory. The functions `dir' and `ls' list directory contents. For example, octave:13> ls -l total 12 -rw-r--r-- 1 jwe users 4488 Aug 19 04:02 foo.m -rw-r--r-- 1 jwe users 1315 Aug 17 23:14 bar.m The `dir' and `ls' commands are implemented by calling your system's directory listing command, so the available options may vary from system to system.  File: octave.info, Node: System Information, Next: Other Functions, Prev: Interacting with the OS, Up: System Utilities System Information ================== If possible, `computer' prints a string of the form CPU-VENDOR-OS that identifies the kind of computer Octave is running on. For example, octave:13> computer sparc-sun-sunos4.1.2 The function `isieee' returns 1 if your computer claims to conform to the IEEE standard for floating point calculations. The function `version' returns Octave's version number as a string. This is also the value of the built-in variable `OCTAVE_VERSION'. *Note Built-in Variables::.  File: octave.info, Node: Other Functions, Prev: System Information, Up: System Utilities Other Functions =============== The function `pause' allows you to suspend the execution of a program. If invoked without any arguments, Octave waits until you type a character. With a numeric argument, it pauses for the given number of seconds. For example, the following statement prints a message and then waits 5 seconds before clearing the screen. fprintf (stderr, "wait please...\n"), pause (5), clc  File: octave.info, Node: Command History Functions, Next: Help, Prev: System Utilities, Up: Top Command History Functions ************************* Octave provides three functions for viewing, editing, and re-running chunks of commands from the history list. The function `history' displays a list of commands that you have executed. It also allows you to write the current history to a file for safe keeping, and to replace the history list with the commands stored in a named file. Valid arguments are: `-w file' Write the current history to the named file. If the name is omitted, use the default history file (normally `~/.octave_hist'). `-r file' Read the named file, replacing the current history list with its contents. If the name is omitted, use the default history file (normally `~/.octave_hist'). `N' Only display the most recent `N' lines of history. `-q' Don't number the displayed lines of history. This is useful for cutting and pasting commands if you are using the X Window System. For example, to display the five most recent commands that you have typed without displaying line numbers, use the command `history -q 5'. The function `edit_history' allows you to edit a block of commands from the history list using the editor named by the environment variable `EDITOR', or the default editor (normally `vi'). It is often more convenient to use `edit_history' to define functions rather than attempting to enter them directly on the command line. By default, the block of commands is executed as soon as you exit the editor. To avoid executing any commands, simply delete all the lines from the buffer before exiting the editor. The `edit_history' command takes two optional arguments specifying the history numbers of first and last commands to edit. For example, the command edit_history 13 extracts all the commands from the 13th through the last in the history list. The command edit_history 13 169 only extracts commands 13 through 169. Specifying a larger number for the first command than the last command reverses the list of commands before placing them in the buffer to be edited. If both arguments are omitted, the previous command in the history list is used. The command `run_history' is like `edit_history', except that the editor is not invoked, and the commands are simply executed as they appear in the history list. The `diary' command allows you to create a list of all commands *and* the output they produce, mixed together just as you see them on your terminal. For example, the command diary on tells Octave to start recording your session in a file called `diary' in your current working directory. To give Octave the name of the file write to, use the a command like diary my-diary.txt Then Octave will write all of your commands to the file `my-diary.txt'. To stop recording your session, use the command diary off Without any arguments, `diary' toggles the current diary state.  File: octave.info, Node: Help, Next: Programming Utilities, Prev: Command History Functions, Up: Top Help **** Octave's `help' command can be used to print brief usage-style messages, or to display information directly from an on-line version of the printed manual, using the GNU Info browser. If invoked without any arguments, `help' prints a list of all the available operators, functions, and built-in variables. If the first argument is `-i', the `help' command searches the index of the on-line version of this manual for the given topics. For example, the command help help prints a short message describing the `help' command, and help -i help starts the GNU Info browser at this node in the on-line version of the manual. *Note Using Info::, for complete details about how to use the GNU Info browser to read the on-line version of the manual.  File: octave.info, Node: Programming Utilities, Next: Amusements, Prev: Help, Up: Top Programming Utilities ********************* * Menu: * Evaluating Strings as Commands:: * Miscellaneous Utilities::  File: octave.info, Node: Evaluating Strings as Commands, Next: Miscellaneous Utilities, Prev: Programming Utilities, Up: Programming Utilities Evaluating Strings as Commands ============================== It is often useful to evaluate a string as if it were an Octave program, or use a string as the name of a function to call. These functions are necessary in order to evaluate commands that are not known until run time, or to write functions that will need to call user-supplied functions. The function `eval (COMMAND)' parses COMMAND and evaluates it as if it were an Octave program, returning the last value computed. The COMMAND is evaluated in the current context, so any results remain available after `eval' returns. For example, octave:13> a error: `a' undefined octave:14> eval ("a = 13") a = 13 ans = 13 octave:15> a a = 13 In this case, two values are printed: one for the expression that was evaluated, and one for the value returned from `eval'. Just as with any other expression, you can turn printing off by ending the expression in a semicolon. For example, octave:13> a error: `a' undefined octave:14> eval ("a = 13;") ans = 13 octave:15> a a = 13 The function `feval (NAME, ...)' can be used to evaluate the function named NAME. Any arguments after the first are passed on to the named function. For example, octave:12> feval ("acos", -1) ans = 3.1416 calls the function `acos' with the argument `-1'. The function `feval' is necessary in order to be able to write functions that call user-supplied functions, because Octave does not have a way to declare a pointer to a function (like C) or to declare a special kind of variable that can be used to hold the name of a function (like `EXTERNAL' in Fortran). Instead, you must refer to functions by name, and use `feval' to call them. For example, here is a simple-minded function for finding the root of a function of one variable: function result = newtroot (fname, x) # usage: newtroot (fname, x) # # fname : a string naming a function f(x). # x : initial guess delta = tol = sqrt (eps); maxit = 200; fx = feval (fname, x); for i = 1:maxit if (abs (fx) < tol) result = x; return; else fx_new = feval (fname, x + delta); deriv = (fx_new - fx) / delta; x = x - fx / deriv; fx = fx_new; endif endfor result = x; endfunction Note that this is only meant to be an example of calling user-supplied functions and should not be taken too seriously. In addition to using a more robust algorithm, any serious code would check the number and type of all the arguments, ensure that the supplied function really was a function, etc.  File: octave.info, Node: Miscellaneous Utilities, Prev: Evaluating Strings as Commands, Up: Programming Utilities Miscellaneous Utilities ======================= The following functions allow you to determine the size of a variable or expression, find out whether a variable exists, print error messages, or delete variable names from the symbol table. `columns (A)' Return the number of columns of A. `rows (A)' Return the number of rows of A. `length (A)' Return the number of rows of A or the number of columns of A, whichever is larger. `size (A)' Return the number rows and columns of A. If there is only one output argument, the result is returned in a 2 element row vector. If there are two output arguments, the number of rows is assigned to the first, and the number of columns to the second. For example, octave:13> size ([1, 2; 3, 4; 5, 6]) ans = 3 2 octave:14> [nr, nc] = size ([1, 2; 3, 4; 5, 6]) nr = 3 nc = 2 `is_global (A)' Return 1 if A is globally visible. Otherwise, return 0. `is_matrix (A)' Return 1 if A is a matrix. Otherwise, return 0. `is_vector (A)' Return 1 if A is a vector. Otherwise, return 0. `is_scalar (A)' Return 1 if A is a scalar. Otherwise, return 0. `is_square (X)' If X is a square matrix, then return the dimension of X. Otherwise, return 0. `is_symmetric (X, TOL)' If X is symmetric within the tolerance specified by TOL, then return the dimension of X. Otherwise, return 0. If TOL is omitted, use a tolerance equal to the machine precision. `isstr (A)' Return 1 if A is a string. Otherwise, return 0. `isempty (A)' Return 1 if A is an empty matrix (either the number of rows, or the number of columns, or both are zero). Otherwise, return 0. `clear PATTERN ...' Delete the names matching the given patterns from the symbol table. The pattern may contain the following special characters: `?' Match any single character. `*' Match zero or more characters. `[ LIST ]' Match the list of characters specified by LIST. If the first character is `!' or `^', match all characters except those specified by LIST. For example, the pattern `[a-zA-Z]' will match all lower and upper case alphabetic characters. For example, the command clear foo b*r clears the name `foo' and all names that begin with the letter `b' and end with the letter `r'. If `clear' is called without any arguments, all user-defined variables (local and global) are cleared from the symbol table. If `clear' is called with at least one argument, only the visible names matching the arguments are cleared. For example, suppose you have defined a function `foo', and then hidden it by performing the assignment `foo = 2'. Executing the command `clear foo' once will clear the variable definition and restore the definition of `foo' as a function. Executing `clear foo' a second time will clear the function definition. This command may not be used within a function body. `who OPTIONS PATTERN ...' List currently defined symbols matching the given patterns. The following are valid options. They may be shortened to one character but may not be combined. `-all' List all currently defined symbols. `-builtins' List built-in variables and functions. This includes all currently compiled function files, but does not include all function files that are in the `LOADPATH'. `-functions' List user-defined functions. `-long' Print a long listing including the type and dimensions of any symbols. The symbols in the first column of output indicate whether it is possible to redefine the symbol, and whether it is possible for it to be cleared. `-variables' List user-defined variables. Valid patterns are the same as described for the `clear' command above. If no patterns are supplied, all symbols from the given category are listed. By default, only user defined functions and variables visible in the local scope are displayed. The command `whos' is equivalent to `who -long'. `exist (NAME)' Return 1 if the name exists as a variable, and 2 if the name (after appending `.m') is a function file in the path. Otherwise, return 0. `error (MSG)' Print the message MSG, prefixed by the string `error: ', and set Octave's internal error state such that control will return to the top level without evaluating any more commands. This is useful for aborting from functions. If MSG does not end with a new line character, Octave will print a traceback of all the function calls leading to the error. For example, function f () g () end function g () h () end function h () nargin == 1 || error ("nargin != 1"); end f () error: nargin != 1 error: evaluating index expression near line 1, column 30 error: evaluating binary operator `||' near line 1, column 27 error: called from `h' error: called from `g' error: called from `f' produces a list of messages that can help you to quickly locate the exact location of the error. If MSG ends in a new line character, Octave will only print MSG and will not display any traceback messages as it returns control to the top level. For example, modifying the error message in the previous example to end in a new line causes Octave to only print a single message: function h () nargin == 1 || error ("nargin != 1\n"); end f () error: nargin != 1 `warning (MSG)' Print the message MSG prefixed by the string `warning: '. `usage (MSG)' Print the message MSG, prefixed by the string `usage: ', and set Octave's internal error state such that control will return to the top level without evaluating any more commands. This is useful for aborting from functions. After `usage' is evaluated, Octave will print a traceback of all the function calls leading to the usage message. `perror (NAME, NUM)' Print the error message for function NAME corresponding to the error number NUM. This function is intended to be used to print useful error messages for those functions that return numeric error codes. `menu (TITLE, OPT1, ...)' Print a title string followed by a series of options. Each option will be printed along with a number. The return value is the number of the option selected by the user. This function is useful for interactive programs. There is no limit to the number of options that may be passed in, but it may be confusing to present more than will fit easily on one screen. `document SYMBOL TEXT' Set the documentation string for SYMBOL to TEXT. `file_in_path (PATH, FILE)' Return the absolute name name of FILE if it can be found in PATH. The value of PATH should be a colon-separated list of directories in the format described for the built-in variable `LOADPATH'. If the file cannot be found in the path, an empty matrix is returned. For example, octave:13> file_in_path (LOADPATH, "nargchk.m") ans = /usr/local/lib/octave/1.1.0/m/general/nargchk.m `nargchk (NARGIN_MIN, NARGIN_MAX, N)' If N is in the range NARGIN_MIN through NARGIN_MAX inclusive, return the empty matrix. Otherwise, return a message indicating whether N is too large or too small. This is useful for checking to see that the number of arguments supplied to a function is within an acceptable range. `octave_tmp_file_name' Return a unique temporary file name. Since the named file is not opened, by `octave_tmp_file_name', it is possible (though relatively unlikely) that it will not be available by the time your program attempts to open it. `type NAME ...' Display the definition of each NAME that refers to a function. Currently, Octave can only display functions that can be compiled cleanly, because it uses its internal representation of the function to recreate the program text. Comments are not displayed because Octave's currently discards them as it converts the text of a function file to its internal representation. This problem may be fixed in a future release. `which NAME ...' Display the type of each NAME. If NAME is defined from a function file, the full name of the file is also displayed.  File: octave.info, Node: Amusements, Next: Installation, Prev: Programming Utilities, Up: Top Amusements ********** Octave cannot promise that you will actually win the lotto, but it can pick your numbers for you. The function `texas_lotto' will select six numbers between 1 and 50. The function `list_primes (N)' uses a brute-force algorithm to compute the first N primes. Other amusing functions include `casesen', `flops', `sombrero', `exit', and `quit'.  File: octave.info, Node: Installation, Next: Trouble, Prev: Amusements, Up: Top Installing Octave ***************** Here is the procedure for installing Octave from scratch on a Unix system. For instructions on how to install the binary distributions of Octave, see *Note Binary Distributions::. * Run the shell script `configure'. This will determine the features your system has (or doesn't have) and create a file named Makefile from each of the files named Makefile.in. Here is a summary of the configure options that are most frequently used when building Octave: `--prefix=PREFIX' Install Octave in subdirectories below PREFIX. The default value of PREFIX is `/usr/local'. `--srcdir=DIR' Look for Octave sources in the directory DIR. `--with-f2c' Use f2c even if Fortran compiler is available. `--enable-dld' Use DLD to make Octave capable of dynamically linking externally compiled functions. This only works on systems that have a working port of DLD. `--enable-lite-kernel' Compile smaller kernel. This currently requires DLD so that Octave can load functions at run time that are not loaded at compile time. `--help' Print a summary of the options recognized by the configure script. See the file INSTALL for more information about the command line options used by configure. That file also contains instructions for compiling in a directory other than where the source is located. * Run make. You will need a recent version of GNU make. Modifying Octave's Makefiles to work with other make programs is probably not worth your time. We recommend you get and compile GNU make instead. For plotting, you will need to have gnuplot installed on your system. Gnuplot is a command-driven interactive function plotting program. Gnuplot is copyrighted, but freely distributable. The `gnu' in gnuplot is a coincidence--it is not related to the GNU project or the FSF in any but the most peripheral sense. For version 1.1.0, you must have the GNU C++ compiler (gcc) version 2.6.3 or later to compile Octave. You will also need version 2.6.1 of the GNU C++ class library (libg++). If you plan to modify the parser you will also need GNU bison and fles. If you modify the documentation, you will need GNU Texinfo, along with the patch for the makeinfo program that is distributed with Octave. GNU make, gcc, and libg++, gnuplot, bison, flex, and Texinfo are all available from many anonymous ftp archives, including ftp.che.utexas.edu, ftp.uu.net, prep.ai.mit.edu, and wuarchive.wustl.edu. If you don't have a Fortran compiler, or if your Fortran compiler doesn't work like the traditional Unix f77, you will need to have the Fortran to C translator f2c. You can get f2c from any number of anonymous ftp archives. The most recent version of f2c is always available from research.att.com. On an otherwise idle SPARCstation II, it will take somewhere between 60 and 90 minutes to compile everything, depending on whether you are compiling the Fortran libraries with f2c or using the Fortran compiler directly. You will need about 50 megabytes of disk storage to work with (considerably less if you don't compile with debugging symbols). To do that, use the command make CFLAGS=-O CXXFLAGS=-O LDFLAGS= instead of just `make'. * If you encounter errors while compiling Octave, first check the list of known problems below to see if there is a workaround or solution for your problem. If not, see *Note Trouble::, for information about how to report bugs. * Once you have successfully compiled Octave, run `make install'. This will install a copy of octave, its libraries, and its documentation in the destination directory. As distributed, Octave is installed in the following directories: `PREFIX/bin' Octave and other binaries that people will want to run directly. `PREFIX/lib' Libraries like libcruft.a and liboctave.a. `PREFIX/include/octave' Include files distributed with Octave. `PREFIX/man/man1' Unix-style man pages describing Octave. `PREFIX/info' Info files describing Octave. `PREFIX/lib/octave/VERSION/m' Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. `PREFIX/lib/octave/VERSION/exec/HOST_TYPE' Executables to be run by Octave rather than the user. `PREFIX/lib/octave/VERSION/oct/HOST_TYPE' Object files that will be dynamically loaded. `PREFIX/lib/octave/VERSION/imagelib' Image files that are distributed with Octave. where PREFIX defaults to `/usr/local', VERSION stands for the current version number of the interpreter, and HOST_TYPE is the type of computer on which Octave is installed (for example, `i486-unknown-gnu'). * Menu: * Installation Problems:: * Binary Distributions::  File: octave.info, Node: Installation Problems, Next: Binary Distributions, Prev: Installation, Up: Installation Installation Problems ===================== This section contains a list of problems (and some apparent problems that don't really mean anything is wrong) that may show up during installation of Octave. * On AIX (and possibly other) systems, GCC 2.6.2 generates invalid assembly code when compiling some parts of Octave. On AIX systems, it is possible to get a working binary by not using the compiler flag `-fno-implicit-templates'. You can specify this as an option to make by using a command like make NO_IMPLICIT_TEMPLATES= * You may need to edit some files in the gcc include subdirectory to add prototypes for functions there. For example, Ultrix 4.2 needs proper declarations for the `signal()' and the `SIG_IGN' macro in the file `signal.h'. On some systems the `SIG_IGN' macro is defined to be something like this: #define SIG_IGN (void (*)())1 when it should really be something like: #define SIG_IGN (void (*)(int))1 to match the prototype declaration for `signal()'. The gcc fixincludes/fixproto script should probably fix this when gcc installs its modified set of header files, but I don't think that's been done yet. * There is a bug with the makeinfo program that is distributed with texinfo-3.1 that causes the indices in Octave's on-line manual to be generated incorrectly. If you need to recreate the on-line documentation, you should get the makeinfo program that is distributed with texinfo-3.1 and apply the patch for makeinfo that is distributed with Octave. See the file MAKEINFO.PATCH for more details. * If you don't have NPSOL but you still want to be able to solve NLPs, or if you don't have QPSOL but you still want to solve QPs, you'll need to find replacements or order them from Stanford. If you know of a freely redistributable replacement, please let us know--we might be interested in distributing it with Octave. You can get more information about NPSOL and QPSOL from Stanford University Office of Technology Licensing 857 Serra Street Stanford CA 94305-6225 Tel: (415) 723-0651 Fax: (415) 725-7295 Octave may soon support FSQP, an NLP solver from Andre Tits (andre@src.umd.edu) of the University of Maryland. FSQP is available free of charge to academic sites, but can not be redistributed to third parties. * Some of the Fortran subroutines may fail to compile with older versions of the Sun Fortran compiler. If you get errors like zgemm.f: zgemm: warning: unexpected parent of complex expression subtree zgemm.f, line 245: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 304: warning: unexpected parent of complex expression subtree warning: unexpected parent of complex expression subtree zgemm.f, line 327: warning: unexpected parent of complex expression subtree pcc_binval: missing IR_CONV in complex op make[2]: *** [zgemm.o] Error 1 when compiling the Fortran subroutines in the `libcruft' subdirectory, you should either upgrade your compiler or try compiling with optimization turned off. * On NeXT systems with gcc 2.5.8, if you get errors like this: /usr/tmp/cc007458.s:unknown:Undefined local symbol LBB7656 /usr/tmp/cc007458.s:unknown:Undefined local symbol LBE7656 when compiling `Array.cc' and `Matrix.cc', try recompiling these files without `-g'. * Some people have reported that calls to shell_cmd and the pager do not work on SunOS systems. This is apparently due to having `G_HAVE_SYS_WAIT' defined to be 0 instead of 1 when compiling libg++. * On NeXT systems with gcc 2.5.8, linking to `libsys_s.a' may fail to resolve the following functions _tcgetattr _tcsetattr _tcflow which are part of `libposix.a'. Unfortunately, linking Octave with `-posix' results in the following undefined symbols. .destructors_used .constructors_used _objc_msgSend _NXGetDefaultValue _NXRegisterDefaults .objc_class_name_NXStringTable .objc_class_name_NXBundle One kludge around this problem is to extract `termios.o' from `libposix.a', put it in Octave's `src' directory, and add it to the list of files to link together in the Makefile. Suggestions for better ways to solve this problem are welcome! * With g++ 2.6.3 (and possibly other 2.6.x versions) on some Intel x86 systems, compiling `Array-d.cc' fails with the messages like as: /tmp/cc005254.s:4057: Local symbol LBB103 never defined. as: /tmp/cc005254.s:4057: Local symbol LBE103 never defined. A possible workaround for this is to compile without `-g'. * If Octave crashes immediately with a floating point exception, it is likely that it is failing to initialize the IEEE floating point values for infinity and NaN. If your system actually does support IEEE arithmetic, you should be able to fix this problem by modifying the function `octave_ieee_init' in the file `sysdep.cc' to correctly initialize Octave's internal infinity and NaN variables. If your system does not support IEEE arithmetic but Octave's configure script incorrectly determined that it does, you can work around the problem by editing the file `config.h' to not define `HAVE_ISINF', `HAVE_FINITE', and `HAVE_ISNAN'. In any case, please report this as a bug since it might be possible to modify Octave's configuration script to automatically determine the proper thing to do.  File: octave.info, Node: Binary Distributions, Prev: Installation Problems, Up: Installation Binary Distributions ==================== This section contains instructions for creating and installing a binary distribution. * Menu: * Installing Octave from a Binary Distribution:: * Creating a Binary Distribution::  File: octave.info, Node: Installing Octave from a Binary Distribution, Next: Creating a Binary Distribution, Prev: Binary Distributions, Up: Binary Distributions Installing Octave from a Binary Distribution -------------------------------------------- * To install Octave from a binary distribution, execute the command sh ./doinstall.sh in the top level directory of the distribution. Binary distributions are normally compiled assuming that Octave will be installed in the following subdirectories of `/usr/local'. `bin' Octave and other binaries that people will want to run directly. `man/man1' Unix-style man pages describing Octave. `info' Info files describing Octave. `lib/octave/VERSION/m' Function files distributed with Octave. This includes the Octave version, so that multiple versions of Octave may be installed at the same time. `lib/octave/VERSION/exec/HOST_TYPE' Executables to be run by Octave rather than the user. `lib/octave/VERSION/imagelib' Image files that are distributed with Octave. where VERSION stands for the current version number of the interpreter, and HOST_TYPE is the type of computer on which Octave is installed (for example, `i486-unknown-gnu'). If these directories don't exist, the script `doinstall.sh' will create them for you. If this is possible for you to install Octave in `/usr/local', or if you would prefer to install it in a different directory, you can specify the name of the top level directory as an argument to the doinstall.sh script. For example: sh ./doinstall.sh /some/other/directory Octave will then be installed in subdirectories of the directory `/some/other/directory'  File: octave.info, Node: Creating a Binary Distribution, Prev: Installing Octave from a Binary Distribution, Up: Binary Distributions Creating a Binary Distribution ------------------------------ Here is how to build a binary distribution for others. * Build Octave in the same directory as the source. This is required since the `binary-dist' targets in the Makefiles will not work if you compile outside the source tree. * Use `CFLAGS=-O CXXFLAGS=-O LDFLAGS=' as arguments for Make because most people who get the binary distributions are probably not going to be interested in debugging Octave. * Type `make binary-dist'. This will build everything and then pack it up for distribution.  File: octave.info, Node: Trouble, Next: Command Line Editing, Prev: Installation, Up: Top Known Causes of Trouble with Octave *********************************** This section describes known problems that affect users of Octave. Most of these are not Octave bugs per se--if they were, we would fix them. But the result for a user may be like the result of a bug. Some of these problems are due to bugs in other software, some are missing features that are too much work to add, and some are places where people's opinions differ as to what is best. * Menu: * Actual Bugs:: Bugs we will fix later. * Reporting Bugs:: * Bug Criteria:: * Bug Lists:: * Bug Reporting:: * Sending Patches:: * Service::  File: octave.info, Node: Actual Bugs, Next: Reporting Bugs, Prev: Trouble, Up: Trouble Actual Bugs We Haven't Fixed Yet ================================ * Output that comes directly from Fortran functions is not sent through the pager and may appear out of sequence with other output that is sent through the pager. One way to avoid this is to force pending output to be flushed before calling a function that will produce output from within Fortran functions. To do this, use the command fflush (stdout) Another possible workaround is to use the command page_screen_output = "false" to turn the pager off. * Control-C doesn't work properly in the pager on DEC Alpha systems running OSF/1 3.0. This appears to be a bug in the OSF/1 3.0 Bourne shell. The problem doesn't appear on systems running OSF/1 1.3. * If you get messages like Input line too long when trying to plot many lines on one graph, you have probably generated a plot command that is too larger for `gnuplot''s fixed-length buffer for commands. Splitting up the plot command doesn't help because replot is implemented in gnuplot by simply appending the new plotting commands to the old command line and then evaluating it again. You can demonstrate this `feature' by running gnuplot and doing something like plot sin (x), sin (x), sin (x), ... lots more ..., sin (x) and then replot sin (x), sin (x), sin (x), ... lots more ..., sin (x) after repeating the replot command a few times, gnuplot will give you an error. Also, it doesn't help to use backslashes to enter a plot command over several lines, because the limit is on the overall command line length, once the backslashed lines are all pasted together. Because of this, Octave tries to use as little of the command-line length as possible by using the shortest possible abbreviations for all the plot commands and options. Unfortunately, the length of the temporary file names is probably what is taking up the most space on the command line. You can buy a little bit of command line space by setting the environment variable `TMPDIR' to be "." before starting Octave, or you can increase the maximum command line length in gnuplot by changing the following limits in the file plot.h in the gnuplot distribution and recompiling gnuplot. #define MAX_LINE_LEN 32768 /* originally 1024 */ #define MAX_TOKENS 8192 /* originally 400 */ Of course, this doesn't really fix the problem, but it does make it much less likely that you will run into trouble unless you are putting a very large number of lines on a given plot. * String handling could use some work. A list of ideas for future enhancements is distributed with Octave. See the file `PROJECTS' in the top level directory in the source distribution.  File: octave.info, Node: Reporting Bugs, Next: Bug Criteria, Prev: Actual Bugs, Up: Trouble Reporting Bugs ============== Your bug reports play an essential role in making Octave reliable. When you encounter a problem, the first thing to do is to see if it is already known. *Note Trouble::. If it isn't known, then you should report the problem. Reporting a bug may help you by bringing a solution to your problem, or it may not. In any case, the principal function of a bug report is to help the entire community by making the next version of Octave work better. Bug reports are your contribution to the maintenance of Octave. In order for a bug report to serve its purpose, you must include the information that makes it possible to fix the bug. If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function `bug_report'. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. * Menu: * Bug Criteria:: * Where: Bug Lists. Where to send your bug report. * Reporting: Bug Reporting. How to report a bug effectively. * Patches: Sending Patches. How to send a patch for Octave. octave-1.1.0/doc/octave.info-8100666 415 17 137634 5705317773 14303 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: Bug Criteria, Next: Bug Lists, Prev: Reporting Bugs, Up: Trouble Have You Found a Bug? ===================== If you are not sure whether you have found a bug, here are some guidelines: * If Octave gets a fatal signal, for any input whatever, that is a bug. Reliable interpreters never crash. * If Octave produces incorrect results, for any input whatever, that is a bug. * Some output may appear to be incorrect when it is in fact due to a program whose behavior is undefined, which happened by chance to give the desired results on another system. For example, the range operator may produce different results because of differences in the way floating point arithmetic is handled on various systems. * If Octave produces an error message for valid input, that is a bug. * If Octave does not produce an error message for invalid input, that is a bug. However, you should note that your idea of "invalid input" might be my idea of "an extension" or "support for traditional practice". * If you are an experienced user of programs like Octave, your suggestions for improvement are welcome in any case.  File: octave.info, Node: Bug Lists, Next: Bug Reporting, Prev: Bug Criteria, Up: Trouble Where to Report Bugs ==================== If you have Octave working at all, the easiest way to prepare a complete bug report is to use the Octave function `bug_report'. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. If for some reason you cannot use Octave's `bug_report' function, send bug reports for Octave to: bug-octave@che.utexas.edu *Do not send bug reports to `help-octave'*. Most users of Octave do not want to receive bug reports. Those that do have asked to be on `bug-octave'. As a last resort, send bug reports on paper to: Octave Bugs c/o John W. Eaton Department of Chemical Engineering The University of Texas at Austin Austin, Texas 78712  File: octave.info, Node: Bug Reporting, Next: Sending Patches, Prev: Bug Lists, Up: Trouble How to Report Bugs ================== The fundamental principle of reporting bugs usefully is this: *report all the facts*. If you are not sure whether to state a fact or leave it out, state it! Often people omit facts because they think they know what causes the problem and they conclude that some details don't matter. Thus, you might assume that the name of the variable you use in an example does not matter. Well, probably it doesn't, but one cannot be sure. Perhaps the bug is a stray memory reference which happens to fetch from the location where that name is stored in memory; perhaps, if the name were different, the contents of that location would fool the interpreter into doing the right thing despite the bug. Play it safe and give a specific, complete example. Keep in mind that the purpose of a bug report is to enable someone to fix the bug if it is not known. Always write your bug reports on the assumption that the bug is not known. Sometimes people give a few sketchy facts and ask, "Does this ring a bell?" This cannot help us fix a bug. It is better to send a complete bug report to begin with. Try to make your bug report self-contained. If we have to ask you for more information, it is best if you include all the previous information in your response, as well as the information that was missing. To enable someone to investigate the bug, you should include all these things: * The version of Octave. You can get this by noting the version number that is printed when Octave starts, or running it with the `-v' option. * A complete input file that will reproduce the bug. A single statement may not be enough of an example--the bug might depend on other details that are missing from the single statement where the error finally occurs. * The command arguments you gave Octave to execute that example and observe the bug. To guarantee you won't omit something important, list all the options. If we were to try to guess the arguments, we would probably guess wrong and then we would not encounter the bug. * The type of machine you are using, and the operating system name and version number. * The command-line arguments you gave to the `configure' command when you installed the interpreter. * A complete list of any modifications you have made to the interpreter source. Be precise about these changes--show a context diff for them. * Details of any other deviations from the standard procedure for installing Octave. * A description of what behavior you observe that you believe is incorrect. For example, "The interpreter gets a fatal signal," or, "The output produced at line 208 is incorrect." Of course, if the bug is that the interpreter gets a fatal signal, then one can't miss it. But if the bug is incorrect output, we might not notice unless it is glaringly wrong. Even if the problem you experience is a fatal signal, you should still say so explicitly. Suppose something strange is going on, such as, your copy of the interpreter is out of synch, or you have encountered a bug in the C library on your system. Your copy might crash and the copy here would not. If you said to expect a crash, then when the interpreter here fails to crash, we would know that the bug was not happening. If you don't say to expect a crash, then we would not know whether the bug was happening. We would not be able to draw any conclusion from our observations. Often the observed symptom is incorrect output when your program is run. Unfortunately, this is not enough information unless the program is short and simple. It is very helpful if you can include an explanation of the expected output, and why the actual output is incorrect. * If you wish to suggest changes to the Octave source, send them as context diffs. If you even discuss something in the Octave source, refer to it by context, not by line number, because the line numbers in the development sources probalby won't match those in your sources. Here are some things that are not necessary: * A description of the envelope of the bug. Often people who encounter a bug spend a lot of time investigating which changes to the input file will make the bug go away and which changes will not affect it. Such information is usually not necessary to enable us to fix bugs in Octave, but if you can find a simpler example to report *instead* of the original one, that is a convenience. Errors in the output will be easier to spot, running under the debugger will take less time, etc. Most Octave bugs involve just one function, so the most straightforward way to simplify an example is to delete all the function definitions except the one in which the bug occurs. However, simplification is not vital; if you don't want to do this, report the bug anyway and send the entire test case you used. * A patch for the bug. Patches can be helpful, but if you find a bug, you should report it, even if you cannot send a fix for the problem.  File: octave.info, Node: Sending Patches, Next: Service, Prev: Bug Reporting, Up: Trouble Sending Patches for Octave ========================== If you would like to write bug fixes or improvements for Octave, that is very helpful. When you send your changes, please follow these guidelines to avoid causing extra work for us in studying the patches. If you don't follow these guidelines, your information might still be useful, but using it will take extra work. Maintaining Octave is a lot of work in the best of circumstances, and we can't keep up unless you do your best to help. * Send an explanation with your changes of what problem they fix or what improvement they bring about. For a bug fix, just include a copy of the bug report, and explain why the change fixes the bug. * Always include a proper bug report for the problem you think you have fixed. We need to convince ourselves that the change is right before installing it. Even if it is right, we might have trouble judging it if we don't have a way to reproduce the problem. * Include all the comments that are appropriate to help people reading the source in the future understand why this change was needed. * Don't mix together changes made for different reasons. Send them *individually*. If you make two changes for separate reasons, then we might not want to install them both. We might want to install just one. * Use `diff -c' to make your diffs. Diffs without context are hard for us to install reliably. More than that, they make it hard for us to study the diffs to decide whether we want to install them. Unidiff format is better than contextless diffs, but not as easy to read as `-c' format. If you have GNU diff, use `diff -cp', which shows the name of the function that each change occurs in. * Write the change log entries for your changes. Read the `ChangeLog' file to see what sorts of information to put in, and to learn the style that we use. The purpose of the change log is to show people where to find what was changed. So you need to be specific about what functions you changed; in large functions, it's often helpful to indicate where within the function the change was made. On the other hand, once you have shown people where to find the change, you need not explain its purpose. Thus, if you add a new function, all you need to say about it is that it is new. If you feel that the purpose needs explaining, it probably does--but the explanation will be much more useful if you put it in comments in the code. If you would like your name to appear in the header line for who made the change, send us the header line.  File: octave.info, Node: Service, Prev: Sending Patches, Up: Trouble How To Get Help with Octave =========================== If you need help installing, using or changing Octave, the mailing list help-octave@che.utexas.edu exists for the discussion of Octave matters related to using, installing, and porting Octave. If you would like to join the discussion, please send a short note to help-octave-request@che.utexas.edu ^^^^^^^ *Please do not* send requests to be added or removed from the the mailing list, or other administrative trivia to the list itself.  File: octave.info, Node: Command Line Editing, Next: Using Info, Prev: Trouble, Up: Top Command Line Editing ******************** This text describes GNU's command line editing interface. It is relatively old and may not be entirely correct now. Please send a message to `bug-octave@che.utexas.edu' if you find any errors. *Note Reporting Bugs::, for more information about how to report bugs. * Menu: * Introduction and Notation:: Notation used in this text. * Readline Interaction:: The minimum set of commands for editing a line. * Readline Bare Essentials:: * Readline Movement Commands:: * Readline Killing Commands:: * Readline Arguments:: * Readline Init File:: Customizing Readline from a user's view. * Readline Init Syntax:: * Readline Vi Mode::  File: octave.info, Node: Introduction and Notation, Next: Readline Interaction, Prev: Command Line Editing, Up: Command Line Editing Introduction to Line Editing ============================ The following paragraphs describe the notation we use to represent keystrokes. The text C-k is read as `Control-K' and describes the character produced when the Control key is depressed and the k key is struck. The text M-k is read as `Meta-K' and describes the character produced when the meta key (if you have one) is depressed, and the k key is struck. If you do not have a meta key, the identical keystroke can be generated by typing ESC first, and then typing k. Either process is known as "metafying" the k key. The text M-C-k is read as `Meta-Control-k' and describes the character produced by "metafying" C-k. In addition, several keys have their own names. Specifically, DEL, ESC, LFD, SPC, RET, and TAB all stand for themselves when seen in this text, or in an init file (*note Readline Init File::., for more info).  File: octave.info, Node: Readline Interaction, Next: Readline Bare Essentials, Prev: Introduction and Notation, Up: Command Line Editing Readline Interaction ==================== Often during an interactive session you type in a long line of text, only to notice that the first word on the line is misspelled. The Readline library gives you a set of commands for manipulating the text as you type it in, allowing you to just fix your typo, and not forcing you to retype the majority of the line. Using these editing commands, you move the cursor to the place that needs correction, and delete or insert the text of the corrections. Then, when you are satisfied with the line, you simply press RETURN. You do not have to be at the end of the line to press RETURN; the entire line is accepted regardless of the location of the cursor within the line. * Menu: * Readline Bare Essentials:: The least you need to know about Readline. * Readline Movement Commands:: Moving about the input line. * Readline Killing Commands:: How to delete text, and how to get it back! * Readline Arguments:: Giving numeric arguments to commands.  File: octave.info, Node: Readline Bare Essentials, Next: Readline Movement Commands, Prev: Readline Interaction, Up: Command Line Editing Readline Bare Essentials ======================== In order to enter characters into the line, simply type them. The typed character appears where the cursor was, and then the cursor moves one space to the right. If you mistype a character, you can use DEL to back up, and delete the mistyped character. Sometimes you may miss typing a character that you wanted to type, and not notice your error until you have typed several other characters. In that case, you can type C-b to move the cursor to the left, and then correct your mistake. Afterwards, you can move the cursor to the right with C-f. When you add text in the middle of a line, you will notice that characters to the right of the cursor get `pushed over' to make room for the text that you have inserted. Likewise, when you delete text behind the cursor, characters to the right of the cursor get `pulled back' to fill in the blank space created by the removal of the text. A list of the basic bare essentials for editing the text of an input line follows. C-b Move back one character. C-f Move forward one character. DEL Delete the character to the left of the cursor. C-d Delete the character underneath the cursor. Printing characters Insert itself into the line at the cursor. C-_ Undo the last thing that you did. You can undo all the way back to an empty line.  File: octave.info, Node: Readline Movement Commands, Next: Readline Killing Commands, Prev: Readline Bare Essentials, Up: Command Line Editing Readline Movement Commands ========================== The above table describes the most basic possible keystrokes that you need in order to do editing of the input line. For your convenience, many other commands have been added in addition to C-b, C-f, C-d, and DEL. Here are some commands for moving more rapidly about the line. C-a Move to the start of the line. C-e Move to the end of the line. M-f Move forward a word. M-b Move backward a word. C-l Clear the screen, reprinting the current line at the top. Notice how C-f moves forward a character, while M-f moves forward a word. It is a loose convention that control keystrokes operate on characters while meta keystrokes operate on words.  File: octave.info, Node: Readline Killing Commands, Next: Readline Arguments, Prev: Readline Movement Commands, Up: Command Line Editing Readline Killing Commands ========================= "Killing" text means to delete the text from the line, but to save it away for later use, usually by "yanking" it back into the line. If the description for a command says that it `kills' text, then you can be sure that you can get the text back in a different (or the same) place later. Here is the list of commands for killing text. C-k Kill the text from the current cursor position to the end of the line. M-d Kill from the cursor to the end of the current word, or if between words, to the end of the next word. M-DEL Kill from the cursor to the start of the previous word, or if between words, to the start of the previous word. C-w Kill from the cursor to the previous whitespace. This is different than M-DEL because the word boundaries differ. And, here is how to "yank" the text back into the line. Yanking is C-y Yank the most recently killed text back into the buffer at the cursor. M-y Rotate the kill-ring, and yank the new top. You can only do this if the prior command is C-y or M-y. When you use a kill command, the text is saved in a "kill-ring". Any number of consecutive kills save all of the killed text together, so that when you yank it back, you get it in one clean sweep. The kill ring is not line specific; the text that you killed on a previously typed line is available to be yanked back later, when you are typing another line.  File: octave.info, Node: Readline Arguments, Next: Readline Init File, Prev: Readline Killing Commands, Up: Command Line Editing Readline Arguments ================== You can pass numeric arguments to Readline commands. Sometimes the argument acts as a repeat count, other times it is the sign of the argument that is significant. If you pass a negative argument to a command which normally acts in a forward direction, that command will act in a backward direction. For example, to kill text back to the start of the line, you might type M- C-k. The general way to pass numeric arguments to a command is to type meta digits before the command. If the first `digit' you type is a minus sign (-), then the sign of the argument will be negative. Once you have typed one meta digit to get the argument started, you can type the remainder of the digits, and then the command. For example, to give the C-d command an argument of 10, you could type M-1 0 C-d.  File: octave.info, Node: Readline Init File, Next: Readline Init Syntax, Prev: Readline Arguments, Up: Command Line Editing Readline Init File ================== Although the Readline library comes with a set of Emacs-like keybindings, it is possible that you would like to use a different set of keybindings. You can customize programs that use Readline by putting commands in an "init" file in your home directory. The name of this file is `~/.inputrc'. When a program which uses the Readline library starts up, the `~/.inputrc' file is read, and the keybindings are set. In addition, the C-x C-r command re-reads this init file, thus incorporating any changes that you might have made to it. * Menu: * Readline Init Syntax:: Syntax for the commands in `~/.inputrc'. * Readline Vi Mode:: Switching to `vi' mode in Readline.  File: octave.info, Node: Readline Init Syntax, Next: Readline Vi Mode, Prev: Readline Init File, Up: Command Line Editing Readline Init Syntax ==================== There are only four constructs allowed in the `~/.inputrc' file: Variable Settings You can change the state of a few variables in Readline. You do this by using the `set' command within the init file. Here is how you would specify that you wish to use Vi line editing commands: set editing-mode vi Right now, there are only a few variables which can be set; so few in fact, that we just iterate them here: `editing-mode' The `editing-mode' variable controls which editing mode you are using. By default, GNU Readline starts up in Emacs editing mode, where the keystrokes are most similar to Emacs. This variable can either be set to `emacs' or `vi'. `horizontal-scroll-mode' This variable can either be set to `On' or `Off'. Setting it to `On' means that the text of the lines that you edit will scroll horizontally on a single screen line when they are larger than the width of the screen, instead of wrapping onto a new screen line. By default, this variable is set to `Off'. `mark-modified-lines' This variable when set to `On', says to display an asterisk (`*') at the starts of history lines which have been modified. This variable is off by default. `prefer-visible-bell' If this variable is set to `On' it means to use a visible bell if one is available, rather than simply ringing the terminal bell. By default, the value is `Off'. Key Bindings The syntax for controlling keybindings in the `~/.inputrc' file is simple. First you have to know the name of the command that you want to change. The following pages contain tables of the command name, the default keybinding, and a short description of what the command does. Once you know the name of the command, simply place the name of the key you wish to bind the command to, a colon, and then the name of the command on a line in the `~/.inputrc' file. The name of the key can be expressed in different ways, depending on which is most comfortable for you. KEYNAME: FUNCTION-NAME or MACRO KEYNAME is the name of a key spelled out in English. For example: Control-u: universal-argument Meta-Rubout: backward-kill-word Control-o: ">&output" In the above example, C-u is bound to the function `universal-argument', and C-o is bound to run the macro expressed on the right hand side (that is, to insert the text `>&output' into the line). "KEYSEQ": FUNCTION-NAME or MACRO KEYSEQ differs from KEYNAME above in that strings denoting an entire key sequence can be specified. Simply place the key sequence in double quotes. GNU Emacs style key escapes can be used, as in the following example: "\C-u": universal-argument "\C-x\C-r": re-read-init-file "\e[11~": "Function Key 1" In the above example, C-u is bound to the function `universal-argument' (just as it was in the first example), C-x C-r is bound to the function `re-read-init-file', and ESC [ 1 1 ~ is bound to insert the text `Function Key 1'. * Menu: * Commands For Moving:: Moving about the line. * Commands For History:: Getting at previous lines. * Commands For Text:: Commands for changing text. * Commands For Killing:: Commands for killing and yanking. * Numeric Arguments:: Specifying numeric arguments, repeat counts. * Commands For Completion:: Getting Readline to do the typing for you. * Miscellaneous Commands:: Other miscellaneous commands.  File: octave.info, Node: Commands For Moving, Next: Commands For History, Prev: Readline Init Syntax, Up: Readline Init Syntax Commands For Moving ------------------- `beginning-of-line (C-a)' Move to the start of the current line. `end-of-line (C-e)' Move to the end of the line. `forward-char (C-f)' Move forward a character. `backward-char (C-b)' Move back a character. `forward-word (M-f)' Move forward to the end of the next word. `backward-word (M-b)' Move back to the start of this, or the previous, word. `clear-screen (C-l)' Clear the screen leaving the current line at the top of the screen.  File: octave.info, Node: Commands For History, Next: Commands For Text, Prev: Commands For Moving, Up: Readline Init Syntax Commands For Manipulating The History ------------------------------------- `accept-line (Newline, Return)' Accept the line regardless of where the cursor is. If this line is non-empty, add it to the history list. If this line was a history line, then restore the history line to its original state. `previous-history (C-p)' Move `up' through the history list. `next-history (C-n)' Move `down' through the history list. `beginning-of-history (M-<)' Move to the first line in the history. `end-of-history (M->)' Move to the end of the input history, i.e., the line you are entering! `reverse-search-history (C-r)' Search backward starting at the current line and moving `up' through the history as necessary. This is an incremental search. `forward-search-history (C-s)' Search forward starting at the current line and moving `down' through the the history as necessary.  File: octave.info, Node: Commands For Text, Next: Commands For Killing, Prev: Commands For History, Up: Readline Init Syntax Commands For Changing Text -------------------------- `delete-char (C-d)' Delete the character under the cursor. If the cursor is at the beginning of the line, and there are no characters in the line, and the last character typed was not C-d, then return EOF. `backward-delete-char (Rubout)' Delete the character behind the cursor. A numeric arg says to kill the characters instead of deleting them. `quoted-insert (C-q, C-v)' Add the next character that you type to the line verbatim. This is how to insert things like C-q for example. `tab-insert (M-TAB)' Insert a tab character. `self-insert (a, b, A, 1, !, ...)' Insert yourself. `transpose-chars (C-t)' Drag the character before point forward over the character at point. Point moves forward as well. If point is at the end of the line, then transpose the two characters before point. Negative args don't work. `transpose-words (M-t)' Drag the word behind the cursor past the word in front of the cursor moving the cursor over that word as well. `upcase-word (M-u)' Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point. `downcase-word (M-l)' Lowercase the current (or following) word. With a negative argument, do the previous word, but do not move point. `capitalize-word (M-c)' Uppercase the current (or following) word. With a negative argument, do the previous word, but do not move point.  File: octave.info, Node: Commands For Killing, Next: Numeric Arguments, Prev: Commands For Text, Up: Readline Init Syntax Killing And Yanking ------------------- `kill-line (C-k)' Kill the text from the current cursor position to the end of the line. `backward-kill-line ()' Kill backward to the beginning of the line. This is normally unbound. `kill-word (M-d)' Kill from the cursor to the end of the current word, or if between words, to the end of the next word. `backward-kill-word (M-DEL)' Kill the word behind the cursor. `unix-line-discard (C-u)' Do what C-u used to do in Unix line input. We save the killed text on the kill-ring, though. `unix-word-rubout (C-w)' Do what C-w used to do in Unix line input. The killed text is saved on the kill-ring. This is different than backward-kill-word because the word boundaries differ. `yank (C-y)' Yank the top of the kill ring into the buffer at point. `yank-pop (M-y)' Rotate the kill-ring, and yank the new top. You can only do this if the prior command is yank or yank-pop.  File: octave.info, Node: Numeric Arguments, Next: Commands For Completion, Prev: Commands For Killing, Up: Readline Init Syntax Specifying Numeric Arguments ---------------------------- `digit-argument (M-0, M-1, ... M--)' Add this digit to the argument already accumulating, or start a new argument. M- starts a negative argument. `universal-argument ()' Do what C-u does in emacs. By default, this is not bound.  File: octave.info, Node: Commands For Completion, Next: Miscellaneous Commands, Prev: Numeric Arguments, Up: Readline Init Syntax Letting Readline Type For You ----------------------------- `complete (TAB)' Attempt to do completion on the text before point. This is implementation defined. Generally, if you are typing a file name argument, you can do file name completion; if you are typing a command, you can do command completion, if you are typing in a symbol to GDB, you can do symbol name completion, if you are typing in a variable to Bash, you can do variable name completion... `possible-completions (M-?)' List the possible completions of the text before point.  File: octave.info, Node: Miscellaneous Commands, Prev: Commands For Completion, Up: Readline Init Syntax Some Miscellaneous Commands --------------------------- `re-read-init-file (C-x C-r)' Read in the contents of your `~/.inputrc' file, and incorporate any bindings found there. `abort (C-g)' Ding! Stops things. `do-uppercase-version (M-a, M-b, ...)' Run the command that is bound to your uppercase brother. `prefix-meta (ESC)' Make the next character that you type be metafied. This is for people without a meta key. Typing ESC f is equivalent to typing M-f. `undo (C-_)' Incremental undo, separately remembered for each line. `revert-line (M-r)' Undo all changes made to this line. This is like typing the `undo' command enough times to get back to the beginning.  File: octave.info, Node: Readline Vi Mode, Prev: Readline Init Syntax, Up: Command Line Editing Readline Vi Mode ================ While the Readline library does not have a full set of Vi editing functions, it does contain enough to allow simple editing of the line. In order to switch interactively between Emacs and Vi editing modes, use the command M-C-j (toggle-editing-mode). When you enter a line in Vi mode, you are already placed in `insertion' mode, as if you had typed an `i'. Pressing ESC switches you into `edit' mode, where you can edit the text of the line with the standard Vi movement keys, move to previous history lines with `k', and following lines with `j', and so forth.  File: octave.info, Node: Using Info, Next: Concept Index, Prev: Command Line Editing, Up: Top Using Info ********** * Menu: * Cursor Commands:: * Scrolling Commands:: * Node Commands:: * Searching Commands:: * Xref Commands:: * Window Commands:: * Printing Nodes:: * Other Info Commands:: * Info Variables:: "Info" is a program which is used to view info files on an ASCII terminal. "info files" are the result of processing texinfo files with the program `makeinfo' or with the Emacs command `M-x texinfo-format-buffer'. Finally, "texinfo" is a documentation language which allows a printed manual and on-line documentation (an info file) to be produced from a single source file. * Menu: * Cursor Commands:: Commands which move the cursor within a node. * Scrolling Commands:: Commands for moving the node around in a window. * Node Commands:: Commands for selecting a new node. * Searching Commands:: Commands for searching an info file. * Xref Commands:: Commands for selecting cross references. * Window Commands:: Commands which manipulate multiple windows. * Printing Nodes:: How to print out the contents of a node. * Other Info Commands:: A few commands that defy categories. * Info Variables:: How to change the default behavior of Info.  File: octave.info, Node: Cursor Commands, Next: Scrolling Commands, Prev: Using Info, Up: Using Info Moving the Cursor ================= Many people find that reading screens of text page by page is made easier when one is able to indicate particular pieces of text with some kind of pointing device. Since this is the case, GNU Info (both the Emacs and standalone versions) have several commands which allow you to move the cursor about the screen. The notation used in this manual to describe keystrokes is identical to the notation used within the Emacs manual, and the GNU Readline manual. *Note Character Conventions: (emacs)Characters, if you are unfamiliar with the notation. The following table lists the basic cursor movement commands in Info. Each entry consists of the key sequence you should type to execute the cursor movement, the `M-x'(1) command name (displayed in parentheses), and a short description of what the command does. All of the cursor motion commands can take an "numeric" argument (*note `universal-argument': Other Info Commands.), to find out how to supply them. With a numeric argument, the motion commands are simply executed that many times; for example, a numeric argument of 4 given to `next-line' causes the cursor to move down 4 lines. With a negative numeric argument, the motion is reversed; an argument of -4 given to the `next-line' command would cause the cursor to move *up* 4 lines. `C-n' (`next-line') Moves the cursor down to the next line. `C-p' (`prev-line') Move the cursor up to the previous line. `C-a' (`beginning-of-line') Move the cursor to the start of the current line. `C-e' (`end-of-line') Moves the cursor to the end of the current line. `C-f' (`forward-char') Move the cursor forward a character. `C-b' (`backward-char') Move the cursor backward a character. `M-f' (`forward-word') Moves the cursor forward a word. `M-b' (`backward-word') Moves the cursor backward a word. `M-<' (`beginning-of-node') `b' Moves the cursor to the start of the current node. `M->' (`end-of-node') Moves the cursor to the end of the current node. `M-r' (`move-to-window-line') Moves the cursor to a specific line of the window. Without a numeric argument, `M-r' moves the cursor to the start of the line in the center of the window. With a numeric argument of N, `M-r' moves the cursor to the start of the Nth line in the window. ---------- Footnotes ---------- (1) `M-x' is also a command; it invokes `execute-extended-command'. *Note Executing an extended command: (emacs)M-x, for more detailed information.  File: octave.info, Node: Scrolling Commands, Next: Node Commands, Prev: Cursor Commands, Up: Using Info Moving Text Within a Window =========================== Sometimes you are looking at a screenful of text, and only part of the current paragraph you are reading is visible on the screen. The commands detailed in this section are used to shift which part of the current node is visible on the screen. `SPC' (`scroll-forward') `C-v' Shift the text in this window up. That is, show more of the node which is currently below the bottom of the window. With a numeric argument, show that many more lines at the bottom of the window; a numeric argument of 4 would shift all of the text in the window up 4 lines (discarding the top 4 lines), and show you four new lines at the bottom of the window. Without a numeric argument, SPC takes the bottom two lines of the window and places them at the top of the window, redisplaying almost a completely new screenful of lines. `DEL' (`scroll-backward') `M-v' Shift the text in this window down. The inverse of `scroll-forward'. The `scroll-forward' and `scroll-backward' commands can also move forward and backward through the node structure of the file. If you press SPC while viewing the end of a node, or DEL while viewing the beginning of a node, what happens is controlled by the variable `scroll-behaviour'. *Note `scroll-behaviour': Info Variables, for more information. `C-l' (`redraw-display') Redraw the display from scratch, or shift the line containing the cursor to a specified location. With no numeric argument, `C-l' clears the screen, and then redraws its entire contents. Given a numeric argument of N, the line containing the cursor is shifted so that it is on the Nth line of the window. `C-x w' (`toggle-wrap') Toggles the state of line wrapping in the current window. Normally, lines which are longer than the screen width "wrap", i.e., they are continued on the next line. Lines which wrap have a `\' appearing in the rightmost column of the screen. You can cause such lines to be terminated at the rightmost column by changing the state of line wrapping in the window with `C-x w'. When a line which needs more space than one screen width to display is displayed, a `$' appears in the rightmost column of the screen, and the remainder of the line is invisible.  File: octave.info, Node: Node Commands, Next: Searching Commands, Prev: Scrolling Commands, Up: Using Info Selecting a New Node ==================== This section details the numerous Info commands which select a new node to view in the current window. The most basic node commands are `n', `p', `u', and `l'. When you are viewing a node, the top line of the node contains some Info "pointers" which describe where the next, previous, and up nodes are. Info uses this line to move about the node structure of the file when you use the following commands: `n' (`next-node') Selects the `Next' node. `p' (`prev-node') Selects the `Prev' node. `u' (`up-node') Selects the `Up' node. You can easily select a node that you have already viewed in this window by using the `l' command - this name stands for "last", and actually moves through the list of already visited nodes for this window. `l' with a negative numeric argument moves forward through the history of nodes for this window, so you can quickly step between two adjacent (in viewing history) nodes. `l' (`history-node') Selects the most recently selected node in this window. Two additional commands make it easy to select the most commonly selected nodes; they are `t' and `d'. `t' (`top-node') Selects the node `Top' in the current info file. `d' (`dir-node') Selects the directory node (i.e., the node `(dir)'). Here are some other commands which immediately result in the selection of a different node in the current window: `<' (`first-node') Selects the first node which appears in this file. This node is most often `Top', but it doesn't have to be. `>' (`last-node') Selects the last node which appears in this file. `]' (`global-next-node') Moves forward or down through node structure. If the node that you are currently viewing has a `Next' pointer, that node is selected. Otherwise, if this node has a menu, the first menu item is selected. If there is no `Next' and no menu, the same process is tried with the `Up' node of this node. `[' (`global-prev-node') Moves backward or up through node structure. If the node that you are currently viewing has a `Prev' pointer, that node is selected. Otherwise, if the node has an `Up' pointer, that node is selected, and if it has a menu, the last item in the menu is selected. You can get the same behavior as `global-next-node' and `global-prev-node' while simply scrolling through the file with SPC and DEL; *Note `scroll-behaviour': Info Variables, for more information. `g' (`goto-node') Reads the name of a node and selects it. No completion is done while reading the node name, since the desired node may reside in a separate file. The node must be typed exactly as it appears in the info file. A file name may be included as with any node specification, for example `g(emacs)Buffers' finds the node `Buffers' in the info file `emacs'. `C-x k' (`kill-node') Kills a node. The node name is prompted for in the echo area, with a default of the current node. "Killing" a node means that Info tries hard to forget about it, removing it from the list of history nodes kept for the window where that node is found. Another node is selected in the window which contained the killed node. `C-x C-f' (`view-file') Reads the name of a file and selects the entire file. The command `C-x C-f FILENAME' is equivalent to typing `g(FILENAME)*' `C-x C-b' (`list-visited-nodes') Makes a window containing a menu of all of the currently visited nodes. This window becomes the selected window, and you may use the standard Info commands within it. `C-x b' (`select-visited-node') Selects a node which has been previously visited in a visible window. This is similar to `C-x C-b' followed by `m', but no window is created.  File: octave.info, Node: Searching Commands, Next: Xref Commands, Prev: Node Commands, Up: Using Info Searching an Info File ====================== GNU Info allows you to search for a sequence of characters throughout an entire info file, search through the indices of an info file, or find areas within an info file which discuss a particular topic. `s' (`search') Reads a string in the echo area and searches for it. `C-s' (`isearch-forward') Interactively searches forward through the info file for a string as you type it. `C-r' (`isearch-backward') Interactively searches backward through the info file for a string as you type it. `i' (`index-search') Looks up a string in the indices for this info file, and selects a node where the found index entry points to. `,' (`next-index-match') Moves to the node containing the next matching index item from the last `i' command. The most basic searching command is `s' (`search'). The `s' command prompts you for a string in the echo area, and then searches the remainder of the info file for an occurrence of that string. If the string is found, the node containing it is selected, and the cursor is left positioned at the start of the found string. Subsequent `s' commands show you the default search string within `[' and `]'; pressing RET instead of typing a new string will use the default search string. "Incremental searching" is similar to basic searching, but the string is looked up while you are typing it, instead of waiting until the entire search string has been specified.  File: octave.info, Node: Xref Commands, Next: Window Commands, Prev: Searching Commands, Up: Using Info Selecting Cross References ========================== We have already discussed the `Next', `Prev', and `Up' pointers which appear at the top of a node. In addition to these pointers, a node may contain other pointers which refer you to a different node, perhaps in another info file. Such pointers are called "cross references", or "xrefs" for short. * Menu: * Parts of an Xref:: What a cross reference is made of. * Selecting Xrefs:: Commands for selecting menu or note items.  File: octave.info, Node: Parts of an Xref, Next: Selecting Xrefs, Prev: Xref Commands, Up: Xref Commands Parts of an Xref ---------------- Cross references have two major parts: the first part is called the "label"; it is the name that you can use to refer to the cross reference, and the second is the "target"; it is the full name of the node that the cross reference points to. The target is separated from the label by a colon `:'; first the label appears, and then the target. For example, in the sample menu cross reference below, the single colon separates the label from the target. * Foo Label: Foo Target. More information about Foo. Note the `.' which ends the name of the target. The `.' is not part of the target; it serves only to let Info know where the target name ends. A shorthand way of specifying references allows two adjacent colons to stand for a target name which is the same as the label name: * Foo Commands:: Commands pertaining to Foo. In the above example, the name of the target is the same as the name of the label, in this case `Foo Commands'. You will normally see two types of cross references while viewing nodes: "menu" references, and "note" references. Menu references appear within a node's menu; they begin with a `*' at the beginning of a line, and continue with a label, a target, and a comment which describes what the contents of the node pointed to contains. Note references appear within the body of the node text; they begin with `*Note', and continue with a label and a target. Like `Next', `Prev' and `Up' pointers, cross references can point to any valid node. They are used to refer you to a place where more detailed information can be found on a particular subject. Here is a cross reference which points to a node within the Texinfo documentation: *Note Writing an Xref: (texinfo)xref, for more information on creating your own texinfo cross references.  File: octave.info, Node: Selecting Xrefs, Prev: Parts of an Xref, Up: Xref Commands Selecting Xrefs --------------- The following table lists the Info commands which operate on menu items. `1' (`menu-digit') `2' ... `9' Within an Info window, pressing a single digit, (such as `1'), selects that menu item, and places its node in the current window. For convenience, there is one exception; pressing `0' selects the *last* item in the node's menu. `0' (`last-menu-item') Select the last item in the current node's menu. `m' (`menu-item') Reads the name of a menu item in the echo area and selects its node. Completion is available while reading the menu label. `M-x find-menu' Moves the cursor to the start of this node's menu. This table lists the Info commands which operate on note cross references. `f' (`xref-item') `r' Reads the name of a note cross reference in the echo area and selects its node. Completion is available while reading the cross reference label. Finally, the next few commands operate on menu or note references alike: `TAB' (`move-to-next-xref') Moves the cursor to the start of the next nearest menu item or note reference in this node. You can then use RET (`select-reference-this-line' to select the menu or note reference. `M-TAB' (`move-to-prev-xref') Moves the cursor the start of the nearest previous menu item or note reference in this node. `RET' (`select-reference-this-line') Selects the menu item or note reference appearing on this line.  File: octave.info, Node: Window Commands, Next: Printing Nodes, Prev: Xref Commands, Up: Using Info Manipulating Multiple Windows ============================= A "window" is a place to show the text of a node. Windows have a view area where the text of the node is displayed, and an associated "mode line", which briefly describes the node being viewed. GNU Info supports multiple windows appearing in a single screen; each window is separated from the next by its modeline. At any time, there is only one "active" window, that is, the window in which the cursor appears. There are commands available for creating windows, changing the size of windows, selecting which window is active, and for deleting windows. * Menu: * The Mode Line:: What appears in the mode line? * Basic Windows:: Manipulating windows in Info. * The Echo Area:: Used for displaying errors and reading input. octave-1.1.0/doc/octave.info-9100666 415 17 103632 5705317773 14273 0ustar jweusersThis is Info file octave.info, produced by Makeinfo-1.55 from the input file octave.texi. Copyright (C) 1993, 1994, 1995 John W. Eaton. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the conditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another language, under the above conditions for modified versions.  File: octave.info, Node: The Mode Line, Next: Basic Windows, Prev: Window Commands, Up: Window Commands The Mode Line ------------- A "mode line" is a line of inverse video which appears at the bottom of an info window. It describes the contents of the window just above it; this information includes the name of the file and node appearing in that window, the number of screen lines it takes to display the node, and the percentage of text that is above the top of the window. It can also tell you if the indirect tags table for this info file needs to be updated, and whether or not the info file was compressed when stored on disk. Here is a sample mode line for a window containing an uncompressed file named `dir', showing the node `Top'. -----Info: (dir)Top, 40 lines --Top--------------------------------------- ^^ ^ ^^^ ^^ (file)Node #lines where When a node comes from a file which is compressed on disk, this is indicated in the mode line with two small `z''s. In addition, if the info file containing the node has been split into subfiles, the name of the subfile containing the node appears in the modeline as well: --zz-Info: (emacs)Top, 291 lines --Top-- Subfile: emacs-1.Z--------------- When Info makes a node internally, such that there is no corresponding info file on disk, the name of the node is surrounded by asterisks (`*'). The name itself tells you what the contents of the window are; the sample mode line below shows an internally constructed node showing possible completions: -----Info: *Completions*, 7 lines --All-----------------------------------  File: octave.info, Node: Basic Windows, Next: The Echo Area, Prev: The Mode Line, Up: Window Commands Window Commands --------------- It can be convenient to view more than one node at a time. To allow this, Info can display more than one "window". Each window has its own mode line (*note The Mode Line::.) and history of nodes viewed in that window (*note `history-node': Node Commands.). `C-x o' (`next-window') Selects the next window on the screen. Note that the echo area can only be selected if it is already in use, and you have left it temporarily. Normally, `C-x o' simply moves the cursor into the next window on the screen, or if you are already within the last window, into the first window on the screen. Given a numeric argument, `C-x o' moves over that many windows. A negative argument causes `C-x o' to select the previous window on the screen. `M-x prev-window' Selects the previous window on the screen. This is identical to `C-x o' with a negative argument. `C-x 2' (`split-window') Splits the current window into two windows, both showing the same node. Each window is one half the size of the original window, and the cursor remains in the original window. The variable `automatic-tiling' can cause all of the windows on the screen to be resized for you automatically, please *note automatic-tiling: Info Variables. for more information. `C-x 0' (`delete-window') Deletes the current window from the screen. If you have made too many windows and your screen appears cluttered, this is the way to get rid of some of them. `C-x 1' (`keep-one-window') Deletes all of the windows excepting the current one. `ESC C-v' (`scroll-other-window') Scrolls the other window, in the same fashion that `C-v' might scroll the current window. Given a negative argument, the "other" window is scrolled backward. `C-x ^' (`grow-window') Grows (or shrinks) the current window. Given a numeric argument, grows the current window that many lines; with a negative numeric argument, the window is shrunk instead. `C-x t' (`tile-windows') Divides the available screen space among all of the visible windows. Each window is given an equal portion of the screen in which to display its contents. The variable `automatic-tiling' can cause `tile-windows' to be called when a window is created or deleted. *Note `automatic-tiling': Info Variables.  File: octave.info, Node: The Echo Area, Prev: Basic Windows, Up: Window Commands The Echo Area ------------- The "echo area" is a one line window which appears at the bottom of the screen. It is used to display informative or error messages, and to read lines of input from you when that is necessary. Almost all of the commands available in the echo area are identical to their Emacs counterparts, so please refer to that documentation for greater depth of discussion on the concepts of editing a line of text. The following table briefly lists the commands that are available while input is being read in the echo area: `C-f' (`echo-area-forward') Moves forward a character. `C-b' (`echo-area-backward') Moves backward a character. `C-a' (`echo-area-beg-of-line') Moves to the start of the input line. `C-e' (`echo-area-end-of-line') Moves to the end of the input line. `M-f' (`echo-area-forward-word') Moves forward a word. `M-b' (`echo-area-backward-word') Moves backward a word. `C-d' (`echo-area-delete') Deletes the character under the cursor. `DEL' (`echo-area-rubout') Deletes the character behind the cursor. `C-g' (`echo-area-abort') Cancels or quits the current operation. If completion is being read, `C-g' discards the text of the input line which does not match any completion. If the input line is empty, `C-g' aborts the calling function. `RET' (`echo-area-newline') Accepts (or forces completion of) the current input line. `C-q' (`echo-area-quoted-insert') Inserts the next character verbatim. This is how you can insert control characters into a search string, for example. PRINTING CHARACTER (`echo-area-insert') Inserts the character. `M-TAB' (`echo-area-tab-insert') Inserts a TAB character. `C-t' (`echo-area-transpose-chars') Transposes the characters at the cursor. The next group of commands deal with "killing", and "yanking" text. For an in depth discussion of killing and yanking, *note Killing and Deleting: (emacs)Killing. `M-d' (`echo-area-kill-word') Kills the word following the cursor. `M-DEL' (`echo-area-backward-kill-word') Kills the word preceding the cursor. `C-k' (`echo-area-kill-line') Kills the text from the cursor to the end of the line. `C-x DEL' (`echo-area-backward-kill-line') Kills the text from the cursor to the beginning of the line. `C-y' (`echo-area-yank') Yanks back the contents of the last kill. `M-y' (`echo-area-yank-pop') Yanks back a previous kill, removing the last yanked text first. Sometimes when reading input in the echo area, the command that needed input will only accept one of a list of several choices. The choices represent the "possible completions", and you must respond with one of them. Since there are a limited number of responses you can make, Info allows you to abbreviate what you type, only typing as much of the response as is necessary to uniquely identify it. In addition, you can request Info to fill in as much of the response as is possible; this is called "completion". The following commands are available when completing in the echo area: `TAB' (`echo-area-complete') `SPC' Inserts as much of a completion as is possible. `?' (`echo-area-possible-completions') Displays a window containing a list of the possible completions of what you have typed so far. For example, if the available choices are: bar foliate food forget and you have typed an `f', followed by `?', the possible completions would contain: foliate food forget i.e., all of the choices which begin with `f'. Pressing SPC or TAB would result in `fo' appearing in the echo area, since all of the choices which begin with `f' continue with `o'. Now, typing `l' followed by `TAB' results in `foliate' appearing in the echo area, since that is the only choice which begins with `fol'. `ESC C-v' (`echo-area-scroll-completions-window') Scrolls the completions window, if that is visible, or the "other" window if not.  File: octave.info, Node: Printing Nodes, Next: Other Info Commands, Prev: Window Commands, Up: Using Info Printing Out Nodes ================== You may wish to print out the contents of a node as a quick reference document for later use. Info provides you with a command for doing this. In general, we recommend that you use TeX to format the document and print sections of it, by running `tex' on the texinfo source file. `M-x print-node' Pipes the contents of the current node through the command in the environment variable `INFO_PRINT_COMMAND'. If the variable doesn't exist, the node is simply piped to `lpr'.  File: octave.info, Node: Other Info Commands, Next: Info Variables, Prev: Printing Nodes, Up: Using Info Miscellaneous Info Commands =========================== GNU Info contains several commands which self-document GNU Info: `M-x describe-command' Reads the name of an Info command in the echo area and then displays a brief description of what that command does. `M-x describe-key' Reads a key sequence in the echo area, and then displays the name and documentation of the Info command that the key sequence invokes. `M-x describe-variable' Reads the name of a variable in the echo area and then displays a brief description of what the variable affects. `M-x where-is' Reads the name of an Info command in the echo area, and then displays a key sequence which can be typed in order to invoke that command. `C-h' (`get-help-window') `?' Creates (or moves into) the window displaying `*Help*', and places a node containing a quick reference card into it. This window displays the most concise information about GNU Info available. `h' (`get-info-help-node') Tries hard to visit the node `(info)Help'. The info file `info.texi' distributed with GNU Info contains this node. Of course, the file must first be processed with `makeinfo', and then placed into the location of your info directory. Here are the commands for creating a numeric argument: `C-u' (`universal-argument') Starts (or multiplies by 4) the current numeric argument. `C-u' is a good way to give a small numeric argument to cursor movement or scrolling commands; `C-u C-v' scrolls the screen 4 lines, while `C-u C-u C-n' moves the cursor down 16 lines. `M-1' (`add-digit-to-numeric-arg') `M-2' ... `M-9' Adds the digit value of the invoking key to the current numeric argument. Once Info is reading a numeric argument, you may just type the digits of the argument, without the Meta prefix. For example, you might give `C-l' a numeric argument of 32 by typing: `C-u 3 2 C-l' or `M-3 2 C-l' `C-g' is used to abort the reading of a multi-character key sequence, to cancel lengthy operations (such as multi-file searches) and to cancel reading input in the echo area. `C-g' (`abort-key') Cancels current operation. The `q' command of Info simply quits running Info. `q' (`quit') Exits GNU Info. If the operating system tells GNU Info that the screen is 60 lines tall, and it is actually only 40 lines tall, here is a way to tell Info that the operating system is correct. `M-x set-screen-height' Reads a height value in the echo area and sets the height of the displayed screen to that value. Finally, Info provides a convenient way to display footnotes which might be associated with the current node that you are viewing: `ESC C-f' (`show-footnotes') Shows the footnotes (if any) associated with the current node in another window. You can have Info automatically display the footnotes associated with a node when the node is selected by setting the variable `automatic-footnotes'. *Note `automatic-footnotes': Info Variables.  File: octave.info, Node: Info Variables, Prev: Other Info Commands, Up: Using Info Manipulating Variables ====================== GNU Info contains several "variables" whose values are looked at by various Info commands. You can change the values of these variables, and thus change the behavior of Info to more closely match your environment and info file reading manner. `M-x set-variable' Reads the name of a variable, and the value for it, in the echo area and then sets the variable to that value. Completion is available when reading the variable name; often, completion is available when reading the value to give to the variable, but that depends on the variable itself. If a variable does *not* supply multiple choices to complete over, it expects a numeric value. `M-x describe-variable' Reads the name of a variable in the echo area and then displays a brief description of what the variable affects. Here is a list of the variables that you can set in Info. `automatic-footnotes' When set to `On', footnotes appear and disappear automatically. This variable is `On' by default. When a node is selected, a window containing the footnotes which appear in that node is created, and the footnotes are displayed within the new window. The window that Info creates to contain the footnotes is called `*Footnotes*'. If a node is selected which contains no footnotes, and a `*Footnotes*' window is on the screen, the `*Footnotes*' window is deleted. Footnote windows created in this fashion are not automatically tiled so that they can use as little of the display as is possible. `automatic-tiling' When set to `On', creating or deleting a window resizes other windows. This variable is `Off' by default. Normally, typing `C-x 2' divides the current window into two equal parts. When `automatic-tiling' is set to `On', all of the windows are resized automatically, keeping an equal number of lines visible in each window. There are exceptions to the automatic tiling; specifically, the windows `*Completions*' and `*Footnotes*' are *not* resized through automatic tiling; they remain their original size. `visible-bell' When set to `On', GNU Info attempts to flash the screen instead of ringing the bell. This variable is `Off' by default. Of course, Info can only flash the screen if the terminal allows it; in the case that the terminal does not allow it, the setting of this variable has no effect. However, you can make Info perform quietly by setting the `errors-ring-bell' variable to `Off'. `errors-ring-bell' When set to `On', errors cause the bell to ring. The default setting of this variable is `On'. `gc-compressed-files' When set to `On', Info garbage collects files which had to be uncompressed. The default value of this variable is `Off'. Whenever a node is visited in Info, the info file containing that node is read into core, and Info reads information about the tags and nodes contained in that file. Once the tags information is read by Info, it is never forgotten. However, the actual text of the nodes does not need to remain in core unless a particular info window needs it. For non-compressed files, the text of the nodes does not remain in core when it is no longer in use. But de-compressing a file can be a time consuming operation, and so Info tries hard not to do it twice. `gc-compressed-files' tells Info it is okay to garbage collect the text of the nodes of a file which was compressed on disk. `show-index-match' When set to `On', the portion of the matched search string is highlighted in the message which explains where the matched search string was found. The default value of this variable is `On'. When Info displays the location where an index match was found, (*note `next-index-match': Searching Commands.), the portion of the string that you had typed is highlighted by displaying it in the inverse case from its surrounding characters. `scroll-behaviour' Controls what happens when forward scrolling is requested at the end of a node, or when backward scrolling is requested at the beginning of a node. The default value for this variable is `Continuous'. There are three possible values for this variable: `Continuous' Tries to get the first item in this node's menu, or failing that, the `Next' node, or failing that, the `Next' of the `Up'. This behavior is identical to using the `]' (`global-next-node') and `[' (`global-prev-node') commands. `Next Only' Only tries to get the `Next' node. `Page Only' Simply gives up, changing nothing. If `scroll-behaviour' is `Page Only', no scrolling command can change the node that is being viewed. `scroll-step' The number of lines to scroll when the cursor moves out of the window. Scrolling happens automatically if the cursor has moved out of the visible portion of the node text when it is time to display. Usually the scrolling is done so as to put the cursor on the center line of the current window. However, if the variable `scroll-step' has a nonzero value, Info attempts to scroll the node text by that many lines; if that is enough to bring the cursor back into the window, that is what is done. The default value of this variable is 0, thus placing the cursor (and the text it is attached to) in the center of the window. Setting this variable to 1 causes a kind of "smooth scrolling" which some people prefer. `ISO-Latin' When set to `On', Info accepts and displays ISO Latin characters. By default, Info assumes an ASCII character set. `ISO-Latin' tells Info that it is running in an environment where the European standard character set is in use, and allows you to input such characters to Info, as well as display them.  File: octave.info, Node: Concept Index, Next: Variable Index, Prev: Using Info, Up: Top Concept Index ************* * Menu: * -debug: Command Line Options. * -echo-commands: Command Line Options. * -help: Command Line Options. * -ignore-init-file: Command Line Options. * -info-file FILENAME: Command Line Options. * -interactive: Command Line Options. * -norc: Command Line Options. * -path PATH: Command Line Options. * -quiet: Command Line Options. * -silent: Command Line Options. * -verbose: Command Line Options. * -version: Command Line Options. * -?: Command Line Options. * -d: Command Line Options. * -f: Command Line Options. * -h: Command Line Options. * -i: Command Line Options. * -p PATH: Command Line Options. * -q: Command Line Options. * -V: Command Line Options. * -v: Command Line Options. * -x: Command Line Options. * ...: Variable-length Return Lists. * ...: Variable-length Argument Lists. * break statement: The break Statement. * continue statement: The continue Statement. * elseif statement: The if Statement. * else statement: The if Statement. * endfor statement: The for Statement. * endif statement: The if Statement. * endwhile statement: The while Statement. * end statement: Statements. * for statement: The for Statement. * if statement: The if Statement. * while statement: The while Statement. * #!: Executable Octave Programs. * #: Comments. * %: Comments. * acknowledgements: Preface. * addition: Arithmetic Ops. * amusements: Miscellaneous Utilities. * and operator: Boolean Expressions. * answers, incorrect: Bug Reporting. * answers, incorrect: Bug Criteria. * arguments in function call: Calling Functions. * arithmetic operators: Arithmetic Ops. * assignment expressions: Assignment Ops. * assignment operators: Assignment Ops. * body of a loop: The while Statement. * boolean expressions: Boolean Expressions. * boolean operators: Boolean Expressions. * bug criteria: Bug Criteria. * bug report mailing lists: Bug Lists. * bugs: Reporting Bugs. * bugs, investigating: Bug Reporting. * bugs, known: Trouble. * bugs, reporting: Bug Reporting. * bugs, reporting: Bug Lists. * built-in variables: Built-in Variables. * character strings: String Constants. * command options: Command Line Options. * comments: Comments. * comparison expressions: Comparison Ops. * complex-conjugate transpose: Arithmetic Ops. * contributors: Preface. * conversion specifications (printf): Formatted Output. * conversion specifications (scanf): Formatted Input. * copyright: Preface. * core dump: Bug Criteria. * DAE: Differential Equations. * data structures: Data Structures. * decrement operator: Assignment Ops. * defining functions: Functions and Scripts. * Differential Equations: Differential Equations. * diffs, submitting: Sending Patches. * division: Arithmetic Ops. * documenting Octave programs: Comments. * element-by-element evaluation: Element-by-element Boolean Operators. * equality operator: Comparison Ops. * equality, tests for: Comparison Ops. * equations, nonlinear: Nonlinear Equations. * erroneous messages: Bug Criteria. * erroneous results: Bug Reporting. * erroneous results: Bug Criteria. * error messages, incorrect: Bug Criteria. * escape sequence notation: String Constants. * executable scripts: Executable Octave Programs. * exiting octave: Running Octave. * exponentiation: Arithmetic Ops. * expression, range: Ranges. * expressions: Expressions. * expressions, assignment: Assignment Ops. * expressions, boolean: Boolean Expressions. * expressions, comparison: Comparison Ops. * expressions, logical: Boolean Expressions. * factorial function: Recursion. * fatal signal: Bug Criteria. * flag character (printf): Output Conversion Syntax. * flag character (scanf): Input Conversion Syntax. * flying high and fast: Variables. * Fordyce, A. P.: Evaluating Strings as Commands. * function file: Function Files. * functions, user-defined: Functions and Scripts. * getting a good job: Variables. * graphics: Two-Dimensional Plotting. * greater than operator: Comparison Ops. * help, where to find: Service. * Hermitian operator: Arithmetic Ops. * history: Preface. * improving Octave: Bug Criteria. * improving Octave: Sending Patches. * incorrect error messages: Bug Criteria. * incorrect output: Bug Reporting. * incorrect output: Bug Criteria. * incorrect results: Bug Criteria. * incorrect results: Bug Reporting. * increment operator: Assignment Ops. * initialization: Startup Files. * input conversions, for scanf: Table of Input Conversions. * installation trouble: Trouble. * installing Octave: Installation. * introduction: Introduction. * invalid input: Bug Criteria. * job hunting: Variables. * keywords: Keywords. * known causes of trouble: Trouble. * less than operator: Comparison Ops. * logical expressions: Boolean Expressions. * logical operators: Boolean Expressions. * loop: The while Statement. * lottery numbers: Amusements. * LP: Optimization. * lvalue: Assignment Ops. * matching failure, in scanf: Formatted Input. * matrices: Matrices. * matrix multiplication: Arithmetic Ops. * maximum field width (scanf): Input Conversion Syntax. * minimum field width (printf): Output Conversion Syntax. * multiplication: Arithmetic Ops. * negation: Arithmetic Ops. * NLP: Optimization. * nonlinear equations: Nonlinear Equations. * nonlinear programming: Optimization. * not operator: Boolean Expressions. * numbers, lottery: Amusements. * numbers, prime: Amusements. * numeric constant: Numeric Constants. * numeric value: Numeric Constants. * Octave command options: Command Line Options. * ODE: Differential Equations. * operator precedence: Increment Ops. * operators, arithmetic: Arithmetic Ops. * operators, assignment: Assignment Ops. * operators, boolean: Boolean Expressions. * operators, decrement: Assignment Ops. * operators, increment: Assignment Ops. * operators, logical: Boolean Expressions. * operators, relational: Comparison Ops. * optimization: Optimization. * options, Octave command: Command Line Options. * or operator: Boolean Expressions. * output conversions, for printf: Table of Output Conversions. * patches, submitting: Sending Patches. * plotting: Two-Dimensional Plotting. * precision (printf): Output Conversion Syntax. * prime numbers: Amusements. * program, self contained: Executable Octave Programs. * programs, documenting: Comments. * QP: Optimization. * quadratic programming: Optimization. * quitting octave: Running Octave. * quotient: Arithmetic Ops. * range expressions: Ranges. * relational operators: Comparison Ops. * reporting bugs: Bug Lists. * reporting bugs: Reporting Bugs. * results, incorrect: Bug Reporting. * results, incorrect: Bug Criteria. * script files: Functions and Scripts. * scripts, executable: Executable Octave Programs. * self contained programs: Executable Octave Programs. * short-circuit evaluation: Short-circuit Boolean Operators. * side effect: Assignment Ops. * startup: Startup Files. * statements: Statements. * strings: Rearranging Matrices. * strings: String Constants. * structures: Data Structures. * submitting diffs: Sending Patches. * submitting patches: Sending Patches. * subtraction: Arithmetic Ops. * suggestions: Bug Criteria. * tests for equality: Comparison Ops. * transpose: Arithmetic Ops. * transpose, complex-conjugate: Arithmetic Ops. * troubleshooting: Trouble. * unary minus: Arithmetic Ops. * undefined behavior: Bug Criteria. * undefined function value: Bug Criteria. * use of comments: Comments. * user-defined functions: Functions and Scripts. * user-defined variables: Variables. * Variable-length argument lists: Variable-length Argument Lists. * Variable-length return lists: Variable-length Return Lists. * variables: Built-in Variables. * variables, built-in: Built-in Variables. * variables, user-defined: Variables. * warranty: Preface. * wrong answers: Bug Criteria. * wrong answers: Bug Reporting.  File: octave.info, Node: Variable Index, Next: Function Index, Prev: Concept Index, Up: Top Variable Index ************** * Menu: * ans: Other Built-in Variables. * automatic_replot: User Preferences. * automatic_replot: Two-Dimensional Plotting. * default_save_format: Basic Input and Output. * default_save_format: User Preferences. * do_fortran_indexing: User Preferences. * EDITOR: User Preferences. * empty_list_elements_ok: User Preferences. * eps: Predefined Constants. * gnuplot_binary: User Preferences. * I, i, J, j: Predefined Constants. * ignore_function_time_stamp: User Preferences. * IMAGEPATH: User Preferences. * implicit_str_to_num_ok: User Preferences. * Inf, inf: Predefined Constants. * INFO_FILE: User Preferences. * LOADPATH: User Preferences. * NaN, nan: Predefined Constants. * nargout: Defining Functions. * OCTAVE_VERSION: User Preferences. * ok_to_lose_imaginary_part: User Preferences. * output_max_field_width: User Preferences. * output_precision: User Preferences. * PAGER: User Preferences. * page_screen_output: User Preferences. * pi: Predefined Constants. * prefer_column_vectors: User Preferences. * prefer_zero_one_indexing: User Preferences. * print_answer_id_name: User Preferences. * print_empty_dimensions: User Preferences. * propagate_empty_matrices: User Preferences. * PS1: User Preferences. * PS2: User Preferences. * PWD: Other Built-in Variables. * realmax: Predefined Constants. * realmin: Predefined Constants. * resize_on_range_error: User Preferences. * return_last_computed_value: User Preferences. * save_precision: User Preferences. * save_precision: Basic Input and Output. * SEEK_CUR: Predefined Constants. * SEEK_END: Predefined Constants. * SEEK_SET: Predefined Constants. * silent_functions: User Preferences. * split_long_rows: User Preferences. * stderr: Predefined Constants. * stdin: Predefined Constants. * stdout: Predefined Constants. * treat_neg_dim_as_zero: User Preferences. * warn_assign_as_truth_value: User Preferences. * warn_comma_in_global_decl: User Preferences. * warn_divide_by_zero: User Preferences. * whitespace_in_literal_matrix: User Preferences. octave-1.1.0/doc/FAQ.info100666 415 17 70653 5705307701 13227 0ustar jweusersThis is Info file FAQ.info, produced by Makeinfo-1.55 from the input file FAQ.texi.  File: FAQ.info, Node: Top, Next: What is Octave?, Prev: (dir), Up: (dir) Preface ******* This is a list of frequently asked questions (FAQ) for Octave users. Some information in this FAQ was developed for earlier versions of Octave and may now be obsolete. I'm looking for new questions (*with* answers), better answers, or both. Please send suggestions to bug-octave@che.utexas.edu. If you have general questions about Octave, or need help for something that is not covered by the FAQ, please use the help-octave@che.utexas.edu mailing list. This FAQ is intended to supplement, not replace, the Octave manual. Before posting a question to the hlpe-octave mailing list, you should first check to see if the topic is covered in the manual. * Menu: * What is Octave?:: * Version 1.1.0:: * Octave Features:: * Documentation:: * Getting Octave:: * Installation:: * Getting additional help:: * Bug reports:: * MATLAB compatibility:: * Index::  File: FAQ.info, Node: What is Octave?, Next: Version 1.1.0, Prev: Top, Up: Top What is Octave? *************** Octave is a high-level interactive language, primarily intended for numerical computations that is mostly compatible with MATLAB.(1) Octave can do arithmetic for real and complex scalars and matrices, solve sets of nonlinear algebraic equations, integrate functions over finite and infinite intervals, and integrate systems of ordinary differential and differential-algebraic equations. Octave uses the GNU readline library to handle reading and editing input. By default, the line editing commands are similar to the cursor movement commands used by GNU Emacs, and a vi-style line editing interface is also available. At the end of each session, the command history is saved, so that commands entered during previous sessions are not lost. The Octave distribution includes a 200+ page Texinfo manual. Access to the complete text of the manual is available via the help command at the Octave prompt. Two and three dimensional plotting is fully supported using gnuplot. The underlying numerical solvers are currently standard Fortran ones like Lapack, Linpack, Odepack, the Blas, etc., packaged in a library of C++ classes. If possible, the Fortran subroutines are compiled with the system's Fortran compiler, and called directly from the C++ functions. If that's not possible, you can still compile Octave if you have the free Fortran to C translator f2c. Octave is also 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. ---------- Footnotes ---------- (1) MATLAB is a registered trademark of The MathWorks, Inc.  File: FAQ.info, Node: Version 1.1.0, Next: Octave Features, Prev: What is Octave?, Up: Top What's new in version 1.1.0 of Octave ************************************* The long-awaited version 1.1.0 of Octave has now been released. Many bugs have been fixed and lots of new features added. Octave is now much more compatible with MATLAB. Version 1.1.0 fixes many bugs, but as with any "x.y.0" release there will be a few glitches. You can expect a 1.1.1 shortly. You can help contribute to the quality of Octave by trying it out and submitting bug reports where you find them. A list of user-visible changes in recent versions of Octave may be found in the file NEWS, distributed in both source and binary releases of Octave.  File: FAQ.info, Node: Octave Features, Next: Documentation, Prev: Version 1.1.0, Up: Top What features are unique to Octave? *********************************** * Menu: * Command and variable name completion:: * Command history:: * Data structures:: * Short-circuit boolean operators:: * Increment and decrement operators:: * Unwind-protect:: * Variable-length argument lists:: * Variable-length return lists:: * Built-in ODE and DAE solvers::  File: FAQ.info, Node: Command and variable name completion, Next: Command history, Prev: Octave Features, Up: Octave Features Command and variable name completion ==================================== Typing a TAB character (ASCII code 9) on the command line causes Octave to attempt to complete variable, function, and file names. Octave uses the text before the cursor as the initial portion of the name to complete. For example, if you type `fu' followed by TAB at the Octave prompt, Octave will complete the rest of the name `function' on the command line (unless you have other variables or functions defined that begin with the characters `fu'). If there is more than one possible completion, Octave will ring the terminal bell to let you know that your initial sequence of characters is not enough to specify a unique name. To complete the name, you may either edit the initial character sequence (usually adding more characters until completion is possible) or type another TAB to cause Octave to display the list of possible completions.  File: FAQ.info, Node: Command history, Next: Data structures, Prev: Command and variable name completion, Up: Octave Features Command history =============== When running interactively, Octave saves the commands you type in an internal buffer so that you can recall and edit them. Emacs and vi editing modes are available with Emacs keybindings enabled by default. When Octave exits, the current command history is saved to the file `~/.octave_hist', and each time Octave starts, it inserts the contents of the `~/.octave_hist' file in the history list so that it is easy to begin working where you left off.  File: FAQ.info, Node: Data structures, Next: Short-circuit boolean operators, Prev: Command history, Up: Octave Features Data structures =============== Octave includes a limited amount of support for organizing data in structures. The current implementation uses an associative array with indices limited to strings, but the syntax is more like C-style structures. Here are some examples of using data structures in Octave. * Elements of structures can be of any value type. octave:1> x.a = 1; x.b = [1, 2; 3, 4]; x.c = "string"; octave:2> x.a x.a = 1 octave:3> x.b x.b = 1 2 3 4 octave:4> x.c x.c = string * Structures may be copied. octave:1> y = x y = * Structure elements may reference other structures. octave:1> x.b.d = 3 x.b.d = 3 octave:2> x.b x.b = octave:3> x.b.d x.b.d = 3 * Functions can return structures. octave:1> function y = f (x) > y.re = real (x); > y.im = imag (x); > endfunction octave:2> f (rand + rand*I); ans = octave:3> ans.im, ans.re ans.im = 0.93411 ans.re = 0.56234 * Function return lists can include structure elements, and they may be indexed like any other variable. octave:1> [x.u, x.s(2:3,2:3), x.v] = svd ([1, 2; 3, 4]) x.u = -0.40455 -0.91451 -0.91451 0.40455 x.s = 0.00000 0.00000 0.00000 0.00000 5.46499 0.00000 0.00000 0.00000 0.36597 x.v = -0.57605 0.81742 -0.81742 -0.57605 octave:8> x x = * You can also use the function `is_struct' to determine whether a given value is a data structure. For example is_struct (x) returns 1 if the value of the variable X is a data structure. This feature should be considered experimental, but you should expect it to work. Suggestions for ways to improve it are welcome.  File: FAQ.info, Node: Short-circuit boolean operators, Next: Increment and decrement operators, Prev: Data structures, Up: Octave Features Short-circuit boolean operators =============================== Octave's `&&' and `||' logical operators are evaluated in a short-circuit fashion (like the corresponding operators in the C language) and work differently than the element by element operators `&' and `|'.  File: FAQ.info, Node: Increment and decrement operators, Next: Unwind-protect, Prev: Short-circuit boolean operators, Up: Octave Features Increment and decrement operators ================================= Octave includes the C-like increment and decrement operators `++' and `--' in both their prefix and postfix forms. For example, to pre-increment the variable X, you would write `++X'. This would add one to X and then return the new value of X as the result of the expression. It is exactly the same as the expression `X = X + 1'. To post-increment a variable X, you would write `X++'. This adds one to the variable X, but returns the value that X had prior to incrementing it. For example, if X is equal to 2, the result of the expression `X++' is 2, and the new value of X is 3. For matrix and vector arguments, the increment and decrement operators work on each element of the operand. It is not currently possible to increment index expressions. For example, you might expect that the expression `V(4)++' would increment the fourth element of the vector V, but instead it results in a parse error. This problem may be fixed in a future release of Octave.  File: FAQ.info, Node: Unwind-protect, Next: Variable-length argument lists, Prev: Increment and decrement operators, Up: Octave Features Unwind-protect ============== Octave supports a limited form of exception handling modelled after the unwind-protect form of Lisp. The general form of an `unwind_protect' block looks like this: unwind_protect BODY unwind_protect_cleanup CLEANUP end_unwind_protect Where BODY and CLEANUP are both optional and may contain any Octave expressions or commands. The statements in CLEANUP are guaranteed to be executed regardless of how control exits BODY. The `unwind_protect' statement is often used to reliably restore the values of global variables that need to be temporarily changed.  File: FAQ.info, Node: Variable-length argument lists, Next: Variable-length return lists, Prev: Unwind-protect, Up: Octave Features Variable-length argument lists ============================== Octave has a real mechanism for handling functions that take an unspecified number of arguments, so it is no longer necessary to place an upper bound on the number of optional arguments that a function can accept. Here is an example of a function that uses the new syntax to print a header followed by an unspecified number of values: function foo (heading, ...) disp (heading); va_start (); while (--nargin) disp (va_arg ()); endwhile endfunction Calling `va_start()' positions an internal pointer to the first unnamed argument and allows you to cycle through the arguments more than once. It is not necessary to call `va_start()' if you do not plan to cycle through the arguments more than once. The function `va_arg()' returns the value of the next available argument and moves the internal pointer to the next argument. It is an error to call `va_arg()' when there are no more arguments available. It is also possible to use the keyword ALL_VA_ARGS to pass all unnamed arguments to another function.  File: FAQ.info, Node: Variable-length return lists, Next: Built-in ODE and DAE solvers, Prev: Variable-length argument lists, Up: Octave Features Variable-length return lists ============================ Octave also has a real mechanism for handling functions that return an unspecified number of values, so it is no longer necessary to place an upper bound on the number of outputs that a function can produce. Here is an example of a function that uses the new syntax to produce `N' values: function [...] = foo (n) for i = 1:n vr_val (i); endfor endfunction  File: FAQ.info, Node: Built-in ODE and DAE solvers, Prev: Variable-length return lists, Up: Octave Features Built-in ODE and DAE solvers ============================ Octave includes LSODE and DASSL for solving systems of stiff differential and differential-algebraic equations. These functions are built in to the interpreter.  File: FAQ.info, Node: Documentation, Next: Getting Octave, Prev: Octave Features, Up: Top What documentation exists for Octave? ************************************* The Octave distribution includes a 220+ page manual that is also distributed under the terms of the GNU GPL. The Octave manual is intended to be a complete reference for Octave, but it is not a finished document. If you have problems using it, or find that some topic is not adequately explained, indexed, or cross-referenced, please send a bug report to bug-octave@che.utexas.edu. Because the Octave manual is written using Texinfo, the complete text of the Octave manual is also available on line using the GNU Info system via the GNU Emacs, info, or xinfo programs, or by using the `help -i' command to start the GNU info browser directly from the Octave prompt. It is also possible to use WWW browsers such as Mosaic to read the Octave manual (or any other Info file) by using Roar Smith's info2www program to convert GNU Info files to HTML. The source for info2www is available via anonymous ftp from ftp.che.utexas.edu in the directory `/pub/www'.  File: FAQ.info, Node: Getting Octave, Next: Installation, Prev: Documentation, Up: Top Obtaining Source Code ********************* * Menu: * Octave for Unix:: * Octave for other platforms:: * latest versions::  File: FAQ.info, Node: Octave for Unix, Next: Octave for other platforms, Prev: Getting Octave, Up: Getting Octave How do I get a copy of Octave for Unix? ======================================= You can get Octave from a friend who has a copy, by anonymous FTP, or by ordering a tape or CD-ROM from the Free Software Foundation (FSF). Octave was not developed by the FSF, but the FSF does distribute Octave, and the developers of Octave support the efforts of the FSF by encouraging users of Octave to order Octave on tape or CD directly from the FSF. The FSF is a nonprofit organization that distributes software and manuals to raise funds for more GNU development. Buying a tape or CD from the FSF contributes directly to paying staff to develop GNU software. CD-ROMs cost $400 if an organization is buying, or $100 if an individual is buying. Tapes cost around $200 depending on media type. The FSF only makes new CD releases a few times a year, so if you are interested specifically in Octave, I recommend asking for the latest release on tape. For more information about ordering from the FSF, contact gnu@prep.ai.mit.edu, phone (617) 876-3296 or anonymous ftp file `/pub/gnu/GNUinfo/ORDERS' from prep.ai.mit.edu or one of the sites listed below. If you are on the Internet, you can copy the latest distribution version of Octave from the file `/pub/octave/octave-M.N.tar.gz', on the host `ftp.che.utexas.edu'. This tar file has been compressed with GNU gzip, so be sure to use binary mode for the transfer. `M' and `N' stand for version numbers; look at a listing of the directory through ftp to see what version is available. After you unpack the distribution, be sure to look at the files `README' and `INSTALL'. Binaries for several popular systems are also available. If you would like help out by making binaries available for other systems, please contact bug-octave@che.utexas.edu. A list of user-visible changes since the last release is available in the file `NEWS'. The file `ChangeLog' in the source distribution contains a more detailed record of changes made since the last release.  File: FAQ.info, Node: Octave for other platforms, Next: latest versions, Prev: Octave for Unix, Up: Getting Octave How do I get a copy of Octave for (some other platform)? ======================================================== Octave currently runs on Unix-like systems only. It should be possible to make Octave work on other systems. If you are interested in porting Octave to other systems, please contact bug-octave@che.utexas.edu.  File: FAQ.info, Node: latest versions, Prev: Octave for other platforms, Up: Getting Octave What is the latest version of Octave ==================================== The latest version of Octave is 1.1.0, released January 1995.  File: FAQ.info, Node: Installation, Next: Getting additional help, Prev: Getting Octave, Up: Top Installation Issues and Problems ******************************** Octave requires approximately 50MB of disk storage to unpack and install (significantly less if you don't compile with debugging symbols). Octave has been compiled and tested with g++ and libg++ on a SPARCstation 2 running SunOS 4.1.2, an IBM RS/6000 running AIX 3.2.5, DEC Alpha systems running OSF/1 1.3 and 3.0, a DECstation 5000/240 running Ultrix 4.2a, and i486 systems running Linux. It should work on most other Unix systems that have a working port of g++ and libg++. * Menu: * What else do I need?:: * Other C++ compilers?::  File: FAQ.info, Node: What else do I need?, Next: Other C++ compilers?, Prev: Installation, Up: Installation What else do I need? ==================== In order to build Octave, you will need a current version of g++, libg++, and GNU make. If you don't have these tools, you can get them from many anonymous ftp archives, including ftp.che.utexas.edu, ftp.uu.net, prep.ai.mit.edu, and wuarchive.wustl.edu, or by writing to the FSF at 675 Mass Ave, Cambridge, MA 02139, USA.  File: FAQ.info, Node: Other C++ compilers?, Prev: What else do I need?, Up: Installation Can I compile Octave with another C++ compiler? =============================================== Currently, Octave can only be compiled with the GNU C++ compiler. It would be nice to make it possible to compile Octave with other C++ compilers, but the maintainers do not have sufficient time to devote to this. If you are interested in working to make Octave portable to other compilers, please contact bug-octave@che.utexas.edu.  File: FAQ.info, Node: Common problems Common problems *************** This list is probably far too short. Feel free to suggest additional questions (preferably with answers!) * Octave takes a long time to find symbols. Octave is probably spending this time recursively searching directories for function files. Check the value of your LOADPATH. For those elements that end in `//', do any name a very large directory tree? Does it contain directories that have a mixture of files and directories? In order for the recursive directory searching code to work efficiently, directories that are to be searched recursively should have either function files only, or subdirectories only, but not a mixture of both. Check to make sure that Octave's standard set of function files is installed this way.  File: FAQ.info, Node: Getting additional help, Next: Bug reports, Prev: Installation, Up: Top Getting additional help *********************** The mailing list help-octave@che.utexas.edu is available for questions related to using, installing, and porting Octave that are not adequately answered by the Octave manual or by this document. If you would like to join the discussion and receive all messages sent to the list, please send a short note to help-octave-request@che.utexas.edu ^^^^^^^ *Please do not* send requests to be added or removed from the the mailing list, or other administrative trivia to the list itself. An archive of old postings to the help-octave mailing list is maintained on ftp.che.utexas.edu in the directory `/pub/octave/MAILING-LISTS'.  File: FAQ.info, Node: Bug reports, Next: @sc{Matlab} compatibility, Prev: Getting additional help, Up: Top I think I have found a bug in Octave. ************************************* "I think I have found a bug in Octave, but I'm not sure. How do I know, and who should I tell?" First, see the section on bugs and bug reports in the Octave manual. The Octave manual is included in the Octave distribution. When you report a bug, make sure to describe the type of computer you are using, the version of the operating system it is running, and the version of Octave that you are using. Also provide enough code so that the Octave maintainers can duplicate your bug. If you have Octave working at all, the easiest way to do this is to use the Octave function `bug_report'. When you execute this function, Octave will prompt you for a subject and then invoke the editor on a file that already contains all the configuration information. When you exit the editor, Octave will mail the bug report for you. If for some reason you cannot use Octave's `bug_report' function, mail your bug report to "bug-octave@che.utexas.edu". Your message needs to include enough information to allow the maintainers of Octave to fix the bug. Please read the section on bugs and bug reports in the Octave manual for a list of things that should be included in every bug report.  File: FAQ.info, Node: @sc{Matlab} compatibility, Next: Index, Prev: Bug reports, Up: Top Porting programs from MATLAB to Octave ************************************** "I have some MATLAB code, and I want to get it running under Octave. Is there anything I should watch out for?" The differences between Octave and MATLAB typically fall into one of three categories: 1. Irrelevant. 2. Known differences, perhaps configurable with a user preference variable. 3. Unknown differences. The first category, irrelevant differences, do not affect computations and most likely do not affect the execution of function files. Some examples are: When typing `help function', Octave displays the first set of comment lines *after* the function declaration, but MATLAB displays the first set of comment lines starting from the beginning of the file. The differences of the second category are usually because the authors of Octave decided on a better (subjective) implementation that the way MATLAB does it, and so introduced "user preference variables" so that you can customize Octave's behavior to be either MATLAB-compatible or to use Octave's new features. To make Octave more MATLAB-compatible, put the following statements in your `~/.octaverc' file. This is a partial list of the user preference variables that should be changed to get MATLAB-compatible behavior. (It is partial because not all the differences are currently known, and when they become known, this document lags behind.) do_fortran_indexing = 'true'; treat_neg_dim_as_zero = 'true'; empty_list_elements_ok = 'true'; implicit_str_to_num_ok = 'true'; whitespace_in_literal_matrix = 'traditional'; prefer_zero_one_indexing = 'true'; Some other known differences are: * String subscripting is not yet implemented in Octave. For example, a = 'reknob'; a([6,1,5,3,2,4]) returns the string `broken' in MATLAB, but generates an error in Octave. A future release of Octave will fix this along with providing a much more complete and powerful set of functions for manipulating strings. * The Octave plotting functions are mostly compatible with the ones from MATLAB 3.x, but not from MATLAB 4.x. * The C-style I/O functions are not completely compatible. It would be useful for someone to explore the differences so that they might be fixed, or at least noted in the manual. The third category of differences is (hopefully) shrinking. If you find a difference between Octave behavior and MATLAB, then you should send a description of this difference (with code illustrating the difference, if possible) to bug-octave@che.utexas.edu. An archive of old postings to the help-octave mailing list is maintained on ftp.che.utexas.edu in the directory `/pub/octave/MAILING-LISTS'.  File: FAQ.info, Node: Index, Prev: @sc{Matlab} compatibility, Up: Top Concept Index ************* * Menu: * MATLAB compatibility: MATLAB compatibility. * Additional help: Getting additional help. * Argument lists, variable-length: Variable-length argument lists. * Boolean operators, short-circuit: Short-circuit boolean operators. * Bug in Octave, newly found: Bug reports. * Command completion: Command and variable name completion. * Command history: Command history. * Compatibility with MATLAB: MATLAB compatibility. * DASSL: Built-in ODE and DAE solvers. * Data structures: Data structures. * Decrement operators: Increment and decrement operators. * DJGPP: Octave for other platforms. * EMX: Octave for other platforms. * FAQ for Octave, latest version: Top. * Flex: What else do I need?. * FSF [Free Software Foundation]: Octave for Unix. * FSF, contact : Octave for Unix. * Function name completion: Command and variable name completion. * GNU Bison: What else do I need?. * GNU g++: What else do I need?. * GNU gcc: What else do I need?. * GNU Make: What else do I need?. * GNU [GNU's not unix]: Octave for Unix. * GNUware, anonymous FTP sites: Octave for Unix. * History: Command history. * Increment operators: Increment and decrement operators. * libg++: What else do I need?. * Logical operators, short-circuit: Short-circuit boolean operators. * LSODE: Built-in ODE and DAE solvers. * Mailing lists, bug-octave: Bug reports. * Mailing lists, help-octave: Getting additional help. * Manual, for Octave: Bug reports. * MS-DOS support: Octave for other platforms. * Name completion: Command and variable name completion. * Octave bug report: Bug reports. * Octave, building: Installation. * Octave, documentation: Documentation. * Octave, getting a copy: Octave for Unix. * Octave, ordering: Octave for Unix. * Octave, version date: latest versions. * Operators, boolean: Short-circuit boolean operators. * Operators, decrement: Increment and decrement operators. * Operators, increment: Increment and decrement operators. * OS/2 support: Octave for other platforms. * Return lists, variable-length: Variable-length return lists. * Short-circuit boolean operators: Short-circuit boolean operators. * Source code: Getting Octave. * Structures: Data structures. * Unwind-protect: Unwind-protect. * Variable name completion: Command and variable name completion. * Variable-length argument lists: Variable-length argument lists. * Variable-length return lists: Variable-length return lists. * VAX: Octave for other platforms. * VMS support: Octave for other platforms.  Tag Table: Node: Top85 Node: What is Octave?1053 Node: Version 1.1.02829 Node: Octave Features3578 Node: Command and variable name completion4032 Node: Command history5095 Node: Data structures5721 Node: Short-circuit boolean operators8146 Node: Increment and decrement operators8568 Node: Unwind-protect9765 Node: Variable-length argument lists10535 Node: Variable-length return lists11811 Node: Built-in ODE and DAE solvers12422 Node: Documentation12761 Node: Getting Octave13907 Node: Octave for Unix14127 Node: Octave for other platforms16276 Node: latest versions16728 Node: Installation16967 Node: What else do I need?17683 Node: Other C++ compilers?18169 Node: Common problems18700 Node: Getting additional help19566 Node: Bug reports20384 Node: @sc{Matlab} compatibility21772 Node: Index24671  End Tag Table octave-1.1.0/doc/FAQ.dvi100666 415 17 144330 5705307720 13071 0ustar jweusers÷ƒ’À;è TeX output 1995.01.12:1423‹ÿÿÿÿŸòŽ ƒ3Ú þ#’§óUÂÖN ¼j cmbx12ëUOcta–ÿZv“e‘ƧF‘ýhrA“QŽŸ 0‰ÕÁGŸ šª’åíó2Kñ`y ó3 cmr10ÝF‘ÿerequen•²!tly›¦fask“ed˜questions˜abMÞout˜Octa“v“eŽŸ ’€µ¾Decem²!bMÞer–¦f1,“1994Ž ™ÊóEÂÖN ff cmbx12ëEJohn–ffW.“EatonŽŸ‰ÕÁGŽŸŒ‹*ŸòŽ ƒ3ÚŸŒ‹dŸòÝChapter–¦f2:‘ÝÝWhat's“new“in“vš²!ersion“1.1.0“of“Octa˜v˜e’áïM1ŽŽŽ ƒ3Ú ý¨ðБThis–¦fis“a“list“of“frequenš²!tly“ask˜ed“questions“(F‘þȈA˜Q)“for“Octa˜v˜e“users.Ž¤÷*‘Some––®information“in“this“F‘þȈA•²!Q‘–pw“as›–®dev“elopMÞed˜for˜earlier˜v“ersions˜of˜Octa“v“e˜and˜ma“y˜no“w˜bMÞeŽ©obsolete.Ž¡‘I'm–¢ÏlošMÞoking“for“new“questions“(ó6p®0J ó3 cmsl10áwith“Ýansw²!ers),‘Öºb˜etter“answ²!ers,‘Öºor“b˜oth.‘‡VPlease“send“suggestions“toŽ¦bug-oMÞcta•²!v“eó3ßê–¿ªx.a“=“1;“x.b“=“[1,“2;“3,“4];“x.c“=“"string";Ž¤ ‘2–¹octave:2>‘¿ªx.aŽ¡‘2–¹x.a–¿ª=“1Ž¡‘2–¹octave:3>‘¿ªx.bŽŽŸŒ‹üŸòÝChapter–¦f3:‘ÝÝWhat“features“are“unique“to“Octa•²!v“e?’æÔó3ŽŽŽ ƒ3Ú ý¨ðБ2–¹Þx.b‘¿ª=Ž¤‘> 1‘ T2Ž© ‘> 3‘ T4Ž¡‘2–¹octave:4>‘¿ªx.cŽ¦‘2–¹x.c–¿ª=“stringŽŸæ‘®dÝStructures–¦fma²!y“bMÞe“copied.ŽŸæ‘2–¹Þoctave:1>–¿ªy“=“xŽ¦‘2–¹y‘¿ª=Ž¡‘2–¹ŽŸæ‘®dÝStructure–¦felemenš²!ts“ma˜y“reference“other“structures.ŽŸæ‘2–¹Þoctave:1>–¿ªx.b.d“=“3Ž¦‘2–¹x.b.d–¿ª=“3Ž¦‘2–¹octave:2>‘¿ªx.bŽ¦‘2–¹x.b‘¿ª=Ž¡‘2–¹Ž¡‘2–¹octave:3>‘¿ªx.b.dŽ¦‘2–¹x.b.d–¿ª=“3ŽŸæ‘®dÝF‘ÿeunctions–¦fcan“return“structures.ŽŸæ‘2–¹Þoctave:1>–¿ªfunction“y“=“f“(x)Ž¦‘2–¹>–¿ªy.re“=“real“(x);Ž¦‘2–¹>–¿ªy.im“=“imag“(x);Ž¦‘2–¹>‘¿ªendfunctionŽ¡‘2–¹octave:2>–¿ªf“(rand“+“rand*I);Ž¦‘2–¹ans‘¿ª=Ž¡‘2–¹Ž¡‘2–¹octave:3>–¿ªans.im,“ans.reŽ¦‘2–¹ans.im–¿ª=“0.93411Ž¦‘2–¹ans.re–¿ª=“0.56234ŽŸæ‘®dÝF‘ÿeunction–ÙPreturn“lists“can“include“structure“elemenš²!ts,‘æ and“they“ma˜y“bMÞe“indexed“lik˜e“an˜y“otherŽŸ‘®dv‘ÿdDariable.ŽŸæ‘2–¹Þoctave:1>–¿ª[x.u,“x.s(2:3,2:3),“x.v]“=“svd“([1,“2;“3,“4])Ž¦‘2–¹x.u‘¿ª=Ž¡‘> -0.40455‘ T-0.91451Ž¦‘> -0.91451‘>þ0.40455Ž¡‘2–¹x.s‘¿ª=ŽŽŸŒ‹¦ŸòÝChapter–¦f3:‘ÝÝWhat“features“are“unique“to“Octa•²!v“e?’æÔó4ŽŽŽ ƒ3Ú ý´ðБ> Þ0.00000– T0.00000“0.00000Ž¤ ‘> 0.00000– T5.46499“0.00000Ž¡‘> 0.00000– T0.00000“0.36597Ž¤‘2–¹x.v‘¿ª=Ž¡‘> -0.57605‘>þ0.81742Ž© ‘> -0.81742‘ T-0.57605Ž¡‘2–¹octave:8>‘¿ªxŽ¦‘2–¹x‘¿ª=Ž¡‘2–¹Ž¤aæ‘®dÝY‘ÿeou–ž¹can“also“use“the“function“Þis_struct“Ýto“determine“whether“a“giv²!en“v‘ÿdDalue“is“a“data“structure.Ž©‘®dF‘ÿeor‘¦fexampleŽŸaæ‘2–¹Þis_struct‘¿ª(x)Ž¡‘®dÝreturns–¦f1“if“the“v›ÿdDalue“of“the“v˜ariable“áx‘gÅÝis“a“data“structure.ŽŸaæ‘This–¨Þfeature“should“bšMÞe“considered“exp˜erimenš²!tal,‘©|but“y˜ou“should“expMÞect“it“to“w˜ork.‘åDSuggestionsŽ¦for›¦fw•²!a“ys˜to˜impro“v“e˜it˜are˜w“elcome.Ž¤ÃÌëE3.4‘™Short-circuit›¦Mb•s3o“olean˜op“eratorsŽŽŸ‘ÝOcta•²!v“e's–ÿM`Þ&&Ý'“and“`Þ||Ý'“logical“opMÞerators“are“ev‘ÿdDaluated“in“a“short-circuit“fashion“(lik²!e“the“corre-Ž¦sp•MÞonding›_4op“erators˜in˜the˜C‘_"language)˜and˜w•²!ork˜di eren“tly˜than˜the˜elemen“t˜b“y˜elemen“t˜opMÞeratorsŽ¦`Þ&Ý'–¦fand“`Þ|Ý'.Ž¡ëE3.5‘™IncremenšŒÌt–¦Mand“decremen˜t“ops3eratorsŽŽŸ‘ÝOcta•²!v“e–fYincludes“the“C-likš²!e“incremen˜t“and“decremen˜t“opšMÞerators“`Þ++Ý'“and“`Þ--Ý'“in“b˜oth“their“pre xŽ¦and–¦fpMÞost x“forms.Ž¤‘F‘ÿeor–+hexample,›L¨to“pre-incremen²!t“the“v‘ÿdDariable“áxÝ,˜yš²!ou“w˜ould“write“Þ++áx‘Á_Ý.‘lãThis“w˜ould“add“one“to“áxŽ¦Ýand–&9then“return“the“new“v‘ÿdDalue“of“áx‘ç˜Ýas“the“result“of“the“expression.‘]WIt“is“exactly“the“same“as“theŽ¦expression–¦fáx›gÅÞ=“áx˜Þ+“1Ý.Ž¡‘T‘ÿeo–ÐfpMÞost-incremenš²!t“a“v‘ÿdDariable“áxÝ,‘æy˜ou“w˜ould“write“áx‘Á_Þ++Ý.‘[ÝThis“adds“one“to“the“v‘ÿdDariable“áxÝ,‘æbutŽ¦returns–œ©the“v‘ÿdDalue“that“áx›^Ýhad“prior“to“incremen²!ting“it.‘ÚžF‘ÿeor“example,‘ž›if“áx˜Ýis“equal“to“2,‘ž›the“result“ofŽ¦the–¦fexpression“áx‘Á_Þ++“Ýis“2,“and“the“new“v‘ÿdDalue“of“áx‘gÅÝis“3.Ž¡‘F‘ÿeor–"Jmatrix“and“vš²!ector“argumen˜ts,‘<¶the“incremen˜t“and“decremen˜t“opMÞerators“w˜ork“on“eac˜h“elemen˜tŽ¦of–¦fthe“opMÞerand.Ž¡‘It–jkis“not“currenš²!tly“pMÞossible“to“incremen˜t“index“expressions.‘ÉßF‘ÿeor“example,‘vjy˜ou“migh˜t“expMÞect“thatŽ¦the–sexpression“áv‘ðÞ(4)++“Ýwš²!ould“incremen˜t“the“fourth“elemen˜t“of“the“v˜ector“ávÝ,‘;7but“instead“it“resultsŽ¦in–¦fa“parse“error.‘ÝÝThis“problem“maš²!y“bMÞe“ xed“in“a“future“release“of“Octa˜v˜e.ŽŽŸŒ‹YŸòÝChapter–¦f3:‘ÝÝWhat“features“are“unique“to“Octa•²!v“e?’æÔó5ŽŽŽ ƒ3Ú ý¨ðÐëE3.6‘™UnŒÌwind-protectŽŽ©®‘ÝOcta•²!v“e–ìsuppšMÞorts“a“limited“form“of“exception“handling“mo˜delled“after“the“un²!wind-protect“formŽ¤of–¦fLisp.‘ÝÝThe“general“form“of“an“Þunwind_protect“ÝblošMÞc²!k“lo˜oks“lik²!e“this:ŽŸý‘èUÞunwind_protectŽ¡‘(g©áb•MÞo“dyŽ¡‘èUÞunwind_protect_cleanupŽ¡‘(g©áclean²!upŽ¡‘èUÞend_unwind_protectŽŽŸRèÈÝWhere›! áb•MÞo“dy‘#Ýand˜áclean²!up‘v Ýare˜b“oth˜optional˜and˜ma•²!y˜con“tain˜an“y˜Octa“v“e˜expressions˜or˜commands.Ž¡The–¦fstatemenš²!ts“in“áclean˜up‘ûgÝare“guaran˜teed“to“bMÞe“executed“regardless“of“ho˜w“con˜trol“exits“áb•MÞo“dyÝ.ŽŸ®‘The–/|Þunwind_protect“Ýstatemen²!t“is“often“used“to“reliably“restore“the“v›ÿdDalues“of“global“v˜ariablesŽ¡that–¦fneed“to“bšMÞe“temp˜orarily“c²!hanged.ŽŸ2¸wëE3.7‘™V‘þ¦fariable-length–¦MargumenŒÌt“listsŽŽ¦‘ÝOcta•²!v“e–has“a“real“mecš²!hanism“for“handling“functions“that“tak˜e“an“unspMÞeci ed“n˜um˜bMÞer“of“argu-Ž¡men²!ts,‘ÑÖso–É&it“is“no“longer“necessary“to“place“an“uppšMÞer“b˜ound“on“the“n•²!um“b˜er–É&of“optional“argumen²!tsŽ¡that–¦fa“function“can“accept.Ž©®‘Here–¥is“an“example“of“a“function“that“uses“the“new“synš²!tax“to“prin˜t“a“header“follo˜w˜ed“b˜y“anŽ¡unspšMÞeci ed‘¦fn•²!um“b˜er–¦fof“v‘ÿdDalues:ŽŸ®‘èUÞfunction–¿ªfoo“(heading,“...)Ž¤ ‘(g©disp‘¿ª(heading);Ž¡‘(g©va_start‘¿ª();Ž¡‘(g©while‘¿ª(--nargin)Ž¡‘3æýdisp–¿ª(va_arg“());Ž¡‘(g©endwhileŽ¡‘èUendfunctionŽ¦‘ÝCalling–3éÞva_start()“ÝpšMÞositions“an“in²!ternal“p˜oinš²!ter“to“the“ rst“unnamed“argumen˜t“and“allo˜ws“y˜ouŽ¤to–õcycle“through“the“argumenš²!ts“more“than“once.‘ÉïIt“is“not“necessary“to“call“Þva_start()“Ýif“y˜ou“doŽ¡not–¦fplan“to“cycle“through“the“argumen²!ts“more“than“once.Ž¦‘The–Mâfunction“Þva_arg()“Ýreturns“the“v›ÿdDalue“of“the“next“a²!v˜ailable“argumenš²!t“and“mo˜v˜es“the“in˜ternalŽ¡pMÞoinš²!ter–'to“the“next“argumen˜t.‘ë It“is“an“error“to“call“Þva_arg()“Ýwhen“there“are“no“more“argumen˜tsŽ¡a²!v‘ÿdDailable.Ž¦‘It–ÐÉis“also“pMÞossible“to“use“the“k•²!eyw“ord›ÐÉáall‘¨/‰x³HøŽ–ñ'v‘ÿdDa‘¨/‰x³HøŽ“args‘DKÝto˜pass˜all˜unnamed˜argumen²!ts˜to˜anotherŽ¡function.ŽŽŸŒ‹(îŸòÝChapter–¦f5:‘ÝÝObtaining“Source“CoMÞde’(Ÿ…6ŽŽŽ ƒ3Ú ý¨ðÐëE3.8‘™V‘þ¦fariable-length–¦Mreturn“listsŽŽ©ðò‘ÝOcta•²!v“e–Û_also“has“a“real“mecš²!hanism“for“handling“functions“that“return“an“unspMÞeci ed“n˜um˜bMÞerŽ¤of–Gbv‘ÿdDalues,‘o¡so“it“is“no“longer“necessary“to“place“an“uppšMÞer“b˜ound“on“the“n•²!um“b˜er–Gbof“outputs“that“aŽ¡function–¦fcan“proMÞduce.ŽŸðò‘Here–¦fis“an“example“of“a“function“that“uses“the“new“syn²!tax“to“proMÞduce“`ÞNÝ'“v‘ÿdDalues:ŽŸðò‘èUÞfunction–¿ª[...]“=“foo“(n)Ž¤ ‘(g©for–¿ªi“=“1:nŽ¡‘3æývr_val‘¿ª(i);Ž¡‘(g©endforŽ¡‘èUendfunctionŽŸ#ÃÈëE3.9‘™Built-in–¦MODE“and“DšŒÌAE“solv˜ersŽŽ¦‘ÝOcta•²!v“e–ñîincludes“LSODE›ñ˜and“D²!ASSL˜for“solving“systems“of“sti “di erenš²!tial“and“di eren˜tial-Ž¤algebraic–¦fequations.‘ÝÝThese“functions“are“built“in“to“the“in²!terpreter.ŽŸ!ÃÈè4‘ ¸QWhat–¦Mdo‘Š=cumen›ÿuÂtation“exists“for“Octa˜v˜e?ŽŽŸ$´º‘ÝThe›£Octa•²!v“e˜distribution˜includes˜a˜220Þ+˜Ýpage˜man“ual˜that˜is˜also˜distributed˜under˜the˜termsŽ¡of–¦fthe“GNU“GPL.Ž©ðò‘The›Octa•²!v“e˜man“ual˜is˜in“tended˜to˜bMÞe˜a˜complete˜reference˜for˜Octa“v“e,‘4but˜it˜is˜not˜a˜ nishedŽ¡doMÞcumen•²!t.‘n”If›Ö£y“ou˜ha“v“e˜problems˜using˜it,‘"²or˜ nd˜that˜some˜topic˜is˜not˜adequately˜explained,Ž¡indexed,–¦for“cross-referenced,“please“send“a“bug“repšMÞort“to“bug-o˜cta•²!v“eÞ@Ýc“he.utexas.edu.Ž¦‘Because–e™the“Octa•²!v“e›e™man“ual˜is˜written˜using˜T‘ÿeexinfo,‘rthe˜complete˜text˜of˜the˜Octa“v“e˜man“ual˜isŽ¡also–Ä:a²!v‘ÿdDailable“on“line“using“the“GNU›Ä2Info“system“via“the“GNU˜Emacs,–˯info,“or–Ä:xinfo“programs,‘˯orŽ¡bš²!y–¦fusing“the“`Þhelp“-iÝ'“command“to“start“the“GNU“info“bro˜wser“directly“from“the“Octa˜v˜e“prompt.Ž¦‘It–`Âis“also“pMÞossible“to“use“WWW‘`’broš²!wsers“suc˜h“as“Mosaic“to“read“the“Octa˜v˜e“man˜ual“(or“an˜yŽ¡other–É_Info“ le)“bš²!y“using“Roar“Smith's“info2www“program“to“con˜v˜ert“GNU‘ÉInfo“ les“to“HTML.Ž¡The–6¾source“for“info2www“is“aš²!v‘ÿdDailable“via“anon˜ymous“ftp“from“ftp.c˜he.utexas.edu“in“the“directoryŽ¡`Þ/pub/wwwÝ'.ŽŸ!ÃÈè5‘ ¸QObtaining–¦MSource“Co‘Š=deŽŽŸ3‡ëE5.1‘™HošŒÌw–¦Mdo“I“get“a“cop˜y“of“Octa˜v˜e“for“Unix?ŽŽŸðò‘ÝY›ÿeou–dzcan“get“Octa•²!v“e–dzfrom“a“friend“who“has“a“cop•²!y˜,‘q©b“y›dzanon“ymous˜FTP‘ÿe,˜or˜b“y˜ordering˜a˜tapMÞe˜orŽ¡CD-Rš²!OM–¦ffrom“the“F‘ÿeree“Soft˜w˜are“F‘ÿeoundation“(FSF).ŽŽŸŒ‹1ÙŸòÝChapter–¦f6:‘ÝÝInstallation“Issues“and“Problems’ü«É7ŽŽŽ ƒ3Ú ý¨ðБOcta•²!v“e›‡Ew“as˜not˜dev“elopMÞed˜b“y˜the˜FSF,˜but˜the˜FSF‘‡>doMÞes˜distribute˜Octa“v“e,‘and˜the˜dev“elopMÞersŽ¤of›ëOcta•²!v“e˜suppMÞort˜the˜e orts˜of˜the˜FSF‘ëb“y˜encouraging˜users˜of˜Octa“v“e˜to˜order˜Octa“v“e˜on˜tapMÞeŽ¡or–¦fCD“directly“from“the“FSF.Ž©‘The–oFSF‘nçis“a“nonpro t“organization“that“distributes“soft•²!w“are–oand“man²!uals“to“raise“funds“forŽ¡more›-ÎGNU‘-¯dev•²!elopmen“t.‘µªBuying˜a˜tapMÞe˜or˜CD–-¯from˜the˜FSF“con•²!tributes˜directly˜to˜pa“ying˜sta ˜toŽ¡dev•²!elop›Á´GNU‘Á­soft“w“are.‘/ÇCD-R“OMs˜cost˜$400˜if˜an˜organization˜is˜buying,‘ȇor˜$100˜if˜an˜individualŽ¡is–¦fbuying.‘ÝÝT‘ÿeapšMÞes“cost“around“$200“dep˜ending“on“media“t²!yp˜e.Ž¦‘The–†ÕFSF›†Íonly“mak²!es“new“CD˜releases“a“few“times“a“yš²!ear,‘&so“if“y˜ou“are“in˜terested“spMÞeci cally“inŽ¡Octa•²!v“e,–¦fI“recommend“asking“for“the“latest“release“on“tapMÞe.Ž¦‘F‘ÿeor–Cmore“information“abMÞout“ordering“from“the“FSF,“conš²!tact“gn˜uÞ@Ýprep.ai.mit.edu,‘ºphone“(617)Ž¡876-3296–Þ™or“anon²!ymous“ftp“ le“`Þ/pub/gnu/GNUinfo/ORDERSÝ'“from“prep.ai.mit.edu“or“one“of“theŽ¡sites–¦flisted“bMÞelo²!w.Ž¦‘If–üyš²!ou“are“on“the“In˜ternet,‘ƒy˜ou“can“cop˜y“the“latest“distribution“v˜ersion“of“Octa˜v˜e“from“the“ leŽ¡`Þ/pub/octave/octave-M.N.tar.gzÝ',‘Pon–Ëïthe“host“`Þftp.che.utexas.eduÝ'.‘NwThis“tar“ le“has“bMÞeenŽ¡compressed–with“GNU‘ëgzip,‘./so“bšMÞe“sure“to“use“binary“mo˜de“for“the“transfer.‘#Á`ÞMÝ'“and“`ÞNÝ'“stand“forŽ¡v•²!ersion›ïän“um“b•MÞers;‘,ºlo“ok˜at˜a˜listing˜of˜the˜directory˜through˜ftp˜to˜see˜what˜v•²!ersion˜is˜a“v‘ÿdDailable.‘¡AfterŽ¡y•²!ou›¦funpac“k˜the˜distribution,˜b•MÞe˜sure˜to˜lo“ok˜at˜the˜ les˜`ÞREADMEÝ'˜and˜`ÞINSTALLÝ'.Ž¦‘Binaries–X€for“sevš²!eral“pMÞopular“systems“are“also“a˜v‘ÿdDailable.‘ô+If“y˜ou“w˜ould“lik˜e“help“out“b˜y“makingŽ¡binaries–¦faš²!v‘ÿdDailable“for“other“systems,“please“con˜tact“bug-oMÞcta˜v˜eÞ@Ýc˜he.utexas.edu.Ž¦‘A‘‰list–‰‘of“user-visible“cš²!hanges“since“the“last“release“is“a˜v‘ÿdDailable“in“the“ le“`ÞNEWSÝ'.‘ ‡]The“ leŽ¡`ÞChangeLogÝ'–þHin“the“source“distribution“conš²!tains“a“more“detailed“record“of“c˜hanges“made“since“theŽ¡last‘¦frelease.Ž©œ£ëE5.2‘™HošŒÌw–¦Mdo“I“get“a“cop˜y“of“Octa˜v˜e“for“(some“other“platform)?ŽŽŸ‘ÝOcta•²!v“e›e”curren“tly˜runs˜on˜Unix-lik“e˜systems˜only‘ÿe.‘gIt˜should˜b•MÞe˜p“ossible˜to˜mak•²!e˜Octa“v“e˜w“orkŽ¡on–€kother“systems.‘kíIf“yš²!ou“are“in˜terested“in“pMÞorting“Octa˜v˜e“to“other“systems,‘¶ìplease“con˜tact“bug-Ž¡oMÞcta•²!v“eÞ@Ýc“he.utexas.edu.Ž¦ëE5.3‘™What–¦Mis“the“latest“všŒÌersion“of“Octa˜v˜eŽŽŸ‘ÝThe–¦flatest“vš²!ersion“of“Octa˜v˜e“is“1.1.0,“released“Jan˜uary“1995.ŽŸœ£è6‘ ¸QInstallation–¦MIssues“and“ProblemsŽŽŸ9F‘ÝOcta•²!v“e–Ïrequires“approš²!ximately“50MB‘Îþof“disk“storage“to“unpac˜k“and“install“(signi can˜tly“less“ifŽ¡yš²!ou–¦fdon't“compile“with“debugging“sym˜bMÞols).ŽŸ‘Octa•²!v“e–-âhas“bMÞeen“compiled“and“tested“with“gÞ++“Ýand“libgÞ++“Ýon“a“SP‘ÿeAR²!Cstation“2“running“SunOSŽ¡4.1.2,‘°an–Ê¢IBM›ÊWRS/6000“running“AIX˜3.2.5,‘°DEC˜Alpha“systems“running“OSF/1“1.3“and“3.0,‘°aŽŽŸŒ‹;[ŸòÝChapter–¦f8:‘ÝÝGetting“additional“help’(Eø8ŽŽŽ ƒ3Ú ý¨ðÐDECstation–¼«5000/240“running“Ultrix“4.2a,‘When–ˆyš²!ou“execute“this“function,‘8çOcta˜v˜e“will“prompt“y˜ou“for“a“sub‘›»ject“and“then“in˜v˜ok˜e“theŽ¡editor–Î=on“a“ le“that“already“conš²!tains“all“the“con guration“information.‘UcWhen“y˜ou“exit“the“editor,Ž¡Octa•²!v“e–¦fwill“mail“the“bug“repMÞort“for“y²!ou.Ž¦‘If–jÄfor“some“reason“yš²!ou“cannot“use“Octa˜v˜e's“Þbug_report“Ýfunction,‘ÛÛmail“y˜our“bug“repMÞort“toŽ¡Þ"Ýbug-oMÞcta•²!v“eÞ@Ýc“he.utexas.eduÞ"Ý.‘ ÉXY‘ÿeour–J:message“needs“to“include“enough“information“to“allo²!w“theŽ¡mainš²!tainers–ü™of“Octa˜v˜e“to“ x“the“bug.‘àuPlease“read“the“section“on“bugs“and“bug“repMÞorts“in“theŽ¡Octa•²!v“e›¦fman“ual˜for˜a˜list˜of˜things˜that˜should˜bMÞe˜included˜in˜ev“ery˜bug˜repMÞort.ŽŸ $)è10‘ ¸QP›ÿuÂorting–¦Mprograms“from“óBŒ-øG® cmcsc10ëBMa‘þÙtlab“èto“Octa˜v˜eŽŽŸ"­3‘Ý\I›eæha•²!v“e–fsome“ãMa‘ÿEtlab“ÝcoMÞde,‘–and“I˜w•²!an“t–fto“get“it“running“under“Octa•²!v“e.‘ñIs–fthere“an²!ything“IŽ¡should›¦fw•²!atc“h˜out˜for?"Ž¦‘The–¦fdi erences“bMÞet•²!w“een›¦fOcta“v“e˜and˜ãMa‘ÿEtlab˜Ýt“ypically˜fall˜in“to˜one˜of˜three˜categories:Ž¦‘ïæ1.Ž‘®dIrrelev‘ÿdDan²!t.Ž¤‰ ‘ïæ2.Ž‘®dKno²!wn–¦fdi erences,“pMÞerhaps“con gurable“with“a“user“preference“v‘ÿdDariable.Ž¡‘ïæ3.Ž‘®dUnkno²!wn‘¦fdi erences.ŽŸ‘The–Ë— rst“category‘ÿe,›÷Zirrelev‘ÿdDan²!t“di erences,˜do“not“a ect“computations“and“most“lik²!ely“do“not“a ectŽ¤the–¦fexecution“of“function“ les.‘ÝÝSome“examples“are:Ž¦‘When–l tš²!yping“`Þhelp‘¦ffunctionÝ',‘x.Octa˜v˜e“displa˜ys“the“ rst“set“of“commen˜t“lines“áafter‘5ÉÝthe“functionŽ¡declaration,‘s but–f5ãMa‘ÿEtlab“Ýdisplaš²!ys“the“ rst“set“of“commen˜t“lines“starting“from“the“bMÞeginning“of“theŽ¡ le.ŽŽŸŒ‹ RðŸòÝAppMÞendix–¦fA:“Concept“Index’CÁ;10ŽŽŽ ƒ3Ú ý¨ðБThe–è=di erences“of“the“second“category“are“usually“bMÞecause“the“authors“of“Octa•²!v“e–è=decided“on“aŽ¤bMÞetter–¬Ü(sub‘›»jectivš²!e)“implemen˜tation“that“the“w˜a˜y“ãMa‘ÿEtlab“ÝdoMÞes“it,‘®zand“so“in˜troMÞduced“\user“prefer-Ž¡ence–%av‘ÿdDariables"“so“that“yš²!ou“can“customize“Octa˜v˜e's“bMÞeha˜vior“to“bMÞe“either“ãMa‘ÿEtlabÝ-compatible“orŽ¡to–¢Œuse“Octa•²!v“e's–¢Œnew“features.‘Ü”T‘ÿeo“makš²!e“Octa˜v˜e“more“ãMa‘ÿEtlabÝ-compatible,‘£Qput“the“follo˜wing“state-Ž¡menš²!ts–žÉin“y˜our“`Þ~/.octavercÝ'“ le.‘ÛSThis“is“a“partial“list“of“the“user“preference“v‘ÿdDariables“that“shouldŽ¡bšMÞe–Ïc²!hanged“to“get“ãMa‘ÿEtlabÝ-compatible“b˜eha²!vior.‘ù(It“is“partial“b˜ecause“not“all“the“di erences“areŽ¡curren•²!tly›¦fkno“wn,˜and˜when˜they˜bMÞecome˜kno“wn,˜this˜doMÞcumen“t˜lags˜bMÞehind.)ŽŸ/‘(g©Þdo_fortran_indexing–¿ª=“'true';Ž¤ ‘(g©treat_neg_dim_as_zero–¿ª=“'true';Ž¡‘(g©empty_list_elements_ok–¿ª=“'true';Ž¡‘(g©implicit_str_to_num_ok–¿ª=“'true';Ž¡‘(g©whitespace_in_literal_matrix–¿ª=“'traditional';Ž¡‘(g©prefer_zero_one_indexing–¿ª=“'true';Ž¤/‘ÝSome–¦fother“kno²!wn“di erences“are:Ž¡‘®dString–¦fsubscripting“is“not“yš²!et“implemen˜ted“in“Octa˜v˜e.‘ÝÝF‘ÿeor“example,ŽŸ/‘2–¹Þa–¿ª=“'reknob';ŽŸ ‘2–¹a([6,1,5,3,2,4])Ž©/‘®dÝreturns–Á“the“string“`ÞbrokenÝ'“in“ãMa‘ÿEtlabÝ,‘È_but“generates“an“error“in“Octa•²!v“e.‘/eA‘ÁŒfuture–Á“release“ofŽ¤‘®dOcta•²!v“e–§ˆwill“ x“this“along“with“proš²!viding“a“m˜uc˜h“more“complete“and“pMÞo˜w˜erful“set“of“functionsŽ¡‘®dfor–¦fmanipulating“strings.Ž¦‘®dThe›1´Octa•²!v“e˜plotting˜functions˜are˜mostly˜compatible˜with˜the˜ones˜from˜ãMa‘ÿEtlab˜Ý3.x,‘I but˜notŽ¡‘®dfrom–¦fãMa‘ÿEtlab“Ý4.x.Ž¦‘®dThe–PC-stš²!yle“I/O‘7functions“are“not“completely“compatible.‘šIt“w˜ould“bMÞe“useful“for“someone“toŽ¡‘®dexplore–¦fthe“di erences“so“that“they“mighš²!t“bMÞe“ xed,“or“at“least“noted“in“the“man˜ual.ŽŸ4^‘The–Èbthird“category“of“di erences“is“(hopšMÞefully)“shrinking.‘“ÜIf“y²!ou“ nd“a“di erence“b˜et•²!w“een‘ÈbOcta“v“eŽ¡bMÞehaš²!vior–Fyand“ãMa‘ÿEtlabÝ,‘Y¨then“y˜ou“should“send“a“description“of“this“di erence“(with“coMÞde“illustratingŽ¡the–¦fdi erence,“if“pšMÞossible)“to“bug-o˜cta•²!v“eÞ@Ýc“he.utexas.edu.ŽŸ/‘An›carc•²!hiv“e˜of˜old˜p•MÞostings˜to˜the˜help-o“cta•²!v“e˜mailing˜list˜is˜main“tained˜on˜ftp.c“he.utexas.edu˜inŽ¡the–¦fdirectory“`Þ/pub/octave/MAILING-LISTSÝ'.ŽŸhºèApp‘Š=endix–¦MA‘ ¸QConcept“IndexŽŽŸòŸ,$ªëEAŽ¤óo´‹Ç cmr9¬Additional‘Thelp‘,ä‘ÅUó"”q[˜ cmsl9Í.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘^Ÿ¬8Ž©Argumen¾9t–Tlists,“v‘ÿ|rariable-length‘×½‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ x¬5ŽŸ³ëEBŽ¡¬Bo•AÇolean›Top“erators,˜short-circuit‘Eß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘wš¬4Ž¦Bug–Tin“Octa•¾9v“e,–Tnewly“found‘¹@‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘êú¬9ŽŽŸ,$ª’ô¢ ëECŽ©’ô¢ ¬Command‘Tcompletion‘ˆE‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¹ÿ¬2Ž¤’ô¢ Command‘Thistory^”‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘O¬2Ž¡’ô¢ Compatibilit¾9y–Twith“Matlab‘©È‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Û‚¬9ŽŸ³’ô¢ ëEDŽ¦’ô¢ ¬D¾9ASSL‘Nh‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘€"¬6ŽŽŽŽŸŒ‹ ^ÏŸòÝAppMÞendix–¦fA:“Concept“Index’CÁ;11ŽŽŽ ƒ3ÚŸ’ðРþ¬Data‘Tstructures‘ ß‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘;™¬2Ž¤Decremen¾9t‘TopAÇerators‘Ê­‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘üg¬4Ž¡DJGPP`‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‘½¬7Ž¤ëEEŽ©¬EMX‘> ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘oǬ7Ž¡ëEFŽ¦¬Flex‘=?‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘nú¬8Ž¤FSF–T[F›ÿ:«ree“Soft•¾9w“are‘TF˜oundation]‘å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ϭ7Ž¡FSF,–Tconš¾9tact“óߤN cmtt9É<¬gn˜uÉ@¬prep.ai.mit.eduÉ>‘e‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘5¬7Ž¡F‘ÿ:«unction–Tname“completion‘~•‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘°O¬2ŽŸëEGŽ¦¬GNU–T[GNU's“not“unix]Õ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘A¬7Ž¡GNU‘TBison‘h‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘@"¬8Ž¡GNU‘TgÉ++‘,¢‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘^\¬8Ž¡GNU‘Tgcc‘ÉÈ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘û‚¬8Ž¡GNU‘TMak¾9e‘fÚ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘˜”¬8Ž¡GNUw•¾9are,›Tanon“ymous˜FTP˜sites‘Ìt‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘þ/¬7Ž¤ëEHŽ¦¬History‘Dû‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘vµ¬2Ž¡ëEIŽ¦¬Incremen¾9t‘TopAÇeratorsR‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘H ¬4Ž¡ëELŽ¦¬libgÉ++‘ùÈ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ +ƒ¬8Ž¤Logical–TopAÇerators,“short-circuit‘Š‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘6D¬4Ž¡LSODExŠ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ªE¬6ŽŸëEMŽ¦¬Mailing–Tlists,“bug-oAÇcta•¾9v“e‘£J‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Õ¬9Ž¡Mailing–Tlists,“help-oAÇcta•¾9v“e‘›½‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Íw¬8Ž¡Manš¾9ual,–Tfor“Octa˜v˜e‘Ϋ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ f¬9ŽŽ þ’ô¢ Matlab‘Tcompatibilit¾9y&:‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Wô¬9ŽŸ’ô¢ MS-DOS‘TsuppAÇort‘—K‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ɬ7Ž¤UU’ô¢ ëENŽ©’ô¢ ¬Name‘Tcompletion‘n:‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ÿô¬2Ž¡’ô¢ ëEOŽ¦’ô¢ ¬Octa•¾9v“e–Tbug“repAÇort‘Ëa‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ý¬9Ž¤’ô¢ Octa•¾9v“e,‘Tbuilding‘n}‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 8¬7Ž¡’ô¢ Octa•¾9v“e,‘TdoAÇcumen“tation%)‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Vã¬6Ž¡’ô¢ Octa•¾9v“e,–Tgetting“a“cop¾9y‘n ‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ŸÆ¬6Ž¡’ô¢ Octa•¾9v“e,‘Tordering‘&ð‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Xª¬6Ž¡’ô¢ Octa•¾9v“e,›Tv“ersion˜date‘¦#‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘×ݬ7Ž¡’ô¢ Op•AÇerators,‘Tb“o“olean@‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Jú¬4Ž¡’ô¢ OpAÇerators,‘Tdecremen¾9t‘=²‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ol¬4Ž¡’ô¢ OpAÇerators,‘Tincremen¾9t‘x‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘ 53¬4Ž¡’ô¢ OS/2‘TsuppAÇort‘ [‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘Ò¬7Ž¤UU’ô¢ ëERŽ¦’ô¢ ¬Return–Tlists,“v‘ÿ|rariable-length‘Ç5‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘øï¬6Ž¡’ô¢ ëESŽ¦’ô¢ ¬Short-circuit›Tb•AÇo“olean˜op“eratorsU²‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘‡l¬4Ž¤’ô¢ Source‘TcoAÇdedE‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘–¬6Ž¡’ô¢ Structures‘ƒx‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘µ2¬2Ž¤UU’ô¢ ëEUŽ¦’ô¢ ¬Un¾9wind-protect‘ V‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘;¬5Ž¡’ô¢ ëEVŽ¦’ô¢ ¬V‘ÿ:«ariable–Tname“completion‘„å‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘¶ ¬2Ž¤’ô¢ V‘ÿ:«ariable-length–Targumen¾9t“listsT/‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘…ê¬5Ž¡’ô¢ V‘ÿ:«ariable-length–Treturn“lists‘´/‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘åê¬6Ž¡’ô¢ V‘þøäAX&–‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘XP¬7Ž¡’ô¢ VMS‘TsuppAÇort‘$E‘ÅUÍ.Ž–p‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž“‘ÅU.Ž‘V¬7ŽŽŽŽŸŒ‹ÿÿÿÿrKŸò’Ò¶œÝiŽŽŽ ƒ3Ú ý¨ðÐèT‘þaGable–¦Mof“Con–ÿuÂten“tsŽŽŸ*ëE1‘32What–ffis“Octa•ŒÌv“e?‘Sª‘32óF›»ˆ@ff cmti12ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘rYëE1Ž¤!À2‘32What's–ffnew“in“všŒÌersion“1.1.0“of“Octa˜v˜e‘@‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ _-ëE1Ž¡3‘32What–fffeatures“are“unique“to“Octa•ŒÌv“e?‘is‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ˆ"ëE2Ž©À‘$Ý3.1‘ ó5Command–¦fand“v‘ÿdDariable“name“completion‘‚k‘é˜ó5ý': ó3 cmti10à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ W›Ý2Ž¤‘$3.2‘ ó5Command‘¦fhistory‘j¯‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ?ßÝ2Ž¡‘$3.3‘ ó5Data‘¦fstructures‘ä.‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¹^Ý2Ž¡‘$3.4‘ ó5Short-circuit›¦fb•MÞo“olean˜op“erators‘ÕÕ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ «Ý4Ž¡‘$3.5‘ ó5Incremenš²!t–¦fand“decremen˜t“opMÞerators‘µ‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ŠHÝ4Ž¡‘$3.6‘ ó5Un²!wind-protect‘ä.‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¹_Ý5Ž¡‘$3.7‘ ó5V‘ÿeariable-length–¦fargumen²!t“lists‘­[‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ‚ŒÝ5Ž¡‘$3.8‘ ó5V‘ÿeariable-length–¦freturn“lists‘¤Ò‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ zÝ6Ž¡‘$3.9‘ ó5Built-in–¦fODE“and“Dš²!AE“solv˜ers‘!‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ éRÝ6ŽŸëE4‘32What–ffdos3cumenšŒÌtation“exists“for“Octa˜v˜e?‘ÈÑ‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ çëE6ŽŸ!À5‘32Obtaining–ffSource“Cos3de‘*¸‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘IfëE6Ž¦‘$Ý5.1‘ ó5Hoš²!w–¦fdo“I“get“a“cop˜y“of“Octa˜v˜e“for“Unix?‘l‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ A8Ý6Ž¡‘$5.2‘ ó5Hoš²!w–¦fdo“I“get“a“cop˜y“of“Octa˜v˜e“for“(some“other“platform)?‘œ"‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ qSÝ7Ž¡‘$5.3‘ ó5What–¦fis“the“latest“vš²!ersion“of“Octa˜v˜e‘ê6‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ¿fÝ7ŽŸëE6‘32Installation–ffIssues“and“Problems‘²Ò‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ Ñ€ëE7Ž¦‘$Ý6.1‘ ó5What–¦felse“do“I“need?‘š(‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ oYÝ8Ž¡‘$6.2‘ ó5Can–¦fI“compile“Octa•²!v“e–¦fwith“another“CÞ++“Ýcompiler?‘Vì‘é˜à.Ž–.Ô‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž“‘é˜.Ž‘ ,Ý8ŽŸëE7‘32Common‘ffproblems‘@‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘.ïëE8Ž¤!À8‘32Getting–ffadditional“help‘íì‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ›ëE8Ž¡9‘32I–ffthink“I“ha•ŒÌv“e–fffound“a“bug“in“Octa•ŒÌv“e.;b‘32ëF.Ž–¸R‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž“‘32.Ž‘ ZëE9Ž¡10‘32PšŒÌorting–ffprograms“from“óJŒ-øff cmcsc10ëJMa‘ÿ 77 D<000100000003800000038000000380000007C0000007C000 000BE0000009E0000009E0000010F0000010F0000030F800002078000020780000403C00 00403C0000C03E0000801E0000801E0001FFFF0001FFFF0001000F000200078002000780 040003C0040003C00C0003C00C0001E03E0003F0FF000FFEFF000FFE1F1F7E9E25>97 DI108 D<7FFFFFF07FFFFFF0780780F0600780304007 801040078010C00780188007800880078008800780088007800800078000000780000007 800000078000000780000007800000078000000780000007800000078000000780000007 80000007800000078000000780000007800000078000000FC00001FFFE0001FFFE001D1F 7E9E23>116 D E /Fb 1 47 df<70F8F8F0E005057B840E>46 D E /Fc 1 47 df<387CFCFCF87006067A8512>46 D E /Fd 4 65 df<01C00001C00001C00001C00001C00001C00001C000FFFF80FFFF80FFFF8001C00001 C00001C00001C00001C00001C00001C00011117F9314>43 D<000E003E007C00F003E007 C01F003E00F800F000F8003E001F0007C003E000F0007C003E000E0F137E9414>60 D<4000E000F8007C001E000F8007C001F000F8003E001E003E00F801F007C00F801E007C 00F800E00040000F157E9514>62 D<01E007F00E38181C38FC71FC739E739EE70EE70EE7 0EE70EE70EE70EE70E739C739C71F838F018060E1E07F801F00F177E9614>64 D E /Fe 1 47 df<7070F06004047D830B>46 D E /Ff 58 122 df<60F0F868080808101020C0050B7D990B>39 D<60F0F07010101020204080040B7D83 0B>44 DI<60F0F06004047D830B>I<0004000C00180018001800 300030003000600060006000C000C000C00180018001800300030003000600060006000C 000C000C00180018001800300030003000600060006000C000C0000E257E9B13>I<0F80 106020304038803CC01CE01C401C003C003800380070006000C001800100020004040804 100430083FF87FF8FFF80E187E9713>50 D<00300030007000F000F00170037002700470 0C7008701070307020704070C070FFFF00700070007000700070007007FF10187F9713> 52 D<30183FF03FE03FC02000200020002000200027C03860203000380018001C001C40 1CE01CE01C80184038403030E00F800E187E9713>I<01E006100C181838303830007000 6000E000E7C0E860F030F018E018E01CE01CE01C601C601C701830183030186007C00E18 7E9713>I<40007FFE7FFC7FFC4008801080108020004000400080018001800100030003 000300030007000700070007000700070002000F197E9813>I<07801860303020186018 6018601870103C303E600F8007C019F030F86038401CC00CC00CC00CC00C600820101860 0FC00E187E9713>I<07801860303070306018E018E018E01CE01CE01C601C603C303C18 5C0F9C001C00180018003870307060604021801F000E187E9713>I<000C0000000C0000 000C0000001E0000001E0000003F00000027000000270000004380000043800000438000 0081C0000081C0000081C0000100E0000100E00001FFE000020070000200700006007800 040038000400380008001C0008001C001C001E00FF00FFC01A1A7F991D>65 DI<003F0201C0C603002E0E001E1C000E1C000638000678 0002700002700002F00000F00000F00000F00000F00000F0000070000270000278000238 00041C00041C00080E000803003001C0C0003F00171A7E991C>IIII<003F020001C0 C60003002E000E001E001C000E001C00060038000600780002007000020070000200F000 0000F0000000F0000000F0000000F0000000F001FFC070000E0070000E0078000E003800 0E001C000E001C000E000E000E000300160001C06600003F82001A1A7E991E>III<1FFC00 E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000 E040E0E0E0E0E041C061801E000E1A7D9914>I76 DII<007F000001C1C000070070000E0038001C001C 003C001E0038000E0078000F0070000700F0000780F0000780F0000780F0000780F00007 80F0000780F0000780F000078078000F0078000F0038000E003C001E001C001C000E0038 000700700001C1C000007F0000191A7E991E>II82 D<0FC21836200E6006C006C002C002C002E00070007E003FE01FF807FC003E000E000700 03800380038003C002C006E004D81887E0101A7E9915>I<7FFFFF00701C0700401C0100 401C0100C01C0180801C0080801C0080801C0080001C0000001C0000001C0000001C0000 001C0000001C0000001C0000001C0000001C0000001C0000001C0000001C0000001C0000 001C0000001C0000001C0000001C000003FFE000191A7F991C>III<7FC0FF000F003C0007003000078020000380600001C0400001E0800000 E1800000710000007A0000003C0000001C0000001E0000001E0000001700000027800000 4380000041C0000081E0000100E0000100700002007800040038000C001C001E003E00FF 80FFC01A1A7F991D>88 D91 D93 D<3F8070C070E020700070007007F01C7030707070E070E071E071E0F171FB1E3C10107E 8F13>97 DI<07F80C1C381C30087000E000E000E000E000 E000E0007000300438080C1807E00E107F8F11>I<007E00000E00000E00000E00000E00 000E00000E00000E00000E00000E0003CE000C3E00380E00300E00700E00E00E00E00E00 E00E00E00E00E00E00E00E00600E00700E00381E001C2E0007CFC0121A7F9915>I<07C0 1C3030187018600CE00CFFFCE000E000E000E0006000300438080C1807E00E107F8F11> I<01F0031807380E100E000E000E000E000E000E00FFC00E000E000E000E000E000E000E 000E000E000E000E000E000E000E007FE00D1A80990C>I<0FCE18733030703870387038 7038303018602FC02000600070003FF03FFC1FFE600FC003C003C003C0036006381C07E0 10187F8F13>II<18003C003C0018000000000000000000 00000000FC001C001C001C001C001C001C001C001C001C001C001C001C001C001C00FF80 091A80990A>I107 DIII<07E01C38300C700E60 06E007E007E007E007E007E0076006700E381C1C3807E010107F8F13>II 114 D<1F2060E04020C020C020F0007F003FC01FE000F080708030C030C020F0408F800C 107F8F0F>I<0400040004000C000C001C003C00FFC01C001C001C001C001C001C001C00 1C001C201C201C201C201C200E4003800B177F960F>IIIIII E /Fg 5 117 df77 D<0000300000000078000000007800 0000007800000000FC00000000FC00000001FE00000001BE00000001BE000000031F0000 00031F000000031F000000060F800000060F8000000E0FC000000C07C000000C07C00000 1803E000001803E000003803F000003001F000003001F000006000F800007FFFF800007F FFF80000C0007C0000C0007C0001C0007E000180003E000180003E000300001F00030000 1F000700001F800F80001F801FC0001FC0FFE000FFFCFFE000FFFC26257EA42C>97 DI108 D<7FFFFFFFE07FFFFFFFE0 7C00F803E07000F800E07000F800E06000F80060E000F80070E000F80070C000F80030C0 00F80030C000F80030C000F800300000F800000000F800000000F800000000F800000000 F800000000F800000000F800000000F800000000F800000000F800000000F800000000F8 00000000F800000000F800000000F800000000F800000000F800000000F800000000F800 000000F800000000F800000000F800000001FC0000007FFFF000007FFFF00024257EA42A >116 D E /Fh 9 117 df80 D<07F0001FFC003F1E003F1F003F0F803F0F800C0F80000F8000FF800FFF801F0F807C0F 807C0F80F80F80F80F80F80F80F817807C37803FE7F00F81F014147F9316>97 D<003FC0003FC00007C00007C00007C00007C00007C00007C00007C00007C00007C00007 C003E7C00FFFC01F1FC03E07C07C07C07C07C0FC07C0FC07C0FC07C0FC07C0FC07C0FC07 C0FC07C0FC07C07C07C07C07C03C0FC01E1FC00FF7F807E7F815207E9F19>100 D<03F8000FFE001F1F003E0F807E07807C07C0FC07C0FC07C0FFFFC0FFFFC0FC0000FC00 00FC0000FC00007C00007E00C03E01C01F038007FF0001FC0012147F9315>I108 D110 D<01F8000FFF001F0F803E07C07C03E07C03E07C03E0FC03F0FC03F0FC03F0FC03F0FC03 F0FC03F0FC03F07C03E07C03E03E07C01F0F800FFF0003FC0014147F9317>I<1FB03FF0 7070E030E030E030F000FF007FC03FE01FF007F80078C038C038E038E038F070FFE0CF80 0D147E9312>115 D<0300030003000300070007000F000F003F00FFF8FFF81F001F001F 001F001F001F001F001F001F001F001F181F181F181F181F180F3007F003E00D1D7F9C12 >I E /Fi 1 44 df<000C0000001E0000001E0000001E0000001E0000001E0000001E00 00001E0000001E0000001E0000001E00007FFFFF80FFFFFFC0FFFFFFC07FFFFF80001E00 00001E0000001E0000001E0000001E0000001E0000001E0000001E0000001E0000001E00 00000C00001A1A7E9E1F>43 D E /Fj 1 50 df<0C001C00EC000C000C000C000C000C00 0C000C000C000C000C000C000C000C000C000C00FFC00A137D9211>49 D E /Fk 5 117 df77 D<001800001800001800003C00003C00004E00004E00004E000087000087000187800103 800103800201C00201C003FFC00400E00400E00800700800701800703C0078FE01FF1817 7F961C>97 DI108 D<7FFFFC70381C403804403804C038068038028038028038020038000038000038000038 00003800003800003800003800003800003800003800003800003800007C0007FFC01717 7F961B>116 D E /Fl 45 121 df<1E003F007F80FFC0FFC0FFE0FFE07FE03F601E6000 600060006000C000C000C001800180030006000C001800300020000B187AB116>39 D<1E003F007F80FFC0FFC0FFC0FFC07F803F001E000A0A7A8916>46 D<000FF80000007FFF000001FC1FC00003F007E00007E003F0000FE003F8001FC001FC00 1FC001FC003FC001FE003F8000FE003F8000FE007F8000FF007F8000FF007F8000FF007F 8000FF00FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF80 00FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000FF80FF8000 FF80FF8000FF80FF8000FF807F8000FF007F8000FF007F8000FF007F8000FF007F8000FF 003F8000FE003FC001FE001FC001FC001FC001FC000FE003F80007E003F00003F007E000 01FC1FC000007FFF0000000FF80000212E7DAD28>48 D<0001C0000003C000000FC00000 7FC0001FFFC000FFFFC000FFBFC000E03FC000003FC000003FC000003FC000003FC00000 3FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC00000 3FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC00000 3FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC00000 3FC000003FC000003FC000003FC0007FFFFFE07FFFFFE07FFFFFE01B2E7AAD28>I<003F E00001FFFE0007FFFF800F80FFC01E003FE038001FF07C000FF87E0007FCFF0007FCFF80 07FEFF8007FEFF8003FEFF8003FE7F0003FE3E0007FE000007FE000007FC000007FC0000 0FF800000FF800000FF000001FE000001FC000003F8000007F0000007E000000F8000001 F0000003E0000007C000000F0000001E000E003C000E0038000E0070001E00E0001C01C0 001C0300003C07FFFFFC0FFFFFFC1FFFFFFC3FFFFFFC7FFFFFF8FFFFFFF8FFFFFFF8FFFF FFF81F2E7CAD28>I<001FF80000007FFF000001FFFFC00003E03FE00007800FF0000FC0 0FF8001FE007F8001FE007FC001FE007FC001FE007FC001FE007FC000FC007FC00078007 FC0000000FF80000000FF80000000FF00000001FE00000001FC00000003F80000000FE00 00003FF80000003FFF800000001FE000000007F000000007F800000003FC00000003FE00 000001FF00000001FF00000001FF80000001FF80000001FF801C0001FF803E0001FF807F 0001FF80FF8001FF80FF8001FF00FF8001FF00FF8003FE007F0003FE007E0007FC003C00 07F8001FC01FF0000FFFFFC00003FFFF0000003FF80000212E7DAD28>I<000000700000 0000F000000001F000000003F000000007F00000000FF00000000FF00000001FF0000000 3FF000000077F0000000F7F0000000E7F0000001C7F000000387F000000707F000000F07 F000000E07F000001C07F000003807F000007007F00000F007F00000E007F00001C007F0 00038007F000070007F0000F0007F0000E0007F0001C0007F000380007F000700007F000 E00007F000FFFFFFFFE0FFFFFFFFE0FFFFFFFFE000000FF00000000FF00000000FF00000 000FF00000000FF00000000FF00000000FF00000000FF00000000FF000000FFFFFE0000F FFFFE0000FFFFFE0232E7EAD28>I<0C0000300FC003F00FFFFFE00FFFFFC00FFFFF800F FFFF000FFFFE000FFFF8000FFFF0000FFF80000E0000000E0000000E0000000E0000000E 0000000E0000000E0000000E0000000E1FF0000E7FFE000FE03F800F800FC00E0007E00C 0007F0000007F8000003FC000003FC000003FC000003FE000003FE180003FE3E0003FE7F 0003FEFF0003FEFF0003FEFF0003FCFF0003FCFE0003FC780007F8780007F03C000FE01E 001FC00FC07F8007FFFF0001FFFC00003FE0001F2E7CAD28>I<0000FF80000007FFE000 001FFFF000007F80F80000FE003C0001F8007C0003F000FE0007F001FE000FE001FE000F E001FE001FC001FE003FC000FC003FC00078003FC00000007F800000007F800000007F80 000000FF83FC0000FF8FFF8000FF9C0FC000FFB003F000FFB001F800FFE001FC00FFC001 FE00FFC000FE00FFC000FF00FFC000FF00FF8000FF80FF8000FF80FF8000FF80FF8000FF 807F8000FF807F8000FF807F8000FF807F8000FF803F8000FF003FC000FF001FC000FF00 1FC000FE000FC001FC0007E001FC0003F003F80001FC0FE00000FFFFC000003FFF000000 0FFC0000212E7DAD28>I<38000000003E000000003FFFFFFFC03FFFFFFFC03FFFFFFFC0 3FFFFFFF807FFFFFFF007FFFFFFE007FFFFFFC007FFFFFF8007800003800700000700070 0000E000F00001C000E000038000E000070000E00007000000000E000000001C00000000 380000000038000000007800000000F000000000F000000001F000000001E000000003E0 00000003E000000007E000000007E00000000FC00000000FC00000000FC00000001FC000 00001FC00000001FC00000001FC00000001FC00000003FC00000003FC00000003FC00000 003FC00000003FC00000003FC00000003FC00000003FC00000001F800000000F00000022 307CAF28>I<000FF80000003FFF000000FFFFC00001F00FE00003C003F000078000F800 0F0000F8000F00007C000F00007C001F00007C001F00007C001F80007C001FC0007C001F F000F8001FFC00F8000FFE00F0000FFF81E00007FFE3C00007FFFF800003FFFE000001FF FF000000FFFFC000003FFFE00001FFFFF00003E3FFF80007C1FFFC001F807FFE003F001F FF003E0007FF007E0003FF807E0000FF80FC00007F80FC00003F80FC00001F80FC00001F 80FC00001F80FC00001F007E00001F007E00001F007F00003E003F00007C001FC000F800 0FF007F00003FFFFE00000FFFF8000001FF80000212E7DAD28>I<000FF80000007FFF00 0001FFFF800003F80FC00007E007E0000FC003F0001FC001F8003FC001FC007F8001FC00 7F8001FE007F8000FE00FF8000FF00FF8000FF00FF8000FF00FF8000FF00FF8000FF80FF 8000FF80FF8000FF80FF8000FF807F8001FF807F8001FF803F8001FF803FC001FF801FC0 03FF800FC006FF8007E006FF8001F81CFF8000FFF8FF80001FE0FF80000000FF00000000 FF00000000FF00000000FF000F0001FE001F8001FE003FC001FC003FC001FC003FC003F8 003FC003F0003F8007E0001F000FC0001E001F80000F80FF000007FFFE000001FFF80000 007FC00000212E7DAD28>I<007FF00003FFFE000F807F801C001FC038000FE07C000FF0 FE000FF8FF000FF8FF000FF8FF000FF8FF000FF87E000FF03C001FF000001FE000003FC0 00007F800000FE000000F8000001F0000003E0000003C0000007800000070000000F0000 000E0000000E0000000E0000000E0000000E0000000E0000000E0000000E0000000E0000 00000000000000000000000000000000000000000000000000000000001E0000003F0000 007F800000FFC00000FFC00000FFC00000FFC000007F8000003F0000001E00001D327CB1 26>63 D<0000007800000000000078000000000000FC000000000000FC000000000000FC 000000000001FE000000000001FE000000000003FF000000000003FF000000000007FF80 0000000007FF800000000007FF80000000000FFFC0000000000E7FC0000000001E7FE000 0000001C3FE0000000001C3FE000000000383FF000000000381FF000000000781FF80000 0000700FF800000000700FF800000000E00FFC00000000E007FC00000001E007FE000000 01C003FE00000001C003FE000000038003FF000000038001FF000000078001FF80000007 0000FF800000070000FF8000000FFFFFFFC000000FFFFFFFC000001FFFFFFFE000001C00 003FE000003C00003FF000003800001FF000003800001FF000007000001FF80000700000 0FF80000F000000FFC0000E0000007FC0000E0000007FC0001C0000007FE0003E0000003 FE00FFFF8001FFFFFCFFFF8001FFFFFCFFFF8001FFFFFC36317DB03D>65 D<000003FF80018000003FFFF003800001FFFFFC07800007FF003F0F80001FF800079F80 003FC00001FF8000FF800000FF8001FE0000007F8003FC0000003F8007FC0000001F8007 F80000000F800FF00000000F801FF000000007801FF000000007803FE000000007803FE0 00000003807FE000000003807FE000000003807FC000000000007FC00000000000FFC000 00000000FFC00000000000FFC00000000000FFC00000000000FFC00000000000FFC00000 000000FFC00000000000FFC00000000000FFC000000000007FC000000000007FC0000000 00007FE000000000007FE000000003803FE000000003803FE000000003801FF000000003 801FF000000007800FF0000000070007F8000000070007FC0000000E0003FC0000001E00 01FE0000001C0000FF8000007800003FC00000F000001FF80003E0000007FF003F800000 01FFFFFE000000003FFFF80000000003FF80000031317CB03A>67 D<000003FF00030000007FFFF007000001FFFFFC0F000007FF007E1F00001FF0000FBF00 007FC00003FF0000FF800001FF0001FE0000007F0003FC0000007F0007FC0000003F000F F80000001F000FF00000001F001FF00000000F001FF00000000F003FE000000007003FE0 00000007007FE000000007007FE000000007007FC00000000000FFC00000000000FFC000 00000000FFC00000000000FFC00000000000FFC00000000000FFC00000000000FFC00000 000000FFC00000000000FFC00000000000FFC00000000000FFC00007FFFFFC7FC00007FF FFFC7FE00007FFFFFC7FE0000001FF003FE0000001FF003FE0000001FF001FF0000001FF 001FF0000001FF000FF0000001FF000FF8000001FF0007FC000001FF0003FC000001FF00 01FE000001FF0000FF800001FF00007FC00003FF00001FF800077F000007FF003E3F0000 01FFFFFC1F0000007FFFF00F00000003FF80030036317CB03F>71 D73 D<00000FFF0000000000FFFF F000000007FC03FE0000001FE0007F8000003F80001FC000007F00000FE00001FE000007 F80003FC000003FC0007F8000001FE0007F8000001FE000FF0000000FF001FF0000000FF 801FE00000007F803FE00000007FC03FE00000007FC03FE00000007FC07FC00000003FE0 7FC00000003FE07FC00000003FE0FFC00000003FF0FFC00000003FF0FFC00000003FF0FF C00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC00000003FF0FFC0 0000003FF0FFC00000003FF0FFC00000003FF07FC00000003FE07FE00000007FE07FE000 00007FE07FE00000007FE03FE00000007FC03FE00000007FC01FF0000000FF801FF00000 00FF800FF8000001FF0007F8000001FE0007FC000003FE0003FC000003FC0001FE000007 F80000FF00000FF000003FC0003FC000001FE0007F80000007FC03FE00000000FFFFF000 0000000FFF00000034317CB03D>79 DI<001FF8018000FF FF038003FFFFC78007F007EF800F8000FF801F00007F803E00001F803E00000F807C0000 0F807C00000780FC00000780FC00000780FC00000380FE00000380FE00000380FF000000 00FFC00000007FF00000007FFF8000003FFFF800003FFFFF80001FFFFFF0000FFFFFF800 07FFFFFE0003FFFFFF0000FFFFFF80003FFFFF800001FFFFC000001FFFE0000000FFE000 00003FE00000001FF00000000FF000000007F060000007F0E0000003F0E0000003F0E000 0003F0E0000003E0F0000003E0F0000003E0F8000007C0FC000007C0FF00000F80FFC000 1F00FBFC00FE00F1FFFFF800E03FFFF000C003FF800024317CB02D>83 D<7FFFFFFFFFFF007FFFFFFFFFFF007FFFFFFFFFFF007FC00FF801FF007E000FF8003F00 7C000FF8001F0078000FF8000F0078000FF8000F0070000FF8000700F0000FF8000780F0 000FF8000780F0000FF8000780E0000FF8000380E0000FF8000380E0000FF8000380E000 0FF8000380E0000FF800038000000FF800000000000FF800000000000FF800000000000F F800000000000FF800000000000FF800000000000FF800000000000FF800000000000FF8 00000000000FF800000000000FF800000000000FF800000000000FF800000000000FF800 000000000FF800000000000FF800000000000FF800000000000FF800000000000FF80000 0000000FF800000000000FF800000000000FF800000000000FF800000000000FF8000000 00000FF800000000000FF800000000000FF800000000000FF8000000007FFFFFFF000000 7FFFFFFF0000007FFFFFFF000031307DAF38>I87 D<00FFF0000003FFFE00000F803F80000FC00FE0001FE0 07F0001FE007F0001FE003F8000FC003FC00078003FC00000003FC00000003FC00000003 FC00000003FC000000FFFC00001FFFFC0000FFE3FC0003FC03FC000FF003FC001FC003FC 003FC003FC007F8003FC007F8003FC00FF0003FC00FF0003FC00FF0003FC00FF0007FC00 FF0007FC007F800DFC003FC019FE001FE070FFF007FFE07FF000FF803FF024207E9F27> 97 D<01F8000000FFF8000000FFF8000000FFF80000000FF800000007F800000007F800 000007F800000007F800000007F800000007F800000007F800000007F800000007F80000 0007F800000007F800000007F800000007F800000007F83FE00007F8FFFC0007FBE07F00 07FF001F8007FE000FC007FC000FE007F80007F007F80007F807F80007F807F80003FC07 F80003FC07F80003FC07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F8 0003FE07F80003FE07F80003FE07F80003FC07F80003FC07F80003FC07F80007F807F800 07F807F80007F007FC000FE007FE000FC007E7003F8007C3C0FE000780FFF80007003FC0 0027327EB12D>I<000FFF00007FFFC001FC01F003F003F007E007F80FE007F81FC007F8 3FC003F03FC001E07F8000007F8000007F800000FF800000FF800000FF800000FF800000 FF800000FF800000FF800000FF8000007F8000007F8000007F8000003FC0001C3FC0001C 1FC000380FE0003807E0007003F001E001FC07C0007FFF00000FF8001E207D9F24>I<00 00000FC0000007FFC0000007FFC0000007FFC00000007FC00000003FC00000003FC00000 003FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC0000000 3FC00000003FC00000003FC00000003FC00007F83FC0003FFF3FC000FE07BFC003F801FF C007E0007FC00FE0007FC01FC0003FC03FC0003FC03FC0003FC07F80003FC07F80003FC0 7F80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF 80003FC0FF80003FC07F80003FC07F80003FC07F80003FC03FC0003FC03FC0003FC01FC0 003FC00FE0007FC007E000FFC003F003FFE001FC0F3FFE007FFE3FFE000FF03FFE27327D B12D>I<000FFC00007FFF8001FC0FC003F003E007E001F00FE001F81FC000FC3FC000FE 3FC000FE7F80007E7F80007F7F80007FFF80007FFF80007FFFFFFFFFFFFFFFFFFF800000 FF800000FF800000FF8000007F8000007F8000007F8000003FC000071FC000071FC0000E 0FE0000E07F0001C03F8007800FE03E0003FFFC00007FE0020207E9F25>I<0001FE0000 0FFF80001FC3C0007F07E000FE0FF001FE0FF001FC0FF003FC0FF003FC07E003FC018003 FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC0000FFFFFC00FF FFFC00FFFFFC0003FC000003FC000003FC000003FC000003FC000003FC000003FC000003 FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003 FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003 FC00007FFFF0007FFFF0007FFFF0001C327EB119>I<001FF007C000FFFE3FE001F83F79 F007E00FC3F00FE00FE1F00FC007E0E01FC007F0001FC007F0003FC007F8003FC007F800 3FC007F8003FC007F8003FC007F8001FC007F0001FC007F0000FC007E0000FE00FE00007 E00FC00003F83F000006FFFE00000E1FF000000E000000001E000000001E000000001F00 0000001F800000001FFFFF80000FFFFFF0000FFFFFFC0007FFFFFE0003FFFFFF0003FFFF FF800FFFFFFFC01F00007FC07E00001FE07C00000FE0FC000007E0FC000007E0FC000007 E0FC000007E07E00000FC03E00000F803F00001F800FC0007E0007F803FC0001FFFFF000 001FFF0000242F7E9F28>I<01F8000000FFF8000000FFF8000000FFF80000000FF80000 0007F800000007F800000007F800000007F800000007F800000007F800000007F8000000 07F800000007F800000007F800000007F800000007F800000007F800000007F807F80007 F83FFE0007F8783F0007F8C03F8007F9801FC007FB001FC007FE001FE007FC001FE007FC 001FE007FC001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F800 1FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001F E007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE0FFFFC3FFFF FFFFC3FFFFFFFFC3FFFF28327DB12D>I<03C00007E0000FF0001FF8001FF8001FF8001F F8000FF00007E00003C00000000000000000000000000000000000000000000000000000 000001F800FFF800FFF800FFF8000FF80007F80007F80007F80007F80007F80007F80007 F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007 F80007F80007F80007F80007F80007F800FFFF80FFFF80FFFF8011337DB217>I<01F800 0000FFF8000000FFF8000000FFF80000000FF800000007F800000007F800000007F80000 0007F800000007F800000007F800000007F800000007F800000007F800000007F8000000 07F800000007F800000007F800000007F801FFF807F801FFF807F801FFF807F8003F0007 F8003C0007F800780007F800F00007F803C00007F807800007F80F000007F81E000007F8 78000007F8FC000007F9FE000007FBFE000007FFFF000007FE7F800007FC7FC00007F83F C00007F01FE00007F00FF00007F00FF80007F007FC0007F003FC0007F001FE0007F000FF 0007F000FF8007F0007F8007F0007FC0FFFF81FFFEFFFF81FFFEFFFF81FFFE27327EB12B >107 D<01F800FFF800FFF800FFF8000FF80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F8 0007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F80007F8 00FFFFC0FFFFC0FFFFC012327DB117>I<03F007F8001FE000FFF03FFE00FFF800FFF078 3F01E0FC00FFF0C03F8300FE000FF1801FC6007F0007F3001FCC007F0007F6001FF8007F 8007FC001FF0007F8007FC001FF0007F8007FC001FF0007F8007F8001FE0007F8007F800 1FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F 8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F800 1FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F 8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F8007F8001FE0007F80FFFFC3 FFFF0FFFFCFFFFC3FFFF0FFFFCFFFFC3FFFF0FFFFC3E207D9F45>I<03F007F800FFF03F FE00FFF0783F00FFF0C03F800FF1801FC007F3001FC007F6001FE007FC001FE007FC001F E007FC001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE0 07F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007 F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE0FFFFC3FFFFFFFF C3FFFFFFFFC3FFFF28207D9F2D>I<0007FC0000007FFFC00001FC07F00003F001F80007 E000FC000FC0007E001FC0007F003FC0007F803F80003F807F80003FC07F80003FC07F80 003FC0FF80003FE0FF80003FE0FF80003FE0FF80003FE0FF80003FE0FF80003FE0FF8000 3FE0FF80003FE07F80003FC07F80003FC07F80003FC03FC0007F803FC0007F801FC0007F 000FE000FE0007E000FC0003F803F80001FE0FF000007FFFC0000007FC000023207E9F28 >I<01F83FE000FFF8FFFC00FFFBE07F00FFFF003F8007FE001FC007FC000FE007F8000F F007F80007F807F80007F807F80007FC07F80003FC07F80003FC07F80003FE07F80003FE 07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F80003FE07F80003FC07 F80007FC07F80007FC07F80007F807F80007F807F8000FF007FC000FE007FE001FC007FF 003F8007FBC0FE0007F8FFF80007F83FC00007F800000007F800000007F800000007F800 000007F800000007F800000007F800000007F800000007F800000007F800000007F80000 00FFFFC00000FFFFC00000FFFFC00000272E7E9F2D>I<0007F801C0003FFE03C000FE07 07C003F8018FC007F000CFC00FE000FFC01FE0007FC03FC0007FC03FC0003FC07FC0003F C07FC0003FC07F80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0FF80003FC0 FF80003FC0FF80003FC0FF80003FC07F80003FC07F80003FC07FC0003FC03FC0003FC03F C0003FC01FE0007FC00FE0007FC007F000FFC003F803BFC001FC0F3FC0007FFE3FC0000F F03FC00000003FC00000003FC00000003FC00000003FC00000003FC00000003FC0000000 3FC00000003FC00000003FC00000003FC00000003FC0000007FFFE000007FFFE000007FF FE272E7D9F2B>I<03F03F00FFF07FC0FFF1C3E0FFF187E00FF30FF007F60FF007F60FF0 07FC07E007FC03C007FC000007FC000007F8000007F8000007F8000007F8000007F80000 07F8000007F8000007F8000007F8000007F8000007F8000007F8000007F8000007F80000 07F8000007F8000007F8000007F80000FFFFE000FFFFE000FFFFE0001C207E9F21>I<01 FF860007FFFE001F00FE003C003E0078001E0078000E00F8000E00F8000E00F8000E00FC 000000FF800000FFFC00007FFFC0007FFFF0003FFFF8001FFFFC0007FFFE0001FFFF0000 3FFF000000FF8000003F8060001F80E0000F80E0000F80F0000F80F0000F00F8000F00FC 001E00FE001C00FF807800F3FFF000C07F800019207D9F20>I<001C0000001C0000001C 0000001C0000001C0000003C0000003C0000003C0000007C0000007C000000FC000001FC 000003FC000007FC00001FFFFE00FFFFFE00FFFFFE0003FC000003FC000003FC000003FC 000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC000003FC 000003FC000003FC000003FC000003FC038003FC038003FC038003FC038003FC038003FC 038003FC038001FC038001FC070000FE0700007F0E00003FFC000007F000192E7FAD1F> I<01F80007E0FFF803FFE0FFF803FFE0FFF803FFE00FF8003FE007F8001FE007F8001FE0 07F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007 F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8001FE007F8 001FE007F8001FE007F8001FE007F8003FE007F8003FE003F8007FE003F8007FE001FC00 DFF000FE039FFF007FFF1FFF000FFC1FFF28207D9F2D>III<7FFF807FFC7FFF807FFC 7FFF807FFC03FE000F0001FE001E0000FF003C0000FF807800007FC07800003FE0F00000 1FE1E000000FF3C000000FFF80000007FF00000003FE00000001FE00000000FF00000000 FF80000000FFC0000001FFC0000003DFE00000078FF00000078FF800000F07FC00001E03 FC00003C01FE00007800FF0000F000FF8000E0007FC001E0003FC0FFFC01FFFFFFFC01FF FFFFFC01FFFF28207F9F2B>I E /Fm 73 127 df<4010E038F078E038E038E038E038E0 38E038E038E038E038E03860300D0E7B9C18>34 D<01C00007E0000FF0000E70001C3800 1C38001C38001C38001C73F01C73F01CE3F00FE3800FC7000F87000F07001F0E003F0E00 7B8E0073DC00E1DC00E0F800E0F800E07070E0787070FC707FFFE03FCFE00F03C0141C7F 9B18>38 D<387C7C7E3E0E0E0E1C1C38F8F0C0070E789B18>I<007000F001E003C00780 0F001E001C00380038007000700070007000E000E000E000E000E000E000E000E0007000 700070007000380038001C001E000F00078003C001F000F000700C24799F18>I<6000F0 0078003C001E000F000780038001C001C000E000E000E000E00070007000700070007000 700070007000E000E000E000E001C001C0038007800F001E003C007800F00060000C247C 9F18>I<01C00001C00001C00001C000C1C180F1C780F9CF807FFF001FFC0007F00007F0 001FFC007FFF00F9CF80F1C780C1C18001C00001C00001C00001C00011147D9718>I<00 600000F00000F00000F00000F00000F00000F00000F0007FFFC0FFFFE0FFFFE07FFFC000 F00000F00000F00000F00000F00000F00000F00000600013147E9718>I<1C3E7E7F3F1F 070E1E7CF860080C788518>I<7FFF00FFFF80FFFF807FFF0011047D8F18>I<3078FCFC78 300606778518>I<000300000780000780000F80000F00001F00001E00001E00003E0000 3C00007C0000780000780000F80000F00001F00001E00003E00003C00003C00007C00007 80000F80000F00000F00001F00001E00003E00003C00003C00007C0000780000F80000F0 0000F0000060000011247D9F18>I<01F00007FC000FFE001F1F001C07003803807803C0 7001C07001C0E000E0E000E0E000E0E000E0E000E0E000E0E000E0E000E0E000E0F001E0 7001C07001C07803C03803801C07001F1F000FFE0007FC0001F000131C7E9B18>I<0180 0380038007800F803F80FF80FB8043800380038003800380038003800380038003800380 0380038003800380038003807FFCFFFE7FFC0F1C7B9B18>I<03F0000FFE003FFF007C0F 807003C0E001C0F000E0F000E06000E00000E00000E00001C00001C00003C0000780000F 00001E00003C0000780000F00001E00007C0000F80001E00E03C00E07FFFE0FFFFE07FFF E0131C7E9B18>I<07F8001FFE003FFF007807807803C07801C03001C00001C00003C000 0380000F0003FF0003FE0003FF000007800003C00001C00000E00000E00000E0F000E0F0 00E0F001C0F003C07C07803FFF001FFE0003F800131C7E9B18>I<001F00003F00007700 00770000E70001E70001C7000387000787000707000E07001E07003C0700380700780700 F00700FFFFF8FFFFF8FFFFF8000700000700000700000700000700000700007FF000FFF8 007FF0151C7F9B18>I<1FFF803FFF803FFF803800003800003800003800003800003800 003800003800003BF8003FFE003FFF003C07801803C00001C00000E00000E06000E0F000 E0F000E0E001C07003C07C0F803FFF001FFC0003F000131C7E9B18>I<007E0001FF0007 FF800F83C01E03C01C03C0380180380000700000700000E1F800E7FE00FFFF00FE0780F8 03C0F001C0F000E0E000E0F000E07000E07000E07000E03801C03C03C01E07800FFF0007 FE0001F800131C7E9B18>II<03F8 000FFE001FFF003E0F803803807001C07001C07001C07001C03803803C07801FFF0007FC 000FFE001F1F003C07807001C0F001E0E000E0E000E0E000E0E000E07001C07803C03E0F 801FFF000FFE0003F800131C7E9B18>I<03F0000FFC001FFE003C0F00780780700380E0 01C0E001C0E001C0E001E0E001E07001E07803E03C0FE01FFFE00FFEE003F0E00000E000 01C00001C00001C0300380780780780F00783E003FFC001FF00007C000131C7E9B18>I< 3078FCFC783000000000000000003078FCFC78300614779318>I<183C7E7E3C18000000 0000000000183C7E7E3E1E0E1C3C78F060071A789318>I<000300000780001F80003F00 007E0001FC0003F00007E0001FC0003F00007E0000FC0000FC00007E00003F00001FC000 07E00003F00001FC00007E00003F00001F8000078000030011187D9918>I<7FFFC0FFFF E0FFFFE0FFFFE0000000000000000000000000FFFFE0FFFFE0FFFFE07FFFC0130C7E9318 >I<600000F00000FC00007E00003F00001FC00007E00003F00001FC00007E00003F0000 1F80001F80003F00007E0001FC0003F00007E0001FC0003F00007E0000FC0000F0000060 000011187D9918>I<007C0001FE0007FF000F87801E03C03C1DC0387FC070FFE071E3E0 71C1E0E1C1E0E380E0E380E0E380E0E380E0E380E0E380E0E1C1C071C1C071E3C070FF80 387F003C1C001E00E00F83E007FFC001FF80007E00131C7E9B18>64 D<00700000F80000F80000D80000D80001DC0001DC0001DC00018C00038E00038E00038E 00038E000306000707000707000707000707000FFF800FFF800FFF800E03800E03801C01 C01C01C07F07F0FF8FF87F07F0151C7F9B18>I<00F8E003FEE007FFE00F07E01E03E03C 01E03800E07000E07000E0700000E00000E00000E00000E00000E00000E00000E00000E0 00007000007000E07000E03800E03C00E01E01C00F07C007FF8003FE0000F800131C7E9B 18>67 D<7FF800FFFE007FFF001C0F801C03C01C03C01C01E01C00E01C00E01C00F01C00 701C00701C00701C00701C00701C00701C00701C00701C00F01C00E01C00E01C01E01C01 C01C03C01C0F807FFF00FFFE007FF800141C7F9B18>II<01F1C003FDC00FFFC01F0FC01C03C03803C03801C07001C07001C0700000 E00000E00000E00000E00000E00000E00FF0E01FF0E00FF07001C07001C07003C03803C0 3803C01C07C01F0FC00FFFC003FDC001F1C0141C7E9B18>71 D<7FFF00FFFF807FFF0001 C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001C00001 C00001C00001C00001C00001C00001C00001C00001C00001C00001C0007FFF00FFFF807F FF00111C7D9B18>73 D<7FE000FFE0007FE0000E00000E00000E00000E00000E00000E00 000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00 700E00700E00700E00700E00707FFFF0FFFFF07FFFF0141C7F9B18>76 DI<7E07F0FF0FF87F07F01D81C01D81C01D 81C01DC1C01CC1C01CC1C01CE1C01CE1C01CE1C01C61C01C71C01C71C01C31C01C39C01C 39C01C39C01C19C01C19C01C1DC01C0DC01C0DC01C0DC07F07C0FF87C07F03C0151C7F9B 18>I<0FF8003FFE007FFF00780F00700700F00780E00380E00380E00380E00380E00380 E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380E00380F00780 700700780F007FFF003FFE000FF800111C7D9B18>I<7FF800FFFE007FFF001C0F801C03 801C03C01C01C01C01C01C01C01C03C01C03801C0F801FFF001FFE001FFE001C0F001C07 001C03801C03801C03801C03801C03801C039C1C039C1C039C7F01F8FF81F87F00F0161C 7F9B18>82 D<03F3801FFF803FFF807C0F80700780E00380E00380E00380E00000700000 7800003F00001FF00007FE0000FF00000F800003C00001C00000E00000E06000E0E000E0 E001E0F001C0F80780FFFF80FFFE00E7F800131C7E9B18>I<7FFFF8FFFFF8FFFFF8E070 38E07038E07038E070380070000070000070000070000070000070000070000070000070 0000700000700000700000700000700000700000700000700000700007FF0007FF0007FF 00151C7F9B18>II87 D91 D93 D<018007C01FF07EFCF8 3EE00E0F067C9B18>I<7FFF00FFFF80FFFF807FFF0011047D7F18>I<1FE0003FF8007FFC 00781E00300E0000070000070000FF0007FF001FFF007F0700780700E00700E00700E007 00F00F00781F003FFFF01FFBF007E1F014147D9318>97 D<7E0000FE00007E00000E0000 0E00000E00000E00000E00000E3E000EFF800FFFC00FC1E00F80E00F00700E00700E0038 0E00380E00380E00380E00380E00380F00700F00700F80E00FC1E00FFFC00EFF80063E00 151C809B18>I<01FE0007FF001FFF803E0780380300700000700000E00000E00000E000 00E00000E00000E000007000007001C03801C03E03C01FFF8007FF0001FC0012147D9318 >I<001F80003F80001F8000038000038000038000038000038003E3800FFB801FFF803C 1F80380F80700780700380E00380E00380E00380E00380E00380E0038070078070078038 0F803C1F801FFFF00FFBF803E3F0151C7E9B18>I<01F00007FC001FFE003E0F00380780 700380700380E001C0E001C0FFFFC0FFFFC0FFFFC0E000007000007001C03801C03E03C0 1FFF8007FF0001FC0012147D9318>I<001F80007FC000FFE000E1E001C0C001C00001C0 0001C0007FFFC0FFFFC0FFFFC001C00001C00001C00001C00001C00001C00001C00001C0 0001C00001C00001C00001C00001C00001C0007FFF007FFF007FFF00131C7F9B18>I<01 E1F007FFF80FFFF81E1E301C0E003807003807003807003807003807001C0E001E1E001F FC001FF80039E0003800001C00001FFE001FFFC03FFFE07801F0700070E00038E00038E0 0038E000387800F07E03F01FFFC00FFF8001FC00151F7F9318>I<7E0000FE00007E0000 0E00000E00000E00000E00000E00000E3E000EFF800FFFC00FC1C00F80E00F00E00E00E0 0E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E07FC3FCFFE7FE 7FC3FC171C809B18>I<03800007C00007C00007C0000380000000000000000000000000 007FC000FFC0007FC00001C00001C00001C00001C00001C00001C00001C00001C00001C0 0001C00001C00001C00001C00001C000FFFF00FFFF80FFFF00111D7C9C18>I107 D<7FE000FFE0007FE00000E00000E00000E00000 E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000 E00000E00000E00000E00000E00000E00000E0007FFFC0FFFFE07FFFC0131C7E9B18>I< 7CE0E000FFFBF8007FFFF8001F1F1C001E1E1C001E1E1C001C1C1C001C1C1C001C1C1C00 1C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C001C1C1C007F1F1F00 FFBFBF807F1F1F001914819318>I<7E3E00FEFF807FFFC00FC1C00F80E00F00E00E00E0 0E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E07FC3FCFFE7FE 7FC3FC1714809318>I<01F0000FFE001FFF003E0F803803807001C07001C0E000E0E000 E0E000E0E000E0E000E0F001E07001C07803C03C07803E0F801FFF000FFE0001F0001314 7E9318>I<7E3E00FEFF807FFFC00FC1E00F80E00F00700E00700E00380E00380E00380E 00380E00380E00380F00700F00700F80E00FC1E00FFFC00EFF800E3E000E00000E00000E 00000E00000E00000E00000E00007FC000FFE0007FC000151E809318>I<01E38007FB80 1FFF803E1F80380F80700780700780E00380E00380E00380E00380E00380E00380700780 700780380F803C1F801FFF800FFB8003E380000380000380000380000380000380000380 000380003FF8003FF8003FF8151E7E9318>I<7F87E0FF9FF07FBFF803F87803F03003E0 0003C00003C0000380000380000380000380000380000380000380000380000380007FFE 00FFFF007FFE0015147F9318>I<07F7003FFF007FFF00780F00E00700E00700E007007C 00007FE0001FFC0003FE00001F00600780E00380E00380F00380F80F00FFFF00FFFC00E7 F00011147D9318>I<0180000380000380000380000380007FFFC0FFFFC0FFFFC0038000 0380000380000380000380000380000380000380000380000380400380E00380E00380E0 01C1C001FFC000FF80003E0013197F9818>I<7E07E0FE0FE07E07E00E00E00E00E00E00 E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E00E01E00F03E007FF FC03FFFE01FCFC1714809318>I<7F8FF0FF8FF87F8FF01E03C00E03800E03800E038007 0700070700070700038E00038E00038E00038E0001DC0001DC0001DC0000F80000F80000 700015147F9318>II<7F8FF07F9FF07F8FF0070700078E00039E0001DC0001F80000F80000700000F0 0000F80001DC00039E00038E000707000F07807F8FF0FF8FF87F8FF015147F9318>I<7F 8FF0FF8FF87F8FF00E01C00E03800E0380070380070700070700038700038600038E0001 CE0001CE0000CC0000CC0000DC0000780000780000780000700000700000700000F00000 E00079E0007BC0007F80003F00001E0000151E7F9318>I<3FFFF07FFFF07FFFF07001E0 7003C0700780000F00001E00003C0000F80001F00003C0000780000F00701E00703C0070 780070FFFFF0FFFFF0FFFFF014147F9318>I<60F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0 F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0F0600424769F18>124 D<060C1F1E3FBEFBF8F1F060C00F067C9B18>126 D E /Fn 21 122 df<07F8000C0C001E06001E07001C070000070000070000070000FF0007C7001E07003C 0E00780E00F00E10F00E10F00E10F01E10F02E20784F401F878014147D9317>97 D<0700003F00000F00000700000700000E00000E00000E00000E00000E00000E00001C00 001C7C001D87001E03801C01C01C01C03801C03801E03801E03801E03801E03801E07003 C07003C0700380700780700700700E00E81C00C4380083E00013207B9F19>I<01FC0706 0E0F1C0F380E78007000F000F000F000F000E000E000E000E000F0027004300818300FC0 10147C9314>I<0000700003F00000F00000700000700000E00000E00000E00000E00000 E00000E00001C000F9C00305C00E03C01C03C03801C0780380700380F00380F00380F003 80F00380E00700E00700E00700E00700E00700700F00301E00186F000F8FE014207C9F19 >I<00F800070E000E07001C0700380380780380700380F00380F00380FFFF80F00000E0 0000E00000E00000E00000F001007002003004001C180007E00011147D9314>I<000780 0018C00031E00061E000E1C000C00001C00001C00001C00001C00001C0000380007FF800 0380000380000380000380000700000700000700000700000700000700000E00000E0000 0E00000E00000E00000E00001C00001E0000FFE00013207E9F0E>I<00000E003E1100E1 A301C1C20381E00780E00701E00F01E00F01E00F01E00703C007038007870004FC000800 000800001800001C00000FFF000FFFC007FFE01800F0300030600030C00030C00030C000 306000603000C01C070007FC00181F809417>I<00E00007E00001E00000E00000E00001 C00001C00001C00001C00001C00001C000038000038F800390E003A0E003C06003806007 80E00700E00700E00700E00700E00700E00E01C00E01C00E01C00E01C00E01C00E01C01C 03801E03C0FFCFF815207E9F19>I<01C003E003E003E001C00000000000000000000000 0003801F800780038003800700070007000700070007000E000E000E000E000E000E001C 001E00FF800B1F7F9E0C>I<00E007E001E000E000E001C001C001C001C001C001C00380 038003800380038003800700070007000700070007000E000E000E000E000E000E001C00 1E00FFC00B207F9F0C>108 D<038F801F90E007A0E003C0600380600780E00700E00700 E00700E00700E00700E00E01C00E01C00E01C00E01C00E01C00E01C01C03801E03C0FFCF F815147E9319>110 D<00FC000387000E01801C00C03800E03800E07000F0F000F0F000 F0F000F0F000F0E001E0E001E0E001C0E003C0F00380700700380E001C1C0007E0001414 7D9317>I<00E3E007EC3800F01C00E01E00E00E01C00E01C00F01C00F01C00F01C00F01 C00F03801E03801E03801C03803C0380380380700740E00721C0071F0007000007000007 00000E00000E00000E00000E00001E0000FFC000181D809319>I<038E001FB38007C780 03C7800383000780000700000700000700000700000700000E00000E00000E00000E0000 0E00000E00001C00001E0000FFE00011147E9312>114 D<01F2060E0806180618023804 38001E001FE00FF003F8003C401C400C400C600C6018E010D0608FC00F147E9312>I<00 80010001000100030007000F001E00FFF80E000E000E000E001C001C001C001C001C001C 00380038203820382038203840384018800F000D1C7C9B12>I<1C0380FC1F803C07801C 03801C0380380700380700380700380700380700380700700E00700E00700E00700E0070 1E00701E00703C00305E001F9FC012147B9319>III<1FF0FF03C0 7801C06001C04000E08000E180007300007600003C00003C00001C00002E00004E000087 000107000203800603800C01C03E03E0FF07FC18147F9318>I<0FF83F8001E00E0001C0 0C0001C0080000E0180000E0100000E0200000E0200000F0400000704000007080000070 80000071000000390000003A0000003E0000003C00000038000000180000001000000010 000000200000002000000040000070C00000F0800000F1000000E20000007C000000191D 809318>I E /Fo 60 122 df<3C007F00FF80FF80FFC0FFC0FFC07FC03EC000C000C001 80018001800300030006000E001C00380030000A157BA913>39 D<00030006001C003800 7800F000E001E003C003C007800F800F801F001F001F003E003E003E007E007E007E007C 00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC00FC007C007E007E007E 003E003E003E001F001F001F000F800F80078003C003C001E000E000F000780038001C00 060003103C7BAC1A>II45 D<1C007F007F00FF80FF80FF807F007F001C0009097B8813 >I<003F800001FFF00007E0FC000FC07E001F803F001F001F003F001F803E000F807E00 0FC07E000FC07E000FC07E000FC0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE00 0FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE0FE00 0FE07E000FC07E000FC07E000FC07E000FC03F001F803F001F801F001F001F803F000FC0 7E0007E0FC0001FFF000003F80001B277DA622>48 D<000E00001E00007E0007FE00FFFE 00FFFE00F8FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE 0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE0000FE 0000FE0000FE0000FE0000FE0000FE0000FE0000FE007FFFFE7FFFFE7FFFFE17277BA622 >I<00FF800007FFF0000FFFFC001E03FE003800FF807C003F80FE003FC0FF001FC0FF00 1FE0FF000FE0FF000FE07E000FE03C001FE000001FE000001FC000001FC000003F800000 3F0000007E000000FC000000F8000001F0000003E00000078000000F0000001E0000003C 00E0007000E000E000E001C001C0038001C0060001C00FFFFFC01FFFFFC03FFFFFC07FFF FFC0FFFFFF80FFFFFF80FFFFFF801B277DA622>I<007F800003FFF00007FFFC000F80FE 001F007F003F807F003F803F803F803F803F803F801F803F801F003F8000007F0000007F 0000007E000000FC000001F8000007F00000FFC00000FFC0000001F80000007E0000003F 0000003F8000001FC000001FC000001FE000001FE03C001FE07E001FE0FF001FE0FF001F E0FF001FC0FF003FC0FE003F807C007F003F00FE001FFFFC0007FFF00000FF80001B277D A622>I<00000E0000001E0000003E0000007E000000FE000000FE000001FE000003FE00 00077E00000E7E00000E7E00001C7E0000387E0000707E0000E07E0000E07E0001C07E00 03807E0007007E000E007E000E007E001C007E0038007E0070007E00E0007E00FFFFFFF8 FFFFFFF8FFFFFFF80000FE000000FE000000FE000000FE000000FE000000FE000000FE00 0000FE00007FFFF8007FFFF8007FFFF81D277EA622>I<180003001F801F001FFFFE001F FFFC001FFFF8001FFFF0001FFFC0001FFF00001C0000001C0000001C0000001C0000001C 0000001C0000001C0000001C7FC0001DFFF8001F80FC001E003F0008003F0000001F8000 001FC000001FC000001FE000001FE018001FE07C001FE0FE001FE0FE001FE0FE001FE0FE 001FC0FC001FC078003F8078003F803C007F001F01FE000FFFFC0003FFF00000FF80001B 277DA622>I<0007F800003FFE0000FFFF0001FC078003F00FC007C01FC00F801FC01F80 1FC01F001FC03F000F803F0000007E0000007E0000007E000000FE020000FE1FF000FE3F FC00FE603E00FE801F00FF801F80FF000FC0FF000FC0FE000FE0FE000FE0FE000FE0FE00 0FE07E000FE07E000FE07E000FE07E000FE03E000FE03F000FC01F000FC01F001F800F80 1F0007E07E0003FFFC0001FFF800003FC0001B277DA622>I<380000003E0000003FFFFF F03FFFFFF03FFFFFF07FFFFFE07FFFFFC07FFFFF807FFFFF0070000E0070000E0070001C 00E0003800E0007000E000E0000001E0000001C000000380000007800000070000000F00 00001F0000001E0000003E0000003E0000007E0000007C0000007C000000FC000000FC00 0000FC000000FC000001FC000001FC000001FC000001FC000001FC000001FC000001FC00 0000F80000007000001C297CA822>I<003FC00001FFF00003FFFC0007C07E000F003F00 1E001F001E000F803E000F803E000F803F000F803F800F803FC00F803FF01F001FFC1E00 1FFE3C000FFFF8000FFFE00007FFF80001FFFC0001FFFE0007FFFF000F0FFF801E03FFC0 3E01FFC07C007FE07C001FE0F8000FE0F80007E0F80003E0F80003E0F80003E0F80003C0 7C0003C07E0007803F000F001FC03F000FFFFC0003FFF800007FC0001B277DA622>I<00 7F800001FFF00007FFF8000FC0FC001F803E003F001F007E001F807E001F807E000F80FE 000FC0FE000FC0FE000FC0FE000FE0FE000FE0FE000FE0FE000FE0FE000FE07E001FE07E 001FE03F003FE01F002FE00F80CFE007FF8FE001FF0FE000080FE000000FC000000FC000 000FC000001F803E001F807F001F807F003F007F003E007F007E007E00FC003E03F8001F FFE0000FFF800001FE00001B277DA622>I<01FF000FFFE01E03F03801F87800FCFC00FE FE00FEFE00FEFE00FE7C00FE3800FC0001FC0003F80007E0000FC0000F80001E00001E00 003C00003800003800007000007000007000007000007000007000007000000000000000 00000000000000000000700000F80001FC0003FE0003FE0003FE0001FC0000F800007000 172A7CA920>63 D<00000780000000000780000000000FC0000000000FC0000000000FC0 000000001FE0000000001FE0000000003FF0000000003FF0000000003FF00000000077F8 0000000077F800000000F7FC00000000E3FC00000000E3FC00000001C1FE00000001C1FE 00000003C1FF0000000380FF0000000380FF00000007007F80000007007F8000000F007F C000000E003FC000000E003FC000001C001FE000001C001FE000003FFFFFF000003FFFFF F000003FFFFFF00000700007F80000700007F80000F00007FC0000E00003FC0000E00003 FC0001C00001FE0001C00001FE0003C00001FF00FFFE003FFFFCFFFE003FFFFCFFFE003F FFFC2E297EA833>65 DI<00007FE0030007FFFC07001FFFFF0F007FF00F9F00FF0001FF01FC0000FF 03F800007F07F000003F0FE000001F1FC000001F1FC000000F3F8000000F3F800000077F 800000077F800000077F00000000FF00000000FF00000000FF00000000FF00000000FF00 000000FF00000000FF00000000FF00000000FF000000007F000000007F800000007F8000 00073F800000073F800000071FC00000071FC000000E0FE000000E07F000001C03F80000 3C01FC00007800FF0001F0007FF007C0001FFFFF800007FFFE0000007FF00028297CA831 >IIII<00007FE003 000007FFFC0700001FFFFF0F00007FF00F9F0000FF0001FF0001FC0000FF0003F800007F 0007F000003F000FE000001F001FC000001F001FC000000F003F8000000F003F80000007 007F80000007007F80000007007F0000000000FF0000000000FF0000000000FF00000000 00FF0000000000FF0000000000FF0000000000FF0000000000FF0000000000FF0000FFFF F87F0000FFFFF87F8000FFFFF87F800000FF003F800000FF003F800000FF001FC00000FF 001FC00000FF000FE00000FF0007F00000FF0003F80000FF0001FC0000FF0000FF0001FF 00007FF007FF00001FFFFF9F000007FFFE0F0000007FF003002D297CA835>III<00FFFFF800FFFFF800FFFFF80000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF0000 00FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF001800FF007E 00FF00FF00FF00FF00FF00FF00FF00FF00FE007E01FC007C01F8003E07F0000FFFE00003 FF00001D297EA823>I76 DII<0000FFC00000000FFFFC0000003F807F00 0000FE001FC00001F80007E00003F00003F00007E00001F8000FE00001FC001FC00000FE 001FC00000FE003F8000007F003F8000007F007F8000007F807F0000003F807F0000003F 807F0000003F80FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003F C0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC0FF0000003FC07F0000003F 807F8000007F807F8000007F803F8000007F003F8000007F001FC00000FE001FC00000FE 000FE00001FC0007F00003F80003F80007F00001FC000FE00000FE001FC000003FC0FF00 00000FFFFC00000000FFC000002A297CA833>II82 D<00FF00C003FFE1C00FFFF9C01F80FFC03F00 3FC03E000FC07C0007C07C0007C0FC0003C0FC0003C0FC0001C0FE0001C0FE0001C0FF00 0000FFC000007FFC00007FFFE0003FFFF8001FFFFE001FFFFF0007FFFF8003FFFFC000FF FFC0000FFFE000007FE000001FF000000FF0000007F0E00003F0E00003F0E00003F0E000 03F0F00003E0F00003E0F80007E0FC0007C0FF000F80FFE01F80E3FFFF00E1FFFC00C01F F0001C297CA825>I85 DII<03FF80000FFFF000 1F01FC003F80FE003F807F003F803F003F803F801F003F8000003F8000003F8000003F80 00003F80003FFF8001FC3F800FE03F801F803F803F003F807E003F80FC003F80FC003F80 FC003F80FC003F80FC005F807E00DF803F839FFC1FFE0FFC03F803FC1E1B7E9A21>97 DI<003FF000 01FFFC0003F03E000FC07F001F807F003F007F003F007F007F003E007E0000007E000000 FE000000FE000000FE000000FE000000FE000000FE000000FE0000007E0000007E000000 7F0000003F0003803F8003801F8007000FE00E0003F83C0001FFF800003FC000191B7E9A 1E>I<00007FF000007FF000007FF0000007F0000007F0000007F0000007F0000007F000 0007F0000007F0000007F0000007F0000007F0000007F0000007F0003F87F001FFF7F007 F03FF00FC00FF01F8007F03F0007F03F0007F07E0007F07E0007F07E0007F0FE0007F0FE 0007F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F07E0007F07E0007F03F 0007F03F0007F01F800FF00FC01FF007E07FFF01FFE7FF007F87FF202A7EA925>I<003F C00001FFF00003E07C000F803E001F801F001F001F003F000F807E000F807E000FC07E00 0FC0FE0007C0FE0007C0FFFFFFC0FFFFFFC0FE000000FE000000FE0000007E0000007E00 00007F0000003F0001C01F0001C00F80038007C0070003F01E0000FFFC00003FE0001A1B 7E9A1F>I<0007F8003FFC007E3E01FC7F03F87F03F07F07F07F07F03E07F00007F00007 F00007F00007F00007F00007F000FFFFC0FFFFC0FFFFC007F00007F00007F00007F00007 F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007F00007 F00007F00007F00007F00007F0007FFF807FFF807FFF80182A7EA915>I<007F80F001FF E3F807C0FE1C0F807C7C1F003E7C1F003E103F003F003F003F003F003F003F003F003F00 3F003F003F001F003E001F003E000F807C0007C0F80005FFE0000C7F8000180000001C00 00001C0000001E0000001FFFF8001FFFFF000FFFFFC007FFFFE003FFFFF00FFFFFF03E00 07F07C0001F8F80000F8F80000F8F80000F8F80000F87C0001F07C0001F03F0007E00FC0 1F8007FFFF00007FF0001E287E9A22>II<07000FC01FE03FE03FE03FE01FE00FC00700000000000000 0000000000000000FFE0FFE0FFE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE00FE0 0FE00FE00FE00FE00FE00FE00FE00FE00FE00FE0FFFEFFFEFFFE0F2B7EAA12>I107 DII< FFC07E00FFC1FF80FFC30FC00FC40FE00FC807E00FD807F00FD007F00FD007F00FE007F0 0FE007F00FE007F00FE007F00FE007F00FE007F00FE007F00FE007F00FE007F00FE007F0 0FE007F00FE007F00FE007F00FE007F00FE007F00FE007F0FFFE3FFFFFFE3FFFFFFE3FFF 201B7D9A25>I<003FE00001FFFC0003F07E000FC01F801F800FC03F0007E03F0007E07E 0003F07E0003F07E0003F0FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE0003F8FE 0003F8FE0003F87E0003F07E0003F03F0007E03F0007E01F800FC00FC01F8007F07F0001 FFFC00003FE0001D1B7E9A22>II<003F80 7001FFE0F003F071F00FC019F01F800FF03F800FF03F0007F07F0007F07F0007F07E0007 F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F0FE0007F07F0007 F07F0007F03F0007F03F8007F01F800FF00FC01FF007F077F001FFE7F0007F87F0000007 F0000007F0000007F0000007F0000007F0000007F0000007F0000007F0000007F000007F FF00007FFF00007FFF20277E9A23>II<03FE300F FFF03E03F07800F07000F0F00070F00070F80070FE0000FFE0007FFF007FFFC03FFFE01F FFF007FFF800FFF80007FC0000FCE0007CE0003CF0003CF00038F80038FC0070FF01E0E7 FFC0C1FF00161B7E9A1B>I<00700000700000700000700000F00000F00000F00001F000 03F00003F00007F0001FFFE0FFFFE0FFFFE007F00007F00007F00007F00007F00007F000 07F00007F00007F00007F00007F00007F00007F00007F07007F07007F07007F07007F070 07F07007F07003F0E001F8C000FFC0003F0014267FA51A>IIIIII E /Fp 79 123 df<001F83E000F06E3001C0 78780380F8780300F0300700700007007000070070000700700007007000070070000700 7000FFFFFF80070070000700700007007000070070000700700007007000070070000700 700007007000070070000700700007007000070070000700700007007000070070000700 7000070070007FE3FF001D20809F1B>11 D<003F0000E0C001C0C00381E00701E00701E0 070000070000070000070000070000070000FFFFE00700E00700E00700E00700E00700E0 0700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E00700E0 0700E07FC3FE1720809F19>I<001F81F80000F04F040001C07C06000380F80F000300F0 0F000700F00F000700700000070070000007007000000700700000070070000007007000 00FFFFFFFF00070070070007007007000700700700070070070007007007000700700700 070070070007007007000700700700070070070007007007000700700700070070070007 0070070007007007000700700700070070070007007007007FE3FE3FF02420809F26>14 D<70F8F8F8F8F8F8F8707070707070707070702020202020000000000070F8F8F8700521 7CA00D>33 D<7038F87CFC7EFC7E743A0402040204020804080410081008201040200F0E 7E9F17>I<0080008007E00C981084208260824081C087C08FC08FC086E080F08078803F 803FE01FF807FC00FE009E008E00870087F083F083F0838083808240864084208818B007 C000800080008010257DA117>36 D<70F8FCFC74040404080810102040060E7C9F0D>39 D<0020004000800100020006000C000C00180018003000300030007000600060006000E0 00E000E000E000E000E000E000E000E000E000E000E00060006000600070003000300030 00180018000C000C000600020001000080004000200B2E7DA112>I<8000400020001000 08000C00060006000300030001800180018001C000C000C000C000E000E000E000E000E0 00E000E000E000E000E000E000E000C000C000C001C00180018001800300030006000600 0C00080010002000400080000B2E7DA112>I<70F8FCFC74040404080810102040060E7C 840D>44 DI<70F8F8F87005057C840D>I<000100030003000600 060006000C000C000C00180018001800300030003000600060006000C000C000C0018001 8001800300030003000600060006000C000C000C00180018001800300030003000600060 006000C000C000C000102D7DA117>I<03F0000E1C001C0E001806003807007003807003 80700380700380F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003C0F003 C0F003C0F003C0F003C07003807003807003807807803807001806001C0E000E1C0003F0 00121F7E9D17>I<018003800F80F3800380038003800380038003800380038003800380 0380038003800380038003800380038003800380038003800380038007C0FFFE0F1E7C9D 17>I<03F0000C1C00100E00200700400780800780F007C0F803C0F803C0F803C02007C0 0007C0000780000780000F00000E00001C0000380000700000600000C000018000030000 0600400C00401800401000803FFF807FFF80FFFF80121E7E9D17>I<03F0000C1C00100E 00200F00780F80780780780780380F80000F80000F00000F00000E00001C0000380003F0 00003C00000E00000F000007800007800007C02007C0F807C0F807C0F807C0F007804007 80400F00200E001C3C0003F000121F7E9D17>I<000600000600000E00000E00001E0000 2E00002E00004E00008E00008E00010E00020E00020E00040E00080E00080E00100E0020 0E00200E00400E00C00E00FFFFF0000E00000E00000E00000E00000E00000E00000E0000 FFE0141E7F9D17>I<1803001FFE001FFC001FF8001FE000100000100000100000100000 10000010000011F000161C00180E001007001007800003800003800003C00003C00003C0 7003C0F003C0F003C0E00380400380400700200600100E000C380003E000121F7E9D17> I<007C000182000701000E03800C07801C0780380300380000780000700000700000F1F0 00F21C00F40600F80700F80380F80380F003C0F003C0F003C0F003C0F003C07003C07003 C07003803803803807001807000C0E00061C0001F000121F7E9D17>I<4000007FFFC07F FF807FFF8040010080020080020080040000080000080000100000200000200000400000 400000C00000C00001C00001800003800003800003800003800007800007800007800007 8000078000078000078000030000121F7D9D17>I<03F0000C0C00100600300300200180 6001806001806001807001807803003E03003F06001FC8000FF00003F80007FC000C7E00 103F00300F806003804001C0C001C0C000C0C000C0C000C0C00080600180200100100200 0C0C0003F000121F7E9D17>I<03F0000E18001C0C00380600380700700700700380F003 80F00380F003C0F003C0F003C0F003C0F003C07007C07007C03807C0180BC00E13C003E3 C0000380000380000380000700300700780600780E00700C002018001070000FC000121F 7E9D17>I<70F8F8F8700000000000000000000070F8F8F87005147C930D>I<70F8F8F870 0000000000000000000070F0F8F878080808101010202040051D7C930D>I<0FC0307040 384038E03CF03CF03C603C0038007000E000C00180018001000300020002000200020002 0002000000000000000000000007000F800F800F8007000E207D9F15>63 D<000100000003800000038000000380000007C0000007C0000007C0000009E0000009E0 000009E0000010F0000010F0000010F00000207800002078000020780000403C0000403C 0000403C0000801E0000801E0000FFFE0001000F0001000F0001000F0002000780020007 8002000780040003C00E0003C01F0007E0FFC03FFE1F207F9F22>65 DI<000FC040007030C001C009C0 038005C0070003C00E0001C01E0000C01C0000C03C0000C07C0000407C00004078000040 F8000000F8000000F8000000F8000000F8000000F8000000F8000000F8000000F8000000 780000007C0000407C0000403C0000401C0000401E0000800E0000800700010003800200 01C0040000703800000FC0001A217D9F21>IIII<000FE0200078186000E004E0038002E0070001E0 0F0000E01E0000601E0000603C0000603C0000207C00002078000020F8000000F8000000 F8000000F8000000F8000000F8000000F8000000F8007FFCF80003E0780001E07C0001E0 3C0001E03C0001E01E0001E01E0001E00F0001E0070001E0038002E000E0046000781820 000FE0001E217D9F24>III<0FFFC0007C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C00003C 00003C00003C00003C00003C00003C00003C00003C00003C00003C00203C00F83C00F83C 00F83C00F0380040780040700030E0000F800012207E9E17>IIIII<001F800000F0F00001C0380007801E000F000F000E0007001E00 07803C0003C03C0003C07C0003E0780001E0780001E0F80001F0F80001F0F80001F0F800 01F0F80001F0F80001F0F80001F0F80001F0F80001F0780001E07C0003E07C0003E03C00 03C03C0003C01E0007800E0007000F000F0007801E0001C0380000F0F000001F80001C21 7D9F23>II<001F800000F0F000 01C0380007801E000F000F000E0007001E0007803C0003C03C0003C07C0003E07C0003E0 780001E0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0F80001F0 F80001F0780001E0780001E07C0003E03C0003C03C0F03C01E1087800E2047000F204F00 07A03E0001E0380000F0F010001FB01000003010000038300000387000003FF000001FE0 00001FE000000FC0000007801C297D9F23>II<07E0800C1980100780300380600180600180E00180E00080E000 80E00080F00000F000007800007F00003FF0001FFC000FFE0003FF00001F800007800003 C00003C00001C08001C08001C08001C08001C0C00180C00380E00300F00600CE0C0081F8 0012217D9F19>I<7FFFFFE0780F01E0600F0060400F0020400F0020C00F0030800F0010 800F0010800F0010800F0010000F0000000F0000000F0000000F0000000F0000000F0000 000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000000F0000 000F0000000F0000000F0000000F0000001F800007FFFE001C1F7E9E21>IIII<7FF83FF8 0FE00FC007C0070003C0020001E0040001F00C0000F0080000781000007C1000003C2000 003E4000001E4000000F8000000F8000000780000003C0000007E0000005E0000009F000 0018F8000010780000207C0000603C0000401E0000801F0001800F0001000780020007C0 070003C01F8007E0FFE01FFE1F1F7F9E22>II<080410082010201040204020804080408040B85CFC7EFC7E7C3E381C0F0E 7B9F17>92 D<081020204040808080B8FCFC7C38060E7D9F0D>96 D<1FE000303000781800781C00300E00000E00000E00000E0000FE00078E001E0E00380E 00780E00F00E10F00E10F00E10F01E10781E103867200F83C014147E9317>I<0E0000FE 00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E00000E3E000E C3800F01C00F00E00E00E00E00700E00700E00780E00780E00780E00780E00780E00780E 00700E00700E00E00F00E00D01C00CC300083E0015207F9F19>I<03F80E0C1C1E381E38 0C70007000F000F000F000F000F000F00070007000380138011C020E0C03F010147E9314 >I<000380003F8000038000038000038000038000038000038000038000038000038000 038003E380061B801C0780380380380380700380700380F00380F00380F00380F00380F0 0380F003807003807003803803803807801C07800E1B8003E3F815207E9F19>I<03F000 0E1C001C0E00380700380700700700700380F00380F00380FFFF80F00000F00000F00000 7000007000003800801800800C010007060001F80011147F9314>I<007C00C6018F038F 07060700070007000700070007000700FFF0070007000700070007000700070007000700 0700070007000700070007000700070007007FF01020809F0E>I<0000E003E3300E3C30 1C1C30380E00780F00780F00780F00780F00780F00380E001C1C001E380033E000200000 2000003000003000003FFE001FFF800FFFC03001E0600070C00030C00030C00030C00030 6000603000C01C038003FC00141F7F9417>I<0E0000FE00000E00000E00000E00000E00 000E00000E00000E00000E00000E00000E00000E3E000E43000E81800F01C00F01C00E01 C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01 C00E01C0FFE7FC16207F9F19>I<1C001E003E001E001C00000000000000000000000000 0E007E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E00 0E00FFC00A1F809E0C>I<00E001F001F001F000E0000000000000000000000000007007 F000F0007000700070007000700070007000700070007000700070007000700070007000 7000700070007000706070F060F0C061803F000C28829E0E>I<0E0000FE00000E00000E 00000E00000E00000E00000E00000E00000E00000E00000E00000E0FF00E03C00E03000E 02000E04000E08000E10000E30000E70000EF8000F38000E1C000E1E000E0E000E07000E 07800E03800E03C00E03E0FFCFF815207F9F18>I<0E00FE000E000E000E000E000E000E 000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E 000E000E000E000E000E00FFE00B20809F0C>I<0E1F01F000FE618618000E81C81C000F 00F00E000F00F00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00 E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E00E000E00E0 0E000E00E00E00FFE7FE7FE023147F9326>I<0E3E00FE43000E81800F01C00F01C00E01 C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01 C00E01C0FFE7FC16147F9319>I<01F800070E001C03803801C03801C07000E07000E0F0 00F0F000F0F000F0F000F0F000F0F000F07000E07000E03801C03801C01C0380070E0001 F80014147F9317>I<0E3E00FEC3800F01C00F00E00E00E00E00F00E00700E00780E0078 0E00780E00780E00780E00780E00700E00F00E00E00F01E00F01C00EC3000E3E000E0000 0E00000E00000E00000E00000E00000E00000E0000FFE000151D7F9319>I<03E0800619 801C05803C0780380380780380700380F00380F00380F00380F00380F00380F003807003 807803803803803807801C0B800E138003E3800003800003800003800003800003800003 80000380000380003FF8151D7E9318>I<0E78FE8C0F1E0F1E0F0C0E000E000E000E000E 000E000E000E000E000E000E000E000E000E00FFE00F147F9312>I<1F9030704030C010 C010C010E00078007F803FE00FF00070803880188018C018C018E030D0608F800D147E93 12>I<020002000200060006000E000E003E00FFF80E000E000E000E000E000E000E000E 000E000E000E000E080E080E080E080E080610031001E00D1C7F9B12>I<0E01C0FE1FC0 0E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C00E01C0 0E01C00E01C00E03C00603C0030DC001F1FC16147F9319>III<7F C3FC0F01E00701C007018003810001C20000E40000EC00007800003800003C00007C0000 4E000087000107000303800201C00601E01E01E0FF07FE1714809318>II<3FFF380E200E201C40384078407000E001E001C0 0380078007010E011E011C0338027006700EFFFE10147F9314>I E /Fq 9 119 df<00000001E00000000000000003F00000000000000003F00000000000 000007F80000000000000007F80000000000000007F8000000000000000FFC0000000000 00000FFC000000000000001FFE000000000000001FFE000000000000001FFE0000000000 00003FFF000000000000003FFF000000000000007FFF800000000000007BFF8000000000 00007BFF80000000000000F3FFC0000000000000F1FFC0000000000001F1FFE000000000 0001E0FFE0000000000001E0FFE0000000000003C0FFF0000000000003C07FF000000000 0007C07FF8000000000007803FF8000000000007803FF800000000000F003FFC00000000 000F001FFC00000000001F001FFE00000000001E000FFE00000000001E000FFE00000000 003C000FFF00000000003C0007FF00000000007C0007FF8000000000780003FF80000000 00780003FF8000000000F00003FFC000000000F00001FFC000000001FFFFFFFFE0000000 01FFFFFFFFE000000003FFFFFFFFF000000003FFFFFFFFF000000003C000007FF0000000 07C000007FF8000000078000003FF80000000F8000003FFC0000000F0000003FFC000000 0F0000001FFC0000001F0000001FFE0000001E0000000FFE0000003E0000000FFF000000 3C00000007FF0000003C00000007FF0000007C00000007FF800000FC00000003FF8000FF FFF80003FFFFFFC0FFFFF80003FFFFFFC0FFFFF80003FFFFFFC0FFFFF80003FFFFFFC042 3B7DBA49>65 D70 D<0000007FF800000000000FFFFFC0000000007FFFFFF800000001FFE01FFE00000007FF 0003FF8000000FFC0000FFC000001FF000003FE000007FE000001FF80000FFC000000FFC 0001FF80000007FE0001FF00000003FE0003FF00000003FF0007FE00000001FF800FFE00 000001FFC00FFC00000000FFC01FFC00000000FFE01FFC00000000FFE03FF8000000007F F03FF8000000007FF03FF8000000007FF07FF8000000007FF87FF0000000003FF87FF000 0000003FF87FF0000000003FF87FF0000000003FF8FFF0000000003FFCFFF0000000003F FCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF000 0000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003F FCFFF0000000003FFC7FF0000000003FF87FF8000000007FF87FF8000000007FF87FF800 0000007FF83FF8000000007FF03FF8000000007FF03FFC00000000FFF01FFC00000000FF E01FFC00000000FFE00FFE00000001FFC00FFE00000001FFC007FF00000003FF8003FF00 000003FF0003FF80000007FF0001FF80000007FE0000FFC000000FFC00007FE000001FF8 00003FF800007FF000000FFC0000FFC0000007FF0003FF80000001FFE01FFE000000007F FFFFF8000000000FFFFFC000000000007FF80000003E3D7BBB49>79 D<0000007FF800000000000FFFFFC0000000007FFFFFF800000001FFE01FFE00000007FF 0003FF8000000FFC0000FFC000001FF000003FE000007FE000001FF80000FFC000000FFC 0001FF80000007FE0001FF80000007FE0003FF00000003FF0007FE00000001FF800FFE00 000001FFC00FFC00000000FFC01FFC00000000FFE01FFC00000000FFE03FF8000000007F F03FF8000000007FF03FF8000000007FF07FF8000000007FF87FF8000000007FF87FF000 0000003FF87FF0000000003FF87FF0000000003FF8FFF0000000003FFCFFF0000000003F FCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF000 0000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003FFCFFF0000000003F FCFFF0000000003FFC7FF0000000003FF87FF0000000003FF87FF8000000007FF87FF800 0000007FF83FF8000000007FF03FF8000000007FF03FF8000000007FF01FFC00000000FF E01FFC00000000FFE00FFC00000000FFC00FFE000FC001FFC007FE003FF001FF8003FF00 7FF803FF0003FF00F03C03FF0001FF80E01E07FE0000FFC1C00F0FFC00007FE1C00F9FF8 00003FF1C007BFF000000FFDC007FFC0000007FFE007FF80000001FFF01FFE000000007F FFFFF8000400000FFFFFF0000E0000007FFBF8000E0000000003FC000E0000000001FE00 1E0000000001FF003E0000000001FF80FE0000000000FFFFFC0000000000FFFFFC000000 0000FFFFFC00000000007FFFFC00000000007FFFF800000000003FFFF800000000003FFF F000000000001FFFE000000000000FFFE0000000000007FFC0000000000003FF00000000 000000FC003F4D7BBB49>81 D<003FFE00000001FFFFE0000007FFFFF800000FE007FC00 000FF001FE00001FF800FF00001FF8007F80001FF8007FC0001FF8003FC0000FF0003FE0 0007E0003FE00003C0003FE0000000003FE0000000003FE0000000003FE0000000003FE0 000000FFFFE000001FFFFFE000007FF83FE00003FF803FE00007FC003FE0000FF0003FE0 001FE0003FE0003FE0003FE0007FC0003FE0007FC0003FE000FF80003FE000FF80003FE0 00FF80003FE000FF80003FE000FF80007FE0007FC0007FE0007FC000DFE0003FE0039FF0 001FF80F0FFFE007FFFE0FFFE001FFF807FFE0003FE000FFE02B267DA52F>97 D<0001FFF000000FFFFE00003FFFFF8000FF801FC001FE003FC003FC007FE007F8007FE0 0FF0007FE01FF0007FE03FE0003FC03FE0001F807FE0000F007FC00000007FC00000007F C0000000FFC0000000FFC0000000FFC0000000FFC0000000FFC0000000FFC0000000FFC0 000000FFC00000007FC00000007FC00000007FE00000007FE00000003FE00000003FF000 00F01FF00000F00FF80001E007F80001E003FC0003C001FF000F8000FFC03F00003FFFFE 00000FFFF8000001FFC00024267DA52B>99 D<0001FF8000000FFFF000003FFFFC0000FF 81FE0003FE007F8007F8003F800FF8001FC00FF0000FE01FE0000FE03FE0000FF03FE000 07F07FC00007F07FC00007F87FC00007F8FFC00007F8FFC00007F8FFFFFFFFF8FFFFFFFF F8FFFFFFFFF8FFC0000000FFC0000000FFC0000000FFC00000007FC00000007FC0000000 7FC00000003FE00000003FE00000781FE00000781FF00000780FF00000F007F80001F003 FC0003E001FE000FC000FFC07F80003FFFFE00000FFFF8000000FFC00025267DA52C> 101 D<000F0000000F0000000F0000000F0000000F0000001F0000001F0000001F000000 1F0000003F0000003F0000007F0000007F000000FF000001FF000003FF000007FF00001F FFFFF0FFFFFFF0FFFFFFF0FFFFFFF001FF000001FF000001FF000001FF000001FF000001 FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF000001FF000001 FF000001FF000001FF000001FF000001FF000001FF003C01FF003C01FF003C01FF003C01 FF003C01FF003C01FF003C01FF003C00FF007800FF8078007F80F0003FC1E0001FFFC000 0FFF800001FE001E377EB626>116 D118 D E end %%EndProlog %%BeginSetup %%Feature: *Resolution 300dpi TeXDict begin %%EndSetup %%Page: 1 1 1 0 bop 0 692 a Fq(Octa)m(v)m(e)33 b(F)-11 b(A)m(Q)p 0 742 1950 17 v 1133 790 a Fp(F)l(requen)o(tly)16 b(ask)o(ed)f (questions)g(ab)q(out)g(Octa)o(v)o(e)1597 844 y(Decem)o(b)q(er)h(1,)e (1994)0 2545 y Fo(John)22 b(W.)h(Eaton)p 0 2570 1950 9 v eop %%Page: 2 2 2 1 bop eop %%Page: 1 3 1 2 bop 0 -58 a Fp(Chapter)15 b(2:)k(What's)c(new)g(in)h(v)o(ersion)f (1.1.0)f(of)h(Octa)o(v)o(e)937 b(1)62 183 y(This)16 b(is)g(a)f(list)h (of)e(frequen)o(tly)i(ask)o(ed)f(questions)h(\(F)-5 b(A)o(Q\))14 b(for)h(Octa)o(v)o(e)g(users.)62 270 y(Some)k(information)h(in)g(this)f (F)-5 b(A)o(Q)19 b(w)o(as)f(dev)o(elop)q(ed)j(for)d(earlier)i(v)o (ersions)g(of)e(Octa)o(v)o(e)h(and)g(ma)o(y)g(no)o(w)f(b)q(e)0 333 y(obsolete.)62 420 y(I'm)11 b(lo)q(oking)h(for)e(new)i(questions)f (\()p Fn(with)g Fp(answ)o(ers\),)g(b)q(etter)g(answ)o(ers,)f(or)h(b)q (oth.)19 b(Please)11 b(send)h(suggestions)f(to)0 482 y(bug-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)19 b(If)13 b(y)o(ou)f(ha)o(v)o(e)g(general)h(questions)g(ab)q(out)g(Octa)o (v)o(e,)f(or)g(need)i(help)g(for)e(something)0 544 y(that)i(is)i(not)f (co)o(v)o(ered)g(b)o(y)g(the)g(F)-5 b(A)o(Q,)15 b(please)h(use)g(the)f (help-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu)h(mailing)g(list.) 62 631 y(This)e(F)-5 b(A)o(Q)13 b(is)g(in)o(tended)i(to)d(supplemen)o (t,)i(not)f(replace,)h(the)f(Octa)o(v)o(e)g(man)o(ual.)19 b(Before)13 b(p)q(osting)h(a)e(question)0 693 y(to)j(the)g(hlp)q(e-o)q (cta)o(v)o(e)h(mailing)h(list,)e(y)o(ou)g(should)h(\014rst)f(c)o(hec)o (k)h(to)e(see)i(if)f(the)h(topic)f(is)h(co)o(v)o(ered)f(in)h(the)f(man) o(ual.)0 834 y Fl(1)41 b(What)16 b(is)e(Octa)n(v)n(e?)62 987 y Fp(Octa)o(v)o(e)g(is)h(a)g(high-lev)o(el)h(in)o(teractiv)o(e)f (language,)g(primarily)h(in)o(tended)g(for)d(n)o(umerical)j (computations)f(that)0 1049 y(is)h(mostly)f(compatible)h(with)g Fk(Ma)m(tlab)p Fp(.)717 1033 y Fj(1)62 1136 y Fp(Octa)o(v)o(e)k(can)h (do)g(arithmetic)g(for)f(real)h(and)g(complex)g(scalars)g(and)g (matrices,)g(solv)o(e)g(sets)f(of)h(nonlinear)0 1198 y(algebraic)d(equations,)f(in)o(tegrate)f(functions)i(o)o(v)o(er)e (\014nite)h(and)g(in\014nite)i(in)o(terv)m(als,)f(and)f(in)o(tegrate)f (systems)g(of)0 1261 y(ordinary)f(di\013eren)o(tial)i(and)e(di\013eren) o(tial-algebraic)j(equations.)62 1348 y(Octa)o(v)o(e)i(uses)g(the)g (GNU)g(readline)i(library)f(to)e(handle)j(reading)e(and)g(editing)i (input.)35 b(By)20 b(default,)i(the)0 1410 y(line)17 b(editing)f(commands)e(are)h(similar)h(to)e(the)h(cursor)g(mo)o(v)o (emen)o(t)e(commands)i(used)h(b)o(y)e(GNU)h(Emacs,)f(and)h(a)0 1472 y(vi-st)o(yle)i(line)g(editing)h(in)o(terface)e(is)g(also)g(a)o(v) m(ailable.)24 b(A)o(t)15 b(the)h(end)h(of)e(eac)o(h)h(session,)h(the)f (command)g(history)f(is)0 1534 y(sa)o(v)o(ed,)f(so)h(that)g(commands)g (en)o(tered)g(during)h(previous)g(sessions)g(are)f(not)f(lost.)62 1622 y(The)j(Octa)o(v)o(e)g(distribution)h(includes)h(a)d(200)p Fm(+)g Fp(page)h(T)l(exinfo)g(man)o(ual.)25 b(Access)17 b(to)f(the)h(complete)g(text)f(of)0 1684 y(the)f(man)o(ual)h(is)f(a)o (v)m(ailable)i(via)f(the)f(help)h(command)g(at)e(the)h(Octa)o(v)o(e)g (prompt.)62 1771 y(Tw)o(o)g(and)g(three)g(dimensional)i(plotting)f(is)g (fully)g(supp)q(orted)g(using)g(gn)o(uplot.)62 1858 y(The)21 b(underlying)i(n)o(umerical)f(solv)o(ers)f(are)f(curren)o(tly)i (standard)e(F)l(ortran)g(ones)g(lik)o(e)i(Lapac)o(k,)g(Linpac)o(k,)0 1920 y(Odepac)o(k,)17 b(the)f(Blas,)g(etc.,)g(pac)o(k)m(aged)g(in)h(a)f (library)h(of)f(C)p Fm(++)g Fp(classes.)23 b(If)16 b(p)q(ossible,)i (the)e(F)l(ortran)f(subroutines)0 1982 y(are)j(compiled)i(with)e(the)h (system's)e(F)l(ortran)g(compiler,)j(and)e(called)i(directly)g(from)d (the)h(C)p Fm(++)g Fp(functions.)30 b(If)0 2045 y(that's)14 b(not)h(p)q(ossible,)h(y)o(ou)f(can)h(still)g(compile)h(Octa)o(v)o(e)e (if)g(y)o(ou)g(ha)o(v)o(e)g(the)g(free)h(F)l(ortran)e(to)g(C)h (translator)f(f2c.)62 2132 y(Octa)o(v)o(e)19 b(is)g(also)g(free)g(soft) o(w)o(are;)g(y)o(ou)f(can)h(redistribute)h(it)f(and/or)g(mo)q(dify)g (it)g(under)h(the)f(terms)f(of)h(the)0 2194 y(GNU)c(General)h(Public)h (License)g(as)d(published)k(b)o(y)d(the)h(F)l(ree)f(Soft)o(w)o(are)f(F) l(oundation.)0 2335 y Fl(2)41 b(What's)16 b(new)f(in)f(v)n(ersion)g (1.1.0)j(of)e(Octa)n(v)n(e)62 2487 y Fp(The)k(long-a)o(w)o(aited)f(v)o (ersion)g(1.1.0)f(of)h(Octa)o(v)o(e)f(has)i(no)o(w)e(b)q(een)j (released.)29 b(Man)o(y)18 b(bugs)g(ha)o(v)o(e)g(b)q(een)h(\014xed)0 2550 y(and)c(lots)g(of)g(new)h(features)f(added.)20 b(Octa)o(v)o(e)15 b(is)h(no)o(w)e(m)o(uc)o(h)h(more)g(compatible)i(with)e Fk(Ma)m(tlab)p Fp(.)p 0 2614 600 2 v 21 2652 a Fj(1)62 2668 y Fk(Ma)m(tlab)h Fp(is)f(a)g(registered)h(trademark)e(of)h(The)g (MathW)l(orks,)f(Inc.)p eop %%Page: 2 4 2 3 bop 0 -58 a Fp(Chapter)15 b(3:)k(What)c(features)g(are)g(unique)h (to)f(Octa)o(v)o(e?)958 b(2)62 183 y(V)l(ersion)16 b(1.1.0)e(\014xes)h (man)o(y)g(bugs,)g(but)h(as)e(with)i(an)o(y)f(\\x.y)l(.0")f(release)i (there)f(will)i(b)q(e)f(a)f(few)g(glitc)o(hes.)21 b(Y)l(ou)0 246 y(can)c(exp)q(ect)g(a)f(1.1.1)f(shortly)l(.)24 b(Y)l(ou)17 b(can)f(help)i(con)o(tribute)f(to)f(the)h(qualit)o(y)g(of)f(Octa)o(v)o (e)g(b)o(y)g(trying)h(it)g(out)f(and)0 308 y(submitting)g(bug)f(rep)q (orts)g(where)h(y)o(ou)f(\014nd)g(them.)62 391 y(A)22 b(list)g(of)f(user-visible)j(c)o(hanges)d(in)h(recen)o(t)g(v)o(ersions) f(of)g(Octa)o(v)o(e)g(ma)o(y)g(b)q(e)h(found)f(in)i(the)e(\014le)h (NEWS,)0 453 y(distributed)17 b(in)f(b)q(oth)f(source)g(and)h(binary)g (releases)f(of)g(Octa)o(v)o(e.)0 578 y Fl(3)41 b(What)16 b(features)e(are)h(unique)f(to)i(Octa)n(v)n(e?)0 760 y Fo(3.1)33 b(Comm)n(and)12 b(and)k(v)l(ariable)h(name)c(completion)62 864 y Fp(T)o(yping)20 b(a)g(T)l(AB)g(c)o(haracter)f(\(ASCI)q(I)h(co)q (de)h(9\))e(on)h(the)f(command)h(line)h(causes)f(Octa)o(v)o(e)g(to)f (attempt)g(to)0 926 y(complete)f(v)m(ariable,)h(function,)g(and)f (\014le)g(names.)27 b(Octa)o(v)o(e)18 b(uses)f(the)h(text)f(b)q(efore)h (the)g(cursor)f(as)g(the)h(initial)0 989 y(p)q(ortion)d(of)g(the)h (name)f(to)f(complete.)62 1072 y(F)l(or)g(example,)i(if)f(y)o(ou)g(t)o (yp)q(e)f(`)p Fm(fu)p Fp(')g(follo)o(w)o(ed)h(b)o(y)g(T)l(AB)g(at)f (the)h(Octa)o(v)o(e)f(prompt,)h(Octa)o(v)o(e)f(will)i(complete)g(the)0 1134 y(rest)j(of)f(the)h(name)g(`)p Fm(function)p Fp(')f(on)h(the)g (command)g(line)h(\(unless)g(y)o(ou)f(ha)o(v)o(e)g(other)f(v)m (ariables)j(or)d(functions)0 1196 y(de\014ned)e(that)d(b)q(egin)j(with) e(the)h(c)o(haracters)e(`)p Fm(fu)p Fp('\).)18 b(If)d(there)f(is)h (more)f(than)g(one)g(p)q(ossible)i(completion,)f(Octa)o(v)o(e)0 1259 y(will)h(ring)f(the)f(terminal)h(b)q(ell)h(to)e(let)h(y)o(ou)f (kno)o(w)g(that)f(y)o(our)h(initial)i(sequence)g(of)e(c)o(haracters)f (is)i(not)f(enough)h(to)0 1321 y(sp)q(ecify)j(a)e(unique)h(name.)23 b(T)l(o)16 b(complete)h(the)g(name,)f(y)o(ou)g(ma)o(y)f(either)i(edit)g (the)g(initial)h(c)o(haracter)e(sequence)0 1383 y(\(usually)e(adding)g (more)f(c)o(haracters)g(un)o(til)h(completion)h(is)f(p)q(ossible\))g (or)f(t)o(yp)q(e)h(another)f(T)l(AB)g(to)g(cause)g(Octa)o(v)o(e)0 1445 y(to)i(displa)o(y)h(the)f(list)h(of)f(p)q(ossible)i(completions.)0 1578 y Fo(3.2)33 b(Comm)n(and)12 b(history)62 1682 y Fp(When)k(running)h(in)o(teractiv)o(ely)l(,)f(Octa)o(v)o(e)f(sa)o(v)o (es)g(the)g(commands)h(y)o(ou)f(t)o(yp)q(e)g(in)h(an)g(in)o(ternal)g (bu\013er)g(so)f(that)0 1744 y(y)o(ou)h(can)h(recall)h(and)f(edit)g (them.)24 b(Emacs)16 b(and)h(vi)g(editing)h(mo)q(des)f(are)g(a)o(v)m (ailable)h(with)f(Emacs)f(k)o(eybindings)0 1806 y(enabled)h(b)o(y)e (default.)62 1890 y(When)20 b(Octa)o(v)o(e)e(exits,)i(the)f(curren)o(t) g(command)f(history)h(is)h(sa)o(v)o(ed)e(to)g(the)h(\014le)h(`)p Fm(~/.octave_hist)p Fp(',)d(and)0 1952 y(eac)o(h)g(time)g(Octa)o(v)o(e) f(starts,)g(it)h(inserts)g(the)g(con)o(ten)o(ts)f(of)g(the)h(`)p Fm(~/.octave_hist)p Fp(')d(\014le)k(in)f(the)g(history)g(list)g(so)0 2014 y(that)d(it)i(is)g(easy)f(to)f(b)q(egin)j(w)o(orking)e(where)g(y)o (ou)g(left)g(o\013.)0 2147 y Fo(3.3)33 b(Data)14 b(structures)62 2251 y Fp(Octa)o(v)o(e)20 b(includes)i(a)d(limited)j(amoun)o(t)d(of)h (supp)q(ort)g(for)f(organizing)h(data)g(in)g(structures.)34 b(The)20 b(curren)o(t)0 2313 y(implemen)o(tation)g(uses)f(an)f(asso)q (ciativ)o(e)h(arra)o(y)e(with)i(indices)h(limited)h(to)d(strings,)g (but)h(the)g(syn)o(tax)e(is)i(more)0 2375 y(lik)o(e)d(C-st)o(yle)g (structures.)j(Here)d(are)f(some)f(examples)i(of)f(using)h(data)f (structures)f(in)j(Octa)o(v)o(e.)90 2458 y(Elemen)o(ts)f(of)e (structures)h(can)h(b)q(e)f(of)g(an)o(y)g(v)m(alue)h(t)o(yp)q(e.)210 2521 y Fm(octave:1>)23 b(x.a)g(=)h(1;)f(x.b)h(=)g([1,)f(2;)h(3,)f(4];)h (x.c)f(=)h("string";)210 2570 y(octave:2>)f(x.a)210 2620 y(x.a)g(=)h(1)210 2670 y(octave:3>)f(x.b)p eop %%Page: 3 5 3 4 bop 0 -58 a Fp(Chapter)15 b(3:)k(What)c(features)g(are)g(unique)h (to)f(Octa)o(v)o(e?)958 b(3)210 183 y Fm(x.b)23 b(=)258 283 y(1)47 b(2)258 333 y(3)g(4)210 432 y(octave:4>)23 b(x.c)210 482 y(x.c)g(=)h(string)90 573 y Fp(Structures)15 b(ma)o(y)g(b)q(e)h(copied.)210 652 y Fm(octave:1>)23 b(y)g(=)h(x)210 702 y(y)g(=)210 802 y()90 893 y Fp(Structure)15 b(elemen)o(ts)h(ma)o(y)f(reference)h(other)e (structures.)210 972 y Fm(octave:1>)23 b(x.b.d)g(=)h(3)210 1022 y(x.b.d)f(=)h(3)210 1072 y(octave:2>)f(x.b)210 1122 y(x.b)g(=)210 1221 y()210 1321 y(octave:3>)h(x.b.d)210 1371 y(x.b.d)g(=)h(3)90 1462 y Fp(F)l(unctions)16 b(can)f(return)g (structures.)210 1541 y Fm(octave:1>)23 b(function)f(y)i(=)g(f)g(\(x\)) 210 1591 y(>)g(y.re)f(=)h(real)f(\(x\);)210 1640 y(>)h(y.im)f(=)h(imag) f(\(x\);)210 1690 y(>)h(endfunction)210 1790 y(octave:2>)f(f)g(\(rand)h (+)f(rand*I\);)210 1840 y(ans)g(=)210 1939 y()210 2039 y(octave:3>)f(ans.im,)g(ans.re)210 2089 y(ans.im)g(=)h(0.93411)210 2139 y(ans.re)f(=)h(0.56234)90 2230 y Fp(F)l(unction)17 b(return)f(lists)h(can)f(include)i(structure)e(elemen)o(ts,)g(and)h (they)f(ma)o(y)f(b)q(e)i(indexed)g(lik)o(e)h(an)o(y)d(other)90 2292 y(v)m(ariable.)210 2371 y Fm(octave:1>)23 b([x.u,)g (x.s\(2:3,2:3\),)f(x.v])h(=)h(svd)f(\([1,)h(2;)f(3,)h(4]\))210 2421 y(x.u)f(=)258 2521 y(-0.40455)46 b(-0.91451)258 2570 y(-0.91451)70 b(0.40455)210 2670 y(x.s)23 b(=)p eop %%Page: 4 6 4 5 bop 0 -58 a Fp(Chapter)15 b(3:)k(What)c(features)g(are)g(unique)h (to)f(Octa)o(v)o(e?)958 b(4)258 233 y Fm(0.00000)46 b(0.00000)h (0.00000)258 283 y(0.00000)f(5.46499)h(0.00000)258 333 y(0.00000)f(0.00000)h(0.36597)210 432 y(x.v)23 b(=)258 532 y(-0.57605)70 b(0.81742)258 582 y(-0.81742)46 b(-0.57605)210 681 y(octave:8>)23 b(x)210 731 y(x)h(=)210 831 y()90 903 y Fp(Y)l(ou)11 b(can)g(also)g(use)g(the)g(function)h Fm(is_struct)e Fp(to)g(determine)i(whether)f(a)g(giv)o(en)g(v)m(alue)h (is)g(a)e(data)h(structure.)90 965 y(F)l(or)k(example)210 1025 y Fm(is_struct)23 b(\(x\))90 1097 y Fp(returns)15 b(1)g(if)h(the)f(v)m(alue)h(of)f(the)g(v)m(ariable)i Fn(x)h Fp(is)e(a)f(data)f(structure.)62 1190 y(This)i(feature)f(should) h(b)q(e)g(considered)h(exp)q(erimen)o(tal,)f(but)f(y)o(ou)g(should)i (exp)q(ect)f(it)f(to)g(w)o(ork.)k(Suggestions)0 1252 y(for)c(w)o(a)o(ys)f(to)g(impro)o(v)o(e)h(it)h(are)f(w)o(elcome.)0 1380 y Fo(3.4)33 b(Short-circuit)18 b(b)r(o)r(olean)d(op)r(erators)62 1484 y Fp(Octa)o(v)o(e's)h(`)p Fm(&&)p Fp(')g(and)g(`)p Fm(||)p Fp(')g(logical)i(op)q(erators)e(are)g(ev)m(aluated)i(in)f(a)f (short-circuit)i(fashion)f(\(lik)o(e)g(the)g(corre-)0 1546 y(sp)q(onding)e(op)q(erators)e(in)i(the)f(C)g(language\))g(and)g (w)o(ork)f(di\013eren)o(tly)i(than)f(the)g(elemen)o(t)h(b)o(y)f(elemen) o(t)h(op)q(erators)0 1608 y(`)p Fm(&)p Fp(')f(and)i(`)p Fm(|)p Fp('.)0 1736 y Fo(3.5)33 b(Incremen)n(t)14 b(and)h(decremen)n(t) f(op)r(erators)62 1840 y Fp(Octa)o(v)o(e)g(includes)i(the)f(C-lik)o(e)g (incremen)o(t)g(and)f(decremen)o(t)h(op)q(erators)e(`)p Fm(++)p Fp(')g(and)h(`)p Fm(--)p Fp(')g(in)h(b)q(oth)f(their)g (pre\014x)0 1902 y(and)h(p)q(ost\014x)h(forms.)62 1985 y(F)l(or)h(example,)h(to)f(pre-incremen)o(t)i(the)e(v)m(ariable)i Fn(x)p Fp(,)e(y)o(ou)g(w)o(ould)h(write)f Fm(++)p Fn(x)s Fp(.)27 b(This)18 b(w)o(ould)f(add)h(one)f(to)g Fn(x)0 2047 y Fp(and)g(then)h(return)f(the)h(new)f(v)m(alue)i(of)d Fn(x)21 b Fp(as)c(the)g(result)h(of)f(the)g(expression.)27 b(It)17 b(is)h(exactly)g(the)f(same)g(as)g(the)0 2110 y(expression)f Fn(x)i Fm(=)d Fn(x)k Fm(+)c(1)p Fp(.)62 2193 y(T)l(o)20 b(p)q(ost-incremen)o(t)h(a)f(v)m(ariable)h Fn(x)p Fp(,)g(y)o(ou)e(w)o(ould)i(write)f Fn(x)s Fm(++)p Fp(.)34 b(This)21 b(adds)f(one)g(to)f(the)i(v)m(ariable)g Fn(x)p Fp(,)g(but)0 2255 y(returns)15 b(the)g(v)m(alue)h(that)f Fn(x)j Fp(had)d(prior)g(to)g(incremen)o(ting)h(it.)k(F)l(or)15 b(example,)g(if)h Fn(x)i Fp(is)d(equal)h(to)e(2,)h(the)g(result)g(of)0 2317 y(the)g(expression)h Fn(x)s Fm(++)f Fp(is)h(2,)f(and)g(the)g(new)h (v)m(alue)g(of)f Fn(x)j Fp(is)e(3.)62 2400 y(F)l(or)d(matrix)f(and)i(v) o(ector)e(argumen)o(ts,)g(the)h(incremen)o(t)h(and)f(decremen)o(t)h(op) q(erators)e(w)o(ork)g(on)h(eac)o(h)g(elemen)o(t)0 2462 y(of)i(the)g(op)q(erand.)62 2545 y(It)g(is)f(not)g(curren)o(tly)h(p)q (ossible)h(to)d(incremen)o(t)i(index)h(expressions.)k(F)l(or)14 b(example,)h(y)o(ou)f(migh)o(t)g(exp)q(ect)h(that)0 2608 y(the)i(expression)h Fn(v)t Fm(\(4\)++)e Fp(w)o(ould)i(incremen)o(t)g (the)f(fourth)g(elemen)o(t)h(of)e(the)i(v)o(ector)e Fn(v)p Fp(,)h(but)g(instead)h(it)g(results)0 2670 y(in)e(a)f(parse)g(error.)k (This)d(problem)g(ma)o(y)e(b)q(e)i(\014xed)g(in)g(a)f(future)g(release) h(of)f(Octa)o(v)o(e.)p eop %%Page: 5 7 5 6 bop 0 -58 a Fp(Chapter)15 b(3:)k(What)c(features)g(are)g(unique)h (to)f(Octa)o(v)o(e?)958 b(5)0 183 y Fo(3.6)33 b(Un)n(wind-protect)62 306 y Fp(Octa)o(v)o(e)17 b(supp)q(orts)f(a)h(limited)i(form)d(of)g (exception)i(handling)g(mo)q(delled)h(after)d(the)h(un)o(wind-protect)h (form)0 369 y(of)d(Lisp.)21 b(The)15 b(general)h(form)e(of)h(an)g Fm(unwind_protect)f Fp(blo)q(c)o(k)h(lo)q(oks)h(lik)o(e)g(this:)120 468 y Fm(unwind_protect)168 531 y Fn(b)q(o)q(dy)120 593 y Fm(unwind_protect_cleanup)168 655 y Fn(clean)o(up)120 717 y Fm(end_unwind_protect)0 812 y Fp(Where)d Fn(b)q(o)q(dy)18 b Fp(and)13 b Fn(clean)o(up)j Fp(are)c(b)q(oth)i(optional)f(and)g(ma)o (y)g(con)o(tain)g(an)o(y)g(Octa)o(v)o(e)f(expressions)i(or)f(commands.) 0 875 y(The)i(statemen)o(ts)f(in)j Fn(clean)o(up)g Fp(are)e(guaran)o (teed)g(to)f(b)q(e)i(executed)g(regardless)g(of)f(ho)o(w)f(con)o(trol)h (exits)h Fn(b)q(o)q(dy)p Fp(.)62 977 y(The)i Fm(unwind_protect)d Fp(statemen)o(t)i(is)h(often)f(used)h(to)f(reliably)i(restore)e(the)g (v)m(alues)i(of)e(global)h(v)m(ariables)0 1039 y(that)c(need)j(to)d(b)q (e)i(temp)q(orarily)g(c)o(hanged.)0 1250 y Fo(3.7)33 b(V)-6 b(ariable-length)17 b(argumen)n(t)d(lists)62 1373 y Fp(Octa)o(v)o(e)j(has)g(a)g(real)g(mec)o(hanism)h(for)e(handling)j (functions)f(that)e(tak)o(e)h(an)g(unsp)q(eci\014ed)i(n)o(um)o(b)q(er)f (of)e(argu-)0 1435 y(men)o(ts,)f(so)h(it)g(is)g(no)g(longer)g (necessary)g(to)f(place)h(an)g(upp)q(er)h(b)q(ound)g(on)e(the)h(n)o(um) o(b)q(er)g(of)f(optional)i(argumen)o(ts)0 1498 y(that)d(a)h(function)h (can)g(accept.)62 1600 y(Here)k(is)g(an)f(example)h(of)f(a)g(function)h (that)f(uses)g(the)h(new)f(syn)o(tax)g(to)g(prin)o(t)g(a)g(header)h (follo)o(w)o(ed)g(b)o(y)f(an)0 1662 y(unsp)q(eci\014ed)f(n)o(um)o(b)q (er)d(of)g(v)m(alues:)120 1752 y Fm(function)23 b(foo)g(\(heading,)g (...\))168 1802 y(disp)g(\(heading\);)168 1852 y(va_start)f(\(\);)168 1902 y(while)h(\(--nargin\))215 1952 y(disp)h(\(va_arg)f(\(\)\);)168 2002 y(endwhile)120 2051 y(endfunction)62 2154 y Fp(Calling)15 b Fm(va_start\(\))d Fp(p)q(ositions)i(an)f(in)o(ternal)i(p)q(oin)o(ter) f(to)e(the)i(\014rst)f(unnamed)h(argumen)o(t)e(and)i(allo)o(ws)f(y)o (ou)0 2216 y(to)j(cycle)h(through)g(the)f(argumen)o(ts)g(more)g(than)g (once.)24 b(It)17 b(is)g(not)f(necessary)g(to)g(call)i Fm(va_start\(\))d Fp(if)i(y)o(ou)f(do)0 2278 y(not)f(plan)h(to)e(cycle) j(through)e(the)g(argumen)o(ts)f(more)h(than)g(once.)62 2381 y(The)f(function)h Fm(va_arg\(\))d Fp(returns)i(the)g(v)m(alue)h (of)e(the)h(next)g(a)o(v)m(ailable)h(argumen)o(t)e(and)h(mo)o(v)o(es)f (the)h(in)o(ternal)0 2443 y(p)q(oin)o(ter)j(to)f(the)h(next)g(argumen)o (t.)23 b(It)17 b(is)g(an)g(error)e(to)h(call)i Fm(va_arg\(\))e Fp(when)h(there)g(are)f(no)h(more)f(argumen)o(ts)0 2505 y(a)o(v)m(ailable.)62 2608 y(It)k(is)h(also)f(p)q(ossible)i(to)d(use)h (the)h(k)o(eyw)o(ord)e Fn(all)p 900 2608 14 2 v 17 w(v)m(a)p 961 2608 V 17 w(args)i Fp(to)e(pass)h(all)h(unnamed)g(argumen)o(ts)e (to)g(another)0 2670 y(function.)p eop %%Page: 6 8 6 7 bop 0 -58 a Fp(Chapter)15 b(5:)k(Obtaining)e(Source)f(Co)q(de)1231 b(6)0 183 y Fo(3.8)33 b(V)-6 b(ariable-length)17 b(return)g(lists)62 291 y Fp(Octa)o(v)o(e)j(also)g(has)g(a)g(real)h(mec)o(hanism)g(for)e (handling)j(functions)f(that)e(return)i(an)f(unsp)q(eci\014ed)j(n)o(um) o(b)q(er)0 353 y(of)17 b(v)m(alues,)j(so)d(it)h(is)g(no)g(longer)g (necessary)g(to)f(place)i(an)f(upp)q(er)h(b)q(ound)f(on)g(the)g(n)o(um) o(b)q(er)g(of)g(outputs)f(that)g(a)0 415 y(function)f(can)f(pro)q (duce.)62 502 y(Here)h(is)f(an)h(example)g(of)e(a)h(function)h(that)f (uses)g(the)g(new)h(syn)o(tax)e(to)h(pro)q(duce)h(`)p Fm(N)p Fp(')e(v)m(alues:)120 577 y Fm(function)23 b([...])g(=)h(foo)f (\(n\))168 627 y(for)g(i)h(=)g(1:n)215 676 y(vr_val)f(\(i\);)168 726 y(endfor)120 776 y(endfunction)0 925 y Fo(3.9)33 b(Built-in)18 b(ODE)c(and)i(D)n(AE)e(solv)n(ers)62 1032 y Fp(Octa)o(v)o(e)20 b(includes)j(LSODE)e(and)g(D)o(ASSL)g(for)f (solving)i(systems)e(of)g(sti\013)g(di\013eren)o(tial)i(and)f (di\013eren)o(tial-)0 1095 y(algebraic)16 b(equations.)k(These)c (functions)g(are)f(built)h(in)g(to)f(the)g(in)o(terpreter.)0 1235 y Fl(4)41 b(What)16 b(do)r(cumen)n(tation)d(exists)h(for)h(Octa)n (v)n(e?)62 1387 y Fp(The)i(Octa)o(v)o(e)f(distribution)j(includes)g(a)d (220)p Fm(+)g Fp(page)g(man)o(ual)h(that)f(is)h(also)g(distributed)h (under)g(the)f(terms)0 1449 y(of)e(the)g(GNU)g(GPL.)62 1536 y(The)j(Octa)o(v)o(e)e(man)o(ual)h(is)h(in)o(tended)g(to)f(b)q(e)g (a)g(complete)h(reference)g(for)e(Octa)o(v)o(e,)h(but)g(it)g(is)h(not)f (a)f(\014nished)0 1599 y(do)q(cumen)o(t.)35 b(If)20 b(y)o(ou)g(ha)o(v)o (e)g(problems)h(using)g(it,)g(or)e(\014nd)i(that)f(some)g(topic)g(is)h (not)f(adequately)g(explained,)0 1661 y(indexed,)d(or)d (cross-referenced,)i(please)g(send)g(a)f(bug)g(rep)q(ort)g(to)f(bug-o)q (cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)62 1748 y(Because)h(the)f (Octa)o(v)o(e)g(man)o(ual)g(is)h(written)f(using)h(T)l(exinfo,)g(the)f (complete)h(text)e(of)h(the)g(Octa)o(v)o(e)g(man)o(ual)g(is)0 1810 y(also)i(a)o(v)m(ailable)h(on)f(line)h(using)f(the)g(GNU)g(Info)g (system)f(via)h(the)g(GNU)f(Emacs,)g(info,)h(or)f(xinfo)h(programs,)e (or)0 1872 y(b)o(y)h(using)h(the)f(`)p Fm(help)g(-i)p Fp(')f(command)h(to)g(start)f(the)h(GNU)g(info)h(bro)o(wser)e(directly) j(from)d(the)h(Octa)o(v)o(e)g(prompt.)62 1959 y(It)k(is)f(also)g(p)q (ossible)i(to)e(use)h(WWW)e(bro)o(wsers)g(suc)o(h)i(as)f(Mosaic)g(to)f (read)h(the)h(Octa)o(v)o(e)f(man)o(ual)g(\(or)f(an)o(y)0 2021 y(other)j(Info)g(\014le\))g(b)o(y)g(using)h(Roar)e(Smith's)i (info2www)e(program)g(to)g(con)o(v)o(ert)g(GNU)h(Info)g(\014les)h(to)e (HTML.)0 2084 y(The)f(source)f(for)g(info2www)g(is)i(a)o(v)m(ailable)g (via)f(anon)o(ymous)f(ftp)g(from)g(ftp.c)o(he.utexas.edu)g(in)h(the)g (directory)0 2146 y(`)p Fm(/pub/www)p Fp('.)0 2286 y Fl(5)41 b(Obtaining)14 b(Source)h(Co)r(de)0 2500 y Fo(5.1)33 b(Ho)n(w)14 b(do)h(I)g(get)g(a)f(cop)n(y)i(of)e(Octa)n(v)n(e)h(for)g (Unix?)62 2608 y Fp(Y)l(ou)g(can)f(get)g(Octa)o(v)o(e)f(from)h(a)f (friend)j(who)d(has)h(a)g(cop)o(y)l(,)g(b)o(y)g(anon)o(ymous)g(FTP)l(,) f(or)h(b)o(y)g(ordering)g(a)g(tap)q(e)g(or)0 2670 y(CD-R)o(OM)h(from)g (the)g(F)l(ree)g(Soft)o(w)o(are)f(F)l(oundation)h(\(FSF\).)p eop %%Page: 7 9 7 8 bop 0 -58 a Fp(Chapter)15 b(6:)k(Installation)e(Issues)f(and)f (Problems)1049 b(7)62 183 y(Octa)o(v)o(e)15 b(w)o(as)e(not)i(dev)o (elop)q(ed)h(b)o(y)f(the)f(FSF,)g(but)h(the)g(FSF)f(do)q(es)h (distribute)h(Octa)o(v)o(e,)e(and)h(the)g(dev)o(elop)q(ers)0 246 y(of)h(Octa)o(v)o(e)g(supp)q(ort)g(the)h(e\013orts)e(of)h(the)g (FSF)g(b)o(y)g(encouraging)h(users)f(of)g(Octa)o(v)o(e)g(to)g(order)g (Octa)o(v)o(e)g(on)g(tap)q(e)0 308 y(or)f(CD)f(directly)j(from)d(the)i (FSF.)62 391 y(The)j(FSF)f(is)h(a)f(nonpro\014t)g(organization)h(that)f (distributes)h(soft)o(w)o(are)e(and)i(man)o(uals)f(to)g(raise)h(funds)g (for)0 453 y(more)13 b(GNU)g(dev)o(elopmen)o(t.)20 b(Buying)14 b(a)f(tap)q(e)g(or)g(CD)g(from)f(the)i(FSF)e(con)o(tributes)i(directly) g(to)f(pa)o(ying)h(sta\013)e(to)0 515 y(dev)o(elop)17 b(GNU)e(soft)o(w)o(are.)k(CD-R)o(OMs)d(cost)f($400)g(if)h(an)f (organization)h(is)g(buying,)g(or)g($100)e(if)i(an)g(individual)0 578 y(is)g(buying.)21 b(T)l(ap)q(es)15 b(cost)g(around)g($200)f(dep)q (ending)k(on)d(media)h(t)o(yp)q(e.)62 661 y(The)f(FSF)f(only)i(mak)o (es)e(new)h(CD)f(releases)h(a)g(few)f(times)h(a)f(y)o(ear,)g(so)h(if)g (y)o(ou)f(are)g(in)o(terested)i(sp)q(eci\014cally)h(in)0 723 y(Octa)o(v)o(e,)d(I)i(recommend)g(asking)f(for)f(the)i(latest)f (release)h(on)f(tap)q(e.)62 806 y(F)l(or)h(more)h(information)f(ab)q (out)h(ordering)g(from)f(the)g(FSF,)g(con)o(tact)g(gn)o(u)p Fm(@)p Fp(prep.ai.mit.edu,)h(phone)g(\(617\))0 868 y(876-3296)h(or)i (anon)o(ymous)g(ftp)g(\014le)h(`)p Fm(/pub/gnu/GNUinfo/ORDERS)p Fp(')c(from)i(prep.ai.mit.edu)i(or)f(one)g(of)g(the)0 930 y(sites)c(listed)g(b)q(elo)o(w.)62 1013 y(If)h(y)o(ou)f(are)h(on)f (the)h(In)o(ternet,)g(y)o(ou)f(can)h(cop)o(y)f(the)h(latest)f (distribution)i(v)o(ersion)f(of)f(Octa)o(v)o(e)g(from)g(the)h(\014le)0 1076 y(`)p Fm(/pub/octave/octave-M.N.)o(tar.gz)p Fp(')o(,)h(on)i(the)g (host)f(`)p Fm(ftp.che.utexas.edu)p Fp('.)31 b(This)21 b(tar)e(\014le)i(has)f(b)q(een)0 1138 y(compressed)d(with)h(GNU)e (gzip,)i(so)f(b)q(e)g(sure)g(to)g(use)g(binary)h(mo)q(de)f(for)f(the)h (transfer.)25 b(`)p Fm(M)p Fp(')16 b(and)h(`)p Fm(N)p Fp(')f(stand)h(for)0 1200 y(v)o(ersion)12 b(n)o(um)o(b)q(ers;)i(lo)q (ok)e(at)g(a)g(listing)h(of)f(the)g(directory)h(through)f(ftp)g(to)f (see)i(what)f(v)o(ersion)g(is)h(a)o(v)m(ailable.)20 b(After)0 1263 y(y)o(ou)15 b(unpac)o(k)g(the)h(distribution,)g(b)q(e)g(sure)f(to) g(lo)q(ok)g(at)g(the)g(\014les)h(`)p Fm(README)p Fp(')e(and)h(`)p Fm(INSTALL)p Fp('.)62 1346 y(Binaries)20 b(for)d(sev)o(eral)h(p)q (opular)h(systems)f(are)g(also)g(a)o(v)m(ailable.)30 b(If)18 b(y)o(ou)g(w)o(ould)g(lik)o(e)i(help)f(out)f(b)o(y)g(making)0 1408 y(binaries)f(a)o(v)m(ailable)f(for)f(other)g(systems,)f(please)i (con)o(tact)f(bug-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)62 1491 y(A)23 b(list)h(of)f(user-visible)i(c)o(hanges)e(since)i(the)e (last)g(release)g(is)h(a)o(v)m(ailable)h(in)e(the)h(\014le)g(`)p Fm(NEWS)p Fp('.)42 b(The)23 b(\014le)0 1553 y(`)p Fm(ChangeLog)p Fp(')15 b(in)i(the)g(source)f(distribution)j(con)o(tains)d(a)h(more)f (detailed)i(record)f(of)f(c)o(hanges)g(made)h(since)h(the)0 1615 y(last)d(release.)0 1747 y Fo(5.2)33 b(Ho)n(w)14 b(do)h(I)g(get)g(a)f(cop)n(y)i(of)e(Octa)n(v)n(e)h(for)g(\(some)d (other)k(platform\)?)62 1850 y Fp(Octa)o(v)o(e)i(curren)o(tly)h(runs)f (on)h(Unix-lik)o(e)h(systems)e(only)l(.)30 b(It)18 b(should)i(b)q(e)f (p)q(ossible)h(to)d(mak)o(e)h(Octa)o(v)o(e)g(w)o(ork)0 1913 y(on)h(other)f(systems.)30 b(If)19 b(y)o(ou)f(are)h(in)o(terested) g(in)h(p)q(orting)f(Octa)o(v)o(e)f(to)g(other)g(systems,)h(please)h (con)o(tact)e(bug-)0 1975 y(o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)0 2106 y Fo(5.3)33 b(What)15 b(is)h(the)f(latest) g(v)n(ersion)h(of)f(Octa)n(v)n(e)62 2210 y Fp(The)h(latest)f(v)o (ersion)g(of)g(Octa)o(v)o(e)g(is)g(1.1.0,)f(released)i(Jan)o(uary)f (1995.)0 2333 y Fl(6)41 b(Installation)14 b(Issues)h(and)g(Problems)62 2462 y Fp(Octa)o(v)o(e)h(requires)g(appro)o(ximately)g(50MB)f(of)h (disk)h(storage)d(to)h(unpac)o(k)i(and)f(install)h(\(signi\014can)o (tly)g(less)f(if)0 2525 y(y)o(ou)f(don't)g(compile)h(with)g(debugging)g (sym)o(b)q(ols\).)62 2608 y(Octa)o(v)o(e)d(has)g(b)q(een)i(compiled)g (and)e(tested)g(with)h(g)p Fm(++)e Fp(and)i(libg)p Fm(++)g Fp(on)f(a)g(SP)l(AR)o(Cstation)g(2)g(running)i(SunOS)0 2670 y(4.1.2,)k(an)h(IBM)g(RS/6000)f(running)i(AIX)g(3.2.5,)e(DEC)g (Alpha)i(systems)f(running)h(OSF/1)e(1.3)g(and)h(3.0,)g(a)p eop %%Page: 8 10 8 9 bop 0 -58 a Fp(Chapter)15 b(8:)k(Getting)c(additional)i(help)1231 b(8)0 183 y(DECstation)19 b(5000/240)e(running)k(Ultrix)g(4.2a,)e(and)h (i486)f(systems)g(running)i(Lin)o(ux.)35 b(It)20 b(should)g(w)o(ork)f (on)0 246 y(most)14 b(other)h(Unix)h(systems)f(that)f(ha)o(v)o(e)h(a)g (w)o(orking)g(p)q(ort)g(of)g(g)p Fm(++)f Fp(and)i(libg)p Fm(++)p Fp(.)0 384 y Fo(6.1)33 b(What)15 b(else)g(do)g(I)g(need?)62 489 y Fp(In)24 b(order)e(to)g(build)i(Octa)o(v)o(e,)g(y)o(ou)e(will)j (need)e(a)g(curren)o(t)f(v)o(ersion)h(of)f(g)p Fm(++)p Fp(,)i(libg)p Fm(++)p Fp(,)h(and)d(GNU)h(mak)o(e.)0 552 y(If)e(y)o(ou)f(don't)h(ha)o(v)o(e)f(these)h(to)q(ols,)h(y)o(ou)e(can)h (get)f(them)h(from)f(man)o(y)g(anon)o(ymous)h(ftp)f(arc)o(hiv)o(es,)i (including)0 614 y(ftp.c)o(he.utexas.edu,)15 b(ftp.uu.net,)f (prep.ai.mit.edu,)i(and)g(wuarc)o(hiv)o(e.wustl.edu,)f(or)g(b)o(y)g (writing)h(to)f(the)g(FSF)0 676 y(at)g(675)f(Mass)g(Av)o(e,)h(Cam)o (bridge,)g(MA)g(02139,)e(USA.)0 815 y Fo(6.2)33 b(Can)14 b(I)i(compile)e(Octa)n(v)n(e)g(with)i(another)g(C)p Fi(++)e Fo(compiler?)62 920 y Fp(Curren)o(tly)l(,)h(Octa)o(v)o(e)f(can)g(only)h (b)q(e)g(compiled)h(with)f(the)f(GNU)g(C)p Fm(++)g Fp(compiler.)21 b(It)14 b(w)o(ould)h(b)q(e)g(nice)h(to)d(mak)o(e)0 983 y(it)i(p)q(ossible)h(to)f(compile)h(Octa)o(v)o(e)e(with)h(other)f(C)p Fm(++)h Fp(compilers,)g(but)g(the)g(main)o(tainers)g(do)g(not)f(ha)o(v) o(e)g(su\016cien)o(t)0 1045 y(time)f(to)f(dev)o(ote)h(to)f(this.)20 b(If)13 b(y)o(ou)g(are)f(in)o(terested)i(in)f(w)o(orking)g(to)f(mak)o (e)h(Octa)o(v)o(e)f(p)q(ortable)h(to)g(other)f(compilers,)0 1107 y(please)k(con)o(tact)e(bug-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)0 1237 y Fl(7)41 b(Common)12 b(problems)62 1378 y Fp(This)20 b(list)f(is)h(probably)f(far)f(to)q(o)g(short.)30 b(F)l(eel)20 b(free)f(to)f(suggest)g(additional)i(questions)f (\(preferably)h(with)0 1440 y(answ)o(ers!\))90 1524 y(Octa)o(v)o(e)15 b(tak)o(es)f(a)h(long)h(time)f(to)g(\014nd)h(sym)o(b)q(ols.)90 1601 y(Octa)o(v)o(e)c(is)g(probably)h(sp)q(ending)h(this)e(time)h (recursiv)o(ely)g(searc)o(hing)g(directories)g(for)e(function)i (\014les.)20 b(Chec)o(k)90 1663 y(the)15 b(v)m(alue)h(of)f(y)o(our)f (LO)o(ADP)l(A)l(TH.)i(F)l(or)e(those)h(elemen)o(ts)g(that)g(end)g(in)h (`)p Fm(//)p Fp(',)e(do)h(an)o(y)g(name)g(a)f(v)o(ery)h(large)90 1725 y(directory)e(tree?)19 b(Do)q(es)12 b(it)h(con)o(tain)f (directories)i(that)d(ha)o(v)o(e)h(a)g(mixture)h(of)f(\014les)h(and)g (directories?)20 b(In)13 b(order)90 1787 y(for)f(the)h(recursiv)o(e)g (directory)g(searc)o(hing)g(co)q(de)g(to)f(w)o(ork)g(e\016cien)o(tly)l (,)i(directories)g(that)e(are)g(to)g(b)q(e)i(searc)o(hed)90 1850 y(recursiv)o(ely)k(should)f(ha)o(v)o(e)e(either)i(function)g (\014les)h(only)l(,)e(or)g(sub)q(directories)i(only)l(,)f(but)f(not)g (a)g(mixture)g(of)90 1912 y(b)q(oth.)k(Chec)o(k)15 b(to)g(mak)o(e)g (sure)g(that)f(Octa)o(v)o(e's)h(standard)g(set)f(of)h(function)h (\014les)g(is)g(installed)h(this)f(w)o(a)o(y)l(.)0 2042 y Fl(8)41 b(Getting)15 b(additional)g(help)62 2183 y Fp(The)h(mailing)g(list)120 2255 y Fm(help-octave@che.utexas.edu)0 2339 y Fp(is)i(a)o(v)m(ailable)h(for)d(questions)i(related)g(to)e (using,)i(installing,)i(and)d(p)q(orting)g(Octa)o(v)o(e)g(that)g(are)g (not)f(adequately)0 2401 y(answ)o(ered)f(b)o(y)g(the)h(Octa)o(v)o(e)e (man)o(ual)i(or)e(b)o(y)h(this)h(do)q(cumen)o(t.)62 2486 y(If)i(y)o(ou)e(w)o(ould)i(lik)o(e)g(to)e(join)h(the)h(discussion)g (and)f(receiv)o(e)h(all)g(messages)f(sen)o(t)f(to)h(the)g(list,)h (please)g(send)f(a)0 2548 y(short)e(note)g(to)120 2620 y Fm(help-octave-request@che.ut)o(exas.ed)o(u)406 2670 y(^^^^^^^)p eop %%Page: 9 11 9 10 bop 0 -58 a Fp(Chapter)15 b(10:)k(P)o(orting)c(programs)f(from)g Fk(Ma)m(tlab)i Fp(to)e(Octa)o(v)o(e)818 b(9)62 183 y Fh(Please)17 b(do)f(not)f Fp(send)h(requests)g(to)f(b)q(e)h(added)g(or) f(remo)o(v)o(ed)g(from)g(the)h(the)g(mailing)h(list,)f(or)f(other)g (admin-)0 246 y(istrativ)o(e)g(trivia)h(to)e(the)i(list)g(itself.)62 331 y(An)f(arc)o(hiv)o(e)f(of)g(old)g(p)q(ostings)h(to)e(the)i(help-o)q (cta)o(v)o(e)f(mailing)i(list)f(is)f(main)o(tained)h(on)f(ftp.c)o (he.utexas.edu)g(in)0 393 y(the)h(directory)h(`)p Fm (/pub/octave/MAILING-L)o(ISTS)p Fp('.)0 526 y Fl(9)41 b(I)15 b(think)f(I)h(ha)n(v)n(e)f(found)h(a)g(bug)h(in)e(Octa)n(v)n(e.) 62 670 y Fp(\\I)19 b(think)g(I)f(ha)o(v)o(e)g(found)h(a)f(bug)g(in)i (Octa)o(v)o(e,)e(but)g(I'm)h(not)f(sure.)29 b(Ho)o(w)18 b(do)g(I)g(kno)o(w,)h(and)f(who)g(should)i(I)0 733 y(tell?")62 818 y(First,)f(see)g(the)f(section)h(on)g(bugs)f(and)h(bug)f(rep)q (orts)g(in)i(the)e(Octa)o(v)o(e)g(man)o(ual.)30 b(The)19 b(Octa)o(v)o(e)f(man)o(ual)g(is)0 880 y(included)g(in)e(the)f(Octa)o(v) o(e)g(distribution.)62 965 y(When)h(y)o(ou)f(rep)q(ort)g(a)g(bug,)g (mak)o(e)f(sure)i(to)e(describ)q(e)j(the)f(t)o(yp)q(e)f(of)g(computer)g (y)o(ou)g(are)g(using,)g(the)h(v)o(ersion)0 1028 y(of)g(the)g(op)q (erating)h(system)f(it)g(is)h(running,)g(and)g(the)f(v)o(ersion)h(of)e (Octa)o(v)o(e)h(that)g(y)o(ou)g(are)g(using.)24 b(Also)16 b(pro)o(vide)0 1090 y(enough)g(co)q(de)f(so)g(that)g(the)g(Octa)o(v)o (e)g(main)o(tainers)g(can)h(duplicate)h(y)o(our)d(bug.)62 1175 y(If)h(y)o(ou)f(ha)o(v)o(e)h(Octa)o(v)o(e)f(w)o(orking)g(at)g (all,)h(the)g(easiest)g(w)o(a)o(y)f(to)g(do)g(this)h(is)g(to)f(use)h (the)g(Octa)o(v)o(e)f(function)i Fm(bug_)0 1237 y(report)p Fp(.)i(When)c(y)o(ou)e(execute)i(this)f(function,)h(Octa)o(v)o(e)f (will)h(prompt)f(y)o(ou)g(for)f(a)h(sub)s(ject)f(and)i(then)f(in)o(v)o (ok)o(e)g(the)0 1300 y(editor)j(on)g(a)f(\014le)i(that)e(already)i(con) o(tains)e(all)i(the)f(con\014guration)g(information.)22 b(When)16 b(y)o(ou)g(exit)g(the)g(editor,)0 1362 y(Octa)o(v)o(e)f(will) i(mail)f(the)f(bug)g(rep)q(ort)g(for)g(y)o(ou.)62 1447 y(If)23 b(for)f(some)g(reason)g(y)o(ou)h(cannot)f(use)h(Octa)o(v)o(e's) e Fm(bug_report)g Fp(function,)k(mail)f(y)o(our)e(bug)g(rep)q(ort)h(to) 0 1509 y Fm(")p Fp(bug-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu)p Fm(")p Fp(.)40 b(Y)l(our)22 b(message)f(needs)i(to)e(include)k(enough)d (information)g(to)g(allo)o(w)g(the)0 1572 y(main)o(tainers)f(of)f(Octa) o(v)o(e)h(to)f(\014x)h(the)g(bug.)36 b(Please)22 b(read)e(the)h (section)h(on)e(bugs)h(and)g(bug)g(rep)q(orts)f(in)i(the)0 1634 y(Octa)o(v)o(e)15 b(man)o(ual)g(for)g(a)g(list)h(of)e(things)i (that)e(should)j(b)q(e)f(included)h(in)f(ev)o(ery)f(bug)h(rep)q(ort.)0 1767 y Fl(10)41 b(P)n(orting)15 b(programs)f(from)g Fg(Ma)-5 b(tlab)15 b Fl(to)h(Octa)n(v)n(e)62 1911 y Fp(\\I)j(ha)o(v)o(e)f(some)g Fk(Ma)m(tlab)g Fp(co)q(de,)h(and)g(I)g(w)o(an)o(t)e(to)g(get)h(it)h (running)g(under)g(Octa)o(v)o(e.)29 b(Is)19 b(there)f(an)o(ything)h(I)0 1974 y(should)d(w)o(atc)o(h)f(out)f(for?")62 2059 y(The)i (di\013erences)g(b)q(et)o(w)o(een)g(Octa)o(v)o(e)e(and)i Fk(Ma)m(tlab)f Fp(t)o(ypically)i(fall)f(in)o(to)f(one)g(of)g(three)g (categories:)25 2144 y(1.)29 b(Irrelev)m(an)o(t.)25 2221 y(2.)g(Kno)o(wn)15 b(di\013erences,)h(p)q(erhaps)g(con\014gurable)g (with)g(a)f(user)g(preference)h(v)m(ariable.)25 2298 y(3.)29 b(Unkno)o(wn)15 b(di\013erences.)62 2398 y(The)d(\014rst)f (category)l(,)h(irrelev)m(an)o(t)g(di\013erences,)h(do)f(not)f (a\013ect)g(computations)h(and)g(most)e(lik)o(ely)k(do)d(not)h (a\013ect)0 2460 y(the)j(execution)i(of)d(function)i(\014les.)21 b(Some)15 b(examples)h(are:)62 2545 y(When)f(t)o(yping)f(`)p Fm(help)h(function)p Fp(',)d(Octa)o(v)o(e)i(displa)o(ys)h(the)g (\014rst)f(set)g(of)f(commen)o(t)h(lines)i Fn(after)h Fp(the)d(function)0 2608 y(declaration,)h(but)f Fk(Ma)m(tlab)g Fp(displa)o(ys)i(the)e(\014rst)g(set)g(of)f(commen)o(t)h(lines)i (starting)d(from)h(the)g(b)q(eginning)i(of)e(the)0 2670 y(\014le.)p eop %%Page: 10 12 10 11 bop 0 -58 a Fp(App)q(endix)17 b(A:)e(Concept)g(Index)1346 b(10)62 183 y(The)17 b(di\013erences)g(of)f(the)g(second)h(category)e (are)h(usually)i(b)q(ecause)f(the)g(authors)e(of)h(Octa)o(v)o(e)g (decided)i(on)e(a)0 246 y(b)q(etter)f(\(sub)s(jectiv)o(e\))g(implemen)o (tation)i(that)e(the)g(w)o(a)o(y)f Fk(Ma)m(tlab)i Fp(do)q(es)f(it,)h (and)f(so)g(in)o(tro)q(duced)i(\\user)e(prefer-)0 308 y(ence)j(v)m(ariables")g(so)f(that)g(y)o(ou)g(can)g(customize)h(Octa)o (v)o(e's)e(b)q(eha)o(vior)i(to)f(b)q(e)h(either)g Fk(Ma)m(tlab)p Fp(-compatible)g(or)0 370 y(to)c(use)i(Octa)o(v)o(e's)e(new)i (features.)j(T)l(o)c(mak)o(e)g(Octa)o(v)o(e)f(more)h Fk(Ma)m(tlab)p Fp(-compatible,)h(put)g(the)f(follo)o(wing)h(state-)0 432 y(men)o(ts)f(in)h(y)o(our)e(`)p Fm(~/.octaverc)p Fp(')f(\014le.)21 b(This)15 b(is)h(a)f(partial)g(list)h(of)f(the)g (user)g(preference)h(v)m(ariables)h(that)d(should)0 495 y(b)q(e)j(c)o(hanged)g(to)g(get)f Fk(Ma)m(tlab)p Fp(-compatible)i(b)q (eha)o(vior.)25 b(\(It)17 b(is)g(partial)g(b)q(ecause)h(not)e(all)i (the)e(di\013erences)i(are)0 557 y(curren)o(tly)e(kno)o(wn,)e(and)i (when)f(they)h(b)q(ecome)f(kno)o(wn,)g(this)h(do)q(cumen)o(t)f(lags)g (b)q(ehind.\))168 628 y Fm(do_fortran_indexing)21 b(=)j('true';)168 678 y(treat_neg_dim_as_zero)d(=)i('true';)168 727 y (empty_list_elements_ok)e(=)i('true';)168 777 y(implicit_str_to_num_ok) e(=)i('true';)168 827 y(whitespace_in_literal_ma)o(trix)e(=)i ('traditional';)168 877 y(prefer_zero_one_indexing)d(=)k('true';)62 960 y Fp(Some)15 b(other)g(kno)o(wn)g(di\013erences)i(are:)90 1044 y(String)e(subscripting)i(is)f(not)f(y)o(et)f(implemen)o(ted)j(in) f(Octa)o(v)o(e.)k(F)l(or)14 b(example,)210 1106 y Fm(a)24 b(=)f('reknob';)210 1156 y(a\([6,1,5,3,2,4]\))90 1231 y Fp(returns)16 b(the)f(string)h(`)p Fm(broken)p Fp(')e(in)i Fk(Ma)m(tlab)p Fp(,)g(but)g(generates)f(an)h(error)f(in)h(Octa)o(v)o (e.)21 b(A)15 b(future)h(release)g(of)90 1294 y(Octa)o(v)o(e)f(will)i (\014x)e(this)h(along)f(with)h(pro)o(viding)g(a)f(m)o(uc)o(h)g(more)g (complete)h(and)f(p)q(o)o(w)o(erful)g(set)g(of)g(functions)90 1356 y(for)g(manipulating)h(strings.)90 1431 y(The)e(Octa)o(v)o(e)e (plotting)i(functions)g(are)f(mostly)g(compatible)i(with)e(the)h(ones)f (from)g Fk(Ma)m(tlab)g Fp(3.x,)g(but)g(not)90 1493 y(from)h Fk(Ma)m(tlab)i Fp(4.x.)90 1569 y(The)h(C-st)o(yle)g(I/O)g(functions)h (are)e(not)h(completely)h(compatible.)25 b(It)17 b(w)o(ould)g(b)q(e)h (useful)g(for)e(someone)h(to)90 1631 y(explore)f(the)f(di\013erences)i (so)d(that)h(they)g(migh)o(t)g(b)q(e)h(\014xed,)g(or)e(at)h(least)g (noted)g(in)h(the)g(man)o(ual.)62 1727 y(The)c(third)g(category)f(of)g (di\013erences)i(is)f(\(hop)q(efully\))h(shrinking.)20 b(If)12 b(y)o(ou)f(\014nd)h(a)g(di\013erence)g(b)q(et)o(w)o(een)g(Octa) o(v)o(e)0 1789 y(b)q(eha)o(vior)i(and)g Fk(Ma)m(tlab)p Fp(,)g(then)g(y)o(ou)f(should)i(send)f(a)f(description)i(of)f(this)g (di\013erence)h(\(with)e(co)q(de)h(illustrating)0 1852 y(the)h(di\013erence,)h(if)g(p)q(ossible\))h(to)d(bug-o)q(cta)o(v)o(e)p Fm(@)p Fp(c)o(he.utexas.edu.)62 1935 y(An)h(arc)o(hiv)o(e)f(of)g(old)g (p)q(ostings)h(to)e(the)i(help-o)q(cta)o(v)o(e)f(mailing)i(list)f(is)f (main)o(tained)h(on)f(ftp.c)o(he.utexas.edu)g(in)0 1997 y(the)h(directory)h(`)p Fm(/pub/octave/MAILING-L)o(ISTS)p Fp('.)0 2124 y Fl(App)r(endix)d(A)41 b(Concept)15 b(Index)0 2311 y Fo(A)0 2378 y Ff(Additional)h(help)8 b Fe(.)f(.)f(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)20 b Ff(8)0 2436 y(Argumen)o(t)13 b(lists,)h(v)n(ariable-len)q(gth)7 b Fe(.)i(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)19 b Ff(5)0 2555 y Fo(B)0 2621 y Ff(Bo)q(olean)c(op)q(erators,)e(short-circuit)8 b Fe(.)h(.)d(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(4)0 2679 y(Bug)14 b(in)f(Octa)o(v)o(e,)g(newly)h(found)6 b Fe(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(9)1015 2311 y Fo(C)1015 2378 y Ff(Command)14 b(completion)5 b Fe(.)k(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)18 b Ff(2)1015 2436 y(Command)c (history)5 b Fe(.)i(.)f(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)18 b Ff(2)1015 2494 y(Compatibili)q(t)o(y)e(with)d(Matlab)6 b Fe(.)i(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(9)1015 2613 y Fo(D)1015 2679 y Ff(D)o(ASSL)8 b Fe(.)g(.)e(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)21 b Ff(6)p eop %%Page: 11 13 11 12 bop 0 -58 a Fp(App)q(endix)17 b(A:)e(Concept)g(Index)1346 b(11)0 183 y Ff(Data)13 b(structures)7 b Fe(.)h(.)e(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(2)0 241 y(Decremen)o(t)14 b(op)q(erators)6 b Fe(.)h(.)f(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.) f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(4)0 299 y(DJGPP)5 b Fe(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)17 b Ff(7)0 407 y Fo(E)0 474 y Ff(EMX)8 b Fe(.)e(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)21 b Ff(7)0 582 y Fo(F)0 648 y Ff(Flex)8 b Fe(.)f(.)f(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(8)0 706 y(FSF)13 b([F)m(ree)g(Soft)o(w)o(are)g(F)m(oundation])7 b Fe(.)g(.)g(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)19 b Ff(7)0 764 y(FSF,)13 b(con)o(tact)g Fd(<)p Ff(gn)o(u)p Fd(@)p Ff(prep.ai.mit.edu)p Fd(>)7 b Fe(.)h(.)e(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(7)0 823 y(F)m(unction)15 b(name)e(completion)c Fe(.)g(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(2)0 930 y Fo(G)0 997 y Ff(GNU)13 b([GNU's)f(not)h(unix])s Fe(.)7 b(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(7)0 1055 y(GNU)d(Bison)7 b Fe(.)h(.)e(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(8)0 1113 y(GNU)13 b(g)p Fd(++)8 b Fe(.)d(.)h(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f (.)20 b Ff(8)0 1171 y(GNU)13 b(gcc)d Fe(.)c(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(8)0 1229 y(GNU)13 b(Mak)o(e)c Fe(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)21 b Ff(8)0 1287 y(GNUw)o(are,)12 b(anon)o(ymous)j(FTP)e(sites)6 b Fe(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)19 b Ff(7)0 1395 y Fo(H)0 1462 y Ff(History)8 b Fe(.)f(.)f(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(2)0 1570 y Fo(I)0 1636 y Ff(Incremen)o(t)13 b(op)q(erators)s Fe(.)8 b(.)e(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)16 b Ff(4)0 1744 y Fo(L)0 1810 y Ff(libg)p Fd(++)c Fe(.)6 b(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)24 b Ff(8)0 1869 y(Logical)15 b(op)q(erators,)e(short-circuit)7 b Fe(.)i(.)d(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)20 b Ff(4)0 1927 y(LSODE)5 b Fe(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(6)0 2035 y Fo(M)0 2101 y Ff(Mailing)e(lists,)e(bug-o)q(cta)o(v)o (e)d Fe(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(9)0 2159 y(Mailing)16 b(lists,)e(help-o)q(cta)o(v)o(e)6 b Fe(.)h(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(8)0 2217 y(Man)o(ual,)c(for)f(Octa)o(v)o(e)e Fe(.)6 b(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(9)1015 183 y(Matlab)15 b(compatibili)q(t)o(y)t Fe(.)8 b(.)e(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)17 b Ff(9)1015 241 y(MS-DOS)d(supp)q(ort)d Fe(.)6 b(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)23 b Ff(7)1015 359 y Fo(N)1015 425 y Ff(Name)13 b(completion)c Fe(.)g(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.) 22 b Ff(2)1015 543 y Fo(O)1015 609 y Ff(Octa)o(v)o(e)14 b(bug)f(rep)q(ort)e Fe(.)6 b(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)24 b Ff(9)1015 668 y(Octa)o(v)o(e,)13 b(buildin)q(g)c Fe(.)g(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h (.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)22 b Ff(7)1015 726 y(Octa)o(v)o(e,)13 b(do)q(cumen)o(tation)t Fe(.)c(.)d(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)17 b Ff(6)1015 784 y(Octa)o(v)o(e,)c(getting)h(a)f(cop)o(y)c Fe(.)e(.)f(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)22 b Ff(6)1015 842 y(Octa)o(v)o(e,)13 b(ordering)8 b Fe(.)g(.)e(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)21 b Ff(6)1015 900 y(Octa)o(v)o(e,)13 b(v)o(ersion)i(date)10 b Fe(.)c(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)23 b Ff(7)1015 958 y(Op)q(erators,)14 b(b)q(o)q(olean)s Fe(.)8 b(.)e(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)16 b Ff(4)1015 1016 y(Op)q(erators,)e(decremen)o(t)8 b Fe(.)f(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)21 b Ff(4)1015 1074 y(Op)q(erators,)14 b(incremen)o(t)f Fe(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)h(.)f(.)24 b Ff(4)1015 1132 y(OS/2)14 b(supp)q(ort)6 b Fe(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(7)1015 1250 y Fo(R)1015 1316 y Ff(Return)14 b(lists,)g(v)n(ariable-leng)q(th)6 b Fe(.)j(.)d(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)19 b Ff(6)1015 1434 y Fo(S)1015 1501 y Ff(Short-circuit)d(b)q(o)q(olean)f(op)q(erators)t Fe(.)7 b(.)f(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)17 b Ff(4)1015 1559 y(Source)d(co)q(de)5 b Fe(.)i(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)18 b Ff(6)1015 1617 y(Structures)11 b Fe(.)6 b(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)22 b Ff(2)1015 1734 y Fo(U)1015 1801 y Ff(Un)o(wind-protect)7 b Fe(.)h(.)e(.)g(.)h(.)f(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)20 b Ff(5)1015 1918 y Fo(V)1015 1985 y Ff(V)m(ariable)15 b(name)e(completion)5 b Fe(.)k(.)d(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)18 b Ff(2)1015 2043 y(V)m(ariable-length)e(argumen)o(t)e(lists)t Fe(.)8 b(.)e(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)h(.)f(.)17 b Ff(5)1015 2101 y(V)m(ariable-length)f (return)e(lists)6 b Fe(.)h(.)g(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)19 b Ff(6)1015 2159 y(V)l(AX)t Fe(.)5 b(.)h(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) g(.)g(.)g(.)17 b Ff(7)1015 2217 y(VMS)d(supp)q(ort)8 b Fe(.)f(.)f(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)h(.)f(.)g(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)21 b Ff(7)p eop %%Page: -1 14 -1 13 bop 1937 -58 a Fp(i)0 183 y Fl(T)-7 b(able)15 b(of)g(Con)n(ten)n (ts)0 358 y Fo(1)67 b(What)23 b(is)g(Octa)n(v)n(e?)18 b Fc(.)10 b(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)41 b Fo(1)0 498 y(2)67 b(What's)22 b(new)g(in)i(v)n(ersion)f(1.1.0) e(of)g(Octa)n(v)n(e)10 b Fc(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)32 b Fo(1)0 638 y(3)67 b(What)23 b(features)e(are)i(unique)h(to) e(Octa)n(v)n(e?)11 b Fc(.)e(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h (.)g(.)33 b Fo(2)149 716 y Fp(3.1)45 b(Command)15 b(and)g(v)m(ariable)i (name)e(completion)6 b Fb(.)j(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)21 b Fp(2)149 778 y(3.2)45 b(Command)15 b(history)10 b Fb(.)d(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)24 b Fp(2)149 840 y(3.3)45 b(Data)14 b(structures)e Fb(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)26 b Fp(2)149 902 y(3.4)45 b(Short-circuit)16 b(b)q(o)q(olean)h(op)q(erators)7 b Fb(.)g(.)g(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.) h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)22 b Fp(4)149 965 y(3.5)45 b(Incremen)o(t)16 b(and)f(decremen)o(t)h(op)q(erators)7 b Fb(.)f(.)i(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fp(4)149 1027 y(3.6)45 b(Un)o(wind-protect)13 b Fb(.)7 b(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fp(5)149 1089 y(3.7)45 b(V)l(ariable-length)17 b(argumen)o(t)e(lists)7 b Fb(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)21 b Fp(5)149 1151 y(3.8)45 b(V)l(ariable-length)17 b(return)e(lists)7 b Fb(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)21 b Fp(6)149 1214 y(3.9)45 b(Built-in)18 b(ODE)d(and)g(D)o(AE)g(solv)o(ers)8 b Fb(.)g(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)23 b Fp(6)0 1338 y Fo(4)67 b(What)23 b(do)r(cumen)n(tation)e(exists)i(for)f (Octa)n(v)n(e?)12 b Fc(.)e(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)34 b Fo(6)0 1478 y(5)67 b(Obtaining)24 b(Source)e(Co)r(de)c Fc(.)10 b(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g (.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)40 b Fo(6)149 1556 y Fp(5.1)45 b(Ho)o(w)15 b(do)g(I)g(get)g(a)g(cop)o(y)g(of)g(Octa)o (v)o(e)f(for)h(Unix?)10 b Fb(.)f(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.) h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)24 b Fp(6)149 1618 y(5.2)45 b(Ho)o(w)15 b(do)g(I)g(get)g(a)g(cop)o(y)g(of) g(Octa)o(v)o(e)f(for)h(\(some)g(other)f(platform\)?)d Fb(.)c(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)25 b Fp(7)149 1681 y(5.3)45 b(What)15 b(is)g(the)g(latest)g(v)o(ersion)h(of)f(Octa)o(v)o (e)c Fb(.)d(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f (.)h(.)g(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)26 b Fp(7)0 1805 y Fo(6)67 b(Installation)24 b(Issues)d(and)i(Problems)8 b Fc(.)g(.)i(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.) g(.)g(.)30 b Fo(7)149 1883 y Fp(6.1)45 b(What)15 b(else)h(do)f(I)g (need?)c Fb(.)e(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)g(.)f(.)h(.)f (.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.) f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)f(.)h(.)25 b Fp(8)149 1945 y(6.2)45 b(Can)15 b(I)h(compile)g(Octa)o(v)o(e)f(with)g(another)g (C)p Fm(++)g Fp(compiler?)10 b Fb(.)f(.)e(.)h(.)f(.)h(.)f(.)h(.)f(.)h (.)f(.)h(.)g(.)f(.)h(.)f(.)24 b Fp(8)0 2070 y Fo(7)67 b(Comm)n(on)20 b(problems)14 b Fc(.)8 b(.)i(.)g(.)f(.)h(.)g(.)g(.)g(.)g (.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.) g(.)g(.)g(.)g(.)g(.)f(.)36 b Fo(8)0 2210 y(8)67 b(Getting)23 b(additional)h(help)19 b Fc(.)10 b(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.) 39 b Fo(8)0 2350 y(9)67 b(I)22 b(think)j(I)d(ha)n(v)n(e)h(found)g(a)f (bug)h(in)g(Octa)n(v)n(e.)6 b Fc(.)j(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.) f(.)h(.)g(.)g(.)28 b Fo(9)0 2490 y(10)66 b(P)n(orting)24 b(programs)c(from)g Fa(Ma)l(tlab)i Fo(to)g(Octa)n(v)n(e)5 b Fc(.)10 b(.)f(.)h(.)g(.)g(.)g(.)g(.)27 b Fo(9)0 2630 y(App)r(endix)d(A)67 b(Concept)22 b(Index)7 b Fc(.)k(.)f(.)g(.)g(.)g(.) g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g(.)g(.)f(.)h(.)g(.)g(.)g(.)g(.)g(.)g (.)g(.)29 b Fo(10)p eop %%Trailer end userdict /end-hook known{end-hook}if %%EOF octave-1.1.0/doc/refcard.dvi100666 415 17 71534 5705320136 14051 0ustar jweusers÷ƒ’À;è TeX output 1995.01.12:1534‹ÿÿÿÿ  õ ‘Æ/  ý½× ï landscapeŸ ó2ÂÖN  cmbx12ÝOcta• v“e›U>Quic“k˜Reference‘ f$ó¹Aa¨cmr6¯Octa•Î9v“e˜V‘ÿj«ersion˜1.0ŽŸGóò"V cmbx10ÂStarting‘U>Octa•®9v“eŽ© óßCÊscmtt8ÊoctaveŽŽŽ‘HüÌóÙ“ Rcmr7®start›U>in•Èãteractiv“e˜Octa“v“e˜sessionŽŽŽŽ¤ Êoctave‘U>ó't}\Êcmti7Ò leŽŽŽ‘HüÌ®run›U>Octa•Èãv“e˜on˜commands˜in˜Ò leŽŽŽŽ¡Êoctave‘U>--helpŽŽŽ‘HüÌ®describ7e–U>command“line“optionsŽŽŽŽŸ¸ãÂStopping‘U>Octa•®9v“eŽ¦Êquit–U>®or“ÊexitŽŽŽ‘HüÌ®exit‘U>Octa•Èãv“eŽŽŽŽŸ ÊINTERRUPTŽŽŽ‘HüÌ®(Òe.g.‘ÊC-c®)–U>terminate“currenÈãt“commandŽ¡‘MüÌand–U>return“to“top-levÈãel“promptŽŽŽŽŸN8ÂGetting‘U>HelpŽ¦ÊhelpŽŽŽ‘HüÌ®list–U>all“commands“and“built-in“v‘ÇariablesŽŽŽŽ¡Êhelp‘U>Òc–ÁommandŽŽŽ‘HüÌ®brie y–U>describ7e“Òc–ÁommandŽŽŽŽ¡Êhelp‘U>-iŽŽŽ‘HüÌ®use–U>Info“to“brošÈãwse“Octa˜v˜e“man˜ualŽŽŽŽ¡Êhelp–U>-i“Òc–ÁommandŽŽŽ‘HüÌ®searcšÈãh–U>for“Òc–Áommand‘û¤®in“Octa˜v˜e“man˜ualŽŽŽŽŸ¸ãÂMotion–U>in“InfoŽ¦ÊSPC–U>®or“ÊC-vŽŽŽ‘HüÌ®scroll–U>forwÈãard“one“screenfulŽŽŽŽ¡ÊDEL–U>®or“ÊM-vŽŽŽ‘HüÌ®scroll›U>bac•Èãkw“ard˜one˜screenfulŽŽŽŽ¡ÊC-lŽŽŽ‘HüÌ®redrašÈãw–U>the“displa˜yŽŽŽŽŸN8ÂNoQÇde–U>Selection“in“InfoŽ¦ÊnŽŽŽ‘HüÌ®select–U>the“next“no7deŽŽŽŽ¡ÊpŽŽŽ‘HüÌ®select–U>the“previous“no7deŽŽŽŽ¡ÊuŽŽŽ‘HüÌ®select–U>the“`up'“no7deŽŽŽŽ¡ÊtŽŽŽ‘HüÌ®select–U>the“`top'“no7deŽŽŽŽ¡ÊdŽŽŽ‘HüÌ®select–U>the“directory“no7deŽŽŽŽ¡Ê<ŽŽŽ‘HüÌ®select–U>the“ rst“no7de“in“the“currenÈãt“ leŽŽŽŽ¡Ê>ŽŽŽ‘HüÌ®select–U>the“last“no7de“in“the“currenÈãt“ leŽŽŽŽ¡ÊgŽŽŽ‘HüÌ®reads–U>the“name“of“a“no7de“and“selects“itŽŽŽŽ¡ÊC-x‘U>kŽŽŽ‘HüÌ®kills–U>the“currenÈãt“no7deŽŽŽŽŸÂSearc®9hing–U>in“InfoŽ¦ÊsŽŽŽ‘HüÌ®searcÈãh–U>for“a“stringŽŽŽŽ¡ÊC-sŽŽŽ‘HüÌ®searc•Èãh›U>forw“ard˜incremen“tallyŽŽŽŽ¡ÊC-rŽŽŽ‘HüÌ®searc•Èãh›U>bac“kw“ard˜incremen“tallyŽŽŽŽ¡ÊiŽŽŽ‘HüÌ®searcÈãh–U>index“&“go“to“correspš7onding“no˜deŽŽŽŽ¡Ê,ŽŽŽ‘HüÌ®go–U>to“next“matcÈãh“from“last“`i'“commandŽŽŽŽŸN8ÂCommand-Line–U>Cursor“MotionŽ¦ÊC-bŽŽŽ‘HüÌ®mo•Èãv“e›U>bac“k˜one˜c“haracterŽŽŽŽ¡ÊC-fŽŽŽ‘HüÌ®mo•Èãv“e›U>forw“ard˜one˜c“haracterŽŽŽŽ¡ÊC-aŽŽŽ‘HüÌ®mo•Èãv“e–U>the“the“start“of“the“lineŽŽŽŽ¡ÊC-eŽŽŽ‘HüÌ®mo•Èãv“e–U>to“the“end“of“the“lineŽŽŽŽ¡ÊM-fŽŽŽ‘HüÌ®mo•Èãv“e›U>forw“ard˜a˜w“ordŽŽŽŽ¡ÊM-bŽŽŽ‘HüÌ®mo•Èãv“e›U>bac“kw“ard˜a˜w“ordŽŽŽŽ¡ÊC-lŽŽŽ‘HüÌ®clear–U>screen,“reprinšÈãting“curren˜t“line“at“topŽŽŽŽŸN8ÂInserting–U>or“Changing“T‘ÿ «extŽ¦ÊM-TABŽŽŽ‘HüÌ®insert–U>a“tab“cÈãharacterŽŽŽŽ¡ÊDELŽŽŽ‘HüÌ®delete–U>cÈãharacter“to“the“left“of“the“cursorŽŽŽŽ¡ÊC-dŽŽŽ‘HüÌ®delete–U>cÈãharacter“under“the“cursorŽŽŽŽ¡ÊC-vŽŽŽ‘HüÌ®add–U>the“next“cšÈãharacter“v˜erbatimŽŽŽŽ¡ÊC-tŽŽŽ‘HüÌ®transpš7ose–U>cÈãharacters“at“the“p˜oinÈãtŽŽŽŽ¡ÊM-tŽŽŽ‘HüÌ®transpš7ose–U>wÈãords“at“the“p˜oinÈãtŽŽŽŽŸðóKñ`y cmr10«[–U>]“¯surround“optional“argumen•Î9ts‘ Þ...‘sho“w–U>one“or“more“argumenÎ9tsŽŸ @‘,ÐCop•Î9yrigh“t–U>1994,“John“W.“Eaton‘ª PšÎ9ermissions“on“bac˜kŽŽŽ ý¿× ’´™š„šŽ @(÷’´™š„šŽŽ ýÇ× ’Ã'^ÂKilling–U>and“Y‘ÿ «ankingŽ© ’Ã'^ÊC-kŽŽŽ’ $*®kill–U>to“the“end“of“the“lineŽŽŽŽ¤ ’Ã'^ÊC-yŽŽŽ’ $*®yšÈãank–U>the“most“recen˜tly“killed“textŽŽŽŽ¡’Ã'^ÊM-dŽŽŽ’ $*®kill–U>to“the“end“of“the“currenšÈãt“w˜ordŽŽŽŽ¡’Ã'^ÊM-DELŽŽŽ’ $*®kill–U>the“wÈãord“b7ehind“the“cursorŽŽŽŽ¡’Ã'^ÊM-yŽŽŽ’ $*®rotate–U>the“kill“ring“and“yÈãank“the“new“topŽŽŽŽŸ¸ã’Ã'^ÂCommand–U>Completion“and“HistoryŽ¦’Ã'^ÊTABŽŽŽ’ $*®complete–U>a“command“or“v‘Çariable“nameŽŽŽŽ¡’Ã'^ÊM-?ŽŽŽ’ $*®list–U>p7ossible“completionsŽŽŽŽ¡’Ã'^ÊRETŽŽŽ’ $*®enšÈãter–U>the“curren˜t“lineŽŽŽŽ¡’Ã'^ÊC-pŽŽŽ’ $*®mo•Èãv“e–U>`up'“through“the“history“listŽŽŽŽ¡’Ã'^ÊC-nŽŽŽ’ $*®mo•Èãv“e›U>`do“wn'˜through˜the˜history˜listŽŽŽŽ¡’Ã'^ÊM-<ŽŽŽ’ $*®mo•Èãv“e–U>to“the“ rst“line“in“the“historyŽŽŽŽ¡’Ã'^ÊM->ŽŽŽ’ $*®mo•Èãv“e–U>to“the“last“line“in“the“historyŽŽŽŽ¡’Ã'^ÊC-rŽŽŽ’ $*®searc•Èãh›U>bac“kw“ard˜in˜the˜history˜listŽŽŽŽ¡’Ã'^ÊC-sŽŽŽ’ $*®searc•Èãh›U>forw“ard˜in˜the˜history˜listŽŽŽŽŸ Üq’Ã'^Êhistory–U>«[®-q«]“[ÒN‘ <«]ŽŽŽ’ $*®list–U>ÒN‘^z®previous“history“lines,“omittingŽ¡’$*history›U>n•Èãum“b7ers˜if˜Ê-qŽŽŽŽŸG’Ã'^history–U>-w“«[Ò le«]ŽŽŽ’ $*®write–U>history“to“Ò le‘×è®(“Ê/.octave‘‚Ž‰ffŒÐŽ‘^hist“®ifŽ¡’$*no‘U>Ò le‘×è®argumenÈãt)ŽŽŽŽŸ@’Ã'^Êhistory–U>-r“«[Ò le«]ŽŽŽ’ $*®read–U>history“from“Ò le‘×è®(“Ê/.octave‘‚Ž‰ffŒÐŽ‘^hist“®ifŽ¡’$*no‘U>Ò le‘×è®argumenÈãt)ŽŽŽŽŸ£Ž’Ã'^Êedit‘‚Ž‰ffŒÐŽ‘^history‘U>ÒlinesŽŽŽ’ $*®edit–U>and“then“run“previous“commandsŽ¡’$*from–U>the“history“listŽŽŽŽŸ?ÿ’Ã'^Êrun‘‚Ž‰ffŒÐŽ‘^history‘U>ÒlinesŽŽŽ’ $*®run–U>previous“commands“from“the“historyŽ¡’$*listŽŽŽŽŸ€’˧f«[Òb•–Áe“g‘™l«]‘U>[Òend‘¦f«]ŽŽŽ’ $*®Sp7ecify–U>the“ rst“and“last“historyŽ¡’$*commands–U>to“edit“or“run.ŽŽŽŽŸ,TŸå’Í'_If›U>Òb•–Áe“g‘is˜greater˜than˜Òend®,˜revÈãerse˜the˜list˜of˜commandsŽ¡’Í'_b7efore–U>editing.‘If“Òend‘û¤®is“omitted,“select“commands“fromŽ¡’Í'_Òb•–Áe“g‘to–U>the“end“of“the“history“list.‘If“b7oth“argumenÈãts“areŽ¡’Í'_omitted,–U>edit“the“previous“item“in“the“history“list.ŽŽŽŽŸ’Ã'^ÂShell‘U>CommandsŽ¦’Ã'^Êcd‘U>ÒdirŽŽŽ’ $*®c•Èãhange›U>w“orking˜directory˜to˜ÒdirŽŽŽŽ¡’Ã'^ÊpwdŽŽŽ’ $*®prin•Èãt›U>w“orking˜directoryŽŽŽŽŸ G’Ã'^Êls‘U>«[Òoptions«]ŽŽŽ’ $*®prinÈãt–U>directory“listingŽŽŽŽŸ 9’Ã'^Êgetenv‘U>(ÒstringÊ)ŽŽŽ’ $*®return–U>v‘Çalue“of“named“en•Èãvironmen“tŽ¡’$*v‘ÇariableŽŽŽŽŸŽ9’Ã'^Êshell‘‚Ž‰ffŒÐŽ‘^cmd‘U>(ÒcmdÊ)ŽŽŽ’ $*®execute–U>arbitrary“shell“command“stringŽŽŽŽŸN8’Ã'^ÂMatricesŽŸ9brac•Èãk“ets˜delimit˜literal˜matrices.‘Commas˜separateŽ¡’Ã'^elemenšÈãts–U>on“the“same“ro˜w.‘Semicolons“separate“ro˜ws.Ž¡’Ã'^Commas–U>mašÈãy“b7e“replaced“b˜y“spaces,“and“semicolons“ma˜y“b7eŽ¡’Ã'^replaced–U>bšÈãy“one“or“more“newlines.‘Elemen˜ts“of“a“matrix“ma˜yŽ¡’Ã'^b7e–U>arbitrary“expressions,“proÈãvided“that“all“the“dimensionsŽ¡’Ã'^agree.ŽŽŽŽ¡’Ã'^Ê[–U>ÒxÊ,“ÒyÊ,“...‘]ŽŽŽ’ $*®enšÈãter–U>a“ro˜w“v˜ectorŽŽŽŽ¡’Ã'^Ê[–U>ÒxÊ;“ÒyÊ;“...‘]ŽŽŽ’ $*®enšÈãter–U>a“column“v˜ectorŽŽŽŽŸ 1Æ’Ã'^Ê[–U>ÒwÊ,“ÒxÊ;“ÒyÊ,“Òz“Ê]ŽŽŽ’ $*®enÈãter–U>a“2ó !",š cmsy10·®2“matrixŽŽŽŽŸ8ã’Ã'^ÂRangesŽ¦’Ã'^Òb–Áase‘U>Ê:‘ÒlimitŽŽŽŽ¡’Ã'^b–Áase–U>Ê:›Òincr“Ê:˜ÒlimitŽŽŽŽŸŸî’Ã'^®Spš7ecify–U>a“range“of“v‘Çalues“b˜eginning“with“Òb–Áase‘×è®with“noŽ¡’Ã'^elemenÈãts–U>greater“than“Òlimit®.‘If“it“is“omitted,“the“defaultŽ¡’Ã'^v‘Çalue–U>of“Òincr‘"®is“1.‘NegativšÈãe“incremen˜ts“are“p7ermitted.ŽŽŽŽŽŽŽŽ ý¿× ’±‘ì„šŽ @(÷’±‘ì„šŽŽ ýÇ× ’À°ÂStrings–U>and“Common“EscapQÇe“SequencesŽŸïŸó`å’À°®A–U>Òstring“c–Áonstant‘ûÒ®consists“of“a“sequence“of“cÈãharactersŽŸ ’À°enclosed–U>in“either“double-quote“or“single-quote“marks.ŽŽŽŽ¤ ’À°Ê\\ŽŽŽ’ |®a–U>literal“bacÈãkslashŽŽŽŽ¡’À°Ê\"ŽŽŽ’ |®a–U>literal“double-quote“cÈãharacterŽŽŽŽ¡’À°Ê\'ŽŽŽ’ |®a–U>literal“single-quote“cÈãharacterŽŽŽŽ¡’À°Ê\nŽŽŽ’ |®newline,–U>ASCIš7I“co˜de“10ŽŽŽŽ¡’À°Ê\tŽŽŽ’ |®horizonÈãtal–U>tab,“ASCIš7I“co˜de“9ŽŽŽŽŸN8’À°ÂIndex‘U>ExpressionsŽŸ ’À°Òvar‘U>Ê(ÒidxÊ)ŽŽŽ’ |®select–U>elemenšÈãts“of“a“v˜ectorŽŽŽŽ¡’À°Òvar–U>Ê(Òidx1Ê,“Òidx2Ê)ŽŽŽ’ |®select–U>elemenÈãts“of“a“matrixŽŽŽŽ¡’ÈŸ¸Òsc–ÁalarŽŽŽ’ |®select–U>roÈãw“(column)“corresp7onding“toŽ¡’|Òsc–ÁalarŽŽŽŽ©@’ÈŸ¸ve–ÁctorŽŽŽ’ |®select–U>roÈãws“(columns)“corresp7onding“toŽ¡’|the–U>elemenÈãts“of“Òve–ÁctorŽŽŽŽ¦’ÈŸ¸r–ÁangeŽŽŽ’ |®select–U>roÈãws“(columns)“corresp7onding“toŽ¡’|the–U>elemenÈãts“of“Òr–ÁangeŽŽŽŽŸœq’ÈŸ¸Ê:ŽŽŽ’ |®select–U>all“roÈãws“(columns)ŽŽŽŽŸ±Ç’À°ÂGlobal‘U>V‘ÿ «ariablesŽ© ’À°Êglobal–U>Òvar1“Ê...ŽŽŽ’ |®Declare–U>v‘Çariables“global.ŽŽŽŽŸ%dpŸå’ʱGlobal–U>v‘Çariables“maÈãy“bš7e“accessed“inside“the“b˜o˜dy“of“aŽ¡’ʱfunction–U>without“haÈãving“to“b7e“passed“in“the“functionŽ¡’ʱparameter–U>list“proÈãvided“they“are“also“declared“globalŽ¡’ʱwithin–U>the“function.ŽŽŽŽŸ’À°ÂSelected–U>Built-in“V‘ÿ «ariablesŽ¦’À°ÊEDITORŽŽŽ’ |®editor–U>to“use“with“Êedit‘‚Ž‰ffŒÐŽ‘^historyŽŽŽŽ¡’À°Inf,‘U>NaNŽŽŽ’ |®IEEE–U>in nitÈãy‘ÿZª,“NaNŽŽŽŽ¡’À°ÊLOADPATHŽŽŽ’ |®path–U>to“searcÈãh“for“function“ lesŽŽŽŽ¡’À°ÊPAGERŽŽŽ’ |®program–U>to“use“to“paginate“outputŽŽŽŽ¡’À°ÊansŽŽŽ’ |®last–U>result“not“explicitly“assignedŽŽŽŽ¡’À°ÊepsŽŽŽ’ |®macÈãhine‘U>precisionŽŽŽŽ¡’À°ÊpiŽŽŽ’ |ó  b> cmmi10±ŽŽŽŽ¡’À°ÊrealmaxŽŽŽ’ |®maxim•Èãum›U>represen“table˜v‘ÇalueŽŽŽŽ¡’À°ÊrealminŽŽŽ’ |®minim•Èãum›U>represen“table˜v‘ÇalueŽŽŽŽŸ’À°Êautomatic‘‚Ž‰ffŒÐŽ‘^replotŽŽŽ’"gý®automatically–U>redraÈãw“plotsŽŽŽŽ¡’À°Êdo‘‚Ž‰ffŒÐŽ–^fortran‘‚Ž‰ffŒÐŽ“indexingŽŽŽ’"gý®F‘ÿZªortran-stÈãyle–U>indexing“of“matricesŽŽŽŽ¡’À°Êimplicit‘‚Ž‰ffŒÐŽ–^str‘‚Ž‰ffŒÐŽ“to‘‚Ž‰ffŒÐŽ“num‘‚Ž‰ffŒÐŽ“okŽŽŽ’"gý®allošÈãw–U>strings“to“b7ecome“n˜um˜b7ersŽŽŽŽ¡’À°Êoutput‘‚Ž‰ffŒÐŽ–^max‘‚Ž‰ffŒÐŽ“field‘‚Ž‰ffŒÐŽ“widthŽŽŽ’"gý®maxim•Èãum›U>n“umeric˜ eld˜widthŽŽŽŽ¡’À°Êoutput‘‚Ž‰ffŒÐŽ‘^precisionŽŽŽ’"gý®min–U>signi canšÈãt“ gures“displa˜y˜edŽŽŽŽ¡’À°Êpage‘‚Ž‰ffŒÐŽ–^screen‘‚Ž‰ffŒÐŽ“outputŽŽŽ’"gý®conÈãtrol–U>whether“output“is“pagedŽŽŽŽ¡’À°Êprefer‘‚Ž‰ffŒÐŽ–^column‘‚Ž‰ffŒÐŽ“vectorsŽŽŽ’"gý®create–U>column“všÈãectors“b˜y“defaultŽŽŽŽ¡’À°Êresize‘‚Ž‰ffŒÐŽ–^on‘‚Ž‰ffŒÐŽ“range‘‚Ž‰ffŒÐŽ“errorŽŽŽ’"gý®automatic–U>resizing“of“matricesŽŽŽŽ¡’À°Êsave‘‚Ž‰ffŒÐŽ‘^precisionŽŽŽ’"gý®digits–U>stored“bÈãy“Êsave“®commandŽŽŽŽ¡’À°Êsilent‘‚Ž‰ffŒÐŽ‘^functionsŽŽŽ’"gý®suppress–U>output“from“functionsŽŽŽŽ¡’À°Êwarn‘‚Ž‰ffŒÐŽ–^divide‘‚Ž‰ffŒÐŽ“by‘‚Ž‰ffŒÐŽ“zeroŽŽŽ’"gý®suppress–U>divide“bÈãy“zero“errorsŽŽŽŽŸŸü’À°Êcommas‘‚Ž‰ffŒÐŽ–^in‘‚Ž‰ffŒÐŽ“literal‘‚Ž‰ffŒÐŽ“matrixŽŽŽŽ© 8âŸø£’ʱ®conÈãtrol–U>handling“of“spaces“in“matricesŽŽŽŽ¡Ÿü8ä’À°Êignore‘‚Ž‰ffŒÐŽ–^function‘‚Ž‰ffŒÐŽ“time‘‚Ž‰ffŒÐŽ“stampŽŽŽŽ¦Ÿø£’ʱ®ignore–U>cÈãhanges“in“function“ les“during“sessionŽŽŽŽ¡Ÿü8ä’À°Êok‘‚Ž‰ffŒÐŽ–^to‘‚Ž‰ffŒÐŽ“lose‘‚Ž‰ffŒÐŽ“imaginary‘‚Ž‰ffŒÐŽ“partŽŽŽŽ¦Ÿø£’ʱ®allošÈãw–U>complex“to“real“con˜v˜ersionŽŽŽŽ¡Ÿü8ä’À°Êprefer‘‚Ž‰ffŒÐŽ–^zero‘‚Ž‰ffŒÐŽ“one‘‚Ž‰ffŒÐŽ“indexingŽŽŽŽ¦Ÿø£’ʱ®if–U>amšÈãbiguous,“prefer“0-1“st˜yle“indexingŽŽŽŽŽŽŽŽŸËÌ)’®Š>„šŽ @(÷’®Š>„šŽŽŸÓÌ)’½ÂArithmetic–U>and“Incremen®9t“OpQÇeratorsŽŸ ’½Òx–U>Ê+“ÒyŽŽŽ’ήadditionŽŽŽŽ¤ ’½Òx–U>Ê-“ÒyŽŽŽ’ήsubtractionŽŽŽŽ¡’½Òx–U>Ê*“ÒyŽŽŽ’ήmatrix‘U>mÈãultiplicationŽŽŽŽ¡’½Òx–U>Ê.*“ÒyŽŽŽ’ήelemen•Èãt›U>b“y˜elemen“t˜m“ultiplicationŽŽŽŽ¡’½Òx–U>Ê/“ÒyŽŽŽ’ήrighšÈãt–U>division,“conceptually“equiv‘Çalen˜t“toŽ¡’ ÎÊ(inverse–U>(y')“*“x')'ŽŽŽŽ©UU’½Òx–U>Ê./“ÒyŽŽŽ’ήelemen•Èãt›U>b“y˜elemen“t˜righ“t˜divisionŽŽŽŽ¡’½Òx–U>Ê\“ÒyŽŽŽ’ήleft–U>division,“conceptually“equiv‘ÇalenÈãt“toŽ¡’ ÎÊinverse–U>(x)“*“yŽŽŽŽ¦’½Òx–U>Ê.\“ÒyŽŽŽ’ήelemen•Èãt›U>b“y˜elemen“t˜left˜divisionŽŽŽŽ¡’½Òx–U>Ê^“ÒyŽŽŽ’ήpš7o•Èãw“er‘U>op˜eratorŽŽŽŽ¡’½Òx–U>Ê.^“ÒyŽŽŽ’ήelemen•Èãt›U>b“y˜elemen“t˜p7o“w“er˜op7eratorŽŽŽŽ¡’½Ê-‘U>ÒxŽŽŽ’ήnegationŽŽŽŽ¡’½Ê+‘U>ÒxŽŽŽ’ήunary–U>plus“(a“no-op)ŽŽŽŽ¡’½Òx‘U>Ê'ŽŽŽ’ήcomplex–U>conjugate“transp7oseŽŽŽŽ¡’½Òx‘U>Ê.'ŽŽŽ’ήtransp7oseŽŽŽŽ¡’½Ê++–U>Òx‘€®(Ê--“Òx®)ŽŽŽ’Îincremen•Èãt›U>(decremen“t)˜Òx®,˜return˜ÒnewŽ¡’ ήv‘ÇalueŽŽŽŽŸ@’½Òx–U>Ê++‘€®(Òx“Ê--®)ŽŽŽ’Îincremen•Èãt›U>(decremen“t)˜Òx®,˜return˜Òold‘û¤®v‘ÇalueŽŽŽŽŸ±Ç’½ÂAssignmen®9t‘U>ExpressionsŽŸ ’½Òvar–U>Ê=“ÒexprŽŽŽ’ήassign–U>expression“to“v‘ÇariableŽŽŽŽ¡’½Òvar–U>Ê(ÒidxÊ)“=“ÒexprŽŽŽ’ήassign–U>expression“to“indexed“v‘ÇariableŽŽŽŽ©N8’½ÂComparison–U>and“BošQÇolean“Op˜eratorsŽŸ¯ýŸó`å’½®These–U>op7erators“wšÈãork“on“an“elemen˜t-b˜y-elemen˜t“basis.‘BothŽ¡’½argumenšÈãts–U>are“alw˜a˜ys“ev‘Çaluated.ŽŽŽŽ¡’½Òx–U>Ê<“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“less“than“ÒyŽŽŽŽ¡’½x–U>Ê<=“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“less“than“or“equal“to“ÒyŽŽŽŽ¡’½x–U>Ê==“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“greater“than“ÒyŽŽŽŽ¡’½x–U>Ê>=“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“greater“than“or“equal“to“ÒyŽŽŽŽ¡’½x–U>Ê>“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“equal“to“ÒyŽŽŽŽ¡’½x–U>Ê!=“ÒyŽŽŽ’ήtrue–U>if“Òx‘0q®is“not“equal“to“ÒyŽŽŽŽ¡’½x–U>Ê&“ÒyŽŽŽ’ήtrue–U>if“b7oth“Òx‘0q®and“Òy‘are“trueŽŽŽŽ¡’½Òx–U>Ê|“ÒyŽŽŽ’ήtrue–U>if“at“least“one“of“Òx‘0q®or“Òy‘is“trueŽŽŽŽ¡’½Ê!‘Òb•–Áo“olŽŽŽ’ήtrue›U>Òb•–Áo“ol‘û¤®is˜falseŽŽŽŽŸ’½ÂShort-circuit–U>BošQÇolean“Op˜eratorsŽŸ*¯ýŸá`å’½®Opš7erators–U>ev‘Çaluate“left-to-righÈãt,“exp˜ecting“scalar“op˜erands.Ž¡’½Op7erands–U>are“only“ev‘Çaluated“if“necessary‘ÿZª,“stopping“onceŽ¡’½o•Èãv“erall–U>truth“v‘Çalue“can“bš7e“determined.‘Op˜erands“areŽ¡’½con•Èãv“erted–U>to“scalars“bÈãy“applying“the“Êall“®function.ŽŽŽŽ¡’½Òx–U>Ê&&“ÒyŽŽŽ’ήtrue–U>if“b7oth“Òx‘0q®and“Òy‘are“trueŽŽŽŽ¡’½Òx–U>Ê||“ÒyŽŽŽ’ήtrue–U>if“at“least“one“of“Òx‘0q®or“Òy‘is“trueŽŽŽŽ¦’½ÂOpQÇerator‘U>PrecedenceŽŸïŸó`å’½®Here–U>is“a“table“of“the“op7erators“in“Octa•Èãv“e,–U>in“order“ofŽ¡’½increasing‘U>precedence.ŽŽŽŽ¡’½Ê;‘ª|,ŽŽŽ’ήstatemenÈãt‘U>separatorsŽŽŽŽ¡’½Ê=ŽŽŽ’ήassignmenšÈãt,–U>groups“left“to“righ˜tŽŽŽŽ¡’½Ê||‘ª|&&ŽŽŽ’ήlogical–U>\or"“and“\and"ŽŽŽŽ¡’½Ê|‘ª|&ŽŽŽ’ήelemenÈãt-wise–U>\or"“and“\and"ŽŽŽŽ¡’½Ê<–U><=“==“>=“>“!=ŽŽŽ’ήrelational‘U>op7eratorsŽŽŽŽ¡’½Ê:ŽŽŽ’ήcolonŽŽŽŽ¡’½Ê+‘ª|-ŽŽŽ’ήaddition–U>and“subtractionŽŽŽŽ¡’½Ê*–U>/“\–ª|.*“./“.\ŽŽŽ’ήmÈãultiplication–U>and“divisionŽŽŽŽ¡’½Ê'‘ª|.'ŽŽŽ’ήtransp7oseŽŽŽŽ¡’½Ê+–ª|-“++“--“!ŽŽŽ’ήunary–U>minšÈãus,“incremen˜t,“logical“\not"ŽŽŽŽ¡’½Ê^‘ª|.^ŽŽŽ’ήexp7onenÈãtiationŽŽŽŽŽŽŒ‹*  õ  ýÇ× ‘Æ/ ÂStatemen®9tsŽŸŸü£‘Æ/ Êfor–U>Òidenti er“Ê=“Òexpr“stmt-list“ÊendforŽŽŽŽŸùÅŸü£Ÿî‘Ð/ ®Execute–U>Òstmt-list“®once“for“eacÈãh“column“of“Òexpr®.‘TheŽ¤ ‘Ð/ vš‘Çariable–U>Òidenti er“®is“set“to“the“v˜alue“of“the“currenÈãt“columnŽ¡‘Ð/ during–U>eacÈãh“iteration.ŽŽŽŽŽŽ¤ ¡ŸýUV‘Æ/ Êwhile–U>(Òc–ÁonditionÊ)“Òstmt-list“ÊendwhileŽŽŽŽ¡Ÿþ‘Ð/ ®Execute–U>Òstmt-list“®while“Òc–Áondition“®is“true.ŽŽŽŽŽŽ¡¡Ÿü£‘Æ/ ÊbreakŽŽ‘®exit–U>innermost“lo7opŽŽŽŽŽŽ¡Ÿü£‘Æ/ ÊcontinueŽŽ‘®go–U>to“bš7eginning“of“innermost“lo˜opŽŽŽŽŽŽ¡Ÿü£‘Æ/ ÊreturnŽŽ‘®return–U>to“calling“functionŽŽŽŽŽŽ¡© Ÿû€‘Æ/ Êif–U>(Òcš–ÁonditionÊ)“Òif-b˜o˜dy“«[Êelse“Òelse-b˜o˜dy«]“ÊendifŽŽŽŽŸùÅŸü£Ÿ÷‘Ð/ ®Execute›U>Òif-b•–Áo“dy˜®if˜Òc“ondition˜®is˜true,˜otherwise˜execute˜Òelse-Ž¡‘Ð/ b•–Áo“dy®.ŽŽŽŽŽŽ¦Ÿû€‘Æ/ Êif–U>(Òcš–ÁonditionÊ)“Òif-b˜o˜dy“«[Êelseif“®(Òc˜ondition®)“Òelseif-b˜o˜dy«]“ÊendifŽŽŽŽŸùÅŸü£Ÿî‘Ð/ ®Execute›U>Òif-b•–Áo“dy˜®if˜Òc“ondition˜®is˜true,˜otherwise˜execute˜theŽ¡‘Ð/ Òelseif-b•–Áo“dy–U>®corresp7onding“to“the“ rst“Êelseif“®condition“thatŽ¡‘Ð/ is–U>true,“otherwise“execute“Òelse-b•–Áo“dy®.ŽŽŽŽŽŽŸ¤qŸþŸ÷‘Ð/ An•Èãy›U>n“um“b7er˜of˜Êelseif˜®clauses˜ma“y˜app7ear˜in˜an˜ÊifŽ¡‘Ð/ ®statemenÈãt.ŽŽŽŽŽŽ¡¡Ÿü8ä‘Æ/ Êunwind‘‚Ž‰ffŒÐŽ‘^protect›U>Òb•–Áo“dy˜Êunwind‘‚Ž‰ffŒÐŽ–^protect‘‚Ž‰ffŒÐŽ“cleanup˜Òcle–Áanup˜ÊendŽŽŽŽŸùÅŸü£Ÿ÷‘Ð/ ®Execute›U>Òb•–Áo“dy®.‘Execute˜Òcle“anup˜®no˜matter˜ho•Èãw˜con“trolŽ¡‘Ð/ exits‘U>Òb•–Áo“dy®.ŽŽŽŽŽŽ©‘Æ/ ÂDe ning‘U>F‘ÿ «unctionsŽŸñÇŸû€‘Æ/ Êfunction–U>«[Òrš–Áet-list«]“Òfunction-name“«[–˜,®(Òar˜g-list®)“«]ŽŽŽŽ¡Ÿü£‘ίÒfunction-b•–Áo“dyŽŽŽŽ¡Ÿþ‘Æ/ ÊendfunctionŽŽŽŽ¡Ÿ{ŒŸñ`å‘Æ/ Òr–Áet-list‘ûÒ®mašÈãy–U>b7e“a“single“iden˜ti er“or“a“comma-separated“listŽ¡‘Æ/ of–U>idenšÈãti ers“delimited“b˜y“square-brac˜k˜ets.ŽŽŽŽŸ8âŸó£‘Æ/ Òar–Ág-list‘ûÒ®is–U>a“comma-separated“list“of“idenšÈãti ers“and“ma˜y“b7eŽ¡‘Æ/ emptÈãy‘ÿZª.ŽŽŽŽ¦‘Æ/ ÂBasic–U>Matrix“ManipulationsŽŸ ‘Æ/ Êrows‘U>(ÒaÊ)ŽŽŽ‘+Ø®return›U>n•Èãum“b7er˜of˜ro“ws˜of˜ÒaŽŽŽŽ¡‘Æ/ Êcolumns‘U>(ÒaÊ)ŽŽŽ‘+Ø®return›U>n•Èãum“b7er˜of˜columns˜of˜ÒaŽŽŽŽ¡‘Æ/ Êall‘U>(ÒaÊ)ŽŽŽ‘+Ø®c•Èãhec“k–U>if“all“elemenÈãts“of“Òa‘nonzeroŽŽŽŽ¡‘Æ/ Êany‘U>(ÒaÊ)ŽŽŽ‘+Ø®c•Èãhec“k–U>if“anšÈãy“elemen˜ts“of“Òa‘nonzeroŽŽŽŽ© UU‘Æ/ Êfind‘U>(ÒaÊ)ŽŽŽ‘+Ø®return–U>indices“of“nonzero“elemenÈãtsŽŽŽŽ¡‘Æ/ Êsort‘U>(ÒaÊ)ŽŽŽ‘+Ø®order–U>elemenšÈãts“in“eac˜h“column“of“ÒaŽŽŽŽ¡‘Æ/ Êsum‘U>(ÒaÊ)ŽŽŽ‘+Ø®sum–U>elemenÈãts“in“columns“of“ÒaŽŽŽŽ¡‘Æ/ Êprod‘U>(ÒaÊ)ŽŽŽ‘+Ø®pro7duct–U>of“elemenÈãts“in“columns“of“ÒaŽŽŽŽ¦‘Æ/ Êmin‘U>(Òar–ÁgsÊ)ŽŽŽ‘+Ø® nd–U>minimÈãum“v‘ÇaluesŽŽŽŽ¡‘Æ/ Êmax‘U>(Òar–ÁgsÊ)ŽŽŽ‘+Ø® nd–U>maximÈãum“v‘ÇaluesŽŽŽŽ¡‘Æ/ Êrem–U>(ÒxÊ,“ÒyÊ)ŽŽŽ‘+Ø® nd–U>remainder“of“Òx®/ÒyŽŽŽŽŸ N9‘Æ/ Êreshape–U>(ÒaÊ,“ÒmÊ,“ÒnÊ)ŽŽŽ‘+Ø®reformat–U>Òa“®to“b7e“Òm“®bÈãy“ÒnŽŽŽŽ¡¡‘Æ/ Êdiag–U>(ÒvÊ,“ÒkÊ)ŽŽŽ‘+Ø®create–U>diagonal“matricesŽŽŽŽ¦‘Æ/ Êlinspace–U>(ÒbÊ,“ÒlÊ,“ÒnÊ)ŽŽŽ‘+Ø®create–U>všÈãector“of“linearly-spaced“elemen˜tsŽŽŽŽ¦‘Æ/ Êlogspace–U>(ÒbÊ,“ÒlÊ,“ÒnÊ)ŽŽŽ‘+Ø®create–U>všÈãector“of“log-spaced“elemen˜tsŽŽŽŽ¦‘Æ/ Êeye–U>(ÒnÊ,“ÒmÊ)ŽŽŽ‘+Ø®create–U>Òn›bÈãy“Òm˜®iden•Èãtit“y‘U>matrixŽŽŽŽ¦‘Æ/ Êones–U>(ÒnÊ,“ÒmÊ)ŽŽŽ‘+Ø®create–U>Òn›bÈãy“Òm˜®matrix“of“onesŽŽŽŽ¡‘Æ/ Êzeros–U>(ÒnÊ,“ÒmÊ)ŽŽŽ‘+Ø®create–U>Òn›bÈãy“Òm˜®matrix“of“zerosŽŽŽŽ¡‘Æ/ Êrand–U>(ÒnÊ,“ÒmÊ)ŽŽŽ‘+Ø®create–U>Òn›bÈãy“Òm˜®matrix“of“random“v‘ÇaluesŽŽŽŽŽŽ ý¿× ’´™š„šŽ @(÷’´™š„šŽŽ ýÇ× ’Ã'^ÂLinear‘U>AlgebraŽ© ’Ã'^Êchol‘U>(ÒaÊ)ŽŽŽ’ $*®Cholesky‘U>factorizationŽŽŽŽ¤ ’Ã'^Êdet‘U>(ÒaÊ)ŽŽŽ’ $*®compute–U>the“determinanÈãt“of“a“matrixŽŽŽŽ¡’Ã'^Êeig‘U>(ÒaÊ)ŽŽŽ’ $*®eigenšÈãv‘Çalues–U>and“eigen˜v˜ectorsŽŽŽŽ¤ UU’Ã'^Êexpm‘U>(ÒaÊ)ŽŽŽ’ $*®compute–U>the“exp7onenÈãtial“of“a“matrixŽŽŽŽ¡’Ã'^Êhess‘U>(ÒaÊ)ŽŽŽ’ $*®compute–U>HessenÈãbš7erg“decomp˜ositionŽŽŽŽ¤ ’Ã'^Êinverse‘U>(ÒaÊ)ŽŽŽ’ $*®in•Èãv“ert–U>a“square“matrixŽŽŽŽ¡’Ã'^Ênorm–U>(ÒaÊ,“ÒpÊ)ŽŽŽ’ $*®compute–U>the“Òp®-norm“of“a“matrixŽŽŽŽ¡’Ã'^Êpinv‘U>(ÒaÊ)ŽŽŽ’ $*®compute›U>pseudoin•Èãv“erse˜of˜ÒaŽŽŽŽ¤ UU’Ã'^Êqr‘U>(ÒaÊ)ŽŽŽ’ $*®compute–U>the“QR“factorization“of“a“matrixŽŽŽŽ¡’Ã'^Êrank‘U>(ÒaÊ)ŽŽŽ’ $*®matrix‘U>rankŽŽŽŽ¤ ’Ã'^Êschur‘U>(ÒaÊ)ŽŽŽ’ $*®Sc•Èãh“ur–U>decomp7osition“of“a“matrixŽŽŽŽ¡’Ã'^Êsvd‘U>(ÒaÊ)ŽŽŽ’ $*®singular–U>v‘Çalue“decomp7ositionŽŽŽŽ¡’Ã'^Êsyl–U>(ÒaÊ,“ÒbÊ,“ÒcÊ)ŽŽŽ’ $*®solvšÈãe–U>the“Sylv˜ester“equationŽŽŽŽŸ¸ã’Ã'^ÂEquations,–U>ODEs,“D®9AEs,“QuadratureŽ¦’Ã'^Ê*fsolveŽŽŽ’ $*®solvÈãe–U>nonlinear“algebraic“equationsŽŽŽŽ¡’Ã'^Ê*lsodeŽŽŽ’ $*®inÈãtegrate–U>nonlinear“ODEsŽŽŽŽ¡’Ã'^Ê*dasslŽŽŽ’ $*®inšÈãtegrate–U>nonlinear“D˜AEsŽŽŽŽ¡’Ã'^Ê*quadŽŽŽ’ $*®inÈãtegrate–U>nonlinear“functionsŽŽŽŽ¡¡’Ã'^Êperror–U>(ÒnmÊ,“Òc•–Áo“deÊ)ŽŽŽ’ $*®for–U>functions“that“return“nÈãumeric“co7des,Ž¡’$*prinÈãt–U>error“message“for“named“functionŽ¡’$*and–U>givÈãen“error“co7deŽŽŽŽŸ\qŸÜqŸ÷’Ã'^Ê*–U>®See“the“on-line“or“prinšÈãted“man˜ual“for“the“complete“list“ofŽ¡’Ã'^argumenÈãts–U>for“these“functions.ŽŽŽŽŸ’Ã'^ÂSignal‘U>ProQÇcessingŽ¦’Ã'^Êfft‘U>(ÒaÊ)ŽŽŽ’ $*®F–ÿZªast›U>F“ourier˜T“ransform˜using˜FFTP“AÈãCKŽŽŽŽ¡’Ã'^Êifft‘U>(ÒaÊ)ŽŽŽ’ $*®in•Èãv“erse–U>FFT“using“FFTP‘ÿZªAÈãCKŽŽŽŽ¡’Ã'^Êfreqz‘U>(Òar–ÁgsÊ)ŽŽŽ’ $*®FIR–U> lter“frequency“resp7onseŽŽŽŽ¤ UU’Ã'^Êsinc‘U>(ÒxÊ)ŽŽŽ’ $*®returns–U>Êsin“(±–±Êx)/(±“Êx)ŽŽŽŽŸœq’Ã'^ÂImage‘U>ProQÇcessingŽ¦’Ã'^Êcolormap‘U>(ÒmapÊ)ŽŽŽ’%o«®set–U>the“currenÈãt“colormapŽŽŽŽ¡’Ã'^Êgray2ind–U>(ÒiÊ,“ÒnÊ)ŽŽŽ’%o«®con•Èãv“ert›U>gra“y˜scale˜to˜Octa“v“e˜imageŽŽŽŽ¡’Ã'^Êimage–U>(ÒimgÊ,“Òzo–ÁomÊ)ŽŽŽ’%o«®displašÈãy–U>an“Octa˜v˜e“image“matrixŽŽŽŽ¡’Ã'^Êimagesc–U>(ÒimgÊ,“Òzo–ÁomÊ)ŽŽŽ’%o«®displaÈãy–U>scaled“matrix“as“imageŽŽŽŽ¡’Ã'^Êimshow–U>(ÒimgÊ,“ÒmapÊ)ŽŽŽ’%o«®displa•Èãy›U>Octa“v“e˜imageŽŽŽŽ¤ ’Ã'^Êimshow–U>(ÒiÊ,“ÒnÊ)ŽŽŽ’%o«®displa•Èãy›U>gra“y˜scale˜imageŽŽŽŽ¡’Ã'^Êimshow–U>(ÒrÊ,“ÒgÊ,“ÒbÊ)ŽŽŽ’%o«®displa•Èãy›U>R“GB˜imageŽŽŽŽ¡’Ã'^Êind2gray–U>(ÒimgÊ,“ÒmapÊ)ŽŽŽ’%o«®con•Èãv“ert›U>Octa“v“e˜image˜to˜gra“y˜scaleŽŽŽŽ¤ UU’Ã'^Êind2rgb–U>(ÒimgÊ,“ÒmapÊ)ŽŽŽ’%o«®con•Èãv“ert–U>indexed“image“to“RÈãGBŽŽŽŽ¡’Ã'^Êloadimage‘U>(Ò leÊ)ŽŽŽ’%o«®load–U>an“image“ leŽŽŽŽ¡’Ã'^Êrgb2ind–U>(ÒrÊ,“ÒgÊ,“ÒbÊ)ŽŽŽ’%o«®con•Èãv“ert›U>R“GB˜to˜Octa“v“e˜imageŽŽŽŽ¡’Ã'^Êsaveimage–U>(Ò leÊ,“ÒimgÊ,“ÒfmtÊ,“ÒmapÊ)‘€®sa•Èãv“e–U>a“matrix“to“Ò leŽŽŸ’Ã'^ÂSetsŽ¦’Ã'^Êcreate‘‚Ž‰ffŒÐŽ‘^set–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’%o«®create–U>rošÈãw“v˜ector“of“unique“v‘ÇaluesŽŽŽŽ© ’Ã'^Êcomplement–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’%o«®elemenÈãts–U>of“Òb“®not“in“ÒaŽŽŽŽ¡’Ã'^Êintersection–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’%o«®inÈãtersection–U>of“sets“Òa“®and“ÒbŽŽŽŽ¦’Ã'^Êunion–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’%o«®union–U>of“sets“Òa“®and“ÒbŽŽŽŽŸ9’Ã'^ÂStringsŽŸ ’Ã'^Êstrcmp–U>(ÒsÊ,“ÒtÊ)ŽŽŽ’%o«®compare‘U>stringsŽŽŽŽ¡’Ã'^Êstrcat–U>(ÒsÊ,“ÒtÊ,“...)ŽŽŽ’%o«®concatenate‘U>stringsŽŽŽŽŽŽŽŽ ý¿× ’±‘ì„šŽ @(÷’±‘ì„šŽŽ ýÇ× ’À°ÂC-st®9yle–U>Input“and“OutputŽŸ ’À°Êfopen–U>(ÒnameÊ,“Òmo–ÁdeÊ)ŽŽŽ’"gý®op7en–U> le“ÒnameŽŽŽŽ¤ UU’À°Êfclose‘U>(Ò leÊ)ŽŽŽ’"gý®close‘U>Ò leŽŽŽŽ© ’À°Êprintf–U>(ÒfmtÊ,“...)ŽŽŽ’"gý®formatted–U>output“to“ÊstdoutŽŽŽŽ¡’À°fprintf–U>(Ò leÊ,“ÒfmtÊ,“...)ŽŽŽ’"gý®formatted–U>output“to“Ò leŽŽŽŽ¡’À°Êsprintf–U>(ÒfmtÊ,“...)ŽŽŽ’"gý®formatted–U>output“to“stringŽŽŽŽ¡’À°Êscanf‘U>(ÒfmtÊ)ŽŽŽ’"gý®formatted–U>input“from“ÊstdinŽŽŽŽ¦’À°fscanf–U>(Ò leÊ,“ÒfmtÊ)ŽŽŽ’"gý®formatted–U>input“from“Ò leŽŽŽŽ¦’À°Êsscanf–U>(ÒstrÊ,“ÒfmtÊ)ŽŽŽ’"gý®formatted–U>input“from“ÒstringŽŽŽŽ¦’À°Êfgets–U>(Ò leÊ,“ÒlenÊ)ŽŽŽ’"gý®read–U>Òlen‘cÈãharacters“from“Ò leŽŽŽŽ¡’À°Êfflush‘U>(Ò leÊ)ŽŽŽ’"gý® ush–U>p7ending“output“to“Ò leŽŽŽŽ¦’À°Êftell‘U>(Ò leÊ)ŽŽŽ’"gý®return–U> le“pš7oinÈãter“p˜ositionŽŽŽŽ¦’À°Êfrewind‘U>(Ò leÊ)ŽŽŽ’"gý®mo•Èãv“e–U> le“pš7oinÈãter“to“b˜eginningŽŽŽŽ¦’À°ÊfreportŽŽŽ’"gý®prinÈãt–U>a“info“for“op7en“ lesŽŽŽŽ¡’À°Êfread–U>(Ò leÊ,“ÒsizeÊ,“Òpr•–Áe“cÊ)ŽŽŽ’"gý®read–U>binary“data“ lesŽŽŽŽ¦’À°Êfwrite–U>(Ò leÊ,“ÒsizeÊ,“Òpr•–Áe“cÊ)ŽŽŽ’"gý®write–U>binary“data“ lesŽŽŽŽ¦’À°Êfeof‘U>(Ò leÊ)ŽŽŽ’"gý®determine–U>if“p7oinÈãter“is“at“EOFŽŽŽŽŸ!§Ÿê`å’À°A–U> le“mašÈãy“b7e“referenced“either“b˜y“name“or“b˜y“the“n˜um˜b7erŽ¦’À°returned–U>from“Êfopen®.‘Three“ les“are“preconnected“whenŽ¦’À°Octa•Èãv“e–U>starts:‘Êstdin®,“Êstdout®,“and“Êstderr®.ŽŽŽŽŸ’À°ÂOther–U>Input“and“Output“functionsŽ¤ ’À°Êsave–U>Ò le“var“Ê...ŽŽŽ’ |®sa•Èãv“e–U>v‘Çariables“in“Ò leŽŽŽŽ¦’À°Êload‘U>Ò leŽŽŽ’ |®load–U>v‘Çariables“from“Ò leŽŽŽŽ¦’À°Êdisp‘U>(ÒvarÊ)ŽŽŽ’ |®displaÈãy–U>v‘Çalue“of“Òvar“®to“screenŽŽŽŽŸ¸ã’À°ÂMiscellaneous‘U>F‘ÿ «unctionsŽ¡’À°Êeval‘U>(ÒstrÊ)ŽŽŽ’ |®ev‘Çaluate–U>Òstr“®as“a“commandŽŽŽŽ¦’À°Êfeval–U>(ÒstrÊ,“...)ŽŽŽ’ |®ev‘Çaluate–U>function“named“bÈãy“Òstr®,“passingŽ¦’|remaining–U>args“to“called“functionŽŽŽŽŸ \q¦’À°Êerror‘U>(ÒmessageÊ)ŽŽŽ’ |®prinšÈãt–U>message“and“return“to“top“lev˜elŽŽŽŽ¦¦’À°Êclear‘U>Òp–ÁatternŽŽŽ’ |®clear–U>v‘Çariables“matcÈãhing“patternŽŽŽŽ¦’À°Êexist‘U>(ÒstrÊ)ŽŽŽ’ |®c•Èãhec“k–U>existence“of“v‘Çariable“or“functionŽŽŽŽ¦’À°ÊwhoŽŽŽ’ |®list–U>currenÈãt“v‘ÇariablesŽŽŽŽŸ’À°ÂP®9olynomialsŽ¡’À°Êcompan‘U>(ÒpÊ)ŽŽŽ’ |®companion‘U>matrixŽŽŽŽ¤ UU’À°Êconv–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’ |®con•Èãv“olutionŽŽŽŽ¦’À°Êdeconv–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’ |®decon•Èãv“olv“e›U>t“w“o˜v“ectorsŽŽŽŽ¦’À°Êpoly‘U>(ÒaÊ)ŽŽŽ’ |®create–U>p7olynomial“from“a“matrixŽŽŽŽ¡’À°Êpolyderiv‘U>(ÒpÊ)ŽŽŽ’ |®deriv‘ÇativÈãe–U>of“p7olynomialŽŽŽŽ¡’À°Êpolyreduce‘U>(ÒpÊ)ŽŽŽ’ |®inÈãtegral–U>of“p7olynomialŽŽŽŽ¡’À°Êpolyval–U>(ÒpÊ,“ÒxÊ)ŽŽŽ’ |®v‘Çalue–U>of“p7olynomial“at“ÒxŽŽŽŽ¡’À°Êpolyvalm–U>(ÒpÊ,“ÒxÊ)ŽŽŽ’ |®v‘Çalue–U>of“p7olynomial“at“ÒxŽŽŽŽ¡’À°Êroots‘U>(ÒpÊ)ŽŽŽ’ |®p•7olynomial‘U>ro“otsŽŽŽŽ¦’À°Êresidue–U>(ÒaÊ,“ÒbÊ)ŽŽŽ’ |®partial–U>fraction“expansion“of“ratio“Òa®/ÒbŽŽŽŽŸ±Ç’À°ÂStatisticsŽŸ ’À°Êcorrcoef–U>(ÒxÊ,“ÒyÊ)ŽŽŽ’ |®correlation‘U>co7ecienÈãtŽŽŽŽ¦’À°Êcov–U>(ÒxÊ,“ÒyÊ)ŽŽŽ’ |®coÈãv‘ÇarianceŽŽŽŽ¦’À°Êmean‘U>(ÒaÊ)ŽŽŽ’ |®mean‘U>v‘ÇalueŽŽŽŽ¦’À°Êmedian‘U>(ÒaÊ)ŽŽŽ’ |®median‘U>v‘ÇalueŽŽŽŽ¦’À°Êstd‘U>(ÒaÊ)ŽŽŽ’ |®standard‘U>deviationŽŽŽŽ¦’À°Êvar‘U>(ÒaÊ)ŽŽŽ’ |®v‘ÇarianceŽŽŽŽŽŽŽŽŸËÌ)’®Š>„šŽ @(÷’®Š>„šŽŽŸÓÌ)’½ÂBasic‘U>PlottingŽŸñÇŸû€’½Êgplot–U>«[Òr–Áanges«]“Òexpr“«[Òusing«]“[Òtitle«]“[Òstyle«]‘#o#®2D“plottingŽŽŽŽ©Ÿû€’½Êgsplot–U>«[Òr–Áanges«]“Òexpr“«[Òusing«]“[Òtitle«]“[Òstyle«]‘/®3D“plottingŽŽŽŽ¤ ’Ř Òr–ÁangesŽŽŽ’ήsp7ecify–U>data“rangesŽŽŽŽ¡’Ř ÒexprŽŽŽ’ήexpression–U>to“plotŽŽŽŽ¡’Ř ÒusingŽŽŽ’ήsp7ecify–U>columns“to“plotŽŽŽŽ¡’Ř ÒtitleŽŽŽ’ήsp7ecify–U>line“title“for“legendŽŽŽŽ¡’Ř ÒstyleŽŽŽ’ήsp7ecify–U>line“stÈãyleŽŽŽŽŸ+(´Ÿà ’½If–U>Òr–Áanges‘á®are“supplied,“they“mÈãust“come“b7efore“the“expressionŽ¡’½to–U>plot.‘The“Òusing‘™l®,“Òtitle‘‚ª®,“and“Òstyle‘×è®options“maÈãy“app7ear“inŽ¡’½anšÈãy–U>order“after“Òexpr‘Àä®.‘Multiple“expressions“ma˜y“b7e“plottedŽ¡’½with–U>a“single“command“bÈãy“separating“them“with“commas.ŽŽŽŽ¡’½Êset‘U>ÒoptionsŽŽŽ’ήset–U>plotting“optionsŽŽŽŽ¡’½Êshow‘U>ÒoptionsŽŽŽ’ήshoÈãw–U>plotting“optionsŽŽŽŽ¡’½ÊreplotŽŽŽ’ήredispla•Èãy›U>curren“t˜plotŽŽŽŽ¡’½ÊcloseplotŽŽŽ’ήclose–U>stream“to“Êgnuplot“®pro7cessŽŽŽŽ¡’½Êpurge‘‚Ž‰ffŒÐŽ–^tmp‘‚Ž‰ffŒÐŽ“filesŽŽŽ’ήclean–U>up“temp7orary“plotting“ lesŽŽŽŽ¡’½Êautomatic‘‚Ž‰ffŒÐŽ‘^replotŽŽŽ’ήbuilt-in‘U>v‘ÇariableŽŽŽŽŸ¸ã’½ÂOther–U>Plotting“F‘ÿ «unctionsŽŸ ’½Êplot‘U>(Òar–ÁgsÊ)ŽŽŽ’ή2D–U>plot“with“linear“axesŽŽŽŽ¤ UU’½Êsemilogx‘U>(Òar–ÁgsÊ)ŽŽŽ’ή2D–U>plot“with“logarithmic“x-axisŽŽŽŽ¡’½Êsemilogy‘U>(Òar–ÁgsÊ)ŽŽŽ’ή2D–U>plot“with“logarithmic“y-axisŽŽŽŽ¡’½Êloglog‘U>(Òar–ÁgsÊ)ŽŽŽ’ή2D–U>plot“with“logarithmic“axesŽŽŽŽ¡’½Êbar‘U>(Òar–ÁgsÊ)ŽŽŽ’ήplot–U>bar“cÈãhartsŽŽŽŽ¤ ’½Êstairs–U>(ÒxÊ,“ÒyÊ)ŽŽŽ’ήplot‘U>stairstepsŽŽŽŽ¡’½Êhist–U>(ÒyÊ,“ÒxÊ)ŽŽŽ’ήplot‘U>histogramsŽŽŽŽ¡¡’½Êtitle‘U>(ÒstringÊ)ŽŽŽ’ήset–U>plot“titleŽŽŽŽ¡¡’½Êaxis‘U>(ÒlimitsÊ)ŽŽŽ’ήset–U>axis“rangesŽŽŽŽ¡’½Êxlabel‘U>(ÒstringÊ)ŽŽŽ’ήset–U>x-axis“lab7elŽŽŽŽ¡’½Êylabel‘U>(ÒstringÊ)ŽŽŽ’ήset–U>y-axis“lab7elŽŽŽŽŸ G’½Êgrid‘U>«[®on·j®o «]ŽŽŽ’ήset–U>grid“stateŽŽŽŽŸ ’½Êhold‘U>«[®on·j®o «]ŽŽŽ’ήset–U>hold“stateŽŽŽŽŸ cŽ’½ÊisholdŽŽŽ’ήreturn–U>1“if“hold“is“on,“0“otherwiseŽŽŽŽ¡¡’½Êmesh–U>(ÒxÊ,“ÒyÊ,“ÒzÊ)ŽŽŽ’ήplot–U>3D“surfaceŽŽŽŽ¡’½Êmeshdom–U>(ÒxÊ,“ÒyÊ)ŽŽŽ’ήcreate–U>mesh“co7ordinate“matricesŽŽŽŽ’½Ÿ-A ‰ffßödŸ*«¯Edition–U>1.1“for“Octa•Î9v“e–U>V‘ÿj«ersion“1.1.0.‘Cop•Î9yrigh“t–U>1994,“1995,Ž¡John–U>W.“Eaton“(jw•Î9e@c“he.utexas.edu).‘The–U>author“assumes“noŽ¡resp1ÆonsibilitšÎ9y–U>for“an˜y“errors“on“this“card.Ž¦This–U>card“maÎ9y“b1Æe“freely“distributed“under“the“terms“of“the“GNUŽ¡General–U>Public“License.Ž¦T‘þÇ ŸJªEŽ‘ÅX–U>Macros“for“this“card“bšÎ9y“Roland“P˜esc˜h“(p1Æesc˜h@cygn˜us.com),Ž¡originally–U>for“the“GDB“reference“cardŽ¦Octa•Î9v“e–U>itself“is“free“soft•Î9w“are;›U>y“ou˜are˜w“elcome˜to˜distribute˜copiesŽ¡of–U>it“under“the“terms“of“the“GNU“General“Public“License.‘ThereŽ¡is–U>absolutely“no“w•Î9arran“t“y–U>for“Octa•Î9v“e.ŽŽŽŒø:Œƒ’À;è õ f ó2ÂÖN  cmbx12ó't}\Êcmti7óßCÊscmtt8óò"V cmbx10ó !",š cmsy10ó  b> cmmi10ó¹Aa¨cmr6óÙ“ Rcmr7óKñ`y cmr10ùrsßßßßßßßoctave-1.1.0/doc/refcard.ps100666 415 17 210635 5705320137 13727 0ustar jweusers%!PS-Adobe-2.0 %%Creator: dvips 5.515 Copyright 1986, 1993 Radical Eye Software %%Title: refcard.dvi %%CreationDate: Thu Jan 12 15:34:23 1995 %%Pages: 2 %%PageOrder: Ascend %%Orientation: Landscape %%BoundingBox: 0 0 612 792 %%EndComments %DVIPSCommandLine: dvips -o refcard.ps refcard.dvi %DVIPSSource: TeX output 1995.01.12:1534 %%BeginProcSet: tex.pro /TeXDict 250 dict def TeXDict begin /N{def}def /B{bind def}N /S{exch}N /X{S N}B /TR{translate}N /isls false N /vsize 11 72 mul N /@rigin{isls{[ 0 -1 1 0 0 0]concat}if 72 Resolution div 72 VResolution div neg scale isls{Resolution hsize -72 div mul 0 TR}if Resolution VResolution vsize -72 div 1 add mul TR matrix currentmatrix dup dup 4 get round 4 exch put dup dup 5 get round 5 exch put setmatrix}N /@landscape{/isls true N}B /@manualfeed{statusdict /manualfeed true put}B /@copies{/#copies X}B /FMat[1 0 0 -1 0 0]N /FBB[0 0 0 0]N /nn 0 N /IE 0 N /ctr 0 N /df-tail{ /nn 8 dict N nn begin /FontType 3 N /FontMatrix fntrx N /FontBBox FBB N string /base X array /BitMaps X /BuildChar{CharBuilder}N /Encoding IE N end dup{/foo setfont}2 array copy cvx N load 0 nn put /ctr 0 N[}B /df{ /sf 1 N /fntrx FMat N df-tail}B /dfs{div /sf X /fntrx[sf 0 0 sf neg 0 0] N df-tail}B /E{pop nn dup definefont setfont}B /ch-width{ch-data dup length 5 sub get}B /ch-height{ch-data dup length 4 sub get}B /ch-xoff{ 128 ch-data dup length 3 sub get sub}B /ch-yoff{ch-data dup length 2 sub get 127 sub}B /ch-dx{ch-data dup length 1 sub get}B /ch-image{ch-data dup type /stringtype ne{ctr get /ctr ctr 1 add N}if}B /id 0 N /rw 0 N /rc 0 N /gp 0 N /cp 0 N /G 0 N /sf 0 N /CharBuilder{save 3 1 roll S dup /base get 2 index get S /BitMaps get S get /ch-data X pop /ctr 0 N ch-dx 0 ch-xoff ch-yoff ch-height sub ch-xoff ch-width add ch-yoff setcachedevice ch-width ch-height true[1 0 0 -1 -.1 ch-xoff sub ch-yoff .1 add]{ch-image}imagemask restore}B /D{/cc X dup type /stringtype ne{]} if nn /base get cc ctr put nn /BitMaps get S ctr S sf 1 ne{dup dup length 1 sub dup 2 index S get sf div put}if put /ctr ctr 1 add N}B /I{ cc 1 add D}B /bop{userdict /bop-hook known{bop-hook}if /SI save N @rigin 0 0 moveto /V matrix currentmatrix dup 1 get dup mul exch 0 get dup mul add .99 lt{/QV}{/RV}ifelse load def pop pop}N /eop{SI restore showpage userdict /eop-hook known{eop-hook}if}N /@start{userdict /start-hook known{start-hook}if pop /VResolution X /Resolution X 1000 div /DVImag X /IE 256 array N 0 1 255{IE S 1 string dup 0 3 index put cvn put}for 65781.76 div /vsize X 65781.76 div /hsize X}N /p{show}N /RMat[1 0 0 -1 0 0]N /BDot 260 string N /rulex 0 N /ruley 0 N /v{/ruley X /rulex X V}B /V {}B /RV statusdict begin /product where{pop product dup length 7 ge{0 7 getinterval dup(Display)eq exch 0 4 getinterval(NeXT)eq or}{pop false} ifelse}{false}ifelse end{{gsave TR -.1 -.1 TR 1 1 scale rulex ruley false RMat{BDot}imagemask grestore}}{{gsave TR -.1 -.1 TR rulex ruley scale 1 1 false RMat{BDot}imagemask grestore}}ifelse B /QV{gsave transform round exch round exch itransform moveto rulex 0 rlineto 0 ruley neg rlineto rulex neg 0 rlineto fill grestore}B /a{moveto}B /delta 0 N /tail{dup /delta X 0 rmoveto}B /M{S p delta add tail}B /b{S p tail} B /c{-4 M}B /d{-3 M}B /e{-2 M}B /f{-1 M}B /g{0 M}B /h{1 M}B /i{2 M}B /j{ 3 M}B /k{4 M}B /w{0 rmoveto}B /l{p -4 w}B /m{p -3 w}B /n{p -2 w}B /o{p -1 w}B /q{p 1 w}B /r{p 2 w}B /s{p 3 w}B /t{p 4 w}B /x{0 S rmoveto}B /y{ 3 2 roll p a}B /bos{/SS save N}B /eos{SS restore}B end %%EndProcSet TeXDict begin 52099146 40258431 1000 300 300 (/export/home/jwe/src/octave/doc/refcard.dvi) @start /Fa 1 26 df<0FFFF81FFFF83FFFF0608400408400808C00010C00010C00030C00030C00 020C00061C00061C000E1C000C1C001C0E001C0E00180C0015127E9118>25 D E /Fb 2 107 df<400020C000606000C03001801803000C0600060C0003180001B000 00E00000E00001B000031800060C000C06001803003001806000C0C0006040002013147A 9320>2 D106 D E /Fc 2 94 df91 D93 D E /Fd 29 123 df<000FF0003018006010006000 00C00000C00000C00007FFE000C0600180600180C00180C00180C00180C0018180030190 0301900301900301A00300E0060000060000060000C40000C80000700000151A819314> 12 D45 D<60E06003037C820B>I<0020004000C003C00CC001800180 01800180030003000300030006000600060006000C00FFC00B137C9212>49 D<01F00618080C120C110C220C220C240C181800300060018006000800100420047C18C7 F081E00E137D9212>I<07C03F8000C00C00016008000160080001200800013008000230 10000218100002181000020C1000040C2000040420000406200004022000080340000803 40000801C0000801C00018008000FE00800019147E9319>78 D<07B00C70107030606060 60606060C0C0C0C8C0C841C862D03C700D0D7C8C12>97 D<7C000C001800180018001800 30003700388030C060C060C060C060C0C180C180C1004300660038000A147C9310>I<07 800C4010603040600060006000C000C0004020404021801E000B0D7C8C10>I<007C000C 0018001800180018003007B00C7010703060606060606060C0C0C0C8C0C841C862D03C70 0E147C9312>I<07800C401020304060407F8060004000C0004020604021801E000B0D7C 8C10>I<001C00660064006000C000C000C007F800C00180018001800180018003000300 0300030003000200060006000600C400C80070000F1A81930B>I<01D8023804380C3018 301830183030603060306010E019C00EC000C000C00180C180C3007C000D137E8C10>I< 02060000000000384C4C8C98181830326262643807147D930B>105 D<3E0006000C000C000C000C0018001870189819103200340038003E0063006310631063 10C320C1C00D147D9310>107 D<7C0C181818183030303060606060C0D0D0D0D0600614 7C9309>I<30F878590D8C4E0E0C9C0E0C980C0C180C0C180C0C30181830181930183130 183160303260301C180D7D8C1C>I<30F05B184C189C1898181818181830303032306230 62606460380F0D7D8C13>I<03800C6018203030603060306030C060C06040C060802300 1E000C0D7C8C12>I<0C78168C130426062606060606060C0C0C0C0C080C101A2019C018 001800300030003000FC000F137F8C12>I<31F05A184C109C0098001800180030003000 30003000600060000D0D7D8C0F>114 D<0700188018C0308038001E001F0003800180C1 80810082007C000A0D7D8C0E>I<04000C000C000C001800FF8018001800300030003000 300060006100610062006400380009127D910C>I<38184C184C188C3098301830183030 603064306430E411E80E380E0D7D8C12>I<38104C384C108C1098101810181030203020 3040304018800F000D0D7D8C10>I<3818204C18704C18208C3020983020183020183020 30604030604030604030608018B1000F1E00140D7D8C17>I<071E09E311C22180218001 8001800300030403044308C51078E0100D7F8C10>I<38184C184C188C30983018301830 30603060306030E011C00EC000C000802180630046003C000D137D8C11>I<06100F2010 E000400080010002000C00102020203840478083000C0D7E8C0E>I E /Fe 65 123 df<01F8F00607380C0E38180610180600180600180600FFFFC018060018 06001806001806001806001806001806001806001806001806001806007E1FC015148093 14>11 D<01F8000604000C0E00180E00180000180000180000FFFE001806001806001806 001806001806001806001806001806001806001806001806007E1F801114809313>I<01 FE00060E000C0E00180600180600180600180600FFFE0018060018060018060018060018 06001806001806001806001806001806001806007E1F801114809313>I<01F8FC000605 82000C0F0700180E0700180600001806000018060000FFFFFF0018060300180603001806 030018060300180603001806030018060300180603001806030018060300180603007E1F 8FC01A1480931C>I<4100E380618020802080208041004100820009097F9311>34 D<0380000640000C20000C20000C20000C40000C40000C81F80700E00600400E00801301 00238100418200C0C200C06400C03808601808706E101F83E015147F9319>38 D<40E06020202040408003097D9309>I<01020408103020606040C0C0C0C0C0C0C0C0C0 C040606020301008040201081E7E950D>I<80402010080C040606020303030303030303 0303020606040C0810204080081E7E950D>I<40E06020202040408003097D8209>44 DI<40E04003037D8209>I<0010003000600060006000C000C000C001 8001800300030003000600060006000C000C000C00180018003000300030006000600060 00C000C0000C1D7E9511>I<0F0030C0606060604020C030C030C030C030C030C030C030 C030C03040206060606030C00F000C137E9211>I<0C001C00EC000C000C000C000C000C 000C000C000C000C000C000C000C000C000C000C00FFC00A137D9211>I<1F0060C06060 F070F030603000700070006000C001C00180020004000810101020207FE0FFE00C137E92 11>I<0FC030707038703870380038003000E00FC0007000380018001C601CF01CF018E0 3860701FC00E137F9211>I<0F00308060404060C020C030C030C0304030607030B00F30 003000200060E040E08041003E000C137E9211>57 D<40E0400000000000000040E04003 0D7D8C09>I<003000003000007800007800007800009C00009C00011E00010E00010E00 02070002070004038007FF800403800801C00801C01000E03800E0FE07FC16147F9319> 65 DI<00FC 200703600C00E0180060300060700020600020E00000E00000E00000E00000E00000E000 006000207000203000201800400C008007030000FC0013147E9318>IIII<00FC200703600C00E0180060300060700020600020E0 0000E00000E00000E00000E00FF8E000E06000E07000E03000E01800E00C00E007036000 FC2015147E931A>III75 D77 DI<01F800070E001C03803801C03000 C07000E0600060E00070E00070E00070E00070E00070E000707000E07000E03000C03801 C01C0380070E0001F80014147E9319>II<01F800070E001C03803801C03000C07000E0600060E00070 E00070E00070E00070E00070E000706000607000E03000C038F1C01D0B80070E0001FC10 0004100004100006300007E00003E00001C0141A7E9319>II<1F1030F06030C030C010C010E0007000 7F003FC00FF000F000380018801880188018C030F0608FC00D147E9312>I<7FFFF06070 304070104070108070088070088070080070000070000070000070000070000070000070 0000700000700000700000700000700007FF0015147F9318>I<20804100410082008200 8200C300E380410009097A9311>92 D<204040808080C0E04003097D9309>96 D<7F00E1C0E0404060006007E038606060C060C064C06461E43E380E0D7E8C11>II<0FE0187020706020C000C000C000C000C0006000201018200FC00C 0D7F8C0F>I<00780018001800180018001800180F98187820386018C018C018C018C018 C0186018203810580F9E0F147F9312>I<0F80104020206030C010FFF0C000C000C00060 00201018200FC00C0D7F8C0F>I<03C00CE018E01840180018001800FF00180018001800 180018001800180018001800180018007F000B1480930A>I<0F3C30E620406060606060 60204030C02F00600060003FE03FF06018C00CC00CC00C601830300FC00F147F8C11>I< F00030003000300030003000300033E03430381830183018301830183018301830183018 3018FC7E0F147F9312>I<2070200000000000F03030303030303030303030FC06157F94 09>I<02070200000000000F030303030303030303030303030343E2E67C081B82940A>I< F00030003000300030003000300030F8306030403080330037003B80318030C030603070 3030FC7C0E147F9311>I III<0FC0186020106018C00CC00CC00CC00CC00C6018601838700FC00E0D 7F8C11>II<0F88184820386018C018C018C018C018C01860182038 18580F9800180018001800180018007E0F137F8C11>II<3E806180C080C080E0007E003F8003C0 80C080C0C0C0E1809F000A0D7F8C0D>I<10001000100030007000FF8030003000300030 0030003000300030803080308011000E0009127F910D>IIIIIII E /Ff 66 125 df<60F0F0F0F0F0F0F0F0F0F0700000000060F0F0600414799312>33 D<4040E0E0E0E0E0E0E0E0E0E0E0E0E0E040400B097D9312>I<07001F8019C039C039C0 39C039BE3B3E3E701C701C701CE03EE06FE0E7C0E3C4E38E63CE7EFC3C380F147F9312> 38 D<60F0F878181818303060C080050C799312>I<0180038006000C0018003800300070 007000E000E000E000E000E000E000E000700070003000380018000C0006000380018009 197B9612>I<80C06030181C0C0E0E070707070707070E0E0C1C183060C08008197C9612> I<070007000700E738FFF87FF01FC01FC07FF0FFF8E7380700070007000D0E7E9012>I< 038003800380038003800380FFFEFFFEFFFE0380038003800380038003800F0F7F9112> I<60F0F878183030E0C00509798312>II<60F0F060040479 8312>I<0018003800380070007000E000E001C001C001C003800380070007000E000E00 1C001C001C003800380070007000E000E000C0000D1A7E9612>I<0F803FC070E0E070E0 38E038403800380030007000E000C00180030006000C00183830387FF87FF80D147E9312 >50 D<60F0F06000000000000060F0F060040E798D12>58 D<60F0F06000000000000060 F0F070303060C0800413798D12>I<0038007801F003E00F801F003C00F800F000F8003C 001F000F8003E001F0007800380D117E9212>II<4000E000F0007C003E000F8007C001E000F8007800F801E007C00F 803E007C00F000E00040000D137E9312>I<1FC07FF0F078E038403800F001E003800700 070007000700000000000000000006000F000F0006000D147E9312>I<038007C007C006 C006C00EE00EE00EE00EE00C601C701C701C701FF01FF0383838383838FC7EFC7E0F147F 9312>65 DI<03E60FFE1C3E381E700E700E600EE000E000E000 E000E000E000600E700E700E381C1C380FF003E00F147F9312>III<07980FF81878387870387038E038E000E000E000E0FCE0 FCE038E03870387038387818780FF807B80E147F9312>71 DI< FFE0FFE00E000E000E000E000E000E000E000E000E000E000E000E000E000E000E000E00 FFE0FFE00B147D9312>I76 DII<3FE07FF07070E038E038E038E038E038E038E038E038E038E038E0 38E038E038E03870707FF03FE00D147E9312>II82 D<1F303FF070F0E070E070E070E00070007F003FC00FE000F00038003860 38E038E030F070FFE0CF800D147E9312>I<7FFEFFFEE38EE38EE38E0380038003800380 0380038003800380038003800380038003801FF01FF00F147F9312>II91 DII<0E003F80FFE0F1E040400B057D93 12>I<3F807FC070E0207000700FF03FF07870E070E070E07070F03FFE1F3E0F0E7E8D12> 97 DI<07F01FF8383870106000E000E000E000E00060007038 38381FF007E00D0E7E8D12>I<00F800F8003800380038003807B81FF8387870386038E0 38E038E038E0386038707838781FFE0FBE0F147F9312>I<07801FE0387070706038E038 FFF8FFF8E0006000703838381FF007C00D0E7E8D12>I<007E00FF01C70382038003807F FEFFFE03800380038003800380038003800380038003803FF83FF81014809312>I<0F9E 1FFF38E7707070707070707038E03FC03F8070003FE03FF83FFC701EE00EE00EE00E600C 783C1FF00FE010167F8D12>II<06000F000F00060000000000 0000FF00FF000700070007000700070007000700070007000700FFF0FFF00C157D9412> I107 DIII< 0F803FE038E07070E038E038E038E038E038F078707038E03FE00F800D0E7E8D12>II<079C1FFC387C703C601CE01CE01CE01CE01C601C703C387C 1FFC079C001C001C001C001C001C007F007F10157F8D12>II<1FF03FF06070C070E0007F00 3FE00FF000786018E018F030FFE0DFC00D0E7E8D12>I<06000E000E000E007FF8FFF80E 000E000E000E000E000E000E000E380E380E3807F003C00D127F9112>IIII<7C7C7C7C1CF00EE00F C007C00380078007C00EE01EF01C70FC7EFC7E0F0E7F8D12>II<3FFC7FFC7038707000E001C0038007000E001C1C381C701CFFFCFFFC0E0E7F8D12> I124 D E /Fg 47 122 df<003FC00001F0300003C0380007C07C000F807C000F807C000F8038 000F8000000F8000000F8000000F800000FFFFFC00FFFFFC000F807C000F807C000F807C 000F807C000F807C000F807C000F807C000F807C000F807C000F807C000F807C000F807C 000F807C000F807C007FE1FF807FE1FF80191D809C1B>12 D<78FCFCFEFE7A0202040408 083040070E7D850D>44 DI<00038000000380000007 C0000007C0000007C000000FE000000FE000001FF000001BF000001BF0000031F8000031 F8000061FC000060FC0000E0FE0000C07E0000C07E0001803F0001FFFF0003FFFF800300 1F8003001F8006000FC006000FC00E000FE00C0007E0FFC07FFEFFC07FFE1F1C7E9B24> 65 DI<001FE02000FFF8E003F80FE007C003E00F8001E01F00 00E03E0000E03E0000607E0000607C000060FC000000FC000000FC000000FC000000FC00 0000FC000000FC000000FC0000007C0000607E0000603E0000603E0000C01F0000C00F80 018007C0030003F80E0000FFFC00001FE0001B1C7D9B22>II< FFFFFF00FFFFFF000FC01F000FC007000FC003000FC003800FC003800FC181800FC18180 0FC181800FC180000FC380000FFF80000FFF80000FC380000FC180000FC180000FC18060 0FC180600FC000E00FC000C00FC000C00FC001C00FC001C00FC003C00FC00F80FFFFFF80 FFFFFF801B1C7E9B1F>II<000FF008007FFE3801FC07F807E0 01F80F8000781F0000783F0000383E0000387E0000187C000018FC000000FC000000FC00 0000FC000000FC000000FC000000FC007FFFFC007FFF7C0001F87E0001F83E0001F83F00 01F81F0001F80F8001F807E001F801FC07F8007FFE78000FF818201C7D9B26>III75 DIII<003FE00001F07C0003C01E000F800F801F0007C01E0003C03E0003E0 7E0003F07C0001F07C0001F0FC0001F8FC0001F8FC0001F8FC0001F8FC0001F8FC0001F8 FC0001F8FC0001F87C0001F07E0003F07E0003F03E0003E03F0007E01F0007C00F800F80 03C01E0001F07C00003FE0001D1C7D9B24>II<003FE00001F0 7C0003C01E000F800F801F0007C01F0007C03E0003E07E0003F07C0001F07C0001F0FC00 01F8FC0001F8FC0001F8FC0001F8FC0001F8FC0001F8FC0001F8FC0001F87C0001F07C00 01F07E0003F03E0003E03E0703E01F08C7C00F906F8003D07E0001F87C00003FF8080000 380800003C1800003FF800001FF800001FF000000FF0000007E0000003C01D247D9B24> II<07F8201FFEE03C07E07801E07000E0F000E0F00060F00060F80000FE0000FFE0 007FFE003FFF003FFF800FFFC007FFE0007FE00003F00001F00000F0C000F0C000F0C000 E0E000E0F001C0FC03C0EFFF0083FC00141C7D9B1B>I<7FFFFFE07FFFFFE0781F81E070 1F80E0601F8060E01F8070C01F8030C01F8030C01F8030C01F8030001F8000001F800000 1F8000001F8000001F8000001F8000001F8000001F8000001F8000001F8000001F800000 1F8000001F8000001F8000001F8000001F800007FFFE0007FFFE001C1C7E9B21>I 86 D89 D<0FF8001C1E003E0F803E07803E07C01C07C00007C0007FC007E7C01F07 C03C07C07C07C0F807C0F807C0F807C0780BC03E13F80FE1F815127F9117>97 DI<03FC000E0E001C1F003C1F0078 1F00780E00F80000F80000F80000F80000F80000F800007800007801803C01801C03000E 0E0003F80011127E9115>I<000FF0000FF00001F00001F00001F00001F00001F00001F0 0001F00001F00001F001F9F00F07F01C03F03C01F07801F07801F0F801F0F801F0F801F0 F801F0F801F0F801F07801F07801F03C01F01C03F00F0FFE03F9FE171D7E9C1B>I<01FC 000F07001C03803C01C07801C07801E0F801E0F801E0FFFFE0F80000F80000F800007800 007C00603C00601E00C00F038001FC0013127F9116>I<007F0001E38003C7C00787C00F 87C00F83800F80000F80000F80000F80000F8000FFF800FFF8000F80000F80000F80000F 80000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80007FF8007F F800121D809C0F>I<03F8F00E0F381E0F381C07303C07803C07803C07803C07801C0700 1E0F000E0E001BF8001000001800001800001FFF001FFFC00FFFE01FFFF07801F8F00078 F00078F000787000707800F01E03C007FF00151B7F9118>II<1E003F003F003F003F001E00000000000000000000000000FF 00FF001F001F001F001F001F001F001F001F001F001F001F001F001F001F00FFE0FFE00B 1E7F9D0E>I107 DIII<01FC000F07801C01C03C01E07800F07800F0F800F8F800F8F800F8F8 00F8F800F8F800F87800F07800F03C01E01E03C00F078001FC0015127F9118>II<03F0600F0CE01E07E03C03E07C03E07803E0F803E0F803E0F803 E0F803E0F803E0F803E07803E07C03E03C03E01C07E00E0FE003F3E00003E00003E00003 E00003E00003E00003E0001FFC001FFC161A7E9119>II<1FD830786018E018E018F000FF807FE07FF01FF807FC007C C01CC01CE01CE018F830CFC00E127E9113>I<0300030003000300070007000F000F003F FCFFFC1F001F001F001F001F001F001F001F001F001F0C1F0C1F0C1F0C0F08079803F00E 1A7F9913>III120 DI E /Fh 52 122 df<020408103020604040C0C0C0C0C0C0C0C0404060203010080402071A7F920C >40 D<8040201018080C0404060606060606060604040C081810204080071A7E920C>I< 40E060202040408003087E8209>44 D<40E04003037E8209>46 D<1F00318060C04040C0 60C060C060C060C060C060C060C060404060C031801F000B107F8F0F>48 D<0C003C00CC000C000C000C000C000C000C000C000C000C000C000C000C00FF8009107E 8F0F>I<0300030007000F000B001300330023004300C300FFE003000300030003001FE0 0B107F8F0F>52 D<20803F002C002000200020002F0030802040006000600060C06080C0 61801F000B107F8F0F>I<1F00318060C0C040C060C060C06040E021E01E600060004060 C0608043003E000B107F8F0F>57 D<40E040000000000040E060202040408003107E8A09 >59 D<03E0000C180010040023C2004631004C0D00980C80980C80980C80980C80980C80 4C0C80463C8023C7001000000C038003FC0011117E9017>64 D66 D<03F10C0B1807300360014001C000C000C000C000C00040016001300218020C0C03F010 117E9016>III<03F100 0C0B00180700300300600100400100C00000C00000C00000C03FC0C00300400300600300 3003001803000C070003F90012117E9017>71 D<0FE00180018001800180018001800180 01800180018001800180C180C18043003E000B117E9010>74 D76 DII<03E0000C1800100400200200600300400100C00180C00180C00180 C00180C001806003006003003006003006000C180003E00011117E9017>II< FFE000181800180C00180600180600180600180C001818001FE000181800180C00180C00 180C00180C00180C20180420FF03C013117F9016>82 D<7FFF8060C18040C080C0C0C080 C04080C04000C00000C00000C00000C00000C00000C00000C00000C00000C00000C0000F FC0012117F9016>84 DIIII<3E006300018001800F8031804180C190C19063903DE00C0B7F8A0F>97 DI<1F8030C06000C000C000C000C000C000604030801F000A0B7F8A0E>I<01E0 006000600060006000600F6030E06060C060C060C060C060C060606030E01F780D117F90 11>I<1F00318060C0C0C0FFC0C000C000C000604030801F000A0B7F8A0E>I<07000D8018 00180018001800FE001800180018001800180018001800180018007E00091180900A>I< 1EF0331061806180618033003E00400060003F803FC060E0C060C060C06060C01F000C11 7F8A0F>II<30703000000000F0303030303030303030FC0612809108>I<081C 08000000003C0C0C0C0C0C0C0C0C0C0C0C0C0CC870061781910A>IIIII<1F00318060C0C060C060C060C060C06060C0 31801F000B0B7F8A0F>II114 D<3E028280783E038181C2BC080B7F8A0C>I<10103030FE3030303030 323232321C070F7F8E0C>III III E /Fi 14 119 df<0007FC0000003FFF800000FC07E00003F001F80007E000FC000FC000 7E001F80003F001F80003F003F00001F803F00001F807F00001FC07E00000FC07E00000F C0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0 FE00000FE0FE00000FE07E00000FC07F00001FC07F00001FC03F00001F803F80003F801F 80003F000FC0007E0007E000FC0003F001F80000FC07E000003FFF80000007FC00002322 7DA12A>79 D<0007FC0000003FFF800000FC07E00003F001F80007E000FC000FC0007E00 1F80003F001F80003F003F00001F803F00001F807F00001FC07E00000FC07E00000FC0FE 00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00000FE0FE00 000FE0FE00000FE07E00000FC07F00001FC07F00001FC03F00001F803F81F03F801F83F8 3F000FC70C7E0007E606FC0003F607F80000FF07E000003FFF80000007FF802000000380 20000001C020000001E0E0000001FFE0000001FFC0000000FFC0000000FFC00000007F80 0000007F000000001E00232C7DA12A>81 DI<07FC001FFF803F07C03F03E03F01E03F01F01E01F0 0001F00001F0003FF003FDF01FC1F03F01F07E01F0FC01F0FC01F0FC01F0FC01F07E02F0 7E0CF81FF87F07E03F18167E951B>97 D<00FF8007FFE00F83F01F03F03E03F07E03F07C 01E07C0000FC0000FC0000FC0000FC0000FC0000FC00007C00007E00007E00003E00301F 00600FC0E007FF8000FE0014167E9519>99 D<00FE0007FF800F87C01E01E03E01F07C00 F07C00F8FC00F8FC00F8FFFFF8FFFFF8FC0000FC0000FC00007C00007C00007E00003E00 181F00300FC07003FFC000FF0015167E951A>101 D<003F8000FFC001E3E003C7E007C7 E00F87E00F83C00F80000F80000F80000F80000F80000F8000FFFC00FFFC000F80000F80 000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80 000F80000F80000F80000F80007FF8007FF80013237FA211>I<1C003F007F007F007F00 3F001C000000000000000000000000000000FF00FF001F001F001F001F001F001F001F00 1F001F001F001F001F001F001F001F001F001F001F00FFE0FFE00B247EA310>105 D107 D110 D114 D<0180000180000180000180000380000380000780000780000F80003F8000FFFF 00FFFF000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80000F80 000F81800F81800F81800F81800F81800F830007C30003FE0000F80011207F9F16>116 DII E end %%EndProlog %%BeginSetup %%Feature: *Resolution 300dpi TeXDict begin @landscape %%EndSetup %%Page: 1 1 1 0 bop -240 -183 a Fi(Octa)n(v)n(e)14 b(Quic)n(k)f(Reference)46 b Fh(Octa)o(v)o(e)14 b(V)n(ersion)g(1.0)-240 -103 y Fg(Starting)d(Octa) o(v)o(e)-240 -58 y Ff(octave)195 b Fe(start)13 b(in)o(teractiv)o(e)i (Octa)o(v)o(e)f(session)-240 -20 y Ff(octave)e Fd(\014le)138 b Fe(run)14 b(Octa)o(v)o(e)g(on)g(commands)g(in)h Fd(\014le)-240 17 y Ff(octave)d(--help)75 b Fe(describ)q(e)14 b(command)g(line)h (options)-240 103 y Fg(Stopping)10 b(Octa)o(v)o(e)-240 149 y Ff(quit)i Fe(or)i Ff(exit)103 b Fe(exit)14 b(Octa)o(v)o(e)-240 190 y Ff(INTERRUPT)141 b Fe(\()p Fd(e.g.)20 b Ff(C-c)p Fe(\))12 b(terminate)i(curren)o(t)g(command)84 228 y(and)g(return)g(to) f(top-lev)o(el)i(prompt)-240 312 y Fg(Getting)c(Help)-240 358 y Ff(help)231 b Fe(list)15 b(all)f(commands)g(and)g(built-in)i(v)n (ariables)-240 395 y Ff(help)c Fd(c)n(ommand)76 b Fe(brie\015y)15 b(describ)q(e)f Fd(c)n(ommand)-240 432 y Ff(help)e(-i)183 b Fe(use)14 b(Info)g(to)f(bro)o(wse)h(Octa)o(v)o(e)g(man)o(ual)-240 470 y Ff(help)e(-i)i Fd(c)n(ommand)26 b Fe(searc)o(h)13 b(for)h Fd(c)n(ommand)h Fe(in)g(Octa)o(v)o(e)f(man)o(ual)-240 556 y Fg(Motion)e(in)h(Info)-240 601 y Ff(SPC)g Fe(or)g Ff(C-v)139 b Fe(scroll)14 b(forw)o(ard)f(one)h(screenful)-240 639 y Ff(DEL)f Fe(or)g Ff(M-v)139 b Fe(scroll)14 b(bac)o(kw)o(ard)g (one)f(screenful)-240 676 y Ff(C-l)249 b Fe(redra)o(w)13 b(the)h(displa)o(y)-240 760 y Fg(No)q(de)g(Selection)d(in)h(Info)-240 806 y Ff(n)285 b Fe(select)14 b(the)g(next)g(no)q(de)-240 843 y Ff(p)285 b Fe(select)14 b(the)g(previous)g(no)q(de)-240 881 y Ff(u)285 b Fe(select)14 b(the)g(`up')h(no)q(de)-240 918 y Ff(t)285 b Fe(select)14 b(the)g(`top')g(no)q(de)-240 955 y Ff(d)285 b Fe(select)14 b(the)g(directory)g(no)q(de)-240 993 y Ff(<)285 b Fe(select)14 b(the)g(\014rst)f(no)q(de)h(in)h(the)e (curren)o(t)h(\014le)-240 1030 y Ff(>)285 b Fe(select)14 b(the)g(last)f(no)q(de)h(in)h(the)f(curren)o(t)g(\014le)-240 1067 y Ff(g)285 b Fe(reads)14 b(the)f(name)h(of)g(a)f(no)q(de)h(and)g (selects)g(it)-240 1105 y Ff(C-x)f(k)218 b Fe(kills)16 b(the)d(curren)o(t)i(no)q(de)-240 1180 y Fg(Searc)o(hing)c(in)i(Info) -240 1225 y Ff(s)285 b Fe(searc)o(h)13 b(for)h(a)f(string)-240 1263 y Ff(C-s)249 b Fe(searc)o(h)13 b(forw)o(ard)h(incremen)o(tally) -240 1300 y Ff(C-r)249 b Fe(searc)o(h)13 b(bac)o(kw)o(ard)h(incremen)o (tally)-240 1337 y Ff(i)285 b Fe(searc)o(h)13 b(index)j(&)e(go)f(to)g (corresp)q(onding)h(no)q(de)-240 1375 y Ff(,)285 b Fe(go)13 b(to)g(next)i(matc)o(h)e(from)h(last)g(`i')h(command)-240 1459 y Fg(Command-Line)c(Cursor)i(Motion)-240 1505 y Ff(C-b)249 b Fe(mo)o(v)o(e)14 b(bac)o(k)g(one)g(c)o(haracter)-240 1542 y Ff(C-f)249 b Fe(mo)o(v)o(e)14 b(forw)o(ard)f(one)h(c)o(haracter) -240 1579 y Ff(C-a)249 b Fe(mo)o(v)o(e)14 b(the)g(the)g(start)f(of)h (the)g(line)-240 1617 y Ff(C-e)249 b Fe(mo)o(v)o(e)14 b(to)f(the)h(end)h(of)e(the)h(line)-240 1654 y Ff(M-f)249 b Fe(mo)o(v)o(e)14 b(forw)o(ard)f(a)h(w)o(ord)-240 1691 y Ff(M-b)249 b Fe(mo)o(v)o(e)14 b(bac)o(kw)o(ard)g(a)f(w)o(ord)-240 1729 y Ff(C-l)249 b Fe(clear)13 b(screen,)h(reprin)o(ting)h(curren)o(t) f(line)h(at)e(top)-240 1813 y Fg(Inserting)e(or)i(Changing)f(T)l(ext) -240 1859 y Ff(M-TAB)213 b Fe(insert)14 b(a)g(tab)f(c)o(haracter)-240 1896 y Ff(DEL)249 b Fe(delete)14 b(c)o(haracter)e(to)i(the)g(left)g(of) g(the)f(cursor)-240 1933 y Ff(C-d)249 b Fe(delete)14 b(c)o(haracter)e(under)j(the)f(cursor)-240 1971 y Ff(C-v)249 b Fe(add)14 b(the)g(next)g(c)o(haracter)f(v)o(erbatim)-240 2008 y Ff(C-t)249 b Fe(transp)q(ose)13 b(c)o(haracters)g(at)h(the)f(p)q (oin)o(t)-240 2046 y Ff(M-t)249 b Fe(transp)q(ose)13 b(w)o(ords)h(at)f(the)h(p)q(oin)o(t)-240 2128 y Fc([)f(])h Fh(surround)f(optional)j(argumen)o(ts)41 b(...)20 b(sho)o(w)14 b(one)f(or)h(more)f(argumen)o(ts)-165 2175 y(Cop)o(yrigh)o(t)i(1994,)g (John)e(W.)h(Eaton)62 b(P)o(ermissions)14 b(on)g(bac)o(k)p 750 -217 1 9 v 750 2175 V 810 -183 a Fg(Killing)d(and)i(Y)l(anking)810 -138 y Ff(C-k)249 b Fe(kill)16 b(to)d(the)h(end)g(of)g(the)g(line)810 -100 y Ff(C-y)249 b Fe(y)o(ank)15 b(the)f(most)f(recen)o(tly)i(killed)g (text)810 -63 y Ff(M-d)249 b Fe(kill)16 b(to)d(the)h(end)g(of)g(the)g (curren)o(t)g(w)o(ord)810 -26 y Ff(M-DEL)213 b Fe(kill)16 b(the)d(w)o(ord)h(b)q(ehind)h(the)f(cursor)810 12 y Ff(M-y)249 b Fe(rotate)13 b(the)h(kill)h(ring)f(and)g(y)o(ank)h(the)f(new)f(top) 810 98 y Fg(Command)g(Completion)e(and)i(History)810 143 y Ff(TAB)249 b Fe(complete)14 b(a)f(command)h(or)f(v)n(ariable)i (name)810 181 y Ff(M-?)249 b Fe(list)15 b(p)q(ossible)g(completions)810 218 y Ff(RET)249 b Fe(en)o(ter)14 b(the)g(curren)o(t)g(line)810 255 y Ff(C-p)249 b Fe(mo)o(v)o(e)14 b(`up')h(through)f(the)g(history)h (list)810 293 y Ff(C-n)249 b Fe(mo)o(v)o(e)14 b(`do)o(wn')h(through)f (the)g(history)g(list)810 330 y Ff(M-<)249 b Fe(mo)o(v)o(e)14 b(to)g(the)f(\014rst)h(line)h(in)f(the)g(history)810 367 y Ff(M->)249 b Fe(mo)o(v)o(e)14 b(to)g(the)f(last)h(line)h(in)g (the)e(history)810 405 y Ff(C-r)249 b Fe(searc)o(h)14 b(bac)o(kw)o(ard)f(in)i(the)f(history)g(list)810 442 y Ff(C-s)249 b Fe(searc)o(h)14 b(forw)o(ard)f(in)h(the)g(history)h (list)810 491 y Ff(history)c Fc([)p Fe(-q)p Fc(])j([)p Fd(N)t Fc(])47 b Fe(list)15 b Fd(N)j Fe(previous)d(history)g(lines,)g (omitting)1134 529 y(history)f(n)o(um)o(b)q(ers)i(if)e Ff(-q)810 580 y(history)d(-w)j Fc([)p Fd(\014le)p Fc(])47 b Fe(write)14 b(history)g(to)g Fd(\014le)h Fe(\()f Ff(/.octave)p 1592 580 11 2 v 10 w(hist)e Fe(if)1134 617 y(no)i Fd(\014le)h Fe(argumen)o(t\))810 668 y Ff(history)c(-r)j Fc([)p Fd(\014le)p Fc(])47 b Fe(read)14 b(history)g(from)g Fd(\014le)i Fe(\()d Ff(/.octave)p 1618 668 V 10 w(hist)g Fe(if)1134 705 y(no)h Fd(\014le)h Fe(argumen)o(t\))810 745 y Ff(edit)p 884 745 V 11 w(history)d Fd(lines)h Fe(edit)h(and)g(then)h(run)f(previous)h (commands)1134 783 y(from)f(the)g(history)g(list)810 821 y Ff(run)p 866 821 V 12 w(history)d Fd(lines)31 b Fe(run)15 b(previous)f(commands)g(from)g(the)g(history)1134 858 y(list)845 902 y Fc([)p Fd(b)n(e)n(g)r Fc(])g([)p Fd(end)s Fc(])104 b Fe(Sp)q(ecify)15 b(the)f(\014rst)g(and)g(last)g (history)1134 939 y(commands)g(to)f(edit)i(or)e(run.)852 975 y(If)h Fd(b)n(e)n(g)i Fe(is)e(greater)f(than)h Fd(end)p Fe(,)g(rev)o(erse)f(the)h(list)h(of)f(commands)852 1013 y(b)q(efore)f(editing.)22 b(If)14 b Fd(end)i Fe(is)f(omitted,)f(select) g(commands)g(from)852 1050 y Fd(b)n(e)n(g)i Fe(to)d(the)h(end)h(of)e (the)h(history)h(list.)22 b(If)14 b(b)q(oth)g(argumen)o(ts)g(are)852 1087 y(omitted,)g(edit)g(the)g(previous)h(item)f(in)h(the)f(history)g (list.)810 1162 y Fg(Shell)d(Commands)810 1208 y Ff(cd)i Fd(dir)210 b Fe(c)o(hange)13 b(w)o(orking)h(directory)g(to)g Fd(dir)810 1245 y Ff(pwd)249 b Fe(prin)o(t)15 b(w)o(orking)f(directory) 810 1296 y Ff(ls)f Fc([)p Fd(options)p Fc(])120 b Fe(prin)o(t)15 b(directory)f(listing)810 1342 y Ff(getenv)e(\()p Fd(string)p Ff(\))60 b Fe(return)14 b(v)n(alue)h(of)e(named)i(en)o(vironmen)o(t) 1134 1379 y(v)n(ariable)810 1415 y Ff(shell)p 902 1415 V 11 w(cmd)e(\()p Fd(cmd)p Ff(\))37 b Fe(execute)14 b(arbitrary)g (shell)h(command)e(string)810 1499 y Fg(Matrices)810 1535 y Fe(Square)h(brac)o(k)o(ets)g(delimit)i(literal)e(matrices.)21 b(Commas)13 b(separate)810 1572 y(elemen)o(ts)h(on)g(the)g(same)g(ro)o (w.)20 b(Semicolons)14 b(separate)f(ro)o(ws.)810 1609 y(Commas)g(ma)o(y)i(b)q(e)e(replaced)h(b)o(y)h(spaces,)f(and)g (semicolons)g(ma)o(y)g(b)q(e)810 1647 y(replaced)g(b)o(y)h(one)e(or)g (more)h(newlines.)22 b(Elemen)o(ts)15 b(of)e(a)h(matrix)g(ma)o(y)810 1684 y(b)q(e)g(arbitrary)g(expressions,)h(pro)o(vided)g(that)f(all)g (the)g(dimensions)810 1722 y(agree.)810 1774 y Ff([)g Fd(x)p Ff(,)f Fd(y)p Ff(,)g(...)20 b(])84 b Fe(en)o(ter)14 b(a)f(ro)o(w)g(v)o(ector)810 1811 y Ff([)h Fd(x)p Ff(;)f Fd(y)p Ff(;)g(...)20 b(])84 b Fe(en)o(ter)14 b(a)f(column)i(v)o(ector) 810 1854 y Ff([)f Fd(w)p Ff(,)f Fd(x)p Ff(;)g Fd(y)p Ff(,)g Fd(z)h Ff(])76 b Fe(en)o(ter)14 b(a)f(2)p Fb(\002)p Fe(2)g(matrix)810 1938 y Fg(Ranges)810 1983 y Fd(b)n(ase)h Ff(:)20 b Fd(limit)810 2021 y(b)n(ase)14 b Ff(:)20 b Fd(incr)13 b Ff(:)20 b Fd(limit)810 2063 y Fe(Sp)q(ecify)15 b(a)f(range)f(of)g(v)n(alues)i(b)q(eginning)g(with)f Fd(b)n(ase)h Fe(with)g(no)810 2100 y(elemen)o(ts)f(greater)f(than)h Fd(limit)p Fe(.)20 b(If)14 b(it)g(is)g(omitted,)h(the)f(default)810 2137 y(v)n(alue)h(of)e Fd(incr)k Fe(is)d(1.)21 b(Negativ)o(e)13 b(incremen)o(ts)h(are)f(p)q(ermitted.)p 1800 -217 1 9 v 1800 2175 V 1860 -183 a Fg(Strings)e(and)i(Common)g(Escap)q(e)i (Sequences)1860 -137 y Fe(A)f Fd(string)e(c)n(onstant)k Fe(consists)e(of)g(a)f(sequence)h(of)g(c)o(haracters)1860 -99 y(enclosed)g(in)h(either)f(double-quote)g(or)g(single-quote)g (marks.)1860 -47 y Ff(\\\\)267 b Fe(a)14 b(literal)g(bac)o(kslash)1860 -9 y Ff(\\")267 b Fe(a)14 b(literal)g(double-quote)h(c)o(haracter)1860 28 y Ff(\\')267 b Fe(a)14 b(literal)g(single-quote)h(c)o(haracter)1860 65 y Ff(\\n)267 b Fe(newline,)15 b(ASCI)q(I)e(co)q(de)g(10)1860 103 y Ff(\\t)267 b Fe(horizon)o(tal)14 b(tab,)g(ASCI)q(I)f(co)q(de)g(9) 1860 187 y Fg(Index)g(Expressions)1860 233 y Fd(var)g Ff(\()p Fd(idx)p Ff(\))160 b Fe(select)14 b(elemen)o(ts)g(of)g(a)f(v)o (ector)1860 270 y Fd(var)g Ff(\()p Fd(idx1)p Ff(,)f Fd(idx2)p Ff(\))49 b Fe(select)14 b(elemen)o(ts)g(of)g(a)f(matrix)1895 307 y Fd(sc)n(alar)180 b Fe(select)14 b(ro)o(w)f(\(column\))h(corresp)q (onding)g(to)2184 345 y Fd(sc)n(alar)1895 379 y(ve)n(ctor)177 b Fe(select)14 b(ro)o(ws)f(\(columns\))i(corresp)q(onding)e(to)2184 416 y(the)h(elemen)o(ts)g(of)g Fd(ve)n(ctor)1895 451 y(r)n(ange)186 b Fe(select)14 b(ro)o(ws)f(\(columns\))i(corresp)q (onding)e(to)2184 488 y(the)h(elemen)o(ts)g(of)g Fd(r)n(ange)1895 528 y Ff(:)250 b Fe(select)14 b(all)g(ro)o(ws)f(\(columns\))1860 614 y Fg(Global)f(V)l(ariables)1860 659 y Ff(global)g Fd(var1)g Ff(...)50 b Fe(Declare)13 b(v)n(ariables)i(global.)1902 703 y(Global)e(v)n(ariables)i(ma)o(y)f(b)q(e)g(accessed)f(inside)i(the) f(b)q(o)q(dy)h(of)e(a)1902 740 y(function)i(without)f(ha)o(ving)g(to)g (b)q(e)f(passed)h(in)h(the)f(function)1902 777 y(parameter)f(list)h (pro)o(vided)i(they)e(are)f(also)g(declared)h(global)1902 815 y(within)h(the)f(function.)1860 889 y Fg(Selected)e(Built-in)e(V)l (ariables)1860 935 y Ff(EDITOR)195 b Fe(editor)14 b(to)f(use)h(with)h Ff(edit)p 2518 935 11 2 v 11 w(history)1860 972 y(Inf,)e(NaN)164 b Fe(IEEE)15 b(in\014nit)o(y)m(,)h(NaN)1860 1010 y Ff(LOADPATH)159 b Fe(path)14 b(to)g(searc)o(h)f(for)h(function)g(\014les)1860 1047 y Ff(PAGER)213 b Fe(program)13 b(to)h(use)g(to)f(paginate)g (output)1860 1084 y Ff(ans)249 b Fe(last)14 b(result)h(not)e (explicitly)j(assigned)1860 1122 y Ff(eps)249 b Fe(mac)o(hine)15 b(precision)1860 1159 y Ff(pi)267 b Fa(\031)1860 1196 y Ff(realmax)177 b Fe(maxim)o(um)16 b(represen)o(table)e(v)n(alue)1860 1234 y Ff(realmin)177 b Fe(minim)o(um)16 b(represen)o(table)e(v)n(alue) 1860 1300 y Ff(automatic)p 2024 1300 V 10 w(replot)128 b Fe(automatically)14 b(redra)o(w)f(plots)1860 1338 y Ff(do)p 1898 1338 V 12 w(fortran)p 2036 1338 V 10 w(indexing)80 b Fe(F)m(ortran-st)o(yle)15 b(indexing)g(of)f(matrices)1860 1375 y Ff(implicit)p 2006 1375 V 10 w(str)p 2070 1375 V 12 w(to)p 2118 1375 V 12 w(num)p 2184 1375 V 11 w(ok)39 b Fe(allo)o(w)14 b(strings)g(to)f(b)q(ecome)h(n)o(um)o(b)q(ers)1860 1412 y Ff(output)p 1970 1412 V 11 w(max)p 2035 1412 V 11 w(field)p 2136 1412 V 11 w(width)33 b Fe(maxim)o(um)16 b(n)o(umeric)e(\014eld)h(width)1860 1450 y Ff(output)p 1970 1450 V 11 w(precision)127 b Fe(min)15 b(signi\014can)o(t)f (\014gures)g(displa)o(y)o(ed)1860 1487 y Ff(page)p 1934 1487 V 11 w(screen)p 2053 1487 V 11 w(output)98 b Fe(con)o(trol)14 b(whether)f(output)i(is)f(paged)1860 1524 y Ff(prefer)p 1970 1524 V 11 w(column)p 2089 1524 V 10 w(vectors)45 b Fe(create)13 b(column)h(v)o(ectors)g(b)o(y)h(default)1860 1562 y Ff(resize)p 1970 1562 V 11 w(on)p 2017 1562 V 12 w(range)p 2119 1562 V 11 w(error)50 b Fe(automatic)13 b(resizing)i(of)e(matrices)1860 1599 y Ff(save)p 1934 1599 V 11 w(precision)163 b Fe(digits)15 b(stored)e(b)o(y)i Ff(save)e Fe(command)1860 1637 y Ff(silent)p 1970 1637 V 11 w(functions)127 b Fe(suppress)15 b(output)g(from)e(functions)1860 1674 y Ff(warn)p 1934 1674 V 11 w(divide)p 2053 1674 V 11 w(by)p 2100 1674 V 12 w(zero)86 b Fe(suppress)15 b(divide)h(b)o(y)e(zero)f(errors)1860 1740 y Ff(commas)p 1970 1740 V 11 w(in)p 2017 1740 V 12 w(literal)p 2155 1740 V 10 w(matrix)1902 1781 y Fe(con)o(trol)g(handling)i(of)f(spaces)f (in)i(matrices)1860 1833 y Ff(ignore)p 1970 1833 V 11 w(function)p 2125 1833 V 10 w(time)p 2207 1833 V 11 w(stamp)1902 1873 y Fe(ignore)e(c)o(hanges)g(in)i(function)g(\014les)f(during)h (session)1860 1926 y Ff(ok)p 1898 1926 V 12 w(to)p 1946 1926 V 12 w(lose)p 2030 1926 V 11 w(imaginary)p 2203 1926 V 10 w(part)1902 1966 y Fe(allo)o(w)e(complex)i(to)e(real)g(con)o (v)o(ersion)1860 2018 y Ff(prefer)p 1970 2018 V 11 w(zero)p 2053 2018 V 11 w(one)p 2118 2018 V 12 w(indexing)1902 2058 y Fe(if)h(am)o(biguous,)h(prefer)f(0-1)f(st)o(yle)i(indexing)p 2850 -217 1 9 v 2850 2175 V 2910 -183 a Fg(Arithmetic)c(and)i(Incremen) o(t)f(Op)q(erators)2910 -138 y Fd(x)i Ff(+)f Fd(y)225 b Fe(addition)2910 -100 y Fd(x)14 b Ff(-)f Fd(y)225 b Fe(subtraction)2910 -63 y Fd(x)14 b Ff(*)f Fd(y)225 b Fe(matrix)15 b(m)o(ultiplication)2910 -26 y Fd(x)f Ff(.*)f Fd(y)207 b Fe(elemen)o(t)14 b(b)o(y)h(elemen)o(t)f(m)o(ultiplication) 2910 12 y Fd(x)g Ff(/)f Fd(y)225 b Fe(righ)o(t)14 b(division,)j (conceptually)d(equiv)n(alen)o(t)i(to)3234 49 y Ff(\(inverse)11 b(\(y'\))h(*)i(x'\)')2910 92 y Fd(x)g Ff(./)f Fd(y)207 b Fe(elemen)o(t)14 b(b)o(y)h(elemen)o(t)f(righ)o(t)h(division)2910 129 y Fd(x)f Ff(\\)f Fd(y)225 b Fe(left)15 b(division,)h(conceptually)e (equiv)n(alen)o(t)i(to)3234 167 y Ff(inverse)11 b(\(x\))i(*)h(y)2910 209 y Fd(x)g Ff(.\\)f Fd(y)207 b Fe(elemen)o(t)14 b(b)o(y)h(elemen)o(t) f(left)h(division)2910 247 y Fd(x)f Ff(^)f Fd(y)225 b Fe(p)q(o)o(w)o(er)14 b(op)q(erator)2910 284 y Fd(x)g Ff(.^)f Fd(y)207 b Fe(elemen)o(t)14 b(b)o(y)h(elemen)o(t)f(p)q(o)o(w)o (er)g(op)q(erator)2910 322 y Ff(-)g Fd(x)255 b Fe(negation)2910 359 y Ff(+)14 b Fd(x)255 b Fe(unary)15 b(plus)g(\(a)e(no-op\))2910 396 y Fd(x)h Ff(')255 b Fe(complex)15 b(conjugate)e(transp)q(ose)2910 434 y Fd(x)h Ff(.')237 b Fe(transp)q(ose)2910 471 y Ff(++)13 b Fd(x)36 b Fe(\()p Ff(--)13 b Fd(x)p Fe(\))111 b(incremen)o(t)15 b(\(decremen)o(t\))f Fd(x)p Fe(,)g(return)g Fd(new)3234 508 y Fe(v)n(alue)2910 543 y Fd(x)g Ff(++)35 b Fe(\()p Fd(x)13 b Ff(--)p Fe(\))111 b(incremen)o(t)15 b(\(decremen)o(t\))f Fd(x)p Fe(,)g(return)g Fd(old)h Fe(v)n(alue)2910 629 y Fg(Assignmen)o(t)c(Expressions)2910 674 y Fd(var)i Ff(=)h Fd(expr)144 b Fe(assign)14 b(expression)h(to)e(v)n(ariable)2910 712 y Fd(var)g Ff(\()p Fd(idx)p Ff(\))f(=)i Fd(expr)51 b Fe(assign)14 b(expression)h(to)e(indexed)i(v)n(ariable)2910 796 y Fg(Comparison)d(and)h(Bo)q(olean)g(Op)q(erators)2910 846 y Fe(These)h(op)q(erators)e(w)o(ork)i(on)g(an)f(elemen)o(t-b)o (y-elemen)o(t)j(basis.)22 b(Both)2910 883 y(argumen)o(ts)14 b(are)f(alw)o(a)o(ys)h(ev)n(aluated.)2910 936 y Fd(x)g Ff(<)f Fd(y)225 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(less)h(than)f Fd(y)2910 973 y(x)g Ff(<=)f Fd(y)207 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(less)h(than)f(or)f(equal)h(to)g Fd(y)2910 1010 y(x)g Ff(==)f Fd(y)207 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(greater)f(than)h Fd(y)2910 1048 y(x)g Ff(>=)f Fd(y)207 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(greater)f(than)h(or)f (equal)h(to)g Fd(y)2910 1085 y(x)g Ff(>)f Fd(y)225 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(equal)h(to)e Fd(y)2910 1122 y(x)h Ff(!=)f Fd(y)207 b Fe(true)14 b(if)h Fd(x)i Fe(is)d(not)g(equal)g(to)g Fd(y)2910 1160 y(x)g Ff(&)f Fd(y)225 b Fe(true)14 b(if)h(b)q(oth)f Fd(x)j Fe(and)d Fd(y)i Fe(are)d(true)2910 1197 y Fd(x)h Ff(|)f Fd(y)225 b Fe(true)14 b(if)h(at)e(least)h(one)f(of)h Fd(x)j Fe(or)c Fd(y)j Fe(is)f(true)2910 1235 y Ff(!)21 b Fd(b)n(o)n(ol)207 b Fe(true)14 b Fd(b)n(o)n(ol)i Fe(is)f(false)2910 1309 y Fg(Short-circui)o(t)c(Bo)q(olean)i(Op)q(erators)2910 1359 y Fe(Op)q(erators)h(ev)n(aluate)g(left-to-righ)o(t,)g(exp)q (ecting)g(scalar)g(op)q(erands.)2910 1397 y(Op)q(erands)h(are)e(only)i (ev)n(aluated)f(if)g(necessary)m(,)h(stopping)f(once)2910 1434 y(o)o(v)o(erall)g(truth)h(v)n(alue)f(can)g(b)q(e)g(determined.)22 b(Op)q(erands)14 b(are)2910 1471 y(con)o(v)o(erted)g(to)g(scalars)f(b)o (y)i(applying)g(the)f Ff(all)f Fe(function.)2910 1524 y Fd(x)h Ff(&&)f Fd(y)207 b Fe(true)14 b(if)h(b)q(oth)f Fd(x)j Fe(and)d Fd(y)i Fe(are)d(true)2910 1561 y Fd(x)h Ff(||)f Fd(y)207 b Fe(true)14 b(if)h(at)e(least)h(one)f(of)h Fd(x)j Fe(or)c Fd(y)j Fe(is)f(true)2910 1645 y Fg(Op)q(erator)e (Precedence)2910 1692 y Fe(Here)g(is)i(a)e(table)h(of)f(the)h(op)q (erators)f(in)h(Octa)o(v)o(e,)h(in)f(order)g(of)2910 1730 y(increasing)g(precedence.)2910 1782 y Ff(;)28 b(,)239 b Fe(statemen)o(t)14 b(separators)2910 1820 y Ff(=)285 b Fe(assignmen)o(t,)15 b(groups)f(left)g(to)f(righ)o(t)2910 1857 y Ff(||)27 b(&&)204 b Fe(logical)14 b(\\or")e(and)i(\\and")2910 1894 y Ff(|)28 b(&)239 b Fe(elemen)o(t-wise)15 b(\\or")d(and)i(\\and") 2910 1932 y Ff(<)g(<=)f(==)g(>=)g(>)h(!=)56 b Fe(relational)14 b(op)q(erators)2910 1969 y Ff(:)285 b Fe(colon)2910 2006 y Ff(+)28 b(-)239 b Fe(addition)15 b(and)f(subtraction)2910 2044 y Ff(*)g(/)f(\\)28 b(.*)f(./)f(.\\)33 b Fe(m)o(ultiplication)16 b(and)e(division)2910 2081 y Ff(')28 b(.')221 b Fe(transp)q(ose)2910 2118 y Ff(+)28 b(-)f(++)g(--)g(!)68 b Fe(unary)15 b(min)o(us,)h (incremen)o(t,)e(logical)g(\\not")2910 2156 y Ff(^)28 b(.^)221 b Fe(exp)q(onen)o(tiation)p eop %%Page: 2 2 2 1 bop -240 -183 a Fg(Statemen)o(ts)-240 -135 y Ff(for)13 b Fd(identi\014er)e Ff(=)j Fd(expr)e(stmt-list)h Ff(endfor)-198 -94 y Fe(Execute)h Fd(stmt-list)e Fe(once)i(for)f(eac)o(h)h(column)g (of)g Fd(expr)p Fe(.)20 b(The)-198 -56 y(v)n(ariable)14 b Fd(identi\014er)d Fe(is)k(set)e(to)h(the)g(v)n(alue)g(of)g(the)g (curren)o(t)g(column)-198 -19 y(during)g(eac)o(h)g(iteration.)-240 59 y Ff(while)e(\()p Fd(c)n(ondition)p Ff(\))f Fd(stmt-list)i Ff(endwhile)-198 99 y Fe(Execute)h Fd(stmt-list)e Fe(while)j Fd(c)n(ondition)d Fe(is)i(true.)-240 168 y Ff(break)227 b Fe(exit)14 b(innermost)h(lo)q(op)-240 205 y Ff(continue)173 b Fe(go)13 b(to)g(b)q(eginning)i(of)e(innermost)i(lo)q(op)-240 242 y Ff(return)209 b Fe(return)14 b(to)f(calling)i(function)-240 329 y Ff(if)e(\()p Fd(c)n(ondition)p Ff(\))e Fd(if-b)n(o)n(dy)i Fc([)p Ff(else)f Fd(else-b)n(o)n(dy)p Fc(])h Ff(endif)-198 375 y Fe(Execute)h Fd(if-b)n(o)n(dy)e Fe(if)j Fd(c)n(ondition)d Fe(is)i(true,)h(otherwise)e(execute)h Fd(else-)-198 413 y(b)n(o)n(dy)p Fe(.)-240 462 y Ff(if)f(\()p Fd(c)n(ondition)p Ff(\))e Fd(if-b)n(o)n(dy)i Fc([)p Ff(elseif)e Fe(\()p Fd(c)n(ondition)p Fe(\))h Fd(elseif-b)n(o)n(dy)p Fc(])g Ff(endif)-198 508 y Fe(Execute)i Fd(if-b)n(o)n(dy)e Fe(if)j Fd(c)n(ondition)d Fe(is)i(true,)h(otherwise)e(execute)h(the)-198 545 y Fd(elseif-b)n(o)n(dy)e Fe(corresp)q(onding)i(to)f(the)h(\014rst)g Ff(elseif)d Fe(condition)k(that)-198 583 y(is)f(true,)g(otherwise)g (execute)f Fd(else-b)n(o)n(dy)p Fe(.)-198 624 y(An)o(y)h(n)o(um)o(b)q (er)h(of)e Ff(elseif)f Fe(clauses)i(ma)o(y)g(app)q(ear)f(in)i(an)f Ff(if)-198 662 y Fe(statemen)o(t.)-240 729 y Ff(unwind)p -130 729 11 2 v 11 w(protect)d Fd(b)n(o)n(dy)i Ff(unwind)p 204 729 V 10 w(protect)p 340 729 V 11 w(cleanup)e Fd(cle)n(anup)i Ff(end)-198 772 y Fe(Execute)h Fd(b)n(o)n(dy)p Fe(.)20 b(Execute)14 b Fd(cle)n(anup)g Fe(no)f(matter)h(ho)o(w)f(con)o(trol) -198 809 y(exits)h Fd(b)n(o)n(dy)p Fe(.)-240 898 y Fg(De\014ning)d(F)l (unctions)-240 966 y Ff(function)g Fc([)p Fd(r)n(et-list)p Fc(])h Fd(function-name)h Fc([)7 b Fe(\()p Fd(ar)n(g-list)p Fe(\))t Fc(])-205 1008 y Fd(function-b)n(o)n(dy)-240 1051 y Ff(endfunctio)o(n)-240 1121 y Fd(r)n(et-list)16 b Fe(ma)o(y)e(b)q(e)g(a)f(single)h(iden)o(ti\014er)h(or)e(a)h (comma-separated)f(list)-240 1159 y(of)h(iden)o(ti\014ers)g(delimited)i (b)o(y)f(square-brac)o(k)o(ets.)-240 1206 y Fd(ar)n(g-list)g Fe(is)g(a)e(comma-separated)g(list)i(of)e(iden)o(ti\014ers)i(and)f(ma)o (y)h(b)q(e)-240 1244 y(empt)o(y)m(.)-240 1332 y Fg(Basic)e(Matrix)g (Manipulation)o(s)-240 1378 y Ff(rows)f(\()p Fd(a)p Ff(\))165 b Fe(return)14 b(n)o(um)o(b)q(er)h(of)f(ro)o(ws)f(of)h Fd(a)-240 1415 y Ff(columns)d(\()p Fd(a)p Ff(\))112 b Fe(return)14 b(n)o(um)o(b)q(er)h(of)f(columns)g(of)g Fd(a)-240 1453 y Ff(all)f(\()p Fd(a)p Ff(\))182 b Fe(c)o(hec)o(k)14 b(if)h(all)f(elemen)o(ts)g(of)g Fd(a)i Fe(nonzero)-240 1490 y Ff(any)d(\()p Fd(a)p Ff(\))182 b Fe(c)o(hec)o(k)14 b(if)h(an)o(y)f(elemen)o(ts)g(of)g Fd(a)i Fe(nonzero)-240 1533 y Ff(find)c(\()p Fd(a)p Ff(\))165 b Fe(return)14 b(indices)h(of)f(nonzero)f(elemen)o(ts)-240 1570 y Ff(sort)f(\()p Fd(a)p Ff(\))165 b Fe(order)13 b(elemen)o(ts)i(in)f(eac)o(h)g(column)g (of)g Fd(a)-240 1608 y Ff(sum)f(\()p Fd(a)p Ff(\))182 b Fe(sum)15 b(elemen)o(ts)f(in)g(columns)h(of)f Fd(a)-240 1645 y Ff(prod)e(\()p Fd(a)p Ff(\))165 b Fe(pro)q(duct)14 b(of)g(elemen)o(ts)g(in)h(columns)f(of)g Fd(a)-240 1688 y Ff(min)f(\()p Fd(ar)n(gs)p Ff(\))139 b Fe(\014nd)14 b(minim)o(um)i(v)n(alues)-240 1725 y Ff(max)d(\()p Fd(ar)n(gs)p Ff(\))139 b Fe(\014nd)14 b(maxim)o(um)i(v)n(alues)-240 1763 y Ff(rem)d(\()p Fd(x)p Ff(,)g Fd(y)p Ff(\))136 b Fe(\014nd)14 b(remainder)g(of)g Fd(x)p Fe(/)p Fd(y)-240 1806 y Ff(reshape)d(\()p Fd(a)p Ff(,)i Fd(m)p Ff(,)g Fd(n)p Ff(\))s Fe(reformat)g Fd(a)h Fe(to)f(b)q(e)h Fd(m)f Fe(b)o(y)i Fd(n)-240 1880 y Ff(diag)d(\()p Fd(v)p Ff(,)h Fd(k)p Ff(\))120 b Fe(create)13 b(diagonal)g(matrices)-240 1923 y Ff(linspace)e(\()p Fd(b)p Ff(,)i Fd(l)p Ff(,)g Fd(n)p Ff(\))6 b Fe(create)13 b(v)o(ector)g(of)h(linearly-spaced)h (elemen)o(ts)-240 1966 y Ff(logspace)c(\()p Fd(b)p Ff(,)i Fd(l)p Ff(,)g Fd(n)p Ff(\))6 b Fe(create)13 b(v)o(ector)g(of)h (log-spaced)f(elemen)o(ts)-240 2009 y Ff(eye)g(\()p Fd(n)p Ff(,)g Fd(m)p Ff(\))122 b Fe(create)13 b Fd(n)j Fe(b)o(y)f Fd(m)h Fe(iden)o(tit)o(y)g(matrix)-240 2052 y Ff(ones)c(\()p Fd(n)p Ff(,)i Fd(m)p Ff(\))104 b Fe(create)13 b Fd(n)j Fe(b)o(y)f Fd(m)h Fe(matrix)e(of)g(ones)-240 2089 y Ff(zeros)e(\()p Fd(n)p Ff(,)h Fd(m)p Ff(\))87 b Fe(create)13 b Fd(n)j Fe(b)o(y)f Fd(m)h Fe(matrix)e(of)g(zeros)-240 2127 y Ff(rand)e(\()p Fd(n)p Ff(,)i Fd(m)p Ff(\))104 b Fe(create)13 b Fd(n)j Fe(b)o(y)f Fd(m)h Fe(matrix)e(of)g(random)g(v)n(alues)p 750 -217 1 9 v 750 2175 V 810 -183 a Fg(Linear)e(Algebra)810 -138 y Ff(chol)h(\()p Fd(a)p Ff(\))164 b Fe(Cholesky)15 b(factorization)810 -100 y Ff(det)e(\()p Fd(a)p Ff(\))182 b Fe(compute)14 b(the)g(determinan)o(t)g(of)g(a)f(matrix)810 -63 y Ff(eig)g(\()p Fd(a)p Ff(\))182 b Fe(eigen)o(v)n(alues)15 b(and)f(eigen)o(v)o(ectors)810 -20 y Ff(expm)f(\()p Fd(a)p Ff(\))164 b Fe(compute)14 b(the)g(exp)q(onen)o(tial)g(of)g(a)g(matrix) 810 23 y Ff(hess)f(\()p Fd(a)p Ff(\))164 b Fe(compute)14 b(Hessen)o(b)q(erg)f(decomp)q(osition)810 60 y Ff(inverse)e(\()p Fd(a)p Ff(\))112 b Fe(in)o(v)o(ert)15 b(a)e(square)h(matrix)810 97 y Ff(norm)f(\()p Fd(a)p Ff(,)f Fd(p)p Ff(\))116 b Fe(compute)14 b(the)g Fd(p)p Fe(-norm)f(of)h(a)g(matrix)810 135 y Ff(pinv)f(\()p Fd(a)p Ff(\))164 b Fe(compute)14 b(pseudoin)o(v)o(erse)h(of)f Fd(a)810 178 y Ff(qr)f(\()p Fd(a)p Ff(\))200 b Fe(compute)14 b(the)g(QR)g(factorization)f(of)h(a)f (matrix)810 221 y Ff(rank)g(\()p Fd(a)p Ff(\))164 b Fe(matrix)15 b(rank)810 258 y Ff(schur)d(\()p Fd(a)p Ff(\))147 b Fe(Sc)o(h)o(ur)15 b(decomp)q(osition)f(of)g(a)f(matrix)810 295 y Ff(svd)g(\()p Fd(a)p Ff(\))182 b Fe(singular)15 b(v)n(alue)f(decomp)q(osition)810 333 y Ff(syl)f(\()p Fd(a)p Ff(,)g Fd(b)p Ff(,)g Fd(c)p Ff(\))88 b Fe(solv)o(e)14 b(the)g(Sylv)o(ester)h(equation)810 419 y Fg(Equations,)e(ODEs,)g(D)o(AEs,)h(Quadrature)810 464 y Ff(*fsolve)177 b Fe(solv)o(e)14 b(nonlinear)h(algebraic)e (equations)810 502 y Ff(*lsode)195 b Fe(in)o(tegrate)13 b(nonlinear)i(ODEs)810 539 y Ff(*dassl)195 b Fe(in)o(tegrate)13 b(nonlinear)i(D)o(AEs)810 576 y Ff(*quad)213 b Fe(in)o(tegrate)13 b(nonlinear)i(functions)810 651 y Ff(perror)d(\()p Fd(nm)p Ff(,)h Fd(c)n(o)n(de)p Ff(\))5 b Fe(for)14 b(functions)h(that)e(return) i(n)o(umeric)f(co)q(des,)1134 688 y(prin)o(t)h(error)e(message)g(for)h (named)g(function)1134 726 y(and)g(giv)o(en)g(error)f(co)q(de)810 777 y Ff(*)h Fe(See)f(the)h(on-line)h(or)e(prin)o(ted)i(man)o(ual)g (for)e(the)h(complete)g(list)h(of)810 814 y(argumen)o(ts)f(for)g(these) f(functions.)810 889 y Fg(Signal)f(Pro)q(cessing)810 934 y Ff(fft)h(\()p Fd(a)p Ff(\))182 b Fe(F)m(ast)14 b(F)m(ourier)h(T)m(ransform)f(using)g(FFTP)m(A)o(CK)810 972 y Ff(ifft)f(\()p Fd(a)p Ff(\))164 b Fe(in)o(v)o(erse)15 b(FFT)f(using)h(FFTP)m(A)o(CK)810 1009 y Ff(freqz)d(\()p Fd(ar)n(gs)p Ff(\))104 b Fe(FIR)14 b(\014lter)g(frequency)h(resp)q (onse)810 1052 y Ff(sinc)e(\()p Fd(x)p Ff(\))166 b Fe(returns)14 b Ff(sin)f(\()p Fa(\031)i Ff(x\)/\()p Fa(\031)e Ff(x\))810 1133 y Fg(Image)h(Pro)q(cessing)810 1179 y Ff(colormap)d(\()p Fd(map)p Ff(\))153 b Fe(set)14 b(the)g(curren)o(t)g(colormap)810 1222 y Ff(gray2ind)d(\()p Fd(i)p Ff(,)i Fd(n)p Ff(\))156 b Fe(con)o(v)o(ert)14 b(gra)o(y)f(scale)h(to)f(Octa)o(v)o(e)h(image)810 1265 y Ff(image)e(\()p Fd(img)p Ff(,)h Fd(zo)n(om)p Ff(\))108 b Fe(displa)o(y)16 b(an)d(Octa)o(v)o(e)h(image)g(matrix)810 1308 y Ff(imagesc)d(\()p Fd(img)p Ff(,)i Fd(zo)n(om)p Ff(\))73 b Fe(displa)o(y)16 b(scaled)d(matrix)i(as)e(image)810 1351 y Ff(imshow)f(\()p Fd(img)p Ff(,)g Fd(map)p Ff(\))103 b Fe(displa)o(y)16 b(Octa)o(v)o(e)e(image)810 1388 y Ff(imshow)e(\()p Fd(i)p Ff(,)h Fd(n)p Ff(\))191 b Fe(displa)o(y)16 b(gra)o(y)d(scale)h(image)810 1425 y Ff(imshow)e(\()p Fd(r)p Ff(,)g Fd(g)p Ff(,)i Fd(b)p Ff(\))143 b Fe(displa)o(y)16 b(R)o(GB)e(image)810 1463 y Ff(ind2gray)d(\()p Fd(img)p Ff(,)h Fd(map)p Ff(\))68 b Fe(con)o(v)o(ert)14 b(Octa)o(v)o(e)g(image)f (to)h(gra)o(y)f(scale)810 1506 y Ff(ind2rgb)e(\()p Fd(img)p Ff(,)i Fd(map)p Ff(\))85 b Fe(con)o(v)o(ert)14 b(indexed)h(image)e(to)h (R)o(GB)810 1548 y Ff(loadimage)d(\()p Fd(\014le)p Ff(\))154 b Fe(load)14 b(an)f(image)h(\014le)810 1591 y Ff(rgb2ind)d(\()p Fd(r)p Ff(,)i Fd(g)p Ff(,)g Fd(b)p Ff(\))126 b Fe(con)o(v)o(ert)14 b(R)o(GB)g(to)f(Octa)o(v)o(e)h(image)810 1634 y Ff(saveimage)d(\()p Fd(\014le)p Ff(,)h Fd(img)p Ff(,)h Fd(fmt)p Ff(,)g Fd(map)p Ff(\))33 b Fe(sa)o(v)o(e)14 b(a)g(matrix)g(to)f Fd(\014le)810 1709 y Fg(Sets)810 1755 y Ff(create)p 920 1755 11 2 v 11 w(set)f(\()p Fd(a)p Ff(,)h Fd(b)p Ff(\))122 b Fe(create)13 b(ro)o(w)g(v)o(ector)g(of)h(unique)h(v)n(alues)810 1792 y Ff(complement)10 b(\()p Fd(a)p Ff(,)j Fd(b)p Ff(\))117 b Fe(elemen)o(ts)14 b(of)g Fd(b)g Fe(not)f(in)i Fd(a)810 1835 y Ff(intersectio)o(n)c(\()p Fd(a)p Ff(,)h Fd(b)p Ff(\))82 b Fe(in)o(tersection)14 b(of)g(sets)g Fd(a)f Fe(and)h Fd(b)810 1872 y Ff(union)e(\()p Fd(a)p Ff(,)h Fd(b)p Ff(\))205 b Fe(union)15 b(of)f(sets)f Fd(a)h Fe(and)g Fd(b)810 1955 y Fg(Strings)810 2001 y Ff(strcmp)e(\()p Fd(s)p Ff(,)h Fd(t)p Ff(\))195 b Fe(compare)13 b(strings)810 2044 y Ff(strcat)f(\()p Fd(s)p Ff(,)h Fd(t)p Ff(,)g(...\))110 b Fe(concatenate)12 b(strings)p 1800 -217 1 9 v 1800 2175 V 1860 -183 a Fg(C-st)o(yle)h(Input)f(and)h(Output)1860 -138 y Ff(fopen)f(\()p Fd(name)p Ff(,)h Fd(mo)n(de)p Ff(\))80 b Fe(op)q(en)14 b(\014le)g Fd(name)1860 -95 y Ff(fclose)e(\()p Fd(\014le)p Ff(\))207 b Fe(close)14 b Fd(\014le)1860 -58 y Ff(printf)e(\()p Fd(fmt)p Ff(,)g(...\))117 b Fe(formatted)14 b(output)g(to)f Ff(stdout)1860 -15 y(fprintf)f(\()p Fd(\014le)p Ff(,)g Fd(fmt)p Ff(,)h(...\))23 b Fe(formatted)14 b(output)g(to)f Fd(\014le)1860 28 y Ff(sprintf)f(\()p Fd(fmt)p Ff(,)g(...\))99 b Fe(formatted)14 b(output)g(to)f(string)1860 71 y Ff(scanf)f(\()p Fd(fmt)p Ff(\))219 b Fe(formatted)14 b(input)h(from)f Ff(stdin)1860 108 y(fscanf)e(\()p Fd(\014le)p Ff(,)h Fd(fmt)p Ff(\))125 b Fe(formatted)14 b(input)h(from)f Fd(\014le)1860 146 y Ff(sscanf)e(\()p Fd(str)p Ff(,)g Fd(fmt)p Ff(\))130 b Fe(formatted)14 b(input)h(from)f Fd(string)1860 183 y Ff(fgets)e(\()p Fd(\014le)p Ff(,)h Fd(len)p Ff(\))150 b Fe(read)14 b Fd(len)i Fe(c)o(haracters)d(from)h Fd(\014le)1860 226 y Ff(fflush)e(\()p Fd(\014le)p Ff(\))207 b Fe(\015ush)15 b(p)q(ending)f(output)h(to)e Fd(\014le)1860 263 y Ff(ftell)f(\()p Fd(\014le)p Ff(\))225 b Fe(return)14 b(\014le)g(p)q(oin)o(ter)g(p)q (osition)1860 301 y Ff(frewind)e(\()p Fd(\014le)p Ff(\))189 b Fe(mo)o(v)o(e)14 b(\014le)g(p)q(oin)o(ter)g(to)g(b)q(eginning)1860 338 y Ff(freport)282 b Fe(prin)o(t)15 b(a)f(info)g(for)g(op)q(en)f (\014les)1860 381 y Ff(fread)f(\()p Fd(\014le)p Ff(,)h Fd(size)p Ff(,)g Fd(pr)n(e)n(c)p Ff(\))47 b Fe(read)14 b(binary)g(data)g(\014les)1860 418 y Ff(fwrite)e(\()p Fd(\014le)p Ff(,)h Fd(size)p Ff(,)g Fd(pr)n(e)n(c)p Ff(\))29 b Fe(write)14 b(binary)h(data)e(\014les)1860 456 y Ff(feof)g(\()p Fd(\014le)p Ff(\))242 b Fe(determine)15 b(if)f(p)q(oin)o(ter)g(is)h(at) e(EOF)1860 503 y(A)h(\014le)f(ma)o(y)i(b)q(e)e(referenced)h(either)g(b) o(y)h(name)e(or)h(b)o(y)g(the)g(n)o(um)o(b)q(er)1860 541 y(returned)g(from)g Ff(fopen)p Fe(.)20 b(Three)13 b(\014les)h(are)f(preconnected)h(when)1860 578 y(Octa)o(v)o(e)g (starts:)21 b Ff(stdin)p Fe(,)13 b Ff(stdout)p Fe(,)f(and)i Ff(stderr)p Fe(.)1860 668 y Fg(Other)f(Input)f(and)h(Output)e (functions)1860 714 y Ff(save)i Fd(\014le)g(var)g Ff(...)44 b Fe(sa)o(v)o(e)14 b(v)n(ariables)h(in)f Fd(\014le)1860 751 y Ff(load)f Fd(\014le)173 b Fe(load)14 b(v)n(ariables)g(from)g Fd(\014le)1860 788 y Ff(disp)f(\()p Fd(var)p Ff(\))133 b Fe(displa)o(y)16 b(v)n(alue)e(of)g Fd(var)f Fe(to)g(screen)1860 874 y Fg(Miscellaneous)e(F)l(unctions)1860 920 y Ff(eval)i(\()p Fd(str)p Ff(\))141 b Fe(ev)n(aluate)14 b Fd(str)f Fe(as)h(a)f(command) 1860 957 y Ff(feval)f(\()p Fd(str)p Ff(,)h(...\))39 b Fe(ev)n(aluate)14 b(function)h(named)f(b)o(y)h Fd(str)p Fe(,)e(passing)2184 995 y(remaining)h(args)f(to)h(called)g(function) 1860 1050 y Ff(error)e(\()p Fd(message)p Ff(\))43 b Fe(prin)o(t)15 b(message)e(and)h(return)g(to)g(top)f(lev)o(el)1860 1125 y Ff(clear)f Fd(p)n(attern)93 b Fe(clear)13 b(v)n(ariables)i(matc)o (hing)f(pattern)1860 1162 y Ff(exist)e(\()p Fd(str)p Ff(\))124 b Fe(c)o(hec)o(k)14 b(existence)g(of)g(v)n(ariable)h(or)e (function)1860 1200 y Ff(who)249 b Fe(list)15 b(curren)o(t)f(v)n (ariables)1860 1274 y Fg(P)o(olynomials)1860 1320 y Ff(compan)e(\()p Fd(p)p Ff(\))129 b Fe(companion)14 b(matrix)1860 1363 y Ff(conv)f(\()p Fd(a)p Ff(,)f Fd(b)p Ff(\))118 b Fe(con)o(v)o(olution) 1860 1400 y Ff(deconv)12 b(\()p Fd(a)p Ff(,)h Fd(b)p Ff(\))82 b Fe(decon)o(v)o(olv)o(e)15 b(t)o(w)o(o)e(v)o(ectors)1860 1438 y Ff(poly)g(\()p Fd(a)p Ff(\))164 b Fe(create)13 b(p)q(olynomial)i(from)f(a)f(matrix)1860 1480 y Ff(polyderiv)e(\()p Fd(p)p Ff(\))76 b Fe(deriv)n(ativ)o(e)15 b(of)f(p)q(olynomial)1860 1523 y Ff(polyreduce)c(\()p Fd(p)p Ff(\))59 b Fe(in)o(tegral)14 b(of)g(p)q(olynomial)1860 1566 y Ff(polyval)e(\()p Fd(p)p Ff(,)g Fd(x)p Ff(\))65 b Fe(v)n(alue)15 b(of)e(p)q(olynomial)i(at)f Fd(x)1860 1609 y Ff(polyvalm)d(\()p Fd(p)p Ff(,)i Fd(x)p Ff(\))47 b Fe(v)n(alue)15 b(of)e(p)q(olynomial)i(at)f Fd(x)1860 1652 y Ff(roots)e(\()p Fd(p)p Ff(\))147 b Fe(p)q(olynomial)15 b(ro)q(ots)1860 1689 y Ff(residue)d(\()p Fd(a)p Ff(,)g Fd(b)p Ff(\))65 b Fe(partial)14 b(fraction)g(expansion)h(of)e(ratio)g Fd(a)p Fe(/)p Fd(b)1860 1775 y Fg(Statistics)1860 1821 y Ff(corrcoef)e(\()p Fd(x)p Ff(,)i Fd(y)p Ff(\))48 b Fe(correlation)13 b(co)q(e\016cien)o(t)1860 1858 y Ff(cov)g(\()p Fd(x)p Ff(,)g Fd(y)p Ff(\))136 b Fe(co)o(v)n(ariance)1860 1896 y Ff(mean)13 b(\()p Fd(a)p Ff(\))164 b Fe(mean)14 b(v)n(alue)1860 1933 y Ff(median)e(\()p Fd(a)p Ff(\))129 b Fe(median)15 b(v)n(alue)1860 1970 y Ff(std)e(\()p Fd(a)p Ff(\))182 b Fe(standard)14 b(deviation)1860 2008 y Ff(var)f(\()p Fd(a)p Ff(\))182 b Fe(v)n(ariance)p 2850 -217 V 2850 2175 V 2910 -183 a Fg(Basic)14 b(Plottin)o(g)2910 -132 y Ff(gplot)e Fc([)p Fd(r)n(anges)p Fc(])h Fd(expr)f Fc([)p Fd(using)p Fc(])h([)p Fd(title)p Fc(])f([)p Fd(style)p Fc(])145 b Fe(2D)13 b(plotting)2910 -70 y Ff(gsplot)f Fc([)p Fd(r)n(anges)p Fc(])g Fd(expr)h Fc([)p Fd(using)p Fc(])g([)p Fd(title)p Fc(])e([)p Fd(style)p Fc(])128 b Fe(3D)13 b(plotting)2946 -14 y Fd(r)n(anges)171 b Fe(sp)q(ecify)15 b(data)e(ranges)2946 24 y Fd(expr)202 b Fe(expression)15 b(to)e(plot)2946 61 y Fd(using)189 b Fe(sp)q(ecify)15 b(columns)g(to)e(plot)2946 99 y Fd(title)207 b Fe(sp)q(ecify)15 b(line)g(title)f(for)g(legend)2946 136 y Fd(style)199 b Fe(sp)q(ecify)15 b(line)g(st)o(yle)2910 185 y(If)f Fd(r)n(anges)i Fe(are)d(supplied,)j(they)f(m)o(ust)f(come)f(b)q(efore)h (the)g(expression)2910 222 y(to)g(plot.)21 b(The)14 b Fd(using)r Fe(,)h Fd(title)r Fe(,)e(and)h Fd(style)h Fe(options)f(ma)o(y)g(app)q(ear)f(in)2910 260 y(an)o(y)i(order)e(after) g Fd(expr)s Fe(.)20 b(Multiple)c(expressions)e(ma)o(y)h(b)q(e)f (plotted)2910 297 y(with)h(a)e(single)h(command)g(b)o(y)h(separating)e (them)i(with)f(commas.)2910 352 y Ff(set)f Fd(options)126 b Fe(set)14 b(plotting)g(options)2910 390 y Ff(show)f Fd(options)108 b Fe(sho)o(w)14 b(plotting)g(options)2910 427 y Ff(replot)195 b Fe(redispla)o(y)16 b(curren)o(t)e(plot)2910 465 y Ff(closeplot)141 b Fe(close)14 b(stream)f(to)h Ff(gnuplot)d Fe(pro)q(cess)2910 502 y Ff(purge)p 3002 502 11 2 v 11 w(tmp)p 3067 502 V 12 w(files)46 b Fe(clean)14 b(up)g(temp)q(orary)g(plotting)g(\014les)2910 539 y Ff(automatic)p 3074 539 V 10 w(replot)23 b Fe(built-in)16 b(v)n(ariable)2910 625 y Fg(Other)d(Plottin)o(g)e(F)l(unctions)2910 671 y Ff(plot)i(\()p Fd(ar)n(gs)p Ff(\))121 b Fe(2D)14 b(plot)g(with)g (linear)g(axes)2910 714 y Ff(semilogx)d(\()p Fd(ar)n(gs)p Ff(\))51 b Fe(2D)14 b(plot)g(with)g(logarithmic)g(x-axis)2910 757 y Ff(semilogy)d(\()p Fd(ar)n(gs)p Ff(\))51 b Fe(2D)14 b(plot)g(with)g(logarithmic)g(y-axis)2910 800 y Ff(loglog)e(\()p Fd(ar)n(gs)p Ff(\))86 b Fe(2D)14 b(plot)g(with)g(logarithmic)g(axes) 2910 842 y Ff(bar)f(\()p Fd(ar)n(gs)p Ff(\))139 b Fe(plot)14 b(bar)g(c)o(harts)2910 880 y Ff(stairs)e(\()p Fd(x)p Ff(,)h Fd(y)p Ff(\))83 b Fe(plot)14 b(stairsteps)2910 917 y Ff(hist)f(\()p Fd(y)p Ff(,)g Fd(x)p Ff(\))118 b Fe(plot)14 b(histograms)2910 992 y Ff(title)e(\()p Fd(string)p Ff(\))78 b Fe(set)14 b(plot)g(title)2910 1067 y Ff(axis)f(\()p Fd(limits)p Ff(\))97 b Fe(set)14 b(axis)g(ranges)2910 1104 y Ff(xlabel)e(\()p Fd(string)p Ff(\))60 b Fe(set)14 b(x-axis)h(lab)q(el)2910 1141 y Ff(ylabel)d(\()p Fd(string)p Ff(\))60 b Fe(set)14 b(y-axis)h(lab)q(el)2910 1192 y Ff(grid)e Fc([)p Fe(on)p Fb(j)p Fe(o\013)p Fc(])110 b Fe(set)14 b(grid)g(state)2910 1246 y Ff(hold)f Fc([)p Fe(on)p Fb(j)p Fe(o\013)p Fc(])110 b Fe(set)14 b(hold)g(state)2910 1289 y Ff(ishold)195 b Fe(return)14 b(1)g(if)g(hold)h(is)f(on,)g(0)g (otherwise)2910 1364 y Ff(mesh)f(\()p Fd(x)p Ff(,)g Fd(y)p Ff(,)g Fd(z)p Ff(\))73 b Fe(plot)14 b(3D)g(surface)2910 1402 y Ff(meshdom)e(\()p Fd(x)p Ff(,)h Fd(y)p Ff(\))65 b Fe(create)13 b(mesh)h(co)q(ordinate)f(matrices)p 2910 1589 930 2 v 2910 1673 a Fh(Edition)j(1.1)e(for)g(Octa)o(v)o(e)g(V)n (ersion)g(1.1.0.)21 b(Cop)o(yrigh)o(t)14 b(1994,)h(1995,)2910 1710 y(John)f(W.)g(Eaton)g(\(jw)o(e@c)o(he.utexas.edu\).)k(The)13 b(author)h(assumes)f(no)2910 1748 y(resp)q(onsibilit)o(y)k(for)c(an)o (y)i(errors)e(on)h(this)h(card.)2910 1810 y(This)g(card)e(ma)o(y)g(b)q (e)g(freely)h(distributed)g(under)f(the)g(terms)g(of)g(the)h(GNU)2910 1847 y(General)h(Public)g(License.)2910 1910 y(T)2927 1915 y(E)2943 1910 y(X)g(Macros)f(for)f(this)i(card)f(b)o(y)f(Roland)i (P)o(esc)o(h)f(\(p)q(esc)o(h@cygn)o(us.com\),)2910 1947 y(originall)q(y)j(for)c(the)h(GDB)g(reference)d(card)2910 2009 y(Octa)o(v)o(e)j(itself)h(is)g(free)d(soft)o(w)o(are;)i(y)o(ou)g (are)g(w)o(elcome)e(to)i(distribute)h(copies)2910 2047 y(of)f(it)h(under)d(the)i(terms)e(of)i(the)f(GNU)i(General)f(Public)h (License.)20 b(There)2910 2084 y(is)15 b(absolutely)g(no)f(w)o(arran)o (t)o(y)h(for)e(Octa)o(v)o(e.)p eop %%Trailer end userdict /end-hook known{end-hook}if %%EOF